pub fn verify(
        &self,
        commitment: &Commitment<E>,
        &alpha: &E::Fr,
        evaluation: &E::Fr,
        proof: &EvaluationProof<E>,
    ) -> VerificationResult {
        let scalars = [(-alpha).into_bigint(), E::Fr::one().into_bigint()];
        let ep = VariableBase::msm(&self.powers_of_g2, &scalars);
        let lhs =
            commitment.0.into_projective() - self.powers_of_g[0].mul(evaluation.into_bigint());
        let g2 = self.powers_of_g2[0];

        if E::pairing(lhs, g2) == E::pairing(proof.0, ep) {
            Ok(())
        } else {
            Err(VerificationError)
        }
    }
/// The verification procedure for the EvaluationProof with a single polynomial evaluated at a single evaluation point.
/// The polynomial are evaluated at the point ``alpha`` and is committed as ``commitment``.
/// The evaluation proof can be obtained either in a space-efficient or a time-efficient flavour.
The verification procedure for the EvaluationProof with a single polynomial evaluated at a single evaluation point.
The verification procedure for the EvaluationProof with a single polynomial evaluated at a single evaluation point .
pub fn verify(
        &self,
        commitment: &Commitment<E>,
        &alpha: &E::Fr,
        evaluation: &E::Fr,
        proof: &EvaluationProof<E>,
    ) -> VerificationResult {
        let scalars = [(-alpha).into_bigint(), E::Fr::one().into_bigint()];
        let ep = VariableBase::msm(&self.powers_of_g2, &scalars);
        let lhs =
            commitment.0.into_projective() - self.powers_of_g[0].mul(evaluation.into_bigint());
        let g2 = self.powers_of_g2[0];
        if E::pairing(lhs, g2) == E::pairing(proof.0, ep) {
            Ok(())
        } else {
            Err(VerificationError)
        }
    }
pub fn verify ( & self , commitment : & Commitment < E > , & alpha : & E :: Fr , evaluation : & E :: Fr , proof : & EvaluationProof < E > , ) -> VerificationResult { let scalars = [ ( - alpha ) . into_bigint ( ) , E :: Fr :: one ( ) . into_bigint ( ) ] ; let ep = VariableBase :: msm ( & self . powers_of_g2 , & scalars ) ; let lhs = commitment . 0 . into_projective ( ) - self . powers_of_g [ 0 ] . mul ( evaluation . into_bigint ( ) ) ; let g2 = self . powers_of_g2 [ 0 ] ; if E :: pairing ( lhs , g2 ) == E :: pairing ( proof . 0 , ep ) { Ok ( ( ) ) } else { Err ( VerificationError ) } }
The verification procedure for the EvaluationProof with a single polynomial evaluated at a single evaluation point.
The verification procedure for the EvaluationProof with a single polynomial evaluated at a single evaluation point .
&self
commitment
&E::Fr
evaluation
&E::Fr
proof
&EvaluationProof<E>