aboutsummaryrefslogtreecommitdiffstats
path: root/proposals/0002-hypercore.md
diff options
context:
space:
mode:
Diffstat (limited to 'proposals/0002-hypercore.md')
-rw-r--r--proposals/0002-hypercore.md4
1 files changed, 2 insertions, 2 deletions
diff --git a/proposals/0002-hypercore.md b/proposals/0002-hypercore.md
index 7fa6745..bafcedb 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)
@@ -321,7 +321,7 @@ IPFS is designed for immutable hash-addressed content, but it provides a mechani
# Unresolved questions
[unresolved]: #unresolved-questions
-- Is there a potential "branch resolution" protocol which could remove the [linear history requirement](#linear-history-requirement) and therefore enable users to share private keys freely between their devices? Explaining the risks of branches to users is difficult. (This is being explored.)
+- Is there a potential "branch resolution" protocol which could remove the [linear history requirement](#the-linear-history-requirement) and therefore enable users to share private keys freely between their devices? Explaining the risks of branches to users is difficult. (This is being explored.)
# Changelog