The first construction of the baby monster was later realized as a permutation group on 13,571,955,000 points using a computer by Jeffrey Leon and Charles Sims.
[1][2] Robert Griess later found a computer-free construction using the fact that its double cover is contained in the monster group.
The smallest faithful matrix representation of the Baby Monster is of size 4370 over the finite field of order 2.
Conway and Norton suggested in their 1979 paper that monstrous moonshine is not limited to the monster, but that similar phenomena may be found for other groups.
Larissa Queen and others subsequently found that one can construct the expansions of many Hauptmoduln from simple combinations of dimensions of sporadic groups.