<s>
The	O
spectral	B-Algorithm
test	I-Algorithm
is	O
a	O
statistical	O
test	O
for	O
the	O
quality	O
of	O
a	O
class	O
of	O
pseudorandom	B-Algorithm
number	I-Algorithm
generators	I-Algorithm
(	O
PRNGs	O
)	O
,	O
the	O
linear	B-Algorithm
congruential	I-Algorithm
generators	I-Algorithm
(	O
LCGs	B-Algorithm
)	O
.	O
</s>
<s>
LCGs	B-Algorithm
have	O
a	O
property	O
that	O
when	O
plotted	O
in	O
2	O
or	O
more	O
dimensions	O
,	O
lines	O
or	O
hyperplanes	O
will	O
form	O
,	O
on	O
which	O
all	O
possible	O
outputs	O
can	O
be	O
found	O
.	O
</s>
<s>
The	O
spectral	B-Algorithm
test	I-Algorithm
compares	O
the	O
distance	O
between	O
these	O
planes	O
;	O
the	O
further	O
apart	O
they	O
are	O
,	O
the	O
worse	O
the	O
generator	O
is	O
.	O
</s>
<s>
As	O
this	O
test	O
is	O
devised	O
to	O
study	O
the	O
lattice	O
structures	O
of	O
LCGs	B-Algorithm
,	O
it	O
can	O
not	O
be	O
applied	O
to	O
other	O
families	O
of	O
PRNGs	O
.	O
</s>
<s>
According	O
to	O
Donald	O
Knuth	O
,	O
this	O
is	O
by	O
far	O
the	O
most	O
powerful	O
test	O
known	O
,	O
because	O
it	O
can	O
fail	O
LCGs	B-Algorithm
which	O
pass	O
most	O
statistical	O
tests	O
.	O
</s>
<s>
The	O
IBM	O
subroutine	O
RANDU	B-Algorithm
LCG	B-Algorithm
fails	O
in	O
this	O
test	O
for	O
3	O
dimensions	O
and	O
above	O
.	O
</s>
