Bitcoin puzzle transaction ~32 BTC prize to who solves it

[nomachine]

What are the tax implications of this in the US, I am assuming it would be not taxable unless you sell because when you find a privkey you technically now own that wallet so when you send it to another of your wallets that would be considered transferring between wallets you own which according to coinbase is not a taxable event and if you sell I am guessing it would be considered as regular income.

I will go to Malta if i hit #130. All I need is a suitcase with a lock.

I think this puzzle thing has stalled, the creator should release all the remaining public keys if he really wants to test the robustness of bitcoin, here only sha256 and ripemd-160 are being tested at this point

He can give out all public keys from 130 to 160, and nothing will happen.

This clearly illustrates how ridiculous these numbers are.

Let's consider how many Kangaroo hops are needed to hit 130...

Code:

from math import log2, sqrt

# Given puzzle number
puzzle = 130

# Calculate the expected hops
expected_hops = 2.2 * sqrt(2 ** (puzzle - 1))  # 2.2 * sqrt(2^(puzzle-1))
expected_hops_log2 = log2(expected_hops)

# Print the result
print(f"[+] [Expected Hops: 2^{expected_hops_log2:.2f} ({int(expected_hops)})]")

Expected Hops: 2^65.64 (57392798431464251392)

I  would need approximately 95,654,664,052,440,418 hops per second to generate 57,392,798,431,464,251,392 hops
in 10 minutes. There's no SHA-256 and RIPEMD-160 hashing for Kangaroo, just plain point addition as fast as possible.

Gray Alien technology is required. 👽

[kTimesG]

Let's consider how many Kangaroo hops are needed to hit 130...

Code:

from math import log2, sqrt

# Given puzzle number
puzzle = 130

# Calculate the expected hops
expected_hops = 2.2 * sqrt(2 ** (puzzle - 1))  # 2.2 * sqrt(2^(puzzle-1))
expected_hops_log2 = log2(expected_hops)

# Print the result
print(f"[+] [Expected Hops: 2^{expected_hops_log2:.2f} ({int(expected_hops)})]")

Expected Hops: 2^65.64 (57392798431464251392)

I  would need approximately 95,654,664,052,440,418 hops per second to generate 57,392,798,431,464,251,392 hops
in 10 minutes. There's no SHA-256 and RIPEMD-160 hashing for Kangaroo, just plain point addition as fast as possible.

Gray Alien technology is required. 👽

The thing with Kangaroo is that those numbers are the total wild x tames total jumps. So your calculations assume you start off from a clean slate.

What's great is that we'll soon have massive distributed computing capacity, so if careful planning and optimizations are in place, those numbers are within reach.

