Interface 3: verified data and bounded transitions

The source's process uses

Its auxiliary data include recursively generated factorizations associated with $p-1$. The process, its good-output predicates, and its retrospective transition probabilities are different objects from the root prime list. Its stated properties include a polynomial cap on every branch and completion of every all-good evolution SourceProcess.

A sound audit must therefore check:

1. acceptance means complete data, not a valid fragment;

2. all data needed retrospectively are generated and verified, not supplied as hidden advice;

3. invalid outputs also obey the time and bit-length caps;

4. a completed run is padded to exactly $L$ slots;

5. internal quantum work is counted separately from the $W$-bit transition output.

A transition-output width is not a total workspace bound.