diff --git a/src/polynomial/commitment.rs b/src/polynomial/commitment.rs
index 6bbba08d..356cd976 100644
--- a/src/polynomial/commitment.rs
+++ b/src/polynomial/commitment.rs
@@ -65,6 +65,8 @@ impl<F: Field> ListPolynomialCommitment<F> {
         rate_bits: usize,
         blinding: bool,
     ) -> Self {
+        // TODO: Could try parallelizing the transpose, or not doing it explicitly, instead having
+        // MerkleTree do it implicitly.
         let mut leaves = timed!(transpose(&lde_values), "to transpose LDEs");
         reverse_index_bits_in_place(&mut leaves);
         let merkle_tree = timed!(MerkleTree::new(leaves, false), "to build Merkle tree");
diff --git a/src/prover.rs b/src/prover.rs
index f1cef856..59b3cd3d 100644
--- a/src/prover.rs
+++ b/src/prover.rs
@@ -68,8 +68,6 @@ pub(crate) fn prove<F: Extendable<D>, const D: usize>(
         "to compute wire polynomials"
     );
 
-    // TODO: Could try parallelizing the transpose, or not doing it explicitly, instead having
-    // merkle_root_bit_rev_order do it implicitly.
     let wires_commitment = timed!(
         ListPolynomialCommitment::new(
             wires_values,