Lab

Small public tools and service checks

API docs · Releases

Lab API

Small public tools and service checks

A lightweight interface for checking the lab service, looking up Catalan numbers, Fibonacci numbers, GCD, prime and number-theory values, and an authenticated snapshot.

Status

Service health

Checking

Contacting the API...

Lookup

Catalan number

Enter an integer from 0 to 34.

Lookup

Fibonacci number

Enter an integer from 0 to 186.

Calculation

Greatest common divisor

Enter two integers from 0 to 18,446,744,073,709,551,615.

Prime tools

Prime-number calculations

Enter an integer from 0 to 1,000,000.
Enter an integer from 0 to 1,000,000.
Enter an integer from 3 to 1,000,000.
Enter an integer from 3 to 1,000,000.
Enter an integer from 0 to 1,000,000.
Enter an integer from 0 to 1,000,000.
Enter an integer from 0 to 1,000,000.
Enter an integer from 0 to 1,000,000.
Enter an integer from 0 to 1,000,000.
Enter an integer from 0 to 1,000,000.
Enter an integer from 0 to 1,000,000.

Simulation

Lorenz attractor

A continuous fourth-order Runge–Kutta projection of the classic three-dimensional chaotic system: dx/dt = σ(y − x), dy/dt = x(ρ − z) − y, and dz/dt = xy − βz.

Steps: 0

Discovery

API information

Status
Loading...

Crypto discovery

Crypto API information

Status
Loading...

Crypto lab

Hash and HMAC tools

Checking

Operations use UTF-8 text and require Basic Auth. Credentials are requested per action, sent only with that request, and cleared immediately afterward.

Contacting crypto-lab...

Digest

Hash text

Your digest will appear here.

Message authentication

Generate or verify HMAC

Your MAC result will appear here.

Number theory & ECC

FoxMath cryptography exploration

Public

High-performance pure Rust number theory and Weierstrass elliptic curve arithmetic powered by crypto-lab v0.6.0. Endpoints are unauthenticated and open for exploration.

Modular roots

Square root mod p

Enter a and odd prime p.

Residue test

Legendre symbol (a/p)

Enter a and odd prime p.

Elliptic curves

Scalar multiplication (k · G)

Select curve and scalar k.

Congruences

Chinese Remainder Theorem

Enter comma-separated r and m.

Pollard's ρ algorithm

Integer factorization

Enter integer n (up to 2⁶³ - 1).

Totient & Carmichael

Euler & Carmichael functions

Enter positive integer n (up to 2⁶³ - 1).

Modular order

Multiplicative order & primitive root

Enter coprime a and modulus m > 1.

Discrete Logarithm

Baby-step Giant-step solver

Enter base g, target h, and modulus p > 1.

Arithmetic Functions

Möbius, Divisor Sum & Count

Enter positive integer n (up to 2⁶³ - 1).

Quadratic reciprocity

Jacobi symbol (a/n)

Enter integer a and positive odd integer n.

Primality testing

Solovay–Strassen test

Enter integer n > 1 and rounds k.

Practice mode

Crypto challenge generator

Generate a problem to test your math & crypto skills.

Bitwise / stego

Bitwise & LSB inspector

Examine raw UTF-8 byte sequences, bitstream layouts, and least significant bits (LSB) in real time.

Extracted LSB stream: 000
Weight: 0 / 0 Δ flips: 0

Protected

Snapshot

Credentials are sent only with this request and are not stored by this page.