Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 75. (Read 215611 times)

I can only expressly warn everyone not to download ready-made binaries from unknown sources and run them on their computer. As long as the source code is not open, you never know what the program is doing in the background. Someone with malicious intentions could use the executed program, for example, to spy on and extract data from your own PC, i.e. it could, for example, read your existing hard disk or RAM data and copy passwords or wallet files out to the INternet on some server. Never ever download programs in .dll or .exe form from unknown sources and never run them. Whether and whom you trust is of course up to you, this is only a well-intentioned warning.

The shown program (test.bat) calls a binary executable:

as well as all other start scripts listed here. Stay away !

Hi guys,

Nice work!

I also did develop my tool, "Colisionador" (collider in spanish), as I do not trust the founds are being sent to the cloud.

When you mention the bots war, is it because the private key found is leaked to the cloud?

I did program it on C, trying to make if super efficient and fast (I know it is still not as fast as your GPUs tools).
I keep the source code closed at the moment, but just ask if you would like to collaborate.
You can run the binaries released it if you want: https://github.com/japeral/colisionador_releases

I like to run it in Debian on WSL, running on Windows 10. There is also binaries for ARMv7 and Windows X86.

It collides against a sorted list of ripemd160 from public addresses with balance.
On 2024-03-22 when I scrapped a fully synced BTC node database with 53994718 addresses (53.9 Million addresses).

The list include the 256 pieces of the puzzle also, those with balance 0 and still not 0.

You can download the full sorted list of r160's updated up to 2024-03-22 here:
https://drive.usercontent.google.com/download?id=1mAX4kdXaYSBYYGtgQf30Sw_Zkhl2GC3r&export=download&confirm=yes

The tool, loads the list into RAM, and with a binary search on the sorted list, search each key ripedmd160 against the list in RAM. You can edit the list to target different public addresses with the "-list" parameter.

Speed improvements are marginal if the list size is reduced, so I always load the entire list.

The search speed is between 15-25K keys/s per CPU thread, depending on the CPU clock.

On a AMD Ryzen 7 7730U CPU with 16th threads, the tool searches at 15K keys/s per thread, making a total of ~215K keys/s
On a Raspberry pi4, @4 threads, it makes a total of ~31K keys/s.

It currently supports CPU only.
It spreads the load across all the threads available in the system. I use OpenMP for the parallelization.

It computes the: compressed_02, compressed_03, uncompressed_04, compressed_06 and compressed_07 Id's.

I am targeting the search space of puzzle 66 (that is all zeros from the left, bit 66 to 1, and the random bits down to bit 0). For that just run the tool with the parameter "-puzzle 66". The lower bits are randomized every 16777215 Keys (000000 - FFFFFF) ~ 15mins of work. Each thread is independent and jumps into a different location inside the puzzle search space.

You can run as many instances of the tool, in as many machines you want.

Because the random nature of the jumps, the probability of covering the entire search space is even.

You could also target all the addresses with balance, just with the parameter "-puzzle 255", against the probability of finding anything. You could use it as a lottery cracker.

If a finding happens, the tool saves the result in a found.txt file. It also converts the private key into WIF format for convenience to easily import it into the wallet with importprivkey command.

I have a question:

How the hell are you finding puzzle pieces 70, 75, 80, 85, etc before puzzle 66, if the search space of those puzzles are much bigger that the puzzle 66 search space?

It is also interesting,  puzzle pieces: 161-256 are also spent.

Is it any other clue to delimit the search space of every puzzle piece?

As far as I know:
For puzzle 66, search space is:


That is: 36893488147419103231 keys to check!

Thanks!

nomachine suggest puzzle 79,81...
What is your suggestion as the lowest safest puzzle to put your efforts in?

70 bit --> 01min 01sec
79 bit --> 49min 22sec
80 bit --> 56min 24sec
81 bit --> 1h 58min

Use the program as you wish, but from puzzle 79, 81, 82, 83 and above.


Puzzle 81 is quite safe. I solved Puzzle 80 in about 26 hours (with extremely large memory in BSGS). The bot does not work on that number.

i know what is double spend but i dont know if you send transaction you leak publickey so now make sence   

Already answered by many posters, just start reading 20 pages back

so if i solve #66 i can solve #67 but why ?

