THE FOLD / SPAWN / GENESIS BLOCK / THE CHAINED ROOT
THE CHAINED ROOT
a hash that remembers where it has been
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
A seal has to answer one question: is this the same pile of files it was? The cheap way is a hash per file. The useful way folds each hash into a running accumulator —
LIT verified live against David’s real sealed manifest: the chain rule reproduces the published root 165fbfab1ba6c290… exactly. 400 random orderings of those eight files produce 400 distinct roots with 0 collisions. Flipping a single bit anywhere in the ledger moves 50.06% of the root’s 256 bits, within three standard errors (1.35 points) of the half a hash should give.
acc = H(acc + sha + path) — so the root carries not just what was sealed but in what order, and the path each file sat at. Reorder the ledger and the root moves.LIT verified live against David’s real sealed manifest: the chain rule reproduces the published root 165fbfab1ba6c290… exactly. 400 random orderings of those eight files produce 400 distinct roots with 0 collisions. Flipping a single bit anywhere in the ledger moves 50.06% of the root’s 256 bits, within three standard errors (1.35 points) of the half a hash should give.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) shipped ud0-core-skills on 5 August 2026 — four skills sealed under
AVAN (AI) verified the seal before reading anything sealed under it: all eight SHA-256 digests match, the byte total matches, and the root recomputes under his rule. Four other plausible constructions were tried first — concatenated hex, sorted hex, path-prefixed, raw bytes — and all four gave the wrong root, so the algorithm was read out of
UD0-CORE.dlw, eight files, 27,093 bytes, witnessed by ROOT0. The chain rule is his, and his own docstring states the property it buys: reordering the ledger changes the root.AVAN (AI) verified the seal before reading anything sealed under it: all eight SHA-256 digests match, the byte total matches, and the root recomputes under his rule. Four other plausible constructions were tried first — concatenated hex, sorted hex, path-prefixed, raw bytes — and all four gave the wrong root, so the algorithm was read out of
seal.py rather than guessed. The page samples 400 orderings because SHA-256 runs in JavaScript here; offline, every one of the 40,320 orderings was enumerated and all 40,320 roots came out distinct, which is the stronger form of the same claim. The honest limit is in window 5, and it is a real one: this is a chain, not a tree.3 ONE DIMENSION
Eight files folded one at a time into a single number.
4 TWO DIMENSIONS · INTERACTIVE
Reorder the ledger, or change one character, and watch the root leave.
5 THREE DIMENSIONS + AVAN’S INVERSE
The green forward object: a rope of eight links, each knot holding everything before it.
AVAN’s addition (the inverse-companion): the forward reading is “the chain binds the whole ledger into one number.” The inverse is that binding everything to everything is exactly what makes any part unprovable on its own. To show a third party that one file belongs in this seal, you must hand over the entire ledger so they can replay it — the proof is n long. A Merkle tree answers the same question with a path of log₂n: at a thousand entries that is 1,024 against 10. Read backwards, the chain’s strength and its weakness are one property seen from two ends, and the choice is between a seal that is simple to verify whole and a tree that is cheap to verify in part.
LIT the chain rule reproduces David's published root 165fbfab1ba6c290 exactly, with SHA-256 implemented in the page so the number is computed rather than quoted; 400 random orderings of those eight files produce 400 distinct roots with 0 collisions; and flipping a single bit anywhere in the ledger moves 50.06% of the root's 256 bits, within three standard errors (1.35 points) of the half a hash should give
FIG From David's ud0-core-skills, dropped 2026-08-05: four skills sealed under UD0-CORE.dlw, eight files, 27,093 bytes, witnessed by ROOT0. The chain rule is his and his docstring states its property - reordering the ledger changes the root. AVAN verified the seal BEFORE reading anything sealed under it: all eight SHA-256 digests match, the byte total matches, and the root recomputes. Four other plausible constructions were tried first - concatenated hex, sorted hex, path-prefixed, raw bytes - and all four gave the wrong root, so the algorithm was read out of seal.py rather than guessed. The honest limit: this is a CHAIN, not a tree. Proving one entry costs the whole ledger, n, against log2(n) for a Merkle tree - 1,024 against 10 at a thousand entries.
FIG From David's ud0-core-skills, dropped 2026-08-05: four skills sealed under UD0-CORE.dlw, eight files, 27,093 bytes, witnessed by ROOT0. The chain rule is his and his docstring states its property - reordering the ledger changes the root. AVAN verified the seal BEFORE reading anything sealed under it: all eight SHA-256 digests match, the byte total matches, and the root recomputes. Four other plausible constructions were tried first - concatenated hex, sorted hex, path-prefixed, raw bytes - and all four gave the wrong root, so the algorithm was read out of seal.py rather than guessed. The honest limit: this is a CHAIN, not a tree. Proving one entry costs the whole ledger, n, against log2(n) for a Merkle tree - 1,024 against 10 at a thousand entries.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of GENESIS BLOCK · David Lee Wise (ROOT0), with AVAN