Struct snarkvm_wasm::gm17::ProvingAssignment

pub struct ProvingAssignment<E> where
    E: PairingEngine,  { /* fields omitted */ }

Implementations

impl<E> ProvingAssignment<E> where
    E: PairingEngine, 

pub fn which_is_unsatisfied(&self) -> Option<usize>

Trait Implementations

impl<E> Clone for ProvingAssignment<E> where
    E: Clone + PairingEngine,
    <E as PairingEngine>::Fr: Clone, 

pub fn clone(&self) -> ProvingAssignment<E>

Returns a copy of the value.

pub fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<E> ConstraintSystem<<E as PairingEngine>::Fr> for ProvingAssignment<E> where
    E: PairingEngine, 

type Root = ProvingAssignment<E>

Represents the type of the “root” of this constraint system so that nested namespaces can minimize indirection.

pub fn alloc<F, A, AR>(&mut self, A, f: F) -> Result<Variable, SynthesisError> where
    A: FnOnce() -> AR,
    F: FnOnce() -> Result<<E as PairingEngine>::Fr, SynthesisError>,
    AR: AsRef<str>, 

Allocate a private variable in the constraint system. The provided function is used to determine the assignment of the variable. The given annotation function is invoked in testing contexts in order to derive a unique name for this variable in the current namespace.

pub fn alloc_input<F, A, AR>(
    &mut self,
    A,
    f: F
) -> Result<Variable, SynthesisError> where
    A: FnOnce() -> AR,
    F: FnOnce() -> Result<<E as PairingEngine>::Fr, SynthesisError>,
    AR: AsRef<str>, 

Allocate a public variable in the constraint system. The provided function is used to determine the assignment of the variable.

pub fn enforce<A, AR, LA, LB, LC>(&mut self, A, a: LA, b: LB, c: LC) where
    LC: FnOnce(LinearCombination<<E as PairingEngine>::Fr>) -> LinearCombination<<E as PairingEngine>::Fr>,
    A: FnOnce() -> AR,
    AR: AsRef<str>,
    LA: FnOnce(LinearCombination<<E as PairingEngine>::Fr>) -> LinearCombination<<E as PairingEngine>::Fr>,
    LB: FnOnce(LinearCombination<<E as PairingEngine>::Fr>) -> LinearCombination<<E as PairingEngine>::Fr>, 

Enforce that A * B = C. The annotation function is invoked in testing contexts in order to derive a unique name for the constraint in the current namespace.

pub fn push_namespace<NR, N>(&mut self, N) where
    N: FnOnce() -> NR,
    NR: AsRef<str>, 

Create a new (sub)namespace and enter into it. Not intended for downstream use; use namespace instead.

pub fn pop_namespace(&mut self)

Exit out of the existing namespace. Not intended for downstream use; use namespace instead.

pub fn get_root(
    &mut self
) -> &mut <ProvingAssignment<E> as ConstraintSystem<<E as PairingEngine>::Fr>>::Root

Gets the “root” constraint system, bypassing the namespacing. Not intended for downstream use; use namespace instead.

pub fn num_constraints(&self) -> usize

Output the number of constraints in the system.

pub fn num_public_variables(&self) -> usize

Output the number of public input variables to the system.

pub fn num_private_variables(&self) -> usize

Output the number of private input variables to the system.

pub fn one() -> Variable

Return the “one” input variable

pub fn ns<NR, N>(&mut self, name_fn: N) -> Namespace<'_, F, Self::Root> where
    N: FnOnce() -> NR,
    NR: AsRef<str>, 

Begin a namespace for this constraint system.

impl<E> Debug for ProvingAssignment<E> where
    E: Debug + PairingEngine,
    <E as PairingEngine>::Fr: Debug, 

pub fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<E> PartialEq<ProvingAssignment<E>> for ProvingAssignment<E> where
    E: PartialEq<E> + PairingEngine,
    <E as PairingEngine>::Fr: PartialEq<<E as PairingEngine>::Fr>, 

pub fn eq(&self, other: &ProvingAssignment<E>) -> bool

This method tests for self and other values to be equal, and is used by ==.

pub fn ne(&self, other: &ProvingAssignment<E>) -> bool

This method tests for !=.

impl<E> StructuralPartialEq for ProvingAssignment<E> where
    E: PairingEngine,