Password Strength Checker
Estimate how long a password would survive, and see exactly what weakens it.
AND, OR, XOR, shifts and rotates, at 8 to 64 bits, shown in binary.
The Bitwise Calculator works at up to 64 bits using arbitrary-precision integers, so a 64-bit mask behaves like one — unlike JavaScript’s own operators, which coerce to a signed 32-bit integer and quietly give the wrong answer.
Every bitwise operation, with the operands and the result laid out in binary so you can see which bits moved. Enter numbers in any base — hex, binary, octal or decimal — and choose a width from 8 to 64 bits.
The 64-bit support is the part that matters. JavaScript coerces both operands to a signed 32-bit integer before applying any bitwise operator, so `1 << 40` evaluates to 256 rather than a trillion, and `0xFFFFFFFF | 0` is −1. This calculator uses arbitrary-precision integers throughout, so a 64-bit mask behaves like a 64-bit mask. It also distinguishes the two right shifts properly: the arithmetic one copies the sign bit in, the logical one brings in zeros.
1 << 40 gives a trillion, not 256. Every operation runs on BigInt, so nothing is silently truncated to 32 bits.
Arithmetic copies the sign bit in; logical brings in zeros. The difference only shows on negative numbers, and it shows badly.
AND, OR, XOR, NAND, NOR, XNOR, NOT, two shifts, a logical shift and both rotates.
Both operands and the result stacked, so you can read which bit came from where.
Prefix with 0x, 0b or 0o, or write decimal — the base is detected from what you type.
Decimal, or prefixed 0x, 0b or 0o — the base is detected.
8, 16, 32 or 64 bits; the result wraps to that width.
AND, OR, XOR, NAND, NOR, XNOR, NOT, three shifts and two rotates.
Both operands and the result in binary, aligned so the columns line up.
Because the operands are coerced to signed 32-bit integers first, so the shift count is taken modulo 32 — 40 becomes 8, and 1 << 8 is 256. Use BigInt, as this calculator does, and you get the trillion you expected.
>> is arithmetic: it copies the sign bit into the vacated positions, so a negative number stays negative. >>> is logical: it always brings in zeros, so the result is never negative.
AND the value with a mask of just that bit — value & (1 << n) — and compare the result against zero. To set the bit, OR with the same mask; to clear it, AND with the inverse.
Because it is its own inverse. XOR with the same mask twice returns the original value, so one operation both sets and clears depending on what was there.
What people who use the Bitwise Calculator think of it. Reviews come from visitors and are posted as written.
No ratings yet
Yours would be the first.
0 reviews
Newest first
No reviews yet
Be the first to rate the Bitwise Calculator. It takes half a minute and no account.
Write the first reviewEstimate how long a password would survive, and see exactly what weakens it.
Turn an SVG into a React component with the attributes React expects.
Convert JSON into a PHP array literal or a typed class you can paste into a project.
Build media queries with framework breakpoints and modern features.
Generate ULIDs — sortable by creation time and case-insensitive.
Turn text, SVG or a small file into a data: URI you can inline anywhere.
Draw a grid layout and get the CSS, including named template areas.
Shape corners individually, including the elliptical slash syntax.