Sequential search

[sssergy]

Alberto, good afternoon.
Sequential search question.
Can you filter out characters that are repeated 2-3 times?
Yes, I understand that the speed will drop significantly, but iterating over repeated characters takes most of the work.
Sorry, I'm writing with a translator.

[albertobsd]

This is for addrees mode?
Or what kind of characters did you mean?

Please feel free to add a visual example of what you want it will be more helpful

[sssergy]

This can be used in any mode.
On such small ranges, it is almost impossible to find more than three repeating characters, and even then this is a rarity. It makes no sense to sort out combinations of type; FFFFFFFFF, 800000000, AAABBBCCCDDD etc.

[albertobsd]

Ooh now i get you. I understand what is what you saying, letme think in that, because it is some difficult develop that part in code.

Thanks

[sssergy]

There are many password generators with this functionality, some of the code can be taken from there.

[sssergy]

https://hashcat.net/hashcat/
https://github.com/Mebus/cupp
https://github.com/hashcat/maskprocessor
For example, these programs have this functionality.
Once upon a time I used them in conjunction with the brainflayer.
Also, hashkat has an OCL version.
You can use GPU to create bloom filter.
I think it will be possible to buy time on this.

[albertobsd]

Ok, thanks i will try to implement this :)

[BrabusNight85]

AAA