Paper 2026/1112

DeepProve: Verifiable End-to-End Large Language Model Inference

Nicolas Gailly, Lagrange Labs
Ismael Hishon-Rezaizadeh, Lagrange Labs
Tianyi Liu, University of Illinois Urbana-Champaign
Nicholas Mainardi, Lagrange Labs
Dimitrios Papadopoulos, Hong Kong University of Science and Technology
Charalampos Papamanthou, Yale University, Lagrange Labs
Christodoulos Pappas, Hong Kong University of Science and Technology
Shravan Srinivasan, Lagrnage Labs
Zack Youell, Lagrange Labs
Yupeng Zhang, University of Illinois Urbana-Champaign
Abstract

Large Language Models (LLMs) are frontier deep learning systems that have achieved remarkable success across a wide range of AI services. However, their substantial computational and memory requirements make them difficult to deploy and run on local hardware. Due to these resource requirements, users often rely on untrusted cloud infrastructure providers to perform model inference. However, outsourcing introduces the challenge of verifying that the returned output is the genuine result of the specified model. In this work, we present DeepProve, the first system to enable efficient end-to-end verification of full LLM inference (i.e., for all generated tokens of a prompt) on untrusted cloud servers using zero-knowledge proofs (ZKPs). In contrast, prior work either provides only a proof-of-concept partial implementation for a single token (zkGPT, USENIX'25), or focuses exclusively on specific components of the inference pipeline, such as Softmax (zkLLM, CCS'24). DeepProve achieves end-to-end verification by certifying the correctness of the output sequence rather than encoding the expensive inference computation in-circuit, an approach that would require either circuit size quadratic in the sequence length or costly in-circuit modelling of RAM operations. The core building blocks of DeepProve are sum-check protocol and lookup arguments, which enable efficient proof of correctness of all operators needed for GPT-2 and Gemma 3, such as multi-head attention and layer normalization for GPT-2, and grouped-query attention, root mean square normalization, and rotary positional embeddings for Gemma 3. Our evaluation shows that DeepProve can prove inference of GPT-2 and Gemma 3 at approximately 174 and 86 tokens per minute, respectively, which is 20-60 faster than the state of the art, without any significant loss in accuracy. Verification takes only 1 to 3.7 seconds. By distributing proof computation across multiple nodes, DeepProve can further improve the prover time while reducing the memory requirements for individual machines. With distributed proving, DeepProve can scale the throughput to 1855 tokens per minute. Our work represents the first full system for end-to-end LLM inference verification, thus paving the way for secure and trustworthy AI services.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Minor revision. CCS 2026
Keywords
sumcheckLLM inferencezk-SNARKsverifiable computation
Contact author(s)
nicolas @ lagrange dev
ismael @ lagrange dev
mainardinicholas @ gmail com
dipapado @ cse ust hk
charalampos papamanthou @ yale edu
cpappas @ connect ust hk
shravansrinivasan1 @ gmail com
History
2026-06-02: approved
2026-05-30: received
See all versions
Short URL
https://ia.cr/2026/1112
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2026/1112,
      author = {Nicolas Gailly and Ismael Hishon-Rezaizadeh and Tianyi Liu and Nicholas Mainardi and Dimitrios Papadopoulos and Charalampos Papamanthou and Christodoulos Pappas and Shravan Srinivasan and Zack Youell and Yupeng Zhang},
      title = {{DeepProve}: Verifiable End-to-End Large Language Model Inference},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/1112},
      year = {2026},
      url = {https://eprint.iacr.org/2026/1112}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.