← 返回全部时间线
TheElec(韩国电子产业媒体)原文发布 09-16 09:12Radar 收录 09-16 12:31查看原文 ↗

DeepSeek-V4.1-Flash 在部分智能体与编程测试中超越 GPT-5.6 Sol

DeepSeek-V4.1-Flash Outpaces GPT-5.6 Sol on Some Agentic, Coding Tests
中文摘要

DeepSeek 发布最新人工智能模型 DeepSeek-V4.1-Flash。该模型参数量少于 DeepSeek 顶级 V4-Pro 模型,但在部分性能测试中表现更优,在部分智能体与编程测试中超过 GPT-5.6 Sol。

原文深度解读

本文介绍 DeepSeek 发布的最新人工智能模型 DeepSeek-V4.1-Flash。该模型采用 MoE 架构,骨干参数 5520 亿,输入处理激活 80 亿参数、输出生成激活 160 亿参数,相比 V4-Pro 的 1.6 万亿参数和 490 亿激活参数大幅缩减,同时 KV 缓存降至每 token 890 字节。DeepSeek 称其在智能体与编程任务上超过 V4-Pro,并在 Terminal-Bench 2.1 等测试中超过 GPT-5.6 Sol 和 Claude Opus 5,但在 Terminal-Bench 4.0 和通用推理上落后。Artificial Analysis 给出 Intelligence Index 40 分,输出速度约 214.4 tokens/秒,TTFT 1.13 秒,并称其达到成本-任务帕累托前沿。文章还详细解释 CED 架构、SWA Bounded Replay、CSA2 与 FP4 量化等降低 KV 缓存和计算成本的技术。与电子元器件供应链的关系在于:模型效率提升可能降低 AI 推理对 GPU 显存、服务器功耗和高端 GPU 的依赖,从而间接影响 AI 服务器、GPU、HBM 和电源管理等环节的需求结构。

  • DeepSeek-V4.1-Flash 采用 MoE 架构,骨干 5520 亿参数,输入处理激活 80 亿、输出生成激活 160 亿;此前 V4-Flash 为 2840 亿参数和 130 亿激活参数,V4-Pro 为 1.6 万亿参数和 490 亿激活参数。
  • DeepSeek 称 V4.1-Flash 在智能体与编程任务上优于 V4-Pro,并在 reasoning_effort=100 时于 Terminal-Bench 2.1 超过 GPT-5.6 Sol 和 Claude Opus 5,在 DeepSWE v1.1 和 AutomationBench 上也声称占优;但在 Terminal-Bench 4.0 上落后于这两款模型。
  • Artificial Analysis 给出 Intelligence Index 40 分,高于开放权重模型平均但低于领先前沿模型;具体分数包括 GDPval-AA v2 1632、AutomationBench-AA 69%、SciCode 52%、HLE 39%。AA 将指数从 v4.2 升级到 v4.3,替换 Terminal-Bench 2.1 为 4.0,导致此前 60 分以上的前沿模型降至 50 分段。
  • 在参数规模相近的开放权重模型中,GLM-5.3-Flash 以 42 分排名第一,Qwen 3.8 Max 与 DeepSeek-V4.1-Flash 以 40 分并列第二,DeepSeek V4 Pro 0813 为 36 分;同类规模开放权重模型中位数仅 18 分。
  • 速度方面,V4.1-Flash 输出约 214.4 tokens/秒,TTFT 1.13 秒,而可比模型中位数为 65.4 tokens/秒和 2.34 秒;AA 称其“明显快”,但“非常啰嗦”,Intelligence Index 评估使用 2.5 亿输出 token,高于同类开放权重模型中位数 1.3 亿。
  • KV 缓存降至每 token 890 字节,约为 V4-Flash 的四分之一;持久 KV 缓存占用约为此前 V4-Flash 的八分之一。技术手段包括 CED 架构(40 层分为 20 层因果编码器和 20 层解码器,取消交叉注意力)、SWA Bounded Replay(仅保留最近 128 token 的 SWA 状态并按需重放)、CSA2(Full/Reindex/Reuse 三种模式共享 KV 与注意力索引)和 FP4 量化。

供应链影响

  • 若 V4.1-Flash 的低激活参数和低 KV 缓存优势在实际部署中成立,AI 推理对单卡 GPU 显存容量和 HBM 带宽的需求增速可能放缓,具体取决于实际并发量和上下文长度。
  • 输出速度提升和计算需求下降可能使相同 GPU 资源承载更多并发请求,从而可能改变 AI 服务器中 GPU 与电源、散热等配套硬件的配比。
  • 模型对低端 GPU、本地服务器和边缘 AI 系统的部署友好度可能提高,或使部分推理负载从云端高端 GPU 向边缘和本地设备分散。
  • KV 缓存持久存储需求下降可能减少对 SSD 等存储介质的依赖,但影响程度取决于 SWA Bounded Replay 等机制在真实工作负载中的实际效果。
  • AA 评估方法升级导致分数整体下移,说明模型评测标准变化可能影响市场对 AI 芯片和服务器需求节奏的判断,相关供应链预期存在不确定性。

