Skip to content

Home > Resources > blogs > plonkish-arithmetization

PLONKish Arithmetization

Summary

An overview article on PLONKish arithmetization — the family of constraint systems used by PLONK and its descendants (TurboPLONK, UltraPLONK, Halo2). Explains the role of custom gates, lookup arguments, and copy constraints in expressing computations as polynomial identities.