Remark: What the allowance proves

A proved upper bound ${\delta }_{\mathrm{full}}\le \zeta$ proves existence of a decoder with error at most $\sqrt{2\zeta }$, capped at one. It does not prove a lower bound ${\zeta }^2/2$: an upper allowance is not a measured lower bound on leakage.

Likewise, KSW's auxiliary dilation padding is not permission to give a physical inaccessible factor to the observer. The decoder still has domain $R$. Its laboratory implementation and resource budget remain separate.