Effective Consensus Computation for Public Blockchain in Small-World Network Environment

This paper proposes effective methods to find the optimal scale-related parameters of the Small-World Network to minimize the speed of solving consensus problems in public blockchains. We demonstrated that the consensus problem is worked out quickly on specific small-world networks with an average shortest path between nodes. An effective algorithm is proposed to find the network model of N nodes possessing good consensus convergence time such as the maximum degree, the average path length, and the large vertex and edge connectivity. A relationship between the topological properties of networks and a randomly rewiring probability β is also shown. This way, the average shortest path length is dynamically calculated to get high-speed spreading of consensus time.