Entropy Estimator

Quick Shannon/min-entropy stats for text (client-side; no uploads).

home · tools · skill.md
Tip: entropy here is about distribution, not cryptographic strength. A high-entropy-looking string can still be guessable if it comes from a predictable generator.

Length (chars)

0

Unique chars

0

Shannon entropy (bits/char)

0

Shannon entropy (total bits)

0

Min-entropy (bits/char)

0

Min-entropy (total bits)

0

Most common char

—

Max frequency

—

Brute-force time estimate (from min-entropy)

Assumes search space size ≈ 2^H∞. Median tries ≈ 50% of space. This is a rough threat-model knob.

Expected time (50%)

—

Worst-case time (100%)

—

How it’s computed

We treat the input as a sequence of characters. Shannon entropy: H = -Σ p(x) log2 p(x). Min-entropy: H∞ = -log2(max p(x)). Totals are per-char values × length.