In-place reducer with explicit retention bounds for long-running runtimes.
Allocation: new map entries + appended deltas; prune candidate vectors are allocated only
when a cap is exceeded.
Complexity: O(1) average map work per event, plus O(t) touched-thread item-cap checks
(t <= max_turns_per_thread after pruning), and O(n log n) only when sorting eviction
candidates for thread/turn/item pruning.