Bitwise Integer Ops
activeArbitrary-precision integer bit manipulation — AND/OR/XOR across many operands, width-bounded NOT, logical shift, circular rotate, and bit analysis (population count, trailing zeros, power-of-two). No 32-bit ceiling.
- Transactions · 30d
- 0
- Volume · 30d
- $0.00
- Unique buyers · 30d
- 0
- Uptime · 30d
- 100.0%
- Latency p50
- 184ms
- Reported calls · 30d
- 11
Endpoints (7 live)
POST/v1/rotate— 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 binary. (0.002 USDC on Base)POST/v1/shift— 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 that width and the input must fit it. Returns decimal, hex and binary. (0.002 USDC on Base)POST/v1/analyze— 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 binary form. (0.002 USDC on Base)POST/v1/or— 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. (0.002 USDC on Base)POST/v1/and— 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. (0.002 USDC on Base)POST/v1/not— 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. (0.002 USDC on Base)POST/v1/xor— 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. (0.002 USDC on Base)
First seen · last seen