tixzdk

I pay 15€ for unlimited everything in Denmark (but with reasonable caps imposed on European roaming)

My hair and my beard

Important excerpt from random.c:

   * When random bytes are desired, they are obtained by taking the SHA
   * hash of the contents of the "entropy pool".  The SHA hash avoids
   * exposing the internal state of the entropy pool.  It is believed to
   * be computationally infeasible to derive any useful information
   * about the input of SHA from its output.  Even if it is possible to
   * analyze SHA in some clever way, as long as the amount of data
   * returned from the generator is less than the inherent entropy in
   * the pool, the output data is totally unpredictable.  For this
   * reason, the routine decreases its internal estimate of how many
   * bits of "true randomness" are contained in the entropy pool as it
   * outputs random numbers.
   *
   * If this estimate goes to zero, the routine can still generate
   * random numbers; however, an attacker may (at least in theory) be
   * able to infer the future output of the generator from prior
   * outputs.  This requires successful cryptanalysis of SHA, which is
   * not believed to be feasible, but there is a remote possibility.
   * Nonetheless, these numbers should be useful for the vast majority
   * of purposes.

This is the same old story. /dev/urandom is what you should use, unless you believe that the hash function is broken

I think the article gets this wrong. `window.crypto` should be read-only

"A woman wearing a red hat" from the samples cracked me up

And the letter, which was sent as priority mail, had been opened when they went to retrieve it...

Denmark does as well, to a high degree

K-medians or k-medoids yield more pleasing results in my experience