Context as Infrastructure: Knowledge Compilation for Retrieval in Agentic Systems with Harnesses

Zhichang Yu, Yingfeng Zhang and colleagues at InfiniFlow (the RAGFlow team) argue that once a search harness handles retrieval accuracy, the remaining problem is context cost, and they measure knowledge compilation as a supply layer for the harness.
Ask this paper
Harness baseline. A harness with only BM25/grep and MiniMax M3 answers 85% of BrowseComp-Plus and 91% of FRAMES with no vector or compiled index. The loop wastes context by repeating queries and rereading documents.
Negative result. Under a competent harness, summary trees, PageIndex outlines, wikis and graphs give no detectable accuracy gain on FRAMES, and a PageIndex-style outline degrades at scale.
Claim-evidence tree. A navigation tree with claim-evidence leaves cuts query tokens 91% when evidence suffices and adds 1.9% when it does not, a 38% average reduction. Break-even sufficiency is 2% and the measured rate is about 43%.
Latency tradeoff. Token savings cost extra retrieval rounds. On a paired subset tokens roughly halved while latency roughly tripled, and a decision gate cuts latency from 140 s to 30 s.
Abstract
Retrieval-augmented generation is becoming agentic. A search harness writes queries, reads results, reformulates, and decides when to stop. This largely solves accuracy: a harness with only BM25/grep and MiniMax M3 answers 85% of BrowseComp-Plus and 91% on multi-hop FRAMES in our runs, without compiled or vector indexes. It exposes a context problem: an undisciplined loop repeats queries, rereads documents, and fills the window with unused passages. The missing layer is knowledge compilation: a configurable ingestion pipeline where LLMs enrich documents with context no chunk contains alone--navigation hierarchies with claim-evidence leaves, entity graphs, timelines, mind maps, ontologies, wikis, and memory. Compilation is not a better retriever: under a competent harness, structural artifacts gave no detectable accuracy gain on FRAMES, and a PageIndex-style outline degraded at scale. It is a supply layer. A navigation tree whose leaves are claim-evidence pairs--the mechanism we measure--cuts query tokens by 91% when evidence suffices and adds 1.9% when it does not, a 38% average reduction; this implies a 2% break-even sufficiency rate and a measured rate near 43%. A decision gate cuts latency from 140 s to 30 s, though substitution's token saving is bought with retrieval rounds and carries its own latency cost. Other artifacts--ontology, graph, wiki, timeline, mind map, memory--pay off in deployment (governance, integration, onboarding, temporal orientation, continuity) where accuracy benchmarks cannot see them. We describe RAGFlow's pipeline and harness (open source at https://github.com/infiniflow/ragflow), which turns the loop into five disciplined stations and keeps the context entering the model the smallest sufficient set; together they form an agent-native database: a store that hands the agent compiled, governed context instead of a ranked list of passages.