Computes the greatest common divisor (gcd).

Compute the Highest Common Factor (HCF / GCD) of two integers

Compute the greatest common divisor (gcd).

Returns the prime factor decomposition in an array when given a single integer input. When given two integer inputs, it returns an array containing the highest common factor and the lowest common mutliple.

Two-factor authentication for Node.js. One-time passcode generator (HOTP/TOTP) with support for Google Authenticator.

One Time Password (HOTP/TOTP) library for Node.js, Deno, Bun and browsers

> Some friendly semver range utilities

Redis utilities for redis instrumentations

A Better Auth component for Convex.

Retrying made simple, easy and async

Retries a function that returns a promise, leveraging the power of the retry module.

hint for best practices related to usage of the X-UA-Compatible meta tag and response header

Treat React JSX elements as value types and hoist them to the highest scope

Changes the size of a geometry by scaling it up or down.

Retries a function that returns a promise, leveraging the power of the retry module.

Common English misspellings dictionary for cspell.

Best-effort discovery of the machine's default gateway and local network IP exclusively with UDP sockets.

Base class for regression modules

Computes the longest prefix string that is common to each path, excluding the base component

Zero dependency library to safe merge objects.