Struct ProverConstraintFolder

pub struct ProverConstraintFolder<'a, SC: StarkGenericConfig> {

    pub preprocessed: ViewPair<'a, PackedVal<SC>>,
    pub partitioned_main: Vec<ViewPair<'a, PackedVal<SC>>>,
    pub after_challenge: Vec<ViewPair<'a, PackedChallenge<SC>>>,
    pub challenges: &'a [Vec<PackedChallenge<SC>>],
    pub is_first_row: PackedVal<SC>,
    pub is_last_row: PackedVal<SC>,
    pub is_transition: PackedVal<SC>,
    pub alpha_powers: &'a [SC::Challenge],
    pub accumulator: PackedChallenge<SC>,
    pub constraint_index: usize,
    pub public_values: &'a [Val<SC>],
    pub exposed_values_after_challenge: &'a [&'a [PackedChallenge<SC>]],
    pub interactions: Vec<Interaction<PackedVal<SC>>>,
    pub interaction_chunk_size: usize,
    pub rap_phase_seq_kind: RapPhaseSeqKind,
    pub has_common_main: bool,
}

A folder for prover constraints.

Fields

preprocessed: ViewPair<'a, PackedVal<SC>>

partitioned_main: Vec<ViewPair<'a, PackedVal<SC>>>

after_challenge: Vec<ViewPair<'a, PackedChallenge<SC>>>

challenges: &'a [Vec<PackedChallenge<SC>>]

is_first_row: PackedVal<SC>

is_last_row: PackedVal<SC>

is_transition: PackedVal<SC>

alpha_powers: &'a [SC::Challenge]

accumulator: PackedChallenge<SC>

constraint_index: usize

public_values: &'a [Val<SC>]

exposed_values_after_challenge: &'a [&'a [PackedChallenge<SC>]]

interactions: Vec<Interaction<PackedVal<SC>>>

interaction_chunk_size: usize

Number of interactions to bundle in permutation trace, if applicable.

rap_phase_seq_kind: RapPhaseSeqKind

has_common_main: bool

Trait Implementations

impl<'a, SC> AirBuilder for ProverConstraintFolder<'a, SC>

where SC: StarkGenericConfig,

fn main(&self) -> Self::M

It is difficult to horizontally concatenate matrices when the main trace is partitioned, so we disable this method in that case.

type F = <<<SC as StarkGenericConfig>::Pcs as Pcs<<SC as StarkGenericConfig>::Challenge, <SC as StarkGenericConfig>::Challenger>>::Domain as PolynomialSpace>::Val

type Expr = <<<<SC as StarkGenericConfig>::Pcs as Pcs<<SC as StarkGenericConfig>::Challenge, <SC as StarkGenericConfig>::Challenger>>::Domain as PolynomialSpace>::Val as Field>::Packing

type Var = <<<<SC as StarkGenericConfig>::Pcs as Pcs<<SC as StarkGenericConfig>::Challenge, <SC as StarkGenericConfig>::Challenger>>::Domain as PolynomialSpace>::Val as Field>::Packing

type M = VerticalPair<DenseMatrix<<<<<SC as StarkGenericConfig>::Pcs as Pcs<<SC as StarkGenericConfig>::Challenge, <SC as StarkGenericConfig>::Challenger>>::Domain as PolynomialSpace>::Val as Field>::Packing, &'a [<<<<SC as StarkGenericConfig>::Pcs as Pcs<<SC as StarkGenericConfig>::Challenge, <SC as StarkGenericConfig>::Challenger>>::Domain as PolynomialSpace>::Val as Field>::Packing]>, DenseMatrix<<<<<SC as StarkGenericConfig>::Pcs as Pcs<<SC as StarkGenericConfig>::Challenge, <SC as StarkGenericConfig>::Challenger>>::Domain as PolynomialSpace>::Val as Field>::Packing, &'a [<<<<SC as StarkGenericConfig>::Pcs as Pcs<<SC as StarkGenericConfig>::Challenge, <SC as StarkGenericConfig>::Challenger>>::Domain as PolynomialSpace>::Val as Field>::Packing]>>

