--- title: "Quorums, Leases and Changing the Membership" description: "A majority is one point on a curve: any read set and write set that intersect will do, and the choice moves cost between reads and writes. A lease buys a leader a bounded window of authority, and chan" canonical: https://lightmysky.com/learn/computing/quorums-leases-and-changing-the-membership-mt_2uRmRqFutD source: https://lightmysky.com/learn/computing/quorums-leases-and-changing-the-membership-mt_2uRmRqFutD.md retrieved: 2026-11-12 --- > **Agent view.** This is the Markdown twin of the page, for tools and assistants. > When to use this site, and the call that answers each job: https://lightmysky.com/agent-instructions.md > API description (OpenAPI 3.1): https://lightmysky.com/openapi.json · Authentication: https://lightmysky.com/auth.md > Pricing: https://lightmysky.com/pricing.md · Catalog: https://lightmysky.com/llms.txt · Full catalog: https://lightmysky.com/llms-full.txt > Every machine-readable file on this domain: https://lightmysky.com/.well-known/ai-catalog.json > Ask for Markdown with `Accept: text/markdown`, a `.md` address, or `?mode=agent`. # Quorums, Leases and Changing the Membership A majority is one point on a curve: any read set and write set that intersect will do, and the choice moves cost between reads and writes. A lease buys a leader a bounded window of authority, and changing the member set safely needs a protocol of its own. Subject: Computing · Area: Networks & Security · Ages 22 to 23 Page: https://lightmysky.com/learn/computing/quorums-leases-and-changing-the-membership-mt_2uRmRqFutD ## Ready when they can - Choose read and write quorum sizes for a stated read-heavy workload and justify them - Say what a lease assumes about clocks and what breaks when that assumption fails - Explain why adding and removing members in one step can split a cluster ## Lesson: Quorums, leases and new members A majority is one point on a curve. Any read set and write set that intersect will do, and the choice moves cost between reads and writes. For five nodes with a read quorum of 2, the write quorum must exceed 3, so 4 is the smallest that still overlaps every read. **Example.** A read-heavy shop picks read quorum 2 and write quorum 4 on five nodes. Every 2-node read meets every 4-node write in at least one node, so reads stay cheap while writes pay the price. Check the maths the same way every time: read plus write must exceed the node count. *(drawing: Five nodes: a write reaches 4 and leaves 1 out. A read of 2 nodes cannot fit inside that 1, so it touches a written node.)* A lease buys the leader a bounded window of authority without asking anyone, which quorums alone cannot give. It assumes clocks stay roughly in sync. When clocks skew, two leaders can believe themselves in charge at once. Changing members needs care. Say A, B and C grow to A, B, C, D and E. Nodes switch at different moments. A and B can still count 2 of 3 as a majority and elect one leader. C, D and E can count 3 of 5 and elect another. No node sits in both groups, so two leaders rule at once. The safe way uses a joint stage first, where every decision needs a majority of the old set and of the new set. Then the cluster moves to the new set alone. **Tip.** Change the member set in stages, never in one jump. At every stage, check that old and new majorities overlap. **Recap.** Intersecting quorums trade read cost for write cost, leases rent authority on clock trust, and membership changes go stepwise. *Lesson, quiz and flashcard text written for this dataset and revised in the P25 source pass.* ## Practice 8 questions on this page, each with its working shown. ## Needs first - [Raft: Leader Election and Log Replication](https://lightmysky.com/learn/computing/raft-leader-election-and-log-replication-mt_JdHtEJSPSP) ## Opens up - [Linearizability and Checking a History](https://lightmysky.com/learn/computing/linearizability-and-checking-a-history-mt_lTaHmlGtuo)