View Single Post
Old 2021-09-09, 05:27   #10
ewmayer's Avatar
Sep 2002
Rep├║blica de California

32×1,303 Posts

Originally Posted by bentonsar View Post
Is this implemented correctly? If so, how do I convert that outputarr to the actual result of the sxs mod M operation in the lucas lehmer test?

It'll be easier for the rest of us to tell if it's implemented correctly if you would provide a sample input, say a random number of the desired bitlength p you are working (or pair of such if you're doing a general mod-M(p) multiply rather than a squaring), the resulting N mixed-base inputs and forward-weights, and the resulting outputs after inverse-weighting but before carry propagation, and then after you've done the carries.
ewmayer is offline   Reply With Quote