AI Coding Live News

LM Studio Bionic 1.1.10 adds the oMLX engine, bringing RAM-plus-SSD KV caching and MLX speculative decoding to local models on Macs

LM Studio posted on X at 15:32 UTC on Oct 29 that users can now download a new oMLX engine inside LM Studio and run it with MLX models they already have. The official changelog lists it in Bionic 1.1.10, alongside speculative decoding for MLX models and an in-app terminal. oMLX is an open-source Apple Silicon inference server maintained by developer jundot (Apache 2.0, about 23,000 GitHub stars) built around continuous batching and a two-tier RAM and SSD KV cache. LM Studio has not published speed comparisons for the engine.

LM Studio Bionic 1.1.10 adds the oMLX engine, bringing RAM-plus-SSD KV caching and MLX speculative decoding to local models on Macs

Key Takeaways

  • LM Studio says the oMLX engine can now be downloaded inside the app and used with existing MLX models; the post has about 540 likes (post)
  • The Bionic 1.1.10 changelog (Oct 29) also lists speculative decoding for MLX models, a public in-app terminal and llama.cpp 2.66.0 extension packs (changelog)
  • oMLX is Apache 2.0 open source with about 23,000 GitHub stars and needs macOS 15+ on Apple Silicon M1 to M5 (GitHub)
  • Its core is a two-tier KV cache: hot blocks stay in RAM, overflow is written to SSD as safetensors, and matching prefixes are restored from disk even after a restart
  • LM Studio has published no speed comparison with its existing MLX engine; one user reported that restart-to-update failed after launch and LM Studio is investigating
Read full story

Anthropic details Claude self-assessment for misuse detection: 78% recall at 1% false positives for under 2% extra compute

On Oct 29 Anthropic introduced self-assessment on X: after each response, Claude produces a structured preliminary safety assessment of the whole conversation for offline review. Anthropic's Safeguards blog says that on Claude Fable 5, at a 1% false-positive rate, it flags 78% of the conversations a stronger prompted classifier flags and 94% of high-priority ones. Because the conversation is already in the KV cache, it adds about 10 output tokens on average and an estimated under 2% of inference compute. It has run in production since June, but Anthropic says it is not robust against an attacker who targets it directly and is only one layer of defense in depth.

Anthropic details Claude self-assessment for misuse detection: 78% recall at 1% false positives for under 2% extra compute

Key Takeaways

  • On Claude Fable 5, at a 1% false-positive rate it recalls 78% of what the prompted classifier flags and 94% of high-priority (7+) conversations (vendor figures, Safeguards blog)
  • It reuses the KV cache, adding about 10 output tokens per assessment on average; Anthropic estimates under 2% extra inference compute and does not bill customers for it
  • Across four model sizes, recall at 1% false positives rises from about 16% to about 96% and AUC from 0.862 to 0.995
  • As a real-time blocker it is weak: attack success on 24 cyber tasks only drops from 79% to 54%, versus 25% with a prompted classifier
  • In August it raised over 100k child sexual abuse flags from a single API customer, reported to NCMEC; about a third of flags fall outside the existing taxonomy
Read full story
Linked Models & Agents:

Cloudflare discloses a cross-request KV cache leak in GLM-5.3 on Workers AI: a config mismatch plus an SGLang bug let 155 responses carry other users' data over 13 days

In an Oct 26 incident report on its blog, Cloudflare said that between Aug 27 and Sep 9, 155 responses from GLM-5.3 on Workers AI (@cf/zai-org/glm-5.3) to prompts longer than 681,280 tokens contained data from other customers' recent requests, all returned with HTTP 200. The cause was a prefill KV cache pool smaller than the 1,048,576-token context window, combined with an SGLang bug in disaggregated prefill/decode mode. Cloudflare found no evidence of deliberate exploitation, has fixed it, and recommends operators upgrade to SGLang v0.5.22 or later.

Cloudflare discloses a cross-request KV cache leak in GLM-5.3 on Workers AI: a config mismatch plus an SGLang bug let 155 responses carry other users' data over 13 days

Key Takeaways

  • Scope: 155 responses between 2026-08-27 and 09-09, all to prompts over 681,280 tokens; Cloudflare confirmed no other Workers AI model was affected
  • Cause 1: GLM-5.3 advertised a 1,048,576-token context but the prefill KV pool held only 681,280 tokens; after the fix the pool holds about 2.04 million tokens, roughly twice the context
  • Cause 2: SGLang marked over-length requests as rejected and swapped in a one-token placeholder without aborting, so the decode node read stale cache pages from earlier requests
  • Response: report from Gadi Evron of Knostic via HackerOne on Sep 8; model taken offline within 40 minutes of declaring the incident on Sep 9 and restored at 19:40 UTC that day
  • Action: teams running SGLang should upgrade to v0.5.22 or later and check KV pool size against context length directly
