What does One Commander and the Serial Bottleneck conclude, in numbers, about “Closing the Loop: a Weekly Decision Log, Batch Approval Windows and a Pre-Registered Test”?

Answer: Chapter 8 gives a weekly decision log (in an invented example the serial share falls from 0.2430 to 0.0841), the Serial-Share Speedup Ceiling Calculator and a pre-registered crossover design (simulated power 0.8262). Marked boxes separate published evidence, runnable Python calculations (20 programs), classical sources and the author's hypotheses.

Scope of the numbers: With illustrative parameters, cutting the serial share from a fifth to a twentieth raises the speedup by 3.325, while raising the agents from ten to a hundred adds only 1.236. Its parameters are illustrative; all calculations are generated by its programs.

中文版

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.0841, 0.2430

weekagentitemscmdmin/itspsie
A10,3202073,31216.000.24303.2460.1697
ceiling 1/s = 4.12, Amdahl S(6) = 2.709
B13,8902771,2764.610.08413.6110.1323
ceiling 1/s = 11.89, Amdahl S(6) = 4.223
Show the full program
# Chapter 8. p81: Reading the serial share from a weekly decision log.
# Model: each day the log records agent minutes (all parallel windows
# together), the number of approvals and the commander's minutes on
# them (switching included), over a 600-minute operating day with
# p = 6 parallel windows. Serial share s = cmd / (cmd + agent);
# realised speedup psi = (cmd + agent) / wall; Karp-Flatt serial
# fraction e = (1/psi - 1/p) / (1 - 1/p). Week A: approvals on demand;
# week B: two fixed approval windows a day. Invented log, exact sums.
from fractions import Fraction as F

P, WALL = 6, 600
WEEK_A = [(1500, 30, 480), (1620, 33, 528), (1380, 28, 448),
          (1560, 31, 496), (1440, 29, 464), (1500, 30, 480),
          (1320, 26, 416)]
WEEK_B = [(1980, 40, 184), (2040, 41, 188), (1920, 38, 176),
          (2100, 42, 192), (1950, 39, 180), (2010, 40, 184),
          (1890, 37, 172)]


def read(week):
    agent = cmd = items = 0
    for a, n, c in week:
        agent, items, cmd = agent + a, items + n, cmd + c
    s = F(cmd, cmd + agent)
    psi = F(cmd + agent, WALL * len(week))
    e = (1 / psi - F(1, P)) / (1 - F(1, P))
    return agent, items, cmd, s, psi, e


print("%5s %7s %6s %6s %7s %8s %7s %7s" % (
    "week", "agent", "items", "cmd", "min/it", "s", "psi", "e"))
for name, week in [("A", WEEK_A), ("B", WEEK_B)]:
    agent, items, cmd, s, psi, e = read(week)
    print("%5s %7s %6d %6s %7.2f %8.4f %7.3f %7.4f" % (
        name, "{:,}".format(agent), items, "{:,}".format(cmd),
        cmd / items, float(s), float(psi), float(e)))
    print("      ceiling 1/s = %.2f, Amdahl S(6) = %.3f" % (
        float(1 / s), float(1 / (s + (1 - s) / P))))

Single source and citation

Fan, Y. (2026). Constitutional Engineering for a One-Commander Silicon Empire: Serial Decision Bandwidth and Breaking Amdahl's Bottleneck (Version 1.0.0), Chapter 8: Closing the Loop: a Weekly Decision Log, Batch Approval Windows and a Pre-Registered Test. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-253 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026253,
  author    = {Fan, Yafu},
  title     = {Constitutional Engineering for a One-Commander Silicon Empire: Serial Decision Bandwidth and Breaking Amdahl's Bottleneck},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book