Quote from: ThePiachu on August 18, 2012, 06:19:35 PM

I`m looking forward to trying out how it works, thanks! Does it have all the features listed in the requirements, so I can send you the bounty afterwards?

Yes, please! It should meet all the requirements. One minor exception though, it looks like you specifically want 64-bit Windows binaries, but I only build the OpenCL pieces for 32-bit Windows. This can be changed.

Quote from: ThePiachu on August 18, 2012, 06:19:35 PM

Actually, I did talk to the person and they wanted just the capitalised version. They didn`t know that the pool is case-sensitive, so I payed for the other version and added a note on the work submission about the issue.

Later I will want to include regular expressions into the pool, but those might be a bit harder to check for validity at the initial stage.

Indeed, determining a "difficulty" for a PCRE style regular expression is quite the can of worms.

It should be possible to design a subset of PCRE that can be converted directly into a bunch of prefixes, instead of having to execute the regular expression on each potentially matching address. The idea would be to force the RE to start with a ^, disallow *, limit the length, and limit the resulting number of prefixes. This would be a lot more expressive than a case-sensitive or case-insensitive prefix, and just as fast to search. It would also solve the problem of executing REs on the GPU, as long as the RE isn't so complicated that it creates a search table that is too large to fit on the GPU.