关于「交付证据哈希链与默克尔日根:证明存在时刻,不证明内容为真」,《声誉反脆弱与受众主权》给出的定量结论是什么?
结论:第五章用 SHA-256 哈希链与默克尔日根保存交付证据:改记录并重算后续哈希的篡改,只靠链条检出率为 0.000,加每日外部锚点后为 1.000;个人资料一律不入链。
数据口径:书中参数为示意;全部计算由书中程序生成;本书是非个人化经营建议,不是法律意见。 书中以标注框区分已发表的证据、可运行的 Python 计算(22 段程序)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.000, 1.000
A. 1,000 records; head a19511f7b7db3fc7; day-1 anchor fa8f13f31108db3c B. detection rate chain only chain + daily anchors edit 1.000 1.000 recompute 0.000 1.000 C. hashes recomputed to reach the first break: mean 514.1, max 999 D. a record false from the moment it was written: detected = False
查看完整验算程序
# Chapter 5. p51: a SHA-256 hash chain of delivery events.
# Each record holds only minimal fields: sequence, day, event code, a
# keyed reference (BLAKE2b with a secret key over the order reference,
# so no personal data enters the chain) and a status. Link rule:
# h_i = SHA-256(h_{i-1} | record_i). The last hash of each day is the
# daily anchor, standing in for an external time-stamp token (RFC
# 3161 style). Three kinds of change are tried: edit one record only,
# edit and recompute every later hash, and a record that was false
# when it was first written. 1,000 events over 10 days; synthetic.
import hashlib
import random
import statistics
DAYS, PER_DAY = 10, 100
KEY = b"b403-demo-key-not-a-real-secret"
CODES = ("PACKED", "HANDED_TO_COURIER", "DELIVERED")
def keyed_ref(order_ref):
return hashlib.blake2b(order_ref.encode(), key=KEY,
digest_size=8).hexdigest()
def link(prev, rec):
body = "|".join(str(x) for x in rec)
return hashlib.sha256((prev + "|" + body).encode()).hexdigest()
def build(recs):
out, prev = [], "0" * 64
for r in recs:
prev = link(prev, r)
out.append(prev)
return out
def first_break(recs, stored):
prev = "0" * 64
for i, r in enumerate(recs):
prev = link(prev, r)
if prev != stored[i]:
return i, i + 1
return None, len(recs)
if __name__ == "__main__":
rng = random.Random(40501)
recs = []
for i in range(DAYS * PER_DAY):
recs.append((i, i // PER_DAY, CODES[i % 3],
keyed_ref("order-{}".format(i // 3)), "ok"))
stored = build(recs)
anchors = [stored[(d + 1) * PER_DAY - 1] for d in range(DAYS)]
print("A. {:,} records; head {}; day-1 anchor {}".format(
len(recs), stored[0][:16], anchors[0][:16]))
trials = 400
det_chain = {"edit": 0, "recompute": 0}
det_anchor = {"edit": 0, "recompute": 0}
cost = []
for t in range(trials):
kind = "edit" if t % 2 == 0 else "recompute"
j = rng.randrange(len(recs))
bad = list(recs)
r = bad[j]
bad[j] = (r[0], r[1], r[2], r[3], "damaged")
s2 = list(stored)
if kind == "recompute":
s2 = build(bad)
where, n = first_break(bad, s2)
if where is not None:
det_chain[kind] += 1
cost.append(n)
day_ends = [s2[(d + 1) * PER_DAY - 1] for d in range(DAYS)]
if where is not None or day_ends != anchors:
det_anchor[kind] += 1
half = trials // 2
print("B. detection rate chain only chain + daily anchors")
for k in ("edit", "recompute"):
print(" {:<18} {:.3f} {:.3f}".format(
k, det_chain[k] / half, det_anchor[k] / half))
print("C. hashes recomputed to reach the first break: mean {:.1f},"
" max {}".format(statistics.fmean(cost), max(cost)))
lie = list(recs)
lie[500] = (500, 5, "DELIVERED", keyed_ref("order-166"), "ok")
s3 = build(lie)
where, _ = first_break(lie, s3)
print("D. a record false from the moment it was written:"
" detected = {}".format(where is not None))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《商业声誉反脆弱柔道、恶意差评证据链反制与去平台依赖私域主权母典》第 5 章「交付证据哈希链与默克尔日根:证明存在时刻,不证明内容为真」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-403 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026403,
author = {Fan, Yafu},
title = {Antifragile Reputation Judo, Evidence-Backed Smear Neutralisation and Platform-Independent Audience Sovereignty},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}