Simulation-Based Benchmarking of Consensus Algorithms for Scalable Blockchain Networks

Integration of renewable-energy (RE) sources of energy into local microgrids, decentralised energy markets using blockchain based peer-to-peer (P2P) energy trading is gaining more traction due to its ability to enable transparent, autonomous, and secure transactions among distributed energy resources (DERs). Due to the large variety in microgrid topologies and their respective operational constraints, a key challenge to obtaining the most effective trading framework is the choice of blockchain consensus protocol that suits a given microgrid type. Choice of consensus mechanism solely affects the reliability and security of a network. This paper presents a quantitative comprehensive evaluation of various blockchain consensus mechanisms such as Proof-of-Work (PoW), Proof-of-Stake (PoS), Delegated Proof-of-Stake (DPoS), Proof-of-Elapsed-Time (PoET), Practical Byzantine Fault Tolerance (PBFT), Raft, and Tendermint to determine their suitability for P2P energy trading in microgrids. Various metrics such as fault tolerance, energy efficiency, latency, throughput and consensus time were evaluated for multiple consensus mechanisms through simulations. This paper also studies node-scaling impact on the protocols and presents a final decision framework to match the suitable protocol with various microgrid topologies.

Blockchain technology has become one of the most disruptive innovations of the 21st century, reshaping industries such as finance, supply chain management, healthcare, and governance. However, the conventional blockchain ecosystem—particularly models based on Proof of Work (PoW)—has been widely criticized for its excessive energy consumption and ecological footprint. As societies move toward sustainability and carbon-neutral goals, the exploration of energy-efficient blockchain models becomes not just an academic pursuit but also an ethical imperative. This manuscript investigates the evolution of energy-efficient consensus mechanisms and their integration into “green smart contracts,” which enable automated, verifiable, and sustainable digital agreements. It highlights consensus algorithms such as Proof of Stake (PoS), Delegated Proof of Stake (DPoS), Proof of Authority (PoA), Proof of Space-Time (PoST), Practical Byzantine Fault Tolerance (PBFT), and emerging hybrid mechanisms. The manuscript offers a comprehensive literature review, outlines statistical insights comparing energy and performance trade-offs, and proposes methodologies for integrating eco-friendly smart contract architectures. The results emphasize that while PoW-based systems consume up to 99% more energy than PoS-based models, hybrid approaches demonstrate a promising balance between security, decentralization, and efficiency. The study concludes that energy-efficient blockchain models, when strategically aligned with sustainability frameworks, can redefine smart contract ecosystems to meet global climate commitments while maintaining reliability, transparency, and scalability.

Applying Blockchain consensus mechanisms to Network Service Federation: Analysis and performance evaluation

Blockchain is a new technology for processing complex and disordered information with respect to business and other industrial applications. This work is aimed at studying the consensus algorithm of blockchain to improve the performance of blockchain. Despite their advantages, the proof of stake (POS) algorithm and the practical Byzantine fault tolerance (PBFT) algorithm have high latency, low throughput, and poor scalability. In this paper, a blockchain hybrid consensus algorithm which combines advantages of the POS and PBFT algorithms is proposed, and the algorithm is divided into two stages: sortition and witness. The proposed algorithm reduces the number of consensus nodes to a constant value by verifiable pseudorandom sortition and performs transaction witness between nodes. The algorithm is improved and optimized from three dimensions: throughput, latency, and scalability. The experimental results show that the improved hybrid consensus algorithm is significantly superior to the previous single algorithms for its excellent scalability, high throughput, and low latency.

The advent of the Bitcoin system has brought another boom in the Internet era. In a very short time, many Blockchain systems come into being successively, whose decentration, consensus mechanisms, intelligent contract, and other characteristics make them applicable to various fields such as finance, education, medical, technology, etc. The consensus mechanism is the core of Blockchain technology. And a good consensus mechanism plays a very important role in the stable operation of the Blockchain system. The continuous improvement of consensus mechanisms such as PoW (proof-of-work), PoS (proof-of-stake), DPoS (delegated-proof-of-stake), and PBFT (Practical Byzantine Fault Tolerance) has led to the evolution of Blockchain technology to Blockchain 3.0. Starting from the issue of Byzantine generals, this article analyzes common consensus mechanisms based on existing Blockchain applications and then evaluates their consistency. This paper has a unique perspective, selection and comment on the latest progress and important literature in the field of block chain. At last, it also has a high degree of summary and prospect to the existing problems and the future development trend.

