14#include <gmock/gmock.h>
15#include <gtest/gtest.h>
22using ::testing::ElementsAre;
23using ::testing::NiceMock;
24using ::testing::Return;
25using ::testing::ReturnRef;
26using ::testing::SizeIs;
27using ::testing::StrictMock;
28using ::testing::TestWithParam;
34TEST(AvmSimulationUpdateCheck, NeverWritten)
36 uint64_t current_timestamp = 100;
47 NiceMock<MockHighLevelMerkleDB>
merkle_db;
48 StrictMock<MockLowLevelMerkleDB> low_level_merkle_db;
59 .WillRepeatedly(Return(
FF(0)));
60 EXPECT_CALL(
merkle_db, get_tree_state()).WillRepeatedly(Return(tree_states));
63 update_check.check_current_class_id(derived_address, instance);
71 .current_timestamp = current_timestamp,
73 .update_preimage_metadata = 0,
74 .update_preimage_pre_class_id = 0,
75 .update_preimage_post_class_id = 0,
76 .delayed_public_mutable_slot = delayed_public_mutable_slot,
82 "Current class id.*does not match expected class id.*");
97 .original_class_id = 27,
98 .current_class_id = 27,
99 .should_throw =
false },
102 .original_class_id = 27,
103 .current_class_id = 28,
104 .should_throw =
true },
105 TestParams{ .original_class_id = 27,
106 .current_class_id = 2,
107 .update_pre_class = 2,
108 .update_post_class = 3,
109 .update_timestamp_of_change = 101,
110 .should_throw =
false },
111 TestParams{ .original_class_id = 27,
112 .current_class_id = 2,
113 .update_pre_class = 2,
114 .update_post_class = 3,
115 .update_timestamp_of_change = 99,
116 .should_throw =
true },
117 TestParams{ .original_class_id = 27,
118 .current_class_id = 3,
119 .update_pre_class = 2,
120 .update_post_class = 3,
121 .update_timestamp_of_change = 99,
122 .should_throw =
false },
123 TestParams{ .original_class_id = 27,
124 .current_class_id = 3,
125 .update_pre_class = 2,
126 .update_post_class = 3,
127 .update_timestamp_of_change = 101,
128 .should_throw =
true },
129 TestParams{ .original_class_id = 27,
130 .current_class_id = 3,
131 .update_pre_class = 2,
132 .update_post_class = 3,
133 .update_timestamp_of_change = 100,
134 .should_throw =
false },
135 TestParams{ .original_class_id = 27,
136 .current_class_id = 2,
137 .update_pre_class = 2,
138 .update_post_class = 3,
139 .update_timestamp_of_change = 100,
140 .should_throw =
true },
141 TestParams{ .original_class_id = 1,
142 .current_class_id = 1,
143 .update_pre_class = 0,
144 .update_post_class = 3,
145 .update_timestamp_of_change = 101,
146 .should_throw =
false },
147 TestParams{ .original_class_id = 1,
148 .current_class_id = 3,
149 .update_pre_class = 0,
150 .update_post_class = 3,
151 .update_timestamp_of_change = 101,
152 .should_throw =
true },
155class UpdateCheckHashNonzeroTest :
public TestWithParam<TestParams> {};
157TEST_P(UpdateCheckHashNonzeroTest, WithHash)
159 const auto& param = GetParam();
161 uint64_t current_timestamp = 100;
163 instance.current_class_id = param.current_class_id;
164 instance.original_class_id = param.original_class_id;
171 delayed_public_mutable_hash_slot });
173 FF update_metadata =
FF(
static_cast<uint64_t
>(123) << 32) + param.update_timestamp_of_change;
174 std::vector<FF> update_preimage = { update_metadata, param.update_pre_class, param.update_post_class };
175 std::vector<FF> update_preimage_slots;
177 for (
size_t i = 0; i < update_preimage.size(); ++i) {
180 delayed_public_mutable_slot + i });
181 update_preimage_slots.push_back(leaf_slot);
186 TreeStates tree_states = {};
187 tree_states.publicDataTree.tree.root = 42;
190 NiceMock<MockHighLevelMerkleDB>
merkle_db;
191 NiceMock<MockLowLevelMerkleDB> mock_low_level_merkle_db;
200 GlobalVariables globals{ .timestamp = current_timestamp };
206 .WillRepeatedly(Return(update_hash));
207 EXPECT_CALL(
merkle_db, get_tree_state()).WillRepeatedly(Return(tree_states));
208 EXPECT_CALL(
merkle_db, as_unconstrained()).WillRepeatedly(ReturnRef(mock_low_level_merkle_db));
212 for (
size_t i = 0; i < update_preimage_slots.size(); ++i) {
213 if (leaf_slot == update_preimage_slots[i]) {
217 throw std::runtime_error(
"Leaf not found");
220 EXPECT_CALL(mock_low_level_merkle_db, get_leaf_preimage_public_data_tree(_))
221 .WillRepeatedly([&](
const uint64_t& index) {
228 EXPECT_CALL(range_check, assert_range(_, _)).WillRepeatedly([](
const uint128_t&
value,
const uint8_t& range) {
230 throw std::runtime_error(
"Range checks aren't supported for bit-sizes > 128");
236 throw std::runtime_error(
"Value is out of range");
240 if (param.should_throw) {
242 "Current class id.*does not match expected class id.*");
245 update_check.check_current_class_id(derived_address, instance);
247 ElementsAre(UpdateCheckEvent{
248 .address = derived_address,
249 .current_class_id = instance.current_class_id,
250 .original_class_id = instance.original_class_id,
251 .public_data_tree_root = tree_states.publicDataTree.tree.root,
252 .current_timestamp = current_timestamp,
253 .update_hash = update_hash,
254 .update_preimage_metadata = update_metadata,
255 .update_preimage_pre_class_id = param.update_pre_class,
256 .update_preimage_post_class_id = param.update_post_class,
257 .delayed_public_mutable_slot = delayed_public_mutable_slot,
262INSTANTIATE_TEST_SUITE_P(AvmSimulationUpdateCheck, UpdateCheckHashNonzeroTest, ::testing::ValuesIn(hash_nonzero_tests));
264TEST(AvmSimulationUpdateCheck, HashMismatch)
266 uint64_t current_timestamp = 100;
268 instance.current_class_id = instance.original_class_id;
274 delayed_public_mutable_hash_slot });
276 TreeSnapshots trees = {};
279 NiceMock<MockHighLevelMerkleDB>
merkle_db;
280 NiceMock<MockLowLevelMerkleDB> mock_low_level_merkle_db;
285 GlobalVariables globals{ .timestamp = current_timestamp };
291 .WillRepeatedly(Return(
FF(27)));
292 EXPECT_CALL(mock_low_level_merkle_db, get_tree_roots()).WillRepeatedly(ReturnRef(trees));
293 EXPECT_CALL(
merkle_db, as_unconstrained()).WillRepeatedly(ReturnRef(mock_low_level_merkle_db));
300 EXPECT_CALL(mock_low_level_merkle_db, get_leaf_preimage_public_data_tree(_))
301 .WillRepeatedly([&](
const uint64_t& index) {
309 "Stored hash does not match preimage hash");
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)
#define GENERATOR_INDEX__PUBLIC_LEAF_INDEX
#define UPDATES_DELAYED_PUBLIC_MUTABLE_VALUES_LEN
#define UPDATED_CLASS_IDS_SLOT
#define CONTRACT_INSTANCE_REGISTRY_CONTRACT_ADDRESS
StrictMock< MockHighLevelMerkleDB > merkle_db
static FF hash(const std::vector< FF > &input)
Hashes a vector of field elements.
StrictMock< MockFieldGreaterThan > mock_field_gt
EventEmitter< DataCopyEvent > event_emitter
testing::StrictMock< MockGreaterThan > greater_than
#define EXPECT_THROW_WITH_MESSAGE(code, expectedMessage)
void hash(State &state) noexcept
crypto::Poseidon2< crypto::Poseidon2Bn254ScalarFieldParams > poseidon2
TEST(EmitUnencryptedLogTest, Basic)
IndexedLeaf< PublicDataLeafValue > PublicDataTreeLeafPreimage
::bb::crypto::merkle_tree::PublicDataLeafValue PublicDataLeafValue
FF compute_contract_address(const ContractInstance &contract_instance)
ContractInstance random_contract_instance()
constexpr decltype(auto) get(::tuplet::tuple< T... > &&t) noexcept
unsigned __int128 uint128_t
NoopEventEmitter< GreaterThanEvent > greater_than_event_emitter
NoopEventEmitter< FieldGreaterThanEvent > field_gt_event_emitter
FF update_timestamp_of_change
ContractClassId original_class_id
ContractClassId current_class_id
AppendOnlyTreeSnapshot tree