pub fn create_proof<C: CurveAffine, E: EncodedChallenge<C>, R: RngCore, T: TranscriptWrite<C, E>>(
params: &ParamsIPA<C>,
rng: R,
transcript: &mut T,
p_poly: &Polynomial<C::Scalar, Coeff>,
p_blind: Blind<C::Scalar>,
x_3: C::Scalar,
) -> Result<()>
Expand description
Create a polynomial commitment opening proof for the polynomial defined
by the coefficients px
, the blinding factor blind
used for the
polynomial commitment, and the point x
that the polynomial is
evaluated at.
This function will panic if the provided polynomial is too large with respect to the polynomial commitment parameters.
Important: This function assumes that the provided transcript
has
already seen the common inputs: the polynomial commitment P, the claimed
opening v, and the point x. It’s probably also nice for the transcript
to have seen the elliptic curve description and the URS, if you want to
be rigorous.