What does Human-AI Symbiosis and Parallel Agents conclude, in numbers, about “The Huainanzi, Han Xin and Shannon”?
Answer: Chapter 7 reads the Huainanzi on the ruler who knows by relying on others, the Shiji on Han Xin's "the more the better" and the emperor who "leads leaders", and Shannon: with 100 units a tree of command reaches a speedup of 84.1, a flat one 16.5.
Scope of the numbers: Its agents, rates, hours and values are illustrative models; all calculations are generated by its programs; the book is not legal, financial or employment advice and makes no claim about any particular AI product. Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's hypotheses.
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: 100, 16.5, 84.1
| units N | flat speedup | tree speedup |
|---|---|---|
| 10 | 9.5 | 9.5 |
| 30 | 20.5 | 27.9 |
| 100 | 16.5 | 84.1 |
| 300 | 6.5 | 168.6 |
| 1000 | 2.0 | 143.0 |
| flat peaks near N = 45 |
Show the full program
# Chapter 7. p14: "The more the better", but only for a commander of
# commanders. Universal Scalability Law (p05) with serial share a and
# pairwise coherency cost b. Flat: every pair of N units must reconcile.
# Tree: units reconcile only inside teams of s, and team leaders among
# themselves:
# S_tree = N / (1 + a (N - 1) + b (s (s - 1) + (N/s) (N/s - 1))).
# Illustrative a = 0.001, b = 0.0005, s = 10.
A, B, S = 0.001, 0.0005, 10
def flat(n):
return n / (1 + A * (n - 1) + B * n * (n - 1))
def tree(n):
m = n / S
return n / (1 + A * (n - 1) + B * (S * (S - 1) + m * (m - 1)))
if __name__ == "__main__":
print(" units N flat speedup tree speedup")
for n in (10, 30, 100, 300, 1000):
print(" {:7d} {:12.1f} {:12.1f}".format(n, flat(n), tree(n)))
print(" flat peaks near N = {:.0f}".format(((1 - A) / B) ** 0.5))Single source and citation
Fan, Y. (2026). Human-AI Symbiotic Cognition, Parallel Agent Pipelines and Prompt Information Bounds (Version 1.0.0), Chapter 7: The Huainanzi, Han Xin and Shannon. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-103 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026103,
author = {Fan, Yafu},
title = {Human-AI Symbiotic Cognition, Parallel Agent Pipelines and Prompt Information Bounds},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Drift to the Middle, and What Taste Adds
- Chapter 2 · How Many Bits an Instruction Must Carry
- Chapter 3 · Amdahl, Gunther and Parallel Agents
- Chapter 4 · The Serial Part Is the Commander
- Chapter 5 · Share of Time, Share of Value, and Signing Off
- Chapter 6 · An Instruction as a Noisy Channel
- Chapter 8 · Practice: A Commander's Week and a New Operator's Training