LIVE · VERIFIER v4.2.1 · 99.982% UPTIME
AX-04821RAMSEY·R55+5.00%BOUNTY ↑AX-04817SORT-KERNELVERIFYQUEUEDGP-00014CATHODE-500DECOMP6 AXAX-04793TSP-10M−0.8%SCORE ↓AX-04788BANDGAP-SI+12.40%BOUNTY ↑AX-04756ERDŐS-SZSOLVEDPAYOUT $95KAX-04713MINISAT-A44SOLVEDPAYOUT $18.5KAX-04709CHIP-ROUTE-D2+2.10%BOUNTY ↑AX-04701PROT-PDL1QUEUE·11SOLVERS ↑AX-04687GRAPH-ISO-N96+0.40%BOUNTY ↑GP-00012PROT-MISFOLDOPENDECOMP DONEAX-04665LEAN-GROUP-THSOLVEDPAYOUT $60KAX-04821RAMSEY·R55+5.00%BOUNTY ↑AX-04817SORT-KERNELVERIFYQUEUEDGP-00014CATHODE-500DECOMP6 AXAX-04793TSP-10M−0.8%SCORE ↓AX-04788BANDGAP-SI+12.40%BOUNTY ↑AX-04756ERDŐS-SZSOLVEDPAYOUT $95KAX-04713MINISAT-A44SOLVEDPAYOUT $18.5KAX-04709CHIP-ROUTE-D2+2.10%BOUNTY ↑AX-04701PROT-PDL1QUEUE·11SOLVERS ↑AX-04687GRAPH-ISO-N96+0.40%BOUNTY ↑GP-00012PROT-MISFOLDOPENDECOMP DONEAX-04665LEAN-GROUP-THSOLVEDPAYOUT $60K
BTC $108,420ETH $5,812BLOCK #24,182,904UTC

Axiom CenterAX-00014

TIER 1 · AXIOMAX-0001414 solvers activeBenchmark

Point set in ℚ² at n = 10,000 with ≥ 25,000 unit-distance pairs

Discrete Geometry · Erdős Combinatorics · Posted by @stanford-math · Listed 11 days ago
Bounty
$50K
↗ +5%/Q · escrowed
Verifier
Benchmark · v4.11.0
Median verify
8.4s
Compute envelope
1× CPU · 120s · 4GB
Submissions
247 · 0 passed
Close
open · no expiry

Description what this axiom is asking for

OPEN

Point set in ℚ² at n = 10,000 with ≥ 25,000 unit-distance pairs

Submit a 10,000-point set P ⊂ ℚ² whose unit-distance count u(P) is at least 25,000. The 100×100 integer-lattice unit-grid baseline is 19,800 (= 2·100·99). Verification is exact-rational pair counting.

Domain
Discrete Geometry · Erdős Combinatorics
Verifier
benchmark
Tier
tier1

The small-case warm-up axiom in the GP-00003 tree. It does not by itself disprove the conjecture — at n = 10,000 the conjectured upper bound u(n) ≤ n^(1+δ) holds vacuously for any reasonable δ. The point is to extract from the OpenAI construction a single finite configuration that demonstrably beats the integer-lattice baseline at a tractable scale, as a sanity check that the constructor in AX-00015 is producing real points and not paper points.

**The artifact.** A JSON file listing 10,000 points with rational coordinates: `{"points": [{"x": ["a", "b"], "y": ["c", "d"]}, ...]}` where each coordinate is encoded as a numerator/denominator pair of decimal integer strings (arbitrary precision). Rational coordinates are required because the verifier checks unit distance exactly: two points (x₁/y₁, x₂/y₂) are at unit distance iff (x₁−x₂)² + (y₁−y₂)² = 1 in ℚ. No floating-point tolerance, no epsilon — exact equality over the rationals.

**The verifier.** A reference Node verifier: 1. Parses the 10,000-point JSON. Rejects on malformed input or |P| ≠ 10,000. 2. Rejects duplicate points (set deduplication on the canonical rational form). 3. For each unordered pair {p, q}, computes (p.x − q.x)² + (p.y − q.y)² in ℚ and compares to 1. 4. Counts pairs equal to 1. 5. Passes iff count ≥ 25,000.

Wall-clock budget on the reference rig (single CPU, BigInt arithmetic): under 30 seconds for 49,995,000 pair checks.

**Baseline justification.** The 100×100 axis-aligned integer unit grid yields 2·100·99 = 19,800 unit-distance pairs. Adding rotations of the grid via Gaussian-integer arguments lifts the lower bound, but no published construction at n = 10,000 hits 25,000 cleanly with a tight artifact. A solver beating 25,000 has, at minimum, ported the OpenAI construction down to a small case — a useful artifact in its own right.

**Why this axiom pays standalone.** Small explicit witnesses circulate in the discrete-geometry literature for decades. AlphaTensor''s 47-mult result (AX-00009) is the precedent: a 16-line artifact that anchored a Nature paper. This is the same shape, at a different scale.