AI Coding Live News

Nous Research opens the official Hermes Agent mobile beta: iOS via TestFlight, Android via Firebase, connecting your phone to your own gateway to approve tools and manage bots and routines

During NousCon 2026 in New York on Oct 30, Nous Research released an official mobile beta of Hermes Agent and put up a sign-up page at hermes-agent.nousresearch.com/mobile: iOS users join the "Hermes Agent - Mobile" beta through TestFlight, and Android users join through Firebase App Distribution. The TestFlight page says the app connects to your own Hermes gateway so you can chat with streaming, approve tool calls, and manage bots and routines from anywhere. Teknium, co-founder and lead engineer of Hermes Agent, confirmed on X that the iPhone and Android betas launched together. Nous has not announced a general release date or any benchmarks.

Key Takeaways

  • Entry point: the official page hermes-agent.nousresearch.com/mobile covers 2 platforms, iOS through TestFlight and Android through Firebase App Distribution
  • Positioning: the TestFlight description says the app connects to your own gateway for streaming chat, tool-call approval, and managing bots and routines; it is a client, not a separate agent running on the phone
  • Confirmation: Teknium, co-founder and lead engineer of Hermes Agent, confirmed in a reply on X that the iPhone and Android betas both launched on NousCon day
  • Watch for clones: several third-party Hermes phone clients already exist, so only use the links on the official page; Nous has not published a general release date or benchmarks
Read full story

FocusGUI: Focused Omni-Modal GUI Agents Slashing Sequential Distraction and Doubling Type Match to 64.2%

Researchers from Alibaba and collaborating academic institutions introduced FocusGUI in arXiv:2610.26203, establishing a focused attention architecture for streaming omni-modal GUI agents. Across streaming observations of continuous UI screenshots, synchronous audio, and device state histories, agents routinely suffer from 'Sequential Distraction'—where transient visual clutter from previous steps compounds into catastrophic action hallucination. FocusGUI preserves the base model while introducing action-sufficient projection and channel decomposition. Tested across 29 smartphone apps on OmniGUI, FocusGUI elevates Type Match from 31.0% to 64.2% and Exact Match from 11.2% to 33.5% across four omni-modal foundation backbones.

FocusGUI: Focused Omni-Modal GUI Agents Slashing Sequential Distraction and Doubling Type Match to 64.2%

Key Takeaways

  • FocusGUI introduced in arXiv:2610.26203 by Alibaba researchers, solving Sequential Distraction in streaming multimodal GUI automation
  • Integrates action-sufficient projection and channel decomposition to dynamically prune transient visual and audio clutter
  • On the OmniGUI benchmark (29 apps, 2,572 steps), doubles average Type Match from 31.0% to 64.2% and triples Exact Match to 33.5%
  • Readily enhances Qwen2.5-Omni, MiniCPM-o 4.5, VITA-1.5, and Baichuan-Omni without requiring end-to-end backbone retraining
Read full story
Linked Models & Agents:
⚡ Qwen2.5-Omni⚡ MiniCPM-o 4.5⚡ VITA-1.5⚡ Baichuan-Omni-1.5🤖 FocusGUI🌐 Alibaba

When Remote KV Cache Is Slower Than GPU Recompute: Sharded LMCache Cuts p99 from 83.32s to 0.67s on 8xB300, While Baidu VHA Halves KV Cache and Beats MLA

Addressing KV cache bottlenecks in long-context LLM serving, a new production study on 8xB300 nodes serving GLM-5.3 (arXiv:2610.21500) reveals that unsharded remote KV caches inflate hit-heavy p99 TTFT to 83.32s, and resolves it via rank-sharded asynchronous LMCache loading—boosting GET bandwidth 6.3x to 10.76 GB/s and slashing p99 to 0.67s (+34% throughput). Meanwhile, Baidu PaddlePaddle open-sources Virtual Head Attention (VHA, arXiv:2610.17959), folding linear Q-Premix and Postmix into standard GQA-2 weights at inference to halve KV cache while beating MLA (+0.70%) and GQA-4 (+2.60%) on a 30B-A3B MoE and lifting 8K-128K RULER from 73.0 to 84.4.

