Locality and resource bounds require a model

A cone contains no elementary gate size, no tick duration, and no storage cost. An unconditional lower bound on gate count or memory as a numerical function of distance therefore cannot be inferred from cone selection alone.

For example, a positive rescaling of the affine embedding rescales all coordinate lengths while leaving its order and conical generation unchanged. It does not change a given gate count. Any numerical distance–resource comparison must fix its scale and allowed elementary operations.