NMOD_MAT_OPTIMAL_MODULUS_BITS
Synopsis
#include <flint/nmod_mat.h>NMOD_MAT_OPTIMAL_MODULUS_BITSsourceA suggested bit size, FLINT_BITS - 5, for the primes of multimodular algorithms that rely on matrix multiplication, used for example by fmpz_mat_mul_multi_mod and the Dixon solver of fmpz_mat. It was chosen when classical multiplication with two-word dot products was the fastest method; with the SIMD kernels, primes of at most 52 bits can be cheaper per bit of modulus.
Guides#
Cite this page
The FLINT team, “NMOD_MAT_OPTIMAL_MODULUS_BITS (nmod_mat.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/nmod_mat/NMOD_MAT_OPTIMAL_MODULUS_BITS.html (generated 2026-10-20).
@misc{flint-doc-nmod-mat-NMOD-MAT-OPTIMAL-MODULUS-BITS,
author = {{The FLINT team}},
title = {{NMOD\_MAT\_OPTIMAL\_MODULUS\_BITS (nmod\_mat.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/nmod_mat/NMOD_MAT_OPTIMAL_MODULUS_BITS.html},
note = {Generated 2026-10-20}
}