vLLM says it served DeepSeek-V4.1-Flash at 954K tokens/s per GPU on one GB300 NVL72 rack, within 6% of DeepSeek's own engine
AspireAI community · Inferact and the vLLM Team
Inferact and the vLLM team report that a general-purpose vLLM build with prefill/decode disaggregation and Wide-EP reached 954K tokens/s per GPU on a single NVIDIA GB300 NVL72 rack running DeepSeek-V4.1-Flash on the SemiAnalysis AgentX agentic benchmark, at a P90 of 196 tokens/s per user, 7.9x their earlier single-node result, with a specialized decode path hitting 826 tokens/s for a single user. Against DeepInfer, the engine DeepSeek released for this model the same week, vLLM's decode throughput was within 6% across batch sizes 8 to 256. The post also documents why the model scales the way it does: 890 bytes per token of global KV cache, 2x attention compression on layers 2, 8 and 14, and a decode step that is 62% MoE-bound at 128K context. Caveat: the authors explicitly say their prefill setup differs from DeepInfer's, so they do not read the gap between the two curves as a speedup.
Read the story and explore more from the AspireAI community.
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.