Bitcoin puzzle transaction ~32 BTC prize to who solves it

[BurtW]

Ten years ago, Satoshi and Craig created a website where just like that from donations distributed 5 bitcoins to all those in need,and now some 0.5 bitcoins would solve my almost all problems.
I join my friend and say if God in the world let him drip on my purse incentive prize for the promotion of cryptocurrency to the masses!!! 1HqqeH1VWDY9vJq8nF4C7BHQ3Yvzxak48V

Just so you know:  begging is not allowed on this forum and you can actually be banned for begging.  Not sure if this is begging but be careful.

[iparktur]

If I calculated everything correctly, then the space from 2000000000000001 to 4000000000000001 can be scanned
in about 545 years if the average key generation rate is about 134 Mkey / s

Confirm or disprove my calculations.

[Firebox]

If I calculated everything correctly, then the space from 2000000000000001 to 4000000000000001 can be scanned
in about 545 years if the average key generation rate is about 134 Mkey / s

Confirm or disprove my calculations.

Looks like something is wrong in your calculation.
I think should be like this:

134000000 keys/s * 60 sec * 60 min * 24 hours = 11577600000000 keys/day

(4000000000000001 - 2000000000000001) / 11577600000000 = 172.75 days

Same, correct me pls if I'm wrong.

[rud3boy]

If I calculated everything correctly, then the space from 2000000000000001 to 4000000000000001 can be scanned
in about 545 years if the average key generation rate is about 134 Mkey / s

Confirm or disprove my calculations.

Looks like something is wrong in your calculation.
I think should be like this:

134000000 keys/s * 60 sec * 60 min * 24 hours = 11577600000000 keys/day

(4000000000000001 - 2000000000000001) / 11577600000000 = 172.75 days

Same, correct me pls if I'm wrong.

The space is hexadecimal!
2000000000000000 hex = 2305843009213693952 decimal

134000000 Keys/ sec

199164.1626255609065782 days

545.6552400700298810362 years

[Firebox]

If I calculated everything correctly, then the space from 2000000000000001 to 4000000000000001 can be scanned
in about 545 years if the average key generation rate is about 134 Mkey / s

Confirm or disprove my calculations.

Looks like something is wrong in your calculation.
I think should be like this:

134000000 keys/s * 60 sec * 60 min * 24 hours = 11577600000000 keys/day

(4000000000000001 - 2000000000000001) / 11577600000000 = 172.75 days

Same, correct me pls if I'm wrong.

The space is hexadecimal!
2000000000000000 hex = 2305843009213693952 decimal

134000000 Keys/ sec

199164.1626255609065782 days

545.6552400700298810362 years

Oh f***, that was hex value.  
Then yes, you are right, it will take just only ~545 years.

But there is also a good news: imagine what will be the price of BTC after 545 years!!! 

[iparktur]

On a background 545 years an error per 0,5 years to make all any +/- 0,1 percents

[itod]

If I calculated everything correctly, then the space from 2000000000000001 to 4000000000000001 can be scanned
in about 545 years if the average key generation rate is about 134 Mkey / s

Confirm or disprove my calculations.

Looks like something is wrong in your calculation.
I think should be like this:

134000000 keys/s * 60 sec * 60 min * 24 hours = 11577600000000 keys/day

(4000000000000001 - 2000000000000001) / 11577600000000 = 172.75 days

Same, correct me pls if I'm wrong.

The space is hexadecimal!
2000000000000000 hex = 2305843009213693952 decimal

134000000 Keys/ sec

199164.1626255609065782 days

545.6552400700298810362 years

Oh f***, that was hex value.  
Then yes, you are right, it will take just only ~545 years.

But there is also a good news: imagine what will be the price of BTC after 545 years!!! 

These facts obviously have to be re-posted since you are surprised by the calculation how many resources is needed to crack just one extremely short key from this transaction:



Once again: the idea behind the creation of this puzzle transaction is to prove it can not be solved.

[Andzhig]

These horror stories about the number of atoms in the universe, are used for embellishment (although the numbers are large and relatively puzzle at this stage justifiably look for 1 needle in a haystack).

Let's look at the address numbers, on the number of repetitions of numbers.

1    2    3    4    5    6    7    8   9    0

