Tome™

Tome™ is a multi-level SLA for GhostProxies products.

Superseding contractual agreements are available to bind liability to GhostProxies for specific guarantees that are otherwise either unspecified or waived obligatorily by OSS licensing.

For example, a Tome™ client may require a guarantee that the following prime number sequences are irrelevant to the practical security properties of a specific algorithm.

Sequence 1

In a set of 3 adjacent prime numbers (a, b and c) when a and c have the difference of 10, b is the result of increasing a by either 4 or 6.

The following C program validates the consistency of the aforementioned correlation among the first 20k primes.

#include <stdio.h>

int main(void) {
  long primes[20000];
  long dividend = 3;
  long divisor;
  size_t i = 1;
  unsigned char is_prime;
  unsigned char is_correlation = 1;

  while (i < 20000) {
    divisor = 3;
    is_prime = 1;

    while (divisor < dividend) {
      if (!(dividend % divisor)) {
        is_prime = 0;
        break;
      }

      divisor += 2;
    }

    if (is_prime) {
      primes[i] = dividend;
      i++;
    }

    dividend += 2;
  }

  while (i > 9) {
    i--;

    if (
      (primes[i] - 10) == primes[i - 2] &&
      (primes[i - 1] + 4) != primes[i] &&
      (primes[i - 1] + 6) != primes[i]
    ) {
      is_correlation = 0;
      break;
    }
  }

  if (is_correlation) {
    printf("The correlation is consistent among the first 20k primes.\n");
  }

  return 0;
}

Sequence 2

In a set of 4 adjacent prime numbers (a, b, c and d) when a and d have the difference of 10, c is the result of increasing b by 2.

The following C program validates the consistency of the aforementioned correlation among the first 20k primes.

#include <stdio.h>

int main(void) {
  long primes[20000];
  long dividend = 3;
  long divisor;
  size_t i = 1;
  unsigned char is_prime;
  unsigned char is_correlation = 1;

  while (i < 20000) {
    divisor = 3;
    is_prime = 1;

    while (divisor < dividend) {
      if (!(dividend % divisor)) {
        is_prime = 0;
        break;
      }

      divisor += 2;
    }

    if (is_prime) {
      primes[i] = dividend;
      i++;
    }

    dividend += 2;
  }

  while (i > 9) {
    i--;

    if (
      (primes[i] - 10) == primes[i - 3] &&
      (primes[i - 2] + 2) != primes[i - 1]
    ) {
      is_correlation = 0;
      break;
    }
  }

  if (is_correlation) {
    printf("The correlation is consistent among the first 20k primes.\n");
  }

  return 0;
}