Read full story
Linked Models & Agents:
⚡ Z.ai GLM 5.3🌐 cloudflare🌐 zai

MemT-1.0: Towards Memory-Native Evolution Slashing 128K KV Footprint by 66x with Gated DeltaNet-2

Researchers introduced MemT-1.0 (arXiv:2610.26825), a groundbreaking architecture internalizing memory as an intrinsic component of foundation model computation. Moving beyond exploding KV caches and lossy Vector RAG pipelines, MemT-1.0 employs Gated DeltaNet-2 with stable within-turn token-level updates alongside a novel Mixture-of-Storage mechanism. Trained across a two-stage 34B-token pipeline, the released MemT-1.0-Nano model achieves a 1.86x end-to-end inference speedup and a staggering 66x reduction in persistent storage at 128K tokens relative to full-context KV caching, dramatically elevating procedural task execution in autonomous agents.

MemT-1.0: Towards Memory-Native Evolution Slashing 128K KV Footprint by 66x with Gated DeltaNet-2

Key Takeaways

  • MemT-1.0 introduced on arXiv:2610.26825, pioneering memory-native evolution by internalizing memory directly into model computation
  • Combines Gated DeltaNet-2 with stable token-level memory updates and Mixture-of-Storage to scale memory capacity intrinsically
  • At 128K context length, delivers a 1.86x inference speedup and slashes persistent storage by 66x compared to standard KV cache
  • Internalizes procedural operational experience, significantly improving agentic multi-turn task success rates
Read full story
Linked Models & Agents:
⚡ MemT-1.0-Nano⚡ MemT-1.0-Flash
ADSponsored

DeepSeek open-sources DeepInfer, the inference framework behind its V4.1-Flash production service, with speculative decoding, batch-invariant inference and structured outputs, plus the deepseek-recipe API encoding library

On Oct 20 (UTC) DeepSeek open-sourced DeepInfer (Apache 2.0), the in-house inference stack that serves DeepSeek-V4.1-Flash at scale. The release covers offline inference with Attention DP/CP and MoE EP+EPLB parallelism, DSpark speculative decoding, SWA bounded replay, batch-invariant inference, deterministic sampling and structured outputs on NVIDIA SM100 GPUs and Huawei Ascend 950 NPUs. The KV cache system, prefill/decode disaggregation and load balancing are not included. DeepSeek also released deepseek-recipe (MIT), which converts Chat Completions, Messages and Responses requests and encodes them the same way the official API does.

DeepSeek open-sources DeepInfer, the inference framework behind its V4.1-Flash production service, with speculative decoding, batch-invariant inference and structured outputs, plus the deepseek-recipe API encoding library

Key Takeaways

  • DeepInfer is Apache 2.0 and, per DeepSeek, is the framework serving DeepSeek-V4.1-Flash in production; it currently supports only that model
  • Hardware is limited to NVIDIA SM100 (Blackwell) GPUs and Huawei Ascend 950 NPUs; the official Pareto curves were measured on 4 GPUs for prefill and 64 for decode
  • The open release omits the KV cache system, VE/prefill/decode disaggregation and cross-replica load balancing, so it is not a full serving stack yet
  • DeepSeek's reference V4.1 scores (Pass@1, vendor-reported): AIME 2026 99.9%, GPQA Diamond 93.4%, HLE-Full 42.6%, meant as a deployment sanity check
  • deepseek-recipe (MIT, Rust with Python bindings) handles Chat Completions/Messages/Responses conversion and token encoding/decoding
Read full story
Linked Models & Agents:
⚡ DeepSeek-V4.1-Flash-1017🌐 DeepSeek🌐 NVIDIA🌐 Huawei

vLLM v0.32.0: 814 commits, built-in /v1/systemone structured-decision endpoint, NVFP4 KV cache on more GPUs, and 43–85% more req/s with multiple API workers

vLLM shipped v0.32.0 on Oct 18 with 814 commits from 363 contributors (121 new). Highlights: a default-served POST /v1/systemone structured-decision endpoint and a generic hf tool/reasoning parser; NVFP4 KV cache on SM8x/SM90/SM12x and FP8 KV by default for GLM-5.x on SM100; Model Runner V2 gains a GPU n-gram speculator and Elastic EP and becomes the ROCm default; three security advisories are fixed, default CORS is restricted, and Python 3.10 is dropped.

vLLM v0.32.0: 814 commits, built-in /v1/systemone structured-decision endpoint, NVFP4 KV cache on more GPUs, and 43–85% more req/s with multiple API workers

Key Takeaways

  • Scale: 814 commits from 363 contributors (121 new); see the release notes.
  • Structured decisions: POST /v1/systemone is new and served by default for choice/score questions, including Cloudflare/clef-omni and LiquidAI/d1-3B; --tool-call-parser hf reads a checkpoint's response_template so no model-specific parser is needed.
  • Low-precision KV: GLM-5.x defaults to FP8 KV on SM100, halving KV memory per rank with 2.3–5.5% more throughput at a 7–11% TTFT cost (PR benchmark, vendor figures); ROCm adds a 4-bit KV cache at about 2x FP8 density.
  • Serving: with --api-server-count above 1, connections go to the least-loaded worker for 43–85% more req/s on short requests (Qwen3-0.6B, 32 in / 1 out tokens, PR benchmark).
  • Breaking: Python 3.10 dropped, default CORS origins restricted, cascade attention removed, and max_tokens is no longer reserved from the context window.
Read full story

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:

Periscope: Extending Frozen LLMs Beyond Context Windows via Training-Free Grid Factorization (4.5M Tokens on a Single 80GB GPU)

Standard language models read long texts through quadratic attention passes that bound context windows, deplete GPU memory, and suffer from length-induced accuracy degradation. Researchers from the Technology Innovation Institute (TII) introduce Periscope (arXiv:2610.04047), a training-free inference methodology that factorizes context reading across a 2D grid. Observing that long-context reasoning over discrete decision spaces is fundamentally an evidence-localization task, Periscope arranges N text chunks onto a K x K grid (where K = ceil(sqrt(N))). It probes a frozen LLM with K consecutive local spans and K strided spans across the document, scoring single-token log-odds to generate a comprehensive evidence map whose peak pinpoints the exact answer chunk. For a context of length s and chunk size c, a window W scales to W^2 / c tokens at s^1.5 cost. As each forward probe caches only a single span, a 27B model processes 4.5M tokens on a single 80GB GPU—whereas a conventional pass would demand 296GB of KV cache. On InfiniteBench, Periscope outperforms the best full-window reads by 5 points while dominating long-document retrieval benchmarks.

Key Takeaways

  • Introduces training-free Periscope algorithm factorizing N chunks onto a K x K grid to scale physical window W to W^2 / c equivalent tokens
  • Synthesizes evidence maps via local and strided log-odds, enabling a 27B model to digest 4.5M tokens on a single 80GB GPU vs 296GB KV cache
  • Outperforms full-window reads on InfiniteBench by 5.2 points, matching 1M window benchmarks on LongBench v2 reading only 9k top-ranked tokens
Read full story

The Extender: Log-Structured Transformer Architecture Slashes Persistent Attention KV Memory Footprint by 104x

Standard Transformers route layer communication exclusively via the residual stream h—a superposition channel—forcing every attention layer to project and maintain massive independent key-value caches that scale memory consumption at 2 * L * d_model. Researcher Jakob Eriksson introduces The Extender (arXiv:2609.32759), a log-structured alternative to standard Transformers. The Extender complements the residual superposition channel h with an explicit concatenation channel x. Each layer l emits a standard residual update delta_l to h and appends a minimal extension vector epsilon_l to x (e.g., |epsilon_l| = 32). While FFNs and Query projections attend to h, Key and Value projections take exclusively the cumulative concatenation channel x as input. This structural decoupling slashes persistent attention memory from 2 * L * d_model to sum |epsilon_l|. For a 924M-parameter model with hidden width 1664, The Extender compresses persistent attention memory by 104x relative to Multi-Head Attention (MHA), matching baseline accuracy on short-context CORE benchmarks and outperforming standard Transformers on long-context RULER evaluations.

The Extender: Log-Structured Transformer Architecture Slashes Persistent Attention KV Memory Footprint by 104x

Key Takeaways

  • Introduces The Extender, adding an explicit concatenation channel x to decouple residual streams from KV projections
  • Confines KV inputs strictly to concatenation channels, shrinking persistent attention memory from 2 * L * d_model to sum |epsilon_l|
  • Slashes attention memory by 104x on 924M models while matching short-context CORE and beating MHA on long-context RULER
Read full story

Reka releases Rho-1 research preview: a 19B omni-reasoning model trained from scratch that understands and generates text, images and video and emits robot actions in one network

On Oct 5 Reka Labs released a research preview of Rho-1, a 19B omni-reasoning model trained from scratch that unifies text, image, video and robot-action tokens in one network and one KV cache, with no tool calls or second model. Each transformer block has an understanding stream and a generation stream with shared attention, trained jointly with next-token prediction and flow matching. Reka reports base video generation at 0.79x real time (median) and a distilled 8-step variant (vs 99) returning a 5.3s clip in about a second. The checkpoint was trained on 320 H100s for three months. Research preview only; no public weights.

Reka releases Rho-1 research preview: a 19B omni-reasoning model trained from scratch that understands and generates text, images and video and emits robot actions in one network

Key Takeaways

  • Scale: 19B parameters trained from scratch on just 320 H100s for three months
  • Speed: base video at 0.79x real time (median), ~6s to a watchable stream; distilled 99→8 denoising steps returns a 5.3s clip in ~1s
  • Architecture: dual expert streams (understanding/generation) per block with shared attention and one KV cache; next-token + flow-matching objectives
  • Limits: native video capped at 672x384; long-horizon drift, temporal grounding and edit stability are admitted weak points
  • Access: research preview only, no open weights or public API; partnerships via [email protected]
Read full story
Linked Models & Agents:
⚡ Rho 1🌐 reka
ADSponsored

CacheBack: Receiver-Conditioned Latent Communication Slashes Multi-Agent KV Cache by Up to 94% with 3.2x Lower Latency

Multi-agent systems solving long-context distributed tasks face a fundamental trade-off: textual communication is compact but introduces autoregressive decoding latency and token-level information loss, whereas latent communication transferring raw KV caches avoids token generation but causes explosive linear memory scaling across agents and context tokens. Researchers from Columbia University introduce CacheBack (arXiv:2609.32046), a robust, training-free realization of receiver-conditioned communication. The receiving agent transmits a concise description of its information requirements, which acts as a dynamic mask on the sender's attention weights to filter and compress the KV cache. Benchmarked on FanOutQA with Qwen 3, CacheBack prunes 75% to 94% of redundant cache states, boosts task accuracy by 14.7 percentage points, and slashes median completion latency by 3.2x compared to text messages across dense, Mamba-hybrid, and sliding-window architectures.

CacheBack: Receiver-Conditioned Latent Communication Slashes Multi-Agent KV Cache by Up to 94% with 3.2x Lower Latency

Key Takeaways

  • Pioneers receiver-conditioned latent communication in CacheBack, overcoming linear KV cache scaling in multi-agent systems
  • Training-free architecture filters 75% to 94% of redundant cache states using attention weights conditioned on receiver needs
  • Lifts FanOutQA multi-hop accuracy by 14.7 percentage points and slashes median task latency by 3.2x over text messaging
Read full story

JevSpawn Accelerates Agentic Inference: Compositional Action Spaces Bridge Language Instructions with Probabilistic Speed

Conventional LLM agents emit reasoning thoughts and actions token-by-token, making extended interactions slow and compute-heavy. While Jev-style probabilistic models deliver rapid predictions over finite action domains, they mandate pre-specified, static fields, precluding autonomous adaptation in open-ended language tasks. Shanghai Jiao Tong University researchers introduce JevSpawn, a compositional policy framework bridging natural language instructions with finite probabilistic exploration. JevSpawn couples parallel action spawning with feedback-driven branch selection, representation revision, and recovery from cached alternatives. By sharing prefix KV caches and action structures, JevSpawn eliminates repeated context generation without model training, systematically outperforming seven leading agent baselines across eight benchmarks.

JevSpawn Accelerates Agentic Inference: Compositional Action Spaces Bridge Language Instructions with Probabilistic Speed

Key Takeaways

  • Bridges open-ended natural language task specifications with rapid finite-field exploration via JevSpawn
  • Reduces per-turn decision generation latency by over 45% via parallel action spawning and shared KV caching
  • Completely training-free, systematically outperforming seven prominent agent baselines across eight benchmarks
Read full story

Periodic Weak Spots: Phase Sensitivity in Chunked KV-Cache Compression Causes 40% Accuracy Swings

Chunked KV-cache compression reduces the memory and computational footprints of long-context LLMs by condensing contiguous token windows into fewer cache entries at fixed strides. Researchers from Stanford and Renmin University uncover an intrinsic vulnerability: chunking introduces a new relative positional coordinate—a token's phase relative to compression-window boundaries. The study reveals systematic 'phase sensitivity,' where retrieval accuracy for identical facts varies by up to 40 percentage points depending solely on input token phase alignments. Pretraining transformers across various KV compression configurations and conducting causal interventions, the authors demonstrate that standard aggregate benchmark scores mask recurrent blind spots, establishing a new evaluation standard for long-context compression.

Periodic Weak Spots: Phase Sensitivity in Chunked KV-Cache Compression Causes 40% Accuracy Swings

Key Takeaways

  • Discovery of Phase Sensitivity in Chunked KV Cache: Proves that token position relative to compression-window boundaries induces periodic accuracy fluctuations, swinging retrieval rates by up to 40%.
  • Aggregate Benchmarks Conceal Systematic Blind Spots: Conventional needle-in-a-haystack metrics average away severe periodic retrieval drop-offs, misleading production deployments.
  • Causal Evidence of Attention Phase Specialization: Pretraining transformers across compression topologies reveals that gradient dynamics force attention heads to specialize asymmetrically across input phases.
Read full story

PrismQuant: Optimal Null-Space Rotations for Grouped Quantizers Slashes Peak Memory by 56% with Only 0.22% Drop on 70B Models

Deploying 70B+ LLMs under tight memory constraints necessitates extreme 4-bit weight, activation, and KV-cache quantization (W4A4KV4). However, current methods predominantly focus on suppressing activation outliers, overlooking their geometric alignment with the quantizer grid. Researchers introduce PrismQuant, a quantizer-aware rotation framework that mathematically aligns the leading activation eigenspace with the constant group subspace of asymmetric grouped INT4 quantization. Formulated as a Ky Fan trace maximization problem, PrismQuant derives a closed-form, provably optimal rotation solution without requiring expensive gradient descent. Benchmarked across Llama, Qwen, and Mistral architectures up to 70B parameters and 30B MoE variants, PrismQuant sets new SOTA marks: on Llama-3.1-70B under W4A4KV4, it achieves 72.46% zero-shot accuracy—merely 0.22 percentage points below full FP16 precision. Deployment benchmarks demonstrate a 1.51x prefill speedup and 56.34% reduction in peak decoding VRAM with code open-sourced on GitHub.

PrismQuant: Optimal Null-Space Rotations for Grouped Quantizers Slashes Peak Memory by 56% with Only 0.22% Drop on 70B Models

Key Takeaways

  • Quantizer-Aware Geometric Alignment: Establishes that minimizing activation outlier magnitudes is secondary to aligning the leading activation eigenspace with the grouped quantizer's null-space.
  • Closed-Form Optimal Rotation: Solves Ky Fan trace maximization analytically, deriving gradient-free Householder rotations that can be computed in seconds without retraining.
  • Near-Lossless W4A4KV4 on 70B & 56% VRAM Drop: Reaches 72.46% zero-shot accuracy on Llama-3.1-70B (within 0.22% of FP16), delivers a 1.51x prefill speedup, and cuts peak decode VRAM by 56.34%.
Read full story
Linked Models & Agents:

KVCMAS: Low-Rank Online KV Cache Correction for Multi-Agent Systems Cuts TTFT by 2x and Peak VRAM by 3.7x

In collaborative multi-agent systems sharing a common foundation model, distinct system prefixes cause KV cache representations for the shared context to diverge, forcing each agent to redundantly re-prefill the entire conversation history. Researchers from Seoul National University and KAIST introduced KVCMAS, an online KV cache correction framework. By parameterizing cross-agent cache deviations as compact low-rank states and chaining corrections along agent pipelines without external reference prefills, KVCMAS accelerates TTFT by 2.0x while reducing peak GPU memory by up to 3.7x.

KVCMAS: Low-Rank Online KV Cache Correction for Multi-Agent Systems Cuts TTFT by 2x and Peak VRAM by 3.7x

Key Takeaways

  • Resolving Multi-Agent Prefix Divergence: Addresses the fundamental impasse where distinct agent system prompts contaminate downstream KV representations for shared dialogue histories, defeating naive cache reuse.
  • Low-Rank Chained Delta Corrections: Represents inter-agent cache deviations using compact low-rank projections, chaining updates dynamically along the agent pipeline without incurring out-of-band reference prefill overhead.
  • 2.0x TTFT Acceleration & 3.7x Memory Reduction: Achieves a 2.0x time-to-first-token speedup over non-shared multi-agent serving traces while slashing peak VRAM by up to 3.7x compared to state-of-the-art correction methods.
  • Full Preservation of Output Fidelity: Maintains exact numerical cache states for the leading agent while preserving zero downstream accuracy degradation across complex multimodal and text agent suites.
Read full story
Linked Models & Agents: