Spec

Codefragmenten

curl "https://api.oanor.com/modular-api/v1/meta" \
  -H "x-oanor-key: oanor_test_..."

await fetch("https://api.oanor.com/modular-api/v1/meta", {
  headers: { "x-oanor-key": "oanor_test_..." }
});

$ch = curl_init("https://api.oanor.com/modular-api/v1/meta");
curl_setopt($ch, CURLOPT_HTTPHEADER, ["x-oanor-key: oanor_test_..."]);
curl_setopt($ch, CURLOPT_RETURNTRANSFER, true);
$out = curl_exec($ch);

import requests
requests.get(
    "https://api.oanor.com/modular-api/v1/meta",
    headers={"x-oanor-key": "oanor_test_..."}
)

Voorbeeldrespons

Een echte respons van dit endpoint, vastgelegd bij de laatste health check.

{
    "data": {
        "notes": "All inputs are integers (passed as strings for very large values); the modulus must be positive. The basis of RSA and many cryptographic schemes.",
        "service": "modular-api",
        "formulae": {
            "euler": "a^φ(n) ≡ 1 (mod n) when gcd(a,n)=1",
            "inverse": "a·a⁻¹ ≡ 1 (mod m), exists iff gcd(a,m)=1",
            "mod_pow": "aᵇ mod m",
            "totient": "φ(n) = n·∏(1 − 1/p) over distinct primes p | n"
        },
        "endpoints": {
            "GET /v1/meta": "This document.",
            "GET /v1/power": "Modular exponentiation aᵇ mod m (square-and-multiply).",
            "GET /v1/inverse": "Modular multiplicative inverse a⁻¹ mod m (extended Euclid).",
            "GET /v1/totient": "Euler's totient φ(n), its prime factorization, and an optional Euler check."
        },
        "description": "Modular-arithmetic calculator with exact big-integer maths: modular exponentiation, the modular multiplicative inverse, and Euler's totient with an Euler-theorem check."
    },
    "meta": {
        "timestamp": "2026-06-04T18:38:00.787Z",
        "request_id": "edce2263-38c7-4cbd-8ab3-f9a99056e4cf"
    },
    "status": "ok",
    "message": "Meta",
    "success": true
}