今日は何も大きな出来事はありませんでした

a quiet day.

AI News for 7/01/2026-7/02/2026. We checked 12 subreddits, 544 Twitters and no further Discords. AINews' website lets you search all past issues. As a reminder, AINews is now a section of Latent Space. You can opt in/out of email frequencies!

AI Twitter Recap

Agentic Coding Systems, Harnesses, and Developer Workflow Infrastructure

• Full-stack evals are replacing toy coding demos: Code Arena launched Fullstack Code Arena, extending evaluation from frontend mockups to software that includes databases, API keys, deployments, and structured tool use. That aligns with a broader shift from “can the model write a component?” to “can the agent ship a realistic app end-to-end?”, echoed by Aryan Vichare and by practitioners emphasizing environment-based evals over static prompts.

• The engineering stack around coding agents is thickening fast: LangChain pushed unified tracing for heterogeneous coding tools in LangSmith, plus OpenWiki for auto-generated repo docs and AGENTS.md updates in this release. LlamaIndex showed a small but useful pattern where parsing becomes an agent-native capability rather than a preprocessing step via a LiteParse + flue + Resend + Turso email assistant. Meanwhile, multiple posts from Jerry Liu and others argued that retrieval complexity is increasingly encoded at the agent layer, with simpler tools and smarter orchestration.

• The practical UX problem is now coordination, not raw codegen: A recurring theme from builders is that frontier coding performance is good enough that bottlenecks have shifted to routing, observability, collaboration, memory, and understanding. Simon Willison highlighted “understand to participate” as the key antidote to cognitive debt with coding agents; Will Depue sketched the desired end-state: an always-on executive assistant with persistent memory, delegated actions, messaging, and computer use. That same desire shows up in PersonalOS, where a 300k-token life context pack is assembled from personal data exports.

Model Availability, Frontier Coding Performance, and Open vs Closed Positioning

• Anthropic’s Fable discourse dominated, but the most concrete news was operational: Anthropic restored confidence around access rather than releasing new weights: official API rate limits were raised and simplified, and Trapit Bansal said Fable is expected to return to subscriptions once capacity allows. Anthropic also expanded Claude Code artifacts to Pro and Max plans, making long-running coding sessions easier to inspect and share.

• Community signal suggests Fable remains frontier-class despite rerouting controversy: Several viral posts complained about Anthropic’s deployment/routing behavior, but even critics were separating that from model quality. Theo argued that bad takes on Fable were distracting from Anthropic’s actual issues, while Arena’s early before/after comparison said scores looked mostly consistent after redeployment across text, document, vision, and code. Theo also noted that some benchmark drops may reflect fallback behavior more than a base capability regression.

• Open-model economics are increasingly credible in coding: Together reported that GLM 5.2 reaches roughly 80% of Sonnet 5 software-engineering capability at ~20% of the price, and zRdianjiao showed that GLM-5.2 is now selectable in Claude Code via Hugging Face Inference Providers, a notable step toward open models inhabiting first-class dev workflows. More broadly, Clement Delangue, Jason, and Bryan Catanzaro via Matt Turck’s interview all pushed variants of the same thesis: open models are becoming the sovereignty layer for enterprises and developers.

• Meta appears to be re-entering the agentic conversation: Alexandr Wang posted that the next Muse Spark update is coming soon with “big improvements in coding and agentic capabilities” to be competitive with leading models, rolling out to Meta AI and its API.

Inference, Kernels, Serving, and Test-Time Compute as the New Scaling Frontier

• Kernel-level automation is no longer hypothetical: The standout systems post was Elliot Arledge’s KernelBench-Mega result: Claude Fable 5 reportedly wrote the first authentic single-launch megakernel for a Kimi-Linear decode workload, achieving 18.7x over reference and beating prior multi-kernel entries. The description is detailed enough to matter to systems folks: in-register int4 dequant, fused attention/router/MoE/norm/KV append, explicit barrier shaving, and a demonstrated willingness by the model to benchmark, revert regressions, and optimize toward a roofline.

