Author

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

member
Activity: 259
Merit: 47
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: 24
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: 24
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: 24
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%.
hero member
Activity: 583
Merit: 502
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
sr. member
Activity: 459
Merit: 251
this interval has been checked

Ok. Then You should write checked not check.

What is the full range for 62 bit key?
sr. member
Activity: 459
Merit: 251
check

2fafb10000000000 - 2fafb401562a3fff   62   1Me6EfpwZK5kQziBwBfvLiHjaPGxCKLoJi


Is not on this range. Try another one and write here so i try to see if i can find it.
newbie
Activity: 18
Merit: 1
check

2fafb10000000000 - 2fafb401562a3fff   62   1Me6EfpwZK5kQziBwBfvLiHjaPGxCKLoJi

how you sure, that #62 is on this range?
newbie
Activity: 18
Merit: 1
what are those hex keys bro ? and why you post it i don't understand? Cry Cry
legendary
Activity: 3808
Merit: 1723
Where can i buy VPS with Nvidia Tesla or any other good GPU and hourly plan?
Found parsecgaming . com but not sure if is working, anyone tested them, can i use BitCrack on their servers?

Thanks

Bro i advise you to stop wasting you money, for fast bucks ( puzzel ) because  the hashing power which is required to solve one piece is very big, with the money better buy shitcoins, or rennt hash power for mining. But if you know how to use baby step giant step algo just buy amazon server with big amount of ram and go on it Smiley  Also feel free to send me tip xD (just kidding)


So how we calculate specific hex range for 64 for example and the possible variatons of 64 is calculated  2^65 - 2^64 = right ?

Edit: Is it have someone who have for example all 22 bit adresses generated and checked for funds ? Maybe have more puzzels or adresses  in these ranges with funds ?



Interesting, what speed you have on what video card? I have rx560oc and reach only 50Mkey/s acording my calculation if you scan all 62 bit range is so much years. Are you scan small pieces of 62bit range or all ? Thanks


Edit: Sorry for my bad english,it isnt my native language.

Do you know what speed an RX 570 would get approx with Bitcrack? I had no idea it worked on AMD, assumed it was Nvidia only.

I remember when this thread first was opened, I was using vanitygen to find the next key, at the time it was #55 or so. I had to manually update the code so the increments wouldn't be randon instead it would be incremental. And finally got it to work.

With my R9 280X, the most I Could get was like 20MH/s, if I overclocked then I think I got 21MH/s. So its pretty impressive that your RX560 can get 50MH/s since it has much less cores than an actual RX 570.

Vanitygen was not a good program because it wasn't meant for searching incremental private keys, it was used to find vanity addresses instead. Bitcrack was more geared towards this thread. However it was released maybe a year or 2 after this thread was discovered and was too late for most of the earlier keys.


Wow you get with r9 280x 20mh or 20 Milion Keys/s . I dont think you can get only 20mkey/s thats pretty small try to play with -b and -t  - p parameters  try something like this  -b 32 - t 256 -p 1024 and post results. Also my list have only 255 adresses of the puzzel and use -c ( compressed mode) its seems when you put so much adresses the speed drops hard. Also update you amd drivers to last .

Offtopic: Someone who know VHDL here , please tell me is it possible fpga adoption of bitcrack algo ? And if it possible with Xilinx Virtex-7 FPGA VC707  what speed can get ?

It was 20 Million keys per second. But this wasn't this Kangaroo hop program or Bitcrack, this was just with Vanitygen.

Basically the R9 280 and R9 290 both got around 20MH/s, if you had another GPU however in the same rig, it ran at like 15MH/s, and if you had a 3rd GPU it ran at like 10MH/s. It was very buggy also and crashed alot.

Basically had to download the source myself and mod it and probably didn't do a good job. But even 2 years back, or when the 55 key was being solved, it was more profitable to mine ETH or ZEC so I just switched to that.
newbie
Activity: 6
Merit: 0
Where can i buy VPS with Nvidia Tesla or any other good GPU and hourly plan?
Found parsecgaming . com but not sure if is working, anyone tested them, can i use BitCrack on their servers?

