exhibit d / measurement
Three products. Three things that can't be checked automatically.
Every product has one quality property no test can assert — whether the voice is good, whether the scoring is fair, whether it's safe to publish. So I build the grader for that property, and then I take it out of the product. Three products in six weeks; read them in order, because the grader work matures across them.
01
Yapword
started 2026-05-23Is the character's voice good — and what does it cost?
the graderA multi-turn bench that walks whole games through the real prompt builder, sweeping the model's thinking level.
the result~82% of inference COGS was invisible thinking. Zero thinking preserved the voice. The highest setting burned 8,991–11,663 tokens per game — $80–105 per 1k games — and was not better.
02
Yapoleon's Court
started 2026-06-15Is the scoring rubric fair, learnable, and un-gameable?
the graderYapword's harness, forked and re-pointed at a different measurement: 30 demands x weak/mid/strong, plus a fixed-mold probe, against the live judge.
the result72.2% mid / 0% weak / 96.7% strong — a clean skill gradient. Fixed mold 0% off-axis. 5 of 5 anti-gaming probes pass live. 1,095 calls, 0 errors.
03
That's My Best
started 2026-07-01Is it safe to publish when the classifier itself is unreliable?
the graderA fail-closed state machine with quorum voting over an injectable classifier — extracted out of the product entirely.
the resultShipped as llm-safety-gate: zero-dependency, MIT, every failure path unit-tested without a network.
the arcAd hoc → reused → extracted as infrastructure.
The first harness was written for one product's problem. The second product didn't get a new one — the first was forked and aimed at a question it was never built for, which is the first evidence the method transfers. By the third, the grader stopped living inside the product at all and shipped as a standalone library someone else can inject their own classifier into.
What makes a grader trustworthy with no reference implementation
Code can be graded against a reference build. Voice, fairness, and taste cannot. So the scoring function is validated by its properties instead.
01
Learnable
Better input must score better
Strong 96.7% > mid 72.2% > weak 0%. If the ordering breaks, the rubric is broken.
02
Not template-farmable
The negative control
One fixed rhetorical mold, applied to all 30 days, must lose on its off-axis days. It wins 0%.
03
Not gameable
Five adversarial probes, live
Naked flattery, prompt injection, legitimate audacity (the false-positive check), delimiter breakout, grovel-on-economy. All pass.
04
Bounded authority
The model never emits the score
It returns five clamped axis sub-scores; a pure server-side function the model cannot see or reach computes the result.
05
Honest about noise
Distributions, not point values
Hosted inference is not bit-reproducible at low temperature, so every cell runs at least three times and the spread is reported.
The calibration also produced a finding I kept rather than buried: the target was specified as a median win-rate, and the median turned out to be bimodal and degenerate — an offline sweep of hundreds of candidate curves found zero with a median in band. The mean is smooth and stable across independent runs. The document says so, and says why.