5

I am interested in generating a bitcoin address with the shortest possible FirstBits. By random trial and error I found that 1ijj1 is untaken. Is there a way to find the shortest possible untaken FirstBits? (So I can generate it using vanitygen)

o0'.
  • 5,240
  • 6
  • 39
  • 66
lurf jurv
  • 2,714
  • 4
  • 23
  • 28

1 Answers1

1

Yes there is a solution, it is brute-force. Make a loop and add variable characters, test them one by one. Start with one variable characters, try all combinations, add another variable character, try all combinations, rinse, repeat until you find unused firstbits.

David
  • 800
  • 3
  • 8
  • Okay... But how do I check if a given firstbits is used? – lurf jurv Feb 05 '13 at 22:46
  • If I wanted to do it I'd plug into the blockchain API somehow and script the search. If you're going to do a brute-force search you'll have to script it anyway. – David Feb 05 '13 at 23:42
  • @David, that seems rather hard on the firstbits website, given that you'd need 5 million requests (ish) to fully search for 5 character firstbits. – Nick ODell Feb 06 '13 at 01:30
  • 1
    Hmm. Is there some kind of database I can download of firstbits that I can search through? – lurf jurv Feb 06 '13 at 03:26
  • @lurfjurv Download, probably not. However, you can use a program called Abe to make a firstbit database. I wrote a guide about setting up Abe back in November, which I just updated to cover the firstbits feature. – Nick ODell Feb 06 '13 at 04:23