Engineering on Lumex

Understanding the Byzantine Generals Problem

Wed, 03 Dec 2025 09:00:00 +0100

Introduction#

The Byzantine Generals Problem is a classic problem in distributed computing and systems design. It illustrates the challenges of achieving consensus in a distributed network where some components may fail or act maliciously. In this post, we’ll explore the problem, its implications, and how it relates to modern distributed systems.

The Problem Explained#

Imagine a group of Byzantine generals camped around an enemy city. They must agree on a common battle plan: either to attack or retreat. However, some generals may be traitors who will try to confuse the others. The challenge is to devise a strategy that ensures all loyal generals agree on the same plan, regardless of the actions of the traitors. The key conditions for solving the Byzantine Generals Problem are:

Building Interactive Components with React and Hugo

Thu, 13 Nov 2025 09:00:00 +0100

Introduction#

Static site generators like Hugo are fantastic for creating fast, SEO-friendly websites. However, sometimes you need interactive components that go beyond static HTML. In this post, I’ll show you how to seamlessly integrate React components into your Hugo blog.

Why Combine Hugo and React?#

Hugo gives you:

⚡ Lightning-fast build times
🔍 Great SEO out of the box
📝 Simple content management with Markdown

React adds:

Data Structures: Binary Search Trees with Go

Sun, 20 Sep 2020 00:00:00 +0000

In continuation of this exciting quest to learn more about data structures and algorithms. I will love to talk about binary search trees which builds on the knowledge last discussed on linked-list which is referenced from this book, you can find the post here.

Why Binary Search Trees?#

There are some data structures that allow a fast search or flexible update, but not both. An unsorted, doubly-linked lists support insertion in constant time O(1) but the search took linear time O(n) in the worse case. Sorted arrays support binary search which helps lookup in logarithm time O(logn), but at the cost of linear-time update.

Data Structures: Singly-Linked List with Go

Tue, 04 Aug 2020 00:00:00 +0000

From learning about Operating Systems, diving into some source code of Linux, seeing the data structures for p_threads, mutex, sockets etc. I have grown to appreciate data structures and algorithms, they are combined to build powerful computer systems and tools. So, I want to share my learning as I resume my study on data structures and algorithms again after a while.

Majority of my learnings so far are attributed to this book and there are some excerpts from it too.

Building a multipurpose CLI tool with Cobra and Go

Fri, 14 Feb 2020 07:15:42 +0100

I have always loved how Unix/Linux tools work when using them in the terminal. I had reasons to build a CLI tool with Python which I used to start up any project with Git initialized some time ago ws, it doesn’t do much. Recently, I got the inspiration to build a multipurpose unit-converter CLI tool taking the inspiration from Google’s unit converter, I had to move away from my terminal often to do some conversions and I thought if I had a tool that will avoid leaving the terminal and maintain my focus, this led to creating uconv.