What does Digital Legacy and Time-Lock Succession conclude, in numbers, about “The Time-Lock State Machine: Reachability, Safety and Bounded Model Checking”?

Answer: Chapter 3 writes the handover as a state machine and finds a five-step hole in a common design among 87380 event sequences; a three-of-five check never completes with probability 0.02661.

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: 0.02661

fixed part: window 29 + nudge 3 + grace 7 = 39 days
trustees reachable 0.85, daily answer rate 0.35
k of nP(never)quorum days: meanmedianp90total p90
1 of 10.150002.862645
1 of 30.003381.581342
2 of 30.060752.972645
3 of 50.026612.943544
4 of 50.164794.354746
4 of 70.012102.893544
5 of 70.073774.024746
3 of 5: verification after the window ~ 10 + 2.94 = 12.94 days mean
Show the full program
# Chapter 3. p32: days from death to release in the designed machine.
# After death the machine waits the silence window W, then NUDGE days of
# reminders, then GRACE days in which trustees are alerted; in QUORUM it
# waits until k of n trustees have confirmed. A trustee is reachable at
# all with probability 1 - U and, if reachable, answers on each day with
# probability RHO. With F(t) = (1 - U) * (1 - (1 - RHO) ** t),
#   P(quorum by day t) = P(Binomial(n, F(t)) >= k).
# The mean is taken over the cases that ever reach a quorum.
# W 取第二章 p23 的最优窗口;其余参数均为示意。
import math

W, NUDGE, GRACE = 29, 3, 7
U, RHO = 0.15, 0.35
HORIZON = 365


def at_least(k, n, p):
    return math.fsum(math.comb(n, j) * p ** j * (1 - p) ** (n - j)
                     for j in range(k, n + 1))


def quorum_profile(k, n):
    never = 1 - at_least(k, n, 1 - U)
    cdf = [at_least(k, n, (1 - U) * (1 - (1 - RHO) ** t))
           for t in range(HORIZON + 1)]
    reach = cdf[-1]
    # 条件均值:E[T | 达成] = sum_t P(t < T, 达成) / P(达成)
    mean = math.fsum(reach - c for c in cdf) / reach
    med = next(t for t, c in enumerate(cdf) if c >= 0.5 * reach)
    p90 = next(t for t, c in enumerate(cdf) if c >= 0.9 * reach)
    return never, mean, med, p90


fixed = W + NUDGE + GRACE
print("fixed part: window %d + nudge %d + grace %d = %d days"
      % (W, NUDGE, GRACE, fixed))
print("trustees reachable %.2f, daily answer rate %.2f" % (1 - U, RHO))
print(" k of n   P(never)   quorum days: mean  median  p90   total p90")
for k, n in ((1, 1), (1, 3), (2, 3), (3, 5), (4, 5), (4, 7), (5, 7)):
    never, mean, med, p90 = quorum_profile(k, n)
    print(" %d of %d   %8.5f              %5.2f  %5d %5d   %8d"
          % (k, n, never, mean, med, p90, fixed + p90))
never, mean, med, p90 = quorum_profile(3, 5)
print("3 of 5: verification after the window ~ %d + %.2f = %.2f days mean"
      % (NUDGE + GRACE, mean, NUDGE + GRACE + mean))

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 3: The Time-Lock State Machine: Reachability, Safety and Bounded Model Checking. 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