Generate multiple vanity addresses in parallel

[pootsniff]

Presently one can create a list of vanity addresses to generate sequentially using the "-f " to generate multiple addresses sequentially from a file of target addresses.

Is it possible to load 5-10 prefixes/addresses into memory, or an array, and use oclvanitygen to search for them all simultaneously rather than sequentially?

This would speed up generation of multiple addresses significantly

[mautematico]

Have you tried the -k parameter?

[pootsniff]

-k parameter allows for sequential searching of prefixes. ie. 1Love, 1Happy, 1MyName

With this implementation, we'd end up searching for them in order but may generate "1MyName" and pass it over while finding "1Love". Only after finding "1Love" would it then search for "1Happy" and then once found, "1MyName"... Effectively running the same time "n" for each iteration. If the number prefixes I'm searching for is T, we're looking at a time run of effectively N(total time) = n * T.

I want to search for all three in parallel such that the vanity address generation will plow through data and if at any time finds a hit for the selected prefixes, they will be saved thus optimizing the time such that N(total time) = n for only the most difficult address while picking up the others along the way as freebies timewise.