From 0c5ad81145fea58504b6db9e8c73214a9fcb331a Mon Sep 17 00:00:00 2001
From: Echo <78665754+EchoAlice@users.noreply.github.com>
Date: Thu, 19 Sep 2024 19:34:14 -0600
Subject: [PATCH] Fix merkle multiproof documentation (#3928)

---
 ssz/merkle-proofs.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/ssz/merkle-proofs.md b/ssz/merkle-proofs.md
index 9b9127d63..ffc543f95 100644
--- a/ssz/merkle-proofs.md
+++ b/ssz/merkle-proofs.md
@@ -257,7 +257,7 @@ We define a Merkle multiproof as a minimal subset of nodes in a Merkle tree need
 x x . . . . x *
 ```
 
-. are unused nodes, * are used nodes, x are the values we are trying to prove. Notice how despite being a multiproof for 3 values, it requires only 3 auxiliary nodes, only one node more than would be required to prove a single value. Normally the efficiency gains are not quite that extreme, but the savings relative to individual Merkle proofs are still significant. As a rule of thumb, a multiproof for k nodes at the same level of an n-node tree has size `k * (n/k + log(n/k))`.
+. are unused nodes, * are used nodes, x are the values we are trying to prove. Notice how despite being a multiproof for 3 values, it requires only 3 auxiliary nodes, the same amount required to prove a single value. Normally the efficiency gains are not quite that extreme, but the savings relative to individual Merkle proofs are still significant. As a rule of thumb, a multiproof for k nodes at the same level of an n-node tree has size `k * (n/k + log(n/k))`.
 
 First, we provide a method for computing the generalized indices of the auxiliary tree nodes that a proof of a given set of generalized indices will require: