Hacker News new | ask | show | jobs
by 1zael 24 days 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
1 comments

Claude code already fans out and sandboxes context by calling sub agents so I'm not sure this approach brings much benefit there. A complex search strategy only makes sense if the search is slow and compute intensive.
i find claude subagents are incredibly slow and the vast majority of that is inference time between tool calls