ark-curves-cherry-picked/curve-constraint-tests/src/lib.rs
curve-constraint-tests/src/lib.rsRaw
1#![macro_use]
2extern crate ark_relations;
3
4pub mod fields {
5 use ark_ff::{BitIteratorLE, Field, UniformRand};
6 use ark_r1cs_std::prelude::*;
7 use ark_relations::r1cs::{ConstraintSystem, SynthesisError};
8 use ark_std::test_rng;
9 use ark_std::vec::Vec;
10
11 pub fn field_test<F, ConstraintF, AF>() -> Result<(), SynthesisError>
12 where
13 F: Field,
14 ConstraintF: Field,
15 AF: FieldVar<F, ConstraintF>,
16 AF: TwoBitLookupGadget<ConstraintF, TableConstant = F>,
17 for<'a> &'a AF: FieldOpsBounds<'a, F, AF>,
18 {
19 let modes = [
20 AllocationMode::Input,
21 AllocationMode::Witness,
22 AllocationMode::Constant,
23 ];
24 for &mode in &modes {
25 let cs = ConstraintSystem::<ConstraintF>::new_ref();
26
27 let mut rng = test_rng();
28 let a_native = F::rand(&mut rng);
29 let b_native = F::rand(&mut rng);
30 let a = AF::new_variable(ark_relations::ns!(cs, "generate_a"), || Ok(a_native), mode)?;
31 let b = AF::new_variable(ark_relations::ns!(cs, "generate_b"), || Ok(b_native), mode)?;
32 let b_const = AF::new_constant(ark_relations::ns!(cs, "b_as_constant"), b_native)?;
33
34 let zero = AF::zero();
35 let zero_native = zero.value()?;
36 zero.enforce_equal(&zero)?;
37
38 let one = AF::one();
39 let one_native = one.value()?;
40 one.enforce_equal(&one)?;
41
42 one.enforce_not_equal(&zero)?;
43
44 let one_dup = &zero + &one;
45 one_dup.enforce_equal(&one)?;
46
47 let two = &one + &one;
48 two.enforce_equal(&two)?;
49 two.enforce_equal(&one.double()?)?;
50 two.enforce_not_equal(&one)?;
51 two.enforce_not_equal(&zero)?;
52
53 // a + 0 = a
54 let a_plus_zero = &a + &zero;
55 assert_eq!(a_plus_zero.value()?, a_native);
56 a_plus_zero.enforce_equal(&a)?;
57 a_plus_zero.enforce_not_equal(&a.double()?)?;
58
59 // a - 0 = a
60 let a_minus_zero = &a - &zero;
61 assert_eq!(a_minus_zero.value()?, a_native);
62 a_minus_zero.enforce_equal(&a)?;
63
64 // a - a = 0
65 let a_minus_a = &a - &a;
66 assert_eq!(a_minus_a.value()?, zero_native);
67 a_minus_a.enforce_equal(&zero)?;
68
69 // a + b = b + a
70 let a_b = &a + &b;
71 let b_a = &b + &a;
72 assert_eq!(a_b.value()?, a_native + &b_native);
73 a_b.enforce_equal(&b_a)?;
74
75 // (a + b) + a = a + (b + a)
76 let ab_a = &a_b + &a;
77 let a_ba = &a + &b_a;
78 assert_eq!(ab_a.value()?, a_native + &b_native + &a_native);
79 ab_a.enforce_equal(&a_ba)?;
80
81 let b_times_a_plus_b = &a_b * &b;
82 let b_times_b_plus_a = &b_a * &b;
83 assert_eq!(
84 b_times_a_plus_b.value()?,
85 b_native * &(b_native + &a_native)
86 );
87 assert_eq!(
88 b_times_a_plus_b.value()?,
89 (b_native + &a_native) * &b_native
90 );
91 assert_eq!(
92 b_times_a_plus_b.value()?,
93 (a_native + &b_native) * &b_native
94 );
95 b_times_b_plus_a.enforce_equal(&b_times_a_plus_b)?;
96
97 // a * 1 = a
98 assert_eq!((&a * &one).value()?, a_native * &one_native);
99
100 // a * b = b * a
101 let ab = &a * &b;
102 let ba = &b * &a;
103 assert_eq!(ab.value()?, ba.value()?);
104 assert_eq!(ab.value()?, a_native * &b_native);
105
106 let ab_const = &a * &b_const;
107 let b_const_a = &b_const * &a;
108 assert_eq!(ab_const.value()?, b_const_a.value()?);
109 assert_eq!(ab_const.value()?, ab.value()?);
110 assert_eq!(ab_const.value()?, a_native * &b_native);
111
112 // (a * b) * a = a * (b * a)
113 let ab_a = &ab * &a;
114 let a_ba = &a * &ba;
115 assert_eq!(ab_a.value()?, a_ba.value()?);
116 assert_eq!(ab_a.value()?, a_native * &b_native * &a_native);
117
118 let aa = &a * &a;
119 let a_squared = a.square()?;
120 a_squared.enforce_equal(&aa)?;
121 assert_eq!(aa.value()?, a_squared.value()?);
122 assert_eq!(aa.value()?, a_native.square());
123
124 let aa = &a * a_native;
125 a_squared.enforce_equal(&aa)?;
126 assert_eq!(aa.value()?, a_squared.value()?);
127 assert_eq!(aa.value()?, a_native.square());
128
129 let a_b2 = &a + b_native;
130 a_b.enforce_equal(&a_b2)?;
131 assert_eq!(a_b.value()?, a_b2.value()?);
132
133 let a_inv = a.inverse()?;
134 a_inv.mul_equals(&a, &one)?;
135 assert_eq!(a_inv.value()?, a.value()?.inverse().unwrap());
136 assert_eq!(a_inv.value()?, a_native.inverse().unwrap());
137
138 let a_b_inv = a.mul_by_inverse(&b)?;
139 a_b_inv.mul_equals(&b, &a)?;
140 assert_eq!(a_b_inv.value()?, a_native * b_native.inverse().unwrap());
141
142 // a * a * a = a^3
143 let bits = BitIteratorLE::without_trailing_zeros([3u64])
144 .map(Boolean::constant)
145 .collect::<Vec<_>>();
146 assert_eq!(a_native.pow([0x3]), a.pow_le(&bits)?.value()?);
147
148 // a * a * a = a^3
149 assert_eq!(a_native.pow([0x3]), a.pow_by_constant(&[0x3])?.value()?);
150 assert!(cs.is_satisfied().unwrap());
151
152 let mut constants = [F::zero(); 4];
153 for c in &mut constants {
154 *c = UniformRand::rand(&mut test_rng());
155 }
156 let bits = [
157 Boolean::<ConstraintF>::constant(false),
158 Boolean::constant(true),
159 ];
160 let lookup_result = AF::two_bit_lookup(&bits, constants.as_ref())?;
161 assert_eq!(lookup_result.value()?, constants[2]);
162 assert!(cs.is_satisfied().unwrap());
163
164 let f = F::from(1u128 << 64);
165 let f_bits = ark_ff::BitIteratorLE::new(&[0u64, 1u64]).collect::<Vec<_>>();
166 let fv = AF::new_variable(ark_relations::ns!(cs, "alloc u128"), || Ok(f), mode)?;
167 assert_eq!(fv.to_bits_le()?.value().unwrap()[..128], f_bits[..128]);
168 assert!(cs.is_satisfied().unwrap());
169
170 let r_native: F = UniformRand::rand(&mut test_rng());
171
172 let r = AF::new_variable(ark_relations::ns!(cs, "r_native"), || Ok(r_native), mode)
173 .unwrap();
174 let _ = r.to_non_unique_bits_le()?;
175 assert!(cs.is_satisfied().unwrap());
176 let _ = r.to_bits_le()?;
177 assert!(cs.is_satisfied().unwrap());
178
179 let bytes = r.to_non_unique_bytes()?;
180 assert_eq!(ark_ff::to_bytes!(r_native).unwrap(), bytes.value().unwrap());
181 assert!(cs.is_satisfied().unwrap());
182 let bytes = r.to_bytes()?;
183 assert_eq!(ark_ff::to_bytes!(r_native).unwrap(), bytes.value().unwrap());
184 assert!(cs.is_satisfied().unwrap());
185
186 let ab_false = &a + (AF::from(Boolean::Constant(false)) * b_native);
187 let ab_true = &a + (AF::from(Boolean::Constant(true)) * b_native);
188 assert_eq!(ab_false.value()?, a_native);
189 assert_eq!(ab_true.value()?, a_native + &b_native);
190
191 if !cs.is_satisfied().unwrap() {
192 panic!(
193 "Unsatisfied in mode {:?}.\n{:?}",
194 mode,
195 cs.which_is_unsatisfied().unwrap()
196 );
197 }
198 assert!(cs.is_satisfied().unwrap());
199 }
200 Ok(())
201 }
202
203 pub fn frobenius_tests<F: Field, ConstraintF, AF>(maxpower: usize) -> Result<(), SynthesisError>
204 where
205 F: Field,
206 ConstraintF: Field,
207 AF: FieldVar<F, ConstraintF>,
208 for<'a> &'a AF: FieldOpsBounds<'a, F, AF>,
209 {
210 let modes = [
211 AllocationMode::Input,
212 AllocationMode::Witness,
213 AllocationMode::Constant,
214 ];
215 for &mode in &modes {
216 let cs = ConstraintSystem::<ConstraintF>::new_ref();
217 let mut rng = test_rng();
218 for i in 0..=maxpower {
219 let mut a = F::rand(&mut rng);
220 let mut a_gadget = AF::new_variable(ark_relations::ns!(cs, "a"), || Ok(a), mode)?;
221 a_gadget.frobenius_map_in_place(i)?;
222 a.frobenius_map(i);
223
224 assert_eq!(a_gadget.value()?, a);
225 }
226
227 assert!(cs.is_satisfied().unwrap());
228 }
229 Ok(())
230 }
231}
232
233pub mod curves {
234 use ark_ec::{ModelParameters, ProjectiveCurve, short_weierstrass_jacobian::GroupProjective as SWProjective, twisted_edwards_extended::GroupProjective as TEProjective};
235 use ark_ff::{BitIteratorLE, Field, FpParameters, One, PrimeField};
236 use ark_relations::r1cs::{ConstraintSystem, SynthesisError};
237 use ark_std::{test_rng, vec::Vec, UniformRand};
238
239 use ark_r1cs_std::prelude::*;
240
241 type ConstraintF<P> = <<P as ModelParameters>::BaseField as Field>::BasePrimeField;
242
243 pub fn group_test<C, ConstraintF>() -> Result<(), SynthesisError>
244 where
245 C: CurveWithVar<ConstraintF>,
246 ConstraintF: Field,
247 for<'a> &'a C::Var: GroupOpsBounds<'a, C, C::Var>,
248 {
249 let modes = [
250 AllocationMode::Input,
251 AllocationMode::Witness,
252 AllocationMode::Constant,
253 ];
254 for &mode in &modes {
255 let cs = ConstraintSystem::<ConstraintF>::new_ref();
256
257 let mut rng = test_rng();
258 let a_native = C::rand(&mut rng);
259 let b_native = C::rand(&mut rng);
260 let a = C::Var::new_variable(ark_relations::ns!(cs, "generate_a"), || Ok(a_native), mode)
261 .unwrap();
262 let b = C::Var::new_variable(ark_relations::ns!(cs, "generate_b"), || Ok(b_native), mode)
263 .unwrap();
264
265 let zero = C::Var::zero();
266 assert_eq!(zero.value()?, zero.value()?);
267
268 // a == a
269 assert_eq!(a.value()?, a.value()?);
270 // a + 0 = a
271 assert_eq!((&a + &zero).value()?, a.value()?);
272 // a - 0 = a
273 assert_eq!((&a - &zero).value()?, a.value()?);
274 // a - a = 0
275 assert_eq!((&a - &a).value()?, zero.value()?);
276 // a + b = b + a
277 let a_b = &a + &b;
278 let b_a = &b + &a;
279 assert_eq!(a_b.value()?, b_a.value()?);
280 a_b.enforce_equal(&b_a)?;
281 assert!(cs.is_satisfied().unwrap());
282
283 // (a + b) + a = a + (b + a)
284 let ab_a = &a_b + &a;
285 let a_ba = &a + &b_a;
286 assert_eq!(ab_a.value()?, a_ba.value()?);
287 ab_a.enforce_equal(&a_ba)?;
288 assert!(cs.is_satisfied().unwrap());
289
290 // a.double() = a + a
291 let a_a = &a + &a;
292 let mut a2 = a.clone();
293 a2.double_in_place()?;
294 a2.enforce_equal(&a_a)?;
295 assert_eq!(a2.value()?, a_native.double());
296 assert_eq!(a_a.value()?, a_native.double());
297 assert_eq!(a2.value()?, a_a.value()?);
298 assert!(cs.is_satisfied().unwrap());
299
300 // b.double() = b + b
301 let mut b2 = b.clone();
302 b2.double_in_place()?;
303 let b_b = &b + &b;
304 b2.enforce_equal(&b_b)?;
305 assert!(cs.is_satisfied().unwrap());
306 assert_eq!(b2.value()?, b_b.value()?);
307
308 let _ = a.to_bytes()?;
309 assert!(cs.is_satisfied().unwrap());
310 let _ = a.to_non_unique_bytes()?;
311 assert!(cs.is_satisfied().unwrap());
312
313 let _ = b.to_bytes()?;
314 let _ = b.to_non_unique_bytes()?;
315 if !cs.is_satisfied().unwrap() {
316 panic!(
317 "Unsatisfied in mode {:?}.\n{:?}",
318 mode,
319 cs.which_is_unsatisfied().unwrap()
320 );
321 }
322 assert!(cs.is_satisfied().unwrap());
323
324 let modulus = <C::ScalarField as PrimeField>::Params::MODULUS
325 .as_ref()
326 .to_vec();
327 let mut max = modulus.clone();
328 for limb in &mut max {
329 *limb = u64::MAX;
330 }
331
332 let modulus_last_limb_bits = <C::ScalarField as PrimeField>::Params::MODULUS_BITS % 64;
333 *max.last_mut().unwrap() >>= 64 - modulus_last_limb_bits;
334 let scalars = [
335 C::ScalarField::rand(&mut rng).into_repr().as_ref().to_vec(),
336 vec![u64::rand(&mut rng)],
337 (-C::ScalarField::one()).into_repr().as_ref().to_vec(),
338 <C::ScalarField as PrimeField>::Params::MODULUS
339 .as_ref()
340 .to_vec(),
341 max,
342 vec![0; 50],
343 vec![1000012341233u64; 36],
344 ];
345
346 let mut input = vec![];
347
348 // Check scalar mul with edge cases
349 for scalar in scalars.iter() {
350 let native_result = a_native.mul(scalar);
351 let native_result = native_result.into_affine();
352
353 let scalar_bits: Vec<bool> = BitIteratorLE::new(&scalar).collect();
354 input =
355 Vec::new_witness(ark_relations::ns!(cs, "bits"), || Ok(scalar_bits)).unwrap();
356 let result = a
357 .scalar_mul_le(input.iter())
358 .expect(&format!("Mode: {:?}", mode));
359 let result_val = result.value()?.into_affine();
360 assert_eq!(
361 result_val, native_result,
362 "gadget & native values are diff. after scalar mul {:?}",
363 scalar,
364 );
365 assert!(cs.is_satisfied().unwrap());
366 }
367
368 let result = zero.scalar_mul_le(input.iter())?;
369 let result_val = result.value()?.into_affine();
370 result.enforce_equal(&zero)?;
371 assert_eq!(
372 result_val,
373 C::zero().into_affine(),
374 "gadget & native values are diff. after scalar mul of zero"
375 );
376 assert!(cs.is_satisfied().unwrap());
377 }
378 Ok(())
379 }
380
381 type SWVar<P> = <SWProjective<P> as CurveWithVar<ConstraintF<P>>>::Var;
382
383 pub fn sw_test<P>() -> Result<(), SynthesisError>
384 where
385 P: ark_ec::SWModelParameters,
386 SWProjective<P>: CurveWithVar<ConstraintF<P>> + ProjectiveCurve,
387 for<'a> &'a SWVar<P>: GroupOpsBounds<'a, SWProjective<P>, SWVar<P>>,
388 {
389 group_test::<SWProjective<P>, _>()?;
390 let modes = [
391 AllocationMode::Input,
392 AllocationMode::Witness,
393 AllocationMode::Constant,
394 ];
395 for &mode in &modes {
396 use ark_ec::group::Group;
397
398 let mut rng = test_rng();
399
400 let cs = ConstraintSystem::<<P::BaseField as Field>::BasePrimeField>::new_ref();
401
402 let a = SWProjective::<P>::rand(&mut rng);
403 let b = SWProjective::<P>::rand(&mut rng);
404 let a_affine = a.into_affine();
405 let b_affine = b.into_affine();
406
407 let ns = ark_relations::ns!(cs, "allocating variables");
408 let mut gadget_a = SWVar::<P>::new_variable(cs.clone(), || Ok(a), mode)?;
409 let gadget_b = SWVar::<P>::new_variable(cs.clone(), || Ok(b), mode)?;
410 let zero = SWVar::<P>::zero();
411 drop(ns);
412 assert_eq!(gadget_a.value()?.into_affine(), a_affine);
413 assert_eq!(gadget_b.value()?.into_affine(), b_affine);
414 assert_eq!(cs.which_is_unsatisfied().unwrap(), None);
415
416 // Check addition
417 let ab = a + &b;
418 let ab_affine = ab.into_affine();
419 let gadget_ab = &gadget_a + &gadget_b;
420 let gadget_ba = &gadget_b + &gadget_a;
421 gadget_ba.enforce_equal(&gadget_ab)?;
422
423 let ab_val = gadget_ab.value()?.into_affine();
424 assert_eq!(ab_val, ab_affine, "Result of addition is unequal");
425 assert!(cs.is_satisfied().unwrap());
426
427 let gadget_a_zero = &gadget_a + &zero;
428 gadget_a_zero.enforce_equal(&gadget_a)?;
429
430 // Check doubling
431 let aa = Group::double(&a);
432 let aa_affine = aa.into_affine();
433 gadget_a.double_in_place()?;
434 let aa_val = gadget_a.value()?.into_affine();
435 assert_eq!(
436 aa_val, aa_affine,
437 "Gadget and native values are unequal after double."
438 );
439 assert!(cs.is_satisfied().unwrap());
440
441 if !cs.is_satisfied().unwrap() {
442 panic!(
443 "Unsatisfied in mode {:?}.\n{:?}",
444 mode,
445 cs.which_is_unsatisfied().unwrap()
446 );
447 }
448
449 assert!(cs.is_satisfied().unwrap());
450 }
451 Ok(())
452 }
453
454 type TEVar<P> = <TEProjective<P> as CurveWithVar<ConstraintF<P>>>::Var;
455
456 pub fn te_test<P>() -> Result<(), SynthesisError>
457 where
458 P: ark_ec::TEModelParameters,
459 TEProjective<P>: CurveWithVar<ConstraintF<P>> + ProjectiveCurve,
460 for<'a> &'a TEVar<P>: GroupOpsBounds<'a, TEProjective<P>, TEVar<P>>,
461 {
462 group_test::<TEProjective<P>, _>()?;
463 let modes = [
464 AllocationMode::Input,
465 AllocationMode::Witness,
466 AllocationMode::Constant,
467 ];
468 for &mode in &modes {
469 use ark_ec::group::Group;
470
471 let mut rng = test_rng();
472
473 let cs = ConstraintSystem::<<P::BaseField as Field>::BasePrimeField>::new_ref();
474
475 let a = TEProjective::<P>::rand(&mut rng);
476 let b = TEProjective::<P>::rand(&mut rng);
477 let a_affine = a.into_affine();
478 let b_affine = b.into_affine();
479
480 let ns = ark_relations::ns!(cs, "allocating variables");
481 let mut gadget_a = TEVar::<P>::new_variable(cs.clone(), || Ok(a), mode)?;
482 let gadget_b = TEVar::<P>::new_variable(cs.clone(), || Ok(b), mode)?;
483 drop(ns);
484
485 assert_eq!(gadget_a.value()?.into_affine(), a_affine);
486 assert_eq!(gadget_b.value()?.into_affine(), b_affine);
487 assert_eq!(cs.which_is_unsatisfied()?, None);
488
489 // Check addition
490 let ab = a + &b;
491 let ab_affine = ab.into_affine();
492 let gadget_ab = &gadget_a + &gadget_b;
493 let gadget_ba = &gadget_b + &gadget_a;
494 gadget_ba.enforce_equal(&gadget_ab)?;
495
496 let ab_val = gadget_ab.value()?.into_affine();
497 assert_eq!(ab_val, ab_affine, "Result of addition is unequal");
498 assert!(cs.is_satisfied().unwrap());
499
500 // Check doubling
501 let aa = Group::double(&a);
502 let aa_affine = aa.into_affine();
503 gadget_a.double_in_place()?;
504 let aa_val = gadget_a.value()?.into_affine();
505 assert_eq!(
506 aa_val, aa_affine,
507 "Gadget and native values are unequal after double."
508 );
509 assert!(cs.is_satisfied().unwrap());
510
511 if !cs.is_satisfied().unwrap() {
512 panic!(
513 "Unsatisfied in mode {:?}.\n{:?}",
514 mode,
515 cs.which_is_unsatisfied().unwrap()
516 );
517 }
518
519 assert!(cs.is_satisfied().unwrap());
520 }
521 Ok(())
522 }
523}
524
525pub mod pairing {
526 use ark_ec::{PairingEngine, ProjectiveCurve};
527 use ark_ff::{BitIteratorLE, Field, PrimeField};
528 use ark_r1cs_std::{fields::fp::FpVar, prelude::*};
529 use ark_relations::r1cs::{ConstraintSystem, SynthesisError};
530 use ark_std::{test_rng, vec::Vec, UniformRand};
531
532 #[allow(dead_code)]
533 pub fn bilinearity_test<P: PairingGadget>() -> Result<(), SynthesisError>
534 where
535 for<'a> &'a P::G1Var: GroupOpsBounds<'a, P::G1Projective, P::G1Var>,
536 for<'a> &'a P::G2Var: GroupOpsBounds<'a, P::G2Projective, P::G2Var>,
537 for<'a> &'a P::GTVar: FieldOpsBounds<'a, P::Fqk, P::GTVar>,
538 P::Fq: FieldWithVar<Var = FpVar<P::Fq>>,
539 P::Fqe: FieldWithVar,
540 P::Fqk: FieldWithVar<Var = P::GTVar>,
541 P::G1Projective: CurveWithVar<P::Fq, Var = P::G1Var>,
542 P::G2Projective: CurveWithVar<P::Fq, Var = P::G2Var>,
543 {
544 let modes = [
545 AllocationMode::Input,
546 AllocationMode::Witness,
547 AllocationMode::Constant,
548 ];
549 for &mode in &modes {
550 let cs = ConstraintSystem::<P::Fq>::new_ref();
551
552 let mut rng = test_rng();
553 let a = P::G1Projective::rand(&mut rng);
554 let b = P::G2Projective::rand(&mut rng);
555 let s = P::Fr::rand(&mut rng);
556
557 let mut sa = a;
558 sa *= s;
559 let mut sb = b;
560 sb *= s;
561
562 let a_g = P::G1Var::new_variable(cs.clone(), || Ok(a.into_affine()), mode)?;
563 let b_g = P::G2Var::new_variable(cs.clone(), || Ok(b.into_affine()), mode)?;
564 let sa_g = P::G1Var::new_variable(cs.clone(), || Ok(sa.into_affine()), mode)?;
565 let sb_g = P::G2Var::new_variable(cs.clone(), || Ok(sb.into_affine()), mode)?;
566
567 let mut _preparation_num_constraints = cs.num_constraints();
568 let a_prep_g = P::prepare_g1(&a_g)?;
569 let b_prep_g = P::prepare_g2(&b_g)?;
570 _preparation_num_constraints = cs.num_constraints() - _preparation_num_constraints;
571
572 let sa_prep_g = P::prepare_g1(&sa_g)?;
573 let sb_prep_g = P::prepare_g2(&sb_g)?;
574
575 let (ans1_g, ans1_n) = {
576 let _ml_constraints = cs.num_constraints();
577 let ml_g = <P as PairingGadget>::miller_loop(&[sa_prep_g], &[b_prep_g.clone()])?;
578 let _fe_constraints = cs.num_constraints();
579 let ans_g = <P as PairingGadget>::final_exponentiation(&ml_g)?;
580 let ans_n = <P as PairingEngine>::pairing(sa, b);
581 (ans_g, ans_n)
582 };
583
584 let (ans2_g, ans2_n) = {
585 let ans_g = <P as PairingGadget>::pairing(a_prep_g.clone(), sb_prep_g)?;
586 let ans_n = <P as PairingEngine>::pairing(a, sb);
587 (ans_g, ans_n)
588 };
589
590 let (ans3_g, ans3_n) = {
591 let s_iter = BitIteratorLE::without_trailing_zeros(s.into_repr())
592 .map(Boolean::constant)
593 .collect::<Vec<_>>();
594
595 let mut ans_g = <P as PairingGadget>::pairing(a_prep_g, b_prep_g)?;
596 let mut ans_n = <P as PairingEngine>::pairing(a, b);
597 ans_n = ans_n.pow(s.into_repr());
598 ans_g = ans_g.pow_le(&s_iter)?;
599
600 (ans_g, ans_n)
601 };
602
603 ans1_g.enforce_equal(&ans2_g)?;
604 ans2_g.enforce_equal(&ans3_g)?;
605
606 assert_eq!(ans1_g.value()?, ans1_n, "Failed native test 1");
607 assert_eq!(ans2_g.value()?, ans2_n, "Failed native test 2");
608 assert_eq!(ans3_g.value()?, ans3_n, "Failed native test 3");
609
610 assert_eq!(ans1_n, ans2_n, "Failed ans1_native == ans2_native");
611 assert_eq!(ans2_n, ans3_n, "Failed ans2_native == ans3_native");
612 assert_eq!(ans1_g.value()?, ans3_g.value()?, "Failed ans1 == ans3");
613 assert_eq!(ans1_g.value()?, ans2_g.value()?, "Failed ans1 == ans2");
614 assert_eq!(ans2_g.value()?, ans3_g.value()?, "Failed ans2 == ans3");
615
616 if !cs.is_satisfied().unwrap() {
617 panic!(
618 "Unsatisfied in mode {:?}.\n{:?}",
619 mode,
620 cs.which_is_unsatisfied().unwrap()
621 );
622 }
623
624 assert!(cs.is_satisfied().unwrap(), "cs is not satisfied");
625 }
626 Ok(())
627 }
628}