_            _    _        _         _
      /\ \         /\ \ /\ \     /\_\      / /\
      \_\ \       /  \ \\ \ \   / / /     / /  \
      /\__ \     / /\ \ \\ \ \_/ / /     / / /\ \__
     / /_ \ \   / / /\ \ \\ \___/ /     / / /\ \___\
    / / /\ \ \ / / /  \ \_\\ \ \_/      \ \ \ \/___/
   / / /  \/_// / /   / / / \ \ \        \ \ \
  / / /      / / /   / / /   \ \ \   _    \ \ \
 / / /      / / /___/ / /     \ \ \ /_/\__/ / /
/_/ /      / / /____\/ /       \ \_\\ \/___/ /
\_\/       \/_________/         \/_/ \_____\/
ghc-cprng-aes 0.6.1
Dependencies: ghc-byteable@0.1.1 ghc-crypto-random@0.0.9 ghc-cipher-aes@0.2.11
Channel: guix
Location: gnu/packages/haskell-crypto.scm (gnu packages haskell-crypto)
Home page: https://github.com/vincenthz/hs-cprng-aes
Licenses: Modified BSD
Synopsis: Crypto Pseudo Random Number Generator using AES in counter mode in Haskell
Description:

Simple crypto pseudo-random-number-generator with really good randomness property.

Using ent, a randomness property maker on one 1Mb sample:

  • Entropy = 7.999837 bits per byte.

  • Optimum compression would reduce the size of this 1048576 byte file by 0 percent.

  • Chi square distribution for 1048576 samples is 237.02.

  • Arithmbetic mean value of data bytes is 127.3422 (127.5 = random).

  • Monte Carlo value for Pi is 3.143589568 (error 0.06 percent).

Compared to urandom with the same sampling:

  • Entropy = 7.999831 bits per byte.

  • Optimum compression would reduce the size of this 1048576 byte file by 0 percent.

  • Chi square distribution for 1048576 samples is 246.63.

  • Arithmetic mean value of data bytes is 127.6347 (127.5 = random).

  • Monte Carlo value for Pi is 3.132465868 (error 0.29 percent).

Total results: 1