Quote from: findftp on October 23, 2014, 02:23:44 PM

Quote from: novacn on October 23, 2014, 02:07:22 PM

Quote from: qdoop on October 23, 2014, 01:01:02 PM

Elementary probability theory.

Each position has 1/58 probability to be the desired symbol.
So if you fix let say 3 positions the probability to find a matching pattern would be (1/58)*(1/58)*(1/58)
It is independent of the position you fix in the address. 1ace....xxxx is as difficult as 1axcxex.......

The possibility vanishes very quick as a power of n(positions you fix)

Thanks @qdoop!
That's a quick and concise answer!

FYI, the tool is called vanitygen.

Code:

findftp@mint16 ~/Downloads/vanitygen-master $ ./vanitygen 1abcdefg
Difficulty: 51529903411245
[195.63 Kkey/s][total 16791552][Prob 0.0%][50% in 5.8y]

Code:

findftp@mint16 ~/Downloads/vanitygen-master $ ./vanitygen 1abcdef
Difficulty: 888446610538
[221.12 Kkey/s][total 1468160][Prob 0.0%][50% in 32.2d]

So just a "simple" prefix takes a long time on a intel xeon w3505

edit: must say I run this linux on software vmware.

Thanks, findftp!
I'll play around with that vanitygen. Seems a great tool, cheers! Cheesy