ars_pk
Newbie
Offline
Activity: 2
Merit: 0
|
 |
February 22, 2026, 08:47:22 AM |
|
Hello everyone! I've reduced the public key for puzzle #135 and created a database of 67 million public keys/addresses. I think I'm not the first, but no one has posted a database of public keys. This database contains two public keys/addresses in the 105-108 bit range (100000000000000000000000000:fffffffffffffffffffffffffffffff). This range is easier to brute-force. The file xyz135rew_pub.txt can be used with keyhunt-Cuda and keyhunt in "xpoints" mode to find the public key. https://drive.google.com/file/d/1OZQAwZjMUkfiySSr1GlQaYivY76uAUc3/view?usp=sharingCreate a bin file for the KeyHunt-Cuda program:py pubkeys_to_xpoint.py xyz135rew_pub.txt xyz135rew_pub.bin BinSort.exe 32 xyz135rew_pub.bin xyz135rew_pub_sort.bin Launching KeyHunt-CudaKeyHunt-Cuda.exe -t 0 -r 400000 -g --gpui 0 --gpux 256,256 -m xpoints --coin BTC --range 100000000000000000000000000:fffffffffffffffffffffffffff -i xyz135rew_pub_sort.bin Launching keyhuntkeyhunt.exe -m xpoint -R -f xyz135rew_pub.txt -n 65536 -t 32 -r 100000000000000000000000000:fffffffffffffffffffffffffff The file xyz135_address.txt can be used to find the address. https://drive.google.com/file/d/1HvlzxWtziYY4Ewd1GsDHplaG851KqrqC/view?usp=sharingIf you find the private key from the database, send me a message to email ciktaa@mail.ru or write me a private message on this website to find out how to contact you, and I'll recalculate it back into puzzle #135, and the funds will be split equally. Let's find #135 together!
|
|
|
|
|
JackMazzoni
Jr. Member
Offline
Activity: 202
Merit: 7
|
 |
February 22, 2026, 11:17:47 AM |
|
Hello everyone! I've reduced the public key for puzzle #135 and created a database of 67 million public keys/addresses. I think I'm not the first, but no one has posted a database of public keys. This database contains two public keys/addresses in the 105-108 bit range (100000000000000000000000000:fffffffffffffffffffffffffffffff). This range is easier to brute-force. The file xyz135rew_pub.txt can be used with keyhunt-Cuda and keyhunt in "xpoints" mode to find the public key. https://drive.google.com/file/d/1OZQAwZjMUkfiySSr1GlQaYivY76uAUc3/view?usp=sharingCreate a bin file for the KeyHunt-Cuda program:py pubkeys_to_xpoint.py xyz135rew_pub.txt xyz135rew_pub.bin BinSort.exe 32 xyz135rew_pub.bin xyz135rew_pub_sort.bin Launching KeyHunt-CudaKeyHunt-Cuda.exe -t 0 -r 400000 -g --gpui 0 --gpux 256,256 -m xpoints --coin BTC --range 100000000000000000000000000:fffffffffffffffffffffffffff -i xyz135rew_pub_sort.bin Launching keyhuntkeyhunt.exe -m xpoint -R -f xyz135rew_pub.txt -n 65536 -t 32 -r 100000000000000000000000000:fffffffffffffffffffffffffff The file xyz135_address.txt can be used to find the address. https://drive.google.com/file/d/1HvlzxWtziYY4Ewd1GsDHplaG851KqrqC/view?usp=sharingIf you find the private key from the database, send me a message to email ciktaa@mail.ru or write me a private message on this website to find out how to contact you, and I'll recalculate it back into puzzle #135, and the funds will be split equally. Let's find #135 together! Keyhunt cannot deal with 67 million keys. It would make it very slow.
|
Need Wallet Recovery? PM ME. 100% SAFE
|
|
|
ars_pk
Newbie
Offline
Activity: 2
Merit: 0
|
 |
