Bitcoin Puzzle Scanner

[rukkamind]

Bitcoin Puzzle Scanner - Professional GPU-based private key search tool
Searches for Bitcoin private keys by matching public key X coordinates

I’ve spent this month focusing more on programming than anything else.
I have several projects in the works, but this is the first one of the year to be completed.

I’ve uploaded it to my GitHub: https://github.com/ebookcms/bitcoin-puzzle-scanner

This tool searches for any puzzle as long as the public_key is known.

I have two more projects in the final stages: one using the BSGS method and another that searches by hash160.
All of them are built for CUDA.

[Redni]

This repository does not contain any code.

[rukkamind]

My bad. Now I upload files, please confirm

[Redni]

- No CUDA kernel sources = unknown what the code does
- "Authentication required" with GPL-3 = licensing nonsense
- "100% clean, no backdoors" promises = unverifiable

Besides, what's the point of this project? Is it an experiment, playing with code? The closest thing to an unsolved puzzle with public key is 135; pure brute force has no chance here.

[kTimesG]

You should maybe inform the LLM that wrote you this nonsense that brute-forcing public keys is idiotic, to say the least.

[rukkamind]

If you think is Idiot, for puzzles #135, #140, #145, #150, #155 and #160 has Public_key, of course I have my bsgs version is faster (WIP). I develop myself, yes have a lot other myabe faster with optimization, but mine I'm 100% sure and some lucky will find. You can try solved puzzles to try with Public_key (all works).
If you think this script is of no use at all, I don't know if it makes sense to publish the bsgs version; of course, you can use AlbertoBSGD's keyhunt.

[kTimesG]

You can try solved puzzles to try with Public_key (all works).

I didn't say it would not work, all I said is that it would be idiotic to do this.

ECDLP problems are not solved by brute-force (unless one is an idiot and actually starts doing such an idiotic thing, which is: exponentiating the minimum known complexity from sqrt(n) to n).

[nightdreams]

Bitcoin Puzzle Scanner - Professional GPU-based private key search tool
Searches for Bitcoin private keys by matching public key X coordinates

I’ve spent this month focusing more on programming than anything else.
I have several projects in the works, but this is the first one of the year to be completed.

I’ve uploaded it to my GitHub: https://github.com/ebookcms/bitcoin-puzzle-scanner

This tool searches for any puzzle as long as the public_key is known.

I have two more projects in the final stages: one using the BSGS method and another that searches by hash160.
All of them are built for CUDA.

Full of LLM code
Good for your own learning but not good for puzzle

[jovica888]

Is this really the result of the test
~4.5 min for puzzle 40?
When I test my code on the puzzle, I always substract lower value for the range and then I start from 1G

I mean, I made some lame scanner in RUST, and RUST is using ICE DLL library, using 6 cores, random jumps

I start from positions

1G 2G 3G 4G 5G and Public Key - that is 6 cores...
Then I generate 1.000.000 random jumps, but all jumps are mod 5=0
Then I use the last 7 digits of the X value to determine which jump will be used
I enter how many "00000" I want to be stored as DP points

I get like 400.000 jumps per sec per core

I solve puzzle 40 in
🎯 Private key found: 0x701110000f
⏱ Time: 1.7 seconds