How to find the shortest unused FirstBits?

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)

lurf jurv

Posted 2013-02-05T15:27:44.433

Reputation: 2 516

If I was an evil person I'd generate 1ijj1 it myself just for the lulz.o0'. 2013-02-05T15:59:36.957

According to this post all of the 4 character firstbits are taken.

Nick ODell 2013-02-06T01:31:41.347

Answers

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

Posted 2013-02-05T15:27:44.433

Reputation: 760

Okay... But how do I check if a given firstbits is used?lurf jurv 2013-02-05T22:46:37.380

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 2013-02-05T23:42:15.463

@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 2013-02-06T01:30:11.410

1Hmm. Is there some kind of database I can download of firstbits that I can search through?lurf jurv 2013-02-06T03:26:30.480

@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 2013-02-06T04:23:52.780