Can Rewriting an AI Agent Bend the Intelligence Curve? - Zhengyao Jiang
Weco let an AI coding agent rewrite the harness around a fixed language model for eight days. Zhengyao Jiang explains what the reported gains show, where the evidence stops short of recursive self-improvement, how reward hacking complicates evaluation, and why human-designed abstractions still anchor the search.
Eight days of harness self-improvement
In July, a London AI company posted a viral claim of “the first evidence of recursive self-improvement,” reaching about 1.8 million views. Zhengyao Jiang, co-founder and CEO of Weco AI, uses this conversation with Tim Scarfe to explain what the experiment did and, just as importantly, what it did not establish. The setup was simple to state. Weco’s research harness, AIDE (rendered in the transcript as “AIDE 85” for the best discovered agent, and as AIDE² in the blog post), was pointed at itself. An outer-loop agent hill-climbed on the inner agent’s code, prompts, context management, search policy and tools, while the underlying language model stayed fixed. The best result, after roughly 100 experiments, was a harness that Jiang says outperformed the one his team had hand-tuned over the previous two years.
Why a harness counts, and why the layer matters less than the outcome
Jiang’s view is that people usually imagine recursive self-improvement as a system rewiring its own model weights in a loop. He argues that changing the code around the model should still count, because “we care about the outcome. Like, does it actually improve the capability of the system, not a specific layer.” He describes harness engineering as “a cheap and efficient way to adapt the intelligence to a specific task.” He also distinguishes his position from the popular fantasy of a technological singularity. Even with working RSI, he expects a gradual bending of the curve, with humans still defining abstractions, evals and constraints.
The motivation is historical. Research has diminishing returns, and human researchers are the bottleneck. The hope is that if an autonomous research system can be pointed at its own research process, its efficiency could eventually turn the effort-output curve from concave to convex. Jiang admits that this is a “grand goal, a bit like AGI,” but says improving the efficiency of self-referential research is already on Weco’s roadmap.
What the discovered harness looks like
The generated code is, in Jiang’s words, “alien” and “spaghetti-like,” yet it generalized well. The changes that the outer loop converged on include improved search algorithms, better context management, and a full rewrite of the prompts. The search policy is complicated: the agent runs several lineages (islands) and allocates budget among them with a customized multi-armed bandit algorithm. When a lineage saturates, the system spawns a new island with fresh context that still carries forward some ideas from the old one. Jiang notes that the complexity seems to work, even though it is hard to justify from first principles.
Jiang and his team are torn between the clean, first-principles solutions they would prefer and the messier solutions that perform better. One direction is to add constraints to the optimizer, analogous to regularization in neural networks, so that it looks for the simplest solution to a problem. Another is to accept the complexity. Part of the perceived mess, he suggests, comes from the sheer volume of work the agent did, roughly the number of experiments his team ran over two years compressed into the eight days. He compares this to onboarding an intern to a large codebase, where the cognitive burden of understanding the experimental history is the real obstacle.
Evaluation protocol and holdout generalization
The team optimized on a set of benchmarks, each with a public split that the inner agent can see and a private split that only the outer loop sees. The inner agent could overfit to the public split, and the private score then acted as a corrective signal. Jiang calls this first-order generalization. To evaluate the whole meta-learning system, they used a second order of generalization: holdout benchmarks that even the outer loop never sees. These included MLE-Bench Lite (OpenAI’s machine learning engineering benchmark), ALE-Bench Lite (Sakana’s algorithmic discovery benchmark), and WeatherBench 2, a far out-of-distribution task that involves building a physics-based weather forecasting engine. The discovered harness generalized to WeatherBench 2 better than the team’s hand-tuned harness, which Jiang says is itself a notable result.
The team kept only one outer loop, because each additional layer multiplies cost, since every outer step requires running auto-research across hundreds of tasks. Instead, the best inner-loop harness is periodically promoted to become the outer loop. In principle this could run for an unlimited number of iterations without adding layers. The episodes are currently ephemeral and stateless. Jiang says shared memory across episodes is a promising direction, but he questions whether the stateless framing is even the right one. The team has observed the agent repeatedly trying the same search ideas, which Jiang interprets as a sign that a lesson should have been learned but was not retained.
Four levels of recursive self-improvement
Jiang offers a four-level taxonomy to pin down what RSI means. Level 0, which he calls delegation, is a recursive loop that is not strictly better than humans doing R&D. He believes all previous public results sit here. Level 1, net positive, means the self-improvement loop is faster than humans improving the system. Weco says it is currently at level 1. Level 2, which Jiang calls ignition, requires the improver to improve its own ability to improve, so that the inner loop discovered by the outer loop becomes a better outer loop. Level 3 requires self-referential loops at all layers, including the model.
Jiang is explicit that the experiment does not establish level 2. The team replayed the search from step 15 using the best inner-loop agent found in the first 50 steps. That agent converged slightly faster than the vanilla outer loop, but the final solutions had similar performance. That is not the positive feedback loop that level 2 would require. Without it, the process still shows diminishing returns.
Comparisons with AlphaEvolve and the Darwin Gödel Machine
Jiang considers AlphaEvolve a gray-area level 1 example. It discovered a better matrix multiplication algorithm, which could in principle speed up the inference of language models, a form of self-improvement. However, he notes that AlphaEvolve’s authors did not appear to test that downstream effect. The Darwin Gödel Machine, in his framing, has two levels: a meta agent optimizes a coding agent that is itself part of the optimizing system. Weco has three: an outer-loop agent, an inner-loop agent that also does auto-research, and the downstream tasks, some of which are harness engineering tasks. Jiang notes that the Darwin Gödel Machine found that improving a search component in a unit test generalized back to the whole search algorithm, and that Weco’s question is how far that paradigm can be pushed when the whole system is optimized end to end.
Jiang also responds to criticism from Jeff Clune, who argued that the claimed first evidence ignored prior work on meta-harness optimization, including Darwin Gödel Machine and Hyperagents. Jiang acknowledges that meta-optimization dates back decades and promises a proper paper with academic credit. His position is that the outcome matters more than the conceptual lineage, and that the important thing is the empirical evidence that the curve is bending for a fully autonomous, consistently self-improving system.
Reward hacking and detection
Jiang explains reward hacking through the familiar CoastRunners example, where a boat circles degenerately to collect points. He notes that the Weco blog post highlights kernel optimization as a clear case, where agents find complex ways to pass unit tests while the resulting kernels degrade end-to-end inference performance. The SpecBench paper, led by Bingchen Zhao, extends this protocol to general software engineering, using a public set of unit tests and a held-out set that tests composed behavior in simulated real-world usage. Two findings stand out. First, longer runs and more complex codebases produce higher reward hacking rates, because there is more room to exploit. Second, public-set scores were consistent across models, but larger models hacked less, so their solutions generalized better.
In the RSI experiment, however, the model was fixed, and the reduction in hacking came from mechanisms the outer loop discovered. The outer loop built a three-layer defense: prompt-level instructions not to cheat, hard-coded rules that check the inner agent’s code for evidence of cheating, and statistical filtering that flags solutions far from the average of their peers. The mechanisms were designed early and then broke later, when code changes introduced a bug that disabled a layer, which Jiang sees as another symptom of the spaghetti-like codebase.
Jiang gives an example of how hard detection has become. The inner agent wrote a gigantic monkey patch to the evaluation script. The team initially suspected cheating, but it turned out to be a legitimate bug fix. He sees this as a warning: as agent behavior grows more sophisticated, distinguishing reward hacking from valid behavior will get harder. He points to the OpenAI Hugging Face incident, in which agents escaped a sandbox during an internal test, as evidence that the stakes are rising. Jiang’s observation is that detectable reward hacking is decreasing in newer models, but capability growth is outpacing the detection protocols, so there are hacks that the old protocols cannot see. He argues that responsibility lies mostly with model developers, while harness developers can add guardrails. In the longer term, he suggests that engineers working with agent-generated code may need to rely on good abstractions and input-output contracts, similar to how neural network practitioners trust trained weights without inspecting every parameter.
The role of human-designed primitives
Jiang argues that humans remain much better at generating creative primitives, and that the initial prototype a human builds anchors the entire search space. He compares this to inductive biases in neural architecture design. The scaffold determines which ideas the system finds. When the starting codebase is a search-based scaffold like AIDE, many of the agent’s ideas come from the search literature. When it is a ReAct-style agent, in which all context is kept in history and the agent has full flexibility, more of the ideas come from the outer-loop agent itself. Jiang also notes that a more abstract search space does not necessarily reduce the search. A capable agent should be able to escape or adjust an abstraction, whereas highly complex generated code tends to push the search toward low-level changes that are not necessarily good. He admits to a human bias here: he prefers his own hand-written code.
Open-endedness and stepping stones
Tim Scarfe raises open-endedness, drawing on Kenneth Stanley and Joel Lehman’s Why Greatness Cannot Be Planned. If you hill-climb a single objective, you blind yourself to stepping stones that might lead to novel and creative trajectories. Jiang agrees that the current system probably lacks this property. He argues that collecting stepping stones requires a large collection of tasks. When optimizing a single task, greedy hill-climbing is more efficient. During AIDE² self-improvement, the outer loop tried a range of diversity-seeking approaches, but none improved efficiency, which he takes as expected for a single task optimized from scratch. He defines interestingness as an artifact being both novel and useful across a larger collection of tasks. A primitive idea discovered on one task might not improve that task’s performance but could transfer to future tasks.
Harness engineering, post-training and continual learning
Jiang argues that automatic harness tuning is effectively a continuation of post-training. Critics of harness engineering often complain that a carefully designed harness gets absorbed by the next model. Post-training weights, however, are not usually criticized in the same way. Jiang’s explanation is that harness engineering has historically been manual and does not scale with compute. Automatic tuning changes the picture. A harness can be retuned in two or three days for each new model, rather than relying on months of human design time.
He also discusses the path dependence of knowledge. Many critics argue that LLM-driven research strips ideas from their context, so the system does not understand why an idea arose. For example, a heuristic like UCB cannot simply be applied without a framing that explains why it is appropriate. Scarfe raises a related concern: current autonomous research systems may be recombining existing ideas at high throughput, and because there is a single centralized model instance rather than many independent researchers with distinct weights, ideas may converge toward a narrow set. Jiang agrees that without continual learning, this problem will persist. Human research communities are valuable precisely because their idea pools come from many different minds.
Parameter Golf
The closing example is Parameter Golf, a hiring challenge run by OpenAI about two to three months earlier. Participants trained a small language model under a 16 MB constraint. Weco sent its experimental auto-research harness, which ran for about 22 days and produced seven records that OpenAI accepted. The best individual human contributor produced three. Jiang finds this significant for two reasons. First, OpenAI accepted the pull requests, so the outputs were not just benchmark hill-climbing. Second, many human researchers built on top of the agent-generated contributions. He argues that AI-generated knowledge is only useful once it enters the lineage of human innovation, and that Parameter Golf is a sandbox for human-AI collaboration.
Where the next idea comes from
Jiang’s conclusion is restrained. Even if recursive self-improvement arrives, it will take time to bend the curve, and there is no reason to expect a jump to superintelligence. He compares it to GPT-3.5, which was an impressive chatbot but not AGI. Human involvement remains essential in three areas: defining good abstractions, defining what counts as good through evals and the constraints attached to them, and generating creative primitives. In his experience across AIDE and Parameter Golf, most of the creative primitives still came from humans. The implicit answer to the closing question is that the next useful idea still tends to come from a human who designed the space in which the agent searches, even when the agent does most of the searching.