From 9db2857b8ff2be296331ff4cd0a2c2b0e4eca9d1 Mon Sep 17 00:00:00 2001 From: Sanaz Date: Wed, 13 Jan 2021 18:00:39 -0800 Subject: [PATCH] minor edit --- rln-research/merkle-tree-update.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/rln-research/merkle-tree-update.md b/rln-research/merkle-tree-update.md index ac67061..7b95b4d 100644 --- a/rln-research/merkle-tree-update.md +++ b/rln-research/merkle-tree-update.md @@ -29,7 +29,7 @@ We are seeking a solution in which a peer can perform the following operations b # Solution Overview -In the solution explained below, we enable a peer to perform the operations described in [Formal Problem Definition](#Formal-Problem-Definition) by only holding O(log N) many tree nodes (but not the entire tree). +In the solution explained below, we enable a peer to perform the operations described in [Formal Problem Definition](#Formal-Problem-Definition) by only holding O(log N) many tree nodes (but not the entire tree). Our focus is on supporting the deletion operation (the insertion will be similar). ## Computing the root after deletion