Module poly_commitment::ipa

This module contains the implementation of the polynomial commitment scheme called the Inner Product Argument (IPA) as described in Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting

Modules

• caml

Structs

• Challenges
  Commitment round challenges (endo mapped) and their inverses.
• OpeningProof
• SRS

Enums

• DensePolynomialOrEvaluations
  Represent a polynomial either with its coefficients or its evaluations

Functions

• combine_polys
  Combine the polynomials using a scalar (polyscale), creating a single unified polynomial to open. This function also accepts polynomials in evaluations form. In this case it applies an IFFT, and, if necessarry, applies chunking to it (ie. split it in multiple polynomials of degree less than the SRS size). Parameters:
• endos