Reader David Gregory has achieved, via some clever cross-compilation magick, a working FFA port for DOS (mirror).

This post concerns the “MacIvory” Model 3 Lisp Machine. It is of interest strictly to bolixologists. This is a recipe for a working replacement of an ancient SCSI HDD, such as found in the MacIvory, with an inexpensive solid-state disk. You will need: A “SCSI2SD” device. Mine is a model 6, but older units may […]

This post concerns the “MacIvory” Model 3 Lisp Machine. It is of interest strictly to bolixologists. Click on a photo to see detailed version. Machine chassis: The Ivory NuBus Board Set (i.e. the LispM itself, the Mac Quadra is otherwise ordinary): “Ivory” NuBus board, component-side: What’s under the labels? Bolix Label Part Notes 115999-B PLUS20L8 […]

At long last, got hold of one of these:

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))))   […]

This article is a byproduct of the recent mega-puzzler concerning the Serpent cipher’s key expansion procedure. Behold: ;; Register bitness. (defconstant +bitness+ 32)   (defun make-reg (reg-name bitness) "Make algebraic representation of a register (bits in descending majority)" (loop for i from (1- bitness) downto 0 collect (make-symbol (format nil "~A~A" reg-name i))))   (defun […]

The following is a conversation I recently had with an alert and inquisitive reader. It has been redacted for brevity; handles/names/irrelevant things have been removed. Some text has been turned into links to relevant material. Anyone still reading this page for reasons related to its original purpose is encouraged to read this; it may help […]

Boston Lisp Meeting; June 28, 2012. Update: Here’s a mirror of the film. The Google copy appears to have been censored.