This article describes the main consensus algorithms, their positive and negative aspects. Consensus in the general sense means a way to come to an agreement. In the blockchain, which is a decentralized system that does not have a single governing body, various algorithms have been developed to achieve consensus. In a blockchain network, it does not matter whether the system participants trust each other or not. They must agree on certain principles of work that will apply to everyone. And this is a direct function of the consensus mechanism. Algorithms are described and an example of solving this problem is given, namely the problem of choosing a consensus for future systems. An example of using multiple consensuses in blockchain networks is given. Such consensuses as Proof of Work (PoW), proof of Capacity (PoC), proof of Authority (PoA), proof of activity (PoAA), proof of Importance (PoI), proof of Burn (PoB), proof of Stake (PoS) are described, as well as its subspecies: Leased Proof-of-Stake (LPoS), Delegated Proof-of-Stake (DPoS). Many different nuances about the mixed type of consensus are described and examples of such cryptocurrencies and systems are given. The subtleties of mining for each consensus are described. Examples of hash functions, masternodes, nodes, algorithms, as well as key features of certain cryptocurrencies with mixed consensus are given. It is concluded that the choice of consensus for building systems based on blockchain.

This research document demonstrates the understanding of two key elements: Proof of Work (PoW) and Proof of Stake (PoS) within cryptocurrency. Cryptocurrency is often misunderstood as just volatile and risky but many investors do not understand what it even is. What is proof of work (BTC)? What is proof of stake (ETH)? How are they similar and how are they different? Cryptocurrency is actually more relatable that originally imagined once a person understands digital currency, money, it’s origins, and how they hold similar monetary value within their own wallets. Cryptocurrency in PoW involves complicated mathematical equation solving via mining from a large growing pool of miners. These miners receive rewards such as bitcoin/tokens/etc. from their mined hash blocks verified, and blocks added to the blockchain. Challenges are that there are many miners and there may be a computational limit per core of each PC to be able to mine since Bitcoin has increased its difficulty 70 billion times since it started. BTC or Bitcoin is still widely trusted due to its increasing difficulty to race to the finish line to finish the advanced math computations. Whereas within PoS this is not a race between the masses and advanced math computations, but a validator that generally has more put in their stake vs. gained by receiving the processing fees associated. ETH or Ethereum has shifted from PoW to PoS for its better energy efficiency in resources. It has employed many other additional checks from Casper to Gasper which is the combination of Casper (fork-choice algorithm), LMD-GHOST (heavest observed subtree), and finality which requires 2/3rd agreement as well as once a block is justified it is upgraded to a finalized block. the similarities between the two PoW and PoS are that they are consensus-driven algorithms. They are designed to reach an agreement between the systems in place before each block is placed in the blockchain. Additionally, they also have a shared public ledger that operates on a global if not international scale. With blockchains, there is always only one true version and this is relying on a network rather than a governing authority like a bank/government entity to provide security and to prevent fraudulent transactions. It is still widely contested which is better than these two well-known consensus algorithms and it is still widely contested. The best answer is suited on a per investor per business basis in terms of the willingness of taking a risk just like any investment. This document serves to help provide guidance in the understanding of cryptocurrency of two main consensus algorithms, its similarities, differences, and help identify see what a potential investor the reader may be.

Blockchain networks use consensus mechanisms so participants can exchange transactions without the need to rely on a trusted third party. Consensus mechanisms using Proof of Work burn significant energy to select a block miner and the delay limits performance. Other consensus mechanisms such as Proof of Stake or Practical Byzantine Fault Tolerance still designate a single validator to append a block to the chain, preventing blocks from being built and published in parallel. In this paper we introduce a new consensus mechanism, Proof of Descriptor, enabling clients to work together to publish blockchain transactions using a descriptor object which stores information on the cooperative parallel execution of transactions. Proof of Descriptor consensus allows commutative transactions to be mined individually. It does not require a leader to propose the next block, enabling clients to cooperate on completing transactions, assembling blocks and publishing them. We demonstrate that our approach is less prone to attack since it is not vulnerable to a malicious leader, while simulations show a potential 20x improvement over the fastest sequential blockchain, Solana.

