关于「决策带宽:成文宪章作缓存、更快的串行部分与管理幅度」,《单兵指挥与串行瓶颈》给出的定量结论是什么?
结论:第六章把成文宪章看成决策缓存,命中九成时十个智能体的加速比为 8.696。
数据口径:示意参数下,把串行份额从两成降到半成使加速比增加 3.325,把智能体从十个加到一百个只增加 1.236。 书中参数均为示意;全部计算由书中程序生成。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 8.696
| h r_h s_h ceiling S(N | 10) |
| 0.00 | 12.00 0.2000 5.00 3.571 |
| 0.25 | 9.25 0.1616 6.49 4.270 |
| 0.50 | 6.50 0.1193 9.23 5.310 |
| 0.75 | 3.75 0.0725 16.00 7.018 |
| 0.90 | 2.10 0.0419 28.57 8.696 |
| 0.95 | 1.55 0.0313 38.71 9.449 |
| levers at N | 10, from S = 3.571: |
| N 10 | 20 S = 4.167 |
| N 10 | 100 S = 4.808 |
| decide 2 x faster S | 5.556 |
| decide 4 x faster S | 7.692 |
| cache h | 0.50 S = 5.310 |
| cache h | 0.90 S = 8.696 |
查看完整验算程序
# Chapter 6. p61: A written constitution as a decision cache.
# Model: each item needs a = 48 min of agent work and one decision
# by the commander that takes r = 12 min when made from scratch, so
# one person alone needs 60 min (s = 0.20). A share h of decisions is
# already answered by a written rule (a constitution, a price table,
# a style sheet): looking it up costs 1 min. Effective review
# r_h = h x 1 + (1 - h) x 12. All speedups are measured against the
# original 60 minutes: S(N) = 60 / (r_h + 48 / N), ceiling 60 / r_h.
# Second lever (Hill and Marty: make the sequential part faster): the
# commander decides k times faster, r = 12 / k. Illustrative.
from fractions import Fraction as F
A, R, LOOKUP = 48, 12, 1
BASE = A + R
def speed(r, n):
return BASE / (r + F(A, n))
print("%6s %7s %8s %9s %9s" % ("h", "r_h", "s_h", "ceiling",
"S(N=10)"))
for h in [F(0), F(1, 4), F(1, 2), F(3, 4), F(9, 10), F(19, 20)]:
rh = h * LOOKUP + (1 - h) * R
s = rh / (A + rh)
print("%6.2f %7.2f %8.4f %9.2f %9.3f" % (
float(h), float(rh), float(s), float(BASE / rh),
float(speed(rh, 10))))
print("levers at N = 10, from S = %.3f:" % float(speed(F(R), 10)))
print(" N 10 -> 20 S = %.3f" % float(speed(F(R), 20)))
print(" N 10 -> 100 S = %.3f" % float(speed(F(R), 100)))
for k in [2, 4]:
print(" decide %d x faster S = %.3f" % (
k, float(speed(F(R, k), 10))))
for h in [F(1, 2), F(9, 10)]:
rh = h * LOOKUP + (1 - h) * R
print(" cache h = %.2f S = %.3f" % (
float(h), float(speed(rh, 10))))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《单兵硅基帝国宪章学、串行总司令决策带宽与阿姆达尔串行瓶颈破局母典》第 6 章「决策带宽:成文宪章作缓存、更快的串行部分与管理幅度」(版本 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}
}