Understanding PLONK (Part 1): Plonkish Arithmetization
Introduction Arithmetization refers to the process of converting computations into mathematical objects and then proving them using zero-knowledge proofs. Plonkish Arithmetization is a unique arithmetization method specific to the Plonk proof system. Before the advent of Plonkish, the dominant circuit representation was R1CS, which was widely adopted by systems like Pinocchio, Groth16, and Bulletproofs. In 2019, the Plonk scheme introduced a seemingly retro style of circuit encoding. However, since Plonk pushed polynomial encoding to its limits, it is no longer confined to arithmetic circuits with just “addition gates” and “multiplication gates”; it can also support more flexible custom gates and lookup gates. ...