โ† Herald
cover

Sensei on the Road

Drive-time deep dives on system design, software engineering, and machine learning. One topic per episode, no code-reading required.

๐ŸŽง Subscribe via RSS

Blurring What Is Behind an Element Instead of the Element Itself

9:51

Sensei episode: Blurring What Is Behind an Element Instead of the Element Itself. Written for the ear.

Web02 Cutting A Shape Out Of A Rectangle The Browser I

13:11

Sensei episode: Web02 Cutting A Shape Out Of A Rectangle The Browser I. Written for the ear.

The Collapsible Panel That Needs No JavaScript at All

13:17

Sensei episode: The Collapsible Panel That Needs No JavaScript at All. Written for the ear.

Inodes and Why Deleting a File Does Not Free the Space

9:39

Sensei episode: Inodes and Why Deleting a File Does Not Free the Space. Written for the ear.

In03 Memory Management

13:01

Sensei episode: In03 Memory Management. Written for the ear.

In02 Cpu Scheduling

13:26

Sensei episode: In02 Cpu Scheduling. Written for the ear.

System Calls: The Only Door Between Your Code and the Kernel

12:55

Sensei episode: System Calls: The Only Door Between Your Code and the Kernel. Written for the ear.

Exactly Once Delivery: Why It Does Not Exist and What You Get Instead

9:24

Sensei episode: Exactly Once Delivery: Why It Does Not Exist and What You Get Instead. Written for the ear.

Backpressure: Why an Unbounded Queue Is a Hidden Outage

13:59

Sensei episode: Backpressure: Why an Unbounded Queue Is a Hidden Outage. Written for the ear.

Exponential Backoff and Jitter: Why Polite Retries Still Cause Outages

14:17

Sensei episode: Exponential Backoff and Jitter: Why Polite Retries Still Cause Outages. Written for the ear.

Circuit Breaker

13:24

Sensei episode: Circuit Breaker. Written for the ear.

LSM Trees and B-Trees: Why the Write Path Decides the Read Path

13:51

Sensei episode: LSM Trees and B-Trees: Why the Write Path Decides the Read Path. Written for the ear.

Bloom Filters

12:24

Sensei episode: Bloom Filters. Written for the ear.

Write Ahead Logging: Why Databases Write Everything Twice

13:07

Sensei episode: Write Ahead Logging: Why Databases Write Everything Twice. Written for the ear.

Erasure Coding Vs Replication

13:27

Sensei episode: Erasure Coding Vs Replication. Written for the ear.

What Is A Tombstone In Databases

14:06

Sensei episode: What Is A Tombstone In Databases. Written for the ear.

Multi Version Concurrency Control: Why Readers Never Block Writers

14:21

Sensei episode: Multi Version Concurrency Control: Why Readers Never Block Writers. Written for the ear.

Password Hashing: Why Encryption Is the Wrong Tool for Passwords

13:42

Sensei episode: Password Hashing: Why Encryption Is the Wrong Tool for Passwords. Written for the ear.

Mutual TLS

14:27

Sensei episode: Mutual TLS. Written for the ear.

JWT Security: What a Signed Token Cannot Tell You

13:54

Sensei episode: JWT Security: What a Signed Token Cannot Tell You. Written for the ear.

OAuth 2.0 vs OIDC

14:13

Sensei episode: OAuth 2.0 vs OIDC. Written for the ear.

Lb Vs Api Gateway

11:56

Sensei episode: Lb Vs Api Gateway. Written for the ear.

Voiced

15:13

Sensei episode: Voiced. Written for the ear.

Sharding and Partitioning โ€” System Design on the Road, Ep. 09

14:47

Sensei episode: Sharding and Partitioning โ€” System Design on the Road, Ep. 09. Written for the ear.

Idempotency โ€” System Design on the Road, Ep. 08

13:22

Sensei episode: Idempotency โ€” System Design on the Road, Ep. 08. Written for the ear.

Pacelc V2

12:14

Pacelc V2

PACELC โ€” The Trade-off You Make When Nothing Is Broken | System Design on the Road, Ep. 07

13:12

A successful write in Virginia and a successful read in Frankfurt one second later disagreed โ€” with no partition, no packet loss, and every dashboard green. That is the gap CAP cannot explain and PACELC fills. CAP only describes the choice you make during a network fault, which is rare. PACELC adds the clause that governs the other 99.9% of your system's life: if there is a Partition, choose Availability or Consistency; ELSE, choose Latency or Consistency. Because consistency is not a property you have โ€” it is coordination you pay for, and coordination costs a round trip you cannot argue with. Covered: โ€ข Why a healthy network still forces a trade-off (2 ms local ack vs ~90 ms cross-ocean) โ€ข The two-letter classification: Dynamo-style PA/EL, synchronous Postgres PC/EC, Spanner PC/EC โ€” and the hardware invoice behind TrueTime that people skip when they claim consistency is free โ€ข Why the choice is per operation, not per database โ€ข The consistency stack: eventual, the session guarantees (read-your-writes and monotonic reads, which sit side by side rather than in a queue), causal, and strong โ€ข The quorum inequality R + W > N as the dial you actually turn โ€” and why that is read-write overlap, not linearizability โ€ข Why choosing strong consistency everywhere out of caution can produce something less reliable than the eventually-consistent design you were afraid of Sequel to Ep. 02 (The CAP Theorem). Written for the ear. Hafs Ibrahim ยท Deep Systems ยท ๐• @hafs_darwish ยท github.com/hdarwish ยท herald.hafs.dev