When Remote KV Cache Is Slower Than GPU Recompute: Sharded LMCache Cuts p99 from 83.32s to 0.67s on 8xB300, While Baidu VHA Halves KV Cache and Beats MLA

Key Takeaways

  • On 8xB300 nodes serving GLM-5.3 with PCP8, sharding LMCache across ranks and adding async loading boosts GET bandwidth 6.3x to 10.76 GB/s, cutting hit-heavy p99 TTFT from 83.32s to 0.67s (+34% throughput)
  • Baidu's Virtual Head Attention (VHA) folds linear Q-Premix and low-rank Postmix directly into W_Q and W_O at inference, reducing to a zero-overhead GQA-2 architecture with half to a quarter of the KV cache
  • On a 500B-token 30B-A3B MoE, VHA outperforms both MLA (+0.70%) and GQA-4 (+2.60%), and boosts 8K-128K RULER on a 10B-A1B MoE from 73.0 (GQA-4) to 84.4 using only 2 KV heads
Read full story
Linked Models & Agents:

Eliminating Off-Policy Bias in Asynchronous RLVR: Proximal KL Enables Token-Wise Importance Sampling, Beating GRPO on Qwen3 with Zero Training Collapse

Off-policy data in reinforcement learning with verifiable rewards (RLVR) causes severe policy gradient bias during asynchronous generation and response reuse. Researchers from UIUC and HKUST introduce Proximal KL, theoretically proving that full future KL credit renders the exact proximal optimizer the unique stationary policy without requiring full-response weights or fitted critics. Evaluated across Qwen3-1.7B and 4B models, Proximal KL outperforms GRPO on 8 math benchmarks by up to 2.58% while completely averting training collapse.

Eliminating Off-Policy Bias in Asynchronous RLVR: Proximal KL Enables Token-Wise Importance Sampling, Beating GRPO on Qwen3 with Zero Training Collapse

Key Takeaways

  • Theoretical breakthrough for off-policy gradient bias: proves full future KL credit guarantees a unique stationary policy, decoupling reference and sampling policies without sequence-level variance explosion
  • Decisive outperformance over GRPO: yields up to +2.58% micro-averaged accuracy gains across 8 mathematics benchmarks on Qwen3-1.7B and 4B, sharply improving AIME24 pass@16
  • Eliminates training collapses during off-policy refresh: permanently avoids catastrophic policy degradation seen in standard PG and CISPO, reaching peak accuracy with fewer update steps
Read full story
ADSponsored

Hermes Agent v0.22.0: keyless guided onboarding, one-click local llama.cpp models, Gmail/Linear/Notion connectors and a 600-plugin catalog

Nous Research shipped Hermes Agent v0.22.0, "The Threshold Release", on Oct 14 (UTC). Fresh desktop installs open a guided setup chat on a free trial model (nous/welcome) with no API key, connectors reach Gmail, Linear and Notion through the Nous tool gateway, a one-click llama.cpp runtime runs local models, installs now follow tested SemVer stable releases, and desktop builds are signed (including the Microsoft Store). The source tree shrank from about 1.06M to 698K lines (−34%).

Hermes Agent v0.22.0: keyless guided onboarding, one-click local llama.cpp models, Gmail/Linear/Notion connectors and a 600-plugin catalog

Key Takeaways

  • Scale since v0.21.0: ~24,200 commits, ~6,080 merged PRs, ~7,180 issues closed, ~2,520 contributors, about 2.5x the v0.21.0 cycle
  • Leaner: source went from ~1.06M to 698K lines (−34%); gateway/run.py from 34,847 to 5,512 lines; ~19 rarely used tools now load on demand, roughly halving the desktop tool schema, and ~2.1k tokens came off the fixed prompt
  • Local models: installs llama.cpp b11370 for CPU/CUDA/Metal/Vulkan/ROCm, recommends only models that fit fully in GPU memory; catalog includes Qwen3.8 27B, Qwen3.6 35B-A3B, DeepSeek V4 Flash and any Hugging Face GGUF
  • 600-plugin catalog, each pinned to a reviewed commit; memory providers (Honcho, Mem0, Supermemory and others) moved out of core
  • Faster updates that rebuild only what changed: 16.5 s vs 32.5 s on macOS (vendor figure)
