One of the papers that’s grabbed my attention recently is “Idempotent Distributed Counters using a Forgetful Bloom Filter” by Rajath Subramanyam et. al. In it, the authors tackle a surprisingly tricky problem: how do you make distributed counters more accurate?
