There's the math comes again,
66 Bit puzzle
the total number of keys in this range can be calculated by taking 16 to the power of 17 (i.e., 16^17), which is equal to 295,147,905,179,352,825,856.
So, there are a total of 295,147,905,179,352,825,856 keys in the given range.
If you have a speed of 343 million keys per second (Mkeys/s), the result's,
Total number of keys = 295,147,905,179,352,825,856
Time = Total number of keys / Speed
Substituting the values, we get:
Time = 295,147,905,179,352,825,856 / 343,000,000
Time = 859,488,566,568 seconds
Therefore, it would take approximately 859,488,566,568 seconds (or about
27,247 years) to generate all the possible keys in the given range at a speed of 343 million keys per second. This is a very long time and may not be practically feasible.
what if i have 5000 mkeys to scan those number of key ?
it would take approximately 59,029,581,036 seconds (or about 1,872 years) to generate all the possible keys in the given range at a speed of 5000 million keys per second, still lame haha
and there's other scenario to win the ticket haha
For a 66-bit puzzle, the key range would be from 0 to 2^66 - 1, which is:
0 to 7,922,816,251,426,433
The number of keys in this range is:
2^66 = 73,786,976,294,838,206,464
At a scanning speed of 343 Mkey/s, the time it would take to scan this entire range would be:
Time = Number of Keys / Keys per Second
Time = (2^66) / 343000000 = 215625224 seconds
= 3593754 minutes
= 59896 hours
= 2495 days
≈ 6.84 years
So, it would take approximately 6.84 years to scan the entire key range of a 66-bit puzzle at the given scanning speed.
If we were to randomly hit the private key in the middle of the range, then we would only need to scan half of the key range, which is:
2^65 = 36,893,488,147,419,103,232
Using the same formula as above, the time it would take to scan half of the key range would be:
Time = (2^65) / 343000000 = 107812612 seconds
= 1796877 minutes
= 29948 hours
= 1248 days
≈ 3.42 years
So, if we randomly hit the private key in the middle of the key range, it would take approximately 3.42 years to scan half of the key range at the given speed of 343 Mkey/s.
btw, my close friend is neat, he's building something on ASICs L3+ to give a proof to scan the puzzle for mean time haha.
let's see..
Wrong, the entire range of puzz #66 contains 36.8 million trillion keys, half that range is obviously 18.44 million trillion keys.
Also the calc is misleading. With 1billion keys/sec, you need a little over 1000 years to scan the entire range sequentially.
