Struct ark_gm17::data_structures::ProvingKey

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

Full public (prover and verifier) parameters for the GM17 zkSNARK.

Trait Implementations

impl<E: PairingEngine> CanonicalDeserialize for ProvingKey<E>

fn deserialize<R: Read>(reader: R) -> Result<Self, SerializationError>

Reads Self from reader.

fn deserialize_uncompressed<R: Read>(
    reader: R
) -> Result<Self, SerializationError>

Reads Self from reader without compression.

fn deserialize_unchecked<R: Read>(reader: R) -> Result<Self, SerializationError>

Reads self from reader without compression, and without performing validity checks. Should be used only when the input is trusted.

impl<E: PairingEngine> CanonicalSerialize for ProvingKey<E>

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

Serializes self into writer. It is left up to a particular type for how it strikes the serialization efficiency vs compression tradeoff. For standard types (e.g. bool, lengths, etc.) typically an uncompressed form is used, whereas for algebraic types compressed forms are used.

fn serialized_size(&self) -> usize

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

Serializes self into writer without compression.

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

Serializes self into writer without compression, and without performing validity checks. Should be used only when there is no danger of adversarial manipulation of the output.

fn uncompressed_size(&self) -> usize

impl<E: Clone + PairingEngine> Clone for ProvingKey<E> where
    E::G1Affine: Clone,
    E::G2Affine: Clone,
    E::G1Affine: Clone,
    E::G1Affine: Clone,
    E::G1Affine: Clone,
    E::G2Affine: Clone,
    E::G1Affine: Clone,
    E::G1Affine: Clone,
    E::G1Affine: Clone, 

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<E: Eq + PairingEngine> Eq for ProvingKey<E> where
    E::G1Affine: Eq,
    E::G2Affine: Eq,
    E::G1Affine: Eq,
    E::G1Affine: Eq,
    E::G1Affine: Eq,
    E::G2Affine: Eq,
    E::G1Affine: Eq,
    E::G1Affine: Eq,
    E::G1Affine: Eq, 

impl<E: PartialEq + PairingEngine> PartialEq<ProvingKey<E>> for ProvingKey<E> where
    E::G1Affine: PartialEq,
    E::G2Affine: PartialEq,
    E::G1Affine: PartialEq,
    E::G1Affine: PartialEq,
    E::G1Affine: PartialEq,
    E::G2Affine: PartialEq,
    E::G1Affine: PartialEq,
    E::G1Affine: PartialEq,
    E::G1Affine: PartialEq, 

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

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

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

This method tests for !=.

impl<E: PairingEngine> StructuralEq for ProvingKey<E>

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