book
book copied to clipboard
Documentation on how to implement the Dat Protocol [ DEPRECATED - see https://github.com/hypercore-protocol/new-website/tree/master/guides for similar functionality. More info on active projects and...
**🐛 bug fix The statement: > If the number of leaf nodes is a multiple of 2 the flat tree will only have a single root. is incorrect and should...
**🙋 feature request I started my career as an embedded systems engineer which meant that I had a long opportunity to become an expert at bit-wise operations. I've created an...
**🔦 documentation change? The optimization for calculating the depth of a node in a flat tree incorrectly states that it can be calculated as the number of trailing zeroes rather...
🔦 documentation change Add how to verify a merkle tree to `ch01-02-merkle-tree.md` ## Checklist - [x] documentation is changed or added ## Context No ## Semver Changes a patch
Thanks for this great resource. For the purpose of getting a first impressions of all the necessary moving parts for completing an implementation of DAT, it would be nice to...
Looking forward to read it soon. https://datprotocol.github.io/book/ch01-02-merkle-tree.html#verifying-a-merkle-tree
In the Merkle Tree & Terminology sections we should emphasize the root hashes aren't persisted anywhere, but only the signatures of the hashes are persisted. Also emphasize index for the...
The bitfield size was updated from 256 to 512 bytes. See https://github.com/mafintosh/hypercore/pull/184.
__Update 2:__ I just made a quick animation that we could add to the book or use in presentations to illustrate the flattening of the tree:  [flat-tree.key.zip](https://github.com/datprotocol/book/files/2671692/flat-tree.key.zip) (Original Keynote...
After posting a copy of the book on my site, I was alerted that I was unknowingly contributing to giving Google eyes on the web and exposing my visitors to...