diff options
Diffstat (limited to 'dev-haskell/splitmix/metadata.xml')
| -rw-r--r-- | dev-haskell/splitmix/metadata.xml | 28 |
1 files changed, 4 insertions, 24 deletions
diff --git a/dev-haskell/splitmix/metadata.xml b/dev-haskell/splitmix/metadata.xml index 80f38d62e4f5..5dfa6c440d86 100644 --- a/dev-haskell/splitmix/metadata.xml +++ b/dev-haskell/splitmix/metadata.xml @@ -8,28 +8,8 @@ <use> <flag name="optimised-mixer">Use JavaScript for mix32</flag> </use> - <longdescription> - Pure Haskell implementation of SplitMix described in - - Guy L. Steele, Jr., Doug Lea, and Christine H. Flood. 2014. - Fast splittable pseudorandom number generators. In Proceedings - of the 2014 ACM International Conference on Object Oriented - Programming Systems Languages & Applications (OOPSLA '14). ACM, - New York, NY, USA, 453-472. DOI: - <https://doi.org/10.1145/2660193.2660195> - - The paper describes a new algorithm /SplitMix/ for /splittable/ - pseudorandom number generator that is quite fast: 9 64 bit arithmetic/logical - operations per 64 bits generated. - - /SplitMix/ is tested with two standard statistical test suites (DieHarder and - TestU01, this implementation only using the former) and it appears to be - adequate for "everyday" use, such as Monte Carlo algorithms and randomized - data structures where speed is important. - - In particular, it __should not be used for cryptographic or security applications__, - because generated sequences of pseudorandom values are too predictable - (the mixing functions are easily inverted, and two successive outputs - suffice to reconstruct the internal state). - </longdescription> + <upstream> + <remote-id type="hackage">splitmix</remote-id> + <remote-id type="github">haskellari/splitmix</remote-id> + </upstream> </pkgmetadata> |