Assumption: Complete storage and access boundary

For the wholly classical comparison:

1. conditional on an input-independent random resource $\lambda$, the complete retained state available to decoding has at most $K$ classical values;

2. no additional current-input-dependent register, record, timing signal, parameter change, or environment can influence decoding except through that state;

3. $\lambda$ is independent of the fresh $X,J$, and does not become an uncounted current-input-dependent storage variable;

4. the query is not accessible during encoding;

5. the scoring record is not accessible to decoding.

The main benchmark uses $K=2$.