test_dht_node.py 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471
  1. import asyncio
  2. import heapq
  3. import multiprocessing as mp
  4. import random
  5. import signal
  6. from itertools import product
  7. from typing import List, Sequence, Tuple
  8. import numpy as np
  9. import pytest
  10. from multiaddr import Multiaddr
  11. import hivemind
  12. from hivemind import get_dht_time
  13. from hivemind.dht.node import DHTID, DHTNode
  14. from hivemind.dht.protocol import DHTProtocol
  15. from hivemind.dht.storage import DictionaryDHTValue
  16. from hivemind.p2p import P2P, PeerID
  17. from hivemind.utils.logging import get_logger
  18. from test_utils.dht_swarms import launch_swarm_in_separate_processes, launch_star_shaped_swarm
  19. logger = get_logger(__name__)
  20. def maddrs_to_peer_ids(maddrs: List[Multiaddr]) -> List[PeerID]:
  21. return list({PeerID.from_base58(maddr["p2p"]) for maddr in maddrs})
  22. def run_protocol_listener(
  23. dhtid: DHTID, maddr_conn: mp.connection.Connection, initial_peers: Sequence[Multiaddr]
  24. ) -> None:
  25. loop = asyncio.get_event_loop()
  26. p2p = loop.run_until_complete(P2P.create(initial_peers=initial_peers))
  27. visible_maddrs = loop.run_until_complete(p2p.get_visible_maddrs())
  28. protocol = loop.run_until_complete(
  29. DHTProtocol.create(p2p, dhtid, bucket_size=20, depth_modulo=5, num_replicas=3, wait_timeout=5)
  30. )
  31. logger.info(f"Started peer id={protocol.node_id} visible_maddrs={visible_maddrs}")
  32. for peer_id in maddrs_to_peer_ids(initial_peers):
  33. loop.run_until_complete(protocol.call_ping(peer_id))
  34. maddr_conn.send((p2p.id, visible_maddrs))
  35. async def shutdown():
  36. await p2p.shutdown()
  37. logger.info(f"Finished peer id={protocol.node_id} maddrs={visible_maddrs}")
  38. loop.stop()
  39. loop.add_signal_handler(signal.SIGTERM, lambda: loop.create_task(shutdown()))
  40. loop.run_forever()
  41. def launch_protocol_listener(
  42. initial_peers: Sequence[Multiaddr] = (),
  43. ) -> Tuple[DHTID, mp.Process, PeerID, List[Multiaddr]]:
  44. remote_conn, local_conn = mp.Pipe()
  45. dht_id = DHTID.generate()
  46. process = mp.Process(target=run_protocol_listener, args=(dht_id, remote_conn, initial_peers), daemon=True)
  47. process.start()
  48. peer_id, visible_maddrs = local_conn.recv()
  49. return dht_id, process, peer_id, visible_maddrs
  50. # note: we run network-related tests in a separate process to re-initialize all global states from scratch
  51. # this helps us avoid undesirable gRPC side-effects (e.g. segfaults) when running multiple tests in sequence
  52. @pytest.mark.forked
  53. def test_dht_protocol():
  54. peer1_node_id, peer1_proc, peer1_id, peer1_maddrs = launch_protocol_listener()
  55. peer2_node_id, peer2_proc, peer2_id, _ = launch_protocol_listener(initial_peers=peer1_maddrs)
  56. loop = asyncio.get_event_loop()
  57. for client_mode in [True, False]: # note: order matters, this test assumes that first run uses client mode
  58. peer_id = DHTID.generate()
  59. p2p = loop.run_until_complete(P2P.create(initial_peers=peer1_maddrs))
  60. protocol = loop.run_until_complete(
  61. DHTProtocol.create(
  62. p2p, peer_id, bucket_size=20, depth_modulo=5, wait_timeout=5, num_replicas=3, client_mode=client_mode
  63. )
  64. )
  65. logger.info(f"Self id={protocol.node_id}")
  66. assert loop.run_until_complete(protocol.call_ping(peer1_id)) == peer1_node_id
  67. key, value, expiration = DHTID.generate(), [random.random(), {"ololo": "pyshpysh"}], get_dht_time() + 1e3
  68. store_ok = loop.run_until_complete(
  69. protocol.call_store(peer1_id, [key], [hivemind.MSGPackSerializer.dumps(value)], expiration)
  70. )
  71. assert all(store_ok), "DHT rejected a trivial store"
  72. # peer 1 must know about peer 2
  73. (recv_value_bytes, recv_expiration), nodes_found = loop.run_until_complete(
  74. protocol.call_find(peer1_id, [key])
  75. )[key]
  76. recv_value = hivemind.MSGPackSerializer.loads(recv_value_bytes)
  77. (recv_id, recv_peer_id) = next(iter(nodes_found.items()))
  78. assert (
  79. recv_id == peer2_node_id and recv_peer_id == peer2_id
  80. ), f"expected id={peer2_node_id}, peer={peer2_id} but got {recv_id}, {recv_peer_id}"
  81. assert recv_value == value and recv_expiration == expiration, (
  82. f"call_find_value expected {value} (expires by {expiration}) "
  83. f"but got {recv_value} (expires by {recv_expiration})"
  84. )
  85. # peer 2 must know about peer 1, but not have a *random* nonexistent value
  86. dummy_key = DHTID.generate()
  87. empty_item, nodes_found_2 = loop.run_until_complete(protocol.call_find(peer2_id, [dummy_key]))[dummy_key]
  88. assert empty_item is None, "Non-existent keys shouldn't have values"
  89. (recv_id, recv_peer_id) = next(iter(nodes_found_2.items()))
  90. assert (
  91. recv_id == peer1_node_id and recv_peer_id == peer1_id
  92. ), f"expected id={peer1_node_id}, peer={peer1_id} but got {recv_id}, {recv_peer_id}"
  93. # cause a non-response by querying a nonexistent peer
  94. assert loop.run_until_complete(protocol.call_find(PeerID.from_base58("fakeid"), [key])) is None
  95. # store/get a dictionary with sub-keys
  96. nested_key, subkey1, subkey2 = DHTID.generate(), "foo", "bar"
  97. value1, value2 = [random.random(), {"ololo": "pyshpysh"}], "abacaba"
  98. assert loop.run_until_complete(
  99. protocol.call_store(
  100. peer1_id,
  101. keys=[nested_key],
  102. values=[hivemind.MSGPackSerializer.dumps(value1)],
  103. expiration_time=[expiration],
  104. subkeys=[subkey1],
  105. )
  106. )
  107. assert loop.run_until_complete(
  108. protocol.call_store(
  109. peer1_id,
  110. keys=[nested_key],
  111. values=[hivemind.MSGPackSerializer.dumps(value2)],
  112. expiration_time=[expiration + 5],
  113. subkeys=[subkey2],
  114. )
  115. )
  116. (recv_dict, recv_expiration), nodes_found = loop.run_until_complete(
  117. protocol.call_find(peer1_id, [nested_key])
  118. )[nested_key]
  119. assert isinstance(recv_dict, DictionaryDHTValue)
  120. assert len(recv_dict.data) == 2 and recv_expiration == expiration + 5
  121. assert recv_dict.data[subkey1] == (protocol.serializer.dumps(value1), expiration)
  122. assert recv_dict.data[subkey2] == (protocol.serializer.dumps(value2), expiration + 5)
  123. if not client_mode:
  124. loop.run_until_complete(p2p.shutdown())
  125. peer1_proc.terminate()
  126. peer2_proc.terminate()
  127. @pytest.mark.forked
  128. def test_empty_table():
  129. """Test RPC methods with empty routing table"""
  130. peer_id, peer_proc, peer_peer_id, peer_maddrs = launch_protocol_listener()
  131. loop = asyncio.get_event_loop()
  132. p2p = loop.run_until_complete(P2P.create(initial_peers=peer_maddrs))
  133. protocol = loop.run_until_complete(
  134. DHTProtocol.create(
  135. p2p, DHTID.generate(), bucket_size=20, depth_modulo=5, wait_timeout=5, num_replicas=3, client_mode=True
  136. )
  137. )
  138. key, value, expiration = DHTID.generate(), [random.random(), {"ololo": "pyshpysh"}], get_dht_time() + 1e3
  139. empty_item, nodes_found = loop.run_until_complete(protocol.call_find(peer_peer_id, [key]))[key]
  140. assert empty_item is None and len(nodes_found) == 0
  141. assert all(
  142. loop.run_until_complete(
  143. protocol.call_store(peer_peer_id, [key], [hivemind.MSGPackSerializer.dumps(value)], expiration)
  144. )
  145. ), "peer rejected store"
  146. (recv_value_bytes, recv_expiration), nodes_found = loop.run_until_complete(
  147. protocol.call_find(peer_peer_id, [key])
  148. )[key]
  149. recv_value = hivemind.MSGPackSerializer.loads(recv_value_bytes)
  150. assert len(nodes_found) == 0
  151. assert recv_value == value and recv_expiration == expiration
  152. assert loop.run_until_complete(protocol.call_ping(peer_peer_id)) == peer_id
  153. assert loop.run_until_complete(protocol.call_ping(PeerID.from_base58("fakeid"))) is None
  154. peer_proc.terminate()
  155. @pytest.mark.forked
  156. def test_dht_node():
  157. # step A: create a swarm of 50 dht nodes in separate processes
  158. # (first 5 created sequentially, others created in parallel)
  159. processes, dht, swarm_maddrs = launch_swarm_in_separate_processes(n_peers=50, n_sequential_peers=5)
  160. # step B: run 51-st node in this process
  161. loop = asyncio.get_event_loop()
  162. initial_peers = random.choice(swarm_maddrs)
  163. me = loop.run_until_complete(
  164. DHTNode.create(initial_peers=initial_peers, parallel_rpc=10, cache_refresh_before_expiry=False)
  165. )
  166. # test 1: find self
  167. nearest = loop.run_until_complete(me.find_nearest_nodes([me.node_id], k_nearest=1))[me.node_id]
  168. assert len(nearest) == 1 and nearest[me.node_id] == me.peer_id
  169. # test 2: find others
  170. for _ in range(10):
  171. ref_peer_id, query_id = random.choice(list(dht.items()))
  172. nearest = loop.run_until_complete(me.find_nearest_nodes([query_id], k_nearest=1))[query_id]
  173. assert len(nearest) == 1
  174. found_node_id, found_peer_id = next(iter(nearest.items()))
  175. assert found_node_id == query_id and found_peer_id == ref_peer_id
  176. # test 3: find neighbors to random nodes
  177. accuracy_numerator = accuracy_denominator = 0 # top-1 nearest neighbor accuracy
  178. jaccard_numerator = jaccard_denominator = 0 # jaccard similarity aka intersection over union
  179. all_node_ids = list(dht.values())
  180. for _ in range(10):
  181. query_id = DHTID.generate()
  182. k_nearest = random.randint(1, 10)
  183. exclude_self = random.random() > 0.5
  184. nearest = loop.run_until_complete(
  185. me.find_nearest_nodes([query_id], k_nearest=k_nearest, exclude_self=exclude_self)
  186. )[query_id]
  187. nearest_nodes = list(nearest) # keys from ordered dict
  188. assert len(nearest_nodes) == k_nearest, "beam search must return exactly k_nearest results"
  189. assert me.node_id not in nearest_nodes or not exclude_self, "if exclude, results shouldn't contain self"
  190. assert np.all(np.diff(query_id.xor_distance(nearest_nodes)) >= 0), "results must be sorted by distance"
  191. ref_nearest = heapq.nsmallest(k_nearest + 1, all_node_ids, key=query_id.xor_distance)
  192. if exclude_self and me.node_id in ref_nearest:
  193. ref_nearest.remove(me.node_id)
  194. if len(ref_nearest) > k_nearest:
  195. ref_nearest.pop()
  196. accuracy_numerator += nearest_nodes[0] == ref_nearest[0]
  197. accuracy_denominator += 1
  198. jaccard_numerator += len(set.intersection(set(nearest_nodes), set(ref_nearest)))
  199. jaccard_denominator += k_nearest
  200. accuracy = accuracy_numerator / accuracy_denominator
  201. logger.debug(f"Top-1 accuracy: {accuracy}") # should be 98-100%
  202. jaccard_index = jaccard_numerator / jaccard_denominator
  203. logger.debug(f"Jaccard index (intersection over union): {jaccard_index}") # should be 95-100%
  204. assert accuracy >= 0.9, f"Top-1 accuracy only {accuracy} ({accuracy_numerator} / {accuracy_denominator})"
  205. assert jaccard_index >= 0.9, f"Jaccard index only {accuracy} ({accuracy_numerator} / {accuracy_denominator})"
  206. # test 4: find all nodes
  207. dummy = DHTID.generate()
  208. nearest = loop.run_until_complete(me.find_nearest_nodes([dummy], k_nearest=len(dht) + 100))[dummy]
  209. assert len(nearest) == len(dht) + 1
  210. assert len(set.difference(set(nearest.keys()), set(all_node_ids) | {me.node_id})) == 0
  211. # test 5: node without peers
  212. detached_node = loop.run_until_complete(DHTNode.create())
  213. nearest = loop.run_until_complete(detached_node.find_nearest_nodes([dummy]))[dummy]
  214. assert len(nearest) == 1 and nearest[detached_node.node_id] == detached_node.peer_id
  215. nearest = loop.run_until_complete(detached_node.find_nearest_nodes([dummy], exclude_self=True))[dummy]
  216. assert len(nearest) == 0
  217. # test 6: store and get value
  218. true_time = get_dht_time() + 1200
  219. assert loop.run_until_complete(me.store("mykey", ["Value", 10], true_time))
  220. initial_peers = random.choice(swarm_maddrs)
  221. that_guy = loop.run_until_complete(
  222. DHTNode.create(
  223. initial_peers=initial_peers, parallel_rpc=10, cache_refresh_before_expiry=False, cache_locally=False
  224. )
  225. )
  226. for node in [me, that_guy]:
  227. val, expiration_time = loop.run_until_complete(node.get("mykey"))
  228. assert val == ["Value", 10], "Wrong value"
  229. assert expiration_time == true_time, f"Wrong time"
  230. assert loop.run_until_complete(detached_node.get("mykey")) is None
  231. # test 7: bulk store and bulk get
  232. keys = "foo", "bar", "baz", "zzz"
  233. values = 3, 2, "batman", [1, 2, 3]
  234. store_ok = loop.run_until_complete(me.store_many(keys, values, expiration_time=get_dht_time() + 999))
  235. assert all(store_ok.values()), "failed to store one or more keys"
  236. response = loop.run_until_complete(me.get_many(keys[::-1]))
  237. for key, value in zip(keys, values):
  238. assert key in response and response[key][0] == value
  239. # test 8: store dictionaries as values (with sub-keys)
  240. upper_key, subkey1, subkey2, subkey3 = "ololo", "k1", "k2", "k3"
  241. now = get_dht_time()
  242. assert loop.run_until_complete(me.store(upper_key, subkey=subkey1, value=123, expiration_time=now + 10))
  243. assert loop.run_until_complete(me.store(upper_key, subkey=subkey2, value=456, expiration_time=now + 20))
  244. for node in [that_guy, me]:
  245. value, time = loop.run_until_complete(node.get(upper_key))
  246. assert isinstance(value, dict) and time == now + 20
  247. assert value[subkey1] == (123, now + 10)
  248. assert value[subkey2] == (456, now + 20)
  249. assert len(value) == 2
  250. assert not loop.run_until_complete(me.store(upper_key, subkey=subkey2, value=345, expiration_time=now + 10))
  251. assert loop.run_until_complete(me.store(upper_key, subkey=subkey2, value=567, expiration_time=now + 30))
  252. assert loop.run_until_complete(me.store(upper_key, subkey=subkey3, value=890, expiration_time=now + 50))
  253. loop.run_until_complete(asyncio.sleep(0.1)) # wait for cache to refresh
  254. for node in [that_guy, me]:
  255. value, time = loop.run_until_complete(node.get(upper_key))
  256. assert isinstance(value, dict) and time == now + 50, (value, time)
  257. assert value[subkey1] == (123, now + 10)
  258. assert value[subkey2] == (567, now + 30)
  259. assert value[subkey3] == (890, now + 50)
  260. assert len(value) == 3
  261. for proc in processes:
  262. proc.terminate()
  263. # The nodes don't own their hivemind.p2p.P2P instances, so we shutdown them separately
  264. loop.run_until_complete(asyncio.wait([node.shutdown() for node in [me, detached_node, that_guy]]))
  265. @pytest.mark.forked
  266. @pytest.mark.asyncio
  267. async def test_dhtnode_replicas():
  268. num_replicas = random.randint(1, 20)
  269. peers = await launch_star_shaped_swarm(n_peers=20, num_replicas=num_replicas)
  270. you = random.choice(peers)
  271. assert await you.store("key1", "foo", get_dht_time() + 999)
  272. actual_key1_replicas = sum(len(peer.protocol.storage) for peer in peers)
  273. assert num_replicas == actual_key1_replicas
  274. assert await you.store("key2", "bar", get_dht_time() + 999)
  275. total_size = sum(len(peer.protocol.storage) for peer in peers)
  276. actual_key2_replicas = total_size - actual_key1_replicas
  277. assert num_replicas == actual_key2_replicas
  278. assert await you.store("key2", "baz", get_dht_time() + 1000)
  279. assert sum(len(peer.protocol.storage) for peer in peers) == total_size, "total size should not have changed"
  280. @pytest.mark.forked
  281. @pytest.mark.asyncio
  282. async def test_dhtnode_caching(T=0.05):
  283. node2 = await DHTNode.create(cache_refresh_before_expiry=5 * T, reuse_get_requests=False)
  284. node1 = await DHTNode.create(
  285. initial_peers=await node2.protocol.p2p.get_visible_maddrs(),
  286. cache_refresh_before_expiry=5 * T,
  287. client_mode=True,
  288. reuse_get_requests=False,
  289. )
  290. await node2.store("k", [123, "value"], expiration_time=hivemind.get_dht_time() + 7 * T)
  291. await node2.store("k2", [654, "value"], expiration_time=hivemind.get_dht_time() + 7 * T)
  292. await node2.store("k3", [654, "value"], expiration_time=hivemind.get_dht_time() + 15 * T)
  293. await node1.get_many(["k", "k2", "k3", "k4"])
  294. assert len(node1.protocol.cache) == 3
  295. assert len(node1.cache_refresh_queue) == 0
  296. await node1.get_many(["k", "k2", "k3", "k4"])
  297. assert len(node1.cache_refresh_queue) == 3
  298. await node2.store("k", [123, "value"], expiration_time=hivemind.get_dht_time() + 12 * T)
  299. await asyncio.sleep(4 * T)
  300. await node1.get("k")
  301. await asyncio.sleep(1 * T)
  302. assert len(node1.protocol.cache) == 3
  303. assert len(node1.cache_refresh_queue) == 2
  304. await asyncio.sleep(3 * T)
  305. assert len(node1.cache_refresh_queue) == 1
  306. await asyncio.sleep(5 * T)
  307. assert len(node1.cache_refresh_queue) == 0
  308. await asyncio.sleep(5 * T)
  309. assert len(node1.cache_refresh_queue) == 0
  310. await node2.store("k", [123, "value"], expiration_time=hivemind.get_dht_time() + 10 * T)
  311. await node1.get("k")
  312. await asyncio.sleep(1 * T)
  313. assert len(node1.cache_refresh_queue) == 0
  314. await node1.get("k")
  315. await asyncio.sleep(1 * T)
  316. assert len(node1.cache_refresh_queue) == 1
  317. await asyncio.sleep(5 * T)
  318. assert len(node1.cache_refresh_queue) == 0
  319. await asyncio.gather(node1.shutdown(), node2.shutdown())
  320. @pytest.mark.forked
  321. @pytest.mark.asyncio
  322. async def test_dhtnode_reuse_get():
  323. peers = await launch_star_shaped_swarm(n_peers=10, parallel_rpc=256)
  324. await asyncio.gather(
  325. random.choice(peers).store("k1", 123, hivemind.get_dht_time() + 999),
  326. random.choice(peers).store("k2", 567, hivemind.get_dht_time() + 999),
  327. )
  328. you = random.choice(peers)
  329. futures1 = await you.get_many(["k1", "k2"], return_futures=True)
  330. assert len(you.pending_get_requests[DHTID.generate("k1")]) == 1
  331. assert len(you.pending_get_requests[DHTID.generate("k2")]) == 1
  332. futures2 = await you.get_many(["k2", "k3"], return_futures=True)
  333. assert len(you.pending_get_requests[DHTID.generate("k2")]) == 2
  334. await asyncio.gather(*futures1.values(), *futures2.values())
  335. futures3 = await you.get_many(["k3"], return_futures=True)
  336. assert len(you.pending_get_requests[DHTID.generate("k1")]) == 0
  337. assert len(you.pending_get_requests[DHTID.generate("k2")]) == 0
  338. assert len(you.pending_get_requests[DHTID.generate("k3")]) == 1
  339. assert (await futures1["k1"])[0] == 123
  340. assert await futures1["k2"] == await futures2["k2"] and (await futures1["k2"])[0] == 567
  341. assert await futures2["k3"] == await futures3["k3"] and (await futures3["k3"]) is None
  342. @pytest.mark.forked
  343. @pytest.mark.asyncio
  344. async def test_dhtnode_blacklist():
  345. node1, node2, node3, node4 = await launch_star_shaped_swarm(n_peers=4, blacklist_time=999)
  346. assert await node2.store("abc", 123, expiration_time=hivemind.get_dht_time() + 99)
  347. assert len(node2.blacklist.ban_counter) == 0
  348. await asyncio.gather(node3.shutdown(), node4.shutdown())
  349. assert await node2.store("def", 456, expiration_time=hivemind.get_dht_time() + 99)
  350. assert set(node2.blacklist.ban_counter.keys()) == {node3.peer_id, node4.peer_id}
  351. assert await node1.get("abc", latest=True) # force node1 to crawl dht and discover unresponsive peers
  352. assert node3.peer_id in node1.blacklist
  353. assert await node1.get("abc", latest=True) # force node1 to crawl dht and discover unresponsive peers
  354. assert node2.peer_id not in node1.blacklist
  355. await asyncio.gather(node1.shutdown(), node2.shutdown())
  356. @pytest.mark.forked
  357. @pytest.mark.asyncio
  358. async def test_dhtnode_edge_cases():
  359. peers = await launch_star_shaped_swarm(n_peers=4, parallel_rpc=4)
  360. subkeys = [0, "", False, True, "abyrvalg", 4555]
  361. keys = subkeys + [()]
  362. values = subkeys + [[]]
  363. for key, subkey, value in product(keys, subkeys, values):
  364. await random.choice(peers).store(
  365. key=key, subkey=subkey, value=value, expiration_time=hivemind.get_dht_time() + 999
  366. ),
  367. stored = await random.choice(peers).get(key=key, latest=True)
  368. assert stored is not None
  369. assert subkey in stored.value
  370. assert stored.value[subkey].value == value
  371. await asyncio.wait([node.shutdown() for node in peers])