Proximity service: turning near into a lookup

One strong interview answer to "show me coffee shops within 2 km": a huge stale-ok read path split from a tiny write path, a 10 GB geo index replicated rather than sharded, geohash cells with a 9-cell search that beats the boundary problem, caching by cell, and freshness by change stream plus a nightly rebuild.