Paper 2023/1106 Original: eprint.iacr.org/2023/1106 ↗
ProtoGalaxy: Efficient ProtoStar-style folding of multiple instances
Abstract
We continue the recent line of work on folding schemes. Building on ideas from ProtoStar [BC23] we construct a folding scheme where the recursive verifier's ``marginal work'', beyond linearly combining witness commitments, consists only of a logarithmic number of field operations and a constant number of hashes. Moreover, our folding scheme performs well when \emph{folding multiple instances at one step}, in which case the marginal number of verifier field operations per instance becomes constant, assuming constant degree gates.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2024-01-30: last updated
- 2023-07-15: published
- Short URL
- https://ia.cr/2023/1106
- License
- https://creativecommons.org/publicdomain/zero/1.0/
BibTeX
@misc{cryptoeprint:2023/1106,
author = {Liam Eagen and Ariel Gabizon},
title = {ProtoGalaxy: Efficient ProtoStar-style folding of multiple instances},
howpublished = {Cryptology {ePrint} Archive, Paper 2023/1106},
year = {2023},
url = {https://eprint.iacr.org/2023/1106}
}