The article walks through the integration of durable Paxos with PaxosLease to arrive at a small master-based replicated state machine: Paxos decides the command log, PaxosLease decides who is allowed to append to it, and clients must discover the current master before submitting writes.

Continue reading

This post extends the simple Multi-Paxos implementation with disk persistence, ensuring acceptor promises and the replicated log survive restarts, and showing how log replay restores state after crashes.

Continue reading

This article extends the basic PaxosLease algorithm with practical lease renewal and explicit release semantics, showing a full working Python/Flask implementation and explaining why the protocol remains safe without disks or synchronized clocks.

Continue reading

This article introduces PaxosLease, a simplified Paxos variant that uses expiring leases instead of persistent values to enable fast, reliable master election in distributed systems.

Continue reading

This post builds a minimal Multi-Paxos system in Python with Flask HTTP endpoints, showing how repeated Paxos rounds form a fault-tolerant replicated log.

Continue reading

A straightforward explanation of Paxos using a simple Python Flask HTTP implementation to show how distributed systems achieve consensus in the presence of faults.

Continue reading

This article, following Lamport's work, extends the original Byzantine Generals algorithm from “oral-messages” to signed messages, showing how digital signatures drastically simplify the problem and reduce message complexity, with an implementation given in Python using Flask HTTP nodes.

Continue reading

This follow-up factors Lamport’s Byzantine Generals algorithm into a generalized class that's independent of I/O and payloads. Any node can initiate a round (be "king"), values can be arbitrary strings, and multiple rounds can run concurrently.

Continue reading

I discuss Lamport's Byzantine Generals problem and why it requires a total of N≥3M+1 nodes with M malicious nodes, and then implement the solution using Python with HTTP Flask servers.

Continue reading

This post shows how to implement the Ricart–Agrawala Distributed Mutual Exclusion algorithm with Lamport's logical clocks using HTTP Flask servers.

Continue reading

This post shows how to implement Lamport’s Bakery algorithm with Python HTTP Flask servers. The Python code is short and readable, helping newcomers grasp the algorithm’s logic without the syntactic overhead of C++. The asynchronous HTTP flow also generates plenty of overlap between workers, so the need for mutual exclusion is obvious. Exposing the variables through REST endpoints enables observation of ticket picking and critical section entry in real time, potentially making the flow of the algorithm easier to understand.

Continue reading

I built a simple Python-based Taboo game server using asyncio to provide a customizable multiplayer experience via Telnet.

Continue reading

I write a small library of unit tests for the message queue servers.

Continue reading

In this final post on the toy Python async message queue server implementation, I make further feature and code improvements.

Continue reading

I describe the concept of Marketing Mix Modeling using Google's LightweightMMM library.

Continue reading

I show how I used GNews and the OpenAI API to build GPT News Poet, a fun toy site showing silly AI poems based on today's news.

Continue reading

I try to get ChatGPT to write the codes in the previous posts. It's able to write the basic message queue skeleton, but cannot implement more complicated features such as delivery semantics with caching.

Continue reading

I write a somewhat more complicated, but still relatively simple async message queue server in Python.

Continue reading

I write a simple, bi-directional async message queue server in Python.

Continue reading

I use Doc2Vec to try to find pairs of similar API functions between Pytorch and Tensorflow.

Continue reading