Bcrypt Hash
Hash & verify passwords with bcrypt, cost control.
About the Bcrypt Hash
Hash passwords with bcrypt or verify a password against an existing hash, via bcryptjs running fully in your browser. The salt rounds (cost factor) are adjustable from 4 to 14 โ about 16 to 16,384 iterations โ and the output uses the standard $2b$ format with embedded salt and checksum.
How to use the Bcrypt Hash
- Enter the password in the password field.
- Set the salt rounds โ 10 or higher is the usual production choice.
- Press Hash password and copy the resulting $2b$ string.
- To check a login, paste an existing hash below and press Verify.
Bcrypt Hash FAQ
What does the salt rounds slider change?
The cost factor: each step doubles the work โ 10 rounds is about 1,024 iterations and 14 is 16,384 โ trading hash time against brute-force resistance; higher values take noticeably longer in the browser.
How does verification work?
The salt is read from the hash itself and the same slow function reruns on your candidate password; a match means the password is correct, while a mismatch or malformed hash reports no match.
Why bcrypt instead of SHA-256 for passwords?
Fast hashes let attackers try billions of guesses per second; bcrypt is deliberately slow and salted per password, which is why the tool's note calls it exactly what you want for stored passwords.