Architecting Log-Structured Merge Trees for Write-Intensive Distributed Databases
How modern distributed databases turn the write-amplification problem into a throughput advantage, and what it costs you on the read path.
How modern distributed databases turn the write-amplification problem into a throughput advantage, and what it costs you on the read path.
How RocksDB’s compaction strategies trade off write amplification, read amplification, and space amplification — and how to tune them for real workloads.
A field guide to running small language models locally on CPUs, NPUs, and modest GPUs. Covers INT4/INT8 quantization, structured and unstructured pruning, KV-cache tuning, batching, and how to measure what actually matters.
Build a production-shaped distributed rate limiter in Go and Redis using a token bucket algorithm. Includes runnable code, atomic Lua scripts, integration tests, and a roadmap to extend it for your CV.
How to design ledger systems that survive concurrency, partial failures, and audits. Covers double-entry invariants, event-sourced architectures, idempotency, and reconciliation patterns used in production.