Every run scores all 144 axes and reports σ = (top − mean) / std: how far the best-matching axis stands above the rest of the distribution. It is a signal-to-noise ratio, not a performance score. Low σ means the work is diffuse — no clear coordinate, nothing to price. High σ means the work has a sharp, confident location on the lattice.
| Band | σ | What it means to you |
|---|---|---|
| NOISE | < 3.4 | Below the floor. The coordinate is not statistically distinguishable from noise — uninsurable as-is. |
| GOLD | ≥ 3.4 | The insurable floor. The signal is earned, not luck — the same 3.4σ bar particle physics uses to call a result real. Bindable. |
| LOCK | ≥ 19 | Sharp, repeatable location — low variance treaty terms. |
| CRYSTAL | ≥ 100 | Effectively certain. Reached by aggregation, not a single run. |
Intent (what the docs/policy promised) and Reality (what the code/agent did) are each projected onto the
same 144×144 lattice and XORed on the metal. The result is the friction map:
the cells where promise and behaviour disagree. drift % = friction cells / 20,736.
Every match is scored by two independent methods: SimHash (a popcount of a 64-bit signature — the on-chip, ~1-cycle witness) and gzip-NCD (a compression-distance oracle). When both converge on the same fragment, the match is corroborated. When they disagree, the receipt flags it — a built-in distrust signal, never silently reconciled. You are not trusting one model's self-report; you are reading two witnesses that cannot collude.
The ballistic walk propagates each perspective through the lattice. We ran a permutation null test — the real grid vs shuffled grids of identical density — to prove the walk extracts real structure rather than artifacts:
| measure | z vs random | reading |
|---|---|---|
| concentration (does it find real hubs?) | +64 to +142 | p < 0.003 — far beyond chance |
| intent ↔ reality agreement | −11 to −68 | they agree less than random |
The receipt body is signed with an ed25519 per-host key. The public key IS the identity;
the coordinate IS the pixel. So a receipt is a signed claim — "this identity's work landed at this
coordinate with this σ" — that cannot be forged or replayed. Receipts accumulate into the
map-of-maps: identity → coordinate → {n, σ, drift, history}. An identity
owns a coordinate by sustained, dominant, signed competence mass there.
INSURED when σ ≥ 3.4 and drift ≤ 5%;
otherwise RED_ZONE. INSURED is bindable; RED_ZONE means the behaviour does not yet match the
declared lane — the submission goes back, priced or rejected, with the exact failing coordinates attached.Rice's theorem (1953) proves no program can decide a non-trivial behavioural property of another program in general. Every software-only "AI safety" monitor is a program judging a program — Rice's failure domain; it can be gamed by the system it watches. The Air Receipt is produced below that layer: the XOR boundary check is a combinational hardware event (a cache-line footprint, an AC⁰ popcount), not a Turing-complete judgment the agent can subvert. That is the structural class Rice forbids software verifiers from being — and it is why this is bindable where prompt-graded monitors are not.
npx thetacog-mcp pmu-demo fires the chip→receipt chain, or
bootstrap the live directional-audit dashboard (scripts/pmu/README.md).
Receipt schema: air-receipt-schema-v1 ·
map-of-maps: spec ·
the argument in full: Rice's Theorem Checkmate.