Bitcoin puzzle transaction ~32 BTC prize to who solves it

[albert0bsd]

Hi All,

I've been reading this and other related topics for a few weeks and I'm trying to understand the complexity of the different algorithms and approaches.

https://andrea.corbellini.name/2015/06/08/elliptic-curve-cryptography-breaking-security-and-a-comparison-with-rsa/

You are mixing operations per second and keys per second and those aren't the same.

In BSGS with a precalculated set of 100 million keys, you only need to do a single operation ( publcikey subtraction) to determine if a key is in some 100 million keys right, that is 1 single operation but it give you a speed of 100 million keys / time, that is the difference, while bsgs do some thousands of subtraction per second (operations) it will give you some petakeya/s (speed) it is different way to measure it.

[zahid888]

Please advise me on which wallet to use where the facility to enable and disable RBF (Replace-By-Fee) is available. My fully synchronized Bitcoin Core wallet has become corrupted, and IDK, Why Electrum has removed the RBF option.

[vhh]

Please advise me on which wallet to use where the facility to enable and disable RBF (Replace-By-Fee) is available. My fully synchronized Bitcoin Core wallet has become corrupted, and IDK, Why Electrum has removed the RBF option.

Electrum has removed the RBF option starting with version 4.4 . All transactions have now RBF enabled by default. You can check it here https://github.com/spesmilo/electrum/issues/8490

You can use Blue wallet to control the RBF option : https://bluewallet.io/

[AndrewWeb]

No, once you try to move the funds, the public key is exposed.
A single modern GPU can solve #66 in less than a minute, with a known public key.

So how do you safely move the funds from 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so ?

[Lugh1Man]

Hi All,

I've been reading this and other related topics for a few weeks and I'm trying to understand the complexity of the different algorithms and approaches.

https://andrea.corbellini.name/2015/06/08/elliptic-curve-cryptography-breaking-security-and-a-comparison-with-rsa/

You are mixing operations per second and keys per second and those aren't the same.

In BSGS with a precalculated set of 100 million keys, you only need to do a single operation ( publcikey subtraction) to determine if a key is in some 100 million keys right, that is 1 single operation but it give you a speed of 100 million keys / time, that is the difference, while bsgs do some thousands of subtraction per second (operations) it will give you some petakeya/s (speed) it is different way to measure it.

Thanks Alberto, this is indeed what I was missing. I'm trying to understand the exact purpose of the n and k parameters of keyhunt. Is n in this case the number of pre-calculated keys? I'm trying to understand the efficiency of the algorithm - how long it would take to finish a full scan of a given range. Is it as simple as range size (keys) divided by speed (keys/s reported by keyhunt)? I'm assuming not, since this is not a brute-force algorithm.

