payloadless.cpp

#include "payloadless.hpp"

using namespace eosio;

void payloadless::doit() {
   print("Im a payloadless action");
}

constexpr size_t cpu_prime_max = 15375u;

bool is_prime(int p) {
   if (p == 2) {
      return true;
   } else if (p <= 1 || p % 2 == 0) {
      return false;
   }

   bool prime = true;
   const int to = sqrt(p);
   for (int i = 3; i <= to; i += 2) {
      if (p % i == 0) {
         prime = false;
         break;
      }
   }
   return prime;
}

bool is_mersenne_prime(int p) {
   if (p == 2) return true;

   long long unsigned s = 4;
   const long long unsigned m_p = (1LLU << (p % (sizeof(s) * 8))) - 1;
   int i;
   for (i = 3; i <= p; i++) {
      s = (s * s - 2) % m_p;
   }
   return bool(s == 0);
}


void payloadless::doitslow() {
   print("Im a payloadless slow action");

   for (size_t p = 2; p <= cpu_prime_max; p += 1) {
      if (is_prime(p) && is_mersenne_prime(p)) {
         // We need to keep an eye on this to make sure it doesn't get optimized out. So far so good.
         //eosio::print_f(" %u", p);
      }
   }
}

void payloadless::doitforever() {
   print("Im a payloadless forever action");
   constexpr size_t max_cpu_prime = std::numeric_limits<size_t>::max();

   while (true) {
      for (size_t p = 2; p <= max_cpu_prime; p += 1) {
         if (is_prime(p) && is_mersenne_prime(p)) {
            // We need to keep an eye on this to make sure it doesn't get optimized out. So far so good.
            //eosio::print_f(" %u", p);
         }
      }
   }
}