bitwise

Bitwise AND two equal-length ASCII strings, character-by-character, positionally.

XOR a single chosen bit position (0-6) in every character's 7-bit ASCII code.

Reorder the 7 bit positions of every ASCII character's code using one reproducible, seeded permutation.

Bitwise-complement every character's code within the 7-bit ASCII range (127 - code).

Bitwise OR two equal-length ASCII strings, character-by-character, positionally.

Bitwise XOR two equal-length ASCII strings, character-by-character, the classic building block of a XOR cipher.

Compute the bitwise AND of two hexadecimal values, digit by digit.

Compute the bitwise NAND of two hexadecimal values, digit by digit.

Compute the bitwise NOR of two hexadecimal values, digit by digit.

Apply the NOT logic gate to a hexadecimal value, flipping every bit within its own width.

Flip every bit of a hexadecimal number, a quick way to compute its bitwise complement.

Compute the bitwise OR of two hexadecimal values, digit by digit.

Compute the bitwise XNOR of two hexadecimal values, digit by digit.

Compute the bitwise XOR of two hexadecimal values, digit by digit.

Fold a list of non-negative integers with bitwise AND.

Fold a list of non-negative integers with AND, then take the NOT at a chosen bit width.

Fold a list of non-negative integers with OR, then take the NOT at a chosen bit width.

Compute the bitwise NOT of each integer independently at a chosen bit width.

Fold a list of non-negative integers with bitwise OR.

Fold a list of non-negative integers with XOR, then take the NOT at a chosen bit width.

Fold a list of non-negative integers with bitwise XOR.

Reinterpret signed integers as unsigned values at an 8, 16, or 32-bit width.

Reinterpret unsigned integers as two's-complement signed values at an 8, 16, or 32-bit width.

Convert a big-endian binary string to little-endian order by reversing its byte sequence.

Compute the bitwise AND of two binary values, bit by bit.

Combine two binary strings bit by bit with no carry propagation (a half-adder sum).

Extract a contiguous bit field (e.g. bits 4-7) from a binary string by start index and length.

Circularly rotate the bits of a binary string left or right by a configurable amount.

Randomly shuffle the positions of the bits in a binary string, keeping the same count of 1s and 0s.

Swap the bits at two chosen positions in a binary string, leaving every other bit unchanged.

Duplicate every individual bit in an 8-bit-aligned binary string, doubling each byte's length.

Edit a binary string bit by bit in a clickable grid, toggling each 0 or 1 with a click.

Reverse the BYTE order of a multi-byte binary string, leaving each byte's own bits intact.

Flip every bit of a binary string: every 0 becomes a 1 and every 1 becomes a 0.

Circularly rotate a binary value's bits to the left by a chosen amount.

Logically shift a binary string's bits left by N positions, zero-filling the right and dropping overflow on the left.

Compute the bitwise NAND (NOT AND) of two binary values, bit by bit.

Compute the bitwise NOR (NOT OR) of two binary values, bit by bit.

Flip every bit of a binary value, computing its bitwise complement at its own width.

Count how many 1 bits (population count / popcount) appear in a binary string.

See exactly how AND, OR, and XOR combine two binary numbers, one column at a time.

Compute the bitwise OR of two binary values, bit by bit.

Count 1 bits in a binary string, check even/odd parity, and generate the matching parity bit.

Reverse the order of the characters in a binary string, without changing any bit's value.

Circularly rotate a binary value's bits to the right by a chosen amount.

Logically shift a binary string's bits right by N positions, zero-filling the left and dropping overflow on the right.

Compute the Sheffer stroke (NAND) of two single bits, with the full truth table.

Convert a binary string directly to its reflected binary Gray code equivalent.

Compute the bitwise XNOR (NOT XOR) of two binary values, bit by bit.

Compute the bitwise XOR of two binary values, bit by bit.

Count how many 0 bits appear in a binary string, exactly as it was entered.

Decode a reflected binary Gray code string back to ordinary binary.

Decode a Gray code value (in binary digits) back to its octal equivalent.

Convert a little-endian binary string to big-endian order by reversing its byte sequence.

Convert an octal number to its Gray code equivalent, expressed as binary digits.

Randomly flip a chosen number of bits in a binary string to simulate noise or bit errors.