Struct KZGProof 

pub struct KZGProof<Pair: Pairing> {
    pub quotient: Pair::G1Affine,
    pub blinding: <Pair::G1Affine as AffineRepr>::ScalarField,
}

Fields

quotient: Pair::G1Affine

blinding: <Pair::G1Affine as AffineRepr>::ScalarField

A blinding factor used to hide the polynomial, if necessary

Implementations

impl<F: PrimeField, G: CommitmentCurve<ScalarField = F>, G2: CommitmentCurve<ScalarField = F>, Pair: Pairing<G1Affine = G, G2Affine = G2>> KZGProof<Pair>

pub fn create<D: EvaluationDomain<F>>( srs: &PairingSRS<Pair>, plnms: &'_ [(DensePolynomialOrEvaluations<'_, G::ScalarField, D>, PolyComm<G::ScalarField>)], elm: &[F], polyscale: F, ) -> Option<Self>

Create a KZG proof. Parameters:

• srs: the structured reference string used to commit to the polynomials
• plnms: the list of polynomials to open. The type is simply an alias to handle the polynomials in evaluations or coefficients forms.
• elm: vector of evaluation points. Note that it only works for two elements for now.
• polyscale: a challenge to batch the polynomials.

pub fn verify( &self, srs: &PairingSRS<Pair>, evaluations: &[Evaluation<G>], polyscale: F, elm: &[F], ) -> bool

Verify a proof. Note that it only works for two elements for now, i.e. elm must be of size 2. Also, chunking is not supported.

Trait Implementations

impl<Pair: Pairing> Clone for KZGProof<Pair>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<Pair: Debug + Pairing> Debug for KZGProof<Pair>

where Pair::G1Affine: Debug,

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

Formats the value using the given formatter.

impl<Pair: Pairing> Default for KZGProof<Pair>

fn default() -> Self

Returns the “default value” for a type.

impl<'de, Pair: Pairing> Deserialize<'de> for KZGProof<Pair>

where Pair::G1Affine: CanonicalDeserialize + CanonicalSerialize,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<F: PrimeField, G: CommitmentCurve<ScalarField = F>, G2: CommitmentCurve<ScalarField = F>, Pair: Pairing<G1Affine = G, G2Affine = G2>> OpenProof<G> for KZGProof<Pair>

fn open<EFqSponge, RNG, D: EvaluationDomain<F>>( srs: &Self::SRS, _group_map: &<G as CommitmentCurve>::Map, plnms: &'_ [(DensePolynomialOrEvaluations<'_, G::ScalarField, D>, PolyComm<G::ScalarField>)], elm: &[<G as AffineRepr>::ScalarField], polyscale: <G as AffineRepr>::ScalarField, _evalscale: <G as AffineRepr>::ScalarField, _sponge: EFqSponge, _rng: &mut RNG, ) -> Self

where EFqSponge: Clone + FqSponge<<G as AffineRepr>::BaseField, G, F>, RNG: RngCore + CryptoRng,

Parameters:

• srs: the structured reference string
• plnms: vector of polynomials with optional degree bound and commitment randomness
• elm: vector of evaluation points
• polyscale: scaling factor for polynoms group_maps, sponge, rng and evalscale are not used. The parameters are kept to fit the trait and to be used generically.

type SRS = PairingSRS<Pair>

fn verify<EFqSponge, RNG>( srs: &Self::SRS, _group_map: &G::Map, batch: &mut [BatchEvaluationProof<'_, G, EFqSponge, Self>], _rng: &mut RNG, ) -> bool

where EFqSponge: FqSponge<G::BaseField, G, F>, RNG: RngCore + CryptoRng,

Verify the opening proof

impl<Pair: Pairing> Serialize for KZGProof<Pair>

where Pair::G1Affine: CanonicalDeserialize + CanonicalSerialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.