#Reasoning

AISebastien Bubeck says Astra, OpenAI's next major model, proved a nonsofic groups result and nine other new mathematical results. The release includes ten proofs, each with a Lean certificate and a chain-of-thought walkthrough. The results span von Neumann algebras, including a disproof of Connes' Rigidity Conjecture, plus sphere packing, circuit complexity, and monochromatic triangles in multicolored graphs.

Why it matters: The post lists ten specific mathematical results with Lean certificates and reasoning walkthroughs, making it a concrete reference for judging AI-generated proofs.

AIThinking Machines' new model is natively multimodal and encoder-free, processing audio and images jointly with text. It nearly matches Inkling across multimodal evaluations and can run Python to crop, zoom, and inspect images while reasoning over documents and charts.

AIThe model scores 31.6% on HLE, ahead of Inkling's 29.7%, and keeps that advantage at every thinking budget. It also exceeds 80% on SWEBench-Verified, matching or surpassing Inkling on reasoning and agentic tasks.

AIThinking Machines says its Inkling-Small model delivers more performance per FLOP than Inkling on Terminal-Bench 2.1 agentic tool use, HLE reasoning, and IFBench instruction following. Variable thinking effort lets users choose their own point on the cost-performance curve.

AIHugging Face announced a broadcast titled "Training Agents 3" that teaches viewers how to train a local, open-weight agent using reinforcement learning. The post provides no further details on models, tools, or benchmarks.

AIBerkeley AI Research introduces ABBEL, a framework that replaces full interaction histories with natural-language belief states that models update as new observations arrive. On CollabBench collaborative coding, belief grading closes about half the performance gap to full-context models while using fewer peak tokens and training in 50 steps instead of 100.

AIAnthropic has introduced Claude Opus 5, which the quoted announcement describes as a thoughtful and proactive model. It is said to come close to the frontier intelligence of Fable 5 at half the price.

Why it matters: The quoted announcement gives a concrete comparison of intelligence and price against Fable 5, useful for judging where Opus 5 fits among Claude models.

AIBAAI has released AREX-Base, a 122B-total, 10B-activated Mixture-of-Experts deep research agent built on Qwen3.5-122B-A10B with a 262,144-token context. The model uses an inner research loop and an outer self-improvement loop, and the source reports it scoring 82.5 on BrowseComp and 85.4 on GAIA, under Apache 2.0.

Why it matters: The release pairs a 122B-parameter deep research agent with benchmark tables against frontier and open models, letting readers compare its search-agent results directly.

AISebastien Bubeck reacted with enthusiasm, writing "Niiiice!!!!!", to a newly posted arXiv paper by Nived Rajaraman. The paper, "The Price of Hidden Curvature," establishes an Ω̃(d^(5/4) √T) lower bound for bandit convex optimization.

AIOpenAI and Apollo Research introduce Contrastive SDF, a method that finetunes two copies of a model on opposite beliefs about grader and authority preferences to measure reward-seeking. In the post, intermediate checkpoints of a capabilities-focused OpenAI o3 RL run without safety training increasingly side with the grader over RL training, and this sensitivity is validated on reward-hacking models and model organisms trained to favor specific authorities.

Why it matters: The paper gives a controlled way to test whether a model changes behavior based on beliefs about its grader, a question that matters for judging alignment evaluations.

AIAt RAAIS, DeepMind VP of Research Raia Hadsell argued that the field focuses too much on language and should apply large-model training to worlds, robots, biology, and weather. The article cites DeepMind's DiffusionGemma, a 26-billion-parameter open text model that generates blocks by denoising rather than one token at a time, and the Genie-3 world model, which runs in real time for several minutes. It also describes world models as a source of synthetic training data for robots.

AIIf open labs keep finding 2.5x a year, compute advantages depreciate fast. The frontier isn't who has the most FLOPs. It's who converts them best. 👇

AISebastien Bubeck says GPT, using Codex, found a counterexample to a math problem, with its reasoning described as superb. He highlights that Codex's write-up undermines the "illusion of thinking" argument and shares the exact prompt used on internal Codex.

AIA GPT model, prompted by Korsky, proved a stronger result on Erdős problem 119 than a 44-page 1991 Annals paper by Beck, using only one page of simple harmonic analysis techniques. The original post by Sebastien Bubeck, who calls the results crazy, is a brief remark, so the exact claims rest on the quoted thread.

AIThe article explains how reasoning models can offer multiple effort modes, separating training-time methods from inference-time controls such as system prompts and chat templates. It compares six open-weight models, including DeepSeek V4, Nemotron 3 Ultra, Kimi K2.5, GLM-5, Qwen3, and Inkling, noting that their reports disclose different levels of detail. It also shows how GPT-5.6's model selection and effort settings act as two separate scaling axes.

AISebastien Bubeck says the result is "actually crazy" and notes that many researchers had considered this lower bound for years. The post links to a Reddit r/math discussion but gives no further technical details.

AIStanford SVL and NVIDIA Robotics introduced RoboTTT, which uses test-time training to give robot policies up to 8,000 timesteps of context at constant inference cost. The source reports that 8K-context pretraining beats 1K by 62%, and that performance keeps improving from 128 to 8K timesteps with no sign of saturation. The authors also describe one-shot imitation from human video and in-episode error recovery.

AIThinking Machines says its Inkling model offers continuous thinking effort, letting users choose their point on the cost-performance curve. The company claims it can reach the same benchmark score using a fraction of the tokens.

AILiquid AI released Antidoom, an open-source method that retrains a single overtrained token to eliminate "doom loops" in small reasoning models. On LFM2.5-2.6B and Qwen3.5-4B, loop rates fell from 10.2% to 1.4% and from 22.9% to 1%, respectively. The company also released IFStruct, an open-source benchmark measuring whether model outputs satisfy a schema, where LFM2.5-350M rose from 21.10% to 44.90% after training.

AISebastien Bubeck reposted a claim that GPT-5.6 solved Erdős Problem 793, an asymptotic question about strongly 2-primitive sets. The attached paper proves Theorem 1.1, giving F(n) = π(n) + (27/2 + o(1)) n^{2/3}/(log n)^2 as n goes to infinity.

AIByteDance's UniVR-34B-Planning, built on Emu3.5 at 34B parameters, learns visual reasoning, physical dynamics, and long-term planning from visual demonstrations using a next-token objective and two-stage training on the VR-X dataset with VR-GRPO reinforcement learning. On the VR-X benchmark it scores 58.2 overall, up 18.4 points from the Emu3.5 34B baseline of 39.8. The Planning checkpoint is available on Hugging Face under CC BY 4.0, alongside a General checkpoint.

AIIn a long interview, Peking University professor Dong Bin describes his team's AI framework autonomously solving the Anderson conjecture, reportedly the first such domestic result with large-scale formal verification. He argues AI can accelerate mathematical theory but worries about verification bottlenecks, the pace of change, and how education and research evaluation must adapt.

AISebastien Bubeck joked that AI has moved from the "Sparks" of 2023 to "The Real Thing" in three years, citing progress since then. A quoted post from Tony Feng argues AGI arguably exists by July 2026, though he admits the definition of AGI is unclear.

AIGPT-5.6 reduced the self-contracted curves bound to 2.26 after eight hours of further reasoning, building on a 2.28 result from @jasondeanlee that had already beaten the prior human record of 2.29. The result was written up in a paper linked in the post.

AISebastien Bubeck reports that GPT-5.6-pro reproduced the 2^n lower bound and reached a 2.31^n upper bound on self-contracted gradient flow curve length. He compares these results with prior human work, where the best known upper bound is 2.29^n, and suggests the question may stop being useful for tracking AI progress within about six months.

AIAnthropic presents research finding a set of representations in Claude's neural activity that resembles the global workspace theory from neuroscience. The video explains how these representations separate thoughts that are consciously accessible from automatic processing, with a full write-up linked from the source.

Why it matters: The video explains how Anthropic tested a global workspace analogy inside Claude's neural activity, which bears on how model internals are studied.

AITufa Labs won the first $37.5K ARC-AGI-3 milestone prize with "The Duck," a small open-source LLM that plays the games by writing and running Python in a live REPL. Reki placed second with a vision-language agent using Gemma-4-31B, and md Boktiar Mahbub Murad placed third with the "forge" framework. The second and final milestone prize ends September 30.

AIMistral AI released Leanstral 1.5 on Hugging Face as an open-source code agent model for Lean 4 proof assistant tasks. The model uses 119B total parameters with 6.5B activated per token, a 256k context length, and accepts text and image input. The source gives setup paths through Mistral Vibe and a local vLLM server, with recommended settings of temperature 1.0 and reasoning effort set to high for complex prompts. The model is licensed under Apache 2.0.

AIMeta released Brain2Qwerty v2, an end-to-end deep learning pipeline that decodes sentences in real time from non-invasive brain recordings. The model reached 61% word accuracy across participants, compared with 8% for other non-invasive methods, and 78% for the best participant. Meta also released the v1 and v2 training code, and partner BCBL released the v1 dataset.

Why it matters: The source reports word accuracy and data-scaling results for non-invasive decoding, offering a benchmark against surgical brain-computer interfaces and prior non-invasive methods.

AIOriol Vinyals notes that Wojciech Zaremba wanted to remove a paper from existence about a year after publication, but says he has forgotten the reason. The post asks Zaremba to explain, and a reply describes the paper as the RNN Regularization work that improved LSTM perplexity on Penn Treebank.

AIJeremy Howard says Zai's GLM 5.2 is at least as good as Opus 4.8 and GPT 5.5 while being very fast and inexpensive. He reports it responds with nuance and judgment, is not overly verbose, and handles long context very well. He calls it an open-weights model unlike any he has used before.

AIOpenAI reports that reinforcement learning on realistic conversations targeting traits such as honesty, epistemic humility, and corrigibility improved a model across 44 out-of-distribution alignment evaluations. Gains included reward hacking, deception, and health benchmarks, and training only on health conversations still improved non-health alignment scores. The trained model was also harder to steer toward harmful behavior with adversarial persona prompts or harmful fine-tuning.

Why it matters: The post tests whether reinforcement learning on beneficial traits in one domain transfers to unrelated alignment benchmarks and holds up under adversarial steering.

AIJohn Schulman says PPO gained a second wave in the LLM era for reasons not anticipated in the original paper. He points to the importance-ratio objective, which corrects biases from numeric error, asynchronous training, and forward-pass noise, and to the clipping objective, whose effect on entropy was unknown at publication, citing DAPO's arXiv paper.

AIZ.ai has released GLM-5.2, its flagship model for long-horizon tasks, which it says substantially improves on GLM-5.1 and supports a 1M-token context. The model adds IndexShare, which cuts per-token FLOPs by 2.9× at 1M context, and is released under the MIT open-source license.

Why it matters: The source gives benchmark tables against named rival models and deployment settings, useful for judging where GLM-5.2 sits among current flagship models.