Barretenberg
The ZK-SNARK library at the core of Aztec
Loading...
Searching...
No Matches
indexed_tree_check_trace.test.cpp
Go to the documentation of this file.
2
3#include <cstdint>
4#include <gmock/gmock.h>
5#include <gtest/gtest.h>
6
27
28namespace bb::avm2::tracegen {
29namespace {
30
31using ::testing::NiceMock;
32
33using testing::TestMemoryTree;
34
35using simulation::DeduplicatingEventEmitter;
36using simulation::EventEmitter;
37using simulation::ExecutionIdManager;
38using simulation::FieldGreaterThan;
39using simulation::FieldGreaterThanEvent;
40using simulation::IndexedTreeCheck;
42using simulation::IndexedTreeLeafData;
43using simulation::IndexedTreeSiloingParameters;
44using simulation::MerkleCheck;
45using simulation::MerkleCheckEvent;
46using simulation::MockGreaterThan;
47using simulation::MockRangeCheck;
48using simulation::Poseidon2;
49using simulation::Poseidon2HashEvent;
50using simulation::Poseidon2PermutationEvent;
51using simulation::Poseidon2PermutationMemoryEvent;
53
55
57using C = Column;
59
60constexpr size_t TREE_HEIGHT = 8;
61
62class IndexedTreeCheckTracegenTest : public ::testing::Test {
63 protected:
64 IndexedTreeCheckTracegenTest()
66
67 EventEmitter<Poseidon2HashEvent> hash_event_emitter;
68 EventEmitter<Poseidon2PermutationEvent> perm_event_emitter;
69 EventEmitter<Poseidon2PermutationMemoryEvent> perm_mem_event_emitter;
70
71 ExecutionIdManager execution_id_manager;
72 NiceMock<MockGreaterThan> mock_gt;
74 Poseidon2(execution_id_manager, mock_gt, hash_event_emitter, perm_event_emitter, perm_mem_event_emitter);
75};
76
77struct TestParams {
79 bool exists;
80 IndexedTreeLeafData low_leaf;
81};
82
83std::vector<TestParams> positive_read_tests = {
84 // Exists = true, leaf points to infinity
85 TestParams{ .value = 42, .exists = true, .low_leaf = { .value = 42, .next_value = 0, .next_index = 0 } },
86 // Exists = true, leaf points to higher value
87 TestParams{ .value = 42, .exists = true, .low_leaf = { .value = 42, .next_value = 50, .next_index = 28 } },
88 // Exists = false, low leaf points to infinity
89 TestParams{ .value = 42, .exists = false, .low_leaf = { .value = 10, .next_value = 0, .next_index = 0 } },
90 // Exists = false, low leaf points to higher value
91 TestParams{ .value = 42, .exists = false, .low_leaf = { .value = 10, .next_value = 50, .next_index = 28 } }
92};
93
94class ReadInteractionsTests : public IndexedTreeCheckTracegenTest, public ::testing::WithParamInterface<TestParams> {};
95
96TEST_P(ReadInteractionsTests, PositiveWithInteractions)
97{
98 const auto& param = GetParam();
99
100 EventEmitter<MerkleCheckEvent> merkle_event_emitter;
101 MerkleCheck merkle_check(poseidon2, merkle_event_emitter);
102
103 NiceMock<MockRangeCheck> range_check;
104
105 DeduplicatingEventEmitter<FieldGreaterThanEvent> field_gt_event_emitter;
106 FieldGreaterThan field_gt(range_check, field_gt_event_emitter);
107
108 EventEmitter<IndexedTreeCheckEvent> indexed_tree_check_event_emitter;
110
111 TestTraceContainer trace({ { { C::precomputed_first_row, 1 } } });
112 Poseidon2TraceBuilder poseidon2_builder;
113 MerkleCheckTraceBuilder merkle_check_builder;
114 FieldGreaterThanTraceBuilder field_gt_builder;
115 IndexedTreeCheckTraceBuilder indexed_tree_check_builder;
116
117 FF low_leaf_hash = poseidon2.hash(param.low_leaf.get_hash_inputs());
118 uint64_t leaf_index = 30;
119 std::vector<FF> sibling_path;
120 sibling_path.reserve(TREE_HEIGHT);
121 for (size_t i = 0; i < TREE_HEIGHT; ++i) {
122 sibling_path.emplace_back(i);
123 }
124 FF root = unconstrained_root_from_path(low_leaf_hash, leaf_index, sibling_path);
125
126 indexed_tree_check.assert_read(param.value,
128 param.exists,
129 param.low_leaf,
130 leaf_index,
131 sibling_path,
132 AppendOnlyTreeSnapshot{ .root = root });
133
135 merkle_check_builder.process(merkle_event_emitter.dump_events(), trace);
136 field_gt_builder.process(field_gt_event_emitter.dump_events(), trace);
138
139 check_interaction<IndexedTreeCheckTraceBuilder,
148}
149
150INSTANTIATE_TEST_SUITE_P(IndexedTreeCheckTracegenTest, ReadInteractionsTests, ::testing::ValuesIn(positive_read_tests));
151
152TEST_F(IndexedTreeCheckTracegenTest, WriteWithInteractions)
153{
154 EventEmitter<MerkleCheckEvent> merkle_event_emitter;
155 MerkleCheck merkle_check(poseidon2, merkle_event_emitter);
156
157 NiceMock<MockRangeCheck> range_check;
158
159 DeduplicatingEventEmitter<FieldGreaterThanEvent> field_gt_event_emitter;
160 FieldGreaterThan field_gt(range_check, field_gt_event_emitter);
161
162 EventEmitter<IndexedTreeCheckEvent> indexed_tree_check_event_emitter;
164
165 TestTraceContainer trace({ { { C::precomputed_first_row, 1 } } });
166 Poseidon2TraceBuilder poseidon2_builder;
167 MerkleCheckTraceBuilder merkle_check_builder;
168 FieldGreaterThanTraceBuilder field_gt_builder;
169 IndexedTreeCheckTraceBuilder indexed_tree_check_builder;
170
171 AztecAddress contract_address = AztecAddress(1);
172 FF value = 100;
173 FF siloing_separator = 42;
174 FF siloed_value = RawPoseidon2::hash({ siloing_separator, contract_address, value });
175 FF low_value = 40;
176 TestMemoryTree<Poseidon2HashPolicy> tree(8, TREE_HEIGHT);
177
178 IndexedTreeLeafData low_leaf = { .value = low_value, .next_value = siloed_value + 1, .next_index = 10 };
179 FF low_leaf_hash = RawPoseidon2::hash(low_leaf.get_hash_inputs());
180 uint64_t low_leaf_index = 0;
181 tree.update_element(low_leaf_index, low_leaf_hash);
182
183 AppendOnlyTreeSnapshot prev_snapshot =
184 AppendOnlyTreeSnapshot{ .root = tree.root(), .next_available_leaf_index = 128 };
185 std::vector<FF> low_leaf_sibling_path = tree.get_sibling_path(low_leaf_index);
186
187 IndexedTreeLeafData updated_low_leaf = low_leaf;
188 updated_low_leaf.next_index = prev_snapshot.next_available_leaf_index;
189 updated_low_leaf.next_value = siloed_value;
190 FF updated_low_leaf_hash = RawPoseidon2::hash(updated_low_leaf.get_hash_inputs());
191 tree.update_element(low_leaf_index, updated_low_leaf_hash);
192
193 std::vector<FF> insertion_sibling_path = tree.get_sibling_path(prev_snapshot.next_available_leaf_index);
194
195 IndexedTreeLeafData new_leaf = { .value = siloed_value,
196 .next_value = low_leaf.next_value,
197 .next_index = low_leaf.next_index };
198 FF new_leaf_hash = RawPoseidon2::hash(new_leaf.get_hash_inputs());
199 tree.update_element(prev_snapshot.next_available_leaf_index, new_leaf_hash);
200
201 IndexedTreeSiloingParameters siloing_params = {
202 .address = contract_address,
203 .siloing_separator = siloing_separator,
204 };
205
207 siloing_params,
208 0,
209 low_leaf,
210 low_leaf_index,
211 low_leaf_sibling_path,
212 prev_snapshot,
213 insertion_sibling_path);
214
216 merkle_check_builder.process(merkle_event_emitter.dump_events(), trace);
217 field_gt_builder.process(field_gt_event_emitter.dump_events(), trace);
219
220 // Not checking all interactions due to the public inputs interaction, which needs to be checked in an e2e test
221 check_interaction<IndexedTreeCheckTraceBuilder,
230}
231
232} // namespace
233} // namespace bb::avm2::tracegen
StrictMock< MockGreaterThan > mock_gt
EventEmitter< Poseidon2PermutationMemoryEvent > perm_mem_event_emitter
EventEmitter< Poseidon2PermutationEvent > perm_event_emitter
EventEmitter< Poseidon2HashEvent > hash_event_emitter
Poseidon2TraceBuilder poseidon2_builder
FieldGreaterThan field_gt
IndexedTreeCheckTraceBuilder indexed_tree_check_builder
MerkleCheck merkle_check
IndexedTreeCheck indexed_tree_check
EventEmitter< simulation::IndexedTreeCheckEvent > indexed_tree_check_event_emitter
RangeCheck range_check
void process(const simulation::EventEmitterInterface< simulation::FieldGreaterThanEvent >::Container &events, TraceContainer &trace)
Processes FieldGreaterThanEvent events and generates trace rows for the ff_gt gadget.
void process(const simulation::EventEmitterInterface< simulation::IndexedTreeCheckEvent >::Container &events, TraceContainer &trace)
Process generic indexed tree check events and populate the 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...
static FF hash(const std::vector< FF > &input)
Hashes a vector of field elements.
FieldGreaterThanTraceBuilder field_gt_builder
Definition alu.test.cpp:122
ExecutionIdManager execution_id_manager
TestTraceContainer trace
IndexedTreeLeafData low_leaf
TEST_P(AvmRecursiveTestsParameterized, TwoLayerAvmRecursion)
A test of the Two Layer AVM recursive verifier.
INSTANTIATE_TEST_SUITE_P(PaddingVariants, AvmRecursiveTestsParameterized, ::testing::Values(false, true), [](const auto &info) { return info.param ? "Padded" :"Unpadded";})
void check_interaction(tracegen::TestTraceContainer &trace)
FF unconstrained_root_from_path(const FF &leaf_value, const uint64_t leaf_index, std::span< const FF > path)
Definition merkle.cpp:12
std::variant< IndexedTreeReadWriteEvent, CheckPointEventType > IndexedTreeCheckEvent
crypto::Poseidon2< crypto::Poseidon2Bn254ScalarFieldParams > Poseidon2
lookup_settings< lookup_indexed_tree_check_silo_poseidon2_settings_ > lookup_indexed_tree_check_silo_poseidon2_settings
lookup_settings< lookup_indexed_tree_check_low_leaf_value_validation_settings_ > lookup_indexed_tree_check_low_leaf_value_validation_settings
lookup_settings< lookup_indexed_tree_check_low_leaf_poseidon2_settings_ > lookup_indexed_tree_check_low_leaf_poseidon2_settings
lookup_settings< lookup_indexed_tree_check_updated_low_leaf_poseidon2_settings_ > lookup_indexed_tree_check_updated_low_leaf_poseidon2_settings
lookup_settings< lookup_indexed_tree_check_low_leaf_next_value_validation_settings_ > lookup_indexed_tree_check_low_leaf_next_value_validation_settings
lookup_settings< lookup_indexed_tree_check_low_leaf_merkle_check_settings_ > lookup_indexed_tree_check_low_leaf_merkle_check_settings
lookup_settings< lookup_indexed_tree_check_new_leaf_poseidon2_settings_ > lookup_indexed_tree_check_new_leaf_poseidon2_settings
lookup_settings< lookup_indexed_tree_check_new_leaf_merkle_check_settings_ > lookup_indexed_tree_check_new_leaf_merkle_check_settings
TEST_F(IPATest, ChallengesAreZero)
Definition ipa.test.cpp:155
constexpr decltype(auto) get(::tuplet::tuple< T... > &&t) noexcept
Definition tuple.hpp:13
NoopEventEmitter< FieldGreaterThanEvent > field_gt_event_emitter