ECPP_MIN_PRIME, ECPP_BIGPOOL_BITS, ECPP_POOL_HMAX, ECPP_POOL_OMAX, ECPP_DMAX_BITS, ECPP_PRIMORIAL_CHUNKS, ECPP_KUMMER_BITS
#include <flint/ecpp.h>ECPP_MIN_PRIMEsourceECPP_BIGPOOL_BITSsourceECPP_POOL_HMAXsourceECPP_POOL_OMAXsourceECPP_DMAX_BITS(bits)sourceECPP_PRIMORIAL_CHUNKSsourceECPP_KUMMER_BITSsourceParameters of the prover: the number of prime cofactors (4) expected per round of the discriminant search; the size (2500 bits) from which the pool admits all discriminants with a cheap class field tower rather than only those with a small genus factor; the bounds on the class number (400) and its odd part (16) in the pool; the bound 2^{20} to 2^{23} on |D|, depending on the bit size; the number of chunks (8) in which the primorial for the batch factoring is reduced when threads are used; and the size (1500 bits) from which the class field tower carries Kummer data.
The FLINT team, “ECPP_MIN_PRIME, ECPP_BIGPOOL_BITS, ECPP_POOL_HMAX, ECPP_POOL_OMAX, ECPP_DMAX_BITS, ECPP_PRIMORIAL_CHUNKS, ECPP_KUMMER_BITS (ecpp.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/ecpp/ECPP_MIN_PRIME.html (generated 2026-10-20).
@misc{flint-doc-ecpp-ECPP-MIN-PRIME,
author = {{The FLINT team}},
title = {{ECPP\_MIN\_PRIME, ECPP\_BIGPOOL\_BITS, ECPP\_POOL\_HMAX, ECPP\_POOL\_OMAX, ECPP\_DMAX\_BITS, ECPP\_PRIMORIAL\_CHUNKS, ECPP\_KUMMER\_BITS (ecpp.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/ecpp/ECPP_MIN_PRIME.html},
note = {Generated 2026-10-20}
}