What does Detours and the Depth of Thinking conclude, in numbers, about “Roundabout Preparation: the Break-even of Building the Road First”?
Answer: Chapter 2 turns building the road first into a schedule model: with illustrative parameters the best preparation takes 20.6% of the schedule, saves 39.2% and breaks even at 59.94.
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: 20.6, 39.2, 59.94
| W | 100 units, r0 = 1.0, max lift a = 1.5, tau = 10 |
| direct push | 100.00 time units |
| d rate T(d) vs_direct | |
| 0 | 1.000 100.00 +0.00 |
| 5 | 1.590 67.89 -32.11 |
| 10 | 1.948 61.33 -38.67 |
| 15 | 2.165 61.18 -38.82 |
| 20 | 2.297 63.54 -36.46 |
| 30 | 2.425 71.23 -28.77 |
| 40 | 2.473 80.44 -19.56 |
| 60 | 2.496 100.06 +0.06 |
| 80 | 2.499 120.01 +20.01 |
| best tooling d* | 12.52; T* = 60.80; saving 39.2% |
| share of T* spent on tooling | 20.6% |
| break-even tooling (T = direct): d | 59.94 |
| smallest job for which any tooling pays: W > 6.67 |
Show the full program
# Chapter 2. p21: build the road first - detour time and its break-even
# Model (illustrative): a job needs W units of work. Pushing directly at
# rate r0 takes W / r0. A detour first spends d units of time on tooling,
# which lifts the rate to r(d) = r0 (1 + a (1 - exp(-d / tau))): the
# lift saturates at (1 + a). Total time T(d) = d + W / r(d). We find the
# best d, the largest d that still breaks even, and the smallest job for
# which any tooling pays: dT/dd < 0 at d = 0 iff W a / (r0 tau) > 1.
import math
W, R0, A, TAU = 100.0, 1.0, 1.5, 10.0
def rate(d):
return R0 * (1 + A * (1 - math.exp(-d / TAU)))
def total(d):
return d + W / rate(d)
def argmin(f, lo, hi):
gr = (math.sqrt(5) - 1) / 2
for _ in range(200):
a = hi - gr * (hi - lo)
b = lo + gr * (hi - lo)
if f(a) < f(b):
hi = b
else:
lo = a
return 0.5 * (lo + hi)
direct = W / R0
print("W = {:.0f} units, r0 = {:.1f}, max lift a = {:.1f}, tau = {:.0f}"
.format(W, R0, A, TAU))
print("direct push: {:.2f} time units".format(direct))
print(" d rate T(d) vs_direct")
for d in (0, 5, 10, 15, 20, 30, 40, 60, 80):
print(" {:3d} {:6.3f} {:7.2f} {:+7.2f}".format(
d, rate(d), total(d), total(d) - direct))
ds = argmin(total, 0.0, W)
ts = total(ds)
print("best tooling d* = {:.2f}; T* = {:.2f}; saving {:.1%}".format(
ds, ts, 1 - ts / direct))
print("share of T* spent on tooling: {:.1%}".format(ds / ts))
lo, hi = ds, W
for _ in range(200):
mid = 0.5 * (lo + hi)
if total(mid) < direct:
lo = mid
else:
hi = mid
print("break-even tooling (T = direct): d = {:.2f}".format(lo))
print("smallest job for which any tooling pays: W > {:.2f}".format(
R0 * TAU / A))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 2: Roundabout Preparation: the Break-even of Building the Road First. 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 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
- Chapter 8 · Closing the Loop: the Holographic Decision Ledger, Field Tools and Checker Specifications