What is Arithmetization (R1CS, PLONKish, AIR)? Definition and why it matters
============================================================================

The encoding of a computation as polynomial constraints over a finite field: rank-1 constraint systems (Groth16, gnark), PLONKish gates with copy and lookup constraints (Halo2), or algebraic intermediate representations over execution traces (STARKs, Plonky3, SP1).

Detail: Verification frameworks are tied to arithmetizations: Picus and Ecne to R1CS, Halva to PLONKish, Clean primarily to AIR with PLONK and R1CS support, StarkWare's proofs to the Cairo AIR. Check the framework page for the exact model before assuming coverage.

Source page: https://sorryfree.com/glossary/arithmetization/
Compiled by: sorryfree editors (https://sorryfree.com/about/)
Last reviewed: 2026-09-13