flâneur

An incomplete guide to Folding: Nova, Sangria, SuperNova, HyperN… — Taiko Labs

taiko.mirror.xyz · 6,922 words · saved by 1 readers

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

related reading