AI Coding Live News

ProgramGym Open-Sourced: Scaling 1,648 Verifiable Environments for Long-Horizon Program Reproduction Agents

Current software engineering benchmarks and training pipelines predominantly evaluate coding agents on localized bug fixing within existing repositories (such as SWE-bench) or isolated code snippet generation. They fail to teach agents how to explore unfamiliar reference systems, formulate architectural blueprints, and reproduce complete, multi-file software projects from scratch under long-horizon constraints. Researchers introduce ProgramGym (arXiv:2610.13395, repo: github.com/Acm1011/ProgramGym, dataset: ProgramGym/programgym-1648), an automated framework scaling verifiable training environments for program reproduction agents. ProgramGym consists of Program-Env, a feedback-driven engine that converts open-source repositories into verified runtime sandboxes paired with black-box test suites across C, C++, Go, and Rust (generating ProgramGym-1648), alongside Program-Agent, an iterative workflow enforcing role isolation across Analysis, Implementation, and Review stages with revision management. Fine-tuning Qwen3.8-27B on ProgramGym trajectories raises ProgramBench test pass rates from 34.87% to 42.84% (+7.97 points), outperforming GPT-5.4 under mini-SWE-agent (37.70%). Coupling SFT with the Program-Agent scaffold boosts performance to 56.25%, eclipsing Claude Opus 4.7 (50.90%) and Gemini 3.5 Flash (53.60%), with datasets and codebase open-sourced.

ProgramGym Open-Sourced: Scaling 1,648 Verifiable Environments for Long-Horizon Program Reproduction Agents

Key Takeaways

  • ProgramGym open-sources 1,648 verifiable multi-language environments for whole-program reproduction coding agents
  • Qwen3.8-27B-SFT achieves 42.84% on ProgramBench (+7.97 points), surpassing GPT-5.4 under mini-SWE-agent
  • Coupled with the Program-Agent scaffold, test pass rates reach 56.25%, outperforming Claude Opus 4.7 and Gemini 3.5 Flash
Read full story

GitSwarm Unveils Decentralized Compounding Inference: Multi-Agent Collaboration via Git Branching and Atomic Commits

Tackling long-horizon problem solving and scientific discovery requires computation to compound across successive attempts. While humans build upon partial proofs, failed experiments, and prior hypotheses, current test-time compute paradigms (e.g., MCTS and Best-of-N) isolate search trajectories into independent silos, discarding intermediate reasoning artifacts upon branch failure. Researchers introduce compounding inference and its open-source instantiation GitSwarm (arXiv:2610.04862). GitSwarm establishes an asynchronous multi-agent coordination architecture where homogeneous LLM agents collaborate through structured persistent memory hosted in a shared, branchable Git repository. Intermediate artifacts are preserved as atomic commits, while explicit semantic dependencies link cross-branch contributions, enabling agents to inspect, branch, verify, and synthesize past discoveries. Evaluated on rigorous long-horizon benchmarks, GitSwarm paired with GPT-5.5 solves all 30 problems on IMOProofBench-Advanced in a single execution run, and scores 79.4% on ProgramBench compared to 65.1% for the strongest reported baseline under identical budgets.

Key Takeaways

  • Introduces Compounding Inference and GitSwarm, converting transient test-time compute into persistent knowledge assets
  • Employs Git repositories as multi-agent memory, tracking atomic commits, semantic dependencies, and cross-branch merges
  • Solves 100% of IMOProofBench-Advanced problems with GPT-5.5 in a single run and achieves 79.4% on ProgramBench
Read full story
Linked Models & Agents: