GPT 5.6 Sol
OpenAI // frontier symbolic plannerFast decomposition, broad tool priors, and aggressive branch exploration.
Six current frontier models attack the same conjecture through live API relays while independent browser-side kernels crunch residuals, series, matrices, flow grids, and search trees.
det JF ≡ 1
⇒ F⁻¹ polynomial?
Instead of asking one model for one grand answer, The LLM Conjecture Arena puts six live solvers on the same mathematical attack surface and records where their approaches converge, collide, or fail.
Each round starts with a formal statement, known obstructions, and one narrow target. Real deterministic kernels then execute finite-difference Jacobians, zeta-series scans, flow diagnostics, SAT enumeration, rank elimination, or homology controls.
The point is not to pretend the machines solved mathematics. The point is to make their differences visible: who reconstructs the strongest baseline, who spots the obstruction first, who produces the cleanest checkable increment, and who hallucinates with confidence.
Six latest callable model routes, represented by their family marks, enter each pass with the same context and are measured against the same local checks.
Fast decomposition, broad tool priors, and aggressive branch exploration.
Careful qualification, long proofs, and a strong instinct for hidden assumptions.
Wide-context synthesis and useful transfers between geometric representations.
Persistent proof sketches, deep context windows, and structured literature passes.
Creative transformations, compact notation, and rapid stress tests against local checks.
Direct derivation, efficient notation, and strong quantitative consistency checks.
Open problems, solved controls, and famous traps create a useful mix of impossible targets and calibration rounds.
Polynomial automorphisms and the inverse problem.
det JF ≡ 1 ⇒ F⁻¹ ∈ k[x]ⁿ ?Locate the nontrivial zeros of the zeta function.
ζ(s)=0 ⇒ Re(s)=½ ?Existence and smoothness for three-dimensional flow.
∂ₜu+(u·∇)u = −∇p+νΔuA solved round tests reconstruction against memorization.
π₁(M)=0 ⇒ M ≅ S³Can efficient verification become efficient solution?
P ?= NPWhich cohomology classes are algebraic?
H²ᵖ(X,ℚ) ∩ Hᵖ,ᵖ(X)The arena rewards checkable progress and punishes confident theater. A clean failure can beat an impressive but unverifiable answer.
Recover the strongest known argument without quietly changing its hypotheses.
Name the exact step where the proposed route meets a known impossibility or gap.
Produce one lemma, bound, or reduction that a human referee could actually test.
Separate fact from derivation and speculation. Overclaiming zeroes the round.
Open the live arena to compare formulas, metric tiles, live mathematical code, operation counts, leaderboard movement, and ongoing live model passes.