What about 135 puzzle? I have managed to reduce 135 bits down to 120 bits how long would it take?.
Why did you stop the reducing at 120 bits? I'd go full-blown to 1 bit. Let us know if it's a zero or not.
The possible public keys exponentially grow.. By the time i reduce 3 digits from the end if have 1 trillion plus possible public keys
Really? That's a lot of keys. So let me formulate the question another way: once you reduce 135 to 120 bits, is that equivalent or not to having 32768 public keys, of which one of them corresponds to a 120-bit key, while the rest of 32767 correspond to 256-bit keys?
If so, how do you pick the one public key to search for, to have a good reason of calling this as a "reduction" and not an "expansion"?
I really want someone to work with..
Ask @kTimesG for that. He has the software, and you have the hardware. Good luck!
Using 900 RTX 4090, it will take 583 days to break 135, using my software (~ 5.6 Gk/s on a single 4090). It was worth it for 130, but 135, not so much, costs are higher than the reward. We need either much higher computing power, or some advancements in EC math (some fast parallel XGCD would help, since this is the current bottleneck - all threads except one are idle, waiting for a batched inversion to finish). Doing multiple XGCD in parallel (like what JLP version does) is actually a lot slower than doing one "master" batched inversion. Ehm...