Struct Halo2IRBuilder 

pub struct Halo2IRBuilder {
    pub nodes: Vec<Halo2GraphNode>,
    pub node_meta: Vec<NodeMeta>,
    pub input_values: Vec<Fr>,
    /* private fields */
}

Backend that records the circuit-population trace as a graph IR.

Fields

nodes: Vec<Halo2GraphNode>

Nodes, in tape-emission order.

node_meta: Vec<NodeMeta>

Replay metadata per node, indexed by NodeId.

input_values: Vec<Fr>

Proof-input witnesses, one per LoadWitness node, in emission order.

Implementations

impl Halo2IRBuilder

pub fn new(lookup_bits: usize) -> Self

pub fn total_ctx_len(&self) -> usize

Total number of context-tape (advice) cells written by all nodes.

pub fn total_lookups_len(&self) -> usize

Total number of range-tape (lookup) cells written by all nodes.

pub fn lookup_bits(&self) -> usize

Range-check lookup bits the IR was built for.

Trait Implementations

impl BabyBearExt4Inst for Halo2IRBuilder

fn ext_load_constant( &mut self, value: BabyBearExt4, ) -> BabyBearExt4Wire<GraphCell>

fn ext_load_reduced_constant( &mut self, value: BabyBearExt4, ) -> ReducedBabyBearExt4Wire<GraphCell>

fn ext_add( &mut self, a: BabyBearExt4Wire<GraphCell>, b: BabyBearExt4Wire<GraphCell>, ) -> BabyBearExt4Wire<GraphCell>

fn ext_neg( &mut self, a: BabyBearExt4Wire<GraphCell>, ) -> BabyBearExt4Wire<GraphCell>

fn ext_sub( &mut self, a: BabyBearExt4Wire<GraphCell>, b: BabyBearExt4Wire<GraphCell>, ) -> BabyBearExt4Wire<GraphCell>

fn ext_scalar_mul( &mut self, a: BabyBearExt4Wire<GraphCell>, b: BabyBearWire<GraphCell>, ) -> BabyBearExt4Wire<GraphCell>

fn ext_scalar_mul_add( &mut self, a: BabyBearExt4Wire<GraphCell>, b: BabyBearWire<GraphCell>, c: BabyBearExt4Wire<GraphCell>, ) -> BabyBearExt4Wire<GraphCell>

a * b + c where b is a base-field scalar.

fn ext_assert_zero(&mut self, a: BabyBearExt4Wire<GraphCell>)

fn ext_assert_equal( &mut self, a: BabyBearExt4Wire<GraphCell>, b: BabyBearExt4Wire<GraphCell>, )

fn ext_mul( &mut self, a: BabyBearExt4Wire<GraphCell>, b: BabyBearExt4Wire<GraphCell>, ) -> BabyBearExt4Wire<GraphCell>

fn ext_div( &mut self, a: BabyBearExt4Wire<GraphCell>, b: BabyBearExt4Wire<GraphCell>, ) -> BabyBearExt4Wire<GraphCell>

fn ext_reduce_max_bits( &mut self, a: BabyBearExt4Wire<GraphCell>, ) -> BabyBearExt4Wire<GraphCell>

fn ext_zero(&mut self) -> BabyBearExt4Wire<GraphCell>

fn ext_from_base_const( &mut self, value: BabyBear, ) -> BabyBearExt4Wire<GraphCell>

fn ext_from_base_var( &mut self, value: BabyBearWire<GraphCell>, ) -> BabyBearExt4Wire<GraphCell>

fn ext_mul_base_const( &mut self, a: BabyBearExt4Wire<GraphCell>, c: BabyBear, ) -> BabyBearExt4Wire<GraphCell>

fn ext_square( &mut self, a: BabyBearExt4Wire<GraphCell>, ) -> BabyBearExt4Wire<GraphCell>

fn ext_pow_power_of_two( &mut self, a: BabyBearExt4Wire<GraphCell>, n: usize, ) -> BabyBearExt4Wire<GraphCell>

a^(2^n)

impl BabyBearInst for Halo2IRBuilder

fn bb_load_constant(&mut self, value: BabyBear) -> BabyBearWire<GraphCell>

Mirrors BabyBearChip::load_constant (const cache + load_zero for zero).

fn bb_load_reduced_constant( &mut self, value: BabyBear, ) -> ReducedBabyBearWire<GraphCell>

fn bb_reduce(&mut self, a: BabyBearWire<GraphCell>) -> BabyBearWire<GraphCell>

fn bb_reduce_max_bits( &mut self, a: BabyBearWire<GraphCell>, ) -> BabyBearWire<GraphCell>

fn bb_add( &mut self, a: BabyBearWire<GraphCell>, b: BabyBearWire<GraphCell>, ) -> BabyBearWire<GraphCell>

fn bb_neg(&mut self, a: BabyBearWire<GraphCell>) -> BabyBearWire<GraphCell>

fn bb_sub( &mut self, a: BabyBearWire<GraphCell>, b: BabyBearWire<GraphCell>, ) -> BabyBearWire<GraphCell>

fn bb_mul( &mut self, a: BabyBearWire<GraphCell>, b: BabyBearWire<GraphCell>, ) -> BabyBearWire<GraphCell>

fn bb_mul_add( &mut self, a: BabyBearWire<GraphCell>, b: BabyBearWire<GraphCell>, c: BabyBearWire<GraphCell>, ) -> BabyBearWire<GraphCell>

a * b + c

fn bb_div( &mut self, a: BabyBearWire<GraphCell>, b: BabyBearWire<GraphCell>, ) -> BabyBearWire<GraphCell>

fn bb_assert_zero(&mut self, a: BabyBearWire<GraphCell>)

fn bb_assert_equal( &mut self, a: BabyBearWire<GraphCell>, b: BabyBearWire<GraphCell>, )

fn bb_zero(&mut self) -> BabyBearWire<GraphCell>

fn bb_one(&mut self) -> BabyBearWire<GraphCell>

fn bb_mul_const( &mut self, a: BabyBearWire<GraphCell>, c: BabyBear, ) -> BabyBearWire<GraphCell>

fn bb_square(&mut self, a: BabyBearWire<GraphCell>) -> BabyBearWire<GraphCell>

fn bb_pow_power_of_two( &mut self, a: BabyBearWire<GraphCell>, n: usize, ) -> BabyBearWire<GraphCell>

a^(2^n)

impl ChipBase for Halo2IRBuilder

type F = GraphCell

Wire/value representation abstracting AssignedValue<Fr>.

impl GateInst for Halo2IRBuilder

fn load_constant(&mut self, value: Fr) -> GraphCell

Mirrors ctx.load_constant: always assigns a fresh cell (no cache).

fn constrain_equal(&mut self, _a: GraphCell, _b: GraphCell)

Copy constraint only; assigns no advice cells, so no node is emitted.

fn select( &mut self, when_true: GraphCell, when_false: GraphCell, cond: GraphCell, ) -> GraphCell

if cond { when_true } else { when_false }; cond must already be boolean-constrained.

fn select_const( &mut self, when_true: Fr, when_false: Fr, cond: GraphCell, ) -> GraphCell

Self::select with constant branch values.

fn num_to_bits(&mut self, a: GraphCell, range_bits: usize) -> Vec<GraphCell>

Little-endian bit decomposition, constrained to range_bits bits.

fn inner_product_const( &mut self, values: &[GraphCell], coeffs: &[Fr], ) -> GraphCell

Inner product of values with constant coefficients.

fn cell_count(&self) -> usize

Number of cells assigned so far (for cell profiling).

impl PopulateInputs for Halo2IRBuilder

fn load_witness(&mut self, value: Fr) -> GraphCell

fn bb_load_reduced_witness( &mut self, value: BabyBear, ) -> ReducedBabyBearWire<GraphCell>

fn ext_load_reduced_witness( &mut self, value: BabyBearExt4, ) -> ReducedBabyBearExt4Wire<GraphCell>

impl Poseidon2Inst for Halo2IRBuilder

fn hash_babybear_slice_to_digest( &mut self, values: &[ReducedBabyBearWire<GraphCell>], ) -> GraphCell

Mirrors hash::poseidon2::hash_babybear_slice_to_digest.

fn compress_digests(&mut self, left: GraphCell, right: GraphCell) -> GraphCell

Two-to-one Poseidon2 digest compression (Merkle node).

impl TranscriptInst for Halo2IRBuilder

fn init_transcript(&mut self)

(Re)initialize the transcript sponge to the all-zero state.

fn observe(&mut self, value: &ReducedBabyBearWire<GraphCell>)

fn observe_ext(&mut self, value: &ReducedBabyBearExt4Wire<GraphCell>)

fn observe_commit(&mut self, digest: &DigestWire<GraphCell>)

fn sample(&mut self) -> BabyBearWire<GraphCell>

fn sample_ext(&mut self) -> BabyBearExt4Wire<GraphCell>

fn sample_bits(&mut self, bits: usize) -> GraphCell

Sample and truncate to bits bits; returns a raw cell in [0, 2^bits).

fn check_witness( &mut self, bits: usize, witness: &ReducedBabyBearWire<GraphCell>, )

Asserts that the proof-of-work witness passes with bits leading zero bits.

fn transcript_load_reduced_constant( &mut self, value: BabyBear, ) -> ReducedBabyBearWire<Self::F>

Load a reduced constant through TranscriptChip’s baby-bear constant cache, which is distinct from BabyBearChip::const_cache. This split is preserved to keep the verifying key unchanged.