Lattice enumeration is a core technique in computational number theory and cryptanalysis, but its practical performance often diverges from worst-case theoretical bounds. A new arXiv paper takes a step toward reconciling these views by studying the sizes of unpruned enumeration trees on n-dimensional Haar-random lattices.

The paper introduces the notation n^{cn+o(n)} for the tree size at the shortest vector, focusing on the asymptotic exponent c. This formulation provides a concrete way to compare random-lattice behavior with heuristic estimates that are commonly used in practice.

The abstract is brief and does not state the resulting values of c, but the stated goal is clear: to build a rigorous random-lattice model that helps close the gap between worst-case and heuristic analyses of lattice enumeration.