FlashProve: an open-source library for provable inference

Roy Rinberg, Alex Allain, Alessandro Chiesa, Miranda Christ, Rahul Dalal, Giacomo Fenzi, Ben Mayer, Guy Weissenberg

FlashProve combines a hiding weight commitment with a succinct cryptographic proof of integer-model inference for Llama 4 Maverick. For a batch of 24 requests with 1,024-token contexts, the authors report about 223 seconds on one H100 GPU and 24 CPU cores, with one selected token checked per request and an 18.78 MB proof for each request. The approximately 110 tokens/second figure counts processed context tokens; checking every token instead gives about 39.1 checked tokens/second in their experiment.

What was already known

Earlier verifiable-inference systems covered smaller networks or incurred much larger proving and verification costs. The authors compare with zkLLM and VerInf, but those experiments use different models, hardware and proof scopes, so their figures do not establish a controlled speedup factor.

AI involvement AI-centered

The named research team credits Claude with novel applications of cryptographic tools and with building the improved inference-proof system. AI agents produced the protocol paper and translated Lean representations into executable prover and verifier code. Humans led the project, chose the evaluation and reviewed the top-level statements; the release does not establish task-only autonomy.

Importance Notable

A new open protocol and implementation make cryptographic checking of a full-size mixture-of-experts model substantially more practical in the reported setting. The result concerns proof generation for a specified computation; it does not certify the truth of a model’s answers.

Technical verification Partial

The authors report Lean proofs of protocol security and a sound executable Lean verifier, plus implementation tests and benchmarks. Those checks cover a narrower formal protocol: batched zero knowledge and equivalence of the fast C++ verifier and GPU prover to that protocol remain unproved. The complete implemented performance and security claim therefore has Partial verification.

Formal checking

The authors report Lean proofs of protocol security and a sound executable Lean verifier, plus implementation tests and benchmarks. Those checks cover a narrower formal protocol: batched zero knowledge and equivalence of the fast C++ verifier and GPU prover to that protocol remain unproved. The complete implemented performance and security claim therefore has Partial verification.

Checker
FlashProve team using Lean 4
Scope
Formal protocol and executable Lean verifier under the stated random-oracle, setup and request conditions
Basis
Reported by the linked checker

Human understanding Few

Few is the default when evidence for a higher level is insufficient. The authors explain the system and its cryptographic building blocks, but say the AI-generated protocol paper has not been reviewed in detail. A named human explanation of the full central protocol is not established, so Few is the evidence default.

Correction and publication history

2026-11-03 · publication

New source-reviewed AI-centered cryptographic inference protocol and benchmark, with partial end−to−endend-to-end checking and explicit formal-model limits.

Read this published revision