Temporally Ordered IDs. Generate universally unique identifiers (UUID) that sort lexically in time order. Torid exists to solve the problem of generating UUIDs that when ordered lexically, they are also ordered temporally. I needed a way to generate ids for events that are entering a system with the following criteria: 1. Fast ID generation 2. No central coordinating server/system 3. No local storage 4. Library code, that is multiple apps on the same machine can use the same code and they will not generate duplicate ids 5. Eventually stored in a UUID field in a database. So 128bit ids are totally fine. The IDs that Torid generates are 128bit IDs made up of 2, 64bit parts. * 64bit microsecond level UNIX timestamp * 64bit hash of the system hostname, process id and a random value.

The boxxspring gem is implements a client to the Bedrocket Media Ventrures Boxxspring property API.

UUIDs that are byte-ordered lamport clocks (timestamp, worker_id). Much simpler than type-1 UUID's crappy, weirdo layout.

hacked together bloom filter

Replicate models across applications

Ruby SDK for Gaia pipelines (https://gaia-pipeline.io).

This rubygem does not have a description or summary.

The unimatrix gem facilitates making requests to Unimatrix APIs.

The unimatrix-activist facilitates making requests to the Unimatrix Activist application

The zephyrus gem implements a client to the Sportsrocket Zephyrus API