Skip to content
← Back to research index

abstract indexed · arXiv 2609.39765 · updated 2026-10-18

MemCodex: Self-Programming Hierarchical Memory for Language Agents

First page of MemCodex: Self-Programming Hierarchical Memory for Language Agents
From the original paper · arXiv 2609.39765Page 1. Select the image to read the PDF.

MemCodex replaces fixed, predefined memory workflows (and adaptive methods limited to a predefined design space) with a hierarchy of executable memory programs whose construction, indexing, retrieval, and routing are evolved automatically, traversed coarse-to-fine at query time. The cost is substantial system complexity: a program-evolution search loop, a unified runtime (MemArena) to host heterogeneous memory backends, and added infrastructure for maintaining and rewriting memory layers, none of which runs without ongoing LLM calls for evolution and routing. Failure modes include evolved retrieval programs degrading silently as workloads drift, early stopping at coarse layers missing fine-grained evidence, and the reported gains not transferring if the reader's tasks differ from the evaluation benchmark.

For solo builders

A possible application for this research area. Paper-specific feasibility still needs a full-paper review.

A support or data assistant repeats work across related customer requests.

What you would change

Try the paper's memory change in a replay of past tasks, with separate memory per customer.

Try the idea on your product

A proposed first test. Set your budget and success criteria before running it.

Try the paper's memory change in a replay of past tasks, with separate memory per customer.

Compare against

Your current memory pipeline plus a no-memory control using the same agent.

  1. Locate the paper's implementation and check its license, model support, data needs, and hardware requirements. Stop here if you cannot obtain the required artifacts.
  2. Save a small set of representative product tasks and expected outcomes. Keep evaluation tasks out of any training or tuning, and choose quality and cost limits before running.
  3. Run the baseline and the proposed change on identical inputs. Keep other settings fixed and repeat paired runs to expose variation.
  4. Save per-task outputs, failures, timings, and all usage costs. Review regressions before expanding the test.

What to measure

Task success, stale memories, retrieval misses, response latency, and all memory maintenance costs.

When to keep it

Keep the change only if it meets your preselected quality and latency limits and improves the metric you care about after setup and operating costs. Otherwise retain the baseline. This is an exploration plan, not a validated recommendation.

Download test plan ↓

abstract indexedPaperraft next step

Do not allocate compute yet.

This page uses the abstract and public adoption signal only. Request the deep report before relying on its recommendation.

Abstract-level screening only. Risks and infrastructure may not have been evaluated. This recommendation is not a reproduced result.
minimum test setup
not reported
published evidence setup
not reported
source-linked claims
0 of 2
exposure checks
0 of 8

Why it was shortlisted

The technical change, research area, and reason it entered the archive.

recommendation
test
research area
memory and context
technical change
Self-evolving hierarchical executable agent memory
published
2026-09-30

The claimed quality and token-efficiency gains are relevant to API-based agent deployments, but the evolutionary search machinery and unified runtime require workload-specific validation on the reader's own tasks before production adoption.

About the technical core

Equations have not been fetched yet.

When reading the methods, identify the rule, algorithm, or evaluation protocol that produces the claimed change. An equation is useful here only if it explains that mechanism.

Inspect the original paper

Claims and evidence

A claim is source-linked only when the PDF page and matching excerpt are available.

  1. claim 01Paperraft inference
    Read the brief interpretation

    MemCodex replaces fixed, predefined memory workflows (and adaptive methods limited to a predefined design space) with a hierarchy of executable memory programs whose construction, indexing, retrieval, and routing are evolved automatically, traversed coarse-to-fine at query time. The cost is substantial system complexity: a program-evolution search loop, a unified runtime (MemArena) to host heterogeneous memory backends, and added infrastructure for maintaining and rewriting memory layers, none of which runs without ongoing LLM calls for evolution and routing. Failure modes include evolved retrieval programs degrading silently as workloads drift, early stopping at coarse layers missing fine-grained evidence, and the reported gains not transferring if the reader's tasks differ from the evaluation benchmark.

    This is a Paperraft inference. It is not pinned to a verified PDF passage.

    Inspect the source
  2. claim 02Paperraft inference

    The paper reports a 10.1% relative improvement in average task success over the strongest adaptive-memory baseline, with 3.4x fewer context tokens and 2.1x faster inference.

    This is a Paperraft inference. It is not pinned to a verified PDF passage.

    Inspect the source

Exposure map

Author findings, Paperraft interpretations, and the next check. Missing analysis never counts as evidence of safety.

quality

Still unknown

Which tasks improve, and which regress against the baseline?

compute and memory

Still unknown

What memory, hardware, and total compute does the complete method require?

latency

Still unknown

Are startup time, typical response time, and slow requests measured separately?

operations

Still unknown

What must be monitored, maintained, and rolled back?

software compatibility

Still unknown

Does the implementation support your model, runtime, and hardware?

security

Still unknown

What new data access, permissions, or trust boundaries does it introduce?

data and training

Still unknown

What data preparation or training is required, and is it included in the cost?

reproducibility

Still unknown

Are code, versions, inputs, and evaluation scripts available?

Continue the investigation

A reading guide for memory and context.

Editorial prompts, not findings from this paper or a validated test plan. Detailed analysis is still pending for the topics below.

What to inspect

How are memories written, retrieved, updated, and deleted? Look for stale or contradictory information.

Plan a fair comparison

Can you compare full context, simple retrieval, and the memory layer using the same questions and context budget?

Questions for adoption

Does the cost include memory extraction and maintenance as well as answer generation?

Read the paper with these questions

Inside the paper

Preview the first 3 pages of the original PDF. Click the stack to turn the page.

The downloadable skill includes SKILL.md and evidence.json, with recorded findings and unanswered checks. TRY-IT.md adds a product test plan and a blank results sheet.

A reading aid for your agent. Findings still need validation.

Page 1 of 3
Open this page in the PDF ↗

Provisional research brief updated 2026-10-18. Paperraft has not reproduced this experiment.

Discuss this paper

Question a claim, compare interpretations, or share what happened when you tried the method.

Join the conversation on GitHub. Use this paper's arXiv ID in the title when starting a discussion.

arXiv 2609.39765

Comments are public and separate from Paperraft's research brief. When sharing a result, include the model, hardware, baseline and a link to your work.