dan.wallet

But how do you figure out the "best" DP? The original used x, y, z. What's your method for that, especially in terms of selecting based on range? And what’s this “too random” you mention? It's confusing.

A 4090 should hit at least 6,000 MK/s. If not, something's off with your code. The 5090's almost at 9,000 MK/s, but it needs more optimization to really shine.

One pool marks a range complete once someone finishes it, so no one else can claim it. The other two encrypt their ranges. One might know searched ranges, but one definitely doesn’t. Not sure why anyone still uses the…

I know of at least three public pools making progress on the 67 challenge. One’s almost 5% done. Why limit the range completion time to just 60 seconds?

You're estimating based on your setup. The longer the prefix, the lesser chance of collisions. Are we on the same page?

Stop sharing anything public! No working script should be out there like that. Using 1 bit for keys sounds wild. Imagine storing 100TB with enough power!

For the 40-bit range, I had zero collisions. What’s the size needed for higher ranges, though? Can we parallelize this work?

Sounds interesting! How does it actually work?

JLP's BSGS is CPU only, while yours supports GPU. Side by side tests show that BSGS Cuda is faster for multiple pubkeys.

I ran the same benchmarks as Etar and JLP for 16 pubkeys. JLP on CPU took 3 hours and 35 minutes for comparison.

Had my RTX 3070 running at 1,000 MKey/s with default settings. Didn’t mess with anything to optimize.

Sweet, I’ll update you on speeds across different GPUs once I run some tests.