Learn
Say a provider sends a reply to a prompt. A proof of inference lets anyone check, without the model's weights, that the reply is what a model committed in advance produces for that prompt.
For policy readers
- 01What a proof showsA proof shows a reply is the committed model's greedy reply to its prompt, not whose model it is or that the reply was served.
- 02How a check worksOne request for every system, a commitment, a proof and a verifier without the weights, six checks drawn one by one, and the fraction behind the headline figure.
- 03Deployments and treatiesProving a reply costs a large multiple of serving it, but checking the proof needs no weights and no trusted chip. Under a treaty, an operator could prove replies sampled from a trusted record.
For prover teams and engineers
- 01How we compareEvery system gets the same request. Those passing the six checks, with a stated security level, are ranked by cost vs serving inside one model.
- 02The statementThe ladder's verifiers check a committed, quantized copy's greedy reply. No row has a proved error bound that covers what it runs.
- 03Proving a forward passThe verifier tests the prover's committed values at random points. Matrix products with the committed weights are the cheap part to prove.
Glossary
108 terms
- Abstraction of the protocol
- Adapter
- AIR
- Any cheating prover
- Architecture
- Attestation
- Bar
- Bound
- Check
- Claim card
- Commit and proving
- Commitment
- Completeness
- Confidentiality
- Computed by our code from recorded numbers
- Conjectured
- Control
- Cost vs serving
- Evidence: our runs only, not rerun by anyone else
- Exact match
- Failed
- Failed (check)
- Fiat-Shamir
- Fidelity
- Fidelity check
- Fidelity figure
- Field
- Formally verified
- FRI
- Generation
- Glyph
- GPU-second
- Greedy decoding
- Halfway point
- Hash query
- Honest and damaged copies
- Harness
- Inference
- Integrity
- KL divergence
- Ladder
- Lean
- Level
- Lookup argument
- Machine-checked
- Merkle tree
- Met, Mostly met, Partly met
- Matched leading tokens
- Missing for Met
- Mixture of experts
- Model check
- Multilinear extension
- Multiple
- Next step
- Not decided
- Not decided (check)
- Not met
- Not stated
- Number format
- Operator
- Our rebuild
- Passed
- Passed (check)
- Pinned commit
- Polynomial commitment
- Position
- Prompt check
- Proof
- Proof of inference
- Proved
- Prover
- Publisher
- The publisher's words
- Q8_0 and Q4_K_M
- Quantization
- Random oracle
- Read as
- Recomputation
- Relying party
- Reply check
- Request
- Residual
- Run check
- Sampled
- Security level
- Serving baseline
- Session
- Slot
- SNARK and STARK
- Soundness
- Soundness error
- Statement
- Steady state
- Shown above
- Sumcheck
- Theorem
- Token
- Tokens per second
- Trust assumptions
- Trusted execution environment
- Trusted setup
- Verification
- Verifier
- Verify without weights check
- Weights
- Whole session
- Witness
- Zero knowledge