What does Collapsing Idea-to-Delivery Latency conclude, in numbers, about “Closing the Loop: the Latency Ledger, Field Tools and Checker Specifications”?

Answer: Chapter 8 gives the latency ledger, the distilled Idea-to-Delivery Latency Decomposer and Loop-Bandwidth Calculator, checker specifications for four toolkits and a pre-registered test needing 79 ideas per period. Marked boxes separate published evidence, runnable Python calculations (20 programs), classical sources and the author's hypotheses.

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. standard-library Python onlyprinted values that match the answer: 79

A. z_a 1.645, z_b 0.842, log cut 0.357
   ideas needed per period: 78.7 -> 79
B. simulated power by n per period
   n  12: power 0.258
   n  30: power 0.466
   n  60: power 0.722
   n  79: power 0.807
   n 120: power 0.910
C. needed n for other cuts (sd 0.9)
   cut 0.2: n 202
   cut 0.3: n 79
   cut 0.4: n 39
   cut 0.5: n 21
Show the full program
# Chapter 8. p83: how many ideas per period before claiming a speed-up?
# Lead times lognormal with log-sd 0.9; target: detect a median cut of
# 30 % (log ratio ln(1 / 0.7)) at one-sided alpha 0.05 with power 0.80.
# Normal approximation on log hours: n = 2 (z_a + z_b)^2 sd^2 / d^2.
# Check by simulation: 2,000 replicate studies per n (fixed seed) with a
# one-sided z test on the difference of mean log hours, pooled sd.
import math
import random
import statistics

SD = 0.9
CUT = 0.30
REPS = 2000
Z_A = statistics.NormalDist().inv_cdf(0.95)
Z_B = statistics.NormalDist().inv_cdf(0.80)


def n_needed(sd, cut):
    d = math.log(1.0 / (1.0 - cut))
    return 2.0 * (Z_A + Z_B) ** 2 * sd ** 2 / d ** 2


def power_sim(n, rng):
    d = math.log(1.0 / (1.0 - CUT))
    wins = 0
    for _ in range(REPS):
        a = [rng.gauss(0.0, SD) for _ in range(n)]
        b = [rng.gauss(-d, SD) for _ in range(n)]
        sp = math.sqrt((statistics.variance(a) + statistics.variance(b))
                       / 2.0)
        z = (statistics.fmean(a) - statistics.fmean(b)) / (
            sp * math.sqrt(2.0 / n))
        if z > Z_A:
            wins += 1
    return wins / REPS


if __name__ == "__main__":
    need = n_needed(SD, CUT)
    print("A. z_a {:.3f}, z_b {:.3f}, log cut {:.3f}".format(
        Z_A, Z_B, math.log(1.0 / 0.7)))
    print("   ideas needed per period: {:.1f} -> {}".format(
        need, math.ceil(need)))
    print("B. simulated power by n per period")
    rngs = [random.Random(83001), random.Random(83002),
            random.Random(83003), random.Random(83004),
            random.Random(83005)]
    for n, rng in zip((12, 30, 60, math.ceil(need), 120), rngs):
        print("   n {:>3}: power {:.3f}".format(n, power_sim(n, rng)))
    print("C. needed n for other cuts (sd {:.1f})".format(SD))
    for cut in (0.2, 0.3, 0.4, 0.5):
        print("   cut {:.1f}: n {}".format(cut, math.ceil(n_needed(SD, cut))))

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 8: Closing the Loop: the Latency Ledger, Field Tools and Checker Specifications. 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