Scribe: Low-memory SNARKs via Read-Write Streaming
Anubhav Baweja, Pratyush Mishra, Tushar Mopuri, Karan Newatia, Steve Wang
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper3
- 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 等OSDI 2026
- DeepProve: Verifiable End-to-End Large Language Model InferenceNicolas Gailly, Ismael Hishon-Rezaizadeh, Tianyi Liu, Nicholas Mainardi 等CCS 2026
它引用的顶会 Paper21
- Bulletproofs: Short Proofs for Confidential Transactions and MoreBenedikt Bünz, Jonathan Bootle, Dan Boneh, Andrew Poelstra 等S&P 2018 · 被引用 1,285 次
- Doubly-Efficient zkSNARKs Without Trusted SetupRiad S. Wahby, Ioanna Tzialla, Abhi Shelat, Justin Thaler 等S&P 2018 · 被引用 356 次
- Marlin: Preprocessing zkSNARKs with Universal and Updatable SRSAlessandro Chiesa, Yuncong Hu, Mary Maller, Pratyush Mishra 等EUROCRYPT 2020 · 被引用 356 次
- Spartan: Efficient and General-Purpose zkSNARKs Without Trusted SetupSrinath T. V. SettyCRYPTO 2020 · 被引用 262 次
- Transparent SNARKs from DARK CompilersBenedikt Bünz, Ben Fisch, Alan SzepieniecEUROCRYPT 2020 · 被引用 240 次
相关 Paper
- On Succinct Non-interactive Arguments in Relativized WorldsMegan Chen, Alessandro Chiesa, Nicholas SpoonerEUROCRYPT 2022 · 被引用 14 次
- Hekaton: Horizontally-Scalable zkSNARKs Via Proof AggregationMichael Rosenberg, Tushar Mopuri, Hossein Hafezi, Ian Miers 等CCS 2024 · 被引用 7 次
- Cirrus: Performant and Accountable Distributed SNARKWenhao Wang, Fangyan Shi, Dani Vilardell, Fan ZhangNDSS 2026 · 被引用 11 次
- zkSaaS: Zero-Knowledge SNARKs as a ServiceSanjam Garg, Aarushi Goel, Abhishek Jain, Guru-Vamsi Policharla 等USENIX Security 2023
- Sparrow: Space-Efficient zkSNARK for Data-Parallel Circuits and Applications to Zero-Knowledge Decision TreesChristodoulos Pappas, Dimitrios PapadopoulosCCS 2024 · 被引用 4 次
