High Performance Storage of Prime Numbers
I designed a compression algorithm to store prime numbers. Basically, a bitmap is used to store the fact that numbers are prime or not, but only numbers which are not multiple of 2, 3 .... 23 are considered in the bitmap.
For numbers below 10^13, this allows to store the prime numbers with a maximum size of 0.456 bytes per prime.
Details can be found in this article: https://teraprimes.org/downloads/High_Performance_Storage_of_Prime_Numbers.pdf
I would welcome any comment !