Pattern matching for human readable prime number compression (HRPNC)

1 . A method comprising:

identifying, in a binary object, one or more portions of the binary object matching one or more patterns,

wherein identifying, in the binary object, the one or more portions of the binary object matching the one or more patterns comprises:

for each value of a counter, until a termination condition is satisfied, determining, for each prime number of a plurality of prime numbers, whether the binary object includes a portion matching the value of the counter multiplied by the prime number;

performing human readable prime number compression (HRPNC) on each portion of the one or more portions to generate one or more compressed portions; and

generating, for the binary object, a compressed binary object comprising a concatenation of the one or more compressed portions.

2 . The method of claim 1 , further comprising performing HRPNC on one or more remaining portions of the binary object not matching the one or more patterns to generate one or more compressed remaining portions, wherein the compressed binary object further comprises a concatenation of the one or more compressed remaining portions.

3 . The method of claim 1 , wherein the one or more patterns comprise a power of two.

4 . The method of claim 1 , wherein the one or more patterns comprise a product of a prime number.

5 . The method of claim 1 , wherein identifying, in the binary object, the one or more portions of the binary object matching the one or more patterns comprises:

initializing the counter based on a multiplication factor.

6 . The method of claim 1 , wherein the termination condition comprises analyzing the binary object using each possible counter value and prime number combination.

7 . The method of claim 1 , wherein the termination condition comprises determining that an entirety of the binary object is represented in the identified one or more portions.

8 . An apparatus comprising:

a processing device; and

memory operatively coupled to the processing device, wherein the memory stores computer program instructions that, when executed, cause the processing device to:

identify, in a binary object, one or more portions of the binary object matching one or more patterns,

wherein to identify, in the binary object, the one or more portions of the binary object matching the one or more patterns, the computer program instructions, when executed, further cause the processing device to:

for each value of a counter, until a termination condition is satisfied, determine, for each prime number of a plurality of prime numbers, whether the binary object includes a portion matching a value that is based on the value of the counter and the prime number;

perform human readable prime number compression (HRPNC) on each portion of the one or more portions to generate one or more compressed portions; and

generate, for the binary object, a compressed binary object comprising a concatenation of the one or more compressed portions.

9 . The apparatus of claim 8 , wherein the computer program instructions, when executed, further cause the processing device to perform HRPNC on one or more remaining portions of the binary object not matching the one or more patterns to generate one or more compressed remaining portions, wherein the compressed binary object further comprises a concatenation of the one or more compressed remaining portions.

10 . The apparatus of claim 8 , wherein the one or more patterns comprise a power of two.

11 . The apparatus of claim 8 , wherein the one or more patterns comprise a product of a prime number.

12 . The apparatus of claim 8 , wherein to identify, in the binary object, the one or more portions of the binary object matching the one or more patterns, the computer program instructions, when executed, further cause the processing device to:

initialize the counter based on a multiplication factor.

13 . The apparatus of claim 8 , wherein the termination condition comprises analyzing the binary object using each possible counter value and prime number combination.

14 . The apparatus of claim 8 , wherein the termination condition comprises determining that an entirety of the binary object is represented in the identified one or more portions.

15 . A computer program product comprising a computer readable storage medium, wherein the computer readable storage medium comprises computer program instructions that, when executed:

identify, in a binary object, one or more portions of the binary object matching one or more patterns,

wherein to identify, in the binary object, the one or more portions of the binary object matching the one or more patterns, the computer program instructions, when executed;

for each value of a counter, until a termination condition is satisfied, determine, for each prime number of a plurality of prime numbers, whether the binary object includes a portion matching a value that is based on the value of the counter and the prime number;

perform human readable prime number compression (HRPNC) on each portion of the one or more portions to generate one or more compressed portions; and

generate, for the binary object, a compressed binary object comprising a concatenation of the one or more compressed portions.

16 . The computer program product of claim 15 , wherein the computer program instructions, when executed, perform HRPNC on one or more remaining portions of the binary object not matching the one or more patterns to generate one or more compressed remaining portions, wherein the compressed binary object further comprises a concatenation of the one or more compressed remaining portions.

17 . The computer program product of claim 15 , wherein the one or more patterns comprise a power of two.

18 . The computer program product of claim 15 , wherein the one or more patterns comprise a product of a prime number.

19 . The computer program product of claim 15 , wherein to identify, in the binary object, the one or more portions of the binary object matching the one or more patterns, the computer program instructions, when executed:

initialize the counter based on a multiplication factor.

20 . The computer program product of claim 15 , wherein the termination condition comprises analyzing the binary object using each possible counter value and prime number combination.