ReFold: Training-Free Reversible Inter-Turn Context Folding for Long-Horizon Agents

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 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.

recommendation

adopt

research area

memory and context

technical change

Reversible inter-turn context folding for agents

published

2026-10-06

The method is training-free, model-agnostic, and operates purely at the rendering layer, so a small team on a 24 GB GPU or third-party APIs can adopt it directly in an existing ReAct-style harness with reversible failure modes and quantified cost and memory reductions.

1. claim 01Paperraft inference
   Read the brief interpretation

   ReFold replaces predictive context-management methods (auxiliary model calls, heuristic rules, or trained compression policies) with a training-free rendering layer that stubs content already displayed in earlier turns and folds agent-reported-finished turns into one-line notes, using chunked rendering that rewrites the cached prefix only every few steps. It costs implementation effort in the prompt-rendering layer of the harness and occasional one-step restores from the preserved history when a removal proves wrong, plus minor prefix-cache rewrites at chunk boundaries. It can fail when the agent incorrectly marks a turn as finished and later needs its details, requiring restores that add latency, and the reported gains may not transfer to workloads with low inter-turn redundancy or non-ReAct harness structures.

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

   Inspect the source
2. claim 02Paperraft inference

   Reduces token consumption by up to 2.5x, halves KV-cache memory per session, cuts inference costs by up to 3.4x, and accelerates inference by up to 1.7x under concurrent serving, without degrading task success rates.

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

   Inspect the source