How densely can spheres be packed with moderate effort in high dimensions?

We generate non-lattice packings of spheres in up to 22 dimensions using the geometrical constraint satisfaction algorithm RRR. Our aggregated data suggest that it is easy to double the density of Ball’s lower bound, and more tentatively, that the exponential decay rate of the density can be improved relative to Minkowski’s longstanding 1/2.