diff --git a/src/compute_proof_lagrange_bench.c b/src/compute_proof_lagrange_bench.c
index 4730932..a77c81a 100644
--- a/src/compute_proof_lagrange_bench.c
+++ b/src/compute_proof_lagrange_bench.c
@@ -43,7 +43,7 @@ long run_bench(int scale, int max_seconds) {
     for (int i = 0; i < fs.max_width; i++) {
         p.values[i] = rand_fr();
     }
-    
+
     fr_t x = rand_fr();
     fr_t y;
     assert(C_KZG_OK == eval_poly_l(&y, &p, &x, &fs));
diff --git a/src/kzg_proofs.c b/src/kzg_proofs.c
index e6b917d..5184e37 100644
--- a/src/kzg_proofs.c
+++ b/src/kzg_proofs.c
@@ -102,7 +102,6 @@ C_KZG_RET compute_proof_single_l(g1_t *out, const poly_l *p, const fr_t *x0, con
 
   TRY(new_fr_array(&inverses_in, p->length));
   TRY(new_fr_array(&inverses, p->length));
-  
 
   for (i = 0; i < q.length; i++) {
     if (fr_equal(x0, &ks->fs->expanded_roots_of_unity[i])) {
@@ -118,7 +117,7 @@ C_KZG_RET compute_proof_single_l(g1_t *out, const poly_l *p, const fr_t *x0, con
 
   for (i = 0; i < q.length; i++) {
     fr_mul(&q.values[i], &q.values[i], &inverses[i]);
-  }  
+  }
   if (m) { // ω_m == x0
     q.values[--m] = fr_zero;
     for (i=0; i < q.length; i++) {