Hi there 
Some news:
- The case insensitive search is ready and working well at almost nominal speed.
- For the search with wildcard, the speed is still very low, in that case I have to calculate the full base58 address for each generated point and the base58 is very slow, so I'm trying to implement this at the GPU level.
- I will also add an encryption mechanism for the output file and think to a manner to have a safe command line.
Some news:
- The case insensitive search is ready and working well at almost nominal speed.
- For the search with wildcard, the speed is still very low, in that case I have to calculate the full base58 address for each generated point and the base58 is very slow, so I'm trying to implement this at the GPU level.
- I will also add an encryption mechanism for the output file and think to a manner to have a safe command line.
Hi,
I just remembered a few features of "profanity" used for ETH-addresses:
Code:
--letters Score on letters anywhere in hash.
--numbers Score on numbers anywhere in hash.
--mirror Score on mirroring from center.
Source: https://github.com/johguse/profanity--numbers Score on numbers anywhere in hash.
--mirror Score on mirroring from center.
Would it be possible to implement those "modes" into VanitySearch?