{
  "status": "research",
  "advantages": [],
  "limitations": [
    {
      "text": "An unavailable holder can delay affected writes until promises expire; clock-rate drift must remain within the timing guard.",
      "citationIds": [
        "quorum-leases"
      ]
    }
  ],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-16",
  "slug": "quorum-lease",
  "term": "Quorum lease",
  "aliases": [
    "Paxos quorum leases",
    "Quorum read lease"
  ],
  "definition": "A quorum lease lets designated Paxos replicas read leased objects locally while requiring synchronous notification before updates commit.",
  "note": "Grantors and holders are different sets: activation needs majority-backed promises, but the holder set can have any size. Accepted-but-unresolved commands must be settled before local reads. [quorum-leases]\n\nA multi-object write needs acknowledgements from the union of its objects' holder sets, as well as a Paxos majority. Separate majority-sized leases can therefore require all replicas for a combined write. [quorum-leases]\n\nSet example: among replicas 0-4, holders {0,1,2} and {0,3,4} cover all five. Enumerating the six three-member holder sets containing replica 0 gives 36 ordered pairs: 6 unions of size three, 24 of size four and 6 of size five. These are equally enumerated configurations, not workload probabilities. [union-model]\n\nA composite local read requires active leases for every queried object and atomic execution at one holder; otherwise it follows the Paxos path. The reported experiments covered single-object operations. [quorum-leases]",
  "related": [
    "paxos",
    "quorum-intersection"
  ],
  "citations": [
    {
      "id": "quorum-leases",
      "title": "Moraru, Andersen and Kaminsky. Paxos Quorum Leases: Fast Reads Without Sacrificing Writes. SoCC 2014, sections 3 and 5.",
      "url": "https://www.istc-cc.cmu.edu/publications/papers/2014/moraru-socc14.pdf",
      "accessed": "2026-11-16"
    },
    {
      "id": "union-model",
      "title": "Hesela: exact holder-set union enumeration (JavaScript source, Node.js)",
      "url": "https://hesela.dev/research/quorum-lease-unions.mjs",
      "accessed": "2026-11-16"
    },
    {
      "id": "union-data",
      "title": "Hesela: 36 enumerated holder-set pairs (JSON, not measured workload data)",
      "url": "https://hesela.dev/research/quorum-lease-unions.json",
      "accessed": "2026-11-16"
    }
  ],
  "provenance": [
    "The SoCC 2014 paper describes a research protocol. This record combines source synthesis with exact set arithmetic, not a distributed-system experiment."
  ]
}
