It’s Tokens All The Way Down: How RLMs are Different
Summary
Kevin Madura’s session frames Recursive Language Models as a practical abstraction for context-heavy AI work: instead of treating an LLM call as the final step in a prompt chain, an RLM can recursively invoke language-model behavior as part of a composable program. The linked speaker profile and related DSPy material point to an enterprise-focused perspective, with Madura drawing from work at AlixPartners on real-world AI systems, DSPy, RLMs, and agent-native architectures. The supporting slides from his prior AI Engineer talk, “DSPy: The End of Prompt Engineering,” suggest this session is likely to emphasize moving beyond hand-tuned prompts toward declarative, testable, reusable AI programs.
The scheduled description positions RLMs as different from coding agents: useful where prompt engineering, custom scaffolding, or multi-step orchestration would otherwise add complexity. The core comparison is expected to be concrete rather than theoretical, covering where recursive model calls simplify implementation, where they introduce trade-offs, and how they compare on complexity, performance, latency, and token usage. The related video and transcript map should be treated as supporting context only, not as confirmation of this exact World’s Fair session recording.
Official Schedule Context
- Date/time: 2026-06-30 · 11:10am-11:30am
- Track/room: Context Engineering · Track 8
- Speaker(s): Kevin Madura
- Session type/status: session · confirmed
Official Description
Recursive Language Models represent an intuitive but distinctively important approach to how LLMs
handle context. The practical implications are bigger than they first appear. Tasks that would
traditionally require careful prompt engineering, custom agent scaffolding, or multi-step
orchestration collapse into surprisingly simple, composable programs. In this talk, we’ll cover what
makes an RLM distinct from a coding agent, explore where the abstraction shines and where it breaks
down, and walk through concrete use cases that are informed by real-world situations at scale. We’ll
see side-by-side comparisons to understand trade-offs in complexity, performance, time, and token
usage.
Related YouTube Video
DSPy: The End of Prompt Engineering - Kevin Madura, AlixPartners (speaker-match related prior/adjacent AI Engineer video; captions: English auto-captions).
Transcript Status
Related video transcript availability: English auto-captions. Treat this as supporting context, not a recording of this exact scheduled session unless later confirmed. Not fetched yet.
People
Notes
- Pending transcript synthesis when an official recording or confirmed matching video is available.
Supporting Slides
- youtube cKUW6n8hBU slides — extracted from the related public AI Engineer video.
Slide Evidence
- Slide-only cropped deck: youtube cKUW6n8hBU dense slides (12 viable slide images).
- Related slide/OCR pages:
- youtube cKUW6n8hBU dense slides
- youtube cKUW6n8hBU reconstructed slides
- youtube cKUW6n8hBU slides
- Slide-derived terms:
dspy,shares,document,attachments,program,total,python,sold,structured,code,were,find,allows,class,transactions,applying,step,sentiment