Gabriel AlmirPTBounded state
LRU and TTL make eviction and expiration part of behavior.
lab / implemented
Hush
What must a RESP-compatible server make explicit about memory and concurrency?
01 / Context
A compact implementation for investigating protocol, expiration, queues, and memory policies.
- Concurrency must not corrupt state.
- TTL and eviction need predictable semantics.
02 / Architecture map
Architecture map
- 01RESP
Protocol boundary.
- 02Concurrent queue
Orders access to state.
- 03LRU + TTL
Implemented behavior.
- 04No persistence
Known limit.
03 / Decisions
Decisions
Protocol before product
RESP defines the boundary; persistence and clustering are not implied.
Evidence
- Public codeRESP, LRU, TTL, queues, and concurrency implemented.
Known limits
- No persistence, authentication, or clustering.
- A laboratory, not a production Redis replacement.