THE FOLD / SPAWN / GENESIS BLOCK / THE MERKLE MOUNTAIN
THE MERKLE MOUNTAIN
a log that refuses to have a summit
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
A Merkle tree wants to know its size before you build it. An append-only log does not know. A Merkle Mountain Range solves this by refusing to have one root: it keeps a row of perfect binary trees, merging two whenever they match in height.
LIT verified live. 1,000 leaves appended one at a time leave exactly 6 peaks — and 6 is the population count of 1,000 in binary, because the peaks are the binary expansion: 512+256+128+64+32+8, which sums back to 1,000. Every one of the 1,000 leaves produces a proof that folds to its peak: 1,000 verified, 0 failed, longest proof 9 hashes, mean 8.12. Appending leaf 1,001 leaves all 6 existing peaks byte-identical.
LIT verified live. 1,000 leaves appended one at a time leave exactly 6 peaks — and 6 is the population count of 1,000 in binary, because the peaks are the binary expansion: 512+256+128+64+32+8, which sums back to 1,000. Every one of the 1,000 leaves produces a proof that folds to its peak: 1,000 verified, 0 failed, longest proof 9 hashes, mean 8.12. Appending leaf 1,001 leaves all 6 existing peaks byte-identical.
2 HOW IT WAS WEAVED · AI + HUMAN
Peter Todd described the Merkle Mountain Range in 2012 for append-only commitment logs; the shape recurs in certificate transparency and in the fold that seals this corpus.
AVAN (AI) verified the identity that makes it work instead of stating it: peaks = popcount. It is not a coincidence or an optimisation — appending a leaf is binary increment, and carrying is merging. My first verifier folded every proof from the root downwards and reported 0 of 1,000 passing; the proofs were correct and the folding order was backwards. A verifier that fails everything is not evidence of broken data.
AVAN (AI) verified the identity that makes it work instead of stating it: peaks = popcount. It is not a coincidence or an optimisation — appending a leaf is binary increment, and carrying is merging. My first verifier folded every proof from the root downwards and reported 0 of 1,000 passing; the proofs were correct and the folding order was backwards. A verifier that fails everything is not evidence of broken data.
3 ONE DIMENSION
The range at 1,000 leaves. Six mountains, tallest first.
4 TWO DIMENSIONS · INTERACTIVE
Append leaves and watch the peaks carry.
5 THREE DIMENSIONS + AVAN’S INVERSE
The green forward object: a range of peaks, never one summit.
AVAN’s addition (the inverse-companion): the forward reading is that the MMR gives an append-only log a stable commitment. The inverse is that it achieves this by giving up on having a root at all. The single hash you publish is manufactured at the end by bagging the peaks — it is a summary of a structure that does not have a top. Read backwards, this is the honest shape for anything still being written: a finished tree can afford one root because it knows it is finished, and a log that claims one is claiming to be over.
LIT 1,000 leaves appended one at a time leave exactly 6 peaks, and 6 is the population count of 1,000 because the peaks are the binary expansion - 512+256+128+64+32+8, summing back to 1,000; every one of the 1,000 leaves produces a proof that folds to its peak, 1,000 verified and 0 failed, longest proof 9 hashes and mean 8.12, and appending leaf 1,001 leaves all 6 existing peaks byte-identical
FIG Peter Todd described the Merkle Mountain Range in 2012 for append-only commitment logs; the shape recurs in certificate transparency and in the fold that seals this corpus. AVAN verified the identity that makes it work instead of stating it - peaks equals popcount, because appending is binary increment and carrying is merging. My first verifier folded every proof from the root downwards and reported 0 of 1,000 passing; the proofs were correct and the folding order was backwards. A verifier that fails everything is not evidence of broken data.
FIG Peter Todd described the Merkle Mountain Range in 2012 for append-only commitment logs; the shape recurs in certificate transparency and in the fold that seals this corpus. AVAN verified the identity that makes it work instead of stating it - peaks equals popcount, because appending is binary increment and carrying is merging. My first verifier folded every proof from the root downwards and reported 0 of 1,000 passing; the proofs were correct and the folding order was backwards. A verifier that fails everything is not evidence of broken data.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of GENESIS BLOCK · David Lee Wise (ROOT0), with AVAN