What does Digital Legacy and Time-Lock Succession conclude, in numbers, about “The Check-in Window: Trading False Firing against Late Release”?
Answer: Chapter 2 treats a dead man's switch as a sequential test: absences come in stretches, a 30-day window still fires falsely with yearly probability 0.062969, and the tail of absence lengths decides false firing; the best window of a bare switch is 172 days, and a trustee check shortens it to 29.
Scope of the numbers: Chapter 1 finds in an illustrative model that a will alone loses 0.781 of value, a technical handover 0.150 and a handover with yearly drills 0.030; a chain of five links needs 0.979 per link to be reached nine times in ten. Chapter 5 shows that years 51 to 70 of protection hold only 0.00334 of an illustrative library's present value, while 30 dark days cost 18979 yuan and the first deadline needing a person falls on day 76 after death.
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: 172, 29, 30
| costs: wrong release 300000, alarm 1000, dark day 1500; E_Q 0.002, V 14 | ||
| yearly expected cost (yuan), hazard 0.003 | ||
| W | bare switch | with quorum |
| 7 | 121945.7 | 567.0 |
| 14 | 59462.5 | 366.1 |
| 30 | 19025.6 | 281.6 |
| 60 | 6129.7 | 359.8 |
| 90 | 2526.5 | 477.7 |
| 120 | 1308.9 | 606.5 |
| 180 | 910.7 | 873.5 |
| bare switch | optimum W = 172 days, cost 906.0, P_false 0.00044 | |
| with quorum | optimum W = | 29 days, cost 281.3, P_false 0.06640 |
| optimum W by yearly hazard (bare / quorum): | ||
| hazard 0.001 | W* = 204 / | 47 |
| hazard 0.003 | W* = 172 / | 29 |
| hazard 0.010 | W* = 136 / | 17 |
| hazard 0.030 | W* = 104 / | 8 |
| hazard 0.100 W* = 68 / 1 | ||
Show the full program
# Chapter 2. p23: the optimal silence window, with and without a quorum stage.
# Expected yearly cost of a window W (owner alive most years, dies with
# yearly hazard H):
# bare switch : C_FR * P_false(W) + H * C_DAY * W
# with quorum : C_ALARM * P_false(W)
# + C_FR * E_Q * P_false(W + V) + H * C_DAY * (W + V)
# The quorum stage turns most false triggers into a cheap alarm (people
# phone the owner), lets a wrong release through with probability E_Q,
# and adds V days of verification to every true release.
# P_false(W) is the episode model of p22. 所有金额与概率均为示意。
import math
LAM = 5.0
KINDS = [("short", 0.75, 2.0), ("trip", 0.22, 7.0),
("incapacity", 0.03, 30.0)]
C_FR = 300000.0 # 误放行:隐私外泄、提前移交、家庭纠纷(示意)
C_ALARM = 1000.0 # 误报警:受托人联络本人的时间与尴尬(示意)
C_DAY = 1500.0 # 死后每晚一天交接:账户停摆、续费逾期(示意)
E_Q = 0.002 # 法定人数误确认概率,量级见第四章 p41
V = 14 # 核验期(天)
H = 0.003 # 年死亡风险(示意,约为中年人的量级)
def p_false(w):
t = math.fsum(f * (1 - 1 / mu) ** w for _, f, mu in KINDS)
return 1 - math.exp(-LAM * t)
def cost_bare(w, h):
return C_FR * p_false(w) + h * C_DAY * w
def cost_quorum(w, h):
return (C_ALARM * p_false(w) + C_FR * E_Q * p_false(w + V)
+ h * C_DAY * (w + V))
def best(fn, h):
return min(range(1, 366), key=lambda w: (fn(w, h), w))
print("costs: wrong release %.0f, alarm %.0f, dark day %.0f; E_Q %.3f, V %d"
% (C_FR, C_ALARM, C_DAY, E_Q, V))
print("yearly expected cost (yuan), hazard %.3f" % H)
print(" W bare switch with quorum")
for w in (7, 14, 30, 60, 90, 120, 180):
print(" %3d %10.1f %10.1f" % (w, cost_bare(w, H), cost_quorum(w, H)))
for name, fn in (("bare switch", cost_bare), ("with quorum", cost_quorum)):
w = best(fn, H)
print("%-12s optimum W = %3d days, cost %.1f, P_false %.5f"
% (name, w, fn(w, H), p_false(w)))
print("optimum W by yearly hazard (bare / quorum):")
for h in (0.001, 0.003, 0.01, 0.03, 0.1):
print(" hazard %.3f W* = %3d / %3d"
% (h, best(cost_bare, h), best(cost_quorum, h)))Single source and citation
Fan, Y. (2026). Digital Legacy and Perpetual Cross-Generation Contracts for a One-Person Empire: Time-Lock State Machines and the Frictionless Succession of Libraries, Intellectual Property and Automated Systems (Version 1.0.0), Chapter 2: The Check-in Window: Trading False Firing against Late Release. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-292 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026292,
author = {Fan, Yafu},
title = {Digital Legacy and Perpetual Cross-Generation Contracts for a One-Person Empire: Time-Lock State Machines and the Frictionless Succession of Libraries, Intellectual Property and Automated Systems},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Lost Contact: the Access Chain beyond the Will
- Chapter 3 · The Time-Lock State Machine: Reachability, Safety and Bounded Model Checking
- Chapter 4 · The Trustee Quorum: Thresholds, Attrition and the Idea of Splitting
- Chapter 5 · Automating the Handover of Intellectual Property: Term, Dark Gaps and the Renewal Calendar
- Chapter 6 · Perpetuity across Generations: Decay of Transfer, Dilution of Shares and the Line of Stewards
- Chapter 7 · Sources from East and West: Mencius on Five Generations and Justinian on Wills
- Chapter 8 · Closing the Loop: the Digital-Legacy Inventory, the Yearly Drill and a Pre-registered Test