Skip to main content
← Lab

evictfaithful

confirmedcertificatePythonInference & servingJuly 19, 2026

the question

Which configurable eviction policies can a subtree-closed radix prefix cache actually deliver in the same order they would produce without the tree constraint?

what came out

A policy is faithful if and only if its priority key is path-monotone, key(parent) >= key(child) on every edge. LRU, LFU, SLRU, and priority qualify and are exactly the four CLI-exposed policies; FIFO, FILO, and MRU invert on some edge and are unfaithful. Verified against real SGLang with 0 inversions over 8.4M.

method & receipts

  • Result: confirmed
  • Tested — a correctness/benchmark suite ships alongside the code.

→ read the code and re-run it

github.com/v-code01/evictfaithful