diff options
| author | bnewbold <bnewbold@robocracy.org> | 2018-03-22 12:42:24 -0700 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2018-03-22 12:42:24 -0700 |
| commit | 0723ee3bc70067190cbe97d7d4d686b4bba651a1 (patch) | |
| tree | f25a49a0236541cee6b4ce3f55461712831521b1 | |
| parent | 6d128a843d9486f2789872fd8191d49f06db3464 (diff) | |
| parent | 9780a94c43f3ba0a4913763cf47d624a40495cef (diff) | |
| download | dat-deps-0723ee3bc70067190cbe97d7d4d686b4bba651a1.tar.gz dat-deps-0723ee3bc70067190cbe97d7d4d686b4bba651a1.zip | |
Merge pull request #15 from bcomnes/patch-1
Minor grammar fix (to DEP-0002)
| -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 5e6fda2..b01ea0d 100644 --- a/proposals/0002-hypercore.md +++ b/proposals/0002-hypercore.md @@ -62,7 +62,7 @@ A sample flat tree spanning 4 blocks of data looks like this: The even numbered entries represent data blocks (leaf nodes) and odd numbered entries represent parent nodes that have two children. -The depth of an tree node can be calculated by counting the number of trailing 1s a node has in binary notation. +The depth of a tree node can be calculated by counting the number of trailing 1s a node has in binary notation. ``` 5 in binary = 101 (one trailing 1) |