Abstract
Blockchain is a progressive technology that considerably impacts current technology due to its transparency, decentralization, and security features. In any blockchain application, the critical and core part is the consensus algorithms. Consensus algorithms are crucial for ensuring that all transactions are validated before being added to a blockchain, which serves as a primary function of the blockchain. Maintaining a good performance in different consensus algorithms is essential in blockchain technology. This paper presents an improved consensus algorithm for Proof of Authority-Practical Byzantine Fault Tolerance, incorporating validation, voting, and authentication concepts. The proposed method enhances PBFT with an authorisation module to provide confidentiality in blockchain applications. The results are implemented using Spyder, a Python IDE, and the Ethereum platform, precisely the Remix IDE. The performance is analyzed through the experimental results of PBFT and PoA-PBFT algorithms based on computational resources, including gas cost, transaction cost, execution cost, latency, and transactional throughput. Experimental results have demonstrated that an improved consensus algorithm requires fewer computational resources. The proposed algorithm is applicable in various fields, including healthcare, supply chain management, and the Internet of Things. Based on the experimental results examined, this work presents a potential future approach that serves as a helpful framework for researching the expansion of blockchain system functionality.
Keywords: Bitcoin, Blockchain Applications, Hybrid-Consensus Algorithms, PoAh, PoP