Green-PoW: An Energy-Efficient Blockchain Proof-of-Work Consensus Algorithm
Noureddine Lasla, Lina Alsahan, Mohamed Abdallah, Mohamed, Younis

TL;DR
This paper introduces Green-PoW, an energy-efficient blockchain consensus algorithm that reduces energy consumption by rewarding runners-up and limiting mining to fewer nodes, nearly halving energy use while maintaining security.
Contribution
It proposes a novel PoW scheme that significantly decreases energy consumption by restructuring mining rounds and rewarding non-winning miners, a first in this domain.
Findings
Reduces energy consumption by approximately 50%
Lowers fork probability and mining centralization
Mitigates transaction censorship risks
Abstract
This paper opts to mitigate the energy-inefficiency of the Blockchain Proof-of-Work (PoW) consensus algorithm by rationally repurposing the power spent during the mining process. The original PoW mining scheme is designed to consider one block at a time and assign a reward to the first place winner of a computation race. To reduce the mining-related energy consumption, we propose to compensate the computation effort of the runner(s)-up of a mining round, by granting them exclusivity of solving the upcoming block in the next round. This will considerably reduce the number of competing nodes in the next round and consequently, the consumed energy. Our proposed scheme divides time into epochs, where each comprises two mining rounds; in the first one, all network nodes can participate in the mining process, whereas in the second round only runners-up can take part. Thus, the overall mining…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
