in which i keep my train-ride-sized solutions to gossip glomers. context: on 2026-03-07, i found myself on a train from copenhagen back home (actually, two main trains, 5h and 4h). i had okay internet, i was caffeinated, and had no work tasks. so i decided to do some dist sys exercises for one of the legs of the journey.
the names are a bit opaque, so here are the solutions for the chapters in order:
echouuidbroadcastgockfktat
i consider chapters 1-4 “fully solved”. chapter 5 is pretty fast, but could be faster (i outlined a plan in the go file, but didn’t get to it in time). chapter 6 is hard to verify, because maelstrom is a bit buggy there apparently, but i think i have a good grasp on 6a and 6b for sure, and am medium confident that my approach for 6c would hold up (but i’ve never implemented lamport clocks before, so who knows).
if you ask yourself why this code is so terrible: well, i wrote it by hand.
have fun!