LeverageAI · Retrieval Architecture

The Intent Compiler: Deterministic Fusion of Fuzzy Priors

📖 This article has an expanded ebook edition — read the full ebook.

The query is not the unit of work — the intent is. Run many AI-framed probes, fuse their graphs deterministically, and spend resolution only where independent routes converge.

You already know the broken ritual. Someone asks a real institutional question — not a trivia lookup, a multi-hop “what is going on here?” — and the agent does what agents are built to do: it searches. One good query. Ten ranked hits. A confident summary. Then a second search when the first feels thin. Then a third. By the end of the thread you have three answer-shaped lists and still no investigation. The human is left holding the real job: remembering why they asked, comparing overlaps, noticing what only one lens found, and deciding where to read deeper.

That is not a model failure. It is an architecture failure. The system treated the query as the unit of work. Investigations do not work that way. The unit of work is the intent.

Hold the intent and answer the intent — not the individual questions.

This article is the field manual for that reframe: an Intent Compiler. It runs many AI-framed probes in parallel, preserves query provenance, deterministically fuses their result graphs, detects convergence and useful divergence, and spends expensive resolution only where independent routes meet. The output is not a chat reply stitched from three tool dumps. It is an Intent Resolution Package — a single inspectable object that serves the parent purpose.

The origin story: preserve the intent, move the layer

The compiler did not begin as a multi-query product. It began as a design review that refused to treat the first mechanism as sacred.

I asked for a change early in a search pipeline — an idea I thought was interesting — and asked the model to critique it, invent alternatives, and smoke-test designs against the golden walk paths of real users. The original placement only helped marginally. The model kept the same conceptual idea, moved the intervention halfway through the search process, and used it to augment results rather than assist the initial ranking. Against the same historical walks, measured coverage moved from 13% to 83%.1

That number is not an industry benchmark. It is a design-loop measurement on real traces before any production code changed. The lesson is architectural:

Call the move an Intent-Preserving Layer Shift. It is the same permission doctrine later used at project scale in the Governance Barbell — tight intent, loose method — applied to retrieval itself.2 Without that permission, planning collapses into “implement the thing I just said.” With it, the system is allowed to challenge means while protecting purpose.

Key reframe

You are not asking AI to invent a better product fantasy. You are asking it to reposition a human insight to the layer where enough context exists for the insight to work — then measure that claim against traces you already own.

What shipped: bloom as an attention compiler

The layer-shifted idea became a feature inside every rich wiki search. The response stopped being “ten ranked pages, good luck walking.” It became a layered package:

Direct semantic results
        ↓
Halo: one-hop neighbour gists
        ↓
Recall: advisory candidates primary ranking may have missed
        ↓
Convergence: nodes repeatedly implicated across the result set
        ↓
Bloom: richer abstracts, claims, edges and paths for hotspots

The decisive layer is convergence. Once a seed set of pages exists, mapping over their actual graph relationships is deterministic. Fuzzy retrieval proposes candidates. Deterministic structure shows which other nodes the neighbourhood collectively points at. In one search about bloom and hotspot resolution, the direct hits included several project and concept pages — and the convergence layer identified a shared destination reached by five separate paths, then returned that node at higher resolution with the paths made explicit.1

That is structural corroboration, not another similarity score. It does not claim “this page is true.” It claims: given these returned pages, this other node is repeatedly implicated by their edges.

This is Progressive Resolution applied to retrieval: do not polish everything; increase resolution only where the structure of the problem warrants spend.3 Bloom is not smarter ranking. It is an attention compiler — it converts weak retrieval signals into a deterministic decision about where to spend context.

The result set first reveals where attention should concentrate, then the system increases resolution only at those points.

Scale the same idea: multi-query graph fusion

Single-query bloom still leaves a hole. If the agent must discover three dimensions of a problem, serial search burns conversation turns, returns three compressed packages, and forces the model to notice overlap in its head. Parallel tool use can cut research latency dramatically for breadth-first work — multi-agent research systems are built for pursuing independent directions at once — but parallelism without fusion just multiplies lists.4

