diff --git a/README.md b/README.md
index 8bf78a9..47b1e98 100644
--- a/README.md
+++ b/README.md
@@ -5,6 +5,7 @@
 [![js-standard-style](https://cdn.rawgit.com/feross/standard/master/badge.svg)](https://github.com/feross/standard)  
 
 # SYNOPSIS 
+
 This implements a binary merkle radix tree. The point of using a binary radix
 tree is that it generates smaller proof size then trees with larger radixes.
 This tree is well suited for storing large dictonaries of fairly random keys.
diff --git a/package.json b/package.json
index 4122928..ce36a20 100644
--- a/package.json
+++ b/package.json
@@ -27,7 +27,7 @@
   },
   "dependencies": {
     "ipld-graph-builder": "^1.3.3",
-    "leb128": "0.0.2",
+    "leb128": "0.0.3",
     "node-webcrypto-shim": "0.0.0",
     "safe-buffer": "^5.1.1",
     "text-encoding": "^0.6.4",