LRU Eviction Proof Overview
This interactive lab connects two independent WebSocket clients (Alice and Bob) using the jsonrpc subprotocol.
It executes a deterministic 8-step proof demonstrating that reading a key refreshes recency, inserting into a full 3-item cache evicts the least-recently-used key, and explicit publishing fans out to all subscribers.
Demo Boundaries: Process-local LRU cache; single process worker; contents reset on server restart; cache operations and publishing are separate non-atomic steps.