The fix is architectural:

AI supplies several related search questions
        ↓
Searches run in parallel (provenance retained)
        ↓
Graphs are unioned into one result graph
        ↓
Cross-query and within-query convergence computed
        ↓
RAG supplies an advisory semantic signal
        ↓
Hotspots receive extra resolution
        ↓
One augmented evidence package returns

That is not “three searches faster.” It is multi-query graph fusion. Grouping the searches changes what can be known from them. Three independent lists are three lists. A merged graph with provenance is a new epistemic object — the same move as reading a closed email bundle instead of isolated messages.5

External research has been pushing the same direction from different doors: classical RAG pulls non-parametric memory into a single generation pass; GraphRAG-style systems use structure to improve comprehensiveness and diversity on sense-making questions; knowledge-graph retrieval has shown multi-hop gains over pure vector baselines in published evaluations.6,7,8 The Intent Compiler’s claim is more specific than “use a graph.” It is that many intent-serving probes must be fused before the second model pass, by deterministic code that owns provenance and attention budgets.

Four signals that earn bloom (and one that must not be discarded)

Once you have a merged graph, “relevant” is no longer a single score. The compiler distinguishes reasons to spend resolution:

SignalWhat it meansWhat it is not
Cross-query convergence Different formulations independently reach the same node. The same paraphrase repeated three times.
Within-query graph convergence Several returned pages point through explicit edges to one centre. A popularity contest of embedding scores.
Graph–RAG convergence Symbolic structure and semantic recall both implicate a region. Two independent external witnesses proving a fact.
Useful divergence A strong single-lens finding absent from other routes. Noise to be averaged away.

Worked shapes, not mythology:

This is where most “ensemble retrieval” talk goes soft. Agreement feels like proof. It is not. Graph and RAG inspect the same underlying material. Their agreement means: two different retrieval methods believe this region deserves inspection. It does not mean two independent witnesses established a claim. That is why RAG stays demoted to a sensor and a nudge, and why bloomed material must still descend to source before it becomes evidence.9,10

Graph–RAG agreement justifies inspection, never belief.

Deterministic Fusion of Fuzzy Priors

Name the doctrine properly.

Not every layer is exact. The model’s choice of probe questions is probabilistic. Embedding similarity is approximate. Approximate-nearest-neighbour cutoffs can jitter near the margin. And yet the pipeline can still be highly deterministic where it matters:

LayerCharacter
AI forms the Question PortfolioJudgement / variation
Embedding / semantic recallReproducible fuzzy sensor
Wiki edgesExplicit symbolic structure
Union, dedupe, provenanceDeterministic
Count independent routes and pathsDeterministic
Graph–RAG correlation nudgeDeterministic scoring over fuzzy inputs
Bloom threshold and resolution budgetDeterministic
AI synthesises the enriched packageJudgement

That is the Deterministic–AI Pendulum working correctly: AI judgment → deterministic compilation → AI judgment. The middle is not “more model.” The middle is software that refuses to lose provenance, refuses to spend context everywhere, and refuses to confuse sensor agreement with truth.

Serial multi-hop patterns that interleave retrieval and reasoning at every step are notoriously expensive in repeated model calls; fusing parallel probes into one package is a different cost shape for breadth-first investigation.11 You still pay for probes. You stop paying for rediscovering the graph in chat memory.

Product: the Intent Resolution Package

If the query is no longer the unit of work, the API should stop pretending it is. The ladder is:

  1. search(query) — compatibility surface; one string.
  2. wiki_search_many(queries[]) — explicit multi-query fusion.
  3. investigate(intent, questions?) — the real product: hold the parent intent, optionally seed probes, return a package.

