Argon2id hash generator.

Argon2id is the recommended variant of Argon2, the memory-hard password hash by Biryukov, Dinu and Khovratovich that won the Password Hashing Competition in 2015 and is standardised in RFC 9106. It fills a region of memory you choose (tens of megabytes) with BLAKE2b-derived data and makes passes over it, so every guess costs an attacker that memory and time too.

It is a hybrid: the first half of the first pass reads memory in a data-independent order (Argon2i's way, safe against timing side channels), and everything after reads data-dependently (Argon2d's way, strongest against GPUs). That mix is what OWASP, libsodium and RFC 9106 recommend for storing passwords.

OWASP's current advice is 19 MiB of memory with 2 passes and 1 lane, or 46 MiB with 1 pass; RFC 9106's second recommendation is 64 MiB with 3 passes. This tool offers those three, with a 32-byte output, and writes the parameters into the hash ($argon2id$v=19$m=…,t=…,p=…) so a verifier needs nothing else.

Argon2id lets you set the memory cost, which is what makes GPU and ASIC cracking expensive; bcrypt has only a time cost and a 72-byte input limit. bcrypt is still sound and more widely deployed; Argon2id is the better design for a new system. Both salt automatically and both verify from the stored string alone.

The salt is 16 random bytes drawn in your browser for each run, so the same input gives a different hash every time, and that is correct: a salt stops attackers precomputing tables and hides which users share a password. The salt is written into the encoded hash, so a verifier needs nothing else. Press Rehash for a fresh one.

Nothing leaves your browser. The hash is computed on your machine, by the browser's Web Crypto API or a WebAssembly build of the algorithm loaded on first use, and the page makes no request with your input. You can load the page, go offline and keep hashing.

Paste a stored hash into the Verify field and the tool checks whether it is a hash of the current input, reading the salt and the cost from the hash itself, as a login would. The input is never sent anywhere; the check runs in your browser.

Yes: drop a file onto the input or choose it with the button, up to 64 MB, and it is hashed as the password. The File to Argon2id page opens on the file pane. A hash that takes a quarter of a second on a short password takes the same on a file, since the input is read once and the cost is in the memory and rounds.

No. The Argon2id hash generator is free and opens without a sign-in, an account or an install.

Nothing. The Argon2id hash generator holds your input in the page's memory, so closing or reloading the tab clears it, and it saves nothing in this browser.

The Argon2id hash generator offers 19 MiB, 2 passes, 1 lane (OWASP), 46 MiB, 1 pass, 1 lane (OWASP), and 64 MiB, 3 passes, 1 lane (RFC 9106). The default is 19 MiB, 2 passes, 1 lane (OWASP); a higher setting is slower for you and for anyone guessing.

The toolbar has Argon2id, Argon2d, and bcrypt, with the recommended one first. All three run in your browser on a WebAssembly build from the hash-wasm library, and each run takes a fresh 16-byte salt from crypto.getRandomValues.

The result is one self-describing string that holds the algorithm, the cost, the salt and the hash. A library's verify function can read it as it is, and so can the verify field on this page.

Argon2id takes a typed text or a file as input, and a file can be up to 64 MB.

Yes: the File to Argon2id page is the same tool, opening on the file pane.

Closest to the Argon2id hash generator: File to Argon2id, bcrypt hash generator, Argon2d hash generator, BLAKE2b hash generator. Each opens on its own page, free and in the browser.

The Argon2id hash generator is one of 64 in its group. The group's page, /tools/hash, lists them all.

The tool is free. Its interface is built from shadcn.io's own components (Button, Input, Slider and the rest of the registry under /ui), which come in React, Vue, Svelte and Solid. Pro adds the blocks and templates for the product around it.