I'd rather not have a pointless debate about what a Sieve is or is not in terms of programming.
But I believe it's used for TEA!
The algorithm I talked about was the fastest available for most average programmers (I wasn't trying to say that no one can make faster) that is not using the complex L1/L2 cache method.
