Disaster Recovery for Digital Assets: Shamir Secret-Sharing Thresholds, Off-Site Incremental Snapshots and Self-Rescue from Single Points of Loss: chapter answers
The advice most often heard about safeguarding digital assets is to copy the secret needed for recovery several times and keep the copies apart. This book splits that advice into two ledgers, loss and leakage, recomputes it with the binomial distribution, finite-field interpolation, Markov chains and order statistics, and corrects the project's claim: under independent losses three copies in three places are the best protection against loss, a threshold scheme trades loss for leakage relative to three copies, and winning on both ledgers at once needs more pieces. Every secret in the book is a…
DOI pending · monograph page goes live after publication · 5DL-B-272 · 中文版
- Chapter 1 · The Illusion of Three Copies: a Binomial Ledger of Loss and Leak
Three copies in three places are, under independent losses, the practice that best protects against loss: with the illustrative parameters the yearly loss probability is only 0.000125, but the leak probability rises to… - Chapter 2 · Lagrange Interpolation over a Finite Field: Making, Rebuilding and Checking Shares
Chapter 2 splits and joins in the field modulo 2147483647, proves by exhaustive counting that fewer pieces than the threshold reveal nothing, and shows that locating one crafted bad share costs two units of redundancy. - Chapter 3 · Loss and Collusion: Unequal Holders, Shared Buildings and Acquaintance Graphs
Chapter 3 handles unequal holders, shared buildings and collusion among acquaintances: three-of-five split three and two over two places has a loss probability of 0.012547, worse than one place. - Chapter 4 · Off-Site Incremental Snapshots: Recovery Point, Recovery Time and Mean Time to Data Loss
Chapter 4 computes off-site incremental snapshots: hourly incrementals push the worst recovery time to 51.11 hours, an hourly chain of 168 links is intact with probability only 0.8453 without read-back checks, and two c… - Chapter 5 · Leaks Accumulate: Proactive Share Refresh
Chapter 5 shows that leakage accumulates: three-of-five left unrefreshed for twenty years leaks with probability 0.208484, and yearly refresh brings that to 0.001551. - Chapter 6 · Self-Rescue after a Single Point of Loss: Time to Quorum and the Exposed Window
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. - Chapter 7 · Classics East and West: the Tiger Tally of Shiji 77 and the Split Tally of the Exchequer
The tiger tally is a two-of-two scheme in which the verifier holds the other half, so stealing the ruler's half is enough to forge an order. Jin Bi's doubt was anomaly detection, Zhu Hai's mallet was coercion of the ver… - Chapter 8 · Closing the Loop: Threshold Drills, the Risk Calculator and a Pre-Registered Test
Chapter 8 gives the drill procedure, the Threshold Share Risk Calculator and a pre-registered test of 30 drills with at least 28 successes. Marked boxes separate published evidence, runnable Python calculations (19 prog…
Illustrative model calculation, not a live quote