Struct snarkvm_algorithms::srs::universal_verifier::UniversalVerifier

pub struct UniversalVerifier<E: PairingEngine> {
    pub vk: VerifierKey<E>,
    pub prepared_negative_powers_of_beta_h: Arc<BTreeMap<usize, <E::G2Affine as PairingCurve>::Prepared>>,
}

UniversalVerifier is used to check evaluation proofs for a given commitment.

Fields

vk: VerifierKey<E>

The verification key for the underlying KZG10 scheme.

prepared_negative_powers_of_beta_h: Arc<BTreeMap<usize, <E::G2Affine as PairingCurve>::Prepared>>

Information required to enforce degree bounds. Each pair is of the form (degree_bound, shifting_advice). Each pair is in the form (degree_bound, \beta^{max_degree - i} H), where H is the generator of G2, and i is of the form 2^k - 1 for k in 1 to log_2(max_degree).

Trait Implementations

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

fn clone(&self) -> UniversalVerifier<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 UniversalVerifier<E>where E::G2Affine: Debug,

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

Formats the value using the given formatter.

impl<E: Default + PairingEngine> Default for UniversalVerifier<E>where E::G2Affine: Default,

fn default() -> UniversalVerifier<E>

Returns the “default value” for a type.

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

fn eq(&self, other: &UniversalVerifier<E>) -> 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: Eq + PairingEngine> Eq for UniversalVerifier<E>where E::G2Affine: Eq,

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

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