What does Digital Legacy and Time-Lock Succession conclude, in numbers, about “The Trustee Quorum: Thresholds, Attrition and the Idea of Splitting”?

Answer: Chapter 4 shows a three-of-five threshold missing with probability 0.026612 and confirming wrongly with 0.00115813, holding in year 30 with probability 0.1550 without drills and 0.9992 with yearly drills, and explains threshold splitting on a toy integer.

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.1550, 0.9992, 30

P(quorum of 3 still reachable) before that year's drill
drill yr5 yr 10 yr 20 yr 30 yr 40
every year0.9992 0.9992 0.9992 0.9992 0.9992
every 5 yr0.9532 0.9423 0.9413 0.9413 0.9413
never0.9532 0.7874 0.3922 0.1550 0.0544
mean tenure of one trustee without replacement25 years
Show the full program
# Chapter 4. p42: trustees drift away; a drill every year keeps the quorum.
# Five trustees, quorum 3. Each year each active trustee is lost (dies,
# moves, loses contact, withdraws) with probability D. At a drill, each
# vacant seat is refilled with probability R. Drill every year, every
# 5 years, or never; the state is the number of active trustees and
# the chain is pushed forward exactly year by year.
# Output: P(at least 3 trustees active) at the given year.
# D、R 为示意参数。
import math

N, K, D, R = 5, 3, 0.04, 0.90


def binom(n, j, p):
    return math.comb(n, j) * p ** j * (1 - p) ** (n - j)


def year_step(dist):
    new = [[] for _ in range(N + 1)]
    for i, p in enumerate(dist):
        for j in range(i + 1):
            new[j].append(p * binom(i, j, 1 - D))
    return [math.fsum(x) for x in new]


def drill(dist):
    new = [[] for _ in range(N + 1)]
    for i, p in enumerate(dist):
        vac = N - i
        for r in range(vac + 1):
            new[i + r].append(p * binom(vac, r, R))
    return [math.fsum(x) for x in new]


def quorum_curve(every, years):
    dist = [0.0] * N + [1.0]
    out = {}
    for y in range(1, max(years) + 1):
        dist = year_step(dist)
        if y in years:
            out[y] = math.fsum(dist[K:])
        if every and y % every == 0:
            dist = drill(dist)
    return out


YEARS = (5, 10, 20, 30, 40)
print("P(quorum of %d still reachable) before that year's drill" % K)
print("   drill        " + "".join("   yr %2d" % y for y in YEARS))
for label, every in (("every year", 1), ("every 5 yr", 5), ("never", 0)):
    c = quorum_curve(every, YEARS)
    print("   %-12s" % label + "".join("  %.4f" % c[y] for y in YEARS))
mean_life = 1 / D
print("mean tenure of one trustee without replacement: %.0f years"
      % mean_life)

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 4: The Trustee Quorum: Thresholds, Attrition and the Idea of Splitting. 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