The scope of a storage-error execution bound

The execution path carries quantization steps with its inputs and classifies the program before producing a bound. Linear, smooth, branch-sensitive, and refused cases have different premises. Retain the actual class and admitted assumptions with the result; a label cannot substitute for those premises.

Keep the terms separate

Sampled storage perturbations provide a probabilistic order statistic under the chosen model. They do not automatically cover every source of numerical error. An absent sampling, provider, or model term remains unmeasured unless there is a specific reason it does not apply.

A consumer must also retain substrate limitations. Scalar replay alone cannot establish a nonzero width that the current numerical implementation did not reproduce. Read the trust guide before presenting a storage-specific result as a broader uncertainty claim.