Bitcoin puzzle transaction ~32 BTC prize to who solves it

[ElonMusk_ia]

Off topic:

White Hat Recovery reward 10%, i.e., up to $23 Million

https://x.com/WazirXIndia/status/1815004031561220352

https://www.talkimg.com/images/2024/07/26/4BbTH.gif

Good luck.

[OxSD]

I think @WanderingPhilospher forgot us lol...

Hope he's doing ok

He's pretty smart and I think his competition makes sense to test some techniques that allow coins to be transferred safely rather than to show that coins can be easily stolen

[brainless]

I think @WanderingPhilospher forgot us lol...

Hope he's doing ok

He's pretty smart and I think his competition makes sense to test some techniques that allow coins to be transferred safely rather than to show that coins can be easily stolen

Maybe it's mind game, all bot busy for find test , and newly bots maybe also block by ping many times, and in background they play real 66 bit puzzle transaction

[OxSD]

Maybe it's mind game, all bot busy for find test , and newly bots maybe also block by ping many times, and in background they play real 66 bit puzzle transaction

A professional bot definitely does not use mempool.space or similar APIs. It uses its own node, so blocking is only for inexperienced bots that use third-party APIs.

[Baskentliia]

Off topic:

White Hat Recovery reward 10%, i.e., up to $23 Million

https://x.com/WazirXIndia/status/1815004031561220352

Hello, are we going to find one of these wallets, deliver it to the Wazirx exchange official and get a reward? Did I get right ?
Could you share the program you use?

[nomachine]

Maybe it's mind game, all bot busy for find test , and newly bots maybe also block by ping many times, and in background they play real 66 bit puzzle transaction

A professional bot definitely does not use mempool.space or similar APIs. It uses its own node, so blocking is only for inexperienced bots that use third-party APIs.

You actually need full-node distro. And mempool in local network .You should use a separate machine just for that, and another very powerful machine for the Bot and BSGS/Keyhunt.   

[Akito S. M. Hosana]

Maybe it's mind game, all bot busy for find test , and newly bots maybe also block by ping many times, and in background they play real 66 bit puzzle transaction

A professional bot definitely does not use mempool.space or similar APIs. It uses its own node, so blocking is only for inexperienced bots that use third-party APIs.

You actually need full-node distro. And mempool in local network .You should use a separate machine just for that, and another very powerful machine for the Bot and BSGS/Keyhunt.   

So, how many machines you have ? 

[nomachine]

Maybe it's mind game, all bot busy for find test , and newly bots maybe also block by ping many times, and in background they play real 66 bit puzzle transaction

A professional bot definitely does not use mempool.space or similar APIs. It uses its own node, so blocking is only for inexperienced bots that use third-party APIs.

You actually need full-node distro. And mempool in local network .You should use a separate machine just for that, and another very powerful machine for the Bot and BSGS/Keyhunt.   

So, how many machines you have ? 

Five just in my room.

[OxSD]

My noob bot struggling to see at least balance <= 0 and stuck here..
https://www.talkimg.com/images/2024/07/20/4E5Xv.png

You need to save the UTXO before the first outgoing transaction. As soon as the transaction is outgoing(even not confirmed), request for UTXO will return 0.
PS. There is also an idea for solving puzzle 130. It may be stupid, but I’ll suggest it anyway. What if made check on the server side the distance between the every tame and every wild kangaroos?
And check the result with a hashtable like on BSGS. I don’t know how likely it is that the distance between the some Tame/Wild kangaroos would be less than the size of the table, but nevertheless as soon as the difference is known, the key will be found.

[cnk1220]

Maybe it's mind game, all bot busy for find test , and newly bots maybe also block by ping many times, and in background they play real 66 bit puzzle transaction

A professional bot definitely does not use mempool.space or similar APIs. It uses its own node, so blocking is only for inexperienced bots that use third-party APIs.

You actually need full-node distro. And mempool in local network .You should use a separate machine just for that, and another very powerful machine for the Bot and BSGS/Keyhunt.   

So, how many machines you have ? 

Five just in my room.

What you talking about? I do it with just my Ryzen 9 3900x with VMs when needed.

[nomachine]

Maybe it's mind game, all bot busy for find test , and newly bots maybe also block by ping many times, and in background they play real 66 bit puzzle transaction

A professional bot definitely does not use mempool.space or similar APIs. It uses its own node, so blocking is only for inexperienced bots that use third-party APIs.

You actually need full-node distro. And mempool in local network .You should use a separate machine just for that, and another very powerful machine for the Bot and BSGS/Keyhunt.  

So, how many machines you have ?  

Five just in my room.

What you talking about? I do it with just my Ryzen 9 3900x with VMs when needed.

I have UmbrelOS with a node and mempool on a separate machine, which can be a NUC or any small PC (with 1TB drive for node). I don't want to waste RAM with VMs on a machine with a BSGS server.

[kTimesG]

