What does Zero-Courier Dispatch conclude, in numbers, about “Intent Compilation: a Five-Slot Rule Compiler, Asking for Missing Slots and Hierarchical Decomposition”?
Answer: But as soon as a tenth of the empty slots govern irreversible steps, the picture reverses. In the third row, with the same wrong-guess rate of 0.3, the mean cost of guessing rises to 7.871 and the worst single case is 400.0; the break-even point drops to 0.0265, and few habits are that accurate. The fifth row is more persuasive still. Even with a wrong-guess rate as low as 0.05, the mean cost of 1.319 is twice the cost of asking, and the worst case still exceeds two hundred.
Scope of the numbers: Its parameters are illustrative and all calculations are generated by its programs. It names no server, account, key or deployment command, and it is general business analysis, not personalised advice.
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.0265, 0.05, 0.3, 1.319, 400.0, 7.871
| q | w | irrev | ask_cost | guess_cost | worst_guess |
|---|---|---|---|---|---|
| 0.2 | 0.3 | 0.0 | 0.670 | 1.798 | 24.0 |
| 0.2 | 0.1 | 0.0 | 0.669 | 0.608 | 12.0 |
| 0.2 | 0.3 | 0.1 | 0.670 | 7.871 | 400.0 |
| 0.4 | 0.3 | 0.1 | 0.922 | 15.342 | 406.0 |
| 0.2 | 0.05 | 0.1 | 0.672 | 1.319 | 206.0 |
| P(any empty slot) at q 0.2 = 0.6723 | |||||
| break-even wrong-guess rate w* = 0.1121 | |||||
| w* when 0.1 of slots are irreversible = 0.0265 |
Show the full program
# Chapter 1. p12: guessing a missing slot versus asking for it.
# Model (illustrative): each of 5 slots is empty with probability q.
# Ask policy: one round trip per sentence with a hole, cost c_ask.
# Guess policy: each empty slot is filled from the most common past
# value and is wrong with probability w; a wrong slot costs rework R.
# If the slot governs an irreversible step, a wrong guess costs X.
# Fixed-seed Monte Carlo over 20,000 intents per row.
import math
import random
C_ASK, R, X = 1.0, 6.0, 200.0
N = 20000
def run(q, w, share_irrev):
rng = random.Random(40712)
ask, guess = [], []
for _ in range(N):
holes = [rng.random() < q for _ in range(5)]
k = holes.count(True)
ask.append(C_ASK if k else 0.0)
cost = []
for h in holes:
if h and rng.random() < w:
cost.append(X if rng.random() < share_irrev else R)
guess.append(math.fsum(cost))
return math.fsum(ask) / N, math.fsum(guess) / N, max(guess)
if __name__ == "__main__":
print(" q w irrev ask_cost guess_cost worst_guess")
for q, w, s in [(0.2, 0.3, 0.0), (0.2, 0.1, 0.0), (0.2, 0.3, 0.1),
(0.4, 0.3, 0.1), (0.2, 0.05, 0.1)]:
a, g, m = run(q, w, s)
print("{:>4} {:>5} {:>6} {:>9.3f} {:>11.3f} {:>12.1f}".format(
q, w, s, a, g, m))
# break-even accuracy with no irreversible slot: guess pays only
# when expected holes * w * R < P(any hole) * c_ask
q = 0.2
p_any = 1 - (1 - q) ** 5
w_star = p_any * C_ASK / (5 * q * R)
print("P(any empty slot) at q 0.2 = {:.4f}".format(p_any))
print("break-even wrong-guess rate w* = {:.4f}".format(w_star))
w_irr = p_any * C_ASK / (5 * q * (0.9 * R + 0.1 * X))
print("w* when 0.1 of slots are irreversible = {:.4f}".format(w_irr))Single source and citation
Fan, Y. (2026). Commander Intent Compilation, Automated DAG Task Decomposition and Zero-Courier Multi-Agent Dispatch (Version 1.0.0), Chapter 1: Intent Compilation: a Five-Slot Rule Compiler, Asking for Missing Slots and Hierarchical Decomposition. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-407 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026407,
author = {Fan, Yafu},
title = {Commander Intent Compilation, Automated DAG Task Decomposition and Zero-Courier Multi-Agent Dispatch},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 2 · The Directed Acyclic Task Graph: Kahn's Topological Sort, the Critical Path and Monte Carlo Durations
- Chapter 3 · Multi-Agent Claiming: Contract-Net Bidding, Graham's List Scheduling and Timing Anomalies
- Chapter 4 · Resource Locks: a Global Order against Deadlock, Leases for Orphaned Locks and Fencing Tokens
- Chapter 5 · Automatic Recovery after Failure: Idempotency Keys, Exponential Backoff with Jitter, Retry Budgets and Circuit Breakers
- Chapter 6 · Exception Escalation: Human Interventions, Budget Overrun, Deadline Probability and Little's Law
- Chapter 7 · Eastern and Western Sources Examined: Division into Units in Sunzi's Chapter on Momentum and Smith's Pin Factory
- Chapter 8 · Field Tools and Checker Specifications: the Dispatch Ledger, the Intent Compilation and Task-DAG Dispatch Checker, and a Pre-Registered Test