From e8c09626d877b4f3419213d908e492e8961c9f71 Mon Sep 17 00:00:00 2001
From: jlwllmr <95916148+jlwllmr@users.noreply.github.com>
Date: Fri, 6 Sep 2024 12:26:19 +0100
Subject: [PATCH] Correct typo

---
 docs/architecture/stack/evm-state-manager/index.mdx | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/docs/architecture/stack/evm-state-manager/index.mdx b/docs/architecture/stack/evm-state-manager/index.mdx
index 342c3552b..3574ee330 100644
--- a/docs/architecture/stack/evm-state-manager/index.mdx
+++ b/docs/architecture/stack/evm-state-manager/index.mdx
@@ -70,7 +70,7 @@ A sparse Merkle tree is a variation of a standard Merkle tree where not all leaf
 with data; instead, data is only stored in nodes where it's needed. It is a complete tree of fixed 
 depth, meaning that all branches of the tree have the same length—i.e. the same number of leaves. 
 
-At initializatio—at the beginning of the chain's history—all leaf nodes are set to a default value, 
+At initialization—the beginning of the chain's history—all leaf nodes are set to a default value, 
 which is typically a hash of a specific value, such as zero. Because all leaf nodes have the same 
 hash value, the parent nodes and higher-level nodes also have the same hash value. A node whose 
 hash is the default value for its level is therefore considered to represent an _empty_ subtree.