The challenge of collecting large scale environmental data lies in reducing the cost of allocating data sensors while improving the data quality. Compared with traditional centralized data collecting methods, obtaining environmental data by distributed "crowds" can largely reduce the cost. However, designing such crowdsourcing systems requires an appropriate incentive mechanism to encourage providing accurate and rare environmental data. In this paper, we propose to utilize blockchain-based incentive mechanisms to address the problem. We design and evaluate a blockchain-based system for large scale environmental data acquisition, which consists of a sensor layer to collect distributed environmental data, a valuation layer to evaluate the quality of the data collected, a consensus layer to incentive and motivate high quality data collection, and a ledger layer to record the incentive transactions and the qualified environmental data. The incentive mechanism in the consensus layer is achieved with a Proof-of-Data-Value (PODV) protocol adapted from the Practical Byzantine Fault Tolerance (PBFT) [11] consensus algorithm. We carry out experiments to compare the PODV with contemporary blockchain census protocols including Proof-of-Work (POW) [16] and Proof-of-Stake (POS)[18]. The experimental results show that the proposed system outperforms in encouraging crowds to provide accurate and rare environmental data, and imply that the PODV are superior in terms of throughput and environmental friendliness.

The architecture and functioning of the electricity markets are rapidly evolving in favour of solutions based on real-time data sharing and decentralised, distributed, renewable energy generation. Peer-to-peer (P2P) energy markets allow two individuals to transact with one another without the need of intermediaries, reducing the load on the power grid during peak hours. However, such a P2P energy market is prone to various cyber attacks. Blockchain technology has been proposed to implement P2P energy trading to support this change. One of the most crucial components of blockchain technology in energy trading is the consensus mechanism. It determines the effectiveness and security of the blockchain for energy trading. However, most of the consensus used in energy trading today are traditional consensus such as Proof-of-Work (PoW) and Practical Byzantine Fault Tolerance (PBFT). These traditional mechanisms cannot be directly adopted in P2P energy trading due to their huge computational power, low throughput, and high latency. Therefore, we propose the Block Alliance Consensus (BAC) mechanism based on Hashgraph. In a massive P2P energy trading network, BAC can keep Hashgraph's throughput while resisting Sybil attacks and supporting the addition and deletion of energy participants. The high efficiency and security of BAC and the blockchain-based energy trading platform are verified through experiments: our improved BAC has an average throughput that is 2.56 times more than regular BFT, 5 times greater than PoW, and 30% greater than the original BAC. The improved BAC has an average latency that is 41% less than BAC and 81% less than original BFT. Our energy trading blockchain (ETB)'s READ performance can achieve the most outstanding throughput of 1192 tps at a workload of 1200 tps, while WRITE can achieve 682 tps at a workload of 800 tps with a success rate of 95% and 0.18 seconds of latency.

In the white book of Bitcion, Satoshi Nakamoto described a bitcoin system that can realize point-to-point online payment without a third-party organization. After supporting this magical application scenario and subverting the traditional centralized system, the blockchain technology has attracted worldwide attention, triggered a research upsurge of blockchain consensus algorithm, and produced a large number of innovative applications. Although various consensus algorithms continue to evolve with the iteration of blockchain products and applications, Proof of Work (POW) and Proof of Skake (POS) algorithms are still the core of consensus algorithms. This paper discussestwo algorithms of POW and POS in blockchain consensus mechanism, and analyzes the advantages and the existing problems of the two consensus mechanisms. Since consensus mechanism is the main focus of blockchain technology and has many influencing factors, this paper discusses the current problems and some improved ideas, and selectes some typical algorithms for a more systematic introduction. In addition, some important issues related to safety and performance are also discussed. This paper provides the researchers a great reference on blockchain consensus mechanism.

DTPBFT:A dynamic and highly trusted blockchain consensus algorithm for UAV swarm

