Status: IN
The codebase systematically accepts information loss for bounded resource consumption through two complementary mechanisms: deterministic truncation (fixed-capacity deques and version lists silently dropping oldest entries) and probabilistic approximation (HyperLogLog, Morris counters, SimHash trading exact answers for space-efficient estimates), establishing a consistent architectural preference where memory guarantees take precedence over data completeness or computational accuracy.
Deterministic truncation and probabilistic approximation are two faces of the same bounded-memory commitment
Depends on (SL): bounded-collections-trade-completeness-for-memory, probabilistic-structures-trade-accuracy-for-space