PARSEC v2.0 is a leaderless asynchronous BFT consensus algorithm with a claimed proof of correctness for <1/3 faulty nodes, using a common coin to achieve probabilistic agreement while respecting FLP impossibility, plus dynamic membership support.
Byzantine Agreement, Made Trivial
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Protocol for Asynchronous, Reliable, Secure and Efficient Consensus (PARSEC) Version 2.0
PARSEC v2.0 is a leaderless asynchronous BFT consensus algorithm with a claimed proof of correctness for <1/3 faulty nodes, using a common coin to achieve probabilistic agreement while respecting FLP impossibility, plus dynamic membership support.