Read full story

GitSwarm Unveils Decentralized Compounding Inference: Multi-Agent Collaboration via Git Branching and Atomic Commits

Tackling long-horizon problem solving and scientific discovery requires computation to compound across successive attempts. While humans build upon partial proofs, failed experiments, and prior hypotheses, current test-time compute paradigms (e.g., MCTS and Best-of-N) isolate search trajectories into independent silos, discarding intermediate reasoning artifacts upon branch failure. Researchers introduce compounding inference and its open-source instantiation GitSwarm (arXiv:2610.04862). GitSwarm establishes an asynchronous multi-agent coordination architecture where homogeneous LLM agents collaborate through structured persistent memory hosted in a shared, branchable Git repository. Intermediate artifacts are preserved as atomic commits, while explicit semantic dependencies link cross-branch contributions, enabling agents to inspect, branch, verify, and synthesize past discoveries. Evaluated on rigorous long-horizon benchmarks, GitSwarm paired with GPT-5.5 solves all 30 problems on IMOProofBench-Advanced in a single execution run, and scores 79.4% on ProgramBench compared to 65.1% for the strongest reported baseline under identical budgets.

Key Takeaways

  • Introduces Compounding Inference and GitSwarm, converting transient test-time compute into persistent knowledge assets
  • Employs Git repositories as multi-agent memory, tracking atomic commits, semantic dependencies, and cross-branch merges
  • Solves 100% of IMOProofBench-Advanced problems with GPT-5.5 in a single run and achieves 79.4% on ProgramBench
Read full story
Linked Models & Agents:

RunningTab: KAIST Overcomes Coding Agent Context Drift via Environment-Side Tabs for Direct Workspace Interaction

In software engineering and knowledge-work tasks, autonomous coding agents operate via Direct Workspace Interaction (DWI)—issuing shell commands to navigate, inspect, and modify files within local repositories without external vector indexing. However, during extended interaction horizons, agents suffer severe context degradation: initial task requirements are purged from context windows by voluminous file dumps, read file provenances vanish, and listed but unopened candidate files are permanently forgotten, leading to premature task terminations and unfulfilled requirements. Researchers from KAIST introduce RunningTab (arXiv:2610.10444), an innovative agent interaction framework that replaces unreliable internal agent scratchpads with an environment-maintained 'running tab'. The tab persists three critical streams: dynamic requirement trackers, verified file excerpts with provenance links, and unopened candidate file stacks. When an agent attempts to finalize a deliverable, the environment triggers a mandatory 'Finish Check' barrier that blocks completion if unsatisfied criteria persist. Evaluated across Workspace-Bench, TheAgentCompany, and OfficeQA Pro benchmarks using frontier LLMs, RunningTab decisively outperforms vanilla DWI and self-refine baselines, establishing substantial gains in rubric satisfaction (TCR@70).

RunningTab: KAIST Overcomes Coding Agent Context Drift via Environment-Side Tabs for Direct Workspace Interaction

Key Takeaways

  • KAIST introduces RunningTab, pioneering environment-side tabs to eliminate long-horizon context drift in coding agents
  • Tracks Requirements, Provenances, and Candidate files externally, reinforced with a strict Finish Check barrier
  • Sweeps Workspace-Bench and TheAgentCompany, elevating TCR@70 to 25.67 and proving the superiority of environment-managed memory
Read full story
Linked Models & Agents:
⚡ RunningTab⚡ Direct Workspace Interaction⚡ Workspace-Bench🤖 RunningTab-Agent🤖 Finish-Checker🌐 KAIST🌐 Hugging Face🌐 TheAgentCompany

TokenRouter: Tsinghua Unveils NeurIPS 2026 Serving System for Token-Level LLM Routing, Boosting Throughput by up to 64x