系统解读,仅作为判断线索,不构成备货、出货、涨价或投资建议。

正文内容 · AI翻译

DeepSeek 发布了其最新人工智能模型 DeepSeek-V4.1-Flash。尽管其参数量少于 DeepSeek 顶级 V4-Pro 模型,但新模型在性能、成本和速度上展现出优势,可能使其成为旗舰模型的实际替代品。它在部分智能体和编程基准测试中也优于 V4-Pro。

DeepSeek-V4.1-Flash 不仅大幅减少了活跃参数数量,还大幅缩减了键值(KV)缓存,同时在智能体和编程性能上领先 V4-Pro,并在部分基准测试中领先若干前沿模型。DeepSeek 周一表示,将开始把现有的 V4-Pro 应用程序编程接口(API)服务整合到 V4.1-Flash 中。

DeepSeek-V4.1-Flash 采用混合专家(MoE)架构,根据输入仅激活选定的专家网络以提高计算效率。该模型骨干有 5520 亿参数,输入处理期间激活 80 亿参数,输出生成期间激活 160 亿参数。

此前的 V4-Flash 有 2840 亿参数和 130 亿活跃参数。顶级 V4-Pro 有 1.6 万亿参数和 490 亿活跃参数。尽管存在这一差异,DeepSeek 称 V4.1-Flash 在智能体和编程任务上性能优于 V4-Pro。DeepSeek-V4.1-Flash 在输入和输出活跃参数上的区分尤其值得注意。

DeepSeek-V4.1-Flash 的设计重点聚焦于智能体和编程。据 DeepSeek 称,在最大推理强度,即 reasoning_effort=100 时,V4.1-Flash 在 Terminal-Bench 2.1 上优于 OpenAI 的 GPT-5.6 Sol 和 Anthropic 的 Claude Opus 5。DeepSeek 还声称在 DeepSWE v1.1 和 AutomationBench 上优于这两个模型。

DeepSeek-V4.1-Flash 在智能体基准测试中与主要前沿模型的性能对比。(来源:Hugging Face 模型卡)

然而,在智能体和编程任务之外,该模型在困难通用推理上得分相对较低。独立 AI 模型评估平台 Artificial Analysis(AA)给该模型的 Intelligence Index 评分为 40。这远高于开放权重模型的平均水平,但低于领先的前沿模型。

AA 通过综合多项评估计算其 Intelligence Index,包括 GDPval-AA、AutomationBench-AA、SciCode、Humanity's Last Exam(HLE)、CritPt 和 AA-LCR。DeepSeek-V4.1-Flash 记录的分数包括 GDPval-AA v2 的 1632 分、AutomationBench-AA 的 69%、SciCode 的 52% 和 HLE 的 39%,使该模型总体处于中上区间。结果表明,该模型在面向编程的应用中部署时可能非常高效。

40 分也反映了 AA 近期对其评估方法的调整,这些调整降低了指数的整体量级。AA 将其 Intelligence Index 从 v4.2 升级到 v4.3,使评估集更难。

因此,此前得分远高于 60 的前沿模型在修订方法下被移至 50 分段。Anthropic 的 Claude Fable 5.1 在先前 v4.2 评估下得分为 66,现在在修订系统下得分为 53,与 OpenAI 的 GPT-6 Astra 并列。

DeepSeek 对 V4.1-Flash 与其他 AI 模型的性能对比,突出该模型声称的编程优势。(来源:Hugging Face 模型卡)

AA 的升级部分由用 Terminal-Bench 4.0 替换 Terminal-Bench 2.1 所驱动。DeepSeek-V4.1-Flash 在 Terminal-Bench 2.1 上优于 GPT-5.6 Sol 和 Claude Opus 5,但在 Terminal-Bench 4.0 上落后于它们。

Terminal-Bench 4.0 由 66 个复杂终端任务组成,涵盖软件、机器学习、科学、运营、安全、硬件和媒体。它修订了计算和时间配额,并改进了任务描述、环境和验证逻辑,以更精细地区分前沿模型之间的性能。

在参数规模方面,DeepSeek-V4.1-Flash 的 Intelligence Index 得分略低于 GLM-5.3-Flash 的 42 分,但远高于其他类似规模开放权重模型 18 分的中位数。在 AA 更严格的 Intelligence Index 下,GLM-5.3-Flash 在开放权重模型中排名第一,而阿里巴巴的 Qwen 3.8 Max 和 DeepSeek-V4.1-Flash 以 40 分并列第二。DeepSeek V4 Pro 0813 得分为 36。

DeepSeek-V4.1-Flash 也如 DeepSeek 所称的那样快。其输出速度约为每秒 214.4 个 token,而首 token 时间(TTFT)为 1.13 秒。可比模型的中位数为每秒 65.4 个 token,TTFT 为 2.34 秒,按输出速度衡量,V4.1-Flash 快三倍以上。AA 也将其评为“明显快”。

Artificial Analysis 对 DeepSeek-V4.1-Flash 的总体评估,包括智能、速度、成本和冗长度指标。(来源:Artificial Analysis)

