However, in the block mining process, there is the possibility that a MU \(n\)  generates the block and propagates the mined block slower with other miners which will discard this block from blockchain. This issue is called forking and such a block is called an orphaned one. The forking probability is approximated as \(P_{\mathsf {fork}} = 1- e^{-\iota (s_n)}\) , where \(\iota \)  is a constant mean value and set to \(\iota =1/600(sec)\)  [1]}. Further, \(s_n\)  denotes the number of transactions contained in the block that is mined by MD \(n\) , and \(\phi (s_n)\)  is a function of block size. Therefore, the mining latency at MD \(n\)  can be rewritten as
\(T_n^{\mathsf {mine},(k)} = \zeta (T_n^{\mathsf {gen},(k)} + T_n^{\mathsf {prop},(k)}), \forall k \in \mathcal {K},\) 
