2000 character limit reached
Folding Custom Gates with Verifier Input (2401.11364v1)
Published 21 Jan 2024 in cs.CR and cs.LO
Abstract: In the context of interactive proofs, a "folding scheme" (popularized by Nova) is a way to combine multiple instances of a constraint system into a single instance, so the validity of the multiple instances can statistically be reduced to the validity of a single one. We show how Nova folding can be generalized to ``custom'' gates and extra rounds of verifier randomness. As an application of this extension, we present Origami, the first (to our knowledge) known example of a folding scheme for lookups.
- Aztec. From AIRs to RAPs - how PLONK-style arithmetization works.
- Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences, 1987.
- Protostar: Generic efficient accumulation/folding for special sound protocols. Cryptology ePrint Archive, Paper 2023/620, 2023. https://eprint.iacr.org/2023/620.
- plookup: A simplified polynomial protocol for lookup tables. Cryptology ePrint Archive, Paper 2020/315, 2020. https://eprint.iacr.org/2020/315.
- Tight state-restoration soundness in the algebraic group model. Cryptology ePrint Archive, Paper 2020/1351, 2020. https://eprint.iacr.org/2020/1351.
- Halo2. The Halo 2 book. https://zcash.github.io/halo2/index.html.
- Constant-size commitments to polynomials and their applications. In Masayuki Abe, editor, Advances in Cryptology - ASIACRYPT 2010, pages 177–194, Berlin, Heidelberg, 2010. Springer Berlin Heidelberg.
- Nova: Recursive zero-knowledge arguments from folding schemes. Cryptology ePrint Archive, Paper 2021/370, 2021. https://eprint.iacr.org/2021/370.
- Nicolas Mohnblatt. Sangria: a folding scheme for plonk.
- Lev Soukhanov. Folding endgame. https://zkresear.ch/t/folding-endgame/106.
- Folding for arbitrary polynomial custom gates and lookups. https://hackmd.io/@aardvark/Hk5UtwDl2.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.