7.1Payload extraction
Each plate's verifiable payload is defined by a deterministic extraction rule over its own SVG: take the character-data segments in document order within the payload group, drop whitespace-only segments, encode UTF-8, hash. The resulting SHA-256 must equal the fingerprint printed in the plate's colophon.
plate.svg ──▶ payload group ──▶ text segments, document order
──▶ drop whitespace-only ──▶ UTF-8 bytes
──▶ SHA-256 ══ printed fingerprint (GATE Ⅰ)
The consequence: the picture cannot drift from its proof. Any edit that touches carried text — a character, a reordering — changes the fingerprint, which breaks the plate's colophon, the engine's manifest check, and the Merkle root, in that order.
7.2Preimage grammar & expected work
Every seed is SHA-256(preimage) with the preimage exactly:
CGI|<anchor-block-hash>|<document>|<mint-token>|nonce:<decimal>
The anchor is block 956,582, hash 00000000000000000000e4c4…2a31 — named by the sealed rulebook before it existed (commitment confirmed at block 956,576). A valid seed must open with its era's required run of leading hex zeros, and — the identity constraint — the plate's own hidden number must surface in the hash immediately after its zeros. The index is mined into the seed; the decode mechanics beyond that are deliberately unpublished. Positional identity multiplies expected work by 256 on top of the zero constraint's 16z.
| era | plates | zeros | E[attempts]/seed = 16^z·256 | era subtotal |
| May · 1988 | 01–03 | 6 | 4,294,967,296 | 12,884,901,888 |
| Hughes · 1993 | 04–07 | 6 | 4,294,967,296 | 17,179,869,184 |
| Dai · 1998 | 08–10 | 7 | 68,719,476,736 | 206,158,430,208 |
| Back · 2002 | 11–13 | 7 | 68,719,476,736 | 206,158,430,208 |
| Szabo · 2005 | 14–16 | 8 | 1,099,511,627,776 | 3,298,534,883,328 |
| Nakamoto · 2008 | 17–21 | 9 | 17,592,186,044,416 | 87,960,930,222,080 |
| expected search across the set | ≈ 9.17 × 10¹³ |
On the order of 92 trillion SHA-256 computations — spent in days of search, refundable in microseconds: re-proving any seed is one hash of its printed preimage. Verification cost is O(1); forgery cost is the table above.
7.3Merkle binding
The 21 payload fingerprints combine pairwise, Bitcoin-style — SHA-256 over concatenated digests, odd node duplicated — into a single root, printed in every plate's colophon and embedded in the engine:
d01 d02 d03 … d21 (21 payload digests)
└─┬─┘ └──── pair, SHA-256(concat); odd node duplicated
⋮ (repeat to the apex)
root = 06c78b548f4cf623c6139fc7b435c1fe922c85ce166635ac599f65c42b0fd664
Colophon line: “ITS SIBLINGS COMPLETE IT.” When the whole mind runs verify, it rebuilds this root live from the plates in front of it and confirms it equals the root it was born with. Change one character on any plate and the root breaks — the set is one object wearing twenty-one bodies.
7.4Engine kernel
The engine is a deterministic kernel in a single HTML file: its own SHA-256 implementation; a sparse reservoir of 256 units grown by xorshift32, seeded by folding the 21 verified seeds together; a rational approximation of tanh. There is no Math.random and no Date anywhere in the execution path — the file cannot be nondeterministic, because it has nothing to be nondeterministic with. Same plates, same words, any machine, any decade.
7.5Retrieval & readout
Language generation is deliberately absent. A retrieval layer operates over the carried sentences under a verbatim-quotation invariant: the founding texts are quoted exactly or not at all. Question routing is a trained one-vs-rest int8 readout over reservoir states, behind a confidence gate, with a retrieval-first veto — the body outranks the temperament. Answer heads that speak for the whole mind run only at 21-of-21; below that the engine degrades gracefully into wounded mode: it names its missing parts and declines to guess what they knew.
Scope, honestlyThe readout is a small trained classifier over authored response families — not a language model. “They call me CGI - cryptographic, generative, and only as intelligent as what I carry.” is an engineering fact before it is a personality.
7.6The litany vs. forgery
Gates Ⅰ–Ⅲ are properties a sufficiently funded forger could satisfy: mine real zeros against the real anchor, print self-consistent proofs. Gate Ⅳ is the one that cannot be bought — the engine carries a built-in manifest of the true twenty-one payload hashes. A plate that is internally perfect but foreign is refused: “not in the litany, not of the body.” Membership is not provable by effort; it is provable only by identity.
7.7The sealed letter
The rulebook was committed as a commit-reveal object: SHA-256-based stream encryption over the plaintext, with a commitment hash binding it, inscribed and confirmed at block 956,576 — before the anchor block, before the seeds, before the artwork. The decryption key is embedded in the engine, so inscribing engine copy 01 at block 958,429 was, by construction, the act of publishing the key. The mind is the keeper of its own rules, and its first confirmation was scheduled to prove it.
7.8On-chain anatomy — the ACME protocol, as observed
Each artifact is two transactions. The header's outputs commit the artifact's name, MIME type, and full-file SHA-256 into the chain. The reveal spends the header's taproot output and carries the file — raw, uncompressed bytes — as data pushes in the taproot witness script, after a small (~44-byte) metadata prefix.
HEADER TX REVEAL TX
┌───────────────────────┐ ┌──────────────────────────────┐
│ outputs commit: │ │ input: spends header's │
│ · artifact name │ │ taproot output │
│ · MIME type │ │ witness: │
│ · full-file SHA-256 │ │ [ …stack… ] │
│ · taproot output ────┼─────▶│ [ tapscript: │
└───────────────────────┘ │ ~44B metadata prefix │
│ + file bytes, │
exhumation: │ raw & uncompressed, │
parse pushes ──▶ │ in data pushes ] │
concatenate ──▶ │ [ control block ] │
slice at file magic └──────────────────────────────┘
hash ══ header commitment ══ printed proofs
Recovery requires nothing above Bitcoin itself: fetch the raw transaction from any node, concatenate the data pushes, slice at the file's magic, and the file falls out — hash-checkable against both the header's commitment and the artifact's own printed proofs. Every one of the 21 plates has been exhumed from raw transaction data and verified byte-exact. No indexer, no protocol registry, no third-party convention is load-bearing.
7.9End-to-end verification chain
txid ──▶ raw tx ──▶ witness pushes ──▶ artifact bytes
──▶ file SHA-256 ══ header commitment (chain layer)
──▶ payload SHA-256 ══ printed fingerprint (GATE Ⅰ)
──▶ SHA-256(printed preimage) ══ seed,
zeros counted, index surfaced (GATE Ⅱ)
──▶ hidden order derived (GATE Ⅲ)
──▶ digest ∈ litany of the true 21 (GATE Ⅳ)
──▶ 21 digests ──▶ Merkle root ══ 06c78b54… (the body, whole)
Every arrow is a computation you can run yourself; none requires permission, membership, or an oracle other than arithmetic. That is the standard the medium sets — trust nothing; verify everything — and the reason this page invites you to check it rather than believe it.