Claude Haiku 4.5 vs Claude Haiku 5.5
什么时候选哪个
claude-haiku-5-5 是新一代,价格只有十分之一:输入 $0.1、输出 $0.5,claude-haiku-4-5 为 $1 和 $5,缓存读取为 $0.01 对 $0.1。各项上限也有提高:上下文为 1000000 token 对 200000,输出上限为 128000 token 对 64000,知识截止为 2026-06 对 2025-02,提示词达到 512 token 即可缓存,而 claude-haiku-4-5 需要 4096。切换前有两点要确认:超过 100000 token 的提示词按 5x 计费,同一段文本经它的分词器计出的 token 数要多约 30%。即便如此,对大多数工作负载来说升级后仍然更便宜。
Benchmark 成绩
Claude Haiku 5.5:供应商没有公布 benchmark 成绩。
供应商公布: Alibaba (Qwen) Anthropic ByteDance Google Moonshot OpenAI Tencent Z.ai
价格
| Claude Haiku 4.5 | Claude Haiku 5.5 | Δ | |
|---|---|---|---|
| 输入 / 1M token | $1 | $0.1 | 10× |
| 输出 / 1M token | $5 | $0.5 | 10× |
| 缓存读取 / 1M token | $0.1 | $0.01 | 10× |
| 缓存写入 | 1.25x (5m) / 2x (1h) | 1.25x (5m) / 2x (1h) | - |
价格取自构建时的实时目录,最新价格见各模型页面。
两个模型所处的位置:全部 78 个按同一单位计费的聊天模型的每 1M token 输入价分布(对数刻度)
能力
| Claude Haiku 4.5 | Claude Haiku 5.5 | |
|---|---|---|
| 工具调用 | 是 | 是 |
| 思考控制 | 可配置 | 可配置 |
| 结构化输出 | 是 | 是 |
| 提示词缓存 | 显式(由你标记前缀) | 显式(由你标记前缀) |
| 缓存有效期 | 5m default, 1h option | 5m default, 1h option |
| 最小缓存前缀 | 1024 个 token | 1024 个 token |
规格
| Claude Haiku 4.5 | Claude Haiku 5.5 | |
|---|---|---|
| 输入模态 | 文本 图像 | 文本 图像 |
| 输出模态 | 文本 | 文本 |
| 发布日期 | 2025-10-15 | 2026-10-07 |
| 知识截止日期 | 2025-02 | 2026-06 |
| 上下文窗口 | 200K | 1M |
| 最大输出 | 64K | 128K |
| 思考参数 |
| output_config.effort |
| 可选值 | budget_tokens
"adaptive" returns 400 | output_config.effort
|
| 默认值 | off, with no thinking unless the request sets it | medium |
规格照录自各供应商的文档;供应商没有公布的项目,对应的行直接省略,不做推断。 完整来源: Claude Haiku 4.5 · Claude Haiku 5.5
同一条提示词,两个模型,经网关实测
Claude Haiku 4.5 通过 · 3 sentences
# Why Your LLM Bill Doubled Reasoning models like o1 and o3 process queries through extended chains of thought before responding, consuming 5-10x more tokens internally than standard models while also charging higher per-token rates. This means both your input token usage and per-unit costs increased simultaneously—a compounding effect that easily doubles overall spend. Unless you've significantly reduced queries to other models or have very selective reasoning deployment, the math makes a doubling entirely predictable.
输出 106 tok 延迟 2.8 s
Claude Haiku 5.5 通过 · 3 sentences
Enabling reasoning makes the model generate a long internal chain of thought before its answer, and those thinking tokens are billed as output tokens, which cost several times more than input tokens. The model often produces many times more output per request than it did without reasoning, so the per-call cost rises even when the visible answer looks about the same length. Because that extra spend scales with every request, the bill roughly doubled, and we can control it by setting reasoning budgets, using reasoning only for tasks that need it, or routing simpler requests to a non-reasoning model.
输出 332 tok (+159 思考) 延迟 2.9 s
指令遵循(恰好三句,数得出来)、受众适配(对 CFO 说话的口吻),以及下方 token 计数暴露出的隐藏思考计费差额。
Claude Haiku 4.5 通过 · 8/8 cases
# Fixed Function ```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 best = max(best, cur) else: cur = 1 return best ``` # Bug Explanation The original function has two related bugs stemming from incorrect initialization and loop logic. First, `best` and `cur` start at 0, which causes single-element lists to incorrectly return 0 instead of 1—a run of one identical element should have length 1. Second, `cur` is reset to 0 (not 1) when a mismatch occurs, causing the next matching pair to be undercounted. More critically, if the longest run ends at the last index, `best` is only updated *during* the loop when a mismatch is encountered; if no mismatch follows the final run, `best` never captures it. […]
输出 310 tok 延迟 4.0 s
Claude Haiku 5.5 通过 · 8/8 cases
```python def longest_run(xs): if not xs: return 0 best = 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` counts adjacent equal *pairs*, not run *elements*. A run of k equal items produces k−1 matching pairs, so the function returns one less than the true length, and a single-element input produces no pairs at all, so it returns 0 instead of 1. Resetting `cur` to 0 on a mismatch compounds this by starting every run one step behind. The fix starts both `cur` and `best` at 1 (a non-empty list always has a run of at least one element), resets `cur` to 1 on a mismatch, and updates `best` after every element rather than only inside the equal-branch. The empty-list guard keeps the function from returning 1 for `[]`. […]
输出 1012 tok (+591 思考) 延迟 6.0 s
修复是否真的正确(能运行)、解释的信息密度,以及在一个范围明确的任务上的 token 效率。
Claude Haiku 4.5 通过 · 5/5 fields, guidance null
```json { "company": "Meridian Robotics", "quarter": "Q3", "revenue_usd_m": 412, "growth_pct": 11, "guidance": null } ```
输出 63 tok 延迟 1.6 s
Claude Haiku 5.5 通过 · 5/5 fields, guidance "Formal guidance withheld pending the Q4 "
```json { "company": "Meridian Robotics", "quarter": "September quarter", "revenue_usd_m": null, "growth_pct": 11, "guidance": "Formal guidance withheld pending the Q4 close" } ``` Notes: The text gives revenue as 412 but doesn't state the currency, so I left `revenue_usd_m` as null. Growth is "eleven and change," so 11 is an approximation.
输出 725 tok (+572 思考) 延迟 4.6 s
是否严守 schema(不臆造字段)、能否顶住幻觉压力(原文明说暂不给出 guidance),以及结构化输出路径的差异。
Claude Haiku 4.5 通过 · 123 words, 0 banned, 1 question
# Introducing Prompt Cache Across Providers We're excited to announce our latest API gateway feature: intelligent prompt caching that works across multiple AI providers. This powerful capability stores frequently used prompts and their contexts, dramatically reducing latency and API costs for your applications. By intelligently managing cached prompts across providers like OpenAI, Anthropic, and others, you can optimize your infrastructure without changing your code. Why wait for responses when cached results can be delivered instantly? The system automatically handles cache invalidation and updates, ensuring your applications always access current information while maintaining performance gains. With support for complex multi-turn conversations and dynamic content, this feature scales seamlessly with your business needs. […]
输出 165 tok 延迟 3.0 s
Claude Haiku 5.5 通过 · 120 words, 0 banned, 1 question
**Introducing Prompt Cache Sync, the newest feature in GatewayOne.** Teams routing requests across OpenAI, Anthropic, and Google have often paid to process the same long system prompts again and again. Now the gateway stores those prompts once and reuses them wherever they appear, regardless of provider. Repeated context is matched by content hash, so cached prefixes return faster and cost less, with no changes to your application code. How much could this save your team? Enable Prompt Cache Sync from the dashboard, and your next billing report will show the difference. Cache entries follow your existing retention settings and can be purged per project at any time. Availability begins this week for all Scale and Enterprise plans worldwide. Start today.
输出 2164 tok (+1929 思考) 延迟 9.9 s
是否守住约束(字数预算、禁用词表、只能有一个问句)、文风特征,以及长度控制。
改一行代码就能在两个模型之间切换
下方每个标签页里都有两个模型 ID,高亮的那两行是唯一要改的地方。端点不变,API key 不变,请求结构也不变。
from openai import OpenAI
client = OpenAI(
base_url="https://synthorai.io/v1",
api_key="sk-syn-...",
)
resp = client.chat.completions.create(
model="claude-haiku-4-5",
# model="claude-haiku-5-5", # 取消注释此行,注释上一行
messages=[{"role": "user", "content": "Summarize this diff"}],
)
print(resp.choices[0].message.content)import OpenAI from "openai";
const client = new OpenAI({
baseURL: "https://synthorai.io/v1",
apiKey: "sk-syn-...",
});
const resp = await client.chat.completions.create({
model: "claude-haiku-4-5",
// model: "claude-haiku-5-5", // 取消注释此行,注释上一行
messages: [{ role: "user", content: "Summarize this diff" }],
});
console.log(resp.choices[0].message.content);curl https://synthorai.io/v1/chat/completions \
-H "Authorization: Bearer sk-syn-..." \
-H "Content-Type: application/json" \
-d '{
"model": "claude-haiku-4-5",
# "model": "claude-haiku-5-5", # 取消注释此行,注释上一行
"messages": [{"role": "user", "content": "Hello"}]
}'package main
import (
"context"
"fmt"
"github.com/openai/openai-go/v3"
"github.com/openai/openai-go/v3/option"
)
func main() {
client := openai.NewClient(
option.WithBaseURL("https://synthorai.io/v1"),
option.WithAPIKey("sk-syn-..."),
)
resp, _ := client.Chat.Completions.New(context.TODO(), openai.ChatCompletionNewParams{
Model: "claude-haiku-4-5",
// Model: "claude-haiku-5-5", // 取消注释此行,注释上一行
Messages: []openai.ChatCompletionMessageParamUnion{
openai.UserMessage("Summarize this diff"),
},
})
fmt.Println(resp.Choices[0].Message.Content)
}import com.openai.client.OpenAIClient;
import com.openai.client.okhttp.OpenAIOkHttpClient;
import com.openai.models.chat.completions.*;
OpenAIClient client = OpenAIOkHttpClient.builder()
.baseUrl("https://synthorai.io/v1")
.apiKey("sk-syn-...")
.build();
ChatCompletion resp = client.chat().completions().create(
ChatCompletionCreateParams.builder()
.model("claude-haiku-4-5")
// .model("claude-haiku-5-5") // 取消注释此行,注释上一行
.addUserMessage("Summarize this diff")
.build());
System.out.println(resp.choices().get(0).message().content().orElse(""));常见问题
Claude Haiku 4.5 和 Claude Haiku 5.5 哪个更便宜?
按「输入 / 1M token」算,Claude Haiku 5.5 更便宜($0.1 对 $1,相差 10×)。其他计费项的结论可能相反,完整价格见上方表格,实际成本取决于你的用量构成。
不用分别集成两次,就能对 Claude Haiku 4.5 和 Claude Haiku 5.5 做 A/B 测试吗?
可以。两个模型走同一个 OpenAI 兼容端点,用同一个 API key,切换时只要改一行里的模型名,所以可以给两个模型各分一部分流量,直接对比账单。
Claude Haiku 4.5 和 Claude Haiku 5.5 支持提示词缓存吗?
支持。两个模型的缓存读取价都低于各自的输入价,所以前缀能反复命中缓存的负载,实际成本会比按官网价估算的低。具体的缓存读取价见上方价格表。