Quick methods of finding all simple numbers less than n

What are the most rapidly finding algorithms of all simple numbers less than all known:

and what are the quick implementations on Python, Numpy, etc.)?

   de   eratosthenes2  ( n ):  multiples =  set  ()   for  i  range  ( 2 , n+ 1 ):   if  i  not   in  multiples:   yield  i multiples.update ( range  (i*i, n+ 1 , i))     
 
  
 PS The idea of ​​creating this issue is related to constantly emerging  new  questions about the effective implementation of all simple numbers less than n.