关于「哈希链与链式时间戳:从哈伯与斯托内塔的链接法到锚定间隔」,《默克尔树与书稿存证》给出的定量结论是什么?
结论:第四章从哈伯与斯托内塔的链接法讲到锚定间隔:每周锚定的平均证明滞后 3.10 天,每月锚定时一年中有 0.7534 的日子存在可被悄悄改写的版本。
数据口径:书中的书稿、时间戳、盐值与参数均为示意,全部计算由书中程序生成;哈希与时间戳只证明某段内容不晚于某时已经存在且未被改动,不等于著作权登记或权属证明,举证效力以法院与当地法规为准;本书不构成个人化法律建议。 第一章在九个文件的示意书稿上做单字节改动,凭总哈希猜改了哪个文件,命中率 0.1133,与瞎猜的 0.1111 无异。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.7534, 3.10
| 40 versions over one year; version days fixed by seed | ||||
| anchor A | mean lag | max lag | mean hops | open share |
| 1 | 0.00 | 0 | 0.000 | 0.0000 |
| 7 | 3.10 | 6 | 0.275 | 0.2795 |
| 30 | 15.35 | 28 | 1.550 | 0.7534 |
| 90 | 40.85 | 88 | 4.875 | 0.9233 |
| 365 | 196.60 | 360 | 19.500 | 0.9863 |
| first five version days: [5, 8, 10, 16, 25] |
查看完整验算程序
# Chapter 4. p42: a private chain proves nothing until it is anchored.
# An author keeps a hash chain of versions on days drawn once (fixed
# seed) over a 365-day year. The chain head is copied into a public,
# widely kept record every A days (anchor days A, 2A, 3A and so on). A
# version written on day t can be shown to have existed only "before
# the first anchor on or after t"; until then the author could rewrite
# it, or slip in a back-dated version, without any outsider noticing.
# We print, per anchor interval: mean and max proof lag in days, mean
# chain hops from a version to its anchor, and the share of the year
# during which at least one version is still rewritable. Illustrative.
import math
import random
rng = random.Random(20261113)
DAYS = sorted(rng.sample(range(1, 366), 40))
def lag_hops(a):
lags, hops = [], []
for j, t in enumerate(DAYS):
anchor = -(-t // a) * a
lags.append(anchor - t)
later = [u for u in DAYS[j + 1:] if u <= anchor]
hops.append(len(later))
return lags, hops
def open_share(a):
# days on which some written version is not yet anchored
open_days = 0
for d in range(1, 366):
last_anchor = (d // a) * a
if any(last_anchor < t <= d for t in DAYS):
open_days += 1
return open_days / 365
print("40 versions over one year; version days fixed by seed")
print("%9s %9s %8s %10s %12s" % ("anchor A", "mean lag", "max lag",
"mean hops", "open share"))
for a in (1, 7, 30, 90, 365):
lags, hops = lag_hops(a)
print("%9d %9.2f %8d %10.3f %12.4f" % (
a, math.fsum(lags) / len(lags), max(lags),
math.fsum(hops) / len(hops), open_share(a)))
print("first five version days:", DAYS[:5])唯一数据源与引用
范雅福(Fan, Y.). (2026). 《默克尔树哈希链与可信时间戳、专著版本防篡改与优先权举证最小证明母典》第 4 章「哈希链与链式时间戳:从哈伯与斯托内塔的链接法到锚定间隔」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-295 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026295,
author = {Fan, Yafu},
title = {Merkle Hash Trees and Trusted Timestamps: Tamper-Evidence for Monograph Versions and Minimal Proofs of Priority},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}