CryptoDB
SnarkPack: Practical SNARK Aggregation
| Authors: | |
|---|---|
| Download: | |
| Presentation: | Slides |
| Abstract: | Zero-knowledge SNARKs (zk-SNARKs) are non-interactive proof systems with short and efficiently verifiable proofs that do not reveal anything more than the correctness of the statement. zk-SNARKs are widely used in decentralised systems to address privacy and scalability concerns. A major drawback of such proof systems in practice is the requirement to run a trusted setup for the public parameters. Moreover, these parameters set an upper bound to the size of the computations or statement to be proven, which results in new scalability problems. We design and implement SnarkPack, a new argument that further reduces the size of SNARK proofs by means of aggregation. Our goal is to provide an off-the-shelf solution that is practical in the following sense: (1) it is compatible with existing deployed SNARK systems, (2) it does not require any extra trusted setup. SnarkPack is designed to work with Groth16 scheme and has logarithmic size proofs and a verifier that runs in logarithmic time in the number of proofs to be aggregated. Most importantly, SnarkPack reuses the public parameters from Groth16 system. SnarkPack can aggregate 8192 proofs in 8.7s and verify them in 163ms, yielding a verification mechanism that is exponentially faster than batching and previous solutions in the field. SnarkPack can be deployed in blockchain applications that rely on many SNARK proofs such as Proof-of-Space or roll-up solutions. |
BibTeX
@misc{rwc-2022-35510,
title={SnarkPack: Practical SNARK Aggregation},
note={Presentation at \url{https://iacr.org/submit/files/slides/2022/rwc/rwc2022/1/slides.pdf}},
howpublished={Talk given at RWC 2022},
author={Anca Nitulescu and Nicolas Gailly and Mary Maller},
year=2022
}