Changes commited to PARI GIT during the last two weeks

add proto.c to src/desc/.gitignore

1	0	src/desc/.gitignore

Kderivsmallinit: simplify code

2	6	src/basemath/mellininv.c

fix conceptual difference 32/64-bit due to EXTRAPRECWORD/EXTRAPREC64

The logic of EXTRAPRECWORD is to add "a few" guard bits,actually BITS_IN_LONG,
to cater for terms bounded by log2(ulong).

The logic of incrprec(bit) or bit + EXTRAPREC64 is to do it in an
architecture-independent way (add 64 bits no matter what).

This commit replaces EXTRAPRECWORD by EXTRAPREC64. The odd speed gain on
32-bit architectures is not worth the lack of consistency and potential
for bizarre bugs (further differences in behaviour between 32/64 bits).

EXTRAPRECWORD wasn't actually used consistently or frequently (15 occurences)
and it wasn't documented.

CAVEAT: This is about the precreal ~ bitprec world. A parallel issue
in the 'lg' world is lgprec + 1 or lx++ instead of
  lgprec + EXTRAPREC64 / BITS_IN_LONG
This is much more frequent than EXTRAWORD and will be dealt with later.
For historical reasons a 'bitprec' is actually a "bit accuracy" whereas
a 'prec' is a multiple of BITS_IN_LONG (making the range of attainable
precs depend on the architecture. This is an issue: it should be a
multiple of 64 always.

N.B. It is worth keeping 2 notions of "bit precision" and "mantissa size
in words" even though the latter can be inferred from the former.

1	1	src/basemath/base1.c
3	3	src/basemath/dirichlet.c
2	2	src/basemath/ellanal.c
1	1	src/basemath/ellrank.c
1	1	src/basemath/hyperell.c
1	1	src/basemath/mellininv.c
3	3	src/basemath/trans1.c
3	3	src/basemath/trans2.c
0	1	src/headers/parigen.h

expQ: fix conceptual bug introduced 499574bea

lx++ for t_REAL is achitecture dependent, one should use
  lx += EXTRAPREC64 / BITS_IN_LONG
This occurs elsewhere in the code and will be fixed in other commits.

1	1	src/basemath/trans1.c

Replace gerepilecopy by gc_GEN

2	2	src/basemath/buch2.c
1	1	src/basemath/ellanal.c

cleanup zetamult_i

14	10	src/basemath/zetamult.c

cleanup expQ

9	9	src/basemath/trans1.c

update bench after bestappr rewrite (commit 96846c82)

3	3	src/test/32/gchar-lfun

inefficient use of cgetr when lg would be available

9	7	src/basemath/lll.c
4	4	src/kernel/none/level1.h
12	7	src/modules/stark.c

doc typos related to lg <-> prec conversions

10	10	doc/usersch5.tex

doc typos

4	5	doc/usersch5.tex

reorganize block of functions related to lg <-> accuracy conversions

14	10	src/headers/pariinl.h

cleanup logr_abs

14	15	src/basemath/trans1.c

RgM_hess: cleanup prec use

16	15	src/basemath/alglin2.c

replace nbits2ndec uses by prec2ndec

was always used in precreal context.

1	1	doc/usersch5.tex
1	1	src/basemath/ellanal.c
7	8	src/language/default.c
1	1	src/language/es.c

bestappr_frac: add diagnostic in GC at \gm2

2	1	src/basemath/arith1.c

fix bestappr(t_REAL or t_FRAC, B) issues [#2688]

- rewrite bestappr_real in terms of bestappr_frac: this allows the
  accuracy to drop down and is one order of magnitude faster. For instance
    localbitprec(80000); bestappr(Pi, 2^40000);
  goes down from 6,242 ms. to 122 ms.

- best approximation sometimes missed bestappr(-1/7, 6) -> 0 [instead of -1/6]

- bestappr(t_REAL) now choses B = 2^((realprec(x) + 1) \ 2) instead of
  2^realprec(x); with the latter value we might as well return the
  floating point representation of x

4	0	CHANGES
25	99	src/basemath/arith1.c
7	7	src/functions/number_theoretical/bestappr
2	0	src/test/32/bestappr
2	0	src/test/in/bestappr

Replace bit_prec uses by realprec.

Deprecate the bit_prec alias.

2	0	doc/usersch4.tex
1	1	doc/usersch5.tex
1	1	src/basemath/arith1.c
2	2	src/basemath/bit.c
1	1	src/basemath/buch2.c
1	1	src/basemath/elliptic.c
1	1	src/basemath/gen2.c
1	1	src/basemath/gen3.c
1	1	src/basemath/polarit2.c
1	1	src/basemath/trans1.c
3	3	src/basemath/trans2.c
2	2	src/kernel/none/mp_indep.c
1	1	src/modules/galois.c

bestappr cleanups

- factor out cf_updatepq in bestappr_frac and bestappr_real
- add GC in bestappr_frac
- fix GC in bestappr_real (x clobbered)

37	11	src/basemath/arith1.c

small improvement to bestappr_real

19	2	src/basemath/arith1.c

pariold.h: move #ifdef PARI_OLD_NAMES up the list

No longer define (by default) aliases for functions obsoleted more than
10 years ago.

3	2	src/headers/pariold.h

improve isint2n

3	2	src/kernel/none/halfgcd.c

bestappr_real: add GC + restrict variable scopes

12	6	src/basemath/arith1.c

update NEW for 2.19-stable

181	195	NEW

doc glitches

3	3	src/functions/number_fields/idealhnf

document QM_ishnf

2	0	CHANGES
3	0	doc/usersch5.tex

cleanup idealhnf use

- fix typo in vec_mulid
- clarify in idealhnf doc that idempotent usage (where input is already
  in HNF) is *not* deprecated. We deprecate other non-trivial "vector of
  generators" use in favor of idealfromgens
- uniformize "idempotent" usage in libpari: first idealtyp, then
  idealhnf if not already a t_MAT
- make sure idealhnf recognize matrix in HNF also over the rationals

18	0	src/basemath/ZV.c
16	11	src/basemath/base4.c
23	2	src/basemath/base5.c
14	5	src/functions/number_fields/idealhnf
1	0	src/headers/paridecl.h

idealhnf: clarify doc

17	19	src/functions/number_fields/idealhnf

typo in vec_mulid: the code was inteded to skip x[i] if D | x[i]

3	3	src/basemath/base4.c
8	1	src/test/32/ideal
1	0	src/test/in/ideal

hyperellchangecurve doc: switch confusing notations (x,y) <-> (X,Y)

4	4	src/functions/elliptic_curves/hyperellchangecurve

hyperell* docs: add a reference to hyperellchange curve

whenever a "change of coordinates" is mentioned and not explained

1	1	src/functions/elliptic_curves/hyperellauto
2	1	src/functions/elliptic_curves/hyperellchangecompose
3	2	src/functions/elliptic_curves/hyperellchangecurve
2	1	src/functions/elliptic_curves/hyperellchangeinvert
1	1	src/functions/elliptic_curves/hyperellchangepoint
1	1	src/functions/elliptic_curves/hyperellchangepointinv
1	1	src/functions/elliptic_curves/hyperellisisom

examples: openmp, thread: force compilation error if ENABLE_TLS is not set.

4	0	examples/openmp.c
4	0	examples/thread.c

ellmaninconstant: add reference to Cremona's explanation

https://johncremona.github.io/ecdata/manin.txt

1	0	src/functions/elliptic_curves/ellmaninconstant

ellmaninconstant: minor simplification

3	3	src/basemath/ellisog.c

kill underfull hboxes

8	6	doc/refcard-mf.tex

impove doc, kill overfull hbox

10	11	doc/usersch5.tex

doc improvement

2	2	src/functions/number_fields/HEADER

improve ellheegner doc

8	9	src/functions/elliptic_curves/ellheegner

doc:ellheegner: mention ellheegnertwist

10	1	src/functions/elliptic_curves/ellheegner

fix comment: reference stable version where function is obsoleted

1	1	src/headers/pariold.h

Bump date to 2026

2	2	README
1	1	doc/INSTALL.tex
1	1	doc/gp.1
1	1	doc/gphelp.1
1	1	src/gp/gp.c

Bump version to 2.19.0

3	0	CHANGES
2	2	config/version
1	1	doc/refmacro.tex
1	1	src/test/32/version

add parmatrix

6	6	doc/refcard.tex

expIPiR: don't call absrnz_equal2n on 0.0

15	10	src/basemath/elltrans.c

upowers: compute powers x^0 to x^n as documented

2	2	src/basemath/trans1.c

GCOVFLAGS: add -fprofile-update=atomic

1	1	config/get_cc

expIPiC: typo, expo(z) => expo(x)

1	1	src/basemath/elltrans.c

test-bnf: remove duplicated tests

1	2	src/test/32/bnf
0	4	src/test/in/bnf

64- bnfisprincipal(,1): e possibly uninitialized

Using either bnfinit(,1) or bnfisprincipal(,4), or both, is recommended
when the class group is huge and will compute the required principal part.

This commit fixes the initialization problem but is unlikely to allow
computing the generator (likely huge) when using suboptimal flags.

2	0	CHANGES
9	3	src/basemath/buch2.c
2	1	src/test/32/bnf
4	0	src/test/in/bnf

upowers allocated one word too much

1	1	src/basemath/trans1.c

Fix ZX_factor regression [#2687]

1	1	src/basemath/QX_factor.c
2	1	src/test/32/nffactor
4	0	src/test/in/nffactor

expIPiC: don't call absrnz_equal2n on 0.0

9	1	src/basemath/elltrans.c

95- support vecsort(vector of t_VECSMALL, k)

1	0	CHANGES
18	4	src/basemath/bibli2.c
3	0	src/test/32/sort
2	0	src/test/in/sort

63- === for t_REAL 0: was not ignoring mantissa

1	0	CHANGES
1	0	src/basemath/gen2.c

Configure --mt=pthread: check for pthread_sigmask

1	1	CHANGES
3	0	config/get_libc
27	0	config/has_pthread_sigmask.c
4	0	config/paricfg.h.SH
4	0	src/mt/pthread.c

new_buffer: initial buf to the empty string

1	0	src/language/es.c

refcard: add fingerprint

1	0	doc/refcard.tex

refcard: add idealfromgens

2	1	doc/refcard-nf.tex

refcard: add matmodhnf

1	0	doc/refcard.tex

add primeisregular to refcard

5	6	doc/refcard-nf.tex

ellheegnertwist: improve doc

2	1	doc/refcard-ell.tex
28	16	src/functions/elliptic_curves/ellheegnertwist

typo

1	1	doc/refcard-ell.tex

rework refcard-ell to properly describe hyperell* functions

43	27	doc/refcard-ell.tex
3	3	doc/refmacro.tex

doc typo

1	1	src/functions/elliptic_curves/hyperellauto

fingeprint: clarify doc

6	4	src/functions/programming/fingerprint

94- [libpari] Z_has_prime_3mod4

1	0	CHANGES
3	0	doc/usersch5.tex

doc typos

1	1	doc/usersch5.tex

doc typos

4	4	doc/usersch5.tex

document polgraeffe

4	2	src/functions/polynomials/polgraeffe

fix overfull hbox

2	1	doc/tutorial-mf.tex

fix comment

1	1	src/basemath/quad.c

62- ZX_factor: rare "no factor" bug [#2670]

- use (Tra \ p^b) * M_L  instead of (Tra * M_L) \ p^b : the latter is
  "heuristically better" but the proven bounds don't necessarily apply;
  in the reported example, they don't.

- make sure to re-introduce the p^(a-b)*Id block after each reduction
  applied to the kapsack lattice

In principle, any of the above 2 issues could cause factors to be missed.
In #2670, the polynomial is actually irreducible; no reducible
counter-example was found but they are expected to exist.

1	0	CHANGES
11	21	src/basemath/QX_factor.c
34	1	src/test/32/nffactor
3	0	src/test/in/nffactor

New GP function ellheegnertwist

1	0	CHANGES
322	10	src/basemath/ellanal.c
39	0	src/functions/elliptic_curves/ellheegnertwist
1	0	src/headers/paridecl.h
1	0	src/headers/paripriv.h
16	1	src/test/32/ellanal
8	0	src/test/in/ellanal

New private function ellmanintable_heuristic

1	0	src/headers/paripriv.h
15	9	src/modules/ellmanin.c

doc: s/unconditionnally/unconditionally (from Charles Greathouse)

1	1	src/functions/elliptic_curves/ellpadicbsd
1	1	src/functions/number_theoretical/qfbclassno
1	1	src/functions/polynomials/thueinit

92- galoisinit: support for non-WSS Galois groups

1	0	CHANGES

test-galoisinit: test a non-solvable group

42	2	src/test/32/galoisinit
11	1	src/test/in/galoisinit

galoisexport: handle non-wss groups correctly

3	3	src/basemath/galconj.c

galoisisabelian: handle non-WSS groups

4	2	src/basemath/galconj.c

improve comment

2	1	src/basemath/galconj.c

whitespace edits

2	4	src/basemath/galconj.c

galoisinit: remove WSS limitation

We switch to nfroots when the group is not WSS or the combinatorial algorithm is too slow.

7	1	src/basemath/galconj.c
6	5	src/functions/number_fields/galoisinit

galoisinit: terminate if too slow

24	15	src/basemath/galconj.c

galoisconj4_main: return gen_0 when not Galois

24	10	src/basemath/galconj.c

galconj1: add flag is_galois

5	4	src/basemath/galconj.c

init_group: extend table of non-wss order

1	1	src/basemath/galconj.c

init_group: use uisnilpotent

1	2	src/basemath/galconj.c

FpXXk_gcd: rewrite to avoid t_INT/t_POL confusion

68	58	src/basemath/FpX.c
4	1	src/test/32/gcdext
5	1	src/test/in/gcdext

test-compat: update for ?lindep change

2	2	src/test/32/compat

improve qflll doc

8	5	src/functions/linear_algebra/qflll

fix / improve algdep help

13	13	src/functions/linear_algebra/algdep