Struct VerifyingKey

pub struct VerifyingKey<N>
where
    N: Network,
{ /* private fields */ }

Implementations

impl<N> VerifyingKey<N>

where N: Network,

pub const fn new( verifying_key: Arc<CircuitVerifyingKey<<N as Environment>::PairingCurve>>, num_variables: u64, ) -> VerifyingKey<N>

Initializes a new verifying key.

pub fn num_variables(&self) -> u64

Returns the number of constant, public, and private variables for the circuit.

pub fn verify( &self, function_name: &str, inputs: &[<N as Environment>::Field], proof: &Proof<N>, ) -> bool

Returns true if the proof is valid for the given public inputs.

pub fn verify_batch( locator: &str, inputs: Vec<(VerifyingKey<N>, Vec<Vec<<N as Environment>::Field>>)>, proof: &Proof<N>, ) -> Result<(), Error>

Returns true if the batch proof is valid for the given public inputs.

Methods from Deref<Target = CircuitVerifyingKey<<N as Environment>::PairingCurve>>

pub fn iter(&self) -> impl Iterator<Item = &KZGCommitment<E>>

Iterate over the commitments to indexed polynomials in self.

Trait Implementations

impl<N> Clone for VerifyingKey<N>

where N: Clone + Network, <N as Environment>::PairingCurve: Clone,

fn clone(&self) -> VerifyingKey<N>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<N> Debug for VerifyingKey<N>

where N: Network,

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

Formats the value using the given formatter.

impl<N> Deref for VerifyingKey<N>

where N: Network,

type Target = CircuitVerifyingKey<<N as Environment>::PairingCurve>

The resulting type after dereferencing.

fn deref(&self) -> &<VerifyingKey<N> as Deref>::Target

Dereferences the value.

impl<'de, N> Deserialize<'de> for VerifyingKey<N>

where N: Network,

fn deserialize<D>( deserializer: D, ) -> Result<VerifyingKey<N>, <D as Deserializer<'de>>::Error>

where D: Deserializer<'de>,

Deserializes the verifying key from a string or bytes.

impl<N> Display for VerifyingKey<N>

where N: Network,

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

Writes the verifying key as a bech32m string.

impl<N> FromBytes for VerifyingKey<N>

where N: Network,

fn read_le<R>(reader: R) -> Result<VerifyingKey<N>, Error>

where R: Read,

Reads the verifying key from a buffer.

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

where Self: Sized,

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

impl<N> FromStr for VerifyingKey<N>

where N: Network,

fn from_str( key: &str, ) -> Result<VerifyingKey<N>, <VerifyingKey<N> as FromStr>::Err>

Reads in the verifying key string.

type Err = Error

The associated error which can be returned from parsing.

impl<N> Parser for VerifyingKey<N>

where N: Network,

fn parse( string: &str, ) -> Result<(&str, VerifyingKey<N>), Err<VerboseError<&str>>>

Parses a string into the verifying key.

impl<N> PartialEq for VerifyingKey<N>

where N: PartialEq + Network, <N as Environment>::PairingCurve: PartialEq,

fn eq(&self, other: &VerifyingKey<N>) -> 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<N> Serialize for VerifyingKey<N>

where N: Network,

fn serialize<S>( &self, serializer: S, ) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>

where S: Serializer,

Serializes the verifying key into string or bytes.

impl<N> ToBytes for VerifyingKey<N>

where N: Network,

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

where W: Write,

Writes the verifying key to a buffer.

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

where Self: Sized,

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

impl<N> Eq for VerifyingKey<N>

where N: Eq + Network, <N as Environment>::PairingCurve: Eq,

impl<N> StructuralPartialEq for VerifyingKey<N>

where N: Network,