From repetition,
better tools.
Most LLM agents carry a fixed toolkit from first run to last, re-deriving the same multi-step sequences each time. This paper builds the system that notices the patterns and promotes them into callable, reusable tools.
Every run, the
same derivation.
Atomic tool calls are clean, debuggable, and composable. They are also repetitive in ways that cost reasoning budget and introduce failure paths the agent re-navigates from scratch on every run.
First surfaced in Tandemly Briefing — 2026-07-10.
A tool-using LLM agent has a toolkit: a set of callable functions with defined signatures. Each run, it reads a task, reasons about which tools to call and in what order, executes the sequence, and returns a result. The approach is flexible. It is also wasteful in a specific way.
If the same five-step sequence appears in most successful runs for a given task type, the agent re-derives it each time. It re-decides the order, re-handles the intermediate outputs, re-manages the chain. If the reasoning goes slightly wrong at step three, the task fails. If the sequence is long enough, the model loses track of where it is.
Standard responses to this problem fall into two camps. The first is hardcoded composite tools: a human notices the recurring pattern and writes a wrapper. That works, but it requires a human to identify the pattern and it produces a static library that does not evolve as tasks change. The second is better memory: context caching, vector stores, long-context windows. That preserves the information but does not shorten the reasoning chain. The agent still navigates the full sequence on every run.
Ding and colleagues from Renmin University of China and Alibaba Group ask a different question. What if the agent could do what the human engineer does: watch the successful runs, notice the recurring sequences, and promote them into first-class callable tools?
Can an LLM agent systematically mine its own successful trajectories, extract the recurring multi-step sequences, promote them into callable higher-order tools, and manage that tool library through a structured optimization cycle? And if so, does it help?
Three phases,
one lifecycle.
The paper draws an explicit parallel to ML training. The SOP tool lifecycle maps cleanly onto construction as data collection, execution as the forward pass, and optimization as the backward pass.
The core mechanism is a three-phase cycle that runs on top of a standard tool-using agent. The agent itself does not change in the first phase. It runs its tasks using its existing atomic toolkit, and at the end of each successful run, a separate mining step inspects the trajectory.
The mining step looks for multi-step sequences that appear repeatedly across runs. When a sequence crosses a frequency threshold, it becomes a SOP tool candidate: a named, callable wrapper that encapsulates the full sequence behind a single function call with a clean signature.
The analogy is not decorative. It identifies where each component sits in the system and what it is responsible for. Construction collects the data that informs what tools are worth building. Execution applies the current best knowledge to new tasks. Optimization updates the knowledge based on what execution reveals. Each phase has a different feedback signal and a different cadence, and conflating them creates architectural problems the paper is trying to avoid.
The admission step matters separately. A SOP tool promoted from a flawed trajectory embeds the failure path into the toolkit, where it can surface in future runs as an apparently valid option. The paper gates each candidate behind a unit test before registration, a pattern borrowed from software engineering rather than ML. Passing the test is a precondition for admission, not a quality signal after the fact.
Better tasks,
fewer rounds.
Evaluated on ACEBench, a benchmark for coding and reasoning agent tasks, across multiple backbone models. Task success improved across all tested backbones, and agents reached correct solutions in fewer interaction rounds.
The task success improvement ranges from 2.5 to 13.4 percentage points across the backbone models tested, but the direction is consistent. The SOP tool lifecycle adds value whether the base model is strong or weak. This matters because it suggests the gain comes from the toolset structure, not from the model learning new capabilities.
Beyond task success rate, the paper reports a reduction in interaction rounds per task. When the agent can invoke a SOP tool in a single action, it no longer spends reasoning tokens re-navigating the underlying sequence. The shorter action trace also reduces the surface for intermediate errors, which is a different benefit from the accuracy gain and one that compounds over longer task horizons.
The paper is careful to position this work relative to existing agent research. Harness-effect studies show that the scaffolding around a model matters as much as the model. Skill-routing research addresses how agents select from a fixed set of skills. The SOP tool lifecycle addresses something earlier: the composition and lifecycle of the toolset itself. The toolset is not fixed. It evolves as the agent encounters more tasks.
The evaluation is on ACEBench, a structured agent benchmark. Real production tasks tend to have more varied structure, noisier trajectories, and harder-to-define success criteria. The frequency thresholds for SOP promotion and the unit-test admission requirement are design choices whose sensitivity is not fully explored in the paper. Teams adopting the pattern should calibrate these against their own task distributions before treating the ACEBench gains as a deployment estimate.
What builders
can do with this.
The SOP tool pattern is an architectural intervention, not a model change. It can be layered on top of any tool-using agent that logs its own trajectories.
Where to go
from here.
Starting points for teams interested in implementing the SOP tool pattern in their own agent stacks.