Cryptographically verifiable, distributed dependency reviews
Add the last reviewed version to Cargo.toml / [dependencies]:
rand_xorshift = "0.3.0"Please, use mobile in landscape.
Filter reviews clicking on the numbers in the summary.
Full column names in tooltip hints: rating Negative, rating Neutral, rating Positive, rating Strong, thoroughness, understanding, reviews count.
This implements a xorshift RNG with 128 bits of state.
The implementation uses no unsafe, and does not even require std. The code is
straightforward, and matches the code from the paper that describes the RNG
("Xorshift RNGs" by George Marsaglia).
Seeding from an existing RNG can theoretically hang if the seeding RNG keeps
returning zeroes. I filed https://github.com/rust-random/rngs/issues/24 about
this and capped the rating at "positive".
This implements a xorshift RNG with 128 bits of state.
The implementation uses no unsafe, and does not even require std. The code is
straightforward, and matches the code from the paper that describes the RNG
("Xorshift RNGs" by George Marsaglia).
Seeding from an existing RNG can theoretically hang if the seeding RNG keeps
returning zeroes. I filed https://github.com/rust-random/rngs/issues/24 about
this and capped the rating at "positive".
Uses a semi-unnecessary unsafe for speed, which I dislike, but is overall harmless.
© bestia.dev 2023, MIT License, Version: 2023.608.1636
Open source repository for this web app: https://github.com/bestia-dev/cargo_crev_web/
This is a very small crate. The RNG doesn't make any security guarantees, which makes the risks associated with the crate low. The code seems to implement the algorithm from the paper straightforwardly, although it doesn't specify why the particular values for a, b, c were chosen. (They don't seem to appear in the paper)