{"id":23033,"date":"2026-08-05T05:22:42","date_gmt":"2026-08-05T05:22:42","guid":{"rendered":"https:\/\/scannn.com\/mirrorcode-whats-the-largest-software-project-ai-can-complete-on-its-own\/"},"modified":"2026-08-05T05:22:42","modified_gmt":"2026-08-05T05:22:42","slug":"mirrorcode-whats-the-largest-software-project-ai-can-complete-on-its-own","status":"publish","type":"post","link":"https:\/\/scannn.com\/lv\/mirrorcode-whats-the-largest-software-project-ai-can-complete-on-its-own\/","title":{"rendered":"MirrorCode: What's the largest software project AI can complete on its own?"},"content":{"rendered":"\n
\n

AI has made rapid progress on software engineering benchmarks in the past few years. However, most such benchmarks tend to focus on shorter tasks like fixing bugs or implementing individual features. MirrorCode is our benchmark, co-developed with METR, to test AI models on long-horizon coding tasks. In a MirrorCode task, AI models are tasked with reimplementing an entire program end-to-end, without access to the original source code. AI-generated solutions must match the original program\u2019s output exactly on end-to-end tests, including held-out tests. MirrorCode\u2019s 25 target programs span different areas of computing: Unix utilities, data serialization and query tools, bioinformatics, interpreters, static analysis, cryptography, and compression.<\/p>\n

\n

How MirrorCode is different<\/h2>\n
\n
\n

Scale-aware evaluations<\/h3>\n

Crucially, we provide a large enough inference budget to make a serious attempt at MirrorCode tasks. Many existing software engineering benchmarks limit inference spending to around $1\u201310, even when the task would take weeks for a human to complete. For example, one of the largest MirrorCode tasks cost $2,600 for a single run and involved AI working for 19 days without human intervention.<\/p>\n<\/article>\n

\n

Difficult, but fair<\/h3>\n

Reimplementing entire programs is extremely challenging for human software engineers. We believe a human engineer without AI would take months to solve the most complex MirrorCode tasks. However, MirrorCode tasks are also feasible; we know that there is enough information for the tasks to be fair.<\/p>\n<\/article>\n

\n

Cheat-resistant by design<\/h3>\n

We sandbox AI models, requiring them to conduct their work without access to the internet, without access to the original codebase, and with no way to cheat on the task. There are end-to-end tests that models never see while developing their code, so they cannot simply create a lookup table to mimic the original program’s outputs.<\/p>\n<\/article><\/div>\n<\/section>\n

<\/p>\n

AI can already perform some long-horizon coding tasks<\/h2>\n

AI can already solve long-horizon MirrorCode tasks, despite their difficulty. For example, Claude Opus 4.7 reimplemented gotree: a bioinformatics toolkit with ~16,000 lines of Go and 40+ commands.1<\/a><\/sup> We believe this same task would take a human engineer without AI assistance 2\u201317 weeks. Opus 4.7 solved it in 14 hours, costing $251.<\/p>\n

One important caveat to these results is data contamination. Because MirrorCode tasks involve reimplementing open-source programs, AI models are likely to have seen the original codebases in pretraining. This might lead to inflated performance on the benchmark. However, AI successfully reimplemented several target programs that passed our memorization screen, and failed to reimplement programs where the screen showed evidence of memorization. This suggests that the results were not dominated by memorization, but we cannot rule out the possibility that memorization contributes to AI performance. Overall, we expect that the capabilities measured by MirrorCode would generalize to an unseen codebase. We discuss this further, along with more results and details on benchmark construction, in the paper<\/a>.<\/p>\n

<\/mdx-section>
\n<\/p>\n

Leaderboard<\/h2>\n

MirrorCode is not fully solved. For our regularly updated leaderboard, we report MirrorCode (ML, +Private, 2L)<\/strong>. This means we run the 15 target programs from the Medium and Large buckets, and drop the Small bucket. Each target program is evaluated in two implementation languages (generally Go and Ada) giving 30 tasks. We run each task three times, with a budget of 10 billion tokens and 7 days per attempt.2<\/a><\/sup><\/p>\n

<\/p>\n
\n