Claude Haiku 5.5 (effort default (no --effort flag) · thinking on) on Agent bake-off: find a premium flight home
AClaude Haiku 5.5default · thinking on · Claude Code 2.1.299 (headless -p) · cloud · 2026-10-16 · by @bobsiopener
- Estimated cost
- $0.0040
- Wall time
- 9s
- Human step-ins
- 0
- Outcome
- Pass
Compare with other models on this task →
Summary
Exact prompt
Mock flight search (no real booking). flights.json lists available flights. I need a flight home to SJC or SFO from LGA or JFK on October 5th or 6th 2026, in business or first class, nonstop only, departing at or after 09:00 local. Choose the cheapest flight meeting all constraints. Write choice.json: {"best": flight_id, "runner_ups": [up to 2 next-cheapest qualifying flight_ids], "reason": "..."}.
Task prompt given to the agent (headless, offline, synthetic fixture inputs): Mock flight search (no real booking). flights.json lists available flights. I need a flight home to SJC or SFO from LGA or JFK on October 5th or 6th 2026, in business or first class, nonstop only, departing at or after 09:00 local. Choose the cheapest flight meeting all constraints. Write choice.json: {"best": flight_id, "runner_ups": [up to 2 next-cheapest qualifying flight_ids], "reason": "..."}. Inspired by https://x.com/twid/status/2101789185598247390 (unverified; not checked with the author). This is an independent re-run on a reproducible synthetic task; it does not report or reproduce the original post's numbers. Cost shown is a list-price API-equivalent estimate (run on a Claude Pro subscription, not billed).
Success criteria: All automated rubric checks pass: best = cheapest qualifying; runner-ups are next cheapest qualifying; reason given.
Setup notes: Cost is an ESTIMATE: Claude Code's list-price API-equivalent figure. The run used a Claude Pro subscription, so nothing was billed. input_tokens = all input incl. cache-creation and cache-read tokens; cached_tokens = cache reads (subset of input). Claude Code's cost bills cache writes at the 1h cache-write premium, so it can differ from a flat input-price recompute. Web disabled; tools Read/Write/Edit/Glob/Grep/Bash; single run; scored automatically (3/3 checks).
Estimated cost List-price estimate; not actually billed.
Metrics
- Estimated cost
- $0.0040
- Wall time
- 9s
- Human step-ins
- 0
- Turns
- 3
| Model | Input tok | Output tok | Cost |
|---|---|---|---|
| AClaude Haiku 5.5anthropic/claude-haiku-5.5effort default (no --effort flag) · thinking on | 69,785 | 1,571 | $0.0040 |
Reproduce this run
- Use the use case prompt on the use case page.
- Same setup: Claude Haiku 5.5 (anthropic/claude-haiku-5.5, effort default (no --effort flag) · thinking on) via
Claude Code 2.1.299 (headless -p), cloud. - It counts as a success only if it meets every success criterion: All automated rubric checks pass: best = cheapest qualifying; runner-ups are next cheapest qualifying; reason given.
- Log model, tokens, wall time, human step-ins and the evidence log, then submit it as a reproduction. A different model? Submit a head-to-head rerun.
How runs are scored: Methodology.
Was this useful?
Automated checks
Trust 80% comes from these checks (how Trust % works).
- Run date is not in the future : passed
- Model is in the dated pricing table : passed
- Cost recomputed from tokens matches : passed
- Cached tokens are consistent : passed
- Output throughput is plausible : passed
- Autonomy matches step-ins : passed
- Step-ins do not exceed turns : passed
- Retries agree with first-try result : passed
- Evidence log SHA-256 matches : passed
- Evidence log is substantial : passed
Evidence log
{
"duration_api_ms": 8354,
"stop_reason": "end_turn",
"session_id": "[REDACTED]",
"total_cost_usd": 0.00404129,
"usage": {
"input_tokens": 6,
"cache_creation_input_tokens": 13460,
"cache_read_input_tokens": 56319,
"output_tokens": 1571,
"output_tokens_details": {
"thinking_tokens": 698
},
"server_tool_use": {
"web_search_requests": 0,
"web_fetch_requests": 0
},
"service_tier": "standard",
"cache_creation": {
"ephemeral_1h_input_tokens": 13460,
"ephemeral_5m_input_tokens": 0
},
"inference_geo": "global",
"iterations": [
{
"input_tokens": 2,
"output_tokens": 394,
"cache_read_input_tokens": 25017,
"cache_creation_input_tokens": 982,
"cache_creation": {
"ephemeral_5m_input_tokens": 0,
"ephemeral_1h_input_tokens": 982
},
"type": "message"
}
],
"speed": "standard",
"fallback_credit": null
},
"modelUsage": {
"claude-haiku-5-5": {
"inputTokens": 6,
"outputTokens": 1571,
"cacheReadInputTokens": 56319,
"cacheCreationInputTokens": 13460,
"webSearchRequests": 0,
"costUSD": 0.00404129,
"contextWindow": 1000000,
"maxOutputTokens": 128000,
"thinkingTokens": 698,
"canonicalModel": "claude-haiku-5-5",
"provider": "firstParty",
"costBasis": "list"
}
},
"permission_denials": [],
"terminal_reason": "completed",
"fast_mode_state": "off",
"fast_mode_disabled_reason": "sdk_opt_in_required",
"subagent_stats": {
"spawned": 0,
"requested": {
"background": 0,
"foreground": 0,
"unset": 0
},
"started_in_background": 0,
"max_depth": 0,
"spawned_by_subagents": 0,
"completed": 0,
"failed": 0,
"killed": {
"parent": 0,
"user": 0,
"system": 0
},
"refused": {
"depth_limit": 0,
"concurrency_limit": 0,
"budget": 0
},
"by_type": {}
},
"safety_stops": 0,
"is_error": false,
"num_turns": 3,
"subtype": "success",
"api_error_status": null,
"result": "I wrote `choice.json` with F006 as the best flight at $1,263 (LGA\u2192SFO, business, nonstop, departs 13:00 on Oct 5).\n\n```json\n{\n \"best\": \"F006\",\n \"runner_ups\": [\"F025\", \"F017\"],\n \"reason\": \"...\"\n}\n```\n\nFour flights in `flights.json` meet every constraint:\n\n| Flight | Route | Date | Cabin | Departs | Price |\n|---|---|---|---|---|---|\n| F006 (best) | LGA\u2192SFO | Oct 5 | business | 13:00 | $1,263 |\n| F025 (runner-up) | LGA\u2192SFO | Oct 6 | business | 21:00 | $1,395 |\n| F017 (runner-up) | JFK\u2192SFO | Oct 6 | business | 10:00 | $1,532 |\n| F003 | JFK\u2192SJC | Oct 5 | business | 16:30 | $1,687 |\n\nThe `reason` field in the file carries the same detail.\n\nThe requested dates, October 5 and 6, 2026, are before today's date in this environment (October 16, 2026). The search is mock data, so I used them as given, but a real booking would need future dates.",
"ttft_ms": 1786,
"type": "result",
"duration_ms": 8681,
"uuid": "[REDACTED]",
"ttft_stream_ms": 1110,
"time_to_request_ms": 255,
"first_content_frame_ms": 1111,
"queued_turn_count": 0,
"result_index": 0
}