Hamming Distance Between Integers Calculator

This calculator performs the standard operation directly: it computes the bitwise XOR of the two values, then counts the set bits in that result. Use it to compare flags, masks, compact identifiers, encoded states, or test vectors without manually aligning binary strings. Inputs may be any non-negative JavaScript safe integers, including zero, and the result includes both the XOR value and its binary form for inspection.

What integer Hamming distance measures

Hamming distance was originally described for strings of equal length, but integers provide a natural bit-string interpretation. Each integer is written in base two, and leading zeroes are understood wherever one representation is shorter. A position contributes one to the distance when one integer has a zero bit there and the other has a one bit. Matching zero-zero and one-one positions contribute nothing. For example, comparing two permission masks reveals how many individual flags changed, while comparing two compact states reveals the number of toggled binary features. The result is a count of positions, not the arithmetic gap between the numbers. Two numerically close values can differ in many bits, and two values far apart can differ in only one. This capability accepts non-negative safe integers so that each submitted number has an exact JavaScript representation in both the API handler and the browser runner. Zero is valid, and its distance from another integer equals the number of set bits in that other integer.

How XOR and set-bit counting produce the answer

Exclusive OR, usually written XOR, is the key operation because its truth table matches the definition of a differing bit. XOR produces zero when two aligned bits match and one when they differ. After applying XOR to the two integers, the problem becomes a population count: count how many one bits appear in the result. The implementation uses Brian Kernighan's set-bit method. On every iteration, subtracting one from the current value and applying bitwise AND clears its lowest set bit. The loop therefore runs once per differing position rather than once per possible bit position. BigInt arithmetic is used internally, which avoids JavaScript's ordinary bitwise operators silently narrowing values to signed 32-bit integers. The returned XOR remains safe to expose as a regular number because XOR cannot set a bit above those already present in either validated safe integer. The binary XOR string is also returned, making the counted positions easy to verify during debugging or teaching.

Choosing inputs and interpreting the result

Provide the two values as the fields a and b. Each must be an integer from zero through the largest exactly represented JavaScript integer; fractions, negative values, numeric strings, infinities, and missing fields are rejected as invalid input. The response contains xor, binary_xor, and hamming_distance. The decimal xor field is convenient for downstream bit-mask operations, binary_xor shows exactly which positions differ, and hamming_distance gives their count. Leading zeroes are intentionally omitted from binary_xor because they never change the distance. If your source values are wider than the safe-integer range, preserve them outside this capability rather than rounding them into numbers, since rounding can change low bits and yield a misleading distance. Common integrations use the count as a threshold, such as accepting a code within one changed bit, flagging a state with several toggles, or checking a known implementation against fixed vectors. The operation is symmetric, so exchanging a and b always produces the same output, and comparing any value with itself always yields zero.