_unity_zp_mpn, unity_zp_mpn
Synopsis
#include <flint/aprcl.h>_unity_zp_mpnunity_zp_mpnA dense analogue of unity_zp with coefficients in an mpn_mod ring, used by the Jacobi sum checks for moduli of 2 to 16 limbs. An element is a vector of residues (field coeffs), always reduced by , together with , , , , , the borrowed mpn_mod context ctx, and data for the products, which are computed with a single modular reduction per output coefficient on top of _flint_mpn_poly_mulmid (classical or Karatsuba).
Cite this page
The FLINT team, “_unity_zp_mpn, unity_zp_mpn (aprcl.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/aprcl/_unity_zp_mpn.html (generated 2026-11-02).
@misc{flint-doc-aprcl-unity-zp-mpn,
author = {{The FLINT team}},
title = {{\_unity\_zp\_mpn, unity\_zp\_mpn (aprcl.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/aprcl/_unity_zp_mpn.html},
note = {Generated 2026-11-02}
}