The gate board · build 2026-07-10
We ship gates,
not dates.
Every mechanism in the MindChain corpus, with its status as of this build.
A visitor who distrusts every sentence of our copy can ignore it all and read this board —
which is, precisely, the copy. Source: noosphere/04-experiments-and-falsifiers.md +
noosphere/04-addendum-A.md; run log noosphere/VERIFICATION-2026-07-11.md.
109Mechanisms on the board
Every row carries preregistered pass and kill thresholds.
84Defined
Registered with thresholds fixed; the experiment has not run.
12Partial
A bounded sub-claim measured or modeled at lab scale.
7Passed
The row's own lab gate ran green in this build.
Base chain, consensus, execution, settlement (ch04 §3.1)
| Mechanism | Status | Claim (one line) | Artifact / source |
|---|---|---|---|
| A-GROUND BUILDABLE | DEFINED | Transparent BLAKE3 Hashcash Ground ticket paces proposals without AI dependence. | ch04 §3.1 |
| A-BRAID BUILDABLE | DEFINED | Base proposal/finality operates with AI demand and AI services absent. | ch04 §3.1 · E-BLACKOUT-01 |
| A-PULSE / M-PULSE BUILDABLE | DEFINED | Exact fixed-point ASERT-like retarget; never consults GPU type or job value. | ch04 §3.1 |
| A-RING BUILDABLE | DEFINED | Witness Ring checkpoint finality safe under the declared Byzantine bound. | ch04 §3.1 |
| A-LUMEN BUILDABLE | DEFINED | Transparent notes, spend trees, segregated witnesses, proof-gated spends. | ch04 §3.1 |
| A-TX BUILDABLE | DEFINED | Canonical transaction/receipt encodings bind chain, version, suite, evidence roots. | ch04 §3.1 |
| A-GRAIN BUILDABLE | DEFINED | The 12-opcode total noun calculus as authoritative execution semantics. | ch04 §3.1 · E-GRAIN-01 |
| A-JET-FALLBACK BUILDABLE | DEFINED | Any jet can be quarantined and pure Grain resumed without changing meaning. | ch04 §3.1 · E-JET-01 |
| A-FEES BUILDABLE | DEFINED | Fees separately meter bytes, verification, private evaluation, persistent state. | ch04 §3.1 |
| A-DA BUILDABLE | DEFINED | Every consensus-required byte recoverable under declared erasure/adversary bounds. | ch04 §3.1 |
| A-AGENT-ABI BUILDABLE | DEFINED | Typed Intent + attenuated CapabilityGrant; text never directly authorizes effects. | ch04 §3.1 · E-AGENT-01 |
| A-ASSURANCE BUILDABLE | DEFINED | Receipts expose V0–V3 correctness separately from confidentiality and quality. | ch04 §3.1 |
| A-TOPOLOGY BUILDABLE | DEFINED | Fail-closed process isolation; optional-worker failure cannot corrupt state. | ch04 §3.1 |
| A-WALLET BUILDABLE | DEFINED | Purpose-separated authorities from one mnemonic without authority collapse. | ch04 §3.1 |
| A-NETWORK BUILDABLE | DEFINED | Versioned transport; AI traffic never outranks consensus traffic. | ch04 §3.1 |
| A-GOVERNANCE BUILDABLE | DEFINED | Governance schedules parameters; cannot forge finality or bypass caps/delays. | ch04 §3.1 |
Useful work, proof work, economics (ch04 §3.2)
| Mechanism | Status | Claim (one line) | Artifact / source |
|---|---|---|---|
| A-LOOM-MARKET BUILDABLE | DEFINED | Escrowed jobs bind requester, worker, evaluator, deadlines, refund; no consensus credit implied. | ch04 §3.2 |
| M-TENSOR BUILDABLE | DEFINED | Commit-before-beacon tensor receipt binds commitments, challenge, output root. | ch04 §3.2 · E-PEARL-01 |
| M-RESIDUE BUILDABLE | PARTIAL | Exact Freivalds soundness ≤|S|⁻ᵗ; toy-field enumeration + measured kt-ladder relation at lab scale. | frontier-lab/math · kt-verification-ladder |
| M-HDF THEORY | KILLED | Universal Hadamard-diffusion conjecture RETIRED by exhaustive counterexample (char-2 collapse, pointwise dominance disproved). | ch02 §3 · frontier-lab/math/checker.py |
| M-HDF-ENERGY PROVED, narrow | PASSED | The survivor: unbiased sampled-energy estimator, Var ≤ 8‖E‖⁴_F/s, precommitted residuals only — 10/10 checker gates. | frontier-lab/math/checker.py |
| S-HDF THEORY | KILLED | Living-model audit profile inherits the M-HDF retirement; narrow profile only. | ch04 §3.2 · ch02 §3 |
| A-LOOM-CREDIT / M-OMEGA THEORY | DEFINED | Algorithm-neutral measured work credits a bounded lane; Pulse absorbs honest speedups. Paper 06. | papers/06 · E-FMM-01 |
| M-PROOFPOWER THEORY | DEFINED | Matured, decaying, non-self-dealing receipts add a hard-capped finality bonus. | ch04 §3.2 · E-WASH-01 |
| M-ISSUANCE BUILDABLE | DEFINED | Fixed max supply and per-height envelope; useful work never creates extra mint. | ch04 §3.2 |
| A-DUPLEX-ISSUANCE THEORY | DEFINED | Bounded reallocation of scheduled issuance to externally demanded jobs. | ch04 §3.2 · E-DEMAND-01 |
| S-DEMAND / P4 THEORY | DEFINED | Paid-delivery certificates classify INDEPENDENT/RELATED/SUBSIDIZED/UNKNOWN. | ch04 §3.2 · E-DEMAND-01 |
| P1 / S-DUAL-ROOT THEORY | DEFINED | Stable ArtifactID separated from fresh challenge-bound WorkCommit. | ch04 §3.2 |
| P2 / S-FUSED-AUDIT THEORY | DEFINED | Post-commit audit may reuse an on-chip randomized HD transform; bounded by the M-HDF retirement. | ch04 §3.2 · E-HDF-01 |
| P3 / S-ALGORITHM-TRANSITION THEORY | DEFINED | New-matmul transition auction: activate only after two independent reproductions. | ch04 §3.2 · E-FMM-01 |
| P5 / S-KERNEL-JET THEORY | DEFINED | Optimized kernels bond against a canonical slow relation. | ch04 §3.2 · E-KERNEL-01 |
Grain jets and proof infrastructure (ch04 §3.3)
| Mechanism | Status | Claim (one line) | Artifact / source |
|---|---|---|---|
| M-JET BUILDABLE | DEFINED | Exact observational equality between bounded Grain formula and jet, with versioned JetCert. | ch04 §3.3 · E-JET-01 |
| A-JET-CERT THEORY | DEFINED | Machine-checked certificates for universal jet-class equivalence. | ch04 §3.3 |
| Recursive receipt verifier BUILDABLE profile | PARTIAL | Real RISC Zero Groth16 receipts produced and verified at lab scale (288 B settlement); two-verifier campaign not run. | zkvm-port/README.md |
Umbra privacy and causal state (ch04 §3.4)
| Mechanism | Status | Claim (one line) | Artifact / source |
|---|---|---|---|
| A-UMBRA-BASE BUILDABLE | DEFINED | Commitments, nullifiers, stealth envelopes coexist with Lumen from genesis. Ships dark. | ch04 §3.4 · E-UMBRA-01 |
| M-FIBER / A-UMBRA-CAUSAL THEORY | DEFINED | Encrypted state binds ciphertext root, causal root, key epoch, rights root, budget. | ch04 §3.4 |
| Proof-carrying refresh THEORY | DEFINED | Refresh proves plaintext continuity under named suite and key epoch. | ch04 §3.4 |
| Privacy-depth market THEORY | DEFINED | Published depth/noise/leakage budget prices evaluation and refresh. | ch04 §3.4 |
| A-UMBRA-HIDDEN DREAM | DEFINED | Hidden-footprint concurrency conceals read/write sets while proving nonconflict. | ch04 §3.4 |
| M-BRANCH BUILDABLE | DEFINED | One registered family root; at most one separately authorized branch activates. | ch04 §3.4 · E-DREAM-01 |
| Octra-derived HFHE suite THEORY | DEFINED | Rejected as consensus crypto until cryptanalysis gates pass. | ch04 §3.4 · E-HFHE-01 |
| A-KEYLESS-CONSENSUS THEORY | DEFINED | Consensus never possesses a universal decryption key. | ch04 §3.4 · E-KEYS-01 |
Species, learning, verification, memory, agents (ch04 §3.5)
| Mechanism | Status | Claim (one line) | Artifact / source |
|---|---|---|---|
| S-ARTIFACT BUILDABLE | DEFINED | Immutable content-addressed model artifacts, erasure-coded and topology-local. | ch04 §3.5 |
| S-PROOF-ARCH BUILDABLE | DEFINED | Numeric profiles, checkpoints, commitments declared in model manifests. | ch04 §3.5 |
| S-GPU-COMMIT BUILDABLE arch | DEFINED | GPU-resident commitment generation; no H100 speed figure presumed. | ch04 §3.5 |
| S-SPECIES BUILDABLE | DEFINED | Immutable artifact/derivation/equivalence graph; no privileged current_weights file. | ch04 §3.5 |
| M-QUOTIENT / S-SPECIES-QUOTIENT THEORY | DEFINED | Rotating public + hidden suites make suite-relative equivalence robust. | ch04 §3.5 |
| S-REACTION THEORY | DEFINED | Immutable Reactions transform parents into candidates; no direct pointer writes. | ch04 §3.5 |
| S-UPDATE BUILDABLE | DEFINED | Canonical UpdatePacket carries deltas with provenance and profile. | ch04 §3.5 |
| S-RL-LAG BUILDABLE | DEFINED | Rollouts bind versions; exact lag bands accept/downweight/reject. | ch04 §3.5 |
| M-ADJOINT / S-ADJOINT / S-CAPSULE THEORY | DEFINED | Adjoint-dual receipts show updates consistent with committed computation. | ch04 §3.5 · E-ADJOINT-01 |
| S-TOPLOC BUILDABLE | DEFINED | Hidden-state fingerprints evidence execution fidelity for named profiles. | ch04 §3.5 |
| S-QUALITY BUILDABLE/THEORY | DEFINED | Evaluator receipts pay for quality evidence; diversity-weighted aggregation resists collusion. | ch04 §3.5 |
| S-CHORUS THEORY | DEFINED | Phones verify projection slices and testify by diversity domain; they never mine. | ch04 §3.5 · E-CHORUS-01 |
| S-LOAM-BASE BUILDABLE | DEFINED | Local-first store: content, provenance, rights authoritative; indexes disposable. | ch04 §3.5 |
| S-LOAM THEORY | DEFINED | Derived memory inherits obligations; revocation computes repair debt. | ch04 §3.5 · E-RIGHTS-01 |
| S-AGENT BUILDABLE | DEFINED | Stable AgentID; capabilities, mandates, typed intent gate bound authority. | ch04 §3.5 · E-AGENT-01 |
| S-FREYSA BUILDABLE regression | DEFINED | Incoming-donation language can never authorize an outgoing transfer. | ch04 §3.5 |
| S-COMMERCE / S-ACP BUILDABLE | DEFINED | Job lifecycle with explicit terminals and availability-coupled clocks. | ch04 §3.5 |
| S-PRIVACY-IR THEORY | DEFINED | Typed ops compile to PSI/PIR/MPC/TEE/FHE/ZK with explicit trust manifests. | ch04 §3.5 |
| S-ATTRIBUTION THEORY | DEFINED | Contribution graph with anti-self-dealing evidence and decay. | ch04 §3.5 |
| S-ACCESS BUILDABLE | DEFINED | Identity recovery and artifact fetch through ≥3 independent paths. | ch04 §3.5 |
| S-LIFECYCLE BUILDABLE | DEFINED | Promotion is delayed, availability-gated, reversible to a retained parent. | ch04 §3.5 |
| S-TWIN-PROFILE BUILDABLE | DEFINED | Revocable consent-bounded observation bundle; never the person. | ch04 §3.5 |
| S-DREAM / S-TWIN DREAM | DEFINED | Consent-bound persona simulates sealed futures; zero authority. | ch04 §3.5 |
| S-DREAM-LANE DREAM | KILLED | Production gate FAILED in simulation: manipulation nets 21.7× the fee (v1) and no premium ≤ 2× break-even separates honest from manipulative influence (v2). Lane stays dead. | dream-lane/ · papers/03 |
| M-CLOCK BUILDABLE | DEFINED | Deterministic fork tuple; Loom share hard-capped at 10%. | ch04 §3.5 · E-CLOCK-01 |
| S-GLOBAL-ORGANISM DREAM | DEFINED | No production threshold exists; component evidence only. | ch04 §3.5 |
Neural Execution Lane (ch04 §3.6)
| Mechanism | Status | Claim (one line) | Artifact / source |
|---|---|---|---|
| N-PROFILE THEORY | PARTIAL | Frozen W8A8 profile: CPU dual-implementation bit-exactness + schedule invariance PASSED on real weights (Handshake v0); cross-vendor GPU gate remains OPEN Gate 1. | nel-real-inference/ · papers/02 · E-NEL-01 |
| N-TOKEN-STATE BUILDABLE | DEFINED | Canonical S_t/TokenClaim transition binds job, model, position, roots, signatures. | ch04 §3.6 |
| N-CHUNK-FREIVALDS THEORY | PARTIAL | Cycle-model MEASURED: 1.8669 c/MAC leaf, 1/T law, 12.67× at T=128; real 288 B Groth16 leaf receipt. No real prover at 0.5B yet. | nel-dispute-ladder/ · zkvm-port/ · papers/01 |
| N-BISECT BUILDABLE | PARTIAL | token → layer → op → leaf descent measured on the deterministic harness incl. attack corpus. | nel-dispute-ladder/ · nel-attack-lab/ |
| N-ACT-DA BUILDABLE | DEFINED | Availability certificate precedes every challenge clock. | ch04 §3.6 · E-NEL-05 |
| N-KV-REPLAY BUILDABLE | DEFINED | Logical KV from committed history; checkpoints untrusted, replay canonical. | ch04 §3.6 |
| N-SAMPLER THEORY | DEFINED | Greedy Phase B randomness-free; stochastic sampling from a threshold beacon. | ch04 §3.6 · E-NEL-07 |
| N-TEE-FIBER THEORY | DEFINED | TEE-private prompts are a separately named weaker assurance class. | ch04 §3.6 · E-NEL-08 |
Weft language and certificates (ch04 §3.7 + addendum A)
| Mechanism | Status | Claim (one line) | Artifact / source |
|---|---|---|---|
| E-WEFT-01 BUILDABLE | DEFINED | Full gate: independently authored Rust and Go elaborators, 10⁷ generated units. | ch04 §3.7 |
| E-WEFT-01a lab gate | PASSED | Dual-VM faithfulness at lab scale: Python and Node evaluators, 10,024 cases (24 corpus + 10,000 fuzz, seed 20260711), 0 divergences in result nouns AND meter charges. | weft-v0/tests/dual_eval.py · addendum A |
| E-WEFT-02 THEORY | DEFINED | Full gate: zero overruns in 10⁷ adversarial evaluations. | ch04 §3.7 |
| E-WEFT-02a lab gate | PASSED | Tightness at lab scale: 0 overruns across the corpus; ratio min 0.1125 / median 0.2614 / max 0.9995. Audit exposed and fixed a latent v0 cost-annotation defect (derive_span). | weft-v0/tests/tightness.py · addendum A |
| E-WEFT-03 THEORY | PARTIAL | Derived-verifier parity lab gates green: meter 89085 unchanged, root byte identity 1. | weft-v0/run_tests.py |
| E-WEFT-04 BUILDABLE | PARTIAL | Linearity enforced by the v0.2 checker (E-LIN error family) on the lab corpus; 10⁷ fuzz campaign not run. | weft-v0/negative/ |
| E-WEFT-05 THEORY | DEFINED | Beacon-order noninterference via indexed types. | ch04 §3.7 |
| E-WEFT-06 THEORY | DEFINED | Jet-certificate market game finds divergence before it extracts value. | ch04 §3.7 |
| E-WEFT-07 DREAM | DEFINED | Rights-row decidability and ergonomics. | ch04 §3.7 |
| E-WEFT-08 BUILDABLE | DEFINED | v0 sufficiency fallback gate — measures whether the full language is necessary. | ch04 §3.7 |
Hearth and Swarm (ch04 §3.8)
| Mechanism | Status | Claim (one line) | Artifact / source |
|---|---|---|---|
| H-HEARTH BUILDABLE, gated | DEFINED | One household as a bonded executor; slashable form gated on N-PROFILE's vendor gate. | ch04 §3.8 · E-HEARTH-01 |
| H-FEDERATE BUILDABLE | PARTIAL | Zero cross-replica bytes/token federation; swarm bands MODELED with soundness gates green. | swarm-agent-sim/ · research/05 |
| H-SEED BUILDABLE | PARTIAL | 8-of-12 erasure seeding, 5.94× MODELED speedup over single-source. | swarm-agent-sim/ · ch04 §3.8 |
| H-AUDIT THEORY | PARTIAL | Phone-priced escalation ladder; leaf constants cycle-model MEASURED, silicon margins not. | nel-dispute-ladder/ · ch04 §3.8 |
| H-REPAIR BUILDABLE | PARTIAL | Churn survival via replication classes + committed-state recompute; MODELED. | swarm-agent-sim/ · ch04 §3.8 |
| H-TRAIN THEORY | DEFINED | Slashable swarm training ≤8B under M-ADJOINT receipts. | ch04 §3.8 · E-HEARTH-06 |
| H-RELAY BUILDABLE | DEFINED | NAT traversal with funded relay fallback; correctness never depends on traversal. | ch04 §3.8 |
| H-PAY THEORY | DEFINED | Verified-execution premium above the consumer-rental floor, anti-sybil gated. | ch04 §3.8 · E-HEARTH-07 |
Substrate Identity (ch04 §3.9)
| Mechanism | Status | Claim (one line) | Artifact / source |
|---|---|---|---|
| I-PENTAGON THEORY | DEFINED | One committed span witness emits five products; composition claim over registered mechanisms. | ch04 §3.9 · E-IDENT-01 · papers/07 |
Addendum A — this build's new registrations (2026-07-10)
| Mechanism | Status | Claim (one line) | Artifact / source |
|---|---|---|---|
| M-LINEAGE-QUORUM THEORY; fixture MEASURED | PASSED | 12 cloned testifiers collapse to weight 1; honest quorum convenes; 96/96 permutations identical. Protocol claim stays THEORY. | chorus-quorum-lab/ · papers/04 |
| M-QUARANTINE-SETTLE THEORY; fixture MEASURED | PASSED | Contested job freezes, unrelated settles, 0 double payouts across 4,324,320 interleavings. | nel-quarantine-lab/ · papers/05 |
| E-DREAM-02 SIMULATED | KILLED | Preregistered premium sweep {0,271,542,813,1084} µT failed: deterrence needs 2.96× break-even (cap 2×); the premium expels honest influence first. Exclusion is a policy, not a price. | dream-lane/results-v2.json · papers/03 |
| E-NEL-01a — Handshake v0 MEASURED, partial | PASSED | Dual CPU implementations bit-exact 24/24 layers; SiLU error baseline created; token-7 divergence classified as FP tie in the reference. Explicit non-claim: no GPU, no NVIDIA — Gate 1 stays open. | nel-real-inference/runs/ · papers/02 |
Reflex Lane extension — real-time agent settlement (papers/08, 2026-07-10, two hostile reviews)
| Mechanism | Status | Claim (one line) | Artifact / source |
|---|---|---|---|
| A-REFLEX THEORY | DEFINED | Rotating slot leader streams signed bonded reflex ticks (~50–250 ms) as a promise clock, zero consensus weight; tick-vs-block contradiction slashable. Strengthened twice on review: split-view handoff drill must assign liability in 100% of trials, and the fraud proof (tick accumulator, inclusion rules, contradiction predicate) must be mechanically specified before any drill counts. | papers/08 · research/09 |
| A-CLASS-GATE.v1 THEORY | KILLED | Scalar min_finality_class killed at specification by same-day hostile review: finality classes are not a total order (TEE incomparability), no causal evidence-to-action binding, composition laundering across reversible effects. v2 (class lattice + causal binding + composition budgets) reserved, unasserted. | papers/08 §Adversarial review |
| I-AGENT THEORY; two components fixture-MEASURED | PARTIAL | Unified agent object = AgentID + typed mandates + lineage-quotient reputation + membrane settlement; both measured components green in this build. Candidate closure only — composed four-attack drill pending. | papers/08 · chorus-quorum-lab/ · nel-quarantine-lab/ |
| E-REFLEX-01 — two-clock bridge, v1 SIMULATED | KILLED | Withdrawn in full on the accepted Codex review (verdict REJECT): the simulator never implemented its declared hazard, its headline gate could not fail by any code path, bond conservation compared a counter to itself, the refund gate was the loss gate relabeled. Printed PASS lines are void; code kept as the record. | reflex-lane-lab/codex-review.md · papers/08 |
| E-REFLEX-02 — two-clock bridge, rebuilt SIMULATED | PASSED | Rebuilt to the review's remedies, gates preregistered before first run: audited chain-keyed NAIVE loss ≈ 2ε (R1); zero audited GATED violations (R2); finite bond ledger integer-exact, 647/647 false claims rejected, 0 valid claims stranded (R3); every refunded victim still fails the evidence predicate (R4); bit-identical reruns (R5). Latency/throughput NO-GATE by preregistration. | reflex-lane-lab/reflex_sim_v2.py · papers/08 |
Narrative falsifiers (ch08 §6, proposed reservations)
| Mechanism | Status | Claim (one line) | Artifact / source |
|---|---|---|---|
| E-MEME-01 THEORY | DEFINED | The honesty ledger measurably shapes third-party coverage. | ch08 §6.2 |
| E-MEME-02 BUILDABLE | DEFINED | Label fidelity survives transmission; quarterly audit of official + community artifacts. | ch08 §6.2 |
| E-MEME-03 THEORY | DEFINED | Protocol organs recruit genuine participation better than announcements. | ch08 §6.2 |
| E-MEME-04 BUILDABLE | DEFINED | Narrative-vs-shipped drift index D, measured by us first. | ch08 §6.2 |
| E-MEME-05 BUILDABLE | DEFINED | Every wow moment independently reproduced within its window or demoted. | ch08 §6.2 |