Making LLM context assembly programmable
Summary
RAMPART is a Python library that makes LLM context assembly programmable, allowing developers to register named blocks of context for placement before the model's first token. It improves performance by tens of percentage points on various models through block clustering and tool access control.
Similar Articles
RAMPART: Registry-based Agentic Memory with Priority-Aware Runtime Transformation
RAMPART is a compile-time memory model and in-RAM block registry for LLM-based agents that uses five composable primitives to manage context assembly with priority-aware ordering and eviction. Experiments across multiple 7-14B models show that block grouping, relevance gating, and schema eviction significantly improve task success rates and reduce prompt token costs.
@neural_avb: Shipping the latest fast-rlm fast-rlm lets your LLMs work inside a RLM harness, exploring massive contexts inside a REP…
fast-rlm is an open-source Python tool that allows LLMs to operate within an RLM harness for recursive subagent calls, with features like spend limits and live log streaming.
Built an agent loop where the LLM writes Python code to generate articulated 3D CAD models. You can pin a part to edit it
Built an agent loop where an LLM writes Python code to generate articulated 3D CAD models, with the ability to pin a part for editing.
@samhogan: RLMs pretty much solved context btw You can shove tens of millions of tokens into a good RLM harness and it just works.…
A developer shares their experience with Recurrent Language Models (RLMs), claiming they effectively handle extremely long context windows with tens of millions of tokens, representing a significant advancement in context handling capabilities.
@MaximeRivest: current llm architecture is stupid (if not stupid its, at least, wasteful). take these 3 prompts of 4 context chunks: […
A tweet criticizes current LLM architecture for wasteful recomputation due to order-dependent context, and proposes encoding context units separately to enable order-invariant, efficient caching and generation.