Problems / RAG and retrieval, medium

Conversational memory on every turn

A chat assistant keeps long conversations within the context window by summarising older turns with a small model before every answer. The summariser has 12 slots at about half a second; 40 turns arrive a second.

Unlock it once for 15 credits; everything inside it is free (runs, changes, Submit, results, hints). Sign in with Google to start; new accounts get free credits.

Your goals

Success ≥ 99%, time to first token p99 ≤ 2.5 s.

Test cases

Like a coding problem, a solution has to pass every case, not just the one it was built for. Submit in the lab runs all 4; 1 of them are hidden until then.

  1. As given. The problem’s own traffic, scheduled failures and seed.
  2. A slow dependency. The main data store or model answers twice as slowly for part of the run.
  3. A server dies. One replica of the service with the most replicas is killed for part of the run.

The traffic

40 requests a second for 30 seconds: 100% request (reads).

The system

What each component does in this design, and what calls it. The simulator mimics each one from these settings.

ComponentIts job hereSettings
Load balancerLoad balancerTraffic enters here.Calls AI app.Layer 4 balancers route by IP and port; layer 7 balancers read HTTP and can route by path or header.–
AI appApp serviceLoad balancer forwards to it.Calls Memory summariser, Model.Little's law: throughput ≈ concurrency ÷ latency. 200 slots at 50 ms serve about 4,000 req/s.3 replicas × 500 slots · timeout 30 s
Memory summariserMemory summarizerAI app calls it.Summarising older turns keeps long sessions inside the context window.12 slots · 1 steps
ModelLLM endpointAI app calls it.Latency has two parts: time to the first token, then a steady stream of tokens per second.2000 streams

More rag and retrieval problems