Hello from Ukraine, guys. I have watched the crypto skyrocketing to the MOON and nearly fallen in depression thinking that purchasing just a 1 BTC for a ~ 3k$ (when it was possible) could already provide me my own flat and so i've found different BTC contest including this one.

My ideas and used scripts could be found here https://github.com/HomelessPhD/BTC32

I've seen some of you struggled with the need to reduce the interval of Private Keys for brutting - i've managed this problem using MATLAB\Octave script (just because it has useful Variable-Precision arithmetic AKA Big Numbers and thats was faster for me to use a familiar instrument, but in nearest future i could write the C program if it is reasonable). The main idea of that Github project is to bruteforce multiple "32 BTC puzzle" addresses within a series of tiny Private Keys intervals using BitCrack utility. There are lots of comments i've left, but i'm opened for questions and propositions.

By the way, thinking of patterns behind the Private Keys (that is also described on Github) - i've  presented Private Keys for each 32 BTC address as relative position inside its "all possible Private Keys interval" so called alpha parameter: PK_n = 2^(n-1) + rem, where rem taken from {0...2^(n-1)} forming alpha_n = (PK_n -2^(n-1)) / 2^(n-1). Alpha parameter for all Private Keys shows the relative position of the Private Key inside its interval of possible values and lies in interval of {0..1} for all BTC addresses.

The autocorrelation for alpha parameters (Private Keys in dimensionless form) looks like a classical noise do (just google it):
https://user-images.githubusercontent.com/80585811/111080604-e3520280-8507-11eb-839e-8ebd26ec61bb.png

Histograms (that at infinity should form a Probability Density Function - but we have have only ~60-70 points) show an interesting behavior at 0.3-0.5 and 0.6-0.8 (and specially 0.82-0.83).

https://user-images.githubusercontent.com/80585811/111080580-c4537080-8507-11eb-9cc3-2bb6096ca752.png

One may say that 0.3-0.5 and 0.6-0.8 are reasonable sub-intervals for searches, other could state that it is more probable to find a new Private Key at histogram minima rather than at its maxima (thinking that final histogram should form a uniform distribution) and the smartest i assume will notice pure randomness stating that all the next keys are nearly unrelated with known keys. I've tried to simulate keys distribution (see the github) -  the third variant could be true but do we have a choice?! We cant loop through all Private Keys - it will take ~>1000 years for #64 and much more for others so one way or another, we will have to choose a criterion for narrowing the interval Private Keys - histogram is one of such.


I am the last year PhD on applied physics and. Now i need to hurry in writing a few more articles and I cant spent much time on this "hackaton" at the moment, but after researches and two articles (expect it will take a month) i'll return to this topic - wish you good luck. By the way, i've searched few interesting intervals (interesting alpha values) - you may found them in "Examples" folder on github.

P.S. Thank you for reading my post - it is my first post in bitcointalk. Sorry for my bad English.