A probabilistic set for estimating the frequency of elements within a time window to use as freshness metric for the TinyLFU [1] admission policy. Employing a Count-Min Sketch[2] where the counter matrix is represented by an array with length=width*depth. Width is at least the given capacity of the cache for accuracy, but is increased to the next power of two. The depth is 4 by default.