What does One Commander and the Serial Bottleneck conclude, in numbers, about “Eastern and Western Sources Examined: Han Fei's Tally of Name and Form and Smith's Pin Factory”?

Answer: Chapter 7 examines Han Fei's tally of name and form and Smith's pin factory (of the team gain of 2,400, heads give only ten).

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. printed values that match the answer: 2400

Smith: 10 persons, 48000 pins a day, 4800 per head
team gain 2400 = heads 10 x per-head gain 240
kcycle sgainefficiency
1501.001.000
2261.920.962
3182.780.926
5114.550.909
886.250.781
1077.140.714
18510.000.556
the slowest operation (5 s) caps the gain at 10.00
Show the full program
# Chapter 7. p71: Smith's pin factory through Amdahl's lens.
# Source figures (Smith 1776, Book I, Chapter 1): ten persons made
# upwards of 48000 pins a day, 4800 each; working alone, each could
# certainly not have made twenty. The team gain 48000 / 20 splits
# into heads (10) times output per head (4800 / 20): parallelism
# alone could never give more than 10.
# Model for the second half: the "eighteen distinct operations" with
# illustrative seconds per pin; k persons each take a contiguous run
# of operations (an exact dynamic programme minimises the slowest
# station). Throughput gain over one person doing all 18 with the
# same times = total / cycle; balance efficiency = total / (k cycle).
OPS = [3, 2, 4, 2, 3, 5, 2, 2, 3, 4, 2, 3, 2, 2, 3, 2, 4, 2]
TEAM, DAY, ALONE = 10, 48000, 20
per_head = DAY // TEAM
print("Smith: %d persons, %d pins a day, %d per head" % (
    TEAM, DAY, per_head))
print("team gain %d = heads %d x per-head gain %d" % (
    DAY // ALONE, TEAM, per_head // ALONE))


def best_cycle(ops, k):
    n = len(ops)
    pre = [0]
    for v in ops:
        pre.append(pre[-1] + v)
    big = pre[-1] + 1
    best = [[big] * (n + 1) for _ in range(k + 1)]
    best[0][0] = 0
    for j in range(1, k + 1):
        for i in range(1, n + 1):
            for m in range(j - 1, i):
                load = pre[i] - pre[m]
                cand = max(best[j - 1][m], load)
                if cand < best[j][i]:
                    best[j][i] = cand
    return pre[-1], best[k][n]


print("%3s %9s %8s %11s" % ("k", "cycle s", "gain", "efficiency"))
for k in [1, 2, 3, 5, 8, 10, 18]:
    total, cyc = best_cycle(OPS, k)
    print("%3d %9d %8.2f %11.3f" % (k, cyc, total / cyc,
                                    total / (k * cyc)))
print("the slowest operation (%d s) caps the gain at %.2f" % (
    max(OPS), best_cycle(OPS, 1)[0] / max(OPS)))

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 7: Eastern and Western Sources Examined: Han Fei's Tally of Name and Form and Smith's Pin Factory. 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