Paper 2024/1281
Stackproofs: Private proofs of stack and contract execution using Protogalaxy
Abstract
The goal of this note is to describe and analyze a simplified variant of the zk-SNARK construction used in the Aztec protocol. Taking inspiration from the popular notion of Incrementally Verifiable Computation[Val09] (IVC) we define a related notion of $\textrm{Repeated Computation with Global state}$ (RCG). As opposed to IVC, in RCG we assume the computation terminates before proving starts, and in addition to the local transitions some global consistency checks of the whole computation are allowed. However, we require the space efficiency of the prover to be close to that of an IVC prover not required to prove this global consistency. We show how RCG is useful for designing a proof system for a private smart contract system like Aztec.
Metadata
- Available format(s)
-
PDF
- Publication info
- Preprint.
- Keywords
- zk-SNARKsfolding schemesIncrementally Verfiable Computation
- Contact author(s)
- ariel gabizon @ gmail com
- History
- 2024-08-29: last of 3 revisions
- 2024-08-14: received
- See all versions
- Short URL
- https://ia.cr/2024/1281
- License
-
CC0
BibTeX
@misc{cryptoeprint:2024/1281, author = {Liam Eagen and Ariel Gabizon and Marek Sefranek and Patrick Towa and Zachary J. Williamson}, title = {Stackproofs: Private proofs of stack and contract execution using Protogalaxy}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/1281}, year = {2024}, url = {https://eprint.iacr.org/2024/1281} }