From 53ea3af49bf37b4bf29e4c0b517eb2a7e1e7d718 Mon Sep 17 00:00:00 2001
From: Aztec Bot <49558828+AztecBot@users.noreply.github.com>
Date: Thu, 23 Jan 2025 09:46:23 -0500
Subject: [PATCH] chore: redo typo PR by savvar9991 (#11412)

Thanks savvar9991 for
https://github.com/AztecProtocol/aztec-packages/pull/11408. Our policy
is to redo typo changes to dissuade metric farming. This is an automated
script.
---
 .../aztec/concepts/storage/trees/indexed_merkle_tree.mdx    | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/docs/docs/aztec/concepts/storage/trees/indexed_merkle_tree.mdx b/docs/docs/aztec/concepts/storage/trees/indexed_merkle_tree.mdx
index e2a1a7415e7..656b7bfd302 100644
--- a/docs/docs/aztec/concepts/storage/trees/indexed_merkle_tree.mdx
+++ b/docs/docs/aztec/concepts/storage/trees/indexed_merkle_tree.mdx
@@ -73,7 +73,7 @@ The insertion protocol is described below:
 1. Look for a nullifier's corresponding low_nullifier where:
 
    $$
-   low\_nullifier_{\textsf{next\_value}} > v
+   low\_nullifier_{\textsf{next\_value}} > new\_nullifier
    $$
 
    > if $new\_nullifier$ is the largest use the leaf:
@@ -86,7 +86,7 @@ The insertion protocol is described below:
 3. Perform a range check on the low nullifier's value and next_value fields:
 
 $$
-new\_nullifier > low\_nullifier_{\textsf{value}} \: \&\&  \: ( new\_nullifier < low\_nullifier_{\textsf{next\_value}} \: \| \:  low\_nullifier_{\textsf{next\_value}} == 0 )
+new\_nullifier > low\_nullifier_{\textsf{value}} \: \&\&  \: ( new\_nullifier < low\_nullifier_{\textsf{next\_value}} \: || \:  low\_nullifier_{\textsf{next\_value}} == 0 )
 $$
 
 4. Update the low nullifier pointers
@@ -217,7 +217,7 @@ In the following example we insert a subtree of size 4 into our tree at step 4.
 
 <Image img={require("/img/indexed-merkle-tree/subtree-insert-7.png")} />
 
-#### Performance gains from subtree insertion
+### Performance gains from subtree insertion
 
 Let's go back over the numbers:
 Insertions into a sparse nullifier tree involve 1 non membership check (254 hashes) and 1 insertion (254 hashes). If we were performing insertion for 4 values that would entail 2032 hashes.