Verifiable computation, by anyone, at speed.
Transparent setup. Fast verification. Post-quantum-conjectured.
What the verification layer proves.
Inference AIR
Prove that a model produced a specific output from a specific input — anchor AI execution to the chain.
Settlement AIR
Prove that a payment, escrow release, or channel update was authorized — without revealing the parties or amounts.
Identity AIR
Prove a credential claim — KYC tier, delegation scope, or attribute — without revealing the underlying credential.
Transparent setup
No ceremony, no toxic waste, no per-circuit CRS. Anyone can generate the proving parameters from public randomness.
Post-quantum-conjectured
STARK soundness rests on collision-resistant hashing — no elliptic-curve or pairing assumptions that quantum can break.
Hybrid ZK-in-TEE
Generate the proof inside an attested enclave. Sign the commitment with classical or PQ-hybrid keys. Verify the binding on-chain.
Pinned testnet config
log_blowup=1, num_queries=64, query_pow=16, commit_pow=8 — deterministic verification across implementations.
Commitment-attestation model
Validators record 32-byte SHA-256 commitments to ZkCommitmentRegistry. ZK_VERIFY precompile becomes an O(1) HashSet lookup.
Generic dispatcher
verify_proof_envelope(&Proof) matches on circuit_id and runs the right AIR — single entry point for web, MCP, and RPC.
From proof generation to on-chain verification.
- 01Prover builds AIR witnessThe prover constructs an algebraic intermediate representation witness from the input data and computation trace.
- 02Plonky3 generates STARKPoseidon2 + FRI commitment over the KoalaBear field produces a compact proof (~64–128 KB) with explicit public inputs.
- 03Validator verifies off-chainValidators run the full Plonky3 verifier with the pinned testnet config — typically 5–20 ms on commodity hardware.
- 04Commitment recorded on-chainValidator records SHA-256(circuit_id ‖ proof_bytes ‖ public_inputs) to ZkCommitmentRegistry via consensus.
- 05EVM checks O(1)Smart contracts check the commitment via the ZK_VERIFY precompile — a constant-time HashSet lookup instead of curve math.
- 06Verifier anywhereBrowsers, mobile clients, MCP servers, and the JSON-RPC endpoint all run the same Plonky3 verifier through the generic dispatcher.
- Proof system
- Plonky3 STARK over KoalaBear (2³¹ − 2²⁴ + 1, two-adicity 24)
- Hashing
- Poseidon2
- Commitments
- FRI
- Testnet config
- log_blowup=1, num_queries=64, query_pow=16, commit_pow=8
- Proof size
- ~64–128 KB
- Verification time
- ~5–20 ms on commodity hardware
- On-chain
- ZkCommitmentRegistry + ZK_VERIFY precompile, O(1) hash lookup
- AIRs
- inference, settlement, identity