Assumption: Fresh inputs and late-query access

For one attempted run:

1. $X=(X_1,X_2)$ consists of independent uniform bits;

2. all freely admitted pre-existing random resources $\Lambda$ are independent of $X$;

3. $J\in \{1,2\}$ is generated uniformly at $Q_{\mathrm{gen}}$, independently of $X,\Lambda$ and the complete pre-query device state;

4. no query value, correlated prediction of it, or query-dependent control reaches an encoding event;

5. the scoring archive has no feedback path to the current decoder;

6. timing, readiness, and stopping controls are either input independent or explicitly included in the complete access model.