Zero-knowledge proof composition and recursion. Part 3: Nova

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 third video explains how the Nova scheme (https://eprint.iacr.org/2021/370) turns a folding scheme into a pre-proof recursion (or IVC for Incrementally Verifiable Computation) scheme, allowing us to recurse without the overhead of creating proofs, and creating proofs at different point in time when we deem it necessary. Timestamps 00:00 Recap 00:48 The Nova circuit 04:13 The trick that leads to recursion 07:17 Hints as to what's being left out 08:40 Recap