Create Primes.asm

Optimal Sieve to produce prime numbers. The output will form a string of 1s and 0s. 1 being nonprime, 0 being prime.
The final string is represented in the following way. 10*(floor|N/4|)+x[N%4] where x={1,3,7,9} and N represents the strings position and x its value.

** Keys
 - Only 1/3rd of the total subset needs to be computed for %100 accuracy.
 - ASM and reduced sets
 - Primes! How could you dislike primes?!


There's still more magic to come! Possibly the next version will be in C (i don't think the asm helped much with the speed.) 

Someone who knows some set theory or thinks they can help, please contact my email.