The Encryption Test encrypts blocks of random data using several different encryption techniques, such that the resulting data can only be accessed by someone with the encryption key. The specific formula used for this test is the Sieve of Atkin with a limit of 32 million. This test uses about 4MB of memory per core. All operations are performed using 64-bit integers.

This algorithm uses loops and CPU operations that are common in computer software, the most intensive being multiplication and modulo operations. A prime number is a number that can only be divided by itself and 1. The Prime Number Test aims to test how fast the CPU can search for Prime numbers, reported as operations per second. This tests uses memory buffers totaling about 4MB per core. The compression test uses Crypto++ Gzip (based on the DEFLATE compression algorithm). This test uses complex data structures and complex data manipulation techniques to perform a function that is very common in software applications, ranging from backup software to Email software. The result is reported in Kilobytes per Second. The Compression Test measures the speed that the CPU can compress blocks of data into smaller blocks of data without losing any of the original data. This tests uses integer buffers totaling about 240kb per core.

The test uses large sets ofĪn equal number of random 32-bit and 64-bit integers and adds, subtracts, multiplies and divides these numbers.

This is a basic operation in all computer software and provides a good indication of 'raw' CPU throughput. An integer is a whole number with no fractional part. The Integer Math Test aims to measure how fast the CPU can perform mathematical integer operations.

Is quick cpu free