From df6122fed675734c2b5064e59fb07f253a2997f8 Mon Sep 17 00:00:00 2001 From: Anton Kaliaev Date: Wed, 17 Jul 2019 17:56:57 +0400 Subject: [PATCH] Apply suggestions from code review Co-Authored-By: Christopher Goes --- docs/architecture/tree-chunking.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/architecture/tree-chunking.md b/docs/architecture/tree-chunking.md index c5abf036b..a7527a98a 100644 --- a/docs/architecture/tree-chunking.md +++ b/docs/architecture/tree-chunking.md @@ -28,7 +28,7 @@ the tree. Note that for AVL trees, which are insertion-order dependent, that the depth-first approach must include all internal nodes in order to properly -communicate the structure of the tree, which cannot be derrived from key-value +communicate the structure of the tree, which cannot be derived from key-value pairs alone. Such nodes would be part of the proof structure. The chunker can assign to each chunk a unique index, and every chunker will