What does Detours and the Depth of Thinking conclude, in numbers, about “Closing the Loop: the Holographic Decision Ledger, Field Tools and Checker Specifications”?
Answer: Chapter 8 gives the holographic decision ledger, the distilled Detour Break-even and Second-Order Rework Liability Calculator, checker specifications for the four kits and a pre-registered test whose primary comparison needs 198 decisions per arm. "Holographic" means only multi-dimensional coverage, with no mystical sense; deliberation budgets include rest. Marked boxes separate published evidence, runnable Python calculations (23 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. This is not investment advice or advice on any particular business decision, and it promises no return.
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: 198
| z_alpha/2 | 1.9600, z_beta = 0.8416 |
| H1 rework 0.30 vs 0.18 | 198 decisions per arm, 396 in all |
| power at 99 per arm | 0.507 |
| H2 log time, delta 0.1625 | 149 per arm |
| power at 74 per arm | 0.507 |
| H3 regret gap 6 h, sd 12 h | 63 per arm |
| power at 31 per arm | 0.503 |
| at 10 logged decisions a week, H1 needs 39.6 weeks |
Show the full program
# Chapter 8. p82: sample sizes for the pre-registered tests
# H1 (rework): share of decisions with any rework inside 90 days,
# ledger-and-detour arm 0.18 against shortcut-default arm 0.30.
# Two-sided alpha 0.05, power 0.80, normal approximation for two
# proportions with pooled variance under the null.
# H2 (time): log completion time, sd 0.5; detect a 15% cut in the
# geometric mean, delta = ln(1 / 0.85).
# H3 (depth): regret in hours, sd 12, detect a 6-hour gap between
# decisions stopped at k* and decisions pushed past it.
# Also: power of each test at half the planned size. Illustrative.
import math
from statistics import NormalDist
Z = NormalDist()
ALPHA, POWER = 0.05, 0.80
za, zb = Z.inv_cdf(1 - ALPHA / 2), Z.inv_cdf(POWER)
def n_prop(p1, p2):
pb = 0.5 * (p1 + p2)
num = (za * math.sqrt(2 * pb * (1 - pb)) +
zb * math.sqrt(p1 * (1 - p1) + p2 * (1 - p2))) ** 2
return math.ceil(num / (p1 - p2) ** 2)
def n_mean(sd, delta):
return math.ceil(2 * ((za + zb) * sd / delta) ** 2)
def power_mean(sd, delta, n):
return Z.cdf(delta / (sd * math.sqrt(2 / n)) - za)
def power_prop(p1, p2, n):
pb = 0.5 * (p1 + p2)
se0 = math.sqrt(2 * pb * (1 - pb) / n)
se1 = math.sqrt((p1 * (1 - p1) + p2 * (1 - p2)) / n)
return Z.cdf((abs(p1 - p2) - za * se0) / se1)
print("z_alpha/2 = {:.4f}, z_beta = {:.4f}".format(za, zb))
n1 = n_prop(0.30, 0.18)
print("H1 rework 0.30 vs 0.18: {} decisions per arm, {} in all".format(
n1, 2 * n1))
print(" power at {} per arm: {:.3f}".format(
n1 // 2, power_prop(0.30, 0.18, n1 // 2)))
d2 = math.log(1 / 0.85)
n2 = n_mean(0.5, d2)
print("H2 log time, delta {:.4f}: {} per arm".format(d2, n2))
print(" power at {} per arm: {:.3f}".format(
n2 // 2, power_mean(0.5, d2, n2 // 2)))
n3 = n_mean(12.0, 6.0)
print("H3 regret gap 6 h, sd 12 h: {} per arm".format(n3))
print(" power at {} per arm: {:.3f}".format(
n3 // 2, power_mean(12.0, 6.0, n3 // 2)))
print("at 10 logged decisions a week, H1 needs {:.1f} weeks".format(
2 * n1 / 10))Single source and citation
Fan, Y. (2026). When the Shortest Path Fails: Brachistochrone Detours, Second-Order Consequence Mapping and Holographic Deep Thinking (Version 1.0.0), Chapter 8: Closing the Loop: the Holographic Decision Ledger, Field Tools and Checker Specifications. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-384 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026384,
author = {Fan, Yafu},
title = {When the Shortest Path Fails: Brachistochrone Detours, Second-Order Consequence Mapping and Holographic Deep Thinking},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Brachistochrone: Why the Straight Line Loses to the Cycloid
- Chapter 2 · Roundabout Preparation: the Break-even of Building the Road First
- Chapter 3 · The Limits of Greed: Inside and Outside the Matroid
- Chapter 4 · One More Road and Everyone Is Slower: Braess's Paradox and Selfish Routing
- Chapter 5 · The Second-Order Interest on First-Order Shortcuts: Hidden Rework Liability
- Chapter 6 · The Optimal Depth of Deliberation: Consequence Trees, Evidence For and Against, and Tail Stress
- Chapter 7 · Classical Sources: the Sunzi on Manoeuvring, the Twenty-Second Chapter of the Laozi, and Bernoulli's Challenge