Claude Opus 5.5 in Claude Code 2.1.280
skills off
Zoom, inline player and more ways to view
The model's own page, run in a sandboxed frame only when you ask (a page that needs its own origin opens in a new tab on a separate demo site). Phones get a full-screen player capped at 1.5x pixel density (2x on larger screens) so it stays smooth; the original page runs uncapped. Tap inside for sound.
Wall time 17m 55sCost $3.53 estimated
Review
No verdict yet.
The full review
OK. Finished on its own after 17.9 min.
Scores
AI judge
Not scored
No rubric for this prompt
Visitor votes and reviewer grades are not available yet.
- AI judge
- AI judge: the test runner (model claude-opus-5-5), scoring by visual review of the 1600 px render against the pre-registered rubric. No AI-judge score exists for this result: there is no rubric for this prompt, so no score is shown and none is made up.
- Visitors
- Public voting with a blind reveal is coming: you score the output first, then see the other scores.
- Reviewer
- The reviewer's own grade appears here once it is added.
Scores compare results for the same prompt only. AI-judge boards rank runs within one prompt, equal totals sharing a rank; scores from different prompts are never averaged.
Downloads
Files actually published for this run. Original output, site-made previews and post-run conversions are labelled separately.
The exact prompt
as run, 2,010 characters. Every result for this prompt
Build a minimum spanning tree race on a map of 40 towns: the towns are random points connected by a Delaunay-style or k-nearest-neighbour road network with weights equal to road length. Two panels side by side (stacked on narrow screens) run Kruskal's and Prim's algorithms at the same time on the same graph, one primitive step per tick. Kruskal's panel shows the edge list sorted by weight on the side with a cursor moving down it, each considered edge flashing, accepted edges turning bright, rejected edges (that would make a cycle) crossing out red, and the union-find forest drawn as coloured town groups that merge as edges are added. Prim's panel shows the growing tree from a starting town, the priority queue of frontier edges as a small sorted list, and the cheapest frontier edge being chosen each step. Count edges considered and total weight so far in each panel; when both finish, overlay them to show they found the same total weight, and highlight any edges where ties made them differ. Controls: town-count slider (10 to 120), layout presets (uniform, clustered, ring, grid with jitter), start town for Prim (click or tap a town), speed slider, play, pause, step, reset. So the page is alive without input, on load it races automatically and then starts a new random map after a 3 second pause, forever, until the user touches a control. Make it look like a beautiful glowing night map. Save it as index.html in the current directory: one self-contained file with inline CSS and JavaScript only, no libraries or frameworks, and no external requests of any kind (no CDNs, web fonts, images or audio files). It must work when opened directly from disk, fit any window from a 390 px wide phone to a desktop, and run without console errors. You may serve it locally and open it in headless chromium (/usr/bin/chromium, software WebGL, no GPU) to screenshot and inspect your own output, and iterate on your own before finishing. Close any browser you open as soon as you've taken your screenshot.
How it was made
Versions saved during the run
6 intermediate outputs, in the order the model wrote them.
No transcript was delivered with this result.
Cost breakdown
Headline cost $3.53, estimated from the token counts at list price.
| Tokens by type | Tokens | $ per 1M | Cost |
|---|---|---|---|
| Input (uncached) | 60 | $4.00 | $0.0002 |
| Cache write | 179,039 | $5.00 | $0.8952 |
| Cache read | 3,449,097 | $0.20 | $0.6898 |
| Output | 97,186 | $20.00 | $1.9437 |
| of which reasoning | 54,639 | billed as output |
- Total computed from tokens
- $3.5290
- Total reported by the harness
- none
Computed from harness-reported token counts x list prices.
Prices: Project price table (vendor list prices), 2026-09-22.
Run notes
- frozen prompt (written): written 2026-10-05 for the MR category expansion (owner request: 500 finished runs in every category); category algorithm_visualizers; zero results
- plain wave-1-equivalent cc_config copy (settings.json + .claude.json; no ECC files)
- Mode: interactive TUI in tmux (160x48), inside bubblewrap sandbox
- Context setting: 1M ([1m] model name)
- Isolation audit: none
- Renderer: Canvas 2D (getContext('2d') at index.html line 534) plus DOM/CSS UI and inline SVG; single self-contained index.html, no CDN and no external assets.
- Card video: the run's own session capture (headless Chromium, no GPU), re-encoded as H.264. Poster: the run's own render.png.
- Same frozen prompt as the other rows on this test; configurations differ and all rows are unscored, so this is not a head-to-head result.