Proof of Optimum (PoO): Consensus Model Based on Fairness and Efficiency in Blockchain

Abstract

Blockchain systems are popular technologies that have recently emerged. As a decentralized system, blockchain technology has provided many solutions and many problems associated with these solutions. One of its most important problems is that while performing hash calculations very intensively to create a new consensus block, it reduces its efficiency depending on the duration. In this study, a new model to avoid Proof of Work (PoW), which directs the computations made to create blocks to optimization algorithms, is proposed. The proof mechanism proposed in this study is called Proof of Optimization (PoO). A traveling salesman problem (TSP) is entered into the designed system to solve the optimization algorithms. Nodes are asked to solve the TSP in certain iterations and populations. As a result, nodes are asked to create blocks with the fitness, density and time values obtained. PoO and PoW consensus algorithms were subjected to an experimental comparison in the system. The test results show that the block generation time of the PoO consensus model varies between 2 s according to the dataset solution with the least cities (ulysses22) and 60 s according to the dataset solution with the most cities (gr666). Additionally, as a result of experimental analyses, it was determined that decentralization, which is the percentage of block creation among miners in the blockchain, reached a more stable value and the fairness index rose above 0.90 on average. When the obtained values were compared with PoW, it was observed that the block time was more stable and the decentralization of the blockchain was higher. In this way, high-equipped nodes in the blockchain system are prevented from dominating the network. Thus, it is ensured that low-equipped nodes have the right to create blocks in the blockchain. The difficulty levels of the problems can be adjusted by changing the number of cities in the TSP evaluated in this study. In this way, the problem of creating blocks in the network can be made more difficult or easier at any time.