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?

So, how many machines you have ? 

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.

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.

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

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

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.....

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

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.

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