A collection of useful primitives for cryptography, semantic graphs, and cryptocurrency, primarily for use in higher-level Blockchain Commons projects. All the types are CBOR serializable, and a number of them can also be serialized to and from URs.

XIDs are unique 32-byte identifiers that represent any entities - real or abstract - such as a person, organization, or device. Generated from the SHA-256 hash of a specific public signing key known as the inception key, a XID provides a stable identity throughout its lifecycle, even as associated keys and permissions evolve.

Uniform Resources (URs) are URI-encoded CBOR structures developed by Blockchain Commons. This package is intended primarily for use in higher-level Blockchain Commons projects like Gordian Envelopes.

The registry of CBOR tags used across Blockchain Commons specifications, with their names and assigned values.

Sharded Secret Key Reconstruction (SSKR) is a protocol for splitting a secret into a set of shares across one or more groups, such that the secret can be reconstructed from any combination of shares totaling or exceeding a threshold number of shares within each group and across all groups. SSKR is a generalization of Shamir's Secret Sharing (SSS)

A pure TypeScript implementation of Shamir's Secret Sharing (SSS), a cryptographic technique in which a secret is divided into parts, called shares, in such a way that a threshold of several shares are needed to reconstruct the secret.

Cryptographically secure random number generation and deterministic, seeded random sequences for Blockchain Commons' TypeScript libraries.

Provenance Marks provide a cryptographically-secured system for establishing and verifying the authenticity of works in an age of rampant AI-powered manipulation and plagiarism.

A multipart Uniform Resource (UR) QR code generator. It produces single-frame and animated fountain-coded QR sequences - suitable for transmitting arbitrarily large UR-encoded payloads through an airgap - with an optional logo overlay.

LifeHash is a method of generating visual hashes from data. It is based on Conway's Game of Life cellular automaton. Given the same input, LifeHash will always produce the same visual output, making it useful for verifying data integrity at a glance.