arXiv：cs.CL· Zhenyu Zhang, Zhichao Cao·· 16 小时前
Delta Tokenizer：面向多核 CPU 长提示的会话增量参考一致分词与分段并行
Delta Tokenizer: Reference-Identical Tokenization of Session Deltas and Segment-Parallelism for Long Prompts on Multicore CPUs
AI 导读
Delta Tokenizer 是一款 CPU 分词前端，只对同一会话请求间的增量文本分词，相对 Hugging Face 参考分词器将会话轮次的分词速度提升约 40 倍。
正文
Abstract:An agent that drives an LLM sends the model the same conversation again and again, and each turn adds only a little text at the end. Inference engines reuse the KV cache of the shared prefix, so only the new tokens pass through the model. However, tokenization has no such shortcut. The CPU front end of the serving engine converts every request back into token IDs from its first character, which lengthens the time to first token (TTFT) and consumes CPU on every turn.
We present Delta Tokenizer, a CPU tokenization front end that tokenizes only the delta between a request and the previous request of the same session. It retains the earlier token sequence, encodes again only the appended text and the short tail whose tokens the append could affect, and joins the two only at a position the tokenizer's splitting rules themselves cannot move, which keeps the result exact. For long requests with no state to reuse, it cuts the text where practical tokenizers already keep neighboring pieces independent, encodes the pieces on several cores at once, and concatenates the outputs into the reference encoding, exactly. A shared CPU pool schedules these chunks together with the short incremental updates, so an update runs between two chunks rather than behind an entire long job.
The incremental path shortens the tokenization of a session turn by roughly 40x relative to the Hugging Face reference tokenizer, and on 16 cores the chunk-parallel path encodes a four-million-character request 8.2x faster than a serial encode and 1.6-2.1x faster than LoPT. Inside SGLang, Delta Tokenizer reduces the median TTFT through the chat interface by 59% at 100K tokens and brings the P99 TTFT of agent sessions down 9.5x under load and 23x when long requests tie up the front end. Every output we checked matches the reference, among them 41.8 billion documents encoded by its fast encoder.
| Comments: | 42 pages (16-page main text, references, and supplementary material), 14 figures, 35 tables. The incremental tokenization path and the fast encoder are open source in toktier at this https URL. The chunk-parallel path, the CPU pool scheduler, and the SGLang adapter will be released in the same repository |
| Subjects: | Computation and Language (cs.CL); Distributed, Parallel, and Cluster Computing (cs.DC); Performance (cs.PF) |
| Cite as: | arXiv:2610.19801 [cs.CL] |
| (or arXiv:2610.19801v1 [cs.CL] for this version) | |
| https://doi.org/10.48550/arXiv.2610.19801 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Zhenyu Zhang [view email]
[v1]
Wed, 14 Oct 2026 08:44:46 UTC (1,811 KB)
来源：arXiv：cs.CL · arxiv.org