== Bitcoin challenge transaction: ~1000 BTC total bounty to solvers! ==UPDATED==

[LetTheDOGEsOut]

~~~

Your only choices are a public service like slipstream.mara.com which have already been mentioned in this thread, for the first time in this thread here: https://bitcointalk.org/index.php?topic=5218972.msg64390395#msg64390395, where your transaction is queued non-publicly to be mined in one of the pool's next blocks. You need to trust the pool and the non-public "mempool" to not screw you over.

You solo mine the block with your transaction, which is a more or less theoretical option as you hardly can afford the ressources required to solo mine a block reliably within a decent time frame. You don't want to wait days, weeks or months to solo mine your block to confirm your solution to a puzzle when you compete with other potential puzzles solvers.

Thanks and makes sense. I wish whoever was sniped on #66 would mention what they did so we don't repeat it.

Yeah I'd like to know the actual truth to this.
Seems like an assumption at best that the coins were taken by a bot.

Could it not just as easily been the person who found the key? or maybe a pool found the key and the one that got 0.66BTC was the 'miner' and got a bigger share and the rest got split?

Seems a little conspiratorial to me that magic bots can see a pending Tx, get the pubkey before it posts, crack the privkey and then make a new Tx with a higher fee and front run the first Tx.... Pie in sky if you ask me

[kTimesG]

Seems a little conspiratorial to me that magic bots can see a pending Tx, get the pubkey before it posts, crack the privkey and then make a new Tx with a higher fee and front run the first Tx.... Pie in sky if you ask me

It is a very good thing that no one asked you.
Everything you wrote can be executed in less then one second, from start to finish.
Get the pubKey from mempool: instant.
Crack #66 (65 bits privKey): a few hundred ms (with proper precomputed data)
Replace TX: instant.

So it might take you longer to blink then to crack and replace a weak key Tx.

The bot that did it was actually really really slow TBH.

[LetTheDOGEsOut]

Seems a little conspiratorial to me that magic bots can see a pending Tx, get the pubkey before it posts, crack the privkey and then make a new Tx with a higher fee and front run the first Tx.... Pie in sky if you ask me

It is a very good thing that no one asked you.
Everything you wrote can be executed in less then one second, from start to finish.
Get the pubKey from mempool: instant.
Crack #66 (65 bits privKey): a few hundred ms (with proper precomputed data)
Replace TX: instant.

So it might take you longer to blink then to crack and replace a weak key Tx.

The bot that did it was actually really really slow TBH.

And just using

Code:

-mempoolreplacement=0

won't prevent it?

[Cricktor]

And just using

Code:

-mempoolreplacement=0

won't prevent it?

No, because mining pools have unconditional FullRBF enabled, and with that any competing transaction that pays a higher fee will replace an already existing transaction in miner's mempool to withdraw a solved puzzle with weak entropy private key. Mining pools have an incentive to enable unconditional FullRBF, so they do it.

[Croatia1219]

Hi,
I am looking for a code that converts a pubKey into a prk for the given addresses in the puzzle. I was trying to do that by myself, but I didn't understand how the math behind it works. If there is a simplified code that shows how it works, I would be pretty thankful.

[Hoesis.USA]

Hi,
I am looking for a code that converts a pubKey into a prk for the given addresses in the puzzle. I was trying to do that by myself, but I didn't understand how the math behind it works. If there is a simplified code that shows how it works, I would be pretty thankful.

