CLZ, or Count Leading Zeros, returns the number of consecutive zero bits starting from the most significant bit down to the first 1 bit. In a 32-bit register the value 1 has 31 leading zeros.

Why does width matter?

Leading zeros are only meaningful relative to a fixed register size. The same value has more leading zeros in a 64-bit register than in a 32-bit one, so the tool asks you to pick the width explicitly.

What is CLZ used for?

It computes the integer base-2 logarithm (floor of log2 equals width minus CLZ minus one), normalises floating-point mantissas, rounds up to the next power of two, and speeds up priority encoders and big-integer routines.

What does CLZ return for zero?

By convention here a value of zero has all bits zero, so its leading-zero count equals the full register width. Note that some hardware leaves CLZ of zero undefined, so check your platform.

What if my number is too big for the width?

If the value needs more bits than the selected width, it cannot be represented and the tool reports that it does not fit. Increase the width or reduce the value.

Leading Zeros Counter (CLZ)

Count Leading Zeros (CLZ) tells you how many zero bits sit above the highest set bit of a number in a fixed-width register. It is a single CPU instruction on modern hardware and a building block for fast logarithms, normalisation, and power-of-two rounding. This tool computes it for any value and width from 8 to 128 bits.

How it works

For a value that fits within the chosen width w, the leading-zero count is the width minus the number of significant bits:

significant bits = number of bits to write the value in binary
CLZ              = w − significant bits      (and CLZ = w when value is 0)

The position of the highest set bit is then w − CLZ − 1, counting from the least-significant bit as position 0. Because leading zeros depend entirely on the register size, the tool zero-pads the binary form to the selected width so you can see the leading zeros directly.

Example and notes

The hex value 0x00010000 is 2^16. In a 32-bit register it is written as fifteen zeros, a single 1, then sixteen zeros, giving a CLZ of 15 and a highest set bit at position 16. The integer base-2 logarithm follows immediately: floor(log2(x)) = w − CLZ − 1. CLZ also lets you round up to the next power of two and normalise floating-point numbers. Be aware that on some processors CLZ of zero is undefined; this tool defines it as the full width for convenience.