该模型将其 KV 缓存降至每 token 890 字节。AA 也认为这是一项显著优势。当与 DeepSeek-V4.1-Flash 的定价结构结合时,这一缩减变得更加重要。

据 AA 称,DeepSeek-V4.1-Flash 的输入和输出 token 定价具有竞争力,总体成本低于可比模型的中位数。缓存命中定价获得进一步降低,而低谷时段获得额外 50% 折扣。

然而,AA 表示该模型“非常啰嗦”。其 Intelligence Index 评估使用了 2.5 亿输出 token,远高于类似开放权重模型 1.3 亿的中位数。评估总成本也被记录。尽管模型很快,但其响应长度可能影响实际成本和完成时间。

尽管如此,AA 表示该模型在每任务成本基础上达到帕累托前沿。换言之,在可比智能水平下,它属于成本最低的模型之一。

Artificial Analysis 截至 9 月 14 日的 AI 模型评估,DeepSeek-V4.1-Flash 由红色箭头标出;任务成本越低越好。(来源:Artificial Analysis)

DeepSeek-V4.1-Flash 不同于传统 MoE 模型,将输入和输出的活跃参数分开,原因在于其因果编码器-解码器(CED)架构。

CED 一词或其背后的概念并非 DeepSeek 创造。该术语自 2010 年代末以来已在语音、时间序列建模和生成模型等领域使用。7 月发表的一篇关于阿里巴巴 Qwen-Audio-VAE 的论文也讨论了 CED。然而,DeepSeek 在 V4.1-Flash 中使用的 CED 尽管同名,但似乎是一种不同的技术。

DeepSeek 的 CED 使编码器变为因果而非双向,并通过一次操作将编码器的最终表示投影到解码器的 KV 缓存中,从而消除了对交叉注意力的需求。该结构似乎是由 DeepSeek 为 V4.1-Flash 设计和命名的,DeepSeek 在官方 Hugging Face 模型卡和技术文档中将其标识为其模型的新架构。

DeepSeek 在 V4.1-Flash 中的 CED 做了三件事:它将原本双向的编码器改为因果、顺序结构,使其遵循当今自回归模型使用的基本预训练模式;它通过一次操作将编码器的最终输出转移到解码器缓存中,消除了解码器通过交叉注意力反复查询编码器的需要;它将该架构重新用作对话聊天机器人内部的成本和内存节省机制。

Artificial Analysis 从 Terminal-Bench 2.1 升级到 Terminal-Bench 4.0;DeepSeek-V4.1-Flash 在 Terminal-Bench 2.1 上领先前沿模型,但在 Terminal-Bench 4.0 上排名较低。(来源:Artificial Analysis)

根据 DeepSeek 的技术报告,V4.1-Flash 中的 40 个 Transformer 层分为 20 个因果编码器层和 20 个解码器层。模型不是在每个解码器层单独生成全局 KV,而是从编码器的最终隐藏状态投影出解码器的全局 KV。

DeepSeek 的 CED 架构既不直接对应原始 Transformer 编码器-解码器架构,也不对应大多数现代大型语言模型(LLM)使用的仅解码器架构。根据 DeepSeek 的技术文档,它有三个关键区别。

第一,编码器本身是因果的。在原始编码器-解码器架构中,编码器双向读取句子,既向前也向后看。在 DeepSeek 的 CED 中,编码器也按从左到右的顺序读取。这就是它被称为因果编码器的原因。使编码器以与解码器相同的方式变为因果,允许所有 40 层在一致的因果方案下运行,简化训练。

第二,DeepSeek 消除了交叉注意力,否则解码器会在每一层、为每个生成的 token 实时查询编码器中的信息。交叉注意力是一种注意力机制,其中模型的一部分引用另一部分持有的信息,而不是仅依赖自身的表示。

DeepSeek CED 与编码器-解码器和仅解码器模型有何不同

