{"provider":{"host":"crypto-math.x402tookit.com","name":"Crypto Math","score":10.5,"live":false,"checkedAt":null,"uptime72h":null,"lastCheck":null,"endpoints":10,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"cheapestUsd":"0.02","income7dUsd":"8.49","payers7d":2,"transfers7d":287,"payoutAddressShared":true,"claimed":false,"page":"https://logicnodes.io/observatory/p/crypto-math.x402tookit.com"},"endpoints":[{"url":"https://crypto-math.x402tookit.com/check-digits","method":"GET","priceMicroUsd":20000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"Generate or validate Luhn and ISO 7064 mod 97-10 (IBAN style) check digits from the string you supply."},{"url":"https://crypto-math.x402tookit.com/crt","method":"GET","priceMicroUsd":20000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"Solve x = a1 (mod m1), x = a2 (mod m2), ... with the Chinese remainder theorem, coprime or not."},{"url":"https://crypto-math.x402tookit.com/ec-params","method":"GET","priceMicroUsd":20000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"secp256k1, P-256 and P-384 public parameters (p, n, G) from SEC 2, with an on-curve check of a public point."},{"url":"https://crypto-math.x402tookit.com/encoding","method":"GET","priceMicroUsd":20000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"Convert public bytes between hex, base64 and base64url (RFC 4648) with strict decoding and expected-length check."},{"url":"https://crypto-math.x402tookit.com/entropy","method":"GET","priceMicroUsd":20000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"Shannon entropy in bits per symbol from a frequency table, plus min-entropy, collision entropy and efficiency."},{"url":"https://crypto-math.x402tookit.com/gcd-extended","method":"GET","priceMicroUsd":20000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"gcd, lcm and extended-Euclid Bezout coefficients of two integers, plus gcd/lcm of up to 20 more."},{"url":"https://crypto-math.x402tookit.com/mod-inverse","method":"GET","priceMicroUsd":20000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"Modular multiplicative inverse of a mod m, or the gcd that proves none exists."},{"url":"https://crypto-math.x402tookit.com/mod-pow","method":"GET","priceMicroUsd":20000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"Modular exponentiation base^exp mod m for big integers, decimal or 0x hex, up to 4096 bits."},{"url":"https://crypto-math.x402tookit.com/prime","method":"GET","priceMicroUsd":20000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"Primality test (deterministic Miller-Rabin below 2^64) plus the next and previous prime, with BigInt."},{"url":"https://crypto-math.x402tookit.com/rsa-arith","method":"GET","priceMicroUsd":20000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"RSA public key arithmetic: modulus bits, exponent validity, NIST strength; or a labelled toy RSA with tiny primes."}]}