Paper 2024/1220
Mova: Nova folding without committing to error terms
Abstract
We present Mova, a folding scheme for R1CS instances that does not require committing to error or cross terms, nor makes use of the sumcheck protocol. We compute concrete costs and provide benchmarks showing that, for reasonable parameter choices, Mova's Prover is about
Note: Updated IACR's abstract and lowered Hypernova's costs
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- Zero-knowledgeSNARKFolding schemeNova
- Contact author(s)
-
nikolaos @ nethermind io
albert @ nethermind io
ignacio @ nethermind io
ilia @ nethermind io - History
- 2024-08-13: last of 7 revisions
- 2024-07-31: received
- See all versions
- Short URL
- https://ia.cr/2024/1220
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1220, author = {Nikolaos Dimitriou and Albert Garreta and Ignacio Manzur and Ilia Vlasov}, title = {Mova: Nova folding without committing to error terms}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/1220}, year = {2024}, url = {https://eprint.iacr.org/2024/1220} }