关于「实证闭环:门限方案演练、风险计算器与预注册检验」,《数字资产灾难恢复与门限分片》给出的定量结论是什么?

结论:第八章给出演练流程、门限分片风险计算器与预注册检验:30 次演练至少 28 次成功。书中以标注框区分已发表的证据、可运行的 Python 计算(19 段程序)、原典与作者的假说。

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

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 28, 30

drills N30, pass if at least 28 succeed
false pass if true rate 0.800.0442
power if true rate 0.950.8122
4 drills a year x1 households -> 8 year(s)
4 drills a year x5 households -> 2 year(s)
2 drills a year x 10 households2 year(s)
the claim is refuted if 3 or more of the 30 drills fail
查看完整验算程序
# Chapter 8. p82: how many drills before the book's claim can fail?
# Pre-registered test. Outcome per drill: k shares gathered and the toy
# value rebuilt within 72 h (yes / no). Book's prediction for a 3-of-5
# layout: success rate at least 0.95. Refutation threshold: a true rate
# of 0.80 or lower. Exact one-sided binomial design: smallest number of
# drills N and pass mark c with P(X >= c | 0.80) <= 0.05 (a weak set-up
# rarely looks good) and P(X >= c | 0.95) >= 0.80 (a good one passes).
import math

P0, P1, ALPHA, POWER = 0.80, 0.95, 0.05, 0.80


def upper(n, p, c):
    terms = [math.comb(n, j) * p ** j * (1 - p) ** (n - j)
             for j in range(c, n + 1)]
    return math.fsum(terms)


design = None
for n in range(5, 200):
    for c in range(n + 1):
        a = upper(n, P0, c)
        if a <= ALPHA:
            b = upper(n, P1, c)
            if b >= POWER:
                design = (n, c, a, b)
            break
    if design:
        break
n, c, a, b = design
print("drills N = %d, pass if at least %d succeed" % (n, c))
print("false pass if true rate 0.80: %.4f" % a)
print("power if true rate 0.95:      %.4f" % b)
for per_year, homes in ((4, 1), (4, 5), (2, 10)):
    years = math.ceil(n / (per_year * homes))
    print("%d drills a year x %2d households -> %d year(s)"
          % (per_year, homes, years))
fails = n - c
print("the claim is refuted if %d or more of the %d drills fail"
      % (fails + 1, n))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《数字资产灾难恢复与密钥分片、沙米尔秘密共享门限与异地增量快照单点失联自救母典》第 8 章「实证闭环:门限方案演练、风险计算器与预注册检验」(版本 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}
}

本书其他章节结论