How does PLONK work? Part 2: An overview
I recently got into general-purpose zero-knowledge proof systems (cryptographic primitives that allow you to prove the execution of a program without revealing some of the inputs), specifically the state-of-the-art PLONK proof system. This is a series of video I made to explain what I understood. There might be some inaccuracies, so I apologize in advance for that. You can check all the videos via the playlist here: • How does PLONK work? Part 1: What's PLONK?
In this second video, I give some intuition on how to think about zero-knowledge proof systems, with the example of proving the solution of a sudoku, then I give an overview of what I'll explain in this series of video.