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

内部For-Loop加速区块链挖矿

Inner For-Loop for Speeding Up Blockchain Mining

Tosin P. Adewumi, Marcus Liwicki

摘要:

在本文中,作者建议通过使用基于人口的方法来提高区块链挖掘的效率。区块链依赖于在将区块添加到链之前解决困难的数学问题,作为网络内的工作量证明。蛮力方法,被一些人认为是解决部分哈希冲突的最快算法,并在比特币区块链中实现,意味着穷举,顺序搜索。它涉及到将头部的nonce(数字)递增1,然后在每个实例中获取双SHA-256哈希值,并将其与目标值进行比较,以确定是否低于该目标值。它过度消耗时间和功率。因此,在本文中,作者建议对基于人群的方法使用内部for循环。比较表明,这是一种比蛮力稍快的方法,平均速度优势约为1.67%或每秒3,420次迭代,73%的时间表现更好。此外,我们观察到部署的总颗粒越多,性能越好,直到关键点。此外,建议通过使用共识惩罚来驯服网络(如比特币)过度使用电力。

英文摘要:

In this paper, the authors propose to increase the efficiency of blockchain mining by using a population-based approach. Blockchain relies on solving difficult mathematical problems as proof-of-work within a network before blocks are added to the chain. Brute force approach, advocated by some as the fastest algorithm for solving partial hash collisions and implemented in Bitcoin blockchain, implies exhaustive, sequential search. It involves incrementing the nonce (number) of the header by one, then taking a double SHA-256 hash at each instance and comparing it with a target value to ascertain if lower than that target. It excessively consumes both time and power. In this paper, the authors, therefore, suggest using an inner for-loop for the population-based approach. Comparison shows that it's a slightly faster approach than brute force, with an average speed advantage of about 1.67% or 3,420 iterations per second and 73% of the time performing better. Also, we observed that the more the total particles deployed, the better the performance until a pivotal point. Furthermore, a recommendation on taming the excessive use of power by networks, like Bitcoin's, by using penalty by consensus is suggested.

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

↑