← Back to all entries
2026-09-16 🧭 Daily News

Gateway Headers, Session Forking, and Fermat's Last Theorem

Gateway Headers, Session Forking, and Fermat's Last Theorem — visual for 2026-09-16

🧭 Claude Code v2.1.273: LLM Gateway Hint Headers, Remote Session Forking, and Critical Permission Security Patches

Released late on September 15, Claude Code v2.1.273 is a substantive drop with one brand-new capability for gateway operators, a quality-of-life improvement for Remote Control users, and three security-related permission fixes that close real bypass paths. The headline feature is opt-in request headers that expose session metadata to LLM gateways and proxies — closing a gap that has made gateway-level observability, routing, and cost attribution awkward for teams running Claude behind corporate proxies or custom inference routers.

LLM Gateway Hint Headers

Set the environment variable CLAUDE_CODE_GATEWAY_HINT_HEADERS=1 in your runner or .env to activate five new request headers on every outbound API call:

Practical gateway routing with these headers

Gateway operators can now route long-running auto-mode requests to higher-timeout upstreams automatically, apply tighter rate limits to subagent turns versus interactive ones, and attribute costs accurately by agent type — without parsing response bodies or injecting correlation IDs themselves. If you run Claude Code behind an Nginx proxy or a custom LLM router, add CLAUDE_CODE_GATEWAY_HINT_HEADERS=1 to your environment and update your proxy config to forward the x-claude-code-* headers upstream.

Session Forking from Remote Control

Sessions started with claude --remote-control (or launched via /remote-control in the Claude app) can now be forked. The fork runs as a background session on your local machine while the original remote session continues uninterrupted. This is especially useful for exploration: fork a session at the exact point you want to diverge, run an experiment in the fork, and the main session remains clean if the experiment goes sideways.

Permission Security Fixes

Three related bugs were patched, each representing a path around permissions.blockReadsOutsideWorkingDirectories:

A complementary revert was also included: the previous release had introduced an overly strict check that blocked legitimate eval and env -C Bash patterns; that restriction is rolled back.

Other notable fixes

Claude Code v2.1.273 LLM gateway hint headers session forking Remote Control permission security MCP MDM auto mode

🧭 Claude Writes the First Complete Computer-Checked Proof of Fermat's Last Theorem — Autonomously, in Lean, Over 11 Days

Anthropic's research team has published a landmark result: Claude worked autonomously for 11 days to produce the first complete, computer-verified formalisation of Fermat's Last Theorem in the Lean proof assistant. Lean's kernel — which mechanically checks every logical inference step — accepted the proof in full. The result closes a 30-year gap between Wiles' 1995 human proof and a machine-checkable version that any formal-methods tool can independently verify.

What was actually accomplished

Fermat's Last Theorem states that there are no positive integers a, b, c satisfying an + bn = cn for any integer n > 2. Andrew Wiles' 1995 proof spans roughly 200 pages of advanced mathematics, drawing on modular forms, elliptic curves, and Galois representations. Formalising it in Lean required translating every definition, lemma, and inference — including many steps that Wiles left implicit — into a language strict enough that a proof kernel accepts it. Human formalisers had been working on a partial formalisation for years; significant sections of the required mathematical infrastructure were missing from Lean's Mathlib library entirely.

Claude's 11-day autonomous run did not discover a new proof of Fermat's Last Theorem. What it did — filling those library gaps, constructing all intermediate lemmas, and assembling the complete proof file — is arguably the harder engineering challenge.

Why this matters for developers

The proof file is public

Anthropic has released the complete Lean proof file alongside the paper. If you work in formal methods or are building AI-assisted verification workflows, the file is worth examining as a concrete example of what Claude can produce autonomously at the boundary of formally expressible mathematics. The Mathlib extensions are being upstreamed; expect them to appear in Mathlib4 in the coming weeks.

⭐⭐⭐ anthropic.com
formal proof Fermat's Last Theorem Lean Mathlib mathematics autonomous reasoning formal verification long-horizon agents research

🧭 Anthropic Python SDK v1.6.0: Managed Agent Permissions, Signed Compaction Blocks, and Async Credential Providers

Released September 15 alongside Claude Code v2.1.273, the Anthropic Python SDK v1.6.0 ships a set of additions that collectively improve how developers wire managed agents, handle long-context sessions, and authenticate in serverless and credential-delegation environments. The release requires anyio 4.1+ — check your environment before upgrading if you pin transitive dependencies.

What's new

Upgrade path

Run pip install --upgrade anthropic. Before upgrading in production, verify your anyio version: pip show anyio should report 4.1.0 or higher. If you use httpx or fastapi in the same environment, both are compatible with anyio 4.1+ but check for any pinned constraints in your requirements.txt or pyproject.toml that may pull in an older anyio.

Python SDK v1.6.0 Managed Agents compaction web fetch async credentials data residency Co-Work anyio
Source trust ratings ⭐⭐⭐ Official Anthropic  ·  ⭐⭐ Established press  ·  Community / research