早期基于 Transformer 的模型使用编码器-解码器架构,而当今大多数生成式大型语言模型(LLM)使用仅解码器架构。在编码器-解码器模型中,数十层按顺序堆叠。当用户提交问题或指令时,输入从第一层到最后一层依次通过,逐渐被细化和处理。理解用户提示的过程和生成响应的过程通过同一架构处理,要求模型在处理期间通过所有那些层。如果用户附上非常长的文档,或者 AI 智能体在较长时间内执行连续任务且对话历史不断增长,AI 必须通过数十层反复处理该信息。每一层都会留下键值(KV)缓存状态以保留重要信息。一般来说,模型层数越多,需要存储的 KV 状态就越多。这就是为什么 KV 缓存被认为是 AI 服务运营中的主要瓶颈和成本上升的重要来源。这可以追溯到 Google 研究人员 2017 年提出的 Transformer,当时机器翻译被作为关键应用。在英译韩示例中,该架构大致可分为编码器,读取整个英文源句,以及解码器,利用该理解生成韩文翻译。关键点是编码器双向读取句子。例如,处理句子第五个词时,编码器不仅可以参考前四个词,还可以参考第六个词之后的所有词。这类似于一个人在确定上下文之前阅读整个句子。一旦编码器双向完全处理了源句,解码器就使用该表示逐词生成翻译。解码器仅从左到右,即因果地运行。要生成下一个词,它可以参考已经生成的词,但看不到尚未生成的词。然而,在生成每个词时,解码器不仅仅查看它之前生成的词。它还参考编码器从输入 token 生成的表示。这个过程称为交叉注意力。至关重要的是,交叉注意力发生在每个解码器层和每次生成词时。换句话说,无论是在第五个解码器层还是第 20 个,解码器都会实时反复参考编码器产生的信息。这种架构对于翻译和摘要等任务很有用,因为输入和输出可能使用不同语言或格式差异很大。如今广泛使用的模型,包括 GPT 和 Claude,通常使用仅解码器架构,而非传统编码器-解码器结构。编码器和解码器不分离。相反,用户的问题和 AI 的响应被合并为一个长文本序列,由一组层完全以因果、从左到右的方式处理。因此,理解问题的过程和生成答案的过程共享相同的层和参数。该架构相对简单且训练高效,帮助仅解码器模型在 GPT 系列之后成为行业标准。其缺点是长输入在初始处理以生成 KV 缓存时必须通过所有层,而随着对话变长,存储和管理缓存的记忆负担增加。DeepSeek 的因果编码器-解码器(CED)架构试图减少这种重复处理。基本思路相对直接:不是将所有 40 个工作站视为单一处理线,而是将其分为两组各 20 个,角色不同。前 20 个工作站,即编码器层,处理输入并产生最终隐藏状态。用户的问题或文档被读取一次,并转换为可供后续计算使用的表示。后 20 个工作站,即解码器层,基于该信息生成响应,并构建生成期间所需的 KV 状态。

第三,编码器和解码器的角色发生了变化。模型将输入理解与响应生成分离,同时从用户角度看仍作为单一对话聊天机器人运行。在内部,输入处理部分激活 80 亿参数,而输出生成部分激活 160 亿。

早期基于 Transformer 的模型使用编码器-解码器架构,而当前大多数生成式 LLM 使用仅解码器架构。

DeepSeek-V4.1-Flash 的 GDPval-AA 评估,衡量跨行业和职业的复杂专业任务表现。(来源:Artificial Analysis)

SWA 与 DeepSeek 的 SWA Bounded Replay

AI 模型在生成响应时大致依赖两类信息:全局记忆和局部记忆。全局记忆在长上下文中维护信息。在 DeepSeek 的因果编码器-解码器(CED)架构中,编码器处理整个输入,并使用其最终隐藏状态生成解码器的全局键值(KV)缓存。该全局 KV 缓存维护长上下文的整体表示。但当大型语言模型(LLM)生成响应时,它需要的不仅仅是对整个上下文的理解。它还需要非常窄上下文内的细粒度信息,例如它刚刚使用了哪个词或前一句如何结束。仅来自完整长上下文的信息可能不足以充分保留此类细节,因此需要单独的局部记忆形式。滑动窗口注意力(SWA)是一种机制,允许序列中仅最近部分的 token 相互关注。然而,在 DeepSeek 的 CED 架构中,解码器并不完整保留其 SWA 局部状态。因此,DeepSeek 使用一种称为 SWA Bounded Replay 的单独机制来补偿缺失的局部状态。在 DeepSeek 的 CED 架构中,解码器不会像传统解码器层那样反复处理整个提示。前 20 个编码器层处理完整提示并产生最终隐藏状态,然后用于为后续 20 个解码器层构建全局 KV 缓存。因此,解码器可以通过全局 KV 缓存访问编码器处理的整个输入信息。这并不意味着模型缺乏局部上下文信息。响应生成仍然需要来自窄上下文的细粒度信息,例如刚刚生成的词或紧邻的前一句。DeepSeek-V4.1-Flash 通过仅维护最近 128 个 token 的 SWA 状态来解决这一问题。模型不是持续将局部 KV 存储在固态硬盘(SSD)上,而是在需要时重新处理最近 128 个 token 以重建局部状态。这就是 SWA Bounded Replay 的作用。借助 SWA Bounded Replay,DeepSeek-V4.1-Flash 执行一个短重放过程,其中仅提示的最后 128 个 token 通过 20 个解码器层。这允许解码器恢复紧邻上下文的局部记忆,即 SWA 状态。该过程称为“bounded”(有界),因为重放仅限于最近 128 个 token 而非完整提示;称为“replay”(重放),因为解码器重新计算信息以恢复近期上下文。该方法是 DeepSeek 提高成本效率努力的关键部分。在传统解码器架构下,保留局部记忆需要为完整提示长度保留包含近期上下文信息的 SWA 缓存。随着对话变长和提示增长,所需存储量也会增加,最终需要将缓存移至磁盘或 SSD。SWA Bounded Replay 显著减少了对这种局部记忆存储的需求。当需要局部状态时,就在响应生成之前,系统可以立即重新计算最近 128 个 token,使用所得状态然后丢弃。系统不是将 SWA KV 状态存储在 SSD 上,而是在需要时通过重放最近 128 个 token 来重建它。DeepSeek 表示,这种方法消除了 SWA KV 的持久 SSD 存储,因此将整体持久 KV 缓存占用减少到此前 V4-Flash 的约八分之一。CED 对全局记忆的复用减少了计算和需要维护的全局缓存量,而 SWA Bounded Replay 则作为补充机制,以小的固定计算成本填补局部记忆的结构性缺口,同时减少存储需求。