Database Indexing โ€” System Design on the Road, Ep. 06

11:05

A 3 a.m. autopsy of a checkout latency cliff: why an unindexed query that was fast for two years fell off a wall overnight. B-trees vs binary trees and why disk pages shape the tree, selectivity and why the optimizer overrules your index, the write penalty every index charges forever, partial indexes, leftmost-prefix rules for composite indexes, covering indexes and index-only scans, and reading EXPLAIN ANALYZE.

Message Queues, Delivery Guarantees & Idempotency โ€” Why Exactly-Once Is a Lie

7:17

Your payment service charged the card twice and nothing failed. This episode takes apart asynchronous messaging: why a queue is a mailbox not a phone call, the three delivery guarantees (at-most-once, at-least-once, exactly-once), why exactly-once delivery across a network is provably impossible, and how idempotent consumers with a stable dedupe key solve it for real. Written for the commute โ€” no diagrams, just intuition. Sensei โ€” System Design on the Road, Ep. 05.

Caching โ€” The Fastest Request Is the One You Never Make

5:48

Sensei breaks down caching for the commute: why the fastest request is the one you never make, the cache-aside pattern, and the truly hard part โ€” cache invalidation and staleness. TTL, write-through, and delete-on-change as freshness-vs-speed trade-offs, anchored in feeds, CDNs, and real systems. System Design on the Road, Ep. 04.

Rate Limiting: The Token Bucket

6:30

How systems protect themselves when one caller floods them. The token bucket and leaky bucket algorithms explained for the ear, plus the hard part nobody mentions: keeping the counter honest across many servers. System Design on the Road, Ep. 3, narrated by Sensei.

The CAP Theorem

6:22

A commute-learning episode on the CAP theorem: consistency, availability, and partition tolerance โ€” why you can only hold two during a failure, and how real engineers decide which to sacrifice. Written for the ear. Sensei โ€” System Design on the Road, Ep. 2.

Consistent Hashing โ€” System Design on the Road, Ep. 01

6:57

Why plain modulo hashing wrecks your cache when servers change, how the hash ring fixes it, and why virtual nodes matter. Written for the ear.

Q Learning And Exploration

8:29

Sensei episode: Q Learning And Exploration. Written for the ear.

Mdp And Bellman

13:53

Sensei episode: Mdp And Bellman. Written for the ear.

t-SNE and How to Misread a Cluster Plot

13:24

Sensei episode: t-SNE and How to Misread a Cluster Plot. Written for the ear.

PCA and What Eigenvectors Actually Mean

13:33

Sensei episode: PCA and What Eigenvectors Actually Mean. Written for the ear.

DBSCAN: Clustering Without Choosing k

13:39

Sensei episode: DBSCAN: Clustering Without Choosing k. Written for the ear.

Kmeans And Initialization

13:48

Sensei episode: Kmeans And Initialization. Written for the ear.

XGBoost: Why Making Every Step Weaker Wins

13:19

Sensei episode: XGBoost: Why Making Every Step Weaker Wins. Written for the ear.

Boosting vs Bagging: Why the Method That Studies Its Mistakes Sometimes Loses

14:02

Sensei episode: Boosting vs Bagging: Why the Method That Studies Its Mistakes Sometimes Loses. Written for the ear.

Naive Bayes: Why an Assumption That Is Wrong Still Classifies Correctly

14:20

Sensei episode: Naive Bayes: Why an Assumption That Is Wrong Still Classifies Correctly. Written for the ear.

k-NN and the Curse of Dimensionality

13:47

Sensei episode: k-NN and the Curse of Dimensionality. Written for the ear.

SVMs and the Kernel Trick โ€” AI Concepts Decoded, Ep. 05

13:44

Sensei episode: SVMs and the Kernel Trick โ€” AI Concepts Decoded, Ep. 05. Written for the ear.

Bias, Variance, and Random Forests

14:15

Sensei episode: Bias, Variance, and Random Forests. Written for the ear.

Decision Trees Are Not Interpretable: What Entropy Actually Optimises

14:04

Sensei โ€” AI Concepts Decoded

Logistic Regression and Cross-Entropy โ€” AI Concepts Decoded, Ep. 02

13:06

Why squashing a linear model is the easy half of the fix, and squared error is the real bug. Log-odds, cross-entropy as negative log-likelihood, the gradient that collapses to prediction minus label, perfect separation, and why the threshold is never the model's job.

Gradient Descent and Linear Regression โ€” AI Concepts Decoded, Ep. 01

11:18

Why data never picks your model, how least squares turned an infinite search into one number, and why the exact solution to linear regression is useless at scale. From Gauss recovering a lost asteroid to gradient descent in a ravine.