Prove something is true without revealing the underlying data. H33's ZK API uses STARKs — no trusted setup, quantum-resistant by construction, with cached proof verification in sub-microsecond latency.
A zero-knowledge proof lets you prove that a statement is true without revealing any information beyond the truth of the statement itself.
Example: Prove that a user is over 21 without revealing their date of birth. Prove that a transaction is valid without revealing the amount. Prove that biometric data matches without exposing the biometric template.
H33 uses ZK-STARKs (Scalable Transparent Arguments of Knowledge), not SNARKs. The difference matters: STARKs require no trusted setup ceremony, rely only on hash functions for security, and are quantum-resistant by construction.
Most ZK systems use SNARKs, which require a trusted setup — a ceremony where secret parameters are generated. If anyone retains those parameters, they can forge proofs. STARKs eliminate this risk entirely.
| Property | STARK (H33) | SNARK |
|---|---|---|
| Trusted setup | None | Required |
| Quantum-resistant | Yes | No (elliptic curves) |
| Security basis | Hash functions (SHA3) | Elliptic curve pairings |
| Proof size | Larger (~kB) | Smaller (~bytes) |
| Verification | 0.358 μs (cached) | ~1-5 ms |
STARK proof sizes are larger, but H33 mitigates this with CacheeEngine — once a proof is verified, the result is cached and subsequent lookups take 0.358 μs.
Proves membership in a precomputed lookup table without revealing the value. Used in H33's authentication pipeline for ZKP verification of biometric match results.
Proofs are generated once and cached via CacheeEngine. Subsequent verifications are in-process DashMap lookups at 0.358 μs — effectively free compared to the FHE and attestation stages.
Custom constraint systems for arbitrary proofs. Define your computation as algebraic constraints over a finite field, and ZKP-AIR generates a STARK proof that the constraints are satisfied.
Used for credential verification, compliance proofs, and any application requiring custom zero-knowledge logic beyond lookup tables.
Prove a credential is valid (age, membership, license) without exposing the credential itself. The verifier learns "valid" or "invalid" — nothing else.
Prove identity verification was completed and passed, without sending PII to the verifying party. The proof travels, the data stays.
Prove that a transaction satisfies regulatory constraints (amount limits, sanctions screening) without revealing transaction details to the auditor.
Prove that an FHE-encrypted biometric template matches an enrolled template, without decrypting either template. Combined with H33-74 attestation.
Prove that an AI model produced a specific output from a specific input, without revealing the model weights or the input data.
Prove that a financial settlement was computed correctly and matches agreed terms, without exposing proprietary pricing or position data.
Get an API key and generate your first zero-knowledge proof in minutes. No trusted setup, no elliptic curves, no quantum risk.