This paper presents a replication algorithm that implements a highly-available, non-deterministic state machine. Our algorithm generalizes the Paxos parliament algorithm of Lamport to cope with non-deterministic computations, while preserving its nice resilience and e ciency properties. The algorithm is surprisingly simple, thanks to the use of two powerful underlying abstractions: weak consens...