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.
The Zero-Knowledge Proof API is a developer interface for generating and verifying zero-knowledge proofs — cryptographic proofs that a statement is true without revealing the underlying data. It exists so that a verifier can confirm a fact (age, credential validity, a correct computation) while the private inputs never leave the prover.
This API is a supporting expression of the H33 ZK Platform, which proves without revealing. Every endpoint on this page reinforces that one capability; none of them redefines it.
Where ZK ends. The ZK Platform proves a statement without revealing it — it does not compute on encrypted data. Computing over ciphertext is fully homomorphic encryption, owned by the FHE Platform. And the portable, offline-verifiable evidence of a proof is produced by H33-74: ZK generates the proof, H33-74 anchors it as portable evidence.
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.
A developer interface for generating and verifying ZK-STARK proofs — proofs that a statement is true without revealing the underlying data. It is a supporting expression of the H33 ZK Platform, which proves without revealing.
Use it when a verifier needs to confirm a fact — age over 21, credential validity, a correct computation — without seeing the private inputs. Do not use it when you need to compute over data that stays encrypted end to end; that is fully homomorphic encryption, handled by the FHE Platform. And ZK alone does not give you portable, offline-verifiable evidence of the result — that is anchored by H33-74.
No. Zero-knowledge proves a statement without revealing the witness; it does not run computation over ciphertext. Computing on encrypted data is fully homomorphic encryption — the FHE Platform. The two compose (an FHE biometric match can be attested with a ZK proof), but they are distinct primitives.
No. ZK-STARKs — like SNARKs, Groth16, PLONK, Halo2, and RISC Zero — are external constructions from the public cryptography literature. H33 implements and uses STARKs; it does not own or claim to have invented them. The H33 contribution is the production API, the CacheeEngine verification cache, and H33-74 attestation over the proof result.
Get an API key and generate your first zero-knowledge proof in minutes. No trusted setup, no elliptic curves, no quantum risk.