fix: code messages in shared cache and trie logic (#363)

## 📝 Summary

<!--- A general summary of your changes -->

## 💡 Motivation and Context

<!--- (Optional) Why is this change required? What problem does it
solve? Remove this section if not applicable. -->

---

## ✅ I have completed the following steps:

* [ ] Run `make lint`
* [ ] Run `make test`
* [ ] Added tests (if applicable)

Author: offensif

crates/eth-sparse-mpt/benches/trie_insert_bench.rs

@@ -66,7 +66,7 @@ fn gather_nodes(c: &mut Criterion) {
         b.iter(|| {
             let out = shared_cache
                 .gather_tries_for_changes(&changes)
-                .expect("gather must succed");
+                .expect("gather must succeed");
             black_box(out);
         })
     });
@@ -165,7 +165,7 @@ fn root_hash_all(c: &mut Criterion) {
 
     let tries = shared_cache
         .gather_tries_for_changes(&changes)
-        .expect("gather must succed");
+        .expect("gather must succeed");
 
     c.bench_function("root_hash_all_par_all", |b| {
         b.iter_batched(
@@ -228,10 +228,10 @@ fn root_hash_main_trie(c: &mut Criterion) {
 
     let mut trie = shared_cache
         .gather_tries_for_changes(&changes)
-        .expect("gather must succed")
+        .expect("gather must succeed")
         .account_trie;
     for key in changes.account_trie_updates {
-        trie.insert(key.clone(), key.clone()).expect("must instert");
+        trie.insert(key.clone(), key.clone()).expect("must insert");
     }
     for key in changes.account_trie_deletes {
         trie.delete(key).expect("must update");
@@ -267,7 +267,7 @@ fn root_hash_storage(c: &mut Criterion) {
 
     let tries = shared_cache
         .gather_tries_for_changes(&changes)
-        .expect("gather must succed");
+        .expect("gather must succeed");
 
     c.bench_function("root_hash_storage_insert", |b| {
         b.iter_batched(

crates/eth-sparse-mpt/src/reth_sparse_trie/change_set.rs

@@ -93,7 +93,7 @@ pub fn prepare_change_set<'a>(
             if value.is_zero() {
                 storage_deleted_keys.push(hashed_key);
             } else {
-                // @efficienty, alloy_fixed encoding
+                // @efficiently, alloy_fixed encoding
                 let value = Bytes::from(alloy_rlp::encode(value));
                 storage_updates_keys.push(hashed_key);
                 storage_updates_values.push(value);

crates/eth-sparse-mpt/src/reth_sparse_trie/mod.rs

@@ -38,7 +38,7 @@ pub enum SparseTrieError {
     #[error("Error while updated shared cache: {0:?}")]
     FailedToUpdateSharedCache(#[from] AddNodeError),
     /// This might indicate bug in the library
-    /// or incorrect underlying storage (e.g. when deletes can't be applyed to the trie because it does not have that keys)
+    /// or incorrect underlying storage (e.g. when deletes can't be applied to the trie because it does not have that keys)
     #[error("Failed to fetch data")]
     FailedToFetchData,
 }
@@ -89,7 +89,7 @@ where
 }
 
 /// Calculate root hash for the given outcome on top of the block defined by consistent_db_view.
-/// * shared_cache should be created once for each parent block and it stores fethed parts of the trie
+/// * shared_cache should be created once for each parent block and it stores fetched parts of the trie
 /// * It uses rayon for parallelism and the thread pool should be configured from outside.
 pub fn calculate_root_hash_with_sparse_trie<Provider>(
     consistent_db_view: ConsistentDbView<Provider>,

crates/eth-sparse-mpt/src/reth_sparse_trie/shared_cache.rs

@@ -88,8 +88,8 @@ impl RethSparseTrieShareCacheInternal {
             Ok(account_trie) => {
                 tries.account_trie = account_trie;
             }
-            Err(missing_acccount_trie_nodes) => {
-                missing_nodes.account_trie_nodes = missing_acccount_trie_nodes;
+            Err(missing_account_trie_nodes) => {
+                missing_nodes.account_trie_nodes = missing_account_trie_nodes;
             }
         }