Chris Wellons (null program)
Unix "find" expressions compiled to bytecode
Author developed a bytecode compiler for Unix find expressions, which surprisingly performs better than the tree-walk interpreters used in real implementations.
4 articles published
Author developed a bytecode compiler for Unix find expressions, which surprisingly performs better than the tree-walk interpreters used in real implementations.
Claude AI autonomously solved Advent of Code 2025 puzzles using a web browser skill, working independently to read prompts and submit solutions.
Using 32-bit indexes instead of pointers saves memory, improves CPU cache efficiency, and boosts performance by reducing memory bandwidth bottlenecks.
A behind-the-scenes look at creating a nature documentary-style film about developers "working" during the holiday season.