关于「优先权举证的最小证明包:追加一致性、两层结构与盐值遮蔽」,《默克尔树与书稿存证》给出的定量结论是什么?

结论:第六章装配最小证明包:九个文件、六个版本时 365 字节,一千多个文件、五百个版本也只有 749 字节,并说明加盐与法规边界。

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

English version

对照数据表

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

files vers bundle +text all versions ratio
96 365 6365 324000 51
950 461 6461 2700000 418
6450 525 6525 19200000 2943
1024500 749 6749 3072000000 455179
bundle for 9 files and 6 versions:
salt16 bytes
file hash32 bytes
manuscript path128 bytes
version record53 bytes
log path96 bytes
anchored root and size40 bytes
total365 bytes
查看完整验算程序
# Chapter 6. p62: the smallest bundle that proves "this chapter, in this
# version, existed before that anchor".
# Two-level design: each version of the manuscript has a Merkle tree of
# its F files; each version record (seq 4 bytes, timestamp 17 bytes,
# manuscript root 32 bytes) is a leaf of an append-only version log of
# V records; the log root with its size (8 bytes) is anchored in a
# public record. Bundle = salt (16) + file hash (32) + manuscript path
# + record (53) + log path + anchored root and size (40). The file text
# itself is shown only if the owner chooses to disclose it. We compare
# with keeping every version of every file. Sizes are illustrative;
# the file size is 6000 bytes on average.
import math

H, SALT, REC, HEAD, FILE = 32, 16, 53, 40, 6000


def hops(n):
    return math.ceil(math.log2(n)) if n > 1 else 0


print("%6s %6s %8s %8s %13s %10s" % ("files", "vers", "bundle",
                                     "+text", "all versions", "ratio"))
for f, v in ((9, 6), (9, 50), (64, 50), (1024, 500)):
    bundle = SALT + H + H * hops(f) + REC + H * hops(v) + HEAD
    every = f * v * FILE
    print("%6d %6d %8d %8d %13d %10.0f" % (
        f, v, bundle, bundle + FILE, every, every / (bundle + FILE)))
f, v = 9, 6
parts = [("salt", SALT), ("file hash", H), ("manuscript path",
                                            H * hops(f)),
         ("version record", REC), ("log path", H * hops(v)),
         ("anchored root and size", HEAD)]
print("bundle for 9 files and 6 versions:")
for name, size in parts:
    print("  %-24s %4d bytes" % (name, size))
print("  %-24s %4d bytes" % ("total", int(math.fsum(s for _, s in parts))))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《默克尔树哈希链与可信时间戳、专著版本防篡改与优先权举证最小证明母典》第 6 章「优先权举证的最小证明包:追加一致性、两层结构与盐值遮蔽」(版本 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}
}

本书其他章节结论