distributed systems / LEVEL 4

The quorum with no intersection

EST.40 MIN

THEORY / RETRIEVAL

What to restore

Check read-write and write-write quorum intersection
Calculate tolerated unavailable replicas
Explain why CAP does not remove latency trade-offs without partitions

Quorum arithmetic is necessary, not sufficient

For N replicas, R + W > N forces a read quorum to overlap the last write quorum, while 2W > N forces two write quorums to overlap. These inequalities do not by themselves resolve concurrent versions, clock anomalies or stale membership.

CAP describes behavior during a partition

When communication is partitioned, a system cannot simultaneously guarantee linearizable consistency and availability for every request. PACELC adds the ordinary-state trade-off: even without a partition, stronger coordination usually costs latency.

CHECKPOINT

For N=5, which condition guarantees that every successful read quorum overlaps every successful write quorum?

Confidence: 3/5

02 / DEBUGGING

Find and fix the defect

Fix quorum assessment. Reject invalid sizes, use strict intersection inequalities, and report how many unavailable replicas each operation can tolerate.

Initializing editor…

CLOUD SANDBOXnetwork off · 256 MB · 12 s

1 / 64 KB

OUTPUT

Runner is waiting for a submission.