SWE-1.7, GPT-5.5급 성능 달성하다

Today, we’re launching SWE-1.7, the most capable model we’ve trained so far. It reaches frontier-level intelligence at a much lower cost, advancing the cost-performance Pareto curve. SWE-1.7 is the result of broad improvements across our RL pipeline: better infrastructure, more stable training, higher-quality data, and new techniques for long-horizon tasks. Since SWE-1.7 was trained from a Kimi K2.7 base, which had already undergone extensive RL post-training, the large additional gains from our own training challenge the idea of a ‘post-training ceiling’ and suggest that RL can push capabilities much further than previously believed. At Cognition, we have been formulating and refining principles for good agentic software engineering both in evaluation, with FrontierCode 1 , 2 , and now in training, with SWE-1.7. Our model is particularly optimized for longer-horizon asynchronous tasks, an important component of high-quality software engineering. SWE-1.7 is available today in Devin ( Web , Desktop , and CLI ) via Cerebras at 1000 TPS. We encourage you to try it for yourself! The rest of this post covers how we trained SWE-1.7: the infrastructure, algorithms, and data work behind our model. We cover four important components that stand out. Preserving entropy and stabilizing training: Long RL runs face two challenging problems: entropy collapse, and instability due to numerical drift between training and inference. We hunted down and addressed causes of each, which enabled training to keep improving well past where earlier runs stalled. Multi-cluster training and fault tolerance: RL doesn’t need all of its inference compute in one cluster. We trained on clusters across three continents, shipped weight updates through object storage, and built fault tolerance so that hardware failures never stalled the run. Curating high-quality data: We built an extensive data-quality pipeline that runs each task through automated execution tests, filters out tasks with low learning signal, and hardens tasks to prevent reward-hacking. Self-compaction for long-horizon tasks: The model learns to summarize its working state and resume from the summary, extending task horizons past the raw context window. We use an alternating length penalty to incentivize concise output without sacrificing correctness. Finally, we conclude by sharing some observations on interesting behavioral tendencies, such as careful exploration and concise reasoning, that the model acquired as a result of our training setup. Preserving Entropy and Stabilizing Training # We found training stability to be a key contributor to predictable improvement at scale. When training with asynchronous RL 3 , one of the most problematic issues we encountered was the KL divergence mismatch between inference and training 4 , since the trainer policy is usually different from the sampling policy. In the past, to correct for this (albeit at smaller scale), we used importance-sampling 5 and quantization-aware training for low-precision rollouts in NVFP4 + experts routing replay 6 , 7 . Here we present additional interventions that become more important at larger scale. We find that top-p sampling 8 contributes significantly to staving off entropy collapse 9 , 10 , where a strong model stops exploring and reward plateaus within a few hundred steps. Very low probability tokens are often part of trajectories that have gone off track or out of distribution. These trajectories are likely to produce low reward, and properties of the softmax function lead to these tokens sharpening the token probability distribution. Indeed, suppose we have three tokens with logits x 1 > x 2 ≫ x 3 x_1>x_2\gg x_3 x 1 ​ > x 2 ​ ≫ x 3 ​ and probabilities p i = e x i e x 1 + e x 2 + e x 3 p_i = \frac{e^{x_i}}{e^{x_1} + e^{x_2} + e^{x_3}} p i ​ = e x 1 ​ + e x 2 ​ + e x 3 ​ e x i ​ ​ , where token 3 is a low probability token that leads to low reward. If we sample token 3, the gradient of its logprob with respect to the logits x 1 , x 2 , x 3 x_1, x_2, x_3 x 1 ​ , x 2 ​ , x 3 ​ is: ∇ log ⁡ p 3 = ∇ log ⁡ [ e x 3 e x 1 + e x 2 + e x 3 ] = [ − p 1 − p 2 p 1 + p 2 ] \nabla \log p_3=\nabla\log \left[\frac{e^{x_3}}{e^{x_1}+e^{x_2}+e^{x_3}}\right]= \begin{bmatrix} -p_1 \\ -p_2 \\ p_1+p_2 \end{bmatrix} ∇ lo g p 3 ​ = ∇ lo g [ e x 1 ​ + e x 2 ​ + e x 3 ​ e x 3 ​ ​ ] = ​ − p 1 ​ − p 2 ​ p 1 ​ + p 2 ​ ​ ​ and the policy gradient update to the logits is Δ x i ∝ A ^ ∇ log ⁡ p 3 \Delta x_i \propto \hat{A}\ \nabla \log p_3 Δ x i ​ ∝ A ^ ∇ lo g p 3 ​ , where A ^ \hat{A} A ^ is the advantage of the sampled token. Since this trajectory earns low reward, A ^ < 0 \hat{A} < 0 A ^ < 0 and the updates are Δ x 1 ∝ ∣ A ^ ∣ p 1 , Δ x 2 ∝ ∣ A ^ ∣ p 2 , Δ x 3 ∝ − ∣ A ^ ∣ ( p 1 + p 2 ) . \Delta x_1 \propto |\hat{A}| \, p_1, \qquad \Delta x_2 \propto |\hat{A}| \, p_2, \qquad \Delta x_3 \propto -|\hat{A}| \, (p_1+p_2). Δ x 1 ​ ∝ ∣ A ^ ∣ p 1 ​ , Δ x 2 ​ ∝ ∣ A ^ ∣ p 2 ​ , Δ x 3 ​ ∝ − ∣ A ^ ∣ ( p 1 ​ + p 2 ​ ) . In these updates, x 3 x_3 x 3 ​ is penalized, and x 1 x_1 x 1 ​ grows more than x 2 x_2 x 2 ​ . Sampling x 3 x_3 x 3 ​ therefore widens the lead of the already-dominant token, sharpening the distribution and decreasing entropy. Top- p p p sampling prevents these low probability tokens from being sampled and used as optimization targets in the first place! This entropy-preservation effect makes top- p p p sampling desirable in our rollouts. But naively implementing top- p p p clearly increases the training-inference mismatch — the trainer computes probabilities as a selection from all tokens, while rollouts sample from the top- p p p subset, so the distributions have higher divergence, leading to collapse after a small number of steps. Thus, we implement sampling distribution replay 11 , where we record a kept-set of tokens available for sampling at rollout time, and renormalize probabilities with those masks in the trainer. With this fix, our run’s entropy stays roughly constant over the course of training and inference-training divergence stays bounded. Another interesting result of using top-p sampling replay is a targeting of only tokens with p < top_p_threshold p < \text{top\_p\_threshold} p < top_p_threshold . Tokens with probability above the threshold have a keepset of size 1, so their renormalized probability distribution is a constant 1, and gradients are zeroed out. We found empirically that a large fraction of the tokens sampled by the model are above standard top-p thresholds, so they are excluded from the overall gradient computation. This reduces gradient noise and lets the optimization algorithm focus on the high-learning signal tokens in the trajectory. We also find benefits from using the Muon optimizer 12 and eliminating non-deterministic operations in the trainer. Multi-cluster Training # Cognition is a fast-growing research lab entering an established landscape that is heavily compute-constrained. We aim to train trillion-parameter models, but today, large clusters with 10-100k chips on a single network fabric are a scarce resource. In contrast, smaller clusters around the world are abundant, if used together correctly. In this setting, the structure of RL works in our favor. RL decomposes naturally across multiple clusters. Only the trainer must live on a single high-bandwidth cluster. The inference engines that generate rollouts are self-contained. They can run anywhere and need nothing but the current weights. We invested in infrastructure that makes use of this property. Our RL training spans four datacenters across three continents, combining our own GPUs across multiple clusters with additional compute from inference providers like Fireworks. The result is that we can scale RL training far beyond what any single cluster would allow. The central challenge in this setup is keeping all inference engines up to date with the trainer weights after each optimizer step. We want these weight updates to be fast to reduce staleness of trajectories so we c