- Clover-35B utilizes an MoE architecture with 35B total parameters and ~3B active per token.
- Achieved a median execution time of 1.52s in WindTunnel web agent benchmarks, over 2x faster than competitors.
- Successfully applies diffusion models to code generation, tool calling, and complex task planning, outperforming same-size autoregressive models.
AI CURATED HOT STORY · 10/28/2026
DiffuSpace Open-Sources Clover-35B, First MoE Diffusion LLM for Agents
Shenzhen-based DiffuSpace has open-sourced Clover-35B-A3B-Preview, the first large-scale diffusion language model (dLLM) to integrate a Mixture-of-Experts (MoE) architecture. With 35 billion total parameters and only 3 billion active per inference, it aims to break the serial bottleneck of autoregressive models through parallel decoding, marking a significant entry of diffusion models into high-performance AI agents.
Technically, Clover-35B demonstrates superior speed, generating at 680 tokens/s. In WindTunnel web agent evaluations, its median execution time is just 1.52 seconds—more than twice as fast as the Jev+Mercury combination—with higher success rates in code generation, tool calling, and complex task planning. These metrics confirm that the 'diffusion + MoE' approach can match or exceed autoregressive peers of similar size while offering substantial efficiency gains.
This development challenges the long-standing monopoly of autoregressive models on inference speed, providing developers with a more cost-effective foundation for real-time agents. By reducing latency in interactive AI applications, Clover-35B paves the way for broader industrial adoption of autonomous agents.
Hourly heat curve
21 fully observed hoursThe line compares only sources observed throughout; gap hours are interpolated to keep the trend continuous.
Coverage timeline
Total 2 reports · Latest first- 量子位官网T2·85 pts
- InfoQ 中文T2·85 pts
- First introduction of MoE architecture into large-scale diffusion language models, balancing parameter scale and inference efficiency
- Generation speed reaches 680 tokens/s, significantly outperforming traditional autoregressive serial decoding
- Performance meets or exceeds same-size autoregressive models in certain agentic tasks and general benchmarks