REVIEW 2 cited by
BlockBPE: Parallel BPE Tokenization
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
BlockBPE: Parallel BPE Tokenization
read the original abstract
Tokenization is a critical preprocessing step in large language model pipelines, yet widely-used implementations remain CPU-bound and suboptimal for batch inference workflows on GPU. We present BlockBPE, a parallel GPU implementation of byte-pair encoding (BPE) that achieves near linear-time complexity under realistic assumptions and is optimized for high-throughput, batch inference. Unlike existing Rust-based tokenizers such as HuggingFace Tokenizers or OpenAI's tiktoken-whose runtimes are dominated by Regex pre-tokenization and exhibit $O(n \log n)$ runtime-BlockBPE eliminates the Regex pre-tokenization which leads to small loss in generation quality, but enables highly parallelized token merges within thread blocks, reducing overall complexity to $O(nd)$ where $d \ll n$. On high-batch inference workloads, BlockBPE achieves up to 2x higher throughput than tiktoken and 2.5x over HuggingFace Tokenizers.
Forward citations
Cited by 2 Pith papers
-
TokTier: Exact Stateful CPU+GPU Tokenization for Agentic LLM Serving
Coding-agent prompts can be re-tokenized incrementally or on a GPU without changing token IDs, cutting front-end tokenization from O(full context) to O(append).
-
TokTier: Exact Stateful CPU+GPU Tokenization for Agentic LLM Serving
A stateful tokenizer that re-tokenizes only the appended region of a growing agent session — with a check that output equals full reference tokenization — cuts time-to-first-token by 16–34% in vLLM tests.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.