test_dht_node.py 23 KB

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