Failing ENT output is a little like the length of string; elusive. So I offer an anti-answer. The following is the output from running the code below and shows a random sequence passing ENT. You'll have to use some judement to weigh output diverging from this reference test.
The code executed for 1 MB, 10MB, 100MB, 1GB and 2GB random files using a decent cryptographic PRNG:-
public class SHA1 {
public static void main(String[] args) throws Exception {
try (DataOutputStream dos = new DataOutputStream(
new BufferedOutputStream(
new FileOutputStream(
new File("c:\\scratch\\SHA1-1GB.bin"))))) {
SecureRandom sr = new SecureRandom(new byte[]{42});
byte[] data = new byte[1_000_000];
for (long i = 0; i < 1000; i++) {
System.out.println(i);
sr.nextBytes(data);
dos.write(data);
}
}
}
}
C:\scratch>ent sha1-1mb.bin
Entropy = 7.999807 bits per byte.
Optimum compression would reduce the size
of this 1000000 byte file by 0 percent.
Chi square distribution for 1000000 samples is 268.02, and randomly
would exceed this value 27.54 percent of the times.
Arithmetic mean value of data bytes is 127.6351 (127.5 = random).
Monte Carlo value for Pi is 3.135252541 (error 0.20 percent).
Serial correlation coefficient is -0.001522 (totally uncorrelated = 0.0).
C:\scratch>ent sha1-10mb.bin
Entropy = 7.999982 bits per byte.
Optimum compression would reduce the size
of this 10000000 byte file by 0 percent.
Chi square distribution for 10000000 samples is 251.25, and randomly
would exceed this value 55.46 percent of the times.
Arithmetic mean value of data bytes is 127.5007 (127.5 = random).
Monte Carlo value for Pi is 3.140763656 (error 0.03 percent).
Serial correlation coefficient is 0.000043 (totally uncorrelated = 0.0).
C:\scratch>ent sha1-100mb.bin
Entropy = 7.999998 bits per byte.
Optimum compression would reduce the size
of this 100000000 byte file by 0 percent.
Chi square distribution for 100000000 samples is 241.51, and randomly
would exceed this value 71.86 percent of the times.
Arithmetic mean value of data bytes is 127.4998 (127.5 = random).
Monte Carlo value for Pi is 3.141108366 (error 0.02 percent).
Serial correlation coefficient is -0.000179 (totally uncorrelated = 0.0).
C:\scratch>ent sha1-1gb.bin
Entropy = 8.000000 bits per byte.
Optimum compression would reduce the size
of this 1000000000 byte file by 0 percent.
Chi square distribution for 1000000000 samples is 234.14, and randomly
would exceed this value 82.14 percent of the times.
Arithmetic mean value of data bytes is 127.5055 (127.5 = random).
Monte Carlo value for Pi is 3.141422821 (error 0.01 percent).
Serial correlation coefficient is 0.000024 (totally uncorrelated = 0.0).
C:\scratch>ent sha1-2gb.bin
Entropy = 8.000000 bits per byte.
Optimum compression would reduce the size
of this 2000000000 byte file by 0 percent.
Chi square distribution for 2000000000 samples is 231.40, and randomly
would exceed this value 85.30 percent of the times.
Arithmetic mean value of data bytes is 127.5032 (127.5 = random).
Monte Carlo value for Pi is 3.141451323 (error 0.00 percent).
Serial correlation coefficient is 0.000034 (totally uncorrelated = 0.0).
You will see both the pi approximation and chi squared values converging. For another truly random sample (pi out to 2.5 trillion places), chi is 12 as all digits become fairly equally distributed.
(Apologies for the formatting spaghetti)