Every fifth range is 32 (2⁵) times bigger than the last (e.g. the range for #130 has 32x more keys than the one for #125). If I could benchmark my system on how fast it could solve a simpler BSGS puzzle (say #125), how do I extrapolate on how fast it would do with #130? I assume it's faster than 32x the time it takes for #125.

No, once you try to move the funds, the public key is exposed.
A single modern GPU can solve #66 in less than a minute, with a known public key.

So how do you safely move the funds from 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so ?

You can build a bot that monitors the mempool (pending transactions) to make sure that there's no one else trying to send your BTC to another address (since they can easily calculate the private key once you publish your transaction). If anyone else is trying to do that, you can send another transaction with a higher fee to out-bid the other parties, but this can create a vicious cycle where no one wins because you all keep increasing the fee for your own transactions until nothing is left.

[WanderingPhilospher]

Hi All,

I've been reading this and other related topics for a few weeks and I'm trying to understand the complexity of the different algorithms and approaches.

https://andrea.corbellini.name/2015/06/08/elliptic-curve-cryptography-breaking-security-and-a-comparison-with-rsa/

You are mixing operations per second and keys per second and those aren't the same.

In BSGS with a precalculated set of 100 million keys, you only need to do a single operation ( publcikey subtraction) to determine if a key is in some 100 million keys right, that is 1 single operation but it give you a speed of 100 million keys / time, that is the difference, while bsgs do some thousands of subtraction per second (operations) it will give you some petakeya/s (speed) it is different way to measure it.

Thanks Alberto, this is indeed what I was missing. I'm trying to understand the exact purpose of the n and k parameters of keyhunt. Is n in this case the number of pre-calculated keys? I'm trying to understand the efficiency of the algorithm - how long it would take to finish a full scan of a given range. Is it as simple as range size (keys) divided by speed (keys/s reported by keyhunt)? I'm assuming not, since this is not a brute-force algorithm.

Every fifth range is 32 (2⁵) times bigger than the last (e.g. the range for #130 has 32x more keys than the one for #125). If I could benchmark my system on how fast it could solve a simpler BSGS puzzle (say #125), how do I extrapolate on how fast it would do with #130? I assume it's faster than 32x the time it takes for #125.

Did you read his GitHub? He has ranges and keys to benchmark your speed.

And just because you could solve 120 in say a day, doesn’t mean you could solve 125 in 32 days. If the key is in the beginning of the range, before 120s, in relation, you’d solve faster than 32 days. If it was after, then more than 32 days.

Keep it easier,
If a key in the 120 bit range was in the 8s and it took you one day, if 124s key was in the Fs, it would take you longer than 16 days. Make sense?

To give a better, worse case scenario, determine your speed, then calculate time taken by taking the last possible check in a range, (based on how large your baby step file is) and divide it by your speed.

[frozenen]

If someone found #66 and withdrew with an extremely high transaction fee say 10k USD and then within 1 minute the scammers find the private key with kangaroo and submit their withdrawal with lets say 100k USD fee! Would the scammers still get it? Cause this means all the lower bit range puzzles are useless to even attempt.

[ccinet]

If someone found #66 and withdrew with an extremely high transaction fee say 10k USD and then within 1 minute the scammers find the private key with kangaroo and submit their withdrawal with lets say 100k USD fee! Would the scammers still get it? Cause this means all the lower bit range puzzles are useless to even attempt.

Let's say it is like this.
In my opinion there are no scammers, in bitcoin laws whoever owns the private address owns the coins, these are the rules that Satoshi proposed

[curiousNoone]

If someone found #66 and withdrew with an extremely high transaction fee say 10k USD and then within 1 minute the scammers find the private key with kangaroo and submit their withdrawal with lets say 100k USD fee! Would the scammers still get it? Cause this means all the lower bit range puzzles are useless to even attempt.

Let's say it is like this.
In my opinion there are no scammers, in bitcoin laws whoever owns the private address owns the coins, these are the rules that Satoshi proposed

So 66,67,68,69, maybe others in the 70s ? have all become hot potatoes now.

Now it just becomes bragging rights and thats it.
Too many people will place higher fees unless you are very lucky.
How sad its become.

[Lugh1Man]

Did you read his GitHub? He has ranges and keys to benchmark your speed.

And just because you could solve 120 in say a day, doesn’t mean you could solve 125 in 32 days. If the key is in the beginning of the range, before 120s, in relation, you’d solve faster than 32 days. If it was after, then more than 32 days.

Keep it easier,
If a key in the 120 bit range was in the 8s and it took you one day, if 124s key was in the Fs, it would take you longer than 16 days. Make sense?

To give a better, worse case scenario, determine your speed, then calculate time taken by taking the last possible check in a range, (based on how large your baby step file is) and divide it by your speed.

Yes, I've been reading the README, the code, and the description of the algorithm on wikipedia and other publications. I can't yet connect all the dots, but this helps, thanks!

So, is the n parameter the size of the range "chunk" you are looking at one at a time per thread (still unsure what k does)?

[saatoshi_falling]

If someone found #66 and withdrew with an extremely high transaction fee say 10k USD and then within 1 minute the scammers find the private key with kangaroo and submit their withdrawal with lets say 100k USD fee! Would the scammers still get it? Cause this means all the lower bit range puzzles are useless to even attempt.

Correct, but I won't call it a "scammer", perhaps just a leech.  And it won't be found within 1 minute. It will be found within a few seconds. The leech will still get 6 bitcoins, so even 200k RBF won't be too far fetched, as he'll get double his money back.
I feel sorry for people who enthusiastically tried puzzle 66 for many months or even a year or two, without realizing even if they found the private key there's no way in hell they will be able to withdraw it because unless you have 20/30/40k sitting around to gamble on the RBF lottery, you're not getting those funds.

The reason this did not happen before is because puzzle 65 and lower had very little to no reward money in it, so it was not worth the bidding war, but this all changes when the puzzle creator decided to put 6+ BTC in each puzzle. Now there's more people sitting and waiting with bots than people trying to solve.

[pbies]

It is enough to mark the tx as without RBF and the winner gets it all!

Stop spreading bs.

[Baskentliia]

Can someone with definite knowledge about this subject write? Can anyone with definite knowledge write about it? Let's say we found puzzle 66 and wanted to withdraw it to our own wallet. and we completed the transaction. Because the public key was exposed, it took seconds to find the wallet's private key. Can someone spend the money in this wallet? Doesn't the money in this wallet come to my wallet? SOME friends say that even if we find the wallet, someone else will steal the bitcoins. Is there such a thing? Then there is no point in searching for low puzzles? HOW TO WITHDRAW MONEY IN THE MOST SAFE WAY, IF WE FIND THE LOW PUZZLES

[brainless]

It is enough to mark the tx as without RBF and the winner gets it all!

Stop spreading bs.

with RBF or without RBF, in both case transaction will attempt by many peoples, where running bots for find PK,
but safe and secure way i know , how to perform tx without fear of stolen, i have tested different solutions, and found correct way,
pbies writes 50% correct, but in his testing, others simple get pubk within sec's, and will cancel your tx, as its exist at fair away blocks, and will generate new tx, with rbf or without rbf, and new race will start
lot of viewer and poster's have some satoshi, can play test, simple create new tx without rbf, and use an other system with electrum, load PK, and simple cancel tx from other system, and create new one tx with new addr from 2nd system, you will see results, for proofe my words, when some of you test, and back to ask me alternate way to fearless tx creation

[Baskentliia]

Brother, if we find the 66th puzzle, please share how we can withdraw it to our own wallet without risk and which program we will use. Don't let people's labor go to waste, and don't let thieves steal people's labor.

[AliBah]

is it clear how many percent of puzzle 66 scanned from 0%?
If there is such a this information, then we dont scan the scanned range...

[citb0in]

It is enough to mark the tx as without RBF and the winner gets it all!

Stop spreading bs.

better you stop spreading bullshit. You may mark the TX with RBF or not, it doesn't change anything. The transaction can always be replaced independently if the TX has been signaled RBF or not. Believe it or not, saatoshi_falling is right about what he said.

[Baskentliia]

It is enough to mark the tx as without RBF and the winner gets it all!

Stop spreading bs.

better you stop spreading bullshit. You may mark the TX with RBF or not, it doesn't change anything. The transaction can always be replaced independently if the TX has been signaled RBF or not. Believe it or not, saatoshi_falling is right about what he said.

If we find puzzle 66, then someone else will steal it, right?

If someone found #66 and withdrew with an extremely high transaction fee say 10k USD and then within 1 minute the scammers find the private key with kangaroo and submit their withdrawal with lets say 100k USD fee! Would the scammers still get it? Cause this means all the lower bit range puzzles are useless to even attempt.

Correct, but I won't call it a "scammer", perhaps just a leech.  And it won't be found within 1 minute. It will be found within a few seconds. The leech will still get 6 bitcoins, so even 200k RBF won't be too far fetched, as he'll get double his money back.
I feel sorry for people who enthusiastically tried puzzle 66 for many months or even a year or two, without realizing even if they found the private key there's no way in hell they will be able to withdraw it because unless you have 20/30/40k sitting around to gamble on the RBF lottery, you're not getting those funds.

The reason this did not happen before is because puzzle 65 and lower had very little to no reward money in it, so it was not worth the bidding war, but this all changes when the puzzle creator decided to put 6+ BTC in each puzzle. Now there's more people sitting and waiting with bots than people trying to solve.

what is the solution ?

[citb0in]

If we find puzzle 66, then someone else will steal it, right?

obviously yes

what is the solution ?

either

a) you know someone who has a monstrous mining rig in the EH/s (exahash per second) range and you could ask him to include your transaction which you manually baked into a block

or

b) you just try extending your luck by risking to make the transaction with the vague hope that it will take place within a few seconds because a block containing your transaction will be mined within the next second.

Note: Please avoid consecutive posts.

[Baskentliia]

If we find puzzle 66, then someone else will steal it, right?

obviously yes

what is the solution ?

either

a) you know someone who has a monstrous mining rig in the EH/s (exahash per second) range and you could ask him to include your transaction which you manually baked into a block

or

b) you just try extending your luck by risking to make the transaction with the vague hope that it will take place within a few seconds because a block containing your transaction will be mined within the next second.

Note: Please avoid consecutive posts.

Brother, your information is very valuable, this is a very important issue, for this reason, I wrote messages frequently to ensure that this situation is not left behind.
Are you absolutely sure about this? So I'm in shock right now. I think there is definitely another way. Maybe we won't find the puzzle, but the person who finds it will be the victim. People with bitcoin technical background and any kind of knowledge on this subject should share what they know.