Quality-constrained model routing

Find the cheapest route that still clears the quality floor.

Evaluate candidate model routes across a fixed task set, reject any route below the quality threshold, and explain the lowest-cost passing combination.

Try the fixture No sign-in · precomputed from the tested fixture
06

One product.

One decision.

Visible evidence.

Interactive proof

Reveal the verified fixture.

This exact 3-model × 20-case CSV is evaluated by product.py.

01

The tested result is ready to inspect.

Reveal the expected decision generated by the product's deterministic acceptance fixture.

How it works

Small surface. Clear chain of proof.

01

Fix the eval

Hold cases, scoring, and the quality floor constant across candidates.

02

Enumerate

Search complete routing combinations instead of hand-picking a winner.

03

Select

Choose the lowest measured cost among routes that pass every constraint.

Exactly 20 single-task casesQuality bounded to 0–100Positive baseline cost