It is my pleasure to announce the release of Euler version 0.3.
Euler is an arithmetic library for OCaml integers. For more details, please read the repo’s README or browse the docs.
In version 0.3:
- some amount of optimization ( magic tricks to compute logarithms, see source code of
log2sup
andlogsup
); - new functions (for instance: root extraction, multiplicative order);
Arith.gcdext
now returns minimal coefficients and avoids overflows (which was not trivial);- factorization now performs some steps of Fermat’s factor searching, which I think closes the gap with Owl (mentioning this because @struktured had asked me how Euler compared with Owl, and Fermat’s algorithm was the only integer arithmetic operation that I found in Owl not provided by Euler).
The full list of changes is found in the changelog, in the repo.
Happy factorizing!
(This is a new topic because I cannot edit the initial one.)