arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.04086cs.CR
收藏

Green-PoW:一种节能的区块链工作量证明共识算法

Green-PoW: An Energy-Efficient Blockchain Proof-of-Work Consensus Algorithm

Noureddine Lasla, Lina Alsahan, Mohamed Abdallah, Mohamed Younis

摘要:

本文选择通过合理地重新利用挖掘过程中消耗的功率来减轻区块链工作量证明(PoW)共识算法的能量效率低下。最初的PoW挖掘方案设计为一次考虑一个区块,并为计算竞赛的第一名获胜者分配奖励。为了减少与采矿相关的能量消耗,我们建议通过授予他们在下一轮中解决即将到来的块的排他性来补偿采矿轮的亚军的计算工作。这将大大减少下一轮中竞争节点的数量,从而减少消耗的能量。我们提出的方案将时间划分为时期,每个时期包括两轮挖掘;在第一轮中,所有网络节点都可以参与挖掘过程,而在第二轮中,只有亚军可以参加。因此,总的采矿能耗可以减少到接近$50\%$。据我们所知,我们提出的方案是第一个大大提高原始PoW算法的能耗。我们的分析表明,我们的计划在减少能源消耗的有效性,分叉发生的概率,在原来的PoW算法中提出的挖掘集中的水平,和交易审查攻击的影响。

英文摘要:

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 energy consumption can be reduced to nearly $50\%$. To the best of our knowledge, our proposed scheme is the first to considerably improve the energy consumption of the original PoW algorithm. Our analysis demonstrates the effectiveness of our scheme in reducing energy consumption, the probability of fork occurrences, the level of mining centralization presented in the original PoW algorithm, and the effect of transaction censorship attack.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