Next scheduled rescrape ... never
Version 1
Last scraped
Scraped on 03/08/2025, 07:35:57 UTC
Guys i wanna share with you a tool that i was developing
its a GPU binary transformator for searching bitcoin puzzle
https://github.com/puzzleman22/bitcoin_puzzle_transformation
its a GPU binary transformator for searching bitcoin puzzle
https://github.com/puzzleman22/bitcoin_puzzle_transformation
The GPU part of the code is way too complex to be efficient.
Consider simplifying it (a lot!)
that is the point, the binary transformations involved create unique values(no repeatence, no collisions) and hit areas of the range that random or sequential may never reach,
yes, its not that fast, there is trade-off, but its unique in its own way
so threoretically there are multiple targets (horizontally or vertically or inversion or reversed) - hitting which automatically reveals the main private key, and i believe it could be effective
and because all transformations are in binary format they are quite accurate, hitting those tiny places, that random or sequential may never reach
for a better understanding i made a pc version of the same algorithm on python https://github.com/puzzleman22/Bitcoin-puzzle-transformations-CPU
yes of course I realize that the range is still huge
I believe that with enough computational power this method can be very effective
I'm already testing it on 45 bits to see how long it will take, but I believe it has great promise. I'm sorry I'm poor and can't contribute, but who knows, maybe something will happen, and I will definitely remember you. Thank you.ps: can't really work with any interval other than starting with 1 to 1?
Original archived Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
Scraped on 03/08/2025, 07:31:29 UTC
Guys i wanna share with you a tool that i was developing
its a GPU binary transformator for searching bitcoin puzzle
https://github.com/puzzleman22/bitcoin_puzzle_transformation
its a GPU binary transformator for searching bitcoin puzzle
https://github.com/puzzleman22/bitcoin_puzzle_transformation
The GPU part of the code is way too complex to be efficient.
Consider simplifying it (a lot!)
that is the point, the binary transformations involved create unique values(no repeatence, no collisions) and hit areas of the range that random or sequential may never reach,
yes, its not that fast, there is trade-off, but its unique in its own way
so threoretically there are multiple targets (horizontally or vertically or inversion or reversed) - hitting which automatically reveals the main private key, and i believe it could be effective
and because all transformations are in binary format they are quite accurate, hitting those tiny places, that random or sequential may never reach
for a better understanding i made a pc version of the same algorithm on python https://github.com/puzzleman22/Bitcoin-puzzle-transformations-CPU
yes of course I realize that the range is still huge
I believe that with enough computational power this method can be very effective
I'm already testing it on 45 bits to see how long it will take, but I believe it has great promise. I'm sorry I'm poor and can't contribute, but who knows, maybe something will happen, and I will definitely remember you. Thank you.ps: can't really work with any interval other than starting with 1 to 1?