To mine a blockchain on IP Networks, one must do several tasks related to chain management, rule optimization, verification, and hash generation design. Various consensus model subsets may benefit from the various blockchain mining techniques proposed by researchers. Most of these techniques, however, are rather complicated, which slows down the mining process for large-scale blockchains. Overly simplistic models that include unnecessary redundancies are inefficient and have little practical use. To solve these issues and boost blockchain mining efficiency in large-scale deployments, the authors of this paper propose creating a novel hybrid bioinspired approach. The proposed IP Network model is adaptable to almost all consensus procedures and may be easily combined with dynamic consensus models with few alterations. After collecting performance and context-specific data from the underlying blockchains, the technique uses Genetic Algorithm (GA) that distributes these range sets among miner nodes that support trust, allowing for high-performance mining while maintaining a high degree of trust under actual application situations. The model was tested against Proof-of-Stake (PoS), Proof-of-Work (PoW), Proof-of-Trust (PoT), and Practical Byzantine Fault Tolerance (PBFT) based consensus algorithms to ensure its effectiveness in real-world scenarios. Mining latency, energy consumption, and computational complexity were used as metrics against which this performance was measured. This analysis revealed that the proposed model has the potential to decrease mining latency by 4.5%, energy usage by 3.9%, and compute complexity by 4.1% across a variety of consensus mechanisms, making it suitable for a number of real-time applications.

Traditional blockchain consensus mechanisms, such as Proof of Work (PoW) and Proof of Stake (PoS), face significant challenges related to the centralisation of validators and miners, environmental impact, and trustworthiness. While PoW is highly secure, it is energy-intensive, and PoS tends to favour wealthy stakeholders, leading to validator centralisation. Existing mechanisms lack fairness, and the aspect of sustainability is not considered. Moreover, it fails to address social trust dynamics within validator selection. To bridge this research gap, this paper proposes Proof of Friendship (PoF)—a novel consensus mechanism that leverages social trust by improving decentralisation, enhancing fairness and sustainability among the validators. Unlike traditional methods that rely solely on computational power or financial stakes, PoF integrates friendship-based trust scores with geo-location diversity, transaction reliability, and sustainable energy adoption. By incorporating a trust graph, where validators are selected based on their verified relationships within the network, PoF mitigates the risks of Sybil attacks, promotes community-driven decentralisation, and enhances the resilience of the blockchain against adversarial manipulation. This research introduces the formal model of PoF, evaluates its security, decentralisation, and sustainability trade-offs, and demonstrates its effectiveness compared to existing consensus mechanisms. Our investigation and results indicate that PoF achieves higher decentralisation, improved trustworthiness, reduced validator monopolisation, and enhanced sustainability while maintaining strong network security. This study opens new avenues for socially aware blockchain governance, making consensus mechanisms more equitable, efficient, and environmentally responsible. This consensus mechanism demonstrates a holistic approach to modern blockchain design, addressing key challenges in trust, performance, and sustainability. The mechanism is tested theoretically and experimentally to validate its robustness and functionality. Processing latency (PL), network latency (NL) [transaction size/network speed], synchronisation delays (SDs), and cumulative delay per transaction are 85 ms, 172 ms, 1802 ms, [PL + NL + SD] 2059 ms, respectively.

As approaching the era of Ethereum 2.0, the already unique and innovative cryptocurrency will witness a game-changing upgrade, and in this context, there is a lively discussion of the Proof of Work (PoW) and Proof of Stake (PoS) consensus mechanism. Moving from a PoW consensus mechanism to a PoS consensus mechanism is one of the most anticipated changes in this update. A close comparison of the two most popular consensus mechanisms, PoW and PoS, provides some strengths and drawbacks to these mechanisms. This comparison then becomes the building block to identifying the reasons behind Ethereum's upgrade to Proof of Stake. With the help of the comparison, this paper identifies a few drawbacks of the PoW consensus mechanism that Ethereum is currently facing. This paper finds that Ethereum's shift to PoS has indeed reduced the drawbacks of the Proof of Work consensus mechanism, mainly in terms of energy consumption, transaction cost, and confirmation speed.