Token-level LLM routing—routing easy tokens to small models and switching to frontier models for critical reasoning tokens—presents an optimal trade-off between output quality and inference cost. However, current LLM serving engines (such as vLLM and TGI) are architected for single-model execution, suffering severe step desynchronization, batch admission latency, and extreme orchestration complexity when handling high-frequency token transfers across heterogeneous models. Researchers from Tsinghua University's NICS Lab present TokenRouter (arXiv:2610.12242, accepted at NeurIPS 2026, code: github.com/thu-nics/TokenRouter), an efficient and developer-friendly serving system engineered for token-level routed LLM inference. TokenRouter introduces a 'request-centric programming and model-centric execution' paradigm, enabling developers to write routing logic intuitively per request while the runtime handles asynchronous execution across subservers. Incorporating a Delayed-Batching Scheduler parameterized via discrete-time Markov chain modeling, a decoupled tri-loop architecture, and an instant handoff-resume mechanism, TokenRouter achieves 2.01x to 64.15x higher decoding throughput compared to existing serving platforms across diverse routing workloads, with complete code open-sourced.

TokenRouter: Tsinghua Unveils NeurIPS 2026 Serving System for Token-Level LLM Routing, Boosting Throughput by up to 64x

Key Takeaways

  • Tsinghua University open-sources TokenRouter (NeurIPS 2026), an optimized serving architecture for token-level LLM routing
  • Introduces request-centric programming and a delayed-batching scheduler, delivering 2.01x to 64.15x higher decoding throughput
  • Decoupled tri-loop execution cuts P99 inter-token latency by 43.6%, reducing enterprise cloud GPU costs by 50% to 70%
Read full story
Linked Models & Agents:

Xiaomi Unveils MiMo-V2.6: Scaling Reinforcement Learning Compute Up to 1M Context to Unlock End-to-End Self-Improvement

Reinforcement learning (RL) has emerged as the defining post-training paradigm driving frontier foundation models toward autonomous self-improvement, yet scaling RL across multi-step agent environments and million-token sequences introduces profound stability and infrastructure hurdles. Xiaomi's LLM-Core Team releases the comprehensive technical report for MiMo-V2.6 (arXiv:2610.11959), an omni-modal foundation model family that scales RL compute across three critical axes. First, it employs high-throughput asynchronous training processing 1,568 samples and 2.7 to 3.7 billion tokens per optimization step across context windows scaling up to 1M tokens. Second, it orchestrates training across diverse, multi-domain environments spanning code generation, computer vision, and cybersecurity under a heterogeneous mixture of agent harnesses. Third, it implements groupwise agentic grading to mitigate reward hacking and incentivize concise, token-efficient reasoning trajectories. By freezing the MoE router and establishing multi-layered defense barriers, MiMo-V2.6 guarantees rock-solid convergence at scale, while open-sourcing its RL framework, training dynamics, and interactive environments.

Key Takeaways

  • Xiaomi releases MiMo-V2.6, scaling reinforcement learning compute across 1,568 samples, 3.7B tokens per step, and up to 1M context
  • Introduces groupwise agentic grading to curb reward hacking and compress trajectory token lengths by over 35%
  • Freezes MoE routers to eliminate routing collapse and open-sources the complete RL post-training infrastructure
Read full story
Linked Models & Agents:

Nous Research raises $90M Series B at $1.5B to take MIT-licensed Hermes Agent into businesses

On Oct 7 Nous Research, maker of the open-source Hermes Agent, confirmed a $90M Series B at a $1.5B valuation led by Robot Ventures, with NVIDIA, Microsoft's M12, Samsung, USV, Y Combinator and Menlo among backers, bringing total funding to $158M. Nous says Hermes Agent has been cloned over 24M times and drives about 2.5% of global token usage (internal estimate). The money funds Hermes for Businesses: a team tier with shared balance and skill library, and an Enterprise edition on customer-controlled infrastructure with SSO and SLAs, plus a mobile app.

Nous Research raises $90M Series B at $1.5B to take MIT-licensed Hermes Agent into businesses

