pub type RecursiveVerifierConstraintFolder<'a> = GenericVerifierConstraintFolder<'a, SP1Field, SP1ExtensionField, Felt<SP1Field>, Ext<SP1Field, SP1ExtensionField>, SymbolicExt<SP1Field, SP1ExtensionField>>;Aliased Type§
pub struct RecursiveVerifierConstraintFolder<'a> {
pub preprocessed: DenseMatrix<Ext<KoalaBear, BinomialExtensionField<KoalaBear, 4>>, &'a [Ext<KoalaBear, BinomialExtensionField<KoalaBear, 4>>]>,
pub main: DenseMatrix<Ext<KoalaBear, BinomialExtensionField<KoalaBear, 4>>, &'a [Ext<KoalaBear, BinomialExtensionField<KoalaBear, 4>>]>,
pub alpha: Ext<KoalaBear, BinomialExtensionField<KoalaBear, 4>>,
pub accumulator: SymbolicExt<KoalaBear, BinomialExtensionField<KoalaBear, 4>>,
pub public_values: &'a [Felt<KoalaBear>],
pub _marker: PhantomData<(KoalaBear, BinomialExtensionField<KoalaBear, 4>)>,
}Fields§
§preprocessed: DenseMatrix<Ext<KoalaBear, BinomialExtensionField<KoalaBear, 4>>, &'a [Ext<KoalaBear, BinomialExtensionField<KoalaBear, 4>>]>The preprocessed trace.
main: DenseMatrix<Ext<KoalaBear, BinomialExtensionField<KoalaBear, 4>>, &'a [Ext<KoalaBear, BinomialExtensionField<KoalaBear, 4>>]>The main trace.
alpha: Ext<KoalaBear, BinomialExtensionField<KoalaBear, 4>>The constraint folding challenge.
accumulator: SymbolicExt<KoalaBear, BinomialExtensionField<KoalaBear, 4>>The accumulator for the constraint folding.
public_values: &'a [Felt<KoalaBear>]The public values.
_marker: PhantomData<(KoalaBear, BinomialExtensionField<KoalaBear, 4>)>The marker type.