user84346: I want to generate my own private key with dice and/or other very entropic phenomenon. But how can I calculate if my data have a good entropy ? I mean if I throw dice in a certain way too much time maybe my outcome will not be trully random, maybe my dice is not a very good dice and have imperfection etc.
So can I just throw it 300+ and if I don't have 0.166666% each result (1,2,3,4,5,6) it's not good ?
Also I want to write my own series of dice result just to compare how deficient is my brain when I try to generate true randomness.
Thanks

user10377: Try using the an open source program called ent. Here are the results for rolling a die six times with the result vector of <666666>.
% echo -n "666666" | ./ent
Entropy = 0.000000 bits per byte.
Optimum compression would reduce the size
of this 6 byte file by 100 percent.
Chi square distribution for 6 samples is 1530.00, and randomly
would exceed this value less than 0.01 percent of the times.
Arithmetic mean value of data bytes is 54.0000 (127.5 = random).
Monte Carlo value for Pi is 4.000000000 (error 27.32 percent).
Serial correlation coefficient is undefined (all values equal!).

84346: <p>I want to generate my own private key with dice and/or other very entropic phenomenon. But how can I calculate if my data have a good entropy ? I mean if I throw dice in a certain way too much time maybe my outcome will not be trully random, maybe my dice is not a very good dice and have imperfection etc.</p>

<p>So can I just throw it 300+ and if I don't have 0.166666% each result (1,2,3,4,5,6) it's not good ?</p>

<p>Also I want to write my own series of dice result just to compare how deficient is my brain when I try to generate true randomness.</p>

<p>Thanks</p>
 10377: <p>Try using the an open source program called <strong><a href="http://www.fourmilab.ch/random/" rel="nofollow noreferrer">ent</a></strong>. Here are the results for rolling a die six times with the result vector of &lt;666666>.</p>

<p><strong>% echo -n "666666" | ./ent</strong></p>

<p>Entropy = 0.000000 bits per byte.</p>

<p>Optimum compression would reduce the size
of this 6 byte file by 100 percent.</p>

<p>Chi square distribution for 6 samples is 1530.00, and randomly
would exceed this value less than 0.01 percent of the times.</p>

<p>Arithmetic mean value of data bytes is 54.0000 (127.5 = random).
Monte Carlo value for Pi is 4.000000000 (error 27.32 percent).
Serial correlation coefficient is undefined (all values equal!).</p>
