What does Zero-Courier Dispatch conclude, in numbers, about “Field Tools and Checker Specifications: the Dispatch Ledger, the Intent Compilation and Task-DAG Dispatch Checker, and a Pre-Registered Test”?
Answer: Chapter 8 gives the dispatch ledger, the Intent Compilation and Task-DAG Dispatch Checker, a checker specification table grouped by the four kits, and a pre-registered test: non-inferiority of the error rate needs 1,188 agent tasks per arm, and bounding the violation rate below 0.01 needs 299 consecutive clean batches. Marked boxes separate published evidence, runnable Python calculations (22 programs), classical sources and the author's hypotheses.
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.01, 1188
| claim A: batches per arm, relay 58.4 vs dispatcher | |
| target mean | 29.2: 1 batches |
| target mean | 40.0: 3 batches |
| target mean | 50.0: 13 batches |
| claim B: agent tasks per arm | 1,188 |
| = 23 batches of 52 agent tasks | |
| simulated power at that size | 0.7990 |
| margin 0.01 instead | 4,749 tasks per arm |
Show the full program
# Chapter 8. p82: pre-registered sample sizes for the two core claims.
# Claim A: the dispatcher halves human interventions per batch against
# the hand-carried relay (illustrative baseline 58.4 per batch, from
# p61). Poisson counts, log rate ratio test, two-sided alpha 0.05,
# power 0.8. Claim B: the error rate per agent task does not rise by
# more than 0.02 over a baseline of 0.04 (non-inferiority, one-sided
# alpha 0.05, power 0.8). A seeded simulation checks the power of B.
import math
import random
from statistics import NormalDist
Z = NormalDist()
def n_poisson(m0, m1, alpha=0.05, power=0.8):
za, zb = Z.inv_cdf(1 - alpha / 2), Z.inv_cdf(power)
return math.ceil((za + zb) ** 2 * (1 / m0 + 1 / m1)
/ math.log(m1 / m0) ** 2)
def n_noninf(p, margin, alpha=0.05, power=0.8):
za, zb = Z.inv_cdf(1 - alpha), Z.inv_cdf(power)
return math.ceil((za + zb) ** 2 * 2 * p * (1 - p) / margin ** 2)
def power_b(n, p=0.04, margin=0.02, reps=2000):
rng = random.Random(40782)
za = Z.inv_cdf(0.95)
wins = 0
for _ in range(reps):
x0 = len([1 for _ in range(n) if rng.random() < p])
x1 = len([1 for _ in range(n) if rng.random() < p])
p0, p1 = x0 / n, x1 / n
se = math.sqrt((p0 * (1 - p0) + p1 * (1 - p1)) / n) or 1e-9
wins += (p1 - p0 - margin) / se < -za
return wins / reps
if __name__ == "__main__":
print("claim A: batches per arm, relay 58.4 vs dispatcher")
for m1 in (29.2, 40.0, 50.0):
print(" target mean {:>5}: {} batches".format(
m1, n_poisson(58.4, m1)))
nb = n_noninf(0.04, 0.02)
print("claim B: agent tasks per arm = {:,}".format(nb))
print(" = {} batches of 52 agent tasks".format(math.ceil(nb / 52)))
print(" simulated power at that size = {:.4f}".format(power_b(nb)))
print(" margin 0.01 instead: {:,} tasks per arm".format(
n_noninf(0.04, 0.01)))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 8: Field Tools and Checker Specifications: the Dispatch Ledger, the Intent Compilation and Task-DAG Dispatch Checker, and a Pre-Registered Test. 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 1 · Intent Compilation: a Five-Slot Rule Compiler, Asking for Missing Slots and Hierarchical Decomposition
- 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