Quote from: btc11235 on Today at 07:01:34 PM

Quote from: cctv5go on Today at 06:17:56 PM

You're wasting your time. It's better to do something else meaningful。

Thanks, but I'd still like to know if I'm better off trying my luck at A) ~120 Mkeys/s address search on, say, puzzle 68, or B) ~880 Pkeys/s BSGS search on, say, puzzle 135...

I mean, does it end-up being basically equal...? I can apparently search much faster on BSGS, and if the search space grows at roughly the same rate as my calc speed (or a little more), then I'd rather try for puzzle 135 since the reward is double... But if the search space for BSGS is still based (at least somewhat) on the address search range, then I'm guessing the fact that I can do "Pkeys/s" on #135 doesn't make-up for the exponential difference in search space size over #68...

Address: 2**67 / (120 M/s) = 38,996 years maximum (19,498 years expected)

BSGS: [max_ops] / (880 P/s) = Huh

years

Replace max_ops with whatever op count are required, it probably depends on the size of the baby steps table (which depends on how much RAM you have available).

You might find BSGS would need billions of years for your setup. It's already explained that there isn't enough storage on our planet to hold your baby step table to have the complexity reduced to sqrt(N).