The Kernel–Solver Thesis: Adversarial Learning Toward Verified Mathematical Claims

Documents similaires

• Receipts That Move: The Transportable Proof Conjecture (TPC) — A Proposal for Verifiable Decisions
  par: Figurelli, Rogério
  Publié: (2025)
• Claim Verification: "The binary operator eml is defined by the expression \(\text{eml}(a, b) = \exp(a) - \ln(b)\) (where exp is the exponential function and ln is the principal branch of the natural logarithm). For every real \(x > 0\), the nested expression \(\text{eml}(1, \text{eml}(\text{eml}(1, x), 1))\) equals the natural logarithm \(\ln(x)\)." — Proved
  par: Proof Engine
  Publié: (2026)
• Claim Verification: "The binary operator eml is defined by the expression \(\text{eml}(a, b) = \exp(a) - \ln(b)\). There exists a finite binary tree consisting solely of eml operations, whose 9 leaves are drawn from \(\{1, x, y\}\), such that the tree evaluates exactly to \(x \times y\). The tree has K = 17 tokens (8 eml operations and 9 leaves), and the identity holds for all complex \(x\) and \(y\) (in the algebraic setting where \(\ln \circ \exp\) is the identity)." — Proved
  par: Proof Engine
  Publié: (2026)
• A Deterministic Architecture for Long-Horizon AI Systems
  par: Maddry, Taylor
  Publié: (2026)
• Claim Verification: "The Pyramid of Giza was built by slaves." — Disproved
  par: Proof Engine
  Publié: (2026)