1 files changed, 5 insertions, 4 deletions
diff --git a/proposals/0002-hypercore.md b/proposals/0002-hypercore.md
index 3b6e4ac..bafcedb 100644
--- a/proposals/0002-hypercore.md
+++ b/proposals/0002-hypercore.md
@@ -7,7 +7,7 @@ Type: Standard
 
 Status: Draft (as of 2018-02-21)
 
-Github PR: (add HTTPS link here after PR is opened)
+Github PR: [Draft](https://github.com/datprotocol/DEPs/pull/4)
 
 Authors: [Paul Frazee](https://github.com/pfrazee), [Mathias Buus](https://github.com/mafintosh)
 
@@ -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,10 +321,11 @@ 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
 [changelog]: #changelog
 
-- 2018-02-21: First full draft of DEP-0002 submitted for review.
-\ No newline at end of file
+- 2018-02-19: First full draft of DEP-0002 submitted for review.
+- 2018-02-21: DEP-0002 accepted as "Draft"