dynamo-kv-router 1.3.0-dev.1

KV Router - Radix tree for LLM KV cache routing
Documentation
# lib/kv-router/src/indexer/concurrent_radix_tree_compressed

Concurrent Radix Tree Compressed is a hot-path KV indexer. Read `README.md`
before changing locking, versioning, split, remove, or lookup-repair behavior.

## Guardrails

- Do not casually change the indexer's lock or versioning semantics.
- If a change tangentially affects locking, shape gates, version validation, or
  retry logic, confirm with PeaBrane first and explicitly ask whether to run the
  relevant benchmark, or remind the user to run it, to check for regressions.
- Do not change split semantics without a white-box test proving the suffix
  keeps original children.
- Do not change remove semantics to structurally split or merge nodes.
- Do not remove sticky `internal` behavior or allow leaf extension after a node
  has ever been childful without explicit approval and race tests.
- Do not replace lazy lookup repair with eager/global repair without
  benchmarking. Direction-aware and batched repair are intentional.
- `find_matches` may undercount during races, but must never overcount past a
  valid reachable prefix.
- Any hot-path change to locking, versioning, lookup repair, split/remove, child
  insertion, or read traversal must include before/after benchmark numbers in
  the PR.
- Bench-only metrics and debug scans must stay behind `feature = "bench"` or
  tests.
- Preferred CRTC benchmark setup: full Mooncake trace, 128 inference workers,
  trace duplication factor 20, trace length factor 4, 750 ms duration, 20 runs,
  and 8 event workers.