关于「单点失联的自救:凑齐门限的时间与暴露窗口」,《数字资产灾难恢复与门限分片》给出的定量结论是什么?

结论:第六章计算单点失联后的自救:失去最快的持有人相当于把门限提高一级,示意自救窗口 263 小时。

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

English version

对照数据表

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

confirm loss, freeze changes24 h
gather k shares (p61, 90th pct)91 h
offline drill: rebuild, refresh, re-split4 h
deliver new shares by hand72 h
collect deletion receipts of old shares72 h
window until margin restored263 h (11.0 days)
P(secret lost inside the window | one share already gone)
scheme x1 x10 x50 x200
2-of-30.002998 0.029577 0.139390 0.451439
3-of-50.000013 0.001306 0.028429 0.277593
4-of-70.000000 0.000064 0.006401 0.184499
skip the deletion receipts: window 191 h, but old shares stay live
查看完整验算程序
# Chapter 6. p62: one share is gone - how long is the exposed window, and
# what is the chance of a second blow before the margin is restored?
# Model: a self-rescue runbook with illustrative step times (hours).
# Gathering k shares uses the 90th percentile from p61 without holder A,
# rounded to 91 h. During the window every remaining share is lost at
# rate 0.05 a year times a clustering multiplier: failures bunch in time
# (shared cause, same storm, same bad batch), so the hazard right after
# a loss may be far above the yearly average. Exact binomial arithmetic.
import math

STEPS = [("confirm loss, freeze changes", 24),
         ("gather k shares (p61, 90th pct)", 91),
         ("offline drill: rebuild, refresh, re-split", 4),
         ("deliver new shares by hand", 72),
         ("collect deletion receipts of old shares", 72)]
RATE = 0.05 / (365 * 24)             # per share per hour


def tail(n, r, x):
    if x <= 0:
        return 1.0
    terms = [math.comb(n, j) * r ** j * (1 - r) ** (n - j)
             for j in range(x, n + 1)]
    return math.fsum(terms)


window = int(math.fsum(h for _, h in STEPS))
for name, h in STEPS:
    print("%-42s %4d h" % (name, h))
print("%-42s %4d h (%.1f days)" % ("window until margin restored",
                                    window, window / 24))
print("P(secret lost inside the window | one share already gone)")
print("scheme    x1         x10        x50        x200")
for k, n in ((2, 3), (3, 5), (4, 7)):
    row = []
    for mult in (1, 10, 50, 200):
        r = 1 - math.exp(-RATE * mult * window)
        row.append(tail(n - 1, r, (n - 1) - k + 1))
    print("%d-of-%d  " % (k, n) + "".join("%11.6f" % v for v in row))
fast = window - 72
print("skip the deletion receipts: window %d h, but old shares stay live"
      % fast)

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《数字资产灾难恢复与密钥分片、沙米尔秘密共享门限与异地增量快照单点失联自救母典》第 6 章「单点失联的自救:凑齐门限的时间与暴露窗口」(版本 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}
}

本书其他章节结论