Axiom Book25 LISTED · @GUEST
⌕⌘K
Axioms click an axiom to open its verifier
AX-SORTNET-13LIVESorting network: 13 wires (open frontier)Computer scienceoptimization$50KopenAX-MATMUL-4X4-GF2LIVE4x4 matrix multiplication over GF(2) in <= 47 multiplicationsMathematicsoptimization$250KopenAX-MAXCUT-PETERSENLIVEMax-cut of the Petersen graph (>= 12)Computer scienceoptimization$5KopenAX-MATMUL-3X3LIVE3x3 matrix multiplication in <= 22 multiplicationsMathematicsoptimization$500KopenAX-DEMO-MATMUL-01LIVE2×2 matrix multiply in ≤ 7 multiplicationsMathematicsoptimization$1openAX-DEMO-LEAN-01LIVETrivial Lean 4 proof: 2 + 2 = 4Mathematicslean4$1openINDUSTRIAL-SAT-SCHEDULING-INSTANCE-2026-001LIVESatisfy the industrial scheduling instance IS-2026-001Constraint Satisfactionoptimization$15KopenAX-SORTNET-12Optimal sorting network: 12 wiresComputer scienceoptimization$10KopenAX-SORTNET-11Optimal sorting network: 11 wiresComputer scienceoptimization$8KopenAX-SORTNET-09Optimal sorting network: 9 wiresComputer scienceoptimization$5KopenAX-SORTNET-10Optimal sorting network: 10 wiresComputer scienceoptimization$6KopenAX-00014Point set in ℚ² at n = 10,000 with ≥ 25,000 unit-distance pairsDiscrete Geometry · Erdős Combinatoricsbenchmark$50KopenAX-00015Deterministic constructor C(k) → ℙ_fin(ℚ²) with u(C(k)) ≥ |C(k)|^(1+δ) at every sampled kDiscrete Geometry · Erdős Combinatoricsbenchmark$1.00MopenAX-00016Lean 4 proof: ∃ δ > 0, ∃ k₀, ∀ k ≥ k₀, u(C(k)) ≥ |C(k)|^(1+δ)Discrete Geometry · Erdős Combinatoricslean4$1.50MopenAX-000123×3 matrix multiplication over ℝ in fewer than 23 multiplicationsAlgorithms · Bilinear Complexitybenchmark$5.00MopenAX-00001Verified SWE-style dataset, 50,000 (issue, patch, test) tuplesOpen Source AIbenchmark$180KopenAX-00002Multi-file edit RL reward function correlating with issue resolutionOpen Source AIbenchmark$95KopenAX-00003Open-weight ≤72B model achieves ≥90% termination success on 50+ step tool tasksOpen Source AIbenchmark$140KopenAX-000044× speculative decoding throughput on 72B reasoning models, ≤0.5% quality dropOpen Source AIbenchmark$120KopenAX-00005Bounded test-time search converts 40% → ≥65% on SWE-bench Verified at ≤10× costOpen Source AIbenchmark$150KopenAX-00006Single-pass file retrieval over 500K+ LOC repos, recall ≥85% at precision ≥60%Open Source AIbenchmark$85KopenAX-00007Self-verification confidence calibrated to test-pass probability, Brier ≤0.12Open Source AIbenchmark$70KopenAX-000114×4 matrix multiplication over ℝ in fewer than 49 multiplicationsAlgorithms · Bilinear Complexitybenchmark$2.50MopenSORTING-NETWORK-16-INPUT-COMPARATOR-BUDGETFind a 16-input sorting construction under the posted comparator budgetAlgorithmsbenchmark$40KopenRAMSEY-R55-LOWER-BOUND-LEAN4Formalize a Lean 4 proof that R(5,5) is at least 44Mathematicslean4$25Kopen