What does Multi-Oracle Conflict Resolution conclude, in numbers, about “The Nine-Rung Action Ladder: Turning One Number into One Move”?
Answer: Chapter 6: hedge is the widest rung at 0.4024; even at a probability of 0.701 all-in gains only 2.59 over staging but loses 48.30 more in a bad world.
Scope of the numbers: All figures come from the book's programs; it is not investment, legal, medical or psychological advice.
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.701, 2.59, 48.30
| B 1.0 | LOSS 1.0 | checkpoint accuracy 0.7 | late-money share of upside 0.8 | |
| p(good) | strategy | expected gain | expected bad-world loss | max loss |
| 0.500 | all_in | 0.00 | 100.00 | 100.0 |
| 0.500 | staged | 12.00 | 51.70 | 100.0 |
| 0.500 | probe | 11.70 | 37.00 | 100.0 |
| 0.500 | hedge | 4.25 | 14.50 | 14.5 |
| 0.500 wait 13.00 30.00 100.0 <- best mean | ||||
| 0.622 | all_in | 24.40 | 100.00 | 100.0 |
| 0.622 staged 27.54 51.70 100.0 <- best mean | ||||
| 0.622 | probe | 23.58 | 37.00 | 100.0 |
| 0.622 | hedge | 8.82 | 14.50 | 14.5 |
| 0.622 | wait | 23.49 | 30.00 | 100.0 |
| 0.701 all_in 40.20 100.00 100.0 <- best mean | ||||
| 0.701 | staged | 37.61 | 51.70 | 100.0 |
| 0.701 | probe | 31.28 | 37.00 | 100.0 |
| 0.701 | hedge | 11.79 | 14.50 | 14.5 |
| 0.701 | wait | 30.29 | 30.00 | 100.0 |
| 0.832 all_in 66.40 100.00 100.0 <- best mean | ||||
| 0.832 | staged | 54.30 | 51.70 | 100.0 |
| 0.832 | probe | 44.04 | 37.00 | 100.0 |
| 0.832 | hedge | 16.70 | 14.50 | 14.5 |
| 0.832 | wait | 41.55 | 30.00 | 100.0 |
| at p 0.500: mean gain all-in minus staged -12.00; bad-world loss saved by staging 48.30 | ||||
| at p 0.701: mean gain all-in minus staged +2.59; bad-world loss saved by staging 48.30 | ||||
Show the full program
# Chapter 6. p64: What staging, probing and hedging buy: an exact two-state ledger for a 100-unit budget.
# The world is good with probability p or bad. Deployed money returns +B per unit in a good world and loses
# LOSS per unit in a bad one. Each checkpoint shows a business signal (orders, a signed term sheet) that is
# right with probability ACC, independently. B = LOSS makes a coin-flip world worth exactly zero to all_in,
# so any edge comes from p or from the checkpoints. Invented round numbers, chosen to show shape.
# all_in 100 now
# staged 40 now; 30 more only if checkpoint one reads good; 30 more only if checkpoint two reads good
# probe 10 now; the other 90 only if one checkpoint reads good, earning DELAY of the full upside
# hedge 25 now plus 2 paid for an exit right that halves the bad-world loss on the 25
# wait 0 now; trigger: deploy 100 if one checkpoint reads good (DELAY applies), lose nothing else
B, LOSS, ACC, DELAY = 1.0, 1.0, 0.7, 0.8
def ledger(p):
out = {}
out["all_in"] = (p * 100 * B - (1 - p) * 100 * LOSS, 100 * LOSS)
# staged: in each world, the chance of reaching each tranche
ev, bad = 0.0, 0.0
for world, pw in (("good", p), ("bad", 1 - p)):
go = ACC if world == "good" else 1 - ACC # chance a checkpoint reads good
units = 40 + 30 * go + 30 * go * go
gain = units * B if world == "good" else -units * LOSS
ev += pw * gain
if world == "bad":
bad = units * LOSS
out["staged"] = (ev, bad)
ev = p * (10 * B + ACC * 90 * B * DELAY) + (1 - p) * (-(10 + (1 - ACC) * 90) * LOSS)
out["probe"] = (ev, (10 + (1 - ACC) * 90) * LOSS)
out["hedge"] = (p * (25 * B - 2) + (1 - p) * (-(25 * LOSS / 2) - 2), 25 * LOSS / 2 + 2)
out["wait"] = (p * ACC * 100 * B * DELAY - (1 - p) * (1 - ACC) * 100 * LOSS, (1 - ACC) * 100 * LOSS)
return out
if __name__ == "__main__":
print(" B {:.1f} LOSS {:.1f} checkpoint accuracy {:.1f} late-money share of upside {:.1f}".format(
B, LOSS, ACC, DELAY))
print(" p(good) strategy expected gain expected bad-world loss max loss")
for p in (0.5, 0.622, 0.701, 0.832):
rows = ledger(p)
best = max(rows, key=lambda k: rows[k][0])
for k, (ev, bad) in rows.items():
mx = 25 * LOSS / 2 + 2 if k == "hedge" else 100 * LOSS
print(" {:7.3f} {:8s} {:13.2f} {:23.2f} {:8.1f}{}".format(
p, k, ev, bad, mx, " <- best mean" if k == best else ""))
print()
for p in (0.5, 0.701):
r = ledger(p)
print(" at p {:.3f}: mean gain all-in minus staged {:+.2f}; bad-world loss saved by staging {:.2f}"
.format(p, r["all_in"][0] - r["staged"][0], r["all_in"][1] - r["staged"][1]))Single source and citation
Fan, Y. (2026). The Multi-Oracle Conflict-Resolution and Chief-of-Staff Action Codex (Version 0.1.0), Chapter 6: The Nine-Rung Action Ladder: Turning One Number into One Move. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-132 · v0.1.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026132,
author = {Fan, Yafu},
title = {The Multi-Oracle Conflict-Resolution and Chief-of-Staff Action Codex},
year = {2026},
publisher = {5D Library},
edition = {0.1.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Method: Log-Odds, the Correlation Discount, the Nine-Step Ladder and Scoring Afterwards
- Chapter 2 · Six Question Types and Their Weights: Which Voice Speaks for What
- Chapter 3 · Six Time Scales and Twenty-One Consensus Tallies: Who Overrides Whom, and When a Vote Counts
- Chapter 4 · Pairwise Conflicts I: Bazi Against Four Systems, and Ziwei Against Qimen
- Chapter 5 · Pairwise Conflicts, Part Two: the Decade, the Single Question, the Board of the Moment and the Outer Projection
- Chapter 7 · Synthesis Scripts: Saying the Verdict to the Client
- Chapter 8 · Practice: A Three-Year Exclusive Supply Contract and Five Voices at Odds