Skip to content
Commits on May 31, 2015
  1. Remove " )" formatting

    committed May 31, 2015
  2. Update ASDF metadata style

    Fixes #2
    committed May 31, 2015
Commits on Mar 9, 2015
  1. Switch to Pollard Rho as a bug free implementation

    This is a work-around for issue #1 on the Github project page, that the
    algorithm has an error rather than factoring the number 327146098439579.
    While I gain the knowledge necessary to fix bug in HMPQS, I am switching
    the factoring method to a simpler method.
    
    After checking what effect this will have, I've found that it is
    significantly slower on average than the HMPQS method, even in number
    ranges where it should win.  That isn't too surprising as almost zero
    effort has been put into optimizing it.
    committed Mar 9, 2015
Commits on Apr 18, 2013
  1. Made loading the system silent. I really need to do this for the enti…

    …re system.
    Zach Kost-Smith committed Apr 17, 2013
Commits on Jun 17, 2012
  1. Added a test suite.

    committed Jun 15, 2012
Commits on Jun 13, 2012
  1. Explicitly ask for double floats in HMPQS.

    This is to work around the use of floats in some process.  This mitigates the
    problem in that it allows us to factor numbers up to 10^300 or so instead of
    10^40.  This is large enough that you will probably not want to deal with
    numbers larger than this with this algorithm anyway.
    
    More investigation is required.
    committed Jun 13, 2012
  2. Remove a #| |# style comment.

    committed Jun 13, 2012
  3. Added readme file.

    committed Jun 13, 2012
  4. Added Hypercubic Polynomial Quadratic Sieve

    This algorithm is the record holder for numbers less than about ~100 decimal
    digits.  It is now the default method which cl-factoring:factor uses.  There are
    some tunable parameters, but I don't understand it enough to know how to use
    them, but it seems to work well as a dumb black box.
    
    This is a near verbatim copy of the code by Uli Meyer (some slight modifications
    to interface with normal Common Lisp style and the library).
    committed Jun 13, 2012
  5. Added Shank's square form factoring method (O(N^(1/4)))

    Well not really, just a sketch of what the algorithm should be like.  I haven't
    figured out the meaning of the slightly ambiguous pseudo-code on Wikipedia.
    committed Jun 13, 2012
Commits on Jun 3, 2012
  1. Bug fix: handle squares properly

    It was hanging on squares, but now we check and factor those specially.
    committed Jun 3, 2012
  2. Added the generic interface.

    committed Jun 3, 2012
  3. Initial commit.

    This seems to be working, but none of the good algorithms are implemented.
    committed Jun 3, 2012
Something went wrong with that request. Please try again.