RKSC: Reasoning-Aware KV Cache Sharing and Confident Early Exit for Multi-Step LLM Inference
On the map: LLM reasoning → Test-time compute and efficient thinking
Abstract (arXiv)
We introduce RKSC (Reasoning-Aware KV Cache Sharing), a training-free inference framework that eliminates two structural redundancies in multi-branch LLM reasoning pipelines. ASKS (Attention-Similarity KV Sharing) computes the prefix KV cache once and broadcasts it to all semantically similar branches via hidden-state cosine similarity, strictly generalising the token-exact prefix caching used by vLLM and SGLang. CGEE (Confidence-Gated Early Exit) applies two complementary exit mechanisms: (1) it skips the verification forward pass entirely when generation confidence is decisive across branches, and (2) it terminates the verification pass at an intermediate layer when per-layer entropy stabilises, using lightweight hooks on the transformer backbone. RSBCM (Reasoning-Selective Block Cache Manager) prevents unbounded cache growth via attention-weighted depth-priority eviction. Across five model families (7B-10B), four benchmarks, and 1,000 evaluated problems, RKSC achieves a mean speedup of 3.008x over the No-KV baseline (peak 3.990x), a 1.66x mean improvement over vLLM-equivalent prefix caching, with a CGEE-induced error rate of only 0.37% (6 errors out of 1,616 verify calls). No fine-tuning or architecture changes are required. Code is available at https://github.com/AnirudhSekar/RKSC.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 19 of its 27 references that are in the map. First posted on arXiv 7 Jun 2026.
Builds on
19 of 27 references.
Closest ancestors · 4
Same direction, newest first
- 2025ReasonCache: Accelerating Large Reasoning Model Serving through KV Cache Sharing29 Jul
- 2025Dynamic Early Exit in Reasoning Models22 Apr
- 2024Do NOT Think That Much for 2+3=? On the Overthinking of o1-Like LLMs30 Dec
- 2023Tree of Thoughts: Deliberate Problem Solving with Large Language Models17 May
Other references · 15
- 2017Attention Is All You Needcited by 60,361
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2025Qwen3 Technical Reportcited by 8,820
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
- 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,708
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2023Let's Verify Step by Stepcited by 3,789
- 2023Mistral 7Bcited by 3,164
- 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,879
- 2024Qwen2 Technical Reportcited by 2,120
- 2022Fast Inference from Transformers via Speculative Decodingcited by 1,653
- 2023SGLang: Efficient Execution of Structured Language Model Programscited by 1,141
3 more
- 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Headscited by 843
- 2020DeeBERT: Dynamic Early Exiting for Accelerating BERT Inferencecited by 332
- 2022Confident Adaptive Language Modelingcited by 310
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026ArborKV: Structure-Aware KV Cache Management for Scaling Tree-based LLM Reasoning
- 2026KARA: Efficient Reasoning LLM Serving via Sliding-Window KV Cache Compression
- 2025Cache What Lasts: Token Retention for Memory-Bounded KV Cache in LLMs
- 2026Not All Thoughts Need HBM: Semantics-Aware Memory Hierarchy for LLM Reasoning
- 2025R-KV: Redundancy-aware KV Cache Compression for Reasoning Models
- 2025SkipKV: Selective Skipping of KV Generation and Storage for Efficient Inference with Large Reasoning Models
- 2025Lethe: Layer- and Time-Adaptive KV Cache Pruning for Reasoning-Intensive LLM Serving
- 2026Zipage: Maintain High Request Concurrency for LLM Reasoning through Compressed PagedAttention