Zero Knowledge Proofs

Zero Knowledge Proofs Blog where I write about several usefull tools in the ZKP world. I try to provide a different view on the topic, where I explain mostly the reasoning behind each polynomial or the intuition behind each protocol. This track will provide a good undestanding of the Plonk GNARK, starting from the construction of bilinear pairings, to many Plonk variations and optimizations that have been proposed in the last years.

1 Bilinear Pairings Made Simple

A short and clear explanation of bilinear pairings, some use cases and a more in-depth example with Weil pairing.

2 KZG Polynomial Commitment, the Building Block of Zero Knowledge Proofs

Quick explanation of KZG polynomial commitment, which I will later use in another blog to build the first zk-SNARK, PLONK.

3 PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge

Read the blog if you wanna find out why it has such a long name.

4 PIANIST: Plonk vIA uNlimited dISTribution

We now know that Plonk is a good IOP, but could we do better? In this post we will see how to scale Plonk by unlimited distribution.

Fun Cryptographic Conundrums

In this section you can find several blog posts about non related crypto topics. Whenever I solve an interesting problem or find a paper talking about a funny problem, I'll write about it here. This section is less math heavy than the others and may appeal to a wider audience.

1 Yao's Millionaire's discrete problem

Alternative solution to Yao's Millionaire's problem discrete finite version I came up with while learning about oblivious transfer protocols

2 Ball sorting game with ZKP

A ZKP physical protocol to prove knowledge of the solution to a ball sorting puzzle in t steps using playing cards.