Check if two integers are coprime.
Test 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.
Checks if two numbers are coprime
List of coprime numbers between A and B (inclusive) for a given C.
Base mathematical assertion utilities.
A modern JavaScript library for number theory and modular arithmetic — including primes, totients, modular inverses, and more.
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)
A lightweight NPM package for solving modular equations using the Chinese Remainder Theorem (CRT). Supports modular inverse, LCM, and GCD calculations.
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.
Generate short unique IDs
Encrpyts and Decrypts text
The RAW BloomFilter library, a fast, memory-efficient bloom filter implementation for membership checks.
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.
Coprimality checks for integers
Utility-first integer helpers for RustUse
A preprocessor that compiles into LaTeX
Boolean function analysis library: entanglement, entropy, sensitivity, spectral analysis, frontier, and circuit complexity
Basic algebra on univariate binary polynomial
abstracts a group element of the secp256k1 curve in affine coordinates
implements modular inversion based on the paper: `fast constant-time gcd computation and modular inversion` by Daniel J. Bernstein and Bo-Yin Yang.
Secret-sharing primitives (Shamir, Blakley, ramp, VSS, CRT, visual, etc.) implemented directly from the original papers with no external dependencies.
Deterministic manifold snapping with O(log n) KD-tree indexing — maps continuous vectors to exact Pythagorean coordinates
Rational number arithmetic using crypto-bigint
Mizaru2
Cryptographic accumulators with private proof update delegation. Supports RSA, class-group, and bilinear-pairing constructions.