I do not want to be offtopic, but guys did you calculated what computing speed is required to scan the entire range of 130 puzzle?
For the range: 200000000000000000000000000000000:3ffffffffffffffffffffffffffffffff, which have: 680564733841876926926749214863536422912 total keys to scan, on a speed of 100 YottaK/s it would take almost 215657 years to finish
Not to mention that the highest reported speed on a single 4090 was only 7-8Gk/s .
So is there something that I miss, why you still bother to scan beyond 125?
I mean even if you change the bit range to scan to 160 bit range, is still impossible with the current gpu's, maybe with photonic gpu's we might have a chance.
Yeah...that's not how it works. What you are describing/showing the math for is a brute force approach.For the range: 200000000000000000000000000000000:3ffffffffffffffffffffffffffffffff, which have: 680564733841876926926749214863536422912 total keys to scan, on a speed of 100 YottaK/s it would take almost 215657 years to finish
Not to mention that the highest reported speed on a single 4090 was only 7-8Gk/s .
So is there something that I miss, why you still bother to scan beyond 125?
I mean even if you change the bit range to scan to 160 bit range, is still impossible with the current gpu's, maybe with photonic gpu's we might have a chance.
With Kangaroo, and #130, you need to do 130/2 + 1.05 = 2^66.05 ops.
Now, recalculate.