sp1_stark

Struct ProverConstraintFolder

source 
pub struct ProverConstraintFolder<'a, SC: StarkGenericConfig> {
    pub preprocessed: VerticalPair<RowMajorMatrixView<'a, PackedVal<SC>>, RowMajorMatrixView<'a, PackedVal<SC>>>,
    pub main: VerticalPair<RowMajorMatrixView<'a, PackedVal<SC>>, RowMajorMatrixView<'a, PackedVal<SC>>>,
    pub perm: VerticalPair<RowMajorMatrixView<'a, PackedChallenge<SC>>, RowMajorMatrixView<'a, PackedChallenge<SC>>>,
    pub perm_challenges: &'a [PackedChallenge<SC>],
    pub cumulative_sums: &'a [PackedChallenge<SC>],
    pub is_first_row: PackedVal<SC>,
    pub is_last_row: PackedVal<SC>,
    pub is_transition: PackedVal<SC>,
    pub alpha: SC::Challenge,
    pub accumulator: PackedChallenge<SC>,
    pub public_values: &'a [Val<SC>],
}
Expand description

A folder for prover constraints.

Fields§

§preprocessed: VerticalPair<RowMajorMatrixView<'a, PackedVal<SC>>, RowMajorMatrixView<'a, PackedVal<SC>>>

The preprocessed trace.

§main: VerticalPair<RowMajorMatrixView<'a, PackedVal<SC>>, RowMajorMatrixView<'a, PackedVal<SC>>>

The main trace.

§perm: VerticalPair<RowMajorMatrixView<'a, PackedChallenge<SC>>, RowMajorMatrixView<'a, PackedChallenge<SC>>>

The permutation trace.

§perm_challenges: &'a [PackedChallenge<SC>]

The challenges for the permutation.

§cumulative_sums: &'a [PackedChallenge<SC>]

The cumulative sums for the permutation.

§is_first_row: PackedVal<SC>

The selector for the first row.

§is_last_row: PackedVal<SC>

The selector for the last row.

§is_transition: PackedVal<SC>

The selector for the transition.

§alpha: SC::Challenge

The constraint folding challenge.

§accumulator: PackedChallenge<SC>

The accumulator for the constraint folding.

§public_values: &'a [Val<SC>]

The public values.

Trait Implementations§

source§

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

source§

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

source§

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

source§

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

source§

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]>>

source§

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

source§

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

source§

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

source§

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

source§

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

source§

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

source§

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.
source§

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.
source§

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

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

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

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

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

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

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.
source§

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

source§

fn assert_eq<I1, I2>(&mut self, x: I1, y: I2)
where I1: Into<Self::Expr>, I2: Into<Self::Expr>,

source§

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.
source§

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

source§

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

source§

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

source§

impl<'a, SC: StarkGenericConfig> ExtensionBuilder for ProverConstraintFolder<'a, SC>

source§

type EF = <SC as StarkGenericConfig>::Challenge

source§

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

source§

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

source§

fn assert_zero_ext<I>(&mut self, x: I)
where I: Into<Self::ExprEF>,

source§

fn assert_eq_ext<I1, I2>(&mut self, x: I1, y: I2)
where I1: Into<Self::ExprEF>, I2: Into<Self::ExprEF>,

source§

fn assert_one_ext<I>(&mut self, x: I)
where I: Into<Self::ExprEF>,

source§

impl<'a, SC: StarkGenericConfig> MultiTableAirBuilder<'a> for ProverConstraintFolder<'a, SC>

source§

type Sum = <<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

The type of the cumulative sum.
source§

fn cumulative_sums(&self) -> &'a [Self::Sum]

Returns the cumulative sum of the permutation.
source§

impl<'a, SC: StarkGenericConfig> PairBuilder for ProverConstraintFolder<'a, SC>

source§

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

source§

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

source§

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]>>

source§

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

source§

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

source§

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

source§

impl<'a, SC: StarkGenericConfig> EmptyMessageBuilder for ProverConstraintFolder<'a, SC>

Auto Trait Implementations§

Blanket Implementations§

source§

impl<AB> AluAirBuilder for AB
where AB: BaseAirBuilder,

source§

fn send_alu( &mut self, opcode: impl Into<Self::Expr>, a: Word<impl Into<Self::Expr>>, b: Word<impl Into<Self::Expr>>, c: Word<impl Into<Self::Expr>>, shard: impl Into<Self::Expr>, nonce: impl Into<Self::Expr>, multiplicity: impl Into<Self::Expr>, )

Sends an ALU operation to be processed.
source§

fn receive_alu( &mut self, opcode: impl Into<Self::Expr>, a: Word<impl Into<Self::Expr>>, b: Word<impl Into<Self::Expr>>, c: Word<impl Into<Self::Expr>>, shard: impl Into<Self::Expr>, nonce: impl Into<Self::Expr>, multiplicity: impl Into<Self::Expr>, )

Receives an ALU operation to be processed.
source§

