What does Collapsing Idea-to-Delivery Latency conclude, in numbers, about “Hand-offs, Switching and Hesitation: Three Losses Along the Chain”?

Answer: Chapter 5 weighs hand-offs, switching and hesitation: with verbal hand-offs only 0.478 of ideas pass a chain of eight without rework, and the best study time is 1.00 hour for a reversible decision against 16.00 hours for an irreversible one.

Scope of the numbers: Parameters are illustrative and all calculations are generated by the book's programs; it offers general, not individual, business guidance, promises no launch date or income, and every production deployment is carried out only after a person confirms it. Chapter 2 splits latency into four drags, decision, start-up, feedback and hand-off, with an illustrative median of 99.9 hours and P90 of 199.8 hours, the tail driven mainly by feedback and decision.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. printed values that match the answer: 0.478, 1.00

---- f = 0.90 -------- f = 0.97 ----
n pathspasskeeprunsexpectkeeprunsexpect
1041.0001.004.01.0001.004.0
21160.9001.1117.80.9701.0316.5
33280.8101.2334.60.9411.0629.8
46400.7291.3754.90.9131.1043.8
510520.6561.5279.30.8851.1358.7
615640.5901.69108.40.8591.1674.5
828880.4782.09184.00.8081.24108.9
rework share at n 6, f 0.90: 0.410 of expected time
n 6 at f 0.90 vs n 3 at f 0.97: 108.4 h vs 29.8 h
Show the full program
# Chapter 5. p51: hand-off chains - paths, fidelity and rework.
# n people touch an idea in sequence, so there are n - 1 hand-offs; a
# team of n has n (n - 1) / 2 possible two-person paths (Brooks 1975).
# Each hand-off keeps the intent intact with probability f; a mismatch
# is found only at the end, and then the whole chain runs again
# (geometric number of runs, mean 1 / f ** (n - 1)). Each hand-off
# waits w = 8 hours and each stage works 4 hours (illustrative). We
# compare f = 0.90 (verbal hand-off) with f = 0.97 (written brief plus a
# read-back by the receiver), and report the rework rate per idea.

W_WAIT = 8.0
WORK = 4.0


def chain(n, f):
    once = n * WORK + (n - 1) * W_WAIT
    keep = f ** (n - 1)
    runs = 1.0 / keep
    return once, keep, runs, once * runs


if __name__ == "__main__":
    print("                   ---- f = 0.90 ----   ---- f = 0.97 ----")
    print("   n paths  pass   keep  runs  expect   keep  runs  expect")
    for n in (1, 2, 3, 4, 5, 6, 8):
        o, k1, r1, e1 = chain(n, 0.90)
        _, k2, r2, e2 = chain(n, 0.97)
        print("   {} {:>4} {:>5.0f}  {:.3f}  {:.2f}  {:>6.1f}  {:.3f}  {:.2f}"
              "  {:>6.1f}".format(n, n * (n - 1) // 2, o, k1, r1, e1, k2,
                                  r2, e2))
    o6, _, _, e6 = chain(6, 0.90)
    o3, _, _, e3 = chain(3, 0.97)
    print("   rework share at n 6, f 0.90: {:.3f} of expected time".format(
        1.0 - o6 / e6))
    print("   n 6 at f 0.90 vs n 3 at f 0.97: {:.1f} h vs {:.1f} h".format(
        e6, e3))

Single source and citation

Fan, Y. (2026). Collapsing Idea-to-Reality Latency: Feedback-Bandwidth Limits, Zero-Friction Toolchains and High-Velocity Execution Physics (Version 1.0.0), Chapter 5: Hand-offs, Switching and Hesitation: Three Losses Along the Chain. 5D Library. DOI pending

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

BibTeX
@book{fan2026420,
  author    = {Fan, Yafu},
  title     = {Collapsing Idea-to-Reality Latency: Feedback-Bandwidth Limits, Zero-Friction Toolchains and High-Velocity Execution Physics},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book