Show Posts
Out of curiosity, I was testing a range 0-FFFFFFFFFFFF and found the private key very quickly. I then proceeded to test the next range 1000000000000-1FFFFFFFFFFFF of equivalent size but with a public key of the first keyspace. It still managed to solve for the private key, even though the private key wasn't in the range provided. It took about 5 minutes. Why is that?
Maybe because the range is very small? And how come it found a key that wasn't there? That's a contadiction
lesser range = 0-FFFFFFFFFFFF
greater range = 1000000000000-1FFFFFFFFFFFF
Let's say priv key to pub key is 3103FFCB8A82
This program always starts from 0. So if user enters the range of:
1000000000000:1FFFFFFFFFFFF
the program automatically subtracts the beginning range and shifts the pub key accordingly, in this case it subtracts and shifts by 1000000000000; so the program is actually searching from:
0:FFFFFFFFFFFF
If pubkey is found, the program calculates key like so: Tame D - Wild D + (original beginning range) 1000000000000
Makes perfect sense! Just not very efficient for finding that lesser private key. I wonder if that could be optimized?