Key Takeaways

  • Round: $90M Series B at $1.5B, led by Robot Ventures; $158M raised in total (TechCrunch)
  • Scale: Hermes Agent cloned 24M+ times, ~2.5% of global token usage per Nous's internal estimate (Nous note)
  • GitHub: NousResearch/hermes-agent has ~252K stars and ~54K forks, MIT, latest release v2026.9.24 (GitHub, checked 2026-10-08)
  • Revenue: ~$36M annualized by mid-September, targeting $100M+ by year-end, per WSJ
  • Business tier: shared balance, per-member caps, team skill library; Enterprise runs on customer infrastructure with SSO and SLAs (Hermes Business)
Read full story
ADSponsored

Foundations of Proactive Agents: 3T Principles and Proactivity-Gym Benchmark Reveal Trust Erosion from Uncalibrated Interventions

Contemporary LLM agents operate overwhelmingly in a reactive posture, awakening only when commanded by explicit user prompts. As continuous ambient compute becomes cost-effective, proactive agents that exploit idle cycles to anticipate needs and execute support before users ask represent the next frontier of intelligent personal assistants. However, proactivity is a double-edged sword: even flawlessly completed autonomous tasks can disrupt user focus, impose heavy cognitive verification overhead, and destroy human trust if initiated at misaligned moments. Researchers from KAIST and the University of Minnesota establish foundational theory for proactive agents in arXiv:2609.37267, framing design around three joint principles (3T): Task Capability, Temporal Allocation (aligning compute with cognitive availability), and Trust. They introduce PROACTIVITY-GYM, a stateful multi-day evaluation testbed with persona-conditioned simulated users. Evaluating 23 model-harness configurations alongside a 30-participant human study, the authors show that poorly timed interventions trigger severe trust collapse despite perfect task outcomes, whereas asynchronous assistance during user downtime (e.g., sleep-time compute) preserves deep user engagement.

Key Takeaways

  • Establishes foundational theory for proactive agents around joint 3T principles: Task Capability, Temporal Allocation, and Trust
  • Releases PROACTIVITY-GYM, a stateful multi-day evaluation testbed featuring persona-conditioned simulated users across continuous scenarios
  • A 30-participant human study demonstrates that untimely interventions cause severe trust collapse despite correct outputs, validating sleep-time assistance as the optimal interaction paradigm
Read full story

MotorMind Harness Scaffolds General Vision-Language Models for Zero-Shot Robotic Manipulation with 95% Real-World Success

Autonomous robot manipulation has long relied on specialized vision-language-action (VLA) models whose rigid training precludes zero-shot adaptation to novel environments, cutting them off from rapid foundation VLM advancements. Conversely, recent robotic agents rely heavily on fragile coding agents and auxiliary grounding models like SAM3, introducing severe latency and operational brittleness. Researchers from UIUC and CMU present MotorMind (arXiv:2609.38078), a direct robotic harness connecting general-purpose VLMs to deterministic robot control. By translating VLM mid-level actions into deterministic Cartesian primitives paired with asynchronous execution monitoring and background memory updates, MotorMind achieves 66.7% zero-shot success on LIBERO-PRO suites (versus 13.3% for prior baselines) and achieves 95% average success on a physical xArm6 robot under live human disturbances.

MotorMind Harness Scaffolds General Vision-Language Models for Zero-Shot Robotic Manipulation with 95% Real-World Success

Key Takeaways

  • Empowers general-purpose foundation VLMs to perform zero-shot robot manipulation without specialized VLA training or SAM3
  • Introduces mid-level action scaffolding paired with asynchronous monitoring for adaptive human-like disturbance recovery
  • Surges LIBERO-PRO benchmark success from 13.3% to 66.7% and achieves 95% success on a physical xArm6 robotic manipulator
Read full story

Disaggregated Quantization: Specializing LLM Prefill and Decode via DQ and Offloaded Prefill for 1.78x TTFT Acceleration

