Blue coastal elites think they know what hedonism is but they've never spent time in the burbs with a guy smoking a brisket next to his above ground pool
Michael Bacarella
@michael.bacarella.com
Founder GPShopper (successful exit) ex-Jane Street (pre-SBF) ex-Google (pre-Sundar) occasional shitpoaster
I've worked inside of datacenters, been in charge of datacenters, been in planning meetings to build new datacenters and I cannot parse a single thing this web site believes about datacenters. Your rallying cry is datacenters. Datacenters. Okay.
if you think people posting AI slop PRs to github is bad, wait until you see all of the issues/feature requests people post that 5 minutes with an AI tool could solve
your strict statically typed memory safe language pales in comparison to my language, which recruits the OS to tell me about bugs by sending my application signal SIGSEGV
my dishwasher's firmware updates are cryptographically signed but the power grid runs on Windows XP
datacenters are misunderstood. maybe if the general public could spend some time in these loud, dark, cold, cavernous rooms on big campuses with endlessly long rows of computers that look nothing like the computers they have ever interacted with and
the antichrist says "that seam is load-bearing" and the audience nods in unison and says "yes"
I still regularly think about that guy that would solve each week's projecteuler.net problem first, and his posted solution is in pure assembly.
About - Project Euler
A website dedicated to the fascinating world of mathematics and programming
projecteuler.net
historical aside: in OCaml, Lwt won out over Async because the guys at INRIA adamantly insisted any successor concurrency library run on their Windows workstations
We had a good thing you stupid son of a bitch. We had COBOL, mainframes, a steady paycheck. Everything we needed. Ran like clockwork. But no, you had to be the man. Too good for unions. Now a model does your job. You and your pride and your '10x engineer' ego.
Capturing a dictator whose legitimacy collapsed to the point that his opposition won a Nobel Peace Prize is good, actually
Advent of OCaml, day 12 👹 **SPOILERS** This ended up being a troll problem. You could get to work like a sap, do some best-fit bin packing heuristic and it'll take 1000 CPU minutes (✋) Or you can ignore geometry entirely and pick trees whose area >= max-present-size * number-of-presents 🤦♂️
Advent of OCaml, day 11, solved! 😼 A welcome reprieve from yesterday. Today's solution can be solved quickly with "merely" coding interview level DFS graph search with memoization.
Advent of OCaml, day 10, part 1 😩 You know it's getting grim when people are posting just their part 1 solutions. Took about 4 minutes of CPU to brute force. I'm sure someone has a cute number theory solution on r/adventofcode that takes 1ms for the whole thing.
Advent of OCaml, day 9 These are starting to take too long to solve! 😅 Part 1 done (after a fun misstep trying to allocate a 100M element array...) Part 2 seems... non-trivial. Might have to throw in the towel so I can do, like, other stuff today.
Advent of OCaml. day 8 By far the hardest yet. Both in terms of time to code but also it pegged my CPU for about 2 seconds to compute the answer 😱
Advent of OCaml, day 7, solved 🥵 This one threw me for a bit but once I drew the path finding out on paper and stared at it for ... uhm, 40 minutes I got it. Even though this is mostly imperative, I contend you still have edge using OCaml when it comes to understanding state machine transitions.
Advent of OCaml, day 6, done (🙀) This one was quite mind numbing. It reminds me of processing those nasty "grid oriented" EDI order/sales formats that were popular as late as the 1990s I'm sure COBOL programmers would feel right at home with this one.
Advent of OCaml, day 5 done Whew. Getting the details right on this one took forever. Happy that the naive brute force solution (just construct a set in memory of the ingredients) couldn't be done and it required a bit more thinking.
Advent of OCaml, day 4, solved wasted about 20 minutes trying to understand what "eight adjacent positions" meant, squinting at only the row instead of realizing it meant also the cells above and below of course
Advent of OCaml day 3 solution: donezo Pleasantly, part 1 and part 2 have similar enough algorithms that you can get away with tweaking only one variable (digits_needed). github.com/mbacarella/o...
Advent of OCaml day 2 solution in the bank! Spent about an extra hour spinning my wheels because I skimmed the requirements and I kneejerk thought it wanted the part 2 style digits scheme. Which it does, but that doesn't get you past part 1! All solutions here github.com/mbacarella/ocaml-aoc2025
(* Vishnu: creating form *) let v = B (3, 4) (* Shiva: dissolving form *) match v with | B (x, y) -> x + y
(with apologies to Philip Greenspun) any sufficiently complicated description of an implementation by a Turing-machinist will eventually lapse into a half-coherent rediscovery of lambda-calculus
I had this stress dream last night where we were trying to catch a flight and when we got to the security line it turned out the tickets I printed out just had a big database connection error message printed on them. And attempting to install the app failed because I can't see my screen in dreams.
how to power up your github contributor graph 1. pick favorite obscure programming language 2. build a really simple app, like a web photo album 3. find that the ecosystem libraries are missing tons of mundane features 4. submit PRs for all of these features useful? kinda. looks impressive? sure
how did Valve get away with making games on Linux work reliably? if Bill Gates was still running Microsoft he would have invited Gabe Newell into a smoke filled room and given him the speech from Network