Problems / AI security and governance, medium
A web-search assistant retrieves pages that contain hidden instructions. 300 poisoned requests a second arrive alongside real users.
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.
Success ≥ 98%, block ≥ 95% of the injections.
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 6; 2 of them are hidden until then.
15 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 Web 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 |
| Web searchHybrid search | AI app calls it.Hybrid search combines keyword matching (BM25) with vector similarity. | 2000 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. | 3000 streams |