How does PLONK work? Part 10: The Kate polynomial commitment scheme
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 and learned in the past few months. 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 tenth video, I explain how the Kate polynomial commitment scheme works. For more information about it, check this [other blogpost I wrote](https://cryptologie.net/article/525/p.... This polynomial commitment scheme will be useful to force the prover to commit to its polynomials before learning the random point they need to be evaluated at.