@kiwu@twtxt.net evening!!!
@movq@www.uninformativ.de Haha 😆
I cleaned up all my of AoC (Advent of Code) 2025 solutions, refactored many of the utilities I had to write as reusable libraries, re-tested Day 1 (but nothing else). here it is if you’re curious! This is written in mu, my own language I built as a self-hosted minimal compiler/vm with very few types and builtins.
I finished all 12 days of Advent of Code 2025! #AdventOfCode https://adventofcode.com — did it in my own language, mu (Go/Python-ish, dynamic, int/bool/string, no floats/bitwise). Found a VM bug, fixed it, and the self-hosted mu compiler/VM (written in mu, host in Go) carried me through. 🥳
@movq@www.uninformativ.de I shrank Day 9 Part 2 from “cover the whole map” to “only track the interesting lines.” By compressing coordinates to just the unique x/y breakpoints, the grid got tiny. I still flood-fill and do the corner-pair checks, but now on that compact grid with weighted prefix sums for instant rectangle checks. Result: far less RAM, way less CPU, same correct answer.
Day 9 also required some optimizations, if you aren’t careful, you end up with really inefficient algorithms with time/memory complexity beyond what a typical machine has 🤣
Ooops, I’ve run into a bug or limitation with mu for Day 9 🤔
Day 7 was pretty tough, I initially ended up implementing an exponential in both time and memory solution that I killed because it was eating all the resources on my Mac Studio, and this poor little machine only has 32GB of memory (I stopped it at 118GB of memory, swapping badly!), This is what I ended up doing before/after:
- Before: Time O(2^k · L), memory O(2^k), where k is the number of splitters along a reachable path and L is path length. Exponential in k.
- After: Time O(R·C) (or O(R·C + s) with s split events), memory O©, where R = rows, C = columns. Polynomial/linear in grid size.
I just completed “Printing Department” - Day 4 - Advent of Code 2025 #AdventOfCode https://adventofcode.com/2025/day/4 – Again, I’m doing this in mu, a Go(ish) / Python(ish) dynamic langugage that I had to design and build first which has very few builtins and only a handful of types (ints, no flots). 🤣
I just completed “Lobby” - Day 3 - Advent of Code 2025 #AdventOfCode https://adventofcode.com/2025/day/3 – Again, I’m doing this in mu, a Go(ish) / Python(ish) dynamic langugage that I had to design and build first which has very few builtins and only a handful of types (ints, no flots). 🤣
@shinyoukai@neko.laidback.moe Funny you should say that, I designed a new Prolog(ish) Symbolic Reasoning Engine and DSl over the holidays 🤣
mu only supports ints? 🤔 I'm not sure if I'll need flots for this year's AoC? 🤔
Let’s see 😂
Did I mention mu only supports ints? 🤔 I’m not sure if I’ll need flots for this year’s AoC? 🤔
I’m having to write my own functions like this in mu just to solve AoC puzzles :D
fn pow10(k) {
p := 1
i := 0
while i < k {
p = p * 10
i = i + 1
}
return p
}
I just completed “Gift Shop” - Day 2 - Advent of Code 2025 #AdventOfCode https://adventofcode.com/2025/day/2 – But again, I’m solving this in my own language mu that I had to build first 🤣
I just completed “Secret Entrance” - Day 1 - Advent of Code 2025 #AdventOfCode https://adventofcode.com/2025/day/1 — However I did it in my own toy programming language called mu, which I had to build first 🤣
That’s the right answer! You are one gold star closer to decorating the North Pole. [Continue to Part Two]
Whoo! Making progress! With AoC 2025 solutions implemented in my own toy language 🤣
Ahh that’s because I forgot to call main() at the end of the source file. mu is a bit of a dynamic programming language, mix of Go(ish) and Python(ish).
$ ./bin/mu examples/aoc2025/day1.mu
Execution failed: undefined variable readline
Come back from my trip, run my AoC 2025 Day 1 solution in my own language (mu) and find it didn’t run correctly 🤣 Ooops!
$ ./bin/mu examples/aoc2025/day1.mu
closure[0x140001544e0]
And I’m back from my holidays! 🥳 Back to work boo 😒
@bender@twtxt.net agreed
@aelaraji@aelaraji.com probably a bug on my end with the bridge. I’ll figure it out with your help when I get home from my holidays.
@bender@twtxt.net that’s kind of what I was getting it initially yeah
@movq@www.uninformativ.de this is brilliant!
@movq@www.uninformativ.de @zvava@twtxt.net I think people get sick of everything changing all the time and so don’t bother adopting things to change when things are already good enough 🤷
@movq@www.uninformativ.de I think WebP being new just hasn’t seen widespread adoption everywhere (yet) 🧐
i’m always open to suggestions: PRs also welxome 🤣



Went to Ba Na Hills today, but honestly it was so cold and misery i couldn’t take very good photos 🤣 Here’s a few shots i managed!
@movq@www.uninformativ.de BahahahGG 🤣🤣🤣
@klaxzy@klaxzy.net do you know what I also find equally just as stupid and dumb is having to upgrade the software license on something just to be able to get OIDC or OAuth support ffs 🤦♂️
can somebody please transcribe what he said and post it here? 🙏 I think it’s too good just to waste in a video it needs to be preserved. 🤣
Need to fix:
- threads
-media and links
We’ll all my posts are making it to the “Fediverse” https://bridge.twtxt.net/users/c350a5e5fb9d9457
@bender@twtxt.net i’m just pointing out that it’s one of those fundamental RS 232 standards that will never die 🤣
@movq@www.uninformativ.de I think even modern PC still come with serial ports they just don’t wire them up anymore right? They’re still there in the board itself, though just unwired.
This is an example of the kind of garbage release notes from this conventional commit autogenerated crap 🤣

This ☝️ I proxy my SSH traffic and it requires a valid account check to occur.
@lyse@lyse.isobeef.org I couldn’t agree more! I think good commit messages are very useful, however, and I’d much prefer the conventional mood style for Commit messages, but rather prefer telling a story rather than this weird syntax all over the shop!
I kind of hate conventional commit messages: https://www.conventionalcommits.org/en/v1.0.0/#summary
but I am loving reading RFC 2119: https://www.ietf.org/rfc/rfc2119.txt
@movq@www.uninformativ.de Haha 🤣
Confirmed it’s called Tao Tao 🤣
@itsericwoodward@itsericwoodward.com Aren’t yhere onlu 12 puzzles this year? 🧐
