The Query Router Architecture: 59% Cost Reduction Is Sitting on the Table
Stanford Proved the Economics; Three Model Releases Made It Practical
Stanford's study across 20+ models on 8 accelerators with over 1M single-turn queries delivers a clear engineering spec: build a router that classifies query complexity, send easy queries locally, send hard ones to cloud frontier models. The router only needs 80% accuracy to deliver 59% cost reduction, 61.8% compute reduction, and 64.3% energy reduction against batched cloud baselines.
The reason this works: most production LLM traffic is easy. Knowledge retrieval, text formatting, simple summarization. Local model coverage of ChatGPT-equivalent queries grew from 23.2% in 2023 to 71.3% in 2025, with a 5.3x gain in intelligence-per-watt. Extrapolating this trajectory, 85%+ of queries become local-serviceable within 12-18 months.
The router is the cheapest infrastructure you can build. It only has to be right four times in five.
The Local Tier Just Got a Frontier-Class Option
LongCat-2.0 (MIT-licensed, 1.6T total parameters, ~48B active via MoE) scored 59.5% on SWE-bench Pro versus GPT-5.5's 58.6%. At 48B active parameters, inference requires roughly 2x H100s for active computation — expensive but feasible for a single team. The 1M native context window was trained, not interpolated, meaning attention patterns over long codebases are learned rather than approximated. Caveat: benchmarks are self-reported by Meituan, though 'Owl Alpha' topping OpenRouter charts for 2 months provides some independent signal.
For lighter workloads, Qwen 3.6 27B achieves 32 tokens/sec on an M5 MacBook via llama.cpp — viable for code documentation, boilerplate generation, and log analysis with zero cost-per-token.
The Critical Design Constraint
Coverage is strong on chat and knowledge tasks but weak on hard technical reasoning. A router keying on surface features (prompt length, keyword density) will route hard problems to the wrong tier. Classify on reasoning complexity, not superficial indicators. The Stanford paper designates this as the F29 failure category — the queries where local models confidently produce wrong answers.
Serving Framework Matters More Than You Think
On AMD MI355X, sglang outperformed vLLM and ATOM serving GLM-5.2, hitting 2626 tok/s/node. The path was configuration, not custom kernels: MXFP4 quantization via AMD Quark, FP8 KV cache, and tuned MoE kernel selection. This delivered 2x better cost-per-token than Blackwell at the serving level — the number that appears on your bill. If you standardized on vLLM 12 months ago, that was reasonable then. Validate it against sglang on your actual workloads before trusting it again.
What to do
Prototype a query-complexity classifier routing LLM requests to local vs. cloud within the next 2 sprints
Benchmark LongCat-2.0 (quantized) and Qwen 3.6 27B against your current API provider on 50 representative production queries this week
Run sglang vs vLLM comparison on your current inference workloads before any GPU hardware decision
Classify your LLM query log by reasoning complexity (not length/topic) to estimate local-serviceable percentage