saymrwulf/pasta_curves-source
1
0
Fork 0
mirror of https://github.com/saymrwulf/pasta_curves-source.git synced 2026-09-05 20:10:32 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

Return MSM from PLONK verifier

Browse source
This commit is contained in:
therealyingtong 2020-09-13 23:10:06 +08:00
parent c264208a03
commit 1eb2a36086
No known key found for this signature in database
GPG key ID: 179F32A1503D607E
2 changed files with 11 additions and 8 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

5
src/plonk.rs
View file

@ -346,6 +346,9 @@ fn test_proving() {
.expect("proof generation should not fail"); .expect("proof generation should not fail");
let msm_default = params.empty_msm(); let msm_default = params.empty_msm();
assert!(proof.verify::<DummyHash<Fq>, DummyHash<Fp>>(&params, &srs, msm_default)); let msm = proof
.verify::<DummyHash<Fq>, DummyHash<Fp>>(&params, &srs, msm_default)
.unwrap();
assert!(msm.is_zero())
} }
} }

14
src/plonk/verifier.rs
View file

@ -1,4 +1,4 @@
use super::{hash_point, Proof, SRS}; use super::{hash_point, Error, Proof, SRS};
use crate::arithmetic::{get_challenge_scalar, Challenge, Curve, CurveAffine, Field}; use crate::arithmetic::{get_challenge_scalar, Challenge, Curve, CurveAffine, Field};
use crate::poly::{ use crate::poly::{
commitment::{Params, MSM}, commitment::{Params, MSM},
@ -6,14 +6,14 @@ use crate::poly::{
}; };
use crate::transcript::Hasher; use crate::transcript::Hasher;
impl<C: CurveAffine> Proof<C> { impl<'a, C: CurveAffine> Proof<C> {
/// Returns a boolean indicating whether or not the proof is valid /// Returns a boolean indicating whether or not the proof is valid
pub fn verify<HBase: Hasher<C::Base>, HScalar: Hasher<C::Scalar>>( pub fn verify<HBase: Hasher<C::Base>, HScalar: Hasher<C::Scalar>>(
&self, &self,
params: &Params<C>, params: &'a Params<C>,
srs: &SRS<C>, srs: &SRS<C>,
msm: MSM<C>, msm: MSM<'a, C>,
) -> bool { ) -> Result<MSM<'a, C>, Error> {
// Create a transcript for obtaining Fiat-Shamir challenges. // Create a transcript for obtaining Fiat-Shamir challenges.
let mut transcript = HBase::init(C::Base::one()); let mut transcript = HBase::init(C::Base::one());
@ -137,7 +137,7 @@ impl<C: CurveAffine> Proof<C> {
} }
if h_eval != (expected_h_eval * &(x_3n - &C::Scalar::one())) { if h_eval != (expected_h_eval * &(x_3n - &C::Scalar::one())) {
return false; return Err(Error::ConstraintSystemFailure);
} }
// We are now convinced the circuit is satisfied so long as the // We are now convinced the circuit is satisfied so long as the
@ -279,6 +279,6 @@ impl<C: CurveAffine> Proof<C> {
let msm_challenges = guard.use_challenges(); let msm_challenges = guard.use_challenges();
msm_challenges.is_zero() Ok(msm_challenges)
} }
} }