An incomplete guide to Folding: Nova, Sangria, SuperNova, HyperN… — Taiko Labs
In this article, we explore the folding scheme technique that can be applied to achieve a more efficient approach to the IVC when verifying a single proof verifies the entire computation chain.
Special thanks to arnaucube **,* Brecht Devos , Barak, Benedikt Bünz , Binyi Chen , and Ben Wan for review.* TL;DR The goal, the whole zk industry is working on, – is to (i) decrease the proof generation cost as much as possible while (ii) preserving proof as small as possible and (iii) verification as efficient as possible. It’s possible through prover optimisation or, as an alternative, one can compress the data the prover proves. Huge work was done on folding scheme techniques within the last several years by the zk scientific community. In this article, we explore the folding scheme techni
Explore this link on the map →related reading
- Towards a Nova-based ZK VM - General - zk researchzkresear.ch
- 17 misconceptions about SNARKs - a16z cryptoa16zcrypto.com
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Explaining Halo 2 - Electric Coin Companyelectriccoin.co
- Zero Knowledge Canon, part 1 & 2 - a16z cryptoa16zcrypto.com
- Putting the zk in zkVM: Jolt now supports zero knowledge - a16z cryptoa16zcrypto.com
- Halo and more: exploring incremental verification and SNARKs without pairingsvitalik.eth.limo
- ZK-Friendly Hash Functions | Zellic — Researchzellic.io
- Binius: highly efficient proofs over binary fieldsvitalik.eth.limo
- Hardware Acceleration for Zero Knowledge Proofs - Paradigmparadigm.xyz
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- ZKML @ Team Novi - HackMDhackmd.io