另一种用于减少 KV 缓存的技术是 △Compressed Sparse Attention 2(CSA2),△以及 FP4 量化。CSA2 允许多层共享和复用 KV 与注意力索引,减少每层维护自己缓存时否则会发生的重复。FP4 量化使用四位浮点值存储全局 KV 缓存,相比 FP8 减少存储需求。

DeepSeek 在 V4 中引入了第一版压缩稀疏注意力(CSA)。DeepSeek 稀疏注意力(DSA)在长上下文中选择重要 KV 条目并仅对其中一部分执行注意力,而 CSA 首先将多个 token 的 KV 表示压缩为更短的表示,然后稀疏选择所需信息。换言之,CSA 将 KV 压缩与稀疏选择相结合,以减少长上下文的 KV 缓存大小和注意力计算。

V4.1-Flash 将该方法推进到 CSA2。每个注意力层被分配三种模式之一——Full、Reindex 或 Reuse——允许多个注意力层共享和复用 KV 及重要信息的位置,而不是在每一层重新计算相同信息。一些层执行新计算,而另一些层复用现有结果,减少长上下文所需的内存和计算。结合 FP4 KV 缓存,全局 KV 缓存降至每 token 890 字节,约为 V4-Flash 缓存大小的四分之一。

在保持性能的同时减少活跃参数数量,降低了运行 AI 模型所需的 GPU 内存和计算资源。这可以降低服务器运营和电力成本,并允许相同的 GPU 资源处理更多并发请求。较低的计算需求还可以减少延迟,并使在低端 GPU、本地服务器而非云基础设施以及边缘 AI 系统上的部署更容易。

DeepSeek-V 的 AutomationBench-AA 评估

DeepSeek has unveiled its latest artificial intelligence model, DeepSeek-V4.1-Flash. Although it has fewer parameters than DeepSeek's top-tier V4-Pro model, the new model showed advantages in performance, cost and speed that could make it a practical substitute for the flagship. It also outperformed V4-Pro on some agentic and coding benchmarks.

DeepSeek-V4.1-Flash sharply reduces not only the number of active parameters but also its key-value (KV) cache, while posting agentic and coding performance ahead of V4-Pro and, on some benchmarks, several frontier models. DeepSeek said Monday that it would begin consolidating its existing V4-Pro application programming interface (API) service into V4.1-Flash.

DeepSeek-V4.1-Flash uses a Mixture of Experts (MoE) architecture, which activates only selected expert networks depending on the input to improve computational efficiency. The model has 552 billion parameters in its backbone, with 8 billion active parameters during input processing and 16 billion during output generation.

The previous V4-Flash had 284 billion parameters and 13 billion active parameters. The top-end V4-Pro had 1.6 trillion parameters and 49 billion active parameters. Despite that difference, DeepSeek says V4.1-Flash delivers better performance than V4-Pro in agentic and coding tasks. The distinction between active parameters for input and output in DeepSeek-V4.1-Flash is particularly notable.

DeepSeek-V4.1-Flash is designed with a focus on agents and coding. According to DeepSeek, at the maximum reasoning intensity, or reasoning_effort=100, V4.1-Flash outperformed OpenAI's GPT-5.6 Sol and Anthropic's Claude Opus 5 on Terminal-Bench 2.1. DeepSeek also claims an advantage over the two models on DeepSWE v1.1 and AutomationBench.

DeepSeek-V4.1-Flash performance comparison with major frontier models on agentic benchmarks. (Source: Hugging Face model card)

Outside agentic and coding tasks, however, the model posted relatively lower scores on difficult general reasoning. Artificial Analysis (AA), an independent AI model evaluation platform, gave the model an Intelligence Index score of 40. That was well above the average for open-weight models but below the leading frontier models.

AA calculates its Intelligence Index by combining multiple evaluations, including GDPval-AA, AutomationBench-AA, SciCode, Humanity's Last Exam (HLE), CritPt and AA-LCR. DeepSeek-V4.1-Flash recorded scores including 1,632 on GDPval-AA v2, 69% on AutomationBench-AA, 52% on SciCode and 39% on HLE, leaving the model in the upper-middle range overall. The results indicate that the model can be highly efficient when deployed for coding-focused applications.

The score of 40 also reflects AA's recent changes to its evaluation methodology, which have lowered the overall scale of the index. AA upgraded its Intelligence Index from v4.2 to v4.3, making the evaluation set more difficult.

As a result, frontier models that previously scored well above 60 have been moved into the 50s under the revised methodology. Anthropic's Claude Fable 5.1, which had scored 66 under the previous v4.2 evaluation, now scores 53 under the revised system, alongside OpenAI's GPT-6 Astra.

