About

When analyzing low-level system memory, network packet captures (Wireshark), or firmware binaries, data is often presented as hexadecimal strings separated by colons or spaces (e.g., FF:A0:1C). Manually cleaning these strings to find specific binary flags is tedious and error-prone.

This tool is engineered to handle "dirty" input. It automatically strips common delimiters (spaces, colons, dashes) and converts the sanitized hex string into a binary stream. The output is formatted into 4-bit nibbles, aligning with the hexadecimal structure, which significantly improves readability when searching for specific bit patterns or flags within a larger data structure.

Formulas

Hexadecimal is a base-16 system, while binary is base-2. Since 16 = 2⁴, exactly one hexadecimal digit maps to exactly four binary digits (a nibble).

Hex_i ↔ b₃b₂b₁b₀

This direct mapping allows for O(n) conversion complexity without needing intermediate decimal calculation, making it efficient for long strings.

Reference Data

Hex Digit	Binary Nibble	Decimal
0	0000	0
1	0001	1
2	0010	2
3	0011	3
4	0100	4
5	0101	5
6	0110	6
7	0111	7
8	1000	8
9	1001	9
A	1010	10
B	1011	11
C	1100	12
D	1101	13
E	1110	14
F	1111	15

Frequently Asked Questions

Yes. Inputs like "00:1A:2B:3C:4D:5E" are automatically cleaned. The tool removes the colons and processes the raw hex digits.

Grouping by 4 bits (a nibble) directly corresponds to a single hex digit. This makes it easy to visually verify the conversion (e.g., if you see "F", you should look for "1111").

The tool supports strings up to 5,000 characters efficiently. Processing larger memory dumps is possible but depends on your browser"s memory allocation for DOM elements.