🔬 Input Data

Enter hex data, random bytes, or any string:

📐 Shannon Entropy: H(X) = -Σ p(x) × log₂(p(x))
Perfect random = 8.0 bits/byte • Crypto-safe ≥ 7.9 • Math.random() ≈ 6-7

📊 Entropy Analysis Results

Shannon Entropy

bits per byte (max 8.0)

Security Rating

Overall assessment

Security Level --

WeakAcceptableStrongPerfect

Total Bytes

Unique Bytes

Chi-Square p

🧪 NIST Randomness Tests (Subset)

Analyze data to run tests

🌡️ Byte Distribution Heatmap

Low freq

High freq

📈 Byte Frequency Distribution

⚔️ Math.random() vs crypto.getRandomValues()

Property	Math.random()	crypto.getRandomValues()
Entropy (bits/byte)	~6.5	~7.99
Cryptographic Safe	NO ✗	YES ✓
Predictable	YES (LCG)	NO (CSPRNG)
Seed Required	Internal (hidden)	OS Entropy Pool
NIST Compliant	NO	YES
Use for Keys	NEVER	RECOMMENDED
State Recovery	Possible	Impossible

🎂 Birthday Paradox — Collision Probability

Given a wallet using N bits of entropy, the probability of collision with the Bitcoin network (estimated 100M wallets):

32 bits

Entropy Level

~2.3% collision

64 bits

Entropy Level

~1 in 5×10⁹

128 bits

BIP39 Standard

~2.7×10²³ years

256 bits

Maximum Security

Computationally impossible

🎓 Why this matters:
BIP39 uses 128-256 bits of entropy for seed generation. Using Math.random() for seed generation reduces effective entropy to ~32-48 bits — making brute force attacks feasible for nation-state attackers. Always use window.crypto.getRandomValues() for any cryptographic randomness.