Search-space press

A small seed casts a small shadow.

Deterministic expansion can produce mountains of useful output. An attacker who can enumerate the seed still takes the shortcut.

Hands-on evidence

Watch a weak seed collapse

A deterministic generator can stretch a seed into a very long output. It cannot make the original search space larger.

32 bits
2^30 seeds/s
Looks like256 bitsWidth of generated output
Searches like32 bitsWidth of the seed space
Exhaustive model4.0 secondsat 2^30 seeds/second

Moss shows credited strength, not reachable-output coverage. The true reachable fraction is far too tiny for this grid once output width exceeds seed width.

Width is not uncertainty

An attacker enumerates at most 2^32 seeds, regenerates each 256-bit output, and compares results. Almost all apparent outputs are unreachable from this seed model.

The grid is a proportional teaching diagram, not a literal map of every output. A secure generator still needs an unpredictable seed of adequate strength.