From 84ec664a3deb8bd725d5f960e207dac77dcaae8f Mon Sep 17 00:00:00 2001
From: Colby Serpa <129702033+ColbySerpa@users.noreply.github.com>
Date: Sun, 10 Sep 2023 17:15:34 -0700
Subject: [PATCH] Update README.md

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index ec65acb..624505e 100644
--- a/README.md
+++ b/README.md
@@ -65,7 +65,7 @@ In stark contrast, the number of hashes required to validate a single folder in
 
 ## Syncing Trees Across Relays by Requesting a Range of Leafs
 
-To further enhance the functionality of Scionic Merkle DAG-Trees and support efficient data retrieval, each leaf in the tree is labelled with a sequenced number. This method facilitates the [request for a range of Merkle leaves](https://www.hornetstorage.com/forest), much like what GraphSync attempts to accomplish, but without the complexity of using complex graph selectors and large request sizes.
+To further enhance the functionality of Scionic Merkle DAG-Trees and support efficient data retrieval, each leaf in the tree is labeled with a sequenced number. This method facilitates the [request for a range of Merkle leaves](https://www.hornetstorage.com/forest), much like what GraphSync attempts to accomplish, but without the complexity of using complex graph selectors and large request sizes.
 
 The total number of leaves is recorded at the root of the tree. By doing so, users can request a range of leaves from a given folder and receive it as a small Scionic Merkle branch, reducing the bandwidth overhead and computational workload required to access multiple files in the same folder.