Logotron Genesis.

Aug. 16 Update: Trinque’s method for line wraps.
Aug. 16 Update: Phf’s uniturd algo, and several cosmetic improvements to WWW displayer.
Aug. 12 Update: Diana Coman contributed a log eater.
Aug. 11 Update: Date Arrow fix.
Aug. [...]

“M” Performance… Pessimizations! or: SSE is a Scam.

This article is a continuation of the M series.

The vpatch given below entirely re-implements the TLB (MMU) of M to use SIMD instructions from the AMD64 SSE2 set.

Whereas previously TLB entries were kept in memory and searched iteratively, now we keep the Tags (3 byte each) sliced into three XMM registers, and search them in [...]

“M” Performance Optimizations.

This article is a continuation of the M series.

The vpatch given below speeds up the execution of M by approximately 30% (as measured by the Dhrystone benchmark.) It implements separate single-entry TLB caches for reads and writes; a set of fastpath exception handlers; and several other minor optimizations.

You will need:

A Keccak-based [...]

“M” Genesis.

M is a MIPS-III system emulator, written purely in AMD64 assembly to make optimal use of commonplace iron. As discussed previously.

M will run lightly-modified Linux kernels with strict logical isolation vs. the host (and vs. any other instances of itself.) That is, it in fact does exactly what e.g. QEMU fraudulently pretends to do.

To keep [...]

“Finite Field Arithmetic.” Chapter 19: Peh Tuning and Demo Tapes.

This article is part of a series of hands-on tutorials introducing FFA, or the Finite Field Arithmetic library. FFA differs from the typical “Open Sores” abomination, in that — rather than trusting the author blindly with their lives — prospective users are expected to read and fully understand every single line. In exactly the same [...]

“Finite Field Arithmetic.” Chapter 18C: Peh School: Generation of Cryptographic Primes.

This article is part of a series of hands-on tutorials introducing FFA, or the Finite Field Arithmetic library. FFA differs from the typical “Open Sores” abomination, in that — rather than trusting the author blindly with their lives — prospective users are expected to read and fully understand every single line. In exactly the same [...]

“Finite Field Arithmetic.” Chapter 18B: “Cutouts” in Peh.

This article is part of a series of hands-on tutorials introducing FFA, or the Finite Field Arithmetic library. FFA differs from the typical “Open Sores” abomination, in that — rather than trusting the author blindly with their lives — prospective users are expected to read and fully understand every single line. In exactly the same [...]

“Finite Field Arithmetic.” Chapter 18A: Subroutines in Peh.

This article is part of a series of hands-on tutorials introducing FFA, or the Finite Field Arithmetic library. FFA differs from the typical “Open Sores” abomination, in that — rather than trusting the author blindly with their lives — prospective users are expected to read and fully understand every single line. In exactly the same [...]

“Finite Field Arithmetic.” Chapter 17: Introduction to Peh.

This article is part of a series of hands-on tutorials introducing FFA, or the Finite Field Arithmetic library. FFA differs from the typical “Open Sores” abomination, in that — rather than trusting the author blindly with their lives — prospective users are expected to read and fully understand every single line. In exactly the same [...]

“Finite Field Arithmetic.” Chapter 16A: The Miller-Rabin Test.

This article is part of a series of hands-on tutorials introducing FFA, or the Finite Field Arithmetic library. FFA differs from the typical “Open Sores” abomination, in that — rather than trusting the author blindly with their lives — prospective users are expected to read and fully understand every single line. In exactly the same [...]

// Script to allow anchoring of user-selected content on html pages. // Original idea deployed by http://archive.today // Packaged for WordPress on http://trilema.com/2015/that-spiffy-selection-thing/