mocop
Browse · Docs · Guide · Analyze

ScorpTech x402 API

API by ScorpTech · rest

x402 v2 (HTTP 402, exact scheme, USDC) on solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp. Call an endpoint; receive 402 with PAYMENT-REQUIRED header (base64 JSON). Retry with PAYMENT-SIGNATURE header using any x402 client (@x402/fetch, @x402/axios, python x402). Operator: ScorpTech (https://scorptech.it.com). All /v1/* routes are paid via x402 (HTTP 402) unless otherwise noted.

Endpoint: https://scorptech.it.com/api/x402

Verification: observed. Source: crawl.

Capabilities (1023)

  • Human/agent docs JSON
  • Liveness
  • OpenAPI 3.1 with x402 price metadata
  • Build EVM calldata offline: function selector + ABI-encoded arguments from a…
  • sigma(n) minus 2n. A perfect number gives 0 an abundant number gives a…
  • The abundancy sigma(n)/n as a reduced fraction. 1 is 1/1 4 is 7/4 6 is 2/1 …
  • Whether n is an Achilles number: powerful but not a perfect power. 72 and 108…
  • Additive persistence: how many times the decimal digits of n must be summed to…
  • US airport delay status from the FAA NAS Status feed (ground delay programs …
  • The aliquot part of n the sum of proper divisors. The aliquot part of 1 is 0 …
  • Whether sigma(n) = 2*n - 1. Powers of two including 1 are almost perfect. 16…
  • The alternating factorial af(n) = n! - (n-1)! + (n-2)! - ... ending at 1.…
  • The sum of alternating factorials from lo through hi inclusive. The sum from…
  • The alternating factorial a(n) = n! - a(n-1) with a(1) = 1. a(3) is 5 a(4)…
  • The alternating factorial a(n) modulo m. a(5) mod 10 is 1 a(6) mod 100 is 19 …
  • The smallest m at least n and at most 12 whose alternating factorial is…
  • Whether the alternating factorial a(n) is prime. It is for 3 4 5 6 7 8 …
  • The sum of the alternating factorials from 1 through n. Through 1 it is 1 …
  • Whether n is amicable and its partner when it is. The partner of 220 is 284 …
  • The Apery number A(n) the sum of C(n k)^2 * C(n+k k)^2 for k from 0 to n.…
  • A(n) modulo m. A(1) mod 2 is 1 A(5) mod 10 is 5 and A(8) mod 1000 is 425. n…
  • Whether the Apery number A(n) is prime. A(1) and A(2) are prime. A(0) A(3) …
  • The sum of the Apery numbers A(0) through A(n). Through 0 it is 1 through 2…
  • One summand of the Apery number C(n k)^2 * C(n+k k)^2. The k=1 summand of…
  • How many arithmetic numbers are at most n. Through 1 there is 1 through 2…
About · Contact · Privacy