Search content
Sort by
Showing 4 of 4 results by vklimin
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
I wonder, if we somehow know the starting number, which we are doubling, can we determine or calculate number of doubles it requires to reach value 1?
This is surely related to EC calculations and I believe it certainly will help minimize size of private key bay many folds, depending on doubles!!!
This is surely related to EC calculations and I believe it certainly will help minimize size of private key bay many folds, depending on doubles!!!
This task has an analytical solution.
Try to ask Gemeni Pro Chat https://chat.googlegemini.co/ about it.
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
Quote
There is no instant solution and it all boils down to the fact that you have to know C++ or some other compiled language like Rust........
Khm... Is there Python ECDSA library works with CUDA cores? I searched and didn't find.
, but for educational purposes, what is specifically required is Python code for CUDA that can brute-force keys. Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
For educational purposes. Can anyone provide Python code for iterating through private keys in a specified range that works with CUDA? Or a link to such a resource.
Thank you.
Thank you.