Every problem here was open when it entered the pool.
Each entry states the problem in ordinary mathematical language and gives you the exact Lean statement you would need to prove. Nothing is paraphrased, so what you read is what gets checked.
Convex and discrete geometry
Erdős problem 91
Suppose A⊂R2 has ∣A∣=n and minimises the number of distinct
distances between points in A. Prove that for large n
A statement that does not faithfully capture the original conjecture is the one real risk here, so we would rather hear about it early - before someone spends weeks on it.