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)
1 Answer
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.
-
-
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.– DavidFeb 5, 2013 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. Feb 6, 2013 at 1:30
-
1Hmm. Is there some kind of database I can download of firstbits that I can search through? Feb 6, 2013 at 3: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. Feb 6, 2013 at 4:23
1ijj1it myself just for the lulz.