Home of an ecosystem of connected apps. The proving ground for the minimal perfect hash function (MPHF), the kireji web framework and the Gamified Universal IDE (GUIDE).

Create reversible minimal perfect hash functions from a data model spec. Achieve the information-theoretic lower bound for compression to create hashes that can be converted to and from instances of the given data model.

COMING SOON: An MVC-based web framework for building collections of reactive, entropy-perfect applications that compresses their shared data model into the URL using a minimal perfect hash function (MPHF) hierarchy.