bitwise.openverbs.com publishes 7 machine-payable endpoints over the x402 protocol, priced from $0.002 to $0.002 per call. Each was probed directly; the response code below is what it returned.
| Endpoint | Method | Price | Probe |
|---|---|---|---|
| /v1/analyze | GET | $0.002 | 402 |
| /v1/and | GET | $0.002 | 402 |
| /v1/not | GET | $0.002 | 402 |
| /v1/or | GET | $0.002 | 402 |
| /v1/rotate | GET | $0.002 | 402 |
| /v1/shift | GET | $0.002 | 402 |
| /v1/xor | GET | $0.002 | 402 |
Inspect a non-negative integer's bit structure: bit length, set-bit count (population count), trailing-zero count, power-of-two test, and hex/binary representations. An optional width zero-pads the bi…
Bitwise AND across two or more non-negative integers (given as decimal strings, evaluated as arbitrary-precision BigInt). Returns the result in decimal, hex and binary.
One's-complement NOT of a non-negative integer within an explicit bit width (two's-complement domain). The value must fit in `width` bits. Returns decimal, hex and binary.
Bitwise OR across two or more non-negative integers (given as decimal strings, evaluated as arbitrary-precision BigInt). Returns the result in decimal, hex and binary.
Circularly rotate a non-negative integer left or right within an explicit bit width (bits shifted off one end reappear at the other). The value must fit in `width` bits. Returns decimal, hex and binar…
Shift a non-negative integer left or right by `amount` bits. A right shift is logical (fills with zeros). A left shift grows freely unless a `width` is given, in which case the result is masked to tha…
Bitwise XOR across two or more non-negative integers (given as decimal strings, evaluated as arbitrary-precision BigInt). Returns the result in decimal, hex and binary.