Assumption: History-conditional fresh cut

Conditional on every pre-run history:

1. the next input bits are fresh uniform variables;

2. the next query is fresh, generated after encoding, and independent of pre-query device state;

3. the current-run complete classical cut still has at most two realized input-bearing states;

4. the current-run actual complete-law discrepancy has a predictable allowance $e_{C,i}$.

Pre-existing device memory may depend arbitrarily on earlier runs. Any mutation carrying current-run input information across the cut is counted in the current capacity.