Security Math
Bloom filter sizing: bits, bytes and hash count for n items at a false-positive rate, or the rate for a given size.
The wallet the 402 directs payment to. Its whole payment record — every payer, every chain — is on the merchant page.
Asset 0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913
The payTo wallet does not resolve to a registered ERC-8004 agent. That is not a verdict on the service — most of the catalog is unregistered.
Live 402 challenge
Captured by the enrichment pass, not read just now. Prices can change — always read the 402 the endpoint answers with.
{
"error": "Payment required",
"accepts": [
{
"asset": "0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913",
"extra": {
"name": "USD Coin",
"version": "2"
},
"payTo": "0xb531320805C5BED1D46AEaDcF4F008FDF172DBDa",
"scheme": "exact",
"network": "base",
"mimeType": "application/json",
"resource": "https://security-math.x402tookit.com/bloom-filter",
"description": "Bloom filter sizing: bits, bytes and hash count for n items at a false-positive rate, or the rate for a given size.",
"outputSchema": {
"input": {
"type": "http",
"method": "GET",
"queryParams": {
"n": 1000000,
"p": 0.01
}
},
"output": {
"asOf": "2026-10-11T14:38:12.749Z",
"human": "1.14 MiB",
"items": 1000000,
"kUsed": 7,
"mBits": 9585059,
"mBytes": 1198133,
"source": "computed locally (Bloom 1970 formulas)",
"reasons": [
"m = -n ln p / (ln 2)^2 and optimal k = (m/n) ln 2; the false-positive rate is (1 - e^(-kn/m))^k.",
"A Bloom filter never gives a false negative; it gives false positives at about the stated rate once it holds n items."
],
"summary": "For 1,000,000 items at 0.01: 9,585,059 bits (1.14 MiB), 7 hash functions, false-positive rate 1.004e-2, 9.59 bits per item.",
"verdict": "SIZED",
"degraded": false,
"optimalK": 7,
"fillRatio": 0.518237,
"disclaimer": "Screening signal computed from the named public source. Not financial, legal or investment advice; provided as is. Verify at the source before acting.",
"notChecked": [
"real hash functions: the formula assumes k independent uniform hashes (double hashing gets very close)",
"counting, scalable or cuckoo variants",
"…1 more"
],
"bitsPerItem": 9.585,
"falsePositiveRate": 0.010039214559253868,
"targetFalsePositiveRate": 0.01
}
},
"maxAmountRequired": "20000",
"maxTimeoutSeconds": 300
},
{
"asset": "EPjFWdd5AufqSSqeM2qN1xzybapC8G4wEGGkZwyTDt1v",
"extra": {
"feePayer": "D6ZhtNQ5nT9ZnTHUbqXZsTx5MH2rPFiBBggX4hY1WePM"
},
"payTo": "DUPiupXtuox38dcGoXUKer5mAydCzmaHjrbQ66qeEm8s",
"scheme": "exact",
"network": "solana",
"mimeType": "application/json",
"resource": "https://security-math.x402tookit.com/bloom-filter",
"description": "Bloom filter sizing: bits, bytes and hash count for n items at a false-positive rate, or the rate for a given size.",
"outputSchema": {
"input": {
"type": "http",
"method": "GET",
"queryParams": {
"n": 1000000,
"p": 0.01
}
},
"output": {
"asOf": "2026-10-11T14:38:12.749Z",
"human": "1.14 MiB",
"items": 1000000,
"kUsed": 7,
"mBits": 9585059,
"mBytes": 1198133,
"source": "computed locally (Bloom 1970 formulas)",
"reasons": [
"m = -n ln p / (ln 2)^2 and optimal k = (m/n) ln 2; the false-positive rate is (1 - e^(-kn/m))^k.",
"A Bloom filter never gives a false negative; it gives false positives at about the stated rate once it holds n items."
],
"summary": "For 1,000,000 items at 0.01: 9,585,059 bits (1.14 MiB), 7 hash functions, false-positive rate 1.004e-2, 9.59 bits per item.",
"verdict": "SIZED",
"degraded": false,
"optimalK": 7,
"fillRatio": 0.518237,
"disclaimer": "Screening signal computed from the named public source. Not financial, legal or investment advice; provided as is. Verify at the source before acting.",
"notChecked": [
"real hash functions: the formula assumes k independent uniform hashes (double hashing gets very close)",
"counting, scalable or cuckoo variants",
"…1 more"
],
"bitsPerItem": 9.585,
"falsePositiveRate": 0.010039214559253868,
"targetFalsePositiveRate": 0.01
}
},
"maxAmountRequired": "20000",
"maxTimeoutSeconds": 300
},
{
"asset": "0x3c499c542cEF5E3811e1192ce70d8cC03d5c3359",
"extra": {
"name": "USD Coin",
"version": "2"
},
"payTo": "0xb531320805C5BED1D46AEaDcF4F008FDF172DBDa",
"scheme": "exact",
"network": "polygon",
"mimeType": "application/json",
"resource": "https://security-math.x402tookit.com/bloom-filter",
"description": "Bloom filter sizing: bits, bytes and hash count for n items at a false-positive rate, or the rate for a given size.",
"outputSchema": {
"input": {
"type": "http",
"method": "GET",
"queryParams": {
"n": 1000000,
"p": 0.01
}
},
"output": {
"asOf": "2026-10-11T14:38:12.749Z",
"human": "1.14 MiB",
"items": 1000000,
"kUsed": 7,
"mBits": 9585059,
"mBytes": 1198133,
"source": "computed locally (Bloom 1970 formulas)",
"reasons": [
"m = -n ln p / (ln 2)^2 and optimal k = (m/n) ln 2; the false-positive rate is (1 - e^(-kn/m))^k.",
"A Bloom filter never gives a false negative; it gives false positives at about the stated rate once it holds n items."
],
"summary": "For 1,000,000 items at 0.01: 9,585,059 bits (1.14 MiB), 7 hash functions, false-positive rate 1.004e-2, 9.59 bits per item.",
"verdict": "SIZED",
"degraded": false,
"optimalK": 7,
"fillRatio": 0.518237,
"disclaimer": "Screening signal computed from the named public source. Not financial, legal or investment advice; provided as is. Verify at the source before acting.",
"notChecked": [
"real hash functions: the formula assumes k independent uniform hashes (double hashing gets very close)",
"counting, scalable or cuckoo variants",
"…1 more"
],
"bitsPerItem": 9.585,
"falsePositiveRate": 0.010039214559253868,
"targetFalsePositiveRate": 0.01
}
},
"maxAmountRequired": "20000",
"maxTimeoutSeconds": 300
}
],
"x402Version": 1,
"alsoAvailable": {
"llms": "https://security-math.x402tookit.com/llms.txt",
"catalog": "https://security-math.x402tookit.com/catalog",
"message": "Security Math has 8 pay-per-call endpoints (Password entropy, crack-time ranges, NIST key sizes, collision odds, Bloom filter sizing, checksums and Shamir threshold maths.), from $0.02 a call. See the full menu and send your agents our way.",
"openapi": "https://security-math.x402tookit.com/openapi.json",
"related": [
{
"url": "https://security-math.x402tookit.com/checksum",
"path": "/checksum",
"what": "CRC-32, CRC-32C, Adler-32, FNV-1/1a (32 and 64 bit) and MurmurHash3 x86_32 of text or hex…",
"price": "$0.02"
},
{
"url": "https://security-math.x402tookit.com/crack-time",
"path": "/crack-time",
"what": "Time to brute-force a space of N bits (or N guesses) at a guesses-per-second rate: averag…",
"price": "$0.02"
},
{
"url": "https://security-math.x402tookit.com/encoded-length",
"path": "/encoded-length",
"what": "Encoded length of N bytes in hex, base64, base32, base58, base85, decimal or any base-N a…",
"price": "$0.02"
}
]
}
}Accepts
The payment requirements as published to the catalog. Read the live 402 before paying — a price here is a claim, not a quote.
Pay 0.02 USDC on Base to 0xb531…2DBDa. The signed payment is good for 5 minutes.
- Paid to
- 0xb531…2DBDa
- USD Coin contract
- 0x8335…02913
- Payment window
- 5 minutes
- As published
- 20000 smallest units
That figure is in the token’s smallest units. Roundhouse does not hold this contract’s decimals, so it is shown as published rather than converted.
- Paid to
- DUPiup…eEm8s
- Token contract
- EPjFWd…TDt1v
- Payment window
- 5 minutes
That figure is in the token’s smallest units. Roundhouse does not hold this contract’s decimals, so it is shown as published rather than converted.
- Paid to
- 0xb531…2DBDa
- Token contract
- 0x3c49…c3359
- Payment window
- 5 minutes
That figure is in the token’s smallest units. Roundhouse does not hold this contract’s decimals, so it is shown as published rather than converted.
- Paid to
- 0xb531…2DBDa
- Token contract
- 0xaf88…e5831
- Payment window
- 5 minutes
The catalog’s raw entry
[
{
"asset": "0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913",
"extra": {
"name": "USD Coin",
"version": "2"
},
"payTo": "0xb531320805C5BED1D46AEaDcF4F008FDF172DBDa",
"amount": "20000",
"scheme": "exact",
"network": "eip155:8453",
"maxTimeoutSeconds": 300
},
{
"asset": "EPjFWdd5AufqSSqeM2qN1xzybapC8G4wEGGkZwyTDt1v",
"extra": {
"feePayer": "D6ZhtNQ5nT9ZnTHUbqXZsTx5MH2rPFiBBggX4hY1WePM"
},
"payTo": "DUPiupXtuox38dcGoXUKer5mAydCzmaHjrbQ66qeEm8s",
"amount": "20000",
"scheme": "exact",
"network": "solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp",
"maxTimeoutSeconds": 300
},
{
"asset": "0x3c499c542cEF5E3811e1192ce70d8cC03d5c3359",
"extra": {
"name": "USD Coin",
"version": "2"
},
"payTo": "0xb531320805C5BED1D46AEaDcF4F008FDF172DBDa",
"amount": "20000",
"scheme": "exact",
"network": "eip155:137",
"maxTimeoutSeconds": 300
},
{
"asset": "0xaf88d065e77c8cC2239327C5EDb3A432268e5831",
"extra": {
"name": "USD Coin",
"version": "2"
},
"payTo": "0xb531320805C5BED1D46AEaDcF4F008FDF172DBDa",
"amount": "20000",
"scheme": "exact",
"network": "eip155:42161",
"maxTimeoutSeconds": 300
}
]Extensions
{
"bazaar": {
"info": {
"input": {
"type": "http",
"method": "GET",
"queryParams": {
"n": 1000000,
"p": 0.01
}
},
"output": {
"type": "json",
"example": {
"asOf": "2026-10-11T14:38:12.749Z",
"human": "1.14 MiB",
"items": 1000000,
"kUsed": 7,
"mBits": 9585059,
"mBytes": 1198133,
"source": "computed locally (Bloom 1970 formulas)",
"reasons": [
"m = -n ln p / (ln 2)^2 and optimal k = (m/n) ln 2; the false-positive rate is (1 - e^(-kn/m))^k.",
"A Bloom filter never gives a false negative; it gives false positives at about the stated rate once it holds n items."
],
"summary": "For 1,000,000 items at 0.01: 9,585,059 bits (1.14 MiB), 7 hash functions, false-positive rate 1.004e-2, 9.59 bits per item.",
"verdict": "SIZED",
"degraded": false,
"optimalK": 7,
"fillRatio": 0.518237,
"disclaimer": "Screening signal computed from the named public source. Not financial, legal or investment advice; provided as is. Verify at the source before acting.",
"notChecked": [
"real hash functions: the formula assumes k independent uniform hashes (double hashing gets very close)",
"counting, scalable or cuckoo variants",
"…1 more"
],
"bitsPerItem": 9.585,
"falsePositiveRate": 0.010039214559253868,
"targetFalsePositiveRate": 0.01
}
}
},
"schema": {
"type": "object",
"$schema": "https://json-schema.org/draft/2020-12/schema",
"required": [
"input"
],
"properties": {
"input": {
"type": "object",
"required": [
"type",
"method"
],
"properties": {
"type": {
"type": "string",
"const": "http"
},
"method": {
"enum": [
"GET"
],
"type": "string"
},
"queryParams": {
"type": "object",
"required": [
"n"
],
"properties": {
"k": {
"type": "integer",
"description": "Hash function count to evaluate (default: the optimum)"
},
"n": {
"type": "number",
"description": "Number of items to store, 1 to 1e12"
},
"p": {
"type": "number",
"description": "Target false-positive probability, e.g. 0.01 (give p or mBits)"
},
"mBits": {
"type": "number",
"description": "Or the filter size in bits to evaluate"
}
}
}
},
"additionalProperties": false
},
"output": {
"type": "object",
"required": [
"type"
],
"properties": {
"type": {
"type": "string"
},
"example": {
"type": "object",
"properties": {
"asOf": {
"type": [
"null",
"string"
]
},
"human": {
"type": [
"null",
"string"
]
},
"items": {
"type": [
"null",
"number"
]
},
"kUsed": {
"type": [
"null",
"number"
]
},
"mBits": {
"type": [
"null",
"number"
]
},
"mBytes": {
"type": [
"null",
"number"
]
},
"source": {
"type": [
"null",
"string"
]
},
"reasons": {
"type": [
"array",
"null"
],
"items": {
"type": "string"
}
},
"summary": {
"type": [
"null",
"string"
]
},
"verdict": {
"type": [
"null",
"string"
]
},
"degraded": {
"type": [
"boolean",
"null"
]
},
"optimalK": {
"type": [
"null",
"number"
]
},
"fillRatio": {
"type": [
"null",
"number"
]
},
"disclaimer": {
"type": [
"null",
"string"
]
},
"notChecked": {
"type": [
"array",
"null"
],
"items": {
"type": "string"
}
},
"bitsPerItem": {
"type": [
"null",
"number"
]
},
"falsePositiveRate": {
"type": [
"null",
"number"
]
},
"targetFalsePositiveRate": {
"type": [
"null",
"number"
]
}
}
}
}
}
}
}
}
}Provenance
- Seen in the source catalog
- 2026-10-20 20:30Z
- Last indexed by Roundhouse
- 2026-10-22 06:50Z
- Last enriched (probe, favicon, geo)
- 2026-10-20 20:45Z
- x402 version
- 2
- Max timeout
- 300s
- Liveness probe
- HTTP 402
Hand this page to an agent
Copy the prompt and paste it into Claude, an MCP client or your own agent — it will vet this service and call it over the free read API. No key, no account.
GET api.roundhouseai.io/v0/endpoints
This endpoint's own trailing-30-day call count, as published by the upstream catalog and snapshotted daily. 4 snapshots so far. Verified volume counts only settlements with an on-chain EIP-3009 marker.
Show the promptHide the prompt
Using Roundhouse, look up the x402 service Security Math and tell me whether it is worth paying: what a call costs, whether the endpoint answered when last probed, and what its payment record actually shows. curl -s 'https://api.roundhouseai.io/v0/endpoints?q=Security%20Math' curl -s 'https://api.roundhouseai.io/v0/merchants/<the payTo wallet returned above>' Then call it: read the price from the live 402 at https://security-math.x402tookit.com/bloom-filter, never from a cached figure, and pay with an x402 client. The /v0 API needs an API key (`authorization: Bearer rh_live_…`) on everything except /v0/unified* and /v0/endpoints. Either pay over x402 (mint a personal key for $0.01 at GET https://api.roundhouseai.io/v0/test/x402), or ask me for an organization key, which I create at https://roundhouseai.io/dashboard/connections. If you have neither, ask before going further. If you do not have Roundhouse tools or skills installed, read https://roundhouseai.io/skill.md first — it is the whole procedure.