---
title: "Discussion on \"Split Brain Explained: When Two Nodes Both Think They Are Leader\" | Hashnode"
description: "Discussion on \"Split Brain Explained: When Two Nodes Both Think They Are Leader\". How network partitions create two leaders, why that produces irrecoverable data loss, and the quorum, fencing, and STONITH patterns that prevent it"
url: "https://hashnode.com/posts/split-brain-explained/69f6f8fd70548f09695b513b"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Split Brain Explained: When Two Nodes Both Think They Are Leader](https://abstractalgorithms.hashnode.dev/split-brain-explained?utm_source=hashnode&utm_medium=feed)

How network partitions create two leaders, why that produces irrecoverable data loss, and the quorum, fencing, and STONITH patterns that prevent it

May 3 · 22 min read · abstractalgorithms.hashnode.dev  
Updated Jun 18  
Read the article

-   [#system-design](https://hashnode.com/tag/system-design)
-   [#distributed-systems](https://hashnode.com/tag/distributed-systems)
-   [#split-brain](https://hashnode.com/tag/split-brain)
-   [#consistency](https://hashnode.com/tag/consistency)
-   [#raft](https://hashnode.com/tag/raft)
-   [#zookeeper](https://hashnode.com/tag/zookeeper)

## Written by

[Abstract Algorithms](https://hashnode.com/@abstractalgorithms)

@abstractalgorithms

  
[View profile](https://hashnode.com/@abstractalgorithms)

Exploring the fascinating world of algorithms, data structures, and software engineering through clear explanations and practical examples.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
