Preprint
Review

Evolution of Blockchains based on the Architecture and Consensus Algorithms used on Blockchains

This version is not peer-reviewed.

Submitted:

01 November 2022

Posted:

04 November 2022

You are already at the latest version

Abstract
Blockchain technology has gotten much interest recently from academics, industry, and governments worldwide. It is regarded as a technical innovation that can disrupt various application fields affecting many aspects of our lives. Cryptocurrencies are a public blockchain application's success story that sparked extensive research and development. Scalability, energy consumption, and security, on the other hand, remain significant challenges. With low throughput, high transaction delay, and high energy consumption, most cryptocurrencies are experiencing low-efficiency difficulties. The scalability issue with public Blockchains is preventing organizations and sectors from receiving effective solutions. As a result, it is critical to bridge the gap and develop new frameworks that connect Blockchain with those goals. This paper examines the evolution of blockchain architecture and consensus protocols, provides a retrospective analysis, discusses the rationale for the various architectures and protocols' change, and captures the assumptions supporting their development and contributions to collaborative application development. However, existing research on consensus algorithms is insufficient. The features of the algorithms are discussed insufficiently in those papers, and some prominent blockchain consensus methods are not examined in terms of their scopes. The study’s findings are delivered in tabular formats, allowing for a clear representation of these algorithms. We discovered in our investigation that scalability is a result of many parameters such; transaction throughput, number of nodes, storage, block size, high communication, latency, cost. Furthermore, Due to its off-chain data storage and smaller block size, PoF is much more scalable than PoS and PoW, and Because PoA is a hybrid of PoW and PoC, it does not necessitate a large number of computational resources. As a result, it has a higher throughput than PoW. PoPF entails ranking all participating nodes and appointing n accountants to compete for adding new blocks. This article addresses the need by analyzing a wide range of consensus algorithms using a complete taxonomy of attributes and delving into the consequences of several still-present flaws in consensus algorithms.
Keywords: 
;  ;  ;  ;  ;  
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.

Downloads

257

Views

208

Comments

0

Subscription

Notify me about updates to this article or when a peer-reviewed version is published.

Email

Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2025 MDPI (Basel, Switzerland) unless otherwise stated