### aPlonK : Aggregated PlonK from Multi-Polynomial Commitment Schemes

##### Abstract

PlonK is a prominent universal and updatable zk-SNARK for general circuit satisfiability. We present aPlonK, a variant of PlonK that reduces the proof size and verification time when multiple statements are proven in a batch. Both the aggregated proof size and the verification complexity of aPlonK are logarithmic in the number of aggregated statements. Our main building block, inspired by the techniques developed in SnarkPack (Gailly, Maller, Nitulescu, FC 2022), is a multi-polynomial commitment scheme, a new primitive that generalizes polynomial commitment schemes. Our techniques also include a mechanism for involving committed data into PlonK statements very efficiently, which can be of independent interest. We also implement an open-source industrial-grade library for zero-knowledge PlonK proofs with support for aPlonK. Our experimental results show that our techniques are suitable for real-world applications (such as blockchain rollups), achieving significant performance improvements in proof size and verification time.

Available format(s)
Category
Cryptographic protocols
Publication info
Preprint.
Keywords
zero-knowledge proofs PlonK proof aggregation polynomial commitments
Contact author(s)
mac ambrona @ gmail com
raphael r toledo @ gmail com
History
2022-11-10: revised
See all versions
Short URL
https://ia.cr/2022/1352

CC BY

BibTeX

@misc{cryptoeprint:2022/1352,
author = {Miguel Ambrona and Marc Beunardeau and Anne-Laure Schmitt and Raphaël R. Toledo},
title = {aPlonK : Aggregated PlonK from Multi-Polynomial Commitment Schemes},
howpublished = {Cryptology ePrint Archive, Paper 2022/1352},
year = {2022},
note = {\url{https://eprint.iacr.org/2022/1352}},
url = {https://eprint.iacr.org/2022/1352}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.