Checking 3600000000000000 keys from 0x9de000a7c
BSGS FOUND PrivateKey : 42387769979
Time Spent : 0.13 seconds
Oh hey look, .13 seconds, but look where the checking keys from is.
Man you can bullchit some people, but not this dawg.
In your script you have:
k1 = random.randint(start, end)
so if the random key is close to the key, then you will find it faster, but if you do not know the key, you must start from at least the starting range of the bit range.
My results above clearly showed the starting key of 0x1 and the amount of keys. You purposely didn't add that in your snippet.
Not today OP, not today lol.
I don't have the need to lie, I work hard and I sleep little, I used another script, that's all, there is no need to create a witch hunt Lol, like Albertobsd, he told me I was a liar, he ignored me, i shut his mouth and surely in a while we will see keyhunt with binary DB.
It’s like you told me I was wrong when the other script wouldn’t find the key when doing an increment and even a single key check. Which as you know, you found out to be true and fixed the bug.
Also, if using random, you could skip over the target key and miss it altogether, and that would result in a false negative.
I like to learn so I break down each script to understand it and test it. If something is wrong or broke, I let the OP know. No witch hunts lol.