Raschka ships an 11-hour reasoning-model course; also: IQuest-Q1's 320B agentic CLI model, a recursive self-improvement survey for robots, cross-layer Meta Experts and Deep Fusion Memory

Lead stories

Sebastian Raschka releases an eight-video, 11-hour "reasoning model from scratch" course

2 sources, 4 min read

What happened. On 24 October 2026, Sebastian Raschka posted eight coding lectures on his Ahead of AI newsletter, "over 11 hours" in total (Ahead of AI). They accompany his book Build a Reasoning Model (From Scratch). The course starts from a small pre-trained Qwen3 model and adds evaluation, inference-time scaling, reinforcement learning and distillation in plain Python and PyTorch. He calls it "essentially the sequel" to his earlier course on coding LLMs from the ground up, though it does not require that course. He also says he is taking a short break and will resume research roundups next month source.

Details. Video 1 sets up the environment with uv, discusses hardware, and covers CUDA and Apple Silicon checks and remote GPUs through VS Code. Video 2 loads the pre-trained weights of "a Qwen3 0.6B model" and implements greedy decoding, streaming generation, end-of-sequence handling, a KV cache and torch.compile. Video 3 builds a math-answer verifier that extracts, normalises and checks equivalence, then evaluates on MATH-500. Raschka stresses that the verifier has a second job: it later supplies the reward for reinforcement learning with verifiable rewards (RLVR). Video 4 covers temperature scaling, multinomial sampling, top-p filtering and self-consistency by majority vote, and plots accuracy against extra inference compute. Video 5 adds heuristic scorers, token and sequence log-probabilities, and a self-refinement loop in which the model critiques and revises its own answer. Video 6 implements a simplified GRPO: sample groups of responses, score them with the verifier, and turn the relative rewards into advantages. Video 7 adds entropy and advantage tracking, clipped policy ratios, a KL term, a discussion of reward hacking, the limits of the simplified KL formulation, and format rewards conditioned on correctness. Video 8 distils from teacher answers generated with DeepSeek R1 on the MATH dataset. It compares soft and hard distillation and on-policy and off-policy distillation, then evaluates the student on MATH-500 source.

The companion repository, rasbt/reasoning-from-scratch, had 5.5k stars, 874 forks and an Apache-2.0 licence at the time of reading (GitHub). Its appendices cover larger LLMs, batching, LLM-as-judge and MMLU evaluation, and a chat interface. The bonus folders include GRPO variants "in DeepSeek-V3.2, Olmo3 and GDPO styles" and downloadable checkpoints for chapters 6 to 8. On hardware, the repo says chapters 2 to 4 run on CPU or GPU, and recommends a GPU for chapters 5 and 6 "if you want to replicate the results in the chapter" (GitHub) source.

Facts vs. opinions. What can be checked: eight videos exist, each linked to a YouTube URL; the base model is Qwen3 0.6B; MATH-500 is the yardstick throughout. Neither the newsletter post nor the repo front page gives any MATH-500 accuracy figures, so this issue cannot say how much each technique helps at 0.6B (Ahead of AI). The post never explicitly calls the videos free. The only access promise it makes is for a separate 90-minute LinkedIn Learning course, which "should be free for 24h" through his link. The opinions are Raschka's: that "almost all current-generation LLMs today are reasoning models or offer a reasoning mode", and that implementing from scratch is "still the best way to understand and learn how things really work". The engine-and-harness framing is his teaching device, not a technical definition: the model is the engine, and the agent harness handles context management and tool access source.

Other perspectives. No independent review of the videos was found as of 2026-10-25. At the time of reading the post showed 130 likes and 4 comments, which is too early to judge reception (Ahead of AI). Three caveats are worth holding. First, a 0.6B model is a teaching substrate. Effects of self-refinement, GRPO clipping or KL penalties at that scale need not transfer to the 15B-active and larger models discussed below, and the course does not claim they do. Second, Raschka himself flags that his KL term is a simplified formulation with limitations. That is honest, but it means the code teaches the shape of the algorithm, not a production recipe. Third, distilling from DeepSeek R1 outputs on MATH puts the student's ceiling at the teacher's answers on a narrow domain. In the wider literature, whether RLVR teaches new abilities or mainly sharpens what the base model can already sample is a live argument; that was not checked here, and the course materials do not settle it source.

Why it matters. For an engineer building agents, the most transferable lesson is in videos 3 and 7. The verifier is both the evaluation and the reward, so its blind spots become the policy's targets. Raschka discusses reward hacking and format rewards conditioned on correctness for exactly that reason. The same failure appears in a quick hit below, where a coding agent passed every test and the code was still wrong. Video 8's split between on-policy and off-policy distillation is also the conceptual key to IQuest-Q1's "MOPD" stage, covered next. The course is a cheap way to make those industrial terms concrete on a laptop-scale model source +1.

IQuest-Q1: a 320B-total, 15B-active open-weight MoE built for terminal agents

2 sources, 5 min read

What happened. IQuest Research has posted a technical report on arXiv for IQuest-Q1 (2610.30949, v1 submitted 22 October 2026), which it describes as "a sparse Mixture-of-Experts (MoE) agentic foundation model" with 320B total and 15B active parameters (arXiv). The report says: "We release IQuest-Q1 as an open-source model to support community research and development." The weights are on Hugging Face as IQuestLab/IQuest-Q1 under a custom licence named "iquest-q1" (Hugging Face). The arXiv post came after the weights. When fetched, the Hugging Face collection said "Updated 26 days ago" huggingface.

Details. The report gives this architecture (arXiv HTML): - 88 layers, hidden size 3,072, 48 query heads and 8 KV heads with head dimension 128. - 256 routed experts per MoE layer, 8 active, each with intermediate size 1,536. The first layer is a dense FFN. - Attention mixes three sliding-window layers to one full-attention layer, with a 4,096-token window. The first two and last two layers use full attention, and every attention layer uses query-aware sink attention. - A 160,000-token vocabulary. - Stable SplitNorm, the Muon optimizer and μP parameterisation. - Two multi-token-prediction layers in training, used at inference for speculative drafting.

Context was extended through 32K, 128K and 512K, and the model card lists 524,288 tokens. The report says the model was "trained on a total of 29T tokens" across pre-training and mid-training, plus more than 240B and more than 50B tokens in two SFT stages. Post-training includes MOPD, which the report expands as Multi-Teacher On-Policy Distillation. It distils from four frozen expert models: agentic user experience, multi-harness, long-horizon and general agentic. The report claims "1.93× higher scaling efficiency" than a Qwen3-30B-A3B-style MoE baseline. It also extrapolates a "Critical Model Size" of about 572B activated or about 12T total parameters, a projection rather than a result huggingface.

