A quantitative analysis of the security of PoW-based blockchains

A quantitative analysis of the security of PoW-based blockchains

연구 분야: Networking

학회: Cluster Computing

This study analyzes the security implications of Proof-of-Work blockchains with respect to the stale block rate and the lack of a block verification process. The stale block rate is a crucial security metric that quantifies the proportion of rejected blocks in the blockchain network. The absence of a block verification process represents another critical security concern, as it permits the potential for invalid transactions within the network. In this article, we propose and implement a quantitative and analytical model to capture the primary operations of Proof-of-Work blockchains utilizing the Performance Evaluation Process Algebra. The proposed model can assist blockchain designers, architects, and analysts in achieving the ideal security level for blockchain systems by determining the proper network and consensus settings. We conduct extensive experiments to determine the sensitivity of security to four aspects: the number of active miners and their mining hash rates, the duration between blocks, the latency in block propagation, and the time required for block verification, all of which have been shown to influence the outcomes. We contribute to the findings of the existing research by conducting the first analysis of how the number of miners affects the frequency of stale block results, as well as how the delay in block propagation influences the incentives received by rational miners who choose to avoid the block verification process.