Hello, is this what you need?
Hi, it's close but not so much, here is the logic:
Target = 3487790154155768 now if we subtract 99 G from it, on our 68th subtraction we will land on 3487790154155700, then we can divide it by 100, to get 34877901541557 now with this new key our 57th subtraction lands on 34877901541500 , then we divide it by 100 to get 348779015415 , but since we don't know which key is what, we would consider our target as 100 then by subtracting G 99 times from it, we will have 100 keys, 1, 2, 3, 4, ...........100. We divide and index them in order, like:
Target(100)/100 = 100/100, 99(which is -1 of our target)/100, 98/100, 97/100. We don't save them all, we just specify that we want our target to be divided by 100 for 30 times in a *row and it keeps doing that.
We just need to divide our key by 100, for 2 or 3 times as a test.
*= lol, I didn't calculate RAM needed for such exponentially large number.
How is that i9 able to outperform the 4090 in straight brute forcing?
By polishing.😉