36#define MONT63_MAX ((ulong)(0x7fffffffffffffff))
41 u128 km = (u128)
k * m;
44 ulong hi = _u128high(sum);
46 return hi >= m ? hi - m : hi;
70 u128 sum = (u128)
k * m +
t;
71 ulong hi = _u128high(sum);
72 return hi >= m ? hi - m : hi;
92 if (v == one || v == m_1)
return 1;
93 for (
t--;
t > 0;
t--) {
95 if (v == m_1)
return 1;
96 if (v == one)
return 0;
102 if (v == one || v == m_1)
return 1;
103 for (
t--;
t > 0;
t--) {
105 if (v == m_1)
return 1;
106 if (v == one)
return 0;
155 uint idx = (
uint)(d >> (bit - 2)) & 7;
160 for (; bit >= 0; bit--) {
162 if ((d >> bit) & 1) v =
mont63_mul(v, bm, m, m_inv);
192 uint idx = (
uint)(d >> (bit - 2)) & 7;
200 for (; bit >= 0; bit--) {
203 if ((d >> bit) & 1) {
237 uint idx = (
uint)(d >> (bit - 2)) & 7;
245 for (; bit >= 0; bit--) {
248 if ((d >> bit) & 1) {
263 }
else if (
n < 684630005672341) {
266 bases[1] =
dj_base49[((0x3AC69A35UL *
n) & 0xFFFFFFFFUL) >> 21] + 3;
267 if (
n % bases[0] == 0)
269 if (
n % bases[1] == 0)
292 bases[1] = (bbmask & 0x8000) ? 26460 : 9375;
293 bases[2] = (bbmask & 0x7FFF) + 3;
295 if (
n % bases[0] == 0)
297 if (
n % bases[1] == 0)
299 if (
n % bases[2] == 0)
300 return n == bases[2];
348 if (
n % 2 == 0 ||
n <= 1)
354 }
else if (judge == 1) {
364#define ULONG_PRIME_MAX 0xFFFFFFFFFFFFFFC5ull
365#define ULONG_PRIME_MIN 2
369 ||
n % 13 == 0 ||
n % 17 == 0 ||
n % 19 == 0 ||
n % 23 == 0
370 ||
n % 29 == 0 ||
n % 31 == 0 ||
n % 37 == 0 ||
n % 41 == 0
371 ||
n % 43 == 0 ||
n % 47 == 0 ||
n % 53 == 0 ||
n % 59 == 0
372 ||
n % 61 == 0 ||
n % 67 == 0 ||
n % 71 == 0;
382 n += (
n % 2 == 0) ? 1 : 2;
404 n -= (
n % 2 == 0) ? 1 : 0;
const uint16_t dj_base49[2048]
Copyright (C) 2026 HJimmyK (Jericho Knox)
const uint16_t dj_base64[16384]
bool lmmp_is_prime_uint_notrial_(uint n)
u32 档双基底强伪素数内核(基底 2 + dj_base49 哈希基底,普通域免蒙域算术)
static ulong mont63_reduce(u128 t, ulong m, ulong m_inv)
static ulong mont64_R2(ulong m)
static void powmod_win3_63(ulong *pv, ulong bm, ulong d, int ebits, ulong m, ulong m_inv)
#define MONT63_MAX
Copyright (C) 2026 HJimmyK (Jericho Knox)
static ulong to_mont63(ulong x, ulong R2, ulong m, ulong m_inv)
static ulong mont63_R2(ulong m)
static ulong powmod2_63(ulong d, ulong R2, ulong m, ulong m_inv)
static int sprp_check64(ulong v, ulong t, ulong m, ulong m_inv, ulong one, ulong m_1)
static int sprp_check63(ulong v, ulong t, ulong m, ulong m_inv, ulong one, ulong m_1)
static ulong mont63_mul(ulong a, ulong b, ulong m, ulong m_inv)
static int trial_div16(ulong n)
static ulong mont_R2(ulong m)
static ulong mont64_mul(ulong a, ulong b, ulong m, ulong m_inv)
static ulong mont64_reduce(u128 t, ulong m, ulong m_inv)
static void powmod2_win3_64(ulong *pv1, ulong *pv2, ulong bm1, ulong bm2, ulong d, int ebits, ulong m, ulong m_inv)
static void powmod2_win3_63(ulong *pv1, ulong *pv2, ulong bm1, ulong bm2, ulong d, int ebits, ulong m, ulong m_inv)
static ulong powmod2_64(ulong d, ulong R2, ulong m, ulong m_inv)
static ulong to_mont64(ulong x, ulong R2, ulong m, ulong m_inv)
#define lmmp_param_assert(x)
mp_limb_t lmmp_inv_1_(mp_limb_t x)
1阶逆元计算 (inv1)
static uint64_t _bpow_preinv_(uint64_t m, uint64_t k, int nb, uint64_t inv)
#define ctz_shr_u64(r, x, cnt)
Copyright (C) 2026 HJimmyK (Jericho Knox)
#define clz_shl_u64(r, x, cnt)
ulong lmmp_prev_prime_ulong_(ulong n)
小于等于n的上一个素数
ulong lmmp_binvert_ulong_(ulong a)
计算 a 在2^64下的逆元
bool lmmp_is_prime_ulong_notrial_(ulong n)
判断素数(无试除法,单 limb 档)
bool lmmp_is_prime_ulong_(ulong n)
判断素数
ulong lmmp_next_prime_ulong_(ulong n)
大于n的下一个素数
#define PRIME_SHORT_TABLE_SIZE
int lmmp_is_prime_table_(uint p)
根据全局素数表判断一个数是否为素数
#define PRIME_SHORT_TABLE_N
const ushort prime_short_table[6542]
Copyright (C) 2026 HJimmyK (Jericho Knox)
ushort lmmp_prime_cnt16_(ushort n)
计算小于等于 n 的素数数量
static int trial_div35711(ulong n)
校验是否能被3,5,7,11整除,能够整除则返回1,否则返回0