关于「九项自动审计与一项预注册实验」,《零人工站群、支付防欺诈与现金流排队》给出的定量结论是什么?
结论:第八章给出九项自动审计与一项预注册实验。书中以标注框区分证据、16 段可运行的 Python 程序、史料与假说。
数据口径:第四章用排队论与模拟显示,突发到达把单个工作进程的 T99 推到数十秒;平均负载 0.80 时,突发需要 4 个工作进程,或 3 个加限流(拒绝 0.0005 的请求)。 书中以标注框区分证据、16 段可运行的 Python 程序、史料与假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。
quick design: 9 of 9 flags
[X] F1 tail-digit receipt match
[X] F2 instant delivery, no stake
[X] F3 subnet edges in referral graph
[X] F4 self-referral below list
[X] F5 no transition table
[X] F6 key TTL < 511 min
[X] F7 workers < 4 without shedding
[X] F8 drain < 300 s
[X] F9 reserve < 90,000
hardened design: 0 of 9 flags
[ ] F1 tail-digit receipt match
[ ] F2 instant delivery, no stake
[ ] F3 subnet edges in referral graph
[ ] F4 self-referral below list
[ ] F5 no transition table
[ ] F6 key TTL < 511 min
[ ] F7 workers < 4 without shedding
[ ] F8 drain < 300 s
[ ] F9 reserve < 90,000
Reading: each flag is a sentence from an earlier chapter
turned into a test that a script can run on a deployment's
settings. The quick build trips all nine. The hardened one
trips none, which says only that its settings agree with
this book's models - not that the models are right.查看完整验算程序
# Chapter 8. [p15] Eight automatic flags for a zero-touch site network.
# F1 receipts matched on fewer than 8 trailing digits (p01);
# F2 instant delivery with nothing at stake when caught (p02);
# F3 shared-subnet edges in the self-referral graph (p03);
# F4 level 2 cheaper by self-referral than its list price (p04);
# F5 order handlers without a transition table (p05);
# F6 idempotency keys kept shorter than the retry schedule (p06);
# F7 fewer workers than the burst requirement, and no shedding (p08);
# F8 drain time under 300 s while long streams are served (p10);
# F9 cash reserve below what a three-month shock needs (p13).
DESIGNS = {
"quick": dict(tail=4, instant=True, stake=0, subnet=True, m=3,
table=False, ttl=10, workers=1, shed=False, drain=0,
reserve=15000),
"hardened": dict(tail=None, instant=True, stake=200, subnet=False,
m=8, table=True, ttl=1440, workers=4, shed=True,
drain=300, reserve=90000),
}
def flags(d):
return [
("F1 tail-digit receipt match", d["tail"] is not None
and d["tail"] < 8),
("F2 instant delivery, no stake", d["instant"] and d["stake"] == 0),
("F3 subnet edges in referral graph", d["subnet"]),
("F4 self-referral below list", d["m"] * (39 + 3) < 299),
("F5 no transition table", not d["table"]),
("F6 key TTL < 511 min", d["ttl"] < 511),
("F7 workers < 4 without shedding", d["workers"] < 4
and not d["shed"]),
("F8 drain < 300 s", d["drain"] < 300),
("F9 reserve < 90,000", d["reserve"] < 90000),
]
if __name__ == "__main__":
for name, d in DESIGNS.items():
fl = flags(d)
n = sum(f for _, f in fl)
print(" {} design: {} of {} flags".format(name, n, len(fl)))
for label, f in fl:
print(" [{}] {}".format("X" if f else " ", label))
print("\nReading: each flag is a sentence from an earlier chapter")
print("turned into a test that a script can run on a deployment's")
print("settings. The quick build trips all nine. The hardened one")
print("trips none, which says only that its settings agree with")
print("this book's models - not that the models are right.")唯一数据源与引用
范雅福(Fan, Y.). (2026). 《零人工多站点容错架构、支付防欺诈状态机与被动现金流排队论》第 8 章「九项自动审计与一项预注册实验」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090201
DOI: 10.5281/zenodo.24090201 · 阅读本章所在专著 · 5DL-B-075 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026075,
author = {Fan, Yafu},
title = {Zero-Touch Multi-Site Fault Tolerance, Payment Anti-Fraud State Machines and Passive Cashflow Queuing},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090201},
url = {https://doi.org/10.5281/zenodo.24090201}
}