Rudin Shapiro
rudin_shapiroThe Rudin-Shapiro bit of n, the parity of the number of overlapping 11 blocks in its binary expansion. n = 3 is 11, so the bit is 1 and the sign is -1. n = 0 is 0. n runs from 0 to 1000000. Price: $0.001 USDC per successful call (x402, Solana). Same tool over HTTPS: POST https://scorptech.it.com/api/x402/v1/rudin-shapiro
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"n": "<n>"
},
"name": "rudin_shapiro"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| n | Yes |