title: Compression using prime numbers
body: <p>I think I've found a way you can do lossless compression using prime numbers or make other methods available over and over again.</p>
  
  <p>There are 54 prime numbers in the range 0-255. When we have the prime number in a byte array, we can store it using the prime number indexes of that number, using 6 bits instead of 8 bits, right?</p>
  
  <p>We need to create a map using a bit for each byte, which we can store for which numbers we are compressing, and add it to the data array.</p>
  
  <p>This seems to work at first, but increases the file size slightly, but reduces the file to a re-compressible structure for algorithms like LZ4 or Huffman.</p>
  
  <p>The indexes 0-53 correspond to the prime numbers 2-251, but there are unused numbers for 6 bits. (54-63). These 10 numbers can also be an opportunity to store 10 different non-prime numbers with the highest frequency in 6 bits. So we're going to squeeze more numbers. If this ratio exceeds 50%, we will be able to perform successful compression.</p>
  
  <p>In addition, this method can create an opportunity to recompress compressed numbers. Do you think that if we create a method for uint and ulong data types in 4 or 8 byte data blocks instead of one byte, we can reduce the map of compressed data to a smaller size, right?</p>
  
  <p>There are 203280221 prime numbers less than 2 ^ 32. This means that we can store 28 bits instead of 32 bits for each prime number.</p>
  
  <p>By looking at the ratio of prime numbers in the data array, we can determine whether we can perform efficient compression.</p>
  
  <p>I think that this method is not an effective compression method, but rather a data exchange that may allow re-compression of compressed files.</p>
  
  <p>I would like to ask you know of other methods that we can do using prime numbers? Because obtaining prime numbers was very easy, especially for numbers below 2 ^ 32. We need to add prime number methods to our methods.</p>