What does Five-Adversary Business Wargaming conclude, in numbers, about “Field Tools and Checker Specifications: the Sandbox Planning Ledger, Backfill Calibration and a Pre-Registered Test”?
Answer: Chapter 8 gives the field tools and checker specifications, the planning ledger and a pre-registered test: after backfill the unhardened plan's ruin is rewritten as 0.6525 and the hardened plan's as 0.0040, and testing the core claim needs 62 to 199 plans per group. Marked boxes separate evidence, runnable Python calculations (22 programs), classical sources and hypotheses.
Scope of the numbers: Marked boxes separate evidence, runnable Python calculations (22 programs), classical sources and hypotheses.
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: 0.0040, 0.6525, 62
| buy rate: sandbox 0.5611; backfill 62/120 | 0.5167 [0.4281, 0.6042] |
| refund rate: sandbox 0.0410; backfill 5/62 | 0.0806 [0.0349, 0.1753] |
| deviation: buy -0.0444 (-0.079 relative); refund +0.0396 (+0.967) | |
| recalibrated value median 201.9; base refund 0.0596 | |
| plan, sandbox ruin 0.2165 [0.1990, 0.2351] cash | 3,358 |
| plan, backfilled ruin 0.6525 [0.6314, 0.6731] cash | 457 |
| hardened, sandbox ruin 0.0020 [0.0008, 0.0051] cash | 9,302 |
| hardened, backfilled ruin 0.0040 [0.0020, 0.0079] cash | 8,023 |
Show the full program
# Chapter 8. p82: backfilling a small real sample and recalibrating
# The sandbox assumed a buy probability of 0.5611 at list price and a
# base refund rate of 0.02. A synthetic "real" four-week sample of
# 120 visitors is drawn from a world that differs (value median 196,
# base refund 0.07). Wilson intervals test the two assumptions; the
# engine (p13, unchanged) is then recalibrated and rerun.
import math
import random
import statistics
ND = statistics.NormalDist()
AGENTS = ("buyer", "arbitrage", "auditor", "imitator", "liquidity")
PLAN = {"price": 199.0, "cost": 60.0, "fixed": 600.0, "fee": 0.12,
"cash0": 6000.0, "arrivals": 14.0, "med": 210.0, "sig": 0.35,
"window": 14.0, "loopholes": 3.0, "violations": 1.0,
"delay": 8.0, "runrate": 0.02, "freeze": 0.04, "lam": 2.25,
"disc": 0.15, "rate": 0.4, "exploit": 80.0, "audit": 0.06,
"fine": 600.0, "spiral": 0.85, "channels": 1.0,
"hold": 4.0, "rr0": 0.02}
def p_buy(price, ref, lam, eta, med, sig):
if ref >= price:
gl = eta * (ref - price)
else:
gl = -eta * lam * (price - ref)
need = price - gl
if need <= 1.0:
return 1.0
z = (math.log(need) - math.log(med)) / sig
return 1.0 - ND.cdf(z)
def poisson(rng, mu):
if mu <= 0.0:
return 0
lim = math.exp(-mu)
k, p = 0, rng.random()
while p > lim:
k += 1
p *= rng.random()
return k
def run_path(rng, pl, on, horizon=52):
"""One path; returns (ruin_round or 0, max_drawdown, final_cash)."""
cash = pl["cash0"]
peak, mdd = cash, 0.0
ref = pl["price"]
cum, seen, delist = 0.0, 0, 0
due = 0.0
held = {}
hist = []
for t in range(1, horizon + 1):
entered = on["imitator"] and seen and t >= seen + pl["delay"]
price = pl["price"] * (0.9 if entered else 1.0)
arr = pl["arrivals"] * (0.6 if entered else 1.0)
if on["liquidity"] and cash < 0.25 * pl["cash0"]:
price *= pl["spiral"]
if on["buyer"]:
mkt = price * 0.75 if rng.random() < pl["disc"] else price
ref += 0.3 * (mkt - ref)
pb = p_buy(price, ref, pl["lam"], 0.5, pl["med"], pl["sig"])
rr = pl["rr0"] + 0.0015 * pl["window"] + \
0.25 * max(0.0, (price - ref) / price)
else:
pb = p_buy(price, price, 1.0, 0.0, pl["med"], pl["sig"])
rr = pl["rr0"] + 0.0015 * pl["window"]
n = 0
if delist > 0:
delist -= 1
else:
n = poisson(rng, arr * pb)
gross = n * price
net = gross * (1.0 - pl["fee"]) - n * pl["cost"]
refund_now = due
due = poisson(rng, rr * n) * price
inflow = net
if on["liquidity"]:
ch = int(pl["channels"])
parts = [inflow / ch for _ in range(ch)
if rng.random() < pl["freeze"]]
stuck = math.fsum(parts)
back = t + int(pl["hold"])
held[back] = held.get(back, 0.0) + stuck
inflow -= stuck
inflow += held.pop(t, 0.0)
loss = 0.0
if on["arbitrage"]:
loss += pl["exploit"] * poisson(rng, pl["rate"] * pl["loopholes"])
if on["auditor"] and rng.random() < pl["audit"]:
found = 0
for _ in range(int(pl["violations"])):
if rng.random() < 0.7:
found += 1
loss += pl["fine"] * found
if found:
delist = 1
hist.append(gross)
if on["liquidity"] and rng.random() < pl["runrate"]:
phi = rng.uniform(0.10, 0.30)
loss += phi * math.fsum(hist[-8:])
flow = math.fsum([inflow, -pl["fixed"], -refund_now, -loss])
cash += flow
cum += flow
if on["imitator"] and not seen and cum > 3000.0:
seen = t
peak = max(peak, cash)
mdd = max(mdd, peak - cash)
if cash < 0.0:
return t, mdd, cash
return 0, mdd, cash
def wilson(k, n, z=1.959964):
p = k / n
d = 1.0 + z * z / n
c = (p + z * z / (2 * n)) / d
h = z * math.sqrt(p * (1 - p) / n + z * z / (4 * n * n)) / d
return max(0.0, c - h), min(1.0, c + h)
def scenario(pl, on, n=2000):
rng = random.Random(40613)
res = [run_path(rng, pl, on) for _ in range(n)]
ruins = sorted(r[0] for r in res if r[0])
mdds = sorted(r[1] for r in res)
fin = [r[2] for r in res]
lo, hi = wilson(len(ruins), n)
return {"ruin": len(ruins) / n, "lo": lo, "hi": hi,
"t_med": float(statistics.median(ruins)) if ruins else 0.0,
"mdd50": mdds[n // 2], "mdd95": mdds[int(0.95 * n)],
"cash": math.fsum(fin) / n}
rng = random.Random(40682)
TRUE_PB = p_buy(199.0, 199.0, 1.0, 0.0, 196.0, 0.35)
visits = 120
buys = len([1 for _ in range(visits) if rng.random() < TRUE_PB])
true_rr = 0.07 + 0.0015 * 14
refunds = len([1 for _ in range(buys) if rng.random() < true_rr])
pb_hat, rr_hat = buys / visits, refunds / buys
lo1, hi1 = wilson(buys, visits)
lo2, hi2 = wilson(refunds, buys)
pb0 = p_buy(199.0, 199.0, 1.0, 0.0, PLAN["med"], PLAN["sig"])
rr0 = PLAN["rr0"] + 0.0015 * PLAN["window"]
print("buy rate: sandbox {:.4f}; backfill {}/{} = {:.4f} "
"[{:.4f}, {:.4f}]".format(pb0, buys, visits, pb_hat, lo1, hi1))
print("refund rate: sandbox {:.4f}; backfill {}/{} = {:.4f} "
"[{:.4f}, {:.4f}]".format(rr0, refunds, buys, rr_hat, lo2, hi2))
print("deviation: buy {:+.4f} ({:+.3f} relative); refund {:+.4f} "
"({:+.3f})".format(pb_hat - pb0, (pb_hat - pb0) / pb0,
rr_hat - rr0, (rr_hat - rr0) / rr0))
med = math.exp(math.log(199.0) - 0.35 * ND.inv_cdf(1.0 - pb_hat))
cal = {"med": med, "rr0": rr_hat - 0.0015 * PLAN["window"]}
print("recalibrated value median {:.1f}; base refund {:.4f}".format(
med, cal["rr0"]))
ALL = dict.fromkeys(AGENTS, True)
hard = dict(PLAN, loopholes=0.0, violations=0.0, cash0=9000.0)
for name, pl in (("plan, sandbox", PLAN), ("plan, backfilled",
dict(PLAN, **cal)),
("hardened, sandbox", hard),
("hardened, backfilled", dict(hard, **cal))):
r = scenario(pl, ALL)
print("{:<21} ruin {:.4f} [{:.4f}, {:.4f}] cash {:>6,.0f}".format(
name, r["ruin"], r["lo"], r["hi"], r["cash"]))Single source and citation
Fan, Y. (2026). Axiom-Driven Business Wargaming, Multi-Agent Adversarial Stress-Testing and Pre-Launch Zero-Tuition Sandboxes (Version 1.0.0), Chapter 8: Field Tools and Checker Specifications: the Sandbox Planning Ledger, Backfill Calibration and a Pre-Registered Test. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-406 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026406,
author = {Fan, Yafu},
title = {Axiom-Driven Business Wargaming, Multi-Agent Adversarial Stress-Testing and Pre-Launch Zero-Tuition Sandboxes},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Axiom Table and the Round-Based Engine: Nineteen Conclusions, Zero-Intelligence Agents and a Sandbox That Can Go Bankrupt
- Chapter 2 · The Price-Sensitive Buyer: Reference Points, Loss Aversion and the Hangover after a Promotion
- Chapter 3 · The Arbitrage Speculator: a Red Team That Reads Only Our Own Rule Book, a Breach List and the Order of Repairs
- Chapter 4 · The Imitating Competitor and the Compliance Auditor: Capacity Commitment, Entry Delay and Random Checks against a Clause List
- Chapter 5 · The Liquidity Shock: Gambler's Ruin, Refund Runs and Frozen Channels
- Chapter 6 · The Joint Attack, Coverage and Global Sensitivity: Rewriting "Exhaustive" as Three Numbers That Can Be Checked
- Chapter 7 · Eastern and Western Classics: the Temple Calculation of the Sunzi and Clausewitz's Friction