QS_LP_MULT, QS_TRIAL_CHUNK, QS_HASH_BITS_MIN, QS_HASH_BITS_MAX, BITS_ADJUST, QS_DEBUG
Synopsis
#include <flint/qsieve.h>QS_LP_MULTsourceQS_TRIAL_CHUNKsourceQS_HASH_BITS_MINsourceQS_HASH_BITS_MAXsourceBITS_ADJUSTsourceQS_DEBUGsourceFurther parameters: large primes are accepted below QS_LP_MULT (60) times the largest factor base prime; candidates are trial divided by QS_TRIAL_CHUNK (64) primes at a time; the hash table of large primes has between 2^{12} and 2^{20} buckets, depending on the size of the factor base; BITS_ADJUST (25) compensates for the approximate logarithms of the sieve; and QS_DEBUG selects the amount of debugging output (0, none, by default).
Cite this page
The FLINT team, “QS_LP_MULT, QS_TRIAL_CHUNK, QS_HASH_BITS_MIN, QS_HASH_BITS_MAX, BITS_ADJUST, QS_DEBUG (qsieve.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/qsieve/QS_LP_MULT.html (generated 2026-10-20).
@misc{flint-doc-qsieve-QS-LP-MULT,
author = {{The FLINT team}},
title = {{QS\_LP\_MULT, QS\_TRIAL\_CHUNK, QS\_HASH\_BITS\_MIN, QS\_HASH\_BITS\_MAX, BITS\_ADJUST, QS\_DEBUG (qsieve.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/qsieve/QS_LP_MULT.html},
note = {Generated 2026-10-20}
}