Research Article
Robustness of the Tangle 2.0 Consensus
@INPROCEEDINGS{10.1007/978-3-031-31234-2_16, author={Bing-Yang Lin and Daria Dziubałtowska and Piotr Macek and Andreas Penzkofer and Sebastian M\'{y}ller}, title={Robustness of the Tangle 2.0 Consensus}, proceedings={Performance Evaluation Methodologies and Tools. 15th EAI International Conference, VALUETOOLS 2022, Virtual Event, November 2022, Proceedings}, proceedings_a={VALUETOOLS}, year={2023}, month={5}, keywords={Simulation Consensus protocol Leaderless Security Fault-tolerance Directed acyclic graph}, doi={10.1007/978-3-031-31234-2_16} }- Bing-Yang Lin
Daria Dziubałtowska
Piotr Macek
Andreas Penzkofer
Sebastian Müller
Year: 2023
Robustness of the Tangle 2.0 Consensus
VALUETOOLS
Springer
DOI: 10.1007/978-3-031-31234-2_16
Abstract
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 1 s confirmation time in typical scenarios and that the confirmation times of non-conflicting transactions are not affected by the presence of conflicts.
