<s>
xoroshiro128+	B-Algorithm
(	O
named	O
after	O
its	O
operations	O
:	O
XOR	O
,	O
rotate	O
,	O
shift	O
,	O
rotate	O
)	O
is	O
a	O
pseudorandom	B-Algorithm
number	I-Algorithm
generator	I-Algorithm
intended	O
as	O
a	O
successor	O
to	O
xorshift+	O
.	O
</s>
<s>
Instead	O
of	O
perpetuating	O
Marsaglia	O
's	O
tradition	O
of	O
xorshift	B-Algorithm
as	O
a	O
basic	O
operation	O
,	O
xoroshiro128+	B-Algorithm
uses	O
a	O
shift/rotate	O
-based	O
linear	O
transformation	O
designed	O
by	O
Sebastiano	O
Vigna	O
in	O
collaboration	O
with	O
David	O
Blackman	O
.	O
</s>
<s>
The	O
lowest	O
bits	O
of	O
the	O
output	O
generated	O
by	O
xoroshiro128+	B-Algorithm
have	O
low	O
quality	O
.	O
</s>
<s>
use	O
xoroshiro128**	O
or	O
xoshiro256+	B-Algorithm
.	O
</s>
<s>
It	O
must	O
be	O
noted	O
,	O
though	O
,	O
that	O
the	O
same	O
test	O
is	O
failed	O
by	O
some	O
instances	O
of	O
the	O
Mersenne	B-Algorithm
Twister	I-Algorithm
and	O
WELL	B-Algorithm
.	O
</s>
<s>
David	O
Meister	O
,	O
who	O
implemented	O
it	O
in	O
Clojure	B-Language
,	O
made	O
some	O
valuable	O
statements	O
:	O
</s>
<s>
"	O
This	O
is	O
a	O
clojure	B-Language
implementation	O
of	O
the	O
xoroshiro128+	B-Algorithm
PRNG	O
described	O
at	O
http://xoroshiro.di.unimi.it	O
.	O
</s>
<s>
xoroshiro128+	B-Algorithm
is	O
designed	O
to	O
be	O
the	O
successor	O
to	O
xorshift128+	O
,	O
currently	O
used	O
in	O
the	O
JavaScript	O
engines	O
of	O
Chrome	O
,	O
Firefox	O
and	O
Safari	O
.	O
</s>
<s>
Both	O
xorshift128+	O
and	O
xoroshiro128+	B-Algorithm
have	O
a	O
period	O
of	O
2128	O
but	O
xoroshiro128+	B-Algorithm
is	O
benchmarked	O
by	O
the	O
authors	O
as	O
20%	O
faster	O
and	O
with	O
20%	O
fewer	O
failures	O
in	O
BigCrush	O
than	O
its	O
predecessor.	O
"	O
</s>
<s>
Low	O
memory	O
(	O
just	O
128	O
bits	O
of	O
storage	O
)	O
,	O
extremely	O
high	O
performance	O
(	O
1.2	O
nanoseconds	O
per	O
64-bit	O
number	O
,	O
after	O
subtracting	O
baseline	O
overheads	O
)	O
and	O
very	O
well	B-Algorithm
distributed	O
(	O
beating	O
other	O
algorithms	O
on	O
a	O
range	O
of	O
automated	O
tests	O
)	O
.	O
</s>
<s>
Mersenne	B-Algorithm
Twister	I-Algorithm
might	O
still	O
be	O
a	O
better	O
choice	O
for	O
highly	O
conservative	O
projects	O
unwilling	O
to	O
switch	O
to	O
such	O
a	O
new	O
algorithm	O
,	O
but	O
the	O
current	O
generation	O
of	O
statistically	O
tested	O
algorithms	O
brings	O
a	O
baseline	O
of	O
assurance	O
from	O
the	O
outset	O
that	O
previous	O
generations	O
lacked	O
.	O
</s>
