Large interval tests are added to all languages.

it's actually enough to perform checks only until the square root of n

Yes; maybe this should be a "follow up" version (like Advent of Code)

Better use Set to store valid faces

4. In boolean prime(int n) you don't need to check numbers from 2 to n - it's enough to check from 2 to n/2.

omg that's great!

Maybe add some simple test cases for big numbers to filter out performance heavy solutions?
e.g.

[(1, 2147483647)] => 2147483646
[(1, 2147483640), (2147483643, 2147483647)] => 2147483643
[(1, 1147483640), (147483640,87483640), (1147483643, 2147483647)] => 2147483643

too much comments. You don't need most of them. They just clutter the code.

Why is it considered best practice? I would downvote if I could:

1. It does not work. For example try:

minimumNumber(new int [] { 1328 });

(https://en.wikipedia.org/wiki/Prime_gap)

2. sum is calculated for each iteration. It can be computed once
3. Instead of toArray()[0] you can use findFirst()

I don't like side effects of filter function. To get number of zeros you can just subtract lengths of both arrays:
arr.length - withoutZeros.length
Please see my solution for reference