Multiscale Sieve for Smart Prime Generation and Application in Info-Security, IoT and Blockchain

The huge computational cost required to test whether a number is prime and the inefficiency of the known sieving algorithms for extremely large inputs have posed significant challenges in computational number theory. Traditional deterministic prime generation methods struggle to maintain performance when the input sizes increase exponentially. In this work, we show that, through multiscale distribution and deterministic prime number generation, it is possible to create a multiscale sieve with drastically better performance than the deterministic algorithms known to date, providing a more efficient solution for large-scale prime number generation, demonstrated by several benchmarks that highlight the potential of our approach. Consequently, we can gain some advantages in cryptography and in info-security, such as in IoT and blockchain environments.