论文标题
缠结2.0共识的鲁棒性
Robustness of the Tangle 2.0 Consensus
论文作者
论文摘要
在本文中，我们研究了拜占庭环境中缠结2.0共识方案的性能。我们使用基于代理的仿真模型，该模型结合了Tangle 2.0共识协议的主要特征。我们的实验结果表明，缠结2.0方案对诱饵和开关的攻击是强大的，直到对手33％的投票权重的理论上限。我们进一步表明，缠结2.0中的常见硬币机制对于对抗强大的对手来说是必要的。此外，实验结果证实，该方案可以在典型情况下达到约1秒的确认时间，并且非冲突交易的确认时间不受冲突的存在影响。
In this paper, we investigate the performance of the Tangle 2.0 consensus protocol in a Byzantine environment. We use an agent-based simulation model that incorporates the main features of the Tangle 2.0 consensus protocol. Our experimental results demonstrate that the Tangle 2.0 protocol is robust to the bait-and-switch attack up to the theoretical upper bound of the adversary's 33% voting weight. We further show that the common coin mechanism in Tangle 2.0 is necessary for robustness against powerful adversaries. Moreover, the experimental results confirm that the protocol can achieve around 1s confirmation time in typical scenarios and that the confirmation times of non-conflicting transactions are not affected by the presence of conflicts.
