Zero-knowledge proof composition and recursion. Part 4: Verifier circuits
In this new series of video, following the series of videos on PLONK ( • How does PLONK work? Part 1: What's PLONK? ) 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 fourth video introduces the simple and beautiful idea behind proof composition: verifier circuits. Verifier circuits are simply implementations of a proof verifier inside of a circuit. This way a circuit can verify another proof!
Timestamps
00:00 Recap
00:33 A verifier circuit
03:01 Application logic
04:45 Outro