An Adaptive Compute-and-Wait Proof-of-Work Framework for Energy-Efficient and Scalable Blockchain Consensus

Blockchain consensus algorithms must balance security, scalability, fairness, and energy efficiency. Compute-and-Wait Proof-of-Work (CW-PoW) organizes mining in short compute rounds. A round closes when NbrS solutions are visible, and only their authors continue. This paper analyzes five downsides of CW-PoW: latency inflation, parameter sensitivity, idle energy, communication overhead, and tie-breaking. Five remedies are specified and costed: adaptive parameter tuning, pipelined rounds with a commit-reveal round identifier, useful-work substitution, duty-cycling, and committee finalization. The finalization layer is positioned against existing constructions, and the security arguments are proof sketches. An event-driven model, checked against a threaded prototype, is used for the evaluation. At the same mean block time as PoW, CW-PoW consumes 71% to 95% less energy per miner and block for 10 to 1000 miners. Its 99th percentile of the block time is 61% to 70% shorter, and its mean block time does not grow with the number of miners. The fairness ratio of every hash-power decile lies between 0.85 and 1.17 for 100 and 1000 miners if NbrS≤Nm/4. The overlap of the header precomputation with hashing saves 5.7% of the energy, and the committee adds 1.0% to the latency.

Authors

Institutions

Publication Details

Journal
Network
Published
2026-11-18
DOI
https://doi.org/10.3390/network6040106
Primary Topic
Blockchain Technology Applications and Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

An Adaptive Compute-and-Wait Proof-of-Work Framework for Energy-Efficient and Scalable Blockchain Consensus

Mostefa Kara
1 links
Network
Blockchain Technology Applications and Security
article

An Adaptive Compute-and-Wait Proof-of-Work Framework for Energy-Efficient and Scalable Blockchain Consensus

Mostefa Kara
article en

Abstract

Blockchain consensus algorithms must balance security, scalability, fairness, and energy efficiency. Compute-and-Wait Proof-of-Work (CW-PoW) organizes mining in short compute rounds. A round closes when NbrS solutions are visible, and only their authors continue. This paper analyzes five downsides of CW-PoW: latency inflation, parameter sensitivity, idle energy, communication overhead, and tie-breaking. Five remedies are specified and costed: adaptive parameter tuning, pipelined rounds with a commit-reveal round identifier, useful-work substitution, duty-cycling, and committee finalization. The finalization layer is positioned against existing constructions, and the security arguments are proof sketches. An event-driven model, checked against a threaded prototype, is used for the evaluation. At the same mean block time as PoW, CW-PoW consumes 71% to 95% less energy per miner and block for 10 to 1000 miners. Its 99th percentile of the block time is 61% to 70% shorter, and its mean block time does not grow with the number of miners. The fairness ratio of every hash-power decile lies between 0.85 and 1.17 for 100 and 1000 miners if NbrS≤Nm/4. The overlap of the header precomputation with hashing saves 5.7% of the energy, and the committee adds 1.0% to the latency.

NetworkVol. 6(4)
University of Eloued (DZ)
Affordable and clean energy
Blockchain Technology Applications and Security
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.

Laika access coming soon