Arithmetic Circuit

A directed acyclic graph of addition and multiplication gates representing a computation over a finite field. Used as the intermediate representation for compiling programs into zero-knowledge proofs. The circuit maps inputs to outputs through a series of field operations, with circuit size (number of gates) determining proof generation cost.