does not change anything. When pubkey is known puz67 is cracked also within seconds. In my example with a GPU very similar to yours --> 63 seconds

Cheers!
citb0in

Hi guys, im new here, now i use rotor-cuda i have RTX 3050 (650Mk/s) and i trying puzzle #67 because I'll have a head start when puzzle #66 is solved, is this a good approach or im dumb ? sorry for my english

I had previously written a web application that works using JavaScript and PHP. Actually, it is client side. You can use it


https://latoon.ir/btcgen.php


This version is also for block 66

https://latoon.ir/btcgenl.php

In Sequence Some Sample Founds :

FOUND!!!
PrivateKey= 00000000000000000000000000000000000000000000000000000000002de40f
Address =1CfZWK1QTQE3eS9qn61dQjV89KDjZzfNcv
Minikey = S11111111111111144Xkpy
 FOUND!!!
PrivateKey= 0000000000000000000000000000000000000000000000000000000001fa5ee5
Address =15JhYXn6Mx3oF4Y7PcTAv2wVVAuCFFQNiP
Minikey = S1111111111111122378PV
 FOUND!!!
PrivateKey= 0000000000000000000000000000000000000000000000000000000006ac3875
Address =128z5d7nN7PkCuX5qoA4Ys6pmxUYnEy86k
Minikey = S1111111111111128JJjjq
 FOUND!!!
PrivateKey= 00000000000000000000000000000000000000000000000000000000001ba534
Address =14oFNXucftsHiUMY8uctg6N487riuyXs4h
Minikey = S111111111111113345mux
 FOUND!!!
PrivateKey= 00000000000000000000000000000000000000000000000000000000002de40f
Address =1CfZWK1QTQE3eS9qn61dQjV89KDjZzfNcv
Minikey = S1111111111111137WWbfk

If someone has already tried something like this, please let me know so we can avoid wasting time.

Hello again  

Puzzle #64 was solved on 09/09/2022. It's prize was 0.64 BTC and that day BTC price was US$21.268, so the prize in BTC was like US$13.611

Any puzzle below #80 or #90, I think, can be snatching up by a bot.

---

That day I got like US$165 between BCH, BSV, XEC (eCash) and BTG. It was cool to get that here in a latinamerican country  

And, even today, fork coins weren't updated with 10x, so the prize is still the same for the fork coins (ie 0.66 BCH for puzzle #66 and so on)

During that time the puzzles had like 0.0064 bitcoin it and on top of that BTC was very low. Why would it create a world wide bot race and why would someone waste hundreds or thousands of dollars in fees to withdraw it?
It only became an issue once the creator increased the puzzle prize and since then, no lower end puzzle have been solved.

I suggest to take whatever time/scripts/motivation you have and try to solve puzzle #80 on wards instead where you will be guaranteed the prize.
Or, ask someone with knowledge about timings which is the lowest feasible puzzle to be solved that will leave enough time to withdraw without a bot snatchingup. I don't know this answer, could be even puzzle #70?  

If someone can answer that, that would be great.

Your best option would be some implementation of KeyHunt-CUDA / Rotor-CUDA. Or BitCrack if you want to mess with the stride option.

In terms of raw performance BitCrack lacks tho.

This made me laugh out loud.

Where did 10^74 come from?

You realize 10^74 is larger than 2^66, correct? Not by a little but a lot.

Thanks for the laugh though! I appreciate it.

Total number of addresses that start with the same 11 characters = 2^66 / 58^(11 * log2(58))

First, calculate 58^(11 * log2(58)):

58^(11 * log2(58)) ≈ 58^42.614 ≈ 1.2107 × 10^74 (approximately)

Then, divide 2^66 by this result:

2^66 / 1.2107 × 10^74 ≈ 460708775.52

So, the approximate number of addresses that start with the same 11 characters from a key length of 2^66 bits is about 460,708,775.

64 was solved before the 10x so the values of the fork coins were not as tempting as they are now.

I’m seeing so many variations of software throughout this thread and the other one. If I wanted to randomly let my pc waste electricity on weekends doing a random search for #66, what would be my best bet?

I have a 3070 and can switch to my Ubuntu partition if that’s better. I know my chances are probably like 0.001%, but I just want to feel like I’m joining the big boys on the hunt.

Good to know that even after 12 minutes the fork coins were intact. So probably the situation is not that bad as we are anticipating