modular

Active

declared in 1.5.1

Modular Arithmetic (pow / inverse / gcd) — Modular exponentiation, modular inverse, and greatest-common-divisor computations.

Parameters schema

{
  "type": "object",
  "required": [
    "op"
  ],
  "properties": {
    "a": {
      "type": "integer",
      "description": "Operand a (inverse/gcd)"
    },
    "b": {
      "type": "integer",
      "description": "Operand b (gcd)"
    },
    "op": {
      "enum": [
        "pow",
        "inverse",
        "gcd"
      ],
      "type": "string",
      "description": "Operation"
    },
    "base": {
      "type": "integer",
      "description": "Base (pow)"
    },
    "modulus": {
      "type": "integer",
      "description": "Modulus (pow/inverse)"
    },
    "exponent": {
      "type": "integer",
      "description": "Exponent (pow)"
    }
  },
  "additionalProperties": false
}

What this tool wraps· 0 endpoints

min confidence0.70 0.50

No endpoints wrapped at confidence ≥ 0.70.

Parent server

WingmanProtocol Agent Gateway

https://github.com/WingmanProtocol-Agent-Gateway/wingman-agent-gateway

1/7 registries

View full server →