Erdős Problem #670: Diameter with Separated Distances
resolvedconfidence 70%
VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
Precise statement
Erdős asked whether every $n$-point set in Euclidean space whose pairwise distances are mutually at least 1 apart must have diameter at least $(1+o(1))n^2$. Disproved: an explicit high-dimensional construction beats the conjectured constant.
The source statement is reproduced for indexing with attribution. Mathematical correctness requires domain-expert or mechanical review. VibeMath has not independently audited statement
fidelity, correctness, priority, or novelty.
What AI did
GPT-5.4 Pro, Harmonic Aristotle
"GPT-5.4 Pro was used to discover the construction of this paper, and Harmonic Aristotle was used to formalize the proof in Lean 4, with some assistance from GPT-5.4 Pro." All arguments independently verified by the author.
The proof is formalized in Lean 4 by Harmonic Aristotle; the formalization is public. Tier: the formalization is by Harmonic Aristotle with author verification only - and as of August 2026, erdosproblems.com still lists #670 as OPEN, so the canonical tracker has not yet accepted the disproof.
VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
Known method families
construction (source-reported)
Source-reported tools: construction.
Independent: unknown · difference confidence: 0
What remains uncertain
VibeMath has not independently audited the mathematical statement, proof, or novelty claim.
VibeMath has not independently verified the mathematical claim.
AI-attempt independence and training-data exposure are unknown unless explicitly documented.
VibeMath has not independently audited the mathematical statement, proof, or novelty claim.