The governed on-chain registry (AereCryptoRegistry) maps every registered
post-quantum algorithm to a live verifier: measured 2026-08-15, all 5
algorithms (Falcon-512, Falcon-1024, ML-DSA-44, SLH-DSA-128s, SHAKE256)
resolve to the live NIST precompiles 0x0AE1..0x0AE5, status active, and the
registry contract itself bears code. So 'crypto agility' is not a slide: adding
a scheme or retiring one is a governed registry write, not a hard fork.
Negative control: a planted fake verifier address is caught. Read-only,
eth_call and eth_getCode only. Building this caught two of my own decode bugs
(wrong selector, wrong tuple word) before they became a false public claim,
which is what verification-before-publication is for.
Block-STM enters the kernel through the MachineInterface seam, not beside it. The
one guarantee, stated as a contract and proven: parallel execution produces the
byte-identical state root that serial execution produces, or the kernel refuses
it. The feared failure mode is a silent state divergence under contention, and
that is exactly what the negative control plants.
Run 2026-08-15 (WSL, Rust release build of parallel-executor):
- positive: harness reports 0 mismatches, parallel Block-STM == sequential on
all profiles, seeds, and thread counts 4/8/16.
- negative control: disable the validation phase (the mechanism that catches a
stale read and forces re-execution) and the harness reports MISMATCH on every
contended profile. So the oracle is load-bearing, not applause.
No throughput number is claimed; 8-10x is proven capacity while chain 2800
blocks are empty. Parallel execution is not put on mainnet in this stage; the
equality that would make that safe is proven, so the switch becomes a measured
decision. One coordinated activation if it ever changes an observable, the
discipline proven at block 14,050,000.
Execution proofs are an audit layer OVER the chain, never under it. For that
layer to mean anything, the claim chain must be continuous, and this tool
measures three properties from the live chain: linkage (each window's
prevStateRoot equals the previous window's postStateRoot and the chain's real
root before the first), no gaps or overlaps in the tiling, and anchoring (each
postStateRoot equals the header.stateRoot the chain actually published, so the
proof proves the committed state and not a parallel one). It reports proving
LAG as a first-class number, because lag is the cost curve of proving and
hiding it is the failure.
Run and measured 2026-08-15 against rpc.aere.network: an 8-window synthetic
chain built from live state roots verifies clean; four negative controls (gap,
overlap, linkage, anchor) each make the detector go red, and the anchor plant
is isolated on the last window so it trips the anchoring rule specifically,
not linkage. Read-only, installs nothing. Points at a claims file when a public
proof endpoint exists; the deprecated aggregator V1 stays fenced.
The kernel's first stage is not new infrastructure, it is a written contract
for the state-transition seam (pre_state, block) -> (post_state, receipts)
through StateView only, plus a harness that proves two independent clients
agree on the state root of real chain-2800 blocks, in both directions per the
D-150 rule (what was lost, not only what was added).
Run and measured 2026-08-15, from the two public endpoints (Besu at
rpc.aere.network, Nethermind at client2.aere.network): 24 blocks, 168 fields,
zero divergences. All four negative-control plants (value differs, block only
on one side, a lost field, a corrupted side) make the gate go red exactly
where planted. Installs nothing, three read-only RPC methods, runnable by
anyone. This makes "a second execution machine tomorrow" a mechanical slot,
not a promise.
