Module poly

Contains utilities for performing arithmetic over univariate polynomials in various forms, including computing commitments to them and provably opening the committed polynomials at arbitrary points.

Modules

• commitment
  Generic commitment scheme structures
• ipa
  Inner product argument commitment scheme
• kzg
  KZG commitment scheme

Structs

• Coeff
  The polynomial is defined as coefficients
• EvaluationDomain
  This structure contains precomputed constants and other details needed for performing operations on an evaluation domain of size $2^k$ and an extended domain of size $2^{k} * j$ with $j \neq 0$.
• ExtendedLagrangeCoeff
  The polynomial is defined as coefficients of Lagrange basis polynomials in an extended size domain which supports multiplication
• LagrangeCoeff
  The polynomial is defined as coefficients of Lagrange basis polynomials
• PinnedEvaluationDomain
  Represents the minimal parameters that determine an EvaluationDomain.
• Polynomial
  Represents a univariate polynomial defined over a field and a particular basis.
• ProverQuery
  A polynomial query at a point
• Rotation
  Describes the relative rotation of a vector. Negative numbers represent reverse (leftmost) rotations and positive numbers represent forward (rightmost) rotations. Zero represents no rotation.
• VerifierQuery
  A polynomial query at a point

Enums

• Error
  This is an error that could occur during proving or circuit synthesis.

Traits

• Basis
  The basis over which a polynomial is described.
• Guard
  Guards is unfinished verification result. Implement this to construct various verification strategies such as aggregation and recursion.
• VerificationStrategy
  Trait representing a strategy for verifying Halo 2 proofs.