@aztec-labs/standard-contracts 6.0.0-rc.2 → 6.0.0-rc.4
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/artifacts/AuthRegistry.json +198 -170
- package/artifacts/HandshakeRegistry.json +592 -475
- package/artifacts/MultiCallEntrypoint.json +157 -129
- package/artifacts/PublicChecks.json +158 -104
- package/dest/handshake-registry/constants.d.ts +1 -1
- package/dest/handshake-registry/constants.d.ts.map +1 -1
- package/dest/handshake-registry/constants.js +1 -0
- package/dest/make_standard_contract.d.ts +1 -1
- package/dest/make_standard_contract.d.ts.map +1 -1
- package/dest/make_standard_contract.js +1 -0
- package/dest/standard_contract_data.js +16 -16
- package/package.json +5 -4
- package/src/handshake-registry/constants.ts +1 -0
- package/src/make_standard_contract.ts +1 -0
- package/src/standard_contract_data.ts +16 -16
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"file_map": {
|
|
3
|
-
"
|
|
3
|
+
"106": {
|
|
4
4
|
"function_locations": [
|
|
5
5
|
{
|
|
6
6
|
"name": "AztecConfig::new",
|
|
@@ -28,27 +28,27 @@
|
|
|
28
28
|
},
|
|
29
29
|
{
|
|
30
30
|
"name": "generate_offchain_receive",
|
|
31
|
-
"start":
|
|
31
|
+
"start": 11363
|
|
32
32
|
},
|
|
33
33
|
{
|
|
34
34
|
"name": "check_each_fn_macroified",
|
|
35
|
-
"start":
|
|
35
|
+
"start": 13024
|
|
36
36
|
}
|
|
37
37
|
],
|
|
38
|
-
"path": "/
|
|
39
|
-
"source": "mod compute_note_hash_and_nullifier;\n\nuse crate::{\n macros::{\n calls_generation::{\n external_functions::{generate_external_function_calls, generate_external_function_self_calls_structs},\n internal_functions::generate_call_internal_struct,\n },\n dispatch::generate_public_dispatch,\n emit_public_init_nullifier::generate_emit_public_init_nullifier,\n internals_functions_generation::{create_fn_abi_exports, process_functions},\n offchain_receive::{\n OFFCHAIN_RECEIVE_FN_NAME, OFFCHAIN_RECEIVE_PARAM_NAME, offchain_receive_param_type,\n OFFCHAIN_RECEIVE_RETURN_TYPE,\n },\n storage::STORAGE_LAYOUT_NAME,\n utils::{is_fn_contract_library_method, is_fn_external, is_fn_internal, is_fn_test, module_has_storage},\n },\n messages::discovery::{CustomMessageHandler, CustomSyncHandler},\n};\n\nuse compute_note_hash_and_nullifier::generate_contract_library_methods_compute_note_hash_and_nullifier;\n\n/// Configuration for the [`aztec`] macro.\n///\n/// This type lets users override different parts of the default aztec-nr contract behavior, such\n/// as message handling and state synchronization. These are advanced features that require careful\n/// understanding of the behavior of these systems.\n///\n/// ## Examples\n///\n/// ```noir\n/// #[aztec(aztec::macros::AztecConfig::new().custom_message_handler(my_handler))]\n/// contract MyContract { ... }\n/// ```\npub struct AztecConfig {\n custom_message_handler: Option<CustomMessageHandler>,\n custom_sync_state: Option<CustomSyncHandler>,\n}\n\nimpl AztecConfig {\n /// Creates a new `AztecConfig` with default values.\n ///\n /// Calling `new` is equivalent to invoking the [`aztec`] macro with no parameters. The different methods\n /// (e.g. [`AztecConfig::custom_message_handler`]) can then be used to change the default behavior.\n pub comptime fn new() -> Self {\n Self { custom_message_handler: Option::none(), custom_sync_state: Option::none() }\n }\n\n /// Sets a handler for custom messages.\n ///\n /// This enables contracts to process non-standard messages (i.e. any with a message type that is not in\n /// [`crate::messages::msg_type`]).\n ///\n /// `handler` must be a function that conforms to the\n /// [`crate::messages::discovery::CustomMessageHandler`] type signature.\n pub comptime fn custom_message_handler(&mut self, handler: CustomMessageHandler) -> Self {\n self.custom_message_handler = Option::some(handler);\n *self\n }\n\n /// Overrides the default state synchronization logic.\n ///\n /// The generated `sync_state` function will call `handler` instead of\n /// [`crate::messages::discovery::do_sync_state`]. The handler receives all of the same parameters, so it can\n /// run custom logic (e.g. fetching and decrypting custom logs) before, after, or instead of calling\n /// `do_sync_state`.\n ///\n /// `handler` must be a function that conforms to the\n /// [`crate::messages::discovery::CustomSyncHandler`] type signature.\n pub comptime fn custom_sync_state(&mut self, handler: CustomSyncHandler) -> Self {\n self.custom_sync_state = Option::some(handler);\n *self\n }\n}\n\n/// Enables aztec-nr features on a `contract`.\n///\n/// All aztec-nr contracts should have this macro invoked on them, as it is the one that processes all contract\n/// functions, notes, storage, generates interfaces for external calls, and creates the message processing\n/// boilerplate.\n///\n/// ## Examples\n///\n/// Most contracts can simply invoke the macro with no parameters, resulting in default aztec-nr behavior:\n/// ```noir\n/// #[aztec]\n/// contract MyContract { ... }\n/// ```\n///\n/// Advanced contracts can use [`AztecConfig`] to customize parts of its behavior, such as message\n/// processing.\n/// ```noir\n/// #[aztec(aztec::macros::AztecConfig::new().custom_message_handler(my_handler))]\n/// contract MyAdvancedContract { ... }\n/// ```\n#[varargs]\npub comptime fn aztec(m: Module, args: [AztecConfig]) -> Quoted {\n let num_args = args.len();\n let config = if num_args == 0 {\n AztecConfig::new()\n } else if num_args == 1 {\n args[0]\n } else {\n panic(f\"#[aztec] expects 0 or 1 arguments, got {num_args}\")\n };\n\n // Functions that don't have #[external(...)], #[contract_library_method], or #[test] are not allowed in contracts.\n check_each_fn_macroified(m);\n\n // We generate new functions prefixed with `__aztec_nr_internals__` and we replace the original functions' bodies\n // with `static_assert(false, ...)` to prevent them from being called directly from within the contract.\n let functions = process_functions(m);\n\n // We generate structs and their implementations necessary for convenient functions calls.\n let interface = generate_contract_interface(m);\n let self_call_structs = generate_external_function_self_calls_structs(m);\n let call_internal_struct = generate_call_internal_struct(m);\n\n // We generate ABI exports for all the external functions in the contract.\n let fn_abi_exports = create_fn_abi_exports(m);\n\n // We generate `_compute_note_hash`, `_compute_note_nullifier` (and the deprecated\n // `_compute_note_hash_and_nullifier` wrapper) only if they are not already implemented.\n // If they are implemented we just insert empty quotes.\n let contract_library_method_compute_note_hash_and_nullifier = if !m.functions().any(|f| {\n // Note that we don't test for `_compute_note_hash` or `_compute_note_nullifier` in order to make this simpler\n // - users must either implement all three or none.\n // Down the line we'll remove this check and use `AztecConfig`.\n f.name() == quote { _compute_note_hash_and_nullifier }\n }) {\n generate_contract_library_methods_compute_note_hash_and_nullifier()\n } else {\n quote {}\n };\n let process_custom_message_option = if config.custom_message_handler.is_some() {\n let handler = config.custom_message_handler.unwrap();\n quote { Option::some($handler) }\n } else {\n quote { Option::<aztec::messages::discovery::CustomMessageHandler>::none() }\n };\n\n let offchain_inbox_sync_option = quote {\n Option::some(aztec::messages::processing::offchain::sync_inbox)\n };\n\n if m.functions().any(|f| f.name() == quote { sync_state }) {\n panic(\n \"User-defined 'sync_state' is not allowed. Use AztecConfig::custom_sync_state() to customize sync behavior.\",\n );\n }\n\n let custom_sync_handler = if config.custom_sync_state.is_some() {\n let handler = config.custom_sync_state.unwrap();\n Option::some(quote { $handler })\n } else {\n Option::none()\n };\n\n let sync_state_fn_and_abi_export = generate_sync_state(\n process_custom_message_option,\n offchain_inbox_sync_option,\n custom_sync_handler,\n );\n\n if m.functions().any(|f| f.name() == quote { offchain_receive }) {\n panic(\n \"User-defined 'offchain_receive' is not allowed. The function is auto-injected by the #[aztec] macro. See https://docs.aztec.network/errors/7\",\n );\n }\n let offchain_receive_fn_and_abi_export = generate_offchain_receive();\n\n let (has_public_init_nullifier_fn, emit_public_init_nullifier_fn_body) = generate_emit_public_init_nullifier(m);\n let public_dispatch = generate_public_dispatch(m, has_public_init_nullifier_fn);\n\n quote {\n $interface\n $self_call_structs\n $call_internal_struct\n $functions\n $fn_abi_exports\n $contract_library_method_compute_note_hash_and_nullifier\n $public_dispatch\n $sync_state_fn_and_abi_export\n $emit_public_init_nullifier_fn_body\n $offchain_receive_fn_and_abi_export\n }\n}\n\ncomptime fn generate_contract_interface(m: Module) -> Quoted {\n let calls = generate_external_function_calls(m);\n\n let module_name = m.name();\n\n let has_storage_layout = module_has_storage(m) & STORAGE_LAYOUT_NAME.get(m).is_some();\n let storage_layout_getter = if has_storage_layout {\n let storage_layout_name = STORAGE_LAYOUT_NAME.get(m).unwrap();\n quote {\n pub fn storage_layout() -> StorageLayoutFields {\n $storage_layout_name.fields\n }\n }\n } else {\n quote {}\n };\n\n let library_storage_layout_getter = if has_storage_layout {\n quote {\n #[contract_library_method]\n $storage_layout_getter\n }\n } else {\n quote {}\n };\n\n quote {\n pub struct $module_name {\n pub target_contract: aztec::protocol::address::AztecAddress\n }\n\n impl $module_name {\n $calls\n\n pub fn at(\n addr: aztec::protocol::address::AztecAddress\n ) -> Self {\n Self { target_contract: addr }\n }\n\n pub fn interface() -> Self {\n Self { target_contract: aztec::protocol::address::AztecAddress::zero() }\n }\n\n $storage_layout_getter\n }\n\n #[contract_library_method]\n pub fn at(\n addr: aztec::protocol::address::AztecAddress\n ) -> $module_name {\n $module_name { target_contract: addr }\n }\n\n #[contract_library_method]\n pub fn interface() -> $module_name {\n $module_name { target_contract: aztec::protocol::address::AztecAddress::zero() }\n }\n\n $library_storage_layout_getter\n\n }\n}\n\n/// Generates the `sync_state` utility function that performs message discovery.\ncomptime fn generate_sync_state(\n process_custom_message_option: Quoted,\n offchain_inbox_sync_option: Quoted,\n custom_sync_handler: Option<Quoted>,\n) -> Quoted {\n let body = if custom_sync_handler.is_some() {\n let handler = custom_sync_handler.unwrap();\n quote {\n $handler(\n address,\n _compute_note_hash,\n _compute_note_nullifier,\n $process_custom_message_option,\n $offchain_inbox_sync_option,\n scope,\n );\n }\n } else {\n quote {\n aztec::messages::discovery::do_sync_state(\n address,\n _compute_note_hash,\n _compute_note_nullifier,\n $process_custom_message_option,\n $offchain_inbox_sync_option,\n scope,\n );\n }\n };\n\n quote {\n pub struct sync_state_parameters {\n pub scope: aztec::protocol::address::AztecAddress,\n }\n\n #[abi(functions)]\n pub struct sync_state_abi {\n parameters: sync_state_parameters,\n }\n\n #[aztec::macros::internals_functions_generation::abi_attributes::abi_utility]\n unconstrained fn sync_state(scope: aztec::protocol::address::AztecAddress) {\n let address = aztec::context::UtilityContext::new().this_address();\n $body\n }\n }\n}\n\n/// Generates an `offchain_receive` utility function that lets callers add messages to the offchain message inbox.\n///\n/// For more details, see `aztec::messages::processing::offchain::receive`.\ncomptime fn generate_offchain_receive() -> Quoted {\n let param_type = offchain_receive_param_type(quote { aztec });\n let parameters_struct_name = f\"{OFFCHAIN_RECEIVE_FN_NAME}_parameters\".quoted_contents();\n let abi_struct_name = f\"{OFFCHAIN_RECEIVE_FN_NAME}_abi\".quoted_contents();\n\n quote {\n pub struct $parameters_struct_name {\n pub $OFFCHAIN_RECEIVE_PARAM_NAME: $param_type,\n }\n\n #[abi(functions)]\n pub struct $abi_struct_name {\n parameters: $parameters_struct_name,\n }\n\n /// Receives offchain messages into this contract's offchain inbox for subsequent processing.\n ///\n /// Each message is routed to the inbox scoped to its `recipient` field.\n ///\n /// For more details, see `aztec::messages::processing::offchain::receive`.\n ///\n /// This function is automatically injected by the `#[aztec]` macro.\n #[aztec::macros::internals_functions_generation::abi_attributes::abi_utility]\n unconstrained fn $OFFCHAIN_RECEIVE_FN_NAME($OFFCHAIN_RECEIVE_PARAM_NAME: $param_type) -> $OFFCHAIN_RECEIVE_RETURN_TYPE {\n let address = aztec::context::UtilityContext::new().this_address();\n aztec::messages::processing::offchain::receive(address, $OFFCHAIN_RECEIVE_PARAM_NAME);\n }\n }\n}\n\n/// Checks that all functions in the module have a context macro applied.\n///\n/// Non-macroified functions are not allowed in contracts. They must all be one of\n/// [`crate::macros::functions::external`], [`crate::macros::functions::internal`] or `test`.\ncomptime fn check_each_fn_macroified(m: Module) {\n for f in m.functions() {\n let name = f.name();\n if !is_fn_external(f) & !is_fn_contract_library_method(f) & !is_fn_internal(f) & !is_fn_test(f) {\n // We don't suggest that #[contract_library_method] is allowed because we don't want to introduce another\n // concept\n panic(\n f\"Function {name} must be marked as either #[external(...)], #[internal(...)], or #[test]\",\n );\n }\n }\n}\n"
|
|
38
|
+
"path": "/mnt/user-data/nicov/node-3/noir-projects/aztec-nr/aztec/src/macros/aztec.nr",
|
|
39
|
+
"source": "mod compute_note_hash_and_nullifier;\n\nuse crate::{\n macros::{\n calls_generation::{\n external_functions::{generate_external_function_calls, generate_external_function_self_calls_structs},\n internal_functions::generate_call_internal_struct,\n },\n dispatch::generate_public_dispatch,\n emit_public_init_nullifier::generate_emit_public_init_nullifier,\n internals_functions_generation::{create_fn_abi_exports, process_functions},\n offchain_receive::{\n OFFCHAIN_RECEIVE_FN_NAME, OFFCHAIN_RECEIVE_PARAM_NAME, offchain_receive_param_type,\n OFFCHAIN_RECEIVE_RETURN_TYPE,\n },\n storage::STORAGE_LAYOUT_NAME,\n utils::{is_fn_contract_library_method, is_fn_external, is_fn_internal, is_fn_test, module_has_storage},\n },\n messages::discovery::{CustomMessageHandler, CustomSyncHandler},\n};\n\nuse compute_note_hash_and_nullifier::generate_contract_library_methods_compute_note_hash_and_nullifier;\n\n/// Configuration for the [`aztec`] macro.\n///\n/// This type lets users override different parts of the default aztec-nr contract behavior, such\n/// as message handling and state synchronization. These are advanced features that require careful\n/// understanding of the behavior of these systems.\n///\n/// ## Examples\n///\n/// ```noir\n/// #[aztec(aztec::macros::AztecConfig::new().custom_message_handler(my_handler))]\n/// contract MyContract { ... }\n/// ```\npub struct AztecConfig {\n custom_message_handler: Option<CustomMessageHandler>,\n custom_sync_state: Option<CustomSyncHandler>,\n}\n\nimpl AztecConfig {\n /// Creates a new `AztecConfig` with default values.\n ///\n /// Calling `new` is equivalent to invoking the [`aztec`] macro with no parameters. The different methods\n /// (e.g. [`AztecConfig::custom_message_handler`]) can then be used to change the default behavior.\n pub comptime fn new() -> Self {\n Self { custom_message_handler: Option::none(), custom_sync_state: Option::none() }\n }\n\n /// Sets a handler for custom messages.\n ///\n /// This enables contracts to process non-standard messages (i.e. any with a message type that is not in\n /// [`crate::messages::msg_type`]).\n ///\n /// `handler` must be a function that conforms to the\n /// [`crate::messages::discovery::CustomMessageHandler`] type signature.\n pub comptime fn custom_message_handler(&mut self, handler: CustomMessageHandler) -> Self {\n self.custom_message_handler = Option::some(handler);\n *self\n }\n\n /// Overrides the default state synchronization logic.\n ///\n /// The generated `sync_state` function will call `handler` instead of\n /// [`crate::messages::discovery::do_sync_state`]. The handler receives all of the same parameters, so it can\n /// run custom logic (e.g. fetching and decrypting custom logs) before, after, or instead of calling\n /// `do_sync_state`.\n ///\n /// `handler` must be a function that conforms to the\n /// [`crate::messages::discovery::CustomSyncHandler`] type signature.\n pub comptime fn custom_sync_state(&mut self, handler: CustomSyncHandler) -> Self {\n self.custom_sync_state = Option::some(handler);\n *self\n }\n}\n\n/// Enables aztec-nr features on a `contract`.\n///\n/// All aztec-nr contracts should have this macro invoked on them, as it is the one that processes all contract\n/// functions, notes, storage, generates interfaces for external calls, and creates the message processing\n/// boilerplate.\n///\n/// ## Examples\n///\n/// Most contracts can simply invoke the macro with no parameters, resulting in default aztec-nr behavior:\n/// ```noir\n/// #[aztec]\n/// contract MyContract { ... }\n/// ```\n///\n/// Advanced contracts can use [`AztecConfig`] to customize parts of its behavior, such as message\n/// processing.\n/// ```noir\n/// #[aztec(aztec::macros::AztecConfig::new().custom_message_handler(my_handler))]\n/// contract MyAdvancedContract { ... }\n/// ```\n#[varargs]\npub comptime fn aztec(m: Module, args: [AztecConfig]) -> Quoted {\n let num_args = args.len();\n let config = if num_args == 0 {\n AztecConfig::new()\n } else if num_args == 1 {\n args[0]\n } else {\n panic(f\"#[aztec] expects 0 or 1 arguments, got {num_args}\")\n };\n\n // Functions that don't have #[external(...)], #[contract_library_method], or #[test] are not allowed in contracts.\n check_each_fn_macroified(m);\n\n // We generate new functions prefixed with `__aztec_nr_internals__` and we replace the original functions' bodies\n // with `static_assert(false, ...)` to prevent them from being called directly from within the contract.\n let functions = process_functions(m);\n\n // We generate structs and their implementations necessary for convenient functions calls.\n let interface = generate_contract_interface(m);\n let self_call_structs = generate_external_function_self_calls_structs(m);\n let call_internal_struct = generate_call_internal_struct(m);\n\n // We generate ABI exports for all the external functions in the contract.\n let fn_abi_exports = create_fn_abi_exports(m);\n\n // We generate `_compute_note_hash`, `_compute_note_nullifier` (and the deprecated\n // `_compute_note_hash_and_nullifier` wrapper) only if they are not already implemented.\n // If they are implemented we just insert empty quotes.\n let contract_library_method_compute_note_hash_and_nullifier = if !m.functions().any(|f| {\n // Note that we don't test for `_compute_note_hash` or `_compute_note_nullifier` in order to make this simpler\n // - users must either implement all three or none.\n // Down the line we'll remove this check and use `AztecConfig`.\n f.name() == quote { _compute_note_hash_and_nullifier }\n }) {\n generate_contract_library_methods_compute_note_hash_and_nullifier()\n } else {\n quote {}\n };\n let process_custom_message_option = if config.custom_message_handler.is_some() {\n let handler = config.custom_message_handler.unwrap();\n quote { Option::some($handler) }\n } else {\n quote { Option::<aztec::messages::discovery::CustomMessageHandler>::none() }\n };\n\n let offchain_inbox_sync_option = quote {\n Option::some(aztec::messages::processing::offchain::sync_inbox)\n };\n\n if m.functions().any(|f| f.name() == quote { sync_state }) {\n panic(\n \"User-defined 'sync_state' is not allowed. Use AztecConfig::custom_sync_state() to customize sync behavior.\",\n );\n }\n\n let custom_sync_handler = if config.custom_sync_state.is_some() {\n let handler = config.custom_sync_state.unwrap();\n Option::some(quote { $handler })\n } else {\n Option::none()\n };\n\n let sync_state_fn_and_abi_export = generate_sync_state(\n process_custom_message_option,\n offchain_inbox_sync_option,\n custom_sync_handler,\n );\n\n if m.functions().any(|f| f.name() == quote { offchain_receive }) {\n panic(\n \"User-defined 'offchain_receive' is not allowed. The function is auto-injected by the #[aztec] macro. See https://docs.aztec.network/errors/7\",\n );\n }\n let offchain_receive_fn_and_abi_export = generate_offchain_receive();\n\n let (has_public_init_nullifier_fn, emit_public_init_nullifier_fn_body) = generate_emit_public_init_nullifier(m);\n let public_dispatch = generate_public_dispatch(m, has_public_init_nullifier_fn);\n\n quote {\n $interface\n $self_call_structs\n $call_internal_struct\n $functions\n $fn_abi_exports\n $contract_library_method_compute_note_hash_and_nullifier\n $public_dispatch\n $sync_state_fn_and_abi_export\n $emit_public_init_nullifier_fn_body\n $offchain_receive_fn_and_abi_export\n }\n}\n\ncomptime fn generate_contract_interface(m: Module) -> Quoted {\n let calls = generate_external_function_calls(m);\n\n let module_name = m.name();\n\n let has_storage_layout = module_has_storage(m) & STORAGE_LAYOUT_NAME.get(m).is_some();\n let storage_layout_getter = if has_storage_layout {\n let storage_layout_name = STORAGE_LAYOUT_NAME.get(m).unwrap();\n quote {\n pub fn storage_layout() -> StorageLayoutFields {\n $storage_layout_name.fields\n }\n }\n } else {\n quote {}\n };\n\n let library_storage_layout_getter = if has_storage_layout {\n quote {\n #[contract_library_method]\n $storage_layout_getter\n }\n } else {\n quote {}\n };\n\n quote {\n pub struct $module_name {\n pub target_contract: aztec::protocol::address::AztecAddress\n }\n\n impl $module_name {\n $calls\n\n pub fn at(\n addr: aztec::protocol::address::AztecAddress\n ) -> Self {\n Self { target_contract: addr }\n }\n\n pub fn interface() -> Self {\n Self { target_contract: aztec::protocol::address::AztecAddress::zero() }\n }\n\n $storage_layout_getter\n }\n\n #[contract_library_method]\n pub fn at(\n addr: aztec::protocol::address::AztecAddress\n ) -> $module_name {\n $module_name { target_contract: addr }\n }\n\n #[contract_library_method]\n pub fn interface() -> $module_name {\n $module_name { target_contract: aztec::protocol::address::AztecAddress::zero() }\n }\n\n $library_storage_layout_getter\n\n }\n}\n\n/// Generates the `sync_state` utility function that performs message discovery.\ncomptime fn generate_sync_state(\n process_custom_message_option: Quoted,\n offchain_inbox_sync_option: Quoted,\n custom_sync_handler: Option<Quoted>,\n) -> Quoted {\n let body = if custom_sync_handler.is_some() {\n let handler = custom_sync_handler.unwrap();\n quote {\n $handler(\n address,\n _compute_note_hash,\n _compute_note_nullifier,\n $process_custom_message_option,\n $offchain_inbox_sync_option,\n scope,\n );\n }\n } else {\n quote {\n aztec::messages::discovery::do_sync_state(\n address,\n _compute_note_hash,\n _compute_note_nullifier,\n $process_custom_message_option,\n $offchain_inbox_sync_option,\n scope,\n );\n }\n };\n\n quote {\n pub struct sync_state_parameters {\n pub scope: aztec::protocol::address::AztecAddress,\n }\n\n #[abi(functions)]\n pub struct sync_state_abi {\n parameters: sync_state_parameters,\n }\n\n #[aztec::macros::internals_functions_generation::abi_attributes::abi_utility]\n unconstrained fn sync_state(scope: aztec::protocol::address::AztecAddress) {\n aztec::oracle::version::assert_compatible_oracle_version();\n let address = aztec::context::UtilityContext::new().this_address();\n $body\n }\n }\n}\n\n/// Generates an `offchain_receive` utility function that lets callers add messages to the offchain message inbox.\n///\n/// For more details, see `aztec::messages::processing::offchain::receive`.\ncomptime fn generate_offchain_receive() -> Quoted {\n let param_type = offchain_receive_param_type(quote { aztec });\n let parameters_struct_name = f\"{OFFCHAIN_RECEIVE_FN_NAME}_parameters\".quoted_contents();\n let abi_struct_name = f\"{OFFCHAIN_RECEIVE_FN_NAME}_abi\".quoted_contents();\n\n quote {\n pub struct $parameters_struct_name {\n pub $OFFCHAIN_RECEIVE_PARAM_NAME: $param_type,\n }\n\n #[abi(functions)]\n pub struct $abi_struct_name {\n parameters: $parameters_struct_name,\n }\n\n /// Receives offchain messages into this contract's offchain inbox for subsequent processing.\n ///\n /// Each message is routed to the inbox scoped to its `recipient` field.\n ///\n /// For more details, see `aztec::messages::processing::offchain::receive`.\n ///\n /// This function is automatically injected by the `#[aztec]` macro.\n #[aztec::macros::internals_functions_generation::abi_attributes::abi_utility]\n unconstrained fn $OFFCHAIN_RECEIVE_FN_NAME($OFFCHAIN_RECEIVE_PARAM_NAME: $param_type) -> $OFFCHAIN_RECEIVE_RETURN_TYPE {\n aztec::oracle::version::assert_compatible_oracle_version();\n let address = aztec::context::UtilityContext::new().this_address();\n aztec::messages::processing::offchain::receive(address, $OFFCHAIN_RECEIVE_PARAM_NAME);\n }\n }\n}\n\n/// Checks that all functions in the module have a context macro applied.\n///\n/// Non-macroified functions are not allowed in contracts. They must all be one of\n/// [`crate::macros::functions::external`], [`crate::macros::functions::internal`] or `test`.\ncomptime fn check_each_fn_macroified(m: Module) {\n for f in m.functions() {\n let name = f.name();\n if !is_fn_external(f) & !is_fn_contract_library_method(f) & !is_fn_internal(f) & !is_fn_test(f) {\n // We don't suggest that #[contract_library_method] is allowed because we don't want to introduce another\n // concept\n panic(\n f\"Function {name} must be marked as either #[external(...)], #[internal(...)], or #[test]\",\n );\n }\n }\n}\n"
|
|
40
40
|
},
|
|
41
|
-
"
|
|
41
|
+
"121": {
|
|
42
42
|
"function_locations": [
|
|
43
43
|
{
|
|
44
44
|
"name": "generate_private_external",
|
|
45
45
|
"start": 579
|
|
46
46
|
}
|
|
47
47
|
],
|
|
48
|
-
"path": "/
|
|
48
|
+
"path": "/mnt/user-data/nicov/node-3/noir-projects/aztec-nr/aztec/src/macros/internals_functions_generation/external/private.nr",
|
|
49
49
|
"source": "use crate::macros::{\n functions::initialization_utils::has_public_init_checked_functions,\n internals_functions_generation::external::helpers::{create_authorize_once_check, get_abi_relevant_attributes},\n utils::{\n fn_has_allow_phase_change, fn_has_authorize_once, fn_has_noinitcheck, is_fn_initializer, is_fn_only_self,\n is_fn_view, module_has_initializer, module_has_storage,\n },\n};\nuse crate::protocol::meta::utils::derive_serialization_quotes;\nuse std::meta::type_of;\n\npub(crate) comptime fn generate_private_external(f: FunctionDefinition) -> Quoted {\n let module_has_initializer = module_has_initializer(f.module());\n let module_has_storage = module_has_storage(f.module());\n\n // Private functions undergo a lot of transformations from their Aztec.nr form into a circuit that can be fed to\n // the Private Kernel Circuit. First we change the function signature so that it also receives\n // `PrivateContextInputs`, which contain information about the execution context (e.g. the caller).\n let original_params = f.parameters().map(|param| (param.name(), param.typ()));\n\n let original_params_quotes =\n original_params.map(|(param_name, param_type)| quote { $param_name: $param_type }).join(quote {, });\n\n let params = quote { inputs: aztec::context::inputs::PrivateContextInputs, $original_params_quotes };\n\n let mut body = f.body().as_block().unwrap();\n\n // The original params are hashed and passed to the `context` object, so that the kernel can verify we've received\n // the correct values.\n let (args_serialization, _, serialized_args_name) = derive_serialization_quotes(original_params, false);\n\n let storage_init = if module_has_storage {\n // Contract has Storage defined so we initialize it.\n quote {\n let storage = Storage::init(&mut context);\n }\n } else {\n // Contract does not have Storage defined, so we set storage to the unit type `()`. ContractSelfPrivate\n // requires a storage struct in its constructor. Using an Option type would lead to worse developer experience\n // and higher constraint counts so we use the unit type `()` instead.\n quote {\n let storage = ();\n }\n };\n\n let contract_self_creation = quote {\n #[allow(unused_variables)]\n let mut self = {\n $args_serialization\n let args_hash = aztec::hash::hash_args($serialized_args_name);\n let mut context = aztec::context::PrivateContext::new(inputs, args_hash);\n $storage_init\n let self_address = context.this_address();\n let call_self: CallSelf<&mut aztec::context::PrivateContext> = CallSelf { address: self_address, context: &mut context };\n let enqueue_self: EnqueueSelf<&mut aztec::context::PrivateContext> = EnqueueSelf { address: self_address, context: &mut context };\n let call_self_static: CallSelfStatic<&mut aztec::context::PrivateContext> = CallSelfStatic { address: self_address, context: &mut context };\n let enqueue_self_static: EnqueueSelfStatic<&mut aztec::context::PrivateContext> = EnqueueSelfStatic { address: self_address, context: &mut context };\n let internal: CallInternal<&mut aztec::context::PrivateContext> = CallInternal { context: &mut context };\n let call_self_utility = CallSelfUtility { address: self_address };\n let utility: aztec::contract_self::PrivateUtilityCalls<CallSelfUtility> = aztec::contract_self::PrivateUtilityCalls { call_self: call_self_utility };\n aztec::contract_self::ContractSelfPrivate::new(&mut context, storage, call_self, enqueue_self, call_self_static, enqueue_self_static, internal, utility)\n };\n };\n\n let original_function_name = f.name();\n\n // Modifications introduced by the different marker attributes.\n let internal_check = if is_fn_only_self(f) {\n let assertion_message = f\"Function {original_function_name} can only be called by the same contract\";\n quote { assert(self.msg_sender() == self.address, $assertion_message); }\n } else {\n quote {}\n };\n\n let view_check = if is_fn_view(f) {\n let assertion_message = f\"Function {original_function_name} can only be called statically\".as_quoted_str();\n quote { assert(self.context.is_static_call(), $assertion_message); }\n } else {\n quote {}\n };\n\n let (assert_initializer, mark_as_initialized) = if is_fn_initializer(f) {\n let has_public_fns_with_init_check = has_public_init_checked_functions(f.module());\n (\n quote {\n aztec::macros::functions::initialization_utils::assert_initialization_matches_address_preimage_private(*self.context);\n },\n quote { aztec::macros::functions::initialization_utils::mark_as_initialized_from_private_initializer(self.context, $has_public_fns_with_init_check); },\n )\n } else {\n (quote {}, quote {})\n };\n\n // Initialization checks are not included in contracts that don't have initializers.\n let init_check = if module_has_initializer & !is_fn_initializer(f) & !fn_has_noinitcheck(f) {\n quote { aztec::macros::functions::initialization_utils::assert_is_initialized_private(self.context); }\n } else {\n quote {}\n };\n\n // Phase checks are skipped in functions that request to manually handle phases\n let initial_phase_store = if fn_has_allow_phase_change(f) {\n quote {}\n } else {\n quote { let within_revertible_phase: bool = self.context.in_revertible_phase(); }\n };\n\n let no_phase_change_check = if fn_has_allow_phase_change(f) {\n quote {}\n } else {\n quote {\n assert_eq(\n within_revertible_phase,\n self.context.in_revertible_phase(),\n f\"Phase change detected on function with phase check. If this is expected, use #[allow_phase_change]\",\n );\n }\n };\n\n // Inject the authwit check if the function is marked with #[authorize_once].\n let authorize_once_check = if fn_has_authorize_once(f) {\n create_authorize_once_check(f, true)\n } else {\n quote {}\n };\n\n // Finally, we need to change the return type to be `PrivateCircuitPublicInputs`, which is what the Private Kernel\n // circuit expects.\n let return_value_var_name = quote { macro__returned__values };\n\n let return_value_type = f.return_type();\n let return_value = if body.len() == 0 {\n quote {}\n } else if return_value_type != type_of(()) {\n // The original return value is serialized and hashed before being passed to the context.\n let (body_without_return, last_body_expr) = body.pop_back();\n let return_value = last_body_expr.quoted();\n let return_value_assignment = quote { let $return_value_var_name: $return_value_type = $return_value; };\n\n let (return_serialization, _, serialized_return_name) =\n derive_serialization_quotes([(return_value_var_name, return_value_type)], false);\n\n body = body_without_return;\n\n quote {\n $return_value_assignment\n $return_serialization\n self.context.set_return_hash($serialized_return_name);\n }\n } else {\n let (body_without_return, last_body_expr) = body.pop_back();\n if !last_body_expr.has_semicolon()\n & last_body_expr.as_for().is_none()\n & last_body_expr.as_assert().is_none()\n & last_body_expr.as_for_range().is_none()\n & last_body_expr.as_assert_eq().is_none()\n & last_body_expr.as_let().is_none() {\n let unused_return_value_name = f\"_{return_value_var_name}\".quoted_contents();\n body = body_without_return.push_back(quote { let $unused_return_value_name = $last_body_expr; }\n .as_expr()\n .unwrap());\n }\n quote {}\n };\n\n let context_finish = quote { self.context.finish() };\n\n // Preserve all attributes that are relevant to the function's ABI.\n let abi_relevant_attributes = get_abi_relevant_attributes(f);\n\n let fn_name = f\"__aztec_nr_internals__{original_function_name}\".quoted_contents();\n\n let to_prepend = quote {\n aztec::oracle::version::assert_compatible_oracle_version();\n $contract_self_creation\n $initial_phase_store\n $assert_initializer\n $init_check\n $internal_check\n $view_check\n $authorize_once_check\n };\n\n let body_quote = body.map(|expr| expr.quoted()).join(quote { });\n\n // `mark_as_initialized` is placed after the user's function body. If it ran at the beginning, the contract\n // would appear initialized while the initializer is still running, allowing contracts called by the initializer\n // to re-enter into a half-initialized contract.\n let to_append = quote {\n $return_value\n $mark_as_initialized\n $no_phase_change_check\n $context_finish\n };\n\n // `PrivateCircuitPublicInputs` is a fixed protocol ABI: some of its fields are constant for a given function (e.g.\n // the `is_static_call` flag of a non-static function), and the compiler flags those as constants that could be\n // dropped from the return value. They cannot be dropped without changing the ABI, so silence the lint here rather\n // than letting it defeat `--deny-warnings` for every contract.\n quote {\n #[allow(constant_return)]\n #[aztec::macros::internals_functions_generation::abi_attributes::abi_private]\n $abi_relevant_attributes\n fn $fn_name($params) -> return_data aztec::protocol::abis::private_circuit_public_inputs::PrivateCircuitPublicInputs {\n $to_prepend\n $body_quote\n $to_append\n }\n }\n}\n"
|
|
50
50
|
},
|
|
51
|
-
"
|
|
51
|
+
"166": {
|
|
52
52
|
"function_locations": [
|
|
53
53
|
{
|
|
54
54
|
"name": "receive",
|
|
@@ -95,98 +95,98 @@
|
|
|
95
95
|
"start": 11760
|
|
96
96
|
}
|
|
97
97
|
],
|
|
98
|
-
"path": "/
|
|
98
|
+
"path": "/mnt/user-data/nicov/node-3/noir-projects/aztec-nr/aztec/src/messages/processing/offchain/mod.nr",
|
|
99
99
|
"source": "use crate::{\n context::UtilityContext,\n ephemeral::EphemeralArray,\n messages::{encoding::MESSAGE_CIPHERTEXT_LEN, processing::OffchainMessageWithTx},\n oracle::{contract_sync::set_contract_sync_cache_invalid, tx_resolution::get_resolved_txs},\n protocol::{address::AztecAddress, traits::{Deserialize, Serialize}},\n};\n\nmod reception;\nuse reception::{MAX_ANCHOR_FUTURE_SKEW, OffchainReception};\n\n/// Maximum number of offchain messages accepted by `offchain_receive` in a single call.\npub global MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL: u32 = 16;\n\n/// A function that manages offchain-delivered messages for processing during sync.\n///\n/// Offchain messages are messages that are not broadcasted via onchain logs. They are instead delivered to the\n/// recipient by calling the `offchain_receive` utility function (injected by the `#[aztec]` macro). Message transport\n/// is the app's responsibility. Typical examples of transport methods are: messaging apps, email, QR codes, etc.\n///\n/// Once offchain messages are delivered to the recipient's private environment via `offchain_receive`, messages are\n/// locally stored in a persistent inbox.\n///\n/// This function determines when each message in said inbox is ready for processing, when it can be safely disposed\n/// of, etc.\n///\n/// The only current implementation of an [`OffchainInboxSync`] is [`sync_inbox`], which manages an inbox with\n/// expiration and finality-based eviction and automatic transaction context resolution.\npub type OffchainInboxSync = unconstrained fn(\n/* contract_address */AztecAddress, /* scope */ AztecAddress) -> EphemeralArray<OffchainMessageWithTx>;\n\n/// Delivers offchain messages to the given contract's offchain inbox for subsequent processing.\n///\n/// Offchain messages are transaction effects that are not broadcasted via onchain logs. Instead, the sender shares the\n/// message to the recipient through an external channel (e.g. a URL accessible by the recipient). The recipient then\n/// calls this function to hand the messages to the contract so they can be processed through the same mechanisms as\n/// onchain messages.\n///\n/// Messages are processed when their originating transaction is found onchain (providing the context needed to\n/// validate resulting notes and events).\n///\n/// Messages are eventually removed from the inbox: an unprocessed message once its TTL (`anchor_block_timestamp +\n/// MAX_MSG_TTL`) elapses, and a processed message once the block its transaction was found in finalizes.\n///\n/// Processing order is not guaranteed.\npub unconstrained fn receive(\n contract_address: AztecAddress,\n messages: BoundedVec<OffchainMessage, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL>,\n) {\n // Offchain reception facts are scoped to the recipient. Note that because offchain messages have no integrity or\n // authenticity checks it is not possible to verify that this is indeed the intended recipient. In this case we're\n // assuming a cooperative environment, which is on par with other offchain delivery expectations.\n //\n // The sender-supplied anchor timestamp is the one field we bound: a message claiming to originate implausibly far\n // in our future (see MAX_ANCHOR_FUTURE_SKEW) cannot be genuine, and accepting it would let a malicious anchor evade\n // the TTL-based inbox eviction. We reject such a batch by panicking instead of silently dropping the message, so\n // the calling wallet can react to it (e.g. surface the error or distrust the sender).\n let now = UtilityContext::new().timestamp();\n messages.for_each(|msg| {\n assert(\n msg.anchor_block_timestamp <= now + MAX_ANCHOR_FUTURE_SKEW,\n \"offchain message anchor timestamp is implausibly far in the future\",\n );\n });\n\n messages.for_each(|msg| OffchainReception::init(contract_address, msg));\n\n // Clear cache for message recipients so the next sync runs.\n set_contract_sync_cache_invalid(contract_address, messages.map(|msg| msg.recipient));\n}\n\n/// Returns offchain-delivered messages to process during sync.\npub unconstrained fn sync_inbox(\n contract_address: AztecAddress,\n scope: AztecAddress,\n) -> EphemeralArray<OffchainMessageWithTx> {\n let active_receptions = OffchainReception::load_all(contract_address, scope);\n\n // Ask PXE to resolve each message's originating tx. We pass the tx hashes in reception order, so the resolved txs\n // come back aligned with the reception indices and can be matched back positionally.\n let resolved_txs = get_resolved_txs(active_receptions.map(|reception: OffchainReception| {\n reception.read_message().tx_hash.unwrap_or(0)\n }));\n\n let processable_messages: EphemeralArray<OffchainMessageWithTx> = EphemeralArray::empty();\n let now = UtilityContext::new().timestamp();\n\n active_receptions.for_each(|i, reception| {\n let maybe_message = reception.step(resolved_txs.get(i), now);\n if maybe_message.is_some() {\n processable_messages.push(maybe_message.unwrap());\n }\n });\n\n processable_messages\n}\n\n/// A message delivered via the `offchain_receive` utility function.\n#[derive(Serialize, Deserialize)]\npub struct OffchainMessage {\n /// The encrypted message payload.\n pub ciphertext: BoundedVec<Field, MESSAGE_CIPHERTEXT_LEN>,\n /// The intended recipient of the message.\n pub recipient: AztecAddress,\n /// The hash of the transaction that produced this message. `Option::none` indicates a tx-less message.\n pub tx_hash: Option<Field>,\n /// Anchor block timestamp at message emission.\n pub anchor_block_timestamp: u64,\n}\n\nmod test {\n use crate::{\n oracle::random::random,\n protocol::{address::AztecAddress, constants::MAX_TX_LIFETIME},\n test::helpers::test_environment::TestEnvironment,\n };\n use super::{MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL, OffchainMessage, receive, sync_inbox};\n use super::reception::{MAX_ANCHOR_FUTURE_SKEW, MAX_MSG_TTL, OffchainReception};\n\n unconstrained fn setup() -> (TestEnvironment, AztecAddress) {\n let mut env = TestEnvironment::new();\n let scope = env.create_light_account();\n (env, scope)\n }\n\n /// Creates an `OffchainMessage` with dummy ciphertext and the given scope as recipient.\n fn make_msg(recipient: AztecAddress, tx_hash: Option<Field>, anchor_block_timestamp: u64) -> OffchainMessage {\n OffchainMessage { ciphertext: BoundedVec::new(), recipient, tx_hash, anchor_block_timestamp }\n }\n\n /// Advances the TXE block timestamp by `offset` seconds and returns the resulting timestamp.\n unconstrained fn advance_by(env: TestEnvironment, offset: u64) -> u64 {\n env.advance_next_block_timestamp_by(offset);\n env.mine_block();\n env.last_block_timestamp()\n }\n\n #[test]\n unconstrained fn empty_inbox_returns_empty_result() {\n let (env, scope) = setup();\n env.utility_context(|context| {\n let address = context.this_address();\n let result = sync_inbox(address, scope);\n\n assert_eq(result.len(), 0);\n assert_eq(OffchainReception::load_all(address, scope).len(), 0);\n });\n }\n\n #[test]\n unconstrained fn multiple_messages_mixed_expiration() {\n let (env, scope) = setup();\n let anchor_ts = advance_by(env, 10);\n\n let expired_a_tx_hash = random();\n let survivor_tx_hash = random();\n\n let expired_a = make_msg(scope, Option::some(expired_a_tx_hash), 0);\n let survivor = make_msg(scope, Option::some(survivor_tx_hash), anchor_ts);\n let expired_b = make_msg(scope, Option::none(), 0);\n\n env.utility_context(|context| {\n let address = context.this_address();\n let mut msgs: BoundedVec<OffchainMessage, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL> = BoundedVec::new();\n // Message 0: tx-bound, anchor=0 so it expires quickly.\n msgs.push(expired_a);\n // Message 1: tx-bound, anchor_ts is recent so it survives.\n msgs.push(survivor);\n // Message 2: tx-less, anchor=0 so it also expires.\n msgs.push(expired_b);\n receive(address, msgs);\n });\n\n // Advance past MAX_MSG_TTL for anchor=0, but not for anchor_ts.\n let _now = advance_by(env, MAX_MSG_TTL);\n\n env.utility_context(|context| {\n let address = context.this_address();\n let result = sync_inbox(address, scope);\n\n assert_eq(result.len(), 0); // all contexts are None\n assert(\n !OffchainReception::is_active(address, scope, expired_a),\n \"expired tx-bound reception should be terminated\",\n );\n assert(\n !OffchainReception::is_active(address, scope, expired_b),\n \"expired tx-less reception should be terminated\",\n );\n assert(OffchainReception::is_active(address, scope, survivor), \"survivor reception should stay active\");\n assert_eq(OffchainReception::load_all(address, scope).len(), 1);\n });\n }\n\n #[test]\n unconstrained fn accepts_messages_within_the_tolerated_future_skew() {\n let (env, scope) = setup();\n let now = advance_by(env, 10);\n\n // A present-dated anchor and a 24h-future one both fall within the tolerated skew. The latter models a genuine\n // message whose sender anchored ahead of our lagging PXE, and must still be accepted.\n let present = make_msg(scope, Option::some(random()), now);\n let lagged = make_msg(scope, Option::some(random()), now + MAX_TX_LIFETIME);\n\n env.utility_context(|context| {\n let address = context.this_address();\n receive(address, BoundedVec::from_array([present, lagged]));\n\n assert(OffchainReception::is_active(address, scope, present));\n assert(OffchainReception::is_active(address, scope, lagged));\n assert_eq(OffchainReception::load_all(address, scope).len(), 2);\n });\n }\n\n #[test(should_fail_with = \"offchain message anchor timestamp is implausibly far in the future\")]\n unconstrained fn rejects_batch_with_implausible_future_anchor() {\n let (env, scope) = setup();\n let now = advance_by(env, 10);\n\n // Beyond `now + MAX_ANCHOR_FUTURE_SKEW`: our view would trail the tip by more than a tx lifetime, so this\n // cannot be genuine. Reception panics so the wallet can react rather than accept it.\n let too_future = make_msg(\n scope,\n Option::some(random()),\n now + MAX_ANCHOR_FUTURE_SKEW + 7200,\n );\n\n env.utility_context(|context| { receive(context.this_address(), BoundedVec::from_array([too_future])); });\n }\n\n // -- Idempotent re-delivery (first-write-wins fact recording) ---------\n\n #[test]\n unconstrained fn redelivery_is_idempotent() {\n let (env, scope) = setup();\n let anchor_ts = advance_by(env, 10);\n let msg = make_msg(scope, Option::some(random()), anchor_ts);\n\n // First delivery, committed as its own job.\n env.utility_context(|context| { receive(context.this_address(), BoundedVec::from_array([msg])); });\n\n // Re-delivering the same content-addressed message must not panic and must not create a second reception.\n env.utility_context(|context| {\n let address = context.this_address();\n receive(address, BoundedVec::from_array([msg]));\n\n assert(OffchainReception::is_active(address, scope, msg), \"reception should be active\");\n assert_eq(OffchainReception::load_all(address, scope).len(), 1);\n });\n }\n\n #[test]\n unconstrained fn redelivery_after_processing_keeps_processed_guard() {\n let (env, scope) = setup();\n let known_tx_hash: Field = 1;\n let anchor_ts = advance_by(env, 10);\n let msg = make_msg(scope, Option::some(known_tx_hash), anchor_ts);\n\n env.utility_context(|context| { receive(context.this_address(), BoundedVec::from_array([msg])); });\n\n let _now = advance_by(env, 100);\n\n // First sync resolves the message and marks it as processed.\n env.utility_context(|context| {\n let address = context.this_address();\n assert_eq(sync_inbox(address, scope).len(), 1);\n assert(OffchainReception::is_processed(address, scope, msg), \"should be processed\");\n });\n\n // Re-deliver the same message. The next sync recognizes it as already processed and does not re-push it.\n env.utility_context(|context| {\n let address = context.this_address();\n receive(address, BoundedVec::from_array([msg]));\n\n assert(\n OffchainReception::is_processed(address, scope, msg),\n \"re-delivery must preserve the processed guard\",\n );\n assert_eq(sync_inbox(address, scope).len(), 0);\n });\n }\n}\n"
|
|
100
100
|
},
|
|
101
|
-
"
|
|
101
|
+
"167": {
|
|
102
102
|
"function_locations": [
|
|
103
103
|
{
|
|
104
104
|
"name": "OffchainReception::init",
|
|
105
|
-
"start":
|
|
105
|
+
"start": 9712
|
|
106
106
|
},
|
|
107
107
|
{
|
|
108
108
|
"name": "OffchainReception::load_all",
|
|
109
|
-
"start":
|
|
109
|
+
"start": 10250
|
|
110
110
|
},
|
|
111
111
|
{
|
|
112
112
|
"name": "OffchainReception::read_message",
|
|
113
|
-
"start":
|
|
113
|
+
"start": 10666
|
|
114
114
|
},
|
|
115
115
|
{
|
|
116
116
|
"name": "OffchainReception::id_for",
|
|
117
|
-
"start":
|
|
117
|
+
"start": 11367
|
|
118
118
|
},
|
|
119
119
|
{
|
|
120
120
|
"name": "OffchainReception::is_active",
|
|
121
|
-
"start":
|
|
121
|
+
"start": 11686
|
|
122
122
|
},
|
|
123
123
|
{
|
|
124
124
|
"name": "OffchainReception::step",
|
|
125
|
-
"start":
|
|
125
|
+
"start": 12361
|
|
126
126
|
},
|
|
127
127
|
{
|
|
128
128
|
"name": "OffchainReception::is_processed",
|
|
129
|
-
"start":
|
|
129
|
+
"start": 13966
|
|
130
130
|
},
|
|
131
131
|
{
|
|
132
132
|
"name": "OffchainReception::mark_processed",
|
|
133
|
-
"start":
|
|
133
|
+
"start": 14554
|
|
134
134
|
},
|
|
135
135
|
{
|
|
136
136
|
"name": "OffchainReception::terminate",
|
|
137
|
-
"start":
|
|
137
|
+
"start": 15125
|
|
138
138
|
},
|
|
139
139
|
{
|
|
140
140
|
"name": "to_payload",
|
|
141
|
-
"start":
|
|
141
|
+
"start": 15499
|
|
142
142
|
},
|
|
143
143
|
{
|
|
144
144
|
"name": "test::setup",
|
|
145
|
-
"start":
|
|
145
|
+
"start": 15922
|
|
146
146
|
},
|
|
147
147
|
{
|
|
148
148
|
"name": "test::make_msg",
|
|
149
|
-
"start":
|
|
149
|
+
"start": 16252
|
|
150
150
|
},
|
|
151
151
|
{
|
|
152
152
|
"name": "test::resolved_tx_at_block",
|
|
153
|
-
"start":
|
|
153
|
+
"start": 16536
|
|
154
154
|
},
|
|
155
155
|
{
|
|
156
156
|
"name": "test::resolved_tx",
|
|
157
|
-
"start":
|
|
157
|
+
"start": 16927
|
|
158
158
|
},
|
|
159
159
|
{
|
|
160
160
|
"name": "test::expired_reception_is_terminated",
|
|
161
|
-
"start":
|
|
161
|
+
"start": 17044
|
|
162
162
|
},
|
|
163
163
|
{
|
|
164
164
|
"name": "test::unresolved_reception_stays_active",
|
|
165
|
-
"start":
|
|
165
|
+
"start": 17726
|
|
166
166
|
},
|
|
167
167
|
{
|
|
168
168
|
"name": "test::resolved_reception_is_ready_to_process",
|
|
169
|
-
"start":
|
|
169
|
+
"start": 18521
|
|
170
170
|
},
|
|
171
171
|
{
|
|
172
172
|
"name": "test::already_processed_reception_is_not_re_pushed",
|
|
173
|
-
"start":
|
|
173
|
+
"start": 19567
|
|
174
174
|
},
|
|
175
175
|
{
|
|
176
176
|
"name": "test::processed_reception_terminates_once_its_origin_block_finalizes",
|
|
177
|
-
"start":
|
|
177
|
+
"start": 20941
|
|
178
178
|
},
|
|
179
179
|
{
|
|
180
180
|
"name": "test::unfinalized_processed_reception_survives_past_the_ttl",
|
|
181
|
-
"start":
|
|
181
|
+
"start": 22166
|
|
182
182
|
},
|
|
183
183
|
{
|
|
184
184
|
"name": "test::expired_reception_is_still_processed_when_its_tx_resolves",
|
|
185
|
-
"start":
|
|
185
|
+
"start": 23556
|
|
186
186
|
}
|
|
187
187
|
],
|
|
188
|
-
"path": "/
|
|
189
|
-
"source": "//! The state machine of a single offchain message reception process.\n//!\n//! Offchain processing needs to handle some complexity, including the possibility of reorgs reverting message effects,\n//! and the need to reprocess messages in that case. The state chart below summarizes the current behavior.\n//!\n//! ```text\n//! offchain_receive() (process starts)\n//! |\n//! v\n//! +-----------+ tx found onchain +-----------+\n//! ---- | | --------------------------> | |\n//! tx not found | | | | | discover notes,\n//! |--> | RECEIVED | | PROCESSED | ~~> events, etc\n//! | | <-------------------------- | |\n//! | | tx block re-orged | |\n//! +-----------+ +-----------+\n//! | |\n//! | TTL expired | tx block finalized\n//! v v\n//! +---------------------------------------------------------+\n//! | TERMINATED (process ends) |\n//! +---------------------------------------------------------+\n//! ```\n//!\n//! ## States\n//!\n//! - **Received**: the message is stored but its originating transaction has not been found onchain yet (or the\n//! message is tx-less; see below). While the reception process is in this state, it keeps looking for the\n// transaction onchain.\n//! - **Processed**: the message has been handed off for processing. If there weren't reorgs, reaching this state would\n//! be equivalent to terminating the reception process. Since reorgs are a possibility, this state is not terminal\n//! until the block the originating transaction was found in finalizes.\n//! - **Terminated**: nothing else can be done with the message, either because its originating transaction never\n//! appeared within the TTL, or because the block it was processed in has finalized. This is the terminal state of\n//! this process.\n//!\n//! ## Transitions (each evaluated by [`OffchainReception::step`])\n//!\n//! - **Received -> Processed**: the originating transaction is found onchain. The message (packaged with its\n//! transaction context) is queued to have its actual contents processed (which can lead for example to the discovery\n//! of notes and events).\n//! - **Processed -> Received**: the block where the message transaction was originally found is re-orged out.\n//! - **Received -> Terminated**: the message TTL has elapsed (see below), so the originating transaction can no longer\n//! appear and the message is no longer processable.\n//! - **Processed -> Terminated**: the block the originating transaction was found in has finalized, so the effects of\n//! its processing are permanent and reorg-proof.\n//!\n//! # Message reception lifecycle and the TTL\n//!\n//! A reception expires once `now > anchor_block_timestamp + MAX_MSG_TTL`, where `MAX_MSG_TTL = MAX_TX_LIFETIME + 2h`.\n//! A transaction anchored at a given block can only be mined within\n//! [`MAX_TX_LIFETIME`](crate::protocol::constants::MAX_TX_LIFETIME) of that block, so once that\n//! window (plus a safety margin of 2 hours) has elapsed the originating transaction can no longer appear, and it is\n//! safe to stop looking for it.\n//!\n//! The TTL only matters for unprocessed messages. Already-processed message receptions complete when the block that\n//! included the originating transaction finalizes, which is exactly when the processing becomes reorg-proof.\n//!\n//! # Current limitations, future plans\n//!\n//! - Tx-less messages never reach `Processed` and are only ever removed by expiry. This will be supported in the\n//! future.\n//!\n//! # Implementation\n//!\n//! [`OffchainReception::init`] creates a [fact collection](crate::facts::FactCollection) of type\n//! `OFFCHAIN_RECEPTION_TYPE_ID`. The fact collection is identified by a hash of the `OffchainMessage` it tracks, which\n//! makes duplicate calls to `init` idempotent.\n//!\n//! Upon reception, an `OFFCHAIN_MESSAGE_RECEIVED` [non-retractable fact](crate::facts::record_non_retractable_fact) is\n//! recorded. The fact's payload is the `OffchainMessage` itself, which persists it to be subsequently processed.\n//! A fact collection with just an `OFFCHAIN_MESSAGE_RECEIVED` fact represents an active reception process in the\n//! RECEIVED state from our state chart above.\n//!\n//! The message reception state machine is driven externally, advancing one step at a time each time\n//! [`OffchainReception::step`] is invoked. [`OffchainReception::step`] implements the rest of the reception state\n//! machine described above.\n//!\n//! When stepping, if the transaction to the message is found onchain, an `OFFCHAIN_MESSAGE_PROCESSED`\n//! [retractable fact](crate::facts::record_retractable_fact) associated to the block where the transaction was found is\n//! recorded.\n//! Note that since this fact is retractable, a reorg dropping said block would result in the fact being automatically\n//! removed by PXE, effectively pushing the reception process back to `RECEIVED` state.\n//!\n//! To determine in which state of the reception process we are we just analyze the recorded facts:\n//!\n//! - If there is an `OFFCHAIN_MESSAGE_PROCESSED` fact we are in PROCESSED state. Once that fact's origin block has\n//! finalized the processing is reorg-proof, so the [fact collection](crate::facts::FactCollection) can (and should)\n//! be deleted; until then there is nothing to do.\n//! - If there is only an `OFFCHAIN_MESSAGE_RECEIVED` fact we are in RECEIVED state, so we check if the message\n//! transaction is now available onchain, and if so, exercise the RECEIVED->PROCESSED transition. Otherwise, once the\n//! TTL has elapsed the originating transaction can no longer appear and the collection can (and should) be deleted.\n//!\n//! The PROCESSED->RECEIVED transition is transparently handled by PXE: if a re-org caused the message transaction to\n//! fall off the chain, the `OFFCHAIN_MESSAGE_PROCESSED` fact disappears, taking us back to the RECEIVED state.\n\nuse crate::{\n ephemeral::EphemeralArray,\n facts::{\n delete_fact_collection, Fact, FactCollection, get_fact_collection, get_fact_collections_by_type,\n record_non_retractable_fact, record_retractable_fact,\n },\n messages::processing::OffchainMessageWithTx,\n oracle::{block_reference::BlockReference, tx_resolution::ResolvedTx},\n protocol::{\n address::AztecAddress,\n constants::MAX_TX_LIFETIME,\n hash::{poseidon2_hash, sha256_to_field},\n traits::{Deserialize, Serialize},\n },\n};\nuse super::OffchainMessage;\n\n/// Maximum time-to-live for a tx-bound offchain message.\n///\n/// After `anchor_block_timestamp + MAX_MSG_TTL`, the message is evicted from the inbox.\n/// (7200 == 2 hours)\npub(crate) global MAX_MSG_TTL: u64 = MAX_TX_LIFETIME + 7200;\n\n/// Maximum amount by which a received message's `anchor_block_timestamp` may exceed our current timestamp.\n///\n/// A message's anchor is the timestamp of the block the sender anchored its originating tx to, so for a genuine\n/// message it is at or before our own anchor timestamp. Our PXE may lag the chain tip though, which can make a\n/// legitimate anchor appear to be in our future, so we tolerate a forward skew of `MAX_TX_LIFETIME` (the longest a tx\n/// can wait to be mined after its anchor) plus a 2h margin. A larger skew would mean our view trails the tip by more\n/// than a tx lifetime -- so far behind that we could not even build a tx that wouldn't be immediately expired -- so\n/// such a message cannot be genuine and is rejected on reception. Bounding the anchor this way also keeps accepted\n/// values near the present, which prevents the `anchor_block_timestamp + MAX_MSG_TTL` eviction check from overflowing.\n/// (7200 == 2 hours)\npub(crate) global MAX_ANCHOR_FUTURE_SKEW: u64 = MAX_TX_LIFETIME + 7200;\n\n/// Fact type id of the fact that stores the offchain message body inside a reception collection.\nglobal OFFCHAIN_MESSAGE_RECEIVED: Field = sha256_to_field(\"AZTEC_NR::OFFCHAIN_MESSAGE_RECEIVED\".as_bytes());\n\n/// Fact type id to mark an offchain message as processed.\n///\n/// A reception is in \"processed state\" exactly when its collection carries a fact of this type.\npub(crate) global OFFCHAIN_MESSAGE_PROCESSED: Field =\n sha256_to_field(\"AZTEC_NR::OFFCHAIN_MESSAGE_PROCESSED\".as_bytes());\n\n/// Fact-collection type id shared by every offchain message reception in the [fact store](crate::facts).\npub(crate) global OFFCHAIN_RECEPTION_TYPE_ID: Field =\n sha256_to_field(\"AZTEC_NR::OFFCHAIN_RECEPTION_TYPE_ID\".as_bytes());\n\n/// A single offchain message reception machine, backed by a [`FactCollection`](crate::facts::FactCollection).\n///\n/// Wraps the fact collection that tracks one message's progress through the reception state machine (see the\n/// [module documentation](super)); the [`OffchainMessage`] it carries is decoded on demand.\n#[derive(Deserialize, Serialize)]\npub(crate) struct OffchainReception {\n collection: FactCollection,\n}\n\nimpl OffchainReception {\n /// Initializes a new reception for a freshly received message, in the `Received` state.\n ///\n /// Re-initializing the same message is a no-op, which makes redelivery idempotent.\n pub(crate) unconstrained fn init(contract_address: AztecAddress, message: OffchainMessage) {\n record_non_retractable_fact(\n contract_address,\n message.recipient,\n OFFCHAIN_RECEPTION_TYPE_ID,\n Self::id_for(message),\n OFFCHAIN_MESSAGE_RECEIVED,\n to_payload(message),\n );\n }\n\n /// Loads every active reception for the given contract and scope, decoding each message body.\n pub(crate) unconstrained fn load_all(\n contract_address: AztecAddress,\n scope: AztecAddress,\n ) -> EphemeralArray<OffchainReception> {\n get_fact_collections_by_type(contract_address, scope, OFFCHAIN_RECEPTION_TYPE_ID)\n .map(|collection: FactCollection| OffchainReception { collection })\n }\n\n /// Reads and returns the message this reception carries, decoding it from its fact collection.\n pub(crate) unconstrained fn read_message(self) -> OffchainMessage {\n let message_fact = self.collection.facts.find(|f: Fact| f.fact_type_id == OFFCHAIN_MESSAGE_RECEIVED).unwrap();\n let n = <OffchainMessage as Deserialize>::N;\n let mut fields = [0; <OffchainMessage as Deserialize>::N];\n for i in 0..n {\n fields[i] = message_fact.payload.get(i);\n }\n Deserialize::deserialize(fields)\n }\n\n /// Computes the fact-collection id that identifies a message's reception machine in the [fact store](crate::facts).\n ///\n /// The id is a hash of the message, which makes duplicate receptions of the same message collapse onto a single\n /// reception.\n pub(crate) fn id_for(message: OffchainMessage) -> Field {\n poseidon2_hash(message.serialize())\n }\n\n /// Returns `true` if a reception for `message` is currently active for the given contract and scope.\n pub(crate) unconstrained fn is_active(\n contract_address: AztecAddress,\n scope: AztecAddress,\n message: OffchainMessage,\n ) -> bool {\n get_fact_collection(\n contract_address,\n scope,\n OFFCHAIN_RECEPTION_TYPE_ID,\n Self::id_for(message),\n )\n .is_some()\n }\n\n /// Advances this reception by one step of its state machine. See the [module documentation](super) for the\n /// states, transitions, and expiry rules.\n ///\n /// Returns `Some` with the message and its resolved context when this step determines the message is ready to be\n /// processed.\n pub(crate) unconstrained fn step(\n self,\n maybe_resolved_tx: Option<ResolvedTx>,\n now: u64,\n ) -> Option<OffchainMessageWithTx> {\n let message = self.read_message();\n let processed_fact = self.collection.facts.find(|f: Fact| f.fact_type_id == OFFCHAIN_MESSAGE_PROCESSED);\n\n if processed_fact.is_none() & maybe_resolved_tx.is_some() {\n // Received -> Processed: the originating tx is onchain.\n let resolved = maybe_resolved_tx.unwrap();\n self.mark_processed(resolved.block_number, resolved.block_hash);\n Option::some(\n OffchainMessageWithTx { message_ciphertext: message.ciphertext, resolved_tx: resolved },\n )\n } else if processed_fact.is_some() {\n if processed_fact.unwrap().origin_block.unwrap().block_state.is_finalized() {\n // Processed -> Terminated: once the marker's origin block finalizes, the processing is reorg-proof and\n // the reception is complete. Until then we wait: a reorg dropping that block removes the retractable\n // marker and PXE pushes us back to Received.\n self.terminate();\n }\n Option::none()\n } else {\n // Received -> Terminated: the TTL caps how long we keep looking for the originating tx.\n if now > message.anchor_block_timestamp + MAX_MSG_TTL {\n self.terminate();\n }\n Option::none()\n }\n }\n\n /// Returns `true` if the reception for `message` has been marked processed.\n pub(crate) unconstrained fn is_processed(\n contract_address: AztecAddress,\n scope: AztecAddress,\n message: OffchainMessage,\n ) -> bool {\n let maybe_collection = get_fact_collection(\n contract_address,\n scope,\n OFFCHAIN_RECEPTION_TYPE_ID,\n Self::id_for(message),\n );\n if maybe_collection.is_some() {\n maybe_collection.unwrap().facts.any(|f: Fact| f.fact_type_id == OFFCHAIN_MESSAGE_PROCESSED)\n } else {\n false\n }\n }\n\n /// Records the retractable processed marker for this reception, originated at the resolved block.\n unconstrained fn mark_processed(self, block_number: u32, block_hash: Field) {\n let empty_payload: EphemeralArray<Field> = EphemeralArray::empty();\n record_retractable_fact(\n self.collection.contract_address,\n self.collection.scope,\n self.collection.fact_collection_type_id,\n self.collection.fact_collection_id,\n OFFCHAIN_MESSAGE_PROCESSED,\n empty_payload,\n BlockReference { block_number, block_hash },\n );\n }\n\n /// Terminates this reception by deleting its [fact collection](crate::facts::FactCollection).\n unconstrained fn terminate(self) {\n delete_fact_collection(\n self.collection.contract_address,\n self.collection.scope,\n self.collection.fact_collection_type_id,\n self.collection.fact_collection_id,\n );\n }\n}\n\n/// Serializes an [`OffchainMessage`] into a fact payload.\nunconstrained fn to_payload(message: OffchainMessage) -> EphemeralArray<Field> {\n EphemeralArray::from_array(message.serialize())\n}\n\nmod test {\n use crate::{\n messages::processing::offchain::OffchainMessage,\n oracle::{random::random, tx_resolution::ResolvedTx},\n protocol::address::AztecAddress,\n test::helpers::test_environment::TestEnvironment,\n };\n use super::{MAX_MSG_TTL, OffchainReception};\n\n unconstrained fn setup() -> (TestEnvironment, AztecAddress) {\n let mut env = TestEnvironment::new();\n let scope = env.create_light_account();\n (env, scope)\n }\n\n /// Creates an `OffchainMessage` with dummy ciphertext and the given scope as recipient.\n fn make_msg(recipient: AztecAddress, tx_hash: Option<Field>, anchor_block_timestamp: u64) -> OffchainMessage {\n OffchainMessage { ciphertext: BoundedVec::new(), recipient, tx_hash, anchor_block_timestamp }\n }\n\n /// Builds the resolved-tx context PXE would return for `tx_hash`, found in `block_number`.\n fn resolved_tx_at_block(tx_hash: Field, block_number: u32) -> ResolvedTx {\n ResolvedTx {\n tx_hash,\n unique_note_hashes_in_tx: BoundedVec::new(),\n first_nullifier_in_tx: 0,\n block_number,\n block_hash: 0,\n }\n }\n\n /// Builds a resolved-tx context found in a low block, which TXE (proven == finalized == latest) reports as\n /// `Finalized`.\n fn resolved_tx(tx_hash: Field) -> ResolvedTx {\n resolved_tx_at_block(tx_hash, 1)\n }\n\n #[test]\n unconstrained fn expired_reception_is_terminated() {\n let (env, scope) = setup();\n let msg = make_msg(scope, Option::some(random()), 0);\n\n env.utility_context(|context| {\n let address = context.this_address();\n OffchainReception::init(address, msg);\n let reception = OffchainReception::load_all(address, scope).get(0);\n\n // Past the TTL with no resolved tx: the reception is terminated.\n assert(reception.step(Option::none(), MAX_MSG_TTL + 1).is_none());\n assert(!OffchainReception::is_active(address, scope, msg), \"expired reception should be terminated\");\n });\n }\n\n #[test]\n unconstrained fn unresolved_reception_stays_active() {\n let (env, scope) = setup();\n let msg = make_msg(scope, Option::some(random()), 0);\n\n env.utility_context(|context| {\n let address = context.this_address();\n OffchainReception::init(address, msg);\n let reception = OffchainReception::load_all(address, scope).get(0);\n\n // Within the TTL with no resolved tx: nothing to process, the reception stays.\n assert(reception.step(Option::none(), 100).is_none());\n assert(OffchainReception::is_active(address, scope, msg), \"unresolved reception should stay active\");\n assert(!OffchainReception::is_processed(address, scope, msg), \"should still be unprocessed\");\n });\n }\n\n #[test]\n unconstrained fn resolved_reception_is_ready_to_process() {\n let (env, scope) = setup();\n let tx_hash = random();\n let msg = make_msg(scope, Option::some(tx_hash), 0);\n\n env.utility_context(|context| {\n let address = context.this_address();\n OffchainReception::init(address, msg);\n let reception = OffchainReception::load_all(address, scope).get(0);\n\n // A resolved tx within the TTL: the message is handed off with its tx context attached.\n let processable = reception.step(Option::some(resolved_tx(tx_hash)), 100);\n assert(processable.is_some());\n assert_eq(processable.unwrap().resolved_tx.tx_hash, tx_hash);\n\n // It stays active for reorg safety and is now marked processed.\n assert(OffchainReception::is_active(address, scope, msg), \"processed reception should stay active\");\n assert(OffchainReception::is_processed(address, scope, msg), \"should be processed\");\n });\n }\n\n #[test]\n unconstrained fn already_processed_reception_is_not_re_pushed() {\n let (env, scope) = setup();\n let tx_hash = random();\n let msg = make_msg(scope, Option::some(tx_hash), 0);\n // A future origin block stays unfinalized, so the reception lingers in Processed across steps.\n let future_block = env.last_block_number() + 100;\n\n env.utility_context(|context| {\n let address = context.this_address();\n OffchainReception::init(address, msg);\n\n // First step processes the message.\n let reception = OffchainReception::load_all(address, scope).get(0);\n assert(reception.step(Option::some(resolved_tx_at_block(tx_hash, future_block)), 100).is_some());\n assert(OffchainReception::is_processed(address, scope, msg), \"should be processed\");\n\n // Second step (still resolved, not finalized) recognizes it as processed and does not re-push it.\n let reloaded = OffchainReception::load_all(address, scope).get(0);\n assert(\n reloaded.step(Option::some(resolved_tx_at_block(tx_hash, future_block)), 100).is_none(),\n \"already processed\",\n );\n assert(OffchainReception::is_active(address, scope, msg), \"processed reception should still be active\");\n });\n }\n\n #[test]\n unconstrained fn processed_reception_terminates_once_its_origin_block_finalizes() {\n let (env, scope) = setup();\n let tx_hash = random();\n let msg = make_msg(scope, Option::some(tx_hash), 0);\n\n env.utility_context(|context| {\n let address = context.this_address();\n OffchainReception::init(address, msg);\n\n // Process the message against a finalized block.\n let reception = OffchainReception::load_all(address, scope).get(0);\n assert(reception.step(Option::some(resolved_tx(tx_hash)), 100).is_some());\n assert(OffchainReception::is_processed(address, scope, msg), \"should be processed\");\n\n // Next step, still well within the TTL: a finalized origin block makes the processing reorg-proof, so the\n // reception terminates regardless of the TTL.\n let reloaded = OffchainReception::load_all(address, scope).get(0);\n assert(reloaded.step(Option::some(resolved_tx(tx_hash)), 100).is_none());\n assert(\n !OffchainReception::is_active(address, scope, msg),\n \"finalized processed reception should be terminated\",\n );\n });\n }\n\n #[test]\n unconstrained fn unfinalized_processed_reception_survives_past_the_ttl() {\n let (env, scope) = setup();\n let tx_hash = random();\n let msg = make_msg(scope, Option::some(tx_hash), 0);\n // A future origin block never finalizes here, so the reception must not be terminated by the TTL.\n let future_block = env.last_block_number() + 100;\n\n env.utility_context(|context| {\n let address = context.this_address();\n OffchainReception::init(address, msg);\n\n let reception = OffchainReception::load_all(address, scope).get(0);\n assert(reception.step(Option::some(resolved_tx_at_block(tx_hash, future_block)), 100).is_some());\n assert(OffchainReception::is_processed(address, scope, msg), \"should be processed\");\n\n // Past the TTL, but the origin block has not finalized: the reception stays active. The TTL no longer\n // governs an already-processed reception.\n let reloaded = OffchainReception::load_all(address, scope).get(0);\n assert(reloaded.step(Option::some(resolved_tx_at_block(tx_hash, future_block)), MAX_MSG_TTL + 1).is_none());\n assert(\n OffchainReception::is_active(address, scope, msg),\n \"unfinalized processed reception should survive past the TTL\",\n );\n });\n }\n\n #[test]\n unconstrained fn expired_reception_is_still_processed_when_its_tx_resolves() {\n let (env, scope) = setup();\n let tx_hash = random();\n let msg = make_msg(scope, Option::some(tx_hash), 0);\n\n env.utility_context(|context| {\n let address = context.this_address();\n OffchainReception::init(address, msg);\n\n // Even past the TTL, a freshly resolved tx is still handed off: expiry only caps the search for the\n // originating tx, it does not pre-empt processing once that tx is found.\n let reception = OffchainReception::load_all(address, scope).get(0);\n assert(reception.step(Option::some(resolved_tx(tx_hash)), MAX_MSG_TTL + 1).is_some());\n assert(OffchainReception::is_processed(address, scope, msg), \"should be processed\");\n assert(OffchainReception::is_active(address, scope, msg), \"just-processed reception should stay active\");\n });\n }\n}\n"
|
|
188
|
+
"path": "/mnt/user-data/nicov/node-3/noir-projects/aztec-nr/aztec/src/messages/processing/offchain/reception.nr",
|
|
189
|
+
"source": "//! The state machine of a single offchain message reception process.\n//!\n//! Offchain processing needs to handle some complexity, including the possibility of reorgs reverting message effects,\n//! and the need to reprocess messages in that case. The state chart below summarizes the current behavior.\n//!\n//! ```text\n//! offchain_receive() (process starts)\n//! |\n//! v\n//! +-----------+ tx found onchain +-----------+\n//! ---- | | --------------------------> | |\n//! tx not found | | | | | discover notes,\n//! |--> | RECEIVED | | PROCESSED | ~~> events, etc\n//! | | <-------------------------- | |\n//! | | tx block re-orged | |\n//! +-----------+ +-----------+\n//! | |\n//! | TTL expired | tx block finalized\n//! v v\n//! +---------------------------------------------------------+\n//! | TERMINATED (process ends) |\n//! +---------------------------------------------------------+\n//! ```\n//!\n//! ## States\n//!\n//! - **Received**: the message is stored but its originating transaction has not been found onchain yet (or the\n//! message is tx-less; see below). While the reception process is in this state, it keeps looking for the\n// transaction onchain.\n//! - **Processed**: the message has been handed off for processing. If there weren't reorgs, reaching this state would\n//! be equivalent to terminating the reception process. Since reorgs are a possibility, this state is not terminal\n//! until the block the originating transaction was found in finalizes.\n//! - **Terminated**: nothing else can be done with the message, either because its originating transaction never\n//! appeared within the TTL, or because the block it was processed in has finalized. This is the terminal state of\n//! this process.\n//!\n//! ## Transitions (each evaluated by [`OffchainReception::step`])\n//!\n//! - **Received -> Processed**: the originating transaction is found onchain. The message (packaged with its\n//! transaction context) is queued to have its actual contents processed (which can lead for example to the discovery\n//! of notes and events).\n//! - **Processed -> Received**: the block where the message transaction was originally found is re-orged out.\n//! - **Received -> Terminated**: the message TTL has elapsed (see below), so the originating transaction can no longer\n//! appear and the message is no longer processable.\n//! - **Processed -> Terminated**: the block the originating transaction was found in has finalized, so the effects of\n//! its processing are permanent and reorg-proof.\n//!\n//! # Message reception lifecycle and the TTL\n//!\n//! A reception expires once `now > anchor_block_timestamp + MAX_MSG_TTL`, where `MAX_MSG_TTL = MAX_TX_LIFETIME + 2h`.\n//! A transaction anchored at a given block can only be mined within\n//! [`MAX_TX_LIFETIME`](crate::protocol::constants::MAX_TX_LIFETIME) of that block, so once that\n//! window (plus a safety margin of 2 hours) has elapsed the originating transaction can no longer appear, and it is\n//! safe to stop looking for it.\n//!\n//! The TTL only matters for unprocessed messages. Already-processed message receptions complete when the block that\n//! included the originating transaction finalizes, which is exactly when the processing becomes reorg-proof.\n//!\n//! # Current limitations, future plans\n//!\n//! - Tx-less messages never reach `Processed` and are only ever removed by expiry. This will be supported in the\n//! future.\n//!\n//! # Implementation\n//!\n//! [`OffchainReception::init`] creates a [fact collection](crate::facts::FactCollection) of type\n//! `OFFCHAIN_RECEPTION_TYPE_ID`. The fact collection is identified by a hash of the `OffchainMessage` it tracks, which\n//! makes duplicate calls to `init` idempotent.\n//!\n//! Upon reception, an `OFFCHAIN_MESSAGE_RECEIVED` [non-retractable fact](crate::facts::record_non_retractable_fact) is\n//! recorded. The fact's payload is the `OffchainMessage` itself, which persists it to be subsequently processed.\n//! A fact collection with just an `OFFCHAIN_MESSAGE_RECEIVED` fact represents an active reception process in the\n//! RECEIVED state from our state chart above.\n//!\n//! The message reception state machine is driven externally, advancing one step at a time each time\n//! [`OffchainReception::step`] is invoked. [`OffchainReception::step`] implements the rest of the reception state\n//! machine described above.\n//!\n//! When stepping, if the transaction to the message is found onchain, an `OFFCHAIN_MESSAGE_PROCESSED`\n//! [retractable fact](crate::facts::record_retractable_fact) associated to the block where the transaction was found is\n//! recorded.\n//! Note that since this fact is retractable, a reorg dropping said block would result in the fact being automatically\n//! removed by PXE, effectively pushing the reception process back to `RECEIVED` state.\n//!\n//! To determine in which state of the reception process we are we just analyze the recorded facts:\n//!\n//! - If there is an `OFFCHAIN_MESSAGE_PROCESSED` fact we are in PROCESSED state. Once that fact's origin block has\n//! finalized the processing is reorg-proof, so the [fact collection](crate::facts::FactCollection) can (and should)\n//! be deleted; until then there is nothing to do.\n//! - If there is only an `OFFCHAIN_MESSAGE_RECEIVED` fact we are in RECEIVED state, so we check if the message\n//! transaction is now available onchain, and if so, exercise the RECEIVED->PROCESSED transition. Otherwise, once the\n//! TTL has elapsed the originating transaction can no longer appear and the collection can (and should) be deleted.\n//!\n//! The PROCESSED->RECEIVED transition is transparently handled by PXE: if a re-org caused the message transaction to\n//! fall off the chain, the `OFFCHAIN_MESSAGE_PROCESSED` fact disappears, taking us back to the RECEIVED state.\n\nuse crate::{\n ephemeral::EphemeralArray,\n facts::{\n delete_fact_collection, Fact, FactCollection, FactScope, get_fact_collection, get_fact_collections_by_type,\n record_non_retractable_fact, record_retractable_fact,\n },\n messages::processing::OffchainMessageWithTx,\n oracle::{block_reference::BlockReference, tx_resolution::ResolvedTx},\n protocol::{\n address::AztecAddress,\n constants::MAX_TX_LIFETIME,\n hash::{poseidon2_hash, sha256_to_field},\n traits::{Deserialize, Serialize},\n },\n};\nuse super::OffchainMessage;\n\n/// Maximum time-to-live for a tx-bound offchain message.\n///\n/// After `anchor_block_timestamp + MAX_MSG_TTL`, the message is evicted from the inbox.\n/// (7200 == 2 hours)\npub(crate) global MAX_MSG_TTL: u64 = MAX_TX_LIFETIME + 7200;\n\n/// Maximum amount by which a received message's `anchor_block_timestamp` may exceed our current timestamp.\n///\n/// A message's anchor is the timestamp of the block the sender anchored its originating tx to, so for a genuine\n/// message it is at or before our own anchor timestamp. Our PXE may lag the chain tip though, which can make a\n/// legitimate anchor appear to be in our future, so we tolerate a forward skew of `MAX_TX_LIFETIME` (the longest a tx\n/// can wait to be mined after its anchor) plus a 2h margin. A larger skew would mean our view trails the tip by more\n/// than a tx lifetime -- so far behind that we could not even build a tx that wouldn't be immediately expired -- so\n/// such a message cannot be genuine and is rejected on reception. Bounding the anchor this way also keeps accepted\n/// values near the present, which prevents the `anchor_block_timestamp + MAX_MSG_TTL` eviction check from overflowing.\n/// (7200 == 2 hours)\npub(crate) global MAX_ANCHOR_FUTURE_SKEW: u64 = MAX_TX_LIFETIME + 7200;\n\n/// Fact type id of the fact that stores the offchain message body inside a reception collection.\nglobal OFFCHAIN_MESSAGE_RECEIVED: Field = sha256_to_field(\"AZTEC_NR::OFFCHAIN_MESSAGE_RECEIVED\".as_bytes());\n\n/// Fact type id to mark an offchain message as processed.\n///\n/// A reception is in \"processed state\" exactly when its collection carries a fact of this type.\npub(crate) global OFFCHAIN_MESSAGE_PROCESSED: Field =\n sha256_to_field(\"AZTEC_NR::OFFCHAIN_MESSAGE_PROCESSED\".as_bytes());\n\n/// Fact-collection type id shared by every offchain message reception in the [fact store](crate::facts).\npub(crate) global OFFCHAIN_RECEPTION_TYPE_ID: Field =\n sha256_to_field(\"AZTEC_NR::OFFCHAIN_RECEPTION_TYPE_ID\".as_bytes());\n\n/// A single offchain message reception machine, backed by a [`FactCollection`](crate::facts::FactCollection).\n///\n/// Wraps the fact collection that tracks one message's progress through the reception state machine (see the\n/// [module documentation](super)); the [`OffchainMessage`] it carries is decoded on demand.\n#[derive(Deserialize, Serialize)]\npub(crate) struct OffchainReception {\n collection: FactCollection,\n}\n\nimpl OffchainReception {\n /// Initializes a new reception for a freshly received message, in the `Received` state.\n ///\n /// Re-initializing the same message is a no-op, which makes redelivery idempotent.\n pub(crate) unconstrained fn init(contract_address: AztecAddress, message: OffchainMessage) {\n record_non_retractable_fact(\n contract_address,\n FactScope::account(message.recipient),\n OFFCHAIN_RECEPTION_TYPE_ID,\n Self::id_for(message),\n OFFCHAIN_MESSAGE_RECEIVED,\n to_payload(message),\n );\n }\n\n /// Loads every active reception for the given contract and scope, decoding each message body.\n pub(crate) unconstrained fn load_all(\n contract_address: AztecAddress,\n scope: AztecAddress,\n ) -> EphemeralArray<OffchainReception> {\n get_fact_collections_by_type(\n contract_address,\n FactScope::account(scope),\n OFFCHAIN_RECEPTION_TYPE_ID,\n )\n .map(|collection: FactCollection| OffchainReception { collection })\n }\n\n /// Reads and returns the message this reception carries, decoding it from its fact collection.\n pub(crate) unconstrained fn read_message(self) -> OffchainMessage {\n let message_fact = self.collection.facts.find(|f: Fact| f.fact_type_id == OFFCHAIN_MESSAGE_RECEIVED).unwrap();\n let n = <OffchainMessage as Deserialize>::N;\n let mut fields = [0; <OffchainMessage as Deserialize>::N];\n for i in 0..n {\n fields[i] = message_fact.payload.get(i);\n }\n Deserialize::deserialize(fields)\n }\n\n /// Computes the fact-collection id that identifies a message's reception machine in the [fact store](crate::facts).\n ///\n /// The id is a hash of the message, which makes duplicate receptions of the same message collapse onto a single\n /// reception.\n pub(crate) fn id_for(message: OffchainMessage) -> Field {\n poseidon2_hash(message.serialize())\n }\n\n /// Returns `true` if a reception for `message` is currently active for the given contract and scope.\n pub(crate) unconstrained fn is_active(\n contract_address: AztecAddress,\n scope: AztecAddress,\n message: OffchainMessage,\n ) -> bool {\n get_fact_collection(\n contract_address,\n FactScope::account(scope),\n OFFCHAIN_RECEPTION_TYPE_ID,\n Self::id_for(message),\n )\n .is_some()\n }\n\n /// Advances this reception by one step of its state machine. See the [module documentation](super) for the\n /// states, transitions, and expiry rules.\n ///\n /// Returns `Some` with the message and its resolved context when this step determines the message is ready to be\n /// processed.\n pub(crate) unconstrained fn step(\n self,\n maybe_resolved_tx: Option<ResolvedTx>,\n now: u64,\n ) -> Option<OffchainMessageWithTx> {\n let message = self.read_message();\n let processed_fact = self.collection.facts.find(|f: Fact| f.fact_type_id == OFFCHAIN_MESSAGE_PROCESSED);\n\n if processed_fact.is_none() & maybe_resolved_tx.is_some() {\n // Received -> Processed: the originating tx is onchain.\n let resolved = maybe_resolved_tx.unwrap();\n self.mark_processed(resolved.block_number, resolved.block_hash);\n Option::some(\n OffchainMessageWithTx { message_ciphertext: message.ciphertext, resolved_tx: resolved },\n )\n } else if processed_fact.is_some() {\n if processed_fact.unwrap().origin_block.unwrap().block_state.is_finalized() {\n // Processed -> Terminated: once the marker's origin block finalizes, the processing is reorg-proof and\n // the reception is complete. Until then we wait: a reorg dropping that block removes the retractable\n // marker and PXE pushes us back to Received.\n self.terminate();\n }\n Option::none()\n } else {\n // Received -> Terminated: the TTL caps how long we keep looking for the originating tx.\n if now > message.anchor_block_timestamp + MAX_MSG_TTL {\n self.terminate();\n }\n Option::none()\n }\n }\n\n /// Returns `true` if the reception for `message` has been marked processed.\n pub(crate) unconstrained fn is_processed(\n contract_address: AztecAddress,\n scope: AztecAddress,\n message: OffchainMessage,\n ) -> bool {\n let maybe_collection = get_fact_collection(\n contract_address,\n FactScope::account(scope),\n OFFCHAIN_RECEPTION_TYPE_ID,\n Self::id_for(message),\n );\n if maybe_collection.is_some() {\n maybe_collection.unwrap().facts.any(|f: Fact| f.fact_type_id == OFFCHAIN_MESSAGE_PROCESSED)\n } else {\n false\n }\n }\n\n /// Records the retractable processed marker for this reception, originated at the resolved block.\n unconstrained fn mark_processed(self, block_number: u32, block_hash: Field) {\n let empty_payload: EphemeralArray<Field> = EphemeralArray::empty();\n record_retractable_fact(\n self.collection.contract_address,\n self.collection.scope,\n self.collection.fact_collection_type_id,\n self.collection.fact_collection_id,\n OFFCHAIN_MESSAGE_PROCESSED,\n empty_payload,\n BlockReference { block_number, block_hash },\n );\n }\n\n /// Terminates this reception by deleting its [fact collection](crate::facts::FactCollection).\n unconstrained fn terminate(self) {\n delete_fact_collection(\n self.collection.contract_address,\n self.collection.scope,\n self.collection.fact_collection_type_id,\n self.collection.fact_collection_id,\n );\n }\n}\n\n/// Serializes an [`OffchainMessage`] into a fact payload.\nunconstrained fn to_payload(message: OffchainMessage) -> EphemeralArray<Field> {\n EphemeralArray::from_array(message.serialize())\n}\n\nmod test {\n use crate::{\n messages::processing::offchain::OffchainMessage,\n oracle::{random::random, tx_resolution::ResolvedTx},\n protocol::address::AztecAddress,\n test::helpers::test_environment::TestEnvironment,\n };\n use super::{MAX_MSG_TTL, OffchainReception};\n\n unconstrained fn setup() -> (TestEnvironment, AztecAddress) {\n let mut env = TestEnvironment::new();\n let scope = env.create_light_account();\n (env, scope)\n }\n\n /// Creates an `OffchainMessage` with dummy ciphertext and the given scope as recipient.\n fn make_msg(recipient: AztecAddress, tx_hash: Option<Field>, anchor_block_timestamp: u64) -> OffchainMessage {\n OffchainMessage { ciphertext: BoundedVec::new(), recipient, tx_hash, anchor_block_timestamp }\n }\n\n /// Builds the resolved-tx context PXE would return for `tx_hash`, found in `block_number`.\n fn resolved_tx_at_block(tx_hash: Field, block_number: u32) -> ResolvedTx {\n ResolvedTx {\n tx_hash,\n unique_note_hashes_in_tx: BoundedVec::new(),\n first_nullifier_in_tx: 0,\n block_number,\n block_hash: 0,\n }\n }\n\n /// Builds a resolved-tx context found in a low block, which TXE (proven == finalized == latest) reports as\n /// `Finalized`.\n fn resolved_tx(tx_hash: Field) -> ResolvedTx {\n resolved_tx_at_block(tx_hash, 1)\n }\n\n #[test]\n unconstrained fn expired_reception_is_terminated() {\n let (env, scope) = setup();\n let msg = make_msg(scope, Option::some(random()), 0);\n\n env.utility_context(|context| {\n let address = context.this_address();\n OffchainReception::init(address, msg);\n let reception = OffchainReception::load_all(address, scope).get(0);\n\n // Past the TTL with no resolved tx: the reception is terminated.\n assert(reception.step(Option::none(), MAX_MSG_TTL + 1).is_none());\n assert(!OffchainReception::is_active(address, scope, msg), \"expired reception should be terminated\");\n });\n }\n\n #[test]\n unconstrained fn unresolved_reception_stays_active() {\n let (env, scope) = setup();\n let msg = make_msg(scope, Option::some(random()), 0);\n\n env.utility_context(|context| {\n let address = context.this_address();\n OffchainReception::init(address, msg);\n let reception = OffchainReception::load_all(address, scope).get(0);\n\n // Within the TTL with no resolved tx: nothing to process, the reception stays.\n assert(reception.step(Option::none(), 100).is_none());\n assert(OffchainReception::is_active(address, scope, msg), \"unresolved reception should stay active\");\n assert(!OffchainReception::is_processed(address, scope, msg), \"should still be unprocessed\");\n });\n }\n\n #[test]\n unconstrained fn resolved_reception_is_ready_to_process() {\n let (env, scope) = setup();\n let tx_hash = random();\n let msg = make_msg(scope, Option::some(tx_hash), 0);\n\n env.utility_context(|context| {\n let address = context.this_address();\n OffchainReception::init(address, msg);\n let reception = OffchainReception::load_all(address, scope).get(0);\n\n // A resolved tx within the TTL: the message is handed off with its tx context attached.\n let processable = reception.step(Option::some(resolved_tx(tx_hash)), 100);\n assert(processable.is_some());\n assert_eq(processable.unwrap().resolved_tx.tx_hash, tx_hash);\n\n // It stays active for reorg safety and is now marked processed.\n assert(OffchainReception::is_active(address, scope, msg), \"processed reception should stay active\");\n assert(OffchainReception::is_processed(address, scope, msg), \"should be processed\");\n });\n }\n\n #[test]\n unconstrained fn already_processed_reception_is_not_re_pushed() {\n let (env, scope) = setup();\n let tx_hash = random();\n let msg = make_msg(scope, Option::some(tx_hash), 0);\n // A future origin block stays unfinalized, so the reception lingers in Processed across steps.\n let future_block = env.last_block_number() + 100;\n\n env.utility_context(|context| {\n let address = context.this_address();\n OffchainReception::init(address, msg);\n\n // First step processes the message.\n let reception = OffchainReception::load_all(address, scope).get(0);\n assert(reception.step(Option::some(resolved_tx_at_block(tx_hash, future_block)), 100).is_some());\n assert(OffchainReception::is_processed(address, scope, msg), \"should be processed\");\n\n // Second step (still resolved, not finalized) recognizes it as processed and does not re-push it.\n let reloaded = OffchainReception::load_all(address, scope).get(0);\n assert(\n reloaded.step(Option::some(resolved_tx_at_block(tx_hash, future_block)), 100).is_none(),\n \"already processed\",\n );\n assert(OffchainReception::is_active(address, scope, msg), \"processed reception should still be active\");\n });\n }\n\n #[test]\n unconstrained fn processed_reception_terminates_once_its_origin_block_finalizes() {\n let (env, scope) = setup();\n let tx_hash = random();\n let msg = make_msg(scope, Option::some(tx_hash), 0);\n\n env.utility_context(|context| {\n let address = context.this_address();\n OffchainReception::init(address, msg);\n\n // Process the message against a finalized block.\n let reception = OffchainReception::load_all(address, scope).get(0);\n assert(reception.step(Option::some(resolved_tx(tx_hash)), 100).is_some());\n assert(OffchainReception::is_processed(address, scope, msg), \"should be processed\");\n\n // Next step, still well within the TTL: a finalized origin block makes the processing reorg-proof, so the\n // reception terminates regardless of the TTL.\n let reloaded = OffchainReception::load_all(address, scope).get(0);\n assert(reloaded.step(Option::some(resolved_tx(tx_hash)), 100).is_none());\n assert(\n !OffchainReception::is_active(address, scope, msg),\n \"finalized processed reception should be terminated\",\n );\n });\n }\n\n #[test]\n unconstrained fn unfinalized_processed_reception_survives_past_the_ttl() {\n let (env, scope) = setup();\n let tx_hash = random();\n let msg = make_msg(scope, Option::some(tx_hash), 0);\n // A future origin block never finalizes here, so the reception must not be terminated by the TTL.\n let future_block = env.last_block_number() + 100;\n\n env.utility_context(|context| {\n let address = context.this_address();\n OffchainReception::init(address, msg);\n\n let reception = OffchainReception::load_all(address, scope).get(0);\n assert(reception.step(Option::some(resolved_tx_at_block(tx_hash, future_block)), 100).is_some());\n assert(OffchainReception::is_processed(address, scope, msg), \"should be processed\");\n\n // Past the TTL, but the origin block has not finalized: the reception stays active. The TTL no longer\n // governs an already-processed reception.\n let reloaded = OffchainReception::load_all(address, scope).get(0);\n assert(reloaded.step(Option::some(resolved_tx_at_block(tx_hash, future_block)), MAX_MSG_TTL + 1).is_none());\n assert(\n OffchainReception::is_active(address, scope, msg),\n \"unfinalized processed reception should survive past the TTL\",\n );\n });\n }\n\n #[test]\n unconstrained fn expired_reception_is_still_processed_when_its_tx_resolves() {\n let (env, scope) = setup();\n let tx_hash = random();\n let msg = make_msg(scope, Option::some(tx_hash), 0);\n\n env.utility_context(|context| {\n let address = context.this_address();\n OffchainReception::init(address, msg);\n\n // Even past the TTL, a freshly resolved tx is still handed off: expiry only caps the search for the\n // originating tx, it does not pre-empt processing once that tx is found.\n let reception = OffchainReception::load_all(address, scope).get(0);\n assert(reception.step(Option::some(resolved_tx(tx_hash)), MAX_MSG_TTL + 1).is_some());\n assert(OffchainReception::is_processed(address, scope, msg), \"should be processed\");\n assert(OffchainReception::is_active(address, scope, msg), \"just-processed reception should stay active\");\n });\n }\n}\n"
|
|
190
190
|
},
|
|
191
191
|
"17": {
|
|
192
192
|
"function_locations": [
|
|
@@ -374,7 +374,7 @@
|
|
|
374
374
|
"path": "std/hash/mod.nr",
|
|
375
375
|
"source": "// Exposed only for usage in `std::meta`\npub(crate) mod poseidon2;\n\nuse crate::default::Default;\nuse crate::embedded_curve_ops::{\n EmbeddedCurvePoint, EmbeddedCurveScalar, multi_scalar_mul, multi_scalar_mul_array_return,\n};\nuse crate::meta::derive_via;\nuse crate::static_assert;\n\n/// The size of the state accepted by the backend in `poseidon2_permutation`.\nglobal POSEIDON2_CONFIG_STATE_SIZE: u32 = poseidon2_config_state_size();\n\n#[foreign(sha256_compression)]\n// docs:start:sha256_compression\npub fn sha256_compression(input: [u32; 16], state: [u32; 8]) -> [u32; 8] {}\n// docs:end:sha256_compression\n\n#[foreign(keccakf1600)]\n// docs:start:keccakf1600\npub fn keccakf1600(input: [u64; 25]) -> [u64; 25] {}\n// docs:end:keccakf1600\n\n#[foreign(blake2s)]\n// docs:start:blake2s\npub fn blake2s<let N: u32>(input: [u8; N]) -> [u8; 32]\n// docs:end:blake2s\n{}\n\n// docs:start:blake3\npub fn blake3<let N: u32>(input: [u8; N]) -> [u8; 32]\n// docs:end:blake3\n{\n if crate::runtime::is_unconstrained() {\n // Temporary measure while Barretenberg is main proving system.\n // Please open an issue if you're working on another proving system and running into problems due to this.\n crate::static_assert(\n N <= 1024,\n \"Barretenberg cannot prove blake3 hashes with inputs larger than 1024 bytes\",\n );\n }\n __blake3(input)\n}\n\n#[foreign(blake3)]\nfn __blake3<let N: u32>(input: [u8; N]) -> [u8; 32] {}\n\n// docs:start:pedersen_commitment\npub fn pedersen_commitment<let N: u32>(input: [Field; N]) -> EmbeddedCurvePoint {\n // docs:end:pedersen_commitment\n pedersen_commitment_with_separator(input, 0)\n}\n\n#[inline_always]\npub fn pedersen_commitment_with_separator<let N: u32>(\n input: [Field; N],\n separator: u32,\n) -> EmbeddedCurvePoint {\n let mut points = [EmbeddedCurveScalar { lo: 0, hi: 0 }; N];\n for i in 0..N {\n points[i] = EmbeddedCurveScalar::from_field(input[i]);\n }\n let generators = derive_generators(\"DEFAULT_DOMAIN_SEPARATOR\".as_bytes(), separator);\n multi_scalar_mul(generators, points)\n}\n\n// docs:start:pedersen_hash\npub fn pedersen_hash<let N: u32>(input: [Field; N]) -> Field\n// docs:end:pedersen_hash\n{\n pedersen_hash_with_separator(input, 0)\n}\n\n#[no_predicates]\npub fn pedersen_hash_with_separator<let N: u32>(input: [Field; N], separator: u32) -> Field {\n let mut scalars: [EmbeddedCurveScalar; N + 1] = [EmbeddedCurveScalar { lo: 0, hi: 0 }; N + 1];\n let mut generators: [EmbeddedCurvePoint; N + 1] =\n [EmbeddedCurvePoint::point_at_infinity(); N + 1];\n crate::assert_constant(separator);\n let domain_generators: [EmbeddedCurvePoint; N] =\n derive_generators(\"DEFAULT_DOMAIN_SEPARATOR\".as_bytes(), separator);\n\n for i in 0..N {\n scalars[i] = EmbeddedCurveScalar::from_field(input[i]);\n generators[i] = domain_generators[i];\n }\n scalars[N] = EmbeddedCurveScalar { lo: N as Field, hi: 0 as Field };\n\n let length_generator: [EmbeddedCurvePoint; 1] =\n derive_generators(\"pedersen_hash_length\".as_bytes(), 0);\n generators[N] = length_generator[0];\n multi_scalar_mul_array_return(generators, scalars, true)[0].x\n}\n\n#[field(bn254)]\n#[inline_always]\npub fn derive_generators<let N: u32, let M: u32>(\n domain_separator_bytes: [u8; M],\n starting_index: u32,\n) -> [EmbeddedCurvePoint; N] {\n crate::assert_constant(domain_separator_bytes);\n crate::assert_constant(starting_index);\n __derive_generators(domain_separator_bytes, starting_index)\n}\n\n#[builtin(derive_pedersen_generators)]\n#[field(bn254)]\nfn __derive_generators<let N: u32, let M: u32>(\n domain_separator_bytes: [u8; M],\n starting_index: u32,\n) -> [EmbeddedCurvePoint; N] {}\n\npub fn poseidon2_permutation<let N: u32>(input: [Field; N]) -> [Field; N] {\n static_assert(\n N == POSEIDON2_CONFIG_STATE_SIZE,\n f\"the input length must equal the state size in the Poseidon2 config; expected {POSEIDON2_CONFIG_STATE_SIZE}, got {N}\",\n );\n poseidon2_permutation_internal(input)\n}\n\n#[foreign(poseidon2_permutation)]\nfn poseidon2_permutation_internal<let N: u32>(input: [Field; N]) -> [Field; N] {}\n\n#[foreign(poseidon2_config_state_size)]\ncomptime fn poseidon2_config_state_size() -> u32 {}\n\n// Generic hashing support.\n// Partially ported and impacted by rust.\n\n// Hash trait shall be implemented per type.\n#[derive_via(derive_hash)]\npub trait Hash {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher;\n}\n\n// docs:start:derive_hash\ncomptime fn derive_hash(s: TypeDefinition) -> Quoted {\n let name = quote { $crate::hash::Hash };\n let signature = quote { fn hash<H>(_self: Self, _state: &mut H) where H: $crate::hash::Hasher };\n let for_each_field = |name| quote { _self.$name.hash(_state); };\n crate::meta::make_trait_impl(\n s,\n name,\n signature,\n for_each_field,\n quote {},\n |fields| fields,\n )\n}\n// docs:end:derive_hash\n\n// Hasher trait shall be implemented by algorithms to provide hash-agnostic means.\n// TODO: consider making the types generic here ([u8], [Field], etc.)\npub trait Hasher {\n fn finish(self) -> Field;\n\n /// Returns the hash value without consuming the hasher.\n /// Override this for more efficient implementations that avoid copying.\n /// TODO: deprecate finish() and replace it\n fn finish_ref(&self) -> Field {\n (*self).finish()\n }\n\n fn write(&mut self, input: Field);\n}\n\n// BuildHasher is a factory trait, responsible for production of specific Hasher.\npub trait BuildHasher {\n type H: Hasher;\n\n fn build_hasher(self) -> H;\n}\n\npub struct BuildHasherDefault<H>;\n\nimpl<H> BuildHasher for BuildHasherDefault<H>\nwhere\n H: Hasher + Default,\n{\n type H = H;\n\n fn build_hasher(_self: Self) -> H {\n H::default()\n }\n}\n\nimpl<H> Default for BuildHasherDefault<H>\nwhere\n H: Hasher + Default,\n{\n fn default() -> Self {\n BuildHasherDefault {}\n }\n}\n\nimpl Hash for Field {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self);\n }\n}\n\nimpl Hash for u8 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u16 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u32 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u64 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u128 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for i8 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as u8 as Field);\n }\n}\n\nimpl Hash for i16 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as u16 as Field);\n }\n}\n\nimpl Hash for i32 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as u32 as Field);\n }\n}\n\nimpl Hash for i64 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as u64 as Field);\n }\n}\n\nimpl Hash for bool {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for () {\n fn hash<H>(_self: Self, _state: &mut H)\n where\n H: Hasher,\n {}\n}\n\nimpl<T, let N: u32> Hash for [T; N]\nwhere\n T: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n for elem in self {\n elem.hash(state);\n }\n }\n}\n\nimpl<T> Hash for [T]\nwhere\n T: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.len().hash(state);\n for elem in self {\n elem.hash(state);\n }\n }\n}\n\nimpl<A> Hash for (A,)\nwhere\n A: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n }\n}\n\nimpl<A, B> Hash for (A, B)\nwhere\n A: Hash,\n B: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n self.1.hash(state);\n }\n}\n\nimpl<A, B, C> Hash for (A, B, C)\nwhere\n A: Hash,\n B: Hash,\n C: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n self.1.hash(state);\n self.2.hash(state);\n }\n}\n\nimpl<A, B, C, D> Hash for (A, B, C, D)\nwhere\n A: Hash,\n B: Hash,\n C: Hash,\n D: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n self.1.hash(state);\n self.2.hash(state);\n self.3.hash(state);\n }\n}\n\nimpl<A, B, C, D, E> Hash for (A, B, C, D, E)\nwhere\n A: Hash,\n B: Hash,\n C: Hash,\n D: Hash,\n E: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n self.1.hash(state);\n self.2.hash(state);\n self.3.hash(state);\n self.4.hash(state);\n }\n}\n\nimpl<A, B, C, D, E, F> Hash for (A, B, C, D, E, F)\nwhere\n A: Hash,\n B: Hash,\n C: Hash,\n D: Hash,\n E: Hash,\n F: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n self.1.hash(state);\n self.2.hash(state);\n self.3.hash(state);\n self.4.hash(state);\n self.5.hash(state);\n }\n}\n\nimpl<A, B, C, D, E, F, G> Hash for (A, B, C, D, E, F, G)\nwhere\n A: Hash,\n B: Hash,\n C: Hash,\n D: Hash,\n E: Hash,\n F: Hash,\n G: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n self.1.hash(state);\n self.2.hash(state);\n self.3.hash(state);\n self.4.hash(state);\n self.5.hash(state);\n self.6.hash(state);\n }\n}\n\nimpl<A, B, C, D, E, F, G, H_> Hash for (A, B, C, D, E, F, G, H_)\nwhere\n A: Hash,\n B: Hash,\n C: Hash,\n D: Hash,\n E: Hash,\n F: Hash,\n G: Hash,\n H_: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n self.1.hash(state);\n self.2.hash(state);\n self.3.hash(state);\n self.4.hash(state);\n self.5.hash(state);\n self.6.hash(state);\n self.7.hash(state);\n }\n}\n\nimpl<A, B, C, D, E, F, G, H_, I> Hash for (A, B, C, D, E, F, G, H_, I)\nwhere\n A: Hash,\n B: Hash,\n C: Hash,\n D: Hash,\n E: Hash,\n F: Hash,\n G: Hash,\n H_: Hash,\n I: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n self.1.hash(state);\n self.2.hash(state);\n self.3.hash(state);\n self.4.hash(state);\n self.5.hash(state);\n self.6.hash(state);\n self.7.hash(state);\n self.8.hash(state);\n }\n}\n\nimpl<A, B, C, D, E, F, G, H_, I, J> Hash for (A, B, C, D, E, F, G, H_, I, J)\nwhere\n A: Hash,\n B: Hash,\n C: Hash,\n D: Hash,\n E: Hash,\n F: Hash,\n G: Hash,\n H_: Hash,\n I: Hash,\n J: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n self.1.hash(state);\n self.2.hash(state);\n self.3.hash(state);\n self.4.hash(state);\n self.5.hash(state);\n self.6.hash(state);\n self.7.hash(state);\n self.8.hash(state);\n self.9.hash(state);\n }\n}\n\nimpl<A, B, C, D, E, F, G, H_, I, J, K> Hash for (A, B, C, D, E, F, G, H_, I, J, K)\nwhere\n A: Hash,\n B: Hash,\n C: Hash,\n D: Hash,\n E: Hash,\n F: Hash,\n G: Hash,\n H_: Hash,\n I: Hash,\n J: Hash,\n K: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n self.1.hash(state);\n self.2.hash(state);\n self.3.hash(state);\n self.4.hash(state);\n self.5.hash(state);\n self.6.hash(state);\n self.7.hash(state);\n self.8.hash(state);\n self.9.hash(state);\n self.10.hash(state);\n }\n}\n\nimpl<A, B, C, D, E, F, G, H_, I, J, K, L> Hash for (A, B, C, D, E, F, G, H_, I, J, K, L)\nwhere\n A: Hash,\n B: Hash,\n C: Hash,\n D: Hash,\n E: Hash,\n F: Hash,\n G: Hash,\n H_: Hash,\n I: Hash,\n J: Hash,\n K: Hash,\n L: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n self.1.hash(state);\n self.2.hash(state);\n self.3.hash(state);\n self.4.hash(state);\n self.5.hash(state);\n self.6.hash(state);\n self.7.hash(state);\n self.8.hash(state);\n self.9.hash(state);\n self.10.hash(state);\n self.11.hash(state);\n }\n}\n\n// Some test vectors for Pedersen hash and Pedersen Commitment.\n// They have been generated using the same functions so the tests are for now useless\n// but they will be useful when we switch to Noir implementation.\n#[test]\nfn assert_pedersen() {\n assert_eq(\n pedersen_hash_with_separator([1], 1),\n 0x1b3f4b1a83092a13d8d1a59f7acb62aba15e7002f4440f2275edb99ebbc2305f,\n );\n assert_eq(\n pedersen_commitment_with_separator([1], 1),\n EmbeddedCurvePoint {\n x: 0x054aa86a73cb8a34525e5bbed6e43ba1198e860f5f3950268f71df4591bde402,\n y: 0x209dcfbf2cfb57f9f6046f44d71ac6faf87254afc7407c04eb621a6287cac126,\n },\n );\n\n assert_eq(\n pedersen_hash_with_separator([1, 2], 2),\n 0x26691c129448e9ace0c66d11f0a16d9014a9e8498ee78f4d69f0083168188255,\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2], 2),\n EmbeddedCurvePoint {\n x: 0x2e2b3b191e49541fe468ec6877721d445dcaffe41728df0a0eafeb15e87b0753,\n y: 0x2ff4482400ad3a6228be17a2af33e2bcdf41be04795f9782bd96efe7e24f8778,\n },\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3], 3),\n 0x0bc694b7a1f8d10d2d8987d07433f26bd616a2d351bc79a3c540d85b6206dbe4,\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3], 3),\n EmbeddedCurvePoint {\n x: 0x1fee4e8cf8d2f527caa2684236b07c4b1bad7342c01b0f75e9a877a71827dc85,\n y: 0x2f9fedb9a090697ab69bf04c8bc15f7385b3e4b68c849c1536e5ae15ff138fd1,\n },\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4], 4),\n 0xdae10fb32a8408521803905981a2b300d6a35e40e798743e9322b223a5eddc,\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4], 4),\n EmbeddedCurvePoint {\n x: 0x07ae3e202811e1fca39c2d81eabe6f79183978e6f12be0d3b8eda095b79bdbc9,\n y: 0x0afc6f892593db6fbba60f2da558517e279e0ae04f95758587760ba193145014,\n },\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5], 5),\n 0xfc375b062c4f4f0150f7100dfb8d9b72a6d28582dd9512390b0497cdad9c22,\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5], 5),\n EmbeddedCurvePoint {\n x: 0x1754b12bd475a6984a1094b5109eeca9838f4f81ac89c5f0a41dbce53189bb29,\n y: 0x2da030e3cfcdc7ddad80eaf2599df6692cae0717d4e9f7bfbee8d073d5d278f7,\n },\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5, 6], 6),\n 0x1696ed13dc2730062a98ac9d8f9de0661bb98829c7582f699d0273b18c86a572,\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6], 6),\n EmbeddedCurvePoint {\n x: 0x190f6c0e97ad83e1e28da22a98aae156da083c5a4100e929b77e750d3106a697,\n y: 0x1f4b60f34ef91221a0b49756fa0705da93311a61af73d37a0c458877706616fb,\n },\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5, 6, 7], 7),\n 0x128c0ff144fc66b6cb60eeac8a38e23da52992fc427b92397a7dffd71c45ede3,\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6, 7], 7),\n EmbeddedCurvePoint {\n x: 0x015441e9d29491b06563fac16fc76abf7a9534c715421d0de85d20dbe2965939,\n y: 0x1d2575b0276f4e9087e6e07c2cb75aa1baafad127af4be5918ef8a2ef2fea8fc,\n },\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5, 6, 7, 8], 8),\n 0x2f960e117482044dfc99d12fece2ef6862fba9242be4846c7c9a3e854325a55c,\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6, 7, 8], 8),\n EmbeddedCurvePoint {\n x: 0x1657737676968887fceb6dd516382ea13b3a2c557f509811cd86d5d1199bc443,\n y: 0x1f39f0cb569040105fa1e2f156521e8b8e08261e635a2b210bdc94e8d6d65f77,\n },\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5, 6, 7, 8, 9], 9),\n 0x0c96db0790602dcb166cc4699e2d306c479a76926b81c2cb2aaa92d249ec7be7,\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6, 7, 8, 9], 9),\n EmbeddedCurvePoint {\n x: 0x0a3ceae42d14914a432aa60ec7fded4af7dad7dd4acdbf2908452675ec67e06d,\n y: 0xfc19761eaaf621ad4aec9a8b2e84a4eceffdba78f60f8b9391b0bd9345a2f2,\n },\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5, 6, 7, 8, 9, 10], 10),\n 0x2cd37505871bc460a62ea1e63c7fe51149df5d0801302cf1cbc48beb8dff7e94,\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6, 7, 8, 9, 10], 10),\n EmbeddedCurvePoint {\n x: 0x2fb3f8b3d41ddde007c8c3c62550f9a9380ee546fcc639ffbb3fd30c8d8de30c,\n y: 0x300783be23c446b11a4c0fabf6c91af148937cea15fcf5fb054abf7f752ee245,\n },\n );\n}\n"
|
|
376
376
|
},
|
|
377
|
-
"
|
|
377
|
+
"192": {
|
|
378
378
|
"function_locations": [
|
|
379
379
|
{
|
|
380
380
|
"name": "call_private_function_oracle",
|
|
@@ -385,10 +385,10 @@
|
|
|
385
385
|
"start": 598
|
|
386
386
|
}
|
|
387
387
|
],
|
|
388
|
-
"path": "/
|
|
388
|
+
"path": "/mnt/user-data/nicov/node-3/noir-projects/aztec-nr/aztec/src/oracle/call_private_function.nr",
|
|
389
389
|
"source": "use crate::protocol::{abis::function_selector::FunctionSelector, address::AztecAddress};\n\n#[oracle(aztec_prv_callPrivateFunction)]\nunconstrained fn call_private_function_oracle(\n _contract_address: AztecAddress,\n _function_selector: FunctionSelector,\n _args_hash: Field,\n _start_side_effect_counter: u32,\n _is_static_call: bool,\n) -> (u32, Field) {}\n\npub unconstrained fn call_private_function_internal(\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args_hash: Field,\n start_side_effect_counter: u32,\n is_static_call: bool,\n) -> (u32, Field) {\n call_private_function_oracle(\n contract_address,\n function_selector,\n args_hash,\n start_side_effect_counter,\n is_static_call,\n )\n}\n"
|
|
390
390
|
},
|
|
391
|
-
"
|
|
391
|
+
"195": {
|
|
392
392
|
"function_locations": [
|
|
393
393
|
{
|
|
394
394
|
"name": "set_contract_sync_cache_invalid_oracle",
|
|
@@ -399,10 +399,10 @@
|
|
|
399
399
|
"start": 700
|
|
400
400
|
}
|
|
401
401
|
],
|
|
402
|
-
"path": "/
|
|
402
|
+
"path": "/mnt/user-data/nicov/node-3/noir-projects/aztec-nr/aztec/src/oracle/contract_sync.nr",
|
|
403
403
|
"source": "use crate::protocol::address::AztecAddress;\n\n#[oracle(aztec_utl_setContractSyncCacheInvalid)]\nunconstrained fn set_contract_sync_cache_invalid_oracle<let N: u32>(\n contract_address: AztecAddress,\n scopes: BoundedVec<AztecAddress, N>,\n) {}\n\n/// Forces the PXE to re-sync the given contract for a set of scopes on the next query.\n///\n/// Call this after writing data (e.g. offchain messages) that the contract's `sync_state` function needs to discover.\n/// Without invalidation, the sync cache would skip re-running `sync_state` until the next block.\npub unconstrained fn set_contract_sync_cache_invalid<let N: u32>(\n contract_address: AztecAddress,\n scopes: BoundedVec<AztecAddress, N>,\n) {\n set_contract_sync_cache_invalid_oracle(contract_address, scopes);\n}\n"
|
|
404
404
|
},
|
|
405
|
-
"
|
|
405
|
+
"197": {
|
|
406
406
|
"function_locations": [
|
|
407
407
|
{
|
|
408
408
|
"name": "get_utility_context_oracle",
|
|
@@ -413,10 +413,10 @@
|
|
|
413
413
|
"start": 786
|
|
414
414
|
}
|
|
415
415
|
],
|
|
416
|
-
"path": "/
|
|
416
|
+
"path": "/mnt/user-data/nicov/node-3/noir-projects/aztec-nr/aztec/src/oracle/execution.nr",
|
|
417
417
|
"source": "use crate::context::UtilityContext;\nuse crate::protocol::{abis::block_header::BlockHeader, address::AztecAddress};\n\n/// Wire shape of [`get_utility_context_oracle`]'s response. [`UtilityContext`] is built from it rather than returned\n/// directly so its fields stay private to its module.\n#[derive(Eq)]\npub(crate) struct UtilityContextData {\n pub(crate) block_header: BlockHeader,\n pub(crate) contract_address: AztecAddress,\n pub(crate) msg_sender: AztecAddress,\n}\n\n#[oracle(aztec_utl_getUtilityContext)]\nunconstrained fn get_utility_context_oracle() -> UtilityContextData {}\n\n/// Returns a utility context built from the global variables of anchor block and the contract address of the function\n/// being executed.\npub unconstrained fn get_utility_context() -> UtilityContext {\n UtilityContext::from(get_utility_context_oracle())\n}\n"
|
|
418
418
|
},
|
|
419
|
-
"
|
|
419
|
+
"213": {
|
|
420
420
|
"function_locations": [
|
|
421
421
|
{
|
|
422
422
|
"name": "assert_valid_public_call_data",
|
|
@@ -431,10 +431,10 @@
|
|
|
431
431
|
"start": 835
|
|
432
432
|
}
|
|
433
433
|
],
|
|
434
|
-
"path": "/
|
|
434
|
+
"path": "/mnt/user-data/nicov/node-3/noir-projects/aztec-nr/aztec/src/oracle/public_call.nr",
|
|
435
435
|
"source": "/// Validates public calldata by checking that the preimage exists and the cumulative size is within limits.\n///\n/// The check is unconstrained and the only purpose of it is to fail early in case of calldata overflow or a bug in\n/// calldata hashing.\npub(crate) fn assert_valid_public_call_data(calldata_hash: Field) {\n // Safety: This oracle call returns nothing: we only call it for its side effects (validating the calldata).\n // It is therefore always safe to call.\n unsafe {\n assert_valid_public_call_data_oracle_wrapper(calldata_hash)\n }\n}\n\nunconstrained fn assert_valid_public_call_data_oracle_wrapper(calldata_hash: Field) {\n assert_valid_public_call_data_oracle(calldata_hash)\n}\n\n#[oracle(aztec_prv_assertValidPublicCalldata)]\nunconstrained fn assert_valid_public_call_data_oracle(_calldata_hash: Field) {}\n"
|
|
436
436
|
},
|
|
437
|
-
"
|
|
437
|
+
"214": {
|
|
438
438
|
"function_locations": [
|
|
439
439
|
{
|
|
440
440
|
"name": "random",
|
|
@@ -445,10 +445,10 @@
|
|
|
445
445
|
"start": 568
|
|
446
446
|
}
|
|
447
447
|
],
|
|
448
|
-
"path": "/
|
|
448
|
+
"path": "/mnt/user-data/nicov/node-3/noir-projects/aztec-nr/aztec/src/oracle/random.nr",
|
|
449
449
|
"source": "/// Returns an unconstrained random value. Note that it is not possible to constrain this value to prove that it is\n/// truly random: we assume that the oracle is cooperating and returning random values. In some applications this\n/// behavior might not be acceptable and other techniques might be more suitable, such as producing pseudo-random\n/// values by hashing values outside of user control (like block hashes) or secrets.\npub unconstrained fn random() -> Field {\n rand_oracle()\n}\n\n#[oracle(aztec_misc_getRandomField)]\nunconstrained fn rand_oracle() -> Field {}\n"
|
|
450
450
|
},
|
|
451
|
-
"
|
|
451
|
+
"222": {
|
|
452
452
|
"function_locations": [
|
|
453
453
|
{
|
|
454
454
|
"name": "assert_compatible_oracle_version",
|
|
@@ -471,10 +471,10 @@
|
|
|
471
471
|
"start": 2136
|
|
472
472
|
}
|
|
473
473
|
],
|
|
474
|
-
"path": "/
|
|
475
|
-
"source": "/// The oracle version constants are used to check that the oracle interface is in sync between PXE and Aztec.nr.\n/// We version the oracle interface as `major.minor` where:\n/// - `major` = backward-breaking changes (must match exactly between PXE and Aztec.nr)\n/// - `minor` = oracle additions (non-breaking; PXE minor >= contract minor)\n///\n/// The TypeScript counterparts are in `oracle_version.ts`.\n///\n/// @dev Whenever a contract function or Noir test is run, the `aztec_misc_assertCompatibleOracleVersion` oracle is\n/// called. If the major version is incompatible, an error is thrown immediately. The minor version is recorded by\n/// the PXE and used to provide helpful error messages if a contract calls an oracle that doesn't exist. We don't throw\n/// immediately if AZTEC_NR_MINOR > PXE_MINOR because if a contract is updated to use a newer Aztec.nr dependency\n/// without actually using any of the new oracles then there is no reason to throw.\npub global ORACLE_VERSION_MAJOR: Field =
|
|
474
|
+
"path": "/mnt/user-data/nicov/node-3/noir-projects/aztec-nr/aztec/src/oracle/version.nr",
|
|
475
|
+
"source": "/// The oracle version constants are used to check that the oracle interface is in sync between PXE and Aztec.nr.\n/// We version the oracle interface as `major.minor` where:\n/// - `major` = backward-breaking changes (must match exactly between PXE and Aztec.nr)\n/// - `minor` = oracle additions (non-breaking; PXE minor >= contract minor)\n///\n/// The TypeScript counterparts are in `oracle_version.ts`.\n///\n/// @dev Whenever a contract function or Noir test is run, the `aztec_misc_assertCompatibleOracleVersion` oracle is\n/// called. If the major version is incompatible, an error is thrown immediately. The minor version is recorded by\n/// the PXE and used to provide helpful error messages if a contract calls an oracle that doesn't exist. We don't throw\n/// immediately if AZTEC_NR_MINOR > PXE_MINOR because if a contract is updated to use a newer Aztec.nr dependency\n/// without actually using any of the new oracles then there is no reason to throw.\npub global ORACLE_VERSION_MAJOR: Field = 33;\npub global ORACLE_VERSION_MINOR: Field = 0;\n\n/// Asserts that the version of the oracle is compatible with the version expected by the contract.\npub fn assert_compatible_oracle_version() {\n // Safety: This oracle call returns nothing: we only call it to check Aztec.nr and Oracle interface versions are\n // compatible. It is therefore always safe to call.\n unsafe {\n assert_compatible_oracle_version_wrapper();\n }\n}\n\nunconstrained fn assert_compatible_oracle_version_wrapper() {\n assert_compatible_oracle_version_oracle(ORACLE_VERSION_MAJOR, ORACLE_VERSION_MINOR);\n}\n\n#[oracle(aztec_misc_assertCompatibleOracleVersion)]\nunconstrained fn assert_compatible_oracle_version_oracle(major: Field, minor: Field) {}\n\nmod test {\n use super::{assert_compatible_oracle_version_oracle, ORACLE_VERSION_MAJOR, ORACLE_VERSION_MINOR};\n\n #[test]\n unconstrained fn compatible_oracle_version() {\n assert_compatible_oracle_version_oracle(ORACLE_VERSION_MAJOR, ORACLE_VERSION_MINOR);\n }\n\n #[test(should_fail_with = \"Incompatible aztec cli version:\")]\n unconstrained fn incompatible_oracle_version_major() {\n let arbitrary_incorrect_major = 318183437;\n assert_compatible_oracle_version_oracle(arbitrary_incorrect_major, ORACLE_VERSION_MINOR);\n }\n}\n"
|
|
476
476
|
},
|
|
477
|
-
"
|
|
477
|
+
"278": {
|
|
478
478
|
"function_locations": [
|
|
479
479
|
{
|
|
480
480
|
"name": "UnconstrainedArray<T, Oracle>::at",
|
|
@@ -545,10 +545,10 @@
|
|
|
545
545
|
"start": 8318
|
|
546
546
|
}
|
|
547
547
|
],
|
|
548
|
-
"path": "/
|
|
548
|
+
"path": "/mnt/user-data/nicov/node-3/noir-projects/aztec-nr/aztec/src/unconstrained_array/mod.nr",
|
|
549
549
|
"source": "pub(crate) mod test_helpers;\npub(crate) mod test_suite;\n\nuse crate::oracle::random::random;\nuse crate::protocol::traits::{Deserialize, Serialize};\n\n/// Oracle backend for an [`UnconstrainedArray`]: the set of PXE-side operations that implement its storage.\n///\n/// Each implementor routes these operations to a distinct family of oracles, and the oracle family determines the\n/// array's lifetime and visibility (e.g. [`EphemeralArray`](crate::ephemeral::EphemeralArray) arrays live for one\n/// contract call frame, while [`TransientArray`](crate::transient::TransientArray) arrays are shared across all frames\n/// of the same contract within one top-level PXE call).\npub(crate) trait ArrayOracles {\n /// Returns the number of elements in the array at `slot`.\n unconstrained fn len_oracle(slot: Field) -> u32;\n\n /// Appends a serialized element to the array at `slot` and returns the new length.\n unconstrained fn push_oracle<let N: u32>(slot: Field, values: [Field; N]) -> u32;\n\n /// Removes and returns the last serialized element of the array at `slot`. Implementors must panic if the\n /// array is empty.\n unconstrained fn pop_oracle<let N: u32>(slot: Field) -> [Field; N];\n\n /// Returns the serialized element at the given index of the array at `slot`. Implementors must panic if `index`\n /// is out of bounds.\n unconstrained fn get_oracle<let N: u32>(slot: Field, index: u32) -> [Field; N];\n\n /// Overwrites the serialized element at the given index of the array at `slot`. Implementors must panic if\n /// `index` is out of bounds.\n unconstrained fn set_oracle<let N: u32>(slot: Field, index: u32, values: [Field; N]);\n\n /// Removes the element at the given index of the array at `slot`, shifting subsequent elements backward.\n /// Implementors must panic if `index` is out of bounds.\n unconstrained fn remove_oracle(slot: Field, index: u32);\n\n /// Removes all elements from the array at `slot`.\n unconstrained fn clear_oracle(slot: Field);\n}\n\n/// A dynamically sized array backed by PXE-side in-memory storage via an [`ArrayOracles`] backend.\n///\n/// Arrays are identified by a slot, and each logical operation (push, pop, get, etc.) is a single oracle call. The\n/// `Oracle` backend determines the array's lifetime and visibility; contracts should not use this type directly but\n/// rather one of its aliases: [`EphemeralArray`](crate::ephemeral::EphemeralArray) (scoped to a single contract call\n/// frame) or [`TransientArray`](crate::transient::TransientArray) (shared across all frames of the same contract\n/// within one top-level PXE call).\npub struct UnconstrainedArray<T, Oracle> {\n pub(crate) slot: Field,\n}\n\nimpl<T, Oracle> UnconstrainedArray<T, Oracle>\nwhere\n Oracle: ArrayOracles,\n{\n /// Returns a handle to the array at the given slot, which may already contain data (e.g. populated by an oracle\n /// or by an earlier frame, depending on the backend's visibility).\n pub unconstrained fn at(slot: Field) -> Self {\n Self { slot }\n }\n\n /// Returns an empty array at the given slot, clearing any pre-existing data.\n ///\n /// For backends whose arrays are visible beyond a single call frame (e.g. transient arrays), this wipes data\n /// other frames of the same contract may have written at the slot.\n pub unconstrained fn empty_at(slot: Field) -> Self {\n Self::at(slot).clear()\n }\n\n /// Returns an empty array at a fresh, randomly allocated slot.\n ///\n /// Use this when the caller does not need a specific slot: the random slot is isolated from every other array of\n /// the same backend with overwhelming probability. Prefer [`UnconstrainedArray::empty_at`] when the slot must be a\n /// known value (e.g. one shared with an oracle or another call frame).\n pub unconstrained fn empty() -> Self {\n Self::at(random())\n }\n\n /// Returns an array at a fresh, randomly allocated slot holding `values` in order.\n pub unconstrained fn from_array<let N: u32>(values: [T; N]) -> Self\n where\n T: Serialize,\n {\n let array = Self::empty();\n for i in 0..N {\n array.push(values[i]);\n }\n array\n }\n\n /// Returns the number of elements stored in the array.\n pub unconstrained fn len(self) -> u32 {\n Oracle::len_oracle(self.slot)\n }\n\n /// Stores a value at the end of the array.\n pub unconstrained fn push(self, value: T)\n where\n T: Serialize,\n {\n let serialized = value.serialize();\n let _ = Oracle::push_oracle(self.slot, serialized);\n }\n\n /// Removes and returns the last element. Implementors are required to panic if the array is empty.\n pub unconstrained fn pop(self) -> T\n where\n T: Deserialize,\n {\n let serialized = Oracle::pop_oracle(self.slot);\n Deserialize::deserialize(serialized)\n }\n\n /// Retrieves the value stored at `index`. Implementors are required to panic if the index is out of bounds.\n pub unconstrained fn get(self, index: u32) -> T\n where\n T: Deserialize,\n {\n let serialized = Oracle::get_oracle(self.slot, index);\n Deserialize::deserialize(serialized)\n }\n\n /// Overwrites the value stored at `index`. Implementors are required to panic if the index is out of bounds.\n pub unconstrained fn set(self, index: u32, value: T)\n where\n T: Serialize,\n {\n let serialized = value.serialize();\n Oracle::set_oracle(self.slot, index, serialized);\n }\n\n /// Removes the element at `index`, shifting subsequent elements backward. Implementors are required to panic if\n /// the index is out of bounds.\n pub unconstrained fn remove(self, index: u32) {\n Oracle::remove_oracle(self.slot, index);\n }\n\n /// Removes all elements from the array and returns self for chaining.\n pub unconstrained fn clear(self) -> Self {\n Oracle::clear_oracle(self.slot);\n self\n }\n\n /// Calls a function on each element of the array.\n ///\n /// The function `f` is called once with each array value and its corresponding index, in order (from the first\n /// element to the last).\n ///\n /// Structurally mutating the array from inside the callback (e.g. via `push`, `pop`, `remove` or `clear`) is\n /// **not** supported: it can cause elements to be skipped, visited more than once, or read out of bounds.\n pub unconstrained fn for_each<Env>(self, f: unconstrained fn[Env](u32, T) -> ())\n where\n T: Deserialize,\n {\n let n = self.len();\n for i in 0..n {\n f(i, self.get(i));\n }\n }\n\n /// Applies `f` to every element and collects the results into a fresh array.\n pub unconstrained fn map<U, Env>(self, f: unconstrained fn[Env](T) -> U) -> UnconstrainedArray<U, Oracle>\n where\n T: Deserialize,\n U: Serialize,\n {\n let dest: UnconstrainedArray<U, Oracle> = UnconstrainedArray::empty();\n let n = self.len();\n for i in 0..n {\n dest.push(f(self.get(i)));\n }\n dest\n }\n\n /// Collects every element satisfying the predicate `f` into a fresh array.\n pub unconstrained fn filter<Env>(self, f: unconstrained fn[Env](T) -> bool) -> Self\n where\n T: Serialize + Deserialize,\n {\n let dest: Self = UnconstrainedArray::empty();\n let n = self.len();\n for i in 0..n {\n let value = self.get(i);\n if f(value) {\n dest.push(value);\n }\n }\n dest\n }\n\n /// Returns `true` if at least one element satisfies the predicate `f`.\n pub unconstrained fn any<Env>(self, f: unconstrained fn[Env](T) -> bool) -> bool\n where\n T: Serialize + Deserialize,\n {\n self.filter(f).len() != 0\n }\n\n /// Returns `true` if every element satisfies the predicate `f` (vacuously `true` for an empty array).\n pub unconstrained fn all<Env>(self, f: unconstrained fn[Env](T) -> bool) -> bool\n where\n T: Serialize + Deserialize,\n {\n self.filter(f).len() == self.len()\n }\n\n /// Returns the first element satisfying the predicate `f`, or `Option::none` if none do.\n pub unconstrained fn find<Env>(self, f: unconstrained fn[Env](T) -> bool) -> Option<T>\n where\n T: Deserialize,\n {\n let n = self.len();\n let mut result: Option<T> = Option::none();\n let mut i = 0;\n while (i < n) & result.is_none() {\n let value = self.get(i);\n if f(value) {\n result = Option::some(value);\n }\n i += 1;\n }\n result\n }\n}\n"
|
|
550
550
|
},
|
|
551
|
-
"
|
|
551
|
+
"302": {
|
|
552
552
|
"function_locations": [
|
|
553
553
|
{
|
|
554
554
|
"name": "Poseidon2::hash",
|
|
@@ -587,10 +587,10 @@
|
|
|
587
587
|
"start": 4549
|
|
588
588
|
}
|
|
589
589
|
],
|
|
590
|
-
"path": "/
|
|
590
|
+
"path": "/mnt/user-data/nicov/nargo/github.com/noir-lang/poseidon/v0.3.0/src/poseidon2.nr",
|
|
591
591
|
"source": "use std::default::Default;\nuse std::hash::Hasher;\n\nglobal RATE: u32 = 3;\n\npub struct Poseidon2 {\n cache: [Field; 3],\n state: [Field; 4],\n cache_size: u32,\n squeeze_mode: bool, // 0 => absorb, 1 => squeeze\n}\n\nimpl Poseidon2 {\n #[no_predicates]\n pub fn hash<let N: u32>(input: [Field; N], message_size: u32) -> Field {\n Poseidon2::hash_internal(input, message_size)\n }\n\n pub(crate) fn new(iv: Field) -> Poseidon2 {\n let mut result =\n Poseidon2 { cache: [0; 3], state: [0; 4], cache_size: 0, squeeze_mode: false };\n result.state[RATE] = iv;\n result\n }\n\n fn perform_duplex(&mut self) {\n // add the cache into sponge state\n self.state[0] += self.cache[0];\n self.state[1] += self.cache[1];\n self.state[2] += self.cache[2];\n self.state = crate::poseidon2_permutation(self.state);\n }\n\n fn absorb(&mut self, input: Field) {\n assert(!self.squeeze_mode);\n if self.cache_size == RATE {\n // If we're absorbing, and the cache is full, apply the sponge permutation to compress the cache\n self.perform_duplex();\n self.cache[0] = input;\n self.cache_size = 1;\n } else {\n // If we're absorbing, and the cache is not full, add the input into the cache\n self.cache[self.cache_size] = input;\n self.cache_size += 1;\n }\n }\n\n fn squeeze(&mut self) -> Field {\n assert(!self.squeeze_mode);\n // If we're in absorb mode, apply sponge permutation to compress the cache.\n self.perform_duplex();\n self.squeeze_mode = true;\n\n // Pop one item off the top of the permutation and return it.\n self.state[0]\n }\n\n fn hash_internal<let N: u32>(input: [Field; N], in_len: u32) -> Field {\n let two_pow_64 = 18446744073709551616;\n let iv: Field = (in_len as Field) * two_pow_64;\n let mut state = [0; 4];\n state[RATE] = iv;\n\n if std::runtime::is_unconstrained() {\n for i in 0..(in_len / RATE) {\n state[0] += input[i * RATE];\n state[1] += input[i * RATE + 1];\n state[2] += input[i * RATE + 2];\n state = crate::poseidon2_permutation(state);\n }\n\n // handle remaining elements after last full RATE-sized chunk\n let num_extra_fields = in_len % RATE;\n if num_extra_fields != 0 {\n let remainder_start = in_len - num_extra_fields;\n state[0] += input[remainder_start];\n if num_extra_fields > 1 {\n state[1] += input[remainder_start + 1];\n }\n }\n } else {\n let mut states: [[Field; 4]; N / RATE + 1] = [[0; 4]; N / RATE + 1];\n states[0] = state;\n\n // process all full RATE-sized chunks, storing state after each permutation\n for chunk_idx in 0..(N / RATE) {\n for i in 0..RATE {\n state[i] += input[chunk_idx * RATE + i];\n }\n state = crate::poseidon2_permutation(state);\n states[chunk_idx + 1] = state;\n }\n\n // get state at the last full block before in_len\n let first_partially_filled_chunk = in_len / RATE;\n state = states[first_partially_filled_chunk];\n\n // handle remaining elements after last full RATE-sized chunk\n let remainder_start = (in_len / RATE) * RATE;\n for j in 0..RATE {\n let idx = remainder_start + j;\n if idx < in_len {\n state[j] += input[idx];\n }\n }\n }\n\n // always run final permutation unless we just completed a full chunk\n // still need to permute once if in_len is 0\n if (in_len == 0) | (in_len % RATE != 0) {\n state = crate::poseidon2_permutation(state);\n };\n\n state[0]\n }\n}\n\npub struct Poseidon2Hasher {\n _state: [Field],\n}\n\nimpl Hasher for Poseidon2Hasher {\n fn finish(self) -> Field {\n let iv: Field = (self._state.len() as Field) * 18446744073709551616; // iv = (self._state.len() << 64)\n let mut sponge = Poseidon2::new(iv);\n for i in 0..self._state.len() {\n sponge.absorb(self._state[i]);\n }\n sponge.squeeze()\n }\n\n fn write(&mut self, input: Field) {\n self._state = self._state.push_back(input);\n }\n}\n\nimpl Default for Poseidon2Hasher {\n fn default() -> Self {\n Poseidon2Hasher { _state: @[] }\n }\n}\n"
|
|
592
592
|
},
|
|
593
|
-
"
|
|
593
|
+
"360": {
|
|
594
594
|
"function_locations": [
|
|
595
595
|
{
|
|
596
596
|
"name": "<impl Empty for AztecAddress>::empty",
|
|
@@ -677,10 +677,10 @@
|
|
|
677
677
|
"start": 12908
|
|
678
678
|
}
|
|
679
679
|
],
|
|
680
|
-
"path": "/
|
|
681
|
-
"source": "use crate::{\n address::{\n partial_address::PartialAddress, salted_initialization_hash::SaltedInitializationHash,\n },\n constants::{AZTEC_ADDRESS_LENGTH, DOM_SEP__CONTRACT_ADDRESS_V2, MAX_FIELD_VALUE},\n contract_class_id::ContractClassId,\n hash::poseidon2_hash_with_separator,\n public_keys::{hash_public_key, IvpkM, PublicKeys, ToPoint},\n traits::{Deserialize, Empty, FromField, Packable, Serialize, ToField},\n utils::field::sqrt,\n};\n\nuse crate::point::EmbeddedCurvePoint;\n\nuse crate::public_keys::AddressPoint;\nuse std::{\n embedded_curve_ops::{EmbeddedCurveScalar, fixed_base_scalar_mul as derive_public_key},\n ops::Add,\n};\nuse std::meta::derive;\n\n// Aztec address\n#[derive(Deserialize, Eq, Packable, Serialize)]\npub struct AztecAddress {\n pub inner: Field,\n}\n\nimpl Empty for AztecAddress {\n fn empty() -> Self {\n Self { inner: 0 }\n }\n}\n\nimpl ToField for AztecAddress {\n fn to_field(self) -> Field {\n self.inner\n }\n}\n\nimpl FromField for AztecAddress {\n fn from_field(value: Field) -> AztecAddress {\n AztecAddress { inner: value }\n }\n}\n\nimpl AztecAddress {\n pub fn zero() -> Self {\n Self { inner: 0 }\n }\n\n /// Returns `true` if the address is valid.\n ///\n /// An invalid address is one that can be proven to not be correctly derived, meaning it contains no contract code,\n /// public keys, etc., and can therefore not receive messages nor execute calls.\n pub fn is_valid(self) -> bool {\n self.get_y().is_some()\n }\n\n /// Returns an address's [`AddressPoint`].\n ///\n /// This can be used to create shared secrets with the owner of the address. If the address is invalid (see\n /// [`AztecAddress::is_valid`]) then this returns `Option::none()`, and no shared secrets can be created.\n pub fn to_address_point(self) -> Option<AddressPoint> {\n self.get_y().map(|y| {\n // If we get a negative y coordinate (y > (r - 1) / 2), we swap it to the\n // positive one (where y <= (r - 1) / 2) by negating it.\n let final_y = if Self::is_positive(y) { y } else { -y };\n\n AddressPoint { inner: EmbeddedCurvePoint { x: self.inner, y: final_y } }\n })\n }\n\n /// Determines whether a y-coordinate is in the lower (positive) or upper (negative) \"half\" of the field.\n /// I.e.\n /// y <= (r - 1)/2 => positive.\n /// y > (r - 1)/2 => negative.\n /// An AddressPoint always uses the \"positive\" y.\n fn is_positive(y: Field) -> bool {\n // Note: The field modulus r is MAX_FIELD_VALUE + 1.\n let MID = MAX_FIELD_VALUE / 2; // (r - 1) / 2\n let MID_PLUS_1 = MID + 1; // (r - 1)/2 + 1\n // Note: y <= m implies y < m + 1.\n y.lt(MID_PLUS_1)\n }\n\n /// Returns one of the two possible y-coordinates.\n ///\n /// Not all `AztecAddresses` are valid, in which case there is no corresponding y-coordinate. This returns\n /// `Option::none()` for invalid addresses.\n ///\n /// An `AztecAddress` is defined by an x-coordinate, for which two y-coordinates exist as solutions to the curve\n /// equation. This function returns either of them. Note that an [`AddressPoint`] must **always** have a positive\n /// y-coordinate - if trying to obtain the underlying point use [`AztecAddress::to_address_point`] instead.\n fn get_y(self) -> Option<Field> {\n // We compute the address point by taking our address as x, and then solving for y in the\n // equation which defines the grumpkin curve:\n // y^2 = x^3 - 17; x = address\n let x = self.inner;\n let y_squared = x * x * x - 17;\n\n sqrt(y_squared)\n }\n\n pub fn compute(public_keys: PublicKeys, partial_address: PartialAddress) -> AztecAddress {\n //\n // address = address_point.x\n // |\n // address_point = pre_address * G + Ivpk_m (always choose \"positive\" y-coord)\n // | ^\n // | |.....................\n // pre_address .\n // / \\ .\n // / \\ .\n // partial_address public_keys_hash .\n // / \\ / / | | | \\ .\n // / \\ / / | | | \\ .\n // npk_m_hash Ivpk_m ovpk_m_hash tpk_m_hash mspk_m_hash fbpk_m_hash\n // contract_class_id \\ |.........................\n // / | \\ \\\n // artifact_hash | public_bytecode_commitment salted_initialization_hash\n // | / / \\ \\\n // private_function_tree_root salt initialization_hash deployer_address immutables_hash\n // / \\ / \\\n // ... ... constructor_fn_selector constructor_args_hash\n // / \\\n // / \\ / \\\n // leaf leaf leaf leaf\n // ^\n // |\n // |---h(function_selector, vk_hash)\n // ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n // Each of these represents a private function of the contract.\n\n let public_keys_hash = public_keys.hash();\n\n let pre_address = poseidon2_hash_with_separator(\n [public_keys_hash.to_field(), partial_address.to_field()],\n DOM_SEP__CONTRACT_ADDRESS_V2,\n );\n\n // Note: `.add()` will fail within the blackbox fn if either of the points are not on the curve. (See tests below).\n let address_point = derive_public_key(EmbeddedCurveScalar::from_field(pre_address)).add(\n public_keys.ivpk_m.to_point(),\n );\n\n // Note that our address is only the x-coordinate of the full address_point. This is okay because when people want to encrypt something and send it to us\n // they can recover our full point using the x-coordinate (our address itself). To do this, they recompute the y-coordinate according to the equation y^2 = x^3 - 17.\n // When they do this, they may get a positive y-coordinate (a value that is less than or equal to MAX_FIELD_VALUE / 2) or\n // a negative y-coordinate (a value that is more than MAX_FIELD_VALUE), and we cannot dictate which one they get and hence the recovered point may sometimes be different than the one\n // our secret can decrypt. Regardless though, they should and will always encrypt using point with the positive y-coordinate by convention.\n // This ensures that everyone encrypts to the same point given an arbitrary x-coordinate (address). This is allowed because even though our original point may not have a positive y-coordinate,\n // with our original secret, we will be able to derive the secret to the point with the flipped (and now positive) y-coordinate that everyone encrypts to.\n AztecAddress::from_field(address_point.x)\n }\n\n pub fn compute_from_class_id(\n contract_class_id: ContractClassId,\n salted_initialization_hash: SaltedInitializationHash,\n public_keys: PublicKeys,\n ) -> Self {\n let partial_address = PartialAddress::compute_from_salted_initialization_hash(\n contract_class_id,\n salted_initialization_hash,\n );\n\n AztecAddress::compute(public_keys, partial_address)\n }\n\n pub fn is_zero(self) -> bool {\n self.inner == 0\n }\n\n pub fn assert_is_zero(self) {\n assert(self.to_field() == 0);\n }\n}\n\n#[test]\nfn check_max_field_value() {\n // Check that it is indeed r-1.\n assert_eq(MAX_FIELD_VALUE + 1, 0);\n}\n\n#[test]\nfn check_is_positive() {\n assert(AztecAddress::is_positive(0));\n assert(AztecAddress::is_positive(1));\n assert(!AztecAddress::is_positive(-1));\n assert(AztecAddress::is_positive(MAX_FIELD_VALUE / 2));\n assert(!AztecAddress::is_positive((MAX_FIELD_VALUE / 2) + 1));\n}\n\n// Gives us confidence that we don't need to manually check that the input public keys need to be on the curve for `add`,\n// because the blackbox function does this check for us.\n#[test(should_fail_with = \"is not on curve\")]\nfn check_embedded_curve_point_add() {\n // Choose a point not on the curve in the 2nd position.\n let p1 = EmbeddedCurvePoint::generator();\n let key = IvpkM { inner: EmbeddedCurvePoint { x: 1, y: 1 } };\n let _ = p1 + key.to_point();\n}\n\n#[test]\nfn compute_address_from_partial_and_pub_keys() {\n let npk_m_point = EmbeddedCurvePoint {\n x: 0x22f7fcddfa3ce3e8f0cc8e82d7b94cdd740afa3e77f8e4a63ea78a239432dcab,\n y: 0x0471657de2b6216ade6c506d28fbc22ba8b8ed95c871ad9f3e3984e90d9723a7,\n };\n let ovpk_m_point = EmbeddedCurvePoint {\n x: 0x09115c96e962322ffed6522f57194627136b8d03ac7469109707f5e44190c484,\n y: 0x0c49773308a13d740a7f0d4f0e6163b02c5a408b6f965856b6a491002d073d5b,\n };\n let tpk_m_point = EmbeddedCurvePoint {\n x: 0x00d3d81beb009873eb7116327cf47c612d5758ef083d4fda78e9b63980b2a762,\n y: 0x2f567d22d2b02fe1f4ad42db9d58a36afd1983e7e2909d1cab61cafedad6193a,\n };\n let mspk_m_point = EmbeddedCurvePoint {\n x: 0x1bd6cb13e0bc8c6e0c1a8b2c5d7f9e0a4b6c8d0e2f4a6c8e0a2c4e6f8a0b2c4d,\n y: 0x0a032ec7b21c2bdb35f8a13e594764e39ee786c4b275eef3f0435bf6ab2b9822,\n };\n let fbpk_m_point = EmbeddedCurvePoint {\n x: 0x2c8e0a2c4e6f8b0d2f4a6c8e0a2c4e6f8b0d2f4a6c8e0a2c4e6f8b0d2f4a6c90,\n y: 0x2ef338da3a77e65f90b6d48ac686fc9ff3a95de0c39e0426fc443377425e6634,\n };\n\n let public_keys = PublicKeys {\n npk_m_hash: hash_public_key(npk_m_point),\n ivpk_m: IvpkM {\n inner: EmbeddedCurvePoint {\n x: 0x111223493147f6785514b1c195bb37a2589f22a6596d30bb2bb145fdc9ca8f1e,\n y: 0x273bbffd678edce8fe30e0deafc4f66d58357c06fd4a820285294b9746c3be95,\n },\n },\n ovpk_m_hash: hash_public_key(ovpk_m_point),\n tpk_m_hash: hash_public_key(tpk_m_point),\n mspk_m_hash: hash_public_key(mspk_m_point),\n fbpk_m_hash: hash_public_key(fbpk_m_point),\n };\n\n let partial_address = PartialAddress::from_field(\n 0x0a7c585381b10f4666044266a02405bf6e01fa564c8517d4ad5823493abd31de,\n );\n\n let address = AztecAddress::compute(public_keys, partial_address).to_field();\n\n let expected_computed_address_from_partial_and_pubkeys =\n 0x303ffc8bd456d132463b1fc3a633aeb718a7883c268f3956c05e6fe09b5a5424;\n assert_eq(address, expected_computed_address_from_partial_and_pubkeys);\n}\n\n#[test]\nfn compute_preaddress_from_partial_and_pub_keys() {\n let pre_address = poseidon2_hash_with_separator([1, 2], DOM_SEP__CONTRACT_ADDRESS_V2);\n let expected_computed_preaddress_from_partial_and_pubkey =\n 0x0fa1c698858df1a99170cd39d5f4bfad6d0d60f1f8afa3dc92281ee60b36f3bb;\n assert(pre_address == expected_computed_preaddress_from_partial_and_pubkey);\n}\n\n#[test]\nfn from_field_to_field() {\n let address = AztecAddress { inner: 37 };\n assert_eq(FromField::from_field(address.to_field()), address);\n}\n\n#[test]\nfn serde() {\n let address = AztecAddress { inner: 37 };\n // We use the AZTEC_ADDRESS_LENGTH constant to ensure that there is a match between the derived trait\n // implementation and the constant.\n let serialized: [Field; AZTEC_ADDRESS_LENGTH] = address.serialize();\n let deserialized = AztecAddress::deserialize(serialized);\n assert_eq(address, deserialized);\n}\n\n#[test]\nfn to_address_point_valid() {\n // x = 8 where x^3 - 17 = 512 - 17 = 495, which is a residue in this field\n let address = AztecAddress { inner: 8 };\n\n assert(address.get_y().is_some()); // We don't bother checking the result of get_y as it is only used internally\n assert(address.is_valid());\n\n let maybe_point = address.to_address_point();\n assert(maybe_point.is_some());\n\n let point = maybe_point.unwrap().inner;\n // check that x is preserved\n assert_eq(point.x, Field::from(8));\n\n // check that the curve equation holds: y^2 == x^3 - 17\n assert_eq(point.y * point.y, point.x * point.x * point.x - 17);\n}\n\n#[test]\nfn to_address_point_invalid() {\n // x = 3 where x^3 - 17 = 27 - 17 = 10, which is a non-residue in this field\n let address = AztecAddress { inner: 3 };\n\n assert(address.get_y().is_none());\n assert(!address.is_valid());\n\n assert(address.to_address_point().is_none());\n}\n"
|
|
680
|
+
"path": "/mnt/user-data/nicov/nargo/github.com/AztecProtocol/aztec-packages/v6.0.0-rc.6/noir-projects/fnd/noir-protocol-circuits/crates/types/src/address/aztec_address.nr",
|
|
681
|
+
"source": "use crate::{\n address::{\n partial_address::PartialAddress, salted_initialization_hash::SaltedInitializationHash,\n },\n constants::{AZTEC_ADDRESS_LENGTH, DOM_SEP__CONTRACT_ADDRESS_V3, MAX_FIELD_VALUE},\n contract_class_id::ContractClassId,\n hash::poseidon2_hash_with_separator,\n public_keys::{hash_public_key, IvpkM, PublicKeys, ToPoint},\n traits::{Deserialize, Empty, FromField, Packable, Serialize, ToField},\n utils::field::sqrt,\n};\n\nuse crate::point::EmbeddedCurvePoint;\n\nuse crate::public_keys::AddressPoint;\nuse std::{\n embedded_curve_ops::{EmbeddedCurveScalar, fixed_base_scalar_mul as derive_public_key},\n ops::Add,\n};\nuse std::meta::derive;\n\n// Aztec address\n#[derive(Deserialize, Eq, Packable, Serialize)]\npub struct AztecAddress {\n pub inner: Field,\n}\n\nimpl Empty for AztecAddress {\n fn empty() -> Self {\n Self { inner: 0 }\n }\n}\n\nimpl ToField for AztecAddress {\n fn to_field(self) -> Field {\n self.inner\n }\n}\n\nimpl FromField for AztecAddress {\n fn from_field(value: Field) -> AztecAddress {\n AztecAddress { inner: value }\n }\n}\n\nimpl AztecAddress {\n pub fn zero() -> Self {\n Self { inner: 0 }\n }\n\n /// Returns `true` if the address is valid.\n ///\n /// An invalid address is one that can be proven to not be correctly derived, meaning it contains no contract code,\n /// public keys, etc., and can therefore not receive messages nor execute calls.\n pub fn is_valid(self) -> bool {\n self.get_y().is_some()\n }\n\n /// Returns an address's [`AddressPoint`].\n ///\n /// This can be used to create shared secrets with the owner of the address. If the address is invalid (see\n /// [`AztecAddress::is_valid`]) then this returns `Option::none()`, and no shared secrets can be created.\n pub fn to_address_point(self) -> Option<AddressPoint> {\n self.get_y().map(|y| {\n // If we get a negative y coordinate (y > (r - 1) / 2), we swap it to the\n // positive one (where y <= (r - 1) / 2) by negating it.\n let final_y = if Self::is_positive(y) { y } else { -y };\n\n AddressPoint { inner: EmbeddedCurvePoint { x: self.inner, y: final_y } }\n })\n }\n\n /// Determines whether a y-coordinate is in the lower (positive) or upper (negative) \"half\" of the field.\n /// I.e.\n /// y <= (r - 1)/2 => positive.\n /// y > (r - 1)/2 => negative.\n /// An AddressPoint always uses the \"positive\" y.\n fn is_positive(y: Field) -> bool {\n // Note: The field modulus r is MAX_FIELD_VALUE + 1.\n let MID = MAX_FIELD_VALUE / 2; // (r - 1) / 2\n let MID_PLUS_1 = MID + 1; // (r - 1)/2 + 1\n // Note: y <= m implies y < m + 1.\n y.lt(MID_PLUS_1)\n }\n\n /// Returns one of the two possible y-coordinates.\n ///\n /// Not all `AztecAddresses` are valid, in which case there is no corresponding y-coordinate. This returns\n /// `Option::none()` for invalid addresses.\n ///\n /// An `AztecAddress` is defined by an x-coordinate, for which two y-coordinates exist as solutions to the curve\n /// equation. This function returns either of them. Note that an [`AddressPoint`] must **always** have a positive\n /// y-coordinate - if trying to obtain the underlying point use [`AztecAddress::to_address_point`] instead.\n fn get_y(self) -> Option<Field> {\n // We compute the address point by taking our address as x, and then solving for y in the\n // equation which defines the grumpkin curve:\n // y^2 = x^3 - 17; x = address\n let x = self.inner;\n let y_squared = x * x * x - 17;\n\n sqrt(y_squared)\n }\n\n pub fn compute(public_keys: PublicKeys, partial_address: PartialAddress) -> AztecAddress {\n //\n // address = address_point.x\n // |\n // address_point = pre_address * G + Ivpk_m (always choose \"positive\" y-coord)\n // | ^\n // | |.....................\n // pre_address .\n // / \\ .\n // / \\ .\n // partial_address public_keys_hash .\n // / \\ / / | | | \\ .\n // / \\ / / | | | \\ .\n // npk_m_hash Ivpk_m ovpk_m_hash tpk_m_hash mspk_m_hash fbpk_m_hash\n // contract_class_id \\ |.........................\n // / | \\ \\\n // artifact_hash | public_bytecode_commitment salted_initialization_hash\n // | / / \\ \\\n // private_function_tree_root salt initialization_hash deployer_address immutables_hash\n // / \\ / \\\n // ... ... constructor_fn_selector constructor_args_hash\n // / \\\n // / \\ / \\\n // leaf leaf leaf leaf\n // ^\n // |\n // |---h(function_selector, vk_hash)\n // ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n // Each of these represents a private function of the contract.\n\n let public_keys_hash = public_keys.hash();\n\n let pre_address = poseidon2_hash_with_separator(\n [public_keys_hash.to_field(), partial_address.to_field()],\n DOM_SEP__CONTRACT_ADDRESS_V3,\n );\n\n // Note: `.add()` will fail within the blackbox fn if either of the points are not on the curve. (See tests below).\n let address_point = derive_public_key(EmbeddedCurveScalar::from_field(pre_address)).add(\n public_keys.ivpk_m.to_point(),\n );\n\n // Note that our address is only the x-coordinate of the full address_point. This is okay because when people want to encrypt something and send it to us\n // they can recover our full point using the x-coordinate (our address itself). To do this, they recompute the y-coordinate according to the equation y^2 = x^3 - 17.\n // When they do this, they may get a positive y-coordinate (a value that is less than or equal to MAX_FIELD_VALUE / 2) or\n // a negative y-coordinate (a value that is more than MAX_FIELD_VALUE), and we cannot dictate which one they get and hence the recovered point may sometimes be different than the one\n // our secret can decrypt. Regardless though, they should and will always encrypt using point with the positive y-coordinate by convention.\n // This ensures that everyone encrypts to the same point given an arbitrary x-coordinate (address). This is allowed because even though our original point may not have a positive y-coordinate,\n // with our original secret, we will be able to derive the secret to the point with the flipped (and now positive) y-coordinate that everyone encrypts to.\n AztecAddress::from_field(address_point.x)\n }\n\n pub fn compute_from_class_id(\n contract_class_id: ContractClassId,\n salted_initialization_hash: SaltedInitializationHash,\n public_keys: PublicKeys,\n ) -> Self {\n let partial_address = PartialAddress::compute_from_salted_initialization_hash(\n contract_class_id,\n salted_initialization_hash,\n );\n\n AztecAddress::compute(public_keys, partial_address)\n }\n\n pub fn is_zero(self) -> bool {\n self.inner == 0\n }\n\n pub fn assert_is_zero(self) {\n assert(self.to_field() == 0);\n }\n}\n\n#[test]\nfn check_max_field_value() {\n // Check that it is indeed r-1.\n assert_eq(MAX_FIELD_VALUE + 1, 0);\n}\n\n#[test]\nfn check_is_positive() {\n assert(AztecAddress::is_positive(0));\n assert(AztecAddress::is_positive(1));\n assert(!AztecAddress::is_positive(-1));\n assert(AztecAddress::is_positive(MAX_FIELD_VALUE / 2));\n assert(!AztecAddress::is_positive((MAX_FIELD_VALUE / 2) + 1));\n}\n\n// Gives us confidence that we don't need to manually check that the input public keys need to be on the curve for `add`,\n// because the blackbox function does this check for us.\n#[test(should_fail_with = \"is not on curve\")]\nfn check_embedded_curve_point_add() {\n // Choose a point not on the curve in the 2nd position.\n let p1 = EmbeddedCurvePoint::generator();\n let key = IvpkM { inner: EmbeddedCurvePoint { x: 1, y: 1 } };\n let _ = p1 + key.to_point();\n}\n\n#[test]\nfn compute_address_from_partial_and_pub_keys() {\n let npk_m_point = EmbeddedCurvePoint {\n x: 0x22f7fcddfa3ce3e8f0cc8e82d7b94cdd740afa3e77f8e4a63ea78a239432dcab,\n y: 0x0471657de2b6216ade6c506d28fbc22ba8b8ed95c871ad9f3e3984e90d9723a7,\n };\n let ovpk_m_point = EmbeddedCurvePoint {\n x: 0x09115c96e962322ffed6522f57194627136b8d03ac7469109707f5e44190c484,\n y: 0x0c49773308a13d740a7f0d4f0e6163b02c5a408b6f965856b6a491002d073d5b,\n };\n let tpk_m_point = EmbeddedCurvePoint {\n x: 0x00d3d81beb009873eb7116327cf47c612d5758ef083d4fda78e9b63980b2a762,\n y: 0x2f567d22d2b02fe1f4ad42db9d58a36afd1983e7e2909d1cab61cafedad6193a,\n };\n let mspk_m_point = EmbeddedCurvePoint {\n x: 0x1bd6cb13e0bc8c6e0c1a8b2c5d7f9e0a4b6c8d0e2f4a6c8e0a2c4e6f8a0b2c4d,\n y: 0x0a032ec7b21c2bdb35f8a13e594764e39ee786c4b275eef3f0435bf6ab2b9822,\n };\n let fbpk_m_point = EmbeddedCurvePoint {\n x: 0x2c8e0a2c4e6f8b0d2f4a6c8e0a2c4e6f8b0d2f4a6c8e0a2c4e6f8b0d2f4a6c90,\n y: 0x2ef338da3a77e65f90b6d48ac686fc9ff3a95de0c39e0426fc443377425e6634,\n };\n\n let public_keys = PublicKeys {\n npk_m_hash: hash_public_key(npk_m_point),\n ivpk_m: IvpkM {\n inner: EmbeddedCurvePoint {\n x: 0x111223493147f6785514b1c195bb37a2589f22a6596d30bb2bb145fdc9ca8f1e,\n y: 0x273bbffd678edce8fe30e0deafc4f66d58357c06fd4a820285294b9746c3be95,\n },\n },\n ovpk_m_hash: hash_public_key(ovpk_m_point),\n tpk_m_hash: hash_public_key(tpk_m_point),\n mspk_m_hash: hash_public_key(mspk_m_point),\n fbpk_m_hash: hash_public_key(fbpk_m_point),\n };\n\n let partial_address = PartialAddress::from_field(\n 0x0a7c585381b10f4666044266a02405bf6e01fa564c8517d4ad5823493abd31de,\n );\n\n let address = AztecAddress::compute(public_keys, partial_address).to_field();\n\n let expected_computed_address_from_partial_and_pubkeys =\n 0x23877639c7424d1d2a9f514e59ee662b3154a730b783caf822d196b625ba4355;\n assert_eq(address, expected_computed_address_from_partial_and_pubkeys);\n}\n\n#[test]\nfn compute_preaddress_from_partial_and_pub_keys() {\n let pre_address = poseidon2_hash_with_separator([1, 2], DOM_SEP__CONTRACT_ADDRESS_V3);\n let expected_computed_preaddress_from_partial_and_pubkey =\n 0x2e0787752b82b3ab9c28d67b48f24f8a3dac253023bf5136bbcb8ddbf4b1381c;\n assert(pre_address == expected_computed_preaddress_from_partial_and_pubkey);\n}\n\n#[test]\nfn from_field_to_field() {\n let address = AztecAddress { inner: 37 };\n assert_eq(FromField::from_field(address.to_field()), address);\n}\n\n#[test]\nfn serde() {\n let address = AztecAddress { inner: 37 };\n // We use the AZTEC_ADDRESS_LENGTH constant to ensure that there is a match between the derived trait\n // implementation and the constant.\n let serialized: [Field; AZTEC_ADDRESS_LENGTH] = address.serialize();\n let deserialized = AztecAddress::deserialize(serialized);\n assert_eq(address, deserialized);\n}\n\n#[test]\nfn to_address_point_valid() {\n // x = 8 where x^3 - 17 = 512 - 17 = 495, which is a residue in this field\n let address = AztecAddress { inner: 8 };\n\n assert(address.get_y().is_some()); // We don't bother checking the result of get_y as it is only used internally\n assert(address.is_valid());\n\n let maybe_point = address.to_address_point();\n assert(maybe_point.is_some());\n\n let point = maybe_point.unwrap().inner;\n // check that x is preserved\n assert_eq(point.x, Field::from(8));\n\n // check that the curve equation holds: y^2 == x^3 - 17\n assert_eq(point.y * point.y, point.x * point.x * point.x - 17);\n}\n\n#[test]\nfn to_address_point_invalid() {\n // x = 3 where x^3 - 17 = 27 - 17 = 10, which is a non-residue in this field\n let address = AztecAddress { inner: 3 };\n\n assert(address.get_y().is_none());\n assert(!address.is_valid());\n\n assert(address.to_address_point().is_none());\n}\n"
|
|
682
682
|
},
|
|
683
|
-
"
|
|
683
|
+
"390": {
|
|
684
684
|
"function_locations": [
|
|
685
685
|
{
|
|
686
686
|
"name": "sha256_to_field",
|
|
@@ -768,53 +768,65 @@
|
|
|
768
768
|
},
|
|
769
769
|
{
|
|
770
770
|
"name": "poseidon2_hash_bytes",
|
|
771
|
-
"start":
|
|
771
|
+
"start": 12580
|
|
772
|
+
},
|
|
773
|
+
{
|
|
774
|
+
"name": "poseidon2_hash_bytes_matches_hash_of_packed_chunks",
|
|
775
|
+
"start": 13179
|
|
776
|
+
},
|
|
777
|
+
{
|
|
778
|
+
"name": "poseidon2_hash_bytes_ignores_trailing_zeros_in_last_chunk",
|
|
779
|
+
"start": 13418
|
|
780
|
+
},
|
|
781
|
+
{
|
|
782
|
+
"name": "poseidon2_hash_bytes_commits_to_chunk_count",
|
|
783
|
+
"start": 13638
|
|
772
784
|
},
|
|
773
785
|
{
|
|
774
786
|
"name": "subarray_hash_matches_fixed",
|
|
775
|
-
"start":
|
|
787
|
+
"start": 13869
|
|
776
788
|
},
|
|
777
789
|
{
|
|
778
790
|
"name": "subarray_hash_matches_variable",
|
|
779
|
-
"start":
|
|
791
|
+
"start": 14268
|
|
780
792
|
},
|
|
781
793
|
{
|
|
782
794
|
"name": "subarray_hash_with_separator_matches_fixed_len_with_separator",
|
|
783
|
-
"start":
|
|
795
|
+
"start": 14724
|
|
784
796
|
},
|
|
785
797
|
{
|
|
786
798
|
"name": "smoke_sha256_to_field",
|
|
787
|
-
"start":
|
|
799
|
+
"start": 15349
|
|
788
800
|
},
|
|
789
801
|
{
|
|
790
802
|
"name": "unique_siloed_note_hash_matches_typescript",
|
|
791
|
-
"start":
|
|
803
|
+
"start": 16751
|
|
792
804
|
},
|
|
793
805
|
{
|
|
794
806
|
"name": "siloed_nullifier_matches_typescript",
|
|
795
|
-
"start":
|
|
807
|
+
"start": 17973
|
|
796
808
|
},
|
|
797
809
|
{
|
|
798
810
|
"name": "siloed_private_log_first_field_matches_typescript",
|
|
799
|
-
"start":
|
|
811
|
+
"start": 18353
|
|
800
812
|
},
|
|
801
813
|
{
|
|
802
814
|
"name": "empty_l2_to_l1_message_hash_matches_typescript",
|
|
803
|
-
"start":
|
|
815
|
+
"start": 18763
|
|
804
816
|
},
|
|
805
817
|
{
|
|
806
818
|
"name": "l2_to_l1_message_hash_matches_typescript",
|
|
807
|
-
"start":
|
|
819
|
+
"start": 19214
|
|
808
820
|
},
|
|
809
821
|
{
|
|
810
822
|
"name": "poseidon2_hash_with_separator_bounded_vec_matches_non_bounded_vec_version",
|
|
811
|
-
"start":
|
|
823
|
+
"start": 19830
|
|
812
824
|
}
|
|
813
825
|
],
|
|
814
|
-
"path": "/
|
|
815
|
-
"source": "mod poseidon2_chunks;\n\nuse crate::{\n abis::{\n contract_class_function_leaf_preimage::ContractClassFunctionLeafPreimage,\n function_selector::FunctionSelector, nullifier::Nullifier, private_log::PrivateLog,\n transaction::tx_request::TxRequest,\n },\n address::{AztecAddress, EthAddress},\n constants::{\n CONTRACT_CLASS_LOG_SIZE_IN_FIELDS, DOM_SEP__NOTE_HASH_NONCE,\n DOM_SEP__PRIVATE_LOG_FIRST_FIELD, DOM_SEP__SILOED_NOTE_HASH, DOM_SEP__SILOED_NULLIFIER,\n DOM_SEP__UNIQUE_NOTE_HASH, FUNCTION_TREE_HEIGHT, NULL_MSG_SENDER_CONTRACT_ADDRESS,\n TWO_POW_64,\n },\n merkle_tree::root_from_sibling_path,\n messaging::l2_to_l1_message::L2ToL1Message,\n poseidon2::Poseidon2Sponge,\n side_effect::{Counted, Scoped},\n traits::{FromField, Hash, ToField},\n utils::field::{field_from_bytes, field_from_bytes_32_trunc},\n};\n\npub use poseidon2_chunks::poseidon2_absorb_in_chunks_existing_sponge;\nuse poseidon2_chunks::poseidon2_absorb_in_chunks;\nuse std::embedded_curve_ops::EmbeddedCurveScalar;\n\n// TODO: refactor these into their own files: sha256, poseidon2, some protocol-specific hash computations, some merkle computations.\n\npub fn sha256_to_field<let N: u32>(bytes_to_hash: [u8; N]) -> Field {\n let sha256_hashed = sha256::digest(bytes_to_hash);\n let hash_in_a_field = field_from_bytes_32_trunc(sha256_hashed);\n\n hash_in_a_field\n}\n\npub fn private_functions_root_from_siblings(\n selector: FunctionSelector,\n vk_hash: Field,\n function_leaf_index: Field,\n function_leaf_sibling_path: [Field; FUNCTION_TREE_HEIGHT],\n) -> Field {\n let function_leaf_preimage = ContractClassFunctionLeafPreimage { selector, vk_hash };\n let function_leaf = function_leaf_preimage.hash();\n root_from_sibling_path(\n function_leaf,\n function_leaf_index,\n function_leaf_sibling_path,\n )\n}\n\n/// Siloing in the context of Aztec refers to the process of hashing a note hash with a contract address (this way\n/// the note hash is scoped to a specific contract). This is used to prevent intermingling of notes between contracts.\npub fn compute_siloed_note_hash(contract_address: AztecAddress, note_hash: Field) -> Field {\n poseidon2_hash_with_separator(\n [contract_address.to_field(), note_hash],\n DOM_SEP__SILOED_NOTE_HASH,\n )\n}\n\n/// Computes unique, siloed note hashes from siloed note hashes.\n///\n/// The protocol injects uniqueness into every note_hash, so that every single note_hash in the\n/// tree is unique. This prevents faerie gold attacks, where a malicious sender could create\n/// two identical note_hashes for a recipient (meaning only one would be nullifiable in future).\n///\n/// Most privacy protocols will inject the note's leaf_index (its position in the Note Hashes Tree)\n/// into the note, but this requires the creator of a note to wait until their tx is included in\n/// a block to know the note's final note hash (the unique, siloed note hash), because inserting\n/// leaves into trees is the job of a block producer.\n///\n/// We took a different approach so that the creator of a note will know each note's unique, siloed\n/// note hash before broadcasting their tx to the network.\n/// (There was also a historical requirement relating to \"chained transactions\" -- a feature that\n/// Aztec Connect had to enable notes to be spent from distinct txs earlier in the same block,\n/// and hence before an archive block root had been established for that block -- but that feature\n/// was abandoned for the Aztec Network for having too many bad tradeoffs).\n///\n/// (\n/// Edit: it is no longer true that all final note_hashes will be known by the creator of a tx\n/// before they send it to the network. If a tx makes public function calls, then _revertible_\n/// note_hashes that are created in private will not be made unique in private by the Reset circuit,\n/// but will instead be made unique by the AVM, because the `note_index_in_tx` will not be known\n/// until the AVM has executed the public functions of the tx. (See an explanation in\n/// reset_output_composer.nr for why).\n/// For some such txs, the `note_index_in_tx` might still be predictable through simulation, but\n/// for txs whose public functions create a varying number of non-revertible notes (determined at\n/// runtime), the `note_index_in_tx` will not be deterministically derivable before submitting the\n/// tx to the network.\n/// )\n///\n/// We use the `first_nullifier` of a tx as a seed of uniqueness. We have a guarantee that there will\n/// always be at least one nullifier per tx, because the init circuit will create one if one isn't\n/// created naturally by any functions of the tx. (Search \"protocol_nullifier\").\n/// We combine the `first_nullifier` with the note's index (its position within this tx's new\n/// note_hashes array) (`note_index_in_tx`) to get a truly unique value to inject into a note, which\n/// we call a `note_nonce`.\npub fn compute_unique_note_hash(note_nonce: Field, siloed_note_hash: Field) -> Field {\n let inputs = [note_nonce, siloed_note_hash];\n poseidon2_hash_with_separator(inputs, DOM_SEP__UNIQUE_NOTE_HASH)\n}\n\npub fn compute_note_hash_nonce(first_nullifier_in_tx: Field, note_index_in_tx: u32) -> Field {\n // Hashing the first nullifier with note index in tx is guaranteed to be unique (because all nullifiers are also\n // unique).\n poseidon2_hash_with_separator(\n [first_nullifier_in_tx, note_index_in_tx as Field],\n DOM_SEP__NOTE_HASH_NONCE,\n )\n}\n\npub fn compute_note_nonce_and_unique_note_hash(\n siloed_note_hash: Field,\n first_nullifier: Field,\n note_index_in_tx: u32,\n) -> Field {\n let note_nonce = compute_note_hash_nonce(first_nullifier, note_index_in_tx);\n compute_unique_note_hash(note_nonce, siloed_note_hash)\n}\n\npub fn compute_siloed_nullifier(contract_address: AztecAddress, nullifier: Field) -> Field {\n poseidon2_hash_with_separator(\n [contract_address.to_field(), nullifier],\n DOM_SEP__SILOED_NULLIFIER,\n )\n}\n\npub fn create_protocol_nullifier(tx_request: TxRequest) -> Scoped<Counted<Nullifier>> {\n // The protocol nullifier is ascribed a special side-effect counter of 1. No other side-effect\n // can have counter 1 (see `validate_as_first_call` for that assertion). Its value is the\n // transaction's nonce commitment (origin, chain id, version, salt): see\n // `TxRequest::compute_protocol_nullifier_value`. The reset kernel siloes it under\n // `NULL_MSG_SENDER_CONTRACT_ADDRESS` like every other nullifier.\n Nullifier { value: tx_request.compute_protocol_nullifier_value(), note_hash: 0 }.count(1).scope(\n NULL_MSG_SENDER_CONTRACT_ADDRESS,\n )\n}\n\npub fn compute_log_tag(raw_tag: Field, dom_sep: u32) -> Field {\n poseidon2_hash_with_separator([raw_tag], dom_sep)\n}\n\npub fn compute_siloed_private_log_first_field(\n contract_address: AztecAddress,\n field: Field,\n) -> Field {\n poseidon2_hash_with_separator(\n [contract_address.to_field(), field],\n DOM_SEP__PRIVATE_LOG_FIRST_FIELD,\n )\n}\n\npub fn compute_siloed_private_log(contract_address: AztecAddress, log: PrivateLog) -> PrivateLog {\n let mut fields = log.fields;\n fields[0] = compute_siloed_private_log_first_field(contract_address, fields[0]);\n PrivateLog::new(fields, log.length)\n}\n\npub fn compute_contract_class_log_hash(log: [Field; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS]) -> Field {\n poseidon2_hash(log)\n}\n\npub fn compute_app_siloed_secret_key(\n master_secret_key: EmbeddedCurveScalar,\n app_address: AztecAddress,\n key_type_domain_separator: Field,\n) -> Field {\n poseidon2_hash_with_separator(\n [master_secret_key.hi, master_secret_key.lo, app_address.to_field()],\n key_type_domain_separator,\n )\n}\n\npub fn compute_l2_to_l1_message_hash(\n message: Scoped<L2ToL1Message>,\n rollup_version_id: Field,\n chain_id: Field,\n) -> Field {\n let contract_address_bytes: [u8; 32] = message.contract_address.to_field().to_be_bytes();\n let recipient_bytes: [u8; 20] = message.inner.recipient.to_be_bytes();\n let content_bytes: [u8; 32] = message.inner.content.to_be_bytes();\n let rollup_version_id_bytes: [u8; 32] = rollup_version_id.to_be_bytes();\n let chain_id_bytes: [u8; 32] = chain_id.to_be_bytes();\n\n let mut bytes: [u8; 148] = std::mem::zeroed();\n for i in 0..32 {\n bytes[i] = contract_address_bytes[i];\n bytes[i + 32] = rollup_version_id_bytes[i];\n // 64 - 84 are for recipient.\n bytes[i + 84] = chain_id_bytes[i];\n bytes[i + 116] = content_bytes[i];\n }\n\n for i in 0..20 {\n bytes[64 + i] = recipient_bytes[i];\n }\n\n sha256_to_field(bytes)\n}\n\n/// Computes sha256 hash of 2 input fields.\n///\n/// @returns A truncated field (i.e., the first byte is always 0).\npub fn accumulate_sha256(v0: Field, v1: Field) -> Field {\n // Concatenate two fields into 32 x 2 = 64 bytes\n let v0_as_bytes: [u8; 32] = v0.to_be_bytes();\n let v1_as_bytes: [u8; 32] = v1.to_be_bytes();\n let hash_input_flattened = v0_as_bytes.concat(v1_as_bytes);\n\n sha256_to_field(hash_input_flattened)\n}\n\n/// Computes sha256 hash of 2 input fields, prefixed by a domain separator, so that the result cannot collide with an\n/// [`accumulate_sha256`] over the same two fields.\n///\n/// @returns A truncated field (i.e., the first byte is always 0).\npub fn accumulate_sha256_with_separator(separator: u32, v0: Field, v1: Field) -> Field {\n // Concatenate the separator and two fields into 4 + 32 x 2 = 68 bytes\n let separator_as_bytes: [u8; 4] = (separator as Field).to_be_bytes();\n let v0_as_bytes: [u8; 32] = v0.to_be_bytes();\n let v1_as_bytes: [u8; 32] = v1.to_be_bytes();\n let hash_input_flattened = separator_as_bytes.concat(v0_as_bytes).concat(v1_as_bytes);\n\n sha256_to_field(hash_input_flattened)\n}\n\npub fn poseidon2_hash<let N: u32>(inputs: [Field; N]) -> Field {\n poseidon::poseidon2::Poseidon2::hash(inputs, N)\n}\n\n#[no_predicates]\npub fn poseidon2_hash_with_separator<let N: u32, T>(inputs: [Field; N], separator: T) -> Field\nwhere\n T: ToField,\n{\n let inputs_with_separator = [separator.to_field()].concat(inputs);\n poseidon2_hash(inputs_with_separator)\n}\n\n/// Computes a Poseidon2 hash over a dynamic-length subarray of the given input.\n/// Only the first `in_len` fields of `input` are absorbed; any remaining fields are ignored.\n/// The caller is responsible for ensuring that the input is padded with zeros if required.\n#[no_predicates]\npub fn poseidon2_hash_subarray<let N: u32>(input: [Field; N], in_len: u32) -> Field {\n let mut sponge = poseidon2_absorb_in_chunks(input, in_len);\n sponge.squeeze()\n}\n\n/// Computes a Poseidon2 hash with a domain separator over a dynamic-length subarray of the given input.\n/// Only the first `in_len` fields of `input` are absorbed; any remaining fields are ignored.\n/// For `in_len == N` this is equivalent to [`poseidon2_hash_with_separator`].\n#[no_predicates]\npub fn poseidon2_hash_subarray_with_separator<let N: u32, T>(\n input: [Field; N],\n in_len: u32,\n separator: T,\n) -> Field\nwhere\n T: ToField,\n{\n let inputs_with_separator = [separator.to_field()].concat(input);\n poseidon::poseidon2::Poseidon2::hash(inputs_with_separator, in_len + 1)\n}\n\n// This function is unconstrained because it is intended to be used in unconstrained context only as\n// in constrained contexts it would be too inefficient.\npub unconstrained fn poseidon2_hash_with_separator_bounded_vec<let N: u32, T>(\n inputs: BoundedVec<Field, N>,\n separator: T,\n) -> Field\nwhere\n T: ToField,\n{\n let in_len = inputs.len() + 1;\n let iv: Field = (in_len as Field) * TWO_POW_64;\n let mut sponge = Poseidon2Sponge::new(iv);\n sponge.absorb(separator.to_field());\n\n for i in 0..inputs.len() {\n sponge.absorb(inputs.get(i));\n }\n\n sponge.squeeze()\n}\n\n#[no_predicates]\npub fn poseidon2_hash_bytes<let N: u32>(inputs: [u8; N]) -> Field {\n let mut fields = [0; (N + 30) / 31];\n let mut field_index = 0;\n let mut current_field = [0; 31];\n for i in 0..inputs.len() {\n let index = i % 31;\n current_field[index] = inputs[i];\n if index == 30 {\n fields[field_index] = field_from_bytes(current_field, false);\n current_field = [0; 31];\n field_index += 1;\n }\n }\n if field_index != fields.len() {\n fields[field_index] = field_from_bytes(current_field, false);\n }\n poseidon2_hash(fields)\n}\n\n#[test]\nfn subarray_hash_matches_fixed() {\n let values_to_hash = [3; 17];\n let padded = values_to_hash.concat([0; 11]);\n let subarray_hash = poseidon2_hash_subarray(padded, values_to_hash.len());\n\n // Hash the entire values_to_hash.\n let fixed_len_hash = poseidon::poseidon2::Poseidon2::hash(values_to_hash, values_to_hash.len());\n\n assert_eq(subarray_hash, fixed_len_hash);\n}\n\n#[test]\nfn subarray_hash_matches_variable() {\n let values_to_hash = [3; 17];\n let padded = values_to_hash.concat([0; 11]);\n let subarray_hash = poseidon2_hash_subarray(padded, values_to_hash.len());\n\n // Hash up to values_to_hash.len() fields of the padded array.\n let variable_len_hash = poseidon::poseidon2::Poseidon2::hash(padded, values_to_hash.len());\n\n assert_eq(subarray_hash, variable_len_hash);\n}\n\n#[test]\nfn subarray_hash_with_separator_matches_fixed_len_with_separator() {\n let values_to_hash = [3; 17];\n let padded = values_to_hash.concat([0; 11]);\n let separator = 42;\n\n assert_eq(\n poseidon2_hash_subarray_with_separator(padded, values_to_hash.len(), separator),\n poseidon2_hash_with_separator(values_to_hash, separator),\n );\n // Hashing the whole array must differ from hashing a prefix of it, even though the padding is zero.\n assert(\n poseidon2_hash_subarray_with_separator(padded, padded.len(), separator)\n != poseidon2_hash_subarray_with_separator(padded, values_to_hash.len(), separator),\n );\n}\n\n#[test]\nfn smoke_sha256_to_field() {\n let full_buffer = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47,\n 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70,\n 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93,\n 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112,\n 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130,\n 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148,\n 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159,\n ];\n let result = sha256_to_field(full_buffer);\n\n assert(result == 0x448ebbc9e1a31220a2f3830c18eef61b9bd070e5084b7fa2a359fe729184c7);\n\n // to show correctness of the current ver (truncate one byte) vs old ver (mod full bytes):\n let result_bytes = sha256::digest(full_buffer);\n let truncated_field = crate::utils::field::field_from_bytes_32_trunc(result_bytes);\n assert(truncated_field == result);\n let mod_res = result + (result_bytes[31] as Field);\n assert(mod_res == 0x448ebbc9e1a31220a2f3830c18eef61b9bd070e5084b7fa2a359fe729184e0);\n}\n\n#[test]\nfn unique_siloed_note_hash_matches_typescript() {\n let inner_note_hash = 1;\n let contract_address = AztecAddress::from_field(2);\n let first_nullifier = 3;\n let note_index_in_tx = 4;\n\n let siloed_note_hash = compute_siloed_note_hash(contract_address, inner_note_hash);\n let siloed_note_hash_from_ts =\n 0x1986a4bea3eddb1fff917d629a13e10f63f514f401bdd61838c6b475db949169;\n assert_eq(siloed_note_hash, siloed_note_hash_from_ts);\n\n let nonce: Field = compute_note_hash_nonce(first_nullifier, note_index_in_tx);\n let note_hash_nonce_from_ts =\n 0x28e7799791bf066a57bb51fdd0fbcaf3f0926414314c7db515ea343f44f5d58b;\n assert_eq(nonce, note_hash_nonce_from_ts);\n\n let unique_siloed_note_hash_from_nonce = compute_unique_note_hash(nonce, siloed_note_hash);\n let unique_siloed_note_hash = compute_note_nonce_and_unique_note_hash(\n siloed_note_hash,\n first_nullifier,\n note_index_in_tx,\n );\n assert_eq(unique_siloed_note_hash_from_nonce, unique_siloed_note_hash);\n\n let unique_siloed_note_hash_from_ts =\n 0x29949aef207b715303b24639737c17fbfeb375c1d965ecfa85c7e4f0febb7d16;\n assert_eq(unique_siloed_note_hash, unique_siloed_note_hash_from_ts);\n}\n\n#[test]\nfn siloed_nullifier_matches_typescript() {\n let contract_address = AztecAddress::from_field(123);\n let nullifier = 456;\n\n let res = compute_siloed_nullifier(contract_address, nullifier);\n\n let siloed_nullifier_from_ts =\n 0x169b50336c1f29afdb8a03d955a81e485f5ac7d5f0b8065673d1e407e5877813;\n\n assert_eq(res, siloed_nullifier_from_ts);\n}\n\n#[test]\nfn siloed_private_log_first_field_matches_typescript() {\n let contract_address = AztecAddress::from_field(123);\n let field = 456;\n let res = compute_siloed_private_log_first_field(contract_address, field);\n\n let siloed_private_log_first_field_from_ts =\n 0x29480984f7b9257fded523d50addbcfc8d1d33adcf2db73ef3390a8fd5cdffaa;\n\n assert_eq(res, siloed_private_log_first_field_from_ts);\n}\n\n#[test]\nfn empty_l2_to_l1_message_hash_matches_typescript() {\n // All zeroes\n let res = compute_l2_to_l1_message_hash(\n L2ToL1Message { recipient: EthAddress::zero(), content: 0 }.scope(AztecAddress::from_field(\n 0,\n )),\n 0,\n 0,\n );\n\n let empty_l2_to_l1_msg_hash_from_ts =\n 0x003b18c58c739716e76429634a61375c45b3b5cd470c22ab6d3e14cee23dd992;\n\n assert_eq(res, empty_l2_to_l1_msg_hash_from_ts);\n}\n\n#[test]\nfn l2_to_l1_message_hash_matches_typescript() {\n let message = L2ToL1Message { recipient: EthAddress::from_field(1), content: 2 }.scope(\n AztecAddress::from_field(3),\n );\n let version = 4;\n let chainId = 5;\n\n let hash = compute_l2_to_l1_message_hash(message, version, chainId);\n\n // The following value was generated by `yarn-project/stdlib/src/hash/hash.test.ts`\n let l2_to_l1_message_hash_from_ts =\n 0x0081edf209e087ad31b3fd24263698723d57190bd1d6e9fe056fc0c0a68ee661;\n\n assert_eq(hash, l2_to_l1_message_hash_from_ts);\n}\n\n#[test]\nunconstrained fn poseidon2_hash_with_separator_bounded_vec_matches_non_bounded_vec_version() {\n let inputs = BoundedVec::<Field, 4>::from_array([1, 2, 3]);\n let separator = 42;\n\n // Hash using bounded vec version\n let bounded_result = poseidon2_hash_with_separator_bounded_vec(inputs, separator);\n\n // Hash using regular version\n let regular_result = poseidon2_hash_with_separator([1, 2, 3], separator);\n\n // Results should match\n assert_eq(bounded_result, regular_result);\n}\n"
|
|
826
|
+
"path": "/mnt/user-data/nicov/nargo/github.com/AztecProtocol/aztec-packages/v6.0.0-rc.6/noir-projects/fnd/noir-protocol-circuits/crates/types/src/hash.nr",
|
|
827
|
+
"source": "mod poseidon2_chunks;\n\nuse crate::{\n abis::{\n contract_class_function_leaf_preimage::ContractClassFunctionLeafPreimage,\n function_selector::FunctionSelector, nullifier::Nullifier, private_log::PrivateLog,\n transaction::tx_request::TxRequest,\n },\n address::{AztecAddress, EthAddress},\n constants::{\n CONTRACT_CLASS_LOG_SIZE_IN_FIELDS, DOM_SEP__NOTE_HASH_NONCE,\n DOM_SEP__PRIVATE_LOG_FIRST_FIELD, DOM_SEP__SILOED_NOTE_HASH, DOM_SEP__SILOED_NULLIFIER,\n DOM_SEP__UNIQUE_NOTE_HASH, FUNCTION_TREE_HEIGHT, NULL_MSG_SENDER_CONTRACT_ADDRESS,\n TWO_POW_64,\n },\n merkle_tree::root_from_sibling_path,\n messaging::l2_to_l1_message::L2ToL1Message,\n poseidon2::Poseidon2Sponge,\n side_effect::{Counted, Scoped},\n traits::{FromField, Hash, ToField},\n utils::field::{field_from_bytes, field_from_bytes_32_trunc},\n};\n\npub use poseidon2_chunks::poseidon2_absorb_in_chunks_existing_sponge;\nuse poseidon2_chunks::poseidon2_absorb_in_chunks;\nuse std::embedded_curve_ops::EmbeddedCurveScalar;\n\n// TODO: refactor these into their own files: sha256, poseidon2, some protocol-specific hash computations, some merkle computations.\n\npub fn sha256_to_field<let N: u32>(bytes_to_hash: [u8; N]) -> Field {\n let sha256_hashed = sha256::digest(bytes_to_hash);\n let hash_in_a_field = field_from_bytes_32_trunc(sha256_hashed);\n\n hash_in_a_field\n}\n\npub fn private_functions_root_from_siblings(\n selector: FunctionSelector,\n vk_hash: Field,\n function_leaf_index: Field,\n function_leaf_sibling_path: [Field; FUNCTION_TREE_HEIGHT],\n) -> Field {\n let function_leaf_preimage = ContractClassFunctionLeafPreimage { selector, vk_hash };\n let function_leaf = function_leaf_preimage.hash();\n root_from_sibling_path(\n function_leaf,\n function_leaf_index,\n function_leaf_sibling_path,\n )\n}\n\n/// Siloing in the context of Aztec refers to the process of hashing a note hash with a contract address (this way\n/// the note hash is scoped to a specific contract). This is used to prevent intermingling of notes between contracts.\npub fn compute_siloed_note_hash(contract_address: AztecAddress, note_hash: Field) -> Field {\n poseidon2_hash_with_separator(\n [contract_address.to_field(), note_hash],\n DOM_SEP__SILOED_NOTE_HASH,\n )\n}\n\n/// Computes unique, siloed note hashes from siloed note hashes.\n///\n/// The protocol injects uniqueness into every note_hash, so that every single note_hash in the\n/// tree is unique. This prevents faerie gold attacks, where a malicious sender could create\n/// two identical note_hashes for a recipient (meaning only one would be nullifiable in future).\n///\n/// Most privacy protocols will inject the note's leaf_index (its position in the Note Hashes Tree)\n/// into the note, but this requires the creator of a note to wait until their tx is included in\n/// a block to know the note's final note hash (the unique, siloed note hash), because inserting\n/// leaves into trees is the job of a block producer.\n///\n/// We took a different approach so that the creator of a note will know each note's unique, siloed\n/// note hash before broadcasting their tx to the network.\n/// (There was also a historical requirement relating to \"chained transactions\" -- a feature that\n/// Aztec Connect had to enable notes to be spent from distinct txs earlier in the same block,\n/// and hence before an archive block root had been established for that block -- but that feature\n/// was abandoned for the Aztec Network for having too many bad tradeoffs).\n///\n/// (\n/// Edit: it is no longer true that all final note_hashes will be known by the creator of a tx\n/// before they send it to the network. If a tx makes public function calls, then _revertible_\n/// note_hashes that are created in private will not be made unique in private by the Reset circuit,\n/// but will instead be made unique by the AVM, because the `note_index_in_tx` will not be known\n/// until the AVM has executed the public functions of the tx. (See an explanation in\n/// reset_output_composer.nr for why).\n/// For some such txs, the `note_index_in_tx` might still be predictable through simulation, but\n/// for txs whose public functions create a varying number of non-revertible notes (determined at\n/// runtime), the `note_index_in_tx` will not be deterministically derivable before submitting the\n/// tx to the network.\n/// )\n///\n/// We use the `first_nullifier` of a tx as a seed of uniqueness. We have a guarantee that there will\n/// always be at least one nullifier per tx, because the init circuit will create one if one isn't\n/// created naturally by any functions of the tx. (Search \"protocol_nullifier\").\n/// We combine the `first_nullifier` with the note's index (its position within this tx's new\n/// note_hashes array) (`note_index_in_tx`) to get a truly unique value to inject into a note, which\n/// we call a `note_nonce`.\npub fn compute_unique_note_hash(note_nonce: Field, siloed_note_hash: Field) -> Field {\n let inputs = [note_nonce, siloed_note_hash];\n poseidon2_hash_with_separator(inputs, DOM_SEP__UNIQUE_NOTE_HASH)\n}\n\npub fn compute_note_hash_nonce(first_nullifier_in_tx: Field, note_index_in_tx: u32) -> Field {\n // Hashing the first nullifier with note index in tx is guaranteed to be unique (because all nullifiers are also\n // unique).\n poseidon2_hash_with_separator(\n [first_nullifier_in_tx, note_index_in_tx as Field],\n DOM_SEP__NOTE_HASH_NONCE,\n )\n}\n\npub fn compute_note_nonce_and_unique_note_hash(\n siloed_note_hash: Field,\n first_nullifier: Field,\n note_index_in_tx: u32,\n) -> Field {\n let note_nonce = compute_note_hash_nonce(first_nullifier, note_index_in_tx);\n compute_unique_note_hash(note_nonce, siloed_note_hash)\n}\n\npub fn compute_siloed_nullifier(contract_address: AztecAddress, nullifier: Field) -> Field {\n poseidon2_hash_with_separator(\n [contract_address.to_field(), nullifier],\n DOM_SEP__SILOED_NULLIFIER,\n )\n}\n\npub fn create_protocol_nullifier(tx_request: TxRequest) -> Scoped<Counted<Nullifier>> {\n // The protocol nullifier is ascribed a special side-effect counter of 1. No other side-effect\n // can have counter 1 (see `validate_as_first_call` for that assertion). Its value is the\n // transaction's nonce commitment (origin, chain id, version, salt): see\n // `TxRequest::compute_protocol_nullifier_value`. The reset kernel siloes it under\n // `NULL_MSG_SENDER_CONTRACT_ADDRESS` like every other nullifier.\n Nullifier { value: tx_request.compute_protocol_nullifier_value(), note_hash: 0 }.count(1).scope(\n NULL_MSG_SENDER_CONTRACT_ADDRESS,\n )\n}\n\npub fn compute_log_tag(raw_tag: Field, dom_sep: u32) -> Field {\n poseidon2_hash_with_separator([raw_tag], dom_sep)\n}\n\npub fn compute_siloed_private_log_first_field(\n contract_address: AztecAddress,\n field: Field,\n) -> Field {\n poseidon2_hash_with_separator(\n [contract_address.to_field(), field],\n DOM_SEP__PRIVATE_LOG_FIRST_FIELD,\n )\n}\n\npub fn compute_siloed_private_log(contract_address: AztecAddress, log: PrivateLog) -> PrivateLog {\n let mut fields = log.fields;\n fields[0] = compute_siloed_private_log_first_field(contract_address, fields[0]);\n PrivateLog::new(fields, log.length)\n}\n\npub fn compute_contract_class_log_hash(log: [Field; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS]) -> Field {\n poseidon2_hash(log)\n}\n\npub fn compute_app_siloed_secret_key(\n master_secret_key: EmbeddedCurveScalar,\n app_address: AztecAddress,\n key_type_domain_separator: Field,\n) -> Field {\n poseidon2_hash_with_separator(\n [master_secret_key.hi, master_secret_key.lo, app_address.to_field()],\n key_type_domain_separator,\n )\n}\n\npub fn compute_l2_to_l1_message_hash(\n message: Scoped<L2ToL1Message>,\n rollup_version_id: Field,\n chain_id: Field,\n) -> Field {\n let contract_address_bytes: [u8; 32] = message.contract_address.to_field().to_be_bytes();\n let recipient_bytes: [u8; 20] = message.inner.recipient.to_be_bytes();\n let content_bytes: [u8; 32] = message.inner.content.to_be_bytes();\n let rollup_version_id_bytes: [u8; 32] = rollup_version_id.to_be_bytes();\n let chain_id_bytes: [u8; 32] = chain_id.to_be_bytes();\n\n let mut bytes: [u8; 148] = std::mem::zeroed();\n for i in 0..32 {\n bytes[i] = contract_address_bytes[i];\n bytes[i + 32] = rollup_version_id_bytes[i];\n // 64 - 84 are for recipient.\n bytes[i + 84] = chain_id_bytes[i];\n bytes[i + 116] = content_bytes[i];\n }\n\n for i in 0..20 {\n bytes[64 + i] = recipient_bytes[i];\n }\n\n sha256_to_field(bytes)\n}\n\n/// Computes sha256 hash of 2 input fields.\n///\n/// @returns A truncated field (i.e., the first byte is always 0).\npub fn accumulate_sha256(v0: Field, v1: Field) -> Field {\n // Concatenate two fields into 32 x 2 = 64 bytes\n let v0_as_bytes: [u8; 32] = v0.to_be_bytes();\n let v1_as_bytes: [u8; 32] = v1.to_be_bytes();\n let hash_input_flattened = v0_as_bytes.concat(v1_as_bytes);\n\n sha256_to_field(hash_input_flattened)\n}\n\n/// Computes sha256 hash of 2 input fields, prefixed by a domain separator, so that the result cannot collide with an\n/// [`accumulate_sha256`] over the same two fields.\n///\n/// @returns A truncated field (i.e., the first byte is always 0).\npub fn accumulate_sha256_with_separator(separator: u32, v0: Field, v1: Field) -> Field {\n // Concatenate the separator and two fields into 4 + 32 x 2 = 68 bytes\n let separator_as_bytes: [u8; 4] = (separator as Field).to_be_bytes();\n let v0_as_bytes: [u8; 32] = v0.to_be_bytes();\n let v1_as_bytes: [u8; 32] = v1.to_be_bytes();\n let hash_input_flattened = separator_as_bytes.concat(v0_as_bytes).concat(v1_as_bytes);\n\n sha256_to_field(hash_input_flattened)\n}\n\npub fn poseidon2_hash<let N: u32>(inputs: [Field; N]) -> Field {\n poseidon::poseidon2::Poseidon2::hash(inputs, N)\n}\n\n#[no_predicates]\npub fn poseidon2_hash_with_separator<let N: u32, T>(inputs: [Field; N], separator: T) -> Field\nwhere\n T: ToField,\n{\n let inputs_with_separator = [separator.to_field()].concat(inputs);\n poseidon2_hash(inputs_with_separator)\n}\n\n/// Computes a Poseidon2 hash over a dynamic-length subarray of the given input.\n/// Only the first `in_len` fields of `input` are absorbed; any remaining fields are ignored.\n/// The caller is responsible for ensuring that the input is padded with zeros if required.\n#[no_predicates]\npub fn poseidon2_hash_subarray<let N: u32>(input: [Field; N], in_len: u32) -> Field {\n let mut sponge = poseidon2_absorb_in_chunks(input, in_len);\n sponge.squeeze()\n}\n\n/// Computes a Poseidon2 hash with a domain separator over a dynamic-length subarray of the given input.\n/// Only the first `in_len` fields of `input` are absorbed; any remaining fields are ignored.\n/// For `in_len == N` this is equivalent to [`poseidon2_hash_with_separator`].\n#[no_predicates]\npub fn poseidon2_hash_subarray_with_separator<let N: u32, T>(\n input: [Field; N],\n in_len: u32,\n separator: T,\n) -> Field\nwhere\n T: ToField,\n{\n let inputs_with_separator = [separator.to_field()].concat(input);\n poseidon::poseidon2::Poseidon2::hash(inputs_with_separator, in_len + 1)\n}\n\n// This function is unconstrained because it is intended to be used in unconstrained context only as\n// in constrained contexts it would be too inefficient.\npub unconstrained fn poseidon2_hash_with_separator_bounded_vec<let N: u32, T>(\n inputs: BoundedVec<Field, N>,\n separator: T,\n) -> Field\nwhere\n T: ToField,\n{\n let in_len = inputs.len() + 1;\n let iv: Field = (in_len as Field) * TWO_POW_64;\n let mut sponge = Poseidon2Sponge::new(iv);\n sponge.absorb(separator.to_field());\n\n for i in 0..inputs.len() {\n sponge.absorb(inputs.get(i));\n }\n\n sponge.squeeze()\n}\n\n/// Computes a Poseidon2 hash of a fixed string, such as a function signature or a domain separator name.\n///\n/// The bytes are packed into 31-byte little-endian chunks, one `Field` per chunk, and the result is\n/// [`poseidon2_hash`] of those fields.\n///\n/// The hash commits to the number of chunks but not to the byte length `N`: zero bytes at the end of the last chunk\n/// do not change the result, so `[1]`, `[1, 0]` and `[1, 0, ..., 0]` (31 bytes) all hash to the same value. Do not\n/// use this to commit to variable-length data, e.g. a payload zero-padded to a maximum length, unless the length is\n/// bound separately.\n#[no_predicates]\npub fn poseidon2_hash_bytes<let N: u32>(inputs: [u8; N]) -> Field {\n let mut fields = [0; (N + 30) / 31];\n let mut field_index = 0;\n let mut current_field = [0; 31];\n for i in 0..inputs.len() {\n let index = i % 31;\n current_field[index] = inputs[i];\n if index == 30 {\n fields[field_index] = field_from_bytes(current_field, false);\n current_field = [0; 31];\n field_index += 1;\n }\n }\n if field_index != fields.len() {\n fields[field_index] = field_from_bytes(current_field, false);\n }\n poseidon2_hash(fields)\n}\n\n#[test]\nfn poseidon2_hash_bytes_matches_hash_of_packed_chunks() {\n let mut bytes = [0; 32];\n bytes[0] = 1;\n bytes[1] = 2;\n bytes[31] = 3;\n\n assert_eq(poseidon2_hash_bytes(bytes), poseidon2_hash([1 + 2 * 256, 3]));\n}\n\n#[test]\nfn poseidon2_hash_bytes_ignores_trailing_zeros_in_last_chunk() {\n let hash = poseidon2_hash_bytes([1]);\n\n assert_eq(poseidon2_hash_bytes([1, 0]), hash);\n assert_eq(poseidon2_hash_bytes([1].concat([0; 30])), hash);\n}\n\n#[test]\nfn poseidon2_hash_bytes_commits_to_chunk_count() {\n let one_chunk: [u8; 31] = [1].concat([0; 30]);\n let two_chunks: [u8; 32] = [1].concat([0; 31]);\n\n assert(poseidon2_hash_bytes(one_chunk) != poseidon2_hash_bytes(two_chunks));\n}\n\n#[test]\nfn subarray_hash_matches_fixed() {\n let values_to_hash = [3; 17];\n let padded = values_to_hash.concat([0; 11]);\n let subarray_hash = poseidon2_hash_subarray(padded, values_to_hash.len());\n\n // Hash the entire values_to_hash.\n let fixed_len_hash = poseidon::poseidon2::Poseidon2::hash(values_to_hash, values_to_hash.len());\n\n assert_eq(subarray_hash, fixed_len_hash);\n}\n\n#[test]\nfn subarray_hash_matches_variable() {\n let values_to_hash = [3; 17];\n let padded = values_to_hash.concat([0; 11]);\n let subarray_hash = poseidon2_hash_subarray(padded, values_to_hash.len());\n\n // Hash up to values_to_hash.len() fields of the padded array.\n let variable_len_hash = poseidon::poseidon2::Poseidon2::hash(padded, values_to_hash.len());\n\n assert_eq(subarray_hash, variable_len_hash);\n}\n\n#[test]\nfn subarray_hash_with_separator_matches_fixed_len_with_separator() {\n let values_to_hash = [3; 17];\n let padded = values_to_hash.concat([0; 11]);\n let separator = 42;\n\n assert_eq(\n poseidon2_hash_subarray_with_separator(padded, values_to_hash.len(), separator),\n poseidon2_hash_with_separator(values_to_hash, separator),\n );\n // Hashing the whole array must differ from hashing a prefix of it, even though the padding is zero.\n assert(\n poseidon2_hash_subarray_with_separator(padded, padded.len(), separator)\n != poseidon2_hash_subarray_with_separator(padded, values_to_hash.len(), separator),\n );\n}\n\n#[test]\nfn smoke_sha256_to_field() {\n let full_buffer = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47,\n 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70,\n 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93,\n 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112,\n 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130,\n 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148,\n 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159,\n ];\n let result = sha256_to_field(full_buffer);\n\n assert(result == 0x448ebbc9e1a31220a2f3830c18eef61b9bd070e5084b7fa2a359fe729184c7);\n\n // to show correctness of the current ver (truncate one byte) vs old ver (mod full bytes):\n let result_bytes = sha256::digest(full_buffer);\n let truncated_field = crate::utils::field::field_from_bytes_32_trunc(result_bytes);\n assert(truncated_field == result);\n let mod_res = result + (result_bytes[31] as Field);\n assert(mod_res == 0x448ebbc9e1a31220a2f3830c18eef61b9bd070e5084b7fa2a359fe729184e0);\n}\n\n#[test]\nfn unique_siloed_note_hash_matches_typescript() {\n let inner_note_hash = 1;\n let contract_address = AztecAddress::from_field(2);\n let first_nullifier = 3;\n let note_index_in_tx = 4;\n\n let siloed_note_hash = compute_siloed_note_hash(contract_address, inner_note_hash);\n let siloed_note_hash_from_ts =\n 0x1986a4bea3eddb1fff917d629a13e10f63f514f401bdd61838c6b475db949169;\n assert_eq(siloed_note_hash, siloed_note_hash_from_ts);\n\n let nonce: Field = compute_note_hash_nonce(first_nullifier, note_index_in_tx);\n let note_hash_nonce_from_ts =\n 0x28e7799791bf066a57bb51fdd0fbcaf3f0926414314c7db515ea343f44f5d58b;\n assert_eq(nonce, note_hash_nonce_from_ts);\n\n let unique_siloed_note_hash_from_nonce = compute_unique_note_hash(nonce, siloed_note_hash);\n let unique_siloed_note_hash = compute_note_nonce_and_unique_note_hash(\n siloed_note_hash,\n first_nullifier,\n note_index_in_tx,\n );\n assert_eq(unique_siloed_note_hash_from_nonce, unique_siloed_note_hash);\n\n let unique_siloed_note_hash_from_ts =\n 0x29949aef207b715303b24639737c17fbfeb375c1d965ecfa85c7e4f0febb7d16;\n assert_eq(unique_siloed_note_hash, unique_siloed_note_hash_from_ts);\n}\n\n#[test]\nfn siloed_nullifier_matches_typescript() {\n let contract_address = AztecAddress::from_field(123);\n let nullifier = 456;\n\n let res = compute_siloed_nullifier(contract_address, nullifier);\n\n let siloed_nullifier_from_ts =\n 0x169b50336c1f29afdb8a03d955a81e485f5ac7d5f0b8065673d1e407e5877813;\n\n assert_eq(res, siloed_nullifier_from_ts);\n}\n\n#[test]\nfn siloed_private_log_first_field_matches_typescript() {\n let contract_address = AztecAddress::from_field(123);\n let field = 456;\n let res = compute_siloed_private_log_first_field(contract_address, field);\n\n let siloed_private_log_first_field_from_ts =\n 0x29480984f7b9257fded523d50addbcfc8d1d33adcf2db73ef3390a8fd5cdffaa;\n\n assert_eq(res, siloed_private_log_first_field_from_ts);\n}\n\n#[test]\nfn empty_l2_to_l1_message_hash_matches_typescript() {\n // All zeroes\n let res = compute_l2_to_l1_message_hash(\n L2ToL1Message { recipient: EthAddress::zero(), content: 0 }.scope(AztecAddress::from_field(\n 0,\n )),\n 0,\n 0,\n );\n\n let empty_l2_to_l1_msg_hash_from_ts =\n 0x003b18c58c739716e76429634a61375c45b3b5cd470c22ab6d3e14cee23dd992;\n\n assert_eq(res, empty_l2_to_l1_msg_hash_from_ts);\n}\n\n#[test]\nfn l2_to_l1_message_hash_matches_typescript() {\n let message = L2ToL1Message { recipient: EthAddress::from_field(1), content: 2 }.scope(\n AztecAddress::from_field(3),\n );\n let version = 4;\n let chainId = 5;\n\n let hash = compute_l2_to_l1_message_hash(message, version, chainId);\n\n // The following value was generated by `yarn-project/stdlib/src/hash/hash.test.ts`\n let l2_to_l1_message_hash_from_ts =\n 0x0081edf209e087ad31b3fd24263698723d57190bd1d6e9fe056fc0c0a68ee661;\n\n assert_eq(hash, l2_to_l1_message_hash_from_ts);\n}\n\n#[test]\nunconstrained fn poseidon2_hash_with_separator_bounded_vec_matches_non_bounded_vec_version() {\n let inputs = BoundedVec::<Field, 4>::from_array([1, 2, 3]);\n let separator = 42;\n\n // Hash using bounded vec version\n let bounded_result = poseidon2_hash_with_separator_bounded_vec(inputs, separator);\n\n // Hash using regular version\n let regular_result = poseidon2_hash_with_separator([1, 2, 3], separator);\n\n // Results should match\n assert_eq(bounded_result, regular_result);\n}\n"
|
|
816
828
|
},
|
|
817
|
-
"
|
|
829
|
+
"443": {
|
|
818
830
|
"function_locations": [
|
|
819
831
|
{
|
|
820
832
|
"name": "derive_serialize",
|
|
@@ -837,10 +849,10 @@
|
|
|
837
849
|
"start": 12587
|
|
838
850
|
}
|
|
839
851
|
],
|
|
840
|
-
"path": "/
|
|
852
|
+
"path": "/mnt/user-data/nicov/nargo/github.com/AztecProtocol/aztec-packages/v6.0.0-rc.6/noir-projects/fnd/noir-protocol-circuits/crates/serde/src/serialization.nr",
|
|
841
853
|
"source": "use crate::{reader::Reader, writer::Writer};\nuse std::meta::type_def::StructField;\n\n/// Trait for serializing Noir types into arrays of Fields.\n///\n/// An implementation of the Serialize trait has to follow Noir's intrinsic serialization (each member of a struct\n/// converted directly into one or more Fields without any packing or compression). This trait (and Deserialize) are\n/// typically used to communicate between Noir and TypeScript (via oracles and function arguments).\n///\n/// # On Following Noir's Intrinsic Serialization\n/// When calling a Noir function from TypeScript (TS), first the function arguments are serialized into an array\n/// of fields. This array is then included in the initial witness. Noir's intrinsic serialization is then used\n/// to deserialize the arguments from the witness. When the same Noir function is called from Noir this Serialize trait\n/// is used instead of the serialization in TS. For this reason we need to have a match between TS serialization,\n/// Noir's intrinsic serialization and the implementation of this trait. If there is a mismatch, the function calls\n/// fail with an arguments hash mismatch error message.\n///\n/// # Associated Constants\n/// * `N` - The length of the output Field array, known at compile time\n///\n/// # Example\n/// ```\n/// impl<let N: u32> Serialize for str<N> {\n/// let N: u32 = N;\n///\n/// fn serialize(self) -> [Field; Self::N] {\n/// let mut writer: Writer<Self::N> = Writer::new();\n/// self.stream_serialize(&mut writer);\n/// writer.finish()\n/// }\n///\n/// fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n/// let bytes = self.as_bytes();\n/// for i in 0..bytes.len() {\n/// writer.write(bytes[i] as Field);\n/// }\n/// }\n/// }\n/// ```\n#[derive_via(derive_serialize)]\npub trait Serialize {\n let N: u32;\n\n fn serialize(self) -> [Field; Self::N];\n\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>);\n}\n\n/// Generates a `Serialize` trait implementation for a struct type.\n///\n/// # Parameters\n/// - `s`: The struct type definition to generate the implementation for\n///\n/// # Returns\n/// A quoted code block containing the trait implementation\n///\n/// # Example\n/// For a struct defined as:\n/// ```\n/// struct Log<N> {\n/// fields: [Field; N],\n/// length: u32\n/// }\n/// ```\n///\n/// This function generates code equivalent to:\n/// ```\n/// impl<let N: u32> Serialize for Log<N> {\n/// let N: u32 = <[Field; N] as Serialize>::N + <u32 as Serialize>::N;\n///\n/// fn serialize(self) -> [Field; Self::N] {\n/// let mut writer: Writer<Self::N> = Writer::new();\n/// self.stream_serialize(&mut writer);\n/// writer.finish()\n/// }\n///\n/// #[inline_always]\n/// fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n/// Serialize::stream_serialize(self.fields, writer);\n/// Serialize::stream_serialize(self.length, writer);\n/// }\n/// }\n/// ```\npub comptime fn derive_serialize(s: TypeDefinition) -> Quoted {\n let typ = s.as_type();\n let nested_struct = typ.as_data_type().unwrap();\n let params = nested_struct.definition().fields(nested_struct.generics());\n\n // Generates the generic parameter declarations (to be placed after the `impl` keyword) and the `where` clause\n // for the `Serialize` trait.\n let generics_declarations = get_generics_declarations(s);\n let where_serialize_clause = get_where_trait_clause(s, quote { Serialize });\n\n let params_len_quote = get_params_len_quote(params);\n\n let function_body = params\n .map(|field: StructField| {\n let name = field.name();\n quote {\n $crate::serialization::Serialize::stream_serialize(self.$name, writer);\n }\n })\n .join(quote {});\n\n quote {\n impl$generics_declarations $crate::serialization::Serialize for $typ\n $where_serialize_clause\n {\n let N: u32 = $params_len_quote;\n\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: $crate::writer::Writer<Self::N> = $crate::writer::Writer::new();\n $crate::serialization::Serialize::stream_serialize(self, &mut writer);\n writer.finish()\n }\n\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut $crate::writer::Writer<K>) {\n $function_body\n }\n }\n }\n}\n\n/// Trait for deserializing Noir types from arrays of Fields.\n///\n/// An implementation of the Deserialize trait has to follow Noir's intrinsic serialization (each member of a struct\n/// converted directly into one or more Fields without any packing or compression). This trait is typically used when\n/// deserializing return values from function calls in Noir. Since the same function could be called from TypeScript\n/// (TS), in which case the TS deserialization would get used, we need to have a match between the 2.\n///\n/// # Associated Constants\n/// * `N` - The length of the input Field array, known at compile time\n///\n/// # Example\n/// ```\n/// impl<let M: u32> Deserialize for str<M> {\n/// let N: u32 = M;\n///\n/// fn deserialize(fields: [Field; Self::N]) -> Self {\n/// let mut reader = Reader::new(fields);\n/// let result = Self::stream_deserialize(&mut reader);\n/// reader.finish();\n/// result\n/// }\n///\n/// fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n/// let mut bytes = [0 as u8; M];\n/// for i in 0..M {\n/// bytes[i] = reader.read() as u8;\n/// }\n/// str::<M>::from(bytes)\n/// }\n/// }\n/// ```\n#[derive_via(derive_deserialize)]\npub trait Deserialize {\n let N: u32;\n\n fn deserialize(fields: [Field; Self::N]) -> Self;\n\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self;\n}\n\n/// Generates a `Deserialize` trait implementation for a given struct `s`.\n///\n/// # Arguments\n/// * `s` - The struct type definition to generate the implementation for\n///\n/// # Returns\n/// A `Quoted` block containing the generated trait implementation\n///\n/// # Requirements\n/// Each struct member type must implement the `Deserialize` trait (it gets used in the generated code).\n///\n/// # Example\n/// For a struct like:\n/// ```\n/// struct MyStruct {\n/// x: AztecAddress,\n/// y: Field,\n/// }\n/// ```\n///\n/// This generates:\n/// ```\n/// impl Deserialize for MyStruct {\n/// let N: u32 = <AztecAddress as Deserialize>::N + <Field as Deserialize>::N;\n///\n/// fn deserialize(fields: [Field; Self::N]) -> Self {\n/// let mut reader = Reader::new(fields);\n/// let result = Self::stream_deserialize(&mut reader);\n/// reader.finish();\n/// result\n/// }\n///\n/// #[inline_always]\n/// fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n/// let x = <AztecAddress as Deserialize>::stream_deserialize(reader);\n/// let y = <Field as Deserialize>::stream_deserialize(reader);\n/// Self { x, y }\n/// }\n/// }\n/// ```\npub comptime fn derive_deserialize(s: TypeDefinition) -> Quoted {\n let typ = s.as_type();\n let nested_struct = typ.as_data_type().unwrap();\n let params = nested_struct.definition().fields(nested_struct.generics());\n\n // Generates the generic parameter declarations (to be placed after the `impl` keyword) and the `where` clause\n // for the `Deserialize` trait.\n let generics_declarations = get_generics_declarations(s);\n let where_deserialize_clause = get_where_trait_clause(s, quote { Deserialize });\n\n // The following will give us:\n // <type_of_struct_member_1 as Deserialize>::N + <type_of_struct_member_2 as Deserialize>::N + ...\n // (or 0 if the struct has no members)\n let right_hand_side_of_definition_of_n = if params.len() > 0 {\n params\n .map(|field: StructField| {\n let param_type = field.typ();\n quote {\n <$param_type as $crate::serialization::Deserialize>::N\n }\n })\n .join(quote {+})\n } else {\n quote { 0 }\n };\n\n // For structs containing a single member, we can enhance performance by directly deserializing the input array,\n // bypassing the need for loop-based array construction. While this optimization yields significant benefits in\n // Brillig where the loops are expected to not be optimized, it is not relevant in ACIR where the loops are\n // expected to be optimized away.\n let function_body = if params.len() > 1 {\n // This generates deserialization code for each struct member and concatenates them together.\n let deserialization_of_struct_members = params\n .map(|field: StructField| {\n let param_name = field.name();\n let param_type = field.typ();\n quote {\n let $param_name = <$param_type as Deserialize>::stream_deserialize(reader);\n }\n })\n .join(quote {});\n\n // We join the struct member names with a comma to be used in the `Self { ... }` syntax\n // This will give us e.g. `a, b, c` for a struct with three fields named `a`, `b`, and `c`.\n let struct_members = params\n .map(|field: StructField| {\n let param_name = field.name();\n quote { $param_name }\n })\n .join(quote {,});\n\n quote {\n $deserialization_of_struct_members\n\n Self { $struct_members }\n }\n } else if params.len() == 1 {\n let param_name = params[0].name();\n quote {\n Self { $param_name: $crate::serialization::Deserialize::stream_deserialize(reader) }\n }\n } else {\n quote {\n Self {}\n }\n };\n\n quote {\n impl$generics_declarations $crate::serialization::Deserialize for $typ\n $where_deserialize_clause\n {\n let N: u32 = $right_hand_side_of_definition_of_n;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = $crate::reader::Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut $crate::reader::Reader<K>) -> Self {\n $function_body\n }\n }\n }\n}\n\n/// Generates a quoted expression that computes the total serialized length of function parameters.\n///\n/// # Parameters\n/// * `params` - The struct fields to serialize. Each field's type needs to implement the Serialize trait.\n///\n/// # Returns\n/// A quoted expression that evaluates to:\n/// * `0` if there are no parameters\n/// * `(<type1 as Serialize>::N + <type2 as Serialize>::N + ...)` for one or more parameters\ncomptime fn get_params_len_quote(params: [StructField]) -> Quoted {\n if params.len() == 0 {\n quote { 0 }\n } else {\n let params_quote_without_parentheses = params\n .map(|field: StructField| {\n let param_type = field.typ();\n quote {\n <$param_type as $crate::serialization::Serialize>::N\n }\n })\n .join(quote {+});\n quote { ($params_quote_without_parentheses) }\n }\n}\n\ncomptime fn get_generics_declarations(s: TypeDefinition) -> Quoted {\n let generics = s.generics();\n\n if generics.len() > 0 {\n let generics_declarations_items = generics\n .map(|generic| {\n let name = generic.typ();\n let maybe_integer_typ = generic.numeric_type();\n // numeric_type is Some only when the generic is numeric.\n if maybe_integer_typ.is_some() {\n // The generic is numeric, so we return a quote defined as e.g. \"let N: u32\"\n let integer_type = maybe_integer_typ.unwrap();\n quote {let $name: $integer_type}\n } else {\n // The generic is not numeric, so we return a quote containing the name of the generic (e.g. \"T\")\n quote { $name }\n }\n })\n .join(quote {,});\n quote {<$generics_declarations_items>}\n } else {\n // The struct doesn't have any generics defined, so we just return an empty quote.\n quote {}\n }\n}\n\ncomptime fn get_where_trait_clause(s: TypeDefinition, trait_name: Quoted) -> Quoted {\n let generics = s.generics();\n\n // numeric_type is Some only when the generic is numeric.\n let non_numeric_generics = generics.filter(|generic| generic.numeric_type().is_none());\n\n if non_numeric_generics.len() > 0 {\n let non_numeric_generics_declarations = non_numeric_generics\n .map(|generic| {\n let name = generic.typ();\n quote {$name: $trait_name}\n })\n .join(quote {,});\n quote {where $non_numeric_generics_declarations}\n } else {\n // There are no non-numeric generics, so we return an empty quote.\n quote {}\n }\n}\n"
|
|
842
854
|
},
|
|
843
|
-
"
|
|
855
|
+
"445": {
|
|
844
856
|
"function_locations": [
|
|
845
857
|
{
|
|
846
858
|
"name": "<impl Serialize for bool>::serialize",
|
|
@@ -1151,10 +1163,10 @@
|
|
|
1151
1163
|
"start": 21246
|
|
1152
1164
|
}
|
|
1153
1165
|
],
|
|
1154
|
-
"path": "/
|
|
1166
|
+
"path": "/mnt/user-data/nicov/nargo/github.com/AztecProtocol/aztec-packages/v6.0.0-rc.6/noir-projects/fnd/noir-protocol-circuits/crates/serde/src/type_impls.nr",
|
|
1155
1167
|
"source": "use crate::{reader::Reader, serialization::{Deserialize, Serialize}, writer::Writer};\nuse std::embedded_curve_ops::EmbeddedCurvePoint;\nuse std::embedded_curve_ops::EmbeddedCurveScalar;\n\nglobal BOOL_SERIALIZED_LEN: u32 = 1;\nglobal U8_SERIALIZED_LEN: u32 = 1;\nglobal U16_SERIALIZED_LEN: u32 = 1;\nglobal U32_SERIALIZED_LEN: u32 = 1;\nglobal U64_SERIALIZED_LEN: u32 = 1;\nglobal U128_SERIALIZED_LEN: u32 = 1;\nglobal FIELD_SERIALIZED_LEN: u32 = 1;\nglobal I8_SERIALIZED_LEN: u32 = 1;\nglobal I16_SERIALIZED_LEN: u32 = 1;\nglobal I32_SERIALIZED_LEN: u32 = 1;\nglobal I64_SERIALIZED_LEN: u32 = 1;\n\nimpl Serialize for bool {\n let N: u32 = BOOL_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as Field);\n }\n}\n\nimpl Deserialize for bool {\n let N: u32 = BOOL_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> bool {\n reader.read() != 0\n }\n}\n\nimpl Serialize for u8 {\n let N: u32 = U8_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as Field);\n }\n}\n\nimpl Deserialize for u8 {\n let N: u32 = U8_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u8\n }\n}\n\nimpl Serialize for u16 {\n let N: u32 = U16_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as Field);\n }\n}\n\nimpl Deserialize for u16 {\n let N: u32 = U16_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u16\n }\n}\n\nimpl Serialize for u32 {\n let N: u32 = U32_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as Field);\n }\n}\n\nimpl Deserialize for u32 {\n let N: u32 = U32_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u32\n }\n}\n\nimpl Serialize for u64 {\n let N: u32 = U64_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as Field);\n }\n}\n\nimpl Deserialize for u64 {\n let N: u32 = U64_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u64\n }\n}\n\nimpl Serialize for u128 {\n let N: u32 = U128_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as Field);\n }\n}\n\nimpl Deserialize for u128 {\n let N: u32 = U128_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u128\n }\n}\n\nimpl Serialize for Field {\n let N: u32 = FIELD_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self);\n }\n}\n\nimpl Deserialize for Field {\n let N: u32 = FIELD_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read()\n }\n}\n\nimpl Serialize for i8 {\n let N: u32 = I8_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as u8 as Field);\n }\n}\n\nimpl Deserialize for i8 {\n let N: u32 = I8_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u8 as i8\n }\n}\n\nimpl Serialize for i16 {\n let N: u32 = I16_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as u16 as Field);\n }\n}\n\nimpl Deserialize for i16 {\n let N: u32 = I16_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u16 as i16\n }\n}\n\nimpl Serialize for i32 {\n let N: u32 = I32_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as u32 as Field);\n }\n}\n\nimpl Deserialize for i32 {\n let N: u32 = I32_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u32 as i32\n }\n}\n\nimpl Serialize for i64 {\n let N: u32 = I64_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as u64 as Field);\n }\n}\n\nimpl Deserialize for i64 {\n let N: u32 = I64_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u64 as i64\n }\n}\n\nimpl<T, let M: u32> Serialize for [T; M]\nwhere\n T: Serialize,\n{\n let N: u32 = <T as Serialize>::N * M;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n for i in 0..M {\n self[i].stream_serialize(writer);\n }\n }\n}\n\nimpl<T, let M: u32> Deserialize for [T; M]\nwhere\n T: Deserialize,\n{\n let N: u32 = <T as Deserialize>::N * M;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n let mut result: [T; M] = std::mem::zeroed();\n for i in 0..M {\n result[i] = T::stream_deserialize(reader);\n }\n result\n }\n}\n\nimpl<T> Serialize for Option<T>\nwhere\n T: Serialize,\n{\n let N: u32 = <T as Serialize>::N + 1;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write_bool(self.is_some());\n if self.is_some() {\n self.unwrap_unchecked().stream_serialize(writer);\n } else {\n writer.advance_offset(<T as Serialize>::N);\n }\n }\n}\n\nimpl<T> Deserialize for Option<T>\nwhere\n T: Deserialize,\n{\n let N: u32 = <T as Deserialize>::N + 1;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n if reader.read_bool() {\n Option::some(<T as Deserialize>::stream_deserialize(reader))\n } else {\n reader.advance_offset(<T as Deserialize>::N);\n Option::none()\n }\n }\n}\n\nglobal SCALAR_SIZE: u32 = 2;\n\nimpl Serialize for EmbeddedCurveScalar {\n\n let N: u32 = SCALAR_SIZE;\n\n fn serialize(self) -> [Field; SCALAR_SIZE] {\n [self.lo, self.hi]\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self.lo);\n writer.write(self.hi);\n }\n}\n\nimpl Deserialize for EmbeddedCurveScalar {\n let N: u32 = SCALAR_SIZE;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n Self { lo: fields[0], hi: fields[1] }\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n Self { lo: reader.read(), hi: reader.read() }\n }\n}\n\nglobal POINT_SIZE: u32 = 2;\n\nimpl Serialize for EmbeddedCurvePoint {\n let N: u32 = POINT_SIZE;\n\n fn serialize(self) -> [Field; Self::N] {\n [self.x, self.y]\n }\n\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self.x);\n writer.write(self.y);\n }\n}\n\nimpl Deserialize for EmbeddedCurvePoint {\n let N: u32 = POINT_SIZE;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n Self { x: fields[0], y: fields[1] }\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n Self { x: reader.read(), y: reader.read() }\n }\n}\n\nimpl<let M: u32> Deserialize for str<M> {\n let N: u32 = M;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n let u8_arr = <[u8; Self::N] as Deserialize>::stream_deserialize(reader);\n str::<Self::N>::from(u8_arr)\n }\n}\n\nimpl<let M: u32> Serialize for str<M> {\n let N: u32 = M;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n self.as_bytes().stream_serialize(writer);\n }\n}\n\n// Note: Not deriving this because it's not supported to call derive_serialize on a \"remote\" struct (and it will never\n// be supported).\nimpl<T, let M: u32> Deserialize for BoundedVec<T, M>\nwhere\n T: Deserialize,\n{\n let N: u32 = <T as Deserialize>::N * M + 1;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n let mut new_bounded_vec: BoundedVec<T, M> = BoundedVec::new();\n let payload_len = Self::N - 1;\n\n // Length is stored in the last field as we need to match intrinsic Noir serialization and the `len` struct\n // field is after `storage` struct field (see `bounded_vec.nr` in noir-stdlib)\n let len = reader.peek_offset(payload_len) as u32;\n\n for i in 0..M {\n if i < len {\n new_bounded_vec.push(<T as Deserialize>::stream_deserialize(reader));\n }\n }\n\n // +1 for the length of the BoundedVec\n reader.advance_offset((M - len) * <T as Deserialize>::N + 1);\n\n new_bounded_vec\n }\n}\n\n// This may cause issues if used as program input, because noir disallows empty arrays for program input.\n// I think this is okay because I don't foresee a unit type being used as input. But leaving this comment as a hint\n// if someone does run into this in the future.\nimpl Deserialize for () {\n let N: u32 = 0;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(_reader: &mut Reader<K>) -> Self {\n ()\n }\n}\n\n// Note: Not deriving this because it's not supported to call derive_serialize on a \"remote\" struct (and it will never\n// be supported).\nimpl<T, let M: u32> Serialize for BoundedVec<T, M>\nwhere\n T: Serialize,\n{\n let N: u32 = <T as Serialize>::N * M + 1; // +1 for the length of the BoundedVec\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n self.storage().stream_serialize(writer);\n // Length is stored in the last field as we need to match intrinsic Noir serialization and the `len` struct\n // field is after `storage` struct field (see `bounded_vec.nr` in noir-stdlib)\n writer.write_u32(self.len() as u32);\n }\n}\n\n// Create a slice of the given length with each element made from `f(i)` where `i` is the current index\ncomptime fn make_slice<Env, T>(length: u32, f: fn[Env](u32) -> T) -> [T] {\n let mut slice = @[];\n for i in 0..length {\n slice = slice.push_back(f(i));\n }\n slice\n}\n\n// Implements Serialize and Deserialize for an arbitrary tuple type\ncomptime fn impl_serialize_for_tuple(_m: Module, length: u32) -> Quoted {\n // `T0`, `T1`, `T2`\n let type_names = make_slice(length, |i| f\"T{i}\".quoted_contents());\n\n // `result0`, `result1`, `result2`\n let result_names = make_slice(length, |i| f\"result{i}\".quoted_contents());\n\n // `T0, T1, T2`\n let field_generics = type_names.join(quote [,]);\n\n // `<T0 as Serialize>::N + <T1 as Serialize>::N + <T2 as Serialize>::N`\n let full_size_serialize = type_names\n .map(|type_name| quote {\n <$type_name as Serialize>::N\n })\n .join(quote [+]);\n\n // `<T0 as Deserialize>::N + <T1 as Deserialize>::N + <T2 as Deserialize>::N`\n let full_size_deserialize = type_names\n .map(|type_name| quote {\n <$type_name as Deserialize>::N\n })\n .join(quote [+]);\n\n // `T0: Serialize, T1: Serialize, T2: Serialize,`\n let serialize_constraints = type_names\n .map(|field_name| quote {\n $field_name: Serialize,\n })\n .join(quote []);\n\n // `T0: Deserialize, T1: Deserialize, T2: Deserialize,`\n let deserialize_constraints = type_names\n .map(|field_name| quote {\n $field_name: Deserialize,\n })\n .join(quote []);\n\n // Statements to serialize each field\n let serialized_fields = type_names\n .mapi(|i, _type_name| quote {\n $crate::serialization::Serialize::stream_serialize(self.$i, writer);\n })\n .join(quote []);\n\n // Statements to deserialize each field\n let deserialized_fields = type_names\n .mapi(|i, type_name| {\n let result_name = result_names[i];\n quote {\n let $result_name = <$type_name as $crate::serialization::Deserialize>::stream_deserialize(reader);\n }\n })\n .join(quote []);\n let deserialize_results = result_names.join(quote [,]);\n\n quote {\n impl<$field_generics> Serialize for ($field_generics) where $serialize_constraints {\n let N: u32 = $full_size_serialize;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: $crate::writer::Writer<Self::N> = $crate::writer::Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut $crate::writer::Writer<K>) {\n\n $serialized_fields\n }\n }\n\n impl<$field_generics> Deserialize for ($field_generics) where $deserialize_constraints {\n let N: u32 = $full_size_deserialize;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = $crate::reader::Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n \n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut $crate::reader::Reader<K>) -> Self {\n $deserialized_fields\n ($deserialize_results)\n }\n }\n }\n}\n\n// Keeping these manual impls. They are more efficient since they do not\n// require copying sub-arrays from any serialized arrays.\nimpl<T1> Serialize for (T1,)\nwhere\n T1: Serialize,\n{\n let N: u32 = <T1 as Serialize>::N;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: crate::writer::Writer<Self::N> = crate::writer::Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n self.0.stream_serialize(writer);\n }\n}\n\nimpl<T1> Deserialize for (T1,)\nwhere\n T1: Deserialize,\n{\n let N: u32 = <T1 as Deserialize>::N;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = crate::reader::Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n (<T1 as Deserialize>::stream_deserialize(reader),)\n }\n}\n\n#[impl_serialize_for_tuple(2)]\n#[impl_serialize_for_tuple(3)]\n#[impl_serialize_for_tuple(4)]\n#[impl_serialize_for_tuple(5)]\n#[impl_serialize_for_tuple(6)]\nmod impls {\n use crate::serialization::{Deserialize, Serialize};\n}\n\n#[test]\nunconstrained fn bounded_vec_serialization() {\n // Test empty BoundedVec\n let empty_vec: BoundedVec<Field, 3> = BoundedVec::from_array([]);\n let serialized = empty_vec.serialize();\n let deserialized = BoundedVec::<Field, 3>::deserialize(serialized);\n assert_eq(empty_vec, deserialized);\n assert_eq(deserialized.len(), 0);\n\n // Test partially filled BoundedVec\n let partial_vec: BoundedVec<[u32; 2], 3> = BoundedVec::from_array([[1, 2]]);\n let serialized = partial_vec.serialize();\n let deserialized = BoundedVec::<[u32; 2], 3>::deserialize(serialized);\n assert_eq(partial_vec, deserialized);\n assert_eq(deserialized.len(), 1);\n assert_eq(deserialized.get(0), [1, 2]);\n\n // Test full BoundedVec\n let full_vec: BoundedVec<[u32; 2], 3> = BoundedVec::from_array([[1, 2], [3, 4], [5, 6]]);\n let serialized = full_vec.serialize();\n let deserialized = BoundedVec::<[u32; 2], 3>::deserialize(serialized);\n assert_eq(full_vec, deserialized);\n assert_eq(deserialized.len(), 3);\n assert_eq(deserialized.get(0), [1, 2]);\n assert_eq(deserialized.get(1), [3, 4]);\n assert_eq(deserialized.get(2), [5, 6]);\n}\n"
|
|
1156
1168
|
},
|
|
1157
|
-
"
|
|
1169
|
+
"446": {
|
|
1158
1170
|
"function_locations": [
|
|
1159
1171
|
{
|
|
1160
1172
|
"name": "Writer<N>::new",
|
|
@@ -1197,7 +1209,7 @@
|
|
|
1197
1209
|
"start": 1263
|
|
1198
1210
|
}
|
|
1199
1211
|
],
|
|
1200
|
-
"path": "/
|
|
1212
|
+
"path": "/mnt/user-data/nicov/nargo/github.com/AztecProtocol/aztec-packages/v6.0.0-rc.6/noir-projects/fnd/noir-protocol-circuits/crates/serde/src/writer.nr",
|
|
1201
1213
|
"source": "pub struct Writer<let N: u32> {\n data: [Field; N],\n offset: u32,\n}\n\nimpl<let N: u32> Writer<N> {\n pub fn new() -> Self {\n Self { data: [0; N], offset: 0 }\n }\n\n pub fn write(&mut self, value: Field) {\n self.data[self.offset] = value;\n self.offset += 1;\n }\n\n pub fn write_u32(&mut self, value: u32) {\n self.write(value as Field);\n }\n\n pub fn write_u64(&mut self, value: u64) {\n self.write(value as Field);\n }\n\n pub fn write_bool(&mut self, value: bool) {\n self.write(value as Field);\n }\n\n pub fn write_array<let K: u32>(&mut self, value: [Field; K]) {\n for i in 0..K {\n self.data[i + self.offset] = value[i];\n }\n self.offset += K;\n }\n\n pub fn write_struct<T, let K: u32>(&mut self, value: T, serialize: fn(T) -> [Field; K]) {\n self.write_array(serialize(value));\n }\n\n pub fn write_struct_array<T, let K: u32, let C: u32>(\n &mut self,\n value: [T; C],\n serialize: fn(T) -> [Field; K],\n ) {\n for i in 0..C {\n self.write_struct(value[i], serialize);\n }\n }\n\n pub fn advance_offset(&mut self, offset: u32) {\n self.offset += offset;\n }\n\n pub fn finish(self) -> [Field; N] {\n assert_eq(self.offset, self.data.len(), \"Writer did not write all data\");\n self.data\n }\n}\n"
|
|
1202
1214
|
},
|
|
1203
1215
|
"53": {
|
|
@@ -1207,7 +1219,7 @@
|
|
|
1207
1219
|
"start": 946
|
|
1208
1220
|
}
|
|
1209
1221
|
],
|
|
1210
|
-
"path": "/
|
|
1222
|
+
"path": "/mnt/user-data/nicov/node-3/noir-projects/noir-contracts/contracts/standard/multi_call_entrypoint_contract/src/main.nr",
|
|
1211
1223
|
"source": "// An entrypoint contract that allows all calls to go through.\n//\n// Used for testing and for situations such as account contract self-deployments (when the account's own entrypoint\n// cannot be used because it is not yet deployed).\n//\n// Pair this with SignerlessWallet to perform multiple actions before any account contracts are deployed (and without\n// authentication).\n//\n// Note that this contract should not be grouped with protocol contracts as it is not part of the protocol. We keep\n// it here for now as it allows us to use hardcoded address.\nuse aztec::{macros::{aztec, AztecConfig}, messages::discovery::do_sync_state_no_op};\n\n#[aztec(AztecConfig::new().custom_sync_state(do_sync_state_no_op))]\npub contract MultiCallEntrypoint {\n use aztec::{authwit::entrypoint::app::AppPayload, macros::functions::{allow_phase_change, external}};\n\n #[external(\"private\")]\n #[allow_phase_change]\n fn entrypoint(app_payload: AppPayload) {\n app_payload.execute_calls(self.context);\n }\n}\n"
|
|
1212
1224
|
},
|
|
1213
1225
|
"58": {
|
|
@@ -1221,7 +1233,7 @@
|
|
|
1221
1233
|
"start": 1175
|
|
1222
1234
|
}
|
|
1223
1235
|
],
|
|
1224
|
-
"path": "/
|
|
1236
|
+
"path": "/mnt/user-data/nicov/node-3/noir-projects/aztec-nr/aztec/src/authwit/entrypoint/app.nr",
|
|
1225
1237
|
"source": "use crate::{authwit::entrypoint::FunctionCall, context::PrivateContext};\nuse crate::protocol::{\n constants::DOM_SEP__SIGNATURE_PAYLOAD,\n hash::poseidon2_hash_with_separator,\n traits::{Deserialize, Hash, Serialize},\n};\nuse std::meta::derive;\n\nglobal ACCOUNT_MAX_CALLS: u32 = 5;\n\n// @dev: If you change the following struct you have to update:\n// - default_entrypoint.ts\n// - account_entrypoint.ts (specifically `getEntrypointAbi()`)\n// - default_multi_call_entrypoint.ts (specifically `getEntrypointAbi()`)\n#[derive(Deserialize, Serialize)]\npub struct AppPayload {\n function_calls: [FunctionCall; ACCOUNT_MAX_CALLS],\n // A nonce that enables transaction cancellation. When the cancellable flag is enabled, this nonce is used to\n // compute a nullifier that is then emitted. This guarantees that we can cancel the transaction by using the same\n // nonce.\n pub tx_nonce: Field,\n}\n\nimpl Hash for AppPayload {\n fn hash(self) -> Field {\n poseidon2_hash_with_separator(self.serialize(), DOM_SEP__SIGNATURE_PAYLOAD)\n }\n}\n\nimpl AppPayload {\n // Executes all private and public calls\n pub fn execute_calls(self, context: &mut PrivateContext) {\n for call in self.function_calls {\n if !call.target_address.is_zero() {\n if call.is_public {\n context.call_public_function_with_calldata_hash(\n call.target_address,\n call.args_hash,\n call.is_static,\n call.hide_msg_sender,\n );\n } else {\n assert(\n !call.hide_msg_sender,\n \"Incompatible flag. `hide_msg_sender = true` is only available for public calls.\",\n );\n let _result = context.call_private_function_with_args_hash(\n call.target_address,\n call.function_selector,\n call.args_hash,\n call.is_static,\n );\n }\n }\n }\n }\n}\n"
|
|
1226
1238
|
},
|
|
1227
1239
|
"6": {
|
|
@@ -1774,91 +1786,91 @@
|
|
|
1774
1786
|
},
|
|
1775
1787
|
{
|
|
1776
1788
|
"name": "PrivateContext::emit_private_log_unsafe",
|
|
1777
|
-
"start":
|
|
1789
|
+
"start": 54944
|
|
1778
1790
|
},
|
|
1779
1791
|
{
|
|
1780
1792
|
"name": "PrivateContext::emit_raw_note_log_unsafe",
|
|
1781
|
-
"start":
|
|
1793
|
+
"start": 56401
|
|
1782
1794
|
},
|
|
1783
1795
|
{
|
|
1784
1796
|
"name": "PrivateContext::emit_contract_class_log",
|
|
1785
|
-
"start":
|
|
1797
|
+
"start": 57409
|
|
1786
1798
|
},
|
|
1787
1799
|
{
|
|
1788
1800
|
"name": "PrivateContext::call_private_function",
|
|
1789
|
-
"start":
|
|
1801
|
+
"start": 61968
|
|
1790
1802
|
},
|
|
1791
1803
|
{
|
|
1792
1804
|
"name": "PrivateContext::static_call_private_function",
|
|
1793
|
-
"start":
|
|
1805
|
+
"start": 63170
|
|
1794
1806
|
},
|
|
1795
1807
|
{
|
|
1796
1808
|
"name": "PrivateContext::call_private_function_no_args",
|
|
1797
|
-
"start":
|
|
1809
|
+
"start": 64185
|
|
1798
1810
|
},
|
|
1799
1811
|
{
|
|
1800
1812
|
"name": "PrivateContext::static_call_private_function_no_args",
|
|
1801
|
-
"start":
|
|
1813
|
+
"start": 65038
|
|
1802
1814
|
},
|
|
1803
1815
|
{
|
|
1804
1816
|
"name": "PrivateContext::call_private_function_with_args_hash",
|
|
1805
|
-
"start":
|
|
1817
|
+
"start": 66016
|
|
1806
1818
|
},
|
|
1807
1819
|
{
|
|
1808
1820
|
"name": "PrivateContext::call_public_function",
|
|
1809
|
-
"start":
|
|
1821
|
+
"start": 69947
|
|
1810
1822
|
},
|
|
1811
1823
|
{
|
|
1812
1824
|
"name": "PrivateContext::static_call_public_function",
|
|
1813
|
-
"start":
|
|
1825
|
+
"start": 71214
|
|
1814
1826
|
},
|
|
1815
1827
|
{
|
|
1816
1828
|
"name": "PrivateContext::call_public_function_no_args",
|
|
1817
|
-
"start":
|
|
1829
|
+
"start": 72233
|
|
1818
1830
|
},
|
|
1819
1831
|
{
|
|
1820
1832
|
"name": "PrivateContext::static_call_public_function_no_args",
|
|
1821
|
-
"start":
|
|
1833
|
+
"start": 73132
|
|
1822
1834
|
},
|
|
1823
1835
|
{
|
|
1824
1836
|
"name": "PrivateContext::call_public_function_with_calldata_hash",
|
|
1825
|
-
"start":
|
|
1837
|
+
"start": 74321
|
|
1826
1838
|
},
|
|
1827
1839
|
{
|
|
1828
1840
|
"name": "PrivateContext::set_public_teardown_function",
|
|
1829
|
-
"start":
|
|
1841
|
+
"start": 76849
|
|
1830
1842
|
},
|
|
1831
1843
|
{
|
|
1832
1844
|
"name": "PrivateContext::set_public_teardown_function_with_calldata_hash",
|
|
1833
|
-
"start":
|
|
1845
|
+
"start": 78120
|
|
1834
1846
|
},
|
|
1835
1847
|
{
|
|
1836
1848
|
"name": "PrivateContext::next_counter",
|
|
1837
|
-
"start":
|
|
1849
|
+
"start": 83524
|
|
1838
1850
|
},
|
|
1839
1851
|
{
|
|
1840
1852
|
"name": "<impl Empty for PrivateContext>::empty",
|
|
1841
|
-
"start":
|
|
1853
|
+
"start": 83693
|
|
1842
1854
|
},
|
|
1843
1855
|
{
|
|
1844
1856
|
"name": "assert_private_log_zero_padded",
|
|
1845
|
-
"start":
|
|
1857
|
+
"start": 85363
|
|
1846
1858
|
},
|
|
1847
1859
|
{
|
|
1848
1860
|
"name": "test::emits_short_log_with_zero_padding",
|
|
1849
|
-
"start":
|
|
1861
|
+
"start": 85957
|
|
1850
1862
|
},
|
|
1851
1863
|
{
|
|
1852
1864
|
"name": "test::rejects_log_with_stale_storage_after_truncate",
|
|
1853
|
-
"start":
|
|
1865
|
+
"start": 86699
|
|
1854
1866
|
},
|
|
1855
1867
|
{
|
|
1856
1868
|
"name": "test::rejects_log_with_stale_storage_after_pop",
|
|
1857
|
-
"start":
|
|
1869
|
+
"start": 87059
|
|
1858
1870
|
}
|
|
1859
1871
|
],
|
|
1860
|
-
"path": "/
|
|
1861
|
-
"source": "use crate::{\n context::{inputs::PrivateContextInputs, NoteExistenceRequest, NullifierExistenceRequest, ReturnsHash},\n hash::{hash_args, hash_calldata_array},\n keys::constants::{NULLIFIER_INDEX, NUM_KEY_TYPES, OUTGOING_INDEX, public_key_domain_separators},\n messaging::process_l1_to_l2_message,\n oracle::{\n block_header::get_block_header_at,\n call_private_function::call_private_function_internal,\n execution_cache,\n key_validation_request::get_key_validation_request,\n logs::notify_created_contract_class_log,\n notes::notify_nullified_note,\n nullifiers::notify_created_nullifier,\n public_call::assert_valid_public_call_data,\n tx_phase::{is_execution_in_revertible_phase, notify_revertible_phase_start},\n },\n};\nuse crate::logging::aztecnr_trace_log_format;\nuse crate::protocol::{\n abis::{\n block_header::BlockHeader,\n call_context::CallContext,\n function_selector::FunctionSelector,\n gas_settings::GasSettings,\n log_hash::LogHash,\n note_hash::NoteHash,\n nullifier::Nullifier,\n private_call_request::PrivateCallRequest,\n private_circuit_public_inputs::PrivateCircuitPublicInputs,\n private_log::{PrivateLog, PrivateLogData},\n public_call_request::PublicCallRequest,\n validation_requests::{KeyValidationRequest, KeyValidationRequestAndSeparator},\n },\n address::{AztecAddress, EthAddress},\n constants::{\n CONTRACT_CLASS_LOG_SIZE_IN_FIELDS, MAX_CONTRACT_CLASS_LOGS_PER_CALL, MAX_ENQUEUED_CALLS_PER_CALL,\n MAX_KEY_VALIDATION_REQUESTS_PER_CALL, MAX_L2_TO_L1_MSGS_PER_CALL, MAX_NOTE_HASH_READ_REQUESTS_PER_CALL,\n MAX_NOTE_HASHES_PER_CALL, MAX_NULLIFIER_READ_REQUESTS_PER_CALL, MAX_NULLIFIERS_PER_CALL,\n MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL, MAX_PRIVATE_LOGS_PER_CALL, MAX_TX_LIFETIME,\n NULL_MSG_SENDER_CONTRACT_ADDRESS, PRIVATE_LOG_CIPHERTEXT_LEN,\n },\n hash::compute_contract_class_log_hash,\n messaging::l2_to_l1_message::L2ToL1Message,\n side_effect::{Counted, scoped::Scoped},\n traits::{Empty, ToField},\n utils::arrays::{ClaimedLengthArray, trimmed_array_length_hint},\n};\n\n/// # PrivateContext\n///\n/// The **main interface** between an #[external(\"private\")] function and the Aztec blockchain.\n///\n/// An instance of the PrivateContext is initialized automatically at the outset of every private function, within the\n/// #[external(\"private\")] macro, so you'll never need to consciously instantiate this yourself.\n///\n/// The instance is always named `context`, and it is always be available within the body of every\n/// #[external(\"private\")] function in your smart contract.\n///\n/// > For those used to \"vanilla\" Noir, it might be jarring to have access to > `context` without seeing a declaration\n/// `let context = PrivateContext::new(...)` > within the body of your function. This is just a consequence of using >\n/// macros to tidy-up verbose boilerplate. You can use `nargo expand` to > expand all macros, if you dare.\n///\n/// Typical usage for a smart contract developer will be to call getter methods of the PrivateContext.\n///\n/// _Pushing_ data and requests to the context is mostly handled within aztec-nr's own functions, so typically a smart\n/// contract developer won't need to call any setter methods directly.\n///\n/// > Advanced users might occasionally wish to push data to the context > directly for lower-level control. If you\n/// find yourself doing this, please > open an issue on GitHub to describe your use case: it might be that > new\n/// functionality should be added to aztec-nr.\n///\n/// ## Responsibilities\n/// - Exposes contextual data to a private function:\n/// - Data relating to how this private function was called.\n/// - msg_sender\n/// - this_address - (the contract address of the private function being executed)\n/// - See `CallContext` for more data.\n/// - Data relating to the transaction in which this private function is being executed.\n/// - chain_id\n/// - version\n/// - gas_settings\n/// - Provides state access:\n/// - Access to the \"Anchor block\" header. Recall, a private function cannot read from the \"current\" block header, but\n/// must read from some historical block header, because as soon as private function execution begins (asynchronously,\n/// on a user's device), the public state of the chain (the \"current state\") will have progressed forward. We call this\n/// reference the \"Anchor block\". See `BlockHeader`.\n/// - Enables consumption of L1->L2 messages.\n/// - Enables calls to functions of other smart contracts:\n/// - Private function calls\n/// - Enqueueing of public function call requests (Since public functions are executed at a later time, by a block\n/// proposer, we say they are \"enqueued\").\n/// - Writes data to the blockchain:\n/// - New notes\n/// - New nullifiers\n/// - Private logs (for sending encrypted note contents or encrypted events)\n/// - New L2->L1 messages.\n/// - Provides args to the private function (handled by the #[external(\"private\")] macro).\n/// - Returns the return values of this private function (handled by the\n/// #[external(\"private\")] macro).\n/// - Makes Key Validation Requests.\n/// - Private functions are not allowed to see master secret keys, because we do not trust them. They are instead given\n/// \"app-siloed\" secret keys with a claim that they relate to a master public key. They can then request validation of\n/// this claim, by making a \"key validation request\" to the protocol's kernel circuits (which _are_ allowed to see\n/// certain master secret keys).\n///\n/// ## Advanced Responsibilities\n///\n/// - Ultimately, the PrivateContext is responsible for constructing the PrivateCircuitPublicInputs of the private\n/// function being executed. All private functions on Aztec must have public inputs which adhere to the rigid layout of\n/// the PrivateCircuitPublicInputs, in order to be compatible with the protocol's kernel circuits. A well-known\n/// misnomer:\n/// - \"public inputs\" contain both inputs and outputs of this function.\n/// - By \"outputs\" we mean a lot more side-effects than just the \"return values\" of the function.\n/// - Most of the so-called \"public inputs\" are kept _private_, and never leak to the outside world, because they are\n/// 'swallowed' by the protocol's kernel circuits before the tx is sent to the network. Only the following are exposed\n/// to the outside world:\n/// - New note_hashes\n/// - New nullifiers\n/// - New private logs\n/// - New L2->L1 messages\n/// - New enqueued public function call requests All the above-listed arrays of side-effects can be padded by the\n/// user's wallet (through instructions to the kernel circuits, via the PXE) to obscure their true lengths.\n///\n/// ## Syntax Justification\n///\n/// Both user-defined functions _and_ most functions in aztec-nr need access to the PrivateContext instance to\n/// read/write data. This is why you'll see the arguably-ugly pervasiveness of the \"context\" throughout your smart\n/// contract and the aztec-nr library. For example, `&mut context` is prevalent. In some languages, you can access and\n/// mutate a global variable (such as a PrivateContext instance) from a function without polluting the function's\n/// parameters. With Noir, a function must explicitly pass control of a mutable variable to another function, by\n/// reference. Since many functions in aztec-nr need to be able to push new data to the PrivateContext, they need to be\n/// handed a mutable reference _to_ the context as a parameter. For example, `Context` is prevalent as a generic\n/// parameter, to give better type safety at compile time. Many `aztec-nr` functions don't make sense if they're called\n/// in a particular runtime (private, public or utility), and so are intentionally only implemented over certain\n/// [Private|Public|Utility]Context structs. This gives smart contract developers a much faster feedback loop if\n/// they're making a mistake, as an error will be thrown by the LSP or when they compile their contract.\n///\n#[derive(Eq)]\npub struct PrivateContext {\n // docs:start:private-context\n inputs: PrivateContextInputs,\n side_effect_counter: u32,\n\n min_revertible_side_effect_counter: u32,\n is_fee_payer: bool,\n\n args_hash: Field,\n return_hash: Field,\n\n pub(crate) expiration_timestamp: u64,\n\n pub(crate) note_hash_read_requests: BoundedVec<Scoped<Counted<Field>>, MAX_NOTE_HASH_READ_REQUESTS_PER_CALL>,\n pub(crate) nullifier_read_requests: BoundedVec<Scoped<Counted<Field>>, MAX_NULLIFIER_READ_REQUESTS_PER_CALL>,\n key_validation_requests_and_separators: BoundedVec<KeyValidationRequestAndSeparator, MAX_KEY_VALIDATION_REQUESTS_PER_CALL>,\n\n pub(crate) note_hashes: BoundedVec<Counted<NoteHash>, MAX_NOTE_HASHES_PER_CALL>,\n pub(crate) nullifiers: BoundedVec<Counted<Nullifier>, MAX_NULLIFIERS_PER_CALL>,\n\n pub(crate) private_call_requests: BoundedVec<PrivateCallRequest, MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL>,\n public_call_requests: BoundedVec<Counted<PublicCallRequest>, MAX_ENQUEUED_CALLS_PER_CALL>,\n public_teardown_call_request: PublicCallRequest,\n l2_to_l1_msgs: BoundedVec<Counted<L2ToL1Message>, MAX_L2_TO_L1_MSGS_PER_CALL>,\n // docs:end:private-context\n\n // Header of a block whose state is used during private execution (not the block the transaction is included in).\n pub(crate) anchor_block_header: BlockHeader,\n\n private_logs: BoundedVec<Counted<PrivateLogData>, MAX_PRIVATE_LOGS_PER_CALL>,\n contract_class_logs_hashes: BoundedVec<Counted<LogHash>, MAX_CONTRACT_CLASS_LOGS_PER_CALL>,\n\n // Contains the last key validation request for each key type. This is used to cache the last request and avoid\n // fetching the same request multiple times. The index of the array corresponds to the key type (0 nullifier, 1\n // incoming, 2 outgoing, 3 tagging).\n last_key_validation_requests: [Option<KeyValidationRequest>; NUM_KEY_TYPES],\n\n expected_non_revertible_side_effect_counter: u32,\n expected_revertible_side_effect_counter: u32,\n}\n\nimpl PrivateContext {\n pub fn new(inputs: PrivateContextInputs, args_hash: Field) -> PrivateContext {\n PrivateContext {\n inputs,\n side_effect_counter: inputs.start_side_effect_counter + 1,\n min_revertible_side_effect_counter: 0,\n is_fee_payer: false,\n args_hash,\n return_hash: 0,\n expiration_timestamp: inputs.anchor_block_header.timestamp() + MAX_TX_LIFETIME,\n note_hash_read_requests: BoundedVec::new(),\n nullifier_read_requests: BoundedVec::new(),\n key_validation_requests_and_separators: BoundedVec::new(),\n note_hashes: BoundedVec::new(),\n nullifiers: BoundedVec::new(),\n anchor_block_header: inputs.anchor_block_header,\n private_call_requests: BoundedVec::new(),\n public_call_requests: BoundedVec::new(),\n public_teardown_call_request: PublicCallRequest::empty(),\n l2_to_l1_msgs: BoundedVec::new(),\n private_logs: BoundedVec::new(),\n contract_class_logs_hashes: BoundedVec::new(),\n last_key_validation_requests: [Option::none(); NUM_KEY_TYPES],\n expected_non_revertible_side_effect_counter: 0,\n expected_revertible_side_effect_counter: 0,\n }\n }\n\n /// Returns the contract address that initiated this function call.\n ///\n /// This is similar to `msg.sender` in Solidity (hence the name).\n ///\n /// Important Note: Since Aztec doesn't have a concept of an EoA (Externally-owned Account), the msg_sender is\n /// \"none\" for the first function call of every transaction. The first function call of a tx is likely to be a call\n /// to the user's account contract, so this quirk will most often be handled by account contract developers.\n ///\n /// # Returns\n /// * `Option<AztecAddress>` - The address of the smart contract that called this function (be it an app contract\n /// or a user's account contract). Returns `Option<AztecAddress>::none` for the first function call of the tx. No\n /// other _private_ function calls in the tx will have a `none` msg_sender, but _public_ function calls might (see\n /// the PublicContext).\n pub fn maybe_msg_sender(self) -> Option<AztecAddress> {\n let maybe_msg_sender = self.inputs.call_context.msg_sender;\n if maybe_msg_sender == NULL_MSG_SENDER_CONTRACT_ADDRESS {\n Option::none()\n } else {\n Option::some(maybe_msg_sender)\n }\n }\n\n /// Returns the contract address of the current function being executed.\n ///\n /// This is equivalent to `address(this)` in Solidity (hence the name). Use this to identify the current contract's\n /// address, commonly needed for access control or when interacting with other contracts.\n ///\n /// # Returns\n /// * `AztecAddress` - The contract address of the current function being executed.\n ///\n pub fn this_address(self) -> AztecAddress {\n self.inputs.call_context.contract_address\n }\n\n /// Returns the chain ID of the current network.\n ///\n /// This is similar to `block.chainid` in Solidity. Returns the unique identifier for the blockchain network this\n /// transaction is executing on.\n ///\n /// Helps prevent cross-chain replay attacks. Useful if implementing multi-chain contract logic.\n ///\n /// # Returns\n /// * `Field` - The chain ID as a field element\n ///\n pub fn chain_id(self) -> Field {\n self.inputs.tx_context.chain_id\n }\n\n /// Returns the Aztec protocol version that this transaction is executing under. Different versions may have\n /// different rules, opcodes, or cryptographic primitives.\n ///\n /// This is similar to how Ethereum has different EVM versions.\n ///\n /// Useful for forward/backward compatibility checks\n ///\n /// Not to be confused with contract versions; this is the protocol version.\n ///\n /// # Returns\n /// * `Field` - The protocol version as a field element\n ///\n pub fn version(self) -> Field {\n self.inputs.tx_context.version\n }\n\n /// Returns the gas settings for the current transaction.\n ///\n /// This provides information about gas limits and pricing for the transaction, similar to `tx.gasprice` and gas\n /// limits in Ethereum. However, Aztec has a more sophisticated gas model with separate accounting for L2\n /// computation and data availability (DA) costs.\n ///\n /// # Returns\n /// * `GasSettings` - Struct containing gas limits and fee information\n ///\n pub fn gas_settings(self) -> GasSettings {\n self.inputs.tx_context.gas_settings\n }\n\n /// Returns the function selector of the currently executing function.\n ///\n /// Low-level function: Ordinarily, smart contract developers will not need to access this.\n ///\n /// This is similar to `msg.sig` in Solidity, which returns the first 4 bytes of the function signature. In Aztec,\n /// the selector uniquely identifies which function within the contract is being called.\n ///\n /// # Returns\n /// * `FunctionSelector` - The 4-byte function identifier\n ///\n /// # Advanced\n /// Only #[external(\"private\")] functions have a function selector as a protocol- enshrined concept. The function\n /// selectors of private functions are baked into the preimage of the contract address, and are used by the\n /// protocol's kernel circuits to identify each private function and ensure the correct one is being executed.\n ///\n /// Used internally for function dispatch and call verification.\n ///\n pub fn selector(self) -> FunctionSelector {\n self.inputs.call_context.function_selector\n }\n\n /// Returns whether this call is being executed as part of a static call.\n ///\n /// Similar to Solidity's `STATICCALL`, a static call is read-only: neither this function nor any of its nested\n /// calls may emit side-effects (new notes, nullifiers, logs, L2->L1 messages, etc.). A call is considered static\n /// if it was invoked as a static call or if any of its ancestor calls were.\n ///\n /// # Returns\n /// * `bool` - `true` if this call (or an ancestor call) is a static call.\n ///\n pub fn is_static_call(self) -> bool {\n self.inputs.call_context.is_static_call\n }\n\n /// Returns the hash of the arguments passed to the current function.\n ///\n /// Very low-level function: You shouldn't need to call this. The #[external(\"private\")] macro calls this, and it\n /// makes the arguments neatly available to the body of your private function.\n ///\n /// # Returns\n /// * `Field` - Hash of the function arguments\n ///\n /// # Advanced\n /// * Arguments are hashed to reduce proof size and verification time\n /// * Enables efficient argument passing in recursive function calls\n /// * The hash can be used to retrieve the original arguments from the PXE.\n ///\n pub fn get_args_hash(self) -> Field {\n self.args_hash\n }\n\n /// Returns the current value of the side-effect counter, i.e. the counter that will be assigned to the next\n /// side-effect emitted by this function.\n ///\n /// Low-level function: Ordinarily, smart contract developers will not need to access this. See `next_counter` for\n /// details on how side-effect counters are assigned and why they exist.\n ///\n /// # Returns\n /// * `u32` - The current side-effect counter.\n ///\n pub fn get_side_effect_counter(self) -> u32 {\n self.side_effect_counter\n }\n\n /// Pushes a new note_hash to the Aztec blockchain's global Note Hash Tree (a state tree).\n ///\n /// A note_hash is a commitment to a piece of private state.\n ///\n /// Low-level function: Ordinarily, smart contract developers will not need to manually call this. Aztec-nr's state\n /// variables (see `../state_vars/`) are designed to understand when to create and push new note hashes.\n ///\n /// # Arguments\n /// * `note_hash` - The new note_hash.\n ///\n /// # Advanced\n /// From here, the protocol's kernel circuits will take over and insert the note_hash into the protocol's \"note\n /// hash tree\" (in the Base Rollup circuit). Before insertion, the protocol will:\n /// - \"Silo\" the `note_hash` with the contract address of this function, to yield a `siloed_note_hash`. This\n /// prevents state collisions between different smart contracts.\n /// - Ensure uniqueness of the `siloed_note_hash`, to prevent Faerie-Gold attacks, by hashing the\n /// `siloed_note_hash` with a unique value, to yield a `unique_siloed_note_hash` (see the protocol spec for more).\n ///\n /// In addition to calling this function, aztec-nr provides the contents of the newly-created note to the PXE, via\n /// the `notify_created_note` oracle.\n ///\n /// > Advanced users might occasionally wish to push data to the context > directly for lower-level control. If you\n /// find yourself doing this, > please open an issue on GitHub to describe your use case: it might be > that new\n /// functionality should be added to aztec-nr.\n ///\n pub fn push_note_hash(&mut self, note_hash: Field) {\n self.note_hashes.push(Counted::new(note_hash, self.next_counter()));\n }\n\n /// Creates a new [nullifier](crate::nullifier).\n ///\n /// ## Safety\n ///\n /// This is a low-level function that must be used with great care to avoid subtle corruption of contract state.\n /// Instead of calling this function, consider using the higher-level [`crate::state_vars::SingleUseClaim`].\n ///\n /// In particular, callers must ensure all nullifiers created by a contract are properly domain-separated, so that\n /// unrelated components don't interfere with one another (e.g. a transaction nullifier accidentally marking a\n /// variable as initialized). Only [`PrivateContext::push_nullifier_for_note_hash`] should be used for note\n /// nullifiers, never this one.\n ///\n /// ## Advanced\n ///\n /// The raw `nullifier` is not what is inserted into the Aztec state tree: it will be first siloed by contract\n /// address via [`crate::protocol::hash::compute_siloed_nullifier`] in order to prevent accidental or malicious\n /// interference of nullifiers from different contracts.\n pub fn push_nullifier_unsafe(&mut self, nullifier: Field) {\n notify_created_nullifier(nullifier);\n self.nullifiers.push(Nullifier { value: nullifier, note_hash: 0 }.count(self.next_counter()));\n }\n\n /// Creates a new [nullifier](crate::nullifier) associated with a note.\n ///\n /// This is a variant of [`PrivateContext::push_nullifier_unsafe`] that is used for note nullifiers, i.e.\n /// nullifiers that correspond to a note. If a note and its nullifier are created in the same transaction, then\n /// the private kernels will 'squash' these values, deleting them both as if they never existed and reducing\n /// transaction fees.\n ///\n /// The `nullification_note_hash` must be the result of calling\n /// [`crate::note::utils::compute_confirmed_note_hash_for_nullification`] for pending notes, and `0` for settled\n /// notes (which cannot be squashed).\n ///\n /// ## Safety\n ///\n /// This is a low-level function that must be used with great care to avoid subtle corruption of contract state.\n /// Instead of calling this function, consider using the higher-level [`crate::note::lifecycle::destroy_note`].\n ///\n /// The precautions listed for [`PrivateContext::push_nullifier_unsafe`] apply here as well, and callers should\n /// additionally ensure `nullification_note_hash` corresponds to a note emitted by this contract, with its hash\n /// computed in the same transaction execution phase as the call to this function. Finally, only this function\n /// should be used for note nullifiers, never [`PrivateContext::push_nullifier_unsafe`].\n ///\n /// Failure to do these things can result in unprovable contexts, accidental deletion of notes, or double-spend\n /// attacks.\n pub fn push_nullifier_for_note_hash(&mut self, nullifier: Field, nullification_note_hash: Field) {\n let nullifier_counter = self.next_counter();\n notify_nullified_note(nullifier, nullification_note_hash, nullifier_counter);\n self.nullifiers.push(Nullifier { value: nullifier, note_hash: nullification_note_hash }.count(\n nullifier_counter,\n ));\n }\n\n /// Returns the anchor block header - the historical block header that this private function is reading from.\n ///\n /// A private function CANNOT read from the \"current\" block header, but must read from some older block header,\n /// because as soon as private function execution begins (asynchronously, on a user's device), the public state of\n /// the chain (the \"current state\") will have progressed forward.\n ///\n /// # Returns\n /// * `BlockHeader` - The anchor block header.\n ///\n /// # Advanced\n /// * All private functions of a tx read from the same anchor block header.\n /// * The protocol asserts that the `expiration_timestamp` of every tx is at most 24 hours beyond the timestamp of\n /// the tx's chosen anchor block header. This enables the network's nodes to safely prune old txs from the mempool.\n /// Therefore, the chosen block header _must_ be one from within the last 24 hours.\n ///\n pub fn get_anchor_block_header(self) -> BlockHeader {\n self.anchor_block_header\n }\n\n /// Returns the header of any historical block at or before the anchor block.\n ///\n /// This enables private contracts to access information from even older blocks than the anchor block header.\n ///\n /// Useful for time-based contract logic that needs to compare against multiple historical points.\n ///\n /// # Arguments\n /// * `block_number` - The block number to retrieve (must be <= anchor block number)\n ///\n /// # Returns\n /// * `BlockHeader` - The header of the requested historical block\n ///\n /// # Advanced\n /// This function uses an oracle to fetch block header data from the user's PXE. Depending on how much blockchain\n /// data the user's PXE has been set up to store, this might require a query from the PXE to another Aztec node to\n /// get the data. > This is generally true of all oracle getters (see `../oracle`).\n ///\n /// Each block header gets hashed and stored as a leaf in the protocol's Archive Tree. In fact, the i-th block\n /// header gets stored at the i-th leaf index of the Archive Tree. Behind the scenes, this `get_block_header_at`\n /// function will add Archive Tree merkle-membership constraints (~3k) to your smart contract function's circuit,\n /// to prove existence of the block header in the Archive Tree.\n ///\n /// Note: we don't do any caching, so avoid making duplicate calls for the same block header, because each call\n /// will add duplicate constraints.\n ///\n /// Calling this function is more expensive (constraint-wise) than getting the anchor block header (via\n /// `get_block_header`). This is because the anchor block's merkle membership proof is handled by Aztec's protocol\n /// circuits, and is only performed once for the entire tx because all private functions of a tx share a common\n /// anchor block header. Therefore, the cost (constraint-wise) of calling `get_block_header` is effectively free.\n ///\n pub fn get_block_header_at(self, block_number: u32) -> BlockHeader {\n get_block_header_at(block_number, self)\n }\n\n /// Sets the hash of the return values for this private function.\n ///\n /// Very low-level function: this is called by the #[external(\"private\")] macro.\n ///\n /// # Arguments\n /// * `serialized_return_values` - The serialized return values as a field array\n ///\n pub fn set_return_hash<let N: u32>(&mut self, serialized_return_values: [Field; N]) {\n let return_hash = hash_args(serialized_return_values);\n self.return_hash = return_hash;\n execution_cache::store(serialized_return_values, return_hash);\n }\n\n /// Builds the PrivateCircuitPublicInputs for this private function, to ensure compatibility with the protocol's\n /// kernel circuits.\n ///\n /// Very low-level function: This function is automatically called by the #[external(\"private\")] macro.\n pub fn finish(self) -> PrivateCircuitPublicInputs {\n PrivateCircuitPublicInputs {\n call_context: self.inputs.call_context,\n args_hash: self.args_hash,\n returns_hash: self.return_hash,\n min_revertible_side_effect_counter: self.min_revertible_side_effect_counter,\n is_fee_payer: self.is_fee_payer,\n expiration_timestamp: self.expiration_timestamp,\n note_hash_read_requests: ClaimedLengthArray::from_bounded_vec(self.note_hash_read_requests),\n nullifier_read_requests: ClaimedLengthArray::from_bounded_vec(self.nullifier_read_requests),\n key_validation_requests_and_separators: ClaimedLengthArray::from_bounded_vec(\n self.key_validation_requests_and_separators,\n ),\n note_hashes: ClaimedLengthArray::from_bounded_vec(self.note_hashes),\n nullifiers: ClaimedLengthArray::from_bounded_vec(self.nullifiers),\n private_call_requests: ClaimedLengthArray::from_bounded_vec(self.private_call_requests),\n public_call_requests: ClaimedLengthArray::from_bounded_vec(self.public_call_requests),\n public_teardown_call_request: self.public_teardown_call_request,\n l2_to_l1_msgs: ClaimedLengthArray::from_bounded_vec(self.l2_to_l1_msgs),\n start_side_effect_counter: self.inputs.start_side_effect_counter,\n end_side_effect_counter: self.side_effect_counter,\n private_logs: ClaimedLengthArray::from_bounded_vec(self.private_logs),\n contract_class_logs_hashes: ClaimedLengthArray::from_bounded_vec(self.contract_class_logs_hashes),\n anchor_block_header: self.anchor_block_header,\n tx_context: self.inputs.tx_context,\n expected_non_revertible_side_effect_counter: self.expected_non_revertible_side_effect_counter,\n expected_revertible_side_effect_counter: self.expected_revertible_side_effect_counter,\n protocol_nullifier: self.inputs.protocol_nullifier,\n }\n }\n\n /// Designates this contract as the fee payer for the transaction.\n ///\n /// Unlike Ethereum, where the transaction sender always pays fees, Aztec allows any contract to voluntarily pay\n /// transaction fees. This enables patterns like sponsored transactions or fee abstraction where users don't need\n /// to hold fee-juice themselves. (Fee juice is a fee-paying asset for Aztec).\n ///\n /// Only one contract per transaction can declare itself as the fee payer, and it must have sufficient fee-juice\n /// balance (>= the gas limits specified in the TxContext) by the time we reach the public setup phase of the tx.\n ///\n /// The fee payer must be elected during the setup (non-revertible) phase, i.e. before\n /// [`end_setup`](PrivateContext::end_setup) is called - this function asserts so. This is because any compensation\n /// collected by the fee payer during the revertible phase can be discarded if a public call later reverts, while\n /// the protocol still debits the fee payer's fee-juice balance. Note that `end_setup` does not need to be called\n /// by the electing function itself: it can be called later in the transaction (e.g. by the fee-juice contract when\n /// claiming fee juice that pays for the very same transaction).\n pub fn set_as_fee_payer(&mut self) {\n assert(!self.in_revertible_phase(), \"fee payer must be elected during the setup phase\");\n aztecnr_trace_log_format!(\"Setting {0} as fee payer\")([self.this_address().to_field()]);\n self.is_fee_payer = true;\n }\n\n /// Returns whether execution is currently in the revertible (app) phase of the transaction.\n ///\n /// A transaction is in the revertible phase if [`end_setup`](PrivateContext::end_setup) has already been called -\n /// potentially by a different function of the same transaction.\n pub fn in_revertible_phase(&mut self) -> bool {\n let current_counter = self.side_effect_counter;\n\n // Safety: Kernel will validate that the claim is correct by validating the expected counters.\n let is_revertible = unsafe { is_execution_in_revertible_phase(current_counter) };\n\n if is_revertible {\n if (self.expected_revertible_side_effect_counter == 0)\n | (current_counter < self.expected_revertible_side_effect_counter) {\n self.expected_revertible_side_effect_counter = current_counter;\n }\n } else if current_counter > self.expected_non_revertible_side_effect_counter {\n self.expected_non_revertible_side_effect_counter = current_counter;\n }\n\n is_revertible\n }\n\n /// Declares the end of the \"setup phase\" of this tx.\n ///\n /// Only one function per tx can declare the end of the setup phase.\n ///\n /// Niche function: Only wallet developers and paymaster contract developers (aka Fee-payment contracts) will need\n /// to make use of this function.\n ///\n /// Aztec supports a three-phase execution model: setup, app logic, teardown. The phases exist to enable a fee\n /// payer to take on the risk of paying a transaction fee, safe in the knowledge that their payment (in whatever\n /// token or method the user chooses) will succeed, regardless of whether the app logic will succeed. The \"setup\"\n /// phase enables such a payment to be made, because the setup phase _cannot revert_: a reverting function within\n /// the setup phase would result in an invalid block which cannot be proven. Any side-effects generated during that\n /// phase are guaranteed to be inserted into Aztec's state trees (except for squashed notes & nullifiers, of\n /// course).\n ///\n /// Even though the end of the setup phase is declared within a private function, you might have noticed that\n /// _public_ functions can also execute within the setup phase. This is because any public function calls which\n /// were enqueued _within the setup phase_ by a private function are considered part of the setup phase.\n ///\n /// # Advanced\n /// * Sets the minimum revertible side effect counter of this tx to be the PrivateContext's _current_ side effect\n /// counter.\n ///\n pub fn end_setup(&mut self) {\n // We bump the counter twice: once so that `min_revertible_side_effect_counter` sits strictly above any\n // non-revertible side effect counter (including queries made via `in_revertible_phase` before this call), and\n // once more so that the next revertible side effect counter is strictly greater than\n // `min_revertible_side_effect_counter`. This ensures `min_revertible_side_effect_counter` occupies a gap that\n // no side effect takes, which the kernel relies on when validating the phase split.\n self.side_effect_counter += 1;\n self.min_revertible_side_effect_counter = self.side_effect_counter;\n self.side_effect_counter += 1;\n\n aztecnr_trace_log_format!(\n \"Ending setup, minimum revertible side effect counter is {0}\",\n )(\n [self.min_revertible_side_effect_counter as Field],\n );\n notify_revertible_phase_start(self.min_revertible_side_effect_counter);\n }\n\n /// Sets a deadline (an \"include-by timestamp\") for when this transaction must be included in a block.\n ///\n /// Other functions in this tx might call this setter with differing values for the include-by timestamp. To ensure\n /// that all functions' deadlines are met, the _minimum_ of all these include-by timestamps will be exposed when\n /// this tx is submitted to the network.\n ///\n /// If the transaction is not included in a block by its include-by timestamp, it becomes invalid and it will never\n /// be included.\n ///\n /// This expiry timestamp is publicly visible. See the \"Advanced\" section for privacy concerns.\n ///\n /// # Arguments\n /// * `expiration_timestamp` - Unix timestamp (seconds) deadline for inclusion. The include-by timestamp of this tx\n /// will be _at most_ the timestamp specified.\n ///\n /// # Advanced\n /// * If multiple functions set differing `expiration_timestamp`s, the kernel circuits will set it to be the\n /// _minimum_ of the two. This ensures the tx expiry requirements of all functions in the tx are met.\n /// * Rollup circuits will reject expired txs.\n /// * The protocol enforces that all transactions must be included within 24 hours of their chosen anchor block's\n /// timestamp, to enable safe mempool pruning.\n /// * The DelayedPublicMutable design makes heavy use of this functionality, to enable private functions to read\n /// public state.\n /// * A sophisticated Wallet should cleverly set an include-by timestamp to improve the privacy of the user and the\n /// network as a whole. For example, if a contract interaction sets include-by to some publicly-known value (e.g.\n /// the time when a contract upgrades), then the wallet might wish to set an even lower one to avoid revealing that\n /// this tx is interacting with said contract. Ideally, all wallets should standardize on an approach in order to\n /// provide users with a large privacy set -- although the exact approach\n /// will need to be discussed. Wallets that deviate from a standard might accidentally reveal which wallet each\n /// transaction originates from.\n ///\n // docs:start:expiration-timestamp\n pub fn set_expiration_timestamp(&mut self, expiration_timestamp: u64) {\n // docs:end:expiration-timestamp\n self.expiration_timestamp = std::cmp::min(self.expiration_timestamp, expiration_timestamp);\n }\n\n /// Asserts that a note has been created.\n ///\n /// This function will cause the transaction to fail unless the requested note exists. This is the preferred\n /// mechanism for performing this check, and the only one that works for pending notes.\n ///\n /// ## Pending Notes\n ///\n /// Both settled notes (created in prior transactions) and pending notes (created in the current transaction) will\n /// be considered by this function. Pending notes must have been created **before** this call is made for the check\n /// to pass.\n ///\n /// ## Historical Notes\n ///\n /// If you need to assert that a note existed _by some specific block in the past_, instead of simply proving that\n /// it exists by the current anchor block, use [`crate::history::note::assert_note_existed_by`] instead.\n ///\n /// ## Cost\n ///\n /// This uses up one of the call's kernel note hash read requests, which are limited. Like all kernel requests,\n /// proving time costs are only incurred when the total number of requests exceeds the kernel's capacity, requiring\n /// an additional invocation of the kernel reset circuit.\n pub fn assert_note_exists(&mut self, note_existence_request: NoteExistenceRequest) {\n // Note that the `note_hash_read_requests` array does not hold `NoteExistenceRequest` objects, but rather a\n // custom kernel type. We convert from the aztec-nr type into it.\n\n let note_hash = note_existence_request.note_hash();\n let contract_address = note_existence_request.maybe_contract_address().unwrap_or(AztecAddress::zero());\n\n let side_effect = Scoped::new(\n Counted::new(note_hash, self.next_counter()),\n contract_address,\n );\n\n self.note_hash_read_requests.push(side_effect);\n }\n\n /// Asserts that a nullifier has been emitted.\n ///\n /// This function will cause the transaction to fail unless the requested nullifier exists. This is the preferred\n /// mechanism for performing this check, and the only one that works for pending nullifiers.\n ///\n /// ## Pending Nullifiers\n ///\n /// Both settled nullifiers (emitted in prior transactions) and pending nullifiers (emitted in the current\n /// transaction) will be considered by this function. Pending nullifiers must have been emitted **before** this\n /// call is made for the check to pass.\n ///\n /// ## Historical Nullifiers\n ///\n /// If you need to assert that a nullifier existed _by some specific block in the past_, instead of simply proving\n /// that it exists by the current anchor block, use [`crate::history::nullifier::assert_nullifier_existed_by`]\n /// instead.\n ///\n /// ## Public vs Private\n ///\n /// In general, it is unsafe to check for nullifier non-existence in private, as that will not consider the\n /// possibility of the nullifier having been emitted in any transaction between the anchor block and the inclusion\n /// block. Private functions instead prove existence via this function and 'prove' non-existence by _emitting_ the\n /// nullifer, which would cause the transaction to fail if the nullifier existed.\n ///\n /// This is not the case in public functions, which do have access to the tip of the blockchain and so can reliably\n /// prove whether a nullifier exists or not via\n /// [`crate::context::public_context::PublicContext::nullifier_exists_unsafe`].\n ///\n /// ## Cost\n ///\n /// This uses up one of the call's kernel nullifier read requests, which are limited. Like all kernel requests,\n /// proving time costs are only incurred when the total number of requests exceeds the kernel's capacity, requiring\n /// an additional invocation of the kernel reset circuit.\n pub fn assert_nullifier_exists(&mut self, nullifier_existence_request: NullifierExistenceRequest) {\n let nullifier = nullifier_existence_request.nullifier();\n let contract_address = nullifier_existence_request.maybe_contract_address().unwrap_or(AztecAddress::zero());\n\n let request = Scoped::new(\n Counted::new(nullifier, self.next_counter()),\n contract_address,\n );\n\n self.nullifier_read_requests.push(request);\n }\n\n /// Requests the app-siloed nullifier hiding key (nhk_app) for the given (hashed) master nullifier public key\n /// (npk_m), from the user's PXE.\n ///\n /// Advanced function: Only needed if you're designing your own notes and/or nullifiers.\n ///\n /// Contracts are not allowed to compute nullifiers for other contracts, as that would let them read parts of their\n /// private state. Because of this, a contract is only given an \"app-siloed key\", which is constructed by\n /// hashing the user's master nullifier hiding key with the contract's address. However, because contracts cannot\n /// be trusted with a user's master nullifier hiding key (because we don't know which contracts are honest or\n /// malicious), the PXE refuses to provide any master secret keys to any app smart contract function. This means\n /// app functions are unable to prove that the derivation of an app-siloed nullifier hiding key has been computed\n /// correctly. Instead, an app function can request to the kernel (via `request_nhk_app`) that it validates the\n /// siloed derivation, since the kernel has been vetted to not leak any master secret keys.\n ///\n /// A common nullification scheme is to inject a nullifier hiding key into the preimage of a nullifier, to make the\n /// nullifier deterministic but random-looking. This function enables that flow.\n ///\n /// # Arguments\n /// * `npk_m_hash` - A hash of the master nullifier public key of the user whose PXE is executing this function.\n ///\n /// # Returns\n /// * The app-siloed nullifier hiding key that corresponds to the given `npk_m_hash`.\n ///\n pub fn request_nhk_app(&mut self, npk_m_hash: Field) -> Field {\n self.request_sk_app(npk_m_hash, NULLIFIER_INDEX)\n }\n\n /// Requests the app-siloed outgoing viewing secret key (ovsk_app) for the given (hashed) master outgoing\n /// viewing public key (ovpk_m), from the user's PXE.\n ///\n /// See `request_nhk_app` and `request_sk_app` for more info.\n ///\n /// The intention of the \"outgoing\" keypair is to provide a second secret key for all of a user's outgoing activity\n /// (i.e. for notes that a user creates, as opposed to notes that a user receives from others). The separation of\n /// incoming and outgoing data was a distinction made by zcash, with the intention of enabling a user to optionally\n /// share with a 3rd party a controlled view of only incoming or outgoing notes. Similar functionality of sharing\n /// select data can be achieved with offchain zero-knowledge proofs. It is up to an app developer whether they\n /// choose to make use of a user's outgoing keypair within their application logic, or instead simply use the same\n /// keypair (the address keypair (which is effectively the same as the \"incoming\" keypair)) for all incoming &\n /// outgoing messages to a user.\n ///\n /// Currently, all of the exposed encryption functions in aztec-nr ignore the outgoing viewing keys, and instead\n /// encrypt all note logs and event logs to a user's address public key.\n ///\n /// # Arguments\n /// * `ovpk_m_hash` - Hash of the outgoing viewing public key master\n ///\n /// # Returns\n /// * The application-specific outgoing viewing secret key\n ///\n pub fn request_ovsk_app(&mut self, ovpk_m_hash: Field) -> Field {\n self.request_sk_app(ovpk_m_hash, OUTGOING_INDEX)\n }\n\n /// Pushes a Key Validation Request to the kernel.\n ///\n /// Private functions are not allowed to see a user's master secret keys, because we do not trust them. They are\n /// instead given \"app-siloed\" secret keys with a claim that they relate to a master public key. They can then\n /// request validation of this claim, by making a \"key validation request\" to the protocol's kernel circuits (which\n /// _are_ allowed to see certain master secret keys).\n ///\n /// The app circuit only sees `pk_m_hash` (not the raw point). The kernel derives the\n /// point from `sk_m`, hashes it, and asserts equality. When a Key Validation Request tuple of\n /// (sk_app, pk_m_hash, app_address) is submitted to the kernel, it performs the following\n /// derivations to validate the relationship between the claimed sk_app and the user's pk_m_hash:\n ///\n /// (sk_m) ----> * G ----> pk_m ----> hash_public_key(pk_m)\n /// | |\n /// v | We use the kernel to prove this\n /// h(sk_m, app_address) | sk_app-pk_m_hash relationship, because app\n /// | | circuits must not be trusted to see sk_m.\n /// v |\n /// sk_app - - - - - - - - - - - - - - - - - -\n ///\n /// The function is named \"request_\" instead of \"get_\" to remind the user that a Key Validation Request will be\n /// emitted to the kernel.\n ///\n fn request_sk_app(&mut self, pk_m_hash: Field, key_index: Field) -> Field {\n // Match against the cache only when a request is actually present in the slot.\n let cached_slot = self.last_key_validation_requests[key_index as u32];\n let cache_hit = cached_slot.is_some() & (cached_slot.unwrap_unchecked().pk_m_hash == pk_m_hash);\n\n if cache_hit {\n // We get a match so the cached request is the latest one\n cached_slot.unwrap_unchecked().sk_app\n } else {\n // We didn't get a match meaning the cached result is stale. Typically we'd validate keys by showing that\n // the master secret key derives to a public key matching `pk_m_hash`, but that'd require the oracle\n // returning the master secret keys, which could cause malicious contracts to leak it or learn about\n // secrets from other contracts. We therefore silo secret keys, and rely on the private kernel to validate\n // that the siloed secret key corresponds to correct siloing of the master secret key that hashes to\n // `pk_m_hash`.\n\n // Safety: Kernels verify that the key validation request is valid and below we verify that a request for\n // the correct public key has been received.\n let request = unsafe { get_key_validation_request(pk_m_hash, key_index) };\n assert_eq(request.pk_m_hash, pk_m_hash, \"Obtained key validation request for wrong pk_m_hash\");\n\n self.key_validation_requests_and_separators.push(\n KeyValidationRequestAndSeparator {\n request,\n key_type_domain_separator: public_key_domain_separators[key_index as u32],\n },\n );\n self.last_key_validation_requests[key_index as u32] = Option::some(request);\n request.sk_app\n }\n }\n\n /// Sends an \"L2 -> L1 message\" from this function (Aztec, L2) to a smart contract on Ethereum (L1). L1 contracts\n /// which are designed to send/receive messages to/from Aztec are called \"Portal Contracts\".\n ///\n /// Common use cases include withdrawals, cross-chain asset transfers, and triggering L1 actions based on L2 state\n /// changes.\n ///\n /// The message will be inserted into an Aztec \"Outbox\" contract on L1, when this transaction's block is proposed\n /// to L1. Sending the message will not result in any immediate state changes in the target portal contract. The\n /// message will need to be manually consumed from the Outbox through a separate Ethereum transaction: a user will\n /// need to call a function of the portal contract -- a function specifically designed to make a call to the Outbox\n /// to consume the message. The message will only be available for consumption once the _epoch_ proof has been\n /// submitted. Given that there are multiple Aztec blocks within an epoch, it might take some time for this epoch\n /// proof to be submitted -- especially if the block was near the start of an epoch.\n ///\n /// # Arguments\n /// * `recipient` - Ethereum address that will receive the message\n /// * `content` - Message content (32 bytes as a Field element). This content has a very\n /// specific layout. docs:start:context_message_portal\n pub fn message_portal(&mut self, recipient: EthAddress, content: Field) {\n let message = L2ToL1Message { recipient, content };\n self.l2_to_l1_msgs.push(message.count(self.next_counter()));\n }\n\n /// Consumes a message sent from Ethereum (L1) to Aztec (L2).\n ///\n /// Common use cases include token bridging, cross-chain governance, and triggering L2 actions based on L1 events.\n ///\n /// Use this function if you only want the message to ever be \"referred to\" once. Once consumed using this method,\n /// the message cannot be consumed again, because a nullifier is emitted. If your use case wants for the message to\n /// be read unlimited times, then you can always read any historic message from the L1-to-L2 messages tree;\n /// messages never technically get deleted from that tree.\n ///\n /// The message will first be inserted into an Aztec \"Inbox\" smart contract on L1. Sending the message will not\n /// result in any immediate state changes in the target L2 contract. The message will need to be manually consumed\n /// by the target contract through a separate Aztec transaction. The message will not be available for consumption\n /// immediately. Messages get copied over from the L1 Inbox to L2 by the next Proposer in batches. So you will need\n /// to wait until the messages are copied before you can consume them.\n ///\n /// # Arguments\n /// * `content` - The message content that was sent from L1\n /// * `secret` - Secret fields used for message privacy (if needed)\n /// * `sender` - Ethereum address that sent the message\n /// * `leaf_index` - Index of the message in the L1-to-L2 message tree\n ///\n /// # Advanced\n /// Validates message existence in the L1-to-L2 message tree and nullifies the message to prevent\n /// double-consumption.\n pub fn consume_l1_to_l2_message<let N: u32>(\n &mut self,\n content: Field,\n secret: [Field; N],\n sender: EthAddress,\n leaf_index: Field,\n ) {\n let nullifier = process_l1_to_l2_message(\n self.anchor_block_header.state.l1_to_l2_message_tree.root,\n self.this_address(),\n sender,\n self.chain_id(),\n self.version(),\n content,\n secret,\n leaf_index,\n );\n\n // Push nullifier (and the \"commitment\" corresponding to this can be \"empty\")\n self.push_nullifier_unsafe(nullifier)\n }\n\n /// Emits a private log (an array of Fields) that will be published to an Ethereum blob.\n ///\n /// Private logs are intended for the broadcasting of ciphertexts: that is, encrypted events or encrypted note\n /// contents. Since the data in the logs is meant to be _encrypted_, private_logs are broadcast to publicly-visible\n /// Ethereum blobs. The intended recipients of such encrypted messages can then discover and decrypt these\n /// encrypted logs using their viewing secret key. (See `../messages/discovery` for more details).\n ///\n /// Important note: This function DOES NOT _do_ any encryption of the input `log` fields. This function blindly\n /// publishes whatever input `log` data is fed into it, so the caller of this function should have already\n /// performed the encryption, and the `log` should be the result of that encryption.\n ///\n /// The protocol does not dictate what encryption scheme should be used: a smart contract developer can choose\n /// whatever encryption scheme they like. Aztec-nr includes some off-the-shelf encryption libraries that developers\n /// might wish to use, for convenience. These libraries not only encrypt a plaintext (to produce a ciphertext);\n /// they also prepend the ciphertext with a `tag` and `ephemeral public key` for easier message discovery. This is\n /// a very dense topic, and we will be writing more libraries and docs soon.\n ///\n /// > Currently, AES128 CBC encryption is the main scheme included in > aztec.nr. > We are currently making\n /// significant changes to the interfaces of the > encryption library.\n ///\n /// In some niche use cases, an app might be tempted to publish _un-encrypted_ data via a private log, because\n /// _public logs_ are not available to private functions. Be warned that emitting public data via private logs is\n /// strongly discouraged, and is considered a \"privacy anti-pattern\", because it reveals identifiable information\n /// about _which_ function has been executed. A tx which leaks such information does not contribute to the privacy\n /// set of the network.\n ///\n /// * Unlike `emit_raw_note_log_unsafe`, this log is not tied to any specific note\n ///\n /// # Arguments\n /// * `tag` - A tag placed at `fields[0]` of the emitted log. Used by recipients and nodes to identify and\n /// filter for relevant logs without scanning all of them.\n /// * `log` - The log data that will be publicly broadcast (so make sure it's already been encrypted before you\n /// call this function). Private logs are bounded in size (`PRIVATE_LOG_CIPHERTEXT_LEN`), to encourage all logs\n /// from all smart contracts look identical. The protocol's kernel circuits can then append random fields as\n /// \"padding\" after the log's length, so that the logs of this smart contract look indistinguishable from (the\n /// same length as) the logs of all other applications. It's up to wallets how much padding to apply, so\n /// ideally all wallets should agree on standards for this.\n ///\n /// ## Safety\n ///\n /// The `tag` should be domain-separated (e.g. via [`crate::protocol::hash::compute_log_tag`]) to prevent\n /// collisions between logs from different sources. Without domain separation, two unrelated log types that\n /// happen to share a raw tag value become indistinguishable. Prefer the higher-level APIs\n /// ([`crate::messages::delivery::MessageDelivery`] for messages, `self.emit(event)` for events) which\n /// handle tagging automatically.\n pub fn emit_private_log_unsafe(&mut self, tag: Field, log: BoundedVec<Field, PRIVATE_LOG_CIPHERTEXT_LEN>) {\n self.emit_raw_note_log_unsafe(tag, log, 0);\n }\n\n /// Emits a private log that is explicitly tied to a newly-emitted note_hash, to convey to the kernel: \"this log\n /// relates to this note\".\n ///\n /// This linkage is important in case the note gets squashed (due to being read later in this same tx), since we\n /// can then squash the log as well.\n ///\n /// See [`emit_private_log_unsafe`](PrivateContext::emit_private_log_unsafe) for more info about private log\n /// emission.\n ///\n /// # Arguments\n /// * `tag` - A tag placed at `fields[0]`. See\n /// [`emit_private_log_unsafe`](PrivateContext::emit_private_log_unsafe).\n /// * `log` - The log data as a `BoundedVec` of Field elements.\n /// * `note_hash_counter` - The side-effect counter that was assigned to the new note_hash when it was pushed to\n /// this `PrivateContext`.\n ///\n /// Important: If your application logic requires the log to always be emitted regardless of note squashing,\n /// consider using [`emit_private_log_unsafe`](PrivateContext::emit_private_log_unsafe) instead, or emitting\n /// additional events.\n ///\n /// ## Safety\n ///\n /// Same as [`PrivateContext::emit_private_log_unsafe`]: the `tag` should be domain-separated.\n pub fn emit_raw_note_log_unsafe(\n &mut self,\n tag: Field,\n log: BoundedVec<Field, PRIVATE_LOG_CIPHERTEXT_LEN>,\n note_hash_counter: u32,\n ) {\n // Safety: the base rollup constrains every field of a private log beyond its length to be zero, so a log that\n // fails this check can never be included in a block. Nothing here relies on the check; it only surfaces the\n // mistake to the developer at simulation time, with a clear message, instead of at block building.\n unsafe { assert_private_log_zero_padded(log) };\n let counter = self.next_counter();\n let full_log = [tag].concat(log.storage());\n let private_log = PrivateLogData { log: PrivateLog::new(full_log, log.len() + 1), note_hash_counter };\n self.private_logs.push(private_log.count(counter));\n }\n\n /// Emits large data blobs.\n ///\n /// This reuses the Contract Class Log channel to emit blobs of up to [`CONTRACT_CLASS_LOG_SIZE_IN_FIELDS`].\n ///\n /// ## Privacy\n ///\n /// The address of the contract emitting these blobs is revelead.\n pub fn emit_contract_class_log<let N: u32>(&mut self, log: [Field; N]) {\n let contract_address = self.this_address();\n let counter = self.next_counter();\n\n let log_to_emit: [Field; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS] =\n log.concat([0; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS - N]);\n // Note: the length is not always N, it is the number of fields we want to broadcast, omitting trailing zeros\n // to save blob space.\n // Safety: The below length is constrained in the base rollup, which will make sure that all the fields beyond\n // length are zero. However, it won't be able to check that we didn't add extra padding (trailing zeroes) or\n // that we cut trailing zeroes from the end.\n let length = unsafe { trimmed_array_length_hint(log) };\n // We hash the entire padded log to ensure a user cannot pass a shorter length and so emit incorrect shorter\n // bytecode.\n let log_hash = compute_contract_class_log_hash(log_to_emit);\n // Safety: the below only exists to broadcast the raw log, so we can provide it to the base rollup later to be\n // constrained.\n unsafe {\n notify_created_contract_class_log(contract_address, log_to_emit, length, counter);\n }\n\n self.contract_class_logs_hashes.push(LogHash { value: log_hash, length: length }.count(counter));\n }\n\n /// Calls a private function on another contract (or the same contract).\n ///\n /// Very low-level function.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `args` - Array of arguments to pass to the called function\n ///\n /// # Returns\n /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n /// return values.\n ///\n /// This enables contracts to interact with each other while maintaining privacy. This \"composability\" of private\n /// contract functions is a key feature of the Aztec network.\n ///\n /// If a user's transaction includes multiple private function calls, then by the design of Aztec, the following\n /// information will remain private[1]:\n /// - The function selectors and contract addresses of all private function calls will remain private, so an\n /// observer of the public mempool will not be able to look at a tx and deduce which private functions have been\n /// executed.\n /// - The arguments and return values of all private function calls will remain private.\n /// - The person who initiated the tx will remain private.\n /// - The notes and nullifiers and private logs that are emitted by all private function calls will (if designed\n /// well) not leak any user secrets, nor leak which functions have been executed.\n ///\n /// [1] Caveats: Some of these privacy guarantees depend on how app developers design their smart contracts. Some\n /// actions _can_ leak information, such as:\n /// - Calling an internal public function.\n /// - Calling a public function and not setting msg_sender to Option::none (feature not built yet - see github).\n /// - Calling any public function will always leak details about the nature of the transaction, so devs should be\n /// careful in their contract designs. If it can be done in a private function, then that will give the best\n /// privacy.\n /// - Not padding the side-effects of a tx to some standardized, uniform size. The kernel circuits can take hints\n /// to pad side-effects, so a wallet should be able to request for a particular amount of padding. Wallets should\n /// ideally agree on some standard.\n /// - Padding should include:\n /// - Padding the lengths of note & nullifier arrays\n /// - Padding private logs with random fields, up to some standardized size. See also:\n /// https://docs.aztec.network/developers/resources/considerations/privacy_considerations\n ///\n /// # Advanced\n /// * The call is added to the private call stack and executed by kernel circuits after this function completes\n /// * The called function can modify its own contract's private state\n /// * Side effects from the called function are included in this transaction\n /// * The call inherits the current transaction's context and gas limits\n ///\n pub fn call_private_function<let ArgsCount: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ArgsCount],\n ) -> ReturnsHash {\n let args_hash = hash_args(args);\n execution_cache::store(args, args_hash);\n self.call_private_function_with_args_hash(contract_address, function_selector, args_hash, false)\n }\n\n /// Makes a read-only call to a private function on another contract.\n ///\n /// This is similar to Solidity's `staticcall`. The called function cannot modify state, emit L2->L2 messages, nor\n /// emit events. Any nested calls are constrained to also be staticcalls.\n ///\n /// See `call_private_function` for more general info on private function calls.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract to call\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `args` - Array of arguments to pass to the called function\n ///\n /// # Returns\n /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n /// return values.\n ///\n pub fn static_call_private_function<let ArgsCount: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ArgsCount],\n ) -> ReturnsHash {\n let args_hash = hash_args(args);\n execution_cache::store(args, args_hash);\n self.call_private_function_with_args_hash(contract_address, function_selector, args_hash, true)\n }\n\n /// Calls a private function that takes no arguments.\n ///\n /// This is a convenience function for calling private functions that don't require any input parameters. It's\n /// equivalent to `call_private_function` but slightly more efficient to use when no arguments are needed.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n ///\n /// # Returns\n /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n /// return values.\n ///\n pub fn call_private_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n ) -> ReturnsHash {\n self.call_private_function_with_args_hash(contract_address, function_selector, 0, false)\n }\n\n /// Makes a read-only call to a private function which takes no arguments.\n ///\n /// This combines the optimisation of `call_private_function_no_args` with the safety of\n /// `static_call_private_function`.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n ///\n /// # Returns\n /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n /// return values.\n ///\n pub fn static_call_private_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n ) -> ReturnsHash {\n self.call_private_function_with_args_hash(contract_address, function_selector, 0, true)\n }\n\n /// Low-level private function call.\n ///\n /// This is the underlying implementation used by all other private function call methods. Instead of taking raw\n /// arguments, it accepts a hash of the arguments.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `args_hash` - Pre-computed hash of the function arguments\n /// * `is_static_call` - Whether this should be a read-only call\n ///\n /// # Returns\n /// * `ReturnsHash` - Hash of the called function's return values\n ///\n pub fn call_private_function_with_args_hash(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args_hash: Field,\n is_static_call: bool,\n ) -> ReturnsHash {\n let is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n let start_side_effect_counter = self.side_effect_counter;\n\n // Safety: The oracle simulates the private call and returns the value of the side effects counter after\n // execution of the call (which means that end_side_effect_counter - start_side_effect_counter is the number of\n // side effects that took place), along with the hash of the return values. We validate these by requesting a\n // private kernel iteration in which the return values are constrained to hash to `returns_hash` and the side\n // effects counter to increment from start to end.\n let (end_side_effect_counter, returns_hash) = unsafe {\n call_private_function_internal(\n contract_address,\n function_selector,\n args_hash,\n start_side_effect_counter,\n is_static_call,\n )\n };\n\n self.private_call_requests.push(\n PrivateCallRequest {\n call_context: CallContext {\n msg_sender: self.this_address(),\n contract_address,\n function_selector,\n is_static_call,\n },\n args_hash,\n returns_hash,\n start_side_effect_counter,\n end_side_effect_counter,\n },\n );\n\n // The kernel circuits ensure that end_side_effect_counter is greater than start_side_effect_counter, and that\n // all side effects emitted in the child call have counters within the range [start_side_effect_counter,\n // end_side_effect_counter]. Therefore, we only need to ensure that the next side effect from the current call\n // starts after the end side effect from the child call.\n self.side_effect_counter = end_side_effect_counter + 1;\n\n ReturnsHash::new(returns_hash)\n }\n\n /// Enqueues a call to a public function to be executed later.\n ///\n /// Unlike private functions which execute immediately on the user's device, public function calls are \"enqueued\"\n /// and executed some time later by a block proposer.\n ///\n /// This means a public function cannot return any values back to a private function, because by the time the\n /// public function is being executed, the private function which called it has already completed execution. (In\n /// fact, the private function has been executed and proven, along with all other private function calls of the\n /// user's tx. A single proof of the tx has been submitted to the Aztec network, and some time later a proposer has\n /// picked the tx up from the mempool and begun executing all of the enqueued public functions).\n ///\n /// # Privacy warning Enqueueing a public function call is an inherently leaky action. Many interesting applications\n /// will require some interaction with public state, but smart contract developers should try to use public function\n /// calls sparingly, and carefully. _Internal_ public function calls are especially leaky, because they completely\n /// leak which private contract made the call. See also:\n /// https://docs.aztec.network/developers/resources/considerations/privacy_considerations\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `args` - Array of arguments to pass to the public function\n /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n ///\n pub fn call_public_function<let ArgsCount: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ArgsCount],\n hide_msg_sender: bool,\n ) {\n let calldata = [function_selector.to_field()].concat(args);\n let calldata_hash = hash_calldata_array(calldata);\n execution_cache::store(calldata, calldata_hash);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, false, hide_msg_sender)\n }\n\n /// Enqueues a read-only call to a public function.\n ///\n /// This is similar to Solidity's `staticcall`. The called function cannot modify state or emit events. Any nested\n /// calls are constrained to also be staticcalls.\n ///\n /// See also `call_public_function` for more important information about making private -> public function calls.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `args` - Array of arguments to pass to the public function\n /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n ///\n pub fn static_call_public_function<let ArgsCount: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ArgsCount],\n hide_msg_sender: bool,\n ) {\n let calldata = [function_selector.to_field()].concat(args);\n let calldata_hash = hash_calldata_array(calldata);\n execution_cache::store(calldata, calldata_hash);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, true, hide_msg_sender)\n }\n\n /// Enqueues a call to a public function that takes no arguments.\n ///\n /// This is an optimisation for calling public functions that don't take any input parameters. It's otherwise\n /// equivalent to `call_public_function`.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n ///\n pub fn call_public_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n hide_msg_sender: bool,\n ) {\n let calldata_hash = hash_calldata_array([function_selector.to_field()]);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, false, hide_msg_sender)\n }\n\n /// Enqueues a read-only call to a public function with no arguments.\n ///\n /// This combines the optimisation of `call_public_function_no_args` with the safety of\n /// `static_call_public_function`.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n ///\n pub fn static_call_public_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n hide_msg_sender: bool,\n ) {\n let calldata_hash = hash_calldata_array([function_selector.to_field()]);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, true, hide_msg_sender)\n }\n\n /// Low-level public function call.\n ///\n /// This is the underlying implementation used by all other public function call methods. Instead of taking raw\n /// arguments, it accepts a hash of the arguments.\n ///\n /// Advanced function: Most developers should use `call_public_function` or `static_call_public_function` instead.\n /// This function is exposed for performance optimization and advanced use cases.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `calldata_hash` - Hash of the function calldata\n /// * `is_static_call` - Whether this should be a read-only call\n /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n ///\n pub fn call_public_function_with_calldata_hash(\n &mut self,\n contract_address: AztecAddress,\n calldata_hash: Field,\n is_static_call: bool,\n hide_msg_sender: bool,\n ) {\n let counter = self.next_counter();\n\n let is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n assert_valid_public_call_data(calldata_hash);\n\n let msg_sender = if hide_msg_sender {\n NULL_MSG_SENDER_CONTRACT_ADDRESS\n } else {\n self.this_address()\n };\n\n let call_request = PublicCallRequest { msg_sender, contract_address, is_static_call, calldata_hash };\n\n self.public_call_requests.push(Counted::new(call_request, counter));\n }\n\n /// Enqueues a public function call, and designates it to be the teardown function for this tx. Only one teardown\n /// function call can be made by a tx.\n ///\n /// Niche function: Only wallet developers and paymaster contract developers (aka Fee-payment contracts) will need\n /// to make use of this function.\n ///\n /// Aztec supports a three-phase execution model: setup, app logic, teardown. The phases exist to enable a fee\n /// payer to take on the risk of paying a transaction fee, safe in the knowledge that their payment (in whatever\n /// token or method the user chooses) will succeed, regardless of whether the app logic will succeed. The \"setup\"\n /// phase ensures the fee payer has sufficient balance to pay the proposer their fees. The teardown phase is\n /// primarily intended to: calculate exactly how much the user owes, based on gas consumption, and refund the user\n /// any change.\n ///\n /// Note: in some cases, the cost of refunding the user (i.e. DA costs of tx side-effects) might exceed the refund\n /// amount. For app logic with fairly stable and predictable gas consumption, a material refund amount is unlikely.\n /// For app logic with unpredictable gas consumption, a refund might be important to the user (e.g. if a hefty\n /// function reverts very early). Wallet/FPC/Paymaster developers should be mindful of this.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the teardown function\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `args` - An array of fields to pass to the function.\n /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n pub fn set_public_teardown_function<let ArgsCount: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ArgsCount],\n hide_msg_sender: bool,\n ) {\n let calldata = [function_selector.to_field()].concat(args);\n let calldata_hash = hash_calldata_array(calldata);\n execution_cache::store(calldata, calldata_hash);\n self.set_public_teardown_function_with_calldata_hash(contract_address, calldata_hash, false, hide_msg_sender)\n }\n\n /// Low-level function to set the public teardown function.\n ///\n /// This is the underlying implementation for setting the teardown function call that will execute at the end of\n /// the transaction. Instead of taking raw arguments, it accepts a hash of the arguments.\n ///\n /// Advanced function: Most developers should use `set_public_teardown_function` instead.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the teardown function\n /// * `calldata_hash` - Hash of the function calldata\n /// * `is_static_call` - Whether this should be a read-only call\n /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n ///\n pub fn set_public_teardown_function_with_calldata_hash(\n &mut self,\n contract_address: AztecAddress,\n calldata_hash: Field,\n is_static_call: bool,\n hide_msg_sender: bool,\n ) {\n let is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n assert_valid_public_call_data(calldata_hash);\n\n let msg_sender = if hide_msg_sender {\n NULL_MSG_SENDER_CONTRACT_ADDRESS\n } else {\n self.this_address()\n };\n\n self.public_teardown_call_request =\n PublicCallRequest { msg_sender, contract_address, is_static_call, calldata_hash };\n }\n\n /// Increments the side-effect counter.\n ///\n /// Very low-level function.\n ///\n /// # Advanced\n ///\n /// Every side-effect of a private function is given a \"side-effect counter\", based on when it is created. This\n /// PrivateContext is in charge of assigning the counters.\n ///\n /// The reason we have side-effect counters is complicated. Consider this illustrative pseudocode of inter-contract\n /// function calls:\n /// ```\n /// contract A {\n /// let x = 5; // pseudocode for storage var x.\n /// fn a1 {\n /// read x; // value: 5, counter: 1.\n /// x = x + 1;\n /// write x; // value: 6, counter: 2.\n ///\n /// B.b(); // start_counter: 2, end_counter: 4\n ///\n /// read x; // value: 36, counter: 5.\n /// x = x + 1;\n /// write x; // value: 37, counter: 6.\n /// }\n ///\n /// fn a2 {\n /// read x; // value: 6, counter: 3.\n /// x = x * x;\n /// write x; // value: 36, counter: 4.\n /// }\n /// }\n ///\n /// contract B {\n /// fn b() {\n /// A.a2();\n /// }\n /// }\n /// ```\n ///\n /// Suppose a1 is the first function called. The comments show the execution counter of each side-effect, and what\n /// the new value of `x` is.\n ///\n /// These (private) functions are processed by Aztec's kernel circuits in an order that is different from execution\n /// order: All of A.a1 is proven before B.b is proven, before A.a2 is proven. So when we're in the 2nd execution\n /// frame of A.a1 (after the call to B.b), the circuit needs to justify why x went from being `6` to `36`. But the\n /// circuit doesn't know why, and given the order of proving, the kernel hasn't _seen_ a value of 36 get written\n /// yet. The kernel needs to track big arrays of all side-effects of all private functions in a tx. Then, as it\n /// recurses and processes B.b(), it will eventually see a value of 36 get written.\n ///\n /// Suppose side-effect counters weren't exposed: The kernel would only see this ordering (in order of proof\n /// verification): [ A.a1.read, A.a1.write, A.a1.read, A.a1.write, A.a2.read, A.a2.write ]\n /// [ 5, 6, 36, 37, 6, 36 ]\n /// The kernel wouldn't know _when_ B.b() was called within A.a1(), because it can't see what's going on within an\n /// app circuit. So the kernel wouldn't know that the ordering of reads and writes should actually be: [ A.a1.read,\n /// A.a1.write, A.a2.read, A.a2.write, A.a1.read, A.a1.write ]\n /// [ 5, 6, 6, 36, 36, 37 ]\n ///\n /// And so, we introduced side-effect counters: every private function must assign side-effect counters alongside\n /// every side-effect that it emits, and also expose to the kernel the counters that it started and ended with.\n /// This gives the kernel enough information to arrange all side-effects in the correct order. It can then catch\n /// (for example) if a function tries to read state before it has been written (e.g. if A.a2() maliciously tried to\n /// read a value of x=37) (e.g. if A.a1() maliciously tried to read x=6).\n ///\n /// If a malicious app contract _lies_ and does not count correctly:\n /// - It cannot lie about its start and end counters because the kernel will catch this.\n /// - It _could_ lie about its intermediate counters:\n /// - 1. It could not increment its side-effects correctly\n /// - 2. It could label its side-effects with counters outside of its start and end counters' range. The kernel\n /// will catch 2. The kernel will not catch 1., but this would only cause corruption to the private state of the\n /// malicious contract, and not any other contracts (because a contract can only modify its own state). If a \"good\"\n /// contract is given _read access_ to a maliciously-counting contract (via an external getter function, or by\n /// reading historic state from the archive tree directly), and they then make state changes to their _own_ state\n /// accordingly, that could be dangerous. Developers should be mindful not to trust the claimed innards of external\n /// contracts unless they have audited/vetted the contracts including vetting the side-effect counter\n /// incrementation. This is a similar paradigm to Ethereum smart contract development: you must vet external\n /// contracts that your contract relies upon, and you must not make any presumptions about their claimed behaviour.\n /// (Hopefully if a contract imports a version of aztec-nr, we will get contract verification tooling that can\n /// validate the authenticity of the imported aztec-nr package, and hence infer that the side- effect counting will\n /// be correct, without having to re-audit such logic for every contract).\n ///\n fn next_counter(&mut self) -> u32 {\n let counter = self.side_effect_counter;\n self.side_effect_counter += 1;\n counter\n }\n}\n\nimpl Empty for PrivateContext {\n fn empty() -> Self {\n PrivateContext {\n inputs: PrivateContextInputs::empty(),\n side_effect_counter: 0 as u32,\n min_revertible_side_effect_counter: 0 as u32,\n is_fee_payer: false,\n args_hash: 0,\n return_hash: 0,\n expiration_timestamp: 0,\n note_hash_read_requests: BoundedVec::new(),\n nullifier_read_requests: BoundedVec::new(),\n key_validation_requests_and_separators: BoundedVec::new(),\n note_hashes: BoundedVec::new(),\n nullifiers: BoundedVec::new(),\n private_call_requests: BoundedVec::new(),\n public_call_requests: BoundedVec::new(),\n public_teardown_call_request: PublicCallRequest::empty(),\n l2_to_l1_msgs: BoundedVec::new(),\n anchor_block_header: BlockHeader::empty(),\n private_logs: BoundedVec::new(),\n contract_class_logs_hashes: BoundedVec::new(),\n last_key_validation_requests: [Option::none(); NUM_KEY_TYPES],\n expected_non_revertible_side_effect_counter: 0,\n expected_revertible_side_effect_counter: 0,\n }\n }\n}\n\n/// Checks that every entry of `log`'s storage past `log.len()` is zero, which the protocol requires of every private\n/// log. `BoundedVec::truncate` and `BoundedVec::pop` only move `len` and leave the vacated storage in place, so a\n/// vector that was shortened before being emitted carries stale values into the log's padding unless the caller\n/// zeroes them; `BoundedVec::from_array` always yields zeroed storage.\nunconstrained fn assert_private_log_zero_padded<let N: u32>(log: BoundedVec<Field, N>) {\n let storage = log.storage();\n let len = log.len();\n for i in len..N {\n assert(\n storage[i] == 0,\n f\"Private log has a non-zero field at index {i}, beyond its length {len}. Fields beyond the length must be zero: if the BoundedVec was shortened with truncate or pop, zero the vacated entries first, or build it with BoundedVec::from_array.\",\n );\n }\n}\n\nmod test {\n use crate::protocol::{constants::PRIVATE_LOG_CIPHERTEXT_LEN, traits::Empty};\n use super::PrivateContext;\n\n #[test]\n unconstrained fn emits_short_log_with_zero_padding() {\n let mut context = PrivateContext::empty();\n let log: BoundedVec<Field, PRIVATE_LOG_CIPHERTEXT_LEN> = BoundedVec::from_array([1, 2, 3]);\n context.emit_private_log_unsafe(7, log);\n\n assert_eq(context.private_logs.len(), 1);\n let emitted = context.private_logs.get(0).inner.log;\n assert_eq(emitted.length, 4);\n assert_eq(emitted.fields[0], 7);\n assert_eq(emitted.fields[1], 1);\n assert_eq(emitted.fields[2], 2);\n assert_eq(emitted.fields[3], 3);\n for i in 4..emitted.fields.len() {\n assert_eq(emitted.fields[i], 0);\n }\n }\n\n #[test(should_fail_with = \"beyond its length\")]\n unconstrained fn rejects_log_with_stale_storage_after_truncate() {\n let mut context = PrivateContext::empty();\n let mut log: BoundedVec<Field, PRIVATE_LOG_CIPHERTEXT_LEN> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n log.truncate(3);\n context.emit_private_log_unsafe(7, log);\n }\n\n #[test(should_fail_with = \"beyond its length\")]\n unconstrained fn rejects_log_with_stale_storage_after_pop() {\n let mut context = PrivateContext::empty();\n let mut log: BoundedVec<Field, PRIVATE_LOG_CIPHERTEXT_LEN> = BoundedVec::from_array([1, 2, 3]);\n let _ = log.pop();\n context.emit_private_log_unsafe(7, log);\n }\n}\n"
|
|
1872
|
+
"path": "/mnt/user-data/nicov/node-3/noir-projects/aztec-nr/aztec/src/context/private_context.nr",
|
|
1873
|
+
"source": "use crate::{\n context::{inputs::PrivateContextInputs, NoteExistenceRequest, NullifierExistenceRequest, ReturnsHash},\n hash::{hash_args, hash_calldata_array},\n keys::constants::{NULLIFIER_INDEX, NUM_KEY_TYPES, OUTGOING_INDEX, public_key_domain_separators},\n messaging::process_l1_to_l2_message,\n oracle::{\n block_header::get_block_header_at,\n call_private_function::call_private_function_internal,\n execution_cache,\n key_validation_request::get_key_validation_request,\n logs::notify_created_contract_class_log,\n notes::notify_nullified_note,\n nullifiers::notify_created_nullifier,\n public_call::assert_valid_public_call_data,\n tx_phase::{is_execution_in_revertible_phase, notify_revertible_phase_start},\n },\n};\nuse crate::logging::aztecnr_trace_log_format;\nuse crate::protocol::{\n abis::{\n block_header::BlockHeader,\n call_context::CallContext,\n function_selector::FunctionSelector,\n gas_settings::GasSettings,\n log_hash::LogHash,\n note_hash::NoteHash,\n nullifier::Nullifier,\n private_call_request::PrivateCallRequest,\n private_circuit_public_inputs::PrivateCircuitPublicInputs,\n private_log::{PrivateLog, PrivateLogData},\n public_call_request::PublicCallRequest,\n validation_requests::{KeyValidationRequest, KeyValidationRequestAndSeparator},\n },\n address::{AztecAddress, EthAddress},\n constants::{\n CONTRACT_CLASS_LOG_SIZE_IN_FIELDS, MAX_CONTRACT_CLASS_LOGS_PER_CALL, MAX_ENQUEUED_CALLS_PER_CALL,\n MAX_KEY_VALIDATION_REQUESTS_PER_CALL, MAX_L2_TO_L1_MSGS_PER_CALL, MAX_NOTE_HASH_READ_REQUESTS_PER_CALL,\n MAX_NOTE_HASHES_PER_CALL, MAX_NULLIFIER_READ_REQUESTS_PER_CALL, MAX_NULLIFIERS_PER_CALL,\n MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL, MAX_PRIVATE_LOGS_PER_CALL, MAX_TX_LIFETIME,\n NULL_MSG_SENDER_CONTRACT_ADDRESS, PRIVATE_LOG_CIPHERTEXT_LEN,\n },\n hash::compute_contract_class_log_hash,\n messaging::l2_to_l1_message::L2ToL1Message,\n side_effect::{Counted, scoped::Scoped},\n traits::{Empty, ToField},\n utils::arrays::{ClaimedLengthArray, trimmed_array_length_hint},\n};\n\n/// # PrivateContext\n///\n/// The **main interface** between an #[external(\"private\")] function and the Aztec blockchain.\n///\n/// An instance of the PrivateContext is initialized automatically at the outset of every private function, within the\n/// #[external(\"private\")] macro, so you'll never need to consciously instantiate this yourself.\n///\n/// The instance is always named `context`, and it is always be available within the body of every\n/// #[external(\"private\")] function in your smart contract.\n///\n/// > For those used to \"vanilla\" Noir, it might be jarring to have access to > `context` without seeing a declaration\n/// `let context = PrivateContext::new(...)` > within the body of your function. This is just a consequence of using >\n/// macros to tidy-up verbose boilerplate. You can use `nargo expand` to > expand all macros, if you dare.\n///\n/// Typical usage for a smart contract developer will be to call getter methods of the PrivateContext.\n///\n/// _Pushing_ data and requests to the context is mostly handled within aztec-nr's own functions, so typically a smart\n/// contract developer won't need to call any setter methods directly.\n///\n/// > Advanced users might occasionally wish to push data to the context > directly for lower-level control. If you\n/// find yourself doing this, please > open an issue on GitHub to describe your use case: it might be that > new\n/// functionality should be added to aztec-nr.\n///\n/// ## Responsibilities\n/// - Exposes contextual data to a private function:\n/// - Data relating to how this private function was called.\n/// - msg_sender\n/// - this_address - (the contract address of the private function being executed)\n/// - See `CallContext` for more data.\n/// - Data relating to the transaction in which this private function is being executed.\n/// - chain_id\n/// - version\n/// - gas_settings\n/// - Provides state access:\n/// - Access to the \"Anchor block\" header. Recall, a private function cannot read from the \"current\" block header, but\n/// must read from some historical block header, because as soon as private function execution begins (asynchronously,\n/// on a user's device), the public state of the chain (the \"current state\") will have progressed forward. We call this\n/// reference the \"Anchor block\". See `BlockHeader`.\n/// - Enables consumption of L1->L2 messages.\n/// - Enables calls to functions of other smart contracts:\n/// - Private function calls\n/// - Enqueueing of public function call requests (Since public functions are executed at a later time, by a block\n/// proposer, we say they are \"enqueued\").\n/// - Writes data to the blockchain:\n/// - New notes\n/// - New nullifiers\n/// - Private logs (for sending encrypted note contents or encrypted events)\n/// - New L2->L1 messages.\n/// - Provides args to the private function (handled by the #[external(\"private\")] macro).\n/// - Returns the return values of this private function (handled by the\n/// #[external(\"private\")] macro).\n/// - Makes Key Validation Requests.\n/// - Private functions are not allowed to see master secret keys, because we do not trust them. They are instead given\n/// \"app-siloed\" secret keys with a claim that they relate to a master public key. They can then request validation of\n/// this claim, by making a \"key validation request\" to the protocol's kernel circuits (which _are_ allowed to see\n/// certain master secret keys).\n///\n/// ## Advanced Responsibilities\n///\n/// - Ultimately, the PrivateContext is responsible for constructing the PrivateCircuitPublicInputs of the private\n/// function being executed. All private functions on Aztec must have public inputs which adhere to the rigid layout of\n/// the PrivateCircuitPublicInputs, in order to be compatible with the protocol's kernel circuits. A well-known\n/// misnomer:\n/// - \"public inputs\" contain both inputs and outputs of this function.\n/// - By \"outputs\" we mean a lot more side-effects than just the \"return values\" of the function.\n/// - Most of the so-called \"public inputs\" are kept _private_, and never leak to the outside world, because they are\n/// 'swallowed' by the protocol's kernel circuits before the tx is sent to the network. Only the following are exposed\n/// to the outside world:\n/// - New note_hashes\n/// - New nullifiers\n/// - New private logs\n/// - New L2->L1 messages\n/// - New enqueued public function call requests All the above-listed arrays of side-effects can be padded by the\n/// user's wallet (through instructions to the kernel circuits, via the PXE) to obscure their true lengths.\n///\n/// ## Syntax Justification\n///\n/// Both user-defined functions _and_ most functions in aztec-nr need access to the PrivateContext instance to\n/// read/write data. This is why you'll see the arguably-ugly pervasiveness of the \"context\" throughout your smart\n/// contract and the aztec-nr library. For example, `&mut context` is prevalent. In some languages, you can access and\n/// mutate a global variable (such as a PrivateContext instance) from a function without polluting the function's\n/// parameters. With Noir, a function must explicitly pass control of a mutable variable to another function, by\n/// reference. Since many functions in aztec-nr need to be able to push new data to the PrivateContext, they need to be\n/// handed a mutable reference _to_ the context as a parameter. For example, `Context` is prevalent as a generic\n/// parameter, to give better type safety at compile time. Many `aztec-nr` functions don't make sense if they're called\n/// in a particular runtime (private, public or utility), and so are intentionally only implemented over certain\n/// [Private|Public|Utility]Context structs. This gives smart contract developers a much faster feedback loop if\n/// they're making a mistake, as an error will be thrown by the LSP or when they compile their contract.\n///\n#[derive(Eq)]\npub struct PrivateContext {\n // docs:start:private-context\n inputs: PrivateContextInputs,\n side_effect_counter: u32,\n\n min_revertible_side_effect_counter: u32,\n is_fee_payer: bool,\n\n args_hash: Field,\n return_hash: Field,\n\n pub(crate) expiration_timestamp: u64,\n\n pub(crate) note_hash_read_requests: BoundedVec<Scoped<Counted<Field>>, MAX_NOTE_HASH_READ_REQUESTS_PER_CALL>,\n pub(crate) nullifier_read_requests: BoundedVec<Scoped<Counted<Field>>, MAX_NULLIFIER_READ_REQUESTS_PER_CALL>,\n key_validation_requests_and_separators: BoundedVec<KeyValidationRequestAndSeparator, MAX_KEY_VALIDATION_REQUESTS_PER_CALL>,\n\n pub(crate) note_hashes: BoundedVec<Counted<NoteHash>, MAX_NOTE_HASHES_PER_CALL>,\n pub(crate) nullifiers: BoundedVec<Counted<Nullifier>, MAX_NULLIFIERS_PER_CALL>,\n\n pub(crate) private_call_requests: BoundedVec<PrivateCallRequest, MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL>,\n public_call_requests: BoundedVec<Counted<PublicCallRequest>, MAX_ENQUEUED_CALLS_PER_CALL>,\n public_teardown_call_request: PublicCallRequest,\n l2_to_l1_msgs: BoundedVec<Counted<L2ToL1Message>, MAX_L2_TO_L1_MSGS_PER_CALL>,\n // docs:end:private-context\n\n // Header of a block whose state is used during private execution (not the block the transaction is included in).\n pub(crate) anchor_block_header: BlockHeader,\n\n private_logs: BoundedVec<Counted<PrivateLogData>, MAX_PRIVATE_LOGS_PER_CALL>,\n contract_class_logs_hashes: BoundedVec<Counted<LogHash>, MAX_CONTRACT_CLASS_LOGS_PER_CALL>,\n\n // Contains the last key validation request for each key type. This is used to cache the last request and avoid\n // fetching the same request multiple times. The index of the array corresponds to the key type (0 nullifier, 1\n // incoming, 2 outgoing, 3 tagging).\n last_key_validation_requests: [Option<KeyValidationRequest>; NUM_KEY_TYPES],\n\n expected_non_revertible_side_effect_counter: u32,\n expected_revertible_side_effect_counter: u32,\n}\n\nimpl PrivateContext {\n pub fn new(inputs: PrivateContextInputs, args_hash: Field) -> PrivateContext {\n PrivateContext {\n inputs,\n side_effect_counter: inputs.start_side_effect_counter + 1,\n min_revertible_side_effect_counter: 0,\n is_fee_payer: false,\n args_hash,\n return_hash: 0,\n expiration_timestamp: inputs.anchor_block_header.timestamp() + MAX_TX_LIFETIME,\n note_hash_read_requests: BoundedVec::new(),\n nullifier_read_requests: BoundedVec::new(),\n key_validation_requests_and_separators: BoundedVec::new(),\n note_hashes: BoundedVec::new(),\n nullifiers: BoundedVec::new(),\n anchor_block_header: inputs.anchor_block_header,\n private_call_requests: BoundedVec::new(),\n public_call_requests: BoundedVec::new(),\n public_teardown_call_request: PublicCallRequest::empty(),\n l2_to_l1_msgs: BoundedVec::new(),\n private_logs: BoundedVec::new(),\n contract_class_logs_hashes: BoundedVec::new(),\n last_key_validation_requests: [Option::none(); NUM_KEY_TYPES],\n expected_non_revertible_side_effect_counter: 0,\n expected_revertible_side_effect_counter: 0,\n }\n }\n\n /// Returns the contract address that initiated this function call.\n ///\n /// This is similar to `msg.sender` in Solidity (hence the name).\n ///\n /// Important Note: Since Aztec doesn't have a concept of an EoA (Externally-owned Account), the msg_sender is\n /// \"none\" for the first function call of every transaction. The first function call of a tx is likely to be a call\n /// to the user's account contract, so this quirk will most often be handled by account contract developers.\n ///\n /// # Returns\n /// * `Option<AztecAddress>` - The address of the smart contract that called this function (be it an app contract\n /// or a user's account contract). Returns `Option<AztecAddress>::none` for the first function call of the tx. No\n /// other _private_ function calls in the tx will have a `none` msg_sender, but _public_ function calls might (see\n /// the PublicContext).\n pub fn maybe_msg_sender(self) -> Option<AztecAddress> {\n let maybe_msg_sender = self.inputs.call_context.msg_sender;\n if maybe_msg_sender == NULL_MSG_SENDER_CONTRACT_ADDRESS {\n Option::none()\n } else {\n Option::some(maybe_msg_sender)\n }\n }\n\n /// Returns the contract address of the current function being executed.\n ///\n /// This is equivalent to `address(this)` in Solidity (hence the name). Use this to identify the current contract's\n /// address, commonly needed for access control or when interacting with other contracts.\n ///\n /// # Returns\n /// * `AztecAddress` - The contract address of the current function being executed.\n ///\n pub fn this_address(self) -> AztecAddress {\n self.inputs.call_context.contract_address\n }\n\n /// Returns the chain ID of the current network.\n ///\n /// This is similar to `block.chainid` in Solidity. Returns the unique identifier for the blockchain network this\n /// transaction is executing on.\n ///\n /// Helps prevent cross-chain replay attacks. Useful if implementing multi-chain contract logic.\n ///\n /// # Returns\n /// * `Field` - The chain ID as a field element\n ///\n pub fn chain_id(self) -> Field {\n self.inputs.tx_context.chain_id\n }\n\n /// Returns the Aztec protocol version that this transaction is executing under. Different versions may have\n /// different rules, opcodes, or cryptographic primitives.\n ///\n /// This is similar to how Ethereum has different EVM versions.\n ///\n /// Useful for forward/backward compatibility checks\n ///\n /// Not to be confused with contract versions; this is the protocol version.\n ///\n /// # Returns\n /// * `Field` - The protocol version as a field element\n ///\n pub fn version(self) -> Field {\n self.inputs.tx_context.version\n }\n\n /// Returns the gas settings for the current transaction.\n ///\n /// This provides information about gas limits and pricing for the transaction, similar to `tx.gasprice` and gas\n /// limits in Ethereum. However, Aztec has a more sophisticated gas model with separate accounting for L2\n /// computation and data availability (DA) costs.\n ///\n /// # Returns\n /// * `GasSettings` - Struct containing gas limits and fee information\n ///\n pub fn gas_settings(self) -> GasSettings {\n self.inputs.tx_context.gas_settings\n }\n\n /// Returns the function selector of the currently executing function.\n ///\n /// Low-level function: Ordinarily, smart contract developers will not need to access this.\n ///\n /// This is similar to `msg.sig` in Solidity, which returns the first 4 bytes of the function signature. In Aztec,\n /// the selector uniquely identifies which function within the contract is being called.\n ///\n /// # Returns\n /// * `FunctionSelector` - The 4-byte function identifier\n ///\n /// # Advanced\n /// Only #[external(\"private\")] functions have a function selector as a protocol- enshrined concept. The function\n /// selectors of private functions are baked into the preimage of the contract address, and are used by the\n /// protocol's kernel circuits to identify each private function and ensure the correct one is being executed.\n ///\n /// Used internally for function dispatch and call verification.\n ///\n pub fn selector(self) -> FunctionSelector {\n self.inputs.call_context.function_selector\n }\n\n /// Returns whether this call is being executed as part of a static call.\n ///\n /// Similar to Solidity's `STATICCALL`, a static call is read-only: neither this function nor any of its nested\n /// calls may emit side-effects (new notes, nullifiers, logs, L2->L1 messages, etc.). A call is considered static\n /// if it was invoked as a static call or if any of its ancestor calls were.\n ///\n /// # Returns\n /// * `bool` - `true` if this call (or an ancestor call) is a static call.\n ///\n pub fn is_static_call(self) -> bool {\n self.inputs.call_context.is_static_call\n }\n\n /// Returns the hash of the arguments passed to the current function.\n ///\n /// Very low-level function: You shouldn't need to call this. The #[external(\"private\")] macro calls this, and it\n /// makes the arguments neatly available to the body of your private function.\n ///\n /// # Returns\n /// * `Field` - Hash of the function arguments\n ///\n /// # Advanced\n /// * Arguments are hashed to reduce proof size and verification time\n /// * Enables efficient argument passing in recursive function calls\n /// * The hash can be used to retrieve the original arguments from the PXE.\n ///\n pub fn get_args_hash(self) -> Field {\n self.args_hash\n }\n\n /// Returns the current value of the side-effect counter, i.e. the counter that will be assigned to the next\n /// side-effect emitted by this function.\n ///\n /// Low-level function: Ordinarily, smart contract developers will not need to access this. See `next_counter` for\n /// details on how side-effect counters are assigned and why they exist.\n ///\n /// # Returns\n /// * `u32` - The current side-effect counter.\n ///\n pub fn get_side_effect_counter(self) -> u32 {\n self.side_effect_counter\n }\n\n /// Pushes a new note_hash to the Aztec blockchain's global Note Hash Tree (a state tree).\n ///\n /// A note_hash is a commitment to a piece of private state.\n ///\n /// Low-level function: Ordinarily, smart contract developers will not need to manually call this. Aztec-nr's state\n /// variables (see `../state_vars/`) are designed to understand when to create and push new note hashes.\n ///\n /// # Arguments\n /// * `note_hash` - The new note_hash.\n ///\n /// # Advanced\n /// From here, the protocol's kernel circuits will take over and insert the note_hash into the protocol's \"note\n /// hash tree\" (in the Base Rollup circuit). Before insertion, the protocol will:\n /// - \"Silo\" the `note_hash` with the contract address of this function, to yield a `siloed_note_hash`. This\n /// prevents state collisions between different smart contracts.\n /// - Ensure uniqueness of the `siloed_note_hash`, to prevent Faerie-Gold attacks, by hashing the\n /// `siloed_note_hash` with a unique value, to yield a `unique_siloed_note_hash` (see the protocol spec for more).\n ///\n /// In addition to calling this function, aztec-nr provides the contents of the newly-created note to the PXE, via\n /// the `notify_created_note` oracle.\n ///\n /// > Advanced users might occasionally wish to push data to the context > directly for lower-level control. If you\n /// find yourself doing this, > please open an issue on GitHub to describe your use case: it might be > that new\n /// functionality should be added to aztec-nr.\n ///\n pub fn push_note_hash(&mut self, note_hash: Field) {\n self.note_hashes.push(Counted::new(note_hash, self.next_counter()));\n }\n\n /// Creates a new [nullifier](crate::nullifier).\n ///\n /// ## Safety\n ///\n /// This is a low-level function that must be used with great care to avoid subtle corruption of contract state.\n /// Instead of calling this function, consider using the higher-level [`crate::state_vars::SingleUseClaim`].\n ///\n /// In particular, callers must ensure all nullifiers created by a contract are properly domain-separated, so that\n /// unrelated components don't interfere with one another (e.g. a transaction nullifier accidentally marking a\n /// variable as initialized). Only [`PrivateContext::push_nullifier_for_note_hash`] should be used for note\n /// nullifiers, never this one.\n ///\n /// ## Advanced\n ///\n /// The raw `nullifier` is not what is inserted into the Aztec state tree: it will be first siloed by contract\n /// address via [`crate::protocol::hash::compute_siloed_nullifier`] in order to prevent accidental or malicious\n /// interference of nullifiers from different contracts.\n pub fn push_nullifier_unsafe(&mut self, nullifier: Field) {\n notify_created_nullifier(nullifier);\n self.nullifiers.push(Nullifier { value: nullifier, note_hash: 0 }.count(self.next_counter()));\n }\n\n /// Creates a new [nullifier](crate::nullifier) associated with a note.\n ///\n /// This is a variant of [`PrivateContext::push_nullifier_unsafe`] that is used for note nullifiers, i.e.\n /// nullifiers that correspond to a note. If a note and its nullifier are created in the same transaction, then\n /// the private kernels will 'squash' these values, deleting them both as if they never existed and reducing\n /// transaction fees.\n ///\n /// The `nullification_note_hash` must be the result of calling\n /// [`crate::note::utils::compute_confirmed_note_hash_for_nullification`] for pending notes, and `0` for settled\n /// notes (which cannot be squashed).\n ///\n /// ## Safety\n ///\n /// This is a low-level function that must be used with great care to avoid subtle corruption of contract state.\n /// Instead of calling this function, consider using the higher-level [`crate::note::lifecycle::destroy_note`].\n ///\n /// The precautions listed for [`PrivateContext::push_nullifier_unsafe`] apply here as well, and callers should\n /// additionally ensure `nullification_note_hash` corresponds to a note emitted by this contract, with its hash\n /// computed in the same transaction execution phase as the call to this function. Finally, only this function\n /// should be used for note nullifiers, never [`PrivateContext::push_nullifier_unsafe`].\n ///\n /// Failure to do these things can result in unprovable contexts, accidental deletion of notes, or double-spend\n /// attacks.\n pub fn push_nullifier_for_note_hash(&mut self, nullifier: Field, nullification_note_hash: Field) {\n let nullifier_counter = self.next_counter();\n notify_nullified_note(nullifier, nullification_note_hash, nullifier_counter);\n self.nullifiers.push(Nullifier { value: nullifier, note_hash: nullification_note_hash }.count(\n nullifier_counter,\n ));\n }\n\n /// Returns the anchor block header - the historical block header that this private function is reading from.\n ///\n /// A private function CANNOT read from the \"current\" block header, but must read from some older block header,\n /// because as soon as private function execution begins (asynchronously, on a user's device), the public state of\n /// the chain (the \"current state\") will have progressed forward.\n ///\n /// # Returns\n /// * `BlockHeader` - The anchor block header.\n ///\n /// # Advanced\n /// * All private functions of a tx read from the same anchor block header.\n /// * The protocol asserts that the `expiration_timestamp` of every tx is at most 24 hours beyond the timestamp of\n /// the tx's chosen anchor block header. This enables the network's nodes to safely prune old txs from the mempool.\n /// Therefore, the chosen block header _must_ be one from within the last 24 hours.\n ///\n pub fn get_anchor_block_header(self) -> BlockHeader {\n self.anchor_block_header\n }\n\n /// Returns the header of any historical block at or before the anchor block.\n ///\n /// This enables private contracts to access information from even older blocks than the anchor block header.\n ///\n /// Useful for time-based contract logic that needs to compare against multiple historical points.\n ///\n /// # Arguments\n /// * `block_number` - The block number to retrieve (must be <= anchor block number)\n ///\n /// # Returns\n /// * `BlockHeader` - The header of the requested historical block\n ///\n /// # Advanced\n /// This function uses an oracle to fetch block header data from the user's PXE. Depending on how much blockchain\n /// data the user's PXE has been set up to store, this might require a query from the PXE to another Aztec node to\n /// get the data. > This is generally true of all oracle getters (see `../oracle`).\n ///\n /// Each block header gets hashed and stored as a leaf in the protocol's Archive Tree. In fact, the i-th block\n /// header gets stored at the i-th leaf index of the Archive Tree. Behind the scenes, this `get_block_header_at`\n /// function will add Archive Tree merkle-membership constraints (~3k) to your smart contract function's circuit,\n /// to prove existence of the block header in the Archive Tree.\n ///\n /// Note: we don't do any caching, so avoid making duplicate calls for the same block header, because each call\n /// will add duplicate constraints.\n ///\n /// Calling this function is more expensive (constraint-wise) than getting the anchor block header (via\n /// `get_block_header`). This is because the anchor block's merkle membership proof is handled by Aztec's protocol\n /// circuits, and is only performed once for the entire tx because all private functions of a tx share a common\n /// anchor block header. Therefore, the cost (constraint-wise) of calling `get_block_header` is effectively free.\n ///\n pub fn get_block_header_at(self, block_number: u32) -> BlockHeader {\n get_block_header_at(block_number, self)\n }\n\n /// Sets the hash of the return values for this private function.\n ///\n /// Very low-level function: this is called by the #[external(\"private\")] macro.\n ///\n /// # Arguments\n /// * `serialized_return_values` - The serialized return values as a field array\n ///\n pub fn set_return_hash<let N: u32>(&mut self, serialized_return_values: [Field; N]) {\n let return_hash = hash_args(serialized_return_values);\n self.return_hash = return_hash;\n execution_cache::store(serialized_return_values, return_hash);\n }\n\n /// Builds the PrivateCircuitPublicInputs for this private function, to ensure compatibility with the protocol's\n /// kernel circuits.\n ///\n /// Very low-level function: This function is automatically called by the #[external(\"private\")] macro.\n pub fn finish(self) -> PrivateCircuitPublicInputs {\n PrivateCircuitPublicInputs {\n call_context: self.inputs.call_context,\n args_hash: self.args_hash,\n returns_hash: self.return_hash,\n min_revertible_side_effect_counter: self.min_revertible_side_effect_counter,\n is_fee_payer: self.is_fee_payer,\n expiration_timestamp: self.expiration_timestamp,\n note_hash_read_requests: ClaimedLengthArray::from_bounded_vec(self.note_hash_read_requests),\n nullifier_read_requests: ClaimedLengthArray::from_bounded_vec(self.nullifier_read_requests),\n key_validation_requests_and_separators: ClaimedLengthArray::from_bounded_vec(\n self.key_validation_requests_and_separators,\n ),\n note_hashes: ClaimedLengthArray::from_bounded_vec(self.note_hashes),\n nullifiers: ClaimedLengthArray::from_bounded_vec(self.nullifiers),\n private_call_requests: ClaimedLengthArray::from_bounded_vec(self.private_call_requests),\n public_call_requests: ClaimedLengthArray::from_bounded_vec(self.public_call_requests),\n public_teardown_call_request: self.public_teardown_call_request,\n l2_to_l1_msgs: ClaimedLengthArray::from_bounded_vec(self.l2_to_l1_msgs),\n start_side_effect_counter: self.inputs.start_side_effect_counter,\n end_side_effect_counter: self.side_effect_counter,\n private_logs: ClaimedLengthArray::from_bounded_vec(self.private_logs),\n contract_class_logs_hashes: ClaimedLengthArray::from_bounded_vec(self.contract_class_logs_hashes),\n anchor_block_header: self.anchor_block_header,\n tx_context: self.inputs.tx_context,\n expected_non_revertible_side_effect_counter: self.expected_non_revertible_side_effect_counter,\n expected_revertible_side_effect_counter: self.expected_revertible_side_effect_counter,\n protocol_nullifier: self.inputs.protocol_nullifier,\n }\n }\n\n /// Designates this contract as the fee payer for the transaction.\n ///\n /// Unlike Ethereum, where the transaction sender always pays fees, Aztec allows any contract to voluntarily pay\n /// transaction fees. This enables patterns like sponsored transactions or fee abstraction where users don't need\n /// to hold fee-juice themselves. (Fee juice is a fee-paying asset for Aztec).\n ///\n /// Only one contract per transaction can declare itself as the fee payer, and it must have sufficient fee-juice\n /// balance (>= the gas limits specified in the TxContext) by the time we reach the public setup phase of the tx.\n ///\n /// The fee payer must be elected during the setup (non-revertible) phase, i.e. before\n /// [`end_setup`](PrivateContext::end_setup) is called - this function asserts so. This is because any compensation\n /// collected by the fee payer during the revertible phase can be discarded if a public call later reverts, while\n /// the protocol still debits the fee payer's fee-juice balance. Note that `end_setup` does not need to be called\n /// by the electing function itself: it can be called later in the transaction (e.g. by the fee-juice contract when\n /// claiming fee juice that pays for the very same transaction).\n pub fn set_as_fee_payer(&mut self) {\n assert(!self.in_revertible_phase(), \"fee payer must be elected during the setup phase\");\n aztecnr_trace_log_format!(\"Setting {0} as fee payer\")([self.this_address().to_field()]);\n self.is_fee_payer = true;\n }\n\n /// Returns whether execution is currently in the revertible (app) phase of the transaction.\n ///\n /// A transaction is in the revertible phase if [`end_setup`](PrivateContext::end_setup) has already been called -\n /// potentially by a different function of the same transaction.\n pub fn in_revertible_phase(&mut self) -> bool {\n let current_counter = self.side_effect_counter;\n\n // Safety: Kernel will validate that the claim is correct by validating the expected counters.\n let is_revertible = unsafe { is_execution_in_revertible_phase(current_counter) };\n\n if is_revertible {\n if (self.expected_revertible_side_effect_counter == 0)\n | (current_counter < self.expected_revertible_side_effect_counter) {\n self.expected_revertible_side_effect_counter = current_counter;\n }\n } else if current_counter > self.expected_non_revertible_side_effect_counter {\n self.expected_non_revertible_side_effect_counter = current_counter;\n }\n\n is_revertible\n }\n\n /// Declares the end of the \"setup phase\" of this tx.\n ///\n /// Only one function per tx can declare the end of the setup phase.\n ///\n /// Niche function: Only wallet developers and paymaster contract developers (aka Fee-payment contracts) will need\n /// to make use of this function.\n ///\n /// Aztec supports a three-phase execution model: setup, app logic, teardown. The phases exist to enable a fee\n /// payer to take on the risk of paying a transaction fee, safe in the knowledge that their payment (in whatever\n /// token or method the user chooses) will succeed, regardless of whether the app logic will succeed. The \"setup\"\n /// phase enables such a payment to be made, because the setup phase _cannot revert_: a reverting function within\n /// the setup phase would result in an invalid block which cannot be proven. Any side-effects generated during that\n /// phase are guaranteed to be inserted into Aztec's state trees (except for squashed notes & nullifiers, of\n /// course).\n ///\n /// Even though the end of the setup phase is declared within a private function, you might have noticed that\n /// _public_ functions can also execute within the setup phase. This is because any public function calls which\n /// were enqueued _within the setup phase_ by a private function are considered part of the setup phase.\n ///\n /// # Advanced\n /// * Sets the minimum revertible side effect counter of this tx to be the PrivateContext's _current_ side effect\n /// counter.\n ///\n pub fn end_setup(&mut self) {\n // We bump the counter twice: once so that `min_revertible_side_effect_counter` sits strictly above any\n // non-revertible side effect counter (including queries made via `in_revertible_phase` before this call), and\n // once more so that the next revertible side effect counter is strictly greater than\n // `min_revertible_side_effect_counter`. This ensures `min_revertible_side_effect_counter` occupies a gap that\n // no side effect takes, which the kernel relies on when validating the phase split.\n self.side_effect_counter += 1;\n self.min_revertible_side_effect_counter = self.side_effect_counter;\n self.side_effect_counter += 1;\n\n aztecnr_trace_log_format!(\n \"Ending setup, minimum revertible side effect counter is {0}\",\n )(\n [self.min_revertible_side_effect_counter as Field],\n );\n notify_revertible_phase_start(self.min_revertible_side_effect_counter);\n }\n\n /// Sets a deadline (an \"include-by timestamp\") for when this transaction must be included in a block.\n ///\n /// Other functions in this tx might call this setter with differing values for the include-by timestamp. To ensure\n /// that all functions' deadlines are met, the _minimum_ of all these include-by timestamps will be exposed when\n /// this tx is submitted to the network.\n ///\n /// If the transaction is not included in a block by its include-by timestamp, it becomes invalid and it will never\n /// be included.\n ///\n /// This expiry timestamp is publicly visible. See the \"Advanced\" section for privacy concerns.\n ///\n /// # Arguments\n /// * `expiration_timestamp` - Unix timestamp (seconds) deadline for inclusion. The include-by timestamp of this tx\n /// will be _at most_ the timestamp specified.\n ///\n /// # Advanced\n /// * If multiple functions set differing `expiration_timestamp`s, the kernel circuits will set it to be the\n /// _minimum_ of the two. This ensures the tx expiry requirements of all functions in the tx are met.\n /// * Rollup circuits will reject expired txs.\n /// * The protocol enforces that all transactions must be included within 24 hours of their chosen anchor block's\n /// timestamp, to enable safe mempool pruning.\n /// * The DelayedPublicMutable design makes heavy use of this functionality, to enable private functions to read\n /// public state.\n /// * A sophisticated Wallet should cleverly set an include-by timestamp to improve the privacy of the user and the\n /// network as a whole. For example, if a contract interaction sets include-by to some publicly-known value (e.g.\n /// the time when a contract upgrades), then the wallet might wish to set an even lower one to avoid revealing that\n /// this tx is interacting with said contract. Ideally, all wallets should standardize on an approach in order to\n /// provide users with a large privacy set -- although the exact approach\n /// will need to be discussed. Wallets that deviate from a standard might accidentally reveal which wallet each\n /// transaction originates from.\n ///\n // docs:start:expiration-timestamp\n pub fn set_expiration_timestamp(&mut self, expiration_timestamp: u64) {\n // docs:end:expiration-timestamp\n self.expiration_timestamp = std::cmp::min(self.expiration_timestamp, expiration_timestamp);\n }\n\n /// Asserts that a note has been created.\n ///\n /// This function will cause the transaction to fail unless the requested note exists. This is the preferred\n /// mechanism for performing this check, and the only one that works for pending notes.\n ///\n /// ## Pending Notes\n ///\n /// Both settled notes (created in prior transactions) and pending notes (created in the current transaction) will\n /// be considered by this function. Pending notes must have been created **before** this call is made for the check\n /// to pass.\n ///\n /// ## Historical Notes\n ///\n /// If you need to assert that a note existed _by some specific block in the past_, instead of simply proving that\n /// it exists by the current anchor block, use [`crate::history::note::assert_note_existed_by`] instead.\n ///\n /// ## Cost\n ///\n /// This uses up one of the call's kernel note hash read requests, which are limited. Like all kernel requests,\n /// proving time costs are only incurred when the total number of requests exceeds the kernel's capacity, requiring\n /// an additional invocation of the kernel reset circuit.\n pub fn assert_note_exists(&mut self, note_existence_request: NoteExistenceRequest) {\n // Note that the `note_hash_read_requests` array does not hold `NoteExistenceRequest` objects, but rather a\n // custom kernel type. We convert from the aztec-nr type into it.\n\n let note_hash = note_existence_request.note_hash();\n let contract_address = note_existence_request.maybe_contract_address().unwrap_or(AztecAddress::zero());\n\n let side_effect = Scoped::new(\n Counted::new(note_hash, self.next_counter()),\n contract_address,\n );\n\n self.note_hash_read_requests.push(side_effect);\n }\n\n /// Asserts that a nullifier has been emitted.\n ///\n /// This function will cause the transaction to fail unless the requested nullifier exists. This is the preferred\n /// mechanism for performing this check, and the only one that works for pending nullifiers.\n ///\n /// ## Pending Nullifiers\n ///\n /// Both settled nullifiers (emitted in prior transactions) and pending nullifiers (emitted in the current\n /// transaction) will be considered by this function. Pending nullifiers must have been emitted **before** this\n /// call is made for the check to pass.\n ///\n /// ## Historical Nullifiers\n ///\n /// If you need to assert that a nullifier existed _by some specific block in the past_, instead of simply proving\n /// that it exists by the current anchor block, use [`crate::history::nullifier::assert_nullifier_existed_by`]\n /// instead.\n ///\n /// ## Public vs Private\n ///\n /// In general, it is unsafe to check for nullifier non-existence in private, as that will not consider the\n /// possibility of the nullifier having been emitted in any transaction between the anchor block and the inclusion\n /// block. Private functions instead prove existence via this function and 'prove' non-existence by _emitting_ the\n /// nullifer, which would cause the transaction to fail if the nullifier existed.\n ///\n /// This is not the case in public functions, which do have access to the tip of the blockchain and so can reliably\n /// prove whether a nullifier exists or not via\n /// [`crate::context::public_context::PublicContext::nullifier_exists_unsafe`].\n ///\n /// ## Cost\n ///\n /// This uses up one of the call's kernel nullifier read requests, which are limited. Like all kernel requests,\n /// proving time costs are only incurred when the total number of requests exceeds the kernel's capacity, requiring\n /// an additional invocation of the kernel reset circuit.\n pub fn assert_nullifier_exists(&mut self, nullifier_existence_request: NullifierExistenceRequest) {\n let nullifier = nullifier_existence_request.nullifier();\n let contract_address = nullifier_existence_request.maybe_contract_address().unwrap_or(AztecAddress::zero());\n\n let request = Scoped::new(\n Counted::new(nullifier, self.next_counter()),\n contract_address,\n );\n\n self.nullifier_read_requests.push(request);\n }\n\n /// Requests the app-siloed nullifier hiding key (nhk_app) for the given (hashed) master nullifier public key\n /// (npk_m), from the user's PXE.\n ///\n /// Advanced function: Only needed if you're designing your own notes and/or nullifiers.\n ///\n /// Contracts are not allowed to compute nullifiers for other contracts, as that would let them read parts of their\n /// private state. Because of this, a contract is only given an \"app-siloed key\", which is constructed by\n /// hashing the user's master nullifier hiding key with the contract's address. However, because contracts cannot\n /// be trusted with a user's master nullifier hiding key (because we don't know which contracts are honest or\n /// malicious), the PXE refuses to provide any master secret keys to any app smart contract function. This means\n /// app functions are unable to prove that the derivation of an app-siloed nullifier hiding key has been computed\n /// correctly. Instead, an app function can request to the kernel (via `request_nhk_app`) that it validates the\n /// siloed derivation, since the kernel has been vetted to not leak any master secret keys.\n ///\n /// A common nullification scheme is to inject a nullifier hiding key into the preimage of a nullifier, to make the\n /// nullifier deterministic but random-looking. This function enables that flow.\n ///\n /// # Arguments\n /// * `npk_m_hash` - A hash of the master nullifier public key of the user whose PXE is executing this function.\n ///\n /// # Returns\n /// * The app-siloed nullifier hiding key that corresponds to the given `npk_m_hash`.\n ///\n pub fn request_nhk_app(&mut self, npk_m_hash: Field) -> Field {\n self.request_sk_app(npk_m_hash, NULLIFIER_INDEX)\n }\n\n /// Requests the app-siloed outgoing viewing secret key (ovsk_app) for the given (hashed) master outgoing\n /// viewing public key (ovpk_m), from the user's PXE.\n ///\n /// See `request_nhk_app` and `request_sk_app` for more info.\n ///\n /// The intention of the \"outgoing\" keypair is to provide a second secret key for all of a user's outgoing activity\n /// (i.e. for notes that a user creates, as opposed to notes that a user receives from others). The separation of\n /// incoming and outgoing data was a distinction made by zcash, with the intention of enabling a user to optionally\n /// share with a 3rd party a controlled view of only incoming or outgoing notes. Similar functionality of sharing\n /// select data can be achieved with offchain zero-knowledge proofs. It is up to an app developer whether they\n /// choose to make use of a user's outgoing keypair within their application logic, or instead simply use the same\n /// keypair (the address keypair (which is effectively the same as the \"incoming\" keypair)) for all incoming &\n /// outgoing messages to a user.\n ///\n /// Currently, all of the exposed encryption functions in aztec-nr ignore the outgoing viewing keys, and instead\n /// encrypt all note logs and event logs to a user's address public key.\n ///\n /// # Arguments\n /// * `ovpk_m_hash` - Hash of the outgoing viewing public key master\n ///\n /// # Returns\n /// * The application-specific outgoing viewing secret key\n ///\n pub fn request_ovsk_app(&mut self, ovpk_m_hash: Field) -> Field {\n self.request_sk_app(ovpk_m_hash, OUTGOING_INDEX)\n }\n\n /// Pushes a Key Validation Request to the kernel.\n ///\n /// Private functions are not allowed to see a user's master secret keys, because we do not trust them. They are\n /// instead given \"app-siloed\" secret keys with a claim that they relate to a master public key. They can then\n /// request validation of this claim, by making a \"key validation request\" to the protocol's kernel circuits (which\n /// _are_ allowed to see certain master secret keys).\n ///\n /// The app circuit only sees `pk_m_hash` (not the raw point). The kernel derives the\n /// point from `sk_m`, hashes it, and asserts equality. When a Key Validation Request tuple of\n /// (sk_app, pk_m_hash, app_address) is submitted to the kernel, it performs the following\n /// derivations to validate the relationship between the claimed sk_app and the user's pk_m_hash:\n ///\n /// (sk_m) ----> * G ----> pk_m ----> hash_public_key(pk_m)\n /// | |\n /// v | We use the kernel to prove this\n /// h(sk_m, app_address) | sk_app-pk_m_hash relationship, because app\n /// | | circuits must not be trusted to see sk_m.\n /// v |\n /// sk_app - - - - - - - - - - - - - - - - - -\n ///\n /// The function is named \"request_\" instead of \"get_\" to remind the user that a Key Validation Request will be\n /// emitted to the kernel.\n ///\n fn request_sk_app(&mut self, pk_m_hash: Field, key_index: Field) -> Field {\n // Match against the cache only when a request is actually present in the slot.\n let cached_slot = self.last_key_validation_requests[key_index as u32];\n let cache_hit = cached_slot.is_some() & (cached_slot.unwrap_unchecked().pk_m_hash == pk_m_hash);\n\n if cache_hit {\n // We get a match so the cached request is the latest one\n cached_slot.unwrap_unchecked().sk_app\n } else {\n // We didn't get a match meaning the cached result is stale. Typically we'd validate keys by showing that\n // the master secret key derives to a public key matching `pk_m_hash`, but that'd require the oracle\n // returning the master secret keys, which could cause malicious contracts to leak it or learn about\n // secrets from other contracts. We therefore silo secret keys, and rely on the private kernel to validate\n // that the siloed secret key corresponds to correct siloing of the master secret key that hashes to\n // `pk_m_hash`.\n\n // Safety: Kernels verify that the key validation request is valid and below we verify that a request for\n // the correct public key has been received.\n let request = unsafe { get_key_validation_request(pk_m_hash, key_index) };\n assert_eq(request.pk_m_hash, pk_m_hash, \"Obtained key validation request for wrong pk_m_hash\");\n\n self.key_validation_requests_and_separators.push(\n KeyValidationRequestAndSeparator {\n request,\n key_type_domain_separator: public_key_domain_separators[key_index as u32],\n },\n );\n self.last_key_validation_requests[key_index as u32] = Option::some(request);\n request.sk_app\n }\n }\n\n /// Sends an \"L2 -> L1 message\" from this function (Aztec, L2) to a smart contract on Ethereum (L1). L1 contracts\n /// which are designed to send/receive messages to/from Aztec are called \"Portal Contracts\".\n ///\n /// Common use cases include withdrawals, cross-chain asset transfers, and triggering L1 actions based on L2 state\n /// changes.\n ///\n /// The message will be inserted into an Aztec \"Outbox\" contract on L1, when this transaction's block is proposed\n /// to L1. Sending the message will not result in any immediate state changes in the target portal contract. The\n /// message will need to be manually consumed from the Outbox through a separate Ethereum transaction: a user will\n /// need to call a function of the portal contract -- a function specifically designed to make a call to the Outbox\n /// to consume the message. The message will only be available for consumption once the _epoch_ proof has been\n /// submitted. Given that there are multiple Aztec blocks within an epoch, it might take some time for this epoch\n /// proof to be submitted -- especially if the block was near the start of an epoch.\n ///\n /// # Arguments\n /// * `recipient` - Ethereum address that will receive the message\n /// * `content` - Message content (32 bytes as a Field element). This content has a very\n /// specific layout. docs:start:context_message_portal\n pub fn message_portal(&mut self, recipient: EthAddress, content: Field) {\n let message = L2ToL1Message { recipient, content };\n self.l2_to_l1_msgs.push(message.count(self.next_counter()));\n }\n\n /// Consumes a message sent from Ethereum (L1) to Aztec (L2).\n ///\n /// Common use cases include token bridging, cross-chain governance, and triggering L2 actions based on L1 events.\n ///\n /// Use this function if you only want the message to ever be \"referred to\" once. Once consumed using this method,\n /// the message cannot be consumed again, because a nullifier is emitted. If your use case wants for the message to\n /// be read unlimited times, then you can always read any historic message from the L1-to-L2 messages tree;\n /// messages never technically get deleted from that tree.\n ///\n /// The message will first be inserted into an Aztec \"Inbox\" smart contract on L1. Sending the message will not\n /// result in any immediate state changes in the target L2 contract. The message will need to be manually consumed\n /// by the target contract through a separate Aztec transaction. The message will not be available for consumption\n /// immediately. Messages get copied over from the L1 Inbox to L2 by the next Proposer in batches. So you will need\n /// to wait until the messages are copied before you can consume them.\n ///\n /// # Arguments\n /// * `content` - The message content that was sent from L1\n /// * `secret` - Secret fields used for message privacy (if needed)\n /// * `sender` - Ethereum address that sent the message\n /// * `leaf_index` - Index of the message in the L1-to-L2 message tree\n ///\n /// # Advanced\n /// Validates message existence in the L1-to-L2 message tree and nullifies the message to prevent\n /// double-consumption.\n pub fn consume_l1_to_l2_message<let N: u32>(\n &mut self,\n content: Field,\n secret: [Field; N],\n sender: EthAddress,\n leaf_index: Field,\n ) {\n let nullifier = process_l1_to_l2_message(\n self.anchor_block_header.state.l1_to_l2_message_tree.root,\n self.this_address(),\n sender,\n self.chain_id(),\n self.version(),\n content,\n secret,\n leaf_index,\n );\n\n // Push nullifier (and the \"commitment\" corresponding to this can be \"empty\")\n self.push_nullifier_unsafe(nullifier)\n }\n\n /// Emits a private log (an array of Fields) that will be published to an Ethereum blob.\n ///\n /// Private logs are intended for the broadcasting of ciphertexts: that is, encrypted events or encrypted note\n /// contents. Since the data in the logs is meant to be _encrypted_, private_logs are broadcast to publicly-visible\n /// Ethereum blobs. The intended recipients of such encrypted messages can then discover and decrypt these\n /// encrypted logs using their viewing secret key. (See `../messages/discovery` for more details).\n ///\n /// Important note: This function DOES NOT _do_ any encryption of the input `log` fields. This function blindly\n /// publishes whatever input `log` data is fed into it, so the caller of this function should have already\n /// performed the encryption, and the `log` should be the result of that encryption.\n ///\n /// The protocol does not dictate what encryption scheme should be used: a smart contract developer can choose\n /// whatever encryption scheme they like. Aztec-nr includes some off-the-shelf encryption libraries that developers\n /// might wish to use, for convenience. These libraries not only encrypt a plaintext (to produce a ciphertext);\n /// they also prepend the ciphertext with a `tag` and `ephemeral public key` for easier message discovery. This is\n /// a very dense topic, and we will be writing more libraries and docs soon.\n ///\n /// > Currently, AES128 CBC encryption is the main scheme included in > aztec.nr. > We are currently making\n /// significant changes to the interfaces of the > encryption library.\n ///\n /// In some niche use cases, an app might be tempted to publish _un-encrypted_ data via a private log, because\n /// _public logs_ are not available to private functions. Be warned that emitting public data via private logs is\n /// strongly discouraged, and is considered a \"privacy anti-pattern\", because it reveals identifiable information\n /// about _which_ function has been executed. A tx which leaks such information does not contribute to the privacy\n /// set of the network.\n ///\n /// * Unlike `emit_raw_note_log_unsafe`, this log is not tied to any specific note\n ///\n /// # Arguments\n /// * `tag` - A tag placed at `fields[0]` of the emitted log. Used by recipients and nodes to identify and\n /// filter for relevant logs without scanning all of them.\n /// * `log` - The log data that will be publicly broadcast (so make sure it's already been encrypted before you\n /// call this function). Private logs are bounded in size (`PRIVATE_LOG_CIPHERTEXT_LEN`), to encourage all logs\n /// from all smart contracts look identical. Every field of the emitted log beyond its length must be zero: the\n /// base rollup rejects a private log with non-zero fields past its length, so padding can never be appended\n /// inside a log. What the kernel circuits can add is whole padding logs, which hide how many logs a tx\n /// actually emitted. It's up to wallets how much padding to apply, so ideally all wallets should agree on\n /// standards for this.\n ///\n /// ## Safety\n ///\n /// The `tag` should be domain-separated (e.g. via [`crate::protocol::hash::compute_log_tag`]) to prevent\n /// collisions between logs from different sources. Without domain separation, two unrelated log types that\n /// happen to share a raw tag value become indistinguishable. Prefer the higher-level APIs\n /// ([`crate::messages::delivery::MessageDelivery`] for messages, `self.emit(event)` for events) which\n /// handle tagging automatically.\n pub fn emit_private_log_unsafe(&mut self, tag: Field, log: BoundedVec<Field, PRIVATE_LOG_CIPHERTEXT_LEN>) {\n self.emit_raw_note_log_unsafe(tag, log, 0);\n }\n\n /// Emits a private log that is explicitly tied to a newly-emitted note_hash, to convey to the kernel: \"this log\n /// relates to this note\".\n ///\n /// This linkage is important in case the note gets squashed (due to being read later in this same tx), since we\n /// can then squash the log as well.\n ///\n /// See [`emit_private_log_unsafe`](PrivateContext::emit_private_log_unsafe) for more info about private log\n /// emission.\n ///\n /// # Arguments\n /// * `tag` - A tag placed at `fields[0]`. See\n /// [`emit_private_log_unsafe`](PrivateContext::emit_private_log_unsafe).\n /// * `log` - The log data as a `BoundedVec` of Field elements.\n /// * `note_hash_counter` - The side-effect counter that was assigned to the new note_hash when it was pushed to\n /// this `PrivateContext`.\n ///\n /// Important: If your application logic requires the log to always be emitted regardless of note squashing,\n /// consider using [`emit_private_log_unsafe`](PrivateContext::emit_private_log_unsafe) instead, or emitting\n /// additional events.\n ///\n /// ## Safety\n ///\n /// Same as [`PrivateContext::emit_private_log_unsafe`]: the `tag` should be domain-separated.\n pub fn emit_raw_note_log_unsafe(\n &mut self,\n tag: Field,\n log: BoundedVec<Field, PRIVATE_LOG_CIPHERTEXT_LEN>,\n note_hash_counter: u32,\n ) {\n // Safety: the base rollup constrains every field of a private log beyond its length to be zero, so a log that\n // fails this check can never be included in a block. Nothing here relies on the check; it only surfaces the\n // mistake to the developer at simulation time, with a clear message, instead of at block building.\n unsafe { assert_private_log_zero_padded(log) };\n let counter = self.next_counter();\n let full_log = [tag].concat(log.storage());\n let private_log = PrivateLogData { log: PrivateLog::new(full_log, log.len() + 1), note_hash_counter };\n self.private_logs.push(private_log.count(counter));\n }\n\n /// Emits large data blobs.\n ///\n /// This reuses the Contract Class Log channel to emit blobs of up to [`CONTRACT_CLASS_LOG_SIZE_IN_FIELDS`].\n ///\n /// ## Privacy\n ///\n /// The address of the contract emitting these blobs is revelead.\n pub fn emit_contract_class_log<let N: u32>(&mut self, log: [Field; N]) {\n let contract_address = self.this_address();\n let counter = self.next_counter();\n\n let log_to_emit: [Field; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS] =\n log.concat([0; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS - N]);\n // Note: the length is not always N, it is the number of fields we want to broadcast, omitting trailing zeros\n // to save blob space.\n // Safety: The below length is constrained in the base rollup, which will make sure that all the fields beyond\n // length are zero. However, it won't be able to check that we didn't add extra padding (trailing zeroes) or\n // that we cut trailing zeroes from the end.\n let length = unsafe { trimmed_array_length_hint(log) };\n // We hash the entire padded log to ensure a user cannot pass a shorter length and so emit incorrect shorter\n // bytecode.\n let log_hash = compute_contract_class_log_hash(log_to_emit);\n // Safety: the below only exists to broadcast the raw log, so we can provide it to the base rollup later to be\n // constrained.\n unsafe {\n notify_created_contract_class_log(contract_address, log_to_emit, length, counter);\n }\n\n self.contract_class_logs_hashes.push(LogHash { value: log_hash, length: length }.count(counter));\n }\n\n /// Calls a private function on another contract (or the same contract).\n ///\n /// Very low-level function.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `args` - Array of arguments to pass to the called function\n ///\n /// # Returns\n /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n /// return values.\n ///\n /// This enables contracts to interact with each other while maintaining privacy. This \"composability\" of private\n /// contract functions is a key feature of the Aztec network.\n ///\n /// If a user's transaction includes multiple private function calls, then by the design of Aztec, the following\n /// information will remain private[1]:\n /// - The function selectors and contract addresses of all private function calls will remain private, so an\n /// observer of the public mempool will not be able to look at a tx and deduce which private functions have been\n /// executed.\n /// - The arguments and return values of all private function calls will remain private.\n /// - The person who initiated the tx will remain private.\n /// - The notes and nullifiers and private logs that are emitted by all private function calls will (if designed\n /// well) not leak any user secrets, nor leak which functions have been executed.\n ///\n /// [1] Caveats: Some of these privacy guarantees depend on how app developers design their smart contracts. Some\n /// actions _can_ leak information, such as:\n /// - Calling an internal public function.\n /// - Calling a public function and not setting msg_sender to Option::none (feature not built yet - see github).\n /// - Calling any public function will always leak details about the nature of the transaction, so devs should be\n /// careful in their contract designs. If it can be done in a private function, then that will give the best\n /// privacy.\n /// - Not padding the side-effects of a tx to some standardized, uniform size. The kernel circuits can take hints\n /// to pad side-effects, so a wallet should be able to request for a particular amount of padding. Wallets should\n /// ideally agree on some standard.\n /// - Padding should include:\n /// - Padding the lengths of note & nullifier arrays\n /// - Padding private logs with random fields, up to some standardized size. See also:\n /// https://docs.aztec.network/developers/resources/considerations/privacy_considerations\n ///\n /// # Advanced\n /// * The call is added to the private call stack and executed by kernel circuits after this function completes\n /// * The called function can modify its own contract's private state\n /// * Side effects from the called function are included in this transaction\n /// * The call inherits the current transaction's context and gas limits\n ///\n pub fn call_private_function<let ArgsCount: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ArgsCount],\n ) -> ReturnsHash {\n let args_hash = hash_args(args);\n execution_cache::store(args, args_hash);\n self.call_private_function_with_args_hash(contract_address, function_selector, args_hash, false)\n }\n\n /// Makes a read-only call to a private function on another contract.\n ///\n /// This is similar to Solidity's `staticcall`. The called function cannot modify state, emit L2->L2 messages, nor\n /// emit events. Any nested calls are constrained to also be staticcalls.\n ///\n /// See `call_private_function` for more general info on private function calls.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract to call\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `args` - Array of arguments to pass to the called function\n ///\n /// # Returns\n /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n /// return values.\n ///\n pub fn static_call_private_function<let ArgsCount: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ArgsCount],\n ) -> ReturnsHash {\n let args_hash = hash_args(args);\n execution_cache::store(args, args_hash);\n self.call_private_function_with_args_hash(contract_address, function_selector, args_hash, true)\n }\n\n /// Calls a private function that takes no arguments.\n ///\n /// This is a convenience function for calling private functions that don't require any input parameters. It's\n /// equivalent to `call_private_function` but slightly more efficient to use when no arguments are needed.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n ///\n /// # Returns\n /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n /// return values.\n ///\n pub fn call_private_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n ) -> ReturnsHash {\n self.call_private_function_with_args_hash(contract_address, function_selector, 0, false)\n }\n\n /// Makes a read-only call to a private function which takes no arguments.\n ///\n /// This combines the optimisation of `call_private_function_no_args` with the safety of\n /// `static_call_private_function`.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n ///\n /// # Returns\n /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n /// return values.\n ///\n pub fn static_call_private_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n ) -> ReturnsHash {\n self.call_private_function_with_args_hash(contract_address, function_selector, 0, true)\n }\n\n /// Low-level private function call.\n ///\n /// This is the underlying implementation used by all other private function call methods. Instead of taking raw\n /// arguments, it accepts a hash of the arguments.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `args_hash` - Pre-computed hash of the function arguments\n /// * `is_static_call` - Whether this should be a read-only call\n ///\n /// # Returns\n /// * `ReturnsHash` - Hash of the called function's return values\n ///\n pub fn call_private_function_with_args_hash(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args_hash: Field,\n is_static_call: bool,\n ) -> ReturnsHash {\n let is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n let start_side_effect_counter = self.side_effect_counter;\n\n // Safety: The oracle simulates the private call and returns the value of the side effects counter after\n // execution of the call (which means that end_side_effect_counter - start_side_effect_counter is the number of\n // side effects that took place), along with the hash of the return values. We validate these by requesting a\n // private kernel iteration in which the return values are constrained to hash to `returns_hash` and the side\n // effects counter to increment from start to end.\n let (end_side_effect_counter, returns_hash) = unsafe {\n call_private_function_internal(\n contract_address,\n function_selector,\n args_hash,\n start_side_effect_counter,\n is_static_call,\n )\n };\n\n self.private_call_requests.push(\n PrivateCallRequest {\n call_context: CallContext {\n msg_sender: self.this_address(),\n contract_address,\n function_selector,\n is_static_call,\n },\n args_hash,\n returns_hash,\n start_side_effect_counter,\n end_side_effect_counter,\n },\n );\n\n // The kernel circuits ensure that end_side_effect_counter is greater than start_side_effect_counter, and that\n // all side effects emitted in the child call have counters within the range [start_side_effect_counter,\n // end_side_effect_counter]. Therefore, we only need to ensure that the next side effect from the current call\n // starts after the end side effect from the child call.\n self.side_effect_counter = end_side_effect_counter + 1;\n\n ReturnsHash::new(returns_hash)\n }\n\n /// Enqueues a call to a public function to be executed later.\n ///\n /// Unlike private functions which execute immediately on the user's device, public function calls are \"enqueued\"\n /// and executed some time later by a block proposer.\n ///\n /// This means a public function cannot return any values back to a private function, because by the time the\n /// public function is being executed, the private function which called it has already completed execution. (In\n /// fact, the private function has been executed and proven, along with all other private function calls of the\n /// user's tx. A single proof of the tx has been submitted to the Aztec network, and some time later a proposer has\n /// picked the tx up from the mempool and begun executing all of the enqueued public functions).\n ///\n /// # Privacy warning Enqueueing a public function call is an inherently leaky action. Many interesting applications\n /// will require some interaction with public state, but smart contract developers should try to use public function\n /// calls sparingly, and carefully. _Internal_ public function calls are especially leaky, because they completely\n /// leak which private contract made the call. See also:\n /// https://docs.aztec.network/developers/resources/considerations/privacy_considerations\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `args` - Array of arguments to pass to the public function\n /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n ///\n pub fn call_public_function<let ArgsCount: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ArgsCount],\n hide_msg_sender: bool,\n ) {\n let calldata = [function_selector.to_field()].concat(args);\n let calldata_hash = hash_calldata_array(calldata);\n execution_cache::store(calldata, calldata_hash);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, false, hide_msg_sender)\n }\n\n /// Enqueues a read-only call to a public function.\n ///\n /// This is similar to Solidity's `staticcall`. The called function cannot modify state or emit events. Any nested\n /// calls are constrained to also be staticcalls.\n ///\n /// See also `call_public_function` for more important information about making private -> public function calls.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `args` - Array of arguments to pass to the public function\n /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n ///\n pub fn static_call_public_function<let ArgsCount: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ArgsCount],\n hide_msg_sender: bool,\n ) {\n let calldata = [function_selector.to_field()].concat(args);\n let calldata_hash = hash_calldata_array(calldata);\n execution_cache::store(calldata, calldata_hash);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, true, hide_msg_sender)\n }\n\n /// Enqueues a call to a public function that takes no arguments.\n ///\n /// This is an optimisation for calling public functions that don't take any input parameters. It's otherwise\n /// equivalent to `call_public_function`.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n ///\n pub fn call_public_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n hide_msg_sender: bool,\n ) {\n let calldata_hash = hash_calldata_array([function_selector.to_field()]);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, false, hide_msg_sender)\n }\n\n /// Enqueues a read-only call to a public function with no arguments.\n ///\n /// This combines the optimisation of `call_public_function_no_args` with the safety of\n /// `static_call_public_function`.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n ///\n pub fn static_call_public_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n hide_msg_sender: bool,\n ) {\n let calldata_hash = hash_calldata_array([function_selector.to_field()]);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, true, hide_msg_sender)\n }\n\n /// Low-level public function call.\n ///\n /// This is the underlying implementation used by all other public function call methods. Instead of taking raw\n /// arguments, it accepts a hash of the arguments.\n ///\n /// Advanced function: Most developers should use `call_public_function` or `static_call_public_function` instead.\n /// This function is exposed for performance optimization and advanced use cases.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `calldata_hash` - Hash of the function calldata\n /// * `is_static_call` - Whether this should be a read-only call\n /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n ///\n pub fn call_public_function_with_calldata_hash(\n &mut self,\n contract_address: AztecAddress,\n calldata_hash: Field,\n is_static_call: bool,\n hide_msg_sender: bool,\n ) {\n let counter = self.next_counter();\n\n let is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n assert_valid_public_call_data(calldata_hash);\n\n let msg_sender = if hide_msg_sender {\n NULL_MSG_SENDER_CONTRACT_ADDRESS\n } else {\n self.this_address()\n };\n\n let call_request = PublicCallRequest { msg_sender, contract_address, is_static_call, calldata_hash };\n\n self.public_call_requests.push(Counted::new(call_request, counter));\n }\n\n /// Enqueues a public function call, and designates it to be the teardown function for this tx. Only one teardown\n /// function call can be made by a tx.\n ///\n /// Niche function: Only wallet developers and paymaster contract developers (aka Fee-payment contracts) will need\n /// to make use of this function.\n ///\n /// Aztec supports a three-phase execution model: setup, app logic, teardown. The phases exist to enable a fee\n /// payer to take on the risk of paying a transaction fee, safe in the knowledge that their payment (in whatever\n /// token or method the user chooses) will succeed, regardless of whether the app logic will succeed. The \"setup\"\n /// phase ensures the fee payer has sufficient balance to pay the proposer their fees. The teardown phase is\n /// primarily intended to: calculate exactly how much the user owes, based on gas consumption, and refund the user\n /// any change.\n ///\n /// Note: in some cases, the cost of refunding the user (i.e. DA costs of tx side-effects) might exceed the refund\n /// amount. For app logic with fairly stable and predictable gas consumption, a material refund amount is unlikely.\n /// For app logic with unpredictable gas consumption, a refund might be important to the user (e.g. if a hefty\n /// function reverts very early). Wallet/FPC/Paymaster developers should be mindful of this.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the teardown function\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `args` - An array of fields to pass to the function.\n /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n pub fn set_public_teardown_function<let ArgsCount: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ArgsCount],\n hide_msg_sender: bool,\n ) {\n let calldata = [function_selector.to_field()].concat(args);\n let calldata_hash = hash_calldata_array(calldata);\n execution_cache::store(calldata, calldata_hash);\n self.set_public_teardown_function_with_calldata_hash(contract_address, calldata_hash, false, hide_msg_sender)\n }\n\n /// Low-level function to set the public teardown function.\n ///\n /// This is the underlying implementation for setting the teardown function call that will execute at the end of\n /// the transaction. Instead of taking raw arguments, it accepts a hash of the arguments.\n ///\n /// Advanced function: Most developers should use `set_public_teardown_function` instead.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the teardown function\n /// * `calldata_hash` - Hash of the function calldata\n /// * `is_static_call` - Whether this should be a read-only call\n /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n ///\n pub fn set_public_teardown_function_with_calldata_hash(\n &mut self,\n contract_address: AztecAddress,\n calldata_hash: Field,\n is_static_call: bool,\n hide_msg_sender: bool,\n ) {\n let is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n assert_valid_public_call_data(calldata_hash);\n\n let msg_sender = if hide_msg_sender {\n NULL_MSG_SENDER_CONTRACT_ADDRESS\n } else {\n self.this_address()\n };\n\n self.public_teardown_call_request =\n PublicCallRequest { msg_sender, contract_address, is_static_call, calldata_hash };\n }\n\n /// Increments the side-effect counter.\n ///\n /// Very low-level function.\n ///\n /// # Advanced\n ///\n /// Every side-effect of a private function is given a \"side-effect counter\", based on when it is created. This\n /// PrivateContext is in charge of assigning the counters.\n ///\n /// The reason we have side-effect counters is complicated. Consider this illustrative pseudocode of inter-contract\n /// function calls:\n /// ```\n /// contract A {\n /// let x = 5; // pseudocode for storage var x.\n /// fn a1 {\n /// read x; // value: 5, counter: 1.\n /// x = x + 1;\n /// write x; // value: 6, counter: 2.\n ///\n /// B.b(); // start_counter: 2, end_counter: 4\n ///\n /// read x; // value: 36, counter: 5.\n /// x = x + 1;\n /// write x; // value: 37, counter: 6.\n /// }\n ///\n /// fn a2 {\n /// read x; // value: 6, counter: 3.\n /// x = x * x;\n /// write x; // value: 36, counter: 4.\n /// }\n /// }\n ///\n /// contract B {\n /// fn b() {\n /// A.a2();\n /// }\n /// }\n /// ```\n ///\n /// Suppose a1 is the first function called. The comments show the execution counter of each side-effect, and what\n /// the new value of `x` is.\n ///\n /// These (private) functions are processed by Aztec's kernel circuits in an order that is different from execution\n /// order: All of A.a1 is proven before B.b is proven, before A.a2 is proven. So when we're in the 2nd execution\n /// frame of A.a1 (after the call to B.b), the circuit needs to justify why x went from being `6` to `36`. But the\n /// circuit doesn't know why, and given the order of proving, the kernel hasn't _seen_ a value of 36 get written\n /// yet. The kernel needs to track big arrays of all side-effects of all private functions in a tx. Then, as it\n /// recurses and processes B.b(), it will eventually see a value of 36 get written.\n ///\n /// Suppose side-effect counters weren't exposed: The kernel would only see this ordering (in order of proof\n /// verification): [ A.a1.read, A.a1.write, A.a1.read, A.a1.write, A.a2.read, A.a2.write ]\n /// [ 5, 6, 36, 37, 6, 36 ]\n /// The kernel wouldn't know _when_ B.b() was called within A.a1(), because it can't see what's going on within an\n /// app circuit. So the kernel wouldn't know that the ordering of reads and writes should actually be: [ A.a1.read,\n /// A.a1.write, A.a2.read, A.a2.write, A.a1.read, A.a1.write ]\n /// [ 5, 6, 6, 36, 36, 37 ]\n ///\n /// And so, we introduced side-effect counters: every private function must assign side-effect counters alongside\n /// every side-effect that it emits, and also expose to the kernel the counters that it started and ended with.\n /// This gives the kernel enough information to arrange all side-effects in the correct order. It can then catch\n /// (for example) if a function tries to read state before it has been written (e.g. if A.a2() maliciously tried to\n /// read a value of x=37) (e.g. if A.a1() maliciously tried to read x=6).\n ///\n /// If a malicious app contract _lies_ and does not count correctly:\n /// - It cannot lie about its start and end counters because the kernel will catch this.\n /// - It _could_ lie about its intermediate counters:\n /// - 1. It could not increment its side-effects correctly\n /// - 2. It could label its side-effects with counters outside of its start and end counters' range. The kernel\n /// will catch 2. The kernel will not catch 1., but this would only cause corruption to the private state of the\n /// malicious contract, and not any other contracts (because a contract can only modify its own state). If a \"good\"\n /// contract is given _read access_ to a maliciously-counting contract (via an external getter function, or by\n /// reading historic state from the archive tree directly), and they then make state changes to their _own_ state\n /// accordingly, that could be dangerous. Developers should be mindful not to trust the claimed innards of external\n /// contracts unless they have audited/vetted the contracts including vetting the side-effect counter\n /// incrementation. This is a similar paradigm to Ethereum smart contract development: you must vet external\n /// contracts that your contract relies upon, and you must not make any presumptions about their claimed behaviour.\n /// (Hopefully if a contract imports a version of aztec-nr, we will get contract verification tooling that can\n /// validate the authenticity of the imported aztec-nr package, and hence infer that the side- effect counting will\n /// be correct, without having to re-audit such logic for every contract).\n ///\n fn next_counter(&mut self) -> u32 {\n let counter = self.side_effect_counter;\n self.side_effect_counter += 1;\n counter\n }\n}\n\nimpl Empty for PrivateContext {\n fn empty() -> Self {\n PrivateContext {\n inputs: PrivateContextInputs::empty(),\n side_effect_counter: 0 as u32,\n min_revertible_side_effect_counter: 0 as u32,\n is_fee_payer: false,\n args_hash: 0,\n return_hash: 0,\n expiration_timestamp: 0,\n note_hash_read_requests: BoundedVec::new(),\n nullifier_read_requests: BoundedVec::new(),\n key_validation_requests_and_separators: BoundedVec::new(),\n note_hashes: BoundedVec::new(),\n nullifiers: BoundedVec::new(),\n private_call_requests: BoundedVec::new(),\n public_call_requests: BoundedVec::new(),\n public_teardown_call_request: PublicCallRequest::empty(),\n l2_to_l1_msgs: BoundedVec::new(),\n anchor_block_header: BlockHeader::empty(),\n private_logs: BoundedVec::new(),\n contract_class_logs_hashes: BoundedVec::new(),\n last_key_validation_requests: [Option::none(); NUM_KEY_TYPES],\n expected_non_revertible_side_effect_counter: 0,\n expected_revertible_side_effect_counter: 0,\n }\n }\n}\n\n/// Checks that every entry of `log`'s storage past `log.len()` is zero, which the protocol requires of every private\n/// log. `BoundedVec::truncate` and `BoundedVec::pop` only move `len` and leave the vacated storage in place, so a\n/// vector that was shortened before being emitted carries stale values into the log's padding unless the caller\n/// zeroes them; `BoundedVec::from_array` always yields zeroed storage.\nunconstrained fn assert_private_log_zero_padded<let N: u32>(log: BoundedVec<Field, N>) {\n let storage = log.storage();\n let len = log.len();\n for i in len..N {\n assert(\n storage[i] == 0,\n f\"Private log has a non-zero field at index {i}, beyond its length {len}. Fields beyond the length must be zero: if the BoundedVec was shortened with truncate or pop, zero the vacated entries first, or build it with BoundedVec::from_array.\",\n );\n }\n}\n\nmod test {\n use crate::protocol::{constants::PRIVATE_LOG_CIPHERTEXT_LEN, traits::Empty};\n use super::PrivateContext;\n\n #[test]\n unconstrained fn emits_short_log_with_zero_padding() {\n let mut context = PrivateContext::empty();\n let log: BoundedVec<Field, PRIVATE_LOG_CIPHERTEXT_LEN> = BoundedVec::from_array([1, 2, 3]);\n context.emit_private_log_unsafe(7, log);\n\n assert_eq(context.private_logs.len(), 1);\n let emitted = context.private_logs.get(0).inner.log;\n assert_eq(emitted.length, 4);\n assert_eq(emitted.fields[0], 7);\n assert_eq(emitted.fields[1], 1);\n assert_eq(emitted.fields[2], 2);\n assert_eq(emitted.fields[3], 3);\n for i in 4..emitted.fields.len() {\n assert_eq(emitted.fields[i], 0);\n }\n }\n\n #[test(should_fail_with = \"beyond its length\")]\n unconstrained fn rejects_log_with_stale_storage_after_truncate() {\n let mut context = PrivateContext::empty();\n let mut log: BoundedVec<Field, PRIVATE_LOG_CIPHERTEXT_LEN> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n log.truncate(3);\n context.emit_private_log_unsafe(7, log);\n }\n\n #[test(should_fail_with = \"beyond its length\")]\n unconstrained fn rejects_log_with_stale_storage_after_pop() {\n let mut context = PrivateContext::empty();\n let mut log: BoundedVec<Field, PRIVATE_LOG_CIPHERTEXT_LEN> = BoundedVec::from_array([1, 2, 3]);\n let _ = log.pop();\n context.emit_private_log_unsafe(7, log);\n }\n}\n"
|
|
1862
1874
|
},
|
|
1863
1875
|
"73": {
|
|
1864
1876
|
"function_locations": [
|
|
@@ -1911,7 +1923,7 @@
|
|
|
1911
1923
|
"start": 2891
|
|
1912
1924
|
}
|
|
1913
1925
|
],
|
|
1914
|
-
"path": "/
|
|
1926
|
+
"path": "/mnt/user-data/nicov/node-3/noir-projects/aztec-nr/aztec/src/context/utility_context.nr",
|
|
1915
1927
|
"source": "use crate::oracle::{execution::{get_utility_context, UtilityContextData}, storage::storage_read};\nuse crate::protocol::{\n abis::block_header::BlockHeader, address::AztecAddress, constants::NULL_MSG_SENDER_CONTRACT_ADDRESS,\n traits::Packable,\n};\n\n// If you'll modify this struct don't forget to update utility_context.ts as well.\npub struct UtilityContext {\n block_header: BlockHeader,\n contract_address: AztecAddress,\n msg_sender: AztecAddress,\n}\n\nimpl From<UtilityContextData> for UtilityContext {\n fn from(data: UtilityContextData) -> Self {\n Self { block_header: data.block_header, contract_address: data.contract_address, msg_sender: data.msg_sender }\n }\n}\n\nimpl UtilityContext {\n pub unconstrained fn new() -> Self {\n get_utility_context()\n }\n\n pub unconstrained fn at(contract_address: AztecAddress) -> Self {\n // We get a context with default contract address, and then we construct the final context with the provided\n // contract address.\n let default_context = get_utility_context();\n\n Self { block_header: default_context.block_header, contract_address, msg_sender: default_context.msg_sender }\n }\n\n pub fn block_header(self) -> BlockHeader {\n self.block_header\n }\n\n pub fn block_number(self) -> u32 {\n self.block_header.block_number()\n }\n\n pub fn timestamp(self) -> u64 {\n self.block_header.timestamp()\n }\n\n pub fn this_address(self) -> AztecAddress {\n self.contract_address\n }\n\n /// Returns the address that initiated this utility call.\n ///\n /// This is similar to `msg.sender` in Solidity (hence the name). A utility function called by another contract\n /// (via a nested utility call) sees that contract's address. A utility function invoked directly (e.g. by a wallet\n /// or dApp) has no caller and sees `Option::none`.\n ///\n /// Important Note: utility functions are simulated client-side and never proven, so this value is whatever the\n /// simulator (PXE) set it to: nothing about it is verified onchain. It exists to assist simulation in a\n /// cooperative environment and must not be relied on as a security guarantee.\n pub unconstrained fn maybe_msg_sender(self) -> Option<AztecAddress> {\n if self.msg_sender == NULL_MSG_SENDER_CONTRACT_ADDRESS {\n Option::none()\n } else {\n Option::some(self.msg_sender)\n }\n }\n\n pub fn version(self) -> Field {\n self.block_header.version()\n }\n\n pub fn chain_id(self) -> Field {\n self.block_header.chain_id()\n }\n\n pub unconstrained fn raw_storage_read<let N: u32>(self: Self, storage_slot: Field) -> [Field; N] {\n storage_read(self.block_header, self.this_address(), storage_slot)\n }\n\n pub unconstrained fn storage_read<T>(self, storage_slot: Field) -> T\n where\n T: Packable,\n {\n T::unpack(self.raw_storage_read(storage_slot))\n }\n}\n"
|
|
1916
1928
|
},
|
|
1917
1929
|
"78": {
|
|
@@ -1961,88 +1973,104 @@
|
|
|
1961
1973
|
"start": 3259
|
|
1962
1974
|
}
|
|
1963
1975
|
],
|
|
1964
|
-
"path": "/
|
|
1976
|
+
"path": "/mnt/user-data/nicov/node-3/noir-projects/aztec-nr/aztec/src/ephemeral/mod.nr",
|
|
1965
1977
|
"source": "use crate::oracle::ephemeral_oracles;\nuse crate::protocol::traits::{Deserialize, Serialize};\nuse crate::protocol::utils::{reader::Reader, writer::Writer};\nuse crate::unconstrained_array::{ArrayOracles, UnconstrainedArray};\n\n/// A dynamically sized array that exists only during a single contract call frame.\n///\n/// Ephemeral arrays are backed by in-memory storage on the PXE side rather than a persistent database. Each contract\n/// call frame gets its own isolated slot space of ephemeral arrays. Child simulations cannot see the parent's\n/// ephemeral arrays, and vice versa.\n///\n/// Each logical array operation (push, pop, get, etc.) is a single oracle call, making ephemeral arrays significantly\n/// cheaper than capsule arrays.\n///\n/// ## Use Cases\n///\n/// Ephemeral arrays are designed for passing data between PXE (TypeScript) and contracts (Noir) during simulation,\n/// for example, note validation requests or event validation responses. This data type is appropriate for data that\n/// is not supposed to be persisted.\n///\n/// For data that needs to persist across simulations, contract calls, etc, use\n/// [`CapsuleArray`](crate::capsules::CapsuleArray) instead.\n///\n/// For data that must be shared across all frames of the same contract (private and utility) within one top-level PXE\n/// call (transaction simulation or utility call) but not persisted, use\n/// [`TransientArray`](crate::transient::TransientArray).\npub type EphemeralArray<T> = UnconstrainedArray<T, EphemeralOracles>;\n\npub struct EphemeralOracles {}\n\nimpl ArrayOracles for EphemeralOracles {\n unconstrained fn len_oracle(slot: Field) -> u32 {\n ephemeral_oracles::len_oracle(slot)\n }\n\n unconstrained fn push_oracle<let N: u32>(slot: Field, values: [Field; N]) -> u32 {\n ephemeral_oracles::push_oracle(slot, values)\n }\n\n unconstrained fn pop_oracle<let N: u32>(slot: Field) -> [Field; N] {\n ephemeral_oracles::pop_oracle(slot)\n }\n\n unconstrained fn get_oracle<let N: u32>(slot: Field, index: u32) -> [Field; N] {\n ephemeral_oracles::get_oracle(slot, index)\n }\n\n unconstrained fn set_oracle<let N: u32>(slot: Field, index: u32, values: [Field; N]) {\n ephemeral_oracles::set_oracle(slot, index, values)\n }\n\n unconstrained fn remove_oracle(slot: Field, index: u32) {\n ephemeral_oracles::remove_oracle(slot, index)\n }\n\n unconstrained fn clear_oracle(slot: Field) {\n ephemeral_oracles::clear_oracle(slot)\n }\n}\n\n/// Serializes an `EphemeralArray` as its slot, allowing oracle function signatures to use ephemeral array types\n/// instead of opaque `Field` slots.\nimpl<T> Serialize for UnconstrainedArray<T, EphemeralOracles> {\n let N: u32 = 1;\n\n fn serialize(self) -> [Field; Self::N] {\n [self.slot]\n }\n\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self.slot);\n }\n}\n\n/// Deserializes a single Field into an `EphemeralArray` handle, treating the field value as the slot identifier.\nimpl<T> Deserialize for UnconstrainedArray<T, EphemeralOracles> {\n let N: u32 = 1;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n Self { slot: fields[0] }\n }\n\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n Self { slot: reader.read() }\n }\n}\n\n#[crate::unconstrained_array::test_suite::unconstrained_array_tests(quote { crate::ephemeral::EphemeralOracles })]\nmod test {}\n"
|
|
1966
1978
|
},
|
|
1967
1979
|
"84": {
|
|
1968
1980
|
"function_locations": [
|
|
1969
1981
|
{
|
|
1970
1982
|
"name": "record_retractable_fact",
|
|
1971
|
-
"start":
|
|
1983
|
+
"start": 2698
|
|
1972
1984
|
},
|
|
1973
1985
|
{
|
|
1974
1986
|
"name": "record_non_retractable_fact",
|
|
1975
|
-
"start":
|
|
1987
|
+
"start": 3331
|
|
1976
1988
|
},
|
|
1977
1989
|
{
|
|
1978
1990
|
"name": "delete_fact_collection",
|
|
1979
|
-
"start":
|
|
1991
|
+
"start": 3965
|
|
1980
1992
|
},
|
|
1981
1993
|
{
|
|
1982
1994
|
"name": "get_fact_collection",
|
|
1983
|
-
"start":
|
|
1995
|
+
"start": 4340
|
|
1984
1996
|
},
|
|
1985
1997
|
{
|
|
1986
1998
|
"name": "get_fact_collections_by_type",
|
|
1987
|
-
"start":
|
|
1999
|
+
"start": 4730
|
|
1988
2000
|
},
|
|
1989
2001
|
{
|
|
1990
2002
|
"name": "test::setup",
|
|
1991
|
-
"start":
|
|
2003
|
+
"start": 5508
|
|
1992
2004
|
},
|
|
1993
2005
|
{
|
|
1994
2006
|
"name": "test::assert_payload",
|
|
1995
|
-
"start":
|
|
2007
|
+
"start": 5720
|
|
1996
2008
|
},
|
|
1997
2009
|
{
|
|
1998
2010
|
"name": "test::record_fact",
|
|
1999
|
-
"start":
|
|
2011
|
+
"start": 5958
|
|
2000
2012
|
},
|
|
2001
2013
|
{
|
|
2002
2014
|
"name": "test::records_and_reads_a_fact",
|
|
2003
|
-
"start":
|
|
2015
|
+
"start": 6247
|
|
2016
|
+
},
|
|
2017
|
+
{
|
|
2018
|
+
"name": "test::records_and_reads_a_public_fact",
|
|
2019
|
+
"start": 7130
|
|
2020
|
+
},
|
|
2021
|
+
{
|
|
2022
|
+
"name": "test::reading_the_public_scope_excludes_account_facts",
|
|
2023
|
+
"start": 8055
|
|
2024
|
+
},
|
|
2025
|
+
{
|
|
2026
|
+
"name": "test::deleting_an_account_collection_keeps_the_public_collection",
|
|
2027
|
+
"start": 8731
|
|
2004
2028
|
},
|
|
2005
2029
|
{
|
|
2006
2030
|
"name": "test::reads_collections_by_type",
|
|
2007
|
-
"start":
|
|
2031
|
+
"start": 9513
|
|
2008
2032
|
},
|
|
2009
2033
|
{
|
|
2010
2034
|
"name": "test::records_a_retractable_fact_finalized_at_latest_block",
|
|
2011
|
-
"start":
|
|
2035
|
+
"start": 10263
|
|
2012
2036
|
},
|
|
2013
2037
|
{
|
|
2014
2038
|
"name": "test::retractable_fact_above_proven_tip_is_pending",
|
|
2015
|
-
"start":
|
|
2039
|
+
"start": 11519
|
|
2016
2040
|
},
|
|
2017
2041
|
{
|
|
2018
2042
|
"name": "test::deletes_a_fact_collection",
|
|
2019
|
-
"start":
|
|
2043
|
+
"start": 12416
|
|
2020
2044
|
},
|
|
2021
2045
|
{
|
|
2022
2046
|
"name": "test::reading_unknown_collection_returns_none",
|
|
2023
|
-
"start":
|
|
2047
|
+
"start": 12922
|
|
2024
2048
|
},
|
|
2025
2049
|
{
|
|
2026
2050
|
"name": "test::cannot_record_for_other_contract",
|
|
2027
|
-
"start":
|
|
2051
|
+
"start": 13331
|
|
2052
|
+
},
|
|
2053
|
+
{
|
|
2054
|
+
"name": "test::cannot_record_for_an_account_outside_the_allowed_scopes",
|
|
2055
|
+
"start": 13700
|
|
2028
2056
|
},
|
|
2029
2057
|
{
|
|
2030
2058
|
"name": "test::re_recording_an_identical_fact_is_a_no_op",
|
|
2031
|
-
"start":
|
|
2059
|
+
"start": 14041
|
|
2032
2060
|
},
|
|
2033
2061
|
{
|
|
2034
2062
|
"name": "test::deleting_a_non_existing_collection_is_a_no_op",
|
|
2035
|
-
"start":
|
|
2063
|
+
"start": 14537
|
|
2036
2064
|
},
|
|
2037
2065
|
{
|
|
2038
2066
|
"name": "test::recording_a_fact_after_delete_recreates_the_collection",
|
|
2039
|
-
"start":
|
|
2067
|
+
"start": 14969
|
|
2040
2068
|
}
|
|
2041
2069
|
],
|
|
2042
|
-
"path": "/
|
|
2043
|
-
"source": "//! Per-contract storage of immutable facts grouped into collections.\n//!\n//! A fact is a contract-defined, typed, immutable datum. Facts are grouped into collections identified by a\n//! `(collection type, collection id)` tuple.\n//!\n//! They are stored in PXE's FactStore, which automatically deals with reorgs by removing any facts\n//! associated with blocks that have been pruned.\nuse crate::ephemeral::EphemeralArray;\nuse crate::oracle::block_reference::BlockReference;\nuse crate::oracle::fact_store::{\n delete_fact_collection_oracle, get_fact_collection_oracle, get_fact_collections_by_type_oracle, record_fact_oracle,\n};\nuse crate::protocol::{address::AztecAddress, traits::{Deserialize, Serialize}};\n\nmod origin_state;\npub use origin_state::OriginBlockState;\n\n/// A retractable fact's origin block.\n#[derive(Deserialize, Eq, Serialize)]\npub struct RetractableFactOrigin {\n pub block_number: u32,\n pub block_hash: Field,\n pub block_state: OriginBlockState,\n}\n\n/// A single immutable fact in a collection.\n#[derive(Deserialize, Serialize)]\npub struct Fact {\n /// A user-defined identifier for fact kinds. Typically used to determine how to deserialize `payload`.\n pub fact_type_id: Field,\n pub payload: EphemeralArray<Field>,\n /// The block the fact is associated to, if any. A fact with an origin block is said to be a 'retractable' fact,\n /// and will be automatically deleted if its origin block gets pruned in a reorg. Typically used by facts\n /// associated with a transaction (e.g. 'processed entry X using data from tx Y in block Z').\n pub origin_block: Option<RetractableFactOrigin>,\n}\n\n/// A fact collection as returned by the store.\n#[derive(Deserialize, Serialize)]\npub struct FactCollection {\n pub contract_address: AztecAddress,\n pub scope: AztecAddress,\n /// The collection's type. A single contract may have facts in collections of different types (e.g. one for the\n /// processing offchain messages, another for partial notes, etc.).\n pub fact_collection_type_id: Field,\n /// The collection's unique identifier among the other collections of this type in this contract and scope.\n pub fact_collection_id: Field,\n pub facts: EphemeralArray<Fact>,\n}\n\n/// Records a retractable fact into a collection: PXE prunes it if `origin_block` is reorg'd away. Re-recording an\n/// identical fact is a no-op.\npub unconstrained fn record_retractable_fact(\n contract_address: AztecAddress,\n scope: AztecAddress,\n fact_collection_type_id: Field,\n fact_collection_id: Field,\n fact_type_id: Field,\n payload: EphemeralArray<Field>,\n origin_block: BlockReference,\n) {\n record_fact_oracle(\n contract_address,\n scope,\n fact_collection_type_id,\n fact_collection_id,\n fact_type_id,\n payload,\n Option::some(origin_block),\n );\n}\n\n/// Records a non-retractable fact into a collection: it survives reorgs and will persist until the fact collection\n/// itself is deleted. Re-recording an identical fact is a no-op.\npub unconstrained fn record_non_retractable_fact(\n contract_address: AztecAddress,\n scope: AztecAddress,\n fact_collection_type_id: Field,\n fact_collection_id: Field,\n fact_type_id: Field,\n payload: EphemeralArray<Field>,\n) {\n record_fact_oracle(\n contract_address,\n scope,\n fact_collection_type_id,\n fact_collection_id,\n fact_type_id,\n payload,\n Option::none(),\n );\n}\n\n/// Deletes a fact collection, removing all its facts from PXE storage.\n///\n/// Collections must be eventually deleted to reclaim storage and to stop reprocessing past the lifespan of the\n/// workflows they enable.\n///\n/// A no-op if no such collection exists.\npub unconstrained fn delete_fact_collection(\n contract_address: AztecAddress,\n scope: AztecAddress,\n fact_collection_type_id: Field,\n fact_collection_id: Field,\n) {\n delete_fact_collection_oracle(\n contract_address,\n scope,\n fact_collection_type_id,\n fact_collection_id,\n );\n}\n\n/// Fetches a fact collection.\npub unconstrained fn get_fact_collection(\n contract_address: AztecAddress,\n scope: AztecAddress,\n fact_collection_type_id: Field,\n fact_collection_id: Field,\n) -> Option<FactCollection> {\n get_fact_collection_oracle(\n contract_address,\n scope,\n fact_collection_type_id,\n fact_collection_id,\n )\n}\n\n/// Returns every fact collection of `fact_collection_type_id`.\npub unconstrained fn get_fact_collections_by_type(\n contract_address: AztecAddress,\n scope: AztecAddress,\n fact_collection_type_id: Field,\n) -> EphemeralArray<FactCollection> {\n get_fact_collections_by_type_oracle(contract_address, scope, fact_collection_type_id)\n}\n\nmod test {\n use crate::ephemeral::EphemeralArray;\n use crate::facts::{\n delete_fact_collection, get_fact_collection, get_fact_collections_by_type, record_non_retractable_fact,\n record_retractable_fact,\n };\n use crate::oracle::block_reference::BlockReference;\n use crate::protocol::address::AztecAddress;\n use crate::protocol::traits::{FromField, ToField};\n use crate::test::helpers::test_environment::TestEnvironment;\n\n global TYPE_ID: Field = 42;\n global COLLECTION_ID: Field = 7;\n global FACT_TYPE_ID: Field = 99;\n global PAYLOAD: [Field; 3] = [123, 456, 789];\n\n unconstrained fn setup() -> (TestEnvironment, AztecAddress) {\n let mut env = TestEnvironment::new();\n let scope = env.create_light_account();\n (env, scope)\n }\n\n unconstrained fn assert_payload(payload: EphemeralArray<Field>) {\n assert_eq(payload.len(), PAYLOAD.len());\n for i in 0..PAYLOAD.len() {\n assert_eq(payload.get(i), PAYLOAD[i]);\n }\n }\n\n unconstrained fn record_fact(contract_address: AztecAddress, scope: AztecAddress) {\n record_non_retractable_fact(\n contract_address,\n scope,\n TYPE_ID,\n COLLECTION_ID,\n FACT_TYPE_ID,\n EphemeralArray::from_array(PAYLOAD),\n );\n }\n\n #[test]\n unconstrained fn records_and_reads_a_fact() {\n let (env, scope) = setup();\n env.private_context(|context| {\n let contract_address = context.this_address();\n record_fact(contract_address, scope);\n\n let collection = get_fact_collection(contract_address, scope, TYPE_ID, COLLECTION_ID).unwrap();\n assert_eq(collection.contract_address, contract_address);\n assert_eq(collection.scope, scope);\n assert_eq(collection.fact_collection_type_id, TYPE_ID);\n assert_eq(collection.fact_collection_id, COLLECTION_ID);\n assert_eq(collection.facts.len(), 1);\n\n let fact = collection.facts.get(0);\n assert_eq(fact.fact_type_id, FACT_TYPE_ID);\n assert_payload(fact.payload);\n assert(fact.origin_block.is_none());\n });\n }\n\n #[test]\n unconstrained fn reads_collections_by_type() {\n let (env, scope) = setup();\n env.private_context(|context| {\n let contract_address = context.this_address();\n record_fact(contract_address, scope);\n\n let collections = get_fact_collections_by_type(contract_address, scope, TYPE_ID);\n assert_eq(collections.len(), 1);\n\n let collection = collections.get(0);\n assert_eq(collection.fact_collection_id, COLLECTION_ID);\n assert_eq(collection.facts.len(), 1);\n\n let fact = collection.facts.get(0);\n assert_eq(fact.fact_type_id, FACT_TYPE_ID);\n assert_payload(fact.payload);\n });\n }\n\n #[test]\n unconstrained fn records_a_retractable_fact_finalized_at_latest_block() {\n let (env, scope) = setup();\n let origin_block_number = env.last_block_number();\n env.private_context(|context| {\n let contract_address = context.this_address();\n record_retractable_fact(\n contract_address,\n scope,\n TYPE_ID,\n COLLECTION_ID,\n FACT_TYPE_ID,\n EphemeralArray::from_array(PAYLOAD),\n BlockReference { block_number: origin_block_number, block_hash: 0xabc },\n );\n\n let collection = get_fact_collection(contract_address, scope, TYPE_ID, COLLECTION_ID).unwrap();\n assert_eq(collection.facts.len(), 1);\n\n let fact = collection.facts.get(0);\n assert_eq(fact.fact_type_id, FACT_TYPE_ID);\n assert_payload(fact.payload);\n\n let origin = fact.origin_block.unwrap();\n assert_eq(origin.block_number, origin_block_number);\n assert_eq(origin.block_hash, 0xabc);\n // TXE finalizes every mined block, so an origin at the latest block is Finalized.\n assert(origin.block_state.is_finalized());\n });\n }\n\n #[test]\n unconstrained fn retractable_fact_above_proven_tip_is_pending() {\n let (env, scope) = setup();\n let future_block_number = env.last_block_number() + 100;\n env.private_context(|context| {\n let contract_address = context.this_address();\n record_retractable_fact(\n contract_address,\n scope,\n TYPE_ID,\n COLLECTION_ID,\n FACT_TYPE_ID,\n EphemeralArray::from_array(PAYLOAD),\n BlockReference { block_number: future_block_number, block_hash: 0xabc },\n );\n\n let origin = get_fact_collection(contract_address, scope, TYPE_ID, COLLECTION_ID)\n .unwrap()\n .facts\n .get(0)\n .origin_block\n .unwrap();\n assert(origin.block_state.is_pending());\n });\n }\n\n #[test]\n unconstrained fn deletes_a_fact_collection() {\n let (env, scope) = setup();\n env.private_context(|context| {\n let contract_address = context.this_address();\n record_fact(contract_address, scope);\n delete_fact_collection(contract_address, scope, TYPE_ID, COLLECTION_ID);\n\n let collections = get_fact_collections_by_type(contract_address, scope, TYPE_ID);\n assert_eq(collections.len(), 0);\n });\n }\n\n #[test]\n unconstrained fn reading_unknown_collection_returns_none() {\n let (env, scope) = setup();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let collection = get_fact_collection(contract_address, scope, TYPE_ID, COLLECTION_ID);\n assert(collection.is_none());\n });\n }\n\n #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_record_for_other_contract() {\n let (env, scope) = setup();\n env.private_context(|context| {\n let other = AztecAddress::from_field(context.this_address().to_field() + 1);\n record_fact(other, scope);\n });\n }\n\n #[test]\n unconstrained fn re_recording_an_identical_fact_is_a_no_op() {\n let (env, scope) = setup();\n env.private_context(|context| {\n let contract_address = context.this_address();\n record_fact(contract_address, scope);\n record_fact(contract_address, scope);\n\n let collection = get_fact_collection(contract_address, scope, TYPE_ID, COLLECTION_ID).unwrap();\n assert_eq(collection.facts.len(), 1);\n });\n }\n\n #[test]\n unconstrained fn deleting_a_non_existing_collection_is_a_no_op() {\n let (env, scope) = setup();\n env.private_context(|context| {\n let contract_address = context.this_address();\n delete_fact_collection(contract_address, scope, TYPE_ID, COLLECTION_ID);\n\n assert(get_fact_collection(contract_address, scope, TYPE_ID, COLLECTION_ID).is_none());\n });\n }\n\n #[test]\n unconstrained fn recording_a_fact_after_delete_recreates_the_collection() {\n let (env, scope) = setup();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n record_fact(contract_address, scope);\n let collection_before_delete =\n get_fact_collection(contract_address, scope, TYPE_ID, COLLECTION_ID).unwrap();\n assert_eq(collection_before_delete.facts.len(), 1);\n\n delete_fact_collection(contract_address, scope, TYPE_ID, COLLECTION_ID);\n assert(get_fact_collection(contract_address, scope, TYPE_ID, COLLECTION_ID).is_none());\n\n record_fact(contract_address, scope);\n let collection_after_recreate =\n get_fact_collection(contract_address, scope, TYPE_ID, COLLECTION_ID).unwrap();\n assert_eq(collection_after_recreate.facts.len(), 1);\n });\n }\n}\n"
|
|
2070
|
+
"path": "/mnt/user-data/nicov/node-3/noir-projects/aztec-nr/aztec/src/facts/mod.nr",
|
|
2071
|
+
"source": "//! Per-contract storage of immutable facts grouped into collections.\n//!\n//! A fact is a contract-defined, typed, immutable datum. Facts are grouped into collections identified by a\n//! `(collection type, collection id)` tuple, within a [`FactScope`].\n//!\n//! They are stored in PXE's FactStore, which automatically deals with reorgs by removing any facts\n//! associated with blocks that have been pruned.\nuse crate::ephemeral::EphemeralArray;\nuse crate::oracle::block_reference::BlockReference;\nuse crate::oracle::fact_store::{\n delete_fact_collection_oracle, get_fact_collection_oracle, get_fact_collections_by_type_oracle, record_fact_oracle,\n};\nuse crate::protocol::{address::AztecAddress, traits::{Deserialize, Serialize}};\n\nmod origin_state;\nmod scope;\npub use origin_state::OriginBlockState;\npub use scope::FactScope;\n\n/// A retractable fact's origin block.\n#[derive(Deserialize, Eq, Serialize)]\npub struct RetractableFactOrigin {\n pub block_number: u32,\n pub block_hash: Field,\n pub block_state: OriginBlockState,\n}\n\n/// A single immutable fact in a collection.\n#[derive(Deserialize, Serialize)]\npub struct Fact {\n /// A user-defined identifier for fact kinds. Typically used to determine how to deserialize `payload`.\n pub fact_type_id: Field,\n pub payload: EphemeralArray<Field>,\n /// The block the fact is associated to, if any. A fact with an origin block is said to be a 'retractable' fact,\n /// and will be automatically deleted if its origin block gets pruned in a reorg. Typically used by facts\n /// associated with a transaction (e.g. 'processed entry X using data from tx Y in block Z').\n pub origin_block: Option<RetractableFactOrigin>,\n}\n\n/// A fact collection as returned by the store.\n#[derive(Deserialize, Serialize)]\npub struct FactCollection {\n pub contract_address: AztecAddress,\n pub scope: FactScope,\n /// The collection's type. A single contract may have facts in collections of different types (e.g. one for the\n /// processing offchain messages, another for partial notes, etc.).\n pub fact_collection_type_id: Field,\n /// The collection's unique identifier among the other collections of this type in this contract and scope.\n pub fact_collection_id: Field,\n pub facts: EphemeralArray<Fact>,\n}\n\n/// Records a retractable fact into a collection: PXE prunes it if `origin_block` is reorg'd away. Re-recording an\n/// identical fact is a no-op.\npub unconstrained fn record_retractable_fact(\n contract_address: AztecAddress,\n scope: FactScope,\n fact_collection_type_id: Field,\n fact_collection_id: Field,\n fact_type_id: Field,\n payload: EphemeralArray<Field>,\n origin_block: BlockReference,\n) {\n record_fact_oracle(\n contract_address,\n scope,\n fact_collection_type_id,\n fact_collection_id,\n fact_type_id,\n payload,\n Option::some(origin_block),\n );\n}\n\n/// Records a non-retractable fact into a collection: it survives reorgs and will persist until the fact collection\n/// itself is deleted. Re-recording an identical fact is a no-op.\npub unconstrained fn record_non_retractable_fact(\n contract_address: AztecAddress,\n scope: FactScope,\n fact_collection_type_id: Field,\n fact_collection_id: Field,\n fact_type_id: Field,\n payload: EphemeralArray<Field>,\n) {\n record_fact_oracle(\n contract_address,\n scope,\n fact_collection_type_id,\n fact_collection_id,\n fact_type_id,\n payload,\n Option::none(),\n );\n}\n\n/// Deletes a fact collection, removing all its facts from PXE storage.\n///\n/// Collections must be eventually deleted to reclaim storage and to stop reprocessing past the lifespan of the\n/// workflows they enable.\n///\n/// A no-op if no such collection exists.\npub unconstrained fn delete_fact_collection(\n contract_address: AztecAddress,\n scope: FactScope,\n fact_collection_type_id: Field,\n fact_collection_id: Field,\n) {\n delete_fact_collection_oracle(\n contract_address,\n scope,\n fact_collection_type_id,\n fact_collection_id,\n );\n}\n\n/// Fetches a fact collection.\npub unconstrained fn get_fact_collection(\n contract_address: AztecAddress,\n scope: FactScope,\n fact_collection_type_id: Field,\n fact_collection_id: Field,\n) -> Option<FactCollection> {\n get_fact_collection_oracle(\n contract_address,\n scope,\n fact_collection_type_id,\n fact_collection_id,\n )\n}\n\n/// Returns every fact collection of `fact_collection_type_id`.\npub unconstrained fn get_fact_collections_by_type(\n contract_address: AztecAddress,\n scope: FactScope,\n fact_collection_type_id: Field,\n) -> EphemeralArray<FactCollection> {\n get_fact_collections_by_type_oracle(contract_address, scope, fact_collection_type_id)\n}\n\nmod test {\n use crate::ephemeral::EphemeralArray;\n use crate::facts::{\n delete_fact_collection, FactScope, get_fact_collection, get_fact_collections_by_type,\n record_non_retractable_fact, record_retractable_fact,\n };\n use crate::oracle::block_reference::BlockReference;\n use crate::protocol::address::AztecAddress;\n use crate::protocol::traits::{FromField, ToField};\n use crate::test::helpers::test_environment::TestEnvironment;\n\n global TYPE_ID: Field = 42;\n global COLLECTION_ID: Field = 7;\n global FACT_TYPE_ID: Field = 99;\n global PAYLOAD: [Field; 3] = [123, 456, 789];\n\n unconstrained fn setup() -> (TestEnvironment, FactScope) {\n let mut env = TestEnvironment::new();\n let scope = FactScope::account(env.create_light_account());\n (env, scope)\n }\n\n unconstrained fn assert_payload(payload: EphemeralArray<Field>) {\n assert_eq(payload.len(), PAYLOAD.len());\n for i in 0..PAYLOAD.len() {\n assert_eq(payload.get(i), PAYLOAD[i]);\n }\n }\n\n unconstrained fn record_fact(contract_address: AztecAddress, scope: FactScope) {\n record_non_retractable_fact(\n contract_address,\n scope,\n TYPE_ID,\n COLLECTION_ID,\n FACT_TYPE_ID,\n EphemeralArray::from_array(PAYLOAD),\n );\n }\n\n #[test]\n unconstrained fn records_and_reads_a_fact() {\n let (env, scope) = setup();\n env.private_context(|context| {\n let contract_address = context.this_address();\n record_fact(contract_address, scope);\n\n let collection = get_fact_collection(contract_address, scope, TYPE_ID, COLLECTION_ID).unwrap();\n assert_eq(collection.contract_address, contract_address);\n assert_eq(collection.scope, scope);\n assert_eq(collection.fact_collection_type_id, TYPE_ID);\n assert_eq(collection.fact_collection_id, COLLECTION_ID);\n assert_eq(collection.facts.len(), 1);\n\n let fact = collection.facts.get(0);\n assert_eq(fact.fact_type_id, FACT_TYPE_ID);\n assert_payload(fact.payload);\n assert(fact.origin_block.is_none());\n });\n }\n\n #[test]\n unconstrained fn records_and_reads_a_public_fact() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n record_fact(contract_address, FactScope::public());\n\n let collection = get_fact_collection(\n contract_address,\n FactScope::public(),\n TYPE_ID,\n COLLECTION_ID,\n )\n .unwrap();\n assert_eq(collection.scope, FactScope::public());\n assert_eq(collection.facts.len(), 1);\n assert_payload(collection.facts.get(0).payload);\n\n let collections = get_fact_collections_by_type(contract_address, FactScope::public(), TYPE_ID);\n assert_eq(collections.len(), 1);\n assert_eq(collections.get(0).scope, FactScope::public());\n });\n }\n\n #[test]\n unconstrained fn reading_the_public_scope_excludes_account_facts() {\n let (env, scope) = setup();\n env.private_context(|context| {\n let contract_address = context.this_address();\n record_fact(contract_address, scope);\n\n assert(\n get_fact_collection(\n contract_address,\n FactScope::public(),\n TYPE_ID,\n COLLECTION_ID,\n )\n .is_none(),\n );\n assert_eq(get_fact_collections_by_type(contract_address, FactScope::public(), TYPE_ID).len(), 0);\n });\n }\n\n #[test]\n unconstrained fn deleting_an_account_collection_keeps_the_public_collection() {\n let (env, scope) = setup();\n env.private_context(|context| {\n let contract_address = context.this_address();\n record_fact(contract_address, scope);\n record_fact(contract_address, FactScope::public());\n\n delete_fact_collection(contract_address, scope, TYPE_ID, COLLECTION_ID);\n assert(get_fact_collection(contract_address, scope, TYPE_ID, COLLECTION_ID).is_none());\n assert(\n get_fact_collection(\n contract_address,\n FactScope::public(),\n TYPE_ID,\n COLLECTION_ID,\n )\n .is_some(),\n );\n });\n }\n\n #[test]\n unconstrained fn reads_collections_by_type() {\n let (env, scope) = setup();\n env.private_context(|context| {\n let contract_address = context.this_address();\n record_fact(contract_address, scope);\n\n let collections = get_fact_collections_by_type(contract_address, scope, TYPE_ID);\n assert_eq(collections.len(), 1);\n\n let collection = collections.get(0);\n assert_eq(collection.fact_collection_id, COLLECTION_ID);\n assert_eq(collection.facts.len(), 1);\n\n let fact = collection.facts.get(0);\n assert_eq(fact.fact_type_id, FACT_TYPE_ID);\n assert_payload(fact.payload);\n });\n }\n\n #[test]\n unconstrained fn records_a_retractable_fact_finalized_at_latest_block() {\n let (env, scope) = setup();\n let origin_block_number = env.last_block_number();\n env.private_context(|context| {\n let contract_address = context.this_address();\n record_retractable_fact(\n contract_address,\n scope,\n TYPE_ID,\n COLLECTION_ID,\n FACT_TYPE_ID,\n EphemeralArray::from_array(PAYLOAD),\n BlockReference { block_number: origin_block_number, block_hash: 0xabc },\n );\n\n let collection = get_fact_collection(contract_address, scope, TYPE_ID, COLLECTION_ID).unwrap();\n assert_eq(collection.facts.len(), 1);\n\n let fact = collection.facts.get(0);\n assert_eq(fact.fact_type_id, FACT_TYPE_ID);\n assert_payload(fact.payload);\n\n let origin = fact.origin_block.unwrap();\n assert_eq(origin.block_number, origin_block_number);\n assert_eq(origin.block_hash, 0xabc);\n // TXE finalizes every mined block, so an origin at the latest block is Finalized.\n assert(origin.block_state.is_finalized());\n });\n }\n\n #[test]\n unconstrained fn retractable_fact_above_proven_tip_is_pending() {\n let (env, scope) = setup();\n let future_block_number = env.last_block_number() + 100;\n env.private_context(|context| {\n let contract_address = context.this_address();\n record_retractable_fact(\n contract_address,\n scope,\n TYPE_ID,\n COLLECTION_ID,\n FACT_TYPE_ID,\n EphemeralArray::from_array(PAYLOAD),\n BlockReference { block_number: future_block_number, block_hash: 0xabc },\n );\n\n let origin = get_fact_collection(contract_address, scope, TYPE_ID, COLLECTION_ID)\n .unwrap()\n .facts\n .get(0)\n .origin_block\n .unwrap();\n assert(origin.block_state.is_pending());\n });\n }\n\n #[test]\n unconstrained fn deletes_a_fact_collection() {\n let (env, scope) = setup();\n env.private_context(|context| {\n let contract_address = context.this_address();\n record_fact(contract_address, scope);\n delete_fact_collection(contract_address, scope, TYPE_ID, COLLECTION_ID);\n\n let collections = get_fact_collections_by_type(contract_address, scope, TYPE_ID);\n assert_eq(collections.len(), 0);\n });\n }\n\n #[test]\n unconstrained fn reading_unknown_collection_returns_none() {\n let (env, scope) = setup();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let collection = get_fact_collection(contract_address, scope, TYPE_ID, COLLECTION_ID);\n assert(collection.is_none());\n });\n }\n\n #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_record_for_other_contract() {\n let (env, scope) = setup();\n env.private_context(|context| {\n let other = AztecAddress::from_field(context.this_address().to_field() + 1);\n record_fact(other, scope);\n });\n }\n\n #[test(should_fail_with = \"not in the allowed scopes list\")]\n unconstrained fn cannot_record_for_an_account_outside_the_allowed_scopes() {\n let (env, _) = setup();\n env.private_context(|context| {\n let outsider = AztecAddress::from_field(context.this_address().to_field() + 1);\n record_fact(context.this_address(), FactScope::account(outsider));\n });\n }\n\n #[test]\n unconstrained fn re_recording_an_identical_fact_is_a_no_op() {\n let (env, scope) = setup();\n env.private_context(|context| {\n let contract_address = context.this_address();\n record_fact(contract_address, scope);\n record_fact(contract_address, scope);\n\n let collection = get_fact_collection(contract_address, scope, TYPE_ID, COLLECTION_ID).unwrap();\n assert_eq(collection.facts.len(), 1);\n });\n }\n\n #[test]\n unconstrained fn deleting_a_non_existing_collection_is_a_no_op() {\n let (env, scope) = setup();\n env.private_context(|context| {\n let contract_address = context.this_address();\n delete_fact_collection(contract_address, scope, TYPE_ID, COLLECTION_ID);\n\n assert(get_fact_collection(contract_address, scope, TYPE_ID, COLLECTION_ID).is_none());\n });\n }\n\n #[test]\n unconstrained fn recording_a_fact_after_delete_recreates_the_collection() {\n let (env, scope) = setup();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n record_fact(contract_address, scope);\n let collection_before_delete =\n get_fact_collection(contract_address, scope, TYPE_ID, COLLECTION_ID).unwrap();\n assert_eq(collection_before_delete.facts.len(), 1);\n\n delete_fact_collection(contract_address, scope, TYPE_ID, COLLECTION_ID);\n assert(get_fact_collection(contract_address, scope, TYPE_ID, COLLECTION_ID).is_none());\n\n record_fact(contract_address, scope);\n let collection_after_recreate =\n get_fact_collection(contract_address, scope, TYPE_ID, COLLECTION_ID).unwrap();\n assert_eq(collection_after_recreate.facts.len(), 1);\n });\n }\n}\n"
|
|
2044
2072
|
},
|
|
2045
|
-
"
|
|
2073
|
+
"87": {
|
|
2046
2074
|
"function_locations": [
|
|
2047
2075
|
{
|
|
2048
2076
|
"name": "compute_secret_hash",
|
|
@@ -2085,7 +2113,7 @@
|
|
|
2085
2113
|
"start": 5428
|
|
2086
2114
|
}
|
|
2087
2115
|
],
|
|
2088
|
-
"path": "/
|
|
2116
|
+
"path": "/mnt/user-data/nicov/node-3/noir-projects/aztec-nr/aztec/src/hash.nr",
|
|
2089
2117
|
"source": "//! Aztec hash functions.\n\nuse crate::protocol::{\n address::{AztecAddress, EthAddress},\n constants::{\n DOM_SEP__FUNCTION_ARGS, DOM_SEP__MESSAGE_NULLIFIER, DOM_SEP__PUBLIC_BYTECODE, DOM_SEP__PUBLIC_CALLDATA,\n DOM_SEP__SECRET_HASH, MAX_PACKED_PUBLIC_BYTECODE_SIZE_IN_FIELDS,\n },\n hash::{poseidon2_hash_subarray, poseidon2_hash_with_separator, sha256_to_field},\n traits::ToField,\n};\n\npub use crate::protocol::hash::compute_siloed_nullifier;\n\npub fn compute_secret_hash<let N: u32>(secret: [Field; N]) -> Field {\n poseidon2_hash_with_separator(secret, DOM_SEP__SECRET_HASH)\n}\n\npub fn compute_l1_to_l2_message_hash(\n sender: EthAddress,\n chain_id: Field,\n recipient: AztecAddress,\n version: Field,\n content: Field,\n secret_hash: Field,\n leaf_index: Field,\n) -> Field {\n let mut hash_bytes = [0 as u8; 224];\n let sender_bytes: [u8; 32] = sender.to_field().to_be_bytes();\n let chain_id_bytes: [u8; 32] = chain_id.to_be_bytes();\n let recipient_bytes: [u8; 32] = recipient.to_field().to_be_bytes();\n let version_bytes: [u8; 32] = version.to_be_bytes();\n let content_bytes: [u8; 32] = content.to_be_bytes();\n let secret_hash_bytes: [u8; 32] = secret_hash.to_be_bytes();\n let leaf_index_bytes: [u8; 32] = leaf_index.to_be_bytes();\n\n for i in 0..32 {\n hash_bytes[i] = sender_bytes[i];\n hash_bytes[i + 32] = chain_id_bytes[i];\n hash_bytes[i + 64] = recipient_bytes[i];\n hash_bytes[i + 96] = version_bytes[i];\n hash_bytes[i + 128] = content_bytes[i];\n hash_bytes[i + 160] = secret_hash_bytes[i];\n hash_bytes[i + 192] = leaf_index_bytes[i];\n }\n\n sha256_to_field(hash_bytes)\n}\n\n// The nullifier of an l1 to l2 message is the hash of the message salted with the secret.\npub fn compute_l1_to_l2_message_nullifier<let N: u32>(message_hash: Field, secret: [Field; N]) -> Field {\n poseidon2_hash_with_separator([message_hash].concat(secret), DOM_SEP__MESSAGE_NULLIFIER)\n}\n\n// Computes the hash of input arguments or return values for private functions, or for authwit creation.\npub fn hash_args<let N: u32>(args: [Field; N]) -> Field {\n if args.len() == 0 {\n 0\n } else {\n poseidon2_hash_with_separator(args, DOM_SEP__FUNCTION_ARGS)\n }\n}\n\n// Computes the hash of calldata for public functions.\npub fn hash_calldata_array<let N: u32>(calldata: [Field; N]) -> Field {\n poseidon2_hash_with_separator(calldata, DOM_SEP__PUBLIC_CALLDATA)\n}\n\n/// Computes the public bytecode commitment for a contract class. The commitment is `hash([(length | separator),\n/// ...bytecode])`.\n///\n/// @param packed_bytecode - The packed bytecode of the contract class. 0th word is the length in bytes.\n/// packed_bytecode is mutable so that we can avoid copying the array to construct one starting with first_field\n/// instead of length. @returns The public bytecode commitment.\npub fn compute_public_bytecode_commitment(\n mut packed_public_bytecode: [Field; MAX_PACKED_PUBLIC_BYTECODE_SIZE_IN_FIELDS],\n) -> Field {\n // First field element contains the length of the bytecode\n let bytecode_length_in_bytes: u32 = packed_public_bytecode[0] as u32;\n let bytecode_length_in_fields: u32 = (bytecode_length_in_bytes / 31) + (bytecode_length_in_bytes % 31 != 0) as u32;\n // Don't allow empty public bytecode. AVM doesn't handle execution of contracts that exist with empty bytecode.\n assert(bytecode_length_in_fields != 0);\n assert(bytecode_length_in_fields < MAX_PACKED_PUBLIC_BYTECODE_SIZE_IN_FIELDS);\n\n // Packed_bytecode's 0th entry is the length. Append it to the separator before hashing.\n let first_field = DOM_SEP__PUBLIC_BYTECODE.to_field() + (packed_public_bytecode[0] as u64 << 32) as Field;\n packed_public_bytecode[0] = first_field;\n\n // `fields_to_hash` is the number of fields from the start of `packed_public_bytecode` that should be included in\n // the hash. Fields after this length are ignored. +1 to account for the prepended field.\n let num_fields_to_hash = bytecode_length_in_fields + 1;\n\n poseidon2_hash_subarray(packed_public_bytecode, num_fields_to_hash)\n}\n\n#[test]\nunconstrained fn secret_hash_matches_typescript() {\n let secret = 8;\n let hash = compute_secret_hash([secret]);\n\n // The following value was generated by `yarn-project/stdlib/src/hash/hash.test.ts`\n let secret_hash_from_ts = 0x1848b066724ab0ffb50ecb0ee3398eb839f162823d262bad959721a9c13d1e96;\n\n assert_eq(hash, secret_hash_from_ts);\n}\n\n#[test]\nunconstrained fn var_args_hash_matches_typescript() {\n let mut input = [0; 100];\n for i in 0..100 {\n input[i] = i as Field;\n }\n let hash = hash_args(input);\n\n // The following value was generated by `yarn-project/stdlib/src/hash/hash.test.ts`\n let var_args_hash_from_ts = 0x262e5e121a8efc0382566ab42f0ae2a78bd85db88484f83018fe07fc2552ba0c;\n\n assert_eq(hash, var_args_hash_from_ts);\n}\n\n#[test]\nunconstrained fn compute_calldata_hash() {\n let mut input = [0; 100];\n for i in 0..input.len() {\n input[i] = i as Field;\n }\n let hash = hash_calldata_array(input);\n\n // The following value was generated by `yarn-project/stdlib/src/hash/hash.test.ts`\n let calldata_hash_from_ts = 0x14a1539bdb1d26e03097cf4d40c87e02ca03f0bb50a3e617ace5a7bfd3943944;\n\n // Used in cpp vm2 tests:\n assert_eq(hash, calldata_hash_from_ts);\n}\n\n#[test]\nunconstrained fn public_bytecode_commitment() {\n let mut input = [0; MAX_PACKED_PUBLIC_BYTECODE_SIZE_IN_FIELDS];\n let len = 99;\n for i in 1..len + 1 {\n input[i] = i as Field;\n }\n input[0] = (len as Field) * 31;\n let hash = compute_public_bytecode_commitment(input);\n // Used in cpp vm2 tests:\n assert_eq(hash, 0x09348974e76c3602893d7a4b4bb52c2ec746f1ade5004ac471d0fbb4587a81a6);\n}\n"
|
|
2090
2118
|
}
|
|
2091
2119
|
},
|
|
@@ -3981,11 +4009,11 @@
|
|
|
3981
4009
|
"visibility": "databus"
|
|
3982
4010
|
}
|
|
3983
4011
|
},
|
|
3984
|
-
"bytecode": "H4sIAAAAAAAA/+3dBdwc5fX3/8zM6o27Q3B3d3d3JwQIEAhJCME1aCkFIkhLS4tDsVIcirvswZ3g7u72v0LbO+HKnO7ZIYff7v/5fF99/Z77udj7OnPG9r2zc0+y4cNOe7Znr169DxrcZ+de/Qf16tt/cJ9B/Xv326dXrz79Bw86cOCAMDKy64khV6zSr/fOe64y4IA19u2/86q9+/Ubcv4mK2+w5urDh1y4Zd/B/fvss0/a0/CiLDG8aFLLTJOvZHjRVI0jDK+a2vSqGSxLNaPlRTNZXtTT8qKZTUs+i+lVs5peNZvpVbNbFn4uy4vmseww81peNJ/lRQtYlmkhy0wLW160iOVFi1mWaQnLTEtaXrSU5UXLWJZpOctMy1tetILlRStZlmkVy0yrWl60WjLkklUG9e3Xr+9uo/77KT2GDh0xdOhdPXv87yRDLl55n336DBq8TZ9BA0YMHTb8rp4L7bLBoFcWPmvu6zda/dohQ7bafq5F317rwBsGDlv1lS9GfBx+RbKT/ve0T87/2p5Fpj1ZnbZ7PGdFXL3RgH369N1lQP9FNuozaK99B/ce3HdA/+GndK+YsLjdP885+mgf47+ffIpkQyUbJtlwyUb8cslHDG++Cuc2vCZUMK2DU5pO1aP1BZzHtIC2jXSqxwLOa1rA4aYFPM2wgEX2ojF/PnWMn08b4+cRYU86XbI/SvYnyc5ofT3MZ1oPp5vWw589NtT8pgX8o2kB/+KxgAuYFvBPpgU802lP+vMYP/9ljJ/PHOPnM8Ke9FfJ/ibZWZKd3fp6WNC0Hv5qWg/neGyohUwL+DfTAp7rsYALmxbwLNMCnue0J50zxs/njvHzeWP8fHbYk86X7ALJLpTsotbXwyKm9XC+aT383WNDLWpawAtMC3ixxwIuZlrAC00LeInTnvT3MX6+eIyfLxnj54vCnnSpZJdJdrlk/2h9PSxuWg+XmtbDFR4bagnTAl5mWsB/eizgkqYFvNy0gFc67UlXjPHzP8f4+coxfv5H2JOukuxqya6R7NrW18NSpvVwlWk9XOexoZY2LeDVpgW83mMBlzEt4DWmBbzBaU+6boyfrx/j5xvG+PnasCfdKNm/JLtJsptbXw/LmtbDjab1cIvHhlrOtID/Mi3grR4LuLxpAW8yLeBtTnvSLWP8fOsYP982xs83hz3pdsnukOxOye5qfT2sYFoPt5vWw90eG2pF0wLeYVrAezwWcCXTAt5pWsB7nfaku8f4+Z4xfr53jJ/vCnvSfZLdL9kDkj3Y+npY2bQe7jOth4bHhlrFtID3mxZQPBZwVdMCPmBawIec9qTGGD/LGD8/NMbPD4Y96WHJHpHsUckea309rGZaDw+b1sPjHhtqddMCPmJawCecNtTjY/z8xBg/PzrGz4+FDfWkZE9J9rRkz/xyPQw39Di7qcNnDZfzm39TEObp2foSTm5awueaTJRsfIRpCZ9b6ZffZmTDhlywad/+u/Xr8+8vE5ot7dzN94WfZ9xrYL8+kj3f+jclw0YYFiLMPMy0g49svm6LVB85tNVjdrhpcZ817QsvFFilzWadJzRlWcZ5TEv4Yourx7LaQ99hYtt3KS8VOmONfbS81POXR0vS4tEyZ/PlGGqbqdg6bbam5g3T2vbMF03r/WWH7T5qzxxhqG7bM0eaXvWKw0krrOtXLKeNX+xw6anj/PTc2oRzjesJ5xzXE1revUdPaTkq5sssx0Rm+dqx+ZINH/1u+eroH1+z9v7KODrTvdqzwAn5lfB7ttPHK6bD7vVx1MzrPVs+E2bzjRhX29zU6hstnimHGzZIWM8vG0/6trfRN4soZ1ydg99q8Rw83LTLvhje1K379uu2tfR2qyf1Vs29YEvmfsfH3AuGmW2npHcdzB2qv9uquW3nsGfD/mjazl2DXeq/FXYgW/19i1wnaL77vmfZqF2DTa/at8CO12wJFwqb3vIms5Cp2/ddNuJ7YWLbyeKDcfQW98Gv/GQy/zj8ZFJknTZbUwuHaW20eN+03j9s9SRdGt4qQ5t8QPvpp59eHj3l/z6ZJaP+zxgy/Gj0jx/bTu+Wfegj28s+7tn65cemHxiHf/zzqz4ybbyPDWu21R0s7DihvMd7yqgTluXUazthvWt61ScO7/jhEPzE/QOrwTatTbjAuJ5w/hYmtBl0ZFCH2QZDWyhv2e8XGWcfbhdp6cPtp6N//Mx6Rv3E0LvlDPZpz197bn+l6Rno66Ln9s9H//jFuDu3f2572ReFzu2vmM7tn5vOXF8Y1mzr5/ZPQnmPc/uo5m3Q+9Kh+tzm6l85VJ/LXP1rF2SHT+Rv2Op/41B/TnP333p1/5qt/nden5ON/X/v1f+rtvo/tPo52Tbtj5Zp1++z14BBB67dv+/gET1G9lgpnAbCsRgOiLBPhh0jbJuwesIShtk64n8X/LufVjdX7efN9Yltvf5kWK8X/Xs5Nhw4vMeIO8KvSKnQ1dFPjO8dpR6mj57hZYb5SkmLDd75c4NJwZVu+9D8iWnJ05Y3TSmVUtbyplmwhU2T2TZNZmqw1PKmGdVgyW/TpNZNU25905SlVGl50yzQwqap2DZNxdRgtfVNExqs+m2azLppaq1vmpqU6q1/ZbXIuPrKahFTX10FvrIy7Td1EwDCC7tsO1jd1M54re9gYTON57eDlaw72Pit72DjS2mClo/9+Vs49iewbZoJTA1O2PqmCQ1O6LdpytZNM1Hrm2YiKU1c4IvMT0ZdRzFunIltG2diU4uTtL5xQouT+G2cinXjTNr6xplUSpMV+FKtNPlv+qVawfPuZNbz7uS2/Wcy06qZovX9J2yFKfz2n6p1/5my9f1nSilNVezg/tS6FaeybZypTC1O3frGCS1OXeDz/KgWx+VnlWnGzbXi0jQ940+bP0pp2gIXDErTGS7lRrvLdFKavkipGZp/sIhLzSClGYuUmqk5lONSM0mpZ5FSMzcnU1xqZinNUqTUrM0JEJeaVUqzFSk1e/M3tLjU7FKao0ip5vdaVuNSc0ppriKlmt94WotLzS2leYqUmrdpqXpcal4pzVekVPPv/rriUvNLaYEipZp/ETpeXGpBKS1UpNTCTUuNH5daWEqLFCm1aNNSE8SlFpXSYkVKLd601IRxqcWltESRUks2LTVRXGpJKS1VpNTSTUtNHJdaWkrLFCm1bNNSk8SllpXSckVKLd+01KRxqeWltEKRUis2LTVZXGpFKa1UpNTKTUtNHpdaWUqrFCm1atNSU8SlVpXSakVKrd601JRxqdWltEaRUms2LTVVXGpNKa1VpNTaTUtNHZdaW0rrFCm1btNS08Sl1pXSekVKrd+01LRxqfWltEGRUhs2LTVdXGpDKW1UpNTGTUtNH5faWEqbFCm1adNSM8SlNpXSZkVKbd601Ixxqc2ltEWRUls2LTVTXGpLKW1VpNTWTUvFn69KW0tpmyKltm1aaua41LZS2q5Iqe2blpolLrW9lHYoUqpX01KzxqV6SWnHIqV6Ny01W1yqt5R2KlJq56alZo9L7SylXYqU6tO01BxxqT5S2rVIqd2alpozLrWblHYvUqpv01JzxaX6SmmPIqX2bFpq7rjUnlLqV6TUXk1LzROX2ktK/YuUGtC01LxxqQFSGlik1N5NS80Xl9pbSoOKlNqnaan541LhGtfgIqWaX4ZeIC61r5T2K1Jq/6alFoxL7S+lA4qUOrBpqYXiUgdK6aAipQ5uWmrhuNTBUjqkSKlDm5ZaJC51qJQOK1Lq8KalFo1LHS6lI4qUGtK01GJxqSFSOrJIqaOallo8LnWUlI4uUuqYpqWWiEsdI6Vji5Q6rmmpJeNSx0npd0VKHd+01FJxqeOl9PsipU5oWmrpuNQJUvpDkVInNi21TFzqRCmdVKTUyU1LLRuXOllKQ4uUGta01HJxqWFSGl6kVPOvhpaPS42Q0ilFSjV/nvoKcalTpXRakVKnNy21YlzqdCn9sdVvzco///my7Q8NS39q9S5Y299um/4cqXSG4auv1r8yDM2/aWu+1Ue0G2++t/3ZfOkvDtV/7t52+3vpTIf6c5q7/6tL98+a6//NUn+M+7STkT3OCntM2GxhzYXFDzP8n993zf/G7f8K3seehNNoOJnZ9ruzDPvd6DeBZNSbQNjvzi5yH/uHxj+gti34OR4HbAsr7tzWV9y5UjqvwD1P74f1bTrbhBeeY7ut5mxTi+e3eE5KOSf9//5/xc9JZ4QdyvbIkBMKHNoG3YWjz/SHoqXzTEfHBabbIE9o6TSRjro1LZwmLiiI7HH47InShS4n2LAVLrSdYC9qcc2FE+xFUvq76zJd3PoyXSylS4r8adH71veGv9tO+X83NXip10a/1Hbon+x16F9iO/QvMa2ly0yH/smtH/phZ7nM9fP15YZbLgtt38ubfRD/6KeffgqvNC3lPwxLGR1m/5DSFQWX3Lbm/tn6of9PKV1Z4DbqcEx3WQ/+K2wH/xWmFq/yOvivsh38I7wO/ittB/+VprV0tengH9H6wR92l6v93vcz6/v+NV57wTW2A+3a1g+0a6V0nesyXd/6Ml0vpRuK/O2a+X3/Otuhf52pwRu9NvqNtkP/dK9D/wbboX+DaS39y3Ton976oR92ln+5vu/f1HS6UrHte5Phff8H6/v+zYaljA6zm6V0S6H32OwD69+RTWNbxbe6HEL2C1K3tbTb/XxB6jYp3V7gqva74ddM37uU7nD4jJyMOmDCkt/h+knvztbXZlisu4qtzbtsa/Nuh48dP6/N8L+7fwX7m7wytX7/dk/r6/weKd3bBkt+n8u3R2HPuNe2Z9zvYNKf94z7wtyusnqg9W3+gJQeLLY2H7StzYbD2/zPazMseeNXvM02eWXJurdK6+tcpPRQsY+yk1s9e4vNs7eYWnzYy7PjdEM80uJSDrfu6A9Z23nYdpQ+2vq+/kj4rV/3APnmfxo3xgPkS4/5PEB+8TCz6WGbpcebr8gi1R8f6vXeMrnto9k5XofSrbb6hf419+a79BOmk/w5pledW2DHa7aES4RNbzkjLmHq9kmXjfhEmNh2AnnKUN/ynIOnfuUD5BdtvhzWB8gXWqfN1tSSYVrb++CTpvX+tGEZtYcMm/9pEuslq1b+1a7mr2ry/P5f8eD60jOjf3x2nD3cuPSM7WXxv8Z4yrhcZ/97p/n3I5BLz5h2rWcN67/1S3ZPhvJDi5zxe/w2q+g/i/lcgTN+09qjmn/Odj59fhydT5/v2fJijnpjsrzF2t6YHje9aqTD6g6n2pHu/1CAwbCtTbjYuJ5w0RYmNH/+mNxswHH9DwUsNc7+oYClmi/ZGG8ZL4z+8UUrIEaOo4P4hZ6/8j38FfsjE7NX7P90XvNXfdL0PaToP1BQemn0jy+Pu/fwl2wve7nQe7hxnZnew18ynVdfNqz/1t/DR4byHu/hNdMqqlmfvfZKi4tofUJh9qX1m6VpbcfSl6Z2XvVq5ytrO9Pb2vnK1M5rXu18bW1nRls7X5vaed2rnW+s7fS0tfONqZ03vNr51trOLLZ2vjW186ZXO99Z25nN1s53pnbe8mrne2s7c9ja+d7Uztte7fxgbWcuWzs/mNp5x+WCbljKeWyfHd/1qj+frf57XvUXsNV/36v+Qrb6H3jVX8RW/0Ov+ovZ6n/kVX8JW/2PveovZav/iVf9ZWz1P/Wqv5yt/mde9Vew1f/cq/5KtvpfeNVfxVb/S6/6q9nqf+VVfw1b/a+96q9lq/+NV/11bPW/9aq/nq3+d171N7DV/96r/ka2+j941d/EVv9Hr/qb2er/5FV/C1P9cg+v+lvZ6ide9bex1U+96m9nq5951d/BVr/kVX9HW/2yV/2dbPUrXvV3sdWvetXf1Va/5lV/d1v9ulf9PWz1u7zq97PVH8+rfn9b/fG96g+01Z/Aq/4gW/0JveoPttWfyKv+frb6E3vVP8BWfxKv+gfZ6k/qVf8QW/3JvOofZqs/uVf9I2z1p/Cqf6St/pRe9Y+21Z/Kq/6xtvpTe9X/na3+NF71f2+rP61X/T/Y6k/nVf8kW/3pverbnrtZnsGr/nBb/Rm96p9iqz+TV/3TbPV7etX/o63+zJb6YzxWLRvZYyUpvSql16T0evjqPXxdHb7iDV+Lhq8Sw7d54Qu18J1W+FopfLMTvlwJ32+ErxjCVf5woT1c6w6Xm8MV33DRNVz3DJcew9W/cAEuXAMLl6HClaBwMSZcDwmXJMJVgfDBPHw2Dh9PwyfE8CEtfE4KH1XCp4UA9mDmwNYgx4C34KdAmKCI8EYe3kvD21l4Rwkn9XBeDae2cHYJB3g4xsJuHva0sLHD+g4tF39s2EgpvWJbr7MY1uvoP1LKRtwRfkXKs7b8F1ajFsp4H1R5VtMXx+FllgZna7HBO39ucLaCK932ZwgjTUs+e+ubZnYpz9Hyplm8hU1ju0UhvMzS4Jytb5rQ4Jx+mya1bpq5Wt80c0l57pY3zWItbJq5bZtmblOD87S+aUKD8/htmsy6aeZtfdPMK+X5Wr5jM1vK8gcUpnumTX3N3+Ib8HDrfjOfcTOV57ftYPOZ2lmg9R0sbKYF/HawknUHW7D1HWxBKS/U8rG/aAvH/kK2TbOQqcGFW980ocGF/TZN2bppFml90ywi5UVb3jQ/L/mL1o2zqG3jLGpqcbHWN05ocTG/jVOxbpzFW984i0t5iQJ/plxe0rLCx9mfKRc87y5hPe8uadt/TH86Vl6q9f0nbIWl/PafqnX/Wbr1/WdpKS9T7OB+wboVl7FtnGVMLS7b+sYJLS5b5O86x8mfzfxnsZdrPlWh/adsuzeuvLxhtRn+AKm8fM9iu/kL4/JT3wrjqJkVekZHQ/ajlFeMxkrhqsNK8Vi4BrFyPBauSKwSj80s5VXjsVmlvFo8Fj6zrR6PzSnlNeKxuaW8ZjwWzLdWPDa/lNeOxwJA1onHFpbyuvHYolJeLx4L57f147ElpbxBPBYOtQ3jsWWlvFE8tryUN47HVpTyJvHYylLeNB5bVcqbxWOrS3nzeGxNKW8Rj60t5S3jsXWlvFU8tr6Ut47HNpTyNvHYxlLeNh7bVMrbxWObS3n7eGxLKe8Qj20t5V7x2LZS3jEe217KveOxXlLeKR7rLeWd47GdpbxLPNZHyn3isd2kvGs81lfKu8Vje0p593hsLyn3jccGSHmPeGxvKe8Zj4UDs188tq+U94rH9pdy/3jsQCkPiMcOlvLAeOxQKe8djx0u5UHx2BAp7xOPHSXlwfHYMVLeNx47Tsr7xWPHS3n/eOwEKR8Qj50o5QPjsZOlfFA8NkzKB8djI6R8SDx2qpQPjcdOl/JhLb8tlk2POygbH3dQPrxFOVofd1A+3Pa2eESL9W3/LJjt4QPlIR4mKB8RJrY1f2RLlBr1uLbykVI+qsh17aeNj6ixLfjRHntNCyvumNZXXDhBHFvgM1DYk4+y7vJH25h9lKnF41pucZSdfheNjbLT8fFYsNPv47FgpxPisWCnP8RjwU4nxmPBTifFY8FOJ8djwU5D47Fgp2HxWLDT8Hgs2GlEPBbsdEo8Fux0ajwW7HRaPBbsdHo8Fuz0x3gs2OlP8Viw0xnxWLDTn+OxYKe/xGPBTmfGY8FOf43Hgp3+Fo8FO50VjwU7nR2PBTudE48FO50bjwU7nRePBTudH48FO10QjwU7XRiPBTtdFI8FO/09Hgt2ujgeC3a6JB4Ldro0Hgt2uiweC3a6PB4LdvpHPBbsdEU8Fuz0z3gs2OnKeCzY6ap4LNjp6ngs2OmaeCzY6dp4LNjpungs2On6eCzY6YZ4LNjpxngs2Olf8Viw003xWLDTzfFYODXeEo8FO90ajwU73RaPBTvdHo8FO90RjwU73RmPBTvdFY8FO90djwU73ROPBTv98vHAxls0mj/Pd6X4neM+Kd9fpFTzB+CuHJd6QMoPFinVaFpqlbhUQ8pSpNRDTUutGpd6SMoPFynV/CGqq8WlHpHyo0VKPda01Opxqcek/HiRUk80LbVGXOoJKT9ZpFTzZzOuGZd6SspPFyn1TNNSa8WlnpHys0VKNX9C29pxqeek/HyRUs2f47ROXCpcEXyhSKkXm5ZaNy71opRfKlLq5aal1otLvSzlV4qUav7omvXjUq9K+bUipZo/h2WDuNTrUn6jSKnmDxXZMC71ppTfKlKq+RMyNopLvS3ld4qUav70iI3jUu9K+b0ipZo/qGGTuNT7Uv6gSKnmz0TYNC71oZQ/KlKq+eMHNotLfSzlT4qU+rRpqc3jUp9K+bMipZr/Uf0WcanPpfxFkVLN/359y7jUl1L+qkip5n8qvlVc6mspf1OkVPO/yt46LvWtlL8rUqr5H0BvE5f6Xso/FCnV/G+Nt41LhesTPxUoVWn+Z73bRaUq4beSIqWa/wXt9nGpVCpZkVLN/1h1h7hUSSrlIqWa/11or7hURSrVIqWa/wnmjnGpmlTqRUo1/2vH3nGpLqmMV6RU8z8s3CkuNb5UJihSqvnf8O0cl5pQKhMVKdX8z+V2iUtNLJVJipSatGmpPnGpSaUyWZFSzf8IbNe41ORSmaJIqeZ/b7VbXGpKqUxVpFTzP23aPS41tVSmKVKq+V8R9Y1LTSuV6YqUav4HO3vEpaaXygxFSjX/25g941IzSmWmIqWa/xlKv7hUT6nMXKRU87+M2CsuNYtUZi1SqvnfKPSPS80mldmLlJqjaakBcak5pDJnkVLNb5IfGJeaSypzFynV/Hb1veNS80hl3iKl5mtaalBcaj6pzF+kVPN7pPeJSy0glQWLlFqoaanBcamFpLJwkVKLNC21b1xqEaksWqRU85tl94tLLSaVxYuUWqJpqf3jUktIZckipZrfwnlAXGopqSxdpNQyTUsdGJdaRirLFinV/CbCg+JSy0ll+SKlmt9id3BcagWprFik1EpNSx0Sl1pJKisXKbVK01KHxqVWkcqqRUqt1rTUYXGp1aSyepFSazQtdXhcag2prFmk1FpNSx0Rl1pLKmsXKbVO01JD4lLrSGXdIqXWa1rqyLjUelJZv0ipDZqWOioutYFUNixSaqOmpY6OS20klY2LlNqkaalj4lKbSGXTIqU2a1rq2LjUZlLZvEipLZqWOi4utYVUtixSaqumpeJbaypbSWXrIqW2aVoqvmOnso1Uti1SarumpeIbgSrbSWX7IqV2aFoqvr+osoNUehUptWPTUvFtS5UdpdK7SKmdmpaK74aq7CSVnYuU2qVpqfgmq8ouUulTpNSuTUvF925VdpXKbkVK7d60VHxLWGV3qfQtUmqPpqXiO80qe0hlzyKl+jUtFd/AVuknlb2KlOrftFR8X1ylv1QGFCk1sGmp+Ha7ykCp7F2k1KCmpeK7+CqDpLJPkVKDm5aKbw6sDJbKvkVK7de0VHzPYWU/qexfpNQBTUvFtzJWDpDKgUVKHdS0VHyHZOUgqRxcpNQhTUvFN15WDpHKoUVKHda0VHw/Z+UwqRxepFTze9zj20QrR0hlSJFSze8oj+8+rRwplaOKlGp+D3h8U2vlaKkcU6TUsU1LxffKVo6VynG/eNZOaWSPs6T8OykfL+XfS/kEKf9ByidK+SQpnyzloVIeJuXhUh4h5VOkfKqUT5Py6VL+o5T/JOUzpPxnKf9FymdK+a9S/puUw1RnS/kcKZ8r5fOkfL6UL5DyhVK+SMp/l/LFUr5EypdK+TIpXy7lf0j5Cin/U8pXSvkqKV8t5WukfK2Ur5Py9VK+Qco3SvlfUr5JyjdL+RYp3yrl26R8u5TDd6Z3SvkuKd8t5XukfK+U75fyg1IWKT8s5Uel/LiUn5Ty01J+VsrPS/kFKb8k5Vek/JqU35DyW1J+R8rvSfkDKX8k5U+k/Fn4Yj58YR6+yA5fMIcvfsMXsuGL0vAFZvhiMXzhF76IC1+QhS+uwhdK4Yue8AVM+GIkfGERvkgIF/jDhfdwQTxcqA4XkMOF3XDBNVwIDRcow4XDcEEvXGgLF8DChalwwShcyAkXWMKFj3BBIlwoCB/gwwfr8IE3fBANHxDDB7fwgSp80AkfQMIHgwD2AOkA3ADPAMIAtQCoAJsAjgCB8AYd3jjDG1p4owlvAOHEHE6Y4UQWTjDhwA8HZDhQwg4cdqywwQs/i6g8RMrHmfbFrvsL/OmD4S9RpHys6W9iy8eajpjfWeYy9TL6uCqN+lPesJp/93/8N0uV413+lPfJMLHtdPR7l79+Cbux7TF/lRNa3GzhdHiCVP7gukwntr5MJ0rlpJb/lGnxsKGMf7hT+YPp73HCyywNnuy10U+2nXfE6bxTOcl03qmcZFpLQ03nHWn5vDNqZxn6f33eGdZ0qrTYeWdYsz9q/Oinn34y/sPwleEeSzlqRxluWsryENNSjjAsZXS+GCGVUwouue0cdmrr57BTpXJay+ewn/9YcH7rWewU21nsFFOLp3udxU63ncUe9TqLnWY7i51mWkt/NJ3FHm39LBZ2lz/+X5/F/tR0qqzYWexPtqPsDK9d8Axb/T+3fpT/WSp/cV2mM1tfpjOl8teWzzyLtqCnv9jOO38xNfg3r43+N9t550mv885fbeedv5rW0lmm886TrZ93ws5y1v/1eefsplOVip13zja45Aerns7xWMpRO8o5pqU06ulcw1JG54tzpXJeIamUnrI+Ccv2rzRWzm/xWDQ+8sP05KrKBS1eO/jtn1RWudDlXGl+uEblopbOLz9fbb1IKn8vcPA+Hn7NtHErFztcz0pGnRnDkl/semHkktbX5iVSubTY2rzUtjYvc/iU/vPaDEt+2a/4cNnklanxuT6Vy1tf55dL5R9tsORXeBz7o/aMf9j2jH86fPL5ec+4IsztSugrW9/mV0rlqmJr8yrb2rzawXM/r82w5Ff/CoY0eWXJurde0/o6v0Yq1xa7YLKk9YPLebYPLueZWrzO64PLON0Q17e4lMOtO/q11nausx2lN7S+r18ffquIB23ev9HHgy+aXmX74PQvwzq7ZJVBffv167vbqOesnpING3LBpn3779avz7+/YG+2IIYn+v48414D+4VvZW8aMXSowxdw4evim4aZDtybm6+0ItVvHupxqIeDqLyk7RrFy16nmvNt9V9p9XOZ6TnnlVtMb4Ivm171SoEdr9kSLhc2veUdYzlTt7d6bMTKLWFi2wn2NkN9w5OZK7f1/OU5JWnxnGJ4EPpQ20zF1mmzNbV8mNbmhFtN6/32Vk/SpeHdK9R8JeZ5085yY3jLaHIuC1/UvTx6e/7vFyej/s/w0ef/O0b/eKftrcCyv91he9mdPQtdIyw9bzsFvupy9I7aILb6r7V6Cm7yrd/wj39egDtMu/CdplPwq6ZXvWbY/1q+3l65NbQy1Odd6q7frvkehe5PGtX8Xbb3gLvH0XvA3a0fbKPeTC0r3PZmerPpVfc4rO7w9nDP0FZP6emp49zdrU24zLiecOkWJhxu5rDZrUNbKG85g6yQWd7yLf8cmuEfwBjjLfPe0T/eZ0XPPePoIL635690R/hiZ3nTCeqC8NVFc3d8XdQd94/+8YFx5477bS97oNi/ulJe3va+/7phY7f+jjFqg9jqv+HjjvtN5+8HTG+qr5te9YZh/2vdHfeEVpzc8WDztmqm5mutb0XrvwJWetW6u69o+0eGXjWtmoZXO69Z21nJ1s5rpnbEq53Xre2sbGvndVM7D3m184a1nVVs7bxhaudhr3betLazqq2dN03tPOLVzlvWdlaztfOWqZ1Hvdp529rO6rZ23ja185hXO+9Y21nD1s47pnYe92rnXWs7a9raedfUzhNe7bxnbWctWzvvmdp50qud963trG1rx/Zt2FNe7XxgbWcdWzsfmNp52qudD63trGtr50NTO894tfORtZ31bO18ZGrnWa92Pra2s76tnY9N7Tzn1c4n1nY2sLVju1Hyea92PrW2s6GtnU9N7Yz0auczazsb2dr5zNTOC17tfG5tZ2NbO5+b2nnRq50vrO1sYmvnC1M7L3m186W1nU1t7Xxpaudlr3a+srazma2dr0ztvOLVztfWdja3tfO1qZ1Xvdr5xtrOFrZ2vjG185pXO99a29nS1s63pnZe92rnO2s7W9na+c7UjttV0O+t7Wxta+d7UztverXzg7WdbWzt/GBq5y2vdn60trOtrZ0fTe287dXOT9Z2trO185OpnXec2in3sLazve3f0O1hauddr3YSazs72NpJTO2859VOam2nl62d1NTO+17tZNZ2drS1k5na+cCrnZK1nd62dkqmdj70aqdsbWcnWztlUzsfebVTsbazs62diqmdj73aqVrb2cXWTtXUzide7dSs7fSxtVMztfOpVzt1azu72tqpm9r5zKudLms7u9na6TK187lXO+NZ29nd1s54pna+8GpnfGs7fW3tjG9q50uvdiawtrOHrZ0JTO185dXOhNZ29rS1M6Gpna+92pnI2k4/WzsTmdr5xqudia3t7GVrZ2JTO996tTOJtZ3+tnYmMbXznVc7k1rbGWBrZ1JTO997tTOZtZ2BtnYmM7Xzg1c7k1vb2dvWzuSmdn70amcKazuDbO1MYWrnJ692prS2s4+tnSkt7VR7eLUzlbWdwbZ2pjK1k3i1M7W1nX1t7Uxtaif1amcaazv72dqZxtRO5tXOtNZ29re1M62pnZJXO9NZ2znA1s50pnbKXu1Mb23nQFs705vaqXi1M4O1nYNs7cxgaqfq1c6M1nYOtrUzo6mdmlc7M1nbOcTWzkymdupe7fS0tnOorZ2epna6vNqZ2drOYbZ2Zja1M56lnTH+SZPyyB4rSaUhFZHKQ1J5WCqPSOVRqTwmlcel8oRUnpTKU1J5WirPSOVZqTwnleelMlIqL0jlRam8JJWXpfKKVF6VymtSeT18dR6+bg5f0YavNcNXgeHrs/CVU/iaJny1Eb4OCJfQw2XncKk2XN4MlwTDZbRw6SlcrgmXOMJlgfBROnz8DB/Zwsec8NEgcDoQNLAtUCfwILylhrehcOoOp7twigiHVdgVw+YLLRf+JztG/VHWg6a/bquOb1ivox86VB5xR/gVqU7Q8hOTRi2UZQ8Li16dwLTjVE0XmaoTttjgnT83OGHBlW57bMY9piWfqPVNM5FUJ2550yzbwqaZ2LZpTJdkqpO0vmlCg5P4bZrUumkmbX3TTCrVyVreNMu0sGkms20a0wWM6uStb5rQ4OR+myazbpopWt80U0h1yrGWvFmlbAXL085Mfy9v6msqj/fzUfvNlMbNVJ3KtoPZLlpM3foOFjbT1H47WMm6g03T+g42jVSnbfnYX7qFY39a26axfSaervVNExqczm/TlK2bZvrWN830Up2h9cc/jlry+6wbZwbbxrF9hpyx9Y0TWpzRb+NUrBtnptY3zkxS7VngwQHVmS0rfJw9Vq/geben9bw7s23/sX0snKX1/SdshVn89p+qdf+ZtfX9Z1apzlbs4L7XuhVns22c2Uwtzt76xgktzl7kEJnDtPOPkweLjHpRof2nOoftM+ychtVmeJBNdc6exXbze8flp765xlEzc/WMjobsR6nOHY2VppPqPPHYDFKdNx4L54D54rGZpTp/PBZ2xwXisdmlumA8NqdUF4rH5pbqwvHYvFJdJB6bX6qLxmMLSnWxeGxhqS4ejy0q1SXiscWlumQ8tqRUl4rHlpbq0vHYslJdJh5bXqrLxmMrSnW5eGxlqS4fj60q1RXisdWlumI8tqZUV4rH1pbqyvHYulJdJR5bX6qrxmMbSnW1eGxjqa4ej20q1TXisc2lumY8tqVU14rHtpbq2vHYtlJdJx7bXqrrxmO9pLpePNZbquvHYztLdYN4rI9UN4zHdpPqRvFYX6luHI/tKdVN4rG9pLppPDZAqpvFY3tLdfN4LByYW8Rj+0p1y3hsf6luFY8dKNWt47GDpbpNPHaoVLeNxw6X6nbx2BCpbh+PHSXVHeKxY6TaKx47Tqo7xmPHS7V3PHaCVHeKx06U6s7x2MlS3SUeGybVPvHYCKnuGo+dKtXd4rHTpbp7kbfFvpZPI5ZHXZZbf2Cp9VGX1b62t8U9Wqxve3a87cGT1T09TFDdI0xsa75fS5Qa9c8vVPtJda8i17VvN1hxeetDqqv9PfaaFlbcgNZXXDj5DSzwGSjsyXtZd3nbvXPVvUwt7t1yi6PsNCgaG2WnfeKxYKfB8Viw077xWLDTfvFYsNP+8Viw0wHxWLDTgfFYsNNB8Viw08HxWLDTIfFYsNOh8Viw02HxWLDT4fFYsNMR8Viw05B4LNjpyHgs2OmoeCzY6eh4LNjpmHgs2OnYeCzY6bh4LNjpd/FYsNPx8Viw0+/jsWCnE+KxYKc/xGPBTifGY8FOJ8VjwU4nx2PBTkPjsWCnYfFYsNPweCzYaUQ8Fux0SjwW7HRqPBbsdFo8Fux0ejwW7PTHeCzY6U/xWLDTGfFYsNOf47Fgp7/EY+H0cWY8Fuz013gs2Olv8Viw01nxWLDT2fFYsNM58Viw07nxWLDTefFYsNP58Viw0wXxWLDThfFYsNNF8Viw09/jsWCni+OxYKdL4rFgp0vjsWCny+KxYKfL47Fgp3/EY8FOV8RjwU7/jMbK90n1ynjsAaleFY81pHp1PPaQVK+Jxx6R6rXx2GNSvS4ee0Kq18djT0n1hnjsGaneGI89J9V/xWMjpXpTPPaiVG+Ox16W6i3x2KtSvTUee12qt8Vjb0r19njsbaneEY+9K9U747H3pXpXPPahVO+Oxz6W6j3x2KdSvTce+1yq98VjX0r1/njsa6k+EI99K9UH47HvpdqIx8J7o0RjlfAu+1A8lkr14XisJNVH4rGKVB+Nx2pSfSwe65Lq4/FY+Or+iXhsQqk+GY9NLNWn4rHwBebT8djkUn0mHptSqs/GY1NL9bl4bFqpPh+PhWvxI+OxGaX6QjzWU6ovxmOzSPWleGw2qb4cj80h1Vfisbmk+mo8No9UX4vH5pPq6/HYAlJ9Ix5bSKpvxmOLSPWteGwxqb4djy0h1XfisaWk+m48toxU34vHlpPq+/HYClL9IB5bSaofxmOrSPWjeGw1qX4cj60h1U/isbWk+mk8to5UP4vH1pPq5/HYBlL9Ih7bSKpfxmObSPWreGwzqX4dj20h1W/isa2k+m08to1Uv4vHtpPq9/HYDlL9IR7bUao/xmM7SfWneGwXqY31z9jtKrUkHttdamk8tofUsnisn9RK8Vh/qZXjsYFSq8Rjg6RWjccGS60Wj+0ntXo8doDUuuKxg6Q2Xjx2iNTGj8cOk9oE8dgRUpswHjtSahPFY0dLbeJ47FipTfKLe9kqI3ucFT5/hI8b4dNF+DARPjuEjwrhk0H4IBDcH5gfVB8QH8weiB5EHgAevB14HTQd8BysHGgcJBzgG5wbWBsUG9AajBpIGgQawBl8GTgZ9BiwGGwYKBjkF6AXXBcYF9QWkBZMFggWxBWAFTwV+BS0FHAULBToE6QTYBMcE9gSlBJQEgwSyBGEEUAR/BC4EHQQMBDe+8NbfXhnD2/k4X07vE2Hd+XwJhzec8NbbHhHDW+g4f0yvD2Gd8Pw5hfe68JbW3gnC29c4X0qvC2Fd6HwphPeY8JbSngHCW8Y4f0hvB2Es3842YdzeziVhzN3OFGH83I4DYezbjjJhnNqOIWGM2Y4QYbzYTj9hbNdOLmFc1k4dYUzVTgxhfNQOO2Es0w4qYRzSDhlhDNEOCGE4z8c7uHoDgdzOHbDoRqOzHAghuMuHGbhqAoHUThmwiESjohwAIT9PezeYW8OO2/YV8OuGfbEsOOF/SzsVmEvCjtN2EfCLhH2gLDBC9/rVw3M3tv00X68g+9q/rm31dtgfq4/0PQP/1UHWpayNqllLlMvo4+ryqivygaEuQtcE6xN9pteEyz2z9/UJjPtAjXLfV1FdsHa5Lb6U7S42e4IvyK1KV2XaarWl2kqqU1d5D7LW40XxmpTmq531Uz3WtWm8dro09jOO4c7nXdqU5vOOzXTH2rVpjWddw5v+bwzameZtsh5Z7rf9LyTFjvvTNfsS4OPfvrpJ+M/FFib3mMpR+0o05uWsrqnaSlnMCxldL6YQWozFlxy2zlsptbPYTNJrWeBm2OCz6aynsVmtJ3FTH9uVJvZ6yw2s+0sdpTXWayn7Sxmur+rNovpLHZU62exsLvMUuQsNutvehbLip3FZrUdZbN57YKz2erP3vpRPrvU5nBdpjlbX6Y5pTZXkduhzXqaw3bemcPU4NxeG31u23nnOK/zzly2885cprU0j+m8c1zr552ws8xT5Lwz72963ikVO+/Ma3DJD1Y9zeexlKN2lPlMS2nU0/yGpYzOF/NLbYFCUqncZr3TdC7byW5Bn1tqTHeG1hZq8dqB8UBZ+De9E9j15pXaIi3f2VFbRGqLFjh4bw6/Ztq4tcUcrmclo86MYckXc70wsnjra3NxqS1RbG0uYVubSzp8Sv95bYYlX/JXfLhs8srUeN9cbanW1/lSUlu6DZZ8GY9jf9SesbRtz1jW4ZPPz3vGMmFuV0Iv1/o2X05qyxdbm8vb1uYKDp77eW2GJV/hVzCkyStL1r11xdbX+YpSW6nYBZOZrR9cFrB9cFnA1OLKXh9cxumGWKXFpRxu3dFXsrazsu0oXbX1fX2V8FtFPGjz/mo+HlzdJL1XTa+y3AL/i3+BPRs2+p9At/xb8IZ9fFj3v41eW8P2b6O3elCsHGY2/cP1tTWbb4Ai1dcc6nGoh4Ooarw2OtzrVLOgrf6IFusbD4W1TG+CpnO25fnXLV/GCecX07/uuoqp27U9NmJtrTCx7QS7jqG+4S8fa+v0/OU5JWnxnGKgwVDbTMXWabM1tWqY1uaEtU3rfd1WT9Kl4d0r1Hwl5m7TzrJaePtpci4LX9S9PHp7/u8XJ6P+z/DR5//1Rv+4vu2twLK/rWd72fo9C10jrNxtOwWe4nL0jtogtvqntnoKPuV/Tzv8458XYD3TLry+6RR8iulVpxr2v5avt9fWDq0M9XmX2uC3a75HofuTRjW/ge09YMNx9B6wYesH26g3U8sKt72Zrml61UYOqzu8PWw0tNVTenrqOHd3axOuNK4nXLGFCYebOWx269AWylvOIKtllrd8y+PGmn9sHPMtc+PRP25iRc9G4+gg3rjnr3RH+GJnTtMJaqHwNUhzd3xd1B2bjv5xs3Hnjk1tL9us2FNNqnPa3vdPc3HHqA1iq3+6jzs2NZ2/NzO9qZ5metXphv2vdXdsFFpxcsfmzduqmZqvtb4VrU/ZqjSsu/vctof4NEyrZguvdsTazjy2dsTUzpZe7TxkbWdeWzsPmdrZyqudh63tzGdr52FTO1t7tfOItZ35be08YmpnG692HrW2Y/sWpvKoqZ1tvdp5zNrOgrZ2HjO1s51XO49b21nI1s7jpna292rnCWs7C9vaecLUzg5e7TxpbWcRWztPmtrp5dXOU9Z2FrW185SpnR292nna2s5itnaeNrXT26udZ6ztLG5r5xlTOzt5tfOstZ0lbO08a2pnZ692nrO2s6StnedM7ezi1c7z1naWsrXzvKmdPl7tjLS2s7StnZGmdnb1aucFazvL2Np5wdTObl7tvGhtZ1lbOy+a2tndq52XrO0sZ2vnJVM7fb3aednazvK2dl42tbOHVzuvWNtZwdbOK6Z29vRq51VrOyva2nnV1E4/r3Zes7azkq2d10zt7OXVzuvWdla2tfO6qZ3+Xu28YW1nFVs7b5jaGeDVzpvWdla1tfOmqZ2BXu28ZW1nNVs7b5na2durnbet7axua+dtUzuDvNp5x9rOGrZ23jG1s49XO+9a21nT1s67pnYGe7XznrWdtWztvGdqZ1+vdt63tmO7Za7yvqmd/bza+cDazjq2dj4wtbO/VzsfWttZ19bOh6Z2DvBq5yNrO+vZ2vnI1M6BXu18bG1nfVs7H5vaOcirnU+s7Wxga+cTUzsHe7XzqbWdDW3tfGpq5xCvdj6ztrORrZ3PTO0c6tXO59Z2Nra187mpncO82vnC2s4mtna+MLVzuFc7X1rb2dTWzpemdo7waucrazub2dr5ytTOEK92vra2s7mtna9N7Rzp1c431na2sLXzjamdo7za+dbazpa2dr41tXO0VzvfWdvZytbOd6Z2jvFq53trO1vb2vne1M6xXu38YG1nG1s7P5jaOc6rnR+t7Wxra+dHUzu/82rnJ2s729na+cnUzvFO7VR7WNvZ3vavDfUwtfN7r3YSazs72NpJTO2c4NVOam2nl62d1NTOH7zayazt7GhrJzO1c6JXOyVrO71t7ZRM7Zzk1U7Z2s5OtnbKpnZO9mqnYm1nZ1s7FVM7Q73aqVrb2cXWTtXUzjCvdmrWdvrY2qmZ2hnu1U7d2s6utnbqpnZGeLXTZW1nN1s7XaZ2TvFqZzxrO7vb2hnP1I7pr7/H+CdNqiN7rCS1LaS2pdS2ktrWUttGattKbTupbS+1HaTWS2o7Sq231HaS2s5S20VqfaS2q9R2k9ruUusrtT2ktqfU+kltL6n1D1+dh6+bw1e04WvN8FVg+PosfOUUvqYJX22ErwPCJfRw2Tlcqg2XN8MlwXAZLVx6CpdrwiWOcFkgfJQOHz/DR7bwMSd8NAicDgQNbAvUCTwIb6nhbSicusPpLpwiwmEVdsWw+ULLhf/JjlF/lLW57e+hLX9dN/qhQ9VRj6k6TWqnt/zEpFELZdnDRi366baHT5xuavCPLTZ4588N/rHgSrct+UamJf9T65vmT1I7o+VNs3ILm+YMW4NnmBr8c+ubJjT4Z79Nk1o3zV9a3zR/kdqZLW+alVrYNGfaNs2Zpgb/2vqmCQ3+1W/TZNZN87fWN83fpHbWWEverFK2muXp1qa/lzf1dbbH+/motX+WdTOdbdvBzjK1c07rO1jYTOf47WAl6w52bus72LlSO6/lY3/FFo7982yb5jxTg+e3vmlCg+f7bZqyddNc0PqmuUBqF7b++MdRS76JdeNcaNs4F5pavKj1jRNavMhv41SsG+fvrW+cv0vt4iIPDrjEssLH2WP1Cp53L7ZuhUts+8/FplVzaev7T9gKl/rtP1Xr/nNZ6/vPZVK7vNjBvbF1K15u2ziXm1r8R+sbJ7T4jyKHyBWmnX+cPFhk1IuK7T9X2D7D/tOw2iwPsvlnz2KLufG4/NR35Thq5sqe0dGQ/Si1q6Kx0nRSuzoem0Fq18RjM0nt2nhsZqldF4/NKrXr47HZpXZDPDan1G6Mx+aW2r/isXmldlM8Nr/Ubo7HFpTaLfHYwlK7NR5bVGq3xWOLS+32eGxJqd0Rjy0ttTvjsWWldlc8trzU7o7HAubuicfC5+5747FVpXZfPLa61O6Px9aU2gPx2NpSezAeW1dqjXhsfalJPLah1B6KxzaW2sPx2KZSeyQe21xqj8Zj4arbY/FYuAb3eDwWrsg9EY+F63NPxmPhat1T8Vi4dvd0PBau5D0Tj4Xres/GY+Eq33PxWLjm93w8Fq4AjozHwvXAF+KxcHXwxXgsXCt8KR4LB+bL8Vi4jvhKPBauKr4aj4VrjK/FY+GK4+vxWLj++EY8Fq5GvhmPhWuTb8Vj4Url2/FYuG75TjwWrmK+G4+Fa5rvxWPhCuf78Vi43vlBPBaufn4Yj4VroR/FY+HK6Mfx2KlS+yQeO11qnxZ5W/zM8mnE8qjLcusPLDU/6vIz29vi5y3Wtz073vjgyS9cTPB5mNjW/JctUernf37hS6l9VeS69roGK65qfkj11y57jX3FfdP6ivtGat8W+AwU9uSvrLv81zZi2e47/a7lFkfZ6ftobJSdfojHgp1+jMeCnX6Kx2aWelwj2KmexGOzSz2Nx+aUehaPzS31Ujw2r9TL8dj8Uq/EYwtKvRqPLSz1Wjy2qNTr8djiUu+Kx5aU+njx2NJSHz8eW1bqE8Rjy0t9wnhsRalPFI+tLPWJ47FVpT5JPLa61CeNx9aU+mTx2NpSnzweW1fqU8Rj60t9ynhsQ6lPFY9tLPWp47FNpT5NPLa51KeNx7aU+nTx2NZSnz4e21bqM8Rj20t9xnisl9Rnisd6S71nPLaz1GeOx/pIfZZ4bDepzxqP9ZX6bPHYnlKfPR7bS+pzxGMDpD5nPLa31OeKx/aR+tzx2L5Snyce21/q88ZjB0p9vnjsYKnPH48dKvUF4rHDpb5gPDZE6gvFY0dJfeF47BipLxKPHSf1ReOx46W+WDx2gtQXj8dOlPoS8djJUl8yHhsm9aXisRFSXzoeO1Xqy8Rjp0t92WisfJ/Ul4vHHpD68vFYQ+orxGMPSX3FeOwRqa8Ujz0m9ZXjsSekvko89pTUV43HnpH6avHYc1JfPR4bKfU14rEXpb5mPPay1NeKx16V+trx2OtSXycee1Pq68Zjb0t9vXjsXamvH4+9L/UN4rEPpb5hPPax1DeKxz6V+sbx2OdS3yQe+1Lqm8ZjX0t9s3jsW6lvHo99L/Ut4rEfpb5lNFbpIfWt4rFU6lvHYyWpbxOPVaS+bTxWk/p28ViX1LePx8aX+g7x2IRS7xWPTSz1HeOxSaXeOx6bXOo7xWNTSn3neGxqqe8Sj00r9T7x2PRS3zUem1Hqu8VjPaW+ezw2i9T7xmOzSX2PeGwOqe8Zj80l9X7x2DxS3ysem0/q/eOxBaQ+IB5bSOoD47FFpL53PLaY1AfFY0tIfZ94bCmpD47HlpH6vvHYclLfLx5bQer7x2MrSf2AeGwVqR8Yj60m9YPisTWkfnA8tpbUD4nH1pH6ofHYelI/LB7bQOqHx2MbSf2IeGwTqQ+JxzaT+pHx2BZSPyoe20rqR8dj20j9mHhsO6kfG4/tIPXj4rEdpf67eGwnqR8fj+0i9d/HY7tK/YR4bHep/yEe20PqJ8Zj/aR+UjzWX+onx2MDpT40Hhsk9WHx2GCpD4/H9pP6iHjsAKmfEo8dJPVT47FDpH5aPHaY1E+Px46Q+h/jsSOl/qd47GipnxGPHSv1P//iXrbayB5nhc8f4eNG+HQRPkyEzw7ho0L4ZBA+CAT3B+YH1QfEB7MHogeRB4AHbwdeB00HPAcrBxoHCQf4BucG1gbFBrQGowaSBoEGcAZfBk4GPQYsBhsGCgb5BegF1wXGBbUFpAWTBYIFcQVgBU8FPgUtBRwFCwX6BOkE2ATHBLYEpQSUBIMEcgRhBFAEPwQuBB0EDIT3/vBWH97Zwxt5eN8Ob9PhXTm8CYf33PAWG95RwxtoeL8Mb4/h3TC8+YX3uvDWFt7JwhtXeJ8Kb0vhXSi86YT3mPCWEt5BwhtGeH8Ibwfh7B9O9uHcHk7l4cwdTtThvBxOw+GsG06y4ZwaTqHhjBlOkOF8GE5/4WwXTm7hXBZOXeFMFU5M4TwUTjvhLBNOKuEcEk4Z4QwRTgjh+A+Hezi6w8Ecjt1wqIYjMxyI4bgLh1k4qsJBFI6ZcIiEIyIcAGF/D7t32JvDzhv21bBrhj0x7HhhPwu7VdiLwk4T9pGwS4Q9IGzw4vf6fRE+0Jo+2o8/f4FLC4YrPeHTv+0fejf9oV79L5a5TL2MPq5qo74q+ybMXeCaYP3M3/SaYLF//qZ+pmkXqP/V5erSF2FiW/2/tbjZ7gi/IvWzXJfp7NaX6Wypn1PkPsu1jRfG6meZrnfVTfda1c/12ujn2s47Czudd+rnmM479XNMa+k803ln4ZbPO6N2lvOKnHfO/03PO2mx8875zb40+Oinn34y/kOB9QtcljLsKBfYltL0UIn6hYaljM4XF0r9ooJLbjuH/b31c9jfpX5xgZtjwsX4s61nsYtsZ7GLTC1e4nUWu8R2Flvc6yx2se0sZrq/q36p6Sy2eOtnsbC7XFrkLHbZb3oWy4qdxS6zHWWXe+2Cl9vq/6P1o/wfUr/CdZn+2foy/VPqVxa5Hdqspyts550rTA1e5bXRr7Kdd5b2Ou9caTvvXGlaS1ebzjtLt37eCTvL1UXOO9f8puedUrHzzjUGl/xg1dO1LksZdpRrbUtp09N1hqWMzhfXSf36YlJZx3oL55W2k90NPrfUmO4Mrd/Y4rUD44Hyr9/0TmDXm1fqN7V8Z0f9JqnfXGCZwsXKm00bt36Lw/WsZNSZMSz5La4XRm5tfW3eKvXbiq3N22xr83aHT+k/r82w5Lf/ig+XTV6ZGu+bq9/R+joP/7uzDZb8LpdjP+wZd9r2jLsdPvn8vGfcFeZ2JfQ9rW/ze6R+b7G1ea9tbd7n4Lmf12ZY8vt+BUOavLJk3Vvvb32d3y/1B4ox5BLrB5frbR9crje1+KDXB5dxuiEaLS7lcOuO/oC1nQdtR6m0vq83wm8V8aDN+w/5ePBhk/ROMb3q1JaPsuxHqT8S35EWvp1+NB4L31U/Fo+Fb64fj8fC99hPxGPhW+0n47HwHfdT8Vj4xvvpeCx8//1MPBa+DX82HgvfjT8Xj4Vvyp+Px8L35iPjsfAt+gvxWPhO/cV4LHzD/lI8Fr5vfzkeC9++vxKPhe/iX43Hwjfzr8Vj4Xv61+Ox8K39G/FY+A7/zXgsHIVvxWPhLPd2PBa+7X8nHgvf/b8bj20o9ffisY2l/n48tqnUP4jHNpf6h/HYllL/KB7bWuofx2PbSv2TeGx7qX8aj/WS+mfxWG+pfx6P7Sz1L+KxPlL/Mh7bTepfxWN9pf51PLan1L+Jx/aS+rfx2ACpfxeP7S31se5s30fqY93Zvq/Ux7qzfX+pj3Vn+4HSNdad7QdL11h3th8qXWPd2X64dI11Z/sQ6RrrzvajpGusO9uPka6x7mw/TrrGurP9eOka6872E6RrrDvbT5Suse5sP1m6xrqzfZh0jXVn+wjpGuvO9lOla6w720+XrvjO9vJ90hXf2V5+QLriO9vLDemK72wvPyRd8Z3t5UekK76zvfyYdMV3tpefkK74zvbyU9IV39lefka64jvby89JV3xne3mkdMV3tpdflK74zvbyy9IV39leflW64jvby69LV3xne/lN6YrvbC+/LV3xne3ld6UrvrO9/L50xXe2lz+UrvjO9vLH0hXf2V7+VLriO9vLn0tXfGd7+Uvpiu9sL38tXfGd7eVvpSu+s738vXTFd7aXf5Su+M72Sg/piu9sr6TSFd/ZXilJV3xne6UiXfGd7ZWadMV3tle6pCu+s70yvnTFd7ZXJpSu+M72ysTSFd/ZXplUuuI72yuTS1d8Z3tlSumK72yvTC1d8Z3tlWmlK76zvTK9dMV3tldmlK74zvZKT+mK72yvzCJd8Z3tldmkK76zvTKHdMV3tlfmkq74zvbKPNIV39lemU+64jvbKwtIV3xne2Uh6YrvbK8sIl3xne2VxaQrvrO9soR0xXe2V5aSrvjO9soy0hXf2V5ZTrriO9srK0hXfGd7ZSXpiu9sr6wiXfGd7ZXVpCu+s72yhnTFd7ZX1pKu+M72yjrSFd/ZXllPuuI72ysbSFd8Z3tlI+mK72yvbCJd8Z3tlc2kK76zvbKFdI11Z/tW0jXWne3bSNdYd7ZvJ11j3dm+g3SNdWf7jtI11p3tO0nXWHe27yJdY93Zvqt0jXVn++7SNdad7XtI11h3tveTrrHubO8vXWPd2T5Qusa6s32QdI11Z/tg6Rrrzvb9pGusO9sPkK6x7mw/SLrGurP9EOka6872w6RrrDvbj5Cuse5sP1K6xrqz/WjpGuvO9mOla0Drn896GD76rOHxRUFiKLymR+HUUHgtj8KWx6etXaRws0nXsXxUzp5stfQwQ+l1PVZkyVB4PY/CZUPh9T0KVwyFN/AoXDUU3tCjsOGBzMlGHoXrhsIbexTuMhTexKPweIbCm3oUHt9QeDOPwhMYCm/uUXhCQ+EtPApPZCi8pUfhiQ2Ft/IoPImh8NYehSc1FN7Go/BkhsLbehSe3FB4O4/CUxgKb+9ReEpD4R08Ck9lKNzLo/DUhsI7ehSexlC4t0fhaQ2Fd/IoPJ2h8M4ehac3FN7Fo/AMhsJ9PArPaCi8q0fhmQyFd/Mo3NNQeHePwjMbCvf1KDyLofAeHoVnNRTe06PwbIbC/Tw+7e/lMWl/j0siA0yXRJ7z2DqzGxZvYIH7SAwPu7PevPOF1G+wbJq9Pbb3II9J9/GYdLDHpPt6TLqfx6T7e0x6gMekB3pMepDHpAd7THqIx6SHekx6mMekh3tM2jjCZdYhLrMe6TLrUS6zHu0y6zEusx7rMutxLrP+zmXW411m/b3LrCe4zPoHl1lPdJn1JJdZT3aZdajLrMNcZh3uMusIl1lPcZn1VJdZT3OZ9XSXWf/oMuufXGY9w2XWP7vM+heXWc90mfWvLrP+zWXWs1xmPdtl1nNcZj3XZdbzXGY932XWC1xmvdBl1otcZv27y6wXu8x6icusl7rMepnLrJe7zPoPl1mvcJn1ny6zXuky61Uus17tMus1LrNe6zLrdS6zXu8y6w0us97oMuu/XGa9yWXWm11mvcVl1ltdZr3NZdbbXWa9w2XWO11mvctl1rtdZr3HZdZ7XWa9z2XW+11mfcBl1gddZm24zCousz7kMuvDLrM+4jLroy6zPuYy6+Musz7hMqvLH+80nnKZ9WmXWZ9xmfVZl1mfc5n1eZdZR7rM+oLLrC+6zPqSy6wvu8z6isusr7rM+prLrK+7zPqGy6xvusz6lsusb7vM+o7LrO+6zPqey6zvu8z6gcusH7rM+pHLrB+7zPqJy6yfusz6mcusn7vM+oXLrF+6zPqVy6xfu8z6jcus37rM+p3LrN+7zPqDy6w/usz6k8eskvTwmTbxmTb1mTbzmbbkM23ZZ9pKi9MOtz7IfgvTX6uEF15letRsMuppFs3n28KrnS2t7Vxta6dmamdLr3a2srZzja2duqmdrbza2drazrW2drpM7Wzt1c421naus7Uznqmdbbza2dbaju2p08n4pna29WpnO2s7N9jamcDUznZe7WxvbedGWzsTmtrZ3qudHazt/MvWzkSmdnbwaqeXtZ2bbO1MbGqnl1c7O1rbudnWziSmdnb0aqe3tZ1bbO1Mamqnt1c7O1nbudXWzmSmdnbyamdnazu32dqZ3NTOzl7t7GJt53ZbO1OY2tnFq50+1nbusLUzpamdPl7t7Gpt505bO1OZ2tnVq53drO3cZWtnalM7u3m1s7u1nbtt7Uxjamd3r3b6Wtu5x9bOtKZ2+nq1s4e1nXtt7UxnamcPr3b2tLZzn62d6U3t7OnVTj9rO/fb2pnB1E4/r3b2srbzgK2dGU3t7OXVTn9rOw/a2pnJ1E5/r3YGWNtp2NrpaWpngFc7A63tiK2dmU3tDPRqZ29rOw/Z2pnF1M7eXu0MsrbzsK2dWU3tDPJqZx9rO4/Y2pnN1M4+Xu0MtrbzqK2d2U3tDPZqZ19rO4/Z2pnD1M6+Xu3sZ23ncVs7c5ra2c+rnf2t7Txha2cuUzv7e7VzgLWdJ23tzG1q5wCvdg60tvOUrZ15TO0c6NXOQdZ2nra1M6+pnYO82jnY2s4ztnbmM7VzsFc7h1jbedbWzvymdg7xaudQazvP2dpZwNTOoV7tHGZt53lbOwua2jnMq53Dre2MtLWzkKmdw73aOcLazgu2dhY2tXOEVztDrO28aGtnEVM7Q7zaOdLazku2dhY1tXOkVztHWdt52dbOYqZ2jvJq52hrO6/Y2lnc1M7RXu0cY23nVVs7S5jaOcarnWOt7bxma2dJUzvHerVznLWd123tLGVq5zivdn5nbecNWztLm9r5nVc7x1vbedPWzjKmdo73auf31nbesrWzrKmd33u1c4K1nbdt7SxnaucEr3b+YG3nHVs7y5va+YNXOyda23nX1s4KpnZO9GrnJGs779naWdHUzkle7Zxsbed9Wzsrmdo52audodZ2PrC1s7KpnaFe7QyztvOhrZ1VTO0M82pnuLWdj2ztrGpqZ7hXOyOs7Xxsa2c1UzsjvNo5xdrOJ7Z2Vje1c4pXO6da2/nU1s4apnZOLdCOaSn/aXlh/Uap/8v2h0aF/j3o5tOuZVlL9Ud8iq9tKv6oT3HTvwxdf8yn+Lqm4o/7FF/PVPwJn+Lrm4o/6VN8A1Pxp3yKb2gq/rRP8Y1MxZ/xKb6xqfizPsU3MRV/zqf4pqbiz/sU38xUfKRP8c1NxV/wKb6FqfiLPsW3NBV/yaf4VqbiL/sU39pU/BWf4tuYir/qU3xbU/HXfIpvZyr+uk/x7U3F3/ApvoOp+Js+xXuZir/lU3xHU/G3fYr3NhV/x6f4Tqbi7/oU39lU/D2f4ruYir/vU7yPqfgHPsV3NRX/0Kf4bqbiH/kU391U/GOf4n1NxT/xKb6HqfinPsX3NBX/zKd4P1Pxz32K72Uq/oVP8f6m4l/6FDf9u9j1r3yKDzQV/9qn+N6m4t/4FB9kKv6tT/F9TMW/8yk+2FT8e5/i+5qK/+BTfD9T8R99iu9vKv6TT/EDLMW7evgUP9BUPPEpfpCpeOpT/GBT8cyn+CGm4iWf4oeaipd9ih9mKl7xKX64qXjVp/gRpuI1n+JDTMXrPsWPNBXv8il+lKn4eD7FjzYVH9+n+DGm4hP4FD/WVHxCn+LHmYpP5FP8d6biE/sUP95UfBKf4r83FZ/Up/gJpuKT+RT/g6n45D7FTzQVn8Kn+Emm4lP6FD/ZVHwqn+JDTcWn9ik+zFR8Gp/iw03Fp/UpPsJUfDqf4qeYik/vU/xUU/EZfIqfZio+o0/x003FZ/Ip/kdT8Z4+xf9kKj6zT/EzTMVn8Sn+Z1PxWX2K/8VUfDaf4meais/uU/yvpuJz+BT/m6n4nD7FzzIVn8un+Nmm4nP7FD/HVHwen+LnmorP61P8PFPx+XyKn28qPr9P8QtMxRfwKX6hqfiCPsUvMhVfyKf4303FF/YpfrGp+CI+xS8xFV/Up/ilpuKL+RS/zFR8cZ/il5uKL+FT/B+m4kv6FL/CVHwpn+L/NBVf2qf4labiy/gUv8pUfFmf4lebii/nU/waU/HlfYpfayq+gk/x60zFV/Qpfr2p+Eo+xW8wFV/Zp/iNpuKr+BT/l6n4qj7FbzIVX82n+M2m4qv7FL/FVHwNn+K3moo7/V3qbabia/kUv91UfG2f4neYiq/jU/xOU/F1fYrfZSq+nk/xu03F1/cpfo+p+AY+xe81Fd/Qp/h9puIb+RS/31R8Y5/iD5iKb+JT/EFT8U19ijdMxTfzKS6m4pv7FH/IVHwLn+IPm4pv6VP8EVPxrXyKP2oqvrVP8cdMxbfxKf64qfi2PsWfMBXfzqf4k6bi2/sUf8pUfAef4k+bivfyKf6MqfiOPsWfNRXv7VP8OVPxnXyKP28qvrNP8ZGm4rv4FH/BVLyPT/EXTcV39Sn+kqn4bj7FXzYV392n+Cum4n19ir9qKr6HT/HXTMX39Cn+uql4P5/ib5iK7+VT/E1T8f4+xd8yFS/yT7A1nbW2ttQ2ND3I7iGpP2x7kF3Lz6SwTfuOz7Tv+kz7ns+07/tM+4HPtB/6TPuRz7Qf+0z7ic+0n/pM+5nPtJ/7TPuFz7Rf+kz7lc+0X/tM+43PtN/6TPudz7Tf+0z7g8+0P/pM+5PLtGkPn2kTn2lTn2kzn2lLPtOWfaat+Exb9Zm25jNt3WfaLp9px/OZdnyfaSfwmXZCn2kn8pl2Yp9pJ/GZdlKfaSfzmXZyn2mn8Jl2Sp9pp/KZdmqfaafxmXZan2mn85l2ep9pZ/CZdkafaWfymbanz7Qz+0w7i8+0s/pMO5vPtLP7TDuHz7Rz+kw7l8+0c/tMO4/PtPP6TDufz7Tz+0y7gM+0C/pMu5DPtAv7TLuIz7SL+ky7mM+0i/tMu4TPtEv6TLuUz7RL+0y7jM+0y/pMu5zPtMv7TLuCz7Qr+ky7ks+0K/tMu4rPtKv6TLuaz7Sr+0y7hs+0a/pMu5bPtGv7TLuOz7Tr+ky7ns+06/tMu4HPtBv6TLuRz7Qb+0y7ic+0m/pMu5nPtJv7TLuFz7Rb+ky7lc+0W/tMu43PtNv6TLudz7Tb+0y7g8+0vXym3dFn2t4+0+7kM+3OPtPu4jNtH59pd/WZdjefaXf3mbavz7R7+Ey7p8+0/Xym3ctn2v4+0w7wmXagz7R7+0w7yGfafXymHewz7b4+0+7nM+3+PtMe4DPtgT7THuQz7cE+0x7iM+2hPtMe5jPt4T7THuEz7RCfaY/0mfYon2mP9pn2GJ9pj/WZ9jifaX/nM+3xPtP+3mfaE3ym/YPPtCf6THuSz7Qn+0w71GfaYT7TDveZdoTPtKf4THuqz7Sn+Ux7us+0f/SZ9k8+057hM+2ffab9i8+0Z/pM+1efaf/mM+1ZPtOe7TPtOT7Tnusz7Xk+057vM+0FPtNe6DPtRT7T/t1n2ot9pr3EZ9pLfaa9zGfay32m/YfPtFf4TPtPn2mv9Jn2Kp9pr/aZ9hqfaa/1mfY6n2mv95n2Bp9pb/SZ9l8+097kM+3NPtPe4jPtrT7T3uYz7e0+097hM+2dPtPe5TPt3T7T3uMz7b0+097nM+39PtM+4DPtgz7TNnymFZ9pH/KZ9mGfaR/xmfZRn2kf85n2cZ9pn/CZ9kmfaZ/ymfZpn2mf8Zn2WZ9pn/OZ9nmfaUf6TPuCz7Qv+kz7ks+0L/tM+4rPtK/6TPuaz7Sv+0z7hs+0b/pM+5bPtD7Pv019nn+b+jz/NvV5/m3q8/zb1Of5t6nP829Tn+ffpj7Pv019nn+bfuozrc/zb1Of59+mPs+/TX2ef5v6PP829Xn+berz/NvU5/m3qc/zb1Of59+mPs+/TX2ef5v6PP8283n+bebz/NvM5/m3mc/zbzOf599mPs+/zXyef5v5PP8283n+bebz/NvM5/m3mc/zbzOf599mPs+/zXyef5v5PP8283n+bebz/NtsUp9pfZ5/m/k8/zbzef5t5vP828zn+beZz/NvM5/n32Y+z7/NfJ5/m/k8/zbzef5t5vP828zn+beZz/NvM5/n32Y+z7/NfJ5/m/k8/zbzef5t5vP828zn+beZz/NvM5/n32Y+z7/NfJ5/m/k8/zbzef5t5vP828zn+beZz/NvM5/n32aL+Ezr8/zbzOf5t5nP828zn+ffZj7Pv818nn+b+Tz/NvN5/m3m8/zbzOf5t5nP828zn+ffZj7Pv818nn+b+Tz/NvN5/m3m8/zbzOf5t5nP828zn+ffZj7Pv818nn+b+Tz/NvN5/m3m8/zbzOf5t5nP828zn+ffZj7Pv818nn+b+Tz/NtvEZ1qf599mPs+/zXyef5v5PP8283n+bebz/NvM5/m3mc/zbzOf599mPs+/zXyef5v5PP8283n+bebz/NvM5/m3mc/zbzOf599mPs+/zXyef5v5PP8283n+bebz/NvM5/m3mc/zbzOf599mPs+/zXyef5v5PP8283n+bebz/NvM5/m32SCfaX2ef5v5PP8283n+bebz/NvM5/m3mc/zbzOf599mPs+/zXyef5v5PP8283n+bebz/NvM5/m3mc/zbzOf599mPs+/zXyef5v5PP8283n+bebz/NvM5/m3mc/zbzOf599mPs+/zXyef5u1/Pzb4WHahXbZYNArC5819/UbrX7tkCFbbT/Xom+vdeANA4et+soXIz4OvzGHqbTpGbnr99lrwKAD1+7fd/CI+shsrTXWXGvtddZdb/0NNtxo40023WzzLbbcautttt1u+x167dh7p5136bPrbrv33WPPfnv1HzBw70H7DN53v/0POPCggw859LDDG0c0hjSObBzVOLpxTOPYxnGN3zWOb/y+cULjD40TGyc1Tm4MbQxrDG+MaJzSOLVxWuP0xh8bf2qc0fhz4y+NMxt/bfytcVbj7MY5jXMb5zXOb1zQuLBxUePvjYsblzQubVzWuLzxj8YVjX82rmxc1bi6cU3j2sZ1jesbNzRubPyrcVPj5sYtjVsbtzVub9zRuLNxV+Puxj2Nexv3Ne5vPNB4sNFoSOOhxsONRxqPNh5rPN54ovFk46nG041nGs82nms83xjZeKHxYuOlxsuNVxqvNl5rvN54o/Fm463G2413Gu823mu83/ig8WHjo8bHjU8anzY+a3ze+KLxZeOrxteNbxrfNr5rfN/4ofFj4ydJekiSSJJKkklSkqQsSUWSqiQ1SeqSdEkyniTjSzKBJBNKMpEkE0syiSSTSjKZJJNLMoUkU0oylSRTSzKNJNNKMp0k00sygyQzSjKTJD0lmVmSWSSZVZLZJJldkjkkmVOSuSSZW5J5JJlXkvkkmV+SBSRZUJKFJFlYkkUkWVSSxSRZXJIlJFlSkqUkWVqSZSRZVpLlJFlekhUkWVGSlSRZWZJVJFlVktUkWV2SNSRZU5K1JFlbknUkWVeS9SRZX5INJNlQko0k2ViSTSTZVJLNJNlcki0k2VKSrSTZWpJtJNlWku0k2V6SHSTpJcmOkvSWZCdJdpZkF0n6SLKrJLtJsrskfSXZQ5I9JeknyV6S9JdkgCQDJdlbkkGS7CPJYEn2lWQ/SfaX5ABJDpTkIEkOluQQSQ6V5DBJDpfkCEmGSHKkJEdJcrQkx0hyrCTHSfI7SY6X5PeSnCDJHyQ5UZKTJDlZkqGSDJNkuCQjJDlFklMlOU2S0yX5oyR/kuQMSf4syV8kOVOSv0ryN0nOkuRsSc6R5FxJzpPkfEkukORCSS6S5O+SXCzJJZJcKsllklwuyT8kuUKSf0pypSRXSXK1JNdIcq0k10lyvSQ3SHKjJP+S5CZJbpbkFkluleQ2SW6X5A5J7pTkLknuluQeSe6V5D5J7pfkAUkelKQhiUjykCQPS/KIJI9K8pgkj0vyhCRPSvKUJE9L8owkz0rynCTPSzJSkhckeVGSlyR5WZJXJHlVktckeV2SNyR5U5K3JHlbknckeVeS9yR5X5IPJPlQko8k+ViSTyT5VJLPJPlcki8k+VKSryT5WpJvJPlWku8k+V6SHyT5UZKfJO0haSJpKmkmaUnSsqQVSauS1iStS9ol6XiSji/pBJJOKOlEkk4s6SSSTirpZJJOLukUkk4p6VSSTi3pNJJOK+l0kk4v6QySzijpTJL2lHRmSWeRdFZJZ5N0dknnkHROSeeSdG5J55F0Xknnk3R+SReQdEFJF5J0YUkXkXRRSReTdHFJl5B0SUmXknRpSZeRdFlJl5N0eUlXkHRFSVeSdGVJV5F0VUlXk3R1SdeQdE1J15J0bUnXkXRdSdeTdH1JN5B0Q0k3knRjSTeRdFNJN5N0c0m3kHRLSbeSdGtJt5F0W0m3k3R7SXeQtJekO0raW9KdJN1Z0l0k7SPprpLuJunukvaVdA9J95S0n6R7Sdpf0gGSDpR0b0kHSbqPpIMl3VfS/STdX9IDJD1Q0oMkPVjSQyQ9VNLDJD1c0iMkHSLpkZIeJenRkh4j6bGSHifp7yQ9XtLfS3qCpH+Q9ERJT5L0ZEmHSjpM0uGSjpD0FElPlfQ0SU+X9I+S/knSMyT9s6R/kfRMSf8q6d8kPUvSsyU9R9JzJT1P0vMlvUDSCyW9SNK/S3qxpJdIeqmkl0l6uaT/kPQKSf8p6ZWSXiXp1ZJeI+m1kl4n6fWS3iDpjZL+S9KbJL1Z0lskvVXS2yS9XdI7JL1T0rskvVvSeyS9V9L7JL1f0gckfVDShqQi6UOSPizpI5I+Kuljkj4u6ROSPinpU5I+Lekzkj4r6XOSPi/pSElfkPRFSV+S9GVJX5H0VUlfk/R1Sd+Q9E1J35L0bUnfkfRdSd+T9H1JP5D0Q0k/kvRjST+R9FNJP5P0c0m/kPRLSb+S9GtJv5H0W0m/k/R7SX+Q9EdJf5Ksh2ThXTeVLJOsJFlZsopkVclqktUl65JsPMnGl2wCySaUbCLJJpZsEskmlWwyySaXbArJppRsKsmmlmwayaaVbDrJppdsBslmlGwmyXpKNrNks0g2q2SzSTa7ZHNINqdkc0k2t2TzSDavZPNJNr9kC0i2oGQLSbawZItItqhki0m2uGRLSLakZEtJtrRky0i2rGTLSba8ZCtItqJkK0m2smSrSLaqZKtJtrpka0i2Zvh6P3wVH742D19xh6+jw1fH4Wve8JVs+Po0fNUZvpYMXyGGr/vCV3Pha7TwlVf4eip8lRS+9glf0YSvU8JXH+FrivCVQrj8Hy7Vh8vq4RJ4uFwdLi2Hy8Dhkm24vBouhYbLluESY7gcGC7dhcts4ZJYuHwVLjWFy0LhEk643BIujYTLGOGSQ7g8ED7Kh4/d4SNy+DgbPnqGj4nhI134+BU+KoWPNeEjSPi4EGgfGB7IHHgbKBrYGIgXOBZYdPEmfQbvO6j/ar0H9x7ZY40eSZqVypVqrd413vgTTDjRxJNMOtnkU0w51dTTTDvd9DPMOFPPmWeZdbbZ55hzrrnnmXe++RdYcKGFF1l0scWXWHKppZdZdrnlV1hxpZVXWXW11YcOHZk0hg85b+Wd+w7acPjDj1Tf+/zBe3YbOvQ/QxuPPbTV2EPbDX/45Ofee/HorpM+/O/QjmO/aq+xhwYPf/iqxedbZoKt5jjiv0P7jT3XoWO/qnH88IcP7bX9y5fO/mpYF0sPuXj1AwYO6rPPPn0H9B8xtPk/L7B2q7/Qv9Vf2KXVX+jT6i8c0Oov9Gz1Fwa0+gv7tvoLg9uvh13dF2mn9tsO/rv3Pq3+wnzu26F3q78wyP0XWl6kA93X0u7uPezj3kPLFfq2+gsHuZ/uW256qfY74nYa0vlvKH3b79zahnTY//8HZ42DW/2FQ1v9heSXv2C7MGt4at9/kXwiSAbJIDk/IBkkKwHJIFkJSAbJSkByRyJ5GEgGySA5PyAZJCsBySBZCUgGyUpAckci+VSQDJJBcn5AMkhWApJBshKQDJKVgOSORPIZIBkkg+T8gGSQrAQkg2QlIBkkKwHJHYnkv4JkkAyS8wOSQbISkAySlYBkkKwEJHckks8BySAZJOcHJINkJSAZJCsBySBZCUjuSCRfCJJBMkjOD0gGyUpAMkhWApJBshKQ3JFIvmTshy43LgXOwBk45wc4A2clwBk4KwHOwFkJcP4t4Nz8F7pJfDn8hb/wNz/wF/4qgb/wVwn8hb9K4G+b8fcK+At/4W9+4C/8VQJ/4a8S+At/lcDfNuPvlfAX/sLf/MBf+KsE/sJfJfAX/iqBv23G36vhL/yFv/mBv/BXCfyFv0rgL/xVAn/bjL/Xwl/4C3/zA3/hrxL4C3+VwF/4qwT+thl/r4e/8Bf+5gf+wl8l8Bf+KoG/8FcJ/G0z/t4If+Ev/M0P/IW/SuAv/FUCf+GvEvjbZvy9Cf7CX/ibH/gLf5XAX/irBP7CXyXwtz34m/yXv7fAX/gLf/MDf+GvEvgLf5XAX/irBP62GX9vg7/wF/7mB/7CXyXwF/4qgb/wVwn8bTP+3gF/4S/8zQ/8hb9K4C/8VQJ/4a8S+Ntm/L0L/sJf+Jsf+At/lcBf+KsE/sJfJfC3zfh7D/yFv/A3P/AX/iqBv/BXCfyFv0rgb5vx9z74C3/hb37gL/xVAn/hrxL4C3+VwN824+8D8Bf+wt/8wF/4qwT+wl8l8Bf+KoG/bcbfBvyFv/A3P/AX/iqBv/BXCfyFv0rgb3vwN/0vfx+Cv/AX/uYH/sJfJfAX/iqBv/BXCfxtM/4+An/hL/zND/yFv0rgL/xVAn/hrxL422b8fQz+wl/4mx/4C3+VwF/4qwT+wl8l8LfN+PsE/IW/8Dc/8Bf+KoG/8FcJ/IW/SuBvm/H3KfgLf+FvfuAv/FUCf+GvEvgLf5XA3zbj7zPwF/7C3/zAX/irBP7CXyXwF/4qgb9txt/n4C/8hb/5gb/wVwn8hb9K4C/8VQJ/24y/I+Ev/IW/+YG/8FcJ/IW/SuAv/FUCf9uDv9l/+fsi/IW/8Dc/8Bf+KoG/8FcJ/IW/SuBvm/H3ZfgLf+FvfuAv/FUCf+GvEvgLf5XA3zbj76vwF/7C3/zAX/irBP7CXyXwF/4qgb9txt/X4S/8hb/5gb/wVwn8hb9K4C/8VQJ/24y/b8Jf+At/8wN/4a8S+At/lcBf+KsE/rYZf9+Gv/AX/uYH/sJfJfAX/iqBv/BXCfxtM/6+C3/hL/zND/yFv0rgL/xVAn/hrxL422b8fR/+wl/4mx/4C3+VwF/4qwT+wl8l8Lc9+Fv6L38/hL/wF/7mB/7CXyXwF/4qgb/wVwn8bTP+fgx/4S/8zQ/8hb9K4C/8VQJ/4a8S+Ntm/P0U/sJf+Jsf+At/lcBf+KsE/sJfJfC3zfj7OfyFv/A3P/AX/iqBv/BXCfyFv0rgb5vx90v4C3/hb37gL/xVAn/hrxL4C3+VwN824+/X8Bf+wt/8wF/4qwT+wl8l8Bf+KoG/bcbfb+Ev/IW/+YG/8FcJ/IW/SuAv/FUCf9uMv9/DX/gLf/MDf+GvEvgLf5XAX/irBP62B3/L/+Xvj/AX/sLf/MBf+KsE/sJfJfAX/iqBv+3FX0l64F/8i3/zg3/xrxL8i3+V4F/8qwT/tpt/U/yLf/FvfvAv/lWCf/GvEvyLf5Xg33bzbwn/4l/8mx/8i3+V4F/8qwT/4l8l+Lfd/FvBv/gX/+YH/+JfJfgX/yrBv/hXCf5tN//W8C/+xb/5wb/4Vwn+xb9K8C/+VYJ/282/XfgX/+Lf/OBf/KsE/+JfJfgX/yrBv+3m3/HxL/7Fv/nBv/hXCf7Fv0rwL/5Vgn/bw7+Vbv9OiH/xL/7ND/7Fv0rwL/5Vgn/xrxL8227+nRj/4l/8mx/8i3+V4F/8qwT/4l8l+Lfd/Dsp/sW/+Dc/+Bf/KsG/+FcJ/sW/SvBvu/l3cvyLf/FvfvAv/lWCf/GvEvyLf5Xg33bz75T4F//i3/zgX/yrBP/iXyX4F/8qwb/t5t+p8S/+xb/5wb/4Vwn+xb9K8C/+VYJ/282/0+Jf/It/84N/8a8S/It/leBf/KsE/7abf6fHv/gX/+YH/+JfJfgX/yrBv/hXCf5tD/9Wu/07I/7Fv/g3P/gX/yrBv/hXCf7Fv0rwb7v5tyf+xb/4Nz/4F/8qwb/4Vwn+xb9K8G+7+XcW/It/8W9+8C/+VYJ/8a8S/It/leDfdvPvbPgX/+Lf/OBf/KsE/+JfJfgX/yrBv+3m3znwL/7Fv/nBv/hXCf7Fv0rwL/5Vgn/bzb9z4V/8i3/zg3/xrxL8i3+V4F/8qwT/tpt/58G/+Bf/5gf/4l8l+Bf/KsG/+FcJ/m03/y42/OF7bn71xi2vXOWOkT2Wwb/4dxz1gH/xrxL8i3+VtKF/F231FxYBzIA5P4C5HcE8bETzX5DsRcneHza86St7hJc1f1G3v9fC3/gbf+cHf+NvJfgbfyvB3/hbCf7ubH83n3m0rLdB1sgaWecHWSNrJcgaWStB1shaCbL+f0fWBw9/+JHqe58/eM9uQ4d2Dx45/OGrFp9vmQm2muOI0YPH5L3yuOEPn/zcey8e3XXSh6MHT8r79S/yfv2rvMGvuY0b7IP9/IB9sK8E7P+/gn1u48buSrB7O9rd8AujSf4N/sW/+Dc/+Bf/KsG/+FcJ/sW/SvBvu/n3W/yLf/FvfvAv/lWCf/GvEvyLf5Xg33bz73f4F//i3/zgX/yrBP/iXyX4F/8qwb/t5t/v8S/+xb/5wb/4Vwn+xb9K8C/+VYJ/282/P+Bf/It/84N/8a8S/It/leBf/KsE/7abf3/Ev/gX/+YH/+JfJfgX/yrBv/hXCf5tN//+hH/xL/7ND/7Fv0rwL/5Vgn/xrxL822b+TXvgX/yLf/ODf/GvEvyLf5XgX/yrBP+2h3+Tbv8m+Bf/4t/84F/8qwT/4l8l+Bf/KsG/7ebfFP/iX/ybH/yLf5XgX/yrBP/iXyX4t938m+Ff/It/84N/8a8S/It/leBf/KsE/7abf0v4F//i3/zgX/yrBP/iXyX4F/8qwb/t5t8y/sW/+Dc/+Bf/KsG/+FcJ/sW/SvBvu/m3gn/xL/7ND/7Fv0rwL/5Vgn/xrxL8227+reJf/It/84N/8a8S/It/leBf/KsE/7abf2v4F//i3/zgX/yrBP/iXyX4F/8qwb/t4d+02791/It/8W9+8C/+VYJ/8a8S/It/leDfdvNvF/7Fv/g3P/gX/yrBv/hXCf7Fv0rwb7v5dzz8i3/xb37wL/5Vgn/xrxL8i3+V4N928+/4+Bf/4t/84F/8qwT/4l8l+Bf/KsG/7ebfCfAv/sW/+cG/+FcJ/sW/SvAv/lWCf9vNvxPiX/yLf/ODf/GvEvyLf5XgX/yrBP+2m38nwr/4F//mB//iXyX4F/8qwb/4Vwn+bTf/Tox/8S/+zQ/+xb9K8C/+VYJ/8a8S/Nse/s26/TsJ/sW/+Dc/+Bf/KsG/+FcJ/sW/SvBvu/l3UvyLf/FvfvAv/lWCf/GvEvyLf5Xg33bz72T4F//i3/zgX/yrBP/iXyX4F/8qwb/t5t/J8S/+xb/5wb/4Vwn+xb9K8C/+VYJ/282/U+Bf/It/84N/8a8S/It/leBf/KsE/7abf6fEv/gX/+YH/+JfJfgX/yrBv/hXCf5tN/9OhX/xL/7ND/7Fv0rwL/5Vgn/xrxL8227+nRr/4l/8mx/8i3+V4F/8qwT/4l8l+Lc9/Fvq9u80+Bf/4t/84F/8qwT/4l8l+Bf/KsG/7ebfafEv/sW/+cG/+FcJ/sW/SvAv/lWCf9vNv9PhX/yLf/ODf/GvEvyLf5XgX/yrBP+2m3+nx7/4F//mB//iXyX4F/8qwb/4Vwn+bTf/zoB/8S/+zQ/+xb9K8C/+VYJ/8a8S/Ntu/p0R/+Jf/Jsf/It/leBf/KsE/+JfJfi33fw7E/7Fv/g3P/gX/yrBv/hXCf7Fv0rwb7v5tyf+xb/4Nz/4F/8qwb/4Vwn+xb9K8G97+Lfc7d+Z8S/+xb/5wb/4Vwn+xb9K8C/+VYJ/282/s+Bf/It/84N/8a8S/It/leBf/KsE/7abf2fFv/gX/+YH/+JfJfgX/yrBv/hXCf5tN//Ohn/xL/7ND/7Fv0rwL/5Vgn/xrxL8227+nR3/4l/8mx/8i3+V4F/8qwT/4l8l+Lfd/DsH/sW/+Dc/+Bf/KsG/+FcJ/sW/SvBvu/l3TvyLf/FvfvAv/lWCf/GvEvyLf5Xg33bz71z4F//i3/zgX/yrBP/iXyX4F/8qwb/t4d9Kt3/nxr/4F//mB//iXyX4F/8qwb/4Vwn+bTf/zoN/8S/+zQ/+xb9K8C/+VYJ/8a8S/Ntu/p0X/+Jf/Jsf/It/leBf/KsE/+JfJfi33fw7H/7Fv/g3P/gX/yrBv/hXCf7Fv0rwb7v5d378i3/xb37wL/5Vgn/xrxL8i3+V4N928+8C+Bf/4t/84F/8qwT/4l8l+Bf/KsG/7ebfBfEv/sW/+cG/+FcJ/sW/SvAv/lWCf9vNvwvhX/yLf/ODf/GvEvyLf5XgX/yrBP+2h3+r3f5dGP/iX/ybH/yLf5XgX/yrBP/iXyX4t938uwj+xb/4Nz/4F/8qwb/4Vwn+xb9K8G+7+XdR/It/8W9+8C/+VYJ/8a8S/It/leDfdvPvYvgX/+Lf/OBf/KsE/+JfJfgX/yrBv+3m38XxL/7Fv/nBv/hXCf7Fv0rwL/5Vgn/bzb9L4F/8i3/zg3/xrxL8i3+V4F/8qwT/tpt/l8S/+Bf/5gf/4l8l+Bf/KsG/+FcJ/m0z/2YnDH/4kep7nz94z25Dh3YPnjL84asWn2+ZCbaa44jRg6fnvfJPwx8++bn3Xjy666QPRw+ek/frbwJtoA208wO0gbYSoA20lQBtoK0EaP8G0B4+ovkvSGmklJe3vLBygVQubL4IPf4r6lI9B+Sl8fIGx8fe2Bt75wd7Y28l2Bt7K8He2FsJ9v4N7G34hdFSngD/4l/8mx/8i3+V4F/8qwT/4l8l+Lfd/Dsh/sW/+Dc/+Bf/KsG/+FcJ/sW/SvBvu/l3IvyLf/FvfvAv/lWCf/GvEvyLf5Xg33bz78T4F//i3/zgX/yrBP/iXyX4F/8qwb/t5t9J8C/+xb/5wb/4Vwn+xb9K8C/+VYJ/282/k+Jf/It/84N/8a8S/It/leBf/KsE/7abfyfDv/gX/+YH/+JfJfgX/yrBv/hXCf5tN/9Ojn/xL/7ND/7Fv0rwL/5Vgn/xrxL82x7+Tbr9OwX+xb/4Nz/4F/8qwb/4Vwn+xb9K8G+7+XdK/It/8W9+8C/+VYJ/8a8S/It/leDfdvPvVPgX/+Lf/OBf/KsE/+JfJfgX/yrBv+3m36nxL/7Fv/nBv/hXCf7Fv0rwL/5Vgn/bzb/T4F/8i3/zg3/xrxL8i3+V4F/8qwT/tpt/p8W/+Bf/5gf/4l8l+Bf/KsG/+FcJ/m03/06Hf/Ev/s0P/sW/SvAv/lWCf/GvEvzbbv6dHv/iX/ybH/yLf5XgX/yrBP/iXyX4tz38m3b7dwb8i3/xb37wL/5Vgn/xrxL8i3+V4N928++M+Bf/4t/84F/8qwT/4l8l+Bf/KsG/7ebfmfAv/sW/+cG/+FcJ/sW/SvAv/lWCf9vNvz3xL/7Fv/nBv/hXCf7Fv0rwL/5Vgn/bzb8z41/8i3/zg3/xrxL8i3+V4F/8qwT/tpt/Z8G/+Bf/5gf/4l8l+Bf/KsG/+FcJ/m03/86Kf/Ev/s0P/sW/SvAv/lWCf/GvEvzbbv6dDf/iX/ybH/yLf5XgX/yrBP/iXyX4tz38m3X7d3b8i3/xb37wL/5Vgn/xrxL8i3+V4N928+8c+Bf/4t/84F/8qwT/4l8l+Bf/KsG/7ebfOfEv/sW/+cG/+FcJ/sW/SvAv/lWCf9vNv3PhX/yLf/ODf/GvEvyLf5XgX/yrBP+2m3/nxr/4F//mB//iXyX4F/8qwb/4Vwn+bTf/zoN/8S/+zQ/+xb9K8C/+VYJ/8a8S/Ntu/p0X/+Jf/Jsf/It/leBf/KsE/+JfJfi33fw7H/7Fv/g3P/gX/yrBv/hXCf7Fv0rwb3v4t9Tt3/nxL/7Fv/nBv/hXCf7Fv0rwL/5Vgn/bzb8L4F/8i3/zg3/xrxL8i3+V4F/8qwT/tpt/F8S/+Bf/5gf/4l8l+Bf/KsG/+FcJ/m03/y6Ef/Ev/s0P/sW/SvAv/lWCf/GvEvzbbv5dGP/iX/ybH/yLf5XgX/yrBP/iXyX4t938uwj+xb/4Nz/4F/8qwb/4Vwn+xb9K8G+7+XdR/It/8W9+8C/+VYJ/8a8S/It/leDfdvPvYvgX/+Lf/OBf/KsE/+JfJfgX/yrBv+3h33K3fxfHv/gX/+YH/+JfJfgX/yrBv/hXCf5tN/8ugX/xL/7ND/7Fv0rwL/5Vgn/xrxL8227+XRL/4l/8mx/8i3+V4F/8qwT/4l8l+Lfd/LsU/sW/+Dc/+Bf/KsG/+FcJ/sW/SvBvu/l3afyLf/FvfvAv/lWCf/GvEvyLf5Xg33bz7zL4F//i3/zgX/yrBP/iXyX4F/8qwb/t5t9l8S/+xb/5wb/4Vwn+xb9K8C/+VYJ/282/y+Ff/It/84N/8a8S/It/leBf/KsE/7aHfyvd/l0e/+Jf/Jsf/It/leBf/KsE/+JfJfi33fy7Av7Fv/g3P/gX/yrBv/hXCf7Fv0rwb7v5d0X8i3/xb37wL/5Vgn/xrxL8i3+V4N928+9K+Bf/4t/84F/8qwT/4l8l+Bf/KsG/7ebflfEv/sW/+cG/+FcJ/sW/SvAv/lWCf9vNv6vgX/yLf/ODf/GvEvyLf5XgX/yrBP+2m39Xxb/4F//mB//iXyX4F/8qwb/4Vwn+bTf/roZ/8S/+zQ/+xb9K8C/+VYJ/8a8S/Nse/q12+3d1/It/8W9+8C/+VYJ/8a8S/It/leDfdvPvGvgX/+Lf/OBf/KsE/+JfJfgX/yrBv+3m3zXxL/7Fv/nBv/hXCf7Fv0rwL/5Vgn/bzb9r4V/8i3/zg3/xrxL8i3+V4F/8qwT/tpt/18a/+Bf/5gf/4l8l+Bf/KsG/+FcJ/m03/66Df/Ev/s0P/sW/SvAv/lWCf/GvEvzbbv5dF//iX/ybH/yLf5XgX/yrBP/iXyX4t838W15x+MOPVN/7/MF7dhs6tHtwreEPX7X4fMtMsNUcR4weXDfvlesPf/jk59578eiukz4cPbhF3q+fAbSBNtDOD9AG2kqANtBWArSBthKg/RtAe/iI5r8glXukOqflhbWFpLZw80Xo0S3qm/NAfmve4G3YG3tj7/xgb+ytBHtjbyXYG3srwd6/gb0NvzBayrfjX/yLf/ODf/GvEvyLf5XgX/yrBP+2m3/vwL/4F//mB//iXyX4F/8qwb/4Vwn+bTf/3ol/8S/+zQ/+xb9K8C/+VYJ/8a8S/Ntu/r0L/+Jf/Jsf/It/leBf/KsE/+JfJfi33fx7N/7Fv/g3P/gX/yrBv/hXCf7Fv0rwb7v59x78i3/xb37wL/5Vgn/xrxL8i3+V4N928++9+Bf/4t/84F/8qwT/4l8l+Bf/KsG/7ebf+/Av/sW/+cG/+FcJ/sW/SvAv/lWCf9vDv0m3f+/Hv/gX/+YH/+JfJfgX/yrBv/hXCf5tN/8+gH/xL/7ND/7Fv0rwL/5Vgn/xrxL8227+fRD/4l/8mx/8i3+V4F/8qwT/4l8l+Lfd/NvAv/gX/+YH/47wOOXiX5ce8K9L0/jXpQf8a/kF/Gv5hV/hX8G/+Bf/5gf/4l8l+Bf/KsG/+FcJ/m03/z6Ef/Ev/s0P/sW/SvAv/lWCf/GvEvzbbv59GP/iX/ybH/yLf5XgX/yrBP/iXyX4t938+wj+xb/4Nz/4F/8qwb/4Vwn+xb9K8G97+Dft9u+j+Bf/4t/84F/8qwT/4l8l+Bf/KsG/7ebfx/Av/sW/+cG/+FcJ/sW/SvAv/lWCf9vNv4/jX/yLf/ODf/GvEvyLf5XgX/yrBP+2m3+fwL/4F//mB//iXyX4F/8qwb/4Vwn+bTf/Pol/8S/+zQ/+xb9K8C/+VYJ/8a8S/Ntu/n0K/+Jf/Jsf/It/leBf/KsE/+JfJfi33fz7NP7Fv/g3P/gX/yrBv/hXCf7Fv0rwb7v59xn8i3/xb37wL/5Vgn/xrxL8i3+V4N/28G/W7d9n8S/+xb/5wb/4Vwn+xb9K8C/+VYJ/282/z+Ff/It/84N/8a8S/It/leBf/KsE/7abf5/Hv/gX/+YH/+JfJfgX/yrBv/hXCf5tN/+OxL/4F//mB//iXyX4F/8qwb/4Vwn+bTf/voB/8S/+zQ/+xb9K8C/+VYJ/8a8S/Ntu/n0R/+Jf/Jsf/It/leBf/KsE/+JfJfi33fz7Ev7Fv/g3P/gX/yrBv/hXCf7Fv0rwb7v592X8i3/xb37wL/5Vgn/xrxL8i3+V4N/28G+p27+v4F/8i3/zg3/xrxL8i3+V4F/8qwT/tpt/X8W/+Bf/5gf/4l8l+Bf/KsG/+FcJ/m03/76Gf/Ev/s0P/sW/SvAv/lWCf/GvEvzbbv59Hf/iX/ybH/yLf5XgX/yrBP/iXyX4t938+wb+xb/4Nz/4F/8qwb/4Vwn+xb9K8G+7+fdN/It/8W9+8C/+VYJ/8a8S/It/leDfdvPvW/gX/+Lf/OBf/KsE/+JfJfgX/yrBv+3m37fxL/7Fv/nBv/hXCf7Fv0rwL/5Vgn/bw7/lbv++g3/xL/7ND/7Fv0rwL/5Vgn/xrxL8227+fRf/4l/8mx/8i3+V4F/8qwT/4l8l+Lfd/Pse/sW/+Dc/+Bf/KsG/+FcJ/sW/SvBvu/n3ffyLf/FvfvAv/lWCf/GvEvyLf5Xg33bz7wf4F//i3/zgX/yrBP/iXyX4F/8qwb/t5t8P8S/+xb/5wb/4Vwn+xb9K8C/+VYJ/282/H+Ff/It/84N/8a8S/It/leBf/KsE/7abfz/Gv/gX/+YH/+JfJfgX/yrBv/hXCf5tD/9Wuv37Cf7Fv/g3P/gX/yrBv/hXCf7Fv0rwb7v591P8i3/xb37wL/5Vgn/xrxL8i3+V4N928+9n+Bf/4t/84F/8qwT/4l8l+Bf/KsG/7ebfz/Ev/sW/+cG/+FcJ/sW/SvAv/lWCf9vNv1/gX/yLf/ODf/GvEvyLf5XgX/yrBP+2m3+/xL/4F//mB//iXyX4F/8qwb/4Vwn+bTf/foV/8S/+zQ/+xb9K8C/+VYJ/8a8S/Ntu/v0a/+Jf/Jsf/It/leBf/KsE/+JfJfi3Pfxb7fbvN/gX/+Lf/OBf/KsE/+JfJfgX/yrBv+3m32/xL/7Fv/nBv/hXCf7Fv0rwL/5Vgn/bzb/f4V/8i3/zg3/xrxL8i3+V4F/8qwT/tpt/v8e/+Bf/5gf/4l8l+Bf/KsG/+FcJ/m03//6Af/Ev/s0P/sW/SvAv/lWCf/GvEvzbbv79Ef/iX/ybH/yLf5XgX/yrBP/iXyX4t938+xP+xb/4Nz/4F/8qwb/4Vwn+xb9K8G+b+bfy3vCH77n51Ru3vHKVO0b2WAb/4t9x1AP+xb9K8C/+VdKG/l201V9YBDAD5vwA5g4Fc49uML8PmAEzYM4PYAbMSgAzYFYCmAGzEsDc8WD+ADADZsCcH8AMmJUAZsCsBDADZiWAuePB/CFgBsyAOT+AGTArAcyAWQlgBsxKAHPHg/kjwAyYAXN+ADNgVgKYAbMSwAyYlQDmjgfzx4AZMAPm/ABmwKwEMANmJYAZMCsBzB0K5qQbzJ8AZsAMmPMDmAGzEsAMmJUAZsCsBDB3PJg/BcyAGTDnBzADZiWAGTArAcyAWQlg7ngwfwaYATNgzg9gBsxKADNgVgKYAbMSwNzxYP4cMANmwJwfwAyYlQBmwKwEMANmJYC548H8BWAGzIA5P4AZMCsBzIBZCWAGzEoAc4eCOe0G85eAGTAD5vwAZsCsBDADZiWAGTArAcwdD+avADNgBsz5AcyAWQlgBsxKADNgVgKYOx7MXwNmwAyY8wOYAbMSwAyYlQBmwKwEMHc8mL8BzIAZMOcHMANmJYAZMCsBzIBZCWDueDB/C5gBM2DOD2AGzEoAM2BWApgBsxLA3KFgzrrB/B1gBsyAOT+AGTArAcyAWQlgBsxKAHPHg/l7wAyYAXN+ADNgVgKYAbMSwAyYlQDmjgfzD4AZMHv0AJgBsxLADJiVAGbArAQwA2YlvyWYfwTMgBkw5wcwA2YlgBkwKwHMgFkJYO54MP8EmAEzYM4PYAbMSgAzYFYCmAGzEsDcoWAu/RfM1R6AGTAD5vwAZsCsBDADZiWAGTArAcwdD+YEMANmwJwfwAyYlQBmwKwEMANmJYC548GcAmbADJjzA5gBsxLADJiVAGbArAQwdzyYM8AMmAFzfgAzYFYCmAGzEsAMmJUA5o4HcwkwA2bAnB/ADJiVAGbArAQwA2YlgLlDwVzuBnMZMANmwJwfwAyYlQBmwKwEMANmJYC548FcAcyAGTDnBzADZiWAGTArAcyAWQlg7ngwVwEzYAbM+QHMgFkJYAbMSgAzYFYCmDsezDXADJgBc34AM2BWApgBsxLADJiVAOaOB3MdMANmwJwfwAyYlQBmwKwEMANmJYC5Q8Fc6QZzF2AGzIA5P4AZMCsBzIBZCWAGzEoAc8eDeTzADJgBc34AM2BWApgBsxLADJiVAOaOB/P4gBkwA+b8AGbArAQwA2YlgBkwKwHMHQ/mCQAzYAbM+QHMgFkJYAbMSgAzYFYCmDsezBMCZsAMmPMDmAGzEsAMmJUAZsCsBDB3KJir3WCeCDADZsCcH8AMmJUAZsCsBDADZiWAuePBPDFgBsyAOT+AGTArAcyAWQlgBsxKAHPHg3kSwAyYAXN+ADNgVgKYAbMSwAyYlQDmjgfzpIAZMAPm/ABmwKwEMANmJYAZMCsBzB0P5skAM2AGzPkBzIBZCWAGzEoAM2BWApg7FMy1bjBPDpgBM2DOD2AGzEoAM2BWApgBsxLA3PFgngIwA2bAnB/ADJiVAGbArAQwA2YlgLnjwTwlYAbMgDk/gBkwKwHMgFkJYAbMSgBzx4N5KsAMmAFzfgAzYFYCmAGzEsAMmJUA5o4H89SAGTAD5vwAZsCsBDADZiWAGTArAcwdCuZ6N5inAcyAGTDnBzADZiWAGTArAcyAWQlg7ngwTwuYATNgzg9gBsxKADNgVgKYAbMSwNzxYJ4OMANmwJwfwAyYlQBmwKwEMANmJYC548E8PWAGzIA5P4AZMCsBzIBZCWAGzEoAc8eDeQbADJgBc34AM2BWApgBsxLADJiVAOYOBXNXN5hnBMyAGTDnBzADZiWAGTArAcyAWQlg7ngwzwSYATNgzg9gBsxKADNgVgKYAbMSwNzxYO4JmAEzYM4PYAbMSgAzYFYCmAGzEsDc8WCeGTADZsCcH8AMmJUAZsCsBDADZiWAuePBPAtgBsyAOT+AGTArAcyAWQlgBsxKAHOHgnm8bjDPCpgBM2DOD2AGzEoAM2BWApgBsxLA3PFgng0wA2bAnB/ADJiVAGbArAQwA2YlgLnjwTw7YAbMgDk/gBkwKwHMgFkJYAbMSgBzx4N5DsAMmAFzfgAzYFYCmAGzEsAMmJUA5o4H85yAGTAD5vwAZsCsBDADZiWAGTArAcwdCubxu8E8F2AGzIA5P4AZMCsBzIBZCWAGzEoAc8eDeW7ADJgBc34AM2BWApgBsxLADJiVAOaOB/M8gBkwA+b8AGbArAQwA2YlgBkwKwHMHQ/meQEzYAbM+QHMgFkJYAbMSgAzYFYCmDsezPMBZsAMmPMDmAGzEsAMmJUAZsCsBDB3KJgn6Abz/IAZMAPm/ABmwKwEMANmJYAZMCsBzB0P5gUAM2AGzPkBzIBZCWAGzEoAM2BWApg7HswLAmbADJjzA5gBsxLADJiVAGbArAQwdzyYFwLMgBkw5wcwA2YlgBkwKwHMgFkJYO54MC8MmAEzYM4PYAbMSgAzYFYCmAGzEsDcoWCesBvMiwBmwAyY8wOYAbMSwAyYlQBmwKwEMHc8mBcFzIAZMOcHMANmJYAZMCsBzIBZCWDueDAvBpgBM2DOD2AGzEoAM2BWApgBsxLA3PFgXhwwA2bAnB/ADJiVAGbArAQwA2YlgLnjwbwEYAbMgDk/gBkwKwHMgFkJYAbMSgBzh4J5om4wLwmYATNgzg9gBsxKADNgVgKYAbMSwNzxYF4KMANmwJwfwAyYlQBmwKwEMANmJYC548G8NGAGzIA5P4AZMCsBzIBZCWAGzEoAc8eDeRnADJgBc34AM2BWApgBsxLADJiVAOaOB/OygBkwA+b8AGbArAQwA2YlgBkwKwHMHQrmibvBvBxgBsyAOT+AGTArAcyAWQlgBsxKAHPHg3l5wAyYAXN+ADNgVgKYAbMSwAyYlQDmjgfzCoAZMAPm/ABmwKwEMANmJYAZMCsBzB0P5hUBM2AGzPkBzIBZCWAGzEoAM2BWApg7HswrAWbADJjzA5gBsxLADJiVAGbArAQwdyiYJ+kG88qAGTAD5vwAZsCsBDADZiWAGTArAcwdD+ZVADNgBsz5AcyAWQlgBsxKADNgVgKYOx7MqwJmwAyY8wOYAbMSwAyYlQBmwKwEMHc8mFcDzIAZMOcHMANmJYAZMCsBzIBZCWDueDCvDpgBM2DOD2AGzEoAM2BWApgBsxLA3KFgnrQbzGsAZsAMmPMDmAGzEsAMmJUAZsCsBDB3PJjXBMyAGTDnBzADZiWAGTArAcyAWQlg7ngwrwWYATNgzg9gBsxKADNgVgKYAbMSwNzxYF4bMANmwJwfwAyYlQBmwKwEMANmJYC548G8DmAGzIA5P4AZMCsBzIBZCWAGzEoAc4eCebJuMK8LmAEzYM4PYAbMSgAzYFYCmAGzEsDc8WBeDzADZsCcH8AMmJUAZsCsBDADZiWAuePBvD5gBsyAOT+AGTArAcyAWQlgBsxKAHPHg3kDwAyYAXN+ADNgVgKYAbMSwAyYlQDmjgfzhoAZMAPm/ABmwKwEMANmJYAZMCsBzB0K5sm7wbwRYAbMgDk/gBkwKwHMgFkJYAbMSgBzx4N5Y8AMmAFzfgAzYFYCmAGzEsAMmJUA5o4H8yaAGTAD5vwAZsCsBDADZiWAGTArAcwdD+ZNATNgBsz5AcyAWQlgBsxKADNgVgKYOx7MmwFmwAyY8wOYAbMSwAyYlQBmwKwEMHcomKfoBvPmgBkwA+b8AGbArAQwA2YlgBkwKwHMHQ/mLQAzYAbM+QHMgFkJYAbMSgAzYFYCmDsezFsCZsAMmPMDmAGzEsAMmJUAZsCsBDB3PJi3AsyAGTDnBzADZiWAGTArAcyAWQlg7ngwbw2YATNgzg9gBsxKADNgVgKYAbMSwNyhYJ6yG8zbAGbADJjzA5gBsxLADJiVAGbArAQwdzyYtwXMgBkw5wcwA2YlgBkwKwHMgFkJYO54MG8HmAEzYM4PYAbMSgAzYFYCmAGzEsDc8WDeHjADZsCcH8AMmJUAZsCsBDADZiWAuePBvANgBsyAOT+AGTArAcyAWQlgBsxKAHOHgnmqbjD3AsyAGTDnBzADZiWAGTArAcyAWQlg7ngw7wiYATNgzg9gBsxKADNgVgKYAbMSwNzxYO4NmAEzYM4PYAbMSgAzYFYCmAGzEsDc8WDeCTADZsCcH8AMmJUAZsCsBDADZiWAuePBvDNgBsyAOT+AGTArAcyAWQlgBsxKAHOHgnnqbjDvApgBM2DOD2AGzEoAM2BWApgBsxLA3PFg7gOYATNgzg9gBsxKADNgVgKYAbMSwNzxYN4VMANmwJwfwAyYlQBmwKwEMANmJYC548G8G2AGzIA5P4AZMCsBzIBZCWAGzEoAc8eDeXfADJgBc34AM2BWApgBsxLADJiVAOYOBfM03WDuC5gBM2DOD2AGzEoAM2BWApgBsxLA3PFg3gMwA2bAnB/ADJiVAGbArAQwA2YlgLnjwbwnYAbMgDk/gBkwKwHMgFkJYAbMSgBzx4O5H2AGzIA5P4AZMCsBzIBZCWAGzEoAc8eDeS/ADJgBc34AM2BWApgBsxLADJiVAOYOBfO03WDuD5gBM2DOD2AGzEoAM2BWApgBsxLA3PFgHgCYATNgzg9gBsxKADNgVgKYAbMSwNzxYB4ImAEzYM4PYAbMSgAzYFYCmAGzEsDc8WDeGzADZsCcH8AMmJUAZsCsBDADZiWAuePBPAgwA2bAnB/ADJiVAGbArAQwA2YlgLlDwTxdN5j3AcyAGTDnBzADZiWAGTArAcyAWQlg7ngwDwbMgBkw5wcwA2YlgBkwKwHMgFkJYO54MO8LmAEzYM4PYAbMSgAzYFYCmAGzEsDc8WDeDzADZsCcH8AMmJUAZsCsBDADZiWAuePBvD9gBsyAOT+AGTArAcyAWQlgBsxKAHOHgnn6bjAfAJgBM2DOD2AGzEoAM2BWApgBsxLA3PFgPhAwA2bAnB/ADJiVAGbArAQwA2YlgLnjwXwQYAbMgDk/gBkwKwHMgFkJYAbMSgBzx4P5YMAMmAFzfgAzYFYCmAGzEsAMmJUA5o4H8yGAGTAD5vwAZsCsBDADZiWAGTArAcwdCuYZusF8KGAGzIA5P4AZMCsBzIBZCWAGzEoAc8eD+TDADJgBc34AM2BWApgBsxLADJiVAOaOB/PhgBkwA+b8AGbArAQwA2YlgBkwKwHMHQ/mIwAzYAbM+QHMgFkJYAbMSgAzYFYCmDsezEMAM2AGzPkBzIBZCWAGzEoAM2BWApg7FMwzdoP5SMAMmAFzfgAzYFYCmAGzEsAMmJUA5o4H81GAGTAD5vwAZsCsBDADZiWAGTArAcwdD+ajATNgBsz5AcyAWQlgBsxKADNgVgKYOx7MxwBmwAyY8wOYAbMSwAyYlQBmwKwEMHc8mI8FzIAZMOcHMANmJYAZMCsBzIBZCWDuUDDP1A3m4wAzYAbM+QHMgFkJYAbMSgAzYFYCmDsezL8DzIAZMOcHMANmJYAZMCsBzIBZCWDueDAfD5gBM2DOD2AGzEoAM2BWApgBsxLA3PFg/j1gBsyAOT+AGTArAcyAWQlgBsxKAHOngvnU4c/O1XufffoMGtxr5wF7Dew9uO9O/fr0GjCo987h/9mvz6BRE/Xaf1DvgQP7DBrZY+Ih5686oP8+g0cMuWC1voP67Dw4HXLh2v0H99mtz6BzN190EcPyRb+ftPT7R6we/36P1uqvPuS8VXv36zdsvO55LtqkT7/Q9H59Wuykx9gzZK3OcOmoZdml9+Deqw4YeGB3S6uPuUxjTP7vJZ/wVy/56uNgyc/bdPCAgcOGK0sabaNVz1+jb59+uxiOp+gXVzP+Yo8LNukzeN9B/YdcssaAQX367tZ/1Jo6NezXBw3us3Ovvfrus3Ovf+/iq3bv4Rv+vINv8e/9e+jQ4UMuW7/PXgMGHbjyLruMOnq6F10ZX234kAs27bvXwH59/r2Iv/z//Wdxhj8733+OrP169+u7S6+B++7Ur+/OvXYOC9dr1Fb/71H2n6PrzP/jY2u1X3lsrfar96tk7BlK4+aYWnXMZRpj8nPXH7DfL/bi7tePq/PEau5H2y93+ln/vdMPHLTff/b5LUbtexv9vOv9d9UMHTos3q9HTz0sf1++5efdduCgvvv1Htyn16779t958Kh3hr6hkUH9e/cb2WPq/+Pdd51fufuuM/aGqrY2Q3nsGWrjfPetjjl52EnHPF2O/mHMqtGr1hj9w/941Zqjf/jvq87ZfOH/cbxE/yUbvSzRfymNfp+L/kt59JJF/6Uyemn+fVxO/p9X/Gd4rTEX6Rf/Ze2896WiZ5e1xp6h3NoM6djHcmnMyX5xLN88+lAedfBt9O9jb43/HHrD1UO4qv6XWvfb1i+3/S+O+FP1c4P6XzL1v5TU/1JW/0vl1Px31/+x0P/zJf97Fx5jvY21E49ec/89D16xy8/7VRgK577g48F/is87U/zK897k4+ac0WP08nRPHJ+hrb4actkqffv3HnTgzy/fcOAp/50gu2D1vfft3W+fsWqGE8M6++41cO1duw/ErDbW+d1YPdGq9zh3tb77jX636F6G/x5i3W3/d0UMv3HMjffzKu61974DBvft03/wH+PF62r1yI5+f7xxvBm7Rk+srI/04v8UHGO19Bi9fpTfSs5df99+Y2y3pi/fdN+dcmb/xVl3jP0g2hjjdbfz/wGAENX2xUgWAA==",
|
|
4012
|
+
"bytecode": "H4sIAAAAAAAA/+3dBdwc5fX3/8zM6o27Q3B3d3d3JwQIEAhJCME1aCkFIkhLS4tDsVIcirvswZ3g7u72v0LbO+HKnO7ZIYff7v/5fF99/Z77udj7OnPG9r2zc0+y4cNOe7Znr169DxrcZ+de/Qf16tt/cJ9B/Xv326dXrz79Bw86cOCAMDKy64khV6zSr/fOe64y4IA19u2/86q9+/Ubcv4mK2+w5urDh1y4Zd/B/fvss0/a0/CiLDG8aFLLTJOvZHjRVI0jDK+a2vSqGSxLNaPlRTNZXtTT8qKZTUs+i+lVs5peNZvpVbNbFn4uy4vmseww81peNJ/lRQtYlmkhy0wLW160iOVFi1mWaQnLTEtaXrSU5UXLWJZpOctMy1tetILlRStZlmkVy0yrWl60WjLkklUG9e3Xr+9uo/77KT2GDh0xdOhdPXv87yRDLl55n336DBq8TZ9BA0YMHTb8rp4L7bLBoFcWPmvu6zda/dohQ7bafq5F317rwBsGDlv1lS9GfBx+RbKT/ve0T87/2p5Fpj1ZnbZ7PGdFXL3RgH369N1lQP9FNuozaK99B/ce3HdA/+GndK+YsLjdP885+mgf47+ffIpkQyUbJtlwyUb8cslHDG++Cuc2vCZUMK2DU5pO1aP1BZzHtIC2jXSqxwLOa1rA4aYFPM2wgEX2ojF/PnWMn08b4+cRYU86XbI/SvYnyc5ofT3MZ1oPp5vWw589NtT8pgX8o2kB/+KxgAuYFvBPpgU802lP+vMYP/9ljJ/PHOPnM8Ke9FfJ/ibZWZKd3fp6WNC0Hv5qWg/neGyohUwL+DfTAp7rsYALmxbwLNMCnue0J50zxs/njvHzeWP8fHbYk86X7ALJLpTsotbXwyKm9XC+aT383WNDLWpawAtMC3ixxwIuZlrAC00LeInTnvT3MX6+eIyfLxnj54vCnnSpZJdJdrlk/2h9PSxuWg+XmtbDFR4bagnTAl5mWsB/eizgkqYFvNy0gFc67UlXjPHzP8f4+coxfv5H2JOukuxqya6R7NrW18NSpvVwlWk9XOexoZY2LeDVpgW83mMBlzEt4DWmBbzBaU+6boyfrx/j5xvG+PnasCfdKNm/JLtJsptbXw/LmtbDjab1cIvHhlrOtID/Mi3grR4LuLxpAW8yLeBtTnvSLWP8fOsYP982xs83hz3pdsnukOxOye5qfT2sYFoPt5vWw90eG2pF0wLeYVrAezwWcCXTAt5pWsB7nfaku8f4+Z4xfr53jJ/vCnvSfZLdL9kDkj3Y+npY2bQe7jOth4bHhlrFtID3mxZQPBZwVdMCPmBawIec9qTGGD/LGD8/NMbPD4Y96WHJHpHsUckea309rGZaDw+b1sPjHhtqddMCPmJawCecNtTjY/z8xBg/PzrGz4+FDfWkZE9J9rRkz/xyPQw39Di7qcNnDZfzm39TEObp2foSTm5awueaTJRsfIRpCZ9b6ZffZmTDhlywad/+u/Xr8+8vE5ot7dzN94WfZ9xrYL8+kj3f+jclw0YYFiLMPMy0g49svm6LVB85tNVjdrhpcZ817QsvFFilzWadJzRlWcZ5TEv4Yourx7LaQ99hYtt3KS8VOmONfbS81POXR0vS4tEyZ/PlGGqbqdg6bbam5g3T2vbMF03r/WWH7T5qzxxhqG7bM0eaXvWKw0krrOtXLKeNX+xw6anj/PTc2oRzjesJ5xzXE1revUdPaTkq5sssx0Rm+dqx+ZINH/1u+eroH1+z9v7KODrTvdqzwAn5lfB7ttPHK6bD7vVx1MzrPVs+E2bzjRhX29zU6hstnimHGzZIWM8vG0/6trfRN4soZ1ydg99q8Rw83LTLvhje1K379uu2tfR2qyf1Vs29YEvmfsfH3AuGmW2npHcdzB2qv9uquW3nsGfD/mjazl2DXeq/FXYgW/19i1wnaL77vmfZqF2DTa/at8CO12wJFwqb3vIms5Cp2/ddNuJ7YWLbyeKDcfQW98Gv/GQy/zj8ZFJknTZbUwuHaW20eN+03j9s9SRdGt4qQ5t8QPvpp59eHj3l/z6ZJaP+zxgy/Gj0jx/bTu+Wfegj28s+7tn65cemHxiHf/zzqz4ybbyPDWu21R0s7DihvMd7yqgTluXUazthvWt61ScO7/jhEPzE/QOrwTatTbjAuJ5w/hYmtBl0ZFCH2QZDWyhv2e8XGWcfbhdp6cPtp6N//Mx6Rv3E0LvlDPZpz197bn+l6Rno66Ln9s9H//jFuDu3f2572ReFzu2vmM7tn5vOXF8Y1mzr5/ZPQnmPc/uo5m3Q+9Kh+tzm6l85VJ/LXP1rF2SHT+Rv2Op/41B/TnP333p1/5qt/nden5ON/X/v1f+rtvo/tPo52Tbtj5Zp1++z14BBB67dv+/gET1G9lgpnAbCsRgOiLBPhh0jbJuwesIShtk64n8X/LufVjdX7efN9Yltvf5kWK8X/Xs5Nhw4vMeIO8KvSKnQ1dFPjO8dpR6mj57hZYb5SkmLDd75c4NJwZVu+9D8iWnJ05Y3TSmVUtbyplmwhU2T2TZNZmqw1PKmGdVgyW/TpNZNU25905SlVGl50yzQwqap2DZNxdRgtfVNExqs+m2azLppaq1vmpqU6q1/ZbXIuPrKahFTX10FvrIy7Td1EwDCC7tsO1jd1M54re9gYTON57eDlaw72Pit72DjS2mClo/9+Vs49iewbZoJTA1O2PqmCQ1O6LdpytZNM1Hrm2YiKU1c4IvMT0ZdRzFunIltG2diU4uTtL5xQouT+G2cinXjTNr6xplUSpMV+FKtNPlv+qVawfPuZNbz7uS2/Wcy06qZovX9J2yFKfz2n6p1/5my9f1nSilNVezg/tS6FaeybZypTC1O3frGCS1OXeDz/KgWx+VnlWnGzbXi0jQ940+bP0pp2gIXDErTGS7lRrvLdFKavkipGZp/sIhLzSClGYuUmqk5lONSM0mpZ5FSMzcnU1xqZinNUqTUrM0JEJeaVUqzFSk1e/M3tLjU7FKao0ip5vdaVuNSc0ppriKlmt94WotLzS2leYqUmrdpqXpcal4pzVekVPPv/rriUvNLaYEipZp/ETpeXGpBKS1UpNTCTUuNH5daWEqLFCm1aNNSE8SlFpXSYkVKLd601IRxqcWltESRUks2LTVRXGpJKS1VpNTSTUtNHJdaWkrLFCm1bNNSk8SllpXSckVKLd+01KRxqeWltEKRUis2LTVZXGpFKa1UpNTKTUtNHpdaWUqrFCm1atNSU8SlVpXSakVKrd601JRxqdWltEaRUms2LTVVXGpNKa1VpNTaTUtNHZdaW0rrFCm1btNS08Sl1pXSekVKrd+01LRxqfWltEGRUhs2LTVdXGpDKW1UpNTGTUtNH5faWEqbFCm1adNSM8SlNpXSZkVKbd601Ixxqc2ltEWRUls2LTVTXGpLKW1VpNTWTUvFn69KW0tpmyKltm1aaua41LZS2q5Iqe2blpolLrW9lHYoUqpX01KzxqV6SWnHIqV6Ny01W1yqt5R2KlJq56alZo9L7SylXYqU6tO01BxxqT5S2rVIqd2alpozLrWblHYvUqpv01JzxaX6SmmPIqX2bFpq7rjUnlLqV6TUXk1LzROX2ktK/YuUGtC01LxxqQFSGlik1N5NS80Xl9pbSoOKlNqnaan541LhGtfgIqWaX4ZeIC61r5T2K1Jq/6alFoxL7S+lA4qUOrBpqYXiUgdK6aAipQ5uWmrhuNTBUjqkSKlDm5ZaJC51qJQOK1Lq8KalFo1LHS6lI4qUGtK01GJxqSFSOrJIqaOallo8LnWUlI4uUuqYpqWWiEsdI6Vji5Q6rmmpJeNSx0npd0VKHd+01FJxqeOl9PsipU5oWmrpuNQJUvpDkVInNi21TFzqRCmdVKTUyU1LLRuXOllKQ4uUGta01HJxqWFSGl6kVPOvhpaPS42Q0ilFSjV/nvoKcalTpXRakVKnNy21YlzqdCn9sdVvzco///my7Q8NS39q9S5Y299um/4cqXSG4auv1r8yDM2/aWu+1Ue0G2++t/3ZfOkvDtV/7t52+3vpTIf6c5q7/6tL98+a6//NUn+M+7STkT3OCntM2GxhzYXFDzP8n993zf/G7f8K3seehNNoOJnZ9ruzDPvd6DeBZNSbQNjvzi5yH/uHxj+gti34OR4HbAsr7tzWV9y5UjqvwD1P74f1bTrbhBeeY7ut5mxTi+e3eE5KOSf9//5/xc9JZ4QdyvbIkBMKHNoG3YWjz/SHoqXzTEfHBabbIE9o6TSRjro1LZwmLiiI7HH47InShS4n2LAVLrSdYC9qcc2FE+xFUvq76zJd3PoyXSylS4r8adH71veGv9tO+X83NXip10a/1Hbon+x16F9iO/QvMa2ly0yH/smtH/phZ7nM9fP15YZbLgtt38ubfRD/6KeffgqvNC3lPwxLGR1m/5DSFQWX3Lbm/tn6of9PKV1Z4DbqcEx3WQ/+K2wH/xWmFq/yOvivsh38I7wO/ittB/+VprV0tengH9H6wR92l6v93vcz6/v+NV57wTW2A+3a1g+0a6V0nesyXd/6Ml0vpRuK/O2a+X3/Otuhf52pwRu9NvqNtkP/dK9D/wbboX+DaS39y3Ton976oR92ln+5vu/f1HS6UrHte5Phff8H6/v+zYaljA6zm6V0S6H32OwD69+RTWNbxbe6HEL2C1K3tbTb/XxB6jYp3V7gqva74ddM37uU7nD4jJyMOmDCkt/h+knvztbXZlisu4qtzbtsa/Nuh48dP6/N8L+7fwX7m7wytX7/dk/r6/weKd3bBkt+n8u3R2HPuNe2Z9zvYNKf94z7wtyusnqg9W3+gJQeLLY2H7StzYbD2/zPazMseeNXvM02eWXJurdK6+tcpPRQsY+yk1s9e4vNs7eYWnzYy7PjdEM80uJSDrfu6A9Z23nYdpQ+2vq+/kj4rV/3APnmfxo3xgPkS4/5PEB+8TCz6WGbpcebr8gi1R8f6vXeMrnto9k5XofSrbb6hf419+a79BOmk/w5pledW2DHa7aES4RNbzkjLmHq9kmXjfhEmNh2AnnKUN/ynIOnfuUD5BdtvhzWB8gXWqfN1tSSYVrb++CTpvX+tGEZtYcMm/9pEuslq1b+1a7mr2ry/P5f8eD60jOjf3x2nD3cuPSM7WXxv8Z4yrhcZ/97p/n3I5BLz5h2rWcN67/1S3ZPhvJDi5zxe/w2q+g/i/lcgTN+09qjmn/Odj59fhydT5/v2fJijnpjsrzF2t6YHje9aqTD6g6n2pHu/1CAwbCtTbjYuJ5w0RYmNH/+mNxswHH9DwUsNc7+oYClmi/ZGG8ZL4z+8UUrIEaOo4P4hZ6/8j38FfsjE7NX7P90XvNXfdL0PaToP1BQemn0jy+Pu/fwl2wve7nQe7hxnZnew18ynVdfNqz/1t/DR4byHu/hNdMqqlmfvfZKi4tofUJh9qX1m6VpbcfSl6Z2XvVq5ytrO9Pb2vnK1M5rXu18bW1nRls7X5vaed2rnW+s7fS0tfONqZ03vNr51trOLLZ2vjW186ZXO99Z25nN1s53pnbe8mrne2s7c9ja+d7Uztte7fxgbWcuWzs/mNp5x+WCbljKeWyfHd/1qj+frf57XvUXsNV/36v+Qrb6H3jVX8RW/0Ov+ovZ6n/kVX8JW/2PveovZav/iVf9ZWz1P/Wqv5yt/mde9Vew1f/cq/5KtvpfeNVfxVb/S6/6q9nqf+VVfw1b/a+96q9lq/+NV/11bPW/9aq/nq3+d171N7DV/96r/ka2+j941d/EVv9Hr/qb2er/5FV/C1P9cg+v+lvZ6ide9bex1U+96m9nq5951d/BVr/kVX9HW/2yV/2dbPUrXvV3sdWvetXf1Va/5lV/d1v9ulf9PWz1u7zq97PVH8+rfn9b/fG96g+01Z/Aq/4gW/0JveoPttWfyKv+frb6E3vVP8BWfxKv+gfZ6k/qVf8QW/3JvOofZqs/uVf9I2z1p/Cqf6St/pRe9Y+21Z/Kq/6xtvpTe9X/na3+NF71f2+rP61X/T/Y6k/nVf8kW/3pverbnrtZnsGr/nBb/Rm96p9iqz+TV/3TbPV7etX/o63+zJb6YzxWLRvZYyUpvSql16T0evjqPXxdHb7iDV+Lhq8Sw7d54Qu18J1W+FopfLMTvlwJ32+ErxjCVf5woT1c6w6Xm8MV33DRNVz3DJcew9W/cAEuXAMLl6HClaBwMSZcDwmXJMJVgfDBPHw2Dh9PwyfE8CEtfE4KH1XCp4UA9mDmwNYgx4C34KdAmKCI8EYe3kvD21l4Rwkn9XBeDae2cHYJB3g4xsJuHva0sLHD+g4tF39s2EgpvWJbr7MY1uvoP1LKRtwRfkXKs7b8F1ajFsp4H1R5VtMXx+FllgZna7HBO39ucLaCK932ZwgjTUs+e+ubZnYpz9Hyplm8hU1ju0UhvMzS4Jytb5rQ4Jx+mya1bpq5Wt80c0l57pY3zWItbJq5bZtmblOD87S+aUKD8/htmsy6aeZtfdPMK+X5Wr5jM1vK8gcUpnumTX3N3+Ib8HDrfjOfcTOV57ftYPOZ2lmg9R0sbKYF/HawknUHW7D1HWxBKS/U8rG/aAvH/kK2TbOQqcGFW980ocGF/TZN2bppFml90ywi5UVb3jQ/L/mL1o2zqG3jLGpqcbHWN05ocTG/jVOxbpzFW984i0t5iQJ/plxe0rLCx9mfKRc87y5hPe8uadt/TH86Vl6q9f0nbIWl/PafqnX/Wbr1/WdpKS9T7OB+wboVl7FtnGVMLS7b+sYJLS5b5O86x8mfzfxnsZdrPlWh/adsuzeuvLxhtRn+AKm8fM9iu/kL4/JT3wrjqJkVekZHQ/ajlFeMxkrhqsNK8Vi4BrFyPBauSKwSj80s5VXjsVmlvFo8Fj6zrR6PzSnlNeKxuaW8ZjwWzLdWPDa/lNeOxwJA1onHFpbyuvHYolJeLx4L57f147ElpbxBPBYOtQ3jsWWlvFE8tryUN47HVpTyJvHYylLeNB5bVcqbxWOrS3nzeGxNKW8Rj60t5S3jsXWlvFU8tr6Ut47HNpTyNvHYxlLeNh7bVMrbxWObS3n7eGxLKe8Qj20t5V7x2LZS3jEe217KveOxXlLeKR7rLeWd47GdpbxLPNZHyn3isd2kvGs81lfKu8Vje0p593hsLyn3jccGSHmPeGxvKe8Zj4UDs188tq+U94rH9pdy/3jsQCkPiMcOlvLAeOxQKe8djx0u5UHx2BAp7xOPHSXlwfHYMVLeNx47Tsr7xWPHS3n/eOwEKR8Qj50o5QPjsZOlfFA8NkzKB8djI6R8SDx2qpQPjcdOl/JhLb8tlk2POygbH3dQPrxFOVofd1A+3Pa2eESL9W3/LJjt4QPlIR4mKB8RJrY1f2RLlBr1uLbykVI+qsh17aeNj6ixLfjRHntNCyvumNZXXDhBHFvgM1DYk4+y7vJH25h9lKnF41pucZSdfheNjbLT8fFYsNPv47FgpxPisWCnP8RjwU4nxmPBTifFY8FOJ8djwU5D47Fgp2HxWLDT8Hgs2GlEPBbsdEo8Fux0ajwW7HRaPBbsdHo8Fuz0x3gs2OlP8Viw0xnxWLDTn+OxYKe/xGPBTmfGY8FOf43Hgp3+Fo8FO50VjwU7nR2PBTudE48FO50bjwU7nRePBTudH48FO10QjwU7XRiPBTtdFI8FO/09Hgt2ujgeC3a6JB4Ldro0Hgt2uiweC3a6PB4LdvpHPBbsdEU8Fuz0z3gs2OnKeCzY6ap4LNjp6ngs2OmaeCzY6dp4LNjpungs2On6eCzY6YZ4LNjpxngs2Olf8Viw003xWLDTzfFYODXeEo8FO90ajwU73RaPBTvdHo8FO90RjwU73RmPBTvdFY8FO90djwU73ROPBTv98vHAxls0mj/Pd6X4neM+Kd9fpFTzB+CuHJd6QMoPFinVaFpqlbhUQ8pSpNRDTUutGpd6SMoPFynV/CGqq8WlHpHyo0VKPda01Opxqcek/HiRUk80LbVGXOoJKT9ZpFTzZzOuGZd6SspPFyn1TNNSa8WlnpHys0VKNX9C29pxqeek/HyRUs2f47ROXCpcEXyhSKkXm5ZaNy71opRfKlLq5aal1otLvSzlV4qUav7omvXjUq9K+bUipZo/h2WDuNTrUn6jSKnmDxXZMC71ppTfKlKq+RMyNopLvS3ld4qUav70iI3jUu9K+b0ipZo/qGGTuNT7Uv6gSKnmz0TYNC71oZQ/KlKq+eMHNotLfSzlT4qU+rRpqc3jUp9K+bMipZr/Uf0WcanPpfxFkVLN/359y7jUl1L+qkip5n8qvlVc6mspf1OkVPO/yt46LvWtlL8rUqr5H0BvE5f6Xso/FCnV/G+Nt41LhesTPxUoVWn+Z73bRaUq4beSIqWa/wXt9nGpVCpZkVLN/1h1h7hUSSrlIqWa/11or7hURSrVIqWa/wnmjnGpmlTqRUo1/2vH3nGpLqmMV6RU8z8s3CkuNb5UJihSqvnf8O0cl5pQKhMVKdX8z+V2iUtNLJVJipSatGmpPnGpSaUyWZFSzf8IbNe41ORSmaJIqeZ/b7VbXGpKqUxVpFTzP23aPS41tVSmKVKq+V8R9Y1LTSuV6YqUav4HO3vEpaaXygxFSjX/25g941IzSmWmIqWa/xlKv7hUT6nMXKRU87+M2CsuNYtUZi1SqvnfKPSPS80mldmLlJqjaakBcak5pDJnkVLNb5IfGJeaSypzFynV/Hb1veNS80hl3iKl5mtaalBcaj6pzF+kVPN7pPeJSy0glQWLlFqoaanBcamFpLJwkVKLNC21b1xqEaksWqRU85tl94tLLSaVxYuUWqJpqf3jUktIZckipZrfwnlAXGopqSxdpNQyTUsdGJdaRirLFinV/CbCg+JSy0ll+SKlmt9id3BcagWprFik1EpNSx0Sl1pJKisXKbVK01KHxqVWkcqqRUqt1rTUYXGp1aSyepFSazQtdXhcag2prFmk1FpNSx0Rl1pLKmsXKbVO01JD4lLrSGXdIqXWa1rqyLjUelJZv0ipDZqWOioutYFUNixSaqOmpY6OS20klY2LlNqkaalj4lKbSGXTIqU2a1rq2LjUZlLZvEipLZqWOi4utYVUtixSaqumpeJbaypbSWXrIqW2aVoqvmOnso1Uti1SarumpeIbgSrbSWX7IqV2aFoqvr+osoNUehUptWPTUvFtS5UdpdK7SKmdmpaK74aq7CSVnYuU2qVpqfgmq8ouUulTpNSuTUvF925VdpXKbkVK7d60VHxLWGV3qfQtUmqPpqXiO80qe0hlzyKl+jUtFd/AVuknlb2KlOrftFR8X1ylv1QGFCk1sGmp+Ha7ykCp7F2k1KCmpeK7+CqDpLJPkVKDm5aKbw6sDJbKvkVK7de0VHzPYWU/qexfpNQBTUvFtzJWDpDKgUVKHdS0VHyHZOUgqRxcpNQhTUvFN15WDpHKoUVKHda0VHw/Z+UwqRxepFTze9zj20QrR0hlSJFSze8oj+8+rRwplaOKlGp+D3h8U2vlaKkcU6TUsU1LxffKVo6VynG/eNZOaWSPs6T8OykfL+XfS/kEKf9ByidK+SQpnyzloVIeJuXhUh4h5VOkfKqUT5Py6VL+o5T/JOUzpPxnKf9FymdK+a9S/puUw1RnS/kcKZ8r5fOkfL6UL5DyhVK+SMp/l/LFUr5EypdK+TIpXy7lf0j5Cin/U8pXSvkqKV8t5WukfK2Ur5Py9VK+Qco3SvlfUr5JyjdL+RYp3yrl26R8u5TDd6Z3SvkuKd8t5XukfK+U75fyg1IWKT8s5Uel/LiUn5Ty01J+VsrPS/kFKb8k5Vek/JqU35DyW1J+R8rvSfkDKX8k5U+k/Fn4Yj58YR6+yA5fMIcvfsMXsuGL0vAFZvhiMXzhF76IC1+QhS+uwhdK4Yue8AVM+GIkfGERvkgIF/jDhfdwQTxcqA4XkMOF3XDBNVwIDRcow4XDcEEvXGgLF8DChalwwShcyAkXWMKFj3BBIlwoCB/gwwfr8IE3fBANHxDDB7fwgSp80AkfQMIHgwD2AOkA3ADPAMIAtQCoAJsAjgCB8AYd3jjDG1p4owlvAOHEHE6Y4UQWTjDhwA8HZDhQwg4cdqywwQs/i6g8RMrHmfbFrvsL/OmD4S9RpHys6W9iy8eajpjfWeYy9TL6uCqN+lPesJp/93/8N0uV413+lPfJMLHtdPR7l79+Cbux7TF/lRNa3GzhdHiCVP7gukwntr5MJ0rlpJb/lGnxsKGMf7hT+YPp73HCyywNnuy10U+2nXfE6bxTOcl03qmcZFpLQ03nHWn5vDNqZxn6f33eGdZ0qrTYeWdYsz9q/Oinn34y/sPwleEeSzlqRxluWsryENNSjjAsZXS+GCGVUwouue0cdmrr57BTpXJay+ewn/9YcH7rWewU21nsFFOLp3udxU63ncUe9TqLnWY7i51mWkt/NJ3FHm39LBZ2lz/+X5/F/tR0qqzYWexPtqPsDK9d8Axb/T+3fpT/WSp/cV2mM1tfpjOl8teWzzyLtqCnv9jOO38xNfg3r43+N9t550mv885fbeedv5rW0lmm886TrZ93ws5y1v/1eefsplOVip13zja45Aerns7xWMpRO8o5pqU06ulcw1JG54tzpXJeIamUnrI+Ccv2rzRWzm/xWDQ+8sP05KrKBS1eO/jtn1RWudDlXGl+uEblopbOLz9fbb1IKn8vcPA+Hn7NtHErFztcz0pGnRnDkl/semHkktbX5iVSubTY2rzUtjYvc/iU/vPaDEt+2a/4cNnklanxuT6Vy1tf55dL5R9tsORXeBz7o/aMf9j2jH86fPL5ec+4IsztSugrW9/mV0rlqmJr8yrb2rzawXM/r82w5Ff/CoY0eWXJurde0/o6v0Yq1xa7YLKk9YPLebYPLueZWrzO64PLON0Q17e4lMOtO/q11nausx2lN7S+r18ffquIB23ev9HHgy+aXmX74PQvwzq7ZJVBffv167vbqOesnpING3LBpn3779avz7+/YG+2IIYn+v48414D+4VvZW8aMXSowxdw4evim4aZDtybm6+0ItVvHupxqIeDqLyk7RrFy16nmvNt9V9p9XOZ6TnnlVtMb4Ivm171SoEdr9kSLhc2veUdYzlTt7d6bMTKLWFi2wn2NkN9w5OZK7f1/OU5JWnxnGJ4EPpQ20zF1mmzNbV8mNbmhFtN6/32Vk/SpeHdK9R8JeZ5085yY3jLaHIuC1/UvTx6e/7vFyej/s/w0ef/O0b/eKftrcCyv91he9mdPQtdIyw9bzsFvupy9I7aILb6r7V6Cm7yrd/wj39egDtMu/CdplPwq6ZXvWbY/1q+3l65NbQy1Odd6q7frvkehe5PGtX8Xbb3gLvH0XvA3a0fbKPeTC0r3PZmerPpVfc4rO7w9nDP0FZP6emp49zdrU24zLiecOkWJhxu5rDZrUNbKG85g6yQWd7yLf8cmuEfwBjjLfPe0T/eZ0XPPePoIL635690R/hiZ3nTCeqC8NVFc3d8XdQd94/+8YFx5477bS97oNi/ulJe3va+/7phY7f+jjFqg9jqv+HjjvtN5+8HTG+qr5te9YZh/2vdHfeEVpzc8WDztmqm5mutb0XrvwJWetW6u69o+0eGXjWtmoZXO69Z21nJ1s5rpnbEq53Xre2sbGvndVM7D3m184a1nVVs7bxhaudhr3betLazqq2dN03tPOLVzlvWdlaztfOWqZ1Hvdp529rO6rZ23ja185hXO+9Y21nD1s47pnYe92rnXWs7a9raedfUzhNe7bxnbWctWzvvmdp50qud963trG1rx/Zt2FNe7XxgbWcdWzsfmNp52qudD63trGtr50NTO894tfORtZ31bO18ZGrnWa92Pra2s76tnY9N7Tzn1c4n1nY2sLVju1Hyea92PrW2s6GtnU9N7Yz0auczazsb2dr5zNTOC17tfG5tZ2NbO5+b2nnRq50vrO1sYmvnC1M7L3m186W1nU1t7Xxpaudlr3a+srazma2dr0ztvOLVztfWdja3tfO1qZ1Xvdr5xtrOFrZ2vjG185pXO99a29nS1s63pnZe92rnO2s7W9na+c7UjttV0O+t7Wxta+d7UztverXzg7WdbWzt/GBq5y2vdn60trOtrZ0fTe287dXOT9Z2trO185OpnXec2in3sLazve3f0O1hauddr3YSazs72NpJTO2859VOam2nl62d1NTO+17tZNZ2drS1k5na+cCrnZK1nd62dkqmdj70aqdsbWcnWztlUzsfebVTsbazs62diqmdj73aqVrb2cXWTtXUzide7dSs7fSxtVMztfOpVzt1azu72tqpm9r5zKudLms7u9na6TK187lXO+NZ29nd1s54pna+8GpnfGs7fW3tjG9q50uvdiawtrOHrZ0JTO185dXOhNZ29rS1M6Gpna+92pnI2k4/WzsTmdr5xqudia3t7GVrZ2JTO996tTOJtZ3+tnYmMbXznVc7k1rbGWBrZ1JTO997tTOZtZ2BtnYmM7Xzg1c7k1vb2dvWzuSmdn70amcKazuDbO1MYWrnJ692prS2s4+tnSkt7VR7eLUzlbWdwbZ2pjK1k3i1M7W1nX1t7Uxtaif1amcaazv72dqZxtRO5tXOtNZ29re1M62pnZJXO9NZ2znA1s50pnbKXu1Mb23nQFs705vaqXi1M4O1nYNs7cxgaqfq1c6M1nYOtrUzo6mdmlc7M1nbOcTWzkymdupe7fS0tnOorZ2epna6vNqZ2drOYbZ2Zja1M56lnTH+SZPyyB4rSaUhFZHKQ1J5WCqPSOVRqTwmlcel8oRUnpTKU1J5WirPSOVZqTwnleelMlIqL0jlRam8JJWXpfKKVF6VymtSeT18dR6+bg5f0YavNcNXgeHrs/CVU/iaJny1Eb4OCJfQw2XncKk2XN4MlwTDZbRw6SlcrgmXOMJlgfBROnz8DB/Zwsec8NEgcDoQNLAtUCfwILylhrehcOoOp7twigiHVdgVw+YLLRf+JztG/VHWg6a/bquOb1ivox86VB5xR/gVqU7Q8hOTRi2UZQ8Li16dwLTjVE0XmaoTttjgnT83OGHBlW57bMY9piWfqPVNM5FUJ2550yzbwqaZ2LZpTJdkqpO0vmlCg5P4bZrUumkmbX3TTCrVyVreNMu0sGkms20a0wWM6uStb5rQ4OR+myazbpopWt80U0h1yrGWvFmlbAXL085Mfy9v6msqj/fzUfvNlMbNVJ3KtoPZLlpM3foOFjbT1H47WMm6g03T+g42jVSnbfnYX7qFY39a26axfSaervVNExqczm/TlK2bZvrWN830Up2h9cc/jlry+6wbZwbbxrF9hpyx9Y0TWpzRb+NUrBtnptY3zkxS7VngwQHVmS0rfJw9Vq/geben9bw7s23/sX0snKX1/SdshVn89p+qdf+ZtfX9Z1apzlbs4L7XuhVns22c2Uwtzt76xgktzl7kEJnDtPOPkweLjHpRof2nOoftM+ychtVmeJBNdc6exXbze8flp765xlEzc/WMjobsR6nOHY2VppPqPPHYDFKdNx4L54D54rGZpTp/PBZ2xwXisdmlumA8NqdUF4rH5pbqwvHYvFJdJB6bX6qLxmMLSnWxeGxhqS4ejy0q1SXiscWlumQ8tqRUl4rHlpbq0vHYslJdJh5bXqrLxmMrSnW5eGxlqS4fj60q1RXisdWlumI8tqZUV4rH1pbqyvHYulJdJR5bX6qrxmMbSnW1eGxjqa4ej20q1TXisc2lumY8tqVU14rHtpbq2vHYtlJdJx7bXqrrxmO9pLpePNZbquvHYztLdYN4rI9UN4zHdpPqRvFYX6luHI/tKdVN4rG9pLppPDZAqpvFY3tLdfN4LByYW8Rj+0p1y3hsf6luFY8dKNWt47GDpbpNPHaoVLeNxw6X6nbx2BCpbh+PHSXVHeKxY6TaKx47Tqo7xmPHS7V3PHaCVHeKx06U6s7x2MlS3SUeGybVPvHYCKnuGo+dKtXd4rHTpbp7kbfFvpZPI5ZHXZZbf2Cp9VGX1b62t8U9Wqxve3a87cGT1T09TFDdI0xsa75fS5Qa9c8vVPtJda8i17VvN1hxeetDqqv9PfaaFlbcgNZXXDj5DSzwGSjsyXtZd3nbvXPVvUwt7t1yi6PsNCgaG2WnfeKxYKfB8Viw077xWLDTfvFYsNP+8Viw0wHxWLDTgfFYsNNB8Viw08HxWLDTIfFYsNOh8Viw02HxWLDT4fFYsNMR8Viw05B4LNjpyHgs2OmoeCzY6eh4LNjpmHgs2OnYeCzY6bh4LNjpd/FYsNPx8Viw0+/jsWCnE+KxYKc/xGPBTifGY8FOJ8VjwU4nx2PBTkPjsWCnYfFYsNPweCzYaUQ8Fux0SjwW7HRqPBbsdFo8Fux0ejwW7PTHeCzY6U/xWLDTGfFYsNOf47Fgp7/EY+H0cWY8Fuz013gs2Olv8Viw01nxWLDT2fFYsNM58Viw07nxWLDTefFYsNP58Viw0wXxWLDThfFYsNNF8Viw09/jsWCni+OxYKdL4rFgp0vjsWCny+KxYKfL47Fgp3/EY8FOV8RjwU7/jMbK90n1ynjsAaleFY81pHp1PPaQVK+Jxx6R6rXx2GNSvS4ee0Kq18djT0n1hnjsGaneGI89J9V/xWMjpXpTPPaiVG+Ox16W6i3x2KtSvTUee12qt8Vjb0r19njsbaneEY+9K9U747H3pXpXPPahVO+Oxz6W6j3x2KdSvTce+1yq98VjX0r1/njsa6k+EI99K9UH47HvpdqIx8J7o0RjlfAu+1A8lkr14XisJNVH4rGKVB+Nx2pSfSwe65Lq4/FY+Or+iXhsQqk+GY9NLNWn4rHwBebT8djkUn0mHptSqs/GY1NL9bl4bFqpPh+PhWvxI+OxGaX6QjzWU6ovxmOzSPWleGw2qb4cj80h1Vfisbmk+mo8No9UX4vH5pPq6/HYAlJ9Ix5bSKpvxmOLSPWteGwxqb4djy0h1XfisaWk+m48toxU34vHlpPq+/HYClL9IB5bSaofxmOrSPWjeGw1qX4cj60h1U/isbWk+mk8to5UP4vH1pPq5/HYBlL9Ih7bSKpfxmObSPWreGwzqX4dj20h1W/isa2k+m08to1Uv4vHtpPq9/HYDlL9IR7bUao/xmM7SfWneGwXqY31z9jtKrUkHttdamk8tofUsnisn9RK8Vh/qZXjsYFSq8Rjg6RWjccGS60Wj+0ntXo8doDUuuKxg6Q2Xjx2iNTGj8cOk9oE8dgRUpswHjtSahPFY0dLbeJ47FipTfKLe9kqI3ucFT5/hI8b4dNF+DARPjuEjwrhk0H4IBDcH5gfVB8QH8weiB5EHgAevB14HTQd8BysHGgcJBzgG5wbWBsUG9AajBpIGgQawBl8GTgZ9BiwGGwYKBjkF6AXXBcYF9QWkBZMFggWxBWAFTwV+BS0FHAULBToE6QTYBMcE9gSlBJQEgwSyBGEEUAR/BC4EHQQMBDe+8NbfXhnD2/k4X07vE2Hd+XwJhzec8NbbHhHDW+g4f0yvD2Gd8Pw5hfe68JbW3gnC29c4X0qvC2Fd6HwphPeY8JbSngHCW8Y4f0hvB2Es3842YdzeziVhzN3OFGH83I4DYezbjjJhnNqOIWGM2Y4QYbzYTj9hbNdOLmFc1k4dYUzVTgxhfNQOO2Es0w4qYRzSDhlhDNEOCGE4z8c7uHoDgdzOHbDoRqOzHAghuMuHGbhqAoHUThmwiESjohwAIT9PezeYW8OO2/YV8OuGfbEsOOF/SzsVmEvCjtN2EfCLhH2gLDBC9/rVw3M3tv00X68g+9q/rm31dtgfq4/0PQP/1UHWpayNqllLlMvo4+ryqivygaEuQtcE6xN9pteEyz2z9/UJjPtAjXLfV1FdsHa5Lb6U7S42e4IvyK1KV2XaarWl2kqqU1d5D7LW40XxmpTmq531Uz3WtWm8dro09jOO4c7nXdqU5vOOzXTH2rVpjWddw5v+bwzameZtsh5Z7rf9LyTFjvvTNfsS4OPfvrpJ+M/FFib3mMpR+0o05uWsrqnaSlnMCxldL6YQWozFlxy2zlsptbPYTNJrWeBm2OCz6aynsVmtJ3FTH9uVJvZ6yw2s+0sdpTXWayn7Sxmur+rNovpLHZU62exsLvMUuQsNutvehbLip3FZrUdZbN57YKz2erP3vpRPrvU5nBdpjlbX6Y5pTZXkduhzXqaw3bemcPU4NxeG31u23nnOK/zzly2885cprU0j+m8c1zr552ws8xT5Lwz72963ikVO+/Ma3DJD1Y9zeexlKN2lPlMS2nU0/yGpYzOF/NLbYFCUqncZr3TdC7byW5Bn1tqTHeG1hZq8dqB8UBZ+De9E9j15pXaIi3f2VFbRGqLFjh4bw6/Ztq4tcUcrmclo86MYckXc70wsnjra3NxqS1RbG0uYVubSzp8Sv95bYYlX/JXfLhs8srUeN9cbanW1/lSUlu6DZZ8GY9jf9SesbRtz1jW4ZPPz3vGMmFuV0Iv1/o2X05qyxdbm8vb1uYKDp77eW2GJV/hVzCkyStL1r11xdbX+YpSW6nYBZOZrR9cFrB9cFnA1OLKXh9cxumGWKXFpRxu3dFXsrazsu0oXbX1fX2V8FtFPGjz/mo+HlzdJL1XTa+y3AL/i3+BPRs2+p9At/xb8IZ9fFj3v41eW8P2b6O3elCsHGY2/cP1tTWbb4Ai1dcc6nGoh4Ooarw2OtzrVLOgrf6IFusbD4W1TG+CpnO25fnXLV/GCecX07/uuoqp27U9NmJtrTCx7QS7jqG+4S8fa+v0/OU5JWnxnGKgwVDbTMXWabM1tWqY1uaEtU3rfd1WT9Kl4d0r1Hwl5m7TzrJaePtpci4LX9S9PHp7/u8XJ6P+z/DR5//1Rv+4vu2twLK/rWd72fo9C10jrNxtOwWe4nL0jtogtvqntnoKPuV/Tzv8458XYD3TLry+6RR8iulVpxr2v5avt9fWDq0M9XmX2uC3a75HofuTRjW/ge09YMNx9B6wYesH26g3U8sKt72Zrml61UYOqzu8PWw0tNVTenrqOHd3axOuNK4nXLGFCYebOWx269AWylvOIKtllrd8y+PGmn9sHPMtc+PRP25iRc9G4+gg3rjnr3RH+GJnTtMJaqHwNUhzd3xd1B2bjv5xs3Hnjk1tL9us2FNNqnPa3vdPc3HHqA1iq3+6jzs2NZ2/NzO9qZ5metXphv2vdXdsFFpxcsfmzduqmZqvtb4VrU/ZqjSsu/vctof4NEyrZguvdsTazjy2dsTUzpZe7TxkbWdeWzsPmdrZyqudh63tzGdr52FTO1t7tfOItZ35be08YmpnG692HrW2Y/sWpvKoqZ1tvdp5zNrOgrZ2HjO1s51XO49b21nI1s7jpna292rnCWs7C9vaecLUzg5e7TxpbWcRWztPmtrp5dXOU9Z2FrW185SpnR292nna2s5itnaeNrXT26udZ6ztLG5r5xlTOzt5tfOstZ0lbO08a2pnZ692nrO2s6StnedM7ezi1c7z1naWsrXzvKmdPl7tjLS2s7StnZGmdnb1aucFazvL2Np5wdTObl7tvGhtZ1lbOy+a2tndq52XrO0sZ2vnJVM7fb3aednazvK2dl42tbOHVzuvWNtZwdbOK6Z29vRq51VrOyva2nnV1E4/r3Zes7azkq2d10zt7OXVzuvWdla2tfO6qZ3+Xu28YW1nFVs7b5jaGeDVzpvWdla1tfOmqZ2BXu28ZW1nNVs7b5na2durnbet7axua+dtUzuDvNp5x9rOGrZ23jG1s49XO+9a21nT1s67pnYGe7XznrWdtWztvGdqZ1+vdt63tmO7Za7yvqmd/bza+cDazjq2dj4wtbO/VzsfWttZ19bOh6Z2DvBq5yNrO+vZ2vnI1M6BXu18bG1nfVs7H5vaOcirnU+s7Wxga+cTUzsHe7XzqbWdDW3tfGpq5xCvdj6ztrORrZ3PTO0c6tXO59Z2Nra187mpncO82vnC2s4mtna+MLVzuFc7X1rb2dTWzpemdo7waucrazub2dr5ytTOEK92vra2s7mtna9N7Rzp1c431na2sLXzjamdo7za+dbazpa2dr41tXO0VzvfWdvZytbOd6Z2jvFq53trO1vb2vne1M6xXu38YG1nG1s7P5jaOc6rnR+t7Wxra+dHUzu/82rnJ2s729na+cnUzvFO7VR7WNvZ3vavDfUwtfN7r3YSazs72NpJTO2c4NVOam2nl62d1NTOH7zayazt7GhrJzO1c6JXOyVrO71t7ZRM7Zzk1U7Z2s5OtnbKpnZO9mqnYm1nZ1s7FVM7Q73aqVrb2cXWTtXUzjCvdmrWdvrY2qmZ2hnu1U7d2s6utnbqpnZGeLXTZW1nN1s7XaZ2TvFqZzxrO7vb2hnP1I7pr7/H+CdNqiN7rCS1LaS2pdS2ktrWUttGattKbTupbS+1HaTWS2o7Sq231HaS2s5S20VqfaS2q9R2k9ruUusrtT2ktqfU+kltL6n1D1+dh6+bw1e04WvN8FVg+PosfOUUvqYJX22ErwPCJfRw2Tlcqg2XN8MlwXAZLVx6CpdrwiWOcFkgfJQOHz/DR7bwMSd8NAicDgQNbAvUCTwIb6nhbSicusPpLpwiwmEVdsWw+ULLhf/JjlF/lLW57e+hLX9dN/qhQ9VRj6k6TWqnt/zEpFELZdnDRi366baHT5xuavCPLTZ4588N/rHgSrct+UamJf9T65vmT1I7o+VNs3ILm+YMW4NnmBr8c+ubJjT4Z79Nk1o3zV9a3zR/kdqZLW+alVrYNGfaNs2Zpgb/2vqmCQ3+1W/TZNZN87fWN83fpHbWWEverFK2muXp1qa/lzf1dbbH+/motX+WdTOdbdvBzjK1c07rO1jYTOf47WAl6w52bus72LlSO6/lY3/FFo7982yb5jxTg+e3vmlCg+f7bZqyddNc0PqmuUBqF7b++MdRS76JdeNcaNs4F5pavKj1jRNavMhv41SsG+fvrW+cv0vt4iIPDrjEssLH2WP1Cp53L7ZuhUts+8/FplVzaev7T9gKl/rtP1Xr/nNZ6/vPZVK7vNjBvbF1K15u2ziXm1r8R+sbJ7T4jyKHyBWmnX+cPFhk1IuK7T9X2D7D/tOw2iwPsvlnz2KLufG4/NR35Thq5sqe0dGQ/Si1q6Kx0nRSuzoem0Fq18RjM0nt2nhsZqldF4/NKrXr47HZpXZDPDan1G6Mx+aW2r/isXmldlM8Nr/Ubo7HFpTaLfHYwlK7NR5bVGq3xWOLS+32eGxJqd0Rjy0ttTvjsWWldlc8trzU7o7HAubuicfC5+5747FVpXZfPLa61O6Px9aU2gPx2NpSezAeW1dqjXhsfalJPLah1B6KxzaW2sPx2KZSeyQe21xqj8Zj4arbY/FYuAb3eDwWrsg9EY+F63NPxmPhat1T8Vi4dvd0PBau5D0Tj4Xres/GY+Eq33PxWLjm93w8Fq4AjozHwvXAF+KxcHXwxXgsXCt8KR4LB+bL8Vi4jvhKPBauKr4aj4VrjK/FY+GK4+vxWLj++EY8Fq5GvhmPhWuTb8Vj4Url2/FYuG75TjwWrmK+G4+Fa5rvxWPhCuf78Vi43vlBPBaufn4Yj4VroR/FY+HK6Mfx2KlS+yQeO11qnxZ5W/zM8mnE8qjLcusPLDU/6vIz29vi5y3Wtz073vjgyS9cTPB5mNjW/JctUernf37hS6l9VeS69roGK65qfkj11y57jX3FfdP6ivtGat8W+AwU9uSvrLv81zZi2e47/a7lFkfZ6ftobJSdfojHgp1+jMeCnX6Kx2aWelwj2KmexGOzSz2Nx+aUehaPzS31Ujw2r9TL8dj8Uq/EYwtKvRqPLSz1Wjy2qNTr8djiUu+Kx5aU+njx2NJSHz8eW1bqE8Rjy0t9wnhsRalPFI+tLPWJ47FVpT5JPLa61CeNx9aU+mTx2NpSnzweW1fqU8Rj60t9ynhsQ6lPFY9tLPWp47FNpT5NPLa51KeNx7aU+nTx2NZSnz4e21bqM8Rj20t9xnisl9Rnisd6S71nPLaz1GeOx/pIfZZ4bDepzxqP9ZX6bPHYnlKfPR7bS+pzxGMDpD5nPLa31OeKx/aR+tzx2L5Snyce21/q88ZjB0p9vnjsYKnPH48dKvUF4rHDpb5gPDZE6gvFY0dJfeF47BipLxKPHSf1ReOx46W+WDx2gtQXj8dOlPoS8djJUl8yHhsm9aXisRFSXzoeO1Xqy8Rjp0t92WisfJ/Ul4vHHpD68vFYQ+orxGMPSX3FeOwRqa8Ujz0m9ZXjsSekvko89pTUV43HnpH6avHYc1JfPR4bKfU14rEXpb5mPPay1NeKx16V+trx2OtSXycee1Pq68Zjb0t9vXjsXamvH4+9L/UN4rEPpb5hPPax1DeKxz6V+sbx2OdS3yQe+1Lqm8ZjX0t9s3jsW6lvHo99L/Ut4rEfpb5lNFbpIfWt4rFU6lvHYyWpbxOPVaS+bTxWk/p28ViX1LePx8aX+g7x2IRS7xWPTSz1HeOxSaXeOx6bXOo7xWNTSn3neGxqqe8Sj00r9T7x2PRS3zUem1Hqu8VjPaW+ezw2i9T7xmOzSX2PeGwOqe8Zj80l9X7x2DxS3ysem0/q/eOxBaQ+IB5bSOoD47FFpL53PLaY1AfFY0tIfZ94bCmpD47HlpH6vvHYclLfLx5bQer7x2MrSf2AeGwVqR8Yj60m9YPisTWkfnA8tpbUD4nH1pH6ofHYelI/LB7bQOqHx2MbSf2IeGwTqQ+JxzaT+pHx2BZSPyoe20rqR8dj20j9mHhsO6kfG4/tIPXj4rEdpf67eGwnqR8fj+0i9d/HY7tK/YR4bHep/yEe20PqJ8Zj/aR+UjzWX+onx2MDpT40Hhsk9WHx2GCpD4/H9pP6iHjsAKmfEo8dJPVT47FDpH5aPHaY1E+Px46Q+h/jsSOl/qd47GipnxGPHSv1P//iXrbayB5nhc8f4eNG+HQRPkyEzw7ho0L4ZBA+CAT3B+YH1QfEB7MHogeRB4AHbwdeB00HPAcrBxoHCQf4BucG1gbFBrQGowaSBoEGcAZfBk4GPQYsBhsGCgb5BegF1wXGBbUFpAWTBYIFcQVgBU8FPgUtBRwFCwX6BOkE2ATHBLYEpQSUBIMEcgRhBFAEPwQuBB0EDIT3/vBWH97Zwxt5eN8Ob9PhXTm8CYf33PAWG95RwxtoeL8Mb4/h3TC8+YX3uvDWFt7JwhtXeJ8Kb0vhXSi86YT3mPCWEt5BwhtGeH8Ibwfh7B9O9uHcHk7l4cwdTtThvBxOw+GsG06y4ZwaTqHhjBlOkOF8GE5/4WwXTm7hXBZOXeFMFU5M4TwUTjvhLBNOKuEcEk4Z4QwRTgjh+A+Hezi6w8Ecjt1wqIYjMxyI4bgLh1k4qsJBFI6ZcIiEIyIcAGF/D7t32JvDzhv21bBrhj0x7HhhPwu7VdiLwk4T9pGwS4Q9IGzw4vf6fRE+0Jo+2o8/f4FLC4YrPeHTv+0fejf9oV79L5a5TL2MPq5qo74q+ybMXeCaYP3M3/SaYLF//qZ+pmkXqP/V5erSF2FiW/2/tbjZ7gi/IvWzXJfp7NaX6Wypn1PkPsu1jRfG6meZrnfVTfda1c/12ujn2s47Czudd+rnmM479XNMa+k803ln4ZbPO6N2lvOKnHfO/03PO2mx8875zb40+Oinn34y/kOB9QtcljLsKBfYltL0UIn6hYaljM4XF0r9ooJLbjuH/b31c9jfpX5xgZtjwsX4s61nsYtsZ7GLTC1e4nUWu8R2Flvc6yx2se0sZrq/q36p6Sy2eOtnsbC7XFrkLHbZb3oWy4qdxS6zHWWXe+2Cl9vq/6P1o/wfUr/CdZn+2foy/VPqVxa5Hdqspyts550rTA1e5bXRr7Kdd5b2Ou9caTvvXGlaS1ebzjtLt37eCTvL1UXOO9f8puedUrHzzjUGl/xg1dO1LksZdpRrbUtp09N1hqWMzhfXSf36YlJZx3oL55W2k90NPrfUmO4Mrd/Y4rUD44Hyr9/0TmDXm1fqN7V8Z0f9JqnfXGCZwsXKm00bt36Lw/WsZNSZMSz5La4XRm5tfW3eKvXbiq3N22xr83aHT+k/r82w5Lf/ig+XTV6ZGu+bq9/R+joP/7uzDZb8LpdjP+wZd9r2jLsdPvn8vGfcFeZ2JfQ9rW/ze6R+b7G1ea9tbd7n4Lmf12ZY8vt+BUOavLJk3Vvvb32d3y/1B4ox5BLrB5frbR9crje1+KDXB5dxuiEaLS7lcOuO/oC1nQdtR6m0vq83wm8V8aDN+w/5ePBhk/ROMb3q1JaPsuxHqT8S35EWvp1+NB4L31U/Fo+Fb64fj8fC99hPxGPhW+0n47HwHfdT8Vj4xvvpeCx8//1MPBa+DX82HgvfjT8Xj4Vvyp+Px8L35iPjsfAt+gvxWPhO/cV4LHzD/lI8Fr5vfzkeC9++vxKPhe/iX43Hwjfzr8Vj4Xv61+Ox8K39G/FY+A7/zXgsHIVvxWPhLPd2PBa+7X8nHgvf/b8bj20o9ffisY2l/n48tqnUP4jHNpf6h/HYllL/KB7bWuofx2PbSv2TeGx7qX8aj/WS+mfxWG+pfx6P7Sz1L+KxPlL/Mh7bTepfxWN9pf51PLan1L+Jx/aS+rfx2ACpfxeP7S31se5s30fqY93Zvq/Ux7qzfX+pj3Vn+4HSNdad7QdL11h3th8qXWPd2X64dI11Z/sQ6RrrzvajpGusO9uPka6x7mw/TrrGurP9eOka6872E6RrrDvbT5Suse5sP1m6xrqzfZh0jXVn+wjpGuvO9lOla6w720+XrvjO9vJ90hXf2V5+QLriO9vLDemK72wvPyRd8Z3t5UekK76zvfyYdMV3tpefkK74zvbyU9IV39lefka64jvby89JV3xne3mkdMV3tpdflK74zvbyy9IV39leflW64jvby69LV3xne/lN6YrvbC+/LV3xne3ld6UrvrO9/L50xXe2lz+UrvjO9vLH0hXf2V7+VLriO9vLn0tXfGd7+Uvpiu9sL38tXfGd7eVvpSu+s738vXTFd7aXf5Su+M72Sg/piu9sr6TSFd/ZXilJV3xne6UiXfGd7ZWadMV3tle6pCu+s70yvnTFd7ZXJpSu+M72ysTSFd/ZXplUuuI72yuTS1d8Z3tlSumK72yvTC1d8Z3tlWmlK76zvTK9dMV3tldmlK74zvZKT+mK72yvzCJd8Z3tldmkK76zvTKHdMV3tlfmkq74zvbKPNIV39lemU+64jvbKwtIV3xne2Uh6YrvbK8sIl3xne2VxaQrvrO9soR0xXe2V5aSrvjO9soy0hXf2V5ZTrriO9srK0hXfGd7ZSXpiu9sr6wiXfGd7ZXVpCu+s72yhnTFd7ZX1pKu+M72yjrSFd/ZXllPuuI72ysbSFd8Z3tlI+mK72yvbCJd8Z3tlc2kK76zvbKFdI11Z/tW0jXWne3bSNdYd7ZvJ11j3dm+g3SNdWf7jtI11p3tO0nXWHe27yJdY93Zvqt0jXVn++7SNdad7XtI11h3tveTrrHubO8vXWPd2T5Qusa6s32QdI11Z/tg6Rrrzvb9pGusO9sPkK6x7mw/SLrGurP9EOka6872w6RrrDvbj5Cuse5sP1K6xrqz/WjpGuvO9mOla0Drn896GD76rOHxRUFiKLymR+HUUHgtj8KWx6etXaRws0nXsXxUzp5stfQwQ+l1PVZkyVB4PY/CZUPh9T0KVwyFN/AoXDUU3tCjsOGBzMlGHoXrhsIbexTuMhTexKPweIbCm3oUHt9QeDOPwhMYCm/uUXhCQ+EtPApPZCi8pUfhiQ2Ft/IoPImh8NYehSc1FN7Go/BkhsLbehSe3FB4O4/CUxgKb+9ReEpD4R08Ck9lKNzLo/DUhsI7ehSexlC4t0fhaQ2Fd/IoPJ2h8M4ehac3FN7Fo/AMhsJ9PArPaCi8q0fhmQyFd/Mo3NNQeHePwjMbCvf1KDyLofAeHoVnNRTe06PwbIbC/Tw+7e/lMWl/j0siA0yXRJ7z2DqzGxZvYIH7SAwPu7PevPOF1G+wbJq9Pbb3II9J9/GYdLDHpPt6TLqfx6T7e0x6gMekB3pMepDHpAd7THqIx6SHekx6mMekh3tM2jjCZdYhLrMe6TLrUS6zHu0y6zEusx7rMutxLrP+zmXW411m/b3LrCe4zPoHl1lPdJn1JJdZT3aZdajLrMNcZh3uMusIl1lPcZn1VJdZT3OZ9XSXWf/oMuufXGY9w2XWP7vM+heXWc90mfWvLrP+zWXWs1xmPdtl1nNcZj3XZdbzXGY932XWC1xmvdBl1otcZv27y6wXu8x6icusl7rMepnLrJe7zPoPl1mvcJn1ny6zXuky61Uus17tMus1LrNe6zLrdS6zXu8y6w0us97oMuu/XGa9yWXWm11mvcVl1ltdZr3NZdbbXWa9w2XWO11mvctl1rtdZr3HZdZ7XWa9z2XW+11mfcBl1gddZm24zCousz7kMuvDLrM+4jLroy6zPuYy6+Musz7hMqvLH+80nnKZ9WmXWZ9xmfVZl1mfc5n1eZdZR7rM+oLLrC+6zPqSy6wvu8z6isusr7rM+prLrK+7zPqGy6xvusz6lsusb7vM+o7LrO+6zPqey6zvu8z6gcusH7rM+pHLrB+7zPqJy6yfusz6mcusn7vM+oXLrF+6zPqVy6xfu8z6jcus37rM+p3LrN+7zPqDy6w/usz6k8eskvTwmTbxmTb1mTbzmbbkM23ZZ9pKi9MOtz7IfgvTX6uEF15letRsMuppFs3n28KrnS2t7Vxta6dmamdLr3a2srZzja2duqmdrbza2drazrW2drpM7Wzt1c421naus7Uznqmdbbza2dbaju2p08n4pna29WpnO2s7N9jamcDUznZe7WxvbedGWzsTmtrZ3qudHazt/MvWzkSmdnbwaqeXtZ2bbO1MbGqnl1c7O1rbudnWziSmdnb0aqe3tZ1bbO1Mamqnt1c7O1nbudXWzmSmdnbyamdnazu32dqZ3NTOzl7t7GJt53ZbO1OY2tnFq50+1nbusLUzpamdPl7t7Gpt505bO1OZ2tnVq53drO3cZWtnalM7u3m1s7u1nbtt7Uxjamd3r3b6Wtu5x9bOtKZ2+nq1s4e1nXtt7UxnamcPr3b2tLZzn62d6U3t7OnVTj9rO/fb2pnB1E4/r3b2srbzgK2dGU3t7OXVTn9rOw/a2pnJ1E5/r3YGWNtp2NrpaWpngFc7A63tiK2dmU3tDPRqZ29rOw/Z2pnF1M7eXu0MsrbzsK2dWU3tDPJqZx9rO4/Y2pnN1M4+Xu0MtrbzqK2d2U3tDPZqZ19rO4/Z2pnD1M6+Xu3sZ23ncVs7c5ra2c+rnf2t7Txha2cuUzv7e7VzgLWdJ23tzG1q5wCvdg60tvOUrZ15TO0c6NXOQdZ2nra1M6+pnYO82jnY2s4ztnbmM7VzsFc7h1jbedbWzvymdg7xaudQazvP2dpZwNTOoV7tHGZt53lbOwua2jnMq53Dre2MtLWzkKmdw73aOcLazgu2dhY2tXOEVztDrO28aGtnEVM7Q7zaOdLazku2dhY1tXOkVztHWdt52dbOYqZ2jvJq52hrO6/Y2lnc1M7RXu0cY23nVVs7S5jaOcarnWOt7bxma2dJUzvHerVznLWd123tLGVq5zivdn5nbecNWztLm9r5nVc7x1vbedPWzjKmdo73auf31nbesrWzrKmd33u1c4K1nbdt7SxnaucEr3b+YG3nHVs7y5va+YNXOyda23nX1s4KpnZO9GrnJGs779naWdHUzkle7Zxsbed9Wzsrmdo52audodZ2PrC1s7KpnaFe7QyztvOhrZ1VTO0M82pnuLWdj2ztrGpqZ7hXOyOs7Xxsa2c1UzsjvNo5xdrOJ7Z2Vje1c4pXO6da2/nU1s4apnZOLdCOaSn/aXlh/Uap/8v2h0aF/j3o5tOuZVlL9Ud8iq9tKv6oT3HTvwxdf8yn+Lqm4o/7FF/PVPwJn+Lrm4o/6VN8A1Pxp3yKb2gq/rRP8Y1MxZ/xKb6xqfizPsU3MRV/zqf4pqbiz/sU38xUfKRP8c1NxV/wKb6FqfiLPsW3NBV/yaf4VqbiL/sU39pU/BWf4tuYir/qU3xbU/HXfIpvZyr+uk/x7U3F3/ApvoOp+Js+xXuZir/lU3xHU/G3fYr3NhV/x6f4Tqbi7/oU39lU/D2f4ruYir/vU7yPqfgHPsV3NRX/0Kf4bqbiH/kU391U/GOf4n1NxT/xKb6HqfinPsX3NBX/zKd4P1Pxz32K72Uq/oVP8f6m4l/6FDf9u9j1r3yKDzQV/9qn+N6m4t/4FB9kKv6tT/F9TMW/8yk+2FT8e5/i+5qK/+BTfD9T8R99iu9vKv6TT/EDLMW7evgUP9BUPPEpfpCpeOpT/GBT8cyn+CGm4iWf4oeaipd9ih9mKl7xKX64qXjVp/gRpuI1n+JDTMXrPsWPNBXv8il+lKn4eD7FjzYVH9+n+DGm4hP4FD/WVHxCn+LHmYpP5FP8d6biE/sUP95UfBKf4r83FZ/Up/gJpuKT+RT/g6n45D7FTzQVn8Kn+Emm4lP6FD/ZVHwqn+JDTcWn9ik+zFR8Gp/iw03Fp/UpPsJUfDqf4qeYik/vU/xUU/EZfIqfZio+o0/x003FZ/Ip/kdT8Z4+xf9kKj6zT/EzTMVn8Sn+Z1PxWX2K/8VUfDaf4meais/uU/yvpuJz+BT/m6n4nD7FzzIVn8un+Nmm4nP7FD/HVHwen+LnmorP61P8PFPx+XyKn28qPr9P8QtMxRfwKX6hqfiCPsUvMhVfyKf4303FF/YpfrGp+CI+xS8xFV/Up/ilpuKL+RS/zFR8cZ/il5uKL+FT/B+m4kv6FL/CVHwpn+L/NBVf2qf4labiy/gUv8pUfFmf4lebii/nU/waU/HlfYpfayq+gk/x60zFV/Qpfr2p+Eo+xW8wFV/Zp/iNpuKr+BT/l6n4qj7FbzIVX82n+M2m4qv7FL/FVHwNn+K3moo7/V3qbabia/kUv91UfG2f4neYiq/jU/xOU/F1fYrfZSq+nk/xu03F1/cpfo+p+AY+xe81Fd/Qp/h9puIb+RS/31R8Y5/iD5iKb+JT/EFT8U19ijdMxTfzKS6m4pv7FH/IVHwLn+IPm4pv6VP8EVPxrXyKP2oqvrVP8cdMxbfxKf64qfi2PsWfMBXfzqf4k6bi2/sUf8pUfAef4k+bivfyKf6MqfiOPsWfNRXv7VP8OVPxnXyKP28qvrNP8ZGm4rv4FH/BVLyPT/EXTcV39Sn+kqn4bj7FXzYV392n+Cum4n19ir9qKr6HT/HXTMX39Cn+uql4P5/ib5iK7+VT/E1T8f4+xd8yFS/yT7A1nbW2ttQ2ND3I7iGpP2x7kF3Lz6SwTfuOz7Tv+kz7ns+07/tM+4HPtB/6TPuRz7Qf+0z7ic+0n/pM+5nPtJ/7TPuFz7Rf+kz7lc+0X/tM+43PtN/6TPudz7Tf+0z7g8+0P/pM+5PLtGkPn2kTn2lTn2kzn2lLPtOWfaat+Exb9Zm25jNt3WfaLp9px/OZdnyfaSfwmXZCn2kn8pl2Yp9pJ/GZdlKfaSfzmXZyn2mn8Jl2Sp9pp/KZdmqfaafxmXZan2mn85l2ep9pZ/CZdkafaWfymbanz7Qz+0w7i8+0s/pMO5vPtLP7TDuHz7Rz+kw7l8+0c/tMO4/PtPP6TDufz7Tz+0y7gM+0C/pMu5DPtAv7TLuIz7SL+ky7mM+0i/tMu4TPtEv6TLuUz7RL+0y7jM+0y/pMu5zPtMv7TLuCz7Qr+ky7ks+0K/tMu4rPtKv6TLuaz7Sr+0y7hs+0a/pMu5bPtGv7TLuOz7Tr+ky7ns+06/tMu4HPtBv6TLuRz7Qb+0y7ic+0m/pMu5nPtJv7TLuFz7Rb+ky7lc+0W/tMu43PtNv6TLudz7Tb+0y7g8+0vXym3dFn2t4+0+7kM+3OPtPu4jNtH59pd/WZdjefaXf3mbavz7R7+Ey7p8+0/Xym3ctn2v4+0w7wmXagz7R7+0w7yGfafXymHewz7b4+0+7nM+3+PtMe4DPtgT7THuQz7cE+0x7iM+2hPtMe5jPt4T7THuEz7RCfaY/0mfYon2mP9pn2GJ9pj/WZ9jifaX/nM+3xPtP+3mfaE3ym/YPPtCf6THuSz7Qn+0w71GfaYT7TDveZdoTPtKf4THuqz7Sn+Ux7us+0f/SZ9k8+057hM+2ffab9i8+0Z/pM+1efaf/mM+1ZPtOe7TPtOT7Tnusz7Xk+057vM+0FPtNe6DPtRT7T/t1n2ot9pr3EZ9pLfaa9zGfay32m/YfPtFf4TPtPn2mv9Jn2Kp9pr/aZ9hqfaa/1mfY6n2mv95n2Bp9pb/SZ9l8+097kM+3NPtPe4jPtrT7T3uYz7e0+097hM+2dPtPe5TPt3T7T3uMz7b0+097nM+39PtM+4DPtgz7TNnymFZ9pH/KZ9mGfaR/xmfZRn2kf85n2cZ9pn/CZ9kmfaZ/ymfZpn2mf8Zn2WZ9pn/OZ9nmfaUf6TPuCz7Qv+kz7ks+0L/tM+4rPtK/6TPuaz7Sv+0z7hs+0b/pM+5bPtD7Pv019nn+b+jz/NvV5/m3q8/zb1Of5t6nP829Tn+ffpj7Pv019nn+bfuozrc/zb1Of59+mPs+/TX2ef5v6PP829Xn+berz/NvU5/m3qc/zb1Of59+mPs+/TX2ef5v6PP8283n+bebz/NvM5/m3mc/zbzOf599mPs+/zXyef5v5PP8283n+bebz/NvM5/m3mc/zbzOf599mPs+/zXyef5v5PP8283n+bebz/NtsUp9pfZ5/m/k8/zbzef5t5vP828zn+beZz/NvM5/n32Y+z7/NfJ5/m/k8/zbzef5t5vP828zn+beZz/NvM5/n32Y+z7/NfJ5/m/k8/zbzef5t5vP828zn+beZz/NvM5/n32Y+z7/NfJ5/m/k8/zbzef5t5vP828zn+beZz/NvM5/n32aL+Ezr8/zbzOf5t5nP828zn+ffZj7Pv818nn+b+Tz/NvN5/m3m8/zbzOf5t5nP828zn+ffZj7Pv818nn+b+Tz/NvN5/m3m8/zbzOf5t5nP828zn+ffZj7Pv818nn+b+Tz/NvN5/m3m8/zbzOf5t5nP828zn+ffZj7Pv818nn+b+Tz/NtvEZ1qf599mPs+/zXyef5v5PP8283n+bebz/NvM5/m3mc/zbzOf599mPs+/zXyef5v5PP8283n+bebz/NvM5/m3mc/zbzOf599mPs+/zXyef5v5PP8283n+bebz/NvM5/m3mc/zbzOf599mPs+/zXyef5v5PP8283n+bebz/NvM5/m32SCfaX2ef5v5PP8283n+bebz/NvM5/m3mc/zbzOf599mPs+/zXyef5v5PP8283n+bebz/NvM5/m3mc/zbzOf599mPs+/zXyef5v5PP8283n+bebz/NvM5/m3mc/zbzOf599mPs+/zXyef5u1/Pzb4WHahXbZYNArC5819/UbrX7tkCFbbT/Xom+vdeANA4et+soXIz4OvzGHqbTpGbnr99lrwKAD1+7fd/CI+shsrTXWXGvtddZdb/0NNtxo40023WzzLbbcautttt1u+x167dh7p5136bPrbrv33WPPfnv1HzBw70H7DN53v/0POPCggw859LDDG0c0hjSObBzVOLpxTOPYxnGN3zWOb/y+cULjD40TGyc1Tm4MbQxrDG+MaJzSOLVxWuP0xh8bf2qc0fhz4y+NMxt/bfytcVbj7MY5jXMb5zXOb1zQuLBxUePvjYsblzQubVzWuLzxj8YVjX82rmxc1bi6cU3j2sZ1jesbNzRubPyrcVPj5sYtjVsbtzVub9zRuLNxV+Puxj2Nexv3Ne5vPNB4sNFoSOOhxsONRxqPNh5rPN54ovFk46nG041nGs82nms83xjZeKHxYuOlxsuNVxqvNl5rvN54o/Fm463G2413Gu823mu83/ig8WHjo8bHjU8anzY+a3ze+KLxZeOrxteNbxrfNr5rfN/4ofFj4ydJekiSSJJKkklSkqQsSUWSqiQ1SeqSdEkyniTjSzKBJBNKMpEkE0syiSSTSjKZJJNLMoUkU0oylSRTSzKNJNNKMp0k00sygyQzSjKTJD0lmVmSWSSZVZLZJJldkjkkmVOSuSSZW5J5JJlXkvkkmV+SBSRZUJKFJFlYkkUkWVSSxSRZXJIlJFlSkqUkWVqSZSRZVpLlJFlekhUkWVGSlSRZWZJVJFlVktUkWV2SNSRZU5K1JFlbknUkWVeS9SRZX5INJNlQko0k2ViSTSTZVJLNJNlcki0k2VKSrSTZWpJtJNlWku0k2V6SHSTpJcmOkvSWZCdJdpZkF0n6SLKrJLtJsrskfSXZQ5I9JeknyV6S9JdkgCQDJdlbkkGS7CPJYEn2lWQ/SfaX5ABJDpTkIEkOluQQSQ6V5DBJDpfkCEmGSHKkJEdJcrQkx0hyrCTHSfI7SY6X5PeSnCDJHyQ5UZKTJDlZkqGSDJNkuCQjJDlFklMlOU2S0yX5oyR/kuQMSf4syV8kOVOSv0ryN0nOkuRsSc6R5FxJzpPkfEkukORCSS6S5O+SXCzJJZJcKsllklwuyT8kuUKSf0pypSRXSXK1JNdIcq0k10lyvSQ3SHKjJP+S5CZJbpbkFkluleQ2SW6X5A5J7pTkLknuluQeSe6V5D5J7pfkAUkelKQhiUjykCQPS/KIJI9K8pgkj0vyhCRPSvKUJE9L8owkz0rynCTPSzJSkhckeVGSlyR5WZJXJHlVktckeV2SNyR5U5K3JHlbknckeVeS9yR5X5IPJPlQko8k+ViSTyT5VJLPJPlcki8k+VKSryT5WpJvJPlWku8k+V6SHyT5UZKfJO0haSJpKmkmaUnSsqQVSauS1iStS9ol6XiSji/pBJJOKOlEkk4s6SSSTirpZJJOLukUkk4p6VSSTi3pNJJOK+l0kk4v6QySzijpTJL2lHRmSWeRdFZJZ5N0dknnkHROSeeSdG5J55F0Xknnk3R+SReQdEFJF5J0YUkXkXRRSReTdHFJl5B0SUmXknRpSZeRdFlJl5N0eUlXkHRFSVeSdGVJV5F0VUlXk3R1SdeQdE1J15J0bUnXkXRdSdeTdH1JN5B0Q0k3knRjSTeRdFNJN5N0c0m3kHRLSbeSdGtJt5F0W0m3k3R7SXeQtJekO0raW9KdJN1Z0l0k7SPprpLuJunukvaVdA9J95S0n6R7Sdpf0gGSDpR0b0kHSbqPpIMl3VfS/STdX9IDJD1Q0oMkPVjSQyQ9VNLDJD1c0iMkHSLpkZIeJenRkh4j6bGSHifp7yQ9XtLfS3qCpH+Q9ERJT5L0ZEmHSjpM0uGSjpD0FElPlfQ0SU+X9I+S/knSMyT9s6R/kfRMSf8q6d8kPUvSsyU9R9JzJT1P0vMlvUDSCyW9SNK/S3qxpJdIeqmkl0l6uaT/kPQKSf8p6ZWSXiXp1ZJeI+m1kl4n6fWS3iDpjZL+S9KbJL1Z0lskvVXS2yS9XdI7JL1T0rskvVvSeyS9V9L7JL1f0gckfVDShqQi6UOSPizpI5I+Kuljkj4u6ROSPinpU5I+Lekzkj4r6XOSPi/pSElfkPRFSV+S9GVJX5H0VUlfk/R1Sd+Q9E1J35L0bUnfkfRdSd+T9H1JP5D0Q0k/kvRjST+R9FNJP5P0c0m/kPRLSb+S9GtJv5H0W0m/k/R7SX+Q9EdJf5Ksh2ThXTeVLJOsJFlZsopkVclqktUl65JsPMnGl2wCySaUbCLJJpZsEskmlWwyySaXbArJppRsKsmmlmwayaaVbDrJppdsBslmlGwmyXpKNrNks0g2q2SzSTa7ZHNINqdkc0k2t2TzSDavZPNJNr9kC0i2oGQLSbawZItItqhki0m2uGRLSLakZEtJtrRky0i2rGTLSba8ZCtItqJkK0m2smSrSLaqZKtJtrpka0i2Zvh6P3wVH742D19xh6+jw1fH4Wve8JVs+Po0fNUZvpYMXyGGr/vCV3Pha7TwlVf4eip8lRS+9glf0YSvU8JXH+FrivCVQrj8Hy7Vh8vq4RJ4uFwdLi2Hy8Dhkm24vBouhYbLluESY7gcGC7dhcts4ZJYuHwVLjWFy0LhEk643BIujYTLGOGSQ7g8ED7Kh4/d4SNy+DgbPnqGj4nhI134+BU+KoWPNeEjSPi4EGgfGB7IHHgbKBrYGIgXOBZYdPEmfQbvO6j/ar0H9x7ZY40eSZqVypVqrd413vgTTDjRxJNMOtnkU0w51dTTTDvd9DPMOFPPmWeZdbbZ55hzrrnnmXe++RdYcKGFF1l0scWXWHKppZdZdrnlV1hxpZVXWXW11YcOHZk0hg85b+Wd+w7acPjDj1Tf+/zBe3YbOvQ/QxuPPbTV2EPbDX/45Ofee/HorpM+/O/QjmO/aq+xhwYPf/iqxedbZoKt5jjiv0P7jT3XoWO/qnH88IcP7bX9y5fO/mpYF0sPuXj1AwYO6rPPPn0H9B8xtPk/L7B2q7/Qv9Vf2KXVX+jT6i8c0Oov9Gz1Fwa0+gv7tvoLg9uvh13dF2mn9tsO/rv3Pq3+wnzu26F3q78wyP0XWl6kA93X0u7uPezj3kPLFfq2+gsHuZ/uW256qfY74nYa0vlvKH3b79zahnTY//8HZ42DW/2FQ1v9heSXv2C7MGt4at9/kXwiSAbJIDk/IBkkKwHJIFkJSAbJSkByRyJ5GEgGySA5PyAZJCsBySBZCUgGyUpAckci+VSQDJJBcn5AMkhWApJBshKQDJKVgOSORPIZIBkkg+T8gGSQrAQkg2QlIBkkKwHJHYnkv4JkkAyS8wOSQbISkAySlYBkkKwEJHckks8BySAZJOcHJINkJSAZJCsBySBZCUjuSCRfCJJBMkjOD0gGyUpAMkhWApJBshKQ3JFIvmTshy43LgXOwBk45wc4A2clwBk4KwHOwFkJcP4t4Nz8F7pJfDn8hb/wNz/wF/4qgb/wVwn8hb9K4G+b8fcK+At/4W9+4C/8VQJ/4a8S+At/lcDfNuPvlfAX/sLf/MBf+KsE/sJfJfAX/iqBv23G36vhL/yFv/mBv/BXCfyFv0rgL/xVAn/bjL/Xwl/4C3/zA3/hrxL4C3+VwF/4qwT+thl/r4e/8Bf+5gf+wl8l8Bf+KoG/8FcJ/G0z/t4If+Ev/M0P/IW/SuAv/FUCf+GvEvjbZvy9Cf7CX/ibH/gLf5XAX/irBP7CXyXwtz34m/yXv7fAX/gLf/MDf+GvEvgLf5XAX/irBP62GX9vg7/wF/7mB/7CXyXwF/4qgb/wVwn8bTP+3gF/4S/8zQ/8hb9K4C/8VQJ/4a8S+Ntm/L0L/sJf+Jsf+At/lcBf+KsE/sJfJfC3zfh7D/yFv/A3P/AX/iqBv/BXCfyFv0rgb5vx9z74C3/hb37gL/xVAn/hrxL4C3+VwN824+8D8Bf+wt/8wF/4qwT+wl8l8Bf+KoG/bcbfBvyFv/A3P/AX/iqBv/BXCfyFv0rgb3vwN/0vfx+Cv/AX/uYH/sJfJfAX/iqBv/BXCfxtM/4+An/hL/zND/yFv0rgL/xVAn/hrxL422b8fQz+wl/4mx/4C3+VwF/4qwT+wl8l8LfN+PsE/IW/8Dc/8Bf+KoG/8FcJ/IW/SuBvm/H3KfgLf+FvfuAv/FUCf+GvEvgLf5XA3zbj7zPwF/7C3/zAX/irBP7CXyXwF/4qgb9txt/n4C/8hb/5gb/wVwn8hb9K4C/8VQJ/24y/I+Ev/IW/+YG/8FcJ/IW/SuAv/FUCf9uDv9l/+fsi/IW/8Dc/8Bf+KoG/8FcJ/IW/SuBvm/H3ZfgLf+FvfuAv/FUCf+GvEvgLf5XA3zbj76vwF/7C3/zAX/irBP7CXyXwF/4qgb9txt/X4S/8hb/5gb/wVwn8hb9K4C/8VQJ/24y/b8Jf+At/8wN/4a8S+At/lcBf+KsE/rYZf9+Gv/AX/uYH/sJfJfAX/iqBv/BXCfxtM/6+C3/hL/zND/yFv0rgL/xVAn/hrxL422b8fR/+wl/4mx/4C3+VwF/4qwT+wl8l8Lc9+Fv6L38/hL/wF/7mB/7CXyXwF/4qgb/wVwn8bTP+fgx/4S/8zQ/8hb9K4C/8VQJ/4a8S+Ntm/P0U/sJf+Jsf+At/lcBf+KsE/sJfJfC3zfj7OfyFv/A3P/AX/iqBv/BXCfyFv0rgb5vx90v4C3/hb37gL/xVAn/hrxL4C3+VwN824+/X8Bf+wt/8wF/4qwT+wl8l8Bf+KoG/bcbfb+Ev/IW/+YG/8FcJ/IW/SuAv/FUCf9uMv9/DX/gLf/MDf+GvEvgLf5XAX/irBP62B3/L/+Xvj/AX/sLf/MBf+KsE/sJfJfAX/iqBv+3FX0l64F/8i3/zg3/xrxL8i3+V4F/8qwT/tpt/U/yLf/FvfvAv/lWCf/GvEvyLf5Xg33bzbwn/4l/8mx/8i3+V4F/8qwT/4l8l+Lfd/FvBv/gX/+YH/+JfJfgX/yrBv/hXCf5tN//W8C/+xb/5wb/4Vwn+xb9K8C/+VYJ/282/XfgX/+Lf/OBf/KsE/+JfJfgX/yrBv+3m3/HxL/7Fv/nBv/hXCf7Fv0rwL/5Vgn/bw7+Vbv9OiH/xL/7ND/7Fv0rwL/5Vgn/xrxL8227+nRj/4l/8mx/8i3+V4F/8qwT/4l8l+Lfd/Dsp/sW/+Dc/+Bf/KsG/+FcJ/sW/SvBvu/l3cvyLf/FvfvAv/lWCf/GvEvyLf5Xg33bz75T4F//i3/zgX/yrBP/iXyX4F/8qwb/t5t+p8S/+xb/5wb/4Vwn+xb9K8C/+VYJ/282/0+Jf/It/84N/8a8S/It/leBf/KsE/7abf6fHv/gX/+YH/+JfJfgX/yrBv/hXCf5tD/9Wu/07I/7Fv/g3P/gX/yrBv/hXCf7Fv0rwb7v5tyf+xb/4Nz/4F/8qwb/4Vwn+xb9K8G+7+XcW/It/8W9+8C/+VYJ/8a8S/It/leDfdvPvbPgX/+Lf/OBf/KsE/+JfJfgX/yrBv+3m3znwL/7Fv/nBv/hXCf7Fv0rwL/5Vgn/bzb9z4V/8i3/zg3/xrxL8i3+V4F/8qwT/tpt/58G/+Bf/5gf/4l8l+Bf/KsG/+FcJ/m03/y42/OF7bn71xi2vXOWOkT2Wwb/4dxz1gH/xrxL8i3+VtKF/F231FxYBzIA5P4C5HcE8bETzX5DsRcneHza86St7hJc1f1G3v9fC3/gbf+cHf+NvJfgbfyvB3/hbCf7ubH83n3m0rLdB1sgaWecHWSNrJcgaWStB1shaCbL+f0fWBw9/+JHqe58/eM9uQ4d2Dx45/OGrFp9vmQm2muOI0YPH5L3yuOEPn/zcey8e3XXSh6MHT8r79S/yfv2rvMGvuY0b7IP9/IB9sK8E7P+/gn1u48buSrB7O9rd8AujSf4N/sW/+Dc/+Bf/KsG/+FcJ/sW/SvBvu/n3W/yLf/FvfvAv/lWCf/GvEvyLf5Xg33bz73f4F//i3/zgX/yrBP/iXyX4F/8qwb/t5t/v8S/+xb/5wb/4Vwn+xb9K8C/+VYJ/282/P+Bf/It/84N/8a8S/It/leBf/KsE/7abf3/Ev/gX/+YH/+JfJfgX/yrBv/hXCf5tN//+hH/xL/7ND/7Fv0rwL/5Vgn/xrxL822b+TXvgX/yLf/ODf/GvEvyLf5XgX/yrBP+2h3+Tbv8m+Bf/4t/84F/8qwT/4l8l+Bf/KsG/7ebfFP/iX/ybH/yLf5XgX/yrBP/iXyX4t938m+Ff/It/84N/8a8S/It/leBf/KsE/7abf0v4F//i3/zgX/yrBP/iXyX4F/8qwb/t5t8y/sW/+Dc/+Bf/KsG/+FcJ/sW/SvBvu/m3gn/xL/7ND/7Fv0rwL/5Vgn/xrxL8227+reJf/It/84N/8a8S/It/leBf/KsE/7abf2v4F//i3/zgX/yrBP/iXyX4F/8qwb/t4d+02791/It/8W9+8C/+VYJ/8a8S/It/leDfdvNvF/7Fv/g3P/gX/yrBv/hXCf7Fv0rwb7v5dzz8i3/xb37wL/5Vgn/xrxL8i3+V4N928+/4+Bf/4t/84F/8qwT/4l8l+Bf/KsG/7ebfCfAv/sW/+cG/+FcJ/sW/SvAv/lWCf9vNvxPiX/yLf/ODf/GvEvyLf5XgX/yrBP+2m38nwr/4F//mB//iXyX4F/8qwb/4Vwn+bTf/Tox/8S/+zQ/+xb9K8C/+VYJ/8a8S/Nse/s26/TsJ/sW/+Dc/+Bf/KsG/+FcJ/sW/SvBvu/l3UvyLf/FvfvAv/lWCf/GvEvyLf5Xg33bz72T4F//i3/zgX/yrBP/iXyX4F/8qwb/t5t/J8S/+xb/5wb/4Vwn+xb9K8C/+VYJ/282/U+Bf/It/84N/8a8S/It/leBf/KsE/7abf6fEv/gX/+YH/+JfJfgX/yrBv/hXCf5tN/9OhX/xL/7ND/7Fv0rwL/5Vgn/xrxL8227+nRr/4l/8mx/8i3+V4F/8qwT/4l8l+Lc9/Fvq9u80+Bf/4t/84F/8qwT/4l8l+Bf/KsG/7ebfafEv/sW/+cG/+FcJ/sW/SvAv/lWCf9vNv9PhX/yLf/ODf/GvEvyLf5XgX/yrBP+2m3+nx7/4F//mB//iXyX4F/8qwb/4Vwn+bTf/zoB/8S/+zQ/+xb9K8C/+VYJ/8a8S/Ntu/p0R/+Jf/Jsf/It/leBf/KsE/+JfJfi33fw7E/7Fv/g3P/gX/yrBv/hXCf7Fv0rwb7v5tyf+xb/4Nz/4F/8qwb/4Vwn+xb9K8G97+Lfc7d+Z8S/+xb/5wb/4Vwn+xb9K8C/+VYJ/282/s+Bf/It/84N/8a8S/It/leBf/KsE/7abf2fFv/gX/+YH/+JfJfgX/yrBv/hXCf5tN//Ohn/xL/7ND/7Fv0rwL/5Vgn/xrxL8227+nR3/4l/8mx/8i3+V4F/8qwT/4l8l+Lfd/DsH/sW/+Dc/+Bf/KsG/+FcJ/sW/SvBvu/l3TvyLf/FvfvAv/lWCf/GvEvyLf5Xg33bz71z4F//i3/zgX/yrBP/iXyX4F/8qwb/t4d9Kt3/nxr/4F//mB//iXyX4F/8qwb/4Vwn+bTf/zoN/8S/+zQ/+xb9K8C/+VYJ/8a8S/Ntu/p0X/+Jf/Jsf/It/leBf/KsE/+JfJfi33fw7H/7Fv/g3P/gX/yrBv/hXCf7Fv0rwb7v5d378i3/xb37wL/5Vgn/xrxL8i3+V4N928+8C+Bf/4t/84F/8qwT/4l8l+Bf/KsG/7ebfBfEv/sW/+cG/+FcJ/sW/SvAv/lWCf9vNvwvhX/yLf/ODf/GvEvyLf5XgX/yrBP+2h3+r3f5dGP/iX/ybH/yLf5XgX/yrBP/iXyX4t938uwj+xb/4Nz/4F/8qwb/4Vwn+xb9K8G+7+XdR/It/8W9+8C/+VYJ/8a8S/It/leDfdvPvYvgX/+Lf/OBf/KsE/+JfJfgX/yrBv+3m38XxL/7Fv/nBv/hXCf7Fv0rwL/5Vgn/bzb9L4F/8i3/zg3/xrxL8i3+V4F/8qwT/tpt/l8S/+Bf/5gf/4l8l+Bf/KsG/+FcJ/m0z/2YnDH/4kep7nz94z25Dh3YPnjL84asWn2+ZCbaa44jRg6fnvfJPwx8++bn3Xjy666QPRw+ek/frbwJtoA208wO0gbYSoA20lQBtoK0EaP8G0B4+ovkvSGmklJe3vLBygVQubL4IPf4r6lI9B+Sl8fIGx8fe2Bt75wd7Y28l2Bt7K8He2FsJ9v4N7G34hdFSngD/4l/8mx/8i3+V4F/8qwT/4l8l+Lfd/Dsh/sW/+Dc/+Bf/KsG/+FcJ/sW/SvBvu/l3IvyLf/FvfvAv/lWCf/GvEvyLf5Xg33bz78T4F//i3/zgX/yrBP/iXyX4F/8qwb/t5t9J8C/+xb/5wb/4Vwn+xb9K8C/+VYJ/282/k+Jf/It/84N/8a8S/It/leBf/KsE/7abfyfDv/gX/+YH/+JfJfgX/yrBv/hXCf5tN/9Ojn/xL/7ND/7Fv0rwL/5Vgn/xrxL82x7+Tbr9OwX+xb/4Nz/4F/8qwb/4Vwn+xb9K8G+7+XdK/It/8W9+8C/+VYJ/8a8S/It/leDfdvPvVPgX/+Lf/OBf/KsE/+JfJfgX/yrBv+3m36nxL/7Fv/nBv/hXCf7Fv0rwL/5Vgn/bzb/T4F/8i3/zg3/xrxL8i3+V4F/8qwT/tpt/p8W/+Bf/5gf/4l8l+Bf/KsG/+FcJ/m03/06Hf/Ev/s0P/sW/SvAv/lWCf/GvEvzbbv6dHv/iX/ybH/yLf5XgX/yrBP/iXyX4tz38m3b7dwb8i3/xb37wL/5Vgn/xrxL8i3+V4N928++M+Bf/4t/84F/8qwT/4l8l+Bf/KsG/7ebfmfAv/sW/+cG/+FcJ/sW/SvAv/lWCf9vNvz3xL/7Fv/nBv/hXCf7Fv0rwL/5Vgn/bzb8z41/8i3/zg3/xrxL8i3+V4F/8qwT/tpt/Z8G/+Bf/5gf/4l8l+Bf/KsG/+FcJ/m03/86Kf/Ev/s0P/sW/SvAv/lWCf/GvEvzbbv6dDf/iX/ybH/yLf5XgX/yrBP/iXyX4tz38m3X7d3b8i3/xb37wL/5Vgn/xrxL8i3+V4N928+8c+Bf/4t/84F/8qwT/4l8l+Bf/KsG/7ebfOfEv/sW/+cG/+FcJ/sW/SvAv/lWCf9vNv3PhX/yLf/ODf/GvEvyLf5XgX/yrBP+2m3/nxr/4F//mB//iXyX4F/8qwb/4Vwn+bTf/zoN/8S/+zQ/+xb9K8C/+VYJ/8a8S/Ntu/p0X/+Jf/Jsf/It/leBf/KsE/+JfJfi33fw7H/7Fv/g3P/gX/yrBv/hXCf7Fv0rwb3v4t9Tt3/nxL/7Fv/nBv/hXCf7Fv0rwL/5Vgn/bzb8L4F/8i3/zg3/xrxL8i3+V4F/8qwT/tpt/F8S/+Bf/5gf/4l8l+Bf/KsG/+FcJ/m03/y6Ef/Ev/s0P/sW/SvAv/lWCf/GvEvzbbv5dGP/iX/ybH/yLf5XgX/yrBP/iXyX4t938uwj+xb/4Nz/4F/8qwb/4Vwn+xb9K8G+7+XdR/It/8W9+8C/+VYJ/8a8S/It/leDfdvPvYvgX/+Lf/OBf/KsE/+JfJfgX/yrBv+3h33K3fxfHv/gX/+YH/+JfJfgX/yrBv/hXCf5tN/8ugX/xL/7ND/7Fv0rwL/5Vgn/xrxL8227+XRL/4l/8mx/8i3+V4F/8qwT/4l8l+Lfd/LsU/sW/+Dc/+Bf/KsG/+FcJ/sW/SvBvu/l3afyLf/FvfvAv/lWCf/GvEvyLf5Xg33bz7zL4F//i3/zgX/yrBP/iXyX4F/8qwb/t5t9l8S/+xb/5wb/4Vwn+xb9K8C/+VYJ/282/y+Ff/It/84N/8a8S/It/leBf/KsE/7aHfyvd/l0e/+Jf/Jsf/It/leBf/KsE/+JfJfi33fy7Av7Fv/g3P/gX/yrBv/hXCf7Fv0rwb7v5d0X8i3/xb37wL/5Vgn/xrxL8i3+V4N928+9K+Bf/4t/84F/8qwT/4l8l+Bf/KsG/7ebflfEv/sW/+cG/+FcJ/sW/SvAv/lWCf9vNv6vgX/yLf/ODf/GvEvyLf5XgX/yrBP+2m39Xxb/4F//mB//iXyX4F/8qwb/4Vwn+bTf/roZ/8S/+zQ/+xb9K8C/+VYJ/8a8S/Nse/q12+3d1/It/8W9+8C/+VYJ/8a8S/It/leDfdvPvGvgX/+Lf/OBf/KsE/+JfJfgX/yrBv+3m3zXxL/7Fv/nBv/hXCf7Fv0rwL/5Vgn/bzb9r4V/8i3/zg3/xrxL8i3+V4F/8qwT/tpt/18a/+Bf/5gf/4l8l+Bf/KsG/+FcJ/m03/66Df/Ev/s0P/sW/SvAv/lWCf/GvEvzbbv5dF//iX/ybH/yLf5XgX/yrBP/iXyX4t838W15x+MOPVN/7/MF7dhs6tHtwreEPX7X4fMtMsNUcR4weXDfvlesPf/jk59578eiukz4cPbhF3q+fAbSBNtDOD9AG2kqANtBWArSBthKg/RtAe/iI5r8glXukOqflhbWFpLZw80Xo0S3qm/NAfmve4G3YG3tj7/xgb+ytBHtjbyXYG3srwd6/gb0NvzBayrfjX/yLf/ODf/GvEvyLf5XgX/yrBP+2m3/vwL/4F//mB//iXyX4F/8qwb/4Vwn+bTf/3ol/8S/+zQ/+xb9K8C/+VYJ/8a8S/Ntu/r0L/+Jf/Jsf/It/leBf/KsE/+JfJfi33fx7N/7Fv/g3P/gX/yrBv/hXCf7Fv0rwb7v59x78i3/xb37wL/5Vgn/xrxL8i3+V4N928++9+Bf/4t/84F/8qwT/4l8l+Bf/KsG/7ebf+/Av/sW/+cG/+FcJ/sW/SvAv/lWCf9vDv0m3f+/Hv/gX/+YH/+JfJfgX/yrBv/hXCf5tN/8+gH/xL/7ND/7Fv0rwL/5Vgn/xrxL8227+fRD/4l/8mx/8i3+V4F/8qwT/4l8l+Lfd/NvAv/gX/+YH/47wOOXiX5ce8K9L0/jXpQf8a/kF/Gv5hV/hX8G/+Bf/5gf/4l8l+Bf/KsG/+FcJ/m03/z6Ef/Ev/s0P/sW/SvAv/lWCf/GvEvzbbv59GP/iX/ybH/yLf5XgX/yrBP/iXyX4t938+wj+xb/4Nz/4F/8qwb/4Vwn+xb9K8G97+Dft9u+j+Bf/4t/84F/8qwT/4l8l+Bf/KsG/7ebfx/Av/sW/+cG/+FcJ/sW/SvAv/lWCf9vNv4/jX/yLf/ODf/GvEvyLf5XgX/yrBP+2m3+fwL/4F//mB//iXyX4F/8qwb/4Vwn+bTf/Pol/8S/+zQ/+xb9K8C/+VYJ/8a8S/Ntu/n0K/+Jf/Jsf/It/leBf/KsE/+JfJfi33fz7NP7Fv/g3P/gX/yrBv/hXCf7Fv0rwb7v59xn8i3/xb37wL/5Vgn/xrxL8i3+V4N/28G/W7d9n8S/+xb/5wb/4Vwn+xb9K8C/+VYJ/282/z+Ff/It/84N/8a8S/It/leBf/KsE/7abf5/Hv/gX/+YH/+JfJfgX/yrBv/hXCf5tN/+OxL/4F//mB//iXyX4F/8qwb/4Vwn+bTf/voB/8S/+zQ/+xb9K8C/+VYJ/8a8S/Ntu/n0R/+Jf/Jsf/It/leBf/KsE/+JfJfi33fz7Ev7Fv/g3P/gX/yrBv/hXCf7Fv0rwb7v592X8i3/xb37wL/5Vgn/xrxL8i3+V4N/28G+p27+v4F/8i3/zg3/xrxL8i3+V4F/8qwT/tpt/X8W/+Bf/5gf/4l8l+Bf/KsG/+FcJ/m03/76Gf/Ev/s0P/sW/SvAv/lWCf/GvEvzbbv59Hf/iX/ybH/yLf5XgX/yrBP/iXyX4t938+wb+xb/4Nz/4F/8qwb/4Vwn+xb9K8G+7+fdN/It/8W9+8C/+VYJ/8a8S/It/leDfdvPvW/gX/+Lf/OBf/KsE/+JfJfgX/yrBv+3m37fxL/7Fv/nBv/hXCf7Fv0rwL/5Vgn/bw7/lbv++g3/xL/7ND/7Fv0rwL/5Vgn/xrxL8227+fRf/4l/8mx/8i3+V4F/8qwT/4l8l+Lfd/Pse/sW/+Dc/+Bf/KsG/+FcJ/sW/SvBvu/n3ffyLf/FvfvAv/lWCf/GvEvyLf5Xg33bz7wf4F//i3/zgX/yrBP/iXyX4F/8qwb/t5t8P8S/+xb/5wb/4Vwn+xb9K8C/+VYJ/282/H+Ff/It/84N/8a8S/It/leBf/KsE/7abfz/Gv/gX/+YH/+JfJfgX/yrBv/hXCf5tD/9Wuv37Cf7Fv/g3P/gX/yrBv/hXCf7Fv0rwb7v591P8i3/xb37wL/5Vgn/xrxL8i3+V4N928+9n+Bf/4t/84F/8qwT/4l8l+Bf/KsG/7ebfz/Ev/sW/+cG/+FcJ/sW/SvAv/lWCf9vNv1/gX/yLf/ODf/GvEvyLf5XgX/yrBP+2m3+/xL/4F//mB//iXyX4F/8qwb/4Vwn+bTf/foV/8S/+zQ/+xb9K8C/+VYJ/8a8S/Ntu/v0a/+Jf/Jsf/It/leBf/KsE/+JfJfi3Pfxb7fbvN/gX/+Lf/OBf/KsE/+JfJfgX/yrBv+3m32/xL/7Fv/nBv/hXCf7Fv0rwL/5Vgn/bzb/f4V/8i3/zg3/xrxL8i3+V4F/8qwT/tpt/v8e/+Bf/5gf/4l8l+Bf/KsG/+FcJ/m03//6Af/Ev/s0P/sW/SvAv/lWCf/GvEvzbbv79Ef/iX/ybH/yLf5XgX/yrBP/iXyX4t938+xP+xb/4Nz/4F/8qwb/4Vwn+xb9K8G+b+bfy3vCH77n51Ru3vHKVO0b2WAb/4t9x1AP+xb9K8C/+VdKG/l201V9YBDAD5vwA5g4Fc49uML8PmAEzYM4PYAbMSgAzYFYCmAGzEsDc8WD+ADADZsCcH8AMmJUAZsCsBDADZiWAuePB/CFgBsyAOT+AGTArAcyAWQlgBsxKAHPHg/kjwAyYAXN+ADNgVgKYAbMSwAyYlQDmjgfzx4AZMAPm/ABmwKwEMANmJYAZMCsBzB0K5qQbzJ8AZsAMmPMDmAGzEsAMmJUAZsCsBDB3PJg/BcyAGTDnBzADZiWAGTArAcyAWQlg7ngwfwaYATNgzg9gBsxKADNgVgKYAbMSwNzxYP4cMANmwJwfwAyYlQBmwKwEMANmJYC548H8BWAGzIA5P4AZMCsBzIBZCWAGzEoAc4eCOe0G85eAGTAD5vwAZsCsBDADZiWAGTArAcwdD+avADNgBsz5AcyAWQlgBsxKADNgVgKYOx7MXwNmwAyY8wOYAbMSwAyYlQBmwKwEMHc8mL8BzIAZMOcHMANmJYAZMCsBzIBZCWDueDB/C5gBM2DOD2AGzEoAM2BWApgBsxLA3KFgzrrB/B1gBsyAOT+AGTArAcyAWQlgBsxKAHPHg/l7wAyYAXN+ADNgVgKYAbMSwAyYlQDmjgfzD4AZMHv0AJgBsxLADJiVAGbArAQwA2YlvyWYfwTMgBkw5wcwA2YlgBkwKwHMgFkJYO54MP8EmAEzYM4PYAbMSgAzYFYCmAGzEsDcoWAu/RfM1R6AGTAD5vwAZsCsBDADZiWAGTArAcwdD+YEMANmwJwfwAyYlQBmwKwEMANmJYC548GcAmbADJjzA5gBsxLADJiVAGbArAQwdzyYM8AMmAFzfgAzYFYCmAGzEsAMmJUA5o4HcwkwA2bAnB/ADJiVAGbArAQwA2YlgLlDwVzuBnMZMANmwJwfwAyYlQBmwKwEMANmJYC548FcAcyAGTDnBzADZiWAGTArAcyAWQlg7ngwVwEzYAbM+QHMgFkJYAbMSgAzYFYCmDsezDXADJgBc34AM2BWApgBsxLADJiVAOaOB3MdMANmwJwfwAyYlQBmwKwEMANmJYC5Q8Fc6QZzF2AGzIA5P4AZMCsBzIBZCWAGzEoAc8eDeTzADJgBc34AM2BWApgBsxLADJiVAOaOB/P4gBkwA+b8AGbArAQwA2YlgBkwKwHMHQ/mCQAzYAbM+QHMgFkJYAbMSgAzYFYCmDsezBMCZsAMmPMDmAGzEsAMmJUAZsCsBDB3KJir3WCeCDADZsCcH8AMmJUAZsCsBDADZiWAuePBPDFgBsyAOT+AGTArAcyAWQlgBsxKAHPHg3kSwAyYAXN+ADNgVgKYAbMSwAyYlQDmjgfzpIAZMAPm/ABmwKwEMANmJYAZMCsBzB0P5skAM2AGzPkBzIBZCWAGzEoAM2BWApg7FMy1bjBPDpgBM2DOD2AGzEoAM2BWApgBsxLA3PFgngIwA2bAnB/ADJiVAGbArAQwA2YlgLnjwTwlYAbMgDk/gBkwKwHMgFkJYAbMSgBzx4N5KsAMmAFzfgAzYFYCmAGzEsAMmJUA5o4H89SAGTAD5vwAZsCsBDADZiWAGTArAcwdCuZ6N5inAcyAGTDnBzADZiWAGTArAcyAWQlg7ngwTwuYATNgzg9gBsxKADNgVgKYAbMSwNzxYJ4OMANmwJwfwAyYlQBmwKwEMANmJYC548E8PWAGzIA5P4AZMCsBzIBZCWAGzEoAc8eDeQbADJgBc34AM2BWApgBsxLADJiVAOYOBXNXN5hnBMyAGTDnBzADZiWAGTArAcyAWQlg7ngwzwSYATNgzg9gBsxKADNgVgKYAbMSwNzxYO4JmAEzYM4PYAbMSgAzYFYCmAGzEsDc8WCeGTADZsCcH8AMmJUAZsCsBDADZiWAuePBPAtgBsyAOT+AGTArAcyAWQlgBsxKAHOHgnm8bjDPCpgBM2DOD2AGzEoAM2BWApgBsxLA3PFgng0wA2bAnB/ADJiVAGbArAQwA2YlgLnjwTw7YAbMgDk/gBkwKwHMgFkJYAbMSgBzx4N5DsAMmAFzfgAzYFYCmAGzEsAMmJUA5o4H85yAGTAD5vwAZsCsBDADZiWAGTArAcwdCubxu8E8F2AGzIA5P4AZMCsBzIBZCWAGzEoAc8eDeW7ADJgBc34AM2BWApgBsxLADJiVAOaOB/M8gBkwA+b8AGbArAQwA2YlgBkwKwHMHQ/meQEzYAbM+QHMgFkJYAbMSgAzYFYCmDsezPMBZsAMmPMDmAGzEsAMmJUAZsCsBDB3KJgn6Abz/IAZMAPm/ABmwKwEMANmJYAZMCsBzB0P5gUAM2AGzPkBzIBZCWAGzEoAM2BWApg7HswLAmbADJjzA5gBsxLADJiVAGbArAQwdzyYFwLMgBkw5wcwA2YlgBkwKwHMgFkJYO54MC8MmAEzYM4PYAbMSgAzYFYCmAGzEsDcoWCesBvMiwBmwAyY8wOYAbMSwAyYlQBmwKwEMHc8mBcFzIAZMOcHMANmJYAZMCsBzIBZCWDueDAvBpgBM2DOD2AGzEoAM2BWApgBsxLA3PFgXhwwA2bAnB/ADJiVAGbArAQwA2YlgLnjwbwEYAbMgDk/gBkwKwHMgFkJYAbMSgBzh4J5om4wLwmYATNgzg9gBsxKADNgVgKYAbMSwNzxYF4KMANmwJwfwAyYlQBmwKwEMANmJYC548G8NGAGzIA5P4AZMCsBzIBZCWAGzEoAc8eDeRnADJgBc34AM2BWApgBsxLADJiVAOaOB/OygBkwA+b8AGbArAQwA2YlgBkwKwHMHQrmibvBvBxgBsyAOT+AGTArAcyAWQlgBsxKAHPHg3l5wAyYAXN+ADNgVgKYAbMSwAyYlQDmjgfzCoAZMAPm/ABmwKwEMANmJYAZMCsBzB0P5hUBM2AGzPkBzIBZCWAGzEoAM2BWApg7HswrAWbADJjzA5gBsxLADJiVAGbArAQwdyiYJ+kG88qAGTAD5vwAZsCsBDADZiWAGTArAcwdD+ZVADNgBsz5AcyAWQlgBsxKADNgVgKYOx7MqwJmwAyY8wOYAbMSwAyYlQBmwKwEMHc8mFcDzIAZMOcHMANmJYAZMCsBzIBZCWDueDCvDpgBM2DOD2AGzEoAM2BWApgBsxLA3KFgnrQbzGsAZsAMmPMDmAGzEsAMmJUAZsCsBDB3PJjXBMyAGTDnBzADZiWAGTArAcyAWQlg7ngwrwWYATNgzg9gBsxKADNgVgKYAbMSwNzxYF4bMANmwJwfwAyYlQBmwKwEMANmJYC548G8DmAGzIA5P4AZMCsBzIBZCWAGzEoAc4eCebJuMK8LmAEzYM4PYAbMSgAzYFYCmAGzEsDc8WBeDzADZsCcH8AMmJUAZsCsBDADZiWAuePBvD5gBsyAOT+AGTArAcyAWQlgBsxKAHPHg3kDwAyYAXN+ADNgVgKYAbMSwAyYlQDmjgfzhoAZMAPm/ABmwKwEMANmJYAZMCsBzB0K5sm7wbwRYAbMgDk/gBkwKwHMgFkJYAbMSgBzx4N5Y8AMmAFzfgAzYFYCmAGzEsAMmJUA5o4H8yaAGTAD5vwAZsCsBDADZiWAGTArAcwdD+ZNATNgBsz5AcyAWQlgBsxKADNgVgKYOx7MmwFmwAyY8wOYAbMSwAyYlQBmwKwEMHcomKfoBvPmgBkwA+b8AGbArAQwA2YlgBkwKwHMHQ/mLQAzYAbM+QHMgFkJYAbMSgAzYFYCmDsezFsCZsAMmPMDmAGzEsAMmJUAZsCsBDB3PJi3AsyAGTDnBzADZiWAGTArAcyAWQlg7ngwbw2YATNgzg9gBsxKADNgVgKYAbMSwNyhYJ6yG8zbAGbADJjzA5gBsxLADJiVAGbArAQwdzyYtwXMgBkw5wcwA2YlgBkwKwHMgFkJYO54MG8HmAEzYM4PYAbMSgAzYFYCmAGzEsDc8WDeHjADZsCcH8AMmJUAZsCsBDADZiWAuePBvANgBsyAOT+AGTArAcyAWQlgBsxKAHOHgnmqbjD3AsyAGTDnBzADZiWAGTArAcyAWQlg7ngw7wiYATNgzg9gBsxKADNgVgKYAbMSwNzxYO4NmAEzYM4PYAbMSgAzYFYCmAGzEsDc8WDeCTADZsCcH8AMmJUAZsCsBDADZiWAuePBvDNgBsyAOT+AGTArAcyAWQlgBsxKAHOHgnnqbjDvApgBM2DOD2AGzEoAM2BWApgBsxLA3PFg7gOYATNgzg9gBsxKADNgVgKYAbMSwNzxYN4VMANmwJwfwAyYlQBmwKwEMANmJYC548G8G2AGzIA5P4AZMCsBzIBZCWAGzEoAc8eDeXfADJgBc34AM2BWApgBsxLADJiVAOYOBfM03WDuC5gBM2DOD2AGzEoAM2BWApgBsxLA3PFg3gMwA2bAnB/ADJiVAGbArAQwA2YlgLnjwbwnYAbMgDk/gBkwKwHMgFkJYAbMSgBzx4O5H2AGzIA5P4AZMCsBzIBZCWAGzEoAc8eDeS/ADJgBc34AM2BWApgBsxLADJiVAOYOBfO03WDuD5gBM2DOD2AGzEoAM2BWApgBsxLA3PFgHgCYATNgzg9gBsxKADNgVgKYAbMSwNzxYB4ImAEzYM4PYAbMSgAzYFYCmAGzEsDc8WDeGzADZsCcH8AMmJUAZsCsBDADZiWAuePBPAgwA2bAnB/ADJiVAGbArAQwA2YlgLlDwTxdN5j3AcyAGTDnBzADZiWAGTArAcyAWQlg7ngwDwbMgBkw5wcwA2YlgBkwKwHMgFkJYO54MO8LmAEzYM4PYAbMSgAzYFYCmAGzEsDc8WDeDzADZsCcH8AMmJUAZsCsBDADZiWAuePBvD9gBsyAOT+AGTArAcyAWQlgBsxKAHOHgnn6bjAfAJgBM2DOD2AGzEoAM2BWApgBsxLA3PFgPhAwA2bAnB/ADJiVAGbArAQwA2YlgLnjwXwQYAbMgDk/gBkwKwHMgFkJYAbMSgBzx4P5YMAMmAFzfgAzYFYCmAGzEsAMmJUA5o4H8yGAGTAD5vwAZsCsBDADZiWAGTArAcwdCuYZusF8KGAGzIA5P4AZMCsBzIBZCWAGzEoAc8eD+TDADJgBc34AM2BWApgBsxLADJiVAOaOB/PhgBkwA+b8AGbArAQwA2YlgBkwKwHMHQ/mIwAzYAbM+QHMgFkJYAbMSgAzYFYCmDsezEMAM2AGzPkBzIBZCWAGzEoAM2BWApg7FMwzdoP5SMAMmAFzfgAzYFYCmAGzEsAMmJUA5o4H81GAGTAD5vwAZsCsBDADZiWAGTArAcwdD+ajATNgBsz5AcyAWQlgBsxKADNgVgKYOx7MxwBmwAyY8wOYAbMSwAyYlQBmwKwEMHc8mI8FzIAZMOcHMANmJYAZMCsBzIBZCWDuUDDP1A3m4wAzYAbM+QHMgFkJYAbMSgAzYFYCmDsezL8DzIAZMOcHMANmJYAZMCsBzIBZCWDueDAfD5gBM2DOD2AGzEoAM2BWApgBsxLA3PFg/j1gBsyAOT+AGTArAcyAWQlgBsxKAHOngvnU4c/O1XufffoMGtxr5wF7Dew9uO9O/fr0GjCo987h/9mvz6BRE/Xaf1DvgQP7DBrZY+Ih5686oP8+g0cMuWC1voP67Dw4HXLh2v0H99mtz6BzN190EcPyRb+ftPT7R6we/36P1uqvPuS8VXv36zdsvO55LtqkT7/Q9H59Wuykx9gzZK3OcOmoZdml9+Deqw4YeGB3S6uPuUxjTP7vJZ/wVy/56uNgyc/bdPCAgcOGK0sabaNVz1+jb59+uzSddub4F1cz/mKPCzbpM3jfQf2HXLLGgEF9+u7Wf9SaOjXs1wcN7rNzr7367rNzr3/v4qt27+Eb/ryDb/Hv/Xvo0OFDLlu/z14DBh248i67jDp6uhddGV9t+JALNu2718B+ff69iL/8//1ncYY/O99/jqz9evfru0uvgfvu1K/vzr12DgvXa9RW/+9R9p+j68z/42NrtV95bK32q/erZOwZSuPmmFp1zGUaY/Jz1x+w3y/24u7Xj6vzxGruR9svd/pZ/73TDxy033/2+S1G7Xsb/bzr/XfVDB06LN6vR089LH9fvuXn3XbgoL779R7cp9eu+/bfefCod4a+oZFB/Xv3G9lj6v/j3XedX7n7rjP2hqq2NkN57Blq43z3rY45edhJxzxdjv5hzKrRq9YY/cP/eNWao3/476vO2Xzh/3G8RP8lG70s0X8pjX6fi/5LefSSRf+lMnpp/n1cTv6fV/xneK0xF+kX/2XtvPelomeXtcaeodzaDOnYx3JpzMl+cSzfPPpQHnXwbfTvY2+N/xx6w9VDuKr+l1r329Yvt/0vjvhT9XOD+l8y9b+U1P9SVv9L5dT8d9f/sdD/8yX/exceY72NtROPXnP/PQ9escvP+1UYCue+4OPBf4rPO1P8yvPe5OPmnNFj9PJ0Txyfoa2+GnLZKn379x504M8v33DgKf+dILtg9b337d1vn7FqhhPDOvvuNXDtXbsPxKw21vndWD3Rqvc4d7W++41+t+hehv8eYt1t/3dFDL9xzI338yrutfe+Awb37dN/8B/jxetq9ciOfn+8cbwZu0ZPrKyP9OL/FBxjtfQYvX6U30rOXX/ffmNst6Yv33TfnXJm/8VZd4z9INoY43W38/8BUq9hL8VIFgA=",
|
|
3985
4013
|
"custom_attributes": [
|
|
3986
4014
|
"abi_private"
|
|
3987
4015
|
],
|
|
3988
|
-
"debug_symbols": "tZzRjhtHskT/Rc9+
|
|
4016
|
+
"debug_symbols": "tZzRjhtHskT/Rc9+6MiqzMryr1wsFlpbuxAgyIZsL3Bh+N8v2ewTIxkYQtbefXHneDQRTQ4PGVUVmN/f/PjuH7/96+/vP/7zp1/efP8/v7/5x6f3Hz68/9ffP/z0w9tf3//08fZ/f39z3P+j+eb78cd3b3R+cftv3L6I+xdx+77+uH3FD/3910/v3t2/85nKTfvnt5/effz1zfcff/vw4bs3/3774bfzH/3y89uP5/XXt59u3z2+e/Pu44+3603wn+8/vLtPf3z38tPH6z9ax7x+eK2XH9eOrxbIQuBYFgiNrxVQHutSUO6Xe4j46nvoqLgkesRnDyP0hcR8chejm7uY45vuQrUHEiunJeaxv5Co1yWm1r4kZsyXp3POL5/O9brEWAcSY61+VaJfl9hliV2qzyTymyTGeFVCx3/+SKT/B414ohFljeh4/bE8uY89eI3vPF5VePJkxDx4fcbM8epLXPlEI/xkRNTLk9HrS4knL1AdWqCm46ZnkbG/fM/Rk9fo3uIta+9cr2s8eYWNCWw3cl8Uji9x1X6icIhfyu3H8ts0dPBIhsbrGvHsNboXv9p56EVD6y88lPBL9Mj6todSk3fyUZ+9ff01jWxr1Df+Wrb4SBp77tef0vrvPqV7ybexXr+Np8x2wluO/SqzsZ8BF0MvwNULLOv4CyJz+NPtmHu+JvLkwWx/zu+Wfz6/fBsdT95GFYNnQ7fP6xeJ/lJiPPucD26iY77cxajj62+jB8Sq13z1Np68j9YtNPHOUaVjvPZ0Pr2PEU4L47Po9ef7ePI2uuaYPKW3+bPn9M/38eR9tEf5zfg+61WRp3cya/hO8nj1VTqfvMLm5knNz97C/pwknz6nJbOy9jf+btdK/25vH1SvPh3PRNb2C/U25/i253S1/Jz267+Y+exOpjVq7pc35PoLCou348rQtyjkCCt89sHyVxR6WKFfU3j+Gznkm1i3t8PXnsw8/tMn87nC1zyZTxW+6sl8rvA1T+YTgbUdAdfngJwfa3+7ffn2h/efvlwNj7zd03dvRt2T5+26rmtf1/24zuO66rrGdR3XdV7XvK6X3rz05qU3L7289PLSy0svL7289PLSy0svL7289PLSq0uvLr269OrSq0uvLr269OrSq0uvLr116a1Lb11669Jbl966693eKlZd13Vd+55Hbtf9uPZxj6G3q65r3HPy7Tqu67yueQ81t2td13Vd+7ru+1L0uzdb93Xo7RrX9aZzj917Xte8r2Fu17qud53bG9/eD51bOGbQw/kWYRgGw+TfJEMxLIZmQFnH4xal+73VfRgMkyEZ7ve37sN6PBCpGfbjoei+I/MYbread+UIhsEwGe6v5/uPR90z0H1YDM2wr2EcDGIIhsEwGZIB5YHyQHmgPFGeKE+UJ8oT5YnyRHmiPFGeKCfKiXKinCgnyolyopwoJ8qJcqFcKBfKhXKhXCgXyoVyoVwo32m6vwp1x+kxxCNP6g7UY5gMyVAMi6EZ9jWcXJ2DGFBulBvlRrlRbpQb5UZ5o7xR3ihvlDfKG+WN8kZ5o7wv5TgOBjEEw2CYDMlQDIuhGVAWykJZKAtloSyUhbJQFspCOVAOlAPlQDlQDpQD5UA5UA6UB8oD5YHyQHmgPFAeKA+UB8oD5YnyRHmiPFGeKE+UJ8oT5YnyRDlRTpQT5UQ5UU6UE+VEOVFOlAvlQrlQLpQL5UK5UC6UC+VCeaG8UIbBgMGAwYDBgMGAwYDBgMGAwYDBgMGAwYDBgMGAwYDBgMGAwYDBgMGAwYDBgMGAwYDBgMGAwbgzOG9LrnFn8DGIIRgGw2RIhmJYDM2AslAWykJZKAtloSyUhbJQFsqBcqAcKAfKgXKgHCgHyoFyoDxQHigPlAfKA+WB8kB5oDxQHihPlCfKE+WJ8kR5ojxRnlfMGBPliXKinCgnyolyopwoJ8rJPSfKiXKhXCgXyoVyoVwoF8rFPRfKhfJCeV2ha6xgGAxX6BorGYoB5dUMV+gafYWu0VfoGj0YJkMyXKFr3NGb5483w76GO3rzXACIIR4xbJA1x75C17ij9xiKYTH0I4+NfYWBeRwMYgiGwTAZkqEYFkMzoCyUhbJQFspCWSgLZaEslIVyoBwoB8qBcqAcKBNBJxF0EkEnEXQSQScRdBJBJxF0EkEnEXQSQScRdBJBJxF0EkEnEXQSQScRdBJBJxF0EkEnEXQSQScRdBJBJxF0EkEnEXQSQScRdBJBJxF0EkEnEXQSQScRdBJBJxF0EkEnEXQSQScRdBJBJxF0LpQXygvlhfJCeaG8UF4oL5QXyo1yo9woN8qNcqPcKDfKjXKjvFHeKG+UN8ob5Y3yRnmjvFE+GZz31ffBIIZ4JPM8P/7O4fpgTSJoEkGTCJpE0CSCJhE0iaBJBE0iaBJBkwiaRNAkgiYRNImgSQRNImgSQZMImkTQJIImETSJoEkETSJoEkGTCJpE0CSCJhE0iaBJBE0iaBJBkwiaRNAkgiYRNImgSQRNImgSQZMImkTQJIImETSJoEkETSJoEkGTCJpE0CSCJhE0iaBJBE0iaBJBkwiaRNAkgiYRNImgycdf8vGXfPzlEkMwDIbJkAzFsBhQXig3yo1yo9woN8qNcqPcKDfKjfJGeaO8Ud4ob5Q3yhvljfJGmQhaRNAighYRtIigRQQtImgRQYsIWkTQIoIWEbSIoEUELSJoEUGLCFpE0CKCFhG0iKBFBC0iaBFBiwhaRNAighYRtIigRQQtImgRQYsIWkTQIoIWEbSIoEUELSJoEUGLCFpE0CKCFhG0iKBFBC0iaBFBa6JMBC0iaBFBiwhaRNAighYRtIigRQQtImgRQYsIWkTQIoIWEbSIoEUELSJoEUGrUIbBgsGCwYLBgsGCwYLBgsGCwYLBgsGCwYLBgsGCwYLBgsGCwYLBgsGCwYLBgsGCwYLBgsGCwYLBgsGCwYLBgsEFgwsGFwwuGFwwuGBwweCCwQWDCwYXDC4YXDC4YHDB4ILBBYMLBhcMLhhcMLhgcMHggsEFgwsGFwwuGFwwuGBwweCCwQWDCwYXDC4YXDC4YHDB4ILBBYMLBhcMLhhcMLhgcMHggsEFgwsGFwwuGFwwuGBwweCCwQWDCwYXDC4YXDC4YHDB4ILBBYMLBhcMLhhcMLhgcMHggsEFgwsGFwwuGFwwuGBwweCCwQWDCwYXDC4YXDC4YHDB4ILBBYMLBhcMLhhcMLhgcMHggsEFgwsGFwwuGGwYbBhsGGwYbBhsGGwYbBhsGGwYbBhsGGwYbBhsGGwYbBhsGGwYbBhsGGwYbBhsGGwYbBhsGGwYbBhsGGwYbBhsGGwYbBhsGGwYbBhsGGwYbBhsGGwYbBhsGGwYbBhsGGwYbBhsGGwYbBhsGGwYbBhsGGwYbBhsGGwYbBhsGGwYbBhsGGwYbBhsGGwYbBjscyvmPGmLx1Koz/XgOaAMgw2DDYMNgw2DDYMNgw2DDYMNgw2DDYMNgw2DDYMNgw2DDYN9boee54Mow2DDYO9rt6d3M+zHptM+jyTOQQzxENzHYJgMyVAMi+GufB5P3m/1ft54oncOwTAYJkMyXBtTW9etbjXDtTG149qY2uEj0GtjageHoJwG7kiGYlgMzbCv4dyKOc9Sr+X2ZitmsxWz2YrZbMVstmI2WzGbrZjNVsxmK2azFbPZitlsxWy2YjZbMZutmM1WzGYrZrMVs9mK2WzFbLZiNlsxm62YzVbMZitmsxWz2YrZbMVstmI2WzGbrZjNVsxmK2azFbPZitlsxWy2YjZbMZutmM1WzGYrZrMVs9mK2WzFbLZiNlsxm62YzVbMZitmsxWz2YrZbMVstmI2WzGbrZjNVsxmK2azFbPZitlsxWy2YjZbMZutmM1WzGYrZrMVs9mK2WyH3g7iD0/yFJ6Gp+kpPZWn5ak92UP2kD1kD9lD9pA9ZA/ZQ/aQPcIeYY+wR9gj7BH28GH94dP6w8f1h8/rDx/YH+PauLpN4Wl4ur+1PKb0xNHswYbNbWpPnPse7NncJnkKT8PT9JSe7DHtMe0x7ZH2SHukPdIeaY+0R9oj7ZH2SHuUPcoeZY+yR9mj7FH2KHuUPcoeyx7LHj7aP3y2f/hw//Dp/uHj/cPn+4cP+A+f8B8+4j98xn/4kP/wKf/hY/7D5/yHD/oPn/QfPuo/fNZ/+LD/8Gn/4eP+w+f9hw/8D5/4Hz7yP3zmf/jQ/+DUXyLnSgRdiaQrEXUlsq5E2JVIuxJxVyLvSgReSfaQPWQP2UP2kD1kD9lD9pA9wh5hj7BH2CPsEfYIe4Q9wh5hj2GPYY9hj2GPYY9hj2GPYY9hj2GPaY9pj2mPaY9pj2mPaY9pj2mPaY+0R9oj7ZH2SHukPdIeaY+0R9qj7FH2KHuUPcoeZY+yR9mj7FH2WPZY9lj2WPZY9lj2WPZY9lj2WPZoe7Q92h5tj7ZH26Pt0fZoe7Q9tj22PbY9tj22PbY9tj22PbY9WM4qzHmY8zDnYc7DnIc5D3Me5jzMeZjzMOdhzsOchzkPcx7mPMx5mPMw52HOw5yHOQ9zHuY8zHmY8zDnYc7DnIc5D3Me5jzMeZjzMOdhzsOchzkPcx7mPMx5mPMw52HOw5yHOQ9zHuY8zHmY8zDnYc7DnIc5D3Me5jzMeZjzMOdhzsOchzkPcx7mPMx5mPMw52HOw5yHOQ9zHuY8zHmY8zDnYc7DnIc5D3Me5jzMeZjzMOdhzsOchzkPcx7mPMx5mPMw52HOw5yHOQ9zHuY8zHmY8zDnbhDJFSK5QySXiOQWkVwjkntEcpFIw0Xas0p0ptezS/SYzLnbRHKdSO4TyYUiuVEkV4rkTpFcKpJbRXKtSO4VycUiuVkkV4vkbpFcLpLbRXK9SGe/6PHYzLkbRnLFSI+O0ePfTU/52IjQWTO6puWprWyPeXiSp/A0PN09dE73u69zWp7a02bKw5M83e9+nZPvPn33J92P6e4R57Q83T3GOdFxPktHZ4H5bB1dU3ganqan9FSPjQsNd3CHS7jDLdzBwluDlbcGS28N1t4aLL41WH1rsPzWWPZY9lj2aHu0PdoebY+2R9uj7dH2aHu0PbY9tj22PbY9tj22PbY9tj22Pbwqd0tJrinJPSW5qCQ3leSqktxVkstKcltJrivJfSW5sCQ3luTKktxZkktLcmtJri3JvSW5uCQ3l+TqktxdkstLcntJri/J/SW5wCQ3mOQKk9xhkktMcotJrjHJPSa5yCQ3meQqk9xl0nzp078U6l8a9S+V+s869fZ4adW/1OpfevUvxXo3691rkotNcrNJrjbJ3Sa53CS3m+R6k9xvkgtOcsNJrjjJHSe55CS3nOSak9xz0qPoNM+pPfGpMV23n+7bT6/Kp1fl06vy6VX59Kp8elU+vSqfXpVPr8qnV+XTq/LpVfn0qnx6VT69Kp9elU+vyqdX5dOr8ulV+fSqfHpVPr0qn16VT6/Kp1fl06vy6VV5UsZX0sZXUsdX0seX21ByHUruQ8mFKLkRJVei5E6UXIqSW1FyLUruRcnFKLkZJVej5G6UXI6S21FyPUruR8kFKbkhJVek5I6UXJKSW1JyTUruSclFKbkpJVel5K6UXJZSOq2n03o6rafTejqtp9N6Oq2n03o6rafTejqtp9N6Oq2n03o6rafTejqtp9N6Oq2n03o6rafTejqtp9N6Oq2n03o6rafTejqtp9N6Oq2n07rbVHKdSu5TyYUquVElV6rkTpVcqpJbVXKtSu5VycUquVklV6vkbpVcrpLbVXK9Su5XyQUruWElV6zkjpVcspJbVnLNSu5ZyUUruWklV63krpVctpLbVnLdSu5byYUruXElV67kzpVcupJbV3LtSu5dycUruXklV6/k7pVcvpLbV3L9Su5fyQUsuYElV7DkDpZcwpJbWHINS+5hyUUsuYklV7HkLpZcxpLbWHIdS+5jyYUsuZElV7LkTpZcypJbWXItS+5lycUsuZklV7PkbpZczpLbWXI9S+5nyQUtuaElV7TkjpZc0pJbWnJNS+5pyUUtuaklV7XkrpZc1pLbWnJdS+5ryYUtubElV7bkzpZc2pJbW3JtS+5tycUtubklV7fk7pZc3pLbW3J9S+5vyQUuucElV7jkDpdc4pJbXHKNS+5xyUUuucklV7nkLpdc5pLbXHKdS+5zyYUuudElV7rkTpdc6pJbXXKtS+51ycUuudklV7vkbpdc7pLbXXK9S+53yQUvueElV7zkjpdc8pJbXnLNS+55yUUvueklV73krpdc9pLbXnLdS+57yYUvufElV77kzpdc+pJbX3LtS+59ycUvufklV7/k7peWV+Vn++tMr2f965rsYc7dAJMrYHIHTC6ByS0wuQYm98DkIpjcBJOrYHIXTC6DyW0wuQ4m98HkQpjcCNNZCXs8NnPuUpjcCtOjFnb+u5Pzx3RfG+Q5hafhaXpKT+VpeWpPm+lcnz8me7Q92h5tj7ZH26Pt0fZoe2x7bHtse2x7bHtse2x7bHtse2w8ztbYNclTeBqepqf0VJ6Wp/ZkD9lD9pA9ZA/ZQ/aQPWQP2UP2CHuEPcIeYY+wR9gj7BH2CHuEPYY9hj2GPYY9hj2GPYY9hj2GPYY9pj2mPaY9pj2mPaY9pj2mPaY9pj3SHmmPtEfaI+2R9kh7pD3SHmmPskfZo+xR9ih7lD3KHmWPskfZY9nDnLc5b3Pe5rzNeZvzNudtztuctzlvc97mvM15m/M2523O25y3OW9z3ua8zXmb8zbnbc7bnLc5b3Pe5rzN+Tbn25xvc77N+Tbn25xvc77N+Tbn25xvc77N+Tbn25xvc77N+Tbn25xvc77N+Tbn25xvc77N+Tbn25xvc77N+Tbn25w/Cmz3P6n277ef3r/9x4d3v7z5/vf7H4H57eMP/MGX25e//u/PfIc/kPrzp59+ePfjb5/e3f84zPm9P/72x/8B",
|
|
3989
4017
|
"is_unconstrained": false,
|
|
3990
4018
|
"name": "entrypoint",
|
|
3991
4019
|
"verification_key": "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA4AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAU+Acadjxr9UB6M8QF84mpOIAAAAAAAAAAAAAAAAAAAAAAAjtpePbAPDFLgCM9IH6lAAAAAAAAAAAAAAAAAAAAKmLmpDjy9TGWUqNEW0csQMoAAAAAAAAAAAAAAAAAAAAAAAT0URA8VLtW+OKen4W2wIAAAAAAAAAAAAAAAAAAAChr0nDwHBCve3szVEC8SRJJwAAAAAAAAAAAAAAAAAAAAAAFNpiRBVT+9dPcRJXGuo0AAAAAAAAAAAAAAAAAAAAH8x2YszwxRUGGfdGI8irbeAAAAAAAAAAAAAAAAAAAAAAABXFXNTPd9g7yGekNdOJJAAAAAAAAAAAAAAAAAAAAJ0R49xepRxRKhD7QmwkOEg5AAAAAAAAAAAAAAAAAAAAAAAL9470rfwkgL3oCKGoSnwAAAAAAAAAAAAAAAAAAAANmpdGQpOI06XSLQ84wIIdEAAAAAAAAAAAAAAAAAAAAAAAEHSEqovn8XT+C3IJUtljAAAAAAAAAAAAAAAAAAAAhV3QOlWLe8gCI2XiMEC9YHsAAAAAAAAAAAAAAAAAAAAAAAuREi2cbGCz/ZOFEEwJvQAAAAAAAAAAAAAAAAAAAGgJhSyhFf0LQaVNBAC7mutSAAAAAAAAAAAAAAAAAAAAAAADpRlF05wIpFDsfu2ASNMAAAAAAAAAAAAAAAAAAACTu5GWOQH5jNaKBwKwllgTsQAAAAAAAAAAAAAAAAAAAAAABkKh8Gj+3Br6l0V+iAN4AAAAAAAAAAAAAAAAAAAAJyCAzmkYRkXJwrhK0z8jg0YAAAAAAAAAAAAAAAAAAAAAAByYMwwvGsvzlhGEuTsNHAAAAAAAAAAAAAAAAAAAAN8FfwnAzi39pjGahy4eeb0/AAAAAAAAAAAAAAAAAAAAAAAiVpu57tDUM1ZjBI/zmNAAAAAAAAAAAAAAAAAAAACD2sgaICrGVNRTCMaJxhe5gAAAAAAAAAAAAAAAAAAAAAAAIDUesNM51riNRqLwTLzFAAAAAAAAAAAAAAAAAAAAtE9N05Avr8/Ot66OXmGR7/QAAAAAAAAAAAAAAAAAAAAAAAxY638fC360uD0Zo6+IiAAAAAAAAAAAAAAAAAAAAM8bvE+Ieo4Ia8DTv7DaaUb7AAAAAAAAAAAAAAAAAAAAAAAs/3HOdP9EI6YUV5kkKTwAAAAAAAAAAAAAAAAAAADz0i1OQsy1XFlQulVH37WSmAAAAAAAAAAAAAAAAAAAAAAAHLQQYletJlnEvLAXYpF6AAAAAAAAAAAAAAAAAAAAJL4ScGlxSRvyRFRWG/G3DIcAAAAAAAAAAAAAAAAAAAAAACHyDVq57RbJ6DSNxzT40QAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAu1+XWaE2ELS0i3KMseTHSTwAAAAAAAAAAAAAAAAAAAAAAAdFsXCxbY7pFnTjxLAgcgAAAAAAAAAAAAAAAAAAAOUZJD3O/NbaGusNEdhWWmw9AAAAAAAAAAAAAAAAAAAAAAAC8ojKRcTyfdMB8JaK+UIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA1ZQJSofOxNX6lLGyKQIQ3BoAAAAAAAAAAAAAAAAAAAAAABjiXRPY7hrn2QHWbP0X8wAAAAAAAAAAAAAAAAAAAP/XTZoTDjQB/7c3gwHYAbfgAAAAAAAAAAAAAAAAAAAAAAAQvBWUEYGzcKXHcwOmX3MAAAAAAAAAAAAAAAAAAACuT7Uktg1UyivpsZwKLcldXAAAAAAAAAAAAAAAAAAAAAAAFykWTWKahWX7x0lh1ioNAAAAAAAAAAAAAAAAAAAAvbLIcFP7VVIqXJJGOkkkD9EAAAAAAAAAAAAAAAAAAAAAAB7YnqcvvZGFx1o4XU3piAAAAAAAAAAAAAAAAAAAAJW4gtvYEl15LwOrnKI3lWp+AAAAAAAAAAAAAAAAAAAAAAAuaejvbrRQBokYXZmBl3AAAAAAAAAAAAAAAAAAAAB1awBpc1Gfn60sZkCPiYPUWgAAAAAAAAAAAAAAAAAAAAAALV5lDJKP95iUzB2sGAfvAAAAAAAAAAAAAAAAAAAAawX4jwIUZxelxjnQkjf/GRQAAAAAAAAAAAAAAAAAAAAAAAzHqrGuxWSUQwU0omyrlQAAAAAAAAAAAAAAAAAAAP88O40SdjijG80xGy/yzHgLAAAAAAAAAAAAAAAAAAAAAAADOJDaWpEZY6R8JyLuaCcAAAAAAAAAAAAAAAAAAADcKbxoHU9oCeo0KjY4GF25ywAAAAAAAAAAAAAAAAAAAAAAAQpZySZQD9FhIMtSM9U3AAAAAAAAAAAAAAAAAAAA7K8raSrsmf5fU+xzzS2nm4kAAAAAAAAAAAAAAAAAAAAAAAqcGMqwgzAMYmP9wLaM8QAAAAAAAAAAAAAAAAAAANPvnp5xgjxrTeZshBJZewCuAAAAAAAAAAAAAAAAAAAAAAAAor9Lz6TMdLUe8TwiGdcAAAAAAAAAAAAAAAAAAADKOVIE35iI+vzQzYLjifljlwAAAAAAAAAAAAAAAAAAAAAALCoRKgX5jTmfB1mOQQweAAAAAAAAAAAAAAAAAAAA8uRH8IYxSj0qCUQ+MUqKNA0AAAAAAAAAAAAAAAAAAAAAAAp7SdaobobXmU7/ohLY0wAAAAAAAAAAAAAAAAAAAKDMpG8GwFAigCjdPzBb2yQIAAAAAAAAAAAAAAAAAAAAAAAu97rigP4coVqQLowLhQIAAAAAAAAAAAAAAAAAAAAoxaXvSQrfdeqLekWYfSCq3gAAAAAAAAAAAAAAAAAAAAAALV92gLl3hOokLL5/vc2nAAAAAAAAAAAAAAAAAAAAotBngT076oi/UU1OKgaK8iwAAAAAAAAAAAAAAAAAAAAAACeKFnz0oV9XxaMyQEMiyQAAAAAAAAAAAAAAAAAAANqQbC6d/958hamz+0bu4njXAAAAAAAAAAAAAAAAAAAAAAACXn16xFJeMctknaqhq6QAAAAAAAAAAAAAAAAAAAB1Ky3n2JxJrzwAQ8GwchhpFAAAAAAAAAAAAAAAAAAAAAAAK/U72HSbUO6wdTlRLKBjAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABeU1DXAjGU+Mbp/rw3r0HfNAAAAAAAAAAAAAAAAAAAAAAAE16e7jHYOiSoxDyZijlBAAAAAAAAAAAAAAAAAAAA74m0SJWvTknIEUYkRKRXIWoAAAAAAAAAAAAAAAAAAAAAABrEIGUUFYbC12NkxmRgBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADyoBFQjiCvSj1r3Kjc9D0PzAAAAAAAAAAAAAAAAAAAAAAAGDfO4C+266SPCt6N19bVAAAAAAAAAAAAAAAAAAAA+pEIpm8AC4BcrJfXQO3FmNcAAAAAAAAAAAAAAAAAAAAAABwTYr4qQU6yXzmyBneI1AAAAAAAAAAAAAAAAAAAALdG1/g+4B48aNs3+LFBiW7IAAAAAAAAAAAAAAAAAAAAAAArhbDfNtb+gEdn2prfTzEAAAAAAAAAAAAAAAAAAAAkb6AQcPk8UnkQssz8m2m/DQAAAAAAAAAAAAAAAAAAAAAAKfIN2dkcBrw8VM7V/IebAAAAAAAAAAAAAAAAAAAAhvSEULac3ruVGjWYaAtJ6eAAAAAAAAAAAAAAAAAAAAAAACqijynomdErCkdRNfU8FgAAAAAAAAAAAAAAAAAAALPe49ZKZWhnGAov9A3//uFLAAAAAAAAAAAAAAAAAAAAAAALvroWbfGsJfNmIIs167sAAAAAAAAAAAAAAAAAAACijgP0iOo5++aPMFDvwl+GCQAAAAAAAAAAAAAAAAAAAAAADA7mugrsUNT74/8xg090AAAAAAAAAAAAAAAAAAAAyFdvce6gguNREBbgB8hd/kIAAAAAAAAAAAAAAAAAAAAAABbWFifx4Nfaz7ph985DIgAAAAAAAAAAAAAAAAAAANmEORun469N8xQGzd3HMprgAAAAAAAAAAAAAAAAAAAAAAAYUUCDXbFi7J3NMrzk9J0AAAAAAAAAAAAAAAAAAADabYR+T6ea7kxq75KqJSBCiwAAAAAAAAAAAAAAAAAAAAAAF84pnVFGCFmOlyvFm/woAAAAAAAAAAAAAAAAAAAAIEziZTx3KGp95uj7QOUKR8UAAAAAAAAAAAAAAAAAAAAAACKjKrMw6u7F/q05vRP2bQAAAAAAAAAAAAAAAAAAAG5x7Oyd/aw3DOw1ySVtIcywAAAAAAAAAAAAAAAAAAAAAAAVQWXiI60hyeb4SEU/uZwAAAAAAAAAAAAAAAAAAACt9R17Ue20LxU49fkUnCllRAAAAAAAAAAAAAAAAAAAAAAAB77H+UjexPxDiRlEr9t4AAAAAAAAAAAAAAAAAAAAgdIOEvY6T5pDPHt38Nl4msIAAAAAAAAAAAAAAAAAAAAAACMODTj9sZU0N7uql2g2tgAAAAAAAAAAAAAAAAAAAMVlzYuGQG+mzRYgVxey900zAAAAAAAAAAAAAAAAAAAAAAAu+loEDD1uNZMdfsVBTR8AAAAAAAAAAAAAAAAAAADyyQrLgBwJ9RQxirBpC1msdwAAAAAAAAAAAAAAAAAAAAAAHDxIqDX60cSNE6MpIm8rAAAAAAAAAAAAAAAAAAAAcTw2mtjLCEUrufOT7AGBXcIAAAAAAAAAAAAAAAAAAAAAABn7mjeEMaLV5/z0PIDSDwAAAAAAAAAAAAAAAAAAAHe4WU16bRy/adkn5mkBG1XFAAAAAAAAAAAAAAAAAAAAAAAavj3aHYj9OBTFY0BtJLI="
|
|
@@ -4117,11 +4145,11 @@
|
|
|
4117
4145
|
],
|
|
4118
4146
|
"return_type": null
|
|
4119
4147
|
},
|
|
4120
|
-
"bytecode": "H4sIAAAAAAAA/+2deWBcRR3Hk+
|
|
4148
|
+
"bytecode": "H4sIAAAAAAAA/+2deWBcRR3Hk+xujm2u3kfIHmmb7KYiFEqpRY6e9G5tKQoC7TbZppHNJmw2paGgBitFKJqkXBYEpAflaEVa5FLkEg9mFBELaBU5CsgpCiJYwSnt7s6+92bekW9Yj+lf07ydz+/33nznN783+/b3XL09V97eunJlw6pIc3xZItoQbV4d7em6dWqiORZrbpoWicUuz+vt2jolkYh07s0/aWN3T+8jgTz5v/w804/kWQPlo0AFKJALBXKjQB4UqBAFKkKBilGgEhTIiwINQIFKUaAyFKgcBapAgSpRoIEo0CAUaDAKNAQFGooCDUOBhqNAI1CgkSjQKBSoCgU6DAWqRoF8KJAfBQqgQEEUqAYFGo0CjUGBxqJAtShQHQoUQoHCKFA9CjQOBfoUCnQ4CvRpFOgIFOhIFGg8CnQUCnQ0CjQBBToGBZqIAh2LAk1CgT6DAk1GgY5DgT6LAh2PAp2AAp2IAp2EAk1BgaaiQNNQoOko0AwUaCYKdDIKNAsFmo0CzUGB5qJA81Cg+SjQAhRoIQq0CAX6HAq0GAVaggKdggItRYFORYE+jwJ9AQU6DQU6HQX6Igp0Bgp0Jgp0Fgq0DAVajgJFUKAVKFADCtSIAkVRoJUoUBMKtAoFakaBvoQCnY0CxVCgFhQojgK1okBtKNA5KFACBWpHgZIoUAcKtBoFOhcFWoMCdaJA56FAa1Gg81GgC1CgL6NAX0GByFdhpC4Y6UIY6Wsw0joY6esw0kUw0noY6WIY6Rsw0iUw0qUw0gYY6TIY6Zsw0rdgpG4YqQdG6oWRNsJIl8NIV8BIV8JIV8FIV8NI34aRNsFI18BI18JI34GRroORroeRboCRvgsj3QgjbYaRtsBIW2GkbTDSTTDSdhjpZhjpFhjpVhjpNhhpB4y0E0b6Hox0O4z0fRjpDhhpF4y0G0a6E0b6AYx0F4x0N4x0D4x0L4x0H4z0QxjpRzDS/TDSj2GkB2CkB2Gkh2Ckh2GkR2Ckn8BIj8JIP4WRfgYj/RxG+gWM9BiMRGAkCiP9Ekb6FYz0OIz0axjpCRjpNzDSkzDSb2GkPTDSUzDS0zDSMzDS72Ck38NIe2GkP8BIf4SRnoWR/gQjPQcjPQ8jvQAjvQgj7YORXoKRXoaRXoGR/gwjvQojvQYjvQ4jvQEjvQkjvQUj/QVGehtG+iuM9DcY6R0Y6V0Y6e8w0nsw0j9gpPdhpA9gpH/CSPthpH/BSB/CSB+hSBRXgYniajBRXBUmiqvDRHGVmCiuFhPFVWOiuHpMFFeRieJqMlFcVSaKq8tEcZWZKK42E8VVZ6K4+kwUV6GJ4mo0UVyVJoqr00RxlZoorlYTxVVrorh6TRRXsYniajZRXNUmiqvbRHGVmyiudhPFVW+iuPpNFFfBieJqOFFcFSeKq+NEcZWcKK6WE8VVc6K4ek4UV9GJ4mo6UVxVJ4qr60RxlZ0orrYTxVV3orj6ThRX4YniajxRXJUniqvzRHGVniiu1hPFVXuiuHpPFFfxieJqPlFc1SeKq/tEcZWfKK72E8VVf6JW6j91bVvSHG+KRa0iLVSC6t7Ybf5zmvy9+VPy8gtcbk9hUXGJd0BpWXlF5cBBg4cMHTZ8xMhRVYdV+/yBYM3oMWNr60Lh+nGfOvzTRxw5/qijJxwz8dhJn5l83GePP+HEk6ZMnTZ9xsyTZ82eM3fe/AULF31u8ZJTlp76+S+cdvoXzzjzrGXLIysaGqMrm1Y1f+nsWEu8te2cRHuyY/W5azrPW3v+BV/+Cvkq6SIXkq+RdeTr5CKynlxMvkEuIZeSDeQy8k3yLdJNekgv2UguJ1eQK8lV5GrybbKJXEOuJd8h15HryQ3ku+RGsplsIVvJNnIT2U5uJreQW8ltZAfZSb5HbiffJ3eQXWQ3uZP8gNxF7ib3kHvJfeSH5EfkfvJj8gB5kDxEHiaPkJ+QR8lPyc/Iz8kvyGOEEEp+SX5FHie/Jk+Q35AnyW/JHvIUeZo8Q35Hfk/2kj+QP5JnyZ/Ic+R58gJ5kewjL5GXySvkz+RV8hp5nbxB3iRvkb+Qt8lfyd/IO+Rd8nfyHvkHeZ98QP5J9pN/kQ/JR2xXku0msl1AtnvHdt3Ybhnb5WK7U2xXie0GsV0ctvvCdk3YbgfbpWC7C2xXgN3Ns7twdvfM7nrZ3Sq7y2R3h+yujt2NsbsodvfD7lrY3Qa7S2DZPcvKWTbNsmCWvbKsk2WLLMtj2RnLqlg2xLIYln2wrIGt9myVZqsrWxXZasZWIbZ6sKjPojWLsiw6sqjGohGLImz2s1nLZhubJUzdTI3d3Uy3unr5ez3nd22d1hpvT27s2ja9mf01WdB10+x4MtoUTWxeerT5Mpev7Z9vq3/XBm3/PFv98zd0bTlQ6r+HFjSlSdsXR2ORJDs9tz3WFD3BY+9q5HXddsCbxkgyMq21rTN9UnN5nzg485079dMzDd6q5lNnZBqpT924dLzmQ2dlGhnUxAmaT8UzDYnBtkxDbDCRaUgMkgu5lsQkWce1xEbJRVxLZvZKriUzezXXkpjdxLVkZm/hWjKzt3EtidmdXEtm9n6uJTP7ANeSmH2Ia8nMPsG1ZGaf5FoSs3u4lszsS1xLZvYVriUx+yrXkpn9gGvJzO7nWhKzH3ItiVm2vvBNiWG2BvFNsWm2TPFNqfEavik1PoZvyozX8k2p8Yl8U2p8Et+UGZ/MN6XG5/BNqfF5fFNmfAHflBo/i29KjS/nmzLjK/im1HiCb0qNJ/mmzPhqvik1fhHflBq/mG/KjF/CN6XGL+WbWcZ1eYLNrGlunzON5V2b57eu7uXzinQCpmMX2mNHum6d2hyPJDpZp4VtV6TBm6c0Nn58+mlLnIUds+ONH/+1b0kYSyizjWdMpM3rz7lAezWK+aHRHCvh3dZdqwH23K3Q0r2ScSi1x660Pw6l4nHwgsahVD8OXu04HPqvix+QrCNu3uWsIx5+KFK5fVvX1iXJ1kTUeBS9gFEUnGyx/mSLeSuCbiX6biWZa7RlXmukkTuVIh4uO9EiW26m7SknlZP/E06qYK2CtQrWyknlpArWKlirYK1mr3JSOamCtQrWKlirEKOcVMFaBWsVrFWwVk4qJ1WwVsFaBWs1e5WTykkVrFWwVsFahRjlpArWKlirYK2CtXJSOamCtQrWKlir2aucVE6qYK2CtQrWyknlpArWKlirYK1mr3JSOamCtQrWKlir2aucVMFaBWsVrFWwVk4qJ1WwVsFaBWs1e5WTykkVrFWwVsFahRjlpArWKlirYK2CtXJSOZlDJzWhtiDTdGuPuVK9DpQ3T4WRtX2tbZ6/QU9w2X2LyhZ2Ndt6jM/DpX1jzLSsKu4m9PyWG7T9p2+d2RyNNZq6FdR2nGGxY56248x0x8vGP7hr6fqn9q6YPvIO19tr9z18T+DcZ8v3FbkL9ww5fO312o4npzu+/8YTl16T99CuYc+7bh5+5B0XXHfiu2sXvtUbG/rWBdFrdt6t7TiLK4k/ycLCpuk+294A6oZojr3+7m2Lo8mORNx4cS/SLu6uzMKYtU4WZz6Q9feSzBK7ZU5HSxuT/ZrU7D50pDDDSM1sbedCY++Ktd4JZ3QKqO1QYtLBu31etL39lFWRuKGZoq5tB05q9sq0y15akExf0ZnsZJqb4gem+xXPhCLnJaMNy1qa2xuWRdrbowmWErW0sWm2IhZdmIg0xKKnRhPtza3x7u7erh3zoy2tiU7mbYLZT88ewd9n9B54Y1pLWyx6ULOa/2X5cd9BNzqSsWVN0eTSZHOsOdnJFJSMrknuzRuptZAOBR7hkULhkSLhkWLhkRLhEa/wyADhkVLhkTLhkXLhkQrhkUrhkYHCI4OERwYLjwwRHhkqPDJMeGS48MgI4RGxQkYJj1QJjxwmPFJ9QIwyVf+X/S/7pSZmH5k4wRZzy9LxR02S/9Wu393dKm6ouPGfGjeqhUd8Km7kOm70/c2OfX2rUqWeUMS/qMpGVs6FHlsuGLzuqMQewaMneG2dRF6fN6Ly9W++4gY1ldCvF+7NZWfPRhRXJoPOdKMFl6Thm/sALzSGX5a6A/ecKd5VnN8RE3KLRd3K9fsFBaabDGX6TuX8SqTdCynjm9YdKeWFKOhW4cR/gx3YCv5UtP6Xyk6u3NnJlXNb6NrdoTL+Y/IxYOGTWxjTex4iP3amFDjjnI5IrF3bn/NAr8NyWnBtWofLhSY4kfPwMv4aisZl20G3DryYz+j6eo1nxw1prxpsjLibjzHioFHKBY2+fh9h8G1Jmd19dh2h3B5hiJ5QYbJTNSTV0HettGd8kJ4w0B5hsJ4wyB6hSE8YbI9QrCcMsUco0ROG2iMYfGUzzB5hgJ4w3B6hVE8YYY9QpieMtEco1xNG2SMMtJQx7BZFlipnGUMVLbgrBfccIYL7nWUMflpwr3nG4HeWMQSdrLgBfacg54luUQ3wTeuO+PmYLug22on/NfpOo/lT0fpfwzcd+S9cJMc48d/gpMfI/B/NN+34n/5KQNBprBPvDU55rMz7MXzTgfdzRJ1qnXhvcMq1Mu/H8k1H2imB+u+36b9fNrGDziZ2UJItB2TO9Lc9zdpRLXl4JWhvXRpq/+GVoPjhlWrQwysG16pa8jBQrd3k1LpwayXDUJcliUNL+Av6oaxLfx8lMlynN1xnOmNCgmW7jvdev2yHaMFz/28TpopPtjTHfEaJ2JtCpwQXnbNgdFcbpAVvp+CuIhv6C5jKICgVbZXs0geFjgjOkrtW5QZnWUsL3uMyQtFDZtXar+bddmNWysZK7WDWZr6Gtz7Vas2nmtH85K6KTowhCxfZYOB8FjLLOt3uioAQNBihOuoqMN9dMbhGVbxn4tlVp1+quMssnnlBbuYx9zTRPd2sSX1zL8ifncm2hroG5Fa2NU5kW9Ovsq0VQav7WbbVxrIdZi5bn2D4q+XD76OukRaGv6b/ht/nZPh9fRz+aunwj7Zxj1rd5+GvzlK10fCP4YZfGyC43mPkAaJOoJAauUKY/ZAFhfj6TyF1pgoJOUkhw/pOoSzFaxUS5q+6aBoahSpzhYSkCqnJEr5BUus6mlOI/gNjqOuYdAI2Hb+ATLKgj7r+00eVqT5qjNZ0BxGkxuoCMhac99T0Je9hIzSNjyCHhDDnP8zHWZyPsiQr4782FnIB3i+PhaJd36Bc637qWmBB61X9p3W/k1jo72MsDEpjYZ1w3166I+0wFgazprBRLDzNPFkKbjNCV8kHP0hdZ6TRncIs1mBbqsruMx62t6WqxNtSNaBtqSppEq65GlmjpBNP0HRPyOb2x38DMN2ssLIJ4zrb7rdhHKXY8NswVzwN32lrkLkpq91PqeKbwiul+xLMZ/olRshZgGbTP2n+tVzYSYg0iKth3i/tpQnxzR0HmR+vSQvbLte4Yng9Q/12M+bpSyoVMtkekWVFYWepVqn82lofZCurT73V1SdsIL966lpnvvrUC7Qdlmubwdeba3ucE23X6zuN4/3SXv96vmlV2yG+U3+lThJth0y1XS/Ngkr12q63oG3ZujnbUUCVK7u0v5R9lYW8ypmyWWa1yVzZ9U6UbbBM18uUnfUFgYOoHRQqO5TLqB2U3ADPlmYrYTuJbrDfE91g/ye6QdhmQbrT9qmxSMPZU1vXdO1e1NoebW5sjR+1KJpo6UiyT7bGe/lL7+ZDlttGVMm6RxenmFXmKWbIZhbocDnmnmIYqGOG+aZwItYLl5hwLtIn8yVGfqM9QHqjXW8DKk2fwhaWrRrpeJXLH8cSjpc/e7zCfKccBM4aJ+NVI00Jwvz1Em3eGITOUL+HzpA4dPpBoTPk5Is6+d2YjdAZ4kNn2O1M2QPkyhZ9eWUwov5+fxjJLx5RH2hE/dLv3vqq4iE2hBSSTKysSZda3p42mpxm2zpho7t809sn87Q3ZJxT75E92hewMSh+aw8H+T9xezYeRgryx1Kj+ILdLXyTh5HYFv5Lafh+G/ozfxjJLxVtlfwpTvg+2Ou5/dLWYSrkYKciaxdOdovutzFwVraKwlZvqP0GIxSmrvfMb6jDjh9GCktuAUKSmec3n3kBZ5oMUNdHudVkwMnuZsBJAmP5y7NaGw8SWNFkrVVN+gwfYXR7nW/ymDwnEKTuMgvDH+i/4Q+aDn+t9Esd65qpzZKzkyeNAs6+g6+1+h18wHj4Rzh/0CwgH34fdVdZGP5gLh80qwU9aFabJWfJ8FfbeM4wYGH4g9LhD/CGDSdorcljRO5QanVwH2t3dag2Wx3c43K7Opjvogac7AwGpUNZLd18HWsjY7HyIKLP6oOIfuMZPFH/GJH7eLCPgb74yFR0nKXHiHzm/lcLhOyXC7mauk/K7TNC1aZC9hkNjYMfmPr4qyK7D7TzjJC/z0L2Z81PIyHPtbDOOXlGiKEXcM8IZRXLuoer9dcUTS6OxBtbWz7eIu0RFzvq0RfgsjGk3IXU3nz6+KaNfcqA3XoMtne1Av2/TxmQbmiIb44C0mjtszE2/DeXvEjuylRUa+toXzWjbVW0JZqIxMQSCfQYVoXqlRTQunlWNNI2JZGIdPKCyNcWjNx68CMaCeY7U2CpUqBSYC4UKHzUQulP6e+T098cpT+lv5yuwCVKgUqBOVVgsVKgUmBOFThIKVApMKcKHKwUqBSYUwUOUQpUCsypAocqBSoF5lSBw5QClQJzqsDhSoFKgTlV4AilQKXAnCpwpFKgUmBOFVimFKgUmFMFFioFKgXmVIGjlAKVAnOqwEqlQKXAnCpwoFKgUmBOFVhuS4Gyl+D4+12B/v5/CY5f+gsV3e96OddkP0Px2RoblAL9n7wCeYd3Zxxmp9OaaJwZaUh2d28Smj9Me+TQhZgl7DFa0GOmsEeNoMfJDt777bX+nvlDVmZsMnkH9o1LHb/r2pQ83spbvK3/XMriS1aruPcsaj5VIgkmXrtverQdTLziYFICCiZe/VUryczuvr4wtlJk1uAdzmX8eWuGIestvKn3Vk7Wx7P0a42FRWzk70IWdKoQ/Nwx6+XL+l+8VVDPJCuv9/ScIDLscfZ6Tw/1TEnDT+8DvNAYPt28IqXH2es9DXRh/opAr1RMHl324OWb1h3xZJqlNuRl7r/HSJPcqWj998hOrszZyZVxk147q7z8x0Q/2i3p4492B4p/tOs1/dGuwQl5TS97uVQ2bqPowl1362NpcRXy6Nceg6AnDBUF0kCelfU8MzaT9rRHDywtyQTLe5Z0xhumRRpWRWfHV0dizY3d3RsleZBhGlZQKezh2mgpQas0zAC2LY4mOxJx3XKYXjIzH544QSy1F4sXzSi4c4O/a8spiUhbT2+mf+pCgQw9XvTaO4892tTd74Ymd+3bPyL86H3mhg7FiUN/LszMYMOspIj/hbe2T0FmVUh9nHrOzY4MnownVtOedNww7FCi7eDKdMiy7M18IOvvAzKupSZTu+aqFGcYqcmv7Vxs7J1X650w/KSA2g4DTDqUZq/WWjMlujEppZ5Wkbw8drPH1BVbIxhlF0jP66Y9fPjzL+86z1TP/wb2MrdfY1kBAA==",
|
|
4121
4149
|
"custom_attributes": [
|
|
4122
4150
|
"abi_utility"
|
|
4123
4151
|
],
|
|
4124
|
-
"debug_symbols": "
|
|
4152
|
+
"debug_symbols": "tZzdbhy3EoTfRde+GHbzr/0qB0GgOEogQJANxT7AQaB3P2wOi7WKMcx6x7qJPkW7VRxOd+2QXPjvu98ffvv256+Pz398/uvu43/+vvvt5fHp6fHPX58+f7r/+vj5uf3fv+82/0/WdPdRP7Sf+e5j9p/l7mPYGkQHaZDaC0N0CAABKCACEiADCqACbECGcoZyhnKGcnZlH1hOgAwoAFcuDq5cG5QNEACunBpYA/ELtCYofoGWAQVQAbZD2TZAAAhAARGQABlQABUA5QDlAOUA5QDlAOUA5QDlAOUA5QBlgbJAWaAsUBYoiysnhwwoAFc2BxugGyAABKCACEiADCgAKCuUI5RjU9bgIAAFNGVVhwTIA7xW1cfslanZIQISwF/sFl6ZO1SADfDK3CEABKCACEiAphw3hwKoABvglanFob0r+swXf1d0KIAKsAF1AwSAABQQAQngyj4btQAqwAaYK/t4LAAEoIAISIAMKIAKsB2qt0ysDgEgAAU05bQ5NOUkDhlQABVgA7xldggAASggAlxZHTKgAOoAb5CUHQSggAhIgAwogAqwAd4gO7iyz4Y3yA4KiAAXNIcCqAAb4F2QfaK8C7Jfl3fBDgmQAQVQATbAG2SHABCAK/tseMvskAAZ4MrJoQJsgLdM9qF6y+wgAAVEQAJkQAFUgA0oUC5QLlD2Jio+Ld4yJTjYAG+Z4tflLVN88N4yOyggAhIgAwoAyhXK3jI7BIAAFODK0SEBXNknyltmhwqwHcxbpmSHABCAAiIgATKg7F7mLbODDfCW2SEABODKxSECXLk6ZEABVIArt1tg/imzQwAIQAERkAB5eHkT7VABNsCbaIcAaMo1OCggAhIgAwqgAppybdVi3k1VHBTgOuqQABlQ8JoKsAHeTTsEAJS9m6pPr3fTDq7sd9m7aYcCqHiNDfBu2iEABABl76bq0+LdtEMGFEAF2ADvph1c2W+ld9MOTdl88CUCEiADCqACbIB33A4BIAAoVyhXKHvHmV+Od9wOFeDKXtjecTsEgL/dx+xNZF5R3kQOYfMuGuRPf5t0FKISIzERM7EQK9EmemMBu5t2FKISI7G7bY7SFXLHQBSiEiMxETOxECvRJmp3Kx0DUYhK7G59JjURM7EQK9Emxo0YiEJUoruFPiXehMBMLER3C30mvRkH9pXKwEAUohIjMREzsRC7W+xoE/vqZWAgdt0+fX3FMjATC7ESbWJfuwwMRCEqsbvVjomYiYXoFtKnzzsVGIhCdDHpVe39CSzESrSJthEDUYhKjMTu1qfaMrEQK7G7tdBslbARA7G7WUd3061jJLqb7q/NxEKsRJvYG31gILqbP883VCLdeqMPpFugW6BboJvQTejWQ2Eg3XooDKRbD4WBdBO6Cd2Ubko3pVsPhYF066EwkG49FAbSTekW6RbpFukW6dZDYSDdeigMpFsPhYF0S3RLdEt0S3RLdEuskkS3HgoD6dZDYcdMt0y3TLdMt0y3TLfMKsl061ExkG49KgbSrdCt0K3QrdCt0K2wSgrdemrsWOnWU2Mg3SrdKt0q3SrdKt0qq6TSrWfJQLr1LBlIN6Ob0c3oZnQzutmsEtmmm/QsGTjdhFkiW+TbEjETC7ES6cYskUA3ZokEujFLJNCNWSLMEmGWCLNEmCXCLBGhG7NEhG7MEhG6MUuEWSLMEmGWCLNEmCWidGOWiNKNWSJKN2aJMEuEWSLMEmGWCLNEIt2YJRLpxiyRSDdmiTBLhFkizBJhlgizRBLdmCWS6MYskUQ3ZokwS4RZIswSYZYIs0Qy3ZglkunGLJFCN2aJMEuEWSLMEmGWCLNECt2YJVLoxiyRSjdmiTBLhFkizBJhlgizRCrdmCVidGOWiNGNWSLMEmGWCLNEmCXCLBGbbsos0W26KbNEt+mmzBJlliizRJklyixRZokGujFLNNCNWaKBbswSZZYos0SZJcosUWaJCt2YJbpniXX0HWDt1M8ApGMl2sQeGgMDUYhKjMREzES6Kd2Ubj0eYh9ZD4LYr6cHwcBCrESbuJ+J7BiIQlRiJNIt0S3RLdFtPyXxNZvu5yQ7BqIQlRiJiZgn9j73zdeGXay+vn64w8nQr19fHh78YOjiqKgdIH25f3l4/nr38fnb09OHu//eP33rL/rry/1z//n1/qX9tdXYw/Pv7WcT/OPx6cHp9QPfvR2/1XNYx9s9UcOUaA/pb0TCQkR9G2PXiMpRtM+6NxKykEi+9N0lkh1LLC8lReOl1Hx4KfFYpB08DIm20z8Fir55fzp+fw2YzRov5tLK9VeR/bhsXEU7/zq8inIs0poDNdE64mIc+a1EPTkRdnYiltcw72Zr2nx4DWFVmO1YbFZmOxmrU+WHNLJRo5YjDV1cSxXcU20HCDeOonAUFo40FrXZ4gr3pAXTcVWsNbbzGqlOjXZOeKixKo4y74mWuigO+wnFYeeLQ8Lp4rDzxSGrEm3HjnMUaoczKovwNGq0neeL5Mrleo3qe+y7RjtqOdbIi/loD0KC+WjbHnassqix2J6Uhkhs+wtTI8a3ISh19bE2x5H0QiH/wCgKCiy2hdLhKHT5mVLmZ3x78jocx0qjPb+w40o9Hoe8r0bb3olzTnOr9guV9FZlVWWJlZos3qaR59W006J8XkMX17KokJQ3TEhqk3OssahTUTwvtGfA4/pYKVSEmNR8rLC8s2px3tkYtsMriWH5ATVLLB6OY6lw8dxhxwp6djaXCtfNpp6viphPX0d+16rYsmAUjbUcX8niEzJFaKS0qIqVgqAqkh5XRQpnZ3Op8DNm0+bqoh1opcPZTPF8baV0ejbS+85GKZGzYYvZWH3Gy1xs+f7wTSOJW8SjaNwuHqu/y/ClhqapEY/7JJ+u0Xy6RpdPPJLndcjiKSHH8088//IUWQqfIoMcPkXmhYrZrA6zxLui9naPJq9WO5GP5pyPtrP5VmFVo5bmMsXKdpNGO3+BRjt0kRs1qkwNu3Ec/fsbu0Y7M75xHPNRo2nYjeOQMjUukvTHNOJsl3BZHT+koUaNG+cj+BfZhkaNN2pwTluB3KgxdxKbxo3zIXObox2gHc9HXa12rDCPw8UqtFw/DD4xtOOpGy8lxTA1st6mkVmm+dYyzSyxnG/TaNsSKI/2nH/ccjW/621pEmEOoxwPY7lHYanOTC/l8HOhrvZsUlLuDaR4vEdh2/k9Cgtn9yjWo7huj8L0/Ce26fn9BUvvq3H9HoWV83sUS40r9yiu1ljsUfSP5bNLhrCdfjpdS1z1eLq+udduU4Qtnt1lCFs6Px2n11CWf8aNreevpL7rjb16pyGsTmqu2ygIQU5Px1LiZ0zHlVsFYXXYc3V9hHx+QvL7Tsi1uwVheVhz5XbBaijXLvWDnE9TOZ+m2/nFfpCfsNr/l+exLfF5LB2v9sNq0yBucwHTPhq4kePX9lZktd6viQv+vBJZBGKcxRovjiXbgvMHLiakbV7MxafU9+NYisy1QwxxIaKLQovRpki6SJHvRWS1CTzPe1N886H7j675GfvqYXXsc2XrLWck6by/qeTFjKy2uAobpwZWyT801me+InMtdLE79V3XrA6PVLXMpyHhOGq8+gsBloXLuuPvFIS4OidNcW6DNDY9OouPy1jlelvj4bdF1uNI9WJtaHKbSJ5V1vj46w0xnv5uwr+MIwSOQ9KByPLmBt5cW3zbIy5EyoZbWy42QNvG6OvrL+3X+0+PL2/+nYZXl3p5vP/t6WH8+se3508Xf/36vy/4C/6dhy8vnz89/P7t5cGV+I89tP/8p9W/fGgTtf3y4U7b77k1VdbYfvNvj7Y/tyV0e0345dXH838=",
|
|
4125
4153
|
"is_unconstrained": true,
|
|
4126
4154
|
"name": "offchain_receive"
|
|
4127
4155
|
},
|
|
@@ -4149,11 +4177,11 @@
|
|
|
4149
4177
|
],
|
|
4150
4178
|
"return_type": null
|
|
4151
4179
|
},
|
|
4152
|
-
"bytecode": "H4sIAAAAAAAA/
|
|
4180
|
+
"bytecode": "H4sIAAAAAAAA/9WUS07jQBCGm8C8mWGGmeG5gR1bHkJswSESC4QECtvIOCWrpY4ddReIsKJv0HaACxAC4nECtlwCicMQKyg4RhVjWOFd99f111/l6u4Pg5NLVfOckkIbIdBXK5ILwV3LFuKIBbq5xT1XQN0E4d0U6/31sdQjzNSNSRcKmDGtjDFnD2xYn1m+p7Cum3kuwcGcPl/zEFyQp8X5uXTRZHxfpvjDQjKeZctf0I2oqcFgR+diE4SNfA/631pJR2EgmwLT15GXso225VdrnZJW455i4qfr/l74vJF7Pt+uaeilo1zW7ry3K0w3ttCvBl0+Y2KJv2edFTiIcqrsdDIw/8pA1twE3JWevir4ErjrRZ06vp+xDxCcUoUrp2QrBRItv1JtedwRsCFtR8A2SMV9z5hQ36xDxZe15XJZglId68R+Poyua6UqoG0xserycdu2sYui5AIWkQuOtVahCPv4wMaTGWJ9pMgAST6R5DNJvpDkK0m+keQ7SX6QZJAkP0nyiyRDJPlNkj8kGSbJX5L8I8l/koyQZJQkYyShp2qCJJPRMPaa6g+26nrTUo8sLmTSbBRn55Z672b1bczTM/YIlBs6uSoIAAA=",
|
|
4153
4181
|
"custom_attributes": [
|
|
4154
4182
|
"abi_utility"
|
|
4155
4183
|
],
|
|
4156
|
-
"debug_symbols": "
|
|
4184
|
+
"debug_symbols": "fZJNjoQgEIXvUmsXgH/gVSYTg4odEoKGhkkmhrs3GNF2gRuo4tX7UkVqg0kM7tVLPS9v6H42GIxUSr56tYzcykWH1w1QPHANXVkAbqBrvC8gVfTWCBELviwBtHIjtIVOO6UK+OPK7UXvlev9ttwEFRUg9BTuAJylEjHyxeVGeStGrMKHPcSMnQiMmhsEP0BKShOjKq8uCCE3BHlA1KhNiJrlEU+jYERORui+yo5S5SFtk36jpeQEtOXNX+f9FJeHn1b4aoC13v+GlI/S3LbCR5SRfFDiSGenxy/V/q9JSVu1mmUUkzMiknYtsD8=",
|
|
4157
4185
|
"is_unconstrained": true,
|
|
4158
4186
|
"name": "sync_state"
|
|
4159
4187
|
},
|
|
@@ -4441,5 +4469,5 @@
|
|
|
4441
4469
|
}
|
|
4442
4470
|
},
|
|
4443
4471
|
"transpiled": true,
|
|
4444
|
-
"aztec_version": "6.0.0-rc.
|
|
4472
|
+
"aztec_version": "6.0.0-rc.4"
|
|
4445
4473
|
}
|