diff --git a/CHANGELOG.md b/CHANGELOG.md
index 7557286b4..fbac72659 100644
--- a/CHANGELOG.md
+++ b/CHANGELOG.md
@@ -13,16 +13,8 @@ at anytime.
   *
 
 ### Fixed
+  * Fixed amount of close nodes to add to list in case of extension to neighbouring k-buckets
   *
-  *
-  * Fixed slow startup for nodes with many lbry files
-  * Fixed setting the external ip on startup
-  * Fixed session startup not blocking on joining the dht
-  * Fixed several parsing bugs that prevented replacing dead dht contacts
-  * Fixed lbryid length validation
-  * Fixed an old print statement that polluted logs
-  * Fixed rpc id length for dht requests
-  * Fixed amount of closed nodes to add to list in case of extension to neighbouring k-buckets
 
 ### Deprecated
   *
diff --git a/lbrynet/dht/routingtable.py b/lbrynet/dht/routingtable.py
index a23d68370..1c73c5360 100644
--- a/lbrynet/dht/routingtable.py
+++ b/lbrynet/dht/routingtable.py
@@ -142,6 +142,8 @@ class TreeRoutingTable(object):
         # Fill up the node list to k nodes, starting with the closest neighbouring nodes known
         while len(closestNodes) < min(count, constants.k) and (canGoLower or canGoHigher):
             # TODO: this may need to be optimized
+            # TODO: add "key" kwarg to getContacts() to sort contacts returned by xor distance
+            # to the key
             if canGoLower and len(closestNodes) < min(count, constants.k):
                 closestNodes.extend(
                     self._buckets[bucketIndex - i].getContacts(get_remain(closestNodes),