perf(trie): parallel rlp node updates in sparse trie

crates/engine/tree/Cargo.toml

@@ -31,7 +31,7 @@ reth-stages-api.workspace = true
 reth-tasks.workspace = true
 reth-trie-db.workspace = true
 reth-trie-parallel.workspace = true
-reth-trie-sparse.workspace = true
+reth-trie-sparse = { workspace = true, features = ["rayon"] }
 reth-trie.workspace = true
 
 # alloy

crates/engine/tree/src/tree/root.rs

@@ -1136,7 +1136,7 @@ where
         trie.update_account(address, account.unwrap_or_default())?;
     }
 
-    trie.calculate_below_level(SPARSE_TRIE_INCREMENTAL_LEVEL);
+    trie.calculate_below_level_par(SPARSE_TRIE_INCREMENTAL_LEVEL);
     let elapsed = started_at.elapsed();
 
     Ok(elapsed)

crates/trie/sparse/Cargo.toml

@@ -23,6 +23,7 @@ alloy-primitives.workspace = true
 alloy-rlp.workspace = true
 
 # misc
+rayon = { workspace = true, optional = true }
 smallvec = { workspace = true, features = ["const_new"] }
 thiserror.workspace = true
 
@@ -58,6 +59,7 @@ arbitrary = [
     "alloy-primitives/arbitrary",
     "smallvec/arbitrary",
 ]
+rayon = ["dep:rayon"]
 
 [[bench]]
 name = "root"

crates/trie/sparse/src/blinded.rs

@@ -7,9 +7,9 @@ use reth_trie_common::{Nibbles, TrieMask};
 /// Factory for instantiating blinded node providers.
 pub trait BlindedProviderFactory {
     /// Type capable of fetching blinded account nodes.
-    type AccountNodeProvider: BlindedProvider;
+    type AccountNodeProvider: BlindedProvider + Send + Sync;
     /// Type capable of fetching blinded storage nodes.
-    type StorageNodeProvider: BlindedProvider;
+    type StorageNodeProvider: BlindedProvider + Send + Sync;
 
     /// Returns blinded account node provider.
     fn account_node_provider(&self) -> Self::AccountNodeProvider;

crates/trie/sparse/src/state.rs

@@ -432,11 +432,6 @@ impl<F: BlindedProviderFactory> SparseStateTrie<F> {
         Ok(())
     }
 
-    /// Calculates the hashes of the nodes below the provided level.
-    pub fn calculate_below_level(&mut self, level: usize) {
-        self.state.calculate_below_level(level);
-    }
-
     /// Returns storage sparse trie root if the trie has been revealed.
     pub fn storage_root(&mut self, account: B256) -> Option<B256> {
         self.storages.get_mut(&account).and_then(|trie| trie.root())
@@ -475,7 +470,8 @@ impl<F: BlindedProviderFactory> SparseStateTrie<F> {
         })
     }
 }
-impl<F: BlindedProviderFactory> SparseStateTrie<F> {
+
+impl<F: BlindedProviderFactory + Send + Sync> SparseStateTrie<F> {
     /// Update the account leaf node.
     pub fn update_account_leaf(
         &mut self,
@@ -549,6 +545,17 @@ impl<F: BlindedProviderFactory> SparseStateTrie<F> {
         storage_trie.remove_leaf(slot)?;
         Ok(())
     }
+
+    /// Calculates the hashes of the nodes below the provided level.
+    pub fn calculate_below_level(&mut self, level: usize) {
+        self.state.calculate_below_level(level);
+    }
+
+    /// Calculates the hashes of the nodes below the provided level in parallel.
+    #[cfg(feature = "rayon")]
+    pub fn calculate_below_level_par(&mut self, level: usize) {
+        self.state.calculate_below_level_par(level);
+    }
 }
 
 #[cfg(test)]