Bitcoin puzzle transaction ~32 BTC prize to who solves it

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

[nomachine]

Now I know it works, kTimesG found it.

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

You are both on the ignore list. This is obviously Digaran again in multiple copies.

[cnk1220]

Now I know it works, kTimesG found it.

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

You are both on the ignore list. This is obviously Digaran again in multiple copies.

What are yout talking about?

My account is from 2017.


I give all right information from youtube channel: https://www.youtube.com/watch?v=_oUrgSFCXnc
He make a public little puzzle to his subscribes..

So to try out about you all talking about get private key from public key, I try you from his puzzle.. just it.

And KtimesG did it, you just misunderstood the informations that I post, range, privkey, etc...

You just don't get it and is saying nonsense things.

[kTimesG]

Now I know it works, kTimesG found it.

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

You are both on the ignore list. This is obviously Digaran again in multiple copies.

Not my problem that you can't read that the range has the "0xC0DE" prefix, making all of your last few posts a shame show.

Anyone can confirm the key was correct.

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

So, what don't get 130º puzzle? Time?

[neo_93]

Do you know if there is any tool/code already available to make this break in quantum computers like Azure Quantum? And is there any difference in making this break in relation to conventional computers?

[vneos]

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

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

Can you get that private key?

Kangaroo v2.2
Start:C0DE000000000000000000000000000000000000000000003000000000000000
Stop :C0DE000000000000000000000000000000000000000000003FFFFFFFFFFFFFFF
Keys :1
Number of CPU thread: 0
Range width: 2^60
Jump Avg distance: 2^30.03
Number of kangaroos: 2^22.36
Suggested DP: 4
Expected operations: 2^31.09
Expected RAM: 5466.3MB
DP size: 4 [0xf000000000000000]
GPU: GPU #0 NVIDIA GeForce RTX 3090 (82x0 cores) Grid(164x128) (212.0 MB used)
SolveKeyGPU Thread GPU#0: creating kangaroos...
GPU: GPU #1 NVIDIA GeForce RTX 3090 (82x0 cores) Grid(164x128) (212.0 MB used)
SolveKeyGPU Thread GPU#1: creating kangaroos...
SolveKeyGPU Thread GPU#0: 2^21.36 kangaroos [10.9s]
SolveKeyGPU Thread GPU#1: 2^21.36 kangaroos [10.9s]

Warning, 10618204 items lost
Hint: Search with less threads (-g) or increse dp (-d)

Warning, 10615914 items lost
Hint: Search with less threads (-g) or increse dp (-d)
[3858.58 MK/s][GPU 3858.58 MK/s][Count 2^33.19][Dead 0][04s (Avg 00s)][222.9/285.1MB]  
Done: Total time 20s

Key# 0 [1S]Pub:  0x026555030AC562AED59B3ECD47E250E555CA59EB31F6D0A03B36BA4F6B9C5A073C
       Priv: 0xC0DE00000000000000000000000000000000000000000000327EF00CB359064B

[cnk1220]

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

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

Can you get that private key?

Kangaroo v2.2
Start:C0DE000000000000000000000000000000000000000000003000000000000000
Stop :C0DE000000000000000000000000000000000000000000003FFFFFFFFFFFFFFF
Keys :1
Number of CPU thread: 0
Range width: 2^60
Jump Avg distance: 2^30.03
Number of kangaroos: 2^22.36
Suggested DP: 4
Expected operations: 2^31.09
Expected RAM: 5466.3MB
DP size: 4 [0xf000000000000000]
GPU: GPU #0 NVIDIA GeForce RTX 3090 (82x0 cores) Grid(164x128) (212.0 MB used)
SolveKeyGPU Thread GPU#0: creating kangaroos...
GPU: GPU #1 NVIDIA GeForce RTX 3090 (82x0 cores) Grid(164x128) (212.0 MB used)
SolveKeyGPU Thread GPU#1: creating kangaroos...
SolveKeyGPU Thread GPU#0: 2^21.36 kangaroos [10.9s]
SolveKeyGPU Thread GPU#1: 2^21.36 kangaroos [10.9s]