The first model pass is a query planner, not an answerer. It produces a Question Portfolio: direct, alternate, mechanism, boundary, stakeholder, historical, contrarian, “what are we missing?” Critically, it has permission to invent probes the user did not type — provided they serve the held intent. Without that permission, multi-query degenerates into three paraphrases of the order. With it, you get independent routes worth fusing.12

The package itself should be inspectable:

ComponentPurpose
Held intentWhat the system believes the user is trying to know or decide
Question portfolio + coverage mapWhich aspects of the intent each probe served
Merged evidence graphUnion of pages, edges, routes with provenance
Convergence hotspotsMulti-route nodes with explicit paths
Minority findingsSingle-lens results preserved, not averaged away
RAG nudgesAdvisory candidates, typed below graph/source evidence
Bloomed regionsWhere resolution was spent and why
Known absencesParts of the intent the package could not close
Source receiptsWhat was actually opened and relied upon
SynthesisAnswer to the parent intent — not a concat of sub-answers

This is intent custody at investigation scale: the user’s sentence is transient; the held intent persists across generation, retrieval, fusion, bloom, source descent, and synthesis.13,14 The product principle is blunt: do not expose the organisation’s internal decomposition as the user’s problem. Inventing three searches, comparing them, detecting convergence, and reconciling conflict is machine work now.

The same compiler, different probes: multi-lens assurance

Once you see the architecture, the project-assurance isomorphism is obvious. A formal project report is the parent object. Delivery, technical, regulatory, workforce, and community questions are the portfolio. Soft-data graphs and hard-data checks are sensors. Intersections bloom. Minority concerns stay visible. Humans receive one review object that refuses to collapse into a single traffic light — the same operating spirit as Elastic Assurance’s compute-broadly, disclose-narrowly plane, and the multi-lens verification end of the Governance Barbell.15,2

Formal status: Green

Workforce query  → specialist concentration
Community query  → recurring unresolved engagement
Regulatory query → evidence depends on one contractor
RAG recall       → schedule-pressure language
Graph convergence→ all paths touch the same delivery package

Result: bloom that package for deeper assurance

None of the individual signals is a verdict. The intersection tells the system where more attention is economically justified. That is the Intent Compiler wearing an assurance badge — and it is the right bridge to a larger estate where cognition is scarce and must be spent on purpose. A companion piece in this series, the Cognition Scarcity Audit, develops that scarcity frame; this piece owns the retrieval compiler that makes multi-perspective work cheap enough to attempt.

File Back the Improvement to the Walker

There is one more twist. The usual File Back the Walk doctrine says: querying is ingestion in disguise — walk telemetry should improve the map.16 Here the recursion went further. Insights from the wiki about progressive resolution and advisory recall improved the retrieval apparatus itself. Future searches over that IP now inherit the improved cognition. The insight compiled into the cognitive apparatus that retrieves the insight.

File Back the Improvement to the Walker.

That is the recursive promise of an Intent Compiler living inside a living wiki-graph: not only better answers, but a better walker — deterministic fusion of fuzzy priors, again and again, with the parent intent held steady while the probes, the graph, and the attention plan get sharper.

What to build Monday

  1. Name the parent intent before the first search string. If you cannot state it in one sentence, you are about to answer the wrong unit of work.
  2. Authorise a Question Portfolio — including probes the user did not type — under tight intent, loose method.
  3. Run probes in parallel with query provenance retained on every node.
  4. Union graphs before the second model pass. Make the merged graph the object the synthesizer reads.
  5. Compute the four signals — cross-query, within-query, graph–RAG, useful divergence — as deterministic scores, not vibes.
  6. Bloom selectively. Spend context on hotspots; keep minority findings typed, not deleted.
  7. Drive bloomed claims to source. Sensor agreement is inspection, never belief.
  8. Return an Intent Resolution Package, not a chat summary of tool dumps.