PS. There is also an idea for solving puzzle 130. It may be stupid, but I’ll suggest it anyway. What if made check on the server side the distance between the every tame and every wild kangaroos?
And check the result with a hashtable like on BSGS. I don’t know how likely it is that the distance between the some Tame/Wild kangaroos would be less than the size of the table, but nevertheless as soon as the difference is known, the key will be found.

You can't check the distance between a tame and wild because that would mean you already know the answer to the problem. The wild distance is relative to the unknown position of the public key.

[OxSD]

You can't check the distance between a tame and wild because that would mean you already know the answer to the problem. The wild distance is relative to the unknown position of the public key.

You can easily calculate the distance between kangoroos. Distance is not a number, but a public key, or more precisely a point on a curve, or rather, x coordinate of point and the table for comparing the results is a table of x coordinates. The only problem is that the table size is limited by the memory size, and it is unlikely that you can achieve a size larger than 2^40 x coordinates in table. For example Tame has cordinate G*1 and Wild G*3 so G*3 - G*1 = G*2 is equil to x: c6047f9441ed7d6d3045406e95c07cd85c778e4b8cef3ca7abac09b95c709ee5

[kTimesG]

You can't check the distance between a tame and wild because that would mean you already know the answer to the problem. The wild distance is relative to the unknown position of the public key.

You can easily calculate the distance between kangoroos. Distance is not a number, but a public key, or more precisely a point on a curve, or rather, x coordinate of point and the table for comparing the results is a table of x coordinates. The only problem is that the table size is limited by the memory size, and it is unlikely that you can achieve a size larger than 2^40 x coordinates in table. For example Tame has cordinate G*1 and Wild G*3 so G*3 - G*1 = G*2 is equil to x: c6047f9441ed7d6d3045406e95c07cd85c778e4b8cef3ca7abac09b95c709ee5

Right. Let's take interval (0, b) and hidden key 0 < k < b such that kG = P. And a tame kangaroo starting at b/2. And some wild kangaroos W1 and W2, which you don't know where they actually start from, just that it's somehwere in (0, b).

Code:

pos       1       b/2         b               2*b
tame               T --------------->
P=kG       ???????????????????
wilds.      W1 -->  W2 -------->

What will happen when they start jumping? First of all, after a while they will both pass beyond the b offset.
You propose to compute the differences between tame and wilds?

And do what with such information? The difference is already the answer of what the kangaroo algorithm does. Solving for differences in this context is simply solving between a known point, let's say [b/2]G and P. And there are exactly b possibilities for the differences, and those are in the (-b/2, b/2) interval. Kangaroo solves the problem in sqrt(b) steps, your idea solves it b steps, or actually 2*b steps, since the kangaroos jump outside the interval sooner or later.

[Spark2030]

Hello everyone , I am part of the largest bitcoinBTC puzzle channel in Brazil, if you want to be part of our topics consider joining our Telegram channel .

 https://t.me/+FzEeVq_KOdllZmNh

[Akito S. M. Hosana]

Maybe it's mind game, all bot busy for find test , and newly bots maybe also block by ping many times, and in background they play real 66 bit puzzle transaction

A professional bot definitely does not use mempool.space or similar APIs. It uses its own node, so blocking is only for inexperienced bots that use third-party APIs.

You actually need full-node distro. And mempool in local network .You should use a separate machine just for that, and another very powerful machine for the Bot and BSGS/Keyhunt.  

So, how many machines you have ?  

Five just in my room.

What you talking about? I do it with just my Ryzen 9 3900x with VMs when needed.

I have UmbrelOS with a node and mempool on a separate machine, which can be a NUC or any small PC (with 1TB drive for node). I don't want to waste RAM with VMs on a machine with a BSGS server.

So, you host entire Bitcoin blocks—600 GB—locally? 

[nomachine]

Maybe it's mind game, all bot busy for find test , and newly bots maybe also block by ping many times, and in background they play real 66 bit puzzle transaction

A professional bot definitely does not use mempool.space or similar APIs. It uses its own node, so blocking is only for inexperienced bots that use third-party APIs.

You actually need full-node distro. And mempool in local network .You should use a separate machine just for that, and another very powerful machine for the Bot and BSGS/Keyhunt.  

So, how many machines you have ?  

Five just in my room.

What you talking about? I do it with just my Ryzen 9 3900x with VMs when needed.

I have UmbrelOS with a node and mempool on a separate machine, which can be a NUC or any small PC (with 1TB drive for node). I don't want to waste RAM with VMs on a machine with a BSGS server.

So, you host entire Bitcoin blocks—600 GB—locally? 

Can you read? Yes, I just wrote that above. By running a node, you support the Bitcoin network. You can experiment with Bitcoin-related applications directly.....

[cnk1220]

Maybe it's mind game, all bot busy for find test , and newly bots maybe also block by ping many times, and in background they play real 66 bit puzzle transaction

