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