fn is_first_row(&self) -> Self::Expr

fn is_last_row(&self) -> Self::Expr

fn is_transition_window(&self, size: usize) -> Self::Expr

fn assert_zero<I: Into<Self::Expr>>(&mut self, x: I)

fn is_transition(&self) -> Self::Expr

fn when<I>(&mut self, condition: I) -> FilteredAirBuilder<'_, Self>

where I: Into<Self::Expr>,

Returns a sub-builder whose constraints are enforced only when condition is nonzero.

fn when_ne<I1, I2>(&mut self, x: I1, y: I2) -> FilteredAirBuilder<'_, Self>

where I1: Into<Self::Expr>, I2: Into<Self::Expr>,

Returns a sub-builder whose constraints are enforced only when x != y.

fn when_first_row(&mut self) -> FilteredAirBuilder<'_, Self>

Returns a sub-builder whose constraints are enforced only on the first row.

fn when_last_row(&mut self) -> FilteredAirBuilder<'_, Self>

Returns a sub-builder whose constraints are enforced only on the last row.

fn when_transition(&mut self) -> FilteredAirBuilder<'_, Self>

Returns a sub-builder whose constraints are enforced on all rows except the last.

fn when_transition_window( &mut self, size: usize, ) -> FilteredAirBuilder<'_, Self>

Returns a sub-builder whose constraints are enforced on all rows except the last size - 1.

fn assert_one<I>(&mut self, x: I)

where I: Into<Self::Expr>,

fn assert_eq<I1, I2>(&mut self, x: I1, y: I2)

where I1: Into<Self::Expr>, I2: Into<Self::Expr>,

fn assert_bool<I>(&mut self, x: I)

where I: Into<Self::Expr>,

Assert that x is a boolean, i.e. either 0 or 1.

impl<SC: StarkGenericConfig> AirBuilderWithPublicValues for ProverConstraintFolder<'_, SC>

type PublicVar = <ProverConstraintFolder<'_, SC> as AirBuilder>::F

fn public_values(&self) -> &[Self::F]

impl<SC> ExtensionBuilder for ProverConstraintFolder<'_, SC>

where SC: StarkGenericConfig,

type EF = <SC as StarkGenericConfig>::Challenge

type ExprEF = <<SC as StarkGenericConfig>::Challenge as ExtensionField<<<<SC as StarkGenericConfig>::Pcs as Pcs<<SC as StarkGenericConfig>::Challenge, <SC as StarkGenericConfig>::Challenger>>::Domain as PolynomialSpace>::Val>>::ExtensionPacking

type VarEF = <<SC as StarkGenericConfig>::Challenge as ExtensionField<<<<SC as StarkGenericConfig>::Pcs as Pcs<<SC as StarkGenericConfig>::Challenge, <SC as StarkGenericConfig>::Challenger>>::Domain as PolynomialSpace>::Val>>::ExtensionPacking

fn assert_zero_ext<I>(&mut self, x: I)

where I: Into<Self::ExprEF>,

fn assert_eq_ext<I1, I2>(&mut self, x: I1, y: I2)

where I1: Into<Self::ExprEF>, I2: Into<Self::ExprEF>,

fn assert_one_ext<I>(&mut self, x: I)

where I: Into<Self::ExprEF>,

impl<SC> InteractionBuilder for ProverConstraintFolder<'_, SC>

where SC: StarkGenericConfig,

fn push_interaction<E: Into<Self::Expr>>( &mut self, bus_index: usize, fields: impl IntoIterator<Item = E>, count: impl Into<Self::Expr>, interaction_type: InteractionType, )

Stores a new interaction in the builder.

fn num_interactions(&self) -> usize

Returns the current number of interactions.

