Euclid's list that can't be finished
The proof that there are infinitely many primes doesn't construct a new prime — it constructs a number guaranteed to have a prime factor missing from any finite list. That distinction is the whole proof.
Software Engineer · 12 years
Building software that's fast, easy to use, and dependable — across the web, mobile and the JVM.
I build software for a living, aiming for the same thing every time: fast, easy to use, and reliably available. Mostly the web and Java, with a few years (2015–2018) on mobile. These days the work is web engineering, performant Java services and accessibility — plus platform, DevOps and a few lower-level languages, learned in the open.
Alongside that I keep notes: mathematics and physics worked through properly, computer science fundamentals revisited, and summaries of papers I've read. They all live under writing.
The proof that there are infinitely many primes doesn't construct a new prime — it constructs a number guaranteed to have a prime factor missing from any finite list. That distinction is the whole proof.
Before logic gates, before bits, there's a piece of doped silicon that only conducts when you tell it to. Working through why, from the lattice up.
What this site is for, and how the writing here is organised.
Updated Jun 2026
Pulled from GitHub and Codeberg at build time, so this never goes stale.