First version of primo, starting with a simple program in perl.
Dumping the primes into a file (rules of the contest)
Introduced idea of looking primes using the conjecture of Firoozbakht

The idea is that instead of iterating over all the numbers and check for
their primality, I will jump between numbers using the conjecture of
Firoozbakht that helps to calculate a number that is equal or greater
than the actual gap between a primer nmber and its subsequent.
Fix some syntax errors
Change way of skipping the first 4 primes

The conjecture of Firoobakht does not apply for the first 4 prime
numbers. For this reason, when calculating the next prime number to a
given number (let's say 2), before applying the conjecture to find the
gap between the next number, I need to see if it is one of these first
numbers. If it is, then, I have a table to find the next.
Change way of finding the next prime.

The conjecture of Firoozbakht (given a prime) finds a number that
demonstrates that is bigger (but closer enough) to the gap betwen the
given prime and its subsequent.
If used, this number as a upper boundary, it could result (as I was
using it), that some prime numbers may be skipped for time to time.
For instance applying the formula, we know that:
   log(pn)^2 - log(pn) > gn
In the case of 97, this would be:
   floor( log(97)^2 - log(97) ) = 16
Certainly 113 is a prime, and also 109, 107, 103 and 101. So using the
algorithm as I was using it, I jumped in some cases quite a bunch of
primes, which is not valid for the competition (the primes should be
subsequent).
Slight changes in the erasthostenes sieve to be faster.

The idea, is that the program will save every prime number found and
then use it when finding possible factors for then number to test.
Merge branch 'optimize_erastostenes_sieve'
Changed the way of finding the subsequent prime number

I made a mistake using the table of maximal gaps as such, and thus I
skipped some numbers. Now, I'm incrementing by two, to find the next
one. In some cases, when there is a great jump, I will remain doing a
bit of extra calculations, but for the time being I can't do much about
it.
Add a list of the first 2 million prime numbers

I have taken this list from:
   http://primes.utm.edu/lists/small/millions/
And then mix the files, and format it spaces, newlines, and also the
type of the file (it contains cr lf).
Small changes

Now, I start with @primes intialized to only one number, 2.
I have also remove nextFactor, which was never used.
Changed directory to perl (I have the intention of try different approaches)
Add the results of some small investigation, in order to find better ways of exploring the solution space.
Format voraz.txt

Removed initial spaces from the file.
Attempt to use the list of gap numbers according to their frequency.

This attempt failed, since the selected gaps may lead to a prime number,
but it may be that is not the subsequent :-(
New change in the algorithm, back to the usage of Firoozbakht conjecture.

The idea is to use Firoozbakht to get a boundary number, and then select
all the possible gaps that are less than that number; so that they can
be tested.
Failed attempt to create a faster lookup of possible factors

Soft and high level, but nice ideas, are a bit inneficient for this purpose.
Another trial ... Not getting closer with this implementation of the current leader (he can run it in 3 secs).
Removed all the intermediate tables.

I have removed all the tables I used, in order to make faster the
program. It seems that the only option, in order to make it faster is to
think this from a different angle, and try to use parallel programming.
First implementation of the challenge in perl using threads and queues