[Slighted edited and corrected some maths]
First of all, I would like to thank this great community where I got answers to my bitcoin curiosity.
I wanted to extend this curiosity which is slightly related to a post
https://bitcointalk.org/index.php?topic=5394326.msg59843701#msg59843701To my rookie mind, it looks like there are quite a large number of possible solutions to meet the condition of number of zeros.
for e.g. if it needs, let’s say 000 in length of 5 string (solution could be 00010,00011,00001,00010)
Total possible solution = 2^(total number of bits – number of zeroes) =2^(5-3)=2^2 =4
[Edited]e.g.
first blocks (during 2010, 8 zeros)
solution => 00000000ddaccd89104a83b0a28e1987a88d8f51829029cb7e18630e2575e939
No of bits in solution => 256
No of zeroes in solution => 8
Other Possible solution => 2^ (256-248) => 4.5*10^74 (this is a huge number of possible solutions to meet the requirements)
e.g.
2022 blocks (19 zeroes)
solution => 00000000000000000001b3b857465688e53f3fafc11d50a794690f7bae2f7ff6
No of bits in solution => 256
No of zeroes in solution=> 19
Other Possible solution => 2^ (256-19) => 2^237=> 2.2*10^71
Difficulty 2010 => 1
Difficulty 2022 => 28,587,155,782,195.14 => 28 trillion times difficult.
Possible solution at 2010 => 4.5*10^74
Possible solution at 2022 => 2.2*10^71
Lastly, based on this, the maximum difficulty will be when there is only one solution, that is when it requires solution to be all 0s.
No of bits => 256
No of zeroes => 256
Only Possible solution => 2^ (256-256) => 2^ 0 => 1
Since at this point there will be only one solution, could the shuffling of => [block version] [previous blocks hash] [transaction merkle root hash] [timestamp] [bits] [nonce] not be able to produce a solution.
I guess it is possible not to get the solution and the difficulty adjustment will be lowered in such case to avoid the deadlock.
