For those checking out the ineptech site, please don't miss the poetry compiler joke! It's the bit I'm the most proud of. It's in an unlinkable modal so actually I'll just paste it here:

    Upon a stack of bits, about so tall,           // Boolean[] isprime = new Boolean[n];
    just think, O traveller, what we could do      // Arrays.fill(isprime, true);
    if every other bit was set to false            // for (int i = 4; i < n; i+=2)
    beginning with (but not including) two?        //   isprime[i] = false;
    
    Now take two lowly numbers, A and B            // for (int a = 3; a < n; a += 2)
    that equal three and two. What would happen    // {
    if they, by twos and ones respectively,        //   for (int b = 2; a*b < n; b++)
    were incremented in a nested fashion,          //   {
    
    And if we falsified, at every turn,            //     isprime[a*b] = false;
    the value offset by A groups of Bs?            //   }
    Then to the aether let those bits return,      // }
    to fly back home to Eratosthenes!              // return isprime;

(You may have figured out that I put a lot more time in to the silly programmer jokes in the fake site than in to the app. Wonder why it never took off...)