Leaps in Bounds
Repository of progress on mathematical unknowns
This is a collaborative effort to compile data on historical progress on solved and unsolved mathematical constants. The focus is on quantitative updates, such as the lower and upper bounds on their values.
This site provides browsing, visualizations, and access to the structured data for other uses.
Families of Constants
1248 constants, 518 with known exact values. 993 of their 2492 current lower and upper bounds are verified here.
Evidence for current bounds: Verified certificate Attested certificate Original source Survey or database only
| Family | Constants | Exact | Evidence | Last improved |
|---|---|---|---|---|
| 03D Computability and recursion theory | ||||
| Busy beaver ones function | 7 | 5 |
5 / 12
|
2025-06-25 |
| Busy beaver shift function | 7 | 5 |
5 / 12
|
2025-06-25 |
| 05A Enumerative combinatorics | ||||
| Map folding | 87 | 42 |
79 / 174
|
2026-11-16 |
| Minimal superpermutations | 9 | 5 |
10 / 18
|
2026-10-22 |
| Stamp folding | 29 | 29 |
16 / 58
|
– |
| 05B Designs and configurations | ||||
| Optimal Golomb rulers | 30 | 28 |
36 / 60
|
2026-11-15 |
| 05C Graph theory | ||||
| Cages | 252 | 83 |
163 / 504
|
2026-11-11 |
| Coil-in-the-box | 12 | 7 |
13 / 24
|
2026-08-29 |
| Degree-diameter problem | 162 | 7 |
59 / 324
|
2026-11-16 |
| Snake-in-the-box | 13 | 8 |
19 / 26
|
2026-11-11 |
| 05D Extremal combinatorics | ||||
| Multicolor Ramsey numbers for triangles | 7 | 1 |
6 / 14
|
2026-11-13 |
| Ramsey numbers | 76 | 9 |
57 / 152
|
2026-11-11 |
| Schur numbers | 9 | 5 |
11 / 18
|
2026-11-04 |
| Van der Waerden numbers | 45 | 7 |
24 / 90
|
2022-11-20 |
| Weak Schur numbers | 9 | 4 |
12 / 18
|
2026-11-08 |
| 11M Zeta and L-functions: analytic theory | ||||
| de Bruijn–Newman constant | 1 | 0 |
0 / 2
|
2021-01-22 |
| 51E Finite geometry and special incidence structures | ||||
| Cap sets | 8 | 6 |
9 / 16
|
2023-12-14 |
| 52C Discrete geometry | ||||
| Arrangements of lines in the affine plane | 12 | 7 |
11 / 24
|
2026-11-16 |
| Arrangements of lines in general position | 12 | 9 |
10 / 24
|
2026-11-11 |
| Chromatic number of Euclidean space | 11 | 0 |
0 / 22
|
2026-10-11 |
| Circle packing in an equilateral triangle | 15 | 15 |
22 / 30
|
2020-09-02 |
| Circle packing in a square | 36 | 34 |
30 / 72
|
2021-09-29 |
| Covering a disk with disks | 25 | 20 |
12 / 50
|
2026-11-16 |
| Isosceles sets | 12 | 12 |
12 / 24
|
2026-11-02 |
| Kissing numbers | 24 | 6 |
14 / 48
|
2026-11-14 |
| No-three-in-line problem | 78 | 76 |
156 / 156
|
2026-11-05 |
| Rectilinear crossing number of the complete graph | 96 | 24 |
25 / 192
|
2015-05-26 |
| Packing unit squares in a square | 100 | 35 |
109 / 200
|
2026-09 |
| 68P Theory of data | ||||
| Fastest sorting networks | 32 | 17 |
34 / 64
|
2025-11-06 |
| Smallest sorting networks | 32 | 12 |
34 / 64
|
2026-10-19 |
Recent certificates
- 2026-11-16, bargainlandz-code: Degree-diameter problem $N(17,5)$ $\ge 167680$ New bound
- 2026-11-16, daniel-munro: 99 certificates, in Covering a disk with disks; Map folding
- 2026-11-15, daniel-munro: 77 certificates, in Busy beaver ones function; Busy beaver shift function; Circle packing in a square; and 3 more families
- 2026-11-15, bargainlandz-code: 2 certificates, in Optimal Golomb rulers
- 2026-11-14, daniel-munro: 86 certificates, in Cages; Chromatic number of Euclidean space; Degree-diameter problem; and 3 more families
See all contributions, including the latest discoveries and contributors.
Contributing
Contributions are welcome, from people and AI agents alike. Pull requests are the preferred way to contribute:
- Bounds from the literature: add published bounds, their sources, and earlier steps in their history, or new constants and families of constants. See how to add bounds and constants.
- Certificates: submit evidence that a program can check, either a construction or a proof in Lean, for a new bound or one discovered earlier. See how to submit one, and the unverified bounds for current bounds that don’t have a verified one yet.
For more open-ended contributions, such as asking whether a family of constants fits or sharing data you’re not sure how to add, start a GitHub Discussion. For technical problems and suggestions, open an issue.
Contributions are credited to the GitHub account that made them on the contributions page.
To have an AI agent contribute, give it one of these prompts:
Read https://github.com/daniel-munro/leaps-in-bounds/blob/main/certificates/README.md and follow it to submit a verified bound to Leaps in Bounds.
Read https://github.com/daniel-munro/leaps-in-bounds/blob/main/literature/README.md and follow it to add missing bounds from the literature to Leaps in Bounds, for <family or topic>.