What does Demo-First Closing and 48-Hour Delivery conclude, in numbers, about “Forty-Eight Hours Is a Distribution: Sums of Module Hours, the Probability of Being on Time and the Planning Fallacy”?

Answer: Chapters 3 and 4 turn forty-eight hours into a probability: a seven-module order planned at 12.50 hours is on time with probability only 0.846; the illustrative catalogue caps orders at 6 modules; an end-of-chain buffer commits to 14.73 hours with probability 0.997, against 0.721 for padding every task; and one off-catalogue integration drags the probability down to 0.632.

Scope of the numbers: Its win rates, hours, margins, upfront shares, fees and prices are illustrative, counted in units that match no currency, client or real deal, and all calculations are generated by its programs. It is not legal advice and not individual business or financial advice; contract terms need review by a locally admitted lawyer.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.846, 12.50

single-point plan (all modes): 12.50 h of a 16 h window
lane modes A 8.00 h, B 9.50 h
lane means A 9.17 h, B 11.50 h; QA mean 3.00 h
simulated mean 14.58 h, median 14.50 h
P80 15.73 h, P95 16.98 h, P99 18.02 h
P(delivered inside the window) = 0.846
P(plan itself is met)          = 0.057
Show the full program
# Chapter 3. p31: a 48-hour promise is a probability, not a date.
# Two builders work two normal 8-hour days inside the 48 elapsed hours,
# so each lane has a 16-hour window; nobody works extra hours. Each
# catalogue module takes a triangular(min, mode, max) number of hours;
# lanes run in parallel, then both builders do QA and handover.
# Delivery time = max(lane A, lane B) + QA. Module times are
# illustrative catalogue parameters. Fixed-seed Monte Carlo, N = 20,000.
import math
import random

rng = random.Random(20261120)
N = 20000
WINDOW = 16.0
LANE_A = [("domain on client account", 0.5, 1.0, 2.0),
          ("skin applied", 2.0, 3.0, 5.0),
          ("five content pages", 3.0, 4.0, 7.0)]
LANE_B = [("booking module", 2.0, 3.0, 6.0),
          ("payment link", 1.5, 2.5, 5.0),
          ("lead form to sheet", 1.0, 2.0, 4.0),
          ("message alerts", 1.5, 2.0, 4.0)]
QA = ("QA and handover", 2.0, 3.0, 4.0)


def draw(mod):
    _, lo, mode, hi = mod
    return rng.triangular(lo, hi, mode)


def plan(mods):
    return math.fsum(m[2] for m in mods)


def mean(mods):
    return math.fsum((m[1] + m[2] + m[3]) / 3 for m in mods)


times = []
for _ in range(N):
    a = math.fsum(draw(m) for m in LANE_A)
    b = math.fsum(draw(m) for m in LANE_B)
    times.append(max(a, b) + draw(QA))
times.sort()
p_on = len([t for t in times if t <= WINDOW]) / N
single = max(plan(LANE_A), plan(LANE_B)) + QA[2]
print("single-point plan (all modes): {:.2f} h of a {:.0f} h window"
      .format(single, WINDOW))
print("lane modes A {:.2f} h, B {:.2f} h".format(plan(LANE_A),
                                               plan(LANE_B)))
print("lane means A {:.2f} h, B {:.2f} h; QA mean {:.2f} h".format(
    mean(LANE_A), mean(LANE_B), mean([QA])))
print("simulated mean {:.2f} h, median {:.2f} h".format(
    math.fsum(times) / N, times[N // 2]))
print("P80 {:.2f} h, P95 {:.2f} h, P99 {:.2f} h".format(
    times[int(0.80 * N)], times[int(0.95 * N)], times[int(0.99 * N)]))
print("P(delivered inside the window) = {:.3f}".format(p_on))
print("P(plan itself is met)          = {:.3f}".format(
    len([t for t in times if t <= single]) / N))

Single source and citation

Fan, Y. (2026). Demo-First B2B Closing, Forty-Eight-Hour Turnkey System Delivery and Scope-Creep Containment (Version 1.0.0), Chapter 3: Forty-Eight Hours Is a Distribution: Sums of Module Hours, the Probability of Being on Time and the Planning Fallacy. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-368 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026368,
  author    = {Fan, Yafu},
  title     = {Demo-First B2B Closing, Forty-Eight-Hour Turnkey System Delivery and Scope-Creep Containment},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book