Bcrypt / Argon2 Playground
Bcrypt and Argon2id are deliberately slow password hashing functions: they make each guess expensive for an attacker while staying fast enough for one legitimate login. This playground runs both through WebAssembly so you can see how cost, memory and parallelism change the hash and the time it takes.
Bcrypt vs Argon2id
Bcrypt focuses on CPU cost: the cost factor doubles the work with every increment, so 10–12 is a common production range. It caps the password at 72 bytes and needs a random 16-byte salt stored beside the hash.
Argon2id also forces memory use, which blunts GPU and ASIC cracking. OWASP suggests roughly 19 MiB of memory, 2 iterations and 1 degree of parallelism as a baseline, then tune upward until hashing takes about half a second on your hardware.
Never store the plain hash alone: record the algorithm, parameters and salt with it, and compare with a constant-time function in production.
This tool runs entirely in your browser. Your inputs and files are processed locally and are never sent to or stored on Kinetikatech servers.
Related pages
Server problem? Hacked site? Slow website?
Critical issues answered within 30 minutes, 24 hours a day, 7 days a week.