关于「东西方原典考辨:鱼符合契与胡克字谜」,《默克尔树与书稿存证》给出的定量结论是什么?

结论:《新唐书·车服志》的随身鱼符「左二右一」,铜鱼符「左三右一」「左五右一」「用始第一,周而复始」,是分持验证与按序轮换的古代做法,目的是「以防召命之诈」。程序 p71 显示,轮换 3 枚时一份复制品在第 5、8、11、14 次传令都能对上,兰波特单向链则拒绝任何重放。胡克 1676 年的字谜是一个承诺:字母排序后正是 ceiiinosssttuv,有 1210809600 种排列,约 30.17 比特;但一张 46 个词的小词表就能拼出 25 种读法,绑定性靠的是人为判断。古人看对了「核验方先持有凭证」与「先承诺后揭示」,受限于物理凭证可仿制、轮换可重放、字谜读法不唯一。最后一章回到出版局自己的流程:每一卷书稿与程序的哈希树怎样写进回执,小工具怎样用,以及什么样的数据会推翻本书。

数据口径:书中的书稿、时间戳、盐值与参数均为示意,全部计算由书中程序生成;哈希与时间戳只证明某段内容不晚于某时已经存在且未被改动,不等于著作权登记或权属证明,举证效力以法院与当地法规为准;本书不构成个人化法律建议。 第一章在九个文件的示意书稿上做单字节改动,凭总哈希猜改了哪个文件,命中率 0.1133,与瞎猜的 0.1111 无异。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 1210809600, 25, 30.17, 46

sorted letters of the solution: ceiiinosssttuv
  matches printed ceiiinosssttuv: True
  matches printed ceiiinosssttuu: False
letter orders of ceiiinosssttuv: 1210809600 (30.17 bits)
letter orders of ceiiinosssttuu: 605404800 (29.17 bits)
word multisets from a 46-word list that use exactly these letters:
  count: 25; the first five in sorted order:
  cito est in visus
  cito est sinu vis
  cito inest visus
  cito sinu vestis
  cives in suis tot
  Hooke's own reading is among them: True
hash commitment (fixed demo salt): 01475c4d29001e716f7a770cc84efb3b
binding: about 2^128 work to find a second opening
查看完整验算程序
# Chapter 7. p72: Hooke's 1676 anagram as a commitment scheme.
# Hooke printed the sorted letters of "ut tensio sic vis" and gave the
# solution in 1678. We (1) check that sorting the solution gives the
# printed string (sources differ on the last letter, u or v, since
# printers of the time used them interchangeably), (2) count distinct
# letter orders (an upper bound on hiding), (3) count how many other
# readings fit the same letters inside a tiny illustrative word list:
# every fitting reading weakens binding. (4) A modern hash commitment
# with a fixed illustrative salt for contrast.
import hashlib
import itertools
import math
from collections import Counter

SOLUTION = "ut tensio sic vis"
PRINTED = ("ceiiinosssttuv", "ceiiinosssttuu")
WORDS = ["ut", "sic", "vis", "tensio", "in", "est", "sit", "cui", "nos",
         "situs", "visus", "uti", "tot", "testis", "unio", "otium",
         "visio", "constitui", "sui", "situ", "vincit", "tu", "ius",
         "suus", "ostium", "suis", "ictus", "tonus", "seu", "si", "es",
         "vos", "tunc", "cito", "visu", "nisi", "inest", "scio", "vicis",
         "sciens", "tui", "sinu", "cives", "unus", "vestis", "iussit"]


def arrangements(word):
    c = Counter(word)
    den = 1
    for v in c.values():
        den *= math.factorial(v)
    return math.factorial(len(word)) // den


key = "".join(sorted(SOLUTION.replace(" ", "")))
print("sorted letters of the solution: %s" % key)
for p in PRINTED:
    print("  matches printed %s: %s" % (p, key == p))
for p in PRINTED:
    a = arrangements(p)
    print("letter orders of %s: %d (%.2f bits)" % (p, a, math.log2(a)))
target = Counter(key)
fits = set()
for r in range(1, 5):
    for combo in itertools.combinations_with_replacement(sorted(WORDS), r):
        if Counter("".join(combo)) == target:
            fits.add(" ".join(combo))
print("word multisets from a %d-word list that use exactly these letters:"
      % len(WORDS))
print("  count: %d; the first five in sorted order:" % len(fits))
for f in sorted(fits)[:5]:
    print("  " + f)
print("  Hooke's own reading is among them: %s"
      % ("sic tensio ut vis" in fits))
salt = bytes(range(16))
c = hashlib.sha256(salt + SOLUTION.encode()).hexdigest()
print("hash commitment (fixed demo salt): %s" % c[:32])
print("binding: about 2^128 work to find a second opening")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《默克尔树哈希链与可信时间戳、专著版本防篡改与优先权举证最小证明母典》第 7 章「东西方原典考辨:鱼符合契与胡克字谜」(版本 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}
}

本书其他章节结论