Struct snarkos_algorithms::snark::gm17::ProvingAssignment

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

Implementations

impl<E: PairingEngine> ProvingAssignment<E>

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

Trait Implementations

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

type Root = Self

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

fn alloc<F, A, AR>(&mut self, _: A, f: F) -> Result<Variable, SynthesisError> where
    F: FnOnce() -> Result<E::Fr, SynthesisError>,
    A: FnOnce() -> AR,
    AR: Into<String>, 

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.

fn alloc_input<F, A, AR>(
    &mut self,
    _: A,
    f: F
) -> Result<Variable, SynthesisError> where
    F: FnOnce() -> Result<E::Fr, SynthesisError>,
    A: FnOnce() -> AR,
    AR: Into<String>, 

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

fn enforce<A, AR, LA, LB, LC>(&mut self, _: A, a: LA, b: LB, c: LC) where
    A: FnOnce() -> AR,
    AR: Into<String>,
    LA: FnOnce(LinearCombination<E::Fr>) -> LinearCombination<E::Fr>,
    LB: FnOnce(LinearCombination<E::Fr>) -> LinearCombination<E::Fr>,
    LC: FnOnce(LinearCombination<E::Fr>) -> LinearCombination<E::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.

fn push_namespace<NR, N>(&mut self, _: N) where
    NR: Into<String>,
    N: FnOnce() -> NR, 

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

fn pop_namespace(&mut self)

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

fn get_root(&mut self) -> &mut Self::Root

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

fn num_constraints(&self) -> usize

Output the number of constraints in the system.

fn one() -> Variable

Return the "one" input variable

fn ns<NR, N>(&'a mut self, name_fn: N) -> Namespace<'a, F, Self::Root> where
    N: FnOnce() -> NR,
    NR: Into<String>, 

Begin a namespace for this constraint system.

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

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

Formats the value using the given formatter.

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

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

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

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

This method tests for !=.

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