Sable: A Sumcheck Proof System for Bit-Exact LLM Inference
Sable is an argument system and single-GPU prover that proves a committed, integer-quantized transformer produced a given token sequence from a given prompt bit for bit. It fixes an integer-only function with deterministic rounding, normalization, softmax and sampling, then proves it using batched zerochecks, LogUp-GKR lookups, multilinear commitments, Reed-Solomon codes, BLAKE3 Merkle trees and a mixed-length BaseFold opening. On one NVIDIA RTX PRO 6000 Blackwell GPU, the prover covers all 64 layers of Qwen2.5-32B in 92.5 seconds for 4,096 tokens and 398 seconds for 16,384 tokens, and also covers Qwen3-32B and Qwen3-30B-A3B. The proof costs 41 to 50 times serving time, or 6.4 cents per 4,096-token request at public GPU prices; a verifier checks a proof on one CPU core in 19 to 56 seconds, and the system is not zero-knowledge.
It gives concrete performance and cost data for cryptographic verification of open-weight LLM inference, a useful development for trust and auditability research.
Comments & Questions (0)
No comments yet
Be the first to comment!