LMMP
4.3.0
Lamina High-Precision Arithmetic Library
Toggle main menu visibility
载入中...
搜索中...
未找到
test_random.c
浏览该文件的文档.
1
/**
2
* Copyright (C) 2026 HJimmyK (Jericho Knox)
3
*
4
* This file is part of LMMP.
5
*
6
* LMMP is free software: you can redistribute it and/or modify it
7
* under the terms of the GNU Lesser General Public License as
8
* published by the Free Software Foundation; either version 3 of
9
* the License, or (at your option) any later version.
10
*
11
* This library is distributed in the hope that it will be useful,
12
* but WITHOUT ANY WARRANTY; without even the implied warranty of
13
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14
* GNU Lesser General Public License for more details.
15
*
16
* You should have received a copy of the GNU Lesser General Public
17
* License along with this library. If not, see
18
* <https://www.gnu.org/licenses/>.
19
*
20
* SPDX-License-Identifier: LGPL-3.0-or-later
21
*/
22
23
#include "
lmmp/lmmpn.h
"
24
#include "
lmmp/mprand.h
"
25
#include "
lmmp/secret.h
"
26
#include "
lmmp/version.h
"
27
#include "
cases.h
"
28
#include "
support/lmmp_test_utils.h
"
29
30
#include <string.h>
31
32
TEST_CASE
(
"rng/basic"
, seed_random_reproducible) {
33
mp_size_t
n
= 16;
34
mp_ptr
a = alloc_limbs(
n
);
35
mp_ptr
b = alloc_limbs(
n
);
36
37
// 相同种子和类型应可复现
38
mp_size_t
an
=
lmmp_seed_random_
(a,
n
, 0x123456789ull, 0);
39
mp_size_t
bn
=
lmmp_seed_random_
(b,
n
, 0x123456789ull, 0);
40
TEST_CHECK_EQ
(
an
,
bn
);
41
for
(
mp_size_t
i = 0; i <
an
; ++i)
TEST_CHECK_EQ
(a[i], b[i]);
42
43
// 不同类型应产生不同序列(概率性,但相同实现下应稳定)
44
mp_size_t
cn =
lmmp_seed_random_
(b,
n
, 0x123456789ull, 1);
45
bool
diff =
false
;
46
for
(
mp_size_t
i = 0; i <
an
&& i < cn; ++i)
if
(a[i] != b[i]) diff =
true
;
47
TEST_CHECK_MSG
(diff ||
an
!= cn,
"seed_type changes sequence"
);
48
49
lmmp_free
(a);
50
lmmp_free
(b);
51
}
52
53
TEST_CASE
(
"rng/basic"
, global_random_reproducible) {
54
mp_size_t
n
= 16;
55
mp_ptr
a = alloc_limbs(
n
);
56
mp_ptr
b = alloc_limbs(
n
);
57
58
lmmp_global_rng_init_
(12345, 1);
59
mp_size_t
an
=
lmmp_random_
(a,
n
);
60
lmmp_global_rng_init_
(12345, 1);
61
mp_size_t
bn
=
lmmp_random_
(b,
n
);
62
TEST_CHECK_EQ
(
an
,
bn
);
63
for
(
mp_size_t
i = 0; i <
an
; ++i)
TEST_CHECK_EQ
(a[i], b[i]);
64
65
lmmp_free
(a);
66
lmmp_free
(b);
67
}
68
69
TEST_CASE
(
"rng/strong"
, strong_random) {
70
mp_size_t
k
= 20;
71
mp_size_t
n
= 12;
72
lmmp_strong_rng_t
* rng =
lmmp_strong_rng_init_
(
k
, 42);
73
TEST_CHECK_MSG
(rng != NULL,
"strong rng init"
);
74
75
mp_ptr
a = alloc_limbs(
k
);
76
mp_ptr
b = alloc_limbs(
k
);
77
mp_size_t
an
=
lmmp_strong_random_
(a,
n
, rng);
78
mp_size_t
bn
=
lmmp_strong_random_
(b,
n
, rng);
79
TEST_CHECK_MSG
(
an
> 0 &&
bn
> 0,
"strong random nonzero length"
);
80
TEST_CHECK_MSG
(
an
<=
n
&&
bn
<=
n
,
"strong random length bound"
);
81
bool
same = (
an
==
bn
);
82
if
(same)
for
(
mp_size_t
i = 0; i <
an
; ++i)
if
(a[i] != b[i]) same =
false
;
83
TEST_CHECK_MSG
(!same,
"strong random sequence advances"
);
84
85
lmmp_strong_rng_free_
(rng);
86
lmmp_free
(a);
87
lmmp_free
(b);
88
}
89
90
TEST_CASE
(
"rng/strong"
, strong_rng_extern_reproducible) {
91
// 回归:扩容时新增状态曾未初始化(realloc 不清零,且初始化循环上界在更新 k 之前取值)
92
const
mp_size_t
k1 = 8;
93
const
mp_size_t
k2 = 24;
94
95
lmmp_strong_rng_t
* a =
lmmp_strong_rng_init_
(k1, 7);
96
lmmp_strong_rng_extern_
(a, k2);
97
lmmp_strong_rng_t
* b =
lmmp_strong_rng_init_
(k1, 7);
98
lmmp_strong_rng_extern_
(b, k2);
99
100
mp_ptr
ra = alloc_limbs(k2);
101
mp_ptr
rb = alloc_limbs(k2);
102
mp_size_t
na =
lmmp_strong_random_
(ra, k2, a);
103
mp_size_t
nb =
lmmp_strong_random_
(rb, k2, b);
104
TEST_CHECK_EQ
(na, nb);
105
TEST_CHECK_MSG
(na > 0,
"extern grown rng nonzero output length"
);
106
bool
same =
true
;
107
for
(
mp_size_t
i = 0; i < na; ++i)
108
if
(ra[i] != rb[i]) same =
false
;
109
TEST_CHECK_MSG
(same,
"extern growth deterministic"
);
110
111
lmmp_strong_rng_free_
(a);
112
lmmp_strong_rng_free_
(b);
113
lmmp_free
(ra);
114
lmmp_free
(rb);
115
}
116
117
void
test_random
(
void
) {
118
TEST_RUN
(
"rng/basic"
, seed_random_reproducible);
119
TEST_RUN
(
"rng/basic"
, global_random_reproducible);
120
TEST_RUN
(
"rng/strong"
, strong_random);
121
TEST_RUN
(
"rng/strong"
, strong_rng_extern_reproducible);
122
}
k
#define k
an
#define an
bn
#define bn
mp_ptr
mp_limb_t * mp_ptr
定义
lmmp.h:96
mp_size_t
uint64_t mp_size_t
定义
lmmp.h:93
lmmp_free
void lmmp_free(void *ptr)
内存释放函数(调用lmmp_heap_free_fn)
定义
memory.c:437
lmmp_test_utils.h
lmmpn.h
cases.h
test_random
void test_random(void)
Copyright (C) 2026 HJimmyK (Jericho Knox)
定义
test_random.c:117
lmmp_strong_rng_t
定义
mprand.c:94
mprand.h
lmmp_seed_random_
mp_size_t lmmp_seed_random_(mp_ptr dst, mp_size_t n, mp_limb_t seed, unsigned seed_type)
生成随机大整数(0 - B^n-1 均匀分布)
lmmp_strong_rng_init_
lmmp_strong_rng_t * lmmp_strong_rng_init_(mp_size_t k, unsigned seed)
创建k维度强随机数生成器
定义
mprand.c:99
lmmp_strong_rng_free_
void lmmp_strong_rng_free_(lmmp_strong_rng_t *rng)
销毁强随机数生成器
定义
mprand.c:127
lmmp_strong_random_
mp_size_t lmmp_strong_random_(mp_ptr dst, mp_size_t n, lmmp_strong_rng_t *rng)
生成n维度强随机数(0 - B^n-1 均匀分布)
lmmp_global_rng_init_
void lmmp_global_rng_init_(unsigned seed, unsigned seed_type)
Copyright (C) 2026 HJimmyK (Jericho Knox)
定义
mprand.c:38
lmmp_strong_rng_extern_
void lmmp_strong_rng_extern_(lmmp_strong_rng_t *rng, mp_size_t k)
将rng内部状态拓展至k维度
定义
mprand.c:113
lmmp_random_
mp_size_t lmmp_random_(mp_ptr dst, mp_size_t n)
生成随机大整数(0 - B^n-1 均匀分布)
n
#define n
secret.h
TEST_CHECK_MSG
#define TEST_CHECK_MSG(cond, msg)
定义
test.h:38
TEST_CASE
#define TEST_CASE(category, name)
定义
test.h:35
TEST_CHECK_EQ
#define TEST_CHECK_EQ(a, b)
定义
test.h:39
TEST_RUN
#define TEST_RUN(category, name)
定义
test.h:36
version.h
src
lmmp
mprand
test
test_random.c
生成于
, 为 LMMP使用
1.18.0