Blockchain propagation time during the Bitcoin block

Bitcoin time is a key factor in understanding the total speed and efficiency of the network. In this article, we will examine the impact of blockchain propagation time on the time block analysis and for the order of blocks up and small.

Assumptions

Before diving in the analysis, assume that two key parameters:

• network extension time

  

  : average time that is required to broadcast transactions to the network and check the node.

• Block time : Interval between creating new blocks, which is currently set for 6 seconds.

Analysis

We will consider two scenarios for our analysis:

• Growth in order : Blockchain order, in which transactions are inserted up to the order. In this scenario, the nodes can check and process transactions more effectively.

• Department of a reduction : Blockchain ordering, in which transactions are inserted to the order of falling. This is contrary to the ranks up.

Time = T0 Analysis

In the times of “T0” it passed every 6 seconds from the beginning of the network. Consider two blocks, B1 iB2, which are sometimes insertedt1 'and' t2 '.

*For
rising ordering : Because both knots also check process transactions upwards, they can see the previous block as soon as it is created.

+ Knot and see B1 and checks its validity. If there is no control transaction (e.g. a spare list), a node A will wait 6 seconds for the next new block to check the second node.

*For
last order : Because the nodes check and process transactions in order design, they must see all previous blocks before checking the current. This means that the nodes will not have any data on "B1 until B2″ appears.

+ Knot and see B1, but he does not know if there are other control transactions (e.g. transaction with an empty list). If the knot has to wait until the next node adds or removes transactions, it may take up to 6 seconds.

convergence time

Over time, we can see that the time of convergence between “T0` and the following blocks will be different for the growing and decreasing order. In the case of growing rows, the time of convergence is approximately equal to the time of the block (6 seconds), because the nodes check transactions in the growing order.

However, in the case of decreasing lines, the time of convergence will be much longer, because the knots must wait for all previous transactions before checking the new one. This can lead to a significant increase in the average transaction processing time.

Application

To sum up, the analysis of the blocking time and expansion time reveals that both the up and decrease in order have different features when it comes to the performance of checking transactions in the Bitcoin network. Although growing orders reach faster convergence time, rows of origin are more effective from a delay perspective. Understanding these differences is of key importance for the optimization of the development and implementation of the Bitcoin -based system.

references

• [1] “Blockin Time” (Wikipedia article)

• [2] “Time of spreading blockchain”