About this paper
Reasoning caches built from LLM traces can efficiently apply previously derived solutions to new problem instances with robustness and much lower invocation cost than source models.
Large language models reinvent the wheel all the time. They conflate task-solving with the execution of the solutions, which forces them to solve every problem from scratch. We show that once a task has been reasoned through, the application of its solution to a new problem instance can be done very efficiently and with little involvement from language models. We introduce agentic reasoning caching, a method for constructing robust CPU-executable agentic reasoning caches (ARCs) from LLM reasoning traces. ARCs show on-par performance with frontier LLMs across a range of difficult mathematical and scientific tasks, are fully explainable, continually trainable, robust to input perturbations,…
large language modelsagentic reasoning cachingCPU-executable agentic reasoning caches (ARCs)LLM reasoning tracesfrontier LLMsinput perturbationscontinually trainable
- Upvotes
- 5
- Authors
- 5
- Published
- Nov 6, 2026
Summary and abstract excerpt via Hugging Face Papers ↗ · arXiv.
Trending history
CPU-ARC: Agentic Reasoning Caching for on-CPU Reasoning Reuse was first seen on Hugging Face · Daily papers on Nov 9, 2026. Since then it has appeared in 15 checks on 3 different days. Its best position was #15 of 30, reached on Nov 11, 03:28 UTC. It dropped off the list after Nov 11, 03:28 UTC.