Three staff-level finale paths
Weeks 103–108 pull the earlier work together. Each capstone traces back to specific weeks, and the final task is to explain and defend the design under pressure.
Mo's Algorithm over immutable trace segments · Weeks 103–108
A staff-level system design + coding capstone. Build the observability and forensics platform for a large multi-tenant LLM gateway, then answer exact batch forensic queries over immutable event segments with Mo's algorithm. The required algorithmic capstone.
- High-throughput ingestion, PII safety
- Immutable segments, watermarks, correction deltas
- Mo's algorithm + frequency buckets
- Exact vs approximate mergeability
- 24-point self-grading rubric
Euler Tour + DSU on Tree · Week 108 · optional
The optional Week 108 boss fight. If Capstone 1 was forensics over a flat log, this is forensics over a forest of agent execution trees. Combine systems design with tree algorithms for exact subtree queries.
- Forest assembly, reorder buffers, cycle detection
- Euler Tour to flatten subtree → range
- DSU on Tree (sack / keep-heavy)
- Reversible aggregates + mode tie-breaks
- Not required for the LLM Platform badge
OpenRouter-inspired control + request plane · Weeks 103–108 · alternative
An OpenRouter-inspired final capstone: design and build the control plane, request plane, routing policy, reliability layer, enterprise tenancy, and economics behind a unified multi-model AI gateway.
- One API → many models and providers
- Policy-compliant, explainable routing
- Stream-safe failover, idempotency, admission
- Append-only usage and cost ledger
- 24-point rubric, PII-safe observability