What does Merkle Trees for Manuscript Evidence conclude, in numbers, about “Hash Chains and Linked Timestamps: from the Linking Scheme of Haber and Stornetta to Anchoring Intervals”?

Answer: 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 the days of a year.

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: 0.7534, 3.10

40 versions over one year; version days fixed by seed
anchor Amean lagmax lagmean hopsopen share
10.0000.0000.0000
73.1060.2750.2795
3015.35281.5500.7534
9040.85884.8750.9233
365196.6036019.5000.9863
first five version days: [5, 8, 10, 16, 25]
Show the full program
# Chapter 4. p42: a private chain proves nothing until it is anchored.
# An author keeps a hash chain of versions on days drawn once (fixed
# seed) over a 365-day year. The chain head is copied into a public,
# widely kept record every A days (anchor days A, 2A, 3A and so on). A
# version written on day t can be shown to have existed only "before
# the first anchor on or after t"; until then the author could rewrite
# it, or slip in a back-dated version, without any outsider noticing.
# We print, per anchor interval: mean and max proof lag in days, mean
# chain hops from a version to its anchor, and the share of the year
# during which at least one version is still rewritable. Illustrative.
import math
import random

rng = random.Random(20261113)
DAYS = sorted(rng.sample(range(1, 366), 40))


def lag_hops(a):
    lags, hops = [], []
    for j, t in enumerate(DAYS):
        anchor = -(-t // a) * a
        lags.append(anchor - t)
        later = [u for u in DAYS[j + 1:] if u <= anchor]
        hops.append(len(later))
    return lags, hops


def open_share(a):
    # days on which some written version is not yet anchored
    open_days = 0
    for d in range(1, 366):
        last_anchor = (d // a) * a
        if any(last_anchor < t <= d for t in DAYS):
            open_days += 1
    return open_days / 365


print("40 versions over one year; version days fixed by seed")
print("%9s %9s %8s %10s %12s" % ("anchor A", "mean lag", "max lag",
                                 "mean hops", "open share"))
for a in (1, 7, 30, 90, 365):
    lags, hops = lag_hops(a)
    print("%9d %9.2f %8d %10.3f %12.4f" % (
        a, math.fsum(lags) / len(lags), max(lags),
        math.fsum(hops) / len(hops), open_share(a)))
print("first five version days:", DAYS[:5])

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 4: Hash Chains and Linked Timestamps: from the Linking Scheme of Haber and Stornetta to Anchoring Intervals. 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