@aztec/accounts 0.0.1-commit.b8a057fa → 0.0.1-commit.be03c316

package/artifacts/SchnorrInitializerlessAccount.json

@@ -18,7 +18,7 @@
       "path": "std/aes128.nr",
       "source": "// docs:start:aes128\n/// Given a plaintext as an array of bytes, returns the corresponding aes128 ciphertext (CBC mode). Input padding is performed using PKCS#7, so that the output length is `input.len() + (16 - input.len() % 16)`.\npub fn aes128_encrypt<let N: u32>(\n    input: [u8; N],\n    iv: [u8; 16],\n    key: [u8; 16],\n) -> [u8; N + 16 - N % 16] {\n    let padding_length = (16 - N % 16) as u8;\n    let mut padded_input: [u8; N + 16 - N % 16] = [0; N + 16 - N % 16];\n    for i in 0..N {\n        padded_input[i] = input[i];\n    }\n    for i in N..N + 16 - N % 16 {\n        padded_input[i] = padding_length;\n    }\n    let output = aes128_encrypt_padded_input(padded_input, iv, key);\n    output\n}\n\n#[foreign(aes128_encrypt)]\nfn aes128_encrypt_padded_input<let N: u32>(input: [u8; N], iv: [u8; 16], key: [u8; 16]) -> [u8; N] {}\n\n// docs:end:aes128\n\nmod tests {\n    use super::aes128_encrypt;\n\n    #[test]\n    fn encrypt() {\n        let input = \"kevlovesrust\".as_bytes();\n        let iv = \"0000000000000000\".as_bytes();\n        let key = \"0000000000000000\".as_bytes();\n        let output = [244, 14, 126, 172, 171, 40, 208, 186, 173, 184, 226, 105, 238, 122, 205, 191];\n        assert_eq(aes128_encrypt(input, iv, key), output);\n    }\n}\n"
     },
-    "100": {
+    "101": {
       "function_locations": [
         {
           "name": "log_prefix",
@@ -88,7 +88,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/logging.nr",
       "source": "// Not all log levels are currently used, but we provide the full set so that new call sites can use any level. Because\n// of that we tag all with `#[allow(dead_code)]` to prevent warnings.\n//\n// All wrappers resolve function paths at comptime via `resolve_fn` so that the emitted `Quoted` code works both inside\n// aztec-nr (where `crate::` = aztec) and inside macro-generated contract code (where `crate::` = the contract).\n\nuse std::meta::ctstring::AsCtString;\n\ncomptime fn log_prefix<let N: u32>(msg: str<N>) -> CtString {\n    \"[aztec-nr] \".as_ctstring().append_str(msg)\n}\n\n// --- No-args variants (direct call) ---\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_fatal_log<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::fatal_log });\n    quote { $f($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_error_log<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::error_log });\n    quote { $f($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_warn_log<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::warn_log });\n    quote { $f($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_info_log<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::info_log });\n    quote { $f($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_verbose_log<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::verbose_log });\n    quote { $f($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_debug_log<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::debug_log });\n    quote { $f($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_trace_log<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::trace_log });\n    quote { $f($msg) }\n}\n\n// --- Format variants (return lambda for runtime args) ---\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_fatal_log_format<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::fatal_log_format });\n    quote { (|args| $f($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_error_log_format<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::error_log_format });\n    quote { (|args| $f($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_warn_log_format<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::warn_log_format });\n    quote { (|args| $f($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_info_log_format<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::info_log_format });\n    quote { (|args| $f($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_verbose_log_format<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::verbose_log_format });\n    quote { (|args| $f($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_debug_log_format<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::debug_log_format });\n    quote { (|args| $f($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_trace_log_format<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::trace_log_format });\n    quote { (|args| $f($msg, args)) }\n}\n\n// See module-level comment for why this is needed.\ncomptime fn resolve_fn(path: Quoted) -> TypedExpr {\n    path.as_expr().unwrap().resolve(Option::none())\n}\n"
     },
-    "103": {
+    "104": {
       "function_locations": [
         {
           "name": "AztecConfig::new",
@@ -126,7 +126,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/aztec.nr",
       "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"
     },
-    "118": {
+    "119": {
       "function_locations": [
         {
           "name": "generate_private_external",
@@ -136,7 +136,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/internals_functions_generation/external/private.nr",
       "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();\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    quote {\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"
     },
-    "120": {
+    "121": {
       "function_locations": [
         {
           "name": "generate_utility_self_creator",
@@ -636,229 +636,249 @@
           "name": "tests::non_zero_field_to_be_bytes_zero_limbs",
           "start": 19469
         },
+        {
+          "name": "tests::zero_field_to_bytes_zero_limbs_unconstrained",
+          "start": 19600
+        },
+        {
+          "name": "tests::zero_field_to_bytes_zero_limbs_constrained",
+          "start": 19915
+        },
+        {
+          "name": "tests::zero_field_to_bytes_zero_limbs_comptime",
+          "start": 20227
+        },
         {
           "name": "tests::test_field_less_than",
-          "start": 19576
+          "start": 20558
         },
         {
           "name": "tests::test_large_field_values_unconstrained",
-          "start": 19831
+          "start": 20813
         },
         {
           "name": "tests::test_large_field_values",
-          "start": 20284
+          "start": 21266
         },
         {
           "name": "tests::test_decomposition_edge_cases",
-          "start": 20731
+          "start": 21713
         },
         {
           "name": "tests::test_pow_32",
-          "start": 21321
+          "start": 22303
         },
         {
           "name": "tests::test_sgn0",
-          "start": 21650
+          "start": 22632
         },
         {
           "name": "tests::test_bit_decomposition_overflow",
-          "start": 22072
+          "start": 23054
         },
         {
           "name": "tests::test_byte_decomposition_overflow",
-          "start": 22354
+          "start": 23336
         },
         {
           "name": "tests::test_to_from_be_bytes_bn254_edge_cases",
-          "start": 22571
+          "start": 23553
         },
         {
           "name": "tests::test_to_from_le_bytes_bn254_edge_cases",
-          "start": 24522
+          "start": 25504
         },
         {
           "name": "tests::test_from_le_bytes_checked_accepts_modulus_minus_one",
-          "start": 26457
+          "start": 27439
         },
         {
           "name": "tests::test_from_le_bytes_checked_rejects_modulus",
-          "start": 26936
+          "start": 27918
         },
         {
           "name": "tests::test_from_le_bytes_checked_rejects_modulus_plus_one",
-          "start": 27321
+          "start": 28303
         },
         {
           "name": "tests::test_from_be_bytes_checked_accepts_modulus_minus_one",
-          "start": 27776
+          "start": 28758
         },
         {
           "name": "tests::test_from_be_bytes_checked_rejects_modulus",
-          "start": 28265
+          "start": 29247
         },
         {
           "name": "tests::test_from_be_bytes_checked_rejects_modulus_plus_one",
-          "start": 28650
+          "start": 29632
         },
         {
           "name": "tests::test_from_bytes_checked_small_n",
-          "start": 29094
+          "start": 30076
         },
         {
           "name": "tests::from_le_bits",
-          "start": 29739
+          "start": 30721
         },
         {
           "name": "tests::from_be_bits",
-          "start": 30286
+          "start": 31268
         },
         {
           "name": "tests::test_to_from_be_bits_bn254_edge_cases",
-          "start": 30532
+          "start": 31514
         },
         {
           "name": "tests::test_to_from_le_bits_bn254_edge_cases",
-          "start": 32465
+          "start": 33447
         },
         {
           "name": "tests::max_bit_size_too_large",
-          "start": 34397
+          "start": 35379
         }
       ],
       "path": "std/field/mod.nr",
-      "source": "pub mod bn254;\nuse crate::{runtime::is_unconstrained, static_assert};\nuse bn254::lt as bn254_lt;\n\nimpl Field {\n    /// Asserts that `self` can be represented in `bit_size` bits.\n    ///\n    /// # Failures\n    /// Causes a constraint failure for `Field` values exceeding `2^{bit_size}`.\n    // docs:start:assert_max_bit_size\n    pub fn assert_max_bit_size<let BIT_SIZE: u32>(self) {\n        // docs:end:assert_max_bit_size\n        static_assert(\n            BIT_SIZE < modulus_num_bits() as u32,\n            \"BIT_SIZE must be less than modulus_num_bits\",\n        );\n        __assert_max_bit_size(self, BIT_SIZE);\n    }\n\n    /// Decomposes `self` into its little endian bit decomposition as a `[bool; N]` array.\n    /// This array will be zero padded should not all bits be necessary to represent `self`.\n    ///\n    /// # Failures\n    /// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting array will not\n    /// be able to represent the original `Field`.\n    ///\n    /// # Safety\n    /// The bit decomposition returned is canonical and is guaranteed to not overflow the modulus.\n    // docs:start:to_le_bits\n    pub fn to_le_bits<let N: u32>(self: Self) -> [bool; N] {\n        // docs:end:to_le_bits\n        let bits = __to_le_bits(self);\n\n        if !is_unconstrained() {\n            // Ensure that the byte decomposition does not overflow the modulus\n            let p = modulus_le_bits();\n            assert(bits.len() <= p.len());\n            let mut ok = bits.len() != p.len();\n            for i in 0..N {\n                if !ok {\n                    if (bits[N - 1 - i] != p[N - 1 - i]) {\n                        assert(p[N - 1 - i]);\n                        ok = true;\n                    }\n                }\n            }\n            assert(ok);\n        }\n        bits\n    }\n\n    /// Decomposes `self` into its big endian bit decomposition as a `[bool; N]` array.\n    /// This array will be zero padded should not all bits be necessary to represent `self`.\n    ///\n    /// # Failures\n    /// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting array will not\n    /// be able to represent the original `Field`.\n    ///\n    /// # Safety\n    /// The bit decomposition returned is canonical and is guaranteed to not overflow the modulus.\n    // docs:start:to_be_bits\n    pub fn to_be_bits<let N: u32>(self: Self) -> [bool; N] {\n        // docs:end:to_be_bits\n        let bits = __to_be_bits(self);\n\n        if !is_unconstrained() {\n            // Ensure that the decomposition does not overflow the modulus\n            let p = modulus_be_bits();\n            assert(bits.len() <= p.len());\n            let mut ok = bits.len() != p.len();\n            for i in 0..N {\n                if !ok {\n                    if (bits[i] != p[i]) {\n                        assert(p[i]);\n                        ok = true;\n                    }\n                }\n            }\n            assert(ok);\n        }\n        bits\n    }\n\n    /// Decomposes `self` into its little endian byte decomposition as a `[u8;N]` array\n    /// This array will be zero padded should not all bytes be necessary to represent `self`.\n    ///\n    /// # Failures\n    ///  The length N of the array must be big enough to contain all the bytes of the 'self',\n    ///  and no more than the number of bytes required to represent the field modulus\n    ///\n    /// # Safety\n    /// The result is ensured to be the canonical decomposition of the field element\n    // docs:start:to_le_bytes\n    pub fn to_le_bytes<let N: u32>(self: Self) -> [u8; N] {\n        // docs:end:to_le_bytes\n        static_assert(\n            N <= modulus_le_bytes().len(),\n            \"N must be less than or equal to modulus_le_bytes().len()\",\n        );\n        // Compute the byte decomposition\n        let bytes = self.to_le_radix(256);\n\n        if !is_unconstrained() {\n            // Ensure that the byte decomposition does not overflow the modulus\n            let p = modulus_le_bytes();\n            assert(bytes.len() <= p.len());\n            let mut ok = bytes.len() != p.len();\n            for i in 0..N {\n                if !ok {\n                    if (bytes[N - 1 - i] != p[N - 1 - i]) {\n                        assert(bytes[N - 1 - i] < p[N - 1 - i]);\n                        ok = true;\n                    }\n                }\n            }\n            assert(ok);\n        }\n        bytes\n    }\n\n    /// Decomposes `self` into its big endian byte decomposition as a `[u8;N]` array of length required to represent the field modulus\n    /// This array will be zero padded should not all bytes be necessary to represent `self`.\n    ///\n    /// # Failures\n    ///  The length N of the array must be big enough to contain all the bytes of the 'self',\n    ///  and no more than the number of bytes required to represent the field modulus\n    ///\n    /// # Safety\n    /// The result is ensured to be the canonical decomposition of the field element\n    // docs:start:to_be_bytes\n    pub fn to_be_bytes<let N: u32>(self: Self) -> [u8; N] {\n        // docs:end:to_be_bytes\n        static_assert(\n            N <= modulus_le_bytes().len(),\n            \"N must be less than or equal to modulus_le_bytes().len()\",\n        );\n        // Compute the byte decomposition\n        let bytes = self.to_be_radix(256);\n\n        if !is_unconstrained() {\n            // Ensure that the byte decomposition does not overflow the modulus\n            let p = modulus_be_bytes();\n            assert(bytes.len() <= p.len());\n            let mut ok = bytes.len() != p.len();\n            for i in 0..N {\n                if !ok {\n                    if (bytes[i] != p[i]) {\n                        assert(bytes[i] < p[i]);\n                        ok = true;\n                    }\n                }\n            }\n            assert(ok);\n        }\n        bytes\n    }\n\n    fn to_le_radix<let N: u32>(self: Self, radix: u32) -> [u8; N] {\n        // Brillig does not need an immediate radix\n        if !crate::runtime::is_unconstrained() {\n            static_assert(1 < radix, \"radix must be greater than 1\");\n            static_assert(radix <= 256, \"radix must be less than or equal to 256\");\n            static_assert(radix & (radix - 1) == 0, \"radix must be a power of 2\");\n        }\n        __to_le_radix(self, radix)\n    }\n\n    fn to_be_radix<let N: u32>(self: Self, radix: u32) -> [u8; N] {\n        // Brillig does not need an immediate radix\n        if !crate::runtime::is_unconstrained() {\n            static_assert(1 < radix, \"radix must be greater than 1\");\n            static_assert(radix <= 256, \"radix must be less than or equal to 256\");\n            static_assert(radix & (radix - 1) == 0, \"radix must be a power of 2\");\n        }\n        __to_be_radix(self, radix)\n    }\n\n    // Returns self to the power of the given exponent value.\n    // Caution: we assume the exponent fits into 32 bits\n    // using a bigger bit size impacts negatively the performance and should be done only if the exponent does not fit in 32 bits\n    pub fn pow_32(self, exponent: Field) -> Field {\n        let mut r: Field = 1;\n        let b: [bool; 32] = exponent.to_le_bits();\n\n        for i in 1..33 {\n            r *= r;\n            r = (b[32 - i] as Field) * (r * self) + (1 - b[32 - i] as Field) * r;\n        }\n        r\n    }\n\n    // Parity of (prime) Field element, i.e. sgn0(x mod p) = false if x `elem` {0, ..., p-1} is even, otherwise sgn0(x mod p) = true.\n    pub fn sgn0(self) -> bool {\n        (self as u8) % 2 == 1\n    }\n\n    pub fn lt(self, another: Field) -> bool {\n        if crate::compat::is_bn254() {\n            bn254_lt(self, another)\n        } else {\n            lt_fallback(self, another)\n        }\n    }\n\n    /// Convert a little endian byte array to a field element.\n    /// If the provided byte array overflows the field modulus then the Field will silently wrap around.\n    ///\n    /// # Failures\n    /// `N` must be no greater than the number of bytes required to represent the field modulus\n    // docs:start:from_le_bytes\n    pub fn from_le_bytes<let N: u32>(bytes: [u8; N]) -> Field {\n        // docs:end:from_le_bytes\n        static_assert(\n            N <= modulus_le_bytes().len(),\n            \"N must be less than or equal to modulus_le_bytes().len()\",\n        );\n        let mut v = 1;\n        let mut result = 0;\n\n        for i in 0..N {\n            result += (bytes[i] as Field) * v;\n            v = v * 256;\n        }\n        result\n    }\n\n    /// Convert a big endian byte array to a field element.\n    /// If the provided byte array overflows the field modulus then the Field will silently wrap around.\n    ///\n    /// # Failures\n    /// `N` must be no greater than the number of bytes required to represent the field modulus\n    // docs:start:from_be_bytes\n    pub fn from_be_bytes<let N: u32>(bytes: [u8; N]) -> Field {\n        // docs:end:from_be_bytes\n        static_assert(\n            N <= modulus_be_bytes().len(),\n            \"N must be less than or equal to modulus_be_bytes().len()\",\n        );\n        let mut v = 1;\n        let mut result = 0;\n\n        for i in 0..N {\n            result += (bytes[N - 1 - i] as Field) * v;\n            v = v * 256;\n        }\n        result\n    }\n\n    /// Convert a little endian byte array to a field element, asserting that the input is a\n    /// canonical representation (strictly less than the field modulus).\n    ///\n    /// # Failures\n    /// Causes a constraint failure if `bytes` encodes a value greater than or equal to the\n    /// field modulus.\n    // docs:start:from_le_bytes_checked\n    pub fn from_le_bytes_checked<let N: u32>(bytes: [u8; N]) -> Field {\n        // docs:end:from_le_bytes_checked\n        let p = modulus_le_bytes();\n        let mut ok = N != p.len();\n        for i in 0..N {\n            if !ok {\n                if bytes[N - 1 - i] != p[N - 1 - i] {\n                    assert(\n                        bytes[N - 1 - i] < p[N - 1 - i],\n                        \"input bytes are not a canonical field representation\",\n                    );\n                    ok = true;\n                }\n            }\n        }\n        assert(ok, \"input bytes are not a canonical field representation\");\n        Field::from_le_bytes(bytes)\n    }\n\n    /// Convert a big endian byte array to a field element, asserting that the input is a\n    /// canonical representation (strictly less than the field modulus).\n    ///\n    /// # Failures\n    /// Causes a constraint failure if `bytes` encodes a value greater than or equal to the\n    /// field modulus.\n    // docs:start:from_be_bytes_checked\n    pub fn from_be_bytes_checked<let N: u32>(bytes: [u8; N]) -> Field {\n        // docs:end:from_be_bytes_checked\n        let p = modulus_be_bytes();\n        let mut ok = N != p.len();\n        for i in 0..N {\n            if !ok {\n                if bytes[i] != p[i] {\n                    assert(bytes[i] < p[i], \"input bytes are not a canonical field representation\");\n                    ok = true;\n                }\n            }\n        }\n        assert(ok, \"input bytes are not a canonical field representation\");\n        Field::from_be_bytes(bytes)\n    }\n}\n\n#[builtin(apply_range_constraint)]\nfn __assert_max_bit_size(value: Field, bit_size: u32) {}\n\n// `_radix` must be less than 256\n#[builtin(to_le_radix)]\nfn __to_le_radix<let N: u32>(value: Field, radix: u32) -> [u8; N] {}\n\n// `_radix` must be less than 256\n#[builtin(to_be_radix)]\nfn __to_be_radix<let N: u32>(value: Field, radix: u32) -> [u8; N] {}\n\n/// Decomposes `self` into its little endian bit decomposition as a `[bool; N]` array.\n/// This array will be zero padded should not all bits be necessary to represent `self`.\n///\n/// # Failures\n/// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting array will not\n/// be able to represent the original `Field`.\n///\n/// # Safety\n/// Values of `N` equal to or greater than the number of bits necessary to represent the `Field` modulus\n/// (e.g. 254 for the BN254 field) allow for multiple bit decompositions. This is due to how the `Field` will\n/// wrap around due to overflow when verifying the decomposition.\n#[builtin(to_le_bits)]\nfn __to_le_bits<let N: u32>(value: Field) -> [bool; N] {}\n\n/// Decomposes `self` into its big endian bit decomposition as a `[bool; N]` array.\n/// This array will be zero padded should not all bits be necessary to represent `self`.\n///\n/// # Failures\n/// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting array will not\n/// be able to represent the original `Field`.\n///\n/// # Safety\n/// Values of `N` equal to or greater than the number of bits necessary to represent the `Field` modulus\n/// (e.g. 254 for the BN254 field) allow for multiple bit decompositions. This is due to how the `Field` will\n/// wrap around due to overflow when verifying the decomposition.\n#[builtin(to_be_bits)]\nfn __to_be_bits<let N: u32>(value: Field) -> [bool; N] {}\n\n#[builtin(modulus_num_bits)]\npub comptime fn modulus_num_bits() -> u64 {}\n\n#[builtin(modulus_be_bits)]\npub comptime fn modulus_be_bits() -> [bool] {}\n\n#[builtin(modulus_le_bits)]\npub comptime fn modulus_le_bits() -> [bool] {}\n\n#[builtin(modulus_be_bytes)]\npub comptime fn modulus_be_bytes() -> [u8] {}\n\n#[builtin(modulus_le_bytes)]\npub comptime fn modulus_le_bytes() -> [u8] {}\n\n/// An unconstrained only built in to efficiently compare fields.\n#[builtin(field_less_than)]\nunconstrained fn __field_less_than(x: Field, y: Field) -> bool {}\n\npub(crate) unconstrained fn field_less_than(x: Field, y: Field) -> bool {\n    __field_less_than(x, y)\n}\n\nfn lt_fallback(x: Field, y: Field) -> bool {\n    if is_unconstrained() {\n        // Safety: unconstrained context\n        unsafe {\n            field_less_than(x, y)\n        }\n    } else {\n        let x_bytes: [u8; 32] = x.to_le_bytes();\n        let y_bytes: [u8; 32] = y.to_le_bytes();\n        let mut x_is_lt = false;\n        let mut done = false;\n        for i in 0..32 {\n            if (!done) {\n                let x_byte = x_bytes[32 - 1 - i] as u8;\n                let y_byte = y_bytes[32 - 1 - i] as u8;\n                let bytes_match = x_byte == y_byte;\n                if !bytes_match {\n                    x_is_lt = x_byte < y_byte;\n                    done = true;\n                }\n            }\n        }\n        x_is_lt\n    }\n}\n\nmod tests {\n    use crate::{panic::panic, runtime, static_assert};\n    use super::{\n        field_less_than, modulus_be_bits, modulus_be_bytes, modulus_le_bits, modulus_le_bytes,\n    };\n\n    #[test]\n    // docs:start:to_be_bits_example\n    fn test_to_be_bits() {\n        let field = 2;\n        let bits: [bool; 8] = field.to_be_bits();\n        assert_eq(bits, [false, false, false, false, false, false, true, false]);\n    }\n    // docs:end:to_be_bits_example\n\n    #[test]\n    // docs:start:to_le_bits_example\n    fn test_to_le_bits() {\n        let field = 2;\n        let bits: [bool; 8] = field.to_le_bits();\n        assert_eq(bits, [false, true, false, false, false, false, false, false]);\n    }\n    // docs:end:to_le_bits_example\n\n    #[test]\n    // docs:start:to_be_bytes_example\n    fn test_to_be_bytes() {\n        let field = 2;\n        let bytes: [u8; 8] = field.to_be_bytes();\n        assert_eq(bytes, [0, 0, 0, 0, 0, 0, 0, 2]);\n        assert_eq(Field::from_be_bytes::<8>(bytes), field);\n    }\n    // docs:end:to_be_bytes_example\n\n    #[test]\n    // docs:start:to_le_bytes_example\n    fn test_to_le_bytes() {\n        let field = 2;\n        let bytes: [u8; 8] = field.to_le_bytes();\n        assert_eq(bytes, [2, 0, 0, 0, 0, 0, 0, 0]);\n        assert_eq(Field::from_le_bytes::<8>(bytes), field);\n    }\n    // docs:end:to_le_bytes_example\n\n    #[test]\n    // docs:start:to_be_radix_example\n    fn test_to_be_radix() {\n        // 259, in base 256, big endian, is [1, 3].\n        // i.e. 3 * 256^0 + 1 * 256^1\n        let field = 259;\n\n        // The radix (in this example, 256) must be a power of 2.\n        // The length of the returned byte array can be specified to be\n        // >= the amount of space needed.\n        let bytes: [u8; 8] = field.to_be_radix(256);\n        assert_eq(bytes, [0, 0, 0, 0, 0, 0, 1, 3]);\n        assert_eq(Field::from_be_bytes::<8>(bytes), field);\n    }\n    // docs:end:to_be_radix_example\n\n    #[test]\n    // docs:start:to_le_radix_example\n    fn test_to_le_radix() {\n        // 259, in base 256, little endian, is [3, 1].\n        // i.e. 3 * 256^0 + 1 * 256^1\n        let field = 259;\n\n        // The radix (in this example, 256) must be a power of 2.\n        // The length of the returned byte array can be specified to be\n        // >= the amount of space needed.\n        let bytes: [u8; 8] = field.to_le_radix(256);\n        assert_eq(bytes, [3, 1, 0, 0, 0, 0, 0, 0]);\n        assert_eq(Field::from_le_bytes::<8>(bytes), field);\n    }\n    // docs:end:to_le_radix_example\n\n    #[test(should_fail_with = \"radix must be greater than 1\")]\n    fn test_to_le_radix_1() {\n        // this test should only fail in constrained mode\n        if !runtime::is_unconstrained() {\n            let field = 2;\n            let _: [u8; 8] = field.to_le_radix(1);\n        } else {\n            panic(\"radix must be greater than 1\");\n        }\n    }\n\n    // Updated test to account for Brillig restriction that radix must be greater than 2\n    #[test(should_fail_with = \"radix must be greater than 1\")]\n    fn test_to_le_radix_brillig_1() {\n        // this test should only fail in constrained mode\n        if !runtime::is_unconstrained() {\n            let field = 1;\n            let _: [u8; 8] = field.to_le_radix(1);\n        } else {\n            panic(\"radix must be greater than 1\");\n        }\n    }\n\n    #[test(should_fail_with = \"radix must be a power of 2\")]\n    fn test_to_le_radix_3() {\n        // this test should only fail in constrained mode\n        if !runtime::is_unconstrained() {\n            let field = 2;\n            let _: [u8; 8] = field.to_le_radix(3);\n        } else {\n            panic(\"radix must be a power of 2\");\n        }\n    }\n\n    #[test]\n    fn test_to_le_radix_brillig_3() {\n        // this test should only fail in constrained mode\n        if runtime::is_unconstrained() {\n            let field = 1;\n            let out: [u8; 8] = field.to_le_radix(3);\n            let mut expected = [0; 8];\n            expected[0] = 1;\n            assert(out == expected, \"unexpected result\");\n        }\n    }\n\n    #[test(should_fail_with = \"radix must be less than or equal to 256\")]\n    fn test_to_le_radix_512() {\n        // this test should only fail in constrained mode\n        if !runtime::is_unconstrained() {\n            let field = 2;\n            let _: [u8; 8] = field.to_le_radix(512);\n        } else {\n            panic(\"radix must be less than or equal to 256\")\n        }\n    }\n\n    #[test(should_fail_with = \"Field failed to decompose into specified 16 limbs\")]\n    unconstrained fn not_enough_limbs_brillig() {\n        let _: [u8; 16] = 0x100000000000000000000000000000000.to_le_bytes();\n    }\n\n    #[test(should_fail_with = \"Field failed to decompose into specified 16 limbs\")]\n    fn not_enough_limbs() {\n        let _: [u8; 16] = 0x100000000000000000000000000000000.to_le_bytes();\n    }\n\n    #[test(should_fail_with = \"Field failed to decompose into specified 0 limbs\")]\n    unconstrained fn non_zero_field_to_le_bytes_zero_limbs() {\n        let _: [u8; 0] = 5.to_le_bytes();\n    }\n\n    #[test(should_fail_with = \"Field failed to decompose into specified 0 limbs\")]\n    unconstrained fn non_zero_field_to_be_bytes_zero_limbs() {\n        let _: [u8; 0] = 5.to_be_bytes();\n    }\n\n    #[test]\n    unconstrained fn test_field_less_than() {\n        assert(field_less_than(0, 1));\n        assert(field_less_than(0, 0x100));\n        assert(field_less_than(0x100, 0 - 1));\n        assert(!field_less_than(0 - 1, 0));\n    }\n\n    #[test]\n    unconstrained fn test_large_field_values_unconstrained() {\n        let large_field = 0xffffffffffffffff;\n\n        let bits: [bool; 64] = large_field.to_le_bits();\n        assert_eq(bits[0], true);\n\n        let bytes: [u8; 8] = large_field.to_le_bytes();\n        assert_eq(Field::from_le_bytes::<8>(bytes), large_field);\n\n        let radix_bytes: [u8; 8] = large_field.to_le_radix(256);\n        assert_eq(Field::from_le_bytes::<8>(radix_bytes), large_field);\n    }\n\n    #[test]\n    fn test_large_field_values() {\n        let large_val = 0xffffffffffffffff;\n\n        let bits: [bool; 64] = large_val.to_le_bits();\n        assert_eq(bits[0], true);\n\n        let bytes: [u8; 8] = large_val.to_le_bytes();\n        assert_eq(Field::from_le_bytes::<8>(bytes), large_val);\n\n        let radix_bytes: [u8; 8] = large_val.to_le_radix(256);\n        assert_eq(Field::from_le_bytes::<8>(radix_bytes), large_val);\n    }\n\n    #[test]\n    fn test_decomposition_edge_cases() {\n        let zero_bits: [bool; 8] = 0.to_le_bits();\n        assert_eq(zero_bits, [false; 8]);\n\n        let zero_bytes: [u8; 8] = 0.to_le_bytes();\n        assert_eq(zero_bytes, [0; 8]);\n\n        let one_bits: [bool; 8] = 1.to_le_bits();\n        let expected: [bool; 8] = [true, false, false, false, false, false, false, false];\n        assert_eq(one_bits, expected);\n\n        let pow2_bits: [bool; 8] = 4.to_le_bits();\n        let expected: [bool; 8] = [false, false, true, false, false, false, false, false];\n        assert_eq(pow2_bits, expected);\n    }\n\n    #[test]\n    fn test_pow_32() {\n        assert_eq(2.pow_32(3), 8);\n        assert_eq(3.pow_32(2), 9);\n        assert_eq(5.pow_32(0), 1);\n        assert_eq(7.pow_32(1), 7);\n\n        assert_eq(2.pow_32(10), 1024);\n\n        assert_eq(0.pow_32(5), 0);\n        assert_eq(0.pow_32(0), 1);\n\n        assert_eq(1.pow_32(100), 1);\n    }\n\n    #[test]\n    fn test_sgn0() {\n        assert_eq(0.sgn0(), false);\n        assert_eq(2.sgn0(), false);\n        assert_eq(4.sgn0(), false);\n        assert_eq(100.sgn0(), false);\n\n        assert_eq(1.sgn0(), true);\n        assert_eq(3.sgn0(), true);\n        assert_eq(5.sgn0(), true);\n        assert_eq(101.sgn0(), true);\n    }\n\n    #[test(should_fail_with = \"Field failed to decompose into specified 8 limbs\")]\n    fn test_bit_decomposition_overflow() {\n        // 8 bits can't represent large field values\n        let large_val = 0x1000000000000000;\n        let _: [bool; 8] = large_val.to_le_bits();\n    }\n\n    #[test(should_fail_with = \"Field failed to decompose into specified 4 limbs\")]\n    fn test_byte_decomposition_overflow() {\n        // 4 bytes can't represent large field values\n        let large_val = 0x1000000000000000;\n        let _: [u8; 4] = large_val.to_le_bytes();\n    }\n\n    #[test]\n    fn test_to_from_be_bytes_bn254_edge_cases() {\n        if crate::compat::is_bn254() {\n            // checking that decrementing this byte produces the expected 32 BE bytes for (modulus - 1)\n            let mut p_minus_1_bytes: [u8; 32] = modulus_be_bytes().as_array();\n            assert(p_minus_1_bytes[32 - 1] > 0);\n            p_minus_1_bytes[32 - 1] -= 1;\n\n            let p_minus_1 = Field::from_be_bytes::<32>(p_minus_1_bytes);\n            assert_eq(p_minus_1 + 1, 0);\n\n            // checking that converting (modulus - 1) from and then to 32 BE bytes produces the same bytes\n            let p_minus_1_converted_bytes: [u8; 32] = p_minus_1.to_be_bytes();\n            assert_eq(p_minus_1_converted_bytes, p_minus_1_bytes);\n\n            // checking that incrementing this byte produces 32 BE bytes for (modulus + 1)\n            let mut p_plus_1_bytes: [u8; 32] = modulus_be_bytes().as_array();\n            assert(p_plus_1_bytes[32 - 1] < 255);\n            p_plus_1_bytes[32 - 1] += 1;\n\n            let p_plus_1 = Field::from_be_bytes::<32>(p_plus_1_bytes);\n            assert_eq(p_plus_1, 1);\n\n            // checking that converting p_plus_1 to 32 BE bytes produces the same\n            // byte set to 1 as p_plus_1_bytes and otherwise zeroes\n            let mut p_plus_1_converted_bytes: [u8; 32] = p_plus_1.to_be_bytes();\n            assert_eq(p_plus_1_converted_bytes[32 - 1], 1);\n            p_plus_1_converted_bytes[32 - 1] = 0;\n            assert_eq(p_plus_1_converted_bytes, [0; 32]);\n\n            // checking that Field::from_be_bytes::<32> on the Field modulus produces 0\n            assert_eq(modulus_be_bytes().len(), 32);\n            let p = Field::from_be_bytes::<32>(modulus_be_bytes().as_array());\n            assert_eq(p, 0);\n\n            // checking that converting 0 to 32 BE bytes produces 32 zeroes\n            let p_bytes: [u8; 32] = 0.to_be_bytes();\n            assert_eq(p_bytes, [0; 32]);\n        }\n    }\n\n    #[test]\n    fn test_to_from_le_bytes_bn254_edge_cases() {\n        if crate::compat::is_bn254() {\n            // checking that decrementing this byte produces the expected 32 LE bytes for (modulus - 1)\n            let mut p_minus_1_bytes: [u8; 32] = modulus_le_bytes().as_array();\n            assert(p_minus_1_bytes[0] > 0);\n            p_minus_1_bytes[0] -= 1;\n\n            let p_minus_1 = Field::from_le_bytes::<32>(p_minus_1_bytes);\n            assert_eq(p_minus_1 + 1, 0);\n\n            // checking that converting (modulus - 1) from and then to 32 BE bytes produces the same bytes\n            let p_minus_1_converted_bytes: [u8; 32] = p_minus_1.to_le_bytes();\n            assert_eq(p_minus_1_converted_bytes, p_minus_1_bytes);\n\n            // checking that incrementing this byte produces 32 LE bytes for (modulus + 1)\n            let mut p_plus_1_bytes: [u8; 32] = modulus_le_bytes().as_array();\n            assert(p_plus_1_bytes[0] < 255);\n            p_plus_1_bytes[0] += 1;\n\n            let p_plus_1 = Field::from_le_bytes::<32>(p_plus_1_bytes);\n            assert_eq(p_plus_1, 1);\n\n            // checking that converting p_plus_1 to 32 LE bytes produces the same\n            // byte set to 1 as p_plus_1_bytes and otherwise zeroes\n            let mut p_plus_1_converted_bytes: [u8; 32] = p_plus_1.to_le_bytes();\n            assert_eq(p_plus_1_converted_bytes[0], 1);\n            p_plus_1_converted_bytes[0] = 0;\n            assert_eq(p_plus_1_converted_bytes, [0; 32]);\n\n            // checking that Field::from_le_bytes::<32> on the Field modulus produces 0\n            assert_eq(modulus_le_bytes().len(), 32);\n            let p = Field::from_le_bytes::<32>(modulus_le_bytes().as_array());\n            assert_eq(p, 0);\n\n            // checking that converting 0 to 32 LE bytes produces 32 zeroes\n            let p_bytes: [u8; 32] = 0.to_le_bytes();\n            assert_eq(p_bytes, [0; 32]);\n        }\n    }\n\n    #[test]\n    fn test_from_le_bytes_checked_accepts_modulus_minus_one() {\n        if crate::compat::is_bn254() {\n            let mut p_minus_1_bytes: [u8; 32] = modulus_le_bytes().as_array();\n            assert(p_minus_1_bytes[0] > 0);\n            p_minus_1_bytes[0] -= 1;\n            let p_minus_1 = Field::from_le_bytes_checked::<32>(p_minus_1_bytes);\n            assert_eq(p_minus_1 + 1, 0);\n        }\n    }\n\n    #[test(should_fail_with = \"input bytes are not a canonical field representation\")]\n    fn test_from_le_bytes_checked_rejects_modulus() {\n        if crate::compat::is_bn254() {\n            let _ = Field::from_le_bytes_checked::<32>(modulus_le_bytes().as_array());\n        } else {\n            panic(\"input bytes are not a canonical field representation\");\n        }\n    }\n\n    #[test(should_fail_with = \"input bytes are not a canonical field representation\")]\n    fn test_from_le_bytes_checked_rejects_modulus_plus_one() {\n        if crate::compat::is_bn254() {\n            let mut p_plus_1_bytes: [u8; 32] = modulus_le_bytes().as_array();\n            assert(p_plus_1_bytes[0] < 255);\n            p_plus_1_bytes[0] += 1;\n            let _ = Field::from_le_bytes_checked::<32>(p_plus_1_bytes);\n        } else {\n            panic(\"input bytes are not a canonical field representation\");\n        }\n    }\n\n    #[test]\n    fn test_from_be_bytes_checked_accepts_modulus_minus_one() {\n        if crate::compat::is_bn254() {\n            let mut p_minus_1_bytes: [u8; 32] = modulus_be_bytes().as_array();\n            assert(p_minus_1_bytes[32 - 1] > 0);\n            p_minus_1_bytes[32 - 1] -= 1;\n            let p_minus_1 = Field::from_be_bytes_checked::<32>(p_minus_1_bytes);\n            assert_eq(p_minus_1 + 1, 0);\n        }\n    }\n\n    #[test(should_fail_with = \"input bytes are not a canonical field representation\")]\n    fn test_from_be_bytes_checked_rejects_modulus() {\n        if crate::compat::is_bn254() {\n            let _ = Field::from_be_bytes_checked::<32>(modulus_be_bytes().as_array());\n        } else {\n            panic(\"input bytes are not a canonical field representation\");\n        }\n    }\n\n    #[test(should_fail_with = \"input bytes are not a canonical field representation\")]\n    fn test_from_be_bytes_checked_rejects_modulus_plus_one() {\n        if crate::compat::is_bn254() {\n            let mut p_plus_1_bytes: [u8; 32] = modulus_be_bytes().as_array();\n            assert(p_plus_1_bytes[32 - 1] < 255);\n            p_plus_1_bytes[32 - 1] += 1;\n            let _ = Field::from_be_bytes_checked::<32>(p_plus_1_bytes);\n        } else {\n            panic(\"input bytes are not a canonical field representation\");\n        }\n    }\n\n    #[test]\n    fn test_from_bytes_checked_small_n() {\n        // For N < modulus_bytes().len(), the input cannot overflow the modulus, so the checked\n        // variants behave identically to the unchecked ones.\n        let le_bytes: [u8; 8] = [3, 1, 0, 0, 0, 0, 0, 0];\n        assert_eq(Field::from_le_bytes_checked::<8>(le_bytes), 259);\n        let be_bytes: [u8; 8] = [0, 0, 0, 0, 0, 0, 1, 3];\n        assert_eq(Field::from_be_bytes_checked::<8>(be_bytes), 259);\n    }\n\n    /// Convert a little endian bit array to a field element.\n    /// If the provided bit array overflows the field modulus then the Field will silently wrap around.\n    fn from_le_bits<let N: u32>(bits: [bool; N]) -> Field {\n        static_assert(\n            N <= modulus_le_bits().len(),\n            \"N must be less than or equal to modulus_le_bits().len()\",\n        );\n        let mut v = 1;\n        let mut result = 0;\n\n        for i in 0..N {\n            result += (bits[i] as Field) * v;\n            v = v * 2;\n        }\n        result\n    }\n\n    /// Convert a big endian bit array to a field element.\n    /// If the provided bit array overflows the field modulus then the Field will silently wrap around.\n    fn from_be_bits<let N: u32>(bits: [bool; N]) -> Field {\n        let mut v = 1;\n        let mut result = 0;\n\n        for i in 0..N {\n            result += (bits[N - 1 - i] as Field) * v;\n            v = v * 2;\n        }\n        result\n    }\n\n    #[test]\n    fn test_to_from_be_bits_bn254_edge_cases() {\n        if crate::compat::is_bn254() {\n            // checking that decrementing this bit produces the expected 254 BE bits for (modulus - 1)\n            let mut p_minus_1_bits: [bool; 254] = modulus_be_bits().as_array();\n            assert(p_minus_1_bits[254 - 1]);\n            p_minus_1_bits[254 - 1] = false;\n\n            let p_minus_1 = from_be_bits::<254>(p_minus_1_bits);\n            assert_eq(p_minus_1 + 1, 0);\n\n            // checking that converting (modulus - 1) from and then to 254 BE bits produces the same bits\n            let p_minus_1_converted_bits: [bool; 254] = p_minus_1.to_be_bits();\n            assert_eq(p_minus_1_converted_bits, p_minus_1_bits);\n\n            // checking that incrementing this bit produces 254 BE bits for (modulus + 4)\n            let mut p_plus_4_bits: [bool; 254] = modulus_be_bits().as_array();\n            assert(!p_plus_4_bits[254 - 3]);\n            p_plus_4_bits[254 - 3] = true;\n\n            let p_plus_4 = from_be_bits::<254>(p_plus_4_bits);\n            assert_eq(p_plus_4, 4);\n\n            // checking that converting p_plus_4 to 254 BE bits produces the same\n            // bit set to 1 as p_plus_4_bits and otherwise zeroes\n            let mut p_plus_4_converted_bits: [bool; 254] = p_plus_4.to_be_bits();\n            assert(p_plus_4_converted_bits[254 - 3]);\n            p_plus_4_converted_bits[254 - 3] = false;\n            assert_eq(p_plus_4_converted_bits, [false; 254]);\n\n            // checking that Field::from_be_bits::<254> on the Field modulus produces 0\n            assert_eq(modulus_be_bits().len(), 254);\n            let p = from_be_bits::<254>(modulus_be_bits().as_array());\n            assert_eq(p, 0);\n\n            // checking that converting 0 to 254 BE bits produces 254 false values\n            let p_bits: [bool; 254] = 0.to_be_bits();\n            assert_eq(p_bits, [false; 254]);\n        }\n    }\n\n    #[test]\n    fn test_to_from_le_bits_bn254_edge_cases() {\n        if crate::compat::is_bn254() {\n            // checking that decrementing this bit produces the expected 254 LE bits for (modulus - 1)\n            let mut p_minus_1_bits: [bool; 254] = modulus_le_bits().as_array();\n            assert(p_minus_1_bits[0]);\n            p_minus_1_bits[0] = false;\n\n            let p_minus_1 = from_le_bits::<254>(p_minus_1_bits);\n            assert_eq(p_minus_1 + 1, 0);\n\n            // checking that converting (modulus - 1) from and then to 254 BE bits produces the same bits\n            let p_minus_1_converted_bits: [bool; 254] = p_minus_1.to_le_bits();\n            assert_eq(p_minus_1_converted_bits, p_minus_1_bits);\n\n            // checking that incrementing this bit produces 254 LE bits for (modulus + 4)\n            let mut p_plus_4_bits: [bool; 254] = modulus_le_bits().as_array();\n            assert(!p_plus_4_bits[2]);\n            p_plus_4_bits[2] = true;\n\n            let p_plus_4 = from_le_bits::<254>(p_plus_4_bits);\n            assert_eq(p_plus_4, 4);\n\n            // checking that converting p_plus_4 to 254 LE bits produces the same\n            // bit set to 1 as p_plus_4_bits and otherwise zeroes\n            let mut p_plus_4_converted_bits: [bool; 254] = p_plus_4.to_le_bits();\n            assert(p_plus_4_converted_bits[2]);\n            p_plus_4_converted_bits[2] = false;\n            assert_eq(p_plus_4_converted_bits, [false; 254]);\n\n            // checking that Field::from_le_bits::<254> on the Field modulus produces 0\n            assert_eq(modulus_le_bits().len(), 254);\n            let p = from_le_bits::<254>(modulus_le_bits().as_array());\n            assert_eq(p, 0);\n\n            // checking that converting 0 to 254 LE bits produces 254 false values\n            let p_bits: [bool; 254] = 0.to_le_bits();\n            assert_eq(p_bits, [false; 254]);\n        }\n    }\n\n    #[test(should_fail_with = \"call to assert_max_bit_size\")]\n    fn max_bit_size_too_large() {\n        let x: Field = 0x010000;\n        x.assert_max_bit_size::<16>();\n    }\n\n}\n"
+      "source": "pub mod bn254;\nuse crate::{runtime::is_unconstrained, static_assert};\nuse bn254::lt as bn254_lt;\n\nimpl Field {\n    /// Asserts that `self` can be represented in `bit_size` bits.\n    ///\n    /// # Failures\n    /// Causes a constraint failure for `Field` values exceeding `2^{bit_size}`.\n    // docs:start:assert_max_bit_size\n    pub fn assert_max_bit_size<let BIT_SIZE: u32>(self) {\n        // docs:end:assert_max_bit_size\n        static_assert(\n            BIT_SIZE < modulus_num_bits() as u32,\n            \"BIT_SIZE must be less than modulus_num_bits\",\n        );\n        __assert_max_bit_size(self, BIT_SIZE);\n    }\n\n    /// Decomposes `self` into its little endian bit decomposition as a `[bool; N]` array.\n    /// This array will be zero padded should not all bits be necessary to represent `self`.\n    ///\n    /// # Failures\n    /// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting array will not\n    /// be able to represent the original `Field`.\n    ///\n    /// # Safety\n    /// The bit decomposition returned is canonical and is guaranteed to not overflow the modulus.\n    // docs:start:to_le_bits\n    pub fn to_le_bits<let N: u32>(self: Self) -> [bool; N] {\n        // docs:end:to_le_bits\n        let bits = __to_le_bits(self);\n\n        if !is_unconstrained() {\n            // Ensure that the byte decomposition does not overflow the modulus\n            let p = modulus_le_bits();\n            assert(bits.len() <= p.len());\n            let mut ok = bits.len() != p.len();\n            for i in 0..N {\n                if !ok {\n                    if (bits[N - 1 - i] != p[N - 1 - i]) {\n                        assert(p[N - 1 - i]);\n                        ok = true;\n                    }\n                }\n            }\n            assert(ok);\n        }\n        bits\n    }\n\n    /// Decomposes `self` into its big endian bit decomposition as a `[bool; N]` array.\n    /// This array will be zero padded should not all bits be necessary to represent `self`.\n    ///\n    /// # Failures\n    /// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting array will not\n    /// be able to represent the original `Field`.\n    ///\n    /// # Safety\n    /// The bit decomposition returned is canonical and is guaranteed to not overflow the modulus.\n    // docs:start:to_be_bits\n    pub fn to_be_bits<let N: u32>(self: Self) -> [bool; N] {\n        // docs:end:to_be_bits\n        let bits = __to_be_bits(self);\n\n        if !is_unconstrained() {\n            // Ensure that the decomposition does not overflow the modulus\n            let p = modulus_be_bits();\n            assert(bits.len() <= p.len());\n            let mut ok = bits.len() != p.len();\n            for i in 0..N {\n                if !ok {\n                    if (bits[i] != p[i]) {\n                        assert(p[i]);\n                        ok = true;\n                    }\n                }\n            }\n            assert(ok);\n        }\n        bits\n    }\n\n    /// Decomposes `self` into its little endian byte decomposition as a `[u8;N]` array\n    /// This array will be zero padded should not all bytes be necessary to represent `self`.\n    ///\n    /// # Failures\n    ///  The length N of the array must be big enough to contain all the bytes of the 'self',\n    ///  and no more than the number of bytes required to represent the field modulus\n    ///\n    /// # Safety\n    /// The result is ensured to be the canonical decomposition of the field element\n    // docs:start:to_le_bytes\n    pub fn to_le_bytes<let N: u32>(self: Self) -> [u8; N] {\n        // docs:end:to_le_bytes\n        static_assert(\n            N <= modulus_le_bytes().len(),\n            \"N must be less than or equal to modulus_le_bytes().len()\",\n        );\n        // Compute the byte decomposition\n        let bytes = self.to_le_radix(256);\n\n        if !is_unconstrained() {\n            // Ensure that the byte decomposition does not overflow the modulus\n            let p = modulus_le_bytes();\n            assert(bytes.len() <= p.len());\n            let mut ok = bytes.len() != p.len();\n            for i in 0..N {\n                if !ok {\n                    if (bytes[N - 1 - i] != p[N - 1 - i]) {\n                        assert(bytes[N - 1 - i] < p[N - 1 - i]);\n                        ok = true;\n                    }\n                }\n            }\n            assert(ok);\n        }\n        bytes\n    }\n\n    /// Decomposes `self` into its big endian byte decomposition as a `[u8;N]` array of length required to represent the field modulus\n    /// This array will be zero padded should not all bytes be necessary to represent `self`.\n    ///\n    /// # Failures\n    ///  The length N of the array must be big enough to contain all the bytes of the 'self',\n    ///  and no more than the number of bytes required to represent the field modulus\n    ///\n    /// # Safety\n    /// The result is ensured to be the canonical decomposition of the field element\n    // docs:start:to_be_bytes\n    pub fn to_be_bytes<let N: u32>(self: Self) -> [u8; N] {\n        // docs:end:to_be_bytes\n        static_assert(\n            N <= modulus_le_bytes().len(),\n            \"N must be less than or equal to modulus_le_bytes().len()\",\n        );\n        // Compute the byte decomposition\n        let bytes = self.to_be_radix(256);\n\n        if !is_unconstrained() {\n            // Ensure that the byte decomposition does not overflow the modulus\n            let p = modulus_be_bytes();\n            assert(bytes.len() <= p.len());\n            let mut ok = bytes.len() != p.len();\n            for i in 0..N {\n                if !ok {\n                    if (bytes[i] != p[i]) {\n                        assert(bytes[i] < p[i]);\n                        ok = true;\n                    }\n                }\n            }\n            assert(ok);\n        }\n        bytes\n    }\n\n    fn to_le_radix<let N: u32>(self: Self, radix: u32) -> [u8; N] {\n        // Brillig does not need an immediate radix\n        if !crate::runtime::is_unconstrained() {\n            static_assert(1 < radix, \"radix must be greater than 1\");\n            static_assert(radix <= 256, \"radix must be less than or equal to 256\");\n            static_assert(radix & (radix - 1) == 0, \"radix must be a power of 2\");\n        }\n        __to_le_radix(self, radix)\n    }\n\n    fn to_be_radix<let N: u32>(self: Self, radix: u32) -> [u8; N] {\n        // Brillig does not need an immediate radix\n        if !crate::runtime::is_unconstrained() {\n            static_assert(1 < radix, \"radix must be greater than 1\");\n            static_assert(radix <= 256, \"radix must be less than or equal to 256\");\n            static_assert(radix & (radix - 1) == 0, \"radix must be a power of 2\");\n        }\n        __to_be_radix(self, radix)\n    }\n\n    // Returns self to the power of the given exponent value.\n    // Caution: we assume the exponent fits into 32 bits\n    // using a bigger bit size impacts negatively the performance and should be done only if the exponent does not fit in 32 bits\n    pub fn pow_32(self, exponent: Field) -> Field {\n        let mut r: Field = 1;\n        let b: [bool; 32] = exponent.to_le_bits();\n\n        for i in 1..33 {\n            r *= r;\n            r = (b[32 - i] as Field) * (r * self) + (1 - b[32 - i] as Field) * r;\n        }\n        r\n    }\n\n    // Parity of (prime) Field element, i.e. sgn0(x mod p) = false if x `elem` {0, ..., p-1} is even, otherwise sgn0(x mod p) = true.\n    pub fn sgn0(self) -> bool {\n        (self as u8) % 2 == 1\n    }\n\n    pub fn lt(self, another: Field) -> bool {\n        if crate::compat::is_bn254() {\n            bn254_lt(self, another)\n        } else {\n            lt_fallback(self, another)\n        }\n    }\n\n    /// Convert a little endian byte array to a field element.\n    /// If the provided byte array overflows the field modulus then the Field will silently wrap around.\n    ///\n    /// # Failures\n    /// `N` must be no greater than the number of bytes required to represent the field modulus\n    // docs:start:from_le_bytes\n    pub fn from_le_bytes<let N: u32>(bytes: [u8; N]) -> Field {\n        // docs:end:from_le_bytes\n        static_assert(\n            N <= modulus_le_bytes().len(),\n            \"N must be less than or equal to modulus_le_bytes().len()\",\n        );\n        let mut v = 1;\n        let mut result = 0;\n\n        for i in 0..N {\n            result += (bytes[i] as Field) * v;\n            v = v * 256;\n        }\n        result\n    }\n\n    /// Convert a big endian byte array to a field element.\n    /// If the provided byte array overflows the field modulus then the Field will silently wrap around.\n    ///\n    /// # Failures\n    /// `N` must be no greater than the number of bytes required to represent the field modulus\n    // docs:start:from_be_bytes\n    pub fn from_be_bytes<let N: u32>(bytes: [u8; N]) -> Field {\n        // docs:end:from_be_bytes\n        static_assert(\n            N <= modulus_be_bytes().len(),\n            \"N must be less than or equal to modulus_be_bytes().len()\",\n        );\n        let mut v = 1;\n        let mut result = 0;\n\n        for i in 0..N {\n            result += (bytes[N - 1 - i] as Field) * v;\n            v = v * 256;\n        }\n        result\n    }\n\n    /// Convert a little endian byte array to a field element, asserting that the input is a\n    /// canonical representation (strictly less than the field modulus).\n    ///\n    /// # Failures\n    /// Causes a constraint failure if `bytes` encodes a value greater than or equal to the\n    /// field modulus.\n    // docs:start:from_le_bytes_checked\n    pub fn from_le_bytes_checked<let N: u32>(bytes: [u8; N]) -> Field {\n        // docs:end:from_le_bytes_checked\n        let p = modulus_le_bytes();\n        let mut ok = N != p.len();\n        for i in 0..N {\n            if !ok {\n                if bytes[N - 1 - i] != p[N - 1 - i] {\n                    assert(\n                        bytes[N - 1 - i] < p[N - 1 - i],\n                        \"input bytes are not a canonical field representation\",\n                    );\n                    ok = true;\n                }\n            }\n        }\n        assert(ok, \"input bytes are not a canonical field representation\");\n        Field::from_le_bytes(bytes)\n    }\n\n    /// Convert a big endian byte array to a field element, asserting that the input is a\n    /// canonical representation (strictly less than the field modulus).\n    ///\n    /// # Failures\n    /// Causes a constraint failure if `bytes` encodes a value greater than or equal to the\n    /// field modulus.\n    // docs:start:from_be_bytes_checked\n    pub fn from_be_bytes_checked<let N: u32>(bytes: [u8; N]) -> Field {\n        // docs:end:from_be_bytes_checked\n        let p = modulus_be_bytes();\n        let mut ok = N != p.len();\n        for i in 0..N {\n            if !ok {\n                if bytes[i] != p[i] {\n                    assert(bytes[i] < p[i], \"input bytes are not a canonical field representation\");\n                    ok = true;\n                }\n            }\n        }\n        assert(ok, \"input bytes are not a canonical field representation\");\n        Field::from_be_bytes(bytes)\n    }\n}\n\n#[builtin(apply_range_constraint)]\nfn __assert_max_bit_size(value: Field, bit_size: u32) {}\n\n// `_radix` must be less than 256\n#[builtin(to_le_radix)]\nfn __to_le_radix<let N: u32>(value: Field, radix: u32) -> [u8; N] {}\n\n// `_radix` must be less than 256\n#[builtin(to_be_radix)]\nfn __to_be_radix<let N: u32>(value: Field, radix: u32) -> [u8; N] {}\n\n/// Decomposes `self` into its little endian bit decomposition as a `[bool; N]` array.\n/// This array will be zero padded should not all bits be necessary to represent `self`.\n///\n/// # Failures\n/// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting array will not\n/// be able to represent the original `Field`.\n///\n/// # Safety\n/// Values of `N` equal to or greater than the number of bits necessary to represent the `Field` modulus\n/// (e.g. 254 for the BN254 field) allow for multiple bit decompositions. This is due to how the `Field` will\n/// wrap around due to overflow when verifying the decomposition.\n#[builtin(to_le_bits)]\nfn __to_le_bits<let N: u32>(value: Field) -> [bool; N] {}\n\n/// Decomposes `self` into its big endian bit decomposition as a `[bool; N]` array.\n/// This array will be zero padded should not all bits be necessary to represent `self`.\n///\n/// # Failures\n/// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting array will not\n/// be able to represent the original `Field`.\n///\n/// # Safety\n/// Values of `N` equal to or greater than the number of bits necessary to represent the `Field` modulus\n/// (e.g. 254 for the BN254 field) allow for multiple bit decompositions. This is due to how the `Field` will\n/// wrap around due to overflow when verifying the decomposition.\n#[builtin(to_be_bits)]\nfn __to_be_bits<let N: u32>(value: Field) -> [bool; N] {}\n\n#[builtin(modulus_num_bits)]\npub comptime fn modulus_num_bits() -> u64 {}\n\n#[builtin(modulus_be_bits)]\npub comptime fn modulus_be_bits() -> [bool] {}\n\n#[builtin(modulus_le_bits)]\npub comptime fn modulus_le_bits() -> [bool] {}\n\n#[builtin(modulus_be_bytes)]\npub comptime fn modulus_be_bytes() -> [u8] {}\n\n#[builtin(modulus_le_bytes)]\npub comptime fn modulus_le_bytes() -> [u8] {}\n\n/// An unconstrained only built in to efficiently compare fields.\n#[builtin(field_less_than)]\nunconstrained fn __field_less_than(x: Field, y: Field) -> bool {}\n\npub(crate) unconstrained fn field_less_than(x: Field, y: Field) -> bool {\n    __field_less_than(x, y)\n}\n\nfn lt_fallback(x: Field, y: Field) -> bool {\n    if is_unconstrained() {\n        // Safety: unconstrained context\n        unsafe {\n            field_less_than(x, y)\n        }\n    } else {\n        let x_bytes: [u8; 32] = x.to_le_bytes();\n        let y_bytes: [u8; 32] = y.to_le_bytes();\n        let mut x_is_lt = false;\n        let mut done = false;\n        for i in 0..32 {\n            if (!done) {\n                let x_byte = x_bytes[32 - 1 - i] as u8;\n                let y_byte = y_bytes[32 - 1 - i] as u8;\n                let bytes_match = x_byte == y_byte;\n                if !bytes_match {\n                    x_is_lt = x_byte < y_byte;\n                    done = true;\n                }\n            }\n        }\n        x_is_lt\n    }\n}\n\nmod tests {\n    use crate::{panic::panic, runtime, static_assert};\n    use super::{\n        field_less_than, modulus_be_bits, modulus_be_bytes, modulus_le_bits, modulus_le_bytes,\n    };\n\n    #[test]\n    // docs:start:to_be_bits_example\n    fn test_to_be_bits() {\n        let field = 2;\n        let bits: [bool; 8] = field.to_be_bits();\n        assert_eq(bits, [false, false, false, false, false, false, true, false]);\n    }\n    // docs:end:to_be_bits_example\n\n    #[test]\n    // docs:start:to_le_bits_example\n    fn test_to_le_bits() {\n        let field = 2;\n        let bits: [bool; 8] = field.to_le_bits();\n        assert_eq(bits, [false, true, false, false, false, false, false, false]);\n    }\n    // docs:end:to_le_bits_example\n\n    #[test]\n    // docs:start:to_be_bytes_example\n    fn test_to_be_bytes() {\n        let field = 2;\n        let bytes: [u8; 8] = field.to_be_bytes();\n        assert_eq(bytes, [0, 0, 0, 0, 0, 0, 0, 2]);\n        assert_eq(Field::from_be_bytes::<8>(bytes), field);\n    }\n    // docs:end:to_be_bytes_example\n\n    #[test]\n    // docs:start:to_le_bytes_example\n    fn test_to_le_bytes() {\n        let field = 2;\n        let bytes: [u8; 8] = field.to_le_bytes();\n        assert_eq(bytes, [2, 0, 0, 0, 0, 0, 0, 0]);\n        assert_eq(Field::from_le_bytes::<8>(bytes), field);\n    }\n    // docs:end:to_le_bytes_example\n\n    #[test]\n    // docs:start:to_be_radix_example\n    fn test_to_be_radix() {\n        // 259, in base 256, big endian, is [1, 3].\n        // i.e. 3 * 256^0 + 1 * 256^1\n        let field = 259;\n\n        // The radix (in this example, 256) must be a power of 2.\n        // The length of the returned byte array can be specified to be\n        // >= the amount of space needed.\n        let bytes: [u8; 8] = field.to_be_radix(256);\n        assert_eq(bytes, [0, 0, 0, 0, 0, 0, 1, 3]);\n        assert_eq(Field::from_be_bytes::<8>(bytes), field);\n    }\n    // docs:end:to_be_radix_example\n\n    #[test]\n    // docs:start:to_le_radix_example\n    fn test_to_le_radix() {\n        // 259, in base 256, little endian, is [3, 1].\n        // i.e. 3 * 256^0 + 1 * 256^1\n        let field = 259;\n\n        // The radix (in this example, 256) must be a power of 2.\n        // The length of the returned byte array can be specified to be\n        // >= the amount of space needed.\n        let bytes: [u8; 8] = field.to_le_radix(256);\n        assert_eq(bytes, [3, 1, 0, 0, 0, 0, 0, 0]);\n        assert_eq(Field::from_le_bytes::<8>(bytes), field);\n    }\n    // docs:end:to_le_radix_example\n\n    #[test(should_fail_with = \"radix must be greater than 1\")]\n    fn test_to_le_radix_1() {\n        // this test should only fail in constrained mode\n        if !runtime::is_unconstrained() {\n            let field = 2;\n            let _: [u8; 8] = field.to_le_radix(1);\n        } else {\n            panic(\"radix must be greater than 1\");\n        }\n    }\n\n    // Updated test to account for Brillig restriction that radix must be greater than 2\n    #[test(should_fail_with = \"radix must be greater than 1\")]\n    fn test_to_le_radix_brillig_1() {\n        // this test should only fail in constrained mode\n        if !runtime::is_unconstrained() {\n            let field = 1;\n            let _: [u8; 8] = field.to_le_radix(1);\n        } else {\n            panic(\"radix must be greater than 1\");\n        }\n    }\n\n    #[test(should_fail_with = \"radix must be a power of 2\")]\n    fn test_to_le_radix_3() {\n        // this test should only fail in constrained mode\n        if !runtime::is_unconstrained() {\n            let field = 2;\n            let _: [u8; 8] = field.to_le_radix(3);\n        } else {\n            panic(\"radix must be a power of 2\");\n        }\n    }\n\n    #[test]\n    fn test_to_le_radix_brillig_3() {\n        // this test should only fail in constrained mode\n        if runtime::is_unconstrained() {\n            let field = 1;\n            let out: [u8; 8] = field.to_le_radix(3);\n            let mut expected = [0; 8];\n            expected[0] = 1;\n            assert(out == expected, \"unexpected result\");\n        }\n    }\n\n    #[test(should_fail_with = \"radix must be less than or equal to 256\")]\n    fn test_to_le_radix_512() {\n        // this test should only fail in constrained mode\n        if !runtime::is_unconstrained() {\n            let field = 2;\n            let _: [u8; 8] = field.to_le_radix(512);\n        } else {\n            panic(\"radix must be less than or equal to 256\")\n        }\n    }\n\n    #[test(should_fail_with = \"Field failed to decompose into specified 16 limbs\")]\n    unconstrained fn not_enough_limbs_brillig() {\n        let _: [u8; 16] = 0x100000000000000000000000000000000.to_le_bytes();\n    }\n\n    #[test(should_fail_with = \"Field failed to decompose into specified 16 limbs\")]\n    fn not_enough_limbs() {\n        let _: [u8; 16] = 0x100000000000000000000000000000000.to_le_bytes();\n    }\n\n    #[test(should_fail_with = \"Field failed to decompose into specified 0 limbs\")]\n    unconstrained fn non_zero_field_to_le_bytes_zero_limbs() {\n        let _: [u8; 0] = 5.to_le_bytes();\n    }\n\n    #[test(should_fail_with = \"Field failed to decompose into specified 0 limbs\")]\n    unconstrained fn non_zero_field_to_be_bytes_zero_limbs() {\n        let _: [u8; 0] = 5.to_be_bytes();\n    }\n\n    #[test]\n    unconstrained fn zero_field_to_bytes_zero_limbs_unconstrained() {\n        assert_eq((0 as Field).to_le_bytes::<0>().len(), 0);\n        assert_eq((0 as Field).to_be_bytes::<0>().len(), 0);\n        assert_eq((0 as Field).to_le_bits::<0>().len(), 0);\n        assert_eq((0 as Field).to_be_bits::<0>().len(), 0);\n    }\n\n    #[test]\n    fn zero_field_to_bytes_zero_limbs_constrained() {\n        assert_eq((0 as Field).to_le_bytes::<0>().len(), 0);\n        assert_eq((0 as Field).to_be_bytes::<0>().len(), 0);\n        assert_eq((0 as Field).to_le_bits::<0>().len(), 0);\n        assert_eq((0 as Field).to_be_bits::<0>().len(), 0);\n    }\n\n    #[test]\n    fn zero_field_to_bytes_zero_limbs_comptime() {\n        let _: [u8; 0] = comptime { (0 as Field).to_le_bytes() };\n        let _: [u8; 0] = comptime { (0 as Field).to_be_bytes() };\n        let _: [bool; 0] = comptime { (0 as Field).to_le_bits() };\n        let _: [bool; 0] = comptime { (0 as Field).to_be_bits() };\n    }\n\n    #[test]\n    unconstrained fn test_field_less_than() {\n        assert(field_less_than(0, 1));\n        assert(field_less_than(0, 0x100));\n        assert(field_less_than(0x100, 0 - 1));\n        assert(!field_less_than(0 - 1, 0));\n    }\n\n    #[test]\n    unconstrained fn test_large_field_values_unconstrained() {\n        let large_field = 0xffffffffffffffff;\n\n        let bits: [bool; 64] = large_field.to_le_bits();\n        assert_eq(bits[0], true);\n\n        let bytes: [u8; 8] = large_field.to_le_bytes();\n        assert_eq(Field::from_le_bytes::<8>(bytes), large_field);\n\n        let radix_bytes: [u8; 8] = large_field.to_le_radix(256);\n        assert_eq(Field::from_le_bytes::<8>(radix_bytes), large_field);\n    }\n\n    #[test]\n    fn test_large_field_values() {\n        let large_val = 0xffffffffffffffff;\n\n        let bits: [bool; 64] = large_val.to_le_bits();\n        assert_eq(bits[0], true);\n\n        let bytes: [u8; 8] = large_val.to_le_bytes();\n        assert_eq(Field::from_le_bytes::<8>(bytes), large_val);\n\n        let radix_bytes: [u8; 8] = large_val.to_le_radix(256);\n        assert_eq(Field::from_le_bytes::<8>(radix_bytes), large_val);\n    }\n\n    #[test]\n    fn test_decomposition_edge_cases() {\n        let zero_bits: [bool; 8] = 0.to_le_bits();\n        assert_eq(zero_bits, [false; 8]);\n\n        let zero_bytes: [u8; 8] = 0.to_le_bytes();\n        assert_eq(zero_bytes, [0; 8]);\n\n        let one_bits: [bool; 8] = 1.to_le_bits();\n        let expected: [bool; 8] = [true, false, false, false, false, false, false, false];\n        assert_eq(one_bits, expected);\n\n        let pow2_bits: [bool; 8] = 4.to_le_bits();\n        let expected: [bool; 8] = [false, false, true, false, false, false, false, false];\n        assert_eq(pow2_bits, expected);\n    }\n\n    #[test]\n    fn test_pow_32() {\n        assert_eq(2.pow_32(3), 8);\n        assert_eq(3.pow_32(2), 9);\n        assert_eq(5.pow_32(0), 1);\n        assert_eq(7.pow_32(1), 7);\n\n        assert_eq(2.pow_32(10), 1024);\n\n        assert_eq(0.pow_32(5), 0);\n        assert_eq(0.pow_32(0), 1);\n\n        assert_eq(1.pow_32(100), 1);\n    }\n\n    #[test]\n    fn test_sgn0() {\n        assert_eq(0.sgn0(), false);\n        assert_eq(2.sgn0(), false);\n        assert_eq(4.sgn0(), false);\n        assert_eq(100.sgn0(), false);\n\n        assert_eq(1.sgn0(), true);\n        assert_eq(3.sgn0(), true);\n        assert_eq(5.sgn0(), true);\n        assert_eq(101.sgn0(), true);\n    }\n\n    #[test(should_fail_with = \"Field failed to decompose into specified 8 limbs\")]\n    fn test_bit_decomposition_overflow() {\n        // 8 bits can't represent large field values\n        let large_val = 0x1000000000000000;\n        let _: [bool; 8] = large_val.to_le_bits();\n    }\n\n    #[test(should_fail_with = \"Field failed to decompose into specified 4 limbs\")]\n    fn test_byte_decomposition_overflow() {\n        // 4 bytes can't represent large field values\n        let large_val = 0x1000000000000000;\n        let _: [u8; 4] = large_val.to_le_bytes();\n    }\n\n    #[test]\n    fn test_to_from_be_bytes_bn254_edge_cases() {\n        if crate::compat::is_bn254() {\n            // checking that decrementing this byte produces the expected 32 BE bytes for (modulus - 1)\n            let mut p_minus_1_bytes: [u8; 32] = modulus_be_bytes().as_array();\n            assert(p_minus_1_bytes[32 - 1] > 0);\n            p_minus_1_bytes[32 - 1] -= 1;\n\n            let p_minus_1 = Field::from_be_bytes::<32>(p_minus_1_bytes);\n            assert_eq(p_minus_1 + 1, 0);\n\n            // checking that converting (modulus - 1) from and then to 32 BE bytes produces the same bytes\n            let p_minus_1_converted_bytes: [u8; 32] = p_minus_1.to_be_bytes();\n            assert_eq(p_minus_1_converted_bytes, p_minus_1_bytes);\n\n            // checking that incrementing this byte produces 32 BE bytes for (modulus + 1)\n            let mut p_plus_1_bytes: [u8; 32] = modulus_be_bytes().as_array();\n            assert(p_plus_1_bytes[32 - 1] < 255);\n            p_plus_1_bytes[32 - 1] += 1;\n\n            let p_plus_1 = Field::from_be_bytes::<32>(p_plus_1_bytes);\n            assert_eq(p_plus_1, 1);\n\n            // checking that converting p_plus_1 to 32 BE bytes produces the same\n            // byte set to 1 as p_plus_1_bytes and otherwise zeroes\n            let mut p_plus_1_converted_bytes: [u8; 32] = p_plus_1.to_be_bytes();\n            assert_eq(p_plus_1_converted_bytes[32 - 1], 1);\n            p_plus_1_converted_bytes[32 - 1] = 0;\n            assert_eq(p_plus_1_converted_bytes, [0; 32]);\n\n            // checking that Field::from_be_bytes::<32> on the Field modulus produces 0\n            assert_eq(modulus_be_bytes().len(), 32);\n            let p = Field::from_be_bytes::<32>(modulus_be_bytes().as_array());\n            assert_eq(p, 0);\n\n            // checking that converting 0 to 32 BE bytes produces 32 zeroes\n            let p_bytes: [u8; 32] = 0.to_be_bytes();\n            assert_eq(p_bytes, [0; 32]);\n        }\n    }\n\n    #[test]\n    fn test_to_from_le_bytes_bn254_edge_cases() {\n        if crate::compat::is_bn254() {\n            // checking that decrementing this byte produces the expected 32 LE bytes for (modulus - 1)\n            let mut p_minus_1_bytes: [u8; 32] = modulus_le_bytes().as_array();\n            assert(p_minus_1_bytes[0] > 0);\n            p_minus_1_bytes[0] -= 1;\n\n            let p_minus_1 = Field::from_le_bytes::<32>(p_minus_1_bytes);\n            assert_eq(p_minus_1 + 1, 0);\n\n            // checking that converting (modulus - 1) from and then to 32 BE bytes produces the same bytes\n            let p_minus_1_converted_bytes: [u8; 32] = p_minus_1.to_le_bytes();\n            assert_eq(p_minus_1_converted_bytes, p_minus_1_bytes);\n\n            // checking that incrementing this byte produces 32 LE bytes for (modulus + 1)\n            let mut p_plus_1_bytes: [u8; 32] = modulus_le_bytes().as_array();\n            assert(p_plus_1_bytes[0] < 255);\n            p_plus_1_bytes[0] += 1;\n\n            let p_plus_1 = Field::from_le_bytes::<32>(p_plus_1_bytes);\n            assert_eq(p_plus_1, 1);\n\n            // checking that converting p_plus_1 to 32 LE bytes produces the same\n            // byte set to 1 as p_plus_1_bytes and otherwise zeroes\n            let mut p_plus_1_converted_bytes: [u8; 32] = p_plus_1.to_le_bytes();\n            assert_eq(p_plus_1_converted_bytes[0], 1);\n            p_plus_1_converted_bytes[0] = 0;\n            assert_eq(p_plus_1_converted_bytes, [0; 32]);\n\n            // checking that Field::from_le_bytes::<32> on the Field modulus produces 0\n            assert_eq(modulus_le_bytes().len(), 32);\n            let p = Field::from_le_bytes::<32>(modulus_le_bytes().as_array());\n            assert_eq(p, 0);\n\n            // checking that converting 0 to 32 LE bytes produces 32 zeroes\n            let p_bytes: [u8; 32] = 0.to_le_bytes();\n            assert_eq(p_bytes, [0; 32]);\n        }\n    }\n\n    #[test]\n    fn test_from_le_bytes_checked_accepts_modulus_minus_one() {\n        if crate::compat::is_bn254() {\n            let mut p_minus_1_bytes: [u8; 32] = modulus_le_bytes().as_array();\n            assert(p_minus_1_bytes[0] > 0);\n            p_minus_1_bytes[0] -= 1;\n            let p_minus_1 = Field::from_le_bytes_checked::<32>(p_minus_1_bytes);\n            assert_eq(p_minus_1 + 1, 0);\n        }\n    }\n\n    #[test(should_fail_with = \"input bytes are not a canonical field representation\")]\n    fn test_from_le_bytes_checked_rejects_modulus() {\n        if crate::compat::is_bn254() {\n            let _ = Field::from_le_bytes_checked::<32>(modulus_le_bytes().as_array());\n        } else {\n            panic(\"input bytes are not a canonical field representation\");\n        }\n    }\n\n    #[test(should_fail_with = \"input bytes are not a canonical field representation\")]\n    fn test_from_le_bytes_checked_rejects_modulus_plus_one() {\n        if crate::compat::is_bn254() {\n            let mut p_plus_1_bytes: [u8; 32] = modulus_le_bytes().as_array();\n            assert(p_plus_1_bytes[0] < 255);\n            p_plus_1_bytes[0] += 1;\n            let _ = Field::from_le_bytes_checked::<32>(p_plus_1_bytes);\n        } else {\n            panic(\"input bytes are not a canonical field representation\");\n        }\n    }\n\n    #[test]\n    fn test_from_be_bytes_checked_accepts_modulus_minus_one() {\n        if crate::compat::is_bn254() {\n            let mut p_minus_1_bytes: [u8; 32] = modulus_be_bytes().as_array();\n            assert(p_minus_1_bytes[32 - 1] > 0);\n            p_minus_1_bytes[32 - 1] -= 1;\n            let p_minus_1 = Field::from_be_bytes_checked::<32>(p_minus_1_bytes);\n            assert_eq(p_minus_1 + 1, 0);\n        }\n    }\n\n    #[test(should_fail_with = \"input bytes are not a canonical field representation\")]\n    fn test_from_be_bytes_checked_rejects_modulus() {\n        if crate::compat::is_bn254() {\n            let _ = Field::from_be_bytes_checked::<32>(modulus_be_bytes().as_array());\n        } else {\n            panic(\"input bytes are not a canonical field representation\");\n        }\n    }\n\n    #[test(should_fail_with = \"input bytes are not a canonical field representation\")]\n    fn test_from_be_bytes_checked_rejects_modulus_plus_one() {\n        if crate::compat::is_bn254() {\n            let mut p_plus_1_bytes: [u8; 32] = modulus_be_bytes().as_array();\n            assert(p_plus_1_bytes[32 - 1] < 255);\n            p_plus_1_bytes[32 - 1] += 1;\n            let _ = Field::from_be_bytes_checked::<32>(p_plus_1_bytes);\n        } else {\n            panic(\"input bytes are not a canonical field representation\");\n        }\n    }\n\n    #[test]\n    fn test_from_bytes_checked_small_n() {\n        // For N < modulus_bytes().len(), the input cannot overflow the modulus, so the checked\n        // variants behave identically to the unchecked ones.\n        let le_bytes: [u8; 8] = [3, 1, 0, 0, 0, 0, 0, 0];\n        assert_eq(Field::from_le_bytes_checked::<8>(le_bytes), 259);\n        let be_bytes: [u8; 8] = [0, 0, 0, 0, 0, 0, 1, 3];\n        assert_eq(Field::from_be_bytes_checked::<8>(be_bytes), 259);\n    }\n\n    /// Convert a little endian bit array to a field element.\n    /// If the provided bit array overflows the field modulus then the Field will silently wrap around.\n    fn from_le_bits<let N: u32>(bits: [bool; N]) -> Field {\n        static_assert(\n            N <= modulus_le_bits().len(),\n            \"N must be less than or equal to modulus_le_bits().len()\",\n        );\n        let mut v = 1;\n        let mut result = 0;\n\n        for i in 0..N {\n            result += (bits[i] as Field) * v;\n            v = v * 2;\n        }\n        result\n    }\n\n    /// Convert a big endian bit array to a field element.\n    /// If the provided bit array overflows the field modulus then the Field will silently wrap around.\n    fn from_be_bits<let N: u32>(bits: [bool; N]) -> Field {\n        let mut v = 1;\n        let mut result = 0;\n\n        for i in 0..N {\n            result += (bits[N - 1 - i] as Field) * v;\n            v = v * 2;\n        }\n        result\n    }\n\n    #[test]\n    fn test_to_from_be_bits_bn254_edge_cases() {\n        if crate::compat::is_bn254() {\n            // checking that decrementing this bit produces the expected 254 BE bits for (modulus - 1)\n            let mut p_minus_1_bits: [bool; 254] = modulus_be_bits().as_array();\n            assert(p_minus_1_bits[254 - 1]);\n            p_minus_1_bits[254 - 1] = false;\n\n            let p_minus_1 = from_be_bits::<254>(p_minus_1_bits);\n            assert_eq(p_minus_1 + 1, 0);\n\n            // checking that converting (modulus - 1) from and then to 254 BE bits produces the same bits\n            let p_minus_1_converted_bits: [bool; 254] = p_minus_1.to_be_bits();\n            assert_eq(p_minus_1_converted_bits, p_minus_1_bits);\n\n            // checking that incrementing this bit produces 254 BE bits for (modulus + 4)\n            let mut p_plus_4_bits: [bool; 254] = modulus_be_bits().as_array();\n            assert(!p_plus_4_bits[254 - 3]);\n            p_plus_4_bits[254 - 3] = true;\n\n            let p_plus_4 = from_be_bits::<254>(p_plus_4_bits);\n            assert_eq(p_plus_4, 4);\n\n            // checking that converting p_plus_4 to 254 BE bits produces the same\n            // bit set to 1 as p_plus_4_bits and otherwise zeroes\n            let mut p_plus_4_converted_bits: [bool; 254] = p_plus_4.to_be_bits();\n            assert(p_plus_4_converted_bits[254 - 3]);\n            p_plus_4_converted_bits[254 - 3] = false;\n            assert_eq(p_plus_4_converted_bits, [false; 254]);\n\n            // checking that Field::from_be_bits::<254> on the Field modulus produces 0\n            assert_eq(modulus_be_bits().len(), 254);\n            let p = from_be_bits::<254>(modulus_be_bits().as_array());\n            assert_eq(p, 0);\n\n            // checking that converting 0 to 254 BE bits produces 254 false values\n            let p_bits: [bool; 254] = 0.to_be_bits();\n            assert_eq(p_bits, [false; 254]);\n        }\n    }\n\n    #[test]\n    fn test_to_from_le_bits_bn254_edge_cases() {\n        if crate::compat::is_bn254() {\n            // checking that decrementing this bit produces the expected 254 LE bits for (modulus - 1)\n            let mut p_minus_1_bits: [bool; 254] = modulus_le_bits().as_array();\n            assert(p_minus_1_bits[0]);\n            p_minus_1_bits[0] = false;\n\n            let p_minus_1 = from_le_bits::<254>(p_minus_1_bits);\n            assert_eq(p_minus_1 + 1, 0);\n\n            // checking that converting (modulus - 1) from and then to 254 BE bits produces the same bits\n            let p_minus_1_converted_bits: [bool; 254] = p_minus_1.to_le_bits();\n            assert_eq(p_minus_1_converted_bits, p_minus_1_bits);\n\n            // checking that incrementing this bit produces 254 LE bits for (modulus + 4)\n            let mut p_plus_4_bits: [bool; 254] = modulus_le_bits().as_array();\n            assert(!p_plus_4_bits[2]);\n            p_plus_4_bits[2] = true;\n\n            let p_plus_4 = from_le_bits::<254>(p_plus_4_bits);\n            assert_eq(p_plus_4, 4);\n\n            // checking that converting p_plus_4 to 254 LE bits produces the same\n            // bit set to 1 as p_plus_4_bits and otherwise zeroes\n            let mut p_plus_4_converted_bits: [bool; 254] = p_plus_4.to_le_bits();\n            assert(p_plus_4_converted_bits[2]);\n            p_plus_4_converted_bits[2] = false;\n            assert_eq(p_plus_4_converted_bits, [false; 254]);\n\n            // checking that Field::from_le_bits::<254> on the Field modulus produces 0\n            assert_eq(modulus_le_bits().len(), 254);\n            let p = from_le_bits::<254>(modulus_le_bits().as_array());\n            assert_eq(p, 0);\n\n            // checking that converting 0 to 254 LE bits produces 254 false values\n            let p_bits: [bool; 254] = 0.to_le_bits();\n            assert_eq(p_bits, [false; 254]);\n        }\n    }\n\n    #[test(should_fail_with = \"call to assert_max_bit_size\")]\n    fn max_bit_size_too_large() {\n        let x: Field = 0x010000;\n        x.assert_max_bit_size::<16>();\n    }\n\n}\n"
     },
-    "163": {
+    "164": {
       "function_locations": [
         {
           "name": "receive",
-          "start": 2673
+          "start": 2699
         },
         {
           "name": "sync_inbox",
-          "start": 3451
+          "start": 4202
         },
         {
           "name": "test::setup",
-          "start": 5230
+          "start": 6051
         },
         {
           "name": "test::make_msg",
-          "start": 5560
+          "start": 6381
         },
         {
           "name": "test::advance_by",
-          "start": 5843
+          "start": 6664
         },
         {
           "name": "test::empty_inbox_returns_empty_result",
-          "start": 6034
+          "start": 6855
         },
         {
           "name": "test::multiple_messages_mixed_expiration",
-          "start": 6422
+          "start": 7243
+        },
+        {
+          "name": "test::accepts_messages_within_the_tolerated_future_skew",
+          "start": 9172
+        },
+        {
+          "name": "test::rejects_batch_with_implausible_future_anchor",
+          "start": 10197
         },
         {
           "name": "test::redelivery_is_idempotent",
-          "start": 8404
+          "start": 10895
         },
         {
           "name": "test::redelivery_after_processing_keeps_processed_guard",
-          "start": 9269
+          "start": 11760
         }
       ],
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/processing/offchain/mod.nr",
-      "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::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    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, protocol::address::AztecAddress, test::helpers::test_environment::TestEnvironment,\n    };\n    use super::{MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL, OffchainMessage, receive, sync_inbox};\n    use super::reception::{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    // -- 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"
+      "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"
     },
-    "164": {
+    "165": {
       "function_locations": [
         {
           "name": "OffchainReception::init",
-          "start": 8657
+          "start": 9679
         },
         {
           "name": "OffchainReception::load_all",
-          "start": 9175
+          "start": 10197
         },
         {
           "name": "OffchainReception::read_message",
-          "start": 9524
+          "start": 10546
         },
         {
           "name": "OffchainReception::id_for",
-          "start": 10225
+          "start": 11247
         },
         {
           "name": "OffchainReception::is_active",
-          "start": 10544
+          "start": 11566
         },
         {
           "name": "OffchainReception::step",
-          "start": 11199
+          "start": 12221
         },
         {
           "name": "OffchainReception::is_processed",
-          "start": 12804
+          "start": 13826
         },
         {
           "name": "OffchainReception::mark_processed",
-          "start": 13372
+          "start": 14394
         },
         {
           "name": "OffchainReception::terminate",
-          "start": 13940
+          "start": 14962
         },
         {
           "name": "to_payload",
-          "start": 14314
+          "start": 15336
         },
         {
           "name": "test::setup",
-          "start": 14871
+          "start": 15893
         },
         {
           "name": "test::make_msg",
-          "start": 15201
+          "start": 16223
         },
         {
           "name": "test::resolved_tx_at_block",
-          "start": 15485
+          "start": 16507
         },
         {
           "name": "test::resolved_tx",
-          "start": 15876
+          "start": 16898
         },
         {
           "name": "test::expired_reception_is_terminated",
-          "start": 15993
+          "start": 17015
         },
         {
           "name": "test::unresolved_reception_stays_active",
-          "start": 16675
+          "start": 17697
         },
         {
           "name": "test::resolved_reception_is_ready_to_process",
-          "start": 17470
+          "start": 18492
         },
         {
           "name": "test::already_processed_reception_is_not_re_pushed",
-          "start": 18516
+          "start": 19538
         },
         {
           "name": "test::processed_reception_terminates_once_its_origin_block_finalizes",
-          "start": 19890
+          "start": 20912
         },
         {
           "name": "test::unfinalized_processed_reception_survives_past_the_ttl",
-          "start": 21115
+          "start": 22137
         },
         {
           "name": "test::expired_reception_is_still_processed_when_its_tx_resolves",
-          "start": 22505
+          "start": 23527
         }
       ],
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/processing/offchain/reception.nr",
-      "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, OriginBlock,\n        record_non_retractable_fact, record_retractable_fact,\n    },\n    messages::processing::OffchainMessageWithTx,\n    oracle::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/// 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            OriginBlock { 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    let fields = message.serialize();\n    let payload: EphemeralArray<Field> = EphemeralArray::empty();\n    for i in 0..fields.len() {\n        payload.push(fields[i]);\n    }\n    payload\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"
+      "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, OriginBlock,\n        record_non_retractable_fact, record_retractable_fact,\n    },\n    messages::processing::OffchainMessageWithTx,\n    oracle::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            OriginBlock { 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    let fields = message.serialize();\n    let payload: EphemeralArray<Field> = EphemeralArray::empty();\n    for i in 0..fields.len() {\n        payload.push(fields[i]);\n    }\n    payload\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"
     },
     "17": {
       "function_locations": [
@@ -870,183 +890,183 @@
           "name": "keccakf1600",
           "start": 707
         },
-        {
-          "name": "keccak::keccakf1600",
-          "start": 882
-        },
         {
           "name": "blake2s",
-          "start": 1044
+          "start": 852
         },
         {
           "name": "blake3",
-          "start": 1142
+          "start": 950
         },
         {
           "name": "__blake3",
-          "start": 1629
+          "start": 1437
         },
         {
           "name": "pedersen_commitment",
-          "start": 1747
+          "start": 1555
         },
         {
           "name": "pedersen_commitment_with_separator",
-          "start": 1976
+          "start": 1784
         },
         {
           "name": "pedersen_hash",
-          "start": 2380
+          "start": 2188
         },
         {
           "name": "pedersen_hash_with_separator",
-          "start": 2537
+          "start": 2345
         },
         {
           "name": "derive_generators",
-          "start": 3531
+          "start": 3339
         },
         {
           "name": "__derive_generators",
-          "start": 3890
+          "start": 3698
         },
         {
           "name": "poseidon2_permutation",
-          "start": 3968
+          "start": 3776
         },
         {
           "name": "poseidon2_permutation_internal",
-          "start": 4324
+          "start": 4132
         },
         {
           "name": "poseidon2_config_state_size",
-          "start": 4417
+          "start": 4225
         },
         {
           "name": "derive_hash",
-          "start": 4728
+          "start": 4536
+        },
+        {
+          "name": "Hasher::finish_ref",
+          "start": 5327
         },
         {
           "name": "<impl BuildHasher for BuildHasherDefault<H>>::build_hasher",
-          "start": 5953
+          "start": 5761
         },
         {
           "name": "<impl Default for BuildHasherDefault<H>>::default",
-          "start": 6085
+          "start": 5893
         },
         {
           "name": "<impl Hash for Field>::hash",
-          "start": 6217
+          "start": 6025
         },
         {
           "name": "<impl Hash for u8>::hash",
-          "start": 6347
+          "start": 6155
         },
         {
           "name": "<impl Hash for u16>::hash",
-          "start": 6487
+          "start": 6295
         },
         {
           "name": "<impl Hash for u32>::hash",
-          "start": 6627
+          "start": 6435
         },
         {
           "name": "<impl Hash for u64>::hash",
-          "start": 6767
+          "start": 6575
         },
         {
           "name": "<impl Hash for u128>::hash",
-          "start": 6908
+          "start": 6716
         },
         {
           "name": "<impl Hash for i8>::hash",
-          "start": 7047
+          "start": 6855
         },
         {
           "name": "<impl Hash for i16>::hash",
-          "start": 7193
+          "start": 7001
         },
         {
           "name": "<impl Hash for i32>::hash",
-          "start": 7340
+          "start": 7148
         },
         {
           "name": "<impl Hash for i64>::hash",
-          "start": 7487
+          "start": 7295
         },
         {
           "name": "<impl Hash for bool>::hash",
-          "start": 7635
+          "start": 7443
         },
         {
           "name": "<impl Hash for ()>::hash",
-          "start": 7782
+          "start": 7590
         },
         {
           "name": "<impl Hash for [T; N]>::hash",
-          "start": 7914
+          "start": 7722
         },
         {
           "name": "<impl Hash for [T]>::hash",
-          "start": 8103
+          "start": 7911
         },
         {
           "name": "<impl Hash for (A,)>::hash",
-          "start": 8325
+          "start": 8133
         },
         {
           "name": "<impl Hash for (A, B)>::hash",
-          "start": 8494
+          "start": 8302
         },
         {
           "name": "<impl Hash for (A, B, C)>::hash",
-          "start": 8710
+          "start": 8518
         },
         {
           "name": "<impl Hash for (A, B, C, D)>::hash",
-          "start": 8973
+          "start": 8781
         },
         {
           "name": "<impl Hash for (A, B, C, D, E)>::hash",
-          "start": 9283
+          "start": 9091
         },
         {
           "name": "<impl Hash for (A, B, C, D, E, F)>::hash",
-          "start": 9640
+          "start": 9448
         },
         {
           "name": "<impl Hash for (A, B, C, D, E, F, G)>::hash",
-          "start": 10044
+          "start": 9852
         },
         {
           "name": "<impl Hash for (A, B, C, D, E, F, G, H_)>::hash",
-          "start": 10498
+          "start": 10306
         },
         {
           "name": "<impl Hash for (A, B, C, D, E, F, G, H_, I)>::hash",
-          "start": 10999
+          "start": 10807
         },
         {
           "name": "<impl Hash for (A, B, C, D, E, F, G, H_, I, J)>::hash",
-          "start": 11547
+          "start": 11355
         },
         {
           "name": "<impl Hash for (A, B, C, D, E, F, G, H_, I, J, K)>::hash",
-          "start": 12142
+          "start": 11950
         },
         {
           "name": "<impl Hash for (A, B, C, D, E, F, G, H_, I, J, K, L)>::hash",
-          "start": 12785
+          "start": 12593
         },
         {
           "name": "assert_pedersen",
-          "start": 13379
+          "start": 13187
         }
       ],
       "path": "std/hash/mod.nr",
-      "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\npub mod keccak {\n    #[deprecated(\"This function has been moved to std::hash::keccakf1600\")]\n    pub fn keccakf1600(input: [u64; 25]) -> [u64; 25] {\n        super::keccakf1600(input)\n    }\n}\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"
+      "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"
     },
-    "184": {
+    "185": {
       "function_locations": [
         {
           "name": "get_auth_witness_oracle",
@@ -1072,7 +1092,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/auth_witness.nr",
       "source": "#[oracle(aztec_utl_getAuthWitness)]\nunconstrained fn get_auth_witness_oracle<let N: u32>(_message_hash: Field) -> [Field; N] {}\n\n/// Oracle wrapper to fetch an `auth_witness` for a given `message_hash` from the PXE.\npub unconstrained fn get_auth_witness<let N: u32>(message_hash: Field) -> [Field; N] {\n    get_auth_witness_oracle(message_hash)\n}\n\n/// Fetches an auth witness and casts each field to a byte.\n///\n/// Each field is range-checked to `[0, 256)` before casting to prevent silent truncation (e.g. a field value of\n/// `b + 256` would truncate to the same byte as `b`).\npub unconstrained fn get_auth_witness_as_bytes<let N: u32>(message_hash: Field) -> [u8; N] {\n    let witness = get_auth_witness::<N>(message_hash);\n    let mut result: [u8; N] = [0; N];\n    for i in 0..N {\n        assert(witness[i].lt(256), \"auth witness field is not a single byte\");\n        result[i] = witness[i] as u8;\n    }\n    result\n}\n\nmod test {\n    use super::get_auth_witness_as_bytes;\n    use std::test::OracleMock;\n\n    #[test]\n    unconstrained fn get_auth_witness_as_bytes_casts_valid_witness() {\n        let witness: [Field; 3] = [0, 127, 255];\n        let _ = OracleMock::mock(\"aztec_utl_getAuthWitness\").returns(witness);\n        let bytes: [u8; 3] = get_auth_witness_as_bytes(0);\n        assert_eq(bytes, [0, 127, 255]);\n    }\n\n    #[test(should_fail_with = \"auth witness field is not a single byte\")]\n    unconstrained fn get_auth_witness_as_bytes_rejects_field_above_byte_range() {\n        let witness: [Field; 1] = [256];\n        let _ = OracleMock::mock(\"aztec_utl_getAuthWitness\").returns(witness);\n        let _: [u8; 1] = get_auth_witness_as_bytes(0);\n    }\n}\n"
     },
-    "187": {
+    "188": {
       "function_locations": [
         {
           "name": "call_private_function_oracle",
@@ -1086,7 +1106,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/call_private_function.nr",
       "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"
     },
-    "189": {
+    "190": {
       "function_locations": [
         {
           "name": "store",
@@ -1180,7 +1200,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/capsules.nr",
       "source": "use crate::protocol::{address::AztecAddress, traits::{Deserialize, Serialize}};\n\n/// Stores arbitrary information in a per-contract non-volatile database, which can later be retrieved with `load`. If\n/// data was already stored at this slot, it is overwritten.\n// TODO(F-498): review naming consistency\npub unconstrained fn store<T>(contract_address: AztecAddress, slot: Field, value: T, scope: AztecAddress)\nwhere\n    T: Serialize,\n{\n    let serialized = value.serialize();\n    set_capsule_oracle(contract_address, slot, serialized, scope);\n}\n\n/// Returns data previously stored via `storeCapsule` in the per-contract non-volatile database. Returns\n/// Option::none() if nothing was stored at the given slot.\n// TODO(F-498): review naming consistency\npub unconstrained fn load<T>(contract_address: AztecAddress, slot: Field, scope: AztecAddress) -> Option<T>\nwhere\n    T: Deserialize,\n{\n    let serialized_option = get_capsule_oracle(contract_address, slot, <T as Deserialize>::N, scope);\n    serialized_option.map(|arr| Deserialize::deserialize(arr))\n}\n\n/// Deletes data in the per-contract non-volatile database. Does nothing if no data was present.\npub unconstrained fn delete(contract_address: AztecAddress, slot: Field, scope: AztecAddress) {\n    delete_oracle(contract_address, slot, scope);\n}\n\n/// Copies a number of contiguous entries in the per-contract non-volatile database. This allows for efficient data\n/// structures by avoiding repeated calls to `loadCapsule` and `storeCapsule`. Supports overlapping source and\n/// destination regions (which will result in the overlapped source values being overwritten). All copied slots must\n/// exist in the database (i.e. have been stored and not deleted)\npub unconstrained fn copy(\n    contract_address: AztecAddress,\n    src_slot: Field,\n    dst_slot: Field,\n    num_entries: u32,\n    scope: AztecAddress,\n) {\n    copy_oracle(contract_address, src_slot, dst_slot, num_entries, scope);\n}\n\n#[oracle(aztec_utl_setCapsule)]\nunconstrained fn set_capsule_oracle<let N: u32>(\n    contract_address: AztecAddress,\n    slot: Field,\n    values: [Field; N],\n    scope: AztecAddress,\n) {}\n\n/// We need to pass in `array_len` (the value of N) as a parameter to tell the oracle how many fields the response must\n/// have.\n///\n/// Note that the oracle returns an Option<[Field; N]> because we cannot return an Option<T> directly. That would\n/// require for the oracle resolver to know the shape of T (e.g. if T were a struct of 3 u32 values then the expected\n/// response shape would be 3 single items, whereas it were a struct containing `u32, [Field;10], u32` then the\n/// expected shape would be single, array, single.). Instead, we return the serialization and deserialize in Noir.\n#[oracle(aztec_utl_getCapsule)]\nunconstrained fn get_capsule_oracle<let N: u32>(\n    contract_address: AztecAddress,\n    slot: Field,\n    array_len: u32,\n    scope: AztecAddress,\n) -> Option<[Field; N]> {}\n\n#[oracle(aztec_utl_deleteCapsule)]\nunconstrained fn delete_oracle(contract_address: AztecAddress, slot: Field, scope: AztecAddress) {}\n\n#[oracle(aztec_utl_copyCapsule)]\nunconstrained fn copy_oracle(\n    contract_address: AztecAddress,\n    src_slot: Field,\n    dst_slot: Field,\n    num_entries: u32,\n    scope: AztecAddress,\n) {}\n\nmod test {\n    // These tests are sort of redundant since we already test the oracle implementation directly in TypeScript, but\n    // they are cheap regardless and help ensure both that the TXE implementation works accordingly and that the Noir\n    // oracles are hooked up correctly.\n\n    use crate::{\n        oracle::capsules::{copy, delete, load, store},\n        test::{helpers::test_environment::TestEnvironment, mocks::MockStruct},\n    };\n    use crate::protocol::{address::AztecAddress, traits::{FromField, ToField}};\n\n    global SLOT: Field = 1;\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    #[test]\n    unconstrained fn stores_and_loads() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let value = MockStruct::new(5, 6);\n            store(contract_address, SLOT, value, scope);\n\n            assert_eq(load(contract_address, SLOT, scope).unwrap(), value);\n        });\n    }\n\n    #[test]\n    unconstrained fn store_overwrites() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let value = MockStruct::new(5, 6);\n            store(contract_address, SLOT, value, scope);\n\n            let new_value = MockStruct::new(7, 8);\n            store(contract_address, SLOT, new_value, scope);\n\n            assert_eq(load(contract_address, SLOT, scope).unwrap(), new_value);\n        });\n    }\n\n    #[test]\n    unconstrained fn loads_empty_slot() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let loaded_value: Option<MockStruct> = load(contract_address, SLOT, scope);\n            assert_eq(loaded_value, Option::none());\n        });\n    }\n\n    #[test]\n    unconstrained fn deletes_stored_value() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let value = MockStruct::new(5, 6);\n            store(contract_address, SLOT, value, scope);\n            delete(contract_address, SLOT, scope);\n\n            let loaded_value: Option<MockStruct> = load(contract_address, SLOT, scope);\n            assert_eq(loaded_value, Option::none());\n        });\n    }\n\n    #[test]\n    unconstrained fn deletes_empty_slot() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            delete(contract_address, SLOT, scope);\n            let loaded_value: Option<MockStruct> = load(contract_address, SLOT, scope);\n            assert_eq(loaded_value, Option::none());\n        });\n    }\n\n    #[test]\n    unconstrained fn copies_non_overlapping_values() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let src = 5;\n\n            let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n            store(contract_address, src, values[0], scope);\n            store(contract_address, src + 1, values[1], scope);\n            store(contract_address, src + 2, values[2], scope);\n\n            let dst = 10;\n            copy(contract_address, src, dst, 3, scope);\n\n            assert_eq(load(contract_address, dst, scope).unwrap(), values[0]);\n            assert_eq(load(contract_address, dst + 1, scope).unwrap(), values[1]);\n            assert_eq(load(contract_address, dst + 2, scope).unwrap(), values[2]);\n        });\n    }\n\n    #[test]\n    unconstrained fn copies_overlapping_values_with_src_ahead() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let src = 1;\n\n            let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n            store(contract_address, src, values[0], scope);\n            store(contract_address, src + 1, values[1], scope);\n            store(contract_address, src + 2, values[2], scope);\n\n            let dst = 2;\n            copy(contract_address, src, dst, 3, scope);\n\n            assert_eq(load(contract_address, dst, scope).unwrap(), values[0]);\n            assert_eq(load(contract_address, dst + 1, scope).unwrap(), values[1]);\n            assert_eq(load(contract_address, dst + 2, scope).unwrap(), values[2]);\n\n            // src[1] and src[2] should have been overwritten since they are also dst[0] and dst[1]\n            assert_eq(load(contract_address, src, scope).unwrap(), values[0]); // src[0] (unchanged)\n            assert_eq(load(contract_address, src + 1, scope).unwrap(), values[0]); // dst[0]\n            assert_eq(load(contract_address, src + 2, scope).unwrap(), values[1]); // dst[1]\n        });\n    }\n\n    #[test]\n    unconstrained fn copies_overlapping_values_with_dst_ahead() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let src = 2;\n\n            let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n            store(contract_address, src, values[0], scope);\n            store(contract_address, src + 1, values[1], scope);\n            store(contract_address, src + 2, values[2], scope);\n\n            let dst = 1;\n            copy(contract_address, src, dst, 3, scope);\n\n            assert_eq(load(contract_address, dst, scope).unwrap(), values[0]);\n            assert_eq(load(contract_address, dst + 1, scope).unwrap(), values[1]);\n            assert_eq(load(contract_address, dst + 2, scope).unwrap(), values[2]);\n\n            // src[0] and src[1] should have been overwritten since they are also dst[1] and dst[2]\n            assert_eq(load(contract_address, src, scope).unwrap(), values[1]); // dst[1]\n            assert_eq(load(contract_address, src + 1, scope).unwrap(), values[2]); // dst[2]\n            assert_eq(load(contract_address, src + 2, scope).unwrap(), values[2]); // src[2] (unchanged)\n        });\n    }\n\n    #[test(should_fail_with = \"copy empty slot\")]\n    unconstrained fn cannot_copy_empty_values() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            copy(contract_address, SLOT, SLOT, 1, scope);\n        });\n    }\n\n    #[test(should_fail_with = \"not allowed to access\")]\n    unconstrained fn cannot_store_other_contract() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n            let value = MockStruct::new(5, 6);\n            store(other_contract_address, SLOT, value, scope);\n        });\n    }\n\n    #[test(should_fail_with = \"not allowed to access\")]\n    unconstrained fn cannot_load_other_contract() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n            let _: Option<MockStruct> = load(other_contract_address, SLOT, scope);\n        });\n    }\n\n    #[test(should_fail_with = \"not allowed to access\")]\n    unconstrained fn cannot_delete_other_contract() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n            delete(other_contract_address, SLOT, scope);\n        });\n    }\n\n    #[test(should_fail_with = \"not allowed to access\")]\n    unconstrained fn cannot_copy_other_contract() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n            copy(other_contract_address, SLOT, SLOT, 0, scope);\n        });\n    }\n}\n"
     },
-    "190": {
+    "191": {
       "function_locations": [
         {
           "name": "set_contract_sync_cache_invalid_oracle",
@@ -1194,7 +1214,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/contract_sync.nr",
       "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"
     },
-    "192": {
+    "193": {
       "function_locations": [
         {
           "name": "get_utility_context_oracle",
@@ -1208,7 +1228,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/execution.nr",
       "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"
     },
-    "193": {
+    "194": {
       "function_locations": [
         {
           "name": "store",
@@ -1234,7 +1254,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/execution_cache.nr",
       "source": "/// Stores values represented as slice in execution cache to be later obtained by its hash.\n// TODO(F-498): review naming consistency\npub fn store<let N: u32>(values: [Field; N], hash: Field) {\n    // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe to\n    // call. When loading the values, however, the caller must check that the values are indeed the preimage.\n    unsafe { set_hash_preimage_oracle_wrapper(values, hash) };\n}\n\nunconstrained fn set_hash_preimage_oracle_wrapper<let N: u32>(values: [Field; N], hash: Field) {\n    set_hash_preimage_oracle(values, hash);\n}\n\n// TODO(F-498): review naming consistency\npub unconstrained fn load<let N: u32>(hash: Field) -> [Field; N] {\n    get_hash_preimage_oracle(hash)\n}\n\n#[oracle(aztec_prv_setHashPreimage)]\nunconstrained fn set_hash_preimage_oracle<let N: u32>(_values: [Field; N], _hash: Field) {}\n\n#[oracle(aztec_prv_getHashPreimage)]\nunconstrained fn get_hash_preimage_oracle<let N: u32>(_hash: Field) -> [Field; N] {}\n"
     },
-    "195": {
+    "196": {
       "function_locations": [
         {
           "name": "get_contract_instance_oracle",
@@ -1300,7 +1320,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/get_contract_instance.nr",
       "source": "use crate::protocol::{\n    address::AztecAddress, contract_class_id::ContractClassId, contract_instance::ContractInstance, traits::FromField,\n};\n\n// NOTE: this is for use in private only\n#[oracle(aztec_utl_getContractInstance)]\nunconstrained fn get_contract_instance_oracle(_address: AztecAddress) -> ContractInstance {}\n\n// NOTE: this is for use in private only\nunconstrained fn get_contract_instance_internal(address: AztecAddress) -> ContractInstance {\n    get_contract_instance_oracle(address)\n}\n\n/// Returns `address`'s [`ContractInstance`].\npub fn get_contract_instance(address: AztecAddress) -> ContractInstance {\n    // Safety: The to_address function combines all values in the instance object to produce an address, so by checking\n    // that we get the expected address we validate the entire struct.\n    let instance = unsafe { get_contract_instance_internal(address) };\n    assert_eq(instance.to_address(), address);\n\n    instance\n}\n\n#[derive(Eq)]\npub(crate) struct GetContractInstanceResult {\n    pub(crate) exists: bool,\n    pub(crate) member: Field,\n}\n\n// These oracles each return a ContractInstance member plus a boolean indicating whether the instance was found.\n#[oracle(aztec_avm_getContractInstanceDeployer)]\nunconstrained fn get_contract_instance_deployer_oracle_avm(_address: AztecAddress) -> [GetContractInstanceResult; 1] {}\n#[oracle(aztec_avm_getContractInstanceClassId)]\nunconstrained fn get_contract_instance_current_class_id_oracle_avm(\n    _address: AztecAddress,\n) -> [GetContractInstanceResult; 1] {}\n#[oracle(aztec_avm_getContractInstanceInitializationHash)]\nunconstrained fn get_contract_instance_initialization_hash_oracle_avm(\n    _address: AztecAddress,\n) -> [GetContractInstanceResult; 1] {}\n#[oracle(aztec_avm_getContractInstanceImmutablesHash)]\nunconstrained fn get_contract_instance_immutables_hash_oracle_avm(\n    _address: AztecAddress,\n) -> [GetContractInstanceResult; 1] {}\n\nunconstrained fn get_contract_instance_deployer_internal_avm(address: AztecAddress) -> [GetContractInstanceResult; 1] {\n    get_contract_instance_deployer_oracle_avm(address)\n}\nunconstrained fn get_contract_instance_current_class_id_internal_avm(\n    address: AztecAddress,\n) -> [GetContractInstanceResult; 1] {\n    get_contract_instance_current_class_id_oracle_avm(address)\n}\nunconstrained fn get_contract_instance_initialization_hash_internal_avm(\n    address: AztecAddress,\n) -> [GetContractInstanceResult; 1] {\n    get_contract_instance_initialization_hash_oracle_avm(address)\n}\nunconstrained fn get_contract_instance_immutables_hash_internal_avm(\n    address: AztecAddress,\n) -> [GetContractInstanceResult; 1] {\n    get_contract_instance_immutables_hash_oracle_avm(address)\n}\n\npub fn get_contract_instance_deployer_avm(address: AztecAddress) -> Option<AztecAddress> {\n    // Safety: AVM opcodes are constrained by the AVM itself\n    let GetContractInstanceResult { exists, member } =\n        unsafe { get_contract_instance_deployer_internal_avm(address)[0] };\n    if exists {\n        Option::some(AztecAddress::from_field(member))\n    } else {\n        Option::none()\n    }\n}\n/// Returns `address` current contract class, or `Option::none` if unpublished.\n///\n/// The current contract class is the one that would be used to determine the code of the contract's functions if it\n/// were to be executed in this transaction. This is not necessarily the contract's original class if it has been\n/// upgraded via the `ContractInstanceRegistry`, and it could similarly change in the future.\npub fn get_contract_instance_current_class_id_avm(address: AztecAddress) -> Option<ContractClassId> {\n    // Safety: AVM opcodes are constrained by the AVM itself\n    let GetContractInstanceResult { exists, member } =\n        unsafe { get_contract_instance_current_class_id_internal_avm(address)[0] };\n    if exists {\n        Option::some(ContractClassId::from_field(member))\n    } else {\n        Option::none()\n    }\n}\npub fn get_contract_instance_initialization_hash_avm(address: AztecAddress) -> Option<Field> {\n    // Safety: AVM opcodes are constrained by the AVM itself\n    let GetContractInstanceResult { exists, member } =\n        unsafe { get_contract_instance_initialization_hash_internal_avm(address)[0] };\n    if exists {\n        Option::some(member)\n    } else {\n        Option::none()\n    }\n}\npub fn get_contract_instance_immutables_hash_avm(address: AztecAddress) -> Option<Field> {\n    // Safety: AVM opcodes are constrained by the AVM itself\n    let GetContractInstanceResult { exists, member } =\n        unsafe { get_contract_instance_immutables_hash_internal_avm(address)[0] };\n    if exists {\n        Option::some(member)\n    } else {\n        Option::none()\n    }\n}\n"
     },
-    "198": {
+    "199": {
       "function_locations": [
         {
           "name": "get_low_nullifier_membership_witness_oracle",
@@ -1322,7 +1342,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/get_nullifier_membership_witness.nr",
       "source": "use crate::protocol::{\n    abis::{block_header::BlockHeader, nullifier_leaf_preimage::NullifierLeafPreimage},\n    constants::NULLIFIER_TREE_HEIGHT,\n    merkle_tree::MembershipWitness,\n    traits::Hash,\n};\n\n#[oracle(aztec_utl_getLowNullifierMembershipWitness)]\nunconstrained fn get_low_nullifier_membership_witness_oracle(\n    _block_hash: Field,\n    _nullifier: Field,\n) -> (NullifierLeafPreimage, MembershipWitness<NULLIFIER_TREE_HEIGHT>) {}\n\n/// Returns a leaf preimage and membership witness for the low nullifier of `nullifier` in the nullifier tree whose\n/// root is defined in `block_header`.\n///\n/// The low nullifier is the leaf with the largest value that is still smaller than `nullifier`. This is used to prove\n/// non-inclusion: if the low nullifier's `next_value` is greater than `nullifier`, then `nullifier` is not in the\n/// tree.\npub unconstrained fn get_low_nullifier_membership_witness(\n    block_header: BlockHeader,\n    nullifier: Field,\n) -> (NullifierLeafPreimage, MembershipWitness<NULLIFIER_TREE_HEIGHT>) {\n    let block_hash = block_header.hash();\n    get_low_nullifier_membership_witness_oracle(block_hash, nullifier)\n}\n\n#[oracle(aztec_utl_getNullifierMembershipWitness)]\nunconstrained fn get_nullifier_membership_witness_oracle(\n    _block_hash: Field,\n    _nullifier: Field,\n) -> (NullifierLeafPreimage, MembershipWitness<NULLIFIER_TREE_HEIGHT>) {}\n\n/// Returns a leaf preimage and membership witness for `nullifier` in the nullifier tree whose root is defined in\n/// `block_header`.\n///\n/// This is used to prove that a nullifier exists in the tree (inclusion proof).\npub unconstrained fn get_nullifier_membership_witness(\n    block_header: BlockHeader,\n    nullifier: Field,\n) -> (NullifierLeafPreimage, MembershipWitness<NULLIFIER_TREE_HEIGHT>) {\n    let block_hash = block_header.hash();\n    get_nullifier_membership_witness_oracle(block_hash, nullifier)\n}\n"
     },
-    "206": {
+    "207": {
       "function_locations": [
         {
           "name": "notify_created_nullifier",
@@ -1352,7 +1372,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/nullifiers.nr",
       "source": "//! Nullifier creation, existence checks, etc.\n\nuse crate::protocol::address::aztec_address::AztecAddress;\n\n/// Notifies the simulator that a nullifier has been created, so that its correct status (pending or settled) can be\n/// determined when reading nullifiers in subsequent private function calls. The first non-revertible nullifier emitted\n/// is also used to compute note nonces.\npub fn notify_created_nullifier(inner_nullifier: Field) {\n    // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe to\n    // call.\n    unsafe { notify_created_nullifier_oracle(inner_nullifier) };\n}\n\n#[oracle(aztec_prv_notifyCreatedNullifier)]\nunconstrained fn notify_created_nullifier_oracle(_inner_nullifier: Field) {}\n\n/// Returns `true` if the nullifier has been emitted in the same transaction, i.e. if [`notify_created_nullifier`] has\n/// been\n/// called for this inner nullifier from the contract with the specified address.\n///\n/// Note that despite sharing pending transaction information with the app, this is not a privacy leak: anyone in the\n/// network can always determine in which transaction a inner nullifier was emitted by a given contract by simply\n/// inspecting transaction effects. What _would_ constitute a leak would be to share the list of inner pending\n/// nullifiers, as that would reveal their preimages.\npub unconstrained fn is_nullifier_pending(inner_nullifier: Field, contract_address: AztecAddress) -> bool {\n    is_nullifier_pending_oracle(inner_nullifier, contract_address)\n}\n\n#[oracle(aztec_prv_isNullifierPending)]\nunconstrained fn is_nullifier_pending_oracle(_inner_nullifier: Field, _contract_address: AztecAddress) -> bool {}\n\n/// Returns `true` if the nullifier exists. Note that a `true` value can be constrained by proving existence of the\n/// nullifier, but a `false` value should not be relied upon since other transactions may emit this nullifier before\n/// the current transaction is included in a block. While this might seem of little use at first, certain design\n/// patterns benefit from this abstraction (see e.g. `PrivateMutable`).\n// TODO(F-498): review naming consistency\npub unconstrained fn check_nullifier_exists(inner_nullifier: Field) -> bool {\n    does_nullifier_exist_oracle(inner_nullifier)\n}\n\n#[oracle(aztec_utl_doesNullifierExist)]\nunconstrained fn does_nullifier_exist_oracle(_inner_nullifier: Field) -> bool {}\n"
     },
-    "208": {
+    "209": {
       "function_locations": [
         {
           "name": "assert_valid_public_call_data",
@@ -1370,7 +1390,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/public_call.nr",
       "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"
     },
-    "209": {
+    "210": {
       "function_locations": [
         {
           "name": "random",
@@ -1384,7 +1404,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/random.nr",
       "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"
     },
-    "215": {
+    "216": {
       "function_locations": [
         {
           "name": "notify_revertible_phase_start",
@@ -1410,7 +1430,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/tx_phase.nr",
       "source": "/// Notifies PXE of the side effect counter at which the revertible phase begins.\n///\n/// PXE uses it to classify notes and nullifiers as revertible or non-revertible in its note cache. This information is\n/// then fed to kernels as hints.\npub(crate) fn notify_revertible_phase_start(counter: u32) {\n    // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe to\n    // call.\n    unsafe { notify_revertible_phase_start_oracle_wrapper(counter) };\n}\n\n/// Returns whether a side effect counter falls in the revertible phase of the transaction.\npub(crate) unconstrained fn is_execution_in_revertible_phase(current_counter: u32) -> bool {\n    is_execution_in_revertible_phase_oracle(current_counter)\n}\n\nunconstrained fn notify_revertible_phase_start_oracle_wrapper(counter: u32) {\n    notify_revertible_phase_start_oracle(counter);\n}\n\n#[oracle(aztec_prv_notifyRevertiblePhaseStart)]\nunconstrained fn notify_revertible_phase_start_oracle(_counter: u32) {}\n\n#[oracle(aztec_prv_isExecutionInRevertiblePhase)]\nunconstrained fn is_execution_in_revertible_phase_oracle(current_counter: u32) -> bool {}\n"
     },
-    "217": {
+    "218": {
       "function_locations": [
         {
           "name": "assert_compatible_oracle_version",
@@ -1434,9 +1454,9 @@
         }
       ],
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/version.nr",
-      "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 = 30;\npub global ORACLE_VERSION_MINOR: Field = 5;\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"
+      "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 = 30;\npub global ORACLE_VERSION_MINOR: Field = 8;\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"
     },
-    "272": {
+    "273": {
       "function_locations": [
         {
           "name": "UnconstrainedArray<T, Oracle>::at",
@@ -1506,7 +1526,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/unconstrained_array/mod.nr",
       "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 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"
     },
-    "296": {
+    "297": {
       "function_locations": [
         {
           "name": "Poseidon2::hash",
@@ -1558,175 +1578,171 @@
           "name": "[T; N]::as_vector",
           "start": 735
         },
-        {
-          "name": "[T; N]::as_slice",
-          "start": 1112
-        },
         {
           "name": "[T; N]::map",
-          "start": 1443
+          "start": 1066
         },
         {
           "name": "[T; N]::mapi",
-          "start": 2004
+          "start": 1627
         },
         {
           "name": "[T; N]::for_each",
-          "start": 2552
+          "start": 2175
         },
         {
           "name": "[T; N]::for_eachi",
-          "start": 2970
+          "start": 2593
         },
         {
           "name": "[T; N]::fold",
-          "start": 3837
+          "start": 3460
         },
         {
           "name": "[T; N]::reduce",
-          "start": 4355
+          "start": 3978
         },
         {
           "name": "[T; N]::all",
-          "start": 4865
+          "start": 4488
         },
         {
           "name": "[T; N]::any",
-          "start": 5338
+          "start": 4961
         },
         {
           "name": "[T; N]::concat",
-          "start": 5881
+          "start": 5504
         },
         {
           "name": "[T; N]::sort",
-          "start": 6778
+          "start": 6401
         },
         {
           "name": "[T; N]::sort_via",
-          "start": 7794
+          "start": 7417
         },
         {
           "name": "[u8; N]::as_str_unchecked",
-          "start": 8944
+          "start": 8567
         },
         {
           "name": "<impl From<str<N>> for [u8; N]>::from",
-          "start": 9071
+          "start": 8694
         },
         {
           "name": "test::map_empty",
-          "start": 9145
+          "start": 8768
         },
         {
           "name": "test::sort_u32",
-          "start": 10255
+          "start": 9878
         },
         {
           "name": "test::test_sort",
-          "start": 10310
+          "start": 9933
         },
         {
           "name": "test::test_sort_empty",
-          "start": 10536
+          "start": 10159
         },
         {
           "name": "test::test_sort_via_empty",
-          "start": 10682
+          "start": 10305
         },
         {
           "name": "test::test_sort_100_values",
-          "start": 10841
+          "start": 10464
         },
         {
           "name": "test::test_sort_100_values_comptime",
-          "start": 12009
+          "start": 11632
         },
         {
           "name": "test::test_sort_via",
-          "start": 12154
+          "start": 11777
         },
         {
           "name": "test::test_sort_via_100_values",
-          "start": 12401
+          "start": 12024
         },
         {
           "name": "test::mapi_empty",
-          "start": 13562
+          "start": 13185
         },
         {
           "name": "test::for_each_empty",
-          "start": 13657
+          "start": 13280
         },
         {
           "name": "test::for_eachi_empty",
-          "start": 13795
+          "start": 13418
         },
         {
           "name": "test::map_example",
-          "start": 13934
+          "start": 13557
         },
         {
           "name": "test::mapi_example",
-          "start": 14071
+          "start": 13694
         },
         {
           "name": "test::for_each_example",
-          "start": 14220
+          "start": 13843
         },
         {
           "name": "test::for_eachi_example",
-          "start": 14560
+          "start": 14183
         },
         {
           "name": "test::concat",
-          "start": 14771
+          "start": 14394
         },
         {
           "name": "test::concat_zero_length_with_something",
-          "start": 15030
+          "start": 14653
         },
         {
           "name": "test::concat_something_with_zero_length",
-          "start": 15233
+          "start": 14856
         },
         {
           "name": "test::concat_zero_lengths",
-          "start": 15422
+          "start": 15045
         },
         {
           "name": "test::test_fold",
-          "start": 15623
+          "start": 15246
         },
         {
           "name": "test::test_reduce",
-          "start": 15788
+          "start": 15411
         },
         {
           "name": "test::test_reduce_failure_on_empty_array",
-          "start": 15999
+          "start": 15622
         },
         {
           "name": "test::test_all",
-          "start": 16147
+          "start": 15770
         },
         {
           "name": "test::test_any",
-          "start": 16296
+          "start": 15919
         },
         {
           "name": "test::test_to_string",
-          "start": 16451
+          "start": 16074
         },
         {
           "name": "test::test_bytes_from_string",
-          "start": 16597
+          "start": 16220
         }
       ],
       "path": "std/array/mod.nr",
-      "source": "use crate::cmp::{Eq, Ord};\nuse crate::convert::From;\nuse crate::runtime::is_unconstrained;\n\nmod check_shuffle;\nmod quicksort;\n\nimpl<T, let N: u32> [T; N] {\n    /// Returns the length of this array.\n    ///\n    /// ```noir\n    /// fn len(self) -> Field\n    /// ```\n    ///\n    /// example\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let array = [42, 42];\n    ///     assert(array.len() == 2);\n    /// }\n    /// ```\n    #[builtin(array_len)]\n    pub fn len(self) -> u32 {}\n\n    /// Returns this array as a vector.\n    ///\n    /// ```noir\n    /// let array = [1, 2];\n    /// let vector = array.as_vector();\n    /// assert_eq(vector, [1, 2].as_vector());\n    /// ```\n    #[builtin(as_vector)]\n    pub fn as_vector(self) -> [T] {}\n\n    /// Returns this array as a vector.\n    /// This method is deprecated in favor of `as_vector`.\n    ///\n    /// ```noir\n    /// let array = [1, 2];\n    /// let vector = array.as_slice();\n    /// assert_eq(vector, [1, 2].as_vector());\n    /// ```\n    #[builtin(as_vector)]\n    #[deprecated(\"This method has been renamed to `as_vector`\")]\n    pub fn as_slice(self) -> [T] {}\n\n    /// Applies a function to each element of this array, returning a new array containing the mapped elements.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// let a = [1, 2, 3];\n    /// let b = a.map(|a| a * 2);\n    /// assert_eq(b, [2, 4, 6]);\n    /// ```\n    pub fn map<U, Env>(&self, f: fn[Env](T) -> U) -> [U; N] {\n        let uninitialized = crate::mem::zeroed();\n        let mut ret = [uninitialized; N];\n\n        for i in 0..self.len() {\n            ret[i] = f(self[i]);\n        }\n\n        ret\n    }\n\n    /// Applies a function to each element of this array along with its index,\n    /// returning a new array containing the mapped elements.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// let a = [1, 2, 3];\n    /// let b = a.mapi(|i, a| i + a * 2);\n    /// assert_eq(b, [2, 5, 8]);\n    /// ```\n    pub fn mapi<U, Env>(&self, f: fn[Env](u32, T) -> U) -> [U; N] {\n        let uninitialized = crate::mem::zeroed();\n        let mut ret = [uninitialized; N];\n\n        for i in 0..self.len() {\n            ret[i] = f(i, self[i]);\n        }\n\n        ret\n    }\n\n    /// Applies a function to each element of this array.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// let a = [1, 2, 3];\n    /// let mut b = [0; 3];\n    /// let mut i = 0;\n    /// a.for_each(|x| {\n    ///     b[i] = x;\n    ///     i += 1;\n    /// });\n    /// assert_eq(a, b);\n    /// ```\n    pub fn for_each<Env>(&self, f: fn[Env](T) -> ()) {\n        for i in 0..self.len() {\n            f(self[i]);\n        }\n    }\n\n    /// Applies a function to each element of this array along with its index.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// let a = [1, 2, 3];\n    /// let mut b = [0; 3];\n    /// a.for_eachi(|i, x| {\n    ///     b[i] = x;\n    /// });\n    /// assert_eq(a, b);\n    /// ```\n    pub fn for_eachi<Env>(&self, f: fn[Env](u32, T) -> ()) {\n        for i in 0..self.len() {\n            f(i, self[i]);\n        }\n    }\n\n    /// Applies a function to each element of the array, returning the final accumulated value. The first\n    /// parameter is the initial value.\n    ///\n    /// This is a left fold, so the given function will be applied to the accumulator and first element of\n    /// the array, then the second, and so on. For a given call the expected result would be equivalent to:\n    ///\n    /// ```rust\n    /// let a1 = [1];\n    /// let a2 = [1, 2];\n    /// let a3 = [1, 2, 3];\n    ///\n    /// let f = |a, b| a - b;\n    /// a1.fold(10, f); //=> f(10, 1)\n    /// a2.fold(10, f); //=> f(f(10, 1), 2)\n    /// a3.fold(10, f); //=> f(f(f(10, 1), 2), 3)\n    ///\n    /// assert_eq(a3.fold(10, f), 10 - 1 - 2 - 3);\n    /// ```\n    pub fn fold<U, Env>(&self, mut accumulator: U, f: fn[Env](U, T) -> U) -> U {\n        for elem in self {\n            accumulator = f(accumulator, elem);\n        }\n        accumulator\n    }\n\n    /// Same as fold, but uses the first element as the starting element.\n    ///\n    /// Requires the input array to be non-empty.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let arr = [1, 2, 3, 4];\n    ///     let reduced = arr.reduce(|a, b| a + b);\n    ///     assert(reduced == 10);\n    /// }\n    /// ```\n    pub fn reduce<Env>(&self, f: fn[Env](T, T) -> T) -> T {\n        let mut accumulator = self[0];\n        for i in 1..self.len() {\n            accumulator = f(accumulator, self[i]);\n        }\n        accumulator\n    }\n\n    /// Returns true if all the elements in this array satisfy the given predicate.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let arr = [2, 2, 2, 2, 2];\n    ///     let all = arr.all(|a| a == 2);\n    ///     assert(all);\n    /// }\n    /// ```\n    pub fn all<Env>(&self, predicate: fn[Env](T) -> bool) -> bool {\n        let mut ret = true;\n        for elem in self {\n            ret &= predicate(elem);\n        }\n        ret\n    }\n\n    /// Returns true if any of the elements in this array satisfy the given predicate.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let arr = [2, 2, 2, 2, 5];\n    ///     let any = arr.any(|a| a == 5);\n    ///     assert(any);\n    /// }\n    /// ```\n    pub fn any<Env>(&self, predicate: fn[Env](T) -> bool) -> bool {\n        let mut ret = false;\n        for elem in self {\n            ret |= predicate(elem);\n        }\n        ret\n    }\n\n    /// Concatenates this array with another array.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let arr1 = [1, 2, 3, 4];\n    ///     let arr2 = [6, 7, 8, 9, 10, 11];\n    ///     let concatenated_arr = arr1.concat(arr2);\n    ///     assert(concatenated_arr == [1, 2, 3, 4, 6, 7, 8, 9, 10, 11]);\n    /// }\n    /// ```\n    pub fn concat<let M: u32>(&self, array2: [T; M]) -> [T; N + M] {\n        let mut result = [crate::mem::zeroed(); N + M];\n        for i in 0..N {\n            result[i] = self[i];\n        }\n        for i in 0..M {\n            result[i + N] = array2[i];\n        }\n        result\n    }\n}\n\nimpl<T, let N: u32> [T; N]\nwhere\n    T: Ord + Eq,\n{\n    /// Returns a new sorted array. The original array remains untouched. Notice that this function will\n    /// only work for arrays of fields or integers, not for any arbitrary type. This is because the sorting\n    /// logic it uses internally is optimized specifically for these values. If you need a sort function to\n    /// sort any type, you should use the [`Self::sort_via`] function.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// fn main() {\n    ///     let arr = [42, 32];\n    ///     let sorted = arr.sort();\n    ///     assert(sorted == [32, 42]);\n    /// }\n    /// ```\n    pub fn sort(&self) -> Self {\n        self.sort_via(|a, b| a <= b)\n    }\n}\n\nimpl<T, let N: u32> [T; N]\nwhere\n    T: Eq,\n{\n    /// Returns a new sorted array by sorting it with a custom comparison function.\n    /// The original array remains untouched.\n    /// The ordering function must return true if the first argument should be sorted to be before the second argument or is equal to the second argument.\n    ///\n    /// Using this method with an operator like `<` that does not return `true` for equal values will result in an assertion failure for arrays with equal elements.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// fn main() {\n    ///     let arr = [42, 32]\n    ///     let sorted_ascending = arr.sort_via(|a, b| a <= b);\n    ///     assert(sorted_ascending == [32, 42]); // verifies\n    ///\n    ///     let sorted_descending = arr.sort_via(|a, b| a >= b);\n    ///     assert(sorted_descending == [32, 42]); // does not verify\n    /// }\n    /// ```\n    pub fn sort_via<Env>(&self, ordering: fn[Env](T, T) -> bool) -> Self {\n        if N != 0 {\n            // Safety: `sorted` array is checked to be:\n            // a. a permutation of `input`'s elements\n            // b. satisfying the predicate `ordering`\n            let sorted = unsafe { quicksort::quicksort(self, ordering) };\n\n            if !is_unconstrained() {\n                for i in 0..N - 1 {\n                    assert(\n                        ordering(sorted[i], sorted[i + 1]),\n                        \"Array has not been sorted correctly according to `ordering`.\",\n                    );\n                }\n                check_shuffle::check_shuffle(self, &sorted);\n            }\n            sorted\n        } else {\n            *self\n        }\n    }\n}\n\nimpl<let N: u32> [u8; N] {\n    /// Converts a byte array of type `[u8; N]` to a string. Note that this performs no UTF-8 validation -\n    /// the given array is interpreted as-is as a string.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// fn main() {\n    ///     let hi = [104, 105].as_str_unchecked();\n    ///     assert_eq(hi, \"hi\");\n    /// }\n    /// ```\n    #[builtin(array_as_str_unchecked)]\n    pub fn as_str_unchecked(self) -> str<N> {}\n}\n\nimpl<let N: u32> From<str<N>> for [u8; N] {\n    /// Returns an array of the string bytes.\n    fn from(s: str<N>) -> Self {\n        s.as_bytes()\n    }\n}\n\nmod test {\n    #[test]\n    fn map_empty() {\n        assert_eq([].map(|x| x + 1), []);\n    }\n\n    global arr_with_100_values: [u32; 100] = [\n        42, 123, 87, 93, 48, 80, 50, 5, 104, 84, 70, 47, 119, 66, 71, 121, 3, 29, 42, 118, 2, 54,\n        89, 44, 81, 0, 26, 106, 68, 96, 84, 48, 95, 54, 45, 32, 89, 100, 109, 19, 37, 41, 19, 98,\n        53, 114, 107, 66, 6, 74, 13, 19, 105, 64, 123, 28, 44, 50, 89, 58, 123, 126, 21, 43, 86, 35,\n        21, 62, 82, 0, 108, 120, 72, 72, 62, 80, 12, 71, 70, 86, 116, 73, 38, 15, 127, 81, 30, 8,\n        125, 28, 26, 69, 114, 63, 27, 28, 61, 42, 13, 32,\n    ];\n    global expected_with_100_values: [u32; 100] = [\n        0, 0, 2, 3, 5, 6, 8, 12, 13, 13, 15, 19, 19, 19, 21, 21, 26, 26, 27, 28, 28, 28, 29, 30, 32,\n        32, 35, 37, 38, 41, 42, 42, 42, 43, 44, 44, 45, 47, 48, 48, 50, 50, 53, 54, 54, 58, 61, 62,\n        62, 63, 64, 66, 66, 68, 69, 70, 70, 71, 71, 72, 72, 73, 74, 80, 80, 81, 81, 82, 84, 84, 86,\n        86, 87, 89, 89, 89, 93, 95, 96, 98, 100, 104, 105, 106, 107, 108, 109, 114, 114, 116, 118,\n        119, 120, 121, 123, 123, 123, 125, 126, 127,\n    ];\n    fn sort_u32(a: u32, b: u32) -> bool {\n        a <= b\n    }\n\n    #[test]\n    fn test_sort() {\n        let arr: [u32; 7] = [3, 6, 8, 10, 1, 2, 1];\n\n        let sorted = arr.sort();\n\n        let expected: [u32; 7] = [1, 1, 2, 3, 6, 8, 10];\n        assert(sorted == expected);\n    }\n\n    #[test]\n    fn test_sort_empty() {\n        let arr: [u32; 0] = [];\n        let sorted = arr.sort();\n        assert(sorted == arr);\n    }\n\n    #[test]\n    fn test_sort_via_empty() {\n        let arr: [u32; 0] = [];\n        let sorted = arr.sort_via(sort_u32);\n        assert(sorted == arr);\n    }\n\n    #[test]\n    fn test_sort_100_values() {\n        let arr: [u32; 100] = [\n            42, 123, 87, 93, 48, 80, 50, 5, 104, 84, 70, 47, 119, 66, 71, 121, 3, 29, 42, 118, 2,\n            54, 89, 44, 81, 0, 26, 106, 68, 96, 84, 48, 95, 54, 45, 32, 89, 100, 109, 19, 37, 41,\n            19, 98, 53, 114, 107, 66, 6, 74, 13, 19, 105, 64, 123, 28, 44, 50, 89, 58, 123, 126, 21,\n            43, 86, 35, 21, 62, 82, 0, 108, 120, 72, 72, 62, 80, 12, 71, 70, 86, 116, 73, 38, 15,\n            127, 81, 30, 8, 125, 28, 26, 69, 114, 63, 27, 28, 61, 42, 13, 32,\n        ];\n\n        let sorted = arr.sort();\n\n        let expected: [u32; 100] = [\n            0, 0, 2, 3, 5, 6, 8, 12, 13, 13, 15, 19, 19, 19, 21, 21, 26, 26, 27, 28, 28, 28, 29, 30,\n            32, 32, 35, 37, 38, 41, 42, 42, 42, 43, 44, 44, 45, 47, 48, 48, 50, 50, 53, 54, 54, 58,\n            61, 62, 62, 63, 64, 66, 66, 68, 69, 70, 70, 71, 71, 72, 72, 73, 74, 80, 80, 81, 81, 82,\n            84, 84, 86, 86, 87, 89, 89, 89, 93, 95, 96, 98, 100, 104, 105, 106, 107, 108, 109, 114,\n            114, 116, 118, 119, 120, 121, 123, 123, 123, 125, 126, 127,\n        ];\n        assert(sorted == expected);\n    }\n\n    #[test]\n    fn test_sort_100_values_comptime() {\n        let sorted = arr_with_100_values.sort();\n        assert(sorted == expected_with_100_values);\n    }\n\n    #[test]\n    fn test_sort_via() {\n        let arr: [u32; 7] = [3, 6, 8, 10, 1, 2, 1];\n\n        let sorted = arr.sort_via(sort_u32);\n\n        let expected: [u32; 7] = [1, 1, 2, 3, 6, 8, 10];\n        assert(sorted == expected);\n    }\n\n    #[test]\n    fn test_sort_via_100_values() {\n        let arr: [u32; 100] = [\n            42, 123, 87, 93, 48, 80, 50, 5, 104, 84, 70, 47, 119, 66, 71, 121, 3, 29, 42, 118, 2,\n            54, 89, 44, 81, 0, 26, 106, 68, 96, 84, 48, 95, 54, 45, 32, 89, 100, 109, 19, 37, 41,\n            19, 98, 53, 114, 107, 66, 6, 74, 13, 19, 105, 64, 123, 28, 44, 50, 89, 58, 123, 126, 21,\n            43, 86, 35, 21, 62, 82, 0, 108, 120, 72, 72, 62, 80, 12, 71, 70, 86, 116, 73, 38, 15,\n            127, 81, 30, 8, 125, 28, 26, 69, 114, 63, 27, 28, 61, 42, 13, 32,\n        ];\n\n        let sorted = arr.sort_via(sort_u32);\n\n        let expected: [u32; 100] = [\n            0, 0, 2, 3, 5, 6, 8, 12, 13, 13, 15, 19, 19, 19, 21, 21, 26, 26, 27, 28, 28, 28, 29, 30,\n            32, 32, 35, 37, 38, 41, 42, 42, 42, 43, 44, 44, 45, 47, 48, 48, 50, 50, 53, 54, 54, 58,\n            61, 62, 62, 63, 64, 66, 66, 68, 69, 70, 70, 71, 71, 72, 72, 73, 74, 80, 80, 81, 81, 82,\n            84, 84, 86, 86, 87, 89, 89, 89, 93, 95, 96, 98, 100, 104, 105, 106, 107, 108, 109, 114,\n            114, 116, 118, 119, 120, 121, 123, 123, 123, 125, 126, 127,\n        ];\n        assert(sorted == expected);\n    }\n\n    #[test]\n    fn mapi_empty() {\n        assert_eq([].mapi(|i, x| i * x + 1), []);\n    }\n\n    #[test]\n    fn for_each_empty() {\n        let empty_array: [Field; 0] = [];\n        empty_array.for_each(|_x| assert(false));\n    }\n\n    #[test]\n    fn for_eachi_empty() {\n        let empty_array: [Field; 0] = [];\n        empty_array.for_eachi(|_i, _x| assert(false));\n    }\n\n    #[test]\n    fn map_example() {\n        let a = [1, 2, 3];\n        let b = a.map(|a| a * 2);\n        assert_eq(b, [2, 4, 6]);\n    }\n\n    #[test]\n    fn mapi_example() {\n        let a = [1, 2, 3];\n        let b = a.mapi(|i, a| i + a * 2);\n        assert_eq(b, [2, 5, 8]);\n    }\n\n    #[test]\n    fn for_each_example() {\n        let a = [1, 2, 3];\n        let mut b = [0, 0, 0];\n        let b_ref = &mut b;\n        let mut i = 0;\n        let i_ref = &mut i;\n        a.for_each(|x| {\n            b_ref[*i_ref] = x * 2;\n            *i_ref += 1;\n        });\n        assert_eq(b, [2, 4, 6]);\n        assert_eq(i, 3);\n    }\n\n    #[test]\n    fn for_eachi_example() {\n        let a = [1, 2, 3];\n        let mut b = [0, 0, 0];\n        let b_ref = &mut b;\n        a.for_eachi(|i, a| { b_ref[i] = i + a * 2; });\n        assert_eq(b, [2, 5, 8]);\n    }\n\n    #[test]\n    fn concat() {\n        let arr1 = [1, 2, 3, 4];\n        let arr2 = [6, 7, 8, 9, 10, 11];\n        let concatenated_arr = arr1.concat(arr2);\n        assert_eq(concatenated_arr, [1, 2, 3, 4, 6, 7, 8, 9, 10, 11]);\n    }\n\n    #[test]\n    fn concat_zero_length_with_something() {\n        let arr1 = [];\n        let arr2 = [1];\n        let concatenated_arr = arr1.concat(arr2);\n        assert_eq(concatenated_arr, [1]);\n    }\n\n    #[test]\n    fn concat_something_with_zero_length() {\n        let arr1 = [1];\n        let arr2 = [];\n        let concatenated_arr = arr1.concat(arr2);\n        assert_eq(concatenated_arr, [1]);\n    }\n\n    #[test]\n    fn concat_zero_lengths() {\n        let arr1: [Field; 0] = [];\n        let arr2: [Field; 0] = [];\n        let concatenated_arr = arr1.concat(arr2);\n        assert_eq(concatenated_arr, []);\n    }\n\n    #[test]\n    fn test_fold() {\n        let array = [1, 2, 3];\n        let sum_plus_10 = array.fold(10, |x, y| x + y);\n        assert_eq(sum_plus_10, 16);\n    }\n\n    #[test]\n    fn test_reduce() {\n        let array = [1, 2, 3];\n        let sum = array.reduce(|x, y| x + y);\n        assert_eq(sum, 6);\n    }\n\n    #[test(should_fail_with = \"Index out of bounds\")]\n    fn test_reduce_failure_on_empty_array() {\n        let array: [Field; 0] = [];\n        let sum = array.reduce(|x, y| x + y);\n        assert_eq(sum, 6);\n    }\n\n    #[test]\n    fn test_all() {\n        let array = [1, 2, 3];\n        assert(array.all(|x| x >= 1));\n        assert(!array.all(|x| x >= 2));\n    }\n\n    #[test]\n    fn test_any() {\n        let array = [1, 2, 3];\n        assert(array.any(|x| x >= 3));\n        assert(!array.any(|x| x >= 4));\n    }\n\n    #[test]\n    fn test_to_string() {\n        let str = [78_u8, 111, 105, 114].as_str_unchecked();\n        assert_eq(str, \"Noir\");\n    }\n\n    #[test]\n    fn test_bytes_from_string() {\n        let bytes: [u8; 4] = crate::convert::From::from(\"Noir\");\n        assert_eq(bytes, [78_u8, 111, 105, 114]);\n    }\n}\n"
+      "source": "use crate::cmp::{Eq, Ord};\nuse crate::convert::From;\nuse crate::runtime::is_unconstrained;\n\nmod check_shuffle;\nmod quicksort;\n\nimpl<T, let N: u32> [T; N] {\n    /// Returns the length of this array.\n    ///\n    /// ```noir\n    /// fn len(self) -> Field\n    /// ```\n    ///\n    /// example\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let array = [42, 42];\n    ///     assert(array.len() == 2);\n    /// }\n    /// ```\n    #[builtin(array_len)]\n    pub fn len(self) -> u32 {}\n\n    /// Returns this array as a vector.\n    ///\n    /// ```noir\n    /// let array = [1, 2];\n    /// let vector = array.as_vector();\n    /// assert_eq(vector, [1, 2].as_vector());\n    /// ```\n    #[builtin(as_vector)]\n    pub fn as_vector(self) -> [T] {}\n\n    /// Applies a function to each element of this array, returning a new array containing the mapped elements.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// let a = [1, 2, 3];\n    /// let b = a.map(|a| a * 2);\n    /// assert_eq(b, [2, 4, 6]);\n    /// ```\n    pub fn map<U, Env>(&self, f: fn[Env](T) -> U) -> [U; N] {\n        let uninitialized = crate::mem::zeroed();\n        let mut ret = [uninitialized; N];\n\n        for i in 0..self.len() {\n            ret[i] = f(self[i]);\n        }\n\n        ret\n    }\n\n    /// Applies a function to each element of this array along with its index,\n    /// returning a new array containing the mapped elements.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// let a = [1, 2, 3];\n    /// let b = a.mapi(|i, a| i + a * 2);\n    /// assert_eq(b, [2, 5, 8]);\n    /// ```\n    pub fn mapi<U, Env>(&self, f: fn[Env](u32, T) -> U) -> [U; N] {\n        let uninitialized = crate::mem::zeroed();\n        let mut ret = [uninitialized; N];\n\n        for i in 0..self.len() {\n            ret[i] = f(i, self[i]);\n        }\n\n        ret\n    }\n\n    /// Applies a function to each element of this array.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// let a = [1, 2, 3];\n    /// let mut b = [0; 3];\n    /// let mut i = 0;\n    /// a.for_each(|x| {\n    ///     b[i] = x;\n    ///     i += 1;\n    /// });\n    /// assert_eq(a, b);\n    /// ```\n    pub fn for_each<Env>(&self, f: fn[Env](T) -> ()) {\n        for i in 0..self.len() {\n            f(self[i]);\n        }\n    }\n\n    /// Applies a function to each element of this array along with its index.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// let a = [1, 2, 3];\n    /// let mut b = [0; 3];\n    /// a.for_eachi(|i, x| {\n    ///     b[i] = x;\n    /// });\n    /// assert_eq(a, b);\n    /// ```\n    pub fn for_eachi<Env>(&self, f: fn[Env](u32, T) -> ()) {\n        for i in 0..self.len() {\n            f(i, self[i]);\n        }\n    }\n\n    /// Applies a function to each element of the array, returning the final accumulated value. The first\n    /// parameter is the initial value.\n    ///\n    /// This is a left fold, so the given function will be applied to the accumulator and first element of\n    /// the array, then the second, and so on. For a given call the expected result would be equivalent to:\n    ///\n    /// ```rust\n    /// let a1 = [1];\n    /// let a2 = [1, 2];\n    /// let a3 = [1, 2, 3];\n    ///\n    /// let f = |a, b| a - b;\n    /// a1.fold(10, f); //=> f(10, 1)\n    /// a2.fold(10, f); //=> f(f(10, 1), 2)\n    /// a3.fold(10, f); //=> f(f(f(10, 1), 2), 3)\n    ///\n    /// assert_eq(a3.fold(10, f), 10 - 1 - 2 - 3);\n    /// ```\n    pub fn fold<U, Env>(&self, mut accumulator: U, f: fn[Env](U, T) -> U) -> U {\n        for elem in self {\n            accumulator = f(accumulator, elem);\n        }\n        accumulator\n    }\n\n    /// Same as fold, but uses the first element as the starting element.\n    ///\n    /// Requires the input array to be non-empty.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let arr = [1, 2, 3, 4];\n    ///     let reduced = arr.reduce(|a, b| a + b);\n    ///     assert(reduced == 10);\n    /// }\n    /// ```\n    pub fn reduce<Env>(&self, f: fn[Env](T, T) -> T) -> T {\n        let mut accumulator = self[0];\n        for i in 1..self.len() {\n            accumulator = f(accumulator, self[i]);\n        }\n        accumulator\n    }\n\n    /// Returns true if all the elements in this array satisfy the given predicate.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let arr = [2, 2, 2, 2, 2];\n    ///     let all = arr.all(|a| a == 2);\n    ///     assert(all);\n    /// }\n    /// ```\n    pub fn all<Env>(&self, predicate: fn[Env](T) -> bool) -> bool {\n        let mut ret = true;\n        for elem in self {\n            ret &= predicate(elem);\n        }\n        ret\n    }\n\n    /// Returns true if any of the elements in this array satisfy the given predicate.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let arr = [2, 2, 2, 2, 5];\n    ///     let any = arr.any(|a| a == 5);\n    ///     assert(any);\n    /// }\n    /// ```\n    pub fn any<Env>(&self, predicate: fn[Env](T) -> bool) -> bool {\n        let mut ret = false;\n        for elem in self {\n            ret |= predicate(elem);\n        }\n        ret\n    }\n\n    /// Concatenates this array with another array.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let arr1 = [1, 2, 3, 4];\n    ///     let arr2 = [6, 7, 8, 9, 10, 11];\n    ///     let concatenated_arr = arr1.concat(arr2);\n    ///     assert(concatenated_arr == [1, 2, 3, 4, 6, 7, 8, 9, 10, 11]);\n    /// }\n    /// ```\n    pub fn concat<let M: u32>(&self, array2: [T; M]) -> [T; N + M] {\n        let mut result = [crate::mem::zeroed(); N + M];\n        for i in 0..N {\n            result[i] = self[i];\n        }\n        for i in 0..M {\n            result[i + N] = array2[i];\n        }\n        result\n    }\n}\n\nimpl<T, let N: u32> [T; N]\nwhere\n    T: Ord + Eq,\n{\n    /// Returns a new sorted array. The original array remains untouched. Notice that this function will\n    /// only work for arrays of fields or integers, not for any arbitrary type. This is because the sorting\n    /// logic it uses internally is optimized specifically for these values. If you need a sort function to\n    /// sort any type, you should use the [`Self::sort_via`] function.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// fn main() {\n    ///     let arr = [42, 32];\n    ///     let sorted = arr.sort();\n    ///     assert(sorted == [32, 42]);\n    /// }\n    /// ```\n    pub fn sort(&self) -> Self {\n        self.sort_via(|a, b| a <= b)\n    }\n}\n\nimpl<T, let N: u32> [T; N]\nwhere\n    T: Eq,\n{\n    /// Returns a new sorted array by sorting it with a custom comparison function.\n    /// The original array remains untouched.\n    /// The ordering function must return true if the first argument should be sorted to be before the second argument or is equal to the second argument.\n    ///\n    /// Using this method with an operator like `<` that does not return `true` for equal values will result in an assertion failure for arrays with equal elements.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// fn main() {\n    ///     let arr = [42, 32]\n    ///     let sorted_ascending = arr.sort_via(|a, b| a <= b);\n    ///     assert(sorted_ascending == [32, 42]); // verifies\n    ///\n    ///     let sorted_descending = arr.sort_via(|a, b| a >= b);\n    ///     assert(sorted_descending == [32, 42]); // does not verify\n    /// }\n    /// ```\n    pub fn sort_via<Env>(&self, ordering: fn[Env](T, T) -> bool) -> Self {\n        if N != 0 {\n            // Safety: `sorted` array is checked to be:\n            // a. a permutation of `input`'s elements\n            // b. satisfying the predicate `ordering`\n            let sorted = unsafe { quicksort::quicksort(self, ordering) };\n\n            if !is_unconstrained() {\n                for i in 0..N - 1 {\n                    assert(\n                        ordering(sorted[i], sorted[i + 1]),\n                        \"Array has not been sorted correctly according to `ordering`.\",\n                    );\n                }\n                check_shuffle::check_shuffle(self, &sorted);\n            }\n            sorted\n        } else {\n            *self\n        }\n    }\n}\n\nimpl<let N: u32> [u8; N] {\n    /// Converts a byte array of type `[u8; N]` to a string. Note that this performs no UTF-8 validation -\n    /// the given array is interpreted as-is as a string.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// fn main() {\n    ///     let hi = [104, 105].as_str_unchecked();\n    ///     assert_eq(hi, \"hi\");\n    /// }\n    /// ```\n    #[builtin(array_as_str_unchecked)]\n    pub fn as_str_unchecked(self) -> str<N> {}\n}\n\nimpl<let N: u32> From<str<N>> for [u8; N] {\n    /// Returns an array of the string bytes.\n    fn from(s: str<N>) -> Self {\n        s.as_bytes()\n    }\n}\n\nmod test {\n    #[test]\n    fn map_empty() {\n        assert_eq([].map(|x| x + 1), []);\n    }\n\n    global arr_with_100_values: [u32; 100] = [\n        42, 123, 87, 93, 48, 80, 50, 5, 104, 84, 70, 47, 119, 66, 71, 121, 3, 29, 42, 118, 2, 54,\n        89, 44, 81, 0, 26, 106, 68, 96, 84, 48, 95, 54, 45, 32, 89, 100, 109, 19, 37, 41, 19, 98,\n        53, 114, 107, 66, 6, 74, 13, 19, 105, 64, 123, 28, 44, 50, 89, 58, 123, 126, 21, 43, 86, 35,\n        21, 62, 82, 0, 108, 120, 72, 72, 62, 80, 12, 71, 70, 86, 116, 73, 38, 15, 127, 81, 30, 8,\n        125, 28, 26, 69, 114, 63, 27, 28, 61, 42, 13, 32,\n    ];\n    global expected_with_100_values: [u32; 100] = [\n        0, 0, 2, 3, 5, 6, 8, 12, 13, 13, 15, 19, 19, 19, 21, 21, 26, 26, 27, 28, 28, 28, 29, 30, 32,\n        32, 35, 37, 38, 41, 42, 42, 42, 43, 44, 44, 45, 47, 48, 48, 50, 50, 53, 54, 54, 58, 61, 62,\n        62, 63, 64, 66, 66, 68, 69, 70, 70, 71, 71, 72, 72, 73, 74, 80, 80, 81, 81, 82, 84, 84, 86,\n        86, 87, 89, 89, 89, 93, 95, 96, 98, 100, 104, 105, 106, 107, 108, 109, 114, 114, 116, 118,\n        119, 120, 121, 123, 123, 123, 125, 126, 127,\n    ];\n    fn sort_u32(a: u32, b: u32) -> bool {\n        a <= b\n    }\n\n    #[test]\n    fn test_sort() {\n        let arr: [u32; 7] = [3, 6, 8, 10, 1, 2, 1];\n\n        let sorted = arr.sort();\n\n        let expected: [u32; 7] = [1, 1, 2, 3, 6, 8, 10];\n        assert(sorted == expected);\n    }\n\n    #[test]\n    fn test_sort_empty() {\n        let arr: [u32; 0] = [];\n        let sorted = arr.sort();\n        assert(sorted == arr);\n    }\n\n    #[test]\n    fn test_sort_via_empty() {\n        let arr: [u32; 0] = [];\n        let sorted = arr.sort_via(sort_u32);\n        assert(sorted == arr);\n    }\n\n    #[test]\n    fn test_sort_100_values() {\n        let arr: [u32; 100] = [\n            42, 123, 87, 93, 48, 80, 50, 5, 104, 84, 70, 47, 119, 66, 71, 121, 3, 29, 42, 118, 2,\n            54, 89, 44, 81, 0, 26, 106, 68, 96, 84, 48, 95, 54, 45, 32, 89, 100, 109, 19, 37, 41,\n            19, 98, 53, 114, 107, 66, 6, 74, 13, 19, 105, 64, 123, 28, 44, 50, 89, 58, 123, 126, 21,\n            43, 86, 35, 21, 62, 82, 0, 108, 120, 72, 72, 62, 80, 12, 71, 70, 86, 116, 73, 38, 15,\n            127, 81, 30, 8, 125, 28, 26, 69, 114, 63, 27, 28, 61, 42, 13, 32,\n        ];\n\n        let sorted = arr.sort();\n\n        let expected: [u32; 100] = [\n            0, 0, 2, 3, 5, 6, 8, 12, 13, 13, 15, 19, 19, 19, 21, 21, 26, 26, 27, 28, 28, 28, 29, 30,\n            32, 32, 35, 37, 38, 41, 42, 42, 42, 43, 44, 44, 45, 47, 48, 48, 50, 50, 53, 54, 54, 58,\n            61, 62, 62, 63, 64, 66, 66, 68, 69, 70, 70, 71, 71, 72, 72, 73, 74, 80, 80, 81, 81, 82,\n            84, 84, 86, 86, 87, 89, 89, 89, 93, 95, 96, 98, 100, 104, 105, 106, 107, 108, 109, 114,\n            114, 116, 118, 119, 120, 121, 123, 123, 123, 125, 126, 127,\n        ];\n        assert(sorted == expected);\n    }\n\n    #[test]\n    fn test_sort_100_values_comptime() {\n        let sorted = arr_with_100_values.sort();\n        assert(sorted == expected_with_100_values);\n    }\n\n    #[test]\n    fn test_sort_via() {\n        let arr: [u32; 7] = [3, 6, 8, 10, 1, 2, 1];\n\n        let sorted = arr.sort_via(sort_u32);\n\n        let expected: [u32; 7] = [1, 1, 2, 3, 6, 8, 10];\n        assert(sorted == expected);\n    }\n\n    #[test]\n    fn test_sort_via_100_values() {\n        let arr: [u32; 100] = [\n            42, 123, 87, 93, 48, 80, 50, 5, 104, 84, 70, 47, 119, 66, 71, 121, 3, 29, 42, 118, 2,\n            54, 89, 44, 81, 0, 26, 106, 68, 96, 84, 48, 95, 54, 45, 32, 89, 100, 109, 19, 37, 41,\n            19, 98, 53, 114, 107, 66, 6, 74, 13, 19, 105, 64, 123, 28, 44, 50, 89, 58, 123, 126, 21,\n            43, 86, 35, 21, 62, 82, 0, 108, 120, 72, 72, 62, 80, 12, 71, 70, 86, 116, 73, 38, 15,\n            127, 81, 30, 8, 125, 28, 26, 69, 114, 63, 27, 28, 61, 42, 13, 32,\n        ];\n\n        let sorted = arr.sort_via(sort_u32);\n\n        let expected: [u32; 100] = [\n            0, 0, 2, 3, 5, 6, 8, 12, 13, 13, 15, 19, 19, 19, 21, 21, 26, 26, 27, 28, 28, 28, 29, 30,\n            32, 32, 35, 37, 38, 41, 42, 42, 42, 43, 44, 44, 45, 47, 48, 48, 50, 50, 53, 54, 54, 58,\n            61, 62, 62, 63, 64, 66, 66, 68, 69, 70, 70, 71, 71, 72, 72, 73, 74, 80, 80, 81, 81, 82,\n            84, 84, 86, 86, 87, 89, 89, 89, 93, 95, 96, 98, 100, 104, 105, 106, 107, 108, 109, 114,\n            114, 116, 118, 119, 120, 121, 123, 123, 123, 125, 126, 127,\n        ];\n        assert(sorted == expected);\n    }\n\n    #[test]\n    fn mapi_empty() {\n        assert_eq([].mapi(|i, x| i * x + 1), []);\n    }\n\n    #[test]\n    fn for_each_empty() {\n        let empty_array: [Field; 0] = [];\n        empty_array.for_each(|_x| assert(false));\n    }\n\n    #[test]\n    fn for_eachi_empty() {\n        let empty_array: [Field; 0] = [];\n        empty_array.for_eachi(|_i, _x| assert(false));\n    }\n\n    #[test]\n    fn map_example() {\n        let a = [1, 2, 3];\n        let b = a.map(|a| a * 2);\n        assert_eq(b, [2, 4, 6]);\n    }\n\n    #[test]\n    fn mapi_example() {\n        let a = [1, 2, 3];\n        let b = a.mapi(|i, a| i + a * 2);\n        assert_eq(b, [2, 5, 8]);\n    }\n\n    #[test]\n    fn for_each_example() {\n        let a = [1, 2, 3];\n        let mut b = [0, 0, 0];\n        let b_ref = &mut b;\n        let mut i = 0;\n        let i_ref = &mut i;\n        a.for_each(|x| {\n            b_ref[*i_ref] = x * 2;\n            *i_ref += 1;\n        });\n        assert_eq(b, [2, 4, 6]);\n        assert_eq(i, 3);\n    }\n\n    #[test]\n    fn for_eachi_example() {\n        let a = [1, 2, 3];\n        let mut b = [0, 0, 0];\n        let b_ref = &mut b;\n        a.for_eachi(|i, a| { b_ref[i] = i + a * 2; });\n        assert_eq(b, [2, 5, 8]);\n    }\n\n    #[test]\n    fn concat() {\n        let arr1 = [1, 2, 3, 4];\n        let arr2 = [6, 7, 8, 9, 10, 11];\n        let concatenated_arr = arr1.concat(arr2);\n        assert_eq(concatenated_arr, [1, 2, 3, 4, 6, 7, 8, 9, 10, 11]);\n    }\n\n    #[test]\n    fn concat_zero_length_with_something() {\n        let arr1 = [];\n        let arr2 = [1];\n        let concatenated_arr = arr1.concat(arr2);\n        assert_eq(concatenated_arr, [1]);\n    }\n\n    #[test]\n    fn concat_something_with_zero_length() {\n        let arr1 = [1];\n        let arr2 = [];\n        let concatenated_arr = arr1.concat(arr2);\n        assert_eq(concatenated_arr, [1]);\n    }\n\n    #[test]\n    fn concat_zero_lengths() {\n        let arr1: [Field; 0] = [];\n        let arr2: [Field; 0] = [];\n        let concatenated_arr = arr1.concat(arr2);\n        assert_eq(concatenated_arr, []);\n    }\n\n    #[test]\n    fn test_fold() {\n        let array = [1, 2, 3];\n        let sum_plus_10 = array.fold(10, |x, y| x + y);\n        assert_eq(sum_plus_10, 16);\n    }\n\n    #[test]\n    fn test_reduce() {\n        let array = [1, 2, 3];\n        let sum = array.reduce(|x, y| x + y);\n        assert_eq(sum, 6);\n    }\n\n    #[test(should_fail_with = \"Index out of bounds\")]\n    fn test_reduce_failure_on_empty_array() {\n        let array: [Field; 0] = [];\n        let sum = array.reduce(|x, y| x + y);\n        assert_eq(sum, 6);\n    }\n\n    #[test]\n    fn test_all() {\n        let array = [1, 2, 3];\n        assert(array.all(|x| x >= 1));\n        assert(!array.all(|x| x >= 2));\n    }\n\n    #[test]\n    fn test_any() {\n        let array = [1, 2, 3];\n        assert(array.any(|x| x >= 3));\n        assert(!array.any(|x| x >= 4));\n    }\n\n    #[test]\n    fn test_to_string() {\n        let str = [78_u8, 111, 105, 114].as_str_unchecked();\n        assert_eq(str, \"Noir\");\n    }\n\n    #[test]\n    fn test_bytes_from_string() {\n        let bytes: [u8; 4] = crate::convert::From::from(\"Noir\");\n        assert_eq(bytes, [78_u8, 111, 105, 114]);\n    }\n}\n"
     },
-    "307": {
+    "308": {
       "function_locations": [
         {
           "name": "BlockHeader::chain_id",
@@ -1768,7 +1784,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/abis/block_header.nr",
       "source": "use crate::{\n    abis::{\n        append_only_tree_snapshot::AppendOnlyTreeSnapshot, global_variables::GlobalVariables,\n        state_reference::StateReference,\n    },\n    constants::{BLOCK_HEADER_LENGTH, DOM_SEP__BLOCK_HEADER_HASH, GENESIS_BLOCK_HEADER_HASH},\n    hash::poseidon2_hash_with_separator,\n    traits::{Deserialize, Empty, Hash, Serialize},\n};\nuse std::meta::derive;\n\n// docs:start:block-header\n#[derive(Deserialize, Eq, Serialize)]\npub struct BlockHeader {\n    pub last_archive: AppendOnlyTreeSnapshot,\n    pub state: StateReference,\n\n    // The hash of the sponge blob for this block, which commits to the tx effects added in this block.\n    // Note: it may also include tx effects from previous blocks within the same checkpoint.\n    // When proving tx effects from this block only, we must refer to the `sponge_blob_hash` in the previous block\n    // header to show that the effect was added after the previous block.\n    // The previous block header can be validated using a membership proof of the last leaf in `last_archive`.\n    pub sponge_blob_hash: Field,\n\n    pub global_variables: GlobalVariables,\n    pub total_fees: Field,\n    pub total_mana_used: Field,\n}\n// docs:end:block-header\n\nimpl BlockHeader {\n    pub fn chain_id(self) -> Field {\n        self.global_variables.chain_id\n    }\n\n    pub fn version(self) -> Field {\n        self.global_variables.version\n    }\n\n    pub fn block_number(self) -> u32 {\n        self.global_variables.block_number\n    }\n\n    pub fn timestamp(self) -> u64 {\n        self.global_variables.timestamp\n    }\n}\n\nimpl Empty for BlockHeader {\n    fn empty() -> Self {\n        Self {\n            last_archive: AppendOnlyTreeSnapshot::empty(),\n            state: StateReference::empty(),\n            sponge_blob_hash: 0,\n            global_variables: GlobalVariables::empty(),\n            total_fees: 0,\n            total_mana_used: 0,\n        }\n    }\n}\n\nimpl Hash for BlockHeader {\n    fn hash(self) -> Field {\n        poseidon2_hash_with_separator(self.serialize(), DOM_SEP__BLOCK_HEADER_HASH)\n    }\n}\n\n#[test]\nfn serialization_of_empty() {\n    let header = BlockHeader::empty();\n    // We use the BLOCK_HEADER_LENGTH constant to ensure that there is a match\n    // between the derived trait implementation and the constant.\n    let serialized: [Field; BLOCK_HEADER_LENGTH] = header.serialize();\n    let deserialized = BlockHeader::deserialize(serialized);\n    assert(header.eq(deserialized));\n}\n\n#[test]\nfn hash_of_genesis_block_header() {\n    let mut header = BlockHeader::empty();\n    // The following values are taken from world_state.test.cpp > WorldStateTest.GetInitialTreeInfoForAllTrees.\n    header.state.l1_to_l2_message_tree.root =\n        0x0fef6d80d31109ddb56d6b3f607cbc9c0af0bff3ea0d43e8f278983c64c11f7a;\n    header.state.partial.note_hash_tree.root =\n        0x2590f2aab19dd791700b4a43d3f52bb88ef2409a3731da8e848663559202e4c6;\n    header.state.partial.nullifier_tree.root =\n        0x18935581a8ed73d08ffd00386fba55ba6c89f3ab848a76b8fedfa9034cee0454;\n    header.state.partial.nullifier_tree.next_available_leaf_index = 128;\n    header.state.partial.public_data_tree.root =\n        0x1bef38b621017d3c7416663d0cd81369424560710526a3fbaaec13e356b9d084;\n    header.state.partial.public_data_tree.next_available_leaf_index = 128;\n\n    let hash = header.hash();\n    assert_eq(hash, GENESIS_BLOCK_HEADER_HASH);\n}\n\n#[test]\nfn hash_of_empty_block_header_match_typescript() {\n    let header = BlockHeader::empty();\n    let hash = header.hash();\n\n    // Value from block_header.test.ts \"computes empty hash\" test\n    let test_data_empty_hash = 0x0bdc537052dea0f80db9698585dff9f32063b86b6d4934ac17c30c81e8e416d3;\n    assert_eq(hash, test_data_empty_hash);\n}\n"
     },
-    "354": {
+    "355": {
       "function_locations": [
         {
           "name": "<impl Empty for AztecAddress>::empty",
@@ -1858,7 +1874,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/address/aztec_address.nr",
       "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"
     },
-    "357": {
+    "358": {
       "function_locations": [
         {
           "name": "<impl ToField for PartialAddress>::to_field",
@@ -1900,7 +1916,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/address/partial_address.nr",
       "source": "use crate::{\n    address::{aztec_address::AztecAddress, salted_initialization_hash::SaltedInitializationHash},\n    constants::DOM_SEP__PARTIAL_ADDRESS,\n    contract_class_id::ContractClassId,\n    hash::poseidon2_hash_with_separator,\n    traits::{Deserialize, Empty, Serialize, ToField},\n};\nuse std::meta::derive;\n\n// Partial address\n#[derive(Deserialize, Eq, Serialize)]\npub struct PartialAddress {\n    pub inner: Field,\n}\n\nimpl ToField for PartialAddress {\n    fn to_field(self) -> Field {\n        self.inner\n    }\n}\n\nimpl Empty for PartialAddress {\n    fn empty() -> Self {\n        Self { inner: 0 }\n    }\n}\n\nimpl PartialAddress {\n    pub fn from_field(field: Field) -> Self {\n        Self { inner: field }\n    }\n\n    pub fn compute(\n        contract_class_id: ContractClassId,\n        salt: Field,\n        initialization_hash: Field,\n        deployer: AztecAddress,\n        immutables_hash: Field,\n    ) -> Self {\n        PartialAddress::compute_from_salted_initialization_hash(\n            contract_class_id,\n            SaltedInitializationHash::compute(salt, initialization_hash, deployer, immutables_hash),\n        )\n    }\n\n    pub fn compute_from_salted_initialization_hash(\n        contract_class_id: ContractClassId,\n        salted_initialization_hash: SaltedInitializationHash,\n    ) -> Self {\n        PartialAddress::from_field(poseidon2_hash_with_separator(\n            [contract_class_id.to_field(), salted_initialization_hash.to_field()],\n            DOM_SEP__PARTIAL_ADDRESS,\n        ))\n    }\n\n    pub fn to_field(self) -> Field {\n        self.inner\n    }\n\n    pub fn is_zero(self) -> bool {\n        self.to_field() == 0\n    }\n\n    pub fn assert_is_zero(self) {\n        assert(self.to_field() == 0);\n    }\n}\n\nmod test {\n    use crate::{address::partial_address::PartialAddress, traits::{Deserialize, Serialize}};\n\n    #[test]\n    fn serialization_of_partial_address() {\n        let item = PartialAddress::from_field(1);\n        let serialized: [Field; 1] = item.serialize();\n        let deserialized = PartialAddress::deserialize(serialized);\n        assert_eq(item, deserialized);\n    }\n}\n"
     },
-    "359": {
+    "360": {
       "function_locations": [
         {
           "name": "<impl ToField for SaltedInitializationHash>::to_field",
@@ -1922,7 +1938,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/address/salted_initialization_hash.nr",
       "source": "use crate::{\n    address::aztec_address::AztecAddress, constants::DOM_SEP__SALTED_INITIALIZATION_HASH,\n    hash::poseidon2_hash_with_separator, traits::ToField,\n};\n\n// Salted initialization hash. Used in the computation of a partial address.\n#[derive(Eq)]\npub struct SaltedInitializationHash {\n    pub inner: Field,\n}\n\nimpl ToField for SaltedInitializationHash {\n    fn to_field(self) -> Field {\n        self.inner\n    }\n}\n\nimpl SaltedInitializationHash {\n    pub fn from_field(field: Field) -> Self {\n        Self { inner: field }\n    }\n\n    pub fn compute(\n        salt: Field,\n        initialization_hash: Field,\n        deployer: AztecAddress,\n        immutables_hash: Field,\n    ) -> Self {\n        SaltedInitializationHash::from_field(poseidon2_hash_with_separator(\n            [salt, initialization_hash, deployer.to_field(), immutables_hash],\n            DOM_SEP__SALTED_INITIALIZATION_HASH,\n        ))\n    }\n\n    pub fn assert_is_zero(self) {\n        assert(self.to_field() == 0);\n    }\n}\n"
     },
-    "369": {
+    "370": {
       "function_locations": [
         {
           "name": "<impl Hash for ContractInstance>::hash",
@@ -1940,7 +1956,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/contract_instance.nr",
       "source": "use crate::{\n    address::{aztec_address::AztecAddress, partial_address::PartialAddress},\n    contract_class_id::ContractClassId,\n    public_keys::PublicKeys,\n    traits::{Deserialize, Hash, Serialize, ToField},\n};\nuse std::meta::derive;\n\n/// The complete preimage of an [`AztecAddress`].\n///\n/// All of these values are hashed into the contract's `AztecAddress` (see [`Self::to_address`]), so they are fixed\n/// at deployment time and never change.\n///\n/// In particular, `original_contract_class_id` is the class the contract was *deployed* with. For upgradeable contracts\n/// which utilize the `ContractInstanceRegistry` this is NOT the class currently executing i.e. the 'current' class.\n#[derive(Deserialize, Eq, Serialize)]\npub struct ContractInstance {\n    pub salt: Field,\n    pub deployer: AztecAddress,\n    pub original_contract_class_id: ContractClassId,\n    pub initialization_hash: Field,\n    pub immutables_hash: Field,\n    pub public_keys: PublicKeys,\n}\n\nimpl Hash for ContractInstance {\n    fn hash(self) -> Field {\n        self.to_address().to_field()\n    }\n}\n\nimpl ContractInstance {\n    pub fn to_address(self) -> AztecAddress {\n        AztecAddress::compute(\n            self.public_keys,\n            PartialAddress::compute(\n                self.original_contract_class_id,\n                self.salt,\n                self.initialization_hash,\n                self.deployer,\n                self.immutables_hash,\n            ),\n        )\n    }\n}\n\nmod test {\n    use crate::{\n        address::AztecAddress,\n        constants::CONTRACT_INSTANCE_LENGTH,\n        contract_class_id::ContractClassId,\n        contract_instance::ContractInstance,\n        public_keys::PublicKeys,\n        traits::{Deserialize, FromField, Serialize},\n    };\n\n    #[test]\n    fn serde() {\n        let instance = ContractInstance {\n            salt: 6,\n            deployer: AztecAddress::from_field(12),\n            original_contract_class_id: ContractClassId::from_field(13),\n            initialization_hash: 156,\n            immutables_hash: 789,\n            public_keys: PublicKeys::default(),\n        };\n\n        // We use the CONTRACT_INSTANCE_LENGTH constant to ensure that there is a match between the derived trait\n        // implementation and the constant.\n        let serialized: [Field; CONTRACT_INSTANCE_LENGTH] = instance.serialize();\n\n        let deserialized = ContractInstance::deserialize(serialized);\n\n        assert(instance.eq(deserialized));\n    }\n\n}\n"
     },
-    "385": {
+    "386": {
       "function_locations": [
         {
           "name": "sha256_to_field",
@@ -2062,7 +2078,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/hash.nr",
       "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).\n    Nullifier { value: tx_request.hash(), 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// TODO: consider a variant that enables domain separation with a u32 (we seem to have standardised u32s for domain separators)\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\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// 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 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"
     },
-    "387": {
+    "388": {
       "function_locations": [
         {
           "name": "fatal_log",
@@ -2136,7 +2152,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/logging.nr",
       "source": "// Log levels matching the JS logger:\n\n// global SILENT_LOG_LEVEL: u8 = 0;\nglobal FATAL_LOG_LEVEL: u8 = 1;\nglobal ERROR_LOG_LEVEL: u8 = 2;\nglobal WARN_LOG_LEVEL: u8 = 3;\nglobal INFO_LOG_LEVEL: u8 = 4;\nglobal VERBOSE_LOG_LEVEL: u8 = 5;\nglobal DEBUG_LOG_LEVEL: u8 = 6;\nglobal TRACE_LOG_LEVEL: u8 = 7;\n\n// --- Per-level log functions (no format args) ---\n\npub fn fatal_log<let N: u32>(msg: str<N>) {\n    fatal_log_format(msg, []);\n}\n\npub fn error_log<let N: u32>(msg: str<N>) {\n    error_log_format(msg, []);\n}\n\npub fn warn_log<let N: u32>(msg: str<N>) {\n    warn_log_format(msg, []);\n}\n\npub fn info_log<let N: u32>(msg: str<N>) {\n    info_log_format(msg, []);\n}\n\npub fn verbose_log<let N: u32>(msg: str<N>) {\n    verbose_log_format(msg, []);\n}\n\npub fn debug_log<let N: u32>(msg: str<N>) {\n    debug_log_format(msg, []);\n}\n\npub fn trace_log<let N: u32>(msg: str<N>) {\n    trace_log_format(msg, []);\n}\n\n// --- Per-level log functions (with format args) ---\n\npub fn fatal_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    log_format(FATAL_LOG_LEVEL, msg, args);\n}\n\npub fn error_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    log_format(ERROR_LOG_LEVEL, msg, args);\n}\n\npub fn warn_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    log_format(WARN_LOG_LEVEL, msg, args);\n}\n\npub fn info_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    log_format(INFO_LOG_LEVEL, msg, args);\n}\n\npub fn verbose_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    log_format(VERBOSE_LOG_LEVEL, msg, args);\n}\n\npub fn debug_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    log_format(DEBUG_LOG_LEVEL, msg, args);\n}\n\npub fn trace_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    log_format(TRACE_LOG_LEVEL, msg, args);\n}\n\nfn log_format<let M: u32, let N: u32>(log_level: u8, msg: str<M>, args: [Field; N]) {\n    // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n    // to call.\n    unsafe { log_oracle_wrapper(log_level, msg, args) };\n}\n\nunconstrained fn log_oracle_wrapper<let M: u32, let N: u32>(\n    log_level: u8,\n    msg: str<M>,\n    args: [Field; N],\n) {\n    log_oracle(log_level, msg, N, args);\n}\n\n// While the length parameter might seem unnecessary given that we have N, we keep it around because at the AVM\n// bytecode level we want to support non-comptime-known lengths for such opcodes, even if Noir code will not generally\n// take that route. The AVM transpiler maps this oracle to the DEBUGLOG opcode, which reads the fields size from memory.\n#[oracle(aztec_misc_log)]\nunconstrained fn log_oracle<let M: u32, let N: u32>(\n    log_level: u8,\n    msg: str<M>,\n    length: u32,\n    args: [Field; N],\n) {}\n"
     },
-    "413": {
+    "414": {
       "function_locations": [
         {
           "name": "hash_public_key",
@@ -2206,7 +2222,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/public_keys.nr",
       "source": "use crate::{\n    address::public_keys_hash::PublicKeysHash,\n    constants::{\n        DEFAULT_FBPK_M_HASH, DEFAULT_IVPK_M_X, DEFAULT_IVPK_M_Y, DEFAULT_MSPK_M_HASH,\n        DEFAULT_NPK_M_HASH, DEFAULT_OVPK_M_HASH, DEFAULT_TPK_M_HASH, DOM_SEP__PUBLIC_KEYS_HASH,\n        DOM_SEP__SINGLE_PUBLIC_KEY_HASH,\n    },\n    hash::poseidon2_hash_with_separator,\n    point::{EmbeddedCurvePoint, validate_on_curve},\n    traits::{Deserialize, Hash, Serialize},\n};\n\nuse std::{default::Default, meta::derive};\n\npub trait ToPoint {\n    fn to_point(self) -> EmbeddedCurvePoint;\n}\n\n/// Hashes a public key point under the canonical single-public-key domain separator.\n///\n/// Defined as `Poseidon2(DOM_SEP__SINGLE_PUBLIC_KEY_HASH, x, y)`.\npub fn hash_public_key(p: EmbeddedCurvePoint) -> Field {\n    poseidon2_hash_with_separator([p.x, p.y], DOM_SEP__SINGLE_PUBLIC_KEY_HASH as Field)\n}\n\n#[derive(Deserialize, Eq, Serialize)]\npub struct IvpkM {\n    pub inner: EmbeddedCurvePoint,\n}\n\nimpl ToPoint for IvpkM {\n    fn to_point(self) -> EmbeddedCurvePoint {\n        self.inner\n    }\n}\n\nimpl Hash for IvpkM {\n    fn hash(self) -> Field {\n        hash_public_key(self.inner)\n    }\n}\n\n/// A non-owner's view of an account's master public keys.\n///\n/// `npk_m_hash`, `ovpk_m_hash`, `tpk_m_hash`, `mspk_m_hash`, and `fbpk_m_hash` are the\n/// [`hash_public_key`] digests of the underlying points. The points themselves are not exposed\n/// here - they are only known to the owner. `ivpk_m` remains a point because address derivation\n/// (encrypt-to-address) requires the raw point in-circuit.\n#[derive(Deserialize, Eq, Serialize)]\npub struct PublicKeys {\n    pub npk_m_hash: Field,\n    pub ivpk_m: IvpkM,\n    pub ovpk_m_hash: Field,\n    pub tpk_m_hash: Field,\n    pub mspk_m_hash: Field,\n    pub fbpk_m_hash: Field,\n}\n\nimpl Default for PublicKeys {\n    fn default() -> Self {\n        PublicKeys {\n            npk_m_hash: DEFAULT_NPK_M_HASH,\n            ivpk_m: IvpkM {\n                inner: EmbeddedCurvePoint { x: DEFAULT_IVPK_M_X, y: DEFAULT_IVPK_M_Y },\n            },\n            ovpk_m_hash: DEFAULT_OVPK_M_HASH,\n            tpk_m_hash: DEFAULT_TPK_M_HASH,\n            mspk_m_hash: DEFAULT_MSPK_M_HASH,\n            fbpk_m_hash: DEFAULT_FBPK_M_HASH,\n        }\n    }\n}\n\nimpl PublicKeys {\n    pub fn hash(self) -> PublicKeysHash {\n        PublicKeysHash::from_field(poseidon2_hash_with_separator(\n            [\n                self.npk_m_hash,\n                self.ivpk_m.hash(),\n                self.ovpk_m_hash,\n                self.tpk_m_hash,\n                self.mspk_m_hash,\n                self.fbpk_m_hash,\n            ],\n            DOM_SEP__PUBLIC_KEYS_HASH as Field,\n        ))\n    }\n\n    /// Validates that the (only) point-form key, `ivpk_m`, lies on the Grumpkin curve.\n    ///\n    /// The other five keys are exposed only as hashes and are unverifiable on-circuit; the PXE\n    /// is responsible for ensuring they were derived from on-curve points before persistence.\n    pub fn validate_on_curve(self) {\n        validate_on_curve(self.ivpk_m.inner);\n    }\n\n    /// Validates that `ivpk_m` is not the point at infinity.\n    ///\n    /// As with [`Self::validate_on_curve`], the other five keys are now exposed only as hashes\n    /// and this property must be enforced PXE-side.\n    pub fn validate_non_infinity(self) {\n        assert_eq(self.ivpk_m.inner.is_infinite(), false, \"IvpkM is the point at infinity\");\n    }\n}\n\npub struct AddressPoint {\n    pub inner: EmbeddedCurvePoint,\n}\n\nimpl ToPoint for AddressPoint {\n    fn to_point(self) -> EmbeddedCurvePoint {\n        self.inner\n    }\n}\n\nmod test {\n    use crate::constants::{\n        DEFAULT_FBPK_M_HASH, DEFAULT_FBPK_M_X, DEFAULT_FBPK_M_Y, DEFAULT_MSPK_M_HASH,\n        DEFAULT_MSPK_M_X, DEFAULT_MSPK_M_Y, DEFAULT_NPK_M_HASH, DEFAULT_NPK_M_X, DEFAULT_NPK_M_Y,\n        DEFAULT_OVPK_M_HASH, DEFAULT_OVPK_M_X, DEFAULT_OVPK_M_Y, DEFAULT_TPK_M_HASH,\n        DEFAULT_TPK_M_X, DEFAULT_TPK_M_Y,\n    };\n    use crate::{\n        point::EmbeddedCurvePoint,\n        public_keys::{hash_public_key, IvpkM, PublicKeys},\n        traits::{Deserialize, Serialize},\n    };\n\n    global PUBLIC_KEYS_LENGTH: u32 = 7;\n\n    /// Catches drift between the precomputed `DEFAULT_*_M_HASH` constants and the\n    /// `DEFAULT_*_M_X/Y` curve points they're derived from. If anyone updates the X/Y\n    /// constants (or the hashing primitive) without also updating the *_HASH constants,\n    /// this test fails and `PublicKeys::default()` would silently produce a stale value.\n    #[test]\n    fn default_hashes_match_default_points() {\n        let npk = hash_public_key(\n            EmbeddedCurvePoint { x: DEFAULT_NPK_M_X, y: DEFAULT_NPK_M_Y },\n        );\n        assert_eq(npk, DEFAULT_NPK_M_HASH);\n\n        let ovpk = hash_public_key(\n            EmbeddedCurvePoint { x: DEFAULT_OVPK_M_X, y: DEFAULT_OVPK_M_Y },\n        );\n        assert_eq(ovpk, DEFAULT_OVPK_M_HASH);\n\n        let tpk = hash_public_key(\n            EmbeddedCurvePoint { x: DEFAULT_TPK_M_X, y: DEFAULT_TPK_M_Y },\n        );\n        assert_eq(tpk, DEFAULT_TPK_M_HASH);\n\n        let mspk = hash_public_key(\n            EmbeddedCurvePoint { x: DEFAULT_MSPK_M_X, y: DEFAULT_MSPK_M_Y },\n        );\n        assert_eq(mspk, DEFAULT_MSPK_M_HASH);\n\n        let fbpk = hash_public_key(\n            EmbeddedCurvePoint { x: DEFAULT_FBPK_M_X, y: DEFAULT_FBPK_M_Y },\n        );\n        assert_eq(fbpk, DEFAULT_FBPK_M_HASH);\n    }\n\n    #[test]\n    fn compute_public_keys_hash() {\n        let keys = PublicKeys {\n            npk_m_hash: 11,\n            ivpk_m: IvpkM { inner: EmbeddedCurvePoint { x: 3, y: 4 } },\n            ovpk_m_hash: 22,\n            tpk_m_hash: 33,\n            mspk_m_hash: 44,\n            fbpk_m_hash: 55,\n        };\n\n        let actual = keys.hash().to_field();\n\n        let expected_public_keys_hash =\n            0x1e57c605207e2b607720b8e3023f69f5af25683277db5ff3b99f7948213c7878;\n\n        assert_eq(actual, expected_public_keys_hash);\n    }\n\n    #[test]\n    fn test_validate_on_curve() {\n        let keys = PublicKeys {\n            npk_m_hash: 0,\n            ivpk_m: IvpkM { inner: EmbeddedCurvePoint::generator().double() },\n            ovpk_m_hash: 0,\n            tpk_m_hash: 0,\n            mspk_m_hash: 0,\n            fbpk_m_hash: 0,\n        };\n\n        keys.validate_on_curve();\n    }\n\n    #[test(should_fail_with = \"Point not on curve\")]\n    fn test_validate_not_on_curve() {\n        let keys = PublicKeys {\n            npk_m_hash: 0,\n            ivpk_m: IvpkM { inner: EmbeddedCurvePoint { x: 3, y: 4 } },\n            ovpk_m_hash: 0,\n            tpk_m_hash: 0,\n            mspk_m_hash: 0,\n            fbpk_m_hash: 0,\n        };\n\n        keys.validate_on_curve();\n    }\n\n    #[test]\n    fn test_validate_non_infinity() {\n        let keys = PublicKeys {\n            npk_m_hash: 0,\n            ivpk_m: IvpkM { inner: EmbeddedCurvePoint::generator().double() },\n            ovpk_m_hash: 0,\n            tpk_m_hash: 0,\n            mspk_m_hash: 0,\n            fbpk_m_hash: 0,\n        };\n\n        keys.validate_non_infinity();\n    }\n\n    #[test(should_fail_with = \"IvpkM is the point at infinity\")]\n    fn test_validate_infinity() {\n        let keys = PublicKeys {\n            npk_m_hash: 0,\n            ivpk_m: IvpkM { inner: EmbeddedCurvePoint::point_at_infinity() },\n            ovpk_m_hash: 0,\n            tpk_m_hash: 0,\n            mspk_m_hash: 0,\n            fbpk_m_hash: 0,\n        };\n\n        keys.validate_non_infinity();\n    }\n\n    #[test]\n    fn compute_default_hash() {\n        let keys = PublicKeys::default();\n\n        let actual = keys.hash().to_field();\n\n        let test_data_default_hash =\n            0x13c13fbec22a396f700180c621fb8c67b830b431fed47d4dd71a20d828829eaa;\n\n        assert_eq(actual, test_data_default_hash);\n    }\n\n    #[test]\n    fn serde() {\n        let keys = PublicKeys {\n            npk_m_hash: 11,\n            ivpk_m: IvpkM { inner: EmbeddedCurvePoint { x: 3, y: 4 } },\n            ovpk_m_hash: 22,\n            tpk_m_hash: 33,\n            mspk_m_hash: 44,\n            fbpk_m_hash: 55,\n        };\n\n        let serialized: [Field; PUBLIC_KEYS_LENGTH] = keys.serialize();\n        let deserialized = PublicKeys::deserialize(serialized);\n\n        assert_eq(keys, deserialized);\n    }\n}\n"
     },
-    "42": {
+    "43": {
       "function_locations": [
         {
           "name": "Option<T>::none",
@@ -2384,7 +2400,7 @@
       "path": "std/option.nr",
       "source": "use crate::cmp::{Eq, Ord, Ordering};\nuse crate::default::Default;\nuse crate::hash::{Hash, Hasher};\n\n/// Represents a value of type T or its absence.\n/// Use `Option::some(value)` to construct a value or `Option::none()` to record the absence of one.\npub struct Option<T> {\n    _is_some: bool,\n    _value: T,\n}\n\nimpl<T> Option<T> {\n    /// Constructs a None value\n    pub fn none() -> Self {\n        Self { _is_some: false, _value: crate::mem::zeroed() }\n    }\n\n    /// Constructs a Some wrapper around the given value\n    pub fn some(_value: T) -> Self {\n        Self { _is_some: true, _value }\n    }\n\n    /// True if this Option is None\n    pub fn is_none(&self) -> bool {\n        !self._is_some\n    }\n\n    /// True if this Option is Some\n    pub fn is_some(&self) -> bool {\n        self._is_some\n    }\n\n    /// Asserts `self.is_some()` and returns the wrapped value.\n    pub fn unwrap(self) -> T {\n        assert(self._is_some);\n        self._value\n    }\n\n    /// Returns the inner value without asserting `self.is_some()`\n    /// Note that if `self` is `None`, there is no guarantee what value will be returned,\n    /// only that it will be of type `T`.\n    pub fn unwrap_unchecked(self) -> T {\n        self._value\n    }\n\n    /// Returns the wrapped value if `self.is_some()`. Otherwise, returns the given default value.\n    pub fn unwrap_or(self, default: T) -> T {\n        if self._is_some {\n            self._value\n        } else {\n            default\n        }\n    }\n\n    /// Returns the wrapped value if `self.is_some()`. Otherwise, calls the given function to return\n    /// a default value.\n    pub fn unwrap_or_else<Env>(self, default: fn[Env]() -> T) -> T {\n        if self._is_some {\n            self._value\n        } else {\n            default()\n        }\n    }\n\n    /// Asserts `self.is_some()` with a provided custom message and returns the contained `Some` value\n    pub fn expect<let N: u32, MessageTypes>(self, message: fmtstr<N, MessageTypes>) -> T {\n        assert(self.is_some(), message);\n        self._value\n    }\n\n    /// If self is `Some(x)`, this returns `Some(f(x))`. Otherwise, this returns `None`.\n    pub fn map<U, Env>(self, f: fn[Env](T) -> U) -> Option<U> {\n        if self._is_some {\n            Option::some(f(self._value))\n        } else {\n            Option::none()\n        }\n    }\n\n    /// If self is `Some(x)`, this returns `f(x)`. Otherwise, this returns the given default value.\n    pub fn map_or<U, Env>(self, default: U, f: fn[Env](T) -> U) -> U {\n        if self._is_some {\n            f(self._value)\n        } else {\n            default\n        }\n    }\n\n    /// If self is `Some(x)`, this returns `f(x)`. Otherwise, this returns `default()`.\n    pub fn map_or_else<U, Env1, Env2>(self, default: fn[Env1]() -> U, f: fn[Env2](T) -> U) -> U {\n        if self._is_some {\n            f(self._value)\n        } else {\n            default()\n        }\n    }\n\n    /// Returns None if self is None. Otherwise, this returns `other`.\n    pub fn and(self, other: Self) -> Self {\n        if self.is_none() {\n            Option::none()\n        } else {\n            other\n        }\n    }\n\n    /// If self is None, this returns None. Otherwise, this calls the given function\n    /// with the Some value contained within self, and returns the result of that call.\n    ///\n    /// In some languages this function is called `flat_map` or `bind`.\n    pub fn and_then<U, Env>(self, f: fn[Env](T) -> Option<U>) -> Option<U> {\n        if self._is_some {\n            f(self._value)\n        } else {\n            Option::none()\n        }\n    }\n\n    /// If self is Some, return self. Otherwise, return `other`.\n    pub fn or(self, other: Self) -> Self {\n        if self._is_some {\n            self\n        } else {\n            other\n        }\n    }\n\n    /// If self is Some, return self. Otherwise, return `default()`.\n    pub fn or_else<Env>(self, default: fn[Env]() -> Self) -> Self {\n        if self._is_some {\n            self\n        } else {\n            default()\n        }\n    }\n\n    // If only one of the two Options is Some, return that option.\n    // Otherwise, if both options are Some or both are None, None is returned.\n    pub fn xor(self, other: Self) -> Self {\n        if self._is_some {\n            if other._is_some {\n                Option::none()\n            } else {\n                self\n            }\n        } else if other._is_some {\n            other\n        } else {\n            Option::none()\n        }\n    }\n\n    /// Returns `Some(x)` if self is `Some(x)` and `predicate(x)` is true.\n    /// Otherwise, this returns `None`\n    pub fn filter<Env>(self, predicate: fn[Env](T) -> bool) -> Self {\n        if self._is_some {\n            if predicate(self._value) {\n                self\n            } else {\n                Option::none()\n            }\n        } else {\n            Option::none()\n        }\n    }\n\n    /// Flattens an Option<Option<T>> into a Option<T>.\n    /// This returns None if the outer Option is None. Otherwise, this returns the inner Option.\n    pub fn flatten(option: Option<Option<T>>) -> Option<T> {\n        if option._is_some {\n            option._value\n        } else {\n            Option::none()\n        }\n    }\n}\n\nimpl<T> Default for Option<T> {\n    fn default() -> Self {\n        Option::none()\n    }\n}\n\nimpl<T> Eq for Option<T>\nwhere\n    T: Eq,\n{\n    fn eq(self, other: Self) -> bool {\n        if self._is_some == other._is_some {\n            if self._is_some {\n                self._value == other._value\n            } else {\n                true\n            }\n        } else {\n            false\n        }\n    }\n}\n\nimpl<T> Hash for Option<T>\nwhere\n    T: Hash,\n{\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        self._is_some.hash(state);\n        if self._is_some {\n            self._value.hash(state);\n        }\n    }\n}\n\n// For this impl we're declaring Option::none < Option::some\nimpl<T> Ord for Option<T>\nwhere\n    T: Ord,\n{\n    fn cmp(self, other: Self) -> Ordering {\n        if self._is_some {\n            if other._is_some {\n                self._value.cmp(other._value)\n            } else {\n                Ordering::greater()\n            }\n        } else if other._is_some {\n            Ordering::less()\n        } else {\n            Ordering::equal()\n        }\n    }\n}\n\nmod tests {\n    use crate::cmp::Ord;\n    use crate::cmp::Ordering;\n    use crate::default::Default as _;\n    use super::Option;\n\n    #[test]\n    fn some_and_none() {\n        assert(Option::<u8>::none().is_none());\n        assert(!Option::<u8>::none().is_some());\n        assert(Option::some(1).is_some());\n        assert(!Option::some(1).is_none());\n    }\n\n    #[test]\n    fn unwrap_succeeds() {\n        assert_eq(Option::some(1).unwrap(), 1);\n    }\n\n    #[test(should_fail)]\n    fn unwrap_fails() {\n        let _ = Option::<u8>::none().unwrap();\n    }\n\n    #[test]\n    fn unwrap_or() {\n        assert_eq(Option::some(1).unwrap_or(2), 1);\n        assert_eq(Option::none().unwrap_or(2), 2);\n    }\n\n    #[test]\n    fn unwrap_or_else() {\n        assert_eq(Option::some(1).unwrap_or_else(|| 2), 1);\n        assert_eq(Option::none().unwrap_or_else(|| 2), 2);\n    }\n\n    #[test]\n    fn expect_succeeds() {\n        assert_eq(Option::some(1).expect(f\"Should be there\"), 1);\n    }\n\n    #[test(should_fail_with = \"Should be there\")]\n    fn expect_fails() {\n        let _ = Option::<u8>::none().expect(f\"Should be there\");\n    }\n\n    #[test]\n    fn map() {\n        assert(Option::<u8>::none().map(|x| x + 1).is_none());\n        assert_eq(Option::some(1).map(|x| x + 1), Option::some(2));\n    }\n\n    #[test]\n    fn map_or() {\n        assert_eq(Option::<u8>::none().map_or(0, |x| x + 1), 0);\n        assert_eq(Option::some(1).map_or(0, |x| x + 1), 2);\n    }\n\n    #[test]\n    fn map_or_else() {\n        assert_eq(Option::<u8>::none().map_or_else(|| 0, |x| x + 1), 0);\n        assert_eq(Option::some(1).map_or_else(|| 0, |x| x + 1), 2);\n    }\n\n    #[test]\n    fn and() {\n        assert_eq(Option::<u8>::none().and(Option::none()), Option::none());\n        assert_eq(Option::<u8>::none().and(Option::some(1)), Option::none());\n        assert_eq(Option::some(1).and(Option::some(2)), Option::some(2));\n        assert_eq(Option::some(1).and(Option::none()), Option::none());\n    }\n\n    #[test]\n    fn and_then() {\n        assert_eq(Option::<u8>::none().and_then(|_| Option::<u8>::none()), Option::none());\n        assert_eq(Option::<u8>::none().and_then(|_| Option::some(1)), Option::none());\n        assert_eq(Option::some(1).and_then(|x| Option::some(x + 1)), Option::some(2));\n        assert_eq(Option::some(1).and_then(|_| Option::<u8>::none()), Option::none());\n    }\n\n    #[test]\n    fn or() {\n        assert_eq(Option::<u8>::none().or(Option::none()), Option::none());\n        assert_eq(Option::<u8>::none().or(Option::some(1)), Option::some(1));\n        assert_eq(Option::some(1).or(Option::some(2)), Option::some(1));\n        assert_eq(Option::some(1).or(Option::none()), Option::some(1));\n    }\n\n    #[test]\n    fn or_else() {\n        assert_eq(Option::<u8>::none().or_else(|| Option::none()), Option::none());\n        assert_eq(Option::<u8>::none().or_else(|| Option::some(1)), Option::some(1));\n        assert_eq(Option::some(1).or_else(|| Option::some(2)), Option::some(1));\n        assert_eq(Option::some(1).or_else(|| Option::none()), Option::some(1));\n    }\n\n    #[test]\n    fn xor() {\n        assert_eq(Option::<u8>::none().xor(Option::none()), Option::none());\n        assert_eq(Option::<u8>::none().xor(Option::some(1)), Option::some(1));\n        assert_eq(Option::some(1).xor(Option::some(2)), Option::none());\n        assert_eq(Option::some(1).xor(Option::none()), Option::some(1));\n    }\n\n    #[test]\n    fn filter() {\n        assert_eq(Option::<u8>::none().filter(|_| true), Option::none());\n        assert_eq(Option::some(1).filter(|x| x == 1), Option::some(1));\n        assert_eq(Option::some(1).filter(|x| x == 2), Option::none());\n        assert_eq(Option::some(1).filter(|x| x == 2), Option::none());\n    }\n\n    #[test]\n    fn flatten() {\n        assert_eq(Option::<Option<u8>>::none().flatten(), Option::none());\n        assert_eq(Option::some(Option::<u8>::none()).flatten(), Option::none());\n        assert_eq(Option::some(Option::some(1)).flatten(), Option::some(1));\n    }\n\n    #[test]\n    fn default() {\n        assert_eq(Option::<u8>::default(), Option::none());\n    }\n\n    #[test]\n    fn eq() {\n        assert(Option::<u8>::none() == Option::none());\n        assert(Option::<u8>::some(1) != Option::none());\n        assert(Option::<u8>::none() != Option::some(1));\n        assert(Option::<u8>::some(1) == Option::some(1));\n        assert(Option::<u8>::some(1) != Option::some(2));\n    }\n\n    #[test]\n    fn cmp() {\n        let none = Option::<u8>::none();\n        let one = Option::<u8>::some(1);\n        let two = Option::<u8>::some(2);\n        assert_eq(none.cmp(none), Ordering::equal());\n        assert_eq(none.cmp(one), Ordering::less());\n        assert_eq(one.cmp(none), Ordering::greater());\n        assert_eq(one.cmp(one), Ordering::equal());\n        assert_eq(one.cmp(two), Ordering::less());\n        assert_eq(two.cmp(one), Ordering::greater());\n    }\n}\n"
     },
-    "43": {
+    "44": {
       "function_locations": [
         {
           "name": "panic",
@@ -2398,7 +2414,7 @@
       "path": "std/panic.nr",
       "source": "/// Halt the program at runtime with the given error message.\n///\n/// The provided error message must be either a `str` or a `fmtstr`.\npub fn panic<T, U>(message: T) -> U\nwhere\n    T: StringLike,\n{\n    assert(false, message);\n    crate::mem::zeroed()\n}\n\ntrait StringLike {}\n\nimpl<let N: u32> StringLike for str<N> {}\nimpl<let N: u32, T> StringLike for fmtstr<N, T> {}\n\nmod tests {\n    use crate::prelude::panic;\n\n    #[test(should_fail_with = \"OH NO\")]\n    fn panics() {\n        panic(\"OH NO\");\n    }\n}\n"
     },
-    "439": {
+    "440": {
       "function_locations": [
         {
           "name": "Reader<N>::new",
@@ -2448,7 +2464,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/serde/src/reader.nr",
       "source": "pub struct Reader<let N: u32> {\n    data: [Field; N],\n    offset: u32,\n}\n\nimpl<let N: u32> Reader<N> {\n    pub fn new(data: [Field; N]) -> Self {\n        Self { data, offset: 0 }\n    }\n\n    pub fn read(&mut self) -> Field {\n        let result = self.data[self.offset];\n        self.offset += 1;\n        result\n    }\n\n    pub fn read_u32(&mut self) -> u32 {\n        self.read() as u32\n    }\n\n    pub fn read_u64(&mut self) -> u64 {\n        self.read() as u64\n    }\n\n    pub fn read_bool(&mut self) -> bool {\n        self.read() != 0\n    }\n\n    pub fn read_array<let K: u32>(&mut self) -> [Field; K] {\n        let mut result = [0; K];\n        for i in 0..K {\n            result[i] = self.data[self.offset + i];\n        }\n        self.offset += K;\n        result\n    }\n\n    pub fn read_struct<T, let K: u32>(&mut self, deserialise: fn([Field; K]) -> T) -> T {\n        let result = deserialise(self.read_array());\n        result\n    }\n\n    pub fn read_struct_array<T, let K: u32, let C: u32>(\n        &mut self,\n        deserialise: fn([Field; K]) -> T,\n        mut result: [T; C],\n    ) -> [T; C] {\n        for i in 0..C {\n            result[i] = self.read_struct(deserialise);\n        }\n        result\n    }\n\n    pub fn peek_offset(&mut self, offset: u32) -> Field {\n        self.data[self.offset + offset]\n    }\n\n    pub fn advance_offset(&mut self, offset: u32) {\n        self.offset += offset;\n    }\n\n    pub fn finish(self) {\n        assert_eq(self.offset, self.data.len(), \"Reader did not read all data\");\n    }\n}\n"
     },
-    "440": {
+    "441": {
       "function_locations": [
         {
           "name": "derive_serialize",
@@ -2474,7 +2490,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/serde/src/serialization.nr",
       "source": "use crate::{reader::Reader, writer::Writer};\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\n    // We care only about the name and type so we drop the last item of the tuple\n    let params = nested_struct.0.fields(nested_struct.1).map(|(name, typ, _)| (name, typ));\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(|(name, _typ): (Quoted, Type)| {\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.0.fields(nested_struct.1);\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(|(_, param_type, _): (Quoted, Type, Quoted)| {\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(|(param_name, param_type, _): (Quoted, Type, Quoted)| {\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(|(param_name, _, _): (Quoted, Type, Quoted)| quote { $param_name })\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].0;\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` - An array of tuples where each tuple contains a quoted parameter name and its Type. The type needs\n///              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: [(Quoted, Type)]) -> Quoted {\n    if params.len() == 0 {\n        quote { 0 }\n    } else {\n        let params_quote_without_parentheses = params\n            .map(|(_, param_type): (Quoted, Type)| {\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(|(name, maybe_integer_typ)| {\n                // The second item in the generics tuple is an Option of an integer type that is Some only if\n                // 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    // The second item in the generics tuple is an Option of an integer type that is Some only if the generic is\n    // numeric.\n    let non_numeric_generics =\n        generics.filter(|(_, maybe_integer_typ)| maybe_integer_typ.is_none());\n\n    if non_numeric_generics.len() > 0 {\n        let non_numeric_generics_declarations =\n            non_numeric_generics.map(|(name, _)| quote {$name: $trait_name}).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"
     },
-    "442": {
+    "443": {
       "function_locations": [
         {
           "name": "<impl Serialize for bool>::serialize",
@@ -2788,7 +2804,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/serde/src/type_impls.nr",
       "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"
     },
-    "443": {
+    "444": {
       "function_locations": [
         {
           "name": "Writer<N>::new",
@@ -2834,7 +2850,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/serde/src/writer.nr",
       "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"
     },
-    "453": {
+    "454": {
       "function_locations": [
         {
           "name": "verify_signature",
@@ -3190,37 +3206,33 @@
       "path": "std/cmp.nr",
       "source": "use crate::meta::ctstring::AsCtString;\nuse crate::meta::derive_via;\n\n/// Compare two values for equality\n#[derive_via(derive_eq)]\n// docs:start:eq-trait\npub trait Eq {\n    fn eq(self, other: Self) -> bool;\n}\n// docs:end:eq-trait\n\n// docs:start:derive_eq\ncomptime fn derive_eq(s: TypeDefinition) -> Quoted {\n    let signature = quote { fn eq(_self: Self, _other: Self) -> bool };\n    let for_each_field = |name| quote { (_self.$name == _other.$name) };\n    let body = |fields| {\n        if s.fields_as_written().len() == 0 {\n            quote { true }\n        } else {\n            fields\n        }\n    };\n    crate::meta::make_trait_impl(\n        s,\n        quote { $crate::cmp::Eq },\n        signature,\n        for_each_field,\n        quote { & },\n        body,\n    )\n}\n// docs:end:derive_eq\n\nimpl Eq for Field {\n    fn eq(self, other: Field) -> bool {\n        self == other\n    }\n}\n\nimpl Eq for u128 {\n    fn eq(self, other: u128) -> bool {\n        self == other\n    }\n}\nimpl Eq for u64 {\n    fn eq(self, other: u64) -> bool {\n        self == other\n    }\n}\nimpl Eq for u32 {\n    fn eq(self, other: u32) -> bool {\n        self == other\n    }\n}\nimpl Eq for u16 {\n    fn eq(self, other: u16) -> bool {\n        self == other\n    }\n}\nimpl Eq for u8 {\n    fn eq(self, other: u8) -> bool {\n        self == other\n    }\n}\nimpl Eq for i8 {\n    fn eq(self, other: i8) -> bool {\n        self == other\n    }\n}\nimpl Eq for i16 {\n    fn eq(self, other: i16) -> bool {\n        self == other\n    }\n}\nimpl Eq for i32 {\n    fn eq(self, other: i32) -> bool {\n        self == other\n    }\n}\nimpl Eq for i64 {\n    fn eq(self, other: i64) -> bool {\n        self == other\n    }\n}\n\nimpl Eq for () {\n    fn eq(_self: Self, _other: ()) -> bool {\n        true\n    }\n}\nimpl Eq for bool {\n    fn eq(self, other: bool) -> bool {\n        self == other\n    }\n}\n\nimpl<T, let N: u32> Eq for [T; N]\nwhere\n    T: Eq,\n{\n    fn eq(self, other: [T; N]) -> bool {\n        let mut result = true;\n        for i in 0..self.len() {\n            result &= self[i].eq(other[i]);\n        }\n        result\n    }\n}\n\nimpl<T> Eq for [T]\nwhere\n    T: Eq,\n{\n    fn eq(self, other: [T]) -> bool {\n        let mut result = self.len() == other.len();\n        if result {\n            for i in 0..self.len() {\n                result &= self[i].eq(other[i]);\n            }\n        }\n        result\n    }\n}\n\nimpl<let N: u32> Eq for str<N> {\n    fn eq(self, other: str<N>) -> bool {\n        let self_bytes = self.as_bytes();\n        let other_bytes = other.as_bytes();\n        self_bytes == other_bytes\n    }\n}\n\ncomptime fn make_tuple_eq_body(n: u32) -> Quoted {\n    let mut body = f\"self.0.eq(other.0)\".as_ctstring();\n    for i in 1u32..n {\n        body = body.append_fmtstr(f\" & self.{i}.eq(other.{i})\");\n    }\n    f\"{body}\".quoted_contents()\n}\n\nimpl<A: Eq> Eq for (A,) {\n    fn eq(self, other: (A,)) -> bool {\n        self.0 == other.0\n    }\n}\n\nimpl<A: Eq, B: Eq> Eq for (A, B) {\n    fn eq(self, other: (A, B)) -> bool {\n        make_tuple_eq_body!(2u32)\n    }\n}\n\nimpl<A: Eq, B: Eq, C: Eq> Eq for (A, B, C) {\n    fn eq(self, other: (A, B, C)) -> bool {\n        make_tuple_eq_body!(3u32)\n    }\n}\n\nimpl<A: Eq, B: Eq, C: Eq, D: Eq> Eq for (A, B, C, D) {\n    fn eq(self, other: (A, B, C, D)) -> bool {\n        make_tuple_eq_body!(4u32)\n    }\n}\n\nimpl<A: Eq, B: Eq, C: Eq, D: Eq, E: Eq> Eq for (A, B, C, D, E) {\n    fn eq(self, other: (A, B, C, D, E)) -> bool {\n        make_tuple_eq_body!(5u32)\n    }\n}\n\nimpl<A: Eq, B: Eq, C: Eq, D: Eq, E: Eq, F: Eq> Eq for (A, B, C, D, E, F) {\n    fn eq(self, other: (A, B, C, D, E, F)) -> bool {\n        make_tuple_eq_body!(6u32)\n    }\n}\n\nimpl<A: Eq, B: Eq, C: Eq, D: Eq, E: Eq, F: Eq, G: Eq> Eq for (A, B, C, D, E, F, G) {\n    fn eq(self, other: (A, B, C, D, E, F, G)) -> bool {\n        make_tuple_eq_body!(7u32)\n    }\n}\n\nimpl<A: Eq, B: Eq, C: Eq, D: Eq, E: Eq, F: Eq, G: Eq, H: Eq> Eq for (A, B, C, D, E, F, G, H) {\n    fn eq(self, other: (A, B, C, D, E, F, G, H)) -> bool {\n        make_tuple_eq_body!(8u32)\n    }\n}\n\nimpl<A: Eq, B: Eq, C: Eq, D: Eq, E: Eq, F: Eq, G: Eq, H: Eq, I: Eq> Eq for (A, B, C, D, E, F, G, H, I) {\n    fn eq(self, other: (A, B, C, D, E, F, G, H, I)) -> bool {\n        make_tuple_eq_body!(9u32)\n    }\n}\n\nimpl<A: Eq, B: Eq, C: Eq, D: Eq, E: Eq, F: Eq, G: Eq, H: Eq, I: Eq, J: Eq> Eq for (A, B, C, D, E, F, G, H, I, J) {\n    fn eq(self, other: (A, B, C, D, E, F, G, H, I, J)) -> bool {\n        make_tuple_eq_body!(10u32)\n    }\n}\n\nimpl<A: Eq, B: Eq, C: Eq, D: Eq, E: Eq, F: Eq, G: Eq, H: Eq, I: Eq, J: Eq, K: Eq> Eq for (A, B, C, D, E, F, G, H, I, J, K) {\n    fn eq(self, other: (A, B, C, D, E, F, G, H, I, J, K)) -> bool {\n        make_tuple_eq_body!(11u32)\n    }\n}\n\nimpl<A: Eq, B: Eq, C: Eq, D: Eq, E: Eq, F: Eq, G: Eq, H: Eq, I: Eq, J: Eq, K: Eq, L: Eq> Eq for (A, B, C, D, E, F, G, H, I, J, K, L) {\n    fn eq(self, other: (A, B, C, D, E, F, G, H, I, J, K, L)) -> bool {\n        make_tuple_eq_body!(12u32)\n    }\n}\n\nimpl Eq for Ordering {\n    fn eq(self, other: Ordering) -> bool {\n        self.result == other.result\n    }\n}\n\n// Noir doesn't have enums yet so we emulate (Lt | Eq | Gt) with a struct\n// that has 3 public functions for constructing the struct.\n/// A value with three states: `Ordering::less()`, `Ordering::equal()` or `Ordering::greater()`.\n/// Most often used to encode the result of a comparison operation.\npub struct Ordering {\n    result: Field,\n}\n\nimpl Ordering {\n    // Implementation note: 0, 1, and 2 for Lt, Eq, and Gt are built\n    // into the compiler, do not change these without also updating\n    // the compiler itself!\n    pub fn less() -> Ordering {\n        Ordering { result: 0 }\n    }\n\n    pub fn equal() -> Ordering {\n        Ordering { result: 1 }\n    }\n\n    pub fn greater() -> Ordering {\n        Ordering { result: 2 }\n    }\n}\n\n/// Compare one object to another, returning whether it is less-than, equal-to,\n/// or greater-than the other object.\n#[derive_via(derive_ord)]\n// docs:start:ord-trait\npub trait Ord {\n    fn cmp(self, other: Self) -> Ordering;\n}\n// docs:end:ord-trait\n\n// docs:start:derive_ord\ncomptime fn derive_ord(s: TypeDefinition) -> Quoted {\n    let name = quote { $crate::cmp::Ord };\n    let signature = quote { fn cmp(_self: Self, _other: Self) -> $crate::cmp::Ordering };\n    let for_each_field = |name| quote {\n        if result == $crate::cmp::Ordering::equal() {\n            result = _self.$name.cmp(_other.$name);\n        }\n    };\n    let body = |fields| quote {\n        let mut result = $crate::cmp::Ordering::equal();\n        $fields\n        result\n    };\n    crate::meta::make_trait_impl(s, name, signature, for_each_field, quote {}, body)\n}\n// docs:end:derive_ord\n\n// Note: Field deliberately does not implement Ord\n\nimpl Ord for u128 {\n    fn cmp(self, other: u128) -> Ordering {\n        if self < other {\n            Ordering::less()\n        } else if self > other {\n            Ordering::greater()\n        } else {\n            Ordering::equal()\n        }\n    }\n}\nimpl Ord for u64 {\n    fn cmp(self, other: u64) -> Ordering {\n        if self < other {\n            Ordering::less()\n        } else if self > other {\n            Ordering::greater()\n        } else {\n            Ordering::equal()\n        }\n    }\n}\n\nimpl Ord for u32 {\n    fn cmp(self, other: u32) -> Ordering {\n        if self < other {\n            Ordering::less()\n        } else if self > other {\n            Ordering::greater()\n        } else {\n            Ordering::equal()\n        }\n    }\n}\n\nimpl Ord for u16 {\n    fn cmp(self, other: u16) -> Ordering {\n        if self < other {\n            Ordering::less()\n        } else if self > other {\n            Ordering::greater()\n        } else {\n            Ordering::equal()\n        }\n    }\n}\n\nimpl Ord for u8 {\n    fn cmp(self, other: u8) -> Ordering {\n        if self < other {\n            Ordering::less()\n        } else if self > other {\n            Ordering::greater()\n        } else {\n            Ordering::equal()\n        }\n    }\n}\n\nimpl Ord for i8 {\n    fn cmp(self, other: i8) -> Ordering {\n        if self < other {\n            Ordering::less()\n        } else if self > other {\n            Ordering::greater()\n        } else {\n            Ordering::equal()\n        }\n    }\n}\n\nimpl Ord for i16 {\n    fn cmp(self, other: i16) -> Ordering {\n        if self < other {\n            Ordering::less()\n        } else if self > other {\n            Ordering::greater()\n        } else {\n            Ordering::equal()\n        }\n    }\n}\n\nimpl Ord for i32 {\n    fn cmp(self, other: i32) -> Ordering {\n        if self < other {\n            Ordering::less()\n        } else if self > other {\n            Ordering::greater()\n        } else {\n            Ordering::equal()\n        }\n    }\n}\n\nimpl Ord for i64 {\n    fn cmp(self, other: i64) -> Ordering {\n        if self < other {\n            Ordering::less()\n        } else if self > other {\n            Ordering::greater()\n        } else {\n            Ordering::equal()\n        }\n    }\n}\n\nimpl Ord for () {\n    fn cmp(_self: Self, _other: ()) -> Ordering {\n        Ordering::equal()\n    }\n}\n\nimpl Ord for bool {\n    fn cmp(self, other: bool) -> Ordering {\n        if self {\n            if other {\n                Ordering::equal()\n            } else {\n                Ordering::greater()\n            }\n        } else if other {\n            Ordering::less()\n        } else {\n            Ordering::equal()\n        }\n    }\n}\n\nimpl<T, let N: u32> Ord for [T; N]\nwhere\n    T: Ord,\n{\n    // The first non-equal element of both arrays determines\n    // the ordering for the whole array.\n    fn cmp(self, other: [T; N]) -> Ordering {\n        let mut result = Ordering::equal();\n        for i in 0..self.len() {\n            if result == Ordering::equal() {\n                result = self[i].cmp(other[i]);\n            }\n        }\n        result\n    }\n}\n\nimpl<T> Ord for [T]\nwhere\n    T: Ord,\n{\n    // The first non-equal element of both arrays determines\n    // the ordering for the whole array.\n    fn cmp(self, other: [T]) -> Ordering {\n        let self_len = self.len();\n        let other_len = other.len();\n        let min_len = if self_len < other_len {\n            self_len\n        } else {\n            other_len\n        };\n\n        let mut result = Ordering::equal();\n        for i in 0..min_len {\n            if result == Ordering::equal() {\n                result = self[i].cmp(other[i]);\n            }\n        }\n\n        if result != Ordering::equal() {\n            result\n        } else {\n            self_len.cmp(other_len)\n        }\n    }\n}\n\ncomptime fn make_tuple_ord_body(n: u32) -> Quoted {\n    let last = n - 1u32;\n    let mut body = if last == 1 {\n        f\"let result = self.0.cmp(other.0);\".as_ctstring()\n    } else {\n        f\"let mut result = self.0.cmp(other.0);\".as_ctstring()\n    };\n    for i in 1u32..last {\n        body = body.append_fmtstr(\n            f\" if result == Ordering::equal() {{ result = self.{i}.cmp(other.{i}); }}\",\n        );\n    }\n    body = body.append_fmtstr(\n        f\" if result != Ordering::equal() {{ result }} else {{ self.{last}.cmp(other.{last}) }}\",\n    );\n    f\"{body}\".quoted_contents()\n}\n\nimpl<A: Ord> Ord for (A,) {\n    fn cmp(self, other: (A,)) -> Ordering {\n        self.0.cmp(other.0)\n    }\n}\n\nimpl<A: Ord, B: Ord> Ord for (A, B) {\n    fn cmp(self, other: (A, B)) -> Ordering {\n        make_tuple_ord_body!(2u32)\n    }\n}\n\nimpl<A: Ord, B: Ord, C: Ord> Ord for (A, B, C) {\n    fn cmp(self, other: (A, B, C)) -> Ordering {\n        make_tuple_ord_body!(3u32)\n    }\n}\n\nimpl<A: Ord, B: Ord, C: Ord, D: Ord> Ord for (A, B, C, D) {\n    fn cmp(self, other: (A, B, C, D)) -> Ordering {\n        make_tuple_ord_body!(4u32)\n    }\n}\n\nimpl<A: Ord, B: Ord, C: Ord, D: Ord, E: Ord> Ord for (A, B, C, D, E) {\n    fn cmp(self, other: (A, B, C, D, E)) -> Ordering {\n        make_tuple_ord_body!(5u32)\n    }\n}\n\nimpl<A: Ord, B: Ord, C: Ord, D: Ord, E: Ord, F: Ord> Ord for (A, B, C, D, E, F) {\n    fn cmp(self, other: (A, B, C, D, E, F)) -> Ordering {\n        make_tuple_ord_body!(6u32)\n    }\n}\n\nimpl<A: Ord, B: Ord, C: Ord, D: Ord, E: Ord, F: Ord, G: Ord> Ord for (A, B, C, D, E, F, G) {\n    fn cmp(self, other: (A, B, C, D, E, F, G)) -> Ordering {\n        make_tuple_ord_body!(7u32)\n    }\n}\n\nimpl<A: Ord, B: Ord, C: Ord, D: Ord, E: Ord, F: Ord, G: Ord, H: Ord> Ord for (A, B, C, D, E, F, G, H) {\n    fn cmp(self, other: (A, B, C, D, E, F, G, H)) -> Ordering {\n        make_tuple_ord_body!(8u32)\n    }\n}\n\nimpl<A: Ord, B: Ord, C: Ord, D: Ord, E: Ord, F: Ord, G: Ord, H: Ord, I: Ord> Ord for (A, B, C, D, E, F, G, H, I) {\n    fn cmp(self, other: (A, B, C, D, E, F, G, H, I)) -> Ordering {\n        make_tuple_ord_body!(9u32)\n    }\n}\n\nimpl<A: Ord, B: Ord, C: Ord, D: Ord, E: Ord, F: Ord, G: Ord, H: Ord, I: Ord, J: Ord> Ord for (A, B, C, D, E, F, G, H, I, J) {\n    fn cmp(self, other: (A, B, C, D, E, F, G, H, I, J)) -> Ordering {\n        make_tuple_ord_body!(10u32)\n    }\n}\n\nimpl<A: Ord, B: Ord, C: Ord, D: Ord, E: Ord, F: Ord, G: Ord, H: Ord, I: Ord, J: Ord, K: Ord> Ord for (A, B, C, D, E, F, G, H, I, J, K) {\n    fn cmp(self, other: (A, B, C, D, E, F, G, H, I, J, K)) -> Ordering {\n        make_tuple_ord_body!(11u32)\n    }\n}\n\nimpl<A: Ord, B: Ord, C: Ord, D: Ord, E: Ord, F: Ord, G: Ord, H: Ord, I: Ord, J: Ord, K: Ord, L: Ord> Ord for (A, B, C, D, E, F, G, H, I, J, K, L) {\n    fn cmp(self, other: (A, B, C, D, E, F, G, H, I, J, K, L)) -> Ordering {\n        make_tuple_ord_body!(12u32)\n    }\n}\n\n/// Compares and returns the maximum of two values.\n///\n/// Returns the second argument if the comparison determines them to be equal.\n///\n/// # Examples\n///\n/// ```\n/// use std::cmp;\n///\n/// assert_eq(cmp::max(1, 2), 2);\n/// assert_eq(cmp::max(2, 2), 2);\n/// ```\npub fn max<T>(v1: T, v2: T) -> T\nwhere\n    T: Ord,\n{\n    if v1 > v2 {\n        v1\n    } else {\n        v2\n    }\n}\n\n/// Compares and returns the minimum of two values.\n///\n/// Returns the first argument if the comparison determines them to be equal.\n///\n/// # Examples\n///\n/// ```\n/// use std::cmp;\n///\n/// assert_eq(cmp::min(1, 2), 1);\n/// assert_eq(cmp::min(2, 2), 2);\n/// ```\npub fn min<T>(v1: T, v2: T) -> T\nwhere\n    T: Ord,\n{\n    if v1 > v2 {\n        v2\n    } else {\n        v1\n    }\n}\n\nmod cmp_tests {\n    use crate::meta::unquote;\n    use super::{Eq, max, min, Ord, Ordering};\n\n    #[test]\n    fn sanity_check_min() {\n        assert_eq(min(0_u64, 1), 0);\n        assert_eq(min(0_u64, 0), 0);\n        assert_eq(min(1_u64, 1), 1);\n        assert_eq(min(255_u8, 0), 0);\n    }\n\n    #[test]\n    fn sanity_check_max() {\n        assert_eq(max(0_u64, 1), 1);\n        assert_eq(max(0_u64, 0), 0);\n        assert_eq(max(1_u64, 1), 1);\n        assert_eq(max(255_u8, 0), 255);\n    }\n\n    #[test]\n    fn correctly_handles_unequal_length_vectors() {\n        let vector_1 = [0, 1, 2, 3].as_vector();\n        let vector_2 = [0, 1, 2].as_vector();\n        assert(!vector_1.eq(vector_2));\n    }\n\n    #[test]\n    fn lexicographic_ordering_for_vectors() {\n        assert(\n            [2_u32].as_vector().cmp([1_u32, 1_u32, 1_u32].as_vector())\n                == super::Ordering::greater(),\n        );\n        assert(\n            [1_u32, 2_u32].as_vector().cmp([1_u32, 2_u32, 3_u32].as_vector())\n                == super::Ordering::less(),\n        );\n    }\n\n    #[test]\n    fn eq_unit() {\n        assert(().eq(()));\n    }\n\n    #[test]\n    fn eq_bool() {\n        assert(false.eq(false));\n        assert(!(false.eq(true)));\n        assert(!(true.eq(false)));\n        assert(true.eq(true));\n    }\n\n    #[test]\n    fn eq_integers() {\n        comptime {\n            for typ in @[\n                quote { u8 },\n                quote { i8 },\n                quote { u16 },\n                quote { i16 },\n                quote { u32 },\n                quote { i32 },\n                quote { u64 },\n                quote { i64 },\n                quote { u128 },\n                quote { Field },\n            ] {\n                let one = f\"1_{typ}\".quoted_contents();\n                let two = f\"2_{typ}\".quoted_contents();\n                unquote!(\n                    quote {\n                        assert($one.eq($one));\n                        assert(!($one.eq($two)));\n                    },\n                );\n            }\n        }\n    }\n\n    #[test]\n    fn eq_tuples() {\n        comptime {\n            for i in 1..=12 {\n                let mut tuple1 = @[];\n                let mut tuple2 = @[];\n                for _ in 0..i - 1 {\n                    tuple1 = tuple1.push_back(quote { 0 });\n                    tuple2 = tuple2.push_back(quote { 0 });\n                }\n                tuple1 = tuple1.push_back(quote { 0 });\n                tuple2 = tuple2.push_back(quote { 1 });\n                let tuple1 = tuple1.join(quote { , });\n                let tuple2 = tuple2.join(quote { , });\n                let tuple1 = quote { ($tuple1,) };\n                let tuple2 = quote { ($tuple2,) };\n                unquote!(\n                    quote {\n                    assert($tuple1.eq($tuple1));\n                    assert(!($tuple1.eq($tuple2)));\n                },\n                )\n            }\n        }\n    }\n\n    #[test]\n    fn cmp_unit() {\n        assert_eq(().cmp(()), Ordering::equal());\n    }\n\n    #[test]\n    fn cmp_bool() {\n        assert_eq(false.cmp(true), Ordering::less());\n        assert_eq(false.cmp(false), Ordering::equal());\n        assert_eq(true.cmp(true), Ordering::equal());\n        assert_eq(true.cmp(false), Ordering::greater());\n    }\n\n    #[test]\n    fn cmp_integers() {\n        comptime {\n            for typ in @[\n                quote { u8 },\n                quote { i8 },\n                quote { u16 },\n                quote { i16 },\n                quote { u32 },\n                quote { i32 },\n                quote { u64 },\n                quote { i64 },\n                quote { u128 },\n            ] {\n                let one = f\"1_{typ}\".quoted_contents();\n                let two = f\"2_{typ}\".quoted_contents();\n                unquote!(\n                    quote {\n                        assert_eq($one.cmp($two), Ordering::less());\n                        assert_eq($one.cmp($one), Ordering::equal());\n                        assert_eq($two.cmp($one), Ordering::greater());\n                    },\n                );\n            }\n        }\n    }\n\n    #[test]\n    fn cmp_tuples() {\n        comptime {\n            for i in 1..=12 {\n                let mut tuple1 = @[];\n                let mut tuple2 = @[];\n                for _ in 0..i - 1 {\n                    tuple1 = tuple1.push_back(quote { 0_u8 });\n                    tuple2 = tuple2.push_back(quote { 0_u8 });\n                }\n                tuple1 = tuple1.push_back(quote { 0_u8 });\n                tuple2 = tuple2.push_back(quote { 1_u8 });\n                let tuple1 = tuple1.join(quote { , });\n                let tuple2 = tuple2.join(quote { , });\n                let tuple1 = quote { ($tuple1,) };\n                let tuple2 = quote { ($tuple2,) };\n                unquote!(\n                    quote {\n                    assert_eq($tuple1.cmp($tuple1), Ordering::equal());\n                    assert_eq($tuple1.cmp($tuple2), Ordering::less());\n                    assert_eq($tuple2.cmp($tuple1), Ordering::greater());\n                },\n                )\n            }\n        }\n    }\n\n    #[test]\n    fn cmp_array() {\n        assert_eq([1_u8, 2, 3].cmp([1, 2, 3]), Ordering::equal());\n        assert_eq([1_u8, 2, 3].cmp([1, 3, 2]), Ordering::less());\n        assert_eq([1_u8, 3, 3].cmp([1, 2, 3]), Ordering::greater());\n    }\n\n    #[test]\n    fn cmp_vectors() {\n        // Equal lengths\n        assert_eq(@[1_u8, 2, 3].cmp(@[1, 2, 3]), Ordering::equal());\n        assert_eq(@[1_u8, 3, 3].cmp(@[1, 2, 3]), Ordering::greater());\n        assert_eq(@[1_u8, 2, 3].cmp(@[1, 3, 3]), Ordering::less());\n\n        // Different lengths\n        assert_eq(@[1_u8, 2].cmp(@[1, 2, 3]), Ordering::less());\n        assert_eq(@[1_u8, 2, 3].cmp(@[1, 2]), Ordering::greater());\n        assert_eq(@[10_u8, 0].cmp(@[9]), Ordering::greater());\n        assert_eq(@[9_u8, 0].cmp(@[10]), Ordering::less());\n        assert_eq(@[9_u8].cmp(@[10, 0]), Ordering::less());\n        assert_eq(@[10_u8].cmp(@[9, 0]), Ordering::greater());\n    }\n}\n"
     },
-    "51": {
+    "52": {
       "function_locations": [
-        {
-          "name": "no_sync",
-          "start": 699
-        },
         {
           "name": "SchnorrInitializerlessAccount::constructor",
-          "start": 1847
+          "start": 1235
         },
         {
           "name": "SchnorrInitializerlessAccount::entrypoint",
-          "start": 2466
+          "start": 1854
         },
         {
           "name": "SchnorrInitializerlessAccount::verify_private_authwit",
-          "start": 2719
+          "start": 2107
         },
         {
           "name": "SchnorrInitializerlessAccount::is_valid_impl",
-          "start": 2961
+          "start": 2349
         },
         {
           "name": "SchnorrInitializerlessAccount::lookup_validity",
-          "start": 4543
+          "start": 3931
         }
       ],
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-contracts/contracts/account/schnorr_initializerless_account_contract/src/main.nr",
-      "source": "use aztec::{\n    macros::{aztec, AztecConfig},\n    messages::{\n        discovery::{ComputeNoteHash, ComputeNoteNullifier, CustomMessageHandler},\n        processing::offchain::OffchainInboxSync,\n    },\n    protocol::address::AztecAddress,\n};\n\n/// Empty override to opt-out of state syncing. This contract does not hold private state,\n/// so runnning the sync process just results in unnecessary RPC calls\nunconstrained fn no_sync(\n    _contract_address: AztecAddress,\n    _compute_note_hash: ComputeNoteHash,\n    _compute_note_nullifier: ComputeNoteNullifier,\n    _process_custom_message: Option<CustomMessageHandler>,\n    _offchain_inbox_sync: Option<OffchainInboxSync>,\n    _scope: AztecAddress,\n) {}\n\n#[aztec(AztecConfig::new().custom_sync_state(crate::no_sync))]\npub contract SchnorrInitializerlessAccount {\n    use aztec::{\n        authwit::{\n            account::AccountActions,\n            auth::{compute_authwit_message_hash, compute_authwit_nullifier},\n            entrypoint::app::AppPayload,\n        },\n        context::PrivateContext,\n        macros::functions::{allow_phase_change, external, view},\n        oracle::{\n            auth_witness::get_auth_witness,\n            capsules::{load, store},\n            get_contract_instance::get_contract_instance,\n            get_nullifier_membership_witness::get_low_nullifier_membership_witness,\n        },\n        protocol::{\n            address::AztecAddress,\n            hash::{compute_siloed_nullifier, poseidon2_hash, poseidon2_hash_bytes},\n            traits::{Deserialize, Serialize},\n        },\n    };\n    use std::embedded_curve_ops::EmbeddedCurvePoint;\n\n    global PUB_KEY_SLOT: Field = comptime { poseidon2_hash_bytes(\"INITIALIZERLESS_ACCOUNT_PUB_KEY\".as_bytes()) };\n\n    #[external(\"utility\")]\n    unconstrained fn constructor(signing_pub_key_x: Field, signing_pub_key_y: Field) {\n        let expected = poseidon2_hash([signing_pub_key_x, signing_pub_key_y]);\n        let instance = get_contract_instance(self.address);\n        assert_eq(\n            expected,\n            instance.immutables_hash,\n            \"Public key hash does not match the immutables hash, refusing to store\",\n        );\n\n        store(\n            self.address,\n            PUB_KEY_SLOT,\n            [signing_pub_key_x, signing_pub_key_y],\n            self.address,\n        );\n    }\n\n    #[external(\"private\")]\n    #[allow_phase_change]\n    fn entrypoint(app_payload: AppPayload, fee_payment_method: u8, cancellable: bool) {\n        let actions = AccountActions::init(self.context, is_valid_impl);\n        actions.entrypoint(app_payload, fee_payment_method, cancellable);\n    }\n\n    #[external(\"private\")]\n    #[view]\n    fn verify_private_authwit(inner_hash: Field) -> Field {\n        let actions = AccountActions::init(self.context, is_valid_impl);\n        actions.verify_private_authwit(inner_hash)\n    }\n\n    #[contract_library_method]\n    fn is_valid_impl(context: &mut PrivateContext, outer_hash: Field) -> bool {\n        // Safety: The public key inside the capsule is checked to match the immutables_hash of this instance\n        let public_key = unsafe { load(context.this_address(), PUB_KEY_SLOT, context.this_address()) }\n            .map(|data| EmbeddedCurvePoint::deserialize(data))\n            .unwrap_or_else(|| panic(\n                \"Public key was not stored in the Private eXecution Environment. Please call `constructor` first\",\n            ));\n\n        let expected = poseidon2_hash(public_key.serialize());\n        let instance = get_contract_instance(context.this_address());\n\n        assert_eq(expected, instance.immutables_hash, \"Immutables do not match instance immutables_hash\");\n\n        // Safety: The witness is only used as a \"magical value\" that makes the\n        // signature verification below pass.\n        let limbs: [Field; 4] = unsafe { get_auth_witness(outer_hash) };\n        let signature = (\n            std::embedded_curve_ops::EmbeddedCurveScalar::new(limbs[0], limbs[1]),\n            std::embedded_curve_ops::EmbeddedCurveScalar::new(limbs[2], limbs[3]),\n        );\n\n        schnorr::verify_signature(public_key, signature, outer_hash)\n    }\n\n    /// @notice Helper function to check validity of private authwitnesses\n    /// @param consumer The address of the consumer of the message\n    /// @param message_hash The message hash of the message to check the validity\n    /// @return True if the message_hash can be consumed, false otherwise\n    #[external(\"utility\")]\n    unconstrained fn lookup_validity(consumer: AztecAddress, inner_hash: Field) -> bool {\n        // Safety: The public key inside the capsule is checked to match the immutables_hash of this instance\n        let public_key = load(self.address, PUB_KEY_SLOT, self.address)\n            .map(|data| EmbeddedCurvePoint::deserialize(data))\n            .unwrap_or_else(|| panic(\n                \"Public key was not stored in the Private eXecution Environment. Please call `constructor` first\",\n            ));\n\n        let message_hash = compute_authwit_message_hash(\n            consumer,\n            self.context.chain_id(),\n            self.context.version(),\n            inner_hash,\n        );\n\n        let limbs: [Field; 4] = get_auth_witness(message_hash);\n        let signature = (\n            std::embedded_curve_ops::EmbeddedCurveScalar::new(limbs[0], limbs[1]),\n            std::embedded_curve_ops::EmbeddedCurveScalar::new(limbs[2], limbs[3]),\n        );\n        let pub_key = std::embedded_curve_ops::EmbeddedCurvePoint { x: public_key.x, y: public_key.y };\n        let valid_in_private = schnorr::verify_signature(pub_key, signature, message_hash);\n\n        // Compute the nullifier and check if it is spent\n        // This will BLINDLY TRUST the oracle, but the oracle is us, and\n        // it is not as part of execution of the contract, so we are good.\n        let nullifier = compute_authwit_nullifier(self.address, inner_hash);\n        let siloed_nullifier = compute_siloed_nullifier(consumer, nullifier);\n        let (low_leaf_preimage, _witness) =\n            get_low_nullifier_membership_witness(self.context.block_header(), siloed_nullifier);\n        let is_spent = low_leaf_preimage.nullifier == siloed_nullifier;\n\n        !is_spent & valid_in_private\n    }\n}\n"
+      "source": "use 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 SchnorrInitializerlessAccount {\n    use aztec::{\n        authwit::{\n            account::AccountActions,\n            auth::{compute_authwit_message_hash, compute_authwit_nullifier},\n            entrypoint::app::AppPayload,\n        },\n        context::PrivateContext,\n        macros::functions::{allow_phase_change, external, view},\n        oracle::{\n            auth_witness::get_auth_witness,\n            capsules::{load, store},\n            get_contract_instance::get_contract_instance,\n            get_nullifier_membership_witness::get_low_nullifier_membership_witness,\n        },\n        protocol::{\n            address::AztecAddress,\n            hash::{compute_siloed_nullifier, poseidon2_hash, poseidon2_hash_bytes},\n            traits::{Deserialize, Serialize},\n        },\n    };\n    use std::embedded_curve_ops::EmbeddedCurvePoint;\n\n    global PUB_KEY_SLOT: Field = comptime { poseidon2_hash_bytes(\"INITIALIZERLESS_ACCOUNT_PUB_KEY\".as_bytes()) };\n\n    #[external(\"utility\")]\n    unconstrained fn constructor(signing_pub_key_x: Field, signing_pub_key_y: Field) {\n        let expected = poseidon2_hash([signing_pub_key_x, signing_pub_key_y]);\n        let instance = get_contract_instance(self.address);\n        assert_eq(\n            expected,\n            instance.immutables_hash,\n            \"Public key hash does not match the immutables hash, refusing to store\",\n        );\n\n        store(\n            self.address,\n            PUB_KEY_SLOT,\n            [signing_pub_key_x, signing_pub_key_y],\n            self.address,\n        );\n    }\n\n    #[external(\"private\")]\n    #[allow_phase_change]\n    fn entrypoint(app_payload: AppPayload, fee_payment_method: u8, cancellable: bool) {\n        let actions = AccountActions::init(self.context, is_valid_impl);\n        actions.entrypoint(app_payload, fee_payment_method, cancellable);\n    }\n\n    #[external(\"private\")]\n    #[view]\n    fn verify_private_authwit(inner_hash: Field) -> Field {\n        let actions = AccountActions::init(self.context, is_valid_impl);\n        actions.verify_private_authwit(inner_hash)\n    }\n\n    #[contract_library_method]\n    fn is_valid_impl(context: &mut PrivateContext, outer_hash: Field) -> bool {\n        // Safety: The public key inside the capsule is checked to match the immutables_hash of this instance\n        let public_key = unsafe { load(context.this_address(), PUB_KEY_SLOT, context.this_address()) }\n            .map(|data| EmbeddedCurvePoint::deserialize(data))\n            .unwrap_or_else(|| panic(\n                \"Public key was not stored in the Private eXecution Environment. Please call `constructor` first\",\n            ));\n\n        let expected = poseidon2_hash(public_key.serialize());\n        let instance = get_contract_instance(context.this_address());\n\n        assert_eq(expected, instance.immutables_hash, \"Immutables do not match instance immutables_hash\");\n\n        // Safety: The witness is only used as a \"magical value\" that makes the\n        // signature verification below pass.\n        let limbs: [Field; 4] = unsafe { get_auth_witness(outer_hash) };\n        let signature = (\n            std::embedded_curve_ops::EmbeddedCurveScalar::new(limbs[0], limbs[1]),\n            std::embedded_curve_ops::EmbeddedCurveScalar::new(limbs[2], limbs[3]),\n        );\n\n        schnorr::verify_signature(public_key, signature, outer_hash)\n    }\n\n    /// @notice Helper function to check validity of private authwitnesses\n    /// @param consumer The address of the consumer of the message\n    /// @param message_hash The message hash of the message to check the validity\n    /// @return True if the message_hash can be consumed, false otherwise\n    #[external(\"utility\")]\n    unconstrained fn lookup_validity(consumer: AztecAddress, inner_hash: Field) -> bool {\n        // Safety: The public key inside the capsule is checked to match the immutables_hash of this instance\n        let public_key = load(self.address, PUB_KEY_SLOT, self.address)\n            .map(|data| EmbeddedCurvePoint::deserialize(data))\n            .unwrap_or_else(|| panic(\n                \"Public key was not stored in the Private eXecution Environment. Please call `constructor` first\",\n            ));\n\n        let message_hash = compute_authwit_message_hash(\n            consumer,\n            self.context.chain_id(),\n            self.context.version(),\n            inner_hash,\n        );\n\n        let limbs: [Field; 4] = get_auth_witness(message_hash);\n        let signature = (\n            std::embedded_curve_ops::EmbeddedCurveScalar::new(limbs[0], limbs[1]),\n            std::embedded_curve_ops::EmbeddedCurveScalar::new(limbs[2], limbs[3]),\n        );\n        let pub_key = std::embedded_curve_ops::EmbeddedCurvePoint { x: public_key.x, y: public_key.y };\n        let valid_in_private = schnorr::verify_signature(pub_key, signature, message_hash);\n\n        // Compute the nullifier and check if it is spent\n        // This will BLINDLY TRUST the oracle, but the oracle is us, and\n        // it is not as part of execution of the contract, so we are good.\n        let nullifier = compute_authwit_nullifier(self.address, inner_hash);\n        let siloed_nullifier = compute_siloed_nullifier(consumer, nullifier);\n        let (low_leaf_preimage, _witness) =\n            get_low_nullifier_membership_witness(self.context.block_header(), siloed_nullifier);\n        let is_spent = low_leaf_preimage.nullifier == siloed_nullifier;\n\n        !is_spent & valid_in_private\n    }\n}\n"
     },
-    "52": {
+    "53": {
       "function_locations": [
         {
           "name": "AccountActions<Context>::init",
@@ -3238,7 +3250,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/authwit/account.nr",
       "source": "use crate::context::PrivateContext;\n\nuse crate::protocol::{constants::DOM_SEP__TX_NULLIFIER, hash::poseidon2_hash_with_separator, traits::Hash};\n\nuse crate::authwit::auth::{compute_authwit_message_hash, IS_VALID_SELECTOR};\nuse crate::authwit::entrypoint::app::AppPayload;\n\npub struct AccountActions<Context> {\n    context: Context,\n    is_valid_impl: fn(&mut PrivateContext, Field) -> bool,\n}\n\nimpl<Context> AccountActions<Context> {\n    pub fn init(context: Context, is_valid_impl: fn(&mut PrivateContext, Field) -> bool) -> Self {\n        AccountActions { context, is_valid_impl }\n    }\n}\n\n// See AccountFeePaymentMethodOptions enum in Aztec.js for docs:\n//\n//\n// https://github.com/AztecProtocol/aztec-packages/blob/next/yarn-project/entrypoints/src/account_entrypoint.ts\npub struct AccountFeePaymentMethodOptionsEnum {\n    pub EXTERNAL: u8,\n    pub PREEXISTING_FEE_JUICE: u8,\n    pub FEE_JUICE_WITH_CLAIM: u8,\n}\n\npub global AccountFeePaymentMethodOptions: AccountFeePaymentMethodOptionsEnum =\n    AccountFeePaymentMethodOptionsEnum { EXTERNAL: 0, PREEXISTING_FEE_JUICE: 1, FEE_JUICE_WITH_CLAIM: 2 };\n\n/// An implementation of the Account Action struct for the private context.\n///\n/// Implements logic to verify authorization and execute payloads.\nimpl AccountActions<&mut PrivateContext> {\n\n    /// Verifies that the `app_hash` is authorized and executes the `app_payload`.\n    ///\n    /// @param app_payload The payload that contains the calls to be executed in the app phase.\n    ///\n    /// @param fee_payment_method The mechanism via which the account contract will pay for the transaction:\n    /// - EXTERNAL (0): Signals that some other contract is in charge of paying the fee, nothing needs to be done.\n    /// - PREEXISTING_FEE_JUICE (1): Makes the account contract publicly pay for the transaction with its own FeeJuice\n    /// balance, which it must already have prior to this transaction. The contract will set itself as the fee payer\n    /// and end the setup phase.\n    /// - FEE_JUICE_WITH_CLAIM (2): Makes the account contract publicly pay for the transaction with its own FeeJuice\n    /// balance which is being claimed in the same transaction. The contract will set itself as the fee payer but not\n    /// end setup phase - this is done by the FeeJuice contract after enqueuing a public call, which unlike most public\n    /// calls is whitelisted to be executable during setup.\n    ///\n    /// @param cancellable Controls whether to emit app_payload.tx_nonce as a nullifier, allowing a subsequent\n    /// transaction to be sent with a higher priority fee. This can be used to cancel the first transaction sent,\n    /// assuming it hasn't been mined yet.\n    ///\n    pub fn entrypoint(self, app_payload: AppPayload, fee_payment_method: u8, cancellable: bool) {\n        let valid_fn = self.is_valid_impl;\n\n        let message_hash = compute_authwit_message_hash(\n            self.context.this_address(),\n            self.context.chain_id(),\n            self.context.version(),\n            app_payload.hash(),\n        );\n        assert(valid_fn(self.context, message_hash));\n\n        if fee_payment_method == AccountFeePaymentMethodOptions.PREEXISTING_FEE_JUICE {\n            self.context.set_as_fee_payer();\n            self.context.end_setup();\n        }\n        if fee_payment_method == AccountFeePaymentMethodOptions.FEE_JUICE_WITH_CLAIM {\n            self.context.set_as_fee_payer();\n        }\n        app_payload.execute_calls(self.context);\n\n        if cancellable {\n            let tx_nullifier = poseidon2_hash_with_separator([app_payload.tx_nonce], DOM_SEP__TX_NULLIFIER);\n            self.context.push_nullifier_unsafe(tx_nullifier);\n        }\n    }\n\n    /// Verifies that the `msg_sender` is authorized to consume `inner_hash` by the account.\n    ///\n    /// Computes the `message_hash` using the `msg_sender`, `chain_id`, `version` and `inner_hash`. Then executes the\n    /// `is_valid_impl` function to verify that the message is authorized.\n    ///\n    /// Will revert if the message is not authorized.\n    ///\n    /// @param inner_hash The hash of the message that the `msg_sender` is trying to consume.\n    pub fn verify_private_authwit(self, inner_hash: Field) -> Field {\n        // The `inner_hash` is \"siloed\" with the `msg_sender` to ensure that only it can consume the message. This\n        // ensures that contracts cannot consume messages that are not intended for them.\n        let message_hash = compute_authwit_message_hash(\n            self.context.maybe_msg_sender().unwrap(),\n            self.context.chain_id(),\n            self.context.version(),\n            inner_hash,\n        );\n        let valid_fn = self.is_valid_impl;\n        assert(valid_fn(self.context, message_hash), \"Message not authorized by account\");\n        IS_VALID_SELECTOR\n    }\n}\n"
     },
-    "53": {
+    "54": {
       "function_locations": [
         {
           "name": "emit_authorization_as_offchain_effect",
@@ -3288,7 +3300,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/authwit/auth.nr",
       "source": "use crate::{\n    authwit::{authorization_interface::AuthorizationInterface, AuthorizationSelector},\n    context::{gas::GasOpts, PrivateContext, PublicContext},\n    hash::hash_args,\n    macros::authorization::authorization,\n    oracle::{execution_cache::load, offchain_effect::emit_offchain_effect},\n};\nuse crate::protocol::{\n    abis::function_selector::FunctionSelector,\n    address::AztecAddress,\n    constants::{DOM_SEP__AUTHWIT_INNER, DOM_SEP__AUTHWIT_NULLIFIER, DOM_SEP__AUTHWIT_OUTER},\n    hash::poseidon2_hash_with_separator,\n    traits::{Serialize, ToField},\n};\nuse crate::standard_addresses::STANDARD_AUTH_REGISTRY_ADDRESS;\n\n/// Authentication witness helper library\n///\n/// Authentication Witness is a scheme for authenticating actions on Aztec, so users can allow third-parties (e.g.\n/// protocols or other users) to execute an action on their behalf.\n///\n/// This library provides helper functions to manage such witnesses. The authentication witness, is some \"witness\"\n/// (data) that authenticates a `message_hash`. The simplest example of an authentication witness, is a signature. The\n/// signature is the \"evidence\", that the signer has seen the message, agrees with it, and has allowed it. It does not\n/// need to be a signature. It could be any kind of \"proof\" that the message is allowed. Another proof could be knowing\n/// some kind of secret, or having some kind of \"token\" that allows the message.\n///\n/// The `message_hash` is a hash of the following structure: hash(consumer, chain_id, version, inner_hash)\n/// - consumer: the address of the contract that is \"consuming\" the message,\n/// - chain_id: the chain id of the chain that the message is being consumed on,\n/// - version: the version of the chain that the message is being consumed on,\n/// - inner_hash: the hash of the \"inner\" message that is being consumed, this is the \"actual\" message or action.\n///\n/// While the `inner_hash` could be anything, such as showing you signed a specific message, it will often be a hash of\n/// the \"action\" to approve, along with who made the call. As part of this library, we provide a few helper functions\n/// to deal with such messages.\n///\n/// For example, we provide helper function that is used for checking that the message is an encoding of the current\n/// call. This can be used to let some contract \"allow\" another contract to act on its behalf, as long as it can show\n/// that it is acting on behalf of the contract.\n///\n/// If we take a case of allowing a contract to transfer tokens on behalf of an account, the `inner_hash` can be\n/// derived as: inner_hash = hash(caller, \"transfer\", hash(to, amount))\n///\n/// Where the `caller` would be the address of the contract that is trying to transfer the tokens, and `to` and\n/// `amount` the arguments for the transfer.\n///\n/// Note that we have both a `caller` and a `consumer`, the `consumer` will be the contract that is consuming the\n/// message, in the case of the transfer, it would be the `Token` contract itself, while the caller, will be the actor\n/// that is allowed to transfer the tokens.\n///\n///\n/// The authentication mechanism works differently in public and private contexts. In private, we recall that\n/// everything is executed on the user's device, so we can use `oracles` to \"ask\" the user (not contract) for\n/// information. In public we cannot do this, since it is executed by the sequencer (someone else). Therefore we can\n/// instead use a \"registry\" to store the messages that we have approved.\n///\n/// A simple example would be a \"token\" that is being \"pulled\" from one account into another. We will first outline how\n/// this would look in private, and then in public later.\n///\n/// Say that a user `Alice` wants to deposit some tokens into a DeFi protocol (say a DEX). `Alice` would make a\n/// `deposit` transaction, that she is executing using her account contract. The account would call the `DeFi` contract\n/// to execute `deposit`, which would try to pull funds from the `Token` contract. Since the `DeFi` contract is trying\n/// to pull funds from an account that is not its own, it needs to convince the `Token` contract that it is allowed to\n/// do so.\n///\n/// This is where the authentication witness comes in The `Token` contract computes a `message_hash` from the\n/// `transfer` call, and then asks `Alice Account` contract to verify that the `DeFi` contract is allowed to execute\n/// that call.\n///\n/// `Alice Account` contract can then ask `Alice` if she wants to allow the `DeFi` contract to pull funds from her\n/// account. If she does, she will sign the `message_hash` and return the signature to the `Alice Account` which will\n/// validate it and return success to the `Token` contract which will then allow the `DeFi` contract to pull funds from\n/// `Alice`.\n///\n/// To ensure that the same \"approval\" cannot be used multiple times, we also compute a `nullifier` for the\n/// authentication witness, and emit it from the `Token` contract (consumer).\n///\n/// Note that we can do this flow as we are in private were we can do oracle calls out from contracts.\n///\n///\n///  Person          Contract              Contract               Contract\n///  Alice          Alice Account          Token                   DeFi\n///   |                  |                  |                      |\n///   | Defi.deposit(Token, 1000)           |                      |\n///   |----------------->|                  |                      |\n///   |                  | deposit(Token, 1000)                    |\n///   |                  |---------------------------------------->|\n///   |                  |                  |                      |\n///   |                  |                  | transfer(Alice, Defi, 1000)\n///   |                  |                  |<---------------------|\n///   |                  |                  |                      |\n///   |                  | Check if Defi may call transfer(Alice, Defi, 1000)\n///   |                  |<-----------------|                      |\n///   |                  |                  |                      |\n///   | Please give me AuthWit for DeFi     |                      |\n///   | calling transfer(Alice, Defi, 1000) |                      |\n///   |<-----------------|                  |                      |\n///   |                  |                  |                      |\n///   |                  |                  |                      |\n///   | AuthWit for transfer(Alice, Defi, 1000)                    |\n///   |----------------->|                  |                      |\n///   |                  | AuthWit validity |                      |\n///   |                  |----------------->|                      |\n///   |                  |                  |                      |\n///   |                  |       throw if invalid AuthWit          |\n///   |                  |                  |                      |\n///   |                  |       emit AuthWit nullifier            |\n///   |                  |                  |                      |\n///   |                  |       transfer(Alice, Defi, 1000)       |\n///   |                  |                  |                      |\n///   |                  |                  |                      |\n///   |                  |                  | success              |\n///   |                  |                  |--------------------->|\n///   |                  |                  |                      |\n///   |                  |                  |                      |\n///   |                  |                  |           deposit(Token, 1000)\n///   |                  |                  |                      |\n///   |                  |                  |                      |\n///\n///\n/// If we instead were in public, we cannot do the same flow. Instead we would use an authentication registry to store\n/// the messages that we have approved.\n///\n/// To approve a message, `Alice Account` can make a `set_authorized` call to the registry, to set a `message_hash` as\n/// authorized. This is essentially a mapping from `message_hash` to `true` for `Alice Contract`. Every account has its\n/// own map in the registry, so `Alice` cannot approve a message for `Bob`.\n///\n/// The `Token` contract can then try to \"spend\" the approval by calling `consume` on the registry. If the message was\n/// approved, the value is updated to `false`, and we return the success flag. For more information on the registry,\n/// see `main.nr` in `auth_registry_contract`.\n///\n/// Person          Contract              Contract            Contract               Contract\n/// Alice          Alice Account          Registry             Token                   DeFi\n///   |                  |                    |                   |                      |\n///   | Registry.set_authorized(..., true)    |                   |                      |\n///   |----------------->|                    |                   |                      |\n///   |                  | set_authorized(..., true)              |                      |\n///   |                  |------------------->|                   |                      |\n///   |                  |                    |                   |                      |\n///   |                  |         set authorized to true         |                      |\n///   |                  |                    |                   |                      |\n///   |                  |                    |                   |                      |\n///   | Defi.deposit(Token, 1000)             |                   |                      |\n///   |----------------->|                    |                   |                      |\n///   |                  | deposit(Token, 1000)                   |                      |\n///   |                  |-------------------------------------------------------------->|\n///   |                  |                    |                   |                      |\n///   |                  |                    |              transfer(Alice, Defi, 1000) |\n///   |                  |                    |                   |<---------------------|\n///   |                  |                    |                   |                      |\n///   |                  |                    | Check if Defi may call transfer(Alice, Defi, 1000)\n///   |                  |                    |<------------------|                      |\n///   |                  |                    |                   |                      |\n///   |                  |          throw if invalid AuthWit      |                      |\n///   |                  |                    |                   |                      |\n///   |                  |                    |                   |                      |\n///   |                  |           set authorized to false      |                      |\n///   |                  |                    |                   |                      |\n///   |                  |                    |                   |                      |\n///   |                  |                    | AuthWit validity  |                      |\n///   |                  |                    |------------------>|                      |\n///   |                  |                    |                   |                      |\n///   |                  |                    |                   | transfer(Alice, Defi, 1000)\n///   |                  |                    |                   |<-------------------->|\n///   |                  |                    |                   |                      |\n///   |                  |                    |                   | success              |\n///   |                  |                    |                   |--------------------->|\n///   |                  |                    |                   |                      |\n///   |                  |                    |                   |     deposit(Token, 1000)\n///   |                  |                    |                   |                      |\n///\n///\n/// --- FAQ ---\n/// Q:   Why are we using a success flag of `poseidon2_hash_bytes(\"IS_VALID()\")` instead of just returning a boolean?\n/// A:   We want to make sure that we don't accidentally return `true` if there is a collision in the function\n/// selector. By returning a hash of `IS_VALID()`, it becomes very unlikely that there is both a collision and we\n/// return a success flag.\n///\n/// Q:   Why are we using static calls?\n/// A:   We are using static calls to ensure that the account contract cannot re-enter. If it was a normal call, it\n/// could make a new call and do a re-entry attack. Using a static ensures that it cannot update any state.\n///\n/// Q:   Would it not be cheaper to use a nullifier instead of updating state in public?\n/// A:   At a quick glance, a public state update + nullifier is 96 bytes, but two state updates are 128, so it would\n/// be cheaper to use a nullifier, if this is the way it would always be done. However, if both the approval and the\n/// consumption is done in the same transaction, then we will be able to squash the updates (only final tx state diff\n/// is posted to DA), and now it is cheaper.\n///\n/// Q:   Why is the chain id and the version part of the message hash?\n/// A:   The chain id and the version is part of the message hash to ensure that the message is only valid on a\n/// specific chain to avoid a case where the same message could be used across multiple chains.\n\npub global IS_VALID_SELECTOR: Field = 0x47dacd73; // 4 last bytes of\n// poseidon2_hash_bytes(\"IS_VALID()\")\n\n/// A struct that represents a contract call the user can authorize. It's associated identifier is generated by\n/// serializing and hashing it. The user is expected to sign this hash to signal the contract call can be performed on\n/// their behalf\n#[authorization]\nstruct CallAuthorization {\n    msg_sender: AztecAddress,\n    selector: FunctionSelector,\n    args_hash: Field,\n}\n\n/// A struct that represents a request to authorize a call, which is used to emit an offchain effect so the user/wallet\n/// can understand what they are being asked to sign. It is generated from a CallAuthorization by adding metadata to\n/// it, such as the selector for the authorization, the inner hash, and the actual arguments that are being passed to\n/// the function call.\n#[derive(Serialize)]\nstruct CallAuthorizationRequest {\n    selector: AuthorizationSelector,\n    inner_hash: Field,\n    on_behalf_of: AztecAddress,\n    msg_sender: AztecAddress,\n    fn_selector: FunctionSelector,\n    args_hash: Field,\n}\n\nunconstrained fn emit_authorization_as_offchain_effect<let N: u32>(\n    authorization: CallAuthorization,\n    inner_hash: Field,\n    on_behalf_of: AztecAddress,\n) {\n    let args: [Field; N] = load(authorization.args_hash);\n    let authorization_request = CallAuthorizationRequest {\n        selector: authorization.get_authorization_selector(),\n        inner_hash: inner_hash,\n        on_behalf_of: on_behalf_of,\n        msg_sender: authorization.msg_sender,\n        fn_selector: authorization.selector,\n        args_hash: authorization.args_hash,\n    };\n    emit_offchain_effect(authorization_request.serialize().concat(args))\n}\n\n/// Assert that `on_behalf_of` has authorized the current call with a valid authentication witness\n///\n/// Compute the `inner_hash` using the `msg_sender`, `selector` and `args_hash` and then make a call out to the\n/// `on_behalf_of` contract to verify that the `inner_hash` is valid.\n///\n/// Additionally, this function emits the identifying information of the call as an offchain effect so PXE can rely the\n/// information to the user/wallet in a readable way. To that effect, it is generic over N, where N is the number of\n/// arguments the authorized functions takes. This is used to load the arguments from the execution cache. This\n/// function is intended to be called via a macro, which will use the turbofish operator to specify the number of\n/// arguments.\n///\n/// @param on_behalf_of The address that has allegedly authorized the current call\npub fn assert_current_call_valid_authwit<let N: u32>(context: &mut PrivateContext, on_behalf_of: AztecAddress) {\n    let args_hash: Field = context.get_args_hash();\n\n    let authorization =\n        CallAuthorization { msg_sender: context.maybe_msg_sender().unwrap(), selector: context.selector(), args_hash };\n    let inner_hash = compute_inner_authwit_hash(authorization.serialize());\n    // Safety: Offchain effects are by definition unconstrained. They are emitted via an oracle which we don't use for\n    // anything besides its side effects, therefore this is safe to call.\n    unsafe { emit_authorization_as_offchain_effect::<N>(authorization, inner_hash, on_behalf_of) };\n\n    assert_inner_hash_valid_authwit(context, on_behalf_of, inner_hash);\n}\n\n/// Assert that a specific `inner_hash` is valid for the `on_behalf_of` address\n///\n/// Used as an internal function for `assert_current_call_valid_authwit` and can be used as a standalone function when\n/// the `inner_hash` is from a different source, e.g., say a block of text etc.\n///\n/// @param on_behalf_of The address that has allegedly authorized the current call @param inner_hash The hash of the\n/// message to authorize\npub fn assert_inner_hash_valid_authwit(context: &mut PrivateContext, on_behalf_of: AztecAddress, inner_hash: Field) {\n    // We perform a static call here and not a standard one to ensure that the account contract cannot re-enter.\n    let result: Field = context\n        .static_call_private_function(\n            on_behalf_of,\n            comptime { FunctionSelector::from_signature(\"verify_private_authwit(Field)\") },\n            [inner_hash],\n        )\n        .get_preimage();\n    assert(result == IS_VALID_SELECTOR, \"Message not authorized by account\");\n    // Compute the nullifier, similar computation to the outer hash, but without the chain_id and version. Those should\n    // already be handled in the verification, so we just need something to nullify, that allows the same inner_hash\n    // for multiple actors.\n    let nullifier = compute_authwit_nullifier(on_behalf_of, inner_hash);\n    context.push_nullifier_unsafe(nullifier);\n}\n\n/// Assert that `on_behalf_of` has authorized the current call in the authentication registry\n///\n/// Compute the `inner_hash` using the `msg_sender`, `selector` and `args_hash` and then make a call out to the\n/// `on_behalf_of` contract to verify that the `inner_hash` is valid.\n///\n/// Note that the authentication registry will take the `msg_sender` into account as the consumer, so this will only\n/// work if the `msg_sender` is the same as the `consumer` when the `message_hash` was inserted into the registry.\n///\n/// @param on_behalf_of The address that has allegedly authorized the current call\npub unconstrained fn assert_current_call_valid_authwit_public(context: PublicContext, on_behalf_of: AztecAddress) {\n    let inner_hash = compute_inner_authwit_hash([\n        context.maybe_msg_sender().unwrap().to_field(),\n        context.selector().to_field(),\n        context.get_args_hash(),\n    ]);\n    assert_inner_hash_valid_authwit_public(context, on_behalf_of, inner_hash);\n}\n\n/// Assert that `on_behalf_of` has authorized a specific `inner_hash` in the authentication registry\n///\n/// Compute the `inner_hash` using the `msg_sender`, `selector` and `args_hash` and then make a call out to the\n/// `on_behalf_of` contract to verify that the `inner_hash` is valid.\n///\n/// Note that the authentication registry will take the `msg_sender` into account as the consumer, so this will only\n/// work if the `msg_sender` is the same as the `consumer` when the `message_hash` was inserted into the registry.\n///\n/// @param on_behalf_of The address that has allegedly authorized the `inner_hash`\npub unconstrained fn assert_inner_hash_valid_authwit_public(\n    context: PublicContext,\n    on_behalf_of: AztecAddress,\n    inner_hash: Field,\n) {\n    let results: [Field] = context.call_public_function(\n        STANDARD_AUTH_REGISTRY_ADDRESS,\n        comptime { FunctionSelector::from_signature(\"consume((Field),Field)\") },\n        [on_behalf_of.to_field(), inner_hash],\n        GasOpts::default(),\n    );\n    assert(results.len() == 1, \"Invalid response from registry\");\n    assert(results[0] == IS_VALID_SELECTOR, \"Message not authorized by account\");\n}\n\n/// Compute the `message_hash` from a function call to be used by an authentication witness\n///\n/// Useful for when you need a non-account contract to approve during execution. For example if you need a contract to\n/// make a call to nested contract, e.g., contract A wants to exit token T to L1 using bridge B, so it needs to allow B\n/// to transfer T on its behalf.\n///\n/// @param caller The address of the contract that is calling the function, in the example above, this would be B\n/// @param consumer The address of the contract that is consuming the message, in the example above, this would be T\n/// @param chain_id The chain id of the chain that the message is being consumed on @param version The version of the\n/// chain that the message is being consumed on @param selector The function selector of the function that is being\n/// called @param args The arguments of the function that is being called\npub fn compute_authwit_message_hash_from_call<let N: u32>(\n    caller: AztecAddress,\n    consumer: AztecAddress,\n    chain_id: Field,\n    version: Field,\n    selector: FunctionSelector,\n    args: [Field; N],\n) -> Field {\n    let args_hash = hash_args(args);\n    let inner_hash = compute_inner_authwit_hash([caller.to_field(), selector.to_field(), args_hash]);\n    compute_authwit_message_hash(consumer, chain_id, version, inner_hash)\n}\n\n/// Computes the `inner_hash` of the authentication witness\n///\n/// This is used internally, but also useful in cases where you want to compute the `inner_hash` for a specific message\n/// that is not necessarily a call, but just some \"bytes\" or text.\n///\n/// @param args The arguments to hash\npub fn compute_inner_authwit_hash<let N: u32>(args: [Field; N]) -> Field {\n    poseidon2_hash_with_separator(args, DOM_SEP__AUTHWIT_INNER)\n}\n\n/// Computes the `authwit_nullifier` for a specific `on_behalf_of` and `inner_hash`\n///\n/// Using the `on_behalf_of` and the `inner_hash` to ensure that the nullifier is siloed for a specific `on_behalf_of`.\n///\n/// @param on_behalf_of The address that has authorized the `inner_hash` @param inner_hash The hash of the message to\n/// authorize\npub fn compute_authwit_nullifier(on_behalf_of: AztecAddress, inner_hash: Field) -> Field {\n    poseidon2_hash_with_separator(\n        [on_behalf_of.to_field(), inner_hash],\n        DOM_SEP__AUTHWIT_NULLIFIER,\n    )\n}\n\n/// Computes the `message_hash` for the authentication witness\n///\n/// @param consumer The address of the contract that is consuming the message @param chain_id The chain id of the chain\n/// that the message is being consumed on @param version The version of the chain that the message is being consumed on\n/// @param inner_hash The hash of the \"inner\" message that is being consumed\npub fn compute_authwit_message_hash(\n    consumer: AztecAddress,\n    chain_id: Field,\n    version: Field,\n    inner_hash: Field,\n) -> Field {\n    poseidon2_hash_with_separator(\n        [consumer.to_field(), chain_id, version, inner_hash],\n        DOM_SEP__AUTHWIT_OUTER,\n    )\n}\n\n/// Helper function to set the authorization status of a message hash\n///\n/// Wraps a public call to the authentication registry to set the authorization status of a `message_hash`\n///\n/// @param message_hash The hash of the message to authorize @param authorize True if the message should be authorized,\n/// false if it should be revoked\npub unconstrained fn set_authorized(context: PublicContext, message_hash: Field, authorize: bool) {\n    let res = context.call_public_function(\n        STANDARD_AUTH_REGISTRY_ADDRESS,\n        comptime { FunctionSelector::from_signature(\"set_authorized(Field,bool)\") },\n        [message_hash, authorize as Field],\n        GasOpts::default(),\n    );\n    assert(res.len() == 0);\n}\n\n/// Helper function to reject all authwits\n///\n/// Wraps a public call to the authentication registry to set the `reject_all` flag\n///\n/// @param reject True if all authwits should be rejected, false otherwise\npub unconstrained fn set_reject_all(context: PublicContext, reject: bool) {\n    let res = context.call_public_function(\n        STANDARD_AUTH_REGISTRY_ADDRESS,\n        comptime { FunctionSelector::from_signature(\"set_reject_all(bool)\") },\n        [reject as Field],\n        GasOpts::default(),\n    );\n    assert(res.len() == 0);\n}\n"
     },
-    "56": {
+    "57": {
       "function_locations": [
         {
           "name": "<impl Hash for AppPayload>::hash",
@@ -3332,363 +3344,415 @@
           "name": "BoundedVec<T, MaxLen>::len",
           "start": 7072
         },
+        {
+          "name": "BoundedVec<T, MaxLen>::set_len",
+          "start": 7970
+        },
+        {
+          "name": "BoundedVec<T, MaxLen>::truncate",
+          "start": 8742
+        },
         {
           "name": "BoundedVec<T, MaxLen>::max_len",
-          "start": 7513
+          "start": 9234
         },
         {
           "name": "BoundedVec<T, MaxLen>::storage",
-          "start": 8111
+          "start": 9832
         },
         {
           "name": "BoundedVec<T, MaxLen>::extend_from_array",
-          "start": 8667
+          "start": 10388
         },
         {
           "name": "BoundedVec<T, MaxLen>::extend_from_vector",
-          "start": 9438
+          "start": 11159
         },
         {
           "name": "BoundedVec<T, MaxLen>::extend_from_bounded_vec",
-          "start": 10383
+          "start": 12104
         },
         {
           "name": "BoundedVec<T, MaxLen>::from_array",
-          "start": 12778
+          "start": 13251
         },
         {
           "name": "BoundedVec<T, MaxLen>::pop",
-          "start": 13521
+          "start": 13994
         },
         {
           "name": "BoundedVec<T, MaxLen>::any",
-          "start": 14063
+          "start": 14536
         },
         {
           "name": "BoundedVec<T, MaxLen>::map",
-          "start": 14979
+          "start": 15452
         },
         {
           "name": "BoundedVec<T, MaxLen>::mapi",
-          "start": 15979
+          "start": 16387
         },
         {
           "name": "BoundedVec<T, MaxLen>::for_each",
-          "start": 16937
+          "start": 17280
         },
         {
           "name": "BoundedVec<T, MaxLen>::for_eachi",
-          "start": 17742
+          "start": 18085
         },
         {
           "name": "BoundedVec<T, MaxLen>::from_parts",
-          "start": 18439
+          "start": 18782
         },
         {
           "name": "BoundedVec<T, MaxLen>::from_parts_unchecked",
-          "start": 19903
+          "start": 20246
         },
         {
           "name": "<impl Eq for BoundedVec<T, MaxLen>>::eq",
-          "start": 20115
+          "start": 20458
         },
         {
           "name": "unconstrained_eq",
-          "start": 21039
+          "start": 21382
         },
         {
           "name": "<impl From<[T; Len]> for BoundedVec<T, MaxLen>>::from",
-          "start": 21335
+          "start": 21678
         },
         {
           "name": "bounded_vec_tests::get::panics_when_reading_elements_past_end_of_vec",
-          "start": 21618
+          "start": 21961
         },
         {
           "name": "bounded_vec_tests::get::panics_when_reading_beyond_length",
-          "start": 21853
+          "start": 22196
         },
         {
           "name": "bounded_vec_tests::get::get_works_within_bounds",
-          "start": 22028
+          "start": 22371
         },
         {
           "name": "bounded_vec_tests::get::get_unchecked_works",
-          "start": 22287
+          "start": 22630
         },
         {
           "name": "bounded_vec_tests::get::get_unchecked_works_past_len",
-          "start": 22531
+          "start": 22874
         },
         {
           "name": "bounded_vec_tests::set::set_updates_values_properly",
-          "start": 22804
+          "start": 23147
         },
         {
           "name": "bounded_vec_tests::set::panics_when_writing_elements_past_end_of_vec",
-          "start": 23442
+          "start": 23785
         },
         {
           "name": "bounded_vec_tests::set::panics_when_setting_beyond_length",
-          "start": 23677
+          "start": 24020
         },
         {
           "name": "bounded_vec_tests::set::set_unchecked_operations",
-          "start": 23852
+          "start": 24195
         },
         {
           "name": "bounded_vec_tests::set::set_unchecked_operations_past_len",
-          "start": 24184
+          "start": 24527
         },
         {
           "name": "bounded_vec_tests::set::set_preserves_other_elements",
-          "start": 24448
+          "start": 24791
+        },
+        {
+          "name": "bounded_vec_tests::set_len::set_len_works_after_multiple_unchecked_sets",
+          "start": 25266
+        },
+        {
+          "name": "bounded_vec_tests::set_len::set_len_can_reduce_the_length",
+          "start": 26113
+        },
+        {
+          "name": "bounded_vec_tests::set_len::panics_when_set_len_beyond_max_len",
+          "start": 26664
+        },
+        {
+          "name": "bounded_vec_tests::truncate::truncate_shortens_to_len",
+          "start": 26923
+        },
+        {
+          "name": "bounded_vec_tests::truncate::truncate_to_zero_empties_the_vec",
+          "start": 27284
+        },
+        {
+          "name": "bounded_vec_tests::truncate::truncate_to_equal_len_is_noop",
+          "start": 27504
+        },
+        {
+          "name": "bounded_vec_tests::truncate::truncate_to_greater_len_is_noop",
+          "start": 27726
+        },
+        {
+          "name": "bounded_vec_tests::truncate::truncate_beyond_max_len_is_noop",
+          "start": 27948
+        },
+        {
+          "name": "bounded_vec_tests::truncate::truncate_does_not_zero_remaining_storage",
+          "start": 28180
+        },
+        {
+          "name": "bounded_vec_tests::truncate::truncate_then_push_continues_from_new_len",
+          "start": 28635
         },
         {
           "name": "bounded_vec_tests::any::returns_false_if_predicate_not_satisfied",
-          "start": 24995
+          "start": 29188
         },
         {
           "name": "bounded_vec_tests::any::returns_true_if_predicate_satisfied",
-          "start": 25279
+          "start": 29472
         },
         {
           "name": "bounded_vec_tests::any::returns_false_on_empty_boundedvec",
-          "start": 25528
+          "start": 29721
         },
         {
           "name": "bounded_vec_tests::any::any_with_complex_predicates",
-          "start": 25769
+          "start": 29962
         },
         {
           "name": "bounded_vec_tests::any::any_with_partial_vector",
-          "start": 26132
+          "start": 30325
         },
         {
           "name": "bounded_vec_tests::map::applies_function_correctly",
-          "start": 26598
+          "start": 30791
         },
         {
           "name": "bounded_vec_tests::map::applies_function_that_changes_return_type",
-          "start": 27020
+          "start": 31213
         },
         {
           "name": "bounded_vec_tests::map::does_not_apply_function_past_len",
-          "start": 27368
+          "start": 31561
         },
         {
           "name": "bounded_vec_tests::map::map_with_conditional_logic",
-          "start": 27741
+          "start": 31934
         },
         {
           "name": "bounded_vec_tests::map::map_preserves_length",
-          "start": 28065
+          "start": 32258
         },
         {
           "name": "bounded_vec_tests::map::map_on_empty_vector",
-          "start": 28357
+          "start": 32550
         },
         {
           "name": "bounded_vec_tests::mapi::applies_function_correctly",
-          "start": 28810
+          "start": 33003
         },
         {
           "name": "bounded_vec_tests::mapi::applies_function_that_changes_return_type",
-          "start": 29243
+          "start": 33436
         },
         {
           "name": "bounded_vec_tests::mapi::does_not_apply_function_past_len",
-          "start": 29600
+          "start": 33793
         },
         {
           "name": "bounded_vec_tests::mapi::mapi_with_index_branching_logic",
-          "start": 29982
+          "start": 34175
         },
         {
           "name": "bounded_vec_tests::for_each::for_each_map",
-          "start": 30590
+          "start": 34783
         },
         {
           "name": "bounded_vec_tests::for_each::smoke_test",
-          "start": 30850
+          "start": 35043
         },
         {
           "name": "bounded_vec_tests::for_each::applies_function_correctly",
-          "start": 31258
+          "start": 35451
         },
         {
           "name": "bounded_vec_tests::for_each::applies_function_that_changes_return_type",
-          "start": 31592
+          "start": 35785
         },
         {
           "name": "bounded_vec_tests::for_each::does_not_apply_function_past_len",
-          "start": 31950
+          "start": 36143
         },
         {
           "name": "bounded_vec_tests::for_each::for_each_on_empty_vector",
-          "start": 32331
+          "start": 36524
         },
         {
           "name": "bounded_vec_tests::for_each::for_each_with_side_effects",
-          "start": 32617
+          "start": 36810
         },
         {
           "name": "bounded_vec_tests::for_eachi::for_eachi_mapi",
-          "start": 33223
+          "start": 37416
         },
         {
           "name": "bounded_vec_tests::for_eachi::smoke_test",
-          "start": 33490
+          "start": 37683
         },
         {
           "name": "bounded_vec_tests::for_eachi::applies_function_correctly",
-          "start": 33946
+          "start": 38139
         },
         {
           "name": "bounded_vec_tests::for_eachi::applies_function_that_changes_return_type",
-          "start": 34290
+          "start": 38483
         },
         {
           "name": "bounded_vec_tests::for_eachi::does_not_apply_function_past_len",
-          "start": 34658
+          "start": 38851
         },
         {
           "name": "bounded_vec_tests::for_eachi::for_eachi_on_empty_vector",
-          "start": 35045
+          "start": 39238
         },
         {
           "name": "bounded_vec_tests::for_eachi::for_eachi_with_index_tracking",
-          "start": 35338
+          "start": 39531
         },
         {
           "name": "bounded_vec_tests::from_array::empty",
-          "start": 35815
+          "start": 40008
         },
         {
           "name": "bounded_vec_tests::from_array::equal_len",
-          "start": 36125
+          "start": 40318
         },
         {
           "name": "bounded_vec_tests::from_array::max_len_greater_then_array_len",
-          "start": 36442
+          "start": 40635
         },
         {
           "name": "bounded_vec_tests::from_array::max_len_lower_then_array_len",
-          "start": 36913
+          "start": 41106
         },
         {
           "name": "bounded_vec_tests::from_array::from_array_preserves_order",
-          "start": 37056
+          "start": 41249
         },
         {
           "name": "bounded_vec_tests::from_array::from_array_with_different_types",
-          "start": 37345
+          "start": 41538
         },
         {
           "name": "bounded_vec_tests::trait_from::simple",
-          "start": 37782
+          "start": 41975
         },
         {
           "name": "bounded_vec_tests::trait_eq::empty_equality",
-          "start": 38220
+          "start": 42413
         },
         {
           "name": "bounded_vec_tests::trait_eq::equality",
-          "start": 38467
+          "start": 42660
         },
         {
           "name": "bounded_vec_tests::trait_eq::inequality",
-          "start": 38791
+          "start": 42984
         },
         {
           "name": "bounded_vec_tests::from_parts::from_parts",
-          "start": 39330
+          "start": 43523
         },
         {
           "name": "bounded_vec_tests::push_pop::push_and_pop_operations",
-          "start": 40003
+          "start": 44196
         },
         {
           "name": "bounded_vec_tests::push_pop::push_to_full_vector",
-          "start": 40629
+          "start": 44822
         },
         {
           "name": "bounded_vec_tests::push_pop::pop_from_empty_vector",
-          "start": 40903
+          "start": 45096
         },
         {
           "name": "bounded_vec_tests::push_pop::push_pop_cycle",
-          "start": 41072
+          "start": 45265
         },
         {
           "name": "bounded_vec_tests::extend::extend_from_array",
-          "start": 41767
+          "start": 45960
         },
         {
           "name": "bounded_vec_tests::extend::extend_from_vector",
-          "start": 42113
+          "start": 46306
         },
         {
           "name": "bounded_vec_tests::extend::extend_from_bounded_vec",
-          "start": 42507
+          "start": 46700
         },
         {
           "name": "bounded_vec_tests::extend::extend_from_bounded_vec_limit",
-          "start": 43128
+          "start": 47321
         },
         {
           "name": "bounded_vec_tests::extend::extend_from_bounded_vec_full_and_empty",
-          "start": 43642
+          "start": 47835
         },
         {
           "name": "bounded_vec_tests::extend::extend_from_bounded_vec_zero_len",
-          "start": 44146
+          "start": 48339
         },
         {
           "name": "bounded_vec_tests::extend::extend_from_bounded_vec_last_zeroed",
-          "start": 44440
+          "start": 48633
         },
         {
           "name": "bounded_vec_tests::extend::extend_from_bounded_vec_empty_self",
-          "start": 44865
+          "start": 49058
+        },
+        {
+          "name": "bounded_vec_tests::extend::extend_from_bounded_vec_preserves_tail_storage",
+          "start": 49676
         },
         {
           "name": "bounded_vec_tests::extend::extend_from_bounded_vec_equal_capacity",
-          "start": 45432
+          "start": 50280
         },
         {
           "name": "bounded_vec_tests::extend::extend_array_beyond_max_len",
-          "start": 46019
+          "start": 50867
         },
         {
           "name": "bounded_vec_tests::extend::extend_vector_beyond_max_len",
-          "start": 46297
+          "start": 51145
         },
         {
           "name": "bounded_vec_tests::extend::extend_bounded_vec_beyond_max_len",
-          "start": 46600
+          "start": 51448
         },
         {
           "name": "bounded_vec_tests::extend::extend_with_empty_collections",
-          "start": 46886
+          "start": 51734
         },
         {
           "name": "bounded_vec_tests::storage::storage_consistency",
-          "start": 47486
+          "start": 52334
         },
         {
           "name": "bounded_vec_tests::storage::storage_after_pop",
-          "start": 47988
+          "start": 52836
         },
         {
           "name": "bounded_vec_tests::storage::vector_immutable",
-          "start": 48310
+          "start": 53158
         }
       ],
       "path": "std/collections/bounded_vec.nr",
-      "source": "use crate::{cmp::Eq, convert::From, runtime::is_unconstrained, static_assert};\n\n/// A `BoundedVec<T, MaxLen>` is a growable storage similar to a built-in vector except that it\n/// is bounded with a maximum possible length. `BoundedVec` is also not\n/// subject to the same restrictions vectors are (notably, nested vectors are disallowed).\n///\n/// Since a BoundedVec is backed by a normal array under the hood, growing the BoundedVec by\n/// pushing an additional element is also more efficient - the length only needs to be increased\n/// by one.\n///\n/// For these reasons `BoundedVec<T, N>` should generally be preferred over vectors when there\n/// is a reasonable maximum bound that can be placed on the vector.\n///\n/// Example:\n///\n/// ```noir\n/// let mut vector: BoundedVec<Field, 10> = BoundedVec::new();\n/// for i in 0..5 {\n///     vector.push(i);\n/// }\n/// assert(vector.len() == 5);\n/// assert(vector.max_len() == 10);\n/// ```\npub struct BoundedVec<T, let MaxLen: u32> {\n    storage: [T; MaxLen],\n    len: u32,\n}\n\nimpl<T, let MaxLen: u32> BoundedVec<T, MaxLen> {\n    /// Creates a new, empty vector of length zero.\n    ///\n    /// Since this container is backed by an array internally, it still needs an initial value\n    /// to give each element. To resolve this, each element is zeroed internally. This value\n    /// is guaranteed to be inaccessible unless `get_unchecked` is used.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let empty_vector: BoundedVec<Field, 10> = BoundedVec::new();\n    /// assert(empty_vector.len() == 0);\n    /// ```\n    ///\n    /// Note that whenever calling `new` the maximum length of the vector should generally be specified\n    /// via a type signature:\n    ///\n    /// ```noir\n    /// fn good() -> BoundedVec<Field, 10> {\n    ///     // Ok! MaxLen is specified with a type annotation\n    ///     let v1: BoundedVec<Field, 3> = BoundedVec::new();\n    ///     let v2 = BoundedVec::new();\n    ///\n    ///     // Ok! MaxLen is known from the type of `good`'s return value\n    ///     v2\n    /// }\n    ///\n    /// fn bad() {\n    ///     // Error: Type annotation needed\n    ///     // The compiler can't infer `MaxLen` from the following code:\n    ///     let mut v3 = BoundedVec::new();\n    ///     v3.push(5);\n    /// }\n    /// ```\n    pub fn new() -> Self {\n        let zeroed = crate::mem::zeroed();\n        BoundedVec { storage: [zeroed; MaxLen], len: 0 }\n    }\n\n    /// Retrieves an element from the vector at the given index, starting from zero.\n    ///\n    /// If the given index is equal to or greater than the length of the vector, this\n    /// will issue a constraint failure.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn foo<let N: u32>(v: BoundedVec<u32, N>) {\n    ///     let first = v.get(0);\n    ///     let last = v.get(v.len() - 1);\n    ///     assert(first != last);\n    /// }\n    /// ```\n    pub fn get(&self, index: u32) -> T {\n        assert(index < self.len, \"Attempted to read past end of BoundedVec\");\n        self.get_unchecked(index)\n    }\n\n    /// Retrieves an element from the vector at the given index, starting from zero, without\n    /// performing a bounds check.\n    ///\n    /// Since this function does not perform a bounds check on length before accessing the element,\n    /// it is unsafe! Use at your own risk!\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn sum_of_first_three<let N: u32>(v: BoundedVec<u32, N>) -> u32 {\n    ///     // Always ensure the length is larger than the largest\n    ///     // index passed to get_unchecked\n    ///     assert(v.len() > 2);\n    ///     let first = v.get_unchecked(0);\n    ///     let second = v.get_unchecked(1);\n    ///     let third = v.get_unchecked(2);\n    ///     first + second + third\n    /// }\n    /// ```\n    pub fn get_unchecked(&self, index: u32) -> T {\n        self.storage[index]\n    }\n\n    /// Writes an element to the vector at the given index, starting from zero.\n    ///\n    /// If the given index is equal to or greater than the length of the vector, this will issue a constraint failure.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn foo<let N: u32>(v: BoundedVec<u32, N>) {\n    ///     let first = v.get(0);\n    ///     assert(first != 42);\n    ///     v.set(0, 42);\n    ///     let new_first = v.get(0);\n    ///     assert(new_first == 42);\n    /// }\n    /// ```\n    pub fn set(&mut self, index: u32, value: T) {\n        assert(index < self.len, \"Attempted to write past end of BoundedVec\");\n        self.set_unchecked(index, value)\n    }\n\n    /// Writes an element to the vector at the given index, starting from zero, without performing a bounds check.\n    ///\n    /// Since this function does not perform a bounds check on length before accessing the element, it is unsafe! Use at your own risk!\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn set_unchecked_example() {\n    ///     let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n    ///     vec.extend_from_array([1, 2]);\n    ///\n    ///     // Here we're safely writing within the valid range of `vec`\n    ///     // `vec` now has the value [42, 2]\n    ///     vec.set_unchecked(0, 42);\n    ///\n    ///     // We can then safely read this value back out of `vec`.\n    ///     // Notice that we use the checked version of `get` which would prevent reading unsafe values.\n    ///     assert_eq(vec.get(0), 42);\n    ///\n    ///     // We've now written past the end of `vec`.\n    ///     // As this index is still within the maximum potential length of `v`,\n    ///     // it won't cause a constraint failure.\n    ///     vec.set_unchecked(2, 42);\n    ///     println(vec);\n    ///\n    ///     // This will write past the end of the maximum potential length of `vec`,\n    ///     // it will then trigger a constraint failure.\n    ///     vec.set_unchecked(5, 42);\n    ///     println(vec);\n    /// }\n    /// ```\n    pub fn set_unchecked(&mut self, index: u32, value: T) {\n        self.storage[index] = value;\n    }\n\n    /// Pushes an element to the end of the vector. This increases the length\n    /// of the vector by one.\n    ///\n    /// Panics if the new length of the vector will be greater than the max length.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 2> = BoundedVec::new();\n    ///\n    /// v.push(1);\n    /// v.push(2);\n    ///\n    /// // Panics with failed assertion \"push out of bounds\"\n    /// v.push(3);\n    /// ```\n    pub fn push(&mut self, elem: T) {\n        assert(self.len < MaxLen, \"push out of bounds\");\n\n        self.storage[self.len] = elem;\n        self.len += 1;\n    }\n\n    /// Returns the current length of this vector\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 4> = BoundedVec::new();\n    /// assert(v.len() == 0);\n    ///\n    /// v.push(100);\n    /// assert(v.len() == 1);\n    ///\n    /// v.push(200);\n    /// v.push(300);\n    /// v.push(400);\n    /// assert(v.len() == 4);\n    ///\n    /// let _ = v.pop();\n    /// let _ = v.pop();\n    /// assert(v.len() == 2);\n    /// ```\n    pub fn len(&self) -> u32 {\n        self.len\n    }\n\n    /// Returns the maximum length of this vector. This is always\n    /// equal to the `MaxLen` parameter this vector was initialized with.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 5> = BoundedVec::new();\n    ///\n    /// assert(v.max_len() == 5);\n    /// v.push(10);\n    /// assert(v.max_len() == 5);\n    /// ```\n    pub fn max_len(_self: &BoundedVec<T, MaxLen>) -> u32 {\n        MaxLen\n    }\n\n    /// Returns the internal array within this vector.\n    ///\n    /// Since arrays in Noir are immutable, mutating the returned storage array will not mutate\n    /// the storage held internally by this vector.\n    ///\n    /// Note that uninitialized elements may be zeroed out!\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 5> = BoundedVec::new();\n    ///\n    /// assert(v.storage() == [0, 0, 0, 0, 0]);\n    ///\n    /// v.push(57);\n    /// assert(v.storage() == [57, 0, 0, 0, 0]);\n    /// ```\n    pub fn storage(self) -> [T; MaxLen] {\n        self.storage\n    }\n\n    /// Pushes each element from the given array to this vector.\n    ///\n    /// Panics if pushing each element would cause the length of this vector\n    /// to exceed the maximum length.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut vec: BoundedVec<Field, 3> = BoundedVec::new();\n    /// vec.extend_from_array([2, 4]);\n    ///\n    /// assert(vec.len == 2);\n    /// assert(vec.get(0) == 2);\n    /// assert(vec.get(1) == 4);\n    /// ```\n    pub fn extend_from_array<let Len: u32>(&mut self, array: [T; Len]) {\n        let new_len = self.len + array.len();\n        assert(new_len <= MaxLen, \"extend_from_array out of bounds\");\n        for i in 0..array.len() {\n            self.storage[self.len + i] = array[i];\n        }\n        self.len = new_len;\n    }\n\n    /// Pushes each element from the given vector to this vector.\n    ///\n    /// Panics if pushing each element would cause the length of this vector\n    /// to exceed the maximum length.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut vec: BoundedVec<Field, 3> = BoundedVec::new();\n    /// vec.extend_from_vector([2, 4].as_vector());\n    ///\n    /// assert(vec.len == 2);\n    /// assert(vec.get(0) == 2);\n    /// assert(vec.get(1) == 4);\n    /// ```\n    pub fn extend_from_vector(&mut self, vector: [T]) {\n        let new_len = self.len + vector.len();\n        assert(new_len <= MaxLen, \"extend_from_vector out of bounds\");\n        for i in 0..vector.len() {\n            self.storage[self.len + i] = vector[i];\n        }\n        self.len = new_len;\n    }\n\n    /// Pushes each element from the other vector to this vector. The length of\n    /// the other vector is left unchanged.\n    ///\n    /// Panics if pushing each element would cause the length of this vector\n    /// to exceed the maximum length.\n    ///\n    /// ```noir\n    /// let mut v1: BoundedVec<Field, 5> = BoundedVec::new();\n    /// let mut v2: BoundedVec<Field, 7> = BoundedVec::new();\n    ///\n    /// v2.extend_from_array([1, 2, 3]);\n    /// v1.extend_from_bounded_vec(v2);\n    ///\n    /// assert(v1.storage() == [1, 2, 3, 0, 0]);\n    /// assert(v2.storage() == [1, 2, 3, 0, 0, 0, 0]);\n    /// ```\n    pub fn extend_from_bounded_vec<let Len: u32>(&mut self, vec: BoundedVec<T, Len>) {\n        let append_len = vec.len();\n        let new_len = self.len + append_len;\n        assert(new_len <= MaxLen, \"extend_from_bounded_vec out of bounds\");\n\n        if is_unconstrained() {\n            for i in 0..append_len {\n                self.storage[self.len + i] = vec.get_unchecked(i);\n            }\n        } else {\n            // The source vector can be longer than the destination, or vice versa;\n            // regardless we will only ever be able to read or write whichever is\n            // the shorter max length of the two. We asserted that the actual content fits,\n            // but the capacity of the source vector could be higher.\n            let max = crate::cmp::min(Len, MaxLen);\n\n            // Save the last item in case we have to do a fixup on an already full array.\n            let last = if MaxLen > 0 {\n                self.storage[MaxLen - 1]\n            } else {\n                crate::mem::zeroed()\n            };\n\n            for src in 0..max {\n                // Since we are iterating to the static capacity of the arrays,\n                // the destination could be out of bounds. If that's the case,\n                // overwrite the last item, which we'll fixup in the end.\n                // NB using cmp::min resulted in more opcodes here.\n                let mut dst = self.len + src;\n                if dst >= MaxLen { dst = MaxLen - 1; };\n                // Assigning the source or zeroed to avoid having to merge arrays in SSA.\n                self.storage[dst] = if src < append_len {\n                    vec.get_unchecked(src)\n                } else {\n                    last\n                }\n            }\n\n            // Fixup the last item if we have to.\n            if MaxLen > 0 {\n                self.storage[MaxLen - 1] = if (self.len + append_len == MaxLen) & (append_len > 0) {\n                    vec.get_unchecked(append_len - 1)\n                } else {\n                    last\n                }\n            }\n        }\n        self.len = new_len;\n    }\n\n    /// Creates a new vector, populating it with values derived from an array input.\n    /// The maximum length of the vector is determined based on the type signature.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from_array([1, 2, 3])\n    /// ```\n    pub fn from_array<let Len: u32>(array: [T; Len]) -> Self {\n        static_assert(Len <= MaxLen, \"from array out of bounds\");\n        let mut vec: BoundedVec<T, MaxLen> = BoundedVec::new();\n        vec.extend_from_array(array);\n        vec\n    }\n\n    /// Pops the element at the end of the vector. This will decrease the length\n    /// of the vector by one.\n    ///\n    /// Panics if the vector is empty.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 2> = BoundedVec::new();\n    /// v.push(1);\n    /// v.push(2);\n    ///\n    /// let two = v.pop();\n    /// let one = v.pop();\n    ///\n    /// assert(two == 2);\n    /// assert(one == 1);\n    ///\n    /// // error: cannot pop from an empty vector\n    /// let _ = v.pop();\n    /// ```\n    pub fn pop(&mut self) -> T {\n        assert(self.len > 0, \"cannot pop from an empty vector\");\n        self.len -= 1;\n        self.storage[self.len]\n    }\n\n    /// Returns true if the given predicate returns true for any element\n    /// in this vector.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<u32, 3> = BoundedVec::new();\n    /// v.extend_from_array([2, 4, 6]);\n    ///\n    /// let all_even = !v.any(|elem: u32| elem % 2 != 0);\n    /// assert(all_even);\n    /// ```\n    pub fn any<Env>(self, predicate: fn[Env](T) -> bool) -> bool {\n        let mut ret = false;\n        if is_unconstrained() {\n            for i in 0..self.len {\n                ret |= predicate(self.storage[i]);\n            }\n        } else {\n            let mut exceeded_len = false;\n            for i in 0..MaxLen {\n                exceeded_len |= i == self.len;\n                if !exceeded_len {\n                    ret |= predicate(self.storage[i]);\n                }\n            }\n        }\n        ret\n    }\n\n    /// Creates a new vector of equal size by calling a closure on each element in this vector.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n    /// let result = vec.map(|value| value * 2);\n    ///\n    /// let expected = BoundedVec::from_array([2, 4, 6, 8]);\n    /// assert_eq(result, expected);\n    /// ```\n    pub fn map<U, Env>(&self, f: fn[Env](T) -> U) -> BoundedVec<U, MaxLen> {\n        let mut ret = BoundedVec::new();\n        ret.len = self.len();\n\n        if is_unconstrained() {\n            for i in 0..self.len() {\n                ret.storage[i] = f(self.get_unchecked(i));\n            }\n        } else {\n            for i in 0..MaxLen {\n                ret.storage[i] = if i < self.len() {\n                    f(self.get_unchecked(i))\n                } else {\n                    crate::mem::zeroed()\n                }\n            }\n        }\n\n        ret\n    }\n\n    /// Creates a new vector of equal size by calling a closure on each element\n    /// in this vector, along with its index.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n    /// let result = vec.mapi(|i, value| i + value * 2);\n    ///\n    /// let expected = BoundedVec::from_array([2, 5, 8, 11]);\n    /// assert_eq(result, expected);\n    /// ```\n    pub fn mapi<U, Env>(&self, f: fn[Env](u32, T) -> U) -> BoundedVec<U, MaxLen> {\n        let mut ret = BoundedVec::new();\n        ret.len = self.len();\n\n        if is_unconstrained() {\n            for i in 0..self.len() {\n                ret.storage[i] = f(i, self.get_unchecked(i));\n            }\n        } else {\n            for i in 0..MaxLen {\n                ret.storage[i] = if i < self.len() {\n                    f(i, self.get_unchecked(i))\n                } else {\n                    crate::mem::zeroed()\n                }\n            }\n        }\n\n        ret\n    }\n\n    /// Calls a closure on each element in this vector.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n    /// let mut result = BoundedVec::<u32, 4>::new();\n    /// vec.for_each(|value| result.push(value * 2));\n    ///\n    /// let expected = BoundedVec::from_array([2, 4, 6, 8]);\n    /// assert_eq(result, expected);\n    /// ```\n    pub fn for_each<Env>(&self, f: fn[Env](T) -> ()) {\n        if is_unconstrained() {\n            for i in 0..self.len() {\n                f(self.get_unchecked(i));\n            }\n        } else {\n            for i in 0..MaxLen {\n                if i < self.len() {\n                    f(self.get_unchecked(i));\n                }\n            }\n        }\n    }\n\n    /// Calls a closure on each element in this vector, along with its index.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n    /// let mut result = BoundedVec::<u32, 4>::new();\n    /// vec.for_eachi(|i, value| result.push(i + value * 2));\n    ///\n    /// let expected = BoundedVec::from_array([2, 5, 8, 11]);\n    /// assert_eq(result, expected);\n    /// ```\n    pub fn for_eachi<Env>(&self, f: fn[Env](u32, T) -> ()) {\n        if is_unconstrained() {\n            for i in 0..self.len() {\n                f(i, self.get_unchecked(i));\n            }\n        } else {\n            for i in 0..MaxLen {\n                if i < self.len() {\n                    f(i, self.get_unchecked(i));\n                }\n            }\n        }\n    }\n\n    /// Creates a new BoundedVec from the given array and length.\n    /// The given length must be less than or equal to the length of the array.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 0], 3);\n    /// assert_eq(vec.len(), 3);\n    /// ```\n    pub fn from_parts(mut array: [T; MaxLen], len: u32) -> Self {\n        assert(len <= MaxLen);\n        BoundedVec { storage: array, len }\n    }\n\n    /// Creates a new BoundedVec from the given array and length.\n    /// The given length must be less than or equal to the length of the array.\n    ///\n    /// This function is unsafe because it expects all elements past the `len` index\n    /// of `array` to be zeroed, but does not check for this internally. Use `from_parts`\n    /// for a safe version of this function which does zero out any indices past the\n    /// given length. Invalidating this assumption can notably cause `BoundedVec::eq`\n    /// to give incorrect results since it will check even elements past `len`.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 0], 3);\n    /// assert_eq(vec.len(), 3);\n    ///\n    /// // invalid use!\n    /// let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 1], 3);\n    /// let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 2], 3);\n    ///\n    /// // both vecs have length 3 so we'd expect them to be equal, but this\n    /// // fails because elements past the length are still checked in eq\n    /// assert_eq(vec1, vec2); // fails\n    /// ```\n    #[deprecated(\"`BoundedVec::from_parts` no longer requires an extra loop, `BoundedVec::from_parts_unchecked` is no longer required\")]\n    pub fn from_parts_unchecked(array: [T; MaxLen], len: u32) -> Self {\n        assert(len <= MaxLen);\n        BoundedVec { storage: array, len }\n    }\n}\n\nimpl<T, let MaxLen: u32> Eq for BoundedVec<T, MaxLen>\nwhere\n    T: Eq,\n{\n    fn eq(self, other: BoundedVec<T, MaxLen>) -> bool {\n        if self.len == other.len {\n            if is_unconstrained() {\n                // safety: we are already in an unconstrained context\n                unsafe {\n                    unconstrained_eq(self, other)\n                }\n            } else {\n                let mut eq = true;\n                for i in 0..MaxLen {\n                    if i < self.len {\n                        eq &= self.storage[i] == other.storage[i];\n                    }\n                }\n                eq\n            }\n        } else {\n            false\n        }\n    }\n}\n\n/// Returns true if both BoundedVecs are equal.\n/// Note: This assumes the lengths of both Vecs are already equal!\n/// This function is broken out of `impl Eq for BoundedVec` to make use of `break` in unconstrained code.\nunconstrained fn unconstrained_eq<T, let MaxLen: u32>(\n    a: BoundedVec<T, MaxLen>,\n    b: BoundedVec<T, MaxLen>,\n) -> bool\nwhere\n    T: Eq,\n{\n    let mut eq = true;\n    for i in 0..a.len {\n        if a.storage[i] != b.storage[i] {\n            eq = false;\n            break;\n        }\n    }\n    eq\n}\n\nimpl<T, let MaxLen: u32, let Len: u32> From<[T; Len]> for BoundedVec<T, MaxLen> {\n    fn from(array: [T; Len]) -> BoundedVec<T, MaxLen> {\n        BoundedVec::from_array(array)\n    }\n}\n\nmod bounded_vec_tests {\n\n    mod get {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n        fn panics_when_reading_elements_past_end_of_vec() {\n            let vec: BoundedVec<Field, 5> = BoundedVec::new();\n\n            let _ = vec.get(0);\n        }\n\n        #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n        fn panics_when_reading_beyond_length() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n            let _ = vec.get(3);\n        }\n\n        #[test]\n        fn get_works_within_bounds() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(2), 3);\n            assert_eq(vec.get(4), 5);\n        }\n\n        #[test]\n        fn get_unchecked_works() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n            assert_eq(vec.get_unchecked(0), 1);\n            assert_eq(vec.get_unchecked(2), 3);\n        }\n\n        #[test]\n        fn get_unchecked_works_past_len() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n            assert_eq(vec.get_unchecked(4), 0);\n        }\n    }\n\n    mod set {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn set_updates_values_properly() {\n            let mut vec = BoundedVec::from_array([0, 0, 0, 0, 0]);\n\n            vec.set(0, 42);\n            assert_eq(vec.storage, [42, 0, 0, 0, 0]);\n\n            vec.set(1, 43);\n            assert_eq(vec.storage, [42, 43, 0, 0, 0]);\n\n            vec.set(2, 44);\n            assert_eq(vec.storage, [42, 43, 44, 0, 0]);\n\n            vec.set(1, 10);\n            assert_eq(vec.storage, [42, 10, 44, 0, 0]);\n\n            vec.set(0, 0);\n            assert_eq(vec.storage, [0, 10, 44, 0, 0]);\n        }\n\n        #[test(should_fail_with = \"Attempted to write past end of BoundedVec\")]\n        fn panics_when_writing_elements_past_end_of_vec() {\n            let mut vec: BoundedVec<Field, 5> = BoundedVec::new();\n            vec.set(0, 42);\n        }\n\n        #[test(should_fail_with = \"Attempted to write past end of BoundedVec\")]\n        fn panics_when_setting_beyond_length() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n            vec.set(3, 4);\n        }\n\n        #[test]\n        fn set_unchecked_operations() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.push(2);\n\n            vec.set_unchecked(0, 10);\n            assert_eq(vec.get(0), 10);\n        }\n\n        #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n        fn set_unchecked_operations_past_len() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.push(2);\n\n            vec.set_unchecked(3, 40);\n            assert_eq(vec.get(3), 40);\n        }\n\n        #[test]\n        fn set_preserves_other_elements() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n\n            vec.set(2, 30);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(1), 2);\n            assert_eq(vec.get(2), 30);\n            assert_eq(vec.get(3), 4);\n            assert_eq(vec.get(4), 5);\n        }\n    }\n\n    mod any {\n        use crate::collections::bounded_vec::BoundedVec;\n        use crate::internal::test_unconstrained;\n\n        #[test]\n        #[test_unconstrained]\n        fn returns_false_if_predicate_not_satisfied() {\n            let vec: BoundedVec<bool, 4> = BoundedVec::from_array([false, false, false, false]);\n            let result = vec.any(|value| value);\n\n            assert(!result);\n        }\n\n        #[test]\n        #[test_unconstrained]\n        fn returns_true_if_predicate_satisfied() {\n            let vec: BoundedVec<bool, 4> = BoundedVec::from_array([false, false, true, true]);\n            let result = vec.any(|value| value);\n\n            assert(result);\n        }\n\n        #[test]\n        fn returns_false_on_empty_boundedvec() {\n            let vec: BoundedVec<bool, 0> = BoundedVec::new();\n            let result = vec.any(|value| value);\n\n            assert(!result);\n        }\n\n        #[test]\n        #[test_unconstrained]\n        fn any_with_complex_predicates() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n\n            assert(vec.any(|x| x > 3));\n            assert(!vec.any(|x| x > 10));\n            assert(vec.any(|x| x % 2 == 0)); // has a even number\n            assert(vec.any(|x| x == 3)); // has a specific value\n        }\n\n        #[test]\n        fn any_with_partial_vector() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.push(2);\n\n            assert(vec.any(|x| x == 1));\n            assert(vec.any(|x| x == 2));\n            assert(!vec.any(|x| x == 3));\n        }\n    }\n\n    mod map {\n        use crate::collections::bounded_vec::BoundedVec;\n        use crate::internal::test_unconstrained;\n\n        #[test]\n        #[test_unconstrained]\n        fn applies_function_correctly() {\n            // docs:start:bounded-vec-map-example\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.map(|value| value * 2);\n            // docs:end:bounded-vec-map-example\n            let expected = BoundedVec::from_array([2, 4, 6, 8]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn applies_function_that_changes_return_type() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.map(|value| (value * 2) as Field);\n            let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 4, 6, 8]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn does_not_apply_function_past_len() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n            let result = vec.map(|value| if value == 0 { 5 } else { value });\n            let expected = BoundedVec::from_array([5, 1]);\n\n            assert_eq(result, expected);\n            assert_eq(result.get_unchecked(2), 0);\n        }\n\n        #[test]\n        fn map_with_conditional_logic() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n\n            let result = vec.map(|x| if x % 2 == 0 { x * 2 } else { x });\n            let expected = BoundedVec::from_array([1, 4, 3, 8]);\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn map_preserves_length() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.map(|x| x * 2);\n\n            assert_eq(result.len(), vec.len());\n            assert_eq(result.max_len(), vec.max_len());\n        }\n\n        #[test]\n        fn map_on_empty_vector() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let result = vec.map(|x| x * 2);\n            assert_eq(result, vec);\n            assert_eq(result.len(), 0);\n            assert_eq(result.max_len(), 5);\n        }\n    }\n\n    mod mapi {\n        use crate::collections::bounded_vec::BoundedVec;\n        use crate::internal::test_unconstrained;\n\n        #[test]\n        #[test_unconstrained]\n        fn applies_function_correctly() {\n            // docs:start:bounded-vec-mapi-example\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.mapi(|i, value| i + value * 2);\n            // docs:end:bounded-vec-mapi-example\n            let expected = BoundedVec::from_array([2, 5, 8, 11]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn applies_function_that_changes_return_type() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.mapi(|i, value| (i + value * 2) as Field);\n            let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 5, 8, 11]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn does_not_apply_function_past_len() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n            let result = vec.mapi(|_, value| if value == 0 { 5 } else { value });\n            let expected = BoundedVec::from_array([5, 1]);\n\n            assert_eq(result, expected);\n            assert_eq(result.get_unchecked(2), 0);\n        }\n\n        #[test]\n        fn mapi_with_index_branching_logic() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n\n            let result = vec.mapi(|i, x| if i % 2 == 0 { x * 2 } else { x });\n            let expected = BoundedVec::from_array([2, 2, 6, 4]);\n            assert_eq(result, expected);\n        }\n    }\n\n    mod for_each {\n        use crate::collections::bounded_vec::BoundedVec;\n        use crate::internal::test_unconstrained;\n\n        // map in terms of for_each\n        fn for_each_map<T, U, Env, let MaxLen: u32>(\n            input: BoundedVec<T, MaxLen>,\n            f: fn[Env](T) -> U,\n        ) -> BoundedVec<U, MaxLen> {\n            let mut output = BoundedVec::<U, MaxLen>::new();\n            let output_ref = &mut output;\n            input.for_each(|x| output_ref.push(f(x)));\n            output\n        }\n\n        #[test]\n        #[test_unconstrained]\n        fn smoke_test() {\n            let mut acc = 0;\n            let acc_ref = &mut acc;\n            // docs:start:bounded-vec-for-each-example\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n            vec.for_each(|value| { *acc_ref += value; });\n            // docs:end:bounded-vec-for-each-example\n            assert_eq(acc, 6);\n        }\n\n        #[test]\n        fn applies_function_correctly() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = for_each_map(vec, |value| value * 2);\n            let expected = BoundedVec::from_array([2, 4, 6, 8]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn applies_function_that_changes_return_type() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = for_each_map(vec, |value| (value * 2) as Field);\n            let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 4, 6, 8]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn does_not_apply_function_past_len() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n            let result = for_each_map(vec, |value| if value == 0 { 5 } else { value });\n            let expected = BoundedVec::from_array([5, 1]);\n\n            assert_eq(result, expected);\n            assert_eq(result.get_unchecked(2), 0);\n        }\n\n        #[test]\n        fn for_each_on_empty_vector() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let mut count = 0;\n            let count_ref = &mut count;\n            vec.for_each(|_| { *count_ref += 1; });\n            assert_eq(count, 0);\n        }\n\n        #[test]\n        fn for_each_with_side_effects() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n            let mut seen = BoundedVec::<u32, 3>::new();\n            let seen_ref = &mut seen;\n            vec.for_each(|x| seen_ref.push(x));\n            assert_eq(seen, vec);\n        }\n    }\n\n    mod for_eachi {\n        use crate::collections::bounded_vec::BoundedVec;\n        use crate::internal::test_unconstrained;\n\n        // mapi in terms of for_eachi\n        fn for_eachi_mapi<T, U, Env, let MaxLen: u32>(\n            input: BoundedVec<T, MaxLen>,\n            f: fn[Env](u32, T) -> U,\n        ) -> BoundedVec<U, MaxLen> {\n            let mut output = BoundedVec::<U, MaxLen>::new();\n            let output_ref = &mut output;\n            input.for_eachi(|i, x| output_ref.push(f(i, x)));\n            output\n        }\n\n        #[test]\n        #[test_unconstrained]\n        fn smoke_test() {\n            let mut acc = 0;\n            let acc_ref = &mut acc;\n            // docs:start:bounded-vec-for-eachi-example\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n            vec.for_eachi(|i, value| { *acc_ref += i * value; });\n            // docs:end:bounded-vec-for-eachi-example\n\n            // 0 * 1 + 1 * 2 + 2 * 3\n            assert_eq(acc, 8);\n        }\n\n        #[test]\n        fn applies_function_correctly() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = for_eachi_mapi(vec, |i, value| i + value * 2);\n            let expected = BoundedVec::from_array([2, 5, 8, 11]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn applies_function_that_changes_return_type() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = for_eachi_mapi(vec, |i, value| (i + value * 2) as Field);\n            let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 5, 8, 11]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn does_not_apply_function_past_len() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n            let result = for_eachi_mapi(vec, |_, value| if value == 0 { 5 } else { value });\n            let expected = BoundedVec::from_array([5, 1]);\n\n            assert_eq(result, expected);\n            assert_eq(result.get_unchecked(2), 0);\n        }\n\n        #[test]\n        fn for_eachi_on_empty_vector() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let mut count = 0;\n            let count_ref = &mut count;\n            vec.for_eachi(|_, _| { *count_ref += 1; });\n            assert_eq(count, 0);\n        }\n\n        #[test]\n        fn for_eachi_with_index_tracking() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([10, 20, 30]);\n            let mut indices = BoundedVec::<u32, 3>::new();\n            let indices_ref = &mut indices;\n            vec.for_eachi(|i, _| indices_ref.push(i));\n\n            let expected = BoundedVec::from_array([0, 1, 2]);\n            assert_eq(indices, expected);\n        }\n\n    }\n\n    mod from_array {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn empty() {\n            let empty_array: [Field; 0] = [];\n            let bounded_vec = BoundedVec::from_array([]);\n\n            assert_eq(bounded_vec.max_len(), 0);\n            assert_eq(bounded_vec.len(), 0);\n            assert_eq(bounded_vec.storage(), empty_array);\n        }\n\n        #[test]\n        fn equal_len() {\n            let array = [1, 2, 3];\n            let bounded_vec = BoundedVec::from_array(array);\n\n            assert_eq(bounded_vec.max_len(), 3);\n            assert_eq(bounded_vec.len(), 3);\n            assert_eq(bounded_vec.storage(), array);\n        }\n\n        #[test]\n        fn max_len_greater_then_array_len() {\n            let array = [1, 2, 3];\n            let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from_array(array);\n\n            assert_eq(bounded_vec.max_len(), 10);\n            assert_eq(bounded_vec.len(), 3);\n            assert_eq(bounded_vec.get(0), 1);\n            assert_eq(bounded_vec.get(1), 2);\n            assert_eq(bounded_vec.get(2), 3);\n        }\n\n        #[test(should_fail_with = \"from array out of bounds\")]\n        fn max_len_lower_then_array_len() {\n            let _: BoundedVec<Field, 2> = BoundedVec::from_array([0; 3]);\n        }\n\n        #[test]\n        fn from_array_preserves_order() {\n            let array = [5, 3, 1, 4, 2];\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array(array);\n            for i in 0..array.len() {\n                assert_eq(vec.get(i), array[i]);\n            }\n        }\n\n        #[test]\n        fn from_array_with_different_types() {\n            let bool_array = [true, false, true];\n            let bool_vec: BoundedVec<bool, 3> = BoundedVec::from_array(bool_array);\n            assert_eq(bool_vec.len(), 3);\n            assert_eq(bool_vec.get(0), true);\n            assert_eq(bool_vec.get(1), false);\n        }\n    }\n\n    mod trait_from {\n        use crate::collections::bounded_vec::BoundedVec;\n        use crate::convert::From;\n\n        #[test]\n        fn simple() {\n            let array = [1, 2];\n            let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from(array);\n\n            assert_eq(bounded_vec.max_len(), 10);\n            assert_eq(bounded_vec.len(), 2);\n            assert_eq(bounded_vec.get(0), 1);\n            assert_eq(bounded_vec.get(1), 2);\n        }\n    }\n\n    mod trait_eq {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn empty_equality() {\n            let bounded_vec1: BoundedVec<Field, 3> = BoundedVec::new();\n            let bounded_vec2: BoundedVec<Field, 3> = BoundedVec::new();\n\n            assert_eq(bounded_vec1, bounded_vec2);\n        }\n\n        #[test]\n        fn equality() {\n            let mut bounded_vec1: BoundedVec<Field, 3> = BoundedVec::new();\n            let mut bounded_vec2: BoundedVec<Field, 3> = BoundedVec::new();\n\n            bounded_vec1.push(1);\n            bounded_vec2.push(1);\n            assert(bounded_vec1 == bounded_vec2);\n        }\n\n        #[test]\n        fn inequality() {\n            let mut bounded_vec1: BoundedVec<Field, 3> = BoundedVec::new();\n            let mut bounded_vec2: BoundedVec<Field, 3> = BoundedVec::new();\n\n            bounded_vec1.push(1);\n            assert(bounded_vec1 != bounded_vec2);\n\n            bounded_vec2.push(2);\n            assert(bounded_vec1 != bounded_vec2);\n        }\n    }\n\n    mod from_parts {\n        use crate::collections::bounded_vec::BoundedVec;\n        use crate::internal::test_unconstrained;\n\n        #[test]\n        #[test_unconstrained]\n        fn from_parts() {\n            // docs:start:from-parts\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 0], 3);\n            assert_eq(vec.len(), 3);\n\n            // Any elements past the given length are ignored, so these\n            // two BoundedVecs will be completely equal\n            let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 1], 3);\n            let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 2], 3);\n            assert_eq(vec1, vec2);\n            // docs:end:from-parts\n        }\n    }\n\n    mod push_pop {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn push_and_pop_operations() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n\n            assert_eq(vec.len(), 0);\n\n            vec.push(1);\n            assert_eq(vec.len(), 1);\n            assert_eq(vec.get(0), 1);\n\n            vec.push(2);\n            assert_eq(vec.len(), 2);\n            assert_eq(vec.get(1), 2);\n\n            let popped = vec.pop();\n            assert_eq(popped, 2);\n            assert_eq(vec.len(), 1);\n\n            let popped2 = vec.pop();\n            assert_eq(popped2, 1);\n            assert_eq(vec.len(), 0);\n        }\n\n        #[test(should_fail_with = \"push out of bounds\")]\n        fn push_to_full_vector() {\n            let mut vec: BoundedVec<u32, 2> = BoundedVec::new();\n            vec.push(1);\n            vec.push(2);\n            vec.push(3); // should panic\n        }\n\n        #[test(should_fail_with = \"cannot pop from an empty vector\")]\n        fn pop_from_empty_vector() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let _ = vec.pop(); // should panic\n        }\n\n        #[test]\n        fn push_pop_cycle() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n\n            // push to full\n            vec.push(1);\n            vec.push(2);\n            vec.push(3);\n            assert_eq(vec.len(), 3);\n\n            // pop all\n            assert_eq(vec.pop(), 3);\n            assert_eq(vec.pop(), 2);\n            assert_eq(vec.pop(), 1);\n            assert_eq(vec.len(), 0);\n\n            // push again\n            vec.push(4);\n            assert_eq(vec.len(), 1);\n            assert_eq(vec.get(0), 4);\n        }\n    }\n\n    mod extend {\n        use crate::collections::bounded_vec::BoundedVec;\n        use crate::internal::test_unconstrained;\n\n        #[test]\n        fn extend_from_array() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.extend_from_array([2, 3]);\n\n            assert_eq(vec.len(), 3);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(1), 2);\n            assert_eq(vec.get(2), 3);\n        }\n\n        #[test]\n        fn extend_from_vector() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.extend_from_vector([2, 3].as_vector());\n\n            assert_eq(vec.len(), 3);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(1), 2);\n            assert_eq(vec.get(2), 3);\n        }\n\n        #[test]\n        #[test_unconstrained]\n        fn extend_from_bounded_vec() {\n            // The source deliberately has a higher capacity,\n            // to make sure we are not trying to assign out-of-bounds.\n            let mut vec1: BoundedVec<u32, 5> = BoundedVec::new();\n            let mut vec2: BoundedVec<u32, 9> = BoundedVec::new();\n\n            vec1.push(1);\n            vec2.push(2);\n            vec2.push(3);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 3);\n            assert_eq(vec1.get(0), 1);\n            assert_eq(vec1.get(1), 2);\n            assert_eq(vec1.get(2), 3);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_limit() {\n            // Capacity and contents chosen so the last item must be assigned to.\n            let mut vec1: BoundedVec<u32, 2> = BoundedVec::new();\n            let mut vec2: BoundedVec<u32, 5> = BoundedVec::new();\n\n            vec1.push(1);\n            vec2.push(2);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 2);\n            assert_eq(vec1.get(0), 1);\n            assert_eq(vec1.get(1), 2);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_full_and_empty() {\n            // Capacity and contents chosen so the last item must be assigned to.\n            let mut vec1: BoundedVec<u32, 2> = BoundedVec::new();\n            let vec2: BoundedVec<u32, 5> = BoundedVec::new();\n\n            vec1.push(1);\n            vec1.push(2);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 2);\n            assert_eq(vec1.get(0), 1);\n            assert_eq(vec1.get(1), 2);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_zero_len() {\n            let mut vec1: BoundedVec<u32, 0> = BoundedVec::new();\n            let vec2: BoundedVec<u32, 0> = BoundedVec::new();\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 0);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_last_zeroed() {\n            let mut vec1: BoundedVec<u32, 4> = BoundedVec::new();\n            let mut vec2: BoundedVec<u32, 4> = BoundedVec::new();\n\n            vec1.push(1);\n            vec1.push(2);\n            vec2.push(3);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 3);\n            assert_eq(vec1.get_unchecked(3), 0);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_empty_self() {\n            // self.len == 0 with Len > MaxLen: the loop doesn't reach\n            // the last storage slot, so the fixup must write it.\n            let mut vec1: BoundedVec<u32, 3> = BoundedVec::new();\n            let vec2: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 3);\n            assert_eq(vec1.get(0), 1);\n            assert_eq(vec1.get(1), 2);\n            assert_eq(vec1.get(2), 3);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_equal_capacity() {\n            // Len == MaxLen, fills to capacity.\n            let mut vec1: BoundedVec<u32, 4> = BoundedVec::new();\n            vec1.push(1);\n            let vec2: BoundedVec<u32, 4> = BoundedVec::from_array([2, 3, 4]);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 4);\n            assert_eq(vec1.get(0), 1);\n            assert_eq(vec1.get(1), 2);\n            assert_eq(vec1.get(2), 3);\n            assert_eq(vec1.get(3), 4);\n        }\n\n        #[test(should_fail_with = \"extend_from_array out of bounds\")]\n        fn extend_array_beyond_max_len() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n            vec.push(1);\n            vec.extend_from_array([2, 3, 4]); // should panic\n        }\n\n        #[test(should_fail_with = \"extend_from_vector out of bounds\")]\n        fn extend_vector_beyond_max_len() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n            vec.push(1);\n            vec.extend_from_vector([2, 3, 4].as_vector()); // S]should panic\n        }\n\n        #[test(should_fail_with = \"extend_from_bounded_vec out of bounds\")]\n        fn extend_bounded_vec_beyond_max_len() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n            let other: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n            vec.extend_from_bounded_vec(other); // should panic\n        }\n\n        #[test]\n        fn extend_with_empty_collections() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let original_len = vec.len();\n\n            vec.extend_from_array([]);\n            assert_eq(vec.len(), original_len);\n\n            vec.extend_from_vector([].as_vector());\n            assert_eq(vec.len(), original_len);\n\n            let empty: BoundedVec<u32, 3> = BoundedVec::new();\n            vec.extend_from_bounded_vec(empty);\n            assert_eq(vec.len(), original_len);\n        }\n    }\n\n    mod storage {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn storage_consistency() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n\n            // test initial storage state\n            assert_eq(vec.storage(), [0, 0, 0, 0, 0]);\n\n            vec.push(1);\n            vec.push(2);\n\n            // test storage after modifications\n            assert_eq(vec.storage(), [1, 2, 0, 0, 0]);\n\n            // storage doesn't change length\n            assert_eq(vec.len(), 2);\n            assert_eq(vec.max_len(), 5);\n        }\n\n        #[test]\n        fn storage_after_pop() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n\n            let _ = vec.pop();\n            // after pop, the last element should be unmodified\n            assert_eq(vec.storage(), [1, 2, 3]);\n            assert_eq(vec.len(), 2);\n        }\n\n        #[test]\n        fn vector_immutable() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n            let storage = vec.storage();\n\n            assert_eq(storage, [1, 2, 3]);\n\n            // Verify that the original vector is unchanged\n            assert_eq(vec.len(), 3);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(1), 2);\n            assert_eq(vec.get(2), 3);\n        }\n    }\n}\n"
+      "source": "use crate::{cmp::Eq, convert::From, runtime::is_unconstrained, static_assert};\n\n/// A `BoundedVec<T, MaxLen>` is a growable storage similar to a built-in vector except that it\n/// is bounded with a maximum possible length. `BoundedVec` is also not\n/// subject to the same restrictions vectors are (notably, nested vectors are disallowed).\n///\n/// Since a BoundedVec is backed by a normal array under the hood, growing the BoundedVec by\n/// pushing an additional element is also more efficient - the length only needs to be increased\n/// by one.\n///\n/// For these reasons `BoundedVec<T, N>` should generally be preferred over vectors when there\n/// is a reasonable maximum bound that can be placed on the vector.\n///\n/// Example:\n///\n/// ```noir\n/// let mut vector: BoundedVec<Field, 10> = BoundedVec::new();\n/// for i in 0..5 {\n///     vector.push(i);\n/// }\n/// assert(vector.len() == 5);\n/// assert(vector.max_len() == 10);\n/// ```\npub struct BoundedVec<T, let MaxLen: u32> {\n    storage: [T; MaxLen],\n    len: u32,\n}\n\nimpl<T, let MaxLen: u32> BoundedVec<T, MaxLen> {\n    /// Creates a new, empty vector of length zero.\n    ///\n    /// Since this container is backed by an array internally, it still needs an initial value\n    /// to give each element. To resolve this, each element is zeroed internally. This value\n    /// is guaranteed to be inaccessible unless `get_unchecked` is used.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let empty_vector: BoundedVec<Field, 10> = BoundedVec::new();\n    /// assert(empty_vector.len() == 0);\n    /// ```\n    ///\n    /// Note that whenever calling `new` the maximum length of the vector should generally be specified\n    /// via a type signature:\n    ///\n    /// ```noir\n    /// fn good() -> BoundedVec<Field, 10> {\n    ///     // Ok! MaxLen is specified with a type annotation\n    ///     let v1: BoundedVec<Field, 3> = BoundedVec::new();\n    ///     let v2 = BoundedVec::new();\n    ///\n    ///     // Ok! MaxLen is known from the type of `good`'s return value\n    ///     v2\n    /// }\n    ///\n    /// fn bad() {\n    ///     // Error: Type annotation needed\n    ///     // The compiler can't infer `MaxLen` from the following code:\n    ///     let mut v3 = BoundedVec::new();\n    ///     v3.push(5);\n    /// }\n    /// ```\n    pub fn new() -> Self {\n        let zeroed = crate::mem::zeroed();\n        BoundedVec { storage: [zeroed; MaxLen], len: 0 }\n    }\n\n    /// Retrieves an element from the vector at the given index, starting from zero.\n    ///\n    /// If the given index is equal to or greater than the length of the vector, this\n    /// will issue a constraint failure.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn foo<let N: u32>(v: BoundedVec<u32, N>) {\n    ///     let first = v.get(0);\n    ///     let last = v.get(v.len() - 1);\n    ///     assert(first != last);\n    /// }\n    /// ```\n    pub fn get(&self, index: u32) -> T {\n        assert(index < self.len, \"Attempted to read past end of BoundedVec\");\n        self.get_unchecked(index)\n    }\n\n    /// Retrieves an element from the vector at the given index, starting from zero, without\n    /// performing a bounds check.\n    ///\n    /// Since this function does not perform a bounds check on length before accessing the element,\n    /// it is unsafe! Use at your own risk!\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn sum_of_first_three<let N: u32>(v: BoundedVec<u32, N>) -> u32 {\n    ///     // Always ensure the length is larger than the largest\n    ///     // index passed to get_unchecked\n    ///     assert(v.len() > 2);\n    ///     let first = v.get_unchecked(0);\n    ///     let second = v.get_unchecked(1);\n    ///     let third = v.get_unchecked(2);\n    ///     first + second + third\n    /// }\n    /// ```\n    pub fn get_unchecked(&self, index: u32) -> T {\n        self.storage[index]\n    }\n\n    /// Writes an element to the vector at the given index, starting from zero.\n    ///\n    /// If the given index is equal to or greater than the length of the vector, this will issue a constraint failure.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn foo<let N: u32>(v: BoundedVec<u32, N>) {\n    ///     let first = v.get(0);\n    ///     assert(first != 42);\n    ///     v.set(0, 42);\n    ///     let new_first = v.get(0);\n    ///     assert(new_first == 42);\n    /// }\n    /// ```\n    pub fn set(&mut self, index: u32, value: T) {\n        assert(index < self.len, \"Attempted to write past end of BoundedVec\");\n        self.set_unchecked(index, value)\n    }\n\n    /// Writes an element to the vector at the given index, starting from zero, without performing a bounds check.\n    ///\n    /// Since this function does not perform a bounds check on length before accessing the element, it is unsafe! Use at your own risk!\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn set_unchecked_example() {\n    ///     let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n    ///     vec.extend_from_array([1, 2]);\n    ///\n    ///     // Here we're safely writing within the valid range of `vec`\n    ///     // `vec` now has the value [42, 2]\n    ///     vec.set_unchecked(0, 42);\n    ///\n    ///     // We can then safely read this value back out of `vec`.\n    ///     // Notice that we use the checked version of `get` which would prevent reading unsafe values.\n    ///     assert_eq(vec.get(0), 42);\n    ///\n    ///     // We've now written past the end of `vec`.\n    ///     // As this index is still within the maximum potential length of `v`,\n    ///     // it won't cause a constraint failure.\n    ///     vec.set_unchecked(2, 42);\n    ///     println(vec);\n    ///\n    ///     // This will write past the end of the maximum potential length of `vec`,\n    ///     // it will then trigger a constraint failure.\n    ///     vec.set_unchecked(5, 42);\n    ///     println(vec);\n    /// }\n    /// ```\n    pub fn set_unchecked(&mut self, index: u32, value: T) {\n        self.storage[index] = value;\n    }\n\n    /// Pushes an element to the end of the vector. This increases the length\n    /// of the vector by one.\n    ///\n    /// Panics if the new length of the vector will be greater than the max length.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 2> = BoundedVec::new();\n    ///\n    /// v.push(1);\n    /// v.push(2);\n    ///\n    /// // Panics with failed assertion \"push out of bounds\"\n    /// v.push(3);\n    /// ```\n    pub fn push(&mut self, elem: T) {\n        assert(self.len < MaxLen, \"push out of bounds\");\n\n        self.storage[self.len] = elem;\n        self.len += 1;\n    }\n\n    /// Returns the current length of this vector\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 4> = BoundedVec::new();\n    /// assert(v.len() == 0);\n    ///\n    /// v.push(100);\n    /// assert(v.len() == 1);\n    ///\n    /// v.push(200);\n    /// v.push(300);\n    /// v.push(400);\n    /// assert(v.len() == 4);\n    ///\n    /// let _ = v.pop();\n    /// let _ = v.pop();\n    /// assert(v.len() == 2);\n    /// ```\n    pub fn len(&self) -> u32 {\n        self.len\n    }\n\n    /// Sets the length of the vector to any value between `0` and `MaxLen`.\n    ///\n    /// Increasing the length exposes elements that were written past the current\n    /// length (e.g. with `set_unchecked`); decreasing it discards trailing\n    /// elements. Note that this does not zero out any element of the backing storage,\n    /// so elements beyond the new length remain readable through `storage`.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 10> = BoundedVec::from([1, 2, 3, 4, 5]);\n    ///\n    /// assert(v.len() == 5);\n    /// v.set_unchecked(5, 6);\n    /// v.set_unchecked(6, 7);\n    /// v.set_unchecked(7, 8);\n    /// v.set_len(8);\n    /// assert(v.len() == 8);\n    ///\n    /// // The length can also be reduced.\n    /// v.set_len(2);\n    /// assert(v.len() == 2);\n    /// ```\n    pub fn set_len(&mut self, len: u32) {\n        assert(len <= MaxLen, \"set_len out of bounds\");\n        self.len = len;\n    }\n\n    /// Shortens the vector to `len`, keeping the first `len` elements.\n    ///\n    /// If `len` is greater than or equal to the current length, the vector is\n    /// left unchanged. Regardless of the current length, after this call the\n    /// vector is guaranteed to hold no more than `len` elements.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 10> = BoundedVec::from([1, 2, 3, 4, 5]);\n    ///\n    /// v.truncate(3);\n    /// assert(v.len() == 3);\n    ///\n    /// // Truncating to a length greater than the current length is a no-op.\n    /// v.truncate(8);\n    /// assert(v.len() == 3);\n    /// ```\n    pub fn truncate(&mut self, len: u32) {\n        if len < self.len() {\n            self.len = len;\n        }\n    }\n\n    /// Returns the maximum length of this vector. This is always\n    /// equal to the `MaxLen` parameter this vector was initialized with.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 5> = BoundedVec::new();\n    ///\n    /// assert(v.max_len() == 5);\n    /// v.push(10);\n    /// assert(v.max_len() == 5);\n    /// ```\n    pub fn max_len(_self: &BoundedVec<T, MaxLen>) -> u32 {\n        MaxLen\n    }\n\n    /// Returns the internal array within this vector.\n    ///\n    /// Since arrays in Noir are immutable, mutating the returned storage array will not mutate\n    /// the storage held internally by this vector.\n    ///\n    /// Note that uninitialized elements may be zeroed out!\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 5> = BoundedVec::new();\n    ///\n    /// assert(v.storage() == [0, 0, 0, 0, 0]);\n    ///\n    /// v.push(57);\n    /// assert(v.storage() == [57, 0, 0, 0, 0]);\n    /// ```\n    pub fn storage(self) -> [T; MaxLen] {\n        self.storage\n    }\n\n    /// Pushes each element from the given array to this vector.\n    ///\n    /// Panics if pushing each element would cause the length of this vector\n    /// to exceed the maximum length.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut vec: BoundedVec<Field, 3> = BoundedVec::new();\n    /// vec.extend_from_array([2, 4]);\n    ///\n    /// assert(vec.len == 2);\n    /// assert(vec.get(0) == 2);\n    /// assert(vec.get(1) == 4);\n    /// ```\n    pub fn extend_from_array<let Len: u32>(&mut self, array: [T; Len]) {\n        let new_len = self.len + array.len();\n        assert(new_len <= MaxLen, \"extend_from_array out of bounds\");\n        for i in 0..array.len() {\n            self.storage[self.len + i] = array[i];\n        }\n        self.len = new_len;\n    }\n\n    /// Pushes each element from the given vector to this vector.\n    ///\n    /// Panics if pushing each element would cause the length of this vector\n    /// to exceed the maximum length.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut vec: BoundedVec<Field, 3> = BoundedVec::new();\n    /// vec.extend_from_vector([2, 4].as_vector());\n    ///\n    /// assert(vec.len == 2);\n    /// assert(vec.get(0) == 2);\n    /// assert(vec.get(1) == 4);\n    /// ```\n    pub fn extend_from_vector(&mut self, vector: [T]) {\n        let new_len = self.len + vector.len();\n        assert(new_len <= MaxLen, \"extend_from_vector out of bounds\");\n        for i in 0..vector.len() {\n            self.storage[self.len + i] = vector[i];\n        }\n        self.len = new_len;\n    }\n\n    /// Pushes each element from the other vector to this vector. The length of\n    /// the other vector is left unchanged.\n    ///\n    /// Panics if pushing each element would cause the length of this vector\n    /// to exceed the maximum length.\n    ///\n    /// ```noir\n    /// let mut v1: BoundedVec<Field, 5> = BoundedVec::new();\n    /// let mut v2: BoundedVec<Field, 7> = BoundedVec::new();\n    ///\n    /// v2.extend_from_array([1, 2, 3]);\n    /// v1.extend_from_bounded_vec(v2);\n    ///\n    /// assert(v1.storage() == [1, 2, 3, 0, 0]);\n    /// assert(v2.storage() == [1, 2, 3, 0, 0, 0, 0]);\n    /// ```\n    pub fn extend_from_bounded_vec<let Len: u32>(&mut self, vec: BoundedVec<T, Len>) {\n        let append_len = vec.len();\n        let new_len = self.len + append_len;\n        assert(new_len <= MaxLen, \"extend_from_bounded_vec out of bounds\");\n\n        if is_unconstrained() {\n            for i in 0..append_len {\n                self.storage[self.len + i] = vec.get_unchecked(i);\n            }\n        } else {\n            // Iterate to a static bound: the smaller of the two capacities, since we can\n            // neither read nor write past either. The source's actual length is dynamic.\n            let max = crate::cmp::min(Len, MaxLen);\n            for i in 0..max {\n                if i < append_len {\n                    self.storage[self.len + i] = vec.get_unchecked(i);\n                }\n            }\n        }\n        self.len = new_len;\n    }\n\n    /// Creates a new vector, populating it with values derived from an array input.\n    /// The maximum length of the vector is determined based on the type signature.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from_array([1, 2, 3])\n    /// ```\n    pub fn from_array<let Len: u32>(array: [T; Len]) -> Self {\n        static_assert(Len <= MaxLen, \"from array out of bounds\");\n        let mut vec: BoundedVec<T, MaxLen> = BoundedVec::new();\n        vec.extend_from_array(array);\n        vec\n    }\n\n    /// Pops the element at the end of the vector. This will decrease the length\n    /// of the vector by one.\n    ///\n    /// Panics if the vector is empty.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 2> = BoundedVec::new();\n    /// v.push(1);\n    /// v.push(2);\n    ///\n    /// let two = v.pop();\n    /// let one = v.pop();\n    ///\n    /// assert(two == 2);\n    /// assert(one == 1);\n    ///\n    /// // error: cannot pop from an empty vector\n    /// let _ = v.pop();\n    /// ```\n    pub fn pop(&mut self) -> T {\n        assert(self.len > 0, \"cannot pop from an empty vector\");\n        self.len -= 1;\n        self.storage[self.len]\n    }\n\n    /// Returns true if the given predicate returns true for any element\n    /// in this vector.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<u32, 3> = BoundedVec::new();\n    /// v.extend_from_array([2, 4, 6]);\n    ///\n    /// let all_even = !v.any(|elem: u32| elem % 2 != 0);\n    /// assert(all_even);\n    /// ```\n    pub fn any<Env>(self, predicate: fn[Env](T) -> bool) -> bool {\n        let mut ret = false;\n        if is_unconstrained() {\n            for i in 0..self.len {\n                ret |= predicate(self.storage[i]);\n            }\n        } else {\n            let mut exceeded_len = false;\n            for i in 0..MaxLen {\n                exceeded_len |= i == self.len;\n                if !exceeded_len {\n                    ret |= predicate(self.storage[i]);\n                }\n            }\n        }\n        ret\n    }\n\n    /// Creates a new vector of equal size by calling a closure on each element in this vector.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n    /// let result = vec.map(|value| value * 2);\n    ///\n    /// let expected = BoundedVec::from_array([2, 4, 6, 8]);\n    /// assert_eq(result, expected);\n    /// ```\n    pub fn map<U, Env>(&self, f: fn[Env](T) -> U) -> BoundedVec<U, MaxLen> {\n        let mut ret = BoundedVec::new();\n        ret.len = self.len();\n\n        if is_unconstrained() {\n            for i in 0..self.len() {\n                ret.storage[i] = f(self.get_unchecked(i));\n            }\n        } else {\n            for i in 0..MaxLen {\n                if i < self.len() {\n                    ret.storage[i] = f(self.get_unchecked(i));\n                }\n            }\n        }\n\n        ret\n    }\n\n    /// Creates a new vector of equal size by calling a closure on each element\n    /// in this vector, along with its index.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n    /// let result = vec.mapi(|i, value| i + value * 2);\n    ///\n    /// let expected = BoundedVec::from_array([2, 5, 8, 11]);\n    /// assert_eq(result, expected);\n    /// ```\n    pub fn mapi<U, Env>(&self, f: fn[Env](u32, T) -> U) -> BoundedVec<U, MaxLen> {\n        let mut ret = BoundedVec::new();\n        ret.len = self.len();\n\n        if is_unconstrained() {\n            for i in 0..self.len() {\n                ret.storage[i] = f(i, self.get_unchecked(i));\n            }\n        } else {\n            for i in 0..MaxLen {\n                if i < self.len() {\n                    ret.storage[i] = f(i, self.get_unchecked(i));\n                }\n            }\n        }\n\n        ret\n    }\n\n    /// Calls a closure on each element in this vector.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n    /// let mut result = BoundedVec::<u32, 4>::new();\n    /// vec.for_each(|value| result.push(value * 2));\n    ///\n    /// let expected = BoundedVec::from_array([2, 4, 6, 8]);\n    /// assert_eq(result, expected);\n    /// ```\n    pub fn for_each<Env>(&self, f: fn[Env](T) -> ()) {\n        if is_unconstrained() {\n            for i in 0..self.len() {\n                f(self.get_unchecked(i));\n            }\n        } else {\n            for i in 0..MaxLen {\n                if i < self.len() {\n                    f(self.get_unchecked(i));\n                }\n            }\n        }\n    }\n\n    /// Calls a closure on each element in this vector, along with its index.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n    /// let mut result = BoundedVec::<u32, 4>::new();\n    /// vec.for_eachi(|i, value| result.push(i + value * 2));\n    ///\n    /// let expected = BoundedVec::from_array([2, 5, 8, 11]);\n    /// assert_eq(result, expected);\n    /// ```\n    pub fn for_eachi<Env>(&self, f: fn[Env](u32, T) -> ()) {\n        if is_unconstrained() {\n            for i in 0..self.len() {\n                f(i, self.get_unchecked(i));\n            }\n        } else {\n            for i in 0..MaxLen {\n                if i < self.len() {\n                    f(i, self.get_unchecked(i));\n                }\n            }\n        }\n    }\n\n    /// Creates a new BoundedVec from the given array and length.\n    /// The given length must be less than or equal to the length of the array.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 0], 3);\n    /// assert_eq(vec.len(), 3);\n    /// ```\n    pub fn from_parts(mut array: [T; MaxLen], len: u32) -> Self {\n        assert(len <= MaxLen);\n        BoundedVec { storage: array, len }\n    }\n\n    /// Creates a new BoundedVec from the given array and length.\n    /// The given length must be less than or equal to the length of the array.\n    ///\n    /// This function is unsafe because it expects all elements past the `len` index\n    /// of `array` to be zeroed, but does not check for this internally. Use `from_parts`\n    /// for a safe version of this function which does zero out any indices past the\n    /// given length. Invalidating this assumption can notably cause `BoundedVec::eq`\n    /// to give incorrect results since it will check even elements past `len`.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 0], 3);\n    /// assert_eq(vec.len(), 3);\n    ///\n    /// // invalid use!\n    /// let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 1], 3);\n    /// let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 2], 3);\n    ///\n    /// // both vecs have length 3 so we'd expect them to be equal, but this\n    /// // fails because elements past the length are still checked in eq\n    /// assert_eq(vec1, vec2); // fails\n    /// ```\n    #[deprecated(\"`BoundedVec::from_parts` no longer requires an extra loop, `BoundedVec::from_parts_unchecked` is no longer required\")]\n    pub fn from_parts_unchecked(array: [T; MaxLen], len: u32) -> Self {\n        assert(len <= MaxLen);\n        BoundedVec { storage: array, len }\n    }\n}\n\nimpl<T, let MaxLen: u32> Eq for BoundedVec<T, MaxLen>\nwhere\n    T: Eq,\n{\n    fn eq(self, other: BoundedVec<T, MaxLen>) -> bool {\n        if self.len == other.len {\n            if is_unconstrained() {\n                // safety: we are already in an unconstrained context\n                unsafe {\n                    unconstrained_eq(self, other)\n                }\n            } else {\n                let mut eq = true;\n                for i in 0..MaxLen {\n                    if i < self.len {\n                        eq &= self.storage[i] == other.storage[i];\n                    }\n                }\n                eq\n            }\n        } else {\n            false\n        }\n    }\n}\n\n/// Returns true if both BoundedVecs are equal.\n/// Note: This assumes the lengths of both Vecs are already equal!\n/// This function is broken out of `impl Eq for BoundedVec` to make use of `break` in unconstrained code.\nunconstrained fn unconstrained_eq<T, let MaxLen: u32>(\n    a: BoundedVec<T, MaxLen>,\n    b: BoundedVec<T, MaxLen>,\n) -> bool\nwhere\n    T: Eq,\n{\n    let mut eq = true;\n    for i in 0..a.len {\n        if a.storage[i] != b.storage[i] {\n            eq = false;\n            break;\n        }\n    }\n    eq\n}\n\nimpl<T, let MaxLen: u32, let Len: u32> From<[T; Len]> for BoundedVec<T, MaxLen> {\n    fn from(array: [T; Len]) -> BoundedVec<T, MaxLen> {\n        BoundedVec::from_array(array)\n    }\n}\n\nmod bounded_vec_tests {\n\n    mod get {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n        fn panics_when_reading_elements_past_end_of_vec() {\n            let vec: BoundedVec<Field, 5> = BoundedVec::new();\n\n            let _ = vec.get(0);\n        }\n\n        #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n        fn panics_when_reading_beyond_length() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n            let _ = vec.get(3);\n        }\n\n        #[test]\n        fn get_works_within_bounds() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(2), 3);\n            assert_eq(vec.get(4), 5);\n        }\n\n        #[test]\n        fn get_unchecked_works() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n            assert_eq(vec.get_unchecked(0), 1);\n            assert_eq(vec.get_unchecked(2), 3);\n        }\n\n        #[test]\n        fn get_unchecked_works_past_len() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n            assert_eq(vec.get_unchecked(4), 0);\n        }\n    }\n\n    mod set {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn set_updates_values_properly() {\n            let mut vec = BoundedVec::from_array([0, 0, 0, 0, 0]);\n\n            vec.set(0, 42);\n            assert_eq(vec.storage, [42, 0, 0, 0, 0]);\n\n            vec.set(1, 43);\n            assert_eq(vec.storage, [42, 43, 0, 0, 0]);\n\n            vec.set(2, 44);\n            assert_eq(vec.storage, [42, 43, 44, 0, 0]);\n\n            vec.set(1, 10);\n            assert_eq(vec.storage, [42, 10, 44, 0, 0]);\n\n            vec.set(0, 0);\n            assert_eq(vec.storage, [0, 10, 44, 0, 0]);\n        }\n\n        #[test(should_fail_with = \"Attempted to write past end of BoundedVec\")]\n        fn panics_when_writing_elements_past_end_of_vec() {\n            let mut vec: BoundedVec<Field, 5> = BoundedVec::new();\n            vec.set(0, 42);\n        }\n\n        #[test(should_fail_with = \"Attempted to write past end of BoundedVec\")]\n        fn panics_when_setting_beyond_length() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n            vec.set(3, 4);\n        }\n\n        #[test]\n        fn set_unchecked_operations() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.push(2);\n\n            vec.set_unchecked(0, 10);\n            assert_eq(vec.get(0), 10);\n        }\n\n        #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n        fn set_unchecked_operations_past_len() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.push(2);\n\n            vec.set_unchecked(3, 40);\n            assert_eq(vec.get(3), 40);\n        }\n\n        #[test]\n        fn set_preserves_other_elements() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n\n            vec.set(2, 30);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(1), 2);\n            assert_eq(vec.get(2), 30);\n            assert_eq(vec.get(3), 4);\n            assert_eq(vec.get(4), 5);\n        }\n    }\n\n    mod set_len {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn set_len_works_after_multiple_unchecked_sets() {\n            let mut vec: BoundedVec<u8, 10> = BoundedVec::from_array([1, 2, 3]);\n            vec.set_unchecked(3, 44);\n            vec.set_unchecked(4, 55);\n            vec.set_unchecked(5, 66);\n            // Index 6 is intentionally left untouched: it stays zeroed.\n            vec.set_len(8);\n            assert_eq(vec.len(), 8);\n\n            // The explicitly written elements are exposed at their indices...\n            assert_eq(vec.get(3), 44);\n            assert_eq(vec.get(4), 55);\n            assert_eq(vec.get(5), 66);\n            // ...while the gap between the last write and the new length is zeroed.\n            assert_eq(vec.get(6), 0);\n            assert_eq(vec.get(7), 0);\n\n            vec.extend_from_array([88, 99]);\n            assert_eq(vec.len(), 10);\n        }\n\n        #[test]\n        fn set_len_can_reduce_the_length() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n            vec.set_len(2);\n            assert_eq(vec.len(), 2);\n            // Reducing the length does not zero the backing storage, so the\n            // discarded elements remain readable through `storage`.\n            assert_eq(vec.storage()[2], 3);\n            assert_eq(vec.storage()[3], 4);\n            assert_eq(vec.storage()[4], 5);\n        }\n\n        #[test(should_fail_with = \"set_len out of bounds\")]\n        fn panics_when_set_len_beyond_max_len() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n            vec.set_len(6);\n        }\n    }\n\n    mod truncate {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn truncate_shortens_to_len() {\n            let mut vec: BoundedVec<u32, 10> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n            vec.truncate(3);\n            assert_eq(vec.len(), 3);\n            assert_eq(vec.storage()[0], 1);\n            assert_eq(vec.storage()[1], 2);\n            assert_eq(vec.storage()[2], 3);\n        }\n\n        #[test]\n        fn truncate_to_zero_empties_the_vec() {\n            let mut vec: BoundedVec<u32, 10> = BoundedVec::from_array([1, 2, 3]);\n            vec.truncate(0);\n            assert_eq(vec.len(), 0);\n        }\n\n        #[test]\n        fn truncate_to_equal_len_is_noop() {\n            let mut vec: BoundedVec<u32, 10> = BoundedVec::from_array([1, 2, 3]);\n            vec.truncate(3);\n            assert_eq(vec.len(), 3);\n        }\n\n        #[test]\n        fn truncate_to_greater_len_is_noop() {\n            let mut vec: BoundedVec<u32, 10> = BoundedVec::from_array([1, 2, 3]);\n            vec.truncate(8);\n            assert_eq(vec.len(), 3);\n        }\n\n        #[test]\n        fn truncate_beyond_max_len_is_noop() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n            vec.truncate(100);\n            assert_eq(vec.len(), 3);\n        }\n\n        #[test]\n        fn truncate_does_not_zero_remaining_storage() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n            vec.truncate(2);\n            assert_eq(vec.len(), 2);\n            // Items beyond the new length are left untouched in the backing storage.\n            assert_eq(vec.storage()[2], 3);\n            assert_eq(vec.storage()[3], 4);\n            assert_eq(vec.storage()[4], 5);\n        }\n\n        #[test]\n        fn truncate_then_push_continues_from_new_len() {\n            let mut vec: BoundedVec<u32, 10> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n            vec.truncate(2);\n            vec.push(30);\n            assert_eq(vec.len(), 3);\n            assert_eq(vec.storage()[0], 1);\n            assert_eq(vec.storage()[1], 2);\n            assert_eq(vec.storage()[2], 30);\n        }\n    }\n\n    mod any {\n        use crate::collections::bounded_vec::BoundedVec;\n        use crate::internal::test_unconstrained;\n\n        #[test]\n        #[test_unconstrained]\n        fn returns_false_if_predicate_not_satisfied() {\n            let vec: BoundedVec<bool, 4> = BoundedVec::from_array([false, false, false, false]);\n            let result = vec.any(|value| value);\n\n            assert(!result);\n        }\n\n        #[test]\n        #[test_unconstrained]\n        fn returns_true_if_predicate_satisfied() {\n            let vec: BoundedVec<bool, 4> = BoundedVec::from_array([false, false, true, true]);\n            let result = vec.any(|value| value);\n\n            assert(result);\n        }\n\n        #[test]\n        fn returns_false_on_empty_boundedvec() {\n            let vec: BoundedVec<bool, 0> = BoundedVec::new();\n            let result = vec.any(|value| value);\n\n            assert(!result);\n        }\n\n        #[test]\n        #[test_unconstrained]\n        fn any_with_complex_predicates() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n\n            assert(vec.any(|x| x > 3));\n            assert(!vec.any(|x| x > 10));\n            assert(vec.any(|x| x % 2 == 0)); // has a even number\n            assert(vec.any(|x| x == 3)); // has a specific value\n        }\n\n        #[test]\n        fn any_with_partial_vector() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.push(2);\n\n            assert(vec.any(|x| x == 1));\n            assert(vec.any(|x| x == 2));\n            assert(!vec.any(|x| x == 3));\n        }\n    }\n\n    mod map {\n        use crate::collections::bounded_vec::BoundedVec;\n        use crate::internal::test_unconstrained;\n\n        #[test]\n        #[test_unconstrained]\n        fn applies_function_correctly() {\n            // docs:start:bounded-vec-map-example\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.map(|value| value * 2);\n            // docs:end:bounded-vec-map-example\n            let expected = BoundedVec::from_array([2, 4, 6, 8]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn applies_function_that_changes_return_type() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.map(|value| (value * 2) as Field);\n            let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 4, 6, 8]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn does_not_apply_function_past_len() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n            let result = vec.map(|value| if value == 0 { 5 } else { value });\n            let expected = BoundedVec::from_array([5, 1]);\n\n            assert_eq(result, expected);\n            assert_eq(result.get_unchecked(2), 0);\n        }\n\n        #[test]\n        fn map_with_conditional_logic() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n\n            let result = vec.map(|x| if x % 2 == 0 { x * 2 } else { x });\n            let expected = BoundedVec::from_array([1, 4, 3, 8]);\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn map_preserves_length() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.map(|x| x * 2);\n\n            assert_eq(result.len(), vec.len());\n            assert_eq(result.max_len(), vec.max_len());\n        }\n\n        #[test]\n        fn map_on_empty_vector() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let result = vec.map(|x| x * 2);\n            assert_eq(result, vec);\n            assert_eq(result.len(), 0);\n            assert_eq(result.max_len(), 5);\n        }\n    }\n\n    mod mapi {\n        use crate::collections::bounded_vec::BoundedVec;\n        use crate::internal::test_unconstrained;\n\n        #[test]\n        #[test_unconstrained]\n        fn applies_function_correctly() {\n            // docs:start:bounded-vec-mapi-example\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.mapi(|i, value| i + value * 2);\n            // docs:end:bounded-vec-mapi-example\n            let expected = BoundedVec::from_array([2, 5, 8, 11]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn applies_function_that_changes_return_type() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.mapi(|i, value| (i + value * 2) as Field);\n            let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 5, 8, 11]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn does_not_apply_function_past_len() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n            let result = vec.mapi(|_, value| if value == 0 { 5 } else { value });\n            let expected = BoundedVec::from_array([5, 1]);\n\n            assert_eq(result, expected);\n            assert_eq(result.get_unchecked(2), 0);\n        }\n\n        #[test]\n        fn mapi_with_index_branching_logic() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n\n            let result = vec.mapi(|i, x| if i % 2 == 0 { x * 2 } else { x });\n            let expected = BoundedVec::from_array([2, 2, 6, 4]);\n            assert_eq(result, expected);\n        }\n    }\n\n    mod for_each {\n        use crate::collections::bounded_vec::BoundedVec;\n        use crate::internal::test_unconstrained;\n\n        // map in terms of for_each\n        fn for_each_map<T, U, Env, let MaxLen: u32>(\n            input: BoundedVec<T, MaxLen>,\n            f: fn[Env](T) -> U,\n        ) -> BoundedVec<U, MaxLen> {\n            let mut output = BoundedVec::<U, MaxLen>::new();\n            let output_ref = &mut output;\n            input.for_each(|x| output_ref.push(f(x)));\n            output\n        }\n\n        #[test]\n        #[test_unconstrained]\n        fn smoke_test() {\n            let mut acc = 0;\n            let acc_ref = &mut acc;\n            // docs:start:bounded-vec-for-each-example\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n            vec.for_each(|value| { *acc_ref += value; });\n            // docs:end:bounded-vec-for-each-example\n            assert_eq(acc, 6);\n        }\n\n        #[test]\n        fn applies_function_correctly() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = for_each_map(vec, |value| value * 2);\n            let expected = BoundedVec::from_array([2, 4, 6, 8]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn applies_function_that_changes_return_type() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = for_each_map(vec, |value| (value * 2) as Field);\n            let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 4, 6, 8]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn does_not_apply_function_past_len() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n            let result = for_each_map(vec, |value| if value == 0 { 5 } else { value });\n            let expected = BoundedVec::from_array([5, 1]);\n\n            assert_eq(result, expected);\n            assert_eq(result.get_unchecked(2), 0);\n        }\n\n        #[test]\n        fn for_each_on_empty_vector() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let mut count = 0;\n            let count_ref = &mut count;\n            vec.for_each(|_| { *count_ref += 1; });\n            assert_eq(count, 0);\n        }\n\n        #[test]\n        fn for_each_with_side_effects() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n            let mut seen = BoundedVec::<u32, 3>::new();\n            let seen_ref = &mut seen;\n            vec.for_each(|x| seen_ref.push(x));\n            assert_eq(seen, vec);\n        }\n    }\n\n    mod for_eachi {\n        use crate::collections::bounded_vec::BoundedVec;\n        use crate::internal::test_unconstrained;\n\n        // mapi in terms of for_eachi\n        fn for_eachi_mapi<T, U, Env, let MaxLen: u32>(\n            input: BoundedVec<T, MaxLen>,\n            f: fn[Env](u32, T) -> U,\n        ) -> BoundedVec<U, MaxLen> {\n            let mut output = BoundedVec::<U, MaxLen>::new();\n            let output_ref = &mut output;\n            input.for_eachi(|i, x| output_ref.push(f(i, x)));\n            output\n        }\n\n        #[test]\n        #[test_unconstrained]\n        fn smoke_test() {\n            let mut acc = 0;\n            let acc_ref = &mut acc;\n            // docs:start:bounded-vec-for-eachi-example\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n            vec.for_eachi(|i, value| { *acc_ref += i * value; });\n            // docs:end:bounded-vec-for-eachi-example\n\n            // 0 * 1 + 1 * 2 + 2 * 3\n            assert_eq(acc, 8);\n        }\n\n        #[test]\n        fn applies_function_correctly() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = for_eachi_mapi(vec, |i, value| i + value * 2);\n            let expected = BoundedVec::from_array([2, 5, 8, 11]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn applies_function_that_changes_return_type() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = for_eachi_mapi(vec, |i, value| (i + value * 2) as Field);\n            let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 5, 8, 11]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn does_not_apply_function_past_len() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n            let result = for_eachi_mapi(vec, |_, value| if value == 0 { 5 } else { value });\n            let expected = BoundedVec::from_array([5, 1]);\n\n            assert_eq(result, expected);\n            assert_eq(result.get_unchecked(2), 0);\n        }\n\n        #[test]\n        fn for_eachi_on_empty_vector() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let mut count = 0;\n            let count_ref = &mut count;\n            vec.for_eachi(|_, _| { *count_ref += 1; });\n            assert_eq(count, 0);\n        }\n\n        #[test]\n        fn for_eachi_with_index_tracking() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([10, 20, 30]);\n            let mut indices = BoundedVec::<u32, 3>::new();\n            let indices_ref = &mut indices;\n            vec.for_eachi(|i, _| indices_ref.push(i));\n\n            let expected = BoundedVec::from_array([0, 1, 2]);\n            assert_eq(indices, expected);\n        }\n\n    }\n\n    mod from_array {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn empty() {\n            let empty_array: [Field; 0] = [];\n            let bounded_vec = BoundedVec::from_array([]);\n\n            assert_eq(bounded_vec.max_len(), 0);\n            assert_eq(bounded_vec.len(), 0);\n            assert_eq(bounded_vec.storage(), empty_array);\n        }\n\n        #[test]\n        fn equal_len() {\n            let array = [1, 2, 3];\n            let bounded_vec = BoundedVec::from_array(array);\n\n            assert_eq(bounded_vec.max_len(), 3);\n            assert_eq(bounded_vec.len(), 3);\n            assert_eq(bounded_vec.storage(), array);\n        }\n\n        #[test]\n        fn max_len_greater_then_array_len() {\n            let array = [1, 2, 3];\n            let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from_array(array);\n\n            assert_eq(bounded_vec.max_len(), 10);\n            assert_eq(bounded_vec.len(), 3);\n            assert_eq(bounded_vec.get(0), 1);\n            assert_eq(bounded_vec.get(1), 2);\n            assert_eq(bounded_vec.get(2), 3);\n        }\n\n        #[test(should_fail_with = \"from array out of bounds\")]\n        fn max_len_lower_then_array_len() {\n            let _: BoundedVec<Field, 2> = BoundedVec::from_array([0; 3]);\n        }\n\n        #[test]\n        fn from_array_preserves_order() {\n            let array = [5, 3, 1, 4, 2];\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array(array);\n            for i in 0..array.len() {\n                assert_eq(vec.get(i), array[i]);\n            }\n        }\n\n        #[test]\n        fn from_array_with_different_types() {\n            let bool_array = [true, false, true];\n            let bool_vec: BoundedVec<bool, 3> = BoundedVec::from_array(bool_array);\n            assert_eq(bool_vec.len(), 3);\n            assert_eq(bool_vec.get(0), true);\n            assert_eq(bool_vec.get(1), false);\n        }\n    }\n\n    mod trait_from {\n        use crate::collections::bounded_vec::BoundedVec;\n        use crate::convert::From;\n\n        #[test]\n        fn simple() {\n            let array = [1, 2];\n            let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from(array);\n\n            assert_eq(bounded_vec.max_len(), 10);\n            assert_eq(bounded_vec.len(), 2);\n            assert_eq(bounded_vec.get(0), 1);\n            assert_eq(bounded_vec.get(1), 2);\n        }\n    }\n\n    mod trait_eq {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn empty_equality() {\n            let bounded_vec1: BoundedVec<Field, 3> = BoundedVec::new();\n            let bounded_vec2: BoundedVec<Field, 3> = BoundedVec::new();\n\n            assert_eq(bounded_vec1, bounded_vec2);\n        }\n\n        #[test]\n        fn equality() {\n            let mut bounded_vec1: BoundedVec<Field, 3> = BoundedVec::new();\n            let mut bounded_vec2: BoundedVec<Field, 3> = BoundedVec::new();\n\n            bounded_vec1.push(1);\n            bounded_vec2.push(1);\n            assert(bounded_vec1 == bounded_vec2);\n        }\n\n        #[test]\n        fn inequality() {\n            let mut bounded_vec1: BoundedVec<Field, 3> = BoundedVec::new();\n            let mut bounded_vec2: BoundedVec<Field, 3> = BoundedVec::new();\n\n            bounded_vec1.push(1);\n            assert(bounded_vec1 != bounded_vec2);\n\n            bounded_vec2.push(2);\n            assert(bounded_vec1 != bounded_vec2);\n        }\n    }\n\n    mod from_parts {\n        use crate::collections::bounded_vec::BoundedVec;\n        use crate::internal::test_unconstrained;\n\n        #[test]\n        #[test_unconstrained]\n        fn from_parts() {\n            // docs:start:from-parts\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 0], 3);\n            assert_eq(vec.len(), 3);\n\n            // Any elements past the given length are ignored, so these\n            // two BoundedVecs will be completely equal\n            let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 1], 3);\n            let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 2], 3);\n            assert_eq(vec1, vec2);\n            // docs:end:from-parts\n        }\n    }\n\n    mod push_pop {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn push_and_pop_operations() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n\n            assert_eq(vec.len(), 0);\n\n            vec.push(1);\n            assert_eq(vec.len(), 1);\n            assert_eq(vec.get(0), 1);\n\n            vec.push(2);\n            assert_eq(vec.len(), 2);\n            assert_eq(vec.get(1), 2);\n\n            let popped = vec.pop();\n            assert_eq(popped, 2);\n            assert_eq(vec.len(), 1);\n\n            let popped2 = vec.pop();\n            assert_eq(popped2, 1);\n            assert_eq(vec.len(), 0);\n        }\n\n        #[test(should_fail_with = \"push out of bounds\")]\n        fn push_to_full_vector() {\n            let mut vec: BoundedVec<u32, 2> = BoundedVec::new();\n            vec.push(1);\n            vec.push(2);\n            vec.push(3); // should panic\n        }\n\n        #[test(should_fail_with = \"cannot pop from an empty vector\")]\n        fn pop_from_empty_vector() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let _ = vec.pop(); // should panic\n        }\n\n        #[test]\n        fn push_pop_cycle() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n\n            // push to full\n            vec.push(1);\n            vec.push(2);\n            vec.push(3);\n            assert_eq(vec.len(), 3);\n\n            // pop all\n            assert_eq(vec.pop(), 3);\n            assert_eq(vec.pop(), 2);\n            assert_eq(vec.pop(), 1);\n            assert_eq(vec.len(), 0);\n\n            // push again\n            vec.push(4);\n            assert_eq(vec.len(), 1);\n            assert_eq(vec.get(0), 4);\n        }\n    }\n\n    mod extend {\n        use crate::collections::bounded_vec::BoundedVec;\n        use crate::internal::test_unconstrained;\n\n        #[test]\n        fn extend_from_array() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.extend_from_array([2, 3]);\n\n            assert_eq(vec.len(), 3);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(1), 2);\n            assert_eq(vec.get(2), 3);\n        }\n\n        #[test]\n        fn extend_from_vector() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.extend_from_vector([2, 3].as_vector());\n\n            assert_eq(vec.len(), 3);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(1), 2);\n            assert_eq(vec.get(2), 3);\n        }\n\n        #[test]\n        #[test_unconstrained]\n        fn extend_from_bounded_vec() {\n            // The source deliberately has a higher capacity,\n            // to make sure we are not trying to assign out-of-bounds.\n            let mut vec1: BoundedVec<u32, 5> = BoundedVec::new();\n            let mut vec2: BoundedVec<u32, 9> = BoundedVec::new();\n\n            vec1.push(1);\n            vec2.push(2);\n            vec2.push(3);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 3);\n            assert_eq(vec1.get(0), 1);\n            assert_eq(vec1.get(1), 2);\n            assert_eq(vec1.get(2), 3);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_limit() {\n            // Capacity and contents chosen so the last item must be assigned to.\n            let mut vec1: BoundedVec<u32, 2> = BoundedVec::new();\n            let mut vec2: BoundedVec<u32, 5> = BoundedVec::new();\n\n            vec1.push(1);\n            vec2.push(2);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 2);\n            assert_eq(vec1.get(0), 1);\n            assert_eq(vec1.get(1), 2);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_full_and_empty() {\n            // Capacity and contents chosen so the last item must be assigned to.\n            let mut vec1: BoundedVec<u32, 2> = BoundedVec::new();\n            let vec2: BoundedVec<u32, 5> = BoundedVec::new();\n\n            vec1.push(1);\n            vec1.push(2);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 2);\n            assert_eq(vec1.get(0), 1);\n            assert_eq(vec1.get(1), 2);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_zero_len() {\n            let mut vec1: BoundedVec<u32, 0> = BoundedVec::new();\n            let vec2: BoundedVec<u32, 0> = BoundedVec::new();\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 0);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_last_zeroed() {\n            let mut vec1: BoundedVec<u32, 4> = BoundedVec::new();\n            let mut vec2: BoundedVec<u32, 4> = BoundedVec::new();\n\n            vec1.push(1);\n            vec1.push(2);\n            vec2.push(3);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 3);\n            assert_eq(vec1.get_unchecked(3), 0);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_empty_self() {\n            // self.len == 0 with Len > MaxLen: the source is clamped to\n            // MaxLen elements, filling the destination exactly to capacity.\n            let mut vec1: BoundedVec<u32, 3> = BoundedVec::new();\n            let vec2: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 3);\n            assert_eq(vec1.get(0), 1);\n            assert_eq(vec1.get(1), 2);\n            assert_eq(vec1.get(2), 3);\n        }\n\n        #[test]\n        #[test_unconstrained]\n        fn extend_from_bounded_vec_preserves_tail_storage() {\n            // The destination has meaningful (nonzero) storage past `len`.\n            // Extending must leave that tail untouched, identically in the\n            // constrained and unconstrained branches.\n            let mut dst: BoundedVec<u32, 4> = BoundedVec::from_parts([10, 99, 123, 7], 1);\n            let src: BoundedVec<u32, 4> = BoundedVec::from_parts([20, 0, 0, 0], 1);\n\n            dst.extend_from_bounded_vec(src);\n\n            assert_eq(dst.len(), 2);\n            assert_eq(dst.storage(), [10, 20, 123, 7]);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_equal_capacity() {\n            // Len == MaxLen, fills to capacity.\n            let mut vec1: BoundedVec<u32, 4> = BoundedVec::new();\n            vec1.push(1);\n            let vec2: BoundedVec<u32, 4> = BoundedVec::from_array([2, 3, 4]);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 4);\n            assert_eq(vec1.get(0), 1);\n            assert_eq(vec1.get(1), 2);\n            assert_eq(vec1.get(2), 3);\n            assert_eq(vec1.get(3), 4);\n        }\n\n        #[test(should_fail_with = \"extend_from_array out of bounds\")]\n        fn extend_array_beyond_max_len() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n            vec.push(1);\n            vec.extend_from_array([2, 3, 4]); // should panic\n        }\n\n        #[test(should_fail_with = \"extend_from_vector out of bounds\")]\n        fn extend_vector_beyond_max_len() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n            vec.push(1);\n            vec.extend_from_vector([2, 3, 4].as_vector()); // S]should panic\n        }\n\n        #[test(should_fail_with = \"extend_from_bounded_vec out of bounds\")]\n        fn extend_bounded_vec_beyond_max_len() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n            let other: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n            vec.extend_from_bounded_vec(other); // should panic\n        }\n\n        #[test]\n        fn extend_with_empty_collections() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let original_len = vec.len();\n\n            vec.extend_from_array([]);\n            assert_eq(vec.len(), original_len);\n\n            vec.extend_from_vector([].as_vector());\n            assert_eq(vec.len(), original_len);\n\n            let empty: BoundedVec<u32, 3> = BoundedVec::new();\n            vec.extend_from_bounded_vec(empty);\n            assert_eq(vec.len(), original_len);\n        }\n    }\n\n    mod storage {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn storage_consistency() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n\n            // test initial storage state\n            assert_eq(vec.storage(), [0, 0, 0, 0, 0]);\n\n            vec.push(1);\n            vec.push(2);\n\n            // test storage after modifications\n            assert_eq(vec.storage(), [1, 2, 0, 0, 0]);\n\n            // storage doesn't change length\n            assert_eq(vec.len(), 2);\n            assert_eq(vec.max_len(), 5);\n        }\n\n        #[test]\n        fn storage_after_pop() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n\n            let _ = vec.pop();\n            // after pop, the last element should be unmodified\n            assert_eq(vec.storage(), [1, 2, 3]);\n            assert_eq(vec.len(), 2);\n        }\n\n        #[test]\n        fn vector_immutable() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n            let storage = vec.storage();\n\n            assert_eq(storage, [1, 2, 3]);\n\n            // Verify that the original vector is unchanged\n            assert_eq(vec.len(), 3);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(1), 2);\n            assert_eq(vec.get(2), 3);\n        }\n    }\n}\n"
     },
-    "68": {
+    "69": {
       "function_locations": [
         {
           "name": "PrivateContext::new",
@@ -3760,121 +3824,121 @@
         },
         {
           "name": "PrivateContext::set_as_fee_payer",
-          "start": 29204
+          "start": 29840
         },
         {
           "name": "PrivateContext::in_revertible_phase",
-          "start": 29394
+          "start": 30420
         },
         {
           "name": "PrivateContext::end_setup",
-          "start": 31706
+          "start": 32732
         },
         {
           "name": "PrivateContext::set_expiration_timestamp",
-          "start": 34971
+          "start": 35997
         },
         {
           "name": "PrivateContext::assert_note_exists",
-          "start": 36366
+          "start": 37392
         },
         {
           "name": "PrivateContext::assert_nullifier_exists",
-          "start": 39002
+          "start": 40028
         },
         {
           "name": "PrivateContext::request_nhk_app",
-          "start": 41099
+          "start": 42125
         },
         {
           "name": "PrivateContext::request_ovsk_app",
-          "start": 42745
+          "start": 43771
         },
         {
           "name": "PrivateContext::request_sk_app",
-          "start": 44466
+          "start": 45492
         },
         {
           "name": "PrivateContext::message_portal",
-          "start": 47771
+          "start": 48797
         },
         {
           "name": "PrivateContext::consume_l1_to_l2_message",
-          "start": 49653
+          "start": 50744
         },
         {
           "name": "PrivateContext::emit_private_log_unsafe",
-          "start": 53772
+          "start": 54863
         },
         {
           "name": "PrivateContext::emit_raw_note_log_unsafe",
-          "start": 55229
+          "start": 56320
         },
         {
           "name": "PrivateContext::emit_contract_class_log",
-          "start": 55837
+          "start": 56928
         },
         {
           "name": "PrivateContext::call_private_function",
-          "start": 60396
+          "start": 61487
         },
         {
           "name": "PrivateContext::static_call_private_function",
-          "start": 61598
+          "start": 62689
         },
         {
           "name": "PrivateContext::call_private_function_no_args",
-          "start": 62613
+          "start": 63704
         },
         {
           "name": "PrivateContext::static_call_private_function_no_args",
-          "start": 63466
+          "start": 64557
         },
         {
           "name": "PrivateContext::call_private_function_with_args_hash",
-          "start": 64444
+          "start": 65535
         },
         {
           "name": "PrivateContext::call_public_function",
-          "start": 68343
+          "start": 69466
         },
         {
           "name": "PrivateContext::static_call_public_function",
-          "start": 69610
+          "start": 70733
         },
         {
           "name": "PrivateContext::call_public_function_no_args",
-          "start": 70629
+          "start": 71752
         },
         {
           "name": "PrivateContext::static_call_public_function_no_args",
-          "start": 71528
+          "start": 72651
         },
         {
           "name": "PrivateContext::call_public_function_with_calldata_hash",
-          "start": 72717
+          "start": 73840
         },
         {
           "name": "PrivateContext::set_public_teardown_function",
-          "start": 75245
+          "start": 76368
         },
         {
           "name": "PrivateContext::set_public_teardown_function_with_calldata_hash",
-          "start": 76516
+          "start": 77639
         },
         {
           "name": "PrivateContext::next_counter",
-          "start": 81920
+          "start": 83043
         },
         {
           "name": "<impl Empty for PrivateContext>::empty",
-          "start": 82089
+          "start": 83212
         }
       ],
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/private_context.nr",
-      "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            tx_request_salt: self.inputs.tx_request_salt,\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    pub fn set_as_fee_payer(&mut self) {\n        aztecnr_trace_log_format!(\"Setting {0} as fee payer\")([self.this_address().to_field()]);\n        self.is_fee_payer = true;\n    }\n\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 value 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(&mut self, content: Field, secret: Field, sender: EthAddress, leaf_index: Field) {\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        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 will require some interaction with public state, but smart contract developers should try to use public function calls sparingly, and carefully. _Internal_ public function calls are especially leaky, because they completely leak which private contract made the call. See also: 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"
+      "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            tx_request_salt: self.inputs.tx_request_salt,\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        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"
     },
-    "71": {
+    "72": {
       "function_locations": [
         {
           "name": "<impl From<UtilityContextData> for UtilityContext>::from",
@@ -3928,7 +3992,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/utility_context.nr",
       "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"
     },
-    "76": {
+    "77": {
       "function_locations": [
         {
           "name": "<impl ArrayOracles for EphemeralOracles>::len_oracle",
@@ -3978,7 +4042,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/ephemeral/mod.nr",
       "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"
     },
-    "82": {
+    "83": {
       "function_locations": [
         {
           "name": "record_retractable_fact",
@@ -4060,51 +4124,51 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/facts/mod.nr",
       "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::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/// The block a retractable fact originates from.\n#[derive(Deserialize, Eq, Serialize)]\npub struct OriginBlock {\n    pub block_number: u32,\n    pub block_hash: Field,\n}\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: OriginBlock,\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, OriginBlock,\n        record_non_retractable_fact, record_retractable_fact,\n    };\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 make_payload<let N: u32>(values: [Field; N]) -> EphemeralArray<Field> {\n        let payload: EphemeralArray<Field> = EphemeralArray::empty();\n        for i in 0..N {\n            payload.push(values[i]);\n        }\n        payload\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            make_payload(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                make_payload(PAYLOAD),\n                OriginBlock { 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                make_payload(PAYLOAD),\n                OriginBlock { 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"
     },
-    "84": {
+    "85": {
       "function_locations": [
         {
           "name": "compute_secret_hash",
-          "start": 519
+          "start": 536
         },
         {
           "name": "compute_l1_to_l2_message_hash",
-          "start": 800
+          "start": 815
         },
         {
           "name": "compute_l1_to_l2_message_nullifier",
-          "start": 1858
+          "start": 1892
         },
         {
           "name": "hash_args",
-          "start": 2110
+          "start": 2151
         },
         {
           "name": "hash_calldata_array",
-          "start": 2362
+          "start": 2403
         },
         {
           "name": "compute_public_bytecode_commitment",
-          "start": 2994
+          "start": 3035
         },
         {
           "name": "secret_hash_matches_typescript",
-          "start": 4153
+          "start": 4194
         },
         {
           "name": "var_args_hash_matches_typescript",
-          "start": 4512
+          "start": 4555
         },
         {
           "name": "compute_calldata_hash",
-          "start": 4922
+          "start": 4965
         },
         {
           "name": "public_bytecode_commitment",
-          "start": 5385
+          "start": 5428
         }
       ],
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/hash.nr",
-      "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(secret: Field) -> 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 a l1 to l2 message is the hash of the message salted with the secret\npub fn compute_l1_to_l2_message_nullifier(message_hash: Field, secret: Field) -> Field {\n    poseidon2_hash_with_separator([message_hash, 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"
+      "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"
     }
   },
   "functions": [
@@ -4134,11 +4198,11 @@
         ],
         "return_type": null
       },
-      "bytecode": "H4sIAAAAAAAA/+1bXWjbVhT2j2zJUWK7lu113di6sdGV/bB0WxmlrDRu0qa0pDRNB/sziq1lZrLlyXJoCuvm/TyOOT/tXgqDxclS2o4+5G0MxuhgL2GPpVAog8EeBiuFvQz2MLn+0ZWujqTrSE1WkqcrH52fe+53zzn3RDc4N3vh5hPZLH9WEXLZkpwtlBRBLvFiJZvNSaWKIldziiTP1i4PyQVRLExleFFc8M3VlscLpSlRmK/Pzl3f6bP+8/tsX/GRCfTbC6zP1+v2guZ8/npdVenAB7f8h2tLmebzfG35UEEWckqg9u2o+u6UIC9OvLTHXpuR30/E//Gokd9Hpn+01mgu3+xAV87KSUHklcK0QJFJCuASQmQSfLUrTVvyvMJnpPJMd0qHUZsQ4YvHpek57YeA9r6BEuxQjrRnm8BtDZD6DZMQJJ1tY1yRyrO6GSDCDOuaWRopCGL++k5638/8G089enJ16cuv0tuLe/8tZS99vv+t1QP7X7wQ333uTyPjoQ6jjTmPGRmHHTKGjIwjZI4ILp8UlKpcql0ekWShMFVqLtH5m8+09l6xUMll+UpFkJWMVCyrzpkUhTGZz4nCaUGuFKRSvT5Xu3pcKEryzMF8XhYqle7Ugd+H78WqYlkUWlM0POns+L5lRlURs1OCMqEUxIIyo85XEc4ot3zbjRoQpEKUEEgJgxQapDAgJQJS+kAKC1L6QcoASImClBhIiYOUbSAlAVI4kJIEKSmQkgYpD4EUGCEPg5QdIOWRJuSssLvpn3SxwfaVvS8TyWxMDO551fpXUrvrdZPM6DAy+kxSog1roMtqyGFhrUDAhNJkATekVm6FEi/PqExj5fNdwYsq3Fqr0tGExp/RUr6ViAzKw6QFj165pqKrHp9zwOgNBjVtSc2jsmBODUDqGFwdo6mzEhl0XyTlvkisPKIsABTyHEAhGECUSwAKWQLIOeoojWllSORz7w9JZ2qrJ6SKUMhLpT0nBLlYVdQ3pdIc4t4QhTzQ1Lp9DE4zbGYxoqVxTOLzusCBDHWlzQ+60qZZ06hllTKqms2XcsLFHkqbrTJFLVMu/l9S8ixcgMwa+DA0J5ykwMa1Gz/irJwNa6gzMEawpEUES3kewVJwBEu6tLVT+NZOgikwjZqGZYI0Wh0D6tK4urRFckk7yFe9i4y4L5IjSYERzwEU8T4FRiwBBDAl3EqBETQFJigCIy0TWETnwpbMexFkrLxgmIUpE92GQXtKQVStoXNBkYKg1U5a8w8aoUZ3RIYI3ECjbsCQHUG39HrxS4YGRItxdRLoEFwdSr86CTTJQ6tDe7c6CdvV4XA3JFA3YKvDof4iiDsbenajvDu7JWzjDudW3KHRuMNRRKW+RdyhzaCosTopgD6c/P0see0U7AyMOOIscJT0HEdJGEecSzhK4kvEgQVQCjUN248pB9WKSb2VsigtUuhxxnWRtPsiE1uBSAcg500WFwIRs5kC0dpP/Nd4Dw0GA+c5GDgYDIxLYOAsm2fY4RIxDdtUSQfRJGlZfFuJ7Hdf5ID7IomiyYYCiLovAHLu4N6iCYdGkyRFFL0sogmDDnuLJi+8Hj1K3tehO4Otvo4rfR0PmjCs+yKZDe7rMJ4DiPE+EDG99HVYtwIRgwYi1ptABHYOWH3nAGGKbkRfh7HtHETNkgbiBgzZUQf7jyXsyrDoEPRtVO9bhCkG+pbxzresrW9juBtY1A2Yb2Oom3so/0d6RC0FojYOepbddKjtOsEKs0TdLtbzaMx6H43ZXsrCqFvRmEWjcXTTRONtD2I03kL2g4bs3g48f5+++xuYrUzAEPUcDFEYDKxLYIiaJVvo1KJLtFZpmCLI7TGL80DMwRGjd5G0+yK3mrF6AD0IzVg1MRkOmyYr2Pr81PgqooRpf2QDZl1mcbw6aWqCyXdmdCegcYO+G4/ffmXm2fReaWz6s9unrp5LLu7+I7b9r+r+6X9uSVZZ/nhVBGYF67OFCX42N7AGfuXeqYYbb+ee3zUwfHd7YuHTA9e/+OTArueMWydqsXVihLcPyLdODN46UZe2jkmYiYKxN46ahoWguIOoFsfVxS2iWhzFBvThw/p7MUFXezG0d70Y2klaZO53WmStrnR9MzHowAUE/zFiPV9b1vv/GLGW2875CtG2THHLSltLc9+pkVgpjOd4kZfV4TxagAbQdUcf4iSfOzOOsx3JoaE7tOlNESAs4jnCIt4jLOJw3a8NFyeFfF7IZ6rytKDynDddFMSX/dpwAPFoBMQCRYgFCh2CtUNoefiDKi9WTPl21JaPVovl0XcRsaE1/5PrLoB9tcYpmW9epjStdME2HWYs8rV8n4mx1Jr/6W474pCHVyx6QO/GXLGgwNwXRk3DEhVCDRBcdQhb5D5EJHhHJ2A5A931iFXtekRFUDJ8uVIVhXp9wfm1vbbcTO3SEYEvH5RlfgYxNxCAJS1YfsW/1BJl+Eg/oH/s3Kptb+O2LWGtQWcKMLq9I1CMIT7v7ojO62v+IX3jL6Qh0ymCu21BU4aIkSGoMeg092kv6H5H/q3QaJqv7tzXDF5hNBkdVBmZGXPr+ozW9UGpvyPQyMDaMPSvHFOxceo9vmSqJoKtSf+afx8WCrouIAwEHY9lgFXuXt4GFPp1lzlhhXeuvBn66JeVO3gc73inreg/gQnEvp5CAAA=",
+      "bytecode": "H4sIAAAAAAAA/+1bXWjbVhT2j2zJUWK7lu113di6sdGV/bB0WxmlrDRu0qa0pDRNB/sziq1lZrLlyXJoCuvm/TyOOT/tXgqDxclS2o4+5G0MxuhgL2GPpVAog8EeBiuFvQz2MLn+0ZWujqTrSE1WkqcrH52fe+53zzn3RDc4N3vh5hPZLH9WEXLZkpwtlBRBLvFiJZvNSaWKIldziiTP1i4PyQVRLExleFFc8M3VlscLpSlRmK/Pzl3f6bP+8/tsX/GRCfTbC6zP1+v2guZ8/npdVenAB7f8h2tLmebzfG35UEEWckqg9u2o+u6UIC9OvLTHXpuR30/E//Gokd9Hpn+01mgu3+xAV87KSUHklcK0QJFJCuASQmQSfLUrTVvyvMJnpPJMd0qHUZsQ4YvHpek57YeA9r6BEuxQjrRnm8BtDZD6DZMQJJ1tY1yRyrO6GSDCDOuaWRopCGL++k5638/8G089enJ16cuv0tuLe/8tZS99vv+t1QP7X7wQ333uTyPjoQ6jjTmPGRmHHTIyRsYRMkcEl08KSlUu1S6PSLJQmCo1l+j8zWdae69YqOSyfKUiyEpGKpZV50yKwpjM50ThtCBXClKpXp+rXT0uFCV55mA+LwuVSnfqwO/D92JVsSwKrSkannR2fN8yo6qI2SlBmVAKYkGZUeerCGeUW77tRg0IUiFKCKSEQQoNUhiQEgEpfSCFBSn9IGUApERBSgykxEHKNpCSACkcSEmClBRISYOUh0AKjJCHQcoOkPJIE3JW2N30T7rYYPvK3peJZDYmBve8av0rqd31uklmdBgZfSYp0YY10GU15LCwViBgQmmygBtSK7dCiZdnVKax8vmu4EUVbq1V6WhC489oKd9KRAblYdKCR69cU9FVj885YPQGg5q2pOZRWTCnBiB1DK6O0dRZiQy6L5JyXyRWHlEWAAp5DqAQDCDKJQCFLAHkHHWUxrQyJPK594ekM7XVE1JFKOSl0p4TglysKuqbUmkOcW+IQh5oat0+BqcZNrMY0dI4JvF5XeBAhrrS5gddadOsadSyShlVzeZLOeFiD6XNVpmilikX/y8peRYuQGYNfBiaE05SYOPajR9xVs6GNdQZGCNY0iKCpTyPYCk4giVd2topfGsnwRSYRk3DMkEarY4BdWlcXdoiuaQd5KveRUbcF8mRpMCI5wCKeJ8CI5YAApgSbqXACJoCExSBkZYJLKJzYUvmvQgyVl4wzMKUiW7DoD2lIKrW0LmgSEHQaiet+QeNUKM7IkMEbqBRN2DIjqBber34JUMDosW4Ogl0CK4OpV+dBJrkodWhvVudhO3qcLgbEqgbsNXhUH8RxJ0NPbtR3p3dErZxh3Mr7tBo3OEoolLfIu7QZlDUWJ0UQB9O/n6WvHYKdgZGHHEWOEp6jqMkjCPOJRwl8SXiwAIohZqG7ceUg2rFpN5KWZQWKfQ447pI2n2Ria1ApAOQ8yaLC4GI2UyBaO0n/mu8hwaDgfMcDBwMBsYlMHCWzTPscImYhm2qpINokrQsvq1E9rsvcsB9kUTRZEMBRN0XADl3cG/RhEOjSZIiil4W0YRBh71Fkxdejx4l7+vQncFWX8eVvo4HTRjWfZHMBvd1GM8BxHgfiJhe+jqsW4GIQQMR600gAjsHrL5zgDBFN6Kvw9h2DqJmSQNxA4bsqIP9xxJ2ZVh0CPo2qvctwhQDfct451vW1rcx3A0s6gbMtzHUzT2U/yM9opYCURsHPctuOtR2nWCFWaJuF+t5NGa9j8ZsL2Vh1K1ozKLROLppovG2BzEabyH7QUN2bweev0/f/Q3MViZgiHoOhigMBtYlMETNki10atElWqs0TBHk9pjFeSDm4IjRu0jafZFbzVg9gB6EZqyamAyHTZMVbH1+anwVUcK0P7IBsy6zOF6dNDXB5DszuhPQuEHfjcdvvzLzbHqvNDb92e1TV88lF3f/Edv+V3X/9D+3JKssf7wqArOC9dnCBD+bG1gDv3LvVMONt3PP7xoYvrs9sfDpgetffHJg13PGrRO12DoxwtsH5FsnBm+dqEtbxyTMRMHYG0dNw0JQ3EFUi+Pq4hZRLY5iA/rwYf29mKCrvRjau14M7SQtMvc7LbJWV7q+mRh04AKC/xixnq8t6/1/jFjLbed8hWhbprhlpa2lue/USKwUxnO8yMvqcB4tQAPouqMPcZLPnRnH2Y7k0NAd2vSmCBAW8RxhEe8RFnG47teGi5NCPi/kM1V5WlB5zpsuCuLLfm04gHg0AmKBIsQChQ7B2iG0PPxBlRcrpnw7astHq8Xy6LuI2NCa/8l1F8C+WuOUzDcvU5pWumCbDjMW+Vq+z8RYas3/dLcdccjDKxY9oHdjrlhQYO4Lo6ZhiQqhBgiuOoQtch8iEryjE7Ccge56xKp2PaIiKBm+XKmKQr2+4PzaXltupnbpiMCXD8oyP4OYGwjAkhYsv+JfaokyfKQf0D92btW2t3HblrDWoDMFGN3eESjGEJ93d0Tn9TX/kL7xF9KQ6RTB3bagKUPEyBDUGHSa+7QXdL8j/1ZoNM1Xd+5rBq8wmowOqozMjLl1fUbr+qDU3xFoZGBtGPpXjqnYOPUeXzJVE8HWpH/Nvw8LBV0XEAaCjscywCp3L28DCv26y5ywwjtX3gx99MvKHTyOd7zTVvQfKkGUyp5CAAA=",
       "custom_attributes": [
         "abi_utility"
       ],
-      "debug_symbols": "tZrRbhs5DEX/xc95GImiJPZXiqJIU7cIECSBmyywKPLvS1q8GjsLCa4nfSmPnfpEQ5GSZuLfu+/7b68/v94//nj6tfv0+ffu2+H+4eH+59eHp7vbl/unR333926xf0LdfaKbXZDdp3Kzi/peCBqDx+iRPCaP7DF7LB6rR2mR3EfuI/eR+8h9ZD4dBmWPxWP1KC2mxWPwaL6kkTwmj+bT60nqi6yxeKwepUVePAaP0SN5TB7Zo/vYfew+dl92Xzaf/v4cPZLH5JE9Zo/Fo/mqRmmxmE80Bn8dPZLH5JE9Zo/qo0Vj9SgtVvWR5rsGfx09ksfkkT1mj+bTfNfqUVqUxWPwGD2SR/PpfAh7VF9SnxSP1aO0GJYFEAARQIAEYEAGFEAFwBxgDmaOBhFAgARgQAYUgJmtY6xljmBNw/Yj65oGEUCABGBABhRABYgDwUwwE8wEs7UQJwMGZEABVIA4WCM1MDMbRICasyXKmqkBAzKgACpAHKylGgRABMDMMDPMDDPDbK2V7QKtt45gzdUgACKAAAlgZpsda7EGZrZLtiZr74iDtVmDAIgAApjZ8mO91sDM2aDgnQoQB2u4BgEQAchGRTas63IxQDYqslGR54o8C/IsyLMgG4JsCLJh/dcgAwoAebYezNX2gAVgZjGIeIcACcCADCgANRfbDKwHj2A92CAAIoAACaDmEg0yQM3FdinrwQbiYD3YIAAigAAJwIAMgDnCHGEmmK0Hi2XDerABARKAARlQAGqui4E4WA/WZBAAaq5soOaaDRJAzdWyaj3YoAAqQBysBxsEQAQQIAFgZpgZZoaZYc4wZ5gzzBnmDLP1oNiVWg82KIAKEAfrwQYBEAEEULMcjxsMyIACMLMl03rwCNaDDQIgAghgZsu89WADM1vmrQcbVIA4WA+K1Yb1YIMIsBPJQkapE3fKnUqn2kmcyFrRKXSyM8+SjI6/I7293exwsPv6ctjv7Vx3ctLT89/z7WH/+LL79Pj68HCz++f24fX4n3493z4e48vtQX+qKd4/fteowh/3D3ujt5v108v4o1oG1T+tc5u7QDfHM0UYK3SXgkL3oHUM2vZnijhR8FKgYBkrZheihwlciG5qwwtJs1HYPopRxKGCx4qSgxtKXQUlnH0+jz9f7XB8/HxNYR2ADubCNOjOE3ENEtf55PMh1LFBloQxyHIyF1T5TCFjBXWDlsY6mZLPS2pelqWXJfFVDhK7o2jDkJOK+J9jUphJjxjuSLpBrjNS/mAYJfRhlPEwZpMqHPqk1uGkhklh1oTrqCdjUPG5YVKaKfdMSBkbZmMQzKmEPDZMalMP6D0RKa0OynLumBSn3pj0LtdbidXB75aryYSUFNYWOTGcjyJOFk2hBaMQSnHYZTFu79RIW1s1ptnCW9aFt6brHJEwDD3bTcaRN7fqdBhs9+xtGEzlukvhXht6MKPrHBeufnMH9WvJ+TrHpSsoxb86LZeuoLOul5OmjzRseuLZOaevoXpeCWNH3t72VLa3PdWtbU+yve2njgvbPoXN9TUbxsX1NduZ9ElI35m4DHemNKnzvDDObnk5SQdxOndMilRvRft5PqV1WlKgc0eeXUvoB3q9mLFjUqSlQFFzGBvq9lZJsr1VeNnaKhy2t8rUcWGrMG1uldkwLm2VaYkSpb4z8bi8+APWUf6AdZQ3r6P8Aesof8A6mrevo9NhLBXrVzxN6B9dyiK9OMIiV6Z0PT6FyfFp7liPT/pI+0pHfzAST1P6R44Lj6Rzx2VHUpbtR8Gy/NUSu3j9mW6zgpRmTe9wmy20ff0pafv6U3jr+lPy9vVn6rhw/Sl1c3HMhvEhxZH6jUJOWYbFUWebZChYf0gXj/VS3ilmD0RLRkb1j1Mn2TgvjTop0Zwxr7nwNYKyYAglLNcJsB2UOBzBfDL6Y+GcyjKejMkur4fgXlephOFkTBUxdkWloWKybllJ9+pm2azIcaS4PJ9pmE+ZPqqv/UYnhzIahkzqgoOgx1j/CLZZwcNZnT6NrP1pZKzDp5HTp7KyrpwnNznvnspO/2bRH9brXynryCCzZbPfdp4Vdz2/65TZPVIKPRGJ1kFo1b97xj25EtFNFZJMNJFM1k3OfcHgHNJEEmd3F0s/68QTBV2e0oJL4bScp/SLvry9uz+cfR/rzVSH+9tvD3t/+eP18e7kpy//PuMn+D7X8+Hpbv/99bA30/qlLv3ns50sKNIX+6aKvdQnYxTzlzf77f8B",
+      "debug_symbols": "tZrRblspEIbfxde5ODAMMH2VVVWlqVtFipLITVZaVXn3nTHzc+xUINcnvel8duovMDDAIf61+7b/+vrjy/3j96efu0///Np9Pdw/PNz/+PLwdHf7cv/0qO/+2i32T6i7T3SzC7L7VG52Ud8LQWPwGD2Sx+SRPWaPxWP1KC2S+8h95D5yH7mPzKfNoOyxeKwepcW0eAwezZc0ksfk0Xzan6S+yBqLx+pRWuTFY/AYPZLH5JE9uo/dx+5j92X3ZfPp78/RI3lMHtlj9lg8mq9qlBaL+URj8NfRI3lMHtlj9qg+WjRWj9JiVR9pvmvw19EjeUwe2WP2aD7Nd60epUVZPAaP0SN5NJ+Oh7BH9SX1SfFYPUqLYVkAARABBEgABmRAAVQAzAHmYOZoEAEESAAGZEABmNkqxkrmCFY0bD+yqmkQAQRIAAZkQAFUgDgQzAQzwUwwWwlxMmBABhRABYiDFVIDM7NBBKg5W6KsmBowIAMKoALEwUqqQQBEAMwMM8PMMDPMVlrZOmi1dQQrrgYBEAEESAAz2+hYiTUws3XZiqy9Iw5WZg0CIAIIYGbLj9VaAzNng4J3KkAcrOAaBEAEIBsV2bCqy8UA2ajIRkWeK/IsyLMgz4JsCLIhyIbVX4MMKADk2WowV9sDFoCZxSDiHQIkAAMyoADUXGwzsBo8gtVggwCIAAIkgJpLNMgANRfbpawGG4iD1WCDAIgAAiQAAzIA5ghzhJlgthoslg2rwQYESAAGZEABqLkuBuJgNViTQQCoubKBmms2SAA1V8uq1WCDAqgAcbAabBAAEUCABICZYWaYGWaGOcOcYc4wZ5gzzFaDYj21GmxQABUgDlaDDQIgAgigZjkeNxiQAQVgZkum1eARrAYbBEAEEMDMlnmrwQZmtsxbDTaoAHGwGhSbG1aDDSLATiQLGaVO3Cl3Kp1qJ3EiK0Wn0MnOPEsyOv6O9PZ2s8PB7svLYb+3c93JSU/Pf8+3h/3jy+7T4+vDw83u39uH1+N/+vl8+3iML7cH/ammeP/4TaMKv98/7I3ebtZPL+OP6jSo/mkd29wFuieeKcJYobsUFLoHrW3Qaj9TxImClwIFy1gx64geJtAR3dSGHUmzVtg+ilbEoYLHipKDG0pdBSWefT6PP1/tcHz8fE1hbYDQpWnQ4wlmgx4+UlfweRPq2CBLQhtkORkL0tlxqpCxgrpBp8Y6mFLOp9R8WpY+LYmvcpDYE0VrhpzMiN8cceYomNtpCWs7wp80o4TejDJuxmxQiaQPahkOaphMzJowLepJG/RYcW6YTM3UJ1bSlg8NszYIxlRCHhvqbHbH0JeatDqonC94YTI59cGkV7k+SqwOfrdcTQakpLCWyGrI562Ik0VTaEErhFIcVlmM2ys10tZSjWm28JZ14a3pOkckNEPPdpN25M2lOm0GR9SZnrfKdV3hPjf0YEbXOS5c/eaOvmboMe46x6UrKMW/OiyXrqCzqpeToo80LHri2Src11A9r4SxI28veyrby57q1rIn2V72U8eFZZ/C5vk1a8bF82u2M+lNSN+ZuAx3pjSZ53mxi6GjIy8n6SDmc8dkkuqjaD/Pp7QOSwrp3JFnfQn9QK+dGTsmk7T0Uak5jA11e6kk2V4qvGwtFQ7bS2XquLBUmDaXCoftpTKdokSp70w8nl78Aesof8A6ypvXUf6AdZQ/YB3N29fRaTOWivUrnib0j7qySJ8cYZErU7oen8Lk+DR3rMcnvdK+0tEvRvSes1znuPBIOndcdiRl2X4ULMtfnWIXrz/TbVaQ0qzpHW6zhbavPyVtX38Kb11/St6+/kwdF64/pW6eHCX/5cmR+oNCTlmGk6POltJQsP5QPO3K+f5WZxeiJSOj+sepk+uWd62YTNGcMa658DWCsqAJJSzXCbAdlDhswXww+rVwTmUZD8Zkl9dDcL+3SiUMB2OqiLErKg0Vk3Urxd4TnWCyWZHjSHF5PtMwnzK9qq/9QSeHMmqGTOYFB0GNsf4RbLOCh6M6vY2s/TYy1uFt5PRWtqZ+H3CyJb67lZ0ZeL2sL0seGWSybKb+2Hk2ueX8qVNmz0gp9EQkWjOREr274570RHRThSQTTSSTdVOzgTrjfPK3i98lcfZ0sfSzTjxRpMtTWtAVTst5Sj/ry9u7+8PZ97HeTHW4v/36sPeX318f705++vLfM36C73M9H57u9t9eD3szrV/q0n/+sZMFRfps31Sxl3ozRjF/frPf/j8=",
       "is_unconstrained": true,
       "name": "constructor"
     },
@@ -4165,6 +4229,10 @@
             "error_kind": "string",
             "string": "attempt to add with overflow"
           },
+          "5990802241885993019": {
+            "error_kind": "string",
+            "string": "fee payer must be elected during the setup phase"
+          },
           "723263401372269001": {
             "error_kind": "string",
             "string": "Immutables do not match instance immutables_hash"
@@ -6026,14 +6094,14 @@
           "visibility": "databus"
         }
       },
-      "bytecode": "H4sIAAAAAAAA/+2dB5gUxdq26e6Znp6eIUsSSZIFJAmIgOScsyRxgQVWll1YliwqqIjEZcmKgOQMkgQkR5F5JeecQSQJSBL5a0HZoWCZp5t95f/O5bnO9X11Hmrfp+6q6qru6uoaLXroyAMZmzcP6hEZ3LJ5WETzkLDI4IiwoNBOzZsHh0VGdO8QLpTD3tG955cJDWrZrkx4twqdw1qWDQoN7T2lTukaFctH957WMCQyLLhTJzUjkElTgExJkUjJSwGZUvo+BXKlgnK9hpQqHZIpPZIpA5IpI1TyTFCu16FcmaFcWZDCZ0cy5UQ6zBtIplxIpjxImfIikfIhmfIjmQoiZSqERCqMZCqCZCqKlKkYEqk4kqkEkqkkUqbSSKQySKaySKbyBpCpgtJ7VpmIkNDQkDYx/z48QVTUsKioDRkTPP8/Su+ZpTt1Co6IbBwcET4samj0hoz5WtWIOJF/Qs6ltcov6d37vWY5Cp6v1H1Zh6FlT9wcdlX8CWmDnx92T55T7eyEHRJn2Nf/STyjIhbVCu8UHNIqPKxAreCI9p0jgyJDwsOihz+uGFHcx+lsseOG378PGU5aFGlDSYsmbdiTJR8WHbgKcwB5hANUB8MDhkpgvYA5oQJijTSCo4BvQAWMhgo4EiignV7knx7hlx7plx4metIo0kaTNoa0r63XQy6oHkZB9fANR0Plhgo4GirgWI4C5oEKOAYq4LdMPekbv/RYv/S3fumvRU8aR9p40iaQ9p31engTqodxUD1M5GiovFABx0MFnMRRwHxQASdABZzM1JMm+qUn+aUn+6W/Ez1pCmlTSZtG2nTr9ZAfqocpUD3M4GioAlABp0IFnMlRwIJQAadBBZzF1JNm+KVn+qVn+aWni540m7Q5pM0lbZ71engLqofZUD3M52ioQlAB50AF/J6jgIWhAs6FCriAqSfN90t/75de4JeeJ3rSQtIWkbaYtCXW66EIVA8LoXr4gaOh3oYKuAgq4FKOAhaFCrgYKuAypp70g196qV96mV96iehJy0n7kbQVpK20Xg/vQPWwHKqHVRwNVQwq4I9QAVdzFLA4VMAVUAHXMPWkVX7p1X7pNX7plaInrSVtHWnrSdtgvR5KQPWwFqqHjRwN9S5UwHVQATdxFLAkVMD1UAE3M/WkjX7pTX7pzX7pDaIn/UTaFtJ+Jm2r9XooBdXDT1A9+DgaqjRUwC1QAYmjgGWgAv4MFfAXpp7k80uTX/oXv/RW0ZO2kbadtB2k7bReD2WhetgG1cMujoYqBxVwO1TA3RwFLA8VcAdUwD1MPWmXX3q3X3qPX3qn6El7SdtH2n7SDlivhwpQPeyF6uEgUz0c9Evv80vv90sfEPVwiLTDpB0h7eiT9RANMGaBCI8B710Cv9IRcTJaL2FyqITHAwRSan8KlfB4KTtvek483z3thH3z7IQ9GWfYx7qtjnUiwAukk6JTnSLtNGlnSDvL9QLpFFQH517eC6TTUAHPv7wXSGegAl5gGp7O+aXP+6Uv+KXPip70K2kXSfuNtEtcL5B+herh8st7gXQRKuCVl/cC6TeogFeZetJlv/QVv/RVv/Ql0ZOukfY7addJu8H1AukaVA83X94LpN+hAv7x8l4gXYcKeIupJ930S//hl77ll74hetJt0u6Qdpe0e1wvkG5D9fDny3uBdAcq4P2X9wLpLlTAv5h60p9+6ft+6b/80vdET3pAjgTkUMihcr1AeoDUg0N7aS+QHAmgAjpe2gskhwIV0MnTkxyaX9rhl3b6pdXh5NDJ4SKHQQ430wskhw7Vg/nSXiA5XFABPS/tBZLDgAroZepJpl/a45f2+qXdoiclJEciciQmRxKmF0iOhFA9JH1pL5AciaACJntpL5AciaECJmfqSUn90sn80sn90klET3qFHCnIkZIcqZheIDlegeoh9Ut7geRIARUwzUt7geRICRXwVaaelNovncYv/apfOpXoSWnJ8Ro50pEjPdMLJEdaqB4yvLQXSI7XoAJmfGkvkBzpoAJmYupJGfzSGf3SmfzS6UVPep0cmcmRhRxZmV4gOV6H6iHbS3uB5MgMFTA7U0Nl80v7LRs7svils4qGykGOnOR4gxy5bCx+O3I/v/Trf1ig2wmbJ86wzheqlNyP08rjlP8YmEdUyJvkyEuOfOTIb71jpIU6xptQHRTg6LmivaFceaEiFmTquwX80gX90vn80vlFU71FjkLkKEyOIk9+hqQM6z21bkhYm9DgRx0uEK8CcDwOGLUho+udjUGNs7xWZ9GUIaNSpm5f+M+w5jO+KN50Ucni+UYmyfnxxXh3j46J2L5DaDA53u49pXRERFD3aHIUJcc7Nj+3CvQXwidwB3gi7NBhUFRRamwIKGax+8P+72D+xa1efljYEjxh340zrPo4rJ0rsZhfurhfuoRf+l1xJZYkRylylCZHmSevRHVovF8LY2OvhbKxyXKxyfKxyQqxyYqxyUqxycqxySqxyaqxyWqxyeqxyRpcXzk6aj4/7OT5+9bYasiafumyfukK0uxXixy1yVGHHHXtTC7YjVEtqCbq8cx/FaFctaEi1mea/+r5pev7pev4peuKxmpAjobkeI8cjex0tcbPL32vFqd72AnbJM6w2gtVSmO/dHm/dAO/dBNRKU3J0Ywc75OjuZ3Sf/D8SqF1QeNtlf4Dv3Rlv3QVqfRB5GhBjpbkaGWn9MHPL/2bDRNVsRO2dZxhXS/UpMF+6Up+6SC/dGtRKW3I0ZYcIeT40M4VXxXK1QaqiXY8g1I1KFdbqIihPEWsDuUKgYrYnmncbOeXDvVLt/dLfyj6Uxg5wsnRgRwd7dREDShXGFQTEUw1EeGXDvdLd/BLdxQ1If5fJDk6k6OLnXGh6/NLf6PBtRO2St/VL93JL91UGiy7kaM7OXqQo+eTd52axbtOEcnSM9hHscleNu4EsW7WDWqCj57O1VTKJWL1ArrZEzXoiH7igVfOLDtYre6PApdnaGwdf4zVMbBz1PHxM5oCq2TZTvYXsaFYnwSszQQQySe+T+2g9IJyYSifPo0i/xGE8ukzT2aaW71zaGRI3ZZBoUERIjk8uvf0suFhnSKDwiKBzvB0XnVb8vc765ObtcyTPWH5a6mTDf+s5IZBfUpmz+1flI/80r2sGIrlmN7k6PMMjvnl27cIbtUquFXZzhFdgku3ajXc37C3X7pPdJw3idZK8hk5Pn96D3egBlWgS/czq7cX0VDYklCPq2h1HHNangneQoamR0twYgb6ghx9yfElOfpZnwewFati4r/YbPyV1crxSpUT2KKvpXG7v706AYohYmOtOcDGKibkPyCKv7a/sFTbA7lqW/TxgVhtD2KpbeE/6F+o7X6WanswV233E7Gx2h7CUtvCf8i/UNtfWqrtKK7aFiM3OC8MZalt4T80yuKMikUeIK4arCmiWWp2iCDD/IexzJviNmgY5o+cfhf49nQ41+1pXG9j/B+Yv/BL9/VLf+mX7ueXHi5qZwQ5Rtp56B+1IaNarcuwwdvbDV57wF01SfIdUcsnK8kjrn5QoezK6cmmFvvsTVsP/aP80iPigI55QzGaHGPI8TU5vrHzVI3t+4POknOwnCUn7kChXNBpcg6m0+QcfifIOfxOkHN87Zf+RjTWOHKMJ8cEcnz3/AkjMO8ISxPGRK7bcXHVTMQKPInlBbrwn/TC03Ngm5GWansyV22PFLGxAk9hqW3hPyXKzlUOzPzQwl0/CH4cy16JAeB9t/XIQ2zc9URDdx3iafkrqAjFxX8DFyGpDbhJYJ95oSu0fODK8Ls+p/Jcn+VFZOh4XMdUqBtPY7iGRRmnYfc106y2mT7suWvk0n9cfy8aHU6QGcneBMkUhGTqgWSKRDJBnC2RTHmQTGFIpggkUzMkU0YkU914q6fIeMsUEm+V2Sbe6qknkikfkqlXvJUJulo6xZtd63jrKsHxVqYO8VZP3eOt4BF/D4xD422HYBR6l4sM+ZZvALRjIjD20gM6fdcx3dYz3NOv2aZntHE3M038XXzCzIgnmBkZn5yMXTYn4wr/Tcb/Zyfj8vFW8Fb/V+fZTvHWVaBO1zneJpnc8VYF7f/dtguJtzJ1jrdIGePt4oS6Spf4m/v/3ZvgFkim0H/3lqxTvNG1+ncLDkVqHW+Z4m++i4y3KoDswuNtLAiLN7r4uzgzxlv3jb8nr3h8+LT2bALdq8fr08kT98CG5WX+l1rceF7zvPLgwQO/Nc+ZbGueMwOtecaUJCYbUmuzeNY8Zw2FyjjLapv9t+b5rP/8t+b535rnf2ueCf5b80zw//+ap+Uh3+o0nSOwgd80PZtnms4hImP1MYdhAhbuc6KAera8q+7h2jL0OtM72oZ/goC1JZaDZ2D+Yyz6Rw1Hmks7Bq0yz0VieUdDucbY6J6BSphTdBBkVT0nRDuPpannisDYm/P5gD+ypj9fWtN3Wxx5ssXjMDmP4fJ9Q4TF3qXMg+r9e4Z2j+mZyAYmrGdCv1roWMAwAYi6XhBldaozR8T7VGctYPb4DpjNQkBsh9U0MQZbmioC5gR+uCS2kMh1lktDrjINyJMrcMn8PgteGJtchI4zC+Jp7Fxo5+XuAvF32IC0ALqQF8cTzOKMlsdWLdew+GpzCHXJy7y9+eFfvb15eh9moKiiw3wPzofYHYblXyONjsfpaZnF6Skauvbmifsd9CJdjNXScu5HuzctPdr9yPNo96aIjI2tKxge7YT7CjuPdoHiis4ormvs0Ypnu/cy0YEw//FWr0ZsR/xKaLwaB+Uab6PjBSphXtH0yGyJnZ25iqURV4rA2GCxOp7m6tUv+NCWOx4f2uzUaaCayifCYvdIq6B6X2N1kE4YbfWtXoBnV/Hm5zj6FufhMSd+t7hrY5PrsOEd6UNrsWzrMtr5nC7As3T0ow9toJ9IdqwDatb6p7KrhD3PnCJuMpZiw8F6Bv8c8P3dBi76JZj/Rgb/bDD9Ji567H7Cgfxs9czqwe3DI7pXDguJHPbG4QQTRI8RzSZqThRfRCBHif/++7/036mP2ttqv3M+7HfgLchPQL+b/qgcNTtEvzFsnfgTcmyx8zi6BpzpsYL/bOOZGZoGtkBXtsj4M3ZLAv0aumOrxXZY/7AdttrsG/F5M+Wz3oN85CDLPUg89a1C25AwQIIAf7HeNALwF76mUdGm2Wa9abaRY7v1hb/88bXwlx/i2sF17W9Hr/0dWAeDfr/esdN6BxPNtJOvg2loB9tlvYPtIsduy9d+bgvX/m6saXZDgHusN40A3MPXNA60afZab5q95NhnZ9Fo/7+6aGTz0t6HXtr7sf6zD6qaA9b7j2iFA5YfNWLWxZDGwtbFVkC5DjIsLIv7v4Psr4yBJXRrAfPEd8Dc8R1QdOv4DwlMw37LVodik4dRh4NAoZFVq0MZX3Q9b0HAVafbdtfzjsQmj8bfet4RLNtRW+t5C6D1vCPQMHIUqFnr63kHhT3Hel4MPPaAeozBPQfsfpzBPTvsfoJlNW0BvJZ4kmctEaQ/xUW/CPM/zeUPrmWe4fJfiPmftbiWmutwglLiehUXjei5ovOIFhSVKDhEqJe+CMi7Vmg8rNeDWL2es3QzmyvmkeIcOc7bWSs8iA7y57G79fMQ4AWLgOsfAl6wWelYyQ9CJf/VetP8So6Ldhbh4Ka5iAFehAB/s940AvA3vqZR0aa5ZL1pLpHjsuWmyWOhaS5jTXMZArxivWkE4BW+ptHQprlqvWmukuOajZ1mOyw0zjWsca5BiL9bbxyB+Dtf4zjQxrluvXGuk+OGnbVFuGluYE1zAwK8ab1pBOBNvqZxok3zh/Wm+YMct2xcNwdjFgvAxrmFNc4tCPG29cYRiLf5GkdHG+eO9ca5Q467Nhpnv4Ur5y7WOHchxHvWG0cg3uNrHBfaOH9ab5w/yXHf3pVzCG2c+1jj3IcQ/7LeOALxLxtPhDGI8XkT/SCeVhsfZJTbsAQ57fyktDPwR8eKZOVUyKnasdIC3/HKVho5HXasnIHv4GQrJzl1O1auwPcjspWLnIYdK3fg+VW2cpPTtGPlCTxbyFYecnrtWCUMPPbJVgnJmciOVeLAA7JslZicSexYJQ1o5ZatkpIzmR2r5AGtTNkqOTlfsWOVIqCVR7ZKQc6UdqxSBbTyylapyJnajlWagFYJZas05HzVjlXagFaJZKu05HzNjlW6gFaJZat05ExvxypDQKskslUGcma0Y5UpoFVS2SoTOV+3Y5U5oFUy2SozObPYscoa0Cq5bJWVnNnsWAX++PgV2So7OXPYscoZ0CqFbJWTnG/YsQr8CW9K2SoXOXPbsQr8Kj6VbJWHnG/ascob0Cq1bJWXnPnsWOUPaJVGtspPzgJ2rAoGtHpVtipIzrfsWBUKaJVWtipEzsJ2rIoEtHpNtipCzrftWBUNaJVOtipKznfsWBULaJVetipGzuJ2rEoEtMogW4mHnnftWJUMaCU/XzlLkrOUHavSAa0yyValyVnGjlXZgFavy1ZlyVnOjlX5gFaZZavy5KxgxyrwjwFnka0qkrOSHavKAa2yylaVyVnFjlXVgFbZZKuq5Kxmx6p6QKvsslV1ctawY1UzoFUO2aomOWvZsaod0CqnbFWbnHXsWNUNaPWGbFWXnPXsWNUPaJVLtqpPzgZ2rBoGtMotWzUk53t2rBoFtMojWzUiZ2M7Vk0CWr0pWzUhZ1M7Vs0CWuWVrZqR8307Vs0DWuWTrZqT8wM7VkEBrfLLVkHkbGHHqmVAqwKyVUtytrJjFRzQqqBsFUzO1nas2gS0eku2akPOtnasQgJaFZKtQsj5oR2rdgGtCstW7cgZaseqfUCrIrJVe3KG2bEKD2j1tmwVTs4Odqw6BrQqKlt1JGeEHatOAa3eka06kTPSjlXngFbFZKvO5Oxix6prQKvislVXcnazY9U9oFUJ2ao7OXvYseoZ0Opd2aonOT+yY9UroFVJ2aoXOT+WP+ERz1yfSFrMG6FPZU28uukta+IdSx9ZEy9DPpM18dbic1kTrxe+kDXxHqCvrIkF+y9lTays95M1sQT+layJter+siYWlQfImlj9HShrYpl2kKyJ9dTBsiYWPofImlihjJI1sZQ4VNbEml+0rInFuWGyJlbRhsuaWO4aIWtiXWqkrIkFpFGyJlZ6RsuaWJIZI2ti7eRrWROLHN/ImliNGCtrYtngW1kTfW2crIkH8fGyJp6YJ8iaeLT9TtbEM+hEWRMPi5NkTTzVTZY18fg1RdbEc9JUWRMPNNNkTTx5TJc18YgwQ9bEvfxMWRM33bNkTdwdz5Y1cRs7R9bE/eZcWRM3hvNkTdzBzZc1cav1vayJe6IFsiZuXhbKmrjLWCRr4nZgsayJeXuJrIkJ9gdZEzPhUlkTU9YyWRNzy3JZE5PAj7ImRusVsiaG1ZWyJsa/VXaG2sCnLpWSrVaTc40dq7UBrUrLVmvJuc6OVeDDY8rIVuvJucGOVeCTWsrKVhvJucmOVeBjUcrJVpvJ+ZMdqy0BrcrLVlvI+bMdq8CHPVSQrbaS02fHigJaVZStiJy/2LEKfNpAJdlqGzm327EK/OVhZdlqBzl32rHaFdCqimy1i5y77VgF/ti8qmy1h5x77VjtC2hVTbbaR879dqwCfwJdXbY6QM6DdqwOBbSqIVsdIudhO1ZHAlrVlK2OkPOoHavAHxLWkq2OkfO4HavA3+3Vlq1OkPOkHavAH8nVka1OkfO0HavA36PVla3OkPOsHavAn0jVk63OkfO8HavAHyvVl60ukPNXO1YXA1o1kK0ukvM3O1aBv5ZpKFtdIudlO1aBv1t5T7a6Qs6rdqyuBbRqJFtdI+fvdqwCfzbRWLa6Ts4bdqwCf8DQRLa6Sc4/7FjdCmjVVLa6Rc7bdqwC759vJlvdIeddO1aB97G/L1vdI+efdqzuB7RqLlvdJ+dfdqwCb6P+QLZ6QLqd/dF64P3RQZKVrpBuZ3+0Hnh/dAvZSiPdzv5oPfD+6JaylZN0O/uj9cD7o1vJVi7S7eyP1gPvjw6Wrdyk29kfrQfeH91atvKQbmd/tB54f3Qb2Soh6Xb2R+uB90e3la0Sk25nf7QeeH90iGyVlHQ7+6P1wPujP5StkpNuZ3+0Hnh/dDvZKgXpdvZH64H3R4fKVqlIt7M/Wg+8P7q9bJWGdDv7o/XA+6PDZKu0pNvZH60H3h8dLlulI93O/mg98P7oDrJVBtLt7I/WA++P7ihbZSLdzv5oPfD+6AjZKjPpdvZH64H3R3eSrbKSbmd/tB54f3SkbJWddDv7o/XA+6M7y1Y5SbezP1oPvD+6i2yVi3Q7+6P1wPuju8pWeUi3sz9aD7w/uptslZd0O/uj9cD7o7vLVvlJt7M/Wg+8P7qHbFWQdDv7o/XA+6N7ylaFSLezP1oPvD/6I9mqCOl29kfrgfdH95KtipJuZ3+0Hnh/tPwCXS9Gup390Xrg/dHye3m9BOl29kfrgfdHy6/79ZKk29kfrQfeHy3vItBLk25nf7QeeH+0vDlBL0u6nf3ReuD90fKeB7086Xb2R+uB90fLWyn0iqTb2R+tB94fLe/Q0CuTbmd/tB54f7S88UOvSrqd/dF64P3R8n4SvTrpdvZH64H3R8vbVPSapNvZH60H3h8t737Ra5NuZ3+0Hnh/tLypRq9Lup390Xrg/dHyXh29Pul29kfrgfdHy1uA9Iak29kfrQfeHy3vLNIbkW5nf7QeeH+0vGFJb0K6nf3ReuD90fI+KL0Z6Xb2R+uB90fL26v05qTb2R+tB94fLe/a0oNIt7M/Wg+8P1reDKa3JN3O/mg98P5oeY+ZHky6nf3ReuD90fLWNb0N6Xb2R+uB90fLO+L0ENLt7I/WA++Pljfa6e1It7M/Wg+8P1rev6e3J93O/mg98P5oeVugHk66nf3ReuD90fJuQ70j6Xb2R+uB90fLmxj1TqTb2R+tB94fLe+N1DuTbmd/tB54f7S85VLvSrqd/dF64P3R8k5OvTvpdvZH64H3R8sbRPWepNvZH60H3h8t7zvVe5H+8ZNW2C/SQqff658ELJCdX6RdRY7V6NlHD7Ca+zRguBf8Rdq3AhvE/iKt3pvnF2nfEpGRwpLeJ3Cl2XHvw/PrgSvIsR9qZy/Lj5nqn4gOhPmvtuiP/biI/hnSqN5VUK7VNjpeoBKKFbc+yCFkhSDaz1ka8TMRGBssvgD8gSPQ9C9e8BdpCwQuB/qLtLbqNFBNFRZhozF3qN77Wh2k/X7BAv6tc/gnlOZhp+rNg3IFGJde4Jdw9S9jk/3i7Zcz9C+xbP2kN4DD47POnt9pHv2+hv4l1LX6AfVvtfuLbi3src548G81rQfvlZyfYB11PVRRX3HhbEBxPsVwNkA4/blwNqI4vTGcjRDOAC6cTShOHwxnE4QzkAtnM4rzGYazGcIZxHLzK0oJ3rcM5vL/AvMfwuXfF/OP4vL/EvMfyuXfD/OP5vL/CvMfxuXfH/MfzuU/APMfweU/EPMfyeU/CPMfxeU/GPMfzeU/BPMfw+UPLg9+zeU/FPP/hss/GvMfy+U/DPP/lst/OOY/jst/BOY/nst/JOY/gct/FOb/HZf/aMx/Ipf/GMx/Epf/15j/ZC7/bzD/KVz+YzH/qVz+32L+07j8x2H+07n8x2P+M7j8J2D+M7n8v8P8Z3H5T8T8Z3P5T8L853D5T8b853L5T8H853H5T8X853P5T8P8v+fyn475L+Dyn4H5L+Tyn4n5L+Lyn4X5L+byn435L+Hyn4P5/8DlPxfzX8rlPw/zX8blPx/zX87l/z3m/yOXP/aT4/oKLn/sJ7f1lVz+2E+e66u4/Bdj/qu5/LEfvNfXcPljP/mur+XyX4r5r+PyX4b5r+fyX475b+Dy/xHz38jlvwLz38TlvxLz38zlvwrz/4nLfw3mv4XLfx3m/zOX/wbMfyuX/ybM38fl/xPmT1z+P2P+v3D5+zD/bVz+v2D+27n8t2P+O7j8d2L+O7n8d2P+u7j892L+u7n8sc3n+h4u/4OY/14u/8OY/z4u/6OY/34u/+OY/wEu/5OY/0Eu/9OY/yEu/7OY/2Eu//OY/xEu/18x/6Nc/r9h/se4/C9j/se5/K9i/ie4/H/H/E9y+d/A/E9x+f+B+Z/m8r+N+Z/h8r+L+Z/l8v8T8z/H5f8X5n+eyV9PgPlf4PJXMf9fufwdmP9FLn8d8/+Ny9/A/C9x+ZuY/2Uufy/mf4XLPxHmf5XLPwnmf43LPxnm/zuX/yuY/3Uu/5SY/w0u/9SY/00u/1cx/z+4/F/D/G9x+afH/G9z+WfE/O9w+b+O+d/l8s+C+d/j8s+G+f/J5Z8D87/P5f8G5v8Xl39uzP8Bl/+bkL8rAZd/Psxf4fIvgPmrXP5vYf4al39hzN/B5f825u/k8n8H89e5/Itj/i4u/3cxf4PLvxTm7+byL4P5m1z+5TB/D5d/Bczfy+VfCfNPyOVfBfNPxOVfDfNPzOVfA/NPwuVfC/NPyuVfB/NPxuVfD/NPzuXfAPN/hcv/Pcw/BZd/Y8w/JZd/U8w/FZf/+5h/ai7/DzD/NFz+LTD/V7n8W2H+abn8W2P+r3H5t8X803H5f4j5p+fyD8X8M3D5h2H+Gbn8O2D+mbj8IzD/17n8IzH/zFz+XTD/LFz+3TD/rFz+PTD/bFz+H2H+2bn8P8b8cyD+j47HrhwWEjks9+EEE0j/ivT+pA8gfSDpg0gfTPoQ0qNIH0p6NOnDSB9O+gjSR5I+ivTRpI8h/WvSvyF9LOnfkj6O9PGkizjfkT6R9EmkTyZ9CulTSZ9G+nTSZ5A+k/RZpM8mfQ7pc0mfR/p80r8nfQHpC0lfRPpi0peQ/gPpS0lfRvpy0n8kfQXpK0kX+KtJX0P6WtLXkb6e9A2kbyR9E+mbSf+J9C2k/0z6VtJ9pBPpv5C+jfTtpO8gfSfpu0jfTfoe0veSvo/0/aQfIP0g6YdIP0z6EdKPkn6M9OOknyD9JOmnSD9N+hnSz5J+jvTzpF8g/Vfxbl+8XhdvuMVLZvGeV7xqFW87xQtH8c5PvHYTb77Eyyfx/ke8ghFvQcSLCPEuQCzHixVxsSgt1oXF0qxYHRULlGKNUCzTiZUysVgl1ovEko1YNRELF2LtQDy+iydo8RArniPFo5x4mhIPNOKZQtzWiztrcXMr7i/FLZ64yxI3OuJeQ0z3YsYVk56Yd8TQL0ZfMQCKMUgMA+JKFBeD6I+iS0x91N5P9LuHhy4H6ChO6JRSkWsV1DVzclwa+uciMHZpvAH4x54cn3vYOvEn5Mr1RJmQI3ZFofoOC1ygwuhZzK7cFisOOiIypuJyoTWcGzoi0pULwsljsR3WP2yHPDb7Rjwezux603oPepNceS33oLdEgdA2zIs1TV4IMJ/1phGA+fiaRkWbJr/1pslPrgJPlTyQk1YEGDgVDchTBOIqyHXtF0CbqSDWwQpAOG9Z72Cimd7i62Aa2sEKWe9ghchV2PK1X8DCtV8Ya5rCEGAR600jAIvwNY0DbZq3rTfN2+Qq+vT9UGCrd5AKj7cfobB5aRdFW+EdrP8UhaqmmPX+I1qhmOW7UiWezs7/u9jFA4ey18XBF8YlgGoDfoXAVSKj5WLG/GIJ0u2xXyzpA+G+y1DdhUVY5NzrJ343wxwR7z9uZC1gwfgOWCC+A4oBIv5DAtixP+zhKhmbLIU6vBtPV1TJjC/4SysLyHEQGbNjfsNrAXYI/wIoV4CPIB88eHDb5i+tuErHJsvE2y+tuEpj2co8OcaBv7QC1tnzh69Hv7TiKg0NcmWA+rf64CH6tbDn+aUV0f+OQT36IDkTYB31GFRRZblwjqM4KoZzHMIpx4VzAsVxYDgnIJzyXDgnURwdwzkJ4VTgwjmF4hgYzikIpyIXzmkUx8RwTkM4lbhwzqA4XgznDIRTmQvnLIqTCMM5C+FUYXmtJUqJfVbmqsrlj31W5qrG5Y99VuaqzuWPfVbmqsHlj31W5qrJ5Y99VuaqxeWPfVbmqs3lj31W5qrD5Y99Vuaqy+WPfVbmqsflj31W5qrP5Y99VuZqwOWPfVbmasjlj31W5nqPyx/7rMzViMsf/KysMZc/+FlZEy5/8LOyplz+4Gdlzbj8wc/K3ufyBz8ra87lD35W9gGXP/iWIIjLH/ysrAWXP/hZWUsuf/CzslZc/uBnZcFc/uBnZa25/MHPytpw+YOflbXl8gc/Kwvh8gc/K/uQyx/8rKwdlz/4WVkolz/4WVl7Ln/ws7IwLn/ws7JwLn/ws7IOXP7gZ2UdufzBz8oiuPzBz8o6cfmDn5VFcvmDn5V15vIHPyvrwuUPflbWlcsf/KysG5c/+FlZdy5/8LOyHlz+4GdlPbn8wc/KPuLyBz8r68XlD35W9jGXP/hZ2Sdc/uBnZZ9y+YOflfXm8gc/K+uD+Pt9VpbncIJS5CpLrnLkKi9evYvX1eIVr3gtKl4lird54oWaeKclXiuJNzvi5Yp4vyFeMYhVfrHQLta6xXKzWPEVi65i3VMsPYrVP7EAJ9bAxDKUWAkSizFiPUQsSYhVAfFgLp6NxeOpeEIUD2niOUk8qoinBXHDLu6ZxW2ruHMUN2/i/kncwoi7CDGRi7lUTGdiRhGDuhhXxdAmRhdxgYtrTHRz0dNEY4v6Fsh2P5syoC1HRsAtR39X/WccTR+zmegzrOk/B/xj9/Xmidld/Tm5vrDx2ZTrXXQf1BfYxuUvIMC+FgHXPwTsa7PSsZK/C5X8S+tN8yW5+tn4Hglvmn4YYD8I8CvrTSMAv+JrGhVtmv7Wm6Y/uQZYbpqCFppmANY0AyDAgdabRgAO5GsaDW2aQdabZhC5BltuGnJZaZzBWOMMhhCHWG8cgTiEr3EcaONEWW+cKHINtfGZFd40Q7GmwabTaOtNIwCj+ZrGiTbNMOtNM4xcw21cN+/G7PYHG2c41jjDIcQR1htHII7gaxwdbZyR1htnJLlG2WicdyxcOaOwxhkFIY623jgCcTRf47jQxhljvXHGkOtre1dOSbRxvsYa52sI8RvrjSMQv7Hz9V+8fM/xd7HHBg5lr/+MxWaDb4FqQ76M+TajvWKWjM/HkXHxBDMuo3Q1OEqQa7ykOUWxJsiauAf8TtbE/DZR1sSVO0nW3OSaLGseck2RtYTkmiprick1TdaSkmu6rCUn1wxZS0GumbKWilyzZC0NuWbLWlpyzZG1dOSaK2sZyDVP1jKRa76sZSbX97KWlVwLZC07uRbKWk5yLZK1XORaLGt5yLVE1vKS6wdZy0+upbImbqiXyVohci2XtSLk+lHWipJrhawVI9dKWRN9bZWslSTXalkrTa41siYWvNbKmlj+WidrYjFsvayJpbENsiYWyjbKmlg22yRrYhFts6yJJbWfZE0ssG2RNbHc9rOsicW3rbImluJ8siYW5kjWxDLdL7ImFu22yZpYwtsua2JBb4esieW9nbImFvt2yZpY+tsta2IhcI+siWXBvbImFgn3yZpYMtwva2JwOiBrYjnxoKyJxcVDsiaWGg/Lmlh4PCJrYhnyqHRcQcz4d0zSYsa/47Imxr8TsibGv5OyJsa/U7Imxr/TsibGvzOyJsa/s7Imxr9zsibGv/OyJsa/C7Imxr9fZU2MfxdlTYx/v8maGP8uyZoY/y7Lmhj/rsiaGP+uypoY/67Jmhj/fpc1Mf5dlzUx/t2QNTH+3ZQ1Mf79IWti/Lsla2L8uy1rYvy7I2ti/Lsra2L8uydrYvz7U9bE+Hdf1kRf+0vWxPj3QNZKkyEfqyHGP0ORtfJkqLJWkQxN1iqT4ZC1qmQ4Za06Gbqs1STDJWu1yTBkrS4ZblmrT4Ypaw3J8MhaIzK8staEjISy1oyMRLLWnIzEshZERhJZa0lGUlkLJiOZrLUhI7mshZDxiqy1IyOFrLUnI6WshZORStY6kpFa1jqRkUbWOpPxqqx1JSOtrHUn4zVZ60lGOlnrRUZ6WVtNRgZZW0tGRllbT0YmWdtIxuuytpmMzLK2hYwssraVjKyyRmRkk7VtZGSXtR1k5JC1XWTklLU9ZLwha/vIyCVrB8jILWuHyMgja0fIeFPWjpGRV9ZOkJFP1k6RkV/WzpBRQNbOkVFQ1i6Q8ZasXSSjkKxdIqOwrF0ho4isXSPjbVm7TkZRWbtJxjuydouMYrJ2h4zisnaPjBKydp+Md2XtARklJU1XyCglaxoZpWXNSUYZWXORUVbW3GSUkzUPGeVlLSEZFWQtMRkVZS0pGZVkLTkZlWUtBRlVZC0VGVVlLQ0Z1WQtLRnVZS0dGTVkLQMZNWUtExm1ZC0zGbVlLSsZdWQtOxl1ZS0nGfVkLRcZ9WUtDxkNZC0vGQ1lLT8Z78laQTIayVohMhrLWhEymshaUTKayloxMprJWgky3pe1kmQ0lzUx/34ga2L+DZI1Mf+2kDUx/7aUNTH/tpI1Mf8Gy5qYf1vLmph/28iamH/bypqYf0NkTcy/H8qamH/byZqYf0NlTcy/7WVNzL9hsibm33BZE/NvB1kT829HWRPzb4Ssifm3k6yJ+TdS1sT821nWxPzbRdbE/NtV1sT8203WxPzbXdbE/NtD1sT821PWxPz7kayJ+beXrIn59+Mnl+WikdUf7Pwn4xOLC27Qsqf+OelfoEte46CVOcPqjh+slrCVNKO3xVr691dOjT4s9YOd+Gd8xlM/8XiunIFsm3nieCnvUGtHaQFncw19fFiT8QV2WJPVReR3RGToVC6jb+BKs+Pe1+qJSNj5fX3Eey5onPCy/OCq8YkYgDB/qz+4ih10aXyJNKr3NpTrjo2OF6iE4s6pL/LuohhE24+lEb8UgbHJ5qv4eXNifCUdWee2OKYAJ6lGgcfw2arTQDVVXISNxtyheu9vdZC2egZgzEGgJaDO8pmYMgKMZQ8ePDhu89w+Y0BscmC8ndtnDMCyDbTxdvJhzWFDIMtvPj9sEMzf6m8+RwXYjPLorEED2odnDISG4LtQrntA/7N8bqHRT6CwnFsYc9v/FdqXjmE/BPAVVOmDuHD6ozjHMZz+EM5gLpwBKM4JDAe7JIZw4QxEcU5iOAMhHLZrZxCKcwrDGQThDOXCGYzinMZwoK22RjQXzhAU5wyGMwTCGcaFE4XinMVwoiCc4Vw48D3MOQwHe04YwYUD38yex3CgxR5jJBfOMBTnAoaDPTOP4sIZjuL8iuFAm6GN0Vw4I1CcixjOCAhnDBfOSBTnNwxnJITzNRfOKBTnEoYDbe42vuHCGY3iXMZwRkM4Y7lwxqA4VzCcMRDOt1w4X6M4VzEcaLO6MY4L5xsU5xqG8w2EM54LZyyK8zuGMxbCmcCF8y2Kcx3D+RbC+Y4LZxyKcwPDGQfhTOTCGY/i3MRwxkM4k7hwJqA4f2A4EyCcyVw436E4tzCc7yCcKVw4E1Gc2xjORAhnKhfOJBTnDoYzCcKZxoUzGcW5i+FMhnCmc+FMQXHuYThTIJwZXDhTUZw/MZypEM5MLpxpKM59DGcahDOLC2c6ivMXhjMdwpnNhTMDxXmA4cyAcOZw4cwEcQzsZ7b0mRDOXC6cWSiOguHMgnDmceHMRnGwXw3TZ0M487lw5qA4GoYzB8L5ngtnLoqD/QiaPhfCWcCFMw/FcWI48yCchVw481Ec7Dfd9PkQziIunO9RHBeG8z2Es5gLZwGKg/1Enb4AwlnChbMQxXFjOAshnB+4cBahONgv7umLIJylXDiLURwPhrMYwlnGhbMExcF+QFBfAuEs58L5AcVJiOH8AOH8yIWzFMXBfg9RXwrhrODCWYbiJMZwlkE4K7lwlqM4STCc5RDOKi6cH1GcpBjOjxDOai6cFShOMgxnBYSzhgtnJYqTHMNZCeGs5cJZheK8guFg3y2t48JZjeKkwHBWQzjruXDWoDgpMZw1EM4GLpy1KE4qDGcthLORC2cdipMaw1kH4WziwlmP4qTBcNZDOJu5cDagOK9iOBsgnJ+4cDaiOGkxnI0QzhYunE0ozmsYziYI52cunM0oTjoMZzOEs5UL5ycUJz2G8xOE4+PC2YLiZMBwtkA4xIXzM4qTEcP5GcL5hQtnK4qTCcPZCuFs48LxoTivYzg+CGc7Fw6hOJkxHIJwdnDh/ILiZMFwfoFwdnLhbENxsmI42yCcXVw421GcbBjOdghnNxfODhQnO4azA8LZw4WzE8XJgeHshHD2cuHsQnFyYji7IJx9XDi7UZw3MJzdEM5+Lpw9KE4uDGcPhHOAC2cvipMbw9kL4RzkwtmH4uTBcPZBOIe4cPajOG9iOPshnMNcOAdQnLwYzgEI5wgXzkEUJx+Gg509dpQL5xCKkx/DOQThHOPCOYziFMBwDkM4x7lwjqA4BTGcIxDOCS6coyjOWxjOUQjnJBfOMRSnEIZzDMI5xYVzHMUpjOEch3BOc+GcQHGKYDgnIJwzXDgnUZy3MZyTEM5ZLpxTKE5RDOcUhHOOC+c0ivMOhnMawjnPhXMGxSmG4ZyBcC5w4ZxFcYpjOGchnF+5cM6hOCUwnHMQzkUunPMozrsYznkI5zcunAsoDvZLZPoFCOcSF86vKE4pDOdXCOcyF85FFKc0hnMRwrnChfMbilMGw/kNwrnKhXMJxSmL4VyCcK5x4VxGccphOJchnN+5cK6gOOUxnCsQznUunKsoTgUM5yqEc4ML5xqKUxHDuQbh3OTC+R3FqYTh/A7h/MGFcx3FqYzhXIdwbnHh3EBxqmA4NyCc21w4N1GcqhjOTQjnDhfOHyhONQznDwjnLhfOLRSnOoZzC8K5x4VzG8WpgeHchnD+5MK5g+LUxHDuQDj3uXDuoji1MJy7EM5fXDj3UJzaGM49COcBF86fKE4dDOdPBMedgAvnPopTF8O5D+EoXDh/oTj1MJy/IByVC+cBilMfw3kA4WhMOK4EKE4DCMeVAMJxcOEoKE5DDEeBcJxcOCqK8x6Go0I4OheOhuI0wnA0CMfFheNAcRpjOA4Ix+DCcaI4TTAcJ4Tj5sLRUZymGI4O4ZhcOC4UpxmG44JwPFw4BorzPoZjQDheLhw3itMcw3FDOAm5cEwU5wMMx4RwEnHheFCcIAzHA+Ek5sLxojgtMBwvhJOECychitMSw0kI4STlwkmE4rTCcBJBOMm4cBKjOMEYTmIIJzkXThIUpzWGkwTCeYULJymK0wbDSQrhpODCSYbitMVwkkE4KblwkqM4IRhOcggnFRfOKyjOhxjOKxBOai6cFChOOwwnBYSThgsnJYoTiuGkhHBe5cJJheK0x3BSQThpuXBSozhhGE5qCOc1Lpw0KE44hpMGwknHhfMqitMBw3kVwknPhZMWxemI4aSFcDJw4byG4kRgOK9BOBm5cNKhOJ0wnHQQTiYunPQoTiSGkx7CeZ0LJwOK0xnDyQDhZObCyYjidMFwMkI4WbhwMqE4XTGcTBBOVi6c11GcbhjO6xBONi6czChOdwwnM4STnQsnC4rTA8PJAuHk4MLJiuL0xHCyQjg5uXCyoTgfYTjZIJw3uHCyozi9MJzsEE4uLpwcKM7HGE4OCCc3glM9uH14RPfKYSGRw948nGACGYPIGEzGEDKiyBhKRjQZw8gYTsYIMkaSMYqM0WSMIeNrMr4hYywZ35IxjozxZIi//Y6MiWRMImMyGVPImErGNDKmkzGDjJlkzCJjNhlzyJhLxjwy5pPxPRkLyFhIxiIyFpOxhIwfyFhKxjIylpPxIxkryFhJxioyVpOxhoy1ZKwjYz0ZG8jYSMYmMjaT8RMZW8j4mYytZPjIIDJ+IWMbGdvJ2EHGTjJ2kbGbjD1k7CVjHxn7yThAxkEyDpFxmIwjZBwl4xgZx8k4QcZJMk6RcZqMM2ScJeMcGefJuEDGr2RcJOM3Mi6RcZmMK2RcJeMaGb+TcZ2MG2TcJOMPMm6RcZuMO2TcJeMeGX+ScZ+Mv8h4QO6YbUXkVsmtkdtBbie5dfE6XrzCFq99xatS8XpRvJITr7HEqx/xukS8YhDL8mIpWyz/iiVTscwolubEcpZYAhLLJmKpQTyei0da8RgoHp3E44a4RRe3teJWUNw+iVsOMU2LqU1MB2IIFcOOuFRF9xZdYuqj9n6iG0dBv2TtzhO4azrJexfKZXXnKPTL6kY/UUjoN9PdbwL+0x9VVc0O0W8OWyf+hNx5n7r6A5VJFKo/MEgUF2XHCp6PY4iKqbi8aA1jh3a480I4+S22w/qH7ZDfZt+ASm70g0pewHoPKkDugpZ70DuiQGgbYkdciGwI4FvWm0YAvsXXNCraNIWsN00hchd+quSBnLQSw4D61oA8JSCuIlzXfmG0mbBzINyFIZy3rXcw0Uxv83UwDe1gRa13sKLkfsfytf+2hWsfOzVBZEMAi1lvGgFYjK9pHGjTFLfeNMXJXcLO/dC7SIV7b0O57nBd2iXQVsBODnBjI1VJ6/1HtEJJO61QCqrfu1CuwHelir0uXgq7uSsNVNv8MqFBLduVCe9WoXNYy7JBoaG9p9QpXaNi+eje0xqGRIYFd+ok4mS0XMxiZPRFKrwYAmL0hXDLMFS36EZlooBqnFUmIiQ0NKRNTA0ON0f0nlo3JKxNaPCwqKFAT3kHMLAUsGh8B3w7vgOKASL+QwI3NNExMdt3CA0md9nYZDnUoUw8XVFlMz7ZYxJGP2ZFJnJyvUuub6HRojcZfQJ04AcPHtyOrernZ1Zi/o9fJZaPTVYI9LcP/x6qnvJYtgrWx6VHNQcNn4kqsSwqxDQI5l/Zon/U8OeHjb76sA+XhwbTCsj1kKgSlKsy0P+sPiyJa1GgRFmsIug+J6aLlEX70nhshbUsVOkVuXDKoTgTMJxyEE4lLpzyKM53GA52SVTmwqmA4kzEcCpAOFW4cCqiOJMwnIoQTlUunEoozmQMpxKEU40LpzKKMwXDqQzhVOfCqYLiTMVwqkA4NbhwqqI40zCcqhBOTS6caijOdAynGoRTiwunOoozA8OpDuHU5sKpgeLMxHBqQDh1uHBqojizMJyaEE5dLpxaKM5sDKcWhFOPC6c2ijMHw6kN4dTnwqmD4szFcOpAOA24cOqiOPMwnLoQTkMunHooznwMpx6E8x4XTn0U53sMpz6E04gLpwGKswDDaQDhNObCaYjiLMRwGkI4Tbhw3kNxFmE470E4TblwGqE4izGcRhBOMy6cxijOEgynMYTzPhdOExTnBwynCYTTnAunKYqzFMNpCuF8wIXTDMVZhuE0g3CCuHDeR3GWYzjvQzgtuHCaozg/YjjNIZyWXDgfoDgrMJwPIJxWXDhBKM5KDCcIwgnmwmmB4qzCcFpAOK25cFqiOKsxnJYQThsunFYozhoMpxWE05YLJxjFWYvhBEM4IVw4rVGcdRhOawjnQy6cNijOegynDYTTjgunLYqzAcNpC+GEcuGEoDgbMZwQCKc9F86HKM4mDOdDCCeMC6cdirMZw2kH4YRz4YSiOD9hOKEQTgcunPYozhYMpz2E05ELJwzF+RnDCYNwIrhwwlGcrRhOOITTiQunA4rjw3A6QDiRXDgdURzCcDpCOJ25cCJQnF8wnAgIpwsXTicUZxuG0wnC6cqFE4nibMdwIiGcblw4nVGcHRhOZwinOxdOFxRnJ4bTBcLpwYXTFcXZheF0hXB6cuF0Q3F2YzjdIJyPuHC6ozh7MJzuEE4vLpweKM5eDKcHhPMxF05PFGcfhtMTwvmEC+cjFGc/hvMRhPMpF04vFOcAhtMLwunNhfMxinMQw/kYwunDhfMJinMIw/kEwvmMC+dTFOcwhvMphPM5F05vFOcIhtMbwvmCC6cPinMUw+kD4fRFcPyOFMp7OEEpclckdyVyVyZ3FXJXJXc1clcndw1y1yR3LXLXJncdctcldz1y1yd3A3I3JPd75G5E7sbkbkLupuRuRu73yd1cvDoXr5vFK1rxWlO8ChSvz8QrJ/GaRrzaEK8DxBK6WHYWS7VieVMsCYplNLH0JJZrxBKHWBYQj9Li8VM8sonHHPFoIG6nxS2ouG0Ttzri9kBMqWIaEkO3GO7EECEuK9EVRfMJ5Bc4MufLwFVvQB9lGda/LoO+bov5KOtL7OPkfoB/7DfdeWO+rO9H7q9sHJnjLoNcBDFF/wr7aP0rCLC/RcD1DwH726x0rORloJIPsN40A8g90MZZNHjTDMQAB0KAg6w3jQAcxNc0Kto0g603zWByD7HcNEUtNM0QrGmGQIBR1ptGAEbxNY2GNs1Q600zlNzRlpuG3EUsNE401jjREOIw640jEIfxNY4DbZzh1htnOLlH2DhiB2+aEVjTjIAAR1pvGgE4kq9pnGjTjLLeNKPIPdrGdVMm5qQHsHFGY40zGkIcY71xBOIYvsbR0cb52nrjfE3ub2w0zrsWrpxvsMb5BkIca71xBOJYvsZxoY3zrfXG+Zbc4+xdOWXRxhmHNc44CHG89cYRiOPtPFxNQIodPydexGSy138mYA9X3wHVhpyw8l1Ge8UsG5+PIxPjCWZiRulqcJQg9yRJc4piTZY1cQ84RdbE/DZV1sSVO03W3OSeLmsecs+QtYTknilrick9S9aSknu2rCUn9xxZS0HuubKWitzzZC0NuefLWlpyfy9r6ci9QNYykHuhrGUi9yJZy0zuxbKWldxLZC07uX+QtZzkXipruci9TNbykHu5rOUl94+ylp/cK2StILlXylohcq+SNXHjvVrWxJPSGlkrRu61sib62jpZK0nu9bJWmtwbZK0suTfKWnlyb5I1sTC2WdbEMtlPsiYWzbbImlhC+1nWxILaVlkTy2s+WROLbSRrYuntF1kTC3HbZE0sy22XNbFIt0PWxJLdTlkTC3i7ZE0s5+2WNbG4t0fWxFLfXlkTC3/7ZE0sA+6XNbEoeEDWxBLhQVkTC4aHZE0sHx6WNTE4HZE1sbR4VNbEQuMxWRPLjsdlTSxCnpA1sSR5UjqqMmb8OyVpMePfaVkT498ZWRPj31lZE+PfOVkT4995WRPj3wVZE+Pfr7Imxr+LsibGv99kTYx/l2RNjH+XZU2Mf1dkTYx/V2VNjH/XZE2Mf7/Lmhj/rsuaGP9uyJoY/27Kmhj//pA1Mf7dkjUx/t2WNTH+3ZE1Mf7dlTUx/t2TNTH+/SlrYvy7L2ti/PtL1sT490DWipIpH4Eqxj9TkbUSZKqyVpJMTdZKk+mQtbJkOmWtPJm6rFUk0yVrlck0ZK0qmW5Zq06mKWs1yfTIWm0yvbJWl8yEslafzESy1pDMxLLWiMwkstaEzKSy1ozMZLLWnMzkshZE5iuy1pLMFLIWTGZKWWtDZipZCyEztay1IzONrLUn81VZCyczrax1JPM1WetEZjpZ60xmelnrSmYGWetOZkZZ60lmJlnrRebrsraazMyytpbMLLK2nsyssraRzGyytpnM7LK2hcwcsraVzJyyRmS+IWvbyMwlazvIzC1ru8jMI2t7yHxT1vaRmVfWDpCZT9YOkZlf1o6QWUDWjpFZUNZOkPmWrJ0is5CsnSGzsKydI7OIrF0g821Zu0hmUVm7ROY7snaFzGKydo3M4rJ2ncwSsnaTzHdl7RaZJWXtDpmlZO0emaVl7T6ZZWTtAZllJU1XyCwnaxqZ5WXNSWYFWXORWVHW3GRWkjUPmZVlLSGZVWQtMZlVZS0pmdVkLTmZ1WUtBZk1ZC0VmTVlLQ2ZtWQtLZm1ZS0dmXVkLQOZdWUtE5n1ZC0zmfVlLSuZDWQtO5kNZS0nme/JWi4yG8laHjIby1peMpvIWn4ym8paQTKbyVohMt+XtSJkNpc1Mf9+IGti/g2SNTH/tpA1Mf+2lDUx/7aSNTH/BsuamH9by5qYf9vImph/28qamH9DZE3Mvx/Kmph/28mamH9DZU3Mv+1lTcy/YbIm5t9wWRPzbwdZE/NvR1kT82+ErIn5t5Osifk3UtbE/NtZ1sT820XWxPzbVdbE/NtN1sT8213WxPzbQ9bE/NtT1sT8+5Gsifm3l6yJ+fdjWRPz7yeyJubfT2VNzL+9ZU3Mv32eXJaD3jlhZ3+bn1lccIOWPY1+ZHyFLnlNhFbmTKv7kbBawlbSzC8s1hK2cmr2/VdXTu3UD/ZrD+aXPPXTDyGPt98UkA6j9w61dox6qcAGQx8f+m1+hR36bXURuZSIDJ3IbvYP3AB23PtbPVkaO/y7r3jPhR3+fZjD3/xMDECY/xGr1yF2KQyABoHDUK4jNjpeoBKKu5/+yLuL0hDtQJZGHCACY5PNoPh5c2IOkn6uwG1xTAF+6yEK/AkGW3UaqKbKiLDRmDtU74OtDtJWf/8h5kdgSkOd5Usx/QT+/YfjNn//wRwSm4yKt99/MIdg2aJsvJ18WHPYEHiU5eqNaRDM/5jVIRj6/QcT2odnRkFD8FEo1zGg/1m9ZMWlKFBYfv8h5rZ/ENqXTmE/AjkIqvShXDiDUZzTGM5gCCeaC2cIinMGw8EuiWFcOFEozlkMJwrCGc6FA4/D5zAc7F5nBBcOPCGfx3CgB1ZzJBfOMBTnAoaD3feP4sIZjuL8iuEMh3BGc+GMQHEuYjjQ5mFzDBfOSBTnNwxnJITzNRfOKBTnEoYzCsL5hgtnNIpzGcOBNkObY7lwxqA4VzCcMRDOt1w4X6M4VzGcryGccVw436A41zAcaHO3OZ4LZyyK8zuGMxbCmcCF8y2Kcx3D+RbC+Y4LZxyKcwPDgTarmxO5cMajODcxnPEQziQunAkozh8YzgQIZzIXzncozi0M5zsIZwoXzkQU5zaGMxHCmcqFMwnFuYPhTIJwpnHhTEZx7mI4kyGc6Vw4U1CcexjOFAhnBhfOVBTnTwxnKoQzkwtnGopzH8OZBuHM4sKZjuL8heFMh3Bmc+HMQHEeYDgzIJw5XDgzQRwzAYYzE8KZy4UzC8VRMJxZEM48LpzZKI6K4cyGcOZz4cxBcTQMZw6E8z0XzlwUx4HhzIVwFnDhzENxnBjOPAhnIRfOfBRHx3DmQziLuHC+R3FcGM73EM5iLpwFKI6B4SyAcJZw4SxEcdwYzkII5wcunEUojonhLIJwlnLhLEZxPBjOYghnGRfOEhTHi+EsgXCWc+H8gOIkxHB+gHB+5MJZiuIkwnCWQjgruHCWoTiJMZxlEM5KLpzlKE4SDGc5hLOKC+dHFCcphvMjhLOaC2cFipMMw1kB4azhwlmJ4iTHcFZCOGu5cFahOK9gOKsgnHVcOKtRnBQYzmoIZz0XzhoUJyWGswbC2cCFsxbFSYXhrIVwNnLhrENxUmM46yCcTVw461GcNBjOeghnMxfOBhTnVQxnA4TzExfORhQnLYazEcLZwoWzCcV5DcPZBOH8zIWzGcVJh+FshnC2cuH8hOKkx3B+gnB8XDhbUJwMGM4WCIe4cH5GcTJiOD9DOL9w4WxFcTJhOFshnG1cOD4U53UMxwfhbOfCIRQnM4ZDEM4OLpxfUJwsGM4vEM5OLpxtKE5WDGcbhLOLC2c7ipMNw9kO4ezmwtmB4mTHcHZAOHu4cHaiODkwnJ0Qzl4unF0oTk4MZxeEs48LZzeK8waGsxvC2c+FswfFyYXh7IFwDnDh7EVxcmM4eyGcg1w4+1CcPBjOPgjnEBfOfhTnTQxnP4RzmAvnAIqTF8M5AOEc4cI5iOLkw3AOQjhHuXAOoTj5MZxDEM4xLpzDKE4BDOcwhHOcC+cIilMQwzkC4ZzgwjmK4ryF4RyFcE5y4RxDcQphOMcgnFNcOMdRnMIYznEI5zQXzgkUpwiGcwLCOcOFcxLFeRvDOQnhnOXCOYXiFMVwTkE457hwTqM472A4pyGc81w4Z1CcYhjOGQjnAhfOWRSnOIZzFsL5lQvnHIpTAsM5B+Fc5MI5j+K8i+Gch3B+48K5gOKUxHAuQDiXuHB+RXFKYTi/QjiXuXAuojilMZyLEM4VLpzfUJwyGM5vEM5VLpxLKA72S2TGJQjnGhfOZRSnHIZzGcL5nQvnCopTHsO5AuFc58K5iuJUwHCuQjg3uHCuoTgVMZxrEM5NLpzfUZxKGM7vEM4fXDjXUZzKGM51COcWF84NFKcKhnMDwrnNhXMTxamK4dyEcO5w4fyB4lTDcP6AcO5y4dxCcapjOLcgnHtcOLdRnBoYzm0I508unDsoTk0M5w6Ec58L5y6KUwvDuQvh/MWFcw/FqY3h3INwHnDh/Ini1MFw/kRwPAm4cO6jOHUxnPsQjsKF8xeKUw/D+QvCUblwHqA49TGcBxCOxoTjToDiNMB+5jsBhOPgwlFQnIYYjgLhOLlwVBTnPQxHhXB0LhwNxWmE4WgQjosLx4HiNMZwHBCOwYXjRHGaYDhOCMfNhaOjOE0xHB3CMblwXChOMwzHBeF4uHAMFOd9DMeAcLxcOG4UpzmG44ZwEnLhmCjOBxiOCeEk4sLxoDhBGI4HwknMheNFcVpgOF4IJwkXTkIUpyWGkxDCScqFkwjFaYXhJIJwknHhJEZxgjGcxBBOci6cJChOawwnCYTzChdOUhSnDYaTFMJJwYWTDMVpi+Ekg3BScuEkR3FCMJzkEE4qLpxXUJwPMZxXIJzUXDgpUJx2GE4KCCcNF05KFCcUw0kJ4bzKhZMKxWmP4aSCcNJy4aRGccIwnNQQzmtcOGlQnHAMJw2Ek44L51UUpwOG8yqEk54LJy2K0xHDSQvhZODCeQ3FicBwXoNwMnLhpENxOmE46SCcTFw46VGcSAwnPYTzOhdOBhSnM4aTAcLJzIWTEcXpguFkhHCycOFkQnG6YjiZIJysXDivozjdMJzXIZxsXDiZUZzuGE5mCCc7F04WFKcHhpMFwsnBhZMVxemJ4WSFcHJy4WRDcT7CcLJBOG9w4WRHcXphONkhnFxcODlQnI8xnBwQTm4unJwozicYTk4IJw8XzhsozqcYzhsQzptcOLlQnN4YTi4IJy8XTm4Upw+GkxvCyYfgVA9uHx7RvXJYSOSwfIcTTCBzKJnRZA4jcziZI8gcSeYoMkeTOYbMr8n8hsyxZH5L5jgyx5Mp8n9H5kQyJ5E5mcwpZE4lcxqZ08mcQeZMMmeROZvMOWTOJXMemfPJ/J7MBWQuJHMRmYvJXELmD2QuJXMZmcvJ/JHMFWSuJHMVmavJXEPmWjLXkbmezA1kbiRzE5mbyfyJzC1k/kzmVjJ9ZBKZv5C5jcztZO4gcyeZu8jcTeYeMveSuY/M/WQeIPMgmYfIPEzmETKPknmMzONkniDzJJmnyDxN5hkyz5J5jszzZF4g81cyL5L5G5mXyLxM5hUyr5J5jczfybxO5g0yb5L5B5m3yLxN5h0y75J5j8w/ybxP5l9kPiBPzDY88qjk0cjjII+TPDp5XOQxyOMmjylex4tX2OK1r3hVKl4vildy4jWWePUjXpeIVwxiWV4sZYvlX7FkKpYZxdKcWM4SS0Bi2UQsNYjHc/FIKx4DxaOTeNwQt+jitlbcCorbJ3HLIaZpMbWJ6UAMoWLYEZeq6N6iS0x91N5PdOMo6FfgPfkDd00nJToK5bJ6MshQ5AIyB4pCDoVYCgD+0x9VVc0O0fmGrRN/Qp6CT139gcokCjUYGCTKiLJjBX+LY4iKqbiCaA1jh3Z4CkI4hSy2w/qH7VDIZt+ASm4OhEpe2HoPKkyeIpZ7UClRILQNsSMuRDYE8G3rTSMA3+ZrGhVtmqLWm6Yoed55quSBnLSyw4D61oA8ZSGuYlzX/jtoM2HnQHjegXCKW+9gopmK83UwDe1gJax3sBLkedfytf+uhWsfOzVBZEMAS1pvGgFYkq9pHGjTlLLeNKXIU9rO/VAZpMITHYZyHeG6tEujrYCdHOApDVVNWev9R7RCWTutUA6q36NQrsB3pYq9Ll4Ou7krD1Tb/DKhQS3blQnvVqFzWMuyQaGhvafUKV2jYvno3tMahkSGBXfqJOJktFzM0mT2Ryocan+zP4RbgaG6y4iwUUA1zioTERIaGtImpgaHmyN6T60bEtYmNHhY1FCgpyCDjKWAJeM74LvxHVAMEPEfErihiY6J2b5DaDB5KsYmK6EOFeLpiqqY8ckekzD6MSsykZO7DLm/g0aLL8jsG6ADP3jw4HZsVT8/sxLzf/wqsXJsskqgv33491D1VMayVbE+Lj2qOWj4TGJ1rXgo3CCYv9XF3ajhzw8bffVhH64MDaZVkOshSW4oVx6g/1l9WBLXokCJslhF0H1OTBepiPalSdgKa0Wo0qty4VRCcSZjOJUgnGpcOJVRnCkYDnZJVOfCqYLiTMVwqkA4NbhwqqI40zCcqhBOTS6caijOdAynGoRTiwunOoozA8OpDuHU5sKpgeLMxHBqQDh1uHBqojizMJyaEE5dLpxaKM5sDKcWhFOPC6c2ijMHw6kN4dTnwqmD4szFcOpAOA24cOqiOPMwnLoQTkMunHooznwMpx6E8x4XTn0U53sMpz6E04gLpwGKswDDaQDhNObCaYjiLMRwGkI4Tbhw3kNxFmE470E4TblwGqE4izGcRhBOMy6cxijOEgynMYTzPhdOExTnBwynCYTTnAunKYqzFMNpCuF8wIXTDMVZhuE0g3CCuHDeR3GWYzjvQzgtuHCaozg/YjjNIZyWXDgfoDgrMJwPIJxWXDhBKM5KDCcIwgnmwmmB4qzCcFpAOK25cFqiOKsxnJYQThsunFYozhoMpxWE05YLJxjFWYvhBEM4IVw4rVGcdRhOawjnQy6cNijOegynDYTTjgunLYqzAcNpC+GEcuGEoDgbMZwQCKc9F86HKM4mDOdDCCeMC6cdirMZw2kH4YRz4YSiOD9hOKEQTgcunPYozhYMpz2E05ELJwzF+RnDCYNwIrhwwlGcrRhOOITTiQunA4rjw3A6QDiRXDgdURzCcDpCOJ25cCJQnF8wnAgIpwsXTicUZxuG0wnC6cqFE4nibMdwIiGcblw4nVGcHRhOZwinOxdOFxRnJ4bTBcLpwYXTFcXZheF0hXB6cuF0Q3F2YzjdIJyPuHC6ozh7MJzuEE4vLpweKM5eDKcHhPMxF05PFGcfhtMTwvmEC+cjFGc/hvMRhPMpF04vFOcAhtMLwunNhfMxinMQw/kYwunDhfMJinMIw/kEwvmMC+dTFOcwhvMphPM5F05vFOcIhtMbwvmCC6cPinMUw+kD4fTlwvkMxTmG4XwG4XzJhfM5inMcw/kcwunHhfMFinMCw/kCwvmKC6cvinMSw+kL4fRHcPyOFMp/OEEp8lQlTzXyVCdPDfLUJE8t8tQmTx3y1CVPPfLUJ08D8jQkz3vkaUSexuRpQp6m5GlGnvfJ05w8H5AniDwtyNNSvDoXr5vFK1rxWlO8ChSvz8QrJ/GaRrzaEK8DxBK6WHYWS7VieVMsCYplNLH0JJZrxBKHWBYQj9Li8VM8sonHHPFoIG6nxS2ouG0Ttzri9kBMqWIaEkO3GO7EECEuK9EVRfMJ5Bc4MmdA4Ko3oI+yDOtfl0Fft8V8lDUA+zh5IOAf+013/pgv6weSZ5CNI3M8FZCLIKbog7CP1gdBgIMtAq5/CDjYZqVjJa8AlXyI9aYZQp4oG2fR4E0ThQFGQYBDrTeNABzK1zQq2jTR1psmmjzDLDdNSQtNMwxrGmyIG269aQTgcL6m0dCmGWG9aUaQZ6TlpiFPMQuNMxJrnJEQ4ijrjSMQR/E1jgNtnNHWG2c0ecbYOGIHb5oxWNOMgQC/tt40AvBrvqZxok3zjfWm+YY8Y21cNxViTnoAG2cs1jhjIcRvrTeOQPyWr3F0tHHGWW+cceQZb6Nxyli4csZjjTMeQpxgvXEE4gS+xnGhjfOd9cb5jjwT7V05FdHGmYg1zkQIcZL1xhGIk+w8XE1Gih0/J17EZLLXfyZjD1dTgGpDTliZktFeMSvG5+PI1HiCmZpRuhocJcgzTdKcoljTZU3cA86QNTG/zZQ1ceXOkjU3eWbLmoc8c2QtIXnmylpi8syTtaTkmS9rycnzvaylIM8CWUtFnoWyloY8i2QtLXkWy1o68iyRtQzk+UHWMpFnqaxlJs8yWctKnuWylp08P8paTvKskLVc5Fkpa3nIs0rW8pJntazlJ88aWStInrWyVog862StCHnWy1pR8myQNXGDvlHWRF/bJGviKWuzrJUmz0+yVpY8W2StPHl+lrWK5Nkqa5XJ45M1sYBGsiaW036RNbG4tk3WxFLbdlkTC287ZE0sw+2UNbEot0vWxBLdblkTC3Z7ZE0s3+2VNbGYt0/WxNLeflkTC30HZE0s+x2UNbEIeEjWxJLgYVkTC4RHZE0sFx6VNbF4eEzWxFLicVkTg9MJWRPLjCdlTSw6npI1sQR5WtbEguQZWRPLk2eloypjxr9zkhYz/p2XNTH+XZA1Mf79Kmti/Lsoa2L8+03WxPh3SdbE+HdZ1sT4d0XWxPh3VdbE+HdN1sT497usifHvuqyJ8e+GrInx76asifHvD1kT498tWRPj321ZE+PfHVkT499dWRPj3z1ZE+Pfn7Imxr/7sibGv79kTYx/D2QtP3nlI0vF+OdVZK0QeVVZK0JeTdaKktcha8XI65S1EuTVZa0keV2yVpq8hqyVJa9b1sqT15S1iuT1yFpl8nplrSp5E8padfImkrWa5E0sa7XJm0TW6pI3qazVJ28yWWtI3uSy1oi8r8haE/KmkLVm5E0pa83Jm0rWgsibWtZakjeNrAWT91VZa0PetLIWQt7XZK0dedPJWnvyppe1cPJmkLWO5M0oa53Im0nWOpP3dVnrSt7MstadvFlkrSd5s8paL/Jmk7XV5M0ua2vJm0PW1pM3p6xtJO8bsraZvLlkbQt5c8vaVvLmkTUi75uyto28eWVtB3nzydou8uaXtT3kLSBr+8hbUNYOkPctWTtE3kKydoS8hWXtGHmLyNoJ8r4ta6fIW1TWzpD3HVk7R95isnaBvMVl7SJ5S8jaJfK+K2tXyFtS1q6Rt5SsXSdvaVm7Sd4ysnaLvGVl7Q55y8naPfKWl7X75K0gaw/IW1HSdIW8lWRNI29lWXOSt4qsuchbVdbc5K0max7yVpe1hOStIWuJyVtT1pKSt5asJSdvbVlLQd46spaKvHVlLQ1568laWvLWl7V05G0gaxnI21DWMpH3PVnLTN5GspaVvI1lLTt5m8haTvI2lbVc5G0ma3nI+76s5SVvc1kT8+8Hsibm3yBZE/NvC1kT829LWRPzbytZE/NvsKyJ+be1rIn5t42sifm3rayJ+TdE1sT8+6Gsifm3nayJ+TdU1sT8217WxPwbJmti/g2XNTH/dpA1Mf92lDUx/0bImph/O8mamH8jZU3Mv51lTcy/XWRNzL9dZU3Mv91kTcy/3WVNzL89ZE3Mvz1lTcy/H8mamH97yZqYfz+WNTH/fiJrYv79VNbE/Ntb1sT820fWxPz7mayJ+fdzWRPz7xeyJubfvk8uy0Ujqz/Y2d/eLy0uuEHLnuZAMgehS15ToZU5r9X9SFgtYStp3q8s1hK2curt/6+unNqpH+zXHrwDeOpnIEIeb78pINUP1i0HPT9siSwfH3vGGuuiWuGdgkNahYcVqBUc0b5zZFBkSHhY9PDYNVfvoMfpcrGqo4Rf+t3h5B1M3iHkjSLv0CePRfcMtXgEvBfYdBOFxapgsaKx07/7ixdd2Onfazj8vV+KEQjzX2u1o2HXAvRiIMkaKNdahrcsFUQRsUtmWPy8lvAOy2h9QMOG++E8w9mIf7UJbQz3CQDrihzGCmBcicNYBYwrcxgjv0ZWxY5xoKDQoeDaITuzZSDrahwV6QCMq3MYOwHjGhzGOmBck8PYBRjX4jA2AOPaHMZuwLgOh7EJGNflMAY2yir1OIy9gHF9DuOEgHEDDuNEgHFDDuPEgPF7HMZJAONGHMZJAePGHMbJAOMmHMbJAeOmHMavAMbNOIxTAMbvcxinBIybcxinAow/4DBODRgHcRinAYxbcBi/Chi35DBOCxi34jB+DTAO5jBOBxi35jBODxi34TDOABi35TDOCBiHcBhnAow/5DB+HTBux2GcGTC2eiwo9HN/jmnkmI48nbe34R4o5kP3Wcivs0PHCzqmQblmcaybQAcGasc5+k4WoHgcx2KKJd1hSBfzijcRI5AuZvWwS2hVKYIjaCeOoJEcQTtzBO3CEbQrR9BuHEG7cwTtwRG0J0fQjziC9uII+jFH0E84gvo+ZYnamyVqH5aon7FE/Zwl6hcsUfuyRP2SJWo/lqhfsUTtzxJ1AEvUgSxRB7FEHcwSdQhL1CiWqENZokazRB3GEnU4S9QRLFFHskQdxRJ1NEvUMSxRv2aJ+g1L1LEsUb9liTqOJep4lqgTWKJ+xxJ1IkvUSSxRJ7NEncISdSpL1GksUaezRJ3BEnUmS9RZLFFns0SdwxJ1LkvUeSxR57NE/Z4l6gKWqAtZoi5iibqYJeoSlqg/sERdyhJ1GUvU5SxRf2SJuoIl6kqWqKtYoq5mibqGJepalqjrWKKuZ4m6gSXqRpaom1iibmaJ+hNL1C0sUX9mibqVJaqPJSqxRP2FJeo2lqjbWaLuYIm6kyXqLpaou1mi7mGJupcl6j6WqPtZoh5giXqQJSrLN16+wyxRj7BEPcoS9RhL1OMsUU+wRD3JEvUUS9TTLFHPsEQ9yxL1HEvU8yxRL7BE/ZUl6kWWqL+xRL3EEvUyS9QrLFGvskS9xhL1d5ao11mi3mCJepMl6h8sUW+xRL3NEvUOS9S7LFHvsUT9kyXqfZaof7FEfcARlZQEPGEVnrAqT1iNJ6yDJ6yTJ6xuMSz8UxtV0Z/amAadpqTEHHgROF5VLpxqKM50DMeAcKpx4VRHcWZgOG4IpzoXTg0UZyaGY0I4NbhwaqI4szAcD4RTkwunFoozG8PxQji1uHBqozhzMJyEEE5tLpw6KM5cDCcRhFOHC6cuijMPw0kM4dTlwqmH4szHcJJAOPW4cOqjON9jOEkhnPpcOA1QnAUYTjIIpwEXTkMUZyGGkxzCaciF8x6KswjDeQXCeY8LpxGKsxjDSQHhNOLCaYziLMFwUkI4jblwmqA4P2A4qSCcJlw4TVGcpRhOaginKRdOMxRnGYaTBsJpxoXzPoqzHMN5FcJ5nwunOYrzI4aTFsJpzoXzAYqzAsN5DcL5gAsnCMVZieGkg3CCuHBaoDirMJz0EE4LLpyWKM5qDCcDhNOSC6cVirMGw8kI4bTiwglGcdZiOJkgnGAunNYozjoM53UIpzUXThsUZz2GkxnCacOF0xbF2YDhZIFw2nLhhKA4GzGcrBBOCBfOhyjOJgwnG4TzIRdOOxRnM4aTHcJpx4UTiuL8hOHkgHBCuXDaozhbMJycEE57LpwwFOdnDOcNCCeMCyccxdmK4eSCcMK5cDqgOD4MJzeE04ELpyOKQxhOHginIxdOBIrzC4bzJoQTwYXTCcXZhuHkhXA6ceFEojjbMZx8EE4kF05nFGcHhpMfwunMhdMFxdmJ4RSAcLpw4XRFcXZhOAUhnK5cON1QnN0YzlsQTjcunO4ozh4MpxCE050LpweKsxfDKQzh9ODC6Yni7MNwikA4PblwPkJx9mM4b0M4H3Hh9EJxDmA4RSGcXlw4H6M4BzGcdyCcj7lwPkFxDmE4xSCcT7hwPkVxDmM4xSGcT7lweqM4RzCcEhBOby6cPijOUQznXQinDxfOZyjOMQynJITzGRfO5yjOcQynFITzORfOFyjOCQynNITzBRdOXxTnJIZTBsLpy4XzJYpzCsMpC+F8yYXTD8U5jeGUg3D6ceF8heKcwXDKQzhfceH0R3HOYjjQz2N7+tvAgUo5Bcno/Yq8/bEPjSpy1Ls5kEzol5dERs85rN4rIfVuDuXCiUZxzmM4lSGcaC6cYSjOBQynCoQzjAtnOIrzK4YD/QK4OZwLZwSKcxHDqQbhjODCGYni/IbhVIdwRnLhjEJxLmE4NSCcUVw4o1GcyxhOTQhnNBfOGBTnCoZTC8IZw4XzNYpzFcOpDeF8zYXzDYpzDcOpA+F8w4UzFsX5HcOpC+GM5cL5FsW5juHUg3C+5cIZh+LcwHDqQzjjuHDGozg3MZwGEM54LpwJKM4fGE5DCGcCF853KM4tDOc9COc7LpyJKM5tDKcRhDORC2cSinMHw2kM4UziwpmM4tzFcJpAOJO5cKagOPcwnKYQzhQunKkozp8YTjMIZyoXzjQU5z6G8z6EM40LZzqK8xeG0xzCmc6FMwPFeYDhfADhzODCmQnieBNgOEEQzkwunFkojoLhtIBwZnHhzEZxVAynJYQzmwtnDoqjYTitIJw5XDhzURwHhhMM4czlwpmH4jgxnNYQzjwunPkojo7htIFw5nPhfI/iuDCcthDO91w4C1AcA8MJgXAWcOEsRHHcGM6HEM5CLpxFKI6J4bSDcBZx4SxGcTwYTiiEs5gLZwmK48Vw2kM4S7hwfkBxEmI4YRDOD1w4S1GcRBhOOISzlAtnGYqTGMPpAOEs48JZjuIkwXA6QjjLuXB+RHGSYjgREM6PXDgrUJxkGE4nCGcFF85KFCc5hhMJ4azkwlmF4ryC4XSGcFZx4axGcVJgOF0gnNVcOGtQnJQYTlcIZw0XzloUJxWG0w3CWcuFsw7FSY3hdIdw1nHhrEdx0mA4PSCc9Vw4G1CcVzGcnhDOBi6cjShOWgznIwhnIxfOJhTnNQynF4SziQtnM4qTDsP5GMLZzIXzE4qTHsP5BML5iQtnC4qTAcP5FMLZwoXzM4qTEcPpDeH8zIWzFcXJhOH0gXC2cuH4UJzXMZzPIBwfFw6hOJkxnM8hHOLC+QXFyYLhfAHh/MKFsw3FyYrh9IVwtnHhbEdxsmE4X0I427lwdqA42TGcfhDODi6cnShODgznKwhnJxfOLhQnJ4bTH8LZxYWzG8V5A8MZAOHs5sLZg+LkwnAGQjh7uHD2oji5MZxBEM5eLpx9KE4eDGcwhLOPC2c/ivMmhjMEwtnPhXMAxcmL4URBOAe4cA6iOPkwnKEQzkEunEMoTn4MJxrCOcSFcxjFKYDhDINwDnPhHEFxCmI4wyGcI1w4R1GctzCcERDOUS6cYyhOIQxnJIRzjAvnOIpTGMMZBeEc58I5geIUwXBGQzgnuHBOojhvYzhjIJyTXDinUJyiGM7XEM4pLpzTKM47GM43EM5pLpwzKE4xDGcshHOGC+csilMcw/kWwjnLhXMOxSmB4YyDcM5x4ZxHcd7FcMZDOOe5cC6gOCUxnAkQzgUunF9RnFIYzncQzq9cOBdRnNIYzkQI5yIXzm8oThkMZxKE8xsXziUUpyyGMxnCucSFcxnFKYfhTIFwLnPhXEFxymM4UyGcK1w4V1GcChjONAjnKhfONRSnIoYzHcK5xoXzO4pTCcOZAeH8zoVzHcWpjOHMhHCuc+HcQHGqYDizIJwbXDg3UZyqGM5sCOcmF84fKE41DGcOhPMHF84tFKc6hjMXwrnFhXMbxamB4cyDcG5z4dxBcWpiOPMhnDtcOHdRnFoYzvcQzl0unHsoTm0MZwGEc48L508Upw6GsxDC+ZML5z6KUxfDWQTh3OfC+QvFqYfhLIZw/uLCeYDi1MdwlkA4D5hwPAlQnAYYzg8IjicBF46C4jTEcJZCOAoXjorivIfhLINwVC4cDcVphOEsh3A0LhwHitMYw/kRwnFw4ThRnCYYzgoIx8mFo6M4TTGclRCOzoXjQnGaYTirIBwXF46B4ryP4ayGcAwuHDeK0xzDWQPhuLlwTBTnAwxnLYRjcuF4UJwgDGcdhOPhwvGiOC0wnPUQjpcLJyGK0xLD2QDhJOTCSYTitMJwNkI4ibhwEqM4wRjOJggnMRdOEhSnNYazGcJJwoWTFMVpg+H8BOEk5cJJhuK0xXC2QDjJuHCSozghGM7PEE5yLpxXUJwPMZytEM4rXDgpUJx2GI4PwknBhZMSxQnFcAjCScmFkwrFaY/h/ALhpOLCSY3ihGE42yCc1Fw4aVCccAxnO4SThgvnVRSnA4azA8J5lQsnLYrTEcPZCeGk5cJ5DcWJwHB2QTivceGkQ3E6YTi7IZx0XDjpUZxIDGcPhJOeCycDitMZw9kL4WTgwsmI4nTBcPZBOBm5cDKhOF0xnP0QTiYunNdRnG4YzgEI53UunMwoTncM5yCEk5kLJwuK0wPDOQThZOHCyYri9MRwDkM4WblwsqE4H2E4RyCcbFw42VGcXhjOUQgnOxdODhTnYwznGISTgwsnJ4rzCYZzHMLJyYXzBorzKYZzAsJ5gwsnF4rTG8M5CeHk4sLJjeL0wXBOQTi5uXDyoDifYTinIZw8XDhvojifYzhnIJw3uXDyojhfYDhnIZy8XDj5UJy+GM45CCefDRyklJ7ySEbvAPIOHArhWP3ANQoLe4En7K88YS/yhP2NJ+wlnrCXecJe4Ql7lSfsNZ6wv/OEvc4T9gZP2Js8Yf/gCXuLJ+xtnrB3eMLe5Ql7jyfsnzxh7/OE/Ysn7AOWsGoCnrAKT1iVJ6zGE9bBE9bJE1bnCeviCWvwhHXzhDV5wnp4wnp5wlrdiDkUeCSqQN7BmHsiHqjEPFAjMPckPFBJecIm4wmbnCfsKzxhU/CETckTNhVP2NQ8YdPwhH2VJ2xanrCv8YRNxxM2PU/YDDxhM/KEzcQT9nWesJl5wmbhCZuVJ2w2nrDZecLm4AmbkyfsGzxhc/GEzc0TNg9P2Dd5wublCZuPJ2x+nrAFeMIW5An7Fk/YQjxhC/OELcIT9m2esEV5wr7DE7YYT9jiPGFLWA2L/NZFBcj6XR6ikjxhS/GELc0TtgxP2LI8YcvxhC3PE7YCT9iKPGEr8YStzBO2Ck/Yqjxhq/GErc4TtgZP2Jo8YWvxhK3NE7YOT9i6PGHr8YStzxO2AU/Yhjxh3+MJ24gnbGOesE14wjblCduMJ+z7PGGb84T9gCdsEE/YFjxhW/KEbcUTNpgnbGuesG14wrblCRvCE/ZDnrDteMKG8oRtzxM2jCdsOE/YDjxhO/KEjeAJ24knbCRP2M48YbvwhO3KE7YbT9juPGF78ITtyRP2I56wvXjCfswT9hOesJ/yhO3NE7YPT9jPeMJ+zhP2C56wfXnCfskTth9P2K94wvbnCTuAJ+xAnrCDeMIO5gk7hCdsFE/YoTxho3nCDuMJO5wn7AiesCN5wo7iCTuaJ+wYnrBf84T9hifsWJ6w3/KEHccTdjxP2Ak8Yb/jCTuRJ+wknrCTecJO4Qk7lSfsNJ6w03nCzuAJO5Mn7CyesLN5ws7hCTuXJ+w8nrDzecJ+zxN2AU/YhTxhF/GEXcwTdglP2B94wi7lCbuMJ+xynrA/8oRdwRN2JU/YVTxhV/OEXcMTdi1P2HU8YdfzhN3AE3YjT9hNPGE384T9iSfsFp6wP/OE3coT1scTlnjC/sITdhtP2O08YXfwhN3JE3YXT9jdPGH38ITdyxN2H0/Y/TxhD/CEPcgT9hBP2MM8YY/whD3KE/YYT9jjPGFP8IQ9yRP2FE/Y0zxhz/CEPcsT9hxPWJ4Td1WeE3dVnhN3VZ4Td1WeE3dVnhN3VZ4Td1WeE3dVnhN3VZ4Td9XfecLynLir8py4q/KcuKvynLir8py4q/KcuKvynLir8py4q/KcuKvynLir8py4q/KcuKvynLir8Zy4q/GcuKvxnLir8Zy4q/GcuKvxnLir8Zy4q/GcuKvxnLir8Zy4q/GcuKvxnLir8Zy4qyXkCctzlK6WmCcszxm5Gs8ZuVoynrA8Z+RqPGfkajxn5Go8Z+RqPGfkajxn5Go8Z+RqPGfkajxn5Go8Z+RqPGfkajxn5Go8Z+RqPGfkajxn5Go8Z+RqPGfkajxn5Go8Z+RqPGfkajxn5Go8Z+RqPGfkajxn5Go8Z+RqPGfkajxn5Go8Z+RqPGfkajxn5Go8Z+RqBXjC8pyRq/GckavxnJGr8ZyRq/GckavxnJGr8ZyRq/GckavxnJGr8ZyRq5XgCctz/q3Gc/6txnP+rcZz/q3Gc/6txnP+rcZz/q3Gc/6txnP+rcZz/q3Gc/6txnP+rcZz/q3Gc/6txnP+rcZz/q3Gc/6txnP+rcZz/q3Gc/6tVocnLM/5txrP+bcaz/m3Gs/5txrP+bcaz/m3Gs/5txrP+bcaz/m3Gs/5txrP+bcaz/m3Gs/5txrP+bcaz/m3Gs/5txrP+bcaz/m3Gs/5txrP+bcaz/m3Gs/5txrP+bcaz/m3Gs/5txrP+bcaz/m3Gs/5txrP+bcaz/m3Gs/5t1oET1ie8281nvNvNZ7zbzWe8281nvNvNZ7zbzWe8281nvNvNZ7zbzWe8281nvNvNZ7zbzWe8281nvNvNZ7zbzWe8281nvNvNZ7zbzWe8281nvNvNZ7zbzWe8281nvNvNZ7zbzWe8281y+ffIj/+mBWyhs7IrR7cPjyie+WwkMhhBQ9rFStWqlylarXqNWrWql2nbr36DRq+16hxk6bN3m/+QVCLlq2CW7dpG/Jhu9D2YeEdOkZ0iuzcpWu37j16ftTr4098n/p6+/r4PvN97vvC19f3pa+f7ytff98A30DfIN9g3xBflG+oL9o3zDfcN8I30jfKN9o3xve17xvfWN+3vnG+8b4Jvu98E32TfJN9U3xTfdN8030zfDN9s3yzfXN8c33zfPN93/sW+Bb6FvkW+5b4fvAt9S3zLff96FvhW+lb5VvtW+Nb61vnW+/b4Nvo2+Tb7PvJt8X3s2+rz+cj3y++bb7tvh2+nb5dvt2+Pb69vn2+/b4DvoO+Q77DviO+o75jvuO+E76TvlO+074zvrO+c77zvgu+X30Xfb/5Lvku+674rvqu+X73Xffd8N30/eG75bvtu+O767vn+9N33/eX7wEpCUhRSFFJ0UhxkOIkRSfFRYpBipsUkxQPKV5SEpKSiJTEpCQhJSkpyUhJTsorpKQgJSUpqUhJTUoaUl4lJS0pr5GSjpT0pGQgJSMpmUh5nZTMpGQhJSsp2UjJTkoOUnKS8gYpuUjJTUoeUt4kJS8p+UjJT0oBUgqS8hYphUgpTEoRUt4mpSgp75BSjJTipJQg5V1SSpJSipTSpJQhpSwp5UgpT0oFUiqSUomUyqRUIaUqKdVIqU5KDVJqklKLlNqk1CGlLin1SKlPSgNSGpLyHimNSGlMShNSmpLSjJT3SWlOygekBJHSgpSWpLQiJZiU1qS0IaUtKSGkfEhKO1JCSWlPShgp4aR0IKUjKRGkdCIlkpTOpHQhpSsp3UjpTkoPUnqS8hEpvUj5mJRPSPmUlN6k9CHlM1I+J+ULUvqS8iUp/Uj5ipT+pAwgZSApg0gZTMoQUqJIGUpKNCnDSBlOyghSRpIyipTRpIwh5WtSviFlLCnfkjKOlPGkTCDlO1ImkjKJlMmkTCFlKinTSJlOygxSZpIyi5TZpMwhZS4p80iZT8r3pCwgZSEpi0hZTMoSUn4gZSkpy0hZTsqPpKwgZSUpq0hZTcoaUtaSso6U9aRsIGUjKZtI2UzKT6RsIeVnUraS4iOFSPmFlG2kbCdlByk7SdlFym5S9pCyl5R9pOwn5QApB0k5RMphUo6QcpSUY6QcJ+UEKSdJOUXKaVLOkHKWlHOknCflAim/knKRlN9IuUTKZVKukHKVlGuk/E7KdVJukHKTlD9IuUXKbVLukHKXlHuk/EnKfVL+IuUBqQlIVUhVSdVIdZDqJFUn1UWqQaqbVJNUD6leUhOSmojUxKQmITUpqclITU7qK6SmIDUlqalITU1qGlJfJTUtqa+Rmo7U9KRmIDUjqZlIfZ3UzKRmITUrqdlIzU5qDlJzkvoGqblIzU1qHlLfJDUvqflIzU9qAVILkvoWqYVILUxqEVLfJrUoqe+QWozU4qSWIPVdUkuSWorU0qSWIbUsqeVILU9qBVIrklqJ1MqkViG1KqnVSK1Oag1Sa5Jai9TapNYhtS6p9UitT2oDUhuS+h6pjUhtTGoTUpuS2ozU90ltTuoHpAaR2oLUlqS2IjWY1NaktiG1LakhpH5IajtSQ0ltT2oYqeGkdiC1I6kRpHYiNZLUzqR2IbUrqd1I7U5qD1J7kvoRqb1I/ZjUT0j9lNTepPYh9TNSPyf1C1L7kvolqf1I/YrU/qQOIHUgqYNIHUzqEFKjSB1KajSpw0gdTuoIUkeSOorU0aSOIfVrUr8hdSyp35I6jtTxpE4g9TtSJ5I6idTJpE4hdSqp00idTuoMUmeSOovU2aTOIXUuqfNInU/q96QuIHUhqYtIXUzqElJ/IHUpqctIXU7qj6SuIHUlqatIXU3qGlLXkrqO1PWkbiB1I6mbSN1M6k+kbiH1Z1K3kuojlUj9hdRtpG4ndQepO0ndRepuUveQupfUfaTuJ/UAqQdJPUTqYVKPkHqU1GOkHif1BKknST1F6mlSz5B6ltRzpJ4n9QKpv5J6kdTfSL1E6mVSr5B6ldRrpP5O6nVSb5B6k9Q/SL1F6m1S75B6l9R7pP5J6n1S/yL1AWkJSBOTrkqaRpqDNCdpOmku0gzS3KSZpHlI85KWkLREpCUmLQlpSUlLRlpy0l4hLQVpKUlLRVpq0tKQ9ippaUl7jbR0pKUnLQNpGUnLRNrrpGUmLQtpWUnLRlp20nKQlpO0N0jLRVpu0vKQ9iZpeUnLR1p+0gqQVpC0t0grRFph0oqQ9jZpRUl7h7RipBUnrQRp75JWkrRSpJUmrQxpZUkrR1p50iqQVlG83Rdv4sVbc/GGW7yNFm+OxVte8UZWvD0VbzrFW0nxBlG87RNv5sRbNPHGS7ydEm+SxFsf8YZGvE0Rbz7EWwrxRkGs/ouVerGqLlbAxWq1WFkWq8BixVasroqVULFqKVYYxWqgWLkTq2xiRUysXomVJrEqJFZwxGqLWBkRqxhixUGsDognefHULZ6QxdOsePIUT4niiU48fYknJfFUI55AxNOCuLMXd+Hijlnc3Yo7UXHXKO7wxN2YuCuaWSc4snNEWLmgyKDDCSomUFTN4dRdhtv0eBMmSpwkabLkr6RImSp1mlfTvpYufYaMmV7PnCVrtuw5cr6RK3eeN/Pmy1+g4FuFChd5u+g7xYqXeLdkqdJlypYrXyEq6nCCbNG9J5duGRJRL3rbdtfFG1s3tYmK+ltq8LTk6xe9bcmNlF0+eZDsg8fajOhtczw7y6wcb7z/WJv1DG1e9DbTPbBY+T3LtjzW9j3D48AztPPP0H6L3jbk4MWjn5uDLz/Wrj4j319Pa+JOJ3rbwkK530n4XrZPY8UsT0cUdyjPyvmMuhEX67PEc8/4c23SM3JqU57hrs1+xp87kj7jzx3JnyE61WeJnmfEdG5+Vs4tzyiSc+cz/lwv8ow/14s+Q3TleJaY/xkxXZeelfPKM4rkuv2MPzeaPePPjebPEN3V/cRx0QdyBD18tGneMrx9h6DIkBahwc3DI4Jaiv/XJTiiU0h4WPOuEUEdOgRHHE6QpPeUsuFhnSKH9Z5aLiQiuGWk2nta5bDI4DbBEZPqFywQ+IlH/nvF0t9/Wl7++wTW/Mv3nlw2KDR0qOdxnOl1gkMFdJdgiyQJno6gWY0wO6YsrcQYVza8Q/fHSOX9y+QX/FHJE71wycvHQ8kn140M7zA0Oo6SSm1UdkqFkODQwC8/08t/WA78Q+fUR9NF71kVwiOCQ9qExdTUCNGve0QGt2zePqRTy+aPunjZxz285sMO3uBR/465NOY8esgu3apVRHCnTo+LHodeLrr31Loh7TuEBj8q4pP/6+/iRE8ODQ9qdThBlZd80VR+wYum8tMdxmktgvZ0BD1+Lpay/mXyCz6peniXJ7rn4/zSv2iPm1T+F0fsBfno0kvxd46/5Qr+4WeVCQkLilmjiazZYYRfjEmi48QAPsNQfeFqrfjC1ao+iaT50z/xLw7/Qj7xL09U+6OKKvl0uRzWylUhHrrcU2PUEwxPxXfZq7nHf++OvTqfim1aLfuT3emfwI8702MnP4c5lcNaPerikrnb6mgTR182n+7L7ti+/MTQu+jRyNs5MrR5m+DIskEdOnUODX5qjH0cxug9o1JwUIfSERFB3f1q1FQfj7KPESbWz997yqOMQ58cdNXhccZX4/wXLc5/ccX5L47hzxv7nyrxowZ7MkuVzu07VG7th2rk6j05Rhya/hnTOzgLJpB7pP6cHqmx90gt7h6px1OP1J7ukXpsj3xqOPe/QxFjQ0Tws//VymDu8BvMnxvyOTdtoktbb1unf6RHXaf4C98ZWqlo9xMFqCZudJ6YVP2SccRUnxvT9VRM1T9poac72Hu6g7+nO6z0dJd/0Z7qli6gbVxP27me09Nd8djTFainP3V799TdybP6ov74OeFZTeySm1iLvcV54o7HiM3whO6OvVl6VM6K/3Tiv3U9NsI/dSj/qf7sshly2Qy/mfdZf+CW/8Ad4A/M6dXELFevbVDYM21csZPWP39Q9p/HnFVijheLB2GR4pkqsnmIaP2gsJbBIhEZHBEWFHo4QdaX/ABU6wUfgGq98Pz54uMS8AD0jLv36c94AHp0j57qyb5b7unR9enlCC3OByDpaaFinE8LlZ5+SPv7Xyr7jydP/EsV/zvFJ/6lqv/c8cS/VPO/NX7iX6rH/ovnyX+pEfsv3if/pWbsvyR8uiUTWWvJck9HSGwtgvfpZ5tE/sGeuBdf+eS9+N+XaeW/r9KxNm6NHXH+izPOf9Ft3Ggbcf6LO85/MeP8F0+c/+KN818SxvkvicYiDwH/P/yvoXE/FklPUM+ZVbXnzKqO59xpO58zm+tP38U9NQI86xbDkP/NeHoUmP6MW0pT/jfz6ZHAT3hqLPAT/DqI9G8J/brIP/Pj3FbBMUvr4Z2Cm7cVk+LhBCle8nxY4QXnwwr/g/NhQlvz4YtSlHvhdS41wDqXoJMKOP3pG/PJ9fMXePuprP719/cIMefRrePD/1Gzw3D/B5S6nVvEMXTEvaKRPH+CfRmOFeqeK2Xh8JpdPj9Wb87Hr0zKeS5x6sudi3e5czg8bj/npOqdQ+OgsjeM/fMSIXp6aOQ/F2qq/70L1WG1e71oBwUu1OdNGNDK/TMv4fLPfSq1OGCVf+GaVJ6+UJ8YoOLu6lPLd+wcFNopjh799GKiM9nfz59JnnO9Pn7ciyPsowgp4v1x3vH043yK51yxjn+uyvkxD5lBnSPbNu8aEhkmyv7yHysrveDVWel/cBpNZmEJUX3Om7B/fR51xPkmTIvzTZgjzjdhzr+r49UXbuJyL1w3jgADT1zD6ot3Lme8rqVavjZsvZN94tl56RPPzqXF6NPw0eAz9NlvrByOoXG8nXLEz2PYv7yA+fr/9AJm+n/mlgWh4W3+2fL0eKtTw5c8u7R9wdml7QsPiVn/9V0bfz+BPM71OBF7y/G2lKlcbCLuTOVjE3FnqhCbiDtTxdhE3JkqxSbizlQ5NhF3piqxibgzVY1NxJ2pWmwi7kzVYxNxZ6oRm4g7U83YRNyZasUm4s5UOzYRd6Y6sYm4M9WNTcSdqV5sIu5M9WMTcWdqEJuIO1PD2ETcmd6LTcSdqVFsIu5MjWMTcWdqEpuIO1PT2ETcmZrFJuLO9H5sIu5MzWMTcWf6IDYRd6ag2ETcmVrEJuLO1DI2EXemVrGJuDMFxybiztQ6NuGfKe47coZbT4vjf+anl3/jvrm0uAEri/WbS1fcN5cWp0bFwptzZ+wNhPVHDFfAzXYVn7em9cK38G1euA8ojH1A/R/qA4747AOOpx9F67zw9qC27BvH/6XHmpr/0481Vf95SJzC1cH15z9Bw1eF3+65Jx675/pt3BePZlFRz9va+cwHcT3zc95RP/MvXMrwZ2w2ffupx3n/f8z87M2ez14BUJ77tNnjJT9tDnjBp80BL9zbKv33tPnf0+Z/T5v/PW3+97T5//HT5pOZ2sQm4s7UNjYRd6aQ2ETcmT6MTcSdqV1sIu5MobGJuDO1j03EnSksNhF3pvDYRNyZOsQm4s7UMTYRd6aI2ETcmTrFJuLOFBmbiDtT59hE3Jm6xCbiztQ1NhF3pm6xibgzdY9NxJ2pR2wi7kw9YxNxZ/ooNhF3pl6xibgzfRybiDvTJ7GJuDP5PvVLPSdbb7/Uc7L18Us9J9tnfqnnZPvcL/WcbF/4pZ6Tra9f6jnZvvRLPSdbP7/Uc7J95Zf6v7IgV4FxMabifwtyDxdaPmRdkOv/34Lcv9QHHPHZB56xINf5hRfkBvyvLMhF/E8vyIX9tyAXrFf4NxbkKthakDuQOyw8MqR19+YRwV2CIx4dgNOhbVCn4OadIoMiIqW1unEveaWu3Auu1JX7P7jrMOBK3cNmDrQ30fvCA245/gH3iRNssjy67jpEdGn+qIvWedxDa8V00Lox/TMqCtlb9kQxY3v+30c/dQkKDWnVvEPnFqEhLZu3FN7NY9pG6vnf/tfz/7/bb+v5P9enM8f26Uedr0FM36v1sOv9UzVYl37ysKVVD7tth4iQLkGRwc1bdw4Ta0nhYX5fIad+yd23ygt23yovfHf+jKcPI9677xNf6gV8e/Jw4A74ZuQZuZ75aiR/PJ/7FNeDUoU4D6Co+Pd1+Uqcnz2rcX72/OKfk1Vi/5zsWZ8Wx1zKMRdfrUfXXoW/L71oO5/8RgPn54yI14N+bH3NPMLGoT/PyfL8LvzUc+ezpgrj8Zye9e+72ZYRwaI1WjUP6xwaGtI6JDjin+m8Q0R4t+7/Teb/TebPZrIymWeUb1DLPup0Nf7pc3Zm8vmtHtaKyCFm75j73TFyX0nxgn31lfhp5wSx5XkcWL6q4MO75E/1/lk6+efrP9lTfWqhQTOeuiZBdyUu9wSTyoV0ib3CH5fhnz7yGPufiohe7t94D6u4ecfOomsEh0WOlotnWp2bpL/3xHMzmrGB46gPdebfhn7VkiC2fuL4K+Xhx8qx7RYwe8y31E9Hf+K+wa8fSI3heYzz/wAAJKEo/ZoFAA==",
+      "bytecode": "H4sIAAAAAAAA/+29B5gUxbc+THfPdPf0ACKgYEIkCZIzknNOksziAgusLgsuC4IigmIOwALmTBBFBcWsqAiCwhwxK0HBnHMOyHcWlBnO7tBvN3vgf3+f9/G5t+5L7XnrrXDqVFVXjZU/+7qNlYcOzTgvL3P40JzcoVk5eZm5ORnZ44cOzczJy508biwjW+JXTV/WMTtj+Nkdx07qOiFneKeM7OzpCwd06NutS/70u0/MysvJHD/erAxksgwg08GIpXLtgUyHJqYBuSpAuY5ESnUUkqkSkuloJFNlqOTHQLmqQLmqQrmqIYU/FslUC+kwxyGZaiOZ6iJlqo9YaoBkaohkaoyUqSliqRmSqTmS6XikTK0QS62RTG2QTO2QMnVALHVEMnVCMnVxgUxdjelLOuZmZWdnjSr497klZs2aM2vW6sol9v4/xvR7O4wfn5mbd0pm7tg5s2bnr67cYETf3Pcb3lHr8f5dHp0+/aTTazb+rPvkJ8bN7vT+z3O+4z8h69q9m32z7odnhzE7M63ZKv8miqiIh/uPHZ+ZNWJsTqP+mbljJuRl5GWNzcmfu7tiuLi70zWSfiPl32fOJWsWWbPJyidrzp4ln5PvX4U1gTzMANXBXF9TJYIXsBZUQKyR5mkU8DiogPlQAa8DChimF6Wm56Wkr0tJz+GedD1ZN5B1I1k3Ba+H2lA9XA/Vw80aDVUHKuANUAFv0ShgXaiAN0IFvFWpJ92ckr4lJX1rSvom7km3kXU7WXeQdWfweqgH1cNtUD3cpdFQ9aEC3g4VcL5GARtABbwDKuACpZ50V0p6fkp6QUr6Tu5JC8laRNbdZC0OXg8NoXpYCNXDPRoN1Qgq4CKogPdqFLAxVMC7oQIuUepJ96Sk701JL0lJL+aedB9Z95P1AFlLg9dDE6ge7oPqYZlGQzWFCng/VMAHNQrYDCrgA1ABH1LqSctS0g+mpB9KSS/lnrScrIfJeoSsR4PXQ3OoHpZD9fCYRkO1gAr4MFTAxzUKeDxUwEegAj6h1JMeS0k/npJ+IiX9KPekJ8l6iqynyVoRvB5aQvXwJFQPz2g0VCuogE9BBXxWo4CtoQI+DRXwOaWe9ExK+tmU9HMp6RXck1aS9TxZq8haHbwe2kD1sBKqhxc0GqotVMDnoQKu0ShgO6iAq6ACrlXqSS+kpNekpNempFdzT3qRrJfIWkfW+uD10B6qhxehekhoNFQHqIAvQQUkjQJ2hAq4Dirgy0o9KZGSppT0yynp9dyTNpD1ClmvkvVa8HroBNXDBqgeXtdoqM5QAV+BCviGRgG7QAV8FSrgm0o96fWU9Bsp6TdT0q9xT3qLrLfJeoesjcHroStUD29B9bBJqR42paTfTkm/k5LeyPWwmawtZL1L1nt71kM+oLEapHArcO7if6TDdioHL2E5qITbfAwZJ0yDSritfZiTnvf3zn7EHW8vDWP2g7Rmd+OhOtb7PgdIH3Cn+pCsj8j6mKxPtA6QPoTq4NMDd4D0EVTAzw7cAdLHUAE/V3JPn6akP0tJf56S/oR70hdkfUnWV2R9rXWA9AVUD98cuAOkL6ECfnvgDpC+ggr4nVJP+iYl/W1K+ruU9Nfck74n6weyfiTrJ60DpO+hevj5wB0g/QAV8JcDd4D0I1TAX5V60s8p6V9S0r+mpH/invQbWb+T9QdZf2odIP0G1cNfB+4A6XeogNsP3AHSH1AB/1bqSX+lpLenpP9OSf/JPWkHRUpQxKCIqXWAtAOph4h1wA6QIiWgAkYO2AFSxIAKGNXpSRErJR1JSUdT0uZcitgUcSjiUiSmdIAUsaF68A7YAVLEgQoYP2AHSBEXKmBJpZ7kpaTjKemSKekY96RSFClNkYMoUkbpAClSCqqHgw/YAVKkNFTAsgfsAClyEFTAcko96eCUdNmUdLmUdBnuSeUpcghFDqVIBaUDpEh5qB4qHrADpMghUAEPO2AHSJFDoQIertSTKqakD0tJH56SrsA96QiKHEmRoyhSSekAKXIEVA9HH7ADpMiRUAErH7ADpMhRUAGPUepJR6ekK6ekj0lJV+KeVIUiVSlSjSLVlQ6QIlWgeqhxwA6QIlWhAh6r1FA1UtIp28aRainp6txQNSlSiyLHUaR2iM3vSJ29l37VYw/ZYczWTWs2uk+VUmd32tidSvWBdblC6lGkPkUaUKRh8I5xBNQx6kF10Eij53J7Q7nqQ0VsrNR3G6WkG6ekG6SkG3JTNaFIU4o0o0jzPa8hGXOmLxqYlTMqO3NXh/PTawA6dhuctbqy0/KFjFOqHTng4YUzrz+04phmf+UMveeS1qc93K51g+vK1Jr6ZbGz5xdYHDMuO5MiLaYv7JCbmzE5nyLHU6RlyOtWfn/BPP4dYA+zs+dAVrnUmAtoFbD7w/wtMf7WQYcfZraNjtm2ac2au82GGYmtUtKtU9JtUtJteSS2o0h7inSgSMc9R6I5u9jHwi3JsdApmeycTHZJJrsmk92Sye7JZI9ksmcy2SuZ7J1M9kkm+2rdcoz027vZBcvefi5UQ/ZLSXdKSXcVs19/ipxAkQEUGRhmcsECo/5QTQzSmf+6QblOgIo4WGn+G5SSHpySHpCSHsiNNYQiJ1LkJIqcHKarnbL30l8w7KPzwpg9Na1Za58q5ZSUdJeU9JCU9KlcKadR5HSKnEGRoWFKf+beK4Wez7g9VOnPTEn3SEn3FKXPoMgwigynyIgwpc/ce+nrnVi6ZxizI9OadfapSTNT0t1T0hkp6ZFcKaMoMpoiWRQ5K8yI7wXlGgXVxNk6Tqk3lGs0VMRsnSL2gXJlQUUco+Q3z05JZ6ekx6Skz+L+lEORsRQZR5FzwtREXyhXDlQTuUo1kZuSHpuSHpeSPodrgv9PHkUmUGRiGL9w7t5L/9OQ798PVfpzU9LjU9KnCWc5iSKTKXIeRc7fM+q0AkadbCnQGmxKMnlBiEgQ62aToCaYUjjXaSIX27oA6GZ71GAkf48Fr8wsGYJW9xT/8sxO1vFUrI6BL0cjU4toCqySJZ3kZ9uQrQt9a7MEpOTCxLQwUi6AcmFSphWWIv8IkjKtyJeZHugzITsva+DwjOyMXE7OzZ++uNPYnPF5GTl5QGconNfcUO6MCfaC04fXPbZUl+8rlp17cbvV11zU7tg6qUWZkpK+IAghb8dMp8hFRehY1mXMsMwRIzJHdJqQOzGzw4gRc1MJp6ekL8pPGyQGK8nFFJlR+BtuvwY1oKF7cdDwIh8y2w7qcd2C+rFo4JmgCeKadm3B8Qx0CUUupchlFLk8+DyA7Vi14v+w2fiKoJVTSlSOP8Wlgfz2leHqBCgG28Za86oQu5gQ/1Wz9Gv7kkC1fbVWbXMfvxqr7WtUapv5r9kPtX15oNq+Vqu2L2fbWG3PVKlt5p+5H2r7skC1PUurttlzg/PCbJXaZv7ZswLOqJjlq3jUYE2Rr1KzM1kZxj9HZd7kMGgOxo+8fucfns7VCk/TncakLpgvSUlfmpK+LCV9eUp6LtfOPIpcF2bRf/3qymbviXOufeXsa1dujPUqU+7VWU8uMMrlfndm104rFpdd1OrieqEW/denpOelEV1wQnEDRW6kyE0UuTnMqhr77g96Sy6i8pYcR6BQLug1uYjSa3KRlBfkIikvyEVuSknfzI11G0Vup8gdFLlz7xOGv955gSaMu7TCcR41d2EFnq9ygM788/d5evanuS5QbS/Qqu3r2DZW4IUqtc38C2eFGeXAzA9t3F0Oib9N5VuJq8C4O7jlmSGinnwo6uDV8hVQEVrzf/5FODiEuPlgn9mnEdrFvzJSxucinfHZhS1Dz+NGFkHd+G6FMcxlvBuLa+4O2mZ2UK8KvNCQ2mqLUWeNlBzZh11s7OO0EVDgPUrThrWVbWNVd6/GtFHAf6/Oqu5ubiVsQxV62TOyJOjkho33e6Fc96nEDEvYMDbi71eZ3AqaCON/QI0/8PzjzNnreZ/4H+efDfAtJaoi2U9FMmUgmc5DMuUhmSCdw5FMdZFMOUimXCTT6UimykimgcVWT3nFlimr2CpzVLHV0/lIpgZIpguKrUzQaBlfbHQji62rZBZbmcYVWz1NLraC5/7jGGcX29fOs4ozCAwVydxdnPHG0mIKVZdWDjczLi1OMcuKScyyyntOxm7Iybjrf5Px/9nJuEuxFXzE/9V5dnyxdRWo000otkmmTrFVwZj923ZZxVamCcVmqXKxDU6oq0wsvrl//wbBw5BM2fs3JBtfbOpG7N+CQ5ZGFlum4pvv8oqtCiC6scXmC3KKTV3xDc7KxdZ9i2/lVYyLz2BrEyhWL9bVyR4xcCzwkeX+Lm6oxdT92M7gg0Grq5jPj77dsWNHykb9Q2rnRw/57ScXlKQgG9Jqy3XOj5bPhsq4PGibpZwf5YOb/9ZWdKG7TOPA5mF0/CB1gayMHw55+vMANswe0R5mEEVKBT+q9SHFI2wbK/BjKh9SMP9jgQ8lSicvIc0p/gECWXyALRbHSNp5XQjd1dmZOeW62ePJ5BPFdxXqcSzbE5WDH1Pu3DaEhmD8TI2ZdrcD9OcfFoIf0v/APKzb7L2U+bs+A3occmdPIIzxM6Fcw4DuHLxdlrNLx1zzkyr94rGCqoT4sRp/SsVZP8mGsVp6OmAtzZpbHJ3yH/IV+627FRaCfS1RUJHYhj/0W3uRZzQ6ZYB45dl9mEFhx/kgVpYVevPdc8nkyuKb757Dsq0MebL04Bx40Pj7++cgWytD+Gh/qwU+Ghs0y6FSPh/UR2EOGquiVSoO+nk2jI2S1TriV0O5XlARj7uIoL/XmA/xP82DCMr4DDtMrKBrVYKNgoH034dYfpn+O/v970Os/z7EKvHfh1gl/kc+xEL2PoPPeit40ocyvsDzLjbrvai9+1kz0N7nSzp7nzXZMtZw6xR2Ppl93ayAHQJ8MWUF1MjrQ1Spn9VaLAopYy2ohEF/LBoLvtazYWwYIL8FjSwcSXzF5wUcLTWK0QeFqVO/mjqOzWI9MwHV+8sK7V7QM5F1ONYzoZ/qjmxQcFpc1xsCLx3i84rdPQczeGxxG6xR3Ab9tq32NImMitoWMiYsIE9t/5Kl7JG9kky+imrfUEye7pUwW2Qb+O8w9wH9MnzktWIS81rw8y2r9pzianNI6usKESXX88ug08em0Td0drowH/xmQB+MxdwJntTRvv0aVktvacfc9QLF3G/rxNz12DLmkt5RiLmZ/Z2gMfdsdBG2DjtWHqPC/yZ3IIw/J+hoxE4vNkKHeWOgXDkhOp5fCetz0yOTDPbzNptUGnEjG8acxeZimuI27+PKpE4xrkzC1KlfTTVgs1hosQmq9y1BnXTKMWvxLNB27NixLezp6bvJ5HvFd3r6LpbtvcphXrxKQIei70KN9x5Qs8EPRTcxvcacUuCwENeLOax3oFxbQzhevz/gIbhVfcEKxDbBDNYtboN1AhjEYtB16GlnQWwwKwA90u8bFtvitmGgxe22ZPJ91KNuLabJclvlffXtG3w90G9hffsHyeSHxefbP8CyfRjKt2+AfPsHkOf6EKjZ4L59K9Nr+PYC8Vig95ECe02Y/WMF9mNh9k9Ugmxekb+O8X+qwF8DVv+ZlvpXMf7PtdbJoP4vtPS/gvF/ifD3yRwzNndyj5ysvDkltpRoz+OVBw33XO483IJciayDTVGkzf+J/xbt0hO0Xt2d9boVq9evgHpdvKsc/cbll5jzPP8JRb4Os425FXXyX2NrxK8hgd8EFLhqp8BvQlY6VnLss+1vgzfNtxT5LnDT1AvQNN9hAr+DBH4fvGlY4Pd6TWOiTfND8Kb5gSI/Bm6augGa5kesaX6EBP4UvGlY4E96TWOhTfNz8Kb5mSK/BD9balhcZ0sNIV2/hjhbgvrNL9BMzRl/xTrYL5Cc34J3MG6m3/Q6WATtYL8H72C/U+SPwGO/ToCx/wfWNH9AAv8M3jQs8E+9pomiTfNX8Kb5iyLbQ5w4bi3Y8AAbZzvWONshiX8HbxyW+Lde49ho4+wI3jg7KBrm9CsK/UBasZ1+hfO70RJgR2M1SEGjJaCqMYP3H24FU6//OGD/iVqB+0/Uomgk3ODehrZiBGucCCQxGrhxCiRGQyy8CyQW41olahfPpm7Urix9QBuKOiF+/SbqAnuuoru4FI2FofL8FxaSyqNoPAxVSf9AWVKVpGipMFSl/UMmSVWaogeFoSrjHwJIqjIUPTgMVVn/CU1SlaVouTBU5f19n6QqT9FDwlAd6u+QJdWhFK0QhqqiL1VMUlWk6GFhqA73pfIk1eEUPSIM1ZG+VHFJdSRFjwpDVcmXqqSkqkTRo8NQVfalKiWpKlP0mDBUVXypSkuqKhStGoaqmi/VQZKqGkWrh6Hy/665jKSqQdFjw1D5f+R9sKSqSdFaYaiO86UqK6mOo2jtMFT+5+zlJFUditYNQ+X/0UF5SVWPovXDUDXwpTpEUjWgaMMwVI18qQ6VVI0o2jgMlf8PKleQVE0o2jQMVTNfqoqSqhlFm4ehauFLdZikakHR48NQtfSlOlxStaRoqzBUrX2pjpBUrSnaJgxVW1+qIyVVW4q2C0PV3pfqKEnVnqIdwlB19KWqJKk6UrRTGKrOvlRHS6rOFO0ShqqrL5VcX0W7UrRbGKruvlTHSKruFO0RhqqnL1UVSdWTor3CUPX2paoqqXpTtE8Yqr6+VNUkVV+K9gtD1d+Xqrqk6k/RE8JQDfClqiGpBlB0YBiqQb5Ux0qqQRQdHIZqiC9VTUk1hKInhqE6yZeqlqQ6iaInh6E6xZfqOEl1CkVPDUN1mi9VbUl1GkVPD0N1hi9VHUl1BkWHhqHyfxOxrqQ6k6IZYaj8312rJ6mGUXR4GKoRvlT1JdUIimaGoRrpS9VAUo2k6KgwVKN9qRpKqtEUzQpDdZYvVSNJdRZFzw5Dle1L1VhSZVN0TBgq/4OQJpIqh6Jjw1CN86VqKqnGUfScMFS5vlTNJFUuRceHofL/ufnmkiqPohPCUE30pWohqSZS9NwwVJN8qY6XVJMoOjkM1Xm+VC0l1XkUPT8M1RRfqlaSagpFLwhDNdWXqrWkmkrRC8NQTfOlaiOpplF0ehiqi3yp2kqqiyh6cRiqGb5U7STVDIpeEvTULLrznjF2IzB6acBTY/CSNXRvKHoZcPQV/MiQxb+Bib9c4Vvhmuj99ugVCuw71WPfqUevVOCvAau/SkX9Cpj/aoQ/5TttY0uJO7jHcLNxzXHx2cIB/+76v/+K97+Q37Eb7EbZmWH97hqg3yUnAaNgEriGoteG+Y59C3jTGSv4TI0BG6DiZgWvuFkUnR3im6dNXN+Qt+GMM7HPaq6FJOYH9Enmfz7pf/6/8D7pMu5Q2NseM0IMbSC649EH3eiMYg4AsgVpSboJs+DTNHYTc0IG2cX4SER0roqD5VaYi9XvvIA1xw52HkWvUy3T9cHLdD1FbwhztWgTOjdch7n86yCBN2o1+o3Y0L9ca+jfgA39G6Baugka+pcHH/rcWW5SXV/fDHxyGap9b4Z+5y56GVTKW4BSimF2C0VvDVlyrOZuCz70b6Po7SE+o95EkV/RwX8rNvhvhSTeoTX478AG/9Vag/92bPDfDtXSndDgvzr44OfucqfevG+h8/5dWr3gLmygzQ8+0OZTdIFqmRYGL9NCii4Kc3cNnvcXYEN/ASTwbq1GB38lb5bW0F+EDf1FUC0thob+rOBDnzvLYtV5/x5fc5Fw7XsPMO9vR+f9e4FSimF2L0WXhJtjN6P3yGysiu87wBtS9wffkLqfog+E2NV+h/8MOneJLlVYIxsFA4ZLvlR1pbcseG0uo+iD4WrzQaw2H1JYduysTS75Q/sQ9vvkNNHzt+XB63w5RR8OV+cPY3X+iEK0t7POueSPqMYsjwavzUcp+li42nwMq83HFSbQnbXJJX98HyYwn5wRtAc/EbzOn6Dok6EmsKiBRopLsEhxCSTxqYDTXD7ahZ5EWwz76djo08F7EbfF0/v2Orn/XZCU18mjK3ReJ2/ClqGXHKPP+FdkGPZndF4n505iYMuJmzX4C/refRj/LQH5wfcZnoXc581QrltCdDy/Ejblpkd8TVNI7XMqjfgsG8YcyEqAH7mbv3IfXydv5F8O9HXyUHXqV1PN2Cw2w0A/aRtFfk833Qu28O9eoNssQX4Syj+Xz+Pw+/AqenRVMrl6TnG9nBtdhWVbLV7OnVucdbb3TrPrfd3oKqhrrQbqP/g203NMPyuMxy+xf6ron2Kq/FpygfgXMH+6ppj86Zrgv85UMDEhUyw2MT0D5VqrUN3sateqv0IPxLDBDDYuboONAhiE1x8GHAMW9yv0zYvtFfrm/iVLmTJeTCZfQgOItcU0iF+svI9z+IYAz/xtwH+XzT/XVt85JOzr99F1yeT64pvD12HZ1oeaw8E6g+Zw6KfQouuB+g8+h69leo053IWqyEXfCwv6u6fwa6YfoachDjaWPoLkkJacj1E5MUzOx5Ccl7XkfILKiWNyPoHkbNCS8ykqpxQm51NIzitacj5D5RyEyfkMkvOqlpzPUTkHY3I+h+S8piXnC1ROOUzOF5Cc17XkfInKOQST8yUkJ+iPn6KvaUYrYGvHN7X4D8P439LiPwLjf1uL/yiM/x0t/qMx/o1a/Mdg/Ju0+Kti/Ju1+Ktj/Fu0+I/F+N/V4q+F8b+nxV8b49+qxV8X49+mxV8f439fi78hxv+BFn9jjP9DLf6mGP9HWvzNMf6PtfiPx/g/0eJvhfF/qsXfBuP/TIu/Hcb/uRZ/B4z/Cy3+Thj/l1r8XTD+r7T4u2H8X2vx98D4v9Hi74Xxf6vF3wfj/06Lvx/G/70W/wkY/w9a/AMx/h+1+Adj/D9p8Z+I8f+sxX8yxv+LFv+pGP+vWvynY/y/afEPxfh/1+LPwPj/0OIfjvH/qcWfifH/pcU/CuPfrsWfhfH/rcV/Nsa/Q4t/DMRvl9DiH4vxG1r852D8phb/eIzf0uKfgPFHtPjPxfijWvyTMX5bi/98jN/R4r8A43e1+C/E+GNa/NMxfk+L/2KMP67FfwnGXxLhT3kKzCr4GfkoUfRlim7go3c+ruYjXj4W5aNEPs3jAzU+0+JjJT7Z4cMVPt/gIwbe5eeNdt7r5u1m3vHlTVfe9+StR9794w043gPjbSjeCeLNGN4P4S0J3hXghTmvjXl5yitEXqTxOomXKrxa4ICdY2YOWzly5OCN4ycOYTiK4Imc51KeznhGYafOfpVdG3sXHuA8xribc0/jxub6Zsnhn7paS1Hs2Ue7FFCvyUtK1pzn+U/ILh34hlVBocDvoOzS0MExZ0MEHhRQ4KqdAg8KWenYNYS1UMnLBG+aMmQfHLhpmgRoGuyLC86GCCwbvGlYYFm9pjHRpikXvGnKkV0+cNM0DtA05bGmKQ8JPCR407DAQ/SaxkKb5tDgTXMo2RUCf7FpNS+un5FvDumqGHACzkf7TQWwmeyKWAerAMk5LHgH42Y6TK+DRdAOdnjwDnY42UcEHvuNAoz9I7CmOQISeGTwpmGBR+o1TRRtmqOCN81RZFcK3DQ7S/4S2jiVsMapBEk8OnjjsMSj9RrHRhuncvDGqUz2MSGuKdtVkAovtmvKIf3uMajfrYL1n2OgqqkavP9wK1TV6z8O2n+qBe8/1ciuHm5wv4i2YnWscapDEmsEbxyWWCPMvc5iuTbzT7GP9TcVqv/Y2Ld5dk2g2oALSHbNyuG6+YvFueqrVUxialUWoyHShuzjBBbl/YbaEuPdhzoSK0l2XYmVJruexHh9Vl9iZcluILHyZDeUGMd3jSRWkezGEuNgo4nEjiS7qcQqkd1MYuzLmkusCtktJMbD6niJ1SC7pcRqkt1KYseR3VpidchuI7F6ZLeVWAOy20msEdntJdaE7A4Sa0Z2R4m1ILuTxFqS3VlircnuIrG2ZHeVWHuyu0msI9ndJdaZ7B4S60p2T4l1J7uXxHqS3VtivcnuI7G+ZPeVWH+y+0lsANn9JTaI7BMkNoTsARI7ieyBEjuF7EESO43swRI7g+whEjuT7BMlNozskyQ2guyTJTaS7FMkNprsUyV2FtmnSSyb7NMllkP2GRIbR/ZQieWSfabE8sjOkNhEsodJbBLZwyV2HtkjJDaF7EyJTSV7pMSmkT1KYheRPVpiM8jOCjwtRqHnDqLgcwf2WQEjR/S5A/ssbFo8OyA/9lNW2OMDdrZGTGCfzYYx8WMChVIFD6HZY8jOCbOv/Tz4RA1W8LEavSZAxY0LXnHsNM4JsQbinpyDdvmxWJidA0nMDSyxIHYaL7CC2ClPYhw7TZAYx04TJcax07kS49hpksQ4dposMY6dzpMYx07nS4xjpykS49jpAolx7DRVYhw7XSgxjp2mSYxjp+kS49jpIolx7HSxxDh2miExjp0ukRjHTpdKjGOnyyTGsdPlEuPY6QqJcex0pcQ4drpKYhw7XS0xjp2ukRjHTtdKjGOnmRLj2GmWxDh2mi0xjp3yJcax0xyJcew0V2IcO82TGMdO10mMY6frJcax0w0S49jpRolx7HSTxDh2ulliHDvdIjGOnW6VGMdOt0mMY6fbJcax0x0S49jpTolx7HSXxDh2mi8xjp0WSIxjp4US49hpkcQ4drpbYuwGF0uMY6d7JMax070S49hpicQ4drpPYhw73S8xjp0ekBjHTkslxrHTMolx7PSgxDh22vMxXuznPO3lvm61vZw5lpP9cBiqR3ypOkiqR8h+NAzVY75UHSXVY2Q/HobK//HWTpLqCbKfDEPl/4hqZ0n1FNlPh6Fa4UvVRVKtIPuZMFTP+lJ1lVTPkv1cGCr/txm7SaqVZD8fhmqVL1V3ScUbg6vDUPm/0NZDUr1A9powVP7vOPWUVLwj+GIYqpd8qXpJqpfIXheGar0vVW9JtZ7sRBgq/6dr+kgqIvvlMFT+77D0lVQbyH4lDJX/oyL9JNWrZL8Whup1X6r+kup1st8IQ+X/esQJkupNst8KQ+X/UMMASfU22e+EofJ/E2GgpNpI9qYwVP7PDwySVJvJ3hKGyv+m/2BJ9S7Z74Wh8r9UP0RSbSV7Wxgq//vrJ0qq98n+IAyV/1XxkyTVh2R/FIbK/1b2yZLqY7I/CUPlfwH6FEn1KdmfhaHyv2t8qqT6nOwvwlD5X+s9TVJ9SfZXYaj8b9CeLqm+JvubMFT+l1XPkFTfkv1dGCr/e6FDJdX3ZP8QhupHX6ozJdWPZP8Uhsr/tmOGpPqZ7F/CUPlfLBwmqX4l+7cwVP53+IZLqt/J/iMMlf91uRGS6k+y/wpD5X8zLVNSbSf77zBU/pfARkqqHeSUCEHl+N+3GiWoHIMcMwyV/9Wm0ZLKIicShsr/FlGWpIqSY4eh8r+wc5akcshxw1D53405W1LFyPHCUPlfQ8mWVHFySoah8r8ZMUZSlSKndBgq/zsKOZLqIHLKhKE62JdqrKQ6mJyyYaj8P5IfJ6nKkVM+DJX/5+rnSKpDyDk0DFUFX6pcSVWBnIphqPy/kZZnUs5h5BwehuoIXyp51OUcQc6RYaj8P9KVJ2jOUeRUCkPl/7GsPJhzjianchiqY3yp5Hmfcww5VcJQ+X/CKY8RnarkVAtDVd2XSp5OOtXJqRGGyv8jQnno6RxLTs0wVP6f2MmzVKcWOceFoartSyWPaJ3a5NQJQ1XXl0qe/Dp1yakXhqq+L5U8UHbqk9MgDFVDXyp5Tu00JKdRGKrGvlTy+NtpTE6TMFRNfankqbrTlJxmYaj8f5FBHtY7zclpEYbqeF8q+Q2Aczw5LcNQtfKlkp8WOK3IaR2Gqo0vlfxiwWlDTtswVO18qeSHEE47ctqHoergSyW/r3A6kNMxDFUnXyr52YbTiZzOYai6+FLJr0GcLuR0DUPVzZdKfmTidCOnexiqHr5U8tsVpwc5PcNQ9fKlkp/EOL3I6R2Gqo8vlfzSxulDTt8wVP18qeQHPE4/cvqHoTrBl0p+F+ScQM6AMFQDfank50bOQHIGhaEa7Eslv2JyBpMzJAzVib5U8uMo50RyTgpDdbIvlfzmyjmZnFPCUJ3qSyU/5XJOJee0MFSn+1LJL8Sc08k5IwzVUF8q+eGZM5ScM8NQZfhSye/ZnAxyhoWhGu5LJT+Tc4aTMyIMVaYvlfz6zskkZ2QYqlG+VPKjPmcUOaPDUGX5UslvBZ0scs4KQ+X/jbv8BNE5m5zsMFT+X5TLLxudMeTkhKHy/wZcfjDpjCVnXBiqc3yp5HeYzjnk5O7x1k5kS4k7yB5Pdh7ZE8ieSPa5ZE8iezLZ55F9PtlTyL6A7KlkX0j2NLKnk30R2ReTPYPsS8i+lOzLyL6c7CvIvpLsq8i+muxryL6W7JlkzyJ7Ntn5ZM8hey7Z88i+juzryb6B7BvJvonsm8m+hexbyb6N7NvJ5pLcSfZdZM8newHZC8leRPbdZC8m+x6y7yV7Cdn3kX0/2Q+QvZTsZWQ/SPZDZD9M9qNkP072k2Q/TfYzZD9HNp9grCZ7Ddkvkr2O7ATZL5P9Ctmvkf0G2W+R/Q7Zm8jeQvZ7fDDPB+Z8kM0HzHzwyweyfFDKB5h8sMgHfnwQxwdkfHDFB0p80MMHMHwwwgcWfJDAG/y88c4b4rxRzRvIvLHLG668EcoblLxxyBt6vNHGG2C8McUbRryRwxssvPHBGxK8UcALeF5Y84KXF6K8QOSFGy+oeKHDCxBeGHDAzoE0B7gceHJAyIEaB1Ac2HDAwYEAT9A8cfKExhMNTwDsmNlhsiNjB8MDnwckDxTuwNyxuMFDv0VkZ5OdC/XFOPK7u0Gf6djJfw50J9Y+Bxox4xFbkJbkuIoUXOXlah5/gO8sOXkqV3mfY8OYO5qgcvuFuzH2zKAzMWCzsTucSM65qmWaFLxMk8iZHPgqUxNuKPDijnMudB+HsyECz9Nq9PMwv7NGye84kyG/40yGaul8yO+sCex3CjrL+Qfa70zxNWWG8ztT/C41frtjxw7wh+GdCzRKWdBRLoBKaWdDpZwKlFL4i6nkXBiy5JgPmxbch00jZ3pgH7bzsmBF1ItdiHmxCyGJF2l5sYswL7ZOy4tNx7zYdKiWLoa82LrgXoy7y8UH2ovN8DVlhfNiM7BRdolWF8QeaXUuDT7KLyXnMtUyXR68TJeTc0Vgz9MoQPR0GeZ3LoMEXqnV6FdifudlLb9zBeZ3roBq6SrI77wc3O9wZ7nqQPudq31NRcL5nauBuGQ7Gj1do1HKgo5yDVRKMHq6Fiil8BfXkjMzVKQSXYm+hIX9SqQT+AfksSc/oJernNkB9w72/0tlTr6Kr4Qf13DmBPIvO3db55AzN8TgfYb/DGpcZ57CfpZR4Bm55PNUN0auC16b15FzfbjavB6rzRsUVuk7a5NLfsM+LC59cprguz7OjcHr/EZybgpX5zdhdY495LkueJ1zyW9WDU5vCV6bt5Bza7javBWrzdsUIqWdtcklv20fJnifnBG0B98evM5vJ+eOcFsRVdAlwUxsSTATknhnwGkuH+1Cd6AtdifW/+8K3ou4Le4KE8NgMep8nRgmAeXCgv0FQJ0t6ZiblZ2dNargbdC5pWZPXzQwK2dUduauQ2G/grT0J9hpccy47ExyFs6ZNStgpSHjng8xF86GhsQi/0oLw74oaCyN+mG7Crau3qjBXzA2sS8D4puCriWgt7mdu6HpZSOUa1OIjudXwlbc9IgvbgWpXazRiM7dbBhzsPcA/MBrws49lff0KV5An9LCvxyzMEvh6tSvplqzWWwGXgzV+71BnXTp/N0VCu8erIE6y3yeMnx8GR8ubUu2594zGwX/Kz/p/5ckk/dhUwHS35Zg2e6rHGpfK7oGc4GbVUZvQYNg/FuCuuC5ezeb/93OAiyBuvB9kAveDOXaAvS/wHvEzmKWMktnlrp//4kvEeqbmgLx92NzwAPFNAc8EHywFUymSIVjk+kiKNdSherm6WHprKAuPT6v2OPuYAaPL26DLQIYzIfDYThunRWAHvEgbSxkykd+wsv/jljqlLksmXwQDXqWFtMgXlZ5H+MOPoyoCTmo2bzd7h93/BY27ngomVxefHHHQ1i25eF+KcSuic377wKNHXzGKGgQjP89nbjjIch/L4cm1XehXO8B/S943LGUpSjFHQ/7y3Ih8W7wVkR/uSpKaHc/DvthHIKq5hEtOS+jcmpjcl6G5DyqJWcDKqcOJmcDJOcxLTmvoHLqYnJegeQ8riXnVVROPUzOq5CcJ7TkvIbKqY/JeQ2S86SWnNdROQ0wOa9Dcp7SkvMGKqchJucNSM7TWnLeROU0wuS8CclZoSXnLVROY0zOW5CcZ7TkvI3KaYLJeRuS86yWnHdQOU0xOe9Acp7TkrMRldMMk7MRkrNSS84mVE5zTA529Pq8lpzNqJwWmJzNkJxVWnK2oHKOx+RsgeSs1pLzLiqnJSbnXUjOC1py3kPltMLkvAfJWaMlZysqpzUmB/uSdK2WnG2onDaYnG2QnBe15LyPymmLyXkfkvOSlpwPUDntMDkfQHLWacn5EJXTHpPzISRnvZacj1A5HTA5H0FyElpyPkbldMTkfAzJIS05n6ByOmFyPoHkvKwl51NUTmdMzqeQnA1acj5D5XTB5HwGyXlFS87nqJyumJzPITmvasn5ApXTDZPzBSTnNS05X6JyumNyvoTkvK4l5ytUTg9MzleQnDe05HyNyumJyfkakvOmlpxvUDm9MDnfQHLe0pLzLSqnNybnW0jO21pyvkPl9MHkfAfJeUdLzveonL6YnO8hORu15PyAyumHyfkBkrNJS86PqJz+mJwfITmbteT8hMo5AZPzEyRni5acn1E5AzA5P0Ny3tWS8wsqZyAm5xdIjtpXH7+icgZhcn6F5GzVkvMbKmcwJuc3SM42LTm/o3KGYHJ+h+S8ryXnD1TOiZicPyA5H2jJ+ROVcxIm509Izodacv5C5ZyMyfkLkvORlpztqJxTMDnbITkfa8n5G5VzKibnb0jOJ1pydqByTsPk7IDkfKokxy6ByjkdkmOXgOR8piXHQOWcgckxIDmfa8kxUTlDMTkmJOcLLTkWKudMTI4FyflSS04ElZOByYlAcr7SkhNF5QzD5EQhOV9rybFROcMxOTYk5xstOQ4qZwQmx4HkfKslx0XlZGJyXEjOd1pyYqickZicGCTney05HipnFCbHg+T8oCUnjsoZjcmJQ3J+1JJTEpWThckpCcn5CZGT8jMc0S0l2pPzCDmPkvMYOY+T8wQ5T5LzFDlPk7OCnGfIeZac58hZSc7z5KwiZzU5L5Czhpy15LxIzkvkrCNnPTkJcoiPzvm4mY9o+ViTjwL5+IyPnPiYho82+DiAt9B525m3anl7k7cEeRuNt554u4a3OHhbgJfSvPzkJRsvc3hpwOE0h6ActnGow+EBT6k8DbHrZnfHLoKHFXdFbj6WHPpnJgouZT2M3Yf+GajX5KND0YIHoH4m55fALyYVFArpYQVF/wV7fALbAvw1oMBVOwX+GrLSsZIvhUr+W/Cm+Y2c3wM3TcsATfM7JhDbMPsjeNOwwD/0msZEm+bP4E3zJzl/BW6a4wM0zV9Y02DbS9uDNw0L3K7XNBbaNH8Hb5q/ydlRqOR+TFYb5LUz6L48osstoTGfF9T+DrCZ3BJYB4O2lFwjeAf7m/9Kr4NFwA7mmoE7mGuSawUe+y3wse9CbzcUZEMERgI3TYHAiF7TRNGmiQZvmii5dvDnHwtK/iDaODbWONAK33WCNw5LdPQax0Ybxw3eOC65sRAPB7geUuHF9qxeOL/rxlC/62H9B1q0u/Hg/YdbIa7Xfxy0/5QM3n9Kklsq3OBehrZiKaxxSkESSwdvHJZYOswQOQjq/MXysEhBplD9xz0IWsO6ZYBqAx6ycctUDtfNlxXjqs89uJjEHFxZjIZIG3LLCizKY7ucxDxyy0uMu9khEitN7qESK0NuBYmVJbeixMqTe5jEDiX3cIlVJPcIiR1O7pESO5LcoyRWidxKEqtM7tESq0KurKtoNXKPkVgNcqtIrCa5VSV2HLnVJFaH3OoSq0duDYk1IPdYiTUit6bEmpBbS2LNyD1OYi3IrS2xluTWkVhrcutKrC259STWntz6EutIbgOJdSa3ocS6kttIYt3JbSyxnuQ2kVhvcptKrC+5zSTWn9zmEhtAbguJDSL3eIkNIbelxE4it5XETiG3tcROI7eNxM4gt63EziS3ncSGkdteYiPI7SCxkeR2lNhocjtJ7CxyO0ssm9wuEssht6vExpHbTWK55HaXWB65PSQ2kdyeEptEbi+JnUdub4lNIbePxKaS21di08jtJ7GLyO0vsRnknhBmWhyArEaQpy6jwR8sRZ+6dAdg0+LAgPzY2/HYw5PuII2YwB3IhjHxgwOFUgU/bOAOJndImH3te4FYsTX6SLV7okavCVBxJwWvOHaSJ4dYA3FPHoJ2eezLRncIJPGUwBILYqdTBVYQO50mMY6dTpcYx05nSIxjp6ES49jpTIlx7JQhMY6dhkmMY6fhEuPYaYTEOHbKlBjHTiMlxrHTKIlx7DRaYhw7ZUmMY6ezJMax09kS49gpW2IcO42RGMdOORLj2GmsxDh2Gicxjp3OkRjHTrkS49hpvMQ4dsqTGMdOEyTGsdNEiXHsdK7EOHaaJDGOnSZLjGOn8yTGsdP5EuPYaYrEOHa6QGIcO02VGMdOF0qMY6dpEuPYabrEOHa6SGIcO10sMXYLMyTGsdMlEuPY6VKJcex0mcQ4drpcYhw7XSExjp2ulBjHTldJjGOnqyXGsdM1EuPY6VqJcew0U2IcO82SGMdOsyXGsVO+xDh2miMxjp3mSoxjp3kS49jpOolx7HS9xDh2ukFiHDvdKDGOnW4SmL2c3Jsl9gi5t0jsMXJvldgT5N4msafIvV1iK8i9Q2LPknunxFaSe5fEeCdkvsReIHeBxNaSu1BiL5G7SGLryb1bYkTuYoltIPceib1K7r0Se53cJRJ7k9z7JPY2ufdLbCO5D0hsM7lLJfYuucsktpXcByX2PrkPSexDcpdL7GNyH5bYp+Q+IrHPyX1UYl+S+5jEvib3cYl9S+4TEvue3Ccl9iO5T0nsZ3Kfltiv5K6Q2O/kPiOxP8l9VmLbyX1OYjvIXSkwh+OM5yVmkbtKYrzvvlpiDrkvSCxG7hqJxcldK7FS5L4osYPIfUliB5O7TmLlyF0vsUPITUisArkkscPIfVliR5C7QWJHkfuKxI4m91WJHUPuaxKrSu7rEqtO7hsSO5bcNyVWi9y3JFab3LclVpfcdyRWn9yNEmtI7iaJNSZ3s8SakrtFYs3JfVdix5P7nsRakbtVYhxjbpNYO3Lfl1gHcj+QWCdyP5RYF3I/klg3cj+WWA9yP5FYL3I/lVgfcj+TWD9yP5fYCeR+ITFef3wpMV5vfSWxE8n9WmInk/uNxE4l91uJnU7udxIbSu73Essg9weJDSf3R4llkvuTxEaR+7PEssj9RWJnk/urxMaQ+5vExpL7u8TOIfePPb5ls7eUuIPXH7zc4NUFLyZ47cBLBV4Z8EKA434O8zmq5yCeY3YO0Tki5wCc420Orzma5uCZY2UOjTkS5sCX41wOazmK5aCVY1QOSTkC5YCT40sOJzl65GCRY0MOBTny40CP4zoO4zhq4yCNYzIOwTji4gCL4ykOnzha4uCIYyEOfTjS4cCG4xgOWzhK4aCEYxAOOTjC4ICC4wcOFzg64GCA536e6nlm54mc522epnlW5kmY51yeYnlG5QmU50ueHnk25MmP5zqe2ngm44mL5ymelngW4kmH5xieUngG4QmD5weeDtj7s7Nn386unD03O2r2y+yG2euyk2Wfyi6UPSY7SPaH7P7Y27FzY1/Gros9FTsm9kPsdtjLsFNhH8Iugz0EOwQe/zzceXTzYOaxy0OVRyYPRB53PMx4VPEg4jHDQ4RHBA8A7u/cvbk3c+flvspdk3sidzzuZ9ytuBdxp+E+wl2CewA3eOhv/VwOx0+BlvYl80JsLQA7Pbz6h374zz0ZWp3/idiCtCTHlV1wVMbrkT/D7An+tV/3BMP9/I37F7a7s11ld4m7wHaM/++Azcbj929yd2iWKVYicJli/FdGmO8sF6MbYzuw/S7oW6uYqdToMRPzO5OU/E7MgPxODLpGF7MgvzMpsN8p6CxWCL8Ti+xXv2OG8jtcSB8t3+7YsQP8ocBYVKOUBR0lCpXSHQSV0gZKKfyFTTEnZMkxH+YG92EuxWIhPo5h51QC9GIxB/JiMegyWMzT8mIe5sWmaHmxGObFoO+7YnHIi00J7sW4u8TDeLGS+9WLWeG8WElslJXS6oKlMP7SwUd5aYodpFqmMsHLVIZiB4f5HBqNnmIHYX7nIEhgWa1GL4v5nWlafudgzO8cDNVSOcjvTAvud7izlAvjd8rvV78TCed3ygNxyXY0ejpEo5QFHeUQqJRg9HQoUErhLw6lWIVQkYpzD/ql6cGYs6uo80kN9GVo7LCAewfgQDl8v34JrPrxSuyIwF92xI6g2JEhBu8i/jOocWNHKexnGQWekUt+lOrGSKXgtVmJYkeHq82jsdqsrLBK31mbXPLK+7C49Mlpgt/NxY4JXufHUKxKuDqvgtV5VYU1xc4655JXVQ1OqwWvzWoUqx6uNqtjtVlDIVLaWZtc8hr7MMH75IygPfjY4HV+LMVqhtuK8NAlQQVsSVABklgr4DSXj3ahmmiL1cL6/3HBexG3xXFhYhgsRq2tE8PUgaKTzVAu5LPtPX41vNTsYD8c396fYPbu3/OO1cV+zzvouG/PlqEfW4/V82+AMOz1gv5oNOqHXXA/7yqtdX1FjP/qoGsJbCjUh6aXq6BcV4foeH4l7MBNj/jiDpDaBhqNGKvPhjEH2xDgB27rxRpW3tOneAF9Slv/cszCLIWrU7+a6shmsRm4AVTvjYI66dL5uysU3j14AOostXn68fFlfLi0Ldmee89sFPyv/KT/b5xMNsGmAqS/NcayNakcal/LeQBzgdeojN6CBsH4rw3qgufu3Wz+dzsL0Bjqwk0gF3wNlOtaoP8F3iOONWAps3Rmqab7T3yJUN/UFIhvis0BzYppDmgWfLAVTKZIhWOTaT0oV3OF6ubpofmsoC49Pq/Y4+5gBtsVt8G2AQzmw+EwHLfOCkCPeJBO0LNEyHc3nfxLljJltkgmj0eDnubFNIhbVN7HuIMPI8pADuow3rr3jzt+Cxt3tEwmWxVf3NESy9Yq3Escbhls3p+pEncUNAjGH3hSxeKOlpD/bgVNqjOhXEj/Cx53NGcpSnFHa39ZLiTeDd6K8It8j6DdvSz28MwjUNW00ZLzKCqnHCbnUUhOWy05j6FyymNyHoPktNOS8zgq5xBMzuOQnPZacp5A5RyKyXkCktNBS86TqBzsfMN5EpLTUUvOU6icipicpyA5nbTkPI3KOQyT8zQkp7OWnBWonMMxOSsgOV205DyDyjkCk/MMJKerlpxnUTlHYnKeheR005LzHCrnKEzOc5Cc7lpyVqJyKmFyVkJyemjJeR6VczQm53lITk8tOatQOZUxOasgOb205KxG5RyDyVkNyemtJecFVE4VTM4LkJw+WnLWoHKqYnLWQHL6aslZi8qphslZC8nppyXnRVROdUzOi5Cc/lpyXkLl1MDkvATJOUFLzjpUzrGYnHWQnAFactajcmpictZDcgZqyUmgcmphchKQnEFacgiVcxwmhyA5g7XkvIzKqY3JeRmSM0RLzgZUTh1MzgZIzolacl5B5dTF5LwCyTlJS86rqJx6mJxXITkna8l5DZVTH5PzGiTnFC05r6NysI+ynNchOadqyXkDldMQk/MGJOc0LTlvonIaYXLehOScriXnLVROY0zOW5CcM7TkvI3KaYLJeRuSM1RLzjuonKaYnHcgOWdqydmIymmGydkIycnQkrMJldMck7MJkjNMS85mVE4LTM5mSM5wLTlbUDnHY3K2QHJGaMl5F5XTEpPzLiQnU0vOe6icVpic9yA5I7XkbEXltMbkbIXkjNKSsw2V0waTsw2SM1pLzvuonLaYnPchOVlacj5A5bTD5HwAyTlLS86HqJz2mJwPITlna8n5CJXTAZPzESQnW0vOx6icjpicjyE5Y7TkfILK6YTJ+QSSk6Ml51NUTmdMzqeQnLFacj5D5XTB5HwGyRmnJedzVE5XTM7nkJxztOR8gcrphsn5ApKTqyXnS1ROd0zOl5Cc8VpyvkLl9MDkfAXJydOS8zUqpycm52tIzgQtOd+gcnphcr6B5EzUkvMtKqc3JudbSM65WnK+Q+X0weR8B8mZpCXne1ROX0zO95CcyVpyfkDl9MPk/ADJOU9Lzo+onP6YnB8hOedryfkJlXMCJucnSA70oG/Kz3A4W0q0p1gbirWlWDuKcboDxTpSrBPFOlOsC8W6UqwbxbpTrAfFelKsF8V6U6wPxfpSrB/F+lPsBIoNoNhAig2i2GA+OufjZj6i5WNNPgrk4zM+cuJjGj7a4OMA3kLnbWfequXtTd4S5G003nri7Rre4uBtAV5K8/KTl2y8zOGlAYfTHIJy2MahDocHPKXyNMSum90duwgeVtwVuflYcuifmSi4lNUauw99AVCvyUeHnIIHoC6g2NTALyYVFArpYQVFn4o9PjEVEnhhQIGrdgq8MGSlYyVvDpV8WvCmmUax6YGbpn2AppmOCZwOCbwoeNOwwIv0msZEm+bi4E1zMcVmBG6adgGaZgbWNDMggZcEbxoWeIle01ho01wavGkupdhlhUrux2R1Ql5khu7LQ7ou15jPC2r/MrSZLsc62GWQnCuCdzBupiv0OlgE7WBXBu9gV1LsqsBjv22AsX8V1jRXQQKvDt40LPBqvaaJok1zTfCmuYZi1wZ//rGg5MejjXMt1jjXQhJnBm8cljhTr3FstHFmBW+cWRSbHebhAKjCi+1ZvZB+F26FfKz/YPH+nOD9h1thjl7/cdD+Mzd4/5lLsXnhBncLtBXnYY0zD5J4XfDGYYnXhRki10Odv1geFinIFK7/XI/16RuAakMesrmhcrhitijOVd+NxSTmxspiNER4M+QmgUVdit0sMY9it0isJMVulVhpit0msTIUu11iZSl2h8TKU+xOiR1KsbskVpFi8yV2OMUWSOxIii2UWCWKLZJYZYrdLbEqFFsssWoUu0diNSh2r8RqUmyJxI6j2H0Sq0Ox+yVWj2IPSKwBxZZKrBHFlkmsCcUelFgzij0ksRYUWy6xlhR7WGKtKfaIxDgAfVRivFfwmMR4V+1xifEe2xMS4x23JyXG+29PSYx3456WGO/NrZAY79Q9IzHet3tWYryL95zEeE9vpcR4h+95ifF+3yqJ8e7faonxXuALEuOdwTUS433CtRLjXcMXJcZ7iC9JjHcU10mM9xfXS4x3GxMS471HkhjvRL4sMd6X3CAx3qV8RWK8Z/mqxHgH8zWJ8X7m6xLj3c03JDaFYm9KbCrF3pIY7/+8LbGLKPaOxGZQbGOYaXETshpBnrqMBn+wFH7qchM2LW4OyI+9HQ8+PKny27mxzWwYE/9uoFBq5w8bvEux98LsazcCYsWO8CPVW1V6DV5x24JX3DaKvR9iDcQ9+T20y2/FQizsq+APAkssiJ0+FFhB7PSRxDh2+lhiHDt9IjGOnT6VGMdOn0mMY6fPJcax0xcS49jpS4lx7PSVxDh2+lpiHDt9IzGOnb6VGMdO30mMY6fvJcax0w8S49jpR4lx7PSTxDh2+lliHDv9IjGOnX6VGHeT3yTGsdPvEuPY6Q+Jcez0p8Q4dvpLYhw7bZcYx05/S4xjpx0Sa0+e7FccO3mGxDqTZ0qsK3mWxLqTF5FYT/KiEutNni2xvuQ5EutPniuxAeTFJDaIPE9iQ8iLS+wk8kpK7BTySknsNPJKS+wM8g6S2JnklZHYMPIOltgI8spKbCR55SQ2mrzyEjuLvEMklk3eoRLLIa+CxMaRV1FiueQdJrE88g6X2ETyjpDYJPKOlNh55B0lsSnkVZLYVPKOltg08ipL7CLyjpHYDPKqCMxeTl5ViT1CXjWJPUZedYk9QV4NiT1F3rESW0FeTYk9S14tia0k7ziJrSKvtsReIK+OxNaSV1diL5FXT2LryasvMSKvgcQ2kNdQYq+S10hir5PXWGJvktdEYm+T11RiG8lrJrHN5DWX2LvktZDYVvKOl9j75LWU2IfktZLYx+S1ltin5LWR2OfktZXYl+S1k9jX5LWX2LfkdZDY9+R1lNiP5HWS2M/kdZbYr+R1kdjv5HWV2J/kdZPYdvK6S2wHeT0E5hjk9ZSYRV4viUXJ6y0xh7w+EouR11dicfL6SawUef0ldhB5J0jsYPIGSKwceQMldgh5gyRWgbzBEjuMvCESO4K8EyV2FHknSexo8k6W2DHknSKxquSdKrHq5J0msWPJO11itcg7Q2K1yRsqsbrknSmx+uRlSKwhecMk1pi84RJrSt4IiTUnL1Nix5M3UmKtyBslsTbkjZZYO/KyJNaBvLMk1om8syXWhbxsiXUjb4zEepCXI7Fe5I2VWB/yxkmsH3nnSOwE8nIlNpC88RIbTF6exE4kb4LETiZvosROJe9ciZ1O3iSJDSVvssQyyDtPYsPJO19imeRNkdgo8i6QWBZ5UyV2NnkXSmwMedMkNpa86RI7h7yL9viWzd1S4g5ef/Byg1cXvJjgtQMvFXhlwAsBjvs5zOeonoN4jtk5ROeInANwjrc5vOZomoNnjpU5NOZImANfjnM5rOUoloNWjlE5JOUIlANOji85nOTokYNFjg05FOTIjwM9jus4jOOojYM0jsk4BOOIi7yyHE9x+MTREgdHHAtx6MORDgc2HMdw2MJRCgclHINwyMERBgcUHD9wuMDRAQcDPPfzVM8zO0/kPG/zNM2zMk/CPOfyFMszKk+gPF/y9MizIU9+PNfx1MYzGU9cPE/xtMSzEE86PMfwlMIzCE8YPD/wdMDen509+3Z25ey52VGzX2Y3zF6XnSz7VHah7DHZQbI/ZPfH3o6dG/sydl3sqdgxsR9it8Nehp0K+xB2Gewh2CHw+OfhzqObBzOPXR6qPDJ5IPK442HGo4oHEY8ZHiI8IngAcH/n7s29mTsv91XumtwTueNxP+Nuxb2IOw33Ee4S3AO4wcN/67eFF7TQ0r5UjRBbC8BOD6/+sR8nh65RehcjtiAtyXHlFhyVbWPbIfYEvRn7dU8w3M/feDOgLuBdorK7tIUNY/yXBmy25/lPyLtMtUyXBy/T5eRdEeY7ywbgxph3GbTf5UHfWnlXajX6lZjfOU7J73hXQH7HuwKqJehzkFLHBfY7BZ3lqjB+5+r96nfMcH7nar9Dg2937NgB/lCgd41KKbmjXIOVEnryw0PqUviLa8mbGbLkmA+bFdyHzSJvdoiPY3iX9XLUi83EvNhMSGK+lhfLx7xYPS0vNhvzYlhHgGxBWoQX4+4yJ4wXm7tfvZgVzovNxSp3nlYXnIfxXxd8lF9H3vWqZboheJluIO/GMJ9Dw9HT9ZjfuR4SeJNWo9+E+Z1GWn7nRszv3AjV0s2Q32kU3O9wZ7k5jN+5Zb/6nUg4v3MLEJdsR6OnW1VKyR3lVqyUWPR0G1BK4S9uI+/2cJFKQ/QTzhsxZ3eHzic10Jeh3p0B9w7AgXLXfv0SWPXjFW9+4C87vPnkLQhRJt6sXAA1rrdQYT/LKPCMXPKFqhsji4LX5iLy7g5Xm3djtblYYZW+sza55Iv3YXHpk9MEv5vz7gle5/eQd2+4Or8Xq/MlCmuKnXXOJV+iGpzeF7w27yPv/nC1eT9Wmw8oREo7a5NL/sA+TPA+OSNoD14avM6Xkrcs3ASPfmno3Y4tCW6HJD4YcJrLR7vQMrTFHsT6/0PBexG3xUNhYhgsRl2uE8M8DEUn10C5gn62PQtrikf2brZNtalbi7jX83D/seMzs0aMzWnUPzN3zIS8jLyssTn5c5P3fLxHdqc7J9FIm5R027nkPUreY+Q9Tt4Te/7iecnZwX70ni35V88szFbQH19EHXEM3NBro8LPg/MOjD/ojx6DY+FJaH5pA+VqG3C4IlXEx/NPYkPmKaCCgKtw3lOVgzu0rlAJn9ZxZyv2axMW8bG794z8KNQl71mJeeQ9J7GS5K2UWGnynpdYGfJWSawseaslVp68FyR2KHlrJFaRvLUSO5y8FyV2JHkvSawSeeskVpm89RKrQl5CYtXII4nVIO9lidUkb4PEjiPvFYnVIe9ViXFg8JrEOKR5XWKNyHtDYk3Ie1Nizch7S2ItyHtbYi3Je0dircnbKLG25G2SWHvyNkusI3lbJNaZvHclxh7iPYl1J2+rxHqSt01ivcl7X2J9yftAYv3JK3ShYwB5hS50DCKv0IWOIeQVutBxEnmFLnScQl6hCx2nkVfoQscZ5BW60HEmeYUudAwjr9CFjhHkFbrQMZK8Qhc6RpNX6ELHWeQVutCRTV6hCx055BW60DGOvEIXOnLJK3ShI4+8Qhc6JpJX6ELHJPIKXeg4j7xCFzqmkFfoQsdU8gpd6JhGXqELHReRV+hCxwzy5IWOgo/d5YWOgo/d5YUO+zGKS99pP0FxeaHDfori8kKHvYLi8kKH/SzF5YUOeyXF5YUOexXF5YUO+wWKywsd9lqKywsd9ksUlxc67PUUlxc6bKK4vNBhb6C4vNBhv0pxeaHDfp3i8kKH/SbF5YUO+22Kywsd9kaKywsd9maKywsd9rsUlxc67K0Ulxc67PcpLi902B9SXF7osD+muLzQYX9KcXmhw/6c4vJCh/0lxeWFDvtrissLHfa3FJcXOuzvKS4vdNg/Ulxe6LB/pri80GH/SnF5ocP+neLyQof9J8ULXejYTvFCFzp2UFxe6HAMissLHY5FcXmhw4lSXF7ocByKywsdTozi8kKHE6e4vNDhlKK4vNDhHERxeaHDOZji8kKHU47i8kKHcwjF5YUOpwLF5YUO5zCKywsdzhEUlxc6nKMoLi90OEdTXF7ocI6huLzQ4VSluLzQ4VSnuLzQ4RxLcXmhw6lFcXmhw6lNcXmhw6lLcXmhw6lPcXmhw2lIcXmhw2lMcXmhw2lKcXmhw2lOcXmhwzme4vJCh9OK4vJCh9OG4vJCh9OO4vJCh9OB4vJCh9OJ4vJCh9OF4vJCh9ON4vJCh9OD4oUudPSieKELHX0oXuhCRz+KF7rQcQLFC13oGEjxQhc6BlO80IWOEyle6ELHyRQvdKHjVIoXutBxOsULXegYSvFCFzoyKF7oQsdwihe60JFJ8UIXOkZRvNCFjiyKF7rQcTbFC13oGEPxQhc6xlK80IWOcyh+evDVWQlg6dNN46zOAIi7axCbAHEPDWLkBcOeYYj9jPZClsrW5jC7dX7UvTUqMgIQ99EgjgLEfTWIbYC4nwaxAxD31yB2AeITNIhjAPEADWLgs0xjoAZxHCAepEFcEiAerEFcCiAeokFcGiA+UYP4IID4JA3iMgDxyRrEBwPEp2gQlwWIT9UgLgcQn6ZBXB4gPl2D+BCA+AwN4kMB4qEaxBUA4jM1iCsCxBkaxIcBxMM0iA8HiIdrEB8BEI/QID4SIM7UID4KIB6pQVwJIB6lQXw0QDxag7gyQJylQXwMQHyWBnEVgPhsDeKqAHHQHx+FriRE7qbIUmR1PiYEu5/NnezLkQsROfmQFijX8jAN6FfAsdC+yTaNvlMNKJ7Gj2/ygfFTSBfzniZvBdLFwvykpp9Nbm6KrIFGAmd8EWnqXKiXrVER8yRFnoXEcMa1iJjxkJhnNfb78jSMTtAwOlHD6LkaRidpGJ2sYfQ8DaPnaxidomH0Ag2jUzWMXqhhNDFNxep0FasXqVi9WMXqDBWrl6hYvVTF6mUqVi9XsXqFitUrVaxepWL1ahWr16hYvVbF6kwVq7NUrM5WsZqvYnWOitW5KlbnqVi9TsXq9SpWb1CxeqOK1ZtUrN6sYvUWFau3qli9TcXq7SpW71CxeqeK1btUrM5XsbpAxepCFauLVKzerWJ1sYrVe1Ss3qtidYmK1ftUrN6vYvUBFatLVawuU7H6oIrVh1SsLlex+rCK1UdUrD6qYvUxFauPq1h9QsXqkypWn1Kx+rSK1RUqVp9Rsapy9pJ4TsXqShWrz6tYXaVidbWK1RdUrK5RsbpWxeqLKlZfUrG6TsXqehWrCRWrpGL1ZRWrG1SsvqJi9VUVq6+pWH1dxeobKlbfVLH6lorVt1WsvqNidaOK1U0qVlXutCW2qFh9V8XqeypWt6pY3aZi9X0Vqx+oWP1QxepHKlY/VrH6iYrVT1WsfqZi9XMVq1+oWP1SxepXKla/VrH6jYrVb1Wsfqdi9XsVqz+oWP1RxepPKlZ/VrH6i4rVX1Ws/qZi9XcVq3+oWP1TxepfKla3q1j9W8XqDg2rZJTQMWvomDV1zFo6ZiM6ZqM6Zu2AZvPRn9doAz3TzRlvgp7pNgoe+PC310ZLTltUzs2YHBeS01ZLTjtUzi2YnBgkp52WnPaonFsxOR4kp72WnA6onNswOXFITgctOR1ROdiL/UZJSE5HLTmdUDl3YHJKQXI6acnpjMq5E5NTGpLTWUtOF1TOXZicgyA5XbTkdEXlzMfklIHkdNWS0w2VswCTczAkp5uWnO6onIWYnLKQnO5acnqgchZhcspBcnpoyemJyrkbk1MektNTS04vVM5iTM4hkJxeWnJ6o3LuweQcCsnprSWnDyrnXkxOBUhOHy05fVE5SzA5FSE5fbXk9EPl3IfJOQyS009LTn9Uzv2YnMMhOf215JyAynkAk3MEJOcELTkDUDlLMTlHQnIGaMkZiMpZhsk5CpIzUEvOIFTOg5icSpCcQVpyBqNyHsLkHA3JGawlZwgqZzkmpzIkZ4iWnBNROQ9jco6B5JyoJeckVM4jmJwqkJyTtOScjMp5FJNTFZJzspacU1A5j2FyqkFyTtGScyoq53FMTnVIzqlack5D5TyByakByTlNS87pqJwnMTnHQnJO15JzBirnKUxOTUjOGVpyhqJynsbk1ILkDNWScyYqZwUm5zhIzplacjJQOc9gcmpDcjK05AxD5TyLyakDyRmmJWc4Kuc5TE5dSM5wLTkjUDkrMTnQT4LHRmjJyUTlPI/JqQ/JydSSMxKVswqTA/0md2yklpxRqJzVmJyGkJxRWnJGo3JewOQ0guSM1pKThcpZg8lpDMnJ0pJzFipnLSanCSTnLC05Z6NyXsTkNIXknK0lJxuV8xImpxkkJ1tLzhhUzjpMTnNIzhgtOTmonPWYnBaQnBwtOWNROQlMzvGQnLFacsahcgiT0xKSM05LzjmonJcxOa0gOedoyclF5WzA5LSG5ORqyRmPynkFk9MGkjNeS04eKudVTE5bSE6elpwJqJzXMDntIDkTtORMROW8jslpD8mZqCXnXFTOG5icDpCcc7XkTELlvInJ6QjJmaQlZzIq5y1MTidIzmQtOeehct7G5HSG5JynJed8VM47mJwukJzzteRMQeVsxOR0heRMCSEHKuUNSEbvTvLuwi4ahfptbn+z3ZFa8p7RIe8BkT+rQ94TIn9Ohxz6pW5vpQ55b4j8eR3yPhD5Kh3yvhD5ah3yfhD5Czrk/SHyNTrkJ0Dka3XIB0DkL+qQD4TIX9IhHwSRr9MhHwyRr9chHwKRJ3TIT4TISYf8JIj8ZR3ykyHyDTrkp0Dkr+iQnwqRv6pDfhpE/poO+ekQ+es65GdA5G/okA+FyN/UIT8TIn9LhzwDIn9bh3wYRP6ODvlwiHyjDvkIiHyTDnkmRL5Zh3wkRL5Fh3wURP6uDvloiPw9HfIsiHyrDvlZEPk2HfKzIfL3dcizIfIPdMjHQOQf6pBDvxTufaRDDv0KuPexDvk4iPwTHfJzIPJPdchzIfLPdMihX9D2Ptchz4PIv9AhnwCRf6lDPhEi/0qH/FyI/Gsd8kkQ+Tc65JMh8m91yM+DyL/TIT8fIv9eh3wKRP6DDvkFEPmPOuRTIfKfdMgvhMh/1iGfBpH/okM+HSL/VYf8Ioj8Nx3yiyHy33XIZ0Dkf+iQXwKR/6lDfilE/pcO+WUQ+XYd8ssh8r91yK+AyHfokF+JkMdL6JBfBZEbOuRXQ+SmDvk1ELmlQ34tRB7RIZ8JkUd1yGdB5LYO+WyI3NEhz4fIXR3yORB5TId8LkTu6ZDPg8jjOuTXQeQldcivh8hL6ZDfAJGX1iG/ESI/SIf8Joi8jA75zRD5wTrkt0DkZXXIb4XIy+mQ3waRl9chvx0iP0SH/A6I/FAd8jsh8go65HdB5BV1yOdD5IfpkC+AyA/XIV8IkR+hQ74IIj9Sh/xuiPwoHfLFEHklHfJ7IPKjdcjvhcgr65AvgciP0SG/DyKvokN+P0ReVYf8AYi8mg75Uoi8ug75Moi8hg75gxD5sTrkD0HkNXXIl0PktXTIH4bIj9MhfwQir61D/ihEXkeH/DGIvK4O+eMQeT0d8icg8vo65E9C5A10yJ+CyBvqkD8NkTfSIV8BkTfWIX8GIm+iQ/4sRN5Uh/w5iLyZDvlKiLy5DvnzEHkLHfJVEPnxOuSrIfKWOuQvQOStdMjXQOStdcjXQuRtdMhfhMjb6pC/BJG30yFfB5G31yFfD5F30CFPQOQddcgJIu+kQ/4yRN5Zh3wDRN5Fh/wViLyrDvmrELnSCxuvQeTddchfh8h76JC/AZH31CF/EyLvpUP+FkTeW4f8bYi8jw75OxB5Xx3yjRB5Px3yTRB5fx3yzRD5CTrkWyDyATrk70LkA3XI34PIB+mQb4XIB+uQb4PIh+iQvw+Rn6hD/gFEfpIO+YcQ+ck65B9B5KfokH8MkZ+qQ/4JRH6aDvmnEHmYX/bxtRprQLFm0EN2y8l7GHvILvBNTszs5zpmv9Ax+6WO2a90zH6tY/YbHbPf6pj9Tsfs9zpmf9Ax+6OO2Z90zP6sY/YXHbO/6pj9Tcfs7zpm/9Ax+6eO2b90zG7XMfu3jtkdKmbNEjpmDR2zpo5ZS8dsRMdsVMesrWPW0THr6piN6Zj1dMzGdcyW1DEb9C7RbGBJ1JW8RzH20jqiDtIRtQJjL6Mj6mAds2V1zJbTMVtex+whOmYP1TFbQcdsRR2zh+mYPVzH7BE6Zo/UMXuUjtlKOmaP1jFbWcfsMTpmq+iYrapjtpqO2eo6ZmvomD1Wx2xNHbO1dMwep2O2to7ZOjpm6+qYradjtr6O2QY6ZhvqmG2kY7axjtkmOmab6phtpmO2uY7ZFjpmj9cx21LHbCsds611zIb68tp3JQ9Rt9VR1E7HbHsdsx10zHbUMdtJx2xnHbNddMx21THbTcdsdx2zPXTM9tQx20vHbG8ds310zPbVMdtPx2x/HbMn6JgdoGN2oI7ZQTpmB+uYHaJj9kQdsyfpmD1Zx+wpOmZP1TF7mo7Z03XMnqFjdqiO2TN1zGbomB2mY3a4jtkROmYzdcyO1DE7SsfsaB2zWTpmz9Ixe7aO2Wwds2N0zObomB2rY3acjtlzdMzm6pgdr2M2T8fsBB2zE3XMnqtjdpKO2ck6Zs/TMXu+jtkpOmYv0DE7VcfshTpmp+mYna5j9iIdsxfrmJ2hY/YSHbOX6pi9TMfs5Tpmr9Axe6WO2at0zF6tY/YaHbPX6pidqWN2lo7Z2Tpm83XMztExO1fH7Dwds9fpmL1ex+wNOmZv1DF7k47Zm3XM3qJj9lYds7fpmL1dx+wdOmbv1DF7l47Z+TpmF+iYXahjdpGO2bt1zC7WMXuPjtl7dcwu0TF7n47Z+3XMPqBjdqmO2WU6Zh/UMfuQjtnlOmYf1jH7iI7ZR3XMPqZj9nEds0/omH1Sx+xTOmaf1jG7QsfsMzpmn9Ux+5yO2ZU6Zp/XMbtKx+xqHbMv6Jhdo2N2rY7ZF3XMvqRjdp2O2fU6ZhM6ZknH7Ms6ZjfomH1Fx+yrOmZf0zH7uo7ZN3TMvqlj9i0ds2/rmH1Hx+xGHbObdMxu1jG7Rcfsuzpm39Mxu1XH7DYds+/rmP1Ax+yHOmY/0jH7sY7ZT3TMfqpjVufFXVPnxV1T58VdU+fFXVPnxV1T58VdU+fFXVPnxV1T58VdU+fFXfMHHbM6L+6aOi/umjov7po6L+6aOi/umjov7po6L+6aOi/umjov7po6L+6aOi/umjov7po6L+5aOi/uWjov7lo6L+5aOi/uWjov7lo6L+5aOi/uWjov7lo6L+5aOi/uWjov7lo6L+5aOi/uWqV0zOo8pWsdpGNW541cS+eNXKusjlmdN3ItnTdyLZ03ci2dN3ItnTdyLZ03ci2dN3ItnTdyLZ03ci2dN3ItnTdyLZ03ci2dN3ItnTdyLZ03ci2dN3ItnTdyLZ03ci2dN3ItnTdyLZ03ci2dN3ItnTdyLZ03ci2dN3ItnTdyLZ03ci2dN3ItnTdyLZ03ci2dN3KtRjpmdd7ItXTeyLV03si1dN7ItXTeyLV03si1dN7ItXTeyLV03si1dN7ItdromNV5/9bSef/W0nn/1tJ5/9bSef/W0nn/1tJ5/9bSef/W0nn/1tJ5/9bSef/W0nn/1tJ5/9bSef/W0nn/1tJ5/9bSef/W0nn/1tJ5/9bSef/WGqBjVuf9W0vn/VtL5/1bS+f9W0vn/VtL5/1bS+f9W0vn/VtL5/1bS+f9W0vn/VtL5/1bS+f9W0vn/VtL5/1bS+f9W0vn/VtL5/1bS+f9W0vn/VtL5/1bS+f9W0vn/VtL5/1bS+f9W0vn/VtL5/1bS+f9W0vn/VtL5/1bS+f9WytXx6zO+7eWzvu3ls77t5bO+7eWzvu3ls77t5bO+7eWzvu3ls77t5bO+7eWzvu3ls77t5bO+7eWzvu3ls77t5bO+7eWzvu3ls77t5bO+7eWzvu3ls77t5bO+7eWzvu3ls77t5bO+7dW4PdvkR9/rA5RQ2/k9skcMzZ3co+crLw5sS1Wt27de/Ts1btP3379TxgwcNDgISeedPIpp552+hlDz8wYNnxE5shRo7POOjt7TM7Ycefkjs+bMPHcSZPPO3/KBVMvTExLTE9clLg4MSNxSeLSxGWJyxNXJK5MXJW4OnFN4trEzMSsxOxEfmJOYm5iXuK6xPWJGxI3Jm5K3Jy4JXFr4rbE7Yk7Encm7krMTyxILEwsStydWJy4J3FvYknivsT9iQcSSxPLEg8mHkosTzyceCTxaOKxxOOJJxJPJp5KPJ1YkXgm8WziucTKxPOJVYnViRcSaxJrEy8mXkqsS6xPJBKUeDmxIfFK4tXEa4nXE28k3ky8lXg78U5iY2JTYnNiS+LdxHuJrYltifcTHyQ+THyU+DjxSeLTxGeJzxNfJL5MfJX4OvFN4tvEd4nvEz8kfkz8lPg58Uvi18Rvid8TfyT+TPyV2J74O7GDjBJkGGSYZFhkRMiIkmGT4ZDhkhEjwyMjTkZJMkqRUZqMg8goQ8bBZJQloxwZ5ck4hIxDyahARkUyDiPjcDKOIONIMo4ioxIZR5NRmYxjyKhCRlUyqpFRnYwaZBxLRk0yapFxHBm1yahDRl0y6pFRn4wGZDQkoxEZjcloQkZTMpqR0ZyMFmQcT0ZLMlqR0ZqMNmS0JaMdGe3J6EBGRzI6kdGZjC5kdCWjGxndyehBRk8yepHRm4w+ZPQlox8Z/ck4gYwBZAwkYxAZg8kYQsaJZJxExslknELGqWScRsbpZJxBxlAyziQjg4xhZAwnYwQZmWSMJGMUGaPJyCLjLDLOJiObjDFk5JAxloxxZJxDRi4Z48nII2MCGRPJOJeMSWRMJuM8Ms4nYwoZF5AxlYwLyZhGxnQyLiLjYjJmkHEJGZeScRkZl5NxBRlXknEVGVeTcQ0Z15Ixk4xZZMwmI5+MOWTMJWMeGdeRcT0ZN5BxIxk3kXEzGbeQcSsZt5FxOxl3kHEnGXeRMZ+MBWQsJGMRGXeTsZiMe8i4l4wlZNxHxv1kPEDGUjKWkfEgGQ+RsZyMh8l4hIxHyXiMjMfJeIKMJ8l4ioynyVhBxjNkPEvGc2SsJON5MlaRsZqMF8hYQ8ZaMl4k4yUy1pGxnowEGUTGy2RsIOMVMl4l4zUyXifjDTLeJOMtMt4m4x0yNpKxiYzNZGwh410y3iNjKxnbyHifjA/I+JCMj8j4mIxPyPiUjM/I+JyML8j4koyvyPiajG/I+JaM78j4nowfyPiRjJ/I+JmMX8j4lYzfyPidjD/I+JOMv8jYTsbfZOwgswSZBpkmmRaZETKjZNpkOmS6ZMbI9MiMk1mSzFJklibzIDLLkHkwmWXJLEdmeTIPIfNQMiuQWZHMw8g8nMwjyDySzKPIrETm0WRWJvMYMquQWZXMamRWJ7MGmceSWZPMWmQeR2ZtMuuQWZfMemTWJ7MBmQ3JbERmYzKbkNmUzGZkNiezBZnHk9mSzFZktiazDZltyWxHZnsyO5DZkcxOZHYmswuZXcnsRmZ3MnuQ2ZPMXmT2JrMPmX3J7EdmfzJPIHMAmQPJHETmYDKHkHkimSeReTKZp5B5KpmnkXk6mWeQOZTMM8nMIHMYmcPJHEFmJpkjyRxF5mgys8g8i8yzycwmcwyZOWSOJXMcmeeQmUvmeDLzyJxA5kQyzyVzEpmTyTyPzPPJnELmBWROJfNCMqeROZ3Mi8i8mMwZZF5C5qVkXkbm5WReQeaVZF5F5tVkXkPmtWTOJHMWmbPJzCdzDplzyZxH5nVkXk/mDWTeSOZNZN5M5i1k3krmbWTeTuYdZN5J5l1kzidzAZkLyVxE5t1kLibzHjLvJXMJmfeReT+ZD5C5lMxlZD5I5kNkLifzYTIfIfNRMh8j83EynyDzSTKfIvNpMleQ+QyZz5L5HJkryXyezFVkribzBTLXkLmWzBfJfInMdWSuJzNBJpH5MpkbyHyFzFfJfI3M18l8g8w3yXyLzLfJfIfMjWRuInMzmVvIfJfM98jcSuY2Mt8n8wMyPyTzIzI/JvMTMj8l8zMyPyfzCzK/JPMrMr8m8xsyvyXzOzK/J/MHMn8k8ycyfybzFzJ/JfM3Mn8n8w8y/yTzLzK3k/k3mTvIKkEWT7omWRZZEbKiZNlkOWS5ZMXI8siKk1WSrFJklSbrILLKkHUwWWXJKkdWebIOIetQsiqQVZGsw8g6nKwjyDqSrKPIqkTW0WRVJusYsqqQVZWsamRVJ6sGWceSVZOsWmQdR1ZtsuqQVZesemTVJ6sBWQ3JakRWY7KakNWUrGZkNSerBVnHk9WSrFZktSarDVltyWpHVnuyOpDVkaxOZHUmqwtZXcnqxqf7fBLPp+Z8ws2n0XxyzKe8fCLLp6d80smnknyCyKd9fDLHp2h84sWnU3ySxKc+fELDpyl88sGnFHyiwLv/vFPPu+q8A8671byzzLvAvGPLu6u8E8q7lrzDyLuBvHPHu2y8I8a7V7zTxLtCvIPDuy28M8K7GLzjwLsDvJLnVTevkHk1yytPXiXyio5XX7xS4lUNr0B4tcCRPUfhHDFzdMuRKEeNHOFxNMZR0b0DMvMm5OZ0zsjL2FKiWwnDtCJR23FjXrxkqdIHlTm4bLnyhxxaoeJhhx9x5FGVjq58TJWq1arXOLZmreNq16lbr36Dho0aN2narHmL41u2at2mbbv2HTp26tyl66xZW0rUzJ++oMPwrNxB+Rtecb78af2aUbNm/QMNKQwlLs/f8OhPh068cEfZM3dj9+RvuD/+WscVt7tn7MaWFIEtzd/gxa5u1eXNJ17ajb2Xv2Fg1Zs+/rPlpFa7sfeL4P2wMMahSuE/5iClqJzl8jfM3PTlezO8a79JghWKylmtKLB2/oblTeu0LHVSjWlJsG5RNpsUlTOjCJtm/aLAZkX8uXl8UTlbFcFudizqz+8p6s+XFAFG2hQFdi3CZqRHUTl7FVGkyKCi/vypov58RRFg9NuiwN+KsBn9s6ic24sokm0X8ef2mCL+3B5bBOjckQLenr+xZsbOddDQ4WPHjMvIyxqWnTl0bG7GcP4/EzNzx2eNzRl6bm7GuHGZuVtKlJm+sNPYnPF5c6Yv6pyVmzk8z5x+d4+cvMxRmbnzBzdu5L88kn9vBPr7aV3k35cIxt9l+oJOGdnZs+O77SwekJnNoidmBlRSorAFK6iF+wrKMoIdYqex4ybvltQltUwpxneVvPQ+l7xLMZR8wcC8seNm56cpqWijTgu7ZmVm+5+UVpJ/2Bn8Q3fRrrll+pKuY3Mzs0blFNTUPO7X5+VlDh86Jmv88KG7unin3T28384OPmRX/y4YGvfvWpF3GDEiN3P8+N1FT4N3zp++aGDWmHHZmbuKuOf/909x8hdkj80YsaVEzwM8aHrs46DpUbjDRINZsApbsItnsHRKLVOK8fl9xk7co3vuzi/+xdrdpPJfIskBuWvoHfJPjn/grqnml3TMysko2NDJ6zduXoqN+dxxCgQWQWjuc7V22+dqNfeUZKWq3+NfIqmF3ONf9qj2XRXVrnC5IsHK1bUYulwhH7WHhkL2nXA1t/vvY8nRWci2F7Tse3anfw3v7ky7mVIY7u+RM2JXFxfksaDeJk1f9gr35ViyL+/heh/e5Xkn5GUPHZWZ1ylj3PgJ2ZmFfOxuM+70e7pnZozrkJubMTmlRj1zt5fdLeGuwQ2nL9yVcfaeTtecm9a+mfZfrLT/4qT9l8jcvfn+QiXe1WB7Zuk5Ycy4HiNTpLqVpi8oAGfX3+fpPW37WUW1XwrLgt48W+3hGVOSaWyae7XpFLJppibFALL3MoAi6gMokn4A2cXUAEVMBnZyAInacFKLtpBdWW5m0f+atm2cwnROytyzF5Pm3johj0CgCoSa6B4dbWdPb10ECRjvlQjSdSz1rmPpdx0rSNeJ7BGLy3aOhAtbInvpOpFi7DoloK5TKLwrFJ0U5cbs3euEoprYkU1sJUOcPSIeN5lhDzyWDJZ2lbPbv/7vH9xOWvi3DuWf2kWXzZVlc1Nm3qL+ICb/IObzB97i3jzLDRqdkVMkjZOctP79g07/LnOe4TmeNw9y8nhNlTc0i1s/I2d4JifyMnNzMrK3lKh+gBdA/fdxAdR/n73Kvk9pwAKoiOh9cRELoF0xeoU9+27nwhNz4e0IK+0CSKwWuqVdLXQvvEj75196pE5Fe/xLz9RIcY9/6ZUaduzxL71TQ+M9/qVP8l/ie/5L3+S/lNzzX/ol/6VU4ZYsHawlOxe2cFAwCyULr21KpxrbIxZfsWcs/s8w7fHPKL0lRGgcSfsv0bT/YocItN20/xJL+y9e2n+Jp/2Xkmn/pVTafyl9C7II+H/h/5udflkkVlB7mVWtvcyqkb3EH9G9zOZ24SiukAcoKjp15b+5hb3A4iJWI578N6+wJ0gBCvmCFCClg4h/K5XSRf6dHx8YkVmwtT52fObQ0TwpbilxyAGeD7vu43zY9X9wPiwVaj7cVxWd93mfy/TZ52J1ooCLCwfmCwY3bNSiUNbU+vvHQ9y/K3Tc+f/0Gzc3dcUwcMKwNK4j/TqvXMMSbx+9tenk2oc2G9tv4oytg+6fWn5+rU8PqvjNhNYTf98yNj1fdH6fCdlpVIVzY9F/h+vi7Lx/B2qF/72BGgnavfa1gwIDdW8TBrRzX+QQ7rLXVWlAh9Vln2vSKDxQ93BQ6bv6oi7nTMjIHp+mRxfeTIyW+Wf9Wa7Y93EihRfjh+zFKexeU6Yp+78W0o/YyL+jclnBIjNjQt7ooedm5eWw2QO/rOy+j6Oz+//gNFo2wA6WuZeTsP0+j0bSnoRZaU/CImlPwqL/VMfh+9zEnfe5biI+jiedW933zhUt1m34wGMj1JnsHmvnx/dYO3dg73PiLuczu+gTq0hkdprTqUjxLMP28wZmlf/pDcxK/84tGytnjR+aOSlz+IS8gq+dsnKG5mZOzMzd9SnUuNEZ4zP/F758+r832fyzINmda3dij7PVfVnZHXjv7BcW7vlJU41dDmlc7sShWeO7/Ntje+QM2N1f+xd01/TOxppd1JE64px8Kr2Qj8p/KHvsqH8/JNz9AeGJB3gYjd7HYTR6nwON6vv9WyjfYXTX4BYiU+dkIn2mLslE+kxdk4n0mbolE+kzdU8m0mfqkUykz9QzmUifqVcykT5T72QifaY+yUT6TH2TifSZ+iUT6TP1TybSZzohmUifaUAykT7TwGQifaZByUT6TIOTifSZhiQT6TOdmEykz3RSMpE+08nJRPpMpyQT6TOdmkykz3RaMpE+0+nJRPpMZyQT6TMNTSbSZzozmUifKSOZSJ9pWDKRPtPwZCJ9phHJRPpMmclE+kwjk4nUTOmDCoWQIaD/r1r4UCX9ki3gZ43Vgi/ZnPRLtoBToxHgU6ZoMoAIvnB3fD9h7ba3neJ9DvpG7XMfMBT7gPk/1AcixdkHIoU3eAbs8/eao9WvY+ynzYJ+/9ObBb3+3XpZqNXB7b3vS8GjIuVLvT0Wjw+kXIfhpdmsWXv7YLrI7S276l6+/CjyLxxjbhHrzRaFNslS/7Fq0SvOovfVjL2uNs87wKvNq/ZxtXnVPve27v+tNv9bbf632vxvtfnfavP/4dXmnplGJRPpM41OJtJnykom0mc6K5lIn+nsZCJ9puxkIn2mMclE+kw5yUT6TGOTifSZxiUT6TOdk0ykz5SbTKTPND6ZSJ8pL5lIn2lCMpE+08RkIn2mc5OJ9JkmJRPpM01OJtJnOi+ZSJ/p/GQifaYpyUT6TBckE+kzTU0m0me6MJlInykxLSW1l2zTU1J7yXZRSmov2S5OSe0l24yU1F6yXZKS2ku2S1NSe8l2WUpqL9kuT0ntJdsVKan/KxtyXRU3Y7r9tyG3c6PlLNUNuSv/25DbT30gUpx9oIgNuQn7vCF31f/Khlzu//SGXM5/G3KZdtf9sSHXNdSG3MY6OWPzskZOLvQt1dDxeRm5eWKv7rYDvFPXeR936jr///bzqpL77HA76zvcPT6iqpb8iGpXFxVfTw0s6J+zZgX+KCrZ8/95UG1iRnbWiKHjJgzLzho+dDhzDy1oG9Hzb/2v5/8/9xV7/P9cn66a7NO7Ot+Qgr7Xf2fX+7dqsC695xNmz+zstuNysyZm5GUOHTkhZ/g/n8j+e7e/4gHuvj33sfv23OfovIjVh1vs3XeP+6++pyc7HbfvyUgRuYo8GmkY6k5W+tfU0i2UuqZ91qXbP+OyfNrHBMy0jwns+yXN7uqXNIu6sF8wlAsGX/9dY6/rP0MvP8xF+nzgVap5xfp8Vqg3AuaFeEprL1n23oULrTuLmirc3XN69X+i2eG5mdwaI4bmTMjOzhqZlZn773Q+LnfspMn/Teb/TeZFawoymVeWAWqnXZ2u7799LsxMvmzEzlrhHDx7F8S7N8q+csg+9tXyxdPOJZLl2W1Yjir4oTB5N/XfrZN/79RKTrPQRoPlFhqTILuRjr3E/M5ZE5MjfHcZ/u0ju2X/WxH5T6Y23s4qHnrOBO4amTl5N8jieUHnJvH38WJuRi9pOE19mPf+Q5hSLSWS9ZPmr4ydTwAk2803e8ELBYWt7xE3pPQD0Rjx3XL+P0ZZpff0eQQA",
       "custom_attributes": [
         "abi_private"
       ],
-      "debug_symbols": "tZ3RjtxGkrXfRde+YERmZGT6VRaLgWdGOxAgeAYa+wd+DPzuW8kiz1dqbaWo7vaNGZbU8bFYPKfI4Kns/3z4+8e//v6Pv3z69X/++e8PP//Xfz789cunz58//eMvn//5t19++/TPX29/+p8P2/yP1Q8/e/vjpw82/89v/20/fXC/b8p9U++buG/afZP7ptyajNvG7hu/b8p9U++buG/afZP3Tb9vxr6ptx+wuG3rsY1j245tHtvbT9mNWsd9G9uxtWPrx7Yc23ps49jOfvPF+v5i57/qt/8r+4G4/de3n+4HZG5vP+N2295+xv22zbm9/euqf12Ov43bn8b+p3P/8van47717djasfVjO8l5+6k2f6rf/vT24nq5b+p9c2s4++bed8Jvf2gTsG/HfTsB81/1/V/d+tTb/4z7j3z4ucy3dX+X57+b+252/p39cfvf83T4y29fPn6cf/NwftzOmn/98uXjr799+PnX3z9//unD//vl8+/7P/r3v375dd/+9suX29/ejtXHX/9+294a/s+nzx9n9cdP/PT2p/xo2+rxw5n8uPW83CDa2WBLNfCtX23QSxwNemcP3OJqA/c4X4N7H2pRrr+IYeeLGL0/HIVxucE4d8E2i6cdcvUq+jhfRdmKWlT/qkN/3qEWOxrUsGc/v9yDynGM/qyDLQ6DbVPix3F42ImXx8FsdSi383weo3BK1Zf74av9sL5pR3wbz7uUlTa28y1ptybPe9TFQa3n2e3t4bWU8SOvpXVOrnx+RBZvTNnyaFFqfXhb6tUGtZ3Hsw72wMZllXY/T65eHyT29c/bWLwb7dRoy3hNg9zK6VS2va7BeXKnP92Dpcuc58Jwe83Px3kejBzPft4XJ6OVsPOMvtXVadKu7oSFTiWL8WjYef1U8NOpuj++Evv6Q8Nz9VK6RFHLq3bjthdFfpeoom5fq8IXp0R1k+k+vpRav/4ELittZj17lG7b8x4r02yyqtH2S7P/2yIu9yjleY/yDq+lvkOPWPTwdr6W4t2fv5bFftw+fM7DEc/Nf3V2WBS08viJ+nIvFp/qlqZLi/R81X6kzDu7Pe1Qt7cei5XYSjs7eDV/qvm6+CR0PgjdHw7Fi0+xWlavY5MHlwf/K/1rF62r82Krp2+M7cEBv+mxOj/VojxccPr42oZrW32imz7St4ePox/qYbrUKrfPg+c9Vledlroy8Ic7gBc+vH4pLrFu0V73Ulo9Lw9Ki/rKHvqALa298m1p+kAozcvregxJvow6nvaI+ue+LSP1Uh4vOF7uxkr1lVuKOvpT1Ucu7yl0Y3OrH66i2480qYWL6DrqsyarFxNVd2jxsBthX3Voy8vwbfxfoo2vfbQtP6UbrwMzj6/fk+Zv98BW3u6Brb7VA1u83QOXPS56YMs3i239Uq554LLHRQ9c97jmgese1zxw2eOiB2b5c9+Wix64Er330Im+lf5M9NlWV0/eNEcoZTw4R/m6Sb5d99nfrvscb9V9396u+2WPi7rv/uYTbLkbFzW77nFNs+se1zS77HFRsz3/3EP6Dpq9SSV0hg17ptmxPsF0klqWZ5cLyxbb0Btrw5+28DcPdcfqnt5Ripen1z1jNXjyplnLrfbnN+Tf6eJJl/J8zHH1oHprT1/O6moyQ9PljPH0oPbVQdV5XuoWT/di4aOuceTtTX4YLV8/ErW49uHh6c+LfbgNnd/+gWCbv/UTwbbydh/9TpNrJrhuctEFbWtvtsHv7Mg1H1yfIkM+GHVxiizO017Pl9Ifh70jfqDF0PjpYbj5TYvVYyVj6Gy10qS0l4+mls9i/DwcN9jDJVS8eF9Wj5UYb46HB1MlXu5HffulnFm8g3StvVm6lm+/mls3uXg5Z6sHPFdVt9yRq0a0bnLtiu47TS662bLJVTfz+icf14tuttTveJDvwxH5Rr7rJ0/ys9uzMFs06e8g4NVY/7KAy/ZmAa8eHF0W8LLJVQGXt9/xr3fkqoDXTa5qb/WRZcrWWI18/pFVchViCFeI4cFKbh/nL5r01RzX9eSlPgQIqpUXTVZPw25TX6mvxvMmqwdRmWeP3mzRwt5Be6tnUZe1t3oadVF7q4dRl7W3bHJVe/UdLlmXO3JVe+smF7W3PONL0X1zi8XJGts7nGnxHndY8fY7rCjvcKYtm1w90yLefqatX821efu6ydXTdd3k4rVevMeda7zHnevq+dS7vDlXr/XWH3xD6T0Pf/7B197jRqu9x41We/uNVnuPG632Hjda7R1utNp73Gi197hHWp5pVbcVt30az8+0XDpj6s3xxwjxyx6rAenQkyYb+TzjuOrhRHh9q8+DlqvHVZHnbrTHpGX7kb0g6vM4f/9mL/qfuhdGJvu2R687ntbL23tILv6VXH6kR9GZ7iWenxu9rG59NQ20eSH0qh5VF1a3q7j36JGv7BHMA1t7bQ+NAmq3t7+W1/aITa8lbHt7j/LaHpUerT7tsXpgdU21672Q4qwtFLd61HRtL9YfCnr81x4frnzzoTBW91RVs6bbeW5PPxTWPWTotfbyvMcq5Od6MbfPuvH2Hs2f9rh+UOvTg+qrR1a380NjlWb5bEd89cQqTE4Y/vh9htf2iOdv7vLBSNeDEe9PH4wsn/BEcAX08Ep+5DF112Cn9Npe1WIonne79Xhli0qLeFWLuukZ0a0cr2vBt7C28soWTYI1f/rU35cPqlwH4zbMfhiUvcgLua1v1nXPYY/ff/qxJvriT7Fq79Ak3qVJWzRZHdhS9JFfHi5fvm2yevhfSISVfGqF3+nB/UIZ7ZU9NBu+9XjuhOsDwplW2uKtcX/7AVn3uHZAvrMf73BAnO9YPXzO/dhpVv3hyrIujurqC51dt+rei722Cd9g7A/Bw2+bjDdfP1zv0RbnyOrFjIf89cNH/zcvprx5lurlHWap6yYXJzFe3j5LXe/IxUnMd5pcG4N+p8m1cc66ycUxqK+eU73Lcb04Bl2e8rfzS69mK4tTvpZrz7zL80vV7/TgaWZp+coe5cFb++v8OYIv5T1+ZfOH/Dl0yi+brDOmXLBuj+lOv95iD5EdFvCwesKPtCiphNf85uuTFr56ROWDr1ve6vH0Kzrf6yLh+W3wbs+7LE6Rq6tBrA8rqbfHbOU3xyTe5dW05R3J0O3E4/e1t+1Fk1VipfOV7f4w0n15SDxWD0Q3rajgjzcDP3RcvZIkbk/PeF/38G68OQ/f7X15XNddypByvCzO2HWX0PDuVr96X+pGIjmefzfNV0+qrp73yyaXT7fVk6rLp9vqwczV0+07R5blbW51Lo7sWA7hzmPycJ68XKBmvR+dW5O2PfeT8g5vTfo7vDWrJ1Xv4gS3S3h96sTT71d4xmrGoZWD7Cs3eXF1tHpS1V370b3a84HickeKa+BcHnP0L3dkYa/pOVhd5HGJlJen6ne6aAJ/q+N5l75cn2PbOCrblq/clx5D+zIeljT6Zl9WX7FS8jseUxpb/4G3h5sCywd3/ebtWfXojH16Pu/RFz1auOZpt9skG88PyKpLKzL6W93tdW/Ow+PmLL54i3tfjeP1Udwev97dfqRF6tXEw6o4P9Ii9DWWFg+3nz/UovPO9Octlu8uz2pudT5/X1bftbp4RNctLh3RZYtrR3Td4soRXX5EBDeubXv+oTneIWbt4x1i1mV7c8y6bO8QTP5Ok2sTknWTixOSsr39SwHf2ZF3+Kpn48V89QDsxRo92/JqtQZ5lTqeftaVbRVY0ZJWj99tnKGRH9iR0O38rR5P70iKvccFwCqoPfQgLB/XDNqX/vjv2//+8rdPX75eSHWuaTpz5nNR03qsajq3dTu2dmz92JZjW49tHNt2bPPYHv3q0S+OfnH0i6NfHP3i6BdHvzj6xdEvjn5x9GtHv3b0a0e/dvRrR7929GtHv3b0a0e/dvTLo18e/fLol0e/PPrl0S+Pfnn0y6NfHv360a/bvIr66b5Q6rlSaj+WSu3HWqnz37VjO9emnX/ej+24b8d2bO3Y+rEtx7Ye2zi27dge/cbRbxz9brcwZ2Fn4WdRzqKeRZxFO4s8i34WZ2c7O9vZ2c7Odna2s7Odne3sbGdnOzvb2dnPzn529rOzn5397Oxn57nq7/x4trnu773oZzHmWqi3Yq4FfC/sLHw+6Z9FOYt6FnNV4Lm87lwXeH8gYFNG+3fPbQrpqMZZTTEdlama6+navmjvXFH3vnxvVTVX/Z0JR9vXEb5Xqarv4+FZjbPa1xO+V5NRJ2NfU/he7asUt1lVVaGqqUpVXdU4q7avWTwXFG6mal8XeO5zK6omY3qiTflZ3/9d2+9/Z5WqJmPsSxGPs5pC3EeBNqV4VJMxLxcs95WO939Xd7edVeyGPau5ovF+dKcs3fY/67Paf3ac1RTnUdkc3cx9ngI9qqJqMvalkqdMj6qp2ldVnq9jivWoxllNwe43ujZM1WTMmxobRdVklP1vQ9VkzJtKm/I9qq5qMuZ8xKeGj8pUTcZ8fOhTxkdVVU3G9CXfmqpU1VWNs5pq9hm58ynno3JVkxH7v5uMGVL3ffXpezUZ8yzxfQXqezUZU5c+Zb1/I9/3JZ7nVYVPYR+Vq5qMKVef2vbcF6MOVU3V/lG2/0RXNc5qKvyoTJWrmoype5/i9nl2+lT3Ue2d91XFu6q98+TWTdW+9/NoTHXfX+/U9J1RQ5X2eWr6qLoq7XNon0P7HNrnKKrEiDhfR+z7PPcluqpxVm1TNTvPaIxPJfv0NZ9KPqqqKlQ1VamqqxpnNZV8VKZKjBQjxUgxUowUI8VIMboYXYwuRheji9HF6GJ0MboYXYwhxq7k/YzYlXyvynlG7Eq+Vztj/9umKlV1VTsj5lL0O2NflN5UuaqiqqoKVU1VquqqxlmZGCaGiWFimBgmholhYpgYJoaL4WK4GC6Gi+FiuBguhovhYhQxihhFjCJGEaOIUcQoYhQxihhVjF3TU91l1/S92h1p/9uqKlQ1Vamqqxpntav7XpkqVyVGiBFihBghRogRYjQxmhhNjCZGE6OJ0cRoYjQxmhgpRoqRYqQYKUaKkWKkGClGitHF6GJ0MboYXYwuRheji9HF6GIMMYYYQ4whxhBjiDHEGGIMMcbJqNumylS5qqKqqgpVTVWq6qrEMDFMDBPDxDAxTAwTw8QwMUwMF8PFcDFcDBfDxXAxXAwXw8UoYhQxihhFjCJGEaOIUcQoYhQxqhhVjCqGdF6l8yqdV+m8SudVOq/SeZXOq3RepfMqnVfpvErnVTqv0nmVzqt0XqXzKp1X6bxK51U6r9J5lc6rdF6l8yqdV+m8SudVOq/SeZXOq3RepfMqnVfpvErnVTqv0nmVzqt0XqXzKp1X6bxK51U6r9J5lc6rdF6l8yqdV+m8SudVOq/SeZXOq3Qe0nlI5yGdh3Qe0nlI5yGdh3Qe0nlI5yGdh3Qe0nlI5yGdh3Qe0nlI5yGdh3Qe0nlI5yGdh3Qe0nlI5yGdh3Qe0nlI5yGdh3Qe0nlI5yGdh3Qe0nlI5yGdh3Qe0nlI5yGdh3Qe0nlI5yGdh3Qe0nlI5yGdh3Qe0nlI5yGdh3Qe0nlI5yGdh3Qe0nlI5yGdh3Qe0nlI5yGdh3Qe0nlI5yGdh3Qe0nlI5yGdh3Qe0nlI5yGdh3Qe0nlI5yGdh3Qe0nlI5yGdh3Qe0nlI5yGdh3Qe0nlI5yGdh3Qe0nlI5yGdh3TepPMmnTfpvEnnTTpv0nmTzpt03qTzJp036bxJ5006b9J5k86bdN6k8yadN+m8SedNOm/SeZPOm3TepPMmnTfpvEnnTTpv0nmTzpt03qTzJp036bxJ5006b9J5k86bdN6k8yadN+m8SedNOm/SeZPOm3TepPMmnTfpvEnnTTpv0nmTzpt03qTzJp036bxJ5006b9J5k86bdN6k8yadN+m8SedNOm/SeZPOm3TepPMmnTfpvEnnTTpv0nmTzpt03qTzJp036bxJ5006b9J5k86bdN6k8yadN+m8SedNOm/SeZPOm3TepPMmnTfpvEnnKZ2ndJ7SeUrnKZ2ndJ7SeUrnKZ2ndJ7SeUrnKZ2ndJ7SeUrnKZ2ndJ7SeUrnKZ2ndJ7SeUrnKZ2ndJ67zueUKTVpSz+nVnnX+azuOt+rc2qVmrRlKaqqqlAlxn3mVmZ1Tq2ybqpMlava7/y3WZ3TnqyhqqlKVV3VOe3J2FSZKldVVIkRYoQYIUaIEWI0MZoYmr6lpm+p6Vtq+paavqWmb6npW2r6lpq+paZvqelbavqWmr6lpm+p6Vtq+paavqWmb6npW2r6lpq+paZvqelbavqWmr6lpm+p6Vtq+paavuUQY4gxxBhiDDGGGEOMIcY4GX3bVJkqV1VUVVWhqqlKVV2VGCaGiWFimBgmholhYpgYJoaJ4WK4GC6Gi+FiuBguhovhYrgYRYwiRhGjiFHEKGIUMYoYRYwiRhWjilHFqGJI510679J5l867dN6l8y6dd+m8S+ddOu/SeZfOu3TepfMunXfpvEvnXTrv0nmXzrt03qXzLp136bxL510679J5l867dN6l8y6dd+m8S+ddOu/SeZfOu3TepfMunXfpvEvnXTrv0nmXzrt03qXzLp136bxL510679J5l867dN6l8y6dd+l8SOdDOh/S+ZDOh3Q+pPMhnQ/pfEjnQzof0vmQzod0PqTzIZ0P6XxI50M6H9L5kM6HdD6k8yGdD+l8SOdDOh/S+ZDOh3Q+7jr3mSvYVJmq86nHuH+K79X51GPcP8X36nzqMUqq6qrGWd11HrM6J/njrvO9KqqqqlDVVKWqruqc5I+7zvdKjBAjxAgxQowQI8QIMUKMJkYTo4nRxGhiNDGaGE2MJkYTI8VIMVKMFCPFSDFSjBQjxUgxuhhdjC5GF6OL0cXoYnQxuhhdjCHGEGOIMcQYYgwxhhhDjCHGOBm26XHarTRKpyyUlTIoG2VSdkpoBs2gGTSDZtAMmkEzaAbNoDk0h+bQHJpDc2gOzaE5NIdWoBVoBVqBVqAVaAVagVag3f1gpja2uyHcS6M8H7zN3yhFed6i3MqgbJRJ2SmHSt3Iz9+bS+mUhRJaQAtoAS2gBbQGrUFr0Bq0Bq1Ba9AatAatQUtoCS2hJbSEltASWkJLaAmtQ+vQOrQOrUPr0Dq0Dq1D69AGtAFtQBvQBrQBbUAb0AY03fmb6dbfTPf+Zrr5N9Pdv5lu/810/2+mAYCZJgBmGgGYbdAMmkEzaAbNoBk0g2bQDJpBc2gOzaE5NIfm0ByaQ3NoDq1AK9AKtAKtQCvQCrQCrUAr0Cq0Cq1Cq9DwEsNLDC8xvMTwEsNLDC8xvMTwEsNLDC8xvMTwEsNLDC8xvMTwEsNLDC8xvMTwEsNLDC8xvMTwEsNLDC8xvMTwEsNLDC8xvMTwEsNLDC8xvMTwEsNLDC8xvMTwEsNLDC8xvMTwEsNLDC8xvMTwEsNLDC8xvMTwEsNLDC8xvMTxEsdLHC9xvMTxEsdLHC9xvMTxEsdLHC9xvMTxEsdLHC9xvMTxEsdLHC9xvMTxEsdLHC9xvMTxEsdLHC9xvMTxEsdLHC9xvMTxEsdLHC9xvMTxEsdLHC9xvMTxEsdLHC9xvMTxEsdLHC9xvMTxEsdLHC9xvMTxEsdLHC9xvMTxEsdLHC9xvMTxEsdLHC9xvMTxEsdLHC9xvOQeCZyjXLtnAu9l6grvSAXey/160veyUJ5xT7snA4+yUSZ9oSW0vlEapVOeuU+7BwPnINnuycCjTMpOOVSOjfKMUpprcmGu0YW5ZhfmGl7cykaZlJ3yvPG3ogmGFY0wrGiGYUVDDCuaYljRGMOK5hhWNMiwokmGlQ2aQTNoBs2gGTSDZtAMmkEzaA7NoTk0h+bQHJpDc2gOzaEVaAVagVagFWgFWoFWoBVoBVqFVqFVaBVahVahVWgVWoVWoQW0gBbQAlpAC2gBLaAFtIDWoDVoDVqD1qA1aA1ag9agNWgJLaEltISW0BJaQktoCS2hdWgdWofWoXVoHVqH1qF1aB3agDag4SUFLyl4ScFLCl5S8JKClxS8pOIlFS+peEnFSypeUvGSipdUvKTiJRUvqXhJxUsqXlLxkoqXVLyk4iUVL6l4ScVLKl5S8ZKKl1S8pOIlFS+peEnFSypeUvGSipdUvKTiJRUvqXhJxUsqXlLxkoqXVLyk4iUVL6l4ScVLKl5S8ZKKl1S8pOIlFS+peEnFSypeUvGSipdUvKTiJRUvqXhJxUsqXlLxkoqXVLyk4iUVL6l4ScVLKl5S8ZKKl1S8pOIlFS+peEnFSypecg827hcu92TjUQ6V94uR/Vtb3Sj3i5G2l4Vyp93/QVA2yqTslEPlOGfrVjVotapJq1WNWq1q1mpVw1armrZa1bjVquatVhm4BgPXYOAaDFyDgWswcA0GrsHANRi4BgPXYOAaDFyDgWswcA0GrsHANRi4BgPXYOAaDFyDgWswcA0GrsHANRi4BgPXYOAaDFyDgWswcA0GrsHANRi4BgPXYOAaDFyDgWswcA0GrsHANQq0Cq1Cq9AqtAqtQqvQKrQKrUILaAEtoAW0gBbQAlpAC2gBrUFr0Bq0Bq1Ba9AatAatQWvQElpCS2gJLaEltISW0BJaQuvQOrQOrUPr0Dq0Dq1D69C6xvL3JOVRGqXG8vcw5VHqFpE4pZGnNAKVRqLSiFQamUojVGmkKo1YpZGrNIKVRrLSiFYa2UojXGmkK414pZGvNAKWRsLSiFgaGUsjZGmkLI2YpZGzNIKWRtLSiFoaWUsjbGmkLY24pZG3NAKXRuLSiFwamUsjdGmkLo3YpZG7NIKXRvLSiF4a2UsjfGmkL434pZG/NAKYRgLTiGAaGUwjhGmkMI0YppHDNIKYRhLTiGIaWUwjjGmkMY04ppHHNAKZRiLTiGQamUwjlGmkMo1YppHLNIKZRjLTiGYa2UwjnGmkM414ppHPNAKaRkLTiGgaGU0jpGmkNI2YppHTNIKaRlLTiGoaWU0jrGmkNY24ppHXNAKbRmLTiGwamU0jtGmkNo3YppHbNIKbRnLTiG4a2U0jvGmkN434ppHfNAKcRoLTiHAaGU4jxGmkOI0Yp5HjNIKcRpLTiHIaWU4jzGmkOY04p5HnNAKdlnhJ4iWJlyReknhJ4iWJlyReknhJ4iWJlyReknhJ4iWJlyReknhJ4iWJlyReknhJ4iWJlyReknhJ4iWJlyReknhJ4iWJlyReknhJ4iWJlyReknhJ4iWJlyReknhJ4iWJlyReknhJ4iWJlyReknhJ4iWJlyReknhJ4iWJlyReknhJ4iWJlyReknhJ4iWJlyReknhJ4iWJlyReknhJ4iWJlyReknhJ4iUdL+l4ScdLOl7S8ZKOl3S8pOMlHS/peEnHSzpe0vGSjpd0vKTjJR0v6XjJPTe6D7/vwdF76brCO6Kj91Jj+SM8ei81lu9ahsG61mGwrni4dYfm0LQWg3VFxK0rI25dyzHYPT26z9fv8dGjTMpOqbF8V1TcjgzpfT0P3dqTIjVipEaO1AiSGklSI0pqZEmNMKmRJjXipEae1AiUGolSI1JqZEqNUKmRKjVipUau1AiWGslSI1pqZEuNcKmRLjXipUa+1AiYGglTI2JqZEyNkKmRMjVipkbO1AiaGklTI2pqZE2NsKmRNjXipkbe1AicGolTI3JqZE6N0KmROjVip0bu1AieGslTI3pqZE+N8KmRPjXip0b+1AigGglUI4JqZFCNEKqRQjViqEYO1QiiGklUI4pqZFGNMKqRRjXiqEYe1QikGolUI5JqZFKNUKqRSjViqUYu1QimGslUI5pqg4HrYOA6GLgOBq6Dgetg4DoYuA4GroOB62DgOhi4Dgaug4HrwEsGXjLwkoGXDLxk4CUDLxl4ycBLBl4y8JKBlwy8ZOAlAy8ZeMnASwZeMvCSgZcMvGTgJQMvGXjJwEsGXjLwkoGXDLxk4CUDLxl4ycBLBl4y8JKBlwy8ZOAlAy8ZeMnASwZeMvCSgZcMvGTgJQMvGXjJwEsGXjLwkoGXDLxk4CUDLxl4ycBLhrzEN3mJb/IS3+QlvslLfJOX+CYv8U1e4pu8xDd5iW8bNINm0AyaQTNoBs2gGTSDZtAcmkNzaA7NoTk0h+bnWN6PhOu9HCrLOZb3e8L1KM+xvN8Trkd5juX9SLjey0aZlJ1yqFTk3TcNXH3TwNU3DVx908DVNw1cfdPA1TcNXH3TwNU3DVx908DVt4AW0AJaQAtoAS2gBbSA1qA1aA1ag9agNWgNWoPWoDVoCS2hJbSEltASWkJLaAktoXVoHVqH1qF1aB1ah9ahdWgd2oA2oA1oA9qANqANaAPagKaHN256eOOmhzduenjjpoc3bnp446aHN256eOOmhzduenjjtkEzaAbNoBk0g2bQDJpBM2gGzaE5NIfm0ByaQ3NoDs2hObQCrUAr0Aq0Aq1AK9AKtAJNaXk3peXdlJZ3U1reTWl5J+HqJFydhKuTcHUSrk7C1Um4OglXJ+HqJFydhKuTcHUSrk7C1Um4OglXJ+HqJFydhKuTcHUSrk7C1Um4OglXJ+HqJFydhKuTcHUSrk7C1Um4OglXJ+HqJFydhKuTcHUSrk7C1Um4OglXJ+HqJFydhKuTcHUSrk7C1Um4OglXJ+HqJFydhKuTcHUSrk7C1Um4OglXJ+HqJFydhKuTcHUSrk7C1Um4OglXJ+HqJFydhKuTcHUSrk7C1Um4OglXJ+HqJFydhKuTcHUSrk7C1Um4OglXJ+HqJFydhKuTcHUSrk7C1Um4OglXJ+HqJFydhKuTcHUSrk7C1Um4OglXJ+HqJFydhKuTcHUSrk7C1Um4OglXJ+HqJFydhKuTcHUSrk7C1Um4OglXJ+HqJFydhKuTcHUSrk7C1Um4OglXJ+HqJFydhKuTcHXHSxwvcbzE8RLHSxwvcbzE8RLHSxwvcbzE8RLHSxwvcbzE8RLHSxwvcbzE8RLHSxwvcbzE8RLHSxwvcbzE8RLHSxwvcbzE8ZKClxS8pOAlBS8peEnBSwpeUvCSgpcUvKTgJQUvKXhJwUsKXlLwkoKXFLyk4CUFLyl4ScFLCl5S8JKClxS8pOAlBS8peEnBSwpeUvCSgpcUvKTgJQUvKXhJwUsKXlLwkoKXFLyk4CWsn+ksoOmsoOksoemsoeksoumsoukso+mso+kspOmspOkspemspekspumspuksp+msp+ksqOmsqOksqemsqeksqumsquksq+msq+lFaXkvSst7UVrei9LyXpSW96K0vO9h1/1Xb/gedj3Ltv+mw73M+SsI7n075VA5veQsjdIpy17+MX8DwZdPv/z188d/f/j5P/PXDPz+69/OXylw+9/f/v+/zr/565dPnz9/+sdf/vXln3/7+Pffv3ycv35g/t0H23/9wIef/6uVn7LM304Q5594+6m0+Sft/JO0n7rNP8nzT+ZvYbzdCfz3H/M3G/wv",
+      "debug_symbols": "tZ3hjtxGkoTfRb/1o6MyK7PSr3I4LLy72oUAwbvQ2gccDL/7sdhkRGt0XeqZHv8xQ9JMfiSbmcxKRtO/f/j7p7/+9s+/fP7lH//6z4ef/uv3D3/9+vnLl8///MuXf/3t518//+uX7W9//3CZ/4F/+KnlHx8/YP6pbf/Njx9au27suvHrpl83cd3kvrEtCHzb4ti2Y2vH1o/t9svo2zaObR7bcWzruvXLscWxbcfWju38vY3r49jWddsvxxbHth1bO7Z+bPuxnfsxD7vthz1/qrY/2X5Ktv82fLyemrndfqe1bbv9TrNtm3O7/bTzp7cjxLYnLba/7fvfzv0b17+d23Y5tji27dhO8th+K85YM0TOP4ztR7YjHnbd+HWzRe/bT4z9x+eebH+JSdu3dd1O2vyp2n9qi+PzA75+3tsOzH3H9fPe/q7NP7Xz3/DH9sfzMvnLr18/fZr/cnPdbFfTv3/++umXXz/89MtvX758/PA/P3/5bf+h//z751/27a8/f93+9fLxw6df/r5tt4D/+Pzl01R/fNRvX/6UX42LH7+cqV/HGA8H6HEGuCQDtEs9GmBYPwKMoT1oiEcDtNbPY2htFEPYKw6i7DwIr7fsQ+E8CzWGTmM9/DlUnceAC/rdCGN1GlynoWsn3L6JUPcj4DLT9tiJjrs7geVxXM6rscp0QfiL3QBW+4Fx4Y7MS+lulLa6si91BIktyP0Ytjinfl6bLW6P5fKaY4mhTzbvn5HlRzvOQ2l2sXsf7bwG74VwwxHBbz7ZFwEWn6td8vh9c7+pE/3RAB7nR+qVN5fWwyk22nl5D79JsW93oK2SPM4cjexvCZAXVglc3hbgzK9sd/dgWWXOy7Ea3vL7/bwUK+vuAfTF1Wwd55W4aW8K8vDniM5LCb1uK/54/FJo59U82u2R4Nu7ThurQxnMS7c37ca2F8aKm8oKv3x7Rm2VFg1MzNtDcce3MRY1xtLPGDZwuR9jUS0rWC0rEHer1MMxzO7H8Hc4lv4OMRb10lqcx2JttPvHstiP7f53no5+//5jy1wx5crtPf1ljNVdPcHWIlu+aT+SxTsH7kZwPHsuVslmcUZojnY35311O2+8QFsLnc4XdzH31XFcWIPtpv7Z+LYA+uq6uPhZN+pyUwG/i7G6PhnCbhrOtt1av4mQqzs6eEu/3NyOXhUD7PZsux/cj7G4Pq3yLMT+Tev7mkNpTNZLj7cdSvjZHlh0f2MM3mAt4o0fSzFdrW4XIy9idP9zT2kla+hts/ByN1YZ61qQeI27GdtzuSRh47rpmyY8XhPETT24l98LsqrEKmCorlPa2zcRYtlCX+r/S7j+bQ2MVRVlC7sdhwpx//YzifZ8/Qp7vn6FP1u/oj9fv5YxHqxfkU8n2/pQHqtfyxgP1q91jMfq1zLGg/Ur2597Sh+sX6uEbaPzIr3YuJew2VddSwuOEMzqJuv92yDxfM5mPp+zOZ7N2aznc3YZ48GcHXj6AlvuxoP5to7xWL4tYzyYb6P/uafjHfJtu8w7r47CvXwbq0mZF9OtB+7dptchRjDEzUT6RYi6PD+KXVyh268Njh7b3X6jFlUULTif2HS7v4j9QZSWimL3RwOPntTbbHl5OKvZU3YOhbPX3ZO6KKRN+bbNWuzuXizqaOMIb/uQb07F42ditPMwtvvLuLsP9Xwt3wvlc8V8G1k/XwLXQR6sX7jY0wXsBzvyWAVbf7iDE8Fqdz9cXBYX6fDz+hi3o82KV4QoDltuRnnfh1iNRzVihbuCWL58FrR+oHRWY+BmZmN9vHiAspo9cZhXN0+CLF4+g8HzDRRWz5MezrrVA6UHsw7+fA+1DvJgE4XVM6VHs265I4/WkHWQx/qodZBHC9HqCc+7nJIHC9Ey9eom85rdz7xmq0ckLEXbQxssgrzDwBTtHSamW4PydO61d5iZroM8mnvt+anpekcevn+vbhSgAQTe8/6NwpbP6nvjs/qbBLbeXwRZPqxv7O785iG1w18E8dXhgKPC7XgWQRaXa/KzGTdrkO9DvMOaH/YOi37Y06t+2Dss+9dBHk0bf37hv96RR9NmebGauRZEi+vsPR5G4T2eRuH5x1F4j+dReI8HUniHJ1J4j0dSeI9nUniPh1J4j6dSeIfHUniP51I/uN0UrWGtt/u3m9VTpYeTr493SL5eTyffevT2YPItgzyafPH87H+9Iw9X6NVF4myht3B1/yJZP2BKntd2ezQvqnzE6tEjH0Og8q7xbBmjydrZLt7vx1hcqz3P3Yhb+1u8Zi/ohWy3A96Xe5GXP3UvIDfltkdvO5/QoOftMfKiGPm2GEb7WLN+/9rIpamPM/Otd7K3xXC2M5hz4edj5BtjdI2tIt4ag8teH3j+WN4ao194LB2X52PYW2O4YoTfjTH82axd7wUzbqv99z/ZEc/uxfqmQPNq+E0t/u6msJoSb4tTeqE9cfemsI7Bgu4+7G6MWnpPeTDbva6ejxHtbozHT6rfP6lly+uDc4hA3j+Y1VUKVsLebk3mb43R73+4y/n94Py+jbvz++WDiDItP26e2b3iOai1C5uoZv6mENYYwt4awhTC3xbC5bvymyvjVSGgEO2NIXhXsdtq/iJEu6yGU9tFyUexN4XDX5hJ2mXteeJyAbffi3ldEH4bw+B4hyD9XYLEIsjqxJrxlm837ct3QVYPqsxkF7K8Wwp/EEPrBat4YwwOU7cYdyvhD06IrjSLxUezfJDx6Anxdzgh/mefkKYvvtzc5153mXm76Sx9cVZr9Yz5IgOB4a1B9M22ceNK+y5Iw9P9w+MxYnGNrA6mboy1NwX++4N52pDa2js4UtdBHhyitPa8J3W9Iw8OUX4Q5LHh4zrIg8PHZviTT8mDw8fl1bpdGq7WbHG1mj/2aNbud5k/iKEndxb5xhh2UxbH20pr7/qS0+1X4F5VWjuv1mWQ9RCUNz27lGrRS4P+egTKpMGtefAVISzpgvSL3wuxPe1cHcmFPrVN3yz8X3zjYRmlVXneRPH7URafzKNfz1+fVi6q7NZ39905WY3Kasj9V+PmO33fHc3yuU5oKXC5LWmvi1KhrnX5+fzgiNgKfPNt+9dFefRT7qv7uJ53bRftzX38ghdBVl7Toa8Gj5sp9ctLpfXVk9ULXx7Qbtc3r7reGsur3XYlL6+33pcrV31nftP3r5R1FA16prY3Run8Bue2oH77vnCquUVp96/a1dOqR+vBMsjDl9vq21QPX26r51WPXm4/OLNh+nzycv/Mrr5Tpe/b3b5i4eVbTNbX/ciby+RN957H62y8S51dR0m+mGXT0d8aZSjK7dsnXrsv/SZKvTHKw3eO9i53Dn+HJEx/hyRcfs3qPWq+a1h5+46Ul9f+6ltWaHyZEb65b7xYH6y+ZTUa92M0x91p+HpHhgZa42ak/nJHxvLNTl1vTOm33x95eZEs98Qan9vYzROT7/ZkcbmmDV70m755nvZyT8aiMdiGJbxeN71InfW+1OBbXLYMiPtRFhes06Hfb81Bl9ec2OCjX2S98SOOxvdORdyOpb87mFWUdE6TNp3tbSfWjZOPTS8+ntXzqPABPku6+dJ5vCZE8pz0m/fsvCZEN/pZ+83s5FUh+Lxzk3dDrD/dzi/Px8zg+2e0P39G+/NntD9/RvuzZ3R5i+ga3cTlbntkq+9dPWobs9V3lR61jdmlPTvxtOX3rh6cEa6DPDjes8vzX2H9wY68w3dYQwcTPu5fIquHtxdXB33xurvms9U3QPQF0tsvbU6j0St2pHMWtem6W0Bs9e2rh++7qy+BFStZ3r5AaH+XyH9vf/z5b5+/fvu61vnK1Mmdr0ydze58Zerczlem7lsc23Zs7dj6se3HNo5tHtsjnh/x+hGvH/H6Ea8f8foRrx/x+hGvH/H6Ea8f8eKIF0e8OOLFES+OeHHEiyNeHPHiiBdHvDzi5REvj3h5xMsjXh7x8oiXR7w84uURbxzxxow3X7Haju2MN443r47j1avb+R9xbLd40/43xrGt67YuxxbHth1bO7Z+bPuxjWN7xKsjXh3xtucnp8Ap2insFH6Kfoo4RZ5inOKMjDMyzsg4I+OMjDMyzsg4I+OMjDMyzsjtjNzOyO2M3M7I7Yzczsj7u4XnG3b3twvvYpyi5vJhE/ONw1eBU7T5vZQp7BR+ij6/PDpFzDeZTjFfIDwH79hfPXxVdar99cNXBar5qt65psP+EmLsyqnmC4WvbwsOqqSajLlywf6i4l3tryq+qv2lyfMQ9tcVX9X+ouP9X52qUwVVUg2qOlXsr1GerwIOUE3GfA0OZuYdajLm8hyxvxh5Hm/sr0aeZy+San+d8R6lTpX7K43n7yaoJmO+BgC5v1J5/7nJqP1fJ2P/FGZOYnrWMbOyXfa/G3Oxu/9unWrm5qGwL4WnalRG5VNN2szSQwVV7lOjqQZVnap2xv6uZlBNxv7O55m1h/J9wDdVp9pfCb3/a1INqsmYC+g2U/hQoJqMaQZqM4sP5VSTMYe2bSbyoZJqUNWpZjK36WxsM5sP1aj211Tvb6B2qp1RUwVVUg2qOtX+Yun99dU4xSTMa67NvN5HoW0mdpvP4trM7ENNQt/fLZ5UkzCvw9b2l2fPs2InYaZ3m+v1NvP7UEY1EbH/XKeaiPmWw7bfKq9qUNWpZpK3aVVuM8kP1aiMyqk61WTMrqrNJD/UOA9oJvlVzSQ/FKh2RpvKqJyqUwVVUpHRyQgygozYGfOUxs6Y5yqc/7oz5jmIoEqqyZim1zaT/Kpmkh8KVJMxy2ubqb1PWNtM7UPNyLNVa3tqX9UeeTL21N7VntpzJdb2hN4j7wl9VX7u1eA+D+7zntDXn+M+D+5zcZ+L+1xk7Am97/2exrNYtT2NryqpBtWMPF8pYnsaj/2196Bqx1HansZXNfd+vrjD9jS+qqBKqp2xR9kZ83f3NL4qUDUqo3KqThVUSTWoyGhkNDIaGY2MRkYjo5HRyGhkNDKMDCPDyDAyjAwjw8gwMowMI8PJcDKcDCfDyXAynAwnw8lwMjoZnYw9k+dVbHsmX9V+xe7/2qmCKqkGVZ1qz+SrAlWjMioygowgI8gIMoKMJCPJSDKSjCQjyUgykowkI8kYZAwyBhmDjEHGIGOQMcgYZAwyiowio8goMoqMIqPIKDKKjDoZfrlQgapRGZVTdaqgSqpBRQbIABkgA2SADJABMkAGyAAZjYxGRiOjkdHIaGQ0MhoZjYxGhpFhZBgZRoaRYWQYGUaGkWFkOBlOhpPhZDgZToaT4WQ4GU5GJ6OT0cnoZDDPnXnuzHNnnjvz3Jnnzjx35rkzz5157sxzZ54789yZ5848d+a5M8+dee7Mc2eeO/PcmefOPHfmuTPPnXnuzHPf83x+jcH3PL8qo3KqThVUSTWo6lR7nl8VGUVGkVFkFBlFRpFRZNTJ6JcLFagalVE5VacKqqQaVGSADJABMkAGyAAZIANkgAyQ0choZDQyGhmNjEZGI6OR0choZ1fVjQwjw8gwMowMI8PIMDKMDONxOBlOhpPhZDgZToaT4WT42R12J6OTcc3zmqpRGZWfv7vn+VUFVVKR0Xmu9jyfPWbfs3t2kX3P7qtyqk61732bat/7PcqgqlPl2YH2BNXZgfY0qrMD7dmpgiqpzg6059nx9HGhAlWjMiqn6lRBlVSDiowio8goMoqMIqPIKDKKjCKjTkZcLlSgalRG5VSdKqiSalCRwW492K0Hu/Vgtx7s1oPderBbD3brwW492K0Hu/Vgtx7s1oPderBbD3brwW492K0Hu/Vgtx7s1oPderBbD3brwW492K0Hu/Vgtx7s1oPderBbD3brwW492K0Hu/Vgtx7s1oPderBbD3brwW492K1HJ6OT0cnoZHQyOhmdjE5GkBFkBBlBRpARZAQZQUaQEWQkGUlGkpFkJBlJRpKRZCQZ1zyvOVe/UIHqXNnEMKqzUwh268FuPditB7v1YLce7NaD3XqwWw9268FuPditB7v1YLce7NaD3XqyW09268luPdmtJ7v1ZLee7NaT3XqyW09268luPdmtJ7v1ZLee7NaT3XqyW09268luPdmtJ7v1ZLee7NaT3XqyW09268luPdmtJ7v1ZLee7NaT3XqyW09268luPdmtJ7v1ZLee7NaT3XqyW09268luPdmtJ7v1ZLee7NaT3Xr62Skk7+LJu3h2UDUqo3KqThVUSUVGJyPICDKCjCAjyAgygowgI8gIMpKMJCPJSDKSjCQjyUgykowkY5DBbj3ZrSe79WS3nuzWk916sltPduvJbj3ZrSe79WS3nuzWk916sltPduvJbj3ZrSe79cFufbBbH+zWB7v1wW59sFsf7NYHu/XBbn2wWx/s1ge79cFufbBbH+zWB7v1wW59sFsf7NYHu/XBbn2wWx/s1ge79cFufbBbH+zWB7v1wW59NDLYrQ9264Pd+mC3PtitD3brg936YLc+2K0PduuD3fpgtz7YrQ9264Pd+mC3PtitD3brg3k+mOeDeT6Y54N5Ppjng3k+mOeDeT6Y54N5Ppjng3k+mOeDeT6Y54N5Ppjng3k+mOeDeT6Y54N5Ppjng3k+mOeDeT6Y54N5Ppjng3k+mOeDeT6Y54N5Ppjng3k+mOeDeT6Y54N5Ppjng3k+mOeDeT6Y54N5Ppjng3k+mOeDeT6Y58U8L+Z5Mc+LeV7M82KeF/O8mOfFPC/meTHPi3lezPNinhfzvJjnxTwv5nkxz4t5XszzYp4X87yY58U8L+Z5Mc+LeV7M82KeF/O8mOfFPC/meTHPi3lezPNinhfzvJjnxTwv5nkxz4t5XszzYp4X87yY58U8L+Z5Mc+LeV7M82KeF/O8mOfFPC/meTHPi3lezPNinhfzvJjnxTwv5nkxz4t5XszzYp4X87yY58U8L+Z5Mc+LeV7M82KeF/O8mOfFPC/meTHPi3lezPNinhfzvJjnxTwv5nkxz4t5XszzYp4X87yY58U8L+Z5Mc+LeY4LE32TkGySJumSXTIkU3JIigbRIBpEg2gQDaJBNIgG0SBaE62J1kRrojXRmmhNtCZaE62JZqKZaCaaiWaimWgmmolmoploLpqL5qK5aC6ai+aiuWgumovWRevn89xN7rTapUmK1kXronXRumhdtBAtdGyhYwsdW4gWooVoIVqIFqKlaClaNh5mipaiXWvG9QdC8nySv8khWZTjwrhDZ3KIxufvm3TJLrkPQGOX5/PxTRbltW5cJSSbpEnuB9R2qQMqHVCl5D5lzV3WKXF9Hj92CcmdFrs0SZfskiGZkudUFOCoD+CsD+CwD+C0D+C4D+C8D+DAD+DED+DID+DMD4BoTbQmWhOtidZEa6I10ZpoTbQmmolmoploJpqJZqKZaCaaiWaiuWgumovmorloLpqL5qK5aC5aF62L1kXronXRumhdtC5aF62LFqKFaCFaiBaihWghWogWooVoKVqKlqKlaClaipaipWgpWoo2RBuiDdGGaEO0IdoQbYg2RBuilWglWolWopVoJVqJVqKVaHxYgManBWh8XIDG5wVofGCAxicGaHxkgMZnBmh8aIDGpwa4evX2G9XVrHdISJ7TV1z9eoc852RoHCqicaqIxrEiGueKaBwsonGyiMbRIhpni2gcLqI10ZpoTbQmWhOtiWaimWgmmolmoploJpqJZqKZaC6ai+aiuWgumovmorloLpqL1kXronXRumhdtC5aF62L1kXrooVoIVqIFqKFaCFaiBaihWghWoqWoqVoKVqKlqKlaCka1zBoXMSgcRWzSUg2SZN0yS4Zkikp2hCtRCvRSrQSrUQr0Uq0Eq1E08LGtLAxLWxMCxvTwsa0sDEtbEwLG9PCxrSwMS1sTAsb08LGtLAxLWxMCxvTwsa0sDEtbEwLG9PCxrSwMS1sTAsb08LGtLAxLWxMCxvTwsa0sDEtbEwLG9PCxrSwMS1sTAsb08LGtLAxLWxMCxvTwsa0sDEtbEwLG9PCxrSwMS1sTAsb08LGtLAxLWxMCxvronXRumha2JgWNqaFjWlhY1rYmBY2poWNaWFjWtiYFjamhY1pYWNa2JgWNqaFjWlhY1rYmBY2lqJpYWNa2FiKlqKlaKolplpiqiWmWmKqJaZaYqolplpiqiWmWmKqJaZaYqolplpiqiWmWmKqJaZaYqolplpiqiWmWuKqJa5a4qolrlriqiWuWuKqJa5a4qolrlriqiWuWuKqJa5a4qolrlriqiWuWuKqJa5a4qolrlriqiWuWuKqJa5a4qolrlriqiWuWuKqJa5a4qolrlriqiWuWuKqJa5a4qolrlriqiWuWuKqJa5a4qolrlriqiWuWuKqJa5a4qolrlriqiWuWuKqJa5a4qolrlriqiWuWuKqJa5a4qolrlriqiWuWuKqJa5a4qolrlriqiWuWuKqJa5a4qolrlriqiWuWuKqJa5a4qolMjdC7kbI3gj5G+EakhwOx9plSoqmWiKXI2RzhHyOkNERcjpCVkfI6wiZHSG3I2R3hPyOkOERcjxClkfI8wiZHnF1Pe6HKdsj5HvEYXzcf+BaS67ytNrh6n08pEly3HS1Px5SNKTkkCzKdnrucFgfsUuTdMkuGZIpuR/Q9Zt5OiDTAV0LyFXui7bcpUnuBzR22SU5bjqckFc5JIvyWkCuEpL7se0IDUm6hiRdQ5KuIUnXkKRrSNI1JOkaknQNSbqGJF1Dkq4hSdeQpGtI0jUk6RqSdA1JuoYkXUOSriFJ15Cka0jSNSTpGpJ0DUm6hiRdQ5KuIUnXkKRrSNI1JOkaknQNSbqGJF1Dkq4hidyTkH0S8k9CBkrIQQlZKCEPJWSihFyUkI0S8lFCRkrISQlZKSEvJWSmhNyUkJ0S8lNChkrIUQlZKiFPJWSqhFyVkK0S8lVCxkrIWQlZKyFvJWSuhNyVkL0S8ldCBkvIYQlZLCGPJWSyhFyWkM0S8llCRkvIaQlZLSGvJWS2hNyWkN0S8ltChkvIcQlZLiHPJWS6hFyXkO0S8l1CxkvIeQlZLyHvJWS+xOG+rF26ZJfcS/FVpiQHCaEhSWhIEhqShIYkoSFJaEgSGpKEhiShIUloSBIakoSGJKEhSWhIEhqShIYkoSFJaEgSGpKEhiShIUloSBIakoSGJKEhSWhIEhqShIYkoSFJpGgp2hBtiDZEG6IN0YZoQ7Qh2hBtiFailWglWolWopVoJVqJVqLRtQnZNiHfJmTchJybkHUT8m5C5k3IvQnZNyH/JmTghBycSC1sUgub1MImtbBJLWxSC5vUwia1sEktbFILm9TCJrWwSS1sUgub1MImtbBJLWxSC5vUwia1sEktbFILm9TCJrWwSS1sUgub1MImtbBJLWxSC5vUwia1sEktbFILm9TCJrWwkc0T8nlCRk/I6QlZPSGvJ2T2hNyekN0T8ntChk/I8QlZPiHPJ2T6hFyfkO0T8n1Cxk/I+QlZPyHvJ2T+hNyfkP0T8n9CBlDIAQpZQCEPKGQChVygkA0U8oFCRlDICQpZQSEvKGQGhdygkB0U8oNChlDIEQpZQiFPKGQKhVyhkC0U8oVCxlDIGQpZQyFvKGQOhdyhkD0U8odCBlHIIQpZRCGPKGQShVyikE0U8olCRlHIKQpZRSGvKGQWhdyikF0U8otChlHIMQpZRiHPKGQahVyjkG0U8o1CxlHIOQpZRyHvKGQehdyjkH0U8o9CBlLIQQpZSCEPKWQihVykkI0U8pFCRlLISQpZSSEvKWQmhdykkJ0U8pNChlLIUQpZSiFPKWQqhVylkK0U8pVCxlLIWQpZSyFvKWQuhdylkL0U8pdCBlPIYQpZTCGPKWQyhVymkM0U8plCRlPIaQpZTSGvKWQ2hdymkN0U8ptChlPIcQpZTiHPKWQ6hVynkO0U8p1CxlPIeQpZTyHvKWQ+hdynkP0U8p9CBlTIgQpZUCEPKmRChVyokA0V8qFCRlTIiQpZUSEvKmRGhdyokB0V8qNChlSUhiSHJbV2CUnRVEtkS4V8qZAxFXKmQtZUyJsKmVMhdypkT4X8qZBBFXKoQhZVyKMKmVQhlyquNtXrYaqWyKiKw6l6/QGX7PsLmXcZkrm/jniXY/+fMu2yKGctOSUkm6RJumTf/zcouwzJlBySRRkXSUg2SZN0SdFCtBAtRAvRUrQULUVL0VK0FC1FS9FStBRtiDZEG6IN0YZoQ7Qh2hBtiDZEK9FKtBKtRCvRSrQSrUQr0eqktd3hekpINkmTdMkuGZIpOSRFg2gQDaJBNIgG0SAaRINoEK2J1kRrojXRmmhNtCZaE62J1kQz0Uw0E81EM9FMNBPNRDPRTDQXzUVz0Vw0F81Fc9FcNBfNReuiddG6aF20LloXrYvWReuiddFCtBAtRAvRQrQQLUQL0UK0EC1FS9FStBQtRUvRUrQULUVL0YZoQ7Qh2hBtiDZEG6IN0YZoQ7QSrUQr0Uq0Eq1EK9FKtBJNtQSqJVAtgWoJVEugWgLVEqiWQLUEqiVQLYFqCVRLoFoC1RIcteSP+brTr59//uuXT//58NPv852mv/3yt/P9pdsff/3ff5//8tevn798+fzPv/z767/+9unvv339NN91Ov/tA/Z3nX746b/CPqbNV6H2829afLSYf5Pn3yQ+Dsy/GeffzP9fEbD91HyN6v8B",
       "is_unconstrained": false,
       "name": "entrypoint",
-      "verification_key": "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA4AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAwvz8DYSJxF/ETpneJ/B12Y0AAAAAAAAAAAAAAAAAAAAAAAJQocUs5uZD4fk15dXmPAAAAAAAAAAAAAAAAAAAAAzqsJg+0vclV7mGoQfGovG0AAAAAAAAAAAAAAAAAAAAAAAhpBzPvPGwNFfpKxg2xJQAAAAAAAAAAAAAAAAAAACZSL7qGW7BMkBA61vIxwTlvQAAAAAAAAAAAAAAAAAAAAAAIEq2c2Oj0Xrd+7mNW4ESAAAAAAAAAAAAAAAAAAAA3xx+YDkiEbRBK4RHX7bGhfMAAAAAAAAAAAAAAAAAAAAAAB0D85yZgNzSFe8+dGJ0eQAAAAAAAAAAAAAAAAAAAAPYGriZtGfAIJv8n8cWKS8iAAAAAAAAAAAAAAAAAAAAAAAht6nZvFe8xPcG9Iri/+cAAAAAAAAAAAAAAAAAAADokJvWyStogF4GIoT5FxXrQgAAAAAAAAAAAAAAAAAAAAAADyHy2zfjZXSa7hstyDJ8AAAAAAAAAAAAAAAAAAAATS69Km2Rqyu+zSdAUxVX6IEAAAAAAAAAAAAAAAAAAAAAAAwR2A9rshyzThSqNS7ChgAAAAAAAAAAAAAAAAAAADkCigMcoNTZ3lq044EL/7xWAAAAAAAAAAAAAAAAAAAAAAARbw56oPb4vy8Jz52nkkAAAAAAAAAAAAAAAAAAAAA6igppT+K4++JNEOzMPhjHgQAAAAAAAAAAAAAAAAAAAAAAKnUT1oNg+SXm6vUAonLQAAAAAAAAAAAAAAAAAAAAElV+4S9ngxQImOtKvlXSB04AAAAAAAAAAAAAAAAAAAAAADA70JsNlkxY1R59RR36fQAAAAAAAAAAAAAAAAAAAEFoY2jPkjfM1bYejFxWQQ/gAAAAAAAAAAAAAAAAAAAAAAAoGE0G4sgMK+LM/HOmnh0AAAAAAAAAAAAAAAAAAAC0wBlKTHSMq6ts56R4XHGckAAAAAAAAAAAAAAAAAAAAAAACriBIGo3fj0gj3St6zgRAAAAAAAAAAAAAAAAAAAAP1GxsJUdE4zPWRfIl6wGQicAAAAAAAAAAAAAAAAAAAAAAB7Bnj2G6QjKjH4DJOusIgAAAAAAAAAAAAAAAAAAAPbt7Ew/tJRwYVno++wBx7KSAAAAAAAAAAAAAAAAAAAAAAAX/tAtxR5aQvxM2duBqiIAAAAAAAAAAAAAAAAAAACqjw28nRKrdHU3bimqFPNwLAAAAAAAAAAAAAAAAAAAAAAAE6bkcaByH8fUC00a2IzCAAAAAAAAAAAAAAAAAAAAdWTrXN10Cggby2qn4iCYcL8AAAAAAAAAAAAAAAAAAAAAACBdBv3hwgGDY8cfNkGiawAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAqxdHEds8e+iF/lEUAIQ/iE4AAAAAAAAAAAAAAAAAAAAAAAxTyOWbqbbEVTPWxVutsAAAAAAAAAAAAAAAAAAAAKCTx3JGw0RPNRQxkR35GYaiAAAAAAAAAAAAAAAAAAAAAAAOELGavq/IMULj8DE2ICkAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAI5R4B1vjkIlbrcJO4epPsPoAAAAAAAAAAAAAAAAAAAAAABC2m+vVOPEZuuN3ANRQoAAAAAAAAAAAAAAAAAAAAFjCG3zTQHLPjuMKkYPHXQwOAAAAAAAAAAAAAAAAAAAAAAAoqHFPCtoRjcJ2+6jYgtIAAAAAAAAAAAAAAAAAAACnsR5vskdZw+1dZVBnVQ1N4QAAAAAAAAAAAAAAAAAAAAAAAea/+18gvecW6hA0/Qt+AAAAAAAAAAAAAAAAAAAApHAd8kGciq6mYavu2AXh+7EAAAAAAAAAAAAAAAAAAAAAAAjRHSL6rDHFtwWyd5Rb+QAAAAAAAAAAAAAAAAAAAKEK7w1JFakbM/Dhsc9iNlYbAAAAAAAAAAAAAAAAAAAAAAAY5mmb/wOL64LkhV07vKUAAAAAAAAAAAAAAAAAAACsOycO+Fs2kAh51qP7JEqSCAAAAAAAAAAAAAAAAAAAAAAALHh3DeVSgmueucIpGnSlAAAAAAAAAAAAAAAAAAAAMi8pWFxuRYJMzHazfDTD9aIAAAAAAAAAAAAAAAAAAAAAAAKvqENweOKTo2qZb/fEywAAAAAAAAAAAAAAAAAAAI7wrXFlGIp8rC5zNeWmXjZJAAAAAAAAAAAAAAAAAAAAAAABMCOTfqgRYn88yUTHhMMAAAAAAAAAAAAAAAAAAADlk8bUsuGSPZJnWd2QXPnSnQAAAAAAAAAAAAAAAAAAAAAAAMXkHjQb4PbwKvgqQqZMAAAAAAAAAAAAAAAAAAAAmDgWYEkCGHkcmcMTpM9G00IAAAAAAAAAAAAAAAAAAAAAACaV28/exasEp99U3UWOTQAAAAAAAAAAAAAAAAAAAHP7qRLn2NV6moDpSJdL4UpyAAAAAAAAAAAAAAAAAAAAAAAuA4WusnHqZGS3I5uU2/0AAAAAAAAAAAAAAAAAAAAXao1RWnj7wj/p7IfLWg4IsQAAAAAAAAAAAAAAAAAAAAAAHENX0peitComzSD8ScAXAAAAAAAAAAAAAAAAAAAAkrcze/ztbMSZ5eypxWw+P5cAAAAAAAAAAAAAAAAAAAAAAAljHvz5s2WcocNYcVr3PQAAAAAAAAAAAAAAAAAAAMnL4B7l1EZTuF++Bm0MHLRvAAAAAAAAAAAAAAAAAAAAAAABmou7Oa5TJ+ymIEb+PbcAAAAAAAAAAAAAAAAAAACpqPqpNlIVegtmJohNn9QR3wAAAAAAAAAAAAAAAAAAAAAADamB/dFOX503Wt721LdcAAAAAAAAAAAAAAAAAAAA7QE5Pe0zBG/7gr7Q50knhv4AAAAAAAAAAAAAAAAAAAAAABmEh9SzXPB4syTYKsTLwgAAAAAAAAAAAAAAAAAAAKleAkPcFKZEOleUqCloxCtGAAAAAAAAAAAAAAAAAAAAAAAD4rUm5dXKka8hfz7TsyAAAAAAAAAAAAAAAAAAAADMXcjH4sAVXMtjVSBL7XWEEQAAAAAAAAAAAAAAAAAAAAAADCeZpfQXJpuf/bZbMyG1AAAAAAAAAAAAAAAAAAAAwBXFVjA+uN5BJ1mPx957e4kAAAAAAAAAAAAAAAAAAAAAAAm590jiLwePHL4q68JupQAAAAAAAAAAAAAAAAAAAMTQz41+57MxJ1g9u8MILNS6AAAAAAAAAAAAAAAAAAAAAAAOW5vEJtGr/xA0yeH2o3AAAAAAAAAAAAAAAAAAAACWWsPQ0es/H7r+ixHtOgZH9wAAAAAAAAAAAAAAAAAAAAAAB/gLIUUzxZG0VC1Awld5AAAAAAAAAAAAAAAAAAAAoo2JGyez06p8U8FeTHyUR8MAAAAAAAAAAAAAAAAAAAAAABkEaHu6SZIkaxXu2DFgngAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAjXp9kTSdm4TNgPDETNh2Z5QAAAAAAAAAAAAAAAAAAAAAAJ2ILGXAuCHE6bMreVowLAAAAAAAAAAAAAAAAAAAAa5zY1HU8QOww9Po0FyKy8LAAAAAAAAAAAAAAAAAAAAAAACgtvWLo95p8+dL8lJ+t6AAAAAAAAAAAAAAAAAAAAFMnbT/XJAYadAombfyx8w/qAAAAAAAAAAAAAAAAAAAAAAApqD6kNDBLUT+LeVu+dzsAAAAAAAAAAAAAAAAAAABEO4J5IeT3KGfHrm0hyBriqAAAAAAAAAAAAAAAAAAAAAAABVZTs4IagEoNB/KFwwYgAAAAAAAAAAAAAAAAAAAAPferxhDuR/Du4b0NN/ay6O8AAAAAAAAAAAAAAAAAAAAAABRZT1NswlJXzKlGLpN5pgAAAAAAAAAAAAAAAAAAAOPl42VROe5m1Ta1E1O7VHpSAAAAAAAAAAAAAAAAAAAAAAAmnbkeyqoTL4HPNLs8J9EAAAAAAAAAAAAAAAAAAABjVSn5a0EqjKD+gCF4HqZfDwAAAAAAAAAAAAAAAAAAAAAADGPTTWcijBAHAwg+CGv0AAAAAAAAAAAAAAAAAAAAmvCITgwsHjGai4m5EL60IO0AAAAAAAAAAAAAAAAAAAAAAAX/Vud/7ENsK6eCAhV5XwAAAAAAAAAAAAAAAAAAADUH8b4s8tW6PwQbgNfH9JdHAAAAAAAAAAAAAAAAAAAAAAApgGHARKkHaa7KpRJxyVAAAAAAAAAAAAAAAAAAAADb2V0uuO+Tp0OdHhF/qFwu6AAAAAAAAAAAAAAAAAAAAAAACNoMNYoWhCDlRonZrNVoAAAAAAAAAAAAAAAAAAAAybfNsj8GdoQ6PXTSP7PCnVkAAAAAAAAAAAAAAAAAAAAAAC1QaYqNV/YPZAh+FO7lKQAAAAAAAAAAAAAAAAAAACU+xDFVcNeCJG4c43sHcbKoAAAAAAAAAAAAAAAAAAAAAAAJBsnKpOeu//zRsThhT2sAAAAAAAAAAAAAAAAAAADZpIwLj9rBQdn4rBmUiKbTbAAAAAAAAAAAAAAAAAAAAAAAFGWLXqani+kPP9LODfW8AAAAAAAAAAAAAAAAAAAAu04MOraKCkGlMjtS3ZXsfLIAAAAAAAAAAAAAAAAAAAAAACAT1/vWyiY+ART3OunOvQAAAAAAAAAAAAAAAAAAAHeoOhy5Prk3xwX/I5QMIm5/AAAAAAAAAAAAAAAAAAAAAAAYj9g6rf7txp3pHRpLdYEAAAAAAAAAAAAAAAAAAAC7wIu16U06k9T8OaYqyfYAgQAAAAAAAAAAAAAAAAAAAAAAMCPDkFgW3rHZdL9sI5iyAAAAAAAAAAAAAAAAAAAA2+3IJ01j7YQ4rKmr5VN7SFcAAAAAAAAAAAAAAAAAAAAAAAOTrQNab4Gq+vkPvfqh8wAAAAAAAAAAAAAAAAAAAIudXK8Z26gHNqB9SFnLBgorAAAAAAAAAAAAAAAAAAAAAAAqtebOHa6g3h1SYi0DiaA="
+      "verification_key": "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA4AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAA/SzoBLrz3+YbsAiVsr9ogIAAAAAAAAAAAAAAAAAAAAAAAASRawn6tl0YlHL6riQGnwAAAAAAAAAAAAAAAAAAAG81VwnvmQmL8k9quGplfmGRAAAAAAAAAAAAAAAAAAAAAAAiMSytt9rYw6i7OLSNz80AAAAAAAAAAAAAAAAAAADY9dOrBBobA3vLdfWaYb09UwAAAAAAAAAAAAAAAAAAAAAACoKRhw+icpe1tMy8EtwWAAAAAAAAAAAAAAAAAAAANvAKh8JuSo+GiN5cY7VPTU0AAAAAAAAAAAAAAAAAAAAAABYaO7BSUOcAHSZTf6KQAgAAAAAAAAAAAAAAAAAAALtd3IHhzM3RHu0njsknJG59AAAAAAAAAAAAAAAAAAAAAAAjIJJ/sZytAGzCsqzkNXMAAAAAAAAAAAAAAAAAAADoew7KkXrKEGEC7mLh85ECegAAAAAAAAAAAAAAAAAAAAAAJHwfE7c1kIY6EAASF+NcAAAAAAAAAAAAAAAAAAAApOgPfCXeo5CvTC3lXlCevFkAAAAAAAAAAAAAAAAAAAAAACQAOL/CbZY1lTvXysQFaQAAAAAAAAAAAAAAAAAAADqdr0CIxBjhzQV4Fu0UcZaYAAAAAAAAAAAAAAAAAAAAAAABWRbI/mOK+y4qYYOGGDMAAAAAAAAAAAAAAAAAAADEQXsRWY+y3LBJlPcJYsSEWgAAAAAAAAAAAAAAAAAAAAAAJT434/FZZNAZRqJbhb5QAAAAAAAAAAAAAAAAAAAAZJEHyzKow7zlVdGiH333ljMAAAAAAAAAAAAAAAAAAAAAABQndNIsp5eZKg8iayWCkwAAAAAAAAAAAAAAAAAAAH2lcPjdBM6iKRUPke3GDdcfAAAAAAAAAAAAAAAAAAAAAAAgAGRwytT9lvqTwGCj+MUAAAAAAAAAAAAAAAAAAADioRqUmRbuXsytGC6n1mTXfwAAAAAAAAAAAAAAAAAAAAAAI+LWQkuzZiUB6JRnGlH+AAAAAAAAAAAAAAAAAAAARTfbCucgIettK0BIzq/fOLYAAAAAAAAAAAAAAAAAAAAAAC4MzMlx79t5JHdXK55bBAAAAAAAAAAAAAAAAAAAAD6bqSb9M6sDebjc+7DdL6JOAAAAAAAAAAAAAAAAAAAAAAADYnV8i0Swkou9Je40bsMAAAAAAAAAAAAAAAAAAAAWzJRU8MYYoHO0TIJ8OBpG1QAAAAAAAAAAAAAAAAAAAAAAGcVA3iaq98dczH4vJClfAAAAAAAAAAAAAAAAAAAAAZUPmZuzxjGcwMFVbxs3kv8AAAAAAAAAAAAAAAAAAAAAACJ6XlElIhoI8we8SR5UAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAloZ+iQjyd7F1LCKxkB/a3XQAAAAAAAAAAAAAAAAAAAAAAAgAwpacKOZcnTvnu6QNpQAAAAAAAAAAAAAAAAAAAGfOairSQssmMwImQ/UWH/C+AAAAAAAAAAAAAAAAAAAAAAAuukllf3A/aHLRwfM/tlYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAu1ZJW24jr4u6XUY8Kq8HCnQAAAAAAAAAAAAAAAAAAAAAABOcmknM7ho2fjuMkBSt2AAAAAAAAAAAAAAAAAAAAEO1HrpmgLCAkp2n62PbZ8PMAAAAAAAAAAAAAAAAAAAAAAAREQJFB+TelL4u9vU6RiQAAAAAAAAAAAAAAAAAAABDG7EzvQILt29nOPg5XLza3QAAAAAAAAAAAAAAAAAAAAAAAzjDB07HM2QNCCfM9wb8AAAAAAAAAAAAAAAAAAAARmtgdP3omFihcCRWfV4ZX5oAAAAAAAAAAAAAAAAAAAAAABnSoYV74G40ztCt182Q6wAAAAAAAAAAAAAAAAAAAG0iUQcdI+H+HJtT5EhVznPXAAAAAAAAAAAAAAAAAAAAAAAmi3aYPCorGcBa0Kj9j0cAAAAAAAAAAAAAAAAAAABgtwItJY/k6sKHCf0RVqBLJAAAAAAAAAAAAAAAAAAAAAAAG9U2qBKCxiswa5gEPoABAAAAAAAAAAAAAAAAAAAAQvNl6P0ac+dqGY1blFPIqzkAAAAAAAAAAAAAAAAAAAAAABb3zbmxRTbCKGI97e32hgAAAAAAAAAAAAAAAAAAAMzHLbFd7JXSrPpuodgw7wtuAAAAAAAAAAAAAAAAAAAAAAANB/wvUTCNrSSPT/GOqO8AAAAAAAAAAAAAAAAAAADCUN/kUx6SEWTyto8VBhXteQAAAAAAAAAAAAAAAAAAAAAAISWO0+uvDXMJD6gUnWJvAAAAAAAAAAAAAAAAAAAATOeGRMbbVyaOeEviONnLo9QAAAAAAAAAAAAAAAAAAAAAAAv+Zw6edIb3LPXEgoraBQAAAAAAAAAAAAAAAAAAAIg10u9V0xa15BAkdy9vBvbzAAAAAAAAAAAAAAAAAAAAAAAhEg4kIg7x0+ButThIxqIAAAAAAAAAAAAAAAAAAAC8msjYVWaaEk2tqTNlCmD+sgAAAAAAAAAAAAAAAAAAAAAALcTLKQwjNCNQWOXWsWJtAAAAAAAAAAAAAAAAAAAA3nxACTpxVeocs7UcKvIt0RkAAAAAAAAAAAAAAAAAAAAAAC5f/QAWhWD0odn2jtU1wAAAAAAAAAAAAAAAAAAAABAy23W0ca5zV/PC4D3dgN23AAAAAAAAAAAAAAAAAAAAAAAXJlw+nqM3SGGV5jwy3lkAAAAAAAAAAAAAAAAAAAAX4HGsZtuU6TpqCviRwRzChwAAAAAAAAAAAAAAAAAAAAAAI6fOfvScq7cjGAuo7UnmAAAAAAAAAAAAAAAAAAAAnHmco6r33Dbsf0mwm/BkRREAAAAAAAAAAAAAAAAAAAAAAATdNCmi3hYmsMpv3DT0cAAAAAAAAAAAAAAAAAAAAJTIoecjyfvv+baFtESx3gM3AAAAAAAAAAAAAAAAAAAAAAALfxt1q8kM4/fXkMdBEaAAAAAAAAAAAAAAAAAAAAB3q7FBb25I6mDNXunw5oy39AAAAAAAAAAAAAAAAAAAAAAAKJE7DuDACvPCrMELTJm3AAAAAAAAAAAAAAAAAAAA/OxPiatXA8N03S5KTjk0Ij0AAAAAAAAAAAAAAAAAAAAAACuxHM+DdWnVCzRljeZmRQAAAAAAAAAAAAAAAAAAAPR50WhZ7lKIoOlWN4/WrkuWAAAAAAAAAAAAAAAAAAAAAAAEqoV03JZWom0RciMiCtwAAAAAAAAAAAAAAAAAAAD4YgMsdVfNO9je4D/bWFNY6wAAAAAAAAAAAAAAAAAAAAAAC4bTqlZ68eFclAdgqpOJAAAAAAAAAAAAAAAAAAAAzqwqEI+xjFIZpx94ewcf94oAAAAAAAAAAAAAAAAAAAAAAA3TU+mmpbpHtgOKEAV8swAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA2gS/l3GENzT06d46JEVovSwAAAAAAAAAAAAAAAAAAAAAAJ11fPpjR8k9ECwYz+fpsAAAAAAAAAAAAAAAAAAAAvfz9hwHA2E3d3mDUGEMfFCUAAAAAAAAAAAAAAAAAAAAAACYluardXQYN2tOm9Y3VhgAAAAAAAAAAAAAAAAAAAFMnbT/XJAYadAombfyx8w/qAAAAAAAAAAAAAAAAAAAAAAApqD6kNDBLUT+LeVu+dzsAAAAAAAAAAAAAAAAAAABEO4J5IeT3KGfHrm0hyBriqAAAAAAAAAAAAAAAAAAAAAAABVZTs4IagEoNB/KFwwYgAAAAAAAAAAAAAAAAAAAAPferxhDuR/Du4b0NN/ay6O8AAAAAAAAAAAAAAAAAAAAAABRZT1NswlJXzKlGLpN5pgAAAAAAAAAAAAAAAAAAAOPl42VROe5m1Ta1E1O7VHpSAAAAAAAAAAAAAAAAAAAAAAAmnbkeyqoTL4HPNLs8J9EAAAAAAAAAAAAAAAAAAADJjNmgArFtTFS9mlYYTzAe3wAAAAAAAAAAAAAAAAAAAAAAEsKkb8cFHKN+dHbklrllAAAAAAAAAAAAAAAAAAAAmKmasFHCPFbzoo4q2Ab/7q0AAAAAAAAAAAAAAAAAAAAAACmTX8g/PDx8Yps+Wkfv8wAAAAAAAAAAAAAAAAAAAOaUATC9Drl/L6uze9qrK7mFAAAAAAAAAAAAAAAAAAAAAAABoF1ts25bUxjVqMteze0AAAAAAAAAAAAAAAAAAACo8TYIwJDzetN3EXCluIpEFgAAAAAAAAAAAAAAAAAAAAAAFDj+ujuKXWIduMRizNdHAAAAAAAAAAAAAAAAAAAAkieplYTlrN89Gf/LIha2htkAAAAAAAAAAAAAAAAAAAAAABwU3YpYO42HmOzB5o9yngAAAAAAAAAAAAAAAAAAAKyAR3Num5hHCKr58fkJo1QmAAAAAAAAAAAAAAAAAAAAAAAUpL3XjVcbYWx7JOyCbpIAAAAAAAAAAAAAAAAAAACxFJcIs+bjJiqTZRIKWJvMwAAAAAAAAAAAAAAAAAAAAAAAHsoRg9dcqSUJqFeL0ymxAAAAAAAAAAAAAAAAAAAA53LaPE2Fg1siLX4w7JR4aGAAAAAAAAAAAAAAAAAAAAAAAC7fVGI4DEMQ6vLxqrjGhQAAAAAAAAAAAAAAAAAAABiSR0c0TM/iH2kdaNE2RoFiAAAAAAAAAAAAAAAAAAAAAAALlypFEM1PF4G6UaTaZtkAAAAAAAAAAAAAAAAAAADy5cm5k2fZrA6j/Sd8lSVNRAAAAAAAAAAAAAAAAAAAAAAAFYUWow75kFEJ9FArJhlmAAAAAAAAAAAAAAAAAAAAHvnRNJN+BxKgUjx1HkBfaPwAAAAAAAAAAAAAAAAAAAAAAAh+bIz1sk+CvS2lNYZRKAAAAAAAAAAAAAAAAAAAABlH+dQQhaEMfutIwllSwPWnAAAAAAAAAAAAAAAAAAAAAAAiLnwvPP5BxLPDHJUza2U="
     },
     {
       "abi": {
@@ -6083,11 +6151,11 @@
           "visibility": "public"
         }
       },
-      "bytecode": "H4sIAAAAAAAA/+1dW2xcRxn2nrP3i+NLfEvWe9zsxbd11YYqqqBSlDhJ7dZuoqQBhABnY584qxzvLmd33RoQZal4o8XrJOWd2CZVSB9QuKgICUTgBVkE8RSRFwTipS9FqniokGAd72XOzPnnnDmek+Q09tN45/zfzPz/N//8M2dmjrhWfe9+cm4u882SPD+XU+eyuZKs5jJKcW5OyeevlAtzyxklu5AtrVQrt46rWUXJLk5mFOVa21pl81w2t6jIV1era3eH2uh/rjbDR9rYAF3GgNVtxKWCIgtXV1eNEdfaXKtVoVa4SY08EIcrG5P5XLF0tbJ5IqvK8yWh8pPp2vOLsnrj/OcOGxeJy7uY5L87i8u3sZU/W1nfNma1vYlz86ysZErZZdnNhiSQCB42hLbKT7frspApZSbzhZVmk15B64SA35jNL6+1fhBaz2M5YiPn1Xpre+tP1H+eQUGIVohsrZjZtSZdlfVzpXyhqmkBAoZZfHLjVFZWFu4O+T7/h8xXEtGzdzZ++KPe/qUj/83Nvf/9l7565+hLz73XMfqdj3DBEw1BvHzCLpjgSUAQ/4vhgqdMCnpwwZcbgsLM8tV3711593f3A692dP9l9cN1V7f68YVTk7+52bX5hbefxQWn2FQv4vLTbPLuzbNyqazmKrdO5VU5u5jbptv1+yM7vmQpW5yfyxSLslqazC8Vaua8qMin1cy8In9RVovZfG51da1ye1ZeyqsrxxYWVLlYbOoc+P3UWsPF7agI+09Tj1/vVKNcUuYW5dL5Ulap+bBae0vym6UHbf14CU3KecEcH5jjB3MCYE4QzAmBOWEwJwLmtIM5+8CcDjCnE8zpAnO6wZz9YE4PmNML5vSBObC1B8CcA2DOQTAnCuYMblOOxt0n/j+NbzB85MgLTJjr558//CL9V9Z6r66SY9Mg6yiPja1SK3AhsIdYne+t49lcRl2pCZ0uXG8C36hRZ0fDjZKQEm5P5xZ2hkGscIl10NUW3iqiWTzZZkHrX+9o/OtkplAsK/Ia2AFilfen5EzhmKpmVhCNDglrhNl/fP75ysbOg1WtTYVr5rteI2CAuySMdW23HWK37NDh1zOofqwAHDIZj7SRonGmsmszm1fKS4XpS4idY89V1rd/rCbxPuWh9KmY7X0qBvcpD6c+FSP7lKfVpwgPg1RtoxYZq7J+7iGoOInahemQWGXcKAN2zHeUoZUSSv/1mXxmASUEmgQwE1TMQQIzgSYZaCbZTjPJfppJLDRLolUjOJE0YZskWVySQrMkxTRu1Mmx08yzW5pJVEySZhKarM2xMXO22lUfDG7vFPvwn9OFayi/Z8uKrmgMFoqBQpKO33VvuUbqOp0iiS8gfv1FQ+qdoS0XmAEo01YLzABcpC27mAFQSAAvE0CWBPAxAcyTAH4mgCESIMAEcIUECDIByCRAiAlghQQIMwG8QQJEmAAyJEA7E0CRBNjHBJAjATqYAPIkQCcTQIkE6GICUEmAbiYAnTh5PxPAZRKghwlgmQToZQL4MgnQxwRwkgToZwJYIgEGmACeJQEOMAFcIAEOMgFcwiOCKCVYY5zDX2AP1gbhYC3KKVgbJEOOKBisxdCqEZFVDB3OzUdNMUqwFkMHeO6Qbv6QHv6QXv6QPv6Qfv6QAf6QQf6QIUfoMswfMsIfst0RutzHH7KDP2SnI3TZ7oiG22CeLkc4t25HkMjriD7udwTV9zuClzboUnBEH7eB6j2OCA06n1Ze2lDLXkfU0oZJiugIXnodEcA4Y4Tsc0TDexxBoq6nlZf9jvCX+xzh3Aae1mDQ4wgSOWNRxxmRm88R5vE4AtIG8xxwhMWdMUI6YxnPhgBGdASJntol0QOO8EQHn9bw/1G6DWHz5DfKGaW4vae7+WO8lXxGZ8+a8HDP2sOza1tiqL57bcs1qrP5y8yW5t//8mdenT2fBqKeRoLcOgnvTUixbQ/wsO9NSMF7E5Kc9iakqDs7MW0Mo1UjGDJsIjoZJosbppAOgRT4Q3byh5RYdiI/VgJ5HgmBzCsY2b5887iSmb9yPP9m5c6ZfFHOLuRzh8/I6lK5VHsyn1tD1Jtyo3ZwM+xfpm4kTqJJcHPuw6brCnVpT+GKaLHYMUw3KwkavrId9FUsvS+JqoHG7BQDAagbqlMaekK69Wh1m0LDQUi3Sft0m7Ki2xSqBrq7ZPAaSdu9RtJ+r5HU09Yj8xrJR+A19sYB1Diaw4S/0hwmPFYuXf5StpSTi8Wq/rHBlLsKHBGsZUDH+pJV/Ly4Ffc1RHdfLESluMRhNAlgjlD0O0UgjqBJAHGUgjhNII6iSYrb1pxX0RzIAYXGtEKag12g0LhWaAwVInrYmMnTkJ1weekb58oXkeLRouGW1SdEujxIU9RIyB1CKQIrhSYH0jW9rUrNnM2DNvTGa3ngzFN6W8haZSgcStPkQDZPEI0YR1WNNQLJm9gWsqYZcjab3nJ9qzmHXTFxxHLL9cDiTLdN99xvHBMV/tz99bJ3/WvzE8ORk//u77r29tG773zv6HAar9s4ZYBK2z5ApeEBapzTAJUm3d04ONOdQKtGhG4TKB9APhLFTVDmkBMoNbhDJvhDxlginLjtBIrbH+HEqREOpo00WjVCj2lTXpkoLk0xTdpEDGEdcoQ/5Ciusji/EFnkGiLH7QuRx3c56TFvlbjeTOmD2vBWyp6bzygZtZa8Cq+soDYEi/XoFXsTjqU9JvxoioppsLzAwLBh213UsP0MG6banRjxkaoRPbXJzJehwsapdNYBNDa2dcgEf0iJ5UKghO30Sdh/IVCCSh/znJMsrcokzK3KxPXKoziZuCZIgCYdCe16Y5wMdMj1Rsm+9caY4XpjXO/1HaIGgtlxE52FrttBi7qVQN0mQd3G7NNt3FC3CYMxh9BtguI1YhSvIdnuNSh30cQ4eQ3JitdIUN8+M3gNya1xIQyVjNG8hubaF/h6Ftr6ziGW9Z0UKgf2Tnw1QrMhDF6niVOWOGIE6BiKYXalb7RhvBOwSFzrB0bMlUOoSkJ5BrTKTVcVZe1FMrP2Mv23jy8Zr73gf2IjgbuIxJP6uidh3+ueBBiXptCqEa42hRLB/JwhRYn5EMgof0iRP2QcvAZah0BR2wkUhQkkciJQlEog8z5ftDTGRN2aAYehkiJtjImiSfK2LTOOSFw6+9beNEUz44Avv0tQb6oTGZyXycvvBP6QUf6QcfC6edeur4y3QCARJpDAiUAilUDme7dgyZuIbo1rYaikQPMmIprELypEJLvr78PxR7pbyR7gkZ5Wsh94pL+VHKg/grFrgN9Y1cd1rBqwb6waAN2TpBkDKPe1ehlGOZNXwPr4Q/r5Qwb4Qwb5Q4b4Q4b5Q0b4Q7bzh9zHH7KDP2Qnf8gu/pACf8j9/CG7+UP28ofs4w/Zwx+ynz/kAf6QB3XuJzYz4fm06z9/Z1lh9bIN6v3sEYXX/hVWL3WxFNOGD60aYQKfCdfgI4vzUayKQB7ag9yD3IPcg9yD3IP8LEBu7HIJqm3XEUkv7RsEJldJiJ2aSHPqr8KEFUh9/pszcrH4+uVMDt+FhjSJ3Ant3xI+bYJ/W+czBgbRXl9Tg1jt/ZRoL2j76mQQjvb8nKK9IMlXPxjthdCqEVwOmegeIbK4EKV7OA4yQPuEhilL+Ux1oHegqgvGHSigezBe+LAJvgqC65GlmSRXiQU0aX4bp+baA+o2TvBFvlf79l9AhaBdQH77dgEJhruAPAYL8ATpNB7RPChir0FLW2S9VHv5CEwvmgTt5dPaS9M4yF6CffbyGNrLa3DqjrCXF1USwzswr+2jjNf+d2C62jJ6B+bT6xJW3oF50XdgPrfVLkjtLZhFA/zihnGucUPAvrghgFhU89nmMc0R3Jn8G6+VFSV7KSurs/LSRVktXs4W6odyr4NHbAXOn1XWPfwbHLtu+WO2+oeGx+DvlnrAHJH+MWqG7WsIgUV8zx46KFL27InE7jZE0E26spZg8yPejy6aCG5XFnA0U2C4B8RMQZRJZMwU2hJ+2xxCnoHAw9TlVPMBaBitF66aEJoE6REGg6LQkxkUhViDohCqL/Og1KBIo1vzRg6iFQXEIh80iLfTb0GEsA79IlvCvaZywU32EYDbYTq3a+B/NeZ2uxVuR0ihdrReuP4jaNIst0Oo0GMIIEOG3I7ozTFpAWTEBLcFymx+ypJDpTN70C5m/8OY2UFrzA5uCf8yZnbECrN1YqIIjdlBTcTG7rWDILNDj9NrBylx+xTJaw0Z9pbf0DkOywhmZWIURCdGITeDV9HcWrOrBasAdQMbtEysN/tAKoD3ND+aNF8Rj4kxHHJDASM3JLoQN2TXybR+uCMHrYRfQUPThKnjWoDs/2HUNjCVApRvVwaRFwt4l21265bejrwA6+0Xn/Quv/W/rguV9dfVTKG61pJvNLwxq6lzrP6zt2U8XT/j20QGQlxGaBGk8fiWKGlJgdx4YdaRNSmjKxDABcSWgKbkYOsBze9IjFNXv3gQ04q/hdGwOy7s169dEK8dyLwGIC4QMhAIazsuXkyAsEl4S+yD6MV87UdDY0OAlZuT513y+Z/+MyeFn/9AMubzLgu65/vokz/9cXHVsKD/A5ElGhoqkQAA",
+      "bytecode": "H4sIAAAAAAAA/+1dXWxcRxW2793/H8c/8V+y3nWyf7G9rmiIogoqRYmT1G7tJkoaQAhwbuwbZ5Xr3eXurlsjRFki3mjxbpLyhgSx3VQhfUCBoiIeEIEHkEV5DOSlEm99KVLFA0KC3Xh/5s7cM/fOem6S29gvHu/c883cc74558zszFislN95EJ+fl75TkBfmM+p8OlOQ1Yyk5OfnlWz2ajE3vyIp6cV0YbVcunNCTStKemlKUpQbHZXS5vl0ZkmRr6+VK/dHO+g/nR2Gj3SwAXYaA5ZriMs5RRaur60ZI1Y6OtfKQrVxkxp5KCZLG1PZTL5wvbR5Mq3KCwWh9O5M9fklWb114YuHjZvE5TuZ5L8/h8t3sLU/V1qvGbPc1cS5fU5WpEJ6RXawIQkkgpMNoaP0i1pfFqWCNJXNrTZf6WW0Twj4rbnsSqX1gdB6HqsRGzWv1N92oP5E/eNZFIR4C5HtLWZ3rMnO0vr5QjZX1rwBAoZZfGrjdFpWFu+Pur/0R+nrsdC5exs//snA0PLR/2bm3/vhi9+4d+zFL7zTPfa9T3DBkw1BvH3CLpjgKUAQ/wnjgqdNCnpwwZcagsLsyvW3P7r69u8feF/p7vvb2ofrnX3qpxdPT/3udu/ml689hwtOs6lexOVn2OQdm+fkQlHNlO6czqpyeilTo9vNB4e2fclyOr8wL+XzslqYyi7nqua8pMhnVGlBkb8iq/l0NrO2VindnZOXs+rq8cVFVc7nmzoHPj9dabi4bRVhf2n68dvtbhQLyvySXLhQSCtVH1Z934L8RuFhxxDeQpNyLrDGDdZ4wBovWOMDa/xgTQCsCYI1XWDNHrCmG6zpAWt6wZo+sGYvWNMP1gyANYNgDWztYbBmH1izH6wJgTUjNcrRuPvU/6XxDYaPHD3ChLl+4fnDL9A/Ze332hoZm0ZYozwWWyOtxIXAHmV1vndOpDOSuloVOpO72QS+VaXOtoYbLSEt3J3JLG6HQazxCGvQ1TbeaqLZPPnOgta/3tP41ykply8qcgUcAOHSe9OylDuuqtIqotFRoUKY/ecXni9tbD9Y1tpUuGF+6DUSBnhIwlg3djogdsoOHX4dQPXTDsBBk/lIBykaZWq7OrN5ubicm7mM2DkcL63XPiwfgagX1qMeor/12ay0iCKiRQAzRsUcITBjaBEb+07K2I9YPvYj8Nh3chr7EVJZztbYx7QRR7u2Uc3gVVm/FrRNnGwu3mqOBkmYxoGOkm2aHWMxX9hy84WtN1+YxXwRtGuErpHagwxsiVDMp4GEzRdtmo/lLXfoJSJUTNJLRNBidY6NmbP1XvVgcHe72Ud/nMndQN3TXFHRFQ3DQmFQKKLjdx3TdY3O1H9vdY6RA0BA/PsLhhQ8S1s2MANQpK0amAG4RFt+MQOgkAAuJoA0CeBmAlggATxMAKMkgJcJ4CoJ4GMCkEkAPxPAKgkQYAJ4nQQIMgFIJEAXE0CeBNjDBJAhAbqZALIkQA8TQIEE6GUCUEmAPiYAnXx5LxPAFRKgnwlghQQYYAL4GgkwyARwigQYYgJYJgGGmQCeIwH2MQFcJAH2MwFcxjODECVpY5zLX2RP2kbgpC3EKWkbIVOPEJi0hdGuERlWGA3n5rOnMCVpC6MBnjukgz+kkz+kiz+kmz+khz+klz+kjz+k3xa6DPCHDPKH7LKFLvfwh+zmD9ljC1122eLFLTBPry2cW58tSOSyxRj32ILqe23BSwt0KdhijFtA9X5bpAY9zyovLejlgC16acEkRbQFL122SGDsESEHbfHi/bYgUe+zysshW/jLPbZwbsPPajLotAWJ7LGoY4/MzW0L8zhtAWmBefbZwuL2iJD2WMazIIERbUGiZ3ZJdJ8tPNH+ZzX9f5xuQ9g89e2ipORre7ubH0ZbxQM6e9eE2l617TNsW6JfZ8uXmQ3Nf/jgly6dDbsGos5Ggdz3Cu9ISLBtCnCy70hIwDsS4px2JCSo23IxbSTRrhG8SJrISZJkc0kK1RBIgT9kD3/ICMs+5CdKIOdjIZB5BSObl2+fUKSFqyeyb5Tunc3m5fRiNnP4rKwuFwvVJ7OZCqLehAO1g4Nh8zl1G3EcLYJbcx+9uq5Qr/YMrog2ix3CdLCSoOEhu0BfxTL64qgaaMxOMBCAup06oaEnpFunVrcJNAmEdBu3TreJdnSbQNVAd5cMXiNuudeIW+814nraemxeI/4YvMZuHECNozlK+BvNUcLjxcKVr6YLGTmfL+sfGkw4ysABwWoFdKgvXsZPi7fjvkbp7ouFqBSXmESLAOYhin6nCcRDaBFAHKMgzhCIY2iR4rY1p1U0x3FAoXGtkOZUHig0oRUaR4WIETZu8ixkD9xe6tb54iWkebRp+M3q0yBdHqQoaiTkDqIUgZVCkwPpmqqpUjNTc6IveuvVLHDiKVUTaq8zFA6laHIgmyeJl5hAVY29BFI3WRNqTzPkHDa11bnaPHn19zbnsB2653mjmKjw175vFV3r31yYTAZP/Wuo98a1Y/ff+sGxZAoPPROU0JOyPPSk4NAzwSn0pEhHNgHOYSfRrhFJ2SRqaZBpRHOTlNkhAhnlDxnjDxlmyV2ilhMoan3uEqXmLpg2UmjXCD2mTPlborkUxTQpE9lB+5CH+EOO4SqL8kt+Ra7Jb9S65Hdih9MZ81aJ6s2B3q8GrkL6/IKkSGq1eB1eM0FtCDbr1Gv2NpwlO0340QQV02DhgIFhSctdVNJ6hiWpdiciPtI1YqQ2mfkS1NgElc46gMbGbh8yxh8ywnLRT8xy+sSsv+gnRqWPec5F2lpviZlbb4nqtUdxMlFNkgBNJ2LalcQomeiQK4kR61YSw4YriVG9r+MQNRDMjpoYLHTdjrSp2wio2zio27B1uo0a6jZmEHMI3cYoXiNM8RoRy70G5YqgMCevEWnHa8So3yYzeI2IQ+NCGDoZpnkNzXUu8LUrtJWbgywrNwlUDhyd+DqDZoMXvAITpSxehAnQcRTD7BreWMN4J2GRqNYPHDLXDqGqCMoz4K0cdFU11l4emrh1qPYU81aBRz8z//j0svEKDf4jNgp432JP69c9Meu+7omB2WsC7RrhkBMoXczPLBKUzBCBDPGHFPlDRsFLoHUIFLKcQCGYQCInAoWoBDIfGcS2IlHIoQlLDJ0UaZEohBbJO7bMOCJx+dybu5MZzbwEvrkwRr1mUGRwXiZvLhT4Q4b4Q0bBy+Y7d3xhfBsEEmECCZwIJFIJZH50C215E9GhcS0MnRRo3kREi/g1hYhkX/37cPyRvlaxH3ikv1UcAh4ZahWH649g7BrmF6sGucaqYeti1TDoniKaGEC5RtPFEOVM3szp5g/p4Q/p5Q/p4w/p5w8Z4A8Z5A/ZxR9yD3/Ibv6QPfwhe/lDCvwh9/KH7OMPOcAfcpA/ZD9/yCH+kPv4Q+7XuZXYzITnP73//phlHdbFFtSH2DMKl/XrsC7qkiqmDTfaNcIEbhOuwU0256ZYFYE8uAu5C7kLuQu5C7kL+XmA3NjhElTHjjOSAdp/HjC5SkLs50Rep/5VmLAKqc9ze1bO51+7ImXwvWrIK5E7oT1bwneb4G9B4F7qWgnUI1LIi/YLXxnzoEXzHdEcAwHEfIByvBquEcrxbQnXmtsYDli2VWII3irhM9wq4Sc14jM0TYAU8qNaIUZbALUNzFMv5XJ0H8Jh8n9kGEwqBhsFvAEPZVLhs3wR3AdPKjycJhU+0lQecFLhR7tGGNFvwgv79ZgBe2HbQXpp/5/FlKXcpvz0T6GuC8Z+2qt764Lwsyb4xyC4HlkQ94i7XAEtggScKyp4X+u6ngYNBLylj+5w/VvCu4jDNe+9woYuT4cyAY1zwlTjR4vg5piAdkeNgApB4cJj3c46oZ1wofm6ijZ2AgygCO1G6Lo1b2SfiUgffL9BvO1dSyBCQId+wS3hg6ZywT2aQYDbATq3q+AfGnO7qx1uB0mhLrRfuP6DaNEst/2oEMRtwTpu+w25HaRmNTq7RoMmuC1Q4u90Ww6VzuwRq5j9Z2Nm+9pjdjVN3jJmdrAdZutkP0Eas32a3Izda/tAZvufpNf26XntJgkJXmvIsJswoxtAWCJYO7tGfOiuEb+Dwato5rE7SzEtyAKd1O3bLvrJMnAgusCB6Hw60ycna/qkWX4xD0pNn8yc2nNR7eUmMF1oEbSXW2svzcs9gZTAaWgvF3Wc6aQELlRJDBvuXJa7Tpf1G+50tWXkOt28Nty5UNfpdrQ7BKmjBbOol18wnOAaDL3WBUMvYlH0up8H45r7fmazr79aVJT05bSszsnLl2Q1fyWdq98AdBO8z0cAa1xgjRus8ejfNOQbv4ndGmT+L/0bisYrYB+cYI1YobbEcKIGIbCIHyNCgyLlGJFIHLhBBB2kK2sJbp6TC0U1Q5CxSdgWFY8egan4688GVt78X+/F0vprqpQrV1ryDb41GqqP0PrHrlbM0B1B7k1kvoPLCK3pSOPxLTGijUXIvRhmh2gzUukKeHEBsSWgadnXekDzOTKVrSdz4n5MK54WRiNG4cIe/d758N6BXwc0AHEBv4FAQDtNxJvxEjYJbImDEL2YLwdpaGwUsDIvPv/Tc/aU8KsfRYz5vMOGPnJ/8tlf/rS0ZtjQ/wHq1Dh2KJEAAA==",
       "custom_attributes": [
         "abi_utility"
       ],
-      "debug_symbols": "tZzbbt02F4Tfxde50Frk4iGvUhSFmzqFAcMJ3OQHfgR593JRnJFsQ7S8d3oTfrG9ZyiKw6PhHzd/3f35/e8/7h8/f/nn5uNvP27+fLp/eLj/+4+HL59uv91/eWxf/XGz+D+qNx/DhxsNNx9zK+LNx9oKW4u0FnktylrUXoRlLdr3RFtZRlnXMi6jlFHqKMMo4yhtlP750sq6lraMUkbpn29+FkYZR2mjTKPMoyyjrGuZllG2z2t73hRH2T6vsZVplHl8vYyyrl/PzV9bA+UwyjhKG2UaZR5lGWVdy7KMUkY59MrQK0OvDL0y9MrQK0OvDL069OrQq0OvDr069OrQq0OvDr069OrQk2UBCEABARABBkiADCgAKAuUBcoCZYGyQFmgLFAWKAuUBcoKZYWyQlmhrFBWKCuUFcoKZYVygHKAcoBygHKAcoBygHKAcoBygHKEcoRyhHKEcoRyhHKEcoRyhHKEskHZoGxQNigblA3KBmWDskHZoJygnKCcoJygnKCcoJygnKCcoJygnKGcoYygCZImiJoga4KwCdImiJsgb4LACRIniJwgc4LQCVIniJ0gd4LgCZIniJ4ge4LwCdIniJ8gf4IAChIoiKAgg4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMas9gX6dEgAGaYDCHAqgrBI/eCgJQQABEgAESIAMKAMoCZYGyRy9khwCIAAMkQAYUgCu3JVHw6K3gyr4Y64u5/pUAiAADJEAGNOW4ONQBHr0oDoKvKCAAIsAACdCUY3AogDrAo7eCABQQAK4cHQzgyskhAwqgDvDorSAAV/YW8+it4Mr+yB69FVzZm86jt0JTNn8Kj14Hj555xTx65vXx6Jm/So+euZdHb4WmbO7l0TMX9OilrtOUk7eqR8/c3aOXXNmjl1zZo5dc2aOXfEHt0Uuu7LFK/imP1QoCUEAARIABEiADCgDKFcoVyhXKFcoVyhXKFcoVyhXKdSjHZQEIQAEBEAEGSICmnBeHAqgDPF8rCEABARABTTmLQwJkQAG4cvQtywIQgAICIAIMkAAZUABQDlAOUPZ85eQQABFggATIgAJw5ezbqgXgyt50nq/1KwEQAQZIgAxw5epQB3i+ireh52v9igICIAIMkABNufQNXwHUAZ6vFQSggABoyiU4GKApF3NwZW8Ez1fxynu+koPnq3gjeL6KV8PzVf0pPF/VX7fnawXf7fZPZUAB1AEevRUEoIAAiAADQLlAuUC5QLlC2aNXvaoevRUCIAIMkAAZ4BvfxZ/Qs9fJPHxtq+YkJCUFUiQZKZEyqZAqSOgh9BB6CD2ke/SdvZESKZMKqYJ0IXUP39+rktxD3MND2faNTu7RzwE8loP6kYU4FVIFhYUkJCUFUiQZKZHoEegR6BHpEekR6RHpEekR6RHpEekR6RHpYfQwehg9jB5GD6OH0cPoYfQweiR6JHokeiR6JHokeiR6JHokeiR6ZHpkemR6ZHpkemR65O4RnTKpkCqoLCQhKSmQIslI9Cj0KPQo9Kj0qPSo9Kj0qPSo9Kj0qPSo9KjwSMtCEpKSAimSjJRImVRI9BB6CD2EHkIPoYfQQ+gh9BB6CD2UHkoPpYfSQ+mh9FB6KD3W1JpT/24/B8ykQqqgNaGdhKSkQIokI9Ej0iPSI9KjZzAsTv6JIE6Z5J8I6lRBPW8rCX6u522lQIokI9Gj5y342WbP20rdo59/LiQhKX6u522lSDJSItGj5y0kpwrqeVtJSEoKpEjqHtkpkbpHcSqkCup5W0lISuoe/hZ63lZyD9+/pJ4t3/+kni2n3LMV1cn1fKOSe7ZWCqRIMlIiZVKhMj16tlYSkpICqXv4qXTP1krdw5wyqZAqqGfLt0e5Z2slJQVSJBkpkTJ8+xy6UgX1OXQlISmpe2SnSOoexSmRMqmQukf18/eFJCQlBVIkGSnBtyd0pUKqoD6HriQk9zB/Cz2/K0WSkRIpkwrJPXxzmXt+zftVz+9KkdT1vL/0/K6USYXU9bx1e35XEpKSAimSukf8+fPDDa6H/vj2dHfnt0O7+6J2i/T19unu8dvNx8fvDw8fbv53+/C9/9A/X28fe/nt9ql9tz3V3eNfrWyCn+8f7px+ftg+vRx/tJ1plfHpdlCVKNBO+p9JyLFEyzckWtC2OrQzzGcSOpFoS11ItHn7UGL2IH2xuz5I63OHDxJntfATBtRCDyXsWCL7aUNXyGUTyPLs8+n480XC+HyJslWgVeZkM7QtGXpD23lt79OeV6EcK1RBO9ZStiqUelqgRrTiInaoILOXqb51XF9mOw2kRnzeDjLplTHgTbTt86HAtA4Rz9FO0cuhRJh0qEWVTbGrxaumiLPWXPBCaw15q8bLetisHsJe0eq01GOVSd9si128lLbGXY418qRRo3G02T1LqO95llS2/pWPW+RsSmI4Sole3z101kWzsY/mXdZe1mI2cLbLCYwYjVUPW+MNFc2bSkjXtmmRfPg0s3ebjd20TdiHbTrtpFHZSW0bfcJphXa+xLdS7XAE1ckI2C4R2TXirpefbspa8Dra6Y0dVSHMume7dWDU2mXATuR5NcKkg9Z274Kxp90abI1Z7LnGpG/VJaKD1mU3tb/SmIyjgRJhFxOt6blCnK0O8rY6KPEyDQ2BrzVN6jHrXJIZknZ7vM0I+Xw1TDk32m5CeNejWBRqpHCZxjZmtCHDLtQIfJa2c75Io92cYCBuNyX1UCPqf/pa2lWMsBr5uBqTzNo2S7fj1uUo9nEyggauo9ud3m69EU/XIXC50fBwTpoqyKYglymUQIUqFylUKrT7r0sUjFNRO3StRwo22xdp5EKl3fRv88CLEdgmHbO1JYc+2a+53qWhDIhEuV7DfoVGur49ZhrT/WrgKiPsFn+vNCYzfLuCZz3aDfKWtPgOicystgvdyyRMN4l8KDFtjK2Tttv2w8ZIenVjzCVONcYbtbi+MTi1tsbQy3pXVPauuFtpvGrQ2S6pcBDWEuRCjW2rVXbLv1cadTItKqeTdtteD9/KWYl03DdmT1K57wzLbmPx8kmyXruCzOH6FeRU4+QKMtvVS5VpNU6uIOca51aQU42TK8i5xrkV5Ezj7AqyyH/6Ws6uIGdZCcs2xy7hOCslTqeEbX7cn1rFd0hY2gbSfJlE2I3F5aLh3BaeRNpuJfqu4dxsO5nevZT3acR0vUblPN3uYw81ZkvawqORdkt+eOhVdTaAJdmONvJuanpRjRquP1Wo8fpThWrXzgk1XT8nTDVOzgm1XD34zKrxK7avVdEaVvPhpqsd2s402DfaGXM6fK+y6PUdrO8lru1hssRru5gsdn0fm4uc7GSy5Kt72bQiv6CbtX7BawgRPexms7udVkeemi952V20lRcisyG5Vi49FtnG03YG80JkdvKkwtNm3c8N8cX96+yeKWQuxkKRZSISf4XI7P1q4lpdy/FtxFQkLtyTxmW/J32PyPnHKdO7gMo7jTh7nEnDtvMjzrtJ4rHI9LqJZxZt9b6TCO/pr2nrr7vTwVf9dXZV1MZ4PEzV3dncq2FRw2yUz8aZYjemhfMSPjtsE0U+lPgV08Tstuj0NKH56mliduUk1bhcrrsR7V0irVtsPWS3WX+fyMnd5Rsi57aXc5GT+8s3RM5tMKciZ3eYEq7f+b9RkXPz7xuzZ+ZeRPbXDC9mz9kk3n+hcEziuxHg/AF9ksqVourhbuaN/l64m9mH930dRLbDOlnKpcnjL800kXppTbb+Lhf3d9nODdtu9VKRLTRil7bJ2ZXvXGRr2DamXSrC33DTffLeJ3J2DW7LLxgDplOnFU6dKV82+8btV4Hswgn88Bc1fm//uf10//Tsb2f8dKmn+9s/H+7Gfz9/f/y0++63/3/Fd/C3N74+ffl099f3pztX2v4AR/vnt9yS307Zf/c/btD+W9ourizp95/u/i8=",
+      "debug_symbols": "tZzdjtS4FoXfpa+5yN729g+vMhqNeqAZtdRqUA8c6Qjx7uPteK2kQTGpKrjBH9XUt53EK3Fs1F/v3j/8/eWfvx6fP3z89+7tH1/v/n55fHp6/Oevp4/v7j8/fnxun369W/wP1bu34c2dhru3uTXx7m1tja1NWpu8NmVtam/CsjbtZ5JaW0Zb1zYuo5XWNnHU0YbRxtHaaNNo82jLaOvamn+/1bMw2jhaG20abR5tGW1d27SMtn1f2/GmONr2fY2tTaPN4/My2rp+nv17rR85jtZGm0abR1tGW9e2LKOV0epoh68MXxm+Mnxl+MrwleGrw1eHrw5fHb46fHX46vDV4avDV4dPlgUgAAUEQAQYIAEyoABgFpgFZoFZYBaYBWaBWWAWmAVmhVlhVpgVZoVZYVaYFWaFWWEOMAeYA8wB5gBzgDnAHGAOMAeYI8wR5ghzhDnCHGGOMEeYI8wRZoPZYDaYDWaD2WA2mA1mg9lgTjAnmBPMCeYEc4I5wZxgTjAnmDPMGeYMM5ImiJoga4KwCdImiJsgb4LACRIniJwgc4LQCVIniJ0gd4LgCZIniJ4ge4LwCdIniJ8gf4IAChIoiKAgg4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoyKAig4oMKjKoPYN9omKABGjmYA4FUFcInsEVBKCAAIgAAyRABhQAzAKzwOwZDNkhACLAAAmQAQXg5tLAM7iCm3021mdz/ZMAiAADJEAGNHNcHOoAz2AUB8EnCgiACDBAAjRzDA4FUAd4BlcQgAICwM3RwQBu9umlZ3CFAqgDPIMrCMDNfsY8gyu42Q/ZM7iCm/3UeQZXaGbzo/AMdvAMmnfMM2jeH8+g+aX0DJrX8gyu0MzmtTyD5kLPYOqeZk5+Vj2D5tU9g8nNnsHkZs9gcrNnMKlDMyc3e+JS/1YB1AGeuBUEoIAAiAADJADMBeYCc4W5wlxhrjBXmCvMFeYKc4W5DnNcFoAAFBAAEdDMeXFIgAwogDrAE7eCABTg7zniEAEGSAA3R4cCqAM8cSsIQAEBEAEGSACYFWaF2ROX/YXJE7eCAgIgAgyQAG7ODgXgZj91nrj+iSduBQUEQAQYwM3VIQOaufg59MT1TzxxKwhAAQEQAc1c1CEBMqAA6gBP3AoCaOYSHAKgmYs5uNlPgieueOd74jq42U+CJ654Nzxx1Y/CE1f9cnviVvDXXf+WB22FAqgDPGgrCEABARABBoC5wFxgLjBXmD1o1bvqQVshACLAAAmQAf7mu/gRetI6mUetvbM5CUlJgRRJRkqkTCqkChLWENYQ1hDWkF6jOBkpkTKpkCpIF1Kv4S/4qiSv4YsO5hGUddnAa/SFAA/hIK+h4lRIFeRBHCQkJQVSJBkpkVgjsEZgjcgakTUia0TWiKwRWSOyRmSNyBqRNYw1jDWMNYw1jDWMNYw1jDWMNYw1Emsk1kiskVgjsUZijcQaiTUSayTWyKyRWSOzRmaNzBqZNXKvEZ0yqZAqqCwkISkpkCLJSKxRWKOwRmGNyhqVNSprVNaorFFZo7JGZY3KGhU10rKQhKSkQIokIyVSJhUSawhrCGsIawhrCGsIawhrCGsIawhrKGsoayhrKGsoayhrKGsoa6ypNaf+0+SUSYXUe5B9ebD3oDgJSUmBFElGSqRMKqQK6hkM6hRJRkqkTCqkCuoZXElISmKNxBqJNRJr9JQFX/DsiQp9KTSS+jf8/PVEBT9XPVErFVIF9UStJCQlsUZhjZ6olRIpkwqp1/Br1BO1Uq/h57QnaqVAiqRew5eBe6JWyqRCqoNyT9RKQtJRN/dErRRJRkqkTPIa/o6Ue6I69UT521buiVpJSYHkNaI6GSmRMqmQKqgnaiVB3Z6olQIpkoyUSL2GL4f3J+dKFdSfnCsJSUmB1GsEp+4zp0LqvuRL7QtJSIp/1zO4UiQZKZFYo2fQXwNzz2Cn/pT0F8Hcn5IrKSnw30WSkRIpk1ijJ9RfH3NP6EpCUlIgRZKRvIb51e9PyZW8hvm17E/JTj2/KwlJSYHUa/i575leqdeI3769ucP+0F+fXx4efHtot2HUtpE+3b88PH++e/v85enpzd3/7p++9H/076f7595+vn9pP239fnh+39om/PD49OD07c327eX4q21xq4xvtxWrREF7nL9SyLGiJR2KNsi2PrQ1zFcKnSjaVBeK9tw+VMwOpE921wNpS/WHBxJnvfAVBvRCDxV2rMi+2tANuWyCrK++n46/XySM75coWwdqOHsa2us6LkZ7GY9U2OsulGNDFZzHWsquC8tpQY04i4vYoUFmF1MjHG0pe+tFfH0eZDYqF1V2w+S4Gzo7kgXRqjXkrRvf9yPM+iFlYUfaRsGxZTI020SzDkmbXy7HjsnY1GhM+v5YlkuOhaOrcZ6ckenFLTiWtvUQDi/uZIi1NRsM8t2ljdelJMhRSvT2IaqTIRr77Gb0IqfDXsxunG2XAneMxqqHV+QnFs2bJaRDy8lz2vbMDo9mMkLbxiOj0h7nh+d0cgNtb7kY5e01d7ss5w2t87wqbWH88Dgmw7PtJnJoxN25PH0qQzaO7xCOuhBmw7PtOjDubTNgdz1edyNMBmht+y64/7Vdg+1ktonCK8fsHrpEDNC67B7tPzgm951ARdg9ktrm0mtDnM0O8jY7KPE6h4bAy5om/ZgMrrY8z5C8ejhe0A1T3j5t91C66FAsCh0pXOfY7hntlmFXOngHbDuo1znaPgluxG1fpB46ov7Wy9IUwm7k427MYm/bHbStNh3FPk7uoIHz6P2tS4qd7kPiZL4t4R8+k6aGSkN7I7/GkHkqG9arDGUzlKsMNfAoas1HBpvNQDVystS2/LfnwHd3YJsNTFl465P9vO8ihzIgEuV2h/0KR7r9fMwc0/fVwFlGe7IcOyZP+LYFz360HeQtaZcoMrMadkm7SGG6KfKhYnoytkHadtsPT0bSm0/GXHHqZPykF7efDD5a28nQ60ZXVI6uuJtp/HBC8+SxWPjeqSXIlY7tda/spn8/OOp0Kpw5pd/Nx+VKRToeG7MjqZyQh/bSeXgkWW+dQeZw+wxy6jg5g8x281Rl2o2TM8i549wMcuo4OYOcO87NIGeOszPIIr/1spydQc6yEpbtGbuE46yUOH0kbM/H/crZJQpL2400X6cIu3txuep2bgtXIk3Kdbdzs21lendRLnPEdLuDs2pp+7GHjsmU1pTzHtNyuOhVdXYDS7ItbeT9ytnrbtRw+6pCjbevKlS79ZlQ0+3PhKnj5DOhlptvPjX91tdXC7yNWrDDl662cDxxVI6Nts6dDq+rLHr7AOvvEreOMFnirUNMFrt9jM0lJweZLPnmUTbtyK8YZlFwRzZblsNhNtuCaH3kqvmSl93mUP1OMrsl18qpxyLbLTks5TuJzubHwpUK3T8b4nf7r7N9mZA5GQtFlokk/grJ7Ppq4lxdy/FuxFQSl7gNtP076SWS84cz22cqnCm3d7nZ4cTZlgS3AyxJPJZMt5v47G6z950iXjJe0zZed6uDP4zX2VZR1YSDqVrl+Laok/Fq22SmnZx8sEkzV6RYqbDlOgUXCS3VKxV5u7T5ygM5s2E1vyZnn3daf8HzbrbrdPJ5F6aj1Djvr7tb80WSNr63ob5bdbhQUjjX3Z+RyySyLeXIUq7tCf9LRZPUa3uyvW3L5G37J5JtVam9y1wr2d7Zxa49J2fnRXPJdmJ1t1dxoYRbJk1y7Tk5O0OL4fYZ2rQjJxeHfiI5tzo0l5xcHvqJ5Nz60FRydoFIYv29F+fs9Pknk192pM1b4uHkdzYHN+VDy3Yr/uf318xK2CZFrxcj/mx/u3/3+PLql2d8c9fL4/3fTw/jrx++PL/b/fTz/z/hJ/jlG59ePr57eP/l5cFN22/gaH/8kdu9va2y/+m/5aD9tbS3uLKkP7959f8A",
       "is_unconstrained": true,
       "name": "lookup_validity"
     },
@@ -7886,12 +7954,12 @@
           "visibility": "databus"
         }
       },
-      "bytecode": "H4sIAAAAAAAA/+2cB3hURfv2M89sEoogghQVMWJXLIBdFCGEolIEe4tLskI0JHGzCUVRYq+QLIhdUIoIoqiIgKKiWNBzA2KhGBVEBUURFcWC+k0MyZ7NZpPZTW717/e+l9f1Dqf8njlzZuZM2fx0sGTimg7p6d5RAV9Geo4/PSsn4PPneLPz09MLff6sy0am5/mzCr0BX7q3IDB0eFagVL9XNKd7tjfjiu65I3oW5GSkerOzi6YN7NavV1qw6NFzswI5vvx8SbG4SCuLi3azIbU41eKiVs4Yi6taW13V1iZXe9tc1M7mon1sLkqxyvm+Vle1t7pqP6ur9k8pmtXdn5WdnTWk7PyEhOLi8cXFS1ISav6fKprZLT/f5w9c4PPnji8uCS5JOSqzn399x8mHzB+QNq+o6LyLD+68qffIBXklqet/HL/V3AKdUzP2/cM3XBEPNrfW3CbEg82LipVKbGT5zh2Qm+/LyszN6TTA5x9WEPAGsnJzghMqy9uUQmX6QNfRXFc6bwL0ldB+aPOPQHjeg8Ha383+Vs9XYPGSa68/hpMSew5bWOWwsBaQOnOMVQ4LTw2v46qkaPqgrJwh2b7yulBbbm3KKuEv5rC8bB/0cLsWZJP14So86w3IWR8Re+MvGW+VDcO2y/DI2qtGfPFHFsfYUdiRhxvyeKv6PNzqqpFWV42Kp4uu7Q5tUfR1qo4JtV/iqoxXcSqjKb2rglZV8Sqrq64mVFiTx6tLbKPXctHf+s5G097ZaLvyGB3j27AcDVxTc+xXn3s6KeKhaqOWvWSbiphglcNrOcOgMVGxiZXYeIZB17jS11am93QdHWOGQUXQ10FfD31DeN7HWxTbXlb1pciqFG6MtXBtMnigVQavs8rgTRYZjOc13ehK3+RKX+9K32Be1M3Qt0DfCn1beG8j42PrbZTFc1QCTU+TfOJr3gv2bztw7rRxd7dqM+zYHTnpj93Y5aK5XbscNbHZIddsrvfowVBfd3vRtG5+v3dkEPoO6DvjnDfVdoeJQxkR3W5ybdcFjKWMm0z8O+3ijyPV7bGu9Lga5mLF0CXQ5i2PD6/buqTea9cDodo1IZS8K5ScGEreHUreE0reG0reF0reH0q6QjwYSj4USk6iLQBMrhk7dc6ql+N6kZNdaffxu6t8TR6GfgR6CvTU2Dtr8xasrnrYqiSmMb4nph5YXfWIVRank1rdNFd6uis9xZWeal7Wo9AzoB+DnhlPVZtVc+5HD/5sVDzYx6NidZ0KZZYrPdGVftSVftwUymzoJ6CfhJ4TT+6fqrlQ8Ip3Uly5f8qVvs+Vvr9K7p+GfgZ6LvSz8eR+Xs25P+LcpqfFg30uKja5Tq90nit9ryv9tCv9nCmU+dALoBdCPx9Pi3/A6qr5ViXxAqdTetDqqgVWWVzEyeJDVlcttMrii6R+8wVXepEr/aIr/bypTy9Bvwy9GPqVeEpiktVVL1mVxKukknjVlX7ZlV7sSr9iSmIJ9GvQr0O/EU+/8GbNud92znfr48r9m670Eld6dpXOcin0W9BvQzvho05PzEvAS2Oa1SCUXBbHSNCumi21egWIvOqiKlcZ1rJYV8ASg2FTyKoXV40Qa3EjphX35fW3WbC8mldhV8hVw1WNb9hWrBW1lmaC1ZOsMHuXcTzKMqur7B7lnchHqXqT1aO8U+027BN9C7IDWYMyvNlev0lOCBbNSM3NyQ94cwIWlSHyWlne4pKCpKkXZxx+UJO079o0n3B91yV3Xtf1oA7urMCVXhZLQDP1XQn9bjXPMSdt2GBfZqYvM7XAX+jrlpk5wR1wpSv9bjDqIDG2nLwH/X7kjmNtL1RZNd33Yh1e2O0jFFvVuHti7ceSYv4S3GzTNZUvapkv0AfQq6BXQ69h7QqONf/ZfY3X1nWbo/YQq2Lqtz+Mr0wssmHYdm+zNI51Qav4pcX80v4gptL+iFXapo5/ZFfaH1NK28T/+G8o7TUxlfYnrNJeY9h2pb2OUtom/rq/obRXx1Ta61mlbXru9Xal/SmltE38T+P5zUXt5FLTauxexQZKya4zT2YX/zPKd3ODAdvF/zyuOXjV4ekE1vA02m6Me8L8gSu9ypVe7UqvcaU/N4PEL6A3xjPp37QkRc4oHD92xRVjF69peHqzFu8UL5yqWvi3XtozddGM5tNPuv6IuCb9m1zpL6I8dNkOxZfQX0Fvhv46nln1OKurvrQqiW84K203W131lVUWt5DWl75xpbe40ptd6a/Ny/oWeiv0d9Df1/VHel/E9MH4gTUcN63mB7sMb6NsSZv42+r8ea49zMaYSvtHVmlvNGy7DP9EKW0T/6fieFq5xZffauFujdXDf0v59UGp5bg7dvK6OEY9QatRh5ktr7XKwjjzX+1Z2C2Oh9tmWWfCWmhycOeaQkmtTanXWuSHLc62v2721Ic/XXvz7eu3zEl4d+KkSWeff1TPEeN233vdgksHH7zhMcu/Vvhbf/+9vf6WdLfH+Vvr4XbDnZ/5ne3PMRXdL6zO9mfDtsvwr5TO1sT/NeaG0zC0UWE3LxluXn591Oi/NgBq3CSperFrA+m3UHJH/bWE3+wu25ESx3SurMHYDV8Lam5WwfIP229WjW+HxSuIvaL9WhbeKr5dLn+nNMftBmzXRf1BWUAoi2+3dr/dKpd/UoYS1h25J6GOXUvteRm1s2up6x+W1aVr8ahQUuqta/Eou8skJb5XOMpuzGzVtXiUVXUQStey3YS3exarRmP5LDrGDshqO9Bgra7yUHq/skph164T45hIWMX/w+rCP03PYpfRJM7Oqd2fzG2PJ3itf51jkcGDGIFttqoPZgQWi8CHxBrYZjh6aKx/s2VTeQ6zqjpXMp6nw5KUJusnL+va77VHOuScmzRm9uJFt3w8rk3nU9ePPlB16Xznqrbnxf52PBaBD2dUi0SLwEcwAidZBD6SETjZIvBRjMANLAJ3ZARuaBG4EyNwI4vAnRmBG1sEPpoReBeLwMcwAjexCHwsI3BTi8DHMQLvahH4eEbgZhaBT2AE3s0i8ImMwM0tAp/ECNzCInAXRuDdLQKfzAjc0iLwKYzArSwCd2UEbm0R+FRG4DYWgbsxAu9hEbg7I/CeFoFTGYFt/lq/ByNwW4vAaYzAe1sE7skI3M4icC9G4H0sAvdmBE6xCNyHEXhfi8CnMQK3twh8OiPwfhaBz2BMuvsyoP0Yy1r9rVYmChlvZ3+L7A1gPPOZ9bB1EBk6aLm959E2F3o8ZsHVplYMpKzKmuX1BMvNK0+STZkPqreto5jbzVkM6NkM6DkM6LkM6HkM6PkM6AUM6IUM6EUM6MUM6CUMaDoDeikD6mVABzOgGQxoJgPqY0AvY0CHMKBDGdAsBvRyBvQKBjSbAR3GgOYwoLkMaB4DStn39DOg+QxogAEtYEALGdDhDOgIBnQkAzqKAb2KAb2aAR3NgF7DgF7LgDpjKNQiCvU6CvV6CvUGCvVGCvUmCvVmCvUWCvVWCvU2CvV2CvUOCvVOCnUshTqOQi2mUEso1CCFOp5CnUCh3kWhTqRQ76ZQ76FQ76VQ76NQ76dQH6BQH6RQH6JQJ1GokynUhynURyjUKRTqVAp1GoU6nUJ9lEKdQaE+RqHOpFBnUaiPU6izKdQnKNQnKdQ5FOpTFOrTFOozFOpcCvVZCnUehfochTqfQl1AoS6kUJ+nUF+gUBdRqC9SqC9RqC9TqIsp1Fco1Fcp1CUU6msU6usU6hsU6psU6lIK9S0K9W0K1aFQQaEuo1CXU6grKNR3KNSVFOq7FOp7FOr7FOoHFOoqCnU1hbqGQl1LoX5IoZZSqB9RqB9TqJ9QqOso1PUU6qcU6gYK9TMK9XMK9QsKdSOFuolC/ZJC/YpC3Uyhfk2hfkOhbqFQv6VQt1Ko31Go31OoP1Co2yjUHynUnyjU7RTqzxTqLxTqrxTqbxTqDgr1dwr1Dwr1TwYVKoGDVRyscLCag/VwsIkcbBIHm8zBNuBgG3KwjTjYxhzsLhxsEw62KQe7KwfbjIPdjYNtzsG24GB352BbcrCtONjWHGwbDnYPDnZPDnYvDrYtB7s3B9uOg92Hg03hYPflYNtzsPtxsPtzsAdwsAdysAdxsAdzsIdwsIdysIdxsB042MM52CM42CM52KM42I4cbCcOtjMHezQHewwHeywHexwHezwHewIHeyIHexIH24WDPZmDPYWD7crBnsrBduNgu3OwqRxsDw42jYPtycH24mB7c7B9ONjTONjTOdgzONi+HGw/DrY/BzuAgz2Tgx3IwQ7iYM/iYM/mYM/hYM/lYM/jYM/nYC/gYC/kYC/iYC/mYC/hYNM52Es5WC8HO5iDzeBgMzlYHwd7GQc7hIMdysFmcbCXc7BXcLDZHOwwDjaHg83lYPM42Cs5WD8Hm8/BBjjYAg62kIMdzsGO4GBHcrCjONirONirOdjRHOw1HOy1HOwYDraIg72Og72eg72Bg72Rg72Jg72Zg72Fg72Vg72Ng72dg72Dg72Tgx3LwY7jYIs52BIONsjBjudgJ3Cwd3GwEznYuznYezjYeznY+zjY+znYBzjYBznYhzjYSRzsZA72YQ72EQ52Cgc7lYOdxsFO52Af5WBncLCPcbAzOdhZHOzjHOxsDvYJDvZJDnYOB/sUB/s0B/sMBzuXg32Wg53HwT7Hwc7nYBdwsAs52Oc52Bc42EUc7Isc7Esc7Msc7GIO9hUO9lUOdgkH+xoH+zoH+wYH+yYHu5SDfYuDfZuDdThYcLDLONjlHOwKDvYdDnYlB/suB/seB/s+B/sBB7uKg13Nwa7hYNdysB9ysKUc7Ecc7Mcc7Ccc7DoOdj0H+ykHu4GD/YyD/ZyD/YKD3cjBbuJgv+Rgv+JgN3OwX3Ow33CwWzjYbznYrRzsdxzs9xzsDxzsNg72Rw72Jw52Owf7Mwf7Cwf7Kwf7Gwe7g4P9nYP9g4Pl+G+F478Vjv9WOP5b4fhvheO/FY7/Vjj+W+H4b4XjvxWO/1Y4/lvh+G+F478Vjv9WOP5b4fhvheO/FY7/VppzsBz/rXD8t8Lx3wrHfysc/61w/LfC8d8Kx38rHP+tcPy3wvHfCsd/Kxz/rXD8t8Lx3wrHfysc/61w/LfC8d8Kx38rHP+tcPy3wvHfCsd/Kxz/rXD8t8Lx3wrHfysc/61w/LfC8d9KJw6W478Vjv9WOP5b4fhvheO/FY7/Vjj+W+H4b4XjvxWO/1Y4/lvh+G+F478Vjv9WOP5b4fhvheO/FY7/Vjj+W+H4b4XjvxWO/1Y4/lvh+G+F478Vjv9WOP5b4fhvheO/FY7/Vjj+WxnIwXL8t8Lx3wrHfysc/61w/LfC8d8Kx38rHP+tcPy3wvHfCsd/Kxz/rXD8t8Lx3wrHfysc/61w/LfC8d8Kx38rHP+tcPy3wvHfCsd/Kxz/rXD8t8Lx3wrHfysc/61w/LfC8d8Kx38rfg6W478Vjv9WOP5b4fhvheO/FY7/Vjj+W+H4b4XjvxWO/1Y4/lvh+G+F478Vjv9WOP5b4fhvheO/FY7/Vjj+W+H4b4XjvxWO/1Y4/lvh+G+F478Vjv9WOP5b4fhvheO/FY7/Vjj+WwlysBz/rXD8t8Lx3wrHfysc/61w/LfC8d8Kx38rHP+tcPy3wvHfCsd/Kxz/rXD8t8Lx3wrHfysc/61w/LfC8d8Kx38rHP+tcPy3wvHfCsd/Kxz/rXD8t8Lx3wrHfysc/61w/LfC8d/K0xwsx38rHP+tcPy3wvHfCsd/Kxz/rXD8t8Lx3wrHfysc/61w/LfC8d8Kx38rHP+tcPy3wvHfCsd/Kxz/rXD8t8Lx3wrHfysc/61w/LfC8d8Kx38rHP+tcPy3wvHfCsd/Kxz/rXD8t7KSg+X4b4XjvxWO/1Y4/lvh+G+F478Vjv9WOP5b4fhvheO/FY7/Vjj+W+H4b4XjvxWO/1Y4/lvh+G+F478Vjv9WOP5b4fhvheO/FY7/Vjj+W+H4b4XjvxWO/1Y4/lvh+G+F478Vjv9WvudgOf5b4fhvheO/FY7/Vjj+W+H4b4XjvxWO/1Y4/lvh+G+F478Vjv9WOP5bzfHfao7/VnP8t5rjv9Uc/63m+G81x3+rOf5bzfHfao7/VnP8t5rjv9Uc/63m+G81x3+rOf5bzfHfao7/VjfnYDn+W83x32qO/1Zz/Lea47/VHP+t5vhvNcd/qzn+W83x32qO/1Zz/Lea47/VHP+t5vhvNcd/qzn+W83x32qO/1Zz/Lea47/VHP+t5vhvNcd/qzn+W83x32qO/1Zz/Lea47/VHP+t5vhvdScOluO/1Rz/reb4bzXHf6s5/lvN8d9qjv9Wc/y3muO/1Rz/reb4bzXHf6s5/lvN8d9qjv9Wc/y3muO/1Rz/reb4bzXHf6s5/lvN8d9qjv9Wc/y3muO/1Rz/reb4bzXHf6s5/lvN8d9qjv9WD+RgOf5bzfHfao7/VnP8t5rjv9Uc/63m+G81x3+rOf5bzfHfao7/VnP8t5rjv9Uc/63m+G81x3+rOf5bzfHfao7/VnP8t5rjv9Uc/63m+G81x3+rOf5bHbP/NmiwR2X286/vOPmQ+QPS5hUVnXfxwZ039R65IK8kdf2P47eaOw6wCm3lyO3rG5brH9knJyswvkWp7nXQwYcceliHw4848qiOnToffcyxxx1/wokndTn5lK6nduue2iOtZ6/efU47/Yy+/foPOHPgoLPOPufc886/4MKLLr4k/VLv4IxM32VDhmZdfkX2sJzcvCv9+YGCwuEjRo666urR11zrjHGKnOuc650bnBudm5ybnVucW53bnNudO5w7nbHOOKfYKXGCznhngnOXM9G527nHude5z7nfecB50HnImeRMdh52HnGmOFOdac5051FnhvOYM9OZ5TzuzHaecJ505jhPOU87zzhznWedec5zznxngbPQed55wVnkvOi85LzsLHZecV51ljivOa87bzhvOkudt5y3HceBs8xZ7qxw3nFWOu867znvOx84q5zVzhpnrfOhU+p85HzsfOKsc9Y7nzobnM+cz50vnI3OJudL5ytns/O1842zxfnW2ep853zv/OBsc350fnK2Oz87vzi/Or85O5zfnT+cP6ESoBSUQGkoD1QiVBJUMlQDqIZQjaAaQ+0C1QSqKdSuUM2gdoNqDtUCaneollCtoFpDtYHaA2pPqL2g2kLtDdUOah+oFKh9odpD7Qe1P9QBUAdCHQR1MNQhUIdCHQbVAepwqCOgjoQ6CqojVCeozlBHQx0DdSzUcVDHQ50AdSLUSVBdoE6GOgWqK9SpUN2gukOlQvWASoPqCdULqjdUH6jToE6HOgOqL1Q/qP5QA6DOhBoINQjqLKizoc6BOhfqPKjzoS6AuhDqIqiLoS6BSoe6FMoLNRgqAyoTygd1GdQQqKFQWVCXQ10BlQ01DCoHKhcqD+pKKD9UPlQAqgCqEGo41AiokVCjoK6CuhpqNNQ1UNdCjYEqgroO6nqoG6BuhLoJ6maoW6BuhboN6naoO6DuhBoLNQ6qGKoEKgg1HmoC1F1QE6HuhroH6l6o+6Duh3oA6kGoh6AmQU2GehjqEagpUFOhpkFNh3oUagbUY1AzoWZBPQ41G+oJqCeh5kA9BfU01DNQc6GehZoH9RzUfKgFUAuhnod6AWoR1ItQL0G9DLUY6hWoV6GWQL0G9TrUG1BvQi2FegvqbSgHClDLoJZDrYB6B2ol1LtQ70G9D/UB1Cqo1VBroNZCfQhVCvUR1MdQn0Ctg1oP9SnUBqjPoD6H+gJqI9QmqC+hvoLaDPU11DdQW6C+hdoK9R3U91A/QG2D+hHqJ6jtUD9D/QL1K9RvUDugfof6A+pPSAJEQQSiIR5IIiQJkgxpAGkIaQRpDNkF0gTSFLIrpBlkN0hzSAvI7pCWkFaQ1pA2kD0ge0L2grSF7A1pB9kHkgLZF9Iesh9kf8gBkAMhB0EOhhwCORRyGKQD5HDIEZAjIUdBOkI6QTpDjoYcAzkWchzkeMgJkBMhJ0G6QE6GnALpCjkV0g3SHZIK6QFJg/SE9IL0hvSBnAY5HXIGpC+kH6Q/ZADkTMhAyCDIWZCzIedAzoWcBzkfcgHkQshFkIshl0DSIZdCvJDBkAxIJsQHuQwyBDIUkgW5HHIFJBsyDJIDyYXkQa6E+CH5kACkAFIIGQ4ZARkJGQW5CnI1ZDTkGsi1kDGQIsh1kOshN0BuhNwEuRlyC+RWyG2Q2yF3QO6EjIWMgxRDSiBByHjIBMhdkImQuyH3QO6F3Ae5H/IA5EHIQ5BJkMmQhyGPQKZApkKmQaZDHoXMgDwGmQmZBXkcMhvyBORJyBzIU5CnIc9A5kKehcyDPAeZD1kAWQh5HvICZBHkRchLkJchiyGvQF6FLIG8Bnkd8gbkTchSyFuQtyEOBJBlkOWQFZB3ICsh70Leg7wP+QCyCrIasgayFvIhpBTyEeRjyCeQdZD1kE8hGyCfQT6HfAHZCNkE+RLyFWQz5GvIN5AtkG8hWyHfQb6H/ADZBvkR8hNkO+RnyC+QXyG/QXZAfof8AfkTOgG67FfB0BraA50InQSdDN0AuiF0I+jG0LtAN4FuCr0rdDPo3aCbQ7eA3h26JXQr6NbQbaD3gN4Tei/ottB7Q7eD3gc6BXpf6PbQ+0HvD30A9IFmx9/szpuddLPrbXaozW6y2fk1u7RmR9XsfpqdSrOraHYAzW6d2Vkzu2Bmx8rsLpmdILNrY3ZYzG6I2bkwuwxmR8Cs3puVdrMqblawzWqzWRk2q7hmxdWsjpqVTLPqaFYIzWqeWXkzq2RmRcusPpmVIrOqY1ZgzGqJWdkwqxBmxcDM7s1M3MyazQzXzEbNzNHM8syMzMyezEzHzErMDMKM9s3I3IyizYjXjE7NSNKM+swIzYymzKhm5kBfoMCf08Mb8JYmHJSgRHsSk5IbNGzUeJcmTXdttlvzFru3bNW6zR577tV273b7pOzbfr/9DziwuPjBYNHUbhlZ/pbB5SuSN297+/UhxcU7D7WOPNQuuHz1Hi33a3vR6tcrDnUILp+3rVXhtX82v7Ti0OnB5bMbr+y+aFKDSyoO9Y08dGZweaOGd5yU9v6CpRWHcoPLb+3fr8fht5Z6Kg7lRR66MvKQP/JQfuQh5/bg8m8Kdj12JfbNLk3IKJqZNiLP78vPz8rNGV9cu1V1QKw3DI31Bm+sN+THeoMv1htSYr0h499XSjmx3jDk31esmfQsBegRMv59Wcqkv7hcem2NOUuXxXpDAf0Z+FUj6z/w4obTHzpA771jfui8/312/xWfXX53f0WsNxxBL9Y+9L415d/XRLPo7SHlP5ClmNvDCHrP9//liKwD/U0X0Csf//uwX6w3XEj/imbTb4h5CBfzACv9f6MZRin9bxHB5oaLY70h4b7gmoO9f+2qpmfkDsvzBrIGZ/vSc/3eDPN/hT5/GSh9uN+bl+fzlyY0K5qWmpuTHxhfNL1Hlt+XEZCiR/vkBHxDfP4pZ3fuVPtma9X7VUz3j0mren9CbPHTiqamerOzSxpXcmYM9GWbhy70xfgkCZEEHSvh8bK8ZJrl2dTcvJGVj5TmzpMLXp7zpnXOeVo95HzqoEBuXkkwSk6rvKPUaT2zfNm1/y6lXdUbe1jemDi9fKW7aFbPXL8va0hOWUndZer1qIAvI31YVn5GenkVT62s4f3/quDnlNfvssXs2eX7+90yM8taT2XWoxzvESyaPihrWF62rzyL4f/amZ3gmpSs/HTfCF9GQaCsFWXlpPt9pkmVN7G8od5833+hRdW1NqlIgqd+WlKqO08uuGlJ7uoZSrijFk3pm1sYVsMrLytviU12XlFRJdyX1rVMetS5TFRkGw0rg/CmcmB5U8nzF6Zn5adV1Ng+OQMr6+uAsupaUrU5hNglFU2gMpuPnN0x+vUSeX31hR6KUNGqpmbnejNLE077hxtOnzo2nD6RrzgxNoKOJCTVe8NJdMOjN4kqZ3SoVVQ54wl95sqbUcvwZtTTjZ/VPSvHW/ajq0D/vLtcjCmmPv1VXSIDSp2LtVedi1XCHyms3YWd8bgzGXYmrNjLC6prnfuEnvVQ5SJ6lbBniOAnx1dylfc3DLXOCHajWPMeXp0qwJWVqTKSK8LsPjmZ5VW8SvCGsfY2Uepyo8i63DBUl8N66bnlnXRBIDt9iC+Q6s3LL8j2BaN2sQ2KHuvt8+Z18/u9I10l2kiC1XXVRdPKLywJH8rIhOhdePSPQdQzyVHPeCbUNKKq/mNR5ZLTCobl9bnM9agNDiuaWnawpF01g2bLsWVC1RqZVEON1PQaqaPXyKR6qpE6skYmhWpkRHfuHvebvsHvq/5sLJ25x9WZ14isYSpkqnTs7zbRTSqvOl3qPN+KpaAbhmXgDDPQqX78pqMxpUZmcgRT3MkYarqHXtM9/JruiaWmJ7uzFlEtky3eTXJkuOQaanpyPdZ0ZVXTow++EyMHeKEiq5x9V/eKk6u+Yh0a4oSNeBqELgg73jA0WCrPZ6+KSrzzeFKIUFGGVW9Nqj5vDarmrYHry1vdDQ2r3tCwlhsazTjDfOXOGurNqTZMcuijVXFDasU050XzjTdLcjkBs1IRMGsH+QFvTobPJAI+f443uzThgH94AjSgjhOgAf8HVw5qWxNoXcOaQNiZNHeAaBOgKrOFXlFnC70jJ2k7z/Rx9ydhZ05zjxTDzpzu/naEnTnDPTQOO9M3dKZx+Jl+oTO7hJ/pHzrTJPJNNq3zismusRF2iZzbNHXDwsbii8LH4jubaZ+drfSBOIbGnqhnEqOeSYpjoN0g6pmGUc80inqmcdQzu0Q90yTqmaYP2EwC/g3/slnZ2nlfDUtaNXxVPTWMtBNr+JonRY7iInqA6oYYDaqeaxDZC8yoZkjZqOq5RpE9getARF/gOuCqIFXONXFVkYrv4xOZvrINq9x8X/pQ81EsTWj5D38Pe9bxe9jzP/g9bBLX97CuT9GjzutcUss6184dhBnVzkorIk09u2On4yMudZffzh5idvnQ8a9/9M+b4J6gDCoYHKXriL6i0aJjwqp9Pjlm5GGtjs3tX3jDJ2fNvmb3KYds3LXNloIuhb+U5kaPlzilb0F2lKeKrxur2JoLzsgOVDTU1v+9huqJtXrVtYJaNNSaPhhWK/fVNuG0GmelMXZYafRtruhVfXralQXe7PwoNTpyMTGx+c75Z7Ma2mvldC8KtpzQst6n857I6XzLGlqsp6JVzimbZHoLAkPTh2cFckze//lpZe86ts7e/8HPaPMYlhClhp2wv/076om6E6aj7oR5ou6EJe4sjj3/Bfvrnlo6nmjdat0rV2K9rqXG3Dbi2pMNmzvPD5s7dzO9z7nlnU9J9TtWHk9JlN0pT/1Mw/7mBcz2/+kFzHahXz/lm4/LUG/+0PQ88/KHeYdU/q6w8veE//THhvDrp3/9ULCu+1mpdc6xivqjEFUPv72IuXdMit47euqpd0yqcZMz2jdSon4jk2r9RrauafhX66C//f+BX5n+Tb31Pv/p3nqv6r99NX3WJcpnfUHoN4Sm4+9t+v0BO7v9st/XVv9lV9EXyoNRvvmq+t/azilvwOZOs0VW9qPFe6t27S3r+GnZvX665YRQfirBVT+C1r9NqToTrajTFZPbqjElogboBhGfUMvoKlr0hCk9sgpD/WxlHiqac+VjVxREcKH75f1VxOlXFuQGsnw5gXuqZq9RvN/Xnfc3rufX2CgEjlIeMnNnQFexJITKJ8pd6q+1uNB7q/XysqXCSHpY5+aqB1VeRuPKx/l/27GftJWwAQA=",
+      "bytecode": "H4sIAAAAAAAA/+2cB3hURfv2M89sQhNEkKIiRuyKBbCLIoRQVIpgb3FJVoiGJG42oShK7BWSBbELShFBFBURVKzYzw2IhWJUEBUURVQUC+o3ISR7djebzG5yq3+/9728rnc45ffMmTMzZ8rmp4Olk1Z1zMjwjg74MjNy/RnZuQGfP9ebU5CRUeTzZ18yKiPfn13kDfgyvIWBYSOyA2X6/eK5PXK8mZf1yBvZqzA3M82bk1M8fVD3/r3Tg8UPn50dyPUVFEiqxUVaWVy0iw2p5ckWF7V2xlpc1cbqqnY2udrT5qL2NhftZXNRqlXO97a6qoPVVftYXbVvavHsHv7snJzsoeXnJyaVlEwoKVmcmlTz/1TxrO4FBT5/4DyfP29CSWlwceoRWf39aztNOWjBwPT5xcXnXHhglw19Ri3ML01b+9OEzeYW6NyasR8cuu6yRLB5teY2KRFsfkysVGGjy3fewLwCX3ZWXm7ngT7/8MKAN5CdlxucWFXephSq0vu7jua50vkToS+H9kObfwTC8x4M1v5u9rV6vkKLl1x7/TGc1Phz2NIqh0W1gNTpY61yWHRyeB1XpcUzBmfnDs3xVdSF2nJrU1ZJ25nD83N80CPsWpBN1keo8Kw3JGd9ZPyNv3SCVTYM2y7Do2qvGonFH1USZ0dhRx5hyBOs6vMIq6tGWV01OpEuurY7tEXR16k6JtV+iasyXsGpjKb0rghaVcUrrK66klBhTR6vLLWNXstFf+s7G0N7Z2PsymNMnG/DcjRwVc2xX33myZSoh6qNWv6SbSpiklUOr+YMg8bGxCZXYRMZBl3lSl9dld7ddXSsGQYVQ18DfS30deF5n2BRbHtY1Zdiq1K4Pt7Ctcng/lYZvMYqgzdYZDCR13S9K32DK32tK32deVE3Qt8EfTP0LeG9jUyIr7dRFs9RBTQ9TYPjX/Oet2+7QfOmj7+zddvhR2/LzXjk+q4XzOvW9YhJzQ+6amO9Rw+G+rpbi6d39/u9o4LQt0HfnuC8qbY7TBzKiOhWk2u7LmAcZdxk4t9uF388qW6Pc6XH1zAXK4EuhTZveUJ43dal9V677gvVromh5B2h5KRQ8s5Q8q5Q8u5Q8p5Q8t5Q0hXi/lDygVByMm0BYErN2GlzV7yU0Iuc4kq7j98Z8TV5EPoh6KnQ0+LvrM1bsLrqQauSmM74nph6YHXVQ1ZZnEFqddNd6Rmu9FRXepp5WQ9Dz4R+BHpWIlVtds25HzPk89GJYB+NidV1KpTZrvQkV/phV/pRUyhzoB+Dfhx6biK5f6LmQsEr3skJ5f4JV/oeV/reiNw/Cf0U9DzopxPJ/fyac3/Y2c1OSQT7TExsgzq90vmu9N2u9JOu9DOmUBZAL4R+Fvq5RFr8fVZXLbAqiec5ndL9VlcttMriIk4WH7C66lmrLL5A6jefd6UXudIvuNLPmfr0IvRL0C9Dv5JISUy2uupFq5J4lVQSr7rSL7nSL7vSr5iSWAz9GvTr0G8k0i+8WXPut5z1/dqEcv+mK73YlZ4T0Vm+Bf029DvQTvio0xP3EvBbcc1qEEouSWAkaFfN3rJ6BYi+6oKIqwxrSbwrYMnBsClk5MWREeItbsS14r60/jYLllbzKuwKOTJcZHzDtmItq7U0k6yeZJnZu0zgUZZYXWX3KO9GP0rkTVaP8m6127CP9SvMCWQPzvTmeP0mOTFYPDMtL7cg4M0NWFSG6GtlacuLClOmXZh56AFN079v22Litd0W335NtwM6urMCV3pJPAHN1Hc59HvVPMfc9OFDfFlZvqy0Qn+Rr3tW1kR3wOWu9HvBmIPE+HLyPvQH0TuOtb1QZdV03493eGG3j1BiVePuircfS4n7S3CjTddUsahlvkAfQq+AXgm9irUrOM78Z/c1Xl3XbY7aQ6yIq9/+KLEysciGYdu9zbIE1gWt4peV8Ev7w7hK+2NWaZs6/rFdaX9CKW0T/5O/obRXxVXan7JKe5Vh25X2Gkppm/hr/obSXhlXaa9llbbpudfalfZnlNI28T9L5DcXtZPLTKuxexXrKCW7xjyZXfzPKd/NdQZsF/+LhObgkcPTiazhaazdGPeE+UNXeoUrvdKVXuVKf2EGiV9Cr09k0r9hcaqcVjRh3LLLxr28qtGpzVu+W/LsNNXSv/niXmmLZraYccK1hyU06d/gSn8Z46HLdyi+gv4aeiP0N4nMqsdbXfWVVUl8y1lpu9Hqqq+tsriJtL70rSu9yZXe6Ep/Y17Wd9Cbob+H/qGuP9L7Mq4Pxo+s4bhpNT/aZXgLZUvaxN9S589z7WHWx1XaP7FKe71h22X4Z0ppm/g/lyTSyi2+/FYLd6usHv47yq8PyizH3fGT1yQw6glajTrMbHm1VRbGm/9qz8IuCTzcFss6E9ZCGwR3rCmU1tqUeq9GQdjibIdr5kx78LPVN966dtPcpPcmTZ585rlH9Bo5ftc91yy8eMiB6x6x/GuFv/X331vrb0l3a4K/tR5hN9z5hd/Z/hJX0f3K6mx/MWy7DP9G6WxN/N/ibjiNQhsVdvOSEebl10eN3r4BUOMmSeTFrg2k30PJbfXXEn63u2xbagLTufIGYzd8Lay5WQUrPmy/WzW+bRavIP6K9lt5eKv4drn8g9IctxqwXRf1J2UBoTy+3dr9Vqtc/kUZSlh35J6kOnYttedl9I6upa5/WFaXrsWjQkmpt67Fo+wuk9TEXuFouzGzVdfiUVbVQShdy1YT3u5ZrBqN5bPoODsgq+1Ag7W6ykPp/corhV27Tk5gImEV/0+rC/8yPYtdRlM4O6d2fzK3NZHgtf51jkUGD2AEttmqPpARWCwCHxRvYJvh6MHx/s2WTeU5xKrqXM54no6LU5uunbKkW//XHuqYe3bK2DkvL7rpk/Ftu5y8dsz+qmuX21e0Oyf+t+OxCHwoo1okWwQ+jBE4xSLw4YzADSwCH8EI3NAicCdG4EYWgTszAje2CNyFEbiJReAjGYF3sgh8FCNwU4vARzMCN7MIfAwj8M4WgY9lBG5uEfg4RuBdLAIfzwjcwiLwCYzALS0Cd2UE3tUi8ImMwK0sAp/ECNzaInA3RuA2FoFPZgRuaxG4OyPwbhaBezAC724ROI0R2Oav9XsyArezCJzOCLynReBejMDtLQL3ZgTeyyJwH0bgVIvAfRmB97YIfAojcAeLwKcyAu9jEfg0xqS7HwPan7GsNcBqZaKI8Xb2tcjeQMYzn14PWwfRoYOW23sebXOhx2MWXG1qxSDKqqxZXk+y3LzypNiU+eB62zqKu92cwYCeyYCexYCezYCew4Cey4Cex4Cez4BewIBeyIBexIBmMKAXM6BeBnQIA5rJgGYxoD4G9BIGdCgDOowBzWZAL2VAL2NAcxjQ4QxoLgOax4DmM6CUfU8/A1rAgAYY0EIGtIgBHcGAjmRARzGgoxnQKxjQKxnQMQzoVQzo1QyoM5ZCLaZQr6FQr6VQr6NQr6dQb6BQb6RQb6JQb6ZQb6FQb6VQb6NQb6dQx1Go4ynUEgq1lEINUqgTKNSJFOodFOokCvVOCvUuCvVuCvUeCvVeCvU+CvV+CvUBCnUyhTqFQn2QQn2IQp1KoU6jUKdTqDMo1Icp1JkU6iMU6iwKdTaF+iiFOodCfYxCfZxCnUuhPkGhPkmhPkWhzqNQn6ZQ51Ooz1CoCyjUhRTqsxTqcxTq8xTqIgr1BQr1RQr1JQr1ZQr1FQr1VQp1MYX6GoX6OoX6BoX6JoX6FoX6NoX6DoXqUKigUJdQqEsp1GUU6rsU6nIK9T0K9X0K9QMK9UMKdQWFupJCXUWhrqZQP6JQyyjUjynUTyjUTynUNRTqWgr1Mwp1HYX6OYX6BYX6JYW6nkLdQKF+RaF+TaFupFC/oVC/pVA3UajfUaibKdTvKdQfKNQfKdQtFOpPFOrPFOpWCvUXCvVXCvU3CvV3CnUbhfoHhfonhfoXgwqVxMEqDlY4WM3BejjYZA42hYNtwME25GAbcbCNOdgmHOxOHGxTDrYZB7szB9ucg92Fg23BwbbkYHflYFtxsK052DYcbFsOdjcOdncOdg8Oth0HuycH256D3YuDTeVg9+ZgO3Cw+3Cw+3Kw+3Gw+3OwB3CwB3KwB3GwB3Owh3CwHTnYQznYwzjYwznYIzjYThxsZw62Cwd7JAd7FAd7NAd7DAd7LAd7HAd7PAd7AgfblYM9kYM9iYPtxsGezMF252B7cLBpHGxPDjadg+3FwfbmYPtwsH052FM42FM52NM42H4cbH8OdgAHO5CDPZ2DHcTBDuZgz+Bgz+Rgz+Jgz+Zgz+Fgz+Vgz+Ngz+dgL+BgL+RgL+JgMzjYizlYLwc7hIPN5GCzOFgfB3sJBzuUgx3GwWZzsJdysJdxsDkc7HAONpeDzeNg8znYyzlYPwdbwMEGONhCDraIgx3BwY7kYEdxsKM52Cs42Cs52DEc7FUc7NUc7FgOtpiDvYaDvZaDvY6DvZ6DvYGDvZGDvYmDvZmDvYWDvZWDvY2DvZ2DHcfBjudgSzjYUg42yMFO4GAncrB3cLCTONg7Odi7ONi7Odh7ONh7Odj7ONj7OdgHONjJHOwUDvZBDvYhDnYqBzuNg53Owc7gYB/mYGdysI9wsLM42Nkc7KMc7BwO9jEO9nEOdi4H+wQH+yQH+xQHO4+DfZqDnc/BPsPBLuBgF3Kwz3Kwz3Gwz3OwizjYFzjYFznYlzjYlznYVzjYVznYxRzsaxzs6xzsGxzsmxzsWxzs2xzsOxysw8GCg13CwS7lYJdxsO9ysMs52Pc42Pc52A842A852BUc7EoOdhUHu5qD/YiDLeNgP+ZgP+FgP+Vg13CwaznYzzjYdRzs5xzsFxzslxzseg52Awf7FQf7NQe7kYP9hoP9loPdxMF+x8Fu5mC/52B/4GB/5GC3cLA/cbA/c7BbOdhfONhfOdjfONjfOdhtHOwfHOyfHCzHfysc/61w/LfC8d8Kx38rHP+tcPy3wvHfCsd/Kxz/rXD8t8Lx3wrHfysc/61w/LfC8d8Kx38rHP+tcPy30oKD5fhvheO/FY7/Vjj+W+H4b4XjvxWO/1Y4/lvh+G+F478Vjv9WOP5b4fhvheO/FY7/Vjj+W+H4b4XjvxWO/1Y4/lvh+G+F478Vjv9WOP5b4fhvheO/FY7/Vjj+W+H4b4XjvxWO/1Y6c7Ac/61w/LfC8d8Kx38rHP+tcPy3wvHfCsd/Kxz/rXD8t8Lx3wrHfysc/61w/LfC8d8Kx38rHP+tcPy3wvHfCsd/Kxz/rXD8t8Lx3wrHfysc/61w/LfC8d8Kx38rHP+tcPy3wvHfyiAOluO/FY7/Vjj+W+H4b4XjvxWO/1Y4/lvh+G+F478Vjv9WOP5b4fhvheO/FY7/Vjj+W+H4b4XjvxWO/1Y4/lvh+G+F478Vjv9WOP5b4fhvheO/FY7/Vjj+W+H4b4XjvxWO/1Y4/lvxc7Ac/61w/LfC8d8Kx38rHP+tcPy3wvHfCsd/Kxz/rXD8t8Lx3wrHfysc/61w/LfC8d8Kx38rHP+tcPy3wvHfCsd/Kxz/rXD8t8Lx3wrHfysc/61w/LfC8d8Kx38rHP+tcPy3wvHfSpCD5fhvheO/FY7/Vjj+W+H4b4XjvxWO/1Y4/lvh+G+F478Vjv9WOP5b4fhvheO/FY7/Vjj+W+H4b4XjvxWO/1Y4/lvh+G+F478Vjv9WOP5b4fhvheO/FY7/Vjj+W+H4b4XjvxWO/1ae5GA5/lvh+G+F478Vjv9WOP5b4fhvheO/FY7/Vjj+W+H4b4XjvxWO/1Y4/lvh+G+F478Vjv9WOP5b4fhvheO/FY7/Vjj+W+H4b4XjvxWO/1Y4/lvh+G+F478Vjv9WOP5b4fhvheO/leUcLMd/Kxz/rXD8t8Lx3wrHfysc/61w/LfC8d8Kx38rHP+tcPy3wvHfCsd/Kxz/rXD8t8Lx3wrHfysc/61w/LfC8d8Kx38rHP+tcPy3wvHfCsd/Kxz/rXD8t8Lx3wrHfysc/61w/LfyAwfL8d8Kx38rHP+tcPy3wvHfCsd/Kxz/rXD8t8Lx3wrHfysc/61w/LfC8d9qjv9Wc/y3muO/1Rz/reb4bzXHf6s5/lvN8d9qjv9Wc/y3muO/1Rz/reb4bzXHf6s5/lvN8d9qjv9Wc/y3ugUHy/Hfao7/VnP8t5rjv9Uc/63m+G81x3+rOf5bzfHfao7/VnP8t5rjv9Uc/63m+G81x3+rOf5bzfHfao7/VnP8t5rjv9Uc/63m+G81x3+rOf5bzfHfao7/VnP8t5rjv9Uc/63m+G81x3+rO3OwHP+t5vhvNcd/qzn+W83x32qO/1Zz/Lea47/VHP+t5vhvNcd/qzn+W83x32qO/1Zz/Lea47/VHP+t5vhvNcd/qzn+W83x32qO/1Zz/Lea47/VHP+t5vhvNcd/qzn+W83x32qO/1Zz/Ld6EAfL8d9qjv9Wc/y3muO/1Rz/reb4bzXHf6s5/lvN8d9qjv9Wc/y3muO/1Rz/reb4bzXHf6s5/lvN8d9qjv9Wc/y3muO/1Rz/reb4bzXHf6s5/lvN8d/quP23QYM9Iqu/f22nKQctGJg+v7j4nAsP7LKhz6iF+aVpa3+asNncsZ9VaCtHbj/f8Dz/qL652YEJSWW69wEHHnTwIR0PPezwIzp17nLkUUcfc+xxx5/Q9cSTup3cvUdaz/Revfv0PeXU0/r1HzDw9EGDzzjzrLPPOfe88y+48KKMi71DMrN8lwwdln3pZTnDc/PyL/cXBAqLRowcNfqKK8dcdbUz1il2rnGuda5zrnducG50bnJudm5xbnVuc253xjnjnRKn1Ak6E5yJzh3OJOdO5y7nbuce517nPud+5wFnsjPFedB5yJnqTHOmOzOch52ZziPOLGe286gzx3nMedyZ6zzhPOk85cxznnbmO884C5yFzrPOc87zziLnBedF5yXnZecV51VnsfOa87rzhvOm85bztvOO4zhwljhLnWXOu85y5z3nfecD50NnhbPSWeWsdj5yypyPnU+cT501zlrnM2ed87nzhfOls97Z4HzlfO1sdL5xvnU2Od85m53vnR+cH50tzk/Oz85W5xfnV+c353dnm/OH86fzF1QSlIISKA3lgUqGSoFqANUQqhFUY6gmUDtBNYVqBrUzVHOoXaBaQLWE2hWqFVRrqDZQbaF2g9odag+odlB7QrWH2gsqFWpvqA5Q+0DtC7Uf1P5QB0AdCHUQ1MFQh0B1hDoU6jCow6GOgOoE1RmqC9SRUEdBHQ11DNSxUMdBHQ91AlRXqBOhToLqBnUyVHeoHlBpUD2h0qF6QfWG6gPVF+oUqFOhToPqB9UfagDUQKjToQZBDYY6A+pMqLOgzoY6B+pcqPOgzoe6AOpCqIugMqAuhvJCDYHKhMqC8kFdAjUUahhUNtSlUJdB5UANh8qFyoPKh7ocyg9VABWAKoQqghoBNRJqFNRoqCugroQaA3UV1NVQY6GKoa6BuhbqOqjroW6AuhHqJqiboW6BuhXqNqjbocZBjYcqgSqFCkJNgJoIdQfUJKg7oe6CuhvqHqh7oe6Duh/qAajJUFOgHoR6CGoq1DSo6VAzoB6Gmgn1CNQsqNlQj0LNgXoM6nGouVBPQD0J9RTUPKinoeZDPQO1AGoh1LNQz0E9D7UI6gWoF6FegnoZ6hWoV6EWQ70G9TrUG1BvQr0F9TbUO1AOFKCWQC2FWgb1LtRyqPeg3of6AOpDqBVQK6FWQa2G+giqDOpjqE+gPoVaA7UW6jOodVCfQ30B9SXUeqgNUF9BfQ21EeobqG+hNkF9B7UZ6nuoH6B+hNoC9RPUz1BboX6B+hXqN6jfobZB/QH1J9RfkCSIgghEQzyQZEgKpAGkIaQRpDGkCWQnSFNIM8jOkOaQXSAtIC0hu0JaQVpD2kDaQnaD7A7ZA9IOsiekPWQvSCpkb0gHyD6QfSH7QfaHHAA5EHIQ5GDIIZCOkEMhh0EOhxwB6QTpDOkCORJyFORoyDGQYyHHQY6HnADpCjkRchKkG+RkSHdID0gapCckHdIL0hvSB9IXcgrkVMhpkH6Q/pABkIGQ0yGDIIMhZ0DOhJwFORtyDuRcyHmQ8yEXQC6EXATJgFwM8UKGQDIhWRAf5BLIUMgwSDbkUshlkBzIcEguJA+SD7kc4ocUQAKQQkgRZARkJGQUZDTkCsiVkDGQqyBXQ8ZCiiHXQK6FXAe5HnID5EbITZCbIbdAboXcBrkdMg4yHlICKYUEIRMgEyF3QCZB7oTcBbkbcg/kXsh9kPshD0AmQ6ZAHoQ8BJkKmQaZDpkBeRgyE/IIZBZkNuRRyBzIY5DHIXMhT0CehDwFmQd5GjIf8gxkAWQh5FnIc5DnIYsgL0BehLwEeRnyCuRVyGLIa5DXIW9A3oS8BXkb8g7EgQCyBLIUsgzyLmQ55D3I+5APIB9CVkBWQlZBVkM+gpRBPoZ8AvkUsgayFvIZZB3kc8gXkC8h6yEbIF9BvoZshHwD+RayCfIdZDPke8gPkB8hWyA/QX6GbIX8AvkV8hvkd8g2yB+QPyF/QSdBl/8qGFpDe6CToVOgG0A3hG4E3Ri6CfRO0E2hm0HvDN0cehfoFtAtoXeFbgXdGroNdFvo3aB3h94Duh30ntDtofeCToXeG7oD9D7Q+0LvB72/2fE3u/NmJ93sepsdarObbHZ+zS6t2VE1u59mp9LsKpodQLNbZ3bWzC6Y2bEyu0tmJ8js2pgdFrMbYnYuzC6D2REwq/dmpd2sipsVbLPabFaGzSquWXE1q6NmJdOsOpoVQrOaZ1bezCqZWdEyq09mpcis6pgVGLNaYlY2zCqEWTEws3szEzezZjPDNbNRM3M0szwzIzOzJzPTMbMSM4Mwo30zMjejaDPiNaNTM5I0oz4zQjOjKTOqmTXIFyj05/b0BrxlSQckKdGe5JQGDRs1brJT02Y7N9+lRctdW7Vu03a33fdot2f7vVL37rDPvvvtX1Jyf7B4WvfMbH+r4NJlDTZueef1oSUlOw61iT7UPrh05W6t9ml3wcrXKw91DC6dv6V10dV/tbi48tCpwaVzmizvsWhyw4sqD/WLPnR6cGnjRredkP7BwrcqD+UFl948oH/PQ28u81Qeyo8+dHn0IX/0oYLoQ86twaXfFu589HLsnVOWlFk8K31kvt9XUJCdlzuhpHar6sB4bxgW7w3eeG8oiPcGX7w3pMZ7Q+a/r5Ry471h6L+vWLPoWQrQI2T++7KURX9xefTaGneWLon3hkL6M/CrRvZ/4MWNoD90gN57x/3Q+f/77P4rPrv87v6yeG84jF6sfel9a+q/r4lm09tD6n8gS3G3h5H0nu//yxFZR/qbLqRXPv73YZ94bzif/hXNod8Q9xAu7gFWxv9GM4xS+t8igs0NF8Z7Q9I9wVUHerfvqmZk5g3P9wayh+T4MvL83kzzf0U+fzkoY4Tfm5/v85clNS+enpaXWxCYUDyjZ7bflxmQ4of75gZ8Q33+qWd26Vz7Zmvk/Squ+8emR96fFF/89OJpad6cnNImVZyZg3w55qGLfHE+SVI0QcdLeLQ8L1lmeTYtL39U1SOlu/PkglfkvFmdc55eDzmfNjiQl18ajJHTiHeUNr1Xti+n9t+ltI+8safljQ1nVKx0F8/ulef3ZQ/NLS+pO0y9Hh3wZWYMzy7IzKio4mlVNXzA9gp+VkX9Ll/MnlOxv989K6u89VRlPcbxnsHiGYOzh+fn+CqyGP6vHdkJrkrNLsjwjfRlFgbKW1F2bobfZ5pURRPLH+Yt8P0XWlRda5OKJnjqpyWlufPkgpuW5K6eoYQ7avHUfnlFYTW86rKKlth0xxWVVcJ9aV3LpGedy0RFt9GwMghvKvtXNJV8f1FGdkF6ZY3tmzuoqr4OLK+upZHNIcQurWwCVdl86MxOsa+X6OurL/RQhMpWNS0nz5tVlnTKP9xw+tax4fSNfsXJ8RF0NCGl3htOshseu0lEnNGhVhFxxhP6zFU0o1bhzaiXGz+7R3aut/xHV4EB+Xe4GFNNfdpeXaIDSp2LtXedi1XCHyms3YWd8bgzGXYmrNgrCqpbnfuEXvVQ5aJ6lbBniOI3SKzkqu5vFGqdUezG8eY9vDpVgqsqU1UkV4Q5fXOzKqp4RPBG8fY2Mepy4+i63ChUl8N66XkVnXRhICdjqC+Q5s0vKMzxBWN2sQ2LH+nj8+Z39/u9o1wl2liC1XXVxdMrLiwNH8rIxNhdeOyPQcwzDWKe8UysaURV/cci4pJTCofn973E9agN2xdPKz9YenidB80x35+u7v25okw7zXytqv8I61hMqZHZIIop7mREA0qpoQF56A3IE7sBpdTTC6jmY5ASakARpdHAnbXppivz+6o/G/PdNIgO18D17akBKTVVQtMCLYog4mmSwyra9pretZoglrOopHiqjqZXHc2vOjqequMJm+FGvmdPYsMWTw1Vx1OPVSfJqurEHnwnRw/wQkVWNfuu7hU3iHzFOjTECRvxNAxdEHa8UWiwVJHP3pX9347jKSFCZRlG3ppSfd4aRuatoevLW90NjSJvaFTLDY1nnma+cmcM8+ZWG6ZB6KNVeUNa5TTnBfONN0tyuQGzUhEwawcFAW9ups8kAj5/rjenLGm/f3gCNLCOE6CB/wdXDmpbE2hTw5pA2Jl0d4BYE6CI2ULvmLOFPtGTtB1n+ro/RWFnTnGPFMPOnOoedoSdOc09NA470y90pkn4mf6hMzuFnxkQOtM0+k02q/OKyc7xEXaKnts0c8PCxuKLwsfiO5pp3x2t9L4EhsaemGeSY55JSWCg3TDmmUYxzzSOeaZJzDM7xTzTNOaZZvfZTAL+Df+yWdnacV8NS1o1fFU9NYw/kmv4mqdEj+KieoDqRqcNI881jO4FZlYzG2kcea5xdE/gOhDVF7gOuCpIxLmmripS+X18LMtXvmGVV+DLGGY+imVJrf7h72GvOn4Pe/0Hv4dNE/oe1vUpetZ5nUtqWefasYNQ/Vi9MtK0Mzt1PjbqUnf57egh5lQMHbf/Y0D+RPeMYXDhkBhdR+x5XstOSSv2+vSoUYe0PjpvQNF1n54x56pdpx60fue2mwq7Fv1alhc7XvLUfoU5MZ4qsW4subK5zswJVDbUNv+9huqJt3rVtYJaNNSaPhhWK/fVNuH0GmelcXZY6fRtrthVfUb65YXenIIYNTp6MTG5+Y75Z8t6X8fxRE/GW9XQKVTNKWPkvZIQu8V6Klvl3PJJprcwMCxjRHYg12D/+Wllnzq2zj7/wc9oizhWsKSGnbC//TvqibkTpmPuhHli7oQl7yiO3f8F++ueWjqeWN1q3StXcr0uw8fdNhLakw2bOy8Imzt3N73P2RWdT2n1O1YeT2mM3SlP/UzD/uYFzA7/6QXM9qFfPxWYj8swb8GwjHzz8od7h1b9rrDq94T/9MeG8Ounf/1QsK5boWl1zrGK+aMQVQ+/vYi7d0yJ3Tt66ql3TKlx6yfWN1JifiNTav1Gtqlp+FfroL/D/4Ffmf5NvfVe/+neeo/qv301fdYlxmd9Yeg3hKbj72P6/YE7uv3y39dW/2VXsRfKgzG++ar639rOrWjA5k6zRVb+o8W7I7v2VnX8tOxaP91yUig/VeDIj6D1jn3kJLGyTldObiNjSlQN0A2jPqGW0VWs6ElTe2YXhfrZqjxUNueqx64siOCz7pe3vYgzLi/MC2T7cgN3RWavcaLf1x33N6nn19g4BI5RHjJrR0BXsSSFyifGXWr7WlzovdV6eflSYTQ9rHNz1YOIl9Gk6nH+H59D6laVsAEA",
       "custom_attributes": [
         "abi_private",
         "abi_view"
       ],
-      "debug_symbols": "tVzbbtw4D36XXOdCJEUd9lUWP4q0zS4CBGmRbRf4UfTdV5QtWnEhRmO7NyFnMv5MSTyJOvy4+/z48fvfH55e/vryz90ff/64+/j69Pz89PeH5y+fHr49fXkp3/64c/IH/N0fSD/v76B+ovIJyyeUT1i+w8LjQmghfiG8kLCQWAkVSC4EFoILoYX4hfBCwkLiQtJCciW+PABQqF8przSsNK60PAXlrT4vlN1KYaW4UlqpXymvVPCksVQbK7/y5ZNvHQHhvnZPpfJMLFSeSYWKDKn8mvXXefkvQvk21G9FPirf5oWiWymsFFcqT8sQRHlK+gmWfoKf5cs2ZB++vT4+yg+6MSwj+/Xh9fHl290fL9+fn+/v/n14/l5/9M/Xh5dKvz28lv+6+7vHl8+FFsC/np4fhft5vz3txo9yyuvDAaM+DplmAbL0XwXIKW0AKU8DZL8CgAMeItAYAVEbgeRIITy+QfBjBE+wAniG0fOmBL41ApHTCCGMEcAhajd0Muy7IVod6Zoi5EzbYPqdFMmSApJTMdDlIUgegwTnVKcKxhACDKVAz60/Q9cSyje0JKRNr+K4OwwpyMUVgrzvhsTPAvjQetPn3rp4FiBh06vkO+t6+zywMRihmWeIfAQgOloBIrhjAE2xIw4lMB1MU4WMcOR5bnqQYx49jwYAEENT6MJ73EDCrBAhay/6TQicbwWw6iJwdh1EnNclbF4uYd8VJdK96Qtv9UVSq/J0SAyk0FqCHnAshuEtcTNuxC5u7SwTLW9JTvWKujGltNMMw8lk59uwZtcNyi8YhrckhaAufmJ+q1pkeangm41TYH8QA0AxkI5hZGjOinKv5XsMI5B6iOox0XUuM94gRtSm9Ba/F8OMPls49zkNVZTsgK5JReG7KBZuAfG0RTGf/QjEyvAYmr0x+7HZk6GkmFkdWOnHzlzCLSBZG0POuSON8RgbhCfiYWOswU0akDDR1hKGt9mipaU+0ZYvdhC7hNNypMX3NastfEijzvBs9UYzFoYuV+NjDemi674hlh91Gl4xD1NvUwavyXegsQyWZhEGzReJ8qYX/HYew+58QGA4HxAYzwYEJittVYsn1+VcN2GATiYIyMDg087cFGMyttkYmgFSCAe7dDI+mhiT8TG439ulk/HRtNmQ1WZjl3/tbDbYCqZKCpFGbtiEcFkHFvLQkwc+P3E3YjThZinYTbv3UkQrGAQgDQYBcThZfQcF44ZCYYwy2akYwqg50ZqrRNYiQuRhUIhgdarqOXnHQykMP4pbmEfflRDme8ITqgzRDWXw5+NB5LPxIIbzTtTGmHOAJsakA4z5tAO0xZhzgLZu5JYslIrAUDeSoZ/Jt4akfjK+qw2ZCLmZeynCjhHMLFRLAuD9hkFhV2hjc6LTugKgS4aJ3w5JMoYkagqYuzyWeCfFBdP5dMF0Pp2ezmd3PnszMSazt4ynLS1fUJmwMeayt3xBdSNfUN3I8fd26aTzsiw2dwbb9cbeYKsOjQuB6r5KaRIMEDhvtODwvNWCo7NmW0ow5+3WBpk0XHDhtJrZgkya7jsgc3ZnhihgrZN4jsMQBdZyUnCMuiTVOZESu3cgYFUFUYvOvlsP8kA7ELSaA1rQK+0xQAxtjVoESwEMCH+B6VlLO9OmB+G06UG8wPRMkFnTg/PpqS3IrOnZIHOmZ2s8kc6OAxvKinSBpuEFEynA0zMpsBaepjXNBJnVNGvtaVbT7NZg1tZwONiaWXW1QeayvHdAJnUeL5ikAvnfPDiTmd47gS9v+3sYx4GPLphbAV0wuQI6PbsCf8H0ygaZtWB/foJlCzJrfN5dESssTfM6qygy5bGmedMzRh0c7DeD7TGsMmhmraXmON6yYmHgthsLnR/vm7EWpTg2MUK/cSbcIsW2y8Hl4d4XsFakLpACtt11RaJj/Qm6zngCQ80F35jLLRikmo7ExnYma02etPQHHugYhtfEqtTdrsCIBzF4q/+FcBRDKwE+wfm2HMVgp21hcOcx6CiG3zCCH2JYy1JzVmtLoRYHwbA4a0FpTgo7KOgiX+iXUH4JCiGbGwQ0TvoIw6BgY6hDlz0PQwxrTUqCtMbrblnrMEbAIcZ8p/pxp1orU0U/tKwSII4bY2kpqCdk7LenHsXg4eCayyBJl0EwDZdBzNUc5i0B6hpyy1p00roOJR8OQXTbo/JRCL9B8CEI73RJqLD5GMS2nd7RQYig9go4XNoHc2EKtTMAO7/hd5uCINlzdZ1yQL+Z/TYQ3cZNJWe4AIQvAQkGiNWxRBrxqctefgHJ1go/aZpOFMee0MbYpguUw0EMLQ0XjLEjtDtk0zQKxtBkvqBD+IIO4d/dIbjtmO/C3G1qtm1vLEmhH4Kgs3d76qwhERwF2Y6jpG534a8geDp9mMcYpw92Y7Lbin5d5P+1MadLqeguKKXaIJOFGHTnS6m2IJOFmHdA5qqg74DMVXNskMkqKAL95n6drIKaKl/0S1vjyFB5CHMr3jTOVN/B2BYzKcSDGNT51nTMPzNvp4m6Xr3NP7OqvAlibyRNbWR8DN0+v+kzerAdrSoTjS5KuF2fWmtUvB2zYM/jU49orVFx0B2HHMAbINaGVE2t+nK999PncSOE7cBeXzTcH6+yDkdhKRmoHGUNYRuYsEdJVsVu7pSWdTxq+piWdSRo+pwWwemQR3iBa7bHBrrDsX01dT825goVNYw39bb5c98cWSfuMcWxnlnnm6bPFb2DErJqa47djPM2lLjpfE54WJatXF5Q6CDK+aNSHLQuwrmT44ajUjHrRD7mvlwuEP8rHx8+Pb2+vXVCblIQ/yZ3JYj+yU0KlaaV5oXKbQmy5ii3JVSKYlfLbQmVenHhy0UUlQbJJ5arKCpNK83L83I3hSy2yeUUEpbkdopKaaWCl5aLFyqVGyrCekVFWO+oCOslFYV6J1XPQmGluFKSqttye4WUR+X2CjkyL7dXVBpXWvCkAiu3V4iKy+0VlYJclLDcXlEprbTg1RMR9fqKyoTGyGUUMhXi1Jh6JUZRs+AaA43BxlBjfGO4MaFmIoWJjUm1Bl+YvDLR1VlXYaCmC4XBGucLQ40RZDkaEbkxgixOP8bGCLJs04+CLNuykyDLBqYkyLLXOwmydFoSZDGfJMiyOTVxY0JjYnVThUmNySuTBTmXV2RoDDamXuFRZM6+MdyYilxemmNjkuSTAphXpswy6hqccKCcXJwiaXIpESnnleO6ZCVcUC4ql+qimHC5ceCUgxoxhUPlSDmvHCsX6oqWcPIOsQgQk1s5eYdYFYjZrRwoh8rJOyS7hHoNzMKxckE5eYdYJYgZ1lc0OwRyjZEXiImC2OLKkXJeOW4PhMbExjR0sUqs0eHfh9enh4/Pj+JsxB99f/nUfE/5+O3/X9t/2p04X1+/fHr8/P31UfxUdVH18psiyJ8lUYokbiy0bzDcU5Bvon5D91R+I+7uPw==",
+      "debug_symbols": "tVzdbls3DH6XXPdC/NFfX2UYirTNhgBBWmTNgKHou0+UjyjZgVj5HOcmpB2fzxRFUhQl+ufd14fPr39/enz+69s/dx//+Hn3+eXx6enx709P377c/3j89lze/Xnn5A/w3UekXx/uoL6i8grLK5RXWN7DwuOJ0InwifgTCScSK6ECmQuBE8EToRPhEynPgSs0bDRuNG00nyi7jcJGcaO0UXmufCWnjeYT9W6jsFHcKG2UN+o3KnLIiKmOWD7F5RU3bUD4UHVUqTwTC5VnUqEiQyqf9vrpMkIokiCUd0N9V+Sj07tC0W0UNoobladlHqI8JcqCTVm/yptt3j79eHl4kA8ME1mm9/v9y8Pzj7uPz69PTx/u/r1/eq0f+uf7/XOlP+5fyn+L1h6evxZaAP96fHoQ7teH/rSbP+pT3h4OGPVxyLwKkEV/FSCnNAAsS5AzbwDgwE8RaI6AyA0C0XchmM4QeI4ADlGF8DAVwlvDcG0acqauSr6QIlhSQHIqBro8BYlzkOCczmjBmEIkQ5/smzrDOBB3xUBC6pMa59owZ1VNE8nRbFYB5hBMsCHwMKkXAIZpkovb88TcjSL5VQAObT45j94VVgESNstOPHjXuQBgmGUIzT1D9HsAoqMNIILbB9BcK+JUAjPANGvMCHue980Uc8yz59EAAPLQLLHwjB1keR5DVi1yFwLXAcCrLYLPboBI67aEzR0SjqqAfK4LK1BSUsdm2iUGUmgjQQacixGs2KBBDjF0x7jwTDTiZCandkXDnFI6nxM0AmV23KY1u2FS3mBkI8YoBA3rJ5ZwcRYnrSgVuPk4Bc/7MDK0QEN5tNBLDLQwYrMNPlvJrxEjgooR52JY5sU9GeCcpuZF3kwHdOUo/LAIhmtAmPoiyJlnIFZ25qH5ivc8d1lK1iIWNHwVfvCWcA1IDmog4AbPXx8MY7cPIj8djDW5JSFTvx+SG4/nmZ5hpcyJelLQ/d5fJItGZgIlbjWPK/xco8yWNtpIPAyZnt83kGFlvBxIsOKXLo2Yp2mzKQNrhhVoLoOVbBIGTTeJcrcLf74H4Xw8mHt3PJh7OBrMvRVEnXo8uSFfugoDdCtCQAYGHw7mphiL65KNodkbjaHrKozFtc2n91XH4tpm+lvI6m9x2K9f+FsAa33M6m4+wCyE2hApKESaRuFwfMseDAstjyXdpg6ecimFtURjANJAHhDnu3YbBWNHoTBHWVTq6C2XwzGMFKLX8kH004AejECK3d/KFoFmUkRrjdb9XpnkQRXrmki6NGIabONSBjweyyMdjeWRjwdAE2MxeMVwOHjZYqwFL3teNWHBjPN5NcwzcbOMNG5gL+opJkJurloKl1OEBJa76zYamDsGxfP6WEJzg9GCMMCQhJI/30Ynwz6jpl55yB8pXEjBx7Om5I97WgpHPS3F41mTibGYNaV82NNMMRaDho2xljWZGIuBJ9P7qmMx8FjelgdnQ5o6W7Yq2qSRp1TiYI5xg4pTvkHFKR+uOFVvOOpvNsiiw4E7XnSyBVl1OWtVAK8lAfZxuiqAs4r1zqOe3Qx+S/6i3O6s2iijpnA8HFsw8AVItIYDWrsq4zFADGONOjVp2Gi8hbjBxh7gBjt7gMNbe4Ab7O1tkFWvgeO7e1uQRa+xjZWI+67HsDOItzCSdAsjOR5a8RahFW8RWvEGodUeDfbasw87R7NqaTbIWk5kgywmRYDxnfW6mBb9ZrnJ/fKHx/lyYx3ZLDsfwQ2czzx/WnM+ohs4nwmy6nzW6dGqkZiCLEdoy0hYs+cClw0jscqnEFWvOI7mIsqTEVshe63V5Ti/imBhYL/ng47n9yHYsFUfmxhhvBARrpFCb8eUc2yYS0HvKgX0+zVFon36hF7S2Y8R+5mei/swCEDPkPzcNqyDqPIFuk1koH0YrOkMSPH3OEbcieF7jSqEvRi65eUEx8eyF6Pst3XrDe44Bu3F4I4ReIrh41GvtaVQj4NgeJzPR6WwFwW9jRR4iMVvFgWrHlw2p3o7jiNMFwUbQwO6nIfPMcg8iW+DKWtdPo4RcIqxrlQ2lBpM+9A6RIA4H4xlpaCR0ON47XAvhp9OrlmqT1qqxzQt1ZsnDpn67mM4l7virJPQaQ6FxLsgCBWC9kJQh+B9EKxX5ogHw7gKol8kYtwJoYsKjcH8AqKmi/MDGNbaFA5xgy8ujEA0M1K910owXpO+DgT7pSiGG4D4m4AEA8RSLJGu+DRkL29ArGMpIk3TieI8EtoYfbtAOezE0FpqwZgHQlsh3dIoGFNjnmCsKiTeQCHxvRWC/Sb0sMxdZ2b96ltJdXgOktE6THb9kgDBXpDe6ZCGm2dvQfh4+rCMYaQP5mByD/BuCPBvBxMP11ByukENJafjNRR07ngNxRRktYZigyzWHk2QxdpjKWy8s0pWa4/ZPAvpC5ajubWii2unsjRPMn+D0Q/uKMSdGDSExbQvtHrfGzwGrV4XWr1aqwli3zFMbWY4huFe3XLbFPRuF4iDz7C7aM+wjqh8vz3v2c9b4dDqPfJBL6P5AGyAmGdUutL48YbgcotkrFvHihBhrPdddrxY51NY5O9teWOxLVyiGHsqpoZxVo5Zb/f00eu+LqY4Hwtau4DVloTfoES9hl/4wVSvREkdZeyyu1YWP6DknSjHuyx80G2zz8Ntlyu6LGLW7peYx2qqQPxZXt5/eXw57ziXBmo5J5AGajmSkAbqStNG84lKk7RsZaVJulKUKxKnJulKWRaVUxN6pUHCxqkNvdK00Xx6XvrSpSwnjeniHtKZXiltlCWKnfqtKw3SSXNqTq80bTSfqDSnS+lMmtMrxY2SnJEVyuLDhXq53lBo2GjcaMGTHl5pWpdWFWlar1Qa5/nUtF4pbZSlKERb13plQmOkB12MyqfG1E748q/gGgONwcZQY7gxvjG1Ib6EmBAbU1vYixpD3pgoyKLgKMiisSjI0nsRqTFcy0yF8Y0JtRpZmNgYQRZbjoIsxx1JkKXSnwRZdJgEWW7xJkGWyzVJkGX1Sb4xoTG1I78oIaXG5I3Jgix3wTM0BhtTkYvMmRvjGyPIcps+x8YIslStct6YkoTKyg/CgXLyowmu/peUY+XEEeRSDLigXFQu1SMf4XLjwCkn31F/UgBQOVKOlfPKhXpoIlysLVHCJeXkO2TmQdxu40A5VK7+NgQLx8p55YJy9TtklOKGYi7Q/BDINaZ+QeVQOVKOlfPtgdCY2JiGTnUAssj8e//yeP/56UGCjcSj1+cvLfaUlz/++97+034P4/vLty8PX19fHiRO1RBVf/iiCPJHWYwjSRgL7Z0iEAV5J+o79IHKZyTc/Q8=",
       "is_unconstrained": false,
       "name": "verify_private_authwit",
       "verification_key": "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA0AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAv5JMhlsMlvWSmA7qX/phBpkAAAAAAAAAAAAAAAAAAAAAACKa6qdc5kMKDSS7Dz8gxQAAAAAAAAAAAAAAAAAAAPc7lyeMznAJdTkppVBDDKw9AAAAAAAAAAAAAAAAAAAAAAAr1h0zaeVsVJF0ZIFXTLEAAAAAAAAAAAAAAAAAAABRx9yb70YbAcxcCmfXQ/jUwgAAAAAAAAAAAAAAAAAAAAAALxFYwHGp9vOdKm/s905UAAAAAAAAAAAAAAAAAAAALIdc6cXCxcdmGUhDNifsGfAAAAAAAAAAAAAAAAAAAAAAACzszh2HwyLoOfQNiumcxgAAAAAAAAAAAAAAAAAAAAOF25CZ6tZuLQBuUDjS9Ip2AAAAAAAAAAAAAAAAAAAAAAApd1ErBvgPggH+iqeEfQUAAAAAAAAAAAAAAAAAAABUuUcb7zEg1zKXAKdRwIdAXgAAAAAAAAAAAAAAAAAAAAAAEpxj+x//Qe4MHucZgjayAAAAAAAAAAAAAAAAAAAABxdHoE80tY4/Su7dlNKxQd8AAAAAAAAAAAAAAAAAAAAAACMmrBhGm93GYY5og5ocJAAAAAAAAAAAAAAAAAAAAGquMoQmIv9pGemwiF/qtHqXAAAAAAAAAAAAAAAAAAAAAAAJfaFcFnS/LijKmaoVndgAAAAAAAAAAAAAAAAAAAAm/Tir6MBabbmt3DztiSqdkwAAAAAAAAAAAAAAAAAAAAAALqxxmA0hc/1YZHYOu9d5AAAAAAAAAAAAAAAAAAAAle1IIXICnkNajkiFMR9OtZ0AAAAAAAAAAAAAAAAAAAAAABcstVqZcvbn3/7iR0XrtgAAAAAAAAAAAAAAAAAAAN+gMd1aoeax2uf30a5yjltXAAAAAAAAAAAAAAAAAAAAAAAWB2ZF4G6k8Dc+ykHWrV4AAAAAAAAAAAAAAAAAAADsADVXVwvmEDS3sk0B50nZYAAAAAAAAAAAAAAAAAAAAAAAG13gyvv+KyFai5rkDCmBAAAAAAAAAAAAAAAAAAAAu7KXTMtq2zKhERy49eNE25UAAAAAAAAAAAAAAAAAAAAAABBoaF4ReQtbt36ZwF4eGwAAAAAAAAAAAAAAAAAAAFVkUontgKxlNhIt1A8/VUDbAAAAAAAAAAAAAAAAAAAAAAAvYD8Myp2QGNa2cW6DcW8AAAAAAAAAAAAAAAAAAADcnn3qM3vxJp2iEwSeC4ZPIgAAAAAAAAAAAAAAAAAAAAAAHDdxW/q8OdqEG8kTkGWDAAAAAAAAAAAAAAAAAAAA01guDlAAgdT9BmxvwSfHogoAAAAAAAAAAAAAAAAAAAAAAAK6kyZIvVE0sVQXtVZe2gAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAa2K16WwkURoJAZON7/ShAK4AAAAAAAAAAAAAAAAAAAAAAA12y9g637exNNRC2SB5YgAAAAAAAAAAAAAAAAAAAK/kP7dH45GZ1iVplDAULHxfAAAAAAAAAAAAAAAAAAAAAAAOihhZSuiYsPf+AbXTKiYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAntt56C+qBzu+6z5StfGvqKEAAAAAAAAAAAAAAAAAAAAAAAWGkCEmml6a4+LdbKCCJAAAAAAAAAAAAAAAAAAAAJJ8KhXew3ZgQz2zjk52mqqKAAAAAAAAAAAAAAAAAAAAAAATMIsti9yR+0ZVbvKqnkcAAAAAAAAAAAAAAAAAAAAC5x1vyN1cNL0sOilxVjl+pgAAAAAAAAAAAAAAAAAAAAAAJVsEiI5IsUbcvDMTt+XtAAAAAAAAAAAAAAAAAAAAVfa4Pc3X7BNZyfJCWb9y5vUAAAAAAAAAAAAAAAAAAAAAAANqpazmhOPg94Z5TQF++AAAAAAAAAAAAAAAAAAAAHoQxOC0HdCZLt59ruXdBH/vAAAAAAAAAAAAAAAAAAAAAAAb8oxxLoZZbn+PI6lTuXkAAAAAAAAAAAAAAAAAAAA1hC6ioWGkCrQro3AngrR2VAAAAAAAAAAAAAAAAAAAAAAAGAB1eTA0XjfX9d6tFJToAAAAAAAAAAAAAAAAAAAAAi70CMIPziToqnXxAet6HPoAAAAAAAAAAAAAAAAAAAAAACpaAK97lZsWb8vRFhdIpQAAAAAAAAAAAAAAAAAAAMkrZlbadUeqPz8Hu1+Jlap6AAAAAAAAAAAAAAAAAAAAAAAHovQJ9IZUZCuGfriyiucAAAAAAAAAAAAAAAAAAAA70huy7vxR4WbLLwZfnABbDQAAAAAAAAAAAAAAAAAAAAAAD0eILPf+FAqsLpn6wBG+AAAAAAAAAAAAAAAAAAAApbeLUE+BcIgjVBTgmT4M/lAAAAAAAAAAAAAAAAAAAAAAAApQkQAmcPAkiEH+qrG2fAAAAAAAAAAAAAAAAAAAADMzKHrS52afxH1aFZq47ImRAAAAAAAAAAAAAAAAAAAAAAADLjxZ5/qPrtaDb7B+lDwAAAAAAAAAAAAAAAAAAACHIB8/qC6cA0klyVBE+fQMkQAAAAAAAAAAAAAAAAAAAAAAJdjEVkuvvzFif+DrECU6AAAAAAAAAAAAAAAAAAAAh93jnyCb8mltjOMCVPEgWlkAAAAAAAAAAAAAAAAAAAAAACV0Db+kSQykqjegSiQMdAAAAAAAAAAAAAAAAAAAAHLcLCknHexR9yQuXNoUluk3AAAAAAAAAAAAAAAAAAAAAAAMrt2ZvRkrxqxplB0YacgAAAAAAAAAAAAAAAAAAACnGlfk0sn1V4EGUDLfdBJrQAAAAAAAAAAAAAAAAAAAAAAAF90OO1dGozh++h0OrVX4AAAAAAAAAAAAAAAAAAAA4Te9PDDUl+3++of3B11y1TEAAAAAAAAAAAAAAAAAAAAAABiLQMNuUG/nFhDvnmgTiQAAAAAAAAAAAAAAAAAAAHZAxdJBxc/mF26og8UeIzOCAAAAAAAAAAAAAAAAAAAAAAAsZbsbAUXDBurH/4OZjFUAAAAAAAAAAAAAAAAAAAD3gv5SOCiz4K0vGO7cKcsvfQAAAAAAAAAAAAAAAAAAAAAACL3t9j0fkTnD+TRrw7mmAAAAAAAAAAAAAAAAAAAAWKzUnPrqM+5LTawiW0rLWzUAAAAAAAAAAAAAAAAAAAAAACx5wbD1x1A2zbLqyHolxQAAAAAAAAAAAAAAAAAAAOFgl2sVAbzDvsZY8HMmSSulAAAAAAAAAAAAAAAAAAAAAAAGhpF70nfbdPa4KrZU8ioAAAAAAAAAAAAAAAAAAADC0QVQ8mDY98kD8YPSDvy4YgAAAAAAAAAAAAAAAAAAAAAAA9hWxz6n7HiKMGlD529KAAAAAAAAAAAAAAAAAAAAdi7h9WvU0/IjIDezvYehU/IAAAAAAAAAAAAAAAAAAAAAABHqxZqhwFcrT7PLW4ExZQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFgGfDRcKHk8f8kcwJvDeY1QAAAAAAAAAAAAAAAAAAAAAAGeV6XHQ4Z7g1vELBB4HcAAAAAAAAAAAAAAAAAAAA58BBev08g6/l9IowhVrMgNkAAAAAAAAAAAAAAAAAAAAAACpvJ49Nuy6Y3BBz8HaP6QAAAAAAAAAAAAAAAAAAAFMnbT/XJAYadAombfyx8w/qAAAAAAAAAAAAAAAAAAAAAAApqD6kNDBLUT+LeVu+dzsAAAAAAAAAAAAAAAAAAABEO4J5IeT3KGfHrm0hyBriqAAAAAAAAAAAAAAAAAAAAAAABVZTs4IagEoNB/KFwwYgAAAAAAAAAAAAAAAAAAAAPferxhDuR/Du4b0NN/ay6O8AAAAAAAAAAAAAAAAAAAAAABRZT1NswlJXzKlGLpN5pgAAAAAAAAAAAAAAAAAAAOPl42VROe5m1Ta1E1O7VHpSAAAAAAAAAAAAAAAAAAAAAAAmnbkeyqoTL4HPNLs8J9EAAAAAAAAAAAAAAAAAAACy/tXRJPM2s+xHJiEPg3qYDQAAAAAAAAAAAAAAAAAAAAAAGE9f+F/LQgfe9ZoXe3iLAAAAAAAAAAAAAAAAAAAAZjQ0/Z7BxMmxvu334bx0cFMAAAAAAAAAAAAAAAAAAAAAABykNS7TgWyeyX0rdo86TgAAAAAAAAAAAAAAAAAAABnIXnzFKtYZgA3R94Pnu2lXAAAAAAAAAAAAAAAAAAAAAAAuEFWjvnP6JEhySptqC94AAAAAAAAAAAAAAAAAAACisC2cQ1OXvaQ1NOuMjrPjUgAAAAAAAAAAAAAAAAAAAAAAEjV/cELaRJmZENw88WFgAAAAAAAAAAAAAAAAAAAAkNKgvUQQb/Lcgm2JVMzIikQAAAAAAAAAAAAAAAAAAAAAABUswmnFiyDPobvZ6KfImQAAAAAAAAAAAAAAAAAAAFtsSgjYgrN575fwTI+StMEJAAAAAAAAAAAAAAAAAAAAAAAuCQTzka/dmZhMW6VA1SEAAAAAAAAAAAAAAAAAAAAa4PoE+jCgIpSiu2RSyc8x5AAAAAAAAAAAAAAAAAAAAAAAE316Hx0Ik6JFvmWf0zs8AAAAAAAAAAAAAAAAAAAAj65E5LBgofKDSaze8gQ0bZYAAAAAAAAAAAAAAAAAAAAAABEmh6qXIiIGToR/Estq2wAAAAAAAAAAAAAAAAAAAA2DPBNW7lWvS9fH2DYK58V4AAAAAAAAAAAAAAAAAAAAAAAlTJG2sSUVJdi3YqavfPMAAAAAAAAAAAAAAAAAAADhfgqpS99Fz3/A0UeV42TdsAAAAAAAAAAAAAAAAAAAAAAAAF5wAEu0+49fHB0p3lc3AAAAAAAAAAAAAAAAAAAALNrztif7n5RNuPfXmimgo6YAAAAAAAAAAAAAAAAAAAAAAAgF+HKHFNgttl6OFUX1SgAAAAAAAAAAAAAAAAAAAFYsbDx4oISQ0lcD0Lu4124gAAAAAAAAAAAAAAAAAAAAAAANeviMdWzubFev5gfFBdU="
@@ -7907,6 +7975,10 @@
             "error_kind": "string",
             "string": "Index out of bounds"
           },
+          "4215903597095405243": {
+            "error_kind": "string",
+            "string": "offchain message anchor timestamp is implausibly far in the future"
+          },
           "9530675838293881722": {
             "error_kind": "string",
             "string": "Writer did not write all data"
@@ -8018,23 +8090,17 @@
         ],
         "return_type": null
       },
-      "bytecode": "H4sIAAAAAAAA/+2de2BcRdnGk2w291vvF9hr2ia7AaSlVES5tGkDrZSWliIiUpZk2wa2SdhsC6WCBBGqgCZpQbACStvQQotIQa6i3FVmsCKCSLVaCyhXUUBA0G8K3d3Zc87MOXPyhP3U6V/TPTu/9z0zz7xz2Zz3ePr7rrq1c8mS1mWx9o7FyXhrvH1lvK/n5hnJ9kSifWlzLJFYV9Dfs2l6MhlbtbPw6LW9ff0PBwvk/woLbL9S4AxUiAIVoUAeFKgYBfKiQCUoUCkKVIYClaNAFShQJQpUhQJVo0A1KFAtClSHAg1DgYajQCNQoJEo0CgUaDQKNAYFGosCjUOBxqNA+6FA+6NAPhTIjwIFUKAgChRCgcIoUD0KNAEFmogCTUKBGlCgRhQoggJFUaAmFOgAFOhAFOggFOgTKNDBKNBkFGgKCnQICjQVBToUBZqGAn0SBToMBfoUCnQ4CvRpFOgzKNARKNCRKNBRKNDRKNB0FGgGCtSMAs1EgWahQC0o0DEo0LEo0GwUaA4K9FkU6DgUaC4KdDwKNA8Fmo8CnYACLUCBFqJAJ6JAi1Cgk1Cgz6FAJ6NAn0eBTkGBvoACnYoCfREFOg0FWowCnY4CxVCgM1CgVhSoDQWKo0BLUKClKNAyFKgdBToTBToLBUqgQMtRoA4UqBMF6kKBzkaBkihQNwqUQoFWoEArUaBzUKBzUaBVKNB5KNBqFOhLKND5KNAFKNCXUSByIYzUAyNdBCN9BUa6GEb6Kox0CYx0KYy0Bkb6Goz0dRjpMhjpchjpChjpGzDSN2GkXhipD0bqh5HWwkjrYKQrYaSrYKRvwUhXw0jXwEjfhpHWw0jfgZGuhZGug5Guh5G+CyN9D0a6AUbaACNthJE2wUgDMNKNMNJmGGkLjHQTjHQzjLQVRtoGI90CI30fRroVRvoBjHQbjLQdRrodRroDRvohjHQnjHQXjHQ3jHQPjHQvjHQfjPQjGOl+GOnHMNJPYKQHYKQHYaSHYKSHYaRHYKRHYaTHYKSfwkg/g5F+DiM9DiMRGInCSE/ASL+AkXbASL+EkZ6EkX4FIz0FI/0aRnoaRnoGRvoNjPQsjPRbGOk5GGknjPQ7GOn3MNIuGOkPMNIfYaTdMNKfYKQ9MNLzMNILMNKLMNKfYaS/wEgvwUgvw0ivwEivwkivwUivw0h/hZHegJH+BiP9HUZ6E0Z6C0Z6G0b6B4z0Doz0Loz0Hoz0TxjpfRjpAxjpXzDSv1EkisvARHE5mCguCxPF5WGiuExMFJeLieKyMVFcPiaKy8hEcTmZKC4rE8XlZaK4zEwUl5uJ4rIzUVx+JorL0ERxOZooLksTxeVporhMTRSXq4nisjVRXL4misvYRHE5myguaxPF5W2iuMxNFJe7ieKyN1Fc/iaKy+BEcTmcKC6LE8XlcaK4TE4Ul8uJ4rI5UVw+J4rL6ERxOZ0oLqsTxeV1orjMThSX24nisjtRXH4nisvwRHE5niguyxPF5XmiuExPFJfrieKyPVFcvieKy/hEcTmfKC7rE8XlfaK4zE8Ul/uJ4rI/USf5n3oGFrZ3LE3EnSIdZILqXdtr/zhN4c7C6QWFRZ5ib0lpWXlFZVV1TW3dsOEjRo4aPWbsuPH77e/zB4KhcP2EiZMaGiPRpgMOPOgTB0+ecsjUQ6d98rBPHf7pzxxx5FFHT5/RPHNWyzHHzp7z2ePmHj9v/gkLFp646KTPnfz5U75w6hdPW3x67IzWtviSpcvazzwrsbyjs+vsZHdqxcpzzl113uovnX/Bl8mFpIdcRL5CLiZfJZeQS8ka8jXydXIZuZxcQb5Bvkl6SR/pJ2vJOnIluYp8i1xNriHfJuvJd8i15DpyPfku+R65gWwgG8kmMkBuJJvJFnITuZlsJdvILeT75FbyA3Ib2U5uJ3eQH5I7yV3kbnIPuZfcR35E7ic/Jj8hD5AHyUPkYfIIeZQ8Rn5KfkZ+Th4nhFDyBPkF2UF+SZ4kvyJPkV+Tp8kz5DfkWfJb8hzZSX5Hfk92kT+QP5Ld5E9kD3mevEBeJH8mfyEvkZfJK+RV8hp5nfyVvEH+Rv5O3iRvkbfJP8g75F3yHvkneZ98QP5F/s1OJdlpIjsFZKd37NSNnZaxUy52OsVOldhpEDvFYacv7NSEnXawUwp2usBOBdhunu3C2e6Z7XrZbpXtMtnukO3q2G6M7aLY7oftWthug+0S2OqercrZapqtgtnqla062WqRrfLY6oytqthqiK1i2OqDrRrYbM9maTa7slmRzWZsFmKzB4v6LFqzKMuiI4tqLBqxKMJGPxu1bLSxUcLUzdTY28t0a8qXv9N7Us+m5s6O7tTanoGZ7ezTVFHPjbM7UvGl8eSGRYfYT3OFxvqFSvV71hjrFyjVL1zTs3Fvqv8+WrQ0Q9q8IJ6IpdjtFauxppsJXrXWKOjZutebtlgq1tzZtSpzU8fwPnFw5jt36ydlC7xVw7dOzhbS37ph0WTDl07JFrKoaVMN3zozW5AYTGQLYoMd2YLE4AXZgsQguZAriU2Si7iSxCjp50oys+u4ksTsVVxJZnaAK8nMbuZKErM3cSWZ2Xu4kszsfVxJYvZ+riQz+wRXkpndwZUkZp/kSjKzu7mSzOweriQx+wJXkpl9myvJzL7DlSRm3+NKErNspuGLEsNsNuKLYtNswuKLUuN+vig1HuSLMuNhvig1PoUvSo1P5Ysy49P4otR4C1+UGj+WL8qMz+GLUuOn8EWp8VP5osz4aXxRaryDL0qNd/FFmfEkX5Qav4gvSo1fzBdlxi/hi1Ljl/LFHOOmVYLimumYQa8zTu/ZMLdzZT+/qsgsv0zsEjV2rOfmGe0dseQqVmle15UZ8IbpbW0f3n7GEmdh2+yOtg8/HdwSjC0nc41nTWTMm++5yNgaZXzXGK6V826b2qpSzd1aI71C0g9Vauw69X6oEvdDBagfqsz9UGHsh33/9fAdknOlmHc554qX74r0yj7Rs2lhqjMZt+7FCkAvCm62zHyzZbwVQbVyc7XybBttPK4z1sbdSikPl91oqZKbGXvaSe3kf4WTOljrYK2DtXZSO6mDtQ7WOljr0aud1E7qYK2DtQ7WOsRoJ3Ww1sFaB2sdrLWT2kkdrHWw1sFaj17tpHZSB2sdrHWw1iFGO6mDtQ7WOljrYK2d1E7qYK2DtQ7WevRqJ7WTOljrYK2DtXZSO6mDtQ7WOljr0aud1E7qYK2DtQ7WevRqJ3Ww1sFaB2sdrLWT2kkdrHWw1sFaj17tpHZSB2sdrHWw1iFGO6mDtQ7WOljrYK2d1E7m0UlDqC3KFouN1zzpWnvTm6fDyDmDzW1euMZM8Ki+Q2Uja82uPuv78BjfF9O8qaU9nmhj2CsmP7B90aXP7Dxj5rjbPG+sfv6hu4Pn7Kp5vrS45OmRB66+3lhxZqbiu68+edn6gge3j97t2TLm4NvOv+6ot1bPe70/Mer18+Prb7nLWHGW2v2YPG5Rq188sCCeWpHssJ7rSo1znSc7T+RMG2XZL+R8Xp6dcTbOWbG8i6kglRb7vislWUZa6MbKJdbelRm9Ewo8DTRWKLepULH5uHh394nLYh2WZkp7Bvbe1OwlGZcraFFXpkVb2M20L+3Yq/4r742dl4q3Ll6RSixeGk8tSrUn2lOrWM+l4uemdhaM7dk2N768M7mK+ZdkFrOK9AqvlAivlAqvlAmvlAuvVAivVAqvVAmvVAuv1Aiv1Aqv1AmvDBNeGS68MkJ4ZaTwyijhldHCK2OEV8Q6GCe8Ml54ZT/hlf33Sm5gYfvyrkT8o0D1n/a/3Hdm2H1l2lQl5sZFk6ccJv9U1e/eXsDrvwb78o06M6GUf5+JwvvYuJCi5ILFWzHKVXdGmwa5txr8ttNrsbnMTPg2/8xVq1V3SyZCjRphpJlQa+P+SLH7dWrGh5sJw9QII8yE4WqEUjNhhBqhzEwYqUYoNxNGqREsNt6j1QiVZsIYNUKVmTBWjVBtJoxTI9SYCePVCMPMhP2VAmOB+ZVJXJhPL337RPsuX+4604riya41s9Vo0YMZ+DqjC5WSo7Bq1fZRPgqrFh+FVaoGfEGrVZt3q5WSo8Ua1clSYLbGbLaGv29DN9Ty19Kddb15U1/LL58FpmvNpmttN/V1AnHV8v6bxVVHi651pOoNIsNed6r20qItGfiACF4k7fycvdezE7Obr+74XjmmkrHW1MJVHa3NsdZl8dkdK2OJdrZEWytZSm85Nh7rmp5MxlbxRwfiDYhnrWE5uOmjyn25H9dZLmitN+UqDVti3bBb04cx3sOF8A1zVySE3DKFwVhkK02Lw+zqHIkZjsWqHIwRC0e8/FLR+ai2999rEwqM/ntlN1ft7uaquZBnjClV5rhk/m2g0niEVKw6OaQ1dYQxXlRlj4uc31CVbbPXSGVTbG6HGr7dnfdlMb9JkYVC08zL3YxtmAy6G81BWvSI/WgOuhvNYTejIWSuFOY8MQk+xBedOxLke0VQbYIb/+vNlSbwt2L0v54vuvJfGI0muvHf4qYnyvyfwBdV/M8cVQsqTXLjvcUtT5J5P5EvuvC+RVSpwY33FrfcIPN+El90pZ1KqP9BRf+DsoEddjeww5KZLCRzZqjtGcK7X7KxCqvNnaPUN1Zh8cbKD9pYWbSVX7KxalA9fXIu3AZJNzTmSGLfLPuauSsbHayrGs2mG23HTEQwcTfy/psn7ggteuV/bcj4JKulAH8t3Y/vCp0SNLqPXwuaGz1MvRMy8PfTr+O20ln9vv2aaJEgsB/gV5tm+/XUU8Ct1kRrcf8g1+KjxGvxetu1uMUgqLcfBFYjh2sVk0wifKsLoH4zNOBg1dd4S7pvZp29IpboFhL8Fj3USD2Zv3jyzheZCAi63y/v/gD11Djo/vqh6/6Am+4PDLL7/dLun6CwEPcPuvv9Oaq26v5xXPcbAwRXe6I8QDQKFFIvVwiz73OgkMDQKaTRViERN7Nk1FwpkqN4o0KifKuLhqFVqLJXSESqkPoc4VvM255GTiHmL0yknoPTc4wnqjCrOolt9U5jW9h69jmIc108OTdm/D8KPwEe4kDfjUOnb5+tvi3ijs9NBKx3OgFO+n8mkiP5CJgRgjEWcgE+KI+FoqOtsFwrQeppdqAV39BpJegmFgYHGQvD0ljYKPzxUHrs5jIWhnOGgFUsPN5+sRQesEL75J0fpp4TMuiFwlWsxd7bp/pHHMp7b594710P2nv7pItwQ2vk9JJJPNzVKtAe7z8OWetkt+k5XfWHeY5SZvnDfPGeDLzV3cxRbtqzR/ii8wjDHdUNMzGjfHHbR8wPQ/q8rnXZS017qZaORIdsL+MVR+eIbXSWB9pyaaBtUoBy/VUhb1vnS44gHx+lvzkI+yuY219RvpKovyJD11/1bvorp2ll/RUUTt4Wc0RkyOeIiHiOCILmiIibg5qodMGyeUYi1nrWjM5ze26f39kdb2/r7JgyP55cviLFvtnZ0c+PvmK+H4rdKbtcrmzR4YVFjwaH/MQ9KO7RAKhHg9Kzl8GqeKSCkCKSgZUz6NLT2xXSwVmlIMeorYabBNNxNGduME3HTdRzmewXrJBCtwSdnYAHP3Z7CifuYas10NWqmzibE/cgLX4iA18v/JsBdzvEEPVcl9/TspCbHWJoSHeIDQqnZU52iA1Od4hWp2UN1LPFwQ7R3WES2yNuddD9oaHr/rBt9zdI9yzONdOQI2c3x+khd4dJDU4Pk0LW3X+n+19TQvLuZ7+m3OOg+8P5/DWlAfRrSkOOnCXd71f4MS3koPvD0u4P8YYtB+gjdmflNDM7PKYwHzr5ISjk9IegoPXU8rijs/JAxv+dqrOb33Z225Hf2c3+rDzk5qw8LJWiX3qSMwksksBgRMIi0HMWZ+VCIfgFQgjKheCnnl35PQj32wohIP1jIVdTUlC61FU5CA8OWgjBHH1bCeElB/Ocm4Nwhn6VOwjPeaTh7o+eaFje3t2693nyBbGOts7lH54D9QmfSPD1mR5JVelSriGNW5sAX1Q4jAmpPrepvHUPDf1hTEi6ZxPvvELSaBdQ6Jug4LmXO7OPvXSt6F42q2tZfHk8GUuIJRLqs3wcpV+sKevnYgKF/Y6efil0p8AKrUCtwHwoMPOH71p/Wn/501+L1p/WX15n4EqtQK3AvCqwTCtQKzCvChyuFagVmFcFjtAK1ArMqwJHagVqBeZVgaO0ArUC86rA0VqBWoF5VeAYrUCtwLwqcKxWoFZgXhU4TitQKzCvCqzWCtQKzKsCS7QCtQLzqsDxWoFagXlVYJ1WoFZgXhU4TCtQKzCvCqxRUqAf93C9CwUGhz6dbVD6hIrpuV7ONdljKAGlvkEpMPjxK5B3+Pasw+x2OpNtLbHWVG/vNS7eQTfBeGVfEzULa9QLasyU3LzwDXgu3rhYdc3H8ka7GxZNdvKWO+cPQTl8jYHP/j1Frh5pD0ofaffJU4uLHHGXNiBCi5/K74OVLlMX2bVxk1U2Da5VTIGsyUEjB92lDYg6TRtg9WBllBbvsn+eLmr18KlY5D6+VcT5wCKS1UjQPk+GZeY2zimjzn18UfjArOn1HYHsUyjwwfGS/QtF5GmEnMeNHHlKM50Js1xFc7Nc+cw9aR7aQ5iVzP6Z6YiNbGWP90cVoNKsZC6zyDkZ+U1OR37UMklP8Xv2I99BBqAaa/gH9to+wI22LULvAbxfxvZv4otOtR3hKw3VY+CDyrjXJJ3lK6QzUFQppAofwnMSUOXKrhgiZXur3afCsVF2mHrr7JXd5EbZFtkammTKDvNFF1E7nI/chPZRO2wVtTMilB1SRFWy14ZVb0l5qx0e+uy1srZSy6CdqaSQmTDMZyaMFCtElYBk9Rjg78U2Y2yDmy1SWJr3xycfaSJH3KXWaqDeaH5fVNJgOyIbrZrLhcocv6gkrNBx0BeVhC3fFOE91H46aXS9RWo0HxByzSweHGHu5T3GQJMJRlmRTJsqFsmesvmziu64PNCz8cRkrKuvP1s/3cvpN6TuGxn7Pi7JKtUyOpbyeViMdYqybZ3+OvUenzsCvFlPnIbfzPiwrFBurODJVsixXJH9Qs7nlVnX9jW/d46hVcqyjLTIjZXLrL2rMHpXIRpmaaCxQqVNharcKGU0U27qkyrqbRHJy6s6i6VbbJ6glz1pmQ1SzztKX37z8UeX9trreZCGLm5+6MDdL24/z9bQ/wFiAurA4U4BAA==",
+      "bytecode": "H4sIAAAAAAAA/+2deWBcVfXHk8xMlmm27gtNZmuazKQoXUGQpXtLqa0tBQGxDMm0jc3WZFIaKuJYtgpokpZNEJC2obUUgRYBKyKLuHCvbAKiFRCoiAiIFrGC8ruhnZk7771735JvOj9/v9u/bvPmfs55737vuefdeXOeq6f72rtaVqyoWxVtaF7eFquLNayNdSd2zmhraGxsWDkz2ti4OacnsW16W1u0c1/uKZu6unse8+fI/+XmmH4kxxooFwXKQ4FcKJAbBfKgQPkoUAEKVIgCFaFAXhRoEApUjAKVoEClKFAZClSOAg1GgYagQENRoGEo0HAUaAQKNBIFGoUCjUaBxqBAR6FAY1GgChSoEgXyoUB+FCiAAgVRoBAKNA4FqkKBxqNA1ShQDQoURoEiKFAtCjQBBToaBfoUCvRpFOgYFGgiCjQJBZqMAk1BgaaiQNNQoGNRoONQoM+gQMejQCegQJ9FgU5EgU5CgU5GgU5BgaajQDNQoJko0CwUaDYKNAcFmosCzUOB5qNAp6JAC1Cg01CghSjQ51CgRSjQYhTo8yjQEhRoKQp0Ogq0DAU6AwU6EwX6Agp0Fgp0Ngp0Dgr0RRToXBToSyjQchToPBQoigKdjwLVoUD1KFAMBVqBAq1EgVahQA0o0JdRoNUoUCMK1IQCNaNALShQKwq0BgVqQ4HaUaA4CtSBAq1FgS5AgdahQJ0o0IUo0HoU6Cso0EUo0FdRoItRIPI1GCkBI30dRtoAI10CI10KI10GI10OI10BI22Ekb4BI10JI10FI10NI30TRvoWjNQFI3XDSD0w0iYYaTOMdA2MdC2MdB2MdD2MdAOM9G0Y6UYY6SYY6Tsw0s0w0i0w0q0w0ndhpNtgpC0w0lYYaRuM1Asj3Q4jbYeRdsBI34ORdsJId8BIu2CkO2Gk78NId8FId8NI98BIu2GkPTDSvTDSD2Ck+2Ck+2GkB2CkH8JIe2GkH8FID8JIP4aRHoKRfgIjPQwjPQIjPQojPQYj/RRGehxG+hmM9HMY6Rcw0i9hpCdgJAIjURjpVzDSkzDSUzDS0zDSMzDSszDSr2Gk52Ck52GkF2Ck38BIL8JIv4WRfgcj7YORfg8jvQQjvQwjvQIj/QFGehVGeg1Geh1G2g8j/RFGegNG+hOM9CaM9GcY6S0Y6S8w0tsw0jsw0rsw0l9hpPdgpL/BSH+HkQ7ASO/DSP+AkT6Akf4JIx2Ekf4FI30II30EI/0bRvoPjPQxikRxFZgorgYTxVVhorg6TBRXiYniajFRXDUmiqvHRHEVmSiuJhPFVWWiuLpMFFeZieJqM1FcdSaKq89EcRWaKK5GE8VVaaK4Ok0UV6mJ4mo1UVy1Joqr10RxFZsormYTxVVtori6TRRXuYniajdRXPUmiqvfRHEVnCiuhhPFVXGiuDpOFFfJieJqOVFcNSeKq+dEcRWdKK6mE8VVdaK4uk4UV9mJ4mo7UVx1J4qr70RxFZ4orsYTxVV5org6TxRX6Yniaj1RXLUniqv3RHEVnyiu5hPFVX2iuLpPFFf5ieJqP1Fc9Sdqpf5TondpQ/PKxphVpIVKUF2busx/TpO7L3d6Tm6ey+3JLygs8g4qLiktKx88ZOiw4SNGjho95qixFZU+fyAYGlc1vromHKmdcPSnPn3MxEmTp0ydduxxnzn+hM+eeNLJp0yfMXPW7Dlz580/dcFpCz+3aPHnlyw9fdkZZ37hrLPP+eK5X1p+XvT8uvrYipWrGr68urGpuaV1TVt7vGPtBes6L1z/lYu+ejH5GkmQr5MN5BJyKbmMXE6uIBvJN8iV5CpyNfkm+RbpIt2kh2wim8k15FpyHbme3EC+TW4kN5HvkJvJLeRW8l1yG9lCtpJtpJfcTraTHeR7ZCe5g+wid5Lvk7vI3eQespvsIfeSH5D7yP3kAfJDspf8iDxIfkweIj8hD5NHyKPkMfJT8jj5Gfk5+QX5JXmCEELJr8iT5CnyNHmGPEt+TZ4jz5MXyG/Ii+S35HdkH/k9eYm8TF4hfyCvktfI62Q/+SN5g/yJvEn+TN4ifyFvk3fIu+Sv5D3yN/J3coC8T/5BPiD/JAfJv8iH5CPyb/If8jHblWS7iWwXkO3esV03tlvGdrnY7hTbVWK7QWwXh+2+sF0TttvBdinY7gLbFWB38+wunN09s7tedrfK7jLZ3SG7q2N3Y+wuit39sLsWdrfB7hJYds+ycpZNsyyYZa8s62TZIsvyWHbGsiqWDbEshmUfLGtgqz1bpdnqylZFtpqxVYitHizqs2jNoiyLjiyqsWjEogib/WzWstnGZglTN1NjVxfTra5e/j5PZ2LbzJbm9vimRO+sBvbXeF7i9vnN8djKWNuWZZPNl7lcbf9cW/0TG7X9c2z1z92Y2NpX6r+b5q1MkbYviTVG4+z03PZY0/UEj72rkZO4o8+b+mg8OrOltTN1UvN4nzg485079TPTDd6q5lNnpRvJT922bKLmQ+ekG2nUtCmaT61ONyQGm9INscGWdENi8OJ0Q2KQJLiW2CTZwLUkRgnfkpm9hmtJzF7HtWRmb+daMrM7uJbE7E6uJTO7l2vJzD7ItSRmH+JaMrNPci2Z2ae5lsTss1xLZvY1riUzu59rScy+wbVkZj/gWjKzB7mWxOyHXEtili0zfFNimC1FfFNsmq1WfFNq3Mc3pcYDfFNmPMQ3pcYn802p8al8U2b8WL4pNT6Xb0qNz+ebMuML+KbU+Dl8U2r8XL4pM76cb0qNt/BNqfE1fFNmvJ1vSo1v4JtS45fyTZnxy/mm1PgVfDPDuC5LsJkzzet3nnFeYsvClrU9fFaRSr907Hx77Ghi54yG5mhbJ+u0qDW1JuZumV5f/8nppyxxFnbNb67/5K/9S8FYOplpPG0iZV5/znnaq1HID43mWBHvtu5aDbLnbpmW7pWMQ7E9drn9cSgWj4MXNA7F+nHwasfh8H9d/IBkHHHzLmcc8fBDkczsmxLblsZb2mLGo+gFjKLgZAv1J1vIWxF0K9J3K0pfo62ntUTruVMp4OGyEy2w5WbKnnJSOfl/wkkVrFWwVsFaOamcVMFaBWsVrNXsVU4qJ1WwVsFaBWsVYpSTKlirYK2CtQrWyknlpArWKlirYK1mr3JSOamCtQrWKlirEKOcVMFaBWsVrFWwVk4qJ1WwVsFaBWs1e5WTykkVrFWwVsFaOamcVMFaBWsVrNXsVU4qJ1WwVsFaBWs1e5WTKlirYK2CtQrWyknlpArWKlirYK1mr3JSOamCtQrWKlirEKOcVMFaBWsVrFWwVk4qJ7PopCbU5qWbbu0xV7JXX3nzZBhZ19/a5rkb9QSX3XeobGVXs7Xb+Dxc2vfFzMyo4m5Cz226Vdt/1rY5DbHGetbx6okP7152+Qv7zp81+h7Xe+v3P/qA/4KXS/cXuPOfH3b0+lu0HWenOh58+5krb8x5ZPeIV107Rh5zz0U3n/z++kXv9jQOf/ei2I133q/tOMfe9dCd8Vx7/d29S2LxjrZm47WyQLtWutLrTMayU5j+QMbfi9Ir1tZTO5pamYo6kpPl8JH8NCM5UbSd8429K9R6J5wgSaC2Q5FJB+/202Lt7aevijYbmilI9Pad1PwVKZe9NG9N6orOYSfTsLK5b/Zcszd6YTxWt7wj3rh8ZSy+LN7Q2BDvZCMXj62L78sZldi1MNbU0tbJ/GtjFtOK9giP5AuPFAiPFAqPFAmPeIVHBgmPFAuPlAiPlAqPlAmPlAuPDBYeGSI8MlR4ZJjwyHDhkRHCIyOFR8Q6GC08MkZ45CjhkbF9kutd2tDU2hg7FKj+2/6X+c4Ns49Mm2KLuXXZxEnHyf9q1++uLhUPVDzIbjwYKzxSoeLBkY8H/X+dYH9f5lOuJxTw70ey8X5HLqTYcsHgLTtF9ggePcFr6yRy+r3/kat/4RI3qMnEd4NwSygzyzSiuNKZZrobzbssBb+lH/B8Y3jq5Zmes8WbWQs7GoXcQlG3Uv1tap7pvW2JvlMpv8Job8FL+KZ1R4p5IQq6lTnx32Djr4w/Fa3/xbKTK3V2cqXczq12U6KE/5h8DFj45JbC1K22yI87kwqcvaYj2tiu7c95oNdhKc27PqXDc4UmOJHz8BL+GorGpfeQW33vgzO6vl7j2XFTyqvzbIy4m48x4qBRzAWN/m6DG2zSl6Q2J2xHxlK7O8M6Qpk9wjA9odzE/WFi9wfbMz5ETxhijzBUTxhqj1CgJwyzRyjUE4bbIxTpCSPsEQy+ZBhpjzBITxhlj1CsJ4y2RyjRE8bYI5TqCWPtEQZbSjbuFgWlCmfJRgXN25OEeyaI4H5nyYaf5t1nnmz4nSUbQSeLdUDfKch5oluPA3zTuiN+fjkQdBvnxP+QvtM4/lS0/of4piP/hetrlRP/DU66Sub/OL5px//Urrug03gn3huc8niZ91V804H3c0Wdqp14b3DK1TLvx/NNR9opgvrvt+m/Xzaxg84mdlCSaAdkzgy0Pc3aUSl53CJob10abv9xi6D4cYtK0OMWBteqUvL4SrXd5NS6cKslw1CTIYnDS/gr+qGs4W9tBKZr9KZrTOdMWLBw1/D+6xfuMM176f/blKng0y3NMZ9RKvaW0CnBRecslBpc9CDNeycJd7ltKDBgKoOgVLYVsksfFDoiOEvuWpUZnGU1zTvA5YSiB6Mqtd9/u+1GraSNOu1gVqe/67Y+1arNp5rR/OSuik6MYQsX2WDgfBZyyxrd1oyAEDQYoRqa97H51ozBNargPRPPrhr9YsVdZvHMC3Izj7mnie+pZujwtrwog3Ym2xB1FWZXtiEnsg0NqGyrRdDKAZZtpaFsXUPNZesTDH+lfPh91DXCwvCHBm74fU6G39fP4a+UDv84G3eplf0e/soMVRsNf4Abfm2A4HpXyQNEjUAhIblCmP0qCwrxDZxCakwVEnaSQkb0ncIZitcqJMJfddE0NApV5goJSxUSyhC+QVLrOoZTiP4DVdQ1KZWATccvIFMt6KNm4PRRYaqPkNGa7iCChKwuIOPBeU+oP3kPG6FT+AhyWAhz/5f5OJvzUZZkpf3XxkIuwPvlsVC07xuUa91PXQssaL1i4LTudxIL/f2MhUFpLKwR7txL96QdxsJgxhQ2ioVnmCdLwV4jdIV88IPUdVYKvVaYxRpsTFXYfUDE9sZUhXhjKgTamKqQJuGaq5ExSjrxcEdLQBsg/3XIcitbMa5Vdr8V4yiFht+KuVan4DttDTU3cbW7KhV8U3ildF+G+Uy/zAg7C9MsCKwx/3ou4iRQGkTXCO+X9tKE+eauQ8xPVqZFrZs1rhhez/CA3ZJ5+pNQhU02SWS5UcRZwlUsv7bWB9nKGlRrdQ2KGMivlroS5mtQrUDbEbm2GfwSc21PcKLtWn2nCbxf2utfyzetajvMdxqoBEqi7bCptmuluVCxXtu1FrQtWz3nOAqocmUXD5SyN1vIrpwpm+VX15kru9aJsg2W6VqZsjO+JnAQtYNCZYezGbWDktvgOdJsJWIn3Q0OeLobHPh0NwjbMkh12j6jMVq3ekbLusSexS3tsYb6luZJi2NtTR1x9smW5h7+0rv5kOW2EVUy7tTFKWaFeYoZtpkFOlyOuacZhuiYEb4pnIi1wiUmko30yXyJkd9uD5LebtfagErTp4iFZSskHa8y+WNZwvHyZ45XhO+UhcAZcjJeIWlKEOGvl2gLxyB0hgc8dIbFodMPCp1hJ1/Xye/GbITOMB86I25nyh4kV7boKyyDEfUP+ENJfvGI+kAj6pd+A9dfFQ+zIaSwZGJlTLrk8vacdHKW2JBjxPwGyjzxDRtn1c/KHvIL2BgWv7WHhPxH3J6Nh5KC/LHkOL5idyvf5KEktpX/Wgp+0IYCzR9K8ktlWyF/nhO+E/Zmdr+8dZgMOdiryNiHk92k+20MnJXNoojVW2q/wQhFqOuA+S11xPFDSRHJTUBYMvP85jMv4EyTAer6KLuaDDjZ3ww4SWEsf4lWbeOBAiuarLaqSZ/ho4zuAufbPCbPCwSp22th+AMDN/xB0+Gvln6tY10z1RlydvLEUcDZd/HVVr+LDxgP/3DnD5wF5MPvo+5RFoY/mM0HzqpBD5xVZ8hZMvyVNp43DFgY/qB0+AO8YcMJGjJ5nMhdlVwd3FPsrg6VZquDuya7q4P5PmrAyd5gUDqUldLt1/E2MhYrDyT6rD6Q6DeewZP1jxO5jwf7GOiPj0xFx1l6nMhn7n+lQMh+uZArqfvE7D4rVGkqZJ/R0Dj4qamPvyqy+0A7zwr5+y1kf8b8NBLyPAvrnJNnhRh6AfesUEYlrQcOVdJqamiv6yultSTaXN/S9Mkmabe43lG3vjqXjSHlLqT25tPHN23sVAbsFnWwva8VGPidyoB0Q0N8cxSQRmufjbHhv7vkRXJfutxaa0f7qtmtq2JNsbZoo1gigW7D0lI9Yk0ldsyLRVunt7VFO3lB5PZo6kBtO/QRjQRznSmwWClQKTAbChQ+bKH0p/R35PQ3V+lP6S+rK3CRUqBSYFYVWKgUqBSYVQUOVQpUCsyqAocpBSoFZlWBw5UClQKzqsARSoFKgVlV4EilQKXArCpwlFKgUmBWFThaKVApMKsKHKMUqBSYVQWWKgUqBWZVgflKgUqBWVXgWKVApcCsKnCwUqBSYFYVOEQpUCkwqwoss6VA2etw/AOuQP/Avw7HL/2Fiu53vZxrsp+h+GyNDUqB/iOvQN7hPWmH2em0tNXPidbFu7puEJo/SnhknPbI4Us0S9gjJOgxW3Ly9l/oLn7ZfMkNR+Rl3n3vZLXwgm/rP4Ky+P7VCu49ippPFUlChNfumxxthwivOEQUgUKEV3/VitJztr8vhC0XmTV8WzF33pphKOOPJd9Leaw+SnGfExanMXidc5npz/bKBT9jzHins/6XbOXUM9XKCzw9J4gMe5y9wNNDPSel4Gf2A55vDJ9uXmvS4+wFngYv/jZ/CaCBiksyLrMmK/DyTeuOeNLNYhvKNvffI50OJTr/PbKTK3F2ciXctNfOKy//MdGPcYv6+WPcweIf43pNf4xrcEJe08teKpWNW38dSvnrbn0sLa5DHv3qYxD2hKEiTxrKM7KZF6vS6Ux7rG9xibexfGZpZ3PdzGjdqtj85rXRxob6rq5NkvzGML3KKxf2cG2ylHiVG+YAvUti8Y62Zt2CmFo00x+eNkUstdcLF8/Ou/cqX2Lr6W3R1u6edP/khQIZeqrgrQNPPL6ya8ANHZ/Y/9Go8ON7zQ0djhOH/5yfnsGGeUkB/8ttbZ+89KqQ/Dj1xDMjgyftidXEJxU3DDsUaTu40h0yLHvTH8j4+6C0a8nJ1Kq5KoVpRnLyazsXGnvn1XonDD9JoLbDIJMOxZmrtdZMkW5MiqmnUSQvj938MXnFOgSj7ALp+ZKZjx796hu7LzTV8/8AGfoiAfVXAQA=",
       "custom_attributes": [
         "abi_utility"
       ],
-      "debug_symbols": "tZzdbhy3EoTfRde+mG7++1UCI1AcJRAgyIZiH+Ag8LuH3cNirWIMs9pd3Xg/RztVJIddQ3IU/333+8Nv3//89fH5jy9/3X385e+7314en54e//z16cvn+2+PX577f/37brM/cpC7j+HDXU7l7mPun7n/52afMj51fIbxGcdnGp95fJbxWcdn2z/L0CtDrwy90q+XzaBfIGrQBtT+VYkGCgiACEiADCiACmgD2gaAcoNyg3KDcjPlZJABBVABbYeybQABKMAuLwYFUAFtgGwAASggACIgAaAsUBYoC5QVygplhbJCWaGsUFYoK5QVygrlAOUA5QDlAOUA5QDl0JV1MyiACujK2ke+xA0gAAUEQAQkQAYUQAVAOUE5QTmZcjYIgAgw5WqQAWWAFUWwNlsVBDXoXw4maHWwQwH0ZgSbCVYKDlYLOwhAAQEQAaZs7SkZUAAVYMrWsLoBBGDKzSAAIiABMqAAKqArR+up1c4OAlBAV442CFY70bpstbNDBnTlaN2x2tmh7VCtdnYQgAICwJSzQQJkQBlgRRSrgQAUEAD9qiQGBVABvT2p96JayewgAAUEQAQkgCkHgwKogDbAKiVFAxO0Nlul7BABJlgMMqAAKqANsErZQQCmbD21StkhAhKgK+fNoAAqoCtna6FVyg4CUEAAREACZEABVACUM5QzlK2Ist1lK5lsg2Als4NdZf2yktlBADq+YyWzQwQkQAZA2Uom2yBYyThYyeRmIAAFBHwnAhIgAwoAylYyxWaUlcwOAlBAAERAAnTlYjPKSmaHrlys8VYyBs1KZgcBKCAAIiABMqAAKgDKAmUrolINFBAAXbluBgmQB1jtVDXoX67JIAISwL5sFlYpO1RAG2APlx0EoABTLgYRkAAZYMrNoALaACuZZk21ktlBAQEQAQmQAba8EYMKaAOsZHYw5WiggAAwZRsEK5kdMqAAKqAN8LWYgynbIPhqzCEAIsB07Db5CsyhDfA1mIM9oDdrq9XMoDTJnv6b3UUrm0F1UgNZ5QySSTrJPYJRnJQm5UmubL3zdZqTL9R2cmXrly/VdgqT4qQ0KU8qk9zDZoav2Ixk8zXbQCG6TXMMxEg0J1ufdjQrCY6FaGZSHdtEX+INFKISAzESzc2WRx0zkW6+5BtIN6Wb0k3ppnRTuvkCcCDdfBE4kG6+ENwx0C3QLdAt0C3QLdAtZCLdQiXSLW5EukW6RbpFukW6RbrFQqRbbBMT3ZIQ6ZboluiW6JboluiWOEsS3azSgXTLSqRbplumW6ZbplumW+YsKXSzxyqQbp4TA+lW6FboVuhW6FboVjlLKt08MAbSzSNjIN0q3SrdKt0q3RrdGmdJo5unyEC6eY4MpFujW6Nbm26ybUQhKnG6iWfJwOkmzBLZCi+rRLoxS4RZIswSYZaI0I1ZIkI3ZokI3ZglwiwRZokwS4RZIswSUboxS0TpxiwRpRuzRJglwiwRZokwS4RZIoFuzBIJdGOWSKQbs0SYJcIsEWaJMEuEWSKRbswSiXRjlkiiG7NEmCXCLBFmiTBLhFkiiW7MEsl0Y5ZIphuzRJglwiwRZokwS4RZIpluzBIpdGOWSKEbs0SYJcIsEWaJMEuEWSKVbswSqXRjlkilG7NEmCXCLBFmiTBLhFkijW7MEml0Y5ZIoxuzRJglwiwRZokyS5RZott0U2aJbtNNmSW6ZV5WiJVIN2aJMkuUWaJCN2aJCt2YJSp0Y5Yos0SZJcosUWaJMktU6cYs0T1L1NHc/KseGupN8NAYqETvRHaMxER02eJYiJXYJnpoDBSiEt3NW+ahMTARM9HdoqEHgTbHQDSF4H33IAjimImFWIltogfBQCHSLdPNg2BgImZiIbqb3woPgh09CIKPugfBQCUGovfNO+9BMDATC7ES20QPgoEy2+BBMDAQIzERM9HdkmMlupvPEg+CgUJUorv5JPAgGJiImViIldiAwYPA2xA8CAYqMRAjMRHdrTkWYiW2iR4EA4WoRHerjn7YvjkWYiX6kbvd4+AlP1CIfvAeHQMxEhMxEwuxEt3Ne+xJMFCISnQ3+fHjwx3egvz67eXhwV6CnLwW6S9Lvt6/PDx/u/v4/P3p6cPd/+6fvvuX/vp6/+yf3+5f+k97dx+ef++fXfCPx6cHox8fePV2fKklSRqXW1LolOjLxVcicizSz6KHRD/qnQJFXl2vx9dXS26/vh8isgFN39CLIrMXKeXDXsRjkT7B69DoszpRIr+WSIt29LcxczT7CxmK5LNb0R+BaEV/Eh22oixakbYNA9pZt4NW1GOJ/twqQ6E/rMqBwLINflQx2tDXFheMhGSORDy+H7KamXb0ss/Msp3MrO0N/UiF/ShHd9Rm8GFH+gk9OtKPwi8azFDZiKQHEquZ2V8GZs7Mw1ZIvrYf/9GIeNKIetSIuqpSe80zqrTW41nR3lejn9ljfvcz+pO5lePr2FvMTjvsQnbbaVc5VlmkZ5SMQY2WmdCI8fUs17CaYTrnVzhRCOe3grkV++LouBWr+dHXZWhGOKn4n9qx0Aj9je2cpLIdt6O8r0YPrznJOpfTUX39XNPFLOvn7xiRjvFYY9mS0GbV5fiqP69VwmKuhoyZ2kfn8M4sFSIKJqR2rLCYpXELCKC4nTyVfupHWD3Z0A9NelErtKIRfd1+PEcXGZbyhqmR+jQ57ke5wViUq8eiXD0Wq9nZT5aZgTkc9yQu5laK0EjpeHYuFRSzM4Xj2RlvMDvj1bMzhve9I6XMvOiH5+m4JysVlXlb+/HMpXODy+n+ImDRknZ9taXt+nu70jjv3i4Vrr63vfF19iPLRc+Ts8civa/GmeOZrh7P5aqnYXcQw2KlkNoNVj3rlWRgpWg5Xo/mhUrb4lxt9JdXUyPU9FpDV0/5MJdOXFn3M6fXCqu1aEtz59hOevIWjX4oDY1+Eq2XafCR0M9Cy4UacyXZj0vDZRqZe/F8koFv0wizLzlfphGa4LHQF5TtUKOsclTKNncJ28l+p7yhGfOop+NxM9abtzpPnNqmh8VSVtM0hjDrNoZ0XHIlXr95K+nazduyFWdu3kq5PsbKDTZepb2vxvmbtyrXb97WLTl381bDtVuvGq9/YK80zntgLxXOemDX7frFYK03GIt69VjUa8diObfO3no1vXbj1G6wcWpXb5xaeN/xPHfj1G6wcfqPO3vmxqndYOMk2w12TkuR8+7uWuLq23t+T+I7i5w7HFcn6XrNcN7WR7Z6g0XDeiHGyR6j1MOFmMi2eruRuHM52Rpr+dedWb1vijMAYj3ZMWztDb2JRdmbKhcuTiM3UV1RFmOyXJ2WzNXpakzS6mxuvrxK8dXy498i+QZZJFefd65H5HSlfLLa/nlEVvFcOOurcJ6UN+xgci5zByPh+Pbq8kR+27guZAnXN6xx83wN1vKrp9WFGuF4re2/onT1BNEbHEstRc6cZXr1wdT6AKTqPABpFx6iyJweHS87zOnmkRrtwnbwAEQuPQDxX70ZGunCwxzhIYqkC8eDiapS44UaHNN+unWhRq3UuHA8dB6AqObj8fBfXrjyRGj5kvTMDDpbY5VBy3dI52ZQ1Btk0ErkzAxaShxn0Kf+1/vPjy+v/h/+Hyb18nj/29PD+Osf358/n/z02/+/4if4NwC+vnz5/PD795cHU+I/BND/+KUvB+VDr/b26cNd6H+3rWoO2yf7RWX/cX8f3f/QTz+sPf8A",
+      "debug_symbols": "tZzbbhs5E4Tfxde+ILt5zKssgsBJnIUBwwm8yQ/8CPzuy+awWFIWw8ia+Cb6HEtVHE6zhgfBP28+33/88feHh6cvX/+5effXz5uPzw+Pjw9/f3j8+unu+8PXp/a/P2+c/ZNUbt7pbXvVm3e5vYb2Wu013bzz3iADCqAOiA7gAQJQQABEAJQjlCOUI5STKVuzkgcIQAGmHAxMORokQAaYsjQopmzXV03HLrAqIAAiIAEyoADqBtk5gAcIQAEBEAEJkAEFAGUPZQ9lD2UPZQ9lD2UPZQ9lD2UPZYGyQFmasoiBAgKgKUsySIAMKIA6QB3AAwSggACAskJZoaymXAzqgOAATVmdgQAU0D6u1mYrSFUDDxCAvdksrCA3iIAEyIACqAOsIDfwAAGYcjYIgAhIAFNutZqzfcp6PrdPBW8QABGQABlQAHVAcQAPEIApW2+UAIiABDBla08pgDqgOoAHCEABARABCWDK0aAA6gbFhswGppwNTLkaKCAAIiABMqAA6gAbMht4QFOOzkABARABTSeqQR1gA2QDDxCAAgIgAhIgA0w5GNQBNkA28AATTAYBEAEJYB+3jrJREO26bBRsIAAFBEAEJEAGFEAdYEMmWW/YkNlAAApoykkMIiABmnKyptqQ2aAOsCGzgQcIQAEBEAEJAOUE5QRlG0TJusWGTCoGCWCfsuuyIZOt8TZkOtiQ2cADBKCAAIBygbINmQ0KoA6wIbOBKXsDAZiydZQNmQ0iIAGacraysSGzQd2g2pDZwAMEoICweVUbMhskQAYUQB1gQyYHAw8w5WiggACIAFNOBhlQAHWADaINPEAAOrxsEG0QAQmQAQVgyq17qw2iDTxAAAoIgAgw5WxgOq02qo2mDZpOcQYCUEDAeyIgATKgAKBso6lY99po2sCUxUABARDxngTIgAKoAxKUbTQV6xYbTRsoIAAiIAEywJTtVtpo6pBN2RqfPUAACgiACEiADCiAOqBAuUC5QNlGXLXLsRG3QQQ05WqFbSNugzLAhlW1NtsgqlZRNog2yAB7s1nYIDLwzkbRID9JJumkMClOSpPyJJtZOdexTuzztoGeaD65k03MnHYsxDqxT88GeqIQlRiIkZiI3S10LMQ6UR2xu6WOQlRiIEZiImZiIdaJwRG7W++SIEQlBmJfNPSO3BYkG2ZiIdaJ28JkQ08UohIDsbv5jomYiWViX5j43n19aTJQiYEYiYmYiYVYJ2ZH7G6xoxCVGIjdondfzsRCrBNLF+tFXZQYiJGYiJlYiHVidURPNDfpXd1XXwMDMRLNzRYiDTOxEM1N7Ip9X4vZ+qGhJ/YVo++oxECMxETMxEI0N1tItNvviHTra7SBdPN083TzdPN083TrobCh0K2HwkC69VAYSDehm9BN6CZ0E7r1UBhItx4KA+nWQ2Eg3ZRuSjelm9It0K2HwkC69VAYSLceCgPpFugW6BboFukW6RZZJZFuPRQG0q2HwkC6RbpFuiW6JboluiVWSaJbj4qBdOtRMZBuiW6ZbplumW6ZbplVkunWU2Mg3XpqDKRboVuhW6FboVuhW2GVFLr1LBlIt54lG1a6VbpVulW6VbpVulVWSaVbz5KB002YJeKmmzBLhFkizBJhlgizRJgl4qabMEvE041ZIp5uzBJhlgizRJglwiwRZol4ujFLROjGLBGhG7NEmCXCLBFmiTBLhFkiSjdmiSjdmCWidGOWCLNEmCXCLBFmiTBLJNCNWSKBbswSCXRjlgizRJglwiwRZokwSyTSjVkikW7MEol0Y5YIs0SYJcIsEWaJMEsk0Y1ZIoluzBJJdGOWCLNEmCXCLBFmiTBLJNONWSKZbswSyXRjlgizRJglwiwRZokwS6TQjVkihW7MEil0Y5YIs0SYJcIsEWaJMEuk0o1ZIpVuzBJ1002ZJcosUWaJMkuUWaLMEnXTTZkl6ujGLFFPN2aJMkuUWaLMEmWWKLNEPd2YJbplSexoe76uU5ctHSMxETOxEOvELTQ29EQhKpFuSjel2xYPNvXUHgShX08PgoGBGImJmImFWCf2IBjoiXSLdIt0i3TrQWCbsg0zsRDrxB4EAz1RiErsYqFjFwsvL7c3OAH68P35/t4OgE6OhNpB0be75/un7zfvnn48Pt7e/O/u8Ud/0z/f7p766/e75/bbdq/vnz631yb45eHx3ujllp92+x+1oI7j4xbEMiXazPxMxO+LtE34IdF2vadAlrPPy/7ni50f9c+3/VQ2oOorriL7eRUxpt2rCPsirWDQka1KTtqRziXiwY5IRztieQ222z6uIaXdayiLvmwnRAV92Q6JyhRJr5BIlRIl70j4xS3VIqhLbVvp1zUisxHV7zViUZht/OKGaDv63O3OtYY7rhHL1GgHZrsaq8rI85ZoO3fab0Y6Xhq/0bisNsrR2vhdKy4pDllVaK7zprSTod0eFf+2Gm3vFqnTNm1PAjzFcw1d9IdNKNEfNkPbV1nUWGjNHiKhLQinRmhhdqaxiNC2AYB2RD1RCJe3Qjz6I7SZ7X4r8uqBknFfbCqy3468urfBz3vr3X476ttqtP2OMPs0tWo/UTl/sOiqyuKs1IbhOo3kMPTbsUk6rqGLa1lUSEwOHRJb5+xrLOpUFJMFibJbH0uFghCTkvYrbHlntYZ5Z8NZffxyJWX5gJoPhrB/JSuFk0lH3VUI7mhvLhUu6k11x6si6OHr0DetinYAglbYCUjev5LFEzIGaMS4XxVLBUFVRF1URTncm+WNe7POBVI74Ym7vRn98dqKcrQ3lgp/oDdyDuyNuuiN1TNe5krLNkyvaklwAVPR4E6m1b+2Y62hcWqE/XESD9doPF6jyxlPxWQ26GKWkPwfmPGsZ5ExcxZZ9+eiaaFSXZgzjXZwOTW0nM/N02q1Ezit5iqlddO5wqpGa5zLlJrdVRrtQAIa7RRCrtQoMjXqle3o333YNNoh6pXtmFONplGvbIfkqXGSpK/TCHO4tFO/KzW0UuPK/vD2DaqhUcKVGuzTViBXapRCjSv7Q+Y2RztR2u+PvFrt1Mw89ry3/hXN4IyhnddceSlxLpjakY5ep5FYpunaMk0ssZSu02jbEiiPNs/fH3JF3/S2NIm5Bq15vxnLPYo6d5lrlbD7XCirPZuoMXJvIO8/XUo+vkdRytE9imUrLtyjqO74E7u64/sLVd5W4/I9ihqO71EsNS7co7hYY7FHUfPxFUM9PDeth+em6zt76R6Fd/7oFoN3h9dPa4nLukOP31bv4vEriW96Yy/eZmhTzqO7BN7V491R37g7Ltwn8KuTnovrwx/ehVpL/IEOuXSrwC9Pai7cK1g15dJ1vvfleKceTtP1vOGylb6XP7DUX0/Ggp9L/RiC252M+dWOgZbIhfrJLk5r4S8iq+2PWWfh5Dix1c1rroYPqRidXjlBDcWzT6ou+mQ5Q50ryzZDXfXJKlbDPKmN4eyJ+atI/QNhpIe39tc9cjpbPplx/6dHdJVHmVVfPOskv2IVk8qc19WThP/P7dXl1pTj10xONnTK5V/yqEm4INv/NoDXdbHOMjsv1l9O0TWv7i1Xyhp2j/LX7YiFq6l4siJ7lUiaVdZ4/4sJ4fA3Tn7XDs8ESBJ3RJY31/Pm1sX3NFaHSNnh1uaTrUsLk5f37ce7Tw/PZ3974MWknh/uPj7ejx+//Hj6dPLb7///ht/gbxd8e/766f7zj+d7U+IfMGj//NVqpt62Pbb8/vZG28+pDaqkvv1kX4S0X6f261zev1h7/gU=",
       "is_unconstrained": true,
       "name": "offchain_receive"
     },
     {
       "abi": {
-        "error_types": {
-          "10835969307644359280": {
-            "error_kind": "fmtstring",
-            "item_types": [],
-            "length": 40
-          }
-        },
+        "error_types": {},
         "parameters": [
           {
             "name": "scope",
@@ -8059,7 +8125,7 @@
       "custom_attributes": [
         "abi_utility"
       ],
-      "debug_symbols": "dZHdCoMwDIXfJddeNHObP68yhlSNUihVajsY0ndfKjr1wpsm6cn5CMkMLdW+r5TphgnK1wy1VVqrvtJDI50aDP/OIOKDCGUaQgKbVDlLFJVDLxNGack4KI3XOoGP1H5pmkZpluikZVUkQKblyMBOaYpZSHa3uLaiKB6P1c55cfsjUKQnCF5DsieuiCzfARme/Ldrf47p6s/vuA/Aw4Q3l7JR9rTDEFFWyVrTWnbeNAfVfcdN2W4w2qGh1luKpEVj9g8=",
+      "debug_symbols": "dZHdCoMwDIXfJddetE7nz6uMIVWjFEqV2g6G9N2XSp164U2T9OR8hGSFHls3NlIP0wL1a4XWSKXk2KipE1ZOmn5XYOHhHOqH9wnsUmMNYlBOvUSYhUFtodZOqQQ+QrmtaZmF3qIVhlSWAOqeIgEHqTBkPjnc7N7KWZXn0U55lf4RnGUXCL+HFE8eEUV5AIr04k/v/SV/RH+Z8WOAijb0plJ00lx26APKSNEqjOXgdHdS7Xfelf0Gs5k67J3BQNo0Yv8A",
       "is_unconstrained": true,
       "name": "sync_state"
     },
@@ -8092,7 +8158,7 @@
     }
   ],
   "name": "SchnorrInitializerlessAccount",
-  "noir_version": "1.0.0-beta.22+c57152f91260ecdb9faad4efc20abb14b6d2ece7",
+  "noir_version": "1.0.0-beta.25+75061fab15986eedee4e7d9104ff87dd9fa4ca10",
   "outputs": {
     "globals": {},
     "structs": {
@@ -8456,5 +8522,5 @@
     }
   },
   "transpiled": true,
-  "aztec_version": "0.0.1-commit.b8a057fa"
+  "aztec_version": "0.0.1-commit.be03c316"
 }