Struct folding::decomposable_folding::DecomposableFoldingScheme

pub struct DecomposableFoldingScheme<'a, CF: FoldingConfig> { /* private fields */ }

Implementations

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

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

Creates a new folding scheme for decomposable circuits. It takes as input:

• a set of constraints, each associated with a particular selector;
• a list of common constraints, that are applied to every instance regardless of the selector (can be empty);
• a structured reference string;
• a domain;
• a structure of the associated folding configuration. The function uses the normal FoldingScheme::new() function to create the decomposable scheme, using for that the concatenation of the constraints associated with each selector multiplied by the selector, and the common constraints. This product is performed with FoldingCompatibleExprInner::Extensions(ExpExtension::Selector(s)).

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, selector: Option<CF::Selector>, 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>,

folding with a selector will assume that only the selector in question is enabled (i.e. set to 1) in all rows, and any other selector is 0 over all rows. If that is not the case, providing None will fold without assumptions

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.