GO TO A SECTION

↑ ↓ to navigate · Enter to openExplore all sections →
FDEInterviews logo
RecentarXiv preprint

DeepSeek-V4: Towards Highly Efficient Million-Token Context Intelligence

DeepSeek-V4 combines compressed sparse and heavily compressed attention for million-token contexts. Learn what changes in compute, cache state and deployment.

Breakdown by FDE Interviews · 9 min read · Updated

About the original · 2026
AUTHORS
DeepSeek-AI, Xu, Lin, Xue, et al.
FROM
DeepSeek-AI
PUBLISHED
Apr 2026 · arXiv preprint
IN THIS BREAKDOWN · 10 SECTIONS

You can read 17% of this breakdown.

01

The paper in one minute

DeepSeek-V4 is a report on two mixture-of-experts models designed to make very long contexts more practical. The Pro configuration has 1.6 trillion total parameters with 49 billion activated per token. Flash has 284 billion total and thirteen billion activated. Both support a context of approximately one million tokens in the reported setup.

The central architectural change is hybrid compressed attention. Compressed Sparse Attention first reduces the history into compressed entries, then selects a subset for attention. Heavily Compressed Attention reduces the history much more aggressively and attends densely to that smaller representation. Both include a local uncompressed window.

The report also describes constrained residual mixing, Muon-based optimization, specialized kernels and a cache layout designed for heterogeneous state. The efficiency result therefore comes from an integrated architecture and implementation, not one setting that can be applied unchanged to any transformer.

This page reviews the April 2026 preview report. Its first-submission date is April even though the arXiv identifier begins with a different month. Official checkpoints and the accompanying inference implementation are the starting points for artifact-specific evaluation. Historical benchmark results should be read with their reasoning budgets and tool configurations attached.

THE IDEA, VISUALLY
TWO WAYS TO REDUCE LONG-HISTORY ATTENTION V4-Pro settings from section 4.2.1. Parallel lanes below explain layer types, not simultaneous execution. History Past tokens CSA: compress 4 → 1 Retain compressed history Select up to 1,024 entries Indexer chooses main read set History Past tokens HCA: compress 128 → 1 Much smaller retained history Attend to compressed entries Dense attention at this resolution Both layer types also read a local window of up to 128 uncompressed tokens. Cache accounting also includes indexer state, incomplete blocks and layout overhead. Top-k is not the whole cache.
Our architecture map separates the two attention layer types. CSA keeps moderately compressed history and selects a read set; HCA attends densely to much more compressed history. Both also preserve a local window.
Research notes: the problem, approach and results
1.6T / 49B

Pro total / activated parameters, section 4.2.1

27%

Pro single-token equivalent-FP8 FLOPs versus V3.2 at 1M context, Figure 1

10%

Pro KV cache versus V3.2 at 1M context, Figure 1

THE PROBLEM

Long-context reasoning and agent trajectories make attention computation and per-request state expensive.

THE IDEA

Interleave two compressed-attention mechanisms and co-design cache layout, kernels and training around them.

THE RESULT

The report estimates substantial long-context FLOP and KV-cache reductions; complete serving performance still depends on the workload and implementation.

02

Why it matters to an FDE

A customer may want an agent to retain a long investigation, inspect a large codebase or compare many documents. Merely accepting a large input is insufficient: the system must process it within a useful latency and memory budget, then use the relevant details correctly.

V4 gives concrete examples of how architecture changes that budget. Compressed state can reduce per-request memory, while sparse selection limits some attention work. Yet model weights, indexer state, local windows and incomplete compression blocks still need management. Activated parameters do not describe all resident weights.

Use KV-cache reasoning and mixture-of-experts fundamentals to evaluate those costs separately. Then test the customer's actual long-context tasks. A favorable FLOP ratio is useful evidence about one computation, but it is not an end-to-end service-level guarantee.

THE FULL BREAKDOWN

Understand the mechanism. Try it on a real problem.

Unlock this breakdown and 199 more papers.

Premium opens every paper in full, plus every answer, concept, course and guide on the site. One payment for six months of access.

6 months · One payment · No auto-renewal

Get Premium · ₹2,000 / $25
  • ◇1 architecture diagram
  • </>2 runnable code blocks
  • ▦3 results tables
  1. 03Key takeaways

    Six distinctions for interpreting compressed attention and million-token model claims

    Free account
  2. 04How it works

    Follow compressed attention, constrained residual mixing and the serving state they require

    Premium
  3. 05The numbers that matter

    Keep model configurations and efficiency estimates distinct from serving benchmarks

    Premium
  4. 06Try it yourself

    Count compressed entries and see why a sparse read set is not a fixed-size cache

    Premium
  5. 07Where it breaks

    Recognize compressed-state tradeoffs and the limits of benchmark portability

    Premium
  6. 08Using it on a deployment

    Evaluate long-context value with task slices, full-state accounting and realistic request budgets

    Premium
  7. 09Interview angles

    Explain compressed attention without confusing FLOPs, memory and latency

    Premium
Back to the paper library →