you can use, kangaroo or bsgs. Alberto's keyhunt for bsgs ( https://github.com/albertobsd/keyhunt) , jlp's kangaroo (https://github.com/JeanLucPons/Kangaroo), or Retiredcoder's Kangaroo (https://github.com/RetiredC/RCKangaroo)  for Kangaroo.

[Croatia1219]

Hi again,

Thanks for the recommendation! I was about to start the the keyhunt for the puzzle 67, so I used the command from https://privatekeys.pw/puzzles/bitcoin-puzzle-tx but, unfortunately I got an Error:

[E] Error opening the file tests/67.rmd, line 6309
[E] Unenexpected error

I saw that this file was missing out:

─$ ls tests/
120.txt  130.txt    1to32.rmd  1to63_65.txt  64.rmd  66.rmd  in.txt        puzzleswopublickey.txt  test120.txt          unsolvedpuzzles.txt
125.txt  1to32.eth  1to32.txt  63.pub        64.txt  66.txt  minikeys.txt  substracted40.txt       unsolvedpuzzles.rmd  vanitytargets.txt

So I wanna ask if somebody knows how to get this file or is there any other way to start the Puzzle for 67?

[elPato85]

Hi again,

Thanks for the recommendation! I was about to start the the keyhunt for the puzzle 67, so I used the command from https://privatekeys.pw/puzzles/bitcoin-puzzle-tx but, unfortunately I got an Error:

[E] Error opening the file tests/67.rmd, line 6309
[E] Unenexpected error

I saw that this file was missing out:

─$ ls tests/
120.txt  130.txt    1to32.rmd  1to63_65.txt  64.rmd  66.rmd  in.txt        puzzleswopublickey.txt  test120.txt          unsolvedpuzzles.txt
125.txt  1to32.eth  1to32.txt  63.pub        64.txt  66.txt  minikeys.txt  substracted40.txt       unsolvedpuzzles.rmd  vanitytargets.txt

So I wanna ask if somebody knows how to get this file or is there any other way to start the Puzzle for 67?

You have to calculate the hash from the BTC address of Puzzle 67. Or simply use address mode. Create a txt-file with the BTC address of puzzle 67.

[Raoul Duke]

Which means that value the total prize ( 100 BitCoins ) will be about 10 USD soon enough   

Hard Facts

Your comment aged worse than milk, dude.
So, tell us, how did your bets play out?

[DrShams]

hello guys ...

i wonder what is the setup used by Retired Coder For breaking the last 3 puzzle keys ??
he did crack

Puzzle #120
Puzzle #125
Puzzle #130

any one knows what pc specifications is he using ?? a 4090 may be and how many of them ??
or there is a hidden software gem other than what is shared for public ??

[kTimesG]

any one knows what pc specifications is he using ?? a 4090 may be and how many of them ??
or there is a hidden software gem other than what is shared for public ??

500 pieces of RTX 4090 running a few months using a hidden software gem (quote: "this program does not include all possible optimizations") + the missing distributed architecture. Oh, and a few hundred thousand $, you know, to actually afford these.

If you're asking for some magic formula to solve it by next year, you have more chances with the Photoshop horoscope guy.

[saelea]

I have one question regarding obtaining private key from public key knowing the range of private key from puzzle:

What makes retrieval of private key MUCH faster than bruteforcing when you know public key? No need to perform SHA256 and RIPEMD160 during bruteforce? If only those steps helps to make bruteforcing faster then elliptic curve DLP is questionable. What other hints could be retrieved with public key?

[kTimesG]

I have one question regarding obtaining private key from public key knowing the range of private key from puzzle:

What makes retrieval of private key MUCH faster than bruteforcing when you know public key? No need to perform SHA256 and RIPEMD160 during bruteforce? If only those steps helps to make bruteforcing faster then elliptic curve DLP is questionable. What other hints could be retrieved with public key?

DLP is a sqrt(N) steps problem. Brute-forcing is a N steps problem.

Once you have a pubKey you can immediately compute the pubKey of the next private key, or the previous one, or the one that comes 10.000 quadrillion private keys later, and so on, all without ever needing to know what the private key is. This leads to algorithms that solve the thing in around square root number of steps, so not just "much faster" but rather "split the digits of the number of steps in two equal parts, and keep just some half" faster. With brute-force, this is totally impossible, you can never compute the address obtained from the hashing of the key that's next to the unknown key, or any other key, you have exactly zero mathematical relationships that can speed up your attack, it's just wasting power on hashing data blindly until an exact match.

[DrShams]

what actually affect the speed more
is it the cuda cores number or the Memory size of the GPU ?

[elPato85]

what actually affect the speed more
is it the cuda cores number or the Memory size of the GPU ?

I think more cuda cores.

[hoanghuy2912]

hello guys ...

i wonder what is the setup used by Retired Coder For breaking the last 3 puzzle keys ??
he did crack

Puzzle #120
Puzzle #125
Puzzle #130

any one knows what pc specifications is he using ?? a 4090 may be and how many of them ??
or there is a hidden software gem other than what is shared for public ??

he is the creator of the race lol

[Viren6]

Has anyone explored using a Variational Quantum Eigensolver to reduce the classical complexity of #67 slightly to something more managable like 2^60? It should only require 10-20 logical qubits so is possible with current quantum computers.

Paper: https://www.mdpi.com/1099-4300/24/10/1428/pdf

How it works:
Quantum circuit encodes a probability distribution over possible keys.
A cost function is minimized to refine the best candidates.
The result guides the classical brute-force search, reducing the effective keyspace.

[saelea]

Do I correctly understand that solving elementary school equation:
x * 55066263022277343669578718895168534326250603453777594175500187360389116729240 mod 115792089237316195423570985008687907853269984665640564039457584007908834671663 = 9210836494447108270027136741376870869791784014198948301625976867708124077590

will make you owner of 1 377 000 USD?

[saeedxxx]

Do I correctly understand that solving elementary school equation:
x * 55066263022277343669578718895168534326250603453777594175500187360389116729240 mod 115792089237316195423570985008687907853269984665640564039457584007908834671663 = 9210836494447108270027136741376870869791784014198948301625976867708124077590

will make you owner of 1 377 000 USD?

Absolutely not. Multiplication in Elliptic curve doesn't work that simple.

[blackvault]

what is the update of the puzzle solving? which one should i try?

VanitySearch performance list

GPU:
GeForce RTX 2080 Ti: ~2564 Mkeys/s
GeForce RTX 2080 SUPER: ~2001 Mkeys/s**
Tesla V100-SXM2-16GB: ~1815 Mkeys/s
Tesla A10: ~1400 Mkeys/s**
GeForce RTX 2080 EVGA XC ULTRA: ~1425 Mkeys/s
GeForce RTX 2070: ~1470 Mkeys/s
GeForce RTX 2060 SUPER: ~1361 Mkeys/s**
GeForce GTX 1660 Ti: ~960 Mkeys/s
GeForce GTX 1080 Ti: ~900 Mkeys/s
GeForce GTX 1660: ~839 Mkeys/s
GeForce GTX 1080: ~672 Mkeys/s
GeForce GTX 1650: ~511 Mkeys/s
GeForce GTX 980: ~375 Mkeys/s
GeForce GTX 970: ~330 Mkeys/s
GeForce GTX 1060 3GB: ~321 Mkeys/s
GeForce GTX 1050 Ti: ~220 Mkeys/s
Tesla M60: ~185 Mkeys/s
GeForce GTX 960M: ~117 Mkeys/s
GeForce GTX 750: ~95 Mkeys/s
GeForce GT 520M: ~7 Mkeys/s

Compilation types of VanitySearch:
default is 128Mb threads for GPU
** - 256Mb threads for GPU
*** - 512Mb threads for GPU
Generally, it is confirmed that each higher thread compilation is more efficient and significantly increases the performance, but it is also worth noting that the latest cards (starting from RTX) do not work on the 512Mb version due to the changed architecture. For these, the 256Mb version is recommended
CPU:
i7-7700K CPU: ~22 Mkeys/s | using 8 threads [-t 8]
Many thanks to DaveF who has collected the vast majority of the data here.
It was thanks to him that I decided to put this data here and express my willingness to supplement it with more items.

If you have equipment that is not listed above - I will be grateful for info on its performance in VanitySearch (version with integrated BitCrack options).
If you have the equipment listed above and you managed to get better performance - also let us know how you did it (additional start command, gridsize etc.) for the update.

Latest VanitySearch builds with BitCrack features working on all NVIDIA cards

Compilations made with the use of CUDA version 11.6, so for the program to work it is necessary to update the drivers in the system to the latest ones that are available. I have compiled for each GPU architecture separately - as listed below
LINUX

• SM_35 [Kepler]: http://zielar.pl/vslinux/sm_35/vanitysearch
• SM_37 [Kepler]: http://zielar.pl/vslinux/sm_37/vanitysearch
• SM_50 [Maxwell]: http://zielar.pl/vslinux/sm_50/vanitysearch
• SM_52 [Maxwell]: http://zielar.pl/vslinux/sm_52/vanitysearch
• SM_53 [Maxwell]: http://zielar.pl/vslinux/sm_53/vanitysearch
• SM_60 [Pascal]: http://zielar.pl/vslinux/sm_60/vanitysearch
• SM_61 [Pascal]: http://zielar.pl/vslinux/sm_61/vanitysearch
• SM_62 [Pascal]: http://zielar.pl/vslinux/sm_62/vanitysearch
• SM_70 [Volta]: http://zielar.pl/vslinux/sm_70/vanitysearch
• SM_72 [Xavier]: http://zielar.pl/vslinux/sm_72/vanitysearch
• SM_75 [Turing]: http://zielar.pl/vslinux/sm_75/vanitysearch
• SM_80 [Ampere]: http://zielar.pl/vslinux/sm_80/vanitysearch
• SM_86 [Ampere]: http://zielar.pl/vslinux/sm_86/vanitysearch
• SM_87 [Ampere]: http://zielar.pl/vslinux/sm_87/vanitysearch

After downloading, execute the command chmod +x vanitysearch in linux
The downloaded file is ready, for example, to start working with the ttd client needed to start participating in pool #64.
Just download the selected compilation to the same folder as the ttdclient and the settings.ini file

For the lazy, I also provide ttdclient to work with the above in linux: http://zielar.pl/ttdclient [run the chmod +x ttdclient command after the download], and sample settings.ini: http://zielar.pl/settings.ini

MS Windows:
comming soon

NVIDIA Kepler GPUs: GeForce 700, GT-730, Tesla K40 [SM_35]; Tesla K80 [SM_37]
NVIDIA Maxwell GPUs: Tesla/Quadro M series [SM_50]; Quadro M6000 , GeForce 900, GTX-970, GTX-980, GTX Titan X [SM_52]; Tegra (Jetson) TX1 / Tegra X1, Drive CX, Drive PX, Jetson Nano [SM_53]
NVIDIA Pascal GPUs: Quadro GP100, Tesla P100, DGX-1 (Generic Pascal) [SM_60]; GTX 1080, GTX 1070, GTX 1060, GTX 1050, GTX 1030 (GP108), GT 1010 (GP108) Titan Xp, Tesla P40, Tesla P4, Discrete GPU on the NVIDIA Drive PX2 [SM_61]; Integrated GPU on the NVIDIA Drive PX2, Tegra (Jetson) TX2 [SM_62]
NVIDIA Volta GPUs: DGX-1 with Volta, Tesla V100, GTX 1180 (GV104), Titan V, Quadro GV100 [SM_70]
NVIDIA Xavier GPUs: Jetson AGX Xavier, Drive AGX Pegasus, Xavier NX [SM_72]
NVIDIA Turing GPUs: GTX/RTX Turing – GTX 1660 Ti, RTX 2060, 2070, 2080, Titan RTX, Quadro RTX 4000, 5000, 6000, 8000, Quadro T1000/T2000, Tesla T4 [SM_75]
NVIDIA Ampere GPUs: NVIDIA A100, NVIDIA DGX-A100 [SM_80]; Tesla GA10x cards, RTX 3050, 3060, 3070, 3080, 3090, RTX A2000, A3000, A4000, A5000, A6000, NVIDIA A40, A10, A16, A40, A2 Tensor Core GPU [SM_86]

im gonna give a try for this 1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9

using this system..

is it possible?


Host Name:                 DESKTOP
OS Name:                   Microsoft Windows 10 Home Single Language
OS Version:                10.0.19045 N/A Build 19045
OS Manufacturer:           Microsoft Corporation
OS Configuration:          Standalone Workstation
OS Build Type:             Multiprocessor Free
Registered Owner:          Admin
Registered Organization:
Product ID:                XXXXXXX
Original Install Date:     1/29/2024, 12:26:43 AM
System Boot Time:          2/7/2025, 2:56:27 AM
System Manufacturer:       ASUSTeK COMPUTER INC.
System Model:              G551JW
System Type:               x64-based PC
Processor(s):              1 Processor(s) Installed.
                           [01]: Intel64 Family 6 Model 60 Stepping 3 GenuineIntel ~2594 Mhz
BIOS Version:              American Megatrends Inc. G551JW.202, 1/16/2015
Total Physical Memory:     8,081 MB
Available Physical Memory: 3,601 MB
Virtual Memory: Max Size:  9,361 MB
Virtual Memory: Available: 4,491 MB
Virtual Memory: In Use:    4,870 MB