Constraint Circuit

This crate is part of the Triton VM ecosystem. It contains logic that helps building efficient AIR constraints, which are part of the STARK proving system.

lib.rs:

Constraint circuits are a way to represent constraint polynomials in a way that is amenable to optimizations. The constraint circuit is a directed acyclic graph (DAG) of CircuitExpressions, where each CircuitExpression is a node in the graph. The edges of the graph are labeled with BinOps. The leafs of the graph are the inputs to the constraint polynomial, and the (multiple) roots of the graph are the outputs of all the constraint polynomials, with each root corresponding to a different constraint polynomial. Because the graph has multiple roots, it is called a “multitree.”