/
chia.hpp
197 lines (174 loc) · 8.36 KB
/
chia.hpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
//---------------------------------------------------------------------------//
// Copyright (c) 2018-2020 Mikhail Komarov <nemo@nil.foundation>
//
// MIT License
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in all
// copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
//---------------------------------------------------------------------------//
#ifndef CRYPTO3_VDF_CHIA_HPP
#define CRYPTO3_VDF_CHIA_HPP
#include <nil/crypto3/vdf/detail/chia_functions.hpp>
namespace nil {
namespace crypto3 {
namespace vdf {
class chia {
typedef detail::chia_functions policy_type;
public:
#if defined(CRYPTO3_VDF_GMP) || defined(CRYPTO3_VDF_MPIR)
template<typename T = mpz_t>
using state_type = typename policy_type::state_type<T>;
/*!
* @brief
* @tparam NumberType
* @tparam ExpressionTemplates
* @param state
* @param discriminant
* @param a
* @param b
*/
template<typename Integer, typename NumberType = mpz_t>
static inline void make_state(state_type<NumberType> &state, NumberType discriminant) {
NumberType denom;
mpz_init(denom);
mpz_set_ui(state.form.a, 2);
mpz_set_ui(state.form.b, 1);
mpz_mul(state.form.c, state.form.b, state.form.b);
mpz_sub(state.form.c, state.form.c, d);
mpz_mul_ui(denom, state.form.a, 4);
mpz_fdiv_q(state.form.c, state.form.c, denom);
mpz_set(state.form.d, discriminant);
fast_reduce(state);
mpz_clear(denom);
}
template<typename NumberType = mpz_t>
static inline state_type<NumberType> make_state(const NumberType &a, const NumberType &b,
const NumberType &discriminant) {
state_type<NumberType> state;
make_state(state, discriminant, a, b);
return state;
}
template<typename T, typename I>
inline static void compute(state_type<T> &state, I itr) {
policy_type::discriminant_generator(state, d);
mpz_abs(state.L, state.form.d);
mpz_root(state.L, state.L, 4);
for (int i = 0; i < itr; i++) {
policy_type::nudupl(state);
policy_type::fast_reduce(state);
}
}
#elif defined(CRYPTO3_VDF_FLINT)
template<typename T = fmpz_t>
using state_type = typename policy_type::state_type<T>;
/*!
* @brief
* @tparam NumberType
* @tparam ExpressionTemplates
* @param state
* @param discriminant
* @param a
* @param b
*/
template<typename Integer, typename NumberType = fmpz_t>
static inline void make_state(state_type<NumberType> &state, NumberType discriminant) {
NumberType denom;
fmpz_init(denom);
fmpz_set_ui(state.form.a, 2);
fmpz_set_ui(state.form.b, 1);
fmpz_mul(state.form.c, state.form.b, state.form.b);
fmpz_sub(state.form.c, state.form.c, d);
fmpz_mul_ui(denom, state.form.a, 4);
fmpz_fdiv_q(state.form.c, state.form.c, denom);
fmpz_set(state.form.d, discriminant);
fast_reduce(state);
fmpz_clear(denom);
}
template<typename NumberType = fmpz_t>
static inline state_type<NumberType> make_state(NumberType a, NumberType b, NumberType discriminant) {
state_type<NumberType> state;
make_state(state, discriminant, a, b);
return state;
}
template<typename T, typename I>
inline static void compute(state_type<T> &state, I itr) {
fmpz_abs(state.L, state.form.d);
fmpz_root(state.L, state.L, 4);
for (int i = 0; i < itr; i++) {
policy_type::nudupl(state);
policy_type::fast_reduce(state);
}
}
#elif defined(CRYPTO3_VDF_BOOST)
template<typename T>
using state_type = typename policy_type::state_type<T>;
/*!
* @brief
* @tparam Backend
* @tparam ExpressionTemplates
* @tparam Integer
* @param state
* @param difficulty
*/
template<typename Backend, expression_template_option ExpressionTemplates, typename Integer>
inline static void compute(state_type<number<Backend, ExpressionTemplates>> &state,
Integer difficulty) {
state.L = abs(state.form.d);
//#FIXME: requires root(state.L, 4) functions
state.L = sqrt(state.L);
state.L = sqrt(state.L);
for (int i = 0; i < difficulty; i++) {
policy_type::nudupl(state);
policy_type::fast_reduce(state);
}
}
/*!
* @brief
* @tparam Backend
* @tparam ExpressionTemplates
* @param state
* @param discriminant
* @param a
* @param b
*/
template<typename Backend, expression_template_option ExpressionTemplates>
static inline void make_state(state_type<number<Backend, ExpressionTemplates>> &state,
const number<Backend, ExpressionTemplates> &discriminant,
const number<Backend, ExpressionTemplates> &a = 2,
const number<Backend, ExpressionTemplates> &b = 1) {
state.form.a = a;
state.form.b = b;
state.form.c = (b * b - discriminant) / (a * 4);
state.form.d = discriminant;
policy_type::fast_reduce(state);
}
template<typename Backend, expression_template_option ExpressionTemplates>
static inline state_type<number<Backend, ExpressionTemplates>>
make_state(const number<Backend, ExpressionTemplates> &a,
const number<Backend, ExpressionTemplates> &b,
const number<Backend, ExpressionTemplates> &discriminant) {
state_type<number<Backend, ExpressionTemplates>> state;
make_state(state, discriminant, a, b);
return state;
}
#endif
};
} // namespace vdf
} // namespace crypto3
} // namespace nil
#endif // CRYPTO3_CHIA_HPP