Zero-knowledge proof composition and recursion. Part 7: Deferred values
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 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
Nesta página do site você pode assistir ao vídeo on-line Zero-knowledge proof composition and recursion. Part 7: Deferred values duração hora minuto segundo em boa qualidade , que foi baixado pelo usuário David Wong 28 Fevereiro 2023, compartilhe o link com seus amigos e conhecidos, no youtube este vídeo já foi visto 323 vezes e gostou 6 espectadores. Boa visualização!
