A Kohonen self-organizing map learns the shape of verified true-random data. Keys that land on the manifold are strong. Keys that drift off it are flagged as anomalous — and within a domain, duplicate or non-orthogonal keys are caught too.
The same loop the animation is running: turn each key into a feature vector, let neurons compete to match it, then pull the winner and its neighbours closer. After enough passes the grid becomes a map of what "good random" looks like — the reference your files are scored against.
Each key becomes a 15-value vector — bit balance, transition rate, run lengths, autocorrelation, n-gram entropy, positional means. Structure a raw bitstring hides becomes measurable geometry.
For every vector the closest neuron wins — the Best Matching Unit. The winner and a shrinking neighbourhood move toward the input. Learning rate and radius decay each epoch, so the map settles.
A new key is scored by how far its BMU sits from it — the quantization error. Small error means it lives where verified entropy lives: strong. A large error trips the anomaly threshold from the reference stats.
The reference manifold is learned from verified quantum- and true-random entropy. Any incoming key stream — whatever its source — is scored against it: genuine entropy lands on the manifold, deterministic or biased generators drift off and are flagged.
Hardware entropy from quantum phenomena (photon paths, vacuum noise, tunnelling). The gold standard the reference map is tuned to — these keys sit deepest in the manifold.
Physical entropy from classical noise (thermal, jitter, avalanche). Verified true-random output scores on-manifold; a drifting or faulty source shows up as rising anomalies.
Deterministic, algorithmic output (counters, LCGs, seeded streams). Statistically random-looking but structurally different — structured or low-entropy PRNG keys drift off the manifold and flag.