The Perplexity Paradox: Why Code Compresses Better Than Math in LLM Prompts

arXiv:2602.15843v1 Announce Type: cross Abstract: In "Compress or Route?" (Johnson, 2026), we found that code generation tolerates aggressive prompt compression (r >= 0.6) while chain-of-thought …