diff --git a/math/benches/fields/baby_bear.rs b/math/benches/fields/baby_bear.rs
index c243036e3..4f5a759d4 100644
--- a/math/benches/fields/baby_bear.rs
+++ b/math/benches/fields/baby_bear.rs
@@ -23,7 +23,7 @@ use rand::Rng;
 pub type U32Babybear31PrimeField = U32MontgomeryBackendPrimeField<2013265921>;
 pub type F = FieldElement<U32Babybear31PrimeField>;
 pub type F64 = FieldElement<Babybear31PrimeField>;
-pub type Fp4E_u32 = FieldElement<Degree4BabyBearU32ExtensionField>;
+pub type Fp4Eu32 = FieldElement<Degree4BabyBearU32ExtensionField>;
 pub type Fp4E = FieldElement<Degree4BabyBearExtensionField>;
 type EF4 = BinomialExtensionField<BabyBear, 4>;
 
@@ -63,17 +63,17 @@ pub fn rand_babybear_u64_fp4_elements(num: usize) -> Vec<(Fp4E, Fp4E)> {
     }
     result
 }
-pub fn rand_babybear_u32_fp4_elements(num: usize) -> Vec<(Fp4E_u32, Fp4E_u32)> {
+pub fn rand_babybear_u32_fp4_elements(num: usize) -> Vec<(Fp4Eu32, Fp4Eu32)> {
     let mut result = Vec::with_capacity(num);
     for _ in 0..num {
         result.push((
-            Fp4E_u32::new([
+            Fp4Eu32::new([
                 F::from(random::<u64>()),
                 F::from(random::<u64>()),
                 F::from(random::<u64>()),
                 F::from(random::<u64>()),
             ]),
-            Fp4E_u32::new([
+            Fp4Eu32::new([
                 F::from(random::<u64>()),
                 F::from(random::<u64>()),
                 F::from(random::<u64>()),
@@ -214,7 +214,7 @@ pub fn babybear_u64_ops_benchmarks(c: &mut Criterion) {
     }
 }
 pub fn babybear_u32_extension_ops_benchmarks(c: &mut Criterion) {
-    let input: Vec<Vec<(Fp4E_u32, Fp4E_u32)>> = [1000000]
+    let input: Vec<Vec<(Fp4Eu32, Fp4Eu32)>> = [1000000]
         .into_iter()
         .map(rand_babybear_u32_fp4_elements)
         .collect::<Vec<_>>();
diff --git a/math/src/field/fields/fft_friendly/quartic_babybear_u32.rs b/math/src/field/fields/fft_friendly/quartic_babybear_u32.rs
index f567fe42c..f674a2a5d 100644
--- a/math/src/field/fields/fft_friendly/quartic_babybear_u32.rs
+++ b/math/src/field/fields/fft_friendly/quartic_babybear_u32.rs
@@ -28,7 +28,7 @@ impl IsField for Degree4BabyBearU32ExtensionField {
     type BaseType = [FieldElement<Babybear31PrimeField>; 4];
 
     fn add(a: &Self::BaseType, b: &Self::BaseType) -> Self::BaseType {
-        [&a[0] + &b[0], &a[1] + &b[1], &a[2] + &b[2], &a[3] + &b[3]]
+        [a[0] + b[0], a[1] + b[1], a[2] + b[2], a[3] + b[3]]
     }
 
     /// Result of multiplying two polynomials a = a0 + a1 * x + a2 * x^2 + a3 * x^3 and
@@ -36,24 +36,24 @@ impl IsField for Degree4BabyBearU32ExtensionField {
     /// the remainder of the division by x^4 + 11.
     fn mul(a: &Self::BaseType, b: &Self::BaseType) -> Self::BaseType {
         [
-            &a[0] * &b[0] - BETA * (&a[1] * &b[3] + &a[3] * &b[1] + &a[2] * &b[2]),
-            &a[0] * &b[1] + &a[1] * &b[0] - BETA * (&a[2] * &b[3] + &a[3] * &b[2]),
-            &a[0] * &b[2] + &a[2] * &b[0] + &a[1] * &b[1] - BETA * (&a[3] * &b[3]),
-            &a[0] * &b[3] + &a[3] * &b[0] + &a[1] * &b[2] + &a[2] * &b[1],
+            a[0] * b[0] - BETA * (a[1] * b[3] + a[3] * b[1] + a[2] * b[2]),
+            a[0] * b[1] + a[1] * b[0] - BETA * (a[2] * b[3] + a[3] * b[2]),
+            a[0] * b[2] + a[2] * b[0] + a[1] * b[1] - BETA * (a[3] * b[3]),
+            a[0] * b[3] + a[3] * b[0] + a[1] * b[2] + a[2] * b[1],
         ]
     }
 
     fn square(a: &Self::BaseType) -> Self::BaseType {
         [
-            &a[0].square() - BETA * ((&a[1] * &a[3]).double() + &a[2].square()),
-            (&a[0] * &a[1] - BETA * (&a[2] * &a[3])).double(),
-            (&a[0] * &a[2]).double() + &a[1].square() - BETA * (&a[3].square()),
-            (&a[0] * &a[3] + &a[1] * &a[2]).double(),
+            a[0].square() - BETA * ((a[1] * a[3]).double() + a[2].square()),
+            (a[0] * a[1] - BETA * (a[2] * a[3])).double(),
+            (a[0] * a[2]).double() + a[1].square() - BETA * (a[3].square()),
+            (a[0] * a[3] + a[1] * a[2]).double(),
         ]
     }
 
     fn sub(a: &Self::BaseType, b: &Self::BaseType) -> Self::BaseType {
-        [&a[0] - &b[0], &a[1] - &b[1], &a[2] - &b[2], &a[3] - &b[3]]
+        [a[0] - b[0], a[1] - b[1], a[2] - b[2], a[3] - b[3]]
     }
 
     fn neg(a: &Self::BaseType) -> Self::BaseType {
@@ -64,17 +64,17 @@ impl IsField for Degree4BabyBearU32ExtensionField {
     /// This algorithm is inspired by Risc0 implementation:
     /// <https://github.com/risc0/risc0/blob/4c41c739779ef2759a01ebcf808faf0fbffe8793/risc0/core/src/field/baby_bear.rs#L460>
     fn inv(a: &Self::BaseType) -> Result<Self::BaseType, FieldError> {
-        let mut b0 = &a[0] * &a[0] + BETA * (&a[1] * (&a[3] + &a[3]) - &a[2] * &a[2]);
-        let mut b2 = &a[0] * (&a[2] + &a[2]) - &a[1] * &a[1] + BETA * (&a[3] * &a[3]);
-        let c = &b0.square() + BETA * b2.square();
+        let mut b0 = a[0] * a[0] + BETA * (a[1] * (a[3] + a[3]) - a[2] * a[2]);
+        let mut b2 = a[0] * (a[2] + a[2]) - a[1] * a[1] + BETA * (a[3] * a[3]);
+        let c = b0.square() + BETA * b2.square();
         let c_inv = c.inv()?;
         b0 *= &c_inv;
         b2 *= &c_inv;
         Ok([
-            &a[0] * &b0 + BETA * &a[2] * &b2,
-            -&a[1] * &b0 - BETA * &a[3] * &b2,
-            -&a[0] * &b2 + &a[2] * &b0,
-            &a[1] * &b2 - &a[3] * &b0,
+            a[0] * b0 + BETA * a[2] * b2,
+            -a[1] * b0 - BETA * a[3] * b2,
+            -a[0] * b2 + a[2] * b0,
+            a[1] * b2 - a[3] * b0,
         ])
     }
 
@@ -131,10 +131,10 @@ impl IsField for Degree4BabyBearU32ExtensionField {
             return Self::one();
         }
         if exponent == one {
-            return a.clone();
+            return *a;
         }
 
-        let mut result = a.clone();
+        let mut result = *a;
 
         // Fast path for powers of 2
         while exponent & one == zero {
@@ -145,7 +145,7 @@ impl IsField for Degree4BabyBearU32ExtensionField {
             }
         }
 
-        let mut base = result.clone();
+        let mut base = result;
         exponent >>= 1;
 
         while exponent != zero {