Instant Finality in Byzantine Generals with Unknown and Dynamic Participation

authors: Dahlia Malkhi, Atsuki Momose, Ling Ren

In our post on, we present a remarkably simple solution for the Byzantine Generals problem with deterministic and unconditional Safety guarantees in a setting that has Unknown and Dynamic Participation, but without the energy consumption of proof-of-work and or the long latency of longest chain protocols. With this, we remove the biggest obstacles of Nakamoto Consensus, which are probabilistic finality, high latency, and energy consumption of proof-of-work, while retaining key tenets of the permissionless model.

Read more in our whitepaper