{"provider":{"host":"security-math.x402tookit.com","name":"Security Math","score":10.5,"live":false,"checkedAt":null,"uptime72h":null,"lastCheck":null,"endpoints":8,"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/security-math.x402tookit.com"},"endpoints":[{"url":"https://security-math.x402tookit.com/birthday-collision","method":"GET","priceMicroUsd":20000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"Birthday-problem collision odds for random IDs or hash outputs, or the count of items that reaches a target probability."},{"url":"https://security-math.x402tookit.com/bloom-filter","method":"GET","priceMicroUsd":20000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"Bloom filter sizing: bits, bytes and hash count for n items at a false-positive rate, or the rate for a given size."},{"url":"https://security-math.x402tookit.com/checksum","method":"GET","priceMicroUsd":20000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"CRC-32, CRC-32C, Adler-32, FNV-1/1a (32 and 64 bit) and MurmurHash3 x86_32 of text or hex bytes. Not cryptographic."},{"url":"https://security-math.x402tookit.com/crack-time","method":"GET","priceMicroUsd":20000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"Time to brute-force a space of N bits (or N guesses) at a guesses-per-second rate: average, worst case, and presets."},{"url":"https://security-math.x402tookit.com/encoded-length","method":"GET","priceMicroUsd":20000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"Encoded length of N bytes in hex, base64, base32, base58, base85, decimal or any base-N alphabet, and bytes per N characters."},{"url":"https://security-math.x402tookit.com/key-size-equivalence","method":"GET","priceMicroUsd":20000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"NIST SP 800-57 comparable strengths: RSA, DH, DSA, ECC and AES key sizes to security bits, hash strengths, 2030 status."},{"url":"https://security-math.x402tookit.com/password-entropy","method":"GET","priceMicroUsd":20000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"Entropy bits for a random password policy, PIN or diceware passphrase from length and alphabet, with crack-time ranges."},{"url":"https://security-math.x402tookit.com/shamir-threshold","method":"GET","priceMicroUsd":20000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"Shamir t-of-n secret sharing maths: qualifying subsets, loss tolerance, recovery and compromise odds. Counts only, no secrets."}]}