<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>AI4Math Chronicle</title><description>Major milestones in AI for Mathematics — timeline-first, evidence-backed.</description><link>https://charlie-wang-03.github.io/ai4math-chronicle/</link><item><title>OpenAI releases 722 AI-generated mathematics manuscripts across 372 result families</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/openai-722-manuscript-mathematics-release/</link><guid isPermaLink="false">evt-2026-openai-math-release</guid><description>The public repository includes an overview, a manuscript map, PDFs and sources, a Lean library and formalization catalogue, ten selected reasoning summaries and release-history commitments. OpenAI explicitly warns that some unformalized results may contain issues and says revisions will remain accessible. The release followed consultation with the independent Advisory Group on Mathematics and Artificial Intelligence. AGMAI publicly stated that its advice does not endorse the mathematics or OpenAI&apos;s process and characterized the release as the beginning of broader human understanding and community assessment.</description><pubDate>Tue, 06 Oct 2026 00:00:00 GMT</pubDate></item><item><title>Claude is credited with discovering truly subquadratic 3SUM and truly subcubic APSP algorithms</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/claude-3sum-apsp-polynomial-speedup/</link><guid isPermaLink="false">evt-2026-claude-3sum-apsp</guid><description>The paper&apos;s methodology section says an Anthropic employee initially asked an internal research model to study a cryptographic question based on average-case Zero-k-Clique. Claude unexpectedly developed a new algorithm, first for the average-case setting and then for the worst case, during a session producing about 16 million output tokens with no human input. Anthropic shared the result with Alman and Vassilevska Williams, who reconstructed the argument, simplified it, improved constants and exponents, derived additional consequences and wrote the research paper. After the paper was complete, Anthropic used a research model to formalize major deterministic claims in Lean.</description><pubDate>Mon, 05 Oct 2026 00:00:00 GMT</pubDate></item><item><title>Bizeul, Klartag and Lehec release a ChatGPT-assisted proof of the KLS conjecture</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/chatgpt-assisted-kls-proof/</link><guid isPermaLink="false">evt-2026-chatgpt-kls-proof</guid><description>In the acknowledgements, the authors state that most proofs and mathematical ideas in the paper were found by ChatGPT. They identify the suspension idea as a notable human contribution and describe their role as understanding the model&apos;s proofs, checking and organizing the mathematics and improving the exposition. The paper is currently a very recent preprint; Chronicle has not located a public proof-assistant artifact or independent specialist review sufficient to move the event beyond a paper-released verification state.</description><pubDate>Sun, 04 Oct 2026 00:00:00 GMT</pubDate></item><item><title>Meta publishes six Muse Spark–mathematician research papers, five answering open questions</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/meta-muse-spark-open-research/</link><guid isPermaLink="false">evt-2026-meta-muse-spark-open-research</guid><description>Meta says human mathematicians selected and guided the research, a separate group of mathematicians reviewed the work, each paper marks passages primarily drafted by researchers versus AI, and prior or concurrent work is credited. Muse Spark&apos;s role varied by project: it helped test and revise calculations, generated a GAP search program that found a 384-element group counterexample, proposed counterexamples and proof strategies, and generated candidate proofs and technical sections. Meta also acknowledges that several questions were independently resolved by other teams, including one semiabelian-group counterexample reported by the Nilradical AI agent before Meta&apos;s publication.</description><pubDate>Fri, 02 Oct 2026 00:00:00 GMT</pubDate></item><item><title>AGMAI publishes responsible-release norms for AI-generated mathematics</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/agmai-responsible-release-ai-generated-mathematics/</link><guid isPermaLink="false">evt-2026-agmai-responsible-release</guid><description>AGMAI says the recommendations were informed by more than 600 responses from the mathematical community. The document distinguishes ordinary papers that a responsible mathematician fully understands from AI outputs that nobody yet understands. In the latter case it proposes technical release norms and a parallel obligation for labs to fund independent, community-led workshops, conferences, expository work and other activities needed to assimilate the mathematics. It also warns that unequal access to frontier systems could create a multi-tier mathematical community.</description><pubDate>Tue, 29 Sep 2026 00:00:00 GMT</pubDate></item><item><title>FrenzyMath releases a Comparator-checked AI-assisted Lean formalization of the Poincaré conjecture</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/frenzymath-poincare-formalization/</link><guid isPermaLink="false">evt-2026-frenzymath-poincare-formalization</guid><description>FrenzyMath reports about 3.2 million lines of Lean and less than USD 30,000 in LLM and compute costs for the project. The repository separates the Mathlib-only endpoint statements from the proof library and preserves Comparator configuration, verifier revisions, logs and source-provenance records. The announcement also notes that an independent team led by Ziyang Qin, Yuan Liao, Ayush Khaitan and Bennett Chow released another complete Poincaré Lean development earlier the same day; that separate arXiv paper records a full public build and says automated assistance was used for proofs and prose.</description><pubDate>Mon, 28 Sep 2026 00:00:00 GMT</pubDate></item><item><title>Independent Advisory Group on Mathematics and Artificial Intelligence launches at IAS</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/agmai-advisory-group/</link><guid isPermaLink="false">evt-2026-agmai-advisory-group</guid><description>The group says it formed after OpenAI approached some future members about creating an external advisory board; in agreement with OpenAI, those mathematicians instead formed an independent group and invited additional members. Its initial membership consists of François Charles, Camillo De Lellis, Timothy Gowers, Martin Hairer, Nikhil Srivastava, Ulrike Tillmann, Ravi Vakil, Edward Witten and Melanie Matchett Wood. The group&apos;s first stated task is to advise OpenAI on coordinating the release of a large number of significant mathematical results that OpenAI reports were produced by an internal model. OpenAI&apos;s announcement explicitly cites A Severe Misalignment of AI in Mathematics as part of the context for creating this bridge to the mathematical community.</description><pubDate>Mon, 21 Sep 2026 00:00:00 GMT</pubDate></item><item><title>Lean Pool publishes an AI-maintained archive for large-scale formalized mathematics</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/lean-pool-ai-maintained-archive/</link><guid isPermaLink="false">evt-2026-lean-pool</guid><description>The archive occupies a deliberately different position from Mathlib: it accepts independent completed formalization projects that may not fit Mathlib&apos;s tightly integrated library scope, while imposing automated maintenance and quality checks. The public repository reports that project imports are still selected by humans, while AI systems participate materially in review, maintenance and optimization. The corpus size changes continuously and is therefore not treated as a frozen historical claim in this Event.</description><pubDate>Mon, 21 Sep 2026 00:00:00 GMT</pubDate></item><item><title>FormalFlow completes a 126,000-line Lean formalization of a core theorem underlying MIP* = RE</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/formalflow-mipstarre/</link><guid isPermaLink="false">evt-2026-formalflow-mipstarre</guid><description>FormalFlow organizes long formalization projects around a shared blueprint and nested planning, proving and review loops. AI agents implement and review proof tasks while humans supervise the project, compare the formal development with the source mathematics and resolve semantic discrepancies. The public MIPStarRE repository preserves Lean sources, the active blueprint, source-paper material and CI-oriented proof-integrity infrastructure.</description><pubDate>Thu, 17 Sep 2026 00:00:00 GMT</pubDate></item><item><title>Captain Sude credits GPT-6 Astra with an unconditional proof of the Liouville–Goldbach problem</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/astra-liouville-goldbach/</link><guid isPermaLink="false">evt-2026-astra-liouville-goldbach</guid><description>The public project supplies an authorless mathematical paper, a complete Lean 4 formalization against mathlib&apos;s Liouville function, pinned toolchain metadata, build and axiom audits, and proof-route checks. A separate audit repository independently rebuilt the frozen v1.0.0 artifact on Linux, matched the source hashes, repeated the axiom and route audits, and reported no sorry, custom theorem axiom, or native_decide. The public paper and repository do not preserve a detailed model–human derivation trace, so the precise division of intellectual labor remains source-attributed rather than independently reconstructed by the Chronicle.</description><pubDate>Wed, 16 Sep 2026 00:00:00 GMT</pubDate></item><item><title>Twenty-five Fields Medallists publish A Severe Misalignment of AI in Mathematics</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/severe-misalignment-ai-mathematics/</link><guid isPermaLink="false">evt-2026-severe-misalignment-ai-mathematics</guid><description>The declaration emerged from discussions among its initial signatories during a week of intense debate over rapidly improving AI systems and high-profile mathematical problem solving. It framed the central concern as a misalignment between benchmark-driven corporate incentives and the mathematical community&apos;s emphasis on understanding, communication, attribution, mentorship and durable knowledge. On 14 September, IMPA published the statement on its institutional news surface. On 15 September, the board of the French Mathematical Society cited it in an official position responding to the OpenAI Navier–Stokes announcement and its associated ethical controversy.</description><pubDate>Fri, 11 Sep 2026 00:00:00 GMT</pubDate></item><item><title>Magenta closes the loop between informal mathematical reasoning and Lean verification</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/magenta-lean-verification-loop/</link><guid isPermaLink="false">evt-2026-magenta</guid><description>Magenta uses a statement judge to check whether a generated Lean statement preserves the original informal problem and an error-attribution judge to decide whether a failed attempt should return to mathematical re-derivation or local Lean repair. The paper reports that this feedback-guided correction loop outperforms independent resampling on difficult problems.</description><pubDate>Thu, 10 Sep 2026 00:00:00 GMT</pubDate></item><item><title>Buckmaster and Alpöge release AI-assisted smooth-forcing blowup results for Euler, Boussinesq and IPM</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/buckmaster-alpoge-fluid-blowup/</link><guid isPermaLink="false">evt-2026-buckmaster-alpoge-fluid-blowup</guid><description>The researchers explicitly credit Diego Córdoba and Luis Martínez-Zoroa for the underlying forced-blowup research program and describe using LLMs to push that program from rougher forcing toward smooth forcing and related fluid equations. The public `fluid_lean` repository contains complete Lean developments for the Euler and Boussinesq theorems, with its documentation attributing the Lean code to Claude under Alpöge&apos;s direction.</description><pubDate>Tue, 08 Sep 2026 00:00:00 GMT</pubDate></item><item><title>OpenAI publishes an AI-generated claimed solution to the Navier–Stokes Millennium Problem with Lean formalization</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/openai-navier-stokes-solution-claim/</link><guid isPermaLink="false">evt-2026-openai-navier-stokes</guid><description>OpenAI says roughly 10,000 concurrent agents worked for about 88 hours on the successful search, followed by additional Lean formalization and verification. Independent reporting corroborated the publication event while also documenting disputes over attribution, provenance and priority involving contemporaneous work by Tristan Buckmaster and Levent Alpöge. OpenAI now says that, following an investigation, Buckmaster&apos;s Codex prompts during the two months before the 8 September release could not have influenced the system in any way, including through training. That direct statement narrows one provenance concern, while separate disputes over attribution, priority and the collaboration process remain part of the public record.</description><pubDate>Tue, 08 Sep 2026 00:00:00 GMT</pubDate></item><item><title>StochBench brings graduate stochastic processes into Lean theorem-proving evaluation</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/stochbench-stochastic-processes-lean/</link><guid isPermaLink="false">evt-2026-stochbench</guid><description>The benchmark covers Markov chains, renewal processes, random walks, martingales, stopping times, queues, Brownian motion, stochastic calculus, weak convergence, Poisson processes and continuous-time Markov processes. Its released dataset distinguishes 114 direct formalizations from 336 abstracted targets that expose assumptions explicitly when the required stochastic-process infrastructure is not available in the fixed Lean/Mathlib environment.</description><pubDate>Tue, 08 Sep 2026 00:00:00 GMT</pubDate></item><item><title>Anthropic releases a Claude-generated complete Lean formalization of Fermat&apos;s Last Theorem</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/claude-fermat-last-theorem-formalization/</link><guid isPermaLink="false">evt-2026-claude-flt-formalization</guid><description>Claude agents used Anthropic&apos;s Prove2Me workflow to build a dependency graph of formal subproblems and expand it into millions of lines of Lean code. The repository follows the classical Frey-Serre-Ribet-Wiles-Taylor-Wiles route and exposes the theorem graph, source attribution and reproducible verification procedures.</description><pubDate>Fri, 04 Sep 2026 00:00:00 GMT</pubDate></item><item><title>GPT-6 Astra is credited with improving the bounded prime-gap record to 186</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/openai-gpt6-astra-prime-gaps-186/</link><guid isPermaLink="false">evt-2026-openai-prime-gaps-186</guid><description>The public PrimeGaps186 repository contains a Lean 4 development for DHL[40,2] and the 186 prime-gap consequence together with a Python/FLINT numerical certificate. The registered main Lean declarations contain no sorry, and OpenAI reports that Comparator, Nanoda and Lean&apos;s kernel accepted the conditional proofs. The formal development nevertheless depends on three explicit project axioms: a rank-three hyper-Kloosterman estimate, a rank-two Kloosterman correlation estimate, and a collection of physical-integral and cap bounds. The first two are attributed to established literature; the numerical input is checked by the companion certificate rather than proved inside Lean. OpenAI&apos;s own metadata labels the review self-assessed and states that no independent human semantic review had been completed.</description><pubDate>Sun, 30 Aug 2026 00:00:00 GMT</pubDate></item><item><title>Palomar opens a public registry for Lean-verified mathematics</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/palomar-lean-verified-mathematics-registry/</link><guid isPermaLink="false">evt-2026-palomar-registry</guid><description>Palomar was created in response to the increasing volume of machine-assisted and machine-generated mathematics and the difficulty of auditing claims scattered across repositories and announcements. Its public statement positions the service as analogous to a preprint or repository layer for formalizations: it provides an immutable, searchable and inspectable record of what was mechanically checked while leaving novelty, relevance and deeper mathematical judgment to the research community.</description><pubDate>Tue, 18 Aug 2026 00:00:00 GMT</pubDate></item><item><title>Claude improves a longstanding lower bound related to the Riemann hypothesis</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/claude-riemann-zeta-lower-bound/</link><guid isPermaLink="false">evt-2026-claude-riemann-lower-bound</guid><description>Claude coordinated dozens of subagents, searched literature and numerical evidence, and produced a paper; Anthropic mathematicians reviewed the result and a Lean formalization passed comparator.</description><pubDate>Mon, 10 Aug 2026 00:00:00 GMT</pubDate></item><item><title>OpenAI publishes ten AI-generated advances across mathematics and theoretical computer science</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/openai-ten-math-tcs-advances/</link><guid isPermaLink="false">evt-2026-openai-ten-advances</guid><description>OpenAI states that an internal Astra model generated the mathematical arguments, humans prepared manuscripts with the model, and the model formalized each argument into a Lean certificate. Subsequent reporting documented attribution and training-data provenance concerns around the non-sofic-groups result, including Andreas Thom&apos;s unresolved question about whether unpublished mathematical discussions conducted through ChatGPT could have contributed indirectly through model-improvement data.</description><pubDate>Sat, 01 Aug 2026 00:00:00 GMT</pubDate></item><item><title>FrontierMath: Open Problems expands to 50 verifiable research problems</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/frontiermath-open-problems-50/</link><guid isPermaLink="false">evt-2026-frontiermath-open-problems</guid><description>Problems are selected by mathematicians, paired with bespoke computational verifiers where possible, and categorized by the significance of a solution.</description><pubDate>Fri, 31 Jul 2026 00:00:00 GMT</pubDate></item><item><title>AIMO Proof Pilot evaluates fully open models on expert-graded Olympiad-style proofs</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/aimo-proof-pilot-open-models/</link><guid isPermaLink="false">evt-2026-aimo-proof-pilot</guid><description>The pilot restricted participants to models whose intermediate checkpoints, training protocols and training data were public. Six teams produced evaluated outputs on six proof problems, and AIMO compared them under the same expert-grading procedure with open-weight and commercial frontier models while publishing the submissions and detailed grading data.</description><pubDate>Tue, 07 Jul 2026 00:00:00 GMT</pubDate></item><item><title>The Leiden Declaration sets community principles for AI in mathematical research</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/leiden-declaration-ai-mathematics/</link><guid isPermaLink="false">evt-2026-leiden-declaration</guid><description>The declaration grew from a September 2025 Lorentz Center meeting of around 60 participants from 10 countries spanning mathematics, computer science, philosophy, history, social science, industry and government. A smaller working group developed the text over the following months with extensive community feedback. The declaration was archived on Zenodo with a DOI, endorsed by the IMU, later discussed at ICM 2026, and the subject of supportive editorials and reporting in major scientific publications.</description><pubDate>Tue, 02 Jun 2026 00:00:00 GMT</pubDate></item><item><title>AlphaProof Nexus scales Lean-based agents to hundreds of open research problems</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/alphaproof-nexus-open-problem-proof-search/</link><guid isPermaLink="false">evt-2026-alphaproof-nexus</guid><description>AlphaProof Nexus organized frontier LLM subagents around the Lean compiler and escalated proof search with specialized tools and evolutionary search. The project released Lean proofs for successful Erdős, OEIS and research-collaboration cases together with human-readable proof writeups for selected results.</description><pubDate>Thu, 21 May 2026 00:00:00 GMT</pubDate></item><item><title>OpenAI reports an autonomous disproof of Erdős&apos;s unit-distance growth conjecture</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/openai-unit-distance-conjecture-disproof/</link><guid isPermaLink="false">evt-2026-unit-distance-disproof</guid><description>The model found a construction using tools from algebraic number theory; OpenAI released the proof and a companion paper by external mathematicians who checked and contextualized the argument.</description><pubDate>Wed, 20 May 2026 00:00:00 GMT</pubDate></item><item><title>SorryDB turns live proof holes from real Lean projects into a continuously updated benchmark</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/sorrydb-real-world-lean-benchmark/</link><guid isPermaLink="false">evt-2026-sorrydb</guid><description>SorryDB crawls eligible public Lean repositories, records reproducible repository and toolchain coordinates for unresolved `sorry` statements, and asks proving systems to replace each proof hole in its original project context. A verifier rebuilds the relevant project and checks proposed replacements, while a nightly database refresh supplies new tasks over time.</description><pubDate>Tue, 03 Mar 2026 00:00:00 GMT</pubDate></item><item><title>OpenAI publishes research-level proof attempts on the First Proof challenge</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/openai-first-proof-research-challenge/</link><guid isPermaLink="false">evt-2026-first-proof-openai</guid><description>The internal model worked with limited human supervision; researchers sometimes requested retries or clarifications and selected among attempts.</description><pubDate>Fri, 20 Feb 2026 00:00:00 GMT</pubDate></item><item><title>M2F scales autoformalization from isolated theorems to machine-checked Lean projects</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/m2f-project-scale-autoformalization/</link><guid isPermaLink="false">evt-2026-m2f</guid><description>M2F first translates long mathematical documents into dependency-ordered Lean declaration skeletons and repairs project-level structural inconsistencies, then freezes statement signatures and iteratively closes proof holes using verifier feedback. The companion ReasBook repository exposes generated formalizations from textbooks and research papers.</description><pubDate>Thu, 19 Feb 2026 00:00:00 GMT</pubDate></item><item><title>Aletheia extends Deep Think from Olympiad solving into research-level mathematics</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/aletheia-autonomous-mathematics-research-agent/</link><guid isPermaLink="false">evt-2026-aletheia</guid><description>Aletheia couples an advanced Gemini Deep Think model with iterative verification, revision and intensive tool use intended for research settings where literature navigation and long proof chains matter. The authors explicitly separated levels of autonomy and novelty rather than treating all AI-assisted results as equivalent.</description><pubDate>Tue, 10 Feb 2026 00:00:00 GMT</pubDate></item><item><title>Numina-Lean-Agent turns a general coding agent into an open Lean mathematics reasoner</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/numina-lean-agent-general-coding-agent/</link><guid isPermaLink="false">evt-2026-numina-lean-agent</guid><description>The system uses a general-purpose coding-agent loop as the controller for Lean work and extends it with theorem retrieval, informal proving, verification and auxiliary reasoning tools exposed through an MCP-oriented interface. Its public repository includes setup instructions, runnable agent tooling and links to the Putnam proof artifacts.</description><pubDate>Tue, 20 Jan 2026 00:00:00 GMT</pubDate></item><item><title>GPT-5.2 Pro derives proofs for an open learning-curve monotonicity problem</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/gpt5-2-learning-curve-monotonicity/</link><guid isPermaLink="false">evt-2025-gpt5-2-learning-curves</guid><description>The paper studies whether expected prediction error for maximum-likelihood estimation improves monotonically as more data are observed. It proves forward-KL monotonicity for several Gaussian and Gamma settings and gives a reverse-KL argument for broad exponential families. OpenAI presented the work as a case study of GPT-5.2 Pro contributing directly to previously unsolved mathematical questions.</description><pubDate>Thu, 11 Dec 2025 00:00:00 GMT</pubDate></item><item><title>An AI-assisted proof resolves the point-convergence question for Nesterov acceleration</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/gpt5-assisted-nesterov-point-convergence/</link><guid isPermaLink="false">evt-2025-gpt5-nag-open-problem</guid><description>GPT-5 proposed multiple directions and several key structural ideas; Ryu checked, reformulated and wrote the rigorous final proof with coauthor Uijeong Jang.</description><pubDate>Mon, 27 Oct 2025 00:00:00 GMT</pubDate></item><item><title>Aristotle reports gold-equivalent formal performance on IMO 2025</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/aristotle-imo-level-formal-theorem-proving/</link><guid isPermaLink="false">evt-2025-aristotle</guid><description>The architecture generates and formalizes useful lemmas, searches formal proofs and handles geometry through a specialist component.</description><pubDate>Wed, 01 Oct 2025 00:00:00 GMT</pubDate></item><item><title>Goedel-Prover-V2 scales open theorem proving with self-correction</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/goedel-prover-v2-self-correction/</link><guid isPermaLink="false">evt-2025-goedel-prover-v2</guid><description>The system uses scaffolded data synthesis, verifier-guided iterative repair and model averaging.</description><pubDate>Tue, 05 Aug 2025 00:00:00 GMT</pubDate></item><item><title>Seed-Prover combines deep and broad formal reasoning and proves five IMO 2025 problems</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/seed-prover-deep-broad-formal-reasoning/</link><guid isPermaLink="false">evt-2025-seed-prover</guid><description>The system iteratively refines whole proofs from Lean feedback and uses test-time strategies for deep and broad search.</description><pubDate>Thu, 31 Jul 2025 00:00:00 GMT</pubDate></item><item><title>Gemini Deep Think reaches officially graded IMO 2025 gold-medal standard in natural language</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/gemini-deep-think-imo-2025-gold/</link><guid isPermaLink="false">evt-2025-gemini-imo-gold</guid><description>Unlike AlphaProof and AlphaGeometry 2 in 2024, the 2025 system consumed official problem statements directly and produced natural-language proofs without manual translation into Lean or another domain-specific formal language. It completed the task within the 4.5-hour competition limit.</description><pubDate>Mon, 21 Jul 2025 00:00:00 GMT</pubDate></item><item><title>OpenAI reports gold-level performance on IMO 2025 with a general reasoning model</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/openai-imo-2025-gold-level/</link><guid isPermaLink="false">evt-2025-openai-imo-gold</guid><description>The model worked from official natural-language problem statements without a proof assistant or internet access during the evaluation.</description><pubDate>Sat, 19 Jul 2025 00:00:00 GMT</pubDate></item><item><title>LeanConjecturer scales LLM-generated mathematical conjectures inside Lean</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/leanconjecturer-formal-conjecture-generation/</link><guid isPermaLink="false">evt-2025-leanconjecturer</guid><description>The pipeline extracts definitions and theorem context from Lean files, asks an LLM to propose new formal statements, checks generated statements through Lean and separates harder candidates for subsequent training. The paper also reports several non-trivial topology examples as evidence that the pipeline can produce mathematically useful statements rather than only superficial perturbations.</description><pubDate>Fri, 27 Jun 2025 00:00:00 GMT</pubDate></item><item><title>Mathesis connects natural-language mathematics to end-to-end Lean theorem proving</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/mathesis-natural-language-formal-proving/</link><guid isPermaLink="false">evt-2025-mathesis</guid><description>Mathesis translates an informal problem into a Lean 4 statement, scores candidate formalizations for syntactic and semantic quality, and uses downstream prover feedback to prefer statements that can support machine-checked proofs. Gaokao-Formal provides hundreds of challenging proof problems derived from Chinese college-entrance examinations for evaluating this full pipeline.</description><pubDate>Sun, 08 Jun 2025 00:00:00 GMT</pubDate></item><item><title>MathArena turns newly released math competitions into a live contamination-resistant benchmark</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/matharena-live-math-competitions/</link><guid isPermaLink="false">evt-2025-matharena</guid><description>MathArena evaluates models on recurring competitions soon after problems are released and records whether a model predates each competition. Its public pipeline supports final-answer parsing as well as proof-based competitions such as USAMO and IMO, where expert graders assess model-generated proofs.</description><pubDate>Thu, 29 May 2025 00:00:00 GMT</pubDate></item><item><title>AlphaEvolve generalizes LLM-guided evolutionary search for algorithm discovery</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/alphaevolve-algorithm-discovery/</link><guid isPermaLink="false">evt-2025-alphaevolve</guid><description>The agent maintains populations of candidate programs, uses language models to propose edits and repeatedly scores outputs with executable evaluators. The accompanying technical report and results repository document mathematical cases where the evolved programs improved known constructions.</description><pubDate>Wed, 14 May 2025 00:00:00 GMT</pubDate></item><item><title>DeepSeek-Prover-V2 combines informal subgoal decomposition with Lean reinforcement learning</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/deepseek-prover-v2-subgoal-rl/</link><guid isPermaLink="false">evt-2025-deepseek-prover-v2</guid><description>DeepSeek-V3 first decomposes problems into subgoals; successful subgoal proofs become cold-start reasoning traces for reinforcement learning.</description><pubDate>Wed, 30 Apr 2025 00:00:00 GMT</pubDate></item><item><title>DeepSeek-R1 shows open reinforcement-learned reasoning at frontier math performance</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/deepseek-r1-reinforcement-learning-reasoning/</link><guid isPermaLink="false">evt-2025-deepseek-r1</guid><description>R1-Zero used reinforcement learning without an SFT cold start, while R1 added multi-stage training and released several distilled open models.</description><pubDate>Wed, 22 Jan 2025 00:00:00 GMT</pubDate></item><item><title>Ramanujan Library reports automated discovery of new relations among mathematical constants</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/ramanujan-library-integer-relations/</link><guid isPermaLink="false">evt-2024-ramanujan-library</guid><description>The project represents mathematical constants as vertices and formulas as hyperedges, then searches for integer relations that can expand this graph. The associated LIReC software provides a public database and numerical relation-identification tools for inspecting and extending the library.</description><pubDate>Mon, 16 Dec 2024 00:00:00 GMT</pubDate></item><item><title>FrontierMath introduces expert-crafted research-level mathematics evaluation</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/frontiermath-research-level-benchmark/</link><guid isPermaLink="false">evt-2024-frontiermath</guid><description>The benchmark was developed with more than sixty mathematicians and emphasized problems requiring hours or days of expert work.</description><pubDate>Fri, 08 Nov 2024 00:00:00 GMT</pubDate></item><item><title>InternLM2.5-StepProver scales expert iteration over large Lean problem sets</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/internlm-step-prover-expert-iteration/</link><guid isPermaLink="false">evt-2024-internlm-step-prover</guid><description>The system performs expert iteration over large Lean datasets and uses a critic to prioritize easier problems and guide deeper proof searches.</description><pubDate>Mon, 21 Oct 2024 00:00:00 GMT</pubDate></item><item><title>Omni-MATH refreshes Olympiad evaluation after older math benchmarks begin saturating</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/omni-math-olympiad-benchmark/</link><guid isPermaLink="false">evt-2024-omni-math</guid><description>The benchmark was designed after frontier reasoning models approached saturation on older datasets such as MATH.</description><pubDate>Thu, 10 Oct 2024 00:00:00 GMT</pubDate></item><item><title>LeanAgent brings lifelong learning to theorem proving across evolving Lean repositories</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/leanagent-lifelong-theorem-proving/</link><guid isPermaLink="false">evt-2024-leanagent</guid><description>LeanAgent repeatedly ingests new Lean repositories, traces theorem and premise data through LeanDojo, updates a dynamic database, progressively retrains premise retrieval and searches for proofs of `sorry` theorems. Successful proofs can be added back to the knowledge base for later learning.</description><pubDate>Tue, 08 Oct 2024 00:00:00 GMT</pubDate></item><item><title>GSM-Symbolic exposes robustness failures behind high math-reasoning benchmark scores</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/gsm-symbolic-robustness-benchmark/</link><guid isPermaLink="false">evt-2024-gsm-symbolic</guid><description>The benchmark derives controllable families of grade-school mathematics problems from symbolic templates. This lets evaluators vary numerical values, clause counts and distractors while preserving the underlying reasoning structure, testing whether model success is stable rather than tied to a fixed benchmark instance.</description><pubDate>Mon, 07 Oct 2024 00:00:00 GMT</pubDate></item><item><title>OpenAI o1 introduces inference-time reasoning with a large AIME performance jump</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/openai-o1-reasoning-aime/</link><guid isPermaLink="false">evt-2024-openai-o1</guid><description>The o1 series was trained to spend more inference-time computation on multi-step reasoning before producing an answer.</description><pubDate>Thu, 12 Sep 2024 00:00:00 GMT</pubDate></item><item><title>DeepSeek-Prover-V1.5 combines proof-assistant feedback, reinforcement learning and tree search</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/deepseek-prover-v1-5-lean-proof-search/</link><guid isPermaLink="false">evt-2024-deepseek-prover-v1-5</guid><description>The model was specialized for Lean 4 formal mathematics, refined with reinforcement learning from Lean feedback and paired with an intrinsic-reward Monte Carlo tree-search variant to explore diverse proof paths. DeepSeek released model weights and code for reproducing the proof-search setup.</description><pubDate>Thu, 15 Aug 2024 00:00:00 GMT</pubDate></item><item><title>miniCTX tests theorem provers on long, unseen project context</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/minictx-long-context-theorem-proving/</link><guid isPermaLink="false">evt-2024-minictx</guid><description>The benchmark draws theorems from real Lean projects and textbooks and includes tooling for extracting new project contexts.</description><pubDate>Mon, 05 Aug 2024 00:00:00 GMT</pubDate></item><item><title>AI for Math @ ICML establishes a recurring AI4Math workshop series</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/ai-for-math-icml-workshop-series/</link><guid isPermaLink="false">evt-2024-ai-for-math-icml</guid><description>The workshop series was created specifically around AI technologies for mathematical reasoning and discovery. By its third edition, the venue reported hundreds of submissions and accepted papers, a multi-level program committee, paper awards and four challenge tracks covering autoformalization alignment, theoretical-computer-science proving, visual scientific reasoning and end-to-end Lean proof generation.</description><pubDate>Fri, 26 Jul 2024 00:00:00 GMT</pubDate></item><item><title>AlphaProof and AlphaGeometry 2 reach silver-medal standard on IMO 2024 problems</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/alphaproof-alphageometry2-imo-2024/</link><guid isPermaLink="false">evt-2024-alphaproof-alphageometry2-imo</guid><description>AlphaProof used reinforcement learning in Lean for formal proof search, while AlphaGeometry 2 handled the geometry problem with a faster neuro-symbolic system. The 2024 workflow required experts to translate problems into formal representations and used up to several days of computation.</description><pubDate>Thu, 25 Jul 2024 00:00:00 GMT</pubDate></item><item><title>PutnamBench raises formal theorem-proving evaluation to Putnam-level mathematics</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/putnambench-formal-undergraduate-competition/</link><guid isPermaLink="false">evt-2024-putnambench</guid><description>Initial neural and symbolic provers solved only a handful of benchmark problems, making the collection a high-difficulty target for formal reasoning.</description><pubDate>Mon, 15 Jul 2024 00:00:00 GMT</pubDate></item><item><title>Lean-STaR trains theorem provers to interleave informal thinking with Lean tactics</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/lean-star-thinking-and-proving/</link><guid isPermaLink="false">evt-2024-lean-star</guid><description>The method generates retrospective thoughts from known tactics and then uses expert iteration on newly discovered verified proofs.</description><pubDate>Sun, 14 Jul 2024 00:00:00 GMT</pubDate></item><item><title>NuminaMath wins the first AIMO Progress Prize with an open tool-using math model</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/numinamath-aimo-progress-prize/</link><guid isPermaLink="false">evt-2024-numinamath-aimo</guid><description>The winning system fine-tuned DeepSeekMath-Base 7B and combined chain-of-thought with Python tool execution, self-consistency and internal validation sets.</description><pubDate>Thu, 11 Jul 2024 00:00:00 GMT</pubDate></item><item><title>Lean Workbook releases a large formal-informal mathematics dataset</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/lean-workbook-synthetic-formalization-dataset/</link><guid isPermaLink="false">evt-2024-lean-workbook</guid><description>An iterative generation-and-filtering pipeline translates natural-language math problems to Lean 4 statements and back.</description><pubDate>Thu, 06 Jun 2024 00:00:00 GMT</pubDate></item><item><title>DeepSeek-Prover scales Lean theorem proving with millions of synthetic formal statements</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/deepseek-prover-synthetic-lean-data/</link><guid isPermaLink="false">evt-2024-deepseek-prover-v1</guid><description>Natural-language competition problems are translated into Lean statements, filtered, proved and recycled as synthetic training data.</description><pubDate>Thu, 23 May 2024 00:00:00 GMT</pubDate></item><item><title>OlympiadBench scales Olympiad-level evaluation to bilingual multimodal science</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/olympiadbench-bilingual-multimodal/</link><guid isPermaLink="false">evt-2024-olympiadbench</guid><description>The benchmark was designed to remain difficult for frontier text and multimodal models and includes detailed evaluation methodology.</description><pubDate>Wed, 21 Feb 2024 00:00:00 GMT</pubDate></item><item><title>InternLM-Math unifies informal, tool-assisted and formal mathematical reasoning</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/internlm-math-verifiable-reasoning/</link><guid isPermaLink="false">evt-2024-internlm-math</guid><description>The project encodes reasoning, reward modeling, formal tasks, data augmentation and code-interpreter behavior in a unified sequence-to-sequence format.</description><pubDate>Fri, 09 Feb 2024 00:00:00 GMT</pubDate></item><item><title>DeepSeekMath couples large-scale math pretraining with GRPO</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/deepseekmath-grpo-open-math-model/</link><guid isPermaLink="false">evt-2024-deepseekmath</guid><description>The model continued pretraining on 120B math-related tokens and then used supervised and reinforcement-learning stages for mathematical reasoning.</description><pubDate>Mon, 05 Feb 2024 00:00:00 GMT</pubDate></item><item><title>AlphaGeometry reaches near gold-medallist performance on olympiad geometry benchmark</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/alphageometry-olympiad-geometry/</link><guid isPermaLink="false">evt-2024-alphageometry</guid><description>AlphaGeometry combines a neural language model trained on synthetic theorem/proof data with a symbolic deduction engine. The language model proposes auxiliary constructions and the symbolic engine checks deductions.</description><pubDate>Wed, 17 Jan 2024 00:00:00 GMT</pubDate></item><item><title>FunSearch reports new cap-set constructions with LLM-guided program search</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/funsearch-mathematical-discovery/</link><guid isPermaLink="false">evt-2023-funsearch-cap-set</guid><description>Google DeepMind paired a pretrained language model with an evaluator and evolutionary program search. The resulting system searched over executable programs rather than directly emitting final mathematical answers.</description><pubDate>Thu, 14 Dec 2023 00:00:00 GMT</pubDate></item><item><title>Math-Shepherd automates step-level process supervision for math reasoning</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/math-shepherd-process-reward-model/</link><guid isPermaLink="false">evt-2023-math-shepherd</guid><description>The verifier scores intermediate reasoning steps rather than only final answers and can be used for selection or reinforcement learning.</description><pubDate>Thu, 14 Dec 2023 00:00:00 GMT</pubDate></item><item><title>Llemma releases open language models and data specialized for mathematics</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/llemma-open-math-language-model/</link><guid isPermaLink="false">evt-2023-llemma</guid><description>The project continued pretraining Code Llama on Proof-Pile-2, a mixture of mathematical web text, scientific papers and mathematical code.</description><pubDate>Mon, 16 Oct 2023 00:00:00 GMT</pubDate></item><item><title>COPRA turns a general LLM into a stateful formal proof-search agent</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/copra-in-context-formal-proof-agent/</link><guid isPermaLink="false">evt-2023-copra</guid><description>At each step the agent proposed a tactic, executed it in the proof assistant, incorporated errors or new goals into the next prompt and maintained a search history for backtracking. The architecture showed how a frontier general model could be wrapped in a proof-oriented agent harness without task-specific finetuning.</description><pubDate>Fri, 06 Oct 2023 00:00:00 GMT</pubDate></item><item><title>MathVista establishes a benchmark for mathematical reasoning in visual contexts</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/mathvista-visual-math-benchmark/</link><guid isPermaLink="false">evt-2023-mathvista</guid><description>The benchmark combines visual perception with compositional mathematical reasoning. The initial study found a substantial gap between frontier multimodal models and human performance, while the public project provides dataset access, evaluation code and model-result tooling.</description><pubDate>Tue, 03 Oct 2023 00:00:00 GMT</pubDate></item><item><title>LEGO-Prover grows a reusable library of machine-checked lemmas during proof search</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/lego-prover-growing-library/</link><guid isPermaLink="false">evt-2023-lego-prover</guid><description>The system couples a prover and an evolver through a shared skill library. The prover constructs modular proofs from retrieved and newly generated lemmas, while the evolver transforms verified skills to increase their generality, reuse and complexity.</description><pubDate>Sun, 01 Oct 2023 00:00:00 GMT</pubDate></item><item><title>ToRA makes tool-integrated reasoning a competitive open math-agent paradigm</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/tora-tool-integrated-math-reasoning/</link><guid isPermaLink="false">evt-2023-tora</guid><description>The agents learn interactive tool-use trajectories involving computation libraries and symbolic solvers rather than relying on text-only chain-of-thought.</description><pubDate>Fri, 29 Sep 2023 00:00:00 GMT</pubDate></item><item><title>AMS establishes an AI advisory group for the mathematical community</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/ams-ai-advisory-group/</link><guid isPermaLink="false">evt-2023-ams-ai-advisory</guid><description>The AMS response developed during the first year of widespread generative-AI use. A Notices article records that the Society had already amended its Ethical Guidelines and Journal Policies in June 2023 to adopt the COPE position that AI tools cannot be authors and AI use must be disclosed. The July advisory group then broadened the response from immediate journal rules to sustained governance questions for mathematical research and the profession. Its 2024 white papers were explicitly intended as living resources for AMS policy committees and the wider community.</description><pubDate>Mon, 10 Jul 2023 00:00:00 GMT</pubDate></item><item><title>LeanDojo opens a reproducible environment for LLM theorem proving in Lean</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/leandojo-retrieval-augmented-theorem-proving/</link><guid isPermaLink="false">evt-2023-leandojo</guid><description>The project extracts proof states, tactics and premise information from Lean repositories and exposes a programmatic proof environment. ReProver retrieves relevant premises before generating tactics, directly addressing the library-scale premise-selection problem.</description><pubDate>Tue, 27 Jun 2023 00:00:00 GMT</pubDate></item><item><title>AlphaDev discovers faster sorting algorithms with deep reinforcement learning</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/alphadev-sorting-algorithms/</link><guid isPermaLink="false">evt-2023-alphadev</guid><description>The system searches directly over assembly instructions using an AlphaZero-style learning and search procedure. DeepMind reported speedups up to 70% for short sequences and about 1.7% for very long sequences, while releasing pseudocode and discovered assembly programs with correctness tests.</description><pubDate>Wed, 07 Jun 2023 00:00:00 GMT</pubDate></item><item><title>Process supervision and PRM800K establish step-level verification for math reasoning</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/process-supervision-prm800k/</link><guid isPermaLink="false">evt-2023-process-supervision-prm800k</guid><description>Rather than rewarding only a final answer, the project collected human judgments on intermediate reasoning steps and trained process reward models from those labels. PRM800K exposes the annotations, labeling instructions and scored model samples used in the study.</description><pubDate>Wed, 31 May 2023 00:00:00 GMT</pubDate></item><item><title>Baldur generates and repairs whole formal proofs with language models</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/baldur-whole-proof-generation-repair/</link><guid isPermaLink="false">evt-2023-baldur</guid><description>Instead of predicting one proof step and searching over continuations, Baldur fine-tuned language models to generate an entire proof in one pass. A separate repair model then received a failed proof attempt together with proof-assistant error feedback and proposed a corrected proof.</description><pubDate>Wed, 08 Mar 2023 00:00:00 GMT</pubDate></item><item><title>ProofNet benchmarks autoformalization and proving of undergraduate mathematics</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/proofnet-autoformalization-benchmark/</link><guid isPermaLink="false">evt-2023-proofnet</guid><description>The benchmark covers analysis, linear algebra, abstract algebra, topology and other textbook mathematics.</description><pubDate>Fri, 24 Feb 2023 00:00:00 GMT</pubDate></item><item><title>Draft, Sketch, and Prove uses informal proofs to guide formal proof search</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/draft-sketch-prove-informal-guidance/</link><guid isPermaLink="false">evt-2022-draft-sketch-prove</guid><description>Language models produce a high-level formal sketch whose subgoals are then discharged by an automated prover.</description><pubDate>Fri, 21 Oct 2022 00:00:00 GMT</pubDate></item><item><title>AlphaTensor discovers improved matrix multiplication algorithms</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/alphatensor-matrix-multiplication-algorithms/</link><guid isPermaLink="false">evt-2022-alphatensor</guid><description>DeepMind represented matrix multiplication as a tensor-decomposition game and trained an AlphaZero-style reinforcement-learning agent to search the enormous space of factorizations. Released artifacts include discovered factorizations, benchmarking code and checks of algorithmic properties.</description><pubDate>Wed, 05 Oct 2022 00:00:00 GMT</pubDate></item><item><title>Minerva demonstrates large-scale language-model gains on quantitative reasoning</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/minerva-quantitative-reasoning-language-model/</link><guid isPermaLink="false">evt-2022-minerva</guid><description>Google Research continued pretraining a large language model on scientific papers and mathematical web content, then evaluated chain-of-thought-style solutions across mathematics, physics and other quantitative domains. The system operated in natural language rather than a proof assistant.</description><pubDate>Wed, 29 Jun 2022 00:00:00 GMT</pubDate></item><item><title>Large language models show practical progress on mathematical autoformalization</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/autoformalization-large-language-models/</link><guid isPermaLink="false">evt-2022-autoformalization-llm</guid><description>Researchers used few-shot prompting to ask large language models to translate informal mathematical statements into Isabelle/HOL. The generated formalizations were then used as additional training data for a neural theorem prover, linking informal-language translation with formal proof search in one pipeline.</description><pubDate>Wed, 25 May 2022 00:00:00 GMT</pubDate></item><item><title>NaturalProver grounds language-model proof generation in mathematical references</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/naturalprover-grounded-proof-generation/</link><guid isPermaLink="false">evt-2022-naturalprover</guid><description>NaturalProver conditions language-model proof generation on mathematical background references such as definitions and theorems, either retrieved automatically or supplied by humans. The project studied both next-step suggestion and full-proof generation and released the NaturalProofs-Gen data, training and generation code, evaluation tooling and model assets.</description><pubDate>Wed, 25 May 2022 00:00:00 GMT</pubDate></item><item><title>HyperTree Proof Search introduces online self-improvement for neural theorem proving</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/hypertree-proof-search/</link><guid isPermaLink="false">evt-2022-htps</guid><description>The system learns from its own proof searches and uses a hyper-tree search algorithm inspired by Monte Carlo tree search and AlphaZero.</description><pubDate>Mon, 23 May 2022 00:00:00 GMT</pubDate></item><item><title>Thor integrates language models with automated theorem-prover hammers</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/thor-language-model-hammer-integration/</link><guid isPermaLink="false">evt-2022-thor</guid><description>The framework uses theorem-prover hammers for premise selection while leaving other proof decisions to the language model.</description><pubDate>Sun, 22 May 2022 00:00:00 GMT</pubDate></item><item><title>OpenAI&apos;s Lean prover uses expert iteration to solve formal Olympiad problems</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/lean-statement-curriculum-learning/</link><guid isPermaLink="false">evt-2022-statement-curriculum-learning</guid><description>The prover alternated proof search with retraining on newly discovered proofs over statements of varied difficulty.</description><pubDate>Wed, 02 Feb 2022 00:00:00 GMT</pubDate></item><item><title>Incremental learning and hindsight replay reduce handcrafted guidance in first-order theorem proving</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/her-incremental-first-order-theorem-prover/</link><guid isPermaLink="false">evt-2021-her-prover</guid><description>Clauses are encoded as graphs and scored by transformer-based models. Training proceeds incrementally, while hindsight replay turns intermediate states from unsuccessful searches into additional learning targets instead of discarding those trajectories.</description><pubDate>Mon, 20 Dec 2021 00:00:00 GMT</pubDate></item><item><title>DeepMind and mathematicians use machine learning to guide new discoveries in pure mathematics</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/deepmind-ml-guided-pure-math-discovery/</link><guid isPermaLink="false">evt-2021-deepmind-math-discovery</guid><description>The project used supervised machine learning to search large mathematical datasets for predictive relationships and attribution methods to expose which variables drove those predictions. Mathematicians then interpreted the signals, reformulated them as mathematical statements, tested counterexamples and supplied conventional mathematical arguments. The Nature article demonstrated the workflow on hyperbolic knots and Kazhdan-Lusztig polynomials, alongside public notebooks and datasets for both case studies.</description><pubDate>Wed, 01 Dec 2021 00:00:00 GMT</pubDate></item><item><title>GSM8K and learned verifiers establish a durable benchmark for language-model math reasoning</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/gsm8k-verifier-math-reasoning/</link><guid isPermaLink="false">evt-2021-gsm8k</guid><description>The work paired a human-written math reasoning dataset with a generator-verifier pipeline. A language model generated many candidate solutions, while a separately trained verifier scored those solutions and selected the most promising answer.</description><pubDate>Wed, 27 Oct 2021 00:00:00 GMT</pubDate></item><item><title>miniF2F establishes a cross-system benchmark for formal Olympiad mathematics</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/minif2f-formal-olympiad-benchmark/</link><guid isPermaLink="false">evt-2021-minif2f</guid><description>The benchmark translated problems from AIME, AMC, IMO and educational sources into formal languages. Its goal was not a new mathematical theorem but a reproducible common target on which learned theorem provers could be trained and compared.</description><pubDate>Tue, 31 Aug 2021 00:00:00 GMT</pubDate></item><item><title>MATH-AI begins a recurring workshop series on mathematical reasoning and AI</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/math-ai-workshop-series/</link><guid isPermaLink="false">evt-2021-math-ai-workshop</guid><description>MATH-AI began as a cross-disciplinary workshop asking how mathematical reasoning could illuminate general AI. The inaugural program combined invited talks, contributed papers, poster sessions and a discussion panel, while its review process used anonymized submissions. Across later editions the series evolved with the field toward large language models, theorem proving, autoformalization, mathematical discovery and agentic AI while retaining a dedicated mathematical-reasoning identity.</description><pubDate>Fri, 07 May 2021 00:00:00 GMT</pubDate></item><item><title>MATH makes competition mathematics a standard language-model benchmark</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/math-competition-problem-benchmark/</link><guid isPermaLink="false">evt-2021-math-benchmark</guid><description>The benchmark covered algebra, geometry, number theory, probability and other competition topics and provided full solution derivations.</description><pubDate>Fri, 05 Mar 2021 00:00:00 GMT</pubDate></item><item><title>TacticZero learns interactive theorem proving from scratch with deep reinforcement learning</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/tacticzero-deep-rl-theorem-proving/</link><guid isPermaLink="false">evt-2021-tacticzero</guid><description>The system represents proof search as an end-to-end reinforcement-learning problem and introduces backtracking that lets the agent abandon predicted dead ends and resume from promising alternatives. The resulting proofs are constructed inside HOL4 and therefore remain subject to the proof assistant&apos;s kernel checking.</description><pubDate>Fri, 19 Feb 2021 00:00:00 GMT</pubDate></item><item><title>PACT uses proof artifacts to scale language-model theorem proving</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/pact-proof-artifact-cotraining/</link><guid isPermaLink="false">evt-2021-pact</guid><description>The method extracts self-supervised objectives from kernel-level proof terms and trains them alongside tactic prediction.</description><pubDate>Thu, 11 Feb 2021 00:00:00 GMT</pubDate></item><item><title>GPT-f brings generative language modeling to formal theorem proving</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/gpt-f-metamath-theorem-proving/</link><guid isPermaLink="false">evt-2020-gpt-f</guid><description>OpenAI researchers Stanislas Polu and Ilya Sutskever trained generative models over formal mathematical text and integrated them into proof search for the Metamath language. The work framed theorem proving as sequence generation and showed that learned generation could contribute usable proof artifacts to an established formal library.</description><pubDate>Mon, 07 Sep 2020 00:00:00 GMT</pubDate></item><item><title>Tactician integrates adaptive tactic learning and proof synthesis into Coq</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/tactician-coq-tactic-learning/</link><guid isPermaLink="false">evt-2020-tactician</guid><description>The project combines online tactic learning, proof search and package-aware instrumentation so machine-learning assistance lives inside the proof assistant rather than as a detached benchmark-only experiment.</description><pubDate>Fri, 31 Jul 2020 00:00:00 GMT</pubDate></item><item><title>INT makes systematic generalization a first-class theorem-proving benchmark</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/int-generalization-theorem-proving/</link><guid isPermaLink="false">evt-2020-int</guid><description>The benchmark generates synthetic inequality proofs from axioms and varies properties of training and test distributions so researchers can distinguish memorization-like success from different forms of out-of-distribution theorem-proving generalization.</description><pubDate>Mon, 06 Jul 2020 00:00:00 GMT</pubDate></item><item><title>IsarStep benchmarks high-level mathematical reasoning from human-written Isabelle proofs</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/isarstep-high-level-reasoning/</link><guid isPermaLink="false">evt-2020-isarstep</guid><description>IsarStep converts declarative Isar proofs into sequence-to-sequence examples where a proof fragment has an intermediate proposition removed. The task tests whether a model can reconstruct a semantically useful bridge between surrounding proof states, and the authors evaluated Transformer-based baselines including a hierarchical architecture designed for long proof context.</description><pubDate>Sat, 13 Jun 2020 00:00:00 GMT</pubDate></item><item><title>Skip-tree training brings structure-aware self-supervision to formal mathematical reasoning</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/skip-tree-self-supervised-math/</link><guid isPermaLink="false">evt-2020-skip-tree</guid><description>Rather than masking only a flat token span, skip-tree training removes a subtree from a structured mathematical expression and trains a model to reconstruct it, encouraging representations that reflect the compositional structure of formal mathematics.</description><pubDate>Mon, 08 Jun 2020 00:00:00 GMT</pubDate></item><item><title>Natural-language premise selection turns mathematical reference retrieval into a benchmark task</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/natural-language-premise-selection/</link><guid isPermaLink="false">evt-2020-nl-premise-selection</guid><description>The work treated mathematical discourse as a retrieval problem rather than only an answer-generation problem. Its dataset captures links among conjectures, definitions and supporting propositions in ProofWiki, while accompanying baselines and later graph-based experiments measured how effectively models could recover proof-relevant references.</description><pubDate>Thu, 30 Apr 2020 00:00:00 GMT</pubDate></item><item><title>MetaGen learns to generate synthetic theorems and proofs for theorem-prover training</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/metagen-synthetic-theorem-generation/</link><guid isPermaLink="false">evt-2020-metagen</guid><description>The system learns from existing formal mathematics, generates additional theorem-proof pairs, and feeds the synthetic corpus back into prover training rather than relying only on scarce human-authored proof traces.</description><pubDate>Mon, 17 Feb 2020 00:00:00 GMT</pubDate></item><item><title>CoqGym and ASTactic scale learning-based interaction with the Coq proof assistant</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/coqgym-astactic-theorem-proving/</link><guid isPermaLink="false">evt-2019-coqgym</guid><description>CoqGym extracted proof states, environments, goals, tactics and proof trees from open-source Coq projects and exposed them through a programmatic interaction layer. ASTactic learned proof-step generation from this corpus and composed tactics from runtime syntax rather than relying only on a predetermined list of complete tactics.</description><pubDate>Tue, 21 May 2019 00:00:00 GMT</pubDate></item><item><title>HOList and DeepHOL open a reinforcement-learning environment for higher-order theorem proving</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/holist-deephol-theorem-proving/</link><guid isPermaLink="false">evt-2019-holist</guid><description>HOList instrumented HOL Light so learning systems could interact with proof states and tactics through a machine-learning environment. The benchmark packaged theorem statements from core, complex and Flyspeck corpora with train, validation and test labels, while DeepHOL supplied a neural prover and reinforcement-learning loop for generating additional successful proof traces.</description><pubDate>Fri, 05 Apr 2019 00:00:00 GMT</pubDate></item><item><title>Mathematics Dataset establishes a large synthetic benchmark for neural mathematical reasoning</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/mathematics-dataset-neural-reasoning/</link><guid isPermaLink="false">evt-2019-mathematics-dataset</guid><description>The original release provided millions of generated question-answer pairs per module and evaluated contemporary sequence-to-sequence neural architectures on both ordinary test splits and extrapolation settings. The accompanying open-source generator made it possible to reproduce and extend the task distribution rather than treating the benchmark as a fixed static question list.</description><pubDate>Tue, 02 Apr 2019 00:00:00 GMT</pubDate></item><item><title>GamePad exposes Coq proof traces and interaction as a machine-learning environment</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/gamepad-coq-learning-environment/</link><guid isPermaLink="false">evt-2018-gamepad</guid><description>GamePad instruments Coq so proof states, proof steps, mid-level and kernel-level terms and proof trees can be represented as Python data structures. A lightweight coqtop wrapper lets learning code send tactics and receive parsed proof states, while released tooling supports extracting data from the Mathematical Components odd-order development.</description><pubDate>Sat, 02 Jun 2018 00:00:00 GMT</pubDate></item><item><title>Reinforcement learning guides large-scale automated theorem-proving search</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/reinforcement-learning-theorem-proving/</link><guid isPermaLink="false">evt-2018-rl-theorem-proving</guid><description>The system repeatedly performs proof-search simulations, turns successful and failed attempts into learning signals, and retrains guidance used in subsequent searches. The approach was evaluated over a large formal-mathematics problem corpus, emphasizing learned search control rather than theorem-specific handwritten heuristics.</description><pubDate>Sat, 19 May 2018 00:00:00 GMT</pubDate></item><item><title>Neural translation establishes an early route from informalized mathematics to formal Mizar</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/neural-mizar-autoformalization/</link><guid isPermaLink="false">evt-2018-neural-mizar-autoformalization</guid><description>The authors constructed a large aligned corpus by informalizing Mizar statements into LaTeX-like mathematical text and trained sequence-to-sequence translation models to reconstruct the formal language. The study evaluated multiple neural translation configurations and used case studies to examine which mathematical structures could be recovered correctly.</description><pubDate>Thu, 10 May 2018 00:00:00 GMT</pubDate></item><item><title>Mathlib3 creates a shared Lean library for collaborative formal mathematics</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/mathlib3-formal-mathematics-library/</link><guid isPermaLink="false">evt-2017-mathlib3</guid><description>Mathlib organized community-authored Lean definitions, theorems, proofs and tactics into a common mathematical library spanning algebra, analysis, topology, number theory and other areas. Shared APIs and review practices made formal developments composable rather than isolated project artifacts.</description><pubDate>Fri, 21 Jul 2017 00:00:00 GMT</pubDate></item><item><title>TacticToe learns tactic-level proof search from human HOL4 proofs</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/tactictoe-hol4-tactic-learning/</link><guid isPermaLink="false">evt-2018-tactictoe</guid><description>TacticToe records tactic-level proof information from HOL4, learns which proof actions are promising in a new goal state, and searches over complete tactic sequences directly in higher-order logic rather than translating every problem to first-order logic. The 2017 system used a modified A*-style search with tactic prediction and small-scale hammering; the later expanded implementation developed the search machinery further and remains available in the HOL4 repository.</description><pubDate>Thu, 04 May 2017 00:00:00 GMT</pubDate></item><item><title>HolStep establishes a large machine-learning benchmark from real HOL Light proofs</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/holstep-machine-learning-dataset/</link><guid isPermaLink="false">evt-2017-holstep</guid><description>HolStep extracts intermediate statements and conjectures from HOL Light proofs, canonicalizes their textual representation and pairs useful proof steps with negative examples. The release defines conditioned and unconditioned proof-step classification tasks and provides baseline code so researchers can compare learned representations and relevance models on a common formal-mathematics corpus.</description><pubDate>Wed, 01 Mar 2017 00:00:00 GMT</pubDate></item><item><title>Deep networks are integrated directly into automated theorem-prover search</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/deep-network-guided-proof-search/</link><guid isPermaLink="false">evt-2017-deep-network-guided-proof-search</guid><description>The system learns from clause-level traces of successful automated proofs and ranks generated clauses during saturation-style proof search. Because neural evaluation is slower than hand-engineered heuristics, the authors used hybrid guidance and a two-phase search strategy that lets the learned model improve the search trajectory before faster conventional heuristics finish the proof attempt.</description><pubDate>Tue, 24 Jan 2017 00:00:00 GMT</pubDate></item><item><title>Statistical and semantic parsing advances early mathematical autoformalization</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/semantic-parsing-mathematics/</link><guid isPermaLink="false">evt-2016-semantic-parsing-math</guid><description>The system learns how ambiguous mathematical notation is parsed from aligned corpora and then uses formal semantic constraints to reject syntactically plausible but mathematically ill-typed or unsupported interpretations. This creates a hybrid statistical-symbolic pipeline in which learning proposes formal structures and theorem-proving machinery helps validate them.</description><pubDate>Tue, 29 Nov 2016 00:00:00 GMT</pubDate></item><item><title>Holophrasm builds a neural end-to-end theorem prover for Metamath</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/holophrasm-neural-theorem-prover/</link><guid isPermaLink="false">evt-2016-holophrasm</guid><description>Holophrasm parses Metamath statements into tree structures, learns neural models for proof-step generation and proof-state evaluation, and combines them with search over candidate proof trees. The public release includes model-training and proof-search code, saved proof outputs, and instructions for replaying generated proofs through Metamath&apos;s verifier.</description><pubDate>Mon, 08 Aug 2016 00:00:00 GMT</pubDate></item><item><title>DeepMath brings deep sequence models to large-scale premise selection</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/deepmath-premise-selection/</link><guid isPermaLink="false">evt-2016-deepmath</guid><description>DeepMath encodes conjectures and candidate premises with recurrent and convolutional neural architectures and learns whether a premise is useful for a target theorem. The release turned large formal proof corpora into training data for neural relevance models, making representation learning a central component of automated theorem-proving pipelines.</description><pubDate>Tue, 14 Jun 2016 00:00:00 GMT</pubDate></item><item><title>The first AITP conference establishes a recurring AI-and-theorem-proving forum</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/aitp-conference-inaugural/</link><guid isPermaLink="false">evt-2016-aitp</guid><description>AITP 2016 explicitly positioned itself as a forum for combining AI and reasoning methods over large mathematical and scientific corpora. The inaugural program included focused sessions on AI for ATP/ITP and mathematics, informal and semi-formal mathematical understanding, modern AI methods, and contributed talks. Its official series record documents yearly meetings from 2016 through 2026.</description><pubDate>Sun, 03 Apr 2016 00:00:00 GMT</pubDate></item><item><title>AI4REASON launches a research program coupling machine learning with large-scale automated reasoning</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/ai4reason-project-launch/</link><guid isPermaLink="false">evt-2015-ai4reason</guid><description>The project focused on large and complex theories, learning from reasoning traces, feedback loops between deduction and learning, and knowledge accumulation across multiple mathematical representation styles.</description><pubDate>Tue, 01 Sep 2015 00:00:00 GMT</pubDate></item><item><title>Lean is presented at CADE-25 as an open theorem prover for formal mathematics</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/lean-theorem-prover-cade-2015/</link><guid isPermaLink="false">evt-2015-lean</guid><description>Lean combined a small proof-checking kernel, an expressive dependent type theory, interactive proof development and extensible automation in one open platform intended for formalized mathematics as well as verification.</description><pubDate>Fri, 07 Aug 2015 00:00:00 GMT</pubDate></item><item><title>Flyspeck completes a formal proof of the Kepler conjecture</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/flyspeck-kepler-completion/</link><guid isPermaLink="false">evt-2014-flyspeck-completion</guid><description>The completed development formalized both the mathematical text and the large computational components needed for the Kepler-conjecture proof.</description><pubDate>Sun, 10 Aug 2014 00:00:00 GMT</pubDate></item><item><title>MizAR 40 scales AI/ATP methods across the full Mizar Mathematical Library</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/mizar40-ai-atp/</link><guid isPermaLink="false">evt-2013-mizar40</guid><description>The system scaled fast learned relevance methods over roughly 150,000 MML formulas and deployed them within the MizAR online reasoning service.</description><pubDate>Thu, 10 Oct 2013 00:00:00 GMT</pubDate></item><item><title>HOL(y)Hammer combines learned premise selection with ATPs for HOL Light</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/holyhammer-hol-light-ai-atp/</link><guid isPermaLink="false">evt-2013-holyhammer</guid><description>Users could upload HOL Light developments and ask the service to attack new conjectures using learned relevance models, parallel ATP combinations and decision procedures.</description><pubDate>Thu, 19 Sep 2013 00:00:00 GMT</pubDate></item><item><title>Coq completes a machine-checked formal proof of the Odd Order Theorem</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/odd-order-theorem-coq/</link><guid isPermaLink="false">evt-2013-odd-order-coq</guid><description>The project formalized the theorem together with a substantial mathematical library spanning group theory, linear algebra, Galois theory and real/complex algebraic numbers.</description><pubDate>Mon, 22 Jul 2013 00:00:00 GMT</pubDate></item><item><title>Sledgehammer makes external automated provers practical inside Isabelle</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/sledgehammer-isabelle-atp/</link><guid isPermaLink="false">evt-2010-sledgehammer</guid><description>Sledgehammer selects relevant Isabelle facts, translates proof obligations to external ATPs and uses the returned information to help construct proof-assistant-checked proofs.</description><pubDate>Wed, 14 Jul 2010 00:00:00 GMT</pubDate></item><item><title>The MPTP Challenge benchmarks AI-assisted automated reasoning in large mathematical theories</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/mptp-large-theory-challenge/</link><guid isPermaLink="false">evt-2007-mptp-challenge</guid><description>The challenge supplied common Mizar-derived problems, public rules and a total resource budget intended to make learning, premise selection and other large-theory reasoning strategies directly comparable.</description><pubDate>Mon, 16 Jul 2007 00:00:00 GMT</pubDate></item><item><title>MaLARea closes a machine-learning and theorem-proving feedback loop over large theories</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/malarea-learning-reasoning-loop/</link><guid isPermaLink="false">evt-2007-malarea</guid><description>The system repeatedly trains relevance models from existing proofs, invokes automated provers on selected premises and incorporates newly found proofs into subsequent learning rounds.</description><pubDate>Wed, 27 Jun 2007 00:00:00 GMT</pubDate></item><item><title>Coq fully checks a formal proof of the Four Colour Theorem</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/four-colour-theorem-coq/</link><guid isPermaLink="false">evt-2005-four-colour-coq</guid><description>The formal development encoded the combinatorial argument and computational case checking inside Coq so that correctness reduced to the proof assistant&apos;s general verification mechanisms rather than theorem-specific external programs.</description><pubDate>Thu, 21 Apr 2005 00:00:00 GMT</pubDate></item><item><title>Flyspeck launches a long-term formal proof of the Kepler conjecture</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/flyspeck-project-launch/</link><guid isPermaLink="false">evt-2003-flyspeck-launch</guid><description>The project aimed to formalize both the written mathematical argument and the computer calculations underlying Hales&apos;s proof, eventually using HOL Light and Isabelle.</description><pubDate>Wed, 15 Jan 2003 00:00:00 GMT</pubDate></item><item><title>HR automates mathematical concept formation and theory exploration</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/hr-automated-theory-formation/</link><guid isPermaLink="false">evt-1998-hr</guid><description>HR searches a space of mathematical concepts, evaluates their interest and uses generated concepts to drive further examples, classifications and conjectures.</description><pubDate>Sun, 26 Jul 1998 00:00:00 GMT</pubDate></item><item><title>EQP finds a proof resolving the Robbins conjecture</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/robbins-conjecture-eqp/</link><guid isPermaLink="false">evt-1996-robbins-eqp</guid><description>The automated search produced a compact equational derivation in a problem that had resisted prior human and machine efforts for decades.</description><pubDate>Thu, 10 Oct 1996 00:00:00 GMT</pubDate></item><item><title>The CADE ATP System Competition institutionalizes head-to-head theorem-prover evaluation</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/cade-atp-system-competition/</link><guid isPermaLink="false">evt-1996-casc</guid><description>Systems were evaluated in a shared computational environment on standardized theorem-proving problems, making performance comparisons more reproducible and visible.</description><pubDate>Thu, 01 Aug 1996 00:00:00 GMT</pubDate></item><item><title>The QED Manifesto articulates a shared vision for a machine-checked mathematical knowledge base</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/qed-manifesto/</link><guid isPermaLink="false">evt-1994-qed-manifesto</guid><description>QED was a field-building vision rather than a single software release, calling for broad cooperation around shared formal mathematical knowledge.</description><pubDate>Sun, 15 May 1994 00:00:00 GMT</pubDate></item><item><title>TPTP establishes a shared benchmark library for automated theorem proving</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/tptp-problem-library/</link><guid isPermaLink="false">evt-1993-tptp</guid><description>TPTP collected ATP test problems into standardized formats with domain classification and release/version discipline so theorem provers could be tested on comparable inputs.</description><pubDate>Fri, 12 Nov 1993 00:00:00 GMT</pubDate></item><item><title>Metamath establishes a minimal formal language and independently checkable proof corpus</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/metamath-formal-language/</link><guid isPermaLink="false">evt-1992-metamath</guid><description>Metamath separates a very small verifier from explicit proof objects, allowing a large body of formal mathematics to be checked with a minimal trusted mechanism.</description><pubDate>Wed, 30 Sep 1992 00:00:00 GMT</pubDate></item><item><title>Isabelle develops a generic theorem-proving framework across object logics</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/isabelle-generic-theorem-prover/</link><guid isPermaLink="false">evt-1988-isabelle</guid><description>Isabelle used higher-order unification and a generic meta-level architecture to encode and reason within several object logics, with tactics and tacticals providing automation.</description><pubDate>Mon, 23 May 1988 00:00:00 GMT</pubDate></item><item><title>HOL consolidates LCF-style mechanized proof for higher-order logic</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/hol-proof-generating-system/</link><guid isPermaLink="false">evt-1988-hol</guid><description>HOL combined a small trusted logical basis, ML programming and tactics/tacticals for goal-directed interactive proof in higher-order logic.</description><pubDate>Fri, 01 Jan 1988 00:00:00 GMT</pubDate></item><item><title>Nuprl demonstrates constructive proof development on substantial number theory</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/nuprl-constructive-proof-development/</link><guid isPermaLink="false">evt-1986-nuprl</guid><description>Nuprl combined constructive type theory, refinement-style proof development, tactics and computational interpretation of proofs. Complete proofs could be used to obtain programs meeting formal specifications, linking theorem proving, formal mathematics and verified programming in a single environment.</description><pubDate>Tue, 01 Jul 1986 00:00:00 GMT</pubDate></item><item><title>Graffiti turns graph-theory conjecture generation into a sustained computer program</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/graffiti-automated-conjecturing/</link><guid isPermaLink="false">evt-1986-graffiti</guid><description>Graffiti evaluated candidate relations between graph invariants, retained statements without known counterexamples and used heuristics to suppress trivial or redundant conjectures.</description><pubDate>Sun, 01 Jun 1986 00:00:00 GMT</pubDate></item><item><title>The Calculus of Constructions proof checker begins the Coq lineage</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/coq-early-proof-checker/</link><guid isPermaLink="false">evt-1984-coq</guid><description>The system provided machine checking for proofs in the Calculus of Constructions and evolved through successive implementations into Coq and later Rocq.</description><pubDate>Sat, 22 Dec 1984 00:00:00 GMT</pubDate></item><item><title>Edinburgh LCF consolidates the trusted-kernel, ML and tactics architecture for interactive theorem proving</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/edinburgh-lcf-trusted-kernel-tactics/</link><guid isPermaLink="false">evt-1979-edinburgh-lcf</guid><description>Edinburgh LCF avoided retaining complete proof objects by exposing theorem values through a restricted abstract interface whose constructors corresponded to axioms and inference rules. Users could write higher-level proof procedures in the typed functional language ML, while tactics and tacticals supported reusable backward proof strategies.</description><pubDate>Sat, 01 Dec 1979 00:00:00 GMT</pubDate></item><item><title>AM explores automated mathematical concept formation and conjecture discovery</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/am-automated-mathematician/</link><guid isPermaLink="false">evt-1977-am</guid><description>AM maintained an agenda of potentially interesting mathematical tasks and used general heuristics to decide which concepts, examples and conjectures to explore next.</description><pubDate>Mon, 22 Aug 1977 00:00:00 GMT</pubDate></item><item><title>Wen-Tsun Wu validates the algebraic method that becomes Wu&apos;s method for automated geometry theorem proving</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/wu-method-geometry-theorem-proving/</link><guid isPermaLink="false">evt-1977-wu-method</guid><description>The method algebraizes elementary geometry: geometric configurations are encoded as polynomial equations and theorem proving is reduced to symbolic polynomial reasoning. Wu developed the route from Ritt-style characteristic-set ideas and constructive elimination, enabling mechanical proof procedures and explicit treatment of degenerate cases. Later computer implementations proved non-trivial geometry theorems and helped establish algebraic automated deduction in geometry as a durable research program.</description><pubDate>Fri, 18 Feb 1977 00:00:00 GMT</pubDate></item><item><title>The Mizar program begins a long-running machine-readable formal mathematics project</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/mizar-ideology/</link><guid isPermaLink="false">evt-1973-mizar</guid><description>Mizar developed a formal mathematical language, checker and library model aimed at building a cumulative body of computer-verifiable mathematics.</description><pubDate>Wed, 14 Nov 1973 00:00:00 GMT</pubDate></item><item><title>The Edinburgh Pure Lisp Theorem Prover brings automated induction to program reasoning</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/pltp-boyer-moore-induction/</link><guid isPermaLink="false">evt-1973-pltp</guid><description>PLTP targeted properties of recursively defined programs that resolution-based first-order provers handled poorly, using domain-specific proof procedures centered on simplification and induction.</description><pubDate>Mon, 20 Aug 1973 00:00:00 GMT</pubDate></item><item><title>Stanford LCF demonstrates interactive machine checking for Scott&apos;s Logic for Computable Functions</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/lcf-proof-checker/</link><guid isPermaLink="false">evt-1972-lcf</guid><description>Stanford LCF let users state proof goals, decompose them into subgoals and apply simplification and inference commands while the machine checked the resulting formal derivations. It predated the extensible ML metalanguage, abstract theorem type and programmable tactics that characterized Edinburgh LCF.</description><pubDate>Sat, 01 Jan 1972 00:00:00 GMT</pubDate></item><item><title>MACSYMA consolidates symbolic mathematical manipulation into an AI-era system</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/macsyma-symbolic-mathematics/</link><guid isPermaLink="false">evt-1971-macsyma</guid><description>MACSYMA integrated rational functions, algebraic simplification, calculus and related symbolic operations within an interactive extensible system.</description><pubDate>Tue, 23 Mar 1971 00:00:00 GMT</pubDate></item><item><title>Automath establishes a language for machine-checkable mathematics</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/automath-language/</link><guid isPermaLink="false">evt-1968-automath</guid><description>Automath represented definitions, propositions and proofs in a highly explicit typed formal language so a computer could verify the correctness of derivations.</description><pubDate>Mon, 16 Dec 1968 00:00:00 GMT</pubDate></item><item><title>Robinson&apos;s resolution principle establishes a machine-oriented foundation for automated deduction</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/resolution-principle/</link><guid isPermaLink="false">evt-1965-resolution-principle</guid><description>The method combines substitution through unification with a single resolution inference scheme, replacing less efficient alternating procedures used in earlier machine theorem proving.</description><pubDate>Fri, 01 Jan 1965 00:00:00 GMT</pubDate></item><item><title>SAINT applies heuristic AI to symbolic integration</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/saint-symbolic-integration/</link><guid isPermaLink="false">evt-1961-saint</guid><description>SAINT represented integration as a search problem, using rules of thumb to choose transformations and substitutions that reduced an integral toward solvable forms.</description><pubDate>Wed, 10 May 1961 00:00:00 GMT</pubDate></item><item><title>The Geometry Theorem Machine demonstrates heuristic proof search in Euclidean geometry</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/geometry-theorem-machine/</link><guid isPermaLink="false">evt-1960-geometry-theorem-machine</guid><description>The system combined symbolic deduction with geometric information to prune implausible proof paths, demonstrating an early form of domain-informed heuristic reasoning.</description><pubDate>Tue, 03 May 1960 00:00:00 GMT</pubDate></item><item><title>Logic Theorist demonstrates machine-generated proofs in symbolic logic</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/logic-theorist/</link><guid isPermaLink="false">evt-1956-logic-theorist</guid><description>The system encoded logical expressions and searched a space of permissible transformations, prioritizing promising branches with heuristics rather than exhaustive enumeration.</description><pubDate>Mon, 10 Sep 1956 00:00:00 GMT</pubDate></item><item><title>The Dartmouth proposal frames artificial intelligence as a research program</title><link>https://charlie-wang-03.github.io/ai4math-chronicle/en/events/dartmouth-ai-proposal/</link><guid isPermaLink="false">evt-1955-dartmouth-ai-proposal</guid><description>The proposal did not establish AI4Math as a separate field. It established the broader AI research frame within which mathematical reasoning became one of the earliest domains for testing machine intelligence.</description><pubDate>Wed, 31 Aug 1955 00:00:00 GMT</pubDate></item></channel></rss>