Six Agent Variants: How to Measure What Prompt Changes Actually Do
Glancing at a new deck next to the old one is not a measurement. The video shows a two-layer eval for a slide-writing Claude agent, with code graders and an LLM judge, run across four rounds of prompt changes against a pinned baseline.
You keep editing the system prompt of a Claude agent that writes slide decks, hoping each version beats the last. The natural way to check is to open the new deck next to the old one and ship it if it looks cleaner. This video argues that a glance is not a measurement, and shows what testing a prompt change looks like round after round.
Why a glance fails
The setup is a slide-writing agent that is run on five different topics each time. The video holds on to one example. A slide-writing rule says every slide must carry a real diagram, and one grader does nothing but count whether that happened. A glance also will not catch a nine-point caption sitting under the ten-point font floor on slide four. A code grader that parses the file's actual font sizes catches it in milliseconds, with no eyeballing.
Layer one: code checks
The eval runs in two layers. The first parses the deck file directly and checks slide count, images present, cluttered slides, tiny fonts, and stray emoji. There is no model call, and each check passes or fails in milliseconds. Each one is a plain fact: present or not.
Layer two: an LLM judge
The second layer hands the rendered slide images to an LLM judge. The judge scores text, imagery, layout, color, and whether the title actually matches the body beneath it. Code checks cover defects that can be proven at parse time. The judge covers what a rule cannot express.
Three rounds, one rule each
Each round builds on a naive baseline, and every version is run against the same five fixed tasks and the same pinned baseline:
- Round one tightens typography and trims word count.
- Round two adds the mandatory diagram.
- Round three adds a QA loop. The agent rasterizes its own deck, inspects every slide for overlap and overflow, fixes what it finds, and checks again before it is done.
The round that breaks the pattern
Round four drops every one of those rules and goes back to the plain prompt, but on a stronger model. When the diagram grader is checked again, it is empty again. The point of the video is that this rule only ever lived in the prompt, so a rule that lives only in the prompt does not survive a model swap.
Both directions
When a code check fails, such as a missing diagram or a caption under the size floor, that is a concrete defect proven the moment the file is parsed, and no judgment call is needed. The reverse is also true. Passing every code check does not mean the deck is good. A slide can hit every rule and still fail to explain the idea, which is exactly what the LLM judge is there to catch.
Key takeaways
- Comparing two outputs by eye is a glance, not a measurement.
- Layer one is code that parses the output file and returns pass or fail with no model call.
- Layer two is an LLM judge scoring the rendered result against a rubric.
- Run every version against the same fixed test set and the same pinned baseline.
- A rule that exists only in the prompt may not survive a change of model.
- Passing all code checks does not prove the output is good.
- Swapping the model is a separate lever from editing the prompt.
Try it yourself
Take an agent you are iterating on. Freeze one fixed test set of real inputs, write one code check that is just a plain fact, present or not, and write one rubric a judge model can score from the rendered result. Run every version, including one where you swap the model instead of the prompt, and ask what actually moved and what only looked like it moved.
Chapters
- 0:00The naive framing: "my new prompt looks better. Done."
- 0:10Stakes: a prompt, edited again, across five tasks
- 0:19The wrong guess: glance in, glance out, ship it
- 0:27The anchor: the mandatory-diagram grader
- 0:36Broken, with a case: a font-size floor a glance can't catch
- 0:48Mechanism: layer one, the code checks
- 1:00Mechanism: layer two, the LLM judge
- 1:10Mechanism: three rounds, each adding one rule
- 1:25The anchor returns: the diagram check, empty again
- 1:38Both directions (A): a code fail, proven at parse time
- 1:47Both directions (B): all checks pass, judge still needed
- 1:57Carry-out
- 2:06Your turn
- 2:27Outro
Full transcript(auto-generated, with timestamps)
The naive framing: "my new prompt looks better. Done."
[0:00]A newcomer tweaks their agent's prompt, looks at the new deck, and calls it better. That's a glance, not a measurement. So, what does actually testing a prompt change look like round after round?
Stakes: a prompt, edited again, across five tasks
[0:10]You've got a Claude agent that writes slide decks, and you keep editing its system prompt hoping each version beats the last for five different topics every time.
The wrong guess: glance in, glance out, ship it
[0:19]The natural read, open the new deck, glance at it next to the old one, and if it looks cleaner, ship it. Glance in, glance out, decision made. Hold on to
The anchor: the mandatory-diagram grader
[0:27]One rule, every slide has to carry a real diagram, not just text and boxes, and one grader does nothing but count whether that actually happened. But a
Broken, with a case: a font-size floor a glance can't catch
[0:36]Glance won't catch a 9-point caption sitting under the 10-point floor on slide four. A code grader parses the file's actual font sizes and catches it in milliseconds. No eyeballing required. The eval runs in two layers. Layer one
Mechanism: layer one, the code checks
[0:50]Is code parsing the deck file itself, slide count, images present, cluttered slides, tiny fonts, stray emoji. No model call, pass or fail in milliseconds.
Mechanism: layer two, the LLM judge
[1:00]Layer two hands the rendered slide images to an LLM judge scoring text, imagery, layout, color, and whether the title actually matches the body underneath it. Round one just tightens
Mechanism: three rounds, each adding one rule
[1:10]Typography and trims word count. Round two adds that mandatory diagram. Round three adds a QA loop. The agent rasterizes its own deck, inspects every slide for overlap and overflow, fixes what it finds, and checks again before it's done.
The anchor returns: the diagram check, empty again
[1:25]Then round four breaks the pattern entirely. It drops every one of those rules and goes back to the plain prompt just on a stronger model. Check that same diagram grader, and it's empty again. That rule only ever lived in the prompt. When a code check fails, no
Both directions (A): a code fail, proven at parse time
[1:39]Diagram, a caption under the size floor, that's a concrete defect proven the moment the file's parsed. No judgment call needed. But every code check
Both directions (B): all checks pass, judge still needed
[1:48]Passing doesn't mean the deck is good. A slide can hit every rule and still not explain the idea, which is exactly what the LLM judge is there to catch. Score
Carry-out
[1:57]Every version against the same fixed test in the same pinned baseline. A rule that only lives in the prompt doesn't survive a model swap. Your turn. Here's
Your turn
[2:06]The prompt. Read it with me. Take an agent I'm iterating on. Freeze one fixed test set of real inputs. Write one code check that's just a plain fact present or not and one rubric a judge model can score from the rendered result. Run every version including one where I swap the model instead of the prompt against that same test and the same pinned baseline. What actually moved and what only looked like it moved? Liam in for Bear. Six agent variants, how to measure
Outro
[2:28]What prompt changes actually do. Liam in for Bear.





