☕️ Uber cut AI costs with MCP servers

Hi there, this is your daily ☕️ DevShot.

In today's DevShot:

🔧 Uber cut AI costs with MCP servers

🌐 Microsoft open-sources TauGrid

🔀 Zed launches Delta

📊 TanStack Charts comes to TypeScript

⚡ C++23's flat_map beats std map on lookups

Plus: 🎁 6 other news you might like, 🛠️ 5 tutorials, 🧰 7 tools, and 📚 5 papers.

• Uber cut its per-session AI tool-schema costs to near-zero by routing over 1,000 MCP server interactions through a single gateway, dropping cost per 1,000 requests ~34% and cost per session ~52% from peak while keeping spend flat.
• The problem was schema overhead: with ~100 tools installed, definitions added 50,000-70,000 tokens to every prompt and got re-sent on each turn, since vendors bundle huge tool sets, one suite ships 49 tools needing ~22K tokens.
• Three fixes attacked it: CLI resolution lets the model invoke tools via shell without loading schemas, on-demand tool search pulls only relevant definitions, and code-mode batches sequences into one subprocess script, packaged as ~25 default "skills".

• Microsoft has open-sourced TauGrid, a cloud-native platform for managing, scheduling, and monitoring AI workloads on GPU-enabled Kubernetes clusters, letting researchers submit jobs without touching Kubernetes while platform teams handle queues, quotas, and observability.
• Written in Go, it defines workloads in a YAML file submitted with `tau run`, which validates the config and creates a Kubernetes Job or KubeRay RayJob, queued via Kueue by remaining quota and priority.
• TauGrid tracks status, logs, and checkpoints so failed jobs can resume, requires a cluster running 1.30+ with GPU nodes and Helm 3.0, and its roadmap includes PyTorch DDP/FSDP, DeepSpeed, LoRA/QLoRA, and multi-cloud execution.

• Zed has launched the public beta of Delta, a collaborative environment where developers and coding agents work, review and revise code together in shared threads instead of pull requests, available on macOS, Linux, Windows and browser.
• Delta's core unit is the thread, a running record linking the agent conversation to the files it edits; DeltaDB underneath captures individual edits and chat events as "deltas," adding history between Git commits rather than replacing branches.
• Zed has already disabled pull requests on Delta's own repo, where 33 developers landed 570 changes to main through threads; it still works with Git repositories and plans repository-based access using GitHub permissions.

• TanStack Charts has landed as a framework-agnostic, type-safe visualization library for TypeScript, already hitting roughly 160,000 weekly downloads despite still sitting officially in Alpha with no stable API promise.
• Instead of fixed chart types, you compose marks, scales, channels, transforms, and layers via a grammar-of-graphics API, with inferred types staying tied to your source rows and adapters for React, Vue, Solid, Svelte, Angular, Lit, and more.
• A basic React line chart weighs about 29 kB gzipped and the suite sits around 38-45 KiB, undercutting Chart.js, Observable Plot, and ECharts, though the docs warn it suits simpler charts over heavy real-time datasets.

• C++23's `std::flat_map`, available in GCC 15's libstdc++ and LLVM 20's libc++, stores sorted key and value vectors queried by binary search, and benchmarks show it often beats `std::map` for lookups and bulk construction.
• On random lookups over 1M elements it ran ~150ns versus ~390ns for `std::map`, and range construction hit ~72ns against ~316ns, since two contiguous arrays cut memory overhead and improve locality.
• The catch is mutation: inserting millions of random keys one at a time scales quadratically and becomes far worse than `std::map`, though sorted-order inserts, `insert_range` bulk merges, and disk serialization via `memcpy` stay fast.