DeepSeek's performance comparison between V4.1-Flash and other AI models, highlighting the model's claimed advantage in coding. (Source: Hugging Face model card)

AA's upgrade was driven in part by the replacement of Terminal-Bench 2.1 with Terminal-Bench 4.0. DeepSeek-V4.1-Flash outperformed GPT-5.6 Sol and Claude Opus 5 on Terminal-Bench 2.1, but fell behind them on Terminal-Bench 4.0.

Terminal-Bench 4.0 consists of 66 complex terminal tasks spanning software, machine learning, science, operations, security, hardware and media. It revised computing and time allowances and improved task descriptions, environments and verification logic to more finely distinguish performance among frontier models.

In terms of parameter size, DeepSeek-V4.1-Flash's Intelligence Index score is slightly below the 42 points recorded by GLM-5.3-Flash but is well above the median score of 18 for other open-weight models of a similar size. Under AA's stricter Intelligence Index, GLM-5.3-Flash ranks first among open-weight models, while Alibaba's Qwen 3.8 Max and DeepSeek-V4.1-Flash share second place at 40. DeepSeek V4 Pro 0813 scored 36.

DeepSeek-V4.1-Flash is also fast, as DeepSeek claims. Its output speed is about 214.4 tokens per second, while time to first token (TTFT) is 1.13 seconds. The median for comparable models is 65.4 tokens per second and 2.34 seconds for TTFT, making V4.1-Flash more than three times as fast by the output-speed measure. AA also rated it as “notably fast.”

Artificial Analysis' overall evaluation of DeepSeek-V4.1-Flash, including intelligence, speed, cost and verbosity metrics. (Source: Artificial Analysis)

The model has reduced its KV cache to 890 bytes per token. AA also viewed this as a significant strength. The reduction becomes more consequential when combined with DeepSeek-V4.1-Flash's pricing structure.

According to AA, DeepSeek-V4.1-Flash is priced competitively for input and output tokens, with an overall cost below the median of comparable models. Cache-hit pricing receives further reductions, while off-peak periods receive an additional 50% discount.

AA, however, said the model is “very verbose.” Its Intelligence Index evaluation used 250 million output tokens, substantially more than the 130 million median for similar open-weight models. The total cost of the evaluation was also recorded. Although the model is fast, the length of its responses can affect actual cost and completion time.

Still, AA said the model reaches the Pareto frontier on a cost-per-task basis. In other words, it is among the least expensive models at a comparable level of intelligence.

Artificial Analysis' AI model evaluation as of Sept. 14, with DeepSeek-V4.1-Flash indicated by the red arrow; lower task cost is better. (Source: Artificial Analysis)

The reason DeepSeek-V4.1-Flash separates active parameters for input and output, unlike a conventional MoE model, lies in its Causal Encoder-Decoder (CED) architecture.

The term CED, or the concept behind it, was not created by DeepSeek. The term has been used since the late 2010s in fields including speech, time-series modeling and generative models. A paper on Alibaba's Qwen-Audio-VAE, published in July, also discusses CED. However, the CED used by DeepSeek in V4.1-Flash appears to be a different technology despite sharing the same name.

DeepSeek's CED makes the encoder causal rather than bidirectional and eliminates the need for cross-attention by projecting the encoder's final representation into the decoder's KV cache in a single operation. The structure appears to have been designed and named by DeepSeek for V4.1-Flash, and DeepSeek identifies it as a new architecture for its model in the official Hugging Face model card and technical documentation.

DeepSeek's CED in V4.1-Flash does three things: it changes the originally bidirectional encoder into a causal, sequential structure so it follows the same basic pretraining pattern used by today's autoregressive models; it eliminates the need for the decoder to query the encoder repeatedly through cross-attention by transferring the encoder's final output into the decoder cache in one operation; and it repurposes the architecture as a cost- and memory-saving mechanism inside a conversational chatbot.

Artificial Analysis' upgrade from Terminal-Bench 2.1 to Terminal-Bench 4.0; DeepSeek-V4.1-Flash led frontier models on Terminal-Bench 2.1 but ranked lower on Terminal-Bench 4.0. (Source: Artificial Analysis)

According to DeepSeek's technical report, the 40 Transformer layers in V4.1-Flash are divided into 20 causal encoder layers and 20 decoder layers. Instead of generating global KV separately at each decoder layer, the model projects the decoder's global KV from the final hidden state of the encoder.

DeepSeek's CED architecture does not correspond directly to either the original Transformer encoder-decoder architecture or the decoder-only architecture used by most modern large language models (LLMs). According to DeepSeek's technical documentation, it differs in three key ways.

First, the encoder itself is causal. In the original encoder-decoder architecture, the encoder reads a sentence bidirectionally, looking both forward and backward. In DeepSeek's CED, the encoder also reads sequentially, from left to right. This is why it is called a causal encoder. Making the encoder causal in the same way as the decoder allows all 40 layers to operate under a consistent causal scheme, simplifying training.

Second, DeepSeek eliminates cross-attention, through which the decoder would otherwise query information from the encoder in real time at every layer and for every generated token. Cross-attention is an attention mechanism in which one part of a model references information held by another part rather than relying only on its own representations.

