Using regular expression match instead of prefix, is there a way to add a difficulty and probability check? Seems to only report keys/s and total keys tested.

  • I don't think vanitygen does much beyond generating addresses and checking them.
    – John T
    Mar 14 '14 at 22:34

There is no simple algorithm to estimate the difficulty. Doing that requires you to first determine the cardinality of the intersection between the regular language expressed by the input regular expression, and the set of all valid public keys.


Assuming the output is random:

How many randomly generated texts (in the base58 dictionary that *coin addresses use) are going to match my regex?

The output is not exactly random, so that's a shame, but it will give you a good enough indication.

Remember they call it vanity addresses for a good reason! It's all kind of vain.

This site is temporarily in read only mode and not accepting new answers.

Not the answer you're looking for? Browse other questions tagged .