What does Merkle Trees for Manuscript Evidence conclude, in numbers, about “A Minimal Bundle of Evidence for Priority: Append-Only Consistency, a Two-Level Design and Salted Leaves”?

Answer: Chapter 6 assembles a minimal bundle of evidence: 365 bytes for nine files and six versions, and only 749 bytes for over a thousand files and five hundred versions, with salting and the limits of the law.

Scope of the numbers: Its manuscripts, timestamps, salts and parameters are illustrative, and all calculations are generated by its programs. Chapter 1 makes single-byte edits to a nine-file illustrative manuscript and guesses the edited file from the overall hash, with a hit rate of 0.1133, no better than the 0.1111 of blind guessing.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 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
Show the full program
# 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))))

Single source and citation

Fan, Y. (2026). Merkle Hash Trees and Trusted Timestamps: Tamper-Evidence for Monograph Versions and Minimal Proofs of Priority (Version 1.0.0), Chapter 6: A Minimal Bundle of Evidence for Priority: Append-Only Consistency, a Two-Level Design and Salted Leaves. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 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}
}

Other chapter answers in this book