Paperfold
paperfoldThe regular paperfolding bit of n. Write n = m * 2^k with m odd. The bit is 1 when m is 1 mod 4, and 0 when m is 3 mod 4. The first three bits, from n = 1, are 1, 1, 0. n runs from 1 to 1000000. Price: $0.001 USDC per successful call (x402, Solana). Same tool over HTTPS: POST https://scorptech.it.com/api/x402/v1/paperfold
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": "paperfold"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| n | Yes |