关于「签到窗口:误触发与迟放行的最优权衡」,《数字遗产与时间锁传承》给出的定量结论是什么?

结论:第二章把死人开关看成序贯检验:缺席成段发生,窗口 30 天时年误触发仍有 0.062969,决定误触发的是缺席时长的尾部;裸开关的最优窗口是 172 天,加上受托人核验缩短到 29 天。

数据口径:书中参数为示意;全部计算由书中程序生成;本书是非个人化法律、税务或理财建议,法律规则只写大意、以上架前人工复核为准,具体事务须由执业律师按当地法律办理,任何自动化都不能替代合法有效的遗嘱与公证。 第一章在示意模型中量出只立遗嘱按价值计失联 0.781,技术交接降到 0.150,加年度演练降到 0.030;五环的链要九成可达,每环须 0.979。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 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
Wbare switchwith quorum
7121945.7567.0
1459462.5366.1
3019025.6281.6
606129.7359.8
902526.5477.7
1201308.9606.5
180910.7873.5
bare switchoptimum W = 172 days, cost 906.0, P_false 0.00044
with quorumoptimum W =29 days, cost 281.3, P_false 0.06640
optimum W by yearly hazard (bare / quorum):
hazard 0.001W* = 204 /47
hazard 0.003W* = 172 /29
hazard 0.010W* = 136 /17
hazard 0.030W* = 104 /8
hazard 0.100 W* = 68 / 1
查看完整验算程序
# 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)))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《单兵帝国数字遗产与跨代永续契约、时间锁状态机与书库知识产权自动化系统零摩擦传承母典》第 2 章「签到窗口:误触发与迟放行的最优权衡」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 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}
}

本书其他章节结论