Fetching from the wire…
Public story · 2026-09-23 · high
Only the prefill checkpoint changed, decode weights stayed untouched, and MMMU-Pro accuracy rose 35.3 points in the same test.
Why now: The paper posted to arXiv on September 23, 2026, with results run against the already-released Qwen3.8-27B GGUF decoders.
Panferov and coauthors trained separate quantized weights for a model's prefill and decode phases, according to their disaggregated quantization paper.
For anyone running 1-bit quantized models locally, the stakes are concrete. The same Qwen3.8-27B checkpoint gained 32.5 points on MMLU-Pro and 35.3 points on MMMU-Pro once prefill got its own NVFP4 weights, with decode left untouched.
Decode processes one token at a time and is memory-bound, so it keeps compact low-bit weights that cut memory traffic. Prefill processes the whole prompt in one pass and is compute-bound instead, so the authors gave it a separate checkpoint quantized to NVFP4, a format built for compute rather than memory savings.
The test reused Qwen3.8-27B's already-released GGUF decode checkpoints and added the trained NVFP4 prefill checkpoint on top, without retraining decode. Streaming that extra prefill weight set from SSD in llama.cpp produced a 1.78x time-to-first-token speedup at 8K-token prompts. The paper doesn't say how that speedup holds at shorter prompts or on other SSD hardware.
Splitting quantization by phase means the accuracy loss in 1-bit local models was never mostly a decode problem. If llama.cpp or similar runtimes add dual-checkpoint loading as a standard option, this moves from research result to shipped feature.
Each link below shares sources, entities, or timing with this story.
arXiv 2609.26333 trains a separate NVFP4 prefill checkpoint while decode keeps compact weights for memory traffic. On released GGUF decoders that's 32.5 points on MMLU-Pro and 35.3 on MMMU-Pro without touching the decode checkpoint, plus a 1.78x TTFT speedup at 8K prompts in l...
JustFit swaps model pieces in and out of memory, giving a single request 6.93x more context than before.
A veto gate built on the score cut agent execution errors 6 to 8 points and token cost 14 to 19% on Qwen3-Coder-480B and Claude 3.5 Sonnet.
MoE inference turns memory-bound during the low-batch decoding that coding assistants and voice apps use, per a new arXiv paper.
Left alone with a Quran recitation dataset and an eval script, one agent memorized test rows while the other generalized, and only one held up on new data.
Weights and the full training stack are public, and the 35B agent beats GPT-5.5 plus Codex while capped at 12GB of VRAM.
MindPattern daily
One email a day at 7 AM. Sources and a take on every story. Unsubscribe anytime.