7 System Design Algorithms to Know: Merkle Trees to CAP/PACELC
goyalshaliniuk · x · 2026-10-15
A rundown of seven algorithms that come up constantly in system design interviews:
- Merkle Tree – hash-based structure for verifying data integrity at scale
- Consistent Hashing – minimizes rehashing when nodes join or leave
- Read Repair – automatically fixes inconsistent data during reads
- Gossip Protocol – decentralized, efficient data propagation across nodes
- Bloom Filter – space-efficient membership checks, false positives but no false negatives
- Heartbeat – periodic signals to detect failures and ensure availability
- CAP/PACELC Theorem – trade-offs among consistency, availability, and partition tolerance
More from Infra
- Selling B300 inference nets $40/hr vs $6/hr rental — but the math is disputed — TheZachMueller · 2026-10-15
- ASML CFO says US Match Act restricting DUV sales to China would backfire — pstAsiatech · 2026-10-15
- ASML sold out through 2028 but stock dips 2%; TL20 index up 57% YTD — TiernanRayTech · 2026-10-15
- Bloomberg breakdown: a 1GW Texas AI data center may need nearly $3B for overruns alone — rohanpaul_ai · 2026-10-15
- MiniCPM-V 4.7 runs a 35B MoE multimodal model on phones with just 3GB memory — nevrekaraishwa2 · 2026-10-15
- Sipeed MaixStation product page goes live for edge AI dev — xlltt · 2026-10-15