What does Merkle Trees for Manuscript Evidence conclude, in numbers, about “Classical Sources East and West: Matched Fish Tallies and Hooke's Anagram”?

Answer: 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 an ancient practice of split verification and ordered rotation whose stated purpose was to guard against false summonses. Program p71 shows that with 3 halves in rotation a copy matches again at deliveries 5, 8, 11 and 14, while a Lamport one-way chain rejects every replay. Hooke's anagram of 1676 is a commitment: its sorted letters are exactly ceiiinosssttuv, with 1210809600 orderings, about 30.17 bits; but a small list of 46 words already spells 25 readings, so its binding rests on human judgement. The ancients saw rightly that the verifier must hold a credential first and that one should commit before revealing; they were limited by physical credentials that can be copied, rotation that permits replay and anagrams with more than one reading. The final chapter returns to the publishing house's own procedure: how the hash tree of each volume's manuscript and programs is written into its receipt, how the small tool is used, and what data would refute this book.

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: 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
Show the full program
# 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")

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 7: Classical Sources East and West: Matched Fish Tallies and Hooke's Anagram. 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