关于「失联:遗嘱之外的访问链」,《数字遗产与时间锁传承》给出的定量结论是什么?
结论:第一章在示意模型中量出只立遗嘱按价值计失联 0.781,技术交接降到 0.150,加年度演练降到 0.030;五环的链要九成可达,每环须 0.979。
数据口径:书中参数为示意;全部计算由书中程序生成;本书是非个人化法律、税务或理财建议,法律规则只写大意、以上架前人工复核为准,具体事务须由执业律师按当地法律办理,任何自动化都不能替代合法有效的遗嘱与公证。 第一章在示意模型中量出只立遗嘱按价值计失联 0.781,技术交接降到 0.150,加年度演练降到 0.030;五环的链要九成可达,每环须 0.979。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.030, 0.150, 0.781
| asset | weight | none | will | handover | drill |
|---|---|---|---|---|---|
| domains | 3 | 0.052 | 0.095 | 0.797 | 0.961 |
| site-host | 3 | 0.052 | 0.095 | 0.797 | 0.961 |
| manuscripts | 5 | 0.016 | 0.028 | 0.797 | 0.961 |
| ebook-store | 4 | 0.052 | 0.095 | 0.797 | 0.961 |
| merchant | 4 | 0.052 | 0.095 | 0.797 | 0.961 |
| code-repo | 3 | 0.052 | 0.095 | 0.797 | 0.961 |
| pw-vault | 2 | 0.025 | 0.045 | 0.950 | 0.990 |
| self-wallet | 2 | 0.000 | 0.000 | 0.950 | 0.990 |
| social | 1 | 0.150 | 0.270 | 0.902 | 0.980 |
| bank | 6 | 0.475 | 0.855 | 0.970 | 0.990 |
| expected share of assets reached (count / value-weighted): | |||||
| none | 0.093 / | 0.122 | lost by value | 0.878 | |
| will | 0.167 / | 0.219 | lost by value | 0.781 | |
| handover | 0.856 / | 0.850 | lost by value | 0.150 | |
| drill | 0.971 / | 0.970 | lost by value | 0.030 |
查看完整验算程序
# Chapter 1. p11: an access chain decides whether a digital asset survives.
# An heir reaches an asset only if he finds it and then re-opens every
# link on its access chain (recovery mailbox, second factor, device,
# password vault, the platform's own process for a deceased user).
# P(reach) = discovery * product of link probabilities. Four regimes:
# none : no will, no inventory
# will : a valid will names the assets, but no technical handover
# handover : will + sealed inventory + legacy contacts set on platforms
# drill : handover + one annual rehearsal that refreshes stale links
# 全部概率为示意(作者设定,用来显示结构),不是任何平台的统计数字。
import math
# 每个环节的可重开概率:(无交接, 有交接, 有交接且年度演练)
LINK = {
"mail": (0.50, 0.95, 0.99), # 恢复邮箱
"2fa": (0.35, 0.93, 0.99), # 第二因素(手机令牌或硬件钥匙)
"device": (0.30, 0.95, 0.99), # 手机或电脑解锁
"vault": (0.05, 0.95, 0.99), # 密码库主口令(只交接存放位置)
"plat": (0.60, 0.95, 0.99), # 平台对逝者账户的处理流程
"bank": (0.95, 0.97, 0.99), # 银行按法律文书办理
"seed": (0.00, 0.95, 0.99), # 自管钱包的助记词(只交接存放位置)
}
# 资产:(名称, 权重, 访问链)。权重是示意的相对价值
ASSETS = [
("domains", 3, ["mail", "2fa", "plat"]),
("site-host", 3, ["mail", "2fa", "plat"]),
("manuscripts", 5, ["device", "mail", "2fa", "plat"]),
("ebook-store", 4, ["mail", "2fa", "plat"]),
("merchant", 4, ["mail", "2fa", "plat"]),
("code-repo", 3, ["mail", "2fa", "plat"]),
("pw-vault", 2, ["vault"]),
("self-wallet", 2, ["seed"]),
("social", 1, ["mail", "plat"]),
("bank", 6, ["bank"]),
]
FIND = {"none": 0.5, "will": 0.9, "handover": 1.0, "drill": 1.0}
COL = {"none": 0, "will": 0, "handover": 1, "drill": 2}
# 密码库与钱包在无交接时连位置都不知道;有交接时还要先通过密码库
VIA_VAULT = {"domains", "site-host", "ebook-store", "merchant", "code-repo"}
def reach(asset, regime):
name, _, chain = asset
c = COL[regime]
p = FIND[regime] * math.prod(LINK[k][c] for k in chain)
if regime != "none" and regime != "will" and name in VIA_VAULT:
p *= LINK["vault"][c]
return p
print("asset weight none will handover drill")
table = {r: [] for r in FIND}
for a in ASSETS:
row = [reach(a, r) for r in FIND]
for r, v in zip(FIND, row):
table[r].append(v)
print("%-12s %4d %6.3f %6.3f %8.3f %6.3f" % ((a[0], a[1]) + tuple(row)))
w = [a[1] for a in ASSETS]
wt = math.fsum(w)
print("expected share of assets reached (count / value-weighted):")
for r in FIND:
cnt = math.fsum(table[r]) / len(ASSETS)
val = math.fsum(x * y for x, y in zip(w, table[r])) / wt
print(" %-9s %6.3f / %6.3f lost by value %6.3f"
% (r, cnt, val, 1 - val))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《单兵帝国数字遗产与跨代永续契约、时间锁状态机与书库知识产权自动化系统零摩擦传承母典》第 1 章「失联:遗嘱之外的访问链」(版本 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}
}