How to live in a system which constructs massive amounts of cached state so it can probabilistically be optimal for what you think you might need. In an unconstrained tree of structure on disk, with some acquired adjunct behaviour around what we can call "guessing" which works fine on a small tree of things and is really going to have to say "this is going to be very slow, now I think I have 70,000 things to sort in a deep procedure call nest per thing"

But, its internally self consistent. And you can play towers of Hanoi alongside while it does its garbage collection. Or even load a diagnostic tool to watch garbage collection happening.