Struct ark_relations::r1cs::ConstraintSystem [−][src]
pub struct ConstraintSystem<F: Field> { pub mode: SynthesisMode, pub num_instance_variables: usize, pub num_witness_variables: usize, pub num_constraints: usize, pub num_linear_combinations: usize, pub optimization_goal: OptimizationGoal, pub instance_assignment: Vec<F>, pub witness_assignment: Vec<F>, pub cache_map: Rc<RefCell<BTreeMap<TypeId, Box<dyn Any>>>>, // some fields omitted }
Expand description
An Rank-One ConstraintSystem. Enforces constraints of the form
⟨a_i, z⟩ ⋅ ⟨b_i, z⟩ = ⟨c_i, z⟩, where a_i, b_i, and c_i are linear
combinations over variables, and z is the concrete assignment to these
variables.
Fields
mode: SynthesisModeThe mode in which the constraint system is operating. self can either
be in setup mode (i.e., self.mode == SynthesisMode::Setup) or in
proving mode (i.e., self.mode == SynthesisMode::Prove). If we are
in proving mode, then we have the additional option of whether or
not to construct the A, B, and C matrices of the constraint system
(see below).
num_instance_variables: usizeThe number of variables that are “public inputs” to the constraint system.
num_witness_variables: usizeThe number of variables that are “private inputs” to the constraint system.
num_constraints: usizeThe number of constraints in the constraint system.
num_linear_combinations: usizeThe number of linear combinations
optimization_goal: OptimizationGoalThe parameter we aim to minimize in this constraint system (either the number of constraints or their total weight).
instance_assignment: Vec<F>Assignments to the public input variables. This is empty if self.mode == SynthesisMode::Setup.
witness_assignment: Vec<F>Assignments to the private input variables. This is empty if self.mode == SynthesisMode::Setup.
cache_map: Rc<RefCell<BTreeMap<TypeId, Box<dyn Any>>>>Map for gadgets to cache computation results.
Implementations
Create a new ConstraintSystemRef<F>.
Set self.mode to mode.
Check whether self.mode == SynthesisMode::Setup.
Check whether this constraint system aims to optimize weight, number of constraints, or neither.
Specify whether this constraint system should aim to optimize weight, number of constraints, or neither.
Check whether or not self will construct matrices.
Return a variable representing the constant “zero” inside the constraint system.
Return a variable representing the constant “one” inside the constraint system.
Obtain a variable representing a new public instance input.
Obtain a variable representing a new private witness input.
Obtain a variable representing a linear combination.
pub fn enforce_constraint(
&mut self,
a: LinearCombination<F>,
b: LinearCombination<F>,
c: LinearCombination<F>
) -> Result<()>[src]
pub fn enforce_constraint(
&mut self,
a: LinearCombination<F>,
b: LinearCombination<F>,
c: LinearCombination<F>
) -> Result<()>[src]Enforce a R1CS constraint with the name name.
pub fn transform_lc_map(
&mut self,
transformer: &mut dyn FnMut(&ConstraintSystem<F>, usize, &mut LinearCombination<F>) -> (usize, Option<Vec<F>>)
)[src]
pub fn transform_lc_map(
&mut self,
transformer: &mut dyn FnMut(&ConstraintSystem<F>, usize, &mut LinearCombination<F>) -> (usize, Option<Vec<F>>)
)[src]Transform the map of linear combinations. Specifically, allow the creation of additional witness assignments.
This method is used as a subroutine of inline_all_lcs and outline_lcs.
The transformer function is given a references of this constraint system (&self),
number of times used, and a mutable reference of the linear combination to be transformed.
(&ConstraintSystem
The transformer function returns the number of new witness variables needed
and a vector of new witness assignments (if not in the setup mode).
(usize, Option<Vec
Naively inlines symbolic linear combinations into the linear combinations that use them.
Useful for standard pairing-based SNARKs where addition gates are cheap. For example, in the SNARKs such as [Groth16] and [Groth-Maller17], addition gates do not contribute to the size of the multi-scalar multiplication, which is the dominating cost.
Finalize the constraint system (either by outlining or inlining, if an optimization goal is set).
This step must be called after constraint generation has completed, and after all symbolic LCs have been inlined into the places that they are used.
If self is satisfied, outputs Ok(true).
If self is unsatisfied, outputs Ok(false).
If self.is_in_setup_mode(), outputs Err(()).
If self is satisfied, outputs Ok(None).
If self is unsatisfied, outputs Some(i), where i is the index of
the first unsatisfied constraint. If self.is_in_setup_mode(), outputs
Err(()).
Obtain the assignment corresponding to the Variable v.
Trait Implementations
Auto Trait Implementations
impl<F> !Send for ConstraintSystem<F>impl<F> !Sync for ConstraintSystem<F>impl<F> Unpin for ConstraintSystem<F> where
F: Unpin, Blanket Implementations
Mutably borrows from an owned value. Read more
Instruments this type with the provided Span, returning an
Instrumented wrapper. Read more
type Output = T
type Output = TShould always be Self
pub fn vzip(self) -> V