A machine-checked ACL2 proof shows that a DAG-based BFT consensus protocol with dynamic stake never forks, provided faulty stake in every committee is below one third.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Formal Verification of Blockchain Nonforking in DAG-Based BFT Consensus with Dynamic Stake
A machine-checked ACL2 proof shows that a DAG-based BFT consensus protocol with dynamic stake never forks, provided faulty stake in every committee is below one third.