Author

Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 282. (Read 230098 times)

newbie
Activity: 7
Merit: 0
This puzzle is very strange. If it's for measuring the world's brute forcing capacity, 161-256 are just a waste (RIPEMD160 entropy is filled by 160, and by all of P2PKH Bitcoin). The puzzle creator could improve the puzzle's utility without bringing in any extra funds from outside - just spend 161-256 across to the unsolved portion 51-160, and roughly treble the puzzle's content density.

If on the other hand there's a pattern to find... well... that's awfully open-ended... can we have a hint or two? Cheesy

I am the creator.

You are quite right, 161-256 are silly.  I honestly just did not think of this.  What is especially embarrassing, is this did not occur to me once, in two years.  By way of excuse, I was not really thinking much about the puzzle at all.

I will make up for two years of stupidity.  I will spend from 161-256 to the unsolved parts, as you suggest.  In addition, I intend to add further funds.  My aim is to boost the density by a factor of 10, from 0.001*length(key) to 0.01*length(key).  Probably in the next few weeks.  At any rate, when I next have an extended period of quiet and calm, to construct the new transaction carefully.

A few words about the puzzle.  There is no pattern.  It is just consecutive keys from a deterministic wallet (masked with leading 000...0001 to set difficulty).  It is simply a crude measuring instrument, of the cracking strength of the community.

Finally, I wish to express appreciation of the efforts of all developers of new cracking tools and technology.  The "large bitcoin collider" is especially innovative and interesting!

Just a reminder for those who joined us here lately ...

This guy, saatoshi_rising, is certainly the creator since he moved the range  161-256 as promised on July 11th 2017
 

Thnx, by the way has anyone tried using AWS for this?
member
Activity: 245
Merit: 17
This puzzle is very strange. If it's for measuring the world's brute forcing capacity, 161-256 are just a waste (RIPEMD160 entropy is filled by 160, and by all of P2PKH Bitcoin). The puzzle creator could improve the puzzle's utility without bringing in any extra funds from outside - just spend 161-256 across to the unsolved portion 51-160, and roughly treble the puzzle's content density.

If on the other hand there's a pattern to find... well... that's awfully open-ended... can we have a hint or two? Cheesy

I am the creator.

You are quite right, 161-256 are silly.  I honestly just did not think of this.  What is especially embarrassing, is this did not occur to me once, in two years.  By way of excuse, I was not really thinking much about the puzzle at all.

I will make up for two years of stupidity.  I will spend from 161-256 to the unsolved parts, as you suggest.  In addition, I intend to add further funds.  My aim is to boost the density by a factor of 10, from 0.001*length(key) to 0.01*length(key).  Probably in the next few weeks.  At any rate, when I next have an extended period of quiet and calm, to construct the new transaction carefully.

A few words about the puzzle.  There is no pattern.  It is just consecutive keys from a deterministic wallet (masked with leading 000...0001 to set difficulty).  It is simply a crude measuring instrument, of the cracking strength of the community.

Finally, I wish to express appreciation of the efforts of all developers of new cracking tools and technology.  The "large bitcoin collider" is especially innovative and interesting!

Just a reminder for those who joined us here lately ...

This guy, saatoshi_rising, is certainly the creator since he moved the range  161-256 as promised on July 11th 2017
 
newbie
Activity: 7
Merit: 0
I've got a question.
Are we sure that the numbers are 100% random? I mean can there be a way of predicting exactly what the next key is or just it's range of values?

Yes. The numbers are 100% random.
This knowledge comes directly from the creator.
Does that mean that even predicting the region in 2^n is considered luck or is there a pattern in region changes?

This is known ... Each subsequent address is in the range of one higher than the previous one, i.e. if address # 58 was in 2 ^ 57 then # 59 is in 2 ^ 58. This is the only rule that takes place here and also comes from the creator.
So it's not really a puzzle, just a race. Making a pool would speed things up but then dividing the prize would be a problem, ok got it
full member
Activity: 282
Merit: 114
I've got a question.
Are we sure that the numbers are 100% random? I mean can there be a way of predicting exactly what the next key is or just it's range of values?

Yes. The numbers are 100% random.
This knowledge comes directly from the creator.
Does that mean that even predicting the region in 2^n is considered luck or is there a pattern in region changes?

