Abstract
As used in practice, traditional consensus algorithms require three message delays before any process can learn the chosen value. Fast Paxos is an extension of the classic Paxos algorithm that allows the value to be learned in two message delays. How and why the algo-rithm works are explained informally, and a TLA+ speci¯cation of the
algorithm appears as an appendix.
1