Introduction to package management, how to solve the dependency hell

This article introduces to the challenge of managing software packages that rely on conflicting versions of libraries. It explores whether this unresolved issue has a single superior solution, outlines three major algorithmic approaches with their real-world trade-offs, and will perhaps provide code snippets to give context to students on how these systems work and operate on their own computers.

From Userland to Bare-Metal: Rendering pixels without a display server via DRM/KMS

The goal is to demystify the low-level Linux graphics stack by taking direct control of the graphics card to draw on the screen from a TTY.

Why standard linux binaries crash on NixOS

An exploration of why standard Linux binaries crash on NixOS due to FHS and dynamic linking differences, and a comparative guide on how to run them using patchelf, nix-ld, and mount namespaces.

Writing a simple MBR Bootloader in Assembly

This article explains how the x86 boot process works by building a minimal MBR bootloader in NASM from scratch, using it to walk through some of the BIOS’s constraints and some key boot concepts.

RS-485 in Noisy Industrial Environments: Why Plain UART Isn't Enough

A UART link that works perfectly on a breadboard can fall apart the moment it meets a motor, a switching power supply, or a few meters of cable. This article explains why, and walks through the hardware and firmware needed to build a robust RS-485 link, using a vibration-test bench from my internship as a running example.

10 000 connexions, un seul thread : comment epoll a résolu le problème C10K

Le but de cet article est de vulgariser et d’expliquer pourquoi le modèle historique « un thread par connexion » s’effondre à grande échelle, pourquoi ses premiers remplaçants select et poll ne suffisaient pas, et surtout comment epoll fonctionne réellement, jusque dans les structures de données du kernel.

À l'intérieur d'un solveur CP-SAT : comment on résout un planning sous contraintes

Un deep dive sur les solveurs CP-SAT (hybride SAT + programmation par contraintes + branch-and-bound), illustré par un scheduler réel développé pour LATEB (le planning des staffs bénévoles de ses soirées).

Kernel bypass networking: why HFT firms skip the Linux network stack

Why the standard Linux network path is too slow for high-frequency trading, and how kernel bypass removes that latency. With a walkthrough of a minimal AF_XDP receiver compared to a standard UDP socket.

Hijacking the Game Boy CPU from inside Pokemon Red

Turning the Pokemon Red item bag into code the CPU will execute.

Lapse: the AIO Kernel Exploit Behind the PS5 Jailbreak

Dive into the privilege escalation path from a userland WebKit exploit to kernel space through the Lapse AIO vulnerability that allows us to Jailbreak a PS5.