8    6   8     6   9     9    6    7   6   12   88076670097206135214755096908866554407314546020283163510152690884233313095179
4    5   5    14   7     5   11   9   5   12   57701484440690220081460730827720988043707783650447848844644231359596471509755
9    7   13   3    10   13  5    8    0   9    56852111307365822553680728638432355135106461736008687516183006036037433215266
7    5   11   7    12   8   7    9   5     6    83144555669307175352868736014304552664501628893338700237812991649157337855485
11  11   7   5    11   6    6   7   5     9    105951512903139530827431508910247856221386514825762420570832790562065784213611
3    9    8   4     5   10   9  10   4    14   2800743280837621873504738280285669010665021097040374687382697063985620056327
10   9   6   7     8    6    7   7   9     8    15155401853110903276292971961426024213516891095729877044987768503568484329302
6    8    4   10  11   7    8   9    8     5   1934145264352640584468993215160278462974765570385286888570941520948795715972
4    8   10  10   6    7    8  10   2    12   28808842000054338759447213206875406362693076403134586314430882247307076152875

there are numbers in which numbers may be absent altogether (1,2,3,4,5,6,7,8,9 = 0)

13   6   6   10   0   7   7    11  11   6   14696118311433422644887998880270171111886071679929423836479971639009928414084
11   4   0   10   6   7   12  10  10   7    84167587877791947619455975590804189912148604940284674067142717911820851066978
0    7    9   9    9   7   8    16   6    6   85056283424685094879758489628438532598948587847835803373846697232020876056473
6    9   10   9   5   10  11  10   7    0   35778492181327261174949468738285433366625387652824764739658862179647493738129

or present within 20 (very rarely 21)

20  12   4   7   5   5   6   8   5   5   14168167265037749111145324098522827112187124998114101721323801125686219581042
20   3  10   8   5   7   3   9   7   5   74210210994663119334888205459886331564143036385918170716141191111683131845191
6    3   5    5   8   4   20  6  11  7   671715073647425809453041797737097177653288097773772751099955845997107768998
10   4  10   8   9   3   4   4  20   5   91330834709955852129495199148324191949367391795990099341407196639595153298354
6   3  11   5  12  20   6   6   3   5    63563038544616496835516983610048686335751646557506626310787196666355232735676

Now look at the distribution of 40000 addresses https://imgur.com/pWdzq9T

as can see, some repeat more 6 7 8 9...

the maximum length of the number we have 115792089237316195423570985008687907852837564279074904382605163141518161494336 = 78 signs

roughly speaking 78:10 = 7 ,ie numbers can be 1,2,3,4,5,6,7,8,9,0 on 7 for mixing 1111111222222233333334444444555555566666667777777888888899999990000000. (in theory, 20-30 percent of Satoshi’s addresses should be there)

generally within length 77-78 signs numbers constituting number can float 1,2,3,4,5,6,7,8,9,0-0,9,8,7,6,5,4,3,2,1 = 3-12  

3-12 or 4-13 a lot of us, we can retreat a little from the middle (7-7-7-7-7-7-7-7-7-7) 5-10 or 6-8 etc...

(and the same sequence if you cut off the first 78 characters of degrees 2)    

[itod]

These horror stories about the number of atoms in the universe, are used for embellishment (although the numbers are large and relatively puzzle at this stage justifiably look for 1 needle in a haystack).

Embellishment? Really? These numbers are the essence of cryptographic security. They are pure science, and still you are arguing with scientific calculations. If these calculations were off in any possible way, and you could find the private key by brute-forcing Bitcoin would be worth nothing.

[AndreuSmetanin]

These horror stories about the number of atoms in the universe, are used for embellishment (although the numbers are large and relatively puzzle at this stage justifiably look for 1 needle in a haystack).

Embellishment? Really? These numbers are the essence of cryptographic security. They are pure science, and still you are arguing with scientific calculations. If these calculations were off in any possible way, and you could find the private key by brute-forcing Bitcoin would be worth nothing.

Yes ,but you, my dear friend, forget that cryptography is exact mathematics ,and it does not take into account that in nature there are collisions and accidents.As soon as hundreds of millions of people are not miners, and players in the lottery <find private key > you will be surprised how many coincidences appear on the way to 264 bit keys! The Creator of Satoshi realized it 9 years ago and quietly merged with the crowd.In order not to incur the wrath of people who believe in the steadfastness of bitcoin and resistance n bust.

[Firebox]

Embellishment? Really? These numbers are the essence of cryptographic security. They are pure science, and still you are arguing with scientific calculations. If these calculations were off in any possible way, and you could find the private key by brute-forcing Bitcoin would be worth nothing.

Personally me, I'm agree with you, bro! At least because I'm using this cryptographic algorithms to secure my files, hence I have to believe that they are safe.
But on other hand, nothing will last forever!
Years ago I remember when RC4/5 cryptographic algorithms were accounted as a quite strong ones and then it was compromised as easy as it was.
I understand that we can't compare RC4 with SAH256, but I mean that you never know which algorithm will be next one were researches will find a vulnerability.
Some years ago we were happy mine bitcoins with only GPU then we've got ASICs. Also human rase was preaty sure that the GPU is a most powerfull processor then Google said that more then two years they were running TPUs in their datacenters and just this days it being announced.
Who knows, maybe tomorrow we will see in the newspapers that SHA256 algorithm has been compromised by a kind of "dirty" attack, not brute-force.
And for the conclusion, let people believe that they are more lucky then they are. You see, even when direct brute-forcing declared to take a billions of years they still bileve that it's possible. Or maybe it' spossible? ))) May be this fellow tomorrow will press a button to run search of a hash for vanity address 1FeexV6bAHb8ybZjqQMjJrcCrHGW9sb6uF and the result will appear in a first minnute. )) Possible? Absolutly yes! If the probability is >0 it is possible.

[mrxtraf]

Well, it depends on which side to look at.
And as in a joke.

Blondie is asked how likely she is to see a live dinosaur on the street.
She answers, 50 percent!
Ask how it is ??
Well, either I will see, or I will not see!

If we speak within this puzzle. Then, having some "random" private key generation statistics, we can try to predict in which range to search for the next key. Purely mathematical analysis. At the same time, different values, repetition in bit form, in decimal, hexahedral, etc. can take part in the analysis. Either repetition, or the number of all numbers and sequences. And first, more possible keys are checked, and then less possible.

If we talk about all keys in general, then on the basis of already known private keys it will not be possible to analyze. Since different keys were generated by different software products, with different random generators, some were generated by user actions (pull the mouse, enter a phrase), others are based on random words, etc.
That is, it cannot be said that such a private key cannot exist in the current range. They are all valid in the known range.

But! They are not all valid for the required public keys or addresses! Then here it is necessary to analyze the frequency repetitions of the received keys or addresses. To find a certain dependence and then the search is divided into two levels, the search for matches, the transition to the next range of possible matches, the search by small steps until the next match is found.

But the search for these hits also takes time and power. It also reduces the speed of the search, as it is necessary to carry out an additional analysis of the result obtained.For example. The probability that in the range of 1 trillion private addresses on the output will be two addresses with a difference of only 1,2,3 bytes, almost zero. And if we have found such an address, which matches the desired one with a difference of 1,2,3 bytes. Then with great probability we can continue the search by adding 1 trillion to the current private key.

[JDScreesh]

Hello there. Somebody just found the #90. Congratulations.

We're still waiting for the PrivKey of #80 and #85 (and now #90  )

-------------------------------------------------------------------------------
65 000000000000000000000000000000000000000000000001A838B13505B26867 18ZMbwUFLMHoZBbfpCjUJQTCMCbktshgpe

70 0000000000000000000000000000000000000000000000349B84B6431A6C4EF1 19YZECXj3SxEZMoUeJ1yiPsw8xANe7M7QR

75 0000000000000000000000000000000000000000000004C5CE114686A1336E07 1J36UjUByGroXcCvmj13U6uwaVv9caEeAt
-------------------------------------------------------------------------------

Maybe Arulbero or pikachunakapika could help us 

[mrxtraf]

Why steping is 5???
Maybe reality collision found?

[Bajula]

#90 just moved.

[Win2BTC]

How many BTCs left in this PUZZLE ?

[JDScreesh]

Counting with the small additions, there are still 106.14016893 BTC left in this puzzle addresses.  

[BurtW]

Why steping is 5???
Maybe reality collision found?

Please read the thread.  Go back a few pages and read forward until you find the answer to your question.

[mrxtraf]

Yes, like I read everything, you can link to a certain post.

[Firebox]

Looks like someone has found some kind of trick or regularity in calculations...
Definetely it can't be luck with stepping 5 and and can't be hashing or brute-forcing. Just only if pentagon's admin decided to test the most powerfull PC in the world with this puzzle address