February 22, 2026, 11:31:52 AM |
|
Keyhunt cannot deal with 67 million keys. It would make it very slow.
KeyHunt-Cuda v1.07 COMP MODE : COMPRESSED COIN TYPE : BITCOIN SEARCH MODE : Multi X Points DEVICE : GPU CPU THREAD : 0 GPU IDS : 0 GPU GRIDSIZE : 256x256 SSE : NO RKEY : 400000 Mkeys MAX FOUND : 65536 BTC XPOINTS : xyz135_105108_sort.bin OUTPUT FILE : Found.txt Loading : 100 %Loaded : 67,143,110 Bitcoin xpoints Bloom at 000002777E06D590 Version : 2.1 Entries : 134286220 Error : 0.0000010000 Bits : 3861423773 Bits/Elem : 28.755175 Bytes : 482677972 (460 MB) Hash funcs : 20 Start Time : Sun Feb 22 16:20:55 2026 Base Key : Randomly changes on every 400000 Mkeys Global start : 100000000000000000000000000 (105 bit) Global end : FFFFFFFFFFFFFFFFFFFFFFFFFFF (108 bit) Global range : EFFFFFFFFFFFFFFFFFFFFFFFFFF (108 bit) GPU : GPU #0 NVIDIA GeForce RTX 4090 Laptop GPU (76x0 cores) Grid(256x256) [00:01:43] [CPU+GPU: 1835.49 Mk/s] [GPU: 1835.49 Mk/s] [C: 0.000000 %] [R: 0] [T: 189,246,996,480 (38 bit)] [F: 0] The KeyHunt-Cuda program was also launched on the following video cards:NVIDIA GeForce RTX 3050 Laptop GPU - 600 Mk/s NVIDIA GeForce RTX 3060 Ti - 1400 Mk/s I only have one 4090 video card on my laptop, but I know there are guys here who have a rig made of 5090.
|
|
|
|
|
JackMazzoni
Jr. Member
Offline
Activity: 202
Merit: 7
|
 |
February 22, 2026, 01:17:49 PM |
|
Have tried keyhunt with 67 million keys with 30 bit or 40 bit to gauge the speed.
|
Need Wallet Recovery? PM ME. 100% SAFE
|
|
|
|
kTimesG
|
 |
February 22, 2026, 09:14:31 PM |
|
I've reduced the public key for puzzle #135 and created a database of 67 million public keys Congratulations for "reducing" a 2**67 steps problem to a 2**80 steps problem. Much better than the guy who "reduced" it to 512 keys / 2**72 steps a few weeks ago. So who's next who wants such congratulations? I'm sure someone can do much better, maybe go "down" to one billion points, and "reduce" to 104 bits? Maybe just reduce to 1 bit and search for the key directly?...
|
Off the grid, training pigeons to broadcast signed messages.
|
|
|
Psychedelic Susa
Newbie
Offline
Activity: 7
Merit: 0
|
 |
February 23, 2026, 07:41:01 AM |
|
Hello everyone! I've reduced the public key for puzzle #135 and created a database of 67 million public keys/addresses. I think I'm not the first, but no one has posted a database of public keys. This database contains two public keys/addresses in the 105-108 bit range (100000000000000000000000000:fffffffffffffffffffffffffffffff). This range is easier to brute-force. The file xyz135rew_pub.txt can be used with keyhunt-Cuda and keyhunt in "xpoints" mode to find the public key. https://drive.google.com/file/d/1OZQAwZjMUkfiySSr1GlQaYivY76uAUc3/view?usp=sharingCreate a bin file for the KeyHunt-Cuda program:py pubkeys_to_xpoint.py xyz135rew_pub.txt xyz135rew_pub.bin BinSort.exe 32 xyz135rew_pub.bin xyz135rew_pub_sort.bin Launching KeyHunt-CudaKeyHunt-Cuda.exe -t 0 -r 400000 -g --gpui 0 --gpux 256,256 -m xpoints --coin BTC --range 100000000000000000000000000:fffffffffffffffffffffffffff -i xyz135rew_pub_sort.bin Launching keyhuntkeyhunt.exe -m xpoint -R -f xyz135rew_pub.txt -n 65536 -t 32 -r 100000000000000000000000000:fffffffffffffffffffffffffff The file xyz135_address.txt can be used to find the address. https://drive.google.com/file/d/1HvlzxWtziYY4Ewd1GsDHplaG851KqrqC/view?usp=sharingIf you find the private key from the database, send me a message to email ciktaa@mail.ru or write me a private message on this website to find out how to contact you, and I'll recalculate it back into puzzle #135, and the funds will be split equally. Let's find #135 together! Do you even understand that if the key’s position is above 50% of the range, then half of your copies are a complete waste of time? I can also create the required number of copies and even split them with the same difference — but what would that achieve? Exactly, a waste of time. If there is precise information about where it is located, then it’s much easier to retrieve it than to brute-force all the remaining possibilities. And do you realize that you would need to reduce the total number of keys from 43556142965880123323311949751266331066367? Even 10% of that entire range is already an enormous number. Your method isn’t new, and it brings no benefit for No. 135.
|
|
|
|
|
ik316m
Newbie
Offline
Activity: 7
Merit: 0
|
 |
February 24, 2026, 08:17:01 AM |
|
Hello everyone! I've reduced the public key for puzzle #135 and created a database of 67 million public keys/addresses. I think I'm not the first, but no one has posted a database of public keys. This database contains two public keys/addresses in the 105-108 bit range (100000000000000000000000000:fffffffffffffffffffffffffffffff). This range is easier to brute-force. The file xyz135rew_pub.txt can be used with keyhunt-Cuda and keyhunt in "xpoints" mode to find the public key. https://drive.google.com/file/d/1OZQAwZjMUkfiySSr1GlQaYivY76uAUc3/view?usp=sharingCreate a bin file for the KeyHunt-Cuda program:py pubkeys_to_xpoint.py xyz135rew_pub.txt xyz135rew_pub.bin BinSort.exe 32 xyz135rew_pub.bin xyz135rew_pub_sort.bin Launching KeyHunt-CudaKeyHunt-Cuda.exe -t 0 -r 400000 -g --gpui 0 --gpux 256,256 -m xpoints --coin BTC --range 100000000000000000000000000:fffffffffffffffffffffffffff -i xyz135rew_pub_sort.bin Launching keyhuntkeyhunt.exe -m xpoint -R -f xyz135rew_pub.txt -n 65536 -t 32 -r 100000000000000000000000000:fffffffffffffffffffffffffff The file xyz135_address.txt can be used to find the address. https://drive.google.com/file/d/1HvlzxWtziYY4Ewd1GsDHplaG851KqrqC/view?usp=sharingIf you find the private key from the database, send me a message to email ciktaa@mail.ru or write me a private message on this website to find out how to contact you, and I'll recalculate it back into puzzle #135, and the funds will be split equally. Let's find #135 together! Don't waste you time in keysubtraction, I have spend weeks understanding this and end up saying it is no use for 135 or higher range. The more you subtract the more keys you will end with. I am using 4 subtracted keys for 135 falling in range 40000..:4ffff... one of the key will fall in the said range and the others not. 02e3d171ac16b58a231f45cdaa48be38d77b551738263757cb966f9b07b314c1f3 # + 5444517870735015415413993718908291383296 02a60193351a967b81a16b359bc6c3007f6271d6a8f903c410158705ff7e7d1471 # + 10889035741470030830827987437816582766592 02ac78ecec31fd54885da734739e2b827e98b034dbe587483f95c0b69dcbce6691 # + 16333553612205046246241981156724874149888 02145d2611c823a396ef6712ce0f712f09b9b4f3135e3e0aa3230fb9b6d08d1e16 # target
|
|
|
|
|
|
kTimesG
|
 |
February 24, 2026, 10:44:22 AM |
|
I am using 4 subtracted keys for 135 falling in range 40000..:4ffff... one of the key will fall in the said range and the others not.
You know what I'm about to say, right? Congratulations for "reducing" a 2**67 steps problem to a 2**68 steps problem. C'mon guys, really, no one yet with the 32 GB worth of reduced points? One of those will surely be in the 104-bit searched interval.
|
Off the grid, training pigeons to broadcast signed messages.
|
|
|
bill32767
Newbie
Offline
Activity: 27
Merit: 1
|
 |
