H33-ZKP-AIR
A STARK Proving System for Long Evaluation Traces
Related · tier-1 reading. For what a portable artifact actually is, see Portable Artifact.
Goldilocks field. SHA3-256 commitments. FRI polynomial proofs. No trusted setup. Post-quantum secure. Purpose-built for computations that need cryptographic attestation.
A second engine for a different class of proof.
H33's production auth STARK handles short, fixed traces at 2.21M auth/sec. ZKP-AIR handles long, variable-width traces for a fundamentally different workload.
Two engines. Two purposes.
Auth STARK and ZKP-AIR serve fundamentally different proof geometries. Here is how they compare.
| Property | Auth STARK (Production) | ZKP-AIR (New) |
|---|---|---|
| Field | BLS12-381 scalar | Goldilocks (264−232+1) |
| Trace Width | Fixed (7 columns) | Variable (3–32+ columns) |
| Trace Length | 32 rows | 256–65,536+ rows |
| Hash | Poseidon + SHA3-256 | SHA3-256 (domain-separated) |
| Commitment | FRI (custom) | FRI (Winterfell 0.13) |
| Trusted Setup | None | None |
| Post-Quantum | Yes (hash-based) | Yes (hash-based) |
Sub-millisecond verification at every trace size.
Line-Count AIR (3 columns, 2 transition constraints) — the scoring circuit geometry for H33-ZK-Procure. This is a different circuit from the 7-column biometric auth AIR used in the production authentication pipeline. Benchmarked on AWS Graviton4 (c8g.16xlarge, 64 vCPU, Neoverse V2) and Apple M4 Max. Single-core, release mode, 10 iterations.
| Trace Rows | Graviton4 Prove | M4 Max Prove | Graviton4 Verify | M4 Max Verify | Proof Size |
|---|---|---|---|---|---|
| 256 | 2.73 ms | 1.98 ms | 234 µs | 154 µs | 18 KB |
| 1,024 | 12.8 ms | 6.65 ms | 379 µs | 201 µs | 31 KB |
| 4,096 | 58 ms | 31 ms | 559 µs | 306 µs | 43 KB |
| 16,384 | 259 ms | 139 ms | 616 µs | 338 µs | 53 KB |
| 65,536 | 1.13 s | 609 ms | 785 µs | 424 µs | 68 KB |
Graviton4: c8g.16xlarge (64 vCPU, Neoverse V2). M4 Max: Apple Silicon. Both single-core, release mode. Verification sub-millisecond on both platforms at every trace size. Full methodology & reproducibility details →
Goldilocks Field Operations
Native u64 arithmetic. No big-integer libraries. Modular reduction via shifts and adds.
Audited · Frozen · Replayable.
ZKP-AIR was audited against the OtterSec Fiat-Shamir vulnerability pattern that impacted six independent zkVM implementations in March 2026. The protocol is now frozen and independently replayable.
Every commitment is absorbed into the transcript before dependent challenges are derived.
The verifier freezes:
- → transcript byte layout
- → domain separators
- → AIR identifiers
- → challenge ordering
- → FRI configuration semantics
Serialization drift immediately breaks CI.
The H33 reference verifier includes:
- → canonical transcript vectors
- → deterministic challenge vectors
- → malformed-proof corpora
- → replay integrity classification
- → structured rejection semantics
Independent implementations can deterministically verify compatibility against frozen vectors — without contacting H33 infrastructure.
The verifier deterministically rejects:
All malformed proofs produce deterministic rejection codes and replay classifications.
Proof
↓
Verifier A —┐
Verifier B —┼— IDENTICAL RESULT
Verifier C —┘
Deterministic replay across independent implementations.
Full Fiat-Shamir audit published. Complete audit covering both STARK engines, including two issues found and fixed in the auth STARK. Transparency is the only real security. Read the full audit report →
Three primitives built on the AIR engine.
Production infrastructure for privacy-preserving audit trails, unlinkable proof IDs, and constant-time verification at scale.
PRF-based identifiers that rotate per time window. Same proof, different epoch, completely different ID. Prevents correlation of proof submissions across sessions without changing the underlying key.
Client blinds the STARK proof with an ephemeral random factor after receiving it. AES-256-GCM commitment wrapper. The generating server cannot fingerprint the submitted bytes.
IVC folding compresses N event proofs into a single constant-size accumulator. O(1) verification regardless of trail length. Merkle inclusion proofs for individual events.
What ZKP-AIR proves.
Long evaluation traces enable a new class of cryptographic attestation — proving complex computations without revealing the inputs.
Same credits. Same dashboard. Same API.
H33-ZKP-AIR runs on the standardized H33 credit system. Same packs, same dashboard, same API key. No separate billing. No additional accounts. If you already have H33 credits, you can use ZKP-AIR today.
View credit packs and pricing →Prove computations. Reveal nothing.
Post-quantum STARK proofs for long evaluation traces. Sub-millisecond verification. No trusted setup.