SimSD: Simple Speculative Decoding in Diffusion Language Models

The core technical challenge SimSD solves is non-obvious: speculative decoding in autoregressive models works because token generation is strictly left-to-right, making draft verification sequential and predictable. Diffusion models denoise all positions simultaneously, which breaks that assumption entirely and required a new verification scheme rather than a straightforward port.

This sits inside a broader cluster of inference efficiency work Modelwire has been tracking. The Majestic Labs Prometheus server story (also from June 1) frames the same problem from the hardware side, arguing that memory bandwidth constraints throttle token generation at scale. SimSD attacks the same bottleneck algorithmically, and the two approaches are complementary rather than competing. AdaCodec, covered the same day, pursues a parallel efficiency angle in video MLLMs by reducing token volume upstream. Together these stories suggest inference cost is now the primary engineering surface across the field, regardless of modality or architecture.

Watch whether a major dLLM project, such as the teams behind MDLM or Plaid, integrates SimSD-style verification and publishes wall-clock latency comparisons against autoregressive baselines on standard benchmarks within the next two quarters. Throughput gains on synthetic token counts mean little without end-to-end latency data on real hardware.