AI Model Reviewer

GPT-6 Astra in Codex CLI 0.156.1

skills off

← Open in the gallerySame prompt, all models

Zoom, inline player and more ways to view
Poster frame of GPT-6 Astra's page
Open the original page

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.

OKEdit distance dpmax effortNeutral harness

Wall time 18m 40sCost $5.26 estimated

Review

No verdict yet.

The full review

OK. Finished on its own after 18.7 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, 1,997 characters. Every result for this prompt

Build a dynamic programming visualizer centred on edit distance (Levenshtein). Show two words and the full DP table between them; fill it one cell per tick, for each cell highlighting the three neighbours it reads (left, up, diagonal), showing the candidate costs for insert, delete and substitute or match, and writing the minimum with a small pop. Colour the table as a heatmap as it fills. When the table is complete, trace back the optimal path from the bottom-right corner with a glowing line, then animate the alignment below: the first word morphing into the second letter by letter, with insertions, deletions and substitutions coloured and labelled, ending on the final distance. Beside it show a second, smaller panel solving the 0/1 knapsack problem (8 items, capacity 15) with the same cell-by-cell filling and a traceback that lights up the chosen items. Controls: two text inputs for the words, word-pair presets (kitten/sitting, intention/execution, sunday/saturday, algorithm/altruistic), speed slider, play, pause, step, reset, and a toggle to show the recurrence formula for the current cell. So the page is alive without input, on load it starts solving the first preset automatically and then cycles through the presets with a 3 second pause between them, forever, until the user touches a control. Make it the clearest explanation of dynamic programming anyone has seen.

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

Wall time 18m 40sFirst artifact at 10m 46s4 saved versions

Versions saved during the run

4 intermediate outputs, in the order the model wrote them.

Version 4 of 4
  1. Version 1 at 10m 48s thumbnailv1 10:48
  2. Version 2 at 14m 55s thumbnailv2 14:55
  3. Version 3 at 15m 15s thumbnailv3 15:15
  4. Version 4 at 18m 32s thumbnailv4 18:32

No transcript was delivered with this result.

Cost breakdown

Headline cost $5.26, estimated from the token counts at list price.

Tokens by typeTokens$ per 1MCost
Input (uncached)60$10.00$0.0006
Cache write89,671$10.00$0.8967
Cache read1,160,604$1.00$1.1606
Output64,015$50.00$3.2008
of which reasoning20,984billed as output
Total computed from tokens
$5.2587
Total reported by the harness
none

Computed from harness-reported token counts x list prices. Cache writes priced at the input rate (the price table has no separate cache-write price).

Prices: Project price table (vendor list prices), 2026-09-22.

Run notes

one prompt, agentic harness (self-review allowed)

  • 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 CODEX_HOME copy (config.toml only, run work/ trusted; no AGENTS.md/skills/state)
  • Mode: interactive TUI in tmux (160x48), inside bubblewrap sandbox
  • Isolation audit: outside paths seen
  • Renderer: DOM + CSS with inline SVG (no canvas); 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.