Diagram of Cassandra nodes exchanging gossip messages.

How Cassandra Reaches Consensus Through Peer Gossip

A deep dive into Cassandra’s gossip mechanics, failure detection, and the way it underpins consistency guarantees.

May 16, 2026 · 8 min · 1667 words · martinuke0
Short description of the cover image subject.

How Idris Encodes Domain Logic in the Type System

Idris’s dependent types let you model domain constraints as types, catching rule violations before the program runs. This post walks through the concepts, concrete examples, and practical trade‑offs.

May 16, 2026 · 7 min · 1398 words · martinuke0
Diagram of a CPU with multiple memory layers: registers, L1/L2 caches, DRAM, SSD.

What Memory Layers Cost in Effective Access Time

A deep dive into the cost of memory layers, showing how caches, RAM, and storage affect overall latency and how to model them accurately.

May 16, 2026 · 9 min · 1737 words · martinuke0
Diagram of PACELC trade‑offs in a distributed system.

What the PACELC Theorem Reveals About Distributed Consistency

An in‑depth look at PACELC, its components, and practical implications for building consistent, low‑latency distributed systems.

May 16, 2026 · 7 min · 1330 words · martinuke0
Diagram of overlapping database snapshots representing row versions.

The Hidden Tradeoffs of Row Versioning in Modern Databases

Row versioning powers snapshot isolation but brings hidden costs. This article uncovers those tradeoffs and offers practical mitigation tactics.

May 16, 2026 · 7 min · 1424 words · martinuke0
Feedback