Xiaohongshu's DoSA cuts 1M-token TTFT by up to 48% with lossless sparse-attention indexer speedup

小红书技术REDtech · wechat · 2026-10-21

Xiaohongshu's Dots team released DoSA, tackling the bottleneck where the indexer in sparse attention (e.g., DeepSeek-V3.2's DSA) dominates long-context prefill—at 1M tokens it consumed 73–91% of prefill GPU time across three tested models.

Key idea: unlike approximations (layer reuse, fewer index heads) that can change Top-K selections, DoSA provably skips candidates that cannot make Top-K. It builds a threshold lower bound from the K-th best score among seed candidates, then constructs mathematically guaranteed upper bounds per candidate—only strictly-below-threshold candidates are excluded, keeping selection lossless.

Results: 97% of query-key candidate pairs skip full-head scoring on GLM-5.2; indexer speedups of 1.12–2.74x vs SGLang; end-to-end TTFT at 1M tokens reduced 37% (Dots3-Note-preview), 46% (GLM-5.2) and 48% (DeepSeek-V3.2). Open-sourced as dosa-sglang; paper arXiv:2610.13990.

Related event: Xiaohongshu Open-Sources DoSA, Cutting First-Token Latency by Up to 48%(2 posts)→

Original post →

More from Infra

Infra channel →