This is a continuation of “Pest” v. 0xFC. This is the heaviest revision of the spec to date, approaching a total rewrite. Pedantic details concerning data types and their encodings were added; several algorithms have been reworked and substantially simplified; and a number of ugly gaffes — corrected. There is a pretty-printed mirror of this […]

This is a continuation of “Pest” v. 0xFD. There are currently two published prototype implementations of Pest: “Blatta” (by thimbronion); and “smalpest” (by jonsykkel). Thank you, prototype implementers! A quite lively Pestnet is now active, and a public log thereof, operated by billymg (WOT) may be seen here. There is a working draft of v. […]

This is a continuation of “Pest” v. 0xFE. There is a pretty-printed mirror of this page. There is now a prototype! (Thank you, thimbronion!) 14 Dec 2021: And there is now a second prototype! (Thank you, jonsykkel!) There is a working draft of v. 0xFC. (Note: it may change without warning!) The document (very much […]

This is a continuation of “Pest” v. 0xFF. Edit: A note for the innocent — this series of articles concerns an algorithm! It is not, at the time of writing, fully implemented anywhere! There is now a prototype! (Thank you, thimbronion!) Or even entirely complete. Edit: There is a working draft of v. 0xFD. (Note: […]

What follows is a long-promised detailed specification of a DDOS-proof, CPU-inexpensive, ciphered-authenticated peer-to-peer communication protocol. I would like to thank Thimbronion for implementing a large subset of this spec already despite not having seen it yet! The document (very much a work in progress!) is available as a vtree. You will need: A V-tron. If […]

I have recently built two new WWW mirrors containing certain publicly-available software: 1. Historic Gentoo Distfiles. I have been using Gentoo for nearly all Linux-related work since 2007. It was “the lesser of evils”: to my knowledge, no other Linux variant ever offered a comparable level of rodenticidal control, while at the same time providing […]

A half-written draft of this piece has been living on my HDD for nearly half a year. Recent discussions re: the subject of “aging and death of PC irons” prompted me to dust it off and quickly post. Regularly-scheduled programming will resume shortly… “The tools, the means and the methods disappear under the overwhelming dead […]

This article is a continuation of the previous, and concludes the series. Let’s try this somewhat different variant of the program, which represents recurring bits of the expansion symbolically (and in a slightly more readable form) : ;; Register bitness. (defconstant +bitness+ 32)   (defun make-reg (reg-name bitness) "Make algebraic representation of a register (bits […]

This article is a continuation of the dig into the key schedule of the Serpent cipher. For clarity, we will omit the routines already given in the previous article. Let’s visualize the Serpent key schedule as a graphic: ;; 256bit(key)+1(const) x 4224(132*32) matrix, last column for constant subterms (defvar *matrix* (make-array ‘(257 4224) :element-type ‘(mod […]

This article is a continuation of the recent mega-puzzler concerning the experiment. This variant will reduce the equations. We will omit printing the input matrix, for brevity. And so: ;; Register bitness. (defconstant +bitness+ 32)   (defun flatten (l) "Flatten a tree." (cond ((null l) nil) ((atom l) (list l)) (t (mapcan #’flatten l))))   […]