【Author】
Zhao, Qinglin; Tai, Xianqing; Yuan, Jianwen; Xu, Jie; Feng, Li; Ma, Zhijie
【Source】PEER-TO-PEER NETWORKING AND APPLICATIONS
【Abstract】Proof of work (PoW) is a popular consensus mechanism for blockchain. However, it, consuming huge computing resources, does not serve useful purpose beyond reaching a consensus. Recently, proof of useful work (PoUW) has been proposed to overcome the drawback of PoW. With PoUW, each miner spends almost all the time in doing useful work (e.g., data classification), and then competes for the winner by the number of its consumed CPU instructions. Therefore, the time of doing useful work is a salient factor which is newly introduced to PoUW. In this paper, focusing on the new factor, we first model the fork probability of PoUW and then quantify its system throughput. Our model takes into account various design parameters (including the time of doing useful work) and produces a closed-form expression of the system throughput. We then run extensive simulations that verify the accuracy and effectiveness of our theoretical model. This study is very helpful for providing theoretically-guided parameter configurations for PoUW.
【Keywords】Blockchain; Fork; System throughput; Consensus; Proof-of-useful-work
【标题】PoUW共识机制性能分析：分叉概率和吞吐量
【摘要】工作量证明（PoW）是一种流行的区块链共识机制。然而，它消耗巨大的计算资源，除了达成共识之外没有其他用途。最近，有人提出了有用工作证明（PoUW）来克服 PoW 的缺点。在 PoUW 中，每个矿工几乎将所有时间都花在做有用的工作（例如数据分类）上，然后根据其消耗的 CPU 指令数竞争获胜者。因此，做有用工作的时间是 PoUW 中新引入的一个显着因素。在本文中，针对新因素，我们首先对 PoUW 的分叉概率进行建模，然后量化其系统吞吐量。我们的模型考虑了各种设计参数（包括做有用工作的时间），并产生了系统吞吐量的封闭形式表达式。然后，我们进行了广泛的模拟，以验证我们的理论模型的准确性和有效性。这项研究对于为 PoUW 提供理论上指导的参数配置非常有帮助。
【关键词】区块链；叉;系统吞吐量；共识;有用工作证明
评论