FEHASHMAC is a collection of publicly known hash algorithms integrated into a command-line utility. Currently 42 hash algorithms belonging to 12 algorithm families are supported, including the five SHA-3 finalist contributions, plus HMAC for each algorithm. FEHASHMAC contains a set of over 540 known test vectors and results for each algorithm such that the correct implementation for each hardware platform and compiler version can be directly verified. FEHASHMAC supports bitwise hash calculation for algorithms with available bitwise test vectors. Currently this applies to the SHA algorithms: sha1, sha224, sha256, sha384, sha512, and to the five SHA-3 finalists. The so-called Gillogly bitwise input has only been tested for sha1, but is also implemented in the SHA-2 hashes. Bitwise hash calculation is also supported in sha512-224, sha512-256, and whirl, but there are no bitwise test vectors available. FEHASHMAC can also calculate hashed message authentication codes (HMAC).
GammaMOO is a fork of the LambdaMOO server with numerous cleaned-up patches and modern MOO functionality. This currently includes multicore support, object caching and other acceleration features, enhanced file I/O, UTF support, new built-in data types, and stability improvements with 64-bit support in progress.
mkESA is a program for constructing enhanced suffix arrays (ESAs) from biological sequence data. The program is based on an implementation of Manzini's lightweight Deep-Shallow algorithm, which can also utilize multiple CPUs/cores for extra performance. The generated output is compatible with the output of mkvtree from the Vmatch package.
Apptools is a collection of programs for accessing Applix 1616/OS disk images. It is similar to 'mtools' and 'cpmtools' for MS-DOS and CP/M disks. The tools have been tested on Applix 1616/OS floppy disk images, but should work on hard disk images. The tools are limited to reading and only work with raw disk images. The collection includes programs for listing, copying, displaying, and reporting, and all tools allow recursive and wildcard operations.
The Full-text Index Data structure library, libfid for short, is a portable software library for accessing indexed data through a simple C interface. It implements, among others, functions for reading indexed data from files, and for performing common operations such as fast string matching. Easy alphabet handling for mapping between printable and binary alphabets is integrated from the ground up. Currently, the enhanced suffix array is the only full-text index data structure supported. A very simplistic program for constructing enhanced suffix arrays is included.
Maniac is a tool designed to automate the comparison and the validation of multiple variants of a same program. This is achieved by compiling each variant in a distinct shared object and generating a loader program that will successively load and execute them. The loader also takes charge of initializing input data and checking output data against the reference variant.
librxe and its accompanying demo utility rxenum calculate the size of sets described by regular expressions, optionally enumerating each and every item and offering random access to any item. This is useful for learning about regexes, computing dictionary-based rainbow tables, etc.
ESKit is a portable C library that provides implementations of some self-adaptive evolution strategies. It features a simple API, comprehensive documentation, three state of the art self-adaptive evolution strategies (Isotropic CSA-ES, CMA-ES, and Separable CMA-ES), and can optionaly uses LAPACK. The implementation strictly follows the published papers introducing those evolution strategies and performs as in the published papers. A basic benchmark program is provided.