Merge branch 'babybear-isfft-#539' of https://github.com/mdvillagra/l…

…ambdaworks into babybear-isfft-#539

math/src/fft/cpu/roots_of_unity.rs

@@ -22,6 +22,9 @@ pub fn get_powers_of_primitive_root<F: IsFFTField>(
         RootsConfig::Natural | RootsConfig::BitReverse => F::get_primitive_root_of_unity(n)?,
         _ => F::get_primitive_root_of_unity(n)?.inv().unwrap(),
     };
+    println!("el tipo es {}", std::any::type_name::<F>());
+    println!("un root of unity is {:?}", root);
+    println!(" la raiz del campo es {:?}", F::TWO_ADIC_PRIMITVE_ROOT_OF_UNITY);
     let up_to = match config {
         RootsConfig::Natural | RootsConfig::NaturalInversed => count,
         // In bit reverse form we could need as many as `(1 << count.bits()) - 1` roots

math/src/fft/polynomial.rs

@@ -206,6 +206,10 @@ mod tests {
         let twiddles =
             get_powers_of_primitive_root(order.into(), len, RootsConfig::Natural).unwrap();
 
+            println!("len = {}", len);
+            println!("order = {}", order);
+            println!("twiddles = {:?}", twiddles);
+
         let fft_eval = poly.evaluate_fft(1, None).unwrap();
         let naive_eval = poly.evaluate_slice(&twiddles);
 
@@ -408,8 +412,10 @@ mod tests {
         proptest! {
             // Property-based test that ensures FFT eval. gives same result as a naive polynomial evaluation.
             #[test]
-            fn test_fft_matches_naive_evaluation(poly in poly(8)) {
+            fn test_fft_matches_naive_evaluation(poly in poly(2)) {
+                println!("poly = {:?}", poly);
                 let (fft_eval, naive_eval) = gen_fft_and_naive_evaluation(poly);
+                println!("=========================");
                 prop_assert_eq!(fft_eval, naive_eval);
             }