BSGS versus Pollard Rho
So, if I run one RTX 4090 with BSGS and another RTX 4090 with Pollard Rho, which one's gonna be quicker? What are their speeds like per second?
I really wanna hear about this from actual users, not some AI stuff.
Also, is there a VRAM bandwidth issue that's holding back the BSGS? I've heard that before, is it legit?
BSGS versus Pollard Rho
3 replies 52 views
If you're talking about secp256k1 against a normal random key, the honest answer is neither wins in any meaningful way. Both are still living in the same sqrt(N) universe, and for a full 256-bit keyspace that's basically "heat death of the universe" territory.
So the only time this comparison matters is when you've already got a constrained problem, like a known interval, partial bits, a broken RNG era keygen, or some other structure that collapses the search space.
BSGS is memory-bounded and requires storing and/or looking up each computed point.
GPUs are not built for solving memory-bound problems, they are compute-oriented devices. They can compute points very, very fast, but if each of those points (living in GPU registers - basically on the transistors directly connected to the execution cores) need to pass through to VRAM, it's pretty much game over (expect a slowdown by 100x and plenty of other bottlenecks).
So, Pollard Rho wins here, since memory access is basically zero. However, Rho is only useful if the interval is not known (e.g. the key can be anywhere in the full scalar domain, not restricted to a range).
Also there's not enough total memory on planet Earth to be able to run a real BSGS solver, using any device in existence (GPU, CPU, or clusters of supercomputers), if the interval size is above 100-ish bits. And even so, all of that memory would have to be connected to a single central computer, otherwise it's no longer fast memory, it's a disk storage database,. Such technology does not yet exist, and it's pretty much an alien-technology level fantasy.
I'm interested in real data using 4090 based on your experience. FYI this only for puzzle where the range is known.
?Reply
Sign in to reply to this topic
Related topics
- Twist Attack, Sub-Group Attack and Pollard-Rho Implementation Issues 4
- Pollard's Kangaroo Pool for tackling the #130 Puzzle 11
- Bitcoin Core displaying coins (UTXOs) in a new tab 13
- Are you in favor of BIP-110? Let's get a Bitcoin poll going. 0
- Erlay seems to have some issues here’s a better proposal for a bitcoin protocol without invites 3
- New Optional Hourglass Implementation is Live 3