What does Zero-Courier Dispatch conclude, in numbers, about “Eastern and Western Sources Examined: Division into Units in Sunzi's Chapter on Momentum and Smith's Pin Factory”?
Answer: A flat organisation reaches its peak output of 13.00 at twenty-five people. At fifty people only 1.00 remains, and beyond that output is negative: communication consumes all the time there is. Three hundred people in a flat organisation have 44,850 pairwise channels. A tree with units of five keeps output proportional to headcount throughout, 270.00 for three hundred people; the price is 76 unit heads and four hops from the top to the bottom.
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: 1.00, 13.00, 270.00, 44850, 76
| n | flat_chan | flat_out | heads | hops | tree_chan | tree_out |
|---|---|---|---|---|---|---|
| 5 | 10 | 4.60 | 1 | 1 | 5 | 4.50 |
| 10 | 45 | 8.20 | 3 | 2 | 12 | 9.00 |
| 25 | 300 | 13.00 | 6 | 2 | 30 | 22.50 |
| 50 | 1,225 | 1.00 | 13 | 3 | 62 | 45.00 |
| 125 | 7,750 | -185.00 | 31 | 3 | 155 | 112.50 |
| 300 | 44,850 | -1494.00 | 76 | 4 | 375 | 270.00 |
| flat optimum n = 1 / (2c) = 25 | ||||||
| flat output at n = 25: 13.00; at n = 50: 1.00 |
Show the full program
# Chapter 7. p71: "governing many like few is a matter of division".
# Model: n executors either all talk to all (flat: n(n-1)/2 channels,
# the Brooks count) or sit in units of span s under unit heads, heads
# in turn grouped by s (a tree). Each executor yields 1 unit of work a
# day minus c per channel it must keep up (illustrative c = 0.02).
# Flat output n(1 - c(n - 1)) peaks near n = 1/(2c) and then falls;
# tree output stays linear but pays heads and depth (hops per order).
import math
def tree(n, s):
heads, level, depth = 0, n, 0
while level > 1:
level = math.ceil(level / s)
heads += level
depth += 1
return heads, depth
if __name__ == "__main__":
c, s = 0.02, 5
print(" n flat_chan flat_out heads hops tree_chan tree_out")
for n in (5, 10, 25, 50, 125, 300):
flat = n * (n - 1) // 2
f_out = n * (1 - c * (n - 1))
heads, depth = tree(n, s)
links = n + heads - 1
t_out = n * (1 - c * s)
print("{:>5} {:>10,} {:>9.2f} {:>6} {:>5} {:>10} {:>9.2f}".format(
n, flat, f_out, heads, depth, links, t_out))
print("flat optimum n = 1 / (2c) = {:.0f}".format(1 / (2 * c)))
print("flat output at n = 25: {:.2f}; at n = 50: {:.2f}".format(
25 * (1 - c * 24), 50 * (1 - c * 49)))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 7: Eastern and Western Sources Examined: Division into Units in Sunzi's Chapter on Momentum and Smith's Pin Factory. 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 8 · Field Tools and Checker Specifications: the Dispatch Ledger, the Intent Compilation and Task-DAG Dispatch Checker, and a Pre-Registered Test