Clock Drift Bounds and Linearizable Lease Reads in Multi-AZ Raft
Serving linearizable reads in Raft without a full quorum round-trip requires proving that no other node could have been elected leader since the read arrived. The classic ReadIndex optimization still pays one heartbeat RTT across availability zones, which adds 1.5–3.0 ms in typical metro clusters.
Bounding Monotonic Clock Skew
When using leader leases, the leader assumes its election timeout window \(T_{\text{election}}\) advances no faster on followers than on its own local monotonic clock scaled by the maximum hardware drift rate \(\epsilon\). By conservatively shrinking the lease duration:
lease_valid_until = last_quorum_ack_mono + (election_timeout / (1.0 + max_clock_skew)) - safety_margin;
And automatically falling back to batched ReadIndex whenever chrony reports root dispersion above 2 ms, we preserve strict linearizability while serving 99.4% of metadata lookups purely from local leader memory.