What happened in ‘folding’ scheme since 2022?

1. Snark recursion is replaced with ‘folding’ 2022 (KST22) for more efficient IVC.
2. Can use Plonkish, CSS, Air, not just R1CS. 
3. Smaller verifier circuit for more efficient recursion. 
4. Multifolding, / parallel folding.
5. Non uniform circuit IVC.
6. Can use smaller fields with Lattice or Hashes (post quantum secure).
7. Efficient on-chain verification. (MicroNova)
8. Specialized folding scheme for various scenario
…. 

The story of incremental verifiable computation (IVC) from 2008 (Valiant) to 2025~ 🤯

What happened since Nova in 2022?

Well, a lot! Sangria, KiloNova, HyperNova, ProtoStar, Mova, ProtoGalaxy, LatticeFold...

Kudos to the researchers! @abhiramko @srinathtv @ITzialla @nico_mnbl @benediktbuenz @Charles_Chen533 @0xAlbertG @danboneh @liameagen @rel_zeta_tech &amp; more https://t.co/5oG1jpxayY

What happened in ‘folding’ scheme since 2022?

1. Snark recursion is replaced with ‘folding’ 2022 (KST22) for more efficient IVC.
2. Can use Plonkish, CSS, Air, not just R1CS. 
3. Smaller verifier circuit for more efficient recursion. 
4. Multifolding, / parallel folding.
5. Non…

Wyatt Benno

What happened in ‘folding’ scheme since 2022?

1. Snark recursion is replaced with ‘folding’ 2022 (KST22) for more efficient IVC.
2. Can use Plonkish, CSS, Air, not just R1CS. 
3. Smaller verifier circuit for more efficient recursion. 
4. Multifolding, / parallel folding.
5. Non uniform circuit IVC.
6. Can use smaller fields with Lattice or Hashes (post quantum secure).
7. Efficient on-chain verification. (MicroNova)
8. Specialized folding scheme for various scenario
…. 

The story of incremental verifiable computation (IVC) from 2008 (Valiant) to 2025~ 🤯

https://x.com/wyatt_benno/status/1881329005229486449?s=46&t=TPz4beAkRLUXoHXHetMIxA