0
I understand that the Bitcoin mining problem is to find a string s (hash of previous block + Merkle Tree Hash + nonce) such that sha256(s) has n leading zeros, where n determines the mining difficulty.
According to Blockchain.Info, The Current Difficulty is 63,93,02,37,17,201.
The output of sha256() is a 16 bit hex value.
Question 1 The above image indicates that if N=4, there are 4 zeroes in the 16bit hex value. So if N=16 is the entire string is expected to have only zeroes? Please explain difficulty using this example. So if N=6393023717201 How do I expect 63,93,02,37,17,201 number of zeroes in 16bit length string? Please explain the significance of this huge number of zeroes in this context.
Question 2 Why is difficulty decreases at some point in time?


Sir, Do you have any idea about Question 1? – Akhil Nadh PC – 2019-04-08T07:12:17.997