Struct snarkvm_wasm::groth16::ProvingAssignment [−][src]
pub struct ProvingAssignment<E> where
E: PairingEngine, { /* fields omitted */ }
Trait Implementations
impl<E> ConstraintSystem<<E as PairingEngine>::Fr> for ProvingAssignment<E> where
E: PairingEngine,
[src]
impl<E> ConstraintSystem<<E as PairingEngine>::Fr> for ProvingAssignment<E> where
E: PairingEngine,
[src]type Root = ProvingAssignment<E>
type Root = ProvingAssignment<E>
Represents the type of the “root” of this constraint system so that nested namespaces can minimize indirection. Read more
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>,
[src]
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>,
[src]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. Read more
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>,
[src]
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>,
[src]Allocate a public variable in the constraint system. The provided function is used to determine the assignment of the variable. Read more
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>,
[src]
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>,
[src]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. Read more
pub fn push_namespace<NR, N>(&mut self, N) where
N: FnOnce() -> NR,
NR: AsRef<str>,
[src]
pub fn push_namespace<NR, N>(&mut self, N) where
N: FnOnce() -> NR,
NR: AsRef<str>,
[src]Create a new (sub)namespace and enter into it. Not intended
for downstream use; use namespace
instead. Read more
pub fn pop_namespace(&mut self)
[src]
pub fn pop_namespace(&mut self)
[src]Exit out of the existing namespace. Not intended for
downstream use; use namespace
instead. Read more
pub fn get_root(
&mut self
) -> &mut <ProvingAssignment<E> as ConstraintSystem<<E as PairingEngine>::Fr>>::Root
[src]
pub fn get_root(
&mut self
) -> &mut <ProvingAssignment<E> as ConstraintSystem<<E as PairingEngine>::Fr>>::Root
[src]Gets the “root” constraint system, bypassing the namespacing.
Not intended for downstream use; use namespace
instead. Read more
pub fn num_constraints(&self) -> usize
[src]
pub fn num_constraints(&self) -> usize
[src]Output the number of constraints in the system.
pub fn num_public_variables(&self) -> usize
[src]
pub fn num_public_variables(&self) -> usize
[src]Output the number of public input variables to the system.
pub fn num_private_variables(&self) -> usize
[src]
pub fn num_private_variables(&self) -> usize
[src]Output the number of private input variables to the system.
Auto Trait Implementations
impl<E> RefUnwindSafe for ProvingAssignment<E> where
<E as PairingEngine>::Fr: RefUnwindSafe,
<E as PairingEngine>::Fr: RefUnwindSafe,
impl<E> Send for ProvingAssignment<E>
impl<E> Sync for ProvingAssignment<E>
impl<E> Unpin for ProvingAssignment<E> where
<E as PairingEngine>::Fr: Unpin,
<E as PairingEngine>::Fr: Unpin,
impl<E> UnwindSafe for ProvingAssignment<E> where
<E as PairingEngine>::Fr: UnwindSafe,
<E as PairingEngine>::Fr: UnwindSafe,
Blanket Implementations
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]pub fn borrow_mut(&mut self) -> &mut T
[src]
pub fn borrow_mut(&mut self) -> &mut T
[src]Mutably borrows from an owned value. Read more
impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Same<T> for T
impl<T> Same<T> for T
type Output = T
type Output = T
Should always be Self
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,