bump bottom out limit of peer search so people can use 100 concurrent announcers
This commit is contained in:
parent
9a79b33664
commit
0b2b10f759
1 changed files with 1 additions and 1 deletions
|
@ -216,7 +216,7 @@ class Node:
|
|||
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(
|
||||
|
|
Loading…
Reference in a new issue