Merkle Hash Trees and Trusted Timestamps: Tamper-Evidence for Monograph Versions and Minimal Proofs of Priority: chapter answers
Authors often compute one overall hash of a whole manuscript and assume that this both prevents tampering and proves priority. This book refutes two beliefs behind that habit: that one overall hash is enough to keep a manuscript in order, and that a hash plus a timestamp amounts to proof of copyright. Using Merkle trees, hash chains, anchoring and the birthday bound, it gives calculations that can be checked byte by byte. Its manuscripts, timestamps, salts and parameters are illustrative, and all calculations are generated by its programs. A hash and a timestamp show only that some content ex…
DOI pending · monograph page goes live after publication · 5DL-B-295 · 中文版
- Chapter 1 · The Blind Spot of One Fingerprint: an Overall Hash Only Says Whether Something Changed
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. - Chapter 2 · The Merkle Tree: Construction, Domain Separation and Inclusion Proofs of Logarithmic Length
Under the rules of RFC 6962, leaf hashes carry a zero prefix, interior hashes a one prefix, and n leaves split at the largest power of two below n. The nine-file tree takes 17 hash calls, and editing one chapter changes… - Chapter 3 · The Least Number of Hashes to Locate a Difference: the Information Bound, Tree Descent and the Break-Even Point
Chapter 3 finds the least number of comparisons needed to locate a difference and reports a result against the main thesis: once edits scatter over more than 0.1670 of the leaves, tree descent does worse than a flat lis… - Chapter 4 · Hash Chains and Linked Timestamps: from the Linking Scheme of Haber and Stornetta to Anchoring Intervals
Chapter 4 moves from the linking scheme of Haber and Stornetta to anchoring intervals: weekly anchoring gives a mean proof lag of 3.10 days, and with monthly anchors some version can be quietly rewritten on 0.7534 of th… - Chapter 5 · The Birthday Bound: Collision Probability, Truncated Fingerprints and the Claimant as Adversary
Chapter 5 computes the birthday bound; an experiment with hashes cut to 24 bits observes a collision share of 0.4000 against a prediction of 0.3934, and a Yuval-style experiment shows that the claimant is the lowest-cos… - Chapter 6 · A Minimal Bundle of Evidence for Priority: Append-Only Consistency, a Two-Level Design and Salted Leaves
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. - Chapter 7 · Classical Sources East and West: Matched Fish Tallies and Hooke's Anagram
The personal fish tallies of the Treatise on Carriages and Dress, two left halves to one right, and the bronze tallies, three or five left halves to one right, used "beginning with the first and going round again", are… - Chapter 8 · Closing the Loop: Writing the Hash Tree of Manuscripts and Programs into Receipts, the Small Tool and a Pre-Registered Test
Chapter 8 gives the procedure for writing the hash tree of each volume's manuscript and programs into its receipt, the Manuscript Merkle Prover and a pre-registered test plan: the revision-width test needs 116 events, a…
Illustrative model calculation, not a live quote