Problems / RAG and retrieval, medium
The assistant stuffs 6,000 tokens of chunks into every prompt at 30 questions a second, against an 8-million-token-a-minute quota.
Free to open. Runs in your browser, no sign-up.
Success ≥ 99%, time to first token p99 ≤ 2.5 s.
30 requests a second for 30 seconds: 100% request (reads).
What each component does in this design, and what calls it. The simulator mimics each one from these settings.
| Component | Its job here | Settings |
|---|---|---|
| Load balancerLoad balancer | Traffic 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 service | Load balancer forwards to it.Calls Hybrid search, 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 |
| Hybrid searchHybrid search | AI app calls it.Hybrid search combines keyword matching (BM25) with vector similarity. | 400 slots · 2 steps |
| ModelLLM endpoint | AI app calls it.Latency has two parts: time to the first token, then a steady stream of tokens per second. | 400 streams · 8M input tokens/min |
Try it first. Open one hint at a time if you get stuck.
30 × 6,000 × 60 ≈ 10.8 million tokens a minute.
The instructions part is identical every time.
Prefix caching (or fewer, better-ranked chunks).