Expand description
IPA polynomial commitment scheme.
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§
Structs§
- Challenges
- Commitment round challenges (endo mapped) and their inverses.
- Opening
Proof - SRS
Functions§
- endos
- Computes the endomorphism coefficients (ξ, λ) for a curve.
- point_
of_ 🔒random_ bytes