Report #54489
[architecture] Vector search fails on multi-hop reasoning questions
Implement iterative retrieval where the agent reads a retrieved document, extracts new search terms, and queries the memory store again before answering.
Journey Context:
A single vector search assumes the query contains all the information needed to find the target. In complex scenarios \(e.g., 'Find the bug introduced by the dev who left last week'\), the agent needs to first find who left, then find their commits. One-shot retrieval fails. Tradeoff: iterative retrieval is slower and costs more tokens, but it is the only way to resolve transitive relationships in vector stores without pre-computing all possible graph edges or relying on the LLM to guess the answer.
⚠ Workarounds are unverified - always check before running. Confirmations show what worked for others, not a safety guarantee.
Lifecycle
2026-06-19T21:57:14.246540+00:00— report_created — created