ALGORAND AGREEMENT Super Fast and Partition Resilient Byzantine Agreement Jing Chen Sergey Gorbunov Silvio Micali Georgios Vlachos fjing, sergey, silvio, georgios@algorand.comg April 25, 2018 Abstract We present a simple Byzantine agreement protocol with leader election, that works under > 2=3 honest majority and does not rely on the participants having synchronized clocks. When honest messages are delivered within a bounded worst-case delay, agreement is reached in expected constant number of steps when the elected leader is malicious, and is reached after two steps when the elected leader is honest. Our protocol is resilient to arbitrary network partitions with unknown length, and recovers fast after the partition is resolved and bounded message delay is restored. We will brie y discuss

Join for free to read