KV-cache reuse mechanisms increasingly expose priority, duration, offload, routing hints, scheduler modes, and event streams. These mechanisms help preserve reusable prefixes, but they do not by themselves define a portable contract for accepted future-reuse state when resident KV and active live KV cannot both fit. We introduce resident KV claims, a conformance contract that binds future-reuse intent to a materialization predicate, lifecycle state, active/resident feasibility outcome, and claim-level telemetry. In controlled vLLM allocator probes, a 60-block resident claim and a 70-block active prefill exceed an 80-block usable KV pool. Write no-admit prevents the active request from becoming future reusable state, but it still allows active allocation to evict residents from the shared pool. A minimal vLLM prototype shows that hard protected resident claims convert this failure mode into scheduler-visible active refusal with direct blocking-claim attribution. The result is not a production speedup or a new cache-replacement algorithm. It is a runtime contract that turns unreported resident loss into reconstructable active/resident arbitration. A companion MicroRuntime and vLLM litmus suite distinguish ordinary eviction, soft priority, write no-admit, accepted hard claims, materialization failure, demotion, expiry, active refusal, and trace-level outcome reconstruction.

翻译：KV缓存重用机制日益暴露优先级、持续时间、卸载、路由提示、调度器模式及事件流。这些机制有助于保留可重用的前缀，但在常驻KV与活跃实时KV无法共存时，它们本身并未定义一种可移植的契约来约束已接受的未来重用状态。我们引入居民KV声明，这是一种将未来重用意图与物化谓词、生命周期状态、活跃/常驻可行性结果及声明级遥测绑定的一致性契约。在受控的vLLM分配器探针实验中，60块居民声明与70块活跃预填充超出现有80块可用的KV池容量。写入拒绝策略阻止活跃请求成为未来可重用状态，但仍允许活跃分配从共享池中驱逐居民。一个最小化vLLM原型表明，硬保护居民声明可将此失败模式转化为调度器可见的活跃拒绝，并附带直接阻塞声明归因。其成果并非生产级加速或新型缓存替换算法，而是一个运行时契约，将未报告的居民丢失转化为可重构的活跃/居民仲裁。配套的MicroRuntime与vLLM石蕊测试套件能够区分普通驱逐、软优先级、写入拒绝、已接受硬声明、物化失败、降级、过期、活跃拒绝及痕