Upper bound probability of double spend attack on SPECTRE
Lyudmila Kovalchuk, Mariia Rodinko, Roman Oliynykov · 2020
We obtained analytical expressions of upper estimates for success probability of a double spend attack on DAG-based consensus protocol SPECTRE, depending on network parameters. Using such estimates, it is possible to evaluate the number of confirmation blocks that is sufficient for prevention of such attacks.