Logographic languages look like they should compress agent prompts, but BPE tokenization fragments them into per-byte pieces: GLM-5 encodes Chinese at 0.98x the English token count, while MiniMax-2.7 inflates to 1.28x. The round-trip translation overhead (Chinese reasoning to English output) taxes every step of the agentic loop. The cost model and the empirics, side by side.
A Simplified Chinese character can encode an entire semantic concept in a single logogram. English spreads the same concept across multiple characters, spaces, and grammatical particles. The arithmetic looks obvious: instruct an agentic LLM to conduct its chain-of-thought reasoning in Chinese, and the context window holds more reasoning per token.
Practitioners call this "vibe coding." The tokenizer does not cooperate.
Modern LLMs do not process raw characters. They process tokens produced by Byte-Pair Encoding (BPE), a statistical compression algorithm trained predominantly on English-heavy internet corpora. BPE builds its merge table from co-occurrence statistics in the training distribution, so it compresses frequent English words into single tokens efficiently. Chinese logograms, underrepresented in the training distribution, get fragmented into multiple sub-word units or raw bytes.
Ahia et al. (2023) and Petrov et al. (2023) quantify the disparity directly. For many Western LLMs, encoding Simplified Chinese requires two to three times as many tokens as encoding the equivalent semantic content in English. The character-level density that makes the hypothesis appealing is consumed by the tokenizer before the model sees it.
The distinction is between morphosyntactic density (characters per concept, a property of the writing system) and tokenization density (tokens per concept, a property of the model's vocabulary). Chinese wins the first metric. English wins the second on most production models.
Whether Chinese saves tokens at all depends on the specific model's vocabulary allocation. Ren et al. (2026) tested the vibe-coding hypothesis empirically across multiple models and found the efficiency to be entirely model-dependent:
The token count is not the only variable. Ren et al. also measured task resolution rates and found that models prompted to reason in Chinese frequently exhibited lower problem-solving rates than the same models prompted in English. The metric that should govern a deployment decision is cost per successful task completion, and that metric deteriorated when switching to Chinese across most models tested.
A separate failure mode: multilingual models instructed to reason strictly in Chinese exhibit language mixing during complex logical or mathematical steps. The model reverts to English unpredictably, producing convoluted outputs that disrupt the intended context-saving mechanism.
Even where a model's tokenizer does compress Chinese marginally better than English, agentic workflows do not operate in a vacuum. The agent calls APIs with English parameters, writes code with English syntax, generates artifacts for English-speaking users, and produces logs that English-speaking engineers need to read.
When the agent reasons in Chinese but outputs in English, the model spends tokens translating its internal state at every interface boundary. The dual-processing step bloats the output context and neutralizes whatever savings accrued during the reasoning phase.
The observability cost is harder to quantify but governs the deployment decision. An agent whose internal reasoning traces are in Chinese is opaque to non-Chinese-speaking developers. Resolving this through real-time log translation requires secondary LLM API calls, which defeats the original economic incentive. The alternative is tolerating opaque reasoning in production.
The intermediate translation also introduces generation noise. Each shift between the reasoning language and the output language is a point where semantic precision can degrade. For complex neuro-symbolic tasks where precision is critical, the added translation layers increase the risk of hallucination and logic breakdown.
The underlying intuition (that context windows waste capacity on redundant tokens) is correct. The fix is at the tokenizer and compression layers, not at the language layer.
Fairer tokenizers. If BPE vocabularies allocated capacity more equitably across languages, the natural semantic density of logographic scripts could translate into real compute savings. Petrov et al. (2023) frame this as a tokenizer fairness problem.
Algorithmic prompt compression. LLMLingua and similar tools calculate conditional perplexity to identify and drop unnecessary tokens from a prompt. The compression is mathematically grounded, observable, and language-agnostic. It does not introduce translation overhead because it operates on the prompt's own language.
Latent-space reasoning. Architectures that process intermediate reasoning steps natively in continuous embeddings or token vectors would sidestep discrete human writing systems altogether.