From 64ef3026e4a12bae888cbfa7cfa61529e9b24d76 Mon Sep 17 00:00:00 2001 From: Victor Shyba Date: Mon, 7 Feb 2022 23:58:28 -0300 Subject: [PATCH] bump bottom out limit of peer search so people can use 100 concurrent announcers --- lbry/dht/node.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/lbry/dht/node.py b/lbry/dht/node.py index 3456624605..635adc2c42 100644 --- a/lbry/dht/node.py +++ b/lbry/dht/node.py @@ -216,7 +216,7 @@ def get_iterative_value_finder(self, key: bytes, shortlist: typing.Optional[typi key, bottom_out_limit, max_results, None, shortlist) async def peer_search(self, node_id: bytes, count=constants.K, max_results=constants.K * 2, - bottom_out_limit=20, shortlist: typing.Optional[typing.List['KademliaPeer']] = None + bottom_out_limit=60, shortlist: typing.Optional[typing.List['KademliaPeer']] = None ) -> typing.List['KademliaPeer']: peers = [] async for iteration_peers in self.get_iterative_node_finder(