USENIX Security2026Top-tier venue
Scribe: Low-memory SNARKs via Read-Write Streaming
Anubhav Baweja, Pratyush Mishra, Tushar Mopuri, Karan Newatia, Steve Wang
Abstract
Succinct non-interactive arguments of knowledge (SNARKs) enable a prover to produce a short and efficiently verifiable proof of the validity of an arbitrary NP statement. Recent constructions of efficient SNARKs have led to interest in using them for a wide range of applications, but unfortunately, deployment of SNARKs in these applications faces a key bottleneck: SNARK provers require a prohibitive amount of time and memory to generate proofs for even moderately large statements. While there has been progress in reducing prover time, prover memory remains an issue. In this work, we describe Scribe, a new low-memory SNARK that can efficiently prove large statements even on cheap consumer devices such as smartphones by leveraging a plentiful, but heretofore unutilized, resource: disk storage. Instead of storing its (large) intermediate state in RAM, Scribe's prover instead stores it on disk. To ensure that accesses to state are efficient, we design Scribe's prover in a read-write streaming model of computation that allows the prover to read and modify its state only in a streaming manner. We implement and evaluate Scribe's prover, and show that, on commodity hardware, it can easily scale to circuits with 2 28 gates while using less than 750MB of memory and incurring only minimal proving latency overhead (10%) compared to a state-of-the-art memory-intensive baseline (HyperPlonk [EUROCRYPT 2023]) that requires much more memory.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 827b335b-5270-43c2-9abd-aaa82efc4c73Cited by top-tier papers3
- Hobbit: Space-Efficient zkSNARK with Optimal Prover TimeChristodoulos Pappas, Dimitrios PapadopoulosUSENIX Security 2025
- Spain: Succinct Proofs for Numerical ComputationsZachary DeStefano, Noah Golub, Zile Huang, Julius Zhang et al.OSDI 2026
- DeepProve: Verifiable End-to-End Large Language Model InferenceNicolas Gailly, Ismael Hishon-Rezaizadeh, Tianyi Liu, Nicholas Mainardi et al.CCS 2026
Builds on21
- Bulletproofs: Short Proofs for Confidential Transactions and MoreBenedikt Bünz, Jonathan Bootle, Dan Boneh, Andrew Poelstra et al.S&P 2018 · 1,285 citations
- Doubly-Efficient zkSNARKs Without Trusted SetupRiad S. Wahby, Ioanna Tzialla, Abhi Shelat, Justin Thaler et al.S&P 2018 · 356 citations
- Marlin: Preprocessing zkSNARKs with Universal and Updatable SRSAlessandro Chiesa, Yuncong Hu, Mary Maller, Pratyush Mishra et al.EUROCRYPT 2020 · 356 citations
- Spartan: Efficient and General-Purpose zkSNARKs Without Trusted SetupSrinath T. V. SettyCRYPTO 2020 · 262 citations
- Transparent SNARKs from DARK CompilersBenedikt Bünz, Ben Fisch, Alan SzepieniecEUROCRYPT 2020 · 240 citations
Related papers
- On Succinct Non-interactive Arguments in Relativized WorldsMegan Chen, Alessandro Chiesa, Nicholas SpoonerEUROCRYPT 2022 · 14 citations
- Hekaton: Horizontally-Scalable zkSNARKs Via Proof AggregationMichael Rosenberg, Tushar Mopuri, Hossein Hafezi, Ian Miers et al.CCS 2024 · 7 citations
- Cirrus: Performant and Accountable Distributed SNARKWenhao Wang, Fangyan Shi, Dani Vilardell, Fan ZhangNDSS 2026 · 11 citations
- zkSaaS: Zero-Knowledge SNARKs as a ServiceSanjam Garg, Aarushi Goel, Abhishek Jain, Guru-Vamsi Policharla et al.USENIX Security 2023
- Sparrow: Space-Efficient zkSNARK for Data-Parallel Circuits and Applications to Zero-Knowledge Decision TreesChristodoulos Pappas, Dimitrios PapadopoulosCCS 2024 · 4 citations
