Struct snarkvm_algorithms::snark::marlin::Proof
source · pub struct Proof<E: PairingEngine> {
pub commitments: Commitments<E>,
pub evaluations: Evaluations<E::Fr>,
pub msg: ThirdMessage<E::Fr>,
pub pc_proof: BatchLCProof<E>,
/* private fields */
}
Expand description
A zkSNARK proof.
Fields§
§commitments: Commitments<E>
Commitments to prover polynomials.
evaluations: Evaluations<E::Fr>
Evaluations of some of the committed polynomials.
msg: ThirdMessage<E::Fr>
Prover message: sum_a, sum_b, sum_c for each instance
pc_proof: BatchLCProof<E>
An evaluation proof from the polynomial commitment.
Implementations§
source§impl<E: PairingEngine> Proof<E>
impl<E: PairingEngine> Proof<E>
sourcepub fn new(
batch_sizes: BTreeMap<CircuitId, usize>,
commitments: Commitments<E>,
evaluations: Evaluations<E::Fr>,
msg: ThirdMessage<E::Fr>,
pc_proof: BatchLCProof<E>
) -> Result<Self, SNARKError>
pub fn new( batch_sizes: BTreeMap<CircuitId, usize>, commitments: Commitments<E>, evaluations: Evaluations<E::Fr>, msg: ThirdMessage<E::Fr>, pc_proof: BatchLCProof<E> ) -> Result<Self, SNARKError>
Construct a new proof.
pub fn batch_sizes(&self) -> Result<&[usize], SNARKError>
Trait Implementations§
source§impl<E: PairingEngine> CanonicalDeserialize for Proof<E>
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,
source§impl<E: PairingEngine> CanonicalSerialize for Proof<E>
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
source§impl<E: PairingEngine> FromBytes for Proof<E>
impl<E: PairingEngine> FromBytes for Proof<E>
source§impl<E: PartialEq + PairingEngine> PartialEq<Proof<E>> for Proof<E>where
E::Fr: PartialEq,
impl<E: PartialEq + PairingEngine> PartialEq<Proof<E>> for Proof<E>where E::Fr: PartialEq,
source§impl<E: PairingEngine> ToBytes for Proof<E>
impl<E: PairingEngine> ToBytes for Proof<E>
source§impl<E: PairingEngine> Valid for Proof<E>
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> StructuralEq for Proof<E>
impl<E: PairingEngine> StructuralPartialEq for Proof<E>
Auto Trait Implementations§
impl<E> RefUnwindSafe for Proof<E>where <E as PairingEngine>::Fr: RefUnwindSafe, <E as PairingEngine>::G1Affine: RefUnwindSafe,
impl<E> Send for Proof<E>
impl<E> Sync for Proof<E>
impl<E> Unpin for Proof<E>where <E as PairingEngine>::Fr: Unpin, <E as PairingEngine>::G1Affine: Unpin,
impl<E> UnwindSafe for Proof<E>where <E as PairingEngine>::Fr: UnwindSafe, <E as PairingEngine>::G1Affine: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.