• Speculation and speculative decoding remain active optimization surfaces: teortaxesTex pointed to “scaling the speculator” as a new dimension for accelerating inference and therefore RL throughput, while mgoin_ shared a concrete DSpark + Mooncake + vLLM setup on GB300 NVL72, with 125k prefill tok/s and 1.5 steps/s for online training. The vLLM team also highlighted 5x lower token costs on DeepSeek V4 in one month and published a particularly useful serving breakdown for Qwen3-Omni’s real-time speech pipeline, where stage-specific replication yields ~0.6s first audio instead of ~6s and 5.4x throughput.

• Test-time compute budgets are changing benchmark interpretation: The UK AISI post on larger compute budgets propagated widely. scaling01, Tomek Korbak, Noam Brown/polynoamial, David Rein, and Toby Ord all emphasized the same point: if you don’t allocate enough tokens, you systematically underestimate frontier agents. The headline number: frontier horizon estimates rise from roughly 2 hours at 2.5M tokens to around 14 hours at 50M tokens.

Benchmarks and Research on Learning, Memory, World Models, and Continual Adaptation

• Continual/on-the-fly learning is getting sharper measurement tools, but results remain mixed: Epoch introduced EBR-bench, where models repeatedly play Earthborne Rangers and attempt to learn from failure; current frontier systems show no clear improvement absent dedicated RL. In parallel, ByteDance Seed’s new EdgeBench drew strong attention for studying day-long horizons across 134 real-world environments, claiming that learning speed doubles every ~3 months and that gains are not explained by repeated sampling alone. This benchmark is quickly being treated as a serious complement to METR-style horizon work.

• Memory is being elevated from support module to trainable competence: The Stanford AutoMem paper got attention via Omar Sanseviero’s summary: memory management is treated as a skill, with models deciding what to store, retrieve, and reorganize; optimizing memory alone reportedly yields 2x–4x gains on Crafter, MiniHack, and NetHack. That idea rhymes with a more applied trend toward persistent personal and research memory systems: PaperWiki, PersonalOS, and OpenWiki all point to memory becoming part of the product surface.

• World models are shifting from static assets to adaptive online components: Reka released WorldModelGym, framing evaluation around decision-based fidelity across 100+ tracks. askalphaxiv’s summary of AdaJEPA pushed the stronger claim: pretrained world models should keep adapting at deployment time, with one gradient step per MPC cycle improving robustness under visual and dynamics shift.

Top tweets (by engagement)

• Anthropic access/capacity update: Trapit Bansal on Fable returning to subscriptions when capacity allows — the clearest signal that current scarcity is a capacity problem, not a permanent packaging decision.

• API/platform change with immediate operational impact: Claude API rate limits raised and tiers simplified.

• Model stack composition for coding: Mitchell Hashimoto’s planner/coder/judge workflow using Fable xhigh → GPT-5.5 xhigh → Fable xhigh, with planning/judging costing only a few dollars versus much pricier end-to-end loops.

• Specialized post-training beating frontier prompting: Aakash Gupta on Bridgewater + Thinking Machines, where a fine-tuned Qwen3-235B reached 84.7%, outperforming frontier prompted models on document filtering at ~1/14th the inference cost.

• Autonomous systems performance on low-level optimization: Elliot Arledge’s Fable-written megakernel result, arguably the most technically substantive coding-agent anecdote in the set.

• Video generation leadership change: Design Arena reported Gemini Omni Flash at #1 on Video Arena with 1404 Elo, a 101-point gap over Seedance 2.0 Mini and one of the larger observed jumps on that leaderboard.

AI Reddit Recap

/r/LocalLlama + /r/localLLM Recap

1. llama.cpp Long-Context and Qwen 3.6 Optimization

