diff --git a/zk_prover/src/merkle_sum_tree/aggregation_mst.rs b/zk_prover/src/merkle_sum_tree/aggregation_mst.rs
index a608e287..c36f2fa4 100644
--- a/zk_prover/src/merkle_sum_tree/aggregation_mst.rs
+++ b/zk_prover/src/merkle_sum_tree/aggregation_mst.rs
@@ -103,7 +103,7 @@ impl<const N_ASSETS: usize, const N_BYTES: usize> AggregationMerkleSumTree<N_ASS
         &self.mini_trees[index]
     }
 
-    /// Generates a MerkleProof for the user with the given index in the mini tree with the given index
+    /// Generates a MerkleProof for the user with the given index in the mini tree with the given index (according to the order in which the mini trees were passed to the constructor)
     pub fn generate_proof(
         &self,
         user_index: usize,
diff --git a/zk_prover/src/merkle_sum_tree/utils/create_proof.rs b/zk_prover/src/merkle_sum_tree/utils/create_proof.rs
index a3f13509..9d97c0b2 100644
--- a/zk_prover/src/merkle_sum_tree/utils/create_proof.rs
+++ b/zk_prover/src/merkle_sum_tree/utils/create_proof.rs
@@ -16,7 +16,7 @@ pub fn create_proof<const N_ASSETS: usize, const N_BYTES: usize>(
     let mut path_indices = vec![Fp::from(0); depth];
     let mut current_index = index;
 
-    let leaf = &nodes[0][index]; // Added this line to store the leaf node
+    let leaf = &nodes[0][index];
 
     for level in 0..depth {
         let position = current_index % 2;