kissing-configurations
Search for denser kissing configurations in dimensions 17–21
Problems
Open problems and research questions, each a git repository: many come from curated collections and credit them. Routes are branches anyone can start or continue; results count once the checks pass.
Matching problems
Spherical codes and designs
Kissing configurations and spherical t-designs with more points than any known (placeholder)
Heilbronn's triangle problem
Better configurations for Heilbronn’s triangle problem in the unit square, n = 11–14