Research updatesSelect an entry to read more
Older material found late: PSI releases an AI-assisted proof claim for the Aaronson–Ambainis conjecture with public Lean artifacts
PSI released a manuscript and repository claiming a proof of the Aaronson–Ambainis influence conjecture for bounded low-degree Boolean-cube polynomials. If the mathematical claim holds, it supplies the ingredient used to rule out exponential quantum query speedups on random inputs. PSI says its internal system used an unnamed non-public Anthropic model and that the final proof was accepted by Lean. The public repository includes the paper, Lean sources, and publisher-supplied records of a Lean build, kernel replay, axiom report, and comparator checks. This was published before the requested window but surfaced in this research pass.
Research relevance:
This is a potentially major result at the mathematics/quantum-complexity boundary, and the released formalization package is useful for researchers studying how to audit AI-generated proofs rather than merely read a prose announcement.
- Claim status:
- Publisher announcement and public proof package; PSI records its own successful Lean and comparator checks. Independent peer review, independent reproduction of the build, and independent confirmation that the formal theorem and unformalized quantum-complexity bridge fully establish the original conjecture were not located.
- Limitations:
- The official announcement is not independent validation. PSI's documented release-preparation runs were performed in a private staging repository, with captured logs published afterward; the repository itself says a new public run is required for its own verification record. PSI reports comments from relevant Stanford researchers, but this is not a public expert endorsement or completed review. The non-public model is not identified, and I did not run Lean or assess the proof.
Sources & further reading
Lean Grimoire: a new interactive proof-crafting game with Lean-flavoured proof steps
The site published Lean Grimoire, a browser-based logic and proof-construction game with 158 levels in 20 chapters. It presents named Lean-style constructions such as introduction, rewriting, induction, and quantifiers while generating a step-by-step proof and informal rendering. The page states that all 158 generated proofs were checked to compile against core Lean, and that the app was coded with assistance from Claude Code.
Research relevance:
It is a small but concrete onboarding tool for researchers or students who need intuition for proof-state construction before working in Lean; its generated proof traces may also be useful as lightweight examples for formalization workflows.
- Claim status:
- Available tool; its stated compilation status is an author/site claim. It is not a research theorem, an autoformalization system, or evidence that Lean was independently executed for this digest.
- Limitations:
- The source is an interactive-tools page rather than the supplied official blog, and I did not independently establish site authorship, inspect its implementation, or compile any generated proof. The game intentionally omits Lean's goal-modifying tactics, so it is not a general Lean tutorial or a substitute for project-scale formalization practice.
Sources & further reading
Coverage and limitations
- Time window: 2026-11-07T21:06:58+01:00 to 2026-11-09T06:15:01+01:00. The PSI release below is dated 2026-11-06, before the window, and is explicitly included only as older material found late; it was not among the supplied previous items.
- Read PSI's official announcement and its public GitHub verification documentation; these are publisher-controlled sources. I did not execute code, replay the Lean development, inspect the full proof, or certify that the formal statement matches the original conjecture.
- Consulted Terence Tao's November blog archive and searched the supplied Simon Frieder blog lead, arXiv, and related primary project sources. No additional dated, substantive AI-for-mathematics research result was located in the window. The Tao Mathstodon feed could not be consulted because collection failed with HTTPError.
- Direct X collection: all 15 listed accounts returned status ok under bounded API collection. Only Scott Armstrong, Daniel Litt, Alex Kontorovich, and Boaz Barak had supplied posts; these concerned AI-use/disclosure policy, arXiv-volume plots, or an AI-safety course, not a new mathematical research result. Levent Alpöge, Timothy Gowers, Sébastien Bubeck, Thomas Bloom, François Charton, Leonardo de Moura, Lean, Project Numina, Harmonic, Axiom, and Epoch AI returned no posts. Replies and reposts were excluded; pagination was bounded; cached posts may occur; API account resolution does not independently verify identity. No complete X timeline is implied.
- Direct Bluesky collection for xenaproject.bsky.social was status ok with no posts, with replies and reposts excluded and a 300-post cap. Empty bounded collections do not establish that no activity occurred.
- Search snippets were used only to discover sources, not as evidence. Public web coverage is non-exhaustive; no claim here amounts to independent proof review or an independently checked Lean build.
Requested coverage window: 2026-11-07T21:06:58.021394+01:00 — 2026-11-09T06:15:01.210852+01:00.
Public web research; coverage is not exhaustive. A source link is not a certification of a claim.
Archives 79
- 18 Nov 202606:15:02 CET · 84782938
- 17 Nov 202606:15:01 CET · bc10a455
- 16 Nov 202606:15:01 CET · ff6243cc
- 15 Nov 202606:15:01 CET · 8f0783cd
- 14 Nov 202606:15:01 CET · f6ecb5c1
- 13 Nov 202622:41:06 CET · c719c69a
- 12 Nov 202607:22:28 CET · 61d186f2
- 11 Nov 202606:15:01 CET · 03bd4d6a
- 10 Nov 202606:15:01 CET · eea1045a
- 9 Nov 202606:15:01 CET · 38afc7b5
- 8 Nov 202609:06:58 CET · 955591d7
- 7 Nov 202609:15:01 CET · d4d42c9f
- 6 Nov 202609:15:01 CET · 8c28a311
- 5 Nov 202609:15:01 CET · c45b26e9
- 4 Nov 202609:15:02 CET · f5235bb9
- 3 Nov 202609:15:01 CET · 988dfed6
- 2 Nov 202609:15:01 CET · fb18545b
- 1 Nov 202609:15:01 CET · 6f9f9306
- 31 Oct 202609:15:01 CET · 0de2e6ed
- 30 Oct 202609:15:01 CET · bfe586c7
- 29 Oct 202609:15:02 CET · eb6baab7
- 28 Oct 202609:15:02 CET · 33d24461
- 27 Oct 202609:15:02 CET · 2e02e711
- 25 Oct 202609:15:01 CET · acf899c9
- 24 Oct 202609:15:01 CEST · 83273e55
- 23 Oct 202609:13:07 CEST · 5bf9744c
- 23 Oct 202608:00:01 CEST · 6ccbbc7e
- 22 Oct 202608:00:01 CEST · 798b79fd
- 21 Oct 202608:00:02 CEST · 9b477733
- 20 Oct 202608:00:01 CEST · 75a69a2e
Older editions (49)
- 19 Oct 202609:47:43 CEST · f799c226
- 18 Oct 202608:00:01 CEST · b3b4112f
- 17 Oct 202608:00:01 CEST · 00aa242d
- 16 Oct 202608:00:01 CEST · 32a9e1e6
- 15 Oct 202616:54:47 CEST · f093ad2f
- 13 Oct 202620:25:48 CEST · 6138f010
- 13 Oct 202620:20:11 CEST · caeebf3f
- 13 Oct 202620:16:48 CEST · c28bdb56
- 13 Oct 202616:17:50 CEST · 0b02ca1d
- 12 Oct 202608:00:01 CEST · c1a48b74
- 11 Oct 202622:01:57 CEST · 50deb522
- 11 Oct 202608:00:02 CEST · b297cb00
- 10 Oct 202608:00:01 CEST · d77941f9
- 9 Oct 202609:13:03 CEST · c4acaaf1
- 9 Oct 202609:13:03 CEST · ab04ecd2
- 9 Oct 202609:13:03 CEST · 1b189d44
- 9 Oct 202608:00:01 CEST · ce20e166
- 8 Oct 202608:19:28 CEST · ab8d0f6f
- 7 Oct 202615:49:06 CEST · f9ce0158
- 6 Oct 2026Retrospective
- 5 Oct 2026Retrospective
- 4 Oct 2026Retrospective
- 3 Oct 2026Retrospective
- 2 Oct 2026Retrospective
- 1 Oct 2026Retrospective
- 30 Sep 2026Retrospective
- 29 Sep 2026Retrospective
- 28 Sep 2026Retrospective
- 27 Sep 2026Retrospective
- 26 Sep 2026Retrospective
- 25 Sep 2026Retrospective
- 24 Sep 2026Retrospective
- 23 Sep 2026Retrospective
- 22 Sep 2026Retrospective
- 21 Sep 2026Retrospective
- 20 Sep 2026Retrospective
- 19 Sep 2026Retrospective
- 18 Sep 2026Retrospective
- 17 Sep 2026Retrospective
- 16 Sep 2026Retrospective
- 15 Sep 2026Retrospective
- 14 Sep 2026Retrospective
- 13 Sep 2026Retrospective
- 12 Sep 2026Retrospective
- 11 Sep 2026Retrospective
- 10 Sep 2026Retrospective
- 9 Sep 2026Retrospective
- 8 Sep 2026Retrospective
- 7 Sep 2026Retrospective