Struct Proof

pub struct Proof<E: PairingEngine> {
    pub commitments: Commitments<E>,
    pub evaluations: Evaluations<E::Fr>,
    pub third_msg: ThirdMessage<E::Fr>,
    pub fourth_msg: FourthMessage<E::Fr>,
    pub pc_proof: BatchLCProof<E>,
    /* private fields */
}

A zkSNARK proof.

Fields

commitments: Commitments<E>

Commitments to prover polynomials.

evaluations: Evaluations<E::Fr>

Evaluations of some of the committed polynomials.

third_msg: ThirdMessage<E::Fr>

Prover message: sum_a, sum_b, sum_c for each instance

fourth_msg: FourthMessage<E::Fr>

Prover message: sum_a, sum_b, sum_c for each circuit

pc_proof: BatchLCProof<E>

An evaluation proof from the polynomial commitment.

Implementations

impl<E: PairingEngine> Proof<E>

pub fn new( batch_sizes: BTreeMap<CircuitId, usize>, commitments: Commitments<E>, evaluations: Evaluations<E::Fr>, third_msg: ThirdMessage<E::Fr>, fourth_msg: FourthMessage<E::Fr>, pc_proof: BatchLCProof<E>, ) -> Result<Self, SNARKError>

Construct a new proof.

pub fn is_hiding(&self) -> bool

pub fn batch_sizes(&self) -> &[usize]

pub fn check_batch_sizes(&self) -> Result<(), SNARKError>

Check that the number of messages is consistent with our batch size

Trait Implementations

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

fn deserialize_with_mode<R: Read>( reader: R, compress: Compress, validate: Validate, ) -> Result<Self, SerializationError>

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

where R: Read,

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

where R: Read,

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

where R: Read,

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

where R: Read,

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

fn serialize_with_mode<W: Write>( &self, writer: W, compress: Compress, ) -> Result<(), SerializationError>

fn serialized_size(&self, mode: Compress) -> usize

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

where W: Write,

fn compressed_size(&self) -> usize

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

where W: Write,

fn uncompressed_size(&self) -> usize

impl<E: Clone + PairingEngine> Clone for Proof<E>

where E::Fr: Clone,

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<E: Debug + PairingEngine> Debug for Proof<E>

where E::Fr: Debug,

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

Formats the value using the given formatter.

impl<E: PairingEngine> FromBytes for Proof<E>

fn read_le<R: Read>(r: 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: PartialEq + PairingEngine> PartialEq for Proof<E>

where E::Fr: PartialEq,

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl<E: PairingEngine> ToBytes for Proof<E>

fn write_le<W: Write>(&self, w: 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> Valid for Proof<E>

fn check(&self) -> Result<(), SerializationError>

fn batch_check<'a>( batch: impl Iterator<Item = &'a Self> + Send, ) -> Result<(), SerializationError>

where Self: 'a,

impl<E: Eq + PairingEngine> Eq for Proof<E>

where E::Fr: Eq,

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