The Shape of Duplicate DetectionDuplicate detection looks like a solved problem: use a hash set. A benchmark suite of 4050 measurements across finite batches and streaming workloads shows the fastest strategy can be 148x faster than a hash set, or 90,000x slower, depending on what you are deduplicating and what guarantees you need.
A guided reading path through vector search and semantic retrieval: what vector databases are, how ANN search works, and how to build and optimize a Vamana index in C++.
Benchmark-backed performance engineering across Go and C++: profiling with pprof, cache-friendly data layout, duplicate detection, Kafka throughput, and zero-JS web speed.
Why You Should Never Use a setstd::unordered_set looks like O(1), but in hot C++ loops the memory access pattern can dominate. Here is a duplicate-filtering benchmark with dense ids, sparse ids, Boost dynamic_bitset, sort+unique, and the case where unordered_set wins.
5 min
What I Got Wrong Implementing Graph-Based Vector SearchA dev log about implementing a Vamana-style ANN index from the DiskANN paper, why my first version was slower than brute force, and what it taught me about reading algorithms with implementation in mind.
9 min
Optimizing My Hugo Blog: Journey to Zero JSI recently looked into my blog’s performance and was surprised to find my pages were downloading over 3.6 MB of JavaScript and render-blocking CSS on every load. Here is the step-by-step breakdown of how I reduced my payload and removed JavaScript.
