D231 - The loop dispatches rather than chooses

Status: decided Date: 2026-08-25

Each finding kind maps to a fixed step, and a sweep step is exhaustive. A model is used only to name an unnamed hash; an unimplemented function maps to a person, and a step with no rule states why.

Why: a guest boot against a wall costs a fraction of a second, so exhausting the space is faster than asking a model to choose within it. Model-found names and string-harvested names are disjoint, so that one branch is measured rather than preferred. Re-ranking what the report already ranks would claim knowledge the run does not have.

Rejected:

• A model choosing the next experiment: slower than running all of them.
• A model writing implementations: no oracle.