From 9780a94c43f3ba0a4913763cf47d624a40495cef Mon Sep 17 00:00:00 2001 From: Bret Comnes Date: Thu, 22 Mar 2018 12:14:36 -0700 Subject: Minor grammar fix --- proposals/0002-hypercore.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'proposals/0002-hypercore.md') 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) -- cgit v1.2.3