Zero-knowledge proof composition and recursion. Part 2: Sangria

In this new series of video, following the series of videos on PLONK ( https://www.youtube.com/watch?v=RUZcam_jrz0) I introduce the different ideas and schemes behind proof composition and proof recursion. In this series of videos we will go through pre-proof recursion schemes like Sangria and Nova, and IVC/PCD schemes following the BCTV14 paper, and later the Halo paper. This second video is an intro to Sangria (https://geometry.xyz/notebook/sangria-a-folding-scheme-for-plonk), a folding scheme for Plonk. It is an adaptation for plonk of a folding scheme introduced in Nova (which I will cover in the next video). Sangria will allow us to perform pre-proof recursion, which avoids the overhead of normal recursion or proof composition. Timestamps 00:00 What's "pre-proof"? 02:44 The preprocessing SNARK architecture 06:42 A folding scheme for Plonk 12:28 How the Plonk equation is affected 16:06 A relaxed Plonk equation 21:10 Recap and Outro