I found this approach very interesting and was wondering if it could be applied to grep-based search for coding agents to increase speed and reduce LLM turns, but the part im not quite understanding is how the model will know enough about the codebase to construct a complicated multi-stage search pipeline based just on the prompt.
Maybe this is just different from web search, but it seems like the model needs sequential tool calls to know where to look next, and coding agents have already put in a lot of work to encourage parallel tool calling.
1zael•1h ago
Yeah I think this maps onto grep-based code search well. Right now agents grep, read the results, grep again, and every hit lands in context. This architecture turns that into one program: fan out the greps, filter and dedupe in the sandbox, hand back only what matters. The "won't know the codebase" worry flips around too. The first program shouldn't be "find the bug," it should be "build me a map" (grep the file tree, import graph, symbols). That needs zero prior knowledge, then the model plans the real search over that map. So it's less about replacing sequential exploration and more about making each grep step way wider without flooding context
anthonypasq•2h ago
Maybe this is just different from web search, but it seems like the model needs sequential tool calls to know where to look next, and coding agents have already put in a lot of work to encourage parallel tool calling.
1zael•1h ago