Struct legogroth16::aggregation::srs::ProverSRS

pub struct ProverSRS<E: Pairing> {
    pub n: u32,
    pub g_alpha_powers_table: Vec<E::G1Affine>,
    pub h_alpha_powers_table: Vec<E::G2Affine>,
    pub g_beta_powers_table: Vec<E::G1Affine>,
    pub h_beta_powers_table: Vec<E::G2Affine>,
    pub vkey: VKey<E>,
    pub wkey: WKey<E>,
}

ProverSRS is the specialized SRS version for the prover for a specific number of proofs to aggregate. It contains as well the commitment keys for this specific size. Note the size must be a power of two for the moment - if it is not, padding must be applied.

Fields

n: u32

number of proofs to aggregate

g_alpha_powers_table: Vec<E::G1Affine>

${g^a^i}_{i=0}^{2n-1}$ where n is the number of proofs to be aggregated We take all powers instead of only ones from n -> 2n-1 (w commitment key is formed from these powers) since the prover will create a shifted polynomial of degree 2n-1 when doing the KZG opening proof.

h_alpha_powers_table: Vec<E::G2Affine>

${h^a^i}_{i=0}^{n-1}$ - here we don’t need to go to 2n-1 since v commitment key only goes up to n-1 exponent.

g_beta_powers_table: Vec<E::G1Affine>

${g^b^i}_{i=0}^{2n-1}$

h_beta_powers_table: Vec<E::G2Affine>

${h^b^i}_{i=0}^{n-1}$

vkey: VKey<E>

commitment key using in MIPP and TIPP

wkey: WKey<E>

commitment key using in TIPP

Implementations

impl<E: Pairing> ProverSRS<E>

pub fn has_correct_len(&self, n: usize) -> bool

Returns true if commitment keys have the exact required length. It is necessary for the IPP scheme to work that commitment key have the exact same number of arguments as the number of proofs to aggregate.

pub fn len(&self) -> usize

Trait Implementations

impl<E: Pairing> CanonicalDeserialize for ProverSRS<E>

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

The general deserialize method that takes in customization flags.

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: Pairing> CanonicalSerialize for ProverSRS<E>

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

The general serialize method that takes in customization flags.

fn serialized_size(&self, compress: 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 + Pairing> Clone for ProverSRS<E>

where E::G1Affine: Clone, E::G2Affine: Clone,

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<E: Debug + Pairing> Debug for ProverSRS<E>

where E::G1Affine: Debug, E::G2Affine: Debug,

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

Formats the value using the given formatter.

impl<E: Pairing> From<ProverSRS<E>> for PreparedProverSRS<E>

fn from(srs: ProverSRS<E>) -> Self

Converts to this type from the input type.

impl<E: PartialEq + Pairing> PartialEq for ProverSRS<E>

where E::G1Affine: PartialEq, E::G2Affine: PartialEq,

fn eq(&self, other: &ProverSRS<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: Pairing> Valid for ProverSRS<E>

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

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

where Self: 'a,

impl<E: Pairing> StructuralPartialEq for ProverSRS<E>