diff --git a/lbrynet/tests/functional/dht/test_iterative_find.py b/lbrynet/tests/functional/dht/test_iterative_find.py
new file mode 100644
index 000000000..f38caf604
--- /dev/null
+++ b/lbrynet/tests/functional/dht/test_iterative_find.py
@@ -0,0 +1,27 @@
+from lbrynet.dht import constants
+from lbrynet.dht.distance import Distance
+from dht_test_environment import TestKademliaBase
+import logging
+
+log = logging.getLogger()
+
+
+class TestFindNode(TestKademliaBase):
+    """
+    This tests the local routing table lookup for a node, every node should return the sorted k contacts closest
+    to the querying node (even if the key being looked up is known)
+    """
+    network_size = 35
+
+    def test_find_node(self):
+        last_node_id = self.nodes[-1].node_id.encode('hex')
+        to_last_node = Distance(last_node_id.decode('hex'))
+        for n in self.nodes:
+            find_close_nodes_result = n._routingTable.findCloseNodes(last_node_id.decode('hex'), constants.k)
+            self.assertTrue(len(find_close_nodes_result) == constants.k)
+            found_ids = [c.id.encode('hex') for c in find_close_nodes_result]
+            self.assertListEqual(found_ids, sorted(found_ids, key=lambda x: to_last_node(x.decode('hex'))))
+            if last_node_id in [c.id.encode('hex') for c in n.contacts]:
+                self.assertTrue(found_ids[0] == last_node_id)
+            else:
+                self.assertTrue(last_node_id not in found_ids)