diff --git a/crates/air/src/prove.rs b/crates/air/src/prove.rs
index 8604fd25..def00677 100644
--- a/crates/air/src/prove.rs
+++ b/crates/air/src/prove.rs
@@ -5,8 +5,8 @@ use p3_field::{ExtensionField, Field, cyclic_subgroup_known_order};
 use p3_util::{log2_ceil_usize, log2_strict_usize};
 use sumcheck::{MleGroup, MleGroupOwned, MleGroupRef, ProductComputation};
 use tracing::{info_span, instrument};
-use utils::PF;
-use utils::{FSProver, add_multilinears, multilinears_linear_combination};
+use utils::{FSProver, multilinears_linear_combination};
+use utils::{PF, add_multilinears_inplace};
 use whir_p3::fiat_shamir::FSChallenger;
 use whir_p3::poly::evals::{eval_eq, fold_multilinear, scale_poly};
 use whir_p3::poly::{evals::EvaluationsList, multilinear::MultilinearPoint};
@@ -195,8 +195,9 @@ fn open_structured_columns<EF: ExtensionField<PF<EF>> + ExtensionField<IF>, IF:
 
     let batched_column =
         multilinears_linear_combination(witness, &poly_eq_batching_scalars[..n_columns]);
-    let batched_column_mixed = add_multilinears(
-        &column_up(&batched_column),
+    let mut batched_column_mixed = column_up(&batched_column);
+    add_multilinears_inplace(
+        &mut batched_column_mixed,
         &scale_poly(&column_down(&batched_column), alpha),
     );
     // TODO do not recompute this (we can deduce it from already computed values)
@@ -217,13 +218,9 @@ fn open_structured_columns<EF: ExtensionField<PF<EF>> + ExtensionField<IF>, IF:
     // TODO do not recompute this (we can deduce it from already computed values)
     let inner_sum = batched_column_mixed.evaluate(&MultilinearPoint(point.clone()));
 
-    let inner_mle = MleGroupOwned::Extension(vec![
-        add_multilinears(
-            &matrix_up_folded(&point),
-            &scale_poly(&matrix_down_folded(&point), alpha),
-        ),
-        batched_column,
-    ]);
+    let mut mat_up = matrix_up_folded(&point);
+    add_multilinears_inplace(&mut mat_up, &scale_poly(&matrix_down_folded(&point), alpha));
+    let inner_mle = MleGroupOwned::Extension(vec![mat_up, batched_column]);
 
     let (inner_challenges, _, _) = sumcheck::prove::<EF, _, _, _>(
         1,
diff --git a/crates/lean_compiler/src/lib.rs b/crates/lean_compiler/src/lib.rs
index 42901542..2ae8628d 100644
--- a/crates/lean_compiler/src/lib.rs
+++ b/crates/lean_compiler/src/lib.rs
@@ -24,7 +24,7 @@ pub fn compile_program(program: &str) -> (Bytecode, BTreeMap<usize, String>) {
     let intermediate_bytecode = compile_to_intermediate_bytecode(simple_program).unwrap();
     // println!("Intermediate Bytecode:\n\n{}", intermediate_bytecode.to_string());
     let compiled = compile_to_low_level_bytecode(intermediate_bytecode).unwrap();
-    println!("Compiled Program:\n\n{}", compiled);
+    println!("Compiled Program:\n\n{compiled}");
     (compiled, function_locations)
 }
 
diff --git a/crates/utils/src/multilinear.rs b/crates/utils/src/multilinear.rs
index 1d151c4f..d4602739 100644
--- a/crates/utils/src/multilinear.rs
+++ b/crates/utils/src/multilinear.rs
@@ -212,13 +212,12 @@ pub fn multilinear_eval_constants_at_right<F: Field>(limit: usize, point: &[F])
 //     dst
 // }
 
-pub fn add_multilinears<F: Field>(pol1: &[F], pol2: &[F]) -> Vec<F> {
-    assert_eq!(pol1.len(), pol2.len());
-    let mut dst = pol1.to_vec();
+pub fn add_multilinears_inplace<F: Field>(dst: &mut [F], src: &[F]) {
+    assert_eq!(dst.len(), src.len());
+
     dst.par_iter_mut()
-        .zip(pol2.par_iter())
+        .zip(src.par_iter())
         .for_each(|(a, b)| *a += *b);
-    dst
 }
 
 pub fn padd_with_zero_to_next_power_of_two<F: Field>(pol: &[F]) -> Vec<F> {