What does One Commander and the Serial Bottleneck conclude, in numbers, about “The Ceiling of the Serial Share: Amdahl's Law and the Exact Account of Twenty Percent against Five”?
Answer: The serial share is the proportion of the work that only the commander can do, in sequence; Amdahl's law says the parallel speedup is capped by its reciprocal. Program p11 shows that at a serial share of 0.20 even a thousand agents reach only 4.980; program p12 shows that cutting the serial share from 0.20 to 0.05 gains 3.325, nearly three times what going from ten agents to a hundred gains; program p13 shows that the curve has already reached half its ceiling at \((1-s)/s\) agents. Yet Amdahl assumed a fixed amount of work. If the work grows as the agents multiply, does the ceiling still stand? That is the question of the next chapter.
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.05, 0.20, 4.980
| Amdahl speedup S(N) | 1 / (s + (1 - s) / N), exact fractions |
| s N | 1 N=2 N=5 N=10 N=20 N=50 N=100 N=1000 1/s |
| 0.50 | 1.000 1.333 1.667 1.818 1.905 1.961 1.980 1.998 2.0 |
| 0.20 | 1.000 1.667 2.778 3.571 4.167 4.630 4.808 4.980 5.0 |
| 0.10 | 1.000 1.818 3.571 5.263 6.897 8.475 9.174 9.911 10.0 |
| 0.05 | 1.000 1.905 4.167 6.897 10.256 14.493 16.807 19.627 20.0 |
| 0.01 | 1.000 1.980 4.808 9.174 16.807 33.557 50.251 90.992 100.0 |
| efficiency S(N)/N at N | 10 and N = 100: |
| s | 0.50 E(10) = 0.182 E(100) = 0.020 |
| s | 0.20 E(10) = 0.357 E(100) = 0.048 |
| s | 0.10 E(10) = 0.526 E(100) = 0.092 |
| s | 0.05 E(10) = 0.690 E(100) = 0.168 |
| s | 0.01 E(10) = 0.917 E(100) = 0.503 |
| s | 0.20, N = 1000 is still 0.0199 below the ceiling 5 |
Key formula
Show the full program
# Chapter 1. p11: Amdahl's ceiling, exact speedup for serial share s.
# Model: one job takes one unit of time when a single person does it.
# A share s of it is serial (only the commander can do it: approve,
# decide, sign off); the rest 1 - s can be split evenly over N agents.
# Speedup S(N) = 1 / (s + (1 - s) / N), ceiling 1 / s as N grows.
# Exact arithmetic with fractions; the shares s are illustrative.
from fractions import Fraction as F
SHARES = [F(1, 2), F(1, 5), F(1, 10), F(1, 20), F(1, 100)]
AGENTS = [1, 2, 5, 10, 20, 50, 100, 1000]
def speedup(s, n):
return 1 / (s + (1 - s) / n)
print("Amdahl speedup S(N) = 1 / (s + (1 - s) / N), exact fractions")
head = "%6s" % "s"
for n in AGENTS:
head += "%7s" % ("N=%d" % n)
head += "%7s" % "1/s"
print(head)
for s in SHARES:
row = "%6.2f" % float(s)
for n in AGENTS:
row += "%7.3f" % float(speedup(s, n))
row += "%7.1f" % float(1 / s)
print(row)
print("efficiency S(N)/N at N = 10 and N = 100:")
for s in SHARES:
e10 = speedup(s, 10) / 10
e100 = speedup(s, 100) / 100
print(" s = %.2f E(10) = %.3f E(100) = %.3f" % (
float(s), float(e10), float(e100)))
gap = 1 / F(1, 5) - speedup(F(1, 5), 1000)
print("s = 0.20, N = 1000 is still %.4f below the ceiling 5"
% float(gap))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 1: The Ceiling of the Serial Share: Amdahl's Law and the Exact Account of Twenty Percent against Five. 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
- Chapter 2 · Does the Problem Grow? Gustafson's Law, Per-Item Review and the Measured Serial Share
- Chapter 3 · The Commander Is a Single Server: Queueing Theory, the Finite-Source Model and Little's Law
- Chapter 4 · Batch Approval Windows: Harris's Square-Root Formula and the Price of Waiting
- Chapter 5 · Send Up Only the Exceptions: Automatic Gates, Random Audits and Coordination Overhead
- Chapter 6 · Decision Bandwidth: a Written Constitution as a Cache, a Faster Serial Part and the Span of Control
- Chapter 7 · Eastern and Western Sources Examined: Han Fei's Tally of Name and Form and Smith's Pin Factory
- Chapter 8 · Closing the Loop: a Weekly Decision Log, Batch Approval Windows and a Pre-Registered Test