Barretenberg
The ZK-SNARK library at the core of Aztec
Loading...
Searching...
No Matches
written_public_data_slots_tree_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
31
32namespace bb::avm2::constraining {
33namespace {
34
35using ::testing::NiceMock;
36using ::testing::TestWithParam;
37
38using testing::TestMemoryTree;
39
41using simulation::DeduplicatingEventEmitter;
42using simulation::EventEmitter;
43using simulation::FieldGreaterThan;
44using simulation::FieldGreaterThanEvent;
45using simulation::MerkleCheck;
46using simulation::MerkleCheckEvent;
47using simulation::MockExecutionIdManager;
48using simulation::MockGreaterThan;
49using simulation::MockRangeCheck;
50using simulation::NoopEventEmitter;
51using simulation::Poseidon2;
52using simulation::Poseidon2HashEvent;
53using simulation::Poseidon2PermutationEvent;
54using simulation::Poseidon2PermutationMemoryEvent;
57using simulation::WrittenPublicDataSlotLeafValue;
59using simulation::WrittenPublicDataSlotsTreeCheck;
60using simulation::WrittenPublicDataSlotsTreeCheckEvent;
62
63using tracegen::FieldGreaterThanTraceBuilder;
64using tracegen::MerkleCheckTraceBuilder;
65using tracegen::Poseidon2TraceBuilder;
66using tracegen::TestTraceContainer;
67using tracegen::WrittenPublicDataSlotsTreeCheckTraceBuilder;
68
70using C = Column;
73
74class WrittenPublicDataSlotsTreeCheckConstrainingTest : public ::testing::Test {
75 protected:
76 WrittenPublicDataSlotsTreeCheckConstrainingTest() = default;
77
78 EventEmitter<Poseidon2HashEvent> hash_event_emitter;
79 // Interactions involve the poseidon2 hash, so the others can be noop
80 NoopEventEmitter<Poseidon2PermutationEvent> perm_event_emitter;
81 NoopEventEmitter<Poseidon2PermutationMemoryEvent> perm_mem_event_emitter;
82
83 NiceMock<MockGreaterThan> mock_gt;
84 NiceMock<MockExecutionIdManager> mock_execution_id_manager;
85
87 Poseidon2(mock_execution_id_manager, mock_gt, hash_event_emitter, perm_event_emitter, perm_mem_event_emitter);
88};
89
90TEST_F(WrittenPublicDataSlotsTreeCheckConstrainingTest, EmptyRow)
91{
92 check_relation<written_public_data_slots_tree_check>(testing::empty_trace());
93}
94
95struct TestParams {
98 bool exists;
100};
101
102std::vector<TestParams> positive_read_tests = {
103 // Exists = true, leaf pointers to infinity
104 TestParams{
105 .slot = 42,
106 .contract_address = 27,
107 .exists = true,
108 .pre_existing_leaves = { { WrittenPublicDataSlotLeafValue(unconstrained_compute_leaf_slot(27, 42)) } } },
109 // Exists = true, leaf points to higher value
110 TestParams{ .slot = 42,
111 .contract_address = 27,
112 .exists = true,
113 .pre_existing_leaves = { { WrittenPublicDataSlotLeafValue(unconstrained_compute_leaf_slot(27, 42)),
114 WrittenPublicDataSlotLeafValue(unconstrained_compute_leaf_slot(27, 42) +
115 FF(1)) } } },
116 // Exists = false, low leaf points to infinity
117 TestParams{ .slot = 42, .contract_address = 27, .exists = false, .pre_existing_leaves = { {} } },
118 // Exists = false, low leaf points to higher value
119 TestParams{
120 .slot = 42,
121 .contract_address = 27,
122 .exists = false,
123 .pre_existing_leaves = { { WrittenPublicDataSlotLeafValue(unconstrained_compute_leaf_slot(27, 42) + FF(1)) } } }
124};
125
126class WrittenPublicDataSlotsReadPositiveTests : public WrittenPublicDataSlotsTreeCheckConstrainingTest,
127 public ::testing::WithParamInterface<TestParams> {};
128
129TEST_P(WrittenPublicDataSlotsReadPositiveTests, Positive)
130{
131 const auto& param = GetParam();
132
133 EventEmitter<MerkleCheckEvent> merkle_event_emitter;
134 MerkleCheck merkle_check(poseidon2, merkle_event_emitter);
135
136 NiceMock<MockRangeCheck> range_check;
137
138 DeduplicatingEventEmitter<FieldGreaterThanEvent> field_gt_event_emitter;
139 FieldGreaterThan field_gt(range_check, field_gt_event_emitter);
140
141 EventEmitter<WrittenPublicDataSlotsTreeCheckEvent> written_public_data_slots_tree_check_event_emitter;
142
143 TestTraceContainer trace({ { { C::precomputed_first_row, 1 } } });
144
145 Poseidon2TraceBuilder poseidon2_builder;
146 MerkleCheckTraceBuilder merkle_check_builder;
147 FieldGreaterThanTraceBuilder field_gt_builder;
148 WrittenPublicDataSlotsTreeCheckTraceBuilder written_public_data_slots_tree_check_builder;
149
151 initial_state.insert_indexed_leaves(param.pre_existing_leaves);
152
153 WrittenPublicDataSlotsTreeCheck written_public_data_slots_tree_check_simulator(
154 poseidon2, merkle_check, field_gt, initial_state, written_public_data_slots_tree_check_event_emitter);
155
156 written_public_data_slots_tree_check_simulator.contains(param.contract_address, param.slot);
157
158 written_public_data_slots_tree_check_builder.process(
159 written_public_data_slots_tree_check_event_emitter.dump_events(), trace);
160 EXPECT_EQ(trace.get_num_rows(), 1);
161
163 merkle_check_builder.process(merkle_event_emitter.dump_events(), trace);
165
166 check_relation<written_public_data_slots_tree_check>(trace);
167 check_all_interactions<WrittenPublicDataSlotsTreeCheckTraceBuilder>(trace);
168}
169
170INSTANTIATE_TEST_SUITE_P(WrittenPublicDataSlotsTreeCheckConstrainingTest,
171 WrittenPublicDataSlotsReadPositiveTests,
172 ::testing::ValuesIn(positive_read_tests));
173
174TEST_F(WrittenPublicDataSlotsTreeCheckConstrainingTest, PositiveWriteAppend)
175{
176 EventEmitter<MerkleCheckEvent> merkle_event_emitter;
177 MerkleCheck merkle_check(poseidon2, merkle_event_emitter);
178
179 NiceMock<MockRangeCheck> range_check;
180
181 DeduplicatingEventEmitter<FieldGreaterThanEvent> field_gt_event_emitter;
182 FieldGreaterThan field_gt(range_check, field_gt_event_emitter);
183
184 EventEmitter<WrittenPublicDataSlotsTreeCheckEvent> written_public_data_slots_tree_check_event_emitter;
185
186 TestTraceContainer trace({ { { C::precomputed_first_row, 1 } } });
187
188 Poseidon2TraceBuilder poseidon2_builder;
189 MerkleCheckTraceBuilder merkle_check_builder;
190 FieldGreaterThanTraceBuilder field_gt_builder;
191 WrittenPublicDataSlotsTreeCheckTraceBuilder written_public_data_slots_tree_check_builder;
192
193 FF slot = 100;
195
197
198 WrittenPublicDataSlotsTreeCheck written_public_data_slots_tree_check_simulator(
199 poseidon2, merkle_check, field_gt, initial_state, written_public_data_slots_tree_check_event_emitter);
200
201 written_public_data_slots_tree_check_simulator.insert(contract_address, slot);
202
203 written_public_data_slots_tree_check_builder.process(
204 written_public_data_slots_tree_check_event_emitter.dump_events(), trace);
205
206 EXPECT_EQ(trace.get_num_rows(), 1);
207
209 merkle_check_builder.process(merkle_event_emitter.dump_events(), trace);
211
212 check_relation<written_public_data_slots_tree_check>(trace);
213 check_all_interactions<WrittenPublicDataSlotsTreeCheckTraceBuilder>(trace);
214}
215
216TEST_F(WrittenPublicDataSlotsTreeCheckConstrainingTest, PositiveWriteMembership)
217{
218 FF slot = 42;
221 auto low_leaf = WrittenPublicDataSlotsTreeLeafPreimage(WrittenPublicDataSlotLeafValue(leaf_slot), 0, 0);
222
223 EventEmitter<MerkleCheckEvent> merkle_event_emitter;
224 MerkleCheck merkle_check(poseidon2, merkle_event_emitter);
225
226 NiceMock<MockRangeCheck> range_check;
227
228 DeduplicatingEventEmitter<FieldGreaterThanEvent> field_gt_event_emitter;
229 FieldGreaterThan field_gt(range_check, field_gt_event_emitter);
230
231 EventEmitter<WrittenPublicDataSlotsTreeCheckEvent> written_public_data_slots_tree_check_event_emitter;
232
233 TestTraceContainer trace({ { { C::precomputed_first_row, 1 } } });
234
235 Poseidon2TraceBuilder poseidon2_builder;
236 MerkleCheckTraceBuilder merkle_check_builder;
237 FieldGreaterThanTraceBuilder field_gt_builder;
238 WrittenPublicDataSlotsTreeCheckTraceBuilder written_public_data_slots_tree_check_builder;
239
241 initial_state.insert_indexed_leaves({ { WrittenPublicDataSlotLeafValue(leaf_slot) } });
242
243 WrittenPublicDataSlotsTreeCheck written_public_data_slots_tree_check_simulator(
244 poseidon2, merkle_check, field_gt, initial_state, written_public_data_slots_tree_check_event_emitter);
245
246 written_public_data_slots_tree_check_simulator.insert(contract_address, slot);
247
248 written_public_data_slots_tree_check_builder.process(
249 written_public_data_slots_tree_check_event_emitter.dump_events(), trace);
250
251 EXPECT_EQ(trace.get_num_rows(), 1);
252
254 merkle_check_builder.process(merkle_event_emitter.dump_events(), trace);
256
257 check_relation<written_public_data_slots_tree_check>(trace);
258 check_all_interactions<WrittenPublicDataSlotsTreeCheckTraceBuilder>(trace);
259}
260
261TEST_F(WrittenPublicDataSlotsTreeCheckConstrainingTest, NegativeExistsFlagCheck)
262{
263 // Test constraint: sel * (SLOT_LOW_LEAF_SLOT_DIFF * (EXISTS * (1 - slot_low_leaf_slot_diff_inv)
264 // + slot_low_leaf_slot_diff_inv) - 1 + EXISTS) = 0
265 TestTraceContainer trace({
266 { { C::written_public_data_slots_tree_check_sel, 1 },
267 { C::written_public_data_slots_tree_check_leaf_slot, 27 },
268 { C::written_public_data_slots_tree_check_low_leaf_slot, 27 },
269 { C::written_public_data_slots_tree_check_slot_low_leaf_slot_diff_inv, 0 },
270 { C::written_public_data_slots_tree_check_leaf_not_exists, 0 } },
271 { { C::written_public_data_slots_tree_check_sel, 1 },
272 { C::written_public_data_slots_tree_check_leaf_slot, 28 },
273 { C::written_public_data_slots_tree_check_low_leaf_slot, 27 },
274 { C::written_public_data_slots_tree_check_slot_low_leaf_slot_diff_inv, FF(1).invert() },
275 { C::written_public_data_slots_tree_check_leaf_not_exists, 1 } },
276 });
277
278 check_relation<written_public_data_slots_tree_check>(trace, written_public_data_slots_tree_check::SR_EXISTS_CHECK);
279 trace.set(C::written_public_data_slots_tree_check_leaf_not_exists, 0, 1);
280
281 EXPECT_THROW_WITH_MESSAGE(check_relation<written_public_data_slots_tree_check>(
283 "EXISTS_CHECK");
284 trace.set(C::written_public_data_slots_tree_check_leaf_not_exists, 0, 0);
285 trace.set(C::written_public_data_slots_tree_check_leaf_not_exists, 1, 0);
286
287 EXPECT_THROW_WITH_MESSAGE(check_relation<written_public_data_slots_tree_check>(
289 "EXISTS_CHECK");
290}
291
292TEST_F(WrittenPublicDataSlotsTreeCheckConstrainingTest, NegativeNextSlotIsZero)
293{
294 // Test constraint: leaf_not_exists * (low_leaf_next_slot * (NEXT_SLOT_IS_ZERO * (1 - next_slot_inv)
295 // + next_slot_inv) - 1 + NEXT_SLOT_IS_ZERO) = 0
296 TestTraceContainer trace({
297 {
298 { C::written_public_data_slots_tree_check_leaf_not_exists, 1 },
299 { C::written_public_data_slots_tree_check_low_leaf_next_slot, 0 },
300 { C::written_public_data_slots_tree_check_next_slot_inv, 0 },
301 { C::written_public_data_slots_tree_check_next_slot_is_nonzero, 0 },
302 },
303 {
304 { C::written_public_data_slots_tree_check_leaf_not_exists, 1 },
305 { C::written_public_data_slots_tree_check_low_leaf_next_slot, 1 },
306 { C::written_public_data_slots_tree_check_next_slot_inv, FF(1).invert() },
307 { C::written_public_data_slots_tree_check_next_slot_is_nonzero, 1 },
308 },
309 });
310
311 check_relation<written_public_data_slots_tree_check>(
313
314 trace.set(C::written_public_data_slots_tree_check_next_slot_is_nonzero, 0, 1);
315
316 EXPECT_THROW_WITH_MESSAGE(check_relation<written_public_data_slots_tree_check>(
318 "NEXT_SLOT_IS_ZERO_CHECK");
319
320 trace.set(C::written_public_data_slots_tree_check_next_slot_is_nonzero, 0, 0);
321 trace.set(C::written_public_data_slots_tree_check_next_slot_is_nonzero, 1, 0);
322
323 EXPECT_THROW_WITH_MESSAGE(check_relation<written_public_data_slots_tree_check>(
325 "NEXT_SLOT_IS_ZERO_CHECK");
326}
327
328} // namespace
329} // namespace bb::avm2::constraining
INSTANTIATE_TEST_SUITE_P(AcirTests, AcirIntegrationSingleTest, testing::Values("a_1327_concrete_in_generic", "a_1_mul", "a_2_div", "a_3_add", "a_4_sub", "a_5_over", "a_6", "a_6_array", "a_7", "a_7_function", "aes128_encrypt", "arithmetic_binary_operations", "array_dynamic", "array_dynamic_blackbox_input", "array_dynamic_main_output", "array_dynamic_nested_blackbox_input", "array_eq", "array_if_cond_simple", "array_len", "array_neq", "array_sort", "array_to_slice", "array_to_slice_constant_length", "assert", "assert_statement", "assign_ex", "bigint", "bit_and", "bit_not", "bit_shifts_comptime", "bit_shifts_runtime", "blake3", "bool_not", "bool_or", "break_and_continue", "brillig_acir_as_brillig", "brillig_array_eq", "brillig_array_to_slice", "brillig_arrays", "brillig_assert", "brillig_bit_shifts_runtime", "brillig_blake2s", "brillig_blake3", "brillig_calls", "brillig_calls_array", "brillig_calls_conditionals", "brillig_conditional", "brillig_cow", "brillig_cow_assign", "brillig_cow_regression", "brillig_ecdsa_secp256k1", "brillig_ecdsa_secp256r1", "brillig_embedded_curve", "brillig_fns_as_values", "brillig_hash_to_field", "brillig_identity_function", "brillig_keccak", "brillig_loop", "brillig_nested_arrays", "brillig_not", "brillig_oracle", "brillig_pedersen", "brillig_recursion", "brillig_references", "brillig_schnorr", "brillig_sha256", "brillig_signed_cmp", "brillig_signed_div", "brillig_slices", "brillig_to_be_bytes", "brillig_to_bits", "brillig_to_bytes_integration", "brillig_to_le_bytes", "brillig_top_level", "brillig_uninitialized_arrays", "brillig_wrapping", "cast_bool", "closures_mut_ref", "conditional_1", "conditional_2", "conditional_regression_421", "conditional_regression_547", "conditional_regression_661", "conditional_regression_short_circuit", "conditional_regression_underflow", "custom_entry", "databus", "debug_logs", "diamond_deps_0", "double_verify_nested_proof", "double_verify_proof", "ecdsa_secp256k1", "ecdsa_secp256r1", "ecdsa_secp256r1_3x", "eddsa", "embedded_curve_ops", "field_attribute", "generics", "global_consts", "hash_to_field", "hashmap", "higher_order_functions", "if_else_chain", "import", "inline_never_basic", "integer_array_indexing", "keccak256", "main_bool_arg", "main_return", "merkle_insert", "missing_closure_env", "modules", "modules_more", "modulus", "nested_array_dynamic", "nested_array_dynamic_simple", "nested_array_in_slice", "nested_arrays_from_brillig", "no_predicates_basic", "no_predicates_brillig", "no_predicates_numeric_generic_poseidon", "operator_overloading", "pedersen_check", "pedersen_commitment", "pedersen_hash", "poseidon_bn254_hash", "poseidonsponge_x5_254", "pred_eq", "prelude", "references", "regression", "regression_2660", "regression_3051", "regression_3394", "regression_3607", "regression_3889", "regression_4088", "regression_4124", "regression_4202", "regression_4449", "regression_4709", "regression_5045", "regression_capacity_tracker", "regression_mem_op_predicate", "regression_method_cannot_be_found", "regression_struct_array_conditional", "schnorr", "sha256", "sha2_byte", "side_effects_constrain_array", "signed_arithmetic", "signed_comparison", "signed_division", "simple_2d_array", "simple_add_and_ret_arr", "simple_array_param", "simple_bitwise", "simple_comparison", "simple_mut", "simple_not", "simple_print", "simple_program_addition", "simple_radix", "simple_shield", "simple_shift_left_right", "slice_coercion", "slice_dynamic_index", "slice_loop", "slices", "strings", "struct", "struct_array_inputs", "struct_fields_ordering", "struct_inputs", "submodules", "to_be_bytes", "to_bytes_consistent", "to_bytes_integration", "to_le_bytes", "trait_as_return_type", "trait_impl_base_type", "traits_in_crates_1", "traits_in_crates_2", "tuple_inputs", "tuples", "type_aliases", "u128", "u16_support", "unconstrained_empty", "unit_value", "unsafe_range_constraint", "witness_compression", "xor"))
TEST_P(AcirIntegrationSingleTest, DISABLED_ProveAndVerifyProgram)
StrictMock< MockGreaterThan > mock_gt
EventEmitter< Poseidon2PermutationMemoryEvent > perm_mem_event_emitter
EventEmitter< Poseidon2PermutationEvent > perm_event_emitter
EventEmitter< Poseidon2HashEvent > hash_event_emitter
Poseidon2TraceBuilder poseidon2_builder
StrictMock< MockExecutionIdManager > mock_execution_id_manager
void process(const simulation::EventEmitterInterface< simulation::FieldGreaterThanEvent >::Container &events, TraceContainer &trace)
void process_hash(const simulation::EventEmitterInterface< simulation::Poseidon2HashEvent >::Container &hash_events, TraceContainer &trace)
void set(Column col, uint32_t row, const FF &value)
Implements a parallelized batch insertion indexed tree Accepts template argument of the type of store...
FieldGreaterThanTraceBuilder field_gt_builder
Definition alu.test.cpp:121
RangeCheck range_check
TestTraceContainer trace
NullifierTreeLeafPreimage low_leaf
std::vector< ClassIdLeafValue > pre_existing_leaves
#define EXPECT_THROW_WITH_MESSAGE(code, expectedMessage)
Definition macros.hpp:7
TEST_F(AvmRecursiveTests, GoblinRecursion)
A test of the Goblinized AVM recursive verifier.
IndexedLeaf< WrittenPublicDataSlotLeafValue > WrittenPublicDataSlotsTreeLeafPreimage
FF unconstrained_root_from_path(const FF &leaf_value, const uint64_t leaf_index, std::span< const FF > path)
Definition merkle.cpp:12
WrittenPublicDataSlotsTree build_public_data_slots_tree()
FF unconstrained_compute_leaf_slot(const AztecAddress &contract_address, const FF &slot)
Definition merkle.cpp:26
IndexedMemoryTree< WrittenPublicDataSlotLeafValue, Poseidon2HashPolicy > WrittenPublicDataSlotsTree
TestTraceContainer empty_trace()
Definition fixtures.cpp:153
AvmFlavorSettings::FF FF
Definition field.hpp:10
typename Flavor::FF FF
constexpr decltype(auto) get(::tuplet::tuple< T... > &&t) noexcept
Definition tuple.hpp:13
FieldGreaterThan field_gt
NoopEventEmitter< FieldGreaterThanEvent > field_gt_event_emitter
NiceMock< MockWrittenPublicDataSlotsTreeCheck > written_public_data_slots_tree_check