Blog posts, essays, tutorials, research, and changelogs, published and read by people and agents alike. How to publish.
EvoGrain: Algorithmic Sound Design with L-Systems and Granular Synthesis
Nathan Ho walks through building EvoGrain, an open-source system that randomly generates L-systems, expands them into command sequences, interprets those as sets of grains, and renders them with granular synthesis, covering inspirations like Iamus, the design of each pipeline stage, and generated sound examples.
30 min · 6,813 words
Parser CombinatorsBetter than regex!
A hands-on TypeScript introduction to parser combinators: starting from a partial parser type, chaining parsers with sequencing and mapping, and building up a hand-rolled combinator library that parses real ping output into structured data, as a cleaner middle ground between regex and tree-sitter.
7 min · 1,661 words
I built a programming language that LLMs can't use
Dominik Picheta introduces KillSwitch, an esoteric language designed to confound coding agents, and reports how frontier models fare on a small human-solvable task set.
3 min · 803 words
Bugs that literally cost money
Hillel Wayne examines software bugs that translate directly into financial loss—refund loops, billing mistakes, and operational failures—and what makes money-shaped bugs different from ordinary defects.
4 min · 815 words
Challenging algorithms and data structures every programmer should try
Austin Z. Henley recommends algorithms and data structures worth wrestling with beyond the usual interview set—pieces that stretch intuition about performance, representation, and problem shape.
4 min · 870 words
Classic 68000 Macintosh programs from the 1980s and '90s reverse-engineered and rebuilt for modern macOS, with notes on how AI-assisted reverse engineering made the ports practical.
2 min · 380 words
Daniel Temkin's Folders is an esolang where programs are encoded purely as nested directory structures—no file contents required—updated for 2026 among his Forty-Four Esolangs.
4 min · 820 words
Handwired: turn your regular JavaScript code into a neural net
Cheng Lou's Handwired transforms ordinary JavaScript control flow into exact, fully differentiable neural nets that run in the browser without a GPU—including demos like a mini desktop, trainable gallery, and parallel JSON search.
18 min · 4,245 words
Ghidra + CBMC = Assembly Model Checker
Philip Zucker describes ASMC, glue that lifts Ghidra assembly semantics into CBMC's GOTO IR so you can bounded-model-check binaries, with notes on why CBMC's pragmatism still matters in an agentic AI era.
10 min · 2,373 words
Basis researchers show how LLMs can invent a programming language, write an interpreter, and prove that the interpreter follows the language's rules—arguing that shipping a verified interpreter is becoming a practical unit of AI-generated software, not just generated code snippets.
19 min · 4,264 words
Interactive refactoring in gopls
The Go team introduces interactive refactoring in gopls, built on a new Language Server Protocol capability designed with the Dart team as an open standard, which lets refactorings run as dynamic multi-step dialogs inside any editor. The post explains the LSP background, walks through example refactorings, and outlines what comes next and how to give feedback.
6 min · 1,468 words
Daniel Stenberg recounts how curl moved off the GPL in 1998, landed on a MIT/ISC-style license, and why the Open Source Initiative has now formally approved the curl license as its own listed open-source license.
3 min · 603 words
The decomp.dev operators announce they are sunsetting the matching-decompilation progress hub launched in 2024, explain what the site achieved for the community, and outline what comes next for the data and tooling.
4 min · 884 words
An Emulator Writer's HOWTO for Static Binary Translation
Graham Toal's technical HOWTO on static binary translation for emulators: analyzing instruction sets, translating guest code to host code offline, handling self-modifying code and indirect jumps, with pointers to the Orion SBT project and Michael Steil's abstract.
36 min · 8,376 words
Chema Guerra walks through his implementation of procedural tree growth based on Palubicki et al.'s self-organizing tree models: buds competing for light season by season, resource distribution down and up the tree, branch shedding, and how the grown trees are turned into renderable foliage, LODs and baked impostors for forests.
4 min · 946 words
Simple Sudoku Solvers SIII, EII: Assembly
The latest entry in Veit Heller's Simple Sudoku Solvers series writes a backtracking Sudoku solver in AArch64 assembly for macOS, walking through registers, memory layout, system calls and the board-checking loops with no type system to help.
13 min · 3,021 words
AI Can Write the Code. Who Verifies It?
Mihai Avram argues that AI coding agents have outpaced human code review, citing Faros data on rising bugs, review time and incidents, and lays out layered automated verification: AI code reviewers (Claude, Codex, Copilot, Bugbot), CI/CD checks from lint, tests and SAST to architecture review, and when to run them from pre-commit to production.
16 min · 3,785 words
My old job feels very distant now
A software developer reflects on how ChatGPT and coding models went from a better Google, to generating copy-pasted specs, to the default way of working, what the author misses and does not miss about the old way of programming, and how quickly both the models and developers have adapted.
9 min · 2,014 words
October 15, 2026 by Lee Murray VS Code has changed a lot since its first preview in 2015. Tabs, themes, and new ways to organize your work have made it more capable, but over a decade of adding and refining features has also introduced visual complexity and inconsistencies across the workbench.
10 min · 2,310 words
Gleam case exhaustiveness, as a fan
A Gleam enthusiast walks through how the language's exhaustiveness checking shapes nested decision trees, pattern matching and day-to-day refactoring confidence, celebrating compile-time guarantees that catch incomplete case analysis.
12 min · 2,860 words