This is known ... Each subsequent address is in the range of one higher than the previous one, i.e. if address #58 was in 2 ^ 57 then #59 is in 2 ^ 58.
2^n-1
n = number of wallet in this puzzles. (now the lowest prize is in #62)
This is the only rule that takes place here and also comes from the creator.
newbie
Activity: 7
Merit: 0
I've got a question.
Are we sure that the numbers are 100% random? I mean can there be a way of predicting exactly what the next key is or just it's range of values?

Yes. The numbers are 100% random.
This knowledge comes directly from the creator.
Does that mean that even predicting the region in 2^n is considered luck or is there a pattern in region changes?
full member
Activity: 282
Merit: 114
I've got a question.
Are we sure that the numbers are 100% random? I mean can there be a way of predicting exactly what the next key is or just it's range of values?

Yes. The numbers are 100% random.
This knowledge comes directly from the creator.
newbie
Activity: 7
Merit: 0
I've got a question.
Are we sure that the numbers are 100% random? I mean can there be a way of predicting exactly what the next key is or just it's range of values?
member
Activity: 174
Merit: 12
Can someone calculate 60-63% key range for 62 bit key?

If full range 62 key:
Hex: 0x2000000000000000 - 0x3FFFFFFFFFFFFFFF
Dec: 2305843009213693952 - 4611686018427387903

that:
2305843009213693952 + 60% = 3689348814741910528  0x3333333333333400
2305843009213693952 + 63% = 3758524105018320896  0x3428F5C28F5C2800

0x3333333333333400 - 0x3428F5C28F5C2800

Yes or no?

/translated google/
jr. member
Activity: 59
Merit: 3

Interesting observation. I wonder if it's related to the method the puzzle creator used to create the keys:

There is no pattern.  It is just consecutive keys from a deterministic wallet (masked with leading 000...0001 to set difficulty)
IMHO I think it is. Even if the creator of the puzzle didn't do it purposly the software he used most probably was adjusted to generate the most complicated keys within the each given range.
Sorry, but I think your math is actually wrong. You are using the range 1..2^bit to calculate the occurrence in the range, but you should be using the range 1..(2^bit - 2^(bit-1)). That would explain why all your results are occurring at > 50% of the range.
Ok. For example #60
60 | 0xFC07A1825367BBE | 1Kn5h2qpgw9mWE5jKpk8PP4qvvJ1QVy8su | 1152921504606846975 | 98.5% | 1135041350219496382
1135041350219496382 is how many percents out of full range 1152921504606846975 under your calcs?
I was also wrong on part of my response. The range I stated (1..(2^bit - 2^(bit-1))) is the right cardinality (number of values), but the values given by that range are wrong. The range should be 2^(bit-1) .. 2^bit.

Not completely sure about the math, but I think the percentile for bit 60 using this range is
Code:
(1135041350219496382 - 2^59) / 2^60 = .48 = 48%
I've got your point, man. You mean the position of the hit number within the range 59->60. I was calculation the position of the hit number within the full range between 0->60.
Anyhow, both of this way maybe usefull to find any dependencies between the hit numbers. This is actually what I'm doing, I'm searching any common, let's call it coefficient, that can be used to narrow the search range for the hit number.
I understand that creator mentioned already that numbers were generated randomly, but I wanna try )). I believe that if any software was used to get this numbers there was definetly an algorythm used.
sr. member
Activity: 459
Merit: 251
Can someone calculate 60-63% key range for 62 bit key?
newbie
Activity: 18
Merit: 1
member
Activity: 255
Merit: 27
2Babi Ngetot Try calculate not real privat key. Example pkey+1, pkey+2, pkey+3 and etc.
jr. member
Activity: 57
Merit: 1
#bitcoin
I think , I have little clue about all this bitcoin wallet

First:
 I try use formula x/2^n

Which means  "n"= the key must be start
                    "x" = the private key

Example for key wallet 60= fc07a1825367bbe->to decimal(1135041350219496382)
                                     =1135041350219496382/2^n
                                     =1135041350219496382/576460752303423488
                                     =1.9689828764301732198782612925924695446155965328216552734375

from there maybe 75 or 25 means some thing about next wallet or how much number length need Smiley