fn all_interactions(&self) -> &[Interaction<Self::Expr>]

Returns all interactions stored.

fn push_send<E: Into<Self::Expr>>( &mut self, bus_index: usize, fields: impl IntoIterator<Item = E>, count: impl Into<Self::Expr>, )

Stores a new send interaction in the builder.

fn push_receive<E: Into<Self::Expr>>( &mut self, bus_index: usize, fields: impl IntoIterator<Item = E>, count: impl Into<Self::Expr>, )

Stores a new receive interaction in the builder.

impl<SC> PairBuilder for ProverConstraintFolder<'_, SC>

where SC: StarkGenericConfig,

fn preprocessed(&self) -> Self::M

impl<SC> PartitionedAirBuilder for ProverConstraintFolder<'_, SC>

where SC: StarkGenericConfig,

fn cached_mains(&self) -> &[Self::M]

Cached main trace matrix.

fn common_main(&self) -> &Self::M

Common main trace matrix. Panic if there is no common main trace.

impl<'a, SC> PermutationAirBuilder for ProverConstraintFolder<'a, SC>

where SC: StarkGenericConfig,

type MP = VerticalPair<DenseMatrix<<<SC as StarkGenericConfig>::Challenge as ExtensionField<<<<SC as StarkGenericConfig>::Pcs as Pcs<<SC as StarkGenericConfig>::Challenge, <SC as StarkGenericConfig>::Challenger>>::Domain as PolynomialSpace>::Val>>::ExtensionPacking, &'a [<<SC as StarkGenericConfig>::Challenge as ExtensionField<<<<SC as StarkGenericConfig>::Pcs as Pcs<<SC as StarkGenericConfig>::Challenge, <SC as StarkGenericConfig>::Challenger>>::Domain as PolynomialSpace>::Val>>::ExtensionPacking]>, DenseMatrix<<<SC as StarkGenericConfig>::Challenge as ExtensionField<<<<SC as StarkGenericConfig>::Pcs as Pcs<<SC as StarkGenericConfig>::Challenge, <SC as StarkGenericConfig>::Challenger>>::Domain as PolynomialSpace>::Val>>::ExtensionPacking, &'a [<<SC as StarkGenericConfig>::Challenge as ExtensionField<<<<SC as StarkGenericConfig>::Pcs as Pcs<<SC as StarkGenericConfig>::Challenge, <SC as StarkGenericConfig>::Challenger>>::Domain as PolynomialSpace>::Val>>::ExtensionPacking]>>

type RandomVar = <<SC as StarkGenericConfig>::Challenge as ExtensionField<<<<SC as StarkGenericConfig>::Pcs as Pcs<<SC as StarkGenericConfig>::Challenge, <SC as StarkGenericConfig>::Challenger>>::Domain as PolynomialSpace>::Val>>::ExtensionPacking

fn permutation(&self) -> Self::MP

fn permutation_randomness(&self) -> &[Self::RandomVar]

impl<SC> PermutationAirBuilderWithExposedValues for ProverConstraintFolder<'_, SC>

where SC: StarkGenericConfig,

fn permutation_exposed_values(&self) -> &[Self::VarEF]

impl<SC> SymbolicEvaluator<<<<SC as StarkGenericConfig>::Pcs as Pcs<<SC as StarkGenericConfig>::Challenge, <SC as StarkGenericConfig>::Challenger>>::Domain as PolynomialSpace>::Val, <<<<SC as StarkGenericConfig>::Pcs as Pcs<<SC as StarkGenericConfig>::Challenge, <SC as StarkGenericConfig>::Challenger>>::Domain as PolynomialSpace>::Val as Field>::Packing> for ProverConstraintFolder<'_, SC>

where SC: StarkGenericConfig,

fn eval_var(&self, symbolic_var: SymbolicVariable<Val<SC>>) -> PackedVal<SC>

fn eval_expr(&self, symbolic_expr: &SymbolicExpression<F>) -> E