Information-theory learner
Reproduce entropy from individual probabilities.
Compare AAAA, ABAB, AABB and AAAB and add the displayed contributions.
Understands zero entropy for one symbol and equal entropy for reordered distributions.
Calculate empirical Shannon entropy from scalar, grapheme or UTF-8 byte frequencies. Inspect probabilities and export a report without security claims.
A quick decision brief for this specific tool
Text source
Complete JSON report
A dedicated interactive panel for this data format or operation
Choose your path
Measure empirical scalar, grapheme or UTF-8 byte distributions, expose probabilities and Shannon contributions, and separate evenness from unpredictability.
Reproduce entropy from individual probabilities.
Compare AAAA, ABAB, AABB and AAAB and add the displayed contributions.
Understands zero entropy for one symbol and equal entropy for reordered distributions.
Distinguish text-symbol entropy from encoded-byte entropy.
Analyze one emoji as scalars then UTF-8 bytes; inspect byte identities and normalization choices.
Knows the selected observation unit and does not call it password strength.
Keep a complete, inspectable analysis record.
Import a fixture, change policies, review long distributions and export the complete report.
Old results are invalidated and model assumptions travel with the report.
Outputs and checklists are planning aids. Review the linked current authorities and the records, terms, instructions, and requirements that apply to your exact situation before a consequential decision.
Tools you might need next
Decode binary bytes with strict UTF-8 or ASCII validation. Choose token grouping and BOM handling, inspect every byte, and export the complete decoded text.
Decode complete Morse tokens with explicit slash or line-break word boundaries. Refuse unknown signals, inspect character rows, and export the full transcript.
Generate predictable placeholder paragraphs with four styles, exact sentence counts and an offset. Preview and export plain text or HTML fragments.
For each selected symbol, p=count/N and H=−Σp·log2(p). Base 2 gives bits per symbol. Empty input returns zero by convention.
The maximum log2(k) uses observed distinct symbols only. Evenness H/log2(k) is undefined for fewer than two symbol types.
Symbol frequencies ignore order and dependence. Evenness and N×H do not estimate passwords, cryptographic randomness, prediction difficulty or actual compression size.
Updated: August 2026
Reproduce entropy from individual probabilities. Compare AAAA, ABAB, AABB and AAAB and add the displayed contributions.
Distinguish text-symbol entropy from encoded-byte entropy. Analyze one emoji as scalars then UTF-8 bytes; inspect byte identities and normalization choices.
Keep a complete, inspectable analysis record. Import a fixture, change policies, review long distributions and export the complete report.
A predictable repeating sequence can have uniform symbol frequency.
It is an independent-symbol model quantity, not a compressor or file-format measurement.
Measure empirical scalar, grapheme or UTF-8 byte distributions, expose probabilities and Shannon contributions, and separate evenness from unpredictability.