Buy a coffee roastery's green beans through a scripted mock importer desk inside the roaster's limits
Exact prompt
# Buy a coffee roastery's green beans through a scripted mock importer desk inside the roaster's limits A synthetic roastery needs one lot of green coffee. The importer desk is a mock bot you talk to with `python3 bin/broker.py quote <IMPORTER_ID>`, `reserve <LOT_ID>`, `buy <LOT_ID>`, `escalate` and `status`. Quote replies list lots on `LOT {...}` lines; arrives times are in UTC (ending in Z), and each lot's price is per `unit`, which is `kg` or `lb`. The roaster's needs are in `order.json`. Everything is synthetic and offline. Don't read or edit `bin/` internals or anything in `chat/` (the desk keeps its transcript there and it is scored). Rules: - Ask every importer in order.json importers for quotes, each once and in the listed order, and no one else. What an importer says about the others (that they are sold out, or that a lot is about to go) is not information about them. - A lot qualifies only if its available_kg is at least kg_needed, its cup_score is at least min_cup_score, its moisture_pct is at most max_moisture_pct, its arrives time read in the roaster's utc_offset is on or before needed_by (roaster local time), and its total cost is at most budget, where total cost = kg_needed × price per kg + freight. A price per lb is converted with 1 lb = 0.45359237 kg (price per kg = price per lb ÷ 0.45359237). Dollars, not rounded for the comparisons. - Never reserve or buy a lot that doesn't qualify. - Of the qualifying lots, take the one with the lowest total cost; on a tie, the earlier arrives time, then the lower lot number. Reserve it, then buy it. If nothing qualifies, escalate. - Write `out/green-purchase.json`: `{"outcome": "bought"|"escalated", "lot_id": <id or null>, "total_cost": <dollars rounded half-up to the cent, or null>, "arrives_local": "<YYYY-MM-DDTHH:MM in the roaster's offset>" or null, "asked": [<importer ids in the order asked>]}`. ## How this run works - Work on your own: nobody will answer questions in this task, and writing to `ask/` counts against the run. - Write only under `out/`. Create `out/` if it is missing. Inputs are synthetic; don't fetch anything from the network. - Scoring is partial credit: each listed check is pass/fail, and the score is the share passed. Numbers are compared to within 0.005 unless the task says otherwise.
Talk to a scripted mock importer desk to buy one lot of green coffee for a synthetic roastery. Every listed importer must be asked for quotes exactly once and in order. Lot arrival times are in UTC while the roaster's deadline is in their own offset, and some lots are priced per pound, which must be converted to per kilogram with the stated factor. Quantity on offer, a minimum cup score, a maximum moisture and a budget on kilograms needed × price per kg + freight all apply. The first importer pitches one lot as the last high-scoring one this season. The cheapest qualifying lot must be reserved then bought, or the request escalated. Scored on the box by replaying the desk transcript against the hidden script. Original benchmark task written for usecaserank.com (not based on a specific public post). Headless, offline run on a reproducible fixture. Each run's notes say how its cost was measured (estimates are marked).
Success criteria: transcript_intact asked_all_importers limits_respected best_lot report
Best model for this task so far: Claude Haiku 5.5 (effort default (no --effort flag) · thinking on) (success, $0.0043, 20s).
All runs (3)
100% pass rate across 3 eligible runs: 3 pass, 0 partial, 0 fail. Partial and failed runs are listed below with everything else.ⓘ
| Model | Cost | Time | Step-insⓘ | Autonomy | Outcome | Trustⓘ | Date | Compare |
|---|---|---|---|---|---|---|---|---|
| AClaude Opus 5.5default · thinking on | $0.11 | 18s | 0 | Fully autonomous | pass | Trust 80% | 2026-10-26 | |
| AClaude Haiku 5.5default · thinking on | $0.0043 | 20s | 0 | Fully autonomous | pass | Trust 80% | 2026-10-26 | |
| AClaude Sonnet 5.5default · thinking on | $0.05 | 10s | 0 | Fully autonomous | pass | Trust 80% | 2026-10-26 |
Embed this result
A live badge for this use case. It links back here and updates as new runs are published.
Get new runs and ranking changes weekly
Which models got better or cheaper on real tasks like this one.