Struct snarkvm_algorithms::snark::varuna::CircuitProvingKey

pub struct CircuitProvingKey<E: PairingEngine, SM: SNARKMode> {
    pub circuit_verifying_key: CircuitVerifyingKey<E>,
    pub circuit: Arc<Circuit<E::Fr, SM>>,
    pub committer_key: Arc<CommitterKey<E>>,
}

Proving key for a specific circuit (i.e., R1CS matrices).

Fields

circuit_verifying_key: CircuitVerifyingKey<E>

The circuit verifying key.

circuit: Arc<Circuit<E::Fr, SM>>

The circuit itself.

committer_key: Arc<CommitterKey<E>>

The committer key for this index, trimmed from the universal SRS.

Trait Implementations

impl<E: Clone + PairingEngine, SM: Clone + SNARKMode> Clone for CircuitProvingKey<E, SM>

where E::Fr: Clone,

fn clone(&self) -> CircuitProvingKey<E, SM>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<E: Debug + PairingEngine, SM: Debug + SNARKMode> Debug for CircuitProvingKey<E, SM>

where E::Fr: Debug,

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

Formats the value using the given formatter.

impl<E: PairingEngine, SM: SNARKMode> FromBytes for CircuitProvingKey<E, SM>

fn read_le<R: Read>(reader: R) -> Result<Self>

Reads Self from reader as little-endian bytes.

fn from_bytes_le(bytes: &[u8]) -> Result<Self, Error>

where Self: Sized,

Returns Self from a byte array in little-endian order.

impl<E: PairingEngine, SM: SNARKMode> Ord for CircuitProvingKey<E, SM>

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized + PartialOrd,

Restrict a value to a certain interval.

impl<E: PairingEngine, SM: SNARKMode> PartialEq for CircuitProvingKey<E, SM>

fn eq(&self, other: &Self) -> bool

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

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<E: PairingEngine, SM: SNARKMode> PartialOrd for CircuitProvingKey<E, SM>

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<E: PairingEngine, SM: SNARKMode> ToBytes for CircuitProvingKey<E, SM>

fn write_le<W: Write>(&self, writer: W) -> Result<()>

Writes self into writer as little-endian bytes.

fn to_bytes_le(&self) -> Result<Vec<u8>, Error>

where Self: Sized,

Returns self as a byte array in little-endian order.

impl<E: PairingEngine, SM: SNARKMode> Eq for CircuitProvingKey<E, SM>