We introduce an algorithm that computes the prime numbers up to N using O(N/log log N) additions and $N^{1/2+o(1)}$ bits of memory. The algorithm enumerates ...