A professional bot definitely does not use mempool.space or similar APIs. It uses its own node, so blocking is only for inexperienced bots that use third-party APIs.

You actually need full-node distro. And mempool in local network .You should use a separate machine just for that, and another very powerful machine for the Bot and BSGS/Keyhunt.  

So, how many machines you have ?  

Five just in my room.

What you talking about? I do it with just my Ryzen 9 3900x with VMs when needed.

I have UmbrelOS with a node and mempool on a separate machine, which can be a NUC or any small PC (with 1TB drive for node). I don't want to waste RAM with VMs on a machine with a BSGS server.

So, you host entire Bitcoin blocks—600 GB—locally? 

My node have 721GB, is a VM with 4GB RAM.
It's light.

[zahid888]

Hello, are we going to find one of these wallets, deliver it to the Wazirx exchange official and get a reward? Did I get right ?
Could you share the program you use?

Check DM..
hashcat.exe -a 3 -m 28501 13zb1hQbwPsnGmVS5VekEhn1pchvDiUCVf "KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZpXCZq8pzanv?u?u?u?l?u?l?u" --status

Session..........: hashcat
Status...........: Cracked
Hash.Mode........: 28501 (Bitcoin WIF private key (P2PKH), compressed)
Hash.Target......: 13zb1hQbwPsnGmVS5VekEhn1pchvDiUCVf
Time.Started.....: Sat Jul 27 12:43:39 2024 (54 secs)
Time.Estimated...: Sat Jul 27 12:44:33 2024 (0 secs)
Kernel.Feature...: Pure Kernel
Guess.Mask.......: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZpXCZq8pzanv?u?u?u?l?u?l?u [52]
Guess.Queue......: 1/1 (100.00%)
Speed.#1.........:   119.8 MH/s (1.69ms) @ Accel:1024 Loops:1 Thr:32 Vec:1
Recovered........: 1/1 (100.00%) Digests (total), 1/1 (100.00%) Digests (new)
Progress.........: 6654263296/8031810176 (82.85%)
Rejected.........: 0/6654263296 (0.00%)
Restore.Point....: 6653018112/8031810176 (82.83%)
Restore.Sub.#1...: Salt:0 Amplifier:0-1 Iteration:0-1
Candidate.Engine.: Device Generator
Candidates.#1....: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZpXCZq8pzanvAUOuYnV -> KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZpXCZq8pzanvRTKnBoV
Hardware.Mon.#1..: Temp: 75c Fan: 80% Util: 99% Core:1965MHz Mem:6800MHz Bus:16
Started: Sat Jul 27 12:43:11 2024
Stopped: Sat Jul 27 12:44:35 2024

[citb0in]

It is possible to get the reward in a trustless way. Some examples:

OP_RIPEMD160 <puzzleHash> OP_EQUALVERIFY <solverKey> OP_CHECKSIG
OP_SHA256 <revealedHash> OP_EQUALVERIFY <solverKey> OP_CHECKSIG

The first Script can be used to send "I know the key" signal in a trustless way. The second Script can reveal the public key, after the first "I know the key" transaction, but also lock the reward to the solver's key.

Some practical examples, with the smallest key:

OP_DUP OP_HASH160 751e76e8199196d454941c45d1b3a323f1433bd6 OP_EQUALVERIFY OP_CHECKSIG

public key: 0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798
first hash: 0f715baf5d4c2ed329785cef29e562f73488c8a2bb9dbc5700b361d54b9b0554
second hash: 751e76e8199196d454941c45d1b3a323f1433bd6

OP_RIPEMD160 751e76e8199196d454941c45d1b3a323f1433bd6 OP_EQUALVERIFY <solverKey> OP_CHECKSIG

Then, the solver can provide: "<signature> 0f715baf5d4c2ed329785cef29e562f73488c8a2bb9dbc5700b361d54b9b0554". Only the solver will know the first hash. And it is still not the public key, so it can be revealed, as a signal, to get it deeply confirmed, and to give the community a choice: "give me those coins now, if you want to see the solution". By scanning the blockchain, it is possible to determine, who was the first person, revealing the first hash on-chain. Also, because scripts are hidden behind hashes, nobody will fake that signal, if P2SH, P2WSH or P2TR will be deeply confirmed first.

If the community will verify that signal, and agree to deposit 6.6 BTC to get the solution, then the next Script can be constructed:

OP_SHA256 0f715baf5d4c2ed329785cef29e562f73488c8a2bb9dbc5700b361d54b9b0554 OP_EQUALVERIFY <solverKey> OP_CHECKSIG

In that case, this particular solver can provide: "<signature> <puzzleKey>". Everyone will then try to grab the key for the puzzle, and clear it. However, the signature will protect the coins for the solver.

Nevertheless, it is a Bitcoin-compliant transaction that can be replaced at any time as long as the original transaction has not been confirmed, isn't it ?