关于「东西方原典考辨:《韩非子》形名参同与斯密制针工场」,《单兵指挥与串行瓶颈》给出的定量结论是什么?

结论:第七章考辨《韩非子》形名参同与斯密制针工场(团队增益 2,400 倍中人头只占十倍)。

数据口径:示意参数下,把串行份额从两成降到半成使加速比增加 3.325,把智能体从十个加到一百个只增加 1.236。 书中参数均为示意;全部计算由书中程序生成。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 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
查看完整验算程序
# 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)))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《单兵硅基帝国宪章学、串行总司令决策带宽与阿姆达尔串行瓶颈破局母典》第 7 章「东西方原典考辨:《韩非子》形名参同与斯密制针工场」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 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}
}

本书其他章节结论