How DeepSeek CED Differs From Encoder-Decoder and Decoder-Only Models
Early Transformer-based models used an encoder-decoder architecture, while most generative large language models (LLMs) today use a decoder-only architecture. In an encoder-decoder model, dozens of layers are stacked sequentially. When a user submits a question or instruction, the input passes through the layers from the first to the last, becoming progressively more refined and processed. The process of understanding the user's prompt and the process of generating a response are handled through the same architecture, requiring the model to pass through all of those layers during processing. If a user attaches a very long document, or an AI agent performs a continuous sequence of tasks over an extended period as the conversation history keeps growing, the AI must repeatedly process that information through dozens of layers. Each layer leaves key-value (KV) cache states to retain important information. In general, the more layers a model has, the more KV states need to be stored. That is why KV cache is considered a major bottleneck and a significant source of rising costs in AI service operations. This traces back to the Transformer introduced by Google researchers in 2017, when machine translation was presented as a key application. In an English-to-Korean translation example, the architecture can broadly be divided into an encoder, which reads the entire English source sentence, and a decoder, which uses that understanding to generate the Korean translation. The key point is that the encoder reads the sentence bidirectionally. For example, when processing the fifth word of a sentence, the encoder can refer not only to the first four words but also to all words after the sixth. This is similar to a person reading an entire sentence before determining its context. Once the encoder has fully processed the source sentence in both directions, the decoder uses that representation to generate the translation one word at a time. The decoder operates only from left to right, or causally. To generate the next word, it can refer to words it has already produced, but cannot see words that have not yet been generated. When generating each word, however, the decoder does more than look at the words it has previously produced. It also references the representations generated by the encoder from the input tokens. This process is known as cross-attention. Crucially, cross-attention occurs at every decoder layer and each time a word is generated. In other words, whether at the fifth decoder layer or the 20th, the decoder repeatedly references information produced by the encoder in real time. This architecture is useful for tasks such as translation and summarization, where the input and output may be in different languages or have substantially different formats. Today's widely used models, including GPT and Claude, generally use a decoder-only architecture rather than the traditional encoder-decoder structure. The encoder and decoder are not separated. Instead, the user's question and the AI's response are combined into a single long sequence of text, which is processed by one set of layers entirely in a causal, left-to-right manner. The process of understanding the question and the process of generating the answer therefore share the same layers and parameters. The architecture is relatively simple and efficient to train, helping decoder-only models become an industry standard following the GPT series. Its drawback is that a long input must pass through all layers when it is initially processed to generate the KV cache, while the memory burden of storing and managing the cache increases as conversations grow longer. DeepSeek's Causal Encoder-Decoder (CED) architecture attempts to reduce this repeated processing. The basic idea is relatively straightforward: instead of treating all 40 workstations as a single processing line, the model divides them into two groups of 20 with distinct roles. The first 20 workstations, or encoder layers, process the input and produce the final hidden states. The user's question or document is read once and transformed into a representation that can be used by subsequent computations. The second 20 workstations, or decoder layers, generate the response based on that information and construct the KV states needed during generation.

Third, the roles of the encoder and decoder are changed. The model separates input understanding from response generation while continuing to operate as a single conversational chatbot from the user's perspective. Internally, the input-processing portion activates 8 billion parameters, while the output-generation portion activates 16 billion.

Early Transformer-based models used an encoder-decoder architecture, while most current generative LLMs use a decoder-only architecture.

GDPval-AA evaluation of DeepSeek-V4.1-Flash, measuring performance on complex professional tasks across industries and occupations. (Source: Artificial Analysis)

