From 2abf1e483abde2d734dacb037ae2c38ad6772f11 Mon Sep 17 00:00:00 2001
From: zeggil <33568202+zeggil@users.noreply.github.com>
Date: Thu, 19 Dec 2024 12:39:17 -0500
Subject: [PATCH] Update state-compression.md

---
 docs/advanced/state-compression.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/docs/advanced/state-compression.md b/docs/advanced/state-compression.md
index 5e01a602e..4444678ff 100644
--- a/docs/advanced/state-compression.md
+++ b/docs/advanced/state-compression.md
@@ -226,7 +226,7 @@ per update transaction.
 
 Consider another example, this time with a tree of max depth `3`. If we want to
 apply an action to one of the tree’s leaves—such as updating `R4`—we need to
-provide proofs for `L4` and `R2`. However, we can omit `R1` since it is already
+provide proofs for `L4`, `R2`, and `R1`. However, we can omit `R1` since it is already
 cached/stored onchain due to our canopy depth of `1`, which ensures that all
 nodes at level 1 (`L1` and `R1`) are stored onchain. This results in a total of
 2 required proofs.