The classical point jumping strategy (batch a few hundred, run some jumps) is not very efficient on a GPU, unfortunately. It starts to run way faster when everything runs off the registers, and the batching is actually hurting the performance (even if the common thinking would be that the single inverse should compensate - it doesn't). For a CPU, the opposite strategy is the winning one, within the L1/L2 cache limits. This shows the conceptual differences that need to be accounted for when some algorithm is ported over from serial to parallel computation.

[nomachine]

What's great is that we'll soon have massive distributed computing capacity, so if careful planning and optimizations are in place, those numbers are within reach.

This cannot be done alone at home on a PC in the garage. Let's be realistic: it takes at least 5 BTC to invest in an attempt to get 13 BTC. This is not a puzzle; this is a big money gamble.

[Baskentliia]

What's great is that we'll soon have massive distributed computing capacity, so if careful planning and optimizations are in place, those numbers are within reach.

This cannot be done alone at home on a PC in the garage. Let's be realistic: it takes at least 5 BTC to invest in an attempt to get 13 BTC. This is not a puzzle; this is a big money gamble.

You are absolutely right.
Even if you had a scanning speed of 1 Million YOTTAKEY (1000000x 10**24) per second, it would take 20 years to scan puzzle 130 completely.

[kTimesG]

What's great is that we'll soon have massive distributed computing capacity, so if careful planning and optimizations are in place, those numbers are within reach.

This cannot be done alone at home on a PC in the garage. Let's be realistic: it takes at least 5 BTC to invest in an attempt to get 13 BTC. This is not a puzzle; this is a big money gamble.

Right, but technology develops vertically and once in a while horizontally as well. Yes, today the cost to break 130 is something like a few hundred top-end GPUs and a year of computation. But with tomorrow's hardware, the wall gets shorter, and then shorter again, etc. At some point the risk is worth it. Of course, there's always the chance the magic horoscope circle was correct. Until that point, I guess it's worth it to analyze all options, without going mad about it. I think it makes sense to try to squeeze out as much efficiency as possible with what we know and have today. So if some implementation can be speed up by 100%, the cost goes to half, or the time goes to half, both on current or future hardware. When scaled, these add up significantly.

A "garage" computer can run circles around the highest-end GPU, if it does things in a manner that solves a specific problem. If we ask Nvidia to make a chip that handles secp256k1 field arithmetic in HW, instead of non-sense AI silicon, anyone would solve 130 in a week.

[nomachine]

......anyone would solve 130 in a week.

This doesn't apply to just anyone. If any of us had around 2000 high-end GPUs, we wouldn't be chatting on this forum; we'd be at a Bitcoin rooftop party in Dubai with davincij15 and mmcrypto.    

[cnk1220]

If so, why still people discussing about it anyway?

The reasons people continue to engage in these activities are varied. They range from the intellectual challenge and community interaction to potential rewards and pure enjoyment. It’s much like any hobby where the journey and engagement often matter as much as, if not more than, the destination, including for those with mental health issues.

Why they didn't crack public key from puzzle 64?

because it doesn't work and people panic here
the bot won't steal anything from you because when the 66 address is solved in a hundred years, only skeletons will remain of the bots XD

So you claim that RBF does not work?
To experimentally prove that Replace-by-Fee (RBF) works for Bitcoin (BTC) you can follow these steps:

Ensure you have access to a Bitcoin wallet that supports RBF.

Acquire a small amount of Bitcoin for the experiment.

Using the same Bitcoin wallet, create a new transaction with a higher fee that replaces the original one. This involves using the RBF feature to broadcast the same transaction with a higher fee.

So, let's try if it really works..

Address: 18bHfcm8kGoAhBaQXzzVcG5534mdpWK981
PubKey: 026555030ac562aed59b3ecd47e250e555ca59eb31f6d0a03b36ba4f6b9c5a073c
Start: C0DE000000000000000000000000000000000000000000003000000000000000
End: C0DE000000000000000000000000000000000000000000003fffffffffffffff

Can you get that private key?

[Feron]

what is the ethereum equivalent for the address 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
I would like to know if there are ethereum coins for this address

https://privatekeys.pw/address/bitcoin/13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
all this is connected to the 66 puzzle address, the one who solves the 66 address should take it all at once, what programs are needed for this

[kTimesG]

Address: 18bHfcm8kGoAhBaQXzzVcG5534mdpWK981
PubKey: 026555030ac562aed59b3ecd47e250e555ca59eb31f6d0a03b36ba4f6b9c5a073c
Start: C0DE000000000000000000000000000000000000000000003000000000000000
End: C0DE000000000000000000000000000000000000000000003fffffffffffffff

Can you get that private key?

0xC0DE00000000000000000000000000000000000000000000327EF00CB359064B

[cnk1220]

Address: 18bHfcm8kGoAhBaQXzzVcG5534mdpWK981
PubKey: 026555030ac562aed59b3ecd47e250e555ca59eb31f6d0a03b36ba4f6b9c5a073c
Start: C0DE000000000000000000000000000000000000000000003000000000000000
End: C0DE000000000000000000000000000000000000000000003fffffffffffffff

Can you get that private key?

0xC0DE00000000000000000000000000000000000000000000327EF00CB359064B

How long it takes?

[cnk1220]

If so, why still people discussing about it anyway?

The reasons people continue to engage in these activities are varied. They range from the intellectual challenge and community interaction to potential rewards and pure enjoyment. It’s much like any hobby where the journey and engagement often matter as much as, if not more than, the destination, including for those with mental health issues.

Why they didn't crack public key from puzzle 64?

because it doesn't work and people panic here
the bot won't steal anything from you because when the 66 address is solved in a hundred years, only skeletons will remain of the bots XD

So you claim that RBF does not work?
To experimentally prove that Replace-by-Fee (RBF) works for Bitcoin (BTC) you can follow these steps:

Ensure you have access to a Bitcoin wallet that supports RBF.

Acquire a small amount of Bitcoin for the experiment.

Using the same Bitcoin wallet, create a new transaction with a higher fee that replaces the original one. This involves using the RBF feature to broadcast the same transaction with a higher fee.

So, let's try if it really works..

Address: 18bHfcm8kGoAhBaQXzzVcG5534mdpWK981
PubKey: 026555030ac562aed59b3ecd47e250e555ca59eb31f6d0a03b36ba4f6b9c5a073c
Start: C0DE000000000000000000000000000000000000000000003000000000000000
End: C0DE000000000000000000000000000000000000000000003fffffffffffffff

Can you get that private key?

Nope. It is not 66bit range

python3 puzzle_bot.py

• Version 0.2.230519 Satoshi Quest, developed by AlbertoBSD
• Endomorphism enabled
• Threads : 12
• Search compress only
• Quiet thread output
• K factor 4096
• Mode BSGS sequential
• Opening file 66.txt
• Added 1 points from file
• Bit Range 66
• -- from : 0x20000000000000000
• -- to   : 0x40000000000000000
• N = 0x100000000000
• Bloom filter for 17179869184 elements : 58890.60 MB
• Bloom filter for 536870912 elements : 1840.33 MB
• Bloom filter for 16777216 elements : 57.51 MB
• Allocating 256.00 MB for 16777216 bP Points
• Reading bloom filter from file keyhunt_bsgs_4_17179869184.blm .... Done!   
• Reading bloom filter from file keyhunt_bsgs_6_536870912.blm .... Done!
• Reading bP Table from file keyhunt_bsgs_2_16777216.tbl .... Done!
• Reading bloom filter from file keyhunt_bsgs_7_16777216.blm .... Done!
• Total 134013403005431316480 keys in 30 seconds: ~4 Ekeys/s (4467113433514377216 keys/s)

End

Two points:

1 - So it only works to 66bit? And about puzzles 67,68,69 .... ?

2 - kTimesG did it!

[nomachine]

Two points:

1 - So it only works to 66bit? And about puzzles 67,68,69 .... ?

2 - kTimesG did it!

My script only works for bit values ranging from 66 to 69. I need a Bitcoin address and a range from 66 to 69 bits. He entered the range manually using the option -r 3000000000000000:3fffffffffffffff, but I don't have that option in my bot.

[kTimesG]

How long it takes?

Well your range was 60-bit wide so something like 2 seconds from boot to finish. Around 5 MB of RAM usage.

What was the point of this exercise?

[nomachine]

How long it takes?

Well your range was 60-bit wide so something like 2 seconds from boot to finish. Around 5 MB of RAM usage.

What was the point of this exercise?

327EF00CB359064B  is private key for 19KbdoUvvD3CdTy78VNaLEjhzQfn55P89B

not  18bHfcm8kGoAhBaQXzzVcG5534mdpWK981

[cnk1220]

How long it takes?

Well your range was 60-bit wide so something like 2 seconds from boot to finish. Around 5 MB of RAM usage.

What was the point of this exercise?

I just wanna know if it's is real.. and it is!

[kTimesG]

327EF00CB359064B  is private key for 19KbdoUvvD3CdTy78VNaLEjhzQfn55P89B

not  18bHfcm8kGoAhBaQXzzVcG5534mdpWK981

?

a <= k <= b

1 <= k - a + 1 <= b - a + 1

(k - a + 1)*G = k*G - a*G + G

It doesn't matter if a or b are anywhere between 1 and 2**256, just their difference.

[cnk1220]

327EF00CB359064B  is private key for 19KbdoUvvD3CdTy78VNaLEjhzQfn55P89B

not  18bHfcm8kGoAhBaQXzzVcG5534mdpWK981

?

a <= k <= b

1 <= k - a + 1 <= b - a + 1

(k - a + 1)*G = k*G - a*G + G

It doesn't matter if a or b are anywhere between 1 and 2**256, just their difference.

Do you did your own implementation or it is some software?

[nomachine]

How long it takes?

Well your range was 60-bit wide so something like 2 seconds from boot to finish. Around 5 MB of RAM usage.

What was the point of this exercise?

I just wanna know if it's is real.. and it is!

It works if you give us the right range and the right BTC address.

Start: 3000000000000000
End: 3fffffffffffffff

This is 62bit range.

Address: 18bHfcm8kGoAhBaQXzzVcG5534mdpWK981  is not in 62bit range.



 python3 puzzle_bot.py

• Version 0.2.230519 Satoshi Quest, developed by AlbertoBSD
• Endomorphism enabled
• Threads : 12
• Search compress only
• Quiet thread output
• K factor 4096
• Mode BSGS sequential
• Opening file 62.txt
• Added 1 points from file
• Bit Range 62
• -- from : 0x2000000000000000
• -- to   : 0x4000000000000000
• N = 0x100000000000
• Bloom filter for 17179869184 elements : 58890.60 MB
• Bloom filter for 536870912 elements : 1840.33 MB
• Bloom filter for 16777216 elements : 57.51 MB
• Allocating 256.00 MB for 16777216 bP Points
• Reading bloom filter from file keyhunt_bsgs_4_17179869184.blm .... Done!
• Reading bloom filter from file keyhunt_bsgs_6_536870912.blm .... Done!
• Reading bP Table from file keyhunt_bsgs_2_16777216.tbl .... Done!
• Reading bloom filter from file keyhunt_bsgs_7_16777216.blm .... Done!

End


It takes about 5 seconds to find out whether it is puzzle correct or not.
Try something else.

327EF00CB359064B  is private key for 19KbdoUvvD3CdTy78VNaLEjhzQfn55P89B

not  18bHfcm8kGoAhBaQXzzVcG5534mdpWK981

?

a <= k <= b

1 <= k - a + 1 <= b - a + 1

(k - a + 1)*G = k*G - a*G + G

It doesn't matter if a or b are anywhere between 1 and 2**256, just their difference.

18bHfcm8kGoAhBaQXzzVcG5534mdpWK981 has an outgoing transaction -0.00491785 BTC•-$322.17
19KbdoUvvD3CdTy78VNaLEjhzQfn55P89B has 0

addresses with 0 BTC are not the subject of discussion here.

[kTimesG]

Do you did your own implementation or it is some software?

A fast CUDA-based kangaroo runner (not JLP). Nothing earth-shattering so far, still testing out different things like getting rid of the carry propagation to improve parallelization. 60-bit is easily crackable even on a single-threaded CPU program. And I mentioned already some time ago that a lot of the work can be precomputed in advance, in absence of a public key. So, uhm, if m*n = t*w, guess what... you can reduce w to go towards 1, until resources are a bottleneck.

It works if you give us the right range and the right BTC address.

Start: 3000000000000000
End: 3fffffffffffffff

This is 62bit range.

Address: 18bHfcm8kGoAhBaQXzzVcG5534mdpWK981  is not in 62bit range.

It takes about 5 seconds to find out whether it is puzzle correct or not.
Try something else.

Are you OK? The dude gave us two numbers: start and end.
There are exactly 60 bits different (Hamming distance) between the two. Not 62. The last 60 bits.

It wouldn't even matter if the missing bits are on some random positions, instead of being at the end.

It's still a "missing 60 bits" = 60-bit problem, no matter if the rest of the known bits are 0 or not.

[cnk1220]

How long it takes?

Well your range was 60-bit wide so something like 2 seconds from boot to finish. Around 5 MB of RAM usage.

What was the point of this exercise?

I just wanna know if it's is real.. and it is!

It works if you give us the right range and the right BTC address.

Start: 3000000000000000
End: 3fffffffffffffff

This is 62bit range.

Address: 18bHfcm8kGoAhBaQXzzVcG5534mdpWK981  is not in 62bit range.



 python3 puzzle_bot.py

• Version 0.2.230519 Satoshi Quest, developed by AlbertoBSD
• Endomorphism enabled
• Threads : 12
• Search compress only
• Quiet thread output
• K factor 4096
• Mode BSGS sequential
• Opening file 62.txt
• Added 1 points from file
• Bit Range 62
• -- from : 0x2000000000000000
• -- to   : 0x4000000000000000
• N = 0x100000000000
• Bloom filter for 17179869184 elements : 58890.60 MB
• Bloom filter for 536870912 elements : 1840.33 MB
• Bloom filter for 16777216 elements : 57.51 MB
• Allocating 256.00 MB for 16777216 bP Points
• Reading bloom filter from file keyhunt_bsgs_4_17179869184.blm .... Done!
• Reading bloom filter from file keyhunt_bsgs_6_536870912.blm .... Done!
• Reading bP Table from file keyhunt_bsgs_2_16777216.tbl .... Done!
• Reading bloom filter from file keyhunt_bsgs_7_16777216.blm .... Done!

End


It takes about 5 seconds to find out whether it is puzzle correct or not.
Try something else.

Now I know it works, kTimesG found it.

I give you all information necessary, and correct information.. He found it.