What do you guys think about this.
Using Python
I'm gathering a list of private and public addresses into two separate files.
I keep the private and public addresses mapped together throughout the whole process btw.
Sort the list of public addresses.
Convert the addresses into an integer, rebase into regular base 10.
Compare how close the public addresses are numerically.
The goal is to get enough public addresses that are close enough together , or similar distances apart, to see if there is a pattern in numerical difference in private keys. I.e. - every priv addrs resorted by pub_addrs is some integer/pattern apart
Finding an approximate step distance, assuming that the it wraps around.
For instance.
step 3 starting at 0
0 1 2 3 4 5 6 7 8 9 A B C D E F
0 3 6 9 C F 2 5 8 B E 1 4 7 A D 0
Obviously pattern could come as more in depth like first step 3 the step 5, repeat. But the only way figure that out is to get enough public address neighbors in different regions of the address space.
Then when I think I have a pattern that may work, create a test address pair, proceed as if I don't know the private address.
Determine my test ranges of private addresses based on the public address.
Decode my base58 guess range addresses into long integers.
Integer // 128 + 1 for page number of these "Directory.io" like sites and scrub in either direction looking for the public address to match.
codestring = list('123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz')
...
place_holder = 0
for value in pub_address[::-1]:
long_int += codestring.index(value) * 58 ** place_holder
place_holder += 1
...
The problem really comes down to that I periodically get a shorter number, unless, that's a key to the pattern. Check it out.
1C1rEtR7thtETfacM7zSAr5K3z5TmDBYH
51078483646279294236952535710672081744668370430130160350
1C1rFtVdGd2QjyYGUTrfbwCb4VTtzUDmEQ
2962553431846907081444274408269607242597151315247731067433
1C1tVsw7hNrAuHQepw4UBMiPs2oXb7bGam
2962732625605733070539107364803282557057598475989994440498
