Conversation

Notices

1. Adrian Cochrane (alcinnz@floss.social)'s status on Thursday, 23-Mar-2023 04:23:02 JST Adrian Cochrane

   Today I'll continue studying MPQ, which largely serves to wrap various MPN routines with memory management & normalization. These include:

   * Copying fields from one MPZ to another.
   * Random (several wrappers)
   * square-root + remainder (couple)
   * test perfect-powers
   * Modulo (multiple codepaths)
   * Multiply wrapped in a loop for product.
   * Multiplication (multiple wrappers, including for powers-of-2)
   * Powers (multiple wrappers)
   * Lowest-common multiple
   * Jacobi (& Kronecker) primality test

   1/2

   • Adrian Cochrane (alcinnz@floss.social)'s status on Thursday, 23-Mar-2023 04:27:05 JST Adrian Cochrane

     in reply to

     Also there's converters:
     * From MPF
     * From signed & unsigned longs
     * From MPN
     * From doubles
     * From strings
     * To strings (most of the complexity)
     * To files

     As well as:
     * Reallocation (couple)
     * Set a particular bit (multiple codepaths)
     * Locate first 1 bit (+ & - codepaths)
     * Locate first 0 bit
     * Select appropriate exponentiation codepath
     * Negating a number, possibly with a copy
     * Modulo via `mpz_tdiv_r`
     * Get, modify, finish, & write "limbs" (digits) field routines

     2/3 for today!

   • Adrian Cochrane (alcinnz@floss.social)'s status on Thursday, 23-Mar-2023 04:28:06 JST Adrian Cochrane

     in reply to

     Regarding prime numbers:
     * Return iteration count of a division
     * Calculate primes with a given sieve size
     * Iterate over primes via some of these other routines
     * Probably-prime test with fastpaths
     * Factorize a number
     * Compute Lucas numbers
     * Compute Lucas modulos
     * Miller-Rabin primality test

     2.5/2.5 for today! I should be able to finish tomorrow on MPZ.

     Then random, scan, & tune.