ZK-Evolution and Recursive SNARKs
Recursive SNARKs have emerged as crucial technology for blockchain scalability and security. But how exactly do they work, why have they become so important, and what is the "ZK-evolution"?
In this Cyber Academy episode, Alexandr Vlasov (Matter Labs) walks us through the history, current state, and future of recursive SNARKs, as well as the approaches leading blockchain teams are using to build their ZK solutions.
- 🔹 What are SNARKs and recursive SNARKs, and why are they essential for blockchains?
- 🔹 History and evolution of recursive SNARKs, from early constructions to modern implementations.
- 🔹 Comparison of recursion approaches: elliptic curves, cycle curves, and proof aggregation.
- 🔹 Pros and cons of various SNARK constructions: Groth16, PLONK, STARK, and more.
- 🔹 What are polynomial commitments, and what methods are used for implementing ZK-systems?
- 🔹 Practical applications of recursive SNARKs in zkSync,Mina Protocol, Zcash, and other projects.
Tags
