Bitcoin puzzle transaction ~32 BTC prize to who solves it

[elvis13]

"I've been looking in this mirror for three years in a row!!))) I can reveal a secret - there are all the patterns - which are in any cyclic set - in which the number of members is a prime number! ))) there are patterns!!! That's just not possible to find the difference between the first half and the mirror second))) and so yes - it's very interesting to frustrate))"

Buddy, Doctor 1975. Show your guesses with an example!

[1714872238]

1714872238

[1714872238]

1714872238

[digaran]

Why you think no one didn't show up for years and now he moved some coins to raise the reward ?
.................
........................
they are sitting there only to control the security level.

He didn't show up to add more funds because there wasn't any serious people involved in the hunt, after asking him for a couple of month to add more funds in order to make it worth while, he nicely did so.

About someone sitting some where to control the security, I can think of 3 possible scenarios,
1- he is trying to show off, and test the skills of community members to see if some one can find a quick way to collect the coins or not, so it is an evaluation test for safety and reassurance for the world.

2- he already knows that there are some shortcuts to find the keys, by doing this he is trying to determine whether other people know about them or not.

3- he enjoys boasting and torturing us. 🤣

If the calculations of WP, are correct then solving 125 will require the same amount of work as solving 66, therefore no one will try addresses with no known public keys, note that solving 130 would require the same amount of work as brute forcing #68 I think?

So yeah.

Ps, I was thinking about 1000BTC in a single exposed public key in a high range, that would be a real safety check.Once again, there are many talented people lurking around these woods which are honest and not thieves, but if there is a very large incentive they could work 24/7 to eventually find a solution, without that large incentive, they won't spend all their time trying to steal coins from other people.

I would love to participate in such a big and difficult challenge personally.😉

[citb0in]

2- he already knows that there are some shortcuts to find the keys, by doing this he is trying to determine whether other people know about them or not.

Exactly. And if the person acts smartly and carefully by not withdrawing the coins, he builds up an enormous advantage over the "makers". Of course, this requires a great deal of self-control and greed for money, power or prestige are out of place. It is great to know that there are people out there on planet earth who can stand up to this and will not pull the coins even if they nowdays already do know the keys to each of these puzzles and could well knowingly become millionaires. Hats off 

[WanderingPhilospher]

Why you think no one didn't show up for years and now he moved some coins to raise the reward ?
.................
........................
they are sitting there only to control the security level.

He didn't show up to add more funds because there wasn't any serious people involved in the hunt, after asking him for a couple of month to add more funds in order to make it worth while, he nicely did so.

About someone sitting some where to control the security, I can think of 3 possible scenarios,
1- he is trying to show off, and test the skills of community members to see if some one can find a quick way to collect the coins or not, so it is an evaluation test for safety and reassurance for the world.

2- he already knows that there are some shortcuts to find the keys, by doing this he is trying to determine whether other people know about them or not.

3- he enjoys boasting and torturing us. 🤣

If the calculations of WP, are correct then solving 125 will require the same amount of work as solving 66, therefore no one will try addresses with no known public keys, note that solving 130 would require the same amount of work as brute forcing #68 I think?

So yeah.

Ps, I was thinking about 1000BTC in a single exposed public key in a high range, that would be a real safety check.Once again, there are many talented people lurking around these woods which are honest and not thieves, but if there is a very large incentive they could work 24/7 to eventually find a solution, without that large incentive, they won't spend all their time trying to steal coins from other people.

I would love to participate in such a big and difficult challenge personally.😉

2^63.05 ops for #125 using Kangaroo. 2^65.55 ops for #130 using kangaroo. Brute force, if found close to 50 percent of ranges searched: #66 = 2^64 ops, #67 = 2^65 ops, #68 2^66 ops, ect. The other factor is program speed; if you take the same card and setup, normally it has more speed, MKey/s using Kangaroo than using a bruteforce program.

#125 vs #66; #125 = less ops and two times the loot. Which way will people go?  #66 has a pool and I have setup a pool for #125. It'll be a fun race regardless of which pool solves first!

[gacel]

What's the average time for RTX 4090 to convert 256 millions of numbers into BTC addresses with comparing to one address? I have some kind of formula to predict the next puzzles. But I don't have much knowledge about IT.

[WanderingPhilospher]

What's the average time for RTX 4090 to convert 256 millions of numbers into BTC addresses with comparing to one address? I have some kind of formula to predict the next puzzles. But I don't have much knowledge about IT.

less than a second lol. But are you needing to print to file each address?

4090 does 2 billion addresses per second.

[gacel]

What's the average time for RTX 4090 to convert 256 millions of numbers into BTC addresses with comparing to one address? I have some kind of formula to predict the next puzzles. But I don't have much knowledge about IT.