Large language model serving exhibits bifurcated hardware constraints: prefill is compute-bound, benefiting from high-throughput low-precision tensor operations (e.g., NVFP4), while decode is memory-bandwidth-bound, requiring ultra-compact weight storage (e.g., 2-3 bit weight-only) to minimize token-generation memory traffic. Uniform quantization forces suboptimal compromises across both phases. Researchers from IST Austria introduce Disaggregated Quantization (DQ, arXiv:2609.26333), decoupling computation formats, quantization precision, and physical memory placement across prefill and decode. Paired with Offloaded Disaggregated Prefill (ODP) to stream NVFP4 prefill weights asynchronously from NVMe SSDs, DQ delivers a 1.78x time-to-first-token (TTFT) speedup on Qwen3.8-27B at 8K prompt length within llama.cpp, while supporting disaggregated serving in vLLM on architectures up to 2.8T parameters.

Disaggregated Quantization: Specializing LLM Prefill and Decode via DQ and Offloaded Prefill for 1.78x TTFT Acceleration

Key Takeaways

  • Pioneers Disaggregated Quantization (DQ) to specialize precision formats independently for compute-bound prefill and bandwidth-bound decode
  • Introduces Offloaded Disaggregated Prefill (ODP), streaming NVFP4 weights from SSD to slash 8K prompt TTFT by 1.78x in llama.cpp
  • Boosts MMLU-Pro by 32.5 points and MMMU-Pro by 35.3 points on compact 2-3 bit decode checkpoints, scaling to 2.8T architectures
Read full story

LLMs are General Asynchronous Agents: Non-Blocking Coroutine Runtimes Enable Concurrent Execution on Qwen 3.x Without Retraining

Mainstream LLM agents strictly follow sequential interaction loops: read, think, reply, call tools, and block until completion. Real-world applications—including full-duplex voice assistants, robotic manipulation, and continuous infrastructure monitoring—are inherently asynchronous, receiving incoming observations while the agent is actively deliberating or waiting on tool I/O. Researchers introduce a general asynchronous LLM framework that abstracts model inference into non-blocking coroutines with overlapping memory states. Without requiring task-specific fine-tuning or architectural alterations, foundation models like Qwen 3.x exhibit native asynchronous competency, effortlessly handling live video feeds, real-time gaming, and continuous systems monitoring.

LLMs are General Asynchronous Agents: Non-Blocking Coroutine Runtimes Enable Concurrent Execution on Qwen 3.x Without Retraining

Key Takeaways

  • Transition from Sequential Blocking to Asynchronous Coroutines: Establishes an inference runtime treating LLM reasoning as concurrent coroutines with overlapping memory states, breaking sequential execution limits.
  • Zero-Finetuning Asynchronous Competency: Empirical evaluations demonstrate that off-the-shelf Qwen 3.x models natively handle concurrent state synchronization and interrupts without bespoke fine-tuning.
  • Versatile Streaming & Real-Time Performance: Proves robust non-blocking adaptability across live video analysis, real-time game control, and concurrent infrastructure monitoring.
Read full story

Continuous Depth Batching (CDB): Unlocking Depth-Adaptive Inference for Looped Language Models with 99% Speedup Realization

While looped language models enable depth-adaptive inference by executing fewer layer repetitions on easy tokens and more on complex tokens, variable loop counts break conventional batching engines like vLLM. Researchers from TUM and Imperial College introduced Continuous Depth Batching (CDB). By dynamically reorganizing batches between loop iterations, orchestrating looped KV-caches, and asynchronously predicting token exits, CDB achieves up to 99% of the theoretical maximum inference speedup across Ouro 1.4B and Huginn 3.5B architectures.

Continuous Depth Batching (CDB): Unlocking Depth-Adaptive Inference for Looped Language Models with 99% Speedup Realization

Key Takeaways

  • Resolving the Looped Batching Impasse: Depth-adaptive inference allows tokens to exit recurrent transformer layers early, but differing loop counts prevent uniform forward passes in engines like vLLM; CDB introduces inter-step batch reformation.
  • Asynchronous Exit Prediction & Looped KV Cache: Integrates a dynamic scheduler between recurrent blocks that manages recurrent KV-cache states and asynchronously prepares future batches based on exit-likelihood estimates.
  • 99% Theoretical Limit Realized: Validated on Ouro 1.4B and Huginn 3.5B, CDB achieves up to 99% of the upper-bound theoretical speedup, clearing the path for production deployment of adaptive-depth architectures.
Read full story
Linked Models & Agents: