1M context is now generally available for Opus 4.6 and Sonnet 4.6
TL;DR Highlight
Anthropic rolled out 1M token context windows for Opus 4.6 and Sonnet 4.6 — this changes what's practical for long-context tasks.
Who Should Read
Developers building applications with large documents, long conversation histories, or codebases that need to be processed as a single context, and ML engineers benchmarking long-context performance.
Core Mechanics
- Claude Opus 4.6 and Sonnet 4.6 now support 1 million token context windows — enough for entire medium-sized codebases, very long books, or months of conversation history.
- 1M tokens is approximately 750,000 words or roughly 3,000 pages of text.
- This makes certain use cases that previously required RAG or chunking feasible as direct in-context tasks: analyzing a full codebase, processing large legal document sets, or maintaining very long agent memory.
- The key question is whether the model's attention quality degrades in the middle of a 1M token context (the 'lost in the middle' problem) — early reports suggest Anthropic has made improvements here.
- Pricing at this scale becomes a significant consideration: 1M tokens of input is expensive relative to a well-tuned RAG retrieval that only brings in the relevant 10k tokens.
Evidence
- Anthropic announced the 1M context expansion with API availability, confirmed through the API documentation.
- HN commenters ran their own tests — feeding in full codebases and asking questions across the entire codebase. Results were generally positive for code navigation tasks.
- Some found that retrieval quality degrades for context items in the 'middle' of a very long context, consistent with the known 'lost in the middle' problem in long-context models.
- Cost comparisons showed that for high-recall tasks, 1M context could actually be cheaper than complex RAG pipelines with re-retrieval and reranking.
How to Apply
- For codebase analysis and navigation tasks, try loading the entire relevant codebase into a single 1M context request before investing in RAG-based code search.
- For long-document processing (legal, research, financial), test whether direct 1M context gives better answers than chunked RAG — quality may outweigh cost for high-value queries.
- Structure prompts for 1M contexts carefully: put the most important content at the beginning or end, not the middle — attention tends to be strongest there.
- Monitor costs carefully: 1M token inputs at current pricing can be expensive at scale — model a full-context approach vs. RAG cost/quality tradeoff before committing to architecture.
Terminology
Related Papers
Show HN: Smart model routing directly in Claude, Codex and Cursor
프롬프트마다 적합한 AI 모델을 50ms 이내에 자동으로 선택해주는 프록시 라우터로, API 비용을 40~70% 절감할 수 있다고 주장하는 오픈소스 도구다. 단, 프롬프트 캐싱 손실 문제로 커뮤니티 반응은 엇갈린다.
Show HN: Overfitted a 900KB Transformer to Compress a 100MB CSV into 7MB
단일 파일을 통째로 암기하도록 Transformer를 과적합(overfitting)시킨 뒤 arithmetic coding으로 압축하는 실험으로, 100MB CSV를 7MB(~0.5 bits/byte)까지 줄이는 데 성공했다. 모델이 '범용 이해' 대신 '특정 파일 완전 암기'를 목표로 한다는 점에서 전통적 ML 학습과 정반대 방향이라 흥미롭다.
Ask HN: Anthropic banned me from using Claude Code and I don't know what to do
VPN 사용 또는 동일 카드 재사용으로 Anthropic Claude Code 계정이 이유 불명으로 정지당한 사용자의 사례와, 커뮤니티에서 나온 대안 및 우회 방법 논의.
Moebius: 0.2B image inpainting model with 10B-level performance
FLUX.1-Fill-Dev(11.9B) 대비 2% 미만의 파라미터(0.22B)로 동급 또는 그 이상의 인페인팅 품질을 달성하면서 추론 속도는 15배 빠른 경량 모델. 소비자용 GPU나 엣지 디바이스에서도 고품질 인페인팅이 가능해진다.
AI Compute Extensions (ACE) Specification
x86 Ecosystem Advisory Group이 행렬 곱셈과 저정밀도 데이터 포맷을 하드웨어 수준에서 가속하는 새로운 x86 명령어 확장 스펙 ACE를 공개했다. ML 워크로드를 CPU에서 더 효율적으로 돌리기 위한 ISA(명령어 집합 구조) 수준의 변화라 향후 AI 추론 환경에 영향을 줄 수 있다.
Show HN: High-Res Neural Cellular Automata
EPFL과 Google Research가 공동 개발한 Neural Cellular Automata(NCA)를 고해상도로 확장하는 기법으로, 기존 NCA의 해상도 한계를 경량 신경망 디코더로 극복한 SIGGRAPH 2026 논문이다.