Proof of Random Leader: A Fast and Manipulation-Resistant Proof-of-Authority Consensus Algorithm for Permissioned Blockchains Using Verifiable Random Function

Abstract

Proof of Authority (PoA) is a widely adopted consensus algorithm for permissioned blockchain networks, where a group of trusted entities governs the network. PoA is known for achieving rapid consensus with minimal computational and energy requirements. However, existing PoA variants such as Aura and Clique suffer from low transaction throughput in high workload conditions and provide limited randomness in leader selection. They are also vulnerable to time and order manipulation attacks. To overcome these limitations, this paper introduces a novel PoA-based consensus algorithm called Proof of Random Leader (PoRL), which utilizes a verifiable random function to enhance transaction throughput, improve scalability, and ensure fair and unpredictable leader selection. The proposed PoRL algorithm was implemented in Python and evaluated using a network of six consensus nodes with varying computational capabilities. The performance of PoRL was assessed based on key metrics, including security, consistency, availability, fault tolerance, block time, and transaction throughput. Experimental results indicate that PoRL achieves lower consensus times and higher transaction throughput compared to Aura and Clique, making it a more efficient solution for permissioned blockchain networks. The findings of this study provide valuable insights for blockchain practitioners in selecting the most suitable PoA implementation based on their specific network requirements.