---
title: "Subhashish (Subh) Bhattacharjee (@sbcharr) | Hashnode"
description: "Backend + Distributed Systems | Open Source Contributor. Read the latest articles by Subhashish (Subh) Bhattacharjee on Hashnode."
url: "https://hashnode.com/@sbcharr"
---

@sbcharr

# Subhashish (Subh) Bhattacharjee

@sbcharr · Bangalore, India · Joined September 2024

Backend + Distributed Systems | Open Source Contributor

### [High-Watermark in Distributed Systems: A Deep Dive with Apache Kafka](https://bytefreak.dev/high-watermark-in-apache-kafka?utm_source=hashnode&utm_medium=feed)

Learn how Apache Kafka's High Watermark works and why consumers never read unreplicated messages.

9 min read · [bytefreak.dev](https://bytefreak.dev/high-watermark-in-apache-kafka?utm_source=hashnode&utm_medium=feed)

[Mar 4](https://hashnode.com/posts/high-watermark-in-apache-kafka/69a7c3e556428acc6f36c555)

### [When Bloom Filters Fail: False Positives, Memory Trade-offs, Production Lessons](https://bytefreak.dev/when-bloom-filters-fail?utm_source=hashnode&utm_medium=feed)

How Bloom filters degrade silently in production: false positive explosion, memory trade-offs, and why observability matters more than configuration.

3 min read · [bytefreak.dev](https://bytefreak.dev/when-bloom-filters-fail?utm_source=hashnode&utm_medium=feed)

[Feb 11](https://hashnode.com/posts/when-bloom-filters-fail/698c0220360d11e059116d40)

### [Bloom Filter: Definitely No, Probably Yes](https://bytefreak.dev/bloom-filter?utm_source=hashnode&utm_medium=feed)

How Bloom filters optimize large-scale systems by using probabilistic data structures

5 min read · [bytefreak.dev](https://bytefreak.dev/bloom-filter?utm_source=hashnode&utm_medium=feed)

[Feb 3](https://hashnode.com/posts/bloom-filter/698214f176b643f26440b681)

### [Concurrency vs. Parallelism: A Coffee Shop Guide for Developers](https://bytefreak.dev/concurrency-vs-parallelism-for-developers?utm_source=hashnode&utm_medium=feed)

If you ask ten developers to explain the difference between concurrency and parallelism, you might get ten slightly different answers. It’s one of those fundamental concepts that is easy to grasp abstractly but tricky to visualize in practice. To und...

4 min read · [bytefreak.dev](https://bytefreak.dev/concurrency-vs-parallelism-for-developers?utm_source=hashnode&utm_medium=feed)

[Jan 22](https://hashnode.com/posts/concurrency-vs-parallelism-for-developers/69725908d9c6333b0e429e52)

### [From Modulo to Consistent Hashing: Optimizing Distributed Storage](https://bytefreak.dev/from-modulo-to-consistent-hashing-optimizing-distributed-storage?utm_source=hashnode&utm_medium=feed)

High-Performance Hashing Solutions for Scalable Storage Systems

8 min read · [bytefreak.dev](https://bytefreak.dev/from-modulo-to-consistent-hashing-optimizing-distributed-storage?utm_source=hashnode&utm_medium=feed)

[May 28, 2025](https://hashnode.com/posts/from-modulo-to-consistent-hashing-optimizing-distributed-storage/683712fca98cf378c876cc89)