what computational power does the puzzles 130 needed to be solved
if you have 56core/256GB server, you'll check about 12 exakeys per sec
2^129 / 11344588059320129643 / 3600*24 = ?
after 1_902_338_144_733 years AT MOST you'll become rich, but with this probability 1/680564733841876926926749214863536422912 you'll find PK in first second. Feel lucky? (haha)
p.s. if you pay $200 per month for server, you'll pay 1902338144733*200*12 = ?
4_565_611_547_359_200 dollars
so, it's only reasonable if you do not pay for server
this is true if you go through all the values without taking into account entropy.
Of course, if you try to generate a random number of 10 bits a billion times, you can get the number 0. But if you try to generate a random number of 66 bits, it becomes impossible to get the number 0. In this way, you need to ignore values that with the maximum probability could not be a private key.
For 10 bits and a billion random trials you'll get the number 0 around 976562 times, on average.
If we replace each possible value from 0 to 2**66 - 1 with some emoticon for a thing in the universe, what exactly makes 0 to be more special than some other value? The values are just labels, it makes zero sense to discriminate them. The only valid affirmation you have is that there is a 100% chance that some random value in some 2**66 set of elements is contained in the set. It doesn't matter how you look at them.
Also, it would be weird as well if somehow the maximum probability solution (some value with maximum entropy and with exactly 33 bits of zeros and 33 bits of ones, in some arrangement that has the least possible compression form) is the one that's correct. So, why not exclude stuff from the other end of this mindset as well? It's like: if you throw a coin in the air 100 times, chances are very low you'll get a 50/50, but still, these are the maximum chances as well.