From: terje.mathisen@nospicedham.tmsw.no   
      
   James Van Buskirk wrote:   
   > "wolfgang kern"  wrote in message   
   > news:pbsmop$1fig$1@gioia.aioe.org...   
   >> Rod Pemberton asked:   
   >   
   >>> What is the smallest prime in your LUT which has a period of 512   
   >>> bits?   
   >   
   >> haven't checked it yet, I have to write a period detector first.   
   >   
   > Check 1238926361552897 .   
   >   
      
   I'm looking at the possibility of just calculating these on the fly:   
      
   Use either the SSE reciprocal estimator or a FP division to get a   
   starting approximation, then use a NR iteration to double the number of   
   bits each round.   
      
   When you get past 64 bits you have to start working with 128, then 256   
   and 512 bit values using multiple 64-bit chunks, but it should still be   
   relatively fast.   
      
   Terje   
      
   --   
   -    
   "almost all programming can be viewed as an exercise in caching"   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)