February 24, 2026, 04:26:52 PM |
|
This puzzle is very strange. If it's for measuring the world's brute forcing capacity, 161-256 are just a waste (RIPEMD160 entropy is filled by 160, and by all of P2PKH Bitcoin). The puzzle creator could improve the puzzle's utility without bringing in any extra funds from outside - just spend 161-256 across to the unsolved portion 51-160, and roughly treble the puzzle's content density. If on the other hand there's a pattern to find... well... that's awfully open-ended... can we have a hint or two?  I am the creator. You are quite right, 161-256 are silly. I honestly just did not think of this. What is especially embarrassing, is this did not occur to me once, in two years. By way of excuse, I was not really thinking much about the puzzle at all. I will make up for two years of stupidity. I will spend from 161-256 to the unsolved parts, as you suggest. In addition, I intend to add further funds. My aim is to boost the density by a factor of 10, from 0.001*length(key) to 0.01*length(key). Probably in the next few weeks. At any rate, when I next have an extended period of quiet and calm, to construct the new transaction carefully. A few words about the puzzle. There is no pattern. It is just consecutive keys from a deterministic wallet (masked with leading 000...0001 to set difficulty). It is simply a crude measuring instrument, of the cracking strength of the community. Finally, I wish to express appreciation of the efforts of all developers of new cracking tools and technology. The "large bitcoin collider" is especially innovative and interesting! Thank you @saatoshi_rising for this kind gesture, I appreciate you for making this puzzle an interesting one & for your funds you freely gave out to the community. In my humble suggestion, probably anytime you see this quote (that is if you would see it  ), I humbly plead, you can make this puzzle more enticing by showing off the pub. key of some of the unspent addresses with a little spend maybe from the ± 101th key (± 101 i.e 2^100 - 2^160 keys or 2^99 - 2^71 keys), or keys with odd numbers (e.g key 71, 73, 75 etc) or keys with even numbers (e.g 72, 74, 82 etc) which ever you choose, at your own discretion or maybe randomly (e.g key 71, key 83, key 79 etc), probably between now and 2027 to mark 10 years anniversary you made this comment here  This puzzle is now at a very very difficult state almost impossible state, cracking bitcoin is even harder (impossible), these facts has been proven to be true no doubt. This puzzle has been on for 10yrs + and some people that saw it from the onset are no more (I hope the OP of this puzzle is very much more since Last Active here is June 09, 2019, 07:10:05 PM  ) to see its end. I thank the heavens I am still around and will be to see the end of it I believe the purpose of this puzzle has been achieved 100% & facts proven to show bitcoin is like the Rock of Gilberta, it can never be moved  That being said, I oblige the OP @saatoshi_rising (and/or whoever that's in charge) to see this fun filled research come to an end in a short while by considering my request, my humble suggestion & plea. peace & love
|
|
|
|
|
Cricktor
Legendary
Offline
Activity: 1414
Merit: 3672
|
 |
February 24, 2026, 09:37:18 PM |
|
... Give me a break! Just because you're too late to the solving party, you're asking for a low-effort, easy way to hope to grab some of the coins? Sorry, but that's bonkers and your proposal makes no sense and wouldn't prove anything new. Disclosing public keys for puzzles in the 7x or 8x would be solved in mere seconds. There's nothing beneficial to ask for it besides you being greedy and lazy. It's totally fine that we're currently in a situation where the grinding with currently known methods isn't quite economical. That's a worthy outcome for the likely purpose of this Bitcoin challenge grinding puzzle. When known methods don't make it feasible, it's time to find something new if there's something new. Obstacles are a motivation to come up with something clever. And if there's nothing more clever so far, then this is also good to know. Innovation doesn't come from an environment where things are easy going.
|
|
|
|
0xastraeus
Newbie
Offline
Activity: 23
Merit: 0
|
 |
February 24, 2026, 09:51:03 PM |
|
In no way is this going to happen. Public keys have already been released for various puzzles, it's a shame you were too late to join in at that time. The puzzles you want public keys for will be solved in seconds. Releasing more will go against the whole premise of "cracking strength of the community." Now it's just figuring out better algorithms, better strategies, and so forth. More public keys is not needed period. This puzzle is very strange. If it's for measuring the world's brute forcing capacity, 161-256 are just a waste (RIPEMD160 entropy is filled by 160, and by all of P2PKH Bitcoin). The puzzle creator could improve the puzzle's utility without bringing in any extra funds from outside - just spend 161-256 across to the unsolved portion 51-160, and roughly treble the puzzle's content density. If on the other hand there's a pattern to find... well... that's awfully open-ended... can we have a hint or two?  I am the creator. You are quite right, 161-256 are silly. I honestly just did not think of this. What is especially embarrassing, is this did not occur to me once, in two years. By way of excuse, I was not really thinking much about the puzzle at all. I will make up for two years of stupidity. I will spend from 161-256 to the unsolved parts, as you suggest. In addition, I intend to add further funds. My aim is to boost the density by a factor of 10, from 0.001*length(key) to 0.01*length(key). Probably in the next few weeks. At any rate, when I next have an extended period of quiet and calm, to construct the new transaction carefully. A few words about the puzzle. There is no pattern. It is just consecutive keys from a deterministic wallet (masked with leading 000...0001 to set difficulty). It is simply a crude measuring instrument, of the cracking strength of the community. Finally, I wish to express appreciation of the efforts of all developers of new cracking tools and technology. The "large bitcoin collider" is especially innovative and interesting! Thank you @saatoshi_rising for this kind gesture, I appreciate you for making this puzzle an interesting one & for your funds you freely gave out to the community. In my humble suggestion, probably anytime you see this quote (that is if you would see it  ), I humbly plead, you can make this puzzle more enticing by showing off the pub. key of some of the unspent addresses with a little spend maybe from the ± 101th key (± 101 i.e 2^100 - 2^160 keys or 2^99 - 2^71 keys), or keys with odd numbers (e.g key 71, 73, 75 etc) or keys with even numbers (e.g 72, 74, 82 etc) which ever you choose, at your own discretion or maybe randomly (e.g key 71, key 83, key 79 etc), probably between now and 2027 to mark 10 years anniversary you made this comment here  This puzzle is now at a very very difficult state almost impossible state, cracking bitcoin is even harder (impossible), these facts has been proven to be true no doubt. This puzzle has been on for 10yrs + and some people that saw it from the onset are no more (I hope the OP of this puzzle is very much more since Last Active here is June 09, 2019, 07:10:05 PM  ) to see its end. I thank the heavens I am still around and will be to see the end of it I believe the purpose of this puzzle has been achieved 100% & facts proven to show bitcoin is like the Rock of Gilberta, it can never be moved  That being said, I oblige the OP @saatoshi_rising (and/or whoever that's in charge) to see this fun filled research come to an end in a short while by considering my request, my humble suggestion & plea. peace & love
|
|
|
|
|
brainless
Member

Offline
Activity: 470
Merit: 35
|
 |
Today at 11:05:20 AM |
|
... Give me a break! Just because you're too late to the solving party, you're asking for a low-effort, easy way to hope to grab some of the coins? Sorry, but that's bonkers and your proposal makes no sense and wouldn't prove anything new. Disclosing public keys for puzzles in the 7x or 8x would be solved in mere seconds. There's nothing beneficial to ask for it besides you being greedy and lazy. It's totally fine that we're currently in a situation where the grinding with currently known methods isn't quite economical. That's a worthy outcome for the likely purpose of this Bitcoin challenge grinding puzzle. When known methods don't make it feasible, it's time to find something new if there's something new. Obstacles are a motivation to come up with something clever. And if there's nothing more clever so far, then this is also good to know. Innovation doesn't come from an environment where things are easy going. Already happen when puzzle 161 to 256 coin shifted to 1 -160 puzzle 2nd happen creator funded more coins into these puzzle No one can assume what's next creator do with these puzzle, Due to price drop from 125k to 66k, may be creator fill-up more funds into unsolved puzzle, for people's to try their attempt for saving As previous talks on board last bit but sharing snario is pool, and no one talking about it too Seems no one want waste time n money in pool base attempt definitely result would not fruitful Only high reward will attract people to connect with this puzzle Let's hope creator announce something better for community
|
13sXkWqtivcMtNGQpskD78iqsgVy9hcHLF
|
|
|
GnSekhar
Newbie
Offline
Activity: 11
Merit: 0
|
 |
Today at 01:21:33 PM |
|
I think we Y’all know 1PWW3Tv9QdK4AdJ2HqwRkuBnotfaEoVzXU its PUB Key is 02fba7a69f53850585d5bdcb4653e3570c1d461ee17672de2d17b82ce286a55d79 and PKH is F6E712D61FD09E6B7FF56D659CB37B0CE27070BA
if this one is in same 271 Key space it may near to the puzzle 71? What if it does? i mean if it was in 71 bit key space...
|
|
|
|
|
|