标题： 基于投票的半并行工作量证明协议 显示英文标题

标题： Voting-Based Semi-Parallel Proof-of-Work Protocol

摘要： 并行工作量证明（PoW）协议被提出以提高Nakamoto共识的安全性保证、交易吞吐量和确认延迟。 在本工作中，我们首先考虑现有的并行PoW协议并开发硬编码的激励攻击结构。 我们的理论结果和仿真表明，现有的并行PoW协议比Nakamoto共识更容易受到激励攻击，例如，攻击的盈利能力阈值更小，并且会导致更高的相对奖励。 接下来，我们引入一种基于投票的半并行PoW协议，从大多数实际角度来看，该协议优于Nakamoto共识和现有的并行PoW协议，例如通信开销、吞吐量、交易冲突、协议的激励兼容性以及投票者和领导者之间的交易费用公平分配。 我们使用最先进的分析来评估协议的一致性，并考虑马尔可夫决策过程（MDP）模型来证实我们关于协议对激励攻击的弹性的主张。 显示英文摘要

摘要： Parallel Proof-of-Work (PoW) protocols are suggested to improve the safety guarantees, transaction throughput and confirmation latencies of Nakamoto consensus. In this work, we first consider the existing parallel PoW protocols and develop hard-coded incentive attack structures. Our theoretical results and simulations show that the existing parallel PoW protocols are more vulnerable to incentive attacks than the Nakamoto consensus, e.g., attacks have smaller profitability threshold and they result in higher relative rewards. Next, we introduce a voting-based semi-parallel PoW protocol that outperforms both Nakamoto consensus and the existing parallel PoW protocols from most practical perspectives such as communication overheads, throughput, transaction conflicts, incentive compatibility of the protocol as well as a fair distribution of transaction fees among the voters and the leaders. We use state-of-the-art analysis to evaluate the consistency of the protocol and consider Markov decision process (MDP) models to substantiate our claims about the resilience of our protocol against incentive attacks.