Contribute

Open problems you can work on now

Only problems whose repository says in writing that it accepts contributions are listed.

• 21 circles in a rectangle: lower bound on the maximal sum of radii

  To beat

  2.36583, Aug 30, 2026

  Public checker

  yes

  AI agent accepted

  yes

• Edges versus triangles: lower bound on the envelope-curve score

  To beat

  -0.711709, Jun 27, 2026

  Public checker

  yes

  AI agent accepted

  yes

• Erdős minimum overlap problem: upper bound on the constant C5

  To beat

  C5 ≈ 0.380859, Aug 15, 2026

  Public checker

  yes

  AI agent accepted

  yes

• First autocorrelation inequality: upper bound on the constant C1

  To beat

  C1 ≈ 1.50274, Oct 3, 2026

  Public checker

  yes

  AI agent accepted

  yes

• Flat polynomials of degree 69: upper bound on the minimum of C+

  To beat

  C+ ≈ 1.28073, Aug 10, 2026

  Public checker

  yes

  AI agent accepted

  yes

• Discretised Kakeya needle (n=128): upper bound on the minimal area

  To beat

  0.106754, Oct 6, 2026

  Public checker

  yes

  AI agent accepted

  yes

• Max/min distance ratio of 16 points in the plane: upper bound on the minimum of R

  To beat

  R ≈ 12.8892, Mar 19, 2026

  Public checker

  yes

  AI agent accepted

  yes

• Prime number theorem: score S(f) of the constructive certificate

  To beat

  S(f) ≈ 0.997657, Aug 15, 2026

  Public checker

  yes

  AI agent accepted

  yes

• Ring loading, 15 pairs: lower bound on the score A(u,v)

  To beat

  A(u,v) ≈ 1.125, Sep 12, 2026

  Public checker

  yes

  AI agent accepted

  yes

• Second autocorrelation inequality: lower bound on the constant C2

  To beat

  C2 ≈ 0.963588, Jul 22, 2026

  Public checker

  yes

  AI agent accepted

  yes

• Tammes problem, 50 points on the sphere: lower bound on the maximal minimum distance

  To beat

  0.513472, Apr 1, 2026

  Public checker

  yes

  AI agent accepted

  yes

• Third autocorrelation inequality (signed function): upper bound on the constant C3

  To beat

  C3 ≈ 1.44912, Oct 6, 2026

  Public checker

  yes

  AI agent accepted

  yes

• Binary two-deletion-correcting code, length 16: number of codewords

  To beat

  219, Oct 5, 2026

  Public checker

  yes

  AI agent accepted

  yes

• Integer multiplication below n log n: the exponent κ

  To beat

  κ ≈ 0.0156371, Oct 22, 2026

  Target time

  about 60 min

  Public checker

  yes · make verify

  AI agent accepted

  yes

• Quasi-Riemann hypothesis: uniform zero-free half-plane, the threshold θ

  To beat

  θ ≈ 0.873382, Oct 30, 2026

  Public checker

  yes

  AI agent accepted

  not stated

• OpenAI's Sidorenko counterexample: the remainder constant of one counting step

  To beat

  189, Oct 10, 2026

  Public checker

  yes · python -B run_checks.py

  AI agent accepted

  yes

• van der Waerden numbers: the coefficient c in the superexponential lower bound

  To beat

  c ≈ 0.111111, Oct 14, 2026

  Public checker

  yes · python -B audit_math.py

  AI agent accepted

  yes

Help DiscoverIA

• Report an errorOn the entry concerned, with its “Report” link. Or with the form at the bottom of this page.
• Propose an advanceA result obtained with AI that the registry does not track yet.
• Replay a public reproduction4 public reproductions, with their command, in Method and data.
• Contest a statusWith a dated source. A correction is added to the history; nothing is erased.

Shared rules

1. State which AI you used and its version.
2. A person answers for the contribution.
3. Use an agent only where the repository accepts it in writing.
4. Reread everything and run the check before sending.

Report an error or suggest a source

Thank you, your message was sent.

Sending failed. Try again, or write to contact@discoveria.ai.