An append-only log whose history cannot be rewritten without detection.
A signature proves who wrote something; it cannot prove that everyone was shown the same something. That is what this is for. The log publishes one 32-byte root per size, and answers two questions:
- Inclusion: "is this entry in the log of size n?" — an audit path of about log₂(n) hashes.
- Consistency: "is the log of size m a prefix of the log of size n?" — the proof that nothing already published was altered or removed.
Consistency is the one that matters. Without it a server can show one history to a victim and another to everyone else; with it, doing so requires producing two roots for one size, which is permanent, transferable evidence of misbehaviour.
The hashing follows RFC 6962: leaves are prefixed 0x00 and internal nodes
0x01, so a leaf can never be reinterpreted as a node — the second-preimage
attack that an unprefixed Merkle tree allows.
What a log cannot do by itself
It cannot detect a split view on its own: two divergent logs are each internally consistent. Catching that needs witnesses — independent parties who gossip roots and refuse to sign two roots for one size. Nothing here implements witnessing, and a log without it is a promise, not a proof.