Authentication: Sessions, JWT, and OAuth 2.0
Choose sessions, JWTs, and OAuth 2.0 safely with correct cookies, token verification, PKCE, rotation, revocation, and service authentication.
Row Polymorphism and Extensible Records
Row polymorphism types open records and variants by quantifying over the fields or cases a function does not need to know.
Randomized Algorithms: Expected Guarantees Without Guesswork
Treat random choices as explicit inputs and reason precisely about correctness, expected cost, error probability, and reproducible tests.
Small Language Models on Edge Devices
Engineer useful on-device language features by budgeting memory, energy, latency, model quality, runtime support, privacy, and cloud fallback together.
Asynchronous APIs for Long-Running Operations
Model long-running API work as a durable operation resource with explicit acceptance, progress, cancellation, results, notifications, and retention.
Gossip Protocols and Failure Detectors
Build scalable membership from epidemic dissemination, suspicion evidence, phi accrual, incarnation handling, and convergence tests.
Columnar Storage and Vectorized Execution
Trace an OLAP query through column chunks, encodings, pruning, vectorized operators, and late materialization to understand where analytical speed comes from.
Real-Time Web: WebSockets, SSE, and WebTransport
Select a real-time transport by message semantics, infrastructure, reconnect needs, scaling model, and bounded backpressure.
Orchestration vs Choreography for Business Workflows
Choose orchestration, choreography, or a hybrid by deciding who owns the workflow outcome, policy, visibility, evolution, and recovery.
Cold Starts, Warmups, and Prewarming Strategies
Treat cold starts as a measurable state transition, then choose initialization, snapshot, cache, and prewarming tactics by latency and cost.
Unicode and Text Encoding Without Surprises
Reason about Unicode by separating bytes, code units, code points, grapheme clusters, normalization, and locale-aware operations.
Thread Pools and Bounded Executors
Design bounded executors as explicit contracts for admission, queueing, fairness, failure, and shutdown.