The incumbent mental model says better investigation is a better single ranking of a better single query. Replace it. The query is a probe. The intent is the job. The compiler’s intermediate representation is a merged evidence graph. The output is one package that a human can audit — and a second model pass can judge — without reconstructing the investigation by hand.

References

  1. Scott Farrell / LeverageAI design-loop evidence (content source). Coverage shift 13%→83% against golden walk paths; five-path structural convergence bloom example. Internal design session, 2026 — shape-level measurement, not industry statistic.
  2. Scott Farrell, LeverageAI. “The Governance Barbell.” https://leverageai.com.au/wp-content/media/articles/140-governance-barbell.html — Project PR pattern; tight intent, loose method; multi-lens verification without one green light.
  3. Scott Farrell, LeverageAI. “Progressive Resolution.” https://leverageai.com.au/wp-content/media/articles/39-progressive-resolution.html — Coarse-to-fine work; increase resolution only after structure stabilises.
  4. Anthropic Engineering. “Building Effective Multi-Agent Research Systems.” https://www.anthropic.com/engineering/multi-agent-research-system — Multi-agent systems excel at breadth-first queries pursuing independent directions; parallel tool calling can cut research time substantially for complex queries.
  5. Scott Farrell, LeverageAI. “Your Life Compiles to One Language.” https://leverageai.com.au/wp-content/media/articles/104-life-compiles-to-one-language.html — Grouping changes epistemic quality; a closed bundle is a stronger object than isolated records.
  6. Lewis et al. “Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks.” https://arxiv.org/abs/2005.11401 — Classic RAG: parametric + non-parametric memory for generation.
  7. Edge et al. / Microsoft. “From Local to Global: A Graph RAG Approach to Query-Focused Summarization.” https://arxiv.org/abs/2404.16130 — GraphRAG improves comprehensiveness and diversity vs conventional RAG on sense-making questions.
  8. Gutiérrez et al. “HippoRAG: Neurobiologically Inspired Long-Term Memory for LLMs.” https://arxiv.org/abs/2405.14831 — Knowledge-graph retrieval outperforms vector RAG on multi-hop questions in reported evaluations.
  9. Scott Farrell, LeverageAI. “RAG Demoted to a Sensor.” https://leverageai.com.au/wp-content/media/articles/130-rag-demoted-to-a-sensor.html — Similarity as advisory sensor, not architecture or citable proof.
  10. Scott Farrell, LeverageAI. “The Nudge Doctrine.” https://leverageai.com.au/wp-content/media/articles/100-nudge-doctrine.html — Fuzzy signals as priors that shape attention, not verdicts.
  11. CompactRAG. “Reducing LLM Calls and Token Overhead in Multi-Hop Question Answering.” https://arxiv.org/abs/2602.05728 — Multi-hop RAG alternating retrieval and reasoning incurs repeated LLM calls and high token cost.
  12. Scott Farrell, LeverageAI. “The North Star Prompt.” https://leverageai.com.au/wp-content/media/articles/70-north-star-prompt.html — Tight intent, loose method; precision of purpose with latitude over route.
  13. Scott Farrell, LeverageAI. “Goal Formation Is the Scarce Resource.” https://leverageai.com.au/wp-content/media/articles/108-goal-formation-scarce-resource.html — Intent stewardship; hold higher-order purpose against premature specificity.
  14. Scott Farrell, LeverageAI. “The Personal Agent’s Three Jobs.” https://leverageai.com.au/wp-content/media/articles/112-personal-agents-three-jobs.html — Intent custody across understand, hold, watch, verify.
  15. Scott Farrell, LeverageAI. “Elastic Assurance.” https://leverageai.com.au/wp-content/media/articles/136-elastic-assurance.html — Compute broadly, disclose narrowly; multi-perspective assurance without collapsing risk into one colour.
  16. Scott Farrell, LeverageAI. “File Back the Walk.” https://leverageai.com.au/wp-content/media/articles/80-file-back-the-walk.html — Query walk telemetry improves the map; recursive improvement through use.