Context Rot Is a Quadratic Attention Problem, Not a Capacity Problem
Enlarging context windows does not fix context rot because attention quality degrades superlinearly with context size; the correct engineering response is compaction, offloading, and precise retrieval to keep context small and salient.
AngleChallenge the industry's race toward million-token windows by showing the attention math and practical context engineering alternatives.
Source video ↗The Harness Is the Product: Why Agent Reliability Engineering Beats Model Chasing
Since frontier models are commoditized and non-deterministic, the harness—memory, retrieval, tools, context, control—is where reliability, repeatability, and differentiation are engineered; teams should invest accordingly.
AngleArgue for a shift in engineering effort from model fine-tuning to harness layer design, using the "Agent = Model + Harness" decomposition.
Source video ↗Filesystems Are Not a Memory Architecture: The Case for Transactional Agent Memory
Multi-agent systems that share mutable memory on a filesystem will suffer race conditions and data loss; database-backed memory with ACID guarantees, hybrid search, and vector indexing is required for safe concurrent access and reliable retrieval.
AngleCompare filesystem vs database camps, show concrete race conditions, and outline migration paths to DBFS or equivalent.
Source video ↗Context Compaction vs Large Window Benchmark
beyond-evalsFor long-horizon agent tasks requiring recall of specific facts, a harness with compaction/offloading and a small context window achieves higher recall accuracy at lower token cost than a harness relying on a 1M-token context window.
Proof of conceptImplement two identical agent harnesses (e.g., LangChain-based) differing only in context management: (A) full history + retrieved chunks in a large window, (B) compaction/offloading with context cards and retrieval. Run a suite of tasks requiring recall of facts from earlier turns.
MeasurementRecall accuracy of target facts, total token consumption, latency per turn, and degradation curve over increasing turn counts.
Source video ↗Multi-Agent Memory Contention Testbed
gatehouseShared agent memory stored on a filesystem produces lost updates, stale reads, and race conditions under concurrent multi-agent writes, while an ACID-compliant database store prevents them without significant performance penalty.
Proof of conceptBuild a multi-agent simulation where N agents concurrently read and write shared memory (e.g., facts, plans). Run against two backends: (A) filesystem with POSIX semantics, (B) transactional database with vector indexing (e.g., Oracle DBFS). Introduce controlled write conflicts.
MeasurementRate of lost updates, stale reads, write conflicts, and end-to-end task success; compare latency and throughput.
Source video ↗Typed Memory API vs Primitives Evaluation
beyond-evalsA packaged single-line memory API (e.g., OAMP) sacrifices controllability and debuggability compared to building memory from primitives, leading to lower recall/precision on tasks requiring distinct memory types (episodic, procedural, semantic).
Proof of conceptImplement two memory subsystems for the same agent: (A) using a packaged memory API that abstracts all memory types, (B) building from primitives with separate stores and policies for each memory type. Run identical long-horizon tasks that require retention, reuse, refinement, and recall.
MeasurementTask success rate, recall precision/recall of relevant memories, ability to debug memory decisions, and flexibility to tune per-type policies.
Source video ↗In-Database Embeddings vs External Service Trade-off
gatehouseComputing and storing embeddings inside the database (e.g., Oracle) reduces end-to-end latency and improves transactional consistency and data security compared to calling an external embedding API and storing vectors in a separate store, without degrading retrieval quality.
Proof of conceptImplement a RAG pipeline for an agent with two configurations: (A) external embedding API + separate vector database, (B) in-database embeddings and vector search. Run identical query workloads with writes interleaved.
MeasurementEnd-to-end latency per query, consistency (stale embeddings after writes), data egress security, cost per 1k queries, retrieval precision/recall.
Source video ↗