SGA Prime Number Generator
Calculating...
-
Tested Limit
-
Primes Found
-
Time (seconds)
First 20 prime numbers found:
-
Last 20 prime numbers found:
-
About the Algorithm
The Selective Genealogical Algorithm (SGA) implements the selective propagation logic of the P System. It uses a priority queue to efficiently manage multiplication "tasks", identifying prime numbers as "emergences" when no task produces the current number.
Note: This demo uses WebAssembly compiled from Rust to offer native performance in the browser. The original Rust implementation can calculate primes up to 10¹² in about 28 minutes on consumer hardware.