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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

WBRP: Consensus Algorithm Based on Weak Proof of Work

Zedong Wang, Wencheng Zhu, Hui Zhi, Jianing Li et al.
Distributed systems and fault tolerance
article

WBRP: Consensus Algorithm Based on Weak Proof of Work

Zedong Wang, Wencheng Zhu, Hui Zhi, Jianing Li, Jiarui Li, Dongbin Wang
article en

Abstract

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.

Beijing University of Posts and Telecommunications (CN)
Openalex Percentile: Top 83%
Distributed systems and fault tolerance
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

WBRP: Consensus Algorithm Based on Weak Proof of Work — Zedong Wang, Wencheng Zhu, et al. · (2024) | TGRS Research Map | TGRS