JSCaml is a compiler for typed JavaScript, using OCaml as the target runtime.

Formal Reasoning About Programs, new book in the works by Adam Chlipala.

Fuzzing the OpenSSH daemon using AFL

APFS’s “Bag of Bytes” Filenames, this is of course the right way to do it.

Random Variate Generation in One Line of Code (PDF, 1996), classic.

libexact is a software library for solving combinatorial exact covering problems, using the Dancing Links algorithm.

Papercut, a NNTP server written in Python. This fork supports a Maildir backend.

Setting the root login’s ‘full name’ to identify the machine that sent email, clever.

Remember National Semiconductor’s Series 32000 Family

Bob Dylan: Q&A with Bill Flanagan

Virtual machine escape fetches $105,000 at Pwn2Own hacking contest, “members of Qihoo 360’s security team carried out the hack by exploiting a heap overflow bug in Edge, a type confusion flaw in the Windows kernel and an uninitialized buffer vulnerability in VMware”.

Happy 19th birthday, kottke.org!, congrats!

Co-dfns: Compiler Design and Architecture, YouTube video by Aaron Hsu. It’s 2h long, but really interesting.

The Key to a Data Parallel Compiler, by Aaron W. Hsu.

Codec 2 is an open source speech codec designed for communications quality speech between 700 and 3200 bit/s.

OCanren is a strongly-typed embedding of miniKanren relational programming language into Objective Caml

Analyzing the vintage 8008 processor from die photos: its unusual counters, by Ken Shirriff.

Attacking Nexus 9 with Malicious Headphones, by Roee Hay. WJW.

Autonomous Trap 001

Glitch Tarot

Deciding Parity Games in Quasipolynomial (PDF), by Cristian S. Calude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, and Frank Stephan.

A short proof of correctness of the quasi-polynomial time algorithm for parity games, by Hugo Gimbert and Rasmus Ibsen-Jensen.

Succinct progress measures for solving parity games, by Marcin Jurdziński and Ranko Lazić.

Multicollisions in Iterated Hash Functions: Application to Cascaded Constructions (PDF, 2004), by Antoine Joux. “We show that finding multicollisions, i.e. r-tuples of messages that all hash to the same value, is not much harder than finding ordinary collisions, i.e. pairs of messages, even for extremely large values of r.”

selfie, an educational software system of a tiny self-compiling C compiler, a tiny self-executing MIPS emulator, and a tiny self-hosting MIPS hypervisor. (And a RISCV port of that.)

Oberon 07, translates Oberon to JavaScript code ready to be run in web browser or nodejs.

Bracmat is software for exploration and transformation of uncharted and complex data, a programming language with powerful pattern matching.

The Other Half, Jason Scott had a major heart attack—for a week.

hypochondriapp, are you feeling well?

SNAKISMS, by Pippin Barr.