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. ...

March 10, 2026 · 16 min · Theme PaperMod

Understanding PLONK (Part 2): Lagrange-basis

Introduction In the previous article, we mentioned that to implement the protocol verification process, the Prover initially encodes each column of the $W$ table using polynomial coding and sends the encoded results to the Verifier for verification. Through further interaction, we can verify whether the equation $$ q_{L}(X) \cdot w_{a}(X) + q_{R}(X) \cdot w_{b}(X) + q_{M}(X)\cdot(w_{a}(X)\cdot w_{b}(X)) + q_{C}(X) - q_{O}(X)\cdot w_{c}(X) \overset{?}{=} 0 $$ holds. This verifies the correctness of a circuit only when the Prover is honest. However, the Prover might misbehave. To prevent this and ensure the circuit’s correctness and security while satisfying constraints, we need to verify the relationship between $(\sigma_a(X),\sigma_b(X),\sigma_c(X))$ and $(w_a(X),w_b(X),w_c(X))$. ...

March 10, 2026 · 20 min · Theme PaperMod

Understanding PLONK (Part 3): Permutation Argument

Plonkish circuit encoding uses two matrices, $(Q, \sigma)$, to describe the circuit’s scaffold, where $Q$ represents the operation selectors and $\sigma$ represents permutation constraints. These constraints enforce that certain positions in the $W$ matrix must hold identical values. This article focuses on explaining the principles of the permutation argument. Reviewing Copy Constraints The permutation $\sigma$ represents the relationship between positions before and after rearrangement. But what does $\sigma$ actually look like? ...

March 10, 2026 · 22 min · Theme PaperMod

Understanding PLONK (Part 4): Arithmetic Constraints and Copy Constraints

Recap of Permutation Argument In the previous section, we discussed how the Prover proves that two vectors $\vec{a}$ and $\vec{b}$ of length $n$ satisfy a pre-defined (public) permutation relationship $\sigma(\cdot)$, i.e., $$ a_i = b_{\sigma(i)}. $$ The basic idea involves requesting a random challenge $\beta$ from the Verifier, combining the “original vectors” ($\vec{a}$ and $\vec{b}$) with their “position vectors” ($\vec{i}$ and $\sigma$), and generating two new vectors, denoted as $\vec{a}’$ and $\vec{b}’$: ...

March 10, 2026 · 14 min · Theme PaperMod