less than a second lol. But are you needing to print to file each address?

4090 does 2 billion addresses per second.

No I don't. I just need Integer -> Private -> Public Key -> First Compressed Address & compare result with one address, before this operation also simple math exactly x*Y+n. That's it.

48 billion iterations (only internations no comparing, hashing & I bet random numbers in range will be x100 faster its easy to predict with formula)
    each iteration 256 milion operations x*Y+n = Integer -> Address, Compare

With my formula this is the time to solve #66

[WanderingPhilospher]

What's the average time for RTX 4090 to convert 256 millions of numbers into BTC addresses with comparing to one address? I have some kind of formula to predict the next puzzles. But I don't have much knowledge about IT.

less than a second lol. But are you needing to print to file each address?

4090 does 2 billion addresses per second.

No I don't. I just need Integer -> Private -> Public Key -> First Compressed Address & compare result with one address, before this operation also simple math exactly x*Y+n. That's it.

48 billion iterations (only internations no comparing, hashing & I bet random numbers in range will be x100 faster its easy to predict with formula)
    each iteration 256 milion operations x*Y+n = Integer -> Address, Compare

With my formula this is the time to solve #66

Good luck! Hope you get it.

With any 20xx, 30xx, 40xx, you will be able to do 100s of millions of keys per second.

[gacel]

What's the average time for RTX 4090 to convert 256 millions of numbers into BTC addresses with comparing to one address? I have some kind of formula to predict the next puzzles. But I don't have much knowledge about IT.

less than a second lol. But are you needing to print to file each address?

4090 does 2 billion addresses per second.

No I don't. I just need Integer -> Private -> Public Key -> First Compressed Address & compare result with one address, before this operation also simple math exactly x*Y+n. That's it.

48 billion iterations (only internations no comparing, hashing & I bet random numbers in range will be x100 faster its easy to predict with formula)
    each iteration 256 milion operations x*Y+n = Integer -> Address, Compare

With my formula this is the time to solve #66

Good luck! Hope you get it.

With any 20xx, 30xx, 40xx, you will be able to do 100s of millions of keys per second.

If anyone can help me with coding script for that would be nice. I'll share with reward.

[kknd]

1 Ekeys/s (1021708069969158067 keys/s)

1.021.708.069.969.158.067 keys/s

128gb + 16 AMD Ryzen 7 5800X

Code:

ubuntu@:~/kknd/keyhunt$ ./keyhunt -m bsgs -f 125.pub -b 125 -R -q -S -n 0x400000000000 -k 4096 -t 15
[+] Version 0.2.230428 Satoshi Quest, developed by AlbertoBSD
[+] Random mode
[+] Quiet thread output
[+] K factor 4096
[+] Threads : 15
[+] Mode BSGS random
[+] Opening file 125.pub
[+] Added 1 points from file
[+] Bit Range 125
[+] -- from : 0x10000000000000000000000000000000 [+] -- to   : 0x20000000000000000000000000000000
[+] N = 0x400000000000
[+] Bloom filter for 34359738368 elements : 117781.20 MB
[+] Bloom filter for 1073741824 elements : 3680.66 MB
[+] Bloom filter for 33554432 elements : 115.02 MB
[+] Allocating 512.00 MB for 33554432 bP Points
[+] Reading bloom filter from file keyhunt_bsgs_4_34359738368.blm .... Done!
[+] Reading bloom filter from file keyhunt_bsgs_6_1073741824.blm .... Done!
[+] Reading bP Table from file keyhunt_bsgs_2_33554432.tbl .... Done!
[+] Reading bloom filter from file keyhunt_bsgs_7_33554432.blm .... Done!
[+] Total 82543794972808280276992 keys in 80790 seconds: ~1 Ekeys/s (1021708069969158067 keys/s)

Code:

Architecture:            x86_64
  CPU op-mode(s):        32-bit, 64-bit
  Address sizes:         48 bits physical, 48 bits virtual
  Byte Order:            Little Endian
CPU(s):                  16
  On-line CPU(s) list:   0-15
Vendor ID:               AuthenticAMD
  Model name:            AMD Ryzen 7 5800X 8-Core Processor
    CPU family:          25
    Model:               33
    Thread(s) per core:  2
    Core(s) per socket:  8
    Socket(s):           1
    Stepping:            2
    Frequency boost:     enabled
    CPU max MHz:         3800.0000
    CPU min MHz:         2200.0000
    BogoMIPS:            7586.05

[WanderingPhilospher]

1 Ekeys/s (1021708069969158067 keys/s)

1.021.708.069.969.158.067 keys/s

Impressive.

My 2 core Celeron CPU and 6 GPUs only do 46116860184273879040 keys/s

46.116.860.184.273.879.040 keys/s

