新用戶 免費註冊,送 10 次呼叫,最高 $1,免綁卡。

DeepSeek V4 Flash vs DeepSeek V4.1 Flash

vs

何時用哪一個

兩者皆具備 1,000,000 token 的上下文長度與 393,216 token 的最大輸出,並支援工具與推理,因此升級的考量在於輸入與價格的對比:deepseek-v4.1-flash 增加了圖片輸入,輸入費用為 $0.3(約 2.2x),輸出費用為 $1.2(約 4.4x),而僅支援文字的 deepseek-v4-flash 則分別為 $0.138 與 $0.275,其快取讀取費用為 $0.03 對比 $0.0028(約 10.7x)。針對高用量文字聊天與程式碼任務,若較低的費率及可關閉思考選項是重要考量,請繼續使用 deepseek-v4-flash;當您需要傳送圖片時,請轉換至 deepseek-v4.1-flash。

Benchmark 成績

高於同儕均值無人分數更高DeepSeek V4 Flash僅 2 項可比DeepSeek V4.1 Flash16 / 194 / 19
DeepSeek V4 Flash DeepSeek V4.1 Flash 其他被測模型 同儕均值 無人分數更高
NL2Repo
N/A
64%
Cybergym
N/A
無人分數更高 88.1%
GPQA Diamond
N/A
90.9%
Agents' Last Exam
N/A
31.8%
BabyVision with tools
N/A
89.6%

廠商公布: Alibaba (Qwen) Anthropic ByteDance DeepSeek Google MiniMax Moonshot OpenAI Tencent Z.ai

定價

DeepSeek V4 Flash DeepSeek V4.1 Flash Δ
輸入 / 1M tokens $0.138 $0.3 0.46×
輸出 / 1M tokens $0.275 $1.2 0.23×
快取讀取 / 1M tokens $0.0028 $0.03 0.093×
快取寫入 不額外計費 不額外計費 -

費率取自建置時的即時目錄;各模型頁面皆附有目前的費率卡。

它們的相對位置 — 在此計費單位下,所有 69 個 聊天 模型的 每 1M tokens 的輸入價格(對數尺度)

能力

DeepSeek V4 Flash DeepSeek V4.1 Flash
工具使用
思考控制 可配置 是 —— 廠商未公布調節參數
結構化輸出 -
提示快取 隱式(自動) 隱式(自動)
快取生命週期 no fixed TTL (evicted when unused) no fixed TTL (evicted when unused)
最小快取前綴 未公開 未公開

規格

DeepSeek V4 Flash DeepSeek V4.1 Flash
輸入模態 文字 文字 影像
輸出模態 文字 文字
發布日期 2026-04-24 2026-09-10
上下文視窗 1M 1M
最大輸出 393K 393K
思考參數
  • thinking.type
  • reasoning_effort
-
可接受的值
thinking.type
  • enabled
  • disabled
reasoning_effort
  • high
  • max (low and medium map to high, xhigh maps to max)
-
預設值

enabled, with reasoning_effort high

some complex agent requests are automatically set to max

-

規格摘錄自各供應商的文件;供應商未發布的資料列會直接省略,而非自行推測。 完整來源: DeepSeek V4 Flash · DeepSeek V4.1 Flash

單一提示詞,兩款模型 — 經由閘道測量

提示詞 Explain to a CFO, in exactly three sentences, why our LLM bill doubled after we enabled reasoning. 檢查 恰好 3 句

DeepSeek V4 Flash 通過 · 3 sentences

When reasoning is enabled, the model generates additional "chain-of-thought" tokens internally before producing the final answer, effectively doubling the total token count per request. Since our billing is based on tokens processed, this directly doubled your usage. Additionally, reasoning often requires more expensive model tiers or higher compute resources, further amplifying the cost increase.

輸出 154 tok (+85 思考) 延遲 3.1 s

DeepSeek V4.1 Flash 通過 · 3 sentences

Enabling reasoning changed the unit economics: the model now spends extra billable tokens internally to “think” before producing the answer, and those reasoning tokens are charged like output tokens even though users never see them. That added token generation—plus longer contexts and occasional retries on harder prompts—roughly doubled our cost per request. We can control this by capping reasoning depth, routing only complex queries to reasoning models, and caching common prompts to bring the bill back down.

輸出 423 tok (+327 思考) 延遲 14.6 s

指令遵循(恰好三句,可數)、受眾適配(面向 CFO 的語氣),以及下方 token 計量所暴露的隱藏思考計費缺口。

提示詞 This function is supposed to return the longest run of consecutive equal items, but callers report it is off by one on single-element inputs and misses runs that end at the last index. Fix it and explain the bug in one paragraph. 檢查 修復通過測試

DeepSeek V4 Flash 通過 · 8/8 cases

The bug is that the function counts the number of consecutive equal **pairs** (i.e., `cur` increments for each `i` where `xs[i] == xs[i-1]`), but it should return the **length** of the longest run. For a run of length `L`, the number of pairs is `L-1`, so the result is always one less than the correct value. This causes the function to return 0 for a single‑element list (expected 1) and to undercount runs that end at the last index (e.g., `[1,1]` returns 1 instead of 2). Additionally, runs of length 1 that are not part of any pair (such as a single element at the end of a list) are never considered because `best` is only updated when a pair is found. […]

輸出 2494 tok (+2227 思考) 延遲 19.4 s

DeepSeek V4.1 Flash 通過 · 8/8 cases

```python def longest_run(xs): if not xs: return 0 best = 1 cur = 1 for i in range(1, len(xs)): if xs[i] == xs[i - 1]: cur += 1 else: cur = 1 best = max(best, cur) return best ``` The bug is that `cur` is counting equal adjacent pairs, not elements in the current run: every time `xs[i] == xs[i - 1]`, the run length increases by one element, but the first element of the run was never counted, so all runs are undercounted by one. Also, `best` starts at `0`, so single-element inputs return `0` instead of `1`, and a one-element run ending at the last index is missed entirely.

輸出 918 tok (+733 思考) 延遲 11.4 s

修復是否真的正確(可執行)、解釋的資訊密度,以及在一個邊界明確的任務上的 token 效率。

提示詞 Extract a JSON object with fields {company, quarter, revenue_usd_m, growth_pct, guidance} from this text. Use null for anything not stated; add no other fields. 檢查 合法 JSON,schema 精確

DeepSeek V4 Flash 通過 · 5/5 fields, guidance null

{ "company": "Meridian Robotics", "quarter": "Q3", "revenue_usd_m": 412, "growth_pct": null, "guidance": null }

輸出 1101 tok (+1054 思考) 延遲 10.2 s

DeepSeek V4.1 Flash 通過 · 5/5 fields, guidance "withheld pending the Q4 close"

{"company":"Meridian Robotics","quarter":"September quarter","revenue_usd_m":412,"growth_pct":11.0,"guidance":"withheld pending the Q4 close"}

輸出 1707 tok (+1667 思考) 延遲 15.1 s

schema 服從度(不臆造欄位)、幻覺壓力(guidance 明確被暫緩給出),以及結構化輸出路徑的差異。

提示詞 Write a 120-word product announcement for an API gateway feature that caches prompts across providers. Forbidden words: "seamless", "unlock", "game-changer", "revolutionize", "empower". Exactly one sentence must be a question. 檢查 120 詞,0 個禁用詞

DeepSeek V4 Flash 通過 · 119 words, 0 banned, 1 question

We're thrilled to introduce Prompt Cache, a new feature for our API Gateway that stores prompt responses from any provider. When a user submits a prompt you've already processed, the system returns the cached result instantly—eliminating redundant API calls and reducing latency. This works across OpenAI, Anthropic, Google, and more, with automatic cache invalidation based on your rules. What does this mean for your budget? Fewer API calls directly lower your monthly spend. Additionally, response times drop by up to 80% for cached prompts, improving user experience. Developers can configure cache duration per provider, set TTLs, and bypass cache when needed. The feature is available now in your gateway dashboard. Start saving time and money with Prompt Cache.

輸出 2039 tok (+1887 思考) 延遲 15.6 s

DeepSeek V4.1 Flash 通過 · 116 words, 0 banned, 1 question

Today we're launching Cross-Provider Prompt Cache for our API gateway. It stores identical prompt requests and their responses across supported model providers, then serves cached results when a match is found. Teams can cut duplicate inference costs, reduce latency, and keep behavior consistent during provider failover. The cache works with configurable TTLs, per-route rules, and cache-key controls, so you decide what is reusable and what must stay fresh. Does your application send the same prompts to multiple providers? Now your gateway can answer many of those calls without another upstream request. Existing observability dashboards show hit rates, saved tokens, and estimated spend reduction. Enable it in the gateway console, set your policy, and start caching today.

輸出 917 tok (+770 思考) 延遲 9.0 s

約束服從度(字數預算、禁用詞表、唯一的那句問句)、文風指紋,以及長度控制。

只需一行程式碼即可在兩者間切換

以下每個頁籤中都有這兩個 ID — 醒目提示的這兩行是唯一的修改處。相同的端點,相同的金鑰,相同的請求結構。

from openai import OpenAI

client = OpenAI(
    base_url="https://synthorai.io/v1",
    api_key="sk-syn-...",
)

resp = client.chat.completions.create(
    model="deepseek-v4-flash",
    # model="deepseek-v4.1-flash",  # 取消註解此行,並註解上一行
    messages=[{"role": "user", "content": "Summarize this diff"}],
)
print(resp.choices[0].message.content)

取得 API 金鑰 →

常見問題

DeepSeek V4 Flash 和 DeepSeek V4.1 Flash 哪個比較便宜?

DeepSeek V4 Flash 在 輸入 / 1m tokens 上較便宜($0.138 對比 $0.3,相差 2.2×)。其他項目可能呈現相反結果 — 上表提供完整資訊,實際成本取決於您的使用組合。

我可以在不進行兩次整合的情況下,對 DeepSeek V4 Flash 和 DeepSeek V4.1 Flash 進行 A/B 測試嗎?

可以。兩者皆透過同一個相容 OpenAI 的端點提供服務,並使用同一把 API 金鑰 — 切換只需更改一行的模型字串,因此您可以將部分流量分別導向兩者並直接比較帳單。

DeepSeek V4 Flash 與 DeepSeek V4.1 Flash 支援提示快取嗎?

是的 — 兩者的快取讀取費率皆低於其輸入費率,因此具有暖前綴的工作負載成本會低於牌價所示。確切的快取讀取列請見上方的定價表。

相關比較