AI Coding Live News

BoxWorks 2026: Box and NVIDIA Unveil Box Context Retrieval, Permission-Aware Retrieval for Enterprise Agents Built on Nemotron Retriever, Plus Box Architect and Box Mount

At BoxWorks 2026 on November 5, Box announced an expanded NVIDIA collaboration: Box Context Retrieval, a new engine built on NVIDIA Nemotron Retriever embedding models, combines keyword and semantic search to return the most relevant passages to AI agents while honoring existing file permissions, with general availability for Enterprise Advanced customers planned for early next year. Box's press release claims 20% better search accuracy (Recall@5), 90% fewer tokens and 4x faster answers. Open-weight Nemotron models, starting with Nemotron 3 Ultra, are available in Box AI now. Box also unveiled Box Architect, which designs workflows from a stated goal; Box Mount, which mounts Box folders inside agent sandboxes and works with NVIDIA OpenShell; and agent security controls including MCP Guardrails.

BoxWorks 2026: Box and NVIDIA Unveil Box Context Retrieval, Permission-Aware Retrieval for Enterprise Agents Built on Nemotron Retriever, Plus Box Architect and Box Mount

Key Takeaways

  • Box Context Retrieval uses NVIDIA Nemotron Retriever with hybrid keyword and semantic search, honoring existing file permissions
  • Vendor claims: +20% Recall@5 accuracy, 90% fewer tokens, 4x faster answers; GA for Enterprise Advanced early next year
  • Open-weight Nemotron models, starting with Nemotron 3 Ultra, are available in Box AI now
  • Box Mount puts Box folders inside agent sandboxes and works with the NVIDIA OpenShell secure runtime
  • New agent security controls include MCP Guardrails, classification-based access policies and audit trails
Read full story
Linked Models & Agents:
⚡ Nemotron 3 Ultra⚡ Nemotron Retriever🌐 box🌐 Nvidia (NIM)

Mirendil, founded by ex-Anthropic researchers, unveils Fern: its first from-scratch model with up to 10M tokens of context

On Oct 26 Mirendil unveiled Fern, its first model, pretrained from scratch on its own Mirendil-Base (0.1-0.5T params) with a context window of up to ~10M tokens, about 0.5M lines of code or days of agent traces. Fern 0.1 got only a short round of post-training and targets AI R&D work such as auditing training data, debugging runs from logs and reading agent traces end to end. Vendor-reported: 73.4% on SWE-Bench Verified and 100% single-needle RULER retrieval at 10M, while multi-hop QA drops to 45% at 10M. Access is early-access only; no price or weights yet.

Mirendil, founded by ex-Anthropic researchers, unveils Fern: its first from-scratch model with up to 10M tokens of context

Key Takeaways

  • Scale and context (vendor-reported): Mirendil-Base has 0.1-0.5T params; Fern reads up to ~10.2M tokens (about 23 MB or ~0.5M lines of code, roughly Megatron-LM scale), per the official blog
  • Coding scores (run by Mirendil, OpenCode, 1 attempt): SWE-Bench Verified 73.4, SWE-Bench Pro v2-Hard 76.5, SWE Atlas QnA 53.2, DeepSWE v1.1 44.2, Terminal-Bench 4.0 just 6.1; Claude Opus 5.5 in the same table scores 98.2/100.0/66.4/74.2/66.4
  • RULER long context (vendor-reported): single-needle retrieval is 100% from 32K to 10M; multi-hop HotpotQA falls from 65% at 32K to 45% at 10M, with only 20 samples per 10M cell
  • Cost (vendor-reported): one researcher plus agents built Mirendil-Base in 3.5 months for under $10M of compute, with agents writing over 99% of the code, per the pretraining write-up
  • Availability: Fern is the smallest of three models; Base-Large (0.5-2T) and Base-XL (2-10T) are still pretraining; access is via early-access requests only, with no price or weights announced
Read full story
Linked Models & Agents:
⚡ Fern 0.1⚡ Mirendil-Base🌐 Mirendil

MemPilot Unveiled: On-Demand Multimodal Memory Curation for LLM Agents Solving Multi-Session Context Saturation

Researchers introduced MemPilot (arXiv:2610.06830), an on-demand multimodal memory curation framework for LLM agents. Resolving the chronic context explosion and cross-session forgetting that plague autonomous agents handling mixed text, screenshots, and action traces, MemPilot introduces an adaptive policy controlling memory retention, semantic clustering, and targeted retrieval. Across extensive long-horizon multi-modal agent benchmarks, MemPilot cuts active memory footprint by over 60% while substantially improving cross-session task completion.

MemPilot Unveiled: On-Demand Multimodal Memory Curation for LLM Agents Solving Multi-Session Context Saturation

Key Takeaways

  • Researchers introduced MemPilot (arXiv:2610.06830), an on-demand multimodal memory curation framework solving context saturation in LLM agents
  • Features a tri-tier architecture spanning active buffers, an image Memory Gallery, and a long-term semantic knowledge graph
  • Slashes active multimodal token consumption by 60% to 75%, extending agent continuous operational lifespan by over 3x
  • Boosts cross-session task completion by +18.5% over text-only RAG, providing a scalable blueprint for persistent computer-use agents
Read full story
Linked Models & Agents:

LightOn open-sources ColGrep-Agent-2B: local 2B code-search agent cuts Claude Code API tokens ~34% and cache-aware cost ~40%

On 2026-10-12 LightOn AI released ColGrep-Agent-2B (fine-tuned from MiniCPM5-2B, Apache-2.0): a local 2B code-localization agent that searches with ColGrep multi-vector retrieval plus a read-only terminal, then returns file paths and line ranges to a frontier coding agent. On 52 code-search questions across 13 unseen repos (624 Claude Code / Sonnet 5.5 sessions), delegating search cut API tokens ~34.3% and cache-aware cost ~40% vs grep, with 80.8% vs 83.3% accuracy (not statistically significant). On SWE-bench Lite localization it posted 19.92 line F1—best among models evaluated in the same ColGrep harness, including several >10× larger. Ships brew/cargo/GGUF installers and hooks for Claude Code, Codex, and OpenCode.

LightOn open-sources ColGrep-Agent-2B: local 2B code-search agent cuts Claude Code API tokens ~34% and cache-aware cost ~40%

Key Takeaways

  • Official: HF Blog — ColGrep-Agent (2026-10-12); model lightonai/colgrep-agent-2B; repo lightonai/next-plaid
  • Vendor Claude Code + Sonnet 5.5 study (52×3): −34.3% tokens vs grep (95% CI 28–40), ~−40% cache-aware cost (7.3¢→4.4¢/q); accuracy 80.8% vs 83.3%
  • Localization: SWE-bench Lite file F1 76.18 / line F1 19.92; Multi-SWE-bench Flash file F1 62.57 / line F1 15.93 (5-seed avg)
  • Train: MiniCPM5-2B → SFT (Qwen3.5-27B teacher) → GRPO 500 steps; tools: colgrep / read-only terminal / finish; 10-turn budget
  • Install: brew install lightonai/tap/colgrep && colgrep --install-agent; default GGUF ~2.5GB; hooks for Claude Code / Codex / OpenCode
Read full story
ADSponsored

UNREAL: NVIDIA Unifies Corpus-Scale Retrieval and 256K Long-Context Inference in a Single Frozen LLM with Under 500K Parameters

LLM systems handle evidence retrieval via two disjoint paradigms: external Retrieval-Augmented Generation (RAG) pipelines relying on auxiliary retriever-reranker stacks, and brute-force long-context inference suffering from quadratic attention overhead. NVIDIA and Technion introduce UNREAL (UNifying REtrieval And Long-Context with a Single Model, arXiv:2610.08463), a model-native framework unifying corpus retrieval and long-context filtering within a single frozen LLM. By deriving chunk representations and search queries directly from internal transformer activations, UNREAL introduces fewer than 500K parameters while keeping the backbone frozen. On a 3B-token, 21M-chunk Wikipedia corpus, UNREAL surpasses competitive retriever-reranker systems, lifting HotpotQA recall from 49.1% to 73.2% and 2WikiMultiHopQA from 31.7% to 60.1%. When applied to long-context sequences, UNREAL dynamically purges irrelevant distractors prior to generation, boosting 128K NoLiMa accuracy from 1.0% to 24.83% and 256K LV-Eval F1 to 54.66% while substantially curbing FLOPs and time-to-first-token (TTFT) from 32K context onward.

Key Takeaways

  • NVIDIA and Technion present UNREAL, unifying corpus retrieval and long-context filtering in a single frozen LLM with under 500K parameters
  • Surpasses SOTA retriever-reranker stacks on a 3B-token Wikipedia index, lifting HotpotQA recall from 49.1% to 73.2%
  • Dynamic distractor pruning boosts 128K NoLiMa accuracy from 1.0% to 24.83% while significantly reducing TTFT and compute FLOPs
Read full story

NVIDIA NeMo Study: Agentic Retrieval Boosts Complex Search nDCG@10 by 8.7 Points but Incurs 107s Latency and 764K Tokens per Query

Dense retrieval serves as the default paradigm for searching unstructured enterprise corpora in modern RAG systems. However, dense retrieval is fundamentally bound to surface-level semantic similarity, failing when queries require multi-hop exploration, dynamic hypothesis reformulation, and causal synthesis. Researchers from NVIDIA NeMo-Retriever present an in-depth investigation into Agentic Retrieval (arXiv:2610.05750), coupling LLM ReAct loops with dense and lexical retrievers. Evaluating across challenging benchmarks including ViDoRe v3 and BRIGHT, agentic retrieval improves nDCG@10 by 8.7 points using the identical underlying embedding model. Crucially, NVIDIA transparently quantifies the operational trade-offs: agentic searches average 107.4 seconds per query (versus 0.67 seconds for conventional retrieval) and consume an average of 764.1K input tokens and 5.8K output tokens per query. This landmark study provides critical empirical benchmarks for enterprise architectures balancing retrieval depth against inference budgets (github.com/NVIDIA/NeMo-Retriever).

Key Takeaways

  • NVIDIA NeMo-Retriever evaluates Agentic Retrieval coupling ReAct loops with dense retrievers for complex multi-hop search
  • Improves nDCG@10 by 8.7 points using the identical base embedding model across ViDoRe v3 and BRIGHT benchmarks
  • Transparently quantifies operational costs: average query latency reaches 107.4 seconds (vs 0.67s) consuming 764.1K input and 5.8K output tokens
Read full story
Linked Models & Agents:

Engram: Pre-Registered Agent Memory Trial Shows Raw Turn Selection Matches LLM Fact Extraction at 3,061x Lower Cost

Conversational memory for LLM agents traditionally divides into two opposing camps: expensive pipeline extraction that distills dialogues into structured factual memory stores versus raw conversational turn retrieval. Literature has reported contradictory findings. Researchers conducted a pre-registered, double-blind controlled study on held-out LoCoMo and LongMemEval benchmarks (arXiv:2609.34227). The investigation reveals that under constrained context budgets, selecting raw conversational turns via a lightweight typed decision model (Jev) is statistically non-inferior to full LLM fact extraction pipelines (95% one-sided bound -3.0 points vs. -5 margin)—while reducing write-time computational costs by a massive 3,061 times. Furthermore, the authors resolve literature contradictions by proving that reranking gains scale inversely with token budgets, while aggressive reranking degrades an agent's correct abstention reliability. All study protocols, data, and code are open-sourced at github.com/ris3abh/Engram.

Key Takeaways

  • Presents Engram, the first pre-registered double-blind study testing raw-turn selection against LLM fact extraction for agent memory
  • Shows raw turns selected via typed decision model Jev are statistically non-inferior to LLM fact extraction at 3,061x lower write cost
  • Proves reranking gains decay sharply as token budgets expand, while aggressive reranking degrades an agent's correct abstention rate
Read full story
Linked Models & Agents:

MemAdapter: Counterfactual Adaptation Against Memory-Induced Sycophancy in Long-Term Memory LLM Agents

Persistent long-term memory empowers LLM-based agents to maintain personal preferences and contextual continuity across extensive multi-session interactions. However, accumulated memories frequently induce 'Memory-Induced Sycophancy'—compelling agents to slavishly conform to a user's historical misconceptions, obsolete beliefs, or flawed arguments at the expense of objective truth. Prior mitigation efforts operate under the premise that sycophancy stems exclusively from polluted or biased memories, attempting heuristic filtering at storage or retrieval stages. In reality, completely objective and valid memories can still trigger sycophancy when inappropriately prioritized across shifting conversational contexts. To overcome this systemic vulnerability, researchers from Jilin University and collaborators present MemAdapter (arXiv:2610.05162). MemAdapter adaptively modulates retrieved memory influence across three decoupled components: Counterfactual Induction, Context-Aware Reflection, and Evidence-Based Reasoning. Open-sourced on GitHub (DEEP-JLU/MemAdapter), the framework systematically restores objective grounding across three major sycophancy benchmarks while preserving benign personalization.

Key Takeaways

  • Exposes memory-induced sycophancy in LLM agents and introduces MemAdapter for counterfactual memory calibration
  • Decouples counterfactual induction, context-aware reflection, and evidence-based reasoning to segregate facts from subjective preferences
  • Reduces sycophantic alignment rates by 45%-60% across three benchmarks while preserving over 98% benign personalization integrity
Read full story

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

ASCENT: Online Test-Time Training (OaTTT) for Long-Horizon Agents Enables Self-Evolution via Verified Experience Distillation

As autonomous LLM agents navigate complex long-horizon operational streams in production, enabling continuous test-time weight adaptation without catastrophic policy drift remains a foundational challenge. Conventional in-context adaptation stores reflections or skills as text, making reuse bottlenecked by fragile retrieval heuristics over a static, frozen policy; conversely, directly imitating or reinforcing tokens from single deployment rollouts destabilizes policy weights. Researchers formalize Online Agentic Test-Time Training (OaTTT) and introduce ASCENT (arXiv:2610.05303). The agent executes each task in a single streaming pass. A frozen copy of the initial model acts as a hindsight teacher, receiving verified execution trajectories as privileged context to compute calibrated next-token predictive distributions. Distilling these distributions into persistent LoRA fast weights continuously updates policy parameters across subsequent tasks without external teacher models or gold references. By pruning invalid-action turns to distill condensed execution trajectories, ASCENT systematically improves task success rates and interaction efficiency across ALFWorld, WebShop, and AppWorld, successfully transferring learned behaviors to held-out environments.

ASCENT: Online Test-Time Training (OaTTT) for Long-Horizon Agents Enables Self-Evolution via Verified Experience Distillation

Key Takeaways

  • Formalizes Online Agentic Test-Time Training (OaTTT) and introduces ASCENT for teacher-free continual self-evolution
  • Leverages a frozen initial model snapshot for privileged hindsight distillation, consolidating pruned traces into persistent LoRAs
  • Demonstrates monotonic task success gains across ALFWorld, WebShop, and AppWorld with robust transfer to held-out environments
Read full story
ADSponsored

RealCompanion: Auditing Human Understanding Over 120-Day Real-World Conversations Exposes Agent Memory Benchmarks

In long-term companion AI and memory-augmented agent research, standard evaluations rely on synthetic personas and generated queries that artificially predetermine relevance and leak retrieval cues. Researchers introduce RealCompanion (arXiv:2610.01780), releasing a landmark dataset derived from ten genuine human relationships with an AI companion spanning up to 120 days and 27,218 real messages, meticulously annotated with ground-truth reasoning traces. The empirical analysis yields three foundational findings: First, historical memory is rarely required and temporally distant—95.9% of user interactions are satisfied by immediate context, with only 2.2% genuinely necessitating historical memory retrieval; pooled evaluation scores create an illusion of competence where 96% of evidence gains come from queries needing no recall. Second, contemporary memory detectors fail entirely on unprompted human text; synthetic benchmarks leak intent cues, and merely tagging inputs as 'memories' inflates agent retrieval by 10 to 14 points. Third, distinct memory architectures reconstruct human personas with identical F1 accuracy across a staggering 31-fold disparity in computational cost.

RealCompanion: Auditing Human Understanding Over 120-Day Real-World Conversations Exposes Agent Memory Benchmarks

Key Takeaways

  • Releases RealCompanion over 120 days and 27,218 real messages, puncturing synthetic benchmark illusions in agent memory
  • Reveals extreme long-tail memory demands: only 2.2% of authentic messages require recall, while 95.9% rely strictly on recency
  • Demonstrates that contemporary memory detectors fail on natural speech, and identical F1 persona accuracy spans a 31x cost gap
Read full story
Linked Models & Agents:

Tokenizing Reusable Experience: X-Tree Recovers Hierarchical Skill Vocabularies to Boost Autonomous Agent Success by up to 5.8%

Conventional multi-step agents are trained on flat action trajectories, where SFT and RLVR apply uniform loss weights across tokens while ignoring recurring sub-procedures that facilitate top-down hierarchical human reasoning. External skill-retrieval mechanisms fail to bake capabilities into model parameters and falter out-of-domain. Researchers from the University of Waterloo and collaborating institutions introduce X-Tree, an algorithmic framework that tokenizes reusable agent experience analogous to text BPE tokenizers without expensive LLM prompts. By scoring action spans via reusability and compiling canonicalized action flows into a hierarchical eXperience Tree, X-Tree integrates seamlessly into Offline RL, Online RLVR, and On-Policy Self-Distillation, delivering up to a 5.8% task success rate improvement across WebArena, ScienceWorld, and WebShop.

Tokenizing Reusable Experience: X-Tree Recovers Hierarchical Skill Vocabularies to Boost Autonomous Agent Success by up to 5.8%

Key Takeaways

  • Pioneers X-Tree to tokenize reusable experience without external LLM calls, compiling raw traces into hierarchical skill trees
  • Seamlessly augments Offline RL, Online RLVR (adaptive skill bonuses), and on-policy self-distillation
  • Improves task success rates by 4.5% on WebArena, 5.8% on ScienceWorld, and 4.1% on WebShop under identical compute budgets
Read full story
Linked Models & Agents:

Omni-Embed-Mini Binds 6 Modalities Without Forgetting: MBZUAI Opens 0.9B Dense Distillation Model Outperforming Gemini

Expanding text embedding models to multimodal domains typically triggers catastrophic forgetting in text retrieval, with existing omni-modal embedders ballooning past multi-billion parameters to compensate. MBZUAI researchers introduce Omni-Embed-Mini, a compact 0.9B architecture mapping text, speech, audio, image, video, and rich documents into a single shared cosine space. Crucially, text-side weights remain bit-identical to the base model, guaranteeing zero regression on text retrieval (49.57 nDCG@10 on MTEB-v2 BEIR-8). Powered by dense cascaded caption distillation, Matryoshka SigLIP loss, and online hybrid hard-negative mining, Omni-Embed-Mini is 2.7x to 9.5x smaller than competing open models, while its 2.3B variant surpasses proprietary gemini-embedding-2 on cross-modality averages.

Omni-Embed-Mini Binds 6 Modalities Without Forgetting: MBZUAI Opens 0.9B Dense Distillation Model Outperforming Gemini

Key Takeaways

  • Unifies text, speech, audio, image, video, and rich documents into a single shared space at only 0.9B parameters
  • Guarantees zero text forgetting via bit-identical frozen text weights (49.57 nDCG@10 on MTEB-v2 BEIR-8)
  • 2.3B model variant outperforms proprietary Google gemini-embedding-2 on cross-modality retrieval averages
Read full story
Linked Models & Agents:

AgSpec Accelerates Coding Agent Pipelines by 4.7x: Retrieval-Based Speculative Decoding Outperforms EAGLE-3

Coding agents frequently reproduce existing code, error logs, and multi-turn refactoring traces, making retrieval-based speculative decoding (SD) an ideal acceleration paradigm. However, conventional retrieval drafters fail in agent workflows: candidate code on disk diverges from the agent's emission formats (e.g., diff blocks, escape characters), and static draft lengths ignore inter-agent turn drift. KAIST researchers introduce AgSpec, a speculative decoding framework tailored for coding agents. AgSpec constructs format-aligned corpora across session trajectories, workspaces, and global repositories, coupling offline draft caps with online feedback-adaptive draft length control. Across repository-level multi-agent benchmarks, AgSpec outperforms five retrieval drafters and EAGLE-3, boosting generation throughput up to 4.76x.

AgSpec Accelerates Coding Agent Pipelines by 4.7x: Retrieval-Based Speculative Decoding Outperforms EAGLE-3

Key Takeaways

  • Tailors retrieval speculative decoding to coding agent pipelines via emission-aligned triple corpora and adaptive length control
  • Achieves up to 4.37x speedup at batch size 1 and 4.76x speedup at batch size 16 on repository-level multi-agent benchmarks
  • Outperforms EAGLE-3 across primary settings without requiring dedicated neural draft models or additional GPU VRAM
Read full story

Cloudflare AI Search goes GA: native multimodal embeddings + PDF OCR; billing from Nov 1; hybrid search default

On 2026-10-01 Cloudflare made AI Search generally available: managed index/retrieval (Workers AI + Vectorize + R2 + Browser Run) ships native multimodal embeddings (Qwen3-VL-Embedding), OCR for scanned PDFs, 10 MiB text/OCR PDF limits, hybrid search by default, and billing from 2026-11-01 with a free allotment.

Cloudflare AI Search goes GA: native multimodal embeddings + PDF OCR; billing from Nov 1; hybrid search default

Key Takeaways

  • GA 2026-10-01: changelog + blog.cloudflare.com/ai-search-ga/
  • Multimodal embeddings: @cf/qwen/qwen3-vl-embedding-2b and google-ai-studio/gemini-embedding-2; image queries via REST/public endpoint
  • OCR on all accounts; text/code + OCR PDFs up to 10 MiB (non-OCR PDFs stay 4 MiB)
  • Hybrid search default; Workers AI embed/rerank folded into AI Search pricing (not Workers AI bill)
  • Pricing: $0.75/1M ingest tokens, $2/GB-mo storage, $0.75/1k semantic, $0.10/1k full-text; free tier 5M ingest / 10 GB / 1k+1k queries; bill from Nov 1, 2026
Read full story
Linked Models & Agents: