Orientation
This page records experiments in which AI systems have been used as substantial contributors to mathematical problem solving in Physics and AI Safety. It describes a process and its early outputs, rather than claiming that the candidate results collected here are established science.
Unless a result is explicitly marked as independently verified, every reported result on this page should be read as provisional. Candidate arguments, code, and supporting materials are shared so that they can be inspected, tested, criticized, or refuted.
Motivation
AI systems are becoming genuinely capable contributors to mathematical problem solving. Mathematics is a favorable domain: candidate claims can be stated precisely, and their correctness can, at least in principle, be checked through computation, or formalization. That makes it both a natural proving ground for AI-assisted research and an unusually tractable setting in which to evaluate it.
Looking beyond math, other sciences also have verifiable elements, but verification for them is typically slower, more distributed, and more ambiguous: it may depend on experiments, complex simulations, or even interpretive judgment. Whether the growing contribution of AI to mathematical progress can translate into meaningful contributions elsewhere — and what research methods might enable that translation — is an open question.
I have been exploring this question through problems in mathematical physics and AI safety (i.e. specific problems with a game-theoretic or complexity-theoretic core). Can a common AI-assisted workflow help formulate, address and resolve problems across these areas, and can current models already produce candidate results that merit serious investigation? In this context, failures may be as interesting as apparent successes.
This exploration has produced several candidate results that seem to motivate substantial follow-up, including one in kinetic theory that requires careful verification. At the moment, candidate results emerge faster than one can responsibly verify them. The limiting steps involve reconstructing derivations, testing code, searching for prior art, and possibly finding reviewers with the right expertise across disciplines.
I am starting with two released candidate results — one in physics, one in game theory — together with an account of how they were produced, so that others can examine, test, criticize, or refute the work. Nothing published here from these experiments should be read as an established result (unless explicitly noted later on).
At this stage, the AI-assisted research process described and its consequences might be as informative and interesting as the individual candidate results themselves.
The Methods section below describes, in broad strokes, how I used AI systems to select problems, develop candidate arguments, cross-check and critique the generated artifacts, and finally revise what survived. It also describes where human judgment enters: selecting problems, steering the process, and deciding which outputs are worth pursuing. The Results section records the wider range of problem classes I have been exploring so far, distinguishing work still in progress from tentative candidate results and tasks that failed or proved unproductive.
Eventually, one could imagine a system such that every AI-assisted claim carry its own verification state, provenance record, review history, and explicit mechanisms for correction and credit. Something like that could, in principle, become a template for meaningfullypublishing AI-assisted research. What is shared here for now is more modest: an early account of a specific exploratory process, with a small number of provisional results and artifacts, published before any infrastructure for AI-assisted research even exists.
A broader question that motivates this project is: can AI-assisted research become useful to scientists beyond mathematicians, across various research dimensions (scope, breadth, depth and impact).
Acknowledgments: Much of this project has greatly benefited from brainstorming, writing and editing from Fable 5, Opus 5 and GPT5.6 Sol Pro.
Methods
The following generic workflow was largely committed in advance. In broad outline, it has five stages:
- Problem formulation — choosing definite questions whose answers are plausibly verifiable
- Task construction — turning a chosen problem into a constrained long-horizon task formulation
- Long-horizon search — looped agentic runs to explore competing approaches until resolved
- Criticism and revision — leverage separate model criticism, fed back into search/refinement
- Artifact preparation — reorganizing what survived into a readable writeup and auxiliary verification artifacts
In practice, the stages can overlap, and the balance among them can vary from one problem to another, especially as a given project unfolds.
Several AI systems played distinct roles throughout:
| ROLE | SYSTEMS |
|---|---|
| Brainstorming | Fable 5 |
| Cross-checks, writing, and editing | Opus 5, Fable 5, GPT‑5.6 Pro |
| Task Definition and Critical/Literature reviews | GPT‑5.6 Pro |
| Long-horizon exploration, execution and loops | GPT‑5.6 Terra and GPT‑5.6 Sol (Ultra mode) |
1. Problem formulation
Problem formulation came first, and it was kept separate from any attempted solution. I brainstormed with Claude Fable 5 about areas of mathematical physics, game theory, and complexity theory I know enough about to appreciate the potential significance of a result, even if I may not be able to review every research artifact myself.
I used the recent Fable-5-assisted counterexample to the Jacobian conjecture in 3D [1] as an elicitation step: it is an example artifact that Fable 5 could verify quickly and directly, before starting any brainstorming session on other domains where similarly verifiable artifacts might exist.
I narrowed and reformulated the resulting candidate problems through further discussion. This was an elicitation stage, not a reliable test of novelty: a problem suggested by a model may already have been answered, may be ill-posed, or may conceal assumptions that only become visible later. I chose the subfields and selected problems that seemed worth pursuing and within my technical grasp. Later examination of the literature sometimes changed the formulation, or the apparent significance of the target.
2. Task construction
Once I had selected a problem, I turned it into a research task. The starting point was OpenAI's published prompt for the Cycle Double Cover Conjecture, which I asked GPT‑5.6 Pro to abstract into a generic template (with placeholders) for a verifiable task statement, admissible methods, success conditions, and failure conditions.[2] I then combined that generic template with the problem formulation developed at the previous stage. The point was not merely to replace the conjecture-specific vocabulary; I wanted to retain several features of the original prompt and methodology:
- a precise target
- a strong distinction between a complete resolution and merely suggestive progress
- a search across substantially different approaches and solution strategies
- the aggressive use of multi-agents to broaden the search space and to leverage test-time compute more effectively
- a demand for concrete lemmas, constructions, equations, or counterexamples
- repeated adversarial attempts to break any proposed answer
The resulting task was deliberately more forceful than an ordinary request for a "best effort." It asked the system to treat the task as a long-horizon goal, to avoid stopping after the first failed route, and to keep several regions of the strategy space alive long enough to learn why they worked or failed.
The generic task template and each problem-specific task statement were not fine-tuned in any way, in the spirit of broad and generalizable elicitation again. There is potentially considerable room for improvement in both steps.
3. Long-horizon search
I assigned the resulting tasks to Codex, using GPT‑5.6 Terra or GPT‑5.6 Sol in Ultra mode, depending on the problem and the compute budget. Ultra mode coordinates parallel subagents working on different parts of a task, or on different approaches to it.
An outer loop (/goal) towards successful resolution was further imposed, in the spirit of:
Do not stop until you have successfully completed the following task.
The various problem runs lasted from several hours to several days. Some produced a candidate resolution within hours; others were stopped after days without any clear progress.
4. Criticism and revision
Any promising output then entered a separate criticism phase. I used GPT‑5.6 Pro as the principal reviewer, in the spirit of:
Crtically review all the claims and artifacts associated with the following result.
Occasionally Fable 5 (or Opus 5) provided additional reviews and cross-checks.
Some candidate results survived this critical review stage and were developed further (i.e. sent back to the agentic loop for revision). Others weakened into partial statements, stalled at a specific gap, or were abandoned.
5. Artifact preparation
The final stage was the preparation of the results for sharing. I reorganized candidate arguments, artifacts and code into academic-style writeups and associated research artifacts, with heavy assistance from Sol Pro, plus Fable 5 or Opus 5 for relevant literature cross-checks.
Scientist-in-the-loop
My role was concentrated at the transitions between stages rather than distributed uniformly across every step of the process. I:
- selected the research areas, subdomains, and shaped and selected problem formulations of personal interest
- chose the models and compute budgets
- decided when to stop, redirect, or abandon an agentic run
- interpreted the critiques and decided when/what to feed back
- selected the outputs that appeared significant enough to pursue
I did not independently reconstruct every derivation or verify every claim in the results and artifacts being released here, and as of this release no other person has examined these arguments in detail. The process is therefore neither fully autonomous research nor conventional human research with AI used only for drafting: the models did a substantial part of the search and exploration, derivation, coding, criticism, and exposition, while human judgment framed the tasks and curated what survived.
Results
The record below includes successes and failures (within a Test-Time-Compute budget of a few days at most). The status of several problems will likely evolve as candidate results are being reviewed over time or follow-up attempts (including with greater TTC budgets) are pursued. Additional problems may also be added over time.
Candidate results and promising directions
| PROJECT / PROBLEM | STATUS |
|---|---|
| Bounds on hard-sphere transport | Released |
| A kinetic theory problem | Promising (under detailed review) |
| Black Hole magnetospheres | In-progress |
| Certified finite patrol games | Released |
Inconclusive or unproductive investigations
| PROJECT / PROBLEM | STATUS |
|---|---|
| Smale 6th problem | Reached TTC limit (days) |
| Coagulation equation | Reached TTC limit (days) |
| Limits of hydrodynamics | Unsuccessful |
| A relativistic hydrodynamics problem | Unclear |
| Debate & complexity theory I | Unclear |
| Debate & complexity theory II | Unclear |
| Steganography | Unclear |
Initial artifacts
Spectral gap and transport coefficients for the three-dimensional hard-sphere Boltzmann operator: certified enclosures · Released v0.1. Article, certificates, derivations, verification programs, tests, and reproducibility materials.
Certified Randomized Oversight for AI Control · Released v0.1. Article, mathematical appendix, source material, tutorial certificate, verifier, and integrity records.
Footnotes
- Levent Alpöge, original X post (20 July 2026).
- OpenAI, “Prompt Used for ‘A Proof of the Cycle Double Cover Conjecture’” (PDF, 9 July 2026).