pub type ProverProof<F> = ProverProof<<F as FieldWitness>::OtherCurve, OpeningProof<<F as FieldWitness>::OtherCurve>>;
Aliased Type§
pub struct ProverProof<F> {
pub commitments: ProverCommitments<<F as FieldWitness>::OtherCurve>,
pub proof: OpeningProof<<F as FieldWitness>::OtherCurve>,
pub evals: ProofEvaluations<PointEvaluations<Vec<<<F as FieldWitness>::OtherCurve as AffineCurve>::ScalarField>>>,
pub ft_eval1: <<F as FieldWitness>::OtherCurve as AffineCurve>::ScalarField,
pub prev_challenges: Vec<RecursionChallenge<<F as FieldWitness>::OtherCurve>>,
}
Fields§
§commitments: ProverCommitments<<F as FieldWitness>::OtherCurve>
All the polynomial commitments required in the proof
proof: OpeningProof<<F as FieldWitness>::OtherCurve>
batched commitment opening proof
evals: ProofEvaluations<PointEvaluations<Vec<<<F as FieldWitness>::OtherCurve as AffineCurve>::ScalarField>>>
Two evaluations over a number of committed polynomials
ft_eval1: <<F as FieldWitness>::OtherCurve as AffineCurve>::ScalarField
Required evaluation for Maller’s optimization
prev_challenges: Vec<RecursionChallenge<<F as FieldWitness>::OtherCurve>>
The challenges underlying the optional polynomials folded into the proof