• llamacpp patch - DeepSeek V4 Flash running with full 1M token context locally on RTX 5090 (Activity: 374): A llama.cpp patch wires DeepSeek V4 Flash’s DSA/lightning indexer into the model graph and adds a CUDA kernel, enabling DeepSeek-V4-Flash GGUF to run locally with up to 1M context on an RTX 5090 instead of requiring ~256 GiB compute buffer VRAM. Reported results: at 256K context compute buffer drops from ~67 GiB/OOM to 3.2 GiB, prefill rises from 56 t/s to ~263 t/s, decode remains ~14 t/s; validated presets show 256K/512K/1M contexts at ~29/28/31 GiB peak VRAM, with 1M prefill ~159 t/s due to reduced ubatch. The author links source/build notes in the writeup and branch, based on upstream PR ggml-org/llama.cpp#24231, and reports basic needle-in-haystack correctness at 100K, 512K, and 1M. Comments were mostly positive about the feasibility of running DS4 Flash on a single RTX 5090; one technical follow-up asked for TTFT and/or end-to-end token generation timing (tg-end2end).

A commenter requested concrete latency metrics for the claimed local DeepSeek V4 Flash run on a single RTX 5090, specifically TTFT and tg-end2end, to validate usability at the advertised full 1M token context.

• Another technical concern was that the result "looks too good to be true" and should be submitted as patches to upstream llama.cpp for review, suggesting the implementation may need validation around correctness/performance before being trusted.

• One commenter referenced an ongoing llama.cpp lightning indexer fix and suggested porting it to Metal, implying the patch may currently be CUDA-focused and that Apple GPU support would require backend-specific adaptation.

• qwen3.6 27b q6 + 5090 maximum llamacpp optimization: 100-233tok/s, average 140 (Activity: 201): A user reports optimized Qwen 3.6 27B Q6_K + MTP inference on a RTX 5090 32GB / Ryzen 9800X3D / 64GB RAM system using a recent llama.cpp build (86b9470), achieving 100–233 tok/s over ~20h of agentic workloads with mean 140.7 tok/s and median 134.9 tok/s. The main technical issue addressed is llama.cpp prompt-cache invalidation for Qwen’s hybrid attention / sliding-window attention behavior—logs show “forcing full prompt re-processing due to lack of cache data” tied to llama.cpp PR discussion—which the user mitigates via two local patches: checkpoint-search fixes for hybrid/recurrent models and a minimal recurrent_shrink/expand prompt-cache API patch based on upstream PR #24785 (Dockerfile, diff). Their launch config uses Q8 KV cache, 192k context, ~32GB RAM cache, MTP speculative decoding with draft=10 and spec-draft-p-min=0.5, plus batch/ubatch=512 to fit within ~32036/32768 MB VRAM, noting 2048 would be preferable on a 5090 if memory allowed (launch command).

2. Gemma 4 Open Model Experiments and Benchmarks

• I extended Gemma4-31B to 44B (88 layers) — since Google won't give us anything bigger than 31B (Activity: 1287): The image is a technical infographic, not a meme: it diagrams the claimed architecture path from Gemma4-31B to ExtGemma4-44B via layer expansion—60 → 80 layers using identity-initialized insertions, then 80 → 88 layers by duplicating/inserting an 8-layer block—matching the author’s writeup on Hugging Face and the image. Its main technical significance is the use of identity initialization and a Gemma-specific layer_scalar = 1.0 fix to preserve initial behavior, with the author claiming the added full-attention layer trained and contributed more than sliding-window layers after fine-tuning on Korean legal/STEM data. Comments were mostly supportive but cautious: one commenter suggested benchmarking against RYS / “repeat yourself” layer duplication as a baseline, while others noted they lacked hardware to run it or joked about roleplay fine-tuning demand.

One commenter suggested benchmarking the 44B/88-layer extension against an RYS (“repeat yourself”) baseline, where sequential layers are duplicated to create a larger model. They framed RYS as a quick-and-dirty method to make an existing model “both bigger and better,” making it a useful control for evaluating whether the poster’s layer-extension strategy provides real gains beyond naive layer duplication.

• There was interest in downstream quantization experiments once community builds are available, though the commenter noted they lacked hardware to run the full model. Another commenter connected the approach to earlier “Frankenstein” enlarged models from the Llama 2 / Llama 3 era, implying prior community experimentation with stitched or expanded transformer architectures.

Talking with Gemma 4 31B! (Activity: 1006): Andi