Hello everyone, as I mentioned a few days ago, I'm currently working on searching for a public key. I found the speeds of the bsgs algorithm interesting, and despite not being a professional and also being a novice in Python, I will soon post my version of the software. Currently, I'm solving case #50 in approximately 19 seconds.

PS: A skilled Python developer could please tell me how I can check if an item is in a list using multiprocessing without cloning the list for each worker? This is my current bottleneck and prevents me from increasing the speed. Thank you in advance!