Date: 2026-10-23. Model: the Claude model behind Claude Code on this machine (same for both arms). Each task ran in a fresh session, once per arm, hard-isolated:
Tokens in = input + cache writes + cache reads as reported by the CLI; cost as reported by the CLI. "ok" is a correctness check against known truth (the fixtures were generated, so the truth is exact).
| Task | Without Percerno | With Percerno | Verdict |
|---|---|---|---|
| Sum revenue by region in a 100,000-row CSV (2.3 MB) | refused: "would very likely produce wrong numbers" · 9k tokens · $0.04 | correct 4/4 · 36k tokens · $0.08 · 22 s | impossible → done |
| Total of all amounts in a 3-page scanned invoice | correct (read the page images) · 14k tokens · $0.08 · 17 s | correct (OCR in sandbox) · 42k tokens · $0.08 · 65 s | same cost, slower |
| Same for a 30-page scan batch | correct · 120k tokens · $1.02 · 54 s | correct · 166k tokens (mostly cheap cache reads) · $0.18 · 508 s | 5.7× cheaper, slower |
| The 12 key figures in a 40-page Word report | correct 12/12 · 61k tokens · $0.24 | correct 12/12 · 44k tokens · $0.08 · 20 s | 3× cheaper, faster |
| Build a 6-slide PowerPoint file | no file; a Python script for the user to run · $0.07 | file delivered · 405k tokens · $0.47 · 203 s · 16 tool steps | impossible → done, but expensive |
| Write three LinkedIn posts | delivered · 4k tokens · $0.03 | delivered, run through the skill's post checker · 52k tokens · $0.17 | 5× more expensive |
read_skill and one sandbox_run: roughly 40k tokens. That tenfold
reduction is engineering we control, and it is the honest version of the "better harness,
fewer tokens" claim.Runner, fixture generators and raw results are in docs/bench/ (run.py, make.py, make30.py, results.json);
the fixtures are generated (make.py, make30.py) so the truth values are exact.