SWA and DeepSeek’s SWA Bounded Replay
AI models broadly rely on two types of information when generating a response: global memory and local memory. Global memory maintains information across a long context. In DeepSeek's Causal Encoder-Decoder (CED) architecture, the encoder processes the entire input and uses its final hidden states to generate the decoder's global key-value (KV) cache. This global KV cache maintains an overall representation of the long context. But when a large language model (LLM) generates a response, it needs more than an understanding of the entire context. It also needs fine-grained information within a very narrow context, such as which word it has just used or how the preceding sentence ended. Information from the full long context alone may not adequately preserve such details, making a separate form of local memory necessary. Sliding Window Attention (SWA) is a mechanism that allows tokens within only a recent portion of the sequence to attend to one another. In DeepSeek's CED architecture, however, the decoder does not retain its SWA local state in full. DeepSeek therefore uses a separate mechanism called SWA Bounded Replay to compensate for the missing local state. In DeepSeek's CED architecture, the decoder does not repeatedly process the entire prompt as conventional decoder layers would. The first 20 encoder layers process the full prompt and produce the final hidden states, which are then used to construct the global KV cache for the following 20 decoder layers. The decoder can therefore access information from the entire input processed by the encoder through the global KV cache. That does not mean the model lacks local context information. Response generation still requires fine-grained information from a narrow context, such as the word just generated or the immediately preceding sentence. DeepSeek-V4.1-Flash addresses this by maintaining SWA state only for the most recent 128 tokens. Rather than continuously storing local KV on a solid-state drive (SSD), the model can reprocess the most recent 128 tokens when needed to reconstruct the local state. This is the role of SWA Bounded Replay. With SWA Bounded Replay, DeepSeek-V4.1-Flash performs a short replay process in which only the final 128 tokens of the prompt pass through the 20 decoder layers. This allows the decoder to recover local memory, or SWA state, for the immediately preceding context. The process is called “bounded” because the replay is limited to the most recent 128 tokens rather than the full prompt, and “replay” because the decoder recalculates the information to recover the recent context. The approach is a key part of DeepSeek's effort to improve cost efficiency. Under a conventional decoder architecture, preserving local memory would require an SWA cache containing recent-context information to be retained for the full length of the prompt. As conversations become longer and prompts grow, the amount of storage required also increases, eventually creating a need to move the cache to disk or an SSD. SWA Bounded Replay significantly reduces the need for such local-memory storage. When the local state is needed, just before response generation, the system can immediately recalculate the most recent 128 tokens, use the resulting state and then discard it. Instead of storing the SWA KV state on an SSD, the system reconstructs it by replaying the most recent 128 tokens when required. DeepSeek says this approach eliminates persistent SSD storage for SWA KV and, as a result, reduces the overall persistent KV cache footprint to about one-eighth that of the previous V4-Flash. While CED's reuse of global memory reduces computation and the amount of global cache that needs to be maintained, SWA Bounded Replay serves as a complementary mechanism that fills the structural gap in local memory at a small, fixed computational cost while also reducing storage requirements.

Another technology used to reduce the KV cache is △Compressed Sparse Attention 2 (CSA2), △along with FP4 quantization. CSA2 allows multiple layers to share and reuse KV and attention indices, reducing the duplication that would otherwise occur when each layer maintains its own cache. FP4 quantization stores the global KV cache using four-bit floating-point values, reducing storage requirements compared with FP8.

DeepSeek introduced the first version of Compressed Sparse Attention (CSA) in V4. While DeepSeek Sparse Attention (DSA) selects important KV entries and performs attention only on a subset of them in long contexts, CSA first compresses the KV representations of multiple tokens into shorter representations and then sparsely selects the information it needs. In other words, CSA combines KV compression with sparse selection to reduce both KV cache size and attention computation for long contexts.

V4.1-Flash advances the approach to CSA2. Each attention layer is assigned one of three modes — Full, Reindex or Reuse — allowing multiple attention layers to share and reuse KV and the locations of important information rather than recalculating the same information at every layer. Some layers perform new calculations while others reuse existing results, reducing the memory and computation required for long contexts. Combined with FP4 KV caching, the global KV cache is reduced to 890 bytes per token, about one-quarter the size of the V4-Flash cache.

Reducing the number of active parameters while maintaining performance lowers the GPU memory and computational resources required to run an AI model. That can reduce server operating and power costs and allow the same GPU resources to handle more simultaneous requests. Lower computational requirements can also reduce latency and make deployment on lower-end GPUs, on-premises servers rather than cloud infrastructure, and edge AI systems easier.

AutomationBench-AA evaluation of DeepSeek-V4.1-Flash, which measures an AI agent's ability to integrate with business software and complete automated tasks. (Source: Artificial Analysis)

If total parameters can be reduced while maintaining the same performance, the model's weight memory can also be reduced, which is the ideal outcome. If that is not possible, reducing the active parameters in an MoE model is the next-best option because fewer active parameters also mean fewer computations.

DeepSeek-V4.1-Flash has a total of 552 billion parameters, which is substantial, but activates only 8 billion parameters for input and 16 billion for output. CSA2 also sharply reduces the KV cache, allowing GPU memory to be used more efficiently. The fact that DeepSeek developed and actively deployed technologies such as CSA2 and CED in the model is particularly notable.

DeepSeek is not alone. Chinese AI companies including Moonshot AI, developer of the Kimi family, and Alibaba, developer of Qwen, are expanding model parameter counts or advancing their models through proprietary technologies. Questions remain, however, over allegations that some Chinese AI companies illegally distilled capabilities from U.S. frontier models.

Anthropic recently said that seven Chinese AI companies had attempted to extract capabilities from its Claude models without authorization, and disclosed cases involving Alibaba, Moonshot AI and DeepSeek.

According to Anthropic's findings, Alibaba linked more than 151 million interactions with Claude to its own models. Anthropic said Alibaba created large numbers of accounts to send queries to Claude and collect its responses, then used the data to train or improve its own AI models. In effect, Claude's responses were used as teacher-model data.

In Moonshot AI's case, more than 23 million interactions were identified. Particularly problematic, according to Anthropic, was that Moonshot forwarded questions entered by actual Kimi users to Claude and then displayed Claude's responses to those users as if they had been generated by Kimi. Anthropic also said Moonshot subsequently used the collected user questions and Claude responses in developing its own models.

For DeepSeek, Anthropic said it identified about 12.1 million interactions. Anthropic alleged that DeepSeek also sent large numbers of queries to Claude to collect responses and used them for model distillation.

↑