PIPELINE Hashing & Validation Intermediate 2 steps

Multi-hash speed comparison

When choosing a hash algorithm for a performance-sensitive path, this chain first hashes the input with a reference algorithm, then runs a speed benchmark across several algorithms. The benchmark output lets you compare throughput (ops/sec) and pick the right trade-off between speed and collision resistance.

What it solves

Hash the input and benchmark multiple hash algorithms to compare their speed and output.

Input → Output

Hash Calculator input → Hash Crack Speed Reference output across 2 steps.

Runs in

1–2 minutes · fully local in your browser.

Before you start

A text payload to hash and benchmark

The pipeline

1 Hash Calculator hash

Compute MD5, SHA-1, SHA-256, or SHA-512 hashes with hex or Base64 output. Free, private, and 100% client-side.

Params: algorithm=sha256
2 Hash Crack Speed Reference hash-speed

Reference table of hash cracking speeds (educational). Free, private, 100% client-side.

Open in Toolchain

Runs locally in your browser. The recipe defines the pipeline only — your input never leaves this tab.

▶Run this workflow

Enter your input below and click Run. All processing happens locally in your browser — nothing is uploaded.

Input data

Pipeline progress

Hash Calculatorhash
Hash Crack Speed Referencehash-speed

Sample input

The quick brown fox jumps over the lazy dog

Expected output

Algorithm            Speed             Notes
─────────────────────────────────────────────────────────────────
MD5                  ~10 billion/s      Broken, not for security. GPU can crack 8-char in seconds.
SHA-1                ~5 billion/s       Broken for collisions (2017). Not for security.
SHA-256              ~3 billion/s       Secure. Used in Bitcoin mining.
SHA-512              ~1.5 billion/s     Secure. 64-bit optimized.
SHA3-256             ~1 billion/s       Secure. NIST standard.
BLAKE2b              ~4 billion/s       Faster than SHA-3, secure.
BLAKE3               ~10 billion/s      Fastest, parallelizable.
RIPEMD-160           ~3 billion/s       Used in Bitcoin addresses.
bcrypt (cost=12)     ~10/s              Slow by design. Strong against brute force.
scrypt (N=16384)     ~100/s             Memory-hard. Strong against GPU/ASIC.
Argon2id             ~50/s              PHC winner. Memory + time hard.
PBKDF2 (100k iter)   ~100/s             Iterated. Adjustable cost.

Note: Speeds are approximate for modern GPUs/ASICs.
Key derivation functions (bcrypt/scrypt/Argon2) are intentionally slow.

This pair is executed against the real tools at build time (tests/unit/recipes.test.ts) — the expected output is verified, not illustrative.