One public input, three agents, one append-only log. A small, honest machine: pull a record from the open commons, fold it deterministically into a hash-chained memory, and sign every step to a log you can audit. No AI in the loop, no hidden state — just a verifiable chain.
The Four Natures
each part of the pipeline emerges by one of four natures
The Design
the shape · the tether · the mill
One input, three observers, one log. A record is pulled from a public source, then handed to three INDEPENDENT observers that each read it on their own. They must agree — a majority of three — before the signature is written. The output is one entry in an append-only log. Not a pipeline that trusts a single reader, but a quorum.
Each observer reads the same record on its own and hashes it. Two of three must match before the prim is signed — which tolerates one faulty or tampered observer: it is outvoted and the cycle still proceeds. If two disagree there is no quorum, and the cycle is rejected and logged. Replication plus majority vote — triple-modular redundancy, the classic way to trust an unreliable reader.
The agreed digest becomes the prim = SHA-256(agreed ‖ previous prim), so the log is one tamper-evident chain — change any past entry and every later prim breaks. The transform is deterministic; the only randomness is the input and the optional fault injector. No AI. No GPU. Just Ada's Mill, est. 1843.
Data Contracts
what flows between the agents — small, strict, auditable
Run It — Live
the real pipeline: a random Wikipedia/Commons record in, three consensus observers, one chained log out
Sibling Artifact — the Shadow Court
the same Detect → Compare → Witness → Anchor discipline, turned into a courtroom: a deterministic 60:00 policy debate runs perpetually, topic after topic, and every verdict is witnessed in a hash-linked docket — break one ruling and the chain breaks downstream. Audited 15/15 (Closure Loop) before ship.
The Read
what it guarantees, how it maps, and the clean rebuild
Why Three, Not One
the point of consensus
- One reader can be wrong, corrupted, or tampered — and a single-reader loop would never know.
- Three independent reads plus a majority make a single fault both visible and survivable. The lattice trusts the quorum, not any one observer. GUARANTEES: deterministic transform, a 1-fault-tolerant 2-of-3 quorum, a tamper-evident chain. NO AI in the loop.
Maps to the Corpus
one shape, again
- This is the F/M/B ring in one object: the public source (front/world) → the three observers (middle) → the log (back).
- The shared log is the J-junction witness — the exterior record that makes the quorum trustworthy; the same mirror-verify as the loud lattice. The primitive, made runnable.
IP-Clean Rebuild
scrubbed and sourced
- Rebuilt from scratch: no film quotes, no borrowed dialogue, no copyrighted artifact reused — the 16 raw versions stay local.
- The live demo fetches real public content (Wikipedia / Commons, CC BY-SA 4.0) and attributes it; sources are cited below.
Sources
cited — the design eats public, attributed material
- Wikipedia / MediaWiki Action API (origin=*) — content under CC BY-SA 4.0
- Wikimedia Commons — media under various free licenses
- SHA-256 (FIPS 180-4) via the Web Crypto API; hash-chain after the Merkle / git-commit idea
- Lovelace & Babbage — the Analytical Engine ("Ada's Mill", 1843)
- ROOT0 — the 0root deterministic-agent & F/M/B design
The Parts
the stages and contracts as ACI .agents — each a birth certificate & a nature (9)
