Bitcoin puzzle transaction ~32 BTC prize to who solves it

[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 ?

[vjudeu]

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 ?

1. You commit your Script behind some address type. Which means, that people won't see for example "OP_RIPEMD160 <puzzleHash> OP_EQUALVERIFY <solverKey> OP_CHECKSIG" immediately, but they will see just some P2WSH hash, or some P2TR public key, nothing else.
2. Then, when you reveal the Script behind your address, it is too late to modify it, because it is already deeply confirmed. And then, nobody can create an identical Script with a different "<solverKey>" or replace solver's key.
3. If you spend coins from the Script mentioned above, then everyone can verify, that you know SHA-256 of the public key. Only the true solver will know that. Then, some huge mining pool can agree to deposit some coins, to learn the solution to the puzzle.
4. The solver will see, that coins are deposited to "OP_SHA256 <revealedHash> OP_EQUALVERIFY <solverKey> OP_CHECKSIG". Everyone will know the address, and the Script behind it, but only the solver will know the public key to the puzzle.
5. The solver can pass a transaction to the mining pool, claiming all coins from his address. Then, the pool can learn the public key, and sweep it with 100% transaction fee.

Edit: In general, it seems to be resistant to some simple attacks:

1. If the solver is lying, he will be unable to produce a proper address, and spend it, while revealing SHA-256 of the public key, so nobody will give him any coins in the first place.
2. If someone is observing the chain, and trying to replicate "I have the key" signal with a different solver's key, then that person will be unable to do that before the solver, because the real solver's address will be deeply confirmed. If we count the earliest attempt as the legit one, then any future solvers will not get anything.
3. Rewarding the solver is not direct, it is more similar to HTLC: there are two conditions: the solver's public key (with signature), and the puzzle's public key (where the hash of it is revealed in the Script). Which means, that the solver cannot run away with coins, without revealing the public key to the puzzle.
4. It is compatible with full-RBF and other network rules: the puzzle can be sweeped with 100% fee, and if it will be done by some pool, then the transaction will start from a single confirmation. Reorging a single block is not that easy. However, if the risk of reorg is too high, then rewarded amounts can be adjusted if needed, and someone may agree to reveal the public key for 6 BTC, instead of 6.6 BTC. We will see.

[citb0in]

Miners prioritize transactions with higher fees over those they encounter first.

To address this, one solution is to operate a full node, deactivate full-RBF (Replace-by-Fee), and broadcast your transaction with a fee 20 times higher than the usual rate. This would provide a 20-second window before the transaction reaches another full-RBF node, increasing the chance that a miner might include it in a block by mistake. However, I doubt this will happen, as I believe miners will likely engage in this bot fee competition directly.

@nomachine: may I ask why you deleted your message ?

[nomachine]

Miners prioritize transactions with higher fees over those they encounter first.

To address this, one solution is to operate a full node, deactivate full-RBF (Replace-by-Fee), and broadcast your transaction with a fee 20 times higher than the usual rate. This would provide a 20-second window before the transaction reaches another full-RBF node, increasing the chance that a miner might include it in a block by mistake. However, I doubt this will happen, as I believe miners will likely engage in this bot fee competition directly.

@nomachine: may I ask why you deleted your message ?

Maybe it's a stupid idea that the puzzle winner has to make a kind of bot also for his transaction. .

[WanderingPhilospher]

Well, I successfully beat any bots that were still in the game.

However, I will admit my first plan did not go as planned because I messed a few things up. But that's ok, I learned from it.

My successful withdrawal, was more of a hail mary versus my thought out, crafted, plan.

I am curious if any bots did get the signal and start working on finding the key and changing the transaction.

I will run another test from learning a few things, and after that test (not 66 bit), I hope to run another one here. Maybe even a lower bit one. We shall see.

Thanks for all of those who built bots and was in the game. I appreciate you.

[albert0bsd]

My bot found the key and I send 3 Transactions all accepted by mempool, but they weren't mined.

Last of my TX was:

Code:

01000000029e8c8c0f85d43b8d6aa7d41a0d6f45d67c0f003a4285f3046bf8413b14cf5578010000006a473044022028569c178ffd68c12dc03b4b495804f1b388bf8b6a159d2174f8eaff9edf8b03022022ad5576a368b49aa03e869c0ca58a4132eaa9be03836e597b72ebfe48dbb7770121029a3a2ae3ad3858cf49421e6ff547598bb8da72c2bce50490067d9ce7b2e2dc90ffffffff11d5fc65af501e48a895128fa73cca27fc740e005af8bf47a4eb389ebda34aca030000006b483045022100c2dddfb7dc710f885b11a14ec42f99de7a2b7923fd086b705260594cbd2a50c402200b45baa9bb495054fe576ea3317696f9903501fd48e6f5a46593a7148e854b920121029a3a2ae3ad3858cf49421e6ff547598bb8da72c2bce50490067d9ce7b2e2dc90ffffffff01ee77040000000000160014446b83eba19e9edc0eeb3e50a4e0d90f4912f6ef00000000
TXID: 77a9f530ae26c93e04615d8bb35fa04ace180de412e60d97ce0ec64d12a39d4d

Decoded is:

Code:

{
  "version": 1,
  "locktime": 0,
  "ins": [
    {
      "n": 1,
      "script": {
        "asm": "3044022028569c178ffd68c12dc03b4b495804f1b388bf8b6a159d2174f8eaff9edf8b03022022ad5576a368b49aa03e869c0ca58a4132eaa9be03836e597b72ebfe48dbb77701 029a3a2ae3ad3858cf49421e6ff547598bb8da72c2bce50490067d9ce7b2e2dc90",
        "hex": "473044022028569c178ffd68c12dc03b4b495804f1b388bf8b6a159d2174f8eaff9edf8b03022022ad5576a368b49aa03e869c0ca58a4132eaa9be03836e597b72ebfe48dbb7770121029a3a2ae3ad3858cf49421e6ff547598bb8da72c2bce50490067d9ce7b2e2dc90"
      },
      "sequence": 4294967295,
      "txid": "7855cf143b41f86b04f385423a000f7cd6456f0d1ad4a76a8d3bd4850f8c8c9e",
      "witness": []
    },
    {
      "n": 3,
      "script": {
        "asm": "3045022100c2dddfb7dc710f885b11a14ec42f99de7a2b7923fd086b705260594cbd2a50c402200b45baa9bb495054fe576ea3317696f9903501fd48e6f5a46593a7148e854b9201 029a3a2ae3ad3858cf49421e6ff547598bb8da72c2bce50490067d9ce7b2e2dc90",
        "hex": "483045022100c2dddfb7dc710f885b11a14ec42f99de7a2b7923fd086b705260594cbd2a50c402200b45baa9bb495054fe576ea3317696f9903501fd48e6f5a46593a7148e854b920121029a3a2ae3ad3858cf49421e6ff547598bb8da72c2bce50490067d9ce7b2e2dc90"
      },
      "sequence": 4294967295,
      "txid": "ca4aa3bd9e38eba447bff85a000e74fc27ca3ca78f1295a8481e50af65fcd511",
      "witness": []
    }
  ],
  "outs": [
    {
      "n": 0,
      "script": {
        "addresses": [
          "bc1qg34c86apn60dcrht8eg2fcxepay39ah00sxpdn"
        ],
        "asm": "OP_0 446b83eba19e9edc0eeb3e50a4e0d90f4912f6ef",
        "hex": "0014446b83eba19e9edc0eeb3e50a4e0d90f4912f6ef"
      },
      "value": 292846
    }
  ],
  "hash": "77a9f530ae26c93e04615d8bb35fa04ace180de412e60d97ce0ec64d12a39d4d",
  "txid": "77a9f530ae26c93e04615d8bb35fa04ace180de412e60d97ce0ec64d12a39d4d"
}

My output final was 292846 satoshis A little less of what you manage to getout.

My bot manage to do 3 replacements

To be honest this conditions were some difficult, previous block was minend with less than 5 minutes of difference.

Block 854264 - 2024-07-27 19:37:48
Block 854265 - 2024-07-27 19:42:12
(UTC - 6)


Here is your TX:



If you see mempool.space didn't see your mined TX before it was mined.

Overpaid 84 times more, more than 100 bucks in fees that was 1/3 of the total balance

This was interesting. I also learn somethings

By way, how many replacements did you do?

Thanks you!!