Skip to main content

RecursiveVerifierPublicValuesConstraintFolder

Type Alias RecursiveVerifierPublicValuesConstraintFolder 

Source
pub type RecursiveVerifierPublicValuesConstraintFolder<'a> = GenericVerifierPublicValuesConstraintFolder<'a, SP1Field, SP1ExtensionField, Felt<SP1Field>, Ext<SP1Field, SP1ExtensionField>, SymbolicExt<SP1Field, SP1ExtensionField>>;

Aliased Type§

pub struct RecursiveVerifierPublicValuesConstraintFolder<'a> {
    pub perm_challenges: (&'a Ext<KoalaBear, BinomialExtensionField<KoalaBear, 4>>, &'a [SymbolicExt<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 local_interaction_digest: SymbolicExt<KoalaBear, BinomialExtensionField<KoalaBear, 4>>,
    pub _marker: PhantomData<(KoalaBear, BinomialExtensionField<KoalaBear, 4>)>,
}

Fields§

§perm_challenges: (&'a Ext<KoalaBear, BinomialExtensionField<KoalaBear, 4>>, &'a [SymbolicExt<KoalaBear, BinomialExtensionField<KoalaBear, 4>>])

The challenges for the permutation.

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

§local_interaction_digest: SymbolicExt<KoalaBear, BinomialExtensionField<KoalaBear, 4>>

The local interaction digests.

§_marker: PhantomData<(KoalaBear, BinomialExtensionField<KoalaBear, 4>)>

The marker type.