Zador's celebrated theorem is a cornerstone of optimal quantisation: it establishes both the weak limit of the empirical distribution of an optimal
n-point quantiser in
Rd and the decay rate of the associated
Ls-mean quantisation error. In large dimension, however, observing this asymptotic behaviour requires an astronomically large sample size. We prove that, for spherically symmetric target distributions, optimisation over all spherically symmetric distributions is a convex problem and derive an equivalence theorem that both characterises global optimality and yields a constructive algorithm. We show that, for moderate
n, random quantisers uniformly distributed on a sphere of suitably chosen radius
R perform exceptionally well and, over a broad range of values of
n, are numerically certified to be optimal among all random quantisers. Their expected distortion has an explicit integral representation that can be evaluated to arbitrary precision, and we prove concentration across random quantisers: the distortion variance tends to zero as
n→∞ for fixed
d. For
s=2, both the optimal radius and the associated minimum expected distortion admit exact expressions. For general
s, the optimal radius can be determined efficiently, and extreme-value theory provides useful approximations when
n grows with
d. Depending on this growth rate,
R either converges to zero or approaches a positive limit that is independent of
s.