1use crate::prelude::*;
  2use algebra::{Field, PairingEngine};
  3use r1cs_core::{ConstraintSystem, SynthesisError};
  4use std::fmt::Debug;
  5
  6pub mod bls12;
  7pub use self::bls12::bls12_377;
  8
  9pub trait PairingGadget<PairingE: PairingEngine, ConstraintF: Field> {
 10    type G1Gadget: GroupGadget<PairingE::G1Projective, ConstraintF>;
 11    type G2Gadget: GroupGadget<PairingE::G2Projective, ConstraintF>;
 12    type G1PreparedGadget: ToBytesGadget<ConstraintF> + Clone + Debug;
 13    type G2PreparedGadget: ToBytesGadget<ConstraintF> + Clone + Debug;
 14    type GTGadget: FieldGadget<PairingE::Fqk, ConstraintF> + Clone;
 15
 16    fn miller_loop<CS: ConstraintSystem<ConstraintF>>(
 17        cs: CS,
 18        p: &[Self::G1PreparedGadget],
 19        q: &[Self::G2PreparedGadget],
 20    ) -> Result<Self::GTGadget, SynthesisError>;
 21
 22    fn final_exponentiation<CS: ConstraintSystem<ConstraintF>>(
 23        cs: CS,
 24        p: &Self::GTGadget,
 25    ) -> Result<Self::GTGadget, SynthesisError>;
 26
 27    fn pairing<CS: ConstraintSystem<ConstraintF>>(
 28        mut cs: CS,
 29        p: Self::G1PreparedGadget,
 30        q: Self::G2PreparedGadget,
 31    ) -> Result<Self::GTGadget, SynthesisError> {
 32        let tmp = Self::miller_loop(cs.ns(|| "miller loop"), &[p], &[q])?;
 33        Self::final_exponentiation(cs.ns(|| "final_exp"), &tmp)
 34    }
 35
 36    /// Computes a product of pairings.
 37    #[must_use]
 38    fn product_of_pairings<CS: ConstraintSystem<ConstraintF>>(
 39        mut cs: CS,
 40        p: &[Self::G1PreparedGadget],
 41        q: &[Self::G2PreparedGadget],
 42    ) -> Result<Self::GTGadget, SynthesisError> {
 43        let miller_result = Self::miller_loop(&mut cs.ns(|| "Miller loop"), p, q)?;
 44        Self::final_exponentiation(&mut cs.ns(|| "Final Exp"), &miller_result)
 45    }
 46
 47    fn prepare_g1<CS: ConstraintSystem<ConstraintF>>(
 48        cs: CS,
 49        q: &Self::G1Gadget,
 50    ) -> Result<Self::G1PreparedGadget, SynthesisError>;
 51
 52    fn prepare_g2<CS: ConstraintSystem<ConstraintF>>(
 53        cs: CS,
 54        q: &Self::G2Gadget,
 55    ) -> Result<Self::G2PreparedGadget, SynthesisError>;
 56}
 57
 58#[cfg(test)]
 59mod test {
 60    // use rand;
 61    use crate::test_constraint_system::TestConstraintSystem;
 62    use algebra::{BitIterator, Field};
 63    use algebra::One;
 64    use r1cs_core::ConstraintSystem;
 65
 66    #[test]
 67    fn bls12_377_gadget_bilinearity_test() {
 68        use algebra::{
 69            fields::{
 70                bls12_377::{fq::Fq, fr::Fr},
 71                PrimeField,
 72            },
 73            PairingEngine, ProjectiveCurve,
 74        };
 75
 76        use super::bls12_377::PairingGadget;
 77        use crate::{
 78            groups::bls12::bls12_377::{G1Gadget, G1PreparedGadget, G2Gadget, G2PreparedGadget},
 79            pairing::PairingGadget as _,
 80            prelude::*,
 81        };
 82        use algebra::curves::bls12_377::{Bls12_377, G1Projective, G2Projective};
 83        use std::ops::Mul;
 84
 85        let mut cs = TestConstraintSystem::<Fq>::new();
 86
 87        // let a: G1Projective = rand::random();
 88        // let b: G2Projective = rand::random();
 89        // let s: Fr = rand::random();
 90
 91        let a: G1Projective = G1Projective::prime_subgroup_generator();
 92        let b: G2Projective = G2Projective::prime_subgroup_generator();
 93        let s: Fr = Fr::one() + &Fr::one();
 94
 95        let sa = a.mul(&s);
 96        let sb = b.mul(&s);
 97
 98        let a_g = G1Gadget::alloc(&mut cs.ns(|| "a"), || Ok(a)).unwrap();
 99        let b_g = G2Gadget::alloc(&mut cs.ns(|| "b"), || Ok(b)).unwrap();
100        let sa_g = G1Gadget::alloc(&mut cs.ns(|| "sa"), || Ok(sa)).unwrap();
101        let sb_g = G2Gadget::alloc(&mut cs.ns(|| "sb"), || Ok(sb)).unwrap();
102
103        let a_prep_g = G1PreparedGadget::from_affine(&mut cs.ns(|| "a_prep"), &a_g).unwrap();
104        let b_prep_g = G2PreparedGadget::from_affine(&mut cs.ns(|| "b_prep"), &b_g).unwrap();
105
106        let sa_prep_g = G1PreparedGadget::from_affine(&mut cs.ns(|| "sa_prep"), &sa_g).unwrap();
107        let sb_prep_g = G2PreparedGadget::from_affine(&mut cs.ns(|| "sb_prep"), &sb_g).unwrap();
108
109        let (ans1_g, ans1_n) = {
110            let ans_g = PairingGadget::pairing(
111                cs.ns(|| "pair(sa, b)"),
112                sa_prep_g,
113                b_prep_g.clone(),
114            )
115            .unwrap();
116            let ans_n = Bls12_377::pairing(sa, b);
117            (ans_g, ans_n)
118        };
119
120        let (ans2_g, ans2_n) = {
121            let ans_g = PairingGadget::pairing(
122                cs.ns(|| "pair(a, sb)"),
123                a_prep_g.clone(),
124                sb_prep_g,
125            )
126            .unwrap();
127            let ans_n = Bls12_377::pairing(a, sb);
128            (ans_g, ans_n)
129        };
130
131        let (ans3_g, ans3_n) = {
132            let s_iter = BitIterator::new(s.into_repr())
133                .map(Boolean::constant)
134                .collect::<Vec<_>>();
135
136            let mut ans_g =
137                PairingGadget::pairing(cs.ns(|| "pair(a, b)"), a_prep_g, b_prep_g)
138                    .unwrap();
139            let mut ans_n = Bls12_377::pairing(a, b);
140            ans_n = ans_n.pow(s.into_repr());
141            ans_g = ans_g.pow(cs.ns(|| "pow"), &s_iter).unwrap();
142
143            (ans_g, ans_n)
144        };
145
146        assert_eq!(ans1_n, ans2_n, "Failed ans1_native == ans2_native");
147        assert_eq!(ans2_n, ans3_n, "Failed ans2_native == ans3_native");
148        assert_eq!(
149            ans1_g.get_value(),
150            ans3_g.get_value(),
151            "Failed ans1 == ans3"
152        );
153        assert_eq!(
154            ans1_g.get_value(),
155            ans2_g.get_value(),
156            "Failed ans1 == ans2"
157        );
158        assert_eq!(
159            ans2_g.get_value(),
160            ans3_g.get_value(),
161            "Failed ans2 == ans3"
162        );
163
164        ans1_g
165            .enforce_equal(&mut cs.ns(|| "ans1 == ans2?"), &ans2_g)
166            .unwrap();
167        ans2_g
168            .enforce_equal(&mut cs.ns(|| "ans2 == ans3?"), &ans3_g)
169            .unwrap();
170
171        assert_eq!(ans1_g.get_value().unwrap(), ans1_n, "Failed native test 1");
172        assert_eq!(ans2_g.get_value().unwrap(), ans2_n, "Failed native test 2");
173        assert_eq!(ans3_g.get_value().unwrap(), ans3_n, "Failed native test 3");
174
175        if !cs.is_satisfied() {
176            println!("Unsatisfied: {:?}", cs.which_is_unsatisfied());
177        }
178
179        assert!(cs.is_satisfied(), "cs is not satisfied");
180    }
181}