DeepSeek-V4.1-Flash: The 890-Byte KV Cache That Rewrites Agent Infrastructure

DeepSeek's V4.1-Flash, announced on September 10, 2026, is the model that achieved the goal of "running 4x the agents on the same GPU."

1. Core Specs at a Glance

2. The CED Architecture: Why 8B+16B

An ordinary Transformer uses the same parameter set for input processing (Prefill) and output generation (Decode). V4.1-Flash separates the two.

[input text] → Encoder (8B) → hidden state → Decoder (16B) → [output tokens]

Why this design:

• Prefill is a read task → relatively simple → 8B is enough
• Decode is a generation task → needs reasoning → expand to 16B
• Result: the same 552B model, but the actual computation consumes only a 24B level

This structure is combined with KV cache compression to maximize memory efficiency.

3. The Secret of the 890-Byte KV Cache

The Existing Problem

For an LLM agent to handle several sessions at once, each session's KV cache must sit in GPU memory. For a typical 7B model:

-> With one GPU (24GB), you cannot run even a single 7B model with a full 128K context.

V4.1-Flash's Solution: Three-Stage Compression

Stage 1: CED (Causal Encoder-Decoder)

• The decoder's KV cache is projected and reconstructed from the encoder's final hidden state
• No need to store each layer separately; one encoder output restores the decoder's entire KV

Stage 2: CSA2 (Compressed Sparse Attention 2)

• A sparse-attention technique that cross-reuses KV representations across layers
• Instead of every layer creating new KV each time, it partially reuses the previous layer's KV

Stage 3: FP4 KV cache quantization

• Compressed to 4 bits (0.5 bytes) from the existing FP16 (2 bytes)
• Uses the E2M1 format — minimizing precision loss

Final Result

-> A single GPU (24GB) can hold about 27 million tokens of context at once, on an FP16 KV-cache basis.

4. The mHC Paper: Why It Matters

The Problem: Instability of Hyper-Connections

In large-scale LLM training, there is a Hyper-Connections (HC) technique that strengthens information flow between layers. But HC had a fatal flaw: it damaged the identity-mapping property, making training unstable.

The Solution: Manifold Constraint

The mHC paper, co-authored by DeepSeek founder Liang Wenfeng:

• Projects HC's residual-connection space onto the Birkhoff polytope (the set of doubly stochastic matrices)
• This projection restores the identity-mapping property, securing training stability
• +2.1% performance gain on the BBH benchmark with a 27B model
• Training overhead: just 6.7%

-> This structure was used as the base layer of the V4 series, allowing large-scale MoE training to be completed stably.

5. Real Benchmarks: Strong on Agents

Per DeepSeek's official announcement (maximum reasoning effort):

Reading:

• It beats both GPT-5.6 Sol and Claude Opus 5.0 on the agent/automation benchmarks
• But on Terminal-Bench 4.0 (Claude 51.8 vs V4.1 31.2) and NL2Repo (Claude 75.3 vs V4.1 64.0), Claude is still ahead
• In long-horizon deep reasoning, Claude Opus still holds the edge

6. API Pricing: Disruptive

• About 1/4 the level of V4 Pro
• On a cache hit, input cost is 0.6 cents/1M tokens — effectively free
• Via OpenRouter: $0.10/1M input, $0.50/1M output

7. Community Reaction

Hacker News

• Main thread 1,015 points, 576 comments — focused discussion on the innovation of the KV cache compression

Reddit r/LocalLLaMA

• The MIT license immediately spawned "abliterated/uncensored" forks
• By September 13, at least two community builds were recording active downloads

Key Assessment

• "The Prefill/Decode split (8B/16B) is impressive" — evaluated as an architectural innovation
• "If you can run 4x the agent sessions on the same GPU, server costs drop dramatically"

8. Whether It Can Run Locally

-> It cannot run on a local consumer GPU. It is usable only via cloud API or in a server environment.

9. Summary: Who Should Use This Model

References

• DeepSeek-V4.1-Flash paper
• mHC paper
• mHC GitHub
• DeepSeek official announcement
• HuggingFace model