Thanks so much jay! Works like a charm

I'm assuming you found that tool. No problem though. I always had so many issues with drivers until I found that tool. The very next install and it worked great!

The win7 version should work for the win8 version because I don't think the file structure isnt any different. Try it and report back!

Without looking at the code, because the seed is only part of the entropy?

>oclvanitygen ########  (8 character search)


Difficulty: 51529903411245
[22.67 Mkey/s][total 46580367360][Prob 0.1%][50% in 18.2d]                     clWaitForEv
ents(NDRange,1): CL_OUT_OF_RESOURCES
Device: GeForce GTX 570
Vendor: NVIDIA Corporation (10de)
Driver: 311.06
Profile: FULL_PROFILE
Version: OpenCL 1.1 CUDA
Max compute units: 15
Max workgroup size: 1024
Global memory: 1342177280
Max allocation: 335544320
vg_ocl_context_callback error: CL_OUT_OF_RESOURCES error executing CL_COMMAND_MAP_BUFFER o
n GeForce GTX 570 (Device 0).

clEnqueueMapBuffer(4): CL_OUT_OF_RESOURCES
ERROR: Could not map row buffer for slot 0
ERROR: allocation failure?

Runtime of ~1 hour before failure.

I'm getting 61 keys/s, will my 7 letter prefix take long with such an amount of keys/second?

Ah. I guess I'll go to a paid service then =P.

is there a version i can download that gives me compressed keys?

i'm on win xp

If anyone is interested in generating compressed vanity addresses, see this Pull Request.  salfter did the CPU side, and I commented with a link to my fork that includes his work and adds OpenCL support for the GPU side.  Please be careful and verify that addresses you generate using my changes are correct before sending money to them.

Using compressed addresses saves a few bytes in the blockchain every time you spend from them.  Addresses made in the latest versions of bitcoin-qt are compressed by default, but not all clients support them (so you might want to make sure before spending hours generating one.)  A bonus is that generating compressed vanity addresses is a bit faster since there is less data to hash each time you try one.