Exploring BSGS for Old BTC Addresses

I’m thinking about using BSGS for those ancient 50 BTC addresses. There’s a lot to cover, like the full 2^256 range. Anyone know if there's software that can handle that? Something that goes beyond 80 bits?

Check out this thread about the BSGS solver for CUDA. If you read through it, you'll find what you need.

Awesome, thanks a lot! I’ve been trying to run a couple of programs, but I keep hitting walls. I fixed one error, but now they just start and crash without any info. So weird.

Try launching it in a terminal. You might catch error messages before the window closes. If it starts and stops without output, there could be missing input or setup issues. Just make sure all your parameters are in check.

Yeah, I’ve done that. Ran the.exe with and without arguments. Nothing shows up, it just doesn’t do anything. Really frustrating.

You should try a debugger like x64dbg. It could help find silent crashes or issues with loading a GPU kernel. Also, test with minimal commands to check if it even writes anything.

This isn’t bitcrack or anything. PureBasic compiled programs with GUI are what I’m working with. No compile errors, just dead silence when I run the.exe.

Look, cracking 256-bit keys using BSGS sounds fun, but let's be real about the tech limits here. It ain't just a walk in the park.

Not sure what you’re on about, but that sounds like spam.

I've been using Collider BSGS, and it’s super optimized. No issues on my end. I tweaked it for RX5090 cards, and I’m getting 60-64 Exa keys/sec while scanning. Anyone else getting these speeds?

That’s cool, but BSGS on 256-bit? Not likely to be effective. I'm working on a hybrid method, combining BSGS with Pollard’s kangaroo. Think it could be way faster.

Wait a second. Collider BSGS runs on RTX5090, and it handles any space you give it. Speeds stay consistent around 64 Exa keys/sec, if set up right.

You gotta grasp how BSGS operates. You’re just creating a huge key database and searching through it it's way more memory intensive than thread count. I built a faster version called keyhuntBSGS for GPUs, but it’s not open-source yet.

You mention BSGS needing a lot of memory. Can you clarify? Are we talking RAM or GPU memory? What specs did you use to hit those 44 Ekeys/sec?

Using a CPU with 180GB RAM and 192 threads. It’s a beast.

No software can take 50 pubkeys and brute-force keys from the full 2^256 space. That’s just impossible with our current tech in 2026.

The entire 2^256 space? No way. But with pubkeys and algorithms like BSGS or Kangaroo, it might still be feasible.

Just to clarify something keyhuntBSGS creates an HTable each time, taking ages based on system power and scan size. ColliderBSGS only generates it once, but takes forever if the GPU memory is under 32GB. Speed is great once it’s running, but starting it is a nightmare.