Thanks

Bro i advise you to stop wasting you money, for fast bucks ( puzzel ) because  the hashing power which is required to solve one piece is very big, with the money better buy shitcoins, or rennt hash power for mining. But if you know how to use baby step giant step algo just buy amazon server with big amount of ram and go on it Smiley  Also feel free to send me tip xD (just kidding)


So how we calculate specific hex range for 64 for example and the possible variatons of 64 is calculated  2^65 - 2^64 = right ?

Edit: Is it have someone who have for example all 22 bit adresses generated and checked for funds ? Maybe have more puzzels or adresses  in these ranges with funds ?



Interesting, what speed you have on what video card? I have rx560oc and reach only 50Mkey/s acording my calculation if you scan all 62 bit range is so much years. Are you scan small pieces of 62bit range or all ? Thanks


Edit: Sorry for my bad english,it isnt my native language.

Do you know what speed an RX 570 would get approx with Bitcrack? I had no idea it worked on AMD, assumed it was Nvidia only.

I remember when this thread first was opened, I was using vanitygen to find the next key, at the time it was #55 or so. I had to manually update the code so the increments wouldn't be randon instead it would be incremental. And finally got it to work.

With my R9 280X, the most I Could get was like 20MH/s, if I overclocked then I think I got 21MH/s. So its pretty impressive that your RX560 can get 50MH/s since it has much less cores than an actual RX 570.

Vanitygen was not a good program because it wasn't meant for searching incremental private keys, it was used to find vanity addresses instead. Bitcrack was more geared towards this thread. However it was released maybe a year or 2 after this thread was discovered and was too late for most of the earlier keys.


Wow you get with r9 280x 20mh or 20 Milion Keys/s . I dont think you can get only 20mkey/s thats pretty small try to play with -b and -t  - p parameters  try something like this  -b 32 - t 256 -p 1024 and post results. Also my list have only 255 adresses of the puzzel and use -c ( compressed mode) its seems when you put so much adresses the speed drops hard. Also update you amd drivers to last .

Offtopic: Someone who know VHDL here , please tell me is it possible fpga adoption of bitcrack algo ? And if it possible with Xilinx Virtex-7 FPGA VC707  what speed can get ?
legendary
Activity: 3808
Merit: 1723
Where can i buy VPS with Nvidia Tesla or any other good GPU and hourly plan?
Found parsecgaming . com but not sure if is working, anyone tested them, can i use BitCrack on their servers?

Thanks
At amazon

But they allow this kind of activities also maybe google cloud? saw that i can install the drivers on amazon aws but they may request account verification, any other good option with windows and drivers already installed? Thank you

Last time I heard Google cloud doesn't like when you use their hardware for anything related to Crypto mining. Amazon AWS doesn't have issues neither does DigitalOcean.

However if you are a new account, you will be limited due to the issues they had in the past with fraud. So for a month or 2 there is a limit of how much servers you can rent. After a few months the limits go away, but you need to be verified because you need to pay by your credit card.
newbie
Activity: 24
Merit: 2
It's just a empty btc address, i'm sure nothing related to the puzzle
it's just another newbie begging
member
Activity: 259
Merit: 47
1CNX4yi8ceB3Yv1t9uG38s7Q8S68zVgyLR   
What is it?
puzzle  Grin Grin Grin
Realy puzzle qusteion. Guess what it is!  Grin Grin Grin

It's just a empty btc address, i'm sure nothing related to the puzzle
Prize in studio!!!!!  Grin Grin Grin
member
Activity: 259
Merit: 47
1CNX4yi8ceB3Yv1t9uG38s7Q8S68zVgyLR   
What is it?
puzzle  Grin Grin Grin
Realy puzzle qusteion. Guess what it is!  Grin Grin Grin
Jump to: