cleanup

src/common/math.cairo

@@ -1,20 +1,20 @@
 fn pow(base: felt252, exp: felt252) -> felt252 {
     if exp == 0 {
-        return 1; // Return 1 for zero exponent
+        return 1;
     }
     let mut exp: u256 = exp.into();
-    let mut res = 1; // Initialize result as 1
-    let mut curr_base = base; // Current base value
+    let mut res = 1;
+    let mut curr_base = base;
 
     loop {
         if exp == 0 {
             break;
         } else {
             if exp % 2 == 1 {
-                res = res * curr_base; // Multiply result only when exp is odd
+                res = res * curr_base;
             }
-            curr_base = curr_base * curr_base; // Square the base for next iteration
-            exp = exp / 2; // Divide exponent by 2
+            curr_base = curr_base * curr_base;
+            exp = exp / 2;
         }
     };
     res
@@ -24,4 +24,4 @@ fn mul_inverse(x: felt252) -> felt252 {
     // From Fermat's little theorem, a ^ (p - 1) = 1 when p is prime and a != 0. Since a ^ (p - 1) = a · a ^ (p - 2) we have that 
     // a ^ (p - 2) is the multiplicative inverse of a modulo p.
     pow(x, 3618502788666131213697322783095070105623107215331596699973092056135872020479)
-}
+}

src/fri/fri.cairo

@@ -0,0 +1 @@
+

src/fri/fri_last_layer.cairo

@@ -7,9 +7,7 @@ use cairo_verifier::fri::fri_layer::FriLayerQuery;
 // Verifies FRI last layer by evaluating the given polynomial on the given points (=inverses of
 // x_inv_values), and comparing the results to the given values.
 fn verify_last_layer(
-    n_queries: felt252,
-    queries: Span<FriLayerQuery>,
-    coefficients: Span<felt252>
+    n_queries: felt252, queries: Span<FriLayerQuery>, coefficients: Span<felt252>
 ) {
     let mut i: u32 = 0;
     let len: u32 = n_queries.try_into().unwrap();