Struct FoldingScheme

pub struct FoldingScheme<'a, CF: FoldingConfig> {
    pub expression: IntegratedFoldingExpr<CF>,
    pub srs: &'a CF::Srs,
    pub domain: Radix2EvaluationDomain<<<CF as FoldingConfig>::Curve as AffineRepr>::ScalarField>,
    pub zero_vec: Evaluations<<<CF as FoldingConfig>::Curve as AffineRepr>::ScalarField, Radix2EvaluationDomain<<<CF as FoldingConfig>::Curve as AffineRepr>::ScalarField>>,
    pub structure: CF::Structure,
    pub extended_witness_generator: ExtendedWitnessGenerator<CF>,
    /* private fields */
}

Fields

expression: IntegratedFoldingExpr<CF>

srs: &'a CF::Srs

domain: Radix2EvaluationDomain<<<CF as FoldingConfig>::Curve as AffineRepr>::ScalarField>

zero_vec: Evaluations<<<CF as FoldingConfig>::Curve as AffineRepr>::ScalarField, Radix2EvaluationDomain<<<CF as FoldingConfig>::Curve as AffineRepr>::ScalarField>>

structure: CF::Structure

extended_witness_generator: ExtendedWitnessGenerator<CF>

Implementations

impl<'a, CF: FoldingConfig> FoldingScheme<'a, CF>

pub fn new( constraints: Vec<FoldingCompatibleExpr<CF>>, srs: &'a CF::Srs, domain: Radix2EvaluationDomain<<<CF as FoldingConfig>::Curve as AffineRepr>::ScalarField>, structure: &CF::Structure, ) -> (Self, FoldingCompatibleExpr<CF>)

pub fn get_number_of_additional_columns(&self) -> usize

Return the number of additional columns added by quadraticization

pub fn fold_instance_witness_pair<A, B, Sponge>( &self, a: A, b: B, fq_sponge: &mut Sponge, ) -> FoldingOutput<CF>

where A: RelaxablePair<CF::Curve, CF::Instance, CF::Witness>, B: RelaxablePair<CF::Curve, CF::Instance, CF::Witness>, Sponge: FqSponge<<<CF as FoldingConfig>::Curve as AffineRepr>::BaseField, CF::Curve, <<CF as FoldingConfig>::Curve as AffineRepr>::ScalarField>,

This is the main entry point to fold two instances and their witnesses. The process is as follows:

• Both pairs are relaxed.
• Both witnesses and instances are extended, i.e. all polynomials are reduced to degree 2 and additional constraints are added to the expression.
• While computing the commitments to the additional columns, the commitments are added into a list to absorb them into the sponge later.
• The error terms are computed and committed.
• The sponge absorbs the commitments and challenges.

pub fn fold_instance_pair<A, B, Sponge>( &self, a: A, b: B, error_commitments: [PolyComm<CF::Curve>; 2], fq_sponge: &mut Sponge, ) -> RelaxedInstance<CF::Curve, CF::Instance>

where A: RelaxableInstance<CF::Curve, CF::Instance>, B: RelaxableInstance<CF::Curve, CF::Instance>, Sponge: FqSponge<<<CF as FoldingConfig>::Curve as AffineRepr>::BaseField, CF::Curve, <<CF as FoldingConfig>::Curve as AffineRepr>::ScalarField>,

Fold two relaxable instances into a relaxed instance. It is parametrized by two different types A and B that represent “relaxable” instances to be able to fold a normal and “already relaxed” instance.

pub fn verify_fold<Sponge>( &self, left_instance: RelaxedInstance<CF::Curve, CF::Instance>, right_instance: RelaxedInstance<CF::Curve, CF::Instance>, t_0: PolyComm<CF::Curve>, t_1: PolyComm<CF::Curve>, fq_sponge: &mut Sponge, ) -> RelaxedInstance<CF::Curve, CF::Instance>

where Sponge: FqSponge<<<CF as FoldingConfig>::Curve as AffineRepr>::BaseField, CF::Curve, <<CF as FoldingConfig>::Curve as AffineRepr>::ScalarField>,

Verifier of the folding scheme; returns a new folded instance, which can be then compared with the one claimed to be the real one.