I tried using the official -22 with the older openssl and that actually did work under windows 8. I was using the -catalyst version previously (don't remember where/how/why I got that, has a slightly newer openssl). Yay.

Got my hands on a 5870 real cheap ($120 shipped). ^_^

Running at over 28 MKey/s unoptimized. Any advice on getting more keys out of my card? Using the built in Catalyst OC I get to 30 MKey/s maxing out the clocks.

Question: Why does the vanityminer only search for 1 specific address from the bounty pool? Wouldn't it be better if it were to compare the calculated address with all the ones requested in the pool?

They must be hashed independently per pool customer due to the key of the customer being part of the generated address, so only the customer can spend from the vanity address.

I mined addresses in the vanity pool without using the miner application (simply using a wordlist via gen). I'm assuming I'm not eligible to redeem them because I didn't use the public keys provided; Either way, if anyone wants 1PussyCum or 1Stunna1 (both were in the pool), I have keys for them. Of course, they're not generated using split-pairs, but nonetheless. :S

That seems like a large variation for changing 1 digit.  Normally the max is around 50X change.  Maybe 10 days down to 5 hours?

It's due to the weirdness of the encoding system.

This is probably more detail than you want .

Your prefix gets converted into a 25 byte integer range.  The first byte is the network prefix (zero for BTC).  The next 20 are the hash of your key and the final 4 are the checksum. 

The first byte has to be zero (to give the leading one in all bitcoin addresses).  This happens automatically.

The next byte can't be zero, or your address would be 11......  Note: for prefixes of the form 11something, the calculation has to be adjusted.

So, your address must be a number with the first byte zero and 2nd byte at least 1.  This means it has to be between these 2 numbers.

(Numbers are hex and _ is just a spacer every 4 bytes/8 characters)

00_FFFFFFFF_FFFFFFFF_FFFFFFFF_FFFFFFFF_FFFFFFFF_FFFFFFFF
00_01000000_00000000_00000000_00000000_00000000_00000000

Other than that, your number depends on the actual letters used.  If you add an extra letter the allowed range drops by 58.

Another feature is that if a number gives the right prefix, if you multiply it by 58, it will give the same prefix (though the address will be longer).

"Bitpoin" has the following allowed ranges

Max: 00_759d92ad_aa9cbac1_7b8e094d_c5ae2dbe_ed97d9e9_5fffffff
Min: 00_759d92ad_a95fe99b_8977a9c8_b4d2895e_e5968fe0_bc000000

Max: 00_0207216c_ecdf6452_c8c03df4_197a2ced_390fdc08_6fffffff
Min: 00_0207216c_ecd9edf5_70b70757_5290df0e_e0a5e7ff_76000000

The bottom range multiplied by 58 gives the top range.  Both have the first byte as zero and the 2nd byte as non-zero, so they are both valid. 

If you divide by bottom one by 58, the first two bytes would be zero, so it is illegal.  Likewise, if you multiply the top one by 58, it would have the first byte as non-zero.

"bitpoin" has the following allowed range

Max: 00_06911d18_3fbe86a5_63524509_2534ef9a_74fdec84_6fffffff
Max: 00_06911d18_3fb91048_0b490e6c_5e4ba1bc_1c93f87b_76000000

If you mutiply it by 58, it goes above the top limit and if you divide by 58, it goes below the lower limit.

According to the encoding system, "b" is worth 34 and "B" is worth 10.  If you multiply the lower limit of Bitpoin by 3.4, you get bitpoin's range (since "b" is 3.4 times greater than "B").

This is the first reason that bitpoin is harder, it has only one target range. 

Another reason is if the middle of a range is a larger number, the size of the range is generally larger.  The Bitpoin top range is bigger than the bitpoin range, so again, Bitpoin is faster.

Question: Is there a way of making a deterministic vanity wallet?

Answer: I believe there is a way of supplying a randomly generated root chain whatever key, then a specific deterministic method of address generation, and outputting a sequence of vanity addresses that is the same each time. However, the sequence will take as much time as needed for every single vanity key.

Example: 100 vanity bitcoin addresses all beginning with 1dice, 1Dabs, 1whatever will take on average 100 times it takes to generate a single one.

More food for thought: This might be extended to make vanity public addresses (watch only) without knowing the private keys. Some wallets can already do this on non-vanity addresses using a master root chain key (that knows the private keys) and a public root chain key that knows the equivalent public bitcoin addresses only.

Request: Use compressed keys by default for all future projects.

How could he have known that without reading 70 pages of posts?

As far as I understand it, all addresses 'already exist', so to speak.  It's just a matter of having a private key.  If you 'generate' a key, youre not magically making it appear, youre just doing the math that gives a private key that happens to correlate to whatever its address is.  Same way you could just smash in some keys (within constraints that would make a valid address) and send coin off to the nethers of a random address, lost unless someone happened to come upon a private key for that address.  'Generating' a vanity address is really just spam checking random address/private key combos until you happen to find an address you deem interesting.

just opened a beer and found   https://blockchain.info/address/1HaLfdrunk5LC5a4By9vZ2YmLz5o3mbkXT    Donate if you like it

hi everyone,
does oclvanitygen support multiple gpus ? or do i need one instance per gpu?
i have a 6x 7950 rig that i want to test.