Faster Than Dijkstra: The New Shortest-Path Algorithm, Explained
A new shortest path algorithm finally beats Dijkstra on sparse graphs. How it breaks the 65-year sorting barrier, and why Dijkstra still wins in practice.
Research
Context Engineering: Why Less Context Makes Better Agents
Context engineering explained: why long-running AI agents suffer context rot, what 2026 research shows about pruning and compaction, plus a Python demo.
Nemotron 3: How a Mamba-Transformer Hybrid Runs 1M Tokens
Nemotron 3 swaps most attention layers for Mamba-2 and MoE to reach 1M-token context at 3.3x throughput. Here is how the hybrid architecture actually works.
AI Agent Memory: How LLM Agents Remember Across Sessions
AI agent memory explained: the four memory types, how the MemoryOS paper borrows from operating systems, and a runnable Python example you can extend.
Sparse Attention Explained: How LLMs Handle Million-Token Contexts Without Melting Your GPU
How sparse attention cuts LLM inference cost by 10x on long contexts. Covers DeepSeek NSA, MInference, H2O, and The Sparse Frontier's findings.
Stanford AI Index 2026: 12 Findings, Dissected
Stanford's AI Index 2026: SWE-bench hit 100%, entry-level dev jobs down 20%, $581B invested, US-China gap at 2.7%. 12 findings, broken down.
FastContext: Why Coding Agents Waste Half Their Tokens on Repo Search
Microsoft's FastContext shows coding agents burn 56% of tool turns on exploration. A 4B subagent cuts token use 50% and lifts SWE-bench scores 3 points.
Project Glasswing: Claude Found 10,000 Critical Bugs in 8 Weeks
Project Glasswing gave Claude Mythos to 200+ orgs; it flagged 10,000 critical bugs in 8 weeks at a 90.6% true-positive rate. Why Anthropic keeps it locked.
Efficient LLM Reasoning: 7 Papers That Cut Token Costs by Up to 84%
Seven papers fix LLM overthinking: Sketch-of-Thought cuts tokens 84%, shorter chains boost accuracy 34.5%, and budget-aware prompting halves costs.
THINC: How a 4B Model Beat 235B Qwen3 by Reasoning in Code
THINC trains a 4B parameter model to reason entirely in code. It scored 78.1% on competition math, beating Qwen3-235B at 75.2%. Here's how the method works.