Modular Arithmetic (pow / inverse / gcd)

Modular exponentiation, modular inverse, and greatest-common-divisor computations.

Free tier eligible — 500 calls/month with a free key from /pricing; x402 pay-per-call above quota.

Parameters

Parameter	Type	Required	Description
`op`	string	required	Operation One of: pow, inverse, gcd
`base`	integer	optional	Base (pow)
`exponent`	integer	optional	Exponent (pow)
`modulus`	integer	optional	Modulus (pow/inverse)
`a`	integer	optional	Operand a (inverse/gcd)
`b`	integer	optional	Operand b (gcd)

Call it over MCP (JSON-RPC 2.0)

curl -s https://wingmanprotocol.com/mcp \
  -H 'Content-Type: application/json' \
  -H 'Accept: application/json, text/event-stream' \
  -d '{"jsonrpc": "2.0", "id": 1, "method": "tools/call", "params": {"name": "modular", "arguments": {"op": "pow"}}}'

Or plain HTTP

curl -s https://wingmanprotocol.com/tools/modular \
  -H 'Content-Type: application/json' \
  -d '{"op": "pow"}'

Try it live

Edit the JSON and run it — this POSTs to https://wingmanprotocol.com/tools/modular from your browser.

This tool is x402-metered — agents pay per call with USDC on Base. The 402 response below is the standard x402 payment-requirements envelope: sign the EIP-3009 authorization and retry with the X-Payment header, or get a free key at /pricing (500 calls/month, no card, no crypto).