CAP theorem, consistency models, and building reliable large-scale systems.
One agent, one context window, one serial loop — until it stalls at 40 minutes and 180K tokens. The orchestrator pattern fans work out to isolated sub-agents in parallel, then synthesizes. Here's the backend, in compiling Go.
Kafka producer configuration: acks, idempotence, batching, compression, and the tradeoffs that matter for throughput and durability.
Adding one cache server shouldn't invalidate every key. Consistent hashing with virtual nodes and bounded loads — full Go and Java implementations.
Probabilistic drop rate limiting: uncoordinated enforcement bypassing Redis for 1M+ RPS with zero coordination overhead.
Why exactly-once is a myth, and how idempotency keys, database constraints, and the outbox pattern make retries safe in Go and Java.
When to decompose a monolith, how to define boundaries, and the patterns that work: API gateways, sagas, and event-driven comms.
Kafka vs RabbitMQ vs NATS vs SQS: delivery semantics, ordering, throughput, ops complexity, and a decision framework with Go code.
Reliable event-driven Go beyond connecting to Kafka: handling partial failures, duplicates, and distributed transactions safely.
Five rate limiting algorithms, their trade-offs, how to distribute them across a fleet, and client-side backoff that works.
Circuit breakers, bulkhead isolation, timeout propagation, and idempotent retries in Go — the patterns for surviving component failures.