Status: IN
The codebase demonstrates both strategies for derived state maintenance — eagerly rebuilding on every write (autocomplete caches, leaderboard reindexing) and lazily deferring computation to reads (time decay, expiration, balance derivation) — showing that write-vs-read cost allocation is a deliberate per-use-case design choice, not a single architectural pattern.
These two depth-1 conclusions represent opposite strategies for the same problem (when to compute derived state), revealing a spectrum rather than a convention
Depends on (SL): eager-rebuild-trades-write-cost-for-derived-consistency, lazy-read-time-evaluation-trades-write-simplicity-for-read-cost