Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 185. (Read 215360 times)
Guys, I hope you are all doing great!
Can anyone please refer some python script that can apply point halving on public keys and calculates its half?
https://bitcointalksearch.org/topic/half-of-any-bitcoin-crypto-public-key-public-key-half-4455904
Here it is explained but there is no python script there that can calculate it by taking the public key in question
Can anyone please refer some python script that can apply point halving on public keys and calculates its half?
https://bitcointalksearch.org/topic/half-of-any-bitcoin-crypto-public-key-public-key-half-4455904
Here it is explained but there is no python script there that can calculate it by taking the public key in question
======================================
Matching Characters: 10
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^^ ^
13zb1hQbWxg82eQtkF3pF9HFYTF3KjUj14 3BCF540CE40D82701
^^^^^^^^^ ^
======================================
Is output of wich programm?
How do I set the spacing in bgs mode for puzzle 125?. I think the following is not correct, I would appreciate it if you could give me an example. thanks
/keyhunt -m bsgs -f 125.pub -b -r 15000000000000000000000000000000:16000000000000000000000000000000 -q -S -n 0x400000000 -k 4096 -t 7
you will run it without -b command -b is for bits range
/keyhunt -m bsgs -f 125.pub -r 15000000000000000000000000000000:16000000000000000000000000000000 -q -S -n 0x400000000 -k 4096 -t 7
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
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[+] 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
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
How do I set the spacing in bgs mode for puzzle 125?. I think the following is not correct, I would appreciate it if you could give me an example. thanks
/keyhunt -m bsgs -f 125.pub -b -r 15000000000000000000000000000000:16000000000000000000000000000000 -q -S -n 0x400000000 -k 4096 -t 7
======================================
Matching Characters: 10
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^^
13zb1hQbe4NbYTWQqNSZ5PkXbdNhJVeH4K 24C4A7D65296C748E
^^^^^^^^ ^^
Even one bit different in the RMD hash is enough to invalidate the key ..
I am aware of this fact, but what else can be done? We rely on people like you to come up with new innovations quickly and give us the opportunity to utilize them. I request to all of you please make the function of keyspace and stride available in vanitygen, similar to bitcrack. This is one of my greatest desires.
https://blockchain.info/q/addrpubkey/02000000000000000000000000000000000000000000000000000000000201e830
======================================
Matching Characters: 5
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^
13zb1qHynbVPYHn2HYk5rWpf6TZqPGmZ1Y 0200000000000000000000000000000000000000000000000000000000005848b1
^^^^^
======================================
Matching Characters: 6
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^ ^
13zb1znTdapNDF4umczv2tRvAT2iLH9cin 020000000000000000000000000000000000000000000000000000000001850992
^^^^^ ^
======================================
Matching Characters: 5
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^
13zb1Yf3wgF5aKLVjJdSWFD9QjUxVssyM9 020000000000000000000000000000000000000000000000000000000001ec5ba5
^^^^^
======================================
Matching Characters: 5
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^
13zb1bHsPcNEXQC1B5tnyyCwmi5PHoqM3M 02000000000000000000000000000000000000000000000000000000000201e830
^^^^^
======================================
Matching Characters: 6
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^ ^
13zb12mnyMCm5RUPGX3EaenA9TQNc1MdVm 0200000000000000000000000000000000000000000000000000000000022a6a48
^^^^^ ^
======================================
Please few words about this as well.
======================================
Matching Characters: 10
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^^
13zb1hQbe4NbYTWQqNSZ5PkXbdNhJVeH4K 24C4A7D65296C748E
^^^^^^^^ ^^
Matching Characters: 10
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^^
13zb1hQbe4NbYTWQqNSZ5PkXbdNhJVeH4K 24C4A7D65296C748E
^^^^^^^^ ^^
Even one bit different in the RMD hash is enough to invalidate the key ..
======================================
Matching Characters: 10
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^^
13zb1hQbe4NbYTWQqNSZ5PkXbdNhJVeH4K 24C4A7D65296C748E
^^^^^^^^ ^^
======================================
Matching Characters: 10
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^ ^
13zb1hQburGURfVMWxS5tGLxrZjfrJT5GX 2FF7ACD7D429A7A14
^^^^^^^^ ^ ^
======================================
Matching Characters: 10
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^ ^
13zb1hQb94my9LnrwPnXypwChnv6K6xVTo 35474E1920566656F
^^^^^^^^ ^ ^
======================================
Matching Characters: 10
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^ ^
13zb1hQb3BkU3D5XxW8y5b4mnNT94nJDK1 30E2D02C0BD703627
^^^^^^^^ ^ ^
======================================
Matching Characters: 10
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^ ^
13zb1hQbRXvkTa7QZiycsWg8HzPNsjCC5Z 3002143F43C981236
^^^^^^^^ ^ ^
======================================
Matching Characters: 10
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^ ^
13zb1hQbEaQBuu9F793aZrvvNhTkuahrsF 339720F1C10BAE5E8
^^^^^^^^ ^ ^
======================================
Matching Characters: 10
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^ ^
13zb1hQb2JSd7SDKktucxt4TB4sEvhQYHX 3FAA492FC9F13EC0
^^^^^^^^ ^ ^
======================================
Matching Characters: 10
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^^ ^
13zb1hQbWxg82eQtkF3pF9HFYTF3KjUj14 3BCF540CE40D82701
^^^^^^^^^ ^
======================================
Matching Characters: 10
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^ ^
13zb1hQbuw4cXoSN3EjsQ3qcn7JmvjRAa2 39DD099BCC24E6C4C
^^^^^^^^ ^ ^
======================================
Matching Characters: 10
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^ ^
13zb1hQbB5KWrSmqBR9PpPcMY4Jpu65pmg 266EC832D5EF08236
^^^^^^^^ ^ ^
======================================
Matching Characters: 10
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^^
13zb1hQbVjBe4UMZTK1bR6vGY23ZD8kp3C 2D71D594B86504F49
^^^^^^^^ ^^
======================================
Matching Characters: 10
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^ ^
13zb1hQbbmoxD9p7qjNyV85SnEewkhBis6 2A97F4263CF3F1FD4
^^^^^^^^ ^ ^
======================================
Matching Characters: 10
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^ ^
13zb1hQbeLxc7Yx6dQHopqJojtF9SNj5iX 36D3CFEB258649ED8
^^^^^^^^ ^ ^
======================================
Matching Characters: 10
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^ ^
13zb1hQbeVgf3idhKEfu7pWuCokhNrFLaF 274FEC17CDC624E35
^^^^^^^^ ^ ^
======================================
Matching Characters: 10
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^ ^
13zb1hQbfzuMtUSAtKFy6s3FFdB1nfojsx 2CD78B396AE84B4B6
^^^^^^^^ ^ ^
======================================
Matching Characters: 10
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^ ^
13zb1hQbtFFW8xXSeKfNNG5EgKtQpnJvAm 31FEE8C6C6EB346F2
^^^^^^^^ ^ ^
======================================
Matching Characters: 10
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^ ^
13zb1hQbyTPAfAN1vE8D2zmE5jebjdppDQ 29B0F235D4DD15DD8
^^^^^^^^ ^ ^
======================================
Matching Characters: 10
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^^ ^
13zb1hQbWZh8mryz1tMxekhGxdatvvvRpQ 31E486C3DF77436AF
^^^^^^^^^ ^
======================================
Matching Characters: 10
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^ ^
13zb1hQbsmPdhRW96oSi5XTuubTNNeJ2F7 2AB9DDE82C5B6149F
^^^^^^^^ ^ ^
======================================
Matching Characters: 10
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^ ^
13zb1hQb1bpk4CBQFFzWar43nbk3WEnMFW 33B95D82B7BFA0631
^^^^^^^^ ^ ^
======================================
Matching Characters: 10
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^ ^
13zb1hQbZa8qYK9pKFPLUPq6YcdN5mPvSo 342DE8BAFBFABA3D2
^^^^^^^^ ^ ^
======================================
Matching Characters: 10
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^ ^
13zb1hQb7tTcubNdoydmWa3axcMN6LiWog 35C79445AB5FFEFBD
^^^^^^^^ ^ ^
======================================
Matching Characters: 10
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^ ^
13zb1hQb5VHs1yPNhsd8NxyjMdcYDFwPiY 45A18345A1F31785A
^^^^^^^^ ^ ^
======================================
Matching Characters: 10
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^ ^
13zb1hQbYo9n2yjo6XSQFJFbcqMrfqhtym 2F86E8CE6ECD84AD7
^^^^^^^^ ^ ^
======================================
Matching Characters: 11
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^ ^ ^
13zb1hQbkigrChdnmVnmXZ4trtM7M7S5Sg 2B13737149312FD7D
^^^^^^^^ ^ ^ ^
======================================
Matching Characters: 11
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^ ^ ^
13zb1hQbZHisJpqcL2fUuZquijPNiZhoAU 360849152ED01FE94
^^^^^^^^ ^ ^ ^
======================================
Matching Characters: 11
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^ ^ ^
13zb1hQbsnsfnoW6TX21Uvy6ZkHYeNiPsR 39C354B605CB48F58
^^^^^^^^ ^ ^ ^
======================================
Matching Characters: 12
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^^^ ^ ^
13zb1hQbWVi8cYnLyEus3LFucU535Bm52s 345CCB1B178168878
^^^^^^^^^^ ^ ^
======================================
Matching Characters: 12
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
^^^^^^^^ ^ ^ ^^
13zb1hQbf1Y2MYyQ4JUUFY4SzdF6ZXcXso 3E45C441A00B8CFBF
^^^^^^^^ ^ ^ ^^
yes go to github https://github.com/iceland2k14/quick download quick or just pubdiv.py instructions on page are very clear how to.
so to reduce 2 you need to generate 2 power 2, 4 keyspaces 2 power 4 etc
Power Value
0 1
1 2
2 4
3 8
4 16
5 32
6 64
7 128
8 256
9 512
10 1,024
11 2,048
12 4,096
13 8,192
14 16,384
15 32,768
16 65,536
17 131,072
18 262,144
19 524,288
20 1,048,576
21 2,097,152
22 4,194,304
23 8,388,608
24 16,777,216
25 33,554,432
26 67,108,864
27 134,217,728
28 268,435,456
29 536,870,912
30 1,073,741,824
31 2,147,483,648
32 4,294,967,296
33 8,589,934,592
34 17,179,869,184
35 34,359,738,368
36 68,719,476,736
37 137,438,953,472
38 274,877,906,944
39 549,755,813,888
40 1,099,511,627,776
41 2,199,023,255,552
42 4,398,046,511,104
43 8,796,093,022,208
44 17,592,186,044,416
45 35,184,372,088,832
46 70,368,744,177,664
47 140,737,488,355,328
48 281,474,976,710,656
49 562,949,953,421,312
50 1,125,899,906,842,624
so to reduce 2 you need to generate 2 power 2, 4 keyspaces 2 power 4 etc
Power Value
0 1
1 2
2 4
3 8
4 16
5 32
6 64
7 128
8 256
9 512
10 1,024
11 2,048
12 4,096
13 8,192
14 16,384
15 32,768
16 65,536
17 131,072
18 262,144
19 524,288
20 1,048,576
21 2,097,152
22 4,194,304
23 8,388,608
24 16,777,216
25 33,554,432
26 67,108,864
27 134,217,728
28 268,435,456
29 536,870,912
30 1,073,741,824
31 2,147,483,648
32 4,294,967,296
33 8,589,934,592
34 17,179,869,184
35 34,359,738,368
36 68,719,476,736
37 137,438,953,472
38 274,877,906,944
39 549,755,813,888
40 1,099,511,627,776
41 2,199,023,255,552
42 4,398,046,511,104
43 8,796,093,022,208
44 17,592,186,044,416
45 35,184,372,088,832
46 70,368,744,177,664
47 140,737,488,355,328
48 281,474,976,710,656
49 562,949,953,421,312
50 1,125,899,906,842,624
If he has such a script 125 would be gone at 75 which can be done by kangaroo or bsgs in an hour or less. of course you can reduce by 50 keyspaces with pubdiv.py it is just you need to generate 1,125,899,906,842,624 keys which should take a year to generate
Good afternoon! Can you please elaborate - what is it pubdiv.py ? How it works? maybe a link or something?
If he has such a script 125 would be gone at 75 which can be done by kangaroo or bsgs in an hour or less. of course you can reduce by 50 keyspaces with pubdiv.py it is just you need to generate 1,125,899,906,842,624 keys which should take a year to generate
I wrote a 190 line algorithm using python this morning. It reduces private keys in high bits to the range I want. For example, I reduced the 80-bit pubkey to 31-bit, this took 3 seconds and it took me 0 seconds to find it with bsgs. It found it while opening the program. My algorithm seems to be working. Just for mathematics, this is mathematics, I have been following this forum for 1 year and read articles on secp256k1 and tried to understand, then a month ago, lightning flashed in my head and I thought about the algorithm until today, finally I decided to write, as you said, faith moves mountains. I think bitcoin is not secure. 
you are the hero of the day. The forum has been waiting for its messiah and finally you are here. Satoshi is already trembling. Thank you for this enlightment.Yes, yes, yes))) I am also a prophet!!! I even know how the new messiah will save us all!!! He will sell us a magic script for 1000 bitcoins - at a price of $ 100)))
What you should know, I believe Satoshi placed the keys at least in 50% + of each range, which makes solving them counterproductive financially.
Faith will move mountains, but knowledge will move them faster. The keys position within its range are randomly. You can proof yourself, just check the keys and calculate its position. That's no rocket science. Hint: look at puzzle 25, 31, 60, 63 to get a feeling of what a high position is and puzzles 38, 50, 85 to understand what a low position means
There is no "narrowing the search range solution" for this. You wouldn't have solve the mentioned puzzle otherwise. The key positions for the known keys of today for this puzzle vary from 0.069 (puzzle 38) to 0.97 (puzzle 60), while disregarding puzzles 1-10.Believe nothing, no matter where you read it, or who said it, no matter if I have said it, unless it agrees with your own reason and your own common sense.
I wrote a 190 line algorithm using python this morning. It reduces private keys in high bits to the range I want. For example, I reduced the 80-bit pubkey to 31-bit, this took 3 seconds and it took me 0 seconds to find it with bsgs. It found it while opening the program. My algorithm seems to be working. Just for mathematics, this is mathematics, I have been following this forum for 1 year and read articles on secp256k1 and tried to understand, then a month ago, lightning flashed in my head and I thought about the algorithm until today, finally I decided to write, as you said, faith moves mountains. I think bitcoin is not secure.
I wrote a 190 line algorithm using python this morning. It reduces private keys in high bits to the range I want. For example, I reduced the 80-bit pubkey to 31-bit, this took 3 seconds and it took me 0 seconds to find it with bsgs. It found it while opening the program. My algorithm seems to be working. Just for mathematics, this is mathematics, I have been following this forum for 1 year and read articles on secp256k1 and tried to understand, then a month ago, lightning flashed in my head and I thought about the algorithm until today, finally I decided to write, as you said, faith moves mountains. I think bitcoin is not secure.
you are the hero of the day. The forum has been waiting for its messiah and finally you are here. Satoshi is already trembling. Thank you for this enlightment. What you should know, I believe Satoshi placed the keys at least in 50% + of each range, which makes solving them counterproductive financially.
Faith will move mountains, but knowledge will move them faster. The keys position within its range are randomly. You can proof yourself, just check the keys and calculate its position. That's no rocket science. Hint: look at puzzle 25, 31, 60, 63 to get a feeling of what a high position is and puzzles 38, 50, 85 to understand what a low position means
There is no "narrowing the search range solution" for this. You wouldn't have solve the mentioned puzzle otherwise. The key positions for the known keys of today for this puzzle vary from 0.069 (puzzle 38) to 0.97 (puzzle 60), while disregarding puzzles 1-10.Believe nothing, no matter where you read it, or who said it, no matter if I have said it, unless it agrees with your own reason and your own common sense.
I wrote a 190 line algorithm using python this morning. It reduces private keys in high bits to the range I want. For example, I reduced the 80-bit pubkey to 31-bit, this took 3 seconds and it took me 0 seconds to find it with bsgs. It found it while opening the program. My algorithm seems to be working. Just for mathematics, this is mathematics, I have been following this forum for 1 year and read articles on secp256k1 and tried to understand, then a month ago, lightning flashed in my head and I thought about the algorithm until today, finally I decided to write, as you said, faith moves mountains. I think bitcoin is not secure.
@zahid888
My opinion on this puzzle creation main purpose is only to see how secure bitcoin private key, if key are less than 256 bits. specially 160 bits or less.
Creator himself have lots of bitcoin to run & refill this challenge.
There is no relation with random numbers to each others so far i can find.
Each time any random number is created its use entry op for his startup then use that as starting point to encrypt next one.
Your last post about thiery of startup seed is not valid for my point of view, it may land same number on low bit due to not having big ranges on lower bits, but it will not help on 32 bit or higher.
So far only hope for this puzzle still relays on bruteforce,BSGS,lattice attack etc. still need tools like keyhunt or more ideas. Pools are good idea still no perfect way to divide range or split range with active users etc.
ps:i like to say thank you to creator only this way public can see bitcoin private key even 160 bit random is not possible to break, so 256 bit is impossible.
My opinion on this puzzle creation main purpose is only to see how secure bitcoin private key, if key are less than 256 bits. specially 160 bits or less.
Creator himself have lots of bitcoin to run & refill this challenge.
There is no relation with random numbers to each others so far i can find.
Each time any random number is created its use entry op for his startup then use that as starting point to encrypt next one.
Your last post about thiery of startup seed is not valid for my point of view, it may land same number on low bit due to not having big ranges on lower bits, but it will not help on 32 bit or higher.
So far only hope for this puzzle still relays on bruteforce,BSGS,lattice attack etc. still need tools like keyhunt or more ideas. Pools are good idea still no perfect way to divide range or split range with active users etc.
ps:i like to say thank you to creator only this way public can see bitcoin private key even 160 bit random is not possible to break, so 256 bit is impossible.
I think when the creator increased the value of puzzle he was trying to give us some hint, by putting 0.09 bitcoin in puzzle1, maybe puzzle1's address or sha160 of the address or integer value of sha160 or its compressed or uncompressed Public's or public's integer, all this may be seed or there may be any relation with puzzle1, or there may be some conspiracy to mislead us.
That's just wishful thinking.The most sane reason he/they did is because the "community" already discussed that puzzle 66+ is already hard enough to be worthy of that prize.
Also, the creator (for some reason) tends to include puzzle #1 whenever he decided to increase the prize.
Like when he spent 161~256 and sent it to the previously unclaimed ranges, he included #1 to the recipient: 5d45587cfd1d5b0fb826805541da7d94c61fe432259e68ee26f4a04544384164
I think when the creator increased the value of puzzle he was trying to give us some hint, by putting 0.09 bitcoin in puzzle1, maybe puzzle1's address or sha160 of the address or integer value of sha160 or its compressed or uncompressed Public's or public's integer, all this may be seed or there may be any relation with puzzle1, or there may be some conspiracy to mislead us.
Without hints to the main key - only bruteforce!!! It's very sad!
What hint do you need more than having such amounts which are directly pointing to the exact bit range where the keys reside? It is a game and a test, we play this game and they use our feedback to analyze the system.Have you missed the recent movements and the signs of improving the old tools to make them faster?
If it wasn't for the latest prize increase, we'd be scratching our heads and using the old stuff without any serious improvements being done.
Don't sit around and wait for others to come up with a solution, try 50 methods, if all of them failed try 50 more, we never achieve anything in life if we stop trying when we hit a dead end, finding a way around it is the challenge and that should be entertaining to find without frustration, don't worry no one is going to collect all the puzzles any time soon, we have time and we need to focus without stressing ourselves.😉
what improvements - an example is possible? He is a brute force on the moon - a brute force, and in Antarctica)) it all depends on the power of the GPUs and how many of them there are! I'm not a laboratory rabbit Roger - to test meaningless ranges on me! There is a science of mathematics - it clearly shows - an unthinkable time!! And this is an unthinkable time - it does not depend on the size of the prize in any way!!!
Without hints to the main key - only bruteforce!!! It's very sad!
What hint do you need more than having such amounts which are directly pointing to the exact bit range where the keys reside? It is a game and a test, we play this game and they use our feedback to analyze the system.Have you missed the recent movements and the signs of improving the old tools to make them faster?
If it wasn't for the latest prize increase, we'd be scratching our heads and using the old stuff without any serious improvements being done.
Don't sit around and wait for others to come up with a solution, try 50 methods, if all of them failed try 50 more, we never achieve anything in life if we stop trying when we hit a dead end, finding a way around it is the challenge and that should be entertaining to find without frustration, don't worry no one is going to collect all the puzzles any time soon, we have time and we need to focus without stressing ourselves.😉
What you should know, I believe Satoshi placed the keys at least in 50% + of each range, which makes solving them counterproductive financially.
Faith will move mountains, but knowledge will move them faster. The keys position within its range are randomly. You can proof yourself, just check the keys and calculate its position. That's no rocket science. Hint: look at puzzle 25, 31, 60, 63 to get a feeling of what a high position is and puzzles 38, 50, 85 to understand what a low position means
There is no "narrowing the search range solution" for this. You wouldn't have solve the mentioned puzzle otherwise. The key positions for the known keys of today for this puzzle vary from 0.069 (puzzle 38) to 0.97 (puzzle 60), while disregarding puzzles 1-10.Believe nothing, no matter where you read it, or who said it, no matter if I have said it, unless it agrees with your own reason and your own common sense.
The creator said - these are deterministic addresses with keys that are truncated to the right bits! I think it's true! The keys have no dependency and no logic! Not only were they randomly generated, they were also cut off after that!!! No need to look for a black cat in a dark room - especially if it's not a cat there!!)) Without hints to the main key - only bruteforce!!! It's very sad!
Jump to: