We present GLM-5, a next-generation foundation model designed to transition the paradigm of vibe coding to agentic engineering. Building upon the agentic, reasoning, and coding (ARC) capabilities of its predecessor, GLM-5 adopts DSA to significantly reduce training and inference costs while maintaining long-context fidelity. To advance model alignment and autonomy, we implement a new asynchronous reinforcement learning infrastructure that drastically improves post-training efficiency by decoupling generation from training. Furthermore, we propose novel asynchronous agent RL algorithms that further improve RL quality, enabling the model to learn from complex, long-horizon interactions more effectively. Through these innovations, GLM-5 achieves state-of-the-art performance on major open benchmarks. Most critically, GLM-5 demonstrates unprecedented capability in real-world coding tasks, surpassing previous baselines in handling end-to-end software engineering challenges. Code, models, and more information are available at https://github.com/zai-org/GLM-5.
核心贡献 · Key contributions
提出 GLM-5,一个 744B 参数的基座模型,实现从 vibe coding 到智能体工程的范式转变。 Proposes GLM-5, a 744B-parameter foundation model transitioning from vibe coding to agentic engineering.
采用 DSA(DeepSeek 稀疏注意力)降低训练和推理成本,同时保持长上下文保真度。 Adopts DSA (DeepSeek Sparse Attention) to reduce training and inference costs while maintaining long-context fidelity.
实现异步强化学习基础设施,将生成与训练解耦,提升后训练效率。 Implements asynchronous reinforcement learning infrastructure decoupling generation from training for efficient post-training.
引入新型异步智能体强化学习算法,从复杂长程交互中学习。 Introduces novel asynchronous agent RL algorithms for learning from complex, long-horizon interactions.
在主要开放基准和真实编码任务上达到最先进性能。 Achieves state-of-the-art performance on major open benchmarks and real-world coding tasks.
在七个国产芯片平台上实现全栈适配中国 GPU 生态系统。 Full-stack adaptation to Chinese GPU ecosystems across seven domestic chip platforms.
局限 · Limitations
DSA 训练需要两阶段预热和稀疏适应,增加了复杂性。 DSA training requires a two-stage warm-up and sparse adaptation, adding complexity.