But that's only using 8GB of RAM. If I installed more, upwards of 128GB of RAM, the rig would then get 553402322211286548480 keys/s

553.402.322.211.286.548.480 keys/s

BSGS is a really sweet program, but it's almost useless for higher bit ranges. Even if a system with BSGS can scan a 2^80 bit range in 1 minute, the search time for #125 would still be 2^44 minutes; if you found it at the midpoint/half of ranges, it would still be 2^43 minutes.

17.592.186.044.416 minutes.

33.470.673 years.

[BS0D]

1 Ekeys/s (1021708069969158067 keys/s)

1.021.708.069.969.158.067 keys/s

128gb + 16 AMD Ryzen 7 5800X

http://kknd.com.br/etc/keyhunt.png

Code:

ubuntu@:~/kknd/keyhunt$ ./keyhunt -m bsgs -f 125.pub -b 125 -R -q -S -n 0x400000000000 -k 4096 -t 15
[+] Version 0.2.230428 Satoshi Quest, developed by AlbertoBSD
[+] Random mode
[+] Quiet thread output
[+] K factor 4096
[+] Threads : 15
[+] Mode BSGS random
[+] Opening file 125.pub
[+] Added 1 points from file
[+] Bit Range 125
[+] -- from : 0x10000000000000000000000000000000 [+] -- to   : 0x20000000000000000000000000000000
[+] N = 0x400000000000
[+] Bloom filter for 34359738368 elements : 117781.20 MB
[+] Bloom filter for 1073741824 elements : 3680.66 MB
[+] Bloom filter for 33554432 elements : 115.02 MB
[+] Allocating 512.00 MB for 33554432 bP Points
[+] Reading bloom filter from file keyhunt_bsgs_4_34359738368.blm .... Done!
[+] Reading bloom filter from file keyhunt_bsgs_6_1073741824.blm .... Done!
[+] Reading bP Table from file keyhunt_bsgs_2_33554432.tbl .... Done!
[+] Reading bloom filter from file keyhunt_bsgs_7_33554432.blm .... Done!
[+] Total 82543794972808280276992 keys in 80790 seconds: ~1 Ekeys/s (1021708069969158067 keys/s)

http://kknd.com.br/etc/htop.png

Code:

Architecture:            x86_64
  CPU op-mode(s):        32-bit, 64-bit
  Address sizes:         48 bits physical, 48 bits virtual
  Byte Order:            Little Endian
CPU(s):                  16
  On-line CPU(s) list:   0-15
Vendor ID:               AuthenticAMD
  Model name:            AMD Ryzen 7 5800X 8-Core Processor
    CPU family:          25
    Model:               33
    Thread(s) per core:  2
    Core(s) per socket:  8
    Socket(s):           1
    Stepping:            2
    Frequency boost:     enabled
    CPU max MHz:         3800.0000
    CPU min MHz:         2200.0000
    BogoMIPS:            7586.05

I think I was getting about 450/620Pkeys/s on Ryzen 5950X/32GB with k=1440/2048 on #120
Would like to have 128GB on my system but that's impossible due some reasons

[Woz2000]

Getting 128GB to work with a desktop PC can be tricky. With modern processors incorporating memory controllers on die, the load from 4 DIMMS is problematic.

If anyone is interested in using 4 DIMMS, make sure to check the memory QVL for the motherboard you have and be prepared to spend some time tweaking the BIOS to make it work. Using memory that is not on the QVL may also work but will most likely need tweaking and loosening of the timings and speed.

I think I was getting about 450/620Pkeys/s on Ryzen 5950X/32GB with k=1440/2048 on #120
Would like to have 128GB on my system but that's impossible due some reasons

[BS0D]

Getting 128GB to work with a desktop PC can be tricky. With modern processors incorporating memory controllers on die, the load from 4 DIMMS is problematic.

If anyone is interested in using 4 DIMMS, make sure to check the memory QVL for the motherboard you have and be prepared to spend some time tweaking the BIOS to make it work. Using memory that is not on the QVL may also work but will most likely need tweaking and loosening of the timings and speed.

I think I was getting about 450/620Pkeys/s on Ryzen 5950X/32GB with k=1440/2048 on #120
Would like to have 128GB on my system but that's impossible due some reasons

I use a mini-itx board so only two dimm slots available. Plus I just want to use b-die sticks which is a total limit. Seems there were G.Skill 2x32GB b-die kits in production but it's almost impossible to find or the price is oof

[BTC_Backdoor]

Is there any python script for BSGS that can search 2^80 as you mentioned?

https://github.com/Telariust/pollard-kangaroo/blob/master/pollard-kangaroo.py   This one is useless, because I tested it by giving it a test public key within range of 2^50, 2^20,, it is not finding it....
I used it by giving it command like this /python kangaroo.py 00008:000ffffff 02049370a4b5f43412ea25f514e8ecdad05266115e4a7ecb1387231808f8b45963

[zahid888]

1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9
1BY8GQbnuCGCrLSyVKrBRifBcKorgecti9  75DDD2BF608B880CD

739437bb3dd6d1983e66629c5f08c70e52769371
739437bb3dd457d75097490cb0b70d38054d6509

Until any other option becomes visible, it may be necessary for me to resort to such foolishness.

[BTC_Backdoor]

Is there any python script for BSGS or Kangaroo algorithm to search with bit range of 2^80???

This one is not working, I tested it. https://github.com/Telariust/pollard-kangaroo/blob/master/pollard-kangaroo.py

[7isce]

Is there any python script for BSGS or Kangaroo algorithm to search with bit range of 2^80???

This one is not working, I tested it. https://github.com/Telariust/pollard-kangaroo/blob/master/pollard-kangaroo.py

Check this https://github.com/iceland2k14/kangaroo

[BTC_Backdoor]

Is there any python script for BSGS or Kangaroo algorithm to search with bit range of 2^80???

This one is not working, I tested it. https://github.com/Telariust/pollard-kangaroo/blob/master/pollard-kangaroo.py

Check this https://github.com/iceland2k14/kangaroo

Bro thanks for replying, can you pl tell me How to run it in cmd with my particular range & pub key, plus can it take multiple pubkeys at a time, all within same range of 2^80??

[Andzhig]

who is fast in programming, try to make such an analysis.

for example rmd160 puzzle 66 like this

13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so 20d45a6a762535700ce9e0b216e31994335db8a5
0010000011010100010110100110101001110110001001010011010101110000000011001110100 1111000001011001000010110111000110001100110010100001100110101110110111000101001 01 160 len

"1" 73, "0" 87

according to this criterion

160!/73!/87!
50039953558241343191231898620403129563706328000

50039953558241343191231898620403129563706328000/2^65 1356335658972975302954605575

2^160/50039953558241343191231898620403129563706328000 29
2^65/29 1272189246462727697

2^65/2^20 35184372088832

2^160/2^65 39614081257132168796771975168
50039953558241343191231898620403129563706328000/39614081257132168796771975168  1263186017957493013   \
                                                                                           35184372088832×35968 1265511495291109376     > 2^60-2^61  
                                                                                                                 2^65/29 1272189246462727697   /

for every 1048576 step of puzzle 66, will fall around ~36000 "1" 73, "0" 87 and if we add fishing on the first 20 bits (for example)
001000001101010001011010011010100111011000100101001101010111000000001100111010011110000010110010000 1011011100011000110011001010000110011010111011011100010100101

then, based on the probability of dropping 20 bits, you need 1048576 outcomes

1048576/36000 29

1048576 × 30 31457280
1048576 × 29 30408704  there will be only 1 00100000110101000101 "1" 73, "0" 87
1048576 × 28 29360128

what is a full turn for example by 3

001
100
010

010
100
001

100
001
010

there may be such

100
100
001

001
001
001

etc

but in theory, when hashing, the data is simply shuffled, that is, rotated

this means that 20 bits (1048576  steps) in the first 00100000110101000101 will simply move to another place in the second (1048576  steps), third (1048576  steps), etc.

1048576×1048576 = 1099511627776 1 twist

2^65/1048576 = 35184372088832

35184372088832/1099511627776 32 twists for all puzzle 66


1048576×32 = 33554432 (there will be only 1 00100000110101000101 "1" 73, "0" 87)

2^65/33554432 = 1099511627776

all puzzle be

33554432 steps by 1099511627776 len or

1099511627776 steps by 33554432 len  

during the analysis, 1-3 drops out on such steps

we can rotate this space as we like, even take a square

6074001000
6074001000

imagine that we fill with zeros those addresses that do not suit us according to the sorting criterion and mark 1 those that do

we will get a similar picture

000001000001000100000000000000000001000000100000000000000001
001000000000000010000000000110000000000000000100000000100000
etc...

if we take another piece of 20 bits from the address, it will behave similarly

11011011100010100101

so these pieces will jump around the whole puzzle according to the random distribution and in total, as I wrote above, there will be 32 full turns

the idea is to take and randomly generate all possible collisions

select statistics from the puzzle space and try to jump by sorting the template


2^10*2^10                                                           divide to state 2^10, abbreviated example  2^65/33554432 = 1099511627776 (33554432  can be divided into 1024 parts)

001 010                                                                      000 000    <  000000000000000000000000000000000000001000000000000100000000000000  33554432 step
100 100                                                                      000 000    <  000000000000000000000000000000000000010000000000000000000000000001  33554432 step
010 001                                                                      000 000    <  000000000000000000000001000000100000000000000000000000000000000000  33554432 step