Method verify

smc_range_proof/src/ccs_range_proof/perfect_range.rs:178–203

Verify the proof for `0 <= value < max` where `commitment` is a Pedersen commitment to `value`

(
        &self,
        commitment: &E::G1Affine,
        challenge: &E::ScalarField,
        max: u64,
        comm_key: &MemberCommitmentKey<E::G1Affine>,
        params: impl Into<SetMembershipChe

impl<E: Pairing> CCSPerfectRangeProof<E> {
    /// Verify the proof for `0 <= value < max` where `commitment` is a Pedersen commitment to `value`
    pub fn verify(
        &self,
        commitment: &E::G1Affine,
        challenge: &E::ScalarField,
        max: u64,
        comm_key: &MemberCommitmentKey<E::G1Affine>,
        params: impl Into<SetMembershipCheckParamsWithPairing<E>>,
    ) -> Result<(), SmcRangeProofError> {
        let params = params.into();
        self.verify_except_pairings(commitment, challenge, max, comm_key, &params)?;

        let (yc_sigma, lhs) = self.compute_for_pairing_check(challenge, &params);
        if cfg_into_iter!(0..self.V.len())
            .map(|i| {
                let rhs = E::pairing(
                    E::G1Prepared::from(self.V[i]),
                    E::G2Prepared::from(yc_sigma[i]),
                );
                lhs[i] == rhs
            })
            .any(|r| r == false)
        {
            return Err(SmcRangeProofError::InvalidRangeProof);
        }
        Ok(())
    }

    /// Verify the proof for `0 <= value < max` where `commitment` is a Pedersen commitment to `value`
    pub fn verify_given_randomized_pairing_checker(