Performance-Analysis
Structural Memory Leaks: Binary Outcomes in Coarse-Grained Reclamation
Memory grows unbounded. Valgrind shows zero leaks. Research proves coarse-grained allocators have a binary asymptotic outcome: satisfy drainability for O(1) retention, violate it for Ω(t) growth. No middle ground.