-
Notifications
You must be signed in to change notification settings - Fork 10
/
hashermtp.cc
340 lines (251 loc) · 11.6 KB
/
hashermtp.cc
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
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
#include <node.h>
#include <node_buffer.h>
#include <v8.h>
#include <stdint.h>
#include <iostream>
#include "nan.h"
#include "merkletree/mtp.h"
#include "compat.h"
#include "uint256.h"
using namespace node;
using namespace v8;
#define THROW_ERROR_EXCEPTION(x) Nan::ThrowError(x)
namespace {
const int8_t L = 64;
const int VEC_SIZE = 16;
const int NONCE_SIZE = sizeof(uint32_t);
const int HASH_ROOT_SIZE = sizeof(uint8_t) * 16;
const int BLOCK_SIZE = sizeof(uint64_t) * L * 2 * 128;
const int HASH_VALUE_SIZE = 32;
}
NAN_METHOD(hash) {
if (info.Length() < 5) {
return THROW_ERROR_EXCEPTION("hasher-mtp.hash - 5 arguments expected.");
}
uint32_t* header_ptr = (uint32_t *)Buffer::Data(Nan::To<v8::Object>(info[0]).ToLocalChecked());
char* target_ptr = (char*)Buffer::Data(Nan::To<v8::Object>(info[1]).ToLocalChecked());
char* nonce_start_ptr = (char*)Buffer::Data(Nan::To<v8::Object>(info[2]).ToLocalChecked());
char* nonce_end_ptr = (char*)Buffer::Data(Nan::To<v8::Object>(info[3]).ToLocalChecked());
char* output_ptr = (char*)Buffer::Data(Nan::To<v8::Object>(info[4]).ToLocalChecked());
uint256 target;
uint256 hash_value;
// target
std::memcpy(target.begin(), target_ptr, target.size());
// proofs
std::deque<std::vector<uint8_t>> proof[L * 3];
uint32_t nonce_start = *(uint32_t*)nonce_start_ptr;
uint32_t nonce_end = *(uint32_t*)nonce_end_ptr;
uint64_t hashes_done = 0;
unsigned char merkle_root[16];
unsigned char hash[32];
mtp::MerkleTree::Elements ordered_tree_elements;
argon2_context context = mtp::init_argon2d_param((const char*)header_ptr); //endiandata
argon2_instance_t instance;
argon2_ctx_from_mtp(&context, &instance);
ordered_tree_elements = mtp::init(&instance);
mtp::MerkleTree ordered_tree(ordered_tree_elements, true);
mtp::MerkleTree::Buffer root = ordered_tree.getRoot();
std::copy(root.begin(), root.end(), merkle_root);
uint32_t nonce = nonce_start;
info.GetReturnValue().Set(Nan::False());
do {
if (nonce == UINT32_MAX || nonce >= nonce_end)
{
break;
}
bool is_sol = mtp::solver_fast(nonce, &instance, merkle_root, header_ptr, target);
if (is_sol) {
uint64_t mtp_block[L * 2][128];
unsigned char mtp_proof[L * 3 * 353];
unsigned int mtp_proof_size = 0;
mtp::solver(
/* input */ header_ptr,
/* nonce */ nonce,
/* instance */ &instance,
/* merkle_tree */ ordered_tree,
/* merkle_root */ merkle_root,
/* mtp_block_out */ mtp_block,
/* mtp_proof_out */ mtp_proof,
/* mtp_proof_size_out */ &mtp_proof_size,
/* hash_out */ hash);
int res = 1;
hashes_done = nonce - nonce_start;
info.GetReturnValue().Set(Nan::True());
char* output_pos = output_ptr;
// output data size
uint32_t result_size =
NONCE_SIZE +
HASH_VALUE_SIZE +
HASH_ROOT_SIZE +
BLOCK_SIZE +
mtp_proof_size;
// result_size
std::memcpy(output_pos, &result_size, sizeof(uint32_t));
output_pos += sizeof(uint32_t);
// nonce
std::memcpy(output_pos, &nonce, NONCE_SIZE);
output_pos += NONCE_SIZE;
// hash_value
std::memcpy(output_pos, hash, HASH_VALUE_SIZE);
output_pos += HASH_VALUE_SIZE;
// hash_root_mtp
std::memcpy(output_pos, merkle_root, HASH_ROOT_SIZE);
output_pos += HASH_ROOT_SIZE;
// block_mtp
std::memcpy(output_pos, mtp_block, BLOCK_SIZE);
output_pos += BLOCK_SIZE;
std::memcpy(output_pos, mtp_proof, mtp_proof_size);
break;
}
nonce += 1;
} while (nonce_start<0xffffffff);
ordered_tree_elements.clear();
free(instance.memory);
}
NAN_METHOD(hash_one) {
if (info.Length() < 3)
return THROW_ERROR_EXCEPTION("hasher-mtp.hash_one - 3 arguments expected.");
uint32_t* header_ptr = (uint32_t *)Buffer::Data(Nan::To<v8::Object>(info[0]).ToLocalChecked());
char* nonce_ptr = (char*)Buffer::Data(Nan::To<v8::Object>(info[1]).ToLocalChecked());
char* output_ptr = (char*)Buffer::Data(Nan::To<v8::Object>(info[2]).ToLocalChecked());
uint256 hash_value;
// proofs
std::deque<std::vector<uint8_t>> proof[L * 3];
uint32_t nonce = *(uint32_t*)nonce_ptr;
uint64_t hashes_done = 0;
unsigned char merkle_root[16];
unsigned char hash[32];
mtp::MerkleTree::Elements ordered_tree_elements;
argon2_context context = mtp::init_argon2d_param((const char*)header_ptr); //endiandata
argon2_instance_t instance;
argon2_ctx_from_mtp(&context, &instance);
ordered_tree_elements = mtp::init(&instance);
mtp::MerkleTree ordered_tree(ordered_tree_elements, true);
mtp::MerkleTree::Buffer root = ordered_tree.getRoot();
std::copy(root.begin(), root.end(), merkle_root);
uint64_t mtp_block[L * 2][128];
unsigned char mtp_proof[L * 3 * 353];
unsigned int mtp_proof_size = 0;
bool is_valid = mtp::solver(
/* input */ header_ptr,
/* nonce */ nonce,
/* instance */ &instance,
/* merkle_tree */ ordered_tree,
/* merkle_root */ merkle_root,
/* mtp_block_out */ mtp_block,
/* mtp_proof_out */ mtp_proof,
/* mtp_proof_size_out */ &mtp_proof_size,
/* hash_out */ hash);
if (is_valid) {
info.GetReturnValue().Set(Nan::True());
}
else {
info.GetReturnValue().Set(Nan::False());
return;
}
char *output_pos = output_ptr;
// output data size
uint32_t result_size =
NONCE_SIZE +
HASH_VALUE_SIZE +
HASH_ROOT_SIZE +
BLOCK_SIZE +
mtp_proof_size;
// result_size
std::memcpy(output_pos, &result_size, sizeof(uint32_t));
output_pos += sizeof(uint32_t);
// nonce
std::memcpy(output_pos, &nonce, NONCE_SIZE);
output_pos += NONCE_SIZE;
// hash_value
std::memcpy(output_pos, hash, HASH_VALUE_SIZE);
output_pos += HASH_VALUE_SIZE;
// hash_root_mtp
std::memcpy(output_pos, merkle_root, HASH_ROOT_SIZE);
output_pos += HASH_ROOT_SIZE;
// block_mtp
std::memcpy(output_pos, mtp_block, BLOCK_SIZE);
output_pos += BLOCK_SIZE;
std::memcpy(output_pos, mtp_proof, mtp_proof_size);
ordered_tree_elements.clear();
free(instance.memory);
}
NAN_METHOD(verify) {
if (info.Length() < 6)
return THROW_ERROR_EXCEPTION("hasher-mtp.verify - 6 arguments expected.");
char* input_ptr = (char*)Buffer::Data(Nan::To<v8::Object>(info[0]).ToLocalChecked());
unsigned char* nonce_ptr = (unsigned char*)Buffer::Data(Nan::To<v8::Object>(info[1]).ToLocalChecked());
unsigned char* hash_root_ptr = (unsigned char*)Buffer::Data(Nan::To<v8::Object>(info[2]).ToLocalChecked());
unsigned char* block_ptr = (unsigned char*)Buffer::Data(Nan::To<v8::Object>(info[3]).ToLocalChecked());
unsigned char* proof_ptr = (unsigned char*)Buffer::Data(Nan::To<v8::Object>(info[4]).ToLocalChecked());
unsigned char* hash_value_out_ptr = (unsigned char*)Buffer::Data(Nan::To<v8::Object>(info[5]).ToLocalChecked());
// hash root
uint8_t hash_root[16];
std::memcpy(&hash_root, hash_root_ptr, sizeof(hash_root));
// block
uint64_t block[L*2][128];
std::memcpy(&block, block_ptr, sizeof(block));
uint32_t nonce = *(uint32_t*)nonce_ptr;
uint256 hash_value;
bool is_valid = mtp::verify_fast(input_ptr, nonce, hash_root, block, &hash_value);
if (!is_valid) {
info.GetReturnValue().Set(Nan::False());
}
else {
// proof
std::deque <std::vector<uint8_t>> proof[L * 3];
unsigned char *proof_pos = proof_ptr;
for (int i = 0; i < L * 3; ++i) {
uint8_t deq_size;
std::memcpy(&deq_size, proof_pos, sizeof(uint8_t));
proof_pos += sizeof(uint8_t);
std::deque <std::vector<uint8_t>> deq(deq_size);
for (int j = 0; j < deq_size; ++j) {
std::vector <uint8_t> vec(sizeof(uint8_t) * VEC_SIZE);
std::memcpy(vec.data(), proof_pos, sizeof(uint8_t) * VEC_SIZE);
proof_pos += sizeof(uint8_t) * VEC_SIZE;
deq[j] = vec;
}
proof[i] = deq;
}
is_valid = mtp::verify(input_ptr, nonce, hash_root, block, proof, &hash_value);
if (is_valid) {
std::memcpy(hash_value_out_ptr, hash_value.begin(), hash_value.size());
info.GetReturnValue().Set(Nan::True());
} else {
info.GetReturnValue().Set(Nan::False());
}
}
}
NAN_METHOD(verify_fast) {
if (info.Length() < 5)
return THROW_ERROR_EXCEPTION("hasher-mtp.verify_fast - 5 arguments expected.");
char* input_ptr = (char*)Buffer::Data(Nan::To<v8::Object>(info[0]).ToLocalChecked());
unsigned char* nonce_ptr = (unsigned char*)Buffer::Data(Nan::To<v8::Object>(info[1]).ToLocalChecked());
unsigned char* hash_root_ptr = (unsigned char*)Buffer::Data(Nan::To<v8::Object>(info[2]).ToLocalChecked());
unsigned char* block_ptr = (unsigned char*)Buffer::Data(Nan::To<v8::Object>(info[3]).ToLocalChecked());
unsigned char* hash_value_out_ptr = (unsigned char*)Buffer::Data(Nan::To<v8::Object>(info[4]).ToLocalChecked());
// hash root
uint8_t hash_root[16];
std::memcpy(&hash_root, hash_root_ptr, sizeof(hash_root));
// block
uint64_t block[L*2][128];
std::memcpy(&block, block_ptr, sizeof(block));
uint32_t nonce = *(uint32_t*)nonce_ptr;
uint256 hash_value;
bool is_valid = mtp::verify_fast(input_ptr, nonce, hash_root, block, &hash_value);
if (is_valid) {
std::memcpy(hash_value_out_ptr, hash_value.begin(), hash_value.size());
info.GetReturnValue().Set(Nan::True());
}
else {
info.GetReturnValue().Set(Nan::False());
}
}
NAN_MODULE_INIT(init) {
Nan::Set(target, Nan::New("hash").ToLocalChecked(), Nan::GetFunction(Nan::New<FunctionTemplate>(hash)).ToLocalChecked());
Nan::Set(target, Nan::New("hash_one").ToLocalChecked(), Nan::GetFunction(Nan::New<FunctionTemplate>(hash_one)).ToLocalChecked());
Nan::Set(target, Nan::New("verify").ToLocalChecked(), Nan::GetFunction(Nan::New<FunctionTemplate>(verify)).ToLocalChecked());
Nan::Set(target, Nan::New("verify_fast").ToLocalChecked(), Nan::GetFunction(Nan::New<FunctionTemplate>(verify_fast)).ToLocalChecked());
}
NODE_MODULE(hashermtp, init)