Text column edges

Reply to ilyag

ilyag · · in VerInf: zero-knowledge proofs of LLM inference VerInf produces zero-knowledge...

VerInf: zero-knowledge proofs of LLM inference

VerInf produces zero-knowledge proofs of large-language-model inference. It has proven a 400B-parameter model with the prover running on a single consumer NVIDIA DGX Spark, and it uses only hash-based commitments, so there is no trusted setup and the construction is plausibly post-quantum.

VerInf certifies an observed output stream against a committed integer model and bounds the unexplained information: the output bits that computation does not account for. Proving similarity rather than exact reproduction is what lets it target a real, already-trained model whose inference runs in floating point. The proof reveals nothing beyond this bound and the public claim list, which discloses the model architecture but not the weights, activations, or hidden tokens.

The intended use cases are high-stakes settings where inference must be checked without revealing the model: verifying AI compute agreements between mutually distrustful parties, detecting model-weight exfiltration, auditing a deployed model against an approved version, or checking inference for bugs or tampering.

The formulation, the construction, the soundness analysis, and the cost model are in the draft paper (PDF); this README covers what the system does and how to run it.

JamesPetrie/VerInf
https://github.com/jamespetrie/verinf

Show more

…
Options