I needed polynomial-related machinery (to sample polynomials, evaluate them, etc.), and it was already implemented as part of feldman_vss. I moved polynomial-related logic into dedicated struct Polynomial (and well-documented it). Functions in feldman_vss are still available, but got deprecated and now they use Polynomial under hood.
PR adds low degree exponent interpolation proof. Here's construction:
I needed polynomial-related machinery (to sample polynomials, evaluate them, etc.), and it was already implemented as part of feldman_vss. I moved polynomial-related logic into dedicated struct
Polynomial
(and well-documented it). Functions in feldman_vss are still available, but got deprecated and now they usePolynomial
under hood.