A
licenseNot graded
qualityB
maintenanceEnables inference engines to match longest common prompt token prefixes via a radix trie, so cached KV-cache blocks are reused instead of re-prefilled. This eliminates redundant prefill computation and lowers time-to-first-token, alongside paged attention allocation, speculative decoding verification, INT8 quantization, and latency telemetry.
7
MIT