diff options
| author | Bryan Newbold <bnewbold@robocracy.org> | 2018-06-09 17:02:48 -0700 |
|---|---|---|
| committer | Bryan Newbold <bnewbold@robocracy.org> | 2018-06-09 17:04:10 -0700 |
| commit | cd63b38db932753822236608035b9784c01b9726 (patch) | |
| tree | 6445f333eb01a8d622c48c3e620aaf0dd7d947ed | |
| parent | 4d83bebadd487d581388a4fa49aab142f35dc6de (diff) | |
| download | dat-deps-clarify-hypercore-root-hashes.tar.gz dat-deps-clarify-hypercore-root-hashes.zip | |
hypercore DEP: clarify root re-hashing paragraphclarify-hypercore-root-hashes
This is my solution to PR 16 (https://github.com/datprotocol/DEPs/pull/16)
Thanks to @bcomnes for proposing and @pfrazee for discussion.
| -rw-r--r-- | proposals/0002-hypercore.md | 2 |
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) |