fn send_syscall( &mut self, shard: impl Into<Self::Expr> + Clone, clk: impl Into<Self::Expr> + Clone, nonce: impl Into<Self::Expr> + Clone, syscall_id: impl Into<Self::Expr> + Clone, arg1: impl Into<Self::Expr> + Clone, arg2: impl Into<Self::Expr> + Clone, multiplicity: impl Into<Self::Expr>, scope: InteractionScope, )

Sends an syscall operation to be processed (with “ECALL” opcode).
source§

fn receive_syscall( &mut self, shard: impl Into<Self::Expr> + Clone, clk: impl Into<Self::Expr> + Clone, nonce: impl Into<Self::Expr> + Clone, syscall_id: impl Into<Self::Expr> + Clone, arg1: impl Into<Self::Expr> + Clone, arg2: impl Into<Self::Expr> + Clone, multiplicity: impl Into<Self::Expr>, scope: InteractionScope, )

Receives a syscall operation to be processed.
source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<AB> BaseAirBuilder for AB
where AB: AirBuilder + MessageBuilder<AirInteraction<<AB as AirBuilder>::Expr>>,

source§

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

Returns a sub-builder whose constraints are enforced only when condition is not one.
source§

fn assert_all_eq<I1: Into<Self::Expr>, I2: Into<Self::Expr>>( &mut self, left: impl IntoIterator<Item = I1>, right: impl IntoIterator<Item = I2>, )

Asserts that an iterator of expressions are all equal.
source§

fn assert_all_zero<I: Into<Self::Expr>>( &mut self, iter: impl IntoIterator<Item = I>, )

Asserts that an iterator of expressions are all zero.
source§

fn if_else( &mut self, condition: impl Into<Self::Expr> + Clone, a: impl Into<Self::Expr> + Clone, b: impl Into<Self::Expr> + Clone, ) -> Self::Expr

Will return a if condition is 1, else b. This assumes that condition is already checked to be a boolean.
source§

fn index_array( &mut self, array: &[impl Into<Self::Expr> + Clone], index_bitmap: &[impl Into<Self::Expr> + Clone], ) -> Self::Expr

Index an array of expressions using an index bitmap. This function assumes that the EIndex type is a boolean and that index_bitmap’s entries sum to 1.
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<AB> ByteAirBuilder for AB
where AB: BaseAirBuilder,

source§

fn send_byte( &mut self, opcode: impl Into<Self::Expr>, a: impl Into<Self::Expr>, b: impl Into<Self::Expr>, c: impl Into<Self::Expr>, multiplicity: impl Into<Self::Expr>, )

Sends a byte operation to be processed.
source§

fn send_byte_pair( &mut self, opcode: impl Into<Self::Expr>, a1: impl Into<Self::Expr>, a2: impl Into<Self::Expr>, b: impl Into<Self::Expr>, c: impl Into<Self::Expr>, multiplicity: impl Into<Self::Expr>, )

Sends a byte operation with two outputs to be processed.
source§

fn receive_byte( &mut self, opcode: impl Into<Self::Expr>, a: impl Into<Self::Expr>, b: impl Into<Self::Expr>, c: impl Into<Self::Expr>, multiplicity: impl Into<Self::Expr>, )

Receives a byte operation to be processed.
source§

fn receive_byte_pair( &mut self, opcode: impl Into<Self::Expr>, a1: impl Into<Self::Expr>, a2: impl Into<Self::Expr>, b: impl Into<Self::Expr>, c: impl Into<Self::Expr>, multiplicity: impl Into<Self::Expr>, )

Receives a byte operation with two outputs to be processed.
source§

impl<AB> ExtensionAirBuilder for AB
where AB: BaseAirBuilder,

source§

fn assert_ext_eq<I: Into<Self::Expr>>( &mut self, left: BinomialExtension<I>, right: BinomialExtension<I>, )

Asserts that the two field extensions are equal.
source§

fn assert_is_base_element<I: Into<Self::Expr> + Clone>( &mut self, element: BinomialExtension<I>, )

Checks if an extension element is a base element.
source§

fn if_else_ext( &mut self, condition: impl Into<Self::Expr> + Clone, a: BinomialExtension<impl Into<Self::Expr> + Clone>, b: BinomialExtension<impl Into<Self::Expr> + Clone>, ) -> BinomialExtension<Self::Expr>

Performs an if else on extension elements.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T> Instrument for T

source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> IntoEither for T

source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

impl<AB, M> MessageBuilder<M> for AB
where AB: EmptyMessageBuilder,

source§

fn send(&mut self, _message: M, _scope: InteractionScope)

Sends a message.
source§

fn receive(&mut self, _message: M, _scope: InteractionScope)

Receives a message.
source§

impl<T> Pointable for T

source§

const ALIGN: usize = _

The alignment of pointer.
source§

type Init = T

The type for initializers.
source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
source§

impl<T> Same for T

source§

type Output = T

Should always be Self
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

source§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

source§

fn vzip(self) -> V

source§

impl<T> WithSubscriber for T

source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more
source§

impl<AB> MachineAirBuilder for AB
where AB: BaseAirBuilder + AirBuilderWithPublicValues,

source§

impl<AB> SP1AirBuilder for AB
where AB: BaseAirBuilder + AirBuilderWithPublicValues,