Check if two integers are coprime.

Test if two numbers are coprime.

Checks if two numbers are coprime

This is the official ESlint config for Coprime projects. It follows certain syntactic conventions and in general aims for clean minimal code. It is builds on top of the Airbnb config.

List of coprime numbers between A and B (inclusive) for a given C.

zDays is a browser-native offline file encryption vault powered by a symmetric block cipher architecture and authenticated container format (`.ydz`).

Base mathematical assertion utilities.

An MCP server implementing a working Library of Babel: every possible page already exists, addressed by coordinates, derived deterministically and never stored.

A modern JavaScript library for number theory and modular arithmetic — including primes, totients, modular inverses, and more.

Library for polynomial arithmetic, designed in the context of a Galois Field (GF). Test for primitive & irreducible polynomials alongside essential arithmetic operations such as polynomial multiplication, addition, subtraction and division.

Encrpyts and Decrypts text

The RAW BloomFilter library, a fast, memory-efficient bloom filter implementation for membership checks.

Generate short unique IDs

A lightweight NPM package for solving modular equations using the Chinese Remainder Theorem (CRT). Supports modular inverse, LCM, and GCD calculations.

Model Context Protocol server exposing Sacrifunk Lab Tools — modular-arithmetic vortex decomposition, 5 original scales + 10 classical modes, and a four-tuning-system frequency calculator (JI, ET, TT-432, ET-A432)

Tools used to understand or work with numbers in Node.JS, Javascript and derivatives.

A robust, scalable, framework-agnostic solution for mathemetical even/odd checking in distributed systems. Battle-tested in production.