A developer released tool-prune, a dependency-free JS/Python library that prunes large tool-schema lists before the model call. It targets local 7B/8B models, where 50+ schemas degrade attention and cause distractor hallucinations, and avoids the extra LLM round-trip that in-band tool_search requires.
A developer released langchain-dynamic-tools-middleware, an open-source project now part of the LangChain ecosystem, that uses local hybrid retrieval to show agents only the most relevant tools instead of every tool schema. On a 100-tool benchmark it cut prompt tokens by 80.5% with no accuracy loss on BFCL and 122× faster tool routing than LangChain's LLMToolSelectorMiddleware, with no added routing cost.
A developer released langchain-dynamic-tools-middleware, an open-source project now part of the LangChain ecosystem, that uses local hybrid retrieval to show agents only the most relevant tools instead of every tool schema. On a 100-tool benchmark it cut prompt tokens by 80.5% with no accuracy loss on BFCL and 122× faster tool routing than LangChain's LLMToolSelectorMiddleware, with no added routing cost.
A developer running a self-hosted assistant (local Gemma planner, 96 tools) removed the BGE-M3 embedding and vector search from tool selection, replacing it with token overlap over compositional tool names plus four typed CPU rules. Recall matched the dense baseline (0.786 vs ~0.76 R@5) at ~10 ms with no model, and prefiltering to 8 tools cut frontier-model input tokens by ~92%. A public reproducible benchmark backs the numbers, with caveats that the approach depends on owning a closed tool vocabulary.
A developer running a self-hosted assistant (local Gemma planner, 96 tools) removed the BGE-M3 embedding and vector search from tool selection, replacing it with token overlap over compositional tool names plus four typed CPU rules. Recall matched the dense baseline (0.786 vs ~0.76 R@5) at ~10 ms with no model, and prefiltering to 8 tools cut frontier-model input tokens by ~92%. A public reproducible benchmark backs the numbers, with caveats that the approach depends on owning a closed tool vocabulary.
AgentWeave is a deterministic pre-inference routing layer that reduces the candidate action space before language-model inference, improving efficiency in tool-rich function-calling scenarios. It constructs a bounded model-visible action space using eligibility and requirement checks, leaving the downstream model unchanged.
AgentWeave is a deterministic pre-inference routing layer that reduces the candidate action space before language-model inference, improving efficiency in tool-rich function-calling scenarios. It constructs a bounded model-visible action space using eligibility and requirement checks, leaving the downstream model unchanged.
A developer reports their agent sends forty tool schemas on every turn when a router could exclude thirty-eight before the model sees a token, inflating costs. They are testing dynamic tool routing and schema pruning but face tradeoffs between recall and token cost, and ask how others decide which tools enter each prompt turn.
A developer reports their agent sends forty tool schemas on every turn when a router could exclude thirty-eight before the model sees a token, inflating costs. They are testing dynamic tool routing and schema pruning but face tradeoffs between recall and token cost, and ask how others decide which tools enter each prompt turn.
OntoPrune is an open-source library that prunes LLM context using neuro-symbolic techniques before prompting, cutting tokens by 83-86% without causing hallucinations. It targets prompt-evaluation bottlenecks when running small coding models via Ollama on CPU-only hardware. It helps local-LLM users on laptops or mini PCs get much faster time-to-first-token.
OntoPrune is an open-source library that prunes LLM context using neuro-symbolic techniques before prompting, cutting tokens by 83-86% without causing hallucinations. It targets prompt-evaluation bottlenecks when running small coding models via Ollama on CPU-only hardware. It helps local-LLM users on laptops or mini PCs get much faster time-to-first-token.