Downloads provided by UsageCounts
Consensus mechanisms play a critical role in blockchain networks, ensuring that all participants agree on the state of the distributed ledger. However, existing consensus mechanisms have limitations in terms of efficiency, security, and decentralization. In this research paper, we propose a Hybrid Consensus Mechanism (HCM) that combines the advantages of Delegated Proof of Stake (DPoS), Practical Byzantine Fault Tolerance (PBFT), and Proof of Elapsed Time (PoET) to address these limitations. HCM uses a set of trusted validators (delegates) similar to DPoS, who participate in a PBFT-like consensus protocol to reach agreement on the state of the ledger. PoET is used to randomly select the leader for each consensus round, preventing the concentration of power. HCM also introduces a dynamic delegation mechanism and sharding technique to enhance fairness, resilience, and scalability in blockchain networks. We provide detailed technical insights, backed by underlying data, to illustrate the effectiveness of HCM in achieving efficient and secure consensus.
Hybrid Consensus Mechanism, DPoS, PBFT, PoET, decentralization, scalability, Blockchain, Cryptocurrency, Consensus
Hybrid Consensus Mechanism, DPoS, PBFT, PoET, decentralization, scalability, Blockchain, Cryptocurrency, Consensus
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 9 | |
| downloads | 10 |

Views provided by UsageCounts
Downloads provided by UsageCounts