Pick one and press Start, then click Next › to step through it.
Watch for
The final read returning the fresh value despite one replica having been offline for the write — the overlap guarantees it.
More about this scenario
You'll learn
Why R + W > N is the rule that guarantees you never read a value older than your last write.
How it runs
A write waits for W=2 acks; a read queries R=2 replicas and takes the newest. Because 2 + 2 > 3, the read set and the write set always share at least one replica — so a reader always sees the latest write.