Republished from a clean root: the compiled artifact is gone from history, and the local line of work joins the sanitized public line
The public history carried kat/__pycache__/mlkem768_reference.cpython-314.pyc, a compiled Python artifact embedding the operator's absolute local path. Text secret scanners do not read compiled binaries, which is exactly how it slipped through, and removing it from the tip would have left it reachable through the old root commits. So this repository is republished from a single clean root. This root also carries, from the previously unpublished line of work: - corrected LICENSE year, LICENSING.md, VERIFY-POLICY.md, and CITATIONS-UNRESOLVED.md remeasured 2026-08-11 (101 paths, README aligned) - O-018: run_consensus_verification.py ran 19 of 29 models and reported PASS; it now runs all 29, and computemarket_smt.py gains resolveByTimeout / reclaimUnsettled cases plus a negative control - O-006: the word 'audited' removed from next to Bouncy Castle, twice, after a concurrent edit resurrected it - O-014: prior art named and dated - Algorand's native falcon_verify shipped about ten months before AERE's precompiles; the primacy claim is withdrawn where it was implied - bench/ scripts parametrized so they actually run for an outsider (the earlier textual sanitization left $STAGING unexpanded inside Python strings) - AIP-2/AIP-3 errata with measured figures, spec remeasurements at 2026-08-01, and the spec-zk-stack retractions (owner is an operational key, not the Foundation; 'maximally sound' withdrawn; aggregator V1 deprecated) The redacted bench-host environment files from the sanitized line are kept exactly as published; the unredacted local variants are not carried.
This commit is contained in:
commit
6cb0140fae
177 files changed
+33777
No files matched your search
@@ -0,0 +1,146 @@
|
||||
# AERE Network: Proven Results (status as of 2026-07-11)
|
||||
|
||||
> **UPDATE (2026-07-16): two facts in this 2026-07-11 snapshot have since changed on
|
||||
> mainnet and are corrected inline below.** (1) The validator set has grown from 3 to
|
||||
> **7 QBFT validators** (f=2, quorum 5-of-7), confirmed live via
|
||||
> `qbft_getValidatorsByBlockNumber`; still one operator, one client (Besu). (2) The
|
||||
> native PQC precompiles (band `0x0AE1`-`0x0AE5`) and the extended EIP-2935 block-hash
|
||||
> lookback are **now LIVE on mainnet**, activated at block 9,189,161. Where the body
|
||||
> below says "3 validators" or "precompiles inactive on mainnet," read the corrected
|
||||
> value. Everything else in this snapshot still holds. Consensus remains classical
|
||||
> secp256k1 QBFT (not post-quantum); no external audit yet.
|
||||
|
||||
**Chain:** AERE Network mainnet, chain ID 2800 (Hyperledger Besu QBFT, ~0.5s blocks, 7 validators / f=2 as of 2026-07-16 [was 3 at this snapshot], single operator, one client).
|
||||
**Source of truth for canonical addresses:** `sdk-js/src/addresses.ts`.
|
||||
**Purpose:** one honest reference of what is actually real, at what scope, with the on-chain evidence and the explicit testnet-versus-mainnet, staged, and proof-of-approach boundaries. Nothing here is a marketing figure. Every measured number is from a repo artifact, an on-chain transaction, or a captured session log. Where a capability is demonstrated on an isolated testnet or scratch fork rather than on mainnet chain 2800, that is stated in the same breath as the result.
|
||||
|
||||
This document does not claim anything that mainnet chain 2800 does not do today, except where a result is explicitly labeled TESTNET, SCRATCH-FORK, or STAGED.
|
||||
|
||||
---
|
||||
|
||||
## 0. The honesty baseline that applies to everything below
|
||||
|
||||
AERE runs seven QBFT validators (f=2, quorum 5-of-7; three at the 2026-07-11 snapshot) under a single operator, one execution client (Hyperledger Besu), and has had no external security audit of its AERE-authored contracts or client changes. Real usage is thin. Consensus on mainnet is classical secp256k1 QBFT and is not post-quantum. Every result below sits on that foundation and is scoped against it. The strong results are real; the boundaries are real too.
|
||||
|
||||
---
|
||||
|
||||
## 1. Consensus post-quantum quorum certificate (TESTNET demonstration)
|
||||
|
||||
**What is proven.** A real gossiped `>= 2f+1` Falcon-512 quorum certificate, embedded in every block, verified by every node on import, and **blocking after a fork block**, demonstrated on an isolated N=4 QBFT testnet. Each validator holds a fresh Falcon-512 keypair and Falcon-signs the same commit hash the ECDSA committed seal signs, piggybacking the seal on the QBFT commit message; the block creator re-verifies, de-duplicates, and embeds the set of distinct valid seals as the block's certificate. ECDSA committed seals remain the decisive safety and liveness seal throughout.
|
||||
|
||||
**Evidence (isolated N=4 testnet, fresh keys, isolated chain, 2s blocks, Falcon fork block 20).**
|
||||
- Full consensus unit suite green after the change (`consensus:common`, `consensus:qbft-core`, `consensus:qbft`).
|
||||
- Block-hash preservation: the certificate is excluded from every signed pre-image, so a header is byte-identical to upstream with or without the certificate. Proven three ways (committed-seal and block-hash pre-images identical, `FalconAudit` on real headers, byte-identical stored encoding when empty).
|
||||
- Healthy run #1: 229 blocks, all 4 nodes agreed at every height, blocks 20 onward post-fork BLOCKING each with a valid 3-of-4 certificate, 0 rejects, exact 2s cadence. Run #2: reproduced from fresh genesis.
|
||||
- `FalconAudit` on real post-fork headers: the certificate validator set equals the ECDSA committer set on each block (proving genuinely gossiped, per-block-varying seals, not a static self-seal); genuine 9/9 ACCEPT, tampered-signature 9/9 REJECT, tampered-commit-hash 9/9 REJECT.
|
||||
- Negative tests: (a) tamper one Falcon seal rejects it; (c) one validator with a wrong Falcon key, the chain still finalizes via the honest quorum with transient single-block retry, no halt; (b) two bad signers (more than f), the post-fork chain correctly HALTS at block 353 because the Falcon quorum cannot form, while an ECDSA quorum still existed. That halt is the blocking rule working as designed.
|
||||
|
||||
**Honest scope.** This is a TESTNET demonstration only. Mainnet chain 2800 consensus is classical secp256k1 QBFT and is NOT post-quantum; this work does not change what mainnet validators sign. Making the Falcon quorum blocking raises the liveness requirement to `2f+1` Falcon-valid validators and is most acute at small N (at N=4 a single faulty Falcon signer forces all three honest validators to commit each block). The recommendation is to ship the always-on additive certificate (log-only, full gossip and verification) and to defer blocking activation until the validator set has slack over the quorum (N >= 7). Blocking must not be activated on chain 2800 without an explicit founder go.
|
||||
|
||||
**Artifacts:** `consensus-pqc/` (`QUORUM-DESIGN.md`, quorum patch, run logs), held in the internal working repository and not published.
|
||||
|
||||
---
|
||||
|
||||
## 2. Full-EVM validity: real revm-in-SP1 proofs of real chain-2800 blocks
|
||||
|
||||
**What is proven.** A real AERE mainnet block, re-executed with the real `revm` execution stack (SP1-patched `reth` 1.9.3 / `revm`, tag `reth-1.9.3-sp1-6.1.0`, SP1 v6.1.0) inside the SP1 zkVM, reproduces the canonical post-state root, and the resulting Groth16 proof verifies on chain 2800 through the live SP1 gateway. Full opcode set, call frames, `SLOAD`/`SSTORE`, `LOG`, EIP-1559 fee split, and the Cancun/Prague/Osaka system calls all execute and all affect the proven root. This is the real EVM, not a bounded subset.
|
||||
|
||||
**On-chain evidence (mainnet chain 2800).**
|
||||
- Single block, `AereEVMValidity` `0x1f2CB0ebDBb21500e99868DbF1dB3abCcDd7DF26` (canonical in `sdk-js/src/addresses.ts`): block **9073073** recorded via `recordBlock` tx `0xb28a39507f8c03e6ffcfed307f9848814dd9d35268f01983825b658cbc56415c` (submit block 9074454, status 1), gasUsed 460,015, well under the EIP-7825 per-transaction cap of 16,777,216. A second block **9075035** was proven fresh in the same session. Tamper test: flipping one byte of `postStateRoot` makes the on-chain-equivalent verifier reject the proof.
|
||||
- 16-block contiguous batch, `AereEVMValidityBatch` `0x49D30a5999eA5b7f6eFf12196AB006316683Ff3C` (canonical): real chain-2800 blocks **9111008..9111023** proven in one Groth16 (batch program vkey `0x00418c4f40178103cc75ae57b63703f6075cabdce23582fed6043ceae819192e`), each block's recomputed post-state root threaded into the next block's pre-state, recorded via `recordBatch` tx `0x074a4e6c17855b78db4c56808e253d4c00a7b392cf0d141e4aa0e6e299ded9ec` (submit block 9114536, status 1), gasUsed 460,817, under the cap.
|
||||
|
||||
**New this session: dense workload proof (removes the low-tx-density caveat at demonstrated scale).** Historical mainnet blocks are low-density and the live node prunes state (Bonsai), which limited earlier witnessable batches to a handful of transactions. To remove that caveat, a genuinely dense real-EVM workload was proven with the same batch prover and verified read-only against the same live mainnet gateway:
|
||||
- A single ultra-dense block with **155 real transactions and 460 SSTOREs** (52 freshly-created EOAs, 52 fresh ERC-20 holder slots), 29,572,987 guest cycles: local SP1 Groth16 verify PASS, tampered `postStateRoot` REJECTED; the live mainnet SP1 gateway `0x9ca479C8c52C0EbB4599319a36a5a017BCC70628` accepted the real proof read-only and reverted both a tampered-public-values and a tampered-proof call.
|
||||
- A 2-block contiguous, state-continuity-chained dense batch (310 txs, 920 SSTOREs, 27,050,310 gas, 61,366,308 cycles; the guest enforces `post_root(N) == header.stateRoot` and `pre_root(N+1) == post_root(N)`): same live-gateway acceptance read-only, both tampers reverted.
|
||||
- These proofs bind to the same batch-program vkey the mainnet batch anchor uses. No mainnet transaction was sent; verification was `eth_call` only.
|
||||
|
||||
**Honest scope.**
|
||||
- This is a **proof-of-approach on real blocks, not a continuous production rollup cadence.** The mainnet-recorded blocks and batch are real chain-2800 blocks but small; the anchors record isolated proven blocks and ranges rather than a sequenced chain. There is no sequencer, no forced inclusion, no data-availability commitment, and no withdrawal settlement.
|
||||
- The dense workload is an **isolated, engineered** dense chain produced on a throwaway single-validator node running the AERE fork profile (chain-config 2800), in archive mode so heavy state is witnessable. It is NOT a replay of historical mainnet blocks. Its value is to remove the "low tx density" limitation at the demonstrated scale (roughly two full-density blocks / ~61M cycles was the practical ceiling on the box used; a longer dense batch is a pure prover-resource matter, not an approach question). Compatibility was confirmed: the reth-in-SP1 guest reproduced Besu 26.4.0's exact `header.stateRoot` for every dense block, the same agreement already established on real chain-2800 blocks.
|
||||
- **Canonical pre-state binding V2, CORRECTED 2026-07-14: LIVE, not staged, and unused.** This bullet originally said V2 "must not be deployed yet." That was true when written (2026-07-11) and is no longer true: the AerePQC `futureEips` fork activated at mainnet block 9,189,161 (bringing EIP-2935 history storage live), and `AereEVMValidityV2` (`0x4884ad66…768D9B`, deploy block 9,257,558) and `AereEVMValidityBatchV2` (`0xe154B899…9E690aE`, deploy block 9,257,566) were then deployed with the re-proved vkeys wired in, per the sequence this document's own §"Conclusion / go condition" in `rollup-evm-validity/NOTE.md` specified. Verified live on 2026-07-14 via a direct `eth_getCode` read against `https://rpc.aere.network` (non-empty bytecode both addresses) and a `PROGRAM_VKEY()` read-back matching `sdk-js/src/addresses.ts` exactly. The V1 anchors above remain honest about attesting only self-consistent execution; V2 now genuinely binds to the canonical chain. **However, live reads of both V2 contracts on 2026-07-14 show `provenCount() == 0` on each**, no `recordBlock` or `recordBatch` call has actually succeeded against either V2 contract yet, despite `addresses.ts`'s inline comment on `AereEVMValidityV2` claiming "batch path proven, see AereEVMValidityBatchV2." That comment is stale/inaccurate as of this correction; treat the V2 canonical-binding pipeline as deployed but never yet exercised end-to-end on mainnet. See the "2026-07-14 reconciliation" section of the internal `VALIDITY-ROLLUP-SEQUENCER-PLAN.md` (not published) for the full picture, including a separate, still-open gap: no batch-guest source (the program behind the 320-byte `AereEVMValidityBatchV2` layout) is checked into this repo at all, only the single-block guest is.
|
||||
- The crypto is classical (SP1 Groth16 over BN254, classical QBFT keys); this validity path is not itself post-quantum.
|
||||
|
||||
**Artifacts:** `rollup-evm-validity/` (host/guest/spec), `dense-batch-2026-07-11/` (dense proofs + gateway verifications), `NOTE.md` (V2 staging), `contracts/deployments/evm-validity*.json`. These are held in the internal working repository and are not published; the on-chain transactions and addresses cited above are independently checkable against chain 2800 without them.
|
||||
|
||||
---
|
||||
|
||||
## 3. Recursive proof aggregation at scale (LIVE on-chain, n=10)
|
||||
|
||||
**What is proven.** Ten real, heterogeneous inner SP1 proofs, drawn from three distinct real production programs (zkscreen sanctions-screening, over18 age credential, zkml-mnist inference), folded into a single Groth16 proof and verified once on-chain. The aggregator recomputes a composite digest from caller-supplied inner data and requires it to equal the proof's committed output, so a caller cannot lie about which programs were folded.
|
||||
|
||||
**On-chain evidence (mainnet chain 2800).** `AereProofAggregator` `0x6a260238890E740dB12b371E0C5d17a2470F84C5` (canonical, owner Foundation).
|
||||
- n=10 record tx `0xd1fd4d60635fbafe8b269ea156a6bbc65e2b6ff8b886eb7910569a9c9344d978`, block 8930005, gasUsed **393,844**, read-back `count = 10`, `recognized = 10`.
|
||||
- n=3 record tx `0xde4c102ab86567bfb7b384a784c049bf6ded33378e0b71acc0bfe97b7b8d4b39`, block 8811943, gasUsed **387,858**.
|
||||
- On-chain cost is essentially flat in N: raising N by 3.3x raised gas by about 1.5%, because the cost is dominated by the fixed Groth16 verification, not by the number folded. Tamper checks: a tampered proof reverts, and dropping one child (so the recomputed composite no longer matches) reverts.
|
||||
|
||||
**Honest scope.** This is a proof-of-approach attestation aggregator, not a production rollup batcher. The inner statements in the scale run are deterministically derived for the demonstration, not organic traffic from ten distinct users (the ELFs are the real programs, checked byte-for-byte against their on-chain vkeys before folding). Proving is heavy and off-chain (about 1549s wall time for n=10). No run beyond n=10 is recorded on-chain yet (n=16 in progress). Soundness rests on Groth16 over BN254 and the SP1 recursion, which are classical, not post-quantum.
|
||||
|
||||
**Artifacts:** `research/specs/spec-recursive-aggregation-scale.md`, `contracts/deployments/proof-aggregator*.json`.
|
||||
|
||||
---
|
||||
|
||||
## 4. Parallel execution: Block-STM executor and forked-client commit prototype (TESTNET / benchmark)
|
||||
|
||||
**What is proven.**
|
||||
- A real from-scratch Block-STM optimistic-concurrency parallel executor (`aere-block-stm`, Rust, zero external dependencies) that executes a transaction batch across many cores and commits a keccak256 state root **bit-identical to sequential execution**. Correctness is proven over **6000 randomized adversarial comparisons with zero mismatches** (6 workload profiles x 200 batches x {1,2,4,8,16} threads), including fully-conflicting adversarial cases.
|
||||
- Measured execution-bound speedup on a 16-core box is roughly **8.6x to 9.3x** on low and medium-conflict batches (versus the single-threaded sequential oracle), degrading gracefully to about 4.6x under a hot single-counter and correctly falling below 1.0x on a pathological all-conflict batch where no parallelism exists.
|
||||
- New this session: a parallel state-root **commit** prototype in the forked Besu client (Bonsai world-state), self-checked to produce a commit root **bit-identical to the sequential-commit root** across correctness reps (independent transfers, commit-heavy SSTORE, deletions, mixed kitchen-sink).
|
||||
|
||||
**Honest boundary (the important part).** The state-root COMMIT does **not** parallelize for a throughput win: it is measured to be allocation and memory-bandwidth bound, and adding commit worker threads (widths 2 to 16) makes it slower than a single worker, not faster. What does help is a single-threaded commit rewrite: at width 1 the AERE commit is roughly **2x cheaper than the stock parallel-trie commit** (for example, on medium tries about 316.98ms stock versus 142.38ms at width 1). End-to-end, Block-STM execution plus the width-1 commit gives a modest win on commit-heavy load (about 1.27x to 1.42x versus stock sequential exec plus sequential commit), and the real execution-side win is the ~9x above. An end-to-end network throughput win is gated on real execution-heavy load, and none of this runs on mainnet.
|
||||
|
||||
**On-chain adjacent (live).** `AereBlockSTMRegistry` `0x98E2C3e615841919d173D8FF642514c5902E8A28` is a live, advisory, opt-in hint registry (holds no funds, changes no execution semantics, has no L1 consumer yet). The bounded-VM validity anchor `AereRollupValidity` `0x38772063572DF94E90351e44ccbBEefD5F497fbd` has epoch 0 recorded from a real proof of the same deterministic executor.
|
||||
|
||||
**Honest scope.** AERE L1 (Besu) executes **sequentially** on mainnet today; nothing here changes that. The speedups are single-machine microbenchmarks, not TPS or network-throughput claims. Promoting Block-STM into base consensus is a multi-month Java-client effort; the commit prototype and benchmark are a research control surface, not a mainnet-active feature.
|
||||
|
||||
**Artifacts:** `parallel-executor/` (published in this repository, including the end-to-end throughput report and its raw run logs), `research/specs/spec-parallel-execution.md` (published). The forked-client commit patch and its benchmark logs are held in the internal working repository and are not published.
|
||||
|
||||
---
|
||||
|
||||
## 5. Native PQC precompiles and EIP-2935 lookback in the Besu fork (SCRATCH-FORK, staged for mainnet)
|
||||
|
||||
**What is proven.** A fork of Hyperledger Besu 26.4.0 (source tag 26.4.0, commit `d2032017`) adds five native precompiles wrapping the Bouncy Castle 1.83 BCPQC verifiers already on the client classpath (Falcon-512, Falcon-1024, ML-DSA-44 FIPS 204 internal, SLH-DSA-SHA2-128s FIPS 205 internal, SHAKE256 FIPS 202), introducing zero new dependencies and zero hand-rolled cryptography, plus a native EIP-2935 8191-block history-storage lookback written by consensus. Every scheme is validated against the same official NIST KAT and ACVP vectors the pure-Solidity verifiers use, positive and negative, including 15/15 ML-DSA-44 ACVP cases and 14/14 SLH-DSA-SHA2-128s ACVP cases (12 negatives each).
|
||||
|
||||
**Measured on the isolated scratch fork (chain 28099), full verify-and-record transactions:** Falcon-512 86,336 gas; Falcon-1024 **145,496** gas (0.87% of the 16,777,216 cap); ML-DSA-44 **351,050** gas (2.09%); SLH-DSA-SHA2-128s 558,276 gas; SHAKE256 21,470 gas. This moves the two schemes that are view-only in pure Solidity on mainnet (Falcon-1024 at roughly 21.7M gas, ML-DSA-44 at roughly 52.9M gas) to record-on-chain with wide margin.
|
||||
|
||||
**Keyless statefork rehearsal against real 2800 state.** On the infra host, a keyless two-axis rehearsal (no real validator keys copied anywhere, verified) confirmed a second non-validating follower running the fork binary validated the real 2800 chain to head under the fork's rules, and an isolated single-validator network proved the five PQC precompiles plus EIP-2935 activate on Osaka-format blocks (futureEips activated at block 182: precompiles inactive before, active after; Falcon-1024 gasUsed 172,720, ML-DSA-44 351,970, records=1; EIP-2935 history read equals the actual block hash; block format identical before and after). The live node was untouched.
|
||||
|
||||
**Honest scope.** These precompiles and the EIP-2935 write path are **STAGED for a supervised mainnet fork (the AerePQC futureEips activation), NOT active on chain 2800 today.** On mainnet the reserved precompile band addresses are empty, Falcon-1024 and ML-DSA-44 remain view-only in pure Solidity, and the EIP-2935 history contract has no code (the deployed anchor falls back to the 256-block `blockhash()` window). Activation is a coordinated, client-only, flag-day hard fork with no re-genesis and no state migration, and must be externally audited before it secures material value. It requires an explicit founder go.
|
||||
|
||||
**Artifacts:** `research/aip-draft-pqc-precompiles.md`, `research/specs/spec-eip2935-lookback.md`, and `statefork-test-results/` (internal working repository, not published).
|
||||
|
||||
---
|
||||
|
||||
## 6. Application and account layer PQC verifier suite (LIVE on-chain)
|
||||
|
||||
**What is proven.** A suite of post-quantum signature verifiers, in pure Solidity on the live chain's own EVM, covering both families NIST is standardizing: the hash-based WOTS+, XMSS-SHA2_10_256 (RFC 8391), and SLH-DSA-SHA2-128s (FIPS 205), and the lattice-based Falcon-512, Falcon-1024 (NIST round-3), and ML-DSA-44 (FIPS 204). Each is validated bit-for-bit against official NIST KAT or ACVP fixtures committed to the repository, in both directions (valid vectors accept, crafted-invalid vectors reject). Four of the six record a full verification on-chain within the EIP-7825 per-transaction gas cap (XMSS 1,561,963 gas; SLH-DSA 1,812,066 gas; Falcon-512 demonstrated inside a full ERC-4337 userOp at 10,278,313 gas and hybrid auth at 10,299,873 gas; WOTS+ well under the cap). Falcon-1024 and ML-DSA-44 are verifiable today as read-only `eth_call` views because a recording transaction would exceed the cap in pure Solidity (this is the exact gap the precompile fork of section 5 closes).
|
||||
|
||||
On top of the verifiers sit a hybrid ECDSA-plus-Falcon-512 authorizer and a Falcon-512-owned ERC-4337 smart account, both recording on-chain.
|
||||
|
||||
**Honest scope.** This is application-layer and account-layer post-quantum security. It does not make consensus post-quantum; mainnet validators still sign classical secp256k1 QBFT. The verifiers are unaudited (their assurance rests on bit-for-bit agreement with the official NIST vectors and independent from-scratch cross-checks, which is strong evidence of correctness but is not an audit). Only the smallest ML-DSA and SLH-DSA parameter sets and only the internal interfaces are implemented. With those caveats stated honestly, and to the best of our present knowledge, we are not aware of any other public chain that verifies all of these on-chain. We are not, however, the first public chain to verify a post-quantum signature on-chain, and we do not claim to be: Algorand shipped the native Falcon-1024 `falcon_verify` AVM opcode in a stable release roughly ten months before AERE's precompiles activated at block 9,189,161 (2026-07-12), and places Falcon deeper in its stack than AERE does, inside its own state proofs. That prior art, with sources and dates, is set out in `aere-research/research/pqc-onchain-verification.md`, Section 8.
|
||||
|
||||
**Canonical addresses (verbatim from `sdk-js/src/addresses.ts`):** AerePQCVerifier `0x1cE2949e8cE3f1A77b178aF767a4455c08ec6F82`, AereXmssVerifier `0x77b14E264D0bb08d304d4e0E527F0fCdFc88B112`, AereSphincsVerifier `0xAfFc9F8d950969b46b54e77758BbFf7e000c87e6`, AereFalcon512Verifier `0x4E8e9682329e646784fB3bd01430aA4bA54D8fFC`, AereFalcon1024Verifier `0xF0aFA59BaB2058e4B6e6B424b7f76750F1F66e36`, AereMLDSA44Verifier `0xf1F7A6Acd82D5DAf9AF3166a2F736EE52C5F85AE`, AereHybridAuth `0xc20390C9656ECe1AE37603c84E395bC898b3FAA1`, AerePQCAccountFactory `0xd5315Ea7caa60d320c4f34b1bEd70dd9cc02CE58`.
|
||||
|
||||
**Artifacts:** `research/pqc-onchain-verification.md`, `aips/AIP-4.md`.
|
||||
|
||||
---
|
||||
|
||||
## 7. Proof of reality: independent adversarial read-only sweep of mainnet 2800
|
||||
|
||||
An independent adversarial read-only sweep of mainnet chain 2800 returned **zero claim violations**. Specifically, and consistent with everything above:
|
||||
|
||||
- The SP1 gateway `0x9ca479C8c52C0EbB4599319a36a5a017BCC70628` verifies real proofs and rejects tampered ones.
|
||||
- Recorded validity batch roots equal the canonical block `stateRoot` values.
|
||||
- Block time is about **0.506s**, there were **3 validators** at this 2026-07-11 snapshot (now **7**, f=2, per the update banner), and the native token supply is exactly **2,800,000,000 AERE**.
|
||||
- At this snapshot the PQC precompiles were **inactive** on mainnet. **This has since changed:** the native PQC precompiles (band `0x0AE1`-`0x0AE5`) and the extended EIP-2935 lookback were activated on mainnet at block 9,189,161 and are now live. The section 5 "staged, not live" wording reflects the 2026-07-11 state, not the current one.
|
||||
|
||||
The sweep confirms the split this document draws throughout: the live-on-mainnet claims (the verifier suite, the aggregator, the validity anchors, the block time, the validator count, the supply) hold on chain 2800, and the then-not-yet-on-mainnet claims are labeled testnet, scratch-fork, or staged (of these, the native precompiles and EIP-2935 lookback have since gone live on mainnet per the update banner; the consensus PQC quorum, canonical-binding V2, and parallel L1 execution remain testnet/scratch-fork/staged).
|
||||
|
||||
---
|
||||
|
||||
## 8. One-line summary of scope
|
||||
|
||||
Live on mainnet chain 2800: the pure-Solidity PQC verifier suite, the recursive proof aggregator at n=10, the single-block and 16-block full-EVM validity anchors (proof-of-approach), the Block-STM hint registry, ~0.506s blocks, 7 validators (f=2; was 3 at this 2026-07-11 snapshot), 2.8B supply, and (since block 9,189,161, added after this snapshot) the native PQC precompiles and the extended EIP-2935 8191-block lookback. Proven on isolated testnet or scratch fork and staged for a supervised mainnet fork, not active today: the gossiped Falcon-512 consensus quorum certificate, canonical-binding validity V2, and the parallel-commit client prototype. Consensus on mainnet remains classical secp256k1 QBFT and is not post-quantum. No external audit yet.
|
||||
|
||||
---
|
||||
|
||||
*Every canonical address is verbatim from `sdk-js/src/addresses.ts`. Testnet, scratch-fork, and staged results are labeled as such and are cited from the named repo artifacts. No gas figure, transaction hash, block number, or measured result in this document is invented; each is drawn from an on-chain transaction or a committed artifact.*
|
||||
@@ -0,0 +1,111 @@
|
||||
{
|
||||
"chainId": 28777,
|
||||
"vectors": 8,
|
||||
"integration_all_pass": true,
|
||||
"avg_verify_gas_in_evm": 9140858,
|
||||
"avg_verify_gas_precompile": 7186367,
|
||||
"avg_verify_gas_drop": 1954490,
|
||||
"avg_verify_pct_drop": 21.4,
|
||||
"avg_hashToPoint_gas_in_evm": 2281180,
|
||||
"avg_hashToPoint_gas_precompile": 311480,
|
||||
"deploy_gas_in_evm": 9563686,
|
||||
"deploy_gas_precompile": 9699394,
|
||||
"rows": [
|
||||
{
|
||||
"tc": "0",
|
||||
"accept_v0": true,
|
||||
"accept_v1": true,
|
||||
"reject_tampered_v0": true,
|
||||
"reject_tampered_v1": true,
|
||||
"verify_gas_in_evm": 9149974,
|
||||
"verify_gas_precompile": 7250589,
|
||||
"verify_gas_drop": 1899385,
|
||||
"hashToPoint_gas_in_evm": 2225647,
|
||||
"hashToPoint_gas_precompile": 311480
|
||||
},
|
||||
{
|
||||
"tc": "1",
|
||||
"accept_v0": true,
|
||||
"accept_v1": true,
|
||||
"reject_tampered_v0": true,
|
||||
"reject_tampered_v1": true,
|
||||
"verify_gas_in_evm": 9076204,
|
||||
"verify_gas_precompile": 7177224,
|
||||
"verify_gas_drop": 1898980,
|
||||
"hashToPoint_gas_in_evm": 2225239,
|
||||
"hashToPoint_gas_precompile": 311480
|
||||
},
|
||||
{
|
||||
"tc": "2",
|
||||
"accept_v0": true,
|
||||
"accept_v1": true,
|
||||
"reject_tampered_v0": true,
|
||||
"reject_tampered_v1": true,
|
||||
"verify_gas_in_evm": 9070452,
|
||||
"verify_gas_precompile": 7173092,
|
||||
"verify_gas_drop": 1897360,
|
||||
"hashToPoint_gas_in_evm": 2223606,
|
||||
"hashToPoint_gas_precompile": 311480
|
||||
},
|
||||
{
|
||||
"tc": "3",
|
||||
"accept_v0": true,
|
||||
"accept_v1": true,
|
||||
"reject_tampered_v0": true,
|
||||
"reject_tampered_v1": true,
|
||||
"verify_gas_in_evm": 9085990,
|
||||
"verify_gas_precompile": 7186605,
|
||||
"verify_gas_drop": 1899385,
|
||||
"hashToPoint_gas_in_evm": 2225647,
|
||||
"hashToPoint_gas_precompile": 311480
|
||||
},
|
||||
{
|
||||
"tc": "4",
|
||||
"accept_v0": true,
|
||||
"accept_v1": true,
|
||||
"reject_tampered_v0": true,
|
||||
"reject_tampered_v1": true,
|
||||
"verify_gas_in_evm": 9293548,
|
||||
"verify_gas_precompile": 7170907,
|
||||
"verify_gas_drop": 2122641,
|
||||
"hashToPoint_gas_in_evm": 2450637,
|
||||
"hashToPoint_gas_precompile": 311480
|
||||
},
|
||||
{
|
||||
"tc": "5",
|
||||
"accept_v0": true,
|
||||
"accept_v1": true,
|
||||
"reject_tampered_v0": true,
|
||||
"reject_tampered_v1": true,
|
||||
"verify_gas_in_evm": 9303401,
|
||||
"verify_gas_precompile": 7181570,
|
||||
"verify_gas_drop": 2121831,
|
||||
"hashToPoint_gas_in_evm": 2449821,
|
||||
"hashToPoint_gas_precompile": 311480
|
||||
},
|
||||
{
|
||||
"tc": "6",
|
||||
"accept_v0": true,
|
||||
"accept_v1": true,
|
||||
"reject_tampered_v0": true,
|
||||
"reject_tampered_v1": true,
|
||||
"verify_gas_in_evm": 9070416,
|
||||
"verify_gas_precompile": 7171031,
|
||||
"verify_gas_drop": 1899385,
|
||||
"hashToPoint_gas_in_evm": 2225647,
|
||||
"hashToPoint_gas_precompile": 311480
|
||||
},
|
||||
{
|
||||
"tc": "7",
|
||||
"accept_v0": true,
|
||||
"accept_v1": true,
|
||||
"reject_tampered_v0": true,
|
||||
"reject_tampered_v1": true,
|
||||
"verify_gas_in_evm": 9076879,
|
||||
"verify_gas_precompile": 7179924,
|
||||
"verify_gas_drop": 1896955,
|
||||
"hashToPoint_gas_in_evm": 2223198,
|
||||
"hashToPoint_gas_precompile": 311480
|
||||
}
|
||||
]
|
||||
}
|
||||
@@ -0,0 +1,6 @@
|
||||
base_commit=d203201 remove pre EIP8 handshake support (#10257)
|
||||
besu/v26.7-develop-cc6bf56/linux-x86_64/openjdk-java-21
|
||||
fork commits:
|
||||
cc6bf56 AERE PQC: add ML-KEM-768 (0x0AE6) + Falcon HashToPoint (0x0AE7) precompiles
|
||||
c8d2ef9 AERE PQC fork baseline (0x0AE1-0x0AE5)
|
||||
d203201 remove pre EIP8 handshake support (#10257)
|
||||
@@ -0,0 +1,58 @@
|
||||
{
|
||||
"component": "GENERIC AIR constraint evaluation + quotient-consistency check over BabyBear (port spec component (e), the GENERIC mechanism only)",
|
||||
"precompile": "0x0000000000000000000000000000000000000ae8",
|
||||
"scope": "port spec section 6; the GENERIC quotient-consistency check a p3-uni-stark verifier does AFTER the PCS opening (verifier.rs lines 90-141): given the out-of-domain trace openings at zeta (trace_local) and g*zeta (trace_next), the random challenge alpha, the quotient-chunk openings, and the trace-domain degree, fold the AIR constraints with alpha (Horner), reconstruct quotient(zeta) from the chunks + split-domain zps, compute Z_H(zeta) and the first/last/transition selectors, and check folded_constraints(zeta) == Z_H(zeta) * quotient(zeta), over F_{p^4}.",
|
||||
"validates": "CONFORMANCE: real p3-uni-stark 0.4.3-succinct proofs of two KNOWN example AIRs (the Fibonacci AIR from Plonky3's own tests/fib_air.rs, single quotient chunk; and a degree-3 multiply AIR matching tests/mul_air.rs, TWO quotient chunks, exercising the split-domain zps product) are ACCEPTED by the pinned library verifier; this reference reproduces the accept via the generic quotient identity and rejects three tamper variants (corrupted trace opening, wrong quotient chunk, wrong alpha); Python/Node/Java produce byte-identical reconstructed quotient(zeta) and folded_constraints(zeta).",
|
||||
"does_not_validate": "the SP1 RECURSION AIR itself (its specific multi-thousand-constraint set, interactions/permutation argument, public-value layout) and the verifying-key digest that commits to it. That is a large, program-specific, multi-week port needing the SP1 toolchain, and is NOT done here. The GENERIC mechanism working on a small example AIR does NOT mean the precompile can verify a real SP1 proof.",
|
||||
"top_level_verifier": "unchanged, still FAIL-CLOSED (returns EMPTY for every input). The generic quotient check is enabled ONLY for a supplied example AIR under this KAT; on the real path StarkConstraints.SP1_RECURSION_AIR_PORTED = false keeps evaluateAtZeta = UNAVAILABLE at stage 4 (before the query loop and before the single return ACCEPT), so computePrecompile returns EMPTY for a real SP1 proof and ACCEPT is unreachable. DO NOT ACTIVATE.",
|
||||
"confirmed_mechanism": {
|
||||
"constraint_fold": "VerifierConstraintFolder (p3-air folder.rs): acc = acc*alpha + constraint, in the AIR eval() emission order; when_first_row/when_transition/when_last_row multiply the constraint by the corresponding selector (p3-air air.rs).",
|
||||
"trace_domain": "TwoAdicMultiplicativeCoset { log_n = degree_bits, shift = 1 } (TwoAdicFriPcs::natural_domain_for_degree).",
|
||||
"selectors_at_zeta": "z_h = zeta^(2^degree_bits) - 1; is_first = z_h/(zeta-1); is_last = z_h/(zeta - g^-1); is_transition = zeta - g^-1; inv_zeroifier = z_h^-1 (p3-commit domain.rs selectors_at_point).",
|
||||
"quotient_domain": "create_disjoint_domain: log_n = degree_bits + log_quotient_degree, shift = trace.shift * Val::generator() = GENERATOR (= 31, CONFIRMED).",
|
||||
"chunk_domains": "split_domains(quotient_degree): chunk i has log_n = degree_bits, shift = GENERATOR * two_adic_generator(degree_bits+log_quotient_degree)^i.",
|
||||
"zps": "zps[i] = prod_{j!=i} zp_j(zeta) * zp_j(first_point_i)^-1, zp_D(pt) = (pt*shift^-1)^(2^log_n) - 1 (p3-commit zp_at_point).",
|
||||
"quotient_reconstruction": "quotient = sum_i zps[i] * sum_e monomial(e) * chunk[i][e], monomial(e) = x^e in F_{p^4} (verifier.rs lines 106-116).",
|
||||
"identity": "folded_constraints * inv_zeroifier == quotient (i.e. folded_constraints(zeta) == Z_H(zeta) * quotient(zeta)); OodEvaluationMismatch otherwise (verifier.rs lines 137-141)."
|
||||
},
|
||||
"cross_language": [
|
||||
"java",
|
||||
"node",
|
||||
"python"
|
||||
],
|
||||
"conformance": {
|
||||
"status": "CONFIRMED (real known-answer test PASSED: accept genuine + reject tampered)",
|
||||
"method": "pq-stark/airquotient-extractor (a Rust binary depending on the pinned p3-uni-stark / p3-air / p3-baby-bear / p3-commit 0.4.3-succinct crates; lockfile-pinned) ran p3_uni_stark::prove then p3_uni_stark::verify on the Fibonacci AIR (tests/fib_air.rs, n=8, pis=[0,1,21]) and a degree-3 multiply AIR (matching tests/mul_air.rs), asserted the library accepts, and emitted degree_bits / quotient_degree / trace openings / quotient-chunk openings / alpha (sample_ext) / zeta (sample) by replaying the exact verifier transcript prefix; its output is air_quotient_ground_truth.json.",
|
||||
"cases": [
|
||||
"fibonacci_n8",
|
||||
"mul_deg3_n16"
|
||||
]
|
||||
},
|
||||
"pinned_conformance_target": {
|
||||
"revision": "Succinct Plonky3 fork, crates.io version 0.4.3-succinct",
|
||||
"crates": [
|
||||
"p3-uni-stark",
|
||||
"p3-air",
|
||||
"p3-baby-bear",
|
||||
"p3-commit",
|
||||
"p3-fri",
|
||||
"p3-matrix"
|
||||
],
|
||||
"source_traced": [
|
||||
"p3-uni-stark verifier.rs (quotient-consistency check)",
|
||||
"p3-commit domain.rs (selectors_at_point / zp_at_point / split_domains)",
|
||||
"p3-air folder.rs + air.rs (VerifierConstraintFolder Horner fold; when_* filters)"
|
||||
]
|
||||
},
|
||||
"remaining": {
|
||||
"sp1_recursion_air": "[MEASURE] the SP1 recursion AIR (exact constraint set + interactions + public-value binding) and the vkey digest that commits to it; needs the SP1 toolchain and a real exported SP1 v6.1.0 inner proof. This is the large program-specific piece; ~3 to 4 person-weeks + audit (spec section 9).",
|
||||
"end_to_end_kat": "[MEASURE] an end-to-end ACCEPT/REJECT KAT on a real exported SP1 proof, which also needs the WireReader proof-body parser and the whole stack wired together."
|
||||
},
|
||||
"notes": [
|
||||
"CONFORMANCE: 2 p3-uni-stark 0.4.3-succinct proofs (Fibonacci + degree-3 mul AIR) accepted by the library; the generic quotient identity reproduces the accept and rejects 3 tamper variants each (trace opening, quotient chunk, alpha)",
|
||||
"cross-language implementations compared: java, node, python"
|
||||
],
|
||||
"passed": 18,
|
||||
"failed": 0,
|
||||
"total": 18
|
||||
}
|
||||
@@ -0,0 +1,37 @@
|
||||
{
|
||||
"component": "BabyBear field F_p + degree-4 extension F_{p^4} (port spec component (a), FOUNDATION)",
|
||||
"precompile": "0x0000000000000000000000000000000000000ae8",
|
||||
"scope": "port spec section 2; the field-arithmetic foundation the whole STARK verifier is built on",
|
||||
"validates": "F_p and F_{p^4} field axioms; Fermat inverse vs independent extended-Euclid bignum; generator has order p-1; two-adic generator order 2^k; W is a QNR so x^4-W is irreducible (real field); across Python/Node/Java",
|
||||
"does_not_validate": "any real STARK proof (this is only component (a) of six); and that GENERATOR=31 / W=11 / two_adic_generator(27) are Plonky3's EXACT constants ([VERIFY]/[MEASURE] vs p3-baby-bear at pinned SP1 v6.1.0)",
|
||||
"top_level_verifier": "unchanged, still fail-closed (returns EMPTY for every input)",
|
||||
"constants": {
|
||||
"P": 2013265921,
|
||||
"P_expr": "2^31 - 2^27 + 1 = 15*2^27 + 1 = 0x78000001",
|
||||
"generator": 31,
|
||||
"two_adicity": 27,
|
||||
"two_adic_generator_27": 440564289,
|
||||
"W": 11
|
||||
},
|
||||
"cross_language": [
|
||||
"java",
|
||||
"node",
|
||||
"python"
|
||||
],
|
||||
"flags": [
|
||||
"[VERIFY] GENERATOR = 31 is Plonky3 p3-baby-bear's chosen multiplicative generator (order = p-1 is PROVEN here; the identity as Plonky3's is [VERIFY])",
|
||||
"[VERIFY] W = 11 is Plonky3's BabyBear BinomialExtensionField<_,4> non-residue (x^4-11 irreducibility is PROVEN here; the identity as Plonky3's W is [VERIFY]/[MEASURE])",
|
||||
"[VERIFY] two_adic_generator(27) exact value vs Plonky3 (order 2^27 is PROVEN here)",
|
||||
"[MEASURE] byte-for-byte conformance of Fp/Fp4 outputs vs p3-baby-bear / p3-field unit vectors at the pinned revision (needs the pinned Plonky3 source)"
|
||||
],
|
||||
"notes": [
|
||||
"multiplicative generator 31 proven order = p-1 = 2013265920 [VERIFY it is Plonky3's]",
|
||||
"two_adic_generator(27) = 440564289, order proven 2^27 [VERIFY exact Plonky3 value]",
|
||||
"W = 11: 11^((p-1)/2) == p-1 (QNR) and p == 1 mod 4 => x^4 - 11 irreducible (Lidl-Niederreiter Thm 3.75) => F_(p^4) is a genuine field [VERIFY it is Plonky3's W]",
|
||||
"ord(W=11) = 671088640 = 2^27 * 5; ord(x) = 4*ord(W) = 2684354560 divides 4(p-1)",
|
||||
"cross-language implementations compared: java, node, python"
|
||||
],
|
||||
"passed": 396242,
|
||||
"failed": 0,
|
||||
"total": 396242
|
||||
}
|
||||
@@ -0,0 +1,19 @@
|
||||
{
|
||||
"component": "Fiat-Shamir transcript / Poseidon2 DuplexChallenger (port spec component (f))",
|
||||
"precompile": "0x0000000000000000000000000000000000000ae8",
|
||||
"scope": "port spec section 7; the duplex-sponge challenger DuplexChallenger<BabyBear, Perm, WIDTH=16, RATE=8> and the GrindingChallenger check_witness: observe (overwrite-mode absorb), sample (squeeze, pop from the end of the rate buffer), sample_bits (low-bits query-index reduction), check_witness (observe witness then sample_bits==0). Wired behind the still-fail-closed top level.",
|
||||
"validates": "CONFORMANCE: ground truth emitted by executing the pinned Plonky3 p3-challenger 0.4.3-succinct DuplexChallenger + GrindingChallenger (and the p3-fri verify_shape_and_sample_challenges transcript ORDER). (1) a fully-scripted observe/sample transcript reproduces every sampled base + F_{p^4} ext value, the full 16-lane sponge state, and a check_witness accept/reject table byte-for-byte; (2) the FRI betas + query indices + grinding acceptance are DERIVED from the transcript (commit_phase_commits + final_poly + pow_witness) and match the pinned p3-fri challenger AND the confirmed FRI ground truth; (3) END TO END: those derived betas/indices, fed into the CONFIRMED FRI verify_query (component (d)), accept the real FRI proof and reject a tampered beta. Python/Node/standalone-Java are byte-identical.",
|
||||
"does_not_validate": "the SP1 recursion-AIR constraint evaluation (component (e)): the reduced openings, DEEP zeta/alpha challenges, quotient consistency, and vk binding. That is un-ported (StarkConstraints.evaluateAtZeta = UNAVAILABLE). A real exported SP1 v6.1.0 proof's transcript (vkey digest, trace/quotient commitments, opened values order) is still [MEASURE].",
|
||||
"top_level_verifier": "unchanged, still FAIL-CLOSED (returns EMPTY for every input). Even with component (f) confirmed and Challenger.spongePorted flipped true, StarkConstraints.evaluateAtZeta returns UNAVAILABLE (component (e) un-ported), so verify() returns UNAVAILABLE before any query loop and computePrecompile returns EMPTY. ACCEPT is unreachable. DO NOT ACTIVATE.",
|
||||
"confirmed_config": "DuplexChallenger<BabyBear, Poseidon2<BabyBear,...,16,7>, WIDTH=16, RATE=8>; Witness=BabyBear; Challenge=BinomialExtensionField<BabyBear,4>; sample pops from the END of the rate buffer (Vec::pop); sample_bits masks the LOW `bits` of as_canonical_u64; check_witness = observe(witness) then sample_bits(bits)==0.",
|
||||
"pinned_conformance_target": "p3-challenger 0.4.3-succinct (duplex_challenger.rs, grinding_challenger.rs), transcript order p3-fri 0.4.3-succinct verifier.rs (verify_shape_and_sample_challenges), sponge = confirmed Poseidon2-BabyBear (component (b)); byte-identical to the repo Cargo.lock. Extractor: pq-stark/challenger-extractor -> pq-stark/challenger_ground_truth.json.",
|
||||
"cross_language": "Python (challenger_reference.py), Node (challenger_reference.mjs), standalone Java (ChallengerSelfTest.java) emit byte-identical shared vectors.",
|
||||
"flags": {
|
||||
"Challenger.spongePorted": true,
|
||||
"note": "flipped true: component (f) confirmed. StarkConstraints.evaluateAtZeta stays UNAVAILABLE (component (e)), so the top level stays fail-closed and ACCEPT is unreachable."
|
||||
},
|
||||
"notes": [],
|
||||
"passed": 44,
|
||||
"failed": 0,
|
||||
"total": 44
|
||||
}
|
||||
@@ -0,0 +1,27 @@
|
||||
{
|
||||
"component": "FRI query-index derivation (sample_bits + folding-index walk)",
|
||||
"precompile": "0x0000000000000000000000000000000000000ae8",
|
||||
"scope": "port spec section 8; ONE constant-free slice of FRI component (d)",
|
||||
"validates": "index LOGIC vs public Plonky3 p3-fri spec, across independent implementations",
|
||||
"does_not_validate": "conformance to a real SP1 v6.1.0 trace ([MEASURE]; needs Poseidon2 challenger + exported proof)",
|
||||
"top_level_verifier": "unchanged, still fail-closed (returns EMPTY for every input)",
|
||||
"cross_language": [
|
||||
"java",
|
||||
"node",
|
||||
"python"
|
||||
],
|
||||
"flags": [
|
||||
"[VERIFY] sample_bits masks LOW bits of as_canonical_u32 (LSB) vs p3-challenger",
|
||||
"[VERIFY] arity-2 fold: sibling = index^1, index_pair = index>>1 vs p3-fri verifier.rs",
|
||||
"[VERIFY] log_max_height = log_max_degree + log_blowup; num_fold_rounds = log_max_height - log_final_poly_len for the pinned config",
|
||||
"[MEASURE] bit-reversal index-to-domain-point mapping vs a real Plonky3 trace",
|
||||
"[MEASURE] end-to-end derive_query_indices vs a real SP1 v6.1.0 inner proof"
|
||||
],
|
||||
"notes": [
|
||||
"Poseidon2 S-box exponent d = smallest d>1 with gcd(d, p-1)=1 = 7 (x^7)",
|
||||
"cross-language implementations compared: java, node, python"
|
||||
],
|
||||
"passed": 100021,
|
||||
"failed": 0,
|
||||
"total": 100021
|
||||
}
|
||||
@@ -0,0 +1,60 @@
|
||||
{
|
||||
"component": "FRI low-degree test / query verification over BabyBear (port spec component (d))",
|
||||
"precompile": "0x0000000000000000000000000000000000000ae8",
|
||||
"scope": "port spec section 5; the FRI verifier's FOLD + OPENING relations (verify_query / verify_challenges): arity-2 folding in F_{p^4}, per-layer MMCS openings against the commit-phase roots, down to a single constant equal to the committed final polynomial.",
|
||||
"validates": "CONFORMANCE: real FRI proofs emitted by the pinned Plonky3 p3-fri 0.4.3-succinct PROVER (and accepted by its own verifier) are re-verified byte-for-byte by this reference (accept), and four tamper variants are rejected (corrupted opened value, corrupted MMCS sibling digest, wrong fold challenge beta, non-matching final poly); Python/Node/Java produce byte-identical per-query folded values.",
|
||||
"does_not_validate": "the SP1 recursion-AIR constraint evaluation (component (e)), which supplies the reduced openings and is UN-PORTED. Within THIS FRI KAT the betas / query indices are supplied as inputs; deriving them in-circuit is component (f) (the duplex-sponge challenger), now CONFIRMED separately (test_challenger.py), whose derived betas/indices close the loop into this verify_query.",
|
||||
"top_level_verifier": "unchanged, still FAIL-CLOSED (returns EMPTY for every input). Even with the FRI fold+opening (d) and the challenger (f) confirmed, StarkConstraints.evaluateAtZeta=UNAVAILABLE (component (e)), so verify() never reaches ACCEPT and computePrecompile returns EMPTY. ACCEPT is unreachable. DO NOT ACTIVATE.",
|
||||
"confirmed_config": {
|
||||
"folding_arity": 2,
|
||||
"sibling_rule": "index_sibling = index ^ 1, index_pair = index >> 1 (p3-fri verifier.rs)",
|
||||
"num_fold_rounds": "log_max_height - log_blowup (final poly is a single F_{p^4} CONSTANT)",
|
||||
"log_max_height": "commit_phase_commits.len() + log_blowup",
|
||||
"commit_phase_mmcs": "ExtensionMmcs<Val,Challenge,ValMmcs> over the CONFIRMED FieldMerkleTreeMmcs (component (c)); a commit-phase leaf is a pair of F_{p^4} evals flattened to 8 BabyBear coords, hashed by the PaddingFreeSponge",
|
||||
"coset_point": "x = two_adic_generator(log_max_height)^reverse_bits_len(index, log_max_height), in F_{p^4}; the sibling point is -x (two_adic_generator(1))",
|
||||
"fold_relation": "folded = e0 + (beta - x0) * (e1 - e0) / (x1 - x0) (linear interpolation through beta), plus reduced_openings[log_folded_height+1] injected before each fold",
|
||||
"final_poly_check": "every query's folded constant must equal proof.final_poly"
|
||||
},
|
||||
"confirmed_by_kat": [
|
||||
"CONFIRMED arity-2 fold (sibling=index^1, index_pair=index>>1) vs p3-fri verifier.rs",
|
||||
"CONFIRMED num_fold_rounds = log_max_height - log_blowup; final poly is a single F_{p^4} constant",
|
||||
"CONFIRMED reverse_bits_len index-to-coset-point mapping (x = g^rev(index))",
|
||||
"CONFIRMED two_adic_generator(bits) matches Plonky3 (the fold coset points are correct)",
|
||||
"CONFIRMED the F_{p^4} non-residue W = 11 is Plonky3's (the EF fold arithmetic reproduces the fold)",
|
||||
"CONFIRMED the ExtensionMmcs flatten (each F_{p^4} eval -> 4 base coords, pair -> 8) + base MMCS open"
|
||||
],
|
||||
"cross_language": [
|
||||
"java",
|
||||
"node",
|
||||
"python"
|
||||
],
|
||||
"conformance": {
|
||||
"status": "CONFIRMED (real known-answer test PASSED: accept genuine + reject tampered)",
|
||||
"method": "pq-stark/fri-extractor (a Rust binary depending on the pinned crates; lockfile checksums matched) ran p3_fri::prover::prove over known low-degree codewords with the seed_from_u64(1) Poseidon2, then p3_fri::verifier::{verify_shape_and_sample_challenges,verify_challenges} to confirm the library accepts; its output is fri_ground_truth.json",
|
||||
"cases": [
|
||||
"blowup1_h6_q4",
|
||||
"blowup2_h7_q5",
|
||||
"blowup1_h8_q6"
|
||||
]
|
||||
},
|
||||
"pinned_conformance_target": {
|
||||
"revision": "Succinct Plonky3 fork, crates.io version 0.4.3-succinct",
|
||||
"p3_fri_checksum": "5cbc4965ee488f3247867b7ec4bb005b8afa72cb0d461a4dcb1387ecab6426d5",
|
||||
"p3_challenger_checksum": "b6a908924d43e4cfb93fb41c8346cac211b70314385a9037e9241f5b7f3eaf77",
|
||||
"p3_dft_checksum": "be6408b10a2c27eb13a7d5580c546c2179a8dc7dbc10a990657311891f9b41c0",
|
||||
"p3_commit_checksum": "50acacc7219fce6c01db938f82c1b21b5e7133990b7fff861f91534aeb569419",
|
||||
"found_in": "aerenew/zk-circuits/*/Cargo.lock and aerenew/rollup-evm-validity/*/Cargo.lock"
|
||||
},
|
||||
"flags": [
|
||||
"[VERIFY]->CONFIRMED here: arity-2 fold, num_fold_rounds, reverse-bits mapping, two_adic_generator, W=11 (all exercised by the accept-KAT over the pinned p3-fri proof)",
|
||||
"[MEASURE] conformance against a REAL exported SP1 v6.1.0 inner proof's FRI section (needs the exported proof + the AIR reduced-openings, component (e))",
|
||||
"component (f) transcript binding is now CONFIRMED (Challenger.spongePorted=true; the derived betas/indices close the loop into this verify_query, see test_challenger.py). The top level stays fail-closed on the AIR (component (e), StarkConstraints=UNAVAILABLE)"
|
||||
],
|
||||
"notes": [
|
||||
"CONFORMANCE: 3 FRI proofs from the pinned p3-fri 0.4.3-succinct prover accepted; 4 tamper variants each rejected (opening, MMCS proof, beta, final poly)",
|
||||
"cross-language implementations compared: java, node, python"
|
||||
],
|
||||
"passed": 55,
|
||||
"failed": 0,
|
||||
"total": 55
|
||||
}
|
||||
@@ -0,0 +1,106 @@
|
||||
{
|
||||
"precompile": "Falcon HashToPoint (SHAKE256 rejection sampler)",
|
||||
"address": "0x0000000000000000000000000000000000000ae7",
|
||||
"oracle": "python hashlib.shake_256 (FIPS 202), independent of Bouncy Castle",
|
||||
"passed": 12,
|
||||
"failed": 0,
|
||||
"total": 12,
|
||||
"results": [
|
||||
{
|
||||
"tcId": "0",
|
||||
"logn": 9,
|
||||
"n": 512,
|
||||
"nonceLen": 40,
|
||||
"msgLen": 53,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "1",
|
||||
"logn": 9,
|
||||
"n": 512,
|
||||
"nonceLen": 40,
|
||||
"msgLen": 53,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "2",
|
||||
"logn": 9,
|
||||
"n": 512,
|
||||
"nonceLen": 40,
|
||||
"msgLen": 53,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "3",
|
||||
"logn": 9,
|
||||
"n": 512,
|
||||
"nonceLen": 40,
|
||||
"msgLen": 53,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "4",
|
||||
"logn": 9,
|
||||
"n": 512,
|
||||
"nonceLen": 40,
|
||||
"msgLen": 53,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "5",
|
||||
"logn": 9,
|
||||
"n": 512,
|
||||
"nonceLen": 40,
|
||||
"msgLen": 53,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "6",
|
||||
"logn": 9,
|
||||
"n": 512,
|
||||
"nonceLen": 40,
|
||||
"msgLen": 53,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "7",
|
||||
"logn": 9,
|
||||
"n": 512,
|
||||
"nonceLen": 40,
|
||||
"msgLen": 53,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "8",
|
||||
"logn": 9,
|
||||
"n": 512,
|
||||
"nonceLen": 40,
|
||||
"msgLen": 0,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "9",
|
||||
"logn": 9,
|
||||
"n": 512,
|
||||
"nonceLen": 40,
|
||||
"msgLen": 3,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "10",
|
||||
"logn": 9,
|
||||
"n": 512,
|
||||
"nonceLen": 40,
|
||||
"msgLen": 43,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "11",
|
||||
"logn": 10,
|
||||
"n": 1024,
|
||||
"nonceLen": 40,
|
||||
"msgLen": 28,
|
||||
"status": "PASS"
|
||||
}
|
||||
]
|
||||
}
|
||||
@@ -0,0 +1,212 @@
|
||||
{
|
||||
"precompile": "ML-KEM-768 (FIPS 203) deterministic encapsulate",
|
||||
"address": "0x0000000000000000000000000000000000000ae6",
|
||||
"liveOnMainnet2800": false,
|
||||
"note": "TESTNET-ONLY precompile. Verified here against an independent pure-Python FIPS 203 oracle (stdlib hashlib only), not Bouncy Castle.",
|
||||
"oracle": "mlkem768_reference.py (this file)",
|
||||
"passed": 25,
|
||||
"failed": 0,
|
||||
"total": 25,
|
||||
"results": [
|
||||
{
|
||||
"tcId": "26",
|
||||
"ekLen": 1184,
|
||||
"ctLen": 1088,
|
||||
"ciphertextMatch": true,
|
||||
"sharedSecretMatch": true,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "27",
|
||||
"ekLen": 1184,
|
||||
"ctLen": 1088,
|
||||
"ciphertextMatch": true,
|
||||
"sharedSecretMatch": true,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "28",
|
||||
"ekLen": 1184,
|
||||
"ctLen": 1088,
|
||||
"ciphertextMatch": true,
|
||||
"sharedSecretMatch": true,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "29",
|
||||
"ekLen": 1184,
|
||||
"ctLen": 1088,
|
||||
"ciphertextMatch": true,
|
||||
"sharedSecretMatch": true,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "30",
|
||||
"ekLen": 1184,
|
||||
"ctLen": 1088,
|
||||
"ciphertextMatch": true,
|
||||
"sharedSecretMatch": true,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "31",
|
||||
"ekLen": 1184,
|
||||
"ctLen": 1088,
|
||||
"ciphertextMatch": true,
|
||||
"sharedSecretMatch": true,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "32",
|
||||
"ekLen": 1184,
|
||||
"ctLen": 1088,
|
||||
"ciphertextMatch": true,
|
||||
"sharedSecretMatch": true,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "33",
|
||||
"ekLen": 1184,
|
||||
"ctLen": 1088,
|
||||
"ciphertextMatch": true,
|
||||
"sharedSecretMatch": true,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "34",
|
||||
"ekLen": 1184,
|
||||
"ctLen": 1088,
|
||||
"ciphertextMatch": true,
|
||||
"sharedSecretMatch": true,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "35",
|
||||
"ekLen": 1184,
|
||||
"ctLen": 1088,
|
||||
"ciphertextMatch": true,
|
||||
"sharedSecretMatch": true,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "36",
|
||||
"ekLen": 1184,
|
||||
"ctLen": 1088,
|
||||
"ciphertextMatch": true,
|
||||
"sharedSecretMatch": true,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "37",
|
||||
"ekLen": 1184,
|
||||
"ctLen": 1088,
|
||||
"ciphertextMatch": true,
|
||||
"sharedSecretMatch": true,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "38",
|
||||
"ekLen": 1184,
|
||||
"ctLen": 1088,
|
||||
"ciphertextMatch": true,
|
||||
"sharedSecretMatch": true,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "39",
|
||||
"ekLen": 1184,
|
||||
"ctLen": 1088,
|
||||
"ciphertextMatch": true,
|
||||
"sharedSecretMatch": true,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "40",
|
||||
"ekLen": 1184,
|
||||
"ctLen": 1088,
|
||||
"ciphertextMatch": true,
|
||||
"sharedSecretMatch": true,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "41",
|
||||
"ekLen": 1184,
|
||||
"ctLen": 1088,
|
||||
"ciphertextMatch": true,
|
||||
"sharedSecretMatch": true,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "42",
|
||||
"ekLen": 1184,
|
||||
"ctLen": 1088,
|
||||
"ciphertextMatch": true,
|
||||
"sharedSecretMatch": true,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "43",
|
||||
"ekLen": 1184,
|
||||
"ctLen": 1088,
|
||||
"ciphertextMatch": true,
|
||||
"sharedSecretMatch": true,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "44",
|
||||
"ekLen": 1184,
|
||||
"ctLen": 1088,
|
||||
"ciphertextMatch": true,
|
||||
"sharedSecretMatch": true,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "45",
|
||||
"ekLen": 1184,
|
||||
"ctLen": 1088,
|
||||
"ciphertextMatch": true,
|
||||
"sharedSecretMatch": true,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "46",
|
||||
"ekLen": 1184,
|
||||
"ctLen": 1088,
|
||||
"ciphertextMatch": true,
|
||||
"sharedSecretMatch": true,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "47",
|
||||
"ekLen": 1184,
|
||||
"ctLen": 1088,
|
||||
"ciphertextMatch": true,
|
||||
"sharedSecretMatch": true,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "48",
|
||||
"ekLen": 1184,
|
||||
"ctLen": 1088,
|
||||
"ciphertextMatch": true,
|
||||
"sharedSecretMatch": true,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "49",
|
||||
"ekLen": 1184,
|
||||
"ctLen": 1088,
|
||||
"ciphertextMatch": true,
|
||||
"sharedSecretMatch": true,
|
||||
"status": "PASS"
|
||||
},
|
||||
{
|
||||
"tcId": "50",
|
||||
"ekLen": 1184,
|
||||
"ctLen": 1088,
|
||||
"ciphertextMatch": true,
|
||||
"sharedSecretMatch": true,
|
||||
"status": "PASS"
|
||||
}
|
||||
]
|
||||
}
|
||||
@@ -0,0 +1,35 @@
|
||||
{
|
||||
"precompile": "ML-KEM-768 (FIPS 203) deterministic encapsulate",
|
||||
"address": "0x0000000000000000000000000000000000000ae6",
|
||||
"source": "NIST ACVP ML-KEM-encapDecap-FIPS203 (encapsulation AFT)",
|
||||
"results": [
|
||||
{"tcId": "26", "ekLen": 1184, "ctLen": 1120, "expectedMatch": true, "deterministic": true, "status": "PASS"},
|
||||
{"tcId": "27", "ekLen": 1184, "ctLen": 1120, "expectedMatch": true, "deterministic": true, "status": "PASS"},
|
||||
{"tcId": "28", "ekLen": 1184, "ctLen": 1120, "expectedMatch": true, "deterministic": true, "status": "PASS"},
|
||||
{"tcId": "29", "ekLen": 1184, "ctLen": 1120, "expectedMatch": true, "deterministic": true, "status": "PASS"},
|
||||
{"tcId": "30", "ekLen": 1184, "ctLen": 1120, "expectedMatch": true, "deterministic": true, "status": "PASS"},
|
||||
{"tcId": "31", "ekLen": 1184, "ctLen": 1120, "expectedMatch": true, "deterministic": true, "status": "PASS"},
|
||||
{"tcId": "32", "ekLen": 1184, "ctLen": 1120, "expectedMatch": true, "deterministic": true, "status": "PASS"},
|
||||
{"tcId": "33", "ekLen": 1184, "ctLen": 1120, "expectedMatch": true, "deterministic": true, "status": "PASS"},
|
||||
{"tcId": "34", "ekLen": 1184, "ctLen": 1120, "expectedMatch": true, "deterministic": true, "status": "PASS"},
|
||||
{"tcId": "35", "ekLen": 1184, "ctLen": 1120, "expectedMatch": true, "deterministic": true, "status": "PASS"},
|
||||
{"tcId": "36", "ekLen": 1184, "ctLen": 1120, "expectedMatch": true, "deterministic": true, "status": "PASS"},
|
||||
{"tcId": "37", "ekLen": 1184, "ctLen": 1120, "expectedMatch": true, "deterministic": true, "status": "PASS"},
|
||||
{"tcId": "38", "ekLen": 1184, "ctLen": 1120, "expectedMatch": true, "deterministic": true, "status": "PASS"},
|
||||
{"tcId": "39", "ekLen": 1184, "ctLen": 1120, "expectedMatch": true, "deterministic": true, "status": "PASS"},
|
||||
{"tcId": "40", "ekLen": 1184, "ctLen": 1120, "expectedMatch": true, "deterministic": true, "status": "PASS"},
|
||||
{"tcId": "41", "ekLen": 1184, "ctLen": 1120, "expectedMatch": true, "deterministic": true, "status": "PASS"},
|
||||
{"tcId": "42", "ekLen": 1184, "ctLen": 1120, "expectedMatch": true, "deterministic": true, "status": "PASS"},
|
||||
{"tcId": "43", "ekLen": 1184, "ctLen": 1120, "expectedMatch": true, "deterministic": true, "status": "PASS"},
|
||||
{"tcId": "44", "ekLen": 1184, "ctLen": 1120, "expectedMatch": true, "deterministic": true, "status": "PASS"},
|
||||
{"tcId": "45", "ekLen": 1184, "ctLen": 1120, "expectedMatch": true, "deterministic": true, "status": "PASS"},
|
||||
{"tcId": "46", "ekLen": 1184, "ctLen": 1120, "expectedMatch": true, "deterministic": true, "status": "PASS"},
|
||||
{"tcId": "47", "ekLen": 1184, "ctLen": 1120, "expectedMatch": true, "deterministic": true, "status": "PASS"},
|
||||
{"tcId": "48", "ekLen": 1184, "ctLen": 1120, "expectedMatch": true, "deterministic": true, "status": "PASS"},
|
||||
{"tcId": "49", "ekLen": 1184, "ctLen": 1120, "expectedMatch": true, "deterministic": true, "status": "PASS"},
|
||||
{"tcId": "50", "ekLen": 1184, "ctLen": 1120, "expectedMatch": true, "deterministic": true, "status": "PASS"}
|
||||
],
|
||||
"passed": 25,
|
||||
"failed": 0,
|
||||
"total": 25
|
||||
}
|
||||
@@ -0,0 +1,57 @@
|
||||
{
|
||||
"component": "Mixed Matrix Commitment Scheme (MMCS) over BabyBear (port spec component (c))",
|
||||
"precompile": "0x0000000000000000000000000000000000000ae8",
|
||||
"scope": "port spec section 4; the FieldMerkleTreeMmcs (Merkle-tree vector commitment) that FRI (d) and the trace commitment are built on. Exact SP1 inner config: PaddingFreeSponge<Perm,16,8,8> hasher, TruncatedPermutation<Perm,2,8,16> compressor, FieldMerkleTreeMmcs<Packing,Packing,MyHash,MyCompress,8> (digest = 8 BabyBear elems).",
|
||||
"validates": "SELF-CONSISTENCY + CONFORMANCE: every valid leaf opens to an authentication path that recomputes the committed root; tampered openings / proof siblings / roots fail; Python/Node/Java produce byte-identical roots/openings/proofs; AND the root/openings/proof reproduce real known-answer vectors extracted from the pinned p3-merkle-tree / p3-symmetric / p3-commit 0.4.3-succinct crates (the 'two wrong copies agree' trap is closed).",
|
||||
"does_not_validate": "the FULL STARK verifier. Only component (c) (the MMCS) is confirmed. The duplex-sponge challenger (f), FRI folding/consistency (d), and the SP1 recursion-AIR (e) are un-ported; conformance against a real exported SP1 commitment root is a further [MEASURE] step (needs an exported proof).",
|
||||
"top_level_verifier": "unchanged, still fail-closed (returns EMPTY for every input). Mmcs.available is now true (the commitment scheme is confirmed), but the challenger/FRI/AIR are still un-ported (Challenger.spongePorted=false, StarkConstraints=UNAVAILABLE), so the top level still returns EMPTY and ACCEPT is unreachable.",
|
||||
"construction": {
|
||||
"hasher": "PaddingFreeSponge<Perm, WIDTH=16, RATE=8, OUT=8> (overwrite-mode, padding-free)",
|
||||
"compressor": "TruncatedPermutation<Perm, N=2, CHUNK=8, WIDTH=16> (permute(l||r)[0:8])",
|
||||
"digest_elems": 8,
|
||||
"leaf_hash": "hash concatenated rows of all matrices at the current (padded) height",
|
||||
"mixed_height": "tallest-first; pad each layer to a power of two with the zero digest; inject shorter matrices' hashed rows via compress([node, rows_digest]) at the layer whose padded length equals their next_power_of_two height"
|
||||
},
|
||||
"cross_language": [
|
||||
"java",
|
||||
"node",
|
||||
"python"
|
||||
],
|
||||
"conformance": {
|
||||
"status": "CONFIRMED (real known-answer test PASSED)",
|
||||
"method": "the exact pinned crates were executed via cargo (lockfile checksums matched) to commit to known matrix batches and emit roots + open_batch openings/proofs; this reference reproduces every value exactly and its verify_batch accepts them",
|
||||
"cases": [
|
||||
"single_8x2",
|
||||
"single_6x2",
|
||||
"single_8x1",
|
||||
"mixed_8x2_4x3",
|
||||
"mixed_8x1_4x2_2x2",
|
||||
"mixed_5x2_3x1"
|
||||
]
|
||||
},
|
||||
"pinned_conformance_target": {
|
||||
"revision": "Succinct Plonky3 fork, crates.io version 0.4.3-succinct",
|
||||
"p3_merkle_tree_checksum": "d5703d9229d52a8c09970e4d722c3a8b4d37e688c306c3a1c03b872efcd204e6",
|
||||
"p3_symmetric_checksum": "9047ce85c086a9b3f118e10078f10636f7bfeed5da871a04da0b61400af8793a",
|
||||
"p3_commit_checksum": "50acacc7219fce6c01db938f82c1b21b5e7133990b7fff861f91534aeb569419",
|
||||
"p3_matrix_checksum": "75c3f150ceb90e09539413bf481e618d05ee19210b4e467d2902eb82d2e15281",
|
||||
"found_in": "aerenew/zk-circuits/*/Cargo.lock and aerenew/rollup-evm-validity/*/Cargo.lock"
|
||||
},
|
||||
"confirmed": [
|
||||
"CONFIRMED SP1 inner config: PaddingFreeSponge<_,16,8,8> / TruncatedPermutation<_,2,8,16> / FieldMerkleTreeMmcs<...,8> (verbatim from p3-merkle-tree mmcs.rs tests)",
|
||||
"CONFIRMED tree build: tallest-first, power-of-two padding with zero digest, mixed-height injection (compress_and_inject) matches p3-merkle-tree merkle_tree.rs",
|
||||
"CONFIRMED verify_batch: group-by-padded-height, index-parity ordering, inject at matching layer, matches p3-merkle-tree mmcs.rs",
|
||||
"CONFORMANCE KAT PASSED: 6 MMCS cases (single power-of-two, single non-power-of-two, column vector, and 3 mixed-height batches incl. a default-zero-digest sibling) reproduced exactly"
|
||||
],
|
||||
"flags": [
|
||||
"[MEASURE] conformance against a real exported SP1 v6.1.0 commitment root (the trace / FRI matrices from an actual proof) is a further step; it needs an exported proof + the challenger"
|
||||
],
|
||||
"notes": [
|
||||
"self-consistency: every valid leaf opens to a path that recomputes the root; tampered openings / proof siblings / roots all fail (all 6 cases)",
|
||||
"CONFORMANCE: 37/37 known-answer checks (perm sanity + 6 primitive KATs + 6 MMCS cases: root/openings/proof/verify_accept/tamper_reject) reproduced exactly from p3-merkle-tree / p3-symmetric / p3-commit 0.4.3-succinct",
|
||||
"cross-language implementations compared: java, node, python"
|
||||
],
|
||||
"passed": 300,
|
||||
"failed": 0,
|
||||
"total": 300
|
||||
}
|
||||
@@ -0,0 +1,94 @@
|
||||
{
|
||||
"component": "Poseidon2 permutation over BabyBear, width 16 (port spec component (b))",
|
||||
"precompile": "0x0000000000000000000000000000000000000ae8",
|
||||
"scope": "port spec section 3; the hash Plonky3/SP1 uses for Merkle/MMCS compression and the Fiat-Shamir duplex challenger",
|
||||
"validates": "SELF-CONSISTENCY + CONFORMANCE: x^7 is a bijection (7 = smallest coprime degree, proven); the permutation is deterministic and a genuine bijection (inverse round-trip, no collisions); M4 is MDS and the external/internal linear layers are invertible; Python/Node/Java produce byte-identical outputs; AND the permutation reproduces real known-answer vectors from the pinned p3-baby-bear / p3-poseidon2 0.4.3-succinct crates (the 'two wrong copies agree' trap is closed).",
|
||||
"does_not_validate": "the FULL STARK verifier. Only component (b) (the Poseidon2 permutation) is confirmed. The duplex-sponge challenger, FRI folding/consistency, MMCS/Merkle openings, and the SP1 recursion-AIR are un-ported.",
|
||||
"top_level_verifier": "unchanged, still fail-closed (returns EMPTY for every input). Poseidon2Bb.available is now true (the permutation is confirmed), but the challenger/FRI/AIR are still un-ported (Challenger.spongePorted=false, StarkConstraints=UNAVAILABLE), so the top level still returns EMPTY.",
|
||||
"constants": {
|
||||
"P": 2013265921,
|
||||
"r_inv": 943718400,
|
||||
"width": 16,
|
||||
"sbox_degree": 7,
|
||||
"rounds_f": 8,
|
||||
"rounds_p": 13,
|
||||
"internal_diag_m1_16": [
|
||||
2013265919,
|
||||
1,
|
||||
2,
|
||||
4,
|
||||
8,
|
||||
16,
|
||||
32,
|
||||
64,
|
||||
128,
|
||||
256,
|
||||
512,
|
||||
1024,
|
||||
2048,
|
||||
4096,
|
||||
8192,
|
||||
32768
|
||||
],
|
||||
"internal_layer_form": "M_I = R_INV * (J + diag(D)), R_INV = 943718400 (Montgomery artifact)",
|
||||
"m4": [
|
||||
2,
|
||||
3,
|
||||
1,
|
||||
1,
|
||||
1,
|
||||
2,
|
||||
3,
|
||||
1,
|
||||
1,
|
||||
1,
|
||||
2,
|
||||
3,
|
||||
3,
|
||||
1,
|
||||
1,
|
||||
2
|
||||
],
|
||||
"round_constants": "141 CONFIRMED constants (128 external + 13 internal) from Xoroshiro128Plus::seed_from_u64(1) via new_from_rng_128"
|
||||
},
|
||||
"cross_language": [
|
||||
"java",
|
||||
"node",
|
||||
"python"
|
||||
],
|
||||
"conformance": {
|
||||
"status": "CONFIRMED (real known-answer test PASSED)",
|
||||
"method": "the exact pinned crates were executed via cargo (lockfile checksums matched) to emit constants + 3 permutation vectors; this reference reproduces all 3 exactly",
|
||||
"vectors": [
|
||||
"zeros",
|
||||
"iota",
|
||||
"testvec"
|
||||
]
|
||||
},
|
||||
"pinned_conformance_target": {
|
||||
"revision": "Succinct Plonky3 fork, crates.io version 0.4.3-succinct",
|
||||
"p3_poseidon2_checksum": "522986377b2164c5f94f2dae88e0e0a3d169cc6239202ef4aeb4322d60feffd0",
|
||||
"p3_baby_bear_checksum": "d69e6e9af4eaaaa60f7bb9f0e0f73ebcbaefe7e00974d97ad0fa542d6a4f0890",
|
||||
"found_in": "aerenew/zk-circuits/*/Cargo.lock and aerenew/rollup-evm-validity/*/Cargo.lock"
|
||||
},
|
||||
"confirmed": [
|
||||
"CONFIRMED round constants: 128 external + 13 internal from seed_from_u64(1) / new_from_rng_128",
|
||||
"CONFIRMED ROUNDS_F=8, ROUNDS_P=13 (poseidon2_round_numbers_128(16, 7))",
|
||||
"CONFIRMED M4 = [[2,3,1,1],[1,2,3,1],[1,1,2,3],[3,1,1,2]] (recovered from Poseidon2ExternalMatrixGeneral)",
|
||||
"CONFIRMED INTERNAL_DIAG_M1_16 (canonical) and the R^{-1}*(J+diag(D)) internal-layer form (Montgomery artifact, recovered exactly from DiffusionMatrixBabyBear's 16x16 canonical matrix)",
|
||||
"CONFORMANCE KAT PASSED against p3-baby-bear / p3-poseidon2 0.4.3-succinct (checksums matched)"
|
||||
],
|
||||
"flags": [
|
||||
"[VERIFY] the SP1 v6.1.0 Merkle/MMCS compression convention (padding/rate, which 8 lanes) for compress2to1 (component (c)) is not yet pinned"
|
||||
],
|
||||
"notes": [
|
||||
"S-box x^7 CONFIRMED: 7 is the smallest d>1 with gcd(d, p-1)=1 (p-1 = 2^27*3*5), so x^7 is a bijection on F_p",
|
||||
"permutation is a bijection: inverse round-trips on 3000 random states + fixed set; 3000 distinct outputs, 0 collisions",
|
||||
"M4 is MDS (all 69 square submatrices nonsingular); external layer M_E and internal layer M_I = R^{-1}*(J + diag(D)) are invertible over F_p (both CONFIRMED vs p3)",
|
||||
"CONFORMANCE: 3/3 known-answer vectors from p3-baby-bear/p3-poseidon2 0.4.3-succinct reproduced exactly (zeros, iota [0..15], testvec)",
|
||||
"cross-language implementations compared: java, node, python"
|
||||
],
|
||||
"passed": 47017,
|
||||
"failed": 0,
|
||||
"total": 47017
|
||||
}
|
||||
Reference in new issue
Block a user