Prove compliance, identity, and eligibility without revealing private data.
The problem
Today, proving anything online means showing everything. Compliance audits expose customer records. Identity checks leak personal data. Credential verification creates linkable trails. Privacy-eroding audits are the norm, not the exception.
The approach
Succinct proofs
A single compact proof replaces the need to share underlying data, no matter how large the dataset.
Zero knowledge
The verifier learns only the boolean outcome -- pass or fail -- and nothing about the private inputs.
Replay prevention
Deterministic nullifiers and epoch-based checkpoints prevent proof reuse across verifiers and time windows.
What is NESSA
NESSA is a protocol for issuing, holding, and verifying credentials using zero-knowledge proofs. It defines how an issuer publishes credentials into an on-chain accumulator, how a holder generates a succinct proof of membership, and how a verifier checks that proof against a public checkpoint without learning anything about the holder or the credential contents.
What is qFold
qFold is the folding-based proving system that generates the succinct zero-knowledge proofs NESSA relies on. It compresses arbitrarily large computations into a fixed-size proof that can be verified in constant time.
Use cases
AML Compliance
A bank compresses compliance events across millions of customers into one succinct proof. The regulator verifies that the bank is fully compliant without learning any customer details.
Try interactive sandboxUse Case 2Accredited Investor
A user's local agent checks financial accounts privately. A single proof confirms the accredited-investor threshold is met, and the investment platform learns nothing about actual balances.
Try interactive sandbox