Proof of Performance Consensus Model and Algorithm

Abstract

The article examines the working principle of the Proof of Performance (PoP) model, based on a consensus algorithm that supports horizontal sharding functions. The PoP model introduces changes to the traditional block structure used in Proof of Stake algorithms and Tendermint-based networks. Horizontal sharding allows transactions to be distributed among multiple nodes (shards), significantly increasing the network's throughput. The main goal of the study is to explore ways to enhance the efficiency and scalability of blockchain networks through dynamic transaction distribution and adaptive node management. An important aspect is the definition of parameters and adjustable characteristics of nodes, such as performance and reliability, to ensure even and fair load distribution within the network. This provides the system with the ability to adapt to changing load conditions. The study employs analytical and formal methods to describe the block structure, transaction distribution mechanism, and the system of penalties and rewards for shards. The research represents an innovative approach to managing blockchain networks, focusing on node performance. The PoP model with horizontal sharding provides higher throughput and scalability compared to traditional consensus algorithms. A system of dynamic load distribution and adaptive weight adjustment of nodes based on their performance is proposed, which contributes to the improvement of the network's efficiency and reliability. The results of the study demonstrate that the Proof of Performance model significantly increases transaction processing speed and overall blockchain network performance. Application examples confirm the model's effectiveness in various types of networks, such as DeFi platforms, supply chain management systems, and IoT networks. The PoP model encourages nodes to maintain high performance, ensuring fair load distribution and enhancing the overall network resilience.