Zero-knowledge proof

A zero-knowledge proof (ZKP) is a cryptographic protocol by which a prover convinces a verifier that a statement is true without revealing any more information than that fact S-1600.

It has three properties:

• Completeness. If the statement is true and both parties follow the protocol, the verifier accepts S-1606.
• Soundness. If the statement is false, a verifier that follows the protocol is not convinced S-1606.
• Zero knowledge. If the statement is true and the prover follows the protocol, the verifier learns no confidential information beyond the fact that the statement is true S-1606.

The statement combines a public instance, known to both parties, with a private witness known only to the prover S-1606. Strictly, a proof must be sound even against a computationally unbounded prover; an argument, such as a SNARK (succinct non-interactive argument of knowledge), need only be sound against bounded ones S-1606. In zero-knowledge proofs of inference the witness is the model's weights: the prover publishes a commitment to them once, then proves for each query that the output equals the committed model applied to the input S-0023. zkLLM proved one 2,048-token forward pass of LLaMa-2-13B in 803 seconds on one A100 GPU, producing a 188 kB proof of a fixed-point approximation of the model S-0023. For zero-knowledge proofs of training constraints, a 2026 proposal notes that governance analyses judge such proofs currently impractical at frontier scale, and argues that this limit is not fundamental S-0025.