fft_small_fft_mpn
Synopsis
#include <flint/fft_small.h>void fft_small_fft_mpn(fft_small_op_t X, const ulong * a, ulong an, const fft_small_plan_t P)sourceSets X to the forward transform of the integer (a, a_n), cut into chunks of P->bits bits. Requires an integer plan and a_n \ge 1, at most the operand length the plan was made for.
Two-prime plans pack the chunks with plain bit slicing. Other plans use the vectorised packing of their profile when one exists, and a scalar conversion with tables of powers of two otherwise. The work is spread over the primes from a_n \ge 1024.
Guides#
Cite this page
The FLINT team, “fft_small_fft_mpn (fft_small.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fft_small/fft_small_fft_mpn.html (generated 2026-10-20).
@misc{flint-doc-fft-small-fft-small-fft-mpn,
author = {{The FLINT team}},
title = {{fft\_small\_fft\_mpn (fft\_small.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fft_small/fft_small_fft_mpn.html},
note = {Generated 2026-10-20}
}