60. 1.9689828764301732198782612925924695446155965328216552734375    (800000000000000~FFFFFFFFFFFFFFF)
59. 1.8217038442259546014712068284779888927005231380462646484375    (400000000000000~7FFFFFFFFFFFFFF)
58. 1.387616882344719700104196391521327313967049121856689453125      (200000000000000~3FFFFFFFFFFFFFF)
57. 1.918545307495002238962200635796762071549892425537109375           (100000000000000~1FFFFFFFFFFFFFF)
56. 1.2273166453323929026009153631093795411288738250732421875         (80000000000000~FFFFFFFFFFFFFF)
55. 1.6678542153963615835010614318889565765857696533203125              (40000000000000~7FFFFFFFFFFFFF)
54. 1.10738698705333893368418785030371509492397308349609375            (20000000000000~3FFFFFFFFFFFFF)
53. 1.50183953528462676985100188176147639751434326171875                 (10000000000000~1FFFFFFFFFFFFF)
52. 1.8725002169265092533123606699518859386444091796875                   (8000000000000~FFFFFFFFFFFFF)
51. 1.828554654496162612531406921334564685821533203125                     (4000000000000~7FFFFFFFFFFFF)
50. 1.08560360020207014031257131136953830718994140625                       (2000000000000~3FFFFFFFFFFFF)
49. 1.453482330164934666072440450079739093780517578125                     (1000000000000~1FFFFFFFFFFFF)
48. 1.35860726900065031941267079673707485198974609375                       (800000000000~FFFFFFFFFFFF)
47. 1.700565506925073577804141677916049957275390625                          (400000000000~7FFFFFFFFFFF)
46. 1.4611222908516765528474934399127960205078125                             (200000000000~3FFFFFFFFFFF)
45. 1.13666732696611916253459639847278594970703125                           (100000000000~1FFFFFFFFFFF)
44. 1.7513186500162873926456086337566375732421875                             (80000000000~FFFFFFFFFFF)
43. 1.684795972283836817950941622257232666015625                               (40000000000~7FFFFFFFFFF)
42. 1.31666390755663087475113570690155029296875                                 (20000000000~3FFFFFFFFFF)
41. 1.3262726544298857334069907665252685546875                                   (10000000000~1FFFFFFFFFF)
40. 1.82563128500987659208476543426513671875                                      (8000000000~FFFFFFFFFF)
39. 1.17770457631922909058630466461181640625                                      (4000000000~7FFFFFFFFF)
38. 1.069358670734800398349761962890625                                               (2000000000~3FFFFFFFFF)
37. 1.458852211289922706782817840576171875                                         (1000000000~1FFFFFFFFF)
36. 1.233646470936946570873260498046875                                              (800000000~FFFFFFFFF)
35. 1.170723221264779567718505859375                                                   (400000000~7FFFFFFFF)
34. 1.645306143560446798801422119140625                                              (200000000~3FFFFFFFF)
33. 1.66181426309049129486083984375                                                     (100000000~1FFFFFFFF)
32. 1.440510532818734645843505859375                                                 (80000000~FFFFFFFF)
31. 1.958001918159425258636474609375                                                (40000000~7FFFFFFF)
30. 1.924414344131946563720703125                                                       (20000000~3FFFFFFF)
29. 1.492756955325603485107421875                                                       (10000000~1FFFFFFF)
28. 1.696008503437042236328125                                                               (8000000~FFFFFFF)
27. 1.66818411648273468017578125                                                            (4000000~7FFFFFF)
26. 1.625384747982025146484375                                                              (2000000~3FFFFFF)
25. 1.978010475635528564453125                                                              (1000000~1FFFFFF)
24. 1.720032215118408203125                                                                       (800000~FFFFFF)
23. 1.334858417510986328125                                                                        (400000~7FFFFF)
22. 1.434089183807373046875                                                                         (200000~3FFFFF)
21. 1.727832794189453125                                                                             (100000~1FFFFF)
20. 1.6466464996337890625                                                                           (80000~FFFFF)
19. 1.363887786865234375                                                                           (40000~7FFFF)
18. 1.51572418212890625                                                                            (20000~3FFFF)
17. 1.4621429443359375                                                                            (10000~1FFFF)
16. 1.57196044921875                                                                                  (8000~FFFF)
15. 1.63983154296875                                                                                 (4000~7FFF)
14. 1.287109375                                                                                     (2000~3FFF)
13. 1.2734375                                                                                       (1000~1FFF)
12. 1.31005859375                                                                                  (800~FFF)
11. 1.1279296875                                                                             (400~7FF)
10. 1.00390625                                                                              (200~3FF)
9.   1.82421875                                                                             (100~1FF)
8.   1.75                                                                                       (80~FF)
7.   1.1875                                                                                     (40~7F)
6.   1.53125                                                                                    (20~3F)
5.   1.3125                                                                                  (10~1F)
4.   1                                                                                     (8~F)

Let me know if you know some thing Huh
legendary
Activity: 3808
Merit: 1723
Taking into account probability, you are better off starting the search from the middle of the range and spreading it outwards, however its not always the case.

2 Years ago when I tried to find #54 or #55, I tried it the same way and basically eventually gave up because ETH/ZEC mining was more profitable and when the key was finally found (by LBC if I recall) it was somewhere towards the end of the range, so I would of most likely never found it anyways.

Best would of been some type of pool for this, where if the key is found its equally distributed for all the shares submitted.
newbie
Activity: 22
Merit: 2

Interesting observation. I wonder if it's related to the method the puzzle creator used to create the keys:

There is no pattern.  It is just consecutive keys from a deterministic wallet (masked with leading 000...0001 to set difficulty)
IMHO I think it is. Even if the creator of the puzzle didn't do it purposly the software he used most probably was adjusted to generate the most complicated keys within the each given range.
Sorry, but I think your math is actually wrong. You are using the range 1..2^bit to calculate the occurrence in the range, but you should be using the range 1..(2^bit - 2^(bit-1)). That would explain why all your results are occurring at > 50% of the range.
Ok. For example #60
60 | 0xFC07A1825367BBE | 1Kn5h2qpgw9mWE5jKpk8PP4qvvJ1QVy8su | 1152921504606846975 | 98.5% | 1135041350219496382
1135041350219496382 is how many percents out of full range 1152921504606846975 under your calcs?
I was also wrong on part of my response. The range I stated (1..(2^bit - 2^(bit-1))) is the right cardinality (number of values), but the values given by that range are wrong. The range should be 2^(bit-1) .. 2^bit.

Not completely sure about the math, but I think the percentile for bit 60 using this range is
Code:
(1135041350219496382 - 2^59) / 2^60 = .48 = 48%
jr. member
Activity: 59
Merit: 3

Interesting observation. I wonder if it's related to the method the puzzle creator used to create the keys:

There is no pattern.  It is just consecutive keys from a deterministic wallet (masked with leading 000...0001 to set difficulty)
IMHO I think it is. Even if the creator of the puzzle didn't do it purposly the software he used most probably was adjusted to generate the most complicated keys within the each given range.
Sorry, but I think your math is actually wrong. You are using the range 1..2^bit to calculate the occurrence in the range, but you should be using the range 1..(2^bit - 2^(bit-1)). That would explain why all your results are occurring at > 50% of the range.
Ok. For example #60
60 | 0xFC07A1825367BBE | 1Kn5h2qpgw9mWE5jKpk8PP4qvvJ1QVy8su | 1152921504606846975 | 98.5% | 1135041350219496382
1135041350219496382 is how many percents out of full range 1152921504606846975 under your calcs?
newbie
Activity: 22
Merit: 2

Interesting observation. I wonder if it's related to the method the puzzle creator used to create the keys:

There is no pattern.  It is just consecutive keys from a deterministic wallet (masked with leading 000...0001 to set difficulty)
IMHO I think it is. Even if the creator of the puzzle didn't do it purposly the software he used most probably was adjusted to generate the most complicated keys within the each given range.
Sorry, but I think your math is actually wrong. You are using the range 1..2^bit to calculate the occurrence in the range, but you should be using the range 1..(2^bit - 2^(bit-1)). That would explain why all your results are occurring at > 50% of the range.
jr. member
Activity: 59
Merit: 3

Interesting observation. I wonder if it's related to the method the puzzle creator used to create the keys:

There is no pattern.  It is just consecutive keys from a deterministic wallet (masked with leading 000...0001 to set difficulty)
IMHO I think it is. Even if the creator of the puzzle didn't do it purposly the software he used most probably was adjusted to generate the most complicated keys within the each given range.
newbie
Activity: 22
Merit: 2
If you do an analisys you will see that all found keys are over 50% of it's range (see here), hence I would say that you can skip the first half and search between 51%-99%.

Interesting observation. I wonder if it's related to the method the puzzle creator used to create the keys:

There is no pattern.  It is just consecutive keys from a deterministic wallet (masked with leading 000...0001 to set difficulty)
jr. member
Activity: 59
Merit: 3
this interval has been checked

Ok. Then You should write checked not check.

What is the full range for 62 bit key?

Hex: 0x2000000000000000 - 0x3FFFFFFFFFFFFFFF
Dec: 2305843009213693952 - 4611686018427387903

If you do an analisys you will see that all found keys are over 50% of it's range (see here), hence I would say that you can skip the first half and search between 51%-99%.
Jump to: