aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorbnewbold <bnewbold@robocracy.org>2018-06-19 11:09:42 -0700
committerGitHub <noreply@github.com>2018-06-19 11:09:42 -0700
commit030cec7c4121b163ac8ec88485e8dac57886d25d (patch)
tree59f6b5ee2cbaf1fab0e68bae7c42c0432464f3ce
parent747296b2382c4eb50dbe90222050c5bb22f01afd (diff)
parentcd63b38db932753822236608035b9784c01b9726 (diff)
downloaddat-deps-030cec7c4121b163ac8ec88485e8dac57886d25d.tar.gz
dat-deps-030cec7c4121b163ac8ec88485e8dac57886d25d.zip
Merge pull request #29 from bnewbold/clarify-hypercore-root-hashes
hypercore DEP: clarify root re-hashing paragraph
-rw-r--r--proposals/0002-hypercore.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/proposals/0002-hypercore.md b/proposals/0002-hypercore.md
index bafcedb..5469cbb 100644
--- a/proposals/0002-hypercore.md
+++ b/proposals/0002-hypercore.md
@@ -171,7 +171,7 @@ The nodes in this tree would be calculated as follows:
10 = h(chunk5)
```
-In the Hypercore feed, we only want one active root. Therefore, when there are multiple roots we hash all the roots together again. At most there will be `log2(number of data blocks)`.
+It is convenient to capture the state of the Hypercore feed as a whole with a fixed-size hash, regardless of how many root hashes there are. This is achieved by always re-hashing all the individual root hashes together into a single hash value. At most there will be `log2(number of data blocks)` such individual root hashes to re-hash.
```
root = h(9 + 3)