Barretenberg
The ZK-SNARK library at the core of Aztec
Loading...
Searching...
No Matches
merkle_check.test.cpp
Go to the documentation of this file.
1#include <gmock/gmock.h>
2#include <gtest/gtest.h>
3
4#include <cmath>
5#include <cstdint>
6
22
23namespace bb::avm2::constraining {
24namespace {
25
26using ::testing::NiceMock;
27
28using simulation::EventEmitter;
29using simulation::MerkleCheck;
30using simulation::MerkleCheckEvent;
31using simulation::MockExecutionIdManager;
32using simulation::MockGreaterThan;
33using simulation::NoopEventEmitter;
34using simulation::Poseidon2;
35using simulation::Poseidon2HashEvent;
36using simulation::Poseidon2PermutationEvent;
37using simulation::Poseidon2PermutationMemoryEvent;
39
40using tracegen::MerkleCheckTraceBuilder;
41using tracegen::Poseidon2TraceBuilder;
42using tracegen::TestTraceContainer;
43
45using C = Column;
48
49TEST(MerkleCheckConstrainingTest, EmptyRow)
50{
51 check_relation<merkle_check>(testing::empty_trace());
52}
53
54TEST(MerkleCheckConstrainingTest, ComputationCannotBeStoppedPrematurely)
55{
56 TestTraceContainer trace({
57 { { C::precomputed_first_row, 1 }, { C::merkle_check_sel, 0 } },
58 { { C::merkle_check_sel, 1 } },
59 { { C::merkle_check_sel, 1 } },
60 { { C::merkle_check_sel, 1 }, { C::merkle_check_end, 1 } },
61 { { C::merkle_check_sel, 0 } },
62 });
63
65
66 const uint32_t last_row_idx = 3;
67 // Negative test - now modify to an incorrect value
68 trace.set(C::merkle_check_end, last_row_idx, 0); // This should fail - end went from 1 back to 0
69
70 EXPECT_THROW_WITH_MESSAGE(check_relation<merkle_check>(trace, merkle_check::SR_TRACE_CONTINUITY),
72}
73
74TEST(MerkleCheckConstrainingTest, EndCannotBeOneOnFirstRow)
75{
76 // First create a valid trace
77 TestTraceContainer trace({
78 // end is correctly 0 on first row
79 { { C::precomputed_first_row, 1 }, { C::merkle_check_sel, 0 }, { C::merkle_check_end, 0 } },
80 });
81
82 // Verify it works with correct values
83 check_relation<merkle_check>(trace);
84
85 // Negative test - now modify to an invalid value
86 trace.set(C::merkle_check_sel, 0, 1);
87 trace.set(C::merkle_check_end, 0, 1); // This should fail - end can't be 1 on first row
88
89 EXPECT_THROW_WITH_MESSAGE(check_relation<merkle_check>(trace), "Relation merkle_check");
90}
91
92TEST(MerkleCheckConstrainingTest, SelectorOnEnd)
93{
94 // Test constraint: (start + end) * (1 - sel) = 0
95 // If end=1, sel must be 1
96 TestTraceContainer trace({
97 { { C::merkle_check_end, 1 }, { C::merkle_check_sel, 1 } }, // sel=1 when end=1 is correct
98 });
99
100 check_relation<merkle_check>(trace, merkle_check::SR_SEL_ON_START_OR_END);
101
102 // Negative test - now modify to an incorrect value
103 trace.set(C::merkle_check_sel, 0, 0); // This should fail - sel cannot be 0 when end=1
104
105 EXPECT_THROW_WITH_MESSAGE(check_relation<merkle_check>(trace, merkle_check::SR_SEL_ON_START_OR_END),
107}
108
109TEST(MerkleCheckConstrainingTest, SelectorOnStart)
110{
111 // Test constraint: (start + end) * (1 - sel) = 0
112 // If start=1, sel must be 1
113 TestTraceContainer trace({
114 { { C::merkle_check_start, 1 }, { C::merkle_check_sel, 1 } }, // sel=1 when start=1 is correct
115 });
116
117 check_relation<merkle_check>(trace, merkle_check::SR_SEL_ON_START_OR_END);
118
119 // Negative test - now modify to an incorrect value
120 trace.set(C::merkle_check_sel, 0, 0); // This should fail - sel cannot be 0 when start=1
121
122 EXPECT_THROW_WITH_MESSAGE(check_relation<merkle_check>(trace, merkle_check::SR_SEL_ON_START_OR_END),
124}
125
126TEST(MerkleCheckConstrainingTest, PropagateReadRoot)
127{
128 // Test constraint: NOT_END * (root' - root) = 0
129 // Root should stay the same in the next row unless it's an end row
130 // When end=1, the next root can be different
131 TestTraceContainer trace({
132 { { C::merkle_check_sel, 1 }, { C::merkle_check_end, 0 }, { C::merkle_check_read_root, 123 } },
133 // Same leaf value is correct when NOT_END=1
134 { { C::merkle_check_sel, 1 }, { C::merkle_check_end, 1 }, { C::merkle_check_read_root, 123 } },
135 // Different leaf value is allowed after end row
136 { { C::merkle_check_sel, 1 }, { C::merkle_check_end, 1 }, { C::merkle_check_read_root, 456 } },
137 });
138
139 check_relation<merkle_check>(trace, merkle_check::SR_PROPAGATE_READ_ROOT);
140
141 // Negative test - now modify to an incorrect value
142 trace.set(C::merkle_check_read_root, 1, 456); // This should fail - root should stay the same when NOT_END=1
143
144 EXPECT_THROW_WITH_MESSAGE(check_relation<merkle_check>(trace, merkle_check::SR_PROPAGATE_READ_ROOT),
146}
147
148TEST(MerkleCheckConstrainingTest, PropagateWriteRoot)
149{
150 // Test constraint: NOT_END * (write_root' - write_root) = 0
151 // write_root should stay the same in the next row unless it's an end row
152 // When end=1, the next root can be different
153 TestTraceContainer trace({
154 { { C::merkle_check_sel, 1 }, { C::merkle_check_end, 0 }, { C::merkle_check_write_root, 123 } },
155 // Same leaf value is correct when NOT_END=1
156 { { C::merkle_check_sel, 1 }, { C::merkle_check_end, 1 }, { C::merkle_check_write_root, 123 } },
157 // Different leaf value is allowed after end row
158 { { C::merkle_check_sel, 1 }, { C::merkle_check_end, 1 }, { C::merkle_check_write_root, 456 } },
159 });
160
161 check_relation<merkle_check>(trace, merkle_check::SR_PROPAGATE_WRITE_ROOT);
162
163 // Negative test - now modify to an incorrect value
164 trace.set(C::merkle_check_write_root, 1, 456); // This should fail - root should stay the same when NOT_END=1
165
166 EXPECT_THROW_WITH_MESSAGE(check_relation<merkle_check>(trace, merkle_check::SR_PROPAGATE_WRITE_ROOT),
168}
169
170TEST(MerkleCheckConstrainingTest, PropagateWrite)
171{
172 // Test constraint: NOT_END * (write' - write) = 0
173 // write should stay the same in the next row unless it's an end row
174 // When end=1, the next write flag can be different
175 TestTraceContainer trace({
176 { { C::merkle_check_sel, 1 }, { C::merkle_check_end, 0 }, { C::merkle_check_write, 1 } },
177 // Same leaf value is correct when NOT_END=1
178 { { C::merkle_check_sel, 1 }, { C::merkle_check_end, 1 }, { C::merkle_check_write, 1 } },
179 // Different leaf value is allowed after end row
180 { { C::merkle_check_sel, 1 }, { C::merkle_check_end, 1 }, { C::merkle_check_write, 0 } },
181 });
182
183 check_relation<merkle_check>(trace, merkle_check::SR_PROPAGATE_WRITE);
184
185 // Negative test - now modify to an incorrect value
186 trace.set(C::merkle_check_write, 1, 0); // This should fail - write should stay the same when NOT_END=1
187
188 EXPECT_THROW_WITH_MESSAGE(check_relation<merkle_check>(trace, merkle_check::SR_PROPAGATE_WRITE),
190}
191
192TEST(MerkleCheckConstrainingTest, PathLenDecrements)
193{
194 TestTraceContainer trace({
195 // Decrements until path_len=0
196 { { C::merkle_check_sel, 1 }, { C::merkle_check_end, 0 }, { C::merkle_check_path_len, 3 } },
197 { { C::merkle_check_sel, 1 }, { C::merkle_check_end, 0 }, { C::merkle_check_path_len, 2 } },
198 { { C::merkle_check_sel, 1 }, { C::merkle_check_end, 1 }, { C::merkle_check_path_len, 1 } },
199 // Path len can be different after end=1
200 { { C::merkle_check_sel, 1 }, { C::merkle_check_end, 1 }, { C::merkle_check_path_len, 5 } },
201 });
202
203 check_relation<merkle_check>(trace, merkle_check::SR_PATH_LEN_DECREMENTS);
204
205 // Negative test - now modify to an incorrect value and verify it fails
206 trace.set(C::merkle_check_path_len, 1, 1); // Should be 2, change to 1
207
208 EXPECT_THROW_WITH_MESSAGE(check_relation<merkle_check>(trace, merkle_check::SR_PATH_LEN_DECREMENTS),
210}
211
212TEST(MerkleCheckConstrainingTest, EndWhenPathLenOne)
213{
214 TestTraceContainer trace({
215 { { C::merkle_check_sel, 1 },
216 { C::merkle_check_path_len, 2 },
217 { C::merkle_check_path_len_min_one_inv, FF(1).invert() },
218 { C::merkle_check_end, 0 } },
219 { { C::merkle_check_sel, 1 },
220 { C::merkle_check_path_len, 1 },
221 { C::merkle_check_path_len_min_one_inv, 0 },
222 { C::merkle_check_end, 1 } },
223 });
224
225 check_relation<merkle_check>(trace, merkle_check::SR_END_IFF_REM_PATH_EMPTY);
226
227 // Negative test - now modify to an incorrect value and verify it fails
228 trace.set(C::merkle_check_end, 1, 0); // Should be 1, change to 0
229
230 EXPECT_THROW_WITH_MESSAGE(check_relation<merkle_check>(trace, merkle_check::SR_END_IFF_REM_PATH_EMPTY),
232}
233
234TEST(MerkleCheckConstrainingTest, NextIndexIsHalved)
235{
236 TestTraceContainer trace({
237 { { C::merkle_check_sel, 1 },
238 { C::merkle_check_end, 0 },
239 { C::merkle_check_index, 6 },
240 { C::merkle_check_index_is_even, 1 } },
241 { { C::merkle_check_sel, 1 },
242 { C::merkle_check_end, 0 },
243 { C::merkle_check_index, 3 }, // 6/2 = 3
244 { C::merkle_check_index_is_even, 0 } },
245 { { C::merkle_check_sel, 1 },
246 { C::merkle_check_end, 1 }, // Set end=1 for final row
247 { C::merkle_check_index, 1 }, // 3/2 = 1
248 { C::merkle_check_index_is_even, 0 } },
249 });
250
251 check_relation<merkle_check>(trace, merkle_check::SR_NEXT_INDEX_IS_HALVED);
252
253 // Test with odd index
254 TestTraceContainer trace2({
255 { { C::merkle_check_sel, 1 },
256 { C::merkle_check_end, 0 },
257 { C::merkle_check_index, 7 },
258 { C::merkle_check_index_is_even, 0 } },
259 { { C::merkle_check_sel, 1 },
260 { C::merkle_check_end, 0 },
261 { C::merkle_check_index, 3 }, // (7-1)/2 = 3
262 { C::merkle_check_index_is_even, 0 } },
263 { { C::merkle_check_sel, 1 },
264 { C::merkle_check_end, 1 }, // Set end=1 for final row
265 { C::merkle_check_index, 1 }, // 6/2 = 3
266 { C::merkle_check_index_is_even, 0 } },
267 });
268
269 check_relation<merkle_check>(trace2, merkle_check::SR_NEXT_INDEX_IS_HALVED);
270
271 // Negative test - now modify to an incorrect value and verify it fails
272 trace2.set(C::merkle_check_index, 1, 4); // Should be 3, change to 4
273
274 EXPECT_THROW_WITH_MESSAGE(check_relation<merkle_check>(trace2, merkle_check::SR_NEXT_INDEX_IS_HALVED),
276}
277
278TEST(MerkleCheckConstrainingTest, AssignReadNodesEven)
279{
280 // Test even index (current_node goes to left_node and sibling goes to right_node)
281 TestTraceContainer trace({
282 {
283 { C::merkle_check_sel, 1 },
284 { C::merkle_check_index_is_even, 1 },
285 { C::merkle_check_read_node, 123 },
286 { C::merkle_check_sibling, 456 },
287 { C::merkle_check_read_left_node, 123 },
288 { C::merkle_check_read_right_node, 456 },
289 },
290 });
291
292 check_relation<merkle_check>(trace, merkle_check::SR_READ_LEFT_NODE, merkle_check::SR_READ_RIGHT_NODE);
293
294 // Negative test - swap values of read_left_node and read_right_node
295 trace.set(C::merkle_check_read_left_node, 0, 456);
296 trace.set(C::merkle_check_read_right_node, 0, 123);
297
298 EXPECT_THROW_WITH_MESSAGE(check_relation<merkle_check>(trace, merkle_check::SR_READ_RIGHT_NODE),
300 EXPECT_THROW_WITH_MESSAGE(check_relation<merkle_check>(trace, merkle_check::SR_READ_LEFT_NODE),
302}
303
304TEST(MerkleCheckConstrainingTest, AssignReadNodesOdd)
305{
306 // Test odd index (current_node goes to right_node and sibling goes to left_node)
307 TestTraceContainer trace({
308 {
309 { C::merkle_check_sel, 1 },
310 { C::merkle_check_index_is_even, 0 },
311 { C::merkle_check_read_node, 123 },
312 { C::merkle_check_sibling, 456 },
313 { C::merkle_check_read_left_node, 456 },
314 { C::merkle_check_read_right_node, 123 },
315 },
316 });
317
318 check_relation<merkle_check>(trace, merkle_check::SR_READ_LEFT_NODE, merkle_check::SR_READ_RIGHT_NODE);
319
320 // Negative test - swap values of read_left_node and read_right_node
321 trace.set(C::merkle_check_read_left_node, 0, 123);
322 trace.set(C::merkle_check_read_right_node, 0, 456);
323
324 EXPECT_THROW_WITH_MESSAGE(check_relation<merkle_check>(trace, merkle_check::SR_READ_RIGHT_NODE),
326 EXPECT_THROW_WITH_MESSAGE(check_relation<merkle_check>(trace, merkle_check::SR_READ_LEFT_NODE),
328}
329
330TEST(MerkleCheckConstrainingTest, AssignWriteNodesEven)
331{
332 // Test even index (current_node goes to left_node and sibling goes to right_node)
333 TestTraceContainer trace({
334 {
335 { C::merkle_check_sel, 1 },
336 { C::merkle_check_write, 1 },
337 { C::merkle_check_index_is_even, 1 },
338 { C::merkle_check_write_node, 123 },
339 { C::merkle_check_sibling, 456 },
340 { C::merkle_check_write_left_node, 123 },
341 { C::merkle_check_write_right_node, 456 },
342 },
343 });
344
345 check_relation<merkle_check>(trace, merkle_check::SR_WRITE_LEFT_NODE, merkle_check::SR_WRITE_RIGHT_NODE);
346
347 // Negative test - swap values of write_left_node and write_right_node
348 trace.set(C::merkle_check_write_left_node, 0, 456);
349 trace.set(C::merkle_check_write_right_node, 0, 123);
350
351 EXPECT_THROW_WITH_MESSAGE(check_relation<merkle_check>(trace, merkle_check::SR_WRITE_RIGHT_NODE),
353 EXPECT_THROW_WITH_MESSAGE(check_relation<merkle_check>(trace, merkle_check::SR_WRITE_LEFT_NODE),
355}
356
357TEST(MerkleCheckConstrainingTest, AssignWriteNodesOdd)
358{
359 // Test odd index (current_node goes to right_node and sibling goes to left_node)
360 TestTraceContainer trace({
361 {
362 { C::merkle_check_sel, 1 },
363 { C::merkle_check_write, 1 },
364 { C::merkle_check_index_is_even, 0 },
365 { C::merkle_check_write_node, 123 },
366 { C::merkle_check_sibling, 456 },
367 { C::merkle_check_write_left_node, 456 },
368 { C::merkle_check_write_right_node, 123 },
369 },
370 });
371
372 check_relation<merkle_check>(trace, merkle_check::SR_WRITE_LEFT_NODE, merkle_check::SR_WRITE_RIGHT_NODE);
373
374 // Negative test - swap values of write_left_node and write_right_node
375 trace.set(C::merkle_check_write_left_node, 0, 123);
376 trace.set(C::merkle_check_write_right_node, 0, 456);
377
378 EXPECT_THROW_WITH_MESSAGE(check_relation<merkle_check>(trace, merkle_check::SR_WRITE_RIGHT_NODE),
380 EXPECT_THROW_WITH_MESSAGE(check_relation<merkle_check>(trace, merkle_check::SR_WRITE_LEFT_NODE),
382}
383
384TEST(MerkleCheckConstrainingTest, ReadOutputHashIsNextRowsNode)
385{
386 FF left_node = FF(123);
387 FF right_node = FF(456);
388 FF output_hash = UnconstrainedPoseidon2::hash({ left_node, right_node });
389
390 TestTraceContainer trace({
391 { { C::merkle_check_sel, 1 },
392 { C::merkle_check_end, 0 },
393 { C::merkle_check_read_node, left_node },
394 { C::merkle_check_read_right_node, right_node },
395 { C::merkle_check_read_output_hash, output_hash } },
396 { { C::merkle_check_sel, 1 },
397 { C::merkle_check_end, 1 }, // Set end=1 for final row
398 { C::merkle_check_read_node, output_hash } },
399 });
400
401 check_relation<merkle_check>(trace, merkle_check::SR_OUTPUT_HASH_IS_NEXT_ROWS_READ_NODE);
402
403 // Negative test - now modify to an incorrect value and verify it fails
404 trace.set(C::merkle_check_read_node, 1, output_hash + 1); // Should be output_hash
405
408}
409
410TEST(MerkleCheckConstrainingTest, WriteOutputHashIsNextRowsNode)
411{
412 FF left_node = FF(123);
413 FF right_node = FF(456);
414 FF output_hash = UnconstrainedPoseidon2::hash({ left_node, right_node });
415
416 TestTraceContainer trace({
417 { { C::merkle_check_sel, 1 },
418 { C::merkle_check_end, 0 },
419 { C::merkle_check_write_node, left_node },
420 { C::merkle_check_write_right_node, right_node },
421 { C::merkle_check_write_output_hash, output_hash } },
422 { { C::merkle_check_sel, 1 },
423 { C::merkle_check_end, 1 }, // Set end=1 for final row
424 { C::merkle_check_write_node, output_hash } },
425 });
426
427 check_relation<merkle_check>(trace, merkle_check::SR_OUTPUT_HASH_IS_NEXT_ROWS_WRITE_NODE);
428
429 // Negative test - now modify to an incorrect value and verify it fails
430 trace.set(C::merkle_check_write_node, 1, output_hash + 1); // Should be output_hash
431
433 check_relation<merkle_check>(trace, merkle_check::SR_OUTPUT_HASH_IS_NEXT_ROWS_WRITE_NODE),
435}
436
437TEST(MerkleCheckConstrainingTest, OutputHashIsNotNextRowsCurrentNodeValueForLastRow)
438{
439 FF output_hash = FF(456);
440 FF next_current_node = FF(789);
441
442 TestTraceContainer trace({
443 { { C::merkle_check_sel, 1 },
444 { C::merkle_check_end, 1 },
445 { C::merkle_check_read_output_hash, output_hash },
446 { C::merkle_check_write_output_hash, output_hash } },
447 { { C::merkle_check_sel, 1 },
448 { C::merkle_check_read_node, next_current_node },
449 { C::merkle_check_write_node, next_current_node } },
450 });
451
452 check_relation<merkle_check>(trace, merkle_check::SR_OUTPUT_HASH_IS_NEXT_ROWS_READ_NODE);
453 check_relation<merkle_check>(trace, merkle_check::SR_OUTPUT_HASH_IS_NEXT_ROWS_WRITE_NODE);
454}
455
456TEST(MerkleCheckConstrainingTest, ReadWithTracegen)
457{
458 TestTraceContainer trace({
459 { { C::precomputed_first_row, 1 } },
460 });
461 MerkleCheckTraceBuilder builder;
462
463 // Create a Merkle tree path with 3 levels
464 FF leaf_value = FF(123);
465 uint64_t leaf_index = 5;
466
467 // Create a sibling path of length 3
468 std::vector<FF> sibling_path = { FF(456), FF(789), FF(3333) };
469
470 // Compute expected root
471 FF root = unconstrained_root_from_path(DOM_SEP__MERKLE_HASH, leaf_value, leaf_index, sibling_path);
472
473 MerkleCheckEvent event = { .merkle_hash_domain_separator = DOM_SEP__MERKLE_HASH,
474 .leaf_value = leaf_value,
475 .leaf_index = leaf_index,
476 .sibling_path = sibling_path,
477 .root = root };
478
479 builder.process({ event }, trace);
480
481 // Check the relation for all rows
482 check_relation<merkle_check>(trace);
483
484 // Negative test - now corrupt the trace and verify it fails
485 uint32_t last_row = static_cast<uint32_t>(trace.get_num_rows() - 1);
486 // Corrupt the last row
487 trace.set(C::merkle_check_path_len, last_row, 66);
488
489 EXPECT_THROW_WITH_MESSAGE(check_relation<merkle_check>(trace), "Relation merkle_check");
490}
491
492TEST(MerkleCheckConstrainingTest, WriteWithTracegen)
493{
494 TestTraceContainer trace({
495 { { C::precomputed_first_row, 1 } },
496 });
497 MerkleCheckTraceBuilder builder;
498
499 // Create a Merkle tree path with 3 levels
500 FF leaf_value = FF(123);
501 FF new_leaf_value = FF(456);
502 uint64_t leaf_index = 5;
503
504 // Create a sibling path of length 3
505 std::vector<FF> sibling_path = { FF(456), FF(789), FF(3333) };
506
507 // Compute read root
508 FF root = unconstrained_root_from_path(DOM_SEP__MERKLE_HASH, leaf_value, leaf_index, sibling_path);
509 // Compute new root
510 FF new_root = unconstrained_root_from_path(DOM_SEP__MERKLE_HASH, new_leaf_value, leaf_index, sibling_path);
511
512 MerkleCheckEvent event = { .merkle_hash_domain_separator = DOM_SEP__MERKLE_HASH,
513 .leaf_value = leaf_value,
514 .new_leaf_value = new_leaf_value,
515 .leaf_index = leaf_index,
516 .sibling_path = sibling_path,
517 .root = root,
518 .new_root = new_root };
519
520 builder.process({ event }, trace);
521
522 // Check the relation for all rows
523 check_relation<merkle_check>(trace);
524}
525
526class MerkleCheckPoseidon2Test : public ::testing::Test {
527 protected:
528 MerkleCheckPoseidon2Test() = default;
529
530 EventEmitter<Poseidon2HashEvent> hash_event_emitter;
531 NoopEventEmitter<Poseidon2PermutationEvent> perm_event_emitter;
532 NoopEventEmitter<Poseidon2PermutationMemoryEvent> perm_mem_event_emitter;
533
534 NiceMock<MockExecutionIdManager> execution_id_manager;
535 NiceMock<MockGreaterThan> mock_gt;
537 Poseidon2(execution_id_manager, mock_gt, hash_event_emitter, perm_event_emitter, perm_mem_event_emitter);
538};
539
540TEST_F(MerkleCheckPoseidon2Test, ReadWithInteractions)
541{
542 EventEmitter<MerkleCheckEvent> merkle_event_emitter;
543 MerkleCheck merkle_check_sim(poseidon2, merkle_event_emitter);
544
545 TestTraceContainer trace({ { { C::precomputed_first_row, 1 } } });
546 Poseidon2TraceBuilder poseidon2_builder;
547 MerkleCheckTraceBuilder merkle_check_builder;
548
549 FF leaf_value = 333;
550 uint64_t leaf_index = 30;
551 std::vector<FF> sibling_path = { 10, 2, 30, 4, 50, 6 };
552 FF root = unconstrained_root_from_path(DOM_SEP__MERKLE_HASH, leaf_value, leaf_index, sibling_path);
553 merkle_check_sim.assert_membership(DOM_SEP__MERKLE_HASH, leaf_value, leaf_index, sibling_path, root);
554
556 merkle_check_builder.process(merkle_event_emitter.dump_events(), trace);
557
558 check_interaction<MerkleCheckTraceBuilder,
561
562 check_relation<merkle_check>(trace);
563
564 // Negative test - now corrupt the trace and verify it fails
565 trace.set(Column::merkle_check_read_output_hash, static_cast<uint32_t>(sibling_path.size()), 66);
566
568 (check_interaction<MerkleCheckTraceBuilder, lookup_merkle_check_merkle_poseidon2_read_settings>(trace)),
569 "Failed.*LOOKUP_MERKLE_CHECK_MERKLE_POSEIDON2.* Could not find tuple in destination");
570 check_interaction<MerkleCheckTraceBuilder, lookup_merkle_check_merkle_poseidon2_write_settings>(trace);
571}
572
573TEST_F(MerkleCheckPoseidon2Test, WriteWithInteractions)
574{
575 EventEmitter<MerkleCheckEvent> merkle_event_emitter;
576 MerkleCheck merkle_check_sim(poseidon2, merkle_event_emitter);
577
578 TestTraceContainer trace({ { { C::precomputed_first_row, 1 } } });
579 Poseidon2TraceBuilder poseidon2_builder;
580 MerkleCheckTraceBuilder merkle_check_builder;
581
582 FF leaf_value = 333;
583 FF new_leaf_value = 444;
584 uint64_t leaf_index = 30;
585 std::vector<FF> sibling_path = { 10, 2, 30, 4, 50, 6 };
586 FF root = unconstrained_root_from_path(DOM_SEP__MERKLE_HASH, leaf_value, leaf_index, sibling_path);
587 FF expected_new_root = unconstrained_root_from_path(DOM_SEP__MERKLE_HASH, new_leaf_value, leaf_index, sibling_path);
588
589 FF new_root =
590 merkle_check_sim.write(DOM_SEP__MERKLE_HASH, leaf_value, new_leaf_value, leaf_index, sibling_path, root);
591
592 EXPECT_EQ(new_root, expected_new_root);
593
595 merkle_check_builder.process(merkle_event_emitter.dump_events(), trace);
596
597 check_interaction<MerkleCheckTraceBuilder,
600
601 check_relation<merkle_check>(trace);
602
603 // Negative test - now corrupt the trace and verify it fails
604 trace.set(Column::merkle_check_read_output_hash, static_cast<uint32_t>(sibling_path.size()), 66);
605 trace.set(Column::merkle_check_write_output_hash, static_cast<uint32_t>(sibling_path.size()), 77);
606
608 (check_interaction<MerkleCheckTraceBuilder, lookup_merkle_check_merkle_poseidon2_read_settings>(trace)),
609 "Failed.*LOOKUP_MERKLE_CHECK_MERKLE_POSEIDON2.* Could not find tuple in destination");
610
612 (check_interaction<MerkleCheckTraceBuilder, lookup_merkle_check_merkle_poseidon2_write_settings>(trace)),
613 "Failed.*LOOKUP_MERKLE_CHECK_MERKLE_POSEIDON2_WRITE.* Could not find tuple in "
614 "destination");
615}
616
617TEST_F(MerkleCheckPoseidon2Test, MultipleWithTracegen)
618{
619 TestTraceContainer trace({
620 { { C::precomputed_first_row, 1 } },
621 });
622 MerkleCheckTraceBuilder builder;
623
624 FF leaf_value = 333;
625 uint64_t leaf_index = 30;
626 std::vector<FF> sibling_path = { 10, 2, 30, 4, 50, 6 };
627 FF root = unconstrained_root_from_path(DOM_SEP__MERKLE_HASH, leaf_value, leaf_index, sibling_path);
628 MerkleCheckEvent event = { .merkle_hash_domain_separator = DOM_SEP__MERKLE_HASH,
629 .leaf_value = leaf_value,
630 .leaf_index = leaf_index,
631 .sibling_path = sibling_path,
632 .root = root };
633
634 FF leaf_value2 = 444;
635 FF new_leaf_value2 = 555;
636 uint64_t leaf_index2 = 40;
637 std::vector<FF> sibling_path2 = { 11, 22, 33, 44, 55, 66 };
638 FF root2 = unconstrained_root_from_path(DOM_SEP__MERKLE_HASH, leaf_value2, leaf_index2, sibling_path2);
639 FF new_root2 = unconstrained_root_from_path(DOM_SEP__MERKLE_HASH, new_leaf_value2, leaf_index2, sibling_path2);
640 MerkleCheckEvent event2 = { .merkle_hash_domain_separator = DOM_SEP__MERKLE_HASH,
641 .leaf_value = leaf_value2,
642 .new_leaf_value = new_leaf_value2,
643 .leaf_index = leaf_index2,
644 .sibling_path = sibling_path2,
645 .root = root2,
646 .new_root = new_root2 };
647
648 builder.process({ event, event2 }, trace);
649
650 // Empty row after last real merkle row
651 uint32_t after_last_row_index = 1 + static_cast<uint32_t>(sibling_path.size() + sibling_path2.size());
652 trace.set(Column::merkle_check_sel, after_last_row_index, 0);
653 trace.set(Column::merkle_check_write, after_last_row_index, 0);
654 trace.set(Column::merkle_check_read_node, after_last_row_index, 0);
655 trace.set(Column::merkle_check_write_node, after_last_row_index, 0);
656 trace.set(Column::merkle_check_index, after_last_row_index, 0);
657 trace.set(Column::merkle_check_path_len, after_last_row_index, 0);
658 trace.set(Column::merkle_check_path_len_min_one_inv, after_last_row_index, 0);
659 trace.set(Column::merkle_check_read_root, after_last_row_index, 0);
660 trace.set(Column::merkle_check_write_root, after_last_row_index, 0);
661 trace.set(Column::merkle_check_sibling, after_last_row_index, 0);
662 trace.set(Column::merkle_check_start, after_last_row_index, 0);
663 trace.set(Column::merkle_check_end, after_last_row_index, 0);
664 trace.set(Column::merkle_check_index_is_even, after_last_row_index, 0);
665 trace.set(Column::merkle_check_read_left_node, after_last_row_index, 0);
666 trace.set(Column::merkle_check_read_right_node, after_last_row_index, 0);
667 trace.set(Column::merkle_check_write_left_node, after_last_row_index, 0);
668 trace.set(Column::merkle_check_write_right_node, after_last_row_index, 0);
669 trace.set(Column::merkle_check_read_output_hash, after_last_row_index, 0);
670 trace.set(Column::merkle_check_write_output_hash, after_last_row_index, 0);
671
672 check_relation<merkle_check>(trace);
673}
674
675TEST_F(MerkleCheckPoseidon2Test, MultipleWithInteractions)
676{
677 EventEmitter<MerkleCheckEvent> merkle_event_emitter;
678 MerkleCheck merkle_check_sim(poseidon2, merkle_event_emitter);
679
680 TestTraceContainer trace({ { { C::precomputed_first_row, 1 } } });
681 MerkleCheckTraceBuilder merkle_check_builder;
682 Poseidon2TraceBuilder poseidon2_builder;
683
684 FF leaf_value = 333;
685 uint64_t leaf_index = 30;
686 std::vector<FF> sibling_path = { 10, 2, 30, 4, 50, 6 };
687 FF root = unconstrained_root_from_path(DOM_SEP__MERKLE_HASH, leaf_value, leaf_index, sibling_path);
688
689 merkle_check_sim.assert_membership(DOM_SEP__MERKLE_HASH, leaf_value, leaf_index, sibling_path, root);
690
691 FF leaf_value2 = 444;
692 FF new_leaf_value2 = 555;
693 uint64_t leaf_index2 = 40;
694 std::vector<FF> sibling_path2 = { 11, 22, 33, 44, 55, 66 };
695 FF root2 = unconstrained_root_from_path(DOM_SEP__MERKLE_HASH, leaf_value2, leaf_index2, sibling_path2);
696 FF expected_new_root2 =
697 unconstrained_root_from_path(DOM_SEP__MERKLE_HASH, new_leaf_value2, leaf_index2, sibling_path2);
698
699 FF new_root2 =
700 merkle_check_sim.write(DOM_SEP__MERKLE_HASH, leaf_value2, new_leaf_value2, leaf_index2, sibling_path2, root2);
701 EXPECT_EQ(new_root2, expected_new_root2);
702
704 merkle_check_builder.process(merkle_event_emitter.dump_events(), trace);
705
706 check_interaction<MerkleCheckTraceBuilder,
709
710 check_relation<merkle_check>(trace);
711}
712
713} // namespace
714} // namespace bb::avm2::constraining
#define EXPECT_THROW_WITH_MESSAGE(code, expectedMessageRegex)
Definition assert.hpp:224
StrictMock< MockGreaterThan > mock_gt
EventEmitter< Poseidon2PermutationMemoryEvent > perm_mem_event_emitter
EventEmitter< Poseidon2PermutationEvent > perm_event_emitter
EventEmitter< Poseidon2HashEvent > hash_event_emitter
Poseidon2TraceBuilder poseidon2_builder
MerkleCheck merkle_check
static std::string get_subrelation_label(size_t index)
static constexpr size_t SR_READ_RIGHT_NODE
static constexpr size_t SR_OUTPUT_HASH_IS_NEXT_ROWS_WRITE_NODE
static constexpr size_t SR_READ_LEFT_NODE
static constexpr size_t SR_PROPAGATE_READ_ROOT
static constexpr size_t SR_PROPAGATE_WRITE
static constexpr size_t SR_WRITE_RIGHT_NODE
static constexpr size_t SR_TRACE_CONTINUITY
static constexpr size_t SR_NEXT_INDEX_IS_HALVED
static constexpr size_t SR_PROPAGATE_WRITE_ROOT
static constexpr size_t SR_PATH_LEN_DECREMENTS
static constexpr size_t SR_WRITE_LEFT_NODE
static constexpr size_t SR_OUTPUT_HASH_IS_NEXT_ROWS_READ_NODE
static constexpr size_t SR_SEL_ON_START_OR_END
static constexpr size_t SR_END_IFF_REM_PATH_EMPTY
void process(const simulation::EventEmitterInterface< simulation::AluEvent >::Container &events, TraceContainer &trace)
Process the ALU events and populate the ALU relevant columns in the trace.
void process_hash(const simulation::EventEmitterInterface< simulation::Poseidon2HashEvent >::Container &hash_events, TraceContainer &trace)
Processes the hash events for the Poseidon2 hash function. It populates the columns for the poseidon2...
void set(Column col, uint32_t row, const FF &value, bool use_atomic_limbs=false)
Native Poseidon2 hash function implementation.
Definition poseidon2.hpp:22
AluTraceBuilder builder
Definition alu.test.cpp:124
ExecutionIdManager execution_id_manager
TestTraceContainer trace
TEST_F(AvmRecursiveTests, TwoLayerAvmRecursion)
A test of the Two Layer AVM recursive verifier.
void check_interaction(tracegen::TestTraceContainer &trace)
TEST(AvmFixedVKTests, FixedVKCommitments)
Test that the fixed VK commitments agree with the ones computed from precomputed columns.
FF unconstrained_root_from_path(uint64_t domain_separator, const FF &leaf_value, const uint64_t leaf_index, std::span< const FF > path)
Definition merkle.cpp:12
TestTraceContainer empty_trace()
Definition fixtures.cpp:156
lookup_settings< lookup_merkle_check_merkle_poseidon2_read_settings_ > lookup_merkle_check_merkle_poseidon2_read_settings
AvmFlavorSettings::FF FF
Definition field.hpp:10
lookup_settings< lookup_merkle_check_merkle_poseidon2_write_settings_ > lookup_merkle_check_merkle_poseidon2_write_settings
simulation::PublicDataTreeReadWriteEvent event