Version 1.1.5:
New invmod32_64() function taken from Jason Papadopoulos's Msieve 1.10
 results in a 10% speedup on my P3.
Removed unused mod64(), addmod64(), submod64() functions.

Version 1.1.4: (Posted 3 September 2006)
Uncommented changes to assembler verions of memset32_8() which were
 accidentally left commented out in version 1.1.3.
Take advantage of the fact that all our sequences k*b^n+c have c=+/-1 to
 save one mulmod when computing -c/k (mod p).

Version 1.1.3: (Posted 1 September 2006)
Relaxed asm constraints on i386 memset32_8(). Added x86-64 version.
Small improvement to powmod64() saves one mulmod per call.
Removed unused sieve_high variable.
Use invmod32_64(a,p) instead of invmod64(a,p), gives 10% speedup on my P3.

Version 1.1.2: (Posted 27 August 2006)
Removed unused lmod64().
Unrolled clear_hashtable() loop, optimising seperately for 32 or 64 bit
 machines, with inline assembler version for i386 (about 5% faster on P3).

Version 1.1.1: (Posted 12 August 2006)
Adjusted the formula for choosing b^Q to favour slightly lower Q. sieving in
 base 5^60 is a little faster than in base 5^240 with the current (309
 sequences) sr5data.txt.

Version 1.1.0: (Posted 9 August 2006)
Changed the way that Q is chosen for sieving in base b^Q, uses the same
 method as srsieve 0.4.1 allowing more Q values to be considered.

Version 1.0.1:
Added ARCH=k8 entry in Makefile.
Removed unused remaining_terms variable.
Changed pre2_mulmod64_init() to make use of stack created by mod64_init().

Version 1.0.0: (Posted 28 July 2006)
Split from srsieve source archive srsieve-0.3.13.tar.gz.
Made many variables into compile-time constants.
Removed sections of the code that never get used, e.g. 32 bit arithmetic.
