sure, i'll dm you, btw your codes looks cool and more advanced!
wow!, i'm beginner can you teach ?!
#EDIT
from my codes provide chance to find the 66 puzle is on 3000000000000000:37fffffffffffffff , below that it's just give same result hash and different 13zb1 address derived from private key. (but it's just speculation.)
Tepan, you seem hesitant to share your code, but trust me, what you are doing has already been done, in a much faster programming language, C++; CPU and GPU versions, where you can provide a h160 or address prefix and it will find EVERY collision in a 40 bit range, in less than a minute (depending on GPU setup).
Your python script may have some different settings/search criteria, but the bottom line is the same.
People are trying to help you speed up your code, in python, because your code is extremely slow. If your python code isn't checking at least 250,000 keys per second, then it desperately needs an overhaul. I can create a python script to do what yours is doing, that will check at least 250,000 keys per second, python only, single core, in less than 10 minutes.
But hey, you do you.
Zahid888, is the expert at prefix searches...probably has the world's largest prefix database, he can attest to what I am saying to you.