GitLab

* configure.ac (AC_INIT): Update version.

* configure.ac (AC_INIT): Update version.

* BUGS: Drop [92, 1819], which now works.

* scripts/cmh-classpol.sh.in: Add a line to print the PARI/GP version.

* BUGS: Drop [1234, 235], which succeeds after a bug fix in PARI/GP with
  their commit 8964ced3ff73a2e0063cbd49cf1ee0285f753888.

Version 2.13 of PARI has introduced compact units and modified the
implementation of bnfisprincipal. Without using the bit "2" of the
flag when a generator is required, the example [1521816,1234,235]
leads to a warning and generators that are not computed.

Regardless of this, the example causes an exception.

* scripts/shimura.gp (reduce_type_norm,
  shimura_group_arbitrary_lift_of_ideal, shimura_group_element_is_identity,
  shimura_group_element_dlog): Add flag 0 or 3 to bnfisprincipal according
  to whether a generator is needed or not.
* BUGS: Add example.

* scripts/shimura.gp (reduce_type_norm): Drop a function call that was only
  needed for an old version of PARI/GP.

This effectively reverts commit 59f947fb,
which broke the example [33, 92, 1819].

* scripts/shimura.gp (triple_new): Drop a call to reduce_basepoint.
* BUGS: Drop an entry.

* src/factor.c (factor_trialdiv): Save a conversion to mpz_t.

* src/factor.c (mpz_remove_squares): Rewrite the function in terms of
  existing ones.

* src/factor.c (factor_trialdiv): Call PARI.
  (factor_matrix_alloc, remove_prime_power, coprime): Remove functions.
* src/cm2.c (recognise_quadratic_coefficients): Reword warning message.
* BUGS: Drop solved cases.

* src/factor.c (factor_matrix_fold_inner): Make function static.

* src/factor.c (factor_matrix_init): New function.
  (factor_matrix_alloc, factor_matrix_dup): Use the new function.

* src/cm2.c: Add copyright dates.

* src/cm2.c (cm_data_init_aux): Add a reference to the bound on primes
  in the denominator and modify its computation. This gains a factor of
  16 when A is even and of 4 when D is divisible by 4, so up to a factor
  of 64.

* scripts/checkpol.gp (weil_ideal_as_used_in_poly_files): Rewrite generator
  of K0r in terms of a square root using the defining polynomial of K0r
  instead of A and B. This corrects a factor of 2 when the discriminant
  is even.
* BUGS: Drop solved cases.

* BUGS: Drop solved bugs and cases.

* README.md: Update web pages, minimal version requirements and copyright
  dates.

* NEWS: Add entries for release 1.1.0.

Thanks to Jan Engelhardt <jengelh@inai.de> for figuring out the API
of fplll-5.

* configure.ac: If fplll-4 is not found, check for fplll-5.
* src/lll.cpp (lll_fplll): Add a version working with fplll-5, and simplify
  the code for fplll-4.

This is necessary since terminal codes for colours may appear in the output.

* scripts/cmh-classpol.sh.in: Define GP_OPTS to unset the colours and use
  it everywhere gp is called.

32 bit machines may choke on addressing 8GB of stack, while smaller sizes
may not be enough on large examples.

This partially reverts commit 370d5ebe.

Reported by Jan Engelhardt <jengelh@inai.de>.

* scripts/cmh-classpol.sh.in: Drop fixing the gp stack size with "-s",
  and drop the "-f" parameter to invocations of gp.

* configure.ac: Replace gforge mailing list by Andreas's.

Increasing the initial stack size from 500k to 4M is enough for
the example [296, 346, 27265].

* src/lll.cpp (lll_pari): Increase the PARI stack.

* src/quadratic_field.c (cmh_halfgcd): Modify to also return the second
  component of the PARI ghalfgcd function, and only one column of the
  first component.
  (quadratic_number_recognize): Adapt.

This is a trivial adaptation: The function is now called ghalfgcd, and
it returns a two-element vector with the 2x2 transformation matrix and
additionally the two consecutive remainders.

* src/quadratic_field.c (cmh_halfgcd): Update.

This is a follow-up to commit b15df9ff,
which could lead to mpz_mul_2exp being called with a negative exponent.

* src/quadratic_field.c (quadratic_number_recognize): Abort when the
  precision is lower than the exponent of the number.

* README: Add as symbolic link to README.md.

using a half-gcd; activated if an as yet unreleased version of PARI/GP
is available.

For [296, 346, 27265], the time for recognising coefficients drops from about
0.12s to 0.08s with FPLLL-4, and from 0.75s to 0.35s with PARI.

* src/quadratic_field.c (cmh_halfgcd): New function.
  (quadratic_number_recognize): Precondition the matrix.

* configure.ac: If --with-pari is given, modify not only the include, but
  also the library path.

* configure.ac: Change a message.

* configure.ac: Check explicitly for "fplll/matrix.h". Version 5 of fplll
  has moved this header, and we do not support its new api.
Signed-off-by: Andreas Enge <andreas.enge@inria.fr>

of 2^Xp from the last column. The time for [296, 346, 27265] decreases
by about a third. At the same time, drop the negligible factor s from the
scaled unit matrix and replace divisions by powers of 2 by right shifts;
this has no effect on the running time, while preserving correctness
of the result.

* src/quadratic_field.c (quadratic_number_recognize): Modify the matrix
  passed to LLL.

* examples/bench-theta.m, examples/theta.m, examples/thetatool.c:
  Remove files.

* .gitignore: Add config/test-driver.

* src/quadratic_field.h, src/quadratic_field.c (quadratic_number_set,
  quadratic_number_swap, quadratic_number_mul_z,
  quadratic_number_mul_z_normalize): Remove unused functions.
  (quadratic_number_normalize): Let the function work in place.
  (quadratic_number_recognize): Use macros (which do no longer clash with
  macros from PARI or FPLLL).
* src/macros.h (fget_z): New macro.

* src/recognize_quadratic.cpp: Rename to...
* src/lll.cpp: ...this.
  (recognize_quadratic): Move functionality...
* src/quadratic_field.c (quadratic_number_recognize): ...here.
* src/recognize_quadratic.h: Rename to...
* src/lll.h: ...this. Export cmh_lll.
* src/Makefile.am: Update the changed file names.
* src/quadratic_field.c: Update the changed name of the included file.

* src/recognize_quadratic.cpp (recognize_quadratic_pari,
  recognize_quadratic_fplll): Remove functions.
  (lll_pari, lll_fplll): New functions encapsulating the LLL algorithm
  on matrices with mpz_t coefficients.
  (recognize_quadratic): Put all the logic here.