WBRP: Consensus Algorithm Based on Weak Proof of Work
Nakamoto Consensus (NC) is a classic Proof of Work (PoW) consensus algorithm where the probability of miners earning the right to a block is proportional to their computational power. To prevent blockchain forks, the interval between block outputs is restricted, which results in lower throughput for PoW. To address blockchain performance issues, a transaction ledger scheme based on weak PoW consensus has been proposed. This approach combines strong and weak blocks, allowing miners to submit weak blocks with lower mining difficulty. Nodes can then use these weak blocks to organize transaction information on the main chain and ensure strict linear ordering of blocks and transactions through sorting rules. Experimental results demon-strate that the consensus algorithm based on weak PoW can significantly enhance system performance, allowing transaction throughput to increase linearly with bandwidth. Specifically, with a node bandwidth of 1 Gb/s, the performance can exceed NC by more than 300 times.
Authors
- Zedong Wang (ORCID: https://orcid.org/0009-0000-0112-0491)
- Wencheng Zhu (ORCID: https://orcid.org/0000-0002-6737-6841)
- Hui Zhi (ORCID: https://orcid.org/0000-0002-0740-3270)
- Jianing Li (ORCID: https://orcid.org/0000-0001-9552-2247)
- Jiarui Li (ORCID: https://orcid.org/0000-0003-0132-8270)
- Dongbin Wang (ORCID: https://orcid.org/0000-0002-8290-1376)
Institutions
- Beijing University of Posts and Telecommunications (CN)
Publication Details
- Published
- 2024-08-19
- DOI
- https://doi.org/10.1109/blockchain62396.2024.00042
- Primary Topic
- Distributed systems and fault tolerance
- Type
- article
- Field-Weighted Citation Impact
- 0.00