Zero-knowledge proof composition and recursion. Part 7: Deferred values

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 video will talk about a specific trick used in proof composition when implemented on cycles of curves: deferred computations or values. When computation cannot efficiently be computed straight away in a circuit, they can be deferred to the next circuit. Timestamps: 00:00 Intro & Recap 00:45 Other field arithmetic 01:50 Hints 03:27 Public input as message authentication 04:58 Deferred until the next verifier circuit