What does Disaster Recovery and Threshold Shares conclude, in numbers, about “Self-Rescue after a Single Point of Loss: Time to Quorum and the Exposed Window”?

Answer: Chapter 6 computes self-rescue after one share goes missing: losing the fastest holder is like raising the threshold by one, and the illustrative rescue window is 263 hours.

Scope of the numbers: Chapter 6 computes self-rescue after one share goes missing: losing the fastest holder is like raising the threshold by one, and the illustrative rescue window is 263 hours. Marked boxes separate published evidence, runnable Python calculations (19 programs), classical sources and the author's hypotheses.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 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
Show the full program
# 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)

Single source and citation

Fan, Y. (2026). Disaster Recovery for Digital Assets: Shamir Secret-Sharing Thresholds, Off-Site Incremental Snapshots and Self-Rescue from Single Points of Loss (Version 1.0.0), Chapter 6: Self-Rescue after a Single Point of Loss: Time to Quorum and the Exposed Window. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 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}
}

Other chapter answers in this book