Warning, 10618204 items lost
Hint: Search with less threads (-g) or increse dp (-d)

Warning, 10615914 items lost
Hint: Search with less threads (-g) or increse dp (-d)
[3858.58 MK/s][GPU 3858.58 MK/s][Count 2^33.19][Dead 0][04s (Avg 00s)][222.9/285.1MB]  
Done: Total time 20s

Key# 0 [1S]Pub:  0x026555030AC562AED59B3ECD47E250E555CA59EB31F6D0A03B36BA4F6B9C5A073C
       Priv: 0xC0DE00000000000000000000000000000000000000000000327EF00CB359064B

What is this, that works with gpu?

[AlanJohnson]

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

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

Can you get that private key?

Kangaroo v2.2
Start:C0DE000000000000000000000000000000000000000000003000000000000000
Stop :C0DE000000000000000000000000000000000000000000003FFFFFFFFFFFFFFF
Keys :1
Number of CPU thread: 0
Range width: 2^60
Jump Avg distance: 2^30.03
Number of kangaroos: 2^22.36
Suggested DP: 4
Expected operations: 2^31.09
Expected RAM: 5466.3MB
DP size: 4 [0xf000000000000000]
GPU: GPU #0 NVIDIA GeForce RTX 3090 (82x0 cores) Grid(164x128) (212.0 MB used)
SolveKeyGPU Thread GPU#0: creating kangaroos...
GPU: GPU #1 NVIDIA GeForce RTX 3090 (82x0 cores) Grid(164x128) (212.0 MB used)
SolveKeyGPU Thread GPU#1: creating kangaroos...
SolveKeyGPU Thread GPU#0: 2^21.36 kangaroos [10.9s]
SolveKeyGPU Thread GPU#1: 2^21.36 kangaroos [10.9s]

Warning, 10618204 items lost
Hint: Search with less threads (-g) or increse dp (-d)

Warning, 10615914 items lost
Hint: Search with less threads (-g) or increse dp (-d)
[3858.58 MK/s][GPU 3858.58 MK/s][Count 2^33.19][Dead 0][04s (Avg 00s)][222.9/285.1MB]  
Done: Total time 20s

Key# 0 [1S]Pub:  0x026555030AC562AED59B3ECD47E250E555CA59EB31F6D0A03B36BA4F6B9C5A073C
       Priv: 0xC0DE00000000000000000000000000000000000000000000327EF00CB359064B

So ?    It will take over 10 years of non stop cracking to find a 66bit and then someone will steal the key thanks to public key in the mempool...

[vneos]

What is this, that works with gpu?

This is kangaroo, you can find it in this repo:

https://github.com/JeanLucPons/Kangaroo

As you see, it's works well with gpu.

[vneos]

So ?    It will take over 10 years of non stop cracking to find a 66bit and then someone will steal the key thanks to public key in the mempool...

Absolutely.

[Akito S. M. Hosana]

What is this, that works with gpu?

This is kangaroo, you can find it in this repo:

https://github.com/JeanLucPons/Kangaroo

As you see, it's works well with gpu.

It also works well on the old CPU

• Kangaroo v2.3 [256 range edition]
• Wed Jun 19 09:31:50 2024
• Start:C0DE000000000000000000000000000000000000000000003000000000000000
• Stop :C0DE000000000000000000000000000000000000000000003FFFFFFFFFFFFFFF
• Keys :1
• Number of CPU thread: 4
• Range width: 2^60
• Jump Avg distance: 2^30.03
• Suggested DP: 13
• Expected operations: 2^31.10
• Expected RAM: 33.4MB
• DP size: 13 [0x0001fff]
• SolveKeyCPU Thread 01: 1024 kangaroos
• SolveKeyCPU Thread 02: 1024 kangaroos
• SolveKeyCPU Thread 00: 1024 kangaroos
• SolveKeyCPU Thread 03: 1024 kangaroos
• [27.23 MK/s][GPU 0.00 MK/s][Count 2^31.75][Dead 1][02:28 (Avg 01:24)][32.1/60.1MB]
• Done: Total time 02:30

Key# 0 [1S]Pub: 0x026555030AC562AED59B3ECD47E250E555CA59EB31F6D0A03B36BA4F6B9C5A073C
Priv: 0xC0DE00000000000000000000000000000000000000000000327EF00CB359064B

130bit test

2F633CBE3EC02B9401000000007000000
2F633CBE3EC02B9401000000009000000
021c20007f8c8984d403a695494d6afbff37f55a01c8bd1aafb9b958fa9485bb02

• Kangaroo v2.3 [256 range edition]
• Wed Jun 19 10:21:30 2024
• Start:2F633CBE3EC02B9401000000007000000
• Stop :2F633CBE3EC02B9401000000009000000
• Keys :1
• Number of CPU thread: 4
• Range width: 2^26
• Jump Avg distance: 2^12.96
• Suggested DP: 0
• Expected operations: 2^14.49
• Expected RAM: 13.8MB
• DP size: 0 [0x0000]
• SolveKeyCPU Thread 00: 1024 kangaroos
• SolveKeyCPU Thread 01: 1024 kangaroos
• SolveKeyCPU Thread 02: 1024 kangaroos
• SolveKeyCPU Thread 03: 1024 kangaroos
• Done: Total time 00s

Key# 0 [1S]Pub: 0x021C20007F8C8984D403A695494D6AFBFF37F55A01C8BD1AAFB9B958FA9485BB02
Priv: 0x2F633CBE3EC02B9401000000008000000

I found the 256-bit version here
https://github.com/mikorist/Kangaroo-256-bit

[kTimesG]

130bit test

2F633CBE3EC02B9401000000007000000
2F633CBE3EC02B9401000000009000000
021c20007f8c8984d403a695494d6afbff37f55a01c8bd1aafb9b958fa9485bb02

• Done: Total time 00s

Key# 0 [1S]Pub: 0x021C20007F8C8984D403A695494D6AFBFF37F55A01C8BD1AAFB9B958FA9485BB02
Priv: 0x2F633CBE3EC02B9401000000008000000

That is not a 130-bit test, it's a 26-bit range, so the search is for a 26-bit private key that starts from some 130-bit offset (which size's is irrelevant).

26 bit is crackable in less than a second even if using slow-as-shit Python script, which is thousands of times slower than some native fast code.

It only takes around 5000 or so point additions to find the key.

[Akito S. M. Hosana]

130bit test

2F633CBE3EC02B9401000000007000000
2F633CBE3EC02B9401000000009000000
021c20007f8c8984d403a695494d6afbff37f55a01c8bd1aafb9b958fa9485bb02

• Done: Total time 00s

Key# 0 [1S]Pub: 0x021C20007F8C8984D403A695494D6AFBFF37F55A01C8BD1AAFB9B958FA9485BB02
Priv: 0x2F633CBE3EC02B9401000000008000000

That is not a 130-bit test, it's a 26-bit range, so the search is for a 26-bit private key that starts from some 130-bit offset (which size's is irrelevant).

26 bit is crackable in less than a second even if using slow-as-shit Python script, which is thousands of times slower than some native fast code.

It only takes around 5000 or so point additions to find the key.

this same test

Kangaroo 2.2 (JeanLucPons) : found the key in 15 seconds
Kangaroo 2.3 (256-bit) : 0.2 seconds
Etar-Kangaroo : no result
Rotor-Cuda: found key in 15 seconds - like Kangaroo 2.2


I am not sure if I am starting those tools with the correct options. I'm new in town.

You are both on the ignore list. This is obviously Digaran again in multiple copies.

I joined here because of his posts. Digaran is the undisputed king here.

[cnk1220]

What is this, that works with gpu?

This is kangaroo, you can find it in this repo:

https://github.com/JeanLucPons/Kangaroo

As you see, it's works well with gpu.

So you couldn't use It tô get 130°?
How long It will take?