Paper facts. This is an arXiv preprint labelled "IQuest Report", with no venue. It lists 177 authors. The only affiliation given is "IQuest Research", and the corresponding author is Bryan Dai (arXiv; arXiv HTML). The comparisons are against two proprietary models, Claude Opus 5 and GPT-5.6 Sol, and four open ones: GLM-5.3-Flash, DeepSeek-V4-Flash-0731, Tencent Hy3 and MiniMax M3. All scores use "the highest available reasoning effort for each model". An asterisk marks numbers the authors ran themselves; the rest are publicly reported, so evaluation conditions are mixed. The harnesses also vary: mini-SWE-agent for DeepSWE, BasicAgent for PaperBench, Claude Code for the other coding tasks, an internal harness for search and HLE, and benchmark-provided harnesses elsewhere. Time limits run from 6 hours for CyberGym and ProgramBench to 12 hours for PaperBench.

Here are IQuest-Q1's scores, with Claude Opus 5's alongside where useful: - Terminal-Bench 2.1: 83.2, against 84.3 for GLM-5.3-Flash, 82.7 for DeepSeek-V4-Flash-0731 and 89.1 for Opus 5. - Terminal-Bench 3.0: 17.9, against 30.0 for GLM-5.3-Flash and 42.7 for Opus 5. - Terminal-Bench 4.0: 22.7, against 32.8 for GLM-5.3-Flash and 53.9 for Opus 5. - SWE-bench Multilingual: 80.3, against 89.5 for Opus 5. - SWE-Bench Pro: 57.5, against 79.2 for Opus 5. - CyberGym: 84.5, against 83.6 for GPT-5.6 Sol. - GPQA Diamond: 93.3, against 93.4 for Opus 5. - HLE without tools: 39.2, against 54.9 for Opus 5. - HealthBench Professional: 33.4, against 47.1 for GLM-5.3-Flash and 59.8 for Opus 5. - IQuest-CLIBench, the authors' own proprietary benchmark: 53.7.

SWE-bench Verified is not reported. The stated limitations are text-only input; that "Generated explanations and code may be incorrect"; an IQuest-specific tool-call format that needs compatible parsers; and that on real CLI tasks the model "may overlook constraints, repeat failed attempts, or leave issues unresolved." Weights are released; the training code is not stated huggingface.

Facts vs. opinions. The weights exist, the architecture is documented, and the model card agrees with the report on the main shape. Everything else is vendor-run evaluation, some of it on the vendor's own benchmark, under each model's highest reasoning effort and in harnesses that differ by task. The pattern inside the table matters more than any single cell. IQuest-Q1 is competitive with the open Flash-class models on older or saturating benchmarks such as Terminal-Bench 2.1, SWE-bench Multilingual and GPQA Diamond. It falls well behind GLM-5.3-Flash on the newer, harder Terminal-Bench 3.0 and 4.0 splits, the closest thing in the table to an unsaturated test of the "agentic CLI" capability in the title. It is also far behind the proprietary pair on HLE, CritPt and HealthBench Professional. The report's claim that the model performs well on coding and general tasks is the authors' summary. The model card itself is blunter: "IQuest-Q1 remains at an early stage, with substantial limitations in its capabilities and reliability" (Hugging Face). The report also says that "human cyber security experts, assisted by IQuest-Q1, produced 30 vulnerability reports" during a three-day deployment, and that all of them were independently validated by fellow security experts, with findings affecting open-source projects responsibly disclosed to their maintainers huggingface.

Other perspectives. On r/LocalLLaMA, the Hugging Face release thread had 54 points and 22 comments when read. These are opinions, not findings. The top complaint was that the weights ship only in BF16. One user counted "~684GB for bf16". That is in the right range, since 320B parameters at two bytes each is about 640 GB before the MTP weights. Several users voiced "300b models fatigue" and asked for a 100B model. One asked whether the model was a GLM-5.3-Flash fine-tune, since both are 320B-total. Others replied that the config.json declares a distinct "IQuestQ1ForCausalLM" architecture and that the README describes a full training pipeline. One commenter called it a model that "drops an absolute banger" over DeepSeek-V4-Flash and GLM-5.3-Flash, which the report's own table supports only on some rows. The Hugging Face card showed 4,777 downloads in the last month and 149 likes, and listed three community quantisations for llama.cpp, LM Studio, Jan and Ollama without naming their formats (Hugging Face). A Pandaily headline describes the same release, but only the headline could be read (Pandaily) huggingface.

Why it matters. There are three reasons. First, deployment. The documented setup uses tensor parallelism across 8 GPUs with CUDA 13.0 images, and the card's example Codex configuration sets approvals to "never" with "danger-full-access" (Hugging Face). A security-minded reader should treat that as a convenience default, not a recommendation, especially for a model whose own card says it may overlook constraints. Second, local inference. At 15B active the per-token compute is modest, but 320B total still means hundreds of gigabytes resident or streamed from disk. That is why the Meta Expert paper below, which aims to cut expert counts at equal quality, matters. Third, recursive self-improvement. The report says IQuest-Q1 "participates in an iterative model-development process built on our internal infrastructure." IQuest Research is also a listed affiliation on ModularRSI, the archive item below, which reports harness-evolution gains whose bootstrap confidence interval excludes zero, unlike those of the two rival methods it compares against. Read together, the lab's self-improvement claims deserve the same scrutiny as its benchmark table huggingface +1.

"Toward Recursive Self-Improvement in Physical AI": a 93-page survey with an honest negative finding

2 sources, 3 min read

What happened. Twelve authors from NUS, HUST, SJTU, NTU and HKBU, with Hongzhan Lin as corresponding author, have posted a survey (arXiv 2610.29677, v1 21 October 2026) on carrying recursive self-improvement (RSI) from software agents into robotics (arXiv; project page). They define RSI as a system that improves "not only its behavior but also the process by which it improves." Their central finding is negative: physical studies "have yet to isolate gains attributable to recursion" huggingface.

Details. The survey sorts where a retained improvement can live into four places (project page): - Policy updates: the policy, value function or residuals. - World models used for planning or for generating training experience. - Memories, skills and code that are retrieved or synthesised later. - Learning procedures themselves: data collectors, evaluators, editors and updaters.

It then defines two links of recursion. R1: repair knowledge must improve the improver itself. R2: the improved improver must then help produce its own next upgrade. It profiles four systems as examples, SILVR, RISE, PlayWorld and VLAW. It argues that gains persist only under four conditions: feedback that targets unmet learning needs; a receiving component that can represent, optimise and execute the change; value that survives task or hardware shifts, including shifts the improvement itself causes; and continued practice that stays safe and affordable. The authors warn that data volume and component accuracy are poor measures of progress. Their proposed test, in Figure 9, uses matched learners and a protected common outcome check: compare an improver that keeps what it learned with one whose acquired knowledge is frozen. They suggest reward construction and skill-library editing as starting points, with Eureka and PRACTICE as baselines. The project's bar for success is that "knowledge of why one repair worked causally improves how the next repair is made" huggingface.

Paper facts. This is an arXiv preprint survey with no venue, 93 pages with 15 figures and 21 tables. The project page's reference library has 229 references from 1966 to 2026, and an "Awesome-Physical2RSI" GitHub list accompanies it (arXiv; project page). No new experiments, benchmarks, sample sizes or headline numbers are stated; the contribution is the taxonomy, the conditions and the evaluation proposal. The authors say the reviewed evidence is mostly in manipulation and shows three things: behavioural gains, benefits to later learning, and improved procedures. Neither code nor weights are relevant to a survey; only the reading list is released huggingface.

Facts vs. opinions. The finding that no physical study has isolated a recursive gain is the authors' reading of their 229-reference corpus. It is a strong negative claim, and readers can check it against the public list. The four conditions and the R1/R2 split are proposals, not established results. The suggestion that a frozen-knowledge improver is the right control is, in this issue's reading, the most useful idea in the paper, because it turns "self-improving" from a label into a testable comparison. The survey makes few empirical claims, and the main one is a deflationary claim about everyone else's huggingface.

Other perspectives. No independent reaction was found as of 2026-10-25. The Hugging Face listing had 46 upvotes when it entered the bundle. The most useful outside view is a comparison with digital RSI work in this same issue. ModularRSI evolves an agent harness with a frozen model and reports gains of about 2 to 5 percent on terminal and SWE tasks; its bootstrap interval for its main gain excludes zero, while the intervals for the two compared methods, Meta-Harness and AHE, cross zero (arXiv HTML). By the survey's R1/R2 standard, harness evolution of that kind would count as improved procedures. It would not count as demonstrated recursion unless the improved harness were shown to produce a better next harness than a frozen one. The survey's caution therefore applies to software agents too, even though it is written for robots huggingface +1.

Why it matters. Recursive self-improvement is a phrase that draws money and fear in roughly equal measure. This survey offers a falsifiable test and states plainly that robotics has not yet passed it. For an engineer building self-editing agents, the practical lessons are: freeze a copy of the improver and compare; protect the outcome metric from the thing being optimised; and budget for the cost of trials. In robotics that cost is broken hardware. In agents it is tokens and the risk of a harness that edits its own guardrails huggingface.

Meta Expert: sharing MoE experts across layers to cut expert count

4 sources, 4 min read

What happened. Fourteen authors from Tsinghua University and Shanghai AI Laboratory propose "Meta Experts" (arXiv 2610.27598, v1 20 October 2026) (arXiv; arXiv HTML). Their premise is that experts in different MoE layers store overlapping content and show "substantial similarity and redundancy". Their fix is a pool of experts that any layer can route into. The headline claim is that, with the number of activated experts and expert granularity held fixed, the model "matches the performance of Vanilla MoE using only 70--80% of the experts" huggingface.

Details. In the pure Meta design, one router and one shared pool replace the per-layer MoE blocks. In the main hybrid design, each layer keeps private "Local Experts" and also routes into the shared pool (arXiv HTML). There are two families of topology variants. "F2L2" restricts the first and last few layers to Local Experts. "Loop" splits the Meta pool into 2, 4 or 8 sub-pools, each serving every second, fourth or eighth layer. The ladder base, called MR75, uses 96 Meta and 32 Local experts per layer with 4 of each active, top-8 routing and one gated shared expert. The pilot was 2B-A0.5B. The downstream models were 6B-A1.6B trained on 200B tokens. A scaling ladder ran at depths 12, 16, 20 and 24 with Qwen3.5-style hybrid attention, mixing gated DeltaNet and full attention, on H200s. It ranged from 5.31B tokens and 7.135e18 FLOPs at depth 12 to 34.92B tokens and 2.413e20 FLOPs at depth 24. The phrase "retrieval-efficient" in the title needs translating. It does not mean faster loading of experts from storage. It is a theoretical claim that shared experts act as bidirectional residual pathways, with an "O(1)-length path independent of m−l", so shallow layers can read content that deeper layers wrote into the pool during training huggingface.

Paper facts. This is an arXiv preprint with no venue. The models are built on Megatron-LM, and no code release is mentioned (arXiv HTML). The only external baseline is Vanilla MoE with Local Experts only. Loss is reported only as ratios against Vanilla, and it is the training loss averaged over the final ten steps, not a held-out loss. Here are the 6B-A1.6B downstream accuracies, with Vanilla first: - MMLU: .4087 for Vanilla, .4120 for MR75, .4175 for MR75 plus Loop2. - C-Eval: .4354, .4443, .4487. - CMMLU: .4203, .4161, .4344. - TriviaQA: .1924 for Vanilla, .2042 for the F2L2 plus Loop2 variant. - BBH: .2972 for Vanilla, .2912 for MR75, .3061 for MR75 plus F2L2. - OpenBookQA: .3500 for Vanilla, .3380 for MR75, .3640 for MR75 plus Loop2.

The stated limitations: "Due to the limited training budget, different Meta Expert variants exhibit advantages across different datasets"; a Meta-only model "may suffer from training instability"; why mild hierarchy adds redundancy without hurting loss "remains an open question"; and the theory characterises access and path length "rather than guaranteeing against vanishing signals." All variants were trained under the Vanilla model's optimal hyperparameters with no re-tuning huggingface.

Facts vs. opinions. The paper says Meta variants "consistently outperform the vanilla baseline". Its own table does not fully support "consistently". MR75 trails Vanilla on CMMLU, BBH and OpenBookQA, and the F2L2 variant trails on MMLU, C-Eval, CMMLU and OpenBookQA. The configuration with the best training loss, F2L2 plus Loop2, is not best downstream on most benchmarks. The size of the saving is also reported inconsistently across the paper. The abstract says 70 to 80 percent of the experts. The parameter-reduction ablation works out to about 20 to 30 percent fewer experts, or 15 to 25 percent fewer parameters. Figure 1 says "75–90% as many parameters". The introduction says "only 70%". These are the authors' numbers, at sub-10B scale, against one internal baseline. The reported trend that savings grow with depth and size is an extrapolation from a four-point ladder whose largest model saw 34.92B tokens huggingface.

Other perspectives. No independent reaction was found as of 2026-10-25. Two archive items give useful context. NVIDIA's LatentMoE, the production efficiency bet in the MoE line, attacks a different cost: it projects tokens into a smaller latent dimension for expert routing and computation, which the model card says improves accuracy per byte, and it ships in Nemotron 3 Super (Hugging Face). ToMoE converts dense models into MoE after training. Meta Expert instead changes where expert parameters live, so it is complementary rather than competing. For local inference, which is the curator's reason for picking it, the relevant effect would be fewer unique expert weights to store or offload. This issue's own speculation, not stated in the paper, is that a shared pool might also raise cache hit rates for systems that page experts from disk, because the same expert could serve several layers. The paper measures none of this huggingface +2.

Why it matters. If the result holds at scale, it is a cheap architectural change that attacks the main cost of large MoE models on consumer hardware: total parameters, not active ones. IQuest-Q1 is a live example of that cost, at 320B total and 15B active. A 20 to 30 percent cut in experts at equal quality would matter far more on a single workstation than another FLOP saving. The evidence today is a sub-10B preprint, judged by training loss and six benchmarks with mixed signs. Treat it as a direction worth watching, not a design rule huggingface +1.

Deep Fusion Memory: a learned chunk memory fused into a frozen LLM's hidden states

1 source, 4 min read

What happened. Researchers at Shanghai Jiao Tong University's LUMIA Lab and Shanghai AI Laboratory propose Deep Fusion Memory, or DFM (arXiv 2610.25100, v1 18 October 2026) (arXiv; arXiv HTML). It sits between retrieval-augmented generation and continued pretraining. A small causal "memory predictor" learns to generate a memory vector from the preceding context, supervised by embeddings of retrieved chunks during training. Each chunk's tokens share one predicted memory, which is fused into intermediate hidden states "through gated cross-attention". The backbone stays frozen, and at inference there is no explicit retrieval huggingface.

Details. The authors pitch two kinds of efficiency against MLP Memory, an earlier parametric-memory method. The first is data-building cost: "32× fewer retrieval queries and 2048× fewer retrieved items" than token-level approaches. Their Table 13 puts this as 125M queries against 4B, and 2B retrieved items against 4.096T, with 16 neighbours per query against 1,024. The second is training cost: 24 hours against 64 hours on 16 A800 GPUs, or 384 GPU-hours against 1,024, with 0.75B added parameters against 1.50B (arXiv HTML). On Qwen3-4B, DFM adds 0.6B parameters, and the memory predictor is a 28-layer network of width 1,024. The question-answering corpus is a December 2018 Wikipedia dump of about 4B tokens, embedded with Qwen3-Embedding-0.6B at 1,024 dimensions and indexed with FAISS IVF-PQ. In the ablations, chunk sizes of 16, 32 and 64 give six-task averages of 26.51, 27.21 and 27.07 on Mistral-7B. Fusing only at the last layer drops the average to 21.11, and fusing at the last four layers gives 22.07, against 27.09 to 27.54 when fusion starts at layer 9 huggingface.

Paper facts. This is an arXiv preprint with no venue. The paper says "The code will be released soon"; no weights are linked (arXiv HTML). There are six question-answering tasks: NQ (3,610 test samples), WebQA (2,032), HotpotQA (7,405 validation), 2Wiki (12,576), MuSiQue (2,417) and Bamboogle (125). WebQA is scored by substring match and the others by F1. The baselines are RAG with a top-1 passage, xRAG, RETRO, continued pretraining (CPT), LoRA with a matched parameter budget, and MLP Memory.

The six-task averages: - On Mistral-7B-v0.3, DFM scores 27.21. The strongest baseline is xRAG at 24.14, then RAG at 23.41, MLP Memory at 22.09 and the base model at 13.63. - On Qwen3-8B-Base, DFM scores 26.46. The strongest baseline is MLP Memory at 23.80, then xRAG at 23.51, the base model at 22.71 and RAG at 20.86.

Those gaps are the abstract's "12.71%" and "11.19%". They are relative gains of +3.07 and +2.66 points over the strongest baseline in each case. On OLMo-3-1025-7B, DFM averages 25.49 against 23.63 for RETRO.

In domain adaptation (HumanEval, HumanEval+, GSM8K and LawBench), DFM averages 64.69 on Qwen3-4B-Base against 58.18 for the base model and 62.92 for CPT. On Qwen3-8B-Base it averages 67.52, against 63.14 for the base model and 66.96 for LoRA.

There is no dedicated limitations section. The caveats in the text are that "memory adaptation is not uniformly beneficial across backbones", that "explicit retrieval retains an advantage on some benchmarks", that all ablations are single runs, and that the case studies were selected huggingface.

Facts vs. opinions. The averages are real, but the per-task rows matter. On Mistral's 2Wiki, plain top-1 RAG scores 31.02 against DFM's 25.00. On Qwen3's WebQA, DFM's 39.47 is below the unmodified base model's 41.78. On Qwen3-4B's LawBench, CPT's 41.66 beats DFM's 40.41. Some baseline behaviour is odd and goes unexplained. On Qwen3-8B, RAG lowers the average below the base model, 20.86 against 22.71, which suggests the top-1 retrieval setup is not a strong RAG baseline. MLP Memory's interpolation weight was chosen "on each reported evaluation split". That choice favours the baseline rather than DFM, but it shows how loosely the comparisons were tuned. No inference-latency numbers are reported. That matters, because "no explicit retrieval" is the selling point, while the memory predictor and gated cross-attention still add compute per chunk. The efficiency claims concern building training data and training time, not serving huggingface.

Other perspectives. No independent reaction was found as of 2026-10-25. The design invites comparisons with MemoryLLM, kNN-LM and Memory Decoder. The paper does not run those as baselines; kNN-LM and Memory Decoder appear only in related work (arXiv HTML). The most useful contrast for a practitioner is the one the paper's own numbers draw. Parametric memory compresses a corpus into weights. It wins when questions need the gist of a domain and loses when they need a specific passage. The 2Wiki row is a multi-hop benchmark where the exact passage matters, and there RAG wins. The knowledge also freezes at the December 2018 Wikipedia snapshot, so updating it means retraining the predictor, which RAG avoids huggingface.

Why it matters. For retrieval and memory work, DFM is a credible middle option: an add-on of a few hundred million parameters to a frozen 7B-class model that beats CPT and LoRA on most of these tasks, with the backbone left untouched. Because the model is frozen, this is effectively a pluggable domain module, which is attractive for local deployment. Until code, latency figures and a stronger RAG baseline arrive, the right reading is "promising on Wikipedia QA at 7 to 8B". It is not yet a replacement for retrieval where provenance or freshness matters huggingface.

From the archive

"The Hyperstitions of Moloch" (Latent Space, published 9 July 2025; saved 3 March 2026)

1 source, 3 min read

What it said. This was swyx's essay introducing a Latent Space episode with a16z partners Justine and Olivia Moore on generative video and brainrot (Latent Space). It argues that reflexivity, which it frames as "contra the Platonic Representation Hypothesis", means beliefs can make themselves real. It borrows Nick Land's word "hyperstition", which it glosses as "ideas that, by their very existence as ideas, bring about their own reality". It says generative AI lowers the barrier from thought to reality. Its examples were Italian brainrot characters turning into real toys, a fictional froyo brand A/B-tested across "50 different accounts, none of which exist", and the claim that programmatically created IP "is worth billions in the consumer market." In the episode, Olivia estimated that "probably 90 percent" of a short-video feed was AI video at that moment, which is her impression, not a measurement latent.

How it aged. The most concrete prediction, that meme-born AI characters become commercial IP, largely came true. Steal a Brainrot, a Roblox game built around buying and stealing brainrot characters, launched on 16 May 2025. According to Wikipedia it peaked at 25.4 million concurrent users in October 2025, "the only Roblox game to exceed 25 million". Wikipedia also cites a Deadline exclusive dated 29 January 2026 reporting that a film is "in the works" with Story Kitchen and DoBig Studios (Wikipedia). Physical goods followed. On 12 May 2026, Nassau Candy announced a Clever Candy line of gummies and chocolate featuring Tralalero Tralala, Bombardiro Crocodilo and Tung Tung Tung Sahur. Its marketing director said "Italian Brainrot videos and memes are some of the most searched content by Generation Alpha". The trade report does not say who, if anyone, licensed the characters (Gifts & Decorative Accessories).

That licensing gap is the essay's blind spot. Decentralised, remixed IP turned out to have owners after all. Wikipedia records that in September 2025 the game removed Tung Tung Tung Sahur after a licensing dispute with its creator, Noxa, and the agency Mememtum Lab, and restored it on 29 November 2025. In October 2025 the game's company sued the maker of an unlicensed Fortnite copy (Wikipedia).

The "Moloch" half of the title also aged well. Platforms began pricing the externality. On 16 July 2026, YouTube split its "inauthentic content" monetisation rule into three categories: generic, repetitive or template-based videos; off-putting or distressing videos; and AI personas of real people discussing finance, legal or health topics. Trust-and-safety chief Matt Halprin said such videos can be "very generic and don't really have a narrative arc", and "that's the stuff that we don't want to have in YPP" (TechCrunch). That is demonetisation, not removal. The essay's "selling things that don't exist yet" playbook still works, but platforms now treat some of it as content farming.

On the philosophical framing: the Platonic Representation Hypothesis, as usually stated, is a claim that neural networks' internal representations converge as models scale. It is not a claim that human beliefs converge on reality, so "contra PRH" sets up a weaker opponent than the paper describes. That reading of PRH is from memory and was not checked here latent.

Why it matters now. The essay's core mechanism is that cheap generation plus fast feedback turns guesses into products. It is now a documented pattern, with a game that hit a 25.4 million peak concurrent-user count, a film in the works and a candy that debuted at a trade expo with shipping expected in June as evidence. The two counterweights it underplayed, ownership disputes and platform pushback, have also become real. For product design, the lesson is that A/B-testing demand with synthetic content works, and that someone will eventually check whether the thing exists and who owns it latent.

"Detection Engineering in the Era of Semantic Malware" (detect.fyi, saved 30 July 2026)

2 sources, 2 min read

What it said. According to the TLDR InfoSec summary in the bundle, the post argued that campaigns targeting agents through their memory or configuration leave no classical indicators of compromise. It said file integrity monitoring, privilege auditing and behavioural baselining can be adapted, and it proposed new signals: context-window integrity, agent session telemetry, memory-file provenance and cross-session behavioural correlation. The original post at detect.fyi returned HTTP 403 and could not be read, so only that summary is reported here detect.

How it aged. The threat model was already documented before the post. ThreatDown's 3 April 2026 write-up described top-downloaded skills on ClawHub, OpenClaw's public skill marketplace, that "were revealed to be outright malware", citing a Cybersecurity News report. It singled out memory poisoning as the hard persistence case: "Even after the original malicious skill is removed, the injected instructions in MEMORY.md may survive indefinitely," and "The agent doesn't know it has been compromised" (ThreatDown). ThreatDown's own fixes are its endpoint and EDR products, with alerts such as Claude Code triggering "System Information Discovery". That is vendor marketing, though the manual advice to audit installed skills and review memory files after suspicious behaviour is generic and sound.

Research after the post moved toward the measurement the post called for. HarnessSafe (arXiv 2608.06984, 7 August 2026) built 328 executable cases across seven "persistent-carrier families": memory, skills, tools and shared artifacts. It models each case as a lifecycle from entry, through persistence, to a later benign trigger and an observable violation (arXiv). Its abstract argues that attack success rates "cannot reflect distinct lifecycle progression patterns", and that containment depends on both the carrier type and the harness-model pairing. That supports the post's case for cross-session correlation over single-event alerts. The abstract gives no success rates and no list of harnesses.

The public incident record remains thin and vendor-heavy. A Stellar Cyber explainer titled "Top Agentic AI Security Threats in Late 2026" lists dollar-figure incidents, including "$5 million in false purchase orders", with no sources. It cites research from "November 2026" and "December 2026", which is impossible as of 25 October 2026 (Stellar Cyber). Treat it as unreliable. A search also surfaced claims about a campaign called "ClawHavoc" with conflicting counts of malicious skills; those pages were not read, and the numbers are not repeated here detect.

Why it matters now. The prediction has held in substance. Agent persistence lives in plain-text memory and skill files, and research benchmarks now model it as a lifecycle. Mature, independently documented incident data has not appeared. For anyone running Claude Code or similar harnesses, the cheap controls follow from the post: version-control and diff your memory and instruction files, log which skill or session wrote each change, and alert on edits that no reviewed commit explains. The IQuest-Q1 card's sample configuration, which turns off approvals and sandboxing, shows how fast those defaults erode detect +1.

ToMoE and tiny runtimes (AINews, 25 August 2026)

1 source, 2 min read

What it said. AINews summarised a r/LocalLLaMA thread on ToMoE, a method that turns dense LLMs into mixture-of-experts models through differentiable dynamic structural pruning of MLP layers. It enforces a fixed active-parameter budget without deleting weights, and it claims to beat prior structural pruning on Phi-2, LLaMA-2, LLaMA-3 and Qwen-2.5 without fine-tuning. A commenter estimated that converting a dense Qwen 27B would give something closer to A16B active than A3B, with noticeable quality loss. The same section covered SHADOW-250M, a from-scratch 250M-parameter model quantised below 2 bits to about 60 MB, reportedly running at about 400 tokens per second on a laptop CPU. Critics said its "100 million context" claim conflated a 2k transformer context with a disk-backed retrieval archive reddit.

Paper facts. The ToMoE repository cites the paper as published in Transactions on Machine Learning Research with a 2026 date and "J2C Certification" (GitHub). Pipeline A, the original method, uses Llama-2-7B. Pipeline B, an upcycling path with gated attention and continued pretraining, was tested on Llama 3 8B and produces an MoE with "about 3.5B active and 20B total parameters". The code is Apache-2.0. The repo front page does not restate the paper's numbers, so they are not given here reddit.

How it aged. Two months on, adoption in local inference is close to nil on the evidence available. The official repository had 41 stars, 3 forks and 2 watchers when read. It hosts no exported checkpoints, its Releases section is empty, and it never mentions GGUF or llama.cpp (GitHub). Without a published converted checkpoint or an export path to the formats local users run, ToMoE remains a research tool. That matches the Reddit thread's main practical objection about custom runtimes. Its upcycling numbers also cut against the hope of a cheap, very sparse model: 3.5B active out of 20B total from an 8B dense seed is a larger, not smaller, model to store. The commenter's A16B estimate for Qwen 27B was an opinion and remains untested; nothing found shows anyone converting that model. The wider market went the other way. The large models in today's news, IQuest-Q1 at 320B-A15B and Nemotron 3 Super at 120B-A12B, are trained as MoE from scratch, which is the commenter's preferred path (arXiv HTML; Hugging Face). SHADOW-250M was not checked for this issue; no follow-up evidence is reported reddit.

Why it matters now. Converting a dense model into an MoE afterwards is still the only route to sparsity for the many strong dense checkpoints, and a peer-reviewed method with code is a reasonable base for experiments. The lesson from its two months, and from SHADOW-250M's context-window dispute, is about distribution rather than ideas. Methods that do not export to the standard local stacks do not spread, however good their tables reddit.

Multi-Head LatentMoE and Head Parallel (TheTuringPost on X, saved 10 February 2026)

2 sources, 2 min read

What it said. The saved item was a Turing Post post on X about "Multi-Head LatentMoE + Head Parallelism". The post could not be read through the tools available. The underlying paper is arXiv 2602.04870 by Chenwei Cui, Rockwell Jackson, Benjamin Joseph Herrera, Ana María Tárano and Hannah Kerner, submitted 4 February 2026 (arXiv). The abstract says this gives O(1) communication cost regardless of how many experts are active, fully balanced traffic, and deterministic communication x.

Paper facts. This is an arXiv preprint, with only v1 listed, licensed CC BY 4.0. The abstract page lists no venue and no code link (arXiv). Its headline: compared with standard MoE using Expert Parallel, it "trains up to 1.61× faster while having identical performance", and at double the granularity it gets better performance while being 1.11× faster. Search-result snippets from other indexes quoted different figures, "1.82×" and "1.08×", and one index listed it as an ICML 2026 paper. Neither claim was verified. The arXiv page shows a single version, so the discrepancy is unexplained. The token count, dataset scale and limitations are not stated on the abstract page x.

How it aged. The parent idea won; the multi-head extension shows no sign of uptake yet. LatentMoE, which the Multi-Head paper builds on, is now a shipped production architecture. NVIDIA's Nemotron 3 Super went up on Hugging Face on 11 March 2026 with 120B total and 12B active parameters. Its card says that under LatentMoE "tokens are projected into a smaller latent dimension for expert routing and computation, improving accuracy per byte", and it showed 1,021,908 downloads in the last month when read (Hugging Face). No public model was found that uses Multi-Head LatentMoE or Head Parallel. The IQuest-Q1 paper, one of today's lead stories, does not mention it. The paper's real contribution is to training-systems engineering, removing data-dependent all-to-all communication, which helps clusters rather than single-machine inference. That may explain why it has not reached the local-model community x +1.

Why it matters now. Deterministic, balanced communication is valuable for reproducible training and for hardware without fast all-to-all interconnects. The 1.61× claim was made against Expert Parallel at the paper's scale. Until a lab reports it in a production training run, it stays an interesting systems result. The cleaner takeaway for this reader is that LatentMoE's bandwidth-first design went from paper to a model with a million monthly downloads within weeks x.

Claude Code "Epitaxy" desktop overhaul leak (TestingCatalog, 13 April 2026)

3 sources, 2 min read

What it said. TestingCatalog reported that Anthropic was preparing a Claude Code desktop overhaul codenamed "Epitaxy". According to the report, it borrowed from Cowork, with dedicated panels for a Plan, sub-agent Tasks and Diffs; previews of running code; work across multiple repositories; a "Coordinator Mode" in which Claude orchestrates parallel sub-agents; and custom agents created in the app. It framed this as a race with OpenAI's Codex "superapp" and predicted desktop updates "as early as next week" testingcatalog.

How it aged. The timing prediction was right and the feature list was partly right. On 15 April 2026, MacRumors reported the redesign "rolling out now to Claude Code users on Pro, Max, Team, and Enterprise plans" (MacRumors). What shipped: - "a new sidebar for managing multiple sessions", filterable by status, project or environment; - a side chat that "lets users branch a question off a running task without feeding extra context back into the main thread"; - an integrated terminal and an in-app file editor; - a rebuilt diff viewer "aimed at large changesets"; - an expanded preview pane for HTML, PDFs and local app servers; - drag-and-drop panes; - plugin parity with the CLI; - SSH on Mac and Linux; - Verbose, Normal and Summary view modes.

Routines, which bundle "a prompt, a repo, and any relevant connectors into a single configuration" and run on Anthropic's web infrastructure, entered research preview alongside.

MacRumors does not mention Coordinator Mode, Plan or Tasks panels, multi-repository work or custom agent creation. Parallel sessions in one window were the shipped answer to "delegate work across parallel agents", rather than a visual orchestrator. A search for later evidence that Coordinator Mode shipped found none. The pages it surfaced described agent teams as an experimental CLI feature behind an environment flag; they were not opened, so that status is not checked here testingcatalog.

Why it matters now. Leaks are good on direction and timing and unreliable on specifics. The source code leak's codenames pointed to the right product, but the orchestrator UI did not ship in the form described. For workflow design the shipped choice matters: Anthropic put the human in the orchestrator seat with many sessions in view, rather than letting Claude coordinate sub-agents on the desktop. That fits the evidence from ModularRSI and the physical-RSI survey that automated self-orchestration is still hard to show beats simpler baselines testingcatalog +2.

ModularRSI: modular recursive harness self-improvement (Hugging Face Papers, 17 September 2026)

3 sources, 2 min read

What it said. ModularRSI (arXiv 2609.14857) evolves a coding agent's harness rather than its model. It splits the harness into five modules: agent loop, tool use, observation management, context management and task-completion detection. Each module evolves independently from the same starting harness by contrasting successful and failed trajectories on the same task, pooling evidence across tasks. The modules are then combined. Evolution uses 2,000 curated executable tasks from sources outside the evaluation benchmarks huggingface.

Paper facts. This is an arXiv preprint with no venue found. The affiliations are Beihang University, the University of Manchester, IQuest Research, M-A-P, Langboat and Hohai University (arXiv HTML). The paper states: "All code and datasets are available at https://github.com/IQuestLab/ModularRSI"; that repository was not checked.

The headline results use DeepSeek-V4-Flash-Preview: - Terminal-Bench 2.0 accuracy rose from 47.57 with no evolution to 52.43 with a harness evolved on Terminal-Bench, and to 49.44 with one evolved on SWE tasks. - SWE-Bench-Verified accuracy rose from 73.40 to 76.40 in-domain and to 75.80 out-of-domain.

Harnesses evolved with that model and then frozen also transferred to other models on Terminal-Bench 2.0: GLM-5.2 went from 59.55 to 61.80, and MiniMax-2.5 from 41.57 to 44.94.

The external baselines on Terminal-Bench 2.0 were Meta-Harness at 49.44 and AHE at 49.81, against ModularRSI's 52.43. Evolving all modules jointly scored 44.19, and non-modular evolution 46.44. The authors draw the conclusion that "a larger self-modification space is not necessarily beneficial for RSI."

The stated constraints: 120 evolution instances per domain "Due to computational and time constraints", and the gain from evolution "differs across models". No monetary or token cost is reported huggingface.

How it aged. Five weeks is too short for citations to build up. Three findings bear on it. The first is internal and decisive. The paper's own bootstrap 95 percent confidence intervals for the advantage over Meta-Harness, -0.07 to 2.24, and over AHE, -0.03 to 2.62, both cross zero (arXiv HTML). On its own statistics, ModularRSI is not shown to beat the two strongest prior harness-evolution methods. It is shown to beat no evolution and to beat its own joint and non-modular variants. The extraction also flagged some intervals as odd, such as a +1.87 gain reported with an interval of 1.49 to 5.24, which is lopsided around its point estimate. That is worth checking against the PDF.

The second finding is context. IQuest Research, one of the affiliations, has just released IQuest-Q1 and describes it as taking part in "an iterative model-development process built on our internal infrastructure" (arXiv HTML). Harness self-improvement is part of that lab's programme, not a one-off paper.

The third finding is a yardstick. The physical-RSI survey published this week demands a comparison against a frozen-knowledge improver before calling any gain recursive (project page). Later papers with similar themes appeared in search results but were not read, so no claim is made about whether they replicate or supersede ModularRSI huggingface +2.

Why it matters now. The module-localised, evidence-pooled design is a practical pattern for anyone tuning an agent harness. Change one component at a time, contrast success and failure on the same task, and validate before merging. The "RSI" label is not earned on this evidence huggingface.

Brain & consciousness

Reading path: State of Brain Emulation Report 2025 (Zanichelli, Schons, Freeman, Shiu, Arkhipov; arXiv 2510.15745): the companion overview article first, then the abstract and the framing of the three core capabilities

4 min read

What to read, in order. Start with Maximilian Schons's Asimov Press essay "Building Brains on a Computer", published 26 January 2026 (Asimov Press). Schons is the report's project lead, and the essay is its narrative entry point. Then read the arXiv abstract. v1 was posted 17 October 2025 and the current v3 on 5 November 2025. The abstract calls the report "a comprehensive reassessment of the field's progress since Sandberg and Bostrom's 2008 Whole Brain Emulation roadmap" and organises it around three capabilities: "recording brain function (Neural Dynamics)", "mapping brain structure (Connectomics)" and "emulation and embodiment (Computational Neuroscience)" (arXiv). The report site, which hosts the final 182-page PDF with a Zenodo DOI, a budget "Guesstimator" and a figure library, is the third stop for figures (report site).

Why this order. The essay first sets the definitions that the rest depends on. "Emulators are not the same as simulators": an LLM can mimic human output on an architecture unlike the brain's, much as airplanes fly without copying birds, whereas emulation tries to reproduce the causal machinery (Asimov Press). Schons lists four ingredients for a credible emulation: a connectome; certain non-neuronal cell types and modulatory systems; accurate modelling of neural activity; and neuroplasticity. With that frame in place, the abstract's three capabilities read as a supply chain. Recording supplies dynamics, connectomics supplies structure, and modelling must fuse the two with a body and an environment.

Key ideas. First, data, not compute, is the bottleneck. The report site says "Data is the bottleneck, not hardware or algorithms" (report site). It defines "whole-brain" recording as at least 95 percent of neurons and says no organism has reached it. The best results are larval zebrafish at about 80 percent coverage and C. elegans at about 50 percent, with calcium imaging at "1-30 Hz" and recordings of minutes to hours. The essay frames this differently, as "a mere 50 percent of neurons in the worm" being the best whole-brain record (Asimov Press). The two companion texts do not agree on which organism holds the record, which is worth noting when citing either.

Second, connectome costs. The essay says the first worm connectome cost "about $16,500" per neuron. Today it is roughly $100 per neuron for flies and about $1,000 per neuron for rodent proofreading alone. For a project of about $1 billion, "prices must fall to $10 per neuron for the mouse and $0.01 per neuron for humans." The often-quoted "up to 17 years" for a mouse connectome comes from a 2023 Wellcome Trust report. Schons argues that expansion microscopy, E11 Bio's protein barcodes and Google's PATHFINDER, which he says cuts proofreading by roughly 80x, offer "a path toward mapping the full mouse brain in about five years for $100 million." That is a projection by the report's lead author.

Third, hardware. The essay says the binding constraint is "memory walls". With the simplest neuron models, a mouse needs about 20 GPUs and "A human simulation would require 20,000 GPUs". A Fudan University run in 2024 used 14,000 GPUs for 86 billion neurons at 1/120th real time, but with wiring extrapolated from MRI, so that is scale without fidelity (Asimov Press).

Fourth, the best existing whole-brain model, the 2024 Berkeley fly model, used all 140,000 neurons' wiring to reproduce feeding and grooming responses. But "Most of the virtual brain was silenced, so as not to interfere with the feeding response", and the model did not fly, learn or sing.

Projections, labelled as such. The essay forecasts a sub-million-neuron emulation of a zebrafish or fly in 3 to 8 years for about $100M. It forecasts a mouse at "about one billion dollars in the 2030s", and a human at "tens of billions for the first human brain emulation model by the late 2040s". Its error bars are ten extra years for the mouse and 20 to 50 for humans (Asimov Press). The report site estimates that "less than 500 people globally are actively dedicated to the direct objectives of brain emulation", and gives funding of about $0.5B per year, which it puts at roughly 1 percent of NIH's budget (report site). The exact scope of that funding figure is not clear from the overview page.

Open questions to carry into the full report. Schons calls inferring activity from structure something that "remains speculative and, given how much promise it holds, surprisingly underexplored". This is the crux for anyone hoping connectomes alone will suffice. The report site's pull-quotes also note that synaptic variability between identical worms is large, with 40 to 50 percent of connections differing. That raises the question of what an "individual" emulation would even target. Schons expects "the first brain emulation models to be generic, rather than personality-preserving", and he doubts AI will collapse the timeline, because the bottlenecks are physical and chemical. The essay states that ethics and philosophy fall outside the scope of Schons's own investigations. The next step on this path is the report's Foundations chapter, on simulation versus emulation and the minimum bar for counting a model as an emulation. The overview page does not spell out that bar.

Wildcards

The problem with thinking you're part Neanderthal (MIT Technology Review, 14 April 2026)

2 sources, 2 min read

Why this is here: exploring LLM personalities, open models, and AI commentary.

What it is. Ben Crair's feature reports a challenge to one of the century's most celebrated findings in human evolution, that many living humans carry Neanderthal DNA from interbreeding (MIT Technology Review). In a 2024 Nature Ecology & Evolution paper, Lounès Chikhi and Rémi Tournebize replaced the standard assumption of large, randomly mating populations with many small subpopulations linked by occasional migration. They ran the simulation a million times and kept the 20 runs that best matched real genomes. Many of those runs produced long DNA segments previously attributed only to Neanderthals. Several admixture statistics could not distinguish hybridisation from population structure. Their paper concludes "if admixture ever occurred, it is currently hard to identify using existing methods." Chikhi's broader complaint is that "It's a general failure of our field that we do not compare our results in a clear way with alternative scenarios." technologyreview

Does it hold up. The article is balanced and does not declare a winner. David Reich at Harvard called the model "weak" and "very contrived", and said multiple lines of evidence "make the evidence for this overwhelming." Aaron Ragsdale at UW–Madison said the paper "forces us to think more critically about the model we use for inference." Mark Thomas at UCL noted that "As you get more data, you can justify more complex models of the world." Crair reports that most researchers still think interbreeding probably happened. Chikhi and Tournebize themselves see structure and admixture as possibly both at work. One evidential point favours the standard view: ancient sapiens genomes carry longer apparent Neanderthal segments than living people, as a more recent Neanderthal ancestor would predict. But the authors tested 10 ancient genomes and found most fit their structured model too (MIT Technology Review). As of 2026-10-25 this is an open methodological dispute, not an overturned result technologyreview.

Why someone with these interests might care. The argument is about inference under a misspecified null model, which is the same problem that runs through AI commentary on model "personalities" and capabilities. When an LLM shows a trait in a behavioural probe, the interpretation depends on which alternatives were simulated and ruled out. Usually that is none. The Neanderthal case shows a statistic that seemed diagnostic ("this segment must be introgressed") becoming ambiguous once a richer null is allowed. That is the same lesson as the UMAP quick hit below, where planted datasets show clusters that do not exist, and as the Meta Expert paper's ratio-only losses. The test for a claim of the form "the model has X" should be the one Chikhi asks for: what simpler structure would produce the same signal? Crair's closing line also applies to AI papers: "Any good storyteller knows that sex sells, even in science." technologyreview +1

Learning more about Claude's mathematical capabilities: the Riemann zeta bound (Anthropic, 10 August 2026)

2 sources, 2 min read

Why this is here: exploring Claude Code features, workflows, and usage tips.

What it is. Anthropic reported that "An unreleased research version of Claude" raised the proven lower bound on the fraction of Riemann zeta zeros that satisfy the Riemann hypothesis "from 41.6% to 67.2%" (Anthropic). The post was updated on 13 August with a revised paper. It is a Claude Code workflow story as much as a maths story. Jarred Sumner, a non-mathematician on staff, asked Claude to "take a real stab" at the hypothesis. The work ran across "two sessions in Claude Code, using a total of 31 million output tokens."

In the first session, "Claude generated and tried 650 ideas, none of which worked." In the second, about a day and a half long, Claude was "coordinating about 60 Claude subagents". They ran 2,400 shell commands, wrote hundreds of Python scripts and ran thousands of numerical checks. Of those subagents, 2 developed the key ideas, 13 contributed ideas, 30 produced nothing new, 13 validated arguments and 2 helped write the paper. Sumner's input was "mostly variants of 'keep going' or 'believe in yourself.'"

The verification came from several directions. Anthropic mathematicians Levent Alpöge and Ralph Furman checked the paper. Brian Conrey and Dan Goldston "examined the paper on short notice." A Lean formalisation by Claude and Eric Easley "passes the standard validation tool comparator." anthropic

Does it hold up. So far, yes, and independently. On 2 September 2026, revised on 8 September, Youness Lamzouri posted "A new proof that more than 2/3 of the zeros of the Riemann zeta function are simple and on the critical line" (arXiv). It proves unconditionally that over 67.25 percent of non-trivial zeros are simple and on the critical line, and that at least 83.62 percent are distinct. It credits the first two bounds to "an internal research version of Claude". Lamzouri describes Claude's argument as "technically intricate". He replaces its matrix framework with a single Hilbert-space inequality and adds two estimates that "are neither stated nor proved in the Claude paper." A human expert re-deriving a result more simply and extending it is about as strong as early validation gets.

The caveats stay. Anthropic itself says "We don't expect that the techniques Claude used will lead to proving the Riemann hypothesis". The result recombines decades of human work by Aryan, by Baluyot, Goldston, Suriajaya and Turnage-Butterbaugh, and by Bombieri. The outside review was quick, and the post does not mention formal peer review (Anthropic) anthropic.

Why it matters for Claude Code users. The workflow pattern carries over. Failure is cheap and abundant: 650 failed ideas came before the one that worked. Sub-agent yield is skewed: 2 of about 60 did the decisive work. Validation was built into the run, with sub-agent review, counterexample searches, re-proving from scratch and a check of 54 arXiv papers for prior discovery, all before a human looked. Compare the Epitaxy story: the desktop overhaul in development would add a Coordinator Mode letting Claude act as an orchestrator, and this result came from Claude orchestrating sub-agents with a human saying "keep going". The model used was unreleased, so this is not evidence about what a paying user's Claude Code session can do anthropic +1.

Quick hits

World models and multimodal

7 sources, 1 min read

• LaLa-World. A Hugging Face Papers listing, at 28 upvotes, on scaling latent world models with natural-language actions. Only the title was available; not read huggingface.
• Self-distilled future video representations for world action models. A paper, at 23 upvotes, on training world action models by self-distilling predicted future video representations. Not read huggingface.
• WeVisOne-VL. The day's most-upvoted listing at 222, a unified visual perception model "from objects to pixels". Scope and benchmarks were not checked huggingface.
• Making MLLM latents matter for cinematic video. At 164 upvotes, factor-aware predictive learning to make multimodal-LLM latents useful for video generation. Not read huggingface.
• What generation knows. A paper, at 31 upvotes, arguing that the generation side of unified multimodal models can unlock fine-grained understanding. Not read huggingface.
• Layered image editing. Compositional edit-prior distillation to turn image edits into reusable layers, at 73 upvotes. Not read huggingface.
• Policy-Mask. Budget-aware adaptation of diffusion-model features to discriminative tasks, at 23 upvotes, with an efficiency angle. Not read huggingface.

Agents and evaluation

8 sources, 1 min read

• Deep search in real web environments. At 152 upvotes, a paper titled "Deep Search in Real-World Web Environments". Worth reading for anyone benchmarking research agents; not read here huggingface.
• "My Coding Agent Passed Every Test. The Code Was Wrong." A Towards AI piece whose teaser argues that tests check only examples, and agents iterating against them learn the examples. It is the same reward-hacking dynamic Raschka covers in his GRPO lectures. Teaser only medium +1.
• Can a dedicated judge replace an LLM judge? A Towards AI comparison of a tool called Jev against Claude Haiku and Claude Sonnet as judges, putting correctness before speed. Only the teaser was available; the method and numbers are unknown medium.
• Agent harness frameworks, dissected. A Medium overview of agent frameworks covering RAG, orchestration, observability and tools. Teaser only medium.
• How a coding agent actually works. A Towards AI explainer tracing a coding agent's internals. Teaser only medium.
• An emergency brake for agents. A Towards AI piece built on Satya Nadella's call for an AI "emergency brake". Its teaser cites a fabricated police tip that went undiscovered for 72 days; the source of that incident was not checked medium.
• Five CLI tools. A personal roundup of terminal tools. Low signal medium.

Security

2 sources, 1 min read

• Phishing simulations are under fire, and MSG supplied the example. Morning Brew's summary of the debate cites Google security manager Matt Linton's 2024 argument that tricking employees does not work and can backfire. It also cites an eight-month study of nearly 20,000 healthcare workers that found "no significant relationship" between recent mandated training and falling for phishing. The concrete case: Madison Square Garden emailed staff in September promising Knicks championship rings, and sent anyone who clicked to a cybersecurity class, as The Athletic reported. An MSG spokesperson then told the New York Post the company is gifting "more than 275 championship rings and jewelry" and called the bait "an unfortunate mistake." The underlying study and Linton's post were not opened here pcmag +1.

Product and design

1 source, 1 min read

• Transparent AI UX. A Towards AI piece offering seven rules for AI interfaces people trust. Its premise is that most people use AI answers without checking them. Teaser only medium.

Methods

2 sources, 1 min read

• Your UMAP clusters may not exist. A Data And Beyond piece that plants known answers in six datasets and measures what dimensionality reduction shows. The teaser claims UMAP displays clusters that are not there. The specific results were not checked. It is a useful companion to the Neanderthal wildcard's lesson about misspecified nulls medium +1.