feat: parallel sub Merkle tree computation in proof computation

Author: jpraynaud

Cargo.lock

@@ -31,6 +31,7 @@ mithril-doc = { path = "../internal/mithril-doc" }
 mithril-persistence = { path = "../internal/mithril-persistence" }
 openssl = { version = "0.10.63", features = ["vendored"], optional = true }
 openssl-probe = { version = "0.1.5", optional = true }
+rayon = "1.10.0"
 reqwest = { version = "0.12.0", features = ["json"] }
 semver = "1.0.21"
 serde = { version = "1.0.196", features = ["derive"] }

mithril-aggregator/Cargo.toml

@@ -128,11 +128,14 @@ impl ProverService for MithrilProverService {
             .await?;
 
         // 2 - Compute block ranges sub Merkle trees
-        let mut mk_trees = BTreeMap::new();
-        for (block_range, transactions) in block_range_transactions {
-            let mk_tree = MKTree::new(&transactions)?;
-            mk_trees.insert(block_range, mk_tree);
-        }
+        let mk_trees: StdResult<Vec<(BlockRange, MKTree)>> = block_range_transactions
+            .into_par_iter()
+            .map(|(block_range, transactions)| {
+                let mk_tree = MKTree::new(&transactions)?;
+                Ok((block_range, mk_tree))
+            })
+            .collect();
+        let mk_trees = BTreeMap::from_iter(mk_trees?);
 
         // 3 - Compute block range roots Merkle map
         let mut mk_map = self