Modular arithmetic

Modular arithmetic operations: mod (a mod m), modpow (a^b mod m via fast exponentiation), and modinverse (a^-1 mod m via extended Euclidean algorithm). Uses BigInt for arbitrary precision. Useful for cryptography and number theory.

Input

Field	Type	Description
op *	string	"mod", "modpow", or "modinverse"
a *	integer	base value
b	integer	exponent (required for modpow)
m *	integer	modulus (must be > 0)

Example output

{
  "op": "modpow",
  "a": "7",
  "b": "256",
  "m": "13",
  "result": "9"
}

Try it — see the 402 challenge (free)

curl -i -X POST https://agent402.tools/api/mod-arithmetic \
  -H "Content-Type: application/json" \
  -d '{"op":"modpow","a":7,"b":256,"m":13}'

The response is HTTP 402 Payment Required with exact payment requirements. Any x402 v2 client pays automatically and retries:

Paid call (JavaScript agent)

import { wrapFetchWithPayment } from "@x402/fetch";
import { x402Client } from "@x402/core/client";
import { registerExactEvmScheme } from "@x402/evm/exact/client";
import { privateKeyToAccount } from "viem/accounts";

const client = new x402Client();
registerExactEvmScheme(client, { signer: privateKeyToAccount(KEY) });
const payFetch = wrapFetchWithPayment(fetch, client);

const res = await payFetch("https://agent402.tools/api/mod-arithmetic", {
  method: "POST",
  headers: { "Content-Type": "application/json" },
  body: JSON.stringify({
    "op": "modpow",
    "a": 7,
    "b": 256,
    "m": 13
  }),
});

No wallet? Pay with compute

This is a pure-CPU tool, so an agent without a wallet can pay with proof-of-work instead of USDC: fetch a challenge, solve the sha256 puzzle (16 leading zero bits — a fraction of a second of CPU, no money, no AI tokens), and resend with the X-Pow-Solution header.

import { createHash } from "node:crypto";
const lz = (b) => { let t = 0; for (const x of b) { if (!x) { t += 8; continue; } t += Math.clz32(x) - 24; break; } return t; };
const c = await (await fetch("https://agent402.tools/api/pow/challenge?slug=mod-arithmetic")).json();
let n = 0;
while (lz(createHash("sha256").update(c.challenge + ":" + n).digest()) < c.difficulty) n++;
await fetch("https://agent402.tools/api/mod-arithmetic", { method: "POST", headers: { "X-Pow-Solution": c.token + ":" + n, "Content-Type": "application/json" }, body: JSON.stringify({"op":"modpow","a":7,"b":256,"m":13}) });

Related tools