RunOpus 5.5repeat 1
Propose-select on Twelve HTTP status codes, by the book
claude-opus-5-5__propose-select__research-status-codes__r1
Score
1.000
- Cost
- $0.874
- Latency
- 1m 19s
- setup 0.0s, grading 0.3s
- Turns
- 32
- Tool calls
- 27
- Subagents
- 3
- Tokens in / out
- 251k / 17k
- 178,563 read from cache
Did the design run?
- Run completed: heldharness.run-completedThe environment was built, the architecture returned and grading finished, none of them throwing.
- No API failures: heldharness.apiNo model call failed at the API.
- Every call ended: heldharness.calls-endedEvery call ended with a result, or was stopped by the run's own limits.
- No harness tool denied: heldharness.harness-toolsThe sandbox guard never denied a harness tool, nor a tool the session itself offered.
- Tool servers connected: heldharness.mcp-connectedEvery tool server the harness gave a call was connected when the session started.
- No foreign tool servers: heldharness.mcp-hermeticNo call loaded a tool server the harness did not give it.
- Builtin tools: heldharness.builtin-toolsA check recorded with the run.
- Structured replies arrived: heldharness.structured-outputEvery call that asked for structured output and ran to the end got it.
- No silent fallbacks: heldharness.not-degradedNo phase fell back on a default (an empty plan, a default winner) instead of its output.
- All three proposers ran: heldpropose-select.proposalsThree proposers ran in parallel, each from its own angle, and none was starved while another ran.
- The selector chose: heldpropose-select.selectionThe selector picked a proposal by a valid number, read from its schema reply and not a default.
- Each call was shown the right tools: heldpropose-select.toolsEach proposer was shown the read-only tools, the selector none, and the executor the full toolset.
Phases
Drawn from the phase records: timing and cost per call, no tool calls or messages.
| Phase | Duration | Cost | Turns | Tools | Model |
|---|---|---|---|---|---|
| Proposal 1 (policy-first) | 40.6s | $0.229 | 10 | 9 | claude-opus-5-5 |
| Proposal 2 (state-first) | 35.3s | $0.215 | 10 | 9 | claude-opus-5-5 |
| Proposal 3 (outcome-first) | 36.8s | $0.257 | 10 | 9 | claude-opus-5-5 |
| Select | 38.3s | $0.173 | 2 | 0 | claude-opus-5-5 |
The call-by-call replay is not published for this run. Traces are large, so the repository keeps 9 of this run set’s 900 and leaves the rest out; the score, phases and final answer on this page come from the committed run record.
Runs you can replay
- A gate that blocked the right moveGated-execute · Haiku 4.5
- Three proposals beat one agentPropose-select · Haiku 4.5
- A verifier that earned its keepPlan-execute-verify · Sonnet 5.5
- A revision that did not helpPlan-execute-verify · Haiku 4.5
- The control, missing a stepSingle · Haiku 4.5
Record this cell yourself: npm run bench -- run --strategies propose-select --tasks research-status-codes --models claude-opus-5-5 --repeats 1
Score breakdown
- passstatus code 2031.00weight 0.08
quote verified in rfc9110
- passstatus code 2061.00weight 0.08
quote verified in rfc9110
- passstatus code 3031.00weight 0.08
quote verified in rfc9110
- passstatus code 3071.00weight 0.08
quote verified in rfc9110
- passstatus code 3081.00weight 0.08
quote verified in rfc9110
- passstatus code 4051.00weight 0.08
quote verified in rfc9110
- passstatus code 4101.00weight 0.08
quote verified in rfc9110
- passstatus code 4131.00weight 0.08
quote verified in rfc9110
- passstatus code 4141.00weight 0.08
quote verified in rfc9110
- passstatus code 4211.00weight 0.08
quote verified in rfc9110
- passstatus code 4221.00weight 0.08
quote verified in rfc9110
- passstatus code 5011.00weight 0.08
quote verified in rfc9110
Penalties
No penalties were applied.
Scorer metadata
- corpus
- {"version":2,"snapshot":"2026-10-01","hash":"9841e181cc36236e3bc98c18c73e938cf003a35611d0f06c8d8da6ee7161ee1f","documents":6}
- opened documents
- ["rfc9110"]
- opened by role
- {"primary":["rfc9110"]}
- displayed share
- {"rfc9110":0.0911}
- cited count
- 1
- verified count
- 1
- hallucinated count
- 0
- citation integrity
- 1
- hallucinated urls
- []
- answer block
- true
- answer block repaired
- false
- items answered
- 12
- item count
- 12
- field accuracy
- 1
- grounded items
- 12
- field misses
- {}
Final answer
The current HTTP Semantics specification is RFC 9110, and every value below comes from https://www.rfc-editor.org/rfc/rfc9110.html (as read by the proposals; I couldn't open the page myself).
How cacheability was decided: The status-code overview (§15.1) lists the codes "defined as heuristically cacheable (e.g., 200, 203, 204, 206, 300, 301, 308, 404, 405, 410, 414, and 501 in this specification)". It adds that "all other status codes are not heuristically cacheable" (https://www.rfc-editor.org/rfc/rfc9110.html). Each code's own section agrees with that list:
- Cacheable (true): 203, 206, 308, 405, 410, 414 and 501. Each of these sections says "A NNN response is heuristically cacheable".
- One difference for 206: its section only says "unless otherwise indicated by explicit cache controls". It doesn't also mention the method definition, as the others do.
- Not cacheable (false): 303, 307, 413, 421 and 422. Their sections don't say this, and they aren't on the §15.1 list.
Two current reason phrases worth checking: RFC 9110 calls 413 "Content Too Large" (§15.5.14) and 422 "Unprocessable Content" (§15.5.21).
About the quotes: Each one comes from the code's own numbered section. The page wraps its text across lines, so the lines are joined with single spaces and nothing else is changed.
{"answers":[
{"code":"203","reason":"Non-Authoritative Information","section":"15.3.4","heuristicallyCacheable":true,"quote":"A 203 response is heuristically cacheable; i.e., unless otherwise indicated by the method definition or explicit cache controls (see Section 4.2.2 of [CACHING]).","url":"https://www.rfc-editor.org/rfc/rfc9110.html"},
{"code":"206","reason":"Partial Content","section":"15.3.7","heuristicallyCacheable":true,"quote":"A 206 response is heuristically cacheable; i.e., unless otherwise indicated by explicit cache controls (see Section 4.2.2 of [CACHING]).","url":"https://www.rfc-editor.org/rfc/rfc9110.html"},
{"code":"303","reason":"See Other","section":"15.4.4","heuristicallyCacheable":false,"quote":"A 303 response to a GET request indicates that the origin server does not have a representation of the target resource that can be transferred by the server over HTTP.","url":"https://www.rfc-editor.org/rfc/rfc9110.html"},
{"code":"307","reason":"Temporary Redirect","section":"15.4.8","heuristicallyCacheable":false,"quote":"Since the redirection can change over time, the client ought to continue using the original target URI for future requests.","url":"https://www.rfc-editor.org/rfc/rfc9110.html"},
{"code":"308","reason":"Permanent Redirect","section":"15.4.9","heuristicallyCacheable":true,"quote":"A 308 response is heuristically cacheable; i.e., unless otherwise indicated by the method definition or explicit cache controls (see Section 4.2.2 of [CACHING]).","url":"https://www.rfc-editor.org/rfc/rfc9110.html"},
{"code":"405","reason":"Method Not Allowed","section":"15.5.6","heuristicallyCacheable":true,"quote":"A 405 response is heuristically cacheable; i.e., unless otherwise indicated by the method definition or explicit cache controls (see Section 4.2.2 of [CACHING]).","url":"https://www.rfc-editor.org/rfc/rfc9110.html"},
{"code":"410","reason":"Gone","section":"15.5.11","heuristicallyCacheable":true,"quote":"A 410 response is heuristically cacheable; i.e., unless otherwise indicated by the method definition or explicit cache controls (see Section 4.2.2 of [CACHING]).","url":"https://www.rfc-editor.org/rfc/rfc9110.html"},
{"code":"413","reason":"Content Too Large","section":"15.5.14","heuristicallyCacheable":false,"quote":"The 413 (Content Too Large) status code indicates that the server is refusing to process a request because the request content is larger than the server is willing or able to process.","url":"https://www.rfc-editor.org/rfc/rfc9110.html"},
{"code":"414","reason":"URI Too Long","section":"15.5.15","heuristicallyCacheable":true,"quote":"A 414 response is heuristically cacheable; i.e., unless otherwise indicated by the method definition or explicit cache controls (see Section 4.2.2 of [CACHING]).","url":"https://www.rfc-editor.org/rfc/rfc9110.html"},
{"code":"421","reason":"Misdirected Request","section":"15.5.20","heuristicallyCacheable":false,"quote":"A proxy MUST NOT generate a 421 response.","url":"https://www.rfc-editor.org/rfc/rfc9110.html"},
{"code":"422","reason":"Unprocessable Content","section":"15.5.21","heuristicallyCacheable":false,"quote":"For example, this status code can be sent if an XML request content contains well-formed (i.e., syntactically correct), but semantically erroneous XML instructions.","url":"https://www.rfc-editor.org/rfc/rfc9110.html"},
{"code":"501","reason":"Not Implemented","section":"15.6.2","heuristicallyCacheable":true,"quote":"A 501 response is heuristically cacheable; i.e., unless otherwise indicated by the method definition or explicit cache controls (see Section 4.2.2 of [CACHING]).","url":"https://www.rfc-editor.org/rfc/rfc9110.html"}
]}Provenance of the numbers on this page
- run set
- scaffold-or-scale-v1
- models
- Haiku 4.5, Sonnet 5.5, Opus 5.5
- effort
- high
- repeats
- 2
- fixtures
- replay
- runs
- 900 / 900
- strategy cost
- $354.44
- judge cost
- $9.19
- wall clock
- 9h 48m
- git
- fce5807b2d
Cost excludes judge calls, which are tracked separately so a scoring model never flatters or penalises an architecture. Every figure on this site is read from results/ at build time.