mersenneforum.org - View Single Post

ThiloHarich · 2007-12-03, 18:48

I had a simple bug now it works with large Primes:
Time sieving .893 sec
Time factoring .467 sec

2966 decompositions over all
794 Large decompositions

If I switch to smaller factor bases (1500 decompositions), the sieving time goes up to 1.500 sec.

This might be due to the slow handling of array in java in the sieving phase. Even HotSpot (which compiles/optimizes often used parts) does hot help since the main loop is executed for the higher primes in the factor base only a few times ( < 10).

Thanks for the input.

2007-12-03, 18:48	#7
ThiloHarich Nov 2005 63₁₆ Posts	I had a simple bug now it works with large Primes: Time sieving .893 sec Time factoring .467 sec 2966 decompositions over all 794 Large decompositions If I switch to smaller factor bases (1500 decompositions), the sieving time goes up to 1.500 sec. This might be due to the slow handling of array in java in the sieving phase. Even HotSpot (which compiles/optimizes often used parts) does hot help since the main loop is executed for the higher primes in the factor base only a few times ( < 10). Thanks for the input.