Pith. sign in

REVIEW 2 cited by

Flexible Paxos: Quorum intersection revisited

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1608.06696 v1 pith:LMMUTU5N submitted 2016-08-24 cs.DC

classification cs.DC
keywords paxosquorumsflexibledistributedphasessystemsalgorithmconsensus
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Distributed consensus is integral to modern distributed systems. The widely adopted Paxos algorithm uses two phases, each requiring majority agreement, to reliably reach consensus. In this paper, we demonstrate that Paxos, which lies at the foundation of many production systems, is conservative. Specifically, we observe that each of the phases of Paxos may use non-intersecting quorums. Majority quorums are not necessary as intersection is required only across phases. Using this weakening of the requirements made in the original formulation, we propose Flexible Paxos, which generalizes over the Paxos algorithm to provide flexible quorums. We show that Flexible Paxos is safe, efficient and easy to utilize in existing distributed systems. We conclude by discussing the wide reaching implications of this result. Examples include improved availability from reducing the size of second phase quorums by one when the number of acceptors is even and utilizing small disjoint phase-2 quorums to speed up the steady-state.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Crossword: Adaptive Consensus for Dynamic Data-Heavy Workloads

    cs.DC 2025-09 conditional novelty 8.0 of 10

    Crossword adaptively balances per-server shard count and quorum size for each consensus instance to cut critical-path bandwidth while preserving classic fault tolerance and adding graceful leader failover via follower...

  2. Bodega: Serving Linearizable Reads Locally from Anywhere at Anytime via Roster Leases

    cs.DC 2025-09 conditional novelty 7.5 of 10

    Bodega uses all-to-all roster leases to let any chosen replica serve linearizable reads locally even when writes are concurrent, cutting average client read latency 5.6x to 13.1x in tests.

Pith tools