# Family 104: deterministic game reference and distinct companion contracts

Four source variants received selected-section review, with six pages visually checked. The scope, randomized Comparator/configuration and solution entry were read. Imported proof closure, kernel and source executable acceptance remain open.

A bounded exact implementation of deterministic Procedure 4.1 and independent region checker add 1,097 controls. All 324 complete two-vertex cases finish; nineteen of thirty three-vertex cases return unknown at the default cap. Every completed answer matches the tiny exhaustive oracle, which supplies accepted threshold-region certificates for all 368 generated games. Some elementary recursions require hundreds of thousands of calls or exhaust two million charges. No competitive advantage is established.

The randomized wrapper has enormous repetitions when reached; its Basic branch can bypass them. Stochastic binary parameters are not numerical iteration counts. Expected/almost-sure payoff, finite memory, value-optimality and initial credit need separate contracts. Retain a specialist research integration at low confidence. [Dossier](../../../../opportunities/018-mean-payoff-strategy-plugin/2026-10-09-v2.md), [comparison](../../../../prototypes/mean-payoff-comparison-2026-10-09-v1/report.md).