关于「东西方原典考辨:窃符救赵的虎符与财政署的劈木记账符」,《数字资产灾难恢复与门限分片》给出的定量结论是什么?

结论:虎符是一个二取二方案,验证者自己持有另一半,于是窃得国君那一半就足以伪造调令;晋鄙的怀疑是一道异常检测,朱亥的铁椎是对验证者的胁迫,侯生最怕的「复请」是带外核实。示意模型中,只靠虎符时伪造得逞的概率是 0.0500,加上回都城核实降到 0.0025。记账符用缺口编码金额,用木纹验真,用两方各持一半实现异地保管;伪造的一半在 20 处特征上全部吻合的概率只有 0.0000009537,两半同楼保管的丢失概率是分开保管的五倍,而 1834 年的大火说明集中销毁同样危险。下一章把全书的模型收拢成一份可演练的流程、一个小工具与一份预注册检验方案。

数据口径:书中所有秘密都是玩具整数,参数均为示意,全部计算由书中程序生成;本书是数学模型与演练清单,不连接也不描述任何真实服务器,生产环境的备份与密钥操作须人工放行,不构成个人化法律或理财建议。 第一章在每份每年丢失 0.05、泄露 0.02 的示意参数下,算出三份副本的年丢失概率 0.000125、泄露概率 0.058808,三取二分别为 0.007250 与 0.001184,五取二是两项都胜过三份副本的最小方案。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 0.0025, 0.0500, 20

picked troops that marched on the matched tally: 80000
designforged obeyedgenuine stalleddelay
tally only0.05000.00000 d
tally + general's doubt0.01500.10000 d
doubt, then a strongman0.03250.05000 d
tally + call back to king0.00250.00004 d
call back + guard on it0.00080.00004 d
call back cuts forged-order success by a factor of 20
doubt alone, once force is allowed, keeps 65% of the risk
查看完整验算程序
# Chapter 7. p71: the tiger tally as a 2-of-2 scheme, with and without a
# second check. Shiji 77: the king keeps one half, general Jin Bi the
# other; the matched halves gave the prince Jin Bi's army, from which
# 80,000 picked troops marched. Per forged-order attempt
# (illustrative, not historical rates): s = thief obtains the king's
# half; d = general's doubt catches an odd order ("one carriage comes to
# replace me"); g = doubt also stalls a genuine odd order; c = a call
# back to the capital is intercepted; f = a strongman overcomes refusal.
# Outputs: forged order obeyed, genuine order stalled, days of delay.
S, D, G, C, F, TROOPS = 0.05, 0.70, 0.10, 0.05, 0.50, 80000
CALLBACK_DAYS = 4

designs = [
    ("tally only", S, 0.0, 0),
    ("tally + general's doubt", S * (1 - D), G, 0),
    ("doubt, then a strongman", S * (1 - D) + S * D * F, G * (1 - F), 0),
    ("tally + call back to king", S * C, 0.0, CALLBACK_DAYS),
    ("call back + guard on it", S * C * (1 - D), 0.0, CALLBACK_DAYS),
]
print("picked troops that marched on the matched tally: %d" % TROOPS)
print("design                     forged obeyed  genuine stalled  delay")
for name, fa, fr, days in designs:
    print("%-26s %13.4f  %15.4f  %3d d" % (name, fa, fr, days))
base = designs[0][1]
print("call back cuts forged-order success by a factor of %.0f"
      % (base / designs[3][1]))
print("doubt alone, once force is allowed, keeps %.0f%% of the risk"
      % (100 * designs[2][1] / base))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《数字资产灾难恢复与密钥分片、沙米尔秘密共享门限与异地增量快照单点失联自救母典》第 7 章「东西方原典考辨:窃符救赵的虎符与财政署的劈木记账符」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-272 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026272,
  author    = {Fan, Yafu},
  title     = {Disaster Recovery for Digital Assets: Shamir Secret-Sharing Thresholds, Off-Site Incremental Snapshots and Self-Rescue from Single Points of Loss},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论