Accelerating Language Model Workflows with Prompt Choreography
TJ Bai, Jason Eisner
TL;DR
Prompt Choreography introduces a dynamic, global KV cache to accelerate multi-agent LLM workflows by allowing each call to attend to a reordered subset of previously encoded messages. The framework supports parallel decoding and efficient position management via RoPE-based rotations and on-the-fly attention masking, reducing redundant re-encoding. While the caching strategy can cause information blockage or leakage, the authors demonstrate that lightweight parameter-efficient fine-tuning (LoRA) can restore baseline or superior accuracy across representative tasks on MATH, while delivering substantial speedups (TTFT 2.0–6.2×, E2E up to 2.2×). The work also provides a reference API and implementation notes to facilitate integration into production systems, with careful attention to potential privacy and ordering effects. Overall, Prompt Choreography offers a practical path to faster, scalable LLM workflows by reusing dynamic context across agents without compromising isolation where needed.
Abstract
Large language models are increasingly deployed in multi-agent workflows. We introduce Prompt Choreography, a framework that efficiently executes LLM workflows by maintaining a dynamic, global KV cache. Each LLM call can attend to an arbitrary, reordered subset of previously encoded messages. Parallel calls are supported. Though caching messages' encodings sometimes gives different results from re-encoding them in a new context, we show in diverse settings that fine-tuning the LLM to work with the cache can help it mimic the original results. Prompt Choreography significantly reduces per-message latency (2.0--6.2$\times$ faster time-to-first-token) and achieves substantial end-to-end speedups ($>$2.2$\times$) in some workflows dominated by redundant computation.
