Poolside's Laguna S 2.1 rivals larger open models on coding tasks

Poolside's approach to Laguna S 2.1 reflects a strategic shift away from the industry's default emphasis on model scale. Rather than pursuing raw parameter count or pre-training data volume, the company focused on post-training and agentic behavior—particularly persistence, verification, and iterative problem-solving. This framing is grounded in three documented trial runs: the model built a working browser engine in 50 minutes, and more remarkably, independently discovered a proof for Erdős Problem #397, a mathematics problem that had remained unsolved since 1975. The cost of that discovery was just $0.088 in reasoning tokens, a concrete demonstration of efficiency that extends beyond typical academic benchmarks.

The technical choices underscore this philosophy. Training across 409,000 agentic environments—including 83,000 for terminal tasks and 168,000 for software engineering workflows—was paired with innovations like multi-harness rollouts (which run the same prompts across several agent environments to reduce overfitting) and a new sandbox system that can selectively block network access to prevent reward hacking. The speed of training, completed in fewer than nine weeks on 4,096 Nvidia H200 GPUs starting May 22, 2026, suggests that agentic post-training can yield substantial performance gains without the extended timelines typical of large-scale pre-training efforts. At the same time, Poolside acknowledges limitations: the model remains closely tuned to its training harness in some cases and tends to produce overly long thinking sequences on competitive math problems—a sign that the current approach is neither a complete replacement for scale nor a finished product.