What does Detours and the Depth of Thinking conclude, in numbers, about “The Second-Order Interest on First-Order Shortcuts: Hidden Rework Liability”?
Answer: Chapter 5 writes the second-order rework of a first-order shortcut as a liability with an implied interest rate ranging from -51.5% to +26.8%; in a year-long simulation the careful lane spends 6.4% of its hours on rework against 22.6% for the fast lane.
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: -51.5, 26.8
| saved now s = 10 h; defect prob 0.6; first-stage fix 4 h | ||||||
| q | g | L_hours | L/s | mean_stage | implied_i | latent |
| 0.5 | 1.0 | 2.35 | 0.235 | 2.00 | -51.5% | 0.0000 |
| 0.5 | 1.2 | 2.93 | 0.293 | 2.00 | -45.9% | 0.0000 |
| 0.5 | 1.5 | 4.40 | 0.440 | 2.00 | -33.7% | 0.0000 |
| 0.5 | 2.0 | 7.57 | 0.757 | 2.00 | -13.0% | 0.0000 |
| 0.5 | 3.0 | 12.71 | 1.271 | 2.00 | +12.7% | 0.0000 |
| 0.2 | 1.0 | 2.28 | 0.228 | 4.99 | -25.6% | 0.0003 |
| 0.2 | 1.2 | 6.59 | 0.659 | 4.99 | -8.0% | 0.0003 |
| 0.2 | 1.5 | 16.33 | 1.633 | 4.99 | +10.3% | 0.0003 |
| 0.2 | 2.0 | 25.09 | 2.509 | 4.99 | +20.2% | 0.0003 |
| 0.2 | 3.0 | 32.65 | 3.265 | 4.99 | +26.8% | 0.0003 |
| latent = chance the defect is still hidden after 36 stages |
Show the full program
# Chapter 5. p51: the hidden liability of a first-order shortcut
# A shortcut saves s = 10 hours now. With probability p = 0.6 it plants
# a defect. A planted defect surfaces in stage k = 1, 2, 3 and on (one stage
# = one month) with probability q (1 - q)^(k - 1); fixing it then costs
# c0 min(g^(k - 1), 25) hours, c0 = 4: growth stops at 25 times, in
# the spirit of the "two orders of magnitude" folklore at its most
# generous. Hours are discounted at 1% per stage. Expected liability
# L = p * sum_k q (1-q)^(k-1) c0 min(g^(k-1), 25) 0.99^k, 36 stages.
# The implied interest rate i solves s (1 + i)^m = L, where m is the
# mean surfacing stage. Illustrative parameters;
# the growth factor g is exactly what the field disputes (see p52).
import math
S, P, C0, DISC, K, CAP = 10.0, 0.6, 4.0, 0.99, 36, 25.0
def liability(q, g):
terms = [P * q * (1 - q) ** (k - 1) * C0 * min(g ** (k - 1), CAP)
* DISC ** k
for k in range(1, K + 1)]
probs = [q * (1 - q) ** (k - 1) for k in range(1, K + 1)]
m = math.fsum(k * pr for k, pr in zip(range(1, K + 1), probs)) / \
math.fsum(probs)
return math.fsum(terms), m, 1 - math.fsum(probs)
print("saved now s = {:.0f} h; defect prob {:.1f}; first-stage fix {:.0f} h"
.format(S, P, C0))
print(" q g L_hours L/s mean_stage implied_i latent")
for q in (0.5, 0.2):
for g in (1.0, 1.2, 1.5, 2.0, 3.0):
L, m, latent = liability(q, g)
i = (L / S) ** (1 / m) - 1
print(" {:3.1f} {:3.1f} {:8.2f} {:6.3f} {:7.2f} {:+7.1%}"
" {:6.4f}".format(q, g, L, L / S, m, i, latent))
print("latent = chance the defect is still hidden after 36 stages")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 5: The Second-Order Interest on First-Order Shortcuts: Hidden Rework Liability. 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 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
- Chapter 8 · Closing the Loop: the Holographic Decision Ledger, Field Tools and Checker Specifications