The description of Math.NumberTheory.Primes.Heap says that it is "very slow compared to [Math.NumberTheory.Primes.Sieve]" and it is "mainly intended for comparison and verification". Well, I doubt its utility for verification, both because it is quite entangled and because it caused an out-of-bounds error (ca58e0f7300595bea01f57a4f8075496df5f4d4c) before. But at least as soon as it is not intended for use in production, it should be deprecated to avoid users' confusion.
The description of
Math.NumberTheory.Primes.Heapsays that it is "very slow compared to [Math.NumberTheory.Primes.Sieve]" and it is "mainly intended for comparison and verification". Well, I doubt its utility for verification, both because it is quite entangled and because it caused an out-of-bounds error (ca58e0f7300595bea01f57a4f8075496df5f4d4c) before. But at least as soon as it is not intended for use in production, it should be deprecated to avoid users' confusion.