Distributed algorithms are expressed as axiomatic theories in three-valued modal logic over semitopologies, with examples including Bracha broadcast and Crusader agreement, and all proofs formalized in Lean 4.
The latest gossip on BFT consensus
9 Pith papers cite this work. Polarity classification is still indexing.
9
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
roles
background 2polarities
background 2representative citing papers
Identifies concrete attacks from a malicious Provider on SAGA and proposes SAGA-BFT, SAGA-MON, SAGA-AUD, and SAGA-HYB mitigations offering different security-performance trade-offs.
FlexTender embeds endorsements into Tendermint consensus to enable flexible endorsement in order-execute blockchains, achieving up to 10.6x throughput gains over EOV in USDT workloads.
Reducer achieves optimal-complexity asynchronous MVBA with t < n/4 resilience using collision-resistant hashes and a new SMBA primitive; Reducer++ extends to near-optimal resilience via random-oracle hashes.
Bitcoin staking protocol enables trustless security sharing from Bitcoin to any PoS chain using double-authentication-preventing signatures, finality gadgets, and bi-directional timestamping, as shown by Babylon mainnet deployment.
OrbitBFT is a scalable hierarchical BFT protocol for LEO constellations that partitions into orbital planes for local consensus and adds resilient message routing, showing improved scalability, throughput, and latency over PBFT and HotStuff in Starlink-based simulations.
CoBRA extends any quorum-based SMR protocol to tolerate 1/3 Byzantine plus 1/3 rational validators via finalization changes and adds a recovery mechanism for higher fault levels with client reimbursement.
Optimal mechanisms for procuring hard computational work in adversarial blockchains incur loss scaling logarithmically with liveness-fault cost, with equilibria that designate one random primary worker and a committee fallback.
AMP is a multi-proposer extension to Tendermint that separates dissemination from agreement and provides bounded inclusion guarantees plus deterministic ordering over payloads from multiple sources.
citing papers explorer
-
Adversarial procurement in blockchains
Optimal mechanisms for procuring hard computational work in adversarial blockchains incur loss scaling logarithmically with liveness-fault cost, with equilibria that designate one random primary worker and a committee fallback.