Enum CircuitExpression

pub enum CircuitExpression<II: InputIndicator> {
    BConst(BFieldElement),
    XConst(XFieldElement),
    Input(II),
    Challenge(usize),
    BinOp(BinOp, Rc<RefCell<ConstraintCircuit<II>>>, Rc<RefCell<ConstraintCircuit<II>>>),
}

A circuit expression is the recursive data structure that represents the constraint circuit. It is a directed, acyclic graph of binary operations on a) the variables corresponding to columns in the AET, b) constants, and c) challenges. It has multiple roots, making it a “multitree.” Each root corresponds to one constraint.

The leafs of the tree are

• constants in the base field, i.e., BFieldElements,
• constants in the extension field, i.e., XFieldElements,
• input variables, i.e., entries from the Algebraic Execution Trace, main or aux, and
• challenges, i.e., (pseudo-)random values sampled through the Fiat-Shamir heuristic.

An internal node, representing some binary operation, is either addition or multiplication. The left and right children of the node are the operands of the binary operation. The left and right children are not themselves CircuitExpressions, but rather ConstraintCircuits, which is a wrapper around CircuitExpression that manages additional bookkeeping information.

Variants

BConst(BFieldElement)

XConst(XFieldElement)

Input(II)

Challenge(usize)

BinOp(BinOp, Rc<RefCell<ConstraintCircuit<II>>>, Rc<RefCell<ConstraintCircuit<II>>>)

Trait Implementations

impl<II: Clone + InputIndicator> Clone for CircuitExpression<II>

fn clone(&self) -> CircuitExpression<II>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<II: Debug + InputIndicator> Debug for CircuitExpression<II>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<II: InputIndicator> Hash for CircuitExpression<II>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<II: InputIndicator> PartialEq for CircuitExpression<II>

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.