Struct bellperson::groth16::aggregate::Key

pub struct Key<G: CurveAffine> {
    pub a: Vec<G>,
    pub b: Vec<G>,
}

Key is a generic commitment key that is instanciated with g and h as basis, and a and b as powers.

Fields

a: Vec<G>

Exponent is a

b: Vec<G>

Exponent is b

Implementations

impl<G> Key<G> where
    G: CurveAffine, 

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 scale(&self, s_vec: &[G::Scalar]) -> Result<Self, SynthesisError>

Returns both vectors scaled by the given vector entrywise. In other words, it returns ${v_i^{s_i}}$

pub fn split(self, at: usize) -> (Self, Self)

Returns the left and right commitment key part. It makes copy.

pub fn compress(
    &self,
    right: &Self,
    scale: &G::Scalar
) -> Result<Self, SynthesisError>

Takes a left and right commitment key and returns a commitment key $left \circ right^{scale} = (left_i*right_i^{scale} …)$. This is required step during GIPA recursion.

pub fn first(&self) -> (G, G)

Returns the first values in the vector of v1 and v2 (respectively w1 and w2). When commitment key is of size one, it’s a proxy to get the final values.

Trait Implementations

impl<G: Clone + CurveAffine> Clone for Key<G>

fn clone(&self) -> Key<G>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<G: Debug + CurveAffine> Debug for Key<G>

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

Formats the value using the given formatter.