Is there any general formula that allows someone to calculate what is the current probability of having a chain fork?
I know that the probability of finding a new block is proportional to the difficulty target. Given that it's possible to have 2^256
different hashes (for simplification), finding a nonce
that will yield a hash lower than target
has probability of approximately P(m) = (2^256 - target)/2^256
.
Given that a block will be mined within 10 minutes and considering that a delay of 2 seconds would be small enough for the newtwork propagation not being complete, that is, if two nodes find a block 2 seconds appart, there would be no time to notify the full network.
Here is when it gets complicated to me (statistics is not strong with me). What is the probability of the situation described above occur?
I think this is something related with a normal distribution, but I'm not sure.
My rational to find the probability of forking would be:
P(fork) = P(m1) * P(m2) * P(tdse)
Where P(m1)
is the probability of node 1 to find a new block, P(m2)
the same for node 2 and P(tdse)
is the probability of both mining occur with a time difference small enough to not be propagated to the entire network.