PMA !dSvrkhSLR6 ID: 1b8726 April 3, 2018, 12:16 p.m. No.5408   🗄️.is 🔗kun   >>5409 >>5413 >>5428

>>5353

>>5406

Code is c# running single threaded.

 

My largest test cases are the products of 5 and 6 digit primes. I can certainly put together larger test cases if you think it worth while.

 

A guesstimate of iterations required is roughly n/2. So RSA numbers are safe for a little bit.

 

There is one more efficiency I am looking into with regards to removing large chunks at the higher end of the remainder portion.

PMA !!y5/EVb5KZI ID: 1b8726 April 26, 2018, 10:42 p.m. No.5680   🗄️.is 🔗kun

>>5679

I think I understand what you’re saying.

 

My latest tests are a bit further along. Now at n+4 movements at best. n+2 at worst. And am in a position to make even larger jumps if we can figure out more patterns.