No, Mathematica doesn't have a built in function for equidistant points on hyperspheres so you'll have to do it yourself. This simulates the 'electrostatic repulsion' of points and is unfortunately very slow for many points - it's a $\mathcal{O}(n^2)$ algorithm.
update[points_] :=
Normalize /@ (Total[
Outer[Subtract, points, points,
1]/(DistanceMatrix[points,
DistanceFunction -> SquaredEuclideanDistance] +
IdentityMatrix[Length@points])])
(** measure the standard deviation of nearest point distance
- lower means more equidistant **)
stdev[points_] := With[{nf = Nearest@points},
StandardDeviation[EuclideanDistance[#, Last@nf[#, 2]] & /@ points]]
SeedRandom[1];
dimensions = 5;
iterations = 8;
init = RandomPoint[Sphere[dimensions], 500];
result = Nest[update, init, iterations];
stdev[init] (* 0.0824725 )
stdev[result] ( 0.0389372 *)
RandomPoint[Sphere[5], 100]– Bob Hanlon Jul 06 '21 at 18:33