Bottleneck, and my 31 character limit. Ideas?

[atom]

Well yeah from what you need to know about GPU's that you need an amplfier for fast hashes:

https://hashcat.net/wiki/doku.php?id=fre...king_speed

Rules are a good way to archieve such an amplification. A good number of rules is 1000. The more the better:

https://hashcat.net/wiki/doku.php?id=fre...full_speed

You just need to find a way to create such a scenerio. Means we have to divide a part of the workload from the problem and applying it back again later. From a math standpoint it's like doing this:

N!(13) = 6,227,020,800
N!(10) = 3,628,800

So the quotient is 1,716 which is the first number > 1,000 so that's why I took it so that's the reason why the rules use ABC, they could also use 6789 if i wanted to do that.

Technically we just generate N!(10) now for the base-word input and then we use rules to mutate those in a way that it does exactly what's needed to the same as we would use N!(13). To get to all we need to find is the offset points for the remaining A, B, C values. Those are not so easy to find because they themself modify the base word with each insert rule applied that's why i cheated and used the permute.bin itself to print them out.