{ "file_map": { "0": { "function_locations": [ { "name": "aes128_encrypt", "start": 351 }, { "name": "aes128_encrypt_padded_input", "start": 824 }, { "name": "tests::encrypt", "start": 921 } ], "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(\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(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" }, "102": { "function_locations": [ { "name": "derive_ecdh_shared_secret", "start": 993 }, { "name": "compute_app_siloed_shared_secret", "start": 1348 }, { "name": "derive_shared_secret_subkey", "start": 1739 }, { "name": "derive_shared_secret_field_mask", "start": 2057 }, { "name": "test_consistency_with_typescript", "start": 2199 }, { "name": "test_shared_secret_computation_in_both_directions", "start": 3283 }, { "name": "test_shared_secret_computation_from_address_in_both_directions", "start": 3822 }, { "name": "test_app_siloed_shared_secret_differs_per_contract", "start": 5055 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/keys/ecdh_shared_secret.nr", "source": "use crate::protocol::{\n address::aztec_address::AztecAddress,\n constants::{DOM_SEP__APP_SILOED_ECDH_SHARED_SECRET, DOM_SEP__ECDH_FIELD_MASK, DOM_SEP__ECDH_SUBKEY},\n hash::poseidon2_hash_with_separator,\n point::EmbeddedCurvePoint,\n scalar::Scalar,\n traits::{FromField, ToField},\n};\nuse std::{embedded_curve_ops::multi_scalar_mul, ops::Neg};\n\n/// Computes a standard ECDH shared secret: secret * public_key = shared_secret.\n///\n/// The input secret is known only to one party. The output shared secret can be derived given knowledge of\n/// `public_key`'s key-pair and the public ephemeral secret, using this same function (with reversed inputs).\n///\n/// E.g.: Epk = esk * G // ephemeral key-pair\n/// Pk = sk * G // recipient key-pair\n/// Shared secret S = esk * Pk = sk * Epk\n///\n/// See also: https://en.wikipedia.org/wiki/Elliptic-curve_Diffie%E2%80%93Hellman\npub fn derive_ecdh_shared_secret(secret: Scalar, public_key: EmbeddedCurvePoint) -> EmbeddedCurvePoint {\n multi_scalar_mul([public_key], [secret])\n}\n\n/// Computes an app-siloed shared secret from a raw ECDH shared secret point and a contract address.\n///\n/// `s_app = h(DOM_SEP__APP_SILOED_ECDH_SHARED_SECRET, S.x, S.y, contract_address)`\npub fn compute_app_siloed_shared_secret(shared_secret: EmbeddedCurvePoint, contract_address: AztecAddress) -> Field {\n poseidon2_hash_with_separator(\n [shared_secret.x, shared_secret.y, contract_address.to_field()],\n DOM_SEP__APP_SILOED_ECDH_SHARED_SECRET,\n )\n}\n\n/// Derives an indexed subkey from an app-siloed shared secret, used for AES key/IV derivation.\n///\n/// `s_i = h(DOM_SEP__ECDH_SUBKEY + i, s_app)`\npub(crate) fn derive_shared_secret_subkey(s_app: Field, index: u32) -> Field {\n poseidon2_hash_with_separator([s_app], DOM_SEP__ECDH_SUBKEY + index)\n}\n\n/// Derives an indexed field mask from an app-siloed shared secret, used for masking ciphertext fields.\n///\n/// `m_i = h(DOM_SEP__ECDH_FIELD_MASK + i, s_app)`\npub(crate) fn derive_shared_secret_field_mask(s_app: Field, index: u32) -> Field {\n poseidon2_hash_with_separator([s_app], DOM_SEP__ECDH_FIELD_MASK + index)\n}\n\n#[test]\nunconstrained fn test_consistency_with_typescript() {\n let secret = Scalar {\n lo: 0x00000000000000000000000000000000649e7ca01d9de27b21624098b897babd,\n hi: 0x0000000000000000000000000000000023b3127c127b1f29a7adff5cccf8fb06,\n };\n let point = EmbeddedCurvePoint {\n x: 0x2688431c705a5ff3e6c6f2573c9e3ba1c1026d2251d0dbbf2d810aa53fd1d186,\n y: 0x1e96887b117afca01c00468264f4f80b5bb16d94c1808a448595f115556e5c8e,\n };\n\n let shared_secret = derive_ecdh_shared_secret(secret, point);\n\n // This is just pasted from a test run. The original typescript code from which this could be generated seems to\n // have been deleted by someone, and soon the typescript code for encryption and decryption won't be needed, so\n // this will have to do.\n let hard_coded_shared_secret = EmbeddedCurvePoint {\n x: 0x15d55a5b3b2caa6a6207f313f05c5113deba5da9927d6421bcaa164822b911bc,\n y: 0x0974c3d0825031ae933243d653ebb1a0b08b90ee7f228f94c5c74739ea3c871e,\n };\n assert_eq(shared_secret, hard_coded_shared_secret);\n}\n\n#[test]\nunconstrained fn test_shared_secret_computation_in_both_directions() {\n let secret_a = Scalar { lo: 0x1234, hi: 0x2345 };\n let secret_b = Scalar { lo: 0x3456, hi: 0x4567 };\n\n let pk_a = std::embedded_curve_ops::fixed_base_scalar_mul(secret_a);\n let pk_b = std::embedded_curve_ops::fixed_base_scalar_mul(secret_b);\n\n let shared_secret = derive_ecdh_shared_secret(secret_a, pk_b);\n let shared_secret_alt = derive_ecdh_shared_secret(secret_b, pk_a);\n\n assert_eq(shared_secret, shared_secret_alt);\n}\n\n#[test]\nunconstrained fn test_shared_secret_computation_from_address_in_both_directions() {\n let secret_a = Scalar { lo: 0x1234, hi: 0x2345 };\n let secret_b = Scalar { lo: 0x3456, hi: 0x4567 };\n\n let mut pk_a = std::embedded_curve_ops::fixed_base_scalar_mul(secret_a);\n let mut pk_b = std::embedded_curve_ops::fixed_base_scalar_mul(secret_b);\n\n let address_b = AztecAddress::from_field(pk_b.x);\n\n // We were lazy in deriving the secret keys, and didn't check the resulting y-coordinates of the pk_a or pk_b to be\n // less than half the field modulus. If needed, we negate the pk's so that they yield valid address points. (We\n // could also have negated the secrets, but there's no negate method for EmbeddedCurvesScalar).\n pk_a = if (AztecAddress::from_field(pk_a.x).to_address_point().unwrap().inner == pk_a) {\n pk_a\n } else {\n pk_a.neg()\n };\n pk_b = if (address_b.to_address_point().unwrap().inner == pk_b) {\n pk_b\n } else {\n pk_b.neg()\n };\n\n let shared_secret = derive_ecdh_shared_secret(secret_a, address_b.to_address_point().unwrap().inner);\n let shared_secret_alt = derive_ecdh_shared_secret(secret_b, pk_a);\n\n assert_eq(shared_secret, shared_secret_alt);\n}\n\n#[test]\nunconstrained fn test_app_siloed_shared_secret_differs_per_contract() {\n let secret_a = Scalar { lo: 0x1234, hi: 0x2345 };\n let pk_b = std::embedded_curve_ops::fixed_base_scalar_mul(Scalar { lo: 0x3456, hi: 0x4567 });\n\n let shared_secret = derive_ecdh_shared_secret(secret_a, pk_b);\n\n let contract_a = AztecAddress::from_field(0xAAAA);\n let contract_b = AztecAddress::from_field(0xBBBB);\n\n let s_app_a = compute_app_siloed_shared_secret(shared_secret, contract_a);\n let s_app_b = compute_app_siloed_shared_secret(shared_secret, contract_b);\n\n assert(s_app_a != s_app_b, \"app-siloed secrets must differ for different contracts\");\n}\n" }, "103": { "function_locations": [ { "name": "generate_ephemeral_key_pair", "start": 326 }, { "name": "generate_positive_ephemeral_key_pair", "start": 1731 }, { "name": "generate_secret_key_for_positive_public_key", "start": 2755 }, { "name": "test::generate_positive_ephemeral_key_pair_produces_positive_keys", "start": 3518 }, { "name": "test::generate_positive_ephemeral_key_pair_rejects_zero_randomness", "start": 4000 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/keys/ephemeral.nr", "source": "use std::embedded_curve_ops::{EmbeddedCurveScalar, fixed_base_scalar_mul};\n\nuse crate::protocol::{point::EmbeddedCurvePoint, scalar::Scalar};\n\nuse crate::{oracle::random::random, utils::point::get_sign_of_point};\n\n/// Generates a random ephemeral key pair.\npub fn generate_ephemeral_key_pair() -> (Scalar, EmbeddedCurvePoint) {\n // @todo Need to draw randomness from the full domain of Fq not only Fr\n\n // Safety: we use the randomness to preserve the privacy of both the sender and recipient via encryption, so a\n // malicious sender could use non-random values to reveal the plaintext. But they already know it themselves\n // anyway, and so the recipient already trusts them to not disclose this information. We can therefore assume that\n // the sender will cooperate in the random value generation.\n let randomness = unsafe { random() };\n\n // TODO(#12757): compute the key pair without constraining eph_sk twice (once in from_field, once in the black box\n // called by fixed_base_scalar_mul).\n let eph_sk = EmbeddedCurveScalar::from_field(randomness);\n let eph_pk = fixed_base_scalar_mul(eph_sk);\n\n (eph_sk, eph_pk)\n}\n\n/// Generates a random ephemeral key pair with a positive y-coordinate.\n///\n/// Unlike [`generate_ephemeral_key_pair`], the y-coordinate of the public key is guaranteed to be a positive value\n/// (i.e. [`crate::utils::point::get_sign_of_point`] will return `true`).\n///\n/// This is useful as it means it is possible to just broadcast the x-coordinate as a single `Field` and then\n/// reconstruct the original public key using [`crate::utils::point::point_from_x_coord_and_sign`] with `sign: true`.\npub fn generate_positive_ephemeral_key_pair() -> (Scalar, EmbeddedCurvePoint) {\n // Safety: we use the randomness to preserve the privacy of both the sender and recipient via encryption, so a\n // malicious sender could use non-random values to reveal the plaintext. But they already know it themselves\n // anyway, and so the recipient already trusts them to not disclose this information. We can therefore assume that\n // the sender will cooperate in the random value generation.\n let eph_sk = unsafe { generate_secret_key_for_positive_public_key() };\n let eph_pk = fixed_base_scalar_mul(eph_sk);\n\n // The point at infinity has x = 0, which is not a valid x-coordinate on the curve, so the recipient could\n // never reconstruct the key from it and the message would be undecryptable.\n assert(!eph_pk.is_infinite(), \"Ephemeral public key is the point at infinity\");\n assert(get_sign_of_point(eph_pk), \"Got an ephemeral public key with a negative y coordinate\");\n\n (eph_sk, eph_pk)\n}\n\nunconstrained fn generate_secret_key_for_positive_public_key() -> EmbeddedCurveScalar {\n let mut sk = std::mem::zeroed();\n\n loop {\n // We simply produce random secret keys until we find one that has results in a positive public key. About half\n // of all public keys fulfill this condition, so this should only take a few iterations at most.\n\n // @todo Need to draw randomness from the full domain of Fq not only Fr\n sk = EmbeddedCurveScalar::from_field(random());\n let pk = fixed_base_scalar_mul(sk);\n if get_sign_of_point(pk) {\n break;\n }\n }\n\n sk\n}\n\nmod test {\n use crate::utils::point::get_sign_of_point;\n use super::generate_positive_ephemeral_key_pair;\n use std::test::OracleMock;\n\n #[test]\n fn generate_positive_ephemeral_key_pair_produces_positive_keys() {\n // About half of random points are negative, so testing just a couple gives us high confidence that\n // `generate_positive_ephemeral_key_pair` is indeed producing positive ones.\n for _ in 0..10 {\n let (_, pk) = generate_positive_ephemeral_key_pair();\n assert(get_sign_of_point(pk));\n }\n }\n\n #[test(should_fail_with = \"point at infinity\")]\n unconstrained fn generate_positive_ephemeral_key_pair_rejects_zero_randomness() {\n // Making the randomness oracle return 0 emulates a malicious sender substituting eph_sk = 0.\n let _ = OracleMock::mock(\"aztec_misc_getRandomField\").returns(0);\n let _ = generate_positive_ephemeral_key_pair();\n }\n}\n" }, "104": { "function_locations": [ { "name": "get_nhk_app", "start": 380 }, { "name": "get_ovsk_app", "start": 787 }, { "name": "get_public_keys", "start": 1263 }, { "name": "try_get_public_keys", "start": 1792 }, { "name": "test::get_public_keys_fails_with_bad_hint", "start": 2270 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/keys/getters/mod.nr", "source": "use crate::{\n keys::constants::{NULLIFIER_INDEX, OUTGOING_INDEX},\n oracle::{\n key_validation_request::get_key_validation_request,\n keys::{get_public_keys_and_partial_address, try_get_public_keys_and_partial_address},\n },\n};\nuse crate::protocol::{address::AztecAddress, public_keys::PublicKeys};\n\npub unconstrained fn get_nhk_app(npk_m_hash: Field) -> Field {\n get_key_validation_request(npk_m_hash, NULLIFIER_INDEX).sk_app\n}\n\n// A helper function that gets app-siloed outgoing viewing key for a given `ovpk_m_hash`. This function is used in\n// unconstrained contexts only - when computing unconstrained note logs. The safe alternative is `request_ovsk_app`\n// function defined on `PrivateContext`.\npub unconstrained fn get_ovsk_app(ovpk_m_hash: Field) -> Field {\n get_key_validation_request(ovpk_m_hash, OUTGOING_INDEX).sk_app\n}\n\n// Returns all public keys for a given account, applying proper constraints to the context. We read all keys at once\n// since the constraints for reading them all are actually fewer than if we read them one at a time - any read keys\n// that are not required by the caller can simply be discarded.\n// Fails if the public keys are not registered\npub fn get_public_keys(account: AztecAddress) -> PublicKeys {\n // Safety: Public keys are constrained by showing their inclusion in the address's preimage.\n let (public_keys, partial_address) = unsafe { get_public_keys_and_partial_address(account) };\n assert_eq(account, AztecAddress::compute(public_keys, partial_address), \"Invalid public keys hint for address\");\n\n public_keys\n}\n\n/// Returns all public keys for a given account, or `None` if the public keys are not registered in the PXE.\npub unconstrained fn try_get_public_keys(account: AztecAddress) -> Option {\n try_get_public_keys_and_partial_address(account).map(|(public_keys, _)| public_keys)\n}\n\nmod test {\n use super::get_public_keys;\n\n use crate::protocol::{address::PartialAddress, point::EmbeddedCurvePoint, public_keys::{IvpkM, PublicKeys}};\n use crate::test::helpers::test_environment::TestEnvironment;\n use std::test::OracleMock;\n\n #[test(should_fail_with = \"Invalid public keys hint for address\")]\n unconstrained fn get_public_keys_fails_with_bad_hint() {\n let mut env = TestEnvironment::new();\n let account = env.create_light_account();\n\n // Instead of querying for some unknown account, which would result in the oracle erroring out, we mock a bad\n // oracle response to check that the circuit properly checks the address derivation. The values below are\n // arbitrary; `ivpk_m` does not have to be on-curve to make this test fail.\n let public_keys = PublicKeys {\n npk_m_hash: 0x292364b852c6c6f01472951e76a39cbcf074591fd0e063a81965e7b51ad868a5,\n ivpk_m: IvpkM {\n inner: EmbeddedCurvePoint {\n x: 0x173c5229a00c5425255680dd6edc27e278c48883991f348fe6985de43b4ec25f,\n y: 0x1698608e23b5f6c2f43c49a559108bb64e2247b8fc2da842296a416817f40b7f,\n },\n },\n ovpk_m_hash: 0x1bad2f7d1ad960a1bd0fe4d2c8d17f5ab4a86ef8b103e0a9e7f67ec0d3b4795e,\n tpk_m_hash: 0x05e3bd9cfe6b47daa139613619cf7d7fd8bb0112b6f2908caa6d9b536ed948ed,\n mspk_m_hash: 0x1a4f87ed20a8ce7e8d2b2c731f9b3d39f37e2d4ab2c6db66f7c8e3e9f1b6b39d,\n fbpk_m_hash: 0x0fbb9c2bf6cb4d4a1d4ee2f8b3a2c5e3d4b9c1a8e5f2d6b7c8e3f4a5b6c7d8e9,\n };\n let partial_address = PartialAddress::from_field(\n 0x236703e2cb00a182e024e98e9f759231b556d25ff19f98896cebb69e9e678cc9,\n );\n\n let _ = OracleMock::mock(\"aztec_utl_getPublicKeysAndPartialAddress\").returns(Option::some((\n public_keys, partial_address,\n )));\n let _ = get_public_keys(account);\n }\n}\n" }, "107": { "function_locations": [ { "name": "log_prefix", "start": 525 }, { "name": "aztecnr_fatal_log", "start": 717 }, { "name": "aztecnr_error_log", "start": 943 }, { "name": "aztecnr_warn_log", "start": 1168 }, { "name": "aztecnr_info_log", "start": 1392 }, { "name": "aztecnr_verbose_log", "start": 1619 }, { "name": "aztecnr_debug_log", "start": 1847 }, { "name": "aztecnr_trace_log", "start": 2073 }, { "name": "aztecnr_fatal_log_format", "start": 2367 }, { "name": "aztecnr_error_log_format", "start": 2622 }, { "name": "aztecnr_warn_log_format", "start": 2876 }, { "name": "aztecnr_info_log_format", "start": 3129 }, { "name": "aztecnr_verbose_log_format", "start": 3385 }, { "name": "aztecnr_debug_log_format", "start": 3642 }, { "name": "aztecnr_trace_log_format", "start": 3897 }, { "name": "resolve_fn", "start": 4151 } ], "path": "/home/nventuro/pkg-1/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(msg: str) -> 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(msg: str) -> 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(msg: str) -> 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(msg: str) -> 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(msg: str) -> 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(msg: str) -> 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(msg: str) -> 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(msg: str) -> 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(msg: str) -> 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(msg: str) -> 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(msg: str) -> 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(msg: str) -> 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(msg: str) -> 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(msg: str) -> 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(msg: str) -> 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" }, "109": { "function_locations": [ { "name": "generate_contract_library_methods_compute_note_hash_and_nullifier", "start": 534 }, { "name": "generate_contract_library_method_compute_note_hash", "start": 2449 }, { "name": "generate_contract_library_method_compute_note_nullifier", "start": 7724 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/macros/aztec/compute_note_hash_and_nullifier.nr", "source": "use crate::logging;\nuse crate::macros::{notes::NOTES, utils::get_trait_impl_method};\n\n/// Generates two contract library methods called `_compute_note_hash` and `_compute_note_nullifier`, plus a\n/// (deprecated) wrapper called `_compute_note_hash_and_nullifier`, which are used for note discovery (i.e. these are\n/// of the `aztec::messages::discovery::ComputeNoteHash` and `aztec::messages::discovery::ComputeNoteNullifier` types).\npub(crate) comptime fn generate_contract_library_methods_compute_note_hash_and_nullifier() -> Quoted {\n let compute_note_hash = generate_contract_library_method_compute_note_hash();\n let compute_note_nullifier = generate_contract_library_method_compute_note_nullifier();\n\n quote {\n $compute_note_hash\n $compute_note_nullifier\n\n /// Unpacks an array into a note corresponding to `note_type_id` and then computes its note hash (non-siloed) and inner nullifier (non-siloed) assuming the note has been inserted into the note hash tree with `note_nonce`.\n ///\n /// This function is automatically injected by the `#[aztec]` macro.\n #[contract_library_method]\n #[allow(dead_code)]\n unconstrained fn _compute_note_hash_and_nullifier(\n packed_note: BoundedVec,\n owner: aztec::protocol::address::AztecAddress,\n storage_slot: Field,\n note_type_id: Field,\n contract_address: aztec::protocol::address::AztecAddress,\n randomness: Field,\n note_nonce: Field,\n ) -> Option {\n _compute_note_hash(packed_note, owner, storage_slot, note_type_id, contract_address, randomness).map(|note_hash| {\n\n let siloed_note_hash = aztec::protocol::hash::compute_siloed_note_hash(contract_address, note_hash);\n let unique_note_hash = aztec::protocol::hash::compute_unique_note_hash(note_nonce, siloed_note_hash);\n \n let inner_nullifier = _compute_note_nullifier(unique_note_hash, packed_note, owner, storage_slot, note_type_id, contract_address, randomness);\n\n aztec::messages::discovery::NoteHashAndNullifier {\n note_hash,\n inner_nullifier,\n }\n })\n }\n }\n}\n\ncomptime fn generate_contract_library_method_compute_note_hash() -> Quoted {\n if NOTES.len() == 0 {\n // Contracts with no notes still implement this function to avoid having special-casing, the implementation\n // simply throws immediately.\n quote {\n /// This contract does not use private notes, so this function should never be called as it will unconditionally fail.\n ///\n /// This function is automatically injected by the `#[aztec]` macro.\n #[contract_library_method]\n unconstrained fn _compute_note_hash(\n _packed_note: BoundedVec,\n _owner: aztec::protocol::address::AztecAddress,\n _storage_slot: Field,\n _note_type_id: Field,\n _contract_address: aztec::protocol::address::AztecAddress,\n _randomness: Field,\n ) -> Option {\n panic(f\"This contract does not use private notes\")\n }\n }\n } else {\n // Contracts that do define notes produce an if-else chain where `note_type_id` is matched against the\n // `get_note_type_id()` function of each note type that we know of, in order to identify the note type. Once we\n // know it we call the correct `unpack` method from the `Packable` trait to obtain the underlying\n // note type, and compute the note hash (non-siloed).\n\n // We resolve the log format calls here so that the resulting Quoted values can be spliced into the quote\n // block below.\n let warn_length_mismatch = logging::aztecnr_warn_log_format(\n \"Packed note length mismatch for note type id {0}: expected {1} fields, got {2}. Skipping note.\",\n );\n let warn_unknown_note_type = logging::aztecnr_warn_log_format(\"Unknown note type id {0}. Skipping note.\");\n\n let mut if_note_type_id_match_statements_list = @[];\n for i in 0..NOTES.len() {\n let typ = NOTES.get(i);\n\n let get_note_type_id = get_trait_impl_method(\n typ,\n quote { crate::note::note_interface::NoteType },\n quote { get_id },\n );\n let unpack = get_trait_impl_method(\n typ,\n quote { crate::protocol::traits::Packable },\n quote { unpack },\n );\n\n let compute_note_hash = get_trait_impl_method(\n typ,\n quote { crate::note::note_interface::NoteHash },\n quote { compute_note_hash },\n );\n\n let if_or_else_if = if i == 0 {\n quote { if }\n } else {\n quote { else if }\n };\n\n if_note_type_id_match_statements_list = if_note_type_id_match_statements_list.push_back(\n quote {\n $if_or_else_if note_type_id == $get_note_type_id() {\n // As an extra safety check we make sure that the packed_note BoundedVec has the expected\n // length, since we're about to interpret its raw storage as a fixed-size array by calling the\n // unpack function on it.\n let expected_len = <$typ as $crate::protocol::traits::Packable>::N;\n let actual_len = packed_note.len();\n if actual_len != expected_len {\n $warn_length_mismatch([note_type_id, expected_len as Field, actual_len as Field]);\n Option::none()\n } else {\n let note = $unpack(aztec::utils::array::subarray(packed_note.storage(), 0));\n\n Option::some($compute_note_hash(note, owner, storage_slot, randomness))\n }\n }\n },\n );\n }\n\n let if_note_type_id_match_statements = if_note_type_id_match_statements_list.join(quote {});\n\n quote {\n /// Unpacks an array into a note corresponding to `note_type_id` and then computes its note hash\n /// (non-siloed).\n ///\n /// The signature of this function notably matches the `aztec::messages::discovery::ComputeNoteHash` type,\n /// and so it can be used to call functions from that module such as `do_sync_state` and\n /// `process_private_note_msg`.\n ///\n /// This function is automatically injected by the `#[aztec]` macro.\n #[contract_library_method]\n unconstrained fn _compute_note_hash(\n packed_note: BoundedVec,\n owner: aztec::protocol::address::AztecAddress,\n storage_slot: Field,\n note_type_id: Field,\n _contract_address: aztec::protocol::address::AztecAddress,\n randomness: Field,\n ) -> Option {\n $if_note_type_id_match_statements\n else {\n $warn_unknown_note_type([note_type_id]);\n Option::none()\n }\n }\n }\n }\n}\n\ncomptime fn generate_contract_library_method_compute_note_nullifier() -> Quoted {\n if NOTES.len() == 0 {\n // Contracts with no notes still implement this function to avoid having special-casing, the implementation\n // simply throws immediately.\n quote {\n /// This contract does not use private notes, so this function should never be called as it will unconditionally fail.\n ///\n /// This function is automatically injected by the `#[aztec]` macro.\n #[contract_library_method]\n unconstrained fn _compute_note_nullifier(\n _unique_note_hash: Field,\n _packed_note: BoundedVec,\n _owner: aztec::protocol::address::AztecAddress,\n _storage_slot: Field,\n _note_type_id: Field,\n _contract_address: aztec::protocol::address::AztecAddress,\n _randomness: Field,\n ) -> Option {\n panic(f\"This contract does not use private notes\")\n }\n }\n } else {\n // Contracts that do define notes produce an if-else chain where `note_type_id` is matched against the\n // `get_note_type_id()` function of each note type that we know of, in order to identify the note type. Once we\n // know it we call the correct `unpack` method from the `Packable` trait to obtain the underlying\n // note type, and compute the inner nullifier (non-siloed).\n\n // We resolve the log format calls here so that the resulting Quoted values can be spliced into the quote\n // block below.\n let warn_length_mismatch = logging::aztecnr_warn_log_format(\n \"Packed note length mismatch for note type id {0}: expected {1} fields, got {2}. Skipping note.\",\n );\n let warn_unknown_note_type = logging::aztecnr_warn_log_format(\"Unknown note type id {0}. Skipping note.\");\n\n let mut if_note_type_id_match_statements_list = @[];\n for i in 0..NOTES.len() {\n let typ = NOTES.get(i);\n\n let get_note_type_id = get_trait_impl_method(\n typ,\n quote { crate::note::note_interface::NoteType },\n quote { get_id },\n );\n let unpack = get_trait_impl_method(\n typ,\n quote { crate::protocol::traits::Packable },\n quote { unpack },\n );\n\n let compute_nullifier_unconstrained = get_trait_impl_method(\n typ,\n quote { crate::note::note_interface::NoteHash },\n quote { compute_nullifier_unconstrained },\n );\n\n let if_or_else_if = if i == 0 {\n quote { if }\n } else {\n quote { else if }\n };\n\n if_note_type_id_match_statements_list = if_note_type_id_match_statements_list.push_back(\n quote {\n $if_or_else_if note_type_id == $get_note_type_id() {\n // As an extra safety check we make sure that the packed_note BoundedVec has the expected\n // length, since we're about to interpret its raw storage as a fixed-size array by calling the\n // unpack function on it.\n let expected_len = <$typ as $crate::protocol::traits::Packable>::N;\n let actual_len = packed_note.len();\n if actual_len != expected_len {\n $warn_length_mismatch([note_type_id, expected_len as Field, actual_len as Field]);\n Option::none()\n } else {\n let note = $unpack(aztec::utils::array::subarray(packed_note.storage(), 0));\n\n // The message discovery process finds settled notes, that is, notes that were created in\n // prior transactions and are therefore already part of the note hash tree. The note hash\n // for nullification is hence the unique note hash.\n $compute_nullifier_unconstrained(note, owner, unique_note_hash)\n }\n }\n },\n );\n }\n\n let if_note_type_id_match_statements = if_note_type_id_match_statements_list.join(quote {});\n\n quote {\n /// Computes a note's inner nullifier (non-siloed) given its unique note hash, preimage and extra data.\n ///\n /// The signature of this function notably matches the `aztec::messages::discovery::ComputeNoteNullifier`\n /// type, and so it can be used to call functions from that module such as `do_sync_state` and\n /// `process_private_note_msg`.\n ///\n /// This function is automatically injected by the `#[aztec]` macro.\n #[contract_library_method]\n unconstrained fn _compute_note_nullifier(\n unique_note_hash: Field,\n packed_note: BoundedVec,\n owner: aztec::protocol::address::AztecAddress,\n _storage_slot: Field,\n note_type_id: Field,\n _contract_address: aztec::protocol::address::AztecAddress,\n _randomness: Field,\n ) -> Option {\n $if_note_type_id_match_statements\n else {\n $warn_unknown_note_type([note_type_id]);\n Option::none()\n }\n }\n }\n }\n}\n" }, "110": { "function_locations": [ { "name": "AztecConfig::new", "start": 1918 }, { "name": "AztecConfig::custom_message_handler", "start": 2455 }, { "name": "AztecConfig::custom_sync_state", "start": 3150 }, { "name": "aztec", "start": 4051 }, { "name": "generate_contract_interface", "start": 7875 }, { "name": "generate_sync_state", "start": 9789 }, { "name": "generate_offchain_receive", "start": 11291 }, { "name": "check_each_fn_macroified", "start": 12880 } ], "path": "/home/nventuro/pkg-1/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,\n custom_sync_state: Option,\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::::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,\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" }, "113": { "function_locations": [ { "name": "generate_private_internal_function_call", "start": 541 }, { "name": "generate_public_internal_function_call", "start": 1393 }, { "name": "generate_call_internal_struct", "start": 2455 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/macros/calls_generation/internal_functions.nr", "source": "//! Generates functionality such that the following API for performing calls to `#[internal(\"...\")]` functions is\n//! available:\n//!\n//! ```noir\n//! self.internal.my_internal_function(...)\n//! ```\n//!\n//! Injected into the contract by the `#[aztec]` macro.\n\nuse crate::macros::internals_functions_generation::internal_functions_registry;\n\n/// Generates a method for the `CallInternal` struct that makes a call to the `#[internal(\"private\")]` function `f`.\ncomptime fn generate_private_internal_function_call(f: FunctionDefinition) -> Quoted {\n let original_function_name = f.name();\n let original_return_type = f.return_type();\n let original_params =\n f.parameters().map(|(param_name, param_type)| quote { $param_name: $param_type }).join(quote {, });\n\n let params_at_callsite = f.parameters().map(|(param_name, _)| quote { $param_name }).join(quote {, });\n\n let fn_name = f\"__aztec_nr_internals__{original_function_name}\".quoted_contents();\n\n quote {\n pub fn $original_function_name(self: CallInternal<&mut aztec::context::PrivateContext>, $original_params) -> $original_return_type {\n $fn_name(self.context, $params_at_callsite)\n }\n }\n}\n\n/// Generates a method for the `CallInternal` struct that makes a call to the `#[internal(\"public\")]` function `f`.\ncomptime fn generate_public_internal_function_call(f: FunctionDefinition) -> Quoted {\n let original_function_name = f.name();\n let original_return_type = f.return_type();\n let original_params =\n f.parameters().map(|(param_name, param_type)| quote { $param_name: $param_type }).join(quote {, });\n\n let params_at_callsite = f.parameters().map(|(param_name, _)| quote { $param_name }).join(quote {, });\n\n let fn_name = f\"__aztec_nr_internals__{original_function_name}\".quoted_contents();\n\n quote {\n pub unconstrained fn $original_function_name(self: CallInternal, $original_params) -> $original_return_type {\n $fn_name(self.context, $params_at_callsite)\n }\n }\n}\n\n/// Generates a struct which is injected into contracts via the `#[aztec]` macro and which is then instantiated in the\n/// external and internal functions' bodies and provided into the `ContractSelf` struct. This then allows for the\n/// following API:\n///\n/// ```noir\n/// self.internal.my_internal_function(arg1, arg2);\n/// ```\npub(crate) comptime fn generate_call_internal_struct(m: Module) -> Quoted {\n let private_internal_functions = internal_functions_registry::get_private_functions(m);\n let public_internal_functions = internal_functions_registry::get_public_functions(m);\n\n let private_internal_functions_calls =\n private_internal_functions.map(|function| generate_private_internal_function_call(function)).join(quote {});\n let public_internal_functions_calls =\n public_internal_functions.map(|function| generate_public_internal_function_call(function)).join(quote {});\n\n quote {\n pub struct CallInternal {\n pub context: Context,\n }\n\n impl CallInternal<&mut aztec::context::PrivateContext> {\n $private_internal_functions_calls\n }\n\n impl CallInternal {\n $public_internal_functions_calls\n }\n }\n}\n" }, "125": { "function_locations": [ { "name": "generate_private_external", "start": 579 } ], "path": "/home/nventuro/pkg-1/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 = 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" }, "127": { "function_locations": [ { "name": "generate_utility_self_creator", "start": 775 }, { "name": "generate_utility_external", "start": 1935 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/macros/internals_functions_generation/external/utility.nr", "source": "use crate::macros::utils::{fn_has_noinitcheck, module_has_initializer, module_has_storage};\n\n/// Emits a per-contract helper that builds the `self` value used by every utility external function.\n///\n/// Each utility external function calls this helper instead of inlining the construction, so the\n/// `UtilityContext::new`/`Storage::init`/`CallSelfUtility`/`ContractSelfUtility::new` chain does not appear duplicated\n/// in every utility function body. We let Noir's inliner decide whether to inline the helper at each call site rather\n/// than forcing it via macro expansion.\n///\n/// Unlike the public counterpart, this helper takes no arguments because `UtilityContext::new` does not need calldata.\npub(crate) comptime fn generate_utility_self_creator(m: Module) -> Quoted {\n let (storage_type, storage_init) = if module_has_storage(m) {\n (quote { Storage }, quote { let storage = Storage::init(context); })\n } else {\n // Contract does not have Storage defined, so we set storage to the unit type `()`. ContractSelfUtility requires\n // a storage struct in its constructor. Using an Option type would lead to worse developer experience and higher\n // constraint counts so we use the unit type `()` instead.\n (quote { () }, quote { let storage = (); })\n };\n\n quote {\n #[contract_library_method]\n unconstrained fn __aztec_nr_internals__create_utility_self() -> aztec::contract_self::ContractSelfUtility<$storage_type, CallSelfUtility> {\n let context = aztec::context::UtilityContext::new();\n $storage_init\n let self_address = context.this_address();\n let call_self = CallSelfUtility { address: self_address };\n aztec::contract_self::ContractSelfUtility::new(context, storage, call_self)\n }\n }\n}\n\npub(crate) comptime fn generate_utility_external(f: FunctionDefinition) -> Quoted {\n let module_has_initializer = module_has_initializer(f.module());\n\n let contract_self_creation = quote {\n #[allow(unused_variables)]\n let mut self = __aztec_nr_internals__create_utility_self();\n };\n\n // Initialization checks are not included in contracts that don't have initializers.\n let init_check = if module_has_initializer & !fn_has_noinitcheck(f) {\n quote {\n aztec::macros::functions::initialization_utils::assert_is_initialized_utility(\n self.context,\n );\n }\n } else {\n quote {}\n };\n\n // A quote to be injected at the beginning of the function body.\n let to_prepend = quote {\n aztec::oracle::version::assert_compatible_oracle_version();\n $contract_self_creation\n $init_check\n };\n\n let original_function_name = f.name();\n let fn_name = f\"__aztec_nr_internals__{original_function_name}\".quoted_contents();\n let body = f.body();\n let params = f.parameters().map(|(param_name, param_type)| quote { $param_name: $param_type }).join(quote {, });\n let return_type = f.return_type();\n\n quote {\n #[aztec::macros::internals_functions_generation::abi_attributes::abi_utility]\n unconstrained fn $fn_name($params) -> pub $return_type {\n $to_prepend\n $body\n }\n }\n}\n" }, "133": { "function_locations": [ { "name": "get_next_note_type_id", "start": 528 }, { "name": "generate_note_type_impl", "start": 1152 }, { "name": "generate_note_hash_trait_impl", "start": 3273 }, { "name": "generate_note_properties", "start": 6162 }, { "name": "note", "start": 8145 }, { "name": "custom_note", "start": 9996 }, { "name": "assert_has_packable", "start": 10772 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/macros/notes.nr", "source": "use crate::note::note_getter_options::PropertySelector;\nuse std::{collections::bounded_vec::BoundedVec, meta::type_of};\n\n/// Maximum number of note types within 1 contract.\ncomptime global MAX_NOTE_TYPES: u32 = 128;\n\n/// A BoundedVec containing all the note types within this contract.\npub comptime mut global NOTES: BoundedVec = BoundedVec::new();\n\ncomptime mut global NOTE_TYPE_ID_COUNTER: u32 = 0;\n\n/// The note type id is set by enumerating the note types.\ncomptime fn get_next_note_type_id() -> Field {\n // We assert that the note type id fits within 7 bits\n assert(\n NOTE_TYPE_ID_COUNTER < MAX_NOTE_TYPES,\n f\"A contract can contain at most {MAX_NOTE_TYPES} different note types\",\n );\n\n let note_type_id = NOTE_TYPE_ID_COUNTER as Field;\n NOTE_TYPE_ID_COUNTER += 1;\n note_type_id\n}\n\n/// Generates default `NoteType` implementation for a given note struct `s` and returns it as a quote.\n///\n/// ```noir\n/// impl NoteType for NoteStruct {\n/// fn get_id() -> Field {\n/// ...\n/// }\n/// }\n/// ```\ncomptime fn generate_note_type_impl(s: TypeDefinition, note_type_id: Field) -> Quoted {\n let name = s.name();\n let typ = s.as_type();\n let note_type_name: str<_> = f\"{name}\".as_quoted_str!();\n let max_note_packed_len = crate::messages::logs::note::MAX_NOTE_PACKED_LEN;\n\n quote {\n impl aztec::note::note_interface::NoteType for $name {\n fn get_id() -> Field {\n // This static assertion ensures the note's packed length doesn't exceed the maximum allowed size.\n // While this check would ideally live in the Packable trait implementation, we place it here since\n // this function is always generated by our macros and the Packable trait implementation is not.\n //\n // Note: We set the note type name and max packed length as local variables because injecting them\n // directly into the error message doesn't work.\n let note_type_name = $note_type_name;\n let max_note_packed_len: u32 = $max_note_packed_len; // Casting to u32 to avoid the value to be printed in hex.\n let note_packed_len = <$typ as aztec::protocol::traits::Packable>::N;\n std::static_assert(note_packed_len <= $max_note_packed_len, f\"{note_type_name} has a packed length of {note_packed_len} fields, which exceeds the maximum allowed length of {max_note_packed_len} fields. See https://docs.aztec.network/errors/4\");\n\n $note_type_id\n }\n }\n }\n}\n\n/// Generates default `NoteHash` trait implementation for a given note struct `s` and returns it as a quote.\n///\n/// # Generated Implementation\n///\n/// ```noir\n/// impl NoteHash for NoteStruct {\n/// fn compute_note_hash(self, owner: AztecAddress, storage_slot: Field, randomness: Field) -> Field { ... }\n///\n/// fn compute_nullifier(self, context: &mut PrivateContext, note_hash_for_nullification: Field, owner:\n/// AztecAddress) -> Field { ... }\n///\n/// unconstrained fn compute_nullifier_unconstrained(note_hash_for_nullification: Field, owner: AztecAddress) ->\n/// Field { ... }\n/// }\n/// ```\ncomptime fn generate_note_hash_trait_impl(s: TypeDefinition) -> Quoted {\n let name = s.name();\n\n quote {\n impl aztec::note::note_interface::NoteHash for $name {\n fn compute_note_hash(self, owner: aztec::protocol::address::AztecAddress, storage_slot: Field, randomness: Field) -> Field {\n let data = aztec::protocol::traits::Packable::pack(self).concat([aztec::protocol::traits::ToField::to_field(owner), randomness]);\n aztec::note::utils::compute_note_hash(storage_slot, data)\n }\n\n fn compute_nullifier(\n self,\n context: &mut aztec::context::PrivateContext,\n owner: aztec::protocol::address::AztecAddress,\n note_hash_for_nullification: Field,\n ) -> Field {\n let owner_npk_m_hash = aztec::keys::getters::get_public_keys(owner).npk_m_hash;\n let secret = context.request_nhk_app(owner_npk_m_hash);\n aztec::note::utils::compute_note_nullifier(note_hash_for_nullification, [secret])\n }\n\n unconstrained fn compute_nullifier_unconstrained(\n self,\n owner: aztec::protocol::address::AztecAddress,\n note_hash_for_nullification: Field,\n ) -> Option {\n // Note: In the current PXE implementation, if public keys are available then the nullifier\n // hiding key (nhk) is also available, so we don't need to handle get_nhk_app potentially\n // failing. The Option is only needed for the try_get_public_keys call.\n aztec::keys::getters::try_get_public_keys(owner).map(|public_keys| {\n let owner_npk_m_hash = public_keys.npk_m_hash;\n let secret = aztec::keys::getters::get_nhk_app(owner_npk_m_hash);\n aztec::note::utils::compute_note_nullifier(note_hash_for_nullification, [secret])\n })\n }\n }\n }\n}\n\n/// Generates note properties struct for a given note struct `s`.\n///\n/// Example:\n/// ```\n/// struct TokenNoteProperties {\n/// amount: aztec::note::note_getter_options::PropertySelector,\n/// npk_m_hash: aztec::note::note_getter_options::PropertySelector\n/// randomness: aztec::note::note_getter_options::PropertySelector\n/// }\n///\n/// impl aztec::note::note_interface::NoteProperties for TokenNote {\n/// fn properties() -> TokenNoteProperties {\n/// Self {\n/// amount: aztec::note::note_getter_options::PropertySelector { index: 0, offset: 0, length: 32 },\n/// npk_m_hash: aztec::note::note_getter_options::PropertySelector { index: 1, offset: 0, length: 32 },\n/// randomness: aztec::note::note_getter_options::PropertySelector { index: 2, offset: 0, length: 32 }\n/// }\n/// }\n/// }\n/// ```\ncomptime fn generate_note_properties(s: TypeDefinition) -> Quoted {\n let name = s.name();\n\n let struct_name = f\"{name}Properties\".quoted_contents();\n\n let property_selector_type = type_of(PropertySelector { index: 0, offset: 0, length: 0 });\n\n let note_fields = s.fields_as_written();\n\n let properties_types = note_fields.map(|(name, _, _)| quote { pub $name: $property_selector_type }).join(quote {,});\n\n // TODO #8694: Properly handle non-field types https://github.com/AztecProtocol/aztec-packages/issues/8694\n let mut properties_list = @[];\n for i in 0..note_fields.len() {\n let (name, _, _) = note_fields[i];\n let i = i as u8;\n properties_list = properties_list.push_back(\n quote { $name: aztec::note::note_getter_options::PropertySelector { index: $i, offset: 0, length: 32 } },\n );\n }\n\n let properties = properties_list.join(quote {,});\n\n quote {\n pub struct $struct_name {\n $properties_types\n }\n\n impl aztec::note::note_interface::NoteProperties<$struct_name> for $name {\n fn properties() -> $struct_name {\n $struct_name {\n $properties\n }\n }\n }\n }\n}\n\n/// Generates the core note functionality for a struct:\n///\n/// - NoteTypeProperties: Defines the structure and properties of note fields\n/// - NoteType trait implementation: Provides the note type ID\n/// - NoteHash trait implementation: Handles note hash and nullifier computation\n///\n/// # Requirements\n///\n/// The note struct must:\n/// - Implement the `Packable` trait\n/// - Not exceed `MAX_NOTE_PACKED_LEN` when packed\n///\n/// # Registration\n///\n/// Registers the note in the global `NOTES` BoundedVec to enable note processing functionality.\n///\n/// # Generated Code\n///\n/// For detailed documentation on the generated implementations, see:\n/// - `generate_note_properties()`\n/// - `generate_note_type_impl()`\n/// - `generate_note_hash_trait_impl()`\npub comptime fn note(s: TypeDefinition) -> Quoted {\n assert_has_packable(s);\n\n // We register the note in the global `NOTES` BoundedVec because we need that information inside the #[aztec] macro\n // to generate note processing functionality.\n NOTES.push(s.as_type());\n\n let note_properties = generate_note_properties(s);\n let note_type_id = get_next_note_type_id();\n let note_type_impl = generate_note_type_impl(s, note_type_id);\n let note_hash_impl = generate_note_hash_trait_impl(s);\n\n quote {\n $note_properties\n $note_type_impl\n $note_hash_impl\n }\n}\n\n/// Generates code for a custom note implementation that requires specialized note hash or nullifier computation.\n///\n/// # Generated Code\n/// - NoteTypeProperties: Defines the structure and properties of note fields\n/// - NoteType trait implementation: Provides the note type ID\n///\n/// # Requirements\n///\n/// The note struct must:\n/// - Implement the `Packable` trait\n/// - Not exceed `MAX_NOTE_PACKED_LEN` when packed\n///\n/// # Registration\n///\n/// Registers the note in the global `NOTES` BoundedVec to enable note processing functionality.\n///\n/// # Use Cases\n///\n/// Use this macro when implementing a note that needs custom:\n/// - Note hash computation logic\n/// - Nullifier computation logic\n///\n/// The macro omits generating default NoteHash trait implementation, allowing you to provide your own.\n///\n/// # Example\n/// ```\n/// #[custom_note]\n/// struct CustomNote {\n/// value: Field,\n/// metadata: Field\n/// }\n///\n/// impl NoteHash for CustomNote {\n/// // Custom note hash computation...\n/// fn compute_note_hash(...) -> Field { ... }\n///\n/// // Custom nullifier computation...\n/// fn compute_nullifier(...) -> Field { ... }\n/// fn compute_nullifier_unconstrained(...) -> Field { ... }\n/// }\n/// ```\npub comptime fn custom_note(s: TypeDefinition) -> Quoted {\n assert_has_packable(s);\n\n // We register the note in the global `NOTES` BoundedVec because we need that information inside the #[aztec] macro\n // to generate note processing functionality.\n NOTES.push(s.as_type());\n\n let note_type_id = get_next_note_type_id();\n let note_properties = generate_note_properties(s);\n let note_type_impl = generate_note_type_impl(s, note_type_id);\n\n quote {\n $note_properties\n $note_type_impl\n }\n}\n\n/// Asserts that the given note implements the [`Packable`](crate::protocol::traits::Packable) trait.\n///\n/// We require that notes have the `Packable` trait implemented because it is used when emitting a note in a log or as\n/// an offchain message.\ncomptime fn assert_has_packable(note: TypeDefinition) {\n let packable_constraint = quote { crate::protocol::traits::Packable }.as_trait_constraint();\n let note_name = note.name();\n\n assert(\n note.as_type().implements(packable_constraint),\n f\"{note_name} does not implement Packable trait. Either implement it manually or place #[derive(Packable)] on the note struct before #[note] macro invocation.\",\n );\n}\n" }, "14": { "function_locations": [ { "name": "EmbeddedCurvePoint::new", "start": 510 }, { "name": "EmbeddedCurvePoint::double", "start": 705 }, { "name": "EmbeddedCurvePoint::point_at_infinity", "start": 877 }, { "name": "EmbeddedCurvePoint::generator", "start": 1018 }, { "name": "EmbeddedCurvePoint::is_infinite", "start": 1329 }, { "name": "::add", "start": 1576 }, { "name": "::sub", "start": 1793 }, { "name": "::neg", "start": 2051 }, { "name": "::eq", "start": 2245 }, { "name": "::hash", "start": 2415 }, { "name": "EmbeddedCurveScalar::new", "start": 2969 }, { "name": "EmbeddedCurveScalar::from_field", "start": 3154 }, { "name": "::eq", "start": 3342 }, { "name": "::hash", "start": 3525 }, { "name": "multi_scalar_mul", "start": 4201 }, { "name": "fixed_base_scalar_mul", "start": 4416 }, { "name": "multi_scalar_mul_array_return", "start": 4699 }, { "name": "embedded_curve_add", "start": 5154 }, { "name": "embedded_curve_add_array_return", "start": 5439 }, { "name": "tests::hash_point", "start": 5888 }, { "name": "tests::hash_scalar", "start": 6064 }, { "name": "tests::point_new_sets_coordinates", "start": 6236 }, { "name": "tests::point_at_infinity_is_origin", "start": 6395 }, { "name": "tests::generator_has_documented_coordinates", "start": 6579 }, { "name": "tests::is_infinite_only_true_for_origin", "start": 6803 }, { "name": "tests::points_with_same_coords_are_equal", "start": 7126 }, { "name": "tests::points_with_different_coords_are_unequal", "start": 7318 }, { "name": "tests::neg_negates_y_coordinate", "start": 7580 }, { "name": "tests::neg_is_involution", "start": 7768 }, { "name": "tests::add_with_point_at_infinity_is_identity", "start": 7913 }, { "name": "tests::add_of_two_infinities_is_infinity", "start": 8147 }, { "name": "tests::add_with_negation_is_point_at_infinity", "start": 8318 }, { "name": "tests::add_is_commutative", "start": 8458 }, { "name": "tests::add_is_associative", "start": 8620 }, { "name": "tests::sub_of_a_point_with_itself_is_infinity", "start": 8841 }, { "name": "tests::sub_with_point_at_infinity_is_identity", "start": 8998 }, { "name": "tests::sub_inverts_add", "start": 9183 }, { "name": "tests::double_equals_self_plus_self", "start": 9394 }, { "name": "tests::double_of_point_at_infinity_is_infinity", "start": 9551 }, { "name": "tests::embedded_curve_add_matches_add_operator", "start": 9701 }, { "name": "tests::point_hash_is_consistent_for_equal_points", "start": 9905 }, { "name": "tests::point_hash_differs_for_distinct_points", "start": 10117 }, { "name": "tests::scalar_new_sets_limbs", "start": 10515 }, { "name": "tests::scalars_with_same_limbs_are_equal", "start": 10683 }, { "name": "tests::scalars_with_different_limbs_are_unequal", "start": 10877 }, { "name": "tests::scalar_from_field_decomposes_zero", "start": 11098 }, { "name": "tests::scalar_from_field_decomposes_small_value", "start": 11256 }, { "name": "tests::scalar_from_field_decomposes_two_pow_128", "start": 11455 }, { "name": "tests::scalar_hash_is_consistent_for_equal_scalars", "start": 11645 }, { "name": "tests::scalar_hash_differs_for_distinct_scalars", "start": 11865 }, { "name": "tests::msm_with_scalar_one_returns_point", "start": 12288 }, { "name": "tests::msm_with_scalar_zero_returns_infinity", "start": 12507 }, { "name": "tests::msm_with_scalar_two_doubles_point", "start": 12732 }, { "name": "tests::msm_sums_terms", "start": 12937 }, { "name": "tests::msm_with_opposite_terms_cancels", "start": 13167 }, { "name": "tests::msm_skips_point_at_infinity", "start": 13393 }, { "name": "tests::msm_skips_zero_scalar", "start": 13665 }, { "name": "tests::fixed_base_scalar_mul_with_one_returns_generator", "start": 13955 }, { "name": "tests::fixed_base_scalar_mul_with_zero_returns_infinity", "start": 14164 }, { "name": "tests::fixed_base_scalar_mul_matches_msm_on_generator", "start": 14351 } ], "path": "std/embedded_curve_ops.nr", "source": "use crate::cmp::Eq;\nuse crate::hash::Hash;\nuse crate::ops::arith::{Add, Neg, Sub};\n\n/// A point on the embedded elliptic curve\n/// By definition, the base field of the embedded curve is the scalar field of the proof system curve, i.e the Noir Field.\n/// x and y denotes the Weierstrass coordinates of the point.\npub struct EmbeddedCurvePoint {\n pub x: Field,\n pub y: Field,\n}\n\nimpl EmbeddedCurvePoint {\n /// Create a new point using the provided (x, y) pair\n pub fn new(x: Field, y: Field) -> Self {\n EmbeddedCurvePoint { x, y }\n }\n\n /// Elliptic curve point doubling operation\n /// returns the doubled point of a point P, i.e P+P\n pub fn double(self) -> EmbeddedCurvePoint {\n embedded_curve_add(self, self)\n }\n\n /// Returns the null element of the curve; 'the point at infinity'\n pub fn point_at_infinity() -> EmbeddedCurvePoint {\n EmbeddedCurvePoint { x: 0, y: 0 }\n }\n\n /// Returns the curve's generator point.\n pub fn generator() -> EmbeddedCurvePoint {\n // Generator point for the grumpkin curve (y^2 = x^3 - 17)\n EmbeddedCurvePoint {\n x: 1,\n y: 17631683881184975370165255887551781615748388533673675138860, // sqrt(-16)\n }\n }\n\n /// True if this point is the point at infinity\n pub fn is_infinite(self) -> bool {\n (self.x == 0) & (self.y == 0)\n }\n}\n\nimpl Add for EmbeddedCurvePoint {\n /// Adds two points P+Q, using the curve addition formula, and also handles point at infinity\n fn add(self, other: EmbeddedCurvePoint) -> EmbeddedCurvePoint {\n embedded_curve_add(self, other)\n }\n}\n\nimpl Sub for EmbeddedCurvePoint {\n /// Points subtraction operation, using addition and negation\n fn sub(self, other: EmbeddedCurvePoint) -> EmbeddedCurvePoint {\n self + other.neg()\n }\n}\n\nimpl Neg for EmbeddedCurvePoint {\n /// Negates a point P, i.e returns -P, by negating the y coordinate.\n /// If the point is at infinity, then the result is also at infinity.\n fn neg(self) -> EmbeddedCurvePoint {\n EmbeddedCurvePoint { x: self.x, y: -self.y }\n }\n}\n\nimpl Eq for EmbeddedCurvePoint {\n /// Checks whether two points are equal\n fn eq(self: Self, b: EmbeddedCurvePoint) -> bool {\n (self.x == b.x) & (self.y == b.y)\n }\n}\n\nimpl Hash for EmbeddedCurvePoint {\n fn hash(self, state: &mut H)\n where\n H: crate::hash::Hasher,\n {\n self.x.hash(state);\n self.y.hash(state);\n }\n}\n\n/// Scalar for the embedded curve represented as low and high limbs\n/// By definition, the scalar field of the embedded curve is base field of the proving system curve.\n/// It may not fit into a Field element, so it is represented with two Field elements; its low and high limbs.\npub struct EmbeddedCurveScalar {\n pub lo: Field,\n pub hi: Field,\n}\n\nimpl EmbeddedCurveScalar {\n /// Create a new scalar using the provided (lo, hi) pair\n pub fn new(lo: Field, hi: Field) -> Self {\n EmbeddedCurveScalar { lo, hi }\n }\n\n /// Create a scalar from the given bn254 field value\n #[field(bn254)]\n pub fn from_field(scalar: Field) -> EmbeddedCurveScalar {\n let (a, b) = crate::field::bn254::decompose(scalar);\n EmbeddedCurveScalar { lo: a, hi: b }\n }\n}\n\nimpl Eq for EmbeddedCurveScalar {\n fn eq(self, other: Self) -> bool {\n (other.hi == self.hi) & (other.lo == self.lo)\n }\n}\n\nimpl Hash for EmbeddedCurveScalar {\n fn hash(self, state: &mut H)\n where\n H: crate::hash::Hasher,\n {\n self.hi.hash(state);\n self.lo.hash(state);\n }\n}\n\n/// Computes a multi scalar multiplication over the embedded curve.\n/// For bn254, We have Grumpkin.\n///\n/// The embedded curve being used is decided by the\n/// underlying proof system.\n///\n/// IMPORTANT: Prefer `multi_scalar_mul()` over repeated `embedded_curve_add()`\n/// for adding multiple points. This is significantly more efficient.\n/// For adding exactly 2 points, use `embedded_curve_add()` directly.\n// docs:start:multi_scalar_mul\npub fn multi_scalar_mul(\n points: [EmbeddedCurvePoint; N],\n scalars: [EmbeddedCurveScalar; N],\n) -> EmbeddedCurvePoint\n// docs:end:multi_scalar_mul\n{\n multi_scalar_mul_array_return(points, scalars, true)[0]\n}\n\n// docs:start:fixed_base_scalar_mul\npub fn fixed_base_scalar_mul(scalar: EmbeddedCurveScalar) -> EmbeddedCurvePoint\n// docs:end:fixed_base_scalar_mul\n{\n multi_scalar_mul([EmbeddedCurvePoint::generator()], [scalar])\n}\n\n#[foreign(multi_scalar_mul)]\npub(crate) fn multi_scalar_mul_array_return(\n points: [EmbeddedCurvePoint; N],\n scalars: [EmbeddedCurveScalar; N],\n predicate: bool,\n) -> [EmbeddedCurvePoint; 1] {}\n\n/// Elliptic curve addition\n/// IMPORTANT: this function is expected to perform a full addition in order to handle all corner cases:\n/// - points on the curve\n/// - point doubling\n/// - point at infinity\n/// As a result, you may not get optimal performance, depending on the assumptions of your inputs.\n// docs:start:embedded_curve_add\npub fn embedded_curve_add(\n point1: EmbeddedCurvePoint,\n point2: EmbeddedCurvePoint,\n) -> EmbeddedCurvePoint {\n // docs:end:embedded_curve_add\n embedded_curve_add_array_return(point1, point2, true)[0]\n}\n\n#[foreign(embedded_curve_add)]\nfn embedded_curve_add_array_return(\n _point1: EmbeddedCurvePoint,\n _point2: EmbeddedCurvePoint,\n _predicate: bool,\n) -> [EmbeddedCurvePoint; 1] {}\n\nmod tests {\n // TODO: Allow imports from \"super\"\n use crate::default::Default;\n use crate::embedded_curve_ops::{\n embedded_curve_add, EmbeddedCurvePoint, EmbeddedCurveScalar, fixed_base_scalar_mul,\n multi_scalar_mul,\n };\n use crate::field::bn254::TWO_POW_128;\n use crate::hash::Hash;\n use crate::hash::Hasher;\n use crate::hash::poseidon2::Poseidon2Hasher;\n\n fn hash_point(p: EmbeddedCurvePoint) -> Field {\n let mut hasher: Poseidon2Hasher = Default::default();\n p.hash(&mut hasher);\n hasher.finish()\n }\n\n fn hash_scalar(s: EmbeddedCurveScalar) -> Field {\n let mut hasher: Poseidon2Hasher = Default::default();\n s.hash(&mut hasher);\n hasher.finish()\n }\n\n #[test]\n fn point_new_sets_coordinates() {\n let p = EmbeddedCurvePoint::new(3, 5);\n assert_eq(p.x, 3);\n assert_eq(p.y, 5);\n }\n\n #[test]\n fn point_at_infinity_is_origin() {\n let inf = EmbeddedCurvePoint::point_at_infinity();\n assert_eq(inf.x, 0);\n assert_eq(inf.y, 0);\n }\n\n #[test]\n fn generator_has_documented_coordinates() {\n let g = EmbeddedCurvePoint::generator();\n assert_eq(g.x, 1);\n assert_eq(g.y, 17631683881184975370165255887551781615748388533673675138860);\n }\n\n #[test]\n fn is_infinite_only_true_for_origin() {\n assert(EmbeddedCurvePoint::point_at_infinity().is_infinite());\n assert(!EmbeddedCurvePoint::generator().is_infinite());\n assert(!EmbeddedCurvePoint::new(1, 0).is_infinite());\n assert(!EmbeddedCurvePoint::new(0, 1).is_infinite());\n }\n\n #[test]\n fn points_with_same_coords_are_equal() {\n let p = EmbeddedCurvePoint::new(7, 11);\n let q = EmbeddedCurvePoint::new(7, 11);\n assert_eq(p, q);\n }\n\n #[test]\n fn points_with_different_coords_are_unequal() {\n let p = EmbeddedCurvePoint::new(7, 11);\n assert(p != EmbeddedCurvePoint::new(7, 12));\n assert(p != EmbeddedCurvePoint::new(8, 11));\n assert(p != EmbeddedCurvePoint::new(8, 12));\n }\n\n #[test]\n fn neg_negates_y_coordinate() {\n let g = EmbeddedCurvePoint::generator();\n let neg_g = -g;\n assert_eq(neg_g.x, g.x);\n assert_eq(neg_g.y, -g.y);\n }\n\n #[test]\n fn neg_is_involution() {\n let g = EmbeddedCurvePoint::generator();\n assert_eq(--g, g);\n }\n\n #[test]\n fn add_with_point_at_infinity_is_identity() {\n let g = EmbeddedCurvePoint::generator();\n let inf = EmbeddedCurvePoint::point_at_infinity();\n assert_eq(g + inf, g);\n assert_eq(inf + g, g);\n }\n\n #[test]\n fn add_of_two_infinities_is_infinity() {\n let inf = EmbeddedCurvePoint::point_at_infinity();\n assert((inf + inf).is_infinite());\n }\n\n #[test]\n fn add_with_negation_is_point_at_infinity() {\n let g = EmbeddedCurvePoint::generator();\n assert((g + (-g)).is_infinite());\n }\n\n #[test]\n fn add_is_commutative() {\n let g = EmbeddedCurvePoint::generator();\n let g2 = g.double();\n assert_eq(g + g2, g2 + g);\n }\n\n #[test]\n fn add_is_associative() {\n let g = EmbeddedCurvePoint::generator();\n let g2 = g.double();\n let g3 = g + g2;\n assert_eq((g + g2) + g3, g + (g2 + g3));\n }\n\n #[test]\n fn sub_of_a_point_with_itself_is_infinity() {\n let g = EmbeddedCurvePoint::generator();\n assert((g - g).is_infinite());\n }\n\n #[test]\n fn sub_with_point_at_infinity_is_identity() {\n let g = EmbeddedCurvePoint::generator();\n let inf = EmbeddedCurvePoint::point_at_infinity();\n assert_eq(g - inf, g);\n }\n\n #[test]\n fn sub_inverts_add() {\n let g = EmbeddedCurvePoint::generator();\n let g2 = g.double();\n assert_eq((g + g2) - g2, g);\n assert_eq((g + g2) - g, g2);\n }\n\n #[test]\n fn double_equals_self_plus_self() {\n let g = EmbeddedCurvePoint::generator();\n assert_eq(g.double(), g + g);\n }\n\n #[test]\n fn double_of_point_at_infinity_is_infinity() {\n assert(EmbeddedCurvePoint::point_at_infinity().double().is_infinite());\n }\n\n #[test]\n fn embedded_curve_add_matches_add_operator() {\n let g = EmbeddedCurvePoint::generator();\n let g2 = g.double();\n assert_eq(embedded_curve_add(g, g2), g + g2);\n }\n\n #[test]\n fn point_hash_is_consistent_for_equal_points() {\n let p = EmbeddedCurvePoint::new(3, 5);\n let q = EmbeddedCurvePoint::new(3, 5);\n assert_eq(hash_point(p), hash_point(q));\n }\n\n #[test]\n fn point_hash_differs_for_distinct_points() {\n let p = EmbeddedCurvePoint::new(3, 5);\n assert(hash_point(p) != hash_point(EmbeddedCurvePoint::new(3, 7)));\n assert(hash_point(p) != hash_point(EmbeddedCurvePoint::new(4, 5)));\n // Distinguishes (x, y) from (y, x) - order of writes matters.\n assert(hash_point(p) != hash_point(EmbeddedCurvePoint::new(5, 3)));\n }\n\n #[test]\n fn scalar_new_sets_limbs() {\n let s = EmbeddedCurveScalar::new(3, 5);\n assert_eq(s.lo, 3);\n assert_eq(s.hi, 5);\n }\n\n #[test]\n fn scalars_with_same_limbs_are_equal() {\n let s = EmbeddedCurveScalar::new(7, 11);\n let t = EmbeddedCurveScalar::new(7, 11);\n assert_eq(s, t);\n }\n\n #[test]\n fn scalars_with_different_limbs_are_unequal() {\n let s = EmbeddedCurveScalar::new(7, 11);\n assert(s != EmbeddedCurveScalar::new(7, 12));\n assert(s != EmbeddedCurveScalar::new(8, 11));\n }\n\n #[test]\n fn scalar_from_field_decomposes_zero() {\n assert_eq(EmbeddedCurveScalar::from_field(0), EmbeddedCurveScalar::new(0, 0));\n }\n\n #[test]\n fn scalar_from_field_decomposes_small_value() {\n let s = EmbeddedCurveScalar::from_field(0x1234567890);\n assert_eq(s, EmbeddedCurveScalar::new(0x1234567890, 0));\n }\n\n #[test]\n fn scalar_from_field_decomposes_two_pow_128() {\n let s = EmbeddedCurveScalar::from_field(TWO_POW_128);\n assert_eq(s, EmbeddedCurveScalar::new(0, 1));\n }\n\n #[test]\n fn scalar_hash_is_consistent_for_equal_scalars() {\n let s = EmbeddedCurveScalar::new(7, 11);\n let t = EmbeddedCurveScalar::new(7, 11);\n assert_eq(hash_scalar(s), hash_scalar(t));\n }\n\n #[test]\n fn scalar_hash_differs_for_distinct_scalars() {\n let s = EmbeddedCurveScalar::new(7, 11);\n assert(hash_scalar(s) != hash_scalar(EmbeddedCurveScalar::new(7, 12)));\n assert(hash_scalar(s) != hash_scalar(EmbeddedCurveScalar::new(8, 11)));\n // Distinguishes (lo, hi) from (hi, lo) - limb order matters.\n assert(hash_scalar(s) != hash_scalar(EmbeddedCurveScalar::new(11, 7)));\n }\n\n #[test]\n fn msm_with_scalar_one_returns_point() {\n let g = EmbeddedCurvePoint::generator();\n let one = EmbeddedCurveScalar::new(1, 0);\n assert_eq(multi_scalar_mul([g], [one]), g);\n }\n\n #[test]\n fn msm_with_scalar_zero_returns_infinity() {\n let g = EmbeddedCurvePoint::generator();\n let zero = EmbeddedCurveScalar::new(0, 0);\n assert(multi_scalar_mul([g], [zero]).is_infinite());\n }\n\n #[test]\n fn msm_with_scalar_two_doubles_point() {\n let g = EmbeddedCurvePoint::generator();\n let two = EmbeddedCurveScalar::new(2, 0);\n assert_eq(multi_scalar_mul([g], [two]), g.double());\n }\n\n #[test]\n fn msm_sums_terms() {\n let g = EmbeddedCurvePoint::generator();\n let one = EmbeddedCurveScalar::new(1, 0);\n assert_eq(multi_scalar_mul([g, g], [one, one]), g.double());\n }\n\n #[test]\n fn msm_with_opposite_terms_cancels() {\n let g = EmbeddedCurvePoint::generator();\n let one = EmbeddedCurveScalar::new(1, 0);\n assert(multi_scalar_mul([g, -g], [one, one]).is_infinite());\n }\n\n #[test]\n fn msm_skips_point_at_infinity() {\n let g = EmbeddedCurvePoint::generator();\n let inf = EmbeddedCurvePoint::point_at_infinity();\n let one = EmbeddedCurveScalar::new(1, 0);\n assert_eq(multi_scalar_mul([inf, g], [one, one]), g);\n }\n\n #[test]\n fn msm_skips_zero_scalar() {\n let g = EmbeddedCurvePoint::generator();\n let one = EmbeddedCurveScalar::new(1, 0);\n let zero = EmbeddedCurveScalar::new(0, 0);\n assert_eq(multi_scalar_mul([g, g], [zero, one]), g);\n }\n\n #[test]\n fn fixed_base_scalar_mul_with_one_returns_generator() {\n let one = EmbeddedCurveScalar::new(1, 0);\n assert_eq(fixed_base_scalar_mul(one), EmbeddedCurvePoint::generator());\n }\n\n #[test]\n fn fixed_base_scalar_mul_with_zero_returns_infinity() {\n let zero = EmbeddedCurveScalar::new(0, 0);\n assert(fixed_base_scalar_mul(zero).is_infinite());\n }\n\n #[test]\n fn fixed_base_scalar_mul_matches_msm_on_generator() {\n let s = EmbeddedCurveScalar::new(2, 0);\n assert_eq(\n fixed_base_scalar_mul(s),\n multi_scalar_mul([EmbeddedCurvePoint::generator()], [s]),\n );\n }\n}\n" }, "140": { "function_locations": [ { "name": "protect_from_forgery", "start": 4924 }, { "name": "forgery_protected_eph_pk", "start": 5936 }, { "name": "get_existing_app_siloed_handshake_secrets", "start": 6951 }, { "name": "create_non_interactive_handshake", "start": 7819 }, { "name": "create_interactive_handshake", "start": 8606 }, { "name": "get_handshake_secrets", "start": 9189 }, { "name": "fetch_handshake_page", "start": 10884 }, { "name": "test::get_handshake_secrets_returns_secrets_from_single_page", "start": 11734 }, { "name": "test::get_handshake_secrets_fetches_multiple_pages", "start": 13389 }, { "name": "test::get_handshake_secrets_returns_empty_when_recipient_keys_not_held", "start": 15712 }, { "name": "test::mock_get_shared_secrets", "start": 16538 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/messages/delivery/handshake.nr", "source": "use crate::protocol::point::EmbeddedCurvePoint;\nuse crate::protocol::traits::{Deserialize, Serialize};\nuse std::embedded_curve_ops::{EmbeddedCurveScalar, multi_scalar_mul};\n\nuse crate::{\n context::PrivateContext,\n ephemeral::EphemeralArray,\n messages::{delivery::OnchainDeliveryMode, processing::provided_secret::ProvidedSecret},\n oracle::{call_utility_function::call_utility_function, shared_secret::get_shared_secrets},\n protocol::{\n abis::function_selector::FunctionSelector,\n address::AztecAddress,\n constants::DOM_SEP__HANDSHAKE_FORGERY_PROTECTION,\n hash::{poseidon2_hash_with_separator, sha256_to_field},\n traits::ToField,\n },\n standard_addresses::STANDARD_HANDSHAKE_REGISTRY_ADDRESS,\n};\n\n/// Page size for handshake discovery pagination.\npub global MAX_HANDSHAKES_PER_PAGE: u32 = 32;\n\n/// A handshake discovered during sync: the sender's ephemeral public key.\n#[derive(Deserialize, Eq, Serialize)]\npub struct DiscoveredHandshake {\n pub eph_pk: EmbeddedCurvePoint,\n}\n\n/// A paginated response of discovered handshakes.\n#[derive(Deserialize, Serialize)]\npub struct HandshakePage {\n pub items: BoundedVec,\n pub total_count: u32,\n}\n\n/// The app-siloed handshake secrets the registry returns for a `(sender, recipient)` pair.\n#[derive(Deserialize, Eq, Serialize)]\npub struct AppSiloedHandshakeSecrets {\n /// The app-siloed shared secret, used to derive the recipient's discovery tag. The recipient can reconstruct\n /// it from the handshake's public ephemeral key via ECDH.\n pub shared: Field,\n /// The app-siloed sender-only secret, folded into the constrained-delivery sequence nullifier so only the\n /// sender can advance a sequence. The recipient cannot reconstruct it: it derives from a random secret stored\n /// only in the sender's handshake note and never transmitted.\n pub sender_only: Field,\n}\n\npub(crate) global PROVIDED_SECRETS_ARRAY_BASE_SLOT: Field =\n sha256_to_field(\"AZTEC_NR::PROVIDED_SECRETS_ARRAY_BASE_SLOT\".as_bytes());\n\nglobal HANDSHAKE_EPH_PKS_SLOT: Field = sha256_to_field(\"AZTEC_NR::HANDSHAKE_EPH_PKS_SLOT\".as_bytes());\n\n// The helper cannot import the handshake registry interface because the registry contract depends on aztec-nr. These\n// selector constants pin the registry ABI surface this library calls. The registry's test suite compares them against\n// its macro-generated `HandshakeRegistry::at(...).method(...).selector` values so signature drift fails in tests.\npub global GET_APP_SILOED_SECRETS_SELECTOR: FunctionSelector =\n comptime { FunctionSelector::from_signature(\"get_app_siloed_secrets((Field),(Field))\") };\npub global NON_INTERACTIVE_HANDSHAKE_SELECTOR: FunctionSelector =\n comptime { FunctionSelector::from_signature(\"non_interactive_handshake((Field),(Field))\") };\npub global INTERACTIVE_HANDSHAKE_SELECTOR: FunctionSelector =\n comptime { FunctionSelector::from_signature(\"interactive_handshake((Field),(Field))\") };\npub global GET_NON_INTERACTIVE_HANDSHAKES_SELECTOR: FunctionSelector =\n comptime { FunctionSelector::from_signature(\"get_non_interactive_handshakes((Field),u32)\") };\n\n/// Protects a handshake's shared secret from recipient forgery.\n///\n/// The handshake's ECDH shared secret is symmetric: `S = eph_sk * recipient_pub`, where `(eph_sk, eph_pk)` is\n/// the sender's ephemeral key pair, also equals `recipient_priv * eph_pk`. The recipient recomputing `S` this\n/// way is normal: it is how they derive the handshake's tags when scanning. The attack is minting a second\n/// handshake with the same secret: the ephemeral key is unconstrained, so a malicious recipient can register\n/// its own handshake crafted to land on `S` again, with a different sender-only secret, and emit logs under\n/// the honest handshake's constrained-delivery tag. That breaks the invariant that a constrained-delivery log\n/// sequence is tied to a single sender: by colliding on the tag it blocks the honest sender, who can no longer\n/// emit the next note in their sequence.\n///\n/// The protection multiplies `S` by the scalar `k = hash(eph_pk, recipient_point)`: a forgery must announce a\n/// different `eph_pk`, so the protected secrets diverge. The result is still a point and silos like `S`.\n///\n/// The recipient point must be part of `k`: were `k` independent of it, an attacker choosing the fake\n/// recipient point as a multiple of the honest protected secret could solve for the multiplier that makes the\n/// forged secret land exactly on it.\n///\n/// Concretely, on the sender's side:\n/// S = eph_sk * recipient_point\n/// S' = protect_from_forgery(S, eph_pk, recipient_point) = k * S\n///\n/// See [`forgery_protected_eph_pk`] for how that arrives at the same `S'`.\npub fn protect_from_forgery(\n secret: EmbeddedCurvePoint,\n eph_pk: EmbeddedCurvePoint,\n recipient_point: EmbeddedCurvePoint,\n) -> EmbeddedCurvePoint {\n let scalar = poseidon2_hash_with_separator(\n [eph_pk.x, eph_pk.y, recipient_point.x, recipient_point.y],\n DOM_SEP__HANDSHAKE_FORGERY_PROTECTION,\n );\n multi_scalar_mul([secret], [EmbeddedCurveScalar::from_field(scalar)])\n}\n\n/// Applies the forgery protection to a discovered ephemeral key.\n///\n/// The recipient never holds the raw `S` (its side of the ECDH happens inside PXE), so it cannot call\n/// [`protect_from_forgery`] on the secret directly. The protection is a scalar multiplication and therefore\n/// commutes through ECDH: protecting the ephemeral key before the shared-secret derivation yields the same\n/// protected secret `S'` the sender stored:\n///\n/// protected_eph_pk = forgery_protected_eph_pk(eph_pk, recipient_point) = k * eph_pk\n/// recipient_priv * protected_eph_pk = recipient_priv * (k * eph_pk) = k * (recipient_priv * eph_pk) = k * S = S'\npub fn forgery_protected_eph_pk(eph_pk: EmbeddedCurvePoint, recipient_point: EmbeddedCurvePoint) -> EmbeddedCurvePoint {\n // Passing `eph_pk` twice is deliberate: it is both the point being multiplied and an input to the scalar\n // `k`, yielding `k * eph_pk` (see the algebra on [`protect_from_forgery`]).\n protect_from_forgery(eph_pk, eph_pk, recipient_point)\n}\n\n/// Reads the existing app-siloed handshake secrets for `(sender, recipient)` from the registry.\n///\n/// Returns `None` when no handshake has been registered for the pair yet, in which case the caller decides how to\n/// source a tagging secret (see [`super::tag::derive_log_tag`]).\n///\n/// ## Batching\n///\n/// This reads committed state, so within a single transaction multiple sends cannot see each other's pending\n/// handshake. A brand-new recipient therefore needs one landed transaction to establish the handshake before further\n/// sends can be batched onto it.\npub(crate) unconstrained fn get_existing_app_siloed_handshake_secrets(\n registry: AztecAddress,\n sender: AztecAddress,\n recipient: AztecAddress,\n) -> Option {\n let returns = call_utility_function(\n registry,\n GET_APP_SILOED_SECRETS_SELECTOR,\n [sender.to_field(), recipient.to_field()],\n );\n Deserialize::deserialize(returns)\n}\n\n/// Establishes a non-interactive handshake for `(sender, recipient)` and returns its app-siloed secrets.\n///\n/// The registry inserts a fresh handshake note and returns the app-siloed secrets. The constrained return value is the\n/// source of truth for the secrets, so constrained delivery anchoring a freshly bootstrapped handshake needs no\n/// separate call to the registry's `validate_handshake`.\n///\n/// Any handshake already registered for the pair is overwritten.\npub(crate) fn create_non_interactive_handshake(\n context: &mut PrivateContext,\n registry: AztecAddress,\n sender: AztecAddress,\n recipient: AztecAddress,\n) -> AppSiloedHandshakeSecrets {\n context\n .call_private_function(registry, NON_INTERACTIVE_HANDSHAKE_SELECTOR, [sender.to_field(), recipient.to_field()])\n .get_preimage()\n}\n\n/// Establishes an interactive handshake for `(sender, recipient)` and returns its app-siloed secrets.\n///\n/// As with [`create_non_interactive_handshake`], the constrained return value is the source of truth for the\n/// secrets, so constrained delivery anchoring a freshly bootstrapped handshake needs no separate call to the\n/// registry's `validate_handshake`.\n///\n/// Any handshake already registered for the pair is overwritten.\npub(crate) fn create_interactive_handshake(\n context: &mut PrivateContext,\n registry: AztecAddress,\n sender: AztecAddress,\n recipient: AztecAddress,\n) -> AppSiloedHandshakeSecrets {\n context\n .call_private_function(registry, INTERACTIVE_HANDSHAKE_SELECTOR, [sender.to_field(), recipient.to_field()])\n .get_preimage()\n}\n\n/// Fetches discovered handshakes from the HandshakeRegistry and derives app-siloed tagging secrets for each,\n/// returning them so that [`get_pending_tagged_logs`](crate::oracle::message_processing::get_pending_tagged_logs)\n/// searches for logs tagged with these secrets.\npub(crate) unconstrained fn get_handshake_secrets(\n contract_address: AztecAddress,\n recipient: AztecAddress,\n) -> EphemeralArray {\n let provided_secrets = EphemeralArray::::empty_at(PROVIDED_SECRETS_ARRAY_BASE_SLOT);\n\n // Each ephemeral key gets the forgery protection applied (see [`forgery_protected_eph_pk`]) so the oracle's\n // ECDH yields the protected secret the sender stored.\n let protected_eph_pks: EphemeralArray = EphemeralArray::empty_at(HANDSHAKE_EPH_PKS_SLOT);\n let recipient_point = recipient.to_address_point().expect(f\"recipient address is not on the curve\").inner;\n\n let mut page_offset: u32 = 0;\n let mut has_more = true;\n while has_more {\n let page = fetch_handshake_page(recipient, page_offset);\n\n for j in 0..page.items.len() {\n protected_eph_pks.push(forgery_protected_eph_pk(page.items.get(j).eph_pk, recipient_point));\n }\n\n page_offset += page.items.len();\n has_more = page_offset < page.total_count;\n }\n\n if protected_eph_pks.len() > 0 {\n let secrets = get_shared_secrets(recipient, protected_eph_pks, contract_address);\n for j in 0..secrets.len() {\n let secret = secrets.get(j);\n // Handshakes are mode-agnostic; emit one entry per on-chain tag domain for PXE to scan.\n provided_secrets.push(ProvidedSecret { secret, mode: OnchainDeliveryMode::onchain_unconstrained() });\n provided_secrets.push(ProvidedSecret { secret, mode: OnchainDeliveryMode::onchain_constrained() });\n }\n }\n\n provided_secrets\n}\n\n/// Calls the HandshakeRegistry's `get_non_interactive_handshakes` utility function and deserializes the response.\nunconstrained fn fetch_handshake_page(recipient: AztecAddress, page_offset: u32) -> HandshakePage {\n let args: [Field; 2] = [recipient.to_field(), page_offset as Field];\n let response = call_utility_function(\n STANDARD_HANDSHAKE_REGISTRY_ADDRESS,\n GET_NON_INTERACTIVE_HANDSHAKES_SELECTOR,\n args,\n );\n HandshakePage::deserialize(response)\n}\n\nmod test {\n use crate::ephemeral::EphemeralArray;\n use crate::messages::delivery::handshake::{\n DiscoveredHandshake, get_handshake_secrets, HandshakePage, MAX_HANDSHAKES_PER_PAGE,\n };\n use crate::messages::delivery::OnchainDeliveryMode;\n use crate::protocol::{address::AztecAddress, traits::{FromField, Serialize}};\n use crate::test::helpers::test_environment::TestEnvironment;\n use crate::utils::point::point_from_x_coord;\n use std::test::OracleMock;\n\n #[test]\n unconstrained fn get_handshake_secrets_returns_secrets_from_single_page() {\n let env = TestEnvironment::new();\n let recipient = AztecAddress::from_field(1);\n let contract_address = AztecAddress { inner: 0xdeadbeef };\n\n env.utility_context_at(contract_address, |_| {\n let pk_a = point_from_x_coord(1).unwrap();\n let pk_b = point_from_x_coord(2).unwrap();\n\n let mut items: BoundedVec = BoundedVec::new();\n items.push(DiscoveredHandshake { eph_pk: pk_a });\n items.push(DiscoveredHandshake { eph_pk: pk_b });\n let page = HandshakePage { items, total_count: 2 };\n let _ = OracleMock::mock(\"aztec_utl_callUtilityFunction\").returns(page.serialize());\n\n let secret_a: Field = 111;\n let secret_b: Field = 222;\n mock_get_shared_secrets([secret_a, secret_b]);\n\n let secrets = get_handshake_secrets(contract_address, recipient);\n\n assert_eq(secrets.len(), 4);\n assert_eq(secrets.get(0).secret, secret_a);\n assert(secrets.get(0).mode == OnchainDeliveryMode::onchain_unconstrained());\n assert_eq(secrets.get(1).secret, secret_a);\n assert(secrets.get(1).mode == OnchainDeliveryMode::onchain_constrained());\n assert_eq(secrets.get(2).secret, secret_b);\n assert(secrets.get(2).mode == OnchainDeliveryMode::onchain_unconstrained());\n assert_eq(secrets.get(3).secret, secret_b);\n assert(secrets.get(3).mode == OnchainDeliveryMode::onchain_constrained());\n });\n }\n\n #[test]\n unconstrained fn get_handshake_secrets_fetches_multiple_pages() {\n let env = TestEnvironment::new();\n let recipient = AztecAddress::from_field(1);\n let contract_address = AztecAddress { inner: 0xdeadbeef };\n\n env.utility_context_at(contract_address, |_| {\n let pk_a = point_from_x_coord(1).unwrap();\n let pk_b = point_from_x_coord(2).unwrap();\n let pk_c = point_from_x_coord(8).unwrap();\n\n let mut page_1_items: BoundedVec = BoundedVec::new();\n page_1_items.push(DiscoveredHandshake { eph_pk: pk_a });\n page_1_items.push(DiscoveredHandshake { eph_pk: pk_b });\n let page_1 = HandshakePage { items: page_1_items, total_count: 3 };\n\n let mut page_2_items: BoundedVec = BoundedVec::new();\n page_2_items.push(DiscoveredHandshake { eph_pk: pk_c });\n let page_2 = HandshakePage { items: page_2_items, total_count: 3 };\n\n let _ = OracleMock::mock(\"aztec_utl_callUtilityFunction\").returns(page_1.serialize()).times(1);\n let _ = OracleMock::mock(\"aztec_utl_callUtilityFunction\").returns(page_2.serialize()).times(1);\n\n mock_get_shared_secrets([111, 222, 333]);\n\n let secrets = get_handshake_secrets(contract_address, recipient);\n assert_eq(secrets.len(), 6);\n assert_eq(secrets.get(0).secret, 111);\n assert(secrets.get(0).mode == OnchainDeliveryMode::onchain_unconstrained());\n assert_eq(secrets.get(1).secret, 111);\n assert(secrets.get(1).mode == OnchainDeliveryMode::onchain_constrained());\n assert_eq(secrets.get(2).secret, 222);\n assert(secrets.get(2).mode == OnchainDeliveryMode::onchain_unconstrained());\n assert_eq(secrets.get(3).secret, 222);\n assert(secrets.get(3).mode == OnchainDeliveryMode::onchain_constrained());\n assert_eq(secrets.get(4).secret, 333);\n assert(secrets.get(4).mode == OnchainDeliveryMode::onchain_unconstrained());\n assert_eq(secrets.get(5).secret, 333);\n assert(secrets.get(5).mode == OnchainDeliveryMode::onchain_constrained());\n });\n }\n\n #[test]\n unconstrained fn get_handshake_secrets_returns_empty_when_recipient_keys_not_held() {\n let env = TestEnvironment::new();\n let recipient = AztecAddress::from_field(1);\n let contract_address = AztecAddress { inner: 0xdeadbeef };\n\n env.utility_context_at(contract_address, |_| {\n let mut items = BoundedVec::new();\n items.push(DiscoveredHandshake { eph_pk: point_from_x_coord(1).unwrap() });\n let page = HandshakePage { items, total_count: 1 };\n let _ = OracleMock::mock(\"aztec_utl_callUtilityFunction\").returns(page.serialize());\n\n let empty: [Field; 0] = [];\n mock_get_shared_secrets(empty);\n\n let secrets = get_handshake_secrets(contract_address, recipient);\n assert_eq(secrets.len(), 0);\n });\n }\n\n unconstrained fn mock_get_shared_secrets(response_values: [Field; N]) {\n let response_slot: Field = 99;\n let response_array: EphemeralArray = EphemeralArray::at(response_slot);\n for value in response_values {\n response_array.push(value);\n }\n let _ = OracleMock::mock(\"aztec_utl_getSharedSecrets\").returns(response_slot);\n }\n}\n" }, "141": { "function_locations": [ { "name": "do_private_message_delivery", "start": 2315 }, { "name": "do_onchain_private_message_delivery", "start": 3881 }, { "name": "resolve_sender", "start": 5947 }, { "name": "to_onchain_delivery_mode", "start": 6550 }, { "name": "test::sender_resolution_requires_wallet_default_sender", "start": 7072 }, { "name": "test::sender_resolution_uses_override", "start": 7380 }, { "name": "test::sender_resolution_uses_wallet_default_sender", "start": 7664 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/messages/delivery/mod.nr", "source": "mod builder;\nmod mode;\nmod resolved_tagging_strategy;\nmod tag;\npub(crate) mod tag_derivation;\npub(crate) mod tag_secret_source;\n\npub mod constrained_delivery;\npub mod handshake;\n\nuse crate::{\n context::PrivateContext,\n messages::{\n encryption::{aes128::AES128, message_encryption::MessageEncryption},\n offchain_messages::deliver_offchain_message,\n },\n oracle::notes::get_sender_for_tags,\n utils::remove_constraints::remove_constraints_if,\n};\nuse crate::protocol::address::AztecAddress;\nuse mode::DeliveryMode;\nuse tag::derive_log_tag;\nuse tag_derivation::TagDerivation;\n\npub use builder::{\n MessageDelivery, MessageDeliveryBuilder, OffchainDelivery, OnchainConstrainedDelivery, OnchainUnconstrainedDelivery,\n};\npub use mode::OnchainDeliveryMode;\npub use resolved_tagging_strategy::ResolvedTaggingStrategy;\n\n/// Performs private delivery of a message to `recipient` according to `delivery_mode`.\n///\n/// The message is encoded into plaintext and then encrypted for `recipient`. This function takes a _function_ that\n/// returns the plaintext instead of taking the plaintext directly in order to not waste constraints encoding the\n/// message in scenarios where the plaintext will be encrypted with unconstrained encryption.\n///\n/// `maybe_note_hash_counter` is only relevant for on-chain delivery modes (i.e. via protocol logs): if a newly created\n/// note hash's side effect counter is passed and constrained tagging is not in use, then the log will be squashed\n/// alongside the note should its nullifier be emitted in the current transaction. Constrained-tagged logs are not tied\n/// to note squashing, because recipient discovery scans those tags sequentially and a removed log would break the\n/// per-secret index sequence.\n///\n/// ## Privacy\n///\n/// The emitted log always has the same length regardless of `MESSAGE_PLAINTEXT_LEN`, because all message ciphertexts\n/// also have the same length. This prevents accidental privacy leakage via the log length.\npub fn do_private_message_delivery(\n context: &mut PrivateContext,\n encode_into_message_plaintext: fn[Env]() -> [Field; MESSAGE_PLAINTEXT_LEN],\n maybe_note_hash_counter: Option,\n recipient: AztecAddress,\n delivery_mode: D,\n)\nwhere\n D: MessageDeliveryBuilder,\n{\n let delivery = delivery_mode.build_message_delivery();\n\n let mode = delivery.mode();\n\n // This function relies on `mode` being a constant in order to reduce circuit constraints when\n // unconstrained usage is requested. If it were a runtime value the compiler would be unable to perform\n // dead-code elimination.\n mode.assert_is_constant();\n\n let deliver_as_offchain_message = mode == DeliveryMode::offchain();\n assert_constant(deliver_as_offchain_message);\n\n let sender_override = delivery.sender_override();\n let tag_derivation = delivery.tag_derivation();\n\n if deliver_as_offchain_message {\n let contract_address = context.this_address();\n let ciphertext = remove_constraints_if(\n true,\n || AES128::encrypt(encode_into_message_plaintext(), recipient, contract_address),\n );\n\n deliver_offchain_message(ciphertext, recipient);\n } else {\n do_onchain_private_message_delivery(\n context,\n encode_into_message_plaintext,\n maybe_note_hash_counter,\n recipient,\n mode,\n sender_override,\n tag_derivation,\n );\n }\n}\n\nfn do_onchain_private_message_delivery(\n context: &mut PrivateContext,\n encode_into_message_plaintext: fn[Env]() -> [Field; MESSAGE_PLAINTEXT_LEN],\n maybe_note_hash_counter: Option,\n recipient: AztecAddress,\n mode: DeliveryMode,\n sender_override: Option,\n tag_derivation: Option,\n) {\n let is_constrained = mode == DeliveryMode::onchain_constrained();\n assert_constant(is_constrained);\n\n // The tag derivation, both whether one is set and which variant it is, must be a compile-time constant so unused\n // derivations are eliminated.\n assert_constant(tag_derivation.is_some());\n if tag_derivation.is_some() {\n tag_derivation.unwrap_unchecked().assert_kind_is_constant();\n }\n\n let onchain_mode = to_onchain_delivery_mode(mode);\n let sender = resolve_sender(sender_override);\n\n let contract_address = context.this_address();\n\n let ciphertext = remove_constraints_if(\n !is_constrained,\n || AES128::encrypt(encode_into_message_plaintext(), recipient, contract_address),\n );\n\n let log_tag = derive_log_tag(context, onchain_mode, sender, recipient, tag_derivation);\n\n // This value must be constant to avoid predicating the context calls below, which might result in\n // the context's arrays having unknown compile time write indices and hence dramatically increasing constraints\n // when accessing them. In practice this restriction is not a problem as we always know at compile time whether\n // we're emitting a note or non-note message.\n assert_constant(maybe_note_hash_counter.is_some());\n\n // Constrained-tagged logs must not be squashed alongside the note: the recipient discovers them by scanning\n // the per-secret tag sequence, so removing a log would break the index sequence.\n let squashable_note_log = maybe_note_hash_counter.is_some() & !is_constrained;\n\n let log = BoundedVec::from_array(ciphertext);\n if squashable_note_log {\n // We associate the log with the note's side effect counter, so that if the note ends up being squashed in\n // the current transaction, the log will be removed as well.\n context.emit_raw_note_log_unsafe(log_tag, log, maybe_note_hash_counter.unwrap());\n } else {\n context.emit_private_log_unsafe(log_tag, log);\n }\n}\n\nfn resolve_sender(sender_override: Option) -> AztecAddress {\n // Safety: tag senders are unconstrained; the sender comes from the builder override or the wallet-provided\n // default tag sender, which must be an account the PXE controls so it can own and recover the resulting\n // tagging/handshake state.\n unsafe {\n sender_override.unwrap_or_else(|| {\n get_sender_for_tags().expect(\n f\"Sender for tags is not set when emitting a private log and no override is set. Ensure the wallet provides a default sender.\",\n )\n })\n }\n}\n\nfn to_onchain_delivery_mode(mode: DeliveryMode) -> OnchainDeliveryMode {\n if mode == DeliveryMode::onchain_constrained() {\n OnchainDeliveryMode::onchain_constrained()\n } else {\n OnchainDeliveryMode::onchain_unconstrained()\n }\n}\n\nmod test {\n use crate::protocol::{address::AztecAddress, traits::FromField};\n use crate::test::helpers::test_environment::TestEnvironment;\n use super::resolve_sender;\n use std::test::OracleMock;\n\n #[test(should_fail_with = \"Sender for tags is not set\")]\n unconstrained fn sender_resolution_requires_wallet_default_sender() {\n let env = TestEnvironment::new();\n let _ = OracleMock::mock(\"aztec_prv_getSenderForTags\").returns(Option::::none());\n\n env.private_context(|_context| { let _ = resolve_sender(Option::none()); });\n }\n\n #[test]\n unconstrained fn sender_resolution_uses_override() {\n let env = TestEnvironment::new();\n let sender = AztecAddress::from_field(1);\n\n env.private_context(|_context| { assert_eq(resolve_sender(Option::some(sender)), sender); });\n }\n\n #[test]\n unconstrained fn sender_resolution_uses_wallet_default_sender() {\n let env = TestEnvironment::new();\n let sender = AztecAddress::from_field(1);\n let _ = OracleMock::mock(\"aztec_prv_getSenderForTags\").returns(Option::some(sender));\n\n env.private_context(|_context| { assert_eq(resolve_sender(Option::none()), sender); });\n }\n}\n" }, "144": { "function_locations": [ { "name": "derive_log_tag", "start": 1150 }, { "name": "default_tag_secret_source", "start": 1739 }, { "name": "tag_with", "start": 2442 }, { "name": "tag_domain_separator", "start": 3113 }, { "name": "tag_from_secret_and_index", "start": 3373 }, { "name": "test::tag_from_secret_and_index_uses_mode_domain_separator", "start": 4295 }, { "name": "test::reuses_an_existing_handshake_secret", "start": 4906 }, { "name": "test::uses_the_resolved_unconstrained_secret_when_no_handshake_exists", "start": 6133 }, { "name": "test::constrained_delivery_rejects_a_resolved_unconstrained_secret", "start": 7178 }, { "name": "test::constrained_delivery_emits_the_sequence_nullifier_and_constrained_tag", "start": 7981 }, { "name": "test::derive_log_tag_honors_the_tag_derivation_override", "start": 9209 }, { "name": "test::mock_existing_handshake_secrets", "start": 10642 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/messages/delivery/tag.nr", "source": "//! Discovery tag derivation for on-chain message delivery.\n//!\n//! Constrained derivation also emits the sequence nullifier; see [`super::constrained_delivery`].\n\nuse crate::context::PrivateContext;\nuse crate::messages::delivery::{\n OnchainDeliveryMode,\n tag_derivation::{existing_handshake_secrets_or_else, TagDerivation},\n tag_secret_source::TagSecretSource,\n};\nuse crate::oracle::notes::get_next_tagging_index;\nuse crate::oracle::resolve_tagging_strategy::resolve_tagging_strategy;\nuse crate::protocol::{\n address::AztecAddress,\n constants::{DOM_SEP__CONSTRAINED_MSG_LOG_TAG, DOM_SEP__UNCONSTRAINED_MSG_LOG_TAG},\n hash::{compute_log_tag, poseidon2_hash},\n};\n\n/// Derives the discovery log tag for an on-chain delivery.\n///\n/// `tag_derivation` is the contract's compile-time choice of tag secret source, or `None` for the wallet-resolved\n/// default. It must be a compile-time constant so unused derivations are eliminated.\npub(crate) fn derive_log_tag(\n context: &mut PrivateContext,\n mode: OnchainDeliveryMode,\n sender: AztecAddress,\n recipient: AztecAddress,\n tag_derivation: Option,\n) -> Field {\n let source = tag_derivation.map_or_else(\n || default_tag_secret_source(context, sender, recipient, mode),\n |derivation| derivation.into_tag_secret_source(context, sender, recipient),\n );\n tag_with(source, context, mode, sender, recipient)\n}\n\n/// The wallet-resolved default: reuse a handshake already registered for the pair, otherwise let the wallet resolve\n/// the tagging secret strategy.\nfn default_tag_secret_source(\n context: &mut PrivateContext,\n sender: AztecAddress,\n recipient: AztecAddress,\n mode: OnchainDeliveryMode,\n) -> TagSecretSource {\n existing_handshake_secrets_or_else(\n sender,\n recipient,\n || {\n // Safety: the strategy only selects which source runs; each source constrains (or rejects) its own\n // secret before a constrained tag is emitted, so an untrusted strategy can't produce a valid unbacked\n // constrained tag.\n let strategy = unsafe { resolve_tagging_strategy(sender, recipient, mode) };\n strategy.into_tag_secret_source(context, sender, recipient)\n },\n )\n}\n\nfn tag_with(\n source: TagSecretSource,\n context: &mut PrivateContext,\n mode: OnchainDeliveryMode,\n sender: AztecAddress,\n recipient: AztecAddress,\n) -> Field {\n let secret = source.tag_secret();\n\n // Safety: the index is untrusted. Constrained delivery constrains it below before emitting the tag; unconstrained\n // discovery tolerates gaps, so a wrong index only yields an undiscoverable tag.\n let index = unsafe { get_next_tagging_index(secret, mode) };\n\n if mode == OnchainDeliveryMode::onchain_constrained() {\n source.constrain_tag_secret(context, sender, recipient, index);\n }\n\n // The discovery tag stays derived from the tag secret only, so the recipient still finds every message.\n tag_from_secret_and_index(secret, index, mode)\n}\n\nfn tag_domain_separator(mode: OnchainDeliveryMode) -> u32 {\n if mode == OnchainDeliveryMode::onchain_constrained() {\n DOM_SEP__CONSTRAINED_MSG_LOG_TAG\n } else {\n DOM_SEP__UNCONSTRAINED_MSG_LOG_TAG\n }\n}\n\nfn tag_from_secret_and_index(secret: Field, index: u32, mode: OnchainDeliveryMode) -> Field {\n compute_log_tag(\n poseidon2_hash([secret, index as Field]),\n tag_domain_separator(mode),\n )\n}\n\nmod test {\n use crate::messages::delivery::handshake::AppSiloedHandshakeSecrets;\n use crate::messages::delivery::{ResolvedTaggingStrategy, tag_derivation::TagDerivation};\n use crate::protocol::{\n address::AztecAddress,\n constants::{DOM_SEP__CONSTRAINED_MSG_LOG_TAG, DOM_SEP__UNCONSTRAINED_MSG_LOG_TAG},\n hash::{compute_log_tag, poseidon2_hash},\n traits::{FromField, Serialize},\n };\n use crate::test::helpers::test_environment::TestEnvironment;\n use super::{derive_log_tag, OnchainDeliveryMode, tag_from_secret_and_index};\n use std::test::OracleMock;\n\n global SENDER: AztecAddress = AztecAddress::from_field(1);\n global RECIPIENT: AztecAddress = AztecAddress::from_field(8);\n\n #[test]\n fn tag_from_secret_and_index_uses_mode_domain_separator() {\n let secret: Field = 1234;\n let index: u32 = 7;\n let raw_tag = poseidon2_hash([secret, index as Field]);\n\n assert_eq(\n tag_from_secret_and_index(secret, index, OnchainDeliveryMode::onchain_unconstrained()),\n compute_log_tag(raw_tag, DOM_SEP__UNCONSTRAINED_MSG_LOG_TAG),\n );\n assert_eq(\n tag_from_secret_and_index(secret, index, OnchainDeliveryMode::onchain_constrained()),\n compute_log_tag(raw_tag, DOM_SEP__CONSTRAINED_MSG_LOG_TAG),\n );\n }\n\n #[test]\n unconstrained fn reuses_an_existing_handshake_secret() {\n let env = TestEnvironment::new();\n let secret: Field = 7;\n let index: u32 = 3;\n\n env.private_context(|context| {\n mock_existing_handshake_secrets(Option::some(\n AppSiloedHandshakeSecrets { shared: secret, sender_only: 99 },\n ));\n let _ = OracleMock::mock(\"aztec_prv_getNextTaggingIndex\").returns(index);\n let resolve_oracle = OracleMock::mock(\"aztec_prv_resolveTaggingStrategy\").returns(\n ResolvedTaggingStrategy::non_interactive_handshake(),\n );\n\n assert_eq(\n derive_log_tag(\n context,\n OnchainDeliveryMode::onchain_unconstrained(),\n SENDER,\n RECIPIENT,\n Option::none(),\n ),\n tag_from_secret_and_index(secret, index, OnchainDeliveryMode::onchain_unconstrained()),\n );\n\n // An existing handshake is reused without consulting the wallet's tagging strategy oracle.\n assert_eq(resolve_oracle.times_called(), 0);\n });\n }\n\n #[test]\n unconstrained fn uses_the_resolved_unconstrained_secret_when_no_handshake_exists() {\n let env = TestEnvironment::new();\n let secret: Field = 7;\n let index: u32 = 3;\n\n env.private_context(|context| {\n mock_existing_handshake_secrets(Option::none());\n let _ = OracleMock::mock(\"aztec_prv_resolveTaggingStrategy\").returns(\n ResolvedTaggingStrategy::unconstrained_secret(secret),\n );\n let _ = OracleMock::mock(\"aztec_prv_getNextTaggingIndex\").returns(index);\n\n assert_eq(\n derive_log_tag(\n context,\n OnchainDeliveryMode::onchain_unconstrained(),\n SENDER,\n RECIPIENT,\n Option::none(),\n ),\n tag_from_secret_and_index(secret, index, OnchainDeliveryMode::onchain_unconstrained()),\n );\n });\n }\n\n #[test(should_fail_with = \"an unconstrained tagging secret cannot back constrained delivery\")]\n unconstrained fn constrained_delivery_rejects_a_resolved_unconstrained_secret() {\n let env = TestEnvironment::new();\n let secret: Field = 7;\n let index: u32 = 0;\n\n env.private_context(|context| {\n mock_existing_handshake_secrets(Option::none());\n let _ = OracleMock::mock(\"aztec_prv_resolveTaggingStrategy\").returns(\n ResolvedTaggingStrategy::unconstrained_secret(secret),\n );\n let _ = OracleMock::mock(\"aztec_prv_getNextTaggingIndex\").returns(index);\n\n let _ = derive_log_tag(\n context,\n OnchainDeliveryMode::onchain_constrained(),\n SENDER,\n RECIPIENT,\n Option::none(),\n );\n });\n }\n\n #[test]\n unconstrained fn constrained_delivery_emits_the_sequence_nullifier_and_constrained_tag() {\n let env = TestEnvironment::new();\n let secret: Field = 7;\n // Index > 0 so the reused secret is anchored via the previous sequence nullifier, not a registry call.\n let index: u32 = 3;\n\n env.private_context(|context| {\n mock_existing_handshake_secrets(Option::some(\n AppSiloedHandshakeSecrets { shared: secret, sender_only: 99 },\n ));\n let _ = OracleMock::mock(\"aztec_prv_getNextTaggingIndex\").returns(index);\n let _ = OracleMock::mock(\"aztec_prv_isNullifierPending\").returns(false);\n\n assert_eq(\n derive_log_tag(\n context,\n OnchainDeliveryMode::onchain_constrained(),\n SENDER,\n RECIPIENT,\n Option::none(),\n ),\n tag_from_secret_and_index(secret, index, OnchainDeliveryMode::onchain_constrained()),\n );\n\n // Constrained delivery emits the sequence nullifier for the (sender, recipient, secret) sequence.\n assert_eq(context.nullifiers.len(), 1);\n });\n }\n\n #[test]\n unconstrained fn derive_log_tag_honors_the_tag_derivation_override() {\n let env = TestEnvironment::new();\n let secret: Field = 7;\n let index: u32 = 3;\n\n env.private_context(|context| {\n let _ = OracleMock::mock(\"aztec_prv_getAppTaggingSecret\").returns(Option::some(secret));\n let _ = OracleMock::mock(\"aztec_prv_getNextTaggingIndex\").returns(index);\n // The wallet's default resolution would yield a different secret, which the override must bypass.\n let resolve_oracle = OracleMock::mock(\"aztec_prv_resolveTaggingStrategy\").returns(\n ResolvedTaggingStrategy::unconstrained_secret(secret + 1),\n );\n\n // With a contract-fixed derivation, the tag comes from the override's secret, not the wallet's.\n assert_eq(\n derive_log_tag(\n context,\n OnchainDeliveryMode::onchain_unconstrained(),\n SENDER,\n RECIPIENT,\n Option::some(TagDerivation::address_derived()),\n ),\n tag_from_secret_and_index(secret, index, OnchainDeliveryMode::onchain_unconstrained()),\n );\n\n // The override is honored: the wallet's default strategy resolution is never consulted.\n assert_eq(resolve_oracle.times_called(), 0);\n });\n }\n\n unconstrained fn mock_existing_handshake_secrets(maybe_secrets: Option) {\n let _ = OracleMock::mock(\"aztec_utl_callUtilityFunction\").returns(maybe_secrets.serialize());\n }\n}\n" }, "145": { "function_locations": [ { "name": "TagDerivation::non_interactive_handshake", "start": 1186 }, { "name": "TagDerivation::interactive_handshake", "start": 1401 }, { "name": "TagDerivation::address_derived", "start": 1651 }, { "name": "TagDerivation::assert_kind_is_constant", "start": 1812 }, { "name": "TagDerivation::into_tag_secret_source", "start": 2131 }, { "name": "existing_handshake_secrets_or_else", "start": 3525 }, { "name": "test::address_derived_uses_the_app_tagging_secret", "start": 4694 }, { "name": "test::address_derived_falls_back_to_a_random_secret_for_an_invalid_recipient", "start": 5225 }, { "name": "test::non_interactive_handshake_reuses_an_existing_handshake", "start": 5849 }, { "name": "test::non_interactive_handshake_creates_a_fresh_one_when_none_exists", "start": 6397 }, { "name": "test::interactive_handshake_reuses_an_existing_handshake", "start": 6964 }, { "name": "test::interactive_handshake_creates_a_fresh_one_when_none_exists", "start": 7504 }, { "name": "test::mock_existing_handshake_secrets", "start": 8084 }, { "name": "test::mock_handshake_creation", "start": 8406 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/messages/delivery/tag_derivation.nr", "source": "use crate::context::PrivateContext;\nuse crate::messages::delivery::{\n handshake::get_existing_app_siloed_handshake_secrets, tag_secret_source::TagSecretSource,\n};\nuse crate::oracle::notes::get_app_tagging_secret;\nuse crate::oracle::random::random;\nuse crate::protocol::address::AztecAddress;\nuse crate::standard_addresses::STANDARD_HANDSHAKE_REGISTRY_ADDRESS;\n\nglobal NON_INTERACTIVE_HANDSHAKE: u8 = 1;\nglobal ADDRESS_DERIVED: u8 = 2;\nglobal INTERACTIVE_HANDSHAKE: u8 = 3;\n\n/// A contract's choice of tag-secret derivation.\n///\n/// Selected through the on-chain delivery builder's `via_*` methods. On-chain delivery tags every message from a\n/// secret shared between the sender and the recipient, and there is\n/// [more than one way][`crate::messages::delivery::ResolvedTaggingStrategy`] to establish it.\n/// Selecting a derivation instead lets the contract fix it, and its choice is honored over the wallet-resolved\n/// strategy.\n#[derive(Eq)]\npub(crate) struct TagDerivation {\n kind: u8,\n}\n\nimpl TagDerivation {\n /// Reuses an existing handshake for the pair, creating a fresh non-interactive one only when none exists.\n pub(crate) fn non_interactive_handshake() -> Self {\n Self { kind: NON_INTERACTIVE_HANDSHAKE }\n }\n\n /// Reuses an existing handshake for the pair, creating a fresh interactive one only when none exists.\n pub(crate) fn interactive_handshake() -> Self {\n Self { kind: INTERACTIVE_HANDSHAKE }\n }\n\n /// Derives the tag from the address-derived secret for the `(sender, recipient)` pair (a Diffie-Hellman exchange\n /// between their addresses).\n pub(crate) fn address_derived() -> Self {\n Self { kind: ADDRESS_DERIVED }\n }\n\n /// Asserts this choice's `kind` is a compile-time constant.\n pub(crate) fn assert_kind_is_constant(self) {\n assert_constant(self.kind as Field);\n }\n\n /// Resolves this choice into the [`TagSecretSource`] backing the message tag.\n pub(crate) fn into_tag_secret_source(\n self,\n context: &mut PrivateContext,\n sender: AztecAddress,\n recipient: AztecAddress,\n ) -> TagSecretSource {\n if self.kind == NON_INTERACTIVE_HANDSHAKE {\n existing_handshake_secrets_or_else(\n sender,\n recipient,\n || TagSecretSource::new_non_interactive_handshake(context, sender, recipient),\n )\n } else if self.kind == INTERACTIVE_HANDSHAKE {\n existing_handshake_secrets_or_else(\n sender,\n recipient,\n || TagSecretSource::new_interactive_handshake(context, sender, recipient),\n )\n } else {\n // Safety: the secret is untrusted, but address-derived tagging is unconstrained-only, where a wrong\n // secret only yields an undiscoverable tag. An invalid recipient has no shared secret, so we fall back\n // to a random (undiscoverable) secret rather than failing the send.\n let secret = unsafe { get_app_tagging_secret(sender, recipient).unwrap_or_else(|| random()) };\n TagSecretSource::unconstrained_secret(secret)\n }\n }\n}\n\n/// Resolves to the secrets of a handshake already registered for `(sender, recipient)` (handshakes of either type\n/// back both delivery modes), or to `fallback()` when none exists yet.\npub(crate) fn existing_handshake_secrets_or_else(\n sender: AztecAddress,\n recipient: AztecAddress,\n fallback: fn[Env]() -> TagSecretSource,\n) -> TagSecretSource {\n // Safety: this only selects which source backs the tag. A reused handshake's secrets are constrained against\n // the registry before a constrained tag is emitted; the fallback source constrains (or rejects) its own secret\n // the same way.\n let existing =\n unsafe { get_existing_app_siloed_handshake_secrets(STANDARD_HANDSHAKE_REGISTRY_ADDRESS, sender, recipient) };\n existing.map_or_else(fallback, |secrets| TagSecretSource::existing_handshake(secrets))\n}\n\nmod test {\n use crate::context::PrivateContext;\n use crate::hash::hash_args;\n use crate::messages::delivery::handshake::AppSiloedHandshakeSecrets;\n use crate::messages::delivery::tag_secret_source::TagSecretSource;\n use crate::oracle::execution_cache;\n use crate::protocol::{address::AztecAddress, traits::{FromField, Serialize}};\n use crate::test::helpers::test_environment::TestEnvironment;\n use super::TagDerivation;\n use std::test::OracleMock;\n\n global SENDER: AztecAddress = AztecAddress::from_field(1);\n global RECIPIENT: AztecAddress = AztecAddress::from_field(8);\n\n #[test]\n unconstrained fn address_derived_uses_the_app_tagging_secret() {\n let env = TestEnvironment::new();\n let secret: Field = 7;\n\n env.private_context(|context| {\n let _ = OracleMock::mock(\"aztec_prv_getAppTaggingSecret\").returns(Option::some(secret));\n\n let source = TagDerivation::address_derived().into_tag_secret_source(context, SENDER, RECIPIENT);\n assert_eq(source, TagSecretSource::unconstrained_secret(secret));\n });\n }\n\n #[test]\n unconstrained fn address_derived_falls_back_to_a_random_secret_for_an_invalid_recipient() {\n let env = TestEnvironment::new();\n let random_secret: Field = 999;\n\n env.private_context(|context| {\n let _ = OracleMock::mock(\"aztec_prv_getAppTaggingSecret\").returns(Option::::none());\n let _ = OracleMock::mock(\"aztec_misc_getRandomField\").returns(random_secret);\n\n let source = TagDerivation::address_derived().into_tag_secret_source(context, SENDER, RECIPIENT);\n assert_eq(source, TagSecretSource::unconstrained_secret(random_secret));\n });\n }\n\n #[test]\n unconstrained fn non_interactive_handshake_reuses_an_existing_handshake() {\n let env = TestEnvironment::new();\n let secrets = AppSiloedHandshakeSecrets { shared: 7, sender_only: 99 };\n\n env.private_context(|context| {\n mock_existing_handshake_secrets(Option::some(secrets));\n\n let source = TagDerivation::non_interactive_handshake().into_tag_secret_source(context, SENDER, RECIPIENT);\n assert_eq(source, TagSecretSource::existing_handshake(secrets));\n });\n }\n\n #[test]\n unconstrained fn non_interactive_handshake_creates_a_fresh_one_when_none_exists() {\n let env = TestEnvironment::new();\n let secrets = AppSiloedHandshakeSecrets { shared: 7, sender_only: 99 };\n\n env.private_context(|context| {\n mock_existing_handshake_secrets(Option::none());\n mock_handshake_creation(context, secrets);\n\n let source = TagDerivation::non_interactive_handshake().into_tag_secret_source(context, SENDER, RECIPIENT);\n assert_eq(source.tag_secret(), secrets.shared);\n });\n }\n\n #[test]\n unconstrained fn interactive_handshake_reuses_an_existing_handshake() {\n let env = TestEnvironment::new();\n let secrets = AppSiloedHandshakeSecrets { shared: 7, sender_only: 99 };\n\n env.private_context(|context| {\n mock_existing_handshake_secrets(Option::some(secrets));\n\n let source = TagDerivation::interactive_handshake().into_tag_secret_source(context, SENDER, RECIPIENT);\n assert_eq(source, TagSecretSource::existing_handshake(secrets));\n });\n }\n\n #[test]\n unconstrained fn interactive_handshake_creates_a_fresh_one_when_none_exists() {\n let env = TestEnvironment::new();\n let secrets = AppSiloedHandshakeSecrets { shared: 7, sender_only: 99 };\n\n env.private_context(|context| {\n mock_existing_handshake_secrets(Option::none());\n mock_handshake_creation(context, secrets);\n\n let source = TagDerivation::interactive_handshake().into_tag_secret_source(context, SENDER, RECIPIENT);\n assert_eq(source.tag_secret(), secrets.shared);\n });\n }\n\n unconstrained fn mock_existing_handshake_secrets(maybe_secrets: Option) {\n let _ = OracleMock::mock(\"aztec_utl_callUtilityFunction\").returns(maybe_secrets.serialize());\n }\n\n // The registry's handshake creation call returns the app-siloed secrets via the returns cache.\n unconstrained fn mock_handshake_creation(context: &mut PrivateContext, secrets: AppSiloedHandshakeSecrets) {\n let returns = secrets.serialize();\n let returns_hash = hash_args(returns);\n execution_cache::store(returns, returns_hash);\n let child_call_end_counter = context.get_side_effect_counter() + 1;\n let _ =\n OracleMock::mock(\"aztec_prv_callPrivateFunction\").returns((child_call_end_counter, returns_hash)).times(1);\n }\n}\n" }, "147": { "function_locations": [ { "name": "do_sync_state", "start": 7269 }, { "name": "do_sync_state_without_handshake_discovery", "start": 8106 }, { "name": "sync_state_with_secrets", "start": 8798 }, { "name": "test::do_sync_state_does_not_panic_on_empty_logs", "start": 11420 }, { "name": "test::dummy_compute_note_hash", "start": 13514 }, { "name": "test::dummy_compute_note_nullifier", "start": 13875 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/messages/discovery/mod.nr", "source": "use crate::ephemeral::EphemeralArray;\nuse crate::logging::{aztecnr_debug_log, aztecnr_debug_log_format, aztecnr_warn_log_format};\nuse crate::messages::{\n delivery::handshake::{get_handshake_secrets, PROVIDED_SECRETS_ARRAY_BASE_SLOT},\n processing::provided_secret::ProvidedSecret,\n};\nuse crate::partial_notes;\nuse crate::protocol::address::AztecAddress;\n\npub(crate) mod nonce_discovery;\npub(crate) mod private_events;\npub mod private_notes;\npub mod process_message;\n\nuse crate::{\n messages::{\n discovery::process_message::process_message_ciphertext,\n encoding::MAX_MESSAGE_CONTENT_LEN,\n logs::note::MAX_NOTE_PACKED_LEN,\n processing::{\n offchain::OffchainInboxSync, OffchainMessageWithTx, pending_tagged_log::PendingTaggedLog, ResolvedTx,\n validate_and_store_enqueued_notes_and_events,\n },\n },\n oracle::message_processing,\n utils::array,\n};\n\npub struct NoteHashAndNullifier {\n /// The result of [`crate::note::note_interface::NoteHash::compute_note_hash`].\n pub note_hash: Field,\n /// The result of [`crate::note::note_interface::NoteHash::compute_nullifier_unconstrained`].\n ///\n /// This value is unconstrained, as all of message discovery is unconstrained. It is `None` if the nullifier\n /// cannot be computed (e.g. because the nullifier hiding key is not available).\n pub inner_nullifier: Option,\n}\n\n/// A contract's way of computing note hashes.\n///\n/// Each contract in the network is free to compute their note's hash as they see fit - the hash function itself is not\n/// enshrined or standardized. Some aztec-nr functions however do need to know the details of this computation (e.g.\n/// when finding new notes), which is what this type represents.\n///\n/// This function takes a note's packed content, storage slot, note type ID, address of the emitting contract and\n/// randomness, and attempts to compute its inner note hash (not siloed by address nor uniqued by nonce).\n///\n/// ## Transient Notes\n///\n/// This function is meant to always be used on **settled** notes, i.e. those that have been inserted into the trees\n/// and for which the nonce is known. It is never invoked in the context of a transient note, as those are not involved\n/// in message processing.\n///\n/// ## Automatic Implementation\n///\n/// The [`[#aztec]`](crate::macros::aztec::aztec) macro automatically creates a correct implementation of this function\n/// for each contract by inspecting all note types in use and the storage layout. This injected function is a\n/// `#[contract_library_method]` called `_compute_note_hash`, and it looks something like this:\n///\n/// ```noir\n/// |packed_note, owner, storage_slot, note_type_id, _contract_address, randomness| {\n/// if note_type_id == MyNoteType::get_id() {\n/// if packed_note.len() != MY_NOTE_TYPE_SERIALIZATION_LENGTH {\n/// Option::none()\n/// } else {\n/// let note = MyNoteType::unpack(aztec::utils::array::subarray(packed_note.storage(), 0));\n/// Option::some(note.compute_note_hash(owner, storage_slot, randomness))\n/// }\n/// } else if note_type_id == MyOtherNoteType::get_id() {\n/// ... // Similar to above but calling MyOtherNoteType::unpack\n/// } else {\n/// Option::none() // Unknown note type ID\n/// };\n/// }\n/// ```\npub type ComputeNoteHash = unconstrained fn(/* packed_note */BoundedVec, /*\n owner */ AztecAddress, /* storage_slot */ Field, /* note_type_id */ Field, /* contract_address */ AztecAddress, /*\nrandomness */ Field) -> Option;\n\n/// A contract's way of computing note nullifiers.\n///\n/// Like [`ComputeNoteHash`], each contract is free to derive nullifiers as they see fit. This function takes the\n/// unique note hash (used as the note hash for nullification for settled notes), plus the note's packed content and\n/// metadata, and attempts to compute the inner nullifier (not siloed by address).\n///\n/// ## Automatic Implementation\n///\n/// The [`[#aztec]`](crate::macros::aztec::aztec) macro automatically creates a correct implementation of this function\n/// for each contract called `_compute_note_nullifier`. It dispatches on `note_type_id` similarly to\n/// [`ComputeNoteHash`], then calls the note's\n/// [`compute_nullifier_unconstrained`](crate::note::note_interface::NoteHash::compute_nullifier_unconstrained) method.\npub type ComputeNoteNullifier = unconstrained fn(/* unique_note_hash */Field, /* packed_note */ BoundedVec,\n/* owner */ AztecAddress, /* storage_slot */ Field, /* note_type_id */ Field, /* contract_address */ AztecAddress,\n/* randomness */ Field) -> Option;\n\n/// Deprecated: use [`ComputeNoteHash`] and [`ComputeNoteNullifier`] instead.\npub type ComputeNoteHashAndNullifier = unconstrained fn[Env](/* packed_note */BoundedVec,\n/* owner */ AztecAddress, /* storage_slot */ Field, /* note_type_id */ Field, /* contract_address */ AztecAddress,\n/*randomness */ Field, /* note nonce */ Field) -> Option;\n\n/// A handler for custom messages.\n///\n/// Contracts that emit custom messages (i.e. any with a message type that is not in [`crate::messages::msg_type`])\n/// need to use [`crate::macros::AztecConfig::custom_message_handler`] with a function of this type in order to\n/// process them. They will otherwise be **silently ignored**.\npub type CustomMessageHandler = unconstrained fn(\n/* contract_address */AztecAddress,\n/* msg_type_id */ u64,\n/* msg_metadata */ u64,\n/* msg_content */ BoundedVec,\n/* resolved_tx */ ResolvedTx,\n/* scope */ AztecAddress);\n\n/// Custom state synchronization handler.\n///\n/// When set via [`crate::macros::AztecConfig::custom_sync_state`], the generated `sync_state` function will call\n/// this handler instead of [`do_sync_state`]. It receives all of the same parameters, so it can run custom logic\n/// (e.g. fetching and decrypting custom logs) before, after, or instead of calling [`do_sync_state`].\npub type CustomSyncHandler = unconstrained fn(\n/* contract_address */AztecAddress,\n/* compute_note_hash */ ComputeNoteHash,\n/* compute_note_nullifier */ ComputeNoteNullifier,\n/* process_custom_message */ Option,\n/* offchain_inbox_sync */ Option,\n/* scope */ AztecAddress);\n\n/// Synchronizes the contract's private state with the network.\n///\n/// As blocks are mined, it is possible for a contract's private state to change (e.g. with new notes being created),\n/// but because these changes are private they will be invisible to most actors. This is the function that processes\n/// new transactions in order to discover new notes, events, and other kinds of private state changes.\n///\n/// The private state will be synchronized up to the block that will be used for private transactions (i.e. the anchor\n/// block. This will typically be close to the tip of the chain.\npub unconstrained fn do_sync_state(\n contract_address: AztecAddress,\n compute_note_hash: ComputeNoteHash,\n compute_note_nullifier: ComputeNoteNullifier,\n process_custom_message: Option,\n offchain_inbox_sync: Option,\n scope: AztecAddress,\n) {\n let provided_secrets = get_handshake_secrets(contract_address, scope);\n sync_state_with_secrets(\n contract_address,\n compute_note_hash,\n compute_note_nullifier,\n process_custom_message,\n offchain_inbox_sync,\n scope,\n provided_secrets,\n );\n}\n\n/// Variant of [`do_sync_state`] that skips handshake secret discovery. Used by the HandshakeRegistry to avoid\n/// infinite recursion (the registry discovers handshakes for other contracts, not for itself).\npub unconstrained fn do_sync_state_without_handshake_discovery(\n contract_address: AztecAddress,\n compute_note_hash: ComputeNoteHash,\n compute_note_nullifier: ComputeNoteNullifier,\n process_custom_message: Option,\n offchain_inbox_sync: Option,\n scope: AztecAddress,\n) {\n let provided_secrets = EphemeralArray::::empty_at(PROVIDED_SECRETS_ARRAY_BASE_SLOT);\n sync_state_with_secrets(\n contract_address,\n compute_note_hash,\n compute_note_nullifier,\n process_custom_message,\n offchain_inbox_sync,\n scope,\n provided_secrets,\n );\n}\n\nunconstrained fn sync_state_with_secrets(\n contract_address: AztecAddress,\n compute_note_hash: ComputeNoteHash,\n compute_note_nullifier: ComputeNoteNullifier,\n process_custom_message: Option,\n offchain_inbox_sync: Option,\n scope: AztecAddress,\n provided_secrets: EphemeralArray,\n) {\n aztecnr_debug_log!(\"Performing state synchronization\");\n\n let logs = message_processing::get_pending_tagged_logs(scope, provided_secrets);\n logs.for_each(|_i, pending_tagged_log: PendingTaggedLog| {\n if pending_tagged_log.log.len() == 0 {\n aztecnr_warn_log_format!(\"Skipping empty log from tx {0}\")([pending_tagged_log.context.tx_hash]);\n } else {\n aztecnr_debug_log_format!(\"Processing log with tag {0}\")([pending_tagged_log.log.get(0)]);\n\n // We remove the tag from the pending tagged log and process the message ciphertext contained in it.\n let message_ciphertext = array::subbvec(pending_tagged_log.log, 1);\n\n process_message_ciphertext(\n contract_address,\n compute_note_hash,\n compute_note_nullifier,\n process_custom_message,\n message_ciphertext,\n pending_tagged_log.context,\n scope,\n );\n }\n });\n\n if offchain_inbox_sync.is_some() {\n let msgs = offchain_inbox_sync.unwrap()(contract_address, scope);\n msgs.for_each(|_i, msg: OffchainMessageWithTx| {\n process_message_ciphertext(\n contract_address,\n compute_note_hash,\n compute_note_nullifier,\n process_custom_message,\n msg.message_ciphertext,\n msg.resolved_tx,\n scope,\n );\n });\n }\n\n // Then we process all pending partial notes, regardless of whether they were found in the current or previous\n // executions.\n partial_notes::sync(\n contract_address,\n compute_note_hash,\n compute_note_nullifier,\n scope,\n );\n\n // Finally we validate all notes and events that were found as part of the previous processes, resulting in them\n // being added to PXE's database and retrievable via oracles (get_notes) and our TS API (PXE::getPrivateEvents).\n validate_and_store_enqueued_notes_and_events(scope);\n}\n\nmod test {\n use crate::ephemeral::EphemeralArray;\n use crate::messages::{\n delivery::handshake::HandshakePage,\n discovery::{CustomMessageHandler, do_sync_state},\n logs::note::MAX_NOTE_PACKED_LEN,\n processing::{offchain::OffchainInboxSync, pending_tagged_log::PendingTaggedLog},\n };\n use crate::protocol::{address::AztecAddress, traits::Serialize};\n use crate::test::helpers::test_environment::TestEnvironment;\n use std::test::OracleMock;\n\n #[test]\n unconstrained fn do_sync_state_does_not_panic_on_empty_logs() {\n let mut env = TestEnvironment::new();\n let scope = env.create_light_account();\n\n let contract_address = AztecAddress { inner: 0xdeadbeef };\n\n env.utility_context_at(contract_address, |_| {\n // get_handshake_secrets calls the HandshakeRegistry during sync; return an empty page so\n // no tagging secrets are produced.\n let empty_page = HandshakePage { items: BoundedVec::new(), total_count: 0 };\n let _ = OracleMock::mock(\"aztec_utl_callUtilityFunction\").returns(empty_page.serialize());\n\n // Mock the oracle call to return a known base slot, then populate an ephemeral\n // array at that slot so do_sync_state processes a non-empty log list.\n let base_slot = 42;\n let mock = std::test::OracleMock::mock(\"aztec_utl_getPendingTaggedLogsV2\");\n let _ = mock.returns(base_slot);\n\n let logs: EphemeralArray = EphemeralArray::at(base_slot);\n logs.push(PendingTaggedLog { log: BoundedVec::new(), context: std::mem::zeroed() });\n assert_eq(logs.len(), 1);\n\n let no_handler: Option = Option::none();\n let no_inbox_sync: Option = Option::none();\n do_sync_state(\n contract_address,\n dummy_compute_note_hash,\n dummy_compute_note_nullifier,\n no_handler,\n no_inbox_sync,\n scope,\n );\n\n // Guards against the mocked oracle name going stale: if sync stops calling it, the crafted empty log\n // above is never consumed and the test silently stops covering the empty-payload path.\n assert_eq(mock.times_called(), 1);\n });\n }\n\n unconstrained fn dummy_compute_note_hash(\n _packed_note: BoundedVec,\n _owner: AztecAddress,\n _storage_slot: Field,\n _note_type_id: Field,\n _contract_address: AztecAddress,\n _randomness: Field,\n ) -> Option {\n Option::none()\n }\n\n unconstrained fn dummy_compute_note_nullifier(\n _unique_note_hash: Field,\n _packed_note: BoundedVec,\n _owner: AztecAddress,\n _storage_slot: Field,\n _note_type_id: Field,\n _contract_address: AztecAddress,\n _randomness: Field,\n ) -> Option {\n Option::none()\n }\n}\n" }, "148": { "function_locations": [ { "name": "attempt_note_nonce_discovery", "start": 1866 }, { "name": "bvec_filter", "start": 7210 }, { "name": "test::compute_note_hash", "start": 8458 }, { "name": "test::compute_note_nullifier", "start": 9107 }, { "name": "test::no_note_hashes", "start": 9764 }, { "name": "test::failed_hash_computation_is_ignored", "start": 10362 }, { "name": "test::failed_nullifier_computation_is_ignored", "start": 10959 }, { "name": "test::construct_note", "start": 12052 }, { "name": "test::single_note", "start": 13085 }, { "name": "test::multiple_notes_same_preimage", "start": 14249 }, { "name": "test::single_note_misaligned_nonce", "start": 16275 }, { "name": "test::single_note_nonce_with_index_past_note_hashes_in_tx", "start": 17515 }, { "name": "test::duplicate_unique_note_hashes", "start": 18937 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/messages/discovery/nonce_discovery.nr", "source": "use crate::messages::{discovery::{ComputeNoteHash, ComputeNoteNullifier}, logs::note::MAX_NOTE_PACKED_LEN};\n\nuse crate::logging::{aztecnr_debug_log_format, aztecnr_warn_log_format};\nuse crate::protocol::{\n address::AztecAddress,\n constants::MAX_NOTE_HASHES_PER_TX,\n hash::{compute_note_hash_nonce, compute_siloed_note_hash, compute_unique_note_hash},\n traits::ToField,\n};\n\n/// A struct with the discovered information of a complete note, required for delivery to PXE. Note that this is *not*\n/// the complete note information, since it does not include content, storage slot, etc.\npub(crate) struct DiscoveredNoteInfo {\n pub(crate) note_nonce: Field,\n pub(crate) note_hash: Field,\n pub(crate) inner_nullifier: Field,\n}\n\n/// Searches for note nonces that will result in a note that was emitted in a transaction. While rare, it is possible\n/// for multiple notes to have the exact same packed content and storage slot but different nonces, resulting in\n/// different unique note hashes. Because of this this function returns a *vector* of discovered notes, though in most\n/// cases it will contain a single element.\n///\n/// Due to how nonces are computed, this function requires knowledge of the transaction in which the note was created,\n/// more specifically the list of all unique note hashes in it plus the value of its first nullifier.\npub(crate) unconstrained fn attempt_note_nonce_discovery(\n unique_note_hashes_in_tx: BoundedVec,\n first_nullifier_in_tx: Field,\n compute_note_hash: ComputeNoteHash,\n compute_note_nullifier: ComputeNoteNullifier,\n contract_address: AztecAddress,\n owner: AztecAddress,\n storage_slot: Field,\n randomness: Field,\n note_type_id: Field,\n packed_note: BoundedVec,\n) -> BoundedVec {\n let discovered_notes = &mut BoundedVec::new();\n\n aztecnr_debug_log_format!(\n \"Attempting nonce discovery on {0} potential notes on contract {1} for storage slot {2}\",\n )(\n [unique_note_hashes_in_tx.len() as Field, contract_address.to_field(), storage_slot],\n );\n\n let maybe_note_hash = compute_note_hash(\n packed_note,\n owner,\n storage_slot,\n note_type_id,\n contract_address,\n randomness,\n );\n\n if maybe_note_hash.is_none() {\n aztecnr_warn_log_format!(\n \"Unable to compute note hash for note of id {0} with packed length {1}, skipping nonce discovery\",\n )(\n [note_type_id, packed_note.len() as Field],\n );\n } else {\n let note_hash = maybe_note_hash.unwrap();\n let siloed_note_hash = compute_siloed_note_hash(contract_address, note_hash);\n\n // We need to find nonces (typically just one) that result in the siloed note hash that being uniqued into one\n // of the transaction's effects.\n // The nonce is meant to be derived from the index of the note hash in the transaction effects array. However,\n // due to an issue in the kernels the nonce might actually use any of the possible note hash indices - not\n // necessarily the one that corresponds to the note hash. Hence, we need to try them all.\n for i in 0..MAX_NOTE_HASHES_PER_TX {\n let nonce_for_i = compute_note_hash_nonce(first_nullifier_in_tx, i);\n let unique_note_hash_for_i = compute_unique_note_hash(nonce_for_i, siloed_note_hash);\n\n let matching_notes = bvec_filter(\n unique_note_hashes_in_tx,\n |unique_note_hash_in_tx| unique_note_hash_in_tx == unique_note_hash_for_i,\n );\n if matching_notes.len() > 1 {\n let identical_note_hashes = matching_notes.len();\n // Note that we don't actually check that the note hashes array contains unique values, only that the\n // note we found is unique. We don't expect for this to ever happen (it'd indicate a malicious node or\n // PXE, which are both assumed to be cooperative) so testing for it just in case is unnecessary, but we\n // _do_ need to handle it if we find a duplicate.\n panic(\n f\"Received {identical_note_hashes} identical note hashes for a transaction - these should all be unique\",\n )\n } else if matching_notes.len() == 1 {\n let maybe_inner_nullifier_for_i = compute_note_nullifier(\n unique_note_hash_for_i,\n packed_note,\n owner,\n storage_slot,\n note_type_id,\n contract_address,\n randomness,\n );\n\n if maybe_inner_nullifier_for_i.is_none() {\n // TODO: down the line we want to be able to store notes for which we don't know their nullifier,\n // e.g. notes that belong to someone that is not us (and for which we therefore don't know their\n // associated app-siloed nullifer hiding secret key).\n // https://linear.app/aztec-labs/issue/F-265/store-external-notes\n aztecnr_warn_log_format!(\n \"Unable to compute nullifier of unique note {0} with note type id {1} and owner {2}, skipping PXE insertion\",\n )(\n [unique_note_hash_for_i, note_type_id, owner.to_field()],\n );\n } else {\n // Note that while we did check that the note hash is the preimage of a unique note hash, we\n // perform no validations on the nullifier - we fundamentally cannot, since only the application\n // knows how to compute nullifiers. We simply trust it to have provided the correct one: if it\n // hasn't, then PXE may fail to realize that a given note has been nullified already, and calls to\n // the application could result in invalid transactions (with duplicate nullifiers). This is not a\n // concern because an application already has more direct means of making a call to it fail the\n // transaction.\n discovered_notes.push(\n DiscoveredNoteInfo {\n note_nonce: nonce_for_i,\n note_hash,\n inner_nullifier: maybe_inner_nullifier_for_i.unwrap(),\n },\n );\n }\n // We don't exit the loop - it is possible (though rare) for the exact same note content to be present\n // multiple times in the same transaction with different nonces. This typically doesn't happen due to\n // notes containing random values in order to hide their contents.\n }\n }\n }\n\n *discovered_notes\n}\n\n// There is no BoundedVec::filter in the stdlib, so we use this until that is implemented.\nunconstrained fn bvec_filter(\n bvec: BoundedVec,\n filter: fn[Env](T) -> bool,\n) -> BoundedVec {\n let filtered = &mut BoundedVec::new();\n\n bvec.for_each(|value| {\n if filter(value) {\n filtered.push(value);\n }\n });\n\n *filtered\n}\n\nmod test {\n use crate::{\n messages::logs::note::MAX_NOTE_PACKED_LEN,\n note::{\n note_interface::{NoteHash, NoteType},\n note_metadata::SettledNoteMetadata,\n utils::compute_note_hash_for_nullification,\n },\n oracle::random::random,\n test::mocks::mock_note::MockNote,\n utils::array,\n };\n\n use crate::protocol::{\n address::AztecAddress,\n hash::{compute_note_hash_nonce, compute_siloed_note_hash, compute_unique_note_hash},\n traits::{FromField, Packable},\n };\n\n use super::attempt_note_nonce_discovery;\n\n // This implementation could be simpler, but this serves as a nice example of the expected flow in a real\n // implementation, and as a sanity check that the interface is sufficient.\n\n unconstrained fn compute_note_hash(\n packed_note: BoundedVec,\n owner: AztecAddress,\n storage_slot: Field,\n note_type_id: Field,\n _contract_address: AztecAddress,\n randomness: Field,\n ) -> Option {\n if (note_type_id == MockNote::get_id()) & (packed_note.len() == ::N) {\n let note = MockNote::unpack(array::subarray(packed_note.storage(), 0));\n Option::some(note.compute_note_hash(owner, storage_slot, randomness))\n } else {\n Option::none()\n }\n }\n\n unconstrained fn compute_note_nullifier(\n unique_note_hash: Field,\n packed_note: BoundedVec,\n owner: AztecAddress,\n _storage_slot: Field,\n note_type_id: Field,\n _contract_address: AztecAddress,\n _randomness: Field,\n ) -> Option {\n if (note_type_id == MockNote::get_id()) & (packed_note.len() == ::N) {\n let note = MockNote::unpack(array::subarray(packed_note.storage(), 0));\n note.compute_nullifier_unconstrained(owner, unique_note_hash)\n } else {\n Option::none()\n }\n }\n\n global VALUE: Field = 7;\n global FIRST_NULLIFIER_IN_TX: Field = 47;\n global CONTRACT_ADDRESS: AztecAddress = AztecAddress::from_field(13);\n global OWNER: AztecAddress = AztecAddress::from_field(14);\n global STORAGE_SLOT: Field = 99;\n global RANDOMNESS: Field = 99;\n\n #[test]\n unconstrained fn no_note_hashes() {\n let unique_note_hashes_in_tx = BoundedVec::new();\n let packed_note = BoundedVec::new();\n\n let discovered_notes = attempt_note_nonce_discovery(\n unique_note_hashes_in_tx,\n FIRST_NULLIFIER_IN_TX,\n compute_note_hash,\n compute_note_nullifier,\n CONTRACT_ADDRESS,\n OWNER,\n STORAGE_SLOT,\n RANDOMNESS,\n MockNote::get_id(),\n packed_note,\n );\n\n assert_eq(discovered_notes.len(), 0);\n }\n\n #[test]\n unconstrained fn failed_hash_computation_is_ignored() {\n let unique_note_hashes_in_tx = BoundedVec::from_array([random()]);\n\n let discovered_notes = attempt_note_nonce_discovery(\n unique_note_hashes_in_tx,\n FIRST_NULLIFIER_IN_TX,\n |_, _, _, _, _, _| Option::none(),\n compute_note_nullifier,\n CONTRACT_ADDRESS,\n OWNER,\n STORAGE_SLOT,\n RANDOMNESS,\n MockNote::get_id(),\n BoundedVec::new(),\n );\n\n assert_eq(discovered_notes.len(), 0);\n }\n\n #[test]\n unconstrained fn failed_nullifier_computation_is_ignored() {\n let note_index_in_tx = 2;\n let note_and_data = construct_note(VALUE, note_index_in_tx);\n\n let mut unique_note_hashes_in_tx = BoundedVec::from_array([\n random(), random(), random(), random(), random(), random(), random(),\n ]);\n unique_note_hashes_in_tx.set(note_index_in_tx, note_and_data.unique_note_hash);\n\n let discovered_notes = attempt_note_nonce_discovery(\n unique_note_hashes_in_tx,\n FIRST_NULLIFIER_IN_TX,\n compute_note_hash,\n |_, _, _, _, _, _, _| Option::none(),\n CONTRACT_ADDRESS,\n OWNER,\n STORAGE_SLOT,\n RANDOMNESS,\n MockNote::get_id(),\n BoundedVec::from_array(note_and_data.note.pack()),\n );\n\n assert_eq(discovered_notes.len(), 0);\n }\n\n struct NoteAndData {\n note: MockNote,\n note_nonce: Field,\n note_hash: Field,\n unique_note_hash: Field,\n inner_nullifier: Field,\n }\n\n unconstrained fn construct_note(value: Field, note_index_in_tx: u32) -> NoteAndData {\n let note_nonce = compute_note_hash_nonce(FIRST_NULLIFIER_IN_TX, note_index_in_tx);\n\n let hinted_note = MockNote::new(value)\n .contract_address(CONTRACT_ADDRESS)\n .owner(OWNER)\n .randomness(RANDOMNESS)\n .storage_slot(STORAGE_SLOT)\n .note_metadata(SettledNoteMetadata::new(note_nonce).into())\n .build_hinted_note();\n let note = hinted_note.note;\n\n let note_hash = note.compute_note_hash(OWNER, STORAGE_SLOT, RANDOMNESS);\n let unique_note_hash = compute_unique_note_hash(\n note_nonce,\n compute_siloed_note_hash(CONTRACT_ADDRESS, note_hash),\n );\n let inner_nullifier = note\n .compute_nullifier_unconstrained(OWNER, compute_note_hash_for_nullification(hinted_note))\n .expect(f\"Could not compute nullifier for note owned by {OWNER}\");\n\n NoteAndData { note, note_nonce, note_hash, unique_note_hash, inner_nullifier }\n }\n\n #[test]\n unconstrained fn single_note() {\n let note_index_in_tx = 2;\n let note_and_data = construct_note(VALUE, note_index_in_tx);\n\n let mut unique_note_hashes_in_tx = BoundedVec::from_array([\n random(), random(), random(), random(), random(), random(), random(),\n ]);\n unique_note_hashes_in_tx.set(note_index_in_tx, note_and_data.unique_note_hash);\n\n let discovered_notes = attempt_note_nonce_discovery(\n unique_note_hashes_in_tx,\n FIRST_NULLIFIER_IN_TX,\n compute_note_hash,\n compute_note_nullifier,\n CONTRACT_ADDRESS,\n OWNER,\n STORAGE_SLOT,\n RANDOMNESS,\n MockNote::get_id(),\n BoundedVec::from_array(note_and_data.note.pack()),\n );\n\n assert_eq(discovered_notes.len(), 1);\n let discovered_note = discovered_notes.get(0);\n\n assert_eq(discovered_note.note_nonce, note_and_data.note_nonce);\n assert_eq(discovered_note.note_hash, note_and_data.note_hash);\n assert_eq(discovered_note.inner_nullifier, note_and_data.inner_nullifier);\n }\n\n #[test]\n unconstrained fn multiple_notes_same_preimage() {\n let first_note_index_in_tx = 3;\n let first_note_and_data = construct_note(VALUE, first_note_index_in_tx);\n\n let second_note_index_in_tx = 5;\n let second_note_and_data = construct_note(VALUE, second_note_index_in_tx);\n\n // Both notes have the same preimage (and therefore packed representation), so both should be found in the same\n // call.\n assert_eq(first_note_and_data.note, second_note_and_data.note);\n let packed_note = first_note_and_data.note.pack();\n\n let mut unique_note_hashes_in_tx = BoundedVec::from_array([\n random(), random(), random(), random(), random(), random(), random(),\n ]);\n unique_note_hashes_in_tx.set(first_note_index_in_tx, first_note_and_data.unique_note_hash);\n unique_note_hashes_in_tx.set(second_note_index_in_tx, second_note_and_data.unique_note_hash);\n\n let discovered_notes = attempt_note_nonce_discovery(\n unique_note_hashes_in_tx,\n FIRST_NULLIFIER_IN_TX,\n compute_note_hash,\n compute_note_nullifier,\n CONTRACT_ADDRESS,\n OWNER,\n STORAGE_SLOT,\n RANDOMNESS,\n MockNote::get_id(),\n BoundedVec::from_array(packed_note),\n );\n\n assert_eq(discovered_notes.len(), 2);\n\n assert(discovered_notes.any(|discovered_note| {\n (discovered_note.note_nonce == first_note_and_data.note_nonce)\n & (discovered_note.note_hash == first_note_and_data.note_hash)\n & (discovered_note.inner_nullifier == first_note_and_data.inner_nullifier)\n }));\n\n assert(discovered_notes.any(|discovered_note| {\n (discovered_note.note_nonce == second_note_and_data.note_nonce)\n & (discovered_note.note_hash == second_note_and_data.note_hash)\n & (discovered_note.inner_nullifier == second_note_and_data.inner_nullifier)\n }));\n }\n\n #[test]\n unconstrained fn single_note_misaligned_nonce() {\n let note_index_in_tx = 2;\n let note_and_data = construct_note(VALUE, note_index_in_tx);\n\n let mut unique_note_hashes_in_tx = BoundedVec::from_array([\n random(), random(), random(), random(), random(), random(), random(),\n ]);\n\n // The note is not at the correct index\n unique_note_hashes_in_tx.set(note_index_in_tx + 1, note_and_data.unique_note_hash);\n\n let discovered_notes = attempt_note_nonce_discovery(\n unique_note_hashes_in_tx,\n FIRST_NULLIFIER_IN_TX,\n compute_note_hash,\n compute_note_nullifier,\n CONTRACT_ADDRESS,\n OWNER,\n STORAGE_SLOT,\n RANDOMNESS,\n MockNote::get_id(),\n BoundedVec::from_array(note_and_data.note.pack()),\n );\n\n assert_eq(discovered_notes.len(), 1);\n let discovered_note = discovered_notes.get(0);\n\n assert_eq(discovered_note.note_nonce, note_and_data.note_nonce);\n assert_eq(discovered_note.note_hash, note_and_data.note_hash);\n assert_eq(discovered_note.inner_nullifier, note_and_data.inner_nullifier);\n }\n\n #[test]\n unconstrained fn single_note_nonce_with_index_past_note_hashes_in_tx() {\n let mut unique_note_hashes_in_tx = BoundedVec::from_array([\n random(), random(), random(), random(), random(), random(), random(),\n ]);\n\n // The nonce is computed with an index that does not exist in the tx\n let note_index_in_tx = unique_note_hashes_in_tx.len() + 5;\n let note_and_data = construct_note(VALUE, note_index_in_tx);\n\n // The note is inserted at an arbitrary index - its true index is out of the array's bounds\n unique_note_hashes_in_tx.set(2, note_and_data.unique_note_hash);\n\n let discovered_notes = attempt_note_nonce_discovery(\n unique_note_hashes_in_tx,\n FIRST_NULLIFIER_IN_TX,\n compute_note_hash,\n compute_note_nullifier,\n CONTRACT_ADDRESS,\n OWNER,\n STORAGE_SLOT,\n RANDOMNESS,\n MockNote::get_id(),\n BoundedVec::from_array(note_and_data.note.pack()),\n );\n\n assert_eq(discovered_notes.len(), 1);\n let discovered_note = discovered_notes.get(0);\n\n assert_eq(discovered_note.note_nonce, note_and_data.note_nonce);\n assert_eq(discovered_note.note_hash, note_and_data.note_hash);\n assert_eq(discovered_note.inner_nullifier, note_and_data.inner_nullifier);\n }\n\n #[test(should_fail_with = \"identical note hashes for a transaction\")]\n unconstrained fn duplicate_unique_note_hashes() {\n let note_index_in_tx = 2;\n let note_and_data = construct_note(VALUE, note_index_in_tx);\n\n let mut unique_note_hashes_in_tx = BoundedVec::from_array([\n random(), random(), random(), random(), random(), random(), random(),\n ]);\n\n // The same unique note hash is present in two indices in the array, which is not allowed. Note that we don't\n // test all note hashes for uniqueness, only those that we actually find.\n unique_note_hashes_in_tx.set(note_index_in_tx, note_and_data.unique_note_hash);\n unique_note_hashes_in_tx.set(note_index_in_tx + 1, note_and_data.unique_note_hash);\n\n let _ = attempt_note_nonce_discovery(\n unique_note_hashes_in_tx,\n FIRST_NULLIFIER_IN_TX,\n compute_note_hash,\n compute_note_nullifier,\n CONTRACT_ADDRESS,\n OWNER,\n STORAGE_SLOT,\n RANDOMNESS,\n MockNote::get_id(),\n BoundedVec::from_array(note_and_data.note.pack()),\n );\n }\n}\n" }, "149": { "function_locations": [ { "name": "process_private_event_msg", "start": 547 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/messages/discovery/private_events.nr", "source": "use crate::{\n event::event_interface::compute_private_serialized_event_commitment,\n logging::aztecnr_warn_log_format,\n messages::{\n encoding::MAX_MESSAGE_CONTENT_LEN, logs::event::decode_private_event_message,\n processing::enqueue_event_for_validation,\n },\n};\nuse crate::protocol::{address::AztecAddress, traits::ToField};\n\npub(crate) unconstrained fn process_private_event_msg(\n contract_address: AztecAddress,\n msg_metadata: u64,\n msg_content: BoundedVec,\n tx_hash: Field,\n) {\n let decoded = decode_private_event_message(msg_metadata, msg_content);\n\n if decoded.is_some() {\n let (event_type_id, randomness, serialized_event) = decoded.unwrap();\n\n let event_commitment =\n compute_private_serialized_event_commitment(serialized_event, randomness, event_type_id.to_field());\n\n enqueue_event_for_validation(\n contract_address,\n event_type_id,\n randomness,\n serialized_event,\n event_commitment,\n tx_hash,\n );\n } else {\n aztecnr_warn_log_format!(\n \"Could not decode private event message from tx {0}, ignoring\",\n )(\n [tx_hash],\n );\n }\n}\n" }, "15": { "function_locations": [ { "name": "compute_decomposition", "start": 456 }, { "name": "decompose_hint", "start": 818 }, { "name": "lte_hint", "start": 906 }, { "name": "assert_gt_limbs", "start": 1116 }, { "name": "decompose", "start": 1725 }, { "name": "assert_gt", "start": 2431 }, { "name": "assert_lt", "start": 2837 }, { "name": "gt", "start": 2901 }, { "name": "lt", "start": 3405 }, { "name": "tests::check_decompose", "start": 3678 }, { "name": "tests::check_lte_hint", "start": 3928 }, { "name": "tests::check_gt", "start": 4261 }, { "name": "tests::check_plo_phi", "start": 4591 }, { "name": "tests::check_decompose_edge_cases", "start": 5086 }, { "name": "tests::check_decompose_large_values", "start": 5446 }, { "name": "tests::check_lt_comprehensive", "start": 5807 } ], "path": "std/field/bn254.nr", "source": "use crate::field::field_less_than;\nuse crate::runtime::is_unconstrained;\n\n// The low and high decomposition of the field modulus\npub(crate) global PLO: Field = 53438638232309528389504892708671455233;\npub(crate) global PHI: Field = 64323764613183177041862057485226039389;\n\npub(crate) global TWO_POW_128: Field = 0x100000000000000000000000000000000;\n\n// Decomposes a single field into two 16 byte fields.\nfn compute_decomposition(x: Field) -> (Field, Field) {\n // Here's we're taking advantage of truncating 128 bit limbs from the input field\n // and then subtracting them from the input such the field division is equivalent to integer division.\n let low = (x as u128) as Field;\n let high = (x - low) / TWO_POW_128;\n\n (low, high)\n}\n\npub(crate) unconstrained fn decompose_hint(x: Field) -> (Field, Field) {\n compute_decomposition(x)\n}\n\nunconstrained fn lte_hint(x: Field, y: Field) -> bool {\n if x == y {\n true\n } else {\n field_less_than(x, y)\n }\n}\n\n// Assert that (alo > blo && ahi >= bhi) || (alo <= blo && ahi > bhi)\nfn assert_gt_limbs(a: (Field, Field), b: (Field, Field)) {\n let (alo, ahi) = a;\n let (blo, bhi) = b;\n // Safety: borrow is enforced to be boolean due to its type.\n // if borrow is 0, it asserts that (alo > blo && ahi >= bhi)\n // if borrow is 1, it asserts that (alo <= blo && ahi > bhi)\n unsafe {\n let borrow = lte_hint(alo, blo);\n\n let rlo = alo - blo - 1 + (borrow as Field) * TWO_POW_128;\n let rhi = ahi - bhi - (borrow as Field);\n\n rlo.assert_max_bit_size::<128>();\n rhi.assert_max_bit_size::<128>();\n }\n}\n\n/// Decompose a single field into two 16 byte fields.\npub fn decompose(x: Field) -> (Field, Field) {\n if is_unconstrained() {\n compute_decomposition(x)\n } else {\n // Safety: decomposition is properly checked below\n unsafe {\n // Take hints of the decomposition\n let (xlo, xhi) = decompose_hint(x);\n\n // Range check the limbs\n xlo.assert_max_bit_size::<128>();\n xhi.assert_max_bit_size::<128>();\n\n // Check that the decomposition is correct\n assert_eq(x, xlo + TWO_POW_128 * xhi);\n\n // Assert that the decomposition of P is greater than the decomposition of x\n assert_gt_limbs((PLO, PHI), (xlo, xhi));\n (xlo, xhi)\n }\n }\n}\n\npub fn assert_gt(a: Field, b: Field) {\n if is_unconstrained() {\n assert(\n // Safety: already unconstrained\n unsafe { field_less_than(b, a) },\n );\n } else {\n // Decompose a and b\n let a_limbs = decompose(a);\n let b_limbs = decompose(b);\n\n // Assert that a_limbs is greater than b_limbs\n assert_gt_limbs(a_limbs, b_limbs)\n }\n}\n\npub fn assert_lt(a: Field, b: Field) {\n assert_gt(b, a);\n}\n\npub fn gt(a: Field, b: Field) -> bool {\n if is_unconstrained() {\n // Safety: unsafe in unconstrained\n unsafe {\n field_less_than(b, a)\n }\n } else if a == b {\n false\n } else {\n // Safety: Take a hint of the comparison and verify it\n unsafe {\n if field_less_than(a, b) {\n assert_gt(b, a);\n false\n } else {\n assert_gt(a, b);\n true\n }\n }\n }\n}\n\npub fn lt(a: Field, b: Field) -> bool {\n gt(b, a)\n}\n\nmod tests {\n // TODO: Allow imports from \"super\"\n use crate::field::bn254::{assert_gt, decompose, gt, lt, lte_hint, PHI, PLO, TWO_POW_128};\n use crate::internal::test_unconstrained;\n use super::assert_lt;\n\n #[test]\n fn check_decompose() {\n assert_eq(decompose(TWO_POW_128), (0, 1));\n assert_eq(decompose(TWO_POW_128 + 0x1234567890), (0x1234567890, 1));\n assert_eq(decompose(0x1234567890), (0x1234567890, 0));\n }\n\n #[test]\n unconstrained fn check_lte_hint() {\n assert(lte_hint(0, 1));\n assert(lte_hint(0, 0x100));\n assert(lte_hint(0x100, TWO_POW_128 - 1));\n assert(!lte_hint(0 - 1, 0));\n\n assert(lte_hint(0, 0));\n assert(lte_hint(0x100, 0x100));\n assert(lte_hint(0 - 1, 0 - 1));\n }\n\n #[test]\n #[test_unconstrained]\n fn check_gt() {\n assert(gt(1, 0));\n assert(gt(0x100, 0));\n assert(gt((0 - 1), (0 - 2)));\n assert(gt(TWO_POW_128, 0));\n assert(!gt(0, 0));\n assert(!gt(0, 0x100));\n assert(gt(0 - 1, 0 - 2));\n assert(!gt(0 - 2, 0 - 1));\n assert_gt(0 - 1, 0);\n }\n\n #[test]\n fn check_plo_phi() {\n assert_eq(PLO + PHI * TWO_POW_128, 0);\n let p_bytes = crate::field::modulus_le_bytes();\n let mut p_low: Field = 0;\n let mut p_high: Field = 0;\n\n let mut offset = 1;\n for i in 0..16 {\n p_low += (p_bytes[i] as Field) * offset;\n p_high += (p_bytes[i + 16] as Field) * offset;\n offset *= 256;\n }\n assert_eq(p_low, PLO);\n assert_eq(p_high, PHI);\n }\n\n #[test]\n fn check_decompose_edge_cases() {\n assert_eq(decompose(0), (0, 0));\n assert_eq(decompose(TWO_POW_128 - 1), (TWO_POW_128 - 1, 0));\n assert_eq(decompose(TWO_POW_128 + 1), (1, 1));\n assert_eq(decompose(TWO_POW_128 * 2), (0, 2));\n assert_eq(decompose(TWO_POW_128 * 2 + 0x1234567890), (0x1234567890, 2));\n }\n\n #[test]\n fn check_decompose_large_values() {\n let large_field = 0xffffffffffffffff;\n let (lo, hi) = decompose(large_field);\n assert_eq(large_field, lo + TWO_POW_128 * hi);\n\n let large_value = large_field - TWO_POW_128;\n let (lo2, hi2) = decompose(large_value);\n assert_eq(large_value, lo2 + TWO_POW_128 * hi2);\n }\n\n #[test]\n fn check_lt_comprehensive() {\n assert(lt(0, 1));\n assert_lt(0, 1);\n assert(!lt(1, 0));\n assert(!lt(0, 0));\n assert(!lt(42, 42));\n\n assert(lt(TWO_POW_128 - 1, TWO_POW_128));\n assert(!lt(TWO_POW_128, TWO_POW_128 - 1));\n }\n}\n" }, "150": { "function_locations": [ { "name": "process_private_note_msg", "start": 2292 }, { "name": "attempt_note_discovery", "start": 3612 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/messages/discovery/private_notes.nr", "source": "use crate::{\n logging::{aztecnr_debug_log_format, aztecnr_warn_log_format},\n messages::{\n discovery::{ComputeNoteHash, ComputeNoteNullifier, nonce_discovery::attempt_note_nonce_discovery},\n encoding::MAX_MESSAGE_CONTENT_LEN,\n logs::note::{decode_private_note_message, MAX_NOTE_PACKED_LEN},\n processing::enqueue_note_for_validation,\n },\n protocol::{address::AztecAddress, constants::MAX_NOTE_HASHES_PER_TX, traits::ToField},\n};\n\n/// Processes a private note message, attempting to discover and enqueue any notes it contains.\n///\n/// For each note recovered from the message whose computed note hash matches a unique note hash in the transaction,\n/// a [`NoteValidationRequest`](crate::messages::processing::NoteValidationRequest) is pushed onto the ephemeral array\n/// at `NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT` via\n/// [`enqueue_note_for_validation`](crate::messages::processing::enqueue_note_for_validation). PXE later drains this\n/// array during `validate_and_store_enqueued_notes_and_events`, after which the notes are retrievable via `get_notes`.\n///\n/// Messages that fail to decode, or whose computed note hash matches nothing in the transaction, are discarded\n/// (with a debug or warning log respectively) and produce no validation requests. Decode failures are not treated\n/// as errors since messages may originate from malicious senders and we don't want them to be able to brick message\n/// processing.\n///\n/// ## Use Cases\n///\n/// This function is invoked automatically by aztec-nr when handling messages with the built-in private note type id,\n/// so contracts do not normally need to call it directly. It is exposed for use by custom message handlers (see\n/// [`CustomMessageHandler`](crate::messages::discovery::CustomMessageHandler)) that might want to use the standard\n/// note message processing pipeline while extending it with custom logic.\npub unconstrained fn process_private_note_msg(\n contract_address: AztecAddress,\n tx_hash: Field,\n unique_note_hashes_in_tx: BoundedVec,\n first_nullifier_in_tx: Field,\n compute_note_hash: ComputeNoteHash,\n compute_note_nullifier: ComputeNoteNullifier,\n msg_metadata: u64,\n msg_content: BoundedVec,\n) {\n let decoded = decode_private_note_message(msg_metadata, msg_content);\n\n if decoded.is_some() {\n let (note_type_id, owner, storage_slot, randomness, packed_note) = decoded.unwrap();\n\n attempt_note_discovery(\n contract_address,\n tx_hash,\n unique_note_hashes_in_tx,\n first_nullifier_in_tx,\n compute_note_hash,\n compute_note_nullifier,\n owner,\n storage_slot,\n randomness,\n note_type_id,\n packed_note,\n );\n } else {\n aztecnr_warn_log_format!(\n \"Could not decode private note message from tx {0}, ignoring\",\n )(\n [tx_hash],\n );\n }\n}\n\n/// Attempts discovery of a note given information about its contents and the transaction in which it is suspected the\n/// note was created.\nunconstrained fn attempt_note_discovery(\n contract_address: AztecAddress,\n tx_hash: Field,\n unique_note_hashes_in_tx: BoundedVec,\n first_nullifier_in_tx: Field,\n compute_note_hash: ComputeNoteHash,\n compute_note_nullifier: ComputeNoteNullifier,\n owner: AztecAddress,\n storage_slot: Field,\n randomness: Field,\n note_type_id: Field,\n packed_note: BoundedVec,\n) {\n let discovered_notes = attempt_note_nonce_discovery(\n unique_note_hashes_in_tx,\n first_nullifier_in_tx,\n compute_note_hash,\n compute_note_nullifier,\n contract_address,\n owner,\n storage_slot,\n randomness,\n note_type_id,\n packed_note,\n );\n\n if discovered_notes.len() == 0 {\n // A private note message that results in no discovered notes means none of the computed note hashes matched\n // any unique note hash in the transaction. This could indicate a malformed or malicious message (e.g. a sender\n // providing bogus note content).\n aztecnr_warn_log_format!(\n \"Discarding private note message from tx {0} for contract {1}: no matching note hash found in the tx\",\n )(\n [tx_hash, contract_address.to_field()],\n );\n } else {\n aztecnr_debug_log_format!(\n \"Discovered {0} notes from a private message for contract {1}\",\n )(\n [discovered_notes.len() as Field, contract_address.to_field()],\n );\n }\n\n discovered_notes.for_each(|discovered_note| {\n enqueue_note_for_validation(\n contract_address,\n owner,\n storage_slot,\n randomness,\n discovered_note.note_nonce,\n packed_note,\n discovered_note.note_hash,\n discovered_note.inner_nullifier,\n tx_hash,\n );\n });\n}\n" }, "151": { "function_locations": [ { "name": "process_message_ciphertext", "start": 1924 }, { "name": "process_message_plaintext", "start": 2851 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/messages/discovery/process_message.nr", "source": "use crate::messages::{\n discovery::{\n ComputeNoteHash, ComputeNoteNullifier, CustomMessageHandler, private_events::process_private_event_msg,\n private_notes::process_private_note_msg,\n },\n encoding::{decode_message, MESSAGE_CIPHERTEXT_LEN, MESSAGE_PLAINTEXT_LEN},\n encryption::{aes128::AES128, message_encryption::MessageEncryption},\n msg_type::{\n MIN_CUSTOM_MSG_TYPE_ID, PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID, PRIVATE_EVENT_MSG_TYPE_ID, PRIVATE_NOTE_MSG_TYPE_ID,\n },\n processing::ResolvedTx,\n};\n\nuse crate::logging::{aztecnr_debug_log, aztecnr_warn_log_format};\nuse crate::partial_notes::process_partial_note_private_msg;\nuse crate::protocol::address::AztecAddress;\n\n/// Processes a message that can contain notes, partial notes, or events.\n///\n/// Notes result in nonce discovery being performed prior to delivery, which requires knowledge of the transaction hash\n/// in which the notes would've been created (typically the same transaction in which the log was emitted), along with\n/// the list of unique note hashes in said transaction and the `compute_note_hash` and `compute_note_nullifier`\n/// functions. Once discovered, the notes are enqueued for validation.\n///\n/// Partial notes result in a pending partial note entry being stored in a PXE capsule, which will later be retrieved\n/// to search for the note's completion public log.\n///\n/// Events are processed by computing an event commitment from the serialized event data and its randomness field, then\n/// enqueueing the event data and commitment for validation.\npub unconstrained fn process_message_ciphertext(\n contract_address: AztecAddress,\n compute_note_hash: ComputeNoteHash,\n compute_note_nullifier: ComputeNoteNullifier,\n process_custom_message: Option,\n message_ciphertext: BoundedVec,\n resolved_tx: ResolvedTx,\n recipient: AztecAddress,\n) {\n let message_plaintext_option = AES128::decrypt(message_ciphertext, recipient, contract_address);\n\n if message_plaintext_option.is_some() {\n process_message_plaintext(\n contract_address,\n compute_note_hash,\n compute_note_nullifier,\n process_custom_message,\n message_plaintext_option.unwrap(),\n resolved_tx,\n recipient,\n );\n } else {\n aztecnr_warn_log_format!(\"Could not decrypt message ciphertext from tx {0}, ignoring\")([resolved_tx.tx_hash]);\n }\n}\n\npub(crate) unconstrained fn process_message_plaintext(\n contract_address: AztecAddress,\n compute_note_hash: ComputeNoteHash,\n compute_note_nullifier: ComputeNoteNullifier,\n process_custom_message: Option,\n message_plaintext: BoundedVec,\n resolved_tx: ResolvedTx,\n recipient: AztecAddress,\n) {\n // The first thing to do after decrypting the message is to determine what type of message we're processing. We\n // have 3 message types: private notes, partial notes and events.\n\n // We decode the message to obtain the message type id, metadata and content.\n let decoded = decode_message(message_plaintext);\n\n if decoded.is_some() {\n let (msg_type_id, msg_metadata, msg_content) = decoded.unwrap();\n\n if msg_type_id == PRIVATE_NOTE_MSG_TYPE_ID {\n aztecnr_debug_log!(\"Processing private note msg\");\n\n process_private_note_msg(\n contract_address,\n resolved_tx.tx_hash,\n resolved_tx.unique_note_hashes_in_tx,\n resolved_tx.first_nullifier_in_tx,\n compute_note_hash,\n compute_note_nullifier,\n msg_metadata,\n msg_content,\n );\n } else if msg_type_id == PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID {\n aztecnr_debug_log!(\"Processing partial note private msg\");\n\n process_partial_note_private_msg(\n contract_address,\n msg_metadata,\n msg_content,\n resolved_tx,\n recipient,\n );\n } else if msg_type_id == PRIVATE_EVENT_MSG_TYPE_ID {\n aztecnr_debug_log!(\"Processing private event msg\");\n\n process_private_event_msg(\n contract_address,\n msg_metadata,\n msg_content,\n resolved_tx.tx_hash,\n );\n } else if msg_type_id < MIN_CUSTOM_MSG_TYPE_ID {\n // The message type ID falls in the range reserved for aztec.nr built-in types but wasn't matched above.\n // This most likely means the message is malformed or a custom message was incorrectly assigned a reserved\n // ID. Custom message types must use IDs allocated via `custom_msg_type_id`.\n aztecnr_warn_log_format!(\n \"Message type ID {0} is in the reserved range but is not recognized, ignoring. See https://docs.aztec.network/errors/3\",\n )(\n [msg_type_id as Field],\n );\n } else if process_custom_message.is_some() {\n process_custom_message.unwrap()(\n contract_address,\n msg_type_id,\n msg_metadata,\n msg_content,\n resolved_tx,\n recipient,\n );\n } else {\n // A custom message was received but no handler is configured. This likely means the contract emits custom\n // messages but forgot to register a handler via `AztecConfig::custom_message_handler`.\n aztecnr_warn_log_format!(\n \"Received custom message with type id {0} but no handler is configured, ignoring. See https://docs.aztec.network/errors/2\",\n )(\n [msg_type_id as Field],\n );\n }\n } else {\n aztecnr_warn_log_format!(\"Could not decode message plaintext from tx {0}, ignoring\")([resolved_tx.tx_hash]);\n }\n}\n" }, "152": { "function_locations": [ { "name": "encode_message", "start": 4136 }, { "name": "decode_message", "start": 5594 }, { "name": "to_expanded_metadata", "start": 6617 }, { "name": "from_expanded_metadata", "start": 7131 }, { "name": "tests::encode_decode_empty_message", "start": 7894 }, { "name": "tests::encode_decode_short_message", "start": 8444 }, { "name": "tests::encode_decode_full_message", "start": 9090 }, { "name": "tests::to_expanded_metadata_packing", "start": 9628 }, { "name": "tests::from_expanded_metadata_packing", "start": 10713 }, { "name": "tests::to_from_expanded_metadata", "start": 11770 }, { "name": "tests::encode_decode_max_size_message", "start": 12151 }, { "name": "tests::encode_oversized_message_fails", "start": 12934 }, { "name": "tests::decode_empty_message_returns_none", "start": 13123 }, { "name": "tests::decode_message_with_oversized_metadata_returns_none", "start": 13280 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/messages/encoding.nr", "source": "// TODO(#12750): don't make these values assume we're using AES.\nuse crate::protocol::constants::PRIVATE_LOG_CIPHERTEXT_LEN;\nuse crate::utils::array;\n\n// We reassign to the constant here to communicate the distinction between a log and a message. In Aztec.nr, unlike in\n// protocol circuits, we have a concept of a message that can be emitted either as a private log or as an offchain\n// message. Message is a piece of data that is to be eventually delivered to a contract via the `process_message(...)`\n// utility function function that is injected by the #[aztec] macro. Note: PRIVATE_LOG_CIPHERTEXT_LEN is an amount of\n// fields, so MESSAGE_CIPHERTEXT_LEN is the size of the message in fields.\npub global MESSAGE_CIPHERTEXT_LEN: u32 = PRIVATE_LOG_CIPHERTEXT_LEN;\n\n// TODO(#12750): The global variables below should not be here as they are AES128 specific.\n// The header plaintext is 2 bytes (ciphertext length), padded to the 16-byte AES block size by PKCS#7.\npub(crate) global HEADER_CIPHERTEXT_SIZE_IN_BYTES: u32 = 16;\n// AES PKCS#7 always adds at least one byte of padding. Since each plaintext field is 32 bytes (a multiple of the\n// 16-byte AES block size), a full 16-byte padding block is always appended.\npub(crate) global AES128_PKCS7_EXPANSION_IN_BYTES: u32 = 16;\n\npub global EPH_PK_X_SIZE_IN_FIELDS: u32 = 1;\n\n// (15 - 1) * 31 - 16 - 16 = 402. Note: We multiply by 31 because ciphertext bytes are stored in fields using\n// encode_bytes_as_fields, which packs 31 bytes per field (since a Field is ~254 bits and can safely store 31 whole\n// bytes).\npub(crate) global MESSAGE_PLAINTEXT_SIZE_IN_BYTES: u32 = (MESSAGE_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS) * 31\n - HEADER_CIPHERTEXT_SIZE_IN_BYTES\n - AES128_PKCS7_EXPANSION_IN_BYTES;\n// The plaintext bytes represent Field values that were originally serialized using encode_fields_as_bytes, which\n// converts each Field to 32 bytes. To convert the plaintext bytes back to fields, we divide by 32. 402 / 32 = 12\npub global MESSAGE_PLAINTEXT_LEN: u32 = MESSAGE_PLAINTEXT_SIZE_IN_BYTES / 32;\n\npub global MESSAGE_EXPANDED_METADATA_LEN: u32 = 1;\n\n// The standard message layout is composed of:\n// - an initial field called the 'expanded metadata'\n// - an arbitrary number of fields following that called the 'message content'\n//\n// ```\n// message: [ msg_expanded_metadata, ...msg_content ]\n// ```\n//\n// The expanded metadata itself is interpreted as a u128, of which:\n// - the upper 64 bits are the message type id\n// - the lower 64 bits are called the 'message metadata'\n//\n// ```\n// msg_expanded_metadata: [ msg_type_id | msg_metadata ]\n// <--- 64 bits --->|<--- 64 bits --->\n// ```\n//\n// The meaning of the message metadata and message content depend on the value of the message type id. Note that there\n// is nothing special about the message metadata, it _can_ be considered part of the content. It just has a different\n// name to make it distinct from the message content given that it is not a full field.\n\n/// The maximum length of a message's content, i.e. not including the expanded message metadata.\npub global MAX_MESSAGE_CONTENT_LEN: u32 = MESSAGE_PLAINTEXT_LEN - MESSAGE_EXPANDED_METADATA_LEN;\n\n/// Encodes a message following aztec-nr's standard message encoding. This message can later be decoded with\n/// `decode_message` to retrieve the original values.\n///\n/// - The `msg_type` is an identifier that groups types of messages that are all processed the same way, e.g. private\n/// notes or events. Possible values are defined in `aztec::messages::msg_type`.\n/// - The `msg_metadata` and `msg_content` are the values stored in the message, whose meaning depends on the\n/// `msg_type`. The only special thing about `msg_metadata` that separates it from `msg_content` is that it is a u64\n/// instead of a full Field (due to details of how messages are encoded), allowing applications that can fit values\n/// into this smaller variable to achieve higher data efficiency.\npub fn encode_message(\n msg_type: u64,\n msg_metadata: u64,\n msg_content: [Field; N],\n) -> [Field; (N + MESSAGE_EXPANDED_METADATA_LEN)] {\n std::static_assert(\n msg_content.len() <= MAX_MESSAGE_CONTENT_LEN,\n \"Invalid message content: it must have a length of at most MAX_MESSAGE_CONTENT_LEN\",\n );\n\n // If MESSAGE_EXPANDED_METADATA_LEN is changed, causing the assertion below to fail, then the destructuring of the\n // message encoding below must be updated as well.\n std::static_assert(\n MESSAGE_EXPANDED_METADATA_LEN == 1,\n \"unexpected value for MESSAGE_EXPANDED_METADATA_LEN\",\n );\n let mut message: [Field; (N + MESSAGE_EXPANDED_METADATA_LEN)] = std::mem::zeroed();\n\n message[0] = to_expanded_metadata(msg_type, msg_metadata);\n for i in 0..msg_content.len() {\n message[MESSAGE_EXPANDED_METADATA_LEN + i] = msg_content[i];\n }\n\n message\n}\n\n/// Decodes a standard aztec-nr message, i.e. one created via `encode_message`, returning the original encoded values.\n///\n/// Returns `None` if the message is empty or has invalid (>128 bit) expanded metadata.\n///\n/// Note that `encode_message` returns a fixed size array while this function takes a `BoundedVec`: this is because\n/// prior to decoding the message type is unknown, and consequentially not known at compile time. If working with\n/// fixed-size messages, consider using `BoundedVec::from_array` to convert them.\npub unconstrained fn decode_message(\n message: BoundedVec,\n) -> Option<(u64, u64, BoundedVec)> {\n Option::some(message)\n .and_then(|message| {\n // If MESSAGE_EXPANDED_METADATA_LEN is changed, causing the assertion below to fail, then the destructuring\n // of the\n // message encoding below must be updated as well.\n std::static_assert(\n MESSAGE_EXPANDED_METADATA_LEN == 1,\n \"unexpected value for MESSAGE_EXPANDED_METADATA_LEN\",\n );\n if message.len() < MESSAGE_EXPANDED_METADATA_LEN {\n Option::none()\n } else {\n Option::some(message.get(0))\n }\n })\n .and_then(|msg_expanded_metadata| from_expanded_metadata(msg_expanded_metadata))\n .map(|(msg_type_id, msg_metadata)| {\n let msg_content = array::subbvec(message, MESSAGE_EXPANDED_METADATA_LEN);\n (msg_type_id, msg_metadata, msg_content)\n })\n}\n\nglobal U64_SHIFT_MULTIPLIER: Field = 2.pow_32(64);\n\nfn to_expanded_metadata(msg_type: u64, msg_metadata: u64) -> Field {\n // We use multiplication instead of bit shifting operations to shift the type bits as bit shift operations are\n // expensive in circuits.\n let type_field: Field = (msg_type as Field) * U64_SHIFT_MULTIPLIER;\n let msg_metadata_field = msg_metadata as Field;\n\n type_field + msg_metadata_field\n}\n\nglobal TWO_POW_128: Field = 2.pow_32(128);\n\n/// Unpacks expanded metadata into (msg_type, msg_metadata). Returns `None` if `input >= 2^128`.\nfn from_expanded_metadata(input: Field) -> Option<(u64, u64)> {\n if input.lt(TWO_POW_128) {\n let msg_metadata = (input as u64);\n let msg_type = ((input - (msg_metadata as Field)) / U64_SHIFT_MULTIPLIER) as u64;\n // Use division instead of bit shift since bit shifts are expensive in circuits\n Option::some((msg_type, msg_metadata))\n } else {\n Option::none()\n }\n}\n\nmod tests {\n use crate::utils::array::subarray::subarray;\n use super::{\n decode_message, encode_message, from_expanded_metadata, MAX_MESSAGE_CONTENT_LEN, to_expanded_metadata,\n TWO_POW_128,\n };\n\n global U64_MAX: u64 = (2.pow_32(64) - 1) as u64;\n global U128_MAX: Field = (2.pow_32(128) - 1);\n\n #[test]\n unconstrained fn encode_decode_empty_message(msg_type: u64, msg_metadata: u64) {\n let encoded = encode_message(msg_type, msg_metadata, []);\n let (decoded_msg_type, decoded_msg_metadata, decoded_msg_content) =\n decode_message(BoundedVec::from_array(encoded)).unwrap();\n\n assert_eq(decoded_msg_type, msg_type);\n assert_eq(decoded_msg_metadata, msg_metadata);\n assert_eq(decoded_msg_content.len(), 0);\n }\n\n #[test]\n unconstrained fn encode_decode_short_message(\n msg_type: u64,\n msg_metadata: u64,\n msg_content: [Field; MAX_MESSAGE_CONTENT_LEN / 2],\n ) {\n let encoded = encode_message(msg_type, msg_metadata, msg_content);\n let (decoded_msg_type, decoded_msg_metadata, decoded_msg_content) =\n decode_message(BoundedVec::from_array(encoded)).unwrap();\n\n assert_eq(decoded_msg_type, msg_type);\n assert_eq(decoded_msg_metadata, msg_metadata);\n assert_eq(decoded_msg_content.len(), msg_content.len());\n assert_eq(subarray(decoded_msg_content.storage(), 0), msg_content);\n }\n\n #[test]\n unconstrained fn encode_decode_full_message(\n msg_type: u64,\n msg_metadata: u64,\n msg_content: [Field; MAX_MESSAGE_CONTENT_LEN],\n ) {\n let encoded = encode_message(msg_type, msg_metadata, msg_content);\n let (decoded_msg_type, decoded_msg_metadata, decoded_msg_content) =\n decode_message(BoundedVec::from_array(encoded)).unwrap();\n\n assert_eq(decoded_msg_type, msg_type);\n assert_eq(decoded_msg_metadata, msg_metadata);\n assert_eq(decoded_msg_content.len(), msg_content.len());\n assert_eq(subarray(decoded_msg_content.storage(), 0), msg_content);\n }\n\n #[test]\n unconstrained fn to_expanded_metadata_packing() {\n // Test case 1: All bits set\n let packed = to_expanded_metadata(U64_MAX, U64_MAX);\n let (msg_type, msg_metadata) = from_expanded_metadata(packed).unwrap();\n assert_eq(msg_type, U64_MAX);\n assert_eq(msg_metadata, U64_MAX);\n\n // Test case 2: Only log type bits set\n let packed = to_expanded_metadata(U64_MAX, 0);\n let (msg_type, msg_metadata) = from_expanded_metadata(packed).unwrap();\n assert_eq(msg_type, U64_MAX);\n assert_eq(msg_metadata, 0);\n\n // Test case 3: Only msg_metadata bits set\n let packed = to_expanded_metadata(0, U64_MAX);\n let (msg_type, msg_metadata) = from_expanded_metadata(packed).unwrap();\n assert_eq(msg_type, 0);\n assert_eq(msg_metadata, U64_MAX);\n\n // Test case 4: No bits set\n let packed = to_expanded_metadata(0, 0);\n let (msg_type, msg_metadata) = from_expanded_metadata(packed).unwrap();\n assert_eq(msg_type, 0);\n assert_eq(msg_metadata, 0);\n }\n\n #[test]\n unconstrained fn from_expanded_metadata_packing() {\n // Test case 1: All bits set\n let input = U128_MAX as Field;\n let (msg_type, msg_metadata) = from_expanded_metadata(input).unwrap();\n assert_eq(msg_type, U64_MAX);\n assert_eq(msg_metadata, U64_MAX);\n\n // Test case 2: Only log type bits set\n let input = (U128_MAX - U64_MAX as Field);\n let (msg_type, msg_metadata) = from_expanded_metadata(input).unwrap();\n assert_eq(msg_type, U64_MAX);\n assert_eq(msg_metadata, 0);\n\n // Test case 3: Only msg_metadata bits set\n let input = U64_MAX as Field;\n let (msg_type, msg_metadata) = from_expanded_metadata(input).unwrap();\n assert_eq(msg_type, 0);\n assert_eq(msg_metadata, U64_MAX);\n\n // Test case 4: No bits set\n let input = 0;\n let (msg_type, msg_metadata) = from_expanded_metadata(input).unwrap();\n assert_eq(msg_type, 0);\n assert_eq(msg_metadata, 0);\n }\n\n #[test]\n unconstrained fn to_from_expanded_metadata(original_msg_type: u64, original_msg_metadata: u64) {\n let packed = to_expanded_metadata(original_msg_type, original_msg_metadata);\n let (unpacked_msg_type, unpacked_msg_metadata) = from_expanded_metadata(packed).unwrap();\n\n assert_eq(original_msg_type, unpacked_msg_type);\n assert_eq(original_msg_metadata, unpacked_msg_metadata);\n }\n\n #[test]\n unconstrained fn encode_decode_max_size_message() {\n let msg_type_id: u64 = 42;\n let msg_metadata: u64 = 99;\n let mut msg_content = [0; MAX_MESSAGE_CONTENT_LEN];\n for i in 0..MAX_MESSAGE_CONTENT_LEN {\n msg_content[i] = i as Field;\n }\n\n let encoded = encode_message(msg_type_id, msg_metadata, msg_content);\n let (decoded_type_id, decoded_metadata, decoded_content) =\n decode_message(BoundedVec::from_array(encoded)).unwrap();\n\n assert_eq(decoded_type_id, msg_type_id);\n assert_eq(decoded_metadata, msg_metadata);\n assert_eq(decoded_content, BoundedVec::from_array(msg_content));\n }\n\n #[test(should_fail_with = \"Invalid message content: it must have a length of at most MAX_MESSAGE_CONTENT_LEN\")]\n fn encode_oversized_message_fails() {\n let msg_content = [0; MAX_MESSAGE_CONTENT_LEN + 1];\n let _ = encode_message(0, 0, msg_content);\n }\n\n #[test]\n unconstrained fn decode_empty_message_returns_none() {\n assert(decode_message(BoundedVec::new()).is_none());\n }\n\n #[test]\n unconstrained fn decode_message_with_oversized_metadata_returns_none() {\n let message = BoundedVec::from_array([TWO_POW_128]);\n assert(decode_message(message).is_none());\n }\n}\n" }, "153": { "function_locations": [ { "name": "extract_many_close_to_uniformly_random_256_bits_using_poseidon2", "start": 1764 }, { "name": "derive_aes_symmetric_key_and_iv_from_uniformly_random_256_bits", "start": 4783 }, { "name": "derive_aes_symmetric_key_and_iv_from_shared_secret", "start": 5332 }, { "name": "::encrypt", "start": 10365 }, { "name": "::decrypt", "start": 17702 }, { "name": "encode_header", "start": 22154 }, { "name": "extract_ciphertext_length", "start": 22485 }, { "name": "unmask_field", "start": 23070 }, { "name": "random_address_point", "start": 23483 }, { "name": "test::encrypt_decrypt_deterministic", "start": 24685 }, { "name": "test::encrypt_decrypt_random", "start": 27520 }, { "name": "test::encrypt_to_invalid_address", "start": 28366 }, { "name": "test::pkcs7_padding_always_adds_at_least_one_byte", "start": 28816 }, { "name": "test::encrypt_decrypt_max_size_plaintext", "start": 29380 }, { "name": "test::encrypt_oversized_plaintext", "start": 30279 }, { "name": "test::random_address_point_produces_valid_points", "start": 30637 }, { "name": "test::decrypt_invalid_ephemeral_public_key", "start": 31088 }, { "name": "test::decrypt_returns_none_on_empty_ciphertext", "start": 31933 }, { "name": "test::decrypt_returns_none_on_empty_header", "start": 32487 }, { "name": "test::decrypt_returns_none_on_oversized_ciphertext_length", "start": 33413 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/messages/encryption/aes128.nr", "source": "use crate::protocol::{address::AztecAddress, public_keys::AddressPoint, traits::ToField};\n\nuse crate::{\n keys::{\n ecdh_shared_secret::{\n compute_app_siloed_shared_secret, derive_ecdh_shared_secret, derive_shared_secret_field_mask,\n derive_shared_secret_subkey,\n },\n ephemeral::generate_positive_ephemeral_key_pair,\n },\n logging::aztecnr_warn_log_format,\n messages::{\n encoding::{\n EPH_PK_X_SIZE_IN_FIELDS, HEADER_CIPHERTEXT_SIZE_IN_BYTES, MESSAGE_CIPHERTEXT_LEN, MESSAGE_PLAINTEXT_LEN,\n MESSAGE_PLAINTEXT_SIZE_IN_BYTES,\n },\n encryption::message_encryption::MessageEncryption,\n logs::arithmetic_generics_utils::{\n get_arr_of_size__message_bytes__from_PT, get_arr_of_size__message_bytes_padding__from_PT,\n },\n },\n oracle::{aes128_decrypt::try_aes128_decrypt, random::random, shared_secret::get_shared_secret},\n utils::{\n array,\n conversion::{\n bytes_as_fields::{decode_bytes_from_fields, encode_bytes_as_fields},\n fields_as_bytes::{encode_fields_as_bytes, try_decode_fields_from_bytes},\n },\n point::point_from_x_coord_and_sign,\n },\n};\n\nuse std::aes128::aes128_encrypt;\n\n/// Computes N close-to-uniformly-random 256 bits from a given app-siloed shared secret.\n///\n/// NEVER re-use the same iv and sym_key. DO NOT call this function more than once with the same s_app.\n///\n/// This function is only known to be safe if s_app is derived from combining a random ephemeral key with an\n/// address point and a contract address. See big comment within the body of the function.\nfn extract_many_close_to_uniformly_random_256_bits_using_poseidon2(s_app: Field) -> [[u8; 32]; N] {\n /*\n * Unsafe because of https://eprint.iacr.org/2010/264.pdf Page 13, Lemma 2 (and the two paragraphs below it).\n *\n * If you call this function, you need to be careful and aware of how the arg `s_app` has been derived.\n *\n * The paper says that the way you derive aes keys and IVs should be fine with poseidon2 (modelled as a RO),\n * as long as you _don't_ use Poseidon2 as a PRG to generate the two exponents x & y which multiply to the\n * shared secret S:\n *\n * S = [x*y]*G.\n *\n * (Otherwise, you would have to \"key\" poseidon2, i.e. generate a uniformly string K which can be public and\n * compute Hash(x) as poseidon(K,x)).\n * In that lemma, k would be 2*254=508, and m would be the number of points on the grumpkin curve (which is\n * close to r according to the Hasse bound).\n *\n * Our shared secret S is [esk * address_sk] * G, and the question is: Can we compute hash(S) using poseidon2\n * instead of sha256?\n *\n * Well, esk is random and not generated with poseidon2, so that's good.\n * What about address_sk?\n * Well, address_sk = poseidon2(stuff) + ivsk, so there was some discussion about whether address_sk is\n * independent of poseidon2. Given that ivsk is random and independent of poseidon2, the address_sk is also\n * independent of poseidon2.\n *\n * Tl;dr: we believe it's safe to hash S = [esk * address_sk] * G using poseidon2, in order to derive a\n * symmetric key.\n *\n * If you're calling this function for a differently-derived `s_app`, be careful.\n */\n \n\n /* The output of this function needs to be 32 random bytes.\n * A single field won't give us 32 bytes of entropy. So we compute two \"random\" fields, by poseidon-hashing\n * with two different indices. We then extract the last 16 (big endian) bytes of each \"random\" field.\n * Note: we use to_be_bytes because it's slightly more efficient. But we have to be careful not to take bytes\n * from the \"big end\", because the \"big\" byte is not uniformly random over the byte: it only has < 6 bits of\n * randomness, because it's the big end of a 254-bit field element.\n */\n\n let mut all_bytes: [[u8; 32]; N] = std::mem::zeroed();\n std::static_assert(N < 256, \"N too large\");\n for k in 0..N {\n let rand1: Field = derive_shared_secret_subkey(s_app, 2 * k);\n let rand2: Field = derive_shared_secret_subkey(s_app, 2 * k + 1);\n\n let rand1_bytes: [u8; 32] = rand1.to_be_bytes();\n let rand2_bytes: [u8; 32] = rand2.to_be_bytes();\n\n let mut bytes: [u8; 32] = [0; 32];\n for i in 0..16 {\n // We take bytes from the \"little end\" of the be-bytes arrays:\n let j = 32 - i - 1;\n bytes[i] = rand1_bytes[j];\n bytes[16 + i] = rand2_bytes[j];\n }\n\n all_bytes[k] = bytes;\n }\n\n all_bytes\n}\n\nfn derive_aes_symmetric_key_and_iv_from_uniformly_random_256_bits(\n many_random_256_bits: [[u8; 32]; N],\n) -> [([u8; 16], [u8; 16]); N] {\n // Many (sym_key, iv) pairs:\n let mut many_pairs: [([u8; 16], [u8; 16]); N] = std::mem::zeroed();\n for k in 0..N {\n let random_256_bits = many_random_256_bits[k];\n let mut sym_key = [0; 16];\n let mut iv = [0; 16];\n for i in 0..16 {\n sym_key[i] = random_256_bits[i];\n iv[i] = random_256_bits[i + 16];\n }\n many_pairs[k] = (sym_key, iv);\n }\n\n many_pairs\n}\n\npub fn derive_aes_symmetric_key_and_iv_from_shared_secret(s_app: Field) -> [([u8; 16], [u8; 16]); N] {\n let many_random_256_bits: [[u8; 32]; N] = extract_many_close_to_uniformly_random_256_bits_using_poseidon2(s_app);\n\n derive_aes_symmetric_key_and_iv_from_uniformly_random_256_bits(many_random_256_bits)\n}\n\npub struct AES128 {}\n\nimpl MessageEncryption for AES128 {\n\n /// AES128-CBC encryption for Aztec protocol messages.\n ///\n /// ## Overview\n ///\n /// The plaintext is an array of up to `MESSAGE_PLAINTEXT_LEN` (12) fields. The output is always exactly\n /// `MESSAGE_CIPHERTEXT_LEN` (15) fields, regardless of plaintext size. All output fields except the\n /// ephemeral public key are uniformly random `Field` values to any observer without knowledge of the\n /// shared secret, making all encrypted messages indistinguishable by size or content.\n ///\n /// ## PKCS#7 Padding\n ///\n /// AES operates on 16-byte blocks, so the plaintext must be padded to a multiple of 16. PKCS#7 padding always\n /// adds at least 1 byte (so the receiver can always detect and strip it), which means:\n /// - 1 B plaintext -> 15 B padding -> 16 B total\n /// - 15 B plaintext -> 1 B padding -> 16 B total\n /// - 16 B plaintext -> 16 B padding -> 32 B total (full extra block)\n ///\n /// In general: if the plaintext is already a multiple of 16, a full 16-byte padding block is appended.\n ///\n /// ## Encryption Steps\n ///\n /// **1. Body encryption.** The plaintext fields are serialized to bytes (32 bytes per field) and AES-128-CBC\n /// encrypted. Since 32 is a multiple of 16, PKCS#7 always adds a full 16-byte padding block (see above):\n ///\n /// ```text\n /// +---------------------------------------------+\n /// | body ct |\n /// | PlaintextLen*32 + 16 B |\n /// +-------------------------------+--------------+\n /// | encrypted plaintext fields | PKCS#7 (16B) |\n /// | (serialized at 32 B each) | |\n /// +-------------------------------+--------------+\n /// ```\n ///\n /// **2. Header encryption.** The byte length of `body_ct` is stored as a 2-byte big-endian integer. This 2-byte\n /// header plaintext is then AES-encrypted; PKCS#7 pads the remaining 14 bytes to fill one 16-byte AES block,\n /// producing a 16-byte header ciphertext:\n ///\n /// ```text\n /// +---------------------------+\n /// | header ct |\n /// | 16 B |\n /// +--------+------------------+\n /// | body ct| PKCS#7 (14B) |\n /// | length | |\n /// | (2 B) | |\n /// +--------+------------------+\n /// ```\n ///\n /// ## Wire Format\n ///\n /// Messages are transmitted as fields, not bytes. A field is ~254 bits and can safely store 31 whole bytes, so\n /// we need to pack our byte data into 31-byte chunks. This packing drives the wire format.\n ///\n /// **Step 1 -- Assemble bytes.** The ciphertexts are laid out in a byte array, padded with zero bytes to a\n /// multiple of 31 so it divides evenly into fields:\n ///\n /// ```text\n /// +------------+-------------------------+---------+\n /// | header ct | body ct | byte pad|\n /// | 16 B | PlaintextLen*32 + 16 B | (zeros) |\n /// +------------+-------------------------+---------+\n /// |<-------- padded to a multiple of 31 B -------->|\n /// ```\n ///\n /// **Step 2 -- Pack and mask.** The byte array is split into 31-byte chunks, each stored in one field. A\n /// Poseidon2-derived mask (see `derive_shared_secret_field_mask`) is added to each so that the resulting\n /// fields appear as uniformly random `Field` values to any observer without knowledge of the shared secret,\n /// hiding the fact that the underlying ciphertext consists of 128-bit AES blocks.\n ///\n /// **Step 3 -- Assemble ciphertext.** The ephemeral public key x-coordinate is prepended and random field padding\n /// is appended to fill to 15 fields:\n ///\n /// ```text\n /// +----------+-------------------------+-------------------+\n /// | eph_pk.x | masked message fields | random field pad |\n /// | | (packed 31 B per field) | (fills to 15) |\n /// +----------+-------------------------+-------------------+\n /// |<---------- MESSAGE_CIPHERTEXT_LEN = 15 fields -------->|\n /// ```\n ///\n /// ## Key Derivation\n ///\n /// The raw ECDH shared secret point is first app-siloed into a scalar `s_app` by hashing with the contract\n /// address (see\n /// [`compute_app_siloed_shared_secret`](crate::keys::ecdh_shared_secret::compute_app_siloed_shared_secret)).\n /// Two (key, IV) pairs are then derived from `s_app` via indexed Poseidon2 hashing: one pair for the body\n /// ciphertext and one for the header ciphertext.\n fn encrypt(\n plaintext: [Field; PlaintextLen],\n recipient: AztecAddress,\n contract_address: AztecAddress,\n ) -> [Field; MESSAGE_CIPHERTEXT_LEN] {\n std::static_assert(\n PlaintextLen <= MESSAGE_PLAINTEXT_LEN,\n \"Plaintext length exceeds MESSAGE_PLAINTEXT_LEN\",\n );\n\n // AES 128 operates on bytes, not fields, so we need to convert the fields to bytes. (This process is then\n // reversed when processing the message in `process_message_ciphertext`)\n let plaintext_bytes = encode_fields_as_bytes(plaintext);\n\n // Derive ECDH shared secret with recipient using a fresh ephemeral keypair.\n let (eph_sk, eph_pk) = generate_positive_ephemeral_key_pair();\n\n let raw_shared_secret = derive_ecdh_shared_secret(\n eph_sk,\n recipient\n .to_address_point()\n .unwrap_or_else(|| {\n aztecnr_warn_log_format!(\n \"Attempted to encrypt message for an invalid recipient ({0})\",\n )(\n [recipient.to_field()],\n );\n\n // Safety: if the recipient is an invalid address, then it is not possible to encrypt a message for\n // them because we cannot establish a shared secret. This is never expected to occur during normal\n // operation. However, it is technically possible for us to receive an invalid address, and we must\n // therefore handle it. We could simply fail, but that'd introduce a potential security issue in\n // which an attacker forces a contract to encrypt a message for an invalid address, resulting in an\n // impossible transaction - this is sometimes called a 'king of the hill' attack. We choose instead\n // to not fail and encrypt the plaintext regardless using the shared secret that results from a\n // random valid address. The sender is free to choose this address and hence shared secret, but\n // this has no security implications as they already know not only the full plaintext but also the\n // ephemeral private key anyway.\n unsafe {\n random_address_point()\n }\n })\n .inner,\n );\n\n let s_app = compute_app_siloed_shared_secret(raw_shared_secret, contract_address);\n\n // It is safe to derive AES keys from `s_app` using Poseidon2 because `s_app` was derived from an ECDH shared\n // secret using an AztecAddress (the recipient). See the block comment in\n // `extract_many_close_to_uniformly_random_256_bits_using_poseidon2` for more info.\n let pairs = derive_aes_symmetric_key_and_iv_from_shared_secret::<2>(s_app);\n let (body_sym_key, body_iv) = pairs[0];\n let (header_sym_key, header_iv) = pairs[1];\n\n let ciphertext_bytes = aes128_encrypt(plaintext_bytes, body_iv, body_sym_key);\n\n // Each plaintext field is 32 bytes (a multiple of the 16-byte AES block\n // size), so PKCS#7 always appends a full 16-byte padding block:\n // |ciphertext| = PlaintextLen*32 + 16 = 16 * (1 + PlaintextLen*32 / 16)\n std::static_assert(\n ciphertext_bytes.len() == 16 * (1 + (PlaintextLen * 32) / 16),\n \"unexpected ciphertext length\",\n );\n\n // Encrypt a 2-byte header containing the body ciphertext length.\n let header_plaintext = encode_header(ciphertext_bytes.len());\n\n // Note: the aes128_encrypt builtin fn automatically appends bytes to the input, according to pkcs#7; hence why\n // the output `header_ciphertext_bytes` is 16 bytes larger than the input in this case.\n let header_ciphertext_bytes = aes128_encrypt(header_plaintext, header_iv, header_sym_key);\n // Verify expected header ciphertext size at compile time.\n std::static_assert(\n header_ciphertext_bytes.len() == HEADER_CIPHERTEXT_SIZE_IN_BYTES,\n \"unexpected ciphertext header length\",\n );\n\n // Assemble the message byte array:\n // [header_ct (16B)] [body_ct] [padding to mult of 31]\n let message_bytes_padding_to_mult_31 = get_arr_of_size__message_bytes_padding__from_PT::();\n\n let mut message_bytes = get_arr_of_size__message_bytes__from_PT::();\n\n std::static_assert(\n message_bytes.len() % 31 == 0,\n \"Unexpected error: message_bytes.len() should be divisible by 31, by construction.\",\n );\n\n let mut offset = 0;\n for i in 0..header_ciphertext_bytes.len() {\n message_bytes[offset + i] = header_ciphertext_bytes[i];\n }\n offset += header_ciphertext_bytes.len();\n\n for i in 0..ciphertext_bytes.len() {\n message_bytes[offset + i] = ciphertext_bytes[i];\n }\n offset += ciphertext_bytes.len();\n\n for i in 0..message_bytes_padding_to_mult_31.len() {\n message_bytes[offset + i] = message_bytes_padding_to_mult_31[i];\n }\n offset += message_bytes_padding_to_mult_31.len();\n\n // Ideally we would be able to have a static assert where we check that the offset would be such that we've\n // written to the entire log_bytes array, but we cannot since Noir does not treat the offset as a comptime\n // value (despite the values that it goes through being known at each stage). We instead check that the\n // computation used to obtain the offset computes the expected value (which we _can_ do in a static check), and\n // then add a cheap runtime check to also validate that the offset matches this.\n std::static_assert(\n header_ciphertext_bytes.len() + ciphertext_bytes.len() + message_bytes_padding_to_mult_31.len()\n == message_bytes.len(),\n \"unexpected message length\",\n );\n assert(offset == message_bytes.len(), \"unexpected encrypted message length\");\n\n // Pack message bytes into fields (31 bytes per field) and prepend eph_pk.x.\n let message_bytes_as_fields = encode_bytes_as_fields(message_bytes);\n\n let mut ciphertext: [Field; MESSAGE_CIPHERTEXT_LEN] = [0; MESSAGE_CIPHERTEXT_LEN];\n\n ciphertext[0] = eph_pk.x;\n\n // Mask each content field with a Poseidon2-derived value, so that they appear as uniformly random `Field`\n // values\n let mut offset = 1;\n for i in 0..message_bytes_as_fields.len() {\n let mask = derive_shared_secret_field_mask(s_app, i as u32);\n ciphertext[offset + i] = message_bytes_as_fields[i] + mask;\n }\n offset += message_bytes_as_fields.len();\n\n // Pad with random fields so that padding is indistinguishable from masked data fields.\n for i in offset..MESSAGE_CIPHERTEXT_LEN {\n // Safety: we assume that the sender wants for the message to be private - a malicious one could simply\n // reveal its contents publicly. It is therefore fine to trust the sender to provide random padding.\n ciphertext[i] = unsafe { random() };\n }\n\n ciphertext\n }\n\n unconstrained fn decrypt(\n ciphertext: BoundedVec,\n recipient: AztecAddress,\n contract_address: AztecAddress,\n ) -> Option> {\n // Extract the ephemeral public key x-coordinate and masked fields, returning None for empty ciphertext.\n if ciphertext.len() > 0 {\n let masked_fields: BoundedVec =\n array::subbvec(ciphertext, EPH_PK_X_SIZE_IN_FIELDS);\n Option::some((ciphertext.get(0), masked_fields))\n } else {\n Option::none()\n }\n .and_then(|(eph_pk_x, masked_fields)| {\n // With the x-coordinate of the ephemeral public key we can reconstruct the point as we know that the\n // y-coordinate must be positive. This may fail however, as not all x-coordinates are on the curve. In\n // that case, we simply return `Option::none`. Secret derivation may also fail when the PXE does not\n // hold the recipient's keys (e.g. when syncing the scope of an address we don't control), in which\n // case the message is undecryptable and equally skipped.\n point_from_x_coord_and_sign(eph_pk_x, true)\n .and_then(|eph_pk| get_shared_secret(recipient, eph_pk, contract_address))\n .and_then(|s_app| {\n let unmasked_fields = masked_fields.mapi(|i, field| {\n let unmasked = unmask_field(s_app, i, field);\n // If we failed to unmask the field, we are dealing with the random padding. We'll ignore it\n // later, so we can simply set it to 0\n unmasked.unwrap_or(0)\n });\n let ciphertext_without_eph_pk_x = decode_bytes_from_fields(unmasked_fields);\n\n // Derive symmetric keys:\n let pairs = derive_aes_symmetric_key_and_iv_from_shared_secret::<2>(s_app);\n let (body_sym_key, body_iv) = pairs[0];\n let (header_sym_key, header_iv) = pairs[1];\n\n // Extract the header ciphertext\n let header_start = 0;\n let header_ciphertext: [u8; HEADER_CIPHERTEXT_SIZE_IN_BYTES] =\n array::subarray(ciphertext_without_eph_pk_x.storage(), header_start);\n // We need to convert the array to a BoundedVec because the oracle expects a BoundedVec as it's\n // designed to work with messages with unknown length at compile time. This would not be\n // necessary here as the header ciphertext length is fixed. But we do it anyway to not have to\n // have duplicate oracles.\n let header_ciphertext_bvec =\n BoundedVec::::from_array(header_ciphertext);\n\n try_aes128_decrypt(header_ciphertext_bvec, header_iv, header_sym_key)\n // Extract ciphertext length from header (2 bytes, big-endian)\n .and_then(|header_plaintext| extract_ciphertext_length(header_plaintext))\n .filter(|ciphertext_length| ciphertext_length <= MESSAGE_PLAINTEXT_SIZE_IN_BYTES)\n .map(|ciphertext_length| {\n // Extract and decrypt main ciphertext\n let ciphertext_start = header_start + HEADER_CIPHERTEXT_SIZE_IN_BYTES;\n let ciphertext_with_padding: [u8; MESSAGE_PLAINTEXT_SIZE_IN_BYTES] =\n array::subarray(ciphertext_without_eph_pk_x.storage(), ciphertext_start);\n BoundedVec::from_parts(ciphertext_with_padding, ciphertext_length)\n })\n // Decrypt main ciphertext and return it\n .and_then(|ciphertext| try_aes128_decrypt(ciphertext, body_iv, body_sym_key))\n // Convert bytes back to fields (32 bytes per field). Returns None if the actual bytes are\n // not valid.\n .and_then(|plaintext_bytes| try_decode_fields_from_bytes(plaintext_bytes))\n })\n })\n }\n}\n\n/// Encodes the body ciphertext length into a 2-byte big-endian header.\nfn encode_header(ciphertext_length: u32) -> [u8; 2] {\n [(ciphertext_length >> 8) as u8, ciphertext_length as u8]\n}\n\n/// Extracts the body ciphertext length from a decrypted header as a 2-byte big-endian integer.\n///\n/// Returns `Option::none()` if the header has fewer than 2 bytes.\nunconstrained fn extract_ciphertext_length(header: BoundedVec) -> Option {\n if header.len() >= 2 {\n Option::some(((header.get(0) as u32) << 8) | (header.get(1) as u32))\n } else {\n Option::none()\n }\n}\n\n/// 2^248: upper bound for values that fit in 31 bytes\nglobal TWO_POW_248: Field = 2.pow_32(248);\n\n/// Removes the Poseidon2-derived mask from a ciphertext field. Returns the unmasked value if it fits in 31 bytes\n/// (a content field), or `None` if it doesn't (random padding). Unconstrained to prevent accidental use in\n/// constrained context.\nunconstrained fn unmask_field(s_app: Field, index: u32, masked: Field) -> Option {\n let unmasked = masked - derive_shared_secret_field_mask(s_app, index);\n if unmasked.lt(TWO_POW_248) {\n Option::some(unmasked)\n } else {\n Option::none()\n }\n}\n\n/// Produces a random valid address point, i.e. one that is on the curve. This is equivalent to calling\n/// [`AztecAddress::to_address_point`] on a random valid address.\nunconstrained fn random_address_point() -> AddressPoint {\n let mut result = std::mem::zeroed();\n\n loop {\n // We simply produce random x coordinates until we find one that is on the curve. About half of the x\n // coordinates fulfill this condition, so this should only take a few iterations at most.\n let x_coord = random();\n let point = point_from_x_coord_and_sign(x_coord, true);\n if point.is_some() {\n result = AddressPoint { inner: point.unwrap() };\n break;\n }\n }\n\n result\n}\n\nmod test {\n use crate::{\n ephemeral::EphemeralArray,\n keys::ecdh_shared_secret::{compute_app_siloed_shared_secret, derive_ecdh_shared_secret},\n messages::{\n encoding::{HEADER_CIPHERTEXT_SIZE_IN_BYTES, MESSAGE_PLAINTEXT_LEN, MESSAGE_PLAINTEXT_SIZE_IN_BYTES},\n encryption::message_encryption::MessageEncryption,\n },\n test::helpers::test_environment::TestEnvironment,\n };\n use crate::protocol::{address::AztecAddress, traits::FromField};\n use super::{AES128, encode_header, random_address_point};\n use std::{embedded_curve_ops::EmbeddedCurveScalar, test::OracleMock};\n\n #[test]\n unconstrained fn encrypt_decrypt_deterministic() {\n let env = TestEnvironment::new();\n\n // Message decryption requires oracles that are only available during private execution\n env.private_context(|context| {\n let contract_address = context.this_address();\n let plaintext = [1, 2, 3];\n\n let recipient = AztecAddress::from_field(\n 0x25afb798ea6d0b8c1618e50fdeafa463059415013d3b7c75d46abf5e242be70c,\n );\n\n // Mock random values for deterministic test\n let eph_sk = 0x1358d15019d4639393d62b97e1588c095957ce74a1c32d6ec7d62fe6705d9538;\n let _ = OracleMock::mock(\"aztec_misc_getRandomField\").returns(eph_sk).times(1);\n\n let randomness = 0x0101010101010101010101010101010101010101010101010101010101010101;\n let _ = OracleMock::mock(\"aztec_misc_getRandomField\").returns(randomness).times(1000000);\n\n // Encrypt the message\n let encrypted_message = BoundedVec::from_array(AES128::encrypt(plaintext, recipient, contract_address));\n\n // Compute the same app-siloed shared secret that the oracle would return\n let raw_shared_secret = derive_ecdh_shared_secret(\n EmbeddedCurveScalar::from_field(eph_sk),\n recipient.to_address_point().unwrap().inner,\n );\n let s_app = compute_app_siloed_shared_secret(raw_shared_secret, contract_address);\n\n // The shared-secrets oracle is batched: it returns a slot pointing at an EphemeralArray\n // populated with the per-key results. Set up that array with the single expected `s_app`\n // and mock the oracle to return its slot.\n let response_slot: Field = 99;\n let response_array: EphemeralArray = EphemeralArray::at(response_slot);\n response_array.push(s_app);\n let _ = OracleMock::mock(\"aztec_utl_getSharedSecrets\").returns(response_slot);\n\n // Decrypt the message\n let decrypted = AES128::decrypt(encrypted_message, recipient, contract_address).unwrap();\n\n // The decryption function spits out a BoundedVec because it's designed to work with messages with unknown\n // length at compile time. For this reason we need to convert the original input to a BoundedVec.\n let plaintext_bvec = BoundedVec::::from_array(plaintext);\n\n // Verify decryption matches original plaintext\n assert_eq(decrypted, plaintext_bvec, \"Decrypted bytes should match original plaintext\");\n\n // The following is a workaround of \"struct is never constructed\" Noir compilation error (we only ever use\n // static methods of the struct).\n let _ = AES128 {};\n });\n }\n\n #[test]\n unconstrained fn encrypt_decrypt_random() {\n // Same as `encrypt_decrypt_deterministic`, except we don't mock any of the oracles and rely on\n // `TestEnvironment` instead.\n let mut env = TestEnvironment::new();\n\n let recipient = env.create_light_account();\n\n env.private_context(|context| {\n let contract_address = context.this_address();\n let plaintext = [1, 2, 3];\n let ciphertext = AES128::encrypt(plaintext, recipient, contract_address);\n\n assert_eq(\n AES128::decrypt(\n BoundedVec::from_array(ciphertext),\n recipient,\n contract_address,\n )\n .unwrap(),\n BoundedVec::from_array(plaintext),\n );\n });\n }\n\n #[test]\n unconstrained fn encrypt_to_invalid_address() {\n // x = 3 is a non-residue for this curve, resulting in an invalid address\n let invalid_address = AztecAddress { inner: 3 };\n let contract_address = AztecAddress { inner: 42 };\n\n let _ = AES128::encrypt([1, 2, 3, 4], invalid_address, contract_address);\n }\n\n // Documents the PKCS#7 padding behavior that `encrypt` relies on (see its static_assert).\n #[test]\n fn pkcs7_padding_always_adds_at_least_one_byte() {\n let key = [0 as u8; 16];\n let iv = [0 as u8; 16];\n\n // 1 byte input + 15 bytes padding = 16 bytes\n assert_eq(std::aes128::aes128_encrypt([0; 1], iv, key).len(), 16);\n\n // 15 bytes input + 1 byte padding = 16 bytes\n assert_eq(std::aes128::aes128_encrypt([0; 15], iv, key).len(), 16);\n\n // 16 bytes input (block-aligned) + full 16-byte padding block = 32 bytes\n assert_eq(std::aes128::aes128_encrypt([0; 16], iv, key).len(), 32);\n }\n\n #[test]\n unconstrained fn encrypt_decrypt_max_size_plaintext() {\n let mut env = TestEnvironment::new();\n let recipient = env.create_light_account();\n\n env.private_context(|context| {\n let contract_address = context.this_address();\n let mut plaintext = [0; MESSAGE_PLAINTEXT_LEN];\n for i in 0..MESSAGE_PLAINTEXT_LEN {\n plaintext[i] = i as Field;\n }\n let ciphertext = AES128::encrypt(plaintext, recipient, contract_address);\n\n assert_eq(\n AES128::decrypt(\n BoundedVec::from_array(ciphertext),\n recipient,\n contract_address,\n )\n .unwrap(),\n BoundedVec::from_array(plaintext),\n );\n });\n }\n\n #[test(should_fail_with = \"Plaintext length exceeds MESSAGE_PLAINTEXT_LEN\")]\n unconstrained fn encrypt_oversized_plaintext() {\n let address = AztecAddress { inner: 3 };\n let contract_address = AztecAddress { inner: 42 };\n let plaintext: [Field; MESSAGE_PLAINTEXT_LEN + 1] = [0; MESSAGE_PLAINTEXT_LEN + 1];\n let _ = AES128::encrypt(plaintext, address, contract_address);\n }\n\n #[test]\n unconstrained fn random_address_point_produces_valid_points() {\n // About half of random addresses are invalid, so testing just a couple gives us high confidence that\n // `random_address_point` is indeed producing valid addresses.\n for _ in 0..10 {\n let random_address = AztecAddress { inner: random_address_point().inner.x };\n assert(random_address.to_address_point().is_some());\n }\n }\n\n #[test]\n unconstrained fn decrypt_invalid_ephemeral_public_key() {\n let mut env = TestEnvironment::new();\n\n let recipient = env.create_light_account();\n\n env.private_context(|context| {\n let contract_address = context.this_address();\n let plaintext = [1, 2, 3, 4];\n let ciphertext = AES128::encrypt(plaintext, recipient, contract_address);\n\n // The first field of the ciphertext is the x-coordinate of the ephemeral public key. We set it to a known\n // non-residue (3), causing `decrypt` to fail to produce a decryption shared secret.\n let mut bad_ciphertext = BoundedVec::from_array(ciphertext);\n bad_ciphertext.set(0, 3);\n\n assert(AES128::decrypt(bad_ciphertext, recipient, contract_address).is_none());\n });\n }\n\n #[test]\n unconstrained fn decrypt_returns_none_on_empty_ciphertext() {\n let mut env = TestEnvironment::new();\n let recipient = env.create_light_account();\n\n env.private_context(|context| {\n let contract_address = context.this_address();\n assert(AES128::decrypt(BoundedVec::new(), recipient, contract_address).is_none());\n });\n }\n\n // Mocks the header AES decrypt oracle to return an empty result. The TS oracle never throws on invalid\n // input: it decrypts to garbage bytes or returns empty\n #[test]\n unconstrained fn decrypt_returns_none_on_empty_header() {\n let mut env = TestEnvironment::new();\n let recipient = env.create_light_account();\n\n env.private_context(|context| {\n let contract_address = context.this_address();\n let plaintext = [1, 2, 3];\n let ciphertext = BoundedVec::from_array(AES128::encrypt(plaintext, recipient, contract_address));\n\n let empty_header = BoundedVec::::new();\n let _ = OracleMock::mock(\"aztec_utl_decryptAes128\").returns(Option::some(empty_header)).times(1);\n\n assert(AES128::decrypt(ciphertext, recipient, contract_address).is_none());\n });\n }\n\n // Mocks the header oracle to return a 2-byte header that decodes to a ciphertext_length one past the maximum\n // allowed value, verifying the edge case is handled correctly.\n #[test]\n unconstrained fn decrypt_returns_none_on_oversized_ciphertext_length() {\n let mut env = TestEnvironment::new();\n let recipient = env.create_light_account();\n\n env.private_context(|context| {\n let contract_address = context.this_address();\n let plaintext = [1, 2, 3];\n let ciphertext = BoundedVec::from_array(AES128::encrypt(plaintext, recipient, contract_address));\n\n let bad_header = BoundedVec::::from_array(encode_header(\n MESSAGE_PLAINTEXT_SIZE_IN_BYTES + 1,\n ));\n let _ = OracleMock::mock(\"aztec_utl_decryptAes128\").returns(Option::some(bad_header)).times(1);\n\n assert(AES128::decrypt(ciphertext, recipient, contract_address).is_none());\n });\n }\n\n}\n" }, "157": { "function_locations": [ { "name": "get_arr_of_size__full_plaintext", "start": 1146 }, { "name": "get_arr_of_size__plaintext_aes_padding", "start": 1318 }, { "name": "get_arr_of_size__ciphertext", "start": 1564 }, { "name": "get_arr_of_size__message_bytes_without_padding", "start": 1892 }, { "name": "get_arr_of_size__message_bytes_padding", "start": 2401 }, { "name": "get_arr_of_size__message_bytes", "start": 2746 }, { "name": "get_arr_of_size__message_bytes_padding__from_PT", "start": 3200 }, { "name": "get_arr_of_size__message_bytes__from_PT", "start": 3996 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/messages/logs/arithmetic_generics_utils.nr", "source": "use crate::messages::encoding::HEADER_CIPHERTEXT_SIZE_IN_BYTES;\n\n/// *****************************************************\n// Disgusting arithmetic on generics\n/// *****************************************************\n\n// In this section, instead of initializing arrays with very complicated generic arithmetic, such as: let my_arr: [u8;\n// (((Pt + (16 - (Pt % 16))) + (HEADER_CIPHERTEXT_SIZE_IN_BYTES + 1)) + ((((((Pt + (16 - (Pt % 16))) +\n// (HEADER_CIPHERTEXT_SIZE_IN_BYTES + 1)) + 30) / 31) * 31) - ((Pt + (16 - (Pt % 16))) +\n// (HEADER_CIPHERTEXT_SIZE_IN_BYTES + 1))))] = [0; (((Pt + (16 - (Pt % 16))) + (HEADER_CIPHERTEXT_SIZE_IN_BYTES + 1)) +\n// ((((((Pt + (16 - (Pt % 16))) + (HEADER_CIPHERTEXT_SIZE_IN_BYTES + 1)) + 30) / 31) * 31) - ((Pt + (16 - (Pt % 16))) +\n// (HEADER_CIPHERTEXT_SIZE_IN_BYTES + 1))))]; ... we instead do the arithmetic a little bit at a time, so that the\n// computation can be audited and understood. Now, we can't do arithmetic on generics in the body of a function, so we\n// abusing functions in the following way:\n\n// |full_pt| = |pt| = (N * 32) + 64\nfn get_arr_of_size__full_plaintext() -> [u8; Pt] {\n [0; Pt]\n}\n\n// |pt_aes_padding| = 16 - (|full_pt| % 16)\nfn get_arr_of_size__plaintext_aes_padding(_full_pt: [u8; FullPt]) -> [u8; 16 - (FullPt % 16)] {\n [0; 16 - (FullPt % 16)]\n}\n\n// |ct| = |full_pt| + |pt_aes_padding|\nfn get_arr_of_size__ciphertext(\n _full_pt: [u8; FullPt],\n _pt_aes_padding: [u8; PtAesPadding],\n) -> [u8; FullPt + PtAesPadding] {\n [0; FullPt + PtAesPadding]\n}\n\n// Ok, so we have the following bytes: header_ciphertext, ciphertext: Let mbwop =\n// HEADER_CIPHERTEXT_SIZE_IN_BYTES + |ct| // aka message bytes without padding\nfn get_arr_of_size__message_bytes_without_padding(\n _ct: [u8; Ct],\n) -> [u8; HEADER_CIPHERTEXT_SIZE_IN_BYTES + Ct] {\n [0; HEADER_CIPHERTEXT_SIZE_IN_BYTES + Ct]\n}\n\n// Recall:\n// mbwop := HEADER_CIPHERTEXT_SIZE_IN_BYTES + |ct| // aka message bytes without padding\n// We now want to pad b to the next multiple of 31, so as to \"fill\" fields. Let p be that padding. p = 31 * ceil(mbwop\n// / 31) - mbwop\n// = 31 * ((mbwop + 30) // 31) - mbwop\n// (because ceil(x / y) = (x + y - 1) // y ).\nfn get_arr_of_size__message_bytes_padding(\n _mbwop: [u8; Mbwop],\n) -> [u8; (31 * ((Mbwop + 30) / 31)) - Mbwop] {\n [0; (31 * ((Mbwop + 30) / 31)) - Mbwop]\n}\n\n// |message_bytes| = HEADER_CIPHERTEXT_SIZE_IN_BYTES + |ct| + p // aka message bytes (with\n// padding) Recall:\n// mbwop := HEADER_CIPHERTEXT_SIZE_IN_BYTES + |ct| p is the padding\nfn get_arr_of_size__message_bytes(_mbwop: [u8; MBWOP], _p: [u8; P]) -> [u8; MBWOP + P] {\n [0; MBWOP + P]\n}\n\n// The return type is pasted from the LSP's expectation, because it was too difficult to match its weird way of doing\n// algebra. It doesn't know all rules of arithmetic. Pt is the plaintext length.\npub(crate) fn get_arr_of_size__message_bytes_padding__from_PT() -> [u8; ((((((Pt + (16 - (Pt % 16))) + HEADER_CIPHERTEXT_SIZE_IN_BYTES) + 30) / 31) * 31) - ((Pt + (16 - (Pt % 16))) + HEADER_CIPHERTEXT_SIZE_IN_BYTES))] {\n let full_pt = get_arr_of_size__full_plaintext::();\n let pt_aes_padding = get_arr_of_size__plaintext_aes_padding(full_pt);\n let ct = get_arr_of_size__ciphertext(full_pt, pt_aes_padding);\n let mbwop = get_arr_of_size__message_bytes_without_padding(ct);\n let p = get_arr_of_size__message_bytes_padding(mbwop);\n p\n}\n\n// The return type is pasted from the LSP's expectation, because it was too difficult to match its weird way of doing\n// algebra. It doesn't know all rules of arithmetic.\npub(crate) fn get_arr_of_size__message_bytes__from_PT() -> [u8; (((Pt + (16 - (Pt % 16))) + HEADER_CIPHERTEXT_SIZE_IN_BYTES) + ((((((Pt + (16 - (Pt % 16))) + HEADER_CIPHERTEXT_SIZE_IN_BYTES) + 30) / 31) * 31) - ((Pt + (16 - (Pt % 16))) + HEADER_CIPHERTEXT_SIZE_IN_BYTES)))] {\n let full_pt = get_arr_of_size__full_plaintext::();\n let pt_aes_padding = get_arr_of_size__plaintext_aes_padding(full_pt);\n let ct = get_arr_of_size__ciphertext(full_pt, pt_aes_padding);\n let mbwop = get_arr_of_size__message_bytes_without_padding(ct);\n let p = get_arr_of_size__message_bytes_padding(mbwop);\n let message_bytes = get_arr_of_size__message_bytes(mbwop, p);\n message_bytes\n}\n" }, "158": { "function_locations": [ { "name": "encode_private_event_message", "start": 1377 }, { "name": "decode_private_event_message", "start": 3780 }, { "name": "test::encode_decode", "start": 5181 }, { "name": "test::::get_event_type_id", "start": 5994 }, { "name": "test::encode_decode_empty_event", "start": 6116 }, { "name": "test::decode_empty_content_returns_none", "start": 6775 }, { "name": "test::decode_succeeds_with_only_reserved_fields", "start": 6966 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/messages/logs/event.nr", "source": "use crate::{\n event::{event_interface::EventInterface, EventSelector},\n messages::{\n encoding::{encode_message, MAX_MESSAGE_CONTENT_LEN, MESSAGE_EXPANDED_METADATA_LEN},\n msg_type::PRIVATE_EVENT_MSG_TYPE_ID,\n },\n utils::array,\n};\nuse crate::protocol::traits::{FromField, Serialize, ToField};\n\n/// The number of fields in a private event message content that are not the event's serialized representation (1 field\n/// for randomness).\npub(crate) global PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN: u32 = 1;\npub(crate) global PRIVATE_EVENT_MSG_PLAINTEXT_RANDOMNESS_INDEX: u32 = 0;\n\n/// The maximum length of the packed representation of an event's contents. This is limited by private log size,\n/// encryption overhead and extra fields in the message (e.g. message type id, randomness, etc.).\npub global MAX_EVENT_SERIALIZED_LEN: u32 = MAX_MESSAGE_CONTENT_LEN - PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN;\n\n/// Creates the plaintext for a private event message (i.e. one of type [`PRIVATE_EVENT_MSG_TYPE_ID`]).\n///\n/// This plaintext is meant to be decoded via [`decode_private_event_message`].\npub fn encode_private_event_message(\n event: Event,\n randomness: Field,\n) -> [Field; PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + ::N + MESSAGE_EXPANDED_METADATA_LEN]\nwhere\n Event: EventInterface + Serialize,\n{\n std::static_assert(\n ::N <= MAX_EVENT_SERIALIZED_LEN,\n \"event's serialized length exceeds the maximum allowed for private events\",\n );\n\n // We use `Serialize` because we want for events to be processable by off-chain actors, e.g. block explorers,\n // wallets and apps, without having to rely on contract invocation. If we used `Packable` we'd need to call utility\n // functions in order to unpack events, which would introduce a level of complexity we don't currently think is\n // worth the savings in DA (for public events) and proving time (when encrypting private event messages).\n let serialized_event = event.serialize();\n\n // If PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN is changed, causing the assertion below to fail, then the\n // encoding below must be updated as well.\n std::static_assert(\n PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN == 1,\n \"unexpected value for PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN\",\n );\n\n let mut msg_plaintext = [0; PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + ::N];\n msg_plaintext[PRIVATE_EVENT_MSG_PLAINTEXT_RANDOMNESS_INDEX] = randomness;\n\n for i in 0..serialized_event.len() {\n msg_plaintext[PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + i] = serialized_event[i];\n }\n\n // The event type id is stored in the message metadata\n encode_message(\n PRIVATE_EVENT_MSG_TYPE_ID,\n Event::get_event_type_id().to_field() as u64,\n msg_plaintext,\n )\n}\n\n/// Decodes the plaintext from a private event message (i.e. one of type [`PRIVATE_EVENT_MSG_TYPE_ID`]).\n///\n/// Returns `None` if `msg_content` is too short to contain the reserved fields. This plaintext is meant to have\n/// originated from [`encode_private_event_message`].\n///\n/// Note that while [`encode_private_event_message`] returns a fixed-size array, this function takes a [`BoundedVec`]\n/// instead. This is because when decoding we're typically processing runtime-sized plaintexts, more specifically,\n/// those that originate from [`crate::messages::encryption::message_encryption::MessageEncryption::decrypt`].\npub(crate) unconstrained fn decode_private_event_message(\n msg_metadata: u64,\n msg_content: BoundedVec,\n) -> Option<(EventSelector, Field, BoundedVec)> {\n if msg_content.len() < PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN {\n Option::none()\n } else {\n let event_type_id = EventSelector::from_field(msg_metadata as Field);\n\n // If PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN is changed, causing the assertion below to fail, then the\n // destructuring of the private event message encoding below must be updated as well.\n std::static_assert(\n PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN == 1,\n \"unexpected value for PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN\",\n );\n\n let randomness = msg_content.get(PRIVATE_EVENT_MSG_PLAINTEXT_RANDOMNESS_INDEX);\n let serialized_event = array::subbvec(msg_content, PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN);\n\n Option::some((event_type_id, randomness, serialized_event))\n }\n}\n\nmod test {\n use crate::{\n event::{event_interface::EventInterface, EventSelector},\n messages::{\n encoding::decode_message,\n logs::event::{decode_private_event_message, encode_private_event_message},\n msg_type::PRIVATE_EVENT_MSG_TYPE_ID,\n },\n };\n use crate::protocol::traits::{FromField, Serialize};\n use crate::test::mocks::mock_event::MockEvent;\n\n global VALUE: Field = 7;\n global RANDOMNESS: Field = 10;\n\n #[test]\n unconstrained fn encode_decode() {\n let event = MockEvent::new(VALUE).build_event();\n\n let message_plaintext = encode_private_event_message(event, RANDOMNESS);\n\n let (msg_type_id, msg_metadata, msg_content) =\n decode_message(BoundedVec::from_array(message_plaintext)).unwrap();\n\n assert_eq(msg_type_id, PRIVATE_EVENT_MSG_TYPE_ID);\n\n let (event_type_id, randomness, serialized_event) =\n decode_private_event_message(msg_metadata, msg_content).unwrap();\n\n assert_eq(event_type_id, MockEvent::get_event_type_id());\n assert_eq(randomness, RANDOMNESS);\n assert_eq(serialized_event, BoundedVec::from_array(event.serialize()));\n }\n\n #[derive(Serialize)]\n struct EmptyEvent {}\n\n impl EventInterface for EmptyEvent {\n fn get_event_type_id() -> EventSelector {\n EventSelector::from_field(90)\n }\n }\n\n #[test]\n unconstrained fn encode_decode_empty_event() {\n let message_plaintext = encode_private_event_message(EmptyEvent {}, RANDOMNESS);\n\n let (msg_type_id, msg_metadata, msg_content) =\n decode_message(BoundedVec::from_array(message_plaintext)).unwrap();\n\n assert_eq(msg_type_id, PRIVATE_EVENT_MSG_TYPE_ID);\n\n let (event_type_id, randomness, serialized_event) =\n decode_private_event_message(msg_metadata, msg_content).unwrap();\n\n assert_eq(event_type_id, EmptyEvent::get_event_type_id());\n assert_eq(randomness, RANDOMNESS);\n assert_eq(serialized_event.len(), 0);\n }\n\n #[test]\n unconstrained fn decode_empty_content_returns_none() {\n let empty = BoundedVec::new();\n assert(decode_private_event_message(0, empty).is_none());\n }\n\n #[test]\n unconstrained fn decode_succeeds_with_only_reserved_fields() {\n let content = BoundedVec::from_array([RANDOMNESS]);\n\n let (_, randomness, serialized_event) = decode_private_event_message(0, content).unwrap();\n\n assert_eq(randomness, RANDOMNESS);\n assert_eq(serialized_event.len(), 0);\n }\n}\n" }, "16": { "function_locations": [ { "name": "Field::assert_max_bit_size", "start": 380 }, { "name": "Field::to_le_bits", "start": 1196 }, { "name": "Field::to_be_bits", "start": 2387 }, { "name": "Field::to_le_bytes", "start": 3562 }, { "name": "Field::to_be_bytes", "start": 5033 }, { "name": "Field::to_le_radix", "start": 5904 }, { "name": "Field::to_be_radix", "start": 6362 }, { "name": "Field::pow_32", "start": 7053 }, { "name": "Field::sgn0", "start": 7455 }, { "name": "Field::lt", "start": 7538 }, { "name": "Field::from_le_bytes", "start": 8073 }, { "name": "Field::from_be_bytes", "start": 8820 }, { "name": "Field::from_le_bytes_checked", "start": 9611 }, { "name": "Field::from_be_bytes_checked", "start": 10620 }, { "name": "__assert_max_bit_size", "start": 11202 }, { "name": "__to_le_radix", "start": 11330 }, { "name": "__to_be_radix", "start": 11458 }, { "name": "__to_le_bits", "start": 12179 }, { "name": "__to_be_bits", "start": 12897 }, { "name": "modulus_num_bits", "start": 12972 }, { "name": "modulus_be_bits", "start": 13048 }, { "name": "modulus_le_bits", "start": 13124 }, { "name": "modulus_be_bytes", "start": 13200 }, { "name": "modulus_le_bytes", "start": 13276 }, { "name": "__field_less_than", "start": 13437 }, { "name": "field_less_than", "start": 13513 }, { "name": "lt_fallback", "start": 13589 }, { "name": "tests::test_to_be_bits", "start": 14551 }, { "name": "tests::test_to_le_bits", "start": 14824 }, { "name": "tests::test_to_be_bytes", "start": 15099 }, { "name": "tests::test_to_le_bytes", "start": 15405 }, { "name": "tests::test_to_be_radix", "start": 15711 }, { "name": "tests::test_to_le_radix", "start": 16293 }, { "name": "tests::test_to_le_radix_1", "start": 16893 }, { "name": "tests::test_to_le_radix_brillig_1", "start": 17346 }, { "name": "tests::test_to_le_radix_3", "start": 17700 }, { "name": "tests::test_to_le_radix_brillig_3", "start": 18011 }, { "name": "tests::test_to_le_radix_512", "start": 18439 }, { "name": "tests::not_enough_limbs_brillig", "start": 18848 }, { "name": "tests::not_enough_limbs", "start": 19044 }, { "name": "tests::non_zero_field_to_le_bytes_zero_limbs", "start": 19274 }, { "name": "tests::non_zero_field_to_be_bytes_zero_limbs", "start": 19469 }, { "name": "tests::test_field_less_than", "start": 19576 }, { "name": "tests::test_large_field_values_unconstrained", "start": 19831 }, { "name": "tests::test_large_field_values", "start": 20284 }, { "name": "tests::test_decomposition_edge_cases", "start": 20731 }, { "name": "tests::test_pow_32", "start": 21321 }, { "name": "tests::test_sgn0", "start": 21650 }, { "name": "tests::test_bit_decomposition_overflow", "start": 22072 }, { "name": "tests::test_byte_decomposition_overflow", "start": 22354 }, { "name": "tests::test_to_from_be_bytes_bn254_edge_cases", "start": 22571 }, { "name": "tests::test_to_from_le_bytes_bn254_edge_cases", "start": 24522 }, { "name": "tests::test_from_le_bytes_checked_accepts_modulus_minus_one", "start": 26457 }, { "name": "tests::test_from_le_bytes_checked_rejects_modulus", "start": 26936 }, { "name": "tests::test_from_le_bytes_checked_rejects_modulus_plus_one", "start": 27321 }, { "name": "tests::test_from_be_bytes_checked_accepts_modulus_minus_one", "start": 27776 }, { "name": "tests::test_from_be_bytes_checked_rejects_modulus", "start": 28265 }, { "name": "tests::test_from_be_bytes_checked_rejects_modulus_plus_one", "start": 28650 }, { "name": "tests::test_from_bytes_checked_small_n", "start": 29094 }, { "name": "tests::from_le_bits", "start": 29739 }, { "name": "tests::from_be_bits", "start": 30286 }, { "name": "tests::test_to_from_be_bits_bn254_edge_cases", "start": 30532 }, { "name": "tests::test_to_from_le_bits_bn254_edge_cases", "start": 32465 }, { "name": "tests::max_bit_size_too_large", "start": 34397 } ], "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(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(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(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(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(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(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(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(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(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(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(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(value: Field, radix: u32) -> [u8; N] {}\n\n// `_radix` must be less than 256\n#[builtin(to_be_radix)]\nfn __to_be_radix(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(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(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(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(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" }, "160": { "function_locations": [ { "name": "encode_private_note_message_with_msg_type_id", "start": 1652 }, { "name": "encode_private_note_message", "start": 3078 }, { "name": "decode_private_note_message", "start": 4094 }, { "name": "test::encode_decode", "start": 5790 }, { "name": "test::::get_id", "start": 6713 }, { "name": "test::encode_decode_max_size_note", "start": 6809 }, { "name": "test::::get_id", "start": 7825 }, { "name": "test::encode_oversized_note_fails", "start": 8011 }, { "name": "test::::get_id", "start": 8289 }, { "name": "test::encode_decode_empty_note", "start": 8382 }, { "name": "test::decode_empty_content_returns_none", "start": 9102 }, { "name": "test::decode_with_fewer_than_reserved_fields_returns_none", "start": 9302 }, { "name": "test::decode_succeeds_with_only_reserved_fields", "start": 9509 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/messages/logs/note.nr", "source": "use crate::{\n messages::{\n encoding::{encode_message, MAX_MESSAGE_CONTENT_LEN, MESSAGE_EXPANDED_METADATA_LEN},\n msg_type::PRIVATE_NOTE_MSG_TYPE_ID,\n },\n note::note_interface::NoteType,\n utils::array,\n};\nuse crate::protocol::{address::AztecAddress, traits::{FromField, Packable, ToField}};\n\n/// The number of fields in a private note message content that are not the note's packed representation.\npub(crate) global PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN: u32 = 3;\n\npub(crate) global PRIVATE_NOTE_MSG_PLAINTEXT_OWNER_INDEX: u32 = 0;\npub(crate) global PRIVATE_NOTE_MSG_PLAINTEXT_STORAGE_SLOT_INDEX: u32 = 1;\npub(crate) global PRIVATE_NOTE_MSG_PLAINTEXT_RANDOMNESS_INDEX: u32 = 2;\n\n/// The maximum length of the packed representation of a note's contents. This is limited by private log size,\n/// encryption overhead and extra fields in the message (e.g. message type id, storage slot, randomness, etc.).\npub global MAX_NOTE_PACKED_LEN: u32 = MAX_MESSAGE_CONTENT_LEN - PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN;\n\n/// Creates the plaintext for a private note message with the given `msg_type_id`.\n///\n/// Shared encoder used by [`encode_private_note_message`] and by custom message handlers that use the same format as\n/// standard private note message but perform additional validation logic.\npub fn encode_private_note_message_with_msg_type_id(\n msg_type_id: u64,\n note: Note,\n owner: AztecAddress,\n storage_slot: Field,\n randomness: Field,\n) -> [Field; PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + ::N + MESSAGE_EXPANDED_METADATA_LEN]\nwhere\n Note: NoteType + Packable,\n{\n let packed_note = note.pack();\n\n // If PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN is changed, causing the assertion below to fail, then the\n // encoding below must be updated as well.\n std::static_assert(\n PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN == 3,\n \"unexpected value for PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN\",\n );\n\n let mut msg_content = [0; PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + ::N];\n msg_content[PRIVATE_NOTE_MSG_PLAINTEXT_OWNER_INDEX] = owner.to_field();\n msg_content[PRIVATE_NOTE_MSG_PLAINTEXT_STORAGE_SLOT_INDEX] = storage_slot;\n msg_content[PRIVATE_NOTE_MSG_PLAINTEXT_RANDOMNESS_INDEX] = randomness;\n for i in 0..packed_note.len() {\n msg_content[PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + i] = packed_note[i];\n }\n\n // Notes use the note type id for metadata\n encode_message(msg_type_id, Note::get_id() as u64, msg_content)\n}\n\n/// Creates the plaintext for a private note message (i.e. one of type [`PRIVATE_NOTE_MSG_TYPE_ID`]).\n///\n/// This plaintext is meant to be decoded via [`decode_private_note_message`].\npub fn encode_private_note_message(\n note: Note,\n owner: AztecAddress,\n storage_slot: Field,\n randomness: Field,\n) -> [Field; PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + ::N + MESSAGE_EXPANDED_METADATA_LEN]\nwhere\n Note: NoteType + Packable,\n{\n encode_private_note_message_with_msg_type_id(\n PRIVATE_NOTE_MSG_TYPE_ID,\n note,\n owner,\n storage_slot,\n randomness,\n )\n}\n\n/// Decodes the plaintext from a private note message (i.e. one of type [`PRIVATE_NOTE_MSG_TYPE_ID`]).\n///\n/// Returns `None` if `msg_content` is too short to contain the reserved fields. This plaintext is meant to have\n/// originated from [`encode_private_note_message`].\n///\n/// Note that while [`encode_private_note_message`] returns a fixed-size array, this function takes a [`BoundedVec`]\n/// instead. This is because when decoding we're typically processing runtime-sized plaintexts, more specifically,\n/// those that originate from [`crate::messages::encryption::message_encryption::MessageEncryption::decrypt`].\npub(crate) unconstrained fn decode_private_note_message(\n msg_metadata: u64,\n msg_content: BoundedVec,\n) -> Option<(Field, AztecAddress, Field, Field, BoundedVec)> {\n if msg_content.len() < PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN {\n Option::none()\n } else {\n let note_type_id = msg_metadata as Field; // TODO: make note type id not be a full field\n\n // If PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN is changed, causing the assertion below to fail, then the\n // decoding below must be updated as well.\n std::static_assert(\n PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN == 3,\n \"unexpected value for PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN\",\n );\n\n let owner = AztecAddress::from_field(msg_content.get(PRIVATE_NOTE_MSG_PLAINTEXT_OWNER_INDEX));\n let storage_slot = msg_content.get(PRIVATE_NOTE_MSG_PLAINTEXT_STORAGE_SLOT_INDEX);\n let randomness = msg_content.get(PRIVATE_NOTE_MSG_PLAINTEXT_RANDOMNESS_INDEX);\n let packed_note = array::subbvec(msg_content, PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN);\n\n Option::some((note_type_id, owner, storage_slot, randomness, packed_note))\n }\n}\n\nmod test {\n use crate::{\n messages::{\n encoding::decode_message,\n logs::note::{decode_private_note_message, encode_private_note_message, MAX_NOTE_PACKED_LEN},\n msg_type::PRIVATE_NOTE_MSG_TYPE_ID,\n },\n note::note_interface::NoteType,\n };\n use crate::protocol::{address::AztecAddress, traits::{FromField, Packable, ToField}};\n use crate::test::mocks::mock_note::MockNote;\n\n global VALUE: Field = 7;\n global OWNER: AztecAddress = AztecAddress::from_field(8);\n global STORAGE_SLOT: Field = 9;\n global RANDOMNESS: Field = 10;\n\n #[test]\n unconstrained fn encode_decode() {\n let note = MockNote::new(VALUE).build_note();\n\n let message_plaintext = encode_private_note_message(note, OWNER, STORAGE_SLOT, RANDOMNESS);\n\n let (msg_type_id, msg_metadata, msg_content) =\n decode_message(BoundedVec::from_array(message_plaintext)).unwrap();\n\n assert_eq(msg_type_id, PRIVATE_NOTE_MSG_TYPE_ID);\n\n let (note_type_id, owner, storage_slot, randomness, packed_note) =\n decode_private_note_message(msg_metadata, msg_content).unwrap();\n\n assert_eq(note_type_id, MockNote::get_id());\n assert_eq(owner, OWNER);\n assert_eq(storage_slot, STORAGE_SLOT);\n assert_eq(randomness, RANDOMNESS);\n assert_eq(packed_note, BoundedVec::from_array(note.pack()));\n }\n\n #[derive(Packable)]\n struct MaxSizeNote {\n data: [Field; MAX_NOTE_PACKED_LEN],\n }\n\n impl NoteType for MaxSizeNote {\n fn get_id() -> Field {\n 0\n }\n }\n\n #[test]\n unconstrained fn encode_decode_max_size_note() {\n let mut data = [0; MAX_NOTE_PACKED_LEN];\n for i in 0..MAX_NOTE_PACKED_LEN {\n data[i] = i as Field;\n }\n let note = MaxSizeNote { data };\n\n let encoded = encode_private_note_message(note, OWNER, STORAGE_SLOT, RANDOMNESS);\n let (msg_type_id, msg_metadata, msg_content) = decode_message(BoundedVec::from_array(encoded)).unwrap();\n\n assert_eq(msg_type_id, PRIVATE_NOTE_MSG_TYPE_ID);\n\n let (note_type_id, owner, storage_slot, randomness, packed_note) =\n decode_private_note_message(msg_metadata, msg_content).unwrap();\n\n assert_eq(note_type_id, MaxSizeNote::get_id());\n assert_eq(owner, OWNER);\n assert_eq(storage_slot, STORAGE_SLOT);\n assert_eq(randomness, RANDOMNESS);\n assert_eq(packed_note, BoundedVec::from_array(data));\n }\n\n #[derive(Packable)]\n struct OversizedNote {\n data: [Field; MAX_NOTE_PACKED_LEN + 1],\n }\n\n impl NoteType for OversizedNote {\n fn get_id() -> Field {\n 0\n }\n }\n\n #[test(should_fail_with = \"Invalid message content: it must have a length of at most MAX_MESSAGE_CONTENT_LEN\")]\n fn encode_oversized_note_fails() {\n let note = OversizedNote { data: [0; MAX_NOTE_PACKED_LEN + 1] };\n let _ = encode_private_note_message(note, OWNER, STORAGE_SLOT, RANDOMNESS);\n }\n\n #[derive(Packable)]\n struct EmptyNote {}\n\n impl NoteType for EmptyNote {\n fn get_id() -> Field {\n 0\n }\n }\n\n #[test]\n unconstrained fn encode_decode_empty_note() {\n let encoded = encode_private_note_message(EmptyNote {}, OWNER, STORAGE_SLOT, RANDOMNESS);\n let (msg_type_id, msg_metadata, msg_content) = decode_message(BoundedVec::from_array(encoded)).unwrap();\n\n assert_eq(msg_type_id, PRIVATE_NOTE_MSG_TYPE_ID);\n\n let (note_type_id, owner, storage_slot, randomness, packed_note) =\n decode_private_note_message(msg_metadata, msg_content).unwrap();\n\n assert_eq(note_type_id, EmptyNote::get_id());\n assert_eq(owner, OWNER);\n assert_eq(storage_slot, STORAGE_SLOT);\n assert_eq(randomness, RANDOMNESS);\n assert_eq(packed_note.len(), 0);\n }\n\n #[test]\n unconstrained fn decode_empty_content_returns_none() {\n let empty = BoundedVec::new();\n assert(decode_private_note_message(0, empty).is_none());\n }\n\n #[test]\n unconstrained fn decode_with_fewer_than_reserved_fields_returns_none() {\n let content = BoundedVec::from_array([0, 0]);\n assert(decode_private_note_message(0, content).is_none());\n }\n\n #[test]\n unconstrained fn decode_succeeds_with_only_reserved_fields() {\n let content = BoundedVec::from_array([OWNER.to_field(), STORAGE_SLOT, RANDOMNESS]);\n\n let (_, owner, storage_slot, randomness, packed_note) = decode_private_note_message(0, content).unwrap();\n\n assert_eq(owner, OWNER);\n assert_eq(storage_slot, STORAGE_SLOT);\n assert_eq(randomness, RANDOMNESS);\n assert_eq(packed_note.len(), 0);\n }\n}\n" }, "161": { "function_locations": [ { "name": "encode_partial_note_private_message", "start": 1715 }, { "name": "decode_partial_note_private_message", "start": 3810 }, { "name": "test::encode_decode", "start": 6022 }, { "name": "test::decode_empty_content_returns_none", "start": 6999 }, { "name": "test::decode_succeeds_with_only_reserved_fields", "start": 7197 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/messages/logs/partial_note.nr", "source": "use crate::{\n messages::{\n encoding::{encode_message, MAX_MESSAGE_CONTENT_LEN, MESSAGE_EXPANDED_METADATA_LEN},\n msg_type::PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID,\n },\n note::note_interface::NoteType,\n utils::array,\n};\nuse crate::protocol::{address::AztecAddress, traits::{FromField, Packable, ToField}};\n\n/// The number of fields in a private note message content that are not the note's packed representation.\npub(crate) global PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN: u32 = 3;\npub(crate) global PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_OWNER_INDEX: u32 = 0;\npub(crate) global PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RANDOMNESS_INDEX: u32 = 1;\npub(crate) global PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_NOTE_COMPLETION_LOG_TAG_INDEX: u32 = 2;\n\n/// Partial notes have a maximum packed length of their private fields bound by extra content in their private message\n/// (e.g. the storage slot, note completion log tag, etc.).\npub global MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN: u32 =\n MAX_MESSAGE_CONTENT_LEN - PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN;\n\n/// Creates the plaintext for a partial note private message (i.e. one of type [`PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID`]).\n///\n/// This plaintext is meant to be decoded via [`decode_partial_note_private_message`].\npub fn encode_partial_note_private_message(\n partial_note_private_content: PartialNotePrivateContent,\n owner: AztecAddress,\n randomness: Field,\n note_completion_log_tag: Field,\n ) -> [Field; PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + ::N + MESSAGE_EXPANDED_METADATA_LEN]\nwhere\n PartialNotePrivateContent: NoteType + Packable,\n{\n let packed_private_content = partial_note_private_content.pack();\n\n // If PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_NON_NOTE_FIELDS_LEN is changed, causing the assertion below to fail, then\n // the encoding below must be updated as well.\n std::static_assert(\n PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN == 3,\n \"unexpected value for PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_NON_NOTE_FIELDS_LEN\",\n );\n\n let mut msg_content =\n [0; PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + ::N];\n msg_content[PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_OWNER_INDEX] = owner.to_field();\n msg_content[PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RANDOMNESS_INDEX] = randomness;\n msg_content[PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_NOTE_COMPLETION_LOG_TAG_INDEX] = note_completion_log_tag;\n\n for i in 0..packed_private_content.len() {\n msg_content[PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + i] = packed_private_content[i];\n }\n\n encode_message(\n PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID,\n // Notes use the note type id for metadata\n PartialNotePrivateContent::get_id() as u64,\n msg_content,\n )\n}\n\n/// Decodes the plaintext from a partial note private message (i.e. one of type\n/// [`PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID`]).\n///\n/// Returns `None` if `msg_content` has too few fields. This plaintext is meant to have originated\n/// from [`encode_partial_note_private_message`].\n///\n/// Note that while [`encode_partial_note_private_message`] returns a fixed-size array, this function takes a\n/// [`BoundedVec`] instead. This is because when decoding we're typically processing runtime-sized plaintexts, more\n/// specifically, those that originate from\n/// [`crate::messages::encryption::message_encryption::MessageEncryption::decrypt`].\npub(crate) unconstrained fn decode_partial_note_private_message(\n msg_metadata: u64,\n msg_content: BoundedVec,\n) -> Option<(AztecAddress, Field, Field, Field, BoundedVec)> {\n if msg_content.len() < PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN {\n Option::none()\n } else {\n let note_type_id: Field = msg_metadata as Field; // TODO: make note type id not be a full field\n\n // If PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_NON_NOTE_FIELDS_LEN is changed, causing the assertion below to fail,\n // then the destructuring of the partial note private message encoding below must be updated as well.\n std::static_assert(\n PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN == 3,\n \"unexpected value for PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_NON_NOTE_FIELDS_LEN\",\n );\n\n // We currently have three fields that are not the partial note's packed representation, which are the owner,\n // the randomness, and the note completion log tag.\n let owner = AztecAddress::from_field(\n msg_content.get(PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_OWNER_INDEX),\n );\n let randomness = msg_content.get(PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RANDOMNESS_INDEX);\n let note_completion_log_tag = msg_content.get(PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_NOTE_COMPLETION_LOG_TAG_INDEX);\n\n let packed_private_note_content: BoundedVec = array::subbvec(\n msg_content,\n PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN,\n );\n\n Option::some(\n (owner, randomness, note_completion_log_tag, note_type_id, packed_private_note_content),\n )\n }\n}\n\nmod test {\n use crate::{\n messages::{\n encoding::decode_message,\n logs::partial_note::{decode_partial_note_private_message, encode_partial_note_private_message},\n msg_type::PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID,\n },\n note::note_interface::NoteType,\n };\n use crate::protocol::{address::AztecAddress, traits::{FromField, Packable}};\n use crate::test::mocks::mock_note::MockNote;\n\n global VALUE: Field = 7;\n global OWNER: AztecAddress = AztecAddress::from_field(8);\n global RANDOMNESS: Field = 10;\n global NOTE_COMPLETION_LOG_TAG: Field = 11;\n\n #[test]\n unconstrained fn encode_decode() {\n // Note that here we use MockNote as the private fields of a partial note\n let note = MockNote::new(VALUE).build_note();\n\n let message_plaintext = encode_partial_note_private_message(note, OWNER, RANDOMNESS, NOTE_COMPLETION_LOG_TAG);\n\n let (msg_type_id, msg_metadata, msg_content) =\n decode_message(BoundedVec::from_array(message_plaintext)).unwrap();\n\n assert_eq(msg_type_id, PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID);\n\n let (owner, randomness, note_completion_log_tag, note_type_id, packed_note) =\n decode_partial_note_private_message(msg_metadata, msg_content).unwrap();\n\n assert_eq(note_type_id, MockNote::get_id());\n assert_eq(owner, OWNER);\n assert_eq(randomness, RANDOMNESS);\n assert_eq(note_completion_log_tag, NOTE_COMPLETION_LOG_TAG);\n assert_eq(packed_note, BoundedVec::from_array(note.pack()));\n }\n\n #[test]\n unconstrained fn decode_empty_content_returns_none() {\n let empty = BoundedVec::new();\n assert(decode_partial_note_private_message(0, empty).is_none());\n }\n\n #[test]\n unconstrained fn decode_succeeds_with_only_reserved_fields() {\n let content = BoundedVec::from_array([0, 0, 0]);\n let (_, _, _, _, packed_note) = decode_partial_note_private_message(0, content).unwrap();\n assert_eq(packed_note.len(), 0);\n }\n}\n" }, "168": { "function_locations": [ { "name": "enqueue_note_for_validation", "start": 3676 }, { "name": "enqueue_event_for_validation", "start": 5039 }, { "name": "validate_and_store_enqueued_notes_and_events", "start": 5707 }, { "name": "get_pending_partial_notes_completion_logs", "start": 7003 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/messages/processing/mod.nr", "source": "pub(crate) mod event_validation_request;\npub mod offchain;\n\npub use crate::oracle::tx_resolution::ResolvedTx;\n\nmod note_validation_request;\npub use note_validation_request::NoteValidationRequest;\n\npub mod log_retrieval_request;\npub mod log_retrieval_response;\npub(crate) mod pending_tagged_log;\npub(crate) mod provided_secret;\n\nuse crate::{\n ephemeral::EphemeralArray,\n event::EventSelector,\n messages::{\n encoding::MESSAGE_CIPHERTEXT_LEN,\n logs::{event::MAX_EVENT_SERIALIZED_LEN, note::MAX_NOTE_PACKED_LEN},\n processing::{log_retrieval_request::LogRetrievalRequest, log_retrieval_response::LogRetrievalResponse},\n },\n oracle::message_processing,\n partial_notes::DeliveredPendingPartialNote,\n};\nuse crate::protocol::{\n address::AztecAddress,\n constants::DOM_SEP__NOTE_COMPLETION_LOG_TAG,\n hash::{compute_log_tag, sha256_to_field},\n traits::{Deserialize, Serialize},\n};\nuse event_validation_request::EventValidationRequest;\n\nglobal NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT: Field = sha256_to_field(\n \"AZTEC_NR::NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT\".as_bytes(),\n);\n\nglobal EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT: Field = sha256_to_field(\n \"AZTEC_NR::EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT\".as_bytes(),\n);\n\nglobal LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT: Field = sha256_to_field(\n \"AZTEC_NR::LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT\".as_bytes(),\n);\n\n/// An offchain-delivered message with resolved context, ready for processing during sync.\n#[derive(Serialize, Deserialize)]\npub struct OffchainMessageWithTx {\n pub message_ciphertext: BoundedVec,\n pub resolved_tx: ResolvedTx,\n}\n\n/// Enqueues a note for validation and storage by PXE.\n///\n/// Once validated, the note becomes retrievable via the `get_notes` oracle. The note will be scoped to\n/// `contract_address`, meaning other contracts will not be able to access it unless authorized.\n///\n/// In order for the note validation and insertion to occur, `validate_and_store_enqueued_notes_and_events` must be\n/// later called. For optimal performance, accumulate as many note validation requests as possible and then validate\n/// them all at the end (which results in PXE minimizing the number of network round-trips).\n///\n/// The `packed_note` is what `getNotes` will later return. PXE indexes notes by `storage_slot`, so this value is\n/// typically used to filter notes that correspond to different state variables. `note_hash` and `nullifier` are the\n/// inner hashes, i.e. the raw hashes returned by `NoteHash::compute_note_hash` and `NoteHash::compute_nullifier`. PXE\n/// will verify that the siloed unique note hash was inserted into the tree at `tx_hash`, and will store the nullifier\n/// to later check for nullification.\n///\n/// `owner` is the address used in note hash and nullifier computation, often requiring knowledge of their nullifier\n/// secret key.\n///\n/// `scope` is the account to which the note message was delivered (i.e. the address the message was encrypted to).\n/// This determines which PXE account can see the note - other accounts will not be able to access it (e.g. other\n/// accounts will not be able to see one another's token balance notes, even in the same PXE) unless authorized. In\n/// most cases `recipient` equals `owner`, but they can differ in scenarios like delegated discovery.\npub unconstrained fn enqueue_note_for_validation(\n contract_address: AztecAddress,\n owner: AztecAddress,\n storage_slot: Field,\n randomness: Field,\n note_nonce: Field,\n packed_note: BoundedVec,\n note_hash: Field,\n nullifier: Field,\n tx_hash: Field,\n) {\n EphemeralArray::at(NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT).push(NoteValidationRequest::new(\n contract_address,\n owner,\n storage_slot,\n randomness,\n note_nonce,\n packed_note,\n note_hash,\n nullifier,\n tx_hash,\n ))\n}\n\n/// Enqueues an event for validation and storage by PXE.\n///\n/// This is the primary way for custom message handlers (registered via\n/// [`crate::macros::AztecConfig::custom_message_handler`]) to deliver reassembled events back to PXE after processing\n/// application-specific message formats.\n///\n/// In order for the event validation and insertion to occur, `validate_and_store_enqueued_notes_and_events` must be\n/// later called. For optimal performance, accumulate as many event validation requests as possible and then validate\n/// them all at the end (which results in PXE minimizing the number of network round-trips).\n///\n/// Note that `validate_and_store_enqueued_notes_and_events` is called by Aztec.nr after processing messages, so custom\n/// message processors do not need to be concerned with this.\npub unconstrained fn enqueue_event_for_validation(\n contract_address: AztecAddress,\n event_type_id: EventSelector,\n randomness: Field,\n serialized_event: BoundedVec,\n event_commitment: Field,\n tx_hash: Field,\n) {\n EphemeralArray::at(EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT).push(EventValidationRequest::new(\n contract_address,\n event_type_id,\n randomness,\n serialized_event,\n event_commitment,\n tx_hash,\n ))\n}\n\n/// Validates and stores all enqueued notes and events.\n///\n/// Processes all requests enqueued via [`enqueue_note_for_validation`] and [`enqueue_event_for_validation`], inserting\n/// them into the note database and event store respectively, making them queryable via `get_notes` oracle and our TS\n/// API (PXE::getPrivateEvents).\npub unconstrained fn validate_and_store_enqueued_notes_and_events(scope: AztecAddress) {\n message_processing::validate_and_store_enqueued_notes_and_events(\n EphemeralArray::at(NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT),\n EphemeralArray::at(EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT),\n scope,\n );\n\n // Defensive clearing: purge the queues after processing to prevent double-processing if this function is called\n // more than once in the same call frame. It is currently defensive because we only call this once per sync run.\n let _ = EphemeralArray::::at(NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT).clear();\n let _ = EphemeralArray::::at(EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT).clear();\n}\n\n/// Efficiently queries the node for logs that result in the completion of all `DeliveredPendingPartialNote`s in an\n/// `EphemeralArray` by performing all node communication concurrently. Returns a nested `EphemeralArray`, one inner\n/// array per pending partial note, each containing all matching `LogRetrievalResponse`s (which may be empty if no\n/// logs were found).\npub(crate) unconstrained fn get_pending_partial_notes_completion_logs(\n contract_address: AztecAddress,\n pending_partial_notes: EphemeralArray,\n) -> EphemeralArray> {\n let log_retrieval_requests = EphemeralArray::at(LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT);\n\n pending_partial_notes.for_each(|_i, pending_partial_note| {\n // Partial note completion logs are emitted with a domain-separated tag. To find matching logs, we apply the\n // same domain separation to the stored raw tag.\n let log_tag = compute_log_tag(\n pending_partial_note.note_completion_log_tag,\n DOM_SEP__NOTE_COMPLETION_LOG_TAG,\n );\n log_retrieval_requests.push(LogRetrievalRequest::new(contract_address, log_tag));\n });\n\n let responses = message_processing::get_logs_by_tag(log_retrieval_requests);\n\n // Defensive clearing: prevent stale requests if this function is called more than once in the same call frame.\n let _ = log_retrieval_requests.clear();\n\n responses\n}\n" }, "17": { "function_locations": [ { "name": "sha256_compression", "start": 572 }, { "name": "keccakf1600", "start": 707 }, { "name": "keccak::keccakf1600", "start": 882 }, { "name": "blake2s", "start": 1044 }, { "name": "blake3", "start": 1142 }, { "name": "__blake3", "start": 1629 }, { "name": "pedersen_commitment", "start": 1747 }, { "name": "pedersen_commitment_with_separator", "start": 1976 }, { "name": "pedersen_hash", "start": 2380 }, { "name": "pedersen_hash_with_separator", "start": 2537 }, { "name": "derive_generators", "start": 3531 }, { "name": "__derive_generators", "start": 3890 }, { "name": "poseidon2_permutation", "start": 3968 }, { "name": "poseidon2_permutation_internal", "start": 4324 }, { "name": "poseidon2_config_state_size", "start": 4417 }, { "name": "derive_hash", "start": 4728 }, { "name": ">::build_hasher", "start": 5953 }, { "name": ">::default", "start": 6085 }, { "name": "::hash", "start": 6217 }, { "name": "::hash", "start": 6347 }, { "name": "::hash", "start": 6487 }, { "name": "::hash", "start": 6627 }, { "name": "::hash", "start": 6767 }, { "name": "::hash", "start": 6908 }, { "name": "::hash", "start": 7047 }, { "name": "::hash", "start": 7193 }, { "name": "::hash", "start": 7340 }, { "name": "::hash", "start": 7487 }, { "name": "::hash", "start": 7635 }, { "name": "::hash", "start": 7782 }, { "name": "::hash", "start": 7914 }, { "name": "::hash", "start": 8103 }, { "name": "::hash", "start": 8325 }, { "name": "::hash", "start": 8494 }, { "name": "::hash", "start": 8710 }, { "name": "::hash", "start": 8973 }, { "name": "::hash", "start": 9283 }, { "name": "::hash", "start": 9640 }, { "name": "::hash", "start": 10044 }, { "name": "::hash", "start": 10498 }, { "name": "::hash", "start": 10999 }, { "name": "::hash", "start": 11547 }, { "name": "::hash", "start": 12142 }, { "name": "::hash", "start": 12785 }, { "name": "assert_pedersen", "start": 13379 } ], "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(input: [u8; N]) -> [u8; 32]\n// docs:end:blake2s\n{}\n\n// docs:start:blake3\npub fn blake3(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(input: [u8; N]) -> [u8; 32] {}\n\n// docs:start:pedersen_commitment\npub fn pedersen_commitment(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(\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(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(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(\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(\n domain_separator_bytes: [u8; M],\n starting_index: u32,\n) -> [EmbeddedCurvePoint; N] {}\n\npub fn poseidon2_permutation(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(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(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(_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;\n\nimpl BuildHasher for BuildHasherDefault\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 Default for BuildHasherDefault\nwhere\n H: Hasher + Default,\n{\n fn default() -> Self {\n BuildHasherDefault {}\n }\n}\n\nimpl Hash for Field {\n fn hash(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(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(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(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(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(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(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(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(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(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(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(_self: Self, _state: &mut H)\n where\n H: Hasher,\n {}\n}\n\nimpl Hash for [T; N]\nwhere\n T: Hash,\n{\n fn hash(self, state: &mut H)\n where\n H: Hasher,\n {\n for elem in self {\n elem.hash(state);\n }\n }\n}\n\nimpl Hash for [T]\nwhere\n T: Hash,\n{\n fn hash(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 Hash for (A,)\nwhere\n A: Hash,\n{\n fn hash(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n }\n}\n\nimpl Hash for (A, B)\nwhere\n A: Hash,\n B: Hash,\n{\n fn hash(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n self.1.hash(state);\n }\n}\n\nimpl Hash for (A, B, C)\nwhere\n A: Hash,\n B: Hash,\n C: Hash,\n{\n fn hash(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 Hash for (A, B, C, D)\nwhere\n A: Hash,\n B: Hash,\n C: Hash,\n D: Hash,\n{\n fn hash(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 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(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 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(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 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(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 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(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 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(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 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(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 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(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 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(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" }, "170": { "function_locations": [ { "name": "receive", "start": 2699 }, { "name": "sync_inbox", "start": 4202 }, { "name": "test::setup", "start": 6051 }, { "name": "test::make_msg", "start": 6381 }, { "name": "test::advance_by", "start": 6664 }, { "name": "test::empty_inbox_returns_empty_result", "start": 6855 }, { "name": "test::multiple_messages_mixed_expiration", "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": 10895 }, { "name": "test::redelivery_after_processing_keeps_processed_guard", "start": 11760 } ], "path": "/home/nventuro/pkg-1/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::{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;\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,\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 {\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 = 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,\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,\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, 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 = 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" }, "171": { "function_locations": [ { "name": "OffchainReception::init", "start": 9679 }, { "name": "OffchainReception::load_all", "start": 10197 }, { "name": "OffchainReception::read_message", "start": 10546 }, { "name": "OffchainReception::id_for", "start": 11247 }, { "name": "OffchainReception::is_active", "start": 11566 }, { "name": "OffchainReception::step", "start": 12221 }, { "name": "OffchainReception::is_processed", "start": 13826 }, { "name": "OffchainReception::mark_processed", "start": 14394 }, { "name": "OffchainReception::terminate", "start": 14962 }, { "name": "to_payload", "start": 15336 }, { "name": "test::setup", "start": 15893 }, { "name": "test::make_msg", "start": 16223 }, { "name": "test::resolved_tx_at_block", "start": 16507 }, { "name": "test::resolved_tx", "start": 16898 }, { "name": "test::expired_reception_is_terminated", "start": 17015 }, { "name": "test::unresolved_reception_stays_active", "start": 17697 }, { "name": "test::resolved_reception_is_ready_to_process", "start": 18492 }, { "name": "test::already_processed_reception_is_not_re_pushed", "start": 19538 }, { "name": "test::processed_reception_terminates_once_its_origin_block_finalizes", "start": 20912 }, { "name": "test::unfinalized_processed_reception_survives_past_the_ttl", "start": 22137 }, { "name": "test::expired_reception_is_still_processed_when_its_tx_resolves", "start": 23527 } ], "path": "/home/nventuro/pkg-1/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/// 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 {\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 = ::N;\n let mut fields = [0; ::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,\n now: u64,\n ) -> Option {\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 = 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 {\n let fields = message.serialize();\n let payload: EphemeralArray = 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, 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" }, "178": { "function_locations": [ { "name": "NewNote::new", "start": 1507 }, { "name": "create_note", "start": 1981 }, { "name": "destroy_note", "start": 3066 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/note/lifecycle.nr", "source": "use crate::{\n context::PrivateContext,\n note::{\n ConfirmedNote,\n note_interface::{NoteHash, NoteType},\n NoteMessage,\n utils::compute_confirmed_note_hash_for_nullification,\n },\n oracle::{notes::notify_created_note, random::random},\n};\nuse crate::protocol::{address::AztecAddress, traits::Packable};\n\n/// A note that was created in the current contract call.\n///\n/// This struct holds a freshly created note along with the side-effect counter that the kernel uses to order note\n/// creations within a transaction. It is produced by [`create_note`] and is typically wrapped in a\n/// [`NoteMessage`](crate::note::NoteMessage), which is responsible for delivering the note's information to its\n/// recipient so that it is not lost.\n///\n/// Unlike [`ConfirmedNote`](crate::note::ConfirmedNote), which represents a note whose existence has been proven\n/// (either by reading it from PXE or by checking historical state), a `NewNote` represents a note whose creation is\n/// still pending in the current transaction's side-effect stream. Its note hash has been pushed into the\n/// [`PrivateContext`] but has not yet been siloed nor inserted into the note hash tree.\npub struct NewNote {\n pub note: Note,\n pub owner: AztecAddress,\n pub storage_slot: Field,\n pub randomness: Field,\n pub note_hash_counter: u32,\n}\n\nimpl NewNote {\n fn new(note: Note, owner: AztecAddress, storage_slot: Field, randomness: Field, note_hash_counter: u32) -> Self {\n // A counter of value zero indicates a settled note, which a NewNote by definition cannot be.\n assert(note_hash_counter != 0, \"A NewNote cannot have a zero note hash counter\");\n Self { note, owner, storage_slot, randomness, note_hash_counter }\n }\n}\n\npub fn create_note(\n context: &mut PrivateContext,\n owner: AztecAddress,\n storage_slot: Field,\n note: Note,\n) -> NoteMessage\nwhere\n Note: NoteType + NoteHash + Packable,\n{\n let note_hash_counter = context.get_side_effect_counter();\n\n // Safety: We use the randomness to preserve the privacy of the note recipient by preventing brute-forcing, so a\n // malicious sender could use non-random values to make the note less private. But they already know the full note\n // pre-image anyway, and so the recipient already trusts them to not disclose this information. We can therefore\n // assume that the sender will cooperate in the random value generation.\n let randomness = unsafe { random() };\n\n let note_hash = note.compute_note_hash(owner, storage_slot, randomness);\n\n notify_created_note(\n owner,\n storage_slot,\n randomness,\n Note::get_id(),\n note.pack(),\n note_hash,\n note_hash_counter,\n );\n\n context.push_note_hash(note_hash);\n\n NoteMessage::new(\n NewNote::new(note, owner, storage_slot, randomness, note_hash_counter),\n context,\n )\n}\n\npub fn destroy_note(context: &mut PrivateContext, confirmed_note: ConfirmedNote)\nwhere\n Note: NoteHash,\n{\n let note_hash_for_nullification = compute_confirmed_note_hash_for_nullification(confirmed_note);\n let nullifier = confirmed_note.note.compute_nullifier(context, confirmed_note.owner, note_hash_for_nullification);\n\n let note_hash = if confirmed_note.metadata.is_settled() {\n // Counter is zero, so we're nullifying a settled note and we don't populate the note_hash with real value.\n 0\n } else {\n // A non-zero note hash counter implies that we're nullifying a pending note (i.e. one that has not yet been\n // persisted in the trees and is instead in the pending new note hashes array). In such a case we populate its\n // hash with real value to inform the kernel which note we're nullifying so that it can either squash both the\n // note and the nullifier if it's an inner note hash, or check that the it matches a pending note if it's a\n // siloed note hash.\n note_hash_for_nullification\n };\n\n context.push_nullifier_for_note_hash(nullifier, note_hash)\n}\n" }, "181": { "function_locations": [ { "name": "extract_property_value_from_selector", "start": 725 }, { "name": "check_packed_note", "start": 1830 }, { "name": "assert_notes_order", "start": 3636 }, { "name": "get_note", "start": 4969 }, { "name": "confirm_hinted_note", "start": 5531 }, { "name": "get_notes", "start": 8346 }, { "name": "apply_preprocessor", "start": 9099 }, { "name": "confirm_hinted_notes", "start": 9575 }, { "name": "view_note", "start": 14336 }, { "name": "get_notes_internal", "start": 14989 }, { "name": "view_notes", "start": 16355 }, { "name": "flatten_options", "start": 17737 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/note/note_getter.nr", "source": "use crate::{\n context::PrivateContext,\n note::{\n ConfirmedNote,\n HintedNote,\n note_getter_options::{NoteGetterOptions, NoteStatus, PropertySelector, Select, Sort, SortOrder},\n note_interface::{NoteHash, NoteType},\n note_viewer_options::NoteViewerOptions,\n utils::compute_note_existence_request,\n },\n oracle,\n utils::{array, comparison::compare},\n};\n\nuse crate::protocol::{\n address::AztecAddress,\n constants::MAX_NOTE_HASH_READ_REQUESTS_PER_CALL,\n traits::{Packable, ToField},\n};\n\npub use crate::note::constants::MAX_NOTES_PER_PAGE;\n\nmod test;\n\nfn extract_property_value_from_selector(packed_note: [Field; N], selector: PropertySelector) -> Field {\n // Selectors use PropertySelectors in order to locate note properties inside the packed note. This allows easier\n // packing and custom (un)packing schemas. A note property is located inside the packed note using the index inside\n // the array, a byte offset and a length.\n let value: [u8; 32] = packed_note[selector.index as u32].to_be_bytes();\n let offset = selector.offset;\n let length = selector.length;\n assert(offset as u32 + length as u32 <= 32, \"PropertySelector offset + length exceeds field byte width\");\n let mut value_field = 0 as Field;\n let mut acc: Field = 1;\n for i in 0..32 {\n if i < length {\n // `value` is big-endian, so the last byte (index 31) holds the lowest value.\n // offset shifts the starting point away from that last byte, and i walks\n // through consecutive bytes.\n value_field += value[(31 - offset - i) as u32] as Field * acc;\n acc = acc * 256;\n }\n }\n value_field\n}\n\nfn check_packed_note(packed_note: [Field; N], selects: BoundedVec, N>) {\n for i in 0..selects.max_len() {\n if i < selects.len() {\n let select = selects.get_unchecked(i).unwrap_unchecked();\n let value_field = extract_property_value_from_selector(packed_note, select.property_selector);\n\n assert(compare(value_field, select.comparator, select.value.to_field()), \"Mismatch return note field.\");\n }\n }\n}\n\n// Asserts that two notes are correctly ordered given the sort criteria.\n//\n// Only the provided criteria are checked -- fields not covered by any criterion are never compared, and if\n// `sort_criteria` is empty no ordering is enforced at all. Criteria are evaluated in priority order: the first\n// criterion where the two notes differ determines whether the pair is correctly ordered. If all sorted fields are\n// equal, any order is accepted.\n//\n// For example, with criteria `[field_0 ASC, field_1 DESC]`:\n// - `[1, 10], [2, 999]` -> passes: field_0 (1 < 2) satisfies ASC, field_1 is not checked.\n// - `[1, 10], [1, 5]` -> passes: field_0 ties, so field_1 (10 > 5) satisfies DESC.\n// - `[1, 5], [1, 10]` -> fails: field_0 ties, so field_1 (5 < 10) violates DESC.\n// - `[1, 10], [1, 10]` -> passes: all fields tie, any order criteria is valid.\n//\n// With a single criterion, `[field_0 DESC]`:\n// - `[10, 1], [5, 20]` -> passes: field_0 (10 > 5) satisfies DESC, field_1 is never compared.\n// - `[5, 1], [5, 20]` -> passes: field_0 ties and there are no more criteria, so any order is accepted.\n//\n// With no criteria:\n// - `[2, 5], [1, 10]` -> passes: nothing to check.\n//\n// This is called by [`confirm_hinted_notes`] to validate that the oracle returned notes in the requested order.\nfn assert_notes_order(note_1: [Field; N], note_2: [Field; N], sort_criteria: BoundedVec, N>) {\n // Tracks whether a prior criterion already determined the ordering. Once true, all subsequent\n // asserts become trivially satisfied. We fold this into the assert condition instead of\n // predicating the loop body to avoid gating field extraction behind a branch, which would be\n // more expensive in a circuit.\n let mut order_decided = false;\n for i in 0..sort_criteria.max_len() {\n if i < sort_criteria.len() {\n let sort = sort_criteria.get_unchecked(i).unwrap_unchecked();\n let field_1 = extract_property_value_from_selector(note_1, sort.property_selector);\n let field_2 = extract_property_value_from_selector(note_2, sort.property_selector);\n if field_1 != field_2 {\n let lt = field_1.lt(field_2);\n if sort.order == SortOrder.ASC {\n assert(lt | order_decided, \"Return notes not sorted in ascending order.\");\n } else {\n assert(!lt | order_decided, \"Return notes not sorted in descending order.\");\n }\n order_decided = true;\n }\n }\n }\n}\n\npub fn get_note(\n context: &mut PrivateContext,\n owner: Option,\n storage_slot: Field,\n) -> ConfirmedNote\nwhere\n Note: NoteType + NoteHash + Packable,\n{\n // Safety: Constraining that we got a valid note from the oracle is fairly straightforward: all we need to do is\n // check that the metadata is correct, and that the note exists.\n let hinted_note = unsafe { view_note::(owner, storage_slot) };\n\n confirm_hinted_note(context, hinted_note, owner, storage_slot)\n}\n\nfn confirm_hinted_note(\n context: &mut PrivateContext,\n hinted_note: HintedNote,\n owner: Option,\n storage_slot: Field,\n) -> ConfirmedNote\nwhere\n Note: NoteType + NoteHash + Packable,\n{\n // For settled notes, the contract address is implicitly checked since the hash returned from\n // `compute_note_existence_request` is siloed and kernels verify the siloing during note read request validation.\n // Pending notes however are read with the unsiloed note hash, so we need to check that the contract address\n // returned from the oracle matches. Since branching in circuits is expensive, we perform this check on all note\n // types.\n assert(hinted_note.contract_address.eq(context.this_address()), \"Note contract address mismatch.\");\n\n // If an owner was provided in the function call, we need to check that it matches the one in the note. This is\n // necessary because if there were two valid notes that differed only by owner, the note existence request check\n // below would still pass even if the owner on the input would not match the one in the note.\n if owner.is_some() {\n assert(hinted_note.owner.eq(owner.unwrap_unchecked()), \"Note owner mismatch.\");\n }\n\n // We need to constrain that the storage slot in the hinted note matches the value on the input. Note that this\n // assertion could be avoided if we did not receive the storage slot from the oracle but we instead directly\n // injected it into the returned note type (e.g. by doing something like `HintedNote::from(hinted_note_from_oracle,\n // storage_slot)`). This optimization is too low of a priority now.\n assert(hinted_note.storage_slot == storage_slot, \"Note storage slot mismatch.\");\n\n let note_existence_request = compute_note_existence_request(hinted_note);\n context.assert_note_exists(note_existence_request);\n\n ConfirmedNote::new(hinted_note, note_existence_request.note_hash())\n}\n\n/// Returns a BoundedVec of notes that have been proven to have been created by this contract, either in the current or\n/// past transactions (i.e. pending or settled notes). A second BoundedVec contains the note hashes used for the read\n/// requests, which can save constraints when computing the note's nullifiers.\n///\n/// WARNING: recall that notes are never destroyed! Note existence therefore does not imply that the note is _current_\n/// or _valid_ - this typically requires also emitting the note's nullifier to prove that it had not been emitted\n/// before. Because of this, calling this function directly from end-user applications should be discouraged, and safe\n/// abstractions such as aztec-nr's state variables should be used instead.\npub fn get_notes(\n context: &mut PrivateContext,\n storage_slot: Field,\n options: NoteGetterOptions,\n) -> BoundedVec, MAX_NOTE_HASH_READ_REQUESTS_PER_CALL>\nwhere\n Note: NoteType + NoteHash + Eq + Packable,\n{\n // Safety: The notes are constrained below.\n let maybe_hinted_notes = unsafe { get_notes_internal(storage_slot, options) };\n\n // We apply the constraints in a separate function instead of inlining them here to make it easier to test that\n // these checks correctly reject bad notes.\n confirm_hinted_notes(context, storage_slot, maybe_hinted_notes, options)\n}\n\nunconstrained fn apply_preprocessor(\n notes: [Option; MAX_NOTE_HASH_READ_REQUESTS_PER_CALL],\n preprocessor: fn([Option; MAX_NOTE_HASH_READ_REQUESTS_PER_CALL], PreprocessorArgs) -> [Option; MAX_NOTE_HASH_READ_REQUESTS_PER_CALL],\n preprocessor_args: PreprocessorArgs,\n) -> [Option; MAX_NOTE_HASH_READ_REQUESTS_PER_CALL] {\n preprocessor(notes, preprocessor_args)\n}\n\nfn confirm_hinted_notes(\n context: &mut PrivateContext,\n storage_slot: Field,\n maybe_hinted_notes: [Option>; MAX_NOTE_HASH_READ_REQUESTS_PER_CALL],\n options: NoteGetterOptions,\n) -> BoundedVec, MAX_NOTE_HASH_READ_REQUESTS_PER_CALL>\nwhere\n Note: NoteType + NoteHash + Eq + Packable,\n{\n // The filter is applied first to avoid pushing note read requests for notes we're not interested in. Note that\n // while the filter function can technically mutate the notes (as opposed to simply removing some), the private\n // kernel will later validate that these note actually exist, so transformations would cause for that check to\n // fail.\n let filter_fn = options.filter;\n let filter_args = options.filter_args;\n let filtered_notes = filter_fn(maybe_hinted_notes, filter_args);\n\n let hinted_notes = array::collapse(filtered_notes);\n\n // We have now collapsed the sparse array of Options into a BoundedVec. This is a more ergonomic type and also\n // results in reduced gate counts when setting a limit value, since we guarantee that the limit is an upper bound\n // for the runtime length, and can therefore have fewer loop iterations.\n assert(hinted_notes.len() <= options.limit, \"Got more notes than limit.\");\n\n // What remains is to iterate over the hinted notes, assert their existence, and convert them into confirmed notes.\n // Naively, we would construct a `BoundedVec` and simply `push` into it as we process each hinted\n // note. We cannot use `BoundedVec::map` as the user specified the maximum number of notes in `options.limit`\n // instead of a numeric type parameter (which is more ergonomic), and `map` requires the latter.\n // Unfortunately, this results in terrible proving time performance. This is because the compiler is not smart\n // enough to understand the structure of looping over the `BoundedVec`: it treats every `push` as a\n // conditional write to the confirmed array, resulting in runtime write indices (e.g. iteration 1 could write to\n // indices either 0 or 1, beucase iteration 0 might not push).\n // The loop does however have an interesting structure that we can reason about to achieve better performance:\n // because we're just going over a `BoundedVec`, the first `vec.len()` iterations will result in writes, and the\n // rest will not. Hence, we can just _unconditionally_ write to a raw storage array at the iteration index: we know\n // the resulting array will have no gaps. Because of this, we can then manually create a correct `BoundedVec`.\n let mut confirmed_notes_bvec_storage: [ConfirmedNote<_>; _] = std::mem::zeroed();\n\n let mut prev_packed_note = [0; M];\n for i in 0..options.limit {\n if i < hinted_notes.len() {\n let hinted_note = hinted_notes.get_unchecked(i);\n\n // For settled notes, the contract address is implicitly checked since the hash returned from\n // `compute_note_existence_request` is siloed and kernels verify the siloing during note read request\n // validation. Pending notes however are read with the unsiloed note hash, so we need to check that the\n // contract address returned from the oracle matches. Since branching in circuits is expensive, we perform\n // this check on all note types.\n assert(hinted_note.contract_address.eq(context.this_address()), \"Note contract address mismatch.\");\n\n // If owner is provided, constrain that it matches the owner in the hinted note.\n if options.owner.is_some() {\n assert(hinted_note.owner.eq(options.owner.unwrap()), \"Note owner mismatch.\");\n }\n\n // We need to constrain that the storage slot in the hinted note matches the value on the input. Note that\n // this assertion could be avoided if we did not receive the storage slot from the oracle but we instead\n // directly injected it into the returned note type (e.g. by doing something like\n // `HintedNote::from(hinted_note_from_oracle, storage_slot)`). This optimization is too low of a priority\n // now.\n assert(hinted_note.storage_slot == storage_slot, \"Note storage slot mismatch.\");\n\n let packed_note = hinted_note.note.pack();\n check_packed_note(packed_note, options.selects);\n if i != 0 {\n assert_notes_order(prev_packed_note, packed_note, options.sorts);\n }\n prev_packed_note = packed_note;\n\n let note_existence_request = compute_note_existence_request(hinted_note);\n context.assert_note_exists(note_existence_request);\n\n confirmed_notes_bvec_storage[i] = ConfirmedNote::new(hinted_note, note_existence_request.note_hash());\n };\n }\n\n BoundedVec::from_parts(confirmed_notes_bvec_storage, hinted_notes.len())\n}\n\npub unconstrained fn view_note(owner: Option, storage_slot: Field) -> HintedNote\nwhere\n Note: NoteType + Packable,\n{\n let maybe_hinted_notes: [_; 1] = oracle::notes::get_notes(\n owner,\n storage_slot,\n 0,\n [],\n [],\n [],\n [],\n [],\n [],\n [],\n [],\n [],\n 1, // limit\n 0, // offset\n NoteStatus.ACTIVE,\n );\n\n maybe_hinted_notes[0].expect(f\"Failed to get a note\")\n}\n\nunconstrained fn get_notes_internal(\n storage_slot: Field,\n options: NoteGetterOptions,\n) -> [Option>; MAX_NOTE_HASH_READ_REQUESTS_PER_CALL]\nwhere\n Note: NoteType + Packable,\n{\n // This function simply performs some transformations from NoteGetterOptions into the types required by the oracle.\n let (num_selects, select_by_indexes, select_by_offsets, select_by_lengths, select_values, select_comparators, sort_by_indexes, sort_by_offsets, sort_by_lengths, sort_order) =\n flatten_options(options.selects, options.sorts);\n\n let maybe_hinted_notes = oracle::notes::get_notes(\n options.owner,\n storage_slot,\n num_selects,\n select_by_indexes,\n select_by_offsets,\n select_by_lengths,\n select_values,\n select_comparators,\n sort_by_indexes,\n sort_by_offsets,\n sort_by_lengths,\n sort_order,\n options.limit,\n options.offset,\n options.status,\n );\n\n apply_preprocessor(\n maybe_hinted_notes,\n options.preprocessor,\n options.preprocessor_args,\n )\n}\n\n/// Unconstrained variant of `get_notes`, meant to be used in unconstrained execution contexts. Notably only the note\n/// content is returned, and not any of the information used when proving its existence (e.g. note nonce, note hash,\n/// etc.).\npub unconstrained fn view_notes(\n storage_slot: Field,\n options: NoteViewerOptions,\n) -> BoundedVec\nwhere\n Note: NoteType + Packable + Eq,\n{\n let (num_selects, select_by_indexes, select_by_offsets, select_by_lengths, select_values, select_comparators, sort_by_indexes, sort_by_offsets, sort_by_lengths, sort_order) =\n flatten_options(options.selects, options.sorts);\n\n // We fetch the notes from the same oracle we use in the constrained case, except we don't bother inspecting the\n // metadata in order to prove existence.\n let maybe_hinted_notes = oracle::notes::get_notes(\n options.owner,\n storage_slot,\n num_selects,\n select_by_indexes,\n select_by_offsets,\n select_by_lengths,\n select_values,\n select_comparators,\n sort_by_indexes,\n sort_by_offsets,\n sort_by_lengths,\n sort_order,\n options.limit,\n options.offset,\n options.status,\n );\n\n // Even though we don't expect for the maybe_hinted_notes array to be sparse, collapse is still useful in this case\n // to convert it into a BoundedVec.\n array::collapse(maybe_hinted_notes).map(\n // view_notes just returns the actual note, so we drop the metadata\n |hinted_note| hinted_note.note,\n )\n}\n\nunconstrained fn flatten_options(\n selects: BoundedVec, N>,\n sorts: BoundedVec, N>,\n) -> (u8, [u8; N], [u8; N], [u8; N], [Field; N], [u8; N], [u8; N], [u8; N], [u8; N], [u8; N]) {\n let mut num_selects = 0;\n let mut select_by_indexes = [0; N];\n let mut select_by_offsets = [0; N];\n let mut select_by_lengths = [0; N];\n let mut select_values = [0; N];\n let mut select_comparators = [0; N];\n\n for i in 0..selects.len() {\n let select = selects.get(i);\n if select.is_some() {\n select_by_indexes[num_selects as u32] = select.unwrap_unchecked().property_selector.index;\n select_by_offsets[num_selects as u32] = select.unwrap_unchecked().property_selector.offset;\n select_by_lengths[num_selects as u32] = select.unwrap_unchecked().property_selector.length;\n select_values[num_selects as u32] = select.unwrap_unchecked().value;\n select_comparators[num_selects as u32] = select.unwrap_unchecked().comparator;\n num_selects += 1;\n };\n }\n\n let mut sort_by_indexes = [0; N];\n let mut sort_by_offsets = [0; N];\n let mut sort_by_lengths = [0; N];\n let mut sort_order = [0; N];\n for i in 0..sorts.len() {\n let sort = sorts.get(i);\n if sort.is_some() {\n sort_by_indexes[i] = sort.unwrap_unchecked().property_selector.index;\n sort_by_offsets[i] = sort.unwrap_unchecked().property_selector.offset;\n sort_by_lengths[i] = sort.unwrap_unchecked().property_selector.length;\n sort_order[i] = sort.unwrap_unchecked().order;\n };\n }\n\n (\n num_selects, select_by_indexes, select_by_offsets, select_by_lengths, select_values, select_comparators,\n sort_by_indexes, sort_by_offsets, sort_by_lengths, sort_order,\n )\n}\n" }, "184": { "function_locations": [ { "name": "NoteMessage::new", "start": 1285 }, { "name": "NoteMessage::deliver", "start": 2598 }, { "name": "NoteMessage::deliver_to", "start": 3771 }, { "name": "NoteMessage::get_note", "start": 4750 }, { "name": "NoteMessage::get_new_note", "start": 5059 }, { "name": "MaybeNoteMessage::new", "start": 6543 }, { "name": "MaybeNoteMessage::deliver", "start": 6986 }, { "name": "MaybeNoteMessage::deliver_to", "start": 7579 }, { "name": "MaybeNoteMessage::get_note", "start": 7855 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/note/note_message.nr", "source": "use crate::{\n context::PrivateContext,\n messages::{\n delivery::{do_private_message_delivery, MessageDeliveryBuilder},\n logs::note::encode_private_note_message,\n },\n note::{lifecycle::NewNote, note_interface::NoteType},\n};\nuse crate::protocol::{address::AztecAddress, traits::Packable};\n\n/// A message with information about a note that was created in the current contract call. This message **MUST** be\n/// delivered to a recipient in order to not lose the private note information.\n///\n/// Use [`NoteMessage::deliver`] to select a delivery mechanism. The same message can be delivered to multiple\n/// recipients.\n#[must_use = \"Unused NoteMessage result - use the `deliver` function to prevent the note information from being lost forever\"]\npub struct NoteMessage {\n pub(crate) new_note: NewNote,\n\n // NoteMessage is constructed when a note is created, which means that the `context` object will be in scope. By\n // storing a reference to it inside this object we remove the need for its methods to receive it, resulting in a\n // cleaner end-user API.\n context: &mut PrivateContext,\n}\n\nimpl NoteMessage\nwhere\n Note: NoteType + Packable,\n{\n pub fn new(new_note: NewNote, context: &mut PrivateContext) -> Self {\n Self { new_note, context }\n }\n\n /// Delivers the note message to its owner, providing them access to the private note information.\n ///\n /// The message is first encrypted to the owner's public key, ensuring no other actor can read it.\n ///\n /// The `delivery_mode` is produced by the [`crate::messages::delivery::MessageDelivery`] entrypoints\n /// (`offchain`, `onchain_unconstrained`, or `onchain_constrained`). It informs costs (both proving time and TX\n /// fees) as well as delivery guarantees, and must be a compile-time constant.\n ///\n /// To deliver the message to a recipient that is not the note's owner, use [`deliver_to`](NoteMessage::deliver_to)\n /// instead.\n ///\n /// ## Invalid Recipients\n ///\n /// If the note's owner is an invalid address, then a random public key is selected and message delivery continues\n /// as normal. This prevents both 'king of the hill' attacks (where a sender would otherwise fail to deliver a note\n /// to an invalid recipient) and forced privacy leaks (where an invalid recipient results in a unique transaction\n /// fingerprint, e.g. one lacking the private logs that would correspond to message delivery).\n pub fn deliver(self, delivery_mode: D)\n where\n D: MessageDeliveryBuilder,\n {\n self.deliver_to(self.new_note.owner, delivery_mode);\n }\n\n /// Same as [`deliver`](NoteMessage::deliver), except the message gets delivered to an arbitrary `recipient`\n /// instead\n /// of the note owner.\n ///\n /// Note that `recipient` getting the message does not let them **use** the note, it only means that thy will know\n /// about it, including the transaction in which it was created, and prove it exists. They will also not be able to\n /// know when or if the note is used (i.e. nullified), assuming the standard note nullifier function.\n ///\n /// ## Use Cases\n ///\n /// This feature enables many design patterns that diverge in how notes are traditionally handled. For example, an\n /// institutional contract may require to have some actor receive all notes created for compliance purposes. Or a\n /// low value application like a game might deliver all notes offchain to a centralized server that then serves\n /// them via the app, bypassing the need for contract sync and improving UX.\n pub fn deliver_to(self, recipient: AztecAddress, delivery_mode: D)\n where\n D: MessageDeliveryBuilder,\n {\n // Technical note: we're about to call a closure that needs access to `new_note`, but we can't pass `self` to\n // it because the closure might execute in unconstrained mode, and since `self` contains a mutable reference to\n // `context` this would cause for a mutable reference to cross the constrained-unconstrained barrier, which is\n // not allowed. As a workaround, we create a variable without the context and capture that instead.\n let new_note = self.new_note;\n\n do_private_message_delivery(\n self.context,\n || encode_private_note_message(\n new_note.note,\n new_note.owner,\n new_note.storage_slot,\n new_note.randomness,\n ),\n Option::some(self.new_note.note_hash_counter),\n recipient,\n delivery_mode,\n );\n }\n\n /// Returns the note contained in the message.\n pub fn get_note(self) -> Note {\n self.new_note.note\n }\n\n /// Returns the [`NewNote`] container in the message.\n ///\n /// This is an advanced function, typically needed only when creating new kinds of state variables that need to\n /// create [`MaybeNoteMessage`] values.\n pub fn get_new_note(self) -> NewNote {\n self.new_note\n }\n}\n\n/// Same as [`NoteMessage`], except this type also handles the possibility where the note may not have been actually\n/// created depending on runtime conditions (e.g. a token transfer change note is not created if there is no change).\n///\n/// Other than that, it and [`MaybeNoteMessage::deliver`] behave the exact same way as [`NoteMessage`].\n#[must_use = \"Unused NoteMessage result - use the `deliver` function to prevent the note information from being lost forever\"]\npub struct MaybeNoteMessage {\n // We can't simply create an `Option` of `NoteMessage` because that type includes a mutable reference to the\n // `context`. All `Option` methods (map, or, etc.) have if-else expressions in which they might return the\n // contents, and conditionally returning mutable references is disallowed by Noir. Hence, we create this type which\n // only holds `NewNote` in the `Option`, keeping the `context` out.\n maybe_new_note: Option>,\n\n // MaybeNoteMessage is expected to be constructed when a note is created, which means that the `context` object\n // will be in scope. By storing a reference to it inside this object we remove the need for its methods to receive\n // it, resulting in a cleaner end-user API.\n context: &mut PrivateContext,\n}\n\nimpl MaybeNoteMessage\nwhere\n Note: NoteType + Packable,\n{\n pub fn new(maybe_new_note: Option>, context: &mut PrivateContext) -> Self {\n Self { maybe_new_note, context }\n }\n\n /// Same as [`NoteMessage::deliver`], except the message will only be delivered if it actually exists.\n ///\n /// Messages delivered using [`crate::messages::delivery::MessageDelivery::onchain_constrained()`] will\n /// pay proving costs regardless of whether the message exists or not.\n pub fn deliver(self, delivery_mode: D)\n where\n D: MessageDeliveryBuilder,\n {\n if self.maybe_new_note.is_some() {\n NoteMessage::new(self.maybe_new_note.unwrap_unchecked(), self.context).deliver(delivery_mode);\n }\n }\n\n /// Same as [`NoteMessage::deliver_to`], except the message will only be delivered if it actually exists.\n ///\n /// Messages delivered using [`crate::messages::delivery::MessageDelivery::onchain_constrained()`] will\n /// pay proving costs regardless of whether the message exists or not.\n pub fn deliver_to(self, recipient: AztecAddress, delivery_mode: D)\n where\n D: MessageDeliveryBuilder,\n {\n if self.maybe_new_note.is_some() {\n NoteMessage::new(self.maybe_new_note.unwrap_unchecked(), self.context).deliver_to(recipient, delivery_mode);\n }\n }\n\n /// Returns the note contained in the message.\n pub fn get_note(self) -> Option {\n self.maybe_new_note.map(|new_note| new_note.note)\n }\n}\n" }, "185": { "function_locations": [ { "name": "NoteMetadata::from_raw_data", "start": 2912 }, { "name": "NoteMetadata::is_pending_same_phase", "start": 3715 }, { "name": "NoteMetadata::is_pending_previous_phase", "start": 4222 }, { "name": "NoteMetadata::is_settled", "start": 4474 }, { "name": "NoteMetadata::to_pending_same_phase", "start": 4703 }, { "name": "NoteMetadata::to_pending_previous_phase", "start": 5050 }, { "name": "NoteMetadata::to_settled", "start": 5380 }, { "name": " for NoteMetadata>::from", "start": 5646 }, { "name": " for NoteMetadata>::from", "start": 5843 }, { "name": " for NoteMetadata>::from", "start": 6014 }, { "name": "PendingSamePhaseNoteMetadata::new", "start": 6916 }, { "name": "PendingPreviousPhaseNoteMetadata::new", "start": 7900 }, { "name": "PendingPreviousPhaseNoteMetadata::note_nonce", "start": 7974 }, { "name": "SettledNoteMetadata::new", "start": 8478 }, { "name": "SettledNoteMetadata::note_nonce", "start": 8552 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/note/note_metadata.nr", "source": "use crate::protocol::traits::{Deserialize, Packable, Serialize};\n\n// There's temporarily quite a bit of boilerplate here because Noir does not yet support enums. This file will\n// eventually be simplified into something closer to:\n//\n// pub enum NoteMetadata {\n// PendingSamePhase{ note_hash_counter: u32 }, PendingOtherPhase{ note_hash_counter: u32, note_nonce: Field },\n// Settled{ note_nonce: Field },\n// }\n//\n// For now, we have `NoteMetadata` acting as a sort of tagged union.\n\nstruct NoteStageEnum {\n /// A note created in the current transaction during the current execution phase.\n ///\n /// Notes from the non-revertible phase will be in this stage if the transaction is still in the non-revertible\n /// phase, notes from the revertible phase will be in this stage until the transaction ends.\n ///\n /// These notes are not yet in the note hash tree, though they will be inserted unless nullified in this\n /// transaction (becoming a transient note).\n PENDING_SAME_PHASE: u8,\n /// A note created in the current transaction during the previous execution phase.\n ///\n /// Because there are only two phases and their order is always the same (first non-revertible and then revertible)\n /// this implies that the note was created in the non-revertible phase, and that the current phase is the\n /// revertible phase.\n ///\n /// These notes are not yet in the note hash tree, though they will be inserted **even if nullified in this\n /// transaction**. This means that they must be nullified as if they were settled (i.e. using the unique note hash)\n /// in order to avoid double spends once they become settled.\n PENDING_PREVIOUS_PHASE: u8,\n /// A note created in a prior transaction.\n ///\n /// Settled notes have already been inserted into the note hash tree.\n SETTLED: u8,\n}\n\nglobal NoteStage: NoteStageEnum = NoteStageEnum { PENDING_SAME_PHASE: 1, PENDING_PREVIOUS_PHASE: 2, SETTLED: 3 };\n\n/// The metadata required to both prove a note's existence and destroy it, by computing the correct note hash for\n/// kernel read requests, as well as the correct nullifier to avoid double-spends.\n///\n/// This represents a note in any of the three valid stages (pending same phase, pending previous phase, or settled).\n/// In order to access the underlying fields callers must first find the appropriate stage (e.g. via `is_settled()`)\n/// and then convert this into the appropriate type (e.g. via `to_settled()`).\n#[derive(Deserialize, Eq, Serialize, Packable)]\npub struct NoteMetadata {\n stage: u8,\n maybe_note_nonce: Field,\n}\n\nimpl NoteMetadata {\n /// Constructs a `NoteMetadata` object from optional note hash counter and nonce. Both a zero note hash counter and\n /// a zero nonce are invalid, so those are used to signal non-existent values.\n pub fn from_raw_data(nonzero_note_hash_counter: bool, maybe_note_nonce: Field) -> Self {\n if nonzero_note_hash_counter {\n if maybe_note_nonce == 0 {\n Self { stage: NoteStage.PENDING_SAME_PHASE, maybe_note_nonce }\n } else {\n Self { stage: NoteStage.PENDING_PREVIOUS_PHASE, maybe_note_nonce }\n }\n } else if maybe_note_nonce != 0 {\n Self { stage: NoteStage.SETTLED, maybe_note_nonce }\n } else {\n panic(\n f\"Note has a zero note hash counter and no nonce - existence cannot be proven\",\n )\n }\n }\n\n /// Returns `true` if the note is pending **and** from the same phase, i.e. if it's been created in the current\n /// transaction during the current execution phase (either non-revertible or revertible).\n pub fn is_pending_same_phase(self) -> bool {\n self.stage == NoteStage.PENDING_SAME_PHASE\n }\n\n /// Returns `true` if the note is pending **and** from the previous phase, i.e. if it's been created in the current\n /// transaction during an execution phase prior to the current one. Because private execution only has two phases\n /// with strict ordering, this implies that the note was created in the non-revertible phase, and that the current\n /// phase is the revertible phase.\n pub fn is_pending_previous_phase(self) -> bool {\n self.stage == NoteStage.PENDING_PREVIOUS_PHASE\n }\n\n /// Returns `true` if the note is settled, i.e. if it's been created in a prior transaction and is therefore\n /// already in the note hash tree.\n pub fn is_settled(self) -> bool {\n self.stage == NoteStage.SETTLED\n }\n\n /// Asserts that the metadata is that of a pending note from the same phase and converts it accordingly.\n pub fn to_pending_same_phase(self) -> PendingSamePhaseNoteMetadata {\n assert_eq(self.stage, NoteStage.PENDING_SAME_PHASE, \"Note is not in stage PENDING_SAME_PHASE\");\n PendingSamePhaseNoteMetadata::new()\n }\n\n /// Asserts that the metadata is that of a pending note from a previous phase and converts it accordingly.\n pub fn to_pending_previous_phase(self) -> PendingPreviousPhaseNoteMetadata {\n assert_eq(self.stage, NoteStage.PENDING_PREVIOUS_PHASE, \"Note is not in stage PENDING_PREVIOUS_PHASE\");\n PendingPreviousPhaseNoteMetadata::new(self.maybe_note_nonce)\n }\n\n /// Asserts that the metadata is that of a settled note and converts it accordingly.\n pub fn to_settled(self) -> SettledNoteMetadata {\n assert_eq(self.stage, NoteStage.SETTLED, \"Note is not in stage SETTLED\");\n SettledNoteMetadata::new(self.maybe_note_nonce)\n }\n}\n\nimpl From for NoteMetadata {\n fn from(_value: PendingSamePhaseNoteMetadata) -> Self {\n NoteMetadata::from_raw_data(true, std::mem::zeroed())\n }\n}\n\nimpl From for NoteMetadata {\n fn from(value: PendingPreviousPhaseNoteMetadata) -> Self {\n NoteMetadata::from_raw_data(true, value.note_nonce())\n }\n}\n\nimpl From for NoteMetadata {\n fn from(value: SettledNoteMetadata) -> Self {\n NoteMetadata::from_raw_data(false, value.note_nonce())\n }\n}\n\n/// The metadata required to both prove a note's existence and destroy it, by computing the correct note hash for\n/// kernel read requests, as well as the correct nullifier to avoid double-spends.\n///\n/// This represents a pending same phase note, i.e. a note that was created in the transaction that is currently being\n/// executed during the current execution phase (either non-revertible or revertible).\npub struct PendingSamePhaseNoteMetadata {\n // This struct contains no fields since there is no metadata associated with a pending same phase note: it has no nonce (since it may get squashed by a nullifier emitted in the same phase), and while it does have a note hash counter we cannot constrain its value (and don't need to - only that it is non-zero).\n}\n\nimpl PendingSamePhaseNoteMetadata {\n pub fn new() -> Self {\n Self {}\n }\n}\n\n/// The metadata required to both prove a note's existence and destroy it, by computing the correct note hash for\n/// kernel read requests, as well as the correct nullifier to avoid double-spends.\n///\n/// This represents a pending previous phase note, i.e. a note that was created in the transaction that is currently\n/// being executed, during the previous execution phase. Because there are only two phases and their order is always\n/// the same (first non-revertible and then revertible) this implies that the note was created in the non-revertible\n/// phase, and that the current phase is the revertible phase.\npub struct PendingPreviousPhaseNoteMetadata {\n note_nonce: Field,\n // This struct does not contain a note hash counter, even though one exists for this note, because we cannot\n // constrain its value (and don't need to - only that it is non-zero).\n}\n\nimpl PendingPreviousPhaseNoteMetadata {\n pub fn new(note_nonce: Field) -> Self {\n Self { note_nonce }\n }\n\n pub fn note_nonce(self) -> Field {\n self.note_nonce\n }\n}\n\n/// The metadata required to both prove a note's existence and destroy it, by computing the correct note hash for\n/// kernel read requests, as well as the correct nullifier to avoid double-spends.\n///\n/// This represents a settled note, i.e. a note that was created in a prior transaction and is therefore already in the\n/// note hash tree.\npub struct SettledNoteMetadata {\n note_nonce: Field,\n}\n\nimpl SettledNoteMetadata {\n pub fn new(note_nonce: Field) -> Self {\n Self { note_nonce }\n }\n\n pub fn note_nonce(self) -> Field {\n self.note_nonce\n }\n}\n" }, "187": { "function_locations": [ { "name": "compute_note_hash", "start": 853 }, { "name": "compute_note_nullifier", "start": 1702 }, { "name": "compute_note_existence_request", "start": 2210 }, { "name": "compute_note_hash_for_nullification", "start": 3396 }, { "name": "compute_confirmed_note_hash_for_nullification", "start": 4448 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/note/utils.nr", "source": "use crate::{context::NoteExistenceRequest, note::{ConfirmedNote, HintedNote, note_interface::NoteHash}};\n\nuse crate::protocol::{\n constants::{DOM_SEP__NOTE_HASH, DOM_SEP__NOTE_NULLIFIER},\n hash::{compute_siloed_note_hash, compute_unique_note_hash, poseidon2_hash_with_separator},\n};\n\n/// Computes a domain-separated note hash.\n///\n/// Receives the `storage_slot` of the [`crate::state_vars::StateVariable`] that holds the note, plus any arbitrary\n/// note `data`. This typically includes randomness, owner, and domain specific values (e.g. numeric amount, address,\n/// id, etc.).\n///\n/// Usage of this function guarantees that different state variables will never produce colliding note hashes, even if\n/// their underlying notes have different implementations.\npub fn compute_note_hash(storage_slot: Field, data: [Field; N]) -> Field {\n // All state variables have different storage slots, so by placing this at a fixed first position in the preimage\n // we prevent collisions.\n poseidon2_hash_with_separator([storage_slot].concat(data), DOM_SEP__NOTE_HASH)\n}\n\n/// Computes a domain-separated note nullifier.\n///\n/// Receives the `note_hash_for_nullification` of the note (usually returned by\n/// [`compute_confirmed_note_hash_for_nullification`]), plus any arbitrary note `data`. This typically includes\n/// secrets, such as the app-siloed nullifier hiding key of the note's owner.\n///\n/// Usage of this function guarantees that different state variables will never produce colliding note nullifiers, even\n/// if their underlying notes have different implementations.\npub fn compute_note_nullifier(note_hash_for_nullification: Field, data: [Field; N]) -> Field {\n // All notes have different note hashes for nullification (i.e. transient or settled), so by placing this at a\n // fixed first position in the preimage we prevent collisions.\n poseidon2_hash_with_separator(\n [note_hash_for_nullification].concat(data),\n DOM_SEP__NOTE_NULLIFIER,\n )\n}\n\n/// Returns the [`NoteExistenceRequest`] used to prove a note exists.\npub fn compute_note_existence_request(hinted_note: HintedNote) -> NoteExistenceRequest\nwhere\n Note: NoteHash,\n{\n let note_hash =\n hinted_note.note.compute_note_hash(hinted_note.owner, hinted_note.storage_slot, hinted_note.randomness);\n\n if hinted_note.metadata.is_settled() {\n // Settled notes are read by siloing with contract address and nonce (resulting in the final unique note hash,\n // which is already in the note hash tree).\n let siloed_note_hash = compute_siloed_note_hash(hinted_note.contract_address, note_hash);\n NoteExistenceRequest::for_settled(compute_unique_note_hash(\n hinted_note.metadata.to_settled().note_nonce(),\n siloed_note_hash,\n ))\n } else {\n // Pending notes (both same phase and previous phase ones) are read by their non-siloed hash (not even by\n // contract address), which is what is stored in the new note hashes array (at the position hinted by note hash\n // counter).\n NoteExistenceRequest::for_pending(note_hash, hinted_note.contract_address)\n }\n}\n\n/// Unconstrained variant of [`compute_confirmed_note_hash_for_nullification`].\npub unconstrained fn compute_note_hash_for_nullification(hinted_note: HintedNote) -> Field\nwhere\n Note: NoteHash,\n{\n // Creating a ConfirmedNote like we do here is typically unsafe, as we've not confirmed existence. We can do it\n // here because this is an unconstrained function, so the returned value should not make its way to a constrained\n // function. This lets us reuse the `compute_confirmed_note_hash_for_nullification` implementation.\n compute_confirmed_note_hash_for_nullification(ConfirmedNote::new(\n hinted_note,\n compute_note_existence_request(hinted_note).note_hash(),\n ))\n}\n\n/// Returns the note hash to use when computing its nullifier.\n///\n/// The `note_hash_for_nullification` parameter [`NoteHash::compute_nullifier`] takes depends on the note's stage, e.g.\n/// settled notes use the unique note hash, but pending notes cannot as they have no nonce. This function returns the\n/// correct note hash to use.\n///\n/// Use [`compute_note_hash_for_nullification`] when computing this value in unconstrained functions.\npub fn compute_confirmed_note_hash_for_nullification(confirmed_note: ConfirmedNote) -> Field {\n // There is just one instance in which the note hash for nullification does not match the note hash used for a read\n // request, which is when dealing with pending previous phase notes. These had their existence proven using their\n // non-siloed note hash along with the note hash counter (like all pending notes), but since they will be\n // unconditionally inserted in the note hash tree (since they cannot be squashed) they must be nullified using the\n // *unique* note hash. If we didn't, it'd be possible to emit a second different nullifier for the same note in a\n // follow up transaction, once the note is settled, resulting in a double spend.\n\n if confirmed_note.metadata.is_pending_previous_phase() {\n let siloed_note_hash = compute_siloed_note_hash(\n confirmed_note.contract_address,\n confirmed_note.proven_note_hash,\n );\n let note_nonce = confirmed_note.metadata.to_pending_previous_phase().note_nonce();\n\n compute_unique_note_hash(note_nonce, siloed_note_hash)\n } else {\n confirmed_note.proven_note_hash\n }\n}\n" }, "190": { "function_locations": [ { "name": "aes128_decrypt_oracle", "start": 194 }, { "name": "try_aes128_decrypt", "start": 1046 }, { "name": "test::aes_encrypt_then_decrypt", "start": 1860 }, { "name": "test::aes_encrypt_then_decrypt_with_bad_sym_key_is_caught", "start": 3150 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/oracle/aes128_decrypt.nr", "source": "#[oracle(aztec_utl_decryptAes128)]\nunconstrained fn aes128_decrypt_oracle(\n ciphertext: BoundedVec,\n iv: [u8; 16],\n sym_key: [u8; 16],\n) -> Option> {}\n\n/// Attempts to decrypt a ciphertext using AES128.\n///\n/// Returns `Option::some(plaintext)` on success, or `Option::none()` if decryption fails (e.g. due to malformed\n/// ciphertext or invalid PKCS#7 padding). Note that decryption with the wrong key will almost always return `None`\n/// because the decrypted garbage data will have invalid PKCS#7 padding.\n///\n/// Note that we accept ciphertext as a BoundedVec, not as an array. This is because this function is typically used\n/// when processing logs and at that point we don't have comptime information about the length of the ciphertext as\n/// the log is not specific to any individual note.\n// TODO(F-498): review naming consistency\npub unconstrained fn try_aes128_decrypt(\n ciphertext: BoundedVec,\n iv: [u8; 16],\n sym_key: [u8; 16],\n) -> Option> {\n aes128_decrypt_oracle(ciphertext, iv, sym_key)\n}\n\nmod test {\n use crate::{\n keys::ecdh_shared_secret::compute_app_siloed_shared_secret,\n messages::encryption::aes128::derive_aes_symmetric_key_and_iv_from_shared_secret,\n utils::{array::subarray::subarray, point::point_from_x_coord},\n };\n use crate::protocol::address::AztecAddress;\n use crate::test::helpers::test_environment::TestEnvironment;\n use super::try_aes128_decrypt;\n use std::aes128::aes128_encrypt;\n\n global CONTRACT_ADDRESS: AztecAddress = AztecAddress { inner: 42 };\n global TEST_PLAINTEXT_LENGTH: u32 = 10;\n global TEST_CIPHERTEXT_LENGTH: u32 = 16;\n global TEST_PADDING_LENGTH: u32 = TEST_CIPHERTEXT_LENGTH - TEST_PLAINTEXT_LENGTH;\n\n #[test]\n unconstrained fn aes_encrypt_then_decrypt() {\n let env = TestEnvironment::new();\n\n env.utility_context(|_| {\n let shared_secret_point = point_from_x_coord(1).unwrap();\n let s_app = compute_app_siloed_shared_secret(shared_secret_point, CONTRACT_ADDRESS);\n\n let (sym_key, iv) = derive_aes_symmetric_key_and_iv_from_shared_secret::<1>(s_app)[0];\n\n let plaintext: [u8; TEST_PLAINTEXT_LENGTH] = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9];\n\n let ciphertext: [u8; TEST_CIPHERTEXT_LENGTH] = aes128_encrypt(plaintext, iv, sym_key);\n\n let ciphertext_bvec = BoundedVec::::from_array(ciphertext);\n\n let received_plaintext = try_aes128_decrypt(ciphertext_bvec, iv, sym_key).unwrap();\n assert_eq(received_plaintext.len(), TEST_PLAINTEXT_LENGTH);\n assert_eq(received_plaintext.max_len(), TEST_CIPHERTEXT_LENGTH);\n assert_eq(subarray::<_, _, TEST_PLAINTEXT_LENGTH>(received_plaintext.storage(), 0), plaintext);\n assert_eq(\n subarray::<_, _, TEST_PADDING_LENGTH>(received_plaintext.storage(), TEST_PLAINTEXT_LENGTH),\n [0 as u8; TEST_PADDING_LENGTH],\n );\n })\n }\n\n #[test]\n unconstrained fn aes_encrypt_then_decrypt_with_bad_sym_key_is_caught() {\n let env = TestEnvironment::new();\n\n env.utility_context(|_| {\n // Decrypting with the wrong key results in garbage data with invalid PKCS#7 padding,\n // so the oracle returns None.\n let shared_secret_point = point_from_x_coord(1).unwrap();\n let s_app = compute_app_siloed_shared_secret(shared_secret_point, CONTRACT_ADDRESS);\n\n let (sym_key, iv) = derive_aes_symmetric_key_and_iv_from_shared_secret::<1>(s_app)[0];\n\n let plaintext: [u8; TEST_PLAINTEXT_LENGTH] = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9];\n let ciphertext: [u8; TEST_CIPHERTEXT_LENGTH] = aes128_encrypt(plaintext, iv, sym_key);\n\n let mut bad_sym_key = sym_key;\n bad_sym_key[0] = 0;\n\n let ciphertext_bvec = BoundedVec::::from_array(ciphertext);\n // Decryption with wrong key returns None because the garbage output has invalid PKCS#7 padding.\n let result = try_aes128_decrypt(ciphertext_bvec, iv, bad_sym_key);\n assert(result.is_none(), \"decryption with bad key should return None\");\n });\n }\n}\n" }, "197": { "function_locations": [ { "name": "set_contract_sync_cache_invalid_oracle", "start": 242 }, { "name": "set_contract_sync_cache_invalid", "start": 700 } ], "path": "/home/nventuro/pkg-1/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(\n contract_address: AztecAddress,\n scopes: BoundedVec,\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(\n contract_address: AztecAddress,\n scopes: BoundedVec,\n) {\n set_contract_sync_cache_invalid_oracle(contract_address, scopes);\n}\n" }, "199": { "function_locations": [ { "name": "get_utility_context_oracle", "start": 582 }, { "name": "get_utility_context", "start": 786 } ], "path": "/home/nventuro/pkg-1/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" }, "200": { "function_locations": [ { "name": "store", "start": 192 }, { "name": "set_hash_preimage_oracle_wrapper", "start": 583 }, { "name": "load", "start": 739 }, { "name": "set_hash_preimage_oracle", "start": 905 }, { "name": "get_hash_preimage_oracle", "start": 1028 } ], "path": "/home/nventuro/pkg-1/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(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(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(hash: Field) -> [Field; N] {\n get_hash_preimage_oracle(hash)\n}\n\n#[oracle(aztec_prv_setHashPreimage)]\nunconstrained fn set_hash_preimage_oracle(_values: [Field; N], _hash: Field) {}\n\n#[oracle(aztec_prv_getHashPreimage)]\nunconstrained fn get_hash_preimage_oracle(_hash: Field) -> [Field; N] {}\n" }, "207": { "function_locations": [ { "name": "get_key_validation_request_oracle", "start": 229 }, { "name": "get_key_validation_request", "start": 341 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/oracle/key_validation_request.nr", "source": "use crate::protocol::abis::validation_requests::KeyValidationRequest;\n\n#[oracle(aztec_utl_getKeyValidationRequest)]\nunconstrained fn get_key_validation_request_oracle(_pk_m_hash: Field, _key_index: Field) -> KeyValidationRequest {}\n\npub unconstrained fn get_key_validation_request(pk_m_hash: Field, key_index: Field) -> KeyValidationRequest {\n get_key_validation_request_oracle(pk_m_hash, key_index)\n}\n" }, "208": { "function_locations": [ { "name": "get_public_keys_and_partial_address", "start": 244 }, { "name": "get_public_keys_and_partial_address_oracle", "start": 781 }, { "name": "try_get_public_keys_and_partial_address", "start": 958 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/oracle/keys.nr", "source": "use crate::protocol::{address::{AztecAddress, PartialAddress}, public_keys::PublicKeys};\n\n// TODO(F-498): review naming consistency\npub unconstrained fn get_public_keys_and_partial_address(address: AztecAddress) -> (PublicKeys, PartialAddress) {\n try_get_public_keys_and_partial_address(address).expect(f\"Public keys not registered for account {address}\")\n}\n\n/// Five of the six master public keys are exposed only as hashes; `ivpk_m` is sent as its affine coordinates because\n/// address derivation and encrypt-to-address require the point in-circuit. This point is assumed to be non-infinite.\n#[oracle(aztec_utl_getPublicKeysAndPartialAddress)]\nunconstrained fn get_public_keys_and_partial_address_oracle(\n _address: AztecAddress,\n) -> Option<(PublicKeys, PartialAddress)> {}\n\n// TODO(F-498): review naming consistency\npub unconstrained fn try_get_public_keys_and_partial_address(\n address: AztecAddress,\n) -> Option<(PublicKeys, PartialAddress)> {\n get_public_keys_and_partial_address_oracle(address)\n}\n" }, "210": { "function_locations": [ { "name": "get_pending_tagged_logs", "start": 1048 }, { "name": "get_pending_tagged_logs_oracle", "start": 1323 }, { "name": "validate_and_store_enqueued_notes_and_events", "start": 1630 }, { "name": "validate_and_store_enqueued_notes_and_events_oracle", "start": 2049 }, { "name": "get_logs_by_tag", "start": 2489 }, { "name": "get_logs_by_tag_oracle", "start": 2717 }, { "name": "get_tx_effect", "start": 2854 }, { "name": "get_tx_effect_oracle", "start": 3000 }, { "name": "get_tx_effects", "start": 3193 }, { "name": "get_tx_effects_oracle", "start": 3378 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/oracle/message_processing.nr", "source": "use crate::ephemeral::EphemeralArray;\nuse crate::messages::processing::{\n event_validation_request::EventValidationRequest, log_retrieval_request::LogRetrievalRequest,\n log_retrieval_response::LogRetrievalResponse, NoteValidationRequest, pending_tagged_log::PendingTaggedLog,\n provided_secret::ProvidedSecret,\n};\nuse crate::protocol::address::AztecAddress;\nuse crate::protocol::blob_data::TxEffect;\n\n/// Finds new private logs that may have been sent to all registered accounts in PXE in the current contract and\n/// returns them in an ephemeral array with an oracle-allocated base slot.\n///\n/// # Arguments\n///\n/// * `scope` - The account scope to search under.\n/// * `provided_secrets` - Tagging secrets the app supplies explicitly, searched alongside the secrets PXE manages\n/// internally. Used for secrets PXE cannot derive itself (e.g. handshake-derived ones).\npub(crate) unconstrained fn get_pending_tagged_logs(\n scope: AztecAddress,\n provided_secrets: EphemeralArray,\n) -> EphemeralArray {\n get_pending_tagged_logs_oracle(scope, provided_secrets)\n}\n\n#[oracle(aztec_utl_getPendingTaggedLogsV2)]\nunconstrained fn get_pending_tagged_logs_oracle(\n scope: AztecAddress,\n provided_secrets: EphemeralArray,\n) -> EphemeralArray {}\n\n/// Validates note/event requests stored in ephemeral arrays.\npub(crate) unconstrained fn validate_and_store_enqueued_notes_and_events(\n note_validation_requests: EphemeralArray,\n event_validation_requests: EphemeralArray,\n scope: AztecAddress,\n) {\n validate_and_store_enqueued_notes_and_events_oracle(note_validation_requests, event_validation_requests, scope);\n}\n\n#[oracle(aztec_utl_validateAndStoreEnqueuedNotesAndEvents)]\nunconstrained fn validate_and_store_enqueued_notes_and_events_oracle(\n note_validation_requests: EphemeralArray,\n event_validation_requests: EphemeralArray,\n scope: AztecAddress,\n) {}\n\n/// Fetches all logs matching each request's tag and returns a nested ephemeral array.\n///\n/// Each element in the outer array is an inner `EphemeralArray` containing all matching logs for\n/// the request at the same index (which may be empty if no logs were found).\npub unconstrained fn get_logs_by_tag(\n requests: EphemeralArray,\n) -> EphemeralArray> {\n get_logs_by_tag_oracle(requests)\n}\n\n#[oracle(aztec_utl_getLogsByTagV2)]\nunconstrained fn get_logs_by_tag_oracle(\n requests: EphemeralArray,\n) -> EphemeralArray> {}\n\n/// Fetches all effects of a settled transaction by its hash.\npub unconstrained fn get_tx_effect(tx_hash: Field) -> Option {\n get_tx_effect_oracle(tx_hash)\n}\n\n#[oracle(aztec_utl_getTxEffect)]\nunconstrained fn get_tx_effect_oracle(tx_hash: Field) -> Option {}\n\n/// Fetches all effects of settled transactions by hash, preserving request order.\npub unconstrained fn get_tx_effects(tx_hashes: EphemeralArray) -> EphemeralArray> {\n get_tx_effects_oracle(tx_hashes)\n}\n\n#[oracle(aztec_utl_getTxEffects)]\nunconstrained fn get_tx_effects_oracle(tx_hashes: EphemeralArray) -> EphemeralArray> {}\n" }, "212": { "function_locations": [ { "name": "notify_created_note", "start": 610 }, { "name": "notify_nullified_note", "start": 1320 }, { "name": "notify_created_note_oracle_wrapper", "start": 1774 }, { "name": "notify_created_note_oracle", "start": 2226 }, { "name": "notify_nullified_note_oracle_wrapper", "start": 2334 }, { "name": "notify_nullified_note_oracle", "start": 2544 }, { "name": "get_notes_oracle", "start": 3602 }, { "name": "get_notes", "start": 4157 }, { "name": "get_app_tagging_secret", "start": 6949 }, { "name": "get_app_tagging_secret_oracle", "start": 7161 }, { "name": "get_next_tagging_index", "start": 8149 }, { "name": "get_next_tagging_index_oracle", "start": 8348 }, { "name": "get_sender_for_tags", "start": 8841 }, { "name": "get_sender_for_tags_oracle", "start": 8987 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/oracle/notes.nr", "source": "use crate::messages::delivery::OnchainDeliveryMode;\nuse crate::note::{HintedNote, note_interface::NoteType};\n\nuse crate::protocol::{address::AztecAddress, traits::Packable};\n\n/// Notifies the simulator that a note has been created, so that it can be returned in future read requests in the same\n/// transaction. This note should only be added to the non-volatile database if found in an actual block.\npub fn notify_created_note(\n owner: AztecAddress,\n storage_slot: Field,\n randomness: Field,\n note_type_id: Field,\n packed_note: [Field; N],\n note_hash: Field,\n counter: u32,\n) {\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 {\n notify_created_note_oracle_wrapper(\n owner,\n storage_slot,\n randomness,\n note_type_id,\n packed_note,\n note_hash,\n counter,\n )\n };\n}\n\n/// Notifies the simulator that a note has been nullified, so that it is no longer returned in future read requests in\n/// the same transaction. This note should only be removed to the non-volatile database if its nullifier is found in an\n/// actual block.\npub fn notify_nullified_note(nullifier: Field, note_hash: Field, 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_nullified_note_oracle_wrapper(nullifier, note_hash, counter) };\n}\n\nunconstrained fn notify_created_note_oracle_wrapper(\n owner: AztecAddress,\n storage_slot: Field,\n randomness: Field,\n note_type_id: Field,\n packed_note: [Field; N],\n note_hash: Field,\n counter: u32,\n) {\n notify_created_note_oracle(\n owner,\n storage_slot,\n randomness,\n note_type_id,\n packed_note,\n note_hash,\n counter,\n );\n}\n\n#[oracle(aztec_prv_notifyCreatedNote)]\nunconstrained fn notify_created_note_oracle(\n _owner: AztecAddress,\n _storage_slot: Field,\n _randomness: Field,\n _note_type_id: Field,\n _packed_note: [Field; N],\n _note_hash: Field,\n _counter: u32,\n) {}\n\nunconstrained fn notify_nullified_note_oracle_wrapper(nullifier: Field, note_hash: Field, counter: u32) {\n notify_nullified_note_oracle(nullifier, note_hash, counter);\n}\n\n#[oracle(aztec_prv_notifyNullifiedNote)]\nunconstrained fn notify_nullified_note_oracle(_nullifier: Field, _note_hash: Field, _counter: u32) {}\n\n#[oracle(aztec_utl_getNotes)]\nunconstrained fn get_notes_oracle(\n _owner: Option,\n _storage_slot: Field,\n _num_selects: u8,\n _select_by_indexes: [u8; M],\n _select_by_offsets: [u8; M],\n _select_by_lengths: [u8; M],\n _select_values: [Field; M],\n _select_comparators: [u8; M],\n _sort_by_indexes: [u8; M],\n _sort_by_offsets: [u8; M],\n _sort_by_lengths: [u8; M],\n _sort_order: [u8; M],\n _limit: u32,\n _offset: u32,\n _status: u8,\n // This is always set to MAX_NOTES. We need to pass it to TS in order to correctly construct the BoundedVec\n _max_notes: u32,\n // This is always set to as Packable>::N. We need to pass it to TS in order to be able to\n // correctly construct the BoundedVec there.\n _packed_hinted_note_length: u32,\n) -> BoundedVec<[Field; as Packable>::N], MaxNotes>\nwhere\n // TODO(https://github.com/noir-lang/noir/issues/9399): `Note: Packable` should work here.\n HintedNote: Packable,\n{}\n\npub unconstrained fn get_notes(\n owner: Option,\n storage_slot: Field,\n num_selects: u8,\n select_by_indexes: [u8; M],\n select_by_offsets: [u8; M],\n select_by_lengths: [u8; M],\n select_values: [Field; M],\n select_comparators: [u8; M],\n sort_by_indexes: [u8; M],\n sort_by_offsets: [u8; M],\n sort_by_lengths: [u8; M],\n sort_order: [u8; M],\n limit: u32,\n offset: u32,\n status: u8,\n) -> [Option>; MaxNotes]\nwhere\n Note: NoteType + Packable,\n{\n let packed_hinted_notes: BoundedVec<[Field; as Packable>::N], MaxNotes> = get_notes_oracle::(\n owner,\n storage_slot,\n num_selects,\n select_by_indexes,\n select_by_offsets,\n select_by_lengths,\n select_values,\n select_comparators,\n sort_by_indexes,\n sort_by_offsets,\n sort_by_lengths,\n sort_order,\n limit,\n offset,\n status,\n MaxNotes,\n as Packable>::N,\n );\n\n let mut notes = BoundedVec::<_, MaxNotes>::new();\n for i in 0..packed_hinted_notes.len() {\n let hinted_note = HintedNote::unpack(packed_hinted_notes.get(i));\n notes.push(hinted_note);\n }\n\n // At last we convert the bounded vector to an array of options. We do this because that is what the filter\n // function needs to have on the output and we've decided to have the same type on the input and output of the\n // filter and preprocessor functions.\n //\n // We have decided to have the same type on the input and output of the filter and preprocessor functions because\n // it allows us to chain multiple filters and preprocessors together.\n //\n // So why do we want the array of options on the output of the filter function?\n //\n // Filter returns an array of options rather than a BoundedVec for performance reasons. Using an array of options\n // allows setting values at known indices in the output array which is much more efficient than pushing to a\n // BoundedVec where the write position depends on previous iterations. The array can then be efficiently converted\n // to a BoundedVec using utils/array/collapse.nr::collapse function from Aztec.nr. This avoids expensive dynamic\n // memory access patterns that would be required when building up a BoundedVec incrementally. For preprocessor\n // functions we could use BoundedVec return value as there the optimization does not matter since it is applied in\n // an unconstrained context. We, however, use the same return value type to be able to use the same function as\n // both a preprocessor and a filter.\n let mut notes_array = [Option::none(); MaxNotes];\n for i in 0..notes.len() {\n notes_array[i] = Option::some(notes.get_unchecked(i));\n }\n\n notes_array\n}\n\n// TODO: Oracles below are generic private log oracles and are not specific to notes. Move them somewhere else.\n\n/// Returns the sender-side app tagging secret for a `(sender, recipient)` pair.\n///\n/// The secret is resolved by the simulator rather than computed by the contract.\n///\n/// Returns `None` for an invalid recipient address.\npub unconstrained fn get_app_tagging_secret(sender: AztecAddress, recipient: AztecAddress) -> Option {\n get_app_tagging_secret_oracle(sender, recipient)\n}\n\n#[oracle(aztec_prv_getAppTaggingSecret)]\nunconstrained fn get_app_tagging_secret_oracle(_sender: AztecAddress, _recipient: AztecAddress) -> Option {}\n\n/// Returns the next sender-side tagging index for a given secret and delivery mode.\n///\n/// The caller already holds the tagging `secret`, whether obtained from [`get_app_tagging_secret`] or computed by the\n/// contract, and only needs the simulator to hand out a fresh per-secret, per-mode index; the caller computes the tag\n/// itself. `mode` is converted into the [`OnchainDeliveryMode`] selecting the per-mode index counter, so callers can\n/// pass either a concrete on-chain delivery builder or an explicit mode. Offchain messages are not tagged, so only the\n/// onchain delivery variants can be used by this oracle.\n///\n/// The simulator persists the index increment only if the tagged log is found in an actual block; a reverting\n/// transaction can otherwise cause the sender to skip indices and later produce notes that are not found by the\n/// recipient.\npub unconstrained fn get_next_tagging_index(secret: Field, mode: M) -> u32\nwhere\n M: Into,\n{\n get_next_tagging_index_oracle(secret, mode.into())\n}\n\n#[oracle(aztec_prv_getNextTaggingIndex)]\nunconstrained fn get_next_tagging_index_oracle(_secret: Field, _mode: OnchainDeliveryMode) -> u32 {}\n\n/// Gets the sender for tags.\n///\n/// This unconstrained value is used as the sender when computing an unconstrained shared secret for a tag in order to\n/// emit a log. Constrained tagging should not use this as there is no guarantee that the recipient knows about the\n/// sender, and hence about the shared secret.\n///\n/// Returns the wallet-supplied default sender for tags, or `None` if no default was provided.\npub(crate) unconstrained fn get_sender_for_tags() -> Option {\n get_sender_for_tags_oracle()\n}\n\n#[oracle(aztec_prv_getSenderForTags)]\nunconstrained fn get_sender_for_tags_oracle() -> Option {}\n" }, "213": { "function_locations": [ { "name": "notify_created_nullifier", "start": 442 }, { "name": "notify_created_nullifier_oracle", "start": 761 }, { "name": "is_nullifier_pending", "start": 1482 }, { "name": "is_nullifier_pending_oracle", "start": 1705 }, { "name": "check_nullifier_exists", "start": 2245 }, { "name": "does_nullifier_exist_oracle", "start": 2417 } ], "path": "/home/nventuro/pkg-1/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" }, "216": { "function_locations": [ { "name": "random", "start": 468 }, { "name": "rand_oracle", "start": 568 } ], "path": "/home/nventuro/pkg-1/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" }, "217": { "function_locations": [ { "name": "resolve_custom_request", "start": 744 }, { "name": "resolve_custom_request_oracle", "start": 972 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/oracle/resolve_custom_request.nr", "source": "//! A generic, hook-backed request resolved outside the circuit. See [`resolve_custom_request`].\n\n/// Resolves a custom, caller-defined request outside the circuit.\n///\n/// Unlike the protocol's built-in oracles, this one carries no fixed meaning: the contract chooses a `kind` and an\n/// opaque `payload`, and PXE (or a resolver it is configured with) produces the response however it needs to, whether\n/// from local state, by coordinating with a third party, or by fetching offchain data. `kind` selects the request type\n/// so a single resolver can serve many such types; everything specific to a request goes in `payload`.\npub unconstrained fn resolve_custom_request(kind: Field, payload: [Field; M]) -> [Field; N] {\n resolve_custom_request_oracle(kind, payload)\n}\n\n#[oracle(aztec_prv_resolveCustomRequest)]\nunconstrained fn resolve_custom_request_oracle(\n _kind: Field,\n _payload: [Field; M],\n) -> [Field; N] {}\n" }, "219": { "function_locations": [ { "name": "get_shared_secrets_oracle", "start": 474 }, { "name": "get_shared_secret", "start": 828 }, { "name": "get_shared_secrets", "start": 2604 }, { "name": "test::preserves_ephemeral_key_ordering", "start": 3282 }, { "name": "test::returns_secrets_in_order", "start": 4170 }, { "name": "test::returns_empty_when_pxe_does_not_hold_keys", "start": 4959 }, { "name": "test::single_secret_returns_the_secret", "start": 5618 }, { "name": "test::single_secret_returns_none_when_pxe_does_not_hold_keys", "start": 6063 }, { "name": "test::cannot_return_mismatched_length", "start": 6586 }, { "name": "test::mock_get_shared_secrets", "start": 7189 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/oracle/shared_secret.nr", "source": "use crate::ephemeral::EphemeralArray;\nuse crate::protocol::{address::AztecAddress, hash::sha256_to_field, point::EmbeddedCurvePoint};\n\nglobal GET_SHARED_SECRET_SINGLE_SLOT: Field = sha256_to_field(\"AZTEC_NR::GET_SHARED_SECRET_SINGLE_SLOT\".as_bytes());\n\n#[oracle(aztec_utl_getSharedSecrets)]\nunconstrained fn get_shared_secrets_oracle(\n address: AztecAddress,\n eph_pks: EphemeralArray,\n contract_address: AztecAddress,\n) -> EphemeralArray {}\n\n/// Convenience wrapper around [`get_shared_secrets`] for a single ephemeral public key.\n///\n/// Returns `none` when the PXE does not hold `address`'s keys and therefore cannot derive the secret.\npub unconstrained fn get_shared_secret(\n address: AztecAddress,\n eph_pk: EmbeddedCurvePoint,\n contract_address: AztecAddress,\n) -> Option {\n let eph_pks: EphemeralArray = EphemeralArray::empty_at(GET_SHARED_SECRET_SINGLE_SLOT);\n eph_pks.push(eph_pk);\n let secrets = get_shared_secrets(address, eph_pks, contract_address);\n if secrets.len() == 1 {\n Option::some(secrets.get(0))\n } else {\n Option::none()\n }\n}\n\n/// Returns app-siloed shared secrets between `address` and someone who knows the secret keys behind the given\n/// ephemeral public keys.\n///\n/// Each returned Field `s_app` is computed as:\n///\n/// ```text\n/// S = address_secret * ephPk (raw ECDH point)\n/// s_app = h(DOM_SEP, S.x, S.y, contract) (app-siloed scalar)\n/// ```\n///\n/// where `contract` is the address of the calling contract. The oracle host validates this matches its execution\n/// context.\n///\n/// Without app-siloing, a malicious contract could call this oracle with public information (address, ephPk) and\n/// obtain the same raw secret as the legitimate contract, enabling cross-contract decryption. By including the\n/// contract address in the hash, each contract receives a different `s_app`, preventing this attack.\n///\n/// Callers derive indexed subkeys from `s_app` via\n/// [`derive_shared_secret_subkey`](crate::keys::ecdh_shared_secret::derive_shared_secret_subkey).\n///\n/// Returns an empty array when the PXE does not hold `address`'s keys and therefore cannot derive any secrets. This\n/// happens when syncing the scope of an address the PXE does not control, and is an expected outcome rather than an\n/// error. Any other response length mismatch is a malformed oracle response.\npub unconstrained fn get_shared_secrets(\n address: AztecAddress,\n eph_pks: EphemeralArray,\n contract_address: AztecAddress,\n) -> EphemeralArray {\n let response = get_shared_secrets_oracle(address, eph_pks, contract_address);\n assert(\n (response.len() == eph_pks.len()) | (response.len() == 0),\n \"get_shared_secrets: response length does not match request length\",\n );\n response\n}\n\nmod test {\n use crate::ephemeral::EphemeralArray;\n use crate::oracle::shared_secret::{get_shared_secret, get_shared_secrets};\n use crate::protocol::{address::AztecAddress, traits::FromField};\n use crate::test::helpers::test_environment::TestEnvironment;\n use crate::utils::point::point_from_x_coord;\n use std::test::OracleMock;\n\n #[test]\n unconstrained fn preserves_ephemeral_key_ordering() {\n let env = TestEnvironment::new();\n env.utility_context(|_| {\n let _ = mock_get_shared_secrets([100, 200, 300]);\n\n let pk_a = point_from_x_coord(1).unwrap();\n let pk_b = point_from_x_coord(2).unwrap();\n let pk_c = point_from_x_coord(8).unwrap();\n\n let eph_pks: EphemeralArray<_> = EphemeralArray::empty_at(200);\n eph_pks.push(pk_a);\n eph_pks.push(pk_b);\n eph_pks.push(pk_c);\n\n let _: EphemeralArray = get_shared_secrets(\n AztecAddress::from_field(1),\n eph_pks,\n AztecAddress::from_field(2),\n );\n\n assert_eq(eph_pks.get(0), pk_a);\n assert_eq(eph_pks.get(1), pk_b);\n assert_eq(eph_pks.get(2), pk_c);\n });\n }\n\n #[test]\n unconstrained fn returns_secrets_in_order() {\n let env = TestEnvironment::new();\n env.utility_context(|_| {\n let _ = mock_get_shared_secrets([111, 222, 333]);\n\n let pk = point_from_x_coord(1).unwrap();\n let eph_pks: EphemeralArray<_> = EphemeralArray::empty_at(200);\n eph_pks.push(pk);\n eph_pks.push(pk);\n eph_pks.push(pk);\n\n let results: EphemeralArray = get_shared_secrets(\n AztecAddress::from_field(1),\n eph_pks,\n AztecAddress::from_field(2),\n );\n\n assert_eq(results.get(0), 111);\n assert_eq(results.get(1), 222);\n assert_eq(results.get(2), 333);\n });\n }\n\n #[test]\n unconstrained fn returns_empty_when_pxe_does_not_hold_keys() {\n let env = TestEnvironment::new();\n env.utility_context(|_| {\n let empty: [Field; 0] = [];\n let _ = mock_get_shared_secrets(empty);\n\n let pk = point_from_x_coord(1).unwrap();\n let eph_pks: EphemeralArray<_> = EphemeralArray::empty_at(200);\n eph_pks.push(pk);\n\n let results: EphemeralArray = get_shared_secrets(\n AztecAddress::from_field(1),\n eph_pks,\n AztecAddress::from_field(2),\n );\n\n assert_eq(results.len(), 0);\n });\n }\n\n #[test]\n unconstrained fn single_secret_returns_the_secret() {\n let env = TestEnvironment::new();\n env.utility_context(|_| {\n let _ = mock_get_shared_secrets([111]);\n\n let pk = point_from_x_coord(1).unwrap();\n let secret = get_shared_secret(AztecAddress::from_field(1), pk, AztecAddress::from_field(2));\n\n assert_eq(secret.unwrap(), 111);\n });\n }\n\n #[test]\n unconstrained fn single_secret_returns_none_when_pxe_does_not_hold_keys() {\n let env = TestEnvironment::new();\n env.utility_context(|_| {\n let empty: [Field; 0] = [];\n let _ = mock_get_shared_secrets(empty);\n\n let pk = point_from_x_coord(1).unwrap();\n let secret = get_shared_secret(AztecAddress::from_field(1), pk, AztecAddress::from_field(2));\n\n assert(secret.is_none());\n });\n }\n\n #[test(should_fail_with = \"response length does not match request length\")]\n unconstrained fn cannot_return_mismatched_length() {\n let env = TestEnvironment::new();\n env.utility_context(|_| {\n let _ = mock_get_shared_secrets([111, 222]);\n\n let pk = point_from_x_coord(1).unwrap();\n let eph_pks: EphemeralArray<_> = EphemeralArray::empty_at(200);\n eph_pks.push(pk);\n\n let _: EphemeralArray = get_shared_secrets(\n AztecAddress::from_field(1),\n eph_pks,\n AztecAddress::from_field(2),\n );\n });\n }\n\n unconstrained fn mock_get_shared_secrets(response_values: [Field; N]) -> Field {\n let response_slot: Field = 99;\n let response_array: EphemeralArray = EphemeralArray::at(response_slot);\n for value in response_values {\n response_array.push(value);\n }\n let _ = OracleMock::mock(\"aztec_utl_getSharedSecrets\").returns(response_slot);\n response_slot\n }\n}\n" }, "222": { "function_locations": [ { "name": "notify_revertible_phase_start", "start": 298 }, { "name": "is_execution_in_revertible_phase", "start": 687 }, { "name": "notify_revertible_phase_start_oracle_wrapper", "start": 829 }, { "name": "notify_revertible_phase_start_oracle", "start": 1002 }, { "name": "is_execution_in_revertible_phase_oracle", "start": 1143 } ], "path": "/home/nventuro/pkg-1/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" }, "223": { "function_locations": [ { "name": "get_resolved_txs", "start": 608 }, { "name": "get_resolved_txs_oracle", "start": 799 }, { "name": "test::resolved_tx_serialization_matches_typescript", "start": 991 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/oracle/tx_resolution.nr", "source": "use crate::ephemeral::EphemeralArray;\nuse crate::protocol::{constants::MAX_NOTE_HASHES_PER_TX, traits::{Deserialize, Serialize}};\n\n/// The resolved on-chain context of a transaction.\n#[derive(Serialize, Deserialize, Eq)]\npub struct ResolvedTx {\n pub tx_hash: Field,\n pub unique_note_hashes_in_tx: BoundedVec,\n pub first_nullifier_in_tx: Field,\n pub block_number: u32,\n pub block_hash: Field,\n}\n\n/// Resolves the on-chain context of each tx hash.\npub(crate) unconstrained fn get_resolved_txs(requests: EphemeralArray) -> EphemeralArray> {\n get_resolved_txs_oracle(requests)\n}\n\n#[oracle(aztec_utl_getResolvedTxs)]\nunconstrained fn get_resolved_txs_oracle(requests: EphemeralArray) -> EphemeralArray> {}\n\nmod test {\n use crate::oracle::tx_resolution::ResolvedTx;\n use crate::protocol::traits::Deserialize;\n\n #[test]\n unconstrained fn resolved_tx_serialization_matches_typescript() {\n // Setup test data\n let tx_hash = 123;\n let unique_note_hashes = BoundedVec::from_array([4, 5]);\n let first_nullifier = 6;\n let block_number: u32 = 7;\n let block_hash = 8;\n\n // Create a ResolvedTx instance\n let resolved_tx = ResolvedTx {\n tx_hash,\n unique_note_hashes_in_tx: unique_note_hashes,\n first_nullifier_in_tx: first_nullifier,\n block_number,\n block_hash,\n };\n\n // Expected output generated from TypeScript's `ResolvedTx.toFields()`\n let serialized_resolved_tx_from_typescript = [\n 0x000000000000000000000000000000000000000000000000000000000000007b,\n 0x0000000000000000000000000000000000000000000000000000000000000004,\n 0x0000000000000000000000000000000000000000000000000000000000000005,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000000,\n 0x0000000000000000000000000000000000000000000000000000000000000002,\n 0x0000000000000000000000000000000000000000000000000000000000000006,\n 0x0000000000000000000000000000000000000000000000000000000000000007,\n 0x0000000000000000000000000000000000000000000000000000000000000008,\n ];\n\n let deserialized = ResolvedTx::deserialize(serialized_resolved_tx_from_typescript);\n\n assert_eq(deserialized, resolved_tx);\n }\n}\n" }, "224": { "function_locations": [ { "name": "assert_compatible_oracle_version", "start": 1192 }, { "name": "assert_compatible_oracle_version_wrapper", "start": 1501 }, { "name": "assert_compatible_oracle_version_oracle", "start": 1732 }, { "name": "test::compatible_oracle_version", "start": 1911 }, { "name": "test::incompatible_oracle_version_major", "start": 2136 } ], "path": "/home/nventuro/pkg-1/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 = 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" }, "225": { "function_locations": [ { "name": "PartialNoteFsm::init", "start": 6262 }, { "name": "PartialNoteFsm::load_all", "start": 6767 }, { "name": "PartialNoteFsm::id_for", "start": 7076 }, { "name": "PartialNoteFsm::read_pending_partial_note", "start": 7297 }, { "name": "PartialNoteFsm::is_completed", "start": 7784 }, { "name": "PartialNoteFsm::is_pending", "start": 8031 }, { "name": "PartialNoteFsm::completion_log_origin", "start": 8222 }, { "name": "PartialNoteFsm::mark_completed", "start": 8640 }, { "name": "PartialNoteFsm::terminate", "start": 9119 }, { "name": "PartialNoteFsm::step", "start": 9899 }, { "name": "PartialNoteFsm::step_pending", "start": 10573 }, { "name": "PartialNoteFsm::step_completed", "start": 11252 }, { "name": "PartialNoteFsm::complete_with_log", "start": 12056 }, { "name": "to_payload", "start": 14380 }, { "name": "test::setup", "start": 15068 }, { "name": "test::make_pending", "start": 15338 }, { "name": "test::finalized_block", "start": 15704 }, { "name": "test::init_creates_a_partial_note_fsm_in_pending_state", "start": 15852 }, { "name": "test::read_pending_round_trips_the_delivered_content", "start": 16433 }, { "name": "test::mark_completed_moves_to_completed", "start": 17050 }, { "name": "test::terminate_deletes_the_collection", "start": 17707 }, { "name": "test::re_init_is_idempotent", "start": 18149 }, { "name": "test::step_leaves_a_pending_reception_untouched_when_it_has_no_completion_log", "start": 18658 }, { "name": "test::step_terminates_a_completed_reception_once_its_block_is_finalized", "start": 19922 }, { "name": "test::step_keeps_a_completed_reception_while_its_block_is_unfinalized", "start": 20795 }, { "name": "test::dummy_compute_note_hash", "start": 22144 }, { "name": "test::dummy_compute_note_nullifier", "start": 22505 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/partial_notes/fsm.nr", "source": "//! The finite state machine to process a single partial note.\n//!\n//! A partial note arrives in two parts: a private part (delivered first, carrying the owner, randomness, completion-log\n//! tag, note type, and packed private content) and a public *completion log* (storage slot + packed public content).\n//! The note can only be discovered and stored once both are combined. The state chart below summarizes how a single\n//! partial note's process unfolds, including how reorgs cause it to rewind.\n//!\n//! ```text\n//! init() (partial note delivery message, including tx and block data)\n//! |\n//! v\n//! +-----------+ completion log found +-----------+\n//! ---- | | ------------------------------> | |\n//! log not found | | | | | discover note(s),\n//! |--> | PENDING | | COMPLETED | ~~> enqueue for storage, etc\n//! | | <------------------------------ | |\n//! | | completion log block re-orged | |\n//! +-----------+ +-----------+\n//! | |\n//! | delivery message block re-orged | completion log block finalized\n//! v v\n//! +---------------------------------------------------------+\n//! | TERMINATED (process ends) |\n//! +---------------------------------------------------------+\n//! ```\n//!\n//! ## States\n//!\n//! - **Pending**: the private part has been received but the completion log has not been found yet. While in this\n//! state, message discovery keeps searching for that log on each sync.\n//! - **Completed**: the completion log was found, so the note was completed and enqueued for storage. Because the\n//! block containing the completion log can be dropped by a reorg, this state is not terminal until the block\n//! finalizes: a reorg dropping it rewinds the FSM back to `Pending` state.\n//! - **Terminated**: nothing else can be done with the partial note, either because its delivery block was re-orged\n//! away (so the delivery itself was reverted) or because its completion block has finalized (so the discovered note\n//! is permanent and reorg-proof). This is the terminal state of this FSM.\n//!\n//! ## Transitions (each evaluated by [`step`](PartialNoteFsm::step))\n//!\n//! - **Pending -> Completed** ([`complete_with_log`](PartialNoteFsm::complete_with_log)): the completion log is\n//! found. Its public content is combined with the delivered private content, the resulting note(s) are discovered\n//! and enqueued for storage.\n//! - **Completed -> Pending**: the completion log block is re-orged out. The completion log is searched for again.\n//! - **Pending -> Terminated**: the delivery block is re-orged out, retracting the `delivered` birth fact. The\n//! delivery was reverted, so there is nothing left to do.\n//! - **Completed -> Terminated**: the completion log block finalizes, making the discovered note reorg-proof, so the\n//! reception is complete and its collection is deleted.\n//!\n//! ## Implementation\n//!\n//! Each pending partial note is tracked as a [fact collection](crate::facts::FactCollection) of type\n//! `PARTIAL_NOTE_RECEPTION_TYPE_ID`, identified by a hash of its [`DeliveredPendingPartialNote`] content (so\n//! re-delivery of the same partial note is idempotent). The collection holds:\n//!\n//! - a retractable `PARTIAL_NOTE_DELIVERED` birth fact tied to a delivery block (so a reorg of that block auto-prunes\n//! the pending note), whose payload is the serialized [`DeliveredPendingPartialNote`];\n//! - once the completion log is found, a retractable `PARTIAL_NOTE_COMPLETED` fact tied to the completion log block.\n//!\n//! Status folds from the canonical fact set:\n//! - `delivered` only ⇒ Pending\n//! - `delivered` + `completed` ⇒ Completed\n//!\n//! A reorg retracting either fact folds the reception back accordingly.\nuse crate::ephemeral::EphemeralArray;\nuse crate::facts::{\n delete_fact_collection, Fact, FactCollection, get_fact_collections_by_type, OriginBlock, record_retractable_fact,\n RetractableFactOrigin,\n};\nuse crate::logging::aztecnr_debug_log_format;\nuse crate::messages::{\n discovery::{ComputeNoteHash, ComputeNoteNullifier, nonce_discovery::attempt_note_nonce_discovery},\n processing::{enqueue_note_for_validation, log_retrieval_response::{LogRetrievalResponse, MAX_LOG_CONTENT_LEN}},\n};\nuse crate::protocol::{address::AztecAddress, hash::{poseidon2_hash, sha256_to_field}, traits::{Deserialize, Serialize}};\nuse crate::utils::array;\nuse super::DeliveredPendingPartialNote;\n\n/// Fact-collection type id shared by every partial-note reception in the [fact store](crate::facts).\nglobal PARTIAL_NOTE_RECEPTION_TYPE_ID: Field = sha256_to_field(\"AZTEC_NR::PARTIAL_NOTE_RECEPTION_TYPE_ID\".as_bytes());\n\n/// Fact type id of the birth fact carrying the delivered private partial note.\nglobal PARTIAL_NOTE_DELIVERED: Field = sha256_to_field(\"AZTEC_NR::PARTIAL_NOTE_DELIVERED\".as_bytes());\n\n/// Fact type id marking a partial note as completed (its note has been discovered and enqueued).\nglobal PARTIAL_NOTE_COMPLETED: Field = sha256_to_field(\"AZTEC_NR::PARTIAL_NOTE_COMPLETED\".as_bytes());\n\n/// A single partial note's finite state machine, backed by a [`FactCollection`](crate::facts::FactCollection).\n#[derive(Deserialize, Serialize)]\npub(crate) struct PartialNoteFsm {\n collection: FactCollection,\n}\n\nimpl PartialNoteFsm {\n /// Initializes an FSM for a freshly discovered partial note.\n ///\n /// The FSM existence is tied to `origin_block`: if `origin_block` is dropped by a reorg, the FSM is transparently\n /// deleted.\n pub(crate) unconstrained fn init(\n contract_address: AztecAddress,\n scope: AztecAddress,\n pending: DeliveredPendingPartialNote,\n origin_block: OriginBlock,\n ) {\n record_retractable_fact(\n contract_address,\n scope,\n PARTIAL_NOTE_RECEPTION_TYPE_ID,\n Self::id_for(pending),\n PARTIAL_NOTE_DELIVERED,\n to_payload(pending),\n origin_block,\n );\n }\n\n /// Loads every active partial-note FSM for the given contract and scope.\n pub(crate) unconstrained fn load_all(\n contract_address: AztecAddress,\n scope: AztecAddress,\n ) -> EphemeralArray {\n get_fact_collections_by_type(contract_address, scope, PARTIAL_NOTE_RECEPTION_TYPE_ID)\n .map(|collection: FactCollection| PartialNoteFsm { collection })\n }\n\n /// The fact-collection id identifying a specific partial note.\n fn id_for(pending: DeliveredPendingPartialNote) -> Field {\n poseidon2_hash(pending.serialize())\n }\n\n /// Reads and decodes the delivered partial note this FSM processes.\n pub(crate) unconstrained fn read_pending_partial_note(self) -> DeliveredPendingPartialNote {\n let delivered = self.collection.facts.find(|f: Fact| f.fact_type_id == PARTIAL_NOTE_DELIVERED).unwrap();\n let mut fields = [0; ::N];\n for i in 0..fields.len() {\n fields[i] = delivered.payload.get(i);\n }\n Deserialize::deserialize(fields)\n }\n\n /// Whether the partial note FSM is in `completed` state, i.e. its note was completed and stored.\n unconstrained fn is_completed(self) -> bool {\n self.collection.facts.any(|f: Fact| f.fact_type_id == PARTIAL_NOTE_COMPLETED)\n }\n\n /// Whether the partial note FSM is in `pending` state, i.e. it hasn't been completed yet.\n pub(crate) unconstrained fn is_pending(self) -> bool {\n !self.is_completed()\n }\n\n /// Origin block of the partial note completion log, if available.\n unconstrained fn completion_log_origin(self) -> Option {\n let maybe_completed = self.collection.facts.find(|f: Fact| f.fact_type_id == PARTIAL_NOTE_COMPLETED);\n if maybe_completed.is_some() {\n maybe_completed.unwrap().origin_block\n } else {\n Option::none()\n }\n }\n\n /// Transition the partial note FSM as `completed`, conditional to `origin_block`.\n unconstrained fn mark_completed(self, origin_block: OriginBlock) {\n let empty_payload: EphemeralArray = 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 PARTIAL_NOTE_COMPLETED,\n empty_payload,\n origin_block,\n );\n }\n\n /// Terminates this partial note FSM.\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 /// Advances this partial-note FSM by one step.\n ///\n /// Partial notes can only be completed if completion logs have been found for them. Log discovery and\n /// provisioning is responsibility of the caller.\n ///\n /// `compute_note_hash` and `compute_note_nullifier` are injected dependencies.\n pub(crate) unconstrained fn step(\n self,\n maybe_completion_logs: Option>,\n compute_note_hash: ComputeNoteHash,\n compute_note_nullifier: ComputeNoteNullifier,\n ) {\n if self.is_pending() {\n self.step_pending(maybe_completion_logs, compute_note_hash, compute_note_nullifier);\n } else {\n self.step_completed();\n }\n }\n\n /// Processes a partial note in pending state\n ///\n /// Completes the partial note if its completion log is given. If not, the partial note remains in pending state\n /// and its completion log is searched for again on future syncs.\n unconstrained fn step_pending(\n self,\n maybe_completion_logs: Option>,\n compute_note_hash: ComputeNoteHash,\n compute_note_nullifier: ComputeNoteNullifier,\n ) {\n if maybe_completion_logs.is_some() {\n let completion_logs = maybe_completion_logs.unwrap();\n let num_logs = completion_logs.len();\n if num_logs != 0 {\n assert(num_logs == 1, f\"Expected at most 1 completion log per partial note, got {num_logs}\");\n self.complete_with_log(completion_logs.get(0), compute_note_hash, compute_note_nullifier);\n }\n }\n }\n\n /// Advances partial note in `completed` state: terminates it once the completion log block finalizes, since the\n /// discovered note is then permanent and there is nothing left to track.\n unconstrained fn step_completed(self) {\n if self.completion_log_origin().unwrap().block_state.is_finalized() {\n self.terminate();\n }\n }\n\n /// Completes a partial note.\n ///\n /// Combines the delivered private content with the log's public content, discovers the resulting note(s), enqueues\n /// them for validation, and transitions the FSM to `completed` state conditional to the completion log's block.\n ///\n /// Because the completion fact is retractable, a reorg of the completion log's block rewinds the FSM back to\n /// `pending` state (which signals that completion log search should restart).\n unconstrained fn complete_with_log(\n self,\n log: LogRetrievalResponse,\n compute_note_hash: ComputeNoteHash,\n compute_note_nullifier: ComputeNoteNullifier,\n ) {\n let pending = self.read_pending_partial_note();\n\n // The first field in the completion log payload is the storage slot, followed by the public note content.\n let storage_slot = log.log_payload.get(0);\n let public_note_content: BoundedVec = array::subbvec(log.log_payload, 1);\n\n // Public fields are placed at the end of the packed representation, so we combine the private and public\n // packed content to get the complete packed note.\n let complete_packed_note = array::append(pending.packed_private_note_content, public_note_content);\n\n let discovered_notes = attempt_note_nonce_discovery(\n log.unique_note_hashes_in_tx,\n log.first_nullifier_in_tx,\n compute_note_hash,\n compute_note_nullifier,\n self.collection.contract_address,\n pending.owner,\n storage_slot,\n pending.randomness,\n pending.note_type_id,\n complete_packed_note,\n );\n\n // TODO(#11627): is there anything reasonable we can do if we get a log but it doesn't result in a note being\n // found?\n if discovered_notes.len() == 0 {\n panic(\n f\"A partial note's completion log did not result in any notes being found - this should never happen\",\n );\n }\n\n aztecnr_debug_log_format!(\"Discovered {0} notes for partial note with tag {1}\")([\n discovered_notes.len() as Field,\n pending.note_completion_log_tag,\n ]);\n\n discovered_notes.for_each(|discovered_note| {\n enqueue_note_for_validation(\n self.collection.contract_address,\n pending.owner,\n storage_slot,\n pending.randomness,\n discovered_note.note_nonce,\n complete_packed_note,\n discovered_note.note_hash,\n discovered_note.inner_nullifier,\n log.tx_hash,\n );\n });\n\n self.mark_completed(OriginBlock { block_number: log.block_number, block_hash: log.block_hash });\n }\n}\n\n/// Serializes a [`DeliveredPendingPartialNote`] into a fact payload.\nunconstrained fn to_payload(pending: DeliveredPendingPartialNote) -> EphemeralArray {\n let fields = pending.serialize();\n let payload: EphemeralArray = EphemeralArray::empty();\n for i in 0..fields.len() {\n payload.push(fields[i]);\n }\n payload\n}\n\nmod test {\n use crate::ephemeral::EphemeralArray;\n use crate::facts::OriginBlock;\n use crate::messages::logs::note::MAX_NOTE_PACKED_LEN;\n use crate::messages::processing::log_retrieval_response::LogRetrievalResponse;\n use crate::partial_notes::DeliveredPendingPartialNote;\n use crate::protocol::address::AztecAddress;\n use crate::test::helpers::test_environment::TestEnvironment;\n use super::PartialNoteFsm;\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 /// A delivered partial note with simple dummy content.\n unconstrained fn make_pending(owner: AztecAddress) -> DeliveredPendingPartialNote {\n DeliveredPendingPartialNote {\n owner,\n randomness: 0x11,\n note_completion_log_tag: 0x22,\n note_type_id: 0x33,\n packed_private_note_content: BoundedVec::new(),\n }\n }\n\n /// A low block, which TXE (proven == finalized == latest) reports as finalized.\n fn finalized_block() -> OriginBlock {\n OriginBlock { block_number: 1, block_hash: 0 }\n }\n\n #[test]\n unconstrained fn init_creates_a_partial_note_fsm_in_pending_state() {\n let (env, scope) = setup();\n env.private_context(|context| {\n let address = context.this_address();\n PartialNoteFsm::init(address, scope, make_pending(scope), finalized_block());\n\n let all = PartialNoteFsm::load_all(address, scope);\n assert_eq(all.len(), 1);\n assert(all.get(0).is_pending(), \"freshly delivered reception should be pending\");\n assert(all.get(0).completion_log_origin().is_none());\n });\n }\n\n #[test]\n unconstrained fn read_pending_round_trips_the_delivered_content() {\n let (env, scope) = setup();\n env.private_context(|context| {\n let address = context.this_address();\n PartialNoteFsm::init(address, scope, make_pending(scope), finalized_block());\n\n let pending = PartialNoteFsm::load_all(address, scope).get(0).read_pending_partial_note();\n assert_eq(pending.owner, scope);\n assert_eq(pending.randomness, 0x11);\n assert_eq(pending.note_completion_log_tag, 0x22);\n assert_eq(pending.note_type_id, 0x33);\n });\n }\n\n #[test]\n unconstrained fn mark_completed_moves_to_completed() {\n let (env, scope) = setup();\n env.private_context(|context| {\n let address = context.this_address();\n PartialNoteFsm::init(address, scope, make_pending(scope), finalized_block());\n\n PartialNoteFsm::load_all(address, scope).get(0).mark_completed(finalized_block());\n\n let reloaded = PartialNoteFsm::load_all(address, scope).get(0);\n assert(reloaded.is_completed(), \"should be completed after mark_completed\");\n assert(reloaded.completion_log_origin().unwrap().block_state.is_finalized());\n });\n }\n\n #[test]\n unconstrained fn terminate_deletes_the_collection() {\n let (env, scope) = setup();\n env.private_context(|context| {\n let address = context.this_address();\n PartialNoteFsm::init(address, scope, make_pending(scope), finalized_block());\n\n PartialNoteFsm::load_all(address, scope).get(0).terminate();\n assert_eq(PartialNoteFsm::load_all(address, scope).len(), 0);\n });\n }\n\n #[test]\n unconstrained fn re_init_is_idempotent() {\n let (env, scope) = setup();\n env.private_context(|context| {\n let address = context.this_address();\n PartialNoteFsm::init(address, scope, make_pending(scope), finalized_block());\n PartialNoteFsm::init(address, scope, make_pending(scope), finalized_block());\n\n assert_eq(PartialNoteFsm::load_all(address, scope).len(), 1);\n });\n }\n\n #[test]\n unconstrained fn step_leaves_a_pending_reception_untouched_when_it_has_no_completion_log() {\n let (env, scope) = setup();\n env.private_context(|context| {\n let address = context.this_address();\n PartialNoteFsm::init(address, scope, make_pending(scope), finalized_block());\n\n // Neither an empty fetched-logs set (`Some(empty)`, the pass-1 \"searched, found nothing\" case) nor no\n // fetch at all (`None`, the pass-2 case) can complete a pending reception, so it stays pending.\n let no_logs: EphemeralArray = EphemeralArray::empty();\n PartialNoteFsm::load_all(address, scope).get(0).step(\n Option::some(no_logs),\n dummy_compute_note_hash,\n dummy_compute_note_nullifier,\n );\n PartialNoteFsm::load_all(address, scope).get(0).step(\n Option::none(),\n dummy_compute_note_hash,\n dummy_compute_note_nullifier,\n );\n\n let all = PartialNoteFsm::load_all(address, scope);\n assert_eq(all.len(), 1);\n assert(all.get(0).is_pending(), \"reception without a completion log should stay pending\");\n });\n }\n\n #[test]\n unconstrained fn step_terminates_a_completed_reception_once_its_block_is_finalized() {\n let (env, scope) = setup();\n env.private_context(|context| {\n let address = context.this_address();\n PartialNoteFsm::init(address, scope, make_pending(scope), finalized_block());\n PartialNoteFsm::load_all(address, scope).get(0).mark_completed(finalized_block());\n\n // Completed with a finalized completion block: the discovered note is reorg-proof, so step terminates the\n // FSM by deleting its collection.\n PartialNoteFsm::load_all(address, scope).get(0).step(\n Option::none(),\n dummy_compute_note_hash,\n dummy_compute_note_nullifier,\n );\n\n assert_eq(PartialNoteFsm::load_all(address, scope).len(), 0);\n });\n }\n\n #[test]\n unconstrained fn step_keeps_a_completed_reception_while_its_block_is_unfinalized() {\n let (env, scope) = setup();\n // A future block never finalizes here, so the completed reception must survive the step.\n let unfinalized_block = OriginBlock { block_number: env.last_block_number() + 100, block_hash: 0 };\n env.private_context(|context| {\n let address = context.this_address();\n PartialNoteFsm::init(address, scope, make_pending(scope), finalized_block());\n PartialNoteFsm::load_all(address, scope).get(0).mark_completed(unfinalized_block);\n\n // Completed but not yet finalized: step must not terminate it, since a reorg could still fold it back.\n PartialNoteFsm::load_all(address, scope).get(0).step(\n Option::none(),\n dummy_compute_note_hash,\n dummy_compute_note_nullifier,\n );\n\n let all = PartialNoteFsm::load_all(address, scope);\n assert_eq(all.len(), 1);\n assert(all.get(0).is_completed(), \"unfinalized completed reception should survive step\");\n });\n }\n\n unconstrained fn dummy_compute_note_hash(\n _packed_note: BoundedVec,\n _owner: AztecAddress,\n _storage_slot: Field,\n _note_type_id: Field,\n _contract_address: AztecAddress,\n _randomness: Field,\n ) -> Option {\n Option::none()\n }\n\n unconstrained fn dummy_compute_note_nullifier(\n _unique_note_hash: Field,\n _packed_note: BoundedVec,\n _owner: AztecAddress,\n _storage_slot: Field,\n _note_type_id: Field,\n _contract_address: AztecAddress,\n _randomness: Field,\n ) -> Option {\n Option::none()\n }\n}\n" }, "226": { "function_locations": [ { "name": "process_partial_note_private_msg", "start": 1316 }, { "name": "sync", "start": 2404 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/partial_notes/mod.nr", "source": "mod fsm;\n\nuse crate::{\n facts::OriginBlock,\n messages::{\n discovery::{ComputeNoteHash, ComputeNoteNullifier},\n encoding::MAX_MESSAGE_CONTENT_LEN,\n logs::partial_note::{decode_partial_note_private_message, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN},\n processing::{get_pending_partial_notes_completion_logs, ResolvedTx},\n },\n};\n\nuse crate::logging::{aztecnr_debug_log_format, aztecnr_warn_log_format};\nuse crate::protocol::{address::AztecAddress, traits::{Deserialize, Serialize}};\nuse fsm::PartialNoteFsm;\n\n/// A partial note that was delivered but is still pending completion. Contains the information necessary to find the\n/// log that will complete it and lead to a note being discovered and delivered.\n#[derive(Serialize, Deserialize)]\npub(crate) struct DeliveredPendingPartialNote {\n pub(crate) owner: AztecAddress,\n pub(crate) randomness: Field,\n pub(crate) note_completion_log_tag: Field,\n pub(crate) note_type_id: Field,\n pub(crate) packed_private_note_content: BoundedVec,\n}\n\npub(crate) unconstrained fn process_partial_note_private_msg(\n contract_address: AztecAddress,\n msg_metadata: u64,\n msg_content: BoundedVec,\n resolved_tx: ResolvedTx,\n recipient: AztecAddress,\n) {\n let decoded = decode_partial_note_private_message(msg_metadata, msg_content);\n\n if decoded.is_some() {\n let (owner, randomness, note_completion_log_tag, note_type_id, packed_private_note_content) = decoded.unwrap();\n\n PartialNoteFsm::init(\n contract_address,\n recipient,\n DeliveredPendingPartialNote {\n owner,\n randomness,\n note_completion_log_tag,\n note_type_id,\n packed_private_note_content,\n },\n OriginBlock { block_number: resolved_tx.block_number, block_hash: resolved_tx.block_hash },\n );\n } else {\n aztecnr_warn_log_format!(\n \"Could not decode partial note private message from tx {0}, ignoring\",\n )(\n [resolved_tx.tx_hash],\n );\n }\n}\n\n/// Drives every active partial-note FSM forward.\npub(crate) unconstrained fn sync(\n contract_address: AztecAddress,\n compute_note_hash: ComputeNoteHash,\n compute_note_nullifier: ComputeNoteNullifier,\n scope: AztecAddress,\n) {\n // `load_all` is a relatively expensive oracle round-trip, so we call it once and reuse the result.\n let active_partial_note_fsms = PartialNoteFsm::load_all(contract_address, scope);\n\n // Fetching completion logs is the dominant cost of partial note contract sync (a node round-trip each) and only\n // pending notes need them, so we batch that fetch for the pending subset and then drive the FSMs in two passes:\n // 1. Step each pending FSM with its freshly-fetched completion logs, giving found logs a chance to complete notes.\n // 2. Step every active FSM with no logs, which is where completed-and-finalized FSMs terminate.\n // Keeping both the completion and termination logic inside `PartialNoteFsm::step` is what lets the orchestrator\n // stay this small, the price is the somewhat less elegant two-pass shape that the batched fetch forces on us.\n let pending_partial_note_fsms = active_partial_note_fsms.filter(|fsm: PartialNoteFsm| fsm.is_pending());\n let pending_partial_notes = pending_partial_note_fsms.map(|fsm: PartialNoteFsm| fsm.read_pending_partial_note());\n\n aztecnr_debug_log_format!(\"{} pending partial notes\")([pending_partial_notes.len() as Field]);\n\n let completion_logs = get_pending_partial_notes_completion_logs(contract_address, pending_partial_notes);\n assert_eq(completion_logs.len(), pending_partial_notes.len());\n\n pending_partial_note_fsms.for_each(|i, fsm: PartialNoteFsm| {\n fsm.step(Option::some(completion_logs.get(i)), compute_note_hash, compute_note_nullifier);\n });\n\n active_partial_note_fsms.for_each(|_i, fsm: PartialNoteFsm| {\n fsm.step(Option::none(), compute_note_hash, compute_note_nullifier);\n });\n}\n" }, "232": { "function_locations": [ { "name": " for Map>::new", "start": 4080 }, { "name": " for Map>::get_storage_slot", "start": 4265 }, { "name": "Map::at", "start": 4999 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/state_vars/map.nr", "source": "use crate::protocol::{storage::map::derive_storage_slot_in_map, traits::ToField};\nuse crate::state_vars::StateVariable;\n\n/// A key-value container for state variables.\n///\n/// A `Map` wraps another state variable type (the 'value') and creates independent instances of it for each key,\n/// resulting in effectively as many state variables as there are key values. This behavior is similar to a Solidity\n/// `mapping (K => V)`.\n///\n/// ## Use Cases\n///\n/// Any scenario in which a fixed number of variables is insufficient to represent contract state requires `Map` e.g.\n/// per-election configuration in a voting contract, per-user state, etc. `Map` also composes naturally into more\n/// complex containers: an array could be implemented as a `Map` with indices as keys.\n///\n/// Note that some private state variables, such as [`PrivateMutable`](crate::state_vars::PrivateMutable) and\n/// [`PrivateSet`](crate::state_vars::PrivateSet) cannot be wrapped in a `Map`. These types implement the\n/// [`OwnedStateVariable`](crate::state_vars::OwnedStateVariable) trait, and as such should instead be wrapped using the\n/// [`Owned`](crate::state_vars::Owned) container, which can be thought of as a specialization of `Map` for private\n/// state 'owned' by a single account.\n///\n/// ## Examples\n///\n/// Since `Map` is also a [`StateVariable`], it is declared in the contract's\n/// [`#[storage]`](crate::macros::storage::storage) struct along with all others:\n///\n/// ```noir\n/// #[storage]\n/// struct Storage {\n/// is_admin: Map, C>,\n/// vote_tallies: Map, C>,\n/// }\n/// ```\n///\n/// ### Multiple `Map`s\n///\n/// There is no limit to how many `Map` containers a contract can have, and `Map`s can themselves wrap other `Map`s,\n/// resulting in nested layouts.\n///\n/// ```noir\n/// #[storage]\n/// struct Storage {\n/// // A nested map where the first key is an address and the second a `Year` type, such that\n/// // self.storage.user_yearly_config.at(user).at(year) results in distinct `UserConfig` variables for each\n/// // `(user, year)` tuple.\n/// user_yearly_config: Map, C>, C>,\n/// }\n/// ```\n///\n/// ## Requirements\n///\n/// The value type `V` must implement the [`StateVariable`] trait. The key type `K` must implement the [`ToField`] trait\n/// in such a way that the `Field` representation is unique for each key.\n///\n/// For key types that cannot be converted into a `Field`, consider wrapping them in a type that implements `ToField` as\n/// the hash of the key.\n///\n/// ```noir\n/// struct MyKey {\n/// a: Field,\n/// b: Field,\n/// }\n///\n/// struct MyKeyWrapper {\n/// inner: MyKey,\n/// }\n///\n/// impl ToField for MyKeyWrapper {\n/// fn to_field(self) -> Field {\n/// poseidon2_hash([self.inner.a, self.inner.b])\n/// }\n/// }\n///\n/// #[storage]\n/// struct Storage {\n/// a: Map, C>,\n/// }\n/// ```\n///\n/// ## Implementation Details\n///\n/// Like all other state variables, `Map` gets assigned a unique storage slot. It uses this value to derive unique\n/// storage slots for each key, resulting in independent state variables. Nothing gets stored at `Map`'s storage slot.\n/// This is equivalent to Solidity's implementation of `mapping`.\n///\n/// Because the storage slot derivation is done using a hash function, it is not possible to compute the key (preimage)\n/// used to obtain a given derived state variable slot.\npub struct Map {\n pub context: Context,\n storage_slot: Field,\n}\n\n// Map reserves a single storage slot regardless of what it stores because nothing is stored at said slot: it is only\n// used to derive the storage slots of nested state variables, which is expected to never result in collisions or slots\n// being close to one another due to these being hashes. This mirrors the strategy adopted by Solidity mappings.\nimpl StateVariable<1, Context> for Map {\n fn new(context: Context, storage_slot: Field) -> Self {\n assert(storage_slot != 0, \"Storage slot 0 not allowed. Storage slots must start from 1.\");\n Map { context, storage_slot }\n }\n\n fn get_storage_slot(self) -> Field {\n self.storage_slot\n }\n}\n\nimpl Map {\n /// Returns the state variable for a key.\n ///\n /// This derives a unique storage slot for `key` and returns a state variable of type `V` at that slot. It is\n /// equivalent to accessing a `mapping` via the `[]` operator in Solidity (e.g. `balances[user]` would be\n /// `balances.at(user)`).\n ///\n /// ## Example\n ///\n /// ```noir\n /// #[external(\"utility\")]\n /// fn get_election_vote_tallies(election: ElectionId) -> u128 {\n /// self.storage.vote_tallies.at(election).read()\n /// }\n /// ```\n pub fn at(self, key: K) -> V\n where\n K: ToField,\n V: StateVariable,\n {\n V::new(\n self.context,\n derive_storage_slot_in_map(self.storage_slot, key),\n )\n }\n}\n" }, "234": { "function_locations": [ { "name": " for Owned>::new", "start": 1229 }, { "name": " for Owned>::get_storage_slot", "start": 1416 }, { "name": "Owned::at", "start": 1676 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/state_vars/owned.nr", "source": "use crate::protocol::address::AztecAddress;\nuse crate::state_vars::{OwnedStateVariable, StateVariable};\n\n/// Per-account state variable.\n///\n/// A wrapper state variable that is to be used with variables that implement the `OwnedStateVariable` trait.\n///\n/// Example usage:\n///\n/// ```noir\n/// #[storage]\n/// struct Storage {\n/// balance: Owned, Context>,\n/// }\n/// ```\n///\n/// To access the underlying owned state variable for a specific owner, use the `at` method:\n///\n/// ```noir\n/// let user_balance = storage.balance.at(user_address);\n/// ```\n///\n/// For more information on ownership, see the documentation for the `OwnedStateVariable` trait.\n///\n/// # Type Parameters\n///\n/// * `V` - The underlying type that implements `OwnedStateVariable` (e.g., `PrivateSet`, `PrivateMutable`).\n/// * `Context` - The execution context type (e.g., `PublicContext`, `PrivateContext`, `UtilityContext`). The context\n/// determines which methods of the state variable are available.\n///\npub struct Owned {\n pub context: Context,\n storage_slot: Field,\n}\n\nimpl StateVariable<1, Context> for Owned {\n fn new(context: Context, storage_slot: Field) -> Self {\n assert(storage_slot != 0, \"Storage slot 0 not allowed. Storage slots must start from 1.\");\n Owned { context, storage_slot }\n }\n\n fn get_storage_slot(self) -> Field {\n self.storage_slot\n }\n}\n\nimpl Owned {\n /// Returns an instance of the underlying owned state variable for a given owner.\n pub fn at(self, owner: AztecAddress) -> V\n where\n V: OwnedStateVariable,\n {\n V::new(self.context, self.storage_slot, owner)\n }\n}\n" }, "239": { "function_locations": [ { "name": " for PrivateMutable>::new", "start": 3533 }, { "name": "PrivateMutable::compute_initialization_nullifier", "start": 3785 }, { "name": "PrivateMutable::get_initialization_nullifier", "start": 4405 }, { "name": "PrivateMutable::initialize", "start": 6330 }, { "name": "PrivateMutable::replace", "start": 8752 }, { "name": "PrivateMutable::initialize_or_replace", "start": 10203 }, { "name": "PrivateMutable::get_note", "start": 14054 }, { "name": "PrivateMutable::get_initialization_nullifier", "start": 14827 }, { "name": "PrivateMutable::is_initialized", "start": 15470 }, { "name": "PrivateMutable::view_note", "start": 16267 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/state_vars/private_mutable.nr", "source": "use crate::{\n context::{PrivateContext, UtilityContext},\n keys::getters::{get_nhk_app, get_public_keys},\n note::{\n lifecycle::{create_note, destroy_note},\n note_getter::{get_note, view_note},\n note_interface::{NoteHash, NoteType},\n NoteMessage,\n },\n oracle::nullifiers::check_nullifier_exists,\n state_vars::OwnedStateVariable,\n};\n\nuse crate::protocol::{\n address::AztecAddress, constants::DOM_SEP__INITIALIZATION_NULLIFIER, hash::poseidon2_hash_with_separator,\n traits::Packable,\n};\n\nmod test;\n\n/// Per-account mutable private state.\n///\n/// PrivateMutable is an owned state variable type that represents a private value that can be changed. Because it is\n/// \"owned,\" you must wrap a PrivateMutable inside an Owned state variable when storing it:\n///\n/// E.g.:\n/// ```noir\n/// #[storage]\n/// struct Storage {\n/// your_variable: Owned, Context>,\n/// }\n/// ```\n///\n/// For more details on what \"owned\" means, see the documentation for the [`OwnedStateVariable`] trait.\n///\n/// A PrivateMutable state variable is initialized by inserting a very first note. Subsequently, the PrivateMutable can\n/// make changes to the state variable's value by nullifying the current note and inserting a replacement note.\n///\n/// ## Example\n///\n/// A user's account nonce can be represented as a PrivateMutable. The \"current value\" of the user's nonce\n/// is the value contained within the single not-yet-nullified note in the user's view of the PrivateMutable.\n///\n/// When the nonce needs to be incremented, the current note gets nullified and a new note with the incremented nonce\n/// gets inserted. The new note then becomes the \"current value\" of the PrivateMutable state variable.\n///\n/// This is similar to how `uint256 nonce` would work in Solidity: there's always exactly one current value, and\n/// updating it overwrites the previous value.\n///\n/// ## When to choose PrivateMutable vs PrivateSet:\n///\n/// - Use PrivateMutable when you want exactly one note to represent the state variable's current value, similar to\n/// regular variables in Solidity.\n/// - Use PrivateMutable when you want only the 'owner' of the private state to be able to make changes to it.\n/// - Use PrivateSet when you want multiple notes to collectively represent the state variable's current value (like a\n/// collection of token balance notes).\n/// - Use PrivateSet when you want to allow \"other people\" (beyond the owner) to insert notes into the state variable.\n///\n/// Only the 'owner' of the given PrivateMutable state variable can mutate it, because every mutation requires\n/// nullifying the current note, and only the owner knows both the note's content and the secret necessary to compute\n/// its nullifier.\n///\n/// ## Privacy\n///\n/// The methods of a PrivateMutable are only executable in a PrivateContext, and are designed to not leak anything\n/// about _which_ state variable was read/modified/initialized, to the outside world.\n///\n/// # Generic Parameters:\n///\n/// * `Note` - A single note of this type will represent the PrivateMutable's current value at the given storage_slot.\n/// * `Context` - The execution context (PrivateContext or UtilityContext).\n///\npub struct PrivateMutable {\n context: Context,\n storage_slot: Field,\n owner: AztecAddress,\n}\n\nimpl OwnedStateVariable for PrivateMutable {\n fn new(context: Context, storage_slot: Field, owner: AztecAddress) -> Self {\n Self { context, storage_slot, owner }\n }\n}\n\nimpl PrivateMutable {\n /// Computes the initialization nullifier using the provided secret.\n fn compute_initialization_nullifier(self, secret: Field) -> Field {\n poseidon2_hash_with_separator(\n [self.storage_slot, secret],\n DOM_SEP__INITIALIZATION_NULLIFIER,\n )\n }\n}\n\nimpl PrivateMutable\nwhere\n Note: NoteType + NoteHash,\n{\n /// Computes the nullifier that will be created when this PrivateMutable is first initialized.\n ///\n /// This function is primarily used internally by the `initialize` and `initialize_or_replace` methods, but may\n /// also be useful for contracts that need to check if a PrivateMutable has been initialized.\n ///\n fn get_initialization_nullifier(self) -> Field {\n let owner_npk_m_hash = get_public_keys(self.owner).npk_m_hash;\n let secret = self.context.request_nhk_app(owner_npk_m_hash);\n self.compute_initialization_nullifier(secret)\n }\n\n /// Initializes a PrivateMutable state variable instance with its first `note`.\n ///\n /// This function creates the very first note for this state variable. It can only be called once per\n /// PrivateMutable. Subsequent calls will fail because the initialization nullifier will already exist.\n ///\n /// This is conceptually similar to setting an initial value for a variable in Ethereum smart contracts under a\n /// user's address in a mapping, except that in Aztec the \"value\" is represented as a private note.\n ///\n /// ## Arguments\n ///\n /// * `note` - The initial note to store in this PrivateMutable. This note becomes the \"current value\" of the state\n /// variable.\n ///\n /// ## Returns\n ///\n /// * `NoteMessage` - A type-safe wrapper that requires you to decide whether to encrypt and send the note to\n /// someone. You can call `.deliver()` on it to encrypt and deliver the note. See NoteMessage for more details.\n ///\n /// ## Advanced\n ///\n /// This function performs the following operations:\n /// - Creates and emits an initialization nullifier to mark this storage slot as initialized. This prevents\n /// double-initialization.\n /// - Inserts the provided note into the protocol's Note Hash Tree.\n /// - Returns a NoteMessage type that allows the caller to decide how to encrypt and deliver the note to its\n /// intended recipient.\n ///\n /// The initialization nullifier is deterministically computed from the storage slot and can leak privacy\n /// information (see `compute_initialization_nullifier` documentation).\n pub fn initialize(self, note: Note) -> NoteMessage\n where\n Note: Packable,\n {\n // Nullify the storage slot.\n let nullifier = self.get_initialization_nullifier();\n self.context.push_nullifier_unsafe(nullifier);\n\n create_note(self.context, self.owner, self.storage_slot, note)\n }\n\n /// Reads the current note of a PrivateMutable state variable, nullifies it, and inserts a new note produced by a\n /// user-provided function.\n ///\n /// This function implements a \"read-and-replace\" pattern for updating private state in Aztec. It first retrieves\n /// the current note, then nullifies it (marking it as spent), and finally inserts a `new_note` produced by the\n /// user-provided function `f`.\n ///\n /// This function can only be called after the PrivateMutable has been initialized. If called on an uninitialized\n /// PrivateMutable, it will fail because there is no current note to replace. If you don't know if the state\n /// variable has been initialized already, you can use `initialize_or_replace` to handle both cases.\n ///\n /// ## Arguments\n ///\n /// * `f` - A function that takes the current `Note` and returns a new `Note` that will replace it and become the\n /// \"current value\".\n ///\n /// ## Returns\n ///\n /// * `NoteMessage` - A type-safe wrapper that requires you to decide whether to encrypt and send the note to\n /// someone. You can call `.deliver()` on it to encrypt and log the note. See NoteMessage documentation for more\n /// details.\n ///\n /// ## Advanced\n ///\n /// This function performs the following operations:\n /// - Retrieves the current note from the PXE via an oracle call\n /// - Validates that the current note exists and belongs to this storage slot\n /// - Computes the nullifier for the current note and pushes it to the context\n /// - Calls the user-provided function `f` to produce a new note\n /// - Inserts the resulting `new_note` into the Note Hash Tree using 'create_note'\n /// - Returns a NoteMessage type for the `new_note`, that allows the caller to decide how to encrypt and deliver\n /// this note to its intended recipient.\n ///\n /// The nullification of the previous note ensures that it cannot be used again, maintaining the invariant that a\n /// PrivateMutable has exactly one current note.\n ///\n pub fn replace(self, f: fn[Env](Note) -> Note) -> NoteMessage\n where\n Note: Packable,\n {\n let prev_confirmed_note = get_note(self.context, Option::some(self.owner), self.storage_slot);\n\n // Nullify previous note.\n destroy_note(self.context, prev_confirmed_note);\n\n let new_note = f(prev_confirmed_note.note);\n\n // Add replacement note.\n create_note(self.context, self.owner, self.storage_slot, new_note)\n }\n\n /// Initializes the PrivateMutable if it's uninitialized, or replaces the current note using a transform function.\n ///\n /// If uninitialized, `init_note` is used to initialize. If already initialized, the `transform_fn` is passed to\n /// `replace`, which retrieves the current note, nullifies it, and inserts the transformed note.\n ///\n /// ## Arguments\n ///\n /// * `f` - A function that takes an `Option` with the current `Note` and returns the `Note` to insert. This allows\n /// you to transform the current note before it is reinserted. The `Option` is `none` if the state variable was not\n /// initialized.\n ///\n ///\n /// ## Returns\n ///\n /// * `NoteMessage` - A type-safe wrapper that requires you to decide whether to encrypt and send the note to\n /// someone. You can call `.deliver()` on it to encrypt and log the note. See NoteMessage documentation for more\n /// details.\n ///\n pub fn initialize_or_replace(self, f: fn[Env](Option) -> Note) -> NoteMessage\n where\n Note: Packable,\n {\n // Safety: `check_nullifier_exists` is an unconstrained function - we can constrain a true value by providing\n // an inclusion proof of the nullifier, but cannot constrain a false value since a non-inclusion proof would\n // only be valid if done in public. Ultimately, this is not an issue given that we'll either:\n // - initialize the state variable, which would fail if it was already initialized due to\n // the duplicate\n // nullifier, or\n // - replace the current value, which would fail if it was not initialized since we\n // wouldn't be able\n // to produce an inclusion proof for the current note\n // This means that an honest oracle will assist the prover to produce a valid proof, while a malicious oracle\n // (i.e. one that returns an incorrect value for is_initialized) will simply fail to produce a proof.\n let is_initialized = unsafe { check_nullifier_exists(self.get_initialization_nullifier()) };\n\n // We call `initialize` or `replace` depending on initialization. However, these functions return a\n // `NewNoteMessage`, which we cannot return from if-else branches as it contains a mutable reference to the\n // context (which are forbidden to have in ifs). We therefore return the `NewNote`s inside the\n // `NewNoteMessage`s and create a `NewNoteMessage` outside the if-else.\n let new_note = if !is_initialized {\n self.initialize(f(Option::none())).new_note\n } else {\n self.replace(|note| f(Option::some(note))).new_note\n };\n\n NoteMessage::new(new_note, self.context)\n }\n\n /// Reads the current note of a PrivateMutable state variable instance.\n ///\n /// This function retrieves the current note, but with an important caveat: reading a \"current\" note requires\n /// nullifying it to ensure that it is indeed current, and that it and hasn't been nullified by some earlier\n /// transaction. Having nullified the note, we then need to re-insert a new note with equal value, so that this\n /// value remains available for future functions to read it as \"current\".\n ///\n /// This is different from reading variables in Ethereum, where reading doesn't modify the state. In Aztec's\n /// private state model, reading a \"current\" note \"consumes\" it and creates a new note of equal value but with\n /// fresh randomness.\n ///\n /// The returned note has the same content as the original but is actually the newly-created note.\n ///\n /// ## Returns\n ///\n /// * `NoteMessage` - A type-safe wrapper containing the newly-created note. You still need to decide whether\n /// to encrypt and send the note to someone. You can call `.deliver()` on it to encrypt and log the note. See\n /// NoteMessage documentation for more details.\n ///\n /// ## Advanced\n ///\n /// This function performs the \"nullify-and-recreate\" pattern:\n /// - Retrieves the current note from the PXE via an oracle call\n /// - Validates that the note exists and belongs to this contract address and storage slot\n /// - Nullifies the current note to ensure that it is indeed current\n /// - Creates a new note with identical content but with fresh randomness\n /// - Returns a NoteMessage for the new note\n ///\n /// This pattern ensures that:\n /// - You're always reading the most up-to-date note\n /// - Concurrent transactions can't create race conditions\n /// - The note remains available for future reads (via the fresh copy)\n ///\n /// The kernel will inject a unique nonce into the newly-created note, which means the new note will have a\n /// different nullifier, allowing it to be consumed in the future.\n ///\n pub fn get_note(self) -> NoteMessage\n where\n Note: Packable,\n {\n let confirmed_note = get_note(self.context, Option::some(self.owner), self.storage_slot);\n\n // Nullify current note to make sure it's reading the latest note.\n destroy_note(self.context, confirmed_note);\n\n // Add the same note again. Because a nonce is added to every note in the kernel, its nullifier will be\n // different.\n create_note(\n self.context,\n self.owner,\n self.storage_slot,\n confirmed_note.note,\n )\n }\n}\n\nimpl PrivateMutable\nwhere\n Note: NoteType + NoteHash + Eq,\n{\n /// Computes the nullifier that will be created when this PrivateMutable is first initialized.\n unconstrained fn get_initialization_nullifier(self) -> Field {\n let owner_npk_m_hash = get_public_keys(self.owner).npk_m_hash;\n let secret = get_nhk_app(owner_npk_m_hash);\n self.compute_initialization_nullifier(secret)\n }\n\n /// Checks whether this PrivateMutable has been initialized.\n ///\n /// Notice that this function is executable only within a UtilityContext, which is an unconstrained environment on\n /// the user's local device.\n ///\n /// ## Returns\n ///\n /// * `bool` - `true` if the PrivateMutable has been initialized (the initialization nullifier exists), `false`\n /// otherwise.\n ///\n pub unconstrained fn is_initialized(self) -> bool {\n let nullifier = self.get_initialization_nullifier();\n check_nullifier_exists(nullifier)\n }\n\n /// Returns the current note in this PrivateMutable without consuming it.\n ///\n /// This function is only available in a UtilityContext (unconstrained environment) and is typically used for\n /// offchain queries, view functions, or testing.\n ///\n /// Unlike `get_note()`, this function does NOT nullify and recreate the note. It simply reads the current note\n /// from the PXE's database without modifying the state. This makes it suitable for read-only operations.\n ///\n /// ## Returns\n ///\n /// * `Note` - The current note stored in this PrivateMutable.\n ///\n pub unconstrained fn view_note(self) -> Note\n where\n Note: Packable,\n {\n view_note(Option::some(self.owner), self.storage_slot).note\n }\n}\n" }, "279": { "function_locations": [ { "name": "UnconstrainedArray::at", "start": 3001 }, { "name": "UnconstrainedArray::empty_at", "start": 3363 }, { "name": "UnconstrainedArray::empty", "start": 3834 }, { "name": "UnconstrainedArray::len", "start": 3972 }, { "name": "UnconstrainedArray::push", "start": 4149 }, { "name": "UnconstrainedArray::pop", "start": 4444 }, { "name": "UnconstrainedArray::get", "start": 4757 }, { "name": "UnconstrainedArray::set", "start": 5081 }, { "name": "UnconstrainedArray::remove", "start": 5395 }, { "name": "UnconstrainedArray::clear", "start": 5573 }, { "name": "UnconstrainedArray::for_each", "start": 6201 }, { "name": "UnconstrainedArray::map", "start": 6555 }, { "name": "UnconstrainedArray::filter", "start": 6975 }, { "name": "UnconstrainedArray::any", "start": 7435 }, { "name": "UnconstrainedArray::all", "start": 7720 }, { "name": "UnconstrainedArray::find", "start": 7995 } ], "path": "/home/nventuro/pkg-1/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(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(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(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(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 {\n pub(crate) slot: Field,\n}\n\nimpl UnconstrainedArray\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(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(self, f: unconstrained fn[Env](T) -> U) -> UnconstrainedArray\n where\n T: Deserialize,\n U: Serialize,\n {\n let dest: UnconstrainedArray = 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(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(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(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(self, f: unconstrained fn[Env](T) -> bool) -> Option\n where\n T: Deserialize,\n {\n let n = self.len();\n let mut result: Option = 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" }, "282": { "function_locations": [ { "name": "append", "start": 396 }, { "name": "test::append_empty_vecs", "start": 608 }, { "name": "test::append_non_empty_vecs", "start": 933 }, { "name": "test::append_non_empty_vecs_insufficient_max_len", "start": 1387 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/utils/array/append.nr", "source": "/// Appends the elements of the second `BoundedVec` to the end of the first one. The resulting `BoundedVec` can have\n/// any arbitrary maximum length, but it must be large enough to fit all of the elements of both the first and second\n/// vectors.\npub fn append(\n a: BoundedVec,\n b: BoundedVec,\n) -> BoundedVec {\n let mut dst = BoundedVec::new();\n\n dst.extend_from_bounded_vec(a);\n dst.extend_from_bounded_vec(b);\n\n dst\n}\n\nmod test {\n use super::append;\n\n #[test]\n unconstrained fn append_empty_vecs() {\n let a: BoundedVec<_, 3> = BoundedVec::new();\n let b: BoundedVec<_, 14> = BoundedVec::new();\n\n let result: BoundedVec = append(a, b);\n\n assert_eq(result.len(), 0);\n assert_eq(result.storage(), std::mem::zeroed());\n }\n\n #[test]\n unconstrained fn append_non_empty_vecs() {\n let a: BoundedVec<_, 3> = BoundedVec::from_array([1, 2, 3]);\n let b: BoundedVec<_, 14> = BoundedVec::from_array([4, 5, 6]);\n\n let result: BoundedVec = append(a, b);\n\n assert_eq(result.len(), 6);\n assert_eq(result.storage(), [1, 2, 3, 4, 5, 6, std::mem::zeroed(), std::mem::zeroed()]);\n }\n\n #[test(should_fail_with = \"out of bounds\")]\n unconstrained fn append_non_empty_vecs_insufficient_max_len() {\n let a: BoundedVec<_, 3> = BoundedVec::from_array([1, 2, 3]);\n let b: BoundedVec<_, 14> = BoundedVec::from_array([4, 5, 6]);\n\n let _: BoundedVec = append(a, b);\n }\n}\n" }, "285": { "function_locations": [ { "name": "subarray", "start": 483 }, { "name": "test::subarray_into_empty", "start": 776 }, { "name": "test::subarray_complete", "start": 1100 }, { "name": "test::subarray_different_end_sizes", "start": 1294 }, { "name": "test::subarray_offset_too_large", "start": 1736 }, { "name": "test::subarray_bad_return_value", "start": 1941 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/utils/array/subarray.nr", "source": "/// Returns `DstLen` elements from a source array, starting at `offset`. `DstLen` must not be larger than the number of\n/// elements past `offset`.\n///\n/// Examples:\n/// ```\n/// let foo: [Field; 2] = subarray([1, 2, 3, 4, 5], 2);\n/// assert_eq(foo, [3, 4]);\n///\n/// let bar: [Field; 5] = subarray([1, 2, 3, 4, 5], 2); // fails - we can't return 5 elements since only 3 remain\n/// ```\npub fn subarray(src: [T; SrcLen], offset: u32) -> [T; DstLen] {\n assert(offset + DstLen <= SrcLen, \"DstLen too large for offset\");\n\n let mut dst: [T; DstLen] = std::mem::zeroed();\n for i in 0..DstLen {\n dst[i] = src[i + offset];\n }\n\n dst\n}\n\nmod test {\n use super::subarray;\n\n #[test]\n unconstrained fn subarray_into_empty() {\n // In all of these cases we're setting DstLen to be 0, so we always get back an empty array.\n assert_eq(subarray::([], 0), []);\n assert_eq(subarray([1, 2, 3, 4, 5], 0), []);\n assert_eq(subarray([1, 2, 3, 4, 5], 2), []);\n }\n\n #[test]\n unconstrained fn subarray_complete() {\n assert_eq(subarray::([], 0), []);\n assert_eq(subarray([1, 2, 3, 4, 5], 0), [1, 2, 3, 4, 5]);\n }\n\n #[test]\n unconstrained fn subarray_different_end_sizes() {\n // We implicitly select how many values to read in the size of the return array\n assert_eq(subarray([1, 2, 3, 4, 5], 1), [2, 3, 4, 5]);\n assert_eq(subarray([1, 2, 3, 4, 5], 1), [2, 3, 4]);\n assert_eq(subarray([1, 2, 3, 4, 5], 1), [2, 3]);\n assert_eq(subarray([1, 2, 3, 4, 5], 1), [2]);\n }\n\n #[test(should_fail_with = \"DstLen too large for offset\")]\n unconstrained fn subarray_offset_too_large() {\n // With an offset of 1 we can only request up to 4 elements\n let _: [_; 5] = subarray([1, 2, 3, 4, 5], 1);\n }\n\n #[test(should_fail)]\n unconstrained fn subarray_bad_return_value() {\n assert_eq(subarray([1, 2, 3, 4, 5], 1), [3, 3, 4, 5]);\n }\n}\n" }, "286": { "function_locations": [ { "name": "subbvec", "start": 1041 }, { "name": "test::subbvec_empty", "start": 1442 }, { "name": "test::subbvec_complete", "start": 1605 }, { "name": "test::subbvec_partial", "start": 1913 }, { "name": "test::subbvec_into_empty", "start": 2206 }, { "name": "test::subbvec_offset_past_len", "start": 2439 }, { "name": "test::subbvec_insufficient_dst_len", "start": 2646 }, { "name": "test::subbvec_dst_len_causes_enlarge", "start": 3100 }, { "name": "test::subbvec_dst_len_too_large_for_offset", "start": 3409 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/utils/array/subbvec.nr", "source": "use crate::utils::array;\n\n/// Returns `DstMaxLen` elements from a source BoundedVec, starting at `offset`. `offset` must not be larger than the\n/// original length, and `DstLen` must not be larger than the total number of elements past `offset` (including the\n/// zeroed elements past `len()`).\n///\n/// Only elements at the beginning of the vector can be removed: it is not possible to also remove elements at the end\n/// of the vector by passing a value for `DstLen` that is smaller than `len() - offset`.\n///\n/// Examples:\n/// ```\n/// let foo = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n/// assert_eq(subbvec(foo, 2), BoundedVec::<_, 8>::from_array([3, 4, 5]));\n///\n/// let bar: BoundedVec<_, 1> = subbvec(foo, 2); // fails - we can't return just 1 element since 3 remain\n/// let baz: BoundedVec<_, 10> = subbvec(foo, 3); // fails - we can't return 10 elements since only 7 remain\n/// ```\npub fn subbvec(\n bvec: BoundedVec,\n offset: u32,\n) -> BoundedVec {\n // The new storage array is a subarray of the original one (which has zeroed storage past len), so elements past\n // the new len remain zeroed: `subarray` does not allow extending arrays past their original length.\n BoundedVec::from_parts(array::subarray(bvec.storage(), offset), bvec.len() - offset)\n}\n\nmod test {\n use super::subbvec;\n\n #[test]\n unconstrained fn subbvec_empty() {\n let bvec = BoundedVec::::from_array([]);\n assert_eq(subbvec(bvec, 0), bvec);\n }\n\n #[test]\n unconstrained fn subbvec_complete() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n assert_eq(subbvec(bvec, 0), bvec);\n\n let smaller_capacity = BoundedVec::<_, 5>::from_array([1, 2, 3, 4, 5]);\n assert_eq(subbvec(bvec, 0), smaller_capacity);\n }\n\n #[test]\n unconstrained fn subbvec_partial() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n assert_eq(subbvec(bvec, 2), BoundedVec::<_, 8>::from_array([3, 4, 5]));\n assert_eq(subbvec(bvec, 2), BoundedVec::<_, 3>::from_array([3, 4, 5]));\n }\n\n #[test]\n unconstrained fn subbvec_into_empty() {\n let bvec: BoundedVec<_, 10> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n assert_eq(subbvec(bvec, 5), BoundedVec::<_, 5>::from_array([]));\n }\n\n #[test(should_fail)]\n unconstrained fn subbvec_offset_past_len() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n let _: BoundedVec<_, 1> = subbvec(bvec, 6);\n }\n\n #[test(should_fail)]\n unconstrained fn subbvec_insufficient_dst_len() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n // We're not providing enough space to hold all of the items inside the original BoundedVec. subbvec can cause\n // for the capacity to reduce, but not the length (other than by len - offset).\n let _: BoundedVec<_, 1> = subbvec(bvec, 2);\n }\n\n #[test(should_fail_with = \"DstLen too large for offset\")]\n unconstrained fn subbvec_dst_len_causes_enlarge() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n // subbvec does not support capacity increases\n let _: BoundedVec<_, 11> = subbvec(bvec, 0);\n }\n\n #[test(should_fail_with = \"DstLen too large for offset\")]\n unconstrained fn subbvec_dst_len_too_large_for_offset() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n // This effectively requests a capacity increase, since there'd be just one element plus the 5 empty slots,\n // which is less than 7.\n let _: BoundedVec<_, 7> = subbvec(bvec, 4);\n }\n}\n" }, "289": { "function_locations": [ { "name": "encode_bytes_as_fields", "start": 662 }, { "name": "decode_bytes_from_fields", "start": 1313 }, { "name": "tests::round_trips_bytes", "start": 1719 }, { "name": "tests::encode_rejects_length_not_multiple_of_31", "start": 2252 }, { "name": "tests::decode_rejects_oversized_field", "start": 2454 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/utils/conversion/bytes_as_fields.nr", "source": "use std::static_assert;\n\n/// Encodes an array of bytes as fields.\n///\n/// Use\n/// [`decode_bytes_from_fields`](crate::utils::conversion::bytes_as_fields::decode_bytes_from_fields) to recover\n/// the original bytes.\n///\n/// The `bytes` array length must be a multiple of 31. If padding is added, it will need to be manually removed\n/// after decoding.\n///\n/// ## Encoding\n///\n/// Each 31-byte chunk is interpreted as a big-endian integer and stored in a `Field`. For input `[1, 10, 3, ..., 0]`\n/// (31 bytes), the resulting `Field` is `1 * 256^30 + 10 * 256^29 + 3 * 256^28 + ... + 0`.\npub fn encode_bytes_as_fields(bytes: [u8; N]) -> [Field; N / 31] {\n static_assert(N % 31 == 0, \"N must be a multiple of 31\");\n\n let mut fields = [0; N / 31];\n for i in 0..N / 31 {\n let mut field = 0;\n for j in 0..31 {\n field = field * 256 + bytes[i * 31 + j] as Field;\n }\n fields[i] = field;\n }\n\n fields\n}\n\n/// Decodes fields back into bytes.\n///\n/// Inverse of\n/// [`encode_bytes_as_fields`](crate::utils::conversion::bytes_as_fields::encode_bytes_as_fields).\n/// Each input `Field` must fit in 248 bits; `Field::to_be_bytes::<31>()` fails the proof otherwise.\npub fn decode_bytes_from_fields(fields: BoundedVec) -> BoundedVec {\n let mut bytes = BoundedVec::new();\n for i in 0..fields.len() {\n let chunk: [u8; 31] = fields.get(i).to_be_bytes();\n for j in 0..31 {\n bytes.push(chunk[j]);\n }\n }\n bytes\n}\n\nmod tests {\n use crate::utils::array::subarray;\n use super::{decode_bytes_from_fields, encode_bytes_as_fields};\n\n #[test]\n unconstrained fn round_trips_bytes(input: [u8; 93]) {\n let fields = encode_bytes_as_fields(input);\n\n // In production the fields fly through the system and arrive as a BoundedVec on the other end.\n let fields_bvec = BoundedVec::<_, 6>::from_array(fields);\n let bytes_back = decode_bytes_from_fields(fields_bvec);\n\n assert_eq(bytes_back.len(), input.len());\n assert_eq(subarray(bytes_back.storage(), 0), input);\n }\n\n #[test(should_fail_with = \"N must be a multiple of 31\")]\n unconstrained fn encode_rejects_length_not_multiple_of_31() {\n let _fields = encode_bytes_as_fields([0; 32]);\n }\n\n #[test(should_fail_with = \"Field failed to decompose into specified 31 limbs\")]\n unconstrained fn decode_rejects_oversized_field() {\n // `Field::to_be_bytes::<31>()` fails the proof when a field has any bit above position 247 set.\n let oversized: Field = (1 as Field) * 2.pow_32(249);\n let input = BoundedVec::<_, 1>::from_array([oversized]);\n let _bytes = decode_bytes_from_fields(input);\n }\n}\n" }, "290": { "function_locations": [ { "name": "encode_fields_as_bytes", "start": 1007 }, { "name": "decode_fields_from_bytes", "start": 1603 }, { "name": "try_decode_fields_from_bytes", "start": 2190 }, { "name": "try_decode_field_from_bytes", "start": 2829 }, { "name": "tests::round_trips_fields", "start": 3733 }, { "name": "tests::try_decode_returns_none_on_length_not_multiple_of_32", "start": 4320 }, { "name": "tests::try_decode_accepts_max_field", "start": 4528 }, { "name": "tests::try_decode_returns_none_on_chunk_above_modulus", "start": 5063 }, { "name": "tests::try_decode_returns_none_on_chunk_equal_to_modulus", "start": 5718 }, { "name": "tests::decode_asserts_length_multiple_of_32", "start": 6128 }, { "name": "tests::decode_panics_on_chunk_above_modulus", "start": 6544 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/utils/conversion/fields_as_bytes.nr", "source": "/// Encodes an array of fields as bytes.\n///\n/// Losslessly preserves any field value; use\n/// [`try_decode_fields_from_bytes`](crate::utils::conversion::fields_as_bytes::try_decode_fields_from_bytes) to\n/// recover the original fields.\n///\n/// ## Encoding\n///\n/// Each field is written as 32 big-endian bytes and the chunks are concatenated. The field array `[5, 42]` becomes:\n///\n/// ```text\n/// [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5, // First field (32 bytes)\n/// 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,42] // Second field (32 bytes)\n/// ```\n///\n/// ## Privacy\n///\n/// The BN254 modulus is `< 2^254`, so every 32-byte chunk has its top bit at zero and the next bit biased. The output\n/// is therefore distinguishable from uniform random bytes; take this into account when feeding it into anything that\n/// assumes uniform randomness (e.g. ciphertexts meant to look random).\npub fn encode_fields_as_bytes(fields: [Field; N]) -> [u8; 32 * N] {\n let mut bytes = [0; 32 * N];\n for i in 0..N {\n let chunk: [u8; 32] = fields[i].to_be_bytes();\n for j in 0..32 {\n bytes[i * 32 + j] = chunk[j];\n }\n }\n bytes\n}\n\n/// Decodes bytes back into fields.\n///\n/// Panics if the input length is not a multiple of 32 or if any chunk exceeds the BN254 field modulus. See\n/// [`try_decode_fields_from_bytes`](crate::utils::conversion::fields_as_bytes::try_decode_fields_from_bytes)\n/// for a non-panicking variant.\npub fn decode_fields_from_bytes(bytes: BoundedVec) -> BoundedVec {\n assert(bytes.len() % 32 == 0, \"Input length must be a multiple of 32\");\n try_decode_fields_from_bytes(bytes).expect(f\"Value does not fit in field\")\n}\n\n/// Decodes bytes back into fields, returning None on failure.\n///\n/// Inverse of\n/// [`encode_fields_as_bytes`](crate::utils::conversion::fields_as_bytes::encode_fields_as_bytes).\n/// Returns `Option::none()` if the input length is not a multiple of 32, or if any 32-byte chunk is `>=` the BN254\n/// field modulus.\npub fn try_decode_fields_from_bytes(bytes: BoundedVec) -> Option> {\n if bytes.len() % 32 == 0 {\n let num_chunks = bytes.len() / 32;\n let mut fields: BoundedVec = BoundedVec::new();\n for i in 0..num_chunks {\n let maybe_field = try_decode_field_from_bytes(bytes, i * 32);\n if maybe_field.is_some() {\n fields.push(maybe_field.unwrap());\n }\n }\n if fields.len() == num_chunks {\n Option::some(fields)\n } else {\n Option::none()\n }\n } else {\n Option::none()\n }\n}\n\nfn try_decode_field_from_bytes(bytes: BoundedVec, offset: u32) -> Option {\n // Field arithmetic silently wraps values >= the modulus, so we compare each chunk against the modulus\n // byte-by-byte (big-endian) while building `field`. cmp: 0 = equal so far, 1 = less than modulus, 2 = exceeds.\n let p = std::field::modulus_be_bytes();\n let mut field = 0;\n let mut cmp: u8 = 0;\n for j in 0..32 {\n let byte = bytes.get(offset + j);\n field = field * 256 + byte as Field;\n if cmp == 0 {\n if byte < p[j] {\n cmp = 1;\n } else if byte > p[j] {\n cmp = 2;\n }\n }\n }\n\n if cmp == 1 {\n Option::some(field)\n } else {\n Option::none()\n }\n}\n\nmod tests {\n use crate::utils::array::subarray;\n use super::{decode_fields_from_bytes, encode_fields_as_bytes, try_decode_fields_from_bytes};\n\n #[test]\n unconstrained fn round_trips_fields(input: [Field; 3]) {\n let bytes = encode_fields_as_bytes(input);\n\n // In production the bytes fly through the system and arrive as a BoundedVec on the other end. 113 is an\n // arbitrary max length larger than the input length of 96.\n let bytes_bvec = BoundedVec::<_, 113>::from_array(bytes);\n let fields_back = try_decode_fields_from_bytes(bytes_bvec).unwrap();\n\n assert_eq(fields_back.len(), input.len());\n assert_eq(subarray(fields_back.storage(), 0), input);\n }\n\n #[test]\n unconstrained fn try_decode_returns_none_on_length_not_multiple_of_32() {\n let input = BoundedVec::<_, 64>::from_parts([0 as u8; 64], 33);\n assert(try_decode_fields_from_bytes(input).is_none());\n }\n\n #[test]\n unconstrained fn try_decode_accepts_max_field() {\n // -1 in field arithmetic wraps to `modulus - 1`, the largest valid field value.\n let max_field_as_bytes: [u8; 32] = (-1).to_be_bytes();\n let input = BoundedVec::<_, 32>::from_array(max_field_as_bytes);\n\n let fields = try_decode_fields_from_bytes(input).unwrap();\n\n assert_eq(fields.get(0), -1);\n }\n\n // Verifies the overflow check: take the max allowed value, bump a random byte, feed it in.\n #[test]\n unconstrained fn try_decode_returns_none_on_chunk_above_modulus(random_value: u8) {\n let index_of_byte_to_bump = random_value % 32;\n let max_field_value_as_bytes: [u8; 32] = (-1).to_be_bytes();\n let byte_to_bump = max_field_value_as_bytes[index_of_byte_to_bump as u32];\n\n // Skip if the selected byte is already 255. Acceptable under fuzz testing.\n if byte_to_bump != 255 {\n let mut input = BoundedVec::<_, 32>::from_array(max_field_value_as_bytes);\n input.set(index_of_byte_to_bump as u32, byte_to_bump + 1);\n\n assert(try_decode_fields_from_bytes(input).is_none());\n }\n }\n\n #[test]\n unconstrained fn try_decode_returns_none_on_chunk_equal_to_modulus() {\n // The field modulus itself is not a valid field value (it wraps to 0).\n let p: [u8; 32] = std::field::modulus_be_bytes().as_array();\n let input = BoundedVec::::from_array(p);\n assert(try_decode_fields_from_bytes(input).is_none());\n }\n\n #[test(should_fail_with = \"Input length must be a multiple of 32\")]\n unconstrained fn decode_asserts_length_multiple_of_32() {\n let input = BoundedVec::<_, 143>::from_array([\n 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29,\n 30, 31, 32, 33,\n ]);\n let _fields = decode_fields_from_bytes(input);\n }\n\n #[test(should_fail_with = \"Value does not fit in field\")]\n unconstrained fn decode_panics_on_chunk_above_modulus(random_value: u8) {\n let index_of_byte_to_bump = random_value % 32;\n let max_field_value_as_bytes: [u8; 32] = (-1).to_be_bytes();\n let byte_to_bump = max_field_value_as_bytes[index_of_byte_to_bump as u32];\n\n if byte_to_bump != 255 {\n let mut input = BoundedVec::<_, 32>::from_array(max_field_value_as_bytes);\n input.set(index_of_byte_to_bump as u32, byte_to_bump + 1);\n let _fields = decode_fields_from_bytes(input);\n }\n }\n}\n" }, "293": { "function_locations": [ { "name": "get_sign_of_point", "start": 514 }, { "name": "point_from_x_coord", "start": 1424 }, { "name": "point_from_x_coord_and_sign", "start": 2161 }, { "name": "test::test_point_from_x_coord_and_sign", "start": 2776 }, { "name": "test::test_point_from_x_coord_valid", "start": 3607 }, { "name": "test::test_point_from_x_coord_invalid", "start": 4049 }, { "name": "test::test_both_roots_satisfy_curve", "start": 4311 }, { "name": "test::test_point_from_x_coord_and_sign_invalid", "start": 4886 }, { "name": "test::test_get_sign_of_point", "start": 5297 }, { "name": "test::test_point_from_x_coord_zero", "start": 6383 }, { "name": "test::test_bn254_fr_modulus_div_2", "start": 6628 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/utils/point.nr", "source": "use crate::protocol::{point::EmbeddedCurvePoint, utils::field::sqrt};\n\n// I am storing the modulus minus 1 divided by 2 here because full modulus would throw \"String literal too large\" error\n// Full modulus is 21888242871839275222246405745257275088548364400416034343698204186575808495617\nglobal BN254_FR_MODULUS_DIV_2: Field = 10944121435919637611123202872628637544274182200208017171849102093287904247808;\n\n/// Returns: true if p.y <= MOD_DIV_2, else false.\npub fn get_sign_of_point(p: EmbeddedCurvePoint) -> bool {\n // We store only a \"sign\" of the y coordinate because the rest can be derived from the x coordinate. To get the\n // sign we check if the y coordinate is less or equal than the field's modulus minus 1 divided by 2. Ideally we'd\n // do `y <= MOD_DIV_2`, but there's no `lte` function, so instead we do `!(y > MOD_DIV_2)`, which is equivalent,\n // and then rewrite that as `!(MOD_DIV_2 < y)`, since we also have no `gt` function.\n !BN254_FR_MODULUS_DIV_2.lt(p.y)\n}\n\n/// Returns an `EmbeddedCurvePoint` in the Grumpkin curve given its x coordinate.\n///\n/// Because not all values in the field are valid x coordinates of points in the curve (i.e. there is no corresponding\n/// y value in the field that satisfies the curve equation), it may not be possible to reconstruct a `Point`.\n/// `Option::none()` is returned in such cases.\npub fn point_from_x_coord(x: Field) -> Option {\n // y ^ 2 = x ^ 3 - 17\n let rhs = x * x * x - 17;\n sqrt(rhs).map(|y| EmbeddedCurvePoint { x, y })\n}\n\n/// Returns an `EmbeddedCurvePoint` in the Grumpkin curve given its x coordinate and sign for the y coordinate.\n///\n/// Because not all values in the field are valid x coordinates of points in the curve (i.e. there is no corresponding\n/// y value in the field that satisfies the curve equation), it may not be possible to reconstruct a `Point`.\n/// `Option::none()` is returned in such cases.\n///\n/// @param x - The x coordinate of the point @param sign - The \"sign\" of the y coordinate - determines whether y <=\n/// (Fr.MODULUS - 1) / 2\npub fn point_from_x_coord_and_sign(x: Field, sign: bool) -> Option {\n // y ^ 2 = x ^ 3 - 17\n let rhs = x * x * x - 17;\n\n sqrt(rhs).map(|y| {\n // If there is a square root, we need to ensure it has the correct \"sign\"\n let y_is_positive = !BN254_FR_MODULUS_DIV_2.lt(y);\n let final_y = if y_is_positive == sign { y } else { -y };\n EmbeddedCurvePoint { x, y: final_y }\n })\n}\n\nmod test {\n use crate::protocol::point::EmbeddedCurvePoint;\n use crate::utils::point::{\n BN254_FR_MODULUS_DIV_2, get_sign_of_point, point_from_x_coord, point_from_x_coord_and_sign,\n };\n\n #[test]\n unconstrained fn test_point_from_x_coord_and_sign() {\n // Test positive y coordinate\n let x = 0x1af41f5de96446dc3776a1eb2d98bb956b7acd9979a67854bec6fa7c2973bd73;\n let sign = true;\n let p = point_from_x_coord_and_sign(x, sign).unwrap();\n\n assert_eq(p.x, x);\n assert_eq(p.y, 0x07fc22c7f2c7057571f137fe46ea9c95114282bc95d37d71ec4bfb88de457d4a);\n assert_eq(p.is_infinite(), false);\n\n // Test negative y coordinate\n let x2 = 0x247371652e55dd74c9af8dbe9fb44931ba29a9229994384bd7077796c14ee2b5;\n let sign2 = false;\n let p2 = point_from_x_coord_and_sign(x2, sign2).unwrap();\n\n assert_eq(p2.x, x2);\n assert_eq(p2.y, 0x26441aec112e1ae4cee374f42556932001507ad46e255ffb27369c7e3766e5c0);\n assert_eq(p2.is_infinite(), false);\n }\n\n #[test]\n unconstrained fn test_point_from_x_coord_valid() {\n // x = 8 is a known quadratic residue - should give a valid point\n let result = point_from_x_coord(Field::from(8));\n assert(result.is_some());\n\n let point = result.unwrap();\n assert_eq(point.x, Field::from(8));\n // Check curve equation y^2 = x^3 - 17\n assert_eq(point.y * point.y, point.x * point.x * point.x - 17);\n }\n\n #[test]\n unconstrained fn test_point_from_x_coord_invalid() {\n // x = 3 is a non-residue for this curve - should give None\n let x = Field::from(3);\n let maybe_point = point_from_x_coord(x);\n assert(maybe_point.is_none());\n }\n\n #[test]\n unconstrained fn test_both_roots_satisfy_curve() {\n // Derive a point from x = 8 (known to be valid from test_point_from_x_coord_valid)\n let x: Field = 8;\n let point = point_from_x_coord(x).unwrap();\n\n // Check y satisfies curve equation\n assert_eq(point.y * point.y, x * x * x - 17);\n\n // Check -y also satisfies curve equation\n let neg_y = 0 - point.y;\n assert_eq(neg_y * neg_y, x * x * x - 17);\n\n // Verify they are different (unless y = 0)\n assert(point.y != neg_y);\n }\n\n #[test]\n unconstrained fn test_point_from_x_coord_and_sign_invalid() {\n // x = 3 has no valid point on the curve (from test_point_from_x_coord_invalid)\n let x = Field::from(3);\n let result_positive = point_from_x_coord_and_sign(x, true);\n let result_negative = point_from_x_coord_and_sign(x, false);\n\n assert(result_positive.is_none());\n assert(result_negative.is_none());\n }\n\n #[test]\n unconstrained fn test_get_sign_of_point() {\n // Derive a point from x = 8, then test both possible y values\n let point = point_from_x_coord(8).unwrap();\n let neg_point = EmbeddedCurvePoint { x: point.x, y: 0 - point.y };\n\n // One should be \"positive\" (y <= MOD_DIV_2) and one \"negative\"\n let sign1 = get_sign_of_point(point);\n let sign2 = get_sign_of_point(neg_point);\n assert(sign1 != sign2);\n\n // y = 0 should return true (0 <= MOD_DIV_2)\n let zero_y_point = EmbeddedCurvePoint { x: 0, y: 0 };\n assert(get_sign_of_point(zero_y_point) == true);\n\n // y = MOD_DIV_2 should return true (exactly at boundary)\n let boundary_point = EmbeddedCurvePoint { x: 0, y: BN254_FR_MODULUS_DIV_2 };\n assert(get_sign_of_point(boundary_point) == true);\n\n // y = MOD_DIV_2 + 1 should return false (just over boundary)\n let over_boundary_point = EmbeddedCurvePoint { x: 0, y: BN254_FR_MODULUS_DIV_2 + 1 };\n assert(get_sign_of_point(over_boundary_point) == false);\n }\n\n #[test]\n unconstrained fn test_point_from_x_coord_zero() {\n // x = 0: y^2 = 0^3 - 17 = -17, which is not a quadratic residue in BN254 scalar field\n let result = point_from_x_coord(0);\n assert(result.is_none());\n }\n\n #[test]\n unconstrained fn test_bn254_fr_modulus_div_2() {\n // Verify that BN254_FR_MODULUS_DIV_2 == (p - 1) / 2 This means: 2 * BN254_FR_MODULUS_DIV_2 + 1 == p == 0 (in\n // the field)\n assert_eq(2 * BN254_FR_MODULUS_DIV_2 + 1, 0);\n }\n\n}\n" }, "294": { "function_locations": [ { "name": "remove_constraints", "start": 240 }, { "name": "remove_constraints_if", "start": 579 }, { "name": "test::return_unit", "start": 1152 }, { "name": "test::return_field", "start": 1203 }, { "name": "test::returns_unit", "start": 1256 }, { "name": "test::returns_original_value", "start": 1488 }, { "name": "test::returns_unit_unconstrained", "start": 1740 }, { "name": "test::returns_original_value_unconstrained", "start": 1955 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/utils/remove_constraints.nr", "source": "/// Calls a function and returns its return value, but removes any constraints associated with calling the function,\n/// behaving as if the function was unconstrained.\npub unconstrained fn remove_constraints(f: fn[Env]() -> T) -> T {\n f()\n}\n\n/// Calls a function and returns its return value, removing any constraints associated with calling the function if\n/// `condition` is true, behaving as if the function was unconstrained.\n///\n/// Requires `condition` to be a compile time constant.\npub fn remove_constraints_if(condition: bool, f: fn[Env]() -> T) -> T {\n // If `condition` is not a compile-time constant, then the compiler won't optimize away the branch not taken in the\n // if statement below, and we may end up with constraints for `f` regardless of the runtime value of `condition`.\n assert_constant(condition);\n\n if condition {\n // Safety: the purpose of this function is to execute `f` with no constraints when `condition` is true.\n unsafe {\n remove_constraints(f)\n }\n } else {\n f()\n }\n}\n\nmod test {\n use super::remove_constraints;\n\n fn return_unit() -> () {\n ()\n }\n\n fn return_field() -> Field {\n 5\n }\n\n #[test]\n fn returns_unit() {\n let expected = return_unit();\n // Safety: this is a test\n let actual = unsafe { remove_constraints(|| return_unit()) };\n assert_eq(actual, expected);\n }\n\n #[test]\n fn returns_original_value() {\n let expected = return_field();\n // Safety: this is a test\n let actual = unsafe { remove_constraints(|| return_field()) };\n assert_eq(actual, expected);\n }\n\n #[test]\n unconstrained fn returns_unit_unconstrained() {\n let expected = return_unit();\n let actual = remove_constraints(|| return_unit());\n assert_eq(actual, expected);\n }\n\n #[test]\n unconstrained fn returns_original_value_unconstrained() {\n let expected = return_field();\n let actual = remove_constraints(|| return_field());\n assert_eq(actual, expected);\n }\n}\n" }, "3": { "function_locations": [ { "name": "[T; N]::len", "start": 480 }, { "name": "[T; N]::as_vector", "start": 735 }, { "name": "[T; N]::as_slice", "start": 1112 }, { "name": "[T; N]::map", "start": 1443 }, { "name": "[T; N]::mapi", "start": 2004 }, { "name": "[T; N]::for_each", "start": 2552 }, { "name": "[T; N]::for_eachi", "start": 2970 }, { "name": "[T; N]::fold", "start": 3837 }, { "name": "[T; N]::reduce", "start": 4355 }, { "name": "[T; N]::all", "start": 4865 }, { "name": "[T; N]::any", "start": 5338 }, { "name": "[T; N]::concat", "start": 5881 }, { "name": "[T; N]::sort", "start": 6778 }, { "name": "[T; N]::sort_via", "start": 7794 }, { "name": "[u8; N]::as_str_unchecked", "start": 8944 }, { "name": "> for [u8; N]>::from", "start": 9071 }, { "name": "test::map_empty", "start": 9145 }, { "name": "test::sort_u32", "start": 10255 }, { "name": "test::test_sort", "start": 10310 }, { "name": "test::test_sort_empty", "start": 10536 }, { "name": "test::test_sort_via_empty", "start": 10682 }, { "name": "test::test_sort_100_values", "start": 10841 }, { "name": "test::test_sort_100_values_comptime", "start": 12009 }, { "name": "test::test_sort_via", "start": 12154 }, { "name": "test::test_sort_via_100_values", "start": 12401 }, { "name": "test::mapi_empty", "start": 13562 }, { "name": "test::for_each_empty", "start": 13657 }, { "name": "test::for_eachi_empty", "start": 13795 }, { "name": "test::map_example", "start": 13934 }, { "name": "test::mapi_example", "start": 14071 }, { "name": "test::for_each_example", "start": 14220 }, { "name": "test::for_eachi_example", "start": 14560 }, { "name": "test::concat", "start": 14771 }, { "name": "test::concat_zero_length_with_something", "start": 15030 }, { "name": "test::concat_something_with_zero_length", "start": 15233 }, { "name": "test::concat_zero_lengths", "start": 15422 }, { "name": "test::test_fold", "start": 15623 }, { "name": "test::test_reduce", "start": 15788 }, { "name": "test::test_reduce_failure_on_empty_array", "start": 15999 }, { "name": "test::test_all", "start": 16147 }, { "name": "test::test_any", "start": 16296 }, { "name": "test::test_to_string", "start": 16451 }, { "name": "test::test_bytes_from_string", "start": 16597 } ], "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; 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(&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(&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(&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(&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(&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(&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(&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(&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(&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; 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; 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(&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 [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\nimpl From> for [u8; N] {\n /// Returns an array of the string bytes.\n fn from(s: str) -> 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" }, "303": { "function_locations": [ { "name": "Poseidon2::hash", "start": 333 }, { "name": "Poseidon2::new", "start": 442 }, { "name": "Poseidon2::perform_duplex", "start": 649 }, { "name": "Poseidon2::absorb", "start": 923 }, { "name": "Poseidon2::squeeze", "start": 1453 }, { "name": "Poseidon2::hash_internal", "start": 1814 }, { "name": "::finish", "start": 4105 }, { "name": "::write", "start": 4426 }, { "name": "::default", "start": 4549 } ], "path": "/home/nventuro/nargo/github.com/noir-lang/poseidon/v0.3.0/src/poseidon2.nr", "source": "use std::default::Default;\nuse std::hash::Hasher;\n\nglobal RATE: u32 = 3;\n\npub struct Poseidon2 {\n cache: [Field; 3],\n state: [Field; 4],\n cache_size: u32,\n squeeze_mode: bool, // 0 => absorb, 1 => squeeze\n}\n\nimpl Poseidon2 {\n #[no_predicates]\n pub fn hash(input: [Field; N], message_size: u32) -> Field {\n Poseidon2::hash_internal(input, message_size)\n }\n\n pub(crate) fn new(iv: Field) -> Poseidon2 {\n let mut result =\n Poseidon2 { cache: [0; 3], state: [0; 4], cache_size: 0, squeeze_mode: false };\n result.state[RATE] = iv;\n result\n }\n\n fn perform_duplex(&mut self) {\n // add the cache into sponge state\n self.state[0] += self.cache[0];\n self.state[1] += self.cache[1];\n self.state[2] += self.cache[2];\n self.state = crate::poseidon2_permutation(self.state);\n }\n\n fn absorb(&mut self, input: Field) {\n assert(!self.squeeze_mode);\n if self.cache_size == RATE {\n // If we're absorbing, and the cache is full, apply the sponge permutation to compress the cache\n self.perform_duplex();\n self.cache[0] = input;\n self.cache_size = 1;\n } else {\n // If we're absorbing, and the cache is not full, add the input into the cache\n self.cache[self.cache_size] = input;\n self.cache_size += 1;\n }\n }\n\n fn squeeze(&mut self) -> Field {\n assert(!self.squeeze_mode);\n // If we're in absorb mode, apply sponge permutation to compress the cache.\n self.perform_duplex();\n self.squeeze_mode = true;\n\n // Pop one item off the top of the permutation and return it.\n self.state[0]\n }\n\n fn hash_internal(input: [Field; N], in_len: u32) -> Field {\n let two_pow_64 = 18446744073709551616;\n let iv: Field = (in_len as Field) * two_pow_64;\n let mut state = [0; 4];\n state[RATE] = iv;\n\n if std::runtime::is_unconstrained() {\n for i in 0..(in_len / RATE) {\n state[0] += input[i * RATE];\n state[1] += input[i * RATE + 1];\n state[2] += input[i * RATE + 2];\n state = crate::poseidon2_permutation(state);\n }\n\n // handle remaining elements after last full RATE-sized chunk\n let num_extra_fields = in_len % RATE;\n if num_extra_fields != 0 {\n let remainder_start = in_len - num_extra_fields;\n state[0] += input[remainder_start];\n if num_extra_fields > 1 {\n state[1] += input[remainder_start + 1];\n }\n }\n } else {\n let mut states: [[Field; 4]; N / RATE + 1] = [[0; 4]; N / RATE + 1];\n states[0] = state;\n\n // process all full RATE-sized chunks, storing state after each permutation\n for chunk_idx in 0..(N / RATE) {\n for i in 0..RATE {\n state[i] += input[chunk_idx * RATE + i];\n }\n state = crate::poseidon2_permutation(state);\n states[chunk_idx + 1] = state;\n }\n\n // get state at the last full block before in_len\n let first_partially_filled_chunk = in_len / RATE;\n state = states[first_partially_filled_chunk];\n\n // handle remaining elements after last full RATE-sized chunk\n let remainder_start = (in_len / RATE) * RATE;\n for j in 0..RATE {\n let idx = remainder_start + j;\n if idx < in_len {\n state[j] += input[idx];\n }\n }\n }\n\n // always run final permutation unless we just completed a full chunk\n // still need to permute once if in_len is 0\n if (in_len == 0) | (in_len % RATE != 0) {\n state = crate::poseidon2_permutation(state);\n };\n\n state[0]\n }\n}\n\npub struct Poseidon2Hasher {\n _state: [Field],\n}\n\nimpl Hasher for Poseidon2Hasher {\n fn finish(self) -> Field {\n let iv: Field = (self._state.len() as Field) * 18446744073709551616; // iv = (self._state.len() << 64)\n let mut sponge = Poseidon2::new(iv);\n for i in 0..self._state.len() {\n sponge.absorb(self._state[i]);\n }\n sponge.squeeze()\n }\n\n fn write(&mut self, input: Field) {\n self._state = self._state.push_back(input);\n }\n}\n\nimpl Default for Poseidon2Hasher {\n fn default() -> Self {\n Poseidon2Hasher { _state: @[] }\n }\n}\n" }, "314": { "function_locations": [ { "name": "BlockHeader::chain_id", "start": 1262 }, { "name": "BlockHeader::version", "start": 1344 }, { "name": "BlockHeader::block_number", "start": 1428 }, { "name": "BlockHeader::timestamp", "start": 1514 }, { "name": "::empty", "start": 1617 }, { "name": "::hash", "start": 1959 }, { "name": "serialization_of_empty", "start": 2090 }, { "name": "hash_of_genesis_block_header", "start": 2490 }, { "name": "hash_of_empty_block_header_match_typescript", "start": 3427 } ], "path": "/home/nventuro/pkg-1/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" }, "361": { "function_locations": [ { "name": "::empty", "start": 853 }, { "name": "::to_field", "start": 953 }, { "name": "::from_field", "start": 1065 }, { "name": "AztecAddress::zero", "start": 1160 }, { "name": "AztecAddress::is_valid", "start": 1490 }, { "name": "AztecAddress::to_address_point", "start": 1865 }, { "name": "AztecAddress::is_positive", "start": 2511 }, { "name": "AztecAddress::get_y", "start": 3367 }, { "name": "AztecAddress::compute", "start": 3753 }, { "name": "AztecAddress::compute_from_class_id", "start": 7944 }, { "name": "AztecAddress::is_zero", "start": 8216 }, { "name": "AztecAddress::assert_is_zero", "start": 8281 }, { "name": "check_max_field_value", "start": 8365 }, { "name": "check_is_positive", "start": 8476 }, { "name": "check_embedded_curve_point_add", "start": 8997 }, { "name": "compute_address_from_partial_and_pub_keys", "start": 9262 }, { "name": "compute_preaddress_from_partial_and_pub_keys", "start": 11366 }, { "name": "from_field_to_field", "start": 11715 }, { "name": "serde", "start": 11852 }, { "name": "to_address_point_valid", "start": 12258 }, { "name": "to_address_point_invalid", "start": 12908 } ], "path": "/home/nventuro/pkg-1/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 {\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 {\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" }, "392": { "function_locations": [ { "name": "sha256_to_field", "start": 1253 }, { "name": "private_functions_root_from_siblings", "start": 1605 }, { "name": "compute_siloed_note_hash", "start": 2202 }, { "name": "compute_unique_note_hash", "start": 5031 }, { "name": "compute_note_hash_nonce", "start": 5247 }, { "name": "compute_note_nonce_and_unique_note_hash", "start": 5663 }, { "name": "compute_siloed_nullifier", "start": 5899 }, { "name": "create_protocol_nullifier", "start": 6116 }, { "name": "compute_log_tag", "start": 6480 }, { "name": "compute_siloed_private_log_first_field", "start": 6651 }, { "name": "compute_siloed_private_log", "start": 6882 }, { "name": "compute_contract_class_log_hash", "start": 7142 }, { "name": "compute_app_siloed_secret_key", "start": 7333 }, { "name": "compute_l2_to_l1_message_hash", "start": 7628 }, { "name": "accumulate_sha256", "start": 8709 }, { "name": "poseidon2_hash", "start": 9037 }, { "name": "poseidon2_hash_with_separator", "start": 9228 }, { "name": "poseidon2_hash_subarray", "start": 9714 }, { "name": "poseidon2_hash_with_separator_bounded_vec", "start": 10126 }, { "name": "poseidon2_hash_bytes", "start": 10487 }, { "name": "subarray_hash_matches_fixed", "start": 11063 }, { "name": "subarray_hash_matches_variable", "start": 11462 }, { "name": "smoke_sha256_to_field", "start": 11878 }, { "name": "unique_siloed_note_hash_matches_typescript", "start": 13280 }, { "name": "siloed_nullifier_matches_typescript", "start": 14502 }, { "name": "siloed_private_log_first_field_matches_typescript", "start": 14882 }, { "name": "empty_l2_to_l1_message_hash_matches_typescript", "start": 15292 }, { "name": "l2_to_l1_message_hash_matches_typescript", "start": 15743 }, { "name": "poseidon2_hash_with_separator_bounded_vec_matches_non_bounded_vec_version", "start": 16359 } ], "path": "/home/nventuro/pkg-1/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(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> {\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,\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(inputs: [Field; N]) -> Field {\n poseidon::poseidon2::Poseidon2::hash(inputs, N)\n}\n\n#[no_predicates]\npub fn poseidon2_hash_with_separator(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(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(\n inputs: BoundedVec,\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(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::::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" }, "394": { "function_locations": [ { "name": "fatal_log", "start": 395 }, { "name": "error_log", "start": 473 }, { "name": "warn_log", "start": 550 }, { "name": "info_log", "start": 626 }, { "name": "verbose_log", "start": 705 }, { "name": "debug_log", "start": 785 }, { "name": "trace_log", "start": 863 }, { "name": "fatal_log_format", "start": 1033 }, { "name": "error_log_format", "start": 1161 }, { "name": "warn_log_format", "start": 1288 }, { "name": "info_log_format", "start": 1414 }, { "name": "verbose_log_format", "start": 1543 }, { "name": "debug_log_format", "start": 1673 }, { "name": "trace_log_format", "start": 1801 }, { "name": "log_format", "start": 1934 }, { "name": "log_oracle_wrapper", "start": 2248 }, { "name": "log_oracle", "start": 2802 } ], "path": "/home/nventuro/pkg-1/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(msg: str) {\n fatal_log_format(msg, []);\n}\n\npub fn error_log(msg: str) {\n error_log_format(msg, []);\n}\n\npub fn warn_log(msg: str) {\n warn_log_format(msg, []);\n}\n\npub fn info_log(msg: str) {\n info_log_format(msg, []);\n}\n\npub fn verbose_log(msg: str) {\n verbose_log_format(msg, []);\n}\n\npub fn debug_log(msg: str) {\n debug_log_format(msg, []);\n}\n\npub fn trace_log(msg: str) {\n trace_log_format(msg, []);\n}\n\n// --- Per-level log functions (with format args) ---\n\npub fn fatal_log_format(msg: str, args: [Field; N]) {\n log_format(FATAL_LOG_LEVEL, msg, args);\n}\n\npub fn error_log_format(msg: str, args: [Field; N]) {\n log_format(ERROR_LOG_LEVEL, msg, args);\n}\n\npub fn warn_log_format(msg: str, args: [Field; N]) {\n log_format(WARN_LOG_LEVEL, msg, args);\n}\n\npub fn info_log_format(msg: str, args: [Field; N]) {\n log_format(INFO_LOG_LEVEL, msg, args);\n}\n\npub fn verbose_log_format(msg: str, args: [Field; N]) {\n log_format(VERBOSE_LOG_LEVEL, msg, args);\n}\n\npub fn debug_log_format(msg: str, args: [Field; N]) {\n log_format(DEBUG_LOG_LEVEL, msg, args);\n}\n\npub fn trace_log_format(msg: str, args: [Field; N]) {\n log_format(TRACE_LOG_LEVEL, msg, args);\n}\n\nfn log_format(log_level: u8, msg: str, 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(\n log_level: u8,\n msg: str,\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(\n log_level: u8,\n msg: str,\n length: u32,\n args: [Field; N],\n) {}\n" }, "410": { "function_locations": [ { "name": "get_generics_declarations", "start": 941 }, { "name": "get_where_trait_clause", "start": 2911 }, { "name": "derive_packable", "start": 5843 }, { "name": "test::packable_on_empty", "start": 11541 }, { "name": "test::packable_on_smol", "start": 11848 }, { "name": "test::packable_on_contains_array_with_generics", "start": 12285 } ], "path": "/home/nventuro/pkg-1/noir-projects/noir-protocol-circuits/crates/types/src/meta/mod.nr", "source": "pub use serde::serialization::{derive_deserialize, derive_serialize};\n\npub mod utils;\n\n/// Generates the generic parameter declarations for a struct's trait implementation.\n///\n/// This function takes a struct type definition and generates the generic parameter declarations\n/// that go after the `impl` keyword. For example, given a struct with generics `N: u32` and `T`,\n/// it generates ``.\n///\n/// # Parameters\n/// - `s`: The struct type definition to generate generic declarations for\n///\n/// # Returns\n/// A quoted code block containing the generic parameter declarations, or an empty quote if the struct\n/// has no generic parameters\n///\n/// # Example\n/// For a struct defined as:\n/// ```\n/// struct Container {\n/// items: [T; N],\n/// count: u32\n/// }\n/// ```\n///\n/// This function generates:\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\n/// Generates the `where` clause for a trait implementation that constrains non-numeric generic type parameters.\n///\n/// This function takes a struct type definition and a trait name, and generates a `where` clause that\n/// requires all non-numeric generic type parameters to implement the specified trait.\n///\n/// # Parameters\n/// - `s`: The struct type definition to generate the where clause for\n/// - `trait_name`: The name of the trait that non-numeric generic parameters must implement\n///\n/// # Returns\n/// A quoted code block containing the where clause, or an empty quote if the struct has no non-numeric\n/// generic parameters\n///\n/// # Example\n/// For a struct defined as:\n/// ```\n/// struct Container {\n/// items: [T; N],\n/// count: u32\n/// }\n/// ```\n///\n/// And trait name \"Serialize\", this function generates:\n/// ```\n/// where T: Serialize\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\n/// Generates a [`Packable`](crate::traits::Packable) 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 `Packable` 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 Packable for MyStruct {\n/// let N: u32 = 2;\n///\n/// fn pack(self) -> [Field; 2] {\n/// let mut result: [Field; 2] = [0_Field; 2];\n/// let mut offset: u32 = 0_u32;\n/// let packed_member: [Field; 1] = self.x.pack();\n/// let packed_member_len: u32 = ::N;\n/// for i in 0_u32..packed_member_len {\n/// {\n/// result[i + offset] = packed_member[i];\n/// }\n/// }\n/// offset = offset + packed_member_len;\n/// let packed_member: [Field; 1] = self.y.pack();\n/// let packed_member_len: u32 = ::N;\n/// for i in 0_u32..packed_member_len {\n/// {\n/// result[i + offset] = packed_member[i];\n/// }\n/// }\n/// offset = offset + packed_member_len;\n/// result\n/// }\n///\n/// fn unpack(packed: [Field; 2]) -> Self {\n/// let mut offset: u32 = 0_u32;\n/// let mut member_fields: [Field; 1] = [0_Field; 1];\n/// for i in 0_u32..::N {\n/// member_fields[i] = packed[i + offset];\n/// }\n/// let x: AztecAddress = ::unpack(member_fields);\n/// offset = offset + ::N;\n/// let mut member_fields: [Field; 1] = [0_Field; 1];\n/// for i in 0_u32..::N {\n/// member_fields[i] = packed[i + offset];\n/// }\n/// let y: Field = ::unpack(member_fields);\n/// offset = offset + ::N;\n/// Self { x: x, y: y }\n/// }\n/// }\n/// ```\npub comptime fn derive_packable(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 `Packable` trait.\n let generics_declarations = get_generics_declarations(s);\n let where_packable_clause = get_where_trait_clause(s, quote { Packable });\n\n // The following will give us:\n // ::N + ::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::traits::Packable>::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 returning the packed member,\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 pack_function_body = if params.len() > 1 {\n // For multiple struct members, generate packing code that:\n // 1. Packs each member\n // 2. Copies the packed fields into the result array at the correct offset\n // 3. Updates the offset for the next member\n let packing_of_struct_members = params\n .map(|(param_name, param_type, _): (Quoted, Type, Quoted)| {\n quote {\n let packed_member = $crate::traits::Packable::pack(self.$param_name);\n let packed_member_len = <$param_type as $crate::traits::Packable>::N;\n for i in 0..packed_member_len {\n result[i + offset] = packed_member[i];\n }\n offset += packed_member_len;\n }\n })\n .join(quote {});\n\n quote {\n let mut result = [0; Self::N];\n let mut offset = 0;\n\n $packing_of_struct_members\n\n result\n }\n } else if params.len() == 1 {\n let param_name = params[0].0;\n quote {\n $crate::traits::Packable::pack(self.$param_name)\n }\n } else {\n quote {\n [0; Self::N]\n }\n };\n\n // For structs containing a single member, we can enhance performance by directly unpacking 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 unpack_function_body = if params.len() > 1 {\n // For multiple struct members, generate unpacking code that:\n // 1. Unpacks each member\n // 2. Copies packed fields into member array at correct offset\n // 3. Updates offset for next member\n let unpacking_of_struct_members = params\n .map(|(param_name, param_type, _): (Quoted, Type, Quoted)| {\n quote {\n let mut member_fields = [0; <$param_type as $crate::traits::Packable>::N];\n for i in 0..<$param_type as $crate::traits::Packable>::N {\n member_fields[i] = packed[i + offset];\n }\n let $param_name = <$param_type as $crate::traits::Packable>::unpack(member_fields);\n offset += <$param_type as $crate::traits::Packable>::N;\n }\n })\n .join(quote {});\n\n // We join the struct member names with a comma to be used in the `Self { ... }` syntax\n let struct_members = params\n .map(|(param_name, _, _): (Quoted, Type, Quoted)| quote { $param_name })\n .join(quote {,});\n\n quote {\n let mut offset = 0;\n $unpacking_of_struct_members\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::traits::Packable::unpack(packed) }\n }\n } else {\n quote {\n Self {}\n }\n };\n\n quote {\n impl$generics_declarations $crate::traits::Packable for $typ\n $where_packable_clause\n {\n let N: u32 = $right_hand_side_of_definition_of_n;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n $pack_function_body\n }\n\n #[inline_always]\n fn unpack(packed: [Field; Self::N]) -> Self {\n $unpack_function_body\n }\n }\n }\n}\n\nmod test {\n use crate::traits::{Deserialize, Packable, Serialize};\n\n #[derive(Deserialize, Eq, Packable, Serialize)]\n pub struct Empty {}\n\n #[derive(Deserialize, Eq, Packable, Serialize)]\n pub struct Smol {\n a: Field,\n b: Field,\n }\n\n #[derive(Deserialize, Eq, Serialize)]\n pub struct HasArray {\n a: [Field; 2],\n b: bool,\n }\n\n #[derive(Deserialize, Eq, Serialize)]\n pub struct Fancier {\n a: Smol,\n b: [Field; 2],\n c: [u8; 3],\n d: str<16>,\n }\n\n #[derive(Deserialize, Eq, Packable, Serialize)]\n pub struct HasArrayWithGenerics {\n pub fields: [T; N],\n pub length: u32,\n }\n\n #[test]\n fn packable_on_empty() {\n let original = Empty {};\n let packed = original.pack();\n assert_eq(packed, [], \"Packed does not match empty array\");\n let unpacked = Empty::unpack(packed);\n assert_eq(unpacked, original, \"Unpacked does not match original\");\n }\n\n #[test]\n fn packable_on_smol() {\n let smol = Smol { a: 1, b: 2 };\n let serialized = smol.serialize();\n assert(serialized == [1, 2], serialized);\n\n // None of the struct members implements the `Packable` trait so the packed and serialized data should be the same\n let packed = smol.pack();\n assert_eq(packed, serialized, \"Packed does not match serialized\");\n }\n\n #[test]\n fn packable_on_contains_array_with_generics() {\n let struct_with_array_of_generics = HasArrayWithGenerics { fields: [1, 2, 3], length: 3 };\n let packed = struct_with_array_of_generics.pack();\n assert(packed == [1, 2, 3, 3], packed);\n\n let unpacked = HasArrayWithGenerics::unpack(packed);\n assert(unpacked == struct_with_array_of_generics);\n }\n\n}\n" }, "413": { "function_locations": [ { "name": "Poseidon2Sponge::hash", "start": 798 }, { "name": "Poseidon2Sponge::new", "start": 938 }, { "name": "Poseidon2Sponge::perform_duplex", "start": 1151 }, { "name": "Poseidon2Sponge::absorb", "start": 1592 }, { "name": "Poseidon2Sponge::squeeze", "start": 2126 }, { "name": "Poseidon2Sponge::hash_internal", "start": 2544 } ], "path": "/home/nventuro/pkg-1/noir-projects/noir-protocol-circuits/crates/types/src/poseidon2.nr", "source": "use crate::constants::TWO_POW_64;\nuse crate::traits::{Deserialize, Serialize};\nuse std::meta::derive;\n// NB: This is a clone of noir/noir-repo/noir_stdlib/src/hash/poseidon2.nr\n// It exists as we sometimes need to perform custom absorption, but the stdlib version\n// has a private absorb() method (it's also designed to just be a hasher)\n// Can be removed when standalone noir poseidon lib exists: See noir#6679\n// TODO: Poseidon is stand-alone now\n\nglobal RATE: u32 = 3;\n\n#[derive(Deserialize, Eq, Serialize)]\npub struct Poseidon2Sponge {\n pub cache: [Field; 3],\n pub state: [Field; 4],\n pub cache_size: u32,\n pub squeeze_mode: bool, // 0 => absorb, 1 => squeeze\n}\n\nimpl Poseidon2Sponge {\n #[no_predicates]\n pub fn hash(input: [Field; N], message_size: u32) -> Field {\n Poseidon2Sponge::hash_internal(input, message_size, message_size != N)\n }\n\n pub(crate) fn new(iv: Field) -> Poseidon2Sponge {\n let mut result =\n Poseidon2Sponge { cache: [0; 3], state: [0; 4], cache_size: 0, squeeze_mode: false };\n result.state[RATE] = iv;\n result\n }\n\n fn perform_duplex(&mut self) {\n // add the cache into sponge state\n for i in 0..RATE {\n // We effectively zero-pad the cache by only adding to the state\n // cache that is less than the specified `cache_size`\n if i < self.cache_size {\n self.state[i] += self.cache[i];\n }\n }\n self.state = std::hash::poseidon2_permutation(self.state);\n }\n\n pub fn absorb(&mut self, input: Field) {\n assert(!self.squeeze_mode);\n if self.cache_size == RATE {\n // If we're absorbing, and the cache is full, apply the sponge permutation to compress the cache\n self.perform_duplex();\n self.cache[0] = input;\n self.cache_size = 1;\n } else {\n // If we're absorbing, and the cache is not full, add the input into the cache\n self.cache[self.cache_size] = input;\n self.cache_size += 1;\n }\n }\n\n pub fn squeeze(&mut self) -> Field {\n assert(!self.squeeze_mode);\n // If we're in absorb mode, apply sponge permutation to compress the cache.\n self.perform_duplex();\n self.squeeze_mode = true;\n\n // Pop one item off the top of the permutation and return it.\n self.state[0]\n }\n\n fn hash_internal(\n input: [Field; N],\n in_len: u32,\n is_variable_length: bool,\n ) -> Field {\n let iv: Field = (in_len as Field) * TWO_POW_64;\n let mut sponge = Poseidon2Sponge::new(iv);\n for i in 0..input.len() {\n if i < in_len {\n sponge.absorb(input[i]);\n }\n }\n\n sponge.squeeze()\n }\n}\n" }, "42": { "function_locations": [ { "name": "Option::none", "start": 389 }, { "name": "Option::some", "start": 553 }, { "name": "Option::is_none", "start": 672 }, { "name": "Option::is_some", "start": 774 }, { "name": "Option::unwrap", "start": 898 }, { "name": "Option::unwrap_unchecked", "start": 1196 }, { "name": "Option::unwrap_or", "start": 1368 }, { "name": "Option::unwrap_or_else", "start": 1668 }, { "name": "Option::expect", "start": 1969 }, { "name": "Option::map", "start": 2190 }, { "name": "Option::map_or", "start": 2490 }, { "name": "Option::map_or_else", "start": 2784 }, { "name": "Option::and", "start": 3009 }, { "name": "Option::and_then", "start": 3446 }, { "name": "Option::or", "start": 3669 }, { "name": "Option::or_else", "start": 3902 }, { "name": "Option::xor", "start": 4192 }, { "name": "Option::filter", "start": 4636 }, { "name": "Option::flatten", "start": 5065 }, { "name": ">::default", "start": 5242 }, { "name": ">::eq", "start": 5357 }, { "name": ">::hash", "start": 5706 }, { "name": ">::cmp", "start": 5975 }, { "name": "tests::some_and_none", "start": 6447 }, { "name": "tests::unwrap_succeeds", "start": 6677 }, { "name": "tests::unwrap_fails", "start": 6781 }, { "name": "tests::unwrap_or", "start": 6868 }, { "name": "tests::unwrap_or_else", "start": 7016 }, { "name": "tests::expect_succeeds", "start": 7181 }, { "name": "tests::expect_fails", "start": 7328 }, { "name": "tests::map", "start": 7427 }, { "name": "tests::map_or", "start": 7595 }, { "name": "tests::map_or_else", "start": 7762 }, { "name": "tests::and", "start": 7937 }, { "name": "tests::and_then", "start": 8277 }, { "name": "tests::or", "start": 8663 }, { "name": "tests::or_else", "start": 9000 }, { "name": "tests::xor", "start": 9365 }, { "name": "tests::filter", "start": 9704 }, { "name": "tests::flatten", "start": 10030 }, { "name": "tests::default", "start": 10301 }, { "name": "tests::eq", "start": 10394 }, { "name": "tests::cmp", "start": 10714 } ], "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 {\n _is_some: bool,\n _value: T,\n}\n\nimpl Option {\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(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(self, message: fmtstr) -> 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(self, f: fn[Env](T) -> U) -> Option {\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(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(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(self, f: fn[Env](T) -> Option) -> Option {\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(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(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> into a Option.\n /// This returns None if the outer Option is None. Otherwise, this returns the inner Option.\n pub fn flatten(option: Option>) -> Option {\n if option._is_some {\n option._value\n } else {\n Option::none()\n }\n }\n}\n\nimpl Default for Option {\n fn default() -> Self {\n Option::none()\n }\n}\n\nimpl Eq for Option\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 Hash for Option\nwhere\n T: Hash,\n{\n fn hash(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 Ord for Option\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::::none().is_none());\n assert(!Option::::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::::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::::none().expect(f\"Should be there\");\n }\n\n #[test]\n fn map() {\n assert(Option::::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::::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::::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::::none().and(Option::none()), Option::none());\n assert_eq(Option::::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::::none().and_then(|_| Option::::none()), Option::none());\n assert_eq(Option::::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::::none()), Option::none());\n }\n\n #[test]\n fn or() {\n assert_eq(Option::::none().or(Option::none()), Option::none());\n assert_eq(Option::::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::::none().or_else(|| Option::none()), Option::none());\n assert_eq(Option::::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::::none().xor(Option::none()), Option::none());\n assert_eq(Option::::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::::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::>::none().flatten(), Option::none());\n assert_eq(Option::some(Option::::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::::default(), Option::none());\n }\n\n #[test]\n fn eq() {\n assert(Option::::none() == Option::none());\n assert(Option::::some(1) != Option::none());\n assert(Option::::none() != Option::some(1));\n assert(Option::::some(1) == Option::some(1));\n assert(Option::::some(1) != Option::some(2));\n }\n\n #[test]\n fn cmp() {\n let none = Option::::none();\n let one = Option::::some(1);\n let two = Option::::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" }, "420": { "function_locations": [ { "name": "hash_public_key", "start": 772 }, { "name": "::to_point", "start": 1029 }, { "name": "::hash", "start": 1108 }, { "name": "::default", "start": 1840 }, { "name": "PublicKeys::hash", "start": 2297 }, { "name": "PublicKeys::validate_on_curve", "start": 2986 }, { "name": "PublicKeys::validate_non_infinity", "start": 3299 }, { "name": "::to_point", "start": 3543 }, { "name": "test::default_hashes_match_default_points", "start": 4538 }, { "name": "test::compute_public_keys_hash", "start": 5437 }, { "name": "test::test_validate_on_curve", "start": 5970 }, { "name": "test::test_validate_not_on_curve", "start": 6363 }, { "name": "test::test_validate_non_infinity", "start": 6708 }, { "name": "test::test_validate_infinity", "start": 7113 }, { "name": "test::compute_default_hash", "start": 7462 }, { "name": "test::serde", "start": 7756 } ], "path": "/home/nventuro/pkg-1/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" }, "425": { "function_locations": [ { "name": "derive_storage_slot_in_map", "start": 274 }, { "name": "test::test_derive_storage_slot_in_map_matches_typescript", "start": 587 } ], "path": "/home/nventuro/pkg-1/noir-projects/noir-protocol-circuits/crates/types/src/storage/map.nr", "source": "use crate::{\n constants::DOM_SEP__PUBLIC_STORAGE_MAP_SLOT, hash::poseidon2_hash_with_separator,\n traits::ToField,\n};\n\n// TODO: Move this to src/public_data/storage/map.nr\npub fn derive_storage_slot_in_map(storage_slot: Field, key: K) -> Field\nwhere\n K: ToField,\n{\n poseidon2_hash_with_separator(\n [storage_slot, key.to_field()],\n DOM_SEP__PUBLIC_STORAGE_MAP_SLOT,\n )\n}\n\nmod test {\n use crate::{address::AztecAddress, storage::map::derive_storage_slot_in_map, traits::FromField};\n\n #[test]\n fn test_derive_storage_slot_in_map_matches_typescript() {\n let map_slot = 0x132258fb6962c4387ba659d9556521102d227549a386d39f0b22d1890d59c2b5;\n let key = AztecAddress::from_field(\n 0x302dbc2f9b50a73283d5fb2f35bc01eae8935615817a0b4219a057b2ba8a5a3f,\n );\n\n let slot = derive_storage_slot_in_map(map_slot, key);\n\n // The following value was generated by `map_slot.test.ts`\n let slot_from_typescript =\n 0x2d225f361108379adc2da91378b9702675c5546b57e78bafc1e74ec7fec55967;\n\n assert_eq(slot, slot_from_typescript);\n }\n}\n" }, "43": { "function_locations": [ { "name": "panic", "start": 196 }, { "name": "tests::panics", "start": 469 } ], "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(message: T) -> U\nwhere\n T: StringLike,\n{\n assert(false, message);\n crate::mem::zeroed()\n}\n\ntrait StringLike {}\n\nimpl StringLike for str {}\nimpl StringLike for fmtstr {}\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" }, "432": { "function_locations": [ { "name": "::to_field", "start": 176 }, { "name": "::to_field", "start": 276 }, { "name": "::to_field", "start": 382 }, { "name": "::to_field", "start": 468 }, { "name": "::to_field", "start": 575 }, { "name": "::to_field", "start": 682 }, { "name": "::to_field", "start": 790 }, { "name": ">::to_field", "start": 912 } ], "path": "/home/nventuro/pkg-1/noir-projects/noir-protocol-circuits/crates/types/src/traits/to_field.nr", "source": "use crate::utils::field::field_from_bytes;\n\npub trait ToField {\n fn to_field(self) -> Field;\n}\n\nimpl ToField for Field {\n #[inline_always]\n fn to_field(self) -> Field {\n self\n }\n}\n\nimpl ToField for bool {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u8 {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u16 {\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u32 {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u64 {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u128 {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for str {\n #[inline_always]\n fn to_field(self) -> Field {\n assert(N < 32, \"String doesn't fit in a field, consider using Serialize instead\");\n field_from_bytes(self.as_bytes(), true)\n }\n}\n" }, "433": { "function_locations": [ { "name": "::pack", "start": 564 }, { "name": "::unpack", "start": 946 }, { "name": "::pack", "start": 1397 }, { "name": "::unpack", "start": 1499 }, { "name": "::pack", "start": 1651 }, { "name": "::unpack", "start": 1753 }, { "name": "::pack", "start": 1906 }, { "name": "::unpack", "start": 2008 }, { "name": "::pack", "start": 2161 }, { "name": "::unpack", "start": 2263 }, { "name": "::pack", "start": 2418 }, { "name": "::unpack", "start": 2520 }, { "name": "::pack", "start": 2678 }, { "name": "::unpack", "start": 2771 }, { "name": "::pack", "start": 2915 }, { "name": "::unpack", "start": 3023 }, { "name": "::pack", "start": 3181 }, { "name": "::unpack", "start": 3290 }, { "name": "::pack", "start": 3450 }, { "name": "::unpack", "start": 3559 }, { "name": "::pack", "start": 3719 }, { "name": "::unpack", "start": 3828 }, { "name": "::pack", "start": 3997 }, { "name": "::unpack", "start": 4079 }, { "name": "::pack", "start": 4290 }, { "name": "::unpack", "start": 4652 }, { "name": "test_u16_packing", "start": 4897 }, { "name": "test_i8_packing", "start": 4993 }, { "name": "test_i16_packing", "start": 5089 }, { "name": "test_i32_packing", "start": 5187 }, { "name": "test_i64_packing", "start": 5285 }, { "name": "test_bool_unpack_accepts_canonical_values", "start": 5408 }, { "name": "test_bool_unpack_rejects_even_non_bool", "start": 5594 }, { "name": "test_bool_unpack_rejects_odd_non_bool", "start": 5827 }, { "name": "test_bool_unpack_rejects_large_field", "start": 6058 }, { "name": "test_bool_pack_unpack_roundtrip", "start": 6145 } ], "path": "/home/nventuro/pkg-1/noir-projects/noir-protocol-circuits/crates/types/src/type_packing.nr", "source": "use crate::traits::{Deserialize, Packable, Serialize};\n\nglobal BOOL_PACKED_LEN: u32 = 1;\nglobal U8_PACKED_LEN: u32 = 1;\nglobal U16_PACKED_LEN: u32 = 1;\nglobal U32_PACKED_LEN: u32 = 1;\nglobal U64_PACKED_LEN: u32 = 1;\nglobal U128_PACKED_LEN: u32 = 1;\nglobal FIELD_PACKED_LEN: u32 = 1;\nglobal I8_PACKED_LEN: u32 = 1;\nglobal I16_PACKED_LEN: u32 = 1;\nglobal I32_PACKED_LEN: u32 = 1;\nglobal I64_PACKED_LEN: u32 = 1;\nglobal POINT_PACKED_LEN: u32 = 2;\n\nimpl Packable for bool {\n let N: u32 = BOOL_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as Field]\n }\n\n /// Unpacks a `bool`, constraining the field to be a canonical boolean. A field outside `{0, 1}` is\n /// rejected (rather than silently reinterpreted), so an arbitrary-origin field cannot be misread.\n /// `pack` always emits `0` or `1`, so round-tripping is unaffected.\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> bool {\n let v = fields[0];\n // v * v == v holds iff v is 0 or 1: a single degree-2 constraint that both validates the field\n // is a canonical bool and avoids the byte-range decomposition that a cast to u8 would require.\n assert(v * v == v, \"Packable::unpack: bool field must be 0 or 1\");\n v == 1\n }\n}\n\nimpl Packable for u8 {\n let N: u32 = U8_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0] as u8\n }\n}\n\nimpl Packable for u16 {\n let N: u32 = U16_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0] as u16\n }\n}\n\nimpl Packable for u32 {\n let N: u32 = U32_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0] as u32\n }\n}\n\nimpl Packable for u64 {\n let N: u32 = U64_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0] as u64\n }\n}\n\nimpl Packable for u128 {\n let N: u32 = U128_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0] as u128\n }\n}\n\nimpl Packable for Field {\n let N: u32 = FIELD_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0]\n }\n}\n\nimpl Packable for i8 {\n let N: u32 = I8_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as u8 as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0] as u8 as i8\n }\n}\n\nimpl Packable for i16 {\n let N: u32 = I16_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as u16 as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0] as u16 as i16\n }\n}\n\nimpl Packable for i32 {\n let N: u32 = I32_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as u32 as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0] as u32 as i32\n }\n}\n\nimpl Packable for i64 {\n let N: u32 = I64_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as u64 as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0] as u64 as i64\n }\n}\n\nimpl Packable for super::point::EmbeddedCurvePoint {\n let N: u32 = POINT_PACKED_LEN;\n fn pack(self) -> [Field; Self::N] {\n self.serialize()\n }\n\n fn unpack(packed: [Field; Self::N]) -> Self {\n Self::deserialize(packed)\n }\n}\n\nimpl Packable for [T; M]\nwhere\n T: Packable,\n{\n let N: u32 = M * ::N;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n let mut result: [Field; Self::N] = std::mem::zeroed();\n for i in 0..M {\n let serialized = self[i].pack();\n for j in 0..::N {\n result[i * ::N + j] = serialized[j];\n }\n }\n result\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n let mut reader = crate::utils::reader::Reader::new(fields);\n let result: [T; M] = std::mem::zeroed();\n reader.read_struct_array::::N, M>(Packable::unpack, result)\n }\n}\n\n#[test]\nfn test_u16_packing() {\n let a: u16 = 10;\n assert_eq(a, u16::unpack(a.pack()));\n}\n\n#[test]\nfn test_i8_packing() {\n let a: i8 = -10;\n assert_eq(a, i8::unpack(a.pack()));\n}\n\n#[test]\nfn test_i16_packing() {\n let a: i16 = -10;\n assert_eq(a, i16::unpack(a.pack()));\n}\n\n#[test]\nfn test_i32_packing() {\n let a: i32 = -10;\n assert_eq(a, i32::unpack(a.pack()));\n}\n\n#[test]\nfn test_i64_packing() {\n let a: i64 = -10;\n assert_eq(a, i64::unpack(a.pack()));\n}\n\n#[test]\nfn test_bool_unpack_accepts_canonical_values() {\n assert_eq(bool::unpack([0]), false);\n assert_eq(bool::unpack([1]), true);\n}\n\n#[test(should_fail_with = \"bool field must be 0 or 1\")]\nfn test_bool_unpack_rejects_even_non_bool() {\n // 2 has LSB 0, so the previous LSB-based unpack silently returned false; now it is rejected.\n let _ = bool::unpack([2]);\n}\n\n#[test(should_fail_with = \"bool field must be 0 or 1\")]\nfn test_bool_unpack_rejects_odd_non_bool() {\n // 3 has LSB 1, so the previous LSB-based unpack silently returned true; now it is rejected.\n let _ = bool::unpack([3]);\n}\n\n#[test(should_fail_with = \"bool field must be 0 or 1\")]\nfn test_bool_unpack_rejects_large_field() {\n let _ = bool::unpack([1000000]);\n}\n\n#[test]\nfn test_bool_pack_unpack_roundtrip() {\n // `pack` always emits 0 or 1, so it round-trips through the canonical-bool check in `unpack`.\n assert_eq(true.pack(), [1]);\n assert_eq(false.pack(), [0]);\n assert_eq(bool::unpack(true.pack()), true);\n assert_eq(bool::unpack(false.pack()), false);\n}\n" }, "440": { "function_locations": [ { "name": "field_from_bytes", "start": 79 }, { "name": "field_from_bytes_32_trunc", "start": 555 }, { "name": "min", "start": 1056 }, { "name": "pow", "start": 1901 }, { "name": "sqrt", "start": 2235 }, { "name": "is_square", "start": 2917 }, { "name": "tonelli_shanks_sqrt", "start": 3345 }, { "name": "__sqrt", "start": 3953 }, { "name": "validate_sqrt_hint", "start": 4797 }, { "name": "validate_not_sqrt_hint", "start": 4934 }, { "name": "bytes_field_test", "start": 6572 }, { "name": "max_field_test", "start": 7555 }, { "name": "sqrt_valid_test", "start": 8179 }, { "name": "sqrt_invalid_test", "start": 8381 }, { "name": "sqrt_zero_test", "start": 8550 }, { "name": "sqrt_one_test", "start": 8687 }, { "name": "field_from_bytes_empty_test", "start": 8856 }, { "name": "field_from_bytes_little_endian_test", "start": 9109 }, { "name": "pow_test", "start": 9494 }, { "name": "min_test", "start": 9717 }, { "name": "sqrt_has_two_roots_test", "start": 9891 }, { "name": "sqrt_negative_one_test", "start": 10564 }, { "name": "validate_sqrt_hint_valid_test", "start": 10770 }, { "name": "validate_sqrt_hint_invalid_test", "start": 11201 }, { "name": "validate_not_sqrt_hint_valid_test", "start": 11333 }, { "name": "validate_not_sqrt_hint_zero_test", "start": 11613 }, { "name": "validate_not_sqrt_hint_wrong_hint_test", "start": 11830 } ], "path": "/home/nventuro/pkg-1/noir-projects/noir-protocol-circuits/crates/types/src/utils/field.nr", "source": "pub fn field_from_bytes(bytes: [u8; N], big_endian: bool) -> Field {\n std::static_assert(N < 32, \"field_from_bytes: N must be less than 32\");\n let mut as_field = 0;\n let mut offset = 1;\n for i in 0..N {\n let mut index = i;\n if big_endian {\n index = N - i - 1;\n }\n as_field += (bytes[index] as Field) * offset;\n offset *= 256;\n }\n\n as_field\n}\n\n// Convert a 32 byte array to a field element by truncating the final byte\npub fn field_from_bytes_32_trunc(bytes32: [u8; 32]) -> Field {\n // Convert it to a field element\n let mut v = 1;\n let mut high = 0 as Field;\n let mut low = 0 as Field;\n\n for i in 0..15 {\n // covers bytes 16..30 (31 is truncated and ignored)\n low = low + (bytes32[15 + 15 - i] as Field) * v;\n v = v * 256;\n // covers bytes 0..14\n high = high + (bytes32[14 - i] as Field) * v;\n }\n // covers byte 15\n low = low + (bytes32[15] as Field) * v;\n\n low + high * v\n}\n\npub fn min(f1: Field, f2: Field) -> Field {\n if f1.lt(f2) {\n f1\n } else {\n f2\n }\n}\n\n// TODO: write doc-comments and tests for these magic constants.\n\nglobal KNOWN_NON_RESIDUE: Field = 5; // This is a non-residue in Noir's native Field.\nglobal C1: u32 = 28;\nglobal C3: Field = 40770029410420498293352137776570907027550720424234931066070132305055;\nglobal C5: Field = 19103219067921713944291392827692070036145651957329286315305642004821462161904;\n\n// @dev: only use this for _huge_ exponents y, when writing a constrained function.\n// If you're only exponentiating by a small value, first consider writing-out the multiplications by hand.\n// Only after you've measured the gates of that approach, consider using the native Field::pow_32 function.\n// Only if your exponent is larger than 32 bits, resort to using this function.\npub fn pow(x: Field, y: Field) -> Field {\n let mut r = 1 as Field;\n let b: [bool; 254] = y.to_le_bits();\n\n for i in 0..254 {\n r *= r;\n r *= (b[254 - 1 - i] as Field) * x + (1 - b[254 - 1 - i] as Field);\n }\n\n r\n}\n\n/// Returns Option::some(sqrt) if there is a square root, and Option::none() if there isn't.\npub fn sqrt(x: Field) -> Option {\n // Safety: if the hint returns the square root of x, then we simply square it\n // check the result equals x. If x is not square, we return a value that\n // enables us to prove that fact (see the `else` clause below).\n let (is_sq, maybe_sqrt) = unsafe { __sqrt(x) };\n\n if is_sq {\n let sqrt = maybe_sqrt;\n validate_sqrt_hint(x, sqrt);\n Option::some(sqrt)\n } else {\n let not_sqrt_hint = maybe_sqrt;\n validate_not_sqrt_hint(x, not_sqrt_hint);\n Option::none()\n }\n}\n\n// Boolean indicating whether Field element is a square, i.e. whether there exists a y in Field s.t. x = y*y.\nunconstrained fn is_square(x: Field) -> bool {\n let v = pow(x, -1 / 2);\n v * (v - 1) == 0\n}\n\n// Tonelli-Shanks algorithm for computing the square root of a Field element.\n// Requires C1 = max{c: 2^c divides (p-1)}, where p is the order of Field\n// as well as C3 = (C2 - 1)/2, where C2 = (p-1)/(2^c1),\n// and C5 = ZETA^C2, where ZETA is a non-square element of Field.\n// These are pre-computed above as globals.\nunconstrained fn tonelli_shanks_sqrt(x: Field) -> Field {\n let mut z = pow(x, C3);\n let mut t = z * z * x;\n z *= x;\n let mut b = t;\n let mut c = C5;\n\n for i in 0..(C1 - 1) {\n for _j in 1..(C1 - i - 1) {\n b *= b;\n }\n\n z *= if b == 1 { 1 } else { c };\n\n c *= c;\n\n t *= if b == 1 { 1 } else { c };\n\n b = t;\n }\n\n z\n}\n\n// NB: this doesn't return an option, because in the case of there _not_ being a square root, we still want to return a field element that allows us to then assert in the _constrained_ sqrt function that there is no sqrt.\nunconstrained fn __sqrt(x: Field) -> (bool, Field) {\n let is_sq = is_square(x);\n if is_sq {\n let sqrt = tonelli_shanks_sqrt(x);\n (true, sqrt)\n } else {\n // Demonstrate that x is not a square (a.k.a. a \"quadratic non-residue\").\n // Facts:\n // The Legendre symbol (\"LS\") of x, is x^((p-1)/2) (mod p).\n // - If x is a square, LS(x) = 1\n // - If x is not a square, LS(x) = -1\n // - If x = 0, LS(x) = 0.\n //\n // Hence:\n // sq * sq = sq // 1 * 1 = 1\n // non-sq * non-sq = sq // -1 * -1 = 1\n // sq * non-sq = non-sq // -1 * 1 = -1\n //\n // See: https://en.wikipedia.org/wiki/Legendre_symbol\n let demo_x_not_square = x * KNOWN_NON_RESIDUE;\n let not_sqrt = tonelli_shanks_sqrt(demo_x_not_square);\n (false, not_sqrt)\n }\n}\n\nfn validate_sqrt_hint(x: Field, hint: Field) {\n assert(hint * hint == x, f\"The claimed_sqrt {hint} is not the sqrt of x {x}\");\n}\n\nfn validate_not_sqrt_hint(x: Field, hint: Field) {\n // We need this assertion, because x = 0 would pass the other assertions in this\n // function, and we don't want people to be able to prove that 0 is not square!\n assert(x != 0, \"0 has a square root; you cannot claim it is not square\");\n // Demonstrate that x is not a square (a.k.a. a \"quadratic non-residue\").\n //\n // Facts:\n // The Legendre symbol (\"LS\") of x, is x^((p-1)/2) (mod p).\n // - If x is a square, LS(x) = 1\n // - If x is not a square, LS(x) = -1\n // - If x = 0, LS(x) = 0.\n //\n // Hence:\n // 1. sq * sq = sq // 1 * 1 = 1\n // 2. non-sq * non-sq = sq // -1 * -1 = 1\n // 3. sq * non-sq = non-sq // -1 * 1 = -1\n //\n // See: https://en.wikipedia.org/wiki/Legendre_symbol\n //\n // We want to demonstrate that this below multiplication falls under bullet-point (2):\n let demo_x_not_square = x * KNOWN_NON_RESIDUE;\n // I.e. we want to demonstrate that `demo_x_not_square` has Legendre symbol 1\n // (i.e. that it is a square), so we prove that it is square below.\n // Why do we want to prove that it has LS 1?\n // Well, since it was computed with a known-non-residue, its squareness implies we're\n // in case 2 (something multiplied by a known-non-residue yielding a result which\n // has a LS of 1), which implies that x must be a non-square. The unconstrained\n // function gave us the sqrt of demo_x_not_square, so all we need to do is\n // assert its squareness:\n assert(\n hint * hint == demo_x_not_square,\n f\"The hint {hint} does not demonstrate that {x} is not a square\",\n );\n}\n\n#[test]\nunconstrained fn bytes_field_test() {\n // Tests correctness of field_from_bytes_32_trunc against existing methods\n // Bytes representing 0x543e0a6642ffeb8039296861765a53407bba62bd1c97ca43374de950bbe0a7\n let inputs = [\n 84, 62, 10, 102, 66, 255, 235, 128, 57, 41, 104, 97, 118, 90, 83, 64, 123, 186, 98, 189, 28,\n 151, 202, 67, 55, 77, 233, 80, 187, 224, 167,\n ];\n let field = field_from_bytes(inputs, true);\n let return_bytes: [u8; 31] = field.to_be_bytes();\n assert_eq(inputs, return_bytes);\n // 32 bytes - we remove the final byte, and check it matches the field\n let inputs2 = [\n 84, 62, 10, 102, 66, 255, 235, 128, 57, 41, 104, 97, 118, 90, 83, 64, 123, 186, 98, 189, 28,\n 151, 202, 67, 55, 77, 233, 80, 187, 224, 167, 158,\n ];\n let field2 = field_from_bytes_32_trunc(inputs2);\n let return_bytes2: [u8; 31] = field2.to_be_bytes();\n\n assert_eq(return_bytes2, return_bytes);\n assert_eq(field2, field);\n}\n\n#[test]\nunconstrained fn max_field_test() {\n // Tests the hardcoded value in constants.nr vs underlying modulus\n // NB: We can't use 0-1 in constants.nr as it will be transpiled incorrectly to ts and sol constants files\n let max_value = crate::constants::MAX_FIELD_VALUE;\n assert_eq(max_value, 0 - 1);\n // modulus == 0 is tested elsewhere, so below is more of a sanity check\n let max_bytes: [u8; 32] = max_value.to_be_bytes();\n let mod_bytes = std::field::modulus_be_bytes();\n for i in 0..31 {\n assert_eq(max_bytes[i], mod_bytes[i]);\n }\n assert_eq(max_bytes[31], mod_bytes[31] - 1);\n}\n\n#[test]\nunconstrained fn sqrt_valid_test() {\n let x = 16; // examples: 16, 9, 25, 81\n let result = sqrt(x);\n assert(result.is_some());\n assert_eq(result.unwrap() * result.unwrap(), x);\n}\n\n#[test]\nunconstrained fn sqrt_invalid_test() {\n let x = KNOWN_NON_RESIDUE; // has no square root in the field\n let result = sqrt(x);\n assert(result.is_none());\n}\n\n#[test]\nunconstrained fn sqrt_zero_test() {\n let result = sqrt(0);\n assert(result.is_some());\n assert_eq(result.unwrap(), 0);\n}\n\n#[test]\nunconstrained fn sqrt_one_test() {\n let result = sqrt(1);\n assert(result.is_some());\n assert_eq(result.unwrap() * result.unwrap(), 1);\n}\n\n#[test]\nunconstrained fn field_from_bytes_empty_test() {\n let empty: [u8; 0] = [];\n let result = field_from_bytes(empty, true);\n assert_eq(result, 0);\n\n let result_le = field_from_bytes(empty, false);\n assert_eq(result_le, 0);\n}\n\n#[test]\nunconstrained fn field_from_bytes_little_endian_test() {\n // Test little-endian conversion: [0x01, 0x02] should be 0x0201 = 513\n let bytes = [0x01, 0x02];\n let result_le = field_from_bytes(bytes, false);\n assert_eq(result_le, 0x0201);\n\n // Compare with big-endian: [0x01, 0x02] should be 0x0102 = 258\n let result_be = field_from_bytes(bytes, true);\n assert_eq(result_be, 0x0102);\n}\n\n#[test]\nunconstrained fn pow_test() {\n assert_eq(pow(2, 0), 1);\n assert_eq(pow(2, 1), 2);\n assert_eq(pow(2, 10), 1024);\n assert_eq(pow(3, 5), 243);\n assert_eq(pow(0, 5), 0);\n assert_eq(pow(1, 100), 1);\n}\n\n#[test]\nunconstrained fn min_test() {\n assert_eq(min(5, 10), 5);\n assert_eq(min(10, 5), 5);\n assert_eq(min(7, 7), 7);\n assert_eq(min(0, 1), 0);\n}\n\n#[test]\nunconstrained fn sqrt_has_two_roots_test() {\n // Every square has two roots: r and -r (i.e., p - r)\n // sqrt(16) can return 4 or -4\n let x = 16;\n let result = sqrt(x).unwrap();\n assert(result * result == x);\n // The other root is -result\n let other_root = 0 - result;\n assert(other_root * other_root == x);\n // Verify they are different (unless x = 0)\n assert(result != other_root);\n\n // Same for 9: roots are 3 and -3\n let y = 9;\n let result_y = sqrt(y).unwrap();\n assert(result_y * result_y == y);\n let other_root_y = 0 - result_y;\n assert(other_root_y * other_root_y == y);\n assert(result_y != other_root_y);\n}\n\n#[test]\nunconstrained fn sqrt_negative_one_test() {\n let x = 0 - 1;\n let result = sqrt(x);\n assert(result.unwrap() == 0x30644e72e131a029048b6e193fd841045cea24f6fd736bec231204708f703636);\n}\n\n#[test]\nunconstrained fn validate_sqrt_hint_valid_test() {\n // 4 is a valid sqrt of 16\n validate_sqrt_hint(16, 4);\n // -4 is also a valid sqrt of 16\n validate_sqrt_hint(16, 0 - 4);\n // 0 is a valid sqrt of 0\n validate_sqrt_hint(0, 0);\n // 1 is a valid sqrt of 1\n validate_sqrt_hint(1, 1);\n // -1 is also a valid sqrt of 1\n validate_sqrt_hint(1, 0 - 1);\n}\n\n#[test(should_fail_with = \"is not the sqrt of x\")]\nunconstrained fn validate_sqrt_hint_invalid_test() {\n // 5 is not a valid sqrt of 16\n validate_sqrt_hint(16, 5);\n}\n\n#[test]\nunconstrained fn validate_not_sqrt_hint_valid_test() {\n // 5 (KNOWN_NON_RESIDUE) is not a square.\n let x = KNOWN_NON_RESIDUE;\n let hint = tonelli_shanks_sqrt(x * KNOWN_NON_RESIDUE);\n validate_not_sqrt_hint(x, hint);\n}\n\n#[test(should_fail_with = \"0 has a square root\")]\nunconstrained fn validate_not_sqrt_hint_zero_test() {\n // 0 has a square root, so we cannot claim it is not square\n validate_not_sqrt_hint(0, 0);\n}\n\n#[test(should_fail_with = \"does not demonstrate that\")]\nunconstrained fn validate_not_sqrt_hint_wrong_hint_test() {\n // Provide a wrong hint for a non-square\n let x = KNOWN_NON_RESIDUE;\n validate_not_sqrt_hint(x, 123);\n}\n" }, "446": { "function_locations": [ { "name": "Reader::new", "start": 144 }, { "name": "Reader::read", "start": 222 }, { "name": "Reader::read_u32", "start": 355 }, { "name": "Reader::read_u64", "start": 429 }, { "name": "Reader::read_bool", "start": 505 }, { "name": "Reader::read_array", "start": 598 }, { "name": "Reader::read_struct", "start": 855 }, { "name": "Reader::read_struct_array", "start": 1094 }, { "name": "Reader::peek_offset", "start": 1263 }, { "name": "Reader::advance_offset", "start": 1362 }, { "name": "Reader::finish", "start": 1426 } ], "path": "/home/nventuro/pkg-1/noir-projects/noir-protocol-circuits/crates/serde/src/reader.nr", "source": "pub struct Reader {\n data: [Field; N],\n offset: u32,\n}\n\nimpl Reader {\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(&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(&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(\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" }, "447": { "function_locations": [ { "name": "derive_serialize", "start": 3018 }, { "name": "derive_deserialize", "start": 7208 }, { "name": "get_params_len_quote", "start": 10934 }, { "name": "get_generics_declarations", "start": 11393 }, { "name": "get_where_trait_clause", "start": 12477 } ], "path": "/home/nventuro/pkg-1/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 Serialize for str {\n/// let N: u32 = N;\n///\n/// fn serialize(self) -> [Field; Self::N] {\n/// let mut writer: Writer = Writer::new();\n/// self.stream_serialize(&mut writer);\n/// writer.finish()\n/// }\n///\n/// fn stream_serialize(self, writer: &mut Writer) {\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(self, writer: &mut Writer);\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/// fields: [Field; N],\n/// length: u32\n/// }\n/// ```\n///\n/// This function generates code equivalent to:\n/// ```\n/// impl Serialize for Log {\n/// let N: u32 = <[Field; N] as Serialize>::N + ::N;\n///\n/// fn serialize(self) -> [Field; Self::N] {\n/// let mut writer: Writer = Writer::new();\n/// self.stream_serialize(&mut writer);\n/// writer.finish()\n/// }\n///\n/// #[inline_always]\n/// fn stream_serialize(self, writer: &mut Writer) {\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 = $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(self, writer: &mut $crate::writer::Writer) {\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 Deserialize for str {\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(reader: &mut Reader) -> 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::::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(reader: &mut Reader) -> 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 = ::N + ::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(reader: &mut Reader) -> Self {\n/// let x = ::stream_deserialize(reader);\n/// let y = ::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 // ::N + ::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(reader: &mut $crate::reader::Reader) -> 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/// * `(::N + ::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" }, "449": { "function_locations": [ { "name": "::serialize", "start": 693 }, { "name": "::stream_serialize", "start": 914 }, { "name": "::deserialize", "start": 1082 }, { "name": "::stream_deserialize", "start": 1328 }, { "name": "::serialize", "start": 1470 }, { "name": "::stream_serialize", "start": 1691 }, { "name": "::deserialize", "start": 1855 }, { "name": "::stream_deserialize", "start": 2101 }, { "name": "::serialize", "start": 2246 }, { "name": "::stream_serialize", "start": 2467 }, { "name": "::deserialize", "start": 2633 }, { "name": "::stream_deserialize", "start": 2879 }, { "name": "::serialize", "start": 3025 }, { "name": "::stream_serialize", "start": 3246 }, { "name": "::deserialize", "start": 3412 }, { "name": "::stream_deserialize", "start": 3658 }, { "name": "::serialize", "start": 3804 }, { "name": "::stream_serialize", "start": 4025 }, { "name": "::deserialize", "start": 4191 }, { "name": "::stream_deserialize", "start": 4437 }, { "name": "::serialize", "start": 4585 }, { "name": "::stream_serialize", "start": 4806 }, { "name": "::deserialize", "start": 4974 }, { "name": "::stream_deserialize", "start": 5220 }, { "name": "::serialize", "start": 5371 }, { "name": "::stream_serialize", "start": 5592 }, { "name": "::deserialize", "start": 5753 }, { "name": "::stream_deserialize", "start": 5999 }, { "name": "::serialize", "start": 6136 }, { "name": "::stream_serialize", "start": 6357 }, { "name": "::deserialize", "start": 6527 }, { "name": "::stream_deserialize", "start": 6773 }, { "name": "::serialize", "start": 6924 }, { "name": "::stream_serialize", "start": 7145 }, { "name": "::deserialize", "start": 7318 }, { "name": "::stream_deserialize", "start": 7564 }, { "name": "::serialize", "start": 7717 }, { "name": "::stream_serialize", "start": 7938 }, { "name": "::deserialize", "start": 8111 }, { "name": "::stream_deserialize", "start": 8357 }, { "name": "::serialize", "start": 8510 }, { "name": "::stream_serialize", "start": 8731 }, { "name": "::deserialize", "start": 8904 }, { "name": "::stream_deserialize", "start": 9150 }, { "name": "::serialize", "start": 9350 }, { "name": "::stream_serialize", "start": 9571 }, { "name": "::deserialize", "start": 9831 }, { "name": "::stream_deserialize", "start": 10077 }, { "name": ">::serialize", "start": 10389 }, { "name": ">::stream_serialize", "start": 10610 }, { "name": ">::deserialize", "start": 10997 }, { "name": ">::stream_deserialize", "start": 11243 }, { "name": "::serialize", "start": 11621 }, { "name": "::stream_serialize", "start": 11744 }, { "name": "::deserialize", "start": 11944 }, { "name": "::stream_deserialize", "start": 12090 }, { "name": "::serialize", "start": 12297 }, { "name": "::stream_serialize", "start": 12397 }, { "name": "::deserialize", "start": 12593 }, { "name": "::stream_deserialize", "start": 12737 }, { "name": ">::deserialize", "start": 12916 }, { "name": ">::stream_deserialize", "start": 13162 }, { "name": ">::serialize", "start": 13395 }, { "name": ">::stream_serialize", "start": 13616 }, { "name": ">::deserialize", "start": 13997 }, { "name": ">::stream_deserialize", "start": 14243 }, { "name": "::deserialize", "start": 15299 }, { "name": "::stream_deserialize", "start": 15546 }, { "name": ">::serialize", "start": 15911 }, { "name": ">::stream_serialize", "start": 16132 }, { "name": "make_slice", "start": 16617 }, { "name": "impl_serialize_for_tuple", "start": 16867 }, { "name": "::serialize", "start": 20178 }, { "name": "::stream_serialize", "start": 20429 }, { "name": "::deserialize", "start": 20636 }, { "name": "::stream_deserialize", "start": 20897 }, { "name": "bounded_vec_serialization", "start": 21246 } ], "path": "/home/nventuro/pkg-1/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 = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize(self, writer: &mut Writer) {\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(reader: &mut Reader) -> 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 = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize(self, writer: &mut Writer) {\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(reader: &mut Reader) -> 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 = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize(self, writer: &mut Writer) {\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(reader: &mut Reader) -> 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 = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize(self, writer: &mut Writer) {\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(reader: &mut Reader) -> 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 = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize(self, writer: &mut Writer) {\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(reader: &mut Reader) -> 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 = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize(self, writer: &mut Writer) {\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(reader: &mut Reader) -> 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 = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize(self, writer: &mut Writer) {\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(reader: &mut Reader) -> 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 = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize(self, writer: &mut Writer) {\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(reader: &mut Reader) -> 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 = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize(self, writer: &mut Writer) {\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(reader: &mut Reader) -> 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 = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize(self, writer: &mut Writer) {\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(reader: &mut Reader) -> 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 = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize(self, writer: &mut Writer) {\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(reader: &mut Reader) -> Self {\n reader.read() as u64 as i64\n }\n}\n\nimpl Serialize for [T; M]\nwhere\n T: Serialize,\n{\n let N: u32 = ::N * M;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize(self, writer: &mut Writer) {\n for i in 0..M {\n self[i].stream_serialize(writer);\n }\n }\n}\n\nimpl Deserialize for [T; M]\nwhere\n T: Deserialize,\n{\n let N: u32 = ::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(reader: &mut Reader) -> 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 Serialize for Option\nwhere\n T: Serialize,\n{\n let N: u32 = ::N + 1;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize(self, writer: &mut Writer) {\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(::N);\n }\n }\n}\n\nimpl Deserialize for Option\nwhere\n T: Deserialize,\n{\n let N: u32 = ::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(reader: &mut Reader) -> Self {\n if reader.read_bool() {\n Option::some(::stream_deserialize(reader))\n } else {\n reader.advance_offset(::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(self, writer: &mut Writer) {\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(reader: &mut Reader) -> 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(self, writer: &mut Writer) {\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(reader: &mut Reader) -> Self {\n Self { x: reader.read(), y: reader.read() }\n }\n}\n\nimpl Deserialize for str {\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(reader: &mut Reader) -> Self {\n let u8_arr = <[u8; Self::N] as Deserialize>::stream_deserialize(reader);\n str::::from(u8_arr)\n }\n}\n\nimpl Serialize for str {\n let N: u32 = M;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize(self, writer: &mut Writer) {\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 Deserialize for BoundedVec\nwhere\n T: Deserialize,\n{\n let N: u32 = ::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(reader: &mut Reader) -> Self {\n let mut new_bounded_vec: BoundedVec = 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(::stream_deserialize(reader));\n }\n }\n\n // +1 for the length of the BoundedVec\n reader.advance_offset((M - len) * ::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(_reader: &mut Reader) -> 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 Serialize for BoundedVec\nwhere\n T: Serialize,\n{\n let N: u32 = ::N * M + 1; // +1 for the length of the BoundedVec\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize(self, writer: &mut Writer) {\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(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 // `::N + ::N + ::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 // `::N + ::N + ::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 = $crate::writer::Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize(self, writer: &mut $crate::writer::Writer) {\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(reader: &mut $crate::reader::Reader) -> 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 Serialize for (T1,)\nwhere\n T1: Serialize,\n{\n let N: u32 = ::N;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: crate::writer::Writer = crate::writer::Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize(self, writer: &mut Writer) {\n self.0.stream_serialize(writer);\n }\n}\n\nimpl Deserialize for (T1,)\nwhere\n T1: Deserialize,\n{\n let N: u32 = ::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(reader: &mut Reader) -> Self {\n (::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 = BoundedVec::from_array([]);\n let serialized = empty_vec.serialize();\n let deserialized = BoundedVec::::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" }, "450": { "function_locations": [ { "name": "Writer::new", "start": 128 }, { "name": "Writer::write", "start": 220 }, { "name": "Writer::write_u32", "start": 339 }, { "name": "Writer::write_u64", "start": 428 }, { "name": "Writer::write_bool", "start": 519 }, { "name": "Writer::write_array", "start": 629 }, { "name": "Writer::write_struct", "start": 841 }, { "name": "Writer::write_struct_array", "start": 1040 }, { "name": "Writer::advance_offset", "start": 1185 }, { "name": "Writer::finish", "start": 1263 } ], "path": "/home/nventuro/pkg-1/noir-projects/noir-protocol-circuits/crates/serde/src/writer.nr", "source": "pub struct Writer {\n data: [Field; N],\n offset: u32,\n}\n\nimpl Writer {\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(&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(&mut self, value: T, serialize: fn(T) -> [Field; K]) {\n self.write_array(serialize(value));\n }\n\n pub fn write_struct_array(\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" }, "460": { "function_locations": [ { "name": "verify_signature", "start": 1190 }, { "name": "assert_valid_signature", "start": 1828 }, { "name": "calculate_signature_challenge", "start": 2785 }, { "name": "is_on_curve", "start": 3097 }, { "name": "test::zero_signature", "start": 3382 }, { "name": "test::dst_matches_derivation", "start": 4057 }, { "name": "test::pinned_vector_small", "start": 4567 }, { "name": "test::pinned_vector_large", "start": 5336 }, { "name": "bench::bench_verify_signature", "start": 6380 }, { "name": "bench::bench_assert_valid_signature", "start": 6634 } ], "path": "/home/nventuro/nargo/github.com/noir-lang/schnorr/v0.4.0/src/lib.nr", "source": "use poseidon::poseidon2::Poseidon2;\nuse std::embedded_curve_ops::{EmbeddedCurvePoint, EmbeddedCurveScalar, multi_scalar_mul};\n\nglobal TWO_POW_128: Field = 0x100000000000000000000000000000000;\n\n/// Domain separation tag (DST) for the challenge hash of this Schnorr scheme.\n///\n/// Defined as `poseidon2_hash_bytes(\"schnorr_grumpkin_poseidon2\")` where the byte-packing\n/// is: little-endian into 31-byte chunks, then Poseidon2 of the resulting field elements\n/// (length-1 input here since the source string fits in a single chunk). The derivation is\n/// pinned by `test::dst_matches_derivation`. Native signers consuming this library must\n/// mirror the same constant.\n///\n/// Including the DST as the first input to the challenge hash binds every signature to the\n/// \"Schnorr over grumpkin with Poseidon2\" scheme, preventing cross-protocol reinterpretation\n/// of an unrelated Poseidon2 output as a valid Schnorr challenge.\npub global SCHNORR_CHALLENGE_DST: Field =\n 0x024c76938ed06b8ec1d9094b1013d190baa4011372f0604643bda812a63b832e;\n\npub fn verify_signature(\n public_key: EmbeddedCurvePoint,\n signature: (EmbeddedCurveScalar, EmbeddedCurveScalar),\n message: Field,\n) -> bool {\n let (sig_s, sig_e) = signature;\n let mut is_ok = is_on_curve(public_key);\n\n let zero = EmbeddedCurveScalar::new(0, 0);\n if ((sig_s != zero) & (sig_e != zero)) {\n let (r_is_infinite, e_computed) =\n calculate_signature_challenge(public_key, sig_s, sig_e, message);\n\n is_ok &= !r_is_infinite;\n let sig_e_field = sig_e.lo + sig_e.hi * TWO_POW_128;\n is_ok &= e_computed == sig_e_field;\n } else {\n is_ok = false;\n }\n is_ok\n}\n\npub fn assert_valid_signature(\n public_key: EmbeddedCurvePoint,\n signature: (EmbeddedCurveScalar, EmbeddedCurveScalar),\n message: Field,\n) {\n let (sig_s, sig_e) = signature;\n\n assert(is_on_curve(public_key));\n let zero = EmbeddedCurveScalar::new(0, 0);\n assert(sig_s != zero);\n assert(sig_e != zero);\n\n let (r_is_infinite, e_computed) =\n calculate_signature_challenge(public_key, sig_s, sig_e, message);\n\n assert(!r_is_infinite);\n let sig_e_field = sig_e.lo + sig_e.hi * TWO_POW_128;\n assert(e_computed == sig_e_field);\n}\n\n/// e = Poseidon2(SCHNORR_CHALLENGE_DST, R.x, pubkey.x, pubkey.y, message)\n///\n/// Mirrors the native C++ implementation: the Poseidon2 sponge operates over the BN254 scalar\n/// field (= grumpkin base field = Noir's Field). Since Field modulus < grumpkin scalar modulus,\n/// the challenge embeds losslessly into the grumpkin scalar field for the signature equation.\nfn calculate_signature_challenge(\n public_key: EmbeddedCurvePoint,\n sig_s: EmbeddedCurveScalar,\n sig_e: EmbeddedCurveScalar,\n message: Field,\n) -> (bool, Field) {\n let g1 = EmbeddedCurvePoint::generator();\n let r = multi_scalar_mul([g1, public_key], [sig_s, sig_e]);\n let e = Poseidon2::hash(\n [SCHNORR_CHALLENGE_DST, r.x, public_key.x, public_key.y, message],\n 5,\n );\n (r.is_infinite(), e)\n}\n\nfn is_on_curve(point: EmbeddedCurvePoint) -> bool {\n point.y * point.y == point.x * point.x * point.x - 17\n}\n\nmod test {\n use super::{SCHNORR_CHALLENGE_DST, verify_signature};\n use poseidon::poseidon2::Poseidon2;\n use std::embedded_curve_ops::{EmbeddedCurvePoint, EmbeddedCurveScalar};\n\n #[test]\n fn zero_signature() {\n let public_key: EmbeddedCurvePoint = EmbeddedCurvePoint::generator();\n let signature: (EmbeddedCurveScalar, EmbeddedCurveScalar) =\n (EmbeddedCurveScalar::new(0, 0), EmbeddedCurveScalar::new(0, 0));\n let message: Field = 0x1234;\n let verified = verify_signature(public_key, signature, message);\n assert(!verified);\n }\n\n // Recompute the DST from its source string and assert it matches the pinned constant.\n // Native signers consuming this library must derive the same value; if either side\n // drifts, signatures stop verifying across the native / in-circuit boundary.\n #[test]\n fn dst_matches_derivation() {\n let src = \"schnorr_grumpkin_poseidon2\".as_bytes();\n assert(src.len() <= 31);\n let mut packed: Field = 0;\n let mut mul: Field = 1;\n for i in 0..src.len() {\n packed += (src[i] as Field) * mul;\n mul *= 256;\n }\n let derived = Poseidon2::hash([packed], 1);\n assert_eq(derived, SCHNORR_CHALLENGE_DST);\n }\n\n // Pinned test vector mirroring the C++ `schnorr.pinned_test_vector_small` test.\n #[test]\n fn pinned_vector_small() {\n let public_key = EmbeddedCurvePoint::new(\n 0x2c39bbbde2d0ffcb5c4317dcbfa1771cf554a2f33c647446632fa707a5bf5f3f,\n 0x2b9c81935298af5ebe22f1a7279bb76781e6cadba3fb6c5c41ed942392dc687c,\n );\n let sig_s = EmbeddedCurveScalar::new(\n 0x5fd1ac0ad411110674830c54cb506212,\n 0x281906862cdb4e0efec7226d757fe803,\n );\n let sig_e = EmbeddedCurveScalar::new(\n 0x6c368959f958e525d761d06c47fd2ad6,\n 0x013f6a902c6c0efafdadbd4de409690d,\n );\n let message: Field = 0x2bc;\n assert(verify_signature(public_key, (sig_s, sig_e), message));\n }\n\n // Pinned test vector mirroring the C++ `schnorr.pinned_test_vector_large` test.\n #[test]\n fn pinned_vector_large() {\n let public_key = EmbeddedCurvePoint::new(\n 0x065812e335a97c2108ea8cf4ccfe2f9dd6b117a0714f5e18461575be93f61da6,\n 0x1a915003e8ec534f9a15d926a7ded478e178468ccc4f28e236e67450a55ac622,\n );\n let sig_s = EmbeddedCurveScalar::new(\n 0xf3bc3b7147acb9c621fd9f72dbf15ffa,\n 0x08599f379f0301dfefdbd0272554454d,\n );\n let sig_e = EmbeddedCurveScalar::new(\n 0x97065383ebbbd76620398792bd259bc2,\n 0x2ceaee87f45b7a417f0ffb05451a8c92,\n );\n let message: Field = 0x0123456789abcdef0fedcba9876543210123456789abcdef0fedcba987654321;\n assert(verify_signature(public_key, (sig_s, sig_e), message));\n }\n}\n\nmod bench {\n use super::{assert_valid_signature, verify_signature};\n use std::embedded_curve_ops::{EmbeddedCurvePoint, EmbeddedCurveScalar};\n\n #[export]\n pub fn bench_verify_signature(\n public_key: EmbeddedCurvePoint,\n signature: (EmbeddedCurveScalar, EmbeddedCurveScalar),\n message: Field,\n ) -> bool {\n verify_signature(public_key, signature, message)\n }\n\n #[export]\n pub fn bench_assert_valid_signature(\n public_key: EmbeddedCurvePoint,\n signature: (EmbeddedCurveScalar, EmbeddedCurveScalar),\n message: Field,\n ) {\n assert_valid_signature(public_key, signature, message)\n }\n}\n" }, "5": { "function_locations": [ { "name": "derive_eq", "start": 305 }, { "name": "::eq", "start": 851 }, { "name": "::eq", "start": 940 }, { "name": "::eq", "start": 1026 }, { "name": "::eq", "start": 1112 }, { "name": "::eq", "start": 1198 }, { "name": "::eq", "start": 1282 }, { "name": "::eq", "start": 1366 }, { "name": "::eq", "start": 1452 }, { "name": "::eq", "start": 1538 }, { "name": "::eq", "start": 1624 }, { "name": "::eq", "start": 1717 }, { "name": "::eq", "start": 1796 }, { "name": "::eq", "start": 1921 }, { "name": "::eq", "start": 2139 }, { "name": ">::eq", "start": 2418 }, { "name": "make_tuple_eq_body", "start": 2598 }, { "name": "::eq", "start": 2848 }, { "name": "::eq", "start": 2959 }, { "name": "::eq", "start": 3091 }, { "name": "::eq", "start": 3236 }, { "name": "::eq", "start": 3394 }, { "name": "::eq", "start": 3565 }, { "name": "::eq", "start": 3749 }, { "name": "::eq", "start": 3946 }, { "name": "::eq", "start": 4156 }, { "name": "::eq", "start": 4379 }, { "name": "::eq", "start": 4616 }, { "name": "::eq", "start": 4866 }, { "name": "::eq", "start": 4976 }, { "name": "Ordering::less", "start": 5577 }, { "name": "Ordering::equal", "start": 5648 }, { "name": "Ordering::greater", "start": 5721 }, { "name": "derive_ord", "start": 6092 }, { "name": "::cmp", "start": 6742 }, { "name": "::cmp", "start": 6989 }, { "name": "::cmp", "start": 7237 }, { "name": "::cmp", "start": 7485 }, { "name": "::cmp", "start": 7731 }, { "name": "::cmp", "start": 7977 }, { "name": "::cmp", "start": 8225 }, { "name": "::cmp", "start": 8473 }, { "name": "::cmp", "start": 8721 }, { "name": "::cmp", "start": 8975 }, { "name": "::cmp", "start": 9074 }, { "name": "::cmp", "start": 9544 }, { "name": "::cmp", "start": 9947 }, { "name": "make_tuple_ord_body", "start": 10515 }, { "name": "::cmp", "start": 11125 }, { "name": "::cmp", "start": 11246 }, { "name": "::cmp", "start": 11388 }, { "name": "::cmp", "start": 11544 }, { "name": "::cmp", "start": 11714 }, { "name": "::cmp", "start": 11898 }, { "name": "::cmp", "start": 12096 }, { "name": "::cmp", "start": 12308 }, { "name": "::cmp", "start": 12534 }, { "name": "::cmp", "start": 12774 }, { "name": "::cmp", "start": 13029 }, { "name": "::cmp", "start": 13298 }, { "name": "max", "start": 13660 }, { "name": "min", "start": 14037 }, { "name": "cmp_tests::sanity_check_min", "start": 14231 }, { "name": "cmp_tests::sanity_check_max", "start": 14427 }, { "name": "cmp_tests::correctly_handles_unequal_length_vectors", "start": 14649 }, { "name": "cmp_tests::lexicographic_ordering_for_vectors", "start": 14849 }, { "name": "cmp_tests::eq_unit", "start": 15181 }, { "name": "cmp_tests::eq_bool", "start": 15246 }, { "name": "cmp_tests::eq_integers", "start": 15422 }, { "name": "cmp_tests::eq_tuples", "start": 16163 }, { "name": "cmp_tests::cmp_unit", "start": 17041 }, { "name": "cmp_tests::cmp_bool", "start": 17130 }, { "name": "cmp_tests::cmp_integers", "start": 17394 }, { "name": "cmp_tests::cmp_tuples", "start": 18217 }, { "name": "cmp_tests::cmp_array", "start": 19224 }, { "name": "cmp_tests::cmp_vectors", "start": 19468 } ], "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 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 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 Eq for str {\n fn eq(self, other: str) -> 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 Eq for (A,) {\n fn eq(self, other: (A,)) -> bool {\n self.0 == other.0\n }\n}\n\nimpl Eq for (A, B) {\n fn eq(self, other: (A, B)) -> bool {\n make_tuple_eq_body!(2u32)\n }\n}\n\nimpl Eq for (A, B, C) {\n fn eq(self, other: (A, B, C)) -> bool {\n make_tuple_eq_body!(3u32)\n }\n}\n\nimpl 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 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 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 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 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 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 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 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 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 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 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 Ord for (A,) {\n fn cmp(self, other: (A,)) -> Ordering {\n self.0.cmp(other.0)\n }\n}\n\nimpl Ord for (A, B) {\n fn cmp(self, other: (A, B)) -> Ordering {\n make_tuple_ord_body!(2u32)\n }\n}\n\nimpl Ord for (A, B, C) {\n fn cmp(self, other: (A, B, C)) -> Ordering {\n make_tuple_ord_body!(3u32)\n }\n}\n\nimpl 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 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 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 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 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 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 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 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 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(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(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": { "function_locations": [ { "name": "HandshakeNote::new", "start": 1862 }, { "name": "HandshakeNote::app_siloed_secrets_for", "start": 2633 } ], "path": "/home/nventuro/pkg-1/noir-projects/noir-contracts/contracts/standard/handshake_registry_contract/src/handshake_note.nr", "source": "use aztec::{\n keys::ecdh_shared_secret::compute_app_siloed_shared_secret,\n macros::notes::note,\n messages::delivery::handshake::AppSiloedHandshakeSecrets,\n protocol::{\n address::AztecAddress,\n constants::DOM_SEP__CONSTRAINED_MSG_SENDER_SECRET,\n hash::poseidon2_hash_with_separator,\n point::EmbeddedCurvePoint,\n traits::{Deserialize, Packable, Serialize, ToField},\n },\n};\n\n/// A record of a handshake established by the note's owner (the sender).\n///\n/// Stored in [`crate::HandshakeRegistry`]'s `handshakes` state. Holds the forgery-protected shared-secret point `S'`\n/// (the raw ECDH secret `S` made specific to this handshake). App contracts never see `S'` directly: they call the\n/// registry's private surface, which silos `S'` against the calling contract's address and hands back the app-siloed\n/// `Field`.\n#[derive(Deserialize, Eq, Packable, Serialize)]\n#[note]\npub struct HandshakeNote {\n /// The shared-secret point, with the forgery protection applied so it is specific to this handshake and a\n /// recipient cannot forge a colliding secret (see\n /// [`protect_from_forgery`](aztec::messages::delivery::handshake::protect_from_forgery)). Only this\n /// module reads it, for siloing, and it is never returned by an external function.\n secret: EmbeddedCurvePoint,\n /// A sender-only random secret, generated by the sender when the handshake is created. Folded into\n /// constrained-delivery nullifiers so only the sender can advance a sequence; the recipient never sees it, as it\n /// is stored only in the sender's note and never transmitted. It leaves the registry only via\n /// [`HandshakeNote::nullifier_secret_for`], never unsiloed.\n sender_secret: Field,\n}\n\nimpl HandshakeNote {\n pub(crate) fn new(shared_secret: EmbeddedCurvePoint, sender_secret: Field) -> Self {\n Self { secret: shared_secret, sender_secret }\n }\n\n /// Returns the [app-siloed handshake secrets][AppSiloedHandshakeSecrets] for `caller`: the shared secret (via\n /// aztec-nr's canonical [`compute_app_siloed_shared_secret`]) and the sender-only secret folded into\n /// constrained-delivery nullifiers so only the sender can advance a sequence. Both are siloed to `caller`, so a\n /// different caller receives different values for the same note; the raw `S` and `sender_secret` never leave the\n /// registry. The recipient cannot derive the sender-only secret: `sender_secret` is random, known only to the\n /// sender, and never transmitted.\n pub(crate) fn app_siloed_secrets_for(self, caller: AztecAddress) -> AppSiloedHandshakeSecrets {\n AppSiloedHandshakeSecrets {\n shared: compute_app_siloed_shared_secret(self.secret, caller),\n sender_only: poseidon2_hash_with_separator(\n [self.sender_secret, caller.to_field()],\n DOM_SEP__CONSTRAINED_MSG_SENDER_SECRET,\n ),\n }\n }\n}\n" }, "52": { "function_locations": [ { "name": "HandshakeRegistry::non_interactive_handshake", "start": 4764 }, { "name": "HandshakeRegistry::interactive_handshake", "start": 6795 }, { "name": "HandshakeRegistry::validate_handshake", "start": 7612 }, { "name": "HandshakeRegistry::get_app_siloed_secrets", "start": 9249 }, { "name": "HandshakeRegistry::get_non_interactive_handshakes", "start": 10455 }, { "name": "HandshakeRegistry::_generate_shared_secret", "start": 11532 }, { "name": "HandshakeRegistry::_store", "start": 12285 }, { "name": "HandshakeRegistry::_request_and_verify_signature", "start": 14438 } ], "path": "/home/nventuro/pkg-1/noir-projects/noir-contracts/contracts/standard/handshake_registry_contract/src/main.nr", "source": "use aztec::macros::aztec;\nmod handshake_note;\nmod recipient_signature;\nmod sync;\nmod test;\n\nuse sync::handshake_registry_sync;\n\n/// Registry for the message-delivery handshake protocol.\n///\n/// The registry establishes a master shared-secret point `S` between a sender and a recipient and stores one current\n/// note for each `(recipient, sender)` pair. `S` is independent of delivery mode: the recipient should derive\n/// per-mode tags from it when scanning, whether the delivery is constrained or unconstrained. The raw `S` never\n/// leaves the registry: app contracts call [`HandshakeRegistry::non_interactive_handshake`] to receive the secret\n/// already siloed to the caller, call [`HandshakeRegistry::get_app_siloed_secrets`] offchain for an existing\n/// handshake, and use [`HandshakeRegistry::validate_handshake`] to check app-siloed secrets against the current\n/// stored handshake. All of these functions silo the secrets they return or check to the calling contract\n/// (`msg_sender()`), so a contract can only obtain or validate secrets siloed to itself. Re-handshaking does not\n/// revoke already-started constrained-delivery sequences; it only replaces the registry note used for\n/// [validation][`HandshakeRegistry::validate_handshake`].\n///\n/// A handshake can be established two ways: [`HandshakeRegistry::non_interactive_handshake`], where the sender acts\n/// alone and announces the handshake in a log the recipient later discovers, and\n/// [`HandshakeRegistry::interactive_handshake`], which instead has the recipient sign the handshake at establishment\n/// time and emits no announcement (the recipient already learns `eph_pk` while signing). Both store the same note.\n#[aztec(::aztec::macros::AztecConfig::new().custom_sync_state(crate::handshake_registry_sync))]\npub contract HandshakeRegistry {\n use crate::{\n handshake_note::HandshakeNote, recipient_signature::RecipientSignature,\n sync::discovered_handshakes::get_all_discovered_handshakes,\n };\n use aztec::{\n keys::{ecdh_shared_secret::derive_ecdh_shared_secret, ephemeral::generate_positive_ephemeral_key_pair},\n macros::{functions::{external, internal}, storage::storage},\n messages::{\n delivery::{\n handshake::{AppSiloedHandshakeSecrets, HandshakePage, MAX_HANDSHAKES_PER_PAGE, protect_from_forgery},\n MessageDelivery,\n },\n encryption::{aes128::AES128, message_encryption::MessageEncryption},\n },\n oracle::{random::random, resolve_custom_request::resolve_custom_request},\n protocol::{\n address::AztecAddress,\n constants::DOM_SEP__NON_INTERACTIVE_HANDSHAKE_LOG_TAG,\n hash::{compute_log_tag, sha256_to_field},\n traits::{Deserialize, ToField},\n },\n state_vars::{Map, Owned, PrivateMutable},\n };\n use std::embedded_curve_ops::EmbeddedCurvePoint;\n\n /// Request kind the registry passes to\n /// [`resolve_custom_request`](aztec::oracle::resolve_custom_request::resolve_custom_request) to obtain a\n /// recipient's interactive-handshake signature.\n global INTERACTIVE_HANDSHAKE_REQUEST_KIND: Field = sha256_to_field(\n \"HANDSHAKE_REGISTRY::INTERACTIVE_HANDSHAKE_REQUEST\".as_bytes(),\n );\n\n #[storage]\n struct Storage {\n /// One current [`HandshakeNote`] per `(recipient, sender)` pair. Re-handshaking for the same pair\n /// replaces the registry note; [`HandshakeRegistry::validate_handshake`] accepts only the latest note.\n handshakes: Map, Context>, Context>,\n }\n\n /// Performs a non-interactive handshake from `sender` to `recipient`.\n ///\n /// Returns the [app-siloed handshake secrets][AppSiloedHandshakeSecrets] for the calling contract. The handshake\n /// establishes a single shared secret per `(recipient, sender)` pair, independent of delivery mode: the recipient\n /// should derive per-mode tags from it when scanning. The recipient does not participate; they discover the\n /// handshake later by scanning the log announced here. See [`HandshakeRegistry::interactive_handshake`] for the\n /// variant that requires the recipient to sign.\n ///\n /// The announcement reveals that the recipient was contacted: its log tag is derived from the recipient's\n /// address alone, so a non-recipient can at most learn that a handshake was done with the recipient, not who\n /// initiated it nor the contents of any message that follows.\n ///\n /// # Panics\n /// If `recipient` is not a valid curve point.\n #[external(\"private\")]\n fn non_interactive_handshake(sender: AztecAddress, recipient: AztecAddress) -> AppSiloedHandshakeSecrets {\n let (eph_pk, s_protected) = self.internal._generate_shared_secret(recipient);\n let secrets = self.internal._store(sender, recipient, s_protected);\n\n // Announce the handshake: an encrypted private log under the recipient-keyed tag carrying `[eph_pk.x]`, so\n // the recipient can discover the handshake by scanning their tag and recover the forgery-protected secret\n // `S'` by protecting `eph_pk` before its own ECDH (see aztec-nr's `forgery_protected_eph_pk`).\n let log_tag = compute_log_tag(\n recipient.to_field(),\n DOM_SEP__NON_INTERACTIVE_HANDSHAKE_LOG_TAG,\n );\n let ciphertext = AES128::encrypt([eph_pk.x], recipient, self.context.this_address());\n self.context.emit_private_log_unsafe(log_tag, BoundedVec::from_array(ciphertext));\n\n secrets\n }\n\n /// Performs an interactive handshake from `sender` to `recipient`.\n ///\n /// Returns the [app-siloed handshake secrets][AppSiloedHandshakeSecrets] for the calling contract. Like\n /// [`HandshakeRegistry::non_interactive_handshake`], but the recipient must authorize the handshake. The registry\n /// requests the recipient's signature over the freshly generated ephemeral key via\n /// [`resolve_custom_request`](aztec::oracle::resolve_custom_request::resolve_custom_request), and verifies it\n /// in-circuit (see [`HandshakeRegistry::_request_and_verify_signature`]). The signature commits only\n /// to the ephemeral key and chain context, never to `sender`, so the recipient authorizes the handshake without\n /// learning who initiated it. No announcement is emitted, since the recipient already learns `eph_pk` while\n /// signing.\n ///\n /// # Panics\n /// If `recipient` is not a valid curve point, if the returned public keys do not derive `recipient`'s address, or\n /// if the signature does not verify.\n #[external(\"private\")]\n fn interactive_handshake(sender: AztecAddress, recipient: AztecAddress) -> AppSiloedHandshakeSecrets {\n let (eph_pk, s_protected) = self.internal._generate_shared_secret(recipient);\n self.internal._request_and_verify_signature(recipient, eph_pk);\n self.internal._store(sender, recipient, s_protected)\n }\n\n /// Asserts that `secrets` match the stored handshake from `sender` to `recipient`, for the caller (`msg_sender()`).\n ///\n /// Apps that receive handshake secrets from an untrusted source call this once to validate those secrets\n /// against the registry's latest stored handshake.\n ///\n /// # Panics\n /// If no stored handshake for `(sender, recipient)` silos to the provided secrets under the calling contract's\n /// address.\n #[external(\"private\")]\n fn validate_handshake(sender: AztecAddress, recipient: AztecAddress, secrets: AppSiloedHandshakeSecrets) {\n let replacement_note_message = self.storage.handshakes.at(recipient).at(sender).get_note();\n let note = replacement_note_message.get_note();\n\n assert(note.app_siloed_secrets_for(self.msg_sender()) == secrets, \"no matching handshake\");\n\n // `PrivateMutable::get_note` proves the current note by nullifying and recreating it. Deliver the\n // replacement to the sender so later validation calls can prove the same current handshake again. As in\n // `_store`, the tag derivation is fixed to address-derived so the registry does not reference its own address\n // when re-tagging its own note.\n replacement_note_message.deliver(MessageDelivery::onchain_unconstrained().via_address_derived_secret());\n }\n\n /// Returns the app-siloed secrets for an existing handshake.\n ///\n /// This is the existing-handshake retrieval surface. It returns secrets siloed to `msg_sender`, never the raw `S`\n /// or the sender-only secret; a different caller receives different app-siloed values for the same registry note.\n /// Siloing by `self.msg_sender()` means a hostile contract cannot read another app's siloed secrets: whatever\n /// arguments a caller passes, it only ever learns values siloed to its own address. Contracts should still call\n /// [`HandshakeRegistry::validate_handshake`] when they need a constrained proof that supplied app-siloed secrets\n /// match the current handshake.\n #[external(\"utility\")]\n unconstrained fn get_app_siloed_secrets(\n sender: AztecAddress,\n recipient: AztecAddress,\n ) -> Option {\n let handshake = self.storage.handshakes.at(recipient).at(sender);\n\n if handshake.is_initialized() {\n let note = handshake.view_note();\n Option::some(note.app_siloed_secrets_for(self.msg_sender()))\n } else {\n Option::none()\n }\n }\n\n /// Returns a page of discovered non-interactive handshakes addressed to `recipient`.\n ///\n /// Only non-interactive handshakes appear here: they are the ones announced in a log the recipient's sync scan\n /// discovers.\n ///\n /// `total_count` is the full list length, so callers can determine whether more pages remain.\n ///\n /// # Privacy\n /// PXE authorizes this read for any calling contract without consulting the wallet's `authorizeUtilityCall`\n /// hook, so any contract executing for `recipient` can see that account's discovered handshakes: their count and\n /// their ephemeral public keys. This does not weaken message secrecy, as deriving the shared secret from an\n /// ephemeral key requires the recipient's secret keys.\n #[external(\"utility\")]\n unconstrained fn get_non_interactive_handshakes(recipient: AztecAddress, page_offset: u32) -> HandshakePage {\n let handshakes = get_all_discovered_handshakes(self.context.this_address(), recipient);\n let total_count = handshakes.len();\n let offset = std::cmp::min(page_offset, total_count);\n let page_len = std::cmp::min(MAX_HANDSHAKES_PER_PAGE, total_count - offset);\n\n let mut items = BoundedVec::new();\n for i in 0..page_len {\n items.push(handshakes.get(offset + i));\n }\n HandshakePage { items, total_count }\n }\n\n /// Generates the ephemeral key and shared secret for `recipient`.\n ///\n /// Returns `(eph_pk, s_protected)`: the ephemeral public key announced to the recipient, and the ECDH shared secret\n /// `S = eph_sk * recipient_point` with the forgery protection applied, so a recipient cannot forge a colliding\n /// handshake from the symmetric raw secret (see [`protect_from_forgery`]).\n ///\n /// # Panics\n /// If `recipient` is not a valid curve point.\n #[internal(\"private\")]\n fn _generate_shared_secret(recipient: AztecAddress) -> (EmbeddedCurvePoint, EmbeddedCurvePoint) {\n let recipient_point = recipient.to_address_point().expect(f\"recipient address is not on the curve\");\n\n let (eph_sk, eph_pk) = generate_positive_ephemeral_key_pair();\n let s_protected = protect_from_forgery(\n derive_ecdh_shared_secret(eph_sk, recipient_point.inner),\n eph_pk,\n recipient_point.inner,\n );\n (eph_pk, s_protected)\n }\n\n /// Inserts or replaces the current [`HandshakeNote`] owned by `sender` for `recipient` and returns the\n /// app-siloed secrets for the caller (`msg_sender()`).\n #[internal(\"private\")]\n fn _store(\n sender: AztecAddress,\n recipient: AztecAddress,\n s_protected: EmbeddedCurvePoint,\n ) -> AppSiloedHandshakeSecrets {\n // Safety: an uncooperative sender could pick a non-random value, but the sender-only secret only protects\n // the sender's own ability to advance their sequence, so a bad value only harms themselves. It is a fresh\n // random secret known only to the sender, which will be folded into constrained-delivery nullifiers.\n let sender_secret = unsafe { random() };\n let note = HandshakeNote::new(s_protected, sender_secret);\n\n // We deliver onchain unconstrained rather than offchain so the note is discoverable via normal PXE sync. This\n // is a self-send (the note is owned by and delivered to `sender`), so the wallet would resolve to an\n // address-derived secret anyway. Pinning that derivation here at compile time lets this contract, the\n // handshake registry itself, skip the default flow's runtime registry check, which would otherwise embed the\n // registry's own address in its bytecode and make its deploy address depend on itself.\n self.storage.handshakes.at(recipient).at(sender).initialize_or_replace(|_| note).deliver(\n MessageDelivery::onchain_unconstrained().with_sender(sender).via_address_derived_secret(),\n );\n\n note.app_siloed_secrets_for(self.msg_sender())\n }\n\n /// Requests and verifies the recipient's handshake authorization.\n ///\n /// Fetches the recipient's response through a\n /// [`resolve_custom_request`](aztec::oracle::resolve_custom_request::resolve_custom_request) oracle call. The\n /// request payload carries `recipient` plus the chain context and `eph_pk.x`; it never carries `sender`, so the\n /// recipient authorizes the handshake without learning who initiated it. The response deserializes into a\n /// [`RecipientSignature`], which contains all the data needed to verify the signature in-circuit.\n ///\n /// # Panics\n /// If the returned public keys do not derive `recipient`'s address, the signing key does not match, or the\n /// signature does not verify.\n #[internal(\"private\")]\n fn _request_and_verify_signature(recipient: AztecAddress, eph_pk: EmbeddedCurvePoint) {\n let payload = [recipient.to_field(), self.context.chain_id(), self.context.version(), eph_pk.x];\n // Safety: the response is unconstrained, but `RecipientSignature::verify` fully constrains it below: it binds\n // the returned public keys to the recipient's address and verifies the signature over an in-circuit message.\n let response = RecipientSignature::deserialize(\n unsafe { resolve_custom_request(INTERACTIVE_HANDSHAKE_REQUEST_KIND, payload) },\n );\n response.verify(\n recipient,\n self.context.chain_id(),\n self.context.version(),\n self.context.this_address(),\n eph_pk.x,\n );\n }\n}\n" }, "53": { "function_locations": [ { "name": "RecipientSignature::verify", "start": 2524 }, { "name": "test::interactive_signature_verifies_valid_fixture", "start": 4202 }, { "name": "test::interactive_signature_rejects_wrong_recipient", "start": 4542 }, { "name": "test::interactive_signature_rejects_wrong_signing_key", "start": 4976 }, { "name": "test::interactive_signature_rejects_off_curve_signing_key", "start": 5459 }, { "name": "test::interactive_signature_rejects_tampered_signature", "start": 5912 }, { "name": "test::interactive_signature_rejects_wrong_eph_pk", "start": 6284 }, { "name": "test::interactive_signature_rejects_wrong_registry", "start": 6620 }, { "name": "test::interactive_signature_rejects_wrong_chain_context", "start": 7043 }, { "name": "test::interactive_handshake_fixture", "start": 7578 } ], "path": "/home/nventuro/pkg-1/noir-projects/noir-contracts/contracts/standard/handshake_registry_contract/src/recipient_signature.nr", "source": "use aztec::{\n protocol::{\n address::{AztecAddress, PartialAddress},\n constants::DOM_SEP__INTERACTIVE_HANDSHAKE_SIGNATURE,\n hash::poseidon2_hash_with_separator,\n public_keys::{hash_public_key, PublicKeys},\n traits::{Deserialize, ToField},\n },\n utils::point::point_from_x_coord_and_sign,\n};\nuse std::embedded_curve_ops::EmbeddedCurveScalar;\n\n/// The recipient's signed authorization for an interactive handshake.\n///\n/// Returned by the interactive-handshake\n/// [`resolve_custom_request`](aztec::oracle::resolve_custom_request::resolve_custom_request) oracle call. It is how\n/// the sender asserts that the recipient received the ephemeral key correctly and will be able to receive messages\n/// properly, and it carries everything needed to verify that in-circuit.\n#[derive(Deserialize)]\npub struct RecipientSignature {\n /// The recipient's master public keys. With `partial_address` they derive the recipient's address, which is how\n /// [`verify`][Self::verify] binds them to `recipient`.\n pub public_keys: PublicKeys,\n /// The recipient's partial address, combined with `public_keys` to reproduce the recipient's address.\n pub partial_address: PartialAddress,\n /// The x-coordinate of the recipient's master message-signing public key. `PublicKeys` exposes this key only as\n /// its `mspk_m_hash`, so the point travels separately and is reconstructed on-curve, then tied back to that hash.\n pub mspk_x: Field,\n /// Whether that key's y-coordinate is positive, used to pick the correct y when reconstructing the point from\n /// `mspk_x`.\n pub mspk_y_is_positive: bool,\n /// The schnorr signature over the handshake message: its response scalar `s` and challenge `e`.\n pub signature: (EmbeddedCurveScalar, EmbeddedCurveScalar),\n}\n\nimpl RecipientSignature {\n /// Verifies that `recipient` authorized a handshake using ephemeral key `eph_pk.x` on this chain.\n ///\n /// # Panics\n /// If the returned public keys do not derive `recipient`'s address, `mspk_x` is not on the curve, the signing\n /// key does not match the address-committed `mspk_m_hash`, or the signature does not verify. Note that an\n /// off-curve `ivpk_m` fails inside the embedded-curve addition in [`AztecAddress::compute`] rather than with\n /// this method's error messages.\n pub fn verify(\n self,\n recipient: AztecAddress,\n chain_id: Field,\n version: Field,\n registry: AztecAddress,\n eph_pk_x: Field,\n ) {\n // Bind the returned keys to the recipient's address.\n assert_eq(\n recipient,\n AztecAddress::compute(self.public_keys, self.partial_address),\n \"handshake public keys do not match recipient\",\n );\n\n // Reconstruct the signing key on-curve and tie it to the authenticated hash.\n let mspk = point_from_x_coord_and_sign(self.mspk_x, self.mspk_y_is_positive).expect(\n f\"mspk_x is not a valid curve x-coordinate\",\n );\n assert(\n hash_public_key(mspk) == self.public_keys.mspk_m_hash,\n \"handshake signature key does not match recipient\",\n );\n\n // At this point `mspk` is proven to be the recipient's message-signing key, so a valid signature over the\n // recomputed message can only come from the recipient. The message commits to the ephemeral key and chain\n // context, never to the sender, so the recipient authorizes without learning who initiated it.\n let message = poseidon2_hash_with_separator(\n [chain_id, version, registry.to_field(), eph_pk_x],\n DOM_SEP__INTERACTIVE_HANDSHAKE_SIGNATURE,\n );\n assert(schnorr::verify_signature(mspk, self.signature, message), \"invalid recipient handshake signature\");\n }\n}\n\nmod test {\n use super::RecipientSignature;\n use aztec::protocol::{\n address::{AztecAddress, PartialAddress},\n point::EmbeddedCurvePoint,\n public_keys::{IvpkM, PublicKeys},\n traits::{FromField, ToField},\n };\n use std::embedded_curve_ops::EmbeddedCurveScalar;\n\n #[test]\n unconstrained fn interactive_signature_verifies_valid_fixture() {\n let (response, recipient, chain_id, version, registry, eph_pk_x) = interactive_handshake_fixture();\n response.verify(recipient, chain_id, version, registry, eph_pk_x);\n }\n\n #[test(should_fail_with = \"handshake public keys do not match recipient\")]\n unconstrained fn interactive_signature_rejects_wrong_recipient() {\n let (response, recipient, chain_id, version, registry, eph_pk_x) = interactive_handshake_fixture();\n let wrong_recipient = AztecAddress::from_field(recipient.to_field() + 1);\n response.verify(wrong_recipient, chain_id, version, registry, eph_pk_x);\n }\n\n #[test(should_fail_with = \"handshake signature key does not match recipient\")]\n unconstrained fn interactive_signature_rejects_wrong_signing_key() {\n let (mut response, recipient, chain_id, version, registry, eph_pk_x) = interactive_handshake_fixture();\n // x = 1 is the generator's x-coordinate: a valid curve point, but not the recipient's signing key.\n response.mspk_x = 1;\n response.verify(recipient, chain_id, version, registry, eph_pk_x);\n }\n\n #[test(should_fail_with = \"mspk_x is not a valid curve x-coordinate\")]\n unconstrained fn interactive_signature_rejects_off_curve_signing_key() {\n let (mut response, recipient, chain_id, version, registry, eph_pk_x) = interactive_handshake_fixture();\n // x = 3 is a non-residue for the curve, so no point has this x-coordinate.\n response.mspk_x = 3;\n response.verify(recipient, chain_id, version, registry, eph_pk_x);\n }\n\n #[test(should_fail_with = \"invalid recipient handshake signature\")]\n unconstrained fn interactive_signature_rejects_tampered_signature() {\n let (mut response, recipient, chain_id, version, registry, eph_pk_x) = interactive_handshake_fixture();\n response.signature.0.lo += 1;\n response.verify(recipient, chain_id, version, registry, eph_pk_x);\n }\n\n #[test(should_fail_with = \"invalid recipient handshake signature\")]\n unconstrained fn interactive_signature_rejects_wrong_eph_pk() {\n let (response, recipient, chain_id, version, registry, eph_pk_x) = interactive_handshake_fixture();\n response.verify(recipient, chain_id, version, registry, eph_pk_x + 1);\n }\n\n #[test(should_fail_with = \"invalid recipient handshake signature\")]\n unconstrained fn interactive_signature_rejects_wrong_registry() {\n let (response, recipient, chain_id, version, registry, eph_pk_x) = interactive_handshake_fixture();\n let wrong_registry = AztecAddress::from_field(registry.to_field() + 1);\n response.verify(recipient, chain_id, version, wrong_registry, eph_pk_x);\n }\n\n #[test(should_fail_with = \"invalid recipient handshake signature\")]\n unconstrained fn interactive_signature_rejects_wrong_chain_context() {\n let (response, recipient, chain_id, version, registry, eph_pk_x) = interactive_handshake_fixture();\n response.verify(recipient, chain_id + 1, version, registry, eph_pk_x);\n }\n\n // A real interactive-handshake response fixture generated offline: recipient keys, partial address,\n // message-signing key, and a genuine schnorr signature over `[chain_id, version, registry, eph_pk_x]`.\n unconstrained fn interactive_handshake_fixture() -> (RecipientSignature, AztecAddress, Field, Field, AztecAddress, Field) {\n let public_keys = PublicKeys {\n npk_m_hash: 0x1b6146272d5dcb12676fa83f74475545fee7e36b4cb93e0e1ae4b2098f442de2,\n ivpk_m: IvpkM {\n inner: EmbeddedCurvePoint {\n x: 0x03e89026e063059e6069e82a81a3e16d28f94a900ed08dadbd8407bf472d16c4,\n y: 0x0c8a8b9ab39ea7563eb22a85905408a061e09bde12ff788a84e772b3e6af2130,\n },\n },\n ovpk_m_hash: 0x279e44ade5739fdbdb91ea20489a20183fd6f38ddefafff8748bcfd8f72ad195,\n tpk_m_hash: 0x124b66b8152df6debefebd7561f43ad0179f908b3b7b573963efb1685c80b0fc,\n mspk_m_hash: 0x0e5480b4d52b9630b06e8d0e2ca8932457099274d522bb8ea6a60c1d7da871bf,\n fbpk_m_hash: 0x26dbd06da054ead46dcf2232ac07be3ab5839d8287ac0f4ed69f62eb7ffaa2d0,\n };\n let response = RecipientSignature {\n public_keys,\n partial_address: PartialAddress::from_field(0x0fedcba987654321),\n mspk_x: 0x22d507026547e1bd19b507a234a689833ab1604c00ff093574c44aea7176cfd5,\n mspk_y_is_positive: true,\n signature: (\n EmbeddedCurveScalar { lo: 0xd88c1b23cafce3c85432b3393c8f1975, hi: 0x04f3972857d4b92ef44c2ea1d15e6abb },\n EmbeddedCurveScalar { lo: 0x01b6f5567970c74d567270c239f235ab, hi: 0x0db0cf5e2cfba9c07df49a357b6dcb2c },\n ),\n };\n let recipient = AztecAddress::from_field(\n 0x1b94108a8172e103629879215c11f224522aa1bd0e4d50505c041c500f82d15b,\n );\n let chain_id = 0x7a69;\n let version = 1;\n let registry = AztecAddress::from_field(0x0abcabcabcabcabc);\n let eph_pk_x = 0x2468ace2468ace;\n (response, recipient, chain_id, version, registry, eph_pk_x)\n }\n}\n" }, "54": { "function_locations": [ { "name": "SyncCursor::at", "start": 958 }, { "name": "SyncCursor::next_block_to_scan", "start": 1344 }, { "name": "SyncCursor::advance", "start": 1754 }, { "name": "SyncCursor::clear", "start": 2165 }, { "name": "SyncCursor::register", "start": 2411 } ], "path": "/home/nventuro/pkg-1/noir-projects/noir-contracts/contracts/standard/handshake_registry_contract/src/sync/cursor.nr", "source": "use crate::sync::rewindable_register::RewindableRegister;\nuse aztec::{\n facts::{delete_fact_collection, OriginBlock},\n protocol::{abis::block_header::BlockHeader, address::AztecAddress, hash::sha256_to_field, traits::Hash},\n};\n\n/// Fact-collection type id of the per-recipient sync cursor: a [`RewindableRegister`] holding the anchor block of\n/// the last completed scan.\nglobal SYNC_CURSOR_TYPE_ID: Field = sha256_to_field(\"HANDSHAKE_REGISTRY::SYNC_CURSOR\".as_bytes());\n\n/// Collection id of the singleton cursor register.\nglobal SYNC_CURSOR_COLLECTION_ID: Field = 0;\n\n/// Reorg-aware cursor tracking the last scanned anchor block of a recipient's handshake sync.\npub(crate) struct SyncCursor {\n contract_address: AztecAddress,\n scope: AztecAddress,\n}\n\nimpl SyncCursor {\n /// Returns the cursor of `scope`'s handshake sync in the given contract.\n pub(crate) unconstrained fn at(contract_address: AztecAddress, scope: AztecAddress) -> Self {\n Self { contract_address, scope }\n }\n\n /// Returns the first block the next scan must cover, or `None` to scan from genesis.\n ///\n /// The next scan starts one past the last completed scan's anchor block. `None` means no scan ever completed, or\n /// a reorg rolled back every recorded one.\n pub(crate) unconstrained fn next_block_to_scan(self) -> Option {\n self.register().read().map(|anchor| anchor + 1)\n }\n\n /// Records a completed scan up to the given anchor block.\n ///\n /// The cursor originates at the scanned anchor block itself, so a reorg pruning that block rolls the cursor back\n /// to the last surviving scan and the pruned range gets covered again.\n pub(crate) unconstrained fn advance(self, anchor_block_header: BlockHeader) {\n self.register().write(\n anchor_block_header.block_number(),\n OriginBlock { block_number: anchor_block_header.block_number(), block_hash: anchor_block_header.hash() },\n );\n }\n\n /// Forgets every recorded scan, as if no sync had ever completed. Only used by tests, to emulate a reorg\n /// retracting every recorded scan.\n pub(crate) unconstrained fn clear(self) {\n delete_fact_collection(\n self.contract_address,\n self.scope,\n SYNC_CURSOR_TYPE_ID,\n SYNC_CURSOR_COLLECTION_ID,\n );\n }\n\n unconstrained fn register(self) -> RewindableRegister {\n RewindableRegister::at(\n self.contract_address,\n self.scope,\n SYNC_CURSOR_TYPE_ID,\n SYNC_CURSOR_COLLECTION_ID,\n )\n }\n}\n" }, "55": { "function_locations": [ { "name": "record_discovered_handshake", "start": 1608 }, { "name": "get_all_discovered_handshakes", "start": 2326 }, { "name": "origin_block_numbers", "start": 2946 } ], "path": "/home/nventuro/pkg-1/noir-projects/noir-contracts/contracts/standard/handshake_registry_contract/src/sync/discovered_handshakes.nr", "source": "use crate::sync::rewindable_register::{deserialize_payload, serialize_payload};\nuse aztec::{\n ephemeral::EphemeralArray,\n facts::{get_fact_collection, OriginBlock, record_retractable_fact},\n messages::delivery::handshake::DiscoveredHandshake,\n protocol::{address::AztecAddress, hash::sha256_to_field},\n};\n\n/// Fact-collection type id of the per-recipient discovered handshakes populated by [`record_discovered_handshake`]\n/// and read by [`get_all_discovered_handshakes`]. Each recipient (the fact scope) has a single collection of this\n/// type holding one fact per discovered handshake, in discovery order.\nglobal DISCOVERED_HANDSHAKES_TYPE_ID: Field = sha256_to_field(\"HANDSHAKE_REGISTRY::DISCOVERED_HANDSHAKES\".as_bytes());\n\n/// Collection id of the singleton discovered-handshakes collection.\nglobal DISCOVERED_HANDSHAKES_COLLECTION_ID: Field = 0;\n\n/// Fact type id of the fact storing a serialized [`DiscoveredHandshake`] inside the discovered-handshakes collection.\nglobal HANDSHAKE_DISCOVERED: Field = sha256_to_field(\"HANDSHAKE_REGISTRY::HANDSHAKE_DISCOVERED\".as_bytes());\n\n/// Records a discovered handshake for `recipient`.\n///\n/// The handshake originates at the block its announcement log landed in, so a reorg pruning that block makes the\n/// handshake invisible again. Fact identity covers the payload and origin block, so re-recording the same handshake\n/// at the same origin is a no-op.\npub(crate) unconstrained fn record_discovered_handshake(\n contract_address: AztecAddress,\n recipient: AztecAddress,\n handshake: DiscoveredHandshake,\n origin_block: OriginBlock,\n) {\n record_retractable_fact(\n contract_address,\n recipient,\n DISCOVERED_HANDSHAKES_TYPE_ID,\n DISCOVERED_HANDSHAKES_COLLECTION_ID,\n HANDSHAKE_DISCOVERED,\n serialize_payload(handshake),\n origin_block,\n );\n}\n\n/// Returns the discovered handshakes for `recipient`; only non-interactive handshakes are ever discovered.\n///\n/// The order of facts within a collection is not specified, but it is stable, keeping\n/// [`HandshakeRegistry::get_non_interactive_handshakes`] pagination consistent across pages.\npub(crate) unconstrained fn get_all_discovered_handshakes(\n contract_address: AztecAddress,\n recipient: AztecAddress,\n) -> EphemeralArray {\n get_fact_collection(\n contract_address,\n recipient,\n DISCOVERED_HANDSHAKES_TYPE_ID,\n DISCOVERED_HANDSHAKES_COLLECTION_ID,\n )\n .map_or(EphemeralArray::empty(), |collection| collection.facts.map(|fact| deserialize_payload(fact.payload)))\n}\n\n/// Returns the origin block number of each of `recipient`'s discovered handshakes. Only used by tests, to assert\n/// that handshake facts originate at the log's block rather than the sync anchor.\npub(crate) unconstrained fn origin_block_numbers(\n contract_address: AztecAddress,\n recipient: AztecAddress,\n) -> EphemeralArray {\n get_fact_collection(\n contract_address,\n recipient,\n DISCOVERED_HANDSHAKES_TYPE_ID,\n DISCOVERED_HANDSHAKES_COLLECTION_ID,\n )\n .map_or(EphemeralArray::empty(), |collection| {\n collection.facts.map(|fact| fact.origin_block.unwrap().block_number)\n })\n}\n" }, "56": { "function_locations": [ { "name": "handshake_registry_sync", "start": 2352 }, { "name": "get_handshake_logs_in_range", "start": 4440 } ], "path": "/home/nventuro/pkg-1/noir-projects/noir-contracts/contracts/standard/handshake_registry_contract/src/sync/mod.nr", "source": "pub(crate) mod cursor;\npub(crate) mod discovered_handshakes;\npub(crate) mod rewindable_register;\n\nuse crate::sync::{cursor::SyncCursor, discovered_handshakes::record_discovered_handshake};\nuse aztec::{\n context::UtilityContext,\n ephemeral::EphemeralArray,\n facts::OriginBlock,\n messages::{\n delivery::handshake::DiscoveredHandshake,\n discovery::{\n ComputeNoteHash, ComputeNoteNullifier, CustomMessageHandler, do_sync_state_without_handshake_discovery,\n },\n encryption::{aes128::AES128, message_encryption::MessageEncryption},\n processing::{\n log_retrieval_request::{LogRetrievalRequest, LogSource},\n log_retrieval_response::LogRetrievalResponse,\n offchain::OffchainInboxSync,\n },\n },\n oracle::message_processing,\n protocol::{\n address::AztecAddress,\n constants::DOM_SEP__NON_INTERACTIVE_HANDSHAKE_LOG_TAG,\n hash::{compute_log_tag, sha256_to_field},\n traits::ToField,\n },\n utils::point::point_from_x_coord_and_sign,\n};\n\n/// Ephemeral-array slot used by [`get_handshake_logs_in_range`] to batch a single log-retrieval request to the oracle.\nglobal LOG_RETRIEVAL_REQUEST_ARRAY_SLOT: Field =\n sha256_to_field(\"HANDSHAKE_REGISTRY::LOG_RETRIEVAL_REQUEST_ARRAY\".as_bytes());\n\n/// Discovers non-interactive handshakes addressed to the syncing account.\n///\n/// On every sync, scans the recipient-keyed bootstrap tag over the blocks mined since the previous sync, decrypts\n/// each matching log to recover the handshake `eph_pk`, and records it as a retractable fact whose origin is the block\n/// the log landed in, so a reorg pruning that block makes the handshake invisible again. It then falls through to\n/// [`do_sync_state`] so that normal note/event/partial-note discovery still happens.\n///\n/// `scope` is the account PXE is syncing for, which doubles as both the recipient whose tag we scan and the fact\n/// scope we persist under, so handshakes for one account never leak into another's list.\npub(crate) unconstrained fn handshake_registry_sync(\n contract_address: AztecAddress,\n compute_note_hash: ComputeNoteHash,\n compute_note_nullifier: ComputeNoteNullifier,\n process_custom_message: Option,\n offchain_inbox_sync: Option,\n scope: AztecAddress,\n) {\n let cursor = SyncCursor::at(contract_address, scope);\n let from_block = cursor.next_block_to_scan();\n let anchor_block_header = UtilityContext::new().block_header();\n let anchor_block = anchor_block_header.block_number();\n\n // `to_block` is exclusive, so we add 1 to include the anchor block in the scan\n let next_block = anchor_block + 1;\n let should_scan = from_block.map(|b| b != next_block).unwrap_or(true);\n if should_scan {\n // Find all handshakes for the given recipient\n let tag = compute_log_tag(scope.to_field(), DOM_SEP__NON_INTERACTIVE_HANDSHAKE_LOG_TAG);\n let logs = get_handshake_logs_in_range(contract_address, tag, from_block, Option::some(next_block));\n\n // Record all valid handshakes\n logs.for_each(|_i, log| {\n let ciphertext = aztec::utils::array::subbvec(log.log_payload, 0);\n\n let _ = AES128::decrypt(ciphertext, scope, contract_address)\n .and_then(|pt| {\n point_from_x_coord_and_sign(pt.get(0), true).map(|pk| DiscoveredHandshake { eph_pk: pk })\n })\n .map(|h| record_discovered_handshake(\n contract_address,\n scope,\n h,\n OriginBlock { block_number: log.block_number, block_hash: log.block_hash },\n ));\n });\n\n cursor.advance(anchor_block_header);\n }\n\n do_sync_state_without_handshake_discovery(\n contract_address,\n compute_note_hash,\n compute_note_nullifier,\n process_custom_message,\n offchain_inbox_sync,\n scope,\n );\n}\n\n/// Fetches all private logs emitted under `tag` in the block range `[from_block, to_block)`.\n///\n/// Thin wrapper around [`message_processing::get_logs_by_tag`] that batches a single request and unwraps the single\n/// matching response array.\nunconstrained fn get_handshake_logs_in_range(\n contract_address: AztecAddress,\n tag: Field,\n from_block: Option,\n to_block: Option,\n) -> EphemeralArray {\n let requests = EphemeralArray::empty_at(LOG_RETRIEVAL_REQUEST_ARRAY_SLOT);\n requests.push(\n LogRetrievalRequest {\n contract_address,\n unsiloed_tag: tag,\n source: LogSource.PRIVATE,\n from_block: from_block.map(|b| b as Field),\n to_block: to_block.map(|b| b as Field),\n },\n );\n\n message_processing::get_logs_by_tag(requests).get(0)\n}\n" }, "57": { "function_locations": [ { "name": "RewindableRegister::at", "start": 1786 }, { "name": "RewindableRegister::read", "start": 2106 }, { "name": "RewindableRegister::write", "start": 3001 }, { "name": "RewindableRegister::versions", "start": 3605 }, { "name": "RewindableRegister::compact", "start": 4189 }, { "name": "RewindableRegister::record_version", "start": 5315 }, { "name": "current_version", "start": 5723 }, { "name": "has_versions_behind", "start": 6266 }, { "name": "newest_finalized_block_number", "start": 6513 }, { "name": "serialize_payload", "start": 7098 }, { "name": "deserialize_payload", "start": 7513 }, { "name": "test::setup", "start": 8146 }, { "name": "test::register_at", "start": 8385 }, { "name": "test::unwritten_register_reads_none", "start": 8539 }, { "name": "test::reads_back_written_value", "start": 8814 }, { "name": "test::newest_origin_wins", "start": 9225 }, { "name": "test::write_behind_the_current_version_panics", "start": 9812 }, { "name": "test::rewriting_at_the_current_origin_is_a_no_op", "start": 10289 }, { "name": "test::pending_versions_are_kept", "start": 10937 }, { "name": "test::collapses_history_behind_newest_finalized_version", "start": 11837 } ], "path": "/home/nventuro/pkg-1/noir-projects/noir-contracts/contracts/standard/handshake_registry_contract/src/sync/rewindable_register.nr", "source": "use aztec::{\n ephemeral::EphemeralArray,\n facts::{delete_fact_collection, Fact, FactCollection, get_fact_collection, OriginBlock, record_retractable_fact},\n protocol::{address::AztecAddress, hash::sha256_to_field, traits::{Deserialize, Serialize}},\n};\n\n/// Fact type id of a register version. Registers are distinguished by their collection type and id, so all of them\n/// share a single fact type.\nglobal REWINDABLE_REGISTER_VALUE: Field = sha256_to_field(\"HANDSHAKE_REGISTRY::REWINDABLE_REGISTER_VALUE\".as_bytes());\n\n/// A reorg-aware mutable value.\n///\n/// Each mutation performed on a `RewindableRegister` is conditional to a given block existing. When, due to a\n/// reorg, the block a mutation is tied to drops out of the chain, the register is transparently rolled back to its\n/// pre-mutation value.\npub(crate) struct RewindableRegister {\n contract_address: AztecAddress,\n scope: AztecAddress,\n fact_collection_type_id: Field,\n fact_collection_id: Field,\n}\n\n// Mutation is modeled as versioning over immutable retractable facts: every write records a new fact originated at\n// a block, and reads select the version with the highest surviving origin. A reorg retracts exactly the versions\n// from pruned blocks, so rollback is performed by the store, never by the writer. Versions originated at or before\n// the finalized tip can never be retracted, making anything older than the newest finalized version unreachable, so\n// writes compact that dead history away.\nimpl RewindableRegister {\n /// Returns the register stored in the given fact collection.\n pub(crate) unconstrained fn at(\n contract_address: AztecAddress,\n scope: AztecAddress,\n fact_collection_type_id: Field,\n fact_collection_id: Field,\n ) -> Self {\n Self { contract_address, scope, fact_collection_type_id, fact_collection_id }\n }\n\n /// Returns the current value.\n ///\n /// Returns `None` if nothing was ever written, or a reorg rolled back every write.\n pub(crate) unconstrained fn read(self) -> Option\n where\n T: Deserialize,\n {\n self.versions().map(|versions| deserialize_payload(current_version(versions).payload))\n }\n\n /// Sets a new value for this register, conditional to the given `origin_block`.\n ///\n /// If a reorg drops `origin_block`, the write is rolled back and the previous value becomes current again. Also\n /// compacts history that finality has made unreachable.\n ///\n /// # Panics\n /// If `origin_block` is strictly behind the current version's origin: the current version is the one with the\n /// highest origin block, not the most recently written, so a write originating behind it would not take effect.\n /// Re-writing at the current version's origin is allowed: re-recording an identical fact is a no-op, which\n /// keeps rescans idempotent.\n pub(crate) unconstrained fn write(self, value: T, origin_block: OriginBlock)\n where\n T: Serialize,\n {\n let versions = self.versions();\n if versions.is_some() {\n let versions = versions.unwrap();\n assert(\n origin_block.block_number >= current_version(versions).origin_block.unwrap().block_number,\n \"RewindableRegister write originates behind the current version\",\n );\n self.compact(versions);\n }\n\n self.record_version(serialize_payload(value), origin_block);\n }\n\n /// Returns every surviving version, or `None` if there is none.\n unconstrained fn versions(self) -> Option> {\n get_fact_collection(\n self.contract_address,\n self.scope,\n self.fact_collection_type_id,\n self.fact_collection_id,\n )\n .map(|collection: FactCollection| collection.facts)\n }\n\n /// Discards versions that finality has made unreachable.\n ///\n /// Everything behind the newest finalized version can never become current again. The store has no per-fact\n /// deletion, so compacting means recreating the collection with the survivors.\n unconstrained fn compact(self, versions: EphemeralArray) {\n let maybe_newest_finalized = newest_finalized_block_number(versions);\n if maybe_newest_finalized.is_some() {\n let newest_finalized = maybe_newest_finalized.unwrap();\n if has_versions_behind(versions, newest_finalized) {\n delete_fact_collection(\n self.contract_address,\n self.scope,\n self.fact_collection_type_id,\n self.fact_collection_id,\n );\n versions.for_each(|_i, version| {\n let origin = version.origin_block.unwrap();\n if origin.block_number >= newest_finalized {\n self.record_version(\n version.payload,\n OriginBlock { block_number: origin.block_number, block_hash: origin.block_hash },\n );\n }\n });\n }\n }\n }\n\n /// Records a version fact at the given origin block.\n unconstrained fn record_version(self, payload: EphemeralArray, origin_block: OriginBlock) {\n record_retractable_fact(\n self.contract_address,\n self.scope,\n self.fact_collection_type_id,\n self.fact_collection_id,\n REWINDABLE_REGISTER_VALUE,\n payload,\n origin_block,\n );\n }\n}\n\n/// Returns the current version (highest origin block).\nunconstrained fn current_version(versions: EphemeralArray) -> Fact {\n // The store does not guarantee any ordering within a collection, so select the version explicitly.\n let mut current = versions.get(0);\n for i in 1..versions.len() {\n let version = versions.get(i);\n if version.origin_block.unwrap().block_number > current.origin_block.unwrap().block_number {\n current = version;\n }\n }\n current\n}\n\n/// Returns whether any version is strictly behind `block_number`.\nunconstrained fn has_versions_behind(versions: EphemeralArray, block_number: u32) -> bool {\n versions.any(|version| version.origin_block.unwrap().block_number < block_number)\n}\n\n/// Returns the newest finalized origin block number, if any.\nunconstrained fn newest_finalized_block_number(versions: EphemeralArray) -> Option {\n // The store does not guarantee any ordering within a collection, so select the version explicitly.\n let mut newest: Option = Option::none();\n for i in 0..versions.len() {\n let origin = versions.get(i).origin_block.unwrap();\n if origin.block_state.is_finalized() & newest.map_or(true, |n| origin.block_number > n) {\n newest = Option::some(origin.block_number);\n }\n }\n newest\n}\n\n/// Serializes a value into a fact payload.\npub(crate) unconstrained fn serialize_payload(value: T) -> EphemeralArray\nwhere\n T: Serialize,\n{\n let fields = value.serialize();\n let payload = EphemeralArray::empty();\n for i in 0..fields.len() {\n payload.push(fields[i]);\n }\n payload\n}\n\n/// Deserializes a fact payload into a value.\n///\n/// # Panics\n/// If the payload length does not match the value's serialized length.\npub(crate) unconstrained fn deserialize_payload(payload: EphemeralArray) -> T\nwhere\n T: Deserialize,\n{\n let n = ::N;\n assert_eq(payload.len(), n, \"Fact payload length does not match the value's serialized length\");\n let mut fields = [0; ::N];\n for i in 0..n {\n fields[i] = payload.get(i);\n }\n T::deserialize(fields)\n}\n\nmod test {\n use super::RewindableRegister;\n use aztec::facts::{get_fact_collection, OriginBlock};\n use aztec::protocol::address::AztecAddress;\n use aztec::test::helpers::test_environment::TestEnvironment;\n\n global TYPE_ID: Field = 4242;\n global COLLECTION_ID: Field = 7;\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 register_at(contract_address: AztecAddress, scope: AztecAddress) -> RewindableRegister {\n RewindableRegister::at(contract_address, scope, TYPE_ID, COLLECTION_ID)\n }\n\n #[test]\n unconstrained fn unwritten_register_reads_none() {\n let (env, scope) = setup();\n env.private_context(|context| {\n let register = register_at(context.this_address(), scope);\n assert(register.read().is_none());\n });\n }\n\n #[test]\n unconstrained fn reads_back_written_value() {\n let (env, scope) = setup();\n let block_number = env.last_block_number();\n env.private_context(|context| {\n let register = register_at(context.this_address(), scope);\n register.write(123, OriginBlock { block_number, block_hash: 0xabc });\n\n assert_eq(register.read().unwrap(), 123);\n });\n }\n\n #[test]\n unconstrained fn newest_origin_wins() {\n let (env, scope) = setup();\n let block_number = env.last_block_number();\n env.private_context(|context| {\n let register = register_at(context.this_address(), scope);\n register.write(1, OriginBlock { block_number, block_hash: 0xabc });\n register.write(2, OriginBlock { block_number: block_number + 50, block_hash: 0xdef });\n\n assert_eq(register.read().unwrap(), 2);\n });\n }\n\n #[test(should_fail_with = \"originates behind the current version\")]\n unconstrained fn write_behind_the_current_version_panics() {\n let (env, scope) = setup();\n let block_number = env.last_block_number();\n env.private_context(|context| {\n let register = register_at(context.this_address(), scope);\n register.write(1, OriginBlock { block_number: block_number + 50, block_hash: 0xabc });\n register.write(2, OriginBlock { block_number, block_hash: 0xdef });\n });\n }\n\n #[test]\n unconstrained fn rewriting_at_the_current_origin_is_a_no_op() {\n let (env, scope) = setup();\n let block_number = env.last_block_number();\n env.private_context(|context| {\n let register = register_at(context.this_address(), scope);\n register.write(1, OriginBlock { block_number, block_hash: 0xabc });\n register.write(1, OriginBlock { block_number, block_hash: 0xabc });\n\n assert_eq(register.read().unwrap(), 1);\n let facts = get_fact_collection(context.this_address(), scope, TYPE_ID, COLLECTION_ID).unwrap().facts;\n assert_eq(facts.len(), 1);\n });\n }\n\n #[test]\n unconstrained fn pending_versions_are_kept() {\n let (env, scope) = setup();\n let block_number = env.last_block_number();\n env.private_context(|context| {\n let register = register_at(context.this_address(), scope);\n register.write(1, OriginBlock { block_number, block_hash: 0xabc });\n register.write(2, OriginBlock { block_number: block_number + 50, block_hash: 0xdef });\n register.write(3, OriginBlock { block_number: block_number + 100, block_hash: 0x123 });\n\n // All origins are above the proven tip, hence pending: none is finalized dead history, so every version\n // is kept as a reorg fallback.\n let facts = get_fact_collection(context.this_address(), scope, TYPE_ID, COLLECTION_ID).unwrap().facts;\n assert_eq(facts.len(), 3);\n });\n }\n\n #[test]\n unconstrained fn collapses_history_behind_newest_finalized_version() {\n let (env, scope) = setup();\n env.mine_block();\n env.mine_block();\n let block_number = env.last_block_number();\n env.private_context(|context| {\n let register = register_at(context.this_address(), scope);\n register.write(1, OriginBlock { block_number: block_number - 2, block_hash: 0xabc });\n register.write(2, OriginBlock { block_number: block_number - 1, block_hash: 0xdef });\n register.write(3, OriginBlock { block_number, block_hash: 0x123 });\n\n // TXE finalizes every mined block, so all three origins are finalized and each write discards history\n // behind the newest finalized version, leaving the last two.\n let facts = get_fact_collection(context.this_address(), scope, TYPE_ID, COLLECTION_ID).unwrap().facts;\n assert_eq(facts.len(), 2);\n assert_eq(facts.get(0).origin_block.unwrap().block_number, block_number - 1);\n assert_eq(facts.get(1).origin_block.unwrap().block_number, block_number);\n\n assert_eq(register.read().unwrap(), 3);\n });\n }\n}\n" }, "6": { "function_locations": [ { "name": "BoundedVec::new", "start": 2304 }, { "name": "BoundedVec::get", "start": 2907 }, { "name": "BoundedVec::get_unchecked", "start": 3815 }, { "name": "BoundedVec::set", "start": 4398 }, { "name": "BoundedVec::set_unchecked", "start": 5926 }, { "name": "BoundedVec::push", "start": 6464 }, { "name": "BoundedVec::len", "start": 7072 }, { "name": "BoundedVec::max_len", "start": 7513 }, { "name": "BoundedVec::storage", "start": 8111 }, { "name": "BoundedVec::extend_from_array", "start": 8667 }, { "name": "BoundedVec::extend_from_vector", "start": 9438 }, { "name": "BoundedVec::extend_from_bounded_vec", "start": 10383 }, { "name": "BoundedVec::from_array", "start": 12778 }, { "name": "BoundedVec::pop", "start": 13521 }, { "name": "BoundedVec::any", "start": 14063 }, { "name": "BoundedVec::map", "start": 14979 }, { "name": "BoundedVec::mapi", "start": 15979 }, { "name": "BoundedVec::for_each", "start": 16937 }, { "name": "BoundedVec::for_eachi", "start": 17742 }, { "name": "BoundedVec::from_parts", "start": 18439 }, { "name": "BoundedVec::from_parts_unchecked", "start": 19903 }, { "name": ">::eq", "start": 20115 }, { "name": "unconstrained_eq", "start": 21039 }, { "name": " for BoundedVec>::from", "start": 21335 }, { "name": "bounded_vec_tests::get::panics_when_reading_elements_past_end_of_vec", "start": 21618 }, { "name": "bounded_vec_tests::get::panics_when_reading_beyond_length", "start": 21853 }, { "name": "bounded_vec_tests::get::get_works_within_bounds", "start": 22028 }, { "name": "bounded_vec_tests::get::get_unchecked_works", "start": 22287 }, { "name": "bounded_vec_tests::get::get_unchecked_works_past_len", "start": 22531 }, { "name": "bounded_vec_tests::set::set_updates_values_properly", "start": 22804 }, { "name": "bounded_vec_tests::set::panics_when_writing_elements_past_end_of_vec", "start": 23442 }, { "name": "bounded_vec_tests::set::panics_when_setting_beyond_length", "start": 23677 }, { "name": "bounded_vec_tests::set::set_unchecked_operations", "start": 23852 }, { "name": "bounded_vec_tests::set::set_unchecked_operations_past_len", "start": 24184 }, { "name": "bounded_vec_tests::set::set_preserves_other_elements", "start": 24448 }, { "name": "bounded_vec_tests::any::returns_false_if_predicate_not_satisfied", "start": 24995 }, { "name": "bounded_vec_tests::any::returns_true_if_predicate_satisfied", "start": 25279 }, { "name": "bounded_vec_tests::any::returns_false_on_empty_boundedvec", "start": 25528 }, { "name": "bounded_vec_tests::any::any_with_complex_predicates", "start": 25769 }, { "name": "bounded_vec_tests::any::any_with_partial_vector", "start": 26132 }, { "name": "bounded_vec_tests::map::applies_function_correctly", "start": 26598 }, { "name": "bounded_vec_tests::map::applies_function_that_changes_return_type", "start": 27020 }, { "name": "bounded_vec_tests::map::does_not_apply_function_past_len", "start": 27368 }, { "name": "bounded_vec_tests::map::map_with_conditional_logic", "start": 27741 }, { "name": "bounded_vec_tests::map::map_preserves_length", "start": 28065 }, { "name": "bounded_vec_tests::map::map_on_empty_vector", "start": 28357 }, { "name": "bounded_vec_tests::mapi::applies_function_correctly", "start": 28810 }, { "name": "bounded_vec_tests::mapi::applies_function_that_changes_return_type", "start": 29243 }, { "name": "bounded_vec_tests::mapi::does_not_apply_function_past_len", "start": 29600 }, { "name": "bounded_vec_tests::mapi::mapi_with_index_branching_logic", "start": 29982 }, { "name": "bounded_vec_tests::for_each::for_each_map", "start": 30590 }, { "name": "bounded_vec_tests::for_each::smoke_test", "start": 30850 }, { "name": "bounded_vec_tests::for_each::applies_function_correctly", "start": 31258 }, { "name": "bounded_vec_tests::for_each::applies_function_that_changes_return_type", "start": 31592 }, { "name": "bounded_vec_tests::for_each::does_not_apply_function_past_len", "start": 31950 }, { "name": "bounded_vec_tests::for_each::for_each_on_empty_vector", "start": 32331 }, { "name": "bounded_vec_tests::for_each::for_each_with_side_effects", "start": 32617 }, { "name": "bounded_vec_tests::for_eachi::for_eachi_mapi", "start": 33223 }, { "name": "bounded_vec_tests::for_eachi::smoke_test", "start": 33490 }, { "name": "bounded_vec_tests::for_eachi::applies_function_correctly", "start": 33946 }, { "name": "bounded_vec_tests::for_eachi::applies_function_that_changes_return_type", "start": 34290 }, { "name": "bounded_vec_tests::for_eachi::does_not_apply_function_past_len", "start": 34658 }, { "name": "bounded_vec_tests::for_eachi::for_eachi_on_empty_vector", "start": 35045 }, { "name": "bounded_vec_tests::for_eachi::for_eachi_with_index_tracking", "start": 35338 }, { "name": "bounded_vec_tests::from_array::empty", "start": 35815 }, { "name": "bounded_vec_tests::from_array::equal_len", "start": 36125 }, { "name": "bounded_vec_tests::from_array::max_len_greater_then_array_len", "start": 36442 }, { "name": "bounded_vec_tests::from_array::max_len_lower_then_array_len", "start": 36913 }, { "name": "bounded_vec_tests::from_array::from_array_preserves_order", "start": 37056 }, { "name": "bounded_vec_tests::from_array::from_array_with_different_types", "start": 37345 }, { "name": "bounded_vec_tests::trait_from::simple", "start": 37782 }, { "name": "bounded_vec_tests::trait_eq::empty_equality", "start": 38220 }, { "name": "bounded_vec_tests::trait_eq::equality", "start": 38467 }, { "name": "bounded_vec_tests::trait_eq::inequality", "start": 38791 }, { "name": "bounded_vec_tests::from_parts::from_parts", "start": 39330 }, { "name": "bounded_vec_tests::push_pop::push_and_pop_operations", "start": 40003 }, { "name": "bounded_vec_tests::push_pop::push_to_full_vector", "start": 40629 }, { "name": "bounded_vec_tests::push_pop::pop_from_empty_vector", "start": 40903 }, { "name": "bounded_vec_tests::push_pop::push_pop_cycle", "start": 41072 }, { "name": "bounded_vec_tests::extend::extend_from_array", "start": 41767 }, { "name": "bounded_vec_tests::extend::extend_from_vector", "start": 42113 }, { "name": "bounded_vec_tests::extend::extend_from_bounded_vec", "start": 42507 }, { "name": "bounded_vec_tests::extend::extend_from_bounded_vec_limit", "start": 43128 }, { "name": "bounded_vec_tests::extend::extend_from_bounded_vec_full_and_empty", "start": 43642 }, { "name": "bounded_vec_tests::extend::extend_from_bounded_vec_zero_len", "start": 44146 }, { "name": "bounded_vec_tests::extend::extend_from_bounded_vec_last_zeroed", "start": 44440 }, { "name": "bounded_vec_tests::extend::extend_from_bounded_vec_empty_self", "start": 44865 }, { "name": "bounded_vec_tests::extend::extend_from_bounded_vec_equal_capacity", "start": 45432 }, { "name": "bounded_vec_tests::extend::extend_array_beyond_max_len", "start": 46019 }, { "name": "bounded_vec_tests::extend::extend_vector_beyond_max_len", "start": 46297 }, { "name": "bounded_vec_tests::extend::extend_bounded_vec_beyond_max_len", "start": 46600 }, { "name": "bounded_vec_tests::extend::extend_with_empty_collections", "start": 46886 }, { "name": "bounded_vec_tests::storage::storage_consistency", "start": 47486 }, { "name": "bounded_vec_tests::storage::storage_after_pop", "start": 47988 }, { "name": "bounded_vec_tests::storage::vector_immutable", "start": 48310 } ], "path": "std/collections/bounded_vec.nr", "source": "use crate::{cmp::Eq, convert::From, runtime::is_unconstrained, static_assert};\n\n/// A `BoundedVec` 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` 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 = 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 {\n storage: [T; MaxLen],\n len: u32,\n}\n\nimpl BoundedVec {\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 = 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 {\n /// // Ok! MaxLen is specified with a type annotation\n /// let v1: BoundedVec = 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(v: BoundedVec) {\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(v: BoundedVec) -> 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(v: BoundedVec) {\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 = 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 = 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 = 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 = 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) -> 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 = 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 = 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(&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 = 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 = BoundedVec::new();\n /// let mut v2: BoundedVec = 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(&mut self, vec: BoundedVec) {\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 = BoundedVec::from_array([1, 2, 3])\n /// ```\n pub fn from_array(array: [T; Len]) -> Self {\n static_assert(Len <= MaxLen, \"from array out of bounds\");\n let mut vec: BoundedVec = 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 = 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 = 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(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 = 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(&self, f: fn[Env](T) -> U) -> BoundedVec {\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 = 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(&self, f: fn[Env](u32, T) -> U) -> BoundedVec {\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 = BoundedVec::from_array([1, 2, 3, 4]);\n /// let mut result = BoundedVec::::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(&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 = BoundedVec::from_array([1, 2, 3, 4]);\n /// let mut result = BoundedVec::::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(&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 = 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 = BoundedVec::from_parts_unchecked([1, 2, 3, 0], 3);\n /// assert_eq(vec.len(), 3);\n ///\n /// // invalid use!\n /// let vec1: BoundedVec = BoundedVec::from_parts_unchecked([1, 2, 3, 1], 3);\n /// let vec2: BoundedVec = 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 Eq for BoundedVec\nwhere\n T: Eq,\n{\n fn eq(self, other: BoundedVec) -> 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(\n a: BoundedVec,\n b: BoundedVec,\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 From<[T; Len]> for BoundedVec {\n fn from(array: [T; Len]) -> BoundedVec {\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 = 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 = 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 = 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 = 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 = 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 = 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 = 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 = 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 = 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 = 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 = 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 = 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 = 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 = 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 = 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 = 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 = BoundedVec::from_array([1, 2, 3, 4]);\n let result = vec.map(|value| (value * 2) as Field);\n let expected: BoundedVec = 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 = 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 = 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 = 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 = 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 = 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 = BoundedVec::from_array([1, 2, 3, 4]);\n let result = vec.mapi(|i, value| (i + value * 2) as Field);\n let expected: BoundedVec = 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 = 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 = 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(\n input: BoundedVec,\n f: fn[Env](T) -> U,\n ) -> BoundedVec {\n let mut output = BoundedVec::::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 = 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 = 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 = BoundedVec::from_array([1, 2, 3, 4]);\n let result = for_each_map(vec, |value| (value * 2) as Field);\n let expected: BoundedVec = 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 = 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 = 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 = BoundedVec::from_array([1, 2, 3]);\n let mut seen = BoundedVec::::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(\n input: BoundedVec,\n f: fn[Env](u32, T) -> U,\n ) -> BoundedVec {\n let mut output = BoundedVec::::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 = 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 = 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 = 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 = 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 = 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 = 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 = BoundedVec::from_array([10, 20, 30]);\n let mut indices = BoundedVec::::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 = 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 = 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 = 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 = 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 = 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 = BoundedVec::new();\n let bounded_vec2: BoundedVec = BoundedVec::new();\n\n assert_eq(bounded_vec1, bounded_vec2);\n }\n\n #[test]\n fn equality() {\n let mut bounded_vec1: BoundedVec = BoundedVec::new();\n let mut bounded_vec2: BoundedVec = 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 = BoundedVec::new();\n let mut bounded_vec2: BoundedVec = 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 = 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 = BoundedVec::from_parts([1, 2, 3, 1], 3);\n let vec2: BoundedVec = 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 = 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 = 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 = BoundedVec::new();\n let _ = vec.pop(); // should panic\n }\n\n #[test]\n fn push_pop_cycle() {\n let mut vec: BoundedVec = 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 = 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 = 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 = BoundedVec::new();\n let mut vec2: BoundedVec = 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 = BoundedVec::new();\n let mut vec2: BoundedVec = 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 = BoundedVec::new();\n let vec2: BoundedVec = 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 = BoundedVec::new();\n let vec2: BoundedVec = 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 = BoundedVec::new();\n let mut vec2: BoundedVec = 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 = BoundedVec::new();\n let vec2: BoundedVec = 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 = BoundedVec::new();\n vec1.push(1);\n let vec2: BoundedVec = 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 = 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 = 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 = BoundedVec::new();\n let other: BoundedVec = 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 = 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 = 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 = 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 = 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 = 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" }, "73": { "function_locations": [ { "name": "NoteExistenceRequest::for_pending", "start": 789 }, { "name": "NoteExistenceRequest::for_settled", "start": 1681 }, { "name": "NoteExistenceRequest::note_hash", "start": 1818 }, { "name": "NoteExistenceRequest::maybe_contract_address", "start": 1921 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/context/note_existence_request.nr", "source": "use crate::protocol::address::aztec_address::AztecAddress;\n\n/// A request to assert the existence of a note.\n///\n/// Used by [`crate::context::PrivateContext::assert_note_exists`].\npub struct NoteExistenceRequest {\n note_hash: Field,\n maybe_contract_address: Option,\n}\n\nimpl NoteExistenceRequest {\n /// Creates an existence request for a pending note.\n ///\n /// Pending notes have not been yet assigned a nonce, and they therefore have no unique note hash. Instead, these\n /// requests are created using the unsiloed note hash (i.e. from\n /// [`crate::note::note_interface::NoteHash::compute_note_hash`]) and address of the contract that created the\n /// note.\n pub fn for_pending(unsiloed_note_hash: Field, contract_address: AztecAddress) -> Self {\n // The kernel doesn't take options; it takes a note_hash and an address, and infers whether the request is\n // siloed based on whether the address is zero or non-zero. When passing the value to the kernel, we use\n // `maybe_addr.unwrap_or(Address::ZERO)`. Therefore, passing a zero address to `for_pending` is not allowed\n // since it would be interpreted by the kernel as a settled request.\n assert(!contract_address.is_zero(), \"Can't read a transient note with a zero contract address\");\n Self { note_hash: unsiloed_note_hash, maybe_contract_address: Option::some(contract_address) }\n }\n\n /// Creates an existence request for a settled note.\n ///\n /// Unlike pending notes, settled notes have a nonce, and their existence request is created using the unique note\n /// hash.\n pub fn for_settled(unique_note_hash: Field) -> Self {\n Self { note_hash: unique_note_hash, maybe_contract_address: Option::none() }\n }\n\n pub(crate) fn note_hash(self) -> Field {\n self.note_hash\n }\n\n pub(crate) fn maybe_contract_address(self) -> Option {\n self.maybe_contract_address\n }\n}\n" }, "75": { "function_locations": [ { "name": "PrivateContext::new", "start": 10151 }, { "name": "PrivateContext::maybe_msg_sender", "start": 12335 }, { "name": "PrivateContext::this_address", "start": 13042 }, { "name": "PrivateContext::chain_id", "start": 13547 }, { "name": "PrivateContext::version", "start": 14130 }, { "name": "PrivateContext::gas_settings", "start": 14683 }, { "name": "PrivateContext::selector", "start": 15726 }, { "name": "PrivateContext::is_static_call", "start": 16340 }, { "name": "PrivateContext::get_args_hash", "start": 17059 }, { "name": "PrivateContext::get_side_effect_counter", "start": 17587 }, { "name": "PrivateContext::push_note_hash", "start": 19265 }, { "name": "PrivateContext::push_nullifier_unsafe", "start": 20448 }, { "name": "PrivateContext::push_nullifier_for_note_hash", "start": 22246 }, { "name": "PrivateContext::get_anchor_block_header", "start": 23542 }, { "name": "PrivateContext::get_block_header_at", "start": 25603 }, { "name": "PrivateContext::set_return_hash", "start": 26032 }, { "name": "PrivateContext::finish", "start": 26527 }, { "name": "PrivateContext::set_as_fee_payer", "start": 29840 }, { "name": "PrivateContext::in_revertible_phase", "start": 30420 }, { "name": "PrivateContext::end_setup", "start": 32732 }, { "name": "PrivateContext::set_expiration_timestamp", "start": 35997 }, { "name": "PrivateContext::assert_note_exists", "start": 37392 }, { "name": "PrivateContext::assert_nullifier_exists", "start": 40028 }, { "name": "PrivateContext::request_nhk_app", "start": 42125 }, { "name": "PrivateContext::request_ovsk_app", "start": 43771 }, { "name": "PrivateContext::request_sk_app", "start": 45492 }, { "name": "PrivateContext::message_portal", "start": 48797 }, { "name": "PrivateContext::consume_l1_to_l2_message", "start": 50744 }, { "name": "PrivateContext::emit_private_log_unsafe", "start": 54863 }, { "name": "PrivateContext::emit_raw_note_log_unsafe", "start": 56320 }, { "name": "PrivateContext::emit_contract_class_log", "start": 56928 }, { "name": "PrivateContext::call_private_function", "start": 61487 }, { "name": "PrivateContext::static_call_private_function", "start": 62689 }, { "name": "PrivateContext::call_private_function_no_args", "start": 63704 }, { "name": "PrivateContext::static_call_private_function_no_args", "start": 64557 }, { "name": "PrivateContext::call_private_function_with_args_hash", "start": 65535 }, { "name": "PrivateContext::call_public_function", "start": 69434 }, { "name": "PrivateContext::static_call_public_function", "start": 70701 }, { "name": "PrivateContext::call_public_function_no_args", "start": 71720 }, { "name": "PrivateContext::static_call_public_function_no_args", "start": 72619 }, { "name": "PrivateContext::call_public_function_with_calldata_hash", "start": 73808 }, { "name": "PrivateContext::set_public_teardown_function", "start": 76336 }, { "name": "PrivateContext::set_public_teardown_function_with_calldata_hash", "start": 77607 }, { "name": "PrivateContext::next_counter", "start": 83011 }, { "name": "::empty", "start": 83180 } ], "path": "/home/nventuro/pkg-1/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>, MAX_NOTE_HASH_READ_REQUESTS_PER_CALL>,\n pub(crate) nullifier_read_requests: BoundedVec>, MAX_NULLIFIER_READ_REQUESTS_PER_CALL>,\n key_validation_requests_and_separators: BoundedVec,\n\n pub(crate) note_hashes: BoundedVec, MAX_NOTE_HASHES_PER_CALL>,\n pub(crate) nullifiers: BoundedVec, MAX_NULLIFIERS_PER_CALL>,\n\n pub(crate) private_call_requests: BoundedVec,\n public_call_requests: BoundedVec, MAX_ENQUEUED_CALLS_PER_CALL>,\n public_teardown_call_request: PublicCallRequest,\n l2_to_l1_msgs: BoundedVec, 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, MAX_PRIVATE_LOGS_PER_CALL>,\n contract_class_logs_hashes: BoundedVec, 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; 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` - The address of the smart contract that called this function (be it an app contract\n /// or a user's account contract). Returns `Option::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 {\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(&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(\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) {\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,\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(&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(\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(\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(\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(\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(\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" }, "78": { "function_locations": [ { "name": " for UtilityContext>::from", "start": 560 }, { "name": "UtilityContext::new", "start": 751 }, { "name": "UtilityContext::at", "start": 858 }, { "name": "UtilityContext::block_header", "start": 1230 }, { "name": "UtilityContext::block_number", "start": 1302 }, { "name": "UtilityContext::timestamp", "start": 1386 }, { "name": "UtilityContext::this_address", "start": 1479 }, { "name": "UtilityContext::maybe_msg_sender", "start": 2268 }, { "name": "UtilityContext::version", "start": 2472 }, { "name": "UtilityContext::chain_id", "start": 2552 }, { "name": "UtilityContext::raw_storage_read", "start": 2699 }, { "name": "UtilityContext::storage_read", "start": 2891 } ], "path": "/home/nventuro/pkg-1/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 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 {\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(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(self, storage_slot: Field) -> T\n where\n T: Packable,\n {\n T::unpack(self.raw_storage_read(storage_slot))\n }\n}\n" }, "79": { "function_locations": [ { "name": "ContractSelfPrivate::new", "start": 5863 }, { "name": "ContractSelfPrivate::msg_sender", "start": 6736 }, { "name": "ContractSelfPrivate::emit", "start": 8509 }, { "name": "ContractSelfPrivate::call", "start": 11583 }, { "name": "ContractSelfPrivate::view", "start": 12336 }, { "name": "ContractSelfPrivate::enqueue", "start": 13869 }, { "name": "ContractSelfPrivate::enqueue_view", "start": 14531 }, { "name": "ContractSelfPrivate::enqueue_incognito", "start": 16825 }, { "name": "ContractSelfPrivate::enqueue_view_incognito", "start": 17540 }, { "name": "ContractSelfPrivate::set_as_teardown", "start": 19340 }, { "name": "ContractSelfPrivate::set_as_teardown_incognito", "start": 19907 }, { "name": "PrivateUtilityCalls::call", "start": 22307 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/contract_self/contract_self_private.nr", "source": "//! The `self` contract value for private execution contexts.\n\nuse crate::{\n context::{calls::{PrivateCall, PrivateStaticCall, PublicCall, PublicStaticCall, UtilityCall}, PrivateContext},\n event::{event_emission::emit_event_in_private, event_interface::EventInterface, EventMessage},\n oracle::call_utility_function::call_utility_function,\n};\nuse crate::protocol::{address::AztecAddress, traits::{Deserialize, Serialize}};\n\n/// Core interface for interacting with aztec-nr contract features in private execution contexts.\n///\n/// This struct is automatically injected into every [`external`](crate::macros::functions::external) and\n/// [`internal`](crate::macros::functions::internal) contract function marked with `\"private\"` by the Aztec macro\n/// system and is accessible through the `self` variable.\n///\n/// ## Usage in Contract Functions\n///\n/// Once injected, you can use `self` to:\n/// - Access storage: `self.storage.balances.at(owner).read()`\n/// - Call contracts: `self.call(Token::at(address).transfer(recipient, amount))`\n/// - Emit events: `self.emit(event).deliver_to(recipient, delivery_mode)`\n/// - Get the contract address: `self.address`\n/// - Get the caller: `self.msg_sender()`\n/// - Access low-level Aztec.nr APIs through the context: `self.context`\n///\n/// ## Example\n///\n/// ```noir\n/// #[external(\"private\")]\n/// fn withdraw(amount: u128, recipient: AztecAddress) {\n/// // Get the caller of this function\n/// let sender = self.msg_sender();\n///\n/// // Access storage\n/// let token = self.storage.donation_token.get_note().get_address();\n///\n/// // Call contracts\n/// self.call(Token::at(token).transfer(recipient, amount));\n/// }\n/// ```\n///\n/// ## Type Parameters\n///\n/// - `Storage`: The contract's storage struct (defined with [`storage`](crate::macros::storage::storage), or `()` if\n/// the contract has no storage\n/// - `CallSelf`: Macro-generated type for calling contract's own non-view functions\n/// - `EnqueueSelf`: Macro-generated type for enqueuing calls to the contract's own non-view functions\n/// - `CallSelfStatic`: Macro-generated type for calling contract's own view functions\n/// - `EnqueueSelfStatic`: Macro-generated type for enqueuing calls to the contract's own view functions\n/// - `CallInternal`: Macro-generated type for calling internal functions\n/// - `CallSelfUtility`: Macro-generated type for calling the contract's own utility functions\npub struct ContractSelfPrivate {\n /// The address of this contract\n pub address: AztecAddress,\n\n /// The contract's storage instance, representing the struct to which the\n /// [`storage`](crate::macros::storage::storage) macro was applied in your contract. If the contract has no\n /// storage, the type of this will be `()`.\n ///\n /// This storage instance is specialized for the current execution context (private) and\n /// provides access to the contract's state variables.\n ///\n /// ## Developer Note\n ///\n /// If you've arrived here while trying to access your contract's storage while the `Storage` generic type is set\n /// to unit type `()`, it means you haven't yet defined a Storage struct using the\n /// [`storage`](crate::macros::storage::storage) macro in your contract. For guidance on setting this up, please\n /// refer to our docs: https://docs.aztec.network/developers/docs/guides/smart_contracts/storage\n pub storage: Storage,\n\n /// The private execution context.\n pub context: &mut PrivateContext,\n\n /// Provides type-safe methods for calling this contract's own non-view functions.\n ///\n /// Example API:\n /// ```noir\n /// self.call_self.some_private_function(args)\n /// ```\n pub call_self: CallSelf,\n\n /// Provides type-safe methods for enqueuing calls to this contract's own non-view functions.\n ///\n /// Example API:\n /// ```noir\n /// self.enqueue_self.some_public_function(args)\n /// ```\n pub enqueue_self: EnqueueSelf,\n\n /// Provides type-safe methods for calling this contract's own view functions.\n ///\n /// Example API:\n /// ```noir\n /// self.call_self_static.some_view_function(args)\n /// ```\n pub call_self_static: CallSelfStatic,\n\n /// Provides type-safe methods for enqueuing calls to the contract's own view functions.\n ///\n /// Example API:\n /// ```noir\n /// self.enqueue_self_static.some_public_view_function(args)\n /// ```\n pub enqueue_self_static: EnqueueSelfStatic,\n\n /// Provides type-safe methods for calling internal functions.\n ///\n /// Example API:\n /// ```noir\n /// self.internal.some_internal_function(args)\n /// ```\n pub internal: CallInternal,\n\n /// A struct that allows for ergonomic calling of utility functions from this private context.\n ///\n /// Example API:\n /// ```noir\n /// // Safety: result is unconstrained\n /// unsafe { self.utility.call(MyContract::at(address).my_utility_function(args)) }\n /// ```\n pub utility: PrivateUtilityCalls,\n}\n\nimpl ContractSelfPrivate {\n /// Creates a new `ContractSelfPrivate` instance for a private function.\n ///\n /// This constructor is called automatically by the macro system and should not be called directly.\n pub fn new(\n context: &mut PrivateContext,\n storage: Storage,\n call_self: CallSelf,\n enqueue_self: EnqueueSelf,\n call_self_static: CallSelfStatic,\n enqueue_self_static: EnqueueSelfStatic,\n internal: CallInternal,\n utility: PrivateUtilityCalls,\n ) -> Self {\n Self {\n context,\n storage,\n address: context.this_address(),\n call_self,\n enqueue_self,\n call_self_static,\n enqueue_self_static,\n internal,\n utility,\n }\n }\n\n /// The address of the contract address that made this function call.\n ///\n /// This is similar to Solidity's `msg.sender` value.\n ///\n /// ## Transaction Entrypoints\n ///\n /// As there are no EOAs (externally owned accounts) in Aztec, unlike on Ethereum, the first contract function\n /// executed in a transaction (i.e. transaction entrypoint) does **not** have a caller. This function panics when\n /// executed in such a context.\n ///\n /// If you need to handle these cases, use [`PrivateContext::maybe_msg_sender`].\n pub fn msg_sender(self) -> AztecAddress {\n self.context.maybe_msg_sender().unwrap()\n }\n\n /// Emits an event privately.\n ///\n /// Unlike public events, private events do not reveal their contents publicly. They instead create an\n /// [`EventMessage`] containing the private event information, which **MUST** be delivered to a recipient via\n /// [`EventMessage::deliver_to`] in order for them to learn about the event. Multiple recipients can have the same\n /// message be delivered to them.\n ///\n /// # Example\n /// ```noir\n /// #[event]\n /// struct Transfer { from: AztecAddress, to: AztecAddress, amount: u128 }\n ///\n /// #[external(\"private\")]\n /// fn transfer(to: AztecAddress, amount: u128) {\n /// let from = self.msg_sender();\n ///\n /// let message: EventMessage = self.emit(Transfer { from, to, amount });\n /// message.deliver_to(from, MessageDelivery::offchain());\n /// message.deliver_to(to, MessageDelivery::onchain_constrained());\n /// }\n /// ```\n ///\n /// # Cost\n ///\n /// Private event emission always results in the creation of a nullifer, which acts as a commitment to the event\n /// and is used by third parties to verify its authenticity. See [`EventMessage::deliver_to`] for the costs\n /// associated to delivery.\n ///\n /// # Privacy\n ///\n /// The nullifier created when emitting a private event leaks nothing about the content of the event - it's a\n /// commitment that includes a random value, so even with full knowledge of the event preimage determining if an\n /// event was emitted or not requires brute-forcing the entire `Field` space.\n pub fn emit(&mut self, event: Event) -> EventMessage\n where\n Event: EventInterface + Serialize,\n {\n emit_event_in_private(self.context, event)\n }\n\n /// Makes a private contract call.\n ///\n /// # Arguments\n /// * `call` - The object representing the private function to invoke.\n ///\n /// # Returns\n /// * `T` - Whatever data the called function has returned.\n ///\n /// # Example\n /// ```noir\n /// self.call(Token::at(address).transfer_in_private(recipient, amount));\n /// ```\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 (see\n /// https://github.com/AztecProtocol/aztec-packages/pull/16433)\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(&mut self, call: PrivateCall) -> T\n where\n T: Deserialize,\n {\n call.call(self.context)\n }\n\n /// Makes a read-only private contract call.\n ///\n /// This is similar to Solidity's `staticcall`. The called function cannot modify state, emit L2->L1 messages, nor\n /// emit events. Any nested calls are constrained to also be static calls.\n ///\n /// # Arguments\n /// * `call` - The object representing the read-only private function to invoke.\n ///\n /// # Returns\n /// * `T` - Whatever data the called function has returned.\n ///\n /// # Example\n /// ```noir\n /// self.view(Token::at(address).balance_of_private(recipient));\n /// ```\n pub fn view(&mut self, call: PrivateStaticCall) -> T\n where\n T: Deserialize,\n {\n call.view(self.context)\n }\n\n /// Enqueues a public contract call function.\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 /// * `call` - The interface representing the public function to enqueue.\n pub fn enqueue(&mut self, call: PublicCall) {\n call.enqueue(self.context)\n }\n\n /// Enqueues a read-only public contract call function.\n ///\n /// This is similar to Solidity's `staticcall`. The called function cannot modify state, emit L2->L1 messages, nor\n /// emit events. Any nested calls are constrained to also be static calls.\n ///\n /// # Arguments\n /// * `call` - The object representing the read-only public function to enqueue.\n ///\n /// # Example\n /// ```noir\n /// self.enqueue_view(MyContract::at(address).assert_timestamp_less_than(timestamp));\n /// ```\n pub fn enqueue_view(&mut self, call: PublicStaticCall) {\n call.enqueue_view(self.context)\n }\n\n /// Enqueues a privacy-preserving public contract call function.\n ///\n /// This is the same as [`ContractSelfPrivate::enqueue`], except it hides this calling contract's address from the\n /// target public function (i.e. [`ContractSelfPrivate::msg_sender`] will panic).\n ///\n /// This means the origin of the call (msg_sender) will not be publicly visible to any blockchain observers, nor to\n /// the target public function. If the target public function reads `self.msg_sender()` the call will revert.\n ///\n /// NOTES:\n /// - Not all public functions will accept a msg_sender of \"none\". Many public functions will require that\n /// msg_sender is \"some\" and will revert otherwise. Therefore, if using `enqueue_incognito`, you must understand\n /// whether the function you're calling will accept a msg_sender of \"none\". Lots of public bookkeeping patterns\n /// rely on knowing which address made the call, so as to ascribe state against the caller's address. (There are\n /// patterns whereby bookkeeping could instead be done in private-land).\n /// - If you are enqueueing a call to an _internal_ public function (i.e. a public function that will only accept\n /// calls from other functions of its own contract), then by definition a call to it cannot possibly be\n /// \"incognito\": the msg_sender must be its own address, and indeed the called public function will assert this.\n /// Tl;dr this is not usable for enqueued internal public calls.\n ///\n /// # Arguments\n /// * `call` - The object representing the public function to enqueue.\n ///\n /// # Example\n /// ```noir\n /// self.enqueue_incognito(Token::at(address).increase_total_supply_by(amount));\n /// ```\n ///\n /// Advanced:\n /// - The kernel circuits will permit _any_ private function to set the msg_sender field of any enqueued public\n /// function call to NULL_MSG_SENDER_CONTRACT_ADDRESS.\n /// - When the called public function calls `PublicContext::msg_sender()`, aztec-nr will translate\n /// NULL_MSG_SENDER_CONTRACT_ADDRESS into `Option::none` for familiarity to devs.\n ///\n pub fn enqueue_incognito(&mut self, call: PublicCall) {\n call.enqueue_incognito(self.context)\n }\n\n /// Enqueues a privacy-preserving read-only public contract call function.\n ///\n /// As per `enqueue_view`, but hides this calling contract's address from the target public function.\n ///\n /// See `enqueue_incognito` for more details relating to hiding msg_sender.\n ///\n /// # Arguments\n /// * `call` - The object representing the read-only public function to enqueue.\n ///\n /// # Example\n /// ```noir\n /// self.enqueue_view_incognito(MyContract::at(address).assert_timestamp_less_than(timestamp));\n /// ```\n ///\n pub fn enqueue_view_incognito(&mut self, call: PublicStaticCall) {\n call.enqueue_view_incognito(self.context)\n }\n\n /// Enqueues a call to the public function defined by the `call` parameter, and designates it to be the teardown\n /// function for this tx. Only one teardown 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 /// See `enqueue` for more information about enqueuing public function calls.\n ///\n /// # Arguments\n /// * `call` - The object representing the public function to designate as teardown.\n ///\n pub fn set_as_teardown(&mut self, call: PublicCall) {\n call.set_as_teardown(self.context)\n }\n\n /// Enqueues a call to the public function defined by the `call` parameter, and designates it to be the teardown\n /// function for this tx. Only one teardown function call can be made by a tx.\n ///\n /// As per `set_as_teardown`, but hides this calling contract's address from the target public function.\n ///\n /// See `enqueue_incognito` for more details relating to hiding msg_sender.\n ///\n pub fn set_as_teardown_incognito(&mut self, call: PublicCall) {\n call.set_as_teardown_incognito(self.context)\n }\n}\n\n/// A struct that allows for ergonomic calling of utility functions from a private context.\n///\n/// Accessible via `self.utility` in private functions. Results are not part of any circuit\n/// proof; use them to inform logic, not as inputs to constrained assertions.\n///\n/// ## Type Parameters\n///\n/// - `CallSelf`: Macro-generated type for calling the contract's own utility functions (same type\n/// as `CallSelf` in \\[`ContractSelfUtility`\\])\n// Implemented as a separate struct (rather than inlined in ContractSelfPrivate) because Noir does\n// not allow passing `&mut PrivateContext` (held by `ContractSelfPrivate`) into unconstrained code.\n// This struct holds no mutable references, so it can be passed freely into `unconstrained`\n// functions.\npub struct PrivateUtilityCalls {\n /// Provides type-safe methods for calling this contract's own utility functions.\n ///\n /// Example API:\n /// ```noir\n /// // Safety: result is unconstrained\n /// unsafe { self.utility.call_self.some_utility_function(args) }\n /// ```\n pub call_self: CallSelf,\n}\n\nimpl PrivateUtilityCalls {\n /// Makes a utility contract call from a private function.\n ///\n /// The call executes unconstrained code, so it must be wrapped in `unsafe`, and its result is not part of any\n /// circuit proof: use it to inform logic, never as an input to a constrained assertion without validating it\n /// first.\n ///\n /// The callee observes this contract's address as its `msg_sender`: see the `msg_sender` docs on\n /// [`ContractSelfUtility`](crate::contract_self::ContractSelfUtility).\n ///\n /// To call one of this contract's own utility functions, prefer the type-safe `self.utility.call_self` stubs.\n ///\n /// ## Authorization\n ///\n /// A call to this contract itself always succeeds. A call to a different contract can expose that contract's\n /// private state to the caller, so it requires explicit authorization. A call that is not authorized fails.\n ///\n /// # Example\n /// ```noir\n /// // Safety: result is unconstrained\n /// unsafe { self.utility.call(Token::at(address).get_balance_of(owner)) }\n /// ```\n pub unconstrained fn call(_self: Self, call: UtilityCall) -> T\n where\n T: Deserialize,\n {\n let returns = call_utility_function(call.target_contract, call.selector, call.args);\n Deserialize::deserialize(returns)\n }\n}\n" }, "81": { "function_locations": [ { "name": "ContractSelfUtility::new", "start": 2556 }, { "name": "ContractSelfUtility::msg_sender", "start": 3423 }, { "name": "ContractSelfUtility::call", "start": 4570 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/contract_self/contract_self_utility.nr", "source": "//! The `self` contract value for utility execution contexts.\n\nuse crate::context::{calls::UtilityCall, UtilityContext};\nuse crate::oracle::call_utility_function::call_utility_function;\nuse crate::protocol::{address::AztecAddress, traits::Deserialize};\n\n/// Core interface for interacting with aztec-nr contract features in utility execution contexts.\n///\n/// This struct is automatically injected into every [`external`](crate::macros::functions::external) contract function\n/// marked with `\"utility\"` by the Aztec macro system and is accessible through the `self` variable.\n///\n/// ## Type Parameters\n///\n/// - `Storage`: The contract's storage struct (defined with [`storage`](crate::macros::storage::storage), or `()` if\n/// the contract has no storage\n/// - `CallSelf`: Macro-generated type for calling the contract's own utility functions (same type\n/// as `CallSelf` in \\[`PrivateUtilityCalls`\\])\npub struct ContractSelfUtility {\n /// The address of this contract\n pub address: AztecAddress,\n\n /// The contract's storage instance, representing the struct to which the\n /// [`storage`](crate::macros::storage::storage) macro was applied in your contract. If the contract has no\n /// storage, the type of this will be `()`.\n ///\n /// This storage instance is specialized for the current execution context (utility) and\n /// provides access to the contract's state variables.\n ///\n /// ## Developer Note\n ///\n /// If you've arrived here while trying to access your contract's storage while the `Storage` generic type is set\n /// to unit type `()`, it means you haven't yet defined a Storage struct using the\n /// [`storage`](crate::macros::storage::storage) macro in your contract. For guidance on setting this up, please\n /// refer to our docs: https://docs.aztec.network/developers/docs/guides/smart_contracts/storage\n pub storage: Storage,\n\n /// The utility execution context.\n pub context: UtilityContext,\n\n /// Provides type-safe methods for calling this contract's own utility functions.\n ///\n /// Example API:\n /// ```noir\n /// self.call_self.some_utility_function(args)\n /// ```\n pub call_self: CallSelf,\n}\n\nimpl ContractSelfUtility {\n /// Creates a new `ContractSelfUtility` instance for a utility function.\n ///\n /// This constructor is called automatically by the macro system and should not be called directly.\n pub fn new(context: UtilityContext, storage: Storage, call_self: CallSelf) -> Self {\n Self { context, storage, address: context.this_address(), call_self }\n }\n\n /// The address of the contract that made this function call.\n ///\n /// This is similar to Solidity's `msg.sender` value.\n ///\n /// ## Direct Invocation\n ///\n /// A utility function invoked directly (e.g. by a wallet or dApp) rather than from another contract has no caller,\n /// and this function panics. Only a nested (cross-contract) utility call has a `msg_sender`.\n ///\n /// If you need to handle the no-caller case, use [`UtilityContext::maybe_msg_sender`].\n ///\n /// Note that utility functions are simulated client-side and never proven, so this value is unconstrained: see\n /// [`UtilityContext::maybe_msg_sender`] for why it must not be relied on as a security guarantee.\n pub unconstrained fn msg_sender(self) -> AztecAddress {\n self.context.maybe_msg_sender().expect(\n f\"msg_sender() called on a top-level utility with no caller; use maybe_msg_sender() instead\",\n )\n }\n\n /// Makes a utility contract call from another utility function.\n ///\n /// The call runs entirely offchain in PXE and is never proven, so no guarantees are made on the correctness of\n /// its result.\n ///\n /// The callee observes this contract's address as its `msg_sender`: see [`ContractSelfUtility::msg_sender`].\n ///\n /// To call one of this contract's own utility functions, prefer the type-safe `self.call_self` stubs.\n ///\n /// ## Authorization\n ///\n /// A call to this contract itself always succeeds. A call to a different contract can expose that contract's\n /// private state to the caller, so it requires explicit authorization. A call that is not authorized fails.\n ///\n /// # Example\n /// ```noir\n /// self.call(Token::at(address).get_balance_of(owner));\n /// ```\n pub unconstrained fn call(_self: Self, call: UtilityCall) -> T\n where\n T: Deserialize,\n {\n let returns = call_utility_function(call.target_contract, call.selector, call.args);\n Deserialize::deserialize(returns)\n }\n}\n" }, "83": { "function_locations": [ { "name": "::len_oracle", "start": 1625 }, { "name": "::push_oracle", "start": 1763 }, { "name": "::pop_oracle", "start": 1896 }, { "name": "::get_oracle", "start": 2032 }, { "name": "::set_oracle", "start": 2181 }, { "name": "::remove_oracle", "start": 2309 }, { "name": "::clear_oracle", "start": 2419 }, { "name": ">::serialize", "start": 2754 }, { "name": ">::stream_serialize", "start": 2849 }, { "name": ">::deserialize", "start": 3147 }, { "name": ">::stream_deserialize", "start": 3259 } ], "path": "/home/nventuro/pkg-1/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 = UnconstrainedArray;\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(slot: Field, values: [Field; N]) -> u32 {\n ephemeral_oracles::push_oracle(slot, values)\n }\n\n unconstrained fn pop_oracle(slot: Field) -> [Field; N] {\n ephemeral_oracles::pop_oracle(slot)\n }\n\n unconstrained fn get_oracle(slot: Field, index: u32) -> [Field; N] {\n ephemeral_oracles::get_oracle(slot, index)\n }\n\n unconstrained fn set_oracle(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 Serialize for UnconstrainedArray {\n let N: u32 = 1;\n\n fn serialize(self) -> [Field; Self::N] {\n [self.slot]\n }\n\n fn stream_serialize(self, writer: &mut Writer) {\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 Deserialize for UnconstrainedArray {\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(reader: &mut Reader) -> 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" }, "85": { "function_locations": [ { "name": "compute_private_event_commitment", "start": 1013 }, { "name": "compute_private_serialized_event_commitment", "start": 1803 }, { "name": "test::max_size_serialized_event_commitment", "start": 2570 }, { "name": "test::event_commitment_equivalence", "start": 2814 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/event/event_interface.nr", "source": "use crate::{event::EventSelector, messages::logs::event::MAX_EVENT_SERIALIZED_LEN};\nuse crate::protocol::{\n constants::DOM_SEP__EVENT_COMMITMENT,\n hash::{poseidon2_hash_with_separator, poseidon2_hash_with_separator_bounded_vec},\n traits::{Serialize, ToField},\n};\n\npub trait EventInterface {\n fn get_event_type_id() -> EventSelector;\n}\n\n/// A private event's commitment is a value stored on-chain which is used to verify that the event was indeed emitted.\n///\n/// It requires a `randomness` value that must be produced alongside the event in order to perform said validation.\n/// This random value prevents attacks in which someone guesses plausible events (e.g. 'Alice transfers to Bob an\n/// amount of 10'), since they will not be able to test for existence of their guessed events without brute-forcing the\n/// entire `Field` space by guessing `randomness` values.\npub fn compute_private_event_commitment(event: Event, randomness: Field) -> Field\nwhere\n Event: EventInterface + Serialize,\n{\n poseidon2_hash_with_separator(\n [randomness, Event::get_event_type_id().to_field()].concat(event.serialize()),\n DOM_SEP__EVENT_COMMITMENT,\n )\n}\n\n/// Unconstrained variant of [`compute_private_event_commitment`] which takes the event in serialized form.\n///\n/// This function is unconstrained as the mechanism it uses to compute the commitment would be very inefficient in a\n/// constrained environment (due to the hashing of a dynamically sized array). This is not an issue as it is typically\n/// invoked when processing event messages, which is an unconstrained operation.\npub unconstrained fn compute_private_serialized_event_commitment(\n serialized_event: BoundedVec,\n randomness: Field,\n event_type_id: Field,\n) -> Field {\n let mut commitment_preimage =\n BoundedVec::<_, 2 + MAX_EVENT_SERIALIZED_LEN>::from_array([randomness, event_type_id]);\n commitment_preimage.extend_from_bounded_vec(serialized_event);\n\n poseidon2_hash_with_separator_bounded_vec(commitment_preimage, DOM_SEP__EVENT_COMMITMENT)\n}\n\nmod test {\n use crate::event::event_interface::{\n compute_private_event_commitment, compute_private_serialized_event_commitment, EventInterface,\n };\n use crate::messages::logs::event::MAX_EVENT_SERIALIZED_LEN;\n use crate::protocol::traits::{Serialize, ToField};\n use crate::test::mocks::mock_event::MockEvent;\n\n global VALUE: Field = 7;\n global RANDOMNESS: Field = 10;\n\n #[test]\n unconstrained fn max_size_serialized_event_commitment() {\n let serialized_event = BoundedVec::from_array([0; MAX_EVENT_SERIALIZED_LEN]);\n let _ = compute_private_serialized_event_commitment(serialized_event, 0, 0);\n }\n\n #[test]\n unconstrained fn event_commitment_equivalence() {\n let event = MockEvent::new(VALUE).build_event();\n\n assert_eq(\n compute_private_event_commitment(event, RANDOMNESS),\n compute_private_serialized_event_commitment(\n BoundedVec::from_array(event.serialize()),\n RANDOMNESS,\n MockEvent::get_event_type_id().to_field(),\n ),\n );\n }\n}\n" }, "87": { "function_locations": [ { "name": "::from_field", "start": 337 }, { "name": "::to_field", "start": 449 }, { "name": "::empty", "start": 542 }, { "name": "EventSelector::from_u32", "start": 647 }, { "name": "EventSelector::from_signature", "start": 751 }, { "name": "EventSelector::zero", "start": 985 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/event/event_selector.nr", "source": "use crate::protocol::{hash::poseidon2_hash_bytes, traits::{Deserialize, Empty, FromField, Serialize, ToField}};\n\n#[derive(Deserialize, Eq, Serialize)]\npub struct EventSelector {\n // Low 32 bits of the poseidon2 hash of the event signature.\n inner: u32,\n}\n\nimpl FromField for EventSelector {\n fn from_field(field: Field) -> Self {\n Self { inner: field as u32 }\n }\n}\n\nimpl ToField for EventSelector {\n fn to_field(self) -> Field {\n self.inner as Field\n }\n}\n\nimpl Empty for EventSelector {\n fn empty() -> Self {\n Self { inner: 0 as u32 }\n }\n}\n\nimpl EventSelector {\n pub fn from_u32(value: u32) -> Self {\n Self { inner: value }\n }\n\n pub fn from_signature(signature: str) -> Self {\n let bytes = signature.as_bytes();\n let hash = poseidon2_hash_bytes(bytes);\n\n // `hash` is automatically truncated to fit within 32 bits.\n EventSelector::from_field(hash)\n }\n\n pub fn zero() -> Self {\n Self { inner: 0 }\n }\n}\n" }, "89": { "function_locations": [ { "name": "record_retractable_fact", "start": 2758 }, { "name": "record_non_retractable_fact", "start": 3394 }, { "name": "delete_fact_collection", "start": 4031 }, { "name": "get_fact_collection", "start": 4409 }, { "name": "get_fact_collections_by_type", "start": 4802 }, { "name": "test::setup", "start": 5529 }, { "name": "test::make_payload", "start": 5744 }, { "name": "test::assert_payload", "start": 5978 }, { "name": "test::record_fact", "start": 6219 }, { "name": "test::records_and_reads_a_fact", "start": 6494 }, { "name": "test::reads_collections_by_type", "start": 7371 }, { "name": "test::records_a_retractable_fact_finalized_at_latest_block", "start": 8121 }, { "name": "test::retractable_fact_above_proven_tip_is_pending", "start": 9360 }, { "name": "test::deletes_a_fact_collection", "start": 10240 }, { "name": "test::reading_unknown_collection_returns_none", "start": 10746 }, { "name": "test::cannot_record_for_other_contract", "start": 11155 }, { "name": "test::re_recording_an_identical_fact_is_a_no_op", "start": 11457 }, { "name": "test::deleting_a_non_existing_collection_is_a_no_op", "start": 11953 }, { "name": "test::recording_a_fact_after_delete_recreates_the_collection", "start": 12385 } ], "path": "/home/nventuro/pkg-1/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,\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,\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,\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,\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,\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 {\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 {\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(values: [Field; N]) -> EphemeralArray {\n let payload: EphemeralArray = 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) {\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" }, "90": { "function_locations": [ { "name": "OriginBlockState::pending", "start": 597 }, { "name": "OriginBlockState::proven", "start": 660 }, { "name": "OriginBlockState::finalized", "start": 726 }, { "name": "OriginBlockState::is_pending", "start": 861 }, { "name": "OriginBlockState::is_proven", "start": 1003 }, { "name": "OriginBlockState::is_finalized", "start": 1185 }, { "name": "OriginBlockState::from_u8", "start": 1262 }, { "name": "OriginBlockState::is_valid", "start": 1414 }, { "name": "::eq", "start": 1560 }, { "name": "::deserialize", "start": 1740 }, { "name": "::stream_deserialize", "start": 1883 }, { "name": "test::query_functions_identify_each_state", "start": 2098 }, { "name": "test::origin_state_roundtrips_through_serialization", "start": 2710 }, { "name": "test::deserializing_invalid_state_fails", "start": 3216 } ], "path": "/home/nventuro/pkg-1/noir-projects/aztec-nr/aztec/src/facts/origin_state.nr", "source": "use crate::protocol::{traits::{Deserialize, Serialize}, utils::reader::Reader};\n\n/// Chain state of a retractable fact's origin block, mirroring the L2 chain tips.\n#[derive(Serialize)]\npub struct OriginBlockState {\n // Noir has no enums, so this wraps a `u8` discriminant. The discriminant values must stay in sync with the\n // TypeScript `OriginBlockState` enum in `yarn-project/pxe/src/storage/fact_store/origin_state.ts`, which PXE\n // serializes into the `Fact` oracle response that `from_u8` below deserializes.\n inner: u8,\n}\n\nimpl OriginBlockState {\n pub fn pending() -> Self {\n Self { inner: 1 }\n }\n\n pub fn proven() -> Self {\n Self { inner: 2 }\n }\n\n pub fn finalized() -> Self {\n Self { inner: 3 }\n }\n\n /// Whether the origin block is still above the proven tip.\n pub fn is_pending(self) -> bool {\n self == Self::pending()\n }\n\n /// Whether the origin block is proven but not yet finalized.\n pub fn is_proven(self) -> bool {\n self == Self::proven()\n }\n\n /// Whether the origin block is finalized, and thus facts related to it can no longer be retracted.\n pub fn is_finalized(self) -> bool {\n self == Self::finalized()\n }\n\n fn from_u8(inner: u8) -> Self {\n let state = Self { inner };\n assert(state.is_valid(), \"unrecognized origin state\");\n state\n }\n\n fn is_valid(self) -> bool {\n self.is_pending() | self.is_proven() | self.is_finalized()\n }\n}\n\nimpl Eq for OriginBlockState {\n fn eq(self, other: Self) -> bool {\n self.inner == other.inner\n }\n}\n\nimpl Deserialize for OriginBlockState {\n let N: u32 = ::N;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n Self::from_u8(::deserialize(fields))\n }\n\n fn stream_deserialize(reader: &mut Reader) -> Self {\n Self::from_u8(reader.read() as u8)\n }\n}\n\nmod test {\n use crate::protocol::traits::{Deserialize, Serialize};\n use super::OriginBlockState;\n\n #[test]\n fn query_functions_identify_each_state() {\n assert(OriginBlockState::pending().is_pending());\n assert(!OriginBlockState::pending().is_proven());\n assert(!OriginBlockState::pending().is_finalized());\n\n assert(OriginBlockState::proven().is_proven());\n assert(!OriginBlockState::proven().is_pending());\n assert(!OriginBlockState::proven().is_finalized());\n\n assert(OriginBlockState::finalized().is_finalized());\n assert(!OriginBlockState::finalized().is_pending());\n assert(!OriginBlockState::finalized().is_proven());\n }\n\n #[test]\n fn origin_state_roundtrips_through_serialization() {\n let pending = OriginBlockState::pending();\n let proven = OriginBlockState::proven();\n let finalized = OriginBlockState::finalized();\n assert(OriginBlockState::deserialize(pending.serialize()) == pending);\n assert(OriginBlockState::deserialize(proven.serialize()) == proven);\n assert(OriginBlockState::deserialize(finalized.serialize()) == finalized);\n }\n\n #[test(should_fail_with = \"unrecognized origin state\")]\n fn deserializing_invalid_state_fails() {\n let _ = OriginBlockState::deserialize([99]);\n }\n}\n" }, "91": { "function_locations": [ { "name": "compute_secret_hash", "start": 536 }, { "name": "compute_l1_to_l2_message_hash", "start": 815 }, { "name": "compute_l1_to_l2_message_nullifier", "start": 1892 }, { "name": "hash_args", "start": 2151 }, { "name": "hash_calldata_array", "start": 2403 }, { "name": "compute_public_bytecode_commitment", "start": 3035 }, { "name": "secret_hash_matches_typescript", "start": 4194 }, { "name": "var_args_hash_matches_typescript", "start": 4555 }, { "name": "compute_calldata_hash", "start": 4965 }, { "name": "public_bytecode_commitment", "start": 5428 } ], "path": "/home/nventuro/pkg-1/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; 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(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(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(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": [ { "abi": { "error_types": { "12366868613919617670": { "error_kind": "fmtstring", "item_types": [], "length": 20 }, "12913276134398371456": { "error_kind": "string", "string": "push out of bounds" }, "13455385521185560676": { "error_kind": "string", "string": "Storage slot 0 not allowed. Storage slots must start from 1." }, "16431471497789672479": { "error_kind": "string", "string": "Index out of bounds" }, "5176077429756348973": { "error_kind": "fmtstring", "item_types": [], "length": 89 }, "8992688621799713766": { "error_kind": "string", "string": "Invalid public keys hint for address" }, "992401946138144806": { "error_kind": "string", "string": "Attempted to read past end of BoundedVec" }, "9970201630854352883": { "error_kind": "fmtstring", "item_types": [ { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } ], "length": 48 } }, "parameters": [ { "name": "sender", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" }, "visibility": "private" }, { "name": "recipient", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" }, "visibility": "private" } ], "return_type": { "abi_type": { "fields": [ { "name": "_is_some", "type": { "kind": "boolean" } }, { "name": "_value", "type": { "fields": [ { "name": "shared", "type": { "kind": "field" } }, { "name": "sender_only", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::messages::delivery::handshake::AppSiloedHandshakeSecrets" } } ], "kind": "struct", "path": "std::option::Option" }, "visibility": "public" } }, "bytecode": "H4sIAAAAAAAA/+1dfWwcRxU/75699p3v0/lwck7sOMn5/HGxz4ZSaFFpXeerSWwlTSmUYl18m/TU8517H6amgHqlAgRU2JcWqeKPosZOg0IR4kuFIiGh8g/U4i9UVYqoIhDwF1ABEgipcI7v4+3OvtmdvVk7W9t/rXd2fjNv3pv33sy8eSeWlr759tD0dPyzeXlmOp2dTqbzcjYdT+Wmpy/J+en43Nx0LpnKyInpnDyTlfO5peL1+7LJVCp5aTyeSj3vKBWvnkumL6Xky4tLpTd6HPS/JofuJw42wCZ9wMtriLNzKVmoPojVB+flxUX9NkqOpsXLgugsd4htsG44TxRXxjPpXL7ch/uTWXkmLxRfOVGudknOXjk/Nqrftrp+E1P9pyfV9R1s7U8Wl9f4vOSv4Vw7K6fi+eS87GRDEkiEZjYER/G7a31JxPPx8czcQo2kk7BPAPzK6cx8qf5CqH+vKhGrJQ9UqO2sfFF5fQqCKEpOQxBFyRnYqUYpP0UitLAhiMXlc/nM3FIJ9gGAqaRkfOVoUk4ldGH3qyveb7Biq7riRI2el8/fyT4tjlbbHUmcyd6Mfbv/tamJnxSLDz8aGfvL8YWfzi2N3/zX5b+Xa6orHjPYYaLicVYGqOqfYKvvvHpWzhey6eL1o5msnLyUXhPUF96OrCuj2WRuZjqey8nZ/Hhmdq7M1AspeTIbn0nJD8nZXDKTXlwsFV89Lc9msgv3JhJZOZer8Rp5f3+pqiXXh0j1n6Ifr693o5BPrWnC8/lkKplfKNObl5/M33B0qluoCZ6ElrSiJW1oiQstcaMl7WiJBy3xoiU+tMSPlgTQkiBa0oGW7EBLdqIlu9CS3WgJztM9aMletCSElnShJfvQkv1rIkeT3dv+P4Vu0P3kjg8wYS6fj43eSX/L2u/FRdJCSQY1axNZtdVI1b+dPXearNqmU1WsPqidAFfdwyJA3Wy6urnsIyfT8exCudLk3As14CtlSV1naLUlqKBOpBPr+ljVuIvVY1Q2Xm+i1jxJs6AejXbYtZWy65CVtUtbsebayeba683RICX+kCJ/yDbUi9QSaMsFqBUXIJGTALVSBci41In1StfuS8VnHr8v82TxR1OZnJxMZNKjU3J2tpAvf5lJl8DwtjrBP25nw2OMkunS6jFoZflUJp5QKA7ogKxj3tJBk3PPA4irE08UyktFjbE7RlM4L5+PGfBNMemuNFoG0STGXbx6sjA7d+IiFPEPVxZBq84ubWez4uVNFS6kkjMPyAu5e9OJqXg2n4ynKqb4RdQ0i+83R+xFwpCuDfYGuw1LaP+EJVU9QtR2MC28pkiAnUwABRJgFxPABRJgNxNAigToZAJIkgB7mABmSIC9TAA9JECICeBxEqCLCUAmAfYxASyQAN1MADkSoIcJIE0CHGACyJAAvUwAeRLgIBNAlgQ4xARwiQQ4zASgoVDCTAAXSYA+JoA4CRBhAniKBOhnAvi82hMcoHiCg2xeSozdExzEPcEBTi7SIOkiDaBLiSHYNcKjHoKWCGluiGxuiOKkD0HbxB1yF3/I3fwhO/lD7uEPuZc/ZIg/ZBd/yH38IbttwZ4e/pAH+EP22mIsD9pC1A/ZQrl120KIuraqEB22xYQM20K5HbTFWPbZwoHZYwuO77SFHbeH0Y3YQtQP2wLSHran2xaQ/fSd3ZiBxT55FiC++WvaTqOhTYQx9X5AmLI7EmHFZt4diai7E4E9Q3dOIorjdrxjX3104hvBTt8/MAZHSAZHdM/Q+qnbLY1uMY0oA9dEKFOKEic5ipWSZth49fSom7avZrBnLKMIp4J6ooBSyRxraJCCOcjlB7NxRUReGE4yYvBEI0ERq7+Mv6SW8BBlwoUtP5imTKoQp+3IMDnMIXQ7UjHfaVwV+QuKhz+klz8kU2TDpgqQuCECZHyAzUU2hGFkQ8SJtRdijEsINa5Njnzce1KD5TpVpeoDOfVwOeq3XI76jVn3RuSonzrniFMimsUaMKCIBuh+AQWynT9kiD9kmEURhSwXoJD1iihkxj0M81JEIadCK1miiNAAqVtUaFbyoQ4qEVTvZBWCqrM6oBY1X923NT4MPjgMhGSHFJ5Hg/LLJg2gFTV3wgpLi3EnouQOqORHueOzjjt+Xe5oDINfYRDV3AnDKYeA+igz7Tgxsj74iAcGKkcWVAqgI+vfTLkPaMl9bRCIcQ3AsWLQ537L9bnfen3up4yVwDDA5vS5H+rzgJNJqin63Jhc+1G5Dt6e+jzAqs8DpBLcluz3j2SbWzL986F3b6LWSkMYApYLQwAXBj8nYQhoGVts3ROEXSMmVdDAuidINhekrCiCkKvcITv4QzJtwPgsFyCf9drERxUgq7WJbwO0SdkwqaaeBgfX7+CpP4WOXyWKn2J1zxUuaHZB1BCdqkLriDne6n7ngwuDu+7ITM4/+86Dr35hx5X+P/s6/1q4e/4/NzJ4e4ErpwsphCq8vYo4CL/t+HShZfnRmWifZ+LdzuDzX7znjeeeuadviEWBBlnvYTPLf9B6BRpkUaAdsGuEHgGl6FFHB9lcB0U1dUCuqjoj8VNNIlfVJFmnmiQjts230bYtYKHVEN/XVkPSrRQ0aGq+V9aG+eS5mXgqni0/XobWQIBGBv4TRJuVGC2OZGDu+xj3h3yUyc9xlSPaZZWjyffvT8xekBMJOTFeyM7L5TovaDIFjKWn/uiFls4aWWC4lioo5gUZErLalK2tsj+quiB6QHFB9AF54aF4Kpm45W+dlZ8oyLl8ycTNUImaiKRk/EZphXHH6IlNzK37Lnwl+HvyEj0+PTyWu+0efHq0c5oeHurtedVoeGHXCEPmNWAbvWRzXoptBJAu/pASf0imdZ9kuQBJ1utXiSpAxqXO3LpPgus+j9MaKwwV5M/r+jGRkXNnCqlU8mJSzk48mczl8Uvc4pLWJXP8e0l96VtTjS8Vl9deL602PaeWOxDp5VaXNdfUqLqkpV5SQRafVn/jqcuZUXmscRaVRg8nadSYuR4QrqVis0Kf8dEF0CnY8PYIdW0Bp7zWef5enFM+AyPno+5n00bOt92ezdtrdHXsoK1+jNwgdzR8LtDGsHL16FrYDjOVwmYqRagT2XiYlX5LA2YqDZqpNGSmUpRaSaWbj1D8wuHG4kgM+IXDuH4/wqrfVYQNUwgbYcN2sRM2ghM2zEpYo91HTV+MFJQjsBVC1cUgFQjoiBZoXWShD/sDxRr/TCYv50rF7xyX43P3ZrPxBdDwSBPqoQ6Xiivrny/VHxQ+a1uTZi7EG46gidSXgomUoX5tooIO7fcdyPsw8j6CvO9H3g8g7weR90PI+6jDRMpVH7KTMmECK7DGQpM5s6BRJeQGFjq4lq53wrGBLbKU0lKG0l+ujaLx2gwHP4Llqlqw/uBHYDn4ccGuESoYpPpDGtNIOuiiuK/bgFsDEFijjeqjQPUvyN0uAT4a76RAw1Sk1DS+CwgwyXMsj4FFpFcLE43v9cJH48uvGuIJAjEIHwmt2tHYju81ykJNgK1QI8QbvbLbwrCoE2Ar6l71w8eVBjOdSQwLQAG2ou7VIHwkejXE1qtWhsWiAFtR9yoKHxHMI1TMAIF5BD6qQ5ZisEHobqg/HAF1Kr4ecQYC3FA8S7Wvtpv9X3TUrp0qe6IPPhZPo5v5wxpb5dFV8a0a+HssRzSMmbvd7G6Qy/ojGhf1tIXY3gddo226uRnUuoe6j6dnz7YBtwFpkujn38dGFYGL/OkiUs8JaHIbD6LnBKg4ST3nWRWfrYHvY3APxUbdQ4kxJMlImJOL6aqWEYeznYJIunLt8HEFV85GjgeOUk5RVxo8YtvJbnS8m30SS1ztAV0j5qUiBJrP4RGA7OMP2ckfcjd/yC7+kIf5Q+7lD9nLH/KALQg/ZAsh6rXFWPbZopc9thD1XivkknSPhFXhIs2QGzJ4uyhRNo1GIewyE6NPM6WolfcZTIZ2/aV3n/rUt0a/ZI5BxkOyoVveYBzFDsqdeywZmg9NhhagJUPzs/aMZRRBKxqCrreaojOGyFumiN1FQ80FItR8fxWz7OCWD5K1r7wJa2eD6m0jsH4T9a7Eicorah7YPiUs24hjPktzv40ATNNmvRGASKOhR/20KWMEYI52Jc8IQJS2020EYL7RX8P5DAmwnwngsUZ/BeUuC1NlfZLdLtg2VZaHIfrLYBKqbv6Qh/hDem1BeBd/yB7+kIdtQfhB/pA+/pB+/pB7+UPu4Q/Zxx9yty0gu2wxIS0QogO2UG57bSHqFvSy1xYcD/CHDG5VtdFhi17utsXs2WmLCdlpC/Z02mIs99lCLkNblT37bcGeHlsY3e0VxVZzDSxYPIe3qh23xz6RBWPpscUct8CO77IFx7224Pj29vL29vIWsZBbdnu50xZyacGE7LWFqPdt4Bz3VIIg1oIaai9BjLRbOzD7nobjfB9BE+I3nrvxEfYTZj+Z4hf0zFC+XVrk0bHf7f9f6WsnowxBRKYyh0YokUeMiYk/gUYeBdDIIz8aeRSkRR4FWHvGMoqgFWKG+HUjj+iMISKPlKHfxDV0I4kb5d/8YpGs6tap6qw+WBiabyJln21D8wX+QZwSf0gXf0g3edcHF6BNzfkocBIgiSpASCUXWUmoVzKb89HFkvORemPdWLbdW1RoVhJR7S9Y95s4Ut1wIMPgJodBgsNASLYbThYGyXZZLtku6yXbpTVaepLt5iXZLijZblSymxkluxk+mjOxR4vzTpb0MZsqDNKGCINqNBTThjapWMTITbFAALKdP6TIH7KNRZuIlguQaL02Ec1okzZe2kSE2qQN1SYtjNqkBT7iWYd34BmEBVgBR2ih5JFovnpWzheyab1FOkqXT3uV/uWaqf0YCq1jUDllrQGYIVN5a/wU4SOvT/vhI4IYpCDqZMJBEMNUunXy2BgPSweYOlloEMxBKqZODhkEM0rF5JYBBmDqZICx6icd3bj7OqzrvmqktRymuq8jUAVhJA1bR9KILkka6T9H4GQnSIpBDYKRNGIdSR5dkoYpC0KNH5QdhuoLI8hjHUFeMwR566qORhD+Y8rezeSQ5p1LoGk1NvqA+r4teeTX4hFQ9DSSwnbk0gCVpH47cmmIStKgHbkUoJIU3QwuibokaTigoGsaC1ov6Tlc014+1HIdaeZle7vW63HUUdL05UW6L1+GvgF8eYozxZLPPUpZ6QrwM/Vt5yg01DCbHuYjaNLcTqc5tir+oUbzUVTQpAYFzYULWkxX0EbJQY1R/blRKIYYSTHrSBrVJWmMJGmU6s+NGfHnRjeTS2NaXML9uTEj/tztxyPcnxsz4vzcfhyi+XNjRpyf23geRagk9duRSwNUkgbtyKUhKknRzeCS/hFZVGfXhCApSnF+FKkU8WS3rSDZrXofurZXbSxS5mevH3jrmbHORC22ola/6qxob5ZWSiX1HjnwFhXsaq1/oHjfVudZhSZnX9XhqpS01DGqg6mu3KLdu1Z171qxDfQqoLpCm04FlzLXproZ8Auq1QqrzoPVEUXIRH4KV4JenbqOQDQkrTrvUocH1Xhr9LyjxhtjoyXWKyhadiHMd9e7VmX+h1Sj0lrHUDHfXf9EmzXq3rl0eOlWV3DrVGjXZL4LyI6KJ+2rzjFswjazHhtVR+xuhMtiVcwa1BCfezP7ynuB63/S1xANNvTH1qkJ4cdf77a8Ic+vXpu8+e+5sOUN/fCDQx/xPBx+Wreh/wMqcz/wiMMAAA==", "custom_attributes": [ "abi_utility" ], "debug_symbols": "tZzRbt02FkX/xc950OE55CHzK0VRpK07CBCkRSYZYFDk34dH4t6UHYhz7eu+RMtOvJekyy1RopG/H35//PXbv375+PmPP//98P6nvx9+/fLx06eP//rl05+/ffj68c/P/bt/P2zxR7KH9/ruIeWH99435eG9WN/62NaxbcdWt7GVsU1jq2NrY5vHduTpyNORpyPPRp6NPIu80rc6tja2eWzL2PrY1rGNvL7/eRtbGdvIa33b89LWtza2eWzL2Pa81HNyz0u5b9uxLdvYytimsdWxtbHNY1vG1sd25JWR5yPPR56PPB95PvJ85PnI85HnI89HXh15deTVkVdHXh15deTVkVdHXh15deS1kddGXht5beS1kddGXht5beS1kddGnmwbQAAJoAADZEABOKACkCxIFiQLkgXJgmRBsiBZkCxIFiQnJCckJyQnJCckJyQnJCckJyQnJCuSFcmKZEWyIlmRrEhWJCuSFcmGZEOyIdmQbEg2JBuSDcmGZENyRnJGckZyRnJGckZyRnJGMqol6JagXIJ2Ceol6JegYIKGCSom6JigZIKWCWom6JmgaIKmCaom6JqgbIK2Ceom6JvshasBAkgABRggAwrAARXQBjQkNyQ3JDckNyQ3JDckNyQ3JLeRnLYNIICerHG5jw4eYIAMKAAHVEAbEB08QABIFiQLkgXJ0UFtAQ6ogDYgOniAABKgJ9sWYICebDmgABxQAW1AdPAAASSAAgyAZEWyIlmRrEiODlocYHTwgARQgAEyoAAiOT6d6OABkRyHHB3cvxMdPCABFGCADOjJOc5PdPCACujJWeJ+v43vRAcPSAAFGCADcDYKzkZ0MKcAnA3HeXacZ8d5dpxnx3l2nA3H2YgOHlABbUDFea44z9HBHLOY6OABsc/7BCbjOwXggApoA6KDB8TZKAEJoAADZEABOCCSY8eigwEaHSwpQAAJoAADZEABOKAC2gBBsiBZkCxIjg6WfdqWAQXggApoA6KDB0RyDkiASG4BBogJ5BbQk10CHNCTXQPagOjgAQJIAAUYIAMKwAFIViQbkg3JhmRDsiHZkGxIjg56HGB08IA2IDp4gAASQAEGiOQSUAAOqIBIjlMXHTxAAAmgAAP05BrnOTp4QE+ucZ6jgwe0AdHBuk+/e3KLfxwdPEABBsiAAnBABbQB0cEDkFyRXJFckRwdbDEOo4MHOKAC2oDo4AECiOT4dKKDB0RyjseH+Dc1IAEUYIAMKAAHVEAbEG06AMmCZEGyIFmQLEgWJAuSBckJyQnJCckJyQnJCckJyQnJCckJyftD2bYFCSmRlGSkTCokJ1VSAxkdRofRYXQYHUaH0WF0GB1GR6Yj05HpyHRkOvLuSEGF5KRKaqCykYSUSEoyEh2FjkJHoaPQ4XQ4HU6H0+F0OB1Oh9PhuyOGuzdQ3R0eJKREUpKRMqmQnFRJDdToaHQ0OhodjY5GR6Oj0dHoaHDkbSMJKRwST+VR5kGRIhJP9vETkoKElEhKMlImFZKTKqmBEh2JjkRHoiPRkehIdCQ6Eh2JDqVD6VA6lA6lY++laLzF2H/CghJJSUbKpEJyUiU10N7Bg+jIdGQ6Mh2ZjkxHpiPTkekodBQ6Ch2FjkJHoaPQUegodBQ6nA6nw+lwOpwOp8PpcDqcDqej0lHpqHRUOiodlY5KR6Wj0lHpaHQ0OhodjY5Gx97BeCeW9w4e5KRKaoPK3sGDhJRISjJSJhWSkyqJDqFD6BA6hI69tfFGruytPajs7yZLdHbf7vk1qIGOxu4kpERSkpEyqZCcREeiQ+lQOpQOpUPpUDqUDqVD6VA6jA6jw+gwOowOo8PoMDqMDqMj05HpyHRkOjIdmY5MR6Yj05HpKHQUOgodhY5CR6Gj0FHoKHQUOpwOp8PpcDqcDqfD6XA6nA6no9JR6ah0VDoqHZWOSkelo9JR6Wh0NDoaHY2ORkejo9HR6Gh0NDh820hCSiQlGSmTCslJlUSH0CF0CB1Ch9AhdAgdQgd77uy5s+fOnjt77uy5s+fOnjt77uy5s+fOnjt77uy5s+fOnjt77uy5s+fOnjt77uy5s+fOnjt77uy5s+fOnjt77uy5s+fOnjt77uy5s+fOnjt77uy5s+fOnjt77uy5s+fOnjt77uy5s+fOnjt77uy5s+fOnjt77uy5s+fOnjt77uy5s+fOnjt77uy5s+fOnjt77uy5s+fOnjt77uy5s+fOnjt77uy5s+fOnjt77uy5s+fOnjt77ux5Zc8re17Z88qeV/a8sueVPa/seWXPK3te2fO69zyloERSkpEyqZCcVEkNtPf8IDoSHYmOREeiI9GR6Eh0JDqUjr3nqQUlkpKMlEmF5KRKaqC95wfRYXQYHUaH0bH3XCXISZXUQHvPDxJSIoVD4yj3nh8UDtWgwu85qZIaaO/5QULaHTlISUbKpEJyUiXtjhJrkhtpXw6Ovd97fpCSjJRJheSkSmqgvecH0VHpqHRUOvaeW5yrvecHOamSGmjv+UFC2h0WpIPa3lUrQUJKJCUZKZMKyUmV1EBCh9AhdAgdQofQIXQIHUKH0JHo2Lsab+Tb3tWDlGSkTCokJ1VSAx2/eLATHUqH0qF0KB1Kh9KhdCgdRofRYXQYHUaH0WF0GB1Gh9GR6ch0ZDoyHZmOTEemI9OR6ch0FDoKHYWOQkeho9BR6Ch0FDoKHU6H0+F0OB1Oh9PhdDgdTofTUek4elmDjLS/a4rfNTjeZ+3kpErCO7N2vM/aab83bkGxz3knJRkpHLFO1vb770FOqqQ2qL+W3CbKxDRRJ9rEPLFM9Il14rTJtMm0ybTJtMm0ybTJtMm0ybTJtKVpS9OWpi1NW5q2NG1p2tK0pWlL06bTptOm06bTptOm06bTptOm06bTZtNm02bTZtNm02bTZtNm02aH7fv3dw/45atfvn55fIzfvTr9NtZPfz/89eHL4+evD+8/f/v06d3Dfz58+rb/o3//9eHzvv364Uv/2z4sHz//3rc98I+Pnx6Dvr+bP71d/2hf2q3jp/t6bWGAJH8SIdcR0hdsRkS/r8196GvxTyLSIiLHS94jor/euoxYHYhsBQci1i4PxFZ7kfPci3QZka8j+hPPSOhPCgzw+uTny/XP13iVu/98nxvOHWjt1tPQb5k4hn5/nBE5PUmo1wl541no79Xz/Cz0aURbfBYVI1JbZUBfwHo6pFaHods8DJtnsq/7Pc1YjMs+R8LJ7JOf7TpjMTCVEX2Qz4RNnyboalz6HJfVXpeRFLuRekuvMxYjsy9D4kPpy44+x5bfvBvaXPi5ervcjeXg2hoHl5TLwSWLDEmGMyqp6CnDXpCh2I/+3FIvM5ZDVJ1DtFw2La2unH2RhYfSl1TaaT+eNj6tLp598W7jBbg/h1yn6ColejBC8ulGsD27ii8uoCljP9Kp92l7evlLi1Ha4ndLjp3oE5LriJt2QrdFgi9ORXMMjtRnU6cL2AvOZlV+sGrXZ3NxFe0rKvhE+pLKqfVFnmTo6q5o8/be1+FPh/J0hqCrUbq/1zmOpQ+N64zFGO3v13BfO1XlhwS9/46gdv8dQfO9dwQt998Rlhk33hG03n1HWO3GrXeE5RBVNc5A8/XwMrl/cFi6f3CY3js4zO4fHMuMGweHlbsHx3I3tpp4GT2f0JccytY4OGRrrzylyZmh+ZUZnC8kya/9aPmclM6n9EUZOXE/sr42w4QZp/nTSzK0ibH4dv255PyPDrFbrz/r22zDKS399F7eZnO9//qT2/3Xn7Lde/0pcv/1Z5lx4/Wn6N2DY7UbbzI4LOGDLVba5eAoq5ukOK4/mk6TWnk6FSyrGakXTif9NMGXp0/UZTFES8HnWjy/JsA37IKf5sQvCsDtoK+/XwWsPwy+JSrm2+WH4Yu7fJ8Ec1yZy9WHsY5IiRFVLyMW160Y0hzdud0dUdJVxO3n067P52pk5son2CJ+eSSrdwLS+MIpWb07Il9+qusntvnomc8Nef7EtnwSb0n4EN3XdS6fxOvqnRPPqJ3fAT7bj7qchnJobOn0COwvOZLTO4W+vnF9JKtnJefH0u9iep1R7r+1Vr//1lrrvbfW2u6/tS4zbry1Nrn71rrajZtvrcuXX3Me2vl0/Xk+PNryWSdzMpva6X2P6O0v8iomgH25t169yGuLQSol8R4vRVWuj2V1Le03J15MO58+miovSFEuAfSL2mlB5oeUtrq9cBWgz3tOFxFJt2e4MMNPR/M8o7/qW70emE9vegopt+9GVTx32fnt04+7sXoF3+alrC+gXuxGv0ivruucS2o9vYt7yZFIm0eSF0eyuqCazOF+eoQ02V4Swoemdn6G/DGkvkVIWy4d8k1+nz7MENUXDNQyB+p5+fEFg71oxigr6q8rTJ+QCSdksshY1r9wXaLz6V3Fyy4iT1JOY+15iqwWnW58k766OBs/mmZ1u7o4i/jy1s17t52myj8cSV3dZyrvM6qXS7siy2vqNhdW500zv/JITk8vz49ked99g89krnz1WfPlZ7KabqfSeD79dDHMz49ktV6veU7Z5TxVfr4j+Q1WmlN5i6Vmv3utOdU3WGxehty62rx6q3/rcvNyR2582fl/Qm5727kMufV1p6xWn97ilNw68V53zxmS2mnx+3n31N+gNqsVqJtro+3u2tj2BrVZhtxam9Ui1K1jZLUjt46R9Uwk63w1dD0TEcv/5IS3v36du6H+2qm7+Py1hPyqeTefqKzWxbzblsfiuIaUnOTqCWIZkZW/EdCfns8RP/cvPvz28cuT/83te0R9+fjh10+P48s/vn3+7fS3X//7F/4G/xvcX1/+/O3x929fHiNp/pdw/Y+f+hNBeddn9Pbzuwfdv+7PiP2buX8dv2nav9Ef1fsf5efvsUf/Aw==", "is_unconstrained": true, "name": "get_app_siloed_secrets" }, { "abi": { "error_types": { "12913276134398371456": { "error_kind": "string", "string": "push out of bounds" }, "14990209321349310352": { "error_kind": "string", "string": "attempt to add with overflow" }, "1998584279744703196": { "error_kind": "string", "string": "attempt to subtract with overflow" }, "226260835993583084": { "error_kind": "string", "string": "unrecognized origin state" }, "5795322663222853459": { "error_kind": "string", "string": "Fact payload length does not match the value's serialized length" } }, "parameters": [ { "name": "recipient", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" }, "visibility": "private" }, { "name": "page_offset", "type": { "kind": "integer", "sign": "unsigned", "width": 32 }, "visibility": "private" } ], "return_type": { "abi_type": { "fields": [ { "name": "items", "type": { "fields": [ { "name": "storage", "type": { "kind": "array", "length": 32, "type": { "fields": [ { "name": "eph_pk", "type": { "fields": [ { "name": "x", "type": { "kind": "field" } }, { "name": "y", "type": { "kind": "field" } } ], "kind": "struct", "path": "std::embedded_curve_ops::EmbeddedCurvePoint" } } ], "kind": "struct", "path": "aztec::messages::delivery::handshake::DiscoveredHandshake" } } }, { "name": "len", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "std::collections::bounded_vec::BoundedVec" } }, { "name": "total_count", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::messages::delivery::handshake::HandshakePage" }, "visibility": "public" } }, "bytecode": "H4sIAAAAAAAA/9Va628UVRTfR3d2O/t+AfJW5CWgUgpURKFdWiihllBqiCHZLO3Ybpx9OLtFywfC+skoibvbwh9AH2AAjdFoCH5QQ/jiNuGbIel3EzAx8RGNRuNsd3bmzr1zZubudhPsp+mee849c87vvO4de7l09WFnPJ64kOdG4mkhnkznOSGd4HPx+BiXj6cz6dpPiZF88jwXH0+kR3Pjibe4XKlws0dI8nxyLJbg+WlLuTA/lEyP8dxUsVS+t9Gi/2e1GC6x0Am0GgucKsx1C0JictFy2GZvczBOVzvr9nh9/kAwFI5EV6xc9dTqNWvXrd+w8elnNj27ecvWbduf27Fz1/MvvLi7Y0/n3n37u1468PLBV149dLi7qlsqy3M99YfYVLForGTZYi0uWnqa3b0nJpqkMbctWiOFuVgmnctPFeaPJAVuJG8rXO8X145xwszwng7jl8D5rVT8ly7j/Ba6/S8XZquIK62U5dw4xfGJ6nu20UmykRIcdBIshVtVXUYT+UQsk52UX+kYqhMiXNQcefF+5QHdtTAzkDlfVthsilSMYlcE1GyyTgzKZDohTIriBrNXkK1nukdHl4STYjXMwNCZ4TgpwUkn4bD0apJKdtRoKkobqqSK4kA3r5mj8qN6SeUD1HZq0oeoy5rFxfGmTdpTmB3KZ7KlMqoDIgyLoRid9I04/5G5viTHj4qMvQMrfn2/ff/d2J7zn/17b9Wnwr3N3viurj8unnmUGIvcwhl7ZUaDP5yxzyTjepzxqElG1/wpLj8hpAs3+zIClxxLVyFx5eG2Ws5MJXMj8UQuxwn5WCaVFa16jucGxXzJc69zQi6ZSReL5cLtAS6VESbF2BG4XE5WHfj9aLleDWoqYv+p9LhbU2Miz1cT9nA+ySfzk+KL5rl384uWVfgOCAggCgNSnCDFBVLaQQoLUtwgxQNSvCDFB1L8ICUAUoIgJQRSwiAlAlKiIGUFSFkJUmAcPAVSVoOUNSBlbRVyeth94v9TV1CjJfs6qWTODu/u6NL/lVbvYlEvH/SJfVssw/NiUhEz0dUnORtcJexybXj38vh2ugEk24DcfAT4vXe6YV1V/ruDlBXRgafEhjuTWlpXgnUtEZhotm2wNN2JWUkJrqbb6nYUHCZUmD8+kcr2v4k2P9sLs9UfS1vxJrgNdX5tzf7mfeMo6cfrHVW89mbHuZQ4bfEnuDQs013SzFYwA4spQRrWgxi2qxHfeqkEaLjWRyXATgrw06FLQ0KATgJDDlhIuNUQ1AENUsEbJ0QXnRYHanyaQtogEr7BynVJ8l4d/Dp08UuFNQct1tpwrAEGYAEDqEY2wkVuk027TcN2bEwyy0FanRyqce+1jDpyFPZqxZJGcyQwFLpkEXwJi0iTltyuKbj0z2B2GlkwMzDBa0p3w0y26tSurbJkkl7wsKBXXgHrNN/79oR4ZgSgGDMYQvMYGMyj7sbwlR5UqGol4F9b1Xhq13pRLwNsXpLNgyICYLNrnZUgG4NKDk2c08EfwOb5pI7dmjN0oooMDc/J+knHL6B8dWzI5wUoYki5b0joGTIplsRfDMeP1wA/PjKadIDjNQo4rzrgfKYCjlUHnArSNYOcxQOOxQPuLCzeTwQcqxNwCM2vZTA3VEOJlX5UqJmAY8nIcaM+Nh+nfgUPAJObDDcW3Quzt1c5diaqDOVJdjemUl2wrJC8Ezpe9KdHay8EdlIm+2zQiIQ9vDpHtSztQSvocn03NNu3EY4Mkn27gK8JoMvnxANRgVNR5dADXipAvlQAsSW9wCApMIiaBGALAdkyqMojRBoOpXCDeNBWFaP5yDb2HRBkgEIe/TbWdlESfEGnh/aS1xSIjjrdr3xgazow7KjmABtjtsBqFUKm8l69wv6Oq87oZCKWdqihzkQsnImYZcpEGimBUaJHNaJ8qT2ilAofH+MS2aVbV7RmiicftavYMjZ12MrwgAKfo5TNnAmaRxWjPIo3SScyiVFtoNuoDCc/ugiZLPoIwRiIWJ9SYLXg+1Edvn+Cgsmi7UOVhS7mvPjFTBtt9ZU0+xsPLL9ypWc+r/sRZJrO3QHUQUQ5CJpqefThA1nP3zLreQ2tx+h2GOZNzqj6A7KYGoNaw3o+1HoNpXSfUUqfUVK6eQt5SK/SVmWbXJWJVgiuJCE6XDjpK0kIriTBZaokIa22aTkqSYiBKglTbuAGs6lKEtLtDcmsH0IfAZlhg34TlxlGH8E5NELMoWGl8yUjJlL5VkJu5YvGFA3oK4rPqxGUiBwvEwuRLSLAmUFYC81VWVCVkGxTXaIlBOwzIwaM4MFR9Nrg0p2Z5ls1qqYPdBS+W1QVk4Tzw5VvpHS5YPXVYfCd8tD0SXWQ9qQ6ZPKkOjyvVR1UIan1uvfl1w3S5Okw7ThMnafDrc/T4Vbl6bAVytPWcgNfZjDN5Gn9VOXUT1UUiIi0HBGR1iMi0ipERJYXEc7WVW6nfuVuHSLs/0NEYNaIoqoRI0IUjSyoOpLbRXWO8KKoa3T8FqTAQkhnv6CJJo6i+/1KiaHsRG4cCSLwIzXt8lnW+WZIu5Mmel/ghIZivLbpzEw21Bjal+6SiZw43u3KhKsar13KAtXv7cqMLbUtP9ehIREYRUTdwzgvo62cC1fOBU3SdYE4Q7sBA6t5gSdv41SamDpD5XH9JBVPBhpf7O/rhFPBmq+5B4cWHy0WZk8Lieq3yDJ/XeVl2uiB8/Fv398fK7Z8o8/37jzgPbPlkvFGAECAnOxEe02cx0a4yLlg9eBfr8uamE36MqjN4cyuMKh2ZoGocSuq1aJmwerCrOJSZGBh41aWaIMa1441iAI3zuA2YNC+92aRqMN84lmwtkHwctDWzrrFvICX7cuEZ/umH1zhv/75qeWBczK1oXtxx6Ehw43+A++unjNSNgAA", "custom_attributes": [ "abi_utility" ], "debug_symbols": "vZrbbhs5DIbfxde5kChSovIqRVC4qVsYMJzATRZYFHn3JT1DaZxCXMeT3Zvon9j6TFIUdbB/b77vvr3+/Lo//nj6tbn/8nvz7bQ/HPY/vx6eHrcv+6ej/Pf3JugfqJv7dLdJ8lCkiZv7GKQFaeXfqM9VWnkGuNuQvA3k/0TSZmmztPJ6lv8n6Zfj3AoV+G5TwtzG6f0F5jbNLc7tzCvCS1HaMrc8t3VqWT8HpZX+iaTFqa3CTWJXTXOL0/srze3MrTO3ztyqXPE7hmAimgATyQSaIBPZRDHBJowcjRyNHI0cjRyNHI0ctbsELoJ+RFVRTLCJOgsdPAQV0QSYSCbQBJkQMupnpWJCyHgG1lmgkCmqEDJpL82ESQiZkgo0QSayiWKCTdRZaCZNIpoAE0YmI5ORychkZDIyKVlSI2ouTiKaABNKDiq0u7qc2USdhabsJKIJMCHds/quaTsJMSyTimxCyFkyOWqqFv0sjiaEUzSYmr2TQBPCKedewikaeRYOn3uJhawOsljI6kUVMutn1WhCOFXfrPleFagJP4liQjj13L1OAjTnJxFNgIlkQsmsgkxke6mYYBNGjkaORtacP3fXnJ+EkqsKMpFNFBNsos4CgoloAkwkrV2kCpuiprKqoqo0xarC29vdxgrj15fTbqd1cVEppX4+b0+748vm/vh6ONxt/toeXs9v+vW8PZ7bl+1JXpUR2B2/SyvAH/vDTtXbXe8dxl0ha5k894bMuQFk2l8g4hgh09cQMjm7DRKOCwQ4CNK4TAiqY4TniBRFc0Rm+9AR9Kwg6lbAEEFjRMlxJhTugMIX/fO4P+vid+7PGLsBtV4bBlksGMyJQNQhBBcMdkKZkiEAuXQCXRDqmIAYLZJI1MeT69U2UECzgWBoQ3TyMjFZMBPnHggol1ZEJzGxmBXLQEjFuCWWFNLQD/RCkWJDIDUEXg5oJA+B3YoMQyuczMy5TdGcE46jWT5hRHjtiPieEDRPchhaAc40S7XNMgxx7Al4dTOnVm5yWUyS9AFXGJsrTEMz3IJBuu5bwahpVDAAPyEctDocris5tpUoZCpDV5wcla0n5racBVrE45Lh5GgBsiW5wHK6XU9I0QJaEuCA4MaiQGyxKDhcB/x4LtaSgjBiJFgfTz09rYunS/iEeOY+Tcpip/Q+FtlbDMBqKCTs6Zmvt4JDz3CO+aZRZSqdkcttDOyZwTS0A4NXybmXchjXYXRqqJwT2sImNo2KhmsGp9DMyHlsRvLiEfoeOERYLNL4bvvpVNFKbMtjzYhjhldFofTRhZJ5QXnnj5eoSO1QUBaE/BE7CnU7FvPlDzt4rR1+oqZeBnlcBsmBZGRjZKw8mLY+oe1aZPMRbyFQ20dmIryJ0LJL5Ijg7jZKK6K5OBOWaP2kp7x60rtmXDnpiT9j0pNzVGJuayzXxENG9naj0BgJFju4dwHJce1M84yQ60VqC71MeRjO+OxUUmoHRwIc24GrPbnOhhRvjEUKbX2UK9BxFc7lE1LDS9Lab1Zq7Ix6eUOU6+qAXmsE5KERHkIi0BFlhCjeTjS1cZV76jpEeOs8AvarrjHCSU8usY0pDgHeykol9Fsqus0N7G7QMCmKd0wK7aZKvqgYW8H/sSOL8Vgc5T+EyM0R5CGCvYO8XH+3rQ6MEfD/xWJx+fihGdJPF2lxP/MO8S97hND3CONrIvbW9x4MyOM7M3bSs1C2YMh+uMeTLisn8/o7Da6r7zR8T6h5khf32u898RAF2/G5LG+ELxEV1m/balq9bXPNuHLbVp36SQxmBjHV4cpcvSwPwS4DcliE4w9GWbus+uPavrspJZXRuPrTNfTpGur4RjZ4J+hYbOOHsslwIE4RRYi2MKJ2HG12YnDyIxWM7YI5BgfiFVLA1I/QiOMUicHbh7ZUlS8wOoLCBwK7jMni5uzPwDpDLN8MtwWOY7mYdg/ytH3cny5+n/GmrNN+++2wmx9/vB4fF6++/P1sr9jvO55PT4+776+nnZL6jzzkzxeQ7/Eh14e7TdInOY4Dxgf9qYE+SqWXo8LDm9ryDw==", "is_unconstrained": true, "name": "get_non_interactive_handshakes" }, { "abi": { "error_types": { "10033682601308824536": { "error_kind": "string", "string": "Ephemeral public key is the point at infinity" }, "10085934976288314239": { "error_kind": "string", "string": "handshake public keys do not match recipient" }, "10522114655416116165": { "error_kind": "string", "string": "Can't read a transient note with a zero contract address" }, "10835969307644359280": { "error_kind": "fmtstring", "item_types": [], "length": 40 }, "11088061827347467743": { "error_kind": "string", "string": "Note owner mismatch." }, "11757062056923899602": { "error_kind": "string", "string": "handshake signature key does not match recipient" }, "12366868613919617670": { "error_kind": "fmtstring", "item_types": [], "length": 20 }, "12469291177396340830": { "error_kind": "string", "string": "call to assert_max_bit_size" }, "12706857619424059571": { "error_kind": "fmtstring", "item_types": [], "length": 37 }, "12820178569648940736": { "error_kind": "fmtstring", "item_types": [ { "kind": "field" }, { "kind": "field" } ], "length": 48 }, "12913276134398371456": { "error_kind": "string", "string": "push out of bounds" }, "13455385521185560676": { "error_kind": "string", "string": "Storage slot 0 not allowed. Storage slots must start from 1." }, "14990209321349310352": { "error_kind": "string", "string": "attempt to add with overflow" }, "15173227908702450335": { "error_kind": "string", "string": "invalid recipient handshake signature" }, "16431471497789672479": { "error_kind": "string", "string": "Index out of bounds" }, "16466267804227883608": { "error_kind": "string", "string": "Got an ephemeral public key with a negative y coordinate" }, "17110599087403377004": { "error_kind": "fmtstring", "item_types": [], "length": 98 }, "17968463464609163264": { "error_kind": "string", "string": "Note is not in stage SETTLED" }, "186772300998906374": { "error_kind": "string", "string": "Obtained key validation request for wrong pk_m_hash" }, "1998584279744703196": { "error_kind": "string", "string": "attempt to subtract with overflow" }, "2431956315772066139": { "error_kind": "string", "string": "Note is not in stage PENDING_PREVIOUS_PHASE" }, "3387382714057837913": { "error_kind": "string", "string": "Note storage slot mismatch." }, "5449178635769758673": { "error_kind": "fmtstring", "item_types": [ { "kind": "field" }, { "kind": "field" } ], "length": 61 }, "643863379597415252": { "error_kind": "string", "string": "A NewNote cannot have a zero note hash counter" }, "7217415691812985622": { "error_kind": "fmtstring", "item_types": [], "length": 123 }, "8992688621799713766": { "error_kind": "string", "string": "Invalid public keys hint for address" }, "9460929337190338452": { "error_kind": "string", "string": "Note contract address mismatch." }, "9791669845391776238": { "error_kind": "string", "string": "0 has a square root; you cannot claim it is not square" }, "992401946138144806": { "error_kind": "string", "string": "Attempted to read past end of BoundedVec" }, "9970201630854352883": { "error_kind": "fmtstring", "item_types": [ { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } ], "length": 48 } }, "parameters": [ { "name": "inputs", "type": { "fields": [ { "name": "call_context", "type": { "fields": [ { "name": "msg_sender", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "contract_address", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "function_selector", "type": { "fields": [ { "name": "inner", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::function_selector::FunctionSelector" } }, { "name": "is_static_call", "type": { "kind": "boolean" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::call_context::CallContext" } }, { "name": "anchor_block_header", "type": { "fields": [ { "name": "last_archive", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } }, { "name": "state", "type": { "fields": [ { "name": "l1_to_l2_message_tree", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } }, { "name": "partial", "type": { "fields": [ { "name": "note_hash_tree", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } }, { "name": "nullifier_tree", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } }, { "name": "public_data_tree", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::partial_state_reference::PartialStateReference" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::state_reference::StateReference" } }, { "name": "sponge_blob_hash", "type": { "kind": "field" } }, { "name": "global_variables", "type": { "fields": [ { "name": "chain_id", "type": { "kind": "field" } }, { "name": "version", "type": { "kind": "field" } }, { "name": "block_number", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "slot_number", "type": { "kind": "field" } }, { "name": "timestamp", "type": { "kind": "integer", "sign": "unsigned", "width": 64 } }, { "name": "coinbase", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::eth_address::EthAddress" } }, { "name": "fee_recipient", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "gas_fees", "type": { "fields": [ { "name": "fee_per_da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } }, { "name": "fee_per_l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas_fees::GasFees" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::global_variables::GlobalVariables" } }, { "name": "total_fees", "type": { "kind": "field" } }, { "name": "total_mana_used", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::block_header::BlockHeader" } }, { "name": "tx_context", "type": { "fields": [ { "name": "chain_id", "type": { "kind": "field" } }, { "name": "version", "type": { "kind": "field" } }, { "name": "gas_settings", "type": { "fields": [ { "name": "gas_limits", "type": { "fields": [ { "name": "da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas::Gas" } }, { "name": "teardown_gas_limits", "type": { "fields": [ { "name": "da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas::Gas" } }, { "name": "max_fees_per_gas", "type": { "fields": [ { "name": "fee_per_da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } }, { "name": "fee_per_l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas_fees::GasFees" } }, { "name": "max_priority_fees_per_gas", "type": { "fields": [ { "name": "fee_per_da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } }, { "name": "fee_per_l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas_fees::GasFees" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas_settings::GasSettings" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::transaction::tx_context::TxContext" } }, { "name": "start_side_effect_counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "tx_request_salt", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::context::inputs::private_context_inputs::PrivateContextInputs" }, "visibility": "private" }, { "name": "sender", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" }, "visibility": "private" }, { "name": "recipient", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" }, "visibility": "private" } ], "return_type": { "abi_type": { "fields": [ { "name": "call_context", "type": { "fields": [ { "name": "msg_sender", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "contract_address", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "function_selector", "type": { "fields": [ { "name": "inner", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::function_selector::FunctionSelector" } }, { "name": "is_static_call", "type": { "kind": "boolean" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::call_context::CallContext" } }, { "name": "args_hash", "type": { "kind": "field" } }, { "name": "returns_hash", "type": { "kind": "field" } }, { "name": "anchor_block_header", "type": { "fields": [ { "name": "last_archive", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } }, { "name": "state", "type": { "fields": [ { "name": "l1_to_l2_message_tree", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } }, { "name": "partial", "type": { "fields": [ { "name": "note_hash_tree", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } }, { "name": "nullifier_tree", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } }, { "name": "public_data_tree", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::partial_state_reference::PartialStateReference" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::state_reference::StateReference" } }, { "name": "sponge_blob_hash", "type": { "kind": "field" } }, { "name": "global_variables", "type": { "fields": [ { "name": "chain_id", "type": { "kind": "field" } }, { "name": "version", "type": { "kind": "field" } }, { "name": "block_number", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "slot_number", "type": { "kind": "field" } }, { "name": "timestamp", "type": { "kind": "integer", "sign": "unsigned", "width": 64 } }, { "name": "coinbase", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::eth_address::EthAddress" } }, { "name": "fee_recipient", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "gas_fees", "type": { "fields": [ { "name": "fee_per_da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } }, { "name": "fee_per_l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas_fees::GasFees" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::global_variables::GlobalVariables" } }, { "name": "total_fees", "type": { "kind": "field" } }, { "name": "total_mana_used", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::block_header::BlockHeader" } }, { "name": "tx_context", "type": { "fields": [ { "name": "chain_id", "type": { "kind": "field" } }, { "name": "version", "type": { "kind": "field" } }, { "name": "gas_settings", "type": { "fields": [ { "name": "gas_limits", "type": { "fields": [ { "name": "da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas::Gas" } }, { "name": "teardown_gas_limits", "type": { "fields": [ { "name": "da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas::Gas" } }, { "name": "max_fees_per_gas", "type": { "fields": [ { "name": "fee_per_da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } }, { "name": "fee_per_l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas_fees::GasFees" } }, { "name": "max_priority_fees_per_gas", "type": { "fields": [ { "name": "fee_per_da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } }, { "name": "fee_per_l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas_fees::GasFees" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas_settings::GasSettings" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::transaction::tx_context::TxContext" } }, { "name": "min_revertible_side_effect_counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "is_fee_payer", "type": { "kind": "boolean" } }, { "name": "expiration_timestamp", "type": { "kind": "integer", "sign": "unsigned", "width": 64 } }, { "name": "start_side_effect_counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "end_side_effect_counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "expected_non_revertible_side_effect_counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "expected_revertible_side_effect_counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "note_hash_read_requests", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 16, "type": { "fields": [ { "name": "inner", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } }, { "name": "counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::counted::Counted" } }, { "name": "contract_address", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::scoped::Scoped" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "nullifier_read_requests", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 16, "type": { "fields": [ { "name": "inner", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } }, { "name": "counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::counted::Counted" } }, { "name": "contract_address", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::scoped::Scoped" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "key_validation_requests_and_separators", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 16, "type": { "fields": [ { "name": "request", "type": { "fields": [ { "name": "pk_m_hash", "type": { "kind": "field" } }, { "name": "sk_app", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::validation_requests::key_validation_request::KeyValidationRequest" } }, { "name": "key_type_domain_separator", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::validation_requests::key_validation_request_and_separator::KeyValidationRequestAndSeparator" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "private_call_requests", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 8, "type": { "fields": [ { "name": "call_context", "type": { "fields": [ { "name": "msg_sender", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "contract_address", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "function_selector", "type": { "fields": [ { "name": "inner", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::function_selector::FunctionSelector" } }, { "name": "is_static_call", "type": { "kind": "boolean" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::call_context::CallContext" } }, { "name": "args_hash", "type": { "kind": "field" } }, { "name": "returns_hash", "type": { "kind": "field" } }, { "name": "start_side_effect_counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "end_side_effect_counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::private_call_request::PrivateCallRequest" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "public_call_requests", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 32, "type": { "fields": [ { "name": "inner", "type": { "fields": [ { "name": "msg_sender", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "contract_address", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "is_static_call", "type": { "kind": "boolean" } }, { "name": "calldata_hash", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::public_call_request::PublicCallRequest" } }, { "name": "counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::counted::Counted" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "public_teardown_call_request", "type": { "fields": [ { "name": "msg_sender", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "contract_address", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "is_static_call", "type": { "kind": "boolean" } }, { "name": "calldata_hash", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::public_call_request::PublicCallRequest" } }, { "name": "note_hashes", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 16, "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } }, { "name": "counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::counted::Counted" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "nullifiers", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 16, "type": { "fields": [ { "name": "inner", "type": { "fields": [ { "name": "value", "type": { "kind": "field" } }, { "name": "note_hash", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::nullifier::Nullifier" } }, { "name": "counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::counted::Counted" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "l2_to_l1_msgs", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 8, "type": { "fields": [ { "name": "inner", "type": { "fields": [ { "name": "recipient", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::eth_address::EthAddress" } }, { "name": "content", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::messaging::l2_to_l1_message::L2ToL1Message" } }, { "name": "counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::counted::Counted" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "private_logs", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 16, "type": { "fields": [ { "name": "inner", "type": { "fields": [ { "name": "log", "type": { "fields": [ { "name": "fields", "type": { "kind": "array", "length": 16, "type": { "kind": "field" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::log::Log" } }, { "name": "note_hash_counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::private_log::PrivateLogData" } }, { "name": "counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::counted::Counted" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "contract_class_logs_hashes", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 1, "type": { "fields": [ { "name": "inner", "type": { "fields": [ { "name": "value", "type": { "kind": "field" } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::log_hash::LogHash" } }, { "name": "counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::counted::Counted" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "tx_request_salt", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::private_circuit_public_inputs::PrivateCircuitPublicInputs" }, "visibility": "databus" } }, "bytecode": "H4sIAAAAAAAA/+1dB3wUxffPzu5eLrn0hA5SVFAQFSx/O1JCb9KVEo/kwEhIQppgJYodNByoICoqXQQVGyooNmw3gl00FkTFnw2wd/4bkrubuy33ZndfSGDz8fNx2Nv5vimvzZuZt6J//u07uuTkeC8t8+XmFJbk5BeW+UoKvQWlObVFb25ZfoUv5yJvYV7pRd5pvmr56sqHexV4c6f1KprZt7wwt7e3oKByxYieQ/tl+ytXjc0vK/SVlpJ2gJdEAfBSOgQp81zAS00DswFvNQO91RrSqjaQl46AvNQW8lI7UMvbg97qAHrrSNBbR7WrXNurJL+gIH9qze8L46qqFlRVvdQuzvhPqHygZ2mpr6TsAl9J0YKq+f6X2p2YN7RkZ7d7j904PPuJyspxE4856Zv+s54qnt97568L9ipVqFhkDPte113TzMAW68KKwYLGQDw2vKjUl59XVNh9uK9kenmZtyy/qNC/MDQwSnND5Y6hUifm9+KFVJxBxRIqKv8oi2y53x97CI8C9a4cMBexp1nBacffwkxQCytiAAnnzQa1sOLcSFYU5leuHJlfOLXAV8sJsVoLGau4A5jTiwt8VLwExuiQpl8iRDY9C7npM/lldP4CUDMUbFiDZ8VmDXP0Z8XumRnkSxTkBSB+vgT01izQW5cizFKnTjC9eBlgHCO4loS5Fjaml3WqMm7Inv379/rDbHt5uHgFFgdfofwHG58rEfiskzIoMOpXxR45E72/XOkWiL78vInex+6VQv8qGP0XOOmDDJbSLdBbL/CKBr9Cv4pLoc/GEoerFGxYgytRFLpCv7IKi9UqwT3jol+1EAR7pT+mCP+jDABMGiFY3DIDHkigxrz6pXbNu3c6vXjR9qzqYzp8fO6WB49f2OKXo86q3tj/vr1/vfZHDYtaFJurucTmGiyxuVrBhjV4DorYKPTnVPEqKdEfHu0qwFTxGfsaNqnimp1rgQw4RwGHDfblgCGB+OvXCubkZI4f1kyQNF3HO7/SfJwpYzy068PFG4BErlOGE8dlv1YBhymmG1HoX68Aw+jfZBNf3qTEbPjbeQO4nTfb1M6bTbUTbmjmohi6G5UBhjmnL1qnPyEKVThA/2YY/ZdQ+FmhPxfmRb8IeuslXgUmRxqo6JejR4zXd7iJyzrNg8LeaJPQzIvpiAjRuAfmbB6MZ7ba4eVqCA1IYG+xka222jTet0QpKc0OR3cN2uFblbcyu8V90PazU2Z1aXpq0bCKOZ+NWndl1rJjd6c2/7H8rIo/q4sUCVHeanPSkCXPj7j44XlnpPbrnvjOFe9cd/FJ799649Wdf549dpbrSL99Hb5V6bCuvNkmQoYiHO1jMvJWVd/yVmVS3mDbDvIrZuQt2kiw4/X7/v37oewHNGMgeXvFpvGeryVv0Y1ME55PTWh37+VTn3p740M9Rr4D7bAfJEkwebOrw/5oeZO4l7sAR4fxzheEiwuBPk/Qh47dlOtM+Bww+rBF03UgPrgNxTNaoADDPNPbbeKd20150AvB7bzDpnbeodFOwCwpHYSpqNdQPG2F/h0w+q+j8NNcpQkwT/s10FuQVtanpw2QAsbyL4LC3mYT0y4yY/kVnlkE45k3cDzt20CCvdhGtnrDpvFebM7ThnX4TpCn/TrI8tvV4TuNPG2AW4wrb0vqW96WmJS3JTB5C9ghb1FTAJa3u2yUt4BN430XRN6iw//QDt9to7zZ1eG7zcYbgd7SPVgba7fZuWGw1MyWOSDYCnrrXk7ifqijdA/oxaVKC2BzeR/vKIG3nmLu80WYBFcVs3K7P1xcZvbY2foh5QVl+SNzvQXeEqW40F+5undRYWmZt7AMgKd+l2zLnFTuWj4xt2un5Ox9zTMWXtPjpXlX9+h0HCt59zPlZTwE/VRcTsUVVveDl3NZvpVY+8FKV1bCGrwKZT9Yob+Kez+Yf7RXcI32aqzRXqFgwxq8BmW0FfprcLY0VwGRrc9jrN1/Zh4fQJzHB2psUKy21LwGwVuLNdtr54NaudbKiQzbJJDnkAcrrg9CD9SvNWWe1F7bg4LV8ChgNBgjuy5cXA900dYqrYQ15UEUF7GGPsxFfBA0dQ+haK11CjCMdR62yeF/2JTDvx7czkdsaucjpsKjDykdhC19t6OERxX6j8Dov4XCT4rGfQgWHt0OeustXr2MHB4FSAGjlzdAYR+yiWk3mAnXKDyzAcYzb+OERx8CCfajNrLV2zaN96PmwqOwDj8GCte8BQrX2NXhx6yFR+Nw5e3x+pa3x03K2+MweXvH7vBo7UEEGPs9YaO8vWPTeD9hLjwK6/CTNsqbXR1+0vpBBD5Pe2O4+BTQ5gc9XYBPDHortj9uZsVa08oFdrYS9NbTKH3ZqADDvOFnbOLDZ0x57U+B27nJpnZuMuW1P610EKaR30Px2hX6m2D038fy2p+Gee3vgd6CtLI+vfZnuLyIzVDYp21i2s1mvAiFZzbDeOYDHK/9aZBgP2sjW31g03g/a85rh3X4OZAX8T7Ii7Crw89ZPz4MMSQ8CwFG3rbUt7xtMSlvW2Dy9qEZeTM6Plx7qAHGfs/DzBhI3j60abyfN3d8GNbhF0CSBJM3uzr8QnSH7eNvE2kLLoe5YC+iuBaXK9v2MPovmRp89dZ5eBpeZMov2bX1/TIVt5rJZRTjaPoNd+1qZgb2VV1Y2WDUYqdIeoUpL2fKK5jyqwup+BoVX6fiG1QMRLZ+AYjjQdcYxNdAI0F51S6siS+B3nod1MQ3TbF47MmiTPlNpvwGUw4ok7WNitup+BYV37YaVNjGFVR4J1x810QOMthEbQNNwTt+yILs3Qa2gAGEkxiH6j370l+9pzEVsEGOJhdNX8EGYb0fey0C6sn70TYZ1pV3QW/BuvJB7FUGqCsfaOb/M7KELzPlrewP7zDldzkt4YdU3BEpBfFRUrDhlrn3r+rZfe3JY9f7n87f9GjrTS8s3vjfdfPKPrtpUts/nq1c0bOkxDtrIUwKOsWWARhQS7uAWtkFBDwMVztc91DxIyp+TMVqKn5CxU+p+BkVP6fiTip+QcVdVPySil9R8Wsq7obpAYsnknZx6aZvsE4kKR3/Btbg/6GcNVLo/4/3ZBnQx/vWGJa+4F1qym34lil/zJSro1JhfkfF76n4AxV/NNP6PcatP35sykAzsHt1YeNDY21mUPYw5Y+Y8ndMea8yKPuo+BMVf6biL2aclU9Ab+0DjcSvOI7vp6C3fgI18TecJn4GeutnUBN/R/LNf2XKvzHl35nyLwo//UHFP6n4FxX/NjMSn4Pe+gM0Ev8gjcQ/TPlPpvwXU/5bGYl/qfgfFfdTyYyylATj1v8yZt9OM62XBKaV/zLlnZHKUiJUEqkkUUm2uMaSCM8aS3KFi/FYayyJgKbABVljSfENa40luXj8GMlt2xpLcptZYx0Y5Ghy0fQVbBBWgj1rLCnB1BpLige9BetKoj1rLCkRuMbCv6ijSHa4HM+3RpM8VErS6MfD2dMn+/LyfHm9y0sqfD3z8tjVouRhykl+XSeRryXJVErhT/vaCTTpySiha2U19QXM5qTyqjLefMxSqtIWrozMUlq4mI605pLSlf9gI5SBNENSKox+ZuyxM9H/NKVjsD3BHdbPjWj0SqGfCaP/Ea8DDjsOsgP01ke84sEdhKiZ31gkGOOdhSUQmQo2rMFNMIIQNfSbVGGxWhNwz7jow3IySxl+QB5lKRMmjRAsbpkB6wygzmyKnpO5hkSMl1ixaYYlNk0VbFiDm6OIjUK/uZWczPCZh1AxdwlQagGU5OZKS2CDnWYqEKD2pVsI5hROcz+smSBpask7v7w5maHzy/horcLF1kAiLZXhRLnALLVQwGGKqQ0K/VYKMIz+ETbx5RFmDjVLrcHtbGtTO9uaaifc0LRD8RjaKAMMc04/tk5fI76k0G8Lo1+Nws8K/XYwL/pj0FvVvAoMOV52BJfv0B4K28YmoWlv4pBnzZy1h/HMp3Z4uRpCAxLYDjay1ac2jXcHU4eqgR0+EnSouhp0yNOuDh9Zv1chOeXtqPqWt6NMyttRMHn7zA55U12FBLLf0TbK22c2jffRpq5CAjvc0UZ5s6vDHS1fhYQ4Oox33ilcPAbo8wR96NhNacnJz3D6sEVTSxAfHIviGXVSgGGeaWebeKezKQ/6GHA7u9jUzi5mri9KxyodhGnRnSietkK/C4z+Fyj81E5pAszT3gl6C9LK+vS0O3NZ/uOgsMfaxLTHmbH8Cs8cB+OZXXZYfg2hAQl2VxvZapdN493VnKcN6/DxIMv/Bcjy29Xh4y1fXwQZEnPXF6UT6lveTjApbyfA5O1LM/IW8/oikP1OhJkxkLx9adN4n2jq+iKww91AkgSTN7s63E3rGE9crPEW/wdzKUFvdcffMu7OZVVPwtr76q5gwxp8Msrel0L/ZJwNBSUAfTLMfT4Fa8v6ZDt3kE7lVYygpDhKkBjy1v9xEvdDPedTQC+eqrQANpen8Y4SeC8S4dLGF3V7obG7dTqWiJwGo3+GKd3OdQdEOp0pnxF1rPlMKp1FpbOpdI4JHocd1JfONMM6sYeuhzHsxvXrc0ydCO8RKrcMlVpFXo+WzqVSTyr1olJvfosqgAbtXNAY9OEdWpjJXw5qYk9QE7NxOFzqw5SzmXIvptxbmaq+VOpHpf5UGmBCkE9X/oNx40Crnk1safuKy7MZZM6zATRDwYYp98EmlDuI/uAq/NH+kmu0h2CN9pcKNmy0h6KMtkJ/aD2M9m6u0R6GNdq7FWzYaA9HGW2F/vB6GO2vuUb7PKzR/lrBho32CJTRVuiPwDlWO1iRGpjdGIkxstJwpWcw+qNQVr8jFWAY/dGm3IPoCzsLsS7s6LnRrK/9JVP+iil/zZR3M5VH+6k0hkpjzTi9415qRwZXLLhl+7Rbnt+RMCgt862qp5cLmSV7L+zbe/PqjJVnXnO8KW9qHFMeo93pA47v+VS6gErjqTTBzD3DM0BvnQ8aiYkorq/UF/TWBaAmTkJyfScy5UlMeTxTnqBMVg6VLqSSl0qTrQbVxnAZjFysoJoiNbmwBuehBNUU+nn4HwOSxnKNtg9rtMcq2LAGT0EZbYX+lCozUg6w/Bp7G6oNcHE3qPM5KCGkwUC/mx95uAmvxw/yOpTV8kBQE85Q/ovdhHQTncsD8kyEhLqrGHGaauKWPcx2X2QMu2fEyCFmYPMBrTVjZS5iyvmhcqeoAOLFVJpGpQIqTbeq9S7m0nqFWFpP6VBhFUCfRfQ2gbO3HWP3dVG4r0XhYnG4OCNcLAkXS8PFsnCxPFysMJvhgC/oXMyUZ0TxzCVUmkmlWVS61GoqH2VowuVLIlP5SJdR6XIqXUGlK804giWgty4DiehVOL5qKegt0Kdqpdk4TSwDvXUFqImVSO70VUx5NlOuZMpXKvx0NZWuodIcKl1rZiTKQW9dDRqJ65BG4jqmfA1TnsOUr1VG4noq3UClG6l0k9WcO9L1TLkiSk/cTKW5VJpHpVusnhC+OfaAMSeEbw0Xq9By7twMmulbIY6qxO3xIJ9svJXLlM+3L+fOfFM5d271Q45awbwxwCFFUE/85nLuVIHegnVFw10ylXNnQcPJuXMrU67izHSjKKTbuHPusGrvNr+uf8TXktupdAd/Wo+OoEm/nVeVJHIf2iwCkDDSTtF/jOZmnObFJjQ37GRPEaiXi3BOPdxpDDv5hoxPTdnkO5nyxUx5cZRNXkKlu6h0N5XuiWQDD7dNXsJlJJbaZySWCvW5eLs3XLwvXLw/XFwWLi4PF1eEiyvDxVVQNllaD0u8+5jy/VFssppKa6j0AJXWWl7i3cuUV0ct8R6k0joqrafSQ2ZcsGWgt0BfhJMexlk/wU7irAM18RGcJq4AvbUe1MQNSAubh5nyI0x5A1N+SOGnR6n0GJUep9ITZkZiJeitR0Ej8STSSDzJlB9jyo8z5SeUkdhIpaeo9DSVnrG8xNvIlFdF6YlNVNpMpWep9JzVJd4mLkdhS7j4vJ06lX+rfqnSGNhx5i2gVr5ginHUVvIFU3cWld48D+sN6ItW0os29ebFqN4sgPZmEyhorLz4Aui+jvLiizBlsgk226D4AGQU6zM+8AKX6/cSrtOjZpaXBBNn7utYIPZkKC++pHXVSAMSzALRdaPbp5AEYb1sU/Ti5ShxAw/hi9AXtYZwwu/bFr+36PrtU2+e/9AnhVeuWg4dwhdBb8GGcKtNUZOt0QEg2OIU1uFXTEnKQQnZvMBqcab8ihIIeZVKr3GHZF5lyq/5Y69nDlB6nUpvcHN0R6UuyM68ohAwddIhVgtqgxWxG3Av6K0A/tGXAJdloFibwAEFG9bgN1GOvij03+QO6vNH4u7Fi8RtCxe3A33HNxVBgLX7FU5ZmQ+VwjdhvusrIHF5C+WQzb0KMIiHtikv4pwgqhkomEf2tokhiE1/sQIMenG7MgSwhr6DtNzWC6u+E7UOfpdK71HpfSp9ECnTSdwaFPCNwyoo1isY7COW1wiQjXJm0+d9pQ/bGRwL24E1ZsC1TYys1a59D7QyxaAfaTOo+GFUpPVjKlVT6RMqfWrmQiEoobz0MWgkuFPGwRylqaC3qkFN/ByjiR1BDfwE1MCdSOruM6b8OVNmvqYkfapw0xdU2kWlL6n0lZmpgnHTF6CR+BppJJjLH9IupsxcFpG+UkZiN5W+odL/qPRtpPJJvsP2TSmEA5m8kDt4ICHOS+23MxdAP2oJMBVQqB22QUlT7R/o3fZDAsbu4DoWNX7ph3Y6Ft/Z5Fh8187qshgw9oyv8j3WsvhDBRvW4B9QlsUK/R/QljQ/cC+4UxbwKCuhMSj0xWEu+jFc3BMu7g0X94WLP4WLP4eLv4SLv4aLv0Gbu9Qm8fvVzb3MrqEOjUTvw+FIBfknWGa3PxCiIUrocilolripw6IcF3NMwC9VphiFb230C1P+MWpt9DuV/qDSn1T6y4w3uwf01u8gi/U3ztpoL+gt0GdopX9wmvgT6K0/QU38F4mf/mbKzFdzJea7s9JfCj/9R6X9VFYk29TB8p9Bb/0HUi0EZyRkwvR4P/M8jikLC6ksUlmiskxll1UP6lfj7u7Zv/+/sAclx2N5UL8q2LE28mraUvMaRPu6UfwspZXu+aBWulGiXXKCMeyrk7stNMV3CQzf7WOei5HhWDmRyh4qJ1E52ZTljj16td1MQfEclNlLgc1eCs7sxfhuavK1FVeYmr1UZvaYb67LiVGzl0bldCpnUDnTqtbYx7PuktG+P7lPwYZ5Yzjfn1ToI31/skZWYEt20MEGuSmGRMlNFGAUL79mL2Spnf1vZs+aSW7WDt/g7mdEpzmiwW0OMLj7a16DsEILLIPbYj6olS1MLLdi0q/xs5qCXkxRtCvMCLQ0xYnmTXjLKCPQisqtqdyGykeYM+EtYN1si6EWavihLYwf2iINs56tbRU1zO2o3J7KHah8pDnt38JO7XcUbwQvgVut/RSbRPjyj3x0uNgxXAx/gUg+Jlw8NlzsHC52CRePww2ccV3+UboTLkflBJG7Uvl4Kp9A5ROtXv5RBjBc7hoZdpG7Ubk7lU+i8skmlsnyMaC3uoH4jjfRObCJx4Le6g5q4qk4TewMeuskUBP/D0mVncKUT2XK/8eUT1b46TQqn07lM6h8ppmR6AJ66zTQSJyFNBJnMWUms5/MZAWXz1RG4mwqn0PlHlQ+1+rlH/lspnxclJ7oSeVeVO5N5T4WL//IPWMPWPhsopwdLva1U6ea8jOyYX5GP5sc+36mPpmmtLMvrJ39bWpnf5PXj+R+sHb+Z305q3m3Q+4Po78fi596wj6Z9h/orf28DhXuxSGIFDCLygH1vNMoDzDzCSdlzgaAeMYVx2vDYZ9Mg/nWA+1jK1BHIOM90Nwn02AdHuSHfDJtvx/wCSfbOjyowaRSkfuxyprNruCn8mAqD+G9lyMPZspD/LGXGgcoDaXyMHN2YijO9rad13Lko0FvDedV0tzBPAgJRu+ehxTMk4cr2LAGj8AI09XQH4F/LUc+mufoD9e1HHlkuDgKJivyCOhREFM+MkhWR9gZJBrN2UrQgRX5aAUYxEMjlRexTgzJsKT/8hhepQaDjZG3WnT9/amJ2HRLJa4HerGtEo2ENXQcRhBdWqwMLKihoxQWgDX0fKRAwFimzKT+l8+PWqFfQOXxVJ5A5Ynm+LGZnYJrLp2+2omaFLW3lbqAV0FfwKGgYZalqTIPVTxqH9ZQwHZglZ2LJN37U3LOQQ5eQy86yRdS2UvlyVTORbvoJF8I4vc8HNcTdNFJ9oKa6MNoIuiikzwZ1MApSAo0jyn7mPIUppyrcNNUKl9E5XwqX2wmppwDemsqaCSmIY3ENKbMpIyX85nyxcpIFFB5OpULqVx0GFx0knN4IJ2LTuE/3oEusB9yUj0bTVOe1SQ7PatimzyrYqunhiBjzzgVM7ACDZMUbFiDS1ACDQr9ErRFIhLyPsWLha1qSlHob4Mme5DLMOgfWNjD6Jej9B+c7EKuQOk/fFV7CQr9miUUjP5M3pVM2iJOPQaxv7yQO2yHtN8eH2TnDJpmTlmNQl58hUo7qhr8EAkQk1nrPio9n0XlS6l8GZUvp/IVVL6SyldReTaVK6l8NZWvofIcKl9L5euofD3MuEYISrr/IA8GAJCJht8QLt5oW35x+QbBIA5yEzSYegPv2Gf4+eRAvqGm16CmKM2GeUM32bvsIczA3WzfBN3czkQYmmu0YGcwbgIxwlycYP08HNhbdGFJCNZMmGEuO39MeR5TvkUJM9xK5Soqz6ey30zrY3DCuBu23GCq9QuY8q0GrVf+u43Kt1P5DnOufTHsIEkiigOqmMvvYPQ9ZsKGsWdvEejwSSLoLY9NumaRxSVx7JMjAqMkF+MsiJWxXQxTaYtBb92JsGhW2njnfCj1GC/F1eecLUGbsyWw8VjCORtAXXqXMW3fG89VmYG9WxdWChZMqei7dPaEdjDv3K3o53uorCjae6l8H/dZhhoWhQT+40DTdg9ouO5HCvszCZLlpUyZ+VqLfJ8yXMuovJzKK6i80sxkrzJufd/KCsnULPiBsxC7hauRxpf5UIY0lXm+OmqHfg2VH6DyWio/aOquDfP9VHkZU14TRWYdlddT+SEqPxypGjP9dUtLPzTCu8y27QR5jf2x/3Wg2D/3uljgDoQDPh/G2JBH7FscPWIiXi6WU/ESmERvwDa+IBLM0D2KtYewQcGGNfgxlD0Ehf5j3IcVm/gjDq7EnE/xEmXy7eDoAwfjobGBAy8zcZzHw8Un7JOEx2GvPdGO/1DjAYGBnQFYZCxW/gMXT+THQcL3BGAK+BntsRryIPqwVj6JIo6PKMAwFbXRxOo4NmoNfdga6hFQK5/CWMNzKPKnLaqW2G25tE61ABb+eKrlmXBxk32q5RnYa5vamZvCS+Hxktiq5RkQ1iYU1aIIzTOwvsCEBtaXzZwKCPZpHnkz6K1nMbTfAaaAydJznHoFFj1fpKhV0ItPKZoF1tAtvEFEkPYVL4GxmxniMVemgAYeg0FYABA+FoMwARDujEFYBBDugsFgx0HYS5yBQboriLPXYQy3BGje8RiEZQDhEzAIuwCET8QgDMkb2Q2DsBtAuDsG4QQA4ZMwCEN2kk7GIOwBED4Fg3ASgPCpGISTAYT/D4NwCoDwaRiEUwGET8cgnAYgfAYG4XQA4TMxCGcACJ+FQTgTQPhsDMJZAMLnYBBuAiDcA4NwUwDhczEINwMQ7olBGJLPshcG4RYAwr0xCLcEEO6DQbgVgHA2BuHWAMJ9MQi3ARDuh0H4CADh/hiE2wIID8Ag3A5AeCAG4fYAwoMwCHcAEB6MQfhIAOEhvIQhu2NDMUCHYQQRhoPiFxUYs3MUoHnnYfR5hA2bEGrSsLwiSuB0M+jFZ5XQLYQrRqLEd5VA/dPQbbAtkDEfZdsmlKmMMy0hQzkag/qBlPAQ6mOw+l4KoT4WQ2ONwwA9HwP0AgzQ8RigEzBAJ2KATsIAzcEAvRAD1IsBOhkDNBcDNA8D1IcBOgUDdCoG6EUYoPkYoBdjgE7DAC3AAJ2OAVqIAVqEAVqMAToDA7QEA7QUA7QMA7QcA7QCA/QSDNCZGKCzMEAvxQC9DAP0cgzQKzBAr8QAvQoDNDAbBbUSBfVqFNRrUFDnYISXAtf6QStzlB5dh4J6PQrqDSioN6Kg3oSCejMK6lwU1HkoqLegoN6KglqFgjofBdWPgroABXUhCuptKKi3o6DegYK6CAV1MQrqnSioS1BQ70JBvRsF9R4UVBzf5V4U1PtQUO9HQV2GgrocBXUFCupKFNRVKKirUVDXoKA+gIK6FgX1QRTUdSio61FQH0JBfRgF9REU1A0oqI+ioD6Ggvo4CuoTKBGPJ0ERjyIU2htBtHG81qeMSe+cn53Nf0ao5sxGOejFV6hcBmon77kacDsvgbazAtTOZzjbGesMTM0EHGgnLJOxqzkK/VegmZxdLXi5FJJzIrAJ8JLSd9BbLVDkaDMK6rMoqM+hoG5BQX0eBfUFFNQXUVBfQkF9GQV1KwrqKyior6KgvoaC+joK6hsoqAEUVIqC+iYK6jYU1O0oqG+hoL6NgvoOCuq7KKjvoaC+j4L6AQrqhyioO1BQP0JB/RgFtRoF9RMU1E9RUD9DQf0cBXUnCuoXKKi7UFC/REH9CgX1a6wowxhglEF6G7Qe3q28lDFyzZ+u5A79+95+XKfedw9dtOT+hae2Pk5s2+Sjh7ud99sVY2vXw7HfwlkPf4OC+j8U1G9RUL9DQf0eBfUHFNQfUVD3oKDuRUHdh4L6Ewrqzyiov6Cg/oqC+hsK6u8oqH+goP6JgvoXCurfKKj/oKD+i4L6HwrqfgxUCvgEiSlYAQeW4MCKOLASDqyMA+vCgY3HgXXjwCbgwCbiwHpwYJNwYJNxYFNwYFNxYNNwYNNxYDNwYDNxYLNwYJvgwDbFgW2GA9scB7YFDmxLHNhWOLCtcWDb4MAegQPbFge2HQ5sexzYDjiwR+LAHoUDezQObEcc2E44sMfgwB6LA9sZB7YLDuxxOLBdcWCPx4E9AQf2RBzYbjiw3XFgT8KBPRkH9hQc2FNxYP8PB/Y0HNjTcWDPwIE9Ewf2LBzYs3Fgz8GB7YEDey4ObE8c2F44sL1xYPvgwGbjwPbFge2HA9sfB3YADuxAHNhBOLCDcWCH4MAOxYEdhgM7HAf2PBzYETiwI3FgR+HAjsaBHYMDOxYHdhwO7Pk4sBfgwI7HgZ2AAzsRB3YSDmwODuyFOLBeHNjJOLC5OLB5OLA+HNgpOLBTcWAvwoHNx4G9GAd2Gg5sAQ7sdBzYQhzYIhzYYhzYGTiwJTiwpTiwZTiw5TiwFTiwl+DAzsSBnYUDeykO7GU4sJfjwF6BA3slDuxVOLCzcWArcWCvxoG9Bgd2Dg7stTiw1+HAXo8DewMO7I04sDfhwN6MAzsXB3YeDuwtOLC34sBW4cDOx4H148AuwIFdiAN7Gw7s7Tiwd+DALsKBXYwDeycO7BIc2LtwYO/Ggb0HB3YpDuy9OLD34cDejwO7DAd2OQ7sChzYlTiwq3BgV+PArsGBfQAHdi0O7IM4sOtwYNfjwD6EA/swDuwjOLAbcGAfxYF9DAf2cRzYJ3Bgn8SB3YgD+xQO7NM4sM/gwG7Cgd2MA/ssDuxzOLBbcGCfx4F9AQf2RRzYl3BgX8aB3YoD+woO7Ks4sK/hwL6OA/sGDmwAB5Y31y44C14BNAveblhD38Rq6CRoQz+ENXQbzkRtx4F9Cwf2bRzYd3Bg38WBfQ8H9n0c2A9wYD/Egd2BA/sRDuzHOLDVOLCf4MB+igP7GQ7s5ziwO3Fgv8CB3YUD+yUO7Fc4sF/jwO7Ggf0GB/Z/OLDf4sB+hwP7PQ7sDziwP8b2a815zBdAPeZ3YQ3lzfI7H9rQmTD6vPmAQQMllitDAG1oM1hD9+Ewyk84sD/jwP6CA/srDuxvOLC/48D+gQP7Jw7sXziwf+PA/oMD+y8O7H84sDgJhwlOwmGCk3CY4CQcJjgJhwlOwmGCk3CY4CQcJjgJhwlOwmGCk3CY4CQcJjgJhwlOwmGCk3CY4CQcJjgJhwlOwmGCk3CYZODA4iQcJjgJhwlOwmGCk3CY4CQcJjgJhwlOwmGCk3CY4CQcJjgJhwlOwmGCk3CYtOWMuQBhcRIOE5yEwwQn4TDBSThMcBIOE5yEwwQn4TDBSThMcBIOE5yEwwQn4TDBSThMcBIOE5yEwwQn4TDBSThMcBIOE5yEw6Q7DixOwmGCk3CY4CQcJjgJhwlOwmHCnXDYD4I93Q/Yx5AX4hA/A0R8Fg7xM0HEL8UhfhaI+GU4xM8GEb8ch/g5IOJX4BDvASJ+JQ7xc0HEr8Ih3hNEfDYO8V4g4pU4xHuDiF+NQ7wPiPg1OMSzQcTn4BDvCyJ+LQ7xfiDi1+EQ7w8ijpNnhQwwpr1n//596j7FbK2wDUScO+31AhDsIEgTXYmgt5B2JHBSaBOcFNoEJ4U2wUmhTXBSaBOcFNpkBA4sTgptgpNCm+Ck0CY4KbQJTgptgpNCm+Ck0CY4KbQJTgptgpNCm+Ck0CY4KbQJTgptgpNCm+Ck0CY4KbQJTgptgpNCm+Ck0CY4KbQJTgptgpNCm+Ck0CY4KbQJTgptgpNCm+Ck0CY4KbQJTgptgpNCm+Ck0CYlOLA4KbQJTgptgpNCm+Ck0CY4KbQJTgptgpNCm+Ck0CY4KbQJTgptgpNCm+Ck0CY4KbQJTgptgpNCm+Ck0CY4KbQJTgptgpNCm+Ck0CZIoV2cFNoEJ4U2wUmhTXBSaBOcFNoEJ4U2wUmhTXBSaBOcFNoEJ4U28ePA4qTQJjgptAlOCm2Ck0Kb4KTQJjgptAlOCm2Ck0Kb4KTQJjgptAlOCm2Ck0Kb4KTQJjgptAlOCm2Ck0Kb4KTQJjgptAlOCm2Ck0Kb4KTQJjgptAlOCm2Ck0Kb4KTQJjgptAlOCm2Ck0Kb4KTQJjgptAlOCm2yAQcWJ4U2wUmhTXBSaBOcFNoEJ4U2wUmhTXBSaBOcFNoEJ4U2wUmhTXBSaBOcFNoEJ4U2wUmhTXBSaBOcFNoEJ4U2wUmhTXBSaBOcFNoEJ4U2wUmhTXBSaBOcFNoEJ4U2wUmhTSgO7Js4sDjpqQlOemqCk56avI0Di5OemuCkpyY46akJTnpqgpOemuCkpyY46akJTnpqgpOemuCkpyY46akJTnpqgpOemuCkpyY46akJTnpqgpOemuCkpyY46akJTnpqgpOemuCkpyY46akJTnpqgpOemuCkpyY46anJjziwe3Bg9+LA4mR0Jj/hwOJkdCY4GZ0JTkZngpPRmeBkdCY4GZ0JTkZngpPRmeBkdCY4GZ0JTkZngpPRmeBkdBZxMjqLOBmdRZyMziJORmcRJ6OziJPRWcTJ6CziZHQWcTI6izgZnUWcjM4iTv4EESejs4iT0VnEyegs4mR0FnEyOos4GZ3FDBxYnIzOIk5GZxEno7OIk9FZxMnoLOJkdBZxMjqLOBmdRZyMziJORmcRJ6OziJPRWWyLA4uT0VnEyegs4mR0FnEyOos4GZ1FnIzOIk5GZxEno7OIk9FZxMnoLOJkdBZxMjqLOBmdRZyMziJORmcRJ6OziJPRWcTJ6Cx2x4HFyegs4mR0FnEyOos4GZ1FnIzO4mk4sKfjwJ6BA3smDuxZOLBn48CegwPbAwf2XBzYnjiwvXBge+PA9sGBzcaB7YsD2w8Htj8O7AAc2IE4sINwYHHy34o4+W9FnPy3Ik7+WxEn/62Ik/9WHIEDi5P/VsTJfyvi5L8VcfLfijj5b0Wc/LciTv5bESf/rYiT/1bEyX8r4uS/FXHy34o4+W9FnPy3Ik7+WxEn/62Ik/9WxMl/K+LkvxVx8t+KOPlvRZz8t2I+yncvRZz8tyJO/lsRJ/+tyJ3/FvK1jqNBpEE5cof4pheVzBpQmF+2oGe12O+YYzt3Oa7r8Sec2K37SSefcur/nXb6GWeedfY5Pc7t2at3n+y+/foPGDho8JChw4afN2LkqNFjxo47/4LxEyZOyrnQOzk3zzdl6kX5F08rmF5YVDyjpLSsvOKSmbMuvezyK668KjA7UBm4OnBNYE7g2sB1gesDNwRuDNwUuDkwNzAvcEvg1kBVYH7AH1gQWBi4LXB74I7AosDiwJ2BJYG7AncH7gksDdwbuC9wf2BZYHlgRWBlYFVgdWBN4IHA2sCDgXWB9YGHAg8HHglsCDwaeCzweOCJwJOBjYGnAk8HnglsCmwOPBt4LrAl8HzghcCLgZcCLwe2Bl4JvBp4LfB64I1AIEADbwa2BbYH3gq8HXgn8G7gvcD7gQ8CHwZ2BD4KfByoDnwS+DTwWeDzwM7AF4FdgS8DXwW+DuwOfBP4X+DbwHeB7wM/BH4M7AnsDewL/BT4OfBL4NfAb4HfA38E/gz8Ffg78E/g38B/gf1UiKOCQAVCBZEKEhVkKrioEE8FNxUSqJBIBQ8VkqiQTIUUKqRSIY0K6VTIoEImFbKo0IQKTanQjArNqdCCCi2p0IoKranQhgpHUKEtFdpRoT0VOlDhSCocRYWjqdCRCp2ocAwVjqVCZyp0ocJxVOhKheOpcAIVTqRCNyp0p8JJVDiZCqdQ4VQq/B8VTqPC6VQ4gwpnUuEsKpxNhXOo0IMK51KhJxV6UaE3FfpQIZsKfanQjwr9qTCACgOpMIgKg6kwhApDqTCMCsOpcB4VRlBhJBVGUWE0FcZQYSwVxlHhfCpcQIXxVJhAhYlUmESFHCpcSAUvFSZTIZcKeVTwUWEKFaZS4SIq5FPhYipMo0IBFaZToZAKRVQopsIMKpRQoZQKZVQop0IFFS6hwkwqzKLCpVS4jAqXU+EKKlxJhauoMJsKlVS4mgrXUGEOFa6lwnVUuJ4KN1DhRircRIWbqTCXCvOocAsVbqVCFRXmU8FPhQVUWEiF26hwOxXuoMIiKiymwp1UWEKFu6hwNxXuocJSKtxLhfuocD8VllFhORVWUGElFVZRYTUV1lDhASqspcKDVFhHhfVUeIgKD1PhESpsoMKjVHiMCo9T4QkqPEmFjVR4igpPU+EZKmyiwmYqPEuF56iwhQrPU+EFKrxIhZeo8DIVtlLhFSq8SoXXqPA6Fd6gQoAKlApvUmEbFbZT4S0qvE2Fd6jwLhXeo8L7VPiACh9SYQcVPqLCx1SopsInVPiUCp9R4XMq7KTCF1TYRYUvqfAVFb6mwm4qfEOF/1HhWyp8R4XvqfADFX6kwh4q7KXCPir8RIWfqfALFX6lwm9U+J0Kf1DhTyr8RYW/qfAPFf6lwn9U2E9JHCUCJYQSkRKJEpkSFyXxlLgpSaAkkRIPJUmUJFOSQkkqJWmUpFOSQUkmJVmUNKGkKSXNKGlOSQtKWlLSipLWlLSh5AhK2lLSjpL2lHSg5EhKjqLkaEo6UtKJkmMoOZaSzpR0oeQ4SrpScjwlJ1ByIiXdKOlOyUmUnEzJKZScSsn/UXIaJadTcgYlZ1JyFiVnU3IOJT0oOZeSnpT0oqQ3JX0oyaakLyX9KOlPyQBKBlIyiJLBlAyhZCglwygZTsl5lIygZCQloygZTckYSsZSMo6S8ym5gJLxlEygZCIlkyjJoeRCSryUTKYkl5I8SnyUTKFkKiUXUZJPycWUTKOkgJLplBRSUkRJMSUzKCmhpJSSMkrKKamg5BJKZlIyi5JLKbmMksspuYKSKym5ipLZlFRScjUl11Ayh5JrKbmOkuspuYGSGym5iZKbKZlLyTxKbqHkVkqqKJlPiZ+SBZQspOQ2Sm6n5A5KFlGymJI7KVlCyV2U3E3JPZQspeReSu6j5H5KllGynJIVlKykZBUlqylZQ8kDlKyl5EFK1lGynpKHKHmYkkco2UDJo5Q8RsnjlDxByZOUbKTkKUqepuQZSjZRspmSZyl5jpItlDxPyQuUvEjJS5S8TMlWSl6h5FVKXqPkdUreoCRACaXkTUq2UbKdkrcoeZuSdyh5l5L3KHmfkg8o+ZCSHZR8RMnHlFRT8gkln1LyGSWfU7KTki8o2UXJl5R8RcnXlOym5BtK/kfJt5R8R8n3lPxAyY+U7KFkLyX7KPmJkp8p+YWSXyn5jZLfKfmDkj8p+YuSvyn5h5J/KfmPkv1UjKNizVljKopUlKgoU9FFxXgquqmYQMVEKnqomETFZCqmUDGVimlUTKdiBhUzqZhFxSZUbErFZlRsTsUWVGxJxVZUbE3FNlQ8goptqdiOiu2p2IGKR1LxKCoeTcWOVOyk7Pkr+/PKXrqy763sUSv7ycrer7JPq+ypKvufyl6lsq+o7AEq+3XK3pqyD6bsWSn7S8pekLJvo+yxKPshyt6Fss+g7Ako8Xsl1q7ExZUYthJvVmLDShxXibkq8VEllqnEHZUYoRLPU2JvSpxMiWkp8SclVqTEdZQYjBIvUWIbShxCiRko63tlLa6sm5U1rrIeVdaOyjpPWZMp6ydlraOsS5Q1hOLvK7654kcrPq/inyq+pOL3KT6a4k8pfs0DI3xl5SWFfbxl3uq4Y+IEIkqyK96dkOhJSk5JTUvPyMxq0rRZ8xYtW7Vuc0Tbdu07HHnU0R07VVVVx13or1zeMze/JMu/bXv8d7+8sXVqVVXdo6bqR+392x75tuDy9nEdt1THnVT5QPbM4hJfaWl+UeGCqtgpT0fxVriIt4KPt0I73gq5vBUKeCt4eSvk81aYjj6sebwVcngrlPJWmMFboYS3Qhk6812GLkDcvFSIPkpXoA9rPjrztUMf1qKGx61llY1f3R+Waoabl6agN2lmw9OtM9EVGYmsAAuvgT53wg8L+C5JnY/YwfERHR/R8RG1/xwf0fER7WqS4yM6PqLOn+MjOj6i3l9D8BGPdHxEx0d0fETtP8dHdHxEu5rk+IiOj6jz5/iIjo+o99cQfMRO/m3Xf7H/w7mXtfgxuP18jH/boKU5LTo+1vut6rhzD0e38VAwxI670jDclTx0fc4tD45DhDJx3PMwHX2UCtFZg3seuD0oL3qT8A0KvnPtbXgC1AB9NGex2TBYw4tOAX8pWI7e6RJ0RdY41ywn+bet87zda/NS96TgmuUU9aNz1I/OVT/KVj/qp340SP1oiPrRaPWjsepHE9SPJqkf5fq3PTz2nfXnn3Xvo9VxHRse5+Sia9JidAo+dNXbADVpHnoFfOYrRa/gOAqNNLhZiN6kQyFQzq29y9GVQAX6KAXdhwL/tpvPoZ37xy/7MGhty9UG+BL1o6vUjwKVGs+u03h2g8azuRrPbtF4drvGs0Uaz+7WeLZU49m9/m1fXrNnZFHZiHGhZw9pvPeIxrPXNJ69ofHsTWWQ/ygu8F4w8qrQs3ec8wi8FZzzCJAKznkEJ8Cv8+eEiBqp5+ecR2ikasY5j9AwYt1mYnsS6NM7/LCAb+QEncR3HSfRcRIdJ1H7z3ESHSfRriY5TqLjJOr8OU6i4yTq/TUIJ/E9x0l0nETHSdT+c5xEx0m0q0mOk+g4iTp/jpPoOIl6fw3CSdyhvtoU+Mi523QImGLHYWkYDotzt6mRukTO3SaUeXDuNqHoVuduk7Pc1Plz7jahLAYP17tNDWDV8pXGYdrdGs/2ajz7SePZ7xrP/tR49q/Gs/3qZ1SI13qYoPUwRethmtbDFv5tt3ubP3hN15Li6rhj0X0NbgHivos0DT3wPNOxD4590P6rQG9SATov5aGP0mF5BwY/4NkVfR6K0CuUoHMrfrioAS4t40L2vo1/27JjZ63sdlzHt8NOQA//trf9HfIGnrthafjhuVoPe2o97KX1sLfWwwH+bU8/0/6Dq09qnhd+eL6WXzJe6+Ek/7bLAyWr/ktf+3X44YX+beSOudNSvs9whR/O0KpeqvVwptbDS7UeXqlF/Vot6jervyxFhTu0Hi7xb3PvqRjd/LWRo8IP7/Fvu2bQn62OGjJsYfjhUv+2xZ8/fnmHu4d8Fn54r9bD+/zbTiBT7rv7ySHnhx8+5N/254Q3z9tz9zFx4YdP+Lf5XanXv01yXw4/3KjVzuf829pv8UweU714fPjhm1qjtF3r4YdaDz/SeviJ1iB/qTXI32m183eth39rDDJJ13iT/J9/2w/lqae+TdsXVPOrx+ENLx5T2vDsWm7DGyVuFT+14Q0rfmAZ30zlNrwm4XvDDfCiPfdufjl6H/BZI/8QmLhL0DuNv+fA3enihmdQDkuzi6/uuWN7x6MP6wB03doAtwUbYHyyATaJWx5momu+w9IjOw59psvRmQ/fPhzJW2F8w4t1c1fgduG4HawcdJk+FLyZHHS9dFgGESZyx4mr45r6dxzjLS31lZTl5BZNL/aW5U8u8OUUlXhzlf9V+EpqoHIuKfEWF/tKquPSKlf0LiosLVtQubJPfokvt4xUrhpQWOab6itZNvqk7jEJCtH1Ba76s7Oj68fx0c+uXN7bW1Aw3xPCWT3CV6B0usLH2ZM4NYLIi/BgTVvyvGXe3kXFs0JdymbbxIDXtjzFcsuzbWj58pFlRcXz/TotjZqj3iv65vsK8mLCHhFdsQ+wonvlCF9ZeUlh5dq+RSW+/KmFNSN1m8LXl5b5cnOm55fm5tSyeO8Qhw87wOBjavm7JiK8bohvelHJrJ55eTXyE2q6zvM+/sqVI/OnFxf4apsY+a+65vh3tMsvzfHN9OWWl9VIUX5hTolPEalaESu+yFvqOxQkyio3CWoEyR5J6s22iQFXJIllz3CBpVq5bEhRRQSHh16rlcTkujeCLMG+anVM+lgeE0EtoxFjECkqHWtFpbikIie/NDvIsQMKR4T4dXgNu86PFocw9vygCISaef/obvrvE/X72oMephCUqpU5OaUzSsqqxYSDLDrDLIrOMH2V3mBEaLAO++gJx+C6PjWPFI4h7KsRvwzVMhxmezFEjSDzIRC12EgsmJ5pa9690+nFi7ZnVR/T4eNztzx4/MIWvxx1VvXG/vft/eu1P+IYb4HTtKkqZgMrqpra16x/U1e/n0Xh6s80XLimQ+kdCfOEIS9c3fWxpMQX/tdzaa/e9I05N7VNfXBpdMUBwYqdz0rYu+KmK6+N+3zVd7f81nnTuV3Tj+iZfvy7S95vVVgyvsXe6IoDWVXE3+BBwJEWgt6HivdcfEMWHy1V8WHFEvVLglqeQg8Sw4Zqba/8Qm/JLKURw4pvC4EtU7TxAWUbQmdaXCu+Z0UKKfOGqiky26p1tQQPDNyw4oUM8LKR5ZPZSsFB1q8Sv2xIeYEmHZd+JXll9oxyb0GpxiD2qVw5sHx68YApbONPrFxe83D+0QaQke0gYT/dqifuih5Ll+6Eu9mB4J5WUjetPvi0Sixtg45CREsFLkY07cAEnG5ZdZsbTcI/mrLF0VQNRkhfBYfCwAsyGEpJVxHF8xpBFYKbU5fqTYWGp5LA17j92hMmRE+YEKGXBhTm1epEaypaiCIeJhEir+6zxnAm8pH9r3J1rwJv7rReRTMrV40qGuHNy595myYPxGvaiEQ1+9W1TWTfj/hFYqvXMjwlv1l2Vf+zzJ3/qoUr5OKobFPIzNSK1hC9+XOvHqysT0Zd5C2MnEQpQk5V9sM9og54uIHMykG51DUxbl1TJ+sznGJQI9saH7G+066WuD7Yz1o7qdvbeI3eJo4NMoIo6hLQGcgE44FMvCAE7dKD9hjKmF571JU8bKuWDy7y5vk1RSUxGCjQFKm6wI/unCZGzmmEx6ZbyXPATQoxLcSzOqB5NNvvAfs0bpaSnoSoB1IKrw2M7F1Q9Kyu7mRd8Y5Te86rdf1jd2hFwm/6JX7/OEI5606IFDkhIluEzqIEYjF9SgaViIGC0q0kRjvOJijBBsKh5FByKDmUGjMlVeBCDPsBy4YWRbrc4WrKckzlpriY3+vclOhX2CVlLE9G1AmADDCK3UQ4JS4z4xbhjKp9h2B0TrpzN3k097tvco6+eOn0rbvyHrv6lO6/9b7ifnHgP9mz/XP7gANMhCVtwBF6PYs3in7pmU8477nYIjxYhWbdHUoOJYeSQ6mBUFKZT6JrPtnQjJb5ZBaPso75lNUW1kR/JKNVWoSZibforUgacbugAU2bOubOfftLNwiZe/7c+OHdAy8cP+KJsy/6c33rWZvHnjDUn2HUSL2eGS5a9XomgSm5zHCfBKLksoHPYabaoeRQcig5lOynpLKFLl1b6LLVFrpi2UL9/hiuC/UsBnzkNM+nRtvwl9p1Lh36TPfcnnvuWyJ6d2QmvXtZxyf7z9v6duH3dNg5G2ee1NKokSaWePq20NQyWa63+DLcVJsSDoeSQ8mh5FCKYdYkXbMm2WrWpFhmTTKj/Im9CyFiYNaSlq59Zc7E4W9fe3xnccbWPm2zJiVvPP6ajre3Pnrfrl1dpPE2Ry5lGwy2COIJcZn1GKmpoL4p4XAoOZQcSocwJZWFknUtFLv0iWGhRB0LJaqNmIn+mLJQphwCIwtF0v7LveCxV4ZMu2xb8aYj7zt9zOyt53b4ZHHbx4dku9bOfvluMysbYmZJacr2mlqtwYOQpvjcVIDBoeRQcig1DkrmDoy4Yhgbl46xcantkYn+mDI2pmy7kbFpueOEvo/8sWMVvffNJ27+/Oom37dsK59yz3fPrJr+6Zj7W/S50kwQlxjxhK1m1GXzutplwwrelHA4lBxKDqV6p2Rud0iKYTckHbshqU2Lif6YshumzLSR3Wjzw42z13f5pGWvDk1Srl30z9xxv8qXvH7BhF0bXp157T/bHz/SzCrA8KS+rRYRzn3O7pBDyaF0CFNydlLM7qR0zJh4X2LK9txOw2962vXWLvFB75TuH/9w8tKRvbquGXnSzLHOTooFC+XEmB1KDiVuSs6ug9ldhw4X7j5qzqDXR5x39YKRt98yoMmJI8b1vGZsvzMmtDn/Km+Pgs3OrgMvJSfy61ByKNX95ETozUboW3yy6aEz5vV9foJQ8ffjT00a8nLxDfszf3lr85ytz624gm753InQW7AbTpTUoXTIUHKi2Waj2a3+6Prdqg8GkBeL527dneL9Wc74fs2Y0e1TOhWOG/fmreO+cqLZvJSc2KVDyYn8HqKR37gfN7xxfuUP2Xl3Prv588rq/U1fvbDNlydfecVbk2++/6MHez/pRH4taHMnzudQQqbkREnNRkm7tlpZdH7P6vnCjBl/5X/fZTvp3Llrzyb3Jqw5edy/Qzt+/7cTJeWl5ETfHEpORLFeI4pdbx9zHt3xZWXboedtTK5evfqxNefsLGv3wNfrHhBe8F5eeK0TUbSgY51I1WFKyYm+mY2+xRWtHbAxf/3kuDbfvjpzw5TL3mn18xe3nNG1YuDyJfOWbH4nzYm+8VJy4keHFCUnUmU2UpXQ7b3bPz3hrVThk+2l/15QtaZiX/4rReKSp1r3Ky+J6/XuGU6kyoLmc2ItDYqSE9UxG9Uhl54yZ/HLUpfHyFUfrDhl4oyNzx/XrGzh3te3J477s+LO479wojq8lJwISD1QciIgZiMgrn9bPF/cbHm7757d1OXh62fsOv3pWVtWv/3B2vQ/b9u56fjzM5wIiAV95EQLAJScaIHZaEFqmx+O+G33CeP3bzku5ZMlrvJvTuzc85+ZXctvPOOq+/oJY990ogW8lJyVNUvBWVmDxDD+4Ze9K7PmSHuvazdw6an7H/bO6jVq6vCfTnx1gXd+2YpLK5yVtQUt4axCo3XtYbAKbbr77H/XdUuY/9mEnXd9c37vz9u8MTrviZ8Gz7o7pV/S03c3T3dWobyUnBVbtPw02hVbVvOsIePdqa+/MPjjigGb1/3Ud+UbR3XcddSzHy/8W06/lZzhrNgsyK6zuslvKKubhJe7bz1x2oK3b5/ZLrnflg1r7mr+XqtrbvmuzTk/DB555uMZ253VDS8lZyWQj7sSaO8+7v6mbzw3tHXhsOyFnwyfu3j63zubDf170SNNErbucvX1OCuB2BLleM1mveYuJ12x89Xnh3X4fsk9J9z+0J5TR0wunfJHs8TEhfPWDXx+86TZh5nX7HiYZj3ME/OGluzsdu+x0s2FLXp82FOa8O1Rv/1bOu37IzOk4luLTz218XqY5pSLFONzygBvjFe5mPLGYB9ANBL2ZUOKKvzsA2boRvjKyksK616pG7X4YEGsXFtLb0Bh2bDi24KP3TUNXDb6pO7h9+oKkl6FkeWT2QruYIFULh9YPr14PhXjKpcPLvLmhRohh1sT+YMrDLJiZFlRiU/dblf0L+4wqmYD46N7FB9uIHePNCskrB7sKy0ddZG3UJOMUr1mHAZMCTU5gZK/grOzbkBh3oGHdcJd94pQuUoh4pvqK1k2+tSTX2oXp/PXapNve4/qb6srl48q8RbP94frB9tsE6Ev3cOzyeNz28Yk5H9oSg0H5xQoY5JTpgxKdVxaSHWFBjJM9KTu+kTr/oTo+gJX/dl9o+vH8dHvq/Hdcj4EDeUt8yHEVT7Y21tQkOct8/YuKp4V6kpvbe2lVgyh96N+CQl4nxp1WFAwPzlSY2QbmiCRrxfZlkdSqFyuyH8NA2opRCNHJiSlmupSBKhS//o8X27R9OKiUl/ORfmFZdVxTQ49zhbN9sDsjAI4O2KG9Tlbk3/7qM2lmrNFy73oY1nCiZqzIyTawFkJc93y0d26n2a0aAIs2RXzpyMi+h5oZre4D9p+dsqsLk1PLRpWMeezUeuuzFp27O7U5j+Wn1XxZ3WROT9KXyRFtRoLIwbFdXVBWVBQ2zsmyDFBB/4OognS+ro9OwhBNzFcoUWdD51mefJc0YPuCnNi1C9uAxFMYBus6Q3HRfvbcVFKTJnfIyLnl3lD1RiJbVftYLTW0EOhwVBWfoAJ1CdCQkQASytUZ2NHl6m+Ql+JV9Fhpb7cEl9ZzjTfrJwpRSU5igOSX/NqTnH55IL83Jrn1XFDD7KG62dRw/ULyb7B7AL1lFUdoafpsnVms7blaQZaK+KXvnY6HtnojkfUvPYO2vzm3TudXrxoe1b1MR0+PnfLg8cvbPHLUWdVb+x/396/XvuDnYaQdudrVlDKLHgdakYIXdwz/tNya6Oqkm2Zk8pdyyfmdu2UnL2vecbCa3q8NO/qHp2OM5oQmHqqVUFN1EDxfEPoVqv2kHByK+/4OjYfAFfeTHwrUeWUutn3jP1XJsLojuW/uiP9VxeLAt1jMbKA7rB+VE1PAt/06FhQIXoSBJZCdByHaRinvo8kHiYRIq/us2o0EtmmBSNzWr+KeuQS1eQSw+SMICW1c6I/NYnoU5OoPzUJNk2Nxlgl6E6Nh22aahw9rFzokPOoyXkMpsbDSp2KT/SnxoM+NR79qUm0aWo8hlKjUynJcD51KiUbCszqXgXe3Gm9imZWrldUWln+yFxvgbdEKS5gZ4ow/0hi/5GsS9ZtQLZPMI6vpUHdloXRo2ZtvbVLsu4iM4VtEbfxS6wzfoPgxi8holWqtV1C/zozn22wGIg3CHO4gv5R0FtY21eRx/yphTUNve0p76Vlvtyc6fmluTlTfWUjvIV5RdMPGL75leuG+KYXlcxSeluirFIYwvMrV47Mn15c4Ks1slVV9bLQeUJpRVGBspzJLS8tK5qeU+KbUe4rVYI23Q/ykmaMxSXNGMvOvdyAgjZWF1XWI6SSet2ub1VcvCPNbVVc+lZFssmquNRKV4o2+KGNWpXUhXZuVXY5tGW6Wi80o6VxpLp3jtVrrqhuLmEcBouj1N8yA6WYGDIJMGRWRaO/5bFJiRGThG2Ni+FeRnTaHX4h4nlCeLxqjVBH8IZ+QvgV2EGEmLvw0RUSYlRI1Ny2dzP791Hb9okdguZQh/0lNfuLuu65bJ/uSrVVd8l4uktmpoR1Vp6tdVaKSypy6nyB3gdcgRG1nsD8yjX9fd7iniUl3llsdCFlfuWK2odRjkuKX9/H0caSJH8khA6yZODQhPadVpYc8LbuPsjuSx+L7kufBhyJ7a3jbtZqZE+kmop42WqLeqPvH+H58f4dRyoYzLZBaY6Cl1PsLSnL9xbkeGuBquOeOsicO9gi5w4+BI81ZJo61qC37xDl1fRTLwHqfumv6zwOUC9T634ZyC61I34ZFBEutBgW6GM5lORWS2IiCxYhiTuOqRXF8rKCGkkcfkCIBiky1LMwb3itBNVJ4mJdyRR1f5F0f5F1f3Hp/hKv+4tb95cE3V8SdX/xLA5qGnaHI8qSov8LrgnVHJPENPy0mAwzXA2QzAVQrgZI4QKYrAZI5QIoUAOkcQHkqwHSuQBy1QAZXADt1ACZXADT1ABZXAA+NUATLoBZaoCmXAClaoBmXAAa+6rNuQA0dldbcAGUqQFacgGUqAFacQFMVQO05gLQUChtuACmqAGO4ALwqgHacgFcpgZoxwVwRbTr0t5gZduBz0B341/ZdtBf2ba3aWXbQb2yba+7zj+SbZpqz+xI1hLpkDtSTe5Ig224I1nbZDtkiv2QqfZDptkPmW4/ZIb9kJn2Q2bZD9nEfsimjWJ6mtkP2dx+yBaNYixbNgpWb9UolFvTRsFEWYcrE7VuFALZplEot5aNYiyPaBQOTHqjmPHkRmHHG4fRbdsoWL11o4BsHLanaaOAbGcc2YUculdHdsF3BdSn+8TACqNILyj+cFJ0KCHVILCSxovNHVhJi25OGtsy3aBLGjDBwE0Ts2/NaJ76sx5vpKl5Iy3mWdl0w0iNQRgaNIgn6h4nStc9TpSme5woo26jL7DeKMAObBjPIDJUVCKWBjCjxjNjBEnMQQZTUDDsx8iYwYlTg3t/LoO7K26DG5KJRheR1Wd+QkXVyV7mjkuCwVFij/YZJLQTXYEnDukjXYENwaMRT0+tu2FZ4S3IV3bt84sKwyeRMxr95crD6fp4yiF6ETPyOEL7iOMIg3yzxoQYt+7cnN/MaQO/0U670bk63TMPhog86lorx8MTuRf5cqflFJYXFORPyfeV5Phm5peWlS49yAKbbVFgsw/BE0xJBieYEC4XYJ7K2xSWvbwiX+nQIPdl1zCf/nEUcb7WcRmO4ysGCVFCR/yOLiwqy58yKye3xOct8+UxolFU4s0t8OUUlxTNnHUIHk5t9ALisXzg1vqoxKnFIOKAbaQNahc+uF3Ldb1rmS4kEFVVcO4OcXCHaA4uKvMFmfcSxfUv9pVUx3U59M6ocl4Ttn6CEsDACSx43b380GHOUIGlaspx07vYla17baKv5WsT/Wy4Jc5xA53zbKpk6zVnu26gewA30NXhEJduOMSjGw4J3rhtY7AwT1AvokNHkPXSNgyqwz3GsrIdjK9s62eNf/QhvcRvH+PWlka+CxfTCNbePaNn7hQDVVV1h5nFkakD4ZpXmBJEM8fB7zB9BFv7gpSoXSdCLoKGfk1Fvu+SA9a9Wniv0d/1rlUrzS1HAUTLhk3PrA/UjES6osz6wHCBPdOvZ9UH6lr1QbpWfXDdYLWLVExDdAM1Q1n4iF+GqR3sul+Gq4NJdb+cp2uZRqgDtHW/jFSHg+t+GaW2R3W/jGatmVV/YIjRDhfQX1RZGw8LFp3nyyzbBp064PaZKk9YNq+jFFW/L6+0RNXvZ1Hz9DcbWa2rP4Dr+LUQmedd7fAIYEcypHkPco6p6GQyCexbcMQEg00oN/tafdPTXzTYN1P1k3IqeuQSASPHmfArYq/Node46RksuCG6Ls6yFU3gSMUVO39XsplKKWYqpZrJFJZmhlK6mUoZZiplmqmUxZOdsIlBOKYpr5XmDsc01dfOTXi1c1THmhp0rBkfdiJ/x5rpd6ypWd/JbPN1DVdzNaM0YamoFFVzthc6oM20QLVjBRsitmdrIgSlfu2FezNBd3ne1B9eZmuvtxMEzSV2zZGF+olGJGp3KilO+3myzvMUneepOs/TdJ6n6zzP0HmeqfM8Ky66x6HVgfbzvjrPB0BxwiatZvJMXqtnzamKY9gf42z9tbYRcfVIkedXLQGBPawZRXhtVaBaX0kTdCVtsDZw2aRiiWHkVP/whoaXyGwFwXPLiQZupwN4eAAydqi+2kgMnIB+qiUVYYsm8iaqESPSFsJT0ZFwfCoaMSLdITz/L3uAwSj/LzyEQsIxQIOgTILlUKjMsaIjLJXoViWzRasH/l0cqz/CUoluVSpbtHpVIJ5jpUhYKtGtSmeLVs/euzlWlYSlEt2qTLYIX3QymB4VZhZbjP6YQTOWIOtoRL/ILlf00hdlcl5y0T9NobeT3jd4EPwm3UVR5JYsA76aWa+qrsg0o0J+EHue0VksSM/idHehBMsbch5+50vWd75Em5wvmSfZqJttmlGIjkf9uw2jfrGsqAPoABoHi21vo9Xznom6m+AhJfmArrjqKMmIZP8aX4CjQtMg9joOh1S05pAaKRe1+xiRExueDVjUdx9dbFEHMd4AUe0+xrNFOGeJRs6fSSdXNHLdItxc+A6MaOR4JQKkKskQU+02JbFFuDMtGrlNEc40/ABiZIb6KEwPWzQ4rwfZfupr7KWYStbGl/0x/6Bnf/RZzf6Yh5D9kS95Y5nV5I1FVpM3TrWevDHKEjU3cHdb8Fm5Jvzubgt9d7e5Te5uC7XcN9d1d1uyTVN5BC1Z+dch11JNrqWBk9ES4EGbh0yxHzLVfsg0+yHT7YfMsB8yy37IJo2i400bBRNlNYqxlBpFK5s1ClbPwuBL9dqMUCHJ8hWQpjzftErhxea25CkGn82T9K18CjDJy9ql+y6bsKT7dRxno1LMnI1iXAOr4e8s3VtNqbq3mlJ0bzWl1Z18p8J6I1ce2DKeUWSoqBg9JWYcx3hiVAlZJFYeDL6YY5AgxSjpSpLRZxF57otFfKNRPzmMUbKWRINP4npiXD2SV2bPKPcWlOpsgvXVDgi1CPHQUxzxG5d+RAgSv3EbIPa3KzLi0o8ImYyLuPQjQpCoSLIWIsOGZiIYqYaYMTbz4FtxrgilY7QVB9/0crHOheGmlw5mE0NMdUSoCVvU/3Zf1AUKiXd/JyhPm3TPWcocJwKbhiVNpWkjNv/0OtQUr0PNYnZI49xks7CgG52alHU71AyvQ3LMDjVVd0gO6xlVh5qqTZC6QzJeh9xmOuQOqzmjDiXodsh9MGcoQWuGGC2r6lKC2vw2sDnSvODEKHmjLiU3xllKM+xSamOcpQzDLqU3xlnyGHYp62DMkhizS+4YWz5Gu8hNdLds+4W3bDXPpkwLNXmbru3XdN9lI/ddAS5k3Pdof6cZ21C4x9HMIIhB2NcMziJFbIHoOgeaPY436nFzKpSHevy2QYoQaxyWqM9hzWNymNHmgoYT14JlRL0ONcfrUIuYHdIIdLUwcOIi4pB6HWpxMGeopcEM9TbskLvxzVC2YYcSGtEMGTlxLSEeT8ObIyMnriXE42nAs5QWYzeuEc5SRoz9jIMwSy4zQQWXoRPXTO3Eqf2RfrpnfPvpnfGt+93+lFNUOLTzSlMhmFhatWkS2nSBbZl86R6eTR6f2zYUZA/VD7Y5SEhnPPXSiLGuXHQdoupRPBVo9K5GqCWcaSsk4LSI4QoRlBN1uMwTblqQy16LGhV3GCOKyzzhV7R5ILp1iTGYxhNdwROjQpImlyUyTBo1J0lUeFmPvWTeczfBEXtTZ5ZFm/g5+eWNw3b+UdwxNj9bJPToKcedkTyu4+yYhPw7jqpLOBpMlauTcjTtIOco62sxR1nfBpybrLdmvCI6N1l2uICYcjSYRd7qrd2+9ZuNd3N0dsJgFt66/IQL7M0IsIDrPnpNd4PytqFEgazw5eTWDE6JN7+wrLTak3SQhetyi8J1eR3btLScVdZtOcuNnpD52DYx4Hri49MVnym64jNV1/+8SNcRztf1TC/WDepO002jVVA3E2ebuW5LLN8SmW5Zy6YabHXqHTmRdI+cyMGViOt6y/pouuXRSY2RZj86CWEwiWDz7p1OL160Pav6mA4fn7vlweMXtvjlqLOqN/a/b+9fr/0Rp07iZz77ILCibDHtYJLFtINpFtMOpuqnHQTqmKj6Ay3q60EW0yYO5jpBrzo0MISZd+GaDqV3JMwThrxwddfHkhJf+F/Ppb160zfm3NQ29UHVl0WGBit2Pith74qbrrw27vNV393yW+dN53ZNP6Jn+vHvLnm/VWHJ+BZ7oysO4+iwZ/xgVcL54bx7MFH1z+O8YRtVfQTn1eOo6iPBX9eLqjjK5G2RuuqjTd7Yqas+hqt6bnT1sSbvytRVH2fyrk5d9fO5qk+Jrn6BybtKddXHm7ypVFd9Alf16dHVJ3JesImqPsnkDaG66jlc1Uuiq1/IVb00urrX5P2ouuqTuapfFl09l6v6FdHV86IUBdmWOanctXxibtdOydn7mmcsvKbHS/Ou7tHpuGDcwCA5CCzJZJRj6QmvKFTQyXw6eCf/iexk/VPXHl6LCz/l6DHwhzlPoX9u7piy6jxuKvtbbbRqgDoSnspOO/wEZqpebC70RprOBe6Ib0+qt7/T+lllGiHO+NKnieQYKQYczXk8vj0/R6fB7hFY4eg0w+PqBjdYQWTbVa7uVeDNndaraGblqlFFI7x5+TNv04xfJbO9ZsgxE2l1sdjO8j2Cz9Un2ENLglo5G8crFIkRy3+1UFBXeR30eOP7xCaYO82AuTPQmTsD9iVkK8ytkWw3zYC5M21lbpcmc2ew5JiJtBotPteANfUvKnnqeGuqbhIBc2zroa7cOuiLje/Rd7PXy0hHZ9t0fC8jnc/LyLCVbeM12TZdk4PT1I2J52vMhbqRzgEGt4VS6nirQtdh0mFblzHbplDXeXXQs4wTUNjMtgfVlfDguRKeenMlCIcrYX2/ajacbSMuwNUdHrlW916WOb5NpK4eQewbjPZETDFuogHjpqAzboo+4ybaxLgay6tEA8ZNs5VxRU3GTdHkYY/lbYl7dXewBhjcBo0PMtdC3RRTsZN2aTFuPHV1DWLfYbQdaIpx4w0Y14POuAbfmIy3iXE1UjzF2xeOiMG4kibjejR5ONHybtgWOONGnJWvY65lutnWzDGui7paBbFXWuauNN2VWZw238VF811chE9ft4vpj9zpZN6JM7BSGQaOVyaPU8PJbqKttsGDZxsYp0Y1bayPER1wC03qSA4Pil2v6gLmIYatxEYYtooajfSIFUv0KKazUgBfkaUbTEw6KzwcRikRfWoS8Y1SoqHEmJpP+Kww5i9svNYPKS8oyx+Z6y3wlijFBaxuI6w8sf9IJxwdZL6mbCZ5gpEdH2ScqHFdLeKBjZ9hxQsZgLpTyxo+bR/9WmmqWp5wLd1pUAa15qsrWtZEN01VsH0RFdPDO+4azmLgrZBpe8WyXktXa4mQnYz6JVP3kGQWO07cljqU4sb1uilLrZuF3aM1tvFGY+sJVIcaQw2Yqmaqw/+MSF6iW8kTWSmeraSOHwEPO6Qb8PCykeWTNcUl3nLwLFOXN+LUn1TTFQIAb2SEpmM7nDc8LHV9I9hUkwF+DPqz3+q62ufpnmXsoxsQ6RM6L6+1CgMeWhMO0sSlq9OcWBH4DDMCnxYxqUOLIr3c8Gs1wq4rExkHZCI0JUwHoy86M7sSaXUnlKNfSVNNIFj4I/Y8dCulR1ZKY0dQt9KBvNmaQ5Ouy9Aj1AzNKKcw42qmtPsk9IKoS0CwvPA18TlFg/RzxCYnTzI8GKwfSdLIQeAytAd8aaPHG+2jQQAuVQO4uQC6Gu/SxgaYaKTqIAA9jTY2IQDFVtNGz7KaNnqq1bTRFVbTRh+jBmjOBXCiUXZpCMCx6lTN+jqlFZ9Y9+PXKa30dUpLm3RKK8Oco1Gj0ZptmkqntGYViA651mpyrQ3W9K3Dx2LtAmR0lM1t9NoNOM5uwDH2j6Lb7jZOtBswx/5Op9vdxlH2tzGjwbN3w5eXCfZPS+bhN4pjG660YI3hpAbf5XENXm+PaQSGIOtwVBCjGq6axWLuCxs8IIKD3KTBT4vtnHh+gzcEOQ1+DEc3eMtie5cvaLhdDhWbNvh5Ht/gp6Xhe7I5DV5nj2m4s7wazQe7oMFPy8TDyO0MFZvZ3cbJ9rexud1tzLW/jS04dqyY6LLe6VDDba6InFLra3NKTc8vzc0pKJpaVbUwOiFUXb3BlWv6+7zFPUtKvLOYPkh9dd4fqP2+S1ioSh1Vk496Re2L87V+7KuZbEpVpXZPN5zobq3lyxuqM6UZwd6ZOOCaHtxFd0vwXXTmqEoWeOMZdr4lI7JSOqhSeuQhlYxwMd5o+w002k3UJxpCI6T6ygnTbu6ZyDJzSCWDpa46lMEoG/WmewYVXghx5bNIx1TetXzWJEt9TExv/ENfwOltMDOZ9XTSJOKIUNRJE2bW0g1PmmTpnDTJVB0jacJA6pw0Ya8dxjppEiWGTUACn6Uru5ngkyYZLCVrJ03e1T5p8kHohfcZpaz56keWr2TGqdOAMlD6J84kg4NLrlCzP7cfwRVuqNW+mzhRHa+/Me6yaWM8XivJdcgL0Td08YYf/PDokdP4iojbwPlys/MVfVaZOeyZwtG9eAN6KQbsaHS43o3OCm78w/VuQ1aAHy+Pfbg+zfrhejd7nt4TedKew+M2OFzvYovwITM4XB/h8pk7nex747kqg6OuOrWkYAHxLo/s3OWxcpfHZT+k235ID6J9lBuLfYyt34w1aVi/PTa8qNSXn1dU2H24r2R6eZnyZlGhn7U5Eqs+JDNGfKCR3YzXd0TdkY4oUykB7fNRoSS5bpeu9eX55hqj3Y2+uObm4Wo3Ole78bnabWiA4QNsjqvdLFcnYHC1+qQ2xLj+9/vjnTQmPEZVEizopsK2niLABBcZpAhIwEsRkKBrXCMyQxk53i6O69IpUF/eLshQ7MH2NnIpoYPKPq56YR/4AJtTQh5WCaVIZpTeQOPvo5tWQscgZkIwwQqNLRNCbE3CnQshtiYxm16hj/1t5NIkB5V9XPXCPvABNqdJUlhNkiZxqDsDTRJxEd/udHEu+5b99qaLc+Et+5m5RU4XF/ERcS0BNU4XZ3FuExrq3CbgzW1Cvc2th2tu9bYKG1rOMAnPo5MMpoY7ZxiP0830W99/COaopeRiQ5OaZM5K68XfdPKCRTg26h24dEouMshUFuxJoe7s6KYjq8Pop5ltV/4jBD1DPYcJQJ/2WMentcWnTXB82phm7qCyT0ID82kT6tmnTTDr00I1SWdnE8uWTawE+7eH7NsXi6VJrOyK4TnMcmNxmE3lvzOnSdJYTZIucag7A02SYriCSsNbQR3UbwDYxRDpfCuojHpYQYG/AeB834F7buvv+w4pXHOLF6W0NxU8YpTSKCjFnQqex+lm+q3vP6SEFn5PG5rUJHNWWqdShs4yNcKx0Tq/TTYCVsfP6s6OmdVxCpXfC0E/b2SmeAyf0Y6hZDB1Nq6J0hvLmijBPglKw5SgbY1CgihilMZelqqfKE2DZqnqRsFSHwGU8ud2K+WNIehdKqWMsEHsMnBrJPuWl+m2Li8lvOWlZN9+TBoXG+tPQ4TnGWSOfeqpzABIkMan/zJiSlCmDitnRIihipkzKdmDGPCyl6Uax4dDUVnqv0bBUv/EVsoi9zd4DZVyGpWXhKBlo8sWCRzXN1wGSjmBfc2Anscmeh4gvfrun2QTPQlIL8UmeikHs39R4iEbaFzO8MA+fo3r0te4sk0aV2OsZPvc4L3m3GCXgRscurMpdmgMbrDYDqBxO+rOTuwPiaVqfkhMnhcCP9Zq+vI0y5+43ql7cUS2eHFkn/7FkZDfLnNwQhrbR+NrW1a/HP6F7qCk4Q1KqplBSY2YL9RB2aU7KKkNl1OwB+VLh1PUf185nKL++9rhFPXfbodT1H/fOJyi/vufwynqv28dTlH/fedwivrve4dT1H8/OJyi/vvR4RT13x6HU9R/ew9FTsG7lWciyHhwbuWlmjmIGvscfIaZq+WZwAuh63pmj+zW/bTswtySWcVlC1kpCuxl5zqNDQGy/8gM7NU4/84VjdtrdIUMApCiy+0NbVcxtV7Yz+wxepMB5no+me9xIB1IB9KB5IXEy2lkwkgcnJxGsX0Uu27YSBYdG4iP4mEdkbQ0fX8F8fZ688Pw9nozm26vp7K/BTd3P1VLcSrARUk1xew6m9GpEcyvcQBIrI7ui2gbSwn2spSIx1KibSwloLLUd42Cpf4HOFaxx+6ECFeFoH+yzLfNDDqgsr0MEwVb8Jte58TYZ0Zkje6JVJ4eAv/TctyGo3si29NgC/61cCRG1j4SMz4ILsVZ7l5bk0nelImPg48M84mJYNP1s6CaG5cEKo8Igbt5eFLVNF03NMlc05KonB0C17jtm8w3ZefAO5ek7lwG/00Fw86lUPm0EHgTy07GRHjnktWd0/2+Uaq5zqVSuUsIvLXl42OXwzuXou5cO/7jzIadS6PyESHwIy2HzJbAO5eq7lwn3UWGuc6lUzk9BN7Z8on7p+GdS1N37nje05gxOpdBZSkE3s3ynegd8M6lqzt3Cu/h/hidy6TS7yHw09Sdy+Tr3B/wzmWoO3eWXueyzHUui0rfhsB7IB7STmyEh7T1v33jMryswJPcxwO7/5BgP2SS/ZDJ9kOm2A+Zaj9kmv2Q6fZDZvBECzhjQGn88i3hRwskw2iBareYaZrRjdREm+7HMJ+zcwAdQAfQAdQEtKqbE2KH9KTLLYSFJM2wkPRcCPwqy12QdV1TE5+klcx8kpbpb7zu0SnR4tGpNP2jU1LMo1OywW7LcDWDyWzfVli0wLbOj4g2PxLe/Ihm5idUqS/v/DRu+bHaneSDIYFyzBnWXE6uhjmV1mVQ//jjQZBBt+XupKDdbbWkZV1aWpZlP9Q5dvSsNT3bP4ae1e+suHKEr6y8pDA2X9SRGsbCRH8qm001UfepbI6zy4m8TMO9Nk/EP7ucaOgP68feEus7UBZvG2SsJYL5NnLlYD6o7JNQL+wDH2BzOZgT2RzMHp6EKQY5mCHfR040jFjrbWGrKyVGaCejj67pfs/0QFO0VRpYSQ5km8G5Ae8KK3Wt7Xfps5ARaXEw3MWEmIbK1Of6krR0BDMmKi2RxE46nE9JeIr0jaILcuREiS3o8lDWsiHlBeF/ZgB4qIm6rZkALmqqw0VNInStio+aUmkPw0c64M0M48x6LVJXasa2K1oqm7LFaIeC6UbTOodCd9AzIgU3i0XR2140ySBZzM6lbnsyI5kA8g3vLK3sbrGZoIkOE2QZM0ETKv0TmwmammECDW5uGjF8UUzQJIJDopiAnclYTJAeyQSZLAr8OheICTKZvXkDpoxgAkhO0UytU/ixmUBvqzzTmAmyqJwQmwmamGECDW5uEjF8UUyQFcEhUUzAzmQsJkiLZIIMFgV+Xh7EBBnM6RMDpoxgglQAE2QY3qK1kunRo3kYRG4amwmyzDCBBjdnRQxfFBNkRnBIFBOwMxmLCVIjmSDi4wLwmxYgJkhnzlcZMGUEE0A+ZG18a9hK8jmP9nGnI2MzQaYZJsgwdG7SVUyQEcEhUUzAzmQsJkiJZIKI7y/C7+iAmCCNOUFowJQRTJAMYII0wzP6Vr4d6NE+0HdibCbIMMME6YbOTZqKCdIjOCSKCdiZjMUEyZFMkMqiwG8ngJgglTkja8CUEUyQBGACjfYkA5gAcF/Co31k9ezYTJBuhgnSDJ2bVKMk7GkqJmBnMhYTJEUyQQqLAr8dA2KCFOYUuEF7IpgAEmZINtyHIbwnzpONmSCFygNjM0GqGSZIMbRrycZf8YpmAqYbKbGYICGSCZJYFHhgAsQEScw9B4P2RDCBZI4JRDPRlQj1ET3gSRH90B/wpFgDLukG05I5onqgAU8A3HkxOEpAuIKdBmMHCXcmmFPnehdjEowlOYnKk/GDhkJz/aBhUsygoYZKSIo5NamGrlGC4cVEF8d8Ww4aJsW+p5ZkJvAvao2aAW9GzHbMhtRR72fBxiTFtDFlAM5MwOPMlJicqclkJtyciEuxRp8wFjlmG8SZosEF0ZTYF0STzMTzPZycGfHJ38NFQxFDDeXhGFsQH3hAGmoPB0+LZqxnGth6Yp2UsT+/nYkASLohH2TUp6WS2a7E/MhAuhlLlRZjAAzXfVjncdL1+SA9Jh9oTqmJaGiGIR9ksuNgImLVjzdIGJGrUTNIuMZUkNBlRkYiem8YJNRjkRQ8FomtKjLNqIqsGBvBKhaJCKfbvr2hOknIcLvKl9JQIzwaIfZiLIXTnEREDpDcS2s8Uu/mJMVMuKsfb5g5xViNKGHmrabCzLFZxDjMnGIcZtZjEQ8ei6SYsTQpqJYm3f4NMv0VSJrBocgUwJc/l40sn8wfFE1TV0sJ90Sv++uDzJ49o9xbUKpz5CtFm+E/CvFAa95ldAyjrCyjPzEVr08wo3DTjYwySOG6LEpT+0blt6VwtMRjZkIywBMS0xRzhHzMO5A/AkI+6Xgs4jLDIi6LLJJmjkUsb0Hpf8feY05xauhbT0zFmQZTnDp7kf/GVpwec26Ih7riYivONJvOZKcZuSGgAJiEJxUN0FP12GrJPIYtiTEhMcWTQ3Gadpld6QDFmYbHIpIZFpEsskiKORYxHyMNKs5CjrsK8WbioIZ3FUxempAA/KenK5n2pGrryg71cPVgpz7/eczE6GN7VMYHrBIN92rqdRcxyJuBZRxcnxiz//Fag2bAmvFsEd4QEeJc6LCmx5g1U6jrZABruvBYM/Yi3q7U3xHn94xSssdzzDeINePVjvTqaH8zsNBW0Uw0FE31174T2SKPSx1boNNiW+1UTffV1RfAmvF4rHlQHDtjq53IMd8uXdaMSF0V9Vs825U61ryWQzRNrcPTjFiTbx2u1RGXhaO+qdoO5TgAaybiseZBCdbYtxIHsabq80mJbFdqWbPCVsk0XugkmlroaO75xpZnwE2EVM0YketiAGem4HFmhpm9vQyLe3vphnt7HjNO30AD7vMY7N8FrzVN5WAIU6eiDDkz4hAAvCEyKmdeDuBMz2HFmTwHE0CcabQlFOTMcVFE62DjoyMyTGKViNlyh1+IeJ4QnrK6SIDr1iBj1v3iCmMEhyW6sku7de7o1rn1JiYIGF0hIUaFxEi+jiYTH+bpYAXqujmYA0aVUoMEv1GQ2S3ug7afnTKrS9NTi4ZVzPls1Lors5Yduzu1+Y/lZ1X8WV0UGquFh0BOrwi/PPr0u8y+F+zY8tHdup+mepUJxsixDsrLNWF1zSZI+pXEyOsDRil/bMx5LWpPQ2PKeR3hVatUWyiaN5JjCc2EAPUBudIhxaNPSzx+OqR4w72TqNFws01TjaKblQkdcm41ObfBxLhZiVPxiP7UuNGnxq0/NfE2TY3bUGJ0KiWY2QszjpiH8xOtV9RZWf7IXG+Bt0QpLmBnijD/SGD/kahLVjYgO0jlbMps0aowutWsHTI8Kr+n7pfeBl6PzG/64oOmz/U63PRFLOq00t+6toZM/UsGsUIp6FKE/YJofg7xfHhgTz1Zf2BvPod27h+/7MPK5aNKvMXz/eH6QUYKktS/jBbyjTTbLEL6Y7EXX16zZ2RR2YhxsXtRrxzIdNk8n7nbwvksYommz4MGVyfjI32fiP0yA30N+eL1KKvf3L7IKDkdBGCG1Y92z1QDJMG+NxZHNORepvGzQ6L8uYEXu7L2fAfLUHXcoJsdMLmuzv2ju2kYovM0WpNMXV+GmK6XkU8dwSKhpmQbfRsMMrrluts/guWPV53D7yuk6vsKKTb5CsaX4FQ7DkzTjHZP3RyBgzQDNy6NFVS7IOt+G2c34KhG0OkL7AacaDegt+FOS91vk515bojznNvgGWes3YCTGrxOvLDBT8rEBj8pDV8jjm3wfDihwc/yxAYverbzYY7dgKMbfJcbsNNpe5dXo3k3DX+eG4PT6Tn8PLALHP+m4Vm+hi98oxt8Cy+0Xz0k2g+Z3OAnJsd+g68bxXSrYqrM7rXWRSE3jb/CKIINigT21N2mEoxi00Bs7hCnx/DLObrhTw9wW2bQ0pwWHR/r/RbHEbvYJ4STDWOmVuPEZ+sePov6ipykHsW6X2SWeHCz8Hqj4DiwZTyjyFCp5896u+yHJOYgg5uBDEszcqs6nVRX7zzd+3l9gns1bg1hlbm2OnKiiSQb6AHO3YZu/HogRV/Wk23a6tA46J0cnqqo0Uhlm2aUzM3NsbOSasBsqSxn2AUZa9VpFnCU3YBj7AYcbzfgaLsBL7AbcEKDZ5ux9suKbHcbL7S/jYl2tzHHbkBvg1cQkxuBmrVdoic2+HnObfCMc0HDVRBYXbadbSYdfvrG67h1jjE9VJnbdnk+v+F2OVT0HI4+jsd+g89xRpSJZ+ocPv3P8hWMkxG/JH0yfxwj0eAMdoJ+jCMRGM985NuCy9vHddzCcSEjdp4Yj2FgxGow6ESDy7R68cxE3XhmilE808PbMp5RZKioxIP5Ncnc1BhBuuyHJOYgVfHMBFZu9eKZIwxyTbuYiCbHhy7Ya5TBixVr+yrdzZ9aWMMftz3lvbTMl5szPb80N2eqr2yEtzCvaPoBnTW/ct0Q3/SikllKR0t8peyR9vmVK0fmTy8u8NWeqK+qCl120b4mrHP9K36lOhkic5cq+qJuPHU3i+b3kGKBKqCQDGlWUN02FsMVIignhl+IeM5k6ArOV2bUqLjDGFGXpz3hVzRblxjdOl2VFQSMruCJUSFJ8/J0iEyCak6SqDtV70oQ98XW4Ig115ll0a47SO7h2eTxuW0BN6msEWq1ybe9R/W31SYuO3FeP43XvbwZZ5B5mhhcxdPkD6NrUK7QjZRsU9egEvQ9Jlfk3fAQQ4wE346S2XZyeWZ1pPpo+mXuU0NMe5wt13AI37Trp/aNM7habOIuJQlNbiF8ciWI0TsvNII9jLbqEIfDxJU/GW04RjDDYdHOW1Re13+x/8O5l7X4Ef+mJjG+r9gNYDo4sgpwngPZz7+2ScDPKmB8C93qeu4/5kr6qlFFI7x5+TNv02S2eE27kqjmdPWqJsFgVVMnXYn71V0RebtilTv/1T1lMEA3x8jIkBTrbti6dfIvSRFKQeNsk3t8CPx8AxUhx7wN7tY1kQbfD1XlPo9nm663WNLKfq7V43iNHidS94Wx858nxv4yqKgNnhs7/7nHUNrgK0QP2y7D1J3RmXRY4YqVSSdR98PKRL/SgWT4YfaFeGVR3xKOWPlDfSE3S0lPUtQDGRLBgYZGNiyEmDmZ9FPrEN0UBEP4fQ7JjH8doaoNPlIcMSkRyayhMymB2EyfkkElYqCooKmhiBlKsIFwKDmUHEoOpcZMSRX4EMO+wLKhRZEOeLhaTcqSaFeFSURTlz1R9Qq7ko3lzYg6wZOhRrGfCMfEZWbcIpxStfcQTCUj3bmbPJr73Tc5R1+8dPrWXXmPXX1K9996X3G/OPCf7Nn+uX3AASo21ZIRR+j1LN4oeqafJBHKexHZheCBLjTr7lByKDmUHEoNhJJ+1i+V+WRDNFrmk73bpmM+ZbWFNdEfyWiVFmFm4i16K5JGFC9oQNOmjrlz3/7SDULmnj83fnj3wAvHj3ji7Iv+XN961uaxJwz1Zxg1Uq9nhotWvZ5JYEouM9wngSi5bOBzmKl2KDmUHEoOJfspqWyhS9cWumy1ha5YttBlxmKIuhYDPnIRO7f63xjoXDr0me65Pffct0T07shMeveyjk/2n7f17cLv6bBzNs48qaVRI00s8fRtoallslxv8WW4qTYlHA4lh5JDyaEUw6xJumZNstWsSbHMmmQuvmfrQogYmLWkpWtfmTNx+NvXHt9ZnLG1T9usSckbj7+m4+2tj963a1cXabzNkUvZBoMtgnhCtCFGaiqob0o4HEoOJYfSIUxJZaFkXQvFLn1iWChRx0KJaiNmoj+mLJQph8DIQpG0/3IveOyVIdMu21a86cj7Th8ze+u5HT5Z3PbxIdmutbNfvtvMyoaYWVKasr2mVmvwIKQpPjcVYHAoOZQcSo2DkrkDI64YxsalY2xcantkoj+mjI0p225kbFruOKHvI3/sWEXvffOJmz+/usn3LdvKp9zz3TOrpn865v4Wfa40E8QlRjxhqxl12byudtmwgjclHA4lh5JDqd4pmdsdkmLYDUnHbkhq02KiP6bshikzbWQ32vxw4+z1XT5p2atDk5RrF/0zd9yv8iWvXzBh14ZXZ177z/bHjzSzCjA8qW+rRYRzn7M75FByKB3ClJydFLM7KR0zJt6XmLI9t9Pwm552vbVLfNA7pfvHP5y8dGSvrmtGnjRzrLOTYsFCOTFmh5JDiZuSs+tgdtehw4W7j5oz6PUR5129YOTttwxocuKIcT2vGdvvjAltzr/K26Ngs7PrwEvJifw6lBxKdT85EXqzEfoWn2x66Ix5fZ+fIFT8/fhTk4a8XHzD/sxf3to8Z+tzK66gWz53IvQW7IYTJXUoHTKUnGi22Wh2qz+6frfqgwHkxeK5W3eneH+WM75fM2Z0+5ROhePGvXnruK+caDYvJSd26VByIr+HaOQ37scNb5xf+UN23p3Pbv68snp/01cvbPPlyVde8dbkm+//6MHeTzqRXwva3InzOZSQKTlRUrNR0q6tVhad37N6vjBjxl/533fZTjp37tqzyb0Ja04e9+/Qjt//7URJeSk50TeHkhNRrNeIYtfbx5xHd3xZ2XboeRuTq1evfmzNOTvL2j3w9boHhBe8lxde60QULehYJ1J1mFJyom9mo29xRWsHbMxfPzmuzbevztww5bJ3Wv38xS1ndK0YuHzJvCWb30lzom+8lJz40SFFyYlUmY1UJXR77/ZPT3grVfhke+m/F1StqdiX/0qRuOSp1v3KS+J6vXuGE6myoPmcWEuDouREdcxGdcilp8xZ/LLU5TFy1QcrTpk4Y+PzxzUrW7j39e2J4/6suPP4L5yoDi8lJwJSD5ScCIjZCIjr3xbPFzdb3u67Zzd1efj6GbtOf3rWltVvf7A2/c/bdm46/vwMJwJiQR850QIAJSdaYDZakNrmhyN+233C+P1bjkv5ZImr/JsTO/f8Z2bX8hvPuOq+fsLYN51oAS8lZ2XNUnBW1iAxjH/4Ze/KrDnS3uvaDVx66v6HvbN6jZo6/KcTX13gnV+24tIKZ2VtQUs4q9BoXXsYrEKb7j7733XdEuZ/NmHnXd+c3/vzNm+Mznvip8Gz7k7pl/T03c3TnVUoLyVnxRYtP412xZbVPGvIeHfq6y8M/rhiwOZ1P/Vd+cZRHXcd9ezHC/+W028lZzgrNguy66xu8hvK6ibh5e5bT5y24O3bZ7ZL7rdlw5q7mr/X6ppbvmtzzg+DR575eMZ2Z3XDS8lZCeTjrgTau4+7v+kbzw1tXTgse+Enw+cunv73zmZD/170SJOErbtcfT3OSiC2RDles1mvuctJV+x89flhHb5fcs8Jtz+059QRk0un/NEsMXHhvHUDn988afZh5jU7HqZZD/PEvKElO7vde6x0c2GLHh/2lCZ8e9Rv/5ZO+/7IDKn41uJTT228HqY55SLF+JwywBvjVS6mvDHYBxCNhH3ZkKIKP/uAGboRvrLyksK6V+pGLT5YECvX1tIbUFg2rPi24GN3TQOXjT6pe/i9uoKkV2Fk+WS2gjtYIJXLB5ZPL55PPQmVywcXefNCjZDDrYn8wRUGWTGyrKjEp263K/oXdxhVs4Hx0T2KDzeQu0eaFRJWD/aVlo66yFuoSUapXjMOA6aEmpxAPWLd7PifmOory/EWF+eUeadOzS+cmlPqyy3xlVXHZYTkPUR9lULXN9VXUkPmpXZxxn9CdH2Bq/7sftH14/jo99P42DcfgobGk/kQ4iof7O0tKMjzlnl7FxXPCnWlt7bIq6Up9H7ULyGp6FOjQwoK5qdEilm2WkbrfunLglgdoWzLI6QIqSJOxfP9OiOytq8ia/lTC2s6edtm76Vlvtyc4pKKHIVrexYXj6rl2ZEHWNZfuW6Ib3pRySxF3koUgYgw+jq/yMq4jMyfXlzgCzW7RnXXPatVwfq4RPcX0R+JEfUvA62pnulwYyNkttA3sywktPmFeb6Z1XHpB1lm+1qU2b6NUGbrbHhIHkOFMEOdhiTY6o8xWxZfiZdhVOIb8bloA/EdqvBvnfwOqOHe+friO18lpDWNs1MujSdL5dP4d7QrVUTwIm/pRUp3fPnTvVN9OUUl3twCX84lJYo19ZVUxx192AujWO/CqF6i8NHrbYNBi2IfKTx9KmwX73hq+n9CtIcpRKxtFOmqHTOroh5JPHI1doC8us9Rzoeo65ZELMcifpGjlK2iE5vxGdCQ6qyt3cEyl/S1rHnj1Hoz4tPCsJWEGB6jiCFzh1+IeJ4QHu3apVFb8PonIfwKbN0Wc9ESXSEhRoVEzVWOm1nuRK1yElsFV6A6jCupGZcwjWBN11Nh06Uo/v6K3h9ep/arqvyVa/r7vMU9S0q8s1i5N7RCK2pfnx9pjkjkP4PW5uFaAVZqKo5eha+kbHG0am9i0bRk2aOW48LtCQFHG8HQzbVYJKLjEUGeDoZkomkSFQeIbpUJBVIX9KjHLeuTXxHWs6E2BMU51O3gQPifZifvwBDnzCgvKsv3FZYtim5eollnt66+x+ZpTAwD64wHeaCOIDMsceHx0aklHIgohect5utKREQDPUK5MXwQNRmeUHf+H5uzY6FDAwYA", "custom_attributes": [ "abi_private" ], "debug_symbols": "tX3bju3Gkey/6NkPrLzUxb9iHBgaj85AgCAPZHuAg8H8+2EWqyLZ3bNyVZPcL2L0VndEsZhR98t///Tvv/zbv/7jr7/+/n///o+f/vyX//7p3/749bfffv2Pv/7297/9/M9f//77/q///dNm/0ny058r/8+ffkr9J95/ov0nsp9o/39a9h90PPN4lvGs49mOJ2/jmcZzZ9G6P3dWbftz58vb/tz/Pqf9uf99pv3Zjqds45nGk8aTx1PG0/6O92c7nrqNZxpPGk8eTzmeef89KjtBThPQBDyBTKAT5AnKBHWCNkCZzGUyl/7Lu2jtErKDLqE7kAl0gjxB/6u8gzpBG6BtE6QJaILOvGd468x7jrfOvGd5M+a653krE9QB0mZENRkiIAYSIAXKQAWoAllS6/7uKVlaKxvqGmKoa6ghBhIgBcpABagCtYloA0pA0CBoEDQIGgQNggZBg6DB0GBoMDQYGgwNhgZDg6HBXSMbahNJ/9tiqP/faggpUKRAkQJFChQpUKRAkQJFChQpULylQiNDI0MjQyNDI0MjQyNDI0MjQyNDo0CjQKNAo0CjyMyXohPVbeZQd07PoYoUVKSgIgUVKahIQUMKGlLQkIKGFDS8ZYNGg0aDRoNGmxq0bUAJiIAYSIAUKAMVoAo044UOb3WkI1/ocMWeLwRXEFxBcAXBFQRXEFxBcAXBFQRXEFxBcAXBFQRXEFxBcAXBFQRXEFxBDA2GhkBDoCHQEJ55IALUZm4crrDcgCsIriC4guAKgisIriC4guAKgisIriC4guAKgisIriC4guAKgisIriC4guAKKtAo0Ch5vnmvajrqdU3Pg8MVlgdwBcEVBFcQXEFwBcEVBFcQXEFwBcEVBFcQXEFwBcMVDFcwXMFwBcMVDFcwXMFwBW+zFGW4gtMsRTnNUpRRVzBcwXAFwxUMVzBcwXAFwxUMVzBcwXAFwxUMVzBcwXAFwxUMVzBcwXAFwxWMuoJlA5reZ5neZ9QVjLqCUVcw6gqGKxiuYLiC4QqGKxiuYLiC4QqGKxiuYLiC4QqGKxiuYLiCM96y4C0L3rLgLStSUJGCihRUpKAiBagrGHUFwxUMVzBcwXAFwxUMVzBcwXAFwxUMVzBcwQ0R2+ZbyjYjVrYZsbLNFEjagBIQATGQAClQBipAFQgacIXAFQJXCFwhcIXAFUKz9BGapY/wLH2EZ+kjiGdBPAtKeUEpLyjlBaW8CFIgSIEgBYK3FGgINNCCErhC4AqBK0RnTSIqQLMmkTxrEkE8C+JZEM+CeBbEs6CUF5TyglJeUMoLSnlBKS8o5aVAo0CjQKMgmuoGND0jdXpGEM+CeBbEsyCeBfEsiGdBPAviWVDKC0p5RSmvKOUVpbyilNdt5rNus4WnabbwNM0WniKeFfGsiGdFPCviWRHPinhWxLMinhXxrIhnRSmvKOWVpmuVZj4rT9cqT9cq4lkRz4p4VsSzIp4V8ayIZ0U8K+JZEc+KeFbEsx7xbKk64rmjMtN3lM+WPpTPivJZEc+KeFbEsyKeFfGsiGdFPCviWRHPWqajFG15LdNRWqejFOWzonxWlM+K8llRPivKZ0U8K+JZEc+KeNaGFLQZa3mbsZa3GWsZ7Y2M9kZGeyOjFZ5RPmeUzxnlc0b5nFE+5zRTkBNSQEgBIQWIxIxIzIjEjPZGRnsjo72R0d7IaG9knl8hM1LA8ytkmV8hIxIzIjEjEjMiMSMSMyIxIxIzIjEjEjMiMSMSMyIxIxIzIjEjEjMiMSMSc55uzGgp5DLdmMt0Yy5IH1oKGS2FjJZCRkshV+RQxTdq+EYN3whlYkaZmFEmZpSJGXV82TagWSqXbZbKBTFUEEMFMVTS/IIFMVTS/IKF5hcsKM0KYqigdi6onQtq54LauaB2LhiZKGhtFoxMFIxMFMH/Vbzb0Yos+6ghzzHEZD8JfrIxIRnP/ZeTjQztiUg2LlTsuf+24rd1/N88/m8fAxjPdjzNQv2ZxpPGk4+nmaOnIfdxTBsXlOO3+pPHU8ZTxzOPp41P1mN8sz9tnLEdrGU7xjdtjM+ytD95PGU8dTzzeJbxrOPZjqdVF2WMd5Yx3lnGeGcZ4539Ofhk8Mngk8FnH8VGGO2T9GcaTxpPHk8ZTx3PPJ7G10vY8dz5bITQGvv9mcaTxpPHU8ZTxzMfz14FWGCMj1DsI9hL2jChvWR/8njKeOp45vEs9tz/uvbAMIfsP7T+g6XvCIJyxEA5Pm45vm05Pu0YuR4D12Pcegxbj1HrMWg9xqzHkHUZX3R80PE9x+ccX3N8zPEtx6ccX3J8yPEdx2ccX3F8xPENxyccX3B8wPH9xucbX298vPHtxqcbX258uOO7leOzleOrleOjleObleOTleOLleODlWNguxzD2uUY1C7HkHY5BrR7gXM8DpZysJSDpRws5WApB0s5WOrBUg+WerDUg6UeLPVgqQdLPVjqwVIPlnawtIOlHSztYGkHSztY2sHSDpZ2sLSDJW3beKbxpPHk8ZTx1PHM41nGs47n4EuDLw2+NPjS4EuDLw2+NPjS4EuDLw2+EdBpRHQaIZ1GTKcR1GlEdRphnUZcpxHYaUR2GqGdRmynEdxpRHca4Z1GfKcR4GlEeBohnkaMpxHkaUR5sjBPNpNggX4AmUAnyBOUCeoEbQAL+wOkCSazTmadzDqZdTLrZNbJrJM5T+Y8mfNkzpM5d2abAcOEWLafjgmx/df77BjNUkisskq9prP8kMP0/R97hWeZnMakV3/KeOp45vEs41nHsx1PI+3PNJ6DTwafDD4ZfDL4ZPDJ4JPBp4NPB58OPh18Ovh08Ong08Gng08HXx58vVU3KgUalQKNSoFGpUCjUujPMp51PNvx7L2JbcycbUdJQ7MS2Y6ypj8HXxl8ZfCVwVcGXx18dfDVwVcHXx18va1HY+6NxtQbjZk3GhNvNObdaEy70Zh1ozHpRmPOjcaUG40ZNxoTbjTm2+gohOzZS6EDpAloAp5AJtAJ8gRlAiPWURx10BuUs0CiWSLRLJJolkk0CyWapRLNYolmuUSzYKJZMtEsmmiWTTQLJ5qlE83iiWb5RLOAollC0SyiaJZRNAspmqUUb6OYOsD+V5xGwcM0Sp4D8AQygU6QJygT1AnaAGaOA0xmncw6mXUy62TWyayTWSezTuY8mfNkzpM5T+Y8mfNkzpPZXMHWTDYbcG8nywQ6QZ6gTFAnaAOYGw6QJqAJJnOdzHUy18lcJ3OdzHUyt8ncJnObzG0yt8ncJnObzG0yt8ncBnOfRTtAmoAm4AlkAp0gT1AmqBNM5jSZ02ROkzlN5jSZ02ROkzlN5jSZ02SmyUyTmSYzTWaazDSZaTLTZKbJTJOZJzNPZp7MPJl5MvNk5snMk5knM09mmcwymWUyy2SWySyTWSazTGaZzN1W1gvrtuogTUAT8AQygU6QJygT1Akmc57MeTLnyZwnc57MeTLnyZwnc3eK9SG6U3pfb5sgTUAT8AQygU6QJygTTOY6mdtkbpO5TeY2mdtkbpO5TeY2mdtk7k5pY2btAGkCmoAnkAl0gjxBmaBOMJnTZE6TOU3mNJnTZE6TOU3mNJnTZE6TmSYzTWaazDSZaTLTZKbJTJOZJjNNZp7MPJl5MvNk5snMk5knM09mnsw8mWUyy2SWySyTWSazTGaZzDKZZTLLZNbJrJNZJ7NOZp3MOpl1Mutk1slsvpBtzModgI/mwTEn14FOkCcoE9QJLIV9rZY1cvsgRpqAJtiZhQ3IBDpBnqBMUCdoA5jjDpAmoAkmc53MdTLXyVwnc53MdTK3ydwmc5vMbTK3ydwmc5vMbTK3ydwGs2zbBGkCmoAnkAl0gjxBmaBOMJnTZE6TOU3mNJnTZE6TOU3mNJnTZE6TmSYzTWaazDSZaTLTZKbObN0and0itZ/6iFofERqDC3WMLhwjy+Op45nHs4xnHc92PC246hhlOMY1x3PwlcFncdVG47+Nxn8bjf82Gv9tNP7baPy30fhvo/Hfn/b76WjM289t/P82/r8FRX8OvTb02tBrQ6+31NtcEnf8S5kAvzMS1dvlB0gT0AQ8wUhZb2H3f6H5OzR/h2QCnWCq01Snqc4zhTx/h+fvMH5nplBmCmWqy1SXqS4zhTp/R+fv6PwdnSnUmUKd6jrVdarnmUKLktbHhMsEdYI2gEXKAdIENIHx6GgiH0AnyBOUCeoEbYAeMzqayAegCSZzncx1MtfJXCdzncx1MrfJ3MOtjCbyAXgCmUAnyBOUCeoExlxHE/kAaQKaoI9rbKONvHcyRyN572WOVvIevKOZPFAF6uMmdbSUB0pABMRAAqRAGahrtNFiHqhN1AfxbU6gN5qTzQr0VnNKs9k8kGnYrEBvOA+UgQpQBWoT9YmAAyUg+z3rQvem8IH6qMuBEhABMZAAKVAGKkBdg0ej+NBVpEWRlj4acyAG6qmard2BEhABMZAAKVBPVR2N3oEqUJuobEAJiIAYSIAUCBoFGgUaBRoVGhUaFRoVGhUaFRoVGhUaFRoVGg0aDRoNGg0aDRoNGg0aDRoNGm1q9Pb2QAmIgBhIgBQoAxWgCgSNBI0EjQSNBI0EjQSNBI0EjQSNBA2CBkGDoEHQIGgQNAgaBA2CBkGDocHQYGgwNBgaDA2GBkODocHQEGgINAQaAg2BhkBDoCHQEGgINBQaCg2FhkJDoaHQUGgoNBQaCo0MjQyNDI0MjQyNDA34nOFzhs8ZPmf4nOFzhs8ZPmf4nOFzhs8ZPmf4nOFzhs8ZPmf4nOFzhs8ZPmf4nOFzhs8ZPmf4nOFzhs8ZPmf4nOFzhs8ZPmf4nOFzgc8FPhf4XOBzgc8FPhf4XOBzgc8FPhf4XOBzgc8FPhf4XOBzgc8FPhf4XOBzgc8FPhf4vDf+E9No/Q+kQMZswzrS3X2gNlF394ESEAF15r4msDMXQ53ZdLu7rbPaVwcOVIHaRN3dB0pABMQTdYeK/ulY4TcQATGQAClQBipAlhbp8+6WFrH36A49UAIiIAaSibrLxN63u+xAPFF3im6GEhABMZAAKVAGKkAVqE3UoNGg0Z2ifc0AAwmQAmWgAlSB2kB91d/e/B+r/gYiIAbqGm2s+hsoAxWgCtQm6k45UAIiIAaCRoJGgkaCRoLGsZwkjbWDAyUgAmIgAVKgvliFxtrBgfqCFR5rB49/6545UAIiIAYSoK5hKzK6Zw5UgCpQm6h75kAJqGvksQJxINM41oQoUAYqQBWoTdT9dqAEREAMBA2FhkJDoaHQ6H6zHW3a/XagBERADCRACtQ1yljHOFCfxeSxjvFAvUY8UAIiIAYSIAXKQAUIGgUaFRoVGt3nx4pGBhIgBcpABagCdY2+tnED6hptrIYciIEESIEyUAGqQKbRaKyaHCgBERADCZACZSDTaDzWVA7UJuo+P1ACIiAGEiAFykDQSNBI0OiebjJWXPao6ysuBypAFWjGfeYNKAEREAMJEDQYGgwNhgbPuM+yASUgAmIgAVKgGfdZCtCMySwzJrNuQAmIgBhIgBQoAxUgaCg0MjQyNPKM+776M2H1Z8Lqz4TVnwmrPxNWfw404z6XDWjGfS4ExEACpEAZqABVIMR9RdxXxH1F3FfEfUXcV8R9RdxXxGRFTFbEZEPcN8R9Q9w3xH1D3DfEfUPcN2g0aLSpUbYZ9+XwZV+TmoEKUP/bMtapHujwZRnrVAciIAYSIAXKQAUIGgkaBI1e/9pIVjm8Wsdq14EESIEyUAGqQG2i7t8DQYOhwdDoXm1trIU98qX78kAJCHkgyANBHgjyQJAHgjwQ5IEgDxR5oMhnhYZCQ6GhyANFHijyQJEHijzIyIOMPMjIg4w8yMjnDI0MjQyN7sGeV8d6nT42L0AKlIEKUAVqEx2rdzpKQH0FTzLEQAKkQBmoAFWgNlFf0XOgrmH+6Kt6DsRAAqRAGagAVaA2UO2LfA6UgAiIgTqfGOp/qzZ3sQElIAJiIAFSoAxUgCoQNAgaBA2CBkGDoEHQIGgQNAgaBA2GBkODocHQYGgwNBgaDA2GBkNDoCHQEGgINAQaAg2BhkBDoCHQUGgoNBQaCg2FhkJDoaHQUGgoNDI0MjQyNDI0MjQyNDI0MjQyNDI0CjQKNAo0CjQKNAo0CjQKNAo0CjQqNCo0KjQqNCo0KjQqNCo0KjQqNBo0GjQaNBo0GjQaNBo0GjQaNNrUaNsGlIAIiIEESIEyUAGqQNCAzxt83uDzBp83+LzB5w0+b/B5g88bfN7g8waft8Pn/QARBhIgBcpABagCtYkOn3fUNaohAmIgAVKgDFSAKlCb6PB5R9AQaAg0BBoCDYGGQEOgIdBQaCg0FBoKDYWGQkOhodBQaCg0MjQyNDI0MjQyNDI0MjQyNDI0MjQOn9vhL4fPOyIgBhIgBcpABagCmUbqi1o3oAREQAwkQAqUgQpQBYJGg0aDRve5zZK17vMDCZACZaACVIHaQPtE6eYwOSSH7FAcdlbbkbR1e6ZjP0FnqB325b7HUgEF7CE7oP9CD54D9gg4YP+MAxbAnqED9n89zuCpDhvgsXT5gMkhOWSH4lAdZoeu1lytQW2saz5gckgO2aE4VIfZYXFYHbpaLzz7OuhjtfOA5JAdikN1mB0Wh9VhAyRXI1cjVyNXI1cjVyNXI1cjVyNXY1djV2NXY1djV2NXY1djV2NXY1cTVxNXE1cTVxNX6yWozXCn42gikg7JITsUh+owO+yJ1A6rwwbYy80Bk0Ny6GrZ1bKrZVfrxeeA1aGrFVcrrlZcrReiA4pDVyuuVlytuFovSg/Yy9IBXa26WnW16mrHBoYDZoeek9XVqqs1V2v+3Zp/t+Y52VytuVpzteZqzb9bQ04eJyINCLXjTKQB2aE4VIfZYXGy6tDVkqul5JAcdt5jI4Px9u0FfZkK9TXofZ3KhA2w23/A5JAcskNxqA6zQ1cjVyNX6/a32bN0HLA0IDlkh+JQHWaHXe3YqFEddjWrqI6TlgZMDrta69DU5Fh/Jg7VYXZoatKXsfXyYcAG2NtYAyaH5JAdisNORh12Mit3jiOapOdZLxQGJIfsUByqw570Hhq9UJCeZ71QOGC3/yHc7X8IF+ctzluct9t/wOKwOmwQ7vY/1Lr9BxQId6MfwtV5q/NW5+1GP2Dz3GmeO93oh3A3+qHWjT5ggXC39CHcwHsc5zRgckgO2aE41Cl8HOrU1Y5TnQ7YzduF+8qXQ7gvfRkMyXmT8yZ1mB0WhxXC3dKHGm0OGcLdvIcwOS85LzkvVYeeO+y50817CHfzHmrMDjOEu00PYXZedl5xXvFcF88d8dw5bNqFD5t2NfFcPwzZhQ9DdmF1XnVedV71XFfPHfXc6dX4Iazw0HF61AEPb3Zh9ya7N9m9ye5Ndm+ye5MPbx4bVskhO+y8tUN1mB0Wh523ddgAD28eMDkkh+xQHKpDI9Njse3mMDk0Mu0LdbshBxSH6rCv1+/Z1206YHXYJuxrWCZMDskhO+xk3GF12AC7N1U6TA7JITsUh+owOyyAvTZV7ZAcssNOljtUh9lhcVgdNsBuyAGTw07WNzF3Fw5YHHay2mED7C4cMDkkh+xQHHa11qGp5b6euleWA1aHDbB7c8Dk0NRy3w7ZvTmgOFSH2WFxWB02wGN7SH/57LmTPXeOTSL9hbLnTvbcKZ47xXOneO4Uz53uzSNLujePdyueO8Vzp3juFM+d6rnTvXm8RfXcqZ471XOneu5Uz53quVM9d7ohc7dIN2TuZuiGHDA7LA47Qw/wbsgOjwOyBkwOySE77GraoTrMDovD6rABdscO2NVyh+SQHXa10qE6zA6Lw65WO2yAvTYdMDkkh+xQHKrDOrP6OG2r52RfMjNhckgOPc96U3hAdZgdFofVoeeZeJ51dw9IDtmhfyHxL3S4u2fq4e4DVocNOXm4+4DJITn0PFPPM/U8O9x9wOLQv5D6F8r+hXrNa+fZpOMYsAHVofGWY/dGcVgdNsC5gyfp3MOTdO7iSTr38SSdO3lSX0QzUAYqEx1W7sk4rHxAT/JxevaxkUQdepKrJ9msPGjbRA0JbkhwQ4IbEtyQ4IYEH262ZBzHiA2YHNLU7mtiJhSH6nC+fV8WM1AFmgnuy2IGSkAExEAFyThMekBP8rGJv2sf2/gP6EkmTzLNt+/rZAZCggkJJiSYkGBGghkJZkRXPhx5QE8yI7qOc8oOKJ5k8SQL3l7w9oIECxIsSLAgwYIECxKsiK6s4tCTrIiu41izAT3J6knOePuMt89IcEaCMxKckeCMBGck2OK9l1R9ZclAGagAVaA2kcV693xfWTIQHYdZpb6y5EhzP0Onnz/Qj9E5UAYqQBWoDdTPOBsoAREQAwmQAmWgAlSBoJGgkaDRD9uRjhhIgBQoAxWgCtQm6ofvaEcJiI4DrVJfgTKQAClQBipAFahNdKz4MmThKgdSoAxUgCpQm8gqjoES0J7S3uHoKzx6b6Gv8Ojt+77CYyAG2lPQG/d9hUdvjvcVHgMVoArUJrJCf6AEREAMJEDQKNAo0CjQKNCo0KjQqNCo0KjQqNCo0KjQqNCo0GjQaNBo0GjQaNBo0GjQaNBo0GhTo68EGSgBERADCZACZaACVIGgkaCRoJGgkaCRoJGgkaCRoJGgkaBB0CBoEDQIGgQNggZBg6BB0CBoMDQYGgwNhgZDg6HB0GBoMDQYGgINgYZAQ6Ah0BBoCDQEGgINgYZCQ6Gh0FBoKDQUGgoNhYZCQ6GRoZGhkaGRoZGhAZ9X+LzC5xU+r/B5hc8rfF7h8wqfV/i8wucVPq/weYXPK3xe4fMKn1f4vMLnFT6v8HmFzyt8XuHzCp9X+LzC5xU+r/B5hc8rfF7h8wqfV/i8wucNPm/weYPPG3ze4PMGnzf4vMHnDT5v8HmDzxt83uDzBp83+LzB5w0+72tC+uhKXxMyEAExkAApUAYqQBWoTcTQYGgwNBgaDA2GBkODocHQYGgINAQaAg2BhkBDoCHQEGgINAQaCg2FhkJDoaHQUGgoNBQaCg2FRoZGhkaGRoZGhkaGRoZGhkaGRoZGgUaBRoFGgUaBRoFGgUaBRoFGgUaFRoVGhUaFRoVGhUaFRoVGhUaFRoNGg0aDRoNGg0aDRoNGg0aDRhsa1JeEDJSACIiBBEiBMlABqkDQSNBI0EjQSNBI0EjQSNBI0EjQSNAgaBA0CBoEDYIGQYOgQdAgaBA0GBoMDYYGQ4OhwdBgaDA0GBoMDYGGQEOgIdAQaAg0+nCKgR6mxVAP0wMlIAJiIAFSoAxkSa4dWZJbR+2434z6GpvcT16wkMw9BRaSAylQBipAFagN1FfR2IAX9UU0AwmQAmWgAlQnOg7464THEX8HbIDHCMEBk0NyyA7FoTrMDl2NXK2P0pWenKOfLwaPfr52mBySQ3bYGfrhz33kbcDssDisDhtgH3mz7TF0LF2xG9PoWLpS+hEVx60QW4fiUB0ar51STOMerQ6Py1EOmBySQ3YoDtWhvUXtGXWcfN4z6jj6vGeU3x3kV2qR36lFfqkW+a1alPwCoeQ3CCVcLkEJt0tQwvUSlIqrVVerrlZdrbpadbXqatXV/E4iv6qL/K4u8su6yG/rIr+ui/y+LvILuyjhlH8aV3b1o8GP+yhKh/0XaodIzunCrdONW4TD/olwUjsRjmonwlntRDjwnwg3shDhCgui5GrJ1ZKrJVc73eF1vsTL1U7XeJ3u8Tpd5HW6yet0ldfpLi+/zOt0m9e4zqvn2XFa/AELsu+41aJnn1/GReLJEU+OeHLEkyOeHPHkiCdHPTnqL6+upq7m13ud7vc6XfB1uuHrdMXX6Y6v0yVfp1u+Ttd8ne75Ol30dbrpa1z11TPqcGyHhwt7nh0m63nmJiM3GbnJyE1GbjJyk5GbjNxk5CYjN9np4q/TzV+nq79Od3+dLv863f51uv7rdP/X6QKw0w1gpyvATneA+SVgxLgLgcY1YAfMM6OO9R89o9hNxm4ydpOxm4zdZOwmYzcZu8n8RjDyK8HI7wQjvxSM/FYw8mvByO8FI78YjPxmMPKrwYhPN+adrsw73Zl3vjSPkSW4sIMYN3YQ48oOYjcZu8nYTcZuMnaTsZvMbwojvyqM/K4w8svCyG8LI78ujPy+MPILw8hvDCO/Moz8zjDyS8PIbw0jvzaM/N4wGheH9Xxwkx2LPo4sKSjM2WsydpOxm4zdZH6BGPkNYuRXiJHfIUZ+iRj5LWLk14iR3yNGfpEY+U1i5FeJkd8lRn6ZGPltYuTXiZHfJ0bsNdm4UczgsZCj54NsKGHEazLxmsyvFSO/V4z8YjHym8XIrxYjv1uM/HIx8tvFyK8XI79fjPyCMfIbxsivGCO/Y4z8kjHyW8bIrxkjv2eM/KIx8pvGyK8aI79rjPyyMZLTnZKnSyVPt0qerpX0msyvHCO/c4z80jHyW8fIrx0jv3eM/OIx8pvHyK8eI3GTiZvsWL1xvKb6y2eE/biArL+x3zPpV5CR30FGfgkZ+S1k5NeQkd9DRn4RGflNZORXkZHfRUZ+GRn5bWQkbjJxk4mbTNxkx+KM491w/w6NK8v6azYUeH4tGfm9ZOQXk5HfTEZ+NRn53WTkl5OR305Gfj0Z+f1kpH45q/rtrOrNRXWTqZtM3WTqV7Qeay8GRFU3biqrHXpy3Bd+WRn5bWXk15WR31dGfmEZqVc+6pWPeuWjXvmoVz7qV7aq39mqfmnrsYjieAuGC8fNZv2FBC7028vIry8jv7+M/AIzUveFui/UfaHnC1w9OacrXE93uJ4ucfXKR73yGTei9aRncojm7bjOrL+F+0LdF+q+UPeFui/UfaHuC3VfqPtC3RfqvlCvfPyGNFJcTEXjjrQOGwqFcb9ZT7r7Qt0X6r5Q90V2X2T3RXZfZPdFdl/4fWnkF6aR35hGGVe0UvabizMuaaWMW1ope32Rvb7I7ovsvsjui+y+8MvTyG9PI78+jfz+NPIL1GjcoHacpJgcwqbH6oMjkV5fZK8vstcXfpEa+U1q5Fepkd+lRn6ZGvltauTXqZHfp0Z+oRr5jWrkV6pRPt1JfLqU+HQr8flaYk/O6WLi083EXl9kry9y8eQUT07x5FRPjoey37BG2UM5ezsqezsqezsqezsqeztqXMjWhZsnp+FjjbvWaof4WMVDuXgoFw/l4qFcPJSLh3LxUC4eysVDuXgoFw/l4qFcPJSLh3LxUPYr3Gjc4dYlvOlTGEYvDKMXv0vbL3Kj4k2f4k2f4k2fIsi+IuQQX7MovmbxUrl4qVy8VC5eKhdvrRRFJVEyKomSUUkUj77i0VdOF2PjDmAqHn3HKRIHWfXP7QVp8egr3sAo3sAo3sAo3sAo3sAoPoRUvOFdfQip+hDScXjD+AW88XFUQ78Oz9rHx8nZ0m8Uqvixn6Td+nVB+4/pT8ftQP+z/+tvf//bz//89e+///Wff/zyi/3C/Id//PTnv/z3T//58x+//P7Pn/78+79+++1PP/3Xz7/9q//SP/7z59/7858//7H/332M8pff/31/7oT/99fffjH0P3/yv95e/6naATj9j/cCFH++T12sEoiN6HYCqSeClFcJqC927ww22HCi4FUKWz0yKGwy70RBy6lgmRR7v+sSBdvSnCMnNjplZVlOgyIJrZ4I6geC8pqg5fkt0j5/9JJhKQm8vSZowadoZQaUzXqBQpazsdJ8iSqeC/vrnP8+pdcE2ZbeHiFd9ApBsaNaOkE5vcG3CGgS0MsUBFnQbNN5//t9yv7K39tM1fH3pV34e9sbNL+ibQPyaF63tW2ImN/BsJcN+4TCOgkXBcnegntJkoKYlL655HBmbvTS2yFHwTfZS7zykoNSVMZQQRlz4sjrqahcUdrm9DoVHKSiNYXHE79IhZnwZUFXCQy134/3/fdAfO3voa/fIwdBLuBoe5h4SZO2b3A0cGjm1xz1AY6o1NQNfttHAJyD+RsRmj1C23YpyjOj5Mhcrjll70bN+nzvRtGVmtSsXtz2Wq+VHR9ITlH2mYT1dn0WZ4gyMiTIVC4/0nJ7P9ZTweVi0ZGKt1D0kvFRnkutr40vUf3uTc69u5xepCJkUCYw6Kvc3H5Ig7smVEaVNr1ij9xAsXeD+VJzV9HG2ZvfHpP7mPk6RUG7XU/t1c8UUsN6YEM4nD7ld5KR6yyy9j7062Ro1AlKaTZV9sygixwowjXVdI2joGrehwvzJY7M7eQOvvhZEB27S7crn2Wfu5rRwa2+TobmqLhhRFgTvcihGRw5XeXwdGR6gKNcydK9Pktoxipdoyjoo5aklyg2b7ptcsmy+xz+TMU+h3+qlzdep/D6MOX8kiJrxIHMYDplRpKPFDkaeMjTKLb35FVXK5ebvdWIYKm3GhPc661yP6h55uP28luUoEbeO4ioCPbIfPUtYgoiUJxKnM8UHHUUN9hjr9NuU5zKik8UUXYSGmpMp6bel+yM+jV5lhStujn28vQjQxQU2iZF2SdyXg0AlBqNhyVUAXtf7VVklaC5yBuCm7dTv2g9OAsGtPZR31NLaXlQLjfY6zyySOudGUVE2G7kE8VySBBGUuichvaRoAZd9r0LglI7n1oWST52hWrUFdqKj+hs5cPI0sfAqlGRmRSDlOnkdGrbOsfWCBynIYwvHEF0al8GfLS1qL0M8Bp1qQptKLslv6QIc8P7qInb6zcJv0ttFd+lcX75XSzXXsZY8uY8pdc1ashBeBtbKfmaQ27XBDHFUk3Q8u2aYJnidU0Q5qcUduOn1/kZDS35xIYN675MRkiBNrSdzXSNgn1AOddrmYHxLVLhawGq3hvQ+jpD0yZ3K9e06e3aNW35dvWatnK7fo2zVDBAls8zBZ+yNCzB9l9GkO4J5pclWEpRTeuDS+k8uMT501xBNHez//IsPHZYHiA5jWvcIMlXSVAk87nT+JVkNWNb9DpRD7if8zYqh9OQ7ueR1BTEq+3cmhxpi94mqPmpINh2KAFJu+9g2u47OJpTWnRwnKs+/GU7xV5myLqFdw+/tnA0tZS8vb7D9jJIKEwKNW9i8ml082tSQpq90nIargFNkLnigzan2vfL+8SFdPFPfO5fl08kUQV8yhPmk4U/dSISb6H94Jx0SslXkmgWlNTLgdpek4QfZx+1xvvYgtXXH4ejCQ0uGaPHXMp1muY0VbaARqOc8UF5W3LxsmmxTHKefrtOUq6SkH9o5idIgpTIdr/qkXDyHpMutqckSAjdrzWE79caIvdrjTBDRJAh5+UdXz9v6JwGH9s2mcCAEi182rDghV5WGnEf2ucr7HTpFKSj3a++Io6G5QR7lXr6vNsnDk23u6/rHK/7r2GuUmYvpcsWtOtVwv4nWPT8ab5kSZCWxhsWVfGpn7IH3SeSaFx1k+mbtrUtIInqc3BwPTW2PndBtYaDNd5iq3KRhNgL+RykJEfTQalguIbOrb7yjYQooQuppzL+e2+j4tPRp2U43yI5lUZ8Xkj6NUvkx2bJh+nT8johoft4SxgX5K0GrZJoekgZjT4VjUiiGeUNAbtXX0HnIIelq3g3NPHrcqBsD5QD0VzTcjlQ6HY5EM022a4XDL6wXiNZDvqi94M+Tsha0MeRlsQjrQX1eDR1tR5p7YFIq9sDkVbT7Uir9ECkRSTLkVYfKF7jhDwRacSeEAnKtFpuT0OlaCprcR7qzctUtPZ4k9cv07b7L9PSD34ZRn9vh3qxyuKCWSQucrHyFCx1UZWgNGpR2dp8SqxlvkqCOdMdXiTRDTNrO7xMgk7SDl+PzsVtm0Q+rZWoXmXBN7aLY7aLLORjUXxuSX9moY2iKfrtfxko3L5B4A4+lfLfIFCM8p/XKXyDIPuy2kovCMKclC37npFEGuRkufse5Ue+h3rLW7QGEZHC+QHMdrDSuYIpn0jCYRqMjdjJIC9J4vfJWJNkl4EE3yVxWCxjEQrXFryPRLM3WE1vO1Mvvk9LHmctqCFCFt1aPo1LXCyD1Hcn2V0YfI0lC2LWDsJvwRcKmqwVIwL11MazUfplipZ8KK68pIjfRb1Uzlovfp182hSa69ausRTB2MSOuVxl2cRZ0kWWXFn9jerrSKFoz5NNnGLsiOVl3yYm2bDwdSfRgCTaOUUgaVTTy74NRRNbWr2wP43s83fSsdhRI35gSID49pAA8QNDAiHJakeN+P6QwJuEPDAOlht5edLkYjn9kUWvlko+VWG3dFxNS23lxHK1tMdmv3qqML5V2ld0+OopYL9JQaBotyna1VR4XgQUcUXO7M0BLulic4A9zHZGusriYbazXGxUaMJSN7sJbLvKIr4A2pppF1l8NcbOctE40qrny5bkKkvevPkYNYfD7hY2U+qpp/OdDl/zHWfyguBNT9yH9rdWr3bnM95jK+UiSWLfgSd0lQRjAjvJ1dGJhFV3Gs9URGNH4mNHUuoDJJUukvjuA1FKV1OCjs7OJ1dTor4SKl8dlPNZvh1e/TqKdvROEpQk4cL94mvM6nmZzTe2MSQvRva20kuOaGWmb2+0iyC8/ftpNx5Fs1mp34k71z68HHINk4FjhOx+hpfJCNeW+TjFduqtfYvCm74b14sU6hTtNoVcTQUWxWzK1yjU8+K0QuBqKuqlzaJ7iwgdGi58jQJLpnaY71LIdm0784dFV5cCnBVrYXZ4LTs1O0XZLlLgRbRe2ofMGdUsZ7n0RSrRTEWl80Yy+rgAjWq4p8TbcsLXNtYx2i50/qxf0tHCBa3Y+f9hHU1LnzjogSGIxg8MQUSbpxaHIKImFG/ptGBZL5KkDVGWonGMVu4PQYQJyVhQwFnl4ttkLz8yvV6dFG4C9UWscm6sf4pV3qKqfiOsR9/xaTNX+RaLsO84lNNMb1nemKun7o9KC14nXMeacRrBjk/mK99i8YPz2PYxXHid7EPnuZ6KZv10xk807VRx+sfeHDx1Xz4dhNi79q/blF5HpA/7jb+kJCpaF3dScTh9tbiTap0k2En1DZJ8lWRtJxWHs1eL5+68IVk7eYej7VgPHL2zj0LipK92mkn4HGnRZqzVmI/G7mwKr/l4TH6dkmg3FlXfW9ZOXctPnUIOT/hb3PLQx/hej+CvnWjE0VFdq8cAxSlZDbRoq87qYUJvonWVRJ7I2BqODy2dFfWGZO2wqJhk8bSokGQ5Tpari2B/KIcTV2ubdJijL7y4P5TDLUeL+0P7cP8rksWdPhwe+re204c5Wki+iTeQVK9xJAwT7yVousZB3mkkfp2OcMdRRt+EcvAu0Q4su8QVI1Vlu8RBvgrO7p58zSGRedFcPB+ZlL+TCt+6uLXXX0XyD01Fqt753fK1/EyV73Ogp0cfenrf4WD4ze7MeskR7ZpK7A0aOa8c/w6H+K4pkSc4ykUOjNjbAapXOXyqrKb773KVQ7fTVOZ2n4Ovcohz5Jc7Lzlvd10bpwKO2+cgXn/ZTLfLjqg8Lz5GfT6x+Esq5L7fQo5Fv61zlIsca357w7Hkt+V3ucqx6LdlDr7Ksea3aF/SWqTHqVjzW7TDai0VcRsM07jM6fV3jc4F3IcM/bifoNUR7q5abINFHKttsHq7HI1TsdYGq/RDU7HYBnvDwfc51tpgIcdiGyzaU7VaJ4Qci3XCOke5yLFWJ7zhWKoTlt/lKsdinbDMwVc51uqEdrvnFKdirU5o9XbZUW63wWTbbvst5ljz2zc4ykWOJb+941jx2/q7XOVY89s6B1/lWPKbREOMS5H+JhVLfpNoM9ViGywaoVw8a+1bk3zt1YSHRMPhi1ebvElJLqcJnJP5v6Qk3JKydvZsTLJ4+KykcKXj0umzbziWjp+VaDJq8QCfdY7XB/jEmbp4Aq1Ec1GLR9C+4Vg6g/YNx9IhtG8yZO0U2phk8RhaCXctLR1DK3T/EEvh+4dYCqfbkxQxx9okRcyxNkkhYQG/1kGW+NKppQ5yyLHYQRYudyvdOBVLHWTh9kNTsdZBfsfB9zmWOsgxx1oHWeT+oGnMsdhgl/uDpm841hrscn/QdP1drnIsNtjl/qDpG461BrveHTR9k4q1Brvq7bJD7neQ9f6AVMyx6De9PyD1hmPNb3p/QGr9Xa5yLPpN7w9IveFY81u+OyD1JhVrfsv1tt/S7UkKKdvthSISbopabINFHKttsNuTT29SsdYGuz35FKdisQ32hoPvc6y1wUKOxTZYfWDQtD4waFofGDStDwya1gcGTesDg6b1gUHT+sCgaX1g0LTe7jnVBwZNW7pddmz322CN7/st5Fj02zpHucix5rc3HEt+W36XqxyLflvm4KscS37T7e5U/ptULPlNt7tLS9+MT67d6fRmaqCcpgbq6c6RT1MDGu2JWjxRP+RYPFFfo/mnxQH5dY7XA/LvctXjdG9SlZe5msKTQ9BA3lN8CvbPNxpHx/mt7lnVaBJqdc+qpmh35dKeVY1CfnXPakyyuGdVw+mjtT2rcUIW96y+IcGZSJzz1Xxd3PgakyweR6bR7M8j+bp4HFlovv1/4pTk9GEq65P5KAy1pcurNbpYarGLG3IsdnGV7jZT36RiqYurnH5oKta6uO84+D7HUhc35ljr4mq0B2qxyR1zrDW5v8FRLnIsNbnfcaw0udff5SrHWpN7nYOvcqw1ueXuwNSbVKw1ueXuROmbSmHzs8vOx/d+rhTkgUaqPNBIjTdka/JIP4fHl63hIUvV07bu0779b7JsXgo1frlWSsMrqLbND5vZzieTW4HykSaI1up7zGv7cELVZ5L8BEl0xPmGHcj5fKmkSPtEEi3W9hvg8vkoobyejubua1nk9ctEG6LSaYBoxx/OQfv0Ojndfp03KfFOL5Wag5Tw/YzNT2SsPhAlOf/Ql1lPR/2h6Ujs596wtNfpCEczH06HBkEWklTxE9KrauCaaIIqUUp+deLHIxE+08jtXHmTEr+DmJKkICW34zU+SyQLekXnaw8/nSWi0U6YvCluodjy65XCGt1BRUJ++8O5FKBPzYpwEiD5bRbp1Mf7ShIUrsVPis4poHjgkLRe8t0ecKq3D0nT+sAhaTHJ6oBTvX9IWpyQ1QGn+sAhaXHEMzpIH+b+v0RaNGW1HGnhmX6rkdb4dqSFJ/qtRlpIshpp0aap1UiL34ZOa4XzxbdZDdeYZHF8NCZZjPmQZHF8NIeniT/xcVbHR+OKD/M1mYKD1vL2wHW/e9V638F5u33db97qfQfHJIsOzun+db9xQhbN94Zkta6IIk1wVPOHO5O+RFqS2yPxOd1f8B9yLI7E53R3HOtNKpZG4nNqPzQVayPx7zj4PsfSSHzMsTYSn+n+gv+YY20k/hsc5SLH0kj8O46Vkfj1d7nKsTYSv87BVzmWRuIz312o+iYVSyPxmW/PB8SVAgbAs5zK4i+VQrRzanEf6RuOpX2kme/PCKxzvJ4R+Eamvj5TMYdn92nFHtDzgcKfX0aiKE1+aCZJvc/xej9rPEKkWOa+DxnLqxGiN6fNbqca6nRrVbtKkugJkhKQhKfNLp6NHJ82u3ascXh47voZryHJ6hmvYaG6esbr8qnEr79OjqauFo9nzdGI895+wdAq1y1ISFAsLm5aztHE1eKm5awt6pQtbVqOOdY2Lccca5uWcw6PnF7atJyjOavVPkw477XYh8l3WwBvUrHWh8nlh6ZisQ/zhoPvc6z1YUKOxT5Moft9mJBjsQ+zzlEucqz1Yd5wLPVhlt/lKsdiH2aZg69yrPVh6t01gG9SsdaHqbd7UmF5vrZhJoe3XC76Lb4pc81v6xzlIsea395wLPlt+V2uciz6bZmDr3Ks+a3d3aryJhVrfrt9lt+bNtjSpuUcneW3uGk5t3a/DRZxLLbByna7HI1TsdQGKxv/0FQstsHecPB9jrU2WMix1gYr4e6jtToh5lirE77BUS5yLNUJ7zhW6oT1d7nKsVYnrHPwVY6lOqHcnoN6k4qlOqHcn4MKy/O1Nlih+7dJxByLflvnKBc51vxG92+TWH+XqxyLflvm4Ksca37ju6egv0nFmt/47tbpeHBRMPJLctpt/HVwMSTxxZ/nQP86kL16k5y+HNsv4a6UxcNZo3SwryDlrfDrdASl2NqyzRLNH60uxSkSvMvqUpwSXTiythSnRHNQq0txYpLFpTglOh5tcSlOnJDFpThvSNaW4ryJVUasptPUgH6HQ3G+K+f28gbHIk8Eqz4RrHo/WPWJYNUnglUfCFZ9IlhjkrVFm29I1iI+JllctFmigYdH8nVx0WbsveJvU8pL/5Zo1DLtE/KzHUGnRROSP9U20VSDXeCMcD1vFfoeCfmF0JIeINFHSHJAEk6d+L4YPnUBvpJEc6aMsSXm8nIZyBsOXyvJLV/k8FYNt/KaI8wQjzTOwaeJhvpXMyTmWMuQN+l4IEPodDQ6XQwzoVPvTIJcjQ4eqKhu6Hxo0DdJvBlfmwYk99dOrXPkIEail2mbLzQ4La758jLR3qnF1kQ0LbXcmqj8QGsiGvRfrfXChKy2JmKSxdZETLLYmghJVlsTbfvB+brYmghDfo8vvM3GQci3+9dOvOFYunbiDcfStRNx0aq+wV1Pufq98lkR8iHJm4YeSjSup1V6nxp6AcM+F4exnlZf3hhTo8t8ajvdOnMa00z8iSMatqLst+hQPtXgX1KS4raVhwhzwBJNVW1YGbePJ3qxSPyZRMKqE847L9DTTxQPbJuqT2ybqve3TdUntk3VJ7ZN1Qe2TdUntk3VJ7ZNvQnW08rW06LUL8Ea3j5Fp1KRTouXWS6br7w8IqZGp7ql/SWQlr3PeFoEze0TTbheH4cyiGQNSMLZwERoQ+v5Fiv5DokPyCvLa5KooF89f6CGS48Xzx+o0cLw1fMHarSSem0gu0b7U5YLx2iB+nLhGJ7+t1Y4UnmgcAxJVgtHuj+GFSdktXCMSRYLxzDiF88fqPzA0aqVHzhatfLto1UrP3C0akyyGml8/2jVN2+zdv5ATLIarvzA+axvSBZjnh84n7U+MJ/1JiFrnc83Fd/a+QM1OhFw2cFSH3BwNKO16GDdHnBwSLLqYL1/SEWckFXzxSSrdUUUaYvnD1S9fxJw1fsnAYcci+tGq95ddfUmFUvrRmtOPzQVa+tG33HwfY6ldaMxx9q60ZrvnwQcc6ytY/sGR7nIsbSO7R3Hyjq29Xe5yrG2jm2dg69yLK1jq7evqHqTiqV1bLXcXb36plJYO3+ghvNOa+cPvOFYOn+gRhuqFufQ1jlez6F9I1Nfnz9Qa3w+xcr5AzWaulo8f2Cd4/XExpshIh/71qLBOFM44oWWsiiV1yNeNZwiTaz4vunUICuffBdOXeWCIzd3fGosf4+lYjxxb5Btr1nCbFEM5ou2YDQxPPjPd/7vzX0OSJ4YsWpPjFi1+yNW7YkRq/bEiFV7YMSqPTFi1Z4YsXoz/O3zgvvwdzRyHdJk1H07rvUlTYsmsbK0WTDtw2c5IIkOqyjJz989nQKSSv1EErzQPs09S7eyt5B9JC9t33gdbmgQCEWvU+/PLLSt3Z9ZeEOyNrPQUro/s9CiCxNWZxZadIXV6sxCi2ay1mYWWnpg2rWlB6ZdW7o97drSA9OuMcliOd3o/rRrnJDFcvoNyVo5HUf84sxCe2IOqz0xh9Xuz2G1J+aw2hNzWO2BOaw3b7M2s9CemAh7Q7I2s9CemE2LSRZnFhrrD/44izMLbyq+tZmFFk1iLTs43JO16uBoT9aig8MdWasODklWHSz3rweME7Jqvphkta5I92cWmpTbMwstmsJanFkIORZnFpre3eX6JhVLMwtN6YemYm1m4R0H3+dYmlmIOdZmFlo4c7U2sxBzrM0sfIOjXORYmll4x7Eys7D+Llc51mYW1jn4KsfSzELLd88HepOKpZmFFu17WktFXCmszSy06PaqxZmFNxxLMwst2vW0OLOwzvF6ZuEbmSpBpurtmYUWXVu1OLOwzvF6ZuHNENHazMKbEa+1mYUW3Vu1PLPQwuknLX6ksJbM11hW5yfesCzOT7x5o36kGt7odb6En2hxlqPVfH+Wo9UH1lq1+sBaq1Zvr7Vq7YG1VjHJao+o3V9rFSdktUfUHlhr9WZeAWPoezkdhGs0i2XdD+8ESHtdFkSzNoqrZDOfZgQSfychintGd3yy35eEBOFaeWsz2AzX1wVBNNmiqAH3OkODyZaQBM0K0nNV/IlkD+zwYAbkCpfTVqzE/JklmhXY8EJpq6cXquUzywMjrTvLA0OtO8vtsdbjve8WTG9YFkumtG33h1vfvdDaeOsblsUS7h3L2ojrO5a1gvINy+KYa9qS/uhPtDrqGhYt/dq7MRl82iL2tWiJpnAKWrXttOHUbsz4xqy0j7vUTYOERJNaqfXLHsaQGvPLQnunST+87K+4BIHa+SKFr68UFbiZvPtz7rp8kyVhF19ur9PyZhVDOS2GKPp6FcOemOiS9oJKvlbViCVqKSSwKJ1WD9h9It9gIfZe3fmAkK8s0drshnjZ5zH0IsteWmLuf6/yr7K0Mt1YNuWLLGXDWGpJ59bCF5ZorxaRt1zoNADwtbXA8kTLJZrpWm+5RLto1lsu0fVV6y0XrvdbLtyeaLmELMstl2h2Z7lajF9oteUSsiy3XGKW1ZZLzLLacglZllsuUn70J1psubwpW/yIKeIalS0aDrdWwUjNuYNW9Ttp8XuXKJ/Xj31NS7SIhTZ0oJlaUCroA/tjd5YHNsimTfV+CaUPbJF9w7JcQml9IPz1gQ2u71iWS4UocAtGfqic5sK/Bm50eI5ym9mich6g+GKi8I0qBk25niaRv/tGpzPSKKrmw4uytuq33GkU/vmRxkJ+pLGQH2gs5EcaC/mRxkJ5orGQH6nmc/vRVvxwOGcpQeCGs2VEfk7oaRlV+ZK3UQeN0OesdDri8/O83duk+Bljp6r1S1LCfkhCAVXSeY76Sz8k2q7FpR8pMboQVbfX4wLRpNnyuMCb/m+DAWqT1xN4e2Lis4cRu+l8/NqXgYHwPq2EeNE46qLdX0I4oVr2kZygAgjTQml+JD2P3fwvaclPtKKemDfbWR6YOEvb/ZmztD0xdfaGZbnofmDy7E1SlovuJ6bP3gQuZwwiSYq6IuFVW1tGKyqFrajwjZZbUeEb+UoWlRa+UXugFZWi8wyXrZii49CWrZi220fFprQ9cFbsG5ZVK6btgZmIOCmrVnzDsmzFsFbEuCV/GBX+XCumcA5twxnJshfNr0ccU3Sy4equsncsa9vKdpYgX1b3le0sUedqcWOZbZuM5hHWdpbtvxeE7trWspTSEx20lJ7ooKV0v4OW0hMdtJhluWihBzpocVKWi5b0RActDv7FPWZ7tugTIUf5iZCjcj/kqD4RclSfCDneHgi5+IUWJxBiluXAjVkWJxDesKyGf8iyOoGQovmzZz7R6gTCmypxbcfZ/kLtCT8/cYXXzpLu+/mJS7zesCz7+YFjD98kZdmJT1zk9SbkFree7WkJC8ulvWc7yf3rkGOSxd1nezvu7pFy79KxtP9sTwf/2HSs7UB7S8IPkCztQXtDsrYJbc/W+/civyFZ24b2HZJylWRpI9pbkpWdaN94ncska3vRvkHCl0mWdqPZUTq3Paz3b0g+zsW/mY64rljbkbZ3TaNe2NqWtHckS3vS7LqRaI5gaVPaN0he70r7Ts5KlLPxiYgr+9JSCo9EXNuY9g0SDb5xPMy0tjXtzcDZPtM3v895U9nXgbP4VMPFzWk7TTTPsLo77Q3N6va0dzSL+9PevdTiBrV3H6p50/pcLnz9UNHe3QoW2lJ6PU2Q6gOndqRUHzi2I6V2+9yOneOBgzvesCx3odr9ozveJGW5C9UeOLzjDcv6/Fbkos1PjdvOC5O/TBO06JAG8muldnxaPv7Fi49sNXuXGt6898GnJc6faSi8N0iy34TGr7dzxGscdjdiT0g6NYG+rHGgLVxXubZ97h3L4v45iqbKllehU7TbbHkVOm1PrE6g7YnVCbTdX51A6Yl1BZQemHGIk7JaeL9hWRxEjllWy903LIuDyG9YFkvvmGV1EJlS/dEfenUQOS5bVjfQUTRXtraB7k1KVnfQUbhRbHkHHUVHKa5XafE7rW6ho6guWt5C94ZlbQtdvF1/9RKeb9zsd1qeo58DJpot20MXg6ZnR6cqn1nCvpp3Rz5uffjCEg2vE0bVWD7c9Z0+s0SNXUFzTD680VeWaHnC5ss2tnMDqMl30pLRANrHXcI3ig+O9tsXzxsL5Utawiu/ya/85tPltl/CJRoXo+bLeT9k7pekxCsU2CvGU8Nb9CrLedvCF5ZouiwVH4UtGmRLPF9WPCnnUdivLxReAuOjLx9WEH7J3Gi+7MPR3h9Gk77Dwhsal/snShFLeKwClgqxCF1m2cRZwnx5pKErDzR09ZEWnT7SFtNH2mL6wADDm6SstsXCYOGCRrfUEgRLtA1pbyHMT5T13Bf5Eiz6SA9NHwlcfSBw8yOBmx8J3PxI4OYnAjc/ErgcrrZGD02lUdBWCK9ooubrKqmd6vn8mSUI3FqxCn2H9SVH+D4lYUKinCdav75PNIeWGU2oHZ8WeX7pQ5QnNu28aXOrYOCGz6NIX9rc0amK2U/QyOU0y1I+j4pFk2DWqkH7fy8Rg85VCTft+HaDzYNFr77OaQ/219cJhwpn1DZ62Qh793G8b7Z/qBx8nGgANfsu7nJqbOjnqI22mpm+T6ifWk/b56TUJ/Y8UH1izwPV+3seqD6x5yFmWR4mrA/seYiTslwfxiyrQ3P1iZ0TMctyrdq2H525y7VqaOcCFmpUX9u5PXGaArUnTlOgdv80BWpPnKYQsywbsT0xjNueOE3hDcuahaIFFBm3We2jCae9MelTvPEWHruMhOzz8qfqUMpnlvCCPKyl4nqafftfWCRqgGFsW/NpUEKkfWaJjkFjn3xz/4huqxm7j57NjC3pvLiT9HMySjjaiYYtfTikq3yhCSdZT3OspxK7ffnIT6wZ5/TEmnFO99eMc3pizXjMslqocHpgzXiclNVC5Q3LYr38JnATNiPu4/SnFYlfAjecM/MVVadRStqWbahFvVN3Hl35YkMKJ0Z9GmXHQd/lDU1BF2jHWS/TVKepciM1eqJpV2kaRoHtNJCXK8Sir5TrtKKeDw3//JWi8rZhDV9p51XfRvF/9h9//tuvf/z1t7//7ed//vr33/9hf5nU2lg7Z8oG9jBMZYI6Qeulw59+om2C1L2wA5qA+5jzDmQC7XGygzxBmaBOHmM2I7Ix25dgY7adb0wT8AQygU5gzDZdz2WCOoExW/0lxmwTWGLMNjUhNAFPIBMYsy05kTxBmaCOEleM2Xyt2wRpAmO2wQblCYzZxk9VJ8gTlAmM2fb4ahsgb70I2kGagCYwZqtVs0ygvajbQZ6g9HbEDuoEbYBizNalL2kCY7ZuceHe5NiBTKATGLM1+0uZwJjNgKUNULcJUq+QdkATcO8N7EAm0AmM2VZY1TJBtYVdu2htA7TN6oY9o1qagCZgA3uONZlARyC1PEGZoE7Q+hrXPbC3Tl0Mpd6CM2TkNkO++xhIgLQvgjaUgQpQ7Y0/Q6ZhYZfSBpSATMPG4VJiINOwmaZknuznuicz5UAFyDQsIpP58kBmTLHgTObMgQjINCw+k5lzINOw8Y5k9hyoANW+XNVQm8gs2kc7k3l0IOoLaw0xkABpXy9rKAOZhg1MJbOqWEwm8+qBzKwDmYbFZzK7DmQaFqrJDDuQAuVeQRoqQKbRSzdz7YHMtgOZhh13ksy4A5mGdQiTWXcgtQMxLCfNvAMVoGrI8tT8eyAzsFpJl8zBmnr5SkAMJH0NuCEFykClry03VIHaRGZlpV5gm4Y1EpKZWW0+OZmbB5J+tpshBTIN6X9bgEzDyqNknlabOUpmau1fy1w9EAHxOPU/mbEHMg1zdjJrD1SAKlCbyOw9UAIi2+RpKTCHDyS2JcO+qnl8oGzI3shcnqn/Xu27Qg21gch8nm3lAJnPB6J+U4EhBpK+x8CQaUj/vdy3/BkqfY7JkGlo/z0r/2zxCZnPB0pABMRApqG9ElWgDFT65JWhXpVZCszn2bpAZD4fKAERkL2HVRJkPh9IgUzDWilkPs82H0Hm84HaRNw17C05AZmGjcmQ+XwgAVIg0yi9OVCATMNGKcl8fiDz+UCmYQdUkfl8INOwqoTM5wOZRuvtiwxUgGo/PdlQm8h83k8UJPN56c0N8/lADCSGTNd8PlA21FkKUAVqhpq1bDYg07BWPJnPB2Ig07AGJJnPBzIN251D5vOBTMPacGQ+P5D5fCDTsLqCzOcDmUaPZ/P5QAqUgcqM2ILYNZ8fyHw+UNewtzSfF6sryHw+kACZRveC+bx3MMh8PpC9R49J8/mBzOcDmUaPNfN5sXqBzOcDCZBplP4XGagAmUaPMPN5R2w+H8g0rCZh8/lADGQaVqfwpkCmYSP7bD4fyDRq/79tIvN5sekGNp8PRECmYbUGm88HUqDcW+aGClAFMg1rAzFtQAmIgBhIbH7F2s/m82plIpvPBypA1ZBpmM8PZD6vVs+w+bxaW5nN5/1+eDafDyRACpSBTEM6XwUyDSvD2HxeraXA5vNqjVM2n9fc2/MMZBr9K5jPB8r9vHlDBcg0rNxg83nt38N8Xq3uYfN57V/BfF6tPmfzeT+0j83nA6khS5/5fKBiI0H9/1abzuosrQ/4WD9jA0pABMRApmE1CZvPBzINq0nYfN5snQqbz5utm2Pz+YHM531nN5vPBzINa32x+bz1nDSfD2QaPf/M5wOZRu5dogrU+upU6x1tQKZhW9PYfN5K7zuZRs9d8/lACpSBTKN2FtOwMpvN5wcynx9fwXzebGiVzecDmYZ1Ktl8vjfALdvM6BPmDvufF4P9m5jXJ2wTirl9wuSQHHKH2aA47GoW+bJ1NSt6ZSsOu5pVvbI1wLQ57GrWspDU1awZJokddrXe/UxdzcpvSdlhVzu6pV1NOmyAtDlMDslhV7MSWEgcdjWLJ6HssDjsatq7wQ2Qu5r1JoWTw65mTT1hdtjVLHSE1WF22NXMr8LVYVezVrnI5rCr2ZyfCDlkh13NQkdEHXY1q+ZFikNT62drihUPx9l0YuXD3vUyNSsg9r6XvYWVEKlveRQrIiYUh+owOywdmppWh13Nyj7JXU37EEJXs1adZHLY1ayXJVkcdjVbliQ5OywOu1r/WLkBlq5mTTQpySE57GqlD2SIw65mNaGUrta/UOlqtf9CVzOLS2mAdXOYHHY1s77Urta/WxWHOgoEqV2s9V8tDqvDBmjFyN6vtdRYOTIhdWgZaSXJDvvvmhil/q/qMDssDqvD1mGzoZzNYVezINFelBD1sR522NWsl6+9KBkwO+xqVhDoKEo6bKPUVCtJBkpABMQzdLUXI/2aE+3FSL+TQ3sxMmBXkv5n/b2O4agG2IsRshDTXowMSA7ZYVfLHarDrmate+3FyIDVYQPsxQjZZivtxciA5LCrlT5CJg67mlXm2ouRAYvDrta6RAPsxQhZO0h7MTIgOTS1PuKjvRjh/n17MdK3SmgvRgYsHdpX78XIgA2wFyMDpg4t13sxMiA7FIeHmuWkek6q56R6TuqhZunNm8PkkBwy/iyLQ3Xoavl4N5t++K+f//j153/77Zd/7GO/Njz8r9//NoeC9x//+f/+c/6ff/vj199++/U//vqff/z9b7/8+7/++MWGjfuIMfVh45/+/JeyN0L2pvj/sZEo+3HX2tveNsxc7Ff2BP5lrwFls39p81+s1NkLC/s3C/TjH/cBW279n8T+aX/3v+wF/5/2YnMnt18QIxJI2T7HvUTsf5HnX5DdirD30e1v7JfImrl7L6YMjmRd1L1UTJOF7CTt/T8HD1K4fzbe38IGzP8/", "is_unconstrained": false, "name": "interactive_handshake", "verification_key": "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA4AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAALKBtFDVCn1CR0AW6yYR75S0AAAAAAAAAAAAAAAAAAAAAAA8P0drYhsv41OsJxOBcQwAAAAAAAAAAAAAAAAAAAN/y/IYbqppHJp0gzSZ/5c+JAAAAAAAAAAAAAAAAAAAAAAAjPKpjedzpJgWZvym3kOUAAAAAAAAAAAAAAAAAAAB18TuEBxEV+iWRCPpd+W5wQgAAAAAAAAAAAAAAAAAAAAAAB/LmnZMxP/ewd/i/T5cdAAAAAAAAAAAAAAAAAAAAAjZKEP1ClEMZXAerTbxIqlMAAAAAAAAAAAAAAAAAAAAAACQX+9PJFeuE7HA3Io8hWgAAAAAAAAAAAAAAAAAAAGChnE7OCeOjPnMUhS/+zXYmAAAAAAAAAAAAAAAAAAAAAAAE3vS6/OlUx/Tgj3p/SGEAAAAAAAAAAAAAAAAAAAAR1Zo0dYadRX7G4aDn6zUOuwAAAAAAAAAAAAAAAAAAAAAAAkcYsxS/vCzTsmE5MWBnAAAAAAAAAAAAAAAAAAAAbWZCQb4kNeVD9JZZrett4/kAAAAAAAAAAAAAAAAAAAAAABzRtolRBAMujSrC2YxDZwAAAAAAAAAAAAAAAAAAADHh9V1tzepOKn/yx0B86Hl5AAAAAAAAAAAAAAAAAAAAAAAeB29K0SZO5GANry0T2SkAAAAAAAAAAAAAAAAAAACe1nNGsySoE4shXxISpejQawAAAAAAAAAAAAAAAAAAAAAAK2Hg/WT6Atr43BhghQKRAAAAAAAAAAAAAAAAAAAAqMLErmuZIKpGb11Zv1cLUkEAAAAAAAAAAAAAAAAAAAAAACmK9B8HUicvhEJV9aHGQwAAAAAAAAAAAAAAAAAAAGX9+cAvzSEFQW2VjupUt0mlAAAAAAAAAAAAAAAAAAAAAAAvhODWCj4UPL9p8No01rgAAAAAAAAAAAAAAAAAAABR7i4jWwKNa4yu5qUYqWOopwAAAAAAAAAAAAAAAAAAAAAAHBNDpqnjICBNVn7mVBGVAAAAAAAAAAAAAAAAAAAAfEU8bEE0EUMKdrUK5/B3ddoAAAAAAAAAAAAAAAAAAAAAAAQ6NmpM32W9dhtgK+0V3AAAAAAAAAAAAAAAAAAAAM+NCoPgNkP8oNJlL2eGCrBsAAAAAAAAAAAAAAAAAAAAAAAhKjZ+xPt+cyzMRf5mJnUAAAAAAAAAAAAAAAAAAAArPp3FOTtWkUm4cxMYfQpvRAAAAAAAAAAAAAAAAAAAAAAABx7/QrNbYLZ40RX3svkxAAAAAAAAAAAAAAAAAAAAtIPYoTQt9pq4WBLLvzTKtPMAAAAAAAAAAAAAAAAAAAAAAAs73hax0bUQJONQJ6M/ZAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAspAuRZikJNhIOxLP7DodjoIAAAAAAAAAAAAAAAAAAAAAAAUSz+MuHJMyG9Z+RpM1RgAAAAAAAAAAAAAAAAAAAMVlti9clYZxYpW/rh6FsiznAAAAAAAAAAAAAAAAAAAAAAAE0RjAb2uDtyBPioocLdoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAzEcUjW/nMB+cklIJhAKVUtEAAAAAAAAAAAAAAAAAAAAAACa2TViInVd4CgEux7LQXwAAAAAAAAAAAAAAAAAAAHspTCoiQ80J+1k1Dw6p05axAAAAAAAAAAAAAAAAAAAAAAAkoOCSKgDO/Sq4CT60KzQAAAAAAAAAAAAAAAAAAABVZU1l3KfTWn7r8AaU2zfYBAAAAAAAAAAAAAAAAAAAAAAACB7PqCWG0v1vMR7oAoPlAAAAAAAAAAAAAAAAAAAAQ8WJm+N7dyUL9xN008bwlBgAAAAAAAAAAAAAAAAAAAAAABOkuWkvrE+cA/jEFvQVAgAAAAAAAAAAAAAAAAAAAOQlsAVYMTzF1OWrwAJdFO4DAAAAAAAAAAAAAAAAAAAAAAANUbta8dGNTdEbcSllZw8AAAAAAAAAAAAAAAAAAACgMxed+bXZo6R2KzFW9IhTYgAAAAAAAAAAAAAAAAAAAAAAEigek4Kh0tyB7yOSVXljAAAAAAAAAAAAAAAAAAAADtW793ySXxtfa2zZeqyo9kUAAAAAAAAAAAAAAAAAAAAAACyR6iAp+q8M4gTT6BHD4wAAAAAAAAAAAAAAAAAAACWq1ouah+guJ6ndSsPGn9SdAAAAAAAAAAAAAAAAAAAAAAACOJZSLlgMw0M3ER9mGkEAAAAAAAAAAAAAAAAAAADgpHjpLTd/8AqD5kua64quXwAAAAAAAAAAAAAAAAAAAAAAIEt1PkNojtHuxa8kg+XbAAAAAAAAAAAAAAAAAAAAzpGHyKmjzFVLewEzV5+a5fsAAAAAAAAAAAAAAAAAAAAAAA3JqyLqMAy97JOS7jAJjQAAAAAAAAAAAAAAAAAAAAWjrc6mQW4/DxV0mAph4E9VAAAAAAAAAAAAAAAAAAAAAAAHsGcO/NIVNbM3+8CCR8QAAAAAAAAAAAAAAAAAAABfmfKvlPeK2uCsG6T4wciN1gAAAAAAAAAAAAAAAAAAAAAAAT2XULsz+p9O9jOvfgsVAAAAAAAAAAAAAAAAAAAA50bZOzt9meNzNk0Fb+/ECAcAAAAAAAAAAAAAAAAAAAAAAB7IMwB5A1Qg9rGe7X4h5gAAAAAAAAAAAAAAAAAAAB0gdKcx5jKRUQHEKkiK7yajAAAAAAAAAAAAAAAAAAAAAAAtA5kfMXYaNRTEePVtKjMAAAAAAAAAAAAAAAAAAABH3s+AL/9wWA06W24vCWSbPQAAAAAAAAAAAAAAAAAAAAAAFfIaVtnck2hJXL8FP9xzAAAAAAAAAAAAAAAAAAAAOqj9LpDZQPOCjQVUvOvqS8wAAAAAAAAAAAAAAAAAAAAAAA1VyMiPEdGoc+HQVRvEEwAAAAAAAAAAAAAAAAAAAEMXfApw1iGi+mANoIgvmzS6AAAAAAAAAAAAAAAAAAAAAAAbcLa8u8B9QQtlg+EIgDsAAAAAAAAAAAAAAAAAAADPCQGxVQJWm/SxkI9+TT+IPwAAAAAAAAAAAAAAAAAAAAAALQzDfnhj600szmyykY56AAAAAAAAAAAAAAAAAAAAlt/3WF2OEyFH6CPgGQlYqEcAAAAAAAAAAAAAAAAAAAAAABBcljxnvjXuHs25acUplgAAAAAAAAAAAAAAAAAAALFf6w82JkGDifepGCBaZtrtAAAAAAAAAAAAAAAAAAAAAAAE0ey60j9tYPUSzjBKMtEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAo2Bn3G5njHpStv/+N+f28MIAAAAAAAAAAAAAAAAAAAAAACvM46xFe4XC3ZPqkPZ6JwAAAAAAAAAAAAAAAAAAAI6bICIzgLYtMYNG0KUhIr/iAAAAAAAAAAAAAAAAAAAAAAAJm2iYDeOW0BupIzpeccUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD33q8YQ7kfw7uG9DTf2sujvAAAAAAAAAAAAAAAAAAAAAAAUWU9TbMJSV8ypRi6TeaYAAAAAAAAAAAAAAAAAAADj5eNlUTnuZtU2tRNTu1R6UgAAAAAAAAAAAAAAAAAAAAAAJp25HsqqEy+BzzS7PCfRAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAUydtP9ckBhp0CiZt/LHzD+oAAAAAAAAAAAAAAAAAAAAAACmoPqQ0MEtRP4t5W753OwAAAAAAAAAAAAAAAAAAAEQ7gnkh5PcoZ8eubSHIGuKoAAAAAAAAAAAAAAAAAAAAAAAFVlOzghqASg0H8oXDBiAAAAAAAAAAAAAAAAAAAADgPFt0N56SpD6C4idwQvqEvwAAAAAAAAAAAAAAAAAAAAAAF7N6XgzQJQRvCVxxOQngAAAAAAAAAAAAAAAAAAAAist6meQBe0PYU6lGDqWhCsAAAAAAAAAAAAAAAAAAAAAAAA/DmU07YUc4EqxzNQbvYgAAAAAAAAAAAAAAAAAAAP9g97GcW5G915ndbTkGku6tAAAAAAAAAAAAAAAAAAAAAAAp1L6x0HM/U11hQlJvbr4AAAAAAAAAAAAAAAAAAAB1XHRQ3VxAOwk2HvtA3FvSkQAAAAAAAAAAAAAAAAAAAAAABjeempRpKzCI7hXZBOLaAAAAAAAAAAAAAAAAAAAA+U4bXg9r9LjB6d6qyIQScBQAAAAAAAAAAAAAAAAAAAAAACqDQcDBWPFjiby0LX8QuwAAAAAAAAAAAAAAAAAAAJbiPXwK2GjyTDVQUGv3jOp8AAAAAAAAAAAAAAAAAAAAAAATgFpA+F043JDHx/wWfy8AAAAAAAAAAAAAAAAAAABBti8wOPEUJPT5z0U/nUI9lwAAAAAAAAAAAAAAAAAAAAAAH1j6jqHLpiyU0j6cxdo3AAAAAAAAAAAAAAAAAAAATtzBEnicrHk04+RD7dW6GPAAAAAAAAAAAAAAAAAAAAAAABzUee1QB9ygqGStdgDlmQAAAAAAAAAAAAAAAAAAALYQ+j3taSNuiGpGlpXozKBDAAAAAAAAAAAAAAAAAAAAAAAARrQndAkSPClIS35+o4EAAAAAAAAAAAAAAAAAAAA/2fwDDfe/VIVjYYmC7N8e0QAAAAAAAAAAAAAAAAAAAAAACfbL6TXdfIdy775trKMIAAAAAAAAAAAAAAAAAAAAie3Xc2NuGLklaSJYzrCOYAAAAAAAAAAAAAAAAAAAAAAAAAfs8HTA6AF5M5jwIXrAZwAAAAAAAAAAAAAAAAAAAH4s+SCbDQ9U2QN+vlnGymabAAAAAAAAAAAAAAAAAAAAAAAMuZQZ8QnG/ykw/cu1T/Q=" }, { "abi": { "error_types": { "10033682601308824536": { "error_kind": "string", "string": "Ephemeral public key is the point at infinity" }, "10522114655416116165": { "error_kind": "string", "string": "Can't read a transient note with a zero contract address" }, "11088061827347467743": { "error_kind": "string", "string": "Note owner mismatch." }, "12366868613919617670": { "error_kind": "fmtstring", "item_types": [], "length": 20 }, "12469291177396340830": { "error_kind": "string", "string": "call to assert_max_bit_size" }, "12706857619424059571": { "error_kind": "fmtstring", "item_types": [], "length": 37 }, "12820178569648940736": { "error_kind": "fmtstring", "item_types": [ { "kind": "field" }, { "kind": "field" } ], "length": 48 }, "12913276134398371456": { "error_kind": "string", "string": "push out of bounds" }, "13455385521185560676": { "error_kind": "string", "string": "Storage slot 0 not allowed. Storage slots must start from 1." }, "14990209321349310352": { "error_kind": "string", "string": "attempt to add with overflow" }, "15835548349546956319": { "error_kind": "string", "string": "Field failed to decompose into specified 32 limbs" }, "16431471497789672479": { "error_kind": "string", "string": "Index out of bounds" }, "16466267804227883608": { "error_kind": "string", "string": "Got an ephemeral public key with a negative y coordinate" }, "17110599087403377004": { "error_kind": "fmtstring", "item_types": [], "length": 98 }, "17968463464609163264": { "error_kind": "string", "string": "Note is not in stage SETTLED" }, "186772300998906374": { "error_kind": "string", "string": "Obtained key validation request for wrong pk_m_hash" }, "1998584279744703196": { "error_kind": "string", "string": "attempt to subtract with overflow" }, "2431956315772066139": { "error_kind": "string", "string": "Note is not in stage PENDING_PREVIOUS_PHASE" }, "3387382714057837913": { "error_kind": "string", "string": "Note storage slot mismatch." }, "5449178635769758673": { "error_kind": "fmtstring", "item_types": [ { "kind": "field" }, { "kind": "field" } ], "length": 61 }, "643863379597415252": { "error_kind": "string", "string": "A NewNote cannot have a zero note hash counter" }, "7217415691812985622": { "error_kind": "fmtstring", "item_types": [], "length": 123 }, "8992688621799713766": { "error_kind": "string", "string": "Invalid public keys hint for address" }, "9460929337190338452": { "error_kind": "string", "string": "Note contract address mismatch." }, "9791669845391776238": { "error_kind": "string", "string": "0 has a square root; you cannot claim it is not square" }, "992401946138144806": { "error_kind": "string", "string": "Attempted to read past end of BoundedVec" }, "9970201630854352883": { "error_kind": "fmtstring", "item_types": [ { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } ], "length": 48 } }, "parameters": [ { "name": "inputs", "type": { "fields": [ { "name": "call_context", "type": { "fields": [ { "name": "msg_sender", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "contract_address", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "function_selector", "type": { "fields": [ { "name": "inner", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::function_selector::FunctionSelector" } }, { "name": "is_static_call", "type": { "kind": "boolean" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::call_context::CallContext" } }, { "name": "anchor_block_header", "type": { "fields": [ { "name": "last_archive", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } }, { "name": "state", "type": { "fields": [ { "name": "l1_to_l2_message_tree", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } }, { "name": "partial", "type": { "fields": [ { "name": "note_hash_tree", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } }, { "name": "nullifier_tree", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } }, { "name": "public_data_tree", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::partial_state_reference::PartialStateReference" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::state_reference::StateReference" } }, { "name": "sponge_blob_hash", "type": { "kind": "field" } }, { "name": "global_variables", "type": { "fields": [ { "name": "chain_id", "type": { "kind": "field" } }, { "name": "version", "type": { "kind": "field" } }, { "name": "block_number", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "slot_number", "type": { "kind": "field" } }, { "name": "timestamp", "type": { "kind": "integer", "sign": "unsigned", "width": 64 } }, { "name": "coinbase", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::eth_address::EthAddress" } }, { "name": "fee_recipient", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "gas_fees", "type": { "fields": [ { "name": "fee_per_da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } }, { "name": "fee_per_l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas_fees::GasFees" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::global_variables::GlobalVariables" } }, { "name": "total_fees", "type": { "kind": "field" } }, { "name": "total_mana_used", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::block_header::BlockHeader" } }, { "name": "tx_context", "type": { "fields": [ { "name": "chain_id", "type": { "kind": "field" } }, { "name": "version", "type": { "kind": "field" } }, { "name": "gas_settings", "type": { "fields": [ { "name": "gas_limits", "type": { "fields": [ { "name": "da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas::Gas" } }, { "name": "teardown_gas_limits", "type": { "fields": [ { "name": "da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas::Gas" } }, { "name": "max_fees_per_gas", "type": { "fields": [ { "name": "fee_per_da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } }, { "name": "fee_per_l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas_fees::GasFees" } }, { "name": "max_priority_fees_per_gas", "type": { "fields": [ { "name": "fee_per_da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } }, { "name": "fee_per_l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas_fees::GasFees" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas_settings::GasSettings" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::transaction::tx_context::TxContext" } }, { "name": "start_side_effect_counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "tx_request_salt", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::context::inputs::private_context_inputs::PrivateContextInputs" }, "visibility": "private" }, { "name": "sender", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" }, "visibility": "private" }, { "name": "recipient", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" }, "visibility": "private" } ], "return_type": { "abi_type": { "fields": [ { "name": "call_context", "type": { "fields": [ { "name": "msg_sender", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "contract_address", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "function_selector", "type": { "fields": [ { "name": "inner", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::function_selector::FunctionSelector" } }, { "name": "is_static_call", "type": { "kind": "boolean" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::call_context::CallContext" } }, { "name": "args_hash", "type": { "kind": "field" } }, { "name": "returns_hash", "type": { "kind": "field" } }, { "name": "anchor_block_header", "type": { "fields": [ { "name": "last_archive", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } }, { "name": "state", "type": { "fields": [ { "name": "l1_to_l2_message_tree", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } }, { "name": "partial", "type": { "fields": [ { "name": "note_hash_tree", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } }, { "name": "nullifier_tree", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } }, { "name": "public_data_tree", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::partial_state_reference::PartialStateReference" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::state_reference::StateReference" } }, { "name": "sponge_blob_hash", "type": { "kind": "field" } }, { "name": "global_variables", "type": { "fields": [ { "name": "chain_id", "type": { "kind": "field" } }, { "name": "version", "type": { "kind": "field" } }, { "name": "block_number", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "slot_number", "type": { "kind": "field" } }, { "name": "timestamp", "type": { "kind": "integer", "sign": "unsigned", "width": 64 } }, { "name": "coinbase", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::eth_address::EthAddress" } }, { "name": "fee_recipient", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "gas_fees", "type": { "fields": [ { "name": "fee_per_da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } }, { "name": "fee_per_l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas_fees::GasFees" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::global_variables::GlobalVariables" } }, { "name": "total_fees", "type": { "kind": "field" } }, { "name": "total_mana_used", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::block_header::BlockHeader" } }, { "name": "tx_context", "type": { "fields": [ { "name": "chain_id", "type": { "kind": "field" } }, { "name": "version", "type": { "kind": "field" } }, { "name": "gas_settings", "type": { "fields": [ { "name": "gas_limits", "type": { "fields": [ { "name": "da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas::Gas" } }, { "name": "teardown_gas_limits", "type": { "fields": [ { "name": "da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas::Gas" } }, { "name": "max_fees_per_gas", "type": { "fields": [ { "name": "fee_per_da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } }, { "name": "fee_per_l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas_fees::GasFees" } }, { "name": "max_priority_fees_per_gas", "type": { "fields": [ { "name": "fee_per_da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } }, { "name": "fee_per_l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas_fees::GasFees" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas_settings::GasSettings" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::transaction::tx_context::TxContext" } }, { "name": "min_revertible_side_effect_counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "is_fee_payer", "type": { "kind": "boolean" } }, { "name": "expiration_timestamp", "type": { "kind": "integer", "sign": "unsigned", "width": 64 } }, { "name": "start_side_effect_counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "end_side_effect_counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "expected_non_revertible_side_effect_counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "expected_revertible_side_effect_counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "note_hash_read_requests", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 16, "type": { "fields": [ { "name": "inner", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } }, { "name": "counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::counted::Counted" } }, { "name": "contract_address", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::scoped::Scoped" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "nullifier_read_requests", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 16, "type": { "fields": [ { "name": "inner", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } }, { "name": "counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::counted::Counted" } }, { "name": "contract_address", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::scoped::Scoped" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "key_validation_requests_and_separators", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 16, "type": { "fields": [ { "name": "request", "type": { "fields": [ { "name": "pk_m_hash", "type": { "kind": "field" } }, { "name": "sk_app", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::validation_requests::key_validation_request::KeyValidationRequest" } }, { "name": "key_type_domain_separator", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::validation_requests::key_validation_request_and_separator::KeyValidationRequestAndSeparator" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "private_call_requests", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 8, "type": { "fields": [ { "name": "call_context", "type": { "fields": [ { "name": "msg_sender", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "contract_address", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "function_selector", "type": { "fields": [ { "name": "inner", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::function_selector::FunctionSelector" } }, { "name": "is_static_call", "type": { "kind": "boolean" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::call_context::CallContext" } }, { "name": "args_hash", "type": { "kind": "field" } }, { "name": "returns_hash", "type": { "kind": "field" } }, { "name": "start_side_effect_counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "end_side_effect_counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::private_call_request::PrivateCallRequest" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "public_call_requests", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 32, "type": { "fields": [ { "name": "inner", "type": { "fields": [ { "name": "msg_sender", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "contract_address", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "is_static_call", "type": { "kind": "boolean" } }, { "name": "calldata_hash", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::public_call_request::PublicCallRequest" } }, { "name": "counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::counted::Counted" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "public_teardown_call_request", "type": { "fields": [ { "name": "msg_sender", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "contract_address", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "is_static_call", "type": { "kind": "boolean" } }, { "name": "calldata_hash", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::public_call_request::PublicCallRequest" } }, { "name": "note_hashes", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 16, "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } }, { "name": "counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::counted::Counted" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "nullifiers", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 16, "type": { "fields": [ { "name": "inner", "type": { "fields": [ { "name": "value", "type": { "kind": "field" } }, { "name": "note_hash", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::nullifier::Nullifier" } }, { "name": "counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::counted::Counted" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "l2_to_l1_msgs", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 8, "type": { "fields": [ { "name": "inner", "type": { "fields": [ { "name": "recipient", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::eth_address::EthAddress" } }, { "name": "content", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::messaging::l2_to_l1_message::L2ToL1Message" } }, { "name": "counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::counted::Counted" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "private_logs", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 16, "type": { "fields": [ { "name": "inner", "type": { "fields": [ { "name": "log", "type": { "fields": [ { "name": "fields", "type": { "kind": "array", "length": 16, "type": { "kind": "field" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::log::Log" } }, { "name": "note_hash_counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::private_log::PrivateLogData" } }, { "name": "counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::counted::Counted" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "contract_class_logs_hashes", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 1, "type": { "fields": [ { "name": "inner", "type": { "fields": [ { "name": "value", "type": { "kind": "field" } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::log_hash::LogHash" } }, { "name": "counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::counted::Counted" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "tx_request_salt", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::private_circuit_public_inputs::PrivateCircuitPublicInputs" }, "visibility": "databus" } }, "bytecode": "H4sIAAAAAAAA/+1dB3gU1RbOzJZssiGN3iQUAUGkCSoivXfpSA0hQCQkISQUFSXYK9mABRVR6VV6UVCwYNtLswASFcResXd5dyGbnS0z88/dOQi+5Xvf966bf845c+4557/3zsy9liLXQ0cbjx6dekNeetrorNzRGVl56blZqZlTR4/Oys46+5+paXkZ09JHT0zNGjd1Yuqk9OL4MQXrO2Smpk3qkD2jS35WWsfUzMyCpf3b9+nauahg+ZCMvKz0qVPlFABkkQBQEiKpbDsAVME9G0BVhFDVEKuqI6CLEFANBJQCWV4TQtWCULUhVJ2UgtUdcjMyMzMmeP4+P6qwcF5h4cspUdr/pIJV7adOTc/Nuy49N3teoavo5ZQm4/rknmj65CXb+3XeWlAwdGT95p93m7kjx9XxxM/zTvFLmCVbW+w7jU5OEhGboyrW4m2EcMTmftlT0zPGZWc165eeOzk/LzUvIzuraH6pY7i5pe26pa16ir/nzGeWKcySyyz8P/L8LS8q0ndhHeju8oG+0O9mLifFuIVlIQun6QiSrp0NWTitnX8oSq6CZQMysiZkpp+NBD1rEV9FnZE5OScznVmmY4GOmD5d8je9LLHpM4znqGseZAaXjRk8Uz80xPTP1L8zEcnTueR5UDxPh1AzIdQNBL1Urx5WF28E/OgXtbIvajGf3livUNuQ706fPlXkC9ubfM1ZNBFcjxuFeedmfcvDzembDeX0LVQ5fTOXjRk8mySnuf7ZNDk9i/8P6+0CAv14rM0BYs343d/EbwvSHzdU4O7174rrnwPFFZ3+2XBcG9avg7fhvX+rbu+vCR6aAbcPoW4TKCnALXHBRZDrC/7dAAXLw+0vp1RqVu+qnEcOlCuuX+tYu91rLptf+ac6rYu3d3vq1B+v/+bxUphkcLshMriDigxu57Ixg+8kIQOu/85CowMTS5HP24VAVxkbxXjCpNBQ79wFBuCdXDjm7JsAlyATkbsksTy5E8tmrObcbbR/rS6aLlMMPe/xNe8FldzN3UkzbrmLC8cK030k+u/hgjH995sUl/fzxSjjdt4L2/mASXY+IGQnTjRzSYjuPu5gbCQ4PHz9IwKkSmf0P4DpH0ESz1z/XKiAxQ2HUCOMFjCbP0EFggM9ZnTscL8hdipExd5nUtIU6g5EpEC5Z/oMW9+NG2UwZgrnF+l2gccAKGFdJobVKJP87QooUiFvOPDW0Bv25FHZplGHa3zYYmbDCi2z+0677cOBa28ut/iSzxIqfZvfetrvxdk8QziqevPej+3pf/36+1sldG0W+9ast+64vvm7c++e0+DH2UNm2msXmXfDRfyGVfPNtBTSTOHAMaYi3+ad63ybJ5hv87B8Gy2Sb4EkofTXr6dPn0bDbz5GY1C+jTbJ3/ND5VugkYnSnoSYlCdvmrDj0PZn2g54C73hB6FMwvLNrBt+MDDfrIanu8BARzE6f8jXfBgc83jH0Pqm3C0w5sD0Y5Omu6E4eIRkZPQQF4yNTBeYFDsLhEbQD8N2PmqSnY+GsBPoJX6DWBVNJRlpc/2PYvrHksTTXG4CNtJOhVCIledypA1kgYL5H0PFPmJS0D4mwvw8Zh7DYiaNZqT9CJTYj5sYVmkm+ftxsZE2dsMLoZH2WIj5zbrhhVojbWBYTJtvT5zrfHtCMN+ewPJtnBn5FtAFcL4tMjHfxpnk70VIvgUu/6M3/KSJ+WbWDT8put4Ijpaeonqw9oiZDwyeNpoH2BPSuRBqsUHlRehA6SkI+DS3AOvLJUa9BD960n3O50cJ9kLFzG2pr7lM9H26db3zM/MyBqSlZqbm8ub8ooIVHbOzpualZuUB8oKx8v6yo/LtS0amNapXpvP3lZLn39r25fvntK13qTLzliray4woLGKW5cyyItznwcsNMd9KqufB/FZWYgavInkezPWvMvw82Li3Vxjy9moqb6/gsjGD15B4m+tfQ/NIcxUoOfx+1Hv6r+jHtYT9uNbDQXq2eGCIvHVUvb3OBVm5Lpw3MkzLQCMveSjT9Rn0S4F1QvQUPGp7Rgp3eRTwhoJk1/uaG8Ah2jpuJWbKMyRDRI9+bIj4DNR1G0mq1nouGAudTSYN+DcJDfg3wHZuNsnOzULLoxv5DWJT34kky6Nc/2ZMfwZJPPGKuxFbHp0IoTKM1mXi5VEgCxR1eQsqdqNJQbtFZLmGx8wWLGaup1ke3Qgl9lYTw+p6k/y9VWx5FLvhbdByTQa0XGPWDW8Lb3k0ijbftp/rfNsumG/bsXybZPby6NkXEbDw22Fivk0yyd87xJZHsRt+1sR8M+uGnw3/RQRjI+3nfM2dIOd7R7rAmBhC6Y/HRWasHivnmWklhNpFci/PccHYaPh5k+LweaFR+07YzhdMsvMFoVH7Ln6DWEWeTDJq5/pfwPRnUY3ad2Gj9skQCrHyXI7anzc0itiNit1lUtDuFhlF8JjZjcVMNs2ofReU2HtMDKtsk/y9R2zUjt3wi9AoIgsaRZh1wy+G//owQiRGJgKKfHvpXOfbS4L59hKWbzki+ab1+vDZlxqw8HsZozEo33JM8vfLYq8PYzf8CpRJWL6ZdcOvBN6wefEt8I3+TdgQbC/J0OIm/tge0/+qkPODH537umGvov2qWY++X2OW10U2aXpDW/pdj5+sKCL2TVWxNg2v6e/99IaivVzRXqFovzmfWdzMwphlH7Ps97d+HhTxeyGUG/LEAaNlFzPxVQjFIBMPCoW4fmcdULQPKtr7FO39vLMOMQuvq28zyzvhLiocMrSo8K6veVhgczWsow5BXfBuETIhO3yeTWDeNTSBOWLevl5HQnQF5uRAdYH6uWxI1lH9uQh0J0cDORm7lcMQCruV9/RnGdCtvBdyY0MtJnxN0X5d+Yd3Fe3DBpnwGLMU+2dBdKEiCt8n20bxA22x3/Uf0FtE7IdCOaNfnT9QtD9U3UjxOLOcYJaPmOVkuK8IHTdULD6mekWI39DHhUZfrXQYvNu6+vf6iO9eP/E1P/U1P/M1P/c1v/A1v/Q1v/I1vyaL72+0xbIXUxcJBeI3ivanivZnAaH4LbN8xyynmOV7Eet/0Lb+siHxPUTE/qgqNtrbEHLKD4r2J4r2t4r2j9wpPzHLz8zyC7P8KjI4+RxC/QR54jeage4XEOpnyMTfaUz8EkL9Apn4B9FY/DdF+3dF+w9F+1ceT38yy1/M8jez/CPiia8g1J+QJ04TeeK0ov2Xov23ov3PfGaNYlaJWWVmtQjUBatV2/qfBn9/QsR6q1XRjlJY/LV/sbTamNXOrNHM6ghzTmW1GZlTWWN8zViqOZXVBnVBDDKnssaeX3Mqa4yRYZLVadqcyuoUmVOdcXKgukD9XDYkK86cOZU1TmhOZY2FUNitlDFnTmUtA86p6D/M4Znta8cam5NZ45k1IcR9rO88eWz6uHHp4zrm505Lbz9unHJ2aI1XtBOKVAeJxixJZNYk4xuu14U6PdFoKYkx/LzrkzCfdwX+U1TuZF+zrEDlxl61+QSqgclGx2kYJ5fTFjv2ruQPhDi5nCIejyt+LxvAyeWZtQKzVmTWSv5hEGuYk8sbIonK5pFEZekcToytVXzNqr5mNV+zuq95ka9Zw9dM8TVromFSmWjBRTHP5bfja1cLCJNazFqbWesw68Xhzhy5A33tWv4zR2tdZq3HrPWZ9RKRIVh1CIXVzQYk0zLrRRCqHmRiQxoTa0Co+pCJl9LMl6wNFO2GivalivYlPJ4aMetlzNqYWZuIeCIFQjWCPNGUyBNNFe3LFO3GinYT7olmzNqcWS9n1hZhT/GaKdo1A+pES2a9glmvZNarwp3itTQ0UGjla15tZk01/IKktTI3BnpBkMMQea3NedHC2lrkdU/P3VyN3c3V0N1cY9LdXBNwN/PQu2mJLMh7gK2RV508wGuwYtIS621ofQDx4rlcH2htaOjXhnbQExwsbSTjm3J4Q0C/MziwTai3tEKIhEMg8NpA+7hKSFZbk1Yv2gakG+zCa1BgKBeO+HX/gnceufPAhHtdz7yfdfPyJagLr4FQmAvbmbRq0i5wAagIywEI1V4oU/6VJZvWyiquaLfnCyEdmLWj4SWZDop2xyL9+cwZTZ2YtbPhiOazk/YQz7TnCgpJRudnFiv0DagCoboYpRHDD9gRFQpm6Er0gN3ahcvGDO5GsbuGR383wzueGF6Js1ahW4nr7mv2AMeO3XgiYHa3N5grLjQLu2Fj1/ZQuvQ0aGURZGUVLhiKoe4cSLIfzxlHYSOyXgIu0NdflguGgD24CzBDexNNt9WWVXsHzIP7MGtfZu3HrNf657TTcAXto38n6CEOQnmmK9WS70kgE/Osv0lzxP4p6q/cWQdQ+Qyc2wzUFmv/flVVoQAdGDpALccCVloHMetgZh3CrENFRiHFkOsGQZ4YRjNQeh8ycTBk4nUUJtaFDBwCGTicqNwNU7SvU7SHK9pDeTSNYNaRzDqKWUeLrLMOgFAjIE+MIfLEGEV7pKI9StEezT2RyqxjmTWNWcf5F5+4h01/KEXwsqtRchpg8oCzYGn73NzUmfApKcf0RaKiis0T9b75jk41XyRAs//uwMIzLu1v5sAi3aSBRXpKuNNiwPeKscp4qmlxfy4bM3gCybSY659ANqWZYHjCXWaekWIlXQgFfYEviib6mhm+5vW+5iRfM9PXnOxrZvma2b5mDhr0lU1Kv2yH4Wm2Rzu6Ej2JJiK55Ezso3iRE6j1pPKly8rY8XRGtUOrHJbjBjogq1AoUAzNjXgs+9oTA+ZGU5g1l1n5H/JERrMZEGoKxFj5JHMj6/UQKhcycRqNiZkQaipk4nSieMpXtKcp2tMV7TweTzOYdSaz3sCsN4p4AtqAwjoD8sRNRJ64SdGeqWjfoGjfyD0xi1lvZtZbmHV2uCOobO3b/e706X8UI6gCqhFUNpet9yDPY4sHhsibQzLO4lbOcUFWzqFZ7bpVW+xrY5vOF4q7WxXtSYr2rIDl2NuY9XZmvYNZ7xRj7jnYbd5FMnLgvXcX1nt30fSezqGIZW6fNkuo9+5WtHMU7dsCeu8eZr2XWe9j1vvDrRrAXpOKqvEAVdWYxGVjBs8lqQdc/1yRUS70htUcbMqOvdhAMxafywXTHG2R77kxE+/fZdKcyZVCT7inFalTREi4RQDhnvbAEHnzqAh3nguycp7BMMSeqPJxViEEvItXV4wE5hMNHdUofH4ACTzIrA8x68PM+ogYhWMHWlsXUFH4AiweFhC5WY1rHwxw86PM+hizPs6sC8Wq/zwzq98TRlfwHIbLWqa+CsXHP4t8zSd9zad8zad9zcW+5hJf03cGmnUZ7cKZsY9/nlS0nwqIieXMuoJZVzLrqrA//lmkaC8PWHZZzaxrmHUts64TmSY/DaFWQ3Fn9Jgb0MTFEGoNZOJ6GhOXQKi1kIkbiErZM4r2ekV7g6K9jsfTRmbdxKybmXWLiCeWQihou3zrViJPbFW0NynamxXtLdwT25h1O7PuYNZnw/74Z5uivSygTjzHrDuZdRezPh/uxz/P6TtM8W7iC77mbjNrqtA4A9ud3LrHpIH9HpHd5j12YjtiW180yc4XRT8/2oM9NLkj/Ols6G87XsT030kVT89hu83fAaHuNDqgIv5wCMgCxaTypXP9pFFk92tPn4G7XxteroN2mwfH1i+bGFZ3meTvl4V2mwdv2LP7tf5u83cWIbtfm3XDr5w/W6nsURZr5e4KRcy6l1lfNfxdjmJLaatyS2m1qcYZTa8x6+tiPPEazeNtUz/LWQSh3jBapI0v5r1hqO6+SbWY9waXjRnsJlmm4/rd5+CznEVGXv0x9lkO8zX3gbniRl8FERojQ7nqNnORaD/FCyvWRVwwFEOMA8neGHJjg3TD+7ljYnX2YLfY//xAYG2aTxSfgIAL+GokZughkkX0styxEHAfDwHM0LeIFgIUO9lbDynabwXM0N9m1neY9V1mPSwWjy4zE/eISYOoIwHPtuLnGS3Qbxso0JivCnk/FBop+5ihwOPAQjMnSerfTx39lxev4Q+d3mPWY8xazKzv033o9B4U7x/QDD2xD52OQSZ+SGEi9qFTMWTgcaJoUmw8b/1Q0VZ+4/k+j6YTzPoRs55k1o9F1pSPQqgTkCc+IfKEYmNv60eK9klF+2PuiU+Z9TNm/ZxZv/h/+NDpqMlD+MiHTqFFWj81X+SRc0yaQiOrI2aOrL40aWT1ZdhvDQG+VwwqvqJaaDjCZWMGf02y0MD1f002SSSSPImPYrFZzTck+rvDmz18S6KfwbO670j045tdnCLRj89qvyfR75lCYfp/MDqTSXjE6JDimOm0hPCwUZGm8/G/PDiDt5k7in4UOqDwvHeRhFDm2eEjX6T8kVl/YtafmfUXZv2VWX9j1t+Z9Q9m/ZNZ/2LWv5n1H2Y9zWxRzCZh5OqXKIlF/7IzAIG+1XCb7GtaTNtf3CZL6usgNiu4mGqTjfo+qchYHthkz11DpnCzoWS1Wc2d9sgKx9nM6yBbivHVXWPeKsK8BQWCnWSx3hZNI9ahKlYuFSuwzGCzK/tP0Y5WtB3zmS2G2WKZzclscSLWl9F2ytC7dt8lZH0ZRTtGw/p4ZktgtkRmSxIb2n+JvUhSZLDv4T0U0jH9Rj9iwA6/sSVDT/Sx96PmmVRrksOcEkfpQxRFsizNhJj7tixW0spCqHIEk2ZuYzkXql0HFHUu+6w8WZ+Vx/xR3mBvgLW0grbu9DdfKBQRW1FVrNXbECrRFVSeCRUrMBV5ia7EbJWZrQqzVTX8LoMnRJGF/yio2ypB7qpGs+xvU2yQbKusaCtOa7FV5e6qzmwXMVsNFjDmAju7prb1XQqmWYV6oQjsBX0LaxH5V3lQxvuK32v5P6G31Wa2Osx2MbPVFfFvPW3rv2/c4g0h630nMNfTGO3UZ7ZLmK0BszX0r7fljD6Qtyw3d96RYgAslc6ui6NSmO1SZmvEbJcxW2Nma8JsTZmtGbM1Z7bLma0Fs7VktiuY7Upmu4rZWjHb1czWmtmuYbY2zNaW2doxW3tm68BsHZmtE7N1ZrYuzNaV2boxW3dm68FsPc2bA13qgGCNMNhlGKwxBmuCwZpisGYYrDkGuxyDtcBgLTHYFRjsSgx2FQZrhcGuxmCtMdg1GKwNBmuLwdphsPYYrAMG64jBOmGwzhisCwbrisG6YbDuGKwHBuvpv5tbYXFUTYwiIEK8tEj3o2s+9Gqki/IM0C7TQ50ZxjXWRhWd+bDI1kQT9dPZz49sTbVQx0s+UrI100B18H7KZGuujios/eDJdrkqKtv3WZSthRpqu+LjKZvaiUczlJ9Y2a4Ijerq9yGW7cqQqM/8P9eyXRUK1Szgoy5bqHO36gV++mULcZ5V8AdituDzmoaMDEYFnUcze2gIVOB5NLMLQqHa+qO2FIREtfNDddoaGuW3bWrfziqoDgrUtn5qqI4+VP3tqqhOpahFl6ijOntRTZ7UQHUpQR1vqoXqehY15YQmqtsZVO9cbVR3Dyqtjw6qB0c1HqeH6km9anFGhU7tO6hYt+hF9PKFrSeXDWzZctADQ+T1pnhFw2NlbxdkZW+jPVe+SKDndEAHDE1pFM/I+viafc2bfvTBYH0dAq9N2npCJN4HGhD0BTxrPHh6c/XYDL0Pfdr30PXWQkXa96NKez6/7Qek/UIPDJF3LUnacyuvdUFWXkuf9j10QY+Lpn1/X3OAeWnfH4MNEEr7HlDa94fSbgDgWeOn84HKBwrkl75UXnOuxR7i9IasHETxENE2kAt2maY/zMrYXTegNikq42CqysgX/wYDlXGTB4bIG0JSGbmVQ1yQlUMEIgeK70FmxvdQow+psRIAHdBjGwYEUpjk0V0XtFGUPK7zNYebRx7XYbDhQuTRHSKP66DOGw54ViByMOUjSErQUB6SWFkeSUILI7hgGv2g80dCqFEkzvdWNqAGQqjRRouLcebspptNcxXMOYaKOfmTszEAc871wBB5qSTMya1MdUFWppIw5ygeEmZmwViDfQmmYCqESqNnzm66oAdEmXOcr5luHnOOw2DpQszZDWLOcVDnpQOeFYgcTPl4khI0lockxlwTSJhzPBdMox90/gQINZHE+d7Kpo/EKlsG/Zyzq242pSiY83oq5uzKZQPMmeKBIfImkTAnt3KSC7JyEglzTuQhYWYWZNIw5yQINZmeObvqgmqIMqfvsDlbtnnMmYXBsoWYsyvEnFlQ52UDnhWIHEx5DkkJyuQhiTHXFBLmzOGCafSDzp8CoXJJnO+tbPpIrLJNpWfOLrrZdEDBnHlUzNmFywaY84AHhsjLJ2FObmW+C7Iyn4Q5c3lImJkF02iYMx9CTadnzi66oP2izDnD15xpHnPOwGAzhZizC8Sc0BmHtpmAZwUiB1N+A0kJmsZDEmOuG0mY8wYumEY/6PwbIdRNJM73VjZ9JFbZZtEzZ2fdbEpVMOfNVMzZmcsGmDPVA0Pk3ULCnNzKW1yQlbeQMOdNPCTMzILZNMx5C4QqoGfOzrqgMaLMOcfXvNU85pyDwW4VYs7OEHPOgTrvVsCzApGDKb+NpATN5iGJMdftJMx5GxdMox90/u0Q6g4S53srmz4Sq2x30jNnJ91sOqJgzruomLMTlw0w5xEPDJF3NwlzcivvdkFW3k3CnHfwkDAzC+6hYc67IdS99MzZSRd0WJQ57/M17zePOe/DYPcLMWcniDnvgzrvfsCzApGDKX+ApATdw0MSY665JMz5ABdMox90/lwIRVP/vZVNH4lVNhc9c3bUzabuCuakOh/a86k9cj50dw8MkUdyPrTHSuR86O5n9OuIE2HOQh4SZmbBfBrmxLaJepCeOTvqgrqJMudDvubD5jHnQxjsYSHm7Agx50NQ5z0MeFYgcjDlj5CUoPk8JDHmIjls3PYIF0yjH3T+Agj1KInzvZVNH4lVtsfombODbjZtUDDn41TM2YHLBphzgweGyFtIwpzcyoUuyMqFJMz5KA8JM7PgCRrmXAihFtEzZwdd0HpR5nzS13zKPOZ8EoM9JcScHSDmfBLqvKcAzwpEDqb8aZIS9AQPSYy5FpMw59NcMI1+0PmLIdQSEud7K5s+EqtsS+mZs71uNu1UMOcyKuZsz2UDzLnTA0PkLSdhTm7lchdk5XIS5lzCQ8LMLFhBw5zYvlIr6ZmzvS7oOVHmXOVrrjaPOVdhsNVCzNkeYs5VUOetBjwrEDmY8jUkJWgFD0mMudaSMOcaLphGP+j8tRBqHYnzvZVNH4lVtmfombOdbjb1VDDneirmbMdlA8zZ0wND5G0gYU5u5QYXZOUGEuZcx0PCzCzYSMOcGyDUJnrmbKcL6iHKnJt9zS3mMedmDLZFiDnbQcy5Geq8LYBnBSIHU76VpARt5CGJMdc2EubcygXT6Aedvw1CbSdxvrey6SOxyraDnjnb6mbTbAVzPkvFnG25bIA5Z3tgiLznSJiTW/mcC7LyORLm3M5Dwsws2EnDnM9BqF30zNlWF3SLKHM+72u+YB5zPo/BXhBizrYQcz4Pdd4LgGcFIgdTvpukBPGVol0Yc+0hYc7dXDCNftD5eyDUiyTO91Y2fSRW2V6iZ842hpjzZSrmbMNlY8z5MnRbr5AwJ7fyFYw5XyFhzhd5SJiZBXtpmPMVCPUqPXO2oWPO13zN181jztcw2OtCzNkGYs7XoM57nYY5MeVvkJSgvTwkMeZ6k4Q53+CCafSDzn8TQrlJnO+tbPpIrLIxeua8RjebViqYcx8Vc17DZQPMudIDQ+TtJ2FObuV+F2TlfhLmdPOQMDMLDtAw534IdZCeOa/RBa0QZc5DvuZb5jHnIQz2lhBzXgMx5yGo894CPCsQOZjyt0lK0AEekhhzvUPCnG9zwTT6Qee/A6HeJXG+t7LpI7HKdpieOVvrZtMSBXMeoWLO1lw2wJxLPDBE3lES5uRWHnVBVh4lYc53eUiYmQXv0TDnUQh1jJ45W+uCFosyZ7Gv+b55zFmMwd4XYs7WEHMWQ533PuBZgcjBlH9AUoLe4yGJMdeHJMz5ARdMox90/ocQ6jiJ872VTR+JVbYT9Mx5tW42HVUw50dUzHk1lw0w51EPDJF3koQ5uZUnXZCVJ0mY8zgPCTOz4GMa5jwJoT6hZ86rdUFHRJnzU1/zM/OY81MM9pkQc14NMeenUOd9BnhWIHIw5Z+TlKCPeUhizPUFCXN+zgXT6Aed/wWE+pLE+d7Kpo/EKttX9MzZSjeb9imY82sq5mzFZQPMuc8DQ+R9Q8Kc3MpvXJCV35Aw55c8JMzMgm9pmPMbCPUdPXO20gUxUeY85Wt+bx5znsJg3wsxZyuIOU9Bnfc94FmByMGU/0BSgr7lIYkx148kzPkDF0yjH3T+jxDqJxLneyubPhKrbD/TM+dVutlUWcGcv1Ax51VcNsCclT0wRN6vJMzJrfzVBVn5Kwlz/sRDwsws+I2GOX+FUL/TM+dVuqBKosz5h6/5p3nM+QcG+1OIOa+CmPMPqPP+BDwrEDmY8r9IStBvPCQx5vqbhDn/4oJp9IPO/xtC/UPifG9l00dile00PXNeqZtNO3zMaY+iYs4ruWyAOXd4YIA8u0TCnNxKyQVZKZEw5z88JEzMArtMwpx2CUJZ6JnzSl3QdkHmtFt9TZtpzGm3YjCbEHNeiTCn3Qp1ng3wrEDkYMrtFCXILvOQhJjLHk3BnHY7F0yjH3R+NIRykNR/b2XTR2KVLYaeOa/Qzaa7FMwZS8WcV3DZAHPe5YEhYegkYU5updMFWemkYE67g4eEmVkQR8OcTghVhp45r9AF3SnKnPG+ZoJ5zBmPwRKEmPMKiDnjoc5LADwrEDmY8kQS5ozjIYkxVxIJcyZywTT6QecnQahkEud7K5s+EqtsZemZs6VuNnVTMGc5KuZsyWUDzNnNA0P8W56EObmV5V2QleVJmDOZh4SZWVCBhjnLQ6iK9MzZUhfUVZQ5K/malc1jzkoYrLIQc7aEmLMS1HmVAc8KRA6mvApJ8a7AQxJjrqokzFmFC6bRDzq/KoSqRuJ8b2XTR2KVrTo9c7bQzSaXgjkvomLOFlw2wJwuDwzxbw0S5uRW1nBBVtYgYc5qPCTMzIIUGuasAaFq0jNnC11QoShz1vI1a5vHnLUwWG0h5mwBMWctqPNqA54ViBxMeR2S4p3CQxJjrotJmLMOF0yjH3T+xRCqLonzvZVNH4lVtnr0zHm5bjblKJizPhVzXs5lA8yZ44Eh/r2EhDm5lZe4ICsvIWHOujwkzMyCBjTMeQmEakjPnJfrgrJFmfNSX7ORecx5KQZrJMScl0PMeSnUeY0AzwpEDqb8MpLi3YCHJMZcjUmY8zIumEY/6PzGEKoJifO9lU0fiVW2pvTM2Vw3m55XMGczKuZszmUDzPm8B4b4tzkJc3Irm7sgK5uTMGcTHhJmZsHlNMzZHEK1oGdO/V7YJcqcLX3NK8xjzpYY7Aoh5mwOMWdLqPOuADwrEDmY8itJijcfFrfAmOsqEua8kgum0Q86/yoI1YrE+d7Kpo/EKtvV9MzZTDebUhTM2ZqKOZtx2QBzpnhgiH+vIWFObuU1LsjKa0iYsxUPCTOzoA0Nc14DodrSM2czXVANUeZs52u2N48522Gw9kLM2QxiznZQ57UHPCsQOZjyDiTFuw0PSYy5OpIwZwcumEY/6PyOEKoTifO9lU0fiVW2zvTM2VQ3m+IUzNmFijmbctkAc8Z5YIh/u5IwJ7eyqwuysisJc3biIWFmFnSjYc6uEKo7PXPqr9k4RZmzh6/Z0zzm7IHBegoxZ1OIOXtAndcT8KxA5GDKe5EU7248JDHm6k3CnL24YBr9oPN7Q6g+JM73VjZ9JFbZ+tIzZxPdbMpSMGc/Kubks/V+AHNmeWCIf68lYU5u5bUuyMprSZizDw8JM7OgPw1zXguhBtAzp/4zmcmizDnQ1xxkHnMOxGCDhJizCcScA6HOGwR4ViByMOWDSYp3fx6SGHMNIWHOwVwwjX7Q+UMg1FAS53srmz4Sq2zD6JmzsW42JSmY8zoq5mzMZQPMmeSBIf4dTsKc3MrhLsjK4STMOZSHhJlZMIKGOYdDqJH0zKn/KkWiKHOO8jVHm8ecozDYaCHmbAwx5yio80YDnhWIHEz5GJLiPYKHJMZcqSTMOYYLptEPOj8VQo0lcb63sukjscqWRs+c+u+pRSmYcxwVc17GZUMG29NJOJHrTy8kYbuxvBvNjNzxNGyXDqEmCHQ+cEtccCF9qDcyFOoTqUK9EZeNhXoGSahz/RkXRqhfTxPqGRBqEkmoX88Fn4NQv1TfFkWoZ1KF+qVcNtYnmVBCTCZJCG7lZGzIMvmCSJssmrSZDKGySQZWfBU3G+uiHIpRrSdEcozWTNCtORBqColbvZGnj8QiL5dkSjGFC8YIMweoD36V1V6omAxP9TXzRCfD63rnZ+ZlDEhLzUzN5c35RQUrOmZnTc1LzcoD5AVj5f1lR+Xbl4xMa1SvTOfvKyXPv7Xty/fPaVvvUuVEeqqinWdEYRGz5zP7tDDZxp5vaGA1nYhtPLcyHTN4BgWPePTPoOd2+zRD3p5J5e1pXDZm8A0k3ub6bxAZxupLngFKDr8fKzWrd1XOIwfKFdevdazd7jWXza/8U53Wxdu7PXXqj9d/4yBFP95I2I83ejhAzxYPDJF3E1Vv3+SCrLzJaM9Ziggy0G9BVsdoZbrOOmuDPtXeJERPwYuwswKWp60U9UhBsjf7mreA4+ObuJWYKbNIxuce/dgoaRbUdbNJqtbNXDAWOgWAfiR0CtyzBey8BbZzjkl2zglhJ9BL/AYhO+OWhB91IwKkSmf0z8H0LyWJJ15xZ0NRH7cEQi01WpdtRZpPtQI9ZrRsAVmgqMu3omJnmxS0t+pyuRQo90zM3IrFzDKjk9n5Rbpd4DEASuzbTAyrZSb5+7aAIhHyhgNvDb3h2zmqbNOowzU+bDGzYYWW2X2n3fbhwLU3l1t8yWcJlb7Nbz3t9+JsniEcVb1578f29L9+/f2tEro2i31r1lt3XN/83bl3z2nw4+whM+21i8y74dv5DRvJt8BBC22+3XGu8+0OwXy7A8u35Wbkm7ILfj19+jQafneamG/LTfL3nUi+BQ6c0Ru+y8R8M+uG7wrMN+qR9t2+5j0g53tHusCYGELpj8dFZqweK+eZaSWEupfkXu7mgrHR8H0mxeF9QqP2e2A77zfJzvuFRu338hvEKvJKklE7138/pn8V1aj9XmzUvhJCIVaey1H7fYZGEQ+gYu81KWgfEBlF8Jh5AIuZ1TSj9nuhxJ5rYlitNsnfc8VG7dgNF0KjiFXQKMKsGy7UGrWblkKGJgKKfHOd63xzCeabC8u3NSL5FkgSgf5Cw68IozEo39aY5O+iUPkWaGSitCchJuXJmybsOLT9mbYD3kJveB6USVi+mXXD8wJv2Lz4DnpXQFespQDxo2WOUc4OfHalr2KWoWdX88WeXQFmcNnYs6v5ULc9KPDsCrLyQezZ1YPhPLvSf9BkdLRlmWVotPUQ+uzqQSAYkOR8KNxnV8gNKmbUD/uaj4DzkQe5lVjJeIjk2ZVHP/bs6iGo6xaQzFoe5oKx0HnUpLr+qNAs+BHYzsdMsvMxoVnwAn6D2AhnHcksmOt/DNP/DEU8eSruAmwWvA5CPWO0LhPPgh81VJcfR8UuMCloHxcZlfOYeRyLmfU0s+AFUGIvNDGs1pvk74Vis2Dshp+AZsHPQKNys274ifBnwQiRGJgFK4e7i851vi0SzLdFWL5tMHsWfPbZFRZ+T2I0BuXbBpP8/aTYLBi74aegTMLyzawbfirsZ1cGR9pP+5qLwbGZd6QLjIkhlP54XOR5j8fKeWZaCaGWkNzL01wwNhpealIcLhUatS+G7TTr3YplQqP2JfwGsYq8iWTUzvUvw/Rvphq1L8FG7ZsgFGLluRy1A1mgGEUsR8UuMSlol4uMInjMLMdiZgvNqH0JlNgrTAyrLSb5e4XYqB274ZXQqH0zNIow64ZXhvfGGXG+rTrX+bZKMN9WYfm21Yx8C352hYXfahPzbatJ/l4t9sYZdsNrTMw3s254jfHRkuxjYeC5BuSZtUJ3E/wdpfe+6inucK1ZX0GuY/ZnQlixuV/21PSMcdlZzfql507Oz0vNy8jOKprvU2SroFC6TtF+RoGpOJ/Z1zP7BmbfyOybjO95JEFlaT3UG5uFekPXD/bNivYGRXujor2J+2ELs29l9m3Mvj34saq+9Tu0rf/n1y31hKzfoWhvUfRctKLt4NY/y+zPMftOZt8lYv3zutbXF7L+edD6F5h9N7PvYfYX/Wm43DyjzPpsmItnAf9SDG1f5ipY2j43N3VmcVQKs7/E7C8z+yvMvpfZX2X215j9dWZ/g9nfZHY3szNm38fs+5n9ALMfZPZDzM6XYd5m9neY/V1mP8zsR5j9KLO/x+zHmL2Y2d9n9g+Y/UNmP87sJ5j9I/O2RHvJAcFexmCvYLC9GOxVDPYaBnsdg72Bwd7EYG4MxjDYPgy2H4MdwGAHMdghDPYWBnsbg72Dwd7FYIcx2BEMdhSDvYfBjmGwYgz2Pgb7AIN9iMGOY7ATGOyjgE0ai6NqYhQBUeJLRchmji/rojwaX9FDnbFrrzaq6OxS2KuaqJ9KFsxe00Id9y6rva6B6lC6+PaGOqrQt0T3pioqW7GQ51ZDbVcu9zEV1Ay/RcF9oVFd/ZcO94dEfRawwHggFKpZ4DLkwRCoekGLlYeKkCXNt4JQQ0YGo94ORM0eGgL1TgBqdkEo1Lv+qC0FIVGH/VCdtoZGHVGi+nZWQR1VoLb1U0O950PV366KOlaKWnSJOqrYi2rypAbq/RLU8aZaqA/Ooqac0ER9eAbVO1cbddyDSuujgzrBUY3H6aE+CvclSv0S+ZFu7TuoWJ86SbUByEdcNrBp9UEPDJH3sX7hF7PyYxdk5cdGe87wjsxAcBwQ3ZH5E1/zU/OmH59gsE9FdmS2fwSR+CfQgOBTwLPGg+djrh6bo39Cn/YndL21UJH2n1GlPZ/ffgak/UIPDJH3OUnacys/d0FWfk6f9id0QY+Lpv0XvuaX5qX9FxjsS6G0PwGl/RdQ2n0JeFZgb0VM+VcC+aUvldecz7E3rz+GrPya4pm7/Ssu2GWa/jAr43HdgNqkqIzfUFVGvvj3DVAZN3lgiLxvSSojt/JbF2Tlt+G/LRI6vr82M76/M/q8EisB30KoU0AghUkex3VBG0XJ43tf8wfzyON7DPaDEHkch8jje6jzfgA8KxA5mPIfSUrQdzwksbL8Ewkt/MgF0+gHnf8ThPqZxPneygbUQAj1i9HiYpw5P9TNprkK5vyVijn5k7NfAeac64Eh8n4jYU5u5W8uyMrfSJjzZx4SZmbB7wb7EkzB3yDUH/TM+aEu6AFR5vzT1/zLPOb8E4P9JcScH0LM+SfUeX8BnhWIHEz53yQl6Hcekhhz/UPCnH9zwTT6Qef/A6FOkzjfW9n0kVBli46in3N+oJtNKT7mjJaomPMDLhtgzhQPDJAXLZMwJ7dSdkFWyiTMeZqHhIlZEG0hYc5oGUJZ6ZnzA11QDUHmjLb5mnbTmDPahsHsQsz5AcKc0Tao8+yAZwUiB1MeTVGCoi08JCHminZQMGd0NBdMox90vgNCxZDUf29l00dilS2Wnjnf182mAwrmdFIx5/tcNsCcBzwwJAzjSJiTWxnngqyMo2DO6BgeEmZmQRka5oyDUPH0zPm+Lmi/KHMm+JqJ5jFnAgZLFGLO9yHmTIA6LxHwrEDkYMqTSJizDA9JjLmSSZgziQum0Q86PxlClSVxvrey6SOxylaOnjmLdbMpVcGc5amYs5jLBpgz1QND/FuBhDm5lRVckJUVSJizLA8JM7OgIg1zVoBQleiZs1gXNEaUOSv7mlXMY87KGKyKEHMWQ8xZGeq8KoBnBSIHU16VpHhX5CGJMVc1EuasygXT6AedXw1CVSdxvrey6SOxynYRPXMe082mIwrmrEHFnMe4bIA5j3hgiH9TSJiTW5nigqxMIWHO6jwkzMyCmjTMmQKhatEz5zFd0GFR5qzta9YxjzlrY7A6Qsx5DGLO2lDn1QE8KxA5mPKLSYp3TR6SGHPVJWHOi7lgGv2g8+tCqHokzvdWNn0kVtnq0zPne7rZ1F3BnJdQMed7XDbAnN09MMS/DUiYk1vZwAVZ2YCEOevxkDAzCxrSMGcDCHUpPXO+pwvqJsqcjXzNy8xjzkYY7DIh5nwPYs5GUOddBnhWIHIw5Y1JindDHpIYczUhYc7GXDCNftD5TSBUUxLneyubPhKrbM3omfOobjZtUDBncyrmPMplA8y5wQND/Hs5CXNyKy93QVZeTsKcTXlImJkFLWiY83II1ZKeOY/qgtaLMucVvuaV5jHnFRjsSiHmPAox5xVQ510JeFYgcjDlV5EU7xY8JDHmakXCnFdxwTT6Qee3glBXkzjfW9n0kVhla03PnEd0s2mngjmvoWJOvsB5DcCcOz0wxL9tSJiTW9nGBVnZhoQ5r+YhYWYWtKVhzjYQqh09cx7RBT0nypztfc0O5jFnewzWQYg5j0DM2R7qvA6AZwUiB1PekaR4t+UhiTFXJxLm7MgF0+gHnd8JQnUmcb63sukjscrWhZ45D+tmU08Fc3alYs7DXDbAnD09MMS/3UiYk1vZzQVZ2Y2EOTvzkDAzC7rTMGc3CNWDnjkP64J6iDJnT1+zl3nM2ROD9RJizsMQc/aEOq8X4FmByMGU9yYp3vwZSw+MufqQMGdvLphGP+j8PhCqL4nzvZVNH4lVtn70zPmubjbNVjDntVTM+S6XDTDnbA8M8W9/EubkVvZ3QVb2J2HOvjwkzMyCATTM2R9CDaRnznd1QbeIMucgX3Owecw5CIMNFmLOdyHmHAR13mDAswKRgykfQlK8B/CQxJhrKAlzDuGCafSDzh8KoYaRON9b2fSRWGW7jp453zHEnMOpmPMdLhtjzuGQf0eQMCe3cgTGnCNImHMYDwkzs2AkDXOOgFCj6JnzHTrmHO1rjjGPOUdjsDFCzPkOxJyjoc4bQ8OcmPJUkuI9kockxlxjSZgzlQum0Q86fyyESiNxvrey6SOxyjaOnjnf1s2mlQrmTKdizre5bIA5V3pgiH/HkzAnt3K8C7JyPAlzpvGQMDMLJtAw53gINZGeOd/WBa0QZc4MX/N685gzA4NdL8Scb0PMmQF13vWAZwUiB1M+iaR4T+AhiTFXJglzTuKCafSDzs+EUJNJnO+tbPpIrLJl0TPnW7rZtETBnNlUzPkWlw0w5xIPDPFvDglzcitzXJCVOSTMOZmHhJlZMIWGOXMgVC49c76lC1osypxTfc0885hzKgbLE2LOtyDmnAp1Xh7gWYHIwZTnkxTvKTwkMeaaRsKc+VwwjX7Q+dMg1HQS53srmz4Sq2wz6JnzkG42HVUw50wq5jzEZQPMedQDQ/x7AwlzcitvcEFW3kDCnNN5SJiZBTfSMOcNEOomeuY8pAs6Isqcs3zNm81jzlkY7GYh5jwEMecsqPNuBjwrEDmY8ltIiveNPCQx5ppNwpy3cME0+kHnz4ZQBSTO91Y2fSRW2ebQM+dB3Wzap2DOW6mY8yCXDTDnPg8M8e9tJMzJrbzNBVl5GwlzFvCQMDMLbqdhztsg1B30zHlQF8REmfNOX/Mu85jzTgx2lxBzHoSY806o8+4CPCsQOZjyu0mK9+08JDHmuoeEOe/mgmn0g86/B0LdS+J8b2XTR2KV7T565jygm02VFcx5PxVzHuCyAeas7IEh/n2AhDm5lQ+4ICsfIGHOe3lImJkFc2mY8wEIVUjPnAd0QZVEmVORFEXmMacLgxUJMecBiDmx4l0EeFYgcjDl80iK91wekpj++STMOY8LptEPOn8+hHqQxPneyqaPxCrbQ/TMuV83m3YoisTDVMy5n8sGmHOHB4b49xES5uRWPuKCrHyEhDkf5CFhZhYsoGHORyDUo/TMuV8XtF2UOR/zNR83jzkfw2CPCzHnfog5H4M673HAswKRgylfSFK8F/CQxJjrCRLmXMgF0+gHnf8EhFpE4nxvZdNHYpXtSXrm3KebTXcpmPMpKubkC5xPAcx5lweG+PdpEubkVj7tgqx8moQ5F/GQMDMLFtMw59MQagk9c+7TBd0pypxLfc1l5jHnUgy2TIg590HMuRTqvGWAZwUiB1O+nKR4L+YhiTHXChLmXM4F0+gHnb8CQq0kcb63sukjscq2ip45mW42dVMw52oq5mRcNsCc3TwwxL9rSJiTW7nGBVm5hoQ5V/KQMDML1tIw5xoItY6eOZkuqKsocz7ja643jzmfwWDrhZiTQcz5DNR56wHPCkQOpnwDSfFey0MSY66NJMy5gQum0Q86fyOE2kTifG9l00dilW0zPXO6dbPJpWDOLVTM6eayAeZ0eWCIf7eSMCe3cqsLsnIrCXNu4iFhZhZso2HOrRBqOz1zunVBhaLMucPXfNY85tyBwZ4VYk43xJw7oM57FvCsQORgyp8jKd7beEhizLWThDmf44Jp9IPO3wmhdpE431vZ9JFYZXuenjnf1M2mHAVzvkDFnG9y2QBz5nhgiH93kzAnt3K3C7JyNwlz7uIhYWYW7KFhzt0Q6kV65nxTF5Qtypwv+Zovm8ecL2Gwl4WY802IOV+COu9lwLMCkYMpf4WkeO/hIYkx114S5nyFC6bRDzp/L4R6lcT53sqmj8Qq22v0zPmGbjY9r2DO16mY8w0uG2DO5z0wxL9vkDAnt/INF2TlGyTM+SoPCTOz4E0a5nwDQrnpmVO/F3aJMifzNfeZx5wMg+0TYs43IOZkUOftAzwrEDmY8v0kxZsPi90Ycx0gYc79XDCNftD5ByDUQRLneyubPhKrbIfomfN13WxKUTDnW1TM+TqXDTBnigeG+PdtEubkVr7tgqx8m4Q5D/KQMDML3qFhzrch1Lv0zPm6LqiGKHMe9jWPmMechzHYESHmfB1izsNQ5x0BPCsQOZjyoyTF+x0ekhhzvUfCnEe5YBr9oPPfg1DHSJzvrWz6SKyyFdMz52u62RSnYM73qZjzNS4bYM44Dwzx7wckzMmt/MAFWfkBCXMe4yFhZhZ8SMOcH0Co4/TMqb9m4xRlzhO+5kfmMecJDPaREHO+BjHnCajzPgI8KxA5mPKTJMX7Qx6SGHN9TMKcJ7lgGv2g8z+GUJ+QON9b2fSRWGX7lJ45X9XNpiwFc35GxZx8tv4ZwJxZHhji389JmJNb+bkLsvJzEub8hIeEmVnwBQ1zfg6hvqRnTv1nMpNFmfMrX/Nr85jzKwz2tRBzvgox51dQ530NeFYgcjDl35AU7y94SGLM9S0Jc37DBdPoB53/LYT6jsT53sqmj8Qq2yl65tyrm01JCub8noo593LZAHMmeWCIf38gYU5u5Q8uyMofSJjzOx4SZmbBjzTM+QOE+omeOfVfpUgUZc6ffc1fzGPOnzHYL0LMuRdizp+hzvsF8KxA5GDKfyUp3j/ykMSY6zcS5vyVC6bRDzr/Nwj1O4nzvZVNH4lVtj/omVP/PbUoBXP+ScWcr3DZkMHRf5FwItf/VyEJ2/3Ou9HMyP2bhu3+glD/CHQ+cEtccCF9qL9sKNRPU4X6y1w2ZLAjiiTUX+aCL4hQd0gkoe6IglAyRag7eK/K5yDUX9K3xRfqDgtVqL/EZWN9YoESwkqSENxKKzRk8ejXEXc+pI2NJm2sEMpOEUgOGxeMdVE0xajWEyLRRmsm6NZoCOUgGa96I08fiUVeDIXzHQ4uGCPMaKA++FXWcvOMVtYXgFvEJ+NRKYZm7q6Cpe1zc1NnFkelMEcscziZI445yjBHPHMkMEcicyQxRzJzlGWOcsxRnjkqMEdF5qjEHJWZowpzVGWOasxRnTkuYo4azMGF1GSOWsxRmznqMMfFzFGXOeoxR33muMS01QBHrAOCOTFYHAYrg8HiMVgCBkvEYEkYLBmDlcVg5TBYeQxWAYNVxGCVMFhlDFYFg1XFYNUwWHUMdhEGq4HBUjBYTQxWC4PVxmB1MNjFGKwuBquHwepjsEsC1ieLo2piFAFxZSyyjulw6qI8vBenhzrDjmW0UUWnzqDiNVE/zTuLStBCHf+5BJWogepwwotKUkcVdixFJauisl0+VFk11PYcBaqcCmrGDiWqfGhU15l+qAohUZ9180dVDIVq9nkAqlIIVL3mgajKwagR9YNQVYJQQ0YGo6oGomYPDYGqFoCaXRAKVd0ftaUgJOoiP1SnraFRNZSovp1VUCkK1LZ+aqiaPlT97aqoWqWoRZeoo2p7UU2e1EDVKUEdb6qFuvgsasoJTVTdM6jeudqoeh5UWh8dVH2OajxOD3UJ+fqER4VO7TuoWJ9oQLQ+4biEywae1x70wBB5DSnWJzxWNnRBVjY02nOGH0YCwXFA8GGk41Jfs5F5049LMVgjkYeRjksgEr8UGhA0AjxrPHgacvXYysml9GlfX9dbCxVpfxlV2vP57WVA2i/0wBB5jUnSnlvZ2AVZ2Zg+7evrgh4XTfsmvmZT89K+CQZrKpT29aG0bwKlXVPAswLLipjyZiQPOXjNaVyEESZkZXOSZcVmXLDLNP1hVsZ6ugG1SVEZL6eqjHzx73KgMm7ywBB5LUgqI7eyhQuysgXFAxtPfDc3M75b0jxZaAGhriB/gc0T3DqgjaLkcaWveZV55HElBrtKiDzqQeRxJdR5VwGeFYgcTHkrkhLUkockVpavJqGFVlwwjX7Q+VdDqNYkzvdWNqAGQqhrjBYX48xZVzeb5iqYsw0Vc/InZ20A5pzrgSHy2pIwJ7eyrQuysi0Jc7bmIWFmFrSjedWhLYRqT8+cdXVBD4gyZwdfs6N5zNkBg3UUYs66EHN2gDqvI+BZgcjBlHciKUHteEhizNWZhDk7ccE0+kHnd4ZQXUic761s+kissnWln3NerJtNii2uHN2omPNiLhva4orDEHndSZiTW9kd2uLKo19HnAhzduEhYWYW9KBhzu4Qqic9c16sCxLd4srRy9fsbR5z9sJgvYWY82KIOXtBndcb8KxA5GDK+5CUoB48JDHm6kvCnH24YBr9oPP7Qqh+JM73VjZ9JFbZrqVnzjq62XRAwZz9qZizDpcNMOcBDwyRN4CEObmVA1yQlQNImLMfDwkzs2AgDXMOgFCD6Jmzji5ovyhzDvY1h5jHnIMx2BAh5qwDMedgqPOGAJ4ViBxM+VCSEjSQhyTGXMNImHMoF0yjH3T+MAh1HYnzvZVNH4lVtuH0zFlbN5tSFcw5goo5a3PZAHOmemCIvJEkzMmtHOmCrBxJwpzX8ZAwMwtG0TDnSAg1mp45a+uCxogy5xhfM9U85hyDwVKFmLM2xJxjoM5LBTwrEDmY8rEkJWgUD0mMudJImHMsF0yjH3R+GoQaR+J8b2XTR2KVLZ2eOWvpZtMRBXOOp2LOWlw2wJxHPDBE3gQS5uRWTnBBVk4gYc5xPCTMzIKJNMw5AUJl0DNnLV3QYVHmvN7XnGQec16PwSYJMWctiDmvhzpvEuBZgcjBlGeSlKCJPCQx5ppMwpyZXDCNftD5kyFUFonzvZVNH4lVtmx65qypm03dFcyZQ8WcNblsgDm7e2CIvCkkzMmtnOKCrJxCwpxZPCTMzIJcGuacAqGm0jNnTV1QN1HmzPM1881jzjwMli/EnDUh5syDOi8f8KxA5GDKp5GUoFwekhhzTSdhzmlcMI1+0PnTIdQMEud7K5s+EqtsM+mZM0U3mzYomPMGKuZM4bIB5tzggSHybiRhTm7ljS7IyhtJmHMGDwkzs+AmGua8EULNomfOFF3QelHmvNnXvMU85rwZg90ixJwpEHPeDHXeLYBnBSIHUz6bpATdxEMSY64CEuaczQXT6AedXwCh5pA431vZ9JFYZbuVnjlr6GbTTgVz3kbFnDW4bIA5d3pgiLzbSZiTW3m7C7LydhLmnMNDwswsuIOGOW+HUHfSM2cNXdBzosx5l695t3nMeRcGu1uIOWtAzHkX1Hl3A54ViBxM+T0kJegOHpIYc91Lwpz3cME0+kHn3wuh7iNxvrey6SOxynY/PXNepJtNPRXM+QAVc17EZQPM2dMDQ+TNJWFObuVcF2TlXBLmvI+HhJlZUEjDnHMhlIueOS/SBfUQZU5Fc555zFmEweYJMedFEHNiXTwP8KxA5GCo+SQlqJCHJMZcD5Iw53wumEY/6PwHIdRDJM73VjZ9JFbZHqZnzuq62TRbwZyPUDFndS4bYM7ZHhgibwEJc3IrF7ggKxeQMOdDPCTMzIJHaZhzAYR6jJ45q+uCbhFlzsd9zYXmMefjGGyhEHNWh5jzcajzFgKeFYgcTPkTJCXoUR6SGHMtImHOJ7hgGv2g8xdBqCdJnO+tbPpIrLI9Rc+c1Qwx59NUzFmNy8aY82nothaTMCe3cjHGnItJmPNJHhJmZsESGuZcDKGW0jNnNTrmXOZrLjePOZdhsOVCzFkNYs5lUOctp2FOTPkKkhK0hIckxlwrSZhzBRdMox90/koItYrE+d7Kpo/EKttqeuasqptNKxXMuYaKOaty2QBzrvTAEHlrSZiTW7nWBVm5loQ5V/GQMDML1tEw51oI9Qw9c1bVBa0QZc71vuYG85hzPQbbIMScVSHmXA913gbAswKRgynfSFKC1vGQxJhrEwlzbuSCafSDzt8EoTaTON9b2fSRWGXbQs+cVXSzaYmCObdSMWcVLhtgziUeGCJvGwlzciu3uSArt5Ew52YeEmZmwXYa5twGoXbQM2cVXdBiUeZ81td8zjzmfBaDPSfEnFUg5nwW6rznAM8KRA6mfCdJCdrOQxJjrl0kzLmTC6bRDzp/F4R6nsT53sqmj8Qq2wv0zFlZN5uOKphzNxVzVuayAeY86oEh8vaQMCe3co8LsnIPCXM+z0PCzCx4kYY590Col+iZs7Iu6Igoc77sa75iHnO+jMFeEWLOyhBzvgx13iuAZwUiB1O+l6QEvchDEmOuV0mYcy8XTKMfdP6rEOo1Eud7K5s+Eqtsr9MzZyXdbNqnYM43qJizEpcNMOc+DwyR9yYJc3Ir33RBVr5Jwpyv8ZAwMwvcNMz5JoRi9MxZSRfERJlzn6+53zzm3IfB9gsxZyWIOfdBnbcf8KxA5GDKD5CUIDcPSYy5DpIw5wEumEY/6PyDEOoQifO9lU0fiVW2t+iZs6JuNlVWMOfbVMxZkcsGmLOyB4bIe4eEObmV77ggK98hYc5DPCTMzIJ3aZjzHQh1mJ45K+qCKoky5xFf86h5zHkEgx0VYs6KEHMegTrvKOBZgcjBlL9HUoLe5SGJMdcxEuZ8jwum0Q86/xiEKiZxvrey6SOxyvY+PXNW0M2mHQrm/ICKOStw2QBz7vDAEHkfkjAnt/JDF2TlhyTMWcxDwswsOE7DnB9CqBP0zFlBF7RdlDk/8jVPmsecH2Gwk0LMWQFizo+gzjsJeFYgcjDlH5OUoOM8JDHm+oSEOT/mgmn0g87/BEJ9SuJ8b2XTR2KV7TN65iyvm013KZjzcyrmLM9lA8x5lweGyPuChDm5lV+4ICu/IGHOT3lImJkFX9Iw5xcQ6it65iyvC7pTlDm/9jW/MY85v8Zg3wgxZ3mIOb+GOu8bwLMCkYMp/5akBH3JQxJjru9ImPNbLphGP+j87yDUKRLneyubPhKrbN/TM2c53WzqpmDOH6iYsxyXDTBnNw8MkfcjCXNyK390QVb+SMKcp3hImJkFP9Ew548Q6md65iynC+oqypy/+Jq/msecv2CwX4WYsxzEnL9Anfcr4FmByMGU/0ZSgn7iIYkx1+8kzPkbF0yjH3T+7xDqDxLneyubPhKrbH/SM2dZ3WxyKZjzLyrmLMtlA8zp8sAQeX+TMCe38m8XZOXfJMz5Bw8JM7PgHxrm/BtCnaZnzrK6oEJB5oyJ8jUl05gzBoRJQsxZFmHOmCik82IkwLPGIwdULpOUoH94SELMFWOhYM4YmQum0Q863wKhrCTO91Y2fSRU2WJs9MyZrJtNOT7mjLFTMWcylw0wZ44HhoRhNAlzciujXZCV0RTMGWPlIWFmFjhImDMmGkLF0DNnsi4oW5Q5Y31Np3nMGYvBnELMmQwxZyzUeU7AswKRgymPoyhBMQ4ekhhzlSFhzjgumEY/6PwyECqexPneyqaPxCpbAj1zJulm0/MK5kykYs4kLhtgzuc9MMS/SSTMya1MckFWJpEwZzwPCTOzIJmGOZMgVFl65tTvhV2izFnO1yxvHnOWw2DlhZgzCWLOclDnlQc8KxA5mPIKJMWbD4vLYsxVkYQ5K3DBNPpB51eEUJVInO+tbPpIrLJVpmfORN1sSlEwZxUq5kzksgHmTPHAEP9WJWFObmVVF2RlVRLmrMRDwswsqEbDnFUhVHV65kzUBdUQZc6LfM0a5jHnRRishhBzJkLMeRHUeTUAzwpEDqY8haR4V+MhiTFXTRLm5FWjJo1+0Pk1IVQtEud7K5s+EqtstemZM0E3m+IUzFmHijkTuGyAOeM8MMS/F5MwJ7fyYhdk5cUkzFmLh4SZWVCXhjkvhlD16JlTf83GKcqc9X3NS8xjzvoY7BIh5kyAmLM+1HmXAJ4ViBxMeQOS4l2XhyTGXA1JmLMBF0yjH3R+Qwh1KYnzvZVNH4lVtkb0zBmvm01ZCua8jIo5+Wz9MoA5szwwxL+NSZiTW9nYBVnZmIQ5L+UhYWYWNKFhzsYQqik9c+o/k5ksypzNfM3m5jFnMwzWXIg54yHmbAZ1XnPAswKRgym/nKR4N+EhiTFXCxLmvJwLptEPOr8FhGpJ4nxvZdNHYpXtCnrmLKObTUkK5rySijnLcNkAcyZ5YIh/ryJhTm7lVS7IyqtImLMlDwkzs6AVDXNeBaGupmdO/VcpEkWZs7WveY15zNkag10jxJxlIOZsDXXeNYBnBSIHU96GpHi34iGJMVdbEuZswwXT6Aed3xZCtSNxvrey6SOxytaenjn131OLUjBnByrm5AucHSCDYzqScCLX37GQhO3a8W40M3I70bBdRwjVWaDzgVviggvpQ91pKNS7UIW6k8vGQr0rSahz/V0vjFDvRhPqXSFUd5JQ78YFn4NQj9W3RRHqPahCPZbLxvqkB5QQPUkSglvZExuy9Lwg0qYXTdr0hFC9SQZWvbhgrIv6UIxqPSHSx2jNBN3aB0L1JXGrN/L0kVjk9SOZUvTlgjHC7GOwPhRiMXWttu5/ft1ySYgJ7+Z+2VPTM8ZlZzXrl547OT8vNS8jO6tovmICfK2vbd/ia9uiFW3HfBbTn8UMYDEDWcwgEesH61rfQMj6waD1Q1jMUBYzjMVc589q5eYZZLWY/kB44QshUSmGVk1cBUvb5+amziyOSmExw1nMCBYzksWMYjGjWcwYFpPKYsaymDQWM47FcEodz2ImsJiJLCaDxVzPYiaxmEwWM5nF8MdR2Swmh8VMYTG5LIa7MY/F5LOYaSxmOouZwWJmspgbzFuJGe6AYCMw2EgMNgqDjcZgYzBYKgYbi8HSMNg4DJaOwcZjsAkYbCIGy8Bg12OwSRgsE4NNxmBZGCwbg+VgsCkYLBeDTcVgeRgsH4NNw2DTMdgMDDYTg90QsDZcHFUTowiIEodDa8gjdFEejSP1UGfsGqWNKjp1BjVaE/XTvLOoMVqo4z+XoFI1UB1OeFFj1VGFHUtRaaqobJcPNU4NtT1HgUpXQc3YoUSND43qOtMPNSEk6rNu/qiJoVDNPg9AZYRA1WseiLo+GDWifhBqUhBqyMhgVGYgavbQEKjJAajZBaFQWf6oLQUhUdl+qE5bQ6NylKi+nVVQUxSobf3UULk+VP3tqqippahFl6ij8ryoJk9qoPJLUMebaqGmnUVNOaGJmn4G1TtXGzXDg0rro4OayVGNx+mhbiBfG/Ko0Kl9BxVrQzcSrQ3F3MBlA8/KD3pgiLybKNaGPFbe5IKsvMlozxl+EAwExwHRB8GzfM2bzZt+zMJgN4s8CI65ASLxWdCA4GbAs8aD5yauHpujz6JP+5m63lqoSPtbqNKez29vAdJ+oQeGyJtNkvbcytkuyMrZ9Gk/Uxf0uGjaF/iac8xL+wIMNkco7WdCaV8Apd0cwLMCS7qY8ltJHjDxmjMbW9K9CbLyNpIl3Vu5YJdp+sOsjDN0A2qTojLeTlUZ+eLf7UBl3OSBIfLuIKmM3Mo7XJCVd5A8LOPxfZuZ8X0nzVOdOyDUXeQvD3qCWwe0UZQ87vY17zGPPO7GYPcIkccMiDzuhjrvHsCzApGDKb+XpATdyUMSK8v3kdDCvVwwjX7Q+fdBqPtJnO+tbEANhFAPGC0uxplzum42zVUw51wq5uRPzuYCzDnXA0PkFZIwJ7ey0AVZSfN21v08JMzMAhfNayaFEKqInjmn64IeEGXOeb7mfPOYcx4Gmy/EnNMh5pwHdd58wLMCkYMpf5CkBLl4SGLM9RAJcz7IBdPoB53/EIR6mMT53sqmj8Qq2yP0c85putmk3F5sARVzTuOyse3FFkC39SgJc3IrH8W2F3uUhDkf5iFhZhY8RsOcj0Kox+mZc5ouSHh7sYW+5hPmMedCDPaEEHNOg5hzIdR5TwCeFYgcTPkikhL0GA9JjLmeJGHORVwwjX7Q+U9CqKdInO+tbPpIrLI9Tc+c+brZdEDBnIupmDOfywaY84AHhshbQsKc3MolLsjKJSTM+RQPCTOzYCkNcy6BUMvomTNfF7RflDmX+5orzGPO5RhshRBz5kPMuRzqvBWAZwUiB1O+kqQELeUhiTHXKhLmXMkF0+gHnb8KQq0mcb63sukjscq2hp4583SzKVXBnGupmDOPywaYM9UDQ+StI2FObuU6F2TlOhLmXM1DwswseIaGOddBqPX0zJmnCxojypwbfM2N5jHnBgy2UYg58yDm3AB13kbAswKRgynfRFKCnuEhiTHXZhLm3MQF0+gHnb8ZQm0hcb63sukjscq2lZ45p+pm0xEFc26jYk5eDrYBzHnEA0PkbSdhTm7ldhdk5XYS5tzCQ8LMLNhBw5zbIdSz9Mw5VRd0WJQ5n/M1d5rHnM9hsJ1CzDkVYs7noM7bCXhWIHIw5btIStAOHpIYcz1Pwpy7uGAa/aDzn4dQL5A431vZ9JFYZdtNz5y5utnUXcGce6iYM5fLBpizuweGyHuRhDm5lS+6ICtfJGHOF3hImJkFL9Ew54sQ6mV65szVBXUTZc5XfM295jHnKxhsrxBz5kLM+QrUeXsBzwpEDqb8VZIS9BIPSYy5XiNhzle5YBr9oPNfg1CvkzjfW9n0kVhle4OeOafoZtMGBXO+ScWcU7hsgDk3eGCIPDcJc3Ir3S7ISjcJc77OQ8LMLGA0zOmGUPvomXOKLmi9KHPu9zUPmMec+zHYASHmnAIx536o8w4AnhWIHEz5QZISxHhIYsx1iIQ5D3LBNPpB5x+CUG+RON9b2fSRWGV7m545c3SzaaeCOd+hYs4cLhtgzp0eGCLvXRLm5Fa+64KsfJeEOd/iIWFmFhymYc53IdQReubM0QU9J8qcR33N98xjzqMY7D0h5syBmPMo1HnvAZ4ViBxM+TGSEnSYhyTGXMUkzHmMC6bRDzq/GEK9T+J8b2XTR2KV7QN65szWzaaeCub8kIo5s7lsgDl7emCIvOMkzMmtPO6CrDxOwpzv85AwMwtO0DDncQj1ET1zZuuCeogy50lf82PzmPMkBvtYiDmzIeY8CXXex4BnBSIHU/4JSQk6wUMSY65PSZjzEy6YRj/o/E8h1GckzvdWNn0kVtk+p2fOLN1smq1gzi+omDOLywaYc7YHhsj7koQ5uZVfuiArvyRhzs94SJiZBV/RMOeXEOpreubM0gXdIsqc3/ia35rHnN9gsG+FmDMLYs5voM77FvCsQORgyr8jKUFf8ZDEmOsUCXN+xwXT6AedfwpCfU/ifG9l00dile0HeuacbIg5f6RizslcNsacP0K39RMJc3Irf8KY8ycS5vyeh4SZWfAzDXP+BKF+oWfOyXTM+auv+Zt5zPkrBvtNiDknQ8z5K9R5v9EwJ6b8d5IS9DMPSYy5/iBhzt+5YBr9oPP/gFB/kjjfW9n0kVhl+4ueOTN1s2mlgjn/pmLOTC4bYM6VHhgi7x8S5uRW/uOCrPyHhDn/5CFhZhacpmHOfxBUbBQ9c2bqglYIMmes5GvKpjFnrITBZCHmzESYM1aCOk8GPGs8ckDlFpISdJqHJMRcsVYK5oy1cME0+kHnWyGUjcT53sqmj4QqW6ydnjkn6WbTEh9zxkZTMeckLhtgziUeGBKGDhLm5FY6XJCVDgrmjLXxkDAzC2JImDPWAaFi6Zlzki5osShzOn3NOPOY04nB4oSYcxLEnE6o8+IAzwpEDqa8DEUJio3hIYkxVzwJc5bhgmn0g86Ph1AJJM73VjZ9JFbZEumZ83rdbDqqYM4kKua8nssGmPOoB4b4N5mEObmVyS7IymQS5kzgIWFmFpSlYc5kCFWOnjmv1wUdEWXO8r5mBfOYszwGqyDEnNdDzFke6rwKgGcFIgdTXpGkeJflIYkxVyUS5qzIBdPoB51fCUJVJnG+t7LpI7HKVoWeOTN0s2mfgjmrUjFnBpcNMOc+DwzxbzUS5uRWVnNBVlYjYc7KPCTMzILqNMxZDUJdRM+cGbogJsqcNXzNFPOYswYGSxFizgyIOWtAnZcCeFYgcjDlNUmKd3Uekhhz1SJhzppcMI1+0Pm1IFRtEud7K5s+EqtsdeiZc6JuNlVWMOfFVMw5kcsGmLOyB4b4ty4Jc3Ir67ogK+uSMGdtHhJmZkE9GuasC6Hq0zPnRF1QJVHmvMTXbGAec16CwRoIMedEiDkvgTqvAeBZgcjBlDckKd71eEhizHUpCXM25IJp9IPOvxRCNSJxvrey6SOxynYZPXNO0M2mHQrmbEzFnBO4bIA5d3hgiH+bkDAnt7KJC7KyCQlzNuIhYWYWNKVhziYQqhk9c07QBW0XZc7mvubl5jFncwx2uRBzToCYsznUeZcDnhWIHEx5C5Li3ZSHJMZcLUmYswUXTKMfdH5LCHUFifO9lU0fiVW2K+mZc7xuNt2lYM6rqJhzPJcNMOddHhji31YkzMmtbOWCrGxFwpxX8JAwMwuupmHOVhCqNT1zjtcF3SnKnNf4mm3MY85rMFgbIeYcDzHnNVDntQE8KxA5mPK2JMX7ah6SGHO1I2HOtlwwjX7Q+e0gVHsS53srmz4Sq2wd6JkzXTebuimYsyMVc3pkA8zZzQND/NuJhDm5lZ1ckJWdSJizPQ8JM7OgMw1zdoJQXeiZM10X1FWUObv6mt3MY86uGKybEHOmQ8zZFeq8boBnBSIHU96dpHh35iGJMVcPEubszgXT6Aed3wNC9SRxvrey6SOxytaLnjnH6WaTS8GcvamYcxyXDTCnywND/NuHhDm5lX1ckJV9SJizJw8JM7OgLw1z9oFQ/eiZc5wuqFCUOa/1Nfubx5zXYrD+Qsw5DmLOa6HO6w94ViByMOUDSIp3Xx6SGHMNJGHOAVwwjX7Q+QMh1CAS53srmz4Sq2yD6ZkzTTebchTMOYSKOdO4bIA5czwwxL9DSZiTWznUBVk5lIQ5B/GQMDMLhtEw51AIdR09c6bpgrJFmXO4rznCPOYcjsFGCDFnGsScw6HOGwF4ViByMOUjSYr3MB6SGHONImHOkVwwjX7Q+aMg1GgS53srmz4Sq2xj6JlzrG42Pa9gzlQq5hzLZQPM+bwHhvh3LAlzcivHuiArx5Iw52geEmZmQRoNc46FUOPomVO/F3aJMme6rznePOZMx2DjhZhzLMSc6VDnjQc8KxA5mPIJJMWbD4vHYcw1kYQ5J3DBNPpB50+EUBkkzvdWNn0kVtmup2fOVN1sSlEw5yQq5kzlsgHmTPHAEP9mkjAntzLTBVmZScKcGTwkzMyCyTTMmQmhsuiZM1UXVEOUObN9zRzzmDMbg+UIMWcqxJzZUOflAJ4ViBxM+RSS4j2ZhyTGXLkkzDmFC6bRDzo/F0JNJXG+t7LpI7HKlkfPnGN0sylOwZz5VMw5hssGmDPOA0P8O42EObmV01yQldNImJMXzTwzs2A6DXNOg1Az6JlTf83GKcqcM33NG8xjzpkY7AYh5hwDMedMqPNuADwrEDmY8htJivd0HpIYc91Ewpw3csE0+kHn3wShZpE431vZ9JFYZbuZnjlH62ZTloI5b6FiTj5bvwVgziwPDPHvbBLm5FbOdkFWziZhzlk8JMzMggIa5pwNoebQM6f+M5nJosx5q695m3nMeSsGu02IOUdDzHkr1Hm3AZ4ViBxM+e0kxbuAhyTGXHeQMOftXDCNftD5d0CoO0mc761s+kisst1Fz5yjdLMpScGcd1Mx5yguG2DOJA8M8e89JMzJrbzHBVl5Dwlz3slDwswsuJeGOe+BUPfRM6f+qxSJosx5v6/5gHnMeT8Ge0CIOUdBzHk/1HkPAJ4ViBxM+VyS4n0vD0mMuQpJmHMuF0yjH3R+IYRykTjfW9n0kVhlK6JnTv331KIUzDmPijlHctmQwbHzSTiR659fSMJ2Lt6NZkbugzRsNx9CPSTQ+cAtccGF9KE+wlCoP0wV6iO4bCzUHyEJda7/kQsj1BfQhPojEOpRklBfwAWfg1Afrm+LItQfowr14Vw21iePQQnxOElCcCsfx4Ysj18QabOQJm0eh1BPkAysFnLBWBctohjVekJkEdF4dRGEepLErd7I00dikfcUyZTiSS4YI8xFQH3wq6zl5hmtrEOAW8Qn41EphmburoKl7XNzU2cWR6Ww2KdZ7GIWu4TFLmWxy1jscha7gsWuZLGrWOxqFruGxa5lsetY7DMsdj2L3cBiN7LYTSx2M4vdwmK3sthtLHY7i93BYp9lsc+x2J0sdheLfZ7FvsBid7PYPeatBjztgGCLMdgSDLYUgy3DYMsx2AoMthKDrcJgqzHYGgy2FoOtw2DPYLD1GGwDBtuIwTZhsM0YbAsG24rBtmGw7RhsBwZ7FoM9h8F2YrBdGOx5DPYCBtuNwfYErE8WR9XEKALiyqehdczFuigP7y3RQ51hx6XaqKJTZ1DLNFE/zTuLWq6FOv5zCWqFBqrDCS9qpTqqsGMpapUqKtvlQ61WQ23PUaDWqKBm7FCi1oZGdZ3ph1oXEvVZN3/UM6FQzT4PQK0PgarXPBC1IRg1on4QamMQasjIYNSmQNTsoSFQmwNQswtCobb4o7YUhERt9UN12hoatU2J6ttZBbVdgdrWTw21w4eqv10V9WwpatEl6qjnvKgmT2qgdpagjjfVQu06i5pyQhP1/BlU71xt1AseVFofHdRujmo8Tg+1h3x9wqNCp/YdVKxPvEi0PhG7h8sGntce9MAQeS9RrE94rHzJBVn5ktGeM/wwEgiOA6IPI1/2NV8xb/rxMgZ7ReRhZOweiMRfhgYErwCeNR48L3H12MrJy/Rpv1vXWwsVab+XKu35/HYvkPYLPTBE3qskac+tfNUFWfkqfdrv1gU9Lpr2r/mar5uX9q9hsNeF0n43lPavQWn3OuBZgWVFTPkbJA85eM15FVtWfAmy8k2SZcU3uGCXafrDrIwv6AbUJkVldFNVRr745wYq4yYPDJHHSCojt5K5ICsZyQMbHt9vmhnf+2ieLDAItZ/8BTZPcOuANoqSxwFf86B55HEAgx0UIo8XIPI4AHXeQcCzApGDKT9EUoL28ZDEyvJbJLRwiAum0Q86/y0I9TaJ872VDaiBEOodo8XFOHM+r5tNcxXM+S4Vc/InZ+8CzDnXA0PkHSZhTm7lYRdk5WES5nybh4SZWXCE5lWHwxDqKD1zPq8LekCUOd/zNY+Zx5zvYbBjQsz5PMSc70GddwzwrEDkYMqLSUrQER6SGHO9T8KcxVwwjX7Q+e9DqA9InO+tbPpIrLJ9SD/n3KWbTcotro5TMecuLhvb4uo4dFsnSJiTW3kC2+LqBAlzfsBDwsws+IiGOU9AqJP0zLlLFyS8xdXHvuYn5jHnxxjsEyHm3AUx58dQ530CeFYgcjDln5KUoI94SGLM9RkJc37KBdPoB53/GYT6nMT53sqmj8Qq2xf0zLlTN5sOKJjzSyrm3MllA8x5wAND5H1Fwpzcyq9ckJVfkTDn5zwkzMyCr2mY8ysI9Q09c+7UBe0XZc5vfc3vzGPObzHYd0LMuRNizm+hzvsO8KxA5GDKT5GUoK95SGLM9T0Jc57igmn0g87/HkL9QOJ8b2XTR2KV7Ud65nxON5tSFcz5ExVzPsdlA8yZ6oEh8n4mYU5u5c8uyMqfSZjzBx4SZmbBLzTM+TOE+pWeOZ/TBY0RZc7ffM3fzWPO3zDY70LM+RzEnL9Bnfc74FmByMGU/0FSgn7hIYkx158kzPkHF0yjH3T+nxDqLxLneyubPhKrbH/TM+ezutl0RMGc/1Ax57NcNsCcRzwwRN5pEubkVp52QVaeJmHOv3hImJgFziga5jwNKZfomfNZXdBhQeZ0yr6mxTTmdMoYzCLEnM8izOmUoc6zAJ41HjmgcitFCXJ6QhJiLqeNgjmdVi6YRj/ofBuEspPUf29l00dilS2anjl36GZTdx9zOh1UzLmDywaYs7sHhoRhDAlzcitjXJCVMRTM6bTzkDAzC2JJmNMZA6Gc9My5QxfUTZQ543zNMuYxZxwGKyPEnDsg5oyDOq8M4FmByMGUx5MwZywPSYy5EkiYM54LptEPOj8BQiWSON9b2fSRWGVLomfO7brZtEHBnMlUzLmdywaYc4MHhvi3LAlzcivLuiAry5IwZyIPCTOzoBwNc5aFUOXpmXO7Lmi9KHNW8DUrmsecFTBYRSHm3A4xZwWo8yoCnhWIHEx5JZLiXY6HJMZclUmYsxIXTKMfdH5lCFWFxPneyqaPxCpbVXrm3KabTTsVzFmNijm3cdkAc+70wBD/VidhTm5ldRdkZXUS5qzCQ8LMLLiIhjmrQ6ga9My5TRf0nChzpviaNc1jzhQMVlOIObdBzJkCdV5NwLMCkYMpr0VSvC/iIYkxV20S5qzFBdPoB51fG0LVIXG+t7LpI7HKdjE9c27VzaaeCuasS8WcW7lsgDl7emCIf+uRMCe3sp4LsrIeCXPW4SFhZhbUp2HOehDqEnrm3KoL6iHKnA18zYbmMWcDDNZQiDm3QszZAOq8hoBnBSIHU34pSfGuz0MSY65GJMx5KRdMox90fiMIdRmJ872VTR+JVbbG9My5RTebZiuYswkVc27hsgHmnO2BIf5tSsKc3MqmLsjKpiTMeRkPCTOzoBkNczaFUM3pmXOLLugWUea83NdsYR5zXo7BWggx5xaIOS+HOq8F4FmByMGUtyQp3s14SGLMdQUJc7bkgmn0g86/AkJdSeJ8b2XTR2KV7Sp65txsiDlbUTHnZi4bY85WkH+vJmFObuXVGHNeTcKcV/KQMDMLWtMw59UQ6hp65txMx5xtfM225jFnGwzWVog5N0PM2QbqvLY0zIkpb0dSvFvzkMSYqz0Jc7bjgmn0g85vD6E6kDjfW9n0kVhl60jPnJt0s2mlgjk7UTHnJi4bYM6VHhji384kzMmt7OyCrOxMwpwdeEiYmQVdaJizM4TqSs+cm3RBK0SZs5uv2d085uyGwboLMecmiDm7QZ3XHfCsQORgynuQFO8uPCQx5upJwpw9uGAa/aDze0KoXiTO91Y2fSRW2XrTM+dG3WxaomDOPlTMuZHLBphziQeG+LcvCXNyK/u6ICv7kjBnLx4SZmZBPxrm7AuhrqVnzo26oMWizNnf1xxgHnP2x2ADhJhzI8Sc/aHOGwB4ViByMOUDSYp3Px6SGHMNImHOgVwwjX7Q+YMg1GAS53srmz4Sq2xD6Jlzg242HVUw51Aq5tzAZQPMedQDQ/w7jIQ5uZXDXJCVw0iYczAPCTOz4Doa5hwGoYbTM+cGXdARUeYc4WuONI85R2CwkULMuQFizhFQ540EPCsQOZjyUSTF+zoekhhzjSZhzlFcMI1+0PmjIdQYEud7K5s+EqtsqfTMuV43m/YpmHMsFXOu57IB5tzngSH+TSNhTm5lmguyMo2EOcfwkDAzC8bRMGcahEqnZ871uiAmypzjfc0J5jHneAw2QYg510PMOR7qvAmAZwUiB1M+kaR4j+MhiTFXBglzTuSCafSDzs+AUNeTON9b2fSRWGWbRM+cz+hmU2UFc2ZSMeczXDbAnJU9MMS/k0mYk1s52QVZOZmEOa/nIWFmFmTRMOdkCJVNz5zP6IIqiTJnjq85xTzmzMFgU4SY8xmIOXOgzpsCeFYgcjDluSTFO4uHJMZcU0mYM5cLptEPOn8qhMojcb63sukjscqWT8+c63SzaYeCOadRMec6Lhtgzh0eGOLf6STMya2c7oKsnE7CnHk8JMzMghk0zDkdQs2kZ851uqDtosx5g695o3nMeQMGu1GIOddBzHkD1Hk3Ap4ViBxM+U0kxXsGD0mMuWaRMOdNXDCNftD5syDUzSTO91Y2fSRW2W6hZ861utl0l4I5Z1Mx51ouG2DOuzwwxL8FJMzJrSxwQVYWkDDnzTwkzMyCOTTMWQChbqVnzrW6oDtFmfM2X/N285jzNgx2uxBzroWY8zao824HPCsQOZjyO0iK9xwekhhz3UnCnHdwwTT6QeffCaHuInG+t7LpI7HKdjc9c67RzaZuCua8h4o513DZAHN288AQ/95LwpzcyntdkJX3kjAnp+S7zcyC+2iY814IdT89c67RBXUVZc4HfM255jHnAxhsrhBzroGY8wGo8+YCnhWIHEw5SQly3sdDEmMuFwlzFnLBNPpB52PKi0ic761s+kisss2jZ87VutnkUjDnfCrmXM1lA8zp8sAQ/z5IwpzcygddkJUPkjBnEQ8JM7PgIRrmfBBCPUzPnKt1QYWizPmIr7nAPOZ8BIMtEGLO1RBzPgJ13gLAswKRgyl/lKR4P8RDEkubx0iY81EumEY/6PzHINTjJM73VjZ9JOaihfTMuUo3m3IUzPkEFXOu4rIB5szxwBD/LiJhTm7lIhdk5SIS5nych4SZWfAkDXMuglBP0TPnKl1QtihzPu1rLjaPOZ/GYIuFmHMVxJxPQ523GPCsQORgypeQFO8neUhiZXkpCXMu4YJp9IPOXwqhlpE431vZ9JFYZVtOz5wrdbPpeQVzrqBizpVcNsCcz3tgiH9XkjAnt3KlC7JyJQlzLuMhYWYWrKJhzpUQajU9c+r3wi5R5lzja641jznXYLC1Qsy5EmLONVDnrQU8KxA5mPJ1JMWbD4tXY8z1DAlzruOCafSDzn8GQq0ncb63sukjscq2gZ45V+hmU4qCOTdSMecKLhtgzhQPDPHvJhLm5FZuckFWbiJhzvU8JMzMgs00zLkJQm2hZ84VuqAaosy51dfcZh5zbsVg24SYcwXEnFuhztsGeFYgcjDl20mK92Yekhhz7SBhzu1cMI1+0Pk7INSzJM73VjZ9JFbZnqNnzuW62RSnYM6dVMy5nMsGmDPOA0P8u4uEObmVu1yQlbtImPNZHhJmZsHzNMy5C0K9QM+c+ms2TlHm3O1r7jGPOXdjsD1CzLkcYs7dUOftATwrEDmY8hdJijdfKXoBY66XSJjzRS6YRj/o/Jcg1MskzvdWNn0kVtleoWfOZbrZlKVgzr1UzMln63sB5szywBD/vkrCnNzKV12Qla+SMOfLPCTMzILXaJjzVQj1Oj1z6j+TmSzKnG/4mm+ax5xvYLA3hZhzGcScb0Cd9ybgWYHIwZS7SYr3azwkMeZiJMzp5oJp9IPOZxBqH4nzvZVNH4lVtv30zLlUN5uSFMx5gIo5l3LZAHMmeWCIfw+SMCe38qALsvIgCXPu4yFhZhYcomHOgxDqLXrm1H+VIlGUOd/2Nd8xjznfxmDvCDHnUog534Y67x3AswKRgyl/l6R4H+IhiTHXYRLmfJcLptEPOv8whDpC4nxvZdNHYpXtKD1z6r+nFqVgzveomHMJlw0Z7DxGwolc/7FCErY7wrvRzMgtpmG7YxDqfYHOB26JCy6kD/XFhkL9A6pQX8xlY6H+IUmoc/0fXhihfpwm1D+EUCdIQv04F3wOQv1pfVsUof4RVag/zWVjffIRlBAnSRKCW3kSG7KcvCDS5mOatDkJoT4hGVh9zAVjXfQpxajWEyKfGq2ZoFs/hVCfkbjVG3n6SCzyPieZUnzGBWOE+SlQH4Jnpmvbdx7QtNmVnbPScmfm5M0vjmrim6TaeiraPRTt7op2N0W7q6LdRdHurGh3UrQ7KtodFO32inY7Rbutot1G0b5G0W6taF+taLdStK9StK9UtK9QtFsq2i0U7csV7eaKdjNFu6mirfRnY0X7MkW7kaJ9acGKjtlZU/NSs/S3ek2MYCPY8w1bzOGl4eyIVbSdinacol1G0Y5XtBMUbaXMJEU7WdEuq2iXU7TLK9oVFO2KinYlRbuy3y3YX1K0X1a0X1G09yraryrarynaryvabyjabyrabkWbKdr7FO39ivYBRfugon2IF3Lm/II5v2TOr5jza+b8hjm/Zc7vmPMUc37PnD8w54/M+RNz/sycvzDnr8z5G3P+zpx/MOefzPkXc/7NnP8w52kWF8XiJBYnszgLi7OyOBuLs7O4aBbnYHExLC6WxTlZXByLK8Pi4llcAotLZHFJLC6ZxZVlceVYXHkWV4HFVWRxlRD2MRJpUQawTQxg4yPYCFYU61c6Yp9WtBcr2ksU7aWK9jJFe7mivULRXqlor1K0VyvaaxTttYr2OkX7GUV7vaK9we8WYoYr2iMU7ZGK9ihFe7SiPUbRTlW0xyraaYr2OEU7XdEer2hPULQnKtoZivb1/BZYXGUWV4XFVWVx1VhcdRZ3EYurweJSWFxNFleLxdVmcXVY3MUsri6Lq8fi6vtPX6D5Vtwl2vHgHN6rV4iit7lf9tT0jHHZWc36pedOzs9LzcvIziqa77M/7hJFJd+iGBtGK9qO+SyuAYtryOIuZXGNRKy/TNf63kLWXwZa35jFNWFxTVlcMxHrm+ta30fI+uag9ZezuBYsriWLu8J/vSq60Le4FHcltrikLuCqcAW0ClfA1eEKaB2ugGvCFdAmXAFtwxXQLlwB7cMV0MH4MmchtDpiS4bStaM5j9fjOqaIZLUlW5G91RXt2gpMDs/qTiyuM4vrwuK6+vsyuahgafvc3NSZReAqtK26/vgVFVUbGAobWyOP66QvslAg5CSji/VAXCgW6+O6mfaeRlw3gTVDSz6zTMfoqTv5cw5EhcJ1PYiec8R157Ixg3tSPMHw6O9p+KmS4kUk6DmFZTrvfDMiWjpjC/jG0hmw742luF6+Zm/zMqEXBuudYvzxzpmEmYe5TTutik6dQfWCkq830AXGA62nRz2kH7OyD0k6duOCsRLVl+KB3hn90MAhrhtkZT+KxyoGCvm1YZYWfVtuKCkt4Q6iwiot/X3NAeaVlv4YbECKWBfeMA9zG1Ra+kOyBpCUFp40/bF7wZIGu5eBJM/K4wZCqEEU1e9MUGC5NNhgXSmCOrIjL6sQsB+vLJihQ0QevesaYJmOhRvFc/8owMD6FIolQPElFIplQHEDCsUWQHFDigC7FAkvyxQK1Y2gyO5E4W4rYN5lFIptgOLGFIrtgOImFIqjAcVNKRQ7AMXNKBTHAIqbUyiOBRRfTqEYOT+jBYXiOEBxSwrFZQDFV1AojgcUX0mhOAFQfBWF4kRAcSsKxUmA4qspFCcDiltTKC4LKL6GQnE5QHEbCsXlAcVtKRRXABS3o1BcEVDcnkJxJUBxBwrFlQHFHSkUVwEUkwxvqwKKO1MorgYo7kKhuDqguCuF4osAxSST8xqA4u4UilMAxT0oFNcEFPekUFwLUNyLQnFtQHFvo4qRp2N9KIT2FXGRntB+0PrFNIreqQOYdy3FPfc34SFEsOoi6LERXzgdCAEH8aVbJCoGkKzv8oX6a9HHYEMQn2OL5Ua7G3pUZ63MrPMRVw6i0M6X6q2VEe2Dqe79G0T7EIqKNZRC6DAKoddRCB1OIXQEhdCRFEJHUQgdTSF0DIXQVAqhYymEplEIHUchNJ1C6HgKoRMohE6kEJpBIfR6CqGTKIRmUgidTCE0i0JoNoXQHAqhUyiE5lIInUohNI9CaD6F0GkUQqdTCJ1BIXQmhdAbKITeSCH0JgqhsyiE3kwh9BYKoe7ZJFILSKTOIZF6K4nU2yiWl9y3F0Ezc5I7uoNE6p0kUu8ikXo3idR7SKTeSyL1PhKp95NIfYBE6lwSqYUkUl0kUotIpM4jkTqfROqDJFIfIpH6MInUR0ikLiCR+iiJ1MdIpD5OInUhidQnSKQuIpH6JInUp0ikPk0idTGJ1CUkUpeSSF1GInU5idQVJFJXkkhdRSJ1NYnUNSRS15JIXUci9RkSqetJpG4gkbqRROomEqmbSaRuIZG6lWTFYxv0FtEnJLq3Q6stZUm8uUNb9QlX587G3xHyvLPxHQRsz6zfQnY+a/DuYTu/R+08Bdn5nEE79d6B8XTAGTv3Y9+gnibRz2+/J6S/TJTRKEX2nHBDZx/HnUZQxi2E+n0XidTnSaS+QCJ1N4nUPSRSXySR+hKJ1JdJpL5CInUvidRXSaS+RiL1dRKpb5BIfZNEqptEKiORuo9E6n4SqQdIpB4kkXqIROpbJFLfJpH6DonUd0mkHiaReoRE6lESqe+RSD1GIrWYROr7JFI/IJH6IYnU4yRST5BI/YhE6kkSqR+TSP2ERKrRY5ngVYYD6CpDL2g+/BkHJQ9Y+bu9TK1uXR66tF7HhX0eeezp+S2rXWqpUf699U2v/WXWkLPzYV0U0Xz4cxKpX5BI/ZJE6lckUr8mkfoNidRvSaR+RyL1FInU70mk/kAi9UcSqT+RSP2ZROovJFJ/JZH6G4nU30mk/kEi9U8SqX+RSP2bROo/JFJPU0hlUhSNWIlGrEwj1kIj1koj1kYj1k4jNppGrINGbAyN2FgasU4asXE0YsvQiI2nEZtAIzaRRmwSjdhkGrFlacSWoxFbnkZsBRqxFWnEVqIRW5lGbBUasVVpxFajEVudRuxFNGJr0IhNoRFbk0ZsLRqxtWnE1qERezGN2Lo0YuvRiK1PI/YSGrENaMQ2pBF7KY3YRjRiL6MR25hGbBMasU1pxDajEducRuzlNGJb0IhtSSP2ChqxV9KIvYpGbCsasVfTiG1NI/YaGrFtaMS2pRHbjkZsexqxHWjEdqQR24lGbGcasV1oxHalEduNRmx3GrE9aMT2pBHbi0ZsbxqxfWjE9qUR249G7LU0YvvTiB1AI3YgjdhBNGIH04gdQiN2KI3YYTRir6MRO5xG7AgasSNpxI6iETuaRuwYGrGpNGLH0ohNoxE7jkZsOo3Y8TRiJ9CInUgjNoNG7PU0YifRiM2kETuZRmwWjdhsGrE5NGKn0IjNpRE7lUZsHo3YfBqx02jETqcRO4NG7EwasTfQiL2RRuxNNGJn0Yi9mUbsLTRiZ9OILaARO4dG7K00Ym+jEXs7jdg7aMTeSSP2Lhqxd9OIvYdG7L00Yu+jEXs/jdgHaMTOpRFbSCPWRSO2iEbsPBqx82nEPkgj9iEasQ/TiH2ERuwCGrGP0oh9jEbs4zRiF9KIfYJG7CIasU/SiH2KRuzTNGIX04hdQiN2KY3YZTRil9OIXUEjdiWN2FU0YlfTiF1DI3Ytjdh1NGKfoRG7nkbsBhqxG2nEbqIRu5lG7BYasVtpxG6jEbudRuwOGrHP0oh9jkbsThqxu2jEPk8j9gUasbtpxO6hEfsijdiXaMS+TCP2FRqxe2nEvkoj9jUasa/TiH2DRuybNGLdNGKN7rUL74L3KboLXipm6D4qQ4+ghvbHDN1P01EHaMQepBF7iEbsWzRi36YR+w6N2HdpxB6mEXuERuxRGrHv0Yg9RiO2mEbs+zRiP6AR+yGN2OM0Yk/QiP2IRuxJGrEf04j9hEbspzRiP6MR+zmN2C9oxH5JI/YrGrFf04j9hkbst/rjWrER89voiLkPZqjRXX5dqKE/YPqN7gcMOcqSz12AGurCDP2eJlB+oBH7I43Yn2jE/kwj9hcasb/SiP2NRuzvNGL/oBH7J43Yv2jE/k0j9h8asTQbDss0Gw7LNBsOyzQbDss0Gw7LNBsOyzQbDss0Gw7LNBsOyzQbDss0Gw7LNBsOyzQbDss0Gw7LNBsOyzQbDss0Gw7LNBsOyzQbDsvJNGJpNhyWaTYclmk2HJZpNhyWaTYclmk2HJZpNhyWaTYclmk2HJZpNhyWaTYclmk2HJZrGFxzAcXSbDgs02w4LNNsOCzTbDgs02w4LNNsOCzTbDgs02w4LNNsOCzTbDgs02w4LNNsOCzTbDgs02w4LNNsOCzTbDgs02w4LNNsOCw3oxFLs+GwTLPhsEyz4bBMs+GwTLPhsGx4w+EiSOxVRcBzDFs8jfJWiHLrjzTKr4aU/0SjvDWk/Gca5ddAyn+hUd4GUv4rjfK2kPLfaJS3g5T/TqO8PaT8DxrlHSDlf9Io7wgp/4tGeSdI+d80yjtDyv+hUd4FUn6aRnlXiNWiaJR3g5QTPYDqrq37u9Onvw++J11rpf2QcsPbXs+DxPZETIyDbiRuHk2f94L6vD6N8t6Icrvhbd+Ko2pC6vuEUt/MT73EnF+ENPKzANSXoW+lqz/qK5UbnuGH+lrNLduVqG9UnZetQH2r7uJCH+o7jY7oUIo6pdVdx72o7zU79acS1A/aXV90FvWjToB8dwb1kx7qtAf1sy7qNEf9goSk81cPKk0TJbG4ymdk9dZBVTmrcYo2qmqJXcc1UdW81jfRQlUvvcdFGqiLfJ6or46qofDXNlVUitKrfdVQNf1830kFVcu/h7aERtUO6MfZIVF1Ant7dijUxUExMSQEqm5w5IwIRtULEV/1glD1IUpoQFUY+yLh7fwNCW/n70h4O/9Awtv5JxLezr+Q8Hb+jYS38x8kvJ2nofCOgsJbgsJbhsLbAoW3FQpvGxTedii8oxHijXMgxBsXgxBvXCxCvHFOhHjj4hDijSuDEG9cPEK8cQkI8cYlIsQbl4QQb1wyQrxxZRHijSuHEG9ceajkVYBQhlfg50NlsR/E+hUh1q8E3cjlNOPuayHlRAu3/SHlV9EoHwApb0WjfCCk/Goa5YMg5a1plA+GlF9Do3wIpLwNjfKhkPK2NMqHQcrb0Si/DlLenkb5cEg5zSl98gijS1mY2JE0rhoFrQAl07iK5jAdmeYwHZnmMB2Z5jAdmeYwHZnmMB2Z5jAdmeYwHZnmMB2Z5jAdmeYwHZnmMB2Z5jAdmeYwHZnmMB2Z5jAdmeYwHZnmMB2Z5jAdOZdGLM1hOjLNYToyzWE6Ms1hOjLNYToyzWE6Ms1hOjLNYToyzWE6Ms1hOjLNYToyzWE6Ms1hOjLNYToyzWE6Ms1hOjLNYToyzWE6Ms1hOjLNYToyzWE6Ms1hOjLNYToyzWE6Ms1hOjLNYToyzWE6Ms1hOjLNYToyzWE6Ms1hOnIRjViaw3RkmsN0ZJrDdGSaw3RkmsN0ZJrDdGSaw3RkmsN0ZJrDdGSaw3RkmsN0ZJrDdGSaw3RkmsN0ZJrDdGSaw3RkmsN0ZJrDdGSaw3RkmsN0ZJrDdGSaw3RkmsN0ZJrDdGSaw3RkmsN0ZJrDdGSaw3RkmsN0ZJrDdGSaw3TkjTRiaQ7TkWkO05FpDtORaQ7TkWkO05FpDtORaQ7TkWkO05FpDtORaQ7TkWkO05FpDtORaQ7TkWkO05FpDtORaQ7TkWkO05FpDtORaQ7TkWkO05FpDtORaQ7TkWkO05FpDtORaQ7TkWkO05EZjdh9NGJpDqqRaQ6qkWkOqpEP0YilOahGpjmoRqY5qEamOahGpjmoRqY5qEamOahGpjmoRqY5qEamOahGpjmoRqY5qEamOahGpjmoRqY5qEamOahGpjmoRqY5qEamOahGpjmoRqY5qEamOahGpjmoRqY5qEamOahGpjmoRqY5qEb+lkbsdzRiT9GIpTnbRf6BRizN2S4yzdkuMs3ZLjLN2S4yzdkuMs3ZLjLN2S4yzdkuMs3ZLjLN2S4yzdkuMs3ZLjLN2S4WmrNdLDRba1loznax0JztYqE528VCc7aLheZsFwvN2S4WmrNdLDRnu1hoznax0JztYqE528VCc7aLheZsFwvN2S4WmrNdLDRnu1iSacTSnO1ioTnbxUJztouF5mwXC83ZLhaas10sNGe7WGjOdrHQnO1ioTnbxUJztouF5mwXSw0asTRnu1hoznax0JztYqE528VCc7aLheZsFwvN2S4WmrNdLDRnu1hoznax0JztYqE528VCc7aLheZsFwvN2S4WmrNdLDRnu1hoznaxNKMRS3O2i4XmbBcLzdkuFpqzXSw0Z7tYrqQRexWN2FY0Yq+mEduaRuw1NGLb0IhtSyO2HY3Y9jRiabaps3SkEduJRmxnGrFdaMR2pRHbjUZsdxqxPWjE9qQR24tGbG8asX1oxPalEduPRuy1NGL704gdQCN2II3YQTRiB9OIHUIjdiiN2GE0Yq+jETucRuwIGrEjacSOohFLs/+thWb/WwvN/rcWmv1vLTT731po9r+10Ox/a6HZ/9ZCs/+thWb/W0uG7obcp0XE0ux/a6HZ/9ZCs/+txfD+t8hxdxdDqqE9cnunT87Ondk9KyNvXpdiS9f6lzRoeGmjyxo3adqs+eUtWl5x5VWtrm59TZu27dp36Nipc5eu3br36Nmrd5++/a7tP2DgoMFDhg67bviIkaNGj0kdmzYuffyEiRnXT8qcnJWdMyV3al7+tOkzZt5w402zbr7FPdtd4J7jvtV9m/t29x3uO913ue923+O+132f+373A+657kK3y13knuee737Q/ZD7Yfcj7gXuR92PuR93L3Q/4V7kftL9lPtp92L3EvdS9zL3cvcK90r3Kvdq9xr3Wvc69zPu9e4N7o3uTe7N7i3ure5t7u3uHe5n3c+5d7p3uZ93v+De7d7jftH9kvtl9yvuve5X3a+5X3e/4X7T7XYz9z73fvcB90H3Ifdb7rfd77jfdR92H3Efdb/nPuYudr/v/sD9ofu4+4T7I/dJ98fuT9yfuj9zf+7+wv2l+yv31+5v3N+6v3Ofcn/v/sH9o/sn98/uX9y/un9z/+7+w/2n+y/33+5/3KeZFMUkiUkykyxMsjLJxiQ7k6KZ5GBSDJNimeRkUhyTyjApnkkJTEpkUhKTkplUlknlmFSeSRWYVJFJlZhUmUlVmFSVSdWYVJ1JFzGpBpNSmFSTSbWYVJtJdZh0MZPqMqkek+oz6RImNWBSQyZdyqRGTLqMSY2Z1IRJTZnUjEnNmXQ5k1owqSWTrmDSlUy6ikmtmHQ1k1oz6RomtWFSWya1Y1J7JnVgUkcmdWJSZyZ1YVJXJnVjUncm9WBSTyb1YlJvJvVhUl8m9WPStUzqz6QBTBrIpEFMGsykIUwayqRhTLqOScOZNIJJI5k0ikmjmTSGSalMGsukNCaNY1I6k8YzaQKTJjIpg0nXM2kSkzKZNJlJWUzKZlIOk6YwKZdJU5mUx6R8Jk1j0nQmzWDSTCbdwKQbmXQTk2Yx6WYm3cKk2UwqYNIcJt3KpNuYdDuT7mDSnUy6i0l3M+keJt3LpPuYdD+THmDSXCYVMsnFpCImzWPSfCY9yKSHmPQwkx5h0gImPcqkx5j0OJMWMukJJi1i0pNMeopJTzNpMZOWMGkpk5YxaTmTVjBpJZNWMWk1k9YwaS2T1jHpGSatZ9IGJm1k0iYmbWbSFiZtZdI2Jm1n0g4mPcuk55i0k0m7mPQ8k15g0m4m7WHSi0x6iUkvM+kVJu1l0qtMeo1JrzPpDSa9ySQ3kxiT9jFpP5MOMOkgkw4x6S0mvc2kd5j0LpMOM+kIk44y6T0mHWNSMZPeZ9IHTPqQSceZdIJJHzHpJJM+ZtInTPqUSZ8x6XMmfcGkL5n0FZO+ZtI3TPqWSd8x6RSTvmfSD0z6kUk/MelnJv3CpF+Z9BuTfmfSH0z6k0l/MelvJv3DpNNMjmKyxGSZyRYmW5lsY7KdydFMdjA5hsmxTHYyOY7JZZgcz+QEJicyOYnJyUwuy+RyTC7P5ApMrsjkSkyuzOQqTK7K5GpMrs7ki5hcg8kpTK7J5FpMrs3kOky+mMl1mVyPyfWZfAmTGzC5IZMvZXIjJl/G5MZMbsLkpkxuxuTmTL6cyS2Y3JLJVzD5SiZfxeRWTL6aya2ZfA2T2zC5LZPbMbk9kzswuSOTOzG5M5O7MLkrk7sxuTuTezC5J5N7Mbk3k/swuS+T+zH5Wib3Z/IAJg9k8iAmD2byECYPZfIwJl/H5OFMHsHkkUwexeTRTB7D5FQmj2VyGpPHMTmdyeOZPIHJE5mcweTrmTyJyZlMnszkLCZnMzmHyVOYnMvkqUzOY3I+k6cxeTqTZzB5JpNvYPKNTL6JybOYfDOTb2HybCYXMHkOk29l8m1Mvp3JdzD5TibfxeS7mXwPk+9l8n1Mvp/JDzB5LpMLmexichGT5zF5PpMfZPJDTH6YyY8weQGTH2XyY0x+nMkLmfwEkxcx+UkmP8Xkp5m8mMlLmLyUycuYvJzJK5i8ksmrmLyayWuYvJbJ65j8DJPXM3kDkzcyeROTNzN5C5O3Mnkbk7czeQeTn2Xyc0zeyeRdTH6eyS8weTeT9zD5RSa/xOSXmfwKk/cy+VUmv8bk15n8BpPfZLKbyYzJ+5i8n8kHmHyQyYeY/BaT32byO0x+l8mHmXyEyUeZ/B6TjzG5mMnvM/kDJn/I5ONMPsHkj5h8kskfM/kTJn/K5M+Y/DmTv2Dyl0z+islfM/kbJn/L5O+YfIrJ3zP5Byb/yOSfmPwzk39h8q9M/o3JvzP5Dyb/yeS/mPw3k/9h8mlmiWIWz7vGzGJhFiuz2JjFzizRzOJglhhmiWUWJ7PEMUsZZolnlgRmSWSWJGZJZpayzFKOWcozSwVmqcgslZilMrNUYZaqzFKNWaozy0XMUoNZUpilJrPUYpbazFKHWS5mlrrMUo8/8+fP5/mzdP7cmz+j5s+T+bNf/pyWP1Plzz/5s0r+XJE/A+TP6/izNf4cjD+z4s+X+LMg/tyGP2Phz0P4swv+nIE/E+Dr93ytna+L8zVsvt7M14b5Oi5fc+Xro3wtk6878jVCvp7H1974Ohlf0+LrT3ytiK/r8DUYvl7C1zb4OgRfM+Dzez4X5/NmPsfl81E+d+TzPD4n4/MnPtfh8xI+h+DjfT425+NoPubl41M+luTjPj5G4+MpPq5Z1T89Lz83q1NqXmpxVP0oSbZYbfZoR0ysM65MfEJiUnLZcuUrVKxUuUrVatUvqpFSs1btOhfXrVdYWByVXlSwpH1aRm65ov0Hor/66c29EwoLS36qEPzTxUX7N3yZeVPNqLq7i6OaF6zqPCMnN33q1IzsrHmF+lueDjR6wUSjF6QbvSDF6AVpRi/INHpBqtELMoxeMJncreOMXjDa6AVTjV4wxegFuUYvyCMPvhvJE8hwLGWRe2kWuVszyIMvhdyt2edftOYVXPjl/v+yzBiOpfHkJs04/2rrDPJCJvtfgC2vQcedGBcLHMlRMkasGxkjRsaIkTFi6H+RMWJkjGiWSZExYmSMqPIvMkaMjBHV/p0PY8R6Rfvv/Oj0kfturPytd2mxQdH+notGV667uePB4qh2/4/Dxv8CEUeGK+fHcGUceT03nA+RARFJxxnuh8nkXsoiDw3D/WB4BJVKbhI9odAPrlPPvwQ6D8dokcnm+REaqeQa6KeC+eQ3nUteyC7MOUuLov1rnYc67FrkGOWds1wR/FO74J86BP/UNfin7sE/9Q7+qW/wT0OCfxoW/NOo4J/GBP+UXrR//ZC31g1r/eSm4qi651/kpJFX0hxyDenkpfc8rKTjyC+gD76p5BdEBgoX6OJmFrlJ/4WFcsPVO5+8CEwj95J3+JBVtP/eNqxBt+jFR7xsOz2YgGcG/+QuCPHbrSF+uyvEb/eE+O2BEL8VhvjtkRC/PRrit0UhfnsqxG9PF+3/+NbvBmTn9R9a+tuGELhNIX57tmj/s8/VPDyneaVxpb/tC4E7EOK3t4r23+TOXf5P0upPS397p2i//PB9k+K/TraX/vZpiGs/D/HbNyF++y7Ebz+G0PtHsF4mRQW/aMukuFA/Jhbtd3w3bVCl1wcM9P1Ytmj/rT1/r1qnd9/5vh/LFe1fcHzLTbUW9v7Q92P5UD9WKNrfWB7/1MJtvYf5fqxTtP/3Efuu/W5h/Sjfjw2L9hfZE+48JKe94vuxUSg7Ly/aX3O3c+zg4gXDfT92DPYRkzqH+rF3qB/7hvqxf7CPmTQslJPHhLIzM9SPOaGcfEco5Lai/cdeatj/3c72GqU/WsYGJzqzTAphvGVyqB/zQ/04PdSPN4X68eZQP84J9eNtoX68L9SPD4T6cV6oHx8M9eNDwXnPLA9H3hIyekHkLSHkgshbQpHHbir/Igu3F+h8LPKW0AVaZiJvCZ0fT6AuzBV3Znky1Hjy6VA/rgr145pQP24I9eOmUD9uC/XjjlA/7gn140uhfnwt1I9vhPrx5xCTC9uOED9GF4T4MaZziB9j/woxi3HyWeE3+QktD7GamcXGR6X9zr+HzFPPv+qfdv55yfDAYML551b6t2XoX+tIO/9MGnf+DQzoV9gNDz3yye+BPjQy/gMdN538punnH4ZvOuf8I5T/S9qlL/eTjF5wGblbu59/0zr6FD0P13bOQ5MM58MM8sr3fzkiu5S8p/PJg4+eH2obvWA4OYtmkl9geAhneIA1mjyn/wujmdHkden/chFhpNELooqjKhQdrZ96ZsvZ0WnZk3NS8zLGZqaPzs5NTeP/Ny091yNq9PTc1Jyc9NziqMSCpR2zs6bmzStY1ikjNz0tTy5Y3j0rL31Ceu7iQc2b6S+CBl4vGbp+dufA66OM6e9csKRjamamy1kqZ0X/9Ex+09PSDd5JVLAEi1EJazy2jEvNS+2YnTOz9JY6K21SCD9reXzYlnc2wfIlA/Kyc1xFKpYG9FHHpV0y0jP19wK/KPDCTuCFjmVnNwEsWN0lOzc9Y0KWx1MP8ri+IS89bfTkjKlpo8+GeMfSCO97JsAHn41vz4rw2rObH7cfN86TP6Wmq/zeqahg2YCMyTmZ6WdN9P+vEnOKjqZkTB2dPiM9LT/Pk0UZWaNz03lKnU2xnImpU9P/CxkVbjRJwRKs5mRSR6VNCuE8k5Th6WsotRYs7p09zS/CS2FnM7FMCcIbEkpouD7pFLZPpOAc9fOBf6rUPZsqObnTRmdM7eyN2O5Z/UvjtZ8nXF2B6eCT7fKmQKmZTw9qqo6Xg/Ghne7T4M2qZaNHT52Sm1dsifmXU6dvmKnTV72knzcp1EslfNSSo1fJPVXyT47eSqjfX/qEIg7Ru+gdLMFmTIIcnDZWpTA1aqvUrN5VOY8cKFdcv9axdrvXXDa/8k91Whdv7/bUqT9e/y1KMVowSG1BF3YGLwwytYvo+Kbk+q5hJlc3heHSrbWmPhxzv9T7xTmNNsfFvvhF+0UdOrI3b7unRsKaRYEXdvde2KB1zKml99x8e9Tx5V898EuDne0aJV3UPumytx97t2pW7vDKpwIv7KEsRcYN7gl6WvKOPoJiz27MZdGBWRXtKywBf4kJzqfSH2J9RLW6Q0ZWqudEh7y+OQ+WClvMq/GZYlsqXWHx2fRt7Z+kCkSQKTalVWvPKjzjuL458xWCFw/IH6u8yOtk9UuiF/fOzwypx65+kW1Z5yn5qZlTQzixU8GyHvmTc7qPVxrfpGCJ50fXxRoi/e2QfeP0cEfi9kBf2lU73KF0hOFulUu6NR3vVqtSt8aNIqkVJNziZ9qZDrgq7NIt5k3ZuDdtYXozyBml9crrCo1RkIYrraqFKNooCQZJcBispWpdEWKkEmPMuNOhO0wK7DDJry51zxp3tiaGV6KlAOU+FaXqg+85hDtjjan9p2BFh8zUtEkdsmcULB+Y3T91XMaMB0PGQHRIjogNDr8S2yxKvN9frMrLzwY8k38Je6j6T9jR+XdwcpUOcYK4qZRmzqZWb7X+c6zoxecnAyemZvl3otUvT4P4w9G/RHA/jZy1efNSlWIcqlRnUw84Tqj+tkb7ze9CXxa7znufZ3lS9W6jQ9xt7BBvIFgsqgpUHBmj7cjY60pF29VEOzVzTM2e4IucSquW9MpOHVcUMlVivQsFIVOqZOFHtU9j/fvUb8SmepHzzDCpNGiRkdWZyhPSfic8pnEoNallSLAjrb65gRbfeVMv3NmdTTW9o4JHzitUx8eO0hmJceq3Gh8f+xVn1Q6x+neIRdlEe9EKhZi6Jo2LZI0CpXqRJXDgLKAJc0REU0RTRFNE04WsKWjhwuIbByzuk+0/5PZdxqdjQcMUu+LvJcOUQIhySqk3krGoLIB011q78RuU2EX85jcYDR47eFfnrI9+Jm9K++rz0Rdfv2jy3pPjNs9p0eyXjrOetvT4q/Psovs6wQtMslK1RkSo3Vm01uqXGn3isWdXNvHFKjJ2j2iKaIpoimg6TzQF0aesSp/KpZlQ9KmYPNpU6NMWzLAC92PVmqX50Ux0mKMVa4h1Oy+BJk4Y/Oj3p6dulMp+9/v2Iwt7jBnef+s1E39fV23mriGN+xQlaxmpdmeak1a1O7PCmuwi0WeFNNlNiHOMqiOaIpoimiKazNcUxIV2VS60m8qFdj0utIswhkWVMXDPhXw/NZDDX05pMLXPc83S2n/31GOW1KNl496+se62bvfvPZT1NevbZvuM5lW0jBSY4qlzodA02XbO1pdxqhZKjoimiKaIpogmHVqzqtKa1VRas+rRmlVsfc/UiZCsQWtxi1a/etvIfoduv6yBZcreTjXKjSqz/bJb6z5U7eLvT55saB1u8sqlzQTCtkAxYTFhjVRoUV8oOSKaIpoimv7DmoIYyqbKUMqpjw5DWVQYyhJMYgL3I8RQQgMCLYaSE/9Ju27zq70n3bg/Z2ftp64aPHtvu1rvL6ixpXdn++rZrywUmdnIIlNKIe4Vmq3hi5BCcS60wBDRFNEU0XRhaBJ7YcSuQzZ2FbKxB/ORwP0IkY0Qt2uRTZWjjbts+O3ocvbkvq33Hp9T/usqNWwtnvjqueWTPxj8dOVON4ss4spaMWEqjdpNnlfbTZjBCyVHRFNEU0TTOdck9nTIqsMbVhXesAZTi8D9CPGGEE1r8Ub1b+6eva7h+1U61Coff/sjf9039Gfb9DeuG3Fy42szbv/rwJbaIrMAzTf1TWVEPPoiT4cimiKa/sOaIk9SRJ+k1E0e+VRs/IG0ev3uedZ+8KRlTer4Zse+uXzRgA6NVg5oPmNI5ElKGAwVWWOOaIpoMqwp8tRB9KlDrTGf1bmt5xv9r50zb8BDD3Qv36T/0Pa3DunaakT1Ybekts3cFXnqYFRTZOU3oimiqeRPkRV60RX6yu/vfKbV/V32jJCm/bllx6jer+TcdbrsTwd33bb3haWz2O7jkRX6MHgjskoa0fSf0RRZzRZdza76W6Ovlh/uLr+Uc9/ez+JTf7Qlf71y8KCa8fWyhg7dN3foJ5HVbKOaImuXEU2Rld//6Mpv1Lcb3xxW8E3ncY8+v+t4QfHpCq+Nqf7x5TfPOjj23qffW9NxW2TlN4xqHlnni2gi1hRZJRVdJW1UdVn2sPbFLmnKlD8yvm54QG7QoFH78k/GrLx86N996n79Z2SV1KimyOpbRFNkRfGcrig2emjwtezoxwU1+ly7vUzxihWbV7Y5kZey6tO1q6QXU2/Kuj2yohhGjY2sVP2faoqsvomuvkVlr+6+PWPd2KjqX742Y+P4G9+q+uNHD7RqNK3Hksfuf2zXW4mR1TejmiLrR/8pTZGVKtGVqpim7zz0QeODCdL7B6b+fV3hymnfZ7yabXlsR7Wu+blRHd5uFVmpCqPyRdZazitNkVUd0VUd+YYWty14xdpws3zL4aUtRk7ZvufSinnzT71xIHbo79MeveyjyKqOUU2RFZBzoCmyAiK6AmL/u/KenIpLUr56fmfD9XdOOXnVszN3rzh0eHXS7w+e2HnZsOTICkgY9SiyWgBoiqwWiK4WJFT/5qJfPms8/PTuS+Pff8ye/3mTBu3/mtEo/+5WtzzVVRqyL7JaYFRTZGat1BCZWUNpGL3+ldRl5W6znrojpceilqfXp87sMHBCvx+avDYv1ZW39IZpkZl1GFUiMgsNrLX/B7PQCp9d8/fapjGuD0ecePzzYR2PV39z0LitP/SauTC+a9yzCyslRWahRjVFZmyB+XPBztjKVSrXe7gj4Y0Xex2b1n3X2h+6LHuzTt2TdZ4/Nv9PW9JcuVVkxhZG7kZmNxnny+wm5pVme5tMmnfooRkpZbru3rjy8UrvVL31ga+qt/mm14CrtyQfiMxujGqKzAQyaGcCNR2XPl3hzRf6VMvq23n++/3uWzD5zxMV+/z5yIbyMXtP2rs4IzMB/YyKjJpFR80Nm8868dqevrW+fuyJxg89813L/mOnjv+tYmzs/PvX9tiza9Ts/7NRc2SEKTrCbDKuT+6Jpk9eYr03q3LbI+2tI76s88vfUyd9XTvZmjM3p2XLC3eEKVZcrDrHKQOjMaPFRWg0hh2AqJXsi3tnTytS/qBwXf/0vPzcrBJIideivQ1Lweqz+rpn5fXNedD7s8Nj4OJBzZv5cCUNq9oFA/LHKi9weBtywZIe+ZNzXMwSVbCkV3bquFIjbD5r/P9g9wlZOiAvOzc92G574F8cPqkhDYwOvKNon4GG7yjkBTEreqVPnTpwYmpWSDX8co8fuo8vNTmGyX94e2dt96xxZ34sSe4SiFSwnCtJn5Ceu3hQy8tfTolS+Vd1Z/qBtsVfFhcsGZibmuMq8l3vtdkkRR87+nWWt9xXQ1dR0TPjPRE8OpP7ZHQed0pxVGJp6Sp1pE9p82bqSkv+SYHXS4aun90l8PooY/q7hDi33JiEEMXbZkxCVMGajqmZmeNS81I7ZufMLL2VjqGrV3BhKMUH/KU0wTt5ymFmpquMf8XorElBFmN30TlsT0oFS3j+ewIwVEHUGsiUZmnIcmkBSmnRunHpadmTc7Knpo+emJGVVxxV/r8X2RbROxDtUSCy/XpYPbJDxm+nYLoMjmxL2HfRKewMl4Mj2y+jNQYrvqhbMqhpsyu1Jk3AlJ3Tn0qKqI9AyzaNOlzjwxYzG1Zomd132m0fDlx7c7nFl3yWUOnb/NbTfi/OFhtHqaekJbiM+SR603VFZp43UWtGKChCQWf+/YsUFOp0e6UTvMNE3wWVS8bQiWF3nj3Q6XZfJAb8xaGRgjFKg0OOhqMCx9tRAUWM9+9F/v2rQAQZY1XaddYZ1ULUoVJn8Jkf0IHqSuRSJcDUinSwcbThhPSs9NxUXsOmpqflpueNnpQ+c/T47NzRfACS4YGOzskfm5mR5vm9OKrPv1zhuoZZ4bqW5r5G74J1KtwaoVbpOqv05lnLEzWqlt9fupg58OhMPvAI6NeOXs6v1KzeVTmPHChXXL/WsXa711w2v/JPdVoXb+/21Kk/Xv9N2Q2l1d2YWd4sC2PUERwIpR/uaf8LNawNuFTeX3ZUvn3JyLRG9cp0/r5S8vxb2758/5y29S7V6hCsPJ0tQeWDBUUbc6EjuLSXJqfh4h1dEubd8eKtWN+KDRqUOpQ47fGrYoXRoTd+dfiPX+1KKegzFi0GdPjqY1D3xBjrHhUGlQI7QVJqCFzHURhmsN77K/epKFUffM9B3ohVmuZdmQv1V4uauthgdbE+dVoircGDE/WuiSXvmlj1rokxqWtC+CpGtWucStOC/OhU5oWKOmewOqdG1ziVWRcUJ+pd4yTvGqd618Sa1DVOzaxRuShOsz9VLiqjmTArOmSmpk3qkD2jYB0vaXkZA9JSM1NzeXOesqdkxX/EKf+jjKpah4baTt51/FAV1BF2MjqDQ1tt7lJGdZIZr7TIMPnFlpBfT5z8YvysCprbxXQrofnOGpOBaI1lDrt3fOQdLazuwvMxY0KWx9AHd6TekJeeNnpyxtS00RPS8/qnZo3LnnyG+FwFa3unT87OncnvNpfPUhSKXQXLBmRMzslMP0uyhYXnZKKzLPeMcQv/5QlMpzAnMJ3O44lLR82Ji9M/qP3A4VrUkXy5hS7si47W5jIUs+ypo7m80TmpuXkZqZmjU88KKo7a8S9Hbq8wI7fXf/ApQFmhpwBq03Sr/1+6Kqd2fn/pFjwGKvlL9+CqXvKXHkpm8vtLT7/RdZgs2inskZcjOBNjlcL8MvFo/bOpmJ+X6cnEfmeSqCfPofZZ4/qdzaCSTFygmpkW1b9YVf9iU/2LXfUv0ap/caj+JUb1L7Gqf3Eu8FYa5YKAf/Wh/y+8EgZHTJzC8Ct1A6ZfsIAyhgTkBwuINyRgbLCABEMCMoMFJBoSkBEsIMmQgLRgAcmGBKQECyhrSMCkYAHlDAlIDxZQ3pCAmcECKhgSMDVYQEVDAkIsQ1YyJCDEYmRlQwLyggVUMSQgN1hAVUMCJgQLqGZIQIiCUt2QgPHBAi4yJCA1WEANQwJuDBaQYkjArMChS02NpZFaxgi6qfGlkVrqSyM1TVoaqRW8clBTddWqttK0oCWm2komUlFXO1hdbY1Vq9pKbjJdZLz5IhPMF5lovsgk80Ummy+yrPkiy5kvsrz5IitcEN1T0XyRlcwXWfmC8GWVCyLUq14Qxa3CBRFE5f5fg6jaBZGQ1S+I4lblgvDlRRfEACbpgujxMhcEj18YpFvjggj1aheEyAuDeypcECJTtFd2kXfUgld24Vfrgh+GW9xLtVZ6ofWH5oFLCQkaCyuJRmUbXlhJDDQnUWmZ6qJLIvg93j0jO89NrpTwo1psJAbHRqLuqyVJmis1GsvQkBOb+D/csiiJ0e8v1mAvlvzFplR+9kGfe53WAjtomBEnKrQEpVgiQKPaPaMlUhYT6f1iUxF+ihzTeEFD4zV5u8arng6NDwpitb7bCfyboreDXoRRvBIao/HmjdP7Bgv2bbDFF2h+cefwAfx+j/GF7Nm3cNxb4U+aY3wQ7FNs3e+QAy+I0bkgNuSHy6VqooM+XI51b/S+GvHshJIPEqalZmbwp/YZ2Vmjc9On5KdPzSuOSr7gv0X4f/raKv4/+t2C/+sINf1eR+iZPnNwaeD2Pxu3RSJvGxRpPWlXlyirv/OgKdFIuQ71SeTWtInpaZNGZ+VnZmaMz0jPHZ0+I2Nq3tRF/3LCdg4zYTv/B99gitN4gyncu+10bt/K2+nLvXHZ6VP7eKOvsyf41F9HsbhCvS5j4PUVje+HS1/xuzgrOy9j/MzRabnpqXnp4xSpkZ2bmpaZPjonN3vGzP/gy6kXfII4w37hNnyvRAWngd8Ltv4clHI2D3Jyp40+G3UdzwZdaUIUFuLRXRrBtQIjODsv3Ru80/nQPyc9tziq4X/vHVWDX9WE/wYlEMAxSuEln7GVvsxZ2lBqFRq4BU3MSsduQVOo0rFb0N3bwx4UG/6oysAHWwbfTbWa+lWQWR9sOYEPtoKXQ+yqyyFO1eUQ7wcq1TUm5jHBk+jSV5DVvnLsWSK3ftjFthd9sT03c/yL/9NT/JqhV0x8QRQc0naFEUq+e06N7jhBFRY+LDI5EnohfGW39NSc9rm5qTOVtcci8jr4w8KvYC89a0AAiVtCX+OXF16iXzktI336GXYvlt75l+l8cJh0PrikrFQKexXAEjaxqdF6j5ArkfYAWu/hayjf6Vdj9R6qrN5TldV7lTgrxb8w9VZdqOmjFO/3l77BA+ySv/QLXkwq+cu1qszUP3iBtuQvA4KXg0v+MjCYj0r+MkjJZuGOB3prPeECx4tBbONUCgvcFkM0bL2DOvDxWdC2Gp2NDpQCru9iNFsCru8aZuXpJrqyWnJ9d0OvX0v+26IGD3gkeCBZWnn/5S0ZAr+9jlGicIkxGg+hHErYudanPmkwr6fOzQ4NgZ6LBTxncH8Mv2dtEX0Xtj6NCTdS66LCZtEYAztX6G93UUbkoniRixJENtZIFNGUJHJRsshFZUUuKmdkM5/yGssxFYyytOHlmArq1bm80eoccGMVNG6sojHZscZvrKL6jVUQHTuJmq9KXJWCA6W8UktQoaqkvAsVoRVDCQ29VrDR7/GsZ4VgalHoiXtFSXV6XqHIN80OPd+OkUJOsT2vLJyb1YjY0DcVFxX69zIqv8er/J6g8nuiyu9JKr8nq/xeVuX3clGBd1w6Owj9exeV37ujcnyU5uk8wc/qlXQaFDHKP0aZ+tezRkSdQ41G/hoqQbAfPV7Er1bbkFYKe6lZoEhrzA3sJpVYWXPlVP3ljRCjRMWjIBVllmBlFo1hZ0Tg/4dABQ+dKxtljUFA16Aplaxs4ibK6hL9jjFTkWjVkNgtSKLfeVb4dnnKFxi0tsvDl1Bk3xqgxqJMTNhLoTYDMzpZqSXQqjLKZrgv/NsNzP5kpZZAqxKUzXA/FYg2MFOUlVoCrUpSNsN9995hYFYpK7UEWlVW2cQnnQqZziCZ5ZTNwL1/KyoVKgcagUDldEVt+6KyBj9yUX+bQu1Jehfvi+D3qE6K/B/JKoSvUMxXgz6RqcikDK/s+7XexULuLEr1KZQU9gM5p/HBl0198GUxafBl06Q19Q8WbJpLdEbKv0Nz1U+PRSMCIwK1F4tNtzHc9z1jVR+ClxbJVarpqlIk/fbGDXFgCpMqeGWvNTAgtYQ3INUqLsHDR79TnVUk2jUkBg8f/Y73VZEYrSExePgYrWzikWXRGvwJDnItWkM3v2Eu/gTGojXwigWyKk5TZvCwKU7ZxAfTFq1hk99gGn8B0e8d60CZTmVT43095PFTF+1RitBmbcZ2f8z413d/TA9398dxBLs/Gtu8MS/czRuzw928cUL4mzcGMFEljeFuZWMsV974cLey+nC3kknD3crBeV9JdbhbRWla0IigijL/VdRVCVZXRWOQUQUYQYuLjDdfZIL5IhPNF5lkvshk80WWM19k+QvixitcEEFU7oLwpfWCsLLiBRHq5SjiMnhuJjMpLuxPQCqoviQthb2eXME4k8drnDJjVWf5eHCTl9WLvr9xxGPN7jDwblS8yLtRiqFBuMvf5VS/akpQ/aopXvWrpsSSN9+ZtE5rKA9aZsSLCi1BgR6vu46j3TFBG7JYlfmg/tGy1gYpWpuuxGmdImTkezG/I43UN4fR2qwlVuMEOafOp0fe83NVHoJ1Cb0gVLk0hnYYWL+xq68IIes3Dg2J3cxaGbGrrwgJrovY1VeEkFWRMqEkKsJQZAUjQVOmzsM8/FGc3a/oaD2Kwx962ZWDC82HXioyy2vKDF4RKq9sqtXhoC9PrEaf73jzaafqe5Y2A28EVvBlWlCl9Xv4p3ZDFehuqKLuDYV4b7KiL9G13pq0qd5QRbobsuneUIXgG7L56kzQDVUIpqDgG7LR3ZBD5IYcvjKndUMxqjfk+Dd7KCZUDymqbNAtxQTT73nWRyE/cFIUea1bKnMh9lKi5i0lXIi9lKx5S0kXYi85NW+p3L/RSxbdW3LoPPLReopcXvWRbVffI9uQ76ZMKjV5vyr3hxy+27SG71xwlmL4Hjjeqag0FB9xVNRYxJCVMI13kfwegagODkLecbTWHVdiUn7pHR/S2CIkvAiLVY+wSroRpvVwIcQgrrIyENVuqBLdDVXWvaEQC12VNQZxfuuQajdU+d/soSoaPdRR84YcF14Pdda8oZgLqIe0BnFVkBHP+ddHWoO4KsiI5zzupUSdp3EXYC8l6zzP+Bd6yS6yqGDXHMRVDB7EBY9Huqq+49tV7R3fkr+bv+UUk/7b+0ozaWPpUfMBD01KH7pgj0w+dvTrLG+5r0bpInvp9V6bvYpU/Km2jZhyKBd4jRx0R9FMYoFPNUotMbhthRXsFovvAj/NsSpR5vSZ5o2y1wO84vDJCIgypw8SOgYCrYvVCRpn4AVOnQviQkZZrCJIA/okjkmvqIWXzeh7N16P7VPpZYtJ8Vzmle19T/yWU1c/nsNUtKnFpa3KDK07W1dR0dE6JRuOerfKVdlyNPFf3qOsS5h7lHU5j/cm6xhyvSJwb7LOvgbhlqPeXeTD/Wq3y7ndjXdX4O6E3l14S/YnnGfujgDzDH2P7rldb75tzOUip6WPTvM4Jzc1IytvarGz+r+cXLPCTK5ZJWFTJexdZR1h73KjlmTjlTYphKulz3jV9Jmgmj4TVcefGaoD4etVR6aTVBd1M1W30Zpc0hNtRD63lcP+SiQr7CqboPGoU+2VE6vqKyc270zEnhp2PcoK2zsJOtvsh7cJYdAmhp2MXZ8Y5l6ECep7ESKvdVvC2YrQObxX0J7k3bx7MFZqVu+qnEcOlCuuX+tYu91rLptf+ac6rYu3d3vq1B+v/xYVvAdid9HNG3uAFwY9UegZ5q6NvcKki95h7trYR3Hj0q21pj4cc7/U+8U5jTbHxb74RftFHTqyN2+7p0bCmqCTSfp6L2zQOubU0ntuvj3q+PKvHvilwc52jZIuap902duPvVs1K3d45VOBF/Yz+gwm4PprDX5hG3B5f4OfHgdcPgA+XS/gwoHghUmBFw4S/Myk5PLBgp/6lFw+xNDlaYGXDxX8yKbk8mGCH/mUXH6docvHB14+XPAjp5LLRwh+4lRy+UhDl08OvHyUwS9zAi4fLfhpUcnlYwxdnht4eaqhy6cGXj5W8MOqksvTDF1+Y+Dl4wxdHjSATw8oFPL+sqPy7UtGpjWqV6bz95WS59/a9uX757Std6l3wUFjVxFsd8qAEanTNxUJEl3GWPE+YfxV7jLqr2s7jXIl/nqkU2MgbfD19eNi7zcHvciboPzb2WWuHsFL6AnKbsdf3UxQW9QrRSSqfPntd2hl8HPzxG7hBo0Upf21qMCuGvEaEW3wvfqaxiM6EfsAIZyITtR8z13j01dIbUrBig6ZqWmTOmTPKFg+MLt/6riMGQ+GXPgqo7xrhTpFR4Y7y0wJ+wOE48GvvpcO5s/m2TCjSRHrt24QnBTM3rdE9AjtD5EFgjtRI7iTyYM7GTtCOZzgDrFLb6JGcJc1NbjtIYM7WalO0ZHhLjO30whN9S+cnCWxNVF19wGxsHUy+zUloidpf4Df1NxRRhJ52CbRjzKSjI0ykk0N2+iQYZsUMoITg42JNmbMGNUl0p4anxnFl8TWdNUBk0rY2rXDNp7ZG5aIvkF75wqTw/ZfHUo46YYSznM2lJANDCXCf9A1Gw9bvy/nSt46Uf0cNFYsbmOZvbJX9t1aD1OEAjdWI3DjyQM3Xj1wY00K3BDTq1iNwE00NXAtIQM3PmQMO8N+nvGk6qOvnhqfkUZ7g+tB1b2p9Hf7ChW40cxeKvsRreeIQoEbrRG4TvLA1TicMtqkwA2xN1S0ecsROoFrDRm4zpAxHBv2Y7TdeOD6vWRfElxLVLdpEwtcO7P97JW9POzoSlSdmUWFjruowLiL8hvTlzz+zPR/RKrARGmwVLLGwKuskUGNwXCzmMoNTjpuUAxqgrpNOcYIXHAr7dQBBkZQyvmqqsB0wmUrywW4bBXgjSS/GUugF5OUWYDPyJI0OiZJmTwGSCmWvGti6UkpVjNjhPoT7xUF/fnIa13v/My8jAFpqZmpubw5T1nbZGU+Kf8jSTZwg9G+h/Iiuy5o8Xhv7R0e156VeObBT9+c+QoBJa87hxjTdle/KjHoKqfvKtVu4E71HNcSik1U97fy2ud3YZLvUX2IwaL7UCm1PRV2XUsKrhKlPBnwl7Klb5cE/qWc0k+Gmbp0bxz7EiGmVt2+3RnKt9FavnW63y81ZrlGUHm62veffrueqF7k9L8oGrooevGA/LEhonBg2AsJQeObZNWOL6dODUD3JpV6dBXevU6ldvXhRfmQffitd0j6pepo+VrV9xi7q65pdC99Vz4EZ0WDb1xJ/1LHJQafkWdOpy4R7dQ+2f6064N58lU1I5LOZERpl/hXkYAFYZ/IkreTAyHOoA6Ek95v/VedSPwvcio9qHrRmT2zVWhELaD7Bwe0or74AjfkdnbbSgEWVQVS2HNXgaMUNbaek00ap1k1XwpWXwwKsf+AXelyDW8hL5UM13oUhggIsXLvMCSgkfYTK30BI7Wf1OoLaK/1kAcRkKP1cBMRMDPcPacnhLvn9LRw95yuH+6e002CBVQyJOAS1W97Q9SUKsbSuqvxmlJFvaZUNqmmaH3kH1RTqipNC6opVZUFREVd1WB1VTWm5VV9b7aaJVBRo0y2cazZAoeZLXCI+V50mG3jKLMFjjH/phPNtnGQ+TYmnffhff7ny0jzuyX5/8+LQ8/fbKHy4ejz/paHnfd1e8gFQARl/x8LxKDzt8xSBXfqeS+QYIBc7rzvFtMj8brzngjGnPc+HHzeM4vptzz8/L3l0mb5876fR5z33XL+j2THnPc1e8j528sryMZgw8/7bhn1fzTsLG1WMNvGNPNtrGi2jePMt7FS2A/cqhQEnY9Yojno0Ww171+CDoSv7mtWDvzbRb6mbPwZstX7DDn6A41nyOF+o2DqS6VyqckfmfNSqeKBcNnSh7DPakiwakiwq0sofYlB0nosSPW6nUP9kYvdpEcuWucUab2g6gj1PqnC8Wa9oqroL40jqlVP/IzWfsU9+GAvBczAm5f/aihEn5NQwN891H/zMjH8Ny8dypctnf6vYaq+rG/ozUvkTHWHoTcv/d53U38TSqvz0t98oTDE9wI6l1q9DcIXvW2RF73DedHbbr5Ih/kinUb4MZo8gKLp+TFapL5pV1JffdvcL3tqesa47Kxm/dJzJ+fncWR2VpGSc6zK8mE1YKRdvbBF+zlQ7WU6h+rLdDFkh5KUbr3oKK/KvkZO8lFUd61zfByEoz7bhTLqi9aN6hizotqhjOoYiqgOfgcQIdd/ft1SL0SH61wqexuqG6yG//2oQBRpfD8aQ/f9aIwqufptG6I18LYb+JYuHh3LmyWy5G/dzbfRUBH6V8PHfk7CB3ewWBFyKotQvFWk6PXSPnVXuAjVJ/xMViAULrTPZPUrifgqhHkLG3qVRNxGQ5XkXw0f+zkJH9zBYpUkXllJEq0Gyp1GJfH7StPsvYTs5k37zd1LyE437Vf0LfFeQn5H04ZKUO29hMLs25jztW9j6Po25pz1rdNQ36p9K3m+bShjpRvRWTW6xvCGMkYG3Yr7Vh8/eDcwZHInTUqNE2NptfU3lU1j/AY2wR8cJjG5g8Y2Nt476abaO6p71ZTI6BRyK0bboVLRPYP7MAYc014SGdOaMqaNiYxpdWnuXw2fmPNsTBtzjse0MaJjWrSSNIg8xDLlIVaM+Y+HzHsupldJwnkqRjdgtl0oA2ahzZHEKkmispIkWQ2UO41KEq85g0qkm0H9qxtEmxUQScZmUMnnYAYFbxAd2fzbcN+eu82/4w31Ld0qpbn7BBOuUmotShneJ9jIoFtx3+rjh/jSid98TUqNE2NplYuSVaapfgOb4IlqMpOLgNnxI6q9IzI7jme2Z0pFP6ZFU0aIT+uJoVWj60ycEyVdKHOiGPMyKJEyg1ZeEBm0nHCVxtyQOjerNOd1SG29IEJqM1CUnzW7KBeVit4VVJQJHhDbNYY1VvOml0mmTi+tdNNLq3nPYxINhbF6N/iNPL3B8WZwVyYDGRTiXKhk3QwqqxLKyX5pGBTMZZn8OuGCl7khdWGcKkcaUkcuiJB6FyjKxaq9I1KUE5ktv1T0h1ofW8QY+HzDrlGUY5QwDX1Ok/Q5QX3n+v6sJumzgvriTdIX/2/eX0B62DQqrsHlge+NV1y7esW1mVRxQ/jKZt4w+JTYMNiuMQwu/WZT/uuCGAb/oV9xLVGqvaN/ykxC6FNmJpQKt4S7MW5i2OefnlD9cMQW5ocj36t/OFI6brcZiIRE5T1qf7YV7rGyH6k6JZHOKQkiTknw6y9Sp5xUdUrC+Rsp1E75OBIpwf8+iURK8L9PI5ES/O+zSKQE//s8EinB/76IRErwvy8jkRL876tIpAT/+zoSKcH/volESvC/byOREvzvu0ikBP879V+MFLqv8gQWGf+dr/ISRF5E1X8PPlnk0/Ky4Aeha9t3HtC02ZWds9JyZ+bkzVdmkfuUsq8TlUuAyv8o6z4V4v13Q6txp7Q+IUMExKtG+/n2VDHhnISf6Gv0ggvM5/jNfGdEZERkRGREpFGRdHsaCZDEv7Onkf4YxawvbKxhDmyQMYpTORBJTFQfrxB+vV7p//Dr9Yomfb2eoPyb9+Hu9uAsTgCGKAlCwa7yMDrBL/hDvABk2Rp4LxbTQkoyN6QsdCFlMS2kJNKQeuWCCKmXgNcqXjd7Q4RhpaLdYcdtRY0bCOJeRRB5LTigdnMW/XdGbCFuz8JsXUuFvxX2uo2B27Mo79RrweEwXomxhX4lpkWp8PfCvr0agpu88Y6Pwj1TykLdS03/UM0vMWJ+iWG2S0uFf2QkJoNM+0TNtDgx0+KYrUap8M+DHV7GWJe1wW8uLvjmvjb+pYLmzcUzW3Kp8O/CHmSMxG+uTPDN/aha1MVuLoHZbKXCfwn79bGb8JuLD765P4y/zqx5c4nM+lup8L/DXjJ7DL+5hKCbs6p/Dix2c0nM+lWpcGvYb9w/i99cYvDNOYy+jalzc8nM+kGpcGfY30QfxW8uKfjmEoy+3K9zc2WZ9WCp8OTgmytr7OZ+w28uOfjmVI80Kid2c+WY9eVS4ZUJX9KOvQBf0tY630brYwUjm/s4se8fYswXGWe+yDLmi4w3X2SC+SITzReZZL7IZCOrBQbXgBKN57eVfrXAqrlaEPS0WGGa1hepsSZ9H2P31feIwIjAiMCIwJACw63NMfpLetbBYSwLWUMuC1kXlAofFvYt2FSHpgJnJ5Ye9+ioj5+dqLjfaNVXpyxhvjqVqP7qlFX31SmbxtOWfsEBZlPe29IwGdjU/rGQ9Y+Vrn8sIv1TelFHo/1zYedPuLdT5t/IQJtuD4ecTq7ABpXh56D664//Qg46wr6deLJvW8OqsvZQVVYZfqR9HKmz4dXZzjp1Vv1mLcv6p+fl52bpx0WJqq5KMfx2Al6u8V149vGWkXeXY40GjeG5eSz9u8uxmuNh9bW32HO9UBZtmki9KYK4jYb2YP5XwyfmnIQP7mCxPZhjlXswO41smKKxBzNyPnKs5oq12iPs4Iti/aqT1qFrqueZnjEldEmDi2QvpRkGH8DbfUU91ON3645SEmnwbwwXY3SJSui4vrhQNULhk6AqEafsdDxOZV8XqZOiHXnlhK8tqMZQucW98zN9/5kMxFD5YFvLAlFUQSWKyvvV2qA4qsCsryviSEV4Rc11ZjWLgi+qqLQrMCsrKJuBAwrFbVQoGVCoOj3ZP3HLKaWoPV4UDJByiieXqvaU9Q8C5AzvcqF2d9MPgvIqQVBOOwjKM+u7+kFQQSQIQkRzBT/3BQRBeb8ICQgCZU/qBUGSfxCUVUrBP+eCgqCs4tm8RlD6BQGyp2jZUG/h6weB2qPystpBwB+Vn9QPgvIiQRAimsv7uS8gCMr5RUhAECh7Ui8IEv2DIFkpBX9fHgqCZMXbJxpB6RcECUAQJGt+RRvOTo/O0C+DnNIPgnIiQRAimsv5uS8gCMr6RUhAECh7Ui8IEvyDwO9wAfxLCygIkhTvV2kEpV8QIAdZa381HM7mc87Qrzv9rR8EZUWCIFlzcJMUFATJfhESEATKntQLgnj/IPA7fxH/RgcKgkTFG4QaQekXBGWAIEjUfEc/nLMDnSFf6LPF6gdBskgQJGkObhKDgiDJL0ICgkDZk3pBUMY/CBKUUvCvE6AgSFC8I6sRlH5BEAcEQQh7ygBBAHwv4Qy9B29F/SBIEgmCRM3BTYLWJuyJQUGg7Em9IIjzD4J4pRT86xgoCOIVb4Fr2OMXBMgyQxnN5zCy0TfOy2gHQTyz1dEPggSRIIjX5LUy2qd4BQaB4jbi9YIgxj8I4pRS8IUJKAjiFN85aNjjFwRWsSCwiKyu+JWPQIfH+d2HusPj9BxuVV1MK2NgVQ9yeAzwzYvGqwSyocVODd8hy50xYuVc7cOYGO1MjmO21vSLhlIl9UXDON1FwxAlIU63axI0h0Yxmh8m2g30d9iLhnH636nFiSz8W0J5TSM2/Xpb15AS7Z3C4Jg4XY7pA0RmDF1kxutGZsggExjm+H0Uq3WEscVAb0ORadH4QDRe/wPROJH1fKfByPQ78vf/pULJmhXKacC3UBw4oQr1uoGYtoiwZyLMnlRvypi/v53AAkiSZhwkn0umsilvRfeQgSQRpkrUcYDmvI/qfZwk9ThI0o2DkF0qsBqarBkHZZV+EFix6mR0kdBvr8ZQi4S2W4UWCe0iOeJ395qLhGohEk8XIvqloqxIqSin8yA4KET8ltNNf7wR9CahItqDxlLBZUTjdCiRyVi8QTrxWzkgGl6GFyPnnE7iRZa7OhldZo7XLiN8mflJoWVm/RDRXmaO115mVgsRJ12IxIswTTwp0ySZ/4BMfQaSqPFSZDxw8ufiAfljjS+KJgZfFu+7E7XbX+cN9s5T8lMzp6q88hUfOuA3l8ZAI6PTaB1S5tPobULr9TEiBTdJi5ShgmsPM5tqXlDjtngDljhFOiQZ7hBdKjaw5CM+gHwNWPJJogsRu0iI2MMMkUSxEAn7EZT6OfZOscIZot46dQtnIlY4VZ5FHtYvnE6xYYiT2d7TL5yJJr2Tnag1DIEWwKx0WXEejlSdpjKZU9MSnQ7RTU8DhVN8yPwVUDgT6ULEKhIi1jBDJF4sRMTXSL2Fs5uBbxWiRdZBNb9VEPxowgrEn1qtVNiTELpW/nUOPj04oR5/TpE1ev0RlfYLVrGaz2rO6VNEb2y6lxiI+ljd+48O5TSN0IxWNnFDLMjgQiU0ndqhGc/s8UBo2ulCU38Sb9bW337v72ltyR5toL+h0IwOHkivCBxvuh80NTVjNVMz+LTvWGXTyJBaP6ET9Vk7IeTw1Z4ChGY0XWj+KwM7bdaONdDfdtXQ9Nu6KuBv0cpbKQnNOwykptA8PFErNI3Nw0PdiD2MV30TQg4o7c2A0IylC81/ZbHGvJk4FJpBxyfFKm/lbGhONzUztSc6sUITnZDPfPXzGfgSISHkGpG9ExCZ8XSRmSzybC85zGd7SZrP9pwig75eGtHn1Hh+5/2saaKBgBB6K0ozMv1eAsANsZFG5mAgMp3/V5Fp5MUEKDK1Hgl5I3NYgNISsdGBKzKKjVX8esvhA/j9HuPrspKVAHuGNzBL/mL3yfC6JfBie2jrHIHWOdQ6xisw8IIYnQti/eM6UE20L6a9FzB7uncPmKAtNWTvGQVlm0YdrvFhi5kNK7TM7jvttg8Hrr253OJLPkuo9G1+62m/F2eX+irrP7Cnl9+4PPDtd5sS572xJYOaNrsyCKpYjLHpvShv8yyrhzTBqn6Rxf/zAa0tf0zc89oSuhsupD2v/UbVQaWtdDVvgIEptGIJUF1gupHtkKLJuyWafjukaM1nJwHecChNC/KiQ5kTKuocweocGh3jUGZcUIyod42DvGsc6l0TbVLXODQzRuWiGJFnYdor5r79idbxcpaXMSAtNTM1lzfnKXtKVvxHjPI/YlXV2jTU9g4abNqUzXCT0REc2qXEEzTuKflLN41Rj8049UV7qc++BKc+v0ldqO1v7U+WUv0TGmuFVu+QwjcuCIzn0pj3Obbl5eqOvbcNa9AtevGRgiUDc1NzXEW+672B5FWp/jFa6dgopM0W5H7CvIuPb/1uQHZe/6H6d3FOI1Bxy+Jx5miCx5nfFE09Bp3qnRntP/bxe16mUa+RE68Hhnvm9kStzekQAVPCPbR7RrCAOOy8sSg5RN7bWPR1pan8rMYodtnZ9zuUAVUSDaq7A5YpuebpQU1DENG1Iawpw+zPlwbdAK0xtV+IlJrSQ+tsMMS7+aqPf6SwD69qY3yskKA+Vog3aayg/RFc0BMHhWlaT08dBhYOEjWGcYnKRDVLZMnfhpktcNAFcNPDzRY4ymyBY8/fbin5W1qkn8/Hfh533gfOULMFjj7va2Lqed8po877Tjn/K+LQ8z4OR573vTzqvE890+NwjNkCB5/3t3weDzpNv+UVZKOb87+fL4RBp/P/bwQ2PDK+Of+Y7/xPvsHnvYWp5peHWPNFljnvO2aM+YSvuorpCFpTVTy9DvWhkINFD9FawYZWAturPqaStNamQdmGlzidmifnqC5/OsHHMj0Xja5cd3PHgwZesdN/Q7iM5pppuOvE16i+fBZwipw12Islf7EplXsfFqZqLY6DlhnxokLLOT7W226+SFlMpPdhoCKkFXkb9HZSyXXXqn6f1937rCb6WHBv2gw96hgdqKSMRh0w+LShqfE6EK+e62VMetQR4kXvMr6uCvBGgtI0rc3cHAaerCRoBFuCMjLMEqk36xQVOMhsgUPMFjjCbIGDzRY43GyBI8/7sBlqfq7YzLYx1XwbY822cYzZAsee9wUi7QIos6Zn9Kjzvp/HnfeBM/z8LRBUt2x62Iz+/6s3YyPDugiZ/leD2/R8vu78veXSpvP/cYzjNJ/wDbwjqljPVHn59EjYn2BcTniS9OXG1zFiNd7BjlFf44gF1zM3fJl5U82oursNfJChv0+MU3NhJNzFoCYaH9OqrWfGqq5nxmutZzqNWmbEiwotQemh+GucWNdoibSbL1IWExm0nhmjzFu19cz+GntN2xUrmgYOulB+Run9sELljkJ8LCR0uoFyv7Mu3LEZE7I8kfjgutQb8tLTRk/OmJo2OjN7QmHh/IK1vdMnZ+fO5CJy06f6vTO/slt6ak773NzUmco62CXwihJNvULj7dL8gmUDMibnZKYrl3wLlp4FukL9sUvQj2fuLvCSs58SSAEf+USfDPvb0mjVr/AEPv61i3z8a/MrxGokZlf98tYm8smKTUuT34fBpf4YGPYjvljVR3xRwaejqFYZoB9iSovxKrwfopXa1b8TLRNiwBDNov8ojclfguuF2vMTi+/5ie6TFUdc2F9oxagOSaJUd77rptEzDuM9E+43gpya+2T7u8AH83zQo3HynSesS72quInAr+iVDFfyFX0gRGFRtN6H9gFJGAule4xq5jrgs++ilZrUYrK/BoPZFLEXHPQyc5QePuqIV5TkkNBkreeCUPRGBX/CqBAVJker7Leh8h119LLgXYUVHyUH7ngRzRx1AweOpfeAjuRLB6MhLwjatsPiu8BPc6wP4Pe7YqtLb5/WCvCKwycjYBcSpw8S0rrYQOtUx/5egYEXOHUuiAu5C0mpmpigPoljjovUvq01vEOE12P1VHrZUjoUVA7QdigGaBPS8/qnZo3Lnnwmq13qI7WAEVFhoVnfCTv6dZa33FcD+No5PEVVd6YfaFv8ZbHAB8kmDu2CiFBROdQ/lw9jQDjY/AGh3zCtNNYGwExkU9ppaPWklEVDrZ04upbmwzWmfCorG+t2u+qWJ1EawzqB/Q7k0s69Be9cKzIxvbbUg/3Cpk0xdwh8lm8jc0d/hTvC5Pkwi9edH50+ct+Nlb+l301B1t5ToCnASgZ2/jE4kTttfP0xhn7nH+2dYsJdc/1HsW3M8oHZ/VPHZcx4MGSwRYfkldjgSA9eeYzRWHksyS5nYvCtWIzeSrjR+bfqfLWn6j5gA0qzeIJaDzpU9ki0+hWFEO8fOzJLhV+vUSJsuju2ODSWWVTDLuh8kmil6WoLmqFOKAl1x9Eh7jiWOabon1ESq396tyW08Dz9M0qcmtmGr+I6lXZpbq8dOAlXJpfeJDzWv1/9xnuqFzmVSwYDwHm73xTcb3UeHQs5lJrUMkVjHbiXJsn6kpBy30T1tTVZdZugPsbHHFaR8bVfqdZYTPHrFL8DJ9CetEJhpq5J4yJZZD3YEjjoFtCEOSKiKaIpoimi6ULWFLTwYfGNBQKeQihrtucphMbzAlnlkYJyJqs3mrGoLJ701Vr78RuY2EX85jcoDR49eLd7sz76mbwp7avPR198/aLJe0+O2zynRbNfOs562tLjr86zi+7rBC9QKbdD1IoItTuLFnmcisee3w6A+EIXGbtHNEU0RTRFNJ0nmtR35gyiT+USTSj6VH5/rkKftmCGFbgfq8jDdaHRijXEKp6XQBMnDH70+9NTN0plv/t9+5GFPcYM77/1mom/r6s2c9eQxn2KkrWMVLszzUmr2p1ZYU12keizQprsJsQ5RtURTRFNEU0RTeZrCuJCuyoX2k3lQrseF9pFGMOiyhi45/ye3KqfA9Rgap/nmqW1/+6pxyypR8vGvX1j3W3d7t97KOtr1rfN9hnNq2gZKTDFU+dCoWmy7ZytL+NULZQcEU0RTRFNEU06tGZVpTWrqbRm1aM1q9j6nqkTIVmD1uIWrX71tpH9Dt1+WQPLlL2dapQbVWb7ZbfWfajaxd+fPNnQOtzklUubCYRtgWLCYsIaqdCivlByRDRFNEU0/Yc1BTGUTZWhlFMfHYayqDCUJZjEBO5HiKGEBgRaDCUn/pN23eZXe0+6cX/OztpPXTV49t52td5fUGNL78721bNfWSgys5FFppRC3Cs0W8MXIYXiXGiBIaIpoimi6cLQJPbCiF2HbIBvUI2+MGIPk2yEuF2LbKocbdxlw29Hl7Mn92299/ic8l9XqWFr8cRXzy2f/MHgpyt3ullkEVfWiglTadRu8rzabsIMXig5IpoimiKazrkmsadDVh3esKrwhjWYWgTuR4g3hGhaizeqf3P37HUN36/SoVb5+Nsf+eu+oT/bpr9x3YiTG1+bcftfB7bUFpkFaL6pbyoj4tEXeToU0RTR9B/WFHmSIvokpW7yyKdi4w+k1et3z7P2gycta1LHNzv2zeWLBnRotHJA8xlDIk9SwmCoyBpzRFNEk2FNkacOok8dao35rM5tPd/of+2ceQMeeqB7+Sb9h7a/dUjXViOqD7sltW3mrshTB6OaIiu/EU0RTSV/iqzQi67QV35/5zOt7u+yZ4Q07c8tO0b1fiXnrtNlfzq467a9LyydxXYfj6zQh8EbkVXSiKb/jKbIarboanbV3xp9tfxwd/mlnPv2fhaf+qMt+euVgwfVjK+XNXTovrlDP4msZhvVFFm7jGiKrPz+R1d+o77d+Oawgm86j3v0+V3HC4pPV3htTPWPL7951sGx9z793pqO2yIrv2FU88g6X0QTsabIKqnoKmmjqsuyh7UvdklTpvyR8XXDA3KDBo3al38yZuXlQ//uU/frPyOrpEY1RVbfIpoiK4rndEWx0UODr2VHPy6o0efa7WWKV6zYvLLNibyUVZ+uXSW9mHpT1u2RFcUwamxkper/VFNk9U109S0qe3X37RnrxkZV//K1GRvH3/hW1R8/eqBVo2k9ljx2/2O73kqMrL4Z1RRZP/pPaYqsVImuVMU0feehDxofTJDePzD17+sKV077PuPVbMtjO6p1zc+N6vB2q8hKVRiVL7LWcl5piqzqiK7qyDe0uG3BK9aGm+VbDi9tMXLK9j2XVsybf+qNA7FDf5/26GUfRVZ1jGqKrICcA02RFRDRFRD735X35FRckvLV8zsbrr9zysmrnp25e8Whw6uTfn/wxM7LhiVHVkDCqEeR1QJAU2S1QHS1IKH6Nxf98lnj4ad3Xxr//mP2/M+bNGj/14xG+Xe3uuWprtKQfZHVAqOaIjNrpYbIzBpKw+j1r6QuK3eb9dQdKT0WtTy9PnVmh4ET+v3Q5LV5qa68pTdMi8ysw6gSkVloYK39P5iFVvjsmr/XNo1xfTjixOOfD+t4vPqbg8Zt/aHXzIXxXeOeXVgpKTILNaopMmMLzJ8LdsZWrlK53sMdCW+82OvYtO671v7QZdmbdeqerPP8sfl/2pLmyq0iM7Ywcjcyu8k4X2Y3Ma8029tk0rxDD81IKdN198aVj1d6p+qtD3xVvc03vQZcvSX5QGR2Y1RTZCaQQTsTqOm49OkKb77Qp1pW387z3+9334LJf56o2OfPRzaUj9l70t7FGZkJ6GdUZNQsOmpu2HzWidf29K319WNPNH7ome9a9h87dfxvFWNj59+/tseeXaNm/5+NmiMjTNERZpNxfXJPNH3yEuu9WZXbHmlvHfFlnV/+njrp69rJ1py5OS1bXrgjTLHiYtU5ThkYjRktLkKjMewARK1kX9w7e1qR8geF6/qn5+XnZpVASrwW7W1YClaf1dc9K69vzoPenx0eAxcPat7MhytpWNUuGJA/VnmBw9uQC5b0yJ+c42LOKgVLemWnjis1wuazxv8Pdp+QpQPysnPTg+22B/7F4ZMa0sDowDuK9hlo+I5CXhCzolf61KkDJ6ZmhVTDL/f4ofv4UpNjmLNcSe8UbZ2Qnjc6NSdndF7qhAkZWRNGT01Py03PK45KLs33Uu3Lud70Cem5HjUvp0Rp/5MCr5cMXT+7a+D1Ucb0dw1x2LcxCSEqns2YhKiCNR1TMzPHpealdszOmVl6Kx1Dp3xwNpXiA/5SmhWdPDUkM9MV759mnYNztOQvXZRCwvVQ57A9xJOUp1OOq0jFI6u78FzLmJDluckHd6XekJeeNjond9poHrXtc3IGno3ZAWdCtqhgbe/0ydm5M3m+5fKE8CN9lb/YuF8GZEzOyUwvNdtTukt+O1uC1eXKqn+xFPnLCPgvjaoZ3NM+Y/1yNit9Rl5p0mZkjUufURyV9C/nbJcwc7bLBZizJRxemo+lDV9AXUmU2MGHMYedvlajAROUvn7HRWukbx8evyX5290TvS719HUFJanHODPzUruzgsY0RUdTpvIUnJg6dSK/nfSMyakT0kdn56amZaaPnp7L2TQ9tzjq4v/7ZLSc82QMnqIY09fRBEILCB+rr/uCZNuN+jPk+E8KHGFKfnMbnl1nfRZuqvsr95+NnVEffM8Bgw+L6rDEbzrm9xdbQLHlNbGiMQItLZ1nr64VdpR0CbvyRgXXTb+jhbGZhMXnIz+XOXwAv99jfN4+OzWqAc9/YnwQbN6mO2kJvCBG54LYkLMch2K6EzDLia3qnYGqBK41OHBlhRFK6trhoy5e+Lvxut+vpOwXFhYVrOyWnprTPjc3daYy7zVZaOlZuMufjmT///SyzfqzCcyv5AO9aem5eQsCS3v5MKmlnDllOcpnT6ngQBIs/XJNT0XgeoQ3pr1LMoE65aAIsDiCKBTULqlpj1rcKWOar86W2uBN59Lb9jqiaKOv8/KyR+emjssINVA3zIsB19vDDIBoo0ykEwDRvhvzHyBLoUczgfbEGLMnFqyYMT7tauG1qkSvop8VIaZy1dklssCyrAHnSzxB0q2qRddqtIYGcGiU3qpbyNoao15bHdFhd1hAxvh6puhZZbk7I3L0lPzsvIz0rLxHAtXGik4PS653mlz4Yn2CVfpe1gow1bCUlAEmA/BQASapRIUc2BnO0tv5H9D2WdwRUAoA", "custom_attributes": [ "abi_private" ], "debug_symbols": "tb3dziS7cSz6Lut6XRQzk0nSr2IcGLK39oYAQTJkewMHht/9NFlkZMw352NzunvdqGOWZiJYJDOKxeTPf//2v/78r//1f/7lL3/733//j9/+6Z//+7d//cdf/vrXv/yff/nr3//tT//5l7//7fFf//u3q/9Pst/+qdX/+f23NP6kjz+Vx5+k/0ke/5+0xx/y/PX5W+Zvnb/t/tVr/qb5+2DR6/H7YNX0+H3wqTx+H/9e9fH7+Pdqj992/9o1f9P8lfmr89fmb/93+fHb7t98zd80f2X+6vy1+9d7+cqjIJ4WkAV0AVsgL+ALlAXqAm2CspjLYi7jLz8etg6Jx9PWIfEofrUF8gK+wPhXj6LWukCboF0LpAVkgcHsDzCYywMM5voAg/nRFq0sUCdIVyeqV0cCpEAGlIEcqABVoF7U+nj2lHpZq3Q0NLSjoWEdKZABZSAHKkAVqC0kF1ACgoZAQ6Ah0BBoCDQEGgINhYZCQ6Gh0FBoKDQUGgoNHRq5o7aQjX/rHY3/t3SEEmSUIKMEGSXIKEFGCTJKkFGCjBJkPGWGhkPDoeHQcGg4NBwaDg2HhkPDoVGgUaBRoFGgUWzVS8kL1WvV0IicUUMVJagoQUUJKkpQUYKGEjSUoKEEDSVoeMoGjQaNBo0GjbY05LqAEpAAKZABZSAHKkAVaPUXuWNroDzrRe6oeNSLICoEUSGICkFUCKJCEBWCqBBEhSAqBFEhiApBVAiiQhAVgqgQRIUgKgRRIQoNhYZBw6Bh0DBddWAG1FZt3FHRawNRIYgKQVQIokIQFYKoEESFICoEUSGICkFUCKJCEBWCqBBEhSAqBFEhiApBVAiiQgo0CjSKrycfr5qBxrtm1MEdFb0OEBWCqBBEhSAqBFEhiApBVAiiQhAVgqgQRIUgKgRRoYgKRVQookIRFYqoUESFIioUUaHXclFFVGhaLqppuajiXaGICkVUKKJCERWKqFBEhSIqFFGhiApFVCiiQhEViqhQRIUiKhRRoYgKRVQookLxrlC7gFbsq63YV7wrFO8KxbtC8a5QRIUiKhRRoYgKRVQookIRFYqoUESFIioUUaGICkVUKKJCERXqeMqCpyx4yoKnrChBRQkqSlBRgooS4F2heFcookIRFYqoUESFIioUUaGICkVUKKJCERWKqNCGHtvWU9q1eqxdq8fatUpg6QJKQAKkQAaUgRyoAFUgaCAqDFFhiApDVBiiwhAVJst9TJb7mC73MV3uY+jPhv5scHmDyxtc3uDyZiiBoQSGEhie0qBh0MAIyhAVhqgwRIXl9SaxbEDrTWK+3iSG/mzoz4b+bOjPhv5scHmDyxtc3uDyBpc3uLzB5a1Ao0CjQKOgN9ULaMWM1RUzhv5s6M+G/mzoz4b+bOjPhv5s6M8Glze4fIbLZ7h8hstnuHy+Vj3na43wclojvJzWCC+jP2f054z+nNGfM/pzRn/O6M8Z/TmjP2f054z+nOHyGS6fZUVtllXPWVfUZl1Rm9GfM/pzRn/O6M8Z/TmjP2f054z+nNGfM/pzRn/O6M/57s+9VHd/Hqis8t3+3MsHf87w54z+nNGfM/pzRn/O6M8Z/TmjP2f054z+nMuKqIyxfC4ronJdEZXhzxn+nOHPGf6c4c8Z/pzRnzP6c0Z/zujPuaEEbfU1v1Zf82v1Ncd4wzHecIw3HKNwhz87/Nnhzw5/dvizp1UCTyiBoASCEqAnOnqioyc6xhuO8YZjvOEYbzjGG66rFVxRAl2t4LZawdETHT3R0RMdPdHREx090dETHT3R0RMdPdHREx090dETHT3R0RMdPdHRE91XNDpGCl5WNHpZ0egF5cNIwTFScIwUHCMFr6ihijZqaKOGNoInOjzR4YkOT3S848t1AS1XLtdy5YI+VNCHCvpQSasFC/pQSasFi6wWLHCzgj5U8HYueDsXvJ0L3s4Fb+eCmYmC0WbBzETBzEQx/L8Zz3aPIv0xa6hrDlH6HKKtP1mfHbL5+/jL1ueIHoWwPkNU+u/jb+f1t7Xc/6/W+/8dv3X+tvu3h9D4TfNX5q/evyM4ehl8zGM+/pbp/bfGr85fm795/vr87WUq9/zm+H2o2mS1Ob+Z0z2/OX51/tr8zfPX52+Zv3X+tvu3vy7G7+SzyWeTzyafTT6bfDb5bPL1Rsl6z4OO3zR/Zf7q/LX5m+evz9/ONxx2/na+ds+Xjt80f2X+6vy1+Zvnr9+/4xXQO8ZshDKatvfxxx/q+MNDwfPdjm53O45fmb86f23+5vnr87fM3zp/2/2rk08nn04+nXw6+XTy6eTTyaeTTyefTT6bfDb5bPLZ5LPJZ5PPJp9NPpt8efLlyZcnX558efLlyZcnX558efLlyeeTzyefTz6ffD75fPL55PPJ55PPJ1+ZfGXylclXJl+ZfGXylclXJl+ZfGXy1clXJ1+dfHXy1clXJ1+dfHXy1clXJ1+bfG3ytcnXJl+bfG3ytcnXJl+bfG3ypetaIC0gC+gCtkBewBcoC9QFFnNazGkxp8WcFnNazGkxp8WcFnNazGkxr6BJK2rSCpu04iatwEkrctIKnbRiJ63gSSt60gqftOInrQBKK4LSCqG0YiitIEoritIKo7TiKK1ASiuS0gilMdmtC9gCeQFfoCxQF2gTjJAqc4L8Bos5L+a8mPNizos5L+a8mPNi9sXsi9kXsy/mEWDd49pKprn2ZNqdW+t//ep/TMsBm/U/juzaqJLp/p76fx6vz1HjdVpWnZZVp2XVaVl1WladllWnZdVpWXXS1mlZdVpWnZZVp2XVaVl1WladllWnZdVpWXVaVp2WVadl1WlZdVpWnZZVp2XVaVl1WladllVvyyrXbVnjV+evzd88f33+lvlb52+7f7tljd/JVyZfmXxl8pXJVyZfmXxl8pXJVydfnXx18tXJVydft6yR3/P5W+Zvnb/t/u2WNX7T/JX5q/PX5u/ka5OvTb42+drkG5Z1g7SALKAL2AJ5AV+gLNCJ87SsAXqv7dnDYVk3kAV0AVsgL+ALlAXqAm0CWcyymGUxy2KWxSyLWRazLGZZzLKYdTHrYu4BNPKRPYJu8PhXIy/ZY2KkJXtQ3EAXsAXyAr5AWaAu0CbowXGDxZwXc17MeTHnxZwXc17MeTHnxeyL2RezL2ZfzL6YfTH7Yu5RMdKuPQz6CH9k1m6QF/AFygJ1gTZBj4YbpAVkgcVcF3NdzHUx18VcF3NdzG0xt8XcFnNbzG0xt8XcFnNbzG0xt8k8snA3SAvIArqALZAX8AXKAnWBxZwWc1rMaTGnxZwWc1rMaTGnxZwWc1rMsphlMctilsUsi1kWsyxmWcyymGUx62LWxayLWRezLmZdzLqYdTHrYtbFbIvZFrMtZlvMtphtMdtitsVsi3mE1cjgXQukBWQBXcAWyAv4AmWBusBi9sXsi9kXsy9mX8y+mH0x+2IekdI/OEekdDAiZYC0gCygC9gCeQFfoCywmOtibou5Lea2mNtibou5Lea2mNtibot5REqbmbkbpAVkAV3AFsgL+AJlgbrAYk6LOS3mtJjTYk6LOS3mtJjTYk6LOS1mWcyymGUxy2KWxSyLWRazLGZZzLKYdTHrYtbFrItZF7MuZl3Muph1MetitsVsi9kWsy1mW8y2mG0x22K2xWyLOS/mvJjzYs6LOS/mvJjzYs6LOS/mHhftmlm9G+g9PBg5vRvkBXyBskBdoJfwmtm8NhZ9pQVkgb7arK8D6++mG+QFfIGyQF2gTdAj7gZpAVlgMdfFXBdzXcx1MdfFXBdzW8xtMbfF3BZzW8xtMbfF3BZzW8xtMtt1LZAWkAV0AVsgL+ALlAXqAos5Lea0mNNiTos5Lea0mNNiTos5Lea0mGUxy2KWxSyLWRazLGYZzP2zxvBp1Od/0pjo673rMW69h/03sAXyAr5AWaAu0CbovesGaYHFXBZzWcxlMZfBnO+PgBvUBdoE9VogLSAL6AK2wPhXfo/ux39p6++09XdaXmCpt6Xelnpb6mMEPxjHgH3+twqEv5cuoAQkQApkQKusYwx+/zfB3xP8PclADoSyCMoiKIuizIq/p/h7ir9nKLOhzIayGMpiKIuhzBl/L+PvZfy9jDJnlDmjLBllySiLo8x3L+uTzHc3G6gtdHe0gRKQAClQ50vXHGdP5EAFqAK1hUaXu1ECEiAFgkaFRoVGhUaFRoVGg0aDxui0SebIeyIDykAOVIAqUJtoDMAfXW+OwCcSIAUaGnmOwh8fknMY/viSnOPwx6fkHIhP1BYa/V50jsUnEiAFMqAM5EAFqGvIGpPfSC6goVHmsPzR+ee4PI3lzyNm+kLnMTKfyIEKUAVqC/VBx0QJaPy9MsfaNxoxc6MEJEAKZEAZyIEK0NCoc9R962aUJaMsI95upED9X/QkzhhOT5SABEiBDCgD9VLdaZcCVIHaQiPybpSABEiBDCgDQaNAo0CjQKNCo0KjQqNCo0KjQqNCo0KjQqNCo0GjQaNBo0GjQaNBo0GjQaNBoy2NMaCfKAEJkAIZUAZyoAJUgaCRoJGgkaCRoJGgkaCRoJGgkaCRoCHQEGgINAQaAg2BhkBDoCHQEGgoNBQaCg2FhkJDoaHQUGgoNBQaBg2DhkHDoGHQMGgYNAwaBg2DRoZGhkaGRoZGhkaGRoZGhkaGRoaGQ8Oh4dBwaDg0HBqIc0WcK+JcEeeKOFfEuSLOFXGuiHNFnCviXBHnijhXxLkizhVxrohzRZwr4lwR54o4V8S5Is4Vca6Ic0WcK+JcEeeKOFfEuSLOFXGuiHNFnBvi3BDnhjg3xLkhzg1xbohzQ5wb4twQ54Y4N8S5Ic4NcW6Ic0OcG+LcEOeGODfEuSHODXFuiHO749zn58VEGciBClAFagvdcT7Q0BjLEgVIgQwoAzlQWeiO3/b7vUBxIgPKQA5UgCpQW+iO34ESEDQyNEb83ssBMpADFaAK1BYa8XujBNQ1svx+L3OcyIAy0NAYmaICVIHaQiN+b5SABEiBDCgDQaNAo0CjQKNCY8SvXx0JkAIZUAZyoALUNUYSbsTvQCN+vT/5iN/7vwmQAhlQBnKgoWG/34slJ2oTjcWSEyUgAVKgobEWS07UNfqGsjzi90YVqC004vdGCUiAFMiAMhA0EjQSNBI0BBojfkueSy4nUiADykAOVICGhs8llzca8duTGnnE740ESIEMKAM5UAGqQG0hg4ZBw6Bh0BhxPpYWjji/kQMVoArUFhpxfqOhsRZuTjQ0Rh7VgDKQAxWgCtQWGnF+o67R0lz+OZECGVAGcqACVIG6Rp+1G8s/J0pAAqRABpSBHKgAVSBoVGhUaIyY7lNLY3Ho3esq+mRFn2zokw39vqHfN/T7hn7f0O8b+n2DRoNGWxpjEelEq9/7JUAKZEAZyIEK0Or3fq1+P5aYjl43lphOJEAKZEAZyIEKUAVa/X4sRZ0IGgINgYasfj8Wqk7kQAWoAq1+73oBrX7vKkCr37saUAZyoAJUgVa/d7uAVr93EyAFMqAM5EAFqAKtPjmWu06UgARIgQwoAzlQAapA0HBoODR89Xu/4zLPxbATtYXuuByLYROQACmQAWUgBypAFagtVKFRoVGhMd6/rcwltRNlIAcqQBWoLTTi90YJSICg0aDRoDFitdU+L5xmvZQRlzdSoFUHY2HuRA5UgCrQqoOxbHeiBCRACgSNBI0EjbTqoKQKtOqgyAWUgARIgQwoAzkQNAQaAo0Rg6OuRry1NpcGT1SAKlBbaMTbjRKQACnQo3yP6cCOMpADFaAK1BYaC4xvlIAEqK8xvSf1DSgDOVABqkBtobGd7UYJSICg4dBwaIwF6Zf2JML4t9aRACmQAWUgBypAFagtNJaw3wgaFRoVGhUaFRoVGhUaFRoVGg0aDRoNGg0aDRoNGg0aDRoNGm1p1OsCSkACpEAGlIEcqABVIGgkaCRoJGgkaCRoJGgkaCRoJGgkaAg0BBoCDYGGQEOgIdAQaAg0BBoKDYWGQkOhodBQaCg0FBoKDYWGQcOgYdAwaBg0DBoGDYOGQcOgkaGRoZGhkaGRoZGhkaGRoZGhkaHh0HBoODQcGg4Nh4ZDw6Hh0HBoFGggzivivCLOK+K8Is4r4rwizivivCLOK+K8Is4r4rwizusd5z3heMf5QA5UgCpQW+iO84ESkAANjdKRAWUgBypAFahN1O44HygBCZACGVAGcqACVIGgkaCRoJGgkaCRoJGgkaCRoJGgkaAh0BBoCDQEGgINgYZAQ6Ah0BBoKDQUGnec93Nb7jgfyIAykAMVoArUFrrjfKCukVJHAqRABpSBHKgAVaC20IjzG0EjQyNDY8R5so4ykAMVoArUFhpxfqMEJEAKBA2HhkNjxHQaiffx33q+fsRWzze2ERWpn5Az+ngaR+SMjnrDlAJWwNHuNxyNN2EDvKvxhv2/yn2kzhUwBZSAGtAC5oAesASsAUPNQ81DzUPNQ81DzUPNQ81DzUPNQ62EWgm1YZmSBtSAFjAH9IAlYA3YAId1TpgChloNtRpqNdRqqNVQq6FWQ62FWgu1Fmot1FqotVBrodZCrYVag9pY6r1gCigBNaAFzAGhdh/KJDLg+Gc6oAXMAT1gCVgDjkJah8MrJ0wBJaAGtIChJqEmoSahNkzzhsM1Jww1DTUNNQ21YZ0TesBQ01DTULNQGwY6oQQMNQs1CzULtWGjE9aAUZM51HKo5VDL0W452i1HTeZQy6GWQy2Hmke7edSkR016qHmoeah5tJtHTXrUpIdaCbUSaiXUStRkiZq8w98HHLxtwM6rQ2KE/4QpoATUgBYwB/SAJWANGGot1FqojfDXe22VBrSAOaAHLAFrwKE2lmeN8J9wqN1bKSSgBhxqdcCh1gb0gCVgDdjVxr7c+2CpCVNACagBLWAO6IDDFMY+3/sgqrHV9z6Jqqf20n0U1YQWMAf0gCVgL7rZgKPo9+q1K6BCeIT/LazBq8GrwTvCf8IGOMJ/wgThEf632gj/CR3CI9BvYQteC94cvCPQJ4zayVE7I9Bv4RHot9oI9AkbhEdI38IevB68Hrwete5ROx61M0L6Fh4hfat51PoI3lt4BO8tXIK3BG8J3hK1XqJ2StTOCOlbeIT0rVaj1kfw3sIjeG/hGrw1eGvwtqj1FrXTonZG8N7CI3hvtRa1PsL0Fh5hOoTv860Gw33A1YQSUANawBzQl/B9zNVQu8+5uuEdkGlAgXAK3hS8KXiTBywBa8AGYUEM3YdkTWgQjtjUiE2N2NSITY3Y1IjN+xAsG+tD79i8YQ44eMcmrjs2b1gDNsA7NuuAKaAE1IAWMAf0gAXwDsg2oATUgJ0sj31lIyAn9IAlYC96HtU3wvSGI0wnTAEloAa0gDngIBudYLxYJ0wBB9lolhGbE1rAHNADloA1YAMcb9M82ni8TSfMAQfZvfK3BKwBG+AIyAlTQAmoAQfZ6CUjCidsC44lMZLLgCmgBNSAFjAH9IBDrQ441NqADXC8LCdMASWgBuxqPs7AGLE5oQcsAWvABjhic8IU0PHwUgLWgA0PpFE7GrWjUTsataNROxq1M2LzrpIRm/ezadSORu1Y1I5F7VjUzojN+yksaseidixqx6J2LGrHonZy1M4ISB9bPUdA+titOQJywhqwAY6AdB0wBZSAGtAC5oBDzQYsAWvABjgidsIUUAIOtbHufUTshDngUBttPCJ2whqwAY636dw7nwJKQA1oAXNAD1gAR/DeVT2C967JEbwTakALGHU2hsITloA1YFvwPl1sQtTZfb7YhBrQAuaAHrAErKtSx8qZCUd0T5hWTY7FMwtqQAuIOrvPLJuwBKwBG6BcAVNACTh464AesAQcvG3ABjhifsIUcGxaGHuNR+59QguYA3rAErAGbIB3SI/i3CF9wyj6HdKjDHdI3zCKblH0fIE3p4BR9BxFz1H0HEXPUfQcRb+jexTnju4bRtHv6B5luKP7hlF0j6J71INHPZQoeomilyh6iaKXKHqJot/BO4pzB+8No+h38I4y3MF7wyh6jaLXqIca9VCj6DWK3qLoLYreougtit6i990Re0MU/T5nbZTBrxRQAmpA1MO9TmZCD1gC1oAo+r1YZsIUEL3PkwcsAdH7PKH33Qe0TRhFF9TDvTBmwii6RNElii5RdImiSxS9x8UYQI/1JxNVoLZQj4mJEpDcJ1Slsf5kIrtPq0pj/ckYs471J2PkONafTFSB2kLjxKcbJSABUiADykDQcGg4NBwaBRoFGgUaBRo9OMagc6xTmciBClAFagv1uJkoAcl9ulUa61QmsvvEqjTWqUzkQAWoArWFerRMlCa6D3wrA42VSwMVoArUFrpXeQ2UgARIgUYWqKN7ZnWgMf0zkAFloPF5M9AYrw1UgdpC99BwoAQkQApkQBnIgaCh0FBoGDQMGgYNg4ZBw6Bh0DBoGDQMGhkaGRoZGhkaGRoZGhkaGRoZGhkaDg2HhkPDoeHQcGg4NBwaDg2HRoFGgUaBRoFGgUaBRoFGgUaBRoFGhUaFRoVGhUaFRoVGhUaFRoVGhUaDRoNGg0aDRoNGg0aDRoNGg0ZbGve6khslIAFSIAPKQA5UgCoQNBI0EjQSNBI0EjQSNBI0EjQSNBI0BBoCDYGGQEOgIdAQaCDOK+K8Is4r4rwizivivCLOK+K8Is4r4rwizivivCLOK+K8Is4r4rwizivivCLOK+K8Is4r4rwizivivCLOK+K8Is4r4rwizivivCLOK+K8Is4r4rwizivivCLOK+K8Is4r4rwizivivCLOK+K8Is4r4rwizivivCLOK+K8Is4r4vxeOTLuy7iHhwMZUAZyoAJUgdpC96feQAkIGg0aDRoNGg0aDRoNGm1p3CtHbpSABEiBDCgDOVABqkDQSNBI0EjQSNBI0EjQSNBI0EjQSNAQaAg0BBoCDYGGQEOgIdAQaAg0FBoKDYWGQkOhodBQaCg0FBoKDYOGQcOgYdAwaBg0DBoGDYOGQSNDI0MjQyNDI0MjQyNDI0MjQyNDw6Hh0HBoODQcGg4Nh4ZDw6Hh0CjQKNAo0CjQKNAo0CjQKNAo0CjQqNCo0ECcN8R5Q5w3xHlDnDfEeUOcN8R5Q5w3xHlDnDfEeUOcN8R5Q5w3xHlDnLcV54+U5gWUgARIgQwoAzlQWajHqt4oAznQQ1fH6QPXAmkBWUAXsAX6t8AAD6LBMw6gG+DxSOMggnFq0DjN4FogLSAL6AK2QJ7g3kQ4kAIZUAZyoAJUgdpCY8IkDdQ/I0bpx3TJjRTIgDKQLzQ2CI3nHJsObpQXGl1mHMLQ26ENVIAqUJvoXr5yowQkQApk9z1xMlau9JviZCxc6XfFyTjrpOfZZaxg6fe/yTjrZCIBUiADykAO1O7b4GSsXJkoAQmQAhlQXmh4axlFHeY6oQcsAWvABjgcdsIUUAJqwFCzUBuuWUYlDTsso5aGH5bxqMMQJ2yA9zV4NxwM44Huq/BuqAEtYA7oAYeaDzjUyoBDbZzTcV+NN9r5vhzvhhKw89bR/PdtFzcsAWvABnif7n7DFFAC9qeoo6LuE95HRd1HvI+Kwm0DEleHSdwdJnF5mMTtYRLXh0ncHyZxgZjEDWISV4hJ3CEmcYmYxC1iQteI0T1idJEY3SRGV4nRXWJ0mRjdJkbXidF9YnKFWgq1FGr3SfR5QA04GHpzz2vFyoBRHLpYjG4Wo6vF6G4xulwsbhej68XofjG6YIxuGKMrxuiOMbpkjG4Zo2vG6J4xumiMbhqjq8bEQs1CzULNQs1C7T4yf9QZzsyXeSHZqL77dqVRfXHpGN06RteO0b1jdPEY3TxGV4/R3WN0+RjdPkbXj9H9Y3QBGd1ARleQ0R1kdAmZlFAroVZCrYRaDbUaajXUavQz3Mkg87KyUWd3kI06iyCjG8noSjK6k4wuJYtbySSuJZO4l0ziYjKJm8kkriaTuJtM4nIyidvJRCPINIJMI8g0gkxTqKVQS6GWQi2F2n0PTh4Q/WzeY+YDllVRcVeZKF3hR3f40SV+fItfFIfu8aOL/OgmP7rKj+7yiyDTCDKNINMIMo0g0wgyjSDTCDKNIFMLNQs13EwhiotJZN5wNmrnDrJROxFkcY2ZxD1mEheZSdxkJnGVmcRdZhKXmYlGkGkEmUaQaQSZRpBpBJlGkGkEmUaQaQSZRpDF9WgS96PJvCBt1EME2bz6bFRJg5nH9WYS95tJXHAmccOZxBVnohFkGkFmEWQWQWYRZBZBZhFkFkFmEWQWQWYRZHFpmsStaRLXpkncmyYWbzLDrSpiuFZFDPeqSFx7JnHvmVi8ySzeZBZBZhFkFkFmEWQWQWYRZBZBZhFkFkEWN6lJXKUmRjdm0pWZdGcmXZrJt2bGw8e9mRYXZ1rcnGlxdabF3ZkWl2da3J5p8SazeJNZBJlFkFkEWdyuJnG9msT9ahIXrEncsCZxxZrEHWsSl6zJvGVtPGaJhy/o9vcyiPuJaxSnRnFqFCeGixbDRYvhosVwMS5ck7hxTeLKNYk71yQuXZO4dU3i2jWJe9ckLl6TuHlNMq4Zknn32g1hePN+tTIgipMjLnK8fHK8fOIKNok72CQuYZO4hU3iGjaJe9gkLmKTuIlN4io2ibvYJC5jk7iNTTIuMJK4j02y4lWXFa+6HHERd7JJXMomcSubxLVsEveySVzMJnEzm8TVbBJ3s0lcziZxO5vE9WySc6jlUMONg5Jx5aBk3DkoGZcOStzSJnFNm8Q9bRIXtUnc1CZxVZvEXW0Sl7VJ3NYmOV4+OV4+OV4+OV4+OV4+uURb4BJCmXe6jaeoGN7GvW0SF7dJ3NwmcXWbxN1tkiMucsRFjrjIERc54iJHXHi8fDxePvcShFHeewnChDCFeY9bGRDF8YgLj7jwiAuPuPCIC4+48IgLj7jwiAuPuPCIi3k13Cgk7vWSeenbKO/9vhjljfeFx/vCIy484sIjLjziwiMuPOIiromTuCdO4qI4mTfFjZLFl49nhOm8Dm4UMt4XTtct033LdOEy3bhMVy7Tnct86XIUh65d9igOLo6TuDlO4uo4ibvjJC6Pk7g9TuL6OIn748TjfeHxvvB4X3i8L7xGcWoUp0VxWhQnunKJrlyiK5cYR5UYR5UYR5UYR5UYR5ULjVVwl7LMC+d8QDRWia5coiuX6MolunKJrlyiK8cFdVKiK8cVdVKiK5foyiW6clxTJyW6comuXKIrl+jK9wKDWyKGPvMuu6GWEeglR3lj6FNi6FNi6FNi6HOvEbh5M1rzzv7fEo7WLHTtN937TRd/083fMVopuEVTCq7RlIJ7NKVE7yvR+0r0vjtNfzNE77sT8DdZi+YOIy3R+2oMMGoMMGoMMGoMMGoMMGpMIdUYeNeYQqoxhXTnuOcl5hbwfuJ+bLivU8Tb+GPBH3P/Yx1XJ/VJ69/HTUnpfx7/9a9//7c//edf/v63f/nPf/z5z/0vrP/wH7/90z//92///qd//Plv//nbP/3tv/76199/+79/+ut/jb/0H//+p7+N3//80z8e/+9jLvHPf/tfj98H4f/+y1//3NH//B7/+vr+n+Z+ov74xz7uwbv/+WN275TA+iztIHgMOYMg+SlB/3ask6J/PDpIUtZfIGlB8sjxf0tiG5JxVMrN8ZiHjIdpr1EkeZ+ivEYhBgrV9ym+L0XbUVhQ5KhOkx8Y0rZZ+86K1arXt6XoaaXvOB6ulyZHeYyQomP82EP7qeDfUTxmhBbFAzbqWz9S6IbiQqs+5u/sW4pdZZihMsy+b5JtfbaENnlMqHwfa/3gge9Y2rVC7ZHw/65Zd6XI0cMzBcljeuCcoiRQtPotRdr0T6vpgnVJeqkYXuE6Rb4vhmz6Zx6Hyg+OR2XIixxXA0dNr3GUtrpXrslf4niM3Vf38scn9IvNgt7xmLm4XmmWvkNu1UffDCffBf2G4zFviJhv9ftH6efsf9s9mqKXNssvcmQHh6dXOaIcLh/gKK80y2M6bVE85tDkNYqevL0pSsovUVzoG4/p3NfCfmwknG+2Ghb46P2nFC1leGj67m2w+/cZHlzaC/++4vVerX7373UTpu6rW3rJrxAUhHlJ12sEsggkv1AFj8TV6kuPxBUxXHpOITko/FsKsx0HurQKden0Y1/q7/5v/a74qsu+4vm7ujB/szl3BEfNuSd4tzlrjnq8vm2LvPMGMwwJHv7yXVvsKURAQe+NrxSb4aaNg7Zuisfo5m0Kcvx0bFA6zkeZ1Wn2fXVu+mXz5fet+rfj1exvD957IL85eM/17cH7/o2Bt6e0TN/Jx17Td0SsIG/WiOJ84K3o3j0D+gqFGvrVRZ+3V/mFwT+GEfSJ/fjcZgK3Xa9ar650kV9+pTgqg17fE/imX/Zlr+sxLjKb84+gvqt8WW7H5No1nZNoySBxvb4l8d2IW/CV/chXyrfdYstRMKB5zAiVbzlK2nVPKeiexOHnpaha8e1Ag+WfSqG7gS6+g/RK+k0pyu6NXmNUUMk6f+U5YoxaPX//HLuvdANHM5rBsXT9AkcDR3b9nqN+gGNTH33n++rmmQzYVH+hh3r00Ha91MsfeazVvx7Jq9ci5ZHUWq+CR1JLXjHhHuolwp7m1n7JO34g4QHwF5Ka3zbCfYVkRYVsKrWWPzLkHlnFKIWWF60jlXi55ZcCH37+mPz4PvDbbhImpuQfX9npm1JsGbIKGPJ3tXn9IQmJmvAyqnLlV8LDGygeSUl9jQJfMzzUkvMQzRiA90MLiOJ4BC4YHwiX4cscQ9v1pqx4jThN6SVLX2add09ylRioXOWH2YYvc8bXpk/14yAXS6JPK2nXL5BcTUCSdEOyidI8Vv3fE529Nr9LCFybV7wXufC9bP49x7ZGwn+Tts3DbFunIvHVT3bdzOhfG//sGx8i6fT9RMaeRPBAfY33hqS9/Qn+hOPoGzzt0kaHH+HnHN9/he8r1YqGDaTvKzXZbkIcldrnxr9/mC0HJqKT0gTwr3FozMt7fbFCMI7r6+Je7Ko5ZtVz3dVqe3d6I8n1geRkej87KfKB9OS2Tg1DQeecy08Ns/Ozx99GV+3HcH/vZ7IblsY4KvE4Sv3Lm082Xz+Pv7xs5AHLB0hoNPYGib9KAntWTr/8THJasW3zOJreXxmgmx77mK1ZVdJ3bG4KshuwF3S2B7QNib0fw5o/sMLA34/hba1GMvoB6/cVch7DjyD+PoZ3+Z1+XA6yGvnbhQbJtkWRFsNOpc/tn4qypxndaNFo3dBsarcfpYzSSN4N1mxv1iUamjMd5QvJ7lVMFaOavs1hpl3i6RGEiJ9EJfmZ5PpIrexHwpGx72dLp03l1g/0ut2UF2a8+jUb1D5fOLZ5pMPx5zHHbvy5bR3XaJ1ybV7IWbejR7Bkbpuf6mQ3868XsuZKIwxtX0l2SanLVii3q10bkp3XgkMrueTXkU7ef3KF1VZ7kUQ0Fgv6riS7z6VU8Mkl7NblFwqSBYO/TNNnv/Y02WJVF00V/xIJLXFTzpP9ROL6x1bJDyuIyqYg2/B75CDwfa9X/X5ha9rlq7LCqLPlHcnmgexCj30MVzZvdd/6q8UAMun3RrCbJj02gnJ9wAhKetsIym7M5ZH2eiQYXiM57vW7xNVpr98X5LDXb3tasuhpbfMmL+UDPW2bvTruae0DPa1eb/e0mj7Q03Ykxz2tfsBf9wX5RE8TjYLYxtOqvz+jvMtgnc4o7x+mYrynl20epr3/MO36gx9GMUnwgPnFV5YWzARrsRdfnoaFgo9s2MaN2s5bW8xrN9dXSZD/eMAXSfKF2fEHfJkEn0kPKC9+smmSmJdOUl+mQSv3q2OuV2kkvkOVR9NfaWSX1jFUjNFM+/ULBBHEZPS/QJAxRceZx18g8Ej/VvmGYF+VdnksbkqSN1Xp7z6I/6EPkmP4bbnu+kTbvbsxWalZ+C3z4/tO9vt/sO+mnyjyLcmTB3Ksc+iXf2xaZrcj6uHIyCxrbZsH2s6+YuFH39L66gO1FF2t7V4U1z5f35wmKF61ohxr6fpFF/oijRt6bj99v21aaTN4rZgcqDTa6zsWjilair1e5VuKJw+Tw54911dbyGkBrNervUhTDDMV/Vj38jLNZUGTXqXxqjkeqn7fX2SXlZF0RTJE7dtPnT3JhV0E/cDIDclmwNUEJE1q+vZTR3Z7jXIN36fskP5KOQ6/28bw/93vNtG3ZwhEPzBDsCU5/W4TfX+G4ElBPjEv5k3CVJq96tc/0uSXvSn2xPa7Nl4uTW2FaF61fSxSrfTm+CXbr/gGrNRpf5FCQNHepmivliLqYkPx5J2uGkMDLenVoYFGV3tQyss00dUeNK+OMHLC6pV+6df1Mo3FOsc+cHuVJvKrD5pX48dajbq5kr1M41cMKXdj5O1nGBYDZ/oA+pUPwRabuu27r5f9R3rM+l+tvvql73iOq5QXSZLGJneTV0kwW/AgeXXiImEpTd4nMXbTShbTSlbqB0iqvEgS64wtS3q1JPj2efDZqyXBFjfL/up8XWQAH/DV1skYUz9Idl6yXZ1bYuFI5ZNcfmW9cgojeYycviXZmVHs/+83O8Ro+Ove/bJN4luNpRHfzsdui4GDgvqFC98WYzd/ccX8xUWfb79EEQPhS+uLFDko2tsU9mopsALuyvoaRY66oPUDr5aivnSawmNohM8bLfoaBdbPPaC/S2HXS2eG/LgC76UOrhkrZR7wterMHhTlepECD5LrSwd1qONFq24vtUgVWaWowntG5MfViFJ3awU0hnOmr22iUYxehJv1p3K07e5tbD/8YZVNS1840gcmJJp8YEKi6dsTErtBlF6JViDmF0nGIPwmSbtZjebvT0hsC+JYbaCe7cWn8fAPl+/XLm0n+GNZtPFw/Utf1f0ySMEpOw9MGzXKL7GYxrYiozRwOT7zINMHULa2eZztuWmObcwPTMFXfoklDg3Qvjr5hcexijlWqzRwyPKlHJveWrG1/DEcpA+YL6dA6G6bRUrxjkg/7C38qSQ7az3cIKHbtNbhBolzks0GiV8g8VdJzjZI6DapdXi43ROSs+PtNOVdh337fLscuZJHBPu3PS1t++vpjh5Nn+iw6RMtvNuzdXron37i1D/9xJF9+okz+/Z1ctphZdthz07+e9LrT0n0E028y2IdHsq4JTlunWOz32za0g9s2tJPbNrST2za0g9s2tIPbNrS/aYti+FNzq9xJEzzPoI0vcYh8cknuinH7sBfx5eF+OZZbD/dhURAK9dLHBIL3Po9ld9zyM5acRoInyXnv1KKONb6at+3ym6T1gdKkWp8ul7+Wn2OpbzvcuA7TX74TvsVDkW89Ru0vufYbSrUGIIbLwr/FQ6LHVFmn+AoL3Jgxr0f4PMqR6S6anr/WV7lyBelI6/3OfRVDgsO/3YTre6OCzyM2m0pEHGPDML3LevXu6XY+nmJGWY+MeunUsj78bblOIy3c47yIsdZvD3hOIq342d5leMw3o459FWOs3gr6d2evi/FWbztDv86jLftGAxp2MdI/Pt2LbtFfB7nsflm1FH8/THYjuN0DFbe9tF9Kc7GYPX6Q0txOAZ7wqHvc5yNwbYch2Ow7ZmBh++ELcfhO+Gco7zIcfZOeMJx9E44fpZXOQ7fCccc+irH2Tuhvf3ltC/F2Tuh+dvekd8fg7X6frxtOQ7j7ZyjvMhxFm9POI7i7fhZXuU4jLdjDn2V4yjebJeVOuvp+1IcxZvtMjiHY7APHID0Sym6b5OFtttjdXi07pOSeKGUIwX/TyWx7cDh6HTIPcnh6ZC2u3rq8HTIJxxHp0PaLht1eDrPOcf3p/PsK/XwdEjbZYAOT4d8wnF0OuQTjqPTIZ9UyNnpkHuSw9MhbXfc3tnpkLbbxHSYpLBdAukwSTESvW8mKfYcZ0mKPcdZksL2e6mOPpBtl4E6/EDechx+INsuAXX0untSiqMPZNPyh5bi7AP5GYe+z3H0gbznOPtANnt/0nTPcTZg/wWO8iLH0YD9GcfJgP38WV7lOBuwn3PoqxxnA/b87qTpk1KcDdizvu0d8vYHsuX3J6T2HIfxlt+fkHrCcRZv+f0JqfNneZXjMN7y+xNSTzjO4s3fnZB6UoqzePN3J6SejMGOkhS2OwPwcKGI7Y4APB2D7ThOx2BvJ5+elOJsDPZ28mlfisMx2BMOfZ/jbAy25Tgcg5X3J033HIfvhPL+pOkTjrN3Qnl/0vT8WV7lOHwnlPcnTZ9wnL0T6ttfTuUDk6a1ve0d9f0xWEvvx9uW4zDezjnKixxn8faE4yjejp/lVY7DeDvm0Fc5juItX++m8p+U4ije8vXu0tIn85NnN608SQ0USg1UugLgS2ogX9urp4+Oy99yHB6Xn6/y9oT8Ocf3E/LPajX66WNIVb6t1d1Rf9YwQM4Xn8H6ZdV/Th/YcZrTB3ac5vT2jtOcPrDjdE9yuOM0p/d3nO4Lcrjj9AkJzjZS91fr9XDb6p7k8GixvMv+fKReD48W2wbfIx5wAHL6IZX1Jfhk29UK+quk/K0fbe9aOvvEzftD/Y4+cbO8O0x9UoqjT9ws7Q8txdkn7jMOfZ/j6BN3z3H2iZvV3h5y7znOhty/wFFe5Dgacj/jOBlynz/LqxxnQ+5zDn2V42zIbe9OTD0pxdmQ295NlD55KVxx9hifx/v1pWAfGKTa+4PU7UEGONnqMS9g3w5QdzdLHR5kkHcZqH4SVdws5XTz908l2S8auWLlCR+r+BPLrpteOLb50dJ0VrJ+Jdl9lsUKB94C/eW4i7y9nOp0zL67nOp4zL69vehszL7bB3U8Zt+SnI7Zd3uhTseW24Kcjtn3JIfD7X1npY3ltBzvp87q2/v/aLEVbXEXtZeDr3x7QkTeJaVSGpc9TTsR2hf+KOMXmu0phjiyxszzhmQ7RY2DRB7DAV6laL9CEq+s/MNx3F9Idmf2+ZVxecHl369EzbvslJjEnQFGh8TJl9fW7kqnR/vgLKBE3xA/k2w6bYkThT1tKD5w/V8uH7j+L5e3r//Lu9upjs1xS3JqjuX96//2BTk1xz3JoTlue7xiAP5Dbvmnnra7nuq4p1X7QE+r+e2eVv0DPW1LctrTduf5nfa0/dMIrUX1F5/mtLvuSQ7n3/Ykh31+S3I6/9bsD26c0/m3/YsP+QCXzSFNuX3g/oe825JyHMGtvRvBvstbnUbwnuQwgn2XuzrsJPuCHAbfE5LTd8WupxkO8v3hkp2vPc0vf3um17dZo7OZ3i3H4Uyvv71/6kkpjmZ6PaU/tBRnM73POPR9jqOZ3j3H2Uyv73JWhzO9e46zmd5f4CgvchzN9D7jOJnpPX+WVznOZnrPOfRVjqOZXpd351iflOJoptffz1XtXwqYYHUjL/7ppbBLVh3uU3zCcbRP0XeH9h3OOJ9zfD/j/AuV+v2Zff4kE4DJJj5u9qeH2fXSFEdmitX3Ob7fL/lkiijmvh/zFZt5pv29HbiFka+V/Drj5btTnqxf9ob2Tfnbo559dzabeTH0VudFgL/GUjGf+BiQXd+y5Cc3kcT9H+372UTfJa40zlZ9DPd1Q/KBGSu3D8xYjWH1m18h9oEZqz3J6VeIvT9jtS/I6VeIfWLG6sn0N4rSp793M9dbGse7L/W7JL/vsrsk1qPi48DZ7BuS7aklmEWXwrcSlfqFZPNApSJDUSrdLGbp+oXH0YYBgcnucer7mQXP7f3MwhOSs8yCe3o/s+C7I9NOMwvu+n5mwXeZrLPMgvsH0q7uH0i7ur+ddnX/QNp1T3Lq0+X9tOu+IKc+7R9Iu+57/GFmwT+Rw/JP5LD8/RyWfyKH5Z/IYfkHclhPnuYss+CfSIQ9ITnLLPgnsml7ksPMgu9yWB9pnMPMwpMX31lmwXdJrOMI3u25Oo7gdr0dwbv9LMcRvCU5jeDdrVSnnWRbkNPg25OcvivSBzILrbyfWdieqnaYWdhxHGYWyttbr56U4iizUN7eerUvxWFm4QmHvs9xllnYcpxlFso2c3WWWdhznGUWfoGjvMhxlFl4xnGSWTh/llc5zjIL5xz6KsdRZqGkdw+teFKKo8xCSe+eRv3kpXCWWSi7m5YOMwtPOI4yC0Xk7czCOcf3mYVfqFTbVGp+O7NQduf9HWYWzjm+zyw8mSI6yyw8mfE6yyyMq5jeziyUbfopl7jHLhfX11hO8xNPWA7zE0+eaHwu4Ym+z7hsm+gwy1G2Vw4cZjmKfmCtVdEPrLUq+vZaq2IfWGu1Jzn8Iir2/lqrfUEOv4iekBx+Ee3zCphDf/j0prva9j4Hy/ERYO17L9hlbTIu93OljEDSXylILnEHPIffTwXZdNeqV1udreP6vRHski0Zb8DHOyNvki1bEgwrJPOr+AtJybLrKKgULbQTK+mXqt3tbnmEznqcxJfSp/ql3+cPTLOW/IFp1pLfnmYt+QPTrHuSU0vK70+zPnmas2nWPcmpr+UPTLM+ITkzxz3J4TRr8fwHN87pNOvWS/yK7C/tCfvJS3Ypm4JRbKMNppLkV7LQMc9Sr++NsZTthZTj9tw5g6b6rUeX3a6UDzl9jXN/Gp/l/dMD7fzVJb51+Dvl10hwK3vy9n1JnqxYKLTwoeTvVyyUXSKrFrzPa815Q7IbEySQZKF1Av3i3nMS0fh8o6N/fibZrcFu6CmPfEV+jeRhj0jxP97sL5I0bBQvV9bXSMqFCdOSeEzwlWS3H0skRidCH/k/jQmqfWB0sr0V6HR0stsmczw62R0eeDw6qfXt0UltHxidbElORyft/ROEnjzN4ehkS3I6OtmTHI5O9iSHo5MtyenoZJfM+kjjHI5O9l6iyIiJ1u+9pF7bGdSKMzR++Oaq+RdKEtd7iPOKsJ9KsluVIhe+iFXatzZQrw/sd63XB/a71uvt/a71+sB+1z3JoSHV6/39rvuCHHrJE5JTG9h114IZHCl8BM7X7ro7TzBrwzk6xvMMXwJn/zgVU59aKRX8i4+DFpYqefM4u60AFxIHDxvY9Pn0geFATR8YDtT09nCgpg8MB/Ykp9H3gQMF9wU5jb7U/uDoe1QJ2iaV8n133ea5BIt2Ey+AKl+rdfe5Jfh+rGLp24Tbs4LElWP0/vxSkP2XRYIfPdLH9u2XRd1eZ/CodNTrY+T/bUan7jJdx5/3+w/Zhl5fm32fdKu7+1Ae/QQ99ofTK798mdfdJUY/HIG562y77VomiozbYyrme6vflkQSTsLlyZefS+IfGCN9IstVP5Hlqu9nueonslz1E1mu+oEsV/1Elqt+Isu1766K6wezpc3HxS65lC+nswY3Y6Tt4xyOkfaPE4tNsrXd47QPjJF2Bw4eR9/uuLLj6Nsmuc6ib5fiOo6+rB+Ivvx+zmBfkNPo25OcRt/23Ye5Rv1hEvfru2+b47oM6yoec5ffThPW3YGDp5u9npCcbfaqu10rp5u96m6f1ulmr7o9cfBws1fdJbnONntV/8Tnln/ic8vf/9zyT3xu+Sc+t8oHPrf8E59b/oHPrX2PP9zsVcsHthXW8oFthbW8va2wlg9sK9yTnPa0+v62widPczbPvyc57a57krN5/ickh31+S3I4z1+r/8GNczjP/+TFd7bZq273aZ1G8G6f1nEEb7clnUVwkw9EcJMPRPAHzhrcF+Q0+PYkp++KXU873OxV29YZjzZ71fb+nZhbjsPNXu169wC3J6U42uzVLv1DS3G22esZh77PcbTZa89xttmrXe/fibnnONvs9Qsc5UWOo81ezzhONnudP8urHGebvc459FWOo81eLb17gNuTUhxt9mrp3YMwn7wUzjZ7tW0K62yz1xOOo81eTXabs882e51zfL/Z6xcq1TaVuj9m8GSzV9seM3i22euc4/vNXk+miM42e+1nvJKusDXepfV1xqvtTwk83OzVdjN4x5u99iynm72esBxu9nryRIebvZ40UYsBMxvBT0202wVbQSIXX93+ZTa/6QeOv2j6geMvmr19/EWzDxx/sSc5/CJq9v7xF/uCHH4RPSE5+yLakxwnn3aRc8Wpaxcv+v0ym99sd8aBxK1MD0yLsr8G8Uc2aj0pi17xPaG0evgry/bOHXOPgdr3WyPKk0lFbK9INML5utSg5e36xbONZ09IzjaetV0a63Rpd9vt1Dpd2t3yB1YJtPyBVQItv71KoPkHEvzN388L7Aty6tN7krMp3z3JqcfuSc6mfJ+QHBr1luRwyrd5/YNb+HDKd+8lhxvP2i6PdbbxbF+Ow41nbbvF6nTjWdudN3j+5to+0OHGs7Z755xuPHtCcrbxbL+h/fSaml+4++77izTbLpf16LKY6OQoTvXLl2TdfnvFJ8aPGwm+kuymwgUTYmqNSOzLt/VulepjhgFW8MPj/ESyWyhwxeKJi0c4zX6hJI4RzmPmZPc4+zOV42JC3otnX0uyu8CjIj0gVRulkr9w7Oa0pMV62R/q9WtB9msFNF6ANKC2/CLJDxfhfiHZJbNSiYnTkr+vkn02q0RBeOL0p6fZXowS8yc/rNf7Wq+7bNYPp13/MBn0CyR6YeD4aJy0IdkeNoB1Omomr5JcFiS7OvnEEPb9q7Meg9QPDNiesZwNtp6wHI62HizvTxU8K8rheGvbU7RgRG21fNtTHkXx3aQu5mM981fGl65yf5+9++H1YPlAt03X9YF+mz7Sb9NH+m36SL9Nn+i36RP9tm6XNeP7K1uTb8cGj6L49p0cCxql0Zvdv7Js+m2tWOz9gPUbjv3jlIREQuF06M+Ps0t5uWLE9MC0uvLLl0K65BNbYZ4MrrNhMkZ5Xih/DcTdAYMeB0x4ofRIaV9Jdh9iYgkDfTGvm4rZboeJRf1X9JX86uPQ1uWfH2c79bc6bZNvR17PGic+wh4N5ZvG2U2Hemx/LjTOyF977W7/VteP1DcNm66vRdEP7C54sHxge8GDRd5/eegHNhg8YTmc/nuw5A/Yvn5gj8EzlrN5t2csp+/ULcvxO9WuP7pyD9+pT8K5gEWa1O/D2fQTgWj2iUC0/H4gmn8iEM0/EYhWP9BXzD8RiPaB8wh2B8pL7CqzazM+yPKJT4/8kU6bP9Jp8wc6bf5IG+cPtPETlmOb/MC5hc+KcmaTuhvup4vOPLsK0TySuV8Ks1sJ9RhCYo40JZ4jvb6ybHdXlzj1jPd3fv2C2e3r8oKRbR+gbkh2JXFMkj4+PvQDJHQ0wS+SFBiLt5dJMHH8IJENya6NE85fS6nKq22cy+opD/hqzcY50fmHjJb/StcfC+Bn12/qm66/S4xJioGG8Mz+9Ussoli8IL5l2Q1uzxZoPiM5WqHZ7WL7eXmyRPMXSL5fo/mkZg0T82IcQD/V7C4xltQi45E3NbsnyZGi8/IqicbXrtdXKwUHA0jmZe+/1mkznkdy3Vbtbluir/h55EbIVX7i2F3OGWeXFU+bN0fd7kqMIYJxWvnrpMj2CMPLaFlHfpEkIW+pcqUXSeJQm0eOblOSXWpMHHPq4m1Tkl1u7HAj0J7kcCfQg8R2L46DhfTPynG0F+hB4n9sOc52Az0l0Q+QHO0HekJytiEopWs7FXi0I+gJydmWoF8hKa+SHG0KekpysivoFx7nZZKzfUG/QKIvkxztDHp8yrx7h9yzchztDXqUQ973kp3Lj1PY59x321Rqsg8E35bkNPjOScqrJIfB94TkLPiOH+dlktPgOybRl0kOg0/07eDbl+Mw+HYnBx4G336c1jC/pWnTvLvdW+KYafvhgJCfSd6/nXNPcjpOS/q+t8r7F3Q+yiF/bDkOx2nPSPQDJGfjtD3J6ThN37+m8wnJ6avinKS8SnL4qtD3r+r8hcd5meT0VXFMoi+THL4q7O1vrSflOHxVWH3fS8oHxmn5+kDwbUlOg++cpLxKchh8T0jOgu/4cV4mOQ2+YxJ9meQw+HJ7u9Pvy3EYfP7uGTDPZjtj14nzauavCbfdejTJODdbcgqSx8T9l9TFbpxWsb8w/bCf9cu5A48q2V3fJFhgJ0K3HX1Ze/Ug2d48WDHaS5fsirL1NcXIpKjtWOr7k8Bpe1zf4SRwKtf7k8B7ksNJ4D3J4SRw2vb804+L3dav44+LHcnxx0V5f0CwL8fhx0Wpf2w5Tj8unpDoB0gOPy62JKcfF7v1x8fjmy3J6fjmnKS8SnI4vnlCcja+OX6cl0lOxzfHJPoyyeH4pr0/QbAvx+H45v3E1t7lTz8umn8g+LYkp8F3TlJeJTkMvickZ8F3/Dgvk5wG3zGJvkxyFnxyvT35+qQcZ8EnV3k/+K73J4Flt9HrNFkv6Xp/nLYlOR2nyfuJrSflOBunSbI/thyH47RnJPoBkrNx2p7kcJwmqb3/qtiTHL4qfoGkvEpy9qp4RnL0qjh/nJdJDl8V5yT6Msnhq0Lq+zHcPvCqeD+xtXf5w3Ga7BJbx8G3JTkNvnOS8irJYfA9ITkLvuPHeZnkNPiOSfRlksPgs7cnX5+U4zD47P1FA9v5zoTNtw/4/f01T5aex96NJP7DcE+/Ps9u8Hp2bsmepOFegsdENs13Xj+R7DZzHS73Pif5frn3vmrFI/6kXLqp2mc7viMCNxt5Zbeh63grlmw3dJ1uxZLdhq7DrViy3c51un9wz3K6f1Dy+zd4PynK6d6yJyyHG3mfsBzuUNuznO5QE5c/unI/skPt0eewTUevem0Cepftylrj7sC8ZdldJ3NhN9YjT1R2LLtnKhb5Ox58/WQu/oGjjx8sHzj7uJvp++ZS0idisaRPRNGW5TiKin0givZFOdwOv++4yaLjtt2Ao3yk45aPdNzykY5bP9Bx60c6bv1Ix60f6bj1Ex23/vEdVzSKYjvH3W3tOt1ZLLuFuqc7i/clOdxZfE6y2Vn8hORsZ/ETkrOdxXuSwz3B+44Sx39blvRqRznbWfysz1YURS/bFKV9os+2T/TZ9ok+2z7RZ9sn+mz7RJ9tf3yfxbSVZc+vdpTjPrsbHxtmFXO2TfjoNhN2OViuUl5lSTjBNO9G2U8+HASvwgfmndI/FWa/zQuVS6OM6xcYXHHlMR2bcP3Co9gVlyxYkrx7FH37UfQPfZRxsPCcWLmSvdi4OTnNkG6+Cvc0bnig9MNlif8/Fbtx2QovqHTCoNT2Kxw5rpJu73NsyvGkSiouTnrguplAU9lvk0aykid5fvpUUPnEWUYqnzjLSOX9s4xUPnGW0ROWw0+FPcvpp4LKB84yelKUT8wUPd7lEcwt5xc9oRgu5nhg/f71s3tpZBzG/3ibfn8c2LjW+/tXckXCIluj1dVfT/rU3YmH5yepqm7a6Pgk1WvbRBoJi+j+j7m0ryXZ5gnQ/U2ot/Ts4ReW3ULvgsyWVkoH/cyyO/Ewxx0fmdecm3317V2CLL5x+WroPk15WLElwW3LD9M78rWJbX9hCU7/feCWv+8pu/MOReheKRp3ta+NbB+4rP7B8oHb6h8s5X3ntw/cV/+E5TR1ovkDx3Tui3L8KrMP3BT/rOMmTEw+8hqUH/6p4+5SZBZXRlLmXq7jMHwMsOPoaz6B/qcw3J7sd8WtMg+8OeH5CU1BrvqBPb9MU4Om2hulyUTTXqVpuCJD+ynKL7yFsmN6Jje+vUSOKUrDHaWPj+/rR4r/5/HHP/3bX/7xL3/9+7/96T//8ve//Uf/lymPkfjvvyXvp1s9SpDKAnWBNozi99/kWiANv3gAWUA7eNSB2AK5g0flii9QFqiLpzP3UNPO3Ad+2pn7gEllAV3AFujMfUOq+gJlgbpAZ+4jJuvM/UVmaQFZoDP3DbZmC+QFfIHO3F/7VhdoE+TO3N+fOU0zzrKALtCZuwnkvEBn7t6TywJ1gTaBd+ZulZ4W6Mx9R6PrArZAHn71AL5AZ+5vXq8LdOb+NViuBdICMgYdD6ALdOaebymduSc7ii9QFqhjfPIAbYLamfvsfU0LyAKduUdrtQU6c58eqr5AWaCO0fYDtAlaZ+7LQVpaQHrO81FRTRewBXJ/kTxqrPkCZXatVhdoEzxeW0BpXPHbkYwbfjvSkZbqqNP3rpeuDORAZSQEOqpAbaF0jdUnHaUx89qRAClQ1+jxm3pMTtQ1+mA89ai0PhBOPSwnagv1wLTeJ5MkoK7Ru2fqsTmRAXWN3kNTD8+Jypik7qgCtYV6iFp/T6UeoxPJmCLsSIFsXLDVUQZyoDJuG+6oAnWN/u5PPVit98rUo3UiAeoavYemHrATdY3eWVMP2YkKUNfo/TVZW6iHrfXZntTjdiIB6hr9GqnUQ3eirtG326QevBOVPpfYa7KH70RtoR7AY0tt6hE8kXTUy9xjOPfOmnoQT5SBvM8v9tL3OJ6oAnWN0et6KE+UgLpG/6RNPZpzP8889XDOfQiRejxP1DX6YDn1iJ6oa9j4t22hHtS5O1LqUZ1HP+hhnbvNpB7XExlQ1xgt3UN7ojKmtDuqYzK4o7ZQD+883kA9vicSIAUyoAzkQF2j+0fqYT7RQ8N73UuP84lSR7Uj6Qvu+tuox7n32pUe5xM9NMZVfNLjfKLS0fi3FajN6Ufpce49GqXHufcYlB7nbuOF2TVs/L2u0T1depxP5ONs7Y4KUNfw8f92jT4VIT3Ovdea9DifSIAUyIC6Rrdc6XE+Udfo27akx7l3R5Ue52W8knucT5Q66mXpcT6RdtRZepyXUZM9zify/qXX66/H+UR1fP111BbqcV66O0qP84m6Rn91S4/zIuPvdY1Ruz3OJ3KgAtQ1dLB0DR3DjwsorVbocV6610mP84m6Ru/j0uN8rF2UHucTdY08/m3XGO3R4/xGPc4nSkACpEBdo0+WS4/zibpGjwrpcV66w0mP84m6Rnc46XE+UQLqGmUMqbpGz8hJj/OJusZo/R7npb+dpcf5RF2jb4+XHuelu5n0OJ8oAQmQAnWNntiTHucTPTTq6C89zieqQK2j/pQ9zid6aNT+rpUe5xM9NGr3MOlxPlHuqPeIHucTFaCuMWKwx/lA2uO86hhPJqCu0V1Pe5xPZEBdo/cD7XE+UdfoX97a43yirtHfb9rjvPa+oT3Oa3c97XE+Ztu1x3mt478ZUAZyoALUNfrQX3uc36jHee0epj3OW/+61h7n7RojYwWyMZnQUQbyjgZLAapAbcw59GH1BdQ1+gS+9jifSIG6Rk/Xao/zibpGn9vWHudt1H2P86bj/+0aPRq1x/lECUiAdMyidNQ1Rnv0OJ/IZ9Rqj/Nm4+9VoLZQj/OJusZomR7nE3WNPD4aukYef69r+PhvDlSAKlBbqMd567GqPc4n6hqjzXuctx6N2uN8oq5RxjeKAxWgrtFjVe8472jE+aiXEec3EiAFstX/epy3foax9jhvbfy3AtQ12vgX/TlGb+pxPlHqSY/RYXqgL6gBLWDucHyd9WBfsIy0SW+gHu4LNsAe8AsOtT4I1iYBNeBQuz/ccsCh1t+p2krAGnCo9U5i1xVwqNn4+JOAGnCodWe2Kwccan3EYlcJWAM2wHQFTAEloAa0gDlgqKVQS6GWQk1CTUJNQk1CTUJNQk1CTUJNQk1CTUNNQ01DTUNNQ01DTUNNQ01DTUPNbrXxFZ4CSsBbrX95mwXMAT3grdbb2GowNMAcajnhn2UJGGo51HIGb/aAoZZDLYeah5rHs3k8m4eah5rHs3k8m4ea14ANsIRaCbUSakUDWsAc0AMWCJcasAHWK2BCGW4vuaEGDLUaajXUbi+5YdRkjZps8Wwt2q1Fu7WoyRY12aLdWrRbi5psodaglq8rYAooATWgBUS75csDloA1INotTy8ZMAUMtRRqKdRSDugBS8AaEO2W5QqYAkpAtFueXjJgDhhqEmoSahI1qVGTGjWp8WyKdstqAaMmNWpS0W5Za8CoyfCSHF6Sw0uyRU1a1KRFTVo8m0W7WbSbRU3mqMkc7ZYlYNRkDrUcajnUctRkeEkOL8nhJdmj3TzaLbwkh5dkj3ZzDxg16aHmoRZeksNLcnhJDi/J4SW5RLuVaLfwkhxekku0W40ICC/JNdRqqIWX5PCSHF6Sw0tyeEmu0W4t2i28JIeX5Bbt1iICwktyC7UWauElObzEw0s8vMTDS/xCu/llAXNAD4h286sGRE16CrUUauElHl7i4SUeXuLhJZ7Qbp5qQNSkh5e4oN1cJKAGDDUJtfASDy/x8BIPL/HwEle0m6sEjJoML3FFu7l6wKhJDTUNtfASDy/x8BIPL/HwEo9xice4xMNLPLzELdotXwGjJnOo5VALL/HwEg8v8fASDy/xHO3m0W7hJR5e4h7t5hYwatJDzUMtvMTDSzy8xMNLPLzES7RbiXYLL/HwEi/RbiUiILzEa6jVUAsv8fASDy/x8BIPL/Ea7Vaj3cJLPLzEW7RbiwgIL/EWai3Uwks8vMTDSzy8pISXlAvtVi4JqAEtINqtXB6wBKzBG2rhJSW8pISXlPCSEl5SEtqtJA9YAtaAaLciV8AUMNQk1MJLSnhJCS8p4SUlvKQI2q3oFTBqMrykKNqtqAWMmtRQ01ALLynhJSW8pISXlPCSEt84Jb5xSnhJCS8p8Y1TrAaMmoxvnJJDLbykhJeU8JISXlLCS0qOdsvRbuElJbykeLSbS8CoSQ81D7XwkhJeUsJLSnhJCS8pJdqtRLuFl5TwklKi3UpEQHhJKaFWQi28pISXlPCSEl5SwktKjXar0W7hJSW8pNRotxYREF5SWqi1UAsvKeElJbykhJeU8JLS0G71ugKmgBIQ7VYvC5gDQq1eJWANiJqs4SU1vKSGl9SEdqvJAuaAHhDtVlMNiJqsEmoSauElNbykhpfU8JIaXlIF7ValBoyaDC+pinarKgGjJjXUNNTCS2p4SQ0vqeElNbykWqiFl9QYl9QYl9T4xqnxjVPDS2rMl9SYL6nhJTW8pIaX1PjGqTl6SXhJDS+pt5f0KdN6e0nPZdTbS/oUaL29ZKwmuL3khhJwqPXkRb295IY54FAbiw5uL+nJwXp7yQ0b4O0lfa603l5yw6HW503r7SX36gQLmAMOtbFY4faSG3a1sSKuDi+54fCSCdOAvbzDSybsaqkvhqnDSybMAX3AXrLhJRMOtTRWTjTA4SWpz9DX4SUTSsCh1tOadXjJhEOtp97q8JLUMyh1eMmENeBQ61PSbXjJhEOtT8624SUTasCh1rOjbXjJhEOtZ1ra8JIJa8ChZmMVyBVwqPX0XBteMuFQ63O6bXjJhDngUOsz+214yYRDrS+XaWPFU6+RNqxk3KXZhpVMKAGHWO/UbVjJhEOsZwLasJLUp/3bsJIJa8DxaH1tQtMr4FDrnboNK5lQAw613tXbsJIJh1rvvm1YyYQ14FDr3bcNK5lwqI3VNsNKJuxq0rO9bVjJhDmgD9hbcFjJhF1trIZuw0qkd9Q2rGTCFFAG7GUYVjLhUOvppzasZEIPONR6LqoNK5lwqPXu24aVTJgCDrXefduwkgmH2ui+w0omHGo9Zd+GlUxYAw61nnlqw0omHGqjdw4rmXCo9X0wbViJjG42rGTCoTY6zLCSCYdaHbABDisZi/basJIJJaAGtIA5oAcsAWvABthCrYVaC7UWai3UWqi1UGuh1kKtQe1hkBfhRFgIK2EjnAk74UK4EibdRLqJdBPpJtIdziL9aPcHzoSd8NAd64Wu4S4Lt8DDYBYeuu1ehSbBMzxmYdKVTP/WCZOukK604NeLMOkq6SrpKukqPa/S8yrpKukqPa/R8xrpmhBWwqRrpGuke3vPxJVwC3zbz8QpynAb0MRK2AjnKM9tQhMXwqSbSddJ93aiiamenerZ6Xmd2tepfZ3q2amendq3UPsWqudCuoV0C+kWqudC9Vyongs9b6H2rdS+leq5Uj1Xat/boCameq6kW0m3km6lem5Uz43qudHzNmrfRu3bqJ4b1XOj9r3tauKo53SFbroSYSGshI1wJuyEo33TVQlHPad0EY72TUkIK2HSJb9K5FcpFcKVcNRzEnpeifZNIoSVsBGO9k3ihAth0hXSVdJVqmfyq0R+lcivkkb7JnXCVM/kV0mpfe0iTPVspGukS36VyK8S+VUiv0rkV8mofTO1L/lVIr9Kmdo3G2Gq50y6mXTJrxL5VSK/SuRXifwqObWvU/uSXyXyq+TUvl4JUz0X0i2kS36VyK8S+VUiv0rkV6lQ+xZqX/KrRH6VKrVvpTgiv0qVdCvpkl8l8qtEfpXIrxL5VWrUvo3al/wqkV+lRu3bKI7Ir1Ij3Ra6Qn4l5FdCfiXkV0J+JVe0r1xOuBCuhKN9JV2EE2HSTaRLfiXkV0J+JeRXQn4lNL4SGl8J+ZWQX4lE+4oY4UyYdIV0ya+E/ErIr4T8SsivRKN9RY0w1TP5lWi0r2glTPVspGukS34l5FdCfiXkV0J+JUbta9S+5FdCfiWZ2jcLYarnTLqZdMmvhPxKyK+E/ErIr8SpfZ3al/xKyK/EqX3dCVM9O+k66ZJfCfmVkF8J+ZWQX0mh9i3UvuRXQn4lhdq3UhyRX0kl3Uq65FdCfiXkV0J+JeRXUql9G7Uv+ZWQX0mj9m0UR+RX0ki3kS75lZBfKfmVkl8p+ZVe0b56GeFM2AlH++pVCUc9ayLdRLrkV0p+peRXSn6l5FdK34NK34NKfqXkV0rfgypCWAmTrpAu+ZWSXyn5lZJfKfmVarSvqhCmeia/Uo32VXXCVM9Kukq65FdKfqXkV0p+peRXatS+Ru1LfqXkV2rUvvkiTPWcSTeTLvmVkl8p+ZWSXyn5lWZqX6f2Jb9S8it1al83wlTPTrpOuuRXSn6l5FdKfqXkV1qofQu1L/mVkl9pofYtFEfkV1pJt5Iu+ZWSXyn5lZJfKfmVVmrfSu1LfqXkV9qofRvFEfmVNtJtpEt+peRXSn6l5FdGfmVXtK9dQlgJG+FoX7uccCFciZ90ya+M/MrIr4z8ysivLJEu+ZXR+MpofGX0PWj0PWjkV0bzV0bzV0Z+ZeRXRn5l9D1oUgmTLvmVTb/ygW/dNrASNsKZsBMuhCvhFnj61Y0TYdI10jXSNdI10jXSNdI10s2km0k3k24m3Uy6mXQz6WbSzaSbSddJ10nXSddJ10nXSXf41dj0ne6lzAtXwm3gEQvDrxZOhIWwDjz6xvCryTP8amHSLYX+bSVMupV0awr+KoRJt5JuJd1KupWet9LzVtJtpNvoeRs9byPdZoQzYdJtpNtItzXge63zwomwEFaU4V7vvHAm7IQLynOveV64BU6km0g3kW5SwkY4E3bC0b736ueFo57v9c8LR/veK6AXVsKkK6QrpCuFcCVM9az0vBrte6+FXpjqWameNdr3Xg+9MNWzkq6SrpGuUT0b1bNRPRs9r1H7GrWvUT0b1bNR++aLMNVzJt1Mupl0M9VzpnrOVM+ZnjdT+zq1r1M9O9WzU/u6EaZ6Jr/K5FeZ/Co71XOhei5Uz4Wet1D7FmrfQvVcqJ4LtW+hOCpUz5V0K+lW0q1Uz+RXmfwqk1/lSu1bqX3JrzL5VW7Uvo3iiPwqN9JtpEt+lcmvMvlVJr9y8iu/on39EsJK2AhH+/rlhAvhSvykS37l5FdOfuXkV05+5Sna15MTLoQr4Whfl4twIky6QrrkV05+5eRXTn7l5Fcu0b6uF2GqZ/Ir12hfVyNM9aykq6RLfuXkV05+5eRXTn7lRu1r1L7kV05+5Ubta5Uw1XMm3Uy65FdOfuXkV05+5eRXnql9M7Uv+ZWTX7lT+7oQpnp20nXSJb9y8isnv3LyKye/chpfOY2vnPzKya+8UPsWiiPyKy+kW0iX/MrJr5z8ysmvnPzKK7VvpfYlv3LyK6/Uvo3iiPzKG+k20iW/cvIrJ79y8isnv/IW7Vuui3AiLISjfctlhDPh0C1XIVwJRz0X8qtCflXIr0qK9i3JCGfCTjjat6RKOOq5COkK6ZJfFfKrQn5VyK8K+VWRaN8ilTDVM/lV0WjfokKY6llJV0mX/KqQXxXyq0J+VcivilH7GrUv+VUhvypG7WtOmOrZSNdIl/yqkF8V8qtCflXIr0qm9s3UvuRXhfyqZGpfvwhTPTvpOumSXxXyq0J+VcivCvlVoe/BQt+DhfyqkF8V+h4sheKI/KrQ92AppEt+VcivCvlVIb8q5FelUvtWal/yq0J+VSq1b6U4Ir8qjXQb6ZJfFfKrQn5VyK8K+VVp1L6N2pf8qpJf1Svat15CWAmHbr0yYSdcCFfCUc+V/KqmaN+ahLASNsLRvjU54UKYdBPpkl9V8qtKflXJryr5VZVo3ypOuBCuhKN9q16EqZ6VdJV0ya8q+VUlv6rkV5X8qiq1r1H7kl9V8qtq1L5mhKmejXSNdMmvKvlVJb+q5FeV/Kpmat9M7Ut+Vcmvaqb2zZUw1bOTrpMu+VUlv6rkV5X8qpJfVSdd8qtK46tK46tK34OVvgcr+VWl+atK81eV/KqSX1Xyq0rfg7VSvyK/quRXdfrVOOHrnm8v45yue7594nv95I0L4Vg/WWOVaKqxTDTVWCeaaiwUTTVWiqYaS0VTjbWiqcZi0VRjtWiqjXRpvWij9aKN1os2Wi/aaL1oo/WijdaLNlov2mi9aKP1oo3WizZaL9povWij9aKN1oveK9EXJt1Euol0E+km0hXSFdKl+fZG8+2N5tsbrRdttF600XrRRutFG60XbTTf3mg9Q6P1DI3yg43yg43WMzRaz9AoP9hoPUOj9QyN8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oON8oMt8oNyRX5QrsgPyhX5QbkiPyhX5AflivygXJEflCvyg3JFflCui3QT6UZ+UK7ID8oV+UGh9e2y1rePMiQnXAhXwi3KIxfhRJh0hXSFdCM/KFfkB+WK9QxyCT2vtCiDXoSpnpXqWTXKo0aY6llJV0lXSVepno3q2aiejZ7XqH2N2teono3q2ah9rRKmes6km0k3k26mes5Uz5nqOdPzZmrfTO2bqZ6d6tmpfV0IUz076TrpOuk61bNTPTvVc6HnLdS+hdq3UD0XqudC7VsojgrVcyHdQrqVdCvVc6V6rlTPlZ63UvtWat9K9Vypniu1b6M4alTPjXQb6TbSbVTPjeq5UT03et4W7bvWt984ERbC0b5rffuNM+HQXevbb1wJRz0n8qtEfpXIr9b69lGGZIQzYScc7bvWt9846pnWt8ta335j0iW/SuRXifwqkV+lGF9JivHVA1M9k1+l2I8ja337jamelXSVdMmvEvlVIr9K5FeJ/Gqtbx9lMGpf8qtEfrXWt4/ymBOmejbSNdIlv0rkV4n8KpFfJfKrtb59lCFT+5JfJfKrtb59lMcvwlTPTrpOuuRXifwqkV8l8qtEfrXWt48yFGpf8qtEfrXWt4/yFIoj8ita3y6pkC75VSK/SuRXifwqkV+t9e2jDJXal/wqkV+t9e2jPJXiiPyK1rdLaqRLfpXIrxL5VSK/SuRXa337KEOj9iW/EvKrtb5dBxbCSjh0JfbjiJBfCfmVkF8J+ZWQX6317aMMSQgrYSMc7bvWt9+4ECbdRLrkV0J+JeRXQn4l5FcS34Mi8T0oQn4l5FcS34MisX9QhPyK1reLKOmSXwn5lZBfCfmVkF+JUvsatS/5lZBfiVH7mhGmejbSNdIlvxLyKyG/EvIrIb+STO2bqX3Jr4T8SjK1b66EqZ6ddJ10ya+E/ErIr4T8SsivxKl9ndqX/ErIr6RQ+xaKI/IrWt8uUkiX/ErIr4T8SsivhPxKKrVvpfYlvxLyK6nUvpXiiPyK1reLVNIlvxLyKyG/EvIrIb+SRu3bqH3Jr4T8SmL/oKz17TdOhENXYz+OKPmVkl8p+ZWSXyn5lcb+QdHYPyhKfqXkVxr7B2Wtb79xJky6iXTJr5T8SsmvlPxKya9ofbvQ+nah9e1C69uF1rcLrW8XJb+i9e2iSrrkV0p+peRXtL5daH27KPkVrW+Xtb79PiUf6ydFY72oaKwXFY31oqKxXlQ01ouKxnpR0VgvKhrrRUVjvahoJt1Mupl0M+lm0s2km0k3k24m3Uy6TrpOuk66TrpOuk66TrpOuk66TrqFdAvpFtItpBvz7aIx3y4a8+2isV5UNNaLisZ6UdFYLyoa60VFY75dNNYziFbSjfygaOQHRSvpVtKN/KBorGcQbaTbSLeRbiPdRs/b6Hkb6TbSjfygWOQHxSI/KBb5QbHID4pFflAs8oNikR8Ui/ygWOQHxSI/KBb5QbHID4pFflAs8oNikR8Ui/ygWOQHxSI/KJZIN5GukG7kB8UiPygW+UExoeeN/KBY5AfFIj8oFvlBscgPikV+UEypnpV0lXSVdJXqWamelepZ6XmV2teofY3q2aiejdo38oNiRvVspGuka6RrVM+Z6jlTPWd63kztm6l9M9VzpnrO1L6RHxTLVM9Ouk66TrpO9exUz0717PS8Tu3r1L5O9Vyongu1b6E4KlTP5Fe0vl1ofbtYoXouVM+F6rnS81Zq30rtW6meK9VzpfatFEeV6rmSbiXdRrqN6pn8ysivjPxqrW8fZWjUvuRXRn611rf38qz17TdOhEN3rW+/sRHOhJ1wIVwJR/uu9e03ToSFcLTvWt9+40yYdBPpkl9l8qtMfpXJrzL51VrfPsogRjgTdsLRvmt9+42pnpV0lXTJrzL5VSa/yuRXmfxqrW8fZdBKmOqZ/Gqtbx/lMSFM9Wyka6RLfpXJrzL5VSa/yuRXa337KEOm9iW/yuRXa337KE92wlTPmXQz6ZJfZfKrTH6Vya8y+dVa3z7K4NS+5FeZ/Gqtbx/lKRRH5Fe0vl3W+vYbky75VSa/yuRXmfwq0/gq0/gqk19l8qtcqX0rxRH5Fa1vl1xJl/wqk19l8qtMfpXJr9b69lGGRu1LfpXJr9b69lGeRnFEfkXr28VjP444+ZWTXzn5lZNfOfnVWt8uA1fCUc9OfrXWt4/yJCGshEk3kS75lZNfOfmVk185+dVa3z7KIEJYCRvhaN+1vv3GhTDpCumSXzn5lZNfOfmVk1+t9e2jDOqEqZ7Jr9b69lEeuwhTPRvpGumSXzn5lZNfOfmVk1+t9e2jDJnal/zKya/W+vZRnmyEqZ4z6WbSJb9y8isnv3LyKye/WuvbRxmc2pf8ysmv3Kl9vRKmei6kW0iX/MrJr5z8ysmvnPzK6XvQ6XvQya+c/Mrpe9ArxRH5Fa1vF6+kS37l5FdOfuXkV05+5Y3at1H7kl85+ZU3at9GcUR+RevbxWM/jhTyq0J+VcivCvlVIb8qsX9QSuwflEJ+VcivSuwflLW+/caJMOkm0iW/KuRXhfyqkF8V8qsS+welxP5BKeRXhfyqxP5BWevbb5wJk66QLvlVIb8q5FeF/KqQX5XYPygl9g9KIb8q5Fcl9g/KWt9+Y6pnI10jXfKrQn5VyK8K+VUhvypG7WvUvuRXhfyqZGrfLISpnjPpZtIlvyrkV4X8qpBfFfKr4tS+Tu1LflXIr4pT+7oTpnp20nXSJb8q5FeF/KqQXxXyK1rfLrS+XWh9u9D6dqH17ULr26WQX9H6dik0f1XIrwr5VSG/ovXtQuvbpZBf0fp2WevbfeChm0Z93n417mid69t13Gp5+9XETrgQroQb8FzfPu4KnevbJxbCStgIZ8JOuBCuhFvgRLq3X/XrxWWub5946I7bRuf69jxuS7/9Kt9/xwkP3X6qrMz17RO3wLdfTTx0+6XhMte3T6yEjfDQHTeYzvXtdzlvv5q4Eh66Psp/+9XEibAQ1vi3t19NnAmT7u1XLv/z+2//90//+Muf/vWvf/6P3/7pv/s99//1t39bd9o//vif/++/r//nX//xl7/+9S//51/+/R9//7c//6//+sef+/33/f/7Tcb997/90z8/vOD3R/z9P7//lsYfS3r8Uft9+bX/lUch//mRjv/9kRrv/y3J+o/Sftc2/pP2//R44H9+TIf9/pg6elD1v9Av9n5MqC3ixxzR4/+s41/k9S/6qqbf+xKg/rf6nx819Psjq2WTo++y/L1veVwsfZnP731Nz+BBCUV/10eZ+z3//x8=", "is_unconstrained": false, "name": "non_interactive_handshake", "verification_key": "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA8AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAfMiSIlLcFAXNyQ0WSuT4gQkAAAAAAAAAAAAAAAAAAAAAACwPFDNGWwIFqyZ+9TMrBAAAAAAAAAAAAAAAAAAAAAAWMIFRLEYhEhOb0UkgR3HBAAAAAAAAAAAAAAAAAAAAAAAvjq9oq9WO2oCMIQ8Qy/gAAAAAAAAAAAAAAAAAAAAEhOW4a4tX0AkM7TZaAaJFdgAAAAAAAAAAAAAAAAAAAAAADA2+LugnNJKo0UJmdT0HAAAAAAAAAAAAAAAAAAAAOYF7uf8+x6sQWHxLKrn+MYwAAAAAAAAAAAAAAAAAAAAAAB7xuwADvpTij8daxJvi3AAAAAAAAAAAAAAAAAAAAK9VX/nAGEuqa1HriC5HFDdfAAAAAAAAAAAAAAAAAAAAAAAZp0k8FeWZ24fESMzB7jYAAAAAAAAAAAAAAAAAAACPbAx7M/Yz8oiIFTLqOqRv0AAAAAAAAAAAAAAAAAAAAAAAKnLofN7QwVvkxukWJKxEAAAAAAAAAAAAAAAAAAAAeQrTNhZyqkpJS3Wo2Ot7QNkAAAAAAAAAAAAAAAAAAAAAABnGqk0Ck6bXx9u7ywLGLwAAAAAAAAAAAAAAAAAAAKmyDnd5S1ft6r4BlcEZurHCAAAAAAAAAAAAAAAAAAAAAAAnyHxHSb8OHEeYPEVTtTcAAAAAAAAAAAAAAAAAAACMc12w9hM7GLlNukmbzt0WaAAAAAAAAAAAAAAAAAAAAAAAAzxw1oeacJswy7llheTfAAAAAAAAAAAAAAAAAAAAamncG3u+vgd5lQhAcG9K9SMAAAAAAAAAAAAAAAAAAAAAABCtcJe6OK8SRIJRuRPDjgAAAAAAAAAAAAAAAAAAAM3f4cFggoeaXe82xFOzVv9RAAAAAAAAAAAAAAAAAAAAAAAgSUYo86A1P9JT7Y3Jib4AAAAAAAAAAAAAAAAAAACoymG9XogldKNs5dYrhD/X3QAAAAAAAAAAAAAAAAAAAAAAMBDinnZ7PAODwrHEy3C+AAAAAAAAAAAAAAAAAAAACb6aMVRUu+PXc0uiKNugySIAAAAAAAAAAAAAAAAAAAAAAC5YjfqvH+4Oea9Vrs716wAAAAAAAAAAAAAAAAAAAHoUCjxKU4dd4SBiN49VBsqmAAAAAAAAAAAAAAAAAAAAAAAPcbb5NVugMbLQaYsyWGwAAAAAAAAAAAAAAAAAAACX6uFFC7rs0QZGqaCX9Ez2NgAAAAAAAAAAAAAAAAAAAAAADe/MDGnEOAyv1Dl+GF2vAAAAAAAAAAAAAAAAAAAAofUjKG7qCQ1Sz52Y4KPI9MYAAAAAAAAAAAAAAAAAAAAAAAZPmksHxqj4Z4FwEICffQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAJw3a0VbYKDvfhSVM7ZLYenAAAAAAAAAAAAAAAAAAAAAAACp3/X9QEgGFQzF4ZItvsAAAAAAAAAAAAAAAAAAAAIIWHDbusyv0V30JAUAM0C0XAAAAAAAAAAAAAAAAAAAAAAALynLb7exTgrzyiOmfAeEAAAAAAAAAAAAAAAAAAADJ64ztO1reVKw+Xks1nmmjygAAAAAAAAAAAAAAAAAAAAAAGP9emJanywp0nbS/lkA0AAAAAAAAAAAAAAAAAAAAynPlGtmw+DDX6Kqid3oYxEYAAAAAAAAAAAAAAAAAAAAAAA0Dv7ANkm6DjgCbB9TQLAAAAAAAAAAAAAAAAAAAAOfPD9WpytDJ0GlDTxl1oMvZAAAAAAAAAAAAAAAAAAAAAAAO71g8Q0uymnh+QoZtlekAAAAAAAAAAAAAAAAAAADhmdV+foDkXRZL+3GaleZnfAAAAAAAAAAAAAAAAAAAAAAAJDLk9iWO9+F1vecfjTOkAAAAAAAAAAAAAAAAAAAAlXS86PqlIKR6yFf+vRjWQiUAAAAAAAAAAAAAAAAAAAAAABcsDEipefRDZGZsVqhVtwAAAAAAAAAAAAAAAAAAANNufXaDwD5e5/iIhvrANmjZAAAAAAAAAAAAAAAAAAAAAAAFjfXFFJT1Ap5GGpXm10gAAAAAAAAAAAAAAAAAAAAwTja7i1kNpyBcuKJXtD0LXgAAAAAAAAAAAAAAAAAAAAAAIZlMOh/UKd+QFD/AyyXFAAAAAAAAAAAAAAAAAAAAGK3UWIUabiW1T8Kn5bVCmdYAAAAAAAAAAAAAAAAAAAAAABJc0IDBtVEcs64wFVN2vwAAAAAAAAAAAAAAAAAAAIu6WDxTwBtC5YNdfC+B8AViAAAAAAAAAAAAAAAAAAAAAAAe7OEXEguqL6TFNF+Xh38AAAAAAAAAAAAAAAAAAAA5yl0c75I897mD2RvQT++XIwAAAAAAAAAAAAAAAAAAAAAAC7qLb2GGc0g9m5aqtaGGAAAAAAAAAAAAAAAAAAAAQ6177twOBko1zuCdpKkMFAYAAAAAAAAAAAAAAAAAAAAAAAp5WLaQglKUhBjJXT1JZgAAAAAAAAAAAAAAAAAAAGGyPMCZ//raIbazQQMXEMfhAAAAAAAAAAAAAAAAAAAAAAAeAqbuzshDkEm7zeVN5uoAAAAAAAAAAAAAAAAAAAAZ7ryjSpAl0ivtTOx/YmROKQAAAAAAAAAAAAAAAAAAAAAABqrXIeu4woCpng212630AAAAAAAAAAAAAAAAAAAAh7f3O79rQiGHfquE2zfnV+wAAAAAAAAAAAAAAAAAAAAAAB3h9dVQLtJtBYw3Z6Z6CQAAAAAAAAAAAAAAAAAAAL3VnJsnol1NCkqaKklO4Z6mAAAAAAAAAAAAAAAAAAAAAAAijPvNSItvvMd4Gp/nj6cAAAAAAAAAAAAAAAAAAAAVVQUZHvP0rvYvl+uXOk+WYQAAAAAAAAAAAAAAAAAAAAAABeRhFmHpxAsTdgJAXstrAAAAAAAAAAAAAAAAAAAAzD8qGnOmF7UqXxwLfDd2SVEAAAAAAAAAAAAAAAAAAAAAACfqtE1LvLOcBQZZplW2LQAAAAAAAAAAAAAAAAAAALGPgEstwSt0NFIRoAeiKR2dAAAAAAAAAAAAAAAAAAAAAAAR4gQvLeNSj9elN0DMODUAAAAAAAAAAAAAAAAAAADux+BwNHah5Ysd9GDi+qrZXAAAAAAAAAAAAAAAAAAAAAAAGtYuJFG6+2VhI85H4+qwAAAAAAAAAAAAAAAAAAAARB/frV9WWWEnFYjdgGs6PNoAAAAAAAAAAAAAAAAAAAAAAACkMQ4MZ4+9RGbw04gF0AAAAAAAAAAAAAAAAAAAAGVj367fsnGJJGa6z9H9WsBqAAAAAAAAAAAAAAAAAAAAAAAr13W15+e/IAxBGzIFMXgAAAAAAAAAAAAAAAAAAAARDW8hlo7IayuGwYmmjAY6vAAAAAAAAAAAAAAAAAAAAAAALYHX/DxaAjJcqxBpxMbIAAAAAAAAAAAAAAAAAAAAhsz/kb0qf6apxLk+Aku6Ps4AAAAAAAAAAAAAAAAAAAAAABSgePYLAKc1IpH5gv9gnQAAAAAAAAAAAAAAAAAAAJL/SiAFEAntX8Gs9BPH3iIdAAAAAAAAAAAAAAAAAAAAAAAlAx5bOVGszkS+ll5vhY4AAAAAAAAAAAAAAAAAAADpfYbegzEV9vNxG1Q+bo+WWAAAAAAAAAAAAAAAAAAAAAAALct22EVcEaCVRgV8RcHzAAAAAAAAAAAAAAAAAAAAPtoSo4PmYIWcCQwbo74ralIAAAAAAAAAAAAAAAAAAAAAACGQKZ9MtQocV37P2ThF1AAAAAAAAAAAAAAAAAAAAKGmwI8H5v4sIK6nqlnymim7AAAAAAAAAAAAAAAAAAAAAAAeK22T62Ktz5DLjR1gAg8AAAAAAAAAAAAAAAAAAACNaBFhoKdwNPvEh3o2cxGzoAAAAAAAAAAAAAAAAAAAAAAADXgcoIjQtbADoiOYhSqgAAAAAAAAAAAAAAAAAAAAwTN+7yrOfgp9GDSMCvTlJ4QAAAAAAAAAAAAAAAAAAAAAAAY/BzgDiXHBglTqiWz+yQAAAAAAAAAAAAAAAAAAADpaiIZAupEnufGCpb+35SpaAAAAAAAAAAAAAAAAAAAAAAAqFTN13zUrJAWNY7C5sEMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAmY/fI7p6MCmNLaTogPa1WdEAAAAAAAAAAAAAAAAAAAAAABl/cnEWKMdHvGPAhMWWaAAAAAAAAAAAAAAAAAAAAJ6DcDhMDP8HZpR3c20HUn7BAAAAAAAAAAAAAAAAAAAAAAAfAiADMPV7taVRQ3aoNp0AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD33q8YQ7kfw7uG9DTf2sujvAAAAAAAAAAAAAAAAAAAAAAAUWU9TbMJSV8ypRi6TeaYAAAAAAAAAAAAAAAAAAADj5eNlUTnuZtU2tRNTu1R6UgAAAAAAAAAAAAAAAAAAAAAAJp25HsqqEy+BzzS7PCfRAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAUydtP9ckBhp0CiZt/LHzD+oAAAAAAAAAAAAAAAAAAAAAACmoPqQ0MEtRP4t5W753OwAAAAAAAAAAAAAAAAAAAEQ7gnkh5PcoZ8eubSHIGuKoAAAAAAAAAAAAAAAAAAAAAAAFVlOzghqASg0H8oXDBiAAAAAAAAAAAAAAAAAAAAChFa5BRSYAb8wAv9dYN4WHRAAAAAAAAAAAAAAAAAAAAAAALUHANzXMBl+3fGEkvPGYAAAAAAAAAAAAAAAAAAAAYnNuUKOyPg688f/JcruN6BkAAAAAAAAAAAAAAAAAAAAAACqHcPRw9atll5nXEOWMMgAAAAAAAAAAAAAAAAAAANoszopFhsJa7J7LuYd6ZOMpAAAAAAAAAAAAAAAAAAAAAAAodvs88CEiZa/xbL+5cb0AAAAAAAAAAAAAAAAAAACPC9wDP08MT8dgw/sfEeM5EgAAAAAAAAAAAAAAAAAAAAAAIn42guS9TgSzvripkhUyAAAAAAAAAAAAAAAAAAAAcy9lskoe8HzdYwbFh/IAhvMAAAAAAAAAAAAAAAAAAAAAAC7LbpuWY/4qcvVDfRDBGwAAAAAAAAAAAAAAAAAAALFpsTkv+j+PhTopdA+A7ZThAAAAAAAAAAAAAAAAAAAAAAAEwAUsFQXgIvvLKw5gVFcAAAAAAAAAAAAAAAAAAABuMIuvkWFrCFxtha8mnCwxygAAAAAAAAAAAAAAAAAAAAAAB5J59H8qIz7JeHJY46COAAAAAAAAAAAAAAAAAAAAlzeN8qiDV9FIDfUOIl6vO0wAAAAAAAAAAAAAAAAAAAAAAAcvjGDBUUCX7nOZC1l4CAAAAAAAAAAAAAAAAAAAAEH4objBBkGADRlJCkBwS/IYAAAAAAAAAAAAAAAAAAAAAAAt75A6hkXj9zsj5Atm8DkAAAAAAAAAAAAAAAAAAAADtMoKPHMcvP/mGwDMCwz+HQAAAAAAAAAAAAAAAAAAAAAAFiGNFslyqMWxZ7hi53tSAAAAAAAAAAAAAAAAAAAAAXGuUv8h8LHdquoyCG714tcAAAAAAAAAAAAAAAAAAAAAAB5MHnKzUTBSTX3RhDPMWQAAAAAAAAAAAAAAAAAAACbw7Tt8hARv1yuPnJBD891vAAAAAAAAAAAAAAAAAAAAAAAe6hFQ4+UnsKET3S4LZwk=" }, { "abi": { "error_types": { "10033682601308824536": { "error_kind": "string", "string": "Ephemeral public key is the point at infinity" }, "10522114655416116165": { "error_kind": "string", "string": "Can't read a transient note with a zero contract address" }, "11088061827347467743": { "error_kind": "string", "string": "Note owner mismatch." }, "12366868613919617670": { "error_kind": "fmtstring", "item_types": [], "length": 20 }, "12469291177396340830": { "error_kind": "string", "string": "call to assert_max_bit_size" }, "12820178569648940736": { "error_kind": "fmtstring", "item_types": [ { "kind": "field" }, { "kind": "field" } ], "length": 48 }, "12913276134398371456": { "error_kind": "string", "string": "push out of bounds" }, "13071717047238727781": { "error_kind": "string", "string": "no matching handshake" }, "13455385521185560676": { "error_kind": "string", "string": "Storage slot 0 not allowed. Storage slots must start from 1." }, "14990209321349310352": { "error_kind": "string", "string": "attempt to add with overflow" }, "16431471497789672479": { "error_kind": "string", "string": "Index out of bounds" }, "16466267804227883608": { "error_kind": "string", "string": "Got an ephemeral public key with a negative y coordinate" }, "17110599087403377004": { "error_kind": "fmtstring", "item_types": [], "length": 98 }, "17968463464609163264": { "error_kind": "string", "string": "Note is not in stage SETTLED" }, "186772300998906374": { "error_kind": "string", "string": "Obtained key validation request for wrong pk_m_hash" }, "1998584279744703196": { "error_kind": "string", "string": "attempt to subtract with overflow" }, "2431956315772066139": { "error_kind": "string", "string": "Note is not in stage PENDING_PREVIOUS_PHASE" }, "3387382714057837913": { "error_kind": "string", "string": "Note storage slot mismatch." }, "5449178635769758673": { "error_kind": "fmtstring", "item_types": [ { "kind": "field" }, { "kind": "field" } ], "length": 61 }, "643863379597415252": { "error_kind": "string", "string": "A NewNote cannot have a zero note hash counter" }, "7217415691812985622": { "error_kind": "fmtstring", "item_types": [], "length": 123 }, "8992688621799713766": { "error_kind": "string", "string": "Invalid public keys hint for address" }, "9460929337190338452": { "error_kind": "string", "string": "Note contract address mismatch." }, "9791669845391776238": { "error_kind": "string", "string": "0 has a square root; you cannot claim it is not square" }, "992401946138144806": { "error_kind": "string", "string": "Attempted to read past end of BoundedVec" }, "9970201630854352883": { "error_kind": "fmtstring", "item_types": [ { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } ], "length": 48 } }, "parameters": [ { "name": "inputs", "type": { "fields": [ { "name": "call_context", "type": { "fields": [ { "name": "msg_sender", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "contract_address", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "function_selector", "type": { "fields": [ { "name": "inner", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::function_selector::FunctionSelector" } }, { "name": "is_static_call", "type": { "kind": "boolean" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::call_context::CallContext" } }, { "name": "anchor_block_header", "type": { "fields": [ { "name": "last_archive", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } }, { "name": "state", "type": { "fields": [ { "name": "l1_to_l2_message_tree", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } }, { "name": "partial", "type": { "fields": [ { "name": "note_hash_tree", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } }, { "name": "nullifier_tree", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } }, { "name": "public_data_tree", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::partial_state_reference::PartialStateReference" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::state_reference::StateReference" } }, { "name": "sponge_blob_hash", "type": { "kind": "field" } }, { "name": "global_variables", "type": { "fields": [ { "name": "chain_id", "type": { "kind": "field" } }, { "name": "version", "type": { "kind": "field" } }, { "name": "block_number", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "slot_number", "type": { "kind": "field" } }, { "name": "timestamp", "type": { "kind": "integer", "sign": "unsigned", "width": 64 } }, { "name": "coinbase", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::eth_address::EthAddress" } }, { "name": "fee_recipient", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "gas_fees", "type": { "fields": [ { "name": "fee_per_da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } }, { "name": "fee_per_l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas_fees::GasFees" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::global_variables::GlobalVariables" } }, { "name": "total_fees", "type": { "kind": "field" } }, { "name": "total_mana_used", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::block_header::BlockHeader" } }, { "name": "tx_context", "type": { "fields": [ { "name": "chain_id", "type": { "kind": "field" } }, { "name": "version", "type": { "kind": "field" } }, { "name": "gas_settings", "type": { "fields": [ { "name": "gas_limits", "type": { "fields": [ { "name": "da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas::Gas" } }, { "name": "teardown_gas_limits", "type": { "fields": [ { "name": "da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas::Gas" } }, { "name": "max_fees_per_gas", "type": { "fields": [ { "name": "fee_per_da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } }, { "name": "fee_per_l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas_fees::GasFees" } }, { "name": "max_priority_fees_per_gas", "type": { "fields": [ { "name": "fee_per_da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } }, { "name": "fee_per_l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas_fees::GasFees" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas_settings::GasSettings" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::transaction::tx_context::TxContext" } }, { "name": "start_side_effect_counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "tx_request_salt", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::context::inputs::private_context_inputs::PrivateContextInputs" }, "visibility": "private" }, { "name": "sender", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" }, "visibility": "private" }, { "name": "recipient", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" }, "visibility": "private" }, { "name": "secrets", "type": { "fields": [ { "name": "shared", "type": { "kind": "field" } }, { "name": "sender_only", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::messages::delivery::handshake::AppSiloedHandshakeSecrets" }, "visibility": "private" } ], "return_type": { "abi_type": { "fields": [ { "name": "call_context", "type": { "fields": [ { "name": "msg_sender", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "contract_address", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "function_selector", "type": { "fields": [ { "name": "inner", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::function_selector::FunctionSelector" } }, { "name": "is_static_call", "type": { "kind": "boolean" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::call_context::CallContext" } }, { "name": "args_hash", "type": { "kind": "field" } }, { "name": "returns_hash", "type": { "kind": "field" } }, { "name": "anchor_block_header", "type": { "fields": [ { "name": "last_archive", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } }, { "name": "state", "type": { "fields": [ { "name": "l1_to_l2_message_tree", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } }, { "name": "partial", "type": { "fields": [ { "name": "note_hash_tree", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } }, { "name": "nullifier_tree", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } }, { "name": "public_data_tree", "type": { "fields": [ { "name": "root", "type": { "kind": "field" } }, { "name": "next_available_leaf_index", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::append_only_tree_snapshot::AppendOnlyTreeSnapshot" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::partial_state_reference::PartialStateReference" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::state_reference::StateReference" } }, { "name": "sponge_blob_hash", "type": { "kind": "field" } }, { "name": "global_variables", "type": { "fields": [ { "name": "chain_id", "type": { "kind": "field" } }, { "name": "version", "type": { "kind": "field" } }, { "name": "block_number", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "slot_number", "type": { "kind": "field" } }, { "name": "timestamp", "type": { "kind": "integer", "sign": "unsigned", "width": 64 } }, { "name": "coinbase", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::eth_address::EthAddress" } }, { "name": "fee_recipient", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "gas_fees", "type": { "fields": [ { "name": "fee_per_da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } }, { "name": "fee_per_l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas_fees::GasFees" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::global_variables::GlobalVariables" } }, { "name": "total_fees", "type": { "kind": "field" } }, { "name": "total_mana_used", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::block_header::BlockHeader" } }, { "name": "tx_context", "type": { "fields": [ { "name": "chain_id", "type": { "kind": "field" } }, { "name": "version", "type": { "kind": "field" } }, { "name": "gas_settings", "type": { "fields": [ { "name": "gas_limits", "type": { "fields": [ { "name": "da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas::Gas" } }, { "name": "teardown_gas_limits", "type": { "fields": [ { "name": "da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas::Gas" } }, { "name": "max_fees_per_gas", "type": { "fields": [ { "name": "fee_per_da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } }, { "name": "fee_per_l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas_fees::GasFees" } }, { "name": "max_priority_fees_per_gas", "type": { "fields": [ { "name": "fee_per_da_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } }, { "name": "fee_per_l2_gas", "type": { "kind": "integer", "sign": "unsigned", "width": 128 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas_fees::GasFees" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::gas_settings::GasSettings" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::transaction::tx_context::TxContext" } }, { "name": "min_revertible_side_effect_counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "is_fee_payer", "type": { "kind": "boolean" } }, { "name": "expiration_timestamp", "type": { "kind": "integer", "sign": "unsigned", "width": 64 } }, { "name": "start_side_effect_counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "end_side_effect_counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "expected_non_revertible_side_effect_counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "expected_revertible_side_effect_counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "note_hash_read_requests", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 16, "type": { "fields": [ { "name": "inner", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } }, { "name": "counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::counted::Counted" } }, { "name": "contract_address", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::scoped::Scoped" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "nullifier_read_requests", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 16, "type": { "fields": [ { "name": "inner", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } }, { "name": "counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::counted::Counted" } }, { "name": "contract_address", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::scoped::Scoped" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "key_validation_requests_and_separators", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 16, "type": { "fields": [ { "name": "request", "type": { "fields": [ { "name": "pk_m_hash", "type": { "kind": "field" } }, { "name": "sk_app", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::validation_requests::key_validation_request::KeyValidationRequest" } }, { "name": "key_type_domain_separator", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::validation_requests::key_validation_request_and_separator::KeyValidationRequestAndSeparator" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "private_call_requests", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 8, "type": { "fields": [ { "name": "call_context", "type": { "fields": [ { "name": "msg_sender", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "contract_address", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "function_selector", "type": { "fields": [ { "name": "inner", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::function_selector::FunctionSelector" } }, { "name": "is_static_call", "type": { "kind": "boolean" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::call_context::CallContext" } }, { "name": "args_hash", "type": { "kind": "field" } }, { "name": "returns_hash", "type": { "kind": "field" } }, { "name": "start_side_effect_counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } }, { "name": "end_side_effect_counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::private_call_request::PrivateCallRequest" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "public_call_requests", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 32, "type": { "fields": [ { "name": "inner", "type": { "fields": [ { "name": "msg_sender", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "contract_address", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "is_static_call", "type": { "kind": "boolean" } }, { "name": "calldata_hash", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::public_call_request::PublicCallRequest" } }, { "name": "counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::counted::Counted" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "public_teardown_call_request", "type": { "fields": [ { "name": "msg_sender", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "contract_address", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "is_static_call", "type": { "kind": "boolean" } }, { "name": "calldata_hash", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::public_call_request::PublicCallRequest" } }, { "name": "note_hashes", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 16, "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } }, { "name": "counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::counted::Counted" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "nullifiers", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 16, "type": { "fields": [ { "name": "inner", "type": { "fields": [ { "name": "value", "type": { "kind": "field" } }, { "name": "note_hash", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::nullifier::Nullifier" } }, { "name": "counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::counted::Counted" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "l2_to_l1_msgs", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 8, "type": { "fields": [ { "name": "inner", "type": { "fields": [ { "name": "recipient", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::eth_address::EthAddress" } }, { "name": "content", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::messaging::l2_to_l1_message::L2ToL1Message" } }, { "name": "counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::counted::Counted" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "private_logs", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 16, "type": { "fields": [ { "name": "inner", "type": { "fields": [ { "name": "log", "type": { "fields": [ { "name": "fields", "type": { "kind": "array", "length": 16, "type": { "kind": "field" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::log::Log" } }, { "name": "note_hash_counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::private_log::PrivateLogData" } }, { "name": "counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::counted::Counted" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "contract_class_logs_hashes", "type": { "fields": [ { "name": "array", "type": { "kind": "array", "length": 1, "type": { "fields": [ { "name": "inner", "type": { "fields": [ { "name": "value", "type": { "kind": "field" } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::abis::log_hash::LogHash" } }, { "name": "counter", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::side_effect::counted::Counted" } } }, { "name": "length", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray" } }, { "name": "tx_request_salt", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::abis::private_circuit_public_inputs::PrivateCircuitPublicInputs" }, "visibility": "databus" } }, "bytecode": "H4sIAAAAAAAA/+1dd2AUxf7PzO5dkrvkcql0aYoVBSw/u1JCB5EmFoxHcmAeIYkpCPbYnxUC9melWvD57F302d2vqE+f+sSC2Btg7/w25Mrs7c7c7N5+4YKXf1hudz7fKd/5zne+M/MZpXXhlW/vUlEROqUpXFlR21BRXdsUbqgN1TRWVMwN1VRXhZrCFSeGaqsaTwzNDq9Vvm+5a0hNqHL2kLp5w5trK4eGampalk0cPH5EeWvLiqOqm2rDjY20l8RHCpH4qFAGqfhwiY/KtLMkvuok9VV3mVz1kPloB5mPesp81Esq572lvuoj9VVfqa927NVy+5CG6pqa6llt7xdnLViwaMGCp3tlif9Iy22DGxvDDU3HhBvqFi1Y2Pp0rwFV4xvWDbxp1wcnlN/f0jJt+i57fzZy/kP1C4eu+2HRRj0JKCeJYd/ov362E9gGLqwn+mBREfdOqGsMV1fV1Q6aEG6Y09wUaqquq21dHKsYPbux536xp52Z9w2LQdH/aQKlGZS5xpwvak1ehbtIfKNLkKqDk5NCZdnP4K5SGWySyuA8iQw6aaSTmed5zHMz8zxXb6j5oJwCyqmgnGash1aJMu4oVcLTJTpN8v6o4/Syn8NiqRyekQSIHHmWVA7PONxoM8jCluWTqmtn1YTbu2yy3MrUVdYWzDn1NWFQzpSzSDJZP5MYsx5AzvpZ9o3pwkVS2dCx5TLcklw1nMlvWWDT6Mghn6kjL5LS5zOlvmqR+upsnCHvHDHshomTxjmBPRcnt+dxYZXogyMjfQ7zfK7lWHqebqLPB+UCUC4E5e+p9tHzbfXRi7D6qF6gixZI9D5DaemieGllsmWravpJ9Fj36/qaeF1fHH+8JP54afzxsvjj5fHHBfFHpuFa44+L3BsiWnPM42+yJiRSVXWZXSdNRnQ/KdGXY4jWG19K+EK7wuWs1WIxrHfTbd2cwF7Bhc2O5daJEWSfz2eeL2aer9DN4JWgXAXK1aBcY99j13uV1FdXStXEtRiTCr23S311lVQWr8PIolyXuloqg/9Amvdcyzxfxzz/g3m+Rtem60G5AZQbQbnJSVMtkPrqeqmauBmpJm5mnm9gnm9knm/Sa+IWUJaAshSUZam6F0mKu2Hz5j+ZUWo5lnvRqmO3SuSl7TMZvBUoEwU9lysWSuVyBc4wsVIM+/yMgYsd6d3K2DNhfr0lwam9FZTbQLkdlDs6Yt2tEsPmnzf3dEd1t4p5XsQ835pQe3eC8k9Q7gLlX6n1WWJrQnA3To/VG/RuOQNzD0JPbIN1MmFPriQrdGTpctmSLxX70mMRUrp8r0vzg3t74Y8fmxltvA9x/LhPYvzY3PaZDN79WOPH/Qulcnm/Te1qldJu3W1YIZVRvRvcKaevt0jp6wNI/pL1uPVAguV9EJSHQHkYlEe2eZu5OcA8mFDMR0F5DJTHQXnC2KmVha4HVq6Od+nV8ccn449PxR//HX98Ov74TPzx2fjjc2jrdc+LYeGp0I2OGud55vlJ5vmphMZ5AZQXQXkJFM1J7kGc+z2PCox2lHtgnlczzy8kzONfBmUNKK+A8qqTmde/pb56WaomXsOZxz8t9dUaqSz+ByeLz0h99YpUFl9HMlWvMc//YZ5fZ55f1fXpDVD+C8qboLzlpCaelfrqDamaeBupJt5mnv/LPL/JPL+l18T/QHkHlLWgvOvELrwnzv33Uzetc5T795jn/zHPzyVYtfdB+QCUdaB8aBxyVNt+5PvJ24EJka+PP37kYMiQU7P3pZpgvfmr4xK+0rE+klAzQw16WoVLJ4kS7Fb3eluTyI/dW5H42KIp5Co5UVyifB1bCuuTpLWZJVWST7SznBTlI6mv5IryqbkoiYmkivKp5faqO8c11zRVT6oM1YQa9MfFrS0rh9bVNjaFapsklMH8LV1TfHyzd+n0yv4755dv6ly0+JzDnr707MN23oPNynrm+SM7AnU//TNQPrcox13lc2aEq6rCVUObG+aGB1dVLWYFfsY8f97K9ebs5eQLUL60P/vvJ9XoX9g1Jd5Wu9ZhtZ2l1QW2LPdX8cevHVhuuaW81VKl/AonzviNGFbx/vaeg6n7/fq0Vmq+qn/4qNzU/QGp4mxAcpC+YZ43MM9fJ7gYG0HZBMq3oHznJJx2r1QZv3dpcPs+IZyWvchuz9too+dJRzQ3yMneYKfXy0Emj1NmSW7RNdRrzgLGOfnBqXPi3jL3j6D8BMrPoPyCt8z9o5Qm/7otl7l/ksrib9tumftnqQz+jmTxfmWef2Oef2eef9G16Q9Q9FWwzaA6aqofpL76Q6YmVIJTEyobrP2Ted7MfJO1GFQKqgKqCqrH2P9zr+oIW8XsQv7gstfVsmxwQ0No/iJZ+Rcnh5SFusQ9qEtdr2iVut9237s20Dlwcr6X6sxed5wc1ZvymqFEZcXHdzUba83wex3b9pZWu6XNSv4JU9YcnLLqrZ8jpUr6ZzJf5SKsjup5zF0oKz3JR1u1zXxobeaTqw+fzdaQm8eqfrHs8EtPLHACm8eFVaMPjnwKP8c/v4T5Jk/3KfJBDYBaAGrQ9vaQNhWVccKypJotX6q6CpFcsELmOcA8FzDPQb26ikAtBrUE1FInjV0mzv3wlrmqo1ZolWyF5DnshFS/ZYwKXsr83skY3lA7g9oF1K6gdrMf6JI6dKkW2Z1vyYiWOk6pdrZrqX0L4qFCtXv8sYfDfQHJUuhC7DoA/qvtujsSfrVdyEvch3Tdz94OJ13bpNhS+z3bp3o3groDqD1B7QVqb1D7gNoX1B1B3QnUfqDuDOouoO4K6m6g7g7qHg4Cb3l2lxLUHtugfhkb0j/+uKdri5hqf0E8Ut1LdnDsb7f28+O13yozw1H7t5VaKit6tuXacy93gxSUqbgB7jXQgF6mJZZkuDZrS246tZeUIgxEWYhSB+HA7s2FpTFYJx7TQLb9mOdBzPPeuse0D6j7grofqP/nJPf7iytl2oWrL3SU+/2Z530EuT8A1ANBPQjUgx1EelSvVBkPcakXHdIrRW4EiZywkZ5D3TMAhzrkIThTTosOww5BSIlgqu5wpCCZepiOLZfhwRhb5tvkD15gt7YLWm0ukp6pN74bGr1lU5Ls+LflY8ZXGRJ/HOpeTxgi99nQXg5Oy7R1mEVy1SbuVq1bdsmpQ6Q631CJJrCvaIPbxEvJl8vlMJTueKgOLGeiym2O/lItvkW+3FB1qFQuhzvIZVLZNgz5iBRNS/K8nB0xLakO2ymZlpHxx1HumZaRcp+N6uWsCc9eJFdtUqZlpBTWKBTToneakXJlkes0cmUZ7WSxUQJW6qsxKCt2bUoh15fG2rQrcjPEQ3SzKvXhcN2yyGV0nJPobNIMyNFJqYdihIZlVj92wxAsQ1yzO4ZgKiF4DwzBioTg/hgKtqfURqr5TgIQyUTvhVGRqoTgARiCPRKCB2II9koIHoQhOFtC8N4YgmW2NuyDIThXQvC+GIJ9EoL3wxDslxD8fxiC8yQE748hOF9C8AEYggMSgg/EEFwgIfggDMFBCcEHYwgulBB8CIbgIgnBKK5csYTgwzAEl0gIPhxDcKmE4MEYgsskBA/BENxJQvBQDMGdJQQPwxDcRUJwOYbgrhKCh2MI7iYheASG4O4SgkdiCO4hIXgUhuAdJASPxhDcU0LwGAzBvSQEj8UQ3FtC8DgMwX0kBI/HENxXQvARGJPuCRigR2JEJiZKRSbOwGidHSWyNwmjzJNdWF4wi5Y6l9wWEh0t9eEYPSgroxVTUCK3egh+hOwC1ziZOp/q2vKS7eY+SkrFH8AQPU1K9Ok2RUtSPq5wKwh8NIY1OwYD9FgM0OMwQKdjgB6PAVqBAXoCBmgIA3QGBmglBmgVBmgYA3QmBugsDNATMUCrMUD/hgE6GwO0BgN0DgZoLQZoHQZoPQboSRigDRigjRigTRigzRigczFAT8YAnYcBirJufgoG6KkYoKdhgJ6OAXoGBuiZGKDaWSioLSioZ6OgnoOCei4K6nkoqOejoF7ghH4gKeqFKHn9OwrqRSioF6OgXoKCeikK6mUoqJejoC5AQV2IgtqKgroIBXUxCuoVKKhXoqBehYJ6NQrqNSio16KgXoeC+g8U1OtRUG9AQb0RBfUmFNSbUVBvQUFdgoK6FAV1GQrqchTUFSioK1FQb0VBvQ0F9XYU1DtQUFehoN6JgvpPFNS7UFD/hYJ6NwrqPSio96Kg3oeCej8K6gMoqA/aRZXZ3qA9JLW/YTWK7IelZH+NUpuPiEWvW1he7gD1UZS8PoaC+jgK6hMoqKtRUJ9EQX0KBfXfKKhPo6A+g4L6LArqcyioz6OgvoCC+iIK6ksoqBoKKqCgvoyCugYF9RUU1FdRUF9DQf0PCurrKKhvoKD+FwX1TRTUt1BQ30ZB/R8K6jsoqGtRUN9FQX0PBfV9FNQPUFDXoaB+iIK6HgX1IxTUj1FQP0FB/RQF9TMU1M9R9k18gZLXL1FQv0JBxYmQfIOCugEFdSMK6iYU1G9RUL9DQf0eBfUHFNQfUVB/QkH9GQX1FxTUX1FQf0NB/R0F9Q8U1D9RUDdjoILEBVGOYAkOLMWBVXBgVRxYDw6sFwc2Gwc2Bwc2FwfWhwPrx4HNw4HNx4EN4MAW4MAGcWALcWCLcGCLcWBLcGBLcWDLcGA74cB2xoHtggPbFQe2Gw5sdxzYHjiwO+DA9sSB7YUD2xsHtg8ObF8c2B1xYHfCge2HA7szDuwuOLC74sDuhgO7Ow7sHjiw/XFg98SB3QsHdgAO7EAc2EE4sHvjwO6DA7svDux+OLD/hwO7Pw7sATiwB+LAHoQDezAO7CE4sIfiwB6GA3s4DuxgHNghOLBDcWCH4cCW48AOx4EdgQM7Egd2FA7saBzYMTiwY3Fgx+HAjseBPQIHdgIO7JE4sBNxYCfhwE7GgZ2CAzsVB/YoHNhpOLBH48AegwN7LA7scTiw03Fgj8eBrcCBPQEHNoQDOwMHthIHtgoHNowDOxMHdhYO7Ik4sNU4sH/DgZ2NA1uDAzsHB7YWB7YOB7YeB/YkHNgGHNhGHNgmHNhmHNi5OLAn48DOw4GdjwN7Cg7sqTiwp+HAno4DewYO7Jk4sGfhwLbgwJ6NA3sODuy5OLDn4cCejwN7AQ7shTiwf8eBvQgH9mIc2EtwYC/Fgb0MB/ZyHNgFOLALcWBbcWAX4cAuxoG9Agf2ShzYq3Bgr8aBvQYH9loc2OtwYP+BA3s9DuwNOLA34sDehAN7Mw7sLTiwS3Bgl+LALsOBXY4DuwIHdiUO7K04sLfhwN6OA3sHDuwqHNg7cWD/iQN7Fw7sv3Bg78aBvQcH9l4c2PtwYO/HgX0AB/ZBHNiHcGAfxoF9BAf2URzYx3BgH8eBfQIHdjUO7JM4sE/hwP4bB/ZpHNhncGCfxYF9Dgf2eRzYF3BgX8SBfQkHVsOBBRzYl3FgbfPZtkrBvtIqQS2vUhzhr8oIV77HqdDXcGD/gwP7Og7sGziw/8WBfRMH9i0c2LdxYP+HA/sODuxaHNh3cWDfw4F9Hwf2AxzYdTiwH+LArseB/QgH9mMc2E9wYD/Fgf0MB/ZzHNgvcGC/xIH9Cgf2axzYb3BgN+DAbrRLyyznBW+S8oLtMvcuXCQhW1kByga5XH4rlUvbNS8n/Dsp4UjxZKT5xw84sD/iwP6EA/szDuwvOLC/4sD+hgP7Ow7sHziwf+LA4tD8UhyaX4pD80txaH4pDs0vxaH5pTg0vxSH5pfi0PxSHJpfikPzS3FofikOzS/FofmlODS/FIfml+LQ/FIcml+KQ/NLi3BgcWh+KQ7NL8Wh+aU4NL8Uh+aX4tD8UhyaX4pD80txaH4pDs0vxaH5pTg0vxSH5pfi0PzS3hgXWwHFofmlODS/FIfml+LQ/FIcml+KQ/NLcWh+KQ7NL8Wh+aU4NL8Uh+aX4tD8UhyaX4pD80txaH4pDs0vHYQDi0PzS3FofikOzS/FofmlODS/FIfml+LQ/FLbNL9SqxP0IKk9VAfgCD9YSvgOOMIPkRLeE0f4oVLCe+EIP0xKeG8c4YdLCe+DI3ywlPC+OMKHSAnfEUf4UCnhO+EIHyYlvB+O8HIp4TvjCB8uJXwXHOEjpITviiN8pJTw3XCEj5ISvjuO8NFSwpFmJGPEsjds3rzJXKakud2y2zm58LE4FTpOqkKRFrNwKKkpDiU1xaGkpjiU1HQiDiwOJTXFoaSmOJTUFIeSmuJQUlMcSmqKQ0lNcSipKQ4lNcWhpKY4lNQUh5Ka4lBSUxxKaopDSU1xKKkpDiU1xaGkpjiU1BSHkpriUFJTHEpqikNJTXEoqSkOJTXFoaSmOJTUFIeSmuJQUlMcSmqKQ0lNG3BgcSipKQ4lNcWhpKY4lNQUh5Ka4lBSUxxKaopDSU1xKKkpDiU1xaGkpjiU1BSHkpriUFJTHEpqikNJTXEoqSkOJTXFoaSmOJTUFIeSmuJQUlMcSmqKQ0lNcSipKQ4lNcWhpKY4lNQUh5Ka4lBSUxxKatqKA4tDSU1xKKkpDiU1xaGkpjiU1BSHkpriUFJTHEpqikNJTXEoqSkOJTXFoaSmOJTUFIeSmuJQUlMcSmqKQ0lNcSipKQ4lNcWhpKY4lNQUh5Ka4lBSUxxKaopDSU1xKKkpDiU1xaGkpjiU1BSHkpriUFLTu3FgcSipKQ6FCMWhpKY4lNQUh5Ka4lBSUxxKaopDSU1xKKkpDiU1xaGkpjiU1BSHkpriUFJTHEpqikNJTXEoqSkOJTXFoaSmOJTUFIeSmuJQUlMcSmqKQ0lNcSipKQ4lNcWhpKY4lNR0DQ7sKziwr+LAvoYDi0MjTXFopCkOjTTFoZGmODTSFIdGmuLQSFMcGmmKQyNNcWikKQ6NNMWhkaY4NNIUh0aa4tBIUxwaaYpDI01xaKQpDo00xaGRpjg00hSHRpri0EhTHBppikMjTXFopCkOjTTFoZGmODTSdCMO7CYc2G9xYL/DgcXhaqY4XM0Uh6uZ4nA1UxyuZorD1UxxuJopDlczxeFqpjhczRSHq5nicDUrOFzNCg5Xs4LD1azgcDUrOFzNCg5Xs4JzvF3B4WpWcLiaFRyuZgWHq1nB4WpWcLiaFRyuZgWHq1nB4WpWcLiaFRyuZqUIBxaHq1nB4WpWcLiaFRyuZgWHq1nB4WpWcLiaFRyuZgWHq1nB4WpWcLiaFRyuZgWHq1nB4WpWeuPA4nA1KzhczQoOV7OCw9Ws4HA1KzhczQoOV7OCw9Ws4HA1KzhczQoOM5qCw9Ws4HA1KzhczQoOV7OCw9WsDMKBxeFqVnC4mhUcrmYFh6tZweFqVnC4mhUcrmblQBzYg3BgD8aBPQQH9lAc2MNwYA/HgR2MAzsEB3YoDuwwHNhyHNjhOLAjcGBH4sCOwoEdjQM7Bgd2LA7sOBxYHP5bBYf/VsHhv1Vw+G+ViTiwOPy3Cg7/rYLDf6vg8N8qOPy3Cg7/rYLDf6vg8N8qOPy3Cg7/rYLDf6vg8N8qOPy3Cg7/rYLDf6vg8N8qOPy3Cg7/rYLDf6vg8N8qOPy3Cg7/rYLDf6vg8N8qs1FutFRw+G8VHP5bBYf/VrHNfytzD8dOUqKlOHLHhefUNcwfVVvdtKjbWmXEbrvv0X/PvQYMHLT3Pvvu93/7H3DgQQcfcuhhhw8eMnRY+fARI0eNHjN23PgjJhw5cdLkKVOPmnb0McceN/34ihNCMyqrwjNnnVj9t9k1c2rr6k9qaGxqnnvyvPmnnHra6WecqZ2ltWhna+do52rnaedrF2gXan/XLtIu1i7RLtUu0y7XFmgLtVZtkbZYu0K7UrtKu1q7RrtWu077h3a9doN2o3aTdrN2i7ZEW6ot05ZrK7SV2q3abdrt2h3aKu1O7Z/aXdq/tLu1e7R7tfu0+7UHtAe1h7SHtUe0R7XHtMe1J7TV2pPaU9q/tae1Z7Rntee057UXtBe1lzRNA+1lbY32ivaq9pr2H+117Q3tv9qb2lva29r/tHe0tdq72nva+9oH2jrtQ2299pH2sfaJ9qn2mfa59oX2pfaV9rX2jbZB26ht0r7VvtO+137QftR+0n7WftF+1X7Tftf+0P7UNgPJAkKAUCAKEBWIB4gXSDaQHCC5QHxA/EDygOQDCQApABIEUgikCEgxkBIgpUDKgHQC0hlIFyBdgXQD0h1IDyA7AOkJpBeQ3kD6AOkLZEcgOwHpB2RnILsA2RXIbkB2B7IHkP5A9gSyF5ABQAYCGQRkbyD7ANkXyH5A/g/I/kAOAHIgkIOAHAzkECCHAjkMyOFABgMZAmQokGFAyoEMBzICyEggo4CMBjIGyFgg44CMB3IEkAlAjgQyEcgkIJOBTAEyFchRQKYBORrIMUCOBXIckOlAjgdSAeQEICEgM4BUAqkCEgYyE8gsICcCqQbyNyCzgdQAmQOkFkgdkHogJwFpANIIpAlIM5C5QE4GMg/IfCCnADkVyGlATgdyBpAzgZwFpAXI2UDOAXIukPOAnA/kAiAXAvk7kIuAXAzkEiCXArkMyOVAFgBZCKQVyCIgi4FcAeRKIFcBuRrINUCuBXIdkH8AuR7IDUBuBHITkJuB3AJkCZClQJYBWQ5kBZCVQG4FchuQ24HcAWQVkDuB/BPIXUD+BeRuIPcAuRfIfUDuB/IAkAeBPATkYSCPAHkUyGNAHgfyBJDVQJ4E8hSQfwN5GsgzQJ4F8hyQ54G8AORFIC8B0YAAkJeBrAHyCpBXgbwG5D9AXgfyBpD/AnkTyFtA3gbyPyDvAFkL5F0g7wF5H8gHQNYB+RDIeiAfAfkYyCdAPgXyGZDPgXwB5EsgXwH5Gsg3QDYA2QhkE5BvgXwH5HsgPwD5EchPQH4G8guQX4H8BuR3IH8A+RPIZqBZQAlQClQBqgL1APUCzQaaAzQXqA+oH2ge0HygAaAFQINAC4EWAS0GWgK0FGgZ0E5AOwPtArQr0G5AuwPtAXQHoD2B9gLaG2gfoH2B7gh0J6D9gO4MdBeguwLdDejuQPcA2h/onkD3AjoA6ECgg4DuDXQfoPsC3Q/o/wHdH+gBQA8EehDQg4EeAvRQoIcBPRzoYKBDgA4FOgxoOdDhQEcAHQl0FNDRQMcAHQt0HNDxQI8AOgHokUAnAp0EdDLQKUCnAj0K6DSgRwM9BuixQI8DOh3o8UArgJ4ANAR0BtBKoFVAw0BnAp0F9ESg1UD/BnQ20Bqgc4DWAq0DWg/0JKANQBuBNgFtBjoX6MlA5wGdD/QUoKcCPQ3o6UDPAHom0LOAtgA9G+g5QM8Feh7Q84FeAPRCoH8HehHQi4FeAvRSoJcBvRzoAqALgbYCXQR0MdArgF4J9CqgVwO9Bui1QK8D+g+g1wO9AeiNQG8CejPQW4AuAboU6DKgy4GuALoS6K1AbwN6O9A7gK4CeifQfwK9C+i/gN4N9B6g9wK9D+j9QB8A+iDQh4A+DPQRoI8CfQzo40CfALoa6JNAnwL6b6BPA30G6LNAnwP6PNAXgL4I9CWgGlAA+jLQNUBfAfoq0NeA/gfo60DfAPpfoG8CfQvo20D/B/QdoGuBvgv0PaDvA/0A6DqgHwJdD/QjoB8D/QTop0A/A/o50C+Afgn0K6BfA/0G6AagG4FuAvot0O+Afg/0B6A/Av0J6M9AfwH6K9DfgP4O9A+gfwLdDEoWKG37okFRQFFB8YDiBSUblBxQckHxgeIHJQ+UfFACoBSAEgSlEJQiUIpBKQGlFJQyUDqB0hmULqB0BaUbKN1B6QHKDqD0BKUXKL1B6QNKX1B2BGUnUPqBsjMou4Cyq77ur6/R6+vp+tq3vk6trynr67/6Wq2+rqqvgerrlfraor4OqK/Z6etr+lqYvm6lrzHp60H62o2+zqKviejrF/pag74uoMfw9Xi7HhvX49h6zFmPD+uxXD3uqsdI9XimHnvU44R6TE+Pv+mxMj2upceg9HiRHtvR4zB6zESPb+ixCD1uoM/x9fm4PnfW57n6nFSfP+pzPX1eps+h9PmOPjfR5xG6z6/757ovrfu9uo+q+5O676f7abpPpfs2t00MNzU31A4LNYXWZu2WRaiierzZObk+f15+oCBYWFRcUlrWqXOXrt2699ihZ6/effruuFO/nXfZdcGCtVllrS1LB1dWN3RqXfNK9pffv/TsrAULIj91Mf+0U+uahx/p/ebZe3euiv60S+uac8b80m3HcUcsjv60a+uaaz6477Q+1497P/rTbq1r9qIzb77+gXFHR386oHXNL8e9fOSG63fJiv50WOuaVm/BBa/RymeiPw02Z2JE65req/0zpq695tjoT8e2rlnlf23IYzfmHB/9abr5pxNa15ymNaz4s/D2T6I/zWhdQ6+6ZHbgqyJv9KdZZomN5p+aW9fkbJg7pfMLkyZHf9LOaV1z34mF4WdKO4djv51r8dv5rWuqdq2e4nvznbK1Wae13FY+r74h3NhYXVe7aEFysttJdhOE7SaotZugCj1LDXYT9LKbYKbdBHXpV4YmuwlCdhPMspugEb3Q1emXpVp0XWpCL0Mjep/GL8PJdhOcmH62tRd6luag97gm9ATV6O0wC73hQugS6tGHLNvtMBe9lprQO5DtdqhBHx/SUFvxvco0HKd7oUuYi67eDelnNarSr0+noRuahi7cnuiFLkc3ArartRm9A+Grt+2WPjH9ymB7OmB7jKtBT5CGsyx8rxJ/UEzDEQh/fMCfcODX0kz0Qjej9+ntIZizPcSMbTsnWdGI/mLzAoF2e+uar5sL9nsNeteszaq0Cz0BfbwNpZ8S2dbryvSrJfzAUng7MNv4QZnK9MsSfkCjDl1b8dfVmtHLgK8a1dtBw52MXmj8OSX+XCYz7KZHMMB2lmanX+hqFLptTcOwTxrGTdMwS7b7wzx0y/eX9Mj2QG/pZnTlwx8f+tpNcOx2EJm17cLZdrAqMt4MRi1lgggyCabbDo6tzQq2vr1LaMt5rorKujn1oabqGTXhirqGUKX+z9xwQxtUxckNofr6cIP+dcuyoXW1jU2LWpYPq24IVzbRlhWjapvCs8INS6bsPSipQJKYnthKf1Z5Yvose/LLW5YODdXULPTHcFZODNfohZ4btlmSLDOCYhfhjra8VIWaQkPr6ufHilTO5okBb895IOWcl7uQ86WTmurqF7ZycprQRkOXDa8O1yQ/FrxDYsJhkglzlrfvrm+5fXhdQ7h6Vm1bTV2h6/UpTeHKijnVjZUV7So+NKbhR2xR8Knt+t0WEF7VfrJwcFVVW/+JZZ3z+7DWluWTqufU14Tbs2j8XyQ7rW/3qm6sCM8LVzY3tfWi6tqKhrDepdq7WP2Jocbw9tCjUtUmYkZQ3elJQ9k8MeB6T2LVM/7ASm1ZMq5urkHDY5+198T8yBdRlWA/TbVOhqVcJ8TcRw11YOwq/dq7Sn3D3IrqxvKoxo6qnRjT1wlt6rowsTvEsRdGu0Asm7dMGcj/npq/t670uIRor7p1bnX45IrauqbwWvLGNu49U1PsPVMjutTZ3N4ee0iKGcHrTi8azeaJATf2otHxB0YBuJ1odOIbJfpmTOIbNfpmbKSyehk73jgW3vBmPAtveHMEC294M4EtreHNkWzhDW8mxt9kG99Mir/JMb6ZHH+Ta3wzJf7GZ25Uv71GHWdGyLOHkGs2JH4WLHGwZ5p/f/v9T3bIz0pMWO60u0TSD3fq/kXSj0jR8Iy0l54mph9lL70adZkSOltO3BDePqS6NtTGtdB0RP0VsZ+X6KZ8i6WOfRezvKtG1Va160CCxuXYrRuj6HhHiQk355e2LB1bF6pqZbsV85U8Ym4ccZmu+A1hQ+0wn21teQktlYvRUrkutZRPWM7EmvNJ1JwFok+u5nwZeR1cnmkI89kaZLJSHkVzeaXKE1okTqJ8J4kCThIVCLshJ1HQiaRCJ4mKnCQqdpKoRJgowbKWxi2mSXHK7A7TsraZkcC1zqV2rXNCwcoEBetkD9tnv2Cd+AUra0k1YtDJpYGrs1lRSlkpJkPVmS0FB7STFWhcZdmZ+N3tE/HmppqKWeGm8fokt7G15daR4VD94IaG0HxGcCfCnVyXtbYsa/98YfzBEKHKJZbT77VZRfwZO3/uz32jct/4rAuVl2X9ez7n9wDn9wLO70HO74Wc34s4vxdzfi/J4gQMR3B+H24z8DiCW6P+tsaziMGIApUW3+9v0hj2ZZarb9szkbUVJdp5axmfkvqxrRblUycYaa/ASFN0Iy2YG3hdMrHUbA293LFYYbNmMr5KPPjKEaaYhSkCtzMD+NcAZMahrZVHKnACRpimVJR9lM8i5SMq7CMHURUgjjQhquwjBzFHgFhuQsyRmEjmChBHiYIyuSmHQj02ZnSUlZKYq3z20ZSrgL1ceW3M/igrJTFXBeyjKVdBe7nKtjFTpKyUxFwVso+mXBXZy1WOjVklZaUk5qqYfZSfdDKYfhNmCfsYWV1ZGZ96MAJZRyPxQ3a6EvHyTLXGIgy0P4/0xL3XhDfZ8TdLRzfPqV+oXcSdFK0cq/uvk08M1RqryGOYr7aBjJrJTnuAVEexLxWtksqULIu7CkVSXpDz23e+PHznS3HJ+fIIhzXTYgCTNVGIzo75zxFG/ZKNohnADKA4WOx6HlPdieHjLoLHjORt3O7KMZLUYHJNRtIDpCyKvcqGQ6qk5pCKjIvZffSwjxxErwDR7D562UcOYrYA0ew+ZrOP8pqliJw/h06uInLdDG6u/AqMInK8fBK9Kk+IaXab8thHeWdaEblNBmeag+kXYqomTD/7KNjMJbP8NFzspSQHCImmCDIA1WaAAlsANaLpgAxA2AxQaAugSuT6ywD0MgOU2AJoMgOU2gKoE60myQDMEi17yACYdnt0Fri7XeyNcqX23d0ufHe3s0vubhdzv+/MdXe7slkzeQRd2f7PEdfVLK6rwMnoKuFBO4cMuA9Z4D5k0H3IQvchi9yHLHEfsrRDFLysQyhRSYeoS7VD5LJTh1D1Egy9NM/NKJC8lM8HlHE3SZOU48ll9kfyQGJ2AmzOuKM8m7H99uFn7PYbN5163HWDzrexNyrgZG8U4xqkGv4uMe7pVtgx1PBGNddi5I2HFd6+8x3InSJXXjJndmqRkWJS9EDSOI64YZZObggZ9pWrbH/gnwTxmOPRscccQQwzT7C47DUvw8ceLbbexh7zzR0x9phtjo7HHk1BIWa27Y8dZ+OEWZaXn9QcqmnkLIINtw4IdYnp0EM24jdefkRIJn6TI0Ac6VZkxMuPCDmMi3j5ESGZqEi+FSKjhk4iGAVCzCSLefJLcV6D0REtxckvenlZ50K46MXBLBVimiNCpewjzw6bToCodtd3ov3pUe4+S4+NHYFl8Z5msrSGxT9egcrwCtQpaYEs9k12ind00a5JD7dAnfAK5ElaoDJzgTxxO2MqUJl5CDIXyINXoBwnBcqJmzlRgXK5BcrZli2Ua9VCjJU1FSnXPPymWRtZHnBijLyoSPkdsZWCwiIVdMRWKhIWqbAjtpJfWKSSbdFKStIi5SRZ8hGtIpdyl2xHxJdsLfemzI5leQ137Ld03z0i910HrmXc90R/pxObUXmPo5MgiEHZzwR7kQxLIFznwLLE2aISdwbSHCvxa1wN86aoYT6+hnVOqmGixQULJ64Lq4i8AnXGK1CXpAWyCHR1EThxhjgkr0BdtmULdRW0ULmwQDkdr4VGCQuU24FaSOTEdZXxeNKvjUROXFcZjyeNWymYZDWuA7ZSUZL1jG3QSl4nQQWv0InrZHbizP7ICO4e3xG8Pb6R99mJKwaM02aowJz4B4bfc+O12C4JyP1R5yfyxhvHiBYvMbHXOnc5ibnjniKOAiYmyE2SwGfcvJcohtm4F00A5O5o7Ddx0SS26CK3ZPJRzoRyet8lPWNB9lj6aJ6jgjj1qXDalHXlEtNQU4mygUDiqkYsJzZpK1TJZlHiCQySfRwt88ezFtWyFxJqJSeOkaBl/vgn1jqQmDtfEqXxJybwJ0mQZ6llPkZJE9okD8gzPPXy2N13E62xlzmtrLikz/nPPHjEup/r+yXX5xQF3bPvHgfmT+t3VlJBrW/3nRVuqqhvnlFTXVkxOzy/sSJUW1VRH2poqg7VVITaz+euzXpoG1OUjU2RomxsByT4S0bdVyyg7jO8KefO2YZzJz8j2EHU8GYkOzAb3oxih1fDm9HcOckY1rkXUKRI1fCwlDlScsw8YeyapjU3Z4TnYMKWTjRG70ODa6smtPegyAH3a1ylHfBw33i5b7K5b3K4b3IFxAfcA/zXOD2+7+b/ZCgbecfK8mztRp1gBsi3BdCc6r7oGdt8X3R1qvuiKxH2RRfbApid6sbqcKobq+enurG6MfWN1cv4O5gd7g3vkuru9K62ABrMAN1S3Z3ePdUt/j1sAcw0A+yQ6kGLnrYATjUD9LIFcHqi69I77vWZoPvYG6AH2t/X14e/d6+3Szv0+5iDFr3jnnJCbfRls2YKZ/RlRyKOuL5mcX0FyyB92bHJdciA+5AF7kMG3YcsdB+yyH3IYvchS9yHLHUfsqxDNE8n9yE7uw/ZpUPUZdcOoerdOoRxK+sQSlTyV1Wi7h2iQ/boEMata4eoyx06hANT2CFaPL9DjOMdY9Dt2SFUvXuHgOwYY09Zh4DsJY7syhCGmSO7kvd6EIu9gIq2LOVDjXsnhhIKBIGVoF1s24GVYGJ2gmzOuEGXoOQi5kXTyy8v6lzwHU83LCjeg7xl5vgAJYzUpMrMN4C7p6aQe2AyyD0wWRRZ6NPuFAXYJTNmpxIZKaYuFpQYRsUtI4KkziBNhzAL2D7GP4SpCg4+ig5Tig5o+gQHNEWHPkUHLUWHNzkHLaN7V1zfvqRt37uXtOjmpdY7q8Jtl4nWNYYrTqyubVqbVbqNN0EMT3ETxPDtcBNEvqNNEKmWYljKxJrUvNFAZcESTyuobMGikpZOGTjIzJ3K1l9kkXtVe9/Y8p8j6hczHyyZ1DzD0jRaVBKNuj/FA7Pe7Pn+vvN3L9uv7oi5574/edUZJUt2/bSg8zfNB8/9ZW0dX55nybjmGk6p+GZaEZnUaHddWdMU7aidtr+OqtpVr1QVVKKjqoKBjemovENPw6y7sOHm4FQNVjn6FaR8VY9sMuVotAW9QVFkhA0K+mtsPOPAtiOUim5dcMSWbOipUSECxyraKx9u2144Ozy/Ym6oplpXprYrhBvCJzWHG5varvrYtv10RIr9dMRfqp8GBP2Ut6sw9aG2HH2oNe7p623Y0zcmPH9qTHEntuttq5Mte8Krtlud3FckRLQz57EaTN/esbauqXrm/Ira5pqa6pnV4aotdxVX1G25cbziZH26VR9u2PYXfyOMtGlzZfFQy2li4pXF5fEH0YU8Uv3cZPNj0FELIBhWttIUJMvcmw0DoKE3Pxa/Ebxdn8dH1bntUrIFCxa5e1HYIlvXVLUVN9rfljeEaqvq5ly/jbvTsBS707CUFSTLBQVJ2p2MHtMW1fYbh7ChbjqhQ9GdUIPSP9Su9HOqGyvbhrCJWzTL5rboBQtiI0GfyEhQ2RAONfHGgd23v/MhNm8RTv30goTiGshfjOPAmPgD4jjAv0Ml1VFwRMr1p5iDpPzVEZvnQlT7qyN+/AuqLQjhmYAon26CtxTh5y5FRI/09rDDMBg7YzuaS08zJoK7S8oDx1h8z2LrxNd32q7D672T0EKKmBETbpl9JNG5G9o+QrW7dldtpTtgPdZ3qOYqTo5iXeX4+JP1raSKDRf0nrZITWO4tircUDGzrqGiKTSr8YZtPKyXpzisl3dYfzRP4I/yVjxSD7YM3brBlofjPVhXvklbdE9/P1nXvNRCIvyzh3HH9u4GHWVuuKKyrcANoerapsa1vqe3scKfmqLCnxpRn64pe1M5KftMPMWvYvNk8j3MnmoV11MNcz3VmVxPdRaXkuRErv9SzfVf/sb1OaMcagfzRjrFPNLRFv5OFJs9uSblnlwgIJ3lOZAq14H0RDlhvOekbFFrUq6dgiTz6YROONTW8TcTJ+8wyW1jWYkJy+2VKi8x/XB76U3B3BF2azUh/UinY20k/agUje9op4sxllNpcXr/sWNNQYix9uT7E9OPiypO50E7H1B/9Ssla3fp887hq+/Yc3GX73c8eO2DI2/e+OsLP1tU3HhJjTNxWx7BJCTn9Gm8KvdSMu6ps/vfm+d76vPBNw4ZCi+de1HPgjtuTEw4IZpwt4NzNy676Izzsj5Y8eVlP+726OH9C3cYXLjn69f9t1ttw7FdNiYmPNLWuqSppBMd7umMJJ8kvaMzIeFkh+fTI8mnODzSG0k+1eHx+kjyoxweaY4kn+bwZHwk+dEOz0NHkh/jkJsgkvxYh9wIkeTH2Uo+JzH5dIcn8iPJj3d4Hj+SvMLhYfpI8hMc8hFEkocccgFEks9weIg9krzS3hH2aJhCuIl8fwl7leAf+gUxyXx7w8U6+zHJfH5M0m93rJW/NsIvcGtt7oD/wNm9L/nmjfPMu/a4mwU3bAHb7PJXWhTwomaxL4KcG3EN25bNO4SCw1NVGpIlZotxcNt4QKDRNs8g9HZyBkHqYqZUNDpopVp8jba5M79Xy8ohNaHK2UPq5rWsmFw3MVRVPY+9zYZtaabUjDimIVOd8/USaYdkBzVdCRSbDLT3s6PsdgqfYRZv7hTgPSkCfYyoNRwpd1Cg3EXoyl0kd4gmFeUuEh/VSBRb7Kpyey2Vu4gVxzRkqiuMhwtU02TTmMGrXbdmchfhnKmtH7wVEehqkeF0pLYiL6MQXW0L8b2MQnteRpGrapttqbaFlhocNGcm215mTuAGLEeaFZrR4HbdauY6TBy19YrVNgDecRHoeSJvznW13aauhB/PlfBvNVeC2nAlUt/pd5a82hpuFIwcMjuXe9GdM731gfegKPYFoqUNR4rrEyhuAF1xA3zF9bmkuBbTK59AcYOuKq5iqbgBSx32p7y6cBN3IWqkYPNLdlS5FvGqMJujuFSsuNng3TWKfaVoVc+R4ma7t0Wqt6tbpLJdUlyLLVLZ7oUjkiiuaqm4fksd9qW8qLVaXnENu8EiynULrwq9zhTXC95OUexlqRwmNNdLQtCerik+vtm7dHpl/53zyzd1Llp8zmFPX3r2YTvvERW/MmUnLMidGGZZq31WotpnGWxFZC30MuN6KfNNlsDWFJmOfPqsJkXWp0PZwTbZ6VCf8XSowdxxE3mNRzx9rMLYGDZtWh/FVevjw7M+zLApmnTy76meZCsEGjd1ZkDG0NhwxAPoDRPAd8QDQkecT2sSELJXZLtPiOHlutEkZaPmoGmy+U3jdalpsoV9xlF7yrcKs9c0PrLfqRu0pupJlaGaUIP+uIj1nyjbo9j/BKmNAnrjOxYSr0XMljK68dl8bO+AweGxmseXRYfHV0V3ZPtshGAKBTrtYz8T3Efu5078xFOQRHl+w6SSL8/rkjyvRJWlcEk7f7g1HTP3xbeGclMVmlJlx1Nx9VZX/rYNlVZl5hL/RfNnSJgd3/1h4ThqH8YcpAW2YANi2I9jsIuk3Zcc9pGbKNuYyMAUZA5bS+45KRR0d6Njls2KTjX4WZw44hTH3dOEN6Vs1dt2g4tizXGlvBuczUpPeMdYrTKrmbT2U9TifcedKh3J3VI6jDsFGBa7QMpiB3a25B4uImXcrcqa3bJkfB3HxQ+09Q8ucNEWNYqVgjXQCbMGZiEmEJk1JH4SMJVZur8Ylnn4NsuYKMBqEjfRljHesmoKuTowUUB+kcO0tVnFKJC3Yh/wuRZSp1Gi9l03le+6UZdcN1W4pZnvVatCFzhHVFsym3CONQPk2AI4RbxAlxygv3hhOjnAdJFZlwEYLFrLlQGoNwPYuyHH4oIbezfkWNzNYu+GnLlmAHs35FicUrR3Q84AM4C9G3J2TexFXQU2pZvdE7i2bUo3vk3p6pJN6Wa2KV25NqU7mzWTTenOGhCOuO5mcd0FXn/3+IZetwAZG+VyHkNuA05zG3Cq+7UYdDuP090GrHC/0IVu53Gy+3ksSnv1Tv/+cpz7zVL816vFo9K3t2DV4fFpX+RpaW+3p3aAgaDkr2ggJqevmcVS7hPSHhDBQS5N+2ZxXROPTvuBoCLt63BK2o8srhf5mPQtcuyxLO3b+di0b5b092Qr0t5mT03fVl6J5oMdk/bNMv0v5HbGHju5nccZ7uexs9t5rHQ/j11srFgx0WVOohzhMpeB4epOhou1pm7WggWLE9mrIumGWtPIqcM534+y/j6HLLbgwNrfRA/HvhxuSQvHYZQjseXNVSmfVylKDN8XRUvnYFNtoZNNtcwqY4n0wnOQfRSsrRsSFUolKjTu6yiKP3pFy29StV1q3r0Rq6GEN53YfNtuiRIn+zqKWOmmDSiMsTEvuhcBeTqmlavd2NmRE38TxV0jaDTR3rvixM0ZTEELhZszSjibM4pNOy9KGUjO5gz2cGKyzRkJmlsq1UdKuOpezE+UY9ycUcRKcrI5I8g0l+XmjNdiH7zK2DHLT99I+bxxVuxaukjWCQvF39ekCjaGx7efvOMQIchHEG0tzkHfWpyDv7U4R7jhlz825GztXd8B0TZgv42NxdkCeX72MxvnwrapKmRvFVVA3mXOtIrULvMcB7vMvQKx5r3GXvZRvsoYhu9ERMPGWf6uSFHjhV96YoHFwaAkSdXoAyJRjacDEtXwN8sGzbahUMK82TwAUCihYs4hc9yH9CMevXGgQNvm6E3AyWzY8hTNvRPqGsPVVXW1gyaEG+Y0N4XartRqZccclTUfqpPjM6McHp/J4e4SzhVco5DAMKfaVYHINCl7HXf09fAqIVdo3U1anct2FDyvz9NRvL7spFqd65ZW57BanYuh1c4OmPz50307WzR4kqQ0+oB414oDLUqTu1YYq8lkTXTy1uv+Yd5s1yBjsQfX82jLCG1T9fFuFfWRr2BnRsjPGqGA6sTomY1QLvvo2Ajtgnj23IEqdNiz5173oxDuBTaSWRLnebRlSbap+ni3ivrIV7AzSxJgLUlQtWHuBJbEbxguXSaV87o37XeXVM6LN+1n2haZVI4ZBJyQyqXYtrnp2ra5eG2bu9Xa1m+rbXmra+nGLKbieXSqoGlsM4vZcbqZcvP9hyiTLdCwcEjNczZK8+JvHPYwg2NjXoErBFop4DOLlqSa2zpc0rIIxnBLTl7PdzFoi1uGciV92l0zPq0rPm1uxqdNOsxtU/XJTTOfNncr+7S5Tn1aWUuyW2YRy5VFrFz3l4fcWxdLZklSWRXDc5g9HcVhTr6EVeiWJQmylqRQtWHuBJYkIJxBBfFmUNv0pgC3FKLQ3gyqaCvMoKRvCsjcAmG7bbfeLRABW22LF6V0lzAeMUopCkrZJoy343Qz5eb7D4HYxO8+4ZCa52yU5iQq4kxTDY6N1ZZneo/E7Pghbus4mR0HwPNKDPpR0TBlZ+ATrRiqgqZzcU5U2FHmRLnu9aAgZg96sUP0oOcRozTuqtTWidKktUq92SFU6g0Jo/yO20b5nhj0eyajjLBA7BW4Nap708tCV6eXKt70UnVvPSZoS435zWDwPKPK8ZW5KYskepDFBYFFSXtQMUeViwzd0KTMxUC/QAx4uatSHeN6UVSV+qVDqNRPEkb5D27rODHKQfBcGYVWskSHLXJtHN/wCoxyLvuZQJ7fJXl+SXlbu3yqS/JUSXkBl+QFtmX5ErqHR2BxbYYHNtm3uF6+xfW4ZHEt6srjnhu80Zkb7BW4wd6YMenREdxgpVtyi6v05rZO8uvGCiyvG/NcGAPfUaS5MjzLwZQvwl7HPTjiSfHgyCb+wZGY3+6xoQlBtoziY1up3i/+IbdSgniVUuCkUgoM7YVaKeu5lVKQvpqCXSkfZTTF/PdxRlPMf59kNMX892lGU8x/n2U0xfz3eUZTzH9fZDTF/PdlRlPMf19lNMX893VGU8x/32Q0xfy3IaMp5r+N26Om4J3KcxBk3Dan8gqcbERNvg++yMnR8mLJA6GrBpdPGjho//Layob59U2L2V6kbWTbOsiGANn/FGsbLfa/24rGbRQdIZMBCHC1Pd1WFQu2ivo53UbvMMC8lXfm+zOQGcgMZAbSLiQep5GDQWLbcBol91HcOmGjpujYyPgoftYRCQb5/gri6fXOf8HT651cOr1ewL6LLu6+be7FBRIuSoEjZecsRhcYlN9iA5DyZmJZFNdUirirUgqeSimuqRRBValPOoRKfSSxreILtwkRTolBf52y3nYSFMA09jJKFM3BJl7hlOR7RjwWxVPAc2IM/PuU4zY2iqewJY3m4OcUtsR4rLfETI2B/5Zy8Xo6JHnTGz5LvmaYWxkiWVezePWS66xecsEzLgau2NFJU9a4m+rznGUtDzyHx8AtWPXy7TXZofKFyzMXLt/+SQVh4QLg2TsGHkzZyZguX7h8c+G4N6MWOCtcAXj6xcA7pbx97DT5wgXMhetmfzuzsHBB8HSJge+QcsjsOvnCFZgL14c7yXBWuELw5MXAd0p5x/3D8oULmgu3q93dmEkKVwTq5hj4HimfiX5bvnCF5sINsLu5P0nhikH9Nga+t7lwxfYK97N84YrMhfs/XuFKnBWuBNSPY+AHIm7S9nXATdqmk5tM1kSHFeyQ+/jlzj/kug+Z5z5kvvuQAfchC9yHDLoPWeg+ZJGdaIHNGFDQfv9W8aMFqjBaYFotZrImOpHqc+l8jDdu3zOAGcAMYAbQEjBV25ybPKSnnpxCWEi1DAupD8fAT0m5CB6ua+rgFlfVyS2uTHmzuVunlBS3TgX5W6fUpFunPILVlrFmBfOwZVuW4gjsavsoaO2j4rWP4qR9YonK7bZPx+4/qRYnf1v0QE/SFracTq6UcypT74P87Y/boA/mpFycANrZ1pSsrNfKyrLqh9rGGTubmp0dkcTO8gurLJ8YbmpuqE2uFxFRY1iYxKuyWaqJyFXZNvYu++wqje25uQ9/77JP6A/zY2++rR0oy3YNMtkUwXkebXEwb1P1yd0q6iNfwc44mH0sB7PfDmGKgINZ5n5knzBizVvCNifyGayT6NI17n2mW7JibdKkjeQoNhs2F+C9caNutfyu/i82iHy/LdzF3KQDlaPr+vKsbARTJyYrkcc2urye0ngT8QdFr8yWEz22wNWhkiXjmmvi/y2S0KFSc16LJbSojKNFpQZba9KjMlC/YPSIA95JGGfm5cicqBObr8ReWcY+JjoUTDHKIg4Ft9KLjB23hEXhLS86VJASZuWSm59ioxLI3OFdYsXullwJSjlKUCJWglJQf0quBGVOlMBCm8sM1ZegBKUGDUlQArYlkylBoVEJilkU+eNcUkpQzKzNC5TSoAQynKLFVrvwkysBb6m8WKwEJeBRkytBqRMlsNDmUkP1JShBiUFDEpSAbclkShA0KkERiyK/X15KCYqY3ScCpTQoQYGEEhQJT9GmwvTot9wM4ilMrgQlTpTAQptLDNWXoATFBg1JUAK2JZMpQYFRCQyXC8iftJBSgkJmf5VAKQ1KIHORtfjUcCrkc37L7U6eHZIrQbETJSgSOjeFJiUoMmhIghKwLZlMCQJGJTDcvyh/RkdKCYLMDkKBUhqUIF9CCYLCPfqp3B3ot97Qt3tyJShyogSFQucmaFKCQoOGJCgB25LJlCDfqAQFLIr86QQpJShg9sgKlNKgBHkSSmCRn3wJJZA4L+G33rK6f3IlKHSiBEGhc1MgImEPmpSAbclkSpBnVIIAiyJ/OkZKCQLMLnBBfgxKIBNmyBeuw1C7O87zxUoQAE95ciUocKIEAeG4li++xStRCZhiBJIpQa5RCfJYFPnAhJQS5DHnHAT5MSiB6kwJFCfRFYP5SKzwPEM5+BWel6zCVW4wLd9GVE+qwnMlzrwIthJQW8FOQd3JhDtznZlz3sGYXHFPzgPPdPygIenMDxrmJQ0aWpiEvKRNUyB0jXKFBxO9Nto75aBhXvJzanlOAv+KVa0JdNPQ2kkzEpE+PIUxJi/pGFMnoZm5eJoZSKqZlkrmwM0xHIoVXWGs2GhtKc1UBAdEA8kPiOY5ief7bWqm4crfv4qFokIL5bdRt1J64JeyUF/Y0GnFyegZlB49sXbKuM9v5yAAUijUg6KtOVJ52KIkvWSg0MlIFUxSAcJ5H9Z+nEK+HhQm1QPLJnUQDS0S6kExWw8OIlbD7QYJDVyNlkHCpY6ChF4nfcRQemGQkKciATwVSW4qip2YipIkC8EmFTGE011f3jDtJGS03eRLmc2I4HYoJ5OxgM3hxBA5QHIvU9ORrT6cBJyEu4bbDTMHxGZEDzM/6SjMnFxFxGHmgDjMzFMRP56KBJyMNAHUkabQ/QUy/gwkKNgUGZC4+XPJpOYZ9oOiQXOyQLwkvOLfGVX28pOaQzWNnC1fAWuFfyOmAz/ZnUYnGZT1afRbjuL1uU4MbqFoUJYyuN4Ue1PvDuW3BWzkxO+kQYqkGyTpUGwj5OPcgfxcIuRTiKciXicq4k1RRYLOVCTlJSj+PfZ+Z4bTwt76kxrOoJzh5KxF/pzccPqduSF+8PyW3HAGXdqTHRS5IVIBMBWvV6Shp+p3dSTzC3OSpEGSdk8bhtOxy+zNkzCcQTwVUZ2oiJqiigScqYjzGGnUcFZHnrSVNg4tZDsJiAoPLTg8PaFKKCLPaDL5KbA0mt4dtsIZhHV8RfQ7CdYnd63EO618wkWbrbqcGFVS7RYb6u9LWv5sq0oTqGY2+yifEUXGy+Copl+smgHwDpBQTS+eaiafzbvFAW7YyCfiZs+20d5Sqplt9qhXJjqe2iJXu6ZP2DXN13772Ec7vnXyDh1MPnwXWPqx3iESqpmNp5rbxMMTD98+G+3t5aqmgcMq4V02W5SIap5ro2s6mpAHRappb0JuVRBvCnt+C6w9y8kSqunDU81tErVxb0oupZqme5R8bFHaVbPZ1Z4pnvH4HM14LBd/k/dniSMJBZbBIu9MCc0M4GlmkZNFvqIUF/kKhYt8fidO3yiB9vkFC3nR800zbSiEo+1RQs007AaQz4gHVTPnSWim/y+lmXZ2KEhppmhtKKqZRyUIjcBmJ4ZmGIYVQ2vlxD8w/J4bb7JISMB7cVQxI2+8cYxotSQm9lrnLicxdzm8hokCJibITZLAZ9TrRDHZcZ2OJgDvBTEymOF6Yapn1bbp3hUPhU5pCldWzKlurKyYFW6aGKqtqpuzZav3wpZV48Jz6hrm63lr0KUxjvTCluWTqufU14Tbd4gvWBCFTmTQiEgnTL/Ybx9+v7j4UNhtZPYSfblrckOofmFrPH20OlwS9NE5GybVNU2cllxQqhzS2WafNSIiS7BsSs3dJpJqnLVCiCiTvDEz86s8ZZKHzRf3BIC3bb2ATRRBnsRPkm08FeFh88lN5FnevrRgUY3DRLkziIpNf8dbmHwPeFfFTMHSlK8EcdbsXvuN64k2bk5f+cZVWek8rqojY9Vx/zaqDppO1TGRqQ6uxuVwj/yoqV71OlnEiSQDcGKqd8WeZAbIswUwz+LaFrl7crKo5SVF2dNjjfI4v1EUk/GgcePBmwdG0twyZaBl17CMTj4VVT7fvSLSPJmqauaGHknKN6gcat2tRNxYBXxurIBL3FjikximaBeTNVHkPteG08rMuUWQPtcgI++muQ04uQMU+hi3Aae7DRhK32aJvJuRaed0bOfKtFeco9wGPD7tbeIJad8o09O+UdLfIh6V9np4XNq38vS073qu62GF24BT0r7Iaex0ul7klWjeTfq3c0dwOvP+eh7YMRn/Jv1GvvTvfFPSPocnuG8e/O5DKmnfMBXuD/g2AqQ58UevdeT1GFE8WyoSOJi7xkVEkWpJbNshTr/w+gZu+NMvueI45saKLv3uHfqqje0dyXen5QljpqnGiQ/hbnzIM75RzbUYeeNhhUcvbjlHtI4gmTM7tchI2coXwSJcqkudQUbXuRmVZvqtae03ku5I7rJd7Hbn7PdSXeqosHOLjM3VhoH27UAA/xYZ0SZD01JHAZs1EaNQro2VlQKBshWwSuIWZLJZp1PAyW4DTnUb8Fi3Aae4DXiM24DHpb3aHOV+X1HczuMJ7ufR73YeK9wGDKW9gZjRAcys6z16etq3c2XaK84x6WsgsIrsutoc/9ezN6GMW5cZTLdX5Xa9Px+dvkWOPeb9FX2cPPcHfGfxTM5O0ndSjmfugxjP3Cft4pn/+qLmtN5Z/VZjxzO9gnimzWDQAFfjmQEX45kDMvHMrRLPnCg4QK4yEU0+O4JHQNyRHT0zxDlHplh34uzlZtosRusTT3JlQ/a3iUoZ6/2yViKm6JYJTMfRlHgCg2Rf/APD7wyFS7RSv0molZw4RsLpOn/8E8vc+RJzx+U+iQImJvAnSZBnebouJibX1CZ5kP0F70iax27QOFpj33FaWXHrDFzOhHJ63yU90Q/bdXs0/Mpha79Y6+CwXba9yrMYI3KYtYiBErVvYy3Cpn+w2f4Ynou/FpFrb8i1eQ37n8z95Csm100MVVXPu8LaeLKltrLqOQKGZ97o7YsdyHlAtEolWZRUtfMPLuXaSO6INSlqDnK4080czhl3lS2q2efNgZwYj3dOQDTkxcwAz9/O4R7p9PDVzkQ0mS3hZ/isqCatSpxtUWIf5JQmJ5v0Jb+GSbEG75ycbNIv7G28HAmdwFwxPVLi/V5s50p2v5ePe4sd5SfawjwaV1/WlvGSJFzcZiCv4B8JNmYuh5XE6ynmiox1wVGCQ6E5TCc0GQGbnA8eblfPEjinplXhmPt0hPWoIjojqzo5D24w1YIb4QyNYiAMlG1JVUrN+JIEiajAUPGjCYmnyB1IkquIjKSMpIykjKSOLMkUelXivsCS8XVGBzyerO2cfaKrwlCP0YirkvgJew9eMm9G4bCBTBBxlRgcE6+TejM4pWbvIcp/oF77Kb2n8svPKnb6241znl1fde/Z+w76cejptyijfy8/q/WSYdKEKpQVLdAIXsmypflUPE50z8B4LOsSONJyudE9IykjKSMpIylNJPGpakzDJxuisRo+memjhzN8eswjrIPyqNI3hGen6K1YkCgp0QE0OGvqtZs2N95Nijf88uBb148+4diJ9x9y4i93dp//2FF7jW8tEmWSVzLhpJVXMlVakteJ9qlSkrwu6LncUJ2RlJGUkZSR5L4k01jo5Y6FXlfHQm+ysdDrZMRQuCOGfM0Z7n03jYU0Ohbu1jj+kUGVgzfcfJ0Sers47/VT+z0w8tJnX6v9Co449MF5e3cVZdLBFI8/FjqaJnu2WnxZfqh21DkykjKSMpIykpIMayp3WFNdHdbUZMOa6iy+5+pEiAqGtbwbb3/u3OkTXjtvz92Uk54d1rPk+PwH9zyn35Xdd9q0fv3u6rEuRy49LgzYipROKC7ESB0F9R11joykjKSMpO1YkmmE8nBHKHbqk2SEUjgjlGIexByUx9EI5cghEI1QNPhn5TH3Pjdu9qlr6h/te/MBU8969vA+717T875x5d7bz3rmeiczG+pkSulo7HU0W5MPQjrSc0cBhoykjKSMpI4hydmGEW+SwcbLGWy85vHIQXkcDTaOxnbRYNP17b2G/+vnt1fATS/ff/EHZ5d+1bWnZ98bvnxkxZz3pt7SZdgZToK4VKQTrg6jXpfn1V4XZvCOOkdGUkZSRtJWl+RsdUhNMm6onHFDNQ8tDsrjaNxwNEyLxo0eX//9rDt3f7frkD6lgfOu/v2SaT94Tn7xmOPW3/38vPN+f+W+vk5mAcKd+q6OiPLal1kdykjKSNqOJWVWUpyupPQrmn6zL/BK5c4TLnrY++p65Y7QzEHvfL3PjZOG9L910t7zjsqspKQwQmVizBlJGUm2JWVWHZyuOvQ54dMdzx3z4sQjz1406crLRpUOmDht8DlHjTjwuB5Hnxk6rOaxzKqDXUmZyG9GUkZS5FUmQu80Qt/l3Uf/eeClw588jsz97b6Hjh/3TP2Fm4u/f/Wxc599YtnpsPqDTIQ+hXEjEyXNSNpuJGWi2U6j2d1+7v/lijdH0X/XX/Lsp4HQd56ir26dOqV3YOfaadNevnzax5lotl1JmdhlRlIm8rudRn6zvrn7paNbvi6vuvbxxz5oWbu57PkTeny0zxmnvzrj4lv+d8fQBzKR3xSseSbOl5GELCkTJXUaJe3fbXnd0YPXLiQnnfRr9Ve7v0J3263/4NKbcm/dZ9of4/t99VsmSmpXUib6lpGUiShu1Yhi/yunHglvf9TSc/yRD+avXbny3lsPXdfU67ZPVt1GngqdVnteJqKYgo3NRKr+opIy0Ten0besuttHPVh954ysHl88P+/umaf+p9t3H152YP+5o5ded+l1j/0nmIm+2ZWUiR9tV5IykSqnkarcgW9c+d5erxaQd19p/OOYBbfO3VT9XJ1y3UPdRzQ3ZA15/cBMpCoFy5eJtaSVpExUx2lUh56y77nXPKPufi89881l+04/6cEn9+jUtHjji6/4pv0y99o9P8xEdexKykRAtoKkTATEaQTE+0eXJ+s7Le315eOP7n7XBSetP+Dh+atXvvbm7YW/XLHu0T2PLspEQFKwR5logYSkTLTAabSgoMfXO/z46V7Hbl69R+Dd67zNnw3YbfDv8/o3//3AM28eQY56ORMtsCspM7NmJWRm1lLdMPuuZ0LLS85VN57fa/SN+22+KzR/yORZE74d8Pyi0MKmZafMzcysU7ASmVlooq39C8xCyz495I9VA3MXvn/cun98dvTQD3q8NKXq/m/Hzr8+MCLv4es7F2ZmoXYlZWZsif2nw87YSjqXjDs2p+DFp8a+M3fUY6u+Hb78pR37rd/x8XcW/+YpvJwemJmxpdB3M7Ob6nSZ3eQ+M+jZAbMXvXblvF75I1bffes/Or/R7ZzLvuxx6NdjJx10X9ErmdmNXUmZmUA17kygd84et5S99MT47rVHlC9+d8Il18z5bV2n8b9d/a/S3GfXe4f7MzOB5D0q4zU79Zp33/v0dc8/eUSfr667Ya8r/7lhv4kzGmf+3MnnW3zpqtFPPnb8WX8xrznjYTr1MAdUjW9YN/CmXdWLa7sc9tZg9bgvdvzxj8bZX/UtUusvr99vv47rYTozLmqS65QlvDG7xsWRNyZ3AaKosy8ZVze3lf2BqbqJ4abmhtqWVaNqq7bUWER9IvVHWlaMqm0Kzwo3LJmy3z5P98ri/F3w4ea3Ljm1yzctSyc3hOoXtsbTRx5oVFB7XiK/ZkcflJbb2wumSzui/orozzltNbFkyt6D4t9FHlRegknNM9gEObEMtCwd3TynfiH4nmxZOrYuVBXLhCeeG+MLbxxk2aSmuoawOd/exDc5cVTLDGYnlig7nkHbJbJMkLtybLixcfKJoVpLMXrytnoYNTOW5VzwPRJpndb7Z4WbKkL19RVNoVmzqmtnVTSGKxvCTWuzimKGJSY9rhl7D+JrRuSPJKYnttKfNSIxfZY9+SMsbhW3h2BhWj32ELJa7hgaqqmpCjWFhtbVz48VZai1bTF329j3CW9ivWJYm7GqqVkYMHazcrMxiLwZzoKkWkPlKdeQ3kn17tRmP6xr5Pbhel+rnlXbVsgrHgud0hSurKhvmFuha+3g+vrJ7To7aYvKtrasGheeU9cwX+9vDXqHMHgXnDcevV4mVc+prwnHst02RkR+a7f1fFzKfaO0GjES/icwz+aWjmfW0Gdrw/OaYp22urYqPG9tVuE27rPDU+yzwztgn404C7H+GHuIK9T+SB3bfOtzyt1Xtaswpu5ruJda0H3H6/ob6b+j2rR3Ib/7LjR10rbMudkvxY1lcp5a76ra0hr6T3rXmxtuaLomUfNLU+x5Je5obVY8PzHgRBsRO7SQTESiKxp10aLeeKJMavI8lByThZGUTnjSs5YMq55r8j6zYooZK3a0IlofZhtvSxVXnNRc11Qdrm26OjF7PqfmJ5Le73Iz+uLAnPqgt0UEMtWSFa8fTiqyZTIRb7ekn+s+qgW6wVYxepDQGP5Ycf4f6nvZPI8dBAA=", "custom_attributes": [ "abi_private" ], "debug_symbols": "tZ3djuy2sbbvZR37QKw/FnMrG0HgJN6BAcMJnGQDH4Lc+ydSrLc0PWgujbp94n5meeZ9KaqKpPij/s+3v/7053//7U8///q/f//ntz/8z3++/fm3n3/55ee//emXv//lx3/9/Pdf93/9z7et/6fItz/49t8fvpXxE3/7Q237T9R/4v2/yj98Y56fMj91ftr8rPPT52c7PmWbn2V+Tj2ZejL1ZOrJ1JOpJ1NPpp5OPZ16OvV06unU06mnU0+nnk49nXo29azr6f5J85Pnp8xPnZ82P+v89PnZjs+6zc+pV6denXp16tWpV6denXp16tWp51PPp55PPZ96PvW869X90+ZnnZ8+P9vx2bb5WeYnzU+enzI/p16bem3qtanXpl7ZtoASQAEcIAEaYAE1YBe2rUObUHZlow4lgAI4QAI0wAJqgAe0CRTKFMoUyhTKFMoUyhTKFMoUyhTKHMocyj2BTDtwQP8r26HnhPVr70lxAAdIgAZYQA3wgDahJ8cBoayhrKGsoayhrKGsoayhrKFsoWyhbKFsoWyhbKFsodyzwrxD/+XWQQI0wAJqgAe0CT0bDigBFBDKHsoeyh7KHsoeyh7KLZRbKLdQbqHcQrmFcgvlFsotlNtUpm0LKAEUwAESoAEWUAM8IJRLKJdQLqFcQrmEcgnlEsollEsol1CmUKZQplCmUKZQplCmUKZQplCmUOZQ5lDmUOZQ5lDmUOZQ5lDmUOZQllCWUJZQllCWUJZQllCWUJZQ7mlVyw49rQ4oARTAARKgARZQAzwglC2ULZQtlC2ULZQtlC2ULZR7plTu0Cb0TDmgBFAAB0iABlhADQhlD+UWyi2UWyi3UG6h3EK5hXIL5RbKPVOq7EOGnikHlAAK4AAJ0AALqAEeEMollEsol1AuoVxCuYRyCeUSyiWUSyhTKFMoUyhTKFMoUyhTKFMoUyhTKHMocyhzKHMocyhzKHMocyhzKHMoSyhLKEsoSyhLKEsoSyhLKEsoSyhrKGsoayhrKGsoayhrKGsoayiPvNAOFMDH8IBHdzNAAyygBnhAOzpf7j1RrR1KAAX0EnoHCdAAC6gBHtAmjIwbUAIoIJQ9lD2UPZQ9lD2UPZRbKLdQbqHcQrmFcgvlFsotlFsot6ks2xZQAiiAAyRAAyygBnhAKJdQLqFcQrmEcgnlEsollEsol1AuoUyhTKFMoUyhTKFMoTwyzvenGh7POH30uvW+9NsfZPR885PmJ89PmZ86P21+1vnp87Mdnzz1eOrx1OOpx1OPpx5PPZ56PPV46snUk6knU0+mnkw9mXoy9WTqydSTqadTT6eeTj2dejr1dOrp1NOpp1NPp55NPZt6NvVs6tnUs6lnU8+mnk09m3p16tWpV6denXp16tWpV6denXp16tWp51PPp55PPZ96PvV86vnU86nnU8+nXpt6beq1qdemXpt6beq1qdemXpt6beqNp6cDSgAFcIAEaIAF1AAPCOUSyiWUSyiXUC6hXEK5hHIJ5RLKJZQjaUpkTYm0KZE3JRKnROaUSJ0SuVMieUpkT4n0KZE/JRKoRAaVSKESOVQiiUpkUYk0KpFHJRKpRCaNZy6l+cx1gARogAXUAA9oE8aEBM1nrgNCWUNZQ1lDWUNZQ1lDWUPZQtlC2ULZQnlMT9DerElM3cgo3fzsVcT91/ZP6Q9S/XP/bY3fZp//t0//WEwGSW8oK36q+08+ftoLwvsPrf8wqtRm22R99uiYTOp3TPuPYzapX4TL0UKMT5qfPD9lfur8tPlZ56fPz3Z81qlXp16denXq9RbC69FCjE+bn3V++vxsx2dvIcZnmZ80P/vv+5HxPudLfM6X+Jwv8Tlf4nO+xOd8ic/5Eo/ZkC40stdj7sNj7sNj7uOAWaqRvQeUAAqYJRt5OP6F4ncofoc4QALCncKdwp2jhBy/w/E7jN+JEnKUUMJdwl3CXaKEGr+j8Tsav6NRQo0SarhruGu4W5SwR0MrHdqEHg8HlAAK4IDdovWZlx4UB+wWrU/B9LBoY4aiK/d2oQfGgB4ZB5QACuAACdAAC6gBoeyh3EK5hXIL5RbKLZRbKPfI2ruJH47JhkkOapPGfMOkAiIQg6QTzUmHScPD5yTDHoVzlmFSARGIQQLqeoXmXMOkCuplLjynGw6i4aFzwmHvheaMwx7sc8ph74fmnMMkBQ2PNqcdJjmoexDNmYc9MebUw54Zc+5hUvcgnbMPkxRkoApyUAuSDdR/j3nOJ0xqQT0x9p5sTikcf6EEQlkUZVGUpbeke2LOuYJJDBKQggxUQaNUvYasBdUNVEAEYpCAFGSgCoJHhYfDw+Hh8HB4ODwcHg4Ph4fDw+HR4NHg0eDR4NHg0eDR4NHg0eDRwmPMVUwqIAIxSEAKMlAFOQgeBR4FHgUeBR4FHgUeBR4FHgUeBR4ED4IHwYPgQfAgeBA8CB4ED4IHw4PhwfBgeDA8GB4MD4YHw4PhIfAQeAg8BB4CD4GHwEPgIfAQeCg8FB4KD4WHwkPhofBQeCg8FB4GD4OHwcPgYfAweBg8DB7Ic0aeM/KckeeMPGfkOSPPGXnOyHNGnjPynJHnjDxn5Dkjzxl5zshzRp4z8pyR54w8Z+Q5I88Zec7Ic0aeM/KckeeMPGfkOSPPGXkuyHNBngvyXJDngjwX5LkgzwV5LshzQZ4L8lyQ54I8F+S5IM8FeS7Ic0GeC/JckOeCPBfkuSDPBXkuyPMxdVKE59zJpArqyqJ9KmIDFRCBGCSgoVw7DeU+PzOy+5ja6KXvkzMysnvQyO6DCohADBKQBo0M7UuMMjL0WGwev9d9R4YeZKAKclALGlnWJxVlZNlBHjQypS/8yciUgyrIQS1oZMpBBUQgBgkIHg6PkSkmnRzUgkamHFRABGKQgIZHv1sjUw6qIAd1j74GoSNTDiogAjFIQAoyUAU5CB4FHgUeBR4FHiNT6tgmoCADVZCDWtDIlIOGh3Qi0PDQToJ/U5CBKshBLWjkTJ901pEzBxGIQQJSkIGGh3dyUPdw61N5G6iACMQgASnIQBXkIHgoPBQeCg+Fx8i3/gSnI98OMlAFOagFjR7xoOHROhGoe/RnOh094kEKMlAFOagFjR7xoAIiEDwqPCo8KjxGnvenSR15flALGnl+UAERiEHDo1/vyPODdg/qT23a83ySg1pQz/NJBUQgBkmnHok9zycZqIIc1CbZtoEKaHj0bTAbgwSkIANVkINaUNlABQSPAo8CjzL0rE8wRUwaFRCBGCQgBRmoghwUcW8MD4YHw4PhwRH3xgoyUAU5KOLeZANF3JsQKGLSREAKMlAFOSji3nQDFRCB4KHwUHgoPDTi3tRBEfdmG6iACMSgiHszBUXcm1WQgyLurW6gAiIQgyLurSrIQBXkIMS9I+4dce+ISUdMOmLSEfeOuHfEvSPuHXHfEPcNcd/g0eDR4NEi7uuRl96pgAg0/rZ1EpCCDFRBDmpBR14OKiACwaPAo8Cj97/U54fqyNWDHNSCev5OKiACMUhACoIHwYPgwUOvdJKoF1aQgVAHjDpg1IGgDgR1IKgDQR0I6kBQB4J6FngIPAQeijpQ1IGiDhR1oKgDRR0o6kBRB4o6UNSzwcPgYfAwjboa+dZn7urIt0Ej3w4qIAIxSEAKMtAoH3dyUAsa+XZQARGIQQJS0PAY2ykryEEtaOTbQQVEIAYJSEHwaPBo4eEjB/s8po98K2OpQUEGqiAHtaCRbwcVEIEYBI8CjwKPAo8CjwIPggfBg+BB8CB4EDwIHgQPggfBg+HB8GB4MDwYHgwPhgfDg+HB8BB4CDwEHgIPgYfAQ+Ah8BB4CDwUHgoPhYfCQ+Gh8FB4KDwUHgoPg4fBw+Bh8DB4GDwMHgYPg4fBo8KjwqPCo8KjwqPCo8KjwqPCo8LD4eHwcHg4PBweDg+Hh8PD4eHwaPBo8GjwaPBo8GjwaPBo8GjwaOHRtg1UQARikIAUZKAKchA8kOcNed6Q5w153pDnDXnekOftyPO+aHnk+aAWdOT5oAIiEIMEpKDuQVunCnJQCxp5flABEYhBAlIQPBgeDA+Gh8BD4CHwEHgIPAQeAg+Bh8BD4KHwUHgoPBQeCg+Fh8JD4aHwUHgYPAweBg+Dh8Fj5DmVTgaqIAe1oJHnBxUQgRg0PKSTggxUQQ5qQSPPDyogAjEIHg4Ph8fIc+pRPPL8oBY08vygAiIQgwSkIAPBo8GjhUfZRlLTWKofmUmt40gvHgcTRmZw31exjUCfWIGSvzDiZqIDxx08cNyGiQ04Kq4vEe7IiZKoiZZYEz2xAUcFTiyJ6dbSraVbS7eWbi3dWro1uI1dTYElkRI5URKHmwy0xJroiQ04Gs+JJZESOVES062kW0m3km4l3SjdKN0o3SjdKN0o3SjdKN0o3SjdON043TjdON043TjdON043TjdON1G48k6cPyZDayJntiAo7WcWBJHIetATpRETbTEmphumm6WbpZuo+WcyInpZulm6WbpNtrPiQ1Y062mW023mm6jFZ2oielW062mW0230ZZOLIlZk55unm6ebp73zfO+edakp1tLt5ZuLd1a3reWNdmyJlu6tXRr6dZw32jbEksi3GjjREnUREtETdKR/m1g15XjYFfXlWEx0n+iJGqiJdZET2zAkf4TS2K6UbpRuo30l7Fra6T/xJroiQ040n9iSRxu44pH+k/sbn3Fq4yNK4GW2N20DOxuepx3a8AxsppYErtbXzUr4xxNoCRqoiXWRE9swNEoqAwcYjpwiI06G43CxJroiQ04GoWJo+gjNEajoKPORqMw0WA80v8wttS11K2pO9J/IiVyosB4pP/hNtJ/YoPxSPTD2FPXU9dTdyT6xKwdz9oZiX4Yj0Q/3EaiHzhS+jAeKX0Yt9RtqdtSt2Wtt6ydhtoZm2AO47EL5nAb22ACNYzHppfDeOx6CQVPTN2yJZZESmQYj5Q+3IomOoxH8h7GlLqUupS6xImSqIkG45G8hxuh1scOl2k80vQw5tTl1OXUZUvM2uGsnSNNh/GRpsNNstaPhBzGR0IOY0ldSV1JXcla16wdzdoZ3fhhrMgh1qz1IzeHceYmZ25y5iZnbnLmJmdu8pGbbWBN9MSuO44Hj20sgSWREruulYGSqImWWBM9sQFHxk4cYuNw70jIiZY4xHigJzbg6HknjqKP6htpOpETJVETLbEmeuDYpELjvPHYpRIoiUPMBlpiTfTEBhy5ObEkUuIQqwNroicOsX67x66UwJJIiZwoiZpowNFZjrO3YydKICV2sboNlERNtMSa6IkNOLKwbzYoY0/K3icMpEROlERNtMThxgM9sQFHbk4siZTIiZLYcPGWtWNZOyMLjwuyrB3L2rGsHcvasawdy9oZuXlUycjN49pq1k7N2qlZOzVrp2btjNw8rqJm7dSsnZq141k7nrXjWTuetTMSso4UGQlZRzKMhJxYEilxKIwAHwk5URMtsSZ64nDrGTC2ygSWRErkREnUxOF27LGviZ443Po9HptmAksiJXY33wZKoiZaYk30xAYcKT2Ro6rHZpmjJsdumUBLrImos7FjZuLI7oklkRI5MeuMs86O7D6wJnpi3iHJO3Rk96jUI7sP5ERBTR7ZfaAl1sSsM8k606yzkd0TKTHvkOYd0rxDI9G9p97YLxNYEofYcfSIEyVRE+04S1M0TuEUjXM4ReMkTtE4i1M0TuMUjfM4ReNEThn7YmYxRv5OzCKP/D28R/5OzCJ7FtklZF1BKLCjwI4COwrcUOCGAo8UPooxUnhiFnmk8OE9UtiPs1lbYkmMqx/7YCYJSEEGqiAHRYGPnS6jGMdWl4maaPA+MvNAT8wiU1z92BgzCQUmFJhQYEKBCQUmFJgRXWPvS2AWmRFdY/tLYBaZs8iMq2dcvaDAggILCiwosKDAggILost0S8wiK6LLlBOzyJpFVly94uoVBVYU2FBgQ4ENBTYUuGfBOJY33kwyoAZ4QJsw3kwyoARQAAfsxa4DegUM2JXbgL455zgpNQ6nDCogAjFIQAoy0NhS3OnYtjyogAjEIAEpaGys7TS2XNmgsZ1xkINa0LHlalABEYhBAlKQgSrIQS1I4CHwEHgIPAQeAg+Bh8BD4CHwUHgoPBQeCg+Fh8JD4aHwUHgoPAweBg+Dh8HD4GHwMHgYPAweBo8KjwqPCo8KjwqPCo8KjwqPCo8KD4eHw8Ph4fBweDg8HB4OD4eHw6PBo8GjwaPBo8GjwaPBo8GjwaOFh28bqIAIxCABKchAFeQgeBR4FHgUeBR4FHgUeBR4FHgUeBR4EDwIHgQPggfBg+BB8CB4EDwIHshzR5478tyR5448d+S5I88dee7Ic0eeO/LckeeOPHfkuSPPHXnuyHNHnjvy3JHnjjx35Lkjzx157shzR5478tyR5448d+S5I88dee7Ic0eeO/LckeeOPHfkuSPPHXnuyHNHnjvy3JHnjjx35Lkjzx157shzR5478tyR535sfh5koApyUAsamXxQARGIQQKCR4NHg0eDRwuPsRlkUgERiEECUpCBKshB8CjwKPAo8CjwKPAo8CjwKPAo8CjwIHgQPAgeBA+CB8GD4EHwIHgQPBgeDA+GB8OD4cHwYHgwPBgeDA+Bh8BD4CHwEHgIPAQeAg+Bh8BD4aHwUHgoPBQeCg+Fh8JD4aHwMHgYPAweBg+Dh8HD4GHwMHgYPCo8KjwqPCo8KjwqPCo8KjwqPCo8HB4OD4eHw8PhgTxvyPOGPG/I84Y8b8jzhjxvyPOGPG/I84Y8b8jzhjxvyPMWeb6vVW6gAiIQgwSkIANVkIPgUeAx5hUOYpCAFGSgCnJQCxpPPAcVEDwUHj3+eLwGqccVj7cC9Lji410ABqogB/W/7WfZtx5XkwqIQAwSUPeQQd1DB3UPG9Q96qAW1ONq0thgPUhACjJQBTmoBR0b7QeNzXCDxv6fQWMletBYwh2kIANVkIPapGMXzEEFRCAGCUhBBqogB8GjwKPAo8CjwKPAo8CjwKPAo8CjwONYNRtUQGPavdMxLzcIJWCUgFECRgkYJWCUgFECRgkYJRBcpcBD4CHwEHgIPAQeAg+Bh8BD4aHwUHgoPBQeCo9jpXpQDRoTbqOGjnnzQSiBoQSGElSUoKIEFSWoKEFFCSpKUHGVFR4VHhUeDg+Hh8PD4eHwcHg4PBweDg+HR4NHQ7wcK9CD6qyXYxdIHRQlIGQFISsIWUHICkJWELKCkBWErCBkBSErCFlByApCVhCygpAVhKwgZMXcCDIIHgQPggfB41hGHhTxcuzqGLVxTFQPQgmQFYSsIGQFISsIWUHICkJWELKCkBWErCBkBSErCFlByApCVhCygpAVhKwgZMWxf+MgeBwrxINa0JiEHnVwrCUNQgmQFYSsIGQFISsIWUHICkJWELKCkBWErCBkBSErCFlByApCVhCygpAVhKwgZAUhK8ZLSY7rRVYcey36lR87KeqgKAEjKxhZwcgKRlYwsoKRFYysYGQFIysYWcHICkZWMLKCkRWMrGBkBSMrGFnByApGXzH3VwyK3D+2SYzrRV/B6CsYfQWjr2BkBSMrGFnByApGVjCygpEVjKxgZAUjKxhZwcgKRlYwsoKRFXOjxCBcpeIqDVdpKIGhBIYSGEpgKAH6CkZfwcgKRlYwsoKRFYysYGQFIysYWcHICkZWMLLi2PFwvOkIV+mI2IaIbShBQwkaSoARFGMExRhBMUZQjBEUYwQlGEEJskKQFYKsEGSFICsEWSHIimNHw/Gepmh9xks1xhUdWxTqIJQA8Sxo5QWtvKCVF7Tyx96Eg1ACQgnIQfBgeGAEJcgKQVYIsuLYsjBKz9GTHJsQxnVI9CSCeBbEsyCeBfEsiGdBKy9o5QWtvKCVF7TyglZe0MqP12ZMgofBwyKajt0HB0XOzO0Cg1ACxLMgngXxLIhnQTwL4lkQz4JWXtDKC1p5QSsvaOUFrbw46tljhHfsDhhlbjHCE8SzIJ4F8ayIZ0U8K+JZEc+KeFbEsyKeFfGsaOUVrfyx2q+DCiiy9lidr4NQAsSzIp4V8ayIZ0U8K+JZEc+KeFbEsyKeFfF8LNOPUh074Qa1KN+xrD4IJUD7rIhnRTwr4lkRz4p4VsSzIp4V8ayI52MpfZQFY/lj9XyUyiKjFO2zon1WtM+K9lnRPivaZ0U8K+JZEc+KeNaKEtSItWMtfJTFI9YU4w3FeEMx3lCMwhXts6J9VrTPivZZ0T4fC+HDt0UJjlc82KAogSESDZFoiETDeMMw3jCMNwzjDcN441jYHm4lSmAUd8Eo7oIhEg2RaIhEQyQaItEQiYZINESiIRINkWiIREMkGiLREImGSDREoiESj7XnoYyRwlhNPjwssnGsFx9/gZGCYaRgGCkYRgrHqxGGnuEeVdyjinuENtHQJhraREObaOjjj5caHBSt8vE6gqGHGDLEkCGGrOEOIoaO1xHYoLiDFa1ZRQxV9M4VvXNF71zRO1f0zhUzExWjzYqZiYqZiePg//i/TKBxbf09tRQvuu3v0e1hefxU/rv/GF+W9Kd//fbTT/3/nL496X/+8+0fP/7206//+vaHX//9yy8/fPu/H3/59/ilf/7jx1/H579+/G3/v/s800+//nX/3AX/9+dffur03x/yr7fnf7ov0un86331TSGwP85eldjvSUjUfebyjoT0TVxDYe/+TgJ2VaB3blNh740IEiIfa0KeS+xDxTIl9rEiP5XQRSkahwQ10XsSfSPzlLByUyJLYfS6RH0qsboj1l8tc0hU8qcSZaGhtUVk6b6GfOeu7gO/GqFVi96S2Pok+iGxSblVGYrY2ru8RWWsiuFlQ5JQuVeh4823R4UWopsaW4OG3yvH3g1Gwts+KLxZH0h5cd/u3Jb9mT8k9od+vifR0Grsj52vSuxPpLckpKTEovlbSSjHLdlR70lYStTtpgQuRP1Ww7NPhUSe7DMgt+5IyUa4r3Q+lehnuZ9qjLN0h8Y+hILG9T6tL0miFO3WTe3rgtHu7AuD9ySoQoL9poSmRHtZQu6WQiChfE9Csy5cXi6F30qzVqIq2qkb2Pu2q3+vEROttmd/38+7Pg3MfVYSkckqdCO4HdXgp9v5UAgpiy7EIkWt6h2Biu6jlu2eAIUA6Y374C4RTe711tC772BEEyHtjkSf0I6A3GdG70gwrmOfPE2BrX5h9I7Rpp8E/OO9WIRkQ8+zr4XrU4lLZeDtuYCWVXtdG1L7FFJy/XaKCDqenbP/6wOtyyJcFSL7FMVTEV2NrggPdWKnzucxLJYaFS3V/oBXn2vYKjyz++GThl0vhbNjnHh6ovpUCl89D+FBZF8/42elWAQoOzowdpFb15GPIW7PmwtbhGgTaLQ9TDJEy/YFjQYNNX6uwW/QWNRHP4IWYb5PJ6cG8xci1DJC23Yryo3Rn9q+RHZPQ7YY9tp5/P6VrmBP9Zppr36v7fggcoqyR5G6vdwQritEGRWyqNR+lPP3SzkTylJwvdl0lJqdm95KfLTn+4Pu88SvtrqSenrgLk9KsVRQJijos9pcThNivHUeqdD1CN8XppDw52Tdk/9qJ4/ulc5laB8FfNH67XGJVthOU1JFPuaHLwKzbDW7+a1+GIR/bLt80Yb2Vx2FSKmnfq1t1zW2RtA49WufNBZzhTpOqR7zQb0mnzwL+Cq2Kh7ZrcrTZ+V1bWTDVbg9v5LlffGGZ/atsT2/L4uenkrO9dE5QraPGm01oi540ORyboW/pJHNX7FFOVZNaMHsKdNpXF0+Jkxb3ZiKObZ+UurZc1KTFx/1VgKXHvXWAhce9dY3wzUrcnt+MxY9yf5AgAlgOSX8481YShBB4rTG8SBRttVaDaEZ3h8S2usapyWKx0tZ1Sihb2Y69e6PNVq21TgUs43N7dRmPEqsQkMxe1v3leZnbVfZ9Or07dM5mbIt2lDeEOS8nYbDnzTqGyZ2lu0foSUmWrQ7YxnhxVj/jsa1YC/l9WC/rPE82Jd1KpVz4FKe1+lqwaTkTE+/0c+vZamRM+N8Whj8mgZnkJ1m179UH3hu61t6ntbHUkMFTyl2DvVHjdWIob+oFcOO7bSE9DhiKLQa2eYIv5xH+GzlQaSs1j0KYd2j1DeInJ4TXhCxuyJoRtiUFiJXK7atLmc1BUWCKXs6PVc/PM4Wqqtpf48q6Wd0FgVZPUpWBNuOshBpr/dXvL3eX3F5vb9iekN/tb43uSjezyc9rdbrDcHeEjxvCFhXg2XMQvfXLTwNNbZVUajlgyGfZpM+F2UpM75JNmTYFzKrESd2xMipy/l0Pb4MlJqBch4614e9AquG4FQnzKeG4OHRv6wWfPopQQTKqSSfRWjVmmi2Jt6eiyxvDmnB9ZAunlSLyGpyvRrWh7nW+zItZVy2hcyync09XH3d5elw/LLIeSb1vki9K5IrvcT8DpFFSVYLU1c7MF2FLWM9qB/cWBSEX+97VrOhV/se1df7ntXC1PW+Z1mtIqjW83rf5yBZ5l9Da9DPyCzSeLVE1bBXpNHTrmc9f5ZbKPtrksvzcqwWmK52gstFKqwvlfOOkz70+qjBrz/7XdZYPPutarVvH0et1m3xjGHreIWKnm/NpypZDJUab9h7wqeQ34PuQcRXcSaRfW1r20JktZ4KDfbTkO3xeXi1TNUPNaM7P+3m+ZoIcXYVtirJ4hbLsJhRch471i8URAmPs3rqKb52NSq5T/W0LvslkVNrxOdNKZ9F7Petkg87uuvzgiyzb1/vx5oAb74Y29RFuCpj6KiiCxFfzZpuCNi9E1w8YviydZV8JC78vB1Y1crldmC1ZHO5HXB5uR1YLWD1Qz6YCDrtfP2SyOWg9/p60K8Lci3o15FWJCOtLfrxtr0h0lp5Q6StlrEuR9pqIetipK2WkS5HWpM3RFp7Q/Pa5PeONOIsiCzatNZeXoKm1ZLUxTXo71yMY7THmzy9GNroDRfDv/PFMJ4ad9SbXRZXrMFwlZudp2A1XFXKolpXbWvLFaVmfFcE+yV2vCmiG9aldrwtgoekHZ/P8a3HNoVyRaiQ31XBPe7fi7LdVKGc0eLzSPpTtSwPBaFWztON2xcEMoNPrfwXBBQrDuc9Sl8QsNxn5fREYFmTslluIi6ki5psr15H+z2vQ3PkLeqLiKDVFhbBygvvTetJpD6I8GqaJs/RyNaeiqyvx7BjoX+rxeK+kC6bZWxAY2+L61lNK1Zsr9xRbl5PKxlnbdFDLFV0a3aal7jZBmluV+9f6sD3VEwQszvb8315tFrZcswI+GmM1+f6L0u0klNx9anE+lo0W2VTv3l37HTAxHxr91SqYG6iv+W83lXZJFXKTRVz1rwiX3S/q0WpvoiLuSOWp882a5ENW+P6Swufi6xWthpBpJGXp882tFrZUs/G/rQ+wF8px8UHNZI3TAmQvDwlQPKGKYGlyNUHNZLXpwS+U5A3zINZo2xPmtxspz+q6N1WKZcq+rdW3C2Lt3pSudva4/SHnzqML7X2jgc+PwXsFyUIEu1liXa3FFkXC4l1R86cwwGu5eZwgDPMdkW6q5JhtqvcHFRowSbT/pVW210VycMPfZh2UyX3dOwqNxNHmme9bEXuqtiWw8fVcHj5uIXTNXp60vnKA1/Lt1nIM4H1k3hO7W/N7z7OG65jq/WmSOF8u4fQXRHMCewid2cnCnYA6nqlYjV3JDl3JNXfIOJ0UyRPHolSuVsSPOjsenK3JJr7qezupFyu8u149+4oxtG7yKIlWR7aqblTzc+bdb5whKlkM1Lq9lRj+S4CivpwOp/Goo/7QWhZDs5GUfje6TRGI0DnU6Cfy7EauhKOxX5YkG7lQcPeMJZfLWZdHsu7vzyWX+3z3hdwT/sH9abIOM5yiJTVA8FqLevqWH5ZEMPKHJvKzasxDNTY7G69Wm7EMuKbIlefkd6wmPWdglx7RloeLs1tdnIeCDym72opa3/2x47ZnU9HLOqXVITzJKOcVpHq5deT6GlopfK8VeTVYhZvhl1yO59irX5JJd/vwX2n9Y3LqYYpz2qnG6z0UA5dLrpgnqSc3xLCjyKruVcMF/k81/KpVt+wDWs8v7zaPvP28jYsXr0L7mr7vBa52D5zeX0b1rogF9vn74hca1q/E6yn9/SdziF/Ctay3Gh+Oqt1WiAkljuJdz5++5h4xZdrWp7vtCmn9c69fA8yqzWt4rm0ft4m+/Byi7UIYeC7rzQ8f0UPr043acPck21N74nsoZavZJDtpkjDGLyeX4v2JZG64VV1tZynWz6JLEeu+SYqOu8V8If8W61s7UNoHLSu55I8vBWGVyeCSh45KeeXtH0uib+hkab2hkZ6fVzrUiO9Pq11sZFeilxtpJlfb6TXV0M5KFG7eTVXW/q1yLWR+HdELnYXS5GLI3FevRnwLTfn4kh83ZZwLnCzL9qS1VGtfcIIO6D0/PYL1y+UJM+89DezL0oiy4f6PGBF7XkzsFoGutwgrQ4kXW6QVotaFxsk8Tc0SEuRqw2Sbq/H/LIgV9uStcjFZmAZrpXztd3nHRCP4bo6o6Xccrf7+dTLY+IsL8c1X991Prv9tcvBHSanRU+u6xn+nFfXRczrO4YD+o7hgL0+HLB3DAfsHcMBe8NwwN7Rk1v5nbOPSx5MLOdloMdwXR3SKkT55unTo1J9vBpfTokbpsTl+YsTvleQ0/ZSfVqQ5ZNFQXtUi8nzJ4u6ujc192TtrE/nj3h1Ssv3mRC8sJfPS32PKutHWcqpOaHzUdrHR9kqy0hBzJbzi1iqP4jocq0Pz8PLcFue1CJsmhM6L9M9NvbLklCJG6Qf3jXwqST+hlHSarP55XZ6tTh2uZ1endS62E47vaGdXopcbadX57SuttPLglxtp9ciF9vpZbgy3j+0r6UuHi9Wa1v7mn+utK9GScvLuTpKWl5Ovm1Lz4sFny5ntbp1eZTU3nCwkNsbdhFye3kXITd9Q/Y1fUP2tdd3Ea4LcjX71iJXs2/Z92G2kT9M4z70feOlyk+rZMPpxH1yuT2dKJRtuYkJ+1yKnB/uN/mKiOemrA97iR9FVqdGNsVc8GbPX2IkqyWD/vWhWME8vVNxj5kHkfWLgzC+KecvwfoksgjYmlsiz1+C9UniDQ9csr3hgUvKyw9cUt7wwLUWudiUSHn9gWtdkItNyXdErjUl64hnvFtjn51bBGt5w3KsFH9HpL28HCv0huXYtcjVSKPXl2O/czXXZvrXIlfDdS1ybab/OyIXY57e8H4OWa1uveXmXJzp/07Hhw28Rov3RAq/4S0Dwm94y4Dwy28ZEJY3ZDDLGzKYX9+YtS7I1eRbi1ztK9bfBhFB8uFw4KdIk2XLeOmN6iLLLxrC4lZp9fl3V63fZYgTErTJ8y/QWp3WUryU2M6vNLevlCLfP7i18rwU+ruWIp8n9ikku1efxfl1jZobILZ6T4MR6fsa6PPYWK1oFW6nzTZ8T0PypWUi79CoNzWwYb5/oc1djTyp4uX1a7mrodvpJNH2ugbf1ZDUMHmu0V7N2nUp8rHZFhm3WrS5Vop1p4CtQiantvhTp7BcxLr2tvvvaFx62/14cfrzqfxLbzy8rvH8jYdfqFRZVKov4wMnCc/vQ/90McsNg/kF1CT+usbz1+5/Z4oov99Qz9+B8mmKaHn8IN/FXM4vfXic8arLF1qWPPdDZ5mHRTCp62/lFkSrnb957WsqjkWw/RZsz1XW1dJykHpOvk/VslrqdIjQdn675sMMutR3zFjVd8xY+eszVv6OGSt/x4yVv2HGyt8xY+Xv2CKwDPotv85yO++SfZz8Xp3NIspTCDu3p6dMZLWAdXlB/Dtl4dOJNT5tt31UWb5sUOx0bvz0tu3ypW3m+YjX5/PL07V5WS1iUR4XpQ/7Bh9v0Vokd0PruR/9JLJ87r22G1pWazZXd0NLe8ORQmlvOFIo7eUjhdLecKRwLXKxbdPt9SOF37mai3Ok7Q3nEr8jcnGOtL3hXOJa5OIcqW71d745V+dIl21JxTIl1fP59fr47darczyOo0DV9fl3B69LYvnepA/fN/GpJAuRisFwq89b+u/USE7X+KaLcqy+yKoxDo7vzE/7Py36jl50eUGe32b14V02ny5oNYrNw5rF2nORZZQgcarT02OWunxzYH49qtXT00792Afr8pufSPLtdCTPD54qrb+6LR7dyunlZ3rzWk4HET5dy3I/y4UvZtiWi+mGe3Kaz3u8J8uN1JbHGOppa4A+fKU8veErCJTesNiq9IbFVqWXF1uV37DYuha5OpDg1xdb1wW5OAb4jsi1McB3RK6NAdYiV8cAXH/ner04BlgncM2vJW6nk7yPCfyOd/zpaoXicu4JvZx7q9Wry7m3FLmae6sVrKsxsizI1dxbi1xLm2VfU3OUaE/7/+XbeLAtdh9A0NPearU2sEtgXfF8If1rXj6KLDt/nDmXjyf3HkVWgUqaX1fVnn9fvK6+N0sY6xT7SoEsRFaT6vmFyUbng96fRF7/gkJdfXOWEVoiO9/gzwW5LNIWIqv5noZg3Wdtt+dXs1x3wUyafAi1x4KsjmSVLfeRbh++K06+UBLLF/bXsgg1W36RpeERoJxfTCAPJVmtRfWjdni64udRYquHK2p5eOhDvT4WZL0DO7/o7bzkIXpT5Hwk8pNIfT1xbHnmtWZBzmvInwqyfNF+LiV9OLrwWK/L74k6Tyh8WBf7gghvGE3sN6csRJYDAWxZZjm/8/BrInizNJ/3PX8WkTeMa6q+PK6p9oaRwFrk4gB6KXJ1AF1ff6XAdwpycQC9DBJGZ8H7gsbzIFkd1zHBo7jpebz4GCTLL866Ogz3d4Srvx6u/o5w9XeEq78jXP0N4ervCNfVaGB/4sDZTlmNstryuyfzmwh2PnXl9iCyKIl7Duj99ERvX7iYWrCHop53gn26mNVGQctvNNr5tLr3OCW4Wsi6PF27erVezffI1XNTQo8FWY4GLr5a7zsqFfOkO5veVfFUcblfFj2ptJsqr78scB+G4d2H7Tz4pOvvG2zYbVPbeSNml/jj/uOPf/n5tz/98ve//Pivn//+6z/7XxYd8/g/fCs2Jml2qAEe0DrshaMtoATQGFPtwAEyRq87aICNZmSHGuAddlNqE3gLKFOHaUxv7MABEqABXbnPqHAN6Mp9Ap3bBOnKfZuadOX+OCpduX/FtXTlvkVSJEADLKAGeECboNsYxe1QAmh2T8oBEtCV+2O5WkBX7jmpPnqkHdoE68r9mchKAAV05d7cW1fuY3PTgK7cNwxZDfCArtw71boFdOXeqdSu3GO78tjosYP0LmUvRtUA6z1L/181wAPaBN8CSgB12C2cA2TMK+ygATZ2Ee7QlftyknflXj/eJrSu3JvzVgJoPPjuwAFdue/GaF2510/ryn1s1bpyH/+2rtyHbK0rj5jfNlABdfFeM3seg7p8X4woW9fvPU/ZrC/F9vTYKshBLahsoDJOLHciEPfp0K5XZJzJ7qSg7lHG71VQ96Ch14J6Yk4qY9tgJwJ1j34ApPTknKSg7tH395Sen5O6Rx8jlZ6hB/UUnVRG/96JQN2jv9Cm9DRVHf/WPfpW2NITVW38bQV1Dxu/10Zvu1NP1kndo89ylJ6ukxgkoO7RBhmoe/TWqfSkndQ9+qJ36Wk7qfSjPP0veuJOYpCAtFMvVU/eSRXkoNap3wXbwrdn8CQCDY9e9yYgBRkI12G4DmtBFR51XEcfxv7fj7/9/OOff/mpN+299f/3r3+Jln7/8V//7x/xf/7828+//PLz3/70j9/+/pef/vrv337qvcLoEKj/Z5f+n/5m4T23/ri3pf2nfbFgnwf8Yw+7/uN+C/cFzt6ncP+D/iv9xer7PGX/txb/tmc9t/4v/a8OXepz4LSxdq3+c93bR9pHJ9Npr4D6w37tNbz23237H0j54397L/b/AQ==", "is_unconstrained": false, "name": "validate_handshake", "verification_key": "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA0AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAZc2wj6ryhaYY6hxcnEXvw7wAAAAAAAAAAAAAAAAAAAAAABxIBQZOfZF+PxJCGh0ecwAAAAAAAAAAAAAAAAAAAKS0NgbmRV3+eEmNLZiTqoQwAAAAAAAAAAAAAAAAAAAAAAAop+vSsTRytiUyKpMVMPoAAAAAAAAAAAAAAAAAAAC3ePOD6iu3/7q8KzxbDId8hwAAAAAAAAAAAAAAAAAAAAAAG0T6SzcNlmz7XCux+eyMAAAAAAAAAAAAAAAAAAAAiwAksUINThcWRzT5iJFX5WIAAAAAAAAAAAAAAAAAAAAAABzAIQ94kdocGl2VmuwBdgAAAAAAAAAAAAAAAAAAABjreHPQ4i8aJbCnWMCvJckOAAAAAAAAAAAAAAAAAAAAAAAeVoKlg1FKrnGinof3Y/kAAAAAAAAAAAAAAAAAAAAHasGiGA69DdKi5MtWOSwN+gAAAAAAAAAAAAAAAAAAAAAAE4IWKmeTflljtDIgslN8AAAAAAAAAAAAAAAAAAAAGNiqmXOkFmF0h3vs59BRrskAAAAAAAAAAAAAAAAAAAAAABhb8FkhyJaHWeukpb+6hAAAAAAAAAAAAAAAAAAAANGB+h+jGdf5cklebPYycr5NAAAAAAAAAAAAAAAAAAAAAAAkoHHy9NNWHFsC6e+okUMAAAAAAAAAAAAAAAAAAAAqrx+S1iw8ma4z0vsHGYrOrwAAAAAAAAAAAAAAAAAAAAAAIqBH7AmdAPfsSq02wVyiAAAAAAAAAAAAAAAAAAAA7tm7gQXfPtXkvSM9/Ybz+8YAAAAAAAAAAAAAAAAAAAAAACLdXmNYiLgXzXfdZIrPygAAAAAAAAAAAAAAAAAAALhzt55fqJOuy8uiPpOjSCcNAAAAAAAAAAAAAAAAAAAAAAARN+4P9tCDS8WQRFdw4wMAAAAAAAAAAAAAAAAAAABjq/Hu11Wn8z5PjSt/jbUF+gAAAAAAAAAAAAAAAAAAAAAAGZSeZZfuZQoPn2J8nzS8AAAAAAAAAAAAAAAAAAAA9V0ICGet47HZTq/cM0s6Y+MAAAAAAAAAAAAAAAAAAAAAABONy2HnfAwbYFVzw/rMgAAAAAAAAAAAAAAAAAAAAHj2q+hDoqpygl+zTv7BPqPzAAAAAAAAAAAAAAAAAAAAAAAAy7gILoN+VihzW2/rmokAAAAAAAAAAAAAAAAAAAAv4C5dIWgBYkgqNH/0CqgLvwAAAAAAAAAAAAAAAAAAAAAAFx8ytvA+JWyKluQthMUjAAAAAAAAAAAAAAAAAAAAcOUENopP+MhmSR58lEAcwPYAAAAAAAAAAAAAAAAAAAAAAC/BhLiuWeyMwwSBhnGKjQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA9IywgtCmtBiChstIsEpf1eUAAAAAAAAAAAAAAAAAAAAAAB1rgO/KDDXpoTcIrJW+AwAAAAAAAAAAAAAAAAAAAHvVDRM4XOQZcxJHFwFP66JBAAAAAAAAAAAAAAAAAAAAAAAAYarZhmU8aUWBz2C9mCkAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA5ilz4nIUCK4gFB52mfQAoMgAAAAAAAAAAAAAAAAAAAAAACKF87Z2DYpD5Kc+EZiZOwAAAAAAAAAAAAAAAAAAAMPSj7P7wsyCyZdKmYOu0HbYAAAAAAAAAAAAAAAAAAAAAAATX7VVAHM90tyFfIUX2TQAAAAAAAAAAAAAAAAAAAAryw6q5ySYtEydwXTccvHsSQAAAAAAAAAAAAAAAAAAAAAACiLKHDxfu+lKABx/ZVaOAAAAAAAAAAAAAAAAAAAAjJ1cOh0JWoEqifOAfsAO51IAAAAAAAAAAAAAAAAAAAAAAA5cRVL+kcr14+H+Kf3CZAAAAAAAAAAAAAAAAAAAAAL81u8yivxTmxR95dYosGo1AAAAAAAAAAAAAAAAAAAAAAAUIAXu9Srm7RIsc3fDIlMAAAAAAAAAAAAAAAAAAADlpWdV/yEYitTzpa9uJj+TiwAAAAAAAAAAAAAAAAAAAAAAHXP7p1fHiLjndMez0mWHAAAAAAAAAAAAAAAAAAAANgwHM19mo2ysut8FxJdTkgoAAAAAAAAAAAAAAAAAAAAAAACeKCuIRx+X79ayGuMlJQAAAAAAAAAAAAAAAAAAALq9hiWhN7peSGEMXDLjnu+SAAAAAAAAAAAAAAAAAAAAAAACDomnI7KYRU0WT3xPtNsAAAAAAAAAAAAAAAAAAAC0m8734KU2a0UvkKoqQ+NgkwAAAAAAAAAAAAAAAAAAAAAAFINBx6fOsXPEihEQoTlPAAAAAAAAAAAAAAAAAAAA/j1tRWUET9XB+TMq4SbcoTcAAAAAAAAAAAAAAAAAAAAAAB2TEBWawcqyqJZguKhgQQAAAAAAAAAAAAAAAAAAAFIpS59IsO0Gz9MqeZ43DlZWAAAAAAAAAAAAAAAAAAAAAAAAZZahefIYBTL9K3FMEcIAAAAAAAAAAAAAAAAAAAAYaYZgJ/XxNWKbYkYn00zQxQAAAAAAAAAAAAAAAAAAAAAABiD/XJiKlP14HxzLZs6vAAAAAAAAAAAAAAAAAAAAoD7pvuoOVB7Sj8wC8AlUklIAAAAAAAAAAAAAAAAAAAAAAAd748jL5YT6FXZ4URBjkwAAAAAAAAAAAAAAAAAAADwYUAlkWZIkbbA7IgJrn2HUAAAAAAAAAAAAAAAAAAAAAAAimwz9v9nRGCXfNYaQnfIAAAAAAAAAAAAAAAAAAABhOf7WizxCUF9ZUPY5p9rABAAAAAAAAAAAAAAAAAAAAAAAFqlAgwZPnYX7HXJK9Aj8AAAAAAAAAAAAAAAAAAAAcZ0BcW6Rv85swpkmwiuiKVQAAAAAAAAAAAAAAAAAAAAAABN0Vw5CTFVyiJet3feWWQAAAAAAAAAAAAAAAAAAAIXoXgimBnmnJS5TH8QWuBuSAAAAAAAAAAAAAAAAAAAAAAAmidUJmtrokv9Jz2mcnR8AAAAAAAAAAAAAAAAAAAB8jayp8I1q99bjqnwZLoPySwAAAAAAAAAAAAAAAAAAAAAAIYYzJSkF00dURYKn2iRlAAAAAAAAAAAAAAAAAAAAs34JsUhQKjTP+Vs76D2OTh4AAAAAAAAAAAAAAAAAAAAAAAVD+/CVAquIZHN7+7GmzgAAAAAAAAAAAAAAAAAAADCM94hogUmYXdmgS/EmKutZAAAAAAAAAAAAAAAAAAAAAAAe5zQwdmHi2FScoAwDj/IAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAJd5jZTaqcWQ7YnvKC7aFJ8gAAAAAAAAAAAAAAAAAAAAAAALTZuZ8DG1RTxBWUHc/cgAAAAAAAAAAAAAAAAAAADcPnoolNVQd89PY9iALo3iVAAAAAAAAAAAAAAAAAAAAAAAhIs1VPu9tThInU+wK4iQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD33q8YQ7kfw7uG9DTf2sujvAAAAAAAAAAAAAAAAAAAAAAAUWU9TbMJSV8ypRi6TeaYAAAAAAAAAAAAAAAAAAADj5eNlUTnuZtU2tRNTu1R6UgAAAAAAAAAAAAAAAAAAAAAAJp25HsqqEy+BzzS7PCfRAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAUydtP9ckBhp0CiZt/LHzD+oAAAAAAAAAAAAAAAAAAAAAACmoPqQ0MEtRP4t5W753OwAAAAAAAAAAAAAAAAAAAEQ7gnkh5PcoZ8eubSHIGuKoAAAAAAAAAAAAAAAAAAAAAAAFVlOzghqASg0H8oXDBiAAAAAAAAAAAAAAAAAAAAD3Bqk6ANb/mcrmdjGwOglJUgAAAAAAAAAAAAAAAAAAAAAAGKt+74Ix2xJGLzHWuX9MAAAAAAAAAAAAAAAAAAAA2hBLRsHnzyHY4+5TTDyeijEAAAAAAAAAAAAAAAAAAAAAABcQx8WlbGYlH7T3qklqVAAAAAAAAAAAAAAAAAAAAK8siKKDV/OnG/h2HK+MO4gkAAAAAAAAAAAAAAAAAAAAAAALOLiyQqu0HD3I2/D5v/oAAAAAAAAAAAAAAAAAAACOzvaud+k91JRDAZaiCCex/AAAAAAAAAAAAAAAAAAAAAAAH4hDGE/UIZRQcc5o6OamAAAAAAAAAAAAAAAAAAAArfDS2CcveJrbVsH+BkLsoZ8AAAAAAAAAAAAAAAAAAAAAAAUy+Nu++4OSQuEvE2Z4iAAAAAAAAAAAAAAAAAAAAOtYvm8LsALQlmXJWHzjUCsKAAAAAAAAAAAAAAAAAAAAAAAfP3mwZvYWfBpVR7Cl8dMAAAAAAAAAAAAAAAAAAAAuiy+bKDdEkVZ2BrlHNFtNSQAAAAAAAAAAAAAAAAAAAAAALH0fBsUhzHPar2aLnDZwAAAAAAAAAAAAAAAAAAAAe1MQdd8RLLw372o3QcNLKkEAAAAAAAAAAAAAAAAAAAAAACVB76SPhO2WSD6HzGQVzAAAAAAAAAAAAAAAAAAAAKbktvsPlq2v9idAtsxMgiPjAAAAAAAAAAAAAAAAAAAAAAAXwPY/GCdeeJ5Vo6y4yhcAAAAAAAAAAAAAAAAAAAC2fghDMoRZE9XMaH8G9eo+/AAAAAAAAAAAAAAAAAAAAAAAAIaJKjRo2nW6fWFXGbP9AAAAAAAAAAAAAAAAAAAAQdK3syfYpNv8SpDVzweJJ78AAAAAAAAAAAAAAAAAAAAAABi+PCQh4k8BmU9Dzb/ckAAAAAAAAAAAAAAAAAAAAOvsEvRmciVxLoSo7R+Jk/TeAAAAAAAAAAAAAAAAAAAAAAAMXqs4hYq0yoyywIeNSDk=" }, { "abi": { "error_types": { "14990209321349310352": { "error_kind": "string", "string": "attempt to add with overflow" }, "16431471497789672479": { "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" } }, "parameters": [ { "name": "messages", "type": { "fields": [ { "name": "storage", "type": { "kind": "array", "length": 16, "type": { "fields": [ { "name": "ciphertext", "type": { "fields": [ { "name": "storage", "type": { "kind": "array", "length": 15, "type": { "kind": "field" } } }, { "name": "len", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "std::collections::bounded_vec::BoundedVec" } }, { "name": "recipient", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "tx_hash", "type": { "fields": [ { "name": "_is_some", "type": { "kind": "boolean" } }, { "name": "_value", "type": { "kind": "field" } } ], "kind": "struct", "path": "std::option::Option" } }, { "name": "anchor_block_timestamp", "type": { "kind": "integer", "sign": "unsigned", "width": 64 } } ], "kind": "struct", "path": "aztec::messages::processing::offchain::OffchainMessage" } } }, { "name": "len", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "std::collections::bounded_vec::BoundedVec" }, "visibility": "private" } ], "return_type": null }, "bytecode": "H4sIAAAAAAAA/+2deWCcRfnHk2y2uY+26QXd7JG2ySYgFEpBRKF3C9TWlsolliXZpoFcTTaloSKu5aqAJmm5rAL2oqUUKwUBKyCHKDLDfYhU0UJBRcQKiAjqbwLZ3dn3fWfed958w/7U4a8h787ned6Z7zxzvH2f19PXe82utmXL6pdHmlqXdkTro00ro73xHdM7mpqbmxpnRJqb12f1xbdM6+iIdO/NPmFdT2/fw4Es+X/ZWbY/yXIGykaBclAgDwqUiwJ5UaBhKFAeCpSPAhWgQIUoUBEKVIwClaBApShQGQpUjgINR4FGoEAjUaAKFGgUCjQaBRqDAo1FgcahQAehQAejQONRIB8KVIkC+VGgAAoURIFCKFAVCjQBBZqIAk1CgapRoBoUKIwC1aJAdSjQISjQoSjQp1Cgw1Cgw1GgySjQESjQkSjQFBToKBRoKgp0NAp0DAr0aRToWBToMyjQcSjQZ1Ggz6FAx6NAJ6BA01Cg6SjQDBRoJgo0CwWajQLNQYHmokDzUKATUaCTUKCTUaD5KNDnUaAFKNBCFOgLKNAiFGgxCnQKCrQEBfoiCnQqCnQaCnQ6CnQGCnQmCvQlFOgsFOjLKNBSFOhsFCiCAp2DAtWjQA0oUBQFWoYCNaJAy1GgJhToXBToPBSoGQVqQYFaUaA2FKgdBVqBAnWgQJ0oUAwF6kKBVqJA56NAq1CgbhToAhRoNQr0FRToQhToqyjQRSgQ+RqMFIeRvg4jrYGRLoaRLoGRLoWRLoORLoeR1sJI34CRroCRroSRroKRvgkjfQtG6oGRemGkPhhpHYy0Hka6Gka6Bka6Fka6Dka6Hkb6Noy0AUb6Doz0XRjpBhjpRhjpJhjpezDSRhhpE4y0GUbaAiNthZFuhpG2wUjbYaRbYKQdMNKtMNJOGOk2GOn7MNIuGOkHMNLtMNJuGOkOGOlOGOmHMNJdMNLdMNI9MNKPYKQ9MNKPYaR7YaT7YKT7YaSfwEgPwEgPwkgPwUgPw0g/hZEegZF+BiP9HEZ6FEb6BYz0GIxEYCQKIz0OIz0BIz0JIz0FIz0NIz0DIz0LIz0HIz0PI70AI/0SRnoRRvoVjPQSjLQXRvo1jPQbGOllGOm3MNLvYKR9MNIrMNKrMNJ+GOk1GOl1GOn3MNIfYKQ/wkhvwEh/gpHehJH+DCO9BSP9BUY6ACP9FUZ6G0Z6B0Z6F0b6G4z0Hoz0dxjpfRjpHzDSBzDShzDSP2Gkf8FI/0aRKC4DE8XlYKK4LEwUl4eJ4jIxUVwuJorLxkRx+ZgoLiMTxeVkorisTBSXl4niMjNRXG4misvORHH5mSguQxPF5WiiuCxNFJenieIyNVFcriaKy9ZEcfmaKC5jE8XlbKK4rE0Ul7eJ4jI3UVzuJorL3kRx+ZsoLoMTxeVworgsThSXx4niMjlRXC4nisvmRHH5nCguoxPF5XSiuKxOFJfXieIyO1FcbieKy+5EcfmdKC7DE8XleKK4LE8Ul+eJ4jI9UVyuJ4rL9kRx+Z4oLuMTxeV8orisTxSX94niMj9RXO4nisv+RJ3kf4pvXdzU2tgcdYp0kAmqZ12P/es02Xuzp2Vl53hyvcPy8gsKi4pLSsvKh48YWTFq9Jix4w46eLyv0h8IhqomTJxUXROurTvk0E8ddvjkI46cctTUo4/59LGfOe6znzv+hGnTZ8ycNXvO3HknnnTy/M8vWPiFRYtPWfLFU087/Ywzv3TWl5eeHTmnviG6rHF507nnNbe0trWv6OiMda08f1X3Bau/cuFXLyJfI3HydbKGXEwuIZeSy8jlZC35BrmCXEmuIt8k3yI9pJf0kXVkPbmaXEOuJdeR68m3yQbyHfJdcgO5kdxEvkc2kk1kM9lCtpKbyTayndxCdpBbyU5yG/k+2UV+QG4nu8kd5E7yQ3IXuZvcQ35E9pAfk3vJfeR+8hPyAHmQPEQeJj8lj5CfkZ+TR8kvyGOEEEoeJ0+QJ8lT5GnyDHmWPEeeJy+QX5IXya/IS2Qv+TX5DXmZ/Jb8juwjr5BXyX7yGnmd/J78gfyRvEH+RN4kfyZvkb+QA+Sv5G3yDnmX/I28R/5O3if/IB+QD8k/yb/Iv9mpJDtNZKeA7PSOnbqx0zJ2ysVOp9ipEjsNYqc47PSFnZqw0w52SsFOF9ipANvNs1042z2zXS/brbJdJtsdsl0d242xXRTb/bBdC9ttsF0CW92zVTlbTbNVMFu9slUnWy2yVR5bnbFVFVsNsVUMW32wVQOb7dkszWZXNiuy2YzNQmz2YFGfRWsWZVl0ZFGNRSMWRdjoZ6OWjTY2Spi6mRp7ephuTfny93q741tmtLV2xtbFt85sYn+N5cRvntcaizZGOzYtOdJ+mss21s9Wqh9fa6yfpVQ/e218c3+q/16a05gkbVsUbY7E2O3lqrGmmQletdbIit/a701DJBaZ0dbenbypubxPHJz5zt36qakCb9Xwq9NThcSvNi6ZbPjRmalCCjV1iuFX56UKEoMtqYLYYFuqIDF4UaogMUjiXElskqzhShKjhC/JzF7NlSRmr+VKMrM3cyWZ2e1cSWJ2B1eSmd3DlWRm7+VKErP3cyWZ2Se4kszsU1xJYvYZriQz+wpXkpndz5UkZl/nSjKz73Elmdn3uZLE7AdcSWKWTTN8UWKYTUV8UWyazVZ8UWrczxelxoN8UWa8ii9KjR/JF6XGj+KLMuNH80Wp8Tl8UWp8Hl+UGT+JL0qNn8kXpcbP4osy40v5otR4G1+UGl/BF2XGO/mi1Pgavig1fglflBm/jC9KjV/OF9OMm1YJimumuYNeZ5wd3zS/bWUfv6pILr9M7GFq7Eh8x/Sm1khHN6u0oD05J2ZvmtbQ8NHtJy1xFnbOa2346K+DW4Kx5WS68ZSJpHnzPecYWyOf7xrDtQLebVNbFam5W2akF0r6oViNXa7eD8XifigE9UOxuR8Kjf0w8L8evkPSruTyLqdd8fJdkVjZt8S3LI61dUSte7EQ0IuCm80332w+b0VQrcBcrSDVRptPbos0cLeSx8NlN5qn5GbSnnZSO/lf4aQO1jpY62CtndRO6mCtg7UO1nr0aie1kzpY62Ctg7UOMdpJHax1sNbBWgdr7aR2UgdrHax1sNajVzupndTBWgdrHax1iNFO6mCtg7UO1jpYaye1kzpY62Ctg7UevdpJ7aQO1jpY62CtndRO6mCtg7UO1nr0aie1kzpY62Ctg7UevdpJHax1sNbBWgdr7aR2UgdrHax1sNajVzupndTBWgdrHax1iNFO6mCtg7UO1jpYaye1kxl00hBqc1LFXOM1T6JWf3rzRBhZNdjc5tlrzQSP6jdUNrPWbO+1vg+P8XsxM9KyuNvQs1tuMtafuWV2U7S5gVW8avIDu5dc9sLec2aOu91zYPX+h+4JnP9y6f683GHPVxy6+kZjxVnJiu+/+fQVG7Ie3D16n2f7mMNvv/CG499dveCtvuZRb10Y3XDb3caKs9Xaw3THc9Tq525dFI11dbRaz5V5xrnSk5pn0qad/NQP0v5ekJqxNp/Y1dLOVNSVGCwDV4alGImBYqw8zNq7fKN3wgGSABorFNhUKNx2crSz85TlkVZLM3nxrf03NW9Z0uVCmrMi2aKz2c00Nbb2j56r90QuiEXrl3bFmpc2RmNLYk3NTbFu1nOx6KrY3qyx8Z3zoy1tHd3Mvw5mMaVor/DKMOGVPOGVfOGVAuGVQuGVIuGVYuGVEuGVUuGVMuGVcuGV4cIrI4RXRgqvVAivjBJeGS28MkZ4RayDccIrBwmvHCy8Mr5fclsXN7W0N0c/DlT/af+X/s0Nu59MnaLE3Lxk8hHHyP+q6ndPj44HOh5kNh6MF17x6XjwyceDwX9OcLAf8yk3E/L47yMpfN+RCylKLlh8ZadAjeA1EwqVbiJr0Ocf2eYPLnGdmlj4rhEeCaWvMq0ontRKM1WNeqcl4ZcO+rjM4jCvJLmJUW7BUtUTJBOhTI1QYSaU27hfIXZ/uJrxEWbCCDXCSDNhpBohz0yoUCPkmwmj1AgFZsJoNYLFYeQYNUKRmTBWjVBsJoxTI5SYCQepEUrNhPFqhOGOgtJ1oqDkcxeUfDTn0SR8g/nzauLT/ULV21M+3S8Un+4XqAZ8QasVqj0tKVWdrwVmS81mS/n7NnRDGX8t0VlbzeeUZfw6XWC6zGy6zPacslwgrjLef7O4ymnOZkeqvkVk2OtO1V6asysJ3ymC50g7P2379+LE1P6vM9ovx1hHpD62uLu1fkakfnl0XuvKSHMTWyWuk+zut8+NRtqndXREuvnTUPEeyLPOsCLd8nHl3vQ/l1uuqa3PCVUadph1w+5OnC97zxDCN83vahZy80XVSsz9kWMrTYsRXJImMcNJfyFfdO6Il1+nOR/V9v57paGgxOS/V3ZzJe5uroQLecaYUsj/TPS4s8B4qp2rOjkkNHWW8AGzV+GGCm2bvVQqm1xzO5Ty7e68L3P5TYosFIo/bFpoHyYD7kZzgOYQ+9EccDeaQ25GQ9BcKcR5YhJ8kC86dyTA94qg2gQ3/leZK03gb8XofxVfdOW/MBpNdOO/xU1PlPk/gS+q+J98eiaoNMmN9xa3PEnm/US+6ML7OaJK1W68t7jlapn3k/iiK+0UQP0PKPofkA3skLuBHZLMZEGZM0NtzxDeKyUbq5Da3DlKfWMVEm+sKkEbK4u2qpRsrKpVD4+cC7da0g01aZIYmGXfNXdlDb9KEJiuMZuusR0zYcHEXcP7b564wzTn7f+1IeOTrJb8/LWBfvRkCZ0SNLqPX+2ZGz1EvXVJuKd/3WSQcGoqH9iviRYJAvvcXZRZ2K+injxutSZai1cOci0+SrwWr7Jdi1sMgir7QWA1crhWMckkzLe6AFpphvodrPpqbkv0zawVXZHmTiGh0qKHaqhnRLL12kUm/ILur5R3v596Rjno/qqh636/m+73D7L7K6XdP0FhIV456O6vTFO1VfcHuO43Bgiu9kR5gKgRKKRKrhBmf4IDhfiHTiE1tgoJu5kla82VwmmKNyqklm910TC0ClX2CglLFVKVJnyLedtzGKcQ8w8mUs/RyTlmssKs6iS2VTmNbSHr2ecoznXx5FyT9H82fgI81oG+a4ZO3z5bfVvEHZ+bCFjldAKc9P9MJLP4CJgUgjEWcgE+II+FoqOtkFwrAeo50YFWfEOnlYCbWBgYZCwMSWNhjfDhofTYzWUsDKUNAatYuMR+sRTaaoX2yTs/RD2nJdGdwlWsxd7bp/pvWZT33j7x3rsKtPf2SRfhhtZI6yWTeLirJaA93n8cstzRbrNR9cE8R8m3fDCf+0YSfq67maPItGcP80XnEYY7qhthYtbyxZ0fMz8K6Qva16cu1fVTLR2pHbK9jFccncO20VkeaIukgbZOAcr1V7G8bZ0vOQJ8fJQ+cxD2VyC9v2r5SqL+Cg9df1W56a+0ppX1V0A4eVvMEeEhnyPC4jkiAJojwm4OamqlC5Zt05sj9edNb1sVv2NhW2e0qaGt9YiF0Y6Wrhj7ZVtrHz/6cvl+yHWn7CK5skWHFxY9GhjyE/eAuEf9oB4NSM9eBqviCgUhhSUDK23QJaa39dLBWaIgx1pbDdcJpuPatLnBNB3XUU+f7AlWUKFbAs5OwAOfuD2FE/eQ1RroRtVNnM2Je4DmPpeEbxT+mwF3O8Qg9WzJ7GlZ0M0OMTikO8RqhdMyJzvEaqc7RKvTsmrq2eVgh+juMIntEXc76P7g0HV/yLb7q6V7FueaqU6Ts5vj9KC7w6Rqp4dJQevuv8/905SgvPvZ05QHHHR/KJNPU6pBT1Oq0+Qs6f5KhYdpQQfdH5J2f5A3bDlAid1Z+bPJ2eFxhfnQyYOgoNMHQQHrqeVpR2fl/qT/r6jObpW2s9sLmZ3d7M/Kg27OykNSKVZKT3ImgUXiH4xIWATaZ3FWLhRCpUAIAbkQKqnntcwehFfaCsEv/cdCrqakgHSpq3IQHhi0EAJp+rYSwgEH85ybg3CGfoc7CE97peGej99oaGnqrO9/pX1RpLWhreWjc6Be8XvHvea35BW6lGtI49bGzxcVDmOCqi9NKm/dg0N/GBOU7tnEO6+gNNr5FfomIHjv5a7Uay/tXZ3LZ7Uvj7ZEOyLNYokEey1fR+kTa8r6vRh/dp+jt1+y3SmwWCtQKzATCkz+w3etP62/zOlvjtaf1l9GZ+ACrUCtwIwqMF8rUCswowocqRWoFZhRBVZoBWoFZlSBo7QCtQIzqsDRWoFagRlV4BitQK3AjCpwrFagVmBGFThOK1ArMKMKPEgrUCswowos1QrUCsyoAodpBWoFZlSB47UCtQIzqsDhWoFagRlV4AitQK3AjCqwTEmBlbiX610oMDD06WwD0jdUTO/1cq7JXkPxK/UNSoGBT16BvMN3pBxmt9PW0TA7Uh/r6bnexWcxJxivDDTRTGGNKkGNWZKbV/+wovijjyXXfyIf1du4ZLKTD+05fwnK4WcMfPbfKXL1SntA+kq7T55aXOSIu7QBYZr7UmZfrHSZusiujeussmlwrWIKZHUOGjngLm1ArdO0AVYvVtbS3Nfs36ertXr5VCxyH98q4nxgYclqJGCfJ8MycxvnlFHnPr4ofGHW9PkOf+otFPjgOGD/QRF5GiHncSNNntJMZ8IsV7XpWa585p40D+0hzEpm/8502Ea2stf7axWg0qxkLrPIORn5dU5Hfq1lkh5vtv3Id5ABqMwanmuv7UPcaNsi9B7C+2Vs/zq+6FTbYb7SUL0GPqiMe3XSWb5YOgPVKoVU4Ut4TgKqXNnFQ6XsCvepcGyUHaLeMfbKrnOjbItsDXUyZYf4oouoHcpEbkL7qB2yitpJEcoOKWpVsteGVG9JeasdGvrstbK2UsugnaykkJkwxGcmDOcqRBW/ZPXo5+/FNmNstZstUkia98cnH2kiR9yl1qqm3smZ/VBJte2IrLFqLhcqc/yhkpBCx0E/VBKy/FKE9zj76aTG9RapxnxAyDWzeHCE7D/eU+zuU4fF1DvTfo4rdvepQ1cf/rT4bGWpbNFdwhedO1KcKgo/91bmxv9ic6W0zwEb/S+W3Vypu5srTXlpGnsl/M/kfTB1SupPFQnkDKEfppGXXp/zwKzDUupdbD/ySjmR8/ASB+vM4oFEQf1ngFbtW2g9Ok5NerVSoccdngsWJ88F15gWEMlFRir4T50iDv6v5i+clXPnlf745lM6Iu29fan6CSkkvnw8oLGBPw9LzUCWq548Pr+SsU5Oqs0SP6fe1vSZzZvyxOmyKjnvWVYoMFbwpCqkWS5M/SDt70Up1waa33uuoVXyU4zEADJWzrf2rtDonfCbuwmgsUKRTQVDpDeaKTD1CVPxMpG8vKqr00SLtQl62ZOQ2SD1/GTeG+889khjj72eB2no4hkPHbrv9d0XDLmhY+P7PxwbfmSPraH/A5Nv4PX1VwEA", "custom_attributes": [ "abi_utility" ], "debug_symbols": "tZxdbt24EoT34uc8qJvNv2xlMBh4EmdgwHACT3KBiyB7HzalYh0nECMf2S/x59iqIil2iaQO/P3m493f3/756/7x0+d/b97/8f3m76f7h4f7f/56+Pzh9uv958f2v99vFv8nBb15H961r+HmfW5frX2t7Wuym/ciDrmBORRA3SAvAAEoIAAMEAEJAOUM5Qzl4jrRwa/ydpUE8F/2Fpa6QV0AAlBAABggAhIgA6BcN+W8LAABNGVdHALAABGQABlQAHUD8cvVwQARkAAZUAB1A10AAlAAlBXKCmWFskJZoaxQDlAOUA5QDlAOUA5QDlAOUA5QDlA2KBuUDco+6TQ6GCACXNlH3jKgAOoGcQEIQAEBYIAIgHKEcoRybMqhTf6cFoAAvF6CQwAYoF0evM1eDiE7+C+7oJfDCgZozTCfCV4OK2RAAdQNygIQQFM2b08JAANEgCt7w0oGFIArt0LLXjsrCEABAWCACHBl76nXzgoFUFcoXjuWHVy5OiggAJpyXBwiIAEyoADqBrIAmnIUBwUEgAFcJzgUQN3Ai2gFvyo5GCACvD3eCy+ZFQqgbuAls4IAFODKxcEAEZAALuij4ZWSvM1eKSsIoAkmdQgAA0RAAmRAAbiy99QrZQUBKMCV/cZ5pawQAa7sLfRKWaEA6gZeKSsIQAEBYIAIgHKCcoKyF1H2u+wlk30QvGRWaFdl75eXzAoFULff8ZJZQQAKCAAoe8lkHwQvmRVc2RwKoG7gJdN/x0tmBQUEgAGg7CWTfUZ5yaxQAHWF6iWzggAU4MrZwQBNuYhDAmRAAdQNvGRWEIACAsAAUBYoC5S9iEpwqBt4Ea3gytFBAQHgl3ubvVLq4iAABfi6wy28UlaIgATIgAKoG3jJVHUQgAICwJXNIQISwJW9qV4yK9QNvGRWEIACAsCV/TZ5yayQABngytWhbuAls4KvLhYfBa+ZjcIgGxQHpUF5kC9fFh+MvkDr1FdoK8mgrue3rC/JVkqDMqj0a73pRQbpoN4+v6nFBsVBaVAeVAZVUF+6LcVJBumgMMiVxXvZl20r5UGu7IvV2lduTm1IFqIQlRiIRuxO2jERM7EQu5s5ykIUYnfLHbtb6WhEd9PQMREzsRDrQC86oBDdzRdNDQORbhqJdFO6Kd2UboFugW5BiXTz6gXSLSQi3QLdAt2MbkY3o5sFIt0sEulmmUg3o1ukW6RbpFukWzQi3WIi0i0WIt0S3RLdEt0S3RLdEmdJoluv/A3p1mt/xUy3TLdMt0y3TLdMt8xZkunWt2sb0q3HxYZ0K3QrdCt0K3QrdCucJYVuPTdWrHTrybEh3SrdKt0q3SrdKt0qZ0kdbtKzZMPhJmuWrDjcZDFiJCZiJhbimCUidOtZsiHdmCUidGOWCLNEmCXCLBFmiTBLROnGLBGlG7NElG7MEmGWCLNEmCXCLBFmiQS6MUsk0I1ZIoFuzBJhlgizRJglwiwRZokY3ZglYnRjlojRjVkizBJhlgizRJglwiyRSDdmiUS6MUsk0o1ZIswSYZYIs0SYJcIskUQ3ZokkujFLJNGNWSLMEmGWCLNEmCXCLJFMN2aJZLoxS6TQjVkizBJhlgizRJglwiyRQjdmiRS6MUuk0o1ZIswSYZYIs0SYJcIskUo3Zokuw02ZJboMN2WWKLNEmSXKLFFmiTJLdKEbs0SFbswSFboxS5RZoswSZZYos0SZJap0Y5ao0o1Zoko3ZokyS5RZoswSZZYos0QD3ZglumZJ7ujHP+uvdtnehDU0VqwDe2j4WU9DISrRZYN2NGIkJmImFmId2EMj9Jb10NhQiYHYh6x27Aq+yNQeBBt2hd73HgQhdQxEI0ZiImZiIdIt060HwYZKDEQjdrd+K3oQbNjd+qj3INiwDuxBsGF3653vQbBhIBoxEhMxE8toQw+CFXsQbChEJQZiP9deOkZiP9vus6QHwYaFWIGhB4FpRyEqMRCNGImJmNGG0INgwzqwB8GGQlRid7OORozERMzEQqwDexD4SWPDrhs7GjESu27pmImF2HX9voVe8hsKUYmBaMRIdLfYe9yTYMNCrAN7Eljq6AqxD3Wv7g0zsRDrwF7dGwpRiYFoRLpFukW6Rbr1JIh91HsSbChEJXa3Puo9CWLvW0+CDROxu4UfP97d4LXRX1+f7u78rdHFe6T2dunL7dPd49eb94/fHh7e3fzv9uFb/6V/v9w+9q9fb5/aT9uI3j1+bF+b4Kf7hzunH+949bJ/qWdy3C73zNUh0dbKz0RkXyT7QWqXaIfnQyCXZ9fr/vXtbHm7vh3LsgG1vqAXWUYvYky7vbB9kTaNMJBt7ly0Iz+XiCcHIp0diGkfvBS3PqS024cyGcv2jm7MiPaaLg6RdLgVOY1WtFclu62Q5W2bUf2Efm1GO5rbb8Zkara4WnBPGuuy0wy/cXsabd2UN4m2WMp7CtNWtE3saEVb814zGMLBqJN7Mpme2Y8n1+mdl4vpmV/SkZjZkbx3V2UyQUNRTIzQ3tVcN5y+8EErou5pzOZne1+dOD9326Fyuie/aYVdtKLstSLMqrWG0YpQd2eG2ttqtHNvpGc77r54EGV5rjGZoX5Mgmnu5yR1XyXvq1jb1W8i1jarQ8Ps+UzXWYzG0Y72pB8KcTneChWMh7WF+24rwvTBmEd6tYXWbjtmGiGbjHsry3479G012lmMjTFN7VTkQuX5AzLMZlkcM7Wh7WtMWxLqqLpkz/rzk8pkrrY15XhI2v6dmSlcPOzrvsJkltoSkEC2XDyafulHmT3e0A+9qNqXtEILGqEXq4VfFCYZFtOCqRHbNNnth+n5sZhpHBuLqcKxsZjNzvbWA63w1x6TnkzmVjRoxLg/O6cKitkZw/7stFeYnXZ6dlp52zuS88iL9mIn7vYkzlR07E/86PDaucFVdXtJNWmJna+2GM/f25nGsXs7VTh9b1vjy+hHkqueJ0fHIi1vq3FsPKcKh8Zzvuqp2CBYmKwUkp1f9fxmJcmdip9U7q4k00SlLjZWG+3F6tAITe+ZRp495bm05vq+HWE+V5itRWscu8d6sXN7iUZ7YQKN9pZEr9PgI6GdvecrNcZKUmMK12kkbsjTRQa+TCOMvqR0nUbbk9vYk1vd1cizHJW8jF3Cki9m6QuaMQ7PGu43Y7p5q+MYsVa13WLJ0y1TiJGbprxfcrme37yV5ezmbdqKg5u3oudjrLzCxqvY22oc37yVdH7zNm/J0c1bKWe3XqWef2DPNI49sKcKhx7YJZ5fDNZwfixqODsWU4VjY2GvsfWq+ezGqb7Cxqme3jjV8rbjeXTjJMsr7Jx+c2sP7pxkeYWtkyyvsHeaihy7v3OJ0zf4eE/qG4scHY7TWTpfNRzb/MjsddPRZcN8KWbC9zRmy+5STCTOXnBE7l0uNse+InouMnno24gAK7y5Xscv6A0f+TEu4crlqRXhmNQwGZPp+jQnrk8nY6LL7HRuvMCKdrkA+XnKz14/Hc4iPX3iOR+Ry7XyxXr71xGZ5XPmrC/CeVJesIdJpY49zEXA/3J7dXomv/BTBBc7/vKCVW4aL3trunxc2ZUaIUzubX2FCRJe4WBqKnJwloXTR1PzI5Ci4wikXnmMImN6NLzuOKeZGzXqle3gEYhcewTSP2W2acQrj3OExygSrxwPJqpKsSs1OKbtfOtKjVKoceV4aAhDI+2PR/8E4Mkzoelr0oMZdFhjlkHTt0hHM8jyK2TQTORgBk0lji2YZ0+5Y586kXj6Yye/acWRT51InH3sJI2ZHlLa/7jdb0SWVxCJZYjk+NPnxP5s395+uH969gc+frjY0/3t3w9327efvj1+uPjp1/9/wU/wB0K+PH3+cPfx29OdK/GvhLR//pDQ1i4tCOXPdzehfZ/aqi0F/84/T9x+3HbZ0tYVf/7w9vwH", "is_unconstrained": true, "name": "offchain_receive" }, { "abi": { "error_types": { "1064022259863234536": { "error_kind": "fmtstring", "item_types": [ { "kind": "integer", "sign": "unsigned", "width": 32 } ], "length": 101 }, "10791800398362570014": { "error_kind": "string", "string": "extend_from_bounded_vec out of bounds" }, "11767537932002121452": { "error_kind": "fmtstring", "item_types": [ { "kind": "integer", "sign": "unsigned", "width": 32 } ], "length": 66 }, "12820178569648940736": { "error_kind": "fmtstring", "item_types": [ { "kind": "field" }, { "kind": "field" } ], "length": 48 }, "12913276134398371456": { "error_kind": "string", "string": "push out of bounds" }, "14990209321349310352": { "error_kind": "string", "string": "attempt to add with overflow" }, "16431471497789672479": { "error_kind": "string", "string": "Index out of bounds" }, "17110599087403377004": { "error_kind": "fmtstring", "item_types": [], "length": 98 }, "17655676068928457687": { "error_kind": "string", "string": "Reader did not read all data" }, "1998584279744703196": { "error_kind": "string", "string": "attempt to subtract with overflow" }, "226260835993583084": { "error_kind": "string", "string": "unrecognized origin state" }, "361444214588792908": { "error_kind": "string", "string": "attempt to multiply with overflow" }, "5421095327929394772": { "error_kind": "string", "string": "attempt to bit-shift with overflow" }, "5449178635769758673": { "error_kind": "fmtstring", "item_types": [ { "kind": "field" }, { "kind": "field" } ], "length": 61 }, "5795322663222853459": { "error_kind": "string", "string": "Fact payload length does not match the value's serialized length" }, "5877671415717063005": { "error_kind": "string", "string": "get_shared_secrets: response length does not match request length" }, "5944216811419924659": { "error_kind": "string", "string": "RewindableRegister write originates behind the current version" }, "9530675838293881722": { "error_kind": "string", "string": "Writer did not write all data" }, "9791669845391776238": { "error_kind": "string", "string": "0 has a square root; you cannot claim it is not square" }, "9829419490427811213": { "error_kind": "string", "string": "DstLen too large for offset" }, "992401946138144806": { "error_kind": "string", "string": "Attempted to read past end of BoundedVec" } }, "parameters": [ { "name": "scope", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" }, "visibility": "private" } ], "return_type": null }, "bytecode": "H4sIAAAAAAAA/+19eWBdRbl4c/d9z55mbZaurCLi8iwUKshSdhAVQ3spbdOkTZNattICCgpIGtLSlm4kbSltwaeg4PrEhz5+yn0ub0Gf6FPxPVeeC+6C/BLIPXfOmfm+mTl3TnoOOfnr5J4z38x8+3zzzTfe4S3bDq+7vnfp1esGugfyWzYfOb1/RU/PiuVndPf0jMzYsvngxSt6l/fk7xvaMvx08wz8r2IG95MZQ/cNDfEBbZkxNDTeIzGy50/wbj5wRl/vuoH7Nh9ctKI/v3TAs/mhs3sH8svz/WOXnnQiH6ixfYVU+00fN7afIdf/xzfvn0DqlpgG59BF+Z7ugRXr816zM9Eg+OQgzNh8dGIsy7oHus/oW3O9NqVnHyUHRUAfO69v/XDpBw/R4PVZbaDH5JHFT7l4mbF5/8UDfWu26AZKADPQ74wDZ63I9ywbB/vQN6/5c7D1N2fnczvbluf/tOKsnT9+4uXTL551260nrH/iur8aGy7SGvLGY2h4pmBDilXPEmzoMTZcXKaMvEuqfcWwsf3Zcv2njO3PKU685sTOt6zZ/s3c812t33vnl44uGKn9/ay3Pf/kux78zV//359n0Kh+t4axM8+reunO8Js/d8ZJ6z/x96drPt7/dHv86vmn/mnjFb/oXp47amx4rtbwnd2L99/0jQ9c+NGzjry47eQP99yZWrjwwqXps77+wxV/rqr7b2PD87SG//6Zf0w88+wPnp3V+63Qr2/6/QdHZ3z8ieDmmXuuK+S+9L5TZhkbnq/haPTSU7kootj4Aq3fe0546rFL73ju+WsW1X7S+9sb/+efP9P8wf9O/E/QF/jP3Pwb9xobLtEa/uXFb9/1wIwvP1b1Y+/D1cd/8uY9//CHGy/49XBP5a9vzj/w6JPGhhdqDfu7v/mVmtnPnPbPqx9Lfq/itt+f/nhFu+/Kv52evfauO1d/v9HY8CKCG045mTPVitX7jO0v1jr+1Esnn/uNB8+Y+bs37f39e/79ns0vfOWcU35SG3vLV9a967lE5C3GhpdoDX9x4MRN8x/5Rm/kc6f+9RMb3/y/d/6s+cQvdo+8veG9P/7gc5fmjQ0vLTas4JDF2PAyCcaPXnXuucb2lwtKvN/Y8AqtYU3o8Pf+8rlvf3j3W3/3wcZ//m3D5Td5f3tD8kN/2uJ58a5r/vCiseGVUmwYMDZ/j9bvz+5+4Jbkx4f3Nc8t/CGw+N5fXf3S2f5T/6twU+0/3/ryz39zn7HhVVrDb7/n5e8/nrzvhg33fObGU7uy3Ufve+63v/iXrz+afOlHj6x97k3Ghu8lUFRxW+u6+8P3VJz35VvnPx6LfPnnC/eefkbh67d/tCl5lGL89xUbznlb+DcHPrrxQzN++NAvP/bHOZ9/5/x048L0gn9/4D/re/uvqv2NseH7ZfiXwRRXy7WntPEH5NpT1qBbSv7o8V+jYfzrL7Wc/PR/tDyRWLzrmfdc2RRNfOfzu/7wrh2PHzzzP9evXThobLhUa3jviTdEfvCl4Xl3hnOvjr171kcDN76y+TPnvHLJVz55eMXyNd82NlymNdy8/9D3F95TOP6FlyMfPa/79g0n3fVvl794Q81D7f+z8pGGo2ljw7yc4aG06rVax7GKz3/4598I/2n3h9au/Lvv4Y+8fEfnz941OOA94aN33vumXzxmbLhcrmOfsf11gOBTCsjYcAVHY1RADVfKelmG9qvk2lNc2SPX/p3G9qvl2keM7Xvl2oeM7fsIxXmCPPrWSOldqvlaqd4pldIv1TvVfJ1Uc4r0A3Kop4zdoFx7ymitl2sfNLb/oKCVpnhmg1zHUWP76+Xax4ztb5BrHze2v1GufcLY/ia59klj+5sFEU/ZhY1SDNtsbH6LVPN5xubPbpJqP59qv1mq/QKq/a1S7Y+n2t8m1f4Eqv3tUu1PpNp/SKr9SVT7D0u1P41qf4dU+4VU+zul2p9Btf+IVPtFVPuPSrU/k2p/l1T7JVT7u6XaX0S1v0eq/cVU+49Jtb+Can+vVPurqPZDUu3fR7XfItX+aqr9sFT7bqr9fVLtr6Haj0i1X0q13yrVfhnVfptUeyoc8Oz9Uu2vpdpvl2q/nGq/Q6r9dVT7nVLtV1DtH5Bqv4pqv0uqfQ/VfrdU+9VU+z1S7Xup9nul2vdR7fdJtV9DtX9Qqv1aqv2oVPt+qv2YVPt1VPv9Uu0HqPYHpNpTcYhnD0q1X0+1f0iq/Qep9oek2m+g2j8s1f56qv1hqfY3UO2PSLW/kWp/VKr9zVT7Rzh+v6f4cPCi/MBgf+/mI2f19edXLO+d2KTa+rnuGwbyS68eHOi5enl+4NKBFT0rBq4f72Egv2Hg+Rk1mx85L7+6r//6hcuW9efXrSttHfnBNwHwTRB8EwLfhME3EfBNFHwTA9/EwTcJ8E0SfJMC36TBNxnwTRZ8kwPfVIJvqsA31eAbmA9qwTd14Jt68E3DBMuN76+vXtOTf52tnfafbhHP/eSUk6Vg7r/0hBNPxX+VHffQEKYPzuoe3xPu6+mZiKX29W6zszbYRuFlPPinhrYjJjjZY3xT3K8Dfl80Ynqs+8/o1qUIBAi6TH7yyOkrerv7r3/tnwvWjBBEGDtvsIfZNLL54DmDq9ecfS2ROuAfD7bsn/h1y0Zj+oO3FPo1vPGVguqvtx33OKm0hphc8KvB2ElDKQPF8KaR5Lgjr+NhvKsL1mzVmoyN0+J1cS3CIMb1ei5HIbVtEjD9DdWln+zd8I7AcJPxXaj02Gx8Fy49thjfRUqPrcZ30dJjm17SP6OT9DPXXJdfne/v7jk337sFlvMtTD0HNwhsMTCrngIl0hw8c+1gd8+618hAIFLL2aCZMTi+8p8kTrqOJoGW0UTxWlB2c4bJNRVGrqnQqbaze5e99quxc79s9gmEMK17es4ePaE/zSb0ls0PvyvfvWZhf3/39SRaK7ZsPvD6jwbaVQyLa/miyA+LWElgigFkios37z+3r3sZW7AClEoMki91fRu/JGQ3COhXH0RNUCeuLWk+mo+94yvIydf7QDbuo/WIUas+LIFHXwmPQCPvo+eO0/GS67p7WYLp0w2EMaWHNNGcCc5pLTFyFUsSL/jG5y5J3CUJuiRpAN/MdJckx2BJwlZKDbQmy3A12UxUk2V0PiSlyWZq2bwTmgzqgem8BEjIY+f3kSaEcEpnTixTDK9nEtpy4jXQb9OE8z7xnu15Aq0aJ5Coa9VE9ky5SzPlPJbLGFhsfPbTk7q+4LmJ7qFJZOf6t8e96WtGU9KMeHktsnkU0l5eC+zlNSvy8lpohm8ueXkGbLSSQztw8cC4SWW/bYK6a6W7ay11h4H0KANZXA+rBvjsI0Z8NdmVe5qmhHvE8dtUanTo9J7upatO79uw+fElfevyK5b19Z64JN+/enCgeyJCNEygt8VHksEH9deM9Ed7+c3ko85rfLLkNS7tyXf3a+ucoaEtwOrkjC2cSAqhGAMKgi0tYLClCeu6YRIuFPJgsG+rbP6eNPu2wuzboIh9GZzYACq/NnJolBYg3tZD3bXR3bUhiqVNx4mKQPKUn/kxBuw7RusAsiKYPy+uOn+KRAobih+9Qn8ES53fcqnzw1LXqEjq/DS2G0GpayCHRlGiQUDqGlAhx0A2KwPJY0DzYwyoB9li32lrAA3CM/m7l+Qowy62T1Z0iouyZjAw5peYV6CUPQ3P60xwOgHrptPAnU4jQqb19HQaBdYBAZTyOrfriZLbtWZw3XVEdBkKqDSy9xCGISeNHaYOBI2hZXbQOgh6ieOxxXP7lq87/fpLupdfJrGFIexNSvhrjZZvSTRa7681inON3JZEo523JBoEtyTK3ntrKHvvDQrEF7cQChXVIG0PFYNoxg0ZEhF04KeQPF0DXkctcgizlgHWV4S6ygGf5EqP1cAn1aXHGjYyahDplFyPV8tLZxMsnTWKpLOJZt0a0K9rJodGmRDirVdiWd+MOA8ESJ96kEH1IEPqQYbVg4yoBxlVDzKmHmRcPciEepBJ9SBT6kGm1YNsUA8yqx5ko3qQlepBVqkHmVMPslo9yFr1IOsYBXdENqf+mvnjj8CFaPm1iWrkPQof7FEEFHkUPmQdTXkUQXJoFAmCAh4FI+MpiFA1yI1vuABdgC5AF6AL0AV47AGWW+mvqmwvo1ogQHQHOHF+gMjLSuIuJE/QgH+UnkKI431VFx9ofwP2vsKWJ3eEYe8rqMj7CqOcBp8QCNNcGOGydYTuLIKwtRMAllhMgO13Qt2GQLbXdmBopg8VEr/VQO+W2IgNwrFmP/kIDZblsBPiaYQZIh/BrBbvBFTmQELghlmwzA0zP7xh5udumIXQcwUUq4QE1iZehFarKLx6za12AqRmN8IMko8grXx6WukoAtHKbx2tvFxaMTZcvCXEUrTSoQg6h1Z+5oYJi4Bkbvisy9zwllSgicMhUul+fjLdL+CTkBQfrNX0klL+OVXfsT/B6p5TZVgKHy91MqBPnfST/gxtYH2Fiqe0hPM17A+eLtsvnLF5/yX93RO1tVkOIAU9IQe9Ecw8m4Hs1gXkj7gmzBxx9ZG9W3FU1fAuVnqcZXwXLz22M2gdKVT8W9lrI4zWoK7zAc5hhpwz5N5PninRHdTQNGUfY57hQsVzmqk9qfx8A5+F+QbQYq2PPhJN+eLPgyjjL0F9TLwlPqsB/2/mGrXiR6g2Gf/gJ2X7FBiH+ZnUXL1i3dIJcl7U3busbzU7N6kEYgte98EMhwRVc4iPpvbPZKnt07EVg9qeLg34L4+BlPgFT8T7D7IP3moYYiQ3T7BncW6/1s/ti6W5Lcv35AfyepdpaMjmzoMNShfwmfUl2eiY7ig5U7H8SQP+R0IHUZYTXtpIVtYIyi9tYvDSJqpoaROjVw3RzSpSC2MBKLUwMGxiReArJ7kQmyQdRIiRjwDEOAIxT0GMk4+gJ56Y1Evkx1pwjmbhRMFTqzGuz8xAl+MDNa4qkuRLtNRDgmgELFHCkPsuEYbUJjJATSRCPppAzaAcahIs1Ixeeir1IeGJJwDMxFlCPgELmEZU82dPZXBOP9QsgTZbBzVLjl7Qr/OcyRmZG+L5IIGMfSV1lKIkIl7wVGt++imgK7xWk5qZ4u5yGHSxiQh6CS7L4niaaRsSVefKRmVNZFi3GGANuF2bkaHC0eMlUzA+ir7+ZRM+z9DQjqnwdIDfrxCvA6LxgYk6JDumpJ4EEbjCakwUqdMuEesmYoJw5CFIOF5UTAD2iBKWe0QJ2COKK/KIEjTO4ko8ooSNPCJsknSwOCGg45MIRNrHSpKPAMQUApH2sVLkI+hjpSkfK4X5WOmC51xNyt5sZqDL8YEajX+WfIn6WGmiEeBJRMivRbgiikyE9rGiArYHQ82gHGrSLNSwfCzCgUoDmIlB/hrkibAcmBjXx0qhzUAfK230e+Lk1E0NEfSxUsa+0jpKURKRKnjOgX2sMO1jXQh+0wd6UivBZfgiOnw9+WYN0SMzOHUJba/i6ryvuGw0LYJ7X+MDvlyb0Wps+RThS3+MHWeJIaY8brkpj8OmPKbIlDNWeDEwkydFDo3a/04JmECGskshmTIpczYQBzn57kz1YwyrBxlVDzIikdUVA9w6+ZPXEcGT11oDP9tFDAfEzl4HCNUgPl8h1z9MbhCUuzfio/dGJMrJSh6nMHF2O2B9OVms1ip2liOAnuVoMNddmWwelGVzH1BioEKMzSscHHXwSUcd4JqgXltGHW4qu0zYeaIbQeUnls1zSmKZD1QOZEE0VoLeZLtn75XQDQHEqpYgDiuHeFg5xP3KIW5TDnFEOcRNyiHuUQ5xVDnEIdUQNyof4l0OYEf1hLlfOcS9Dpj1buUQdzpArLfbXwjHHGBlhqejJXQCqR92gAyqdyh2OEDf7nUAZdRr8MPTUvXsdAT3wEEt0VWn1s8xDkiZOswknn0AxaIeJYKLPX3LGUmzk+2uBCJKc6GihMBdTDNGGOGPU6k4FPlyLjs4wg5dzdDP77vNulSBJflxIvcuv6R7+fL8solamViZTGMQdVg6qnXesM0ygI1TKjv2mwYPQGo5xJ6fyCZI6Y5qshKkYj/UgP/UQO9W5BTdRGXU69fkxdFzn8II5wX3lZkbfswPRwTK5jY+r/yqDF4JsHnl8xrwX1uysTL1ePXL4/Ul9XjdqQH/I1aR+KL8ur6e9flll2xYV0ZFYpinLCep2cvb3IvY3IvYJt7AF7E1gm+awDfN7uVtx+Dytik/V+jnOmohOUftrLIPh19KQ4jIQThDwFC9CuZI8g0V63RktBAZLAL3euzgcnNx4IVrh5hzmAOF8JAGPOQUh/ka12EW4JW4cscu3KMBT01bh9mbU4/Xt2nAq8vHa8AOp99N8Gu9bN0xjn4PFUK/0YA32qECgDEfmKi2FWSjSWFlPxO5eE6r7EcgFiqtUT4eZynFY8g6PIZM45GbtmS2oiG8v2Ea4mHlEPcrh7hNOcQR5RA3KYe4RznEUeUQh1RD3Kh8iEeUQzxq/0nvc4AMqufvrcoh7nTArLdPR3YcdoBy3O8AdlSPx132Z0f1Mrh3WnpRY+a8afFhBC3KrQi3Ad8vZn8fqZDPrWiTya2osMPyWrqg/mt//y/wvS8JRCeulz1NzIlOhAuhrAb8prIvbg0KXty6DN0kNXFgaJnIrqsUI4RkGSGofAjhsnkRCtMzCx2GyPU4K0jvvb3sHZYZyEn5iDMC2neUESAMMAOE3n/TgH/UDuUx+Ti4p4wNIB+bt0Y04IZA8XePLyFhfXfPimXdA/mFvctes6dn9q4dzA/ml53fN5BfN/7jmevzvQPrhobuA9TEe4Dfr4I3f0xv8pjQYu9RrRavMgA8eFF+YLC/V+bePMkQa0A+Lhm0/t68IJrBW0bppqAfKt3kx874g+d5yyndhE1yMX57BaTREIir8LtLxF1aDSJduilMPor7uxrE5abKP0YRiJxiR+WWgo2DRdWocvC6kodMmcMq0Me0Uj1vEa9AHyB7L9tOxabWu4mVrBjT/nxDsz8fp8mYkyNjpRFzlSAZq8siY04j4x5xMsbJ3g3viIJuNQjH1SI1cuqM74jCUfXGd5nSY4PxXbb0OJNZ1NOr3Tjh/SJo0vr4haG8/8IG/7TFZTlh8UohlzFk0WGPc/LXjk010QCnzhhzrAVtMt9UVjxdcV5rGbevaFMjJil8jMZbst2UQ07wTMklt26z2YRTd8w3m8tw6sJmnDqfNU4dNsnFqhymEOzUmXSYQrBTJ1IdMoZAXK6qLnsIdup0Nb0l5CpheTJMwnq5SlglV4kKSK4qhk1oc6/iOreIXOnq3FJUT07FNVNxee8wacbJD5G9l+3kJ2Wd/JCgkx9iOvlJzMkPFXxVmrn8I03GKpuSscqMk58ke4ed9RbEWW9FnPU2xFmnbgvLlR7b6ZWR9tjBoFmy4AsVaebzg6q4j17HGJ18X4INPmpx9VdYvDLI4qsSHfY4J6ePTdHaEMvJT2BO/vhYc8XJhFLKnHzFB9HKdvJDqWOw5ZQQVJZJYL8HUZbJiRkVebCOlnbYB5KMlZwh7wPlYB8oq8gHytHuQbbkA8E6LEdv9Guxn2c/CvVWSfdWiaQOlCAeUg5xn3KI25RDHFEOcb8DZr1VNcSNyoc4bH/CqJ/0buUQ9yqHODYdCXOb/Yc44gDe2e0AG7PLAfpbvY3Z6QDu2WN/IdzlADRutz8aneA5jk5HNA7bH42OUI7D9tc8G+2vvy1Qjg5Yvd1if0pvn46UVo/GIw4QwQMOWCRscf08my79wYO7OTzMvJgRZs4VfJ+hQ8iVclHcM40B2apil4zwdLUsbOnwdDWS41cFh66rdUXF4IGNnf+Ja1/85X+ChSirabpWl+gKNKpB490UEmvlkHi6ft+SyF+q0b/x0VicfOMnOy/uh75Cj6xGdmQyWCR6oeRDw/GZ5gjDAEiIkCmQxf09gvsIEZNIa5HcVblcXmay1qe1ZK1Ka8leBqW1XDYsXsZyciQrhZJaqA19mHaSKUkppSlJKetSklKIepLk16QEy2TJecN5Dglt7/RrtGTnikNfJLH9mOPq8Erg7FVOp9MpE1xZ8D1jJkvqbDxLylhlKgexJHbVdQ4oWZWAaE2nwRTlik50gd5kSm+KRPwPkEMAnGv93sTAeLYQ/KUG+jsQ6KqxiwevIUXuJnL+kEF4tDgeliuWwEZVXfA9X7SsmZAER1SVHDxTo6rSDZA1rh9qFn8mjC1qXJmy8ZXRTZI1sp/wR5YAWISYNut4Q6Lg+6lGDjBRNmOmREACxVUVLtfiqwk+X2RE+aKSgaBMwfd/BPYlMlQycuZhobxJzFifoZKR89glkxvfKSFnVeS84aVPRlN5f0G850VqlzWA7FXjgl1T8P1JAu/a0rgHxBrK6JU620ONpqrge1VAAQJTzeBqpqrg9/DVTLUZNVOFLqEylJqp0ukgg8WvhliZ+pKYcDXgPlRBukDcfchRToIfVtI8J6GHqd6CX9VAw/bL6CT0kLOEpIKjdpFR1RT8Gb6TUIXI6mJzo+JKrL+KLyPVLNktF1+VukmyRlbHH1klX1HNZPru/pl86a0yI72VqKKvpqS3kny0E1/MEuALcy5adcHfycd+jRnsMzi1BnPRqslH8YHwXbRaURethoGg2oJ/AYF9oxquJQeN6nSin1pAp8MGQtJg1nAN5smmRK6mTFzX4Jw+jutT+ZxeY47Tx8XorfxJ15rhdAZX1mKcXkM+AjBDlnJ6iI390wV8NF7dJYDhztRwzzh91ijn2TcZPZmmImaoM0QtpUcTx5YatUGnTZ0+a6F3dbRH6mgSwTLU0aS60iN1NKm+9EgdTWooPXZAFI3r5UnzCbUP0szSAv5LisjJPgWCRmKei/ETq8aXjSQIoLtGurtGZHciRX421f1RMtAkJwPN9AE9SAZaySEY3rVBOkVAOpo0BnhaXDoayXEBeG3SVgQkD3J0XzNL92mNUGZuLviv468I0kw5uZHEBzQ07cTZCYwZ9bFHtJpmkRZ1p+NaKIbXlTiBUEAzfBph+HryMyhCzQhupeXmGZYPbqXh4FZGUXArzYpQariCT9emaTw2cyNLzXRnzQhhXIAuQFil9ZL+g0qV9hHNYPwBiVIVA0Z3CY6agEGMmx5AuhD8lAb8YxI4bhBQ8S2o592gIwo1spaCf5jvebfwiNUMtWxlEasFI1Zrwb9NiFjw0XstVu7fIR9UJBDODCvu1oDvogwZ0ToL9ZykqZxEJClLfob0l1bUX5r8jDKPDXIWqoVeE0GeYhs5ZcO7WaXHnPFde+mRSsrpKD2Gje86S4/URUNd5GrA8G526bHK+G5O6ZE68z0XcUjmwYIk4As3aNLyZ1MFLtqQQhWz5JIVib1/VrJi4J802fk0FYGqJMCwK+nWIX6bJGN65f22Bthvq1PktzXQoloH+m2N5NAoMW4kEatmDUmArAUrNFaUne34DnnS1MKkqVREmlo03RcOfdTSeGzQUoHvlWCEBoQyJYjDyiEeVg5xv3KI25RDHFEOcZNyiHuUQxxVDnFINcSNyof4EeUQdyqHOOYABt+rHOJBByiKUQeMcav9hfCIcoi3Kod41P5o3OMAqXaC+R+zP6nvdwCpR+2Pxn0OcMFHHSCDOx2Ax12uAp8mClw9YR5ygMSoJ8wO+xNmvwMUz/bp6IDfNnUOOB6cMxVsVXrTZ+3bge9Xsb9v8Mjf9Pl2mZs+PVj+cUoipxkreZAiP0P6yyrqLyvYX72i/uoF+0sr6i8t2N8bg37w7lAzXq25FkkUohP/aslHAGIdApG+8qOOfBTXPRpE+sqPBvJRfC9Hg7gcyzBshDPhYIj0lR9N5KN4foMGcZCC2Ew+QnkJCMT1FMQW8hHKV0Ag9lIQW8lH7hGnwHKo1zb+2XPW0ba2QmC1Bnwls4L6azZreX7gou7eZX2r2bcKa/CMt0cMGe4SfbxU2GF8Yn39yyYKzg8N7ZiqMvOAFb1W/MaqyRZrwRbV4JuaHaaL3Av8R5jyE9iWHKqbb+TJNgFL10ZzeZuYpWvD+ksr6i8t2F9KUX8pwf6yivrLkp9Jq4RJuD1shXAT/6BJ29h5gz0A1DzUqB1NIwIazaIbtWO4nkU+ig8EzCTXvug0M/oOulEnORHj6DvIRxOjX6V09G2So2/DCNMuIOTtLGILCXn7G74/Kmltsh0jXaZTLmMlK58u0wmny7QrSpfpRHEFp9t10njsIt0JoLsuursuhDRdpIegHGRcPcgq9SBnKQM5+e6D6sdYqx5knXqQDepBNqoH2aQeZLN6kC3qQbaqB1mpHmSHepBt6kEmJJyNdiCY+kRpEblmcN11RHlAaOU1i32x1zCwuHsPO6jaljHWBmTHRjMSc8yVHE+4mF0bsf6nrL2HjOFy7W0nfZcx7Ej45Gz5UnlHwgc7El5FjoSPRroXdCT85NAoPvZrGwl3QL356d78iGT4ufsxZgHCeQmmIQ4rhziqHOJ+5RB3OgCPu+zPjnuUQ9zrAObZpgwioe9VD3LM/twz4gDu2e0AFb7LxhzuJBW+1/76caMDmEc9GrfbH41bHcDfW12HwpaqTD0aRx1gEZQ7KPAFPDZSjg5gnp3T0QwOO0CVPezq7zf6gtBBq7f7HIBGB6gyJzi39ztAqg84gNQOcMA32X+I6vX3DgcoHgdYhDEHEMYJimfXdFQ8exzgThx0wBhH7U9q9VKtfvW2zwEQt02dEHqIeo2TH/cVH9YyMo49EwURy009WEZv5E92yUhrCMjClk5rCBiHEyBHBqY8BARvoH1xMHnKtwst4G1HAZqogRJRgUZBNE/iQJm3gl4D3kAbBG+gDYA30IawG2iDsiOTwSLRCyUcGo4XmSMMdV2sLhsFAMm92+hGdhHSffwsf8bZqEYuGzGu52ohR2XMm86Qj+IDaSBhAs1aRcvatjCLyAYf4pe1bQWwr1Up7WWDPkxgHxKMtMbammhIVhYvDr+ZLqqvyZR4qlorl/aMwxptJE4oiZklQHwGQ2m8vRgpSppByvu28sv7pnly1cuu0vwkX66a6RnVc3HLqMjejMlVmnyEWCxjHYs1c1mshTUjHhpaOeqFYrFWEg/iuBVisTRS97aZXwq8ll9Bmn3RUPBZpOMscgUkVfuYuMynsjjg4P/IDriy9DiTPeBv8KWCcUaaf3kR46h2nW5KJg5rMy5EqixxAzR60SvqWNd01RWC/8m3NXVmzvONg/5uEXTd3aAiyJapCBbCiiDDVQQMyme4lK9HKZ9Dj6CCpK9GE7QhHkRJnyMFkSkb5BXGfBE0qapq6ft5YUupGzNVp5lgZe7Nm1V8FZdgXrkV/C0y4BQy4DQyYK2qfygiO+AMruLGB/x7O97iCsCsRCTO5CXiGZ22ZFzVGPyb+XsgtQIKN7FB/11AxaXKVHEpWMVluSqOQfksl/I1KOUZV+3UCJA+RwPlX0+FX5+c1mlLhmyEwrSKQ0TQpIqjLlNIIU5RGnGKMgynyPcf0HBDSNxkMX3ahpD8SdDeO4xfRZHgVUyOaxPywasYHKCKKjqTE6NxFiXEgTzs9enSYa/l+QHirBfziFYsvgU4lBUfBk+HBcA33mFOrY3X5mBiknSJnhj5CECMIxBv4NxIaKiGlCBfole/RolGwNWvcYhDoIlEebc2xhl6JFoIUcfgw6W2hjeR4pvlmsbpAlsvBlsPEK2BySSZk1mMTyZZCM2nxZ4YmeFdghxbcUhvExwSPa0b2EM6nu/DJGgejHDtRxK1HxHcGRwf18l81yECTDmMxWsihdCbCdcB4lZ6ymHulCPolMM6CWaN660Mk/k2ORZcxWXBhbREEOOiZIIgU3FIS2RZMMFhwUV8FozQ9EiUyYI68WKO6118FkwAU45iLJgohN7NZ8EwovnBKSfQKeu0DXNcFzBYcIkcC+a5LHhp2VpwmWoteIVNteB7rdOCV9tUCy5lsOAyORZczmXBFWVrwQ2qtWCPTbXgGuu04DqbasEPMlhwgxwLDnBZ8OayteDdqrXgJptqwdut04J32FQL3sVgwbvlWHCQy4JbytaC+1RrwRGbasHt1mnBB2yqBfcyWHCf4OQnx7YeZ8HxTvYjWrCk6R6TxTmq6ca7fYjPZlEzmi4hqumi7HEdsU7TPcpns4gZTZcQ1XQR9pQ/yWCzx2BBuHjwGpLDekkOM6WL4xy8PaGxSkgp3uLl4C1eCH2OzypMtUHANTUyjuIYH9k/CTDxQfakEakdJ8WXNVIkwLgeI34ekQth++Xj5xE4fh5WFD/HeMyDKlFqz4h4G5LQflEkSZgAGVMGkpdaaRbgs4+AsV8G90Qt554ozD0RRdwTRblHfDcjUmp06PSe7qWrTu/bsPnxJX3r8iuW9fWeuCTfv3pwYPzLvt5hEvM+ctfDJ6GuCItr3OsII8slhfQMOYWeEVAbxMihUWJBvK2X4IQYImkxkjSqQE6+O0s1wEUuQCEJLLsiZ1SuIucy9nZvOChWkTMoMUehzfuwtnl/vfGrEKJuJO1/QF7dhGF1E1KkbsJ4FpP5zfuwH9q898Ob9z5rNu+xSQ7g5oeielIO8Y1GjtIOXcygk6xB3VpsYuSVGeS4ih60IUOc+GYGzd5E73BUqAXxQlsRm9RmfEfkFsxCAqHtGE3iElQOIzozLmDKGCDjgn4LFK1CINKXRyXJRwBiCoFIZ6akyEfxDPo4kYCBnU0QP/YRhwUwQz4CELMIRPryqCz5KJ5LFy9Fu4wQc+SjeGImEZJArlCrxJJyink7lPjAlqrK8jSzKthSJRRZqiokOOxBjklU0aJfTWpA8STPakSbVJOKUznIqHqQMfUgw+pBJtWDTKkHmVYPMqMeZFY9yJx6kJXqQcYlsn0TyhZFYcFFkdYgwHakQ3GxZZHMLCVzmuuNXwURYxOyfFkUgo1NUJGxYeAsqGRZFDKzLPJbsyzCJkl7tyEBoxlGIK4y5S9HEIi0dxsRsMJRBCLt3UYFjHAMgTiA54ZT0hOfiuVlTH55Gdd2ft4ivrwMkr2zriM1Cs25+V5YocbZChVuEDRIGES/4EF093AlY8sqWAhfXlSP4RUy6jFuuXqMW68e46h6hBf2cdpOJwTUSgK10xjIsHqQEfUgo+pBxhRYtinweXyQlRTzefyEDELCbdL7CWreT871fo6p9+NzvZ83qPfjmk3XbLpm04TZ9JdrNi0zlnELjz9fJi/Ujj7+fClkLC+1zlhKqGRJ6qWUUi9oHfUIuS7XDCUlLEEcsYw6DVV0eR9kaTJeHgiuGqVT/onRs5Lrw3vNSM3ZuNeAnH6P4affGbtoxk9iEK3pIqBaeADKGYGPsa/UiHgU5BAA51q/NzFTdCNLNNAfh3eMDanWNwkYwDSaOhzDRpUuhB/jp1ozOCJVsj2mRpXSDZA1rif4Cc0pVuZUufiK6CbJGtnnzJ8XSJGOHCvdOvxF/iEJjlkTXq/EyHGZWbEkzfBFTJQvkgwExQrhrxDYp3JYlJnEhUpNYtw6kxhHTGJKrtt3SshZCjGJaZZJ/CZtEtNck5hGiijBlXHB4laoYGcK4X+VwLtWKgmsDp1CGT2JK8BUISxQqjAFTDWGq5lx4N/lq5m0GTWTYlGMZAcs6clo8dMQK2O+QRpwH1KgLyLsPiRoJ+HHIMvwnIQepnqLzNVAg7UJA0YnoYecpUm1i44q/HNTTkKAawxwGQlwZeRFvowEWLLLdxKEpTfAHtlv+SODWQSV3nFyCNRATJqR3hiKq4CpYlpJS/kiyca+QA3EAL9kJgv7gUL473zsp8xgP4CaWbr0dIB8FB9IskzXPclzkCN+8nQprNMDuE5P8nW6jhFEdhaS5vzyZCEStchgJlGDmTKVdxy1dL0WZRM9I+CuHDRxtjVViFQSR1CRfZCgBD6wM4tB8rNyj7KZSwOh0rq0iw766DsGiIEb3hG3AoSM74g7ASLGd+2lRypq3EH6Q4Z3naQ9MLzrIsXW8G42ydSGd3NKjx755BhNbOvuRZJjxBWyUMw9oMXcwXB+lm/7Wco1W4icgJzqiCNLsQRSfjVZHHDkHNkBc8zl+IBP5mvOnBnNyThnkMPMZZZ8FD8NwTeXOVFzmWEgKFeIvJWvOXO8yi49bNDvECjYHLeuJr0We/RLUD7GpXwlSvkErdErBUifRsLvIOmzohVu0mzZOJuuw4GIIOpJU6tYYsrwWS9sPyON3vrCXQGn+CqOvaqLXIYMOIgMOIQMWKtrE+mTHXCE66BceUyiKRFTR8iSrKB5ec5hRKctWc7hB/gqDroIKITvX0SWCqi4oHU16eNcFZdGg7bihihN4oRScRkB0ieQw7Yml+IhnbZkyUYvQ8X1STC8kIpLIfnNceRobQI5WpskdgKhiwgYGw05y9OhcvBGQ1bRRgPDLGeVZE7kbHTIApvkYlXHSrNwmmEl+Sh+tCoLpxlWk48AxBoEIp1mWEM+AhBrEYgD+NVQEnJVJ8fai+Xlqs56uaqzSq7qzoLk6qwpv5ChTkqu6nQEeB3ia31esGak9KphMnREfqztHtJ2p6EQ9WjWZggaaLOUuDaTjwbGbUAYt8XynecWmHEbFDEu82pQeOe5VdHOM+MawlZy3nC8q0Uj/27aWWrj7jwz7uVs4zptswAXto0cPc2sswqRByTwnsVWAC06DBjC5W0QU1JfEkhuA2LvLRC1jUSpA/dTG8E3TYQYTpLxEMgjANbrsNhIayHyfQ30EViTwTutLeB4UIe5hTOqj/N3Whk8Ucd14/FR1ekGyBrXYwIXJ9LjaiobX026SbJGJpAo1gSyyCFiIUQBbypEPstf2TfhNl14Fa6bqZltnyYzfNEiyhdNDAS1FCJPmb9QswnHfl0h8rSpy7P52Gdwags5LtRHER9IU5lS2cSVyq8jO62tkO9MfUn008rPnmkScwLBG7t5RP+WqTts+URPs8SDtJZqqie1lBk0JhCUYQeNvwNnQGohxbXILlEzEl5tQMKrjUWDGQUXl+18Rcvi5PZC5AVkX7MB8fMakX3NJs3Cvyw7YI5uGh/w//LZtMMMm7bTjTow3dROPkKOqRnd1CGqm2YxENRRiAjkZnUA2G/EnKRx0L8RiPk2WLet1cqN+Xaw1i08yneilG+klzGdAqRnLGQauaRvR0nfSAoiUzb+xoj5vizB8HVgzLeOnDK1CCeQTS01iDFTiw2ClUvLDYnk8qzlS/ys9cnlWbnk8jpFS/w61CxnESJnNXvEOIXbwF3iN6AhDaBRI6CxGnTMS8lEYyEaBW11H7htvgjJQKa2OqE2KbBNGmyTIc0f1+q3HeTcVM0yoW2FaB2R10XxV5ccf82mc4qgPKu5pcda+YyiruKgO+4VL7eTIXuHnZl5iDMzH0nSWoAkaR2HJGkdX37pn1mypX9qjaV/oD2AlWAgqQ8Mvy4CQ0yLwBBTH52HB42gBYSmWfc1mrgcL+tzZkm6j53fR0oDQdC60UtPgEB3jZ032DPxnsUlHQwp7CrELtJG/CYI7GwKbIdOj1FgZxeiH9PAnspc50Xfr31wGtTv5FncU04muXcS0ReBu9yU86JvT1o3xt040XfI3TpFAicWUlVs4Au1SZ+hl70vlmRvWb4nP5A/q3vC1Pf0jE91RV/v0NAIKFE58E0l+KYafFMzwt76EfivNDWJSgNx2VQMad8pbn2lgTieYVxm4d2kREKH7uA3nA4V14h1Pu07Jbm+UxLJk/TI5lcldf4NI4ckei7oIZXPUAuVMlTMOoaKqWOod1rJUFc5gKGu1EZ7O9s4dZfNVzM277+kv3vNlmEmA7E2G6LLLO4U4rVJ93300lMZDs35zGIG0eUaBle8cQ3ZCteQOceQDThA7/S7hsw5hmyzAxjqFsKQQQtpaoFbSwo3tJReKb6U1tUvhpbMK+nYBgSvHWzTVWpTnPduBmKiheiWsiOWmC2tYwZOVq9Yt3QicnJRd++yvtWvmRKRm7leNzpDQ3qYj5fs6Hjnff3LJuzo0NCOqbKewA1hF8ITAlqsBVukwDfpHaZtt8B/Gh9MhDSYmY1iEaq1iGBlkMB1G7I7EUOEK04LF6Ef4NBhEgkdpmgRK1EBFbJsIbq3+EGsjf3BaNkaHpPChIw1lezXREXDhPXWNCFnTSVvRLtUyqjBZEiR74os9AhtTVNca8qsPMRN9OAf8mcfU4oeoXbXE6Rwy/gaJaIYZ12rw84U9wetZ1aC251arZvokyLhUObK4SZmMDT2Ng3057CEowb8jgCI3Lpb5Jjk/icihQNKI4iVmUZwGZxGkOamETBPgfHYn7GPmyGxQjFIlsQ6ABSrPGby6JjuFCrTuf0aPxIfN1cBazyAURAgfto64ie4xI+jYi6uMHV4ZuhgwgsRV/8xLvHjnKqUqC4epw+Z5YbUHWqW4Fjsnl7dGmaq+4O1clFB/hDslqd72RW9Yh0a6Bco3UvUVGnBdW/MXFWIWCH6UwHxS1gnfjEz4hcrU/ySqPiBaYRRM0Up4qJFKaJs8fuded0b5erePxxbw8s/s50wc2Y7icacoqxokvY4S0KtRLnET6DEj+KGd9wxm4GklROt23HlkDBnm8f79wnwR/xY2uakItucFLXNMspBoW1mK4dY0nxxwyjPMsQyb0jLkEQtA64cuszs1pSvHNj5MbGZfOJHD3Ic/jAzaBtrLoLufMAMv5d920dc0SVZ0UvFbvu4lIific9XqAZZtAja86oE9zRz+TjG4WMzJULj5rzIcUU079jqCr4jkTLjSKQ5hUAZlbT5SI6Z8SLLrGEde7OpIv5RkMGjJEYoq02gGN7fi/HXVAxdXcslWgK17lEs0pcAB2IutJUsxE4/th520oxgJMsUjDgqGAkzvn75oS32vm3svCkUDF2shdJgxEhLgV6qBie8rzJXjmmC8vsqc+F9lTmK9lXm0rieA3gVcnVZ5gaguiwB2KuoBd9ky6nLgk2Srssyl3wEIM5DINIFVOaRjwDE+QhEut7RfPIRrB2zgKodM7+08URL54JCbL3ml3WbGehyfKDGFfVx5Ev0oPYCohFwULuD/FqEK7qQidDVm7rIRxOoGZRDzQIWaibyFI0fElWCFwCYmc1SGxOwgGnMYaVFaqeK+sHZo83WQc0WjF7QrzthMYecuqkhng8O0djXAh2lKImYX4gNaPbqFDBbZ60mNTeC3/TRJ5UEcn2go11riB5B8T+JEv+5pWQWerInFWIfou2f9lhnfEfwL3VOncArdU6dkPom47vjS4+Ua0WQjap/REhcq4aae0BrvhaZy1xkLvOQubQjc+lA5tKFzGU2MRfxQ8RZrhOHn3DP6tiXcQw9tgUuxJBFMFJHkgLOEpqPZAktQM4wH4dkEB2PZBCdQJ9pI4hROtVm+Mq9cntKr9y2qBYmNskB/MrtcjOtzN2QEJI/uZswc3I3iKjiMKKKI6QcwYu1NmSxNgtZrLVT7g15a8UkA4AmMTRxnpPZVOrm77AcoT3y4h22XrzDqHjDVA3T0YYIzJ5mtMkU3FYNxK9DFWLxaxCpZd9W7XnJtTPH1M74pt7OLMbtjAn5pWMQYfIRgBhBIOZNXZQaRSAux640krkDFrHXMZMKPm65XMWtl6u4jILXbSIwLvHm86Nkdm5CgCHNg4yoBxlVDzLmDGPph9SrmLH0W2csfyVzTlXyLMLl8kIds/6cKucObPPGMnYZZCwvs85YGqgXUke9tFLqhayjXgg5xlLmyWrMEghehaRtGsd+y9JkWqDSlGqU3PzVmSjm5u+vpaRGe+Tc72pccCYgpqS+JDcZgeB8DKI26K6spFfj0JvIZmM+dexl2VwUrd+zmZkoia0a6FfhDV1DNfGzBUxgmpOqh4wqXYh7Td3brPCy0Bh7XEFT29+RsvEV0U2SNbIof2QR/vmymQzgkUI8wa8ZyzFswiuWGDkuM2uWpBm+iInyRZKZ+xmvhCPqcXVGcaFSoxi3zihi9TdTiiolpNCcmhh9aI02ivFmVuYNzyimzRxuywCyl8YFO1OIN5pJjOuxKDEu3iGgAPnp8zPZwGcfk+sIY/h1hMhF4CncfSAmnOaXp4+ZdB8SlJMQP1E2uT24GT10ldD2q+NvgheD8JUjKbNqFx1V/C2mnIRgmTlyQa6MvJ0vI0HOkYpypTfIHtlC8+cfgrj0jpNjEV96k2akN4biKmgqcztpKV8k2dh/twBf8DPKWdgPFuLn87GfMoP9ICen24j9IPloIofWpOue5DrIlyJnw9LkoFGdnuTrdB0jiOwtJM355clC/CqLDGYSNZgpU7f8RC1dr0XZRL9GwF05yDlOBDgreaIIuNRxImK9zzpMlNBOwMSvA9Gi5xgNHtkHCx2rimPOPiXBLyF4o0t31wxVOxxe+GQt34FHLh7IWHfxQAbcoMmRQ6NWHTkEj2l1eOxUise0dXhMm8bjZLtn74V6Y9yem0O2e0oQh5VDPKwc4n7lELcphziiHOIm5RD3KIc4qhzikGqIG5UP8S4HoHGvAxhcvRCOOQDiTgeI9Xb7C+EuB4iMA9D4kAP4W73532F/wux3gKfnAP4+ohzircohHjW3hBAfRgbIxXmUKJTc07eccRnAZLsr2dk52Q7g+8Xs73MVI4yiv6dSGT7kyw52jg6UAY0s5UPmtr4owoXIz6a6P6q2K7yKTpeXpyOwik7Dq+iUolU0s8YAvA0rGQQBw3oZlhDBZMjqWGIyzvVdVm1P3jZsFjk5B4s8/woz1uXFuUL8OX6xw/j3BeN1NIyb2PG6v2qgfwinmhb33bSfwtywapQVVtUakYAYAcr4T/j7bmFmgPImAZGPakeDT2DMqI89op+XLdMzkHLd6bJPEJk7KlZPH3rU0AAfeaTKaLSRWIeLrUeQYutx+vSz9kjVZiZuqoshRdqD9Olo7TGJHGQGYsHYAbqwdu0ydoBuUtQSq81spSyWT/yYbHk2O+3j7/ytnSyajSqur7OYmc6Qj1BFnlSZFXlScEUeTaf7Jdw4viGoZLmgBFkpg1RJ44H4HPM7iFGVDIV1h8RM7JUc80Ni8PnUEE2JMKKzsAx0SZ09Rx6PYesz0MOozEue+uTulURYuayw/x3hr6BNQzysHOJ+5RC3KYc4ohziJuUQ9yiHOKoc4pBqiBuVD/Ee5RAfUA5xp3KI+xwAcacDRGa7/RlcvXbc7QDmUW9lHrY/qXcph7h3OkrM/Q6wrHvtL9UbHSDUh+w/6SPKId6qHOJRc+sm8WEEy90gOp+94ROeLbdBFDGxQTRbcoOIFw8r//z/T8DQFv8UQop5c2NiPVKYKo4cCkvQ6avaY1LDxb2yA+Yk7o8P+Hp+oC+HBB5lrlPL6aZkCPRlyUfx4CE/cT8nmrjP3nlJbOLncOfAI+eTg+thg75NCwzfbdl9LQvLubIjxzogW15sM4HGNrMSwe8El/RZlPQJUhCZsvEx8swGVwTRMz1webwsUq4Oq62QRor1Z/hn8VJ8Fcc+X5Z4ABlwCBlwGBlwRMPv47IDjuAqbnzAe47Juc4Ifq4TgJlEXA+Tx1QiOm3J2OdNHOCrOGgLOYztI42DPiSg4kJlqrh0OTeNMCjPv2kkg1KeEezOCJCeUe2Ev5WOHwoM67QlSzYeY6i4xyUYXkjFpeh9EtgpCiNOUYThFMVeBu1a+aXZTFy7ELf+OmvOTVrmqzjFzVy7EIArf5VT8hCbJF1OMK4jwOsQ6QKuCaqmuSbri5i3diW+o0nFV8wMdDk+UOR4Zxw/CErY1SRwEDRCfl0uxgflJpJgTYR1AQGxPIJqHEVZAoRcQBBjVffXrDl4AUEcbQZeQJAwXgqgW/CZGiJ4AUHc2FcCd9bihcR/whcQaMZFu4Ag8Tz4TR9SHArKTFtDwKUHFy4k/rvsItgzkLwp8Fxs2Bz2o4ALFCKRMnZ+HyAHwQnKgV7feYM9OsqSZanBAU3Iq65VUmD2CaqvsA4LLC34cySqEUSXA0UO+BVopNci7SNEe/HImh/0SfzkpGF/JYb6K5NDqnjeTLKJ2WK94zQDJpkHw4egy649+pj1thJ/4i+YGMfpA2YCmrp7TdF6W6BRf20okDgCS45gmUsOP7zkCHGXHBEkGLwYLY8eNRMqXqWq9jJ/NRITXY1EmTVckgL17QQuyPWxgUf4XB03w9VlXe0pytURWjupX0gjXB3hcnUMiVysork6JsDVmCLNm1KkGFevsoqr6/hcHTbH1eFCcqap2oh8rg6zFgMIV+sqxJvQ1WGQqyPHUldjG3d5NDk0auGVIH6lyaHBKUkONbXJeej0nu6lq07v27D58SV96/IrlvX1nrgk3796cGD8y77eYRL1PlJd+SR0ipC/qLmyFTslQNdw5x9kIY0YgJkCV/gcJVVQiKuCThW4NDdQphDXwEIcNuNwhbmEibLsGWlqjbIfJSmDMZLhXUDnAk8y2R30ERtYe7RZXpq+DdYerYq0RxuN71YlQc02M6Xpyw1qUvfMKaNeSin1mqyjXhORMmPsdpai45+z6G5nkfOGz5S1FUUteTEtyu2lqDDQMePixHauSukAVGw7OXrWlYnJC81IzdmU8WjTzd8QZ22HWJL6kkBxOxC0bYNoDR5FXEkfRYTetJTeFIn4fpBDAJxr/bLOvs4qpLSgaBK8y7jTWHP2JnL+QKMudDHRho2qq5DM88++Mjiik2v88VF16gbIGtcK/hKnkx5XS9n4atFNkjWy1fyRtQAsQkyblVnQUkiu4S++OsyQo0WUHB3scQ3A9eBnIZaoxfJ68C2wJZqlyBK1sEwCbIkkre87JcSujZw3fEq5RdM0t9CWqJNriToRBgMtURef5QFJv1kC7x2l/DcIayijd+hUPjWatkLyQ3zpbgOm2oJL9zjwO/nS3Yk7rRIammQHGavdKWy1SV3Jt9otJq12O22bt8gq3kYsb7KlkDpXAz0C+2dwPXjQ1nSK2WbWqDoLye2mbHM71xjgo2rHJXZ8XLv4MtLOkt1y8dWhmyRrZPvMS287V3rH+NJrihwd5ZBj3JV/SIAcwKTb8Em3F5KHTTkkfJXFYxCjymonH8UH0lamMLThntE4y30CKcPeSQ4aVaVtfFUKr6YkOb2Dy+lPmOL0jjJx3cFVPJ/jc3qHOU4fF6MvWmScO1DjTHN6B/kIwGy1lNNb2dj/ioByZRaIb+Uy3DNE7XkjPojWTRL4aEXOVzWRn011f1DogbF8arU8kNcKL59aFC2fWlnLdGXLp6S55VMrsnxq1ZzB7zpg+fQc4kkX5wHWcWs1E8tqLaTeoYEG67h18iqmNYO4YFVM6yzlDTLR8D80J81Wl/k3m4Y+Rw76XCOZ5ha7oSqmzScFxfBuAYk/w7vjSo9U5ZzjS4/1bC2B1RubU1TPnXuQemOwRM1HyqYtQMqmHcc2RH/SuO8lkPn7wO2uRXQ9Oe3NJNwUaODm8C4qmc0Y8pxC8q/8i0pm03qjC07ym00+gtkRXRNpfrKN5ugbdQn2NL48JjlmcuQ305IzT05y5tPyAUnOceSopbl8XpFG804T5/I5ZO+UiBPyx2KLlJb7mQqDmxV9oMewiBY5ipNrEJJpvFxsdg45dkPiMTHRrgnNDIKd9xonaAMhIBpXNISi6wIWPQTzzZn8RJRv55OURUYLMftcuFGnPuloDtkTRMa1NBkJuSqRC8FAMw8DreBkWuBGbWCjTlq7EvMq6UqjbmoW8KCbaW3XLOZBN1P9ES9nQf014dvJxv5m6T6jRLexkOrQENCuPb1Vn1XwGaKGwvL8wEXdvcv6Vr9GgC1gMkCjIaNgaEhm57/Z8tKKzdbv/DejpIKliHH5bQtp/011pyPoE6U0kTWD664j8kQgcrZsYWZzwGkijeyUk+YKY5IIVOXC5RYV3NI2TbhFN+DHSwMen05f/7KzupcODA3tALuvB994gOov7wZ+XwT8fi4ydXaLtWCLdvBNxw52Bpaa/4gjhiewc7v0zQhrwubBRpMZp41aMmC1uawrmWgk2SscYWsF8ztbrCvB3MbN7+xE4qtwDAcN9DbS+qZLwDoxcNsI0rqRRixbuXEDQ7PBwBCJEMovml1IXYR0PAuJEbQjMYKSr7VKdsCczY7xAV/Kj/vPMRP3Z6zn5+imhK3oxVmMv+syR3TXpYu9SH0vP+4/B9xURXa4x0FfLVDMY5Z19YpauIpgDhq8BhrNRSnfTiuCuQKk7zSztTxbdGu5ky0bK+liHogImlRVs+mMMgLZcMJtJ3KJQxc/V6TTnIrrLKQ+iAy4CRlwMzJgLWcrNSQ7YE7e0fiAb+CruC4zKq6TFbIkp2RQcZ3ko/h2aUuZ2aYtOm3J2D1IbearOGiHphlPsE3dLqDimqzzdWZxVVwXmt4oE6wmcEKpuNkCpG9HYkImd7WbddqSJRv3MlTckATDC6m4TnpZDjtFzYhT1MJwipLvt/D2DRP1io757RtlHO0JmalXBC12V5ZTrciKmg8yR/p1x29NHLXMmy2+QFVUipSCBKzLslKf1eT2gJmBLscHitQXiuA5XWSZIWB7w0d+LcIVfmQiA9RE/OSjCdQMyqEmykINq0YTWYsGwEyApTSQGk1BVgke7VA6WKMpgjYDazRFjXWTguTUTQ0RrBIUMfalOxbKKreSehKu0eQtxcmKUvNP4DfU1qMPzNL2g5uS2gzXED2y9kmMKvrcfC8cKk2xQ6VwA49Bn4M2czFSIzBEl6YitCRc0siLlCTyIRVO/UiF04CGzmcg1vGaqzrtLaS+rQH/unEIHhIzFOcQmKF4h8AMHKSM0/xDYIYiWgkzBy/KDwz294IVGcovkmDCFzrmN2iV4QuFlfhCJVqV4w2F0QpHZnyXNAJxFXa5bxqCmEEre6D3EILeUJbyhjKYN5QtpP6oSe6PzAx0OT5Qo5nOkS9RbyhLNOJ7Q1mz3lCoPG8IQ82gHGqyLNSwvCHCd8/yvaGQiDcUMucNZcx5Q1mjhxIip25qiKA3lDH2ldVRinHzaOr3Ut7Q36bcG/ob2wT/nbZX1eoyWquZlaXSDCPpVdepV9ZR0blJLCylGTdmwu5JBnFPsmCiVg5xTioR56SKdNsmiZ1OI+MNI+NNmxqvDxmvHxlvgBgvRDKTpbu9Jt3rDOJeYzce5BD3uhJxr6sI99row2mcXZKMU06GJWPJ6qaFz8/9h4tpySi6aUXftcyOvhn85e+//tXlQ/yOJi3Z5M+BUkya6eEGD9LXqhMF3zTBLH5eSJ+gj3X7SyMRdaG1SDizQdjYwFtqoOs5UvpA93u0NLQiq883YCVUglEMZxsbh9ijixhHF4EC6kWAxgZRToMYMw9d6yZM0WRct8+G2MsvuxIpYuxEgMpeRfx80cbaT5667c+PWS443rbnQtm/vvIrfkdlJ3j66ATPsoMhftXBEG/JsynS+u2QIQgAtturc4co2x0opE/XgL8TCTL4gIV9BFnYRy1f2EfhhX1E0cKeWS9OxcI+qnZh7y1nYY9Nkl7YR8lHACJeNhatnQtAjCMQp+ziiPS1mrRcaGagx/LiiCD5tcnNrwi8sBfZ/MJQY9VVFOR9GQBmwiy1gSzsmfsVYe7CPo42E7+KIkJO3dQQTV1FEWFeRZFeBi/sA9TCPr0K/KYP3AtYCUaTqYV9mFrYj/cIin+EEn/N47uWuaeT7tXAPkBxEcGuAbZBTyDGMmm5sUzCxjKhyFgyrjlLlIylARspcmhUqkpKwMgwLq5KlbrDQMbUg4wrA6kxt/0BMj3K2zUhuRUJMyS0r7aj+858axZmS1vErntOEev2nCKgtOlubKRImhCQtgQq3BjImHqQcfUgA+pBhtSDDBJiA60FxZcs8qejgrKno3zs5U8gIHY6KkBYXPH5Ct0YHSCX1eWu/qMWrv6hHY8+Ezsei0A3qw90s1aCbtYiUOmWHDDwEvoYP2YRNR6AJ/cikJu36NuwdPe3MZd2n9JG/AgWCEEyKgJI1kRIZotEF7WBszSCSIQ/DARsUohVTFtuFdOwVUwpsopp1JkpI2CTtlHABpvkYlV5Eyk4YJMhH6ENaQRiHr8oHlyx5agVWxZzRnOF9Hc1qX7azECX4wM1eqWV5Es0YEPsD1YCLq5u/0yEKxLIROiATYJ8NIGaQTnU5FioYQVsiDUVlKOSZKkNJGCTYkVDktyATRZtBgZscsYgSoqcuqkhni+c9ZHTUYqRm5R+Dg7YxOiAzQ/Ab/ro/V7IX0iA/kKS9hd+AIt/LSX+aSxgU1tI/wyJOvjo3XzY7OYQM1+JmOQqxAWoJj0qw7sa0j0oouY3oDVfi8wljcwlg8wlhswljswlgcwlScxFfOuAcOehwCV6AMmrY19WFPP3cGl9L4IRH0kK2FHLIo5hDnHiKhGnsYp2ygliwHGXGtAxLyYOgLv6fv1OcwjY1Q+XsgAmu8r4oVyHkHFXP1z6hDm6kHF0Ic4mPZWkEOY0iDB39bVugtSufqSQqVC0BV7/+fw3/+H5Xzxv+V77T0JLzvR86u4myzv6g//e5878zl3PmdvUd5fgKpbgmXpnLMGz12sjbmZ84Ctk2uhFq19dZqQfZADGYlnydHBCfrHsgxfLXkWLZR9iaz1l4zoukTLuR/yyIPmuyCEL6DBpkLvTEcSPrAL74PwDPKzcmlAhM48OJGnyXJwHuJrzAd1qMG5gykhWS1HIvMlcxNS4rAuQj+KI9cLhA5O3XXrh8IHJo7deeJ0fRpxzhVlPYQdmPcE5wFHWjdA8oWQ4/DFkM8QF6AIEeNRbUo1o0hoSaYviYTvShwGCU+SJc6GwXYxXzpp9AXnmfZslDoUKHJNZrhmOD0qcU/fCEcYIMh4PokJjlqvQGKxCPYpUKIPfPaAKjZNDo2QhTuJRPLUujohXnCteLsA3FEBIHSwG1cEAXx0kmJprMa65EoXMzUh8CnMvfIjcaEdIMtsEh0tP+Qb2cDfxK3cl0YWU+H5NUjchEzs2cdbSihc9TaLRU11dABpByULmDn7lLj+Ae40Rexmg/YXMRwUqd3nKrNwVhit3RUqxT/G1bIRL+SRnAUxJclKA9AyL4+OS3oOSXlcugqaPp5DZSlfuEhZAbX3I0xe75DwdYsxjSImL4nA/Jasv4hx9sfeY6Iu4KX3hRyyKSX2hU8pMfXGQry/iAO5jmL6IFzIPC+iLiHX6wsPVF3HULxRnF9xlFNEXPmRFBpI+gpJeZ6tZGfSZxxn64lNy+iLP1Refs9S/+HfV/sUXXf8C9y++Yp1/8YzrX9jav/g3hr74dzl9sZyrL/7LUv/iJdX+xfdd/wL3L35inX/xU9e/sLV/8TuGvnhJTl8McPXFX6z0L7IZ1f7Fy65/gfoXWa9l/kU24PoXdvYvsmlaXwgL4OTYBnn6IltjpX+RPUGxf5Gtd/0L1L/ItlrmX2TbXf/Czv5F9niGvjhBTl+s5+qLN1vqXyxR7F9kT3uj+xfecvwLbyG7kK8vvGb8i3HQi+zuX3jN+Bd+Frtg/oXfrv7FBQx9AQqgZ+LWZlJV9JKqwhRzRjn8c4kmuyEJCnq4ePOho/Lo1AAri/EKvsh4UKPiNTeyuG6SrJEJ3MTmPcieNKJGx0mh3cOWSSD+InbIGDtIjB0Wxs61hBAfFDpk7EOSeyRziE3cd+uHk3t8ipJ7/IgqKeuQsb8COmRcAR8yDsAnHMo5ZOxH9SVa2BuyRN4yLVECtkQ+riUK4kQTTkMO6iyr0RKFSDyIY9YDJuR4aMSyjWIpo9w98++e+ScfAYhv0DP/2d2ap3WnmYG6Z/7dM/9vrDP/2QdkzvxnR6f6zP94j2bO/C9lnvnPHqXtH2ElHXbmP/v4G+fM//hcxJfmlp/5zz45/c78Z+rLPc8d/8qTF/zoz2s6BM5zs6mGnT28EXTdRUkdYJA6WMg+w1+zB5mx2ptI0NCMNDWuu4tQU5msIpnZZ4sjmn8LmIHPcNcDch5zUt5dD8Duul+Rux5AYrCMU8dB2TWi+PoviGj4EPmuqMGeYy34NEMnvoYMcReeYSAgHNLxGMVa4UL2P5CzX8V5fA+kDS8OfSObn3+ogf4BtoCVVw4+Us5NqQcfVz38RFo9kBCLmoIJ+qf8vZGQmR21IIunSIbFjlxD4Rl/meGZJByeCXDDMww0BPhSgqKBsVEQJvFgIlC0GHEHgog7ECBEr0wTvPXp+e/69YUvNvJNMOSSl19//Cl5w3LM648fKDP89CVwHcdaMRPzLjfo5kUcfc25zmEXl2VpQchwzRYjPJQhsGkDgIxQhW4NBC3WAV2eJenHiizlPFhYwsuuIqQw+upzYPQVZso0i+QEYlVxEaGOlYMMgsGN8ql9jVJqJ62jdtI0tSfbPXuvapXx7LByiIeVQ9yvHOI25RBHlEPcpBziHuUQR5VDHFINcaPyId7hAAZ3gsjsVg5xnwPwuNMBYr3d/kKoftJ7HTDGEfuLtXpSb3WADI45gNTqGfygA6yMehflYfuLjAN0mfpJH1EO8VblEI/aH437HMCNTnBv9zhg1uoNofp4wi7XGZ0uIjPmWlZbTtoJvqgT1O2oA9TtiP3x6ATX8bbp6Dre7wA9MWp/NI45QJU5gDAWKMft9neinMCOuxzAjtPSat0+dVYL3x8XHwZ0gO3R1w+wrV6xbunVPX3Lh4ZGjMfNJttdCRxp6wa+z7O/z3hHqGNqEwdWjMfiyJfd7INt7JN0XipXkcipiUikeiURwkXIz8CzJknqrAlxzRaU/HUQPXafpzKGiJN5UXbGkNaYkUOSsfz4dAbOIYkqyiFhsHu0RDw42S1DEzZL0grB1jhXcsd7Kd01TIicHC5OlidEDiZEVhEhcqwEOogQleTQKEJUaqoRTOappHurRGS2ku/wmIZ4WDnE/cohblMOcUQ5xE3KIe5RDnFUOcQh1RA3KgNIqD77U+YBB4xxr3KID9l/1hunJWEcoMI3OmDSDyuHuG86Emancohb7T/pI8oh3qoc4lHlEDfbnzD3OMD473SA4tnngFmrt9XbXQdluqwxN9OVR+AgSqVcHGOlfBClEg6i5BQFURioyoFBlCpyaBQaq/hBlCq6tyqEMFX8IIppiIeVQ9yvHOI25RBHlEPcpBziHuUQR5VDHFINcaPyId7lACFUz44POEAIt9qfedTL4N7pqG/VE2aXA/hbPfNsdwDz7LA/8+xWDnGncohjDpj1sAPYcWQ6Mvj9DjBbo671d62/bSb9sHKI+6YjYdTbQQcsEo4oh3ircohHlUP8sP0Jo96lPzQd1YQFPpQTYoTTUvPcZn/N4wR3eacD+HuX/SVG/Sr4Fvtzo/ogjwNWHU7Qjbc7wCvbbH/C3OOAzY6dDvDz9jlg1g4IgbthI7s6KJsZuSavH7aSr7atQWUksFRbXsC5Gk5gqVKUwFKNYhm+2KeapgDxNgx1V0N3V4MQlQBZqR5kWiKrR7u3mL5ur1JgkNUIRPq6vWryUXzaGkT6ur0aHXIY99pXXVgsJl91JnaBBHiTBfOGFZgMUfIzpL+sov6y5GfiIIkTcUAjxtUVxHlGc8d3z2cfxw2eBHy/mP19qEL++O5JMsd3K0xcFrdI47NHGYyYKlRdrX1wMcYYVYoYo0qQEXOK+suZY8ScGUassooRV8idIw+ZOEe+Qu4cuYHdakFGrKMZ8Qht2+tFHIbAbw/X000bOE2DxQfjyGYivkajnLn3y/sajbCvMVORr9FIc+hM0NdoIodGSRHxth7qronurgkRzCYBwTQPslI9yAb6JkGYgSotZyAk2zpoXbb1TK5erEf186HTe7qXrjq9b8Pmx5f0rcuvWNbXe+KSfP/qwYHxL/t6h0k/z0f8U++TGGRQ0HkEi1O8Ngdmo2rwQq9gmRd6+eELvbSMf7+Ev1tZQgLF1dUC4lyN4JXjQovitZr0kiG8VlqH12ouXhlef3UJCdhip94Mv+ZN8msQ5NcAiNfqY8mvNQi/5lG8BmW0cLXlWrjaei2MybZHAsHmtHA1qYVrplQLV4NcHToWWjjE5WoGEkKIFmaYlWntW/Avaq22xLeoBrm6Toqr68hHaIG0llgGUat54nNqPU/Axlb0sUL1du2Df6Tvh4XZyit7U6I0W3lhtvIoYisvTTEPuObR3XdLiSfxFoyv+ujufMhqggCZpu9Bh0kjqcRWyZPGB5PGq4g0DFx5QdL4yaFReNSusIbPbvrp3vwIZUoQh5VDPKwc4n7lELcphziiHOIm5RD3KIc4qhzikGqIG5UB1B4zDqCMerm+TznEXfaX640OUGZ77T/pEftPGj6JZhriPuUQD0xH27rRAep2r0sYFUPc4QA7OGb/WasnzP0OkJhRV/G4isc2aLzf/pPeqRziVvtP+ohyiLcqh3jU/mh8yAHcuH86Wup9DnCh1C8HH3BAiNABytEBERkLfKjtruaxp2W9zf6W9Rb702XMAdp2pwPs4D4HzNoBynF6rqr3OMCJcsA6fasDZHDMAaRWz+AHHeA6qt+ufthc+of4MIh0HqWHbHwrge9Xsb/3e+QP2ayUOWTjoXMCtccEmJy4spj8Vf0ldnbYA3R6UY1chs+Mzfsv6e9es0XLv6wgQVHQYyJne5655oQRxsA4Tb3aiKB0O0YyVZ3l6ZN1cDJVraJkKkZmYm1JMAzYqCeHRsku8TYGdcc41FGPqIN6UjMoBxlXD7KGzj+DGShmOQPFYAbyK2KgGMpA4lxHWAWJ/NsYmX9b55MYpNYfnX8bIx8pqvlF1NC1+55YRjetFWka/9D6mxnKRqSpN/C3HxgZMF1S6PDdoAnwREvJDHwWQm7i0LnjVu6S67p79RjWeu5hGJBEofqrGugvIBaqkrZQxChLNspIRA8JDRi5B/UKKDkPkp9RCdHEZ1RGbmnwBy/KDwz291I3DM8k8Ma+YbgR0SRNlmuSJliTNCrSJIwTlY2gKWomh0ZRqlnAbjTT3TUjxCdA+tSDnKkeZI3MOeVjykAzp4SBxBE805QpaiJNUTPII9hhatoUNZKPLj2Rc+fCCqFWvag1qgcZmwKF0IQwULPlDNQMM1CTIgbCZRto1EI3ajKlEJpJhdACKoSZSH+0QphJPhpfNpH+iLhQYXULPORn1HJQmQJaqFQB1VungMh1YJky804pEYfJ0EK+m3SIaypoUrYUh75IgvVbuPLSCrj/LToFRS0AWgvVrxpnkgDXKg3UeqQmAFINGFCC9MjpATUV6lZrwMOUbCVIHoBWQjT+EmJxg4Tg4krTCyRmGIur2ju1qSRBPB08c+1gd886/YAbSn2wcFSTo4mmPVYiASNtrVZ7K4VbgrsjiuxeBOe+ZKGmXcNQLTagqKIBRcnPkP6yivrLkp+Jg8yasY9WFU5rliyc1jLlhdM0aekDnSutXlXNe5iF02pO0j7opBijtfQIFk5rpQnSijBGFfkZ0l9OUX858jNxkPzCaW10I6sKp7VKFk5rm/LCac0gI7bQjHi5Hjvf7XodPYMDPVcvzw8sGbymZ8XSd+evX7ewd9mS7v6BFd09k9PeYUSD1sss8E07+KYDfNMJvukC38wG38wB38wF38zbwaDRCXoiWP/fFnB8AQNDUAHFDoI2k5+ABVI6x84b7GE2bWeorFmFmrdqrHSqkd1aQUZsoxnxEgMjtugYcZwFL+vuWbHstZXVRfm1g/l1A8NmOHAYw/GwOBcWx4/CM057FrJK6rB8ld0Br5JmKVolddB6eBYYpukkh0bZCuJtHdRdJ91dJ2J+CJAz1YNsVw+SCtO025WB2qeEgcQR3G4qTNNBhmk6fRLeRjscpmkjHyENuZbQg3A0sxVZ77cRJp3yTAlgcI3OFtQ7bSjUvlf74L2g81t+4VMTRdaRwqcN1hU+bQA1m3Dh05mKQnMEyLB6kAELy9yuV0ptW5a5Laax3auMMkWIw8ohHlYOcb9yiNuUQxxRDnGTcoh7lEMcVQ5xSDXEjeqVWcYBlFEv1/cph7jL/nK9cbP9ldle+096xP6ThusKmYa4TznEAw5gRwfI4B4HEGaXAyDuVA7xfgeMUb3zOGp/kdlrf1JvdIBU73EAfz/oADxOSyOz17X+KoZ4RDnEW5VDPGp/ND7kAFWmnr93uIrHVTy2mfTDDlizOoAw6hXP1uloBm+bjmZw2AH62wHcuNcB/ske++tGJ4QS1Cue2+2veG6xP13GlEN8wAGWep8DIO50gCrbbn8Gv0s5xI8ph/jR6egt73GALnOAqbZggbnTAY4eyD14Cpb4MIgsPaXnQBoH5c6BNJk4BzJY5jkQ7bESSRwtnca7hZ32eTWd5CeZZzcDqe4FpkA2AGc3tXo0PezhXlO8brXubhD0xCEHAGreslujn4LvgdU4GyxR0mpGHBiJyq2kZFBySeQqN0oIJnFQFELeTOuQ12AGeQ1lIq8RRR5YToxxwr+Rj7wG65DXzEUeg97NXOS1suZJMoMRea2kcQCAMo6bVpeQB8n6o0U1wjriXE2qRKY62ajhbiahKOGDz83IwecW8uDz5NNtsJKiZps2sgrxhmAWqeJexDhL5b2su+L3WsN0i4C1ydIWwmlX/BZdG9D8SN/wy3VjTUMcccAYdyqHeNABs96qGuJG5UM84gBSb3UAqfcoh7jfAZRRr3qGlUPcpRziFgdwz14H8OM2B1BmhwM4fMwBs97mgFkftb+5do2ra1zf0MZ1o2tb7SmEG13T6ppW+zDP/Q6Q6lH7o3HY/kPcb3+6WKB49jhAlQ07wOVxgqO31/7co16sN01HzTM919UO8EWd4OepVxMHHBBsdcAeihNi1g5YqN83HRXPAfvbfgs8ngcdgEeQebyThfZfKyD8+sd9xYe1jAQU78RNBFTOhWT6z3UyNxEGZGFL53NQ5QQD5MjAXA9yYKecDA8s8fScB/YtfOhnEAkCNFEDJaICjYJoggiFxJAcEuGcw6D+jY/G4uQbP9l5MWPpFXpkQdmRyWCR6IUSDg3HZ5ojDAOg9thgDmQxKZXgPkLEoCQ08EqRSbistNSWQt2aIlUyUYmkOQ+XM1vQNMUEVY62hXwEy4C3TuopZruZzDtc6jYghTHrkeTkhmLiWd0dIGYApDdgSB8f0o1ELjAkYvVlJlcuhJMrm0rSKU7yJi7Jy0nrbYGANqNpvRDzocmVurrDTKH4MJ1cCTMBg9MTpRHCGZktSEZmE1oruXS/kNEqaVZNzCY99qZ5p8Wv6NhE58EXaV28DJRS2Ck5bkyDl75SF1pnSW1neJcjlSKcTxozvqsiVRfTM5hh9AxmkHOdZIfOPXpxJb6hphEnZwRzAXVZUZKcEZXiCTtIkrcle+QdJMQJ8ilKePWjnq0BGylyaJRySelsKyXl8UL9aZps78fu5gVNruTdvD7yM+symc9yfiaznxwahUdtlQBXrmawkR+hjJ8f9jAN8bByiPuVQ9ymHOKIcoiblEPcoxziqHKIQ6ohblQ+xDuVQ9yrHOIB5RB3KYe41f6k3uMAUu+3Pxq3TksFrl45Pqwc4r7pyI67HcCOYw6AqN533G5/ymx0gObZ6QA9scMBQjhqf+1owawPTUebcL8DmGev/S3hRgdIzCH7T/qIcoi3Kod4VDXEW+xPl50O8HicsGYddQBl9kwdrb1m9pvxnQOlJba8ZwLfL2Z/76+QL7F1pkyJrYriRkbHmeydjrfTuwppdaWy0tTuCbH3lYAIFqcJFkf4JkF+BoE8yNruTRahrmQj55wi9urPAAHr9/k1eGQfLNBnFTcOs09BoFPo7rERsSnyEcqe0i7trT8P/KaP3kybfLOIaE1Pyl+ov1j74AJ6zxMCr233vt/4JlN6U4S7Ak4AqdQowRj6dYwBVxbq36MBvkwcH1lwwDl6wHnqbvsqcnjkZjz1ZSXRaPJ6duMnOfJrHTAQT1VjFw9ew+SbSsZe/uv9Pt086z8/G/zT4Xt9n/zOb/o++Ic5931t8T1fPPK24cL8d2y6+IVt/3ceQpeJ0nXA9BHcVOK4SfFxkwURzRePPLJn70dKWWVpHiZoVeJio/RWCajFKlofVImpxSqasFVySj7M1mKbtSn1gbLA2LeOy3Uek9+3jsP71jlF+9YMK5UjyGHsNiHXLZhyl2BZBWLecM5IXCPWDTS3JEtKHug4SXec5PpeaSANLqmzaRRrpQv1G0wYqPeLq+rKkqkuYuXLtnFWEMO/ChskCLEagZinIFaTjwDEGgTicgpiDfkIQKxFIA5QEGvJRwBiHQJxkIJYRz4CEOsRiOspiPXkIwCxAYHYS0FsIB8BiDNRBVFFwZxJPgIwG5FRrqYgNpKPAMQmBOIGCmIT+SieDqpBvJ6C2Ew+SpiuhOWmK2G96UqgpgsuvJyg9VmLgPZhpMG2ICqyRUD9mAdZox5krXqQdepB1qsH2aAe5Ez1IBvVg2xSD7IZAlk5sV4D/C4wzT3OSnPXGpGAWG79Z7STHyG5uMcG0sGClA9xoIzQHZpzR48oUaj/Iq2Jk+rCVElkRQhnFqeR9PQM4VWyQiUNl2kfPP0GyjBe5GYYuxnGchDdDGM3w9jNMJaC6GYYuxnGtqG0IxT43umIRzcf2M0HfkOz4z4HWFb1pHZCAo+bvetm77rZu8dWYtzsXTd7183ePaZ6x83edVb27hnWZ++eoS57d3wX4cqyc6tmINsi4IauX8umPeXk0q9wGk68BFx0f0CjMLg7ELduMzzO5coEkNekpRXReZ9EylN2MmNRLGlqEuJKshegZQbZ2KdThjPkIwAxyxzLYoGxVCNjWWUu54g5llUCY6lFxpLHc4tYcte2pCiYDatMysjVVK9BAcFjFHUMIjo5rvuMMZHmn2kTWWtyIh9gAm48qAEeALcwCXIyQXdTMkRsY05mJltYKNREHawArK78itRVADXLBmwEyaFR7BEkEYuUbB03W9zxHsdgA09h5naNDTYxa8XOHNE+uBXbB/cr2gf3k59Ztw9+u/P3wQPk0Cg8ajVJ4X1w6eKo3JCZaYiHlUPcrxziNuUQR5RD3KQc4h7lEEeVQxxSDXGj8iHePS3ZUf0YdyqHeNABs95qfwZXzzwHlEMcc4CV2asc4m77M89uB8jgmAMgqnfMttufMurZ8SEHmC31mmeH/QmjftIPK4e4bzpKzM7p6PIcUQ7xVuUQj9ofjfc5wHPcb3807rG/K7rR/jbLAhdqj/11I5xWZyMHfHQ6msEx+096xP6KxwIZvN8BzLPdAZZ11AGaR7m+vWU6qrLt09HlsYC/dzoAj+ppvdn+InOPA1SZA2IJ6n36/Q6AuM/+ruOzH1YGUXv02Rmkdest9XZmxAH8o1yHu5kotuWezQ7wUrY5gNYPOUD3qPdxH3CCWXBAiMsCiE5gnzEnsM/tEERTp3B8dCMi61jtKZxnb5M7huMzcQxnvA9l53C8hZn30xnDHnXncDxE91OdI43MSyQt/DwslVoEwNl0XrKGIAp0UA7nRieiCFhDF02KIJylHVCUpR1EJd6AjRA5NIqSIU0bgFnaIbq3EMIbIb5vbBriYeUQ9yuHuE05xBHlEDcph7hHOcRR5RCHVEPcqAwgoTvtz49jDoCoXvdstz9lNjpAPT6sHOK+6USYQyUfSfWsP2J/djyiHOKtyiEetT8ad9pfgTth0numo/7eMR3N4Kj9J22BD7XNAXg86IBZb52ODD5sf3U7PV36+5RDPGB/s+X6UDYVwb3TkXec4E6MOIDU2x3A4Or1xOHp6PLcMh0tghP4e68DtKMDlv4W0Hqz/UXmHgeoMge49Dvs70RZAFF93F99COXD6gP/PjuDtMz+W2BnRhzAP8p1uJuUYVvu2ewAL2WbA2j90LT0cR9wgllwwo7C6LRknzEnsM+HIIgeNCESaMTIcrYqYdnz7Ca5hGWvmYTlTWYTlg0Zo5Hi4Bj5s1G5FNYuA/KLgDXUaz0RPYD5sxFF+bNRmvKREuUN2IiRQ6OYM6YxJ5g/G6N7iyHsHuO7aqYhHlYOcb9yiNuUQxxRDnGTcoh7lEMcVQ5xSDXEjcqHeJcD0LjXAQyuXgjHHABxpwPEerv9hXCfA4RQPakPOsD+O8Bab7T/EC0g9TYHaJ799if1bgcYme3UAc1o6TEusWSJIt3Fyc/EQUa4i2bGtOPlLpqvZK+Bo53A9yvZ38dmyK+ZO2WWzDMgpES0+69IvFSWxkufCI4Umv6huAJv8lC3WBEskdQPzfhlhGg0ed+V8RM/+bUOGD2udKEpOAGgp2dLIfsUxapEbzkQGyhfUayaIz8TB6ldzrYcG2REgvk1iAOYhEYlJEODOEhBjJGPAMQ4AnE9BTEuoEUSCMReCmKCfAQgJlkQtccqCmaSfARgppBRrqYgpshHAGIagbiBgpgmH6nT1HBsLCsXnorKx8aycGwspCg2lkWDswZs5MihYZINXtiYQyiDK4ta9SAj6kFG1YOMqQcZVw8yoR5kUj3IlHqQaQhkeOziwWsAF2ExaPkeLd6ASbgYWiMSEMvFeHPRlGdCYAfMG1NXE8MGTeik1zN66QkMS9/HGFG00PQ2Wm3G1JVBiRkVlLf40Vrk3suM5oi9T0bdRyxX9xHr1X1ERt1HyaFRMqCtRxYpWsS4AF2ANgMIqZc+8JLhlbTigaCFS21KColVTKrpL9oHV2PlnnwS++VYuScf+Zl1V+K+S15D2u1KXD85NAqPGlPAm8V+NCkBgTisHOJh5RD3K4e4TTnEEeUQNymHuEc5xFHlEIdUQ9yofIh3Koe4VznEA8oh7lIOcav9Sb3HAaTeb380bp2WCnzvdMSjeubZ5wCrtVM5xIMO8PQc4JdtdIDmOeiAMe6ZjmZrtwMIM+YAiOo1z/bpqHnud4Ah3Gt/IdzoADt4yP6TPqIc4q3KIR5VDfEW+9NlpwOUrROW1U5YJOyZOlqbutuDMQwf0Ujp3R6L5U7K+U2clFus8maPppfLPiU3A9nSjlIbPN7SY0iCyl6Eb3R1pY3pg0R//skMQ4kDg345VMTl94D81h8Y9KMpjfAuuZ+1mag9BpXtTxK0UgVy8p27bewCnF4A/UZVs6r0Ds6FQtK0VunsMyMpqrmlmKaVngl2wEzTup4EDeUls9K0NDSw0rRiheZ2LQf8D0b1phl+LUuhuVNw1AQMAqVMlHxTAz5HgvL+krMAYYNFKKI9iSEWYhYQpDIaSvKk+KShfOT1Ubz2zwVrRsjBnzfYQzadHPgK+vg5bFvjcubNJ29b47BtjSmyrXH0II0BGwlyaJRwJ7jCzUiATyDawkqAhpnFETon5FDtl6dzAqZzXBGdE+jJIQM2kuTQKCwmuWRhHEtIImRxAkBCM1EOp0ZQUcILOZMxRBeV31GM5ANYGMrvKF4yWJQ2UdhNomRSKQFOvm4OcOHZFvsy4y7ElJz4VRvnWF0c1gzjm1qEpeoQLqhHCNdA4sPwbibJzUx8zzDiewaJh0nDO//WScD0NzMEfJVuUCD5vgrLfUsWmj+nAV9GLdZ9JEIgj5PlofkwD81faF5RdkI6FnWI0NB99mZEaYbyaQz1CYShYDFfi9E6ZiaStpiC6Ccfke7AOJAPDdxhcSDflPcnDjIEY8wnABE787BK1WlSDWJe1WlSDeJyVadJNYgDqk6TahAHVZ0m1SCuV3WWVIPYq+osKcHGVfhpUgBmBhklfeI1Qz4aF6HEWMKTi1BKlYdF3JHxv4hR42aRRUpOzj5k5BcpOXiRklW0SGEc+8uCi5RKcmiUbiPegvsqlXR3lYi6JEB61YMMqgcZVg/Spx5kRD3IqHqQMfUg4+pBJtSDTKoHmVIPMq0eZEY9yJB6kH71IAMQSA+qnnX70E+8vg89ONBz9ZrBddeduea6/Op8f3fPFuP2ckmlbmFuCw8D+9FXAaVe08P6/WNgWzmNbiuPryq/QJRhkV6yavsDTNBf0o6FRyX8Jn5xIIb7liJHhTpwbuSjrMiHOEmI9SYVLiHGyQ2YRHnct5q9tfNvfO7DVj8eiUVYDOM+uWUYvZkHeiJxsc3AGAM98ULzf/E3A+MA5mOY3I+D/j6BeR0neUkpLwri5DufbAJHcfjNYFTXb26PQJzFEyRO8Fi6ODMJyU2Uzo0hplLaMDV8VYUsrOrkCHCc/MKqDl5YVSlaWNXR+KwCF1b15NAo8tUX28GnqOvp3uoR16MEcVg5xMPKIe5XDnGbcogjyiFuUg5xj3KIo8ohDqmGuFH5EO9yABr3OoDB1QvhmAMg7nSAWG+3vxDuc4AlHHWAJdzpADzusj877nGABneAG+UEPTHqABk86ACpnpbsuNsBHgpdr50IEcYl1rt1SHdx8jNTS2jxaVtVr71ugVy99noT9doXyNVrp6NgiULL2mIYpuVCZgH0louJyDv9QbbQcin6QU2h5XKkhDpB6pxErkYc4R5dJd9ys8Tr6Ig4FEdvIIdAxbwnW+XlI95aDHH+n8Rz/cLkuMBdDbgEb95MODevA8SIubZcyy/BG2ee7eglhg3GS1mZgxqn9LH5fxXNIml1mYNp8RK8RHZbxvguUHqsRkr31tIFe7VHbQuj5R6w0mb5hyrCSg9VhK07VBEGw61voEMVLkAbApQvmruIVgfQG7icbgh8kyp5JiUVwTrb3fpm7YN730CFdi+Q11luoV3u0s8ttCsF0S20qwaiW2hXCUS30K5NJcYttDttFLhbaFfJEPc5wOcZtb9UW1Dna9j+RsY1Ca6ecAtyH2Opnpbs6FZptis7ulWabaod3SrNSiC6VZqVQHSrNNtT2bpVmu2KR+dWaT7f+irN56us0tx6Wtll9WYgWQ8JrEpzWILKWJXmMPnZVPcnDjJc4gVkkF6JfWYN4ipVVWU0iHlTVWXSCMTlqirAaBAH8AowAMQsApGuzpMlHwGIOQQiXZ0nRz4CECsRiHR1nkry0Vj3pqr0mGJXKU+V5JZSBdVyqiAhv4FeDW+gpxRtoFfT2EyVxNuAjRpyaJTo15DWCuiuhu6uBtEmBMiAepBB9SBD6kF61YNMqAeZVA8yrR5kRj3IrHqQOfUgK9WDrGJoRE6NsLjmFUkUMq6xvJBxjfWFjGvQ5Gy41EgNTYLaYjsw666W7qwWoakTABJ2h1uutRXM6anmVR9ZzlgHVBfaUhro2yDQPoTAnIqTYL331+rpMBtVgaU44mWW4vDDpTg0LPklnAmiAAZF1mrS55DQCCnLNULKeo2Qwhfewggm1Mih03u6l646vW/D5seX9K3Lr1jW13viknz/6sGB8S/7eodJv9ZH0sFnAVcjR1jCEhnocbG1ZlwfqvgMEapYnh+4qLt3Wd/q1wQMLuUVNkQHhoYs5EmPU3gStlI66cVk2y8Re4LOmclXZksJVmYjuAmIQonVZqsAE9PLPy9igluQ8yJ+686L+EFuSelMlJFbUgLrvADaXZncElfELQEruCVgObcErOeWgAy3xMmhYQdfg8eEW4Iut9iJW4IotxBvQy63uNwizC0y+xfquCWgiFu8ZrnFi3CL33JuQS7m9CriFj+6owWfKWZczEm8TZjrzibc4ne5ZUq5Jelyi8stwtySdrnF5RZhbsm43OJyizC3ZF1ucblFmFtyLre43CLMLZUut7jcIswtVdOEW3QDfrw04PHp9PUvO6t76cDQ0A6wew/4JgakV18DtvABLZYik2e3WAu2iIBvojsMCFP6H5EVfgI7KVzfrJQKbmLvnd4LryYfwaSg8wZ7gBQAsLJgLZDDomVt3cDIYakttFXxb9CpQ3NBxVN56shRGRFTSz6CqS91+tSXarLRMUh9qeamvjDQUI2kvtSS2BIHGYeT2nV4FSdwTWmQQKN6VilLoj0xEZrx6gttHfy7ieoBnq7DeHoc9Gw+TzeY4WlGAdwGclRG3NeTj6I8XUs2gni62jqeruXydD2SpbeKVf6Yz9OYEs2bUqIYT6+yiqffwufpGjM8XVNoexufp+vN8DQjA7Ue4+ka8tGEnq4Bebr2WOrpGkRP59F85zo3aZnAlceM1ZJKUawhUxRrfeZyTuFL16qJdGGoeDWDsPVyuO2UJ2w9TNg6RYStZ/ls0PqtgRwaJSANxXZw1cwGljWFszpLEIeVQzysHOJ+5RC3KYc4ohziJuUQ9yiHOKoc4pBqiBuVD/EuB6BxrwMYXL0QjjkA4k4HiPV2+wvhPgcIoXpSH3SA/XeAtd7oABnc6xJGxRB3O8AkbMeCXXGJBQZ2cVac/MzUmkV82lbdZFXfIXeTVYOJm6w65G6yQo7gBRUdwQvqPmPcHNT2bHGd3XaUeXNW26Ocm7Pa/pFzc1bbJ92bs6b85qwUOS4Ar1VTfnNW21MKbs4C96HN3JzV9lUb3pyVNL6LlB6pW7WipUfq8H2s9FiryfnPZIroHNObs1QV0YmjAXn35iwX4BQCVHBzVgR8EwXfxMA3VSVPqKQiWPX2Zt2qffCLN9DNWYvldZZ7cxY3BuDenCUF0b05Sw1E9+YsJRDdm7NsKjHuzVnTRoG7N2cpGaJ7I45dPb1peSOOe3OWTQnjXlVkVz3hXlVkU7PlXlWkBKJ7VZESiO5VRfZUtu5VRXbFo3OvKjrL+quKzlJ5VdGsD9HbFD5128w+7FaelASVsauDUuRn5W4UV4NHg2Yg5faDdDaG9hgyviMSocJIroaHztXQHiPGd42lx6jxXVPpMWZ810yKn+FdC4liw7vW0mNVGZkj2T+LZ47oToLB53PAI4T+g6wze8Q1ALR8+Avtby8K0Kxd1DVAxO6Wj30NULAkExRjhuQY0yu/GxiCdwODinYDQ7SoBkuiasBGmBwaJcZhErFAd2G6uzCiGcKINPnVkeZdSknjt440ftOkKVrme5VRhrssNw3xsHKI+5VD3KYc4ohyiJuUQ9yjHOKocohDqiFuVD7EjyiHuFM5xDEHMPhe5RAPOkBRjDpgjFvtL4RHlEO8VTnEo/ZH4x4HSLUTzP+Y/Ul9vwNUmXrm2W1/wgzbf4j7HMA7Ox3gTgxPR+W40f5C7QSLYAFE9ey4fTqy4/0OsIOj9kejE1aYexygwEcdoCdG7I9HJ6xZb5u6NSsezxYfBrE/ofQgf2gx8P0q9vdhj/ze72KZvV+Ptvc7V2bzI2j5vlTQ+s2PoMzmR4gcGsWaxNuABG+GEG4nQHos3DLse+NvGRa1hrsv5e5LuftSx9i9cPel7Kp61LPjVgfQWr1Yb7e/ELqRUjdS6u7vuYThDdENYbshbHdz+BhrHgdsDqtXjofc5B5LA6XuvtQxVRPuvpS7L+XuSx1jdTuF+1KmIX7YXb1Nk5WRE2IJ6hXPDjdE6Eq1G5M5phKjXvOM2X/W03Mhc8ABesIB53ocYGOcEOTZMR319xTGyvAsGvFhkCl0KiuhhHqtz4brNZsNZyxKQtxGk5LIKAsiJEyRnxkLRxD9VU0WjhAns3ZDxGJqHiHyUZwHUiXaGCGGyUcAInaLRR67WAe8BiqBQFxOQUyQjwDEJAJxgIKYJB8BiGkE4iAFMU0+AhAzCMT1FMQM+QhAzCIQeymIWfIRShjV7mLoWAj1mgNuMCfLpTCKreQKHWdpwBeV6hYdvCg/MNhPDzcnILQ5GgE5MaHNyc9uEm4Pe27n8u9nz42dN9gDQAXvPaqip+jlGoJKulEVOXcjrivJR/GB5EqqCmhUY2b0jKu7a8iJGEdfTT6aGP0qpaPPSY4+hxGmSkAIqljEFhKCqjd8f9CVM4zk6xq5/OesYbhFwNpgtZ6IHsDk6ypFydc1KK7gAmc1NB6JtyCv19Ld1SKkIUBG1IOMqgcZUw+yUhnIyXcfVD/GkHqQYfUg4+pBJtSDTKoHmVYPMqMeZFY9yKB6kNXqQebUgwxIOBtVwIr/iddX/IMDPVevGVx33Zlrrsuvzvd392wxLuRLqmoLcwE+DKz838Ne+ecyw/qVOrCAz0jM0V9yPOEbyXLkUobExGdKmFieH9AQcW6+F8ZFlI0LuIHHMD3w/r2VdLHLyTcSN/MFwDdBEFoIHEEYhKbdALhGQy4YCYwBKykvabLHzu/TV3MtoWHiOlUwgDC+ktJdtxojYbAuXO28WBvxHsYHvkLHg7RP6FdXKtcPMkBF2SV6K+V9UR/si3oV+aI+dPVULq5BLcusSk3Mm5IP4l2RQ47S2jhYkglTEUQoAAgISVAn9RS7hgodh8tmmxx4uWUpCvQJEM3AwHX3cbJK7na+UwP+uIVFW1PyMnHMi7ZScw7LdZuU2p8g5g1f+xzSiPVPtExEuDIRoTuOcGUiCrBWRGehKNaKFjq+IIF3TRedjcfZjcH9CMSS1JcEiiOTToDxkxBEa0Q0IdO/EjT9JXH+GsghoDhPwriJgfFwobNeA10Ayald966BIuYPOQ+s695p14U1qlih41v8694ZHBHlhjPxUUV1A2SN6z+K40rPhLHFsCLl4iuomyRrZN/ljywIsEgU1/jBQsfz/Nh4yEyolWFxQ+S4kH3AoK344gUBvgCwH8KxP64U/5eP/ZgZ7DM4NaZTnAbsR8lH8YGEuNiPc3QFMTwaQfFCx4sE9h95vYvXtPUFa0YIMJPXCzDYYhHbQXtZU42/kfX+YjhRx4G/ZJFIhVGRipnaQI6wGIVH1BBK1JjOn2Ah6K8EUSFburZIoU6vncbeOUNg7H3Iop07qxDfw2LzXWeAz3dRM3zHVLvEuMykQngR5xOkXRSlXUQ3J4a27YwTtDN6e1G263jKyZiTGeW7jhE9MIiVmRekeHGSRwqdWY3kCeTOlgDtlxKsCd/nEkQW5NjCxENLhvboR6KCkWK+gWTUysMz4p0tSHEjPzITCnNREhlFWT5NdsBBnLDjA57Fl+W4GVlmGPG4bkoGWY6RjzJucXmOAccpjhc65/LdsjiA/QC2QhkHvaAIuu5u/RVJXpJpigGByXc+2RBIcfjNoLHwS1A+zKV8AqV8gI4gJARIzzDBgTI98gBugsdl4y2kGueKID1CD7hD4SGnDOupMKJPI4jOjBJrfeuqAnrko2vHvCqgbg/o0+w9oC3sPaxgxRboAr5hcAcoAO8NGXfEmHmuJia5GF/yQorGW6aiqYQVjZ+raFTV/dQVXWSkXBN4EMeskBgHEbfIT0TSDV+lEHFMyxEgKC+OaVgcU4rEEUuhLUsc0wFIHAOwOHrAN95yxDEtlcFdbp7wKuV5wnk8TxiMh+SoeEgWi4fkCp0f1AzpNWYGuhwfqHF5VEm+RMP0RAJmJbDWipNfi3BFQiofXSTDPSuVj46iJsdCzcRhDOOHZL40gJkkS21MwAKmkZpkm4lPCCCTE+kHZ482Wwemjoxe0K9LE0iRUzc1xPPBIRr70iWw0xKRLXQOanbzFKNxiNExqpvAb6hYUBzcE0qAqR1JKrVjvEdQ/Gsp8U8X2y9hTLa20Plh2v5pj9SufJa0oIZ3OdLFMryrRKxyFekrULcAHwId7xrS8S6i5mOgNV+LzCWNzCWDzCWGzCWOzCWBzCVJzMXEtoDJRbdXx76slfEwHPz0IhjxkaSAl1VZZFmVQ5ZVlUhR8Sok8FONBH5qiBwqozOmOWxkZA92xW4/45/n//inj91AJyAV/S1O2Cuij2No6oMkPCs4+EmNix4E88sY/q2nvMQGAf/WA/u3IUX+rQfZrGIkc0jmVSUkwtpect5YzLRIrKN2SuYAIumHwUyHPjDTYREY6NJyIDq/ge1Myux2RpHkXQ/52VT3R7FeVI71YqCnMYP2J2DOS0K2ogjMKL4zdEibvEL+afEr5EMCfnRYy0aRsGnMTSGtEY+Rn+Zno3iZ6vdGko+hoWne6gmMGfWxR/T/aBaJqUt1jbFNxdc1kj5lLgIjENuidcVaQu7pYQUKnT/SPviWhSm68WmYohtTlKIbIN8VifU8rQMDXAsWQLYSPLJ5TwFy9Ky8p87/Et+9j1B2as6t8OorPpH/DggC2CihbxQXahSfUJekWp0c5s00d0iGDam1UBo0Mlly1NKmRNsGm3eauClJIEuGJLlkYJ41+J3Gpv8n7sREQScmRqd2vIKQTOPXYrNzyLEbTlwQE41P2BAQbOo1TtAGQkA0xoSIIGecH1BLTH4iyrdpkrLIaCFmT8KNXlvvMlGTQuyLyO79K0zb01VyyF8VP7cTp7iha64+mv5kKZq+tCff3a/F04eGtgCHty7hHFdKIqZQUvBN3CiWgk1hUpEpTNGmIVkyDZSqIoZG2aE0yQzi2wZpxL1Pk8pAfMWQBLZb5M8CxuTOAl7C3riJesTOAhqG+1nd7tDF13X355ddnF/anx9YJ3Ji73WY94Ff+sBJQC3897F3jJj/lX320Cd79tA49fKH4BccAqRNoAAjMyXNRzpWdsAe4MUCg9ccOcjpNm4UxHBH0lfoqi66MAuOdy5CFjOPg3U1alasXtxXStA2sIuOCMMmy295uosfNlk+RSaLsYzyKdlf95tJd4kCumBlObvrCWSKi/F9VG5AgOaYIPk55XURsEt+FxLaCykK7emOtLDWmV3v1AZ0vIU5XyZCGMc856vcU6Qxiawl3TWz8I6QtijoeitSGXKR1FFOs0F43SFQVqSw6y3i1QkCdAhjI7jGrSg7AmliTygGs2NUETvGcNk2dptQtCfE0JO61Fo4ghHT2PHdNDsmueyYxBcdwFoLYMekzsBT7JgqdJ3NP+PadUEZmfJhZjbwPG3fv+simV1OOepWPCbP0QnrdzkTcruccuvxik9KMRZs3lMs8/w+VnU4LctFPBCQ4nJ0GmCtlE4sKNZKF7quKpttZpRLhBlN5cZ0xskIyyUUzCxJbF4WrRyJTRfmfkcDfh1jO/R1TxSf1d//9KlOcOwVZePcLy/sSVjYY4qEPYkcd8SiYMmpjoLFlYHkWTizAJ99RMb5OabcE50S7hHHL+ExHTq9p3vpqtP7Nmx+fEnfuvyKZX29Jy7J968eHBj/sq93mHRWfCQZfGY8tMX42TTTiqRLJpyetpwV0taH09My4fQMOTRKojICioSRM59BhDQjoEikQfIUiVmAcorkmHJPdEq4Rxy/5hRJmlQkGZ+EtkMUia7mPEK18ciwQPKNBENk5GjSIs8QGesZIiO3rM7KddtMcMdDl/Rd1L1sxYatTBuQYOqQrE5/KaZtzK60jVlH29iU0TYpRVsoubR8h65FqUMXts6hCyOkScuSRsblJuYNuw/aoYauTyAWdY05Ew0d/AEWqTqvhnX+p+vjZbNNs0A87NPyq+tJGGez19af0kB/hhHFFXSJZ4PpX+XrOb9SPZe2Ts+lQZc4Sw6N4uQsqSrFDwxmEXczK+ASS4PkucRmAdIuccyu3BObEu4Rx2/MlEucIV3irE9CccdglziNuk2iimQObQ5gVshazgpZmBUyilghi1op+IRhlpaonIAikbxkKSegSKRB8hSJWYByiiRuOffErVckcVM+jipFEhdTJHEpRaK7cw5R/8rXX1nLnfys9QyRlVt/5ZSuv9LM9VeWqU4yymmbtitt09bRNj1ltI1L0VYipBW3nDRx60NacUszRZrNZYrEkbV1vLjsm+2x09o6wVxbz57BXxnPBq/ViZtZGccLc4c10GEsOTEsRRzYjQmTn0mYLUleSivNS1FlthJyZktSo6bMxaYSiPxoeSmzq+0fm5pdCR47shtDxa1jqLhDGGqWAxiqVUAhd4G0MaOQE4W5gxrouVj4QVWCSpT8TGKzIG25/KSt3yxIy20WZBTJD5ONYTLo9nOKzPEWJNa4xlzwEgpUAIysi/eyyufNfjN4BsZuDJWwjqESDmGosxzAUIsEFPI5qveOrtBAn4cp5JgihRzTEQfuT1U6YVywv6meX1hRf2HB/hKK+kvYdH4hRf2FEMUStat+tzDLK+oQ/b7aAfp9lYB+X6tav5+jgR6wcIPfBD8f8w3+cgPMKSm2IuaNlRwtEusWZI9sjblNN6BRJcBYun1KmrUqC7NvFuDn20DamOHnTGHu2zTQH7Z6Zz7B1wXoCosqEQuLW7Xl4lYNi1uVInGrobEhcPf5svzS/uvXDCzMrzvhxFPhmiCV7JPxNSmwRfV91Mn2iSoPxnP0ZJHsFPMs/Ai760wKOGB/Nvv7bAq4jz01YmJQnCYcgCxxHtEka4t47aMoLfKfkDVh1UUYq5gmbPYRDfT9gqC1MZF9sEDv5JdATCNczUmhMRbZykAmTsHGn1h4cHLcvToDwQoOPqgVODkJRszF1/UA4cpeQbWv4RElVKYw+wCfUBmEUJxrGoyEykKOEBgOHb2gHwwZZ8HIo1b6Yvaj4DdwqZWVcGvdeUy4HlqCEFpWIYvZn9Y+eKysAX5eTnDfRY7WUB+PFKIJfQ6WZThvsEdX1SdDosdI8aA0xSfgG10XYtSlmSOcFzK3FYCtWjPMa6Fnf0sb0FMyy1q5M+sV98n7JSHrl7UhuWWtXPi9YhjmQIZzSMwbLnCp3fE++1lWBIa3DEiYcWWhEhC6XXJWCYjZXxP3FtK0ZviVddmiZtjxmGeLlukJwOzIXBzCNqqSfFckFqPGbyWXHSvpjiu57FgFsGMl7rlUFWb/F7/i/Owfyu6mhkuWieUuzZ2jgX4B1EI8SwdXSGdVFA+VhIyp8H9WdlnQGUhF8RQo81j51QxSsCBBaASjxSSKdoD7AniVEGxfIIX1F1PUX0z3GcPVmqNV0p79e5md6qDlKjFo/U51UG6nOqpIJTLrvhHzpjK4iHdFYr3KojVPJcbM1GWI8++mZ1+bO/sVsEaSgO8+JyFBtSjfz0CTekydSJWQlmPqQIStcyDCyuJsISB4VUAqTSbkI20T4CRibUGs+zS7TSoFxe1GTA2trIhbSZhoCQ0V5jRrH6SsW56ZKRjp9OUZXDBScnkWZyzP5tSzHIvJoS+SyDPna0Ao3y6OL88ShTm14sszuhLYnBvK3hqEQ5Nji1asBxebGXgdQwVesgLN0vQ1QwlyLQFZHmYJZWIdy4pWznmzhr9OmazdsOXiHLY+azcsl7WbUCTO+DGKMFJwM6wR68QpK7iZNldwM12Yc7y4L5eixXk9LFWYMCZlgjSVlnNxpfVBmkq5IE2VIi6uYu1hEPMeA28WrdRofAbNxdVcLq6mO67mcnENuKFHjJ7m4prCnIUY24w7TFwMno/RQATAj7BNeBEA+2gANVIAZtMAaqUAPEkDqJMC8GkaQL0UgM00gAYpAF00gJlSABhhrkYpAO+iATRJAWCUXGmWArCFBtAiBeAPNIBWKQD30QDapAD8hgYwS6RaxGvFcuE9Airxj7JnV0CqqR1QTWnS56NVU3thzu0a8KtA6810CrM46HHb3auBfr+FZwdMGFTHnx2IWZhbOmeF+ko6qnNL5ywX355P0mLUj2QowNuUGcSpzsKwQ4hbrjuhDlcUTxIOLZz5EEK2IuJIcDdFrH6pyxaIjqibPYiOqKsYiI7Ayxg8ZEfU1adER9RdlURHpdsq4bFHipePG3c+ukjaAEzaRXN2l1gGfxcMklrT6+rLAc3m0IuWLoFms5nqe47OBFEyNrsw524tJ+oUWmHNkY2KUBDmyUHwQtObS9NnDtmLgS1ml+yBtN2YC9uN2YrsBmM2sxFum0tOWhzkXFGQFNXmKqLaHNY8iV4MVNMPih7y5HSevVUZEooQt6pHa6XyQY6qH2SV8kHepn6Q1epB1qgHWasclXcph/hR9dOuUw+y3s4gi6j8mHKIQ+qn3aB8kB9SP8iZ6kE2Kp/3w+oH2aR8kPvUD7JZ+SDvtLMV0x5b1INsVQ+yTTV11tgeILXybgdDax2leIbhTWdpeMWV5fOgDwuEL9pLj6xLt+YU5vxdA/7fvFXbeDySMbp+KqOfWPPM5t1oP1d/Of0cHWJYS8H/pVGrPVJhEWJNWgqL/AWaZwdnnvR4OgpzfkEvTCQXYFi252xwrGC8ahLI9ezhvlhcSdfdPYmsye+9JBqLU5p855MNg072kW4G5cAPTowWuXZu9K6TbtRB4oSS1E5SaMWjLRp2F4PDf7RIF06guotNnz9ruJspwLDIcdvFSMZvB1JJqx0JzHbxo/9zWSEqAjjQbB6Kti6diqXQNq8w10OgDeoCkBjCUiXYwP38E3AwcCR7fRx0qAg6A9bdmo/nHALjoRvNJ0dljD7OIx9FlTUhYrMoI0B0N49nBBZMjJZJkfkgn6G6eg0D23MLcyn7MIdsO8nbc9tpjX68olDTcWio6XgJFjiOFCojNecLIPA4jWN1KJxHNqWReFxhbouGKDCYcDwbNskSDNjHF+bONBLoOBaBmuivJum+Dv5mLvl58as2+quSVwN9M0cnSBrTiCvEdlBHt5OgKUexJC+0q0iMjussYlnMZ5exQZZibpDNXcDXcYycnxB/y451uokYl1EqcuSjRb5PxX2w75Pl+j6VZnYuq1A0hGnfp4rEgzhuwyDXhmnEHmJ4FlmBQ2BmzjVk0KIvQfz8OcQH6TJ94HQ5fJAzwweV6CnDIOv8IIEHcdwGQT4I0ogl8Mngg9skuuXrgzSacBDEC0ZAfBC1jg8yXD7Az6vKMA/GBzkSD+K4FeKDNHomkVt6K2NGH1jCB2GXD3h8cLbs0V5dogHzcO+1fNchZ4ZFsqiupMsdZslHiEUS1rFI2ozJSFtqMrISuBVSFVnErcgguVBpgQqtZpbQCRZGETWSIB8hHokdSx5RVZ0tg/JIlsSDOG75aiTDr5ORZFeuu42vRrJmWAT3PBPmPM+4dSySMGNpEpZaGus9zxjijeiSHrmV9+P0QbYkOQaQ2almcW4cOcMKiGqNSEAshr9fY3iwzlHcnDTFC3N38qUJPzUOohfTNAn8qjOr/PcWR/ltMteVps0QJCtMEK7m19Q9X4Ky5nh13IE8QvCqVdtdCItEzbBItEwWSZhjkbhJhRvn3yGVNqc4M3SzNFdxZsUUJ/tmlrmf5SvONP/alyS7IPQXTLkhpha8umMLx2TB2+KoAFhaYiQxMwTJCROEa1IlFGfOHK+OB+3/VUBxZq1jkbAZFgmXySIZcyxiPjZWupaeqS/+S6BELq+W941s0N83tSdjShVVkqOSu/e6qrwrTStLCTXllv1ulj+hgZT9rlR0QqOahe1Sehp8SFqo2yYz19VWk90RhIR855VIukkIqdevneWa+yv1hvr3GvBfWx4QD5FTh5euOU1Z5KU2Ak0IbFW5pqqKf69BillBcu5fBbLTyrQ6FY/BVqeKa3WqWeji4biGVeGBwApldWrMWZ0c1zmuRtOscrh7XF2Y5+enWVUja97FyO5wNaIIqhBFkOYrgpgZIxkrzIvzjWTCzEZljBVkQ4xkjHwUXVdfJuAeJpG10mXk4Gj0JAvzcmSqoiH7i6ymM5n9JXHsXrJcql/eOKesP3afQkOp8PZ4itYHIidyJW/bsuDCt3Qpk10xwGcfAU/S2417klPCPeL4JQpilby5x5f0rcuvWNbXe+KSfP/qwYHxL/t6hwn0pnwkGXwS2i9Z0vXoBhmYC5qcCPowdR/SqKThGSO5lNJOxEhivNzUmD7nlVGaS33QOVnOFk7SDOekWJQkDAglmyKFmmMmfeTYZoF7M7ouoCU/IIfmID2GydHNQPaiPXQNiMlW57A1yQyjJplBjrhY2OAtem4ivpmBlLsIw4wb0AuSvwj5TLhJUM/rfnKcYCP/ZCY2A42LsNHpuvIUm1zO8DX8hXkXFsk+j1E1yj8VZA/IE1fzlhdcI05cH9k7VYlkEkCfho73HCN0eOyEjrUEOkCOC+k5zkc+IvVARYpwXcJgWm9h3svasN4PD8tLiY+H60dFWNcSEMxBjyZSmHdNEf3HvwQikuFNReS46R3y3lQE9qa8irypCG2JvKAvHiWHht1rD9bpiaKhUwbIop+7QznEbaohbnTApHcqh7hHOcT99ifMEZfU9iT1s0ftzzxblUPca3/l+OyY/QmzxwGEcYBy3OoAbtztAFLvsb8MWqDAR5VDHHbArB3gjO53gM/jAFI7wRk9NB3dsp2uy+O6PHbROxvtz4zPPqgc4gEHGIRRC2w/GAINUyFQIikqwLxkdd5fyo5ULgST9RlR0JgsbOkoaAxJ/orCEVJyYKecDA/s3Xuvru14/IxvSezVmTqxQ4RVy71w6u3IETndGx+Nxck3frLz4p7qK/TI4rIjk8Ei0Qt8YelZ5gjDAKg9+tSD9JgDWaxvRzA0IbXU7uZkuz5wY2pRcWNl/k0yWxmS28MnyAtxwPqtjIDMVobuegKKsMTbsMTOSQThlQh/2WMa4jbVEDcqH+KIcoi7lEMcVg5xp3KIu+3PPHAA0DTELcohjimH+KByiKPKIe63v6I44gB9q16s99if1HAMxz7Ms9P+emKjA3hn73RUPPsdoHgc4Oi5htWmhFEv1Pfbf9KHpqPDc8gC0w+nK2MhSg8jRBkozL++7GvmTwZTzRnRjagsbOnoRhTNlAQjH1HBEOUnftFzU8uMji+ZCz2LB6awEKVkIPB4pNAbFKKMgiHKOBaijMmOTAaLRC9wCP8sc4TBMmh96kF6zIGkQpS64BgUolyLnGLxwUFKDwmKCmCWgBXvCjWKliaaYoJ154qG3z32zjfdQ98zUpw+dClpkBwogFc/Kxk9WAriss5zzL+DZvCQultTQtRE/AI8F2ReTqrROs+YSbAwf49G5ruoXr0kyU0NCTi5zBvUkED1Fm+Zh9R88CG1YEm5ARMLjcFHw0AJDtONQiROKLWgO75DvfWQfQNdeuguNdyDp+y96Cl7P+44eAvzdxEHq6lR+3Q8Ncl6/3jMTgHBGw5exFvwsZ0PodND8z+BnB5CJfAYSIKfKwlBlMMo8gdFWdrPYh0NrsY4kOYX0U4BvXaaBL5SNxGWY/wprfunsX69EltgBMqMEAPkI2LgPGZ0Fd1diHxETlouJG+8CZCNIDb1l8mmfphNA2YUdgBh0xCJK+qtV0cSEV6Q5MHFXB58Ruv3OeU8uGpqeXCVy4MTSFDBg8+Z4kEfkwdX4TzoK8z/ntbvL6h+fQI86Kfx4Ss5hshM/BiDeiR8oQDcnYd8RI6B63jQL2KufdbxoIfLgwyce0pIoLjMj5prL8uX+wWGSi/GKCDlfAijeFAvwkefx4YjUH5ZOkhHoPxwlMmnKL8GI7BHwhoQCJYovOInC68EfCjL+Iq+m4lMIbBREF276JQmc+X5N36FsCBTXW4gQUMzkg41jFv6V7WFwy2gd15+slhYabKY37pkMX+JL+HYVYC18Jhst0hiJRNEtIwLcJoBhCzJyqLpW1Al6OXTMHqZsr+gXgNdi8Vg5RWpiHuGq1IfT5UuaJJWpYcov2wDG3Qrv7JhyIwdDKIROnTpE7RszRG2as1hMlDpQwOVQQncEgEduGxOECkfFSBEr8xNhgu3fNzzs3eteB9/k6HMjt791h033Prl/73E8o78vvodzR//wLn8jijnISjHoR5sN0Sk9HUFyNgVZW9Cvyrv2YRhzyagyLMJo3JZ7tmgv+Olr71MDRYmuyMICd+wAG0RR7RSTX+kp+KVnUq53PkKYrkhh/pMTbGAl7KFQJtOTJW2XqHCggs04OeJWHXRimC6AAnIdtSVJLotXyglRdQVCDJrdy24hH8tSQRAZxhH5zjwy/nOQNSMFYygmQZhyhmIGATAoLRKL3klOyN6uur2q8BG0dfKJWrsS+oy8NyiPngVIecJl0vUDy5E9iTugwhZ/hAhhAfKjJf4QVGfgawjPXS1+8lW75XfAfSZqZWpU9UgUXx6ouj2BkUp6RNiM7gnpJEHUVRwYUFjhU0TPYkhwu3J7cntye3JyT1R+b3eki8wdn6f3gEvNZuIRBtdFXIvbdJVMX5C7ujwvBkvUCn5fWZ2dsXxpnNKae/h9VE/3ezb+VPPY0t/+bOr21fuXf3VF5Y9fuubTvzjGTePes95+cxNw3cvEi42rdt0QjgCmllQuNa03wzv6XbwRV0CU1wuZt3dntye3J7cnmzSE1zEnDKfZIiGZT7JnHPAfPppC2tiPj5slaYzM8EyvRVGgXlv0YCmll+287evrvtkRfbXf3nyO7vP+cBVF3367df95dGG679w+XHnD2ewQUIzQxet0Mx8wj0FzHCfT6ingAI+FzPVbk9uT25Pbk/qe6JsYQC0hQGltjDAs4UBMxbDC1oMcczpMhgpW+gp2sI5687/3IlLF/76wQe83d/Nxv79xo4n3nXPV7/d+6vCBe94csNJddggTSzxYFtoapnsn7L4sripNiUcbk9uT25Pbk8cs+YDzZpPqVnz8cyaz1x8T+lCyIOYtdjeI/9y+/uWfPtDC+Z41351UVPu/fEnF9zWsa2h/bcvvDDXd5XiyKVfgcH2CvGEV0GM1FRQ35RwuD25Pbk9vYF7oiyUH7RQ5NKHY6G8gIXy0kbMxHxMWShTDgFmoTypvy99z+P/ct6qG7+x5vNtD77lsk1ffWfr93c0feq8MwNHNn1lt5mVjcfMktKU7TW1WhMPQpric1MBBrcntye3J2f0ZC5hJMAxNgHA2ARoe2RiPqaMjSnbjhmbuu8ed9Yn/vzdhwr7/vXTd/3w1spf1TX537Tnl597aPUPLhutXbTRTBBX/Ih5uWY0oHhdHVCwgjclHG5Pbk9uT1Pek7ndIR/HbvgAu+GjTYuJ+ZiyG6bMNGY3Zr74kU2Pzv1+3emtlYkPbX/57iv+4P/g197z3hc++cyGD738zU+1mVkFoJn6Si2iOPe5u0NuT25Pb+Ce3J0UszspHZn3PRhJfHNp55KPfjbwrRe8R7uvPfF7L5689+LT5z988UkbLnd3UsqwUG6M2e3J7Um6J3fXweyuQ+sHfjrr9nd/7aILb73v4m0fO7vy+IuuWHjb5YtPe+/MK2/p/oeeL7i7DrI9uZFftye3p8lXboTebIS+9vuf//hp95z11Hsr1v/tU595/3lfWXPnq9nff+sLt3/1nw7cXPjSD90IfRl2w42Suj29YXpyo9lmo9n1f57/y4eeO9vzz2vu/upPE90v+TO/eviyS1sSnb1XXPGv917xP240W7YnN3bp9uRGft+gkd8Z//fJr1+5+cUzl+384hd+uPn5V6ue+cDMn5y88eZvXXPX6H8dPeMJN/JbhjZ343xuTxb35EZJzUZJ59cf7Lty4fNbKtau/euKX839pmfOnPkLK/eFHz75ilfO7/jV39woqWxPbvTN7cmNKE5pRHH+tssuLHz3J5ubzr/wyfjzhw49/vA7fjTQfPh/Hzlc8eXum3o/5EYUy9CxbqRqmvbkRt/MRt9m9B05+8kVj14zY+YvntnwyWtv/Lf6l378sdPmrz9n/wP3PPCFf0u50TfZntz40RuqJzdSZTZSFT7hP7b94LhvJSu+/811r7xn6OH1v13xL33eBz7TsHiwf8bp/36aG6kqQ/O5sRZb9eRGdcxGdTw3vOn2HV/xzX3cc8tzB970vrVPPjWvemDkN1/7ZuSKv6zfueDHblRHtic3AjIFPbkRELMRkMArtU+tqd7f/Msvfn7uP96x9oW3fPb6Lx369nNH0n/Z+qPPL7gy40ZAytBHbrRAoCc3WmA2WpCc+WLjH3963FWvfmle4vsPBAZ/dvychS9vmD/4kdNueXBxxeX/6kYLZHtyV9ZkD+7KWkgMg//4le6Dudt9v/lw8zl7T3n1H7uvP/2S5Ut+d/wz93VvGThww3p3ZV2GlnBXoUZdOw1WoVU/ffsrj5wQ3vLf7/3Rrp9decYPZ3790mWf/t251+9OLI59dndN2l2FyvbkrtiM8uPYFVuuJnfeVaHk17587vfWn/2FR3531sGvz+p4YdYXvzfyN3/6Xs9p7oqtDNl1Vzcr7LK6CX/lxK8ev+q+b2/b0Bxf/KVPPryr5j/qb/vYL2e+48VzL37rpzLfdFc3sj25K4EV1q4EWkLzRqu+/k/nN/RecObI95fcvWP1335Uff7ftn+iMvzVFwJnRd2VAF+iXK/ZrNc896Sbf/TMUxe0/uqBPcdt+/ivT7nomnXX/rk6Ehm555FznvrC+zdNM6/Z9TDNepjHLzu//0cn7Jvtu6u39h++s9D33l/M+uMr61b9qi3jW3PvmlNOca6HaU65+DjXKQt4Y7LKxZQ3JnYBIibsY+f1rR8mfyBQd1F+YLC/d/MjZ/cuew1jk+wzib+KzQ+d3TuQX57vH7v0lJOfbp4B/N3x41e/c/eNtf+3ef8l/d1rtgyX2k8+eIodvT6WyV+DxQfv5iOvT2y8twvWbC3+HJrAxNilJ51Y+m7ywQc1uHjwGrJBSBvA5v3nDK5es6VwwozN+8/t616mDcJfGo3+RaAE5MDFA339eXrcAeObUAkqc4BB44yCpQFKz4jZIHzo3Py6dZdc193L7Ga8+QQezr5WG3K4cPxfJ6nz/wG1EVfkOgMIAA==", "custom_attributes": [ "abi_utility" ], "debug_symbols": "vP3Nsuy6cqWJvstpZyMA+A+gV6lGmqpKVSYzmVSWqbwdWb77DTpI+LfXPBPBuSLW6Uif7zMXhhNBDIKEE/yvv/3f//J//q//97//67//P//xP//2T//Hf/3t//wf//pv//av/+9//7f/+L/++T//9T/+/flf/+tvj+P/lPr8f+2/Pf9/+ds/jeP/1/P/t/P/j7/9U6lPaI8LygX1gnaBXKAX2AV+Qb/galmuluVo2Q44WvYD2gVywbPl+jjALvAL+gXjBH1c8Gy5ygH1gmfL9WhQ5QI9wZ7/Uzv+lckFeoFd8JRoR7/50X9Hg14uqBe0C452jpZdL/AT+vOP5WintwvkAr3ALvAL+gXjhPG4oFxwtTyulsfV8rhaHkfLeoBf0C8YE+rjcUG5oF5wtGwHyAXPlrUc8GxZ5QC/oF/wbFmfx17Ls2U7/kspF9QL2gVygV5gF/gF/YJxQr1arlfL9Wq5Xi3Xq+V6tVyvluvVcr1aPs5wO3I+zvAJeoFd4Bf0C8YJxxk+oVxQL7halqtluVqWq2W5WparZbla1qtlvVrW6wD1OkC9DlCvA9TrAPU6QL0atKtBuxq0K1W7UrUr1WNc2DjALni27McJYM+W/Wj5GCkBx0iZUC6oF7QLni37cSIdI2XCs+X+OODZTj9aPoZM7wc8/1U/RI8hM+J/0gue/2q0A/yCfsE44RgyE8oF9YJ2gVygF1wtj6vlcbU8zpbb43FBuaBe0C6QC/QCu8Av6BdcLZer5XK1XK6Wy9VyuVouV8vlarlcLZer5XK1XK+W69VyvVquV8v1arleLder5Xq1XK+W69Vyu1puV8vtarldLber5WNYDTvALvAL+gXjhGNYTSgX1AvaBXLB1bJcLcvVslwty9WyXi3r1bJeLevVsl4t69WyXi3r1bJeLevVsl0t29WyXS3b1bJdLdvVsl0t29WyXS3b1bJfLfvVsl8t+9WyXy371bJfLfvVsl8t+9Vyv1ruV8v9arlfLfer5X613K+WY3z5AcdF/FEO0kW2yBf1ReMkOcbUSWVRXdQWySJdZIsuDSnRXj0o/m07SBbFv5WDbJEv6uvvxkX1sagsqouWRg0NPUgXhYYd5Iv6onH9XUzBJpVFdVFbtDRiHvboB9kiX9QXjYtiMjapLAqNcVBbdGiU44iOgXWSLTraK0cGx0g6qSw62jsmenIMppNkkS6yRb6oLxoX2WNRWbQ0bGlYaBxHZLrIFoXGcWwWU9THQeMifyyK+e9xHB6T26PlHv/taKXXRW3RoXvMBOUYHOWY+MlxPXrOhZ90DI/n1Peg49/KcU7G+JDjX8T4kPi7Ixd55qdxtms9SBbpIlvki/qio5Vj+qUxAibFvPtxUF10aFg56GjP9CBfdLRndtC4KEbApGivH1QXxUz+aDlGwKQj52O2oDECJvmiQ8OjvUPDjyOPEXBMBzRGQG8HHRpdDjo0+pFfjICgOIuP6YLGWTypLYq/O1o+LgbPOfNBh1o/dOM8HUcrcZ5OkkW6yBb5orgZOTLVcZHF7cihcZynJx03JMdY1eM8Pem4JTnGvh7n5HOefFBfdLRXjh46zsmTyqKjvWMM6mH6Jx3tHSNPD9s/6bh9OkaFui/qiw6NerR3eH897pj0OMfrcd7rcY7X48zW4xyv9ei/4xyvx62RHuf4pGMaVY+7JB2ySBcdGRyjQo8zux4jwA6Xr8etiT3ijk0PqovaIlmki2yRL+qLxkXlsWhplKVRlkZZGmVplKVRlkYJDT9oXHSMgOctwkFHK8ctkR1n+3MKfpAt8kV90bjoONtPKouOTLUf1BYdGsdYtcPlq8XfHS1b/K990bjocPmTyqK6qC2SRbrIFi0NWRqyNHRp6NLQpaFLQ5eGLg1dGro0dGno0rClYUvDloYtDVsatjRsadjSsKVhS8OXhi8NXxq+NHxp+NLwpeFLw5eGL42+NPrS6EujL42+NPrS6EujL42+NPrSGEtjLI2xNMbSGEtjLI2xNMbSGEtjXBr+eCwqi+qitkgW6SJb5Iv6oqVRlkZZGmVplKVRlkZZGmVplKVRlkZZGnVp1KVRl0ZdGnVp1KVRl0ZdGjG6j2uex+gOitE9qSw6NI47YY/RPUkWxRMqO+jQOK6DHiP5uC/2GLXHNc9j1B5XNY9Re1zVPEbocYvlMRqP+bgfo7EdVybXeMB1tHKMsvaIvzsecR1XIT9GWTtmfX6MsnZcU/wYM89bzSfFE7BjBuXxwOuYQflx3j/vGw86/u54rObHed+O64If5/jzbvCg48nY4ZN+nM/tmA95j787WhnxSO1oZcQztSOX45xsh8f6cf49b9QOOjI9PLYf599JZVFd1BbJIl1ki46ctR3UF42LymNRWVQXtUWySBfZoqVRlkZZGnVp1KVRl0ZdGnVp1KVRl0ZdGnVp1KXRlkZbGm1ptKXRlkZbGm1ptKXRlkZbGrI0ZGnI0pClIUtDloYsDVkasjRkaejS0KWhS0OXhi4NXRq6NHRp6NLQpWFLw5aGLQ1bGrY0bGnY0rClYUvDloYvDV8avjR8afjS8KXhS8OXhi8NXxp9afSl0UPDD2qLZNGhYfWgoxU7/kWMxuM+oB9XjXY4XB/xjPsYPTFCD7/qx1Xj+aThIF/UF42TRozaY34/YoQevjZiNB6z+hEj7/C1EaPsmLePGGXHk74Ro2wcfxdj6/C1EWNrUl80LoqxNaksOh5pH/f24xhbJ8kiXXQ8MD88cRxj66S+aFx0jC057p3HMbZOOjQOxxzH2DpJFukiW+SL+qJD41gJGcfYksN3xzGO5Jitj2McnaSLbJEv6ovGRcc4OqksqouWhi4NXRoW/6IdVBe1RaF7/ILWF42LPHSP4/BYqTja8+jn44zwWOE4jrw/FpVFdVFbJIuO/I77ihFLKJN8UV90aBzXmRHLKJPKorro0Djm/COWUiaFxpFpLKZM8kV90TipPGJF5cRYUymBNfHQOWb7T5RETbRET+yJY2GJ9ZtQO65XctzdPzFWbFqgJlqiJ/bEsfAYRheWxJrYElOtplpNtRgbh6M8sSVKYuTggWNhDIETjxw8ji0GgUe7ce77/IPjgLwfGGe6R5fEqX5iTWyJkqiJluiJPXEstFSzVLNUs1SzVLNUs1SzVLNUs1TzVPNU81TzVPNU81TzVPNU81TzVOup1lOtp1pPtZ5qPdV6qvVU66nWU22k2ki1kWoj1UaqjVQbqTZSbaTaWGrl8UgsiTWxJUqiJlqiJ/bEVCupVlKtpFpJtZJqJdVKqpVUK6lWUq2mWk21mmo11Wqq1VSrqVZTraZaTbWWai3VWqq1VGup1lKtpVpLtZZqLdUk1STVJNUk1STVJNUk1STVJNUk1dJLSnpJSS8p6SUlvaSkl5T0kpJeUtJLSnpJSS8p6SUlvaSkl5T0kpJeUtJLSnpJSS8p6SUlvaSkl5T0kpJeUtJLSnpJSS8p6SUlvaSkl5T0kpJeUtJLSnpJSS8p6SUlvaSkl5T0kpJeUtJLSnpJSS8p6SUlvaSkl5T0kpJeUtJLSnpJTS+p6SU1vaSml9T0kppeUtNLanpJTS+Jsorn6sOB4SUnlsSa2BIl8VDrHmiJntgTx8LwkhNLYk1siZKYajXVaqqFl/Q4tvCSieEl4xFYEmvi0cJxa1Ci7EJGHFs4wYk1sSUemR3PR0oUYFxoiZ54ZHY85S9RiHFiOMGJJTHU4oDCCU6URE20RE8MtR44FoYTnFgSs9cte92y1y173bLXLXvd8je2/I09f2PP39hTzVPNUy2cYMTvFk5woif2xPyNwwlOLIk1sSVKoq6TIJzgRF8YA32eGjGk5y8fQ/pES/TEvn75GNKBUeRxYUms1y8fpR4XSqImrp87Sj4u7IljYQzpE0tivX75KP+4UBI18ajIOh7xlSgDubAnjoXHkL6wJNYDZ+VfS5RETQy16JLqiT0x1KIf2iOxJIaaBbZESdTE7MmWPdmyJ1v2pGRPSvakZE9K9qRkT0r2pMSxTfTEnngc27FWV6KQ5MKSWBNboiRqoiV6Yk9MNUs1C7VZghlq0evWEkMtuto0MdTi5zZP7ImhFn3mj8SSGGrRD94SJVETLdETe+JY2ENtBJbEmtgSD7Ua+R6m8FyGDrRET+yJoRZn1HgklsRDrUZHHdODCyVREy3RE3viuDCKWy4siTWxJUqiJlqiJ/bEVCupVlKtpFoJtai2LaHWAzXREqPdo9ej3EWPxzcl6l0ulERNPFpoUfQb/hC1tFH0cuFYGMM/CmmjikXr/K+e2BPHQnkklsRIMg5TWqIkaqIlemJPHAtjoJ9YElNNU01TTVNNU01TTVMtBnqL+ugY0lFAHOUtF0qiJlqiJ/bEsTCG9IklMdTiN44hfaIkaqIlemJPHAtjSJ9YElOtp1pPtZ5qPdV6qvVU66k2Um2k2ki1kWoj1UaqjVQbqTZSbSw1fTwSS2JNbImSqImW6Ik9MdVKqpVUK6lWUq2kWkm1kmol1UqqlVSrqVZTraZaTbWaajXVaqrVVKupVlOtpVpLtZZqLdVaqrVUa6nWUq2lWks1STVJNUk1STVJNUk1STVJNUk1STVNNU01TTVNNU01TTVNNU01TTVNNUs1SzVLNUs1SzVLNUs1SzVLNUs1TzVPtfQSTS/R9BJNL9H0Ek0v0fQSTS/R9BJNL9H0Ek0v0fQSTS/R9BJNL9H0Ek0v0fQSTS/R9BJNL9H0Ek0v0fQSTS/R9JIoitJ4SyOqoi4siaHWA1uiJGqiJXpiTxwLp5dMLImpVlKtpFpJtZJqJdVKqpVUCy85KhNLFE3p8YrIE2tiS5RETbRET+yJY2F4yYmp1lKtpVpLtZZqLdXCNfS4NEftlMYiSxRP6VGMVaJm6voDS/TEnpiNhSmcWBJrYkuUxFTTVAtTiEWWKKC6cCwMUzixJNbEliiJmmiJqWapZqnmqeapFqZg0alhCidKYhxbvHgVpnCiJ4ZaHHGYwsQwhRNDLV7vClM4sSVKoiZaoif2xLEwTOHEVBupNlJtpNpItZFqI9VGqo2lFqVWF5bEmtgSJVETLdETe2KqlVQrqVZSraRaSbWSaiXVSqqVVCupVlOtplqYwvGWUYkKrAsPtXhlzedUwgJ74po2+5xKTCyJNbElSqImWmKqtVRrqSapJqkmqSapJqkmqSapJqkmqSappqmmqaappqmmqaappqmmqaapljcgbqlmqWapZqlmqWapZqlmqWapZqnmqeap5qnmqeap5qnmqeap5qnmqdZTradaT7Weaj3Veqr1VOup1lOtp9pItZFqI9VGqo1UG6k2Um2k2ki1sdT645FYEmtiS5RETbRET+yJqVZSraRaSbWSaiXVSqqVVCupVlKtpFpNtZpqNdVqqtVUq6lWUy29pKeX9PSSnl7S00t6eklPL+npJT29pKeX9PSSnl7S00t6eklPL+npJT29pKeX9PSSnl7S00t6eklPL+npJT29pKeX9PSSnl7S00t6eklPL+npJT29pKeX9PSSnl7S00t6eklPL+npJT29pKeX9PSSnl7S00t6eklPL+npJT29pKeX9PSSnl7S00t6eklPL+npJT29pKeX9PSSnl7S00t6eklPL+npJT29pKeX9PSSnl7S00t6eklPL+npJT29ZKSXjPSSkV4y0ktGeslILxnpJSO9ZKSXjPSSkV4y0ktGeslILxnpJSO9ZKSXjPSSkV4y0ktGeslILxnpJSO9ZKSXjPSSkV4y0ktGeklUC+pRMVmiXPDCklgTW6IkaqIlemJPTDVJNUk1STVJNUk1STVJNUk1SbXwkijBirLCC0tiTWyJkhhqEmiJntgTx8LwkhNLYqhpYEuURE20RE/siWNhWEWUl42wihM10RI9sSdGY8edcNQ3XlgSa2JLlERNtIXhBFEYEHWJGiv8UZh4YU8cJ9YoTbywJB45HO/a1ShNvFASNTHUNDDULLAnhprHhhKPxJJYE1uiJGpiqPVAT+yJY2GM4x47UMSAPHqnRrnheZgxsk7UREv0xJ441sHHyDqxJGb3xciavRMja3ZJjKwTbR1bjKwTe2J2n2b3aXafZvfFyJoHHyPrRE3M7ovhNHsnygXmdh4xAsbc0KMnjoVxNT2xJNbEI4cRjcUQOfHIYYRwDJETQy1+lhgiJ46FxxCx44WVGhWCJx4XNXtE/x4XtQs10Q6ce494Yk8cF0bVnx2ryjWq/p6PywJrYqj1QEnUREtcSUb53kwnyvcu1MSVZJTvXdgTM8maSdZMsmaSNZOsmWTNJGsmWTPJlkm2TLJlki2TbJlkyyRbJimZpGSSkklKJimZpGSSkklKJqmZpGaSmklqJqmZpGaSmklaJmmZpGWSlklaJmmZpGWSlkl6JumZpGeSnkl6JumZpGeSPZPsmWTPJHsm2TPJnkn2TDIHTsmBU3LglBw4JQdOyYFTcuCUHDg1B07NgVNz4NQcODUHTs2BU3Pg1Bw4c0+gSKfmGKo5hubOQDOHHEM1x1DNMTR3CJpJzjEUmeUYmvsEzRxyDNUcQzXH0Nwm6HhJoc6Ngk4cC9sj8ZAocUDHtO7CliiJh8RRulHn5kInemJPPNTK3M/okVgSD7WjFKLOrYZOlERNtERP7IljYWw8dGJJTDVNNU21GKY1frcYpid6Yk8cC2OYnlgSQ21u3dQSD7UWajFMT7RET+yJY+FxUbuwJNbElphqnmqeap5qnmqeaj3Veqr1VIvR3eKIY3SfGGeJBka7cVb3sXA8EktiTWyJR7sSZ1QM/xOPo5Do1Bj+J/bEcWGUw11YEmtiS5RETbRETwy1ETgWzq3DJh5qsedYlMNd2BIlURMt0RN74lgYVnFiqtVUq6lWU62mWk21cI3jxbsa5XB2LNPUKIc7MVzjxJJYE1uiJGqiJXpiqrVUk1STVJNUk1STVJNUk1STVJNUk1TTVNNU01TTVNNU01TTVNNU01QL14j95aIc7sI4J+MPwh+Ot6BqFL5daIme2BPHwvCHc8+3klgTW2KoxZka/nCiJXrioRa7p0Xh24nhD7EXWhS+XVgTW6IkaqIlHmpx5xOFbxZbq0WJm8U9Q5S4XdgSJVETLdETe+K4MErcLiyJNbElSqImhtoI9MSQODoqKtjsKNmtUcF2oSRqoiV64pF63ItEXduJMfxPLIlPNY8pSlS7XSiJmmgHhsQx/C/sB8ZRHMP/xGP4X1gSa2JLlERNtERPTLWWapJqkmqSasfw9xL9ewz/C0OtBR7txlwjyuFOPAb6hSWxJrbEaDfUjoF+oSV6Yk8cC+2RWBJrYktMNUs1S7XYwjBmK1Ekd+GhVuN3i40MTyyJRwsxL4kSN4/JSJS4XVgSa+KR2VF2WaPE7UJNtMTILAZD74lj4XgkHmotzr5jSF/YEiVREy3xUIsZSJS4XTgujBK3C0OtBdbEliiJmmiJntgTx8LySEy1kmol1UqoaaAmWqInhpoFjoX1kVgSa2JLDDUP1ERbGEP6KHepUavmR4FPjVq1CzXREo8k5RHYE8fCGLwnHknGrC1q1S5siZK4fu6oVbvQE3viWBhD+sSyfvkY0ie2REk81GTuQ2qJntgTx8IY0ifGscWPFUP6xJYoiaEWP0sM6RM9MY/N8tg8j81LYk1siXlssUvpiZboiXFs8cuHKUwMUzjxUNNoN0zhxJZ4qMXMMWrVLrRET+yJY2GYwoklsSa2xFQbqTZSbaTaSLWx1KJWzWNmHlVpfpR21Sgv85ifRXnZhSWxJrZESYx0LNASPbEnhtrRv1Fe5hrpxDg+8VCLuVyUl10oiZpoiZ7YEw81i4OPgX5iSayJcUCHKcQWXG7ROzEKLQ4zRuGJPXEsjFF4YkkMiTj4GIUnSqImhlr0TozCuW9vjMITDzWPY4tReGJJrIktURI18VCbOwLHKDyxJ46FMfTmxsIxhub+wTGGThwLYwydWBJr4pFZTAyjtOtCTbTEQy2e0Edp14VjYYyhEw+1eIQfpV0Xhlp0X4yhEzXREj2xJx5qIzZBjjF04qF2vC5Wo4jL4zl4FHFdaMf+yCXQE3viWHgMvQtLYk1siZKoialWUq2kWgm1o6OiiOvCUIsDqjWxJUYLcZgt/tYCa2JLlMTIzAMt0RN7YmQWfSaPxJJYE9vqX8lel+z1GLEnemJPPNTicV4UZl1YEmvicWzxOC8Ksy7UREv0xJ4YatHV9kgsiTUx1KLXTRI1MY/N8tgsjy1G7MS4bp5YEvPYvCVKoi7skWT88j2OrQf2xLFwPBJLYk0MtchhSKImWuKhFnP7KJXqMYuPUqmJUSrVY0IfpVIX1sSWKImaaImhJoE9cSyMsXliSDwC428tcCyMkXViSayJLVESNdESPTHVaqq1VIsxdLz3VaMg6cKSeOQQ06QoSLpQEjXREj2xJ46FMYZOLImppqkWY6hFT8YJHtP8qBbqMR2PaqEe0/GoC+ox245anx6T6aj1udASPfFI8tg6qEZVT495apTy9JhlRinPhZpoiZ7YE8fCONdPLIk1MdVGqo1UG6k2Um2k2lhqUcpzYUmsiS1REjXREj1xqUX9To9Jb9TvXFgTD4mY9Eb9zoWaeEjEk9Oo1Okx2YvynB6TvSjPubAlSqImWqIn9sSxMEbAianWUq2lWku1lmot1VqqtVRrqSapJqkmqSapJqkmqSapFheJmKdGlcyJcZE48ZCIT0BElUyPOWKUsPSYI0YJy4WeeLTrNXAsPCZlF5bEmtgSJVETLdETU62n2ki1GCIx74vtui5siaEWxxZD5EQ7sUXlSz9qZ1rUuPTjwWiLGpd+lHm0qHG50BKPJI+JYYsalwvHwjjtTyyJNbElhpoEaqIlemKoeeBYGFeGE0MtDijGxYktURI10RI9MdRG4FgY4+LEkhhqGtgSJfFQG9G/MS5O9IUxAkb0b5zrI444zvX4oEAUzFxoidFCHHxcRU4cC+MqcmJJrIktMdTi4GMmdqIlemL+Fpq/heVvYflbWP4Wlr+F5W9h+VtY/haWv4Xlb2H5W3j+Fp6/RczExsSn2oiPKkQhzoWaaAdGr8e3IE7siWNhfBHixJJYE0Mtzur4MsSJmmiJvjqqZ0/27MkY6PPgR/bkyJ4c2ZMje3JkT47sybgWzt4Z2ZNj9WRUAF0Yx6aBNbElxrF5oCbGDd5xTsa2XuMoF2ixrdeFNfFo7Hio3qIu6EJNPDrqmOa3qAu6sCeOhfERlxNLYk0MtRYoiZpoiXESRD/EB1uOu4MWJUIXSmK0EAcfH2450RMj3zji+HzLxPiAy4klsSa2REkMtcgsPuZyoif2xFCLHys+2FKjH+KTLSdaoif2xLEwPt5S44Di8y0nHvnWUItPuJx4qLX5zzTxUGvRv/HhlhYtxKdbTjzabXGY8fmWE1vi0e4xDW1RTnTh0a6ERAzeE4+jkFCLwTsxBu+Jh5pEuzF4NU65GLwaLcTg1ei+GLwaZ3UMXo184wNLE+MbSccDthaVOuOYYLSo1LlQE21hnHLHe4AtKmou7IljYXxL6MSSeKRuIRyn54mH8PFgqUVFzYWW6Ik9cSyM0/PEklgTW2KqSapJqkmqxekZ046oqDkxvjl0YkmsiS1REkOtB1piqB0/YdTOjB7CcdKeWBNboiRq4tFuWHHUzlzYE8fCOJXDPaN25sKa2BIPtREScSqfeKjFhTVqZy7siWNhnMonlsSa2BIlURNTradaT7WeaiPV4qMtj0ecwPHZlotDL/p9ftkoLnF1ftvo5A4ei9v8wtHJBTyb78ENLGAFG9jBHTyS55eQTi5g6BboFujO7yQdT3Jam19KOjl04wLW5teSTh7J80tIcV1q87tHcd1p88tHJ4/k+fWjkyPPuPa0+QWkkxtYwDNPCzawgzt46h5naZtfRDq5gCu4gQUcujX6JL6OdLGDOzh042ITtTKLC7iCG1jACjawgzsYugZdg65N3ehPa2ABK3jqarCDO3gk+wNcwFM3fhdvYAHPNg8HiiKZJ8f52Su4gQU8c47fqxvYwR0cObc4h8cDXMAVjHNj4Nw4v4E22cAO7uCxzpPza2gnF3AFh27MNc6vop2sYAM7uIPn8R6/6fnVtJMLuIKnrgYLWMF5vOd31U7u4ByD59fVTi5gHO/8xtrJAlbwPF4PdnAHz+ON9qe3HE/62vl9tZhYnV9YOznalzj26S0nR/sxPTu/tHbySJ7ecnIBV3ADT10LVrCBHdzBI3l6y8kFXMENDF2FrkJXoavQVegadA26Bl2DrkHXoGvQNegadA26Dl2HrkPXoevQdeg6dB26Dl2Hboduh26Hboduh26Hboduh26HbofugO6A7oDugO6A7oDugO6A7oDuSF19PMAFXMENLGAFG9jBHQzdAt0C3QLdAt0C3QLdAt0C3QLdAt0K3QrdCt0K3Qrd8/uPj2ADO3jqavBInnOhk0M3btf0/Brk5AYO3WPbmqbTr042sIM7eCRPvzq5gCu4gaEr0BXoTl+Ke8z5xb1H3GTOb+5dLGAFz3Z68Mx/BHfwSJ7+c3LkH/egOv3n5AYWsIIN7OAOHsnTf06GrkPXoevQdeg6dKfnHHUlTafnWPzW03NOLuAKbmABT60WbGAHd/BInp5zcgHP6370+fSTkx3cwXn9teknJxfwPBYNbmABK9jADu7gkTz95OQChm6BboFugW6BboFugW6BboVuhW6FboVuhW6FboVuhW6FboVug26DboNug26DboNug26DboNug65AV6Ar0BXoCnQFugJdga5AV6Cr0FXoKnQVugpdha5CV6Gr0FXoGnQNugZdg65B16Br0DXoGnQNug5dh65D16Hr0HXoOnQdug5dh26Hboduh26Hboduh26Hboduh+7pReEPpxdNLuB5b9KDo82jSq359JNj54Hm009OFrCCDezgyOdYcmw+/WTy9JOTC3jqWvDU9WABT90ebGAHd/BInn5ycgFP3RHcwAJW8NQ6+tmnD8T6qJ/fjY5jP78cPbmAK7iBBRxasbLpcyyf7OAOnrrRb3Msx9NHn2P55KkbxzvH8skCVrCBHdzBUzf6ZI7lkwu4gqdW9Nscg/Fs0OcYPLmCG1jACo484zGkzzF4cuQZi31RVVXig+MtNq5a3IKjD2OsXaxgC46+jbF2cQ+Ovo2xdnKMtYtDN57pRV1WiQ9+tyjMKvER7haVWSU+tN2iNKvEZ7Vb1GYdn6MJ9sVRW3V8kCZYwQaef2/BkWc8q4mqqsUFHLkd9UItqqmOD9MER/uxVBM1Uouj/XgeElVSJT7n3aJM6uL2ABdwBTewgKHboNsc3MEjWR7gqavBFTx1o3/OL7dPVrCBp64Hd/BInl92P7mAK7iBJfOZ33g/2cAO7uCRPL/2Hh7e5/feT5668fvOb76fLGAFh248V+nz2+8nd/BIjvF7cQFXcMt8XMAKNrCDO3jqxm/aH+ACruAGFrCC5/HGeT7Hb6wB9jl+Ty7g2X6cn3P8nixgBc/24zea4/fkDh6Lo+ZscQFX8GyzBzu4g0fyHO8nF3C0edSOtagzWyxgBRvYwR08kqeHnFzA0K3QrdCdnhP3v2N6zslT14I7eCRPD4nl1zG9Iu6Fx/SKk0fy9IqTZ54juIIbWMCRZ9xvjukVJzu4g0M37gHH9IqTCzh0j/KzNqZXnCxgBeN3Ufwuit9F8bsYfhfD72L4XQy/i+F3MZwPBl2DrkF3ekXMRcf0ipMLuIJb/tbTK07G+eA4H6ZXnNzBOB+mV5xcwJrnSce50XFuDJwb0wdOxrkxcG4MnBvTB07GuTFwbgycG9MHDpbHY50b8ngUcAWvc0MeDwEr2MBT14M7eCRPrzi5gCt46vZgASvYwFN3BHfwSJ5e4XHs0ytOruDQPdbv5TG94mQFG9izr6ZXnDySG/q5oZ8b+rmhnxv6uaGfG/p5eo5P7uCRPD3nuMeRx/Sckyt4Hm/04fSckxUcusd9hzym55zcwSN5es7JBVzBDSxgBUNXoavQnd7S47ebHtKjP6eH9OiH6SEnO7iDZ/568PSQkwu4ghtYwAo2sIM7GLodunP+3+O8nb4x4ninb0yevjHiPJy+cXLkOeK4pm+MaHP6xojfffrGiLE2feNkB3fwWFymb5xcwBV8/H097mskSvGOL/EFl2ANruAGFrCCLXmOx+M+VMocjyc7uINH8hyPJ4fWcd8kUUt3fHYv2MAO7uCRHGPt4gKOYzzuuSRq6hYL/ga6Al2BrkBXoKvQ1ZLtK3RjrNXjnk7KHF8efRjjqNY49rh2nxzX7oujzeNeT6LcbnEDC1jBBnZwT/bZZpwnPv97HIuP5P4AF3AFN/DMpwcr2MAODt0W52eMr9qir2J8XRy6LfokxtfFDSxgBRvYwVM3+mGMxbGh1+ICnsc4gsfqtzrHSBx7nWPkZAd3cPZtbMa1uKw+ie24FjewgHX1W9QSnn0VxYSL+zreKCe8uD3ABVzBDSxgzT6Z4/RkB2ff1jk2Z78d46tOP4zCwMUdPJKP8bW4gJ951ulpUR64WIIjz2OsLbbg+W8d3IMPL4oiweePEO1YBUf7JfrTBKzgaL/E8ZqDo/0SWsc17uLjGnds2xZcwBUcuuEbUTFYz/PNQ7fOdkJ3ng8eurOfPXTnueEjucffzN9lxL89nsNI1M4dW60FO7iDR3J5gAs48j/uuyVq5xZH/hJaRcGhK/PfOjh0j3tYia2njh3Wgis42j/uQSRq6hYrONo/7hckau0WR/saWnUktzguDd1WwBUcujFvjFq7Y4+14NC12U7oHs/YJWrtjg3VgkM35q5Ra3exzL+JPpEOHskxFmrMG6MubnEFR24eOczzLThqmY59tw6O366FP0TN0rHHVnAP1uCRXB/gAq7gBj76pB3PhSRqkBZbcGjFb3Fx6Mr8tyM5fot21AxI1CAdu2gFCzja1ziW6POLHRztx/kQNUgXS7Qf50PUIC2O49LQlQYWcOjGfVzUIB27awWHrs12Qjfuj6IG6dhK6+D4HVucG1GDtDj+Js6HqAs69sUKjhxivh11QYsVbGAHd/BIDv+5uIArGLoOXYeuQ9eh69B16PbZTvR/n+1EX/XZTpyr3cEdPJLHA1zAFdzAAlYwdAd0B3RH6kadz+ICruCpNYIVHO0f62Wi0z+jT6KW5tgCMTjGdfSPTq+L+yOdnjPbn55zsoIN7OAODk+I+5SoaVkcunHPEjUti0M37imipmVx6B7rL6LzPH/MdkbyPM8fcSzzPD+5guM3imtx1Losjn57hFZcuy+OPnyErnbwSLbQjetv1Locex4Gh27M1XWOqRr9P8dUXGd1jqmYe+scU5Pn+R/XX53nWFx/dZ5jJwtYF8/6hOl1s2agHc+ZZdYMTK+bNQPT62ZtQItr36wNuLiCW/AIFrCCDezgDh7J+gAXcAVDV6Gr0I37munPc61/euZc67842onr6Vzrv1jBBnZwB0f+Flrx3ODiAq7gBhawgg3s4A6Gboduh26Hboduh26Hboduh26HbofumLpxXo0Cnrpxjo0GFvDUPc7n2Grl+OpxcAXPfzuCBaxgAzu4g0dyeYALuIKhW6BboFugW6BboFugW6FboVuhW6FbPfunteyTJmAFG9jBHRz5xLV+1gxcXMAVHLoxb5w1A3NuMGsGLkY/CPpB0A+CflD0g6IfFP0wx3hcp2bNwMUKNnDPvjL0j6F/DP1j6B9D/5xjOdjRP47+cfTPHMsnS/aVo3/mWD4Z/ePoH0f/dPRPR/909E/HedLRPx3909E/cyyfPLKvBvpnoH8G+megf0b2T+zRsjj7pz8quIEFrKuvZi3B7J9ZS3Bx9k/H+O0Yvx3jt2P8dozfjvHbS/ZPLwZ2cE8+x6wEZ//06uAORv809E8rYPRPQ/809M8c1ydb9lVD/8xxfTL6R9A/gv4R9I+gfwT9IwpG/wj6R9A/c1xPPsdy9JWifxT9o+gfQ/8Y+scqGP1j6B9D/8xxfbJnXxn6Z47ryY7+cfSPo38c/ePoH0f/uIHRP47+cfTPHNcn1+yrjv7p6J+B/hnon4H+GQ2M/hnon4H+meP65J59NbJ/Zm3Axdk/41HBDSxgBRvYwdk/s37g5PIAF3BbfTVK9s+oD3ABV3ADCzj7Z677X+zgDh6rr0ZD/8xxfTL6p6F/GvqnoX8a+qehf1oHo38E/SPon/N6PXmeA9FX5zV6soEdPI9Rg0fyvEafXMBTK/rwvEZPFrCCp24cy/SEk3vyHL89+nCO35M7eCTP8XtyAUdusaYz1/cvjtzi3nOu719sYAd38Eie4/fkAo42Yz1uzGvuyQ7u4JE8x/jJ0WY8W57r/hfHscQ971z3v/jQlcf8twb24Oe5qnN9X477WZ3r+xfXYAtuYAHP9nuwgaP947m0zvX9i0dw6MZYvriAQ7dE+zGu5Vif0rm+LzXaiWu0HGtDOtf35bjn1bm+LzXyj2v0yXX+jR8ss53IUxRsYE+Oa1B8N03nOvLFFdzAElyDNTjyjHP4Ygf34Mg/zuGT/QEu4ApuYAEr2MAOhq5Dt0O3z/ajD/v8+/hd+kgeD3ABzzyjz0cDC1jBBnbw1I3fYozFc3354gKu4AYWsCbP8+1Yd9C5vnyxgBVsYAd38EiOa9DFBQzdCt0K3QrdCt0K3QrdCt0G3TZ1S/DUrcENLGAFG9jBHTyS5QEuYOjK1JVgASvYwA7u4JGsD3ABVzB0FboKXYWuQlehq9A16Bp0DboGXYOuQdega9A16Bp0HboOXYeuQ9eh69B16Dp0HboO3Q7dDt0O3Q7dDt0O3Q7dDt0O3Q7dAd0B3QHdAd0B3QHdAd0B3QHdkbpznf3iAq7gBhawgg3s4A6GboFugW6BboFugW6BboFugW6BboFuhW6FboVuhW6FboVuhW6FboVuhW6DboNug26DboNug26DboNug26DrkBXoCvQhV9V+FWFX1X4VYVfVfhVhV9V+FWFX1X4VYVfVfhVhV9V+FWFX1X4VYVfVfhVhV9V+FWFX1X4VYVfVfhVhV9V+FWFX1X4VYVfVfhVhV9V+FWFX1X4VYVfVfhVhV9V+FWFX1X4VYVfVfhVhV9V+FWFX1X4VYVfVfhVhV9V+FWFX1X4VYVfVfhVhV9V+FWFXzX4VYNfNfhVg181+FWDXzX4VYNfNfhVg181+FWDXzX4VYNfNfhVg181+FWDXzX4VYNfNfhVg181+FWDXzX4VYNfNfhVg181+FWDXzX4VYNfNfhVg181+FWDXzX4VYNfNfhVg181+FWDX7XTr3pwAwt46rZgAzs4dI9aCJ37HcmxJqhzvyOR+JvpVxK6069ObmABK9jADp66FjySp1+dXMAV3MACVrCBHQxdg65D16Hr0HXoOnQdug5dh65D16Hboduh26Hboduh26Hboduh26HboTugO6A7oDugO6A7oDugO6A7oDtSd+6VdHEBV3ADC1jBBnZwB0O3QLdAt0C3QLdAt0C3QLdAt0C3QLdCt0K3QrdCt0K3QrdCt0K3QrdCt0G3QbdBt0G3QbdBt0G3QbdBt0FXoCvQFegKdAW6Al2BrkBXoCvQVegqdBW6Cl2FrkJXoavQhV8J/ErgVwK/EviVwK8EfiXwKzn9yoMd3MEj+fSryQVcwQ0sYAVD16Hr0HXoduh26Hboduh26Hboduh26HbodugO6A7oDugO6A7oDugO6A7oDuiO1NXHA1zAFdzAAlawgR3cwdAt0C3QLdAt0C3QLdAt0C3QLdAt0K3QrdCt0K3QrdCt0K3QrdCt0K3QbdBt0G3QbdBt0G3QbdBt0G3QbdAV6Ap0BboCXYGuQFegK9AV6Ap0FboKXYWuQlehq9BV6Cp0FboKXYOuQdega9A16Bp04VcKv1L4lcKvFH6l8CuFXyn8SuFXCr9S+JXCrxR+pfArhV8p/ErhVwq/UviVwq8UfqXwK4VfKfxK4VcKv1L4lcKvFH6l8CuFXyn8SuFXCr8y+JXBrwx+ZfArg18Z/MrgVwa/MviVwa8MfmXwK4NfGfzK4FcGvzL4lcGvDH5l8CuDXxn8yuBXBr8y+JXBrwx+ZfArg18Z/MrgVwa/MviVwa8MfmXwK4NfGfzK4FcGvzL4lcGvDH5l8CuDXxn8yuBXBr8y+JXBrwx+ZfArg18Z/MrgVwa/MviVwa8MfmXwK4NfGfzK4FcGvzL4lcGvDH5l8CuDXxn8yuBXBr8y+JXBrwx+ZfArg18Z/MrgVwa/MviVnX7Vgiu4gQWsYAM7uINH8niAoTuge/rVCBawgg3s4L541nbKUYurs7bz4gaO9o93anTWdl5s4Gj/qN3VWdt58Uie3nK8R6OzPvNiB89/24NH8vSWk0u2Ob3l5AaONo/3LNSnb5w8kqdvnFzAFdzAAlawgaHboNugK9AV6E7fsOiH6RsnC1jBBnZwB0/d6LfpGydP3TgHpm+c/72BBaxgAzs4dD3Omekbk6dvxBr93A/q+u8V3MACVrCB0c+Gfp6+ETUAs0b0/O+Ofnb8vo7f1/H7On5fRz87+tnRz9M3Jk/fOLmA8ftO34g6hFkjevE8Xgk2/HcHd/BInr5xcgHPfo5xMX3jZAEr2MAO7uCpexzLrDW9eP5NDx7Jc05ycgFXcAMLWMEGjtyOd2R01oVePJKnb5xcwBXcwAJWsIGhW6Fbodug26DboNug26DboNug26DboNugK9AV6Ap0BboCXYGuQFegK9AV6Cp0FboKXYWuQlehq9BV6Cp0FboGXYOuQdega9A16Bp0DboGXYOuQ9eh69B16Dp0HboOXYeuQ9eh26Hboduh26Hboduh26Hboduh26E7oDugO6A7oDugO6A7oDugO6A7UnfWu15cwBXcwAJWsIEd3MHQLdAt0C3QLdAt0C3QLdCFXw341YBfDfjVgF8N+NWAXw341YBfDfjVgF8N+NWAXw341YBfDfjVgF8N+NWAXw341YBfDfjVgF8N+NWAXw341YBfDfjVgF8N+NWAXw341YBfDfjVgF8N+NWAXw341YBfDfjVgF8N+NWAXw341YBfDfjVgF8N+NWAXw341YBfDfjVgF8N+NWAXw341YBfDfjVgF8N+NWAXw341YBfDfjVgF8N+NWAXw341YBfDfjVgF8N+NWAXw341YBfDfjVgF8N+NWAXw341YBfDfjVSL+yR/qVPdKv7JF+ZY/0K3ukX9kj/coe6Vf2SL+yR/qVPR7QLdAt0C3QLdAt0C3QLdAt0C3QLdCt0K3QrdCt0K3QrdCt0K3QrdCt0G3QbdBt0G3QPf1KghVsyacXWXABV3C0ebwTbWc988kKNrCDO3gkTy86uYArGLoKXYWuQlehO71oxDFOL5o8vejkAq7gBhbw1NVgS56+MaKv5tg/6uHtMcf+yRU8/+0IjtrjR7Q/a55PHsmz5vnkAq7gBhawgg0M3QHdkbpnzfNRe29nzfPJFdzAAlawgaeuB3dw6B7vp9vcm+viAq7gBhawgg3s4A6GboVuhW6duhrcwAJWsIEd3MFTN/qkPcCzn3twBTfw1B3BCjawgzt4JMsDXMAV3MDQFegKdGNc67FvgM36Zz3eobBZ/3yxguPfHvsJ2Kxz1hp9Pt9rOFnBBp7PD+NcPZ+XTi7gtQ5uJetnrGT9jM36ZK1xHs73F0725HzmaSWfeVrJZ55Wco3GSq7RWMk1Gps1xmebc1yfXMCRT4v+mWP2ZF88a4D12FvGZg2wHnv52qwBvtjADu7gkTzH3ckFXMENDN0C3QLdOe6if2YN8MUjeY67kwu4ght46kqwJs/zX6JP5vl/cgeP5Hn+n1zAFdzAAlYwdGXqenAHj+Q5Rk4u4ApuYAEr2MDQVegqdA26Bl2DrkHXoGvQNegadA26Bl2HrkPXoevQdeg6dB26Dl2HrkO3Q7dDt0O3Q7dDt0O3Q7dDt0O3Q3dAd0B3QHdAd0B3QHdAd0B3QHek7qzFvbiAK7iBBaxgAzu4g6FboFugW6BboFugW6BboFugW6BboFuhW6FboVuhW6FboVuhW6FboVuh26DboNug26DboNug26DboNug26Ar0BXoCnQFugJdga5AF37V4FcNftXgVw1+1eBXDX7V4FcNftXgVw1+1eBXDX7V4FcNftXgVw1+1eBXDX7V4FcNftXgVw1+1eBXDX7V4FcNftXgVw1+1eBXDX7V4FcNftXgVw1+1eBXDX7V4FcNftXgVw1+1eBXDX7V4FcNftXgVw1+1eBXDX7V4FcNftXgVw1+JfArgV8J/ErgVwK/EviVwK8EfiXwK4FfCfxK4FcCvxL4lcCvBH4l8CuBXwn8SuBXAr8S+JXArwR+JfArgV8J/ErgVwK/EviVwK8EfiXwK4FfCfxK4FcCvxL4lcCvBH4l8CuBXwn8SuBXAr8S+JXArwR+JfArgV8J/ErgVwK/EviVwK8EfiXwK4FfCfxK4FcCvxL4lcCvBH4l8CuBXwn8SuBXAr8S+JXArwR+JfArgV8J/ErgVwK/EviVwK8EfiXwK4FfCfxK4FcCvxL41azF1WNfSpu1uBf35OlFxx6VNutsLxZwtHl8R9Jmna0ee1farLO9eLZpwWPxrLO9uIAruIEFrGADO7iDoVugW6BboFugW6BboFugW6BboFugW6FboTu96KhLsVlne7GANbnlM65Z+6pHvYrN2teLO3gkT384uYAruIEFrGDoCnQFugJdha5CV6Gr0FXoKnQVugpdha5C16Br0DXoGnQNugZdg65B16Br0HXoOnQdug5dh65D16Hr0HXoOnQ7dDt0O3Q7dDt0O3Q7dDt0O3Q7dAd0B3QHdAd0B3QHdAd0B3QHdEfq2uMBLuAKbmABK9jADu5g6BboFugW6BboFugW6BboFugW6BboVuhW6FboVuhW6FboVuhW6FboVug26DboNug26DboNujCrwx+ZfArg18Z/MrgVwa/MviVwa8MfmXwK4NfGfzK4FcGvzL4lcGvDH5l8CuDXxn8yuBXBr8y+JXBrwx+ZfArg18Z/MrgVwa/MviVwa8MfmXwK4NfGfzK4FcGvzL4lcGvDH5l8CuDXxn8yuBXBr8y+JXBrwx+ZfArg18Z/MrgVwa/MviVwa8MfmXwK4NfGfzK4FcGvzL4lcOvHH7l8CuHXzn8yuFXDr9y+JXDrxx+5fArh185/MrhVw6/cviVw68cfuXwK4dfOfzK4VcOv3L4lcOvHH7l8CuHXzn8yuFXDr9y+JXDrxx+5fArh185/MrhVw6/cviVw68cfuXwq1lzq8feuTZrbi9WsIEd3MEjefrVyQVcwdBV6Cp0FboKXYWuQtega9A16Bp0DbrTr469gm3W3F7s4A4eydOvTp66Gjzb8eDZTvT59J+TZzvH2tmsob24gCu4gQWs4ND1OK7pPyd38EiennPsgWx+7nl1tNPPPa8mF3AFN7CAFWxgB3cwdAt0pz8c+8DbrJu9uIEFrGADe/L0gaiRmPWxF1fwbL8FC1jBBnZwB4/k6QMnF3AFQ7dBt0G3QbdBt0G3QVegK9AV6Ap0BboCXYGuQFegK9BV6Cp0FboKXYWuQlehq9BV6Cp0DboGXYOuQdega9A16Bp0DboGXYeuQ9eh69B16Dp0HboOXYeuQ7dDt0O3Q7dDt0O3Q7dDt0O3Q7dDd0B3QHdAd0B3QHdAd0B3QHdAd6TurI+9uIAruIEFrGADO7iDoVugW6BboFugW6BboFugW6BboFugW6FboVuhC78a8KsBvxrwqwG/GvCrAb8a8KsBvxrwqwG/GvCrAb8a8KsBvxrwqwG/GvCrAb8a8KsBvxrwqwG/GvCrAb8a8KsBvxrwqwG/GvCrAb8a8KsBvxrwqwG/GvCrAb8a8KsBvxrwqwG/GvCrAb8ap195sIN78ulRI7iAKzi0RgkWsIJDK+riZu2rRv3brH3VeB44a18vjvaj5m3Wvp4cPmBHDZjPelE7apx81oteLOD59yP4yMGOvV591ote3INL8EiO8Xtx/P0j/j7G3cUjOcbU82lJsIAVbGAHd/BIbg9wAVcwdBt0G3Rl/tvoN6ngBp7/NvpKFGxgB3fwSNYHuIAruIGhq9BV6Cp0FboKXYOuQdega9A16Bp0Y1xYjd80xsXFHTySY4xcXMAV3MACVjB0HboOXYduh26Hboduh26Hboduh26Hboduh+6A7oDugO6YujF2hoAVbOCp24Knbpy3Yyye9aUXF/D0qxI8ks/r7+T59xZcwQ0sYAUb2MEdPJLrAwzdCt0K3QrdCt0K3QrdCt0K3QbdBt0G3QbdBt0G3QbdBt0G3QZdga5AV6Ar0BXoCnQFugJdga5AV6Gr0FXoKnQVugpdha5CV6Gr0DXoGnQNugZdg65B16Br0DXoGnQdug5dh65D16Hr0HXoOnQdug7dDt0O3Q7dDt0O3Q7dDt0O3Q7dDt0B3QHdAd0B3QHdAd0B3QHdAd2RuvXxABdwBTewgBVsYAd3MHQLdOFXFX5V4VcVflXhVxV+VeFXFX5V4VcVflXhVxV+VeFXFX5V4VcVflXhVxV+VeFXFX5V4VcVflXhVxV+VeFXFX5V4VcVflXhVxV+VeFXFX5V4VcVflXhVxV+VeFXFX5V4VezjteOemyfdbwXV3BoHfuQ+6zdvdjAoXXsh+mzdteOum6ftbsnT486uYCnVg+OY2wjOHSPGmyftbsm0f70qJNDV2Y7oXvUY/is3T15epREm9OjNNqcHnVytK9xLNOLZm7Ti07GcU3P0chhestRs+Gz5tZ0/o2BHdzBI3l6y8kFXMHz38ZvN/0heNbNXjz/rQdXcAMLWMEGdnAHj+TpDydDt0C3QLdAt0C3QLdAt0C3QLdCt0K3QrdCt0K3QrdCt0K3QrdCt0G3QbdBt0G3QbdBt0G3QbdBt0FXoCvQFegKdAW6Al2BrkBXoCvQVegqdBW6Cl2FrkJXoavQVegqdA26Bl2DrkHXoGvQNegadA26Bl2HrkPXoevQdeg6dB26Dl2HrkO3Q7dDt0O3Q7dDt0O3Q7dDt0O3Q3dAd0B3QHdAd0B3QHdAd0B3QHekrjwe4AKu4AYWsIIN7OAOhi78SuBXAr8S+JXArwR+JfArgV8J/ErgVwK/EviVwK8EfiXwK4FfCfxK4FcCvxL4lcCvBH4l8CuBXwn8SuBXAr8S+JXArwR+JfArgV8J/ErgVwK/EviVwK8EfiXwK4FfCfxK4FcCvxL4lcCvBH4l8CuBXwn8SuBXAr8S+JXArwR+JfArgV8J/ErgVwK/EviVwK8EfiXwK4FfCfxK4FcCvxL4lcCvBH4l8CuBXwn8SuBXAr8S+JXArwR+JfArgV8J/ErgVwK/EviVwK8EfiXwK4FfCfxK4FcKv1L4lcKvFH6l8CuFXyn8SuFXCr9S+JXCrxR+pfArhV8p/ErhVwq/UviVwq8UfqXwK4VfKfxK4VcKv1L4lcKvFH6l8CuFXyn8SuFXCr9S+JXCrxR+pfArhV8p/ErhVwq/UviVwq8UfqXwK4VfKfxK4VcKv1L4lcKvFH6l8CuFXyn8SuFXCr9S+JXCrxR+pfArhV8p/ErhVwq/UviVwq8UfjXreO2oS/FZx3vy9KuTQ+uoOfFZu3uxgPMeSt3BHTzbP+6/Zr3uxQVcwQ0sYAUb2MEdDN0B3QHdAd0B3QHdAd0B3QHdAd2RurNe9+ICruAGFrCCDezgDoZugW6BboFugW6BboFugW6BboFugW6FboVuhW6FboVuhW6FboVuhW6FboNug26DboNug26DboNug26DboOuQFegK9AV6Ap0BboCXYGuQFegq9BV6Cp0FboKXYWuQlehq9BV6Bp0DboGXYOuQdega9A16Bp0DboOXYeuQ9eh69B16Dp0HboOXfiVwa8MfmXwK4NfGfzK4FcGvzL4lcGvDH5l8CuDXxn8yuBXBr8y+JXBrwx+ZfArg185/MrhVw6/cviVw68cfuXwK4dfOfzK4VcOv3L4lcOvHH7l8CuHXzn8yuFXDr9y+JXDrxx+5fArh185/MrhVw6/cviVw68cfuXwK4dfOfzK4VcOv3L4lcOvHH7l8CuHXzn8yuFXDr9y+JXDrxx+5fArh185/MrhVw6/cviVw68cfuXwK4dfOfzK4VcOv3L4lcOvHH7l8CuHXzn8yuFXDr9y+JXDrxx+5fArh185/MrhVw6/cviVw68cfuXwK4dfOfzK4VcOv3L4lcOvHH7l8CuHXzn8yuFXDr9y+JXDrxx+5fArh185/MrhVw6/cvhVh191+FWHX3X4VYdfdfhVh191+FWHX3X4VYdfdfhVh191+FWHX3X4VYdfdfhVh191+FWHX3X4VYdfdfhVh191+FWHX3X4VYdfdfhVh191+FWHX3X4VYdfdfhVh191+FWHX3X4VYdfdfhVP/2qBzewgOe9SQt2cAeP5PNeb3IBV3ADC1jB0FXoKnQVugZdg65B16Br0DXoGnQNugZdg65D16Hr0HXoOnQdug5dh65D16HboYt1ut6h26Hboduh26Hboduh26E7oDugO6A7oDugO6A7oDugO6A7Unc8HuACruAGFrCCDezgDoZugW6BboFugW6BboFugW6BboFugW6FboVuhW6FboVuhW6FboVuhW7N9etZS3xxAYfusXe9z1riiwUcuj7/Pto/9l33WTN88vSik6P94/0RnzXDF0f7UT82a4YvVnAcV4/8py+d3MEjefrSyQVcwQ0sYAVDV6Gr0FXoGnQNutOXjr09fdYMXyxgBRvYwR08kqcvnVzA0HXoOnQdug5dh65D16Hboduh26Hboduh26HboTt9qcd5NX3p5JE8fenkqRvn2PSl3oMbWMAKjjbH89ldn/vlXlzAFdzAAlawgR3cwdAt0C3QLdAt0C3QLdAt0C3QLdAt0K3QrdCt0K3Qnf5w1Jn3sy765AaeubVgBRvYwR08kqdvnFzAFdzA0BXoCnQFugJdga5CV6Gr0FXoKnQVugpdha5CV6Fr0DXoGnQNugZdg65B16Br0DXoOnQdug5dh65D16Hr0HXoOnQduh26Hboduh26Hboduh26Hboduh26A7oDugO6A7oDugO6A7oDugO6I3XPmuqTC7iCG1jACjawgzsYugW6BboFugW6BboFugW6BboFugW6FboVuhW6FboVuhW6FboVuhW6FboNug26DboNuvCrAr8q8KsCvyrwqwK/KvCrAr8q8KsCvyrwqwK/KvCrAr8q8KsCvyrwqwK/KvCrAr8q8KsCvyrwqwK/KvCrAr8q8KsCvyrwqwK/KvCrAr8q8KsCvyrwqwK/KvCrAr8q8KsCvyrwqwK/KvCrAr8q8KsCvyrwq7M2+3h/qp+12Sc38NQawQZ28NTqwSP59KjJh9bzqXJwDdbgBhawgg3s4A4ei2c99sUFXMENLGAFG9jBHQzdAt0C3QLdAt0C3QLdAt0C3QLdAt0K3Tp1PbiCG1jAU7cHT90R7OCeHF7kx3twfdZXP5/SByvYwA6Odo49z/usr/bjXbM+66v92J+8z/rqiyu4gQWsYAM7uINHskJXp270iVZwAwtYwQZ2cAePZHuAoWvQNeja1I3f1xRsYAd38Ej2B7iAK7iBoevQ9akb54w7uINHcn+AC7iCG1jACoZun+3HOTn95HgvrM99j73G+Tb95GQFGzjyr3FOTj85eSye9dsXF3AFN7CAFTx1JXjqanAHT93juGb99sUFHLpH/X+f9dsXCzh0j/r/Puu3L3ZwB4/k6ScnF3AFN7CAoVuhW6FboVuh26DboNug26DboDv9p0XfTv9pFuzgDh7J039OLuAKbmABKxi6Al2BrkBXoavQVegqdBW6Cl2FrkJXoavQNegadA26Bl2DrkHXoGvQNegadB26Dl2HrkPXoevQnf5zvJPSZ/32xaElcf5Pzzk5tCTOk+k5JzewgBVs4NCSGMsx57l4JI8HuIAruIEFrGADp+6szfbjnZo+a7MvruAGFrCCZ/sW7OAOHsnTi04u4Aqeuh4sYAUb2MEdPJKnF508nxXXYAUb2MEdPJLPOsbJBVzBDQzdBt0G3QbdBt0GXYGuQFegK9AV6Ap0BboCXYGuQFehq9BV6Cp0FboKXYWuQlehq9A16Bp0DboGXYOuQdega9A16Bp0HboOXYeuQ9eh69B16Dp0HboO3Q7dDt0O3Q7dDt0O3Q7dDt0O3Q7dAd0B3QHdAd0B3QHdAd0B3QHdkbpX3fXkAq7gBhawgg3s4A6GboFugW6BboFugW6BboFugW6BboFuhW5da0z9rLs+uYHXGlM/665PNnB43fGeY5/11ReHxx7rXH3WV18cHqvR/pz/nBwee9T39llffbGDw2OPffn6rK8+ec5/Ti7gCm5gASt46o5gB3fwSJ7zH4vjnfMfiz6Z85+TG1iS57zlqAfosy764gYWsIIN7OAOHslz3nIydB26Dl2HrkPXoevQdeg6dDt0O3TnvMLid5/zipMbeOYQv/ucV5xsYAd38Fg8a5gvLuAKbmABK9jADu5g6BboFugW6BboFugW6BboFugW6BboVuhW6FboVuhW6FboVuhW6FboVug26DboNug26DboNug26DboNug26Ap0BboCXYGuQFegK9AV6Ap0BboKXYWuQlehq9BV6Cp0FboKXYWuQdega9A16Bp0DboGXYOuQdeg69B16Dp0HboOXYeuQ9eh69B16Hboduh26Hboduh26Hboduh26HboDugO6A7oDujCrwx+ZfArg18Z/MrgVw6/cviVw68cfuXwK4dfOfzK4VcOv3L4lcOvHH7l8CuHXzn8yuFXDr9y+JXDrxx+5fArh185/MrhVw6/cviVw68cfuXwK4dfOfzK4VcOv3L4lcOvHH7l8CuHXzn8yuFXDr9y+JXDrxx+5fArh185/MrhVw6/cviVw68cfuXwK4dfOfxq1jC7l2ADOzi0/Jjjzbrliws4tFyCG1jAU2sEG9jBcYw9dKdHTZ4edXIBV3ADC1jBBnYwdB26Hboduh26HbrTo3r0yfSoo36mz7rlix3cwSN5etTJBVzBDSxg6A7oDugO6I7UnXXLFxdwBTewgBVsYAd3MHQLdAt0C3QLdAt0C3SnRx17OfZZt3xxB4/k6VEnF3AFN7CAFQzdCt0K3Qrd6UVR8zPrkD1qe2Yd8sXRzvFN5z7rkK//PpKn55xcwBXcwJH/sXdln/sbX2xgB3fwSJ6ec/LUjf6fnnPyodsfcYzhORcr2IJbsAf34A4eyeE/FxdwBTdw6Maa4KxJvtjwN9A16Bp0HboOXYdu+M/ZvkPXFX8DXYeuQ9eh26HboRv+c7bfodsFfwPdDt0O3Q7dDt0B3fCfs/0B3YF+HtAd0B3QHdAd0B2pO2uSZ/uzJvniir9pYAEr2MAO7uCR7RfoluznWZN8MXQLdAt0C3QLdMN/rvahW7OfZ03yxdCt0K3QrdCt0A3/udqHbkU/N+g26DboNug26Dbohl+d7TfoNvRzg65AV6Ar0BXoCnQlx++sVb4Y/SzQFegqdBW6Cl2Frub4nbXKF6Of4VcDfjXgVwN+NeBXA341a5XP9uFXs1b5+hvowq8G/GrArwb8asCvZq3y2T78apx+VYNn37ZgB89zSYLnOXz4/KxPvriAK7iBBaxg6HboTo86eSRPjzq5gKeuBTfw1PVgBRvYwVM3+m161MHjcXrU5AKu4AYWsF75jFnDfLGDO3gknx41eeqO4AoO3WPf2jFrmC9WsIFD96hPGLOG+eKRPD3q5AKu4AaWzGd61MkGdnAHj+TpUUd9wph10RdXcAMLWMEGnsdbD55rXi3++1zzOrmCG1jACjawgzt4JCt0FboKXYWuQlehq9BV6Cp0FboGXYOuQdega9A16Bp0DboGXYOuQ9eh69B16Dp0HboOXYeuQ9eh26Hboduh26Hboduh26Hboduh26E7oDugO6A7oDugO6A7oDugO6A7Uvesfz65gCu4gQWsYAM7uIOhW6BboFugW6BboFugW6BboFugW6BboZtrXqPkmtcoueY1Sq55jZJrXqPkmtc465+PWp1x1j+fPJJP/5ncwNN/Quv0n8nTfyzYwdNve/BInnOkk6fvjeAKbmABK9jADu7g0D3qssasc764gCs4dFv01Zwjzf6fc6STDezJc24zf4s5tznZwA7u4JE85zYnF3AFNzB0HboOXYeuQ9eh26Hboduh26HboTvnHi1+9zn3ONnAM4f43efc4+SxeNYPX1zAFdzAAlawgR3cwdAt0C3QLdAt0C3QLdAt0C3QLdAt0K3QrdCt0K3QrdCt0K3QrdCt0K3QbdBt0G3QbdBt0G3QbdBt0G3QbdAV6Ap0BboCXYGuQFegK9AV6Ap0FboKXYWuQlehq9BV6Cp0FboKXYOuQdega9A16Bp0DboGXYOuQdeh69B16Dp0HboOXYeuQ9eh69Dt0O3Q7dDt0O3Q7dDt0O3Q7dDt0B3QHdAd0B3QHdAd0B3QhV9V+FWFXzX4VYNfNfhVg181+FWDXzX4VYNfNfhVg181+FWDXzX4VYNfNfhVg181+FWDXzX4VYNfNfhVg181+FWDXzX4VYNfNfhVg181+FWDXzX4VYNfNfhVg181+FWDXzX4VYNfNfhVg181+FWDX8365H7Upo5Zn3yxgENLJNjBHRxaR13omDXJFxfw1LLgBhawgg3s4A4eydOjTi5g6Bp0DboGXYOuQdegOz3qqCkds/b4+QQ+eLY/ggWsYAM7uINH8vSikws4dI9arzHrkC8WsIIN7OAOHsnTi04uYOgO6A7oDugO6A7oDuiO1J31yRcXcAU3sIAVbGAHdzB0C3QLdAt0C3QLdAt0C3QLdAt0C3QrdCt0K3QrdCt0K3QrdCt0K3QrdBt0G3QbdBt0G3QbdBt0G3QbdBt0BboCXYGuQFegK9AV6Ap0BboCXYWuQlehq9BV6Cp0FboKXYWuQtega9A16Bp0DboGXYOuQdega9B16Dp0HboOXYeuQ9eh69B16Dp0O3Q7dOFXAr8S+JXArwR+JfArgV8J/ErgVwK/EviVwK8EfiXwK4FfCfxK4FcCv1L4lcKvFH6l8CuFXyn8SuFXCr9S+JXCrxR+pfArhV8p/ErhVwq/UviVwq8UfqXwK4VfKfxK4VcKv1L4lcKvFH6l8CuFX+npV8f8QU+/mlzAU8uCBaxgAzu4g0fy6VGTC3geYw9uYAEr2MAO7uCRfHrU5AKGrkJXoavQVegqdBW6Cl2DrkHXoGvQNegadA26Bl2DrkHXoevQdeg6dB26Dl2HrkPXoevQ7dDt0O3Q7dDt0O3Q7dDt0O3Q7dAd0B3QHdAd0B3QHdAd0B3QHdAdqWuPB7iAK7iBBaxgAzu4g6FboFugW6BboFugW6BboFugW6BboFuhW6FboVuhW6FboVuhW6FboVuh26DboNug26DboNug26DboNug26Ar0BXowq8MfmXwK4NfGfzK4FcGvzL4lcGvDH5l8CuDXxn8yuBXBr8y+JXBrwx+ZfArg18Z/MrgVwa/MviVwa8MfmXwK4NfGfzK4FcGvzL4lcGvDH5l8CuDXxn8yuBXBr8y+JXBrwx+ZfArg18Z/MrgVwa/MviVwa8MfmXwK4NfGfzK4FcGvzL4lcGvDH7l8CuHXzn8yuFXDr9y+JXDrxx+5fArh185/MrhVw6/cviVw68cfuXwK4dfOfzK4VcOv3L4lcOvHH7l8CuHXzn8yuFXDr9y+JXDrxx+5fArh185/MrhVw6/cviVw68cfuXwK4dfOfzK4VcOv3L4lcOvHH7l8CuHXzn8yuFXDr9y+JXDrxx+5fArh185/MrhVw6/cviVw68cfuXwK4dfOfxq1mP34122MeuxLx7Jp0c9giu4gUPrqCEfswa7H7XiY9ZgX+zgDh7J06NOLuAKbmABQ7dDt0O3Q7dDd0B3etFRxz5m7fTFY/Gsnb545mnBFdzAAlawgR3cwSN5esvJ0C3QLdAt0C3Qnd5y7CM6Zu30xR08z4HjOeGsnb64gKduD25gAYdufwQb2MEdPJKnt5xcwBXcwAKGboNug26DboOuQFegK9AV6Ap0BboCXYGuQFegq9BV6Cp0FboKXYWuQlehq9BV6Bp0DboGXYOuQdegO72l12AHT2+J8RJ+8lwhPbhPjvMkxniVaCfGeD2+6zpmPXM99p0Ys5754g4ewdF+jOWLC7iCG1jACjawgzs4dWc988UFPNvU4Pi34ZmzJvnkGNcXF3AFN7CAFWxgB0O3QLdCt07dGlzBU7cFC1iT22wnjrfNv4/jbQJWsIFnnhbcwSNZHuCZZw+u4AYWcOge73ePWUt8sYM7eCTHeLw4dOOaOGuJL25gAU/dOEY1sIM7eCTbAzx149itghtYwFPXg6N9j983ruknxz3IxQVcwQ0c7cf1fe5vfLGBPbnP9uPcmGP85Apu4Plv43jnuD55JM9xfXIBV/BsM/phjuuTFWzgqRt9Ncf1yePi8phFwPV4ae0ICoOKYI7bwwePIBo+Xg47gs5gIJjj7woKg8ogDuvYzvkIhIEyMAYzA5vBzGAeTx0I5sg9dm8+gsKgMmgMhIEyMAYzg9k7c2RfwUAwx/YVTFGdQfyb462oIxgI5ri8gsKgMmgMIusxO2QOziuIrMfskDk8r6AzGAjmCL2CwqAyaAyOpttjniExNFcwEMTgXEFhUBm0CGZXxQBdgUYwRWOIriAyKGcDnUFkUEoEMUxbma3FOF1B6JTZbzHjXoExmDrzPOidQejUKRpDegVxpHVmEIN6BY1BZFCnTozrVue5EwO7tbO1yKDN8RNDu7U5MGJstxbHMwtpVzD/LLpqloq21mfgDDqDgeCcHrYZzHnRbPqcCJ6BM+gMBoJzMngGhUFl0BgIA2agzECZgTHrc5Z3BsJgtjZ755zonYEzmMczO2TeR57BfPB1BYVBZdAYCANlMDMYM3AGncFAMG8vR5lBZDDN4SzsvILGQBhEBkNmYAwig2kocyvaK5j3k2NmMB9uXYEyMAbOoDMYGZwloldQGFQGjYEwUAZH0+MRRzqrQMejzaBEIDOoEegMGgNhoAyMgTPoDAaCGICjzHTq/Dd9BvFvyswtBuAVxNVsBYVBZdAQxKAd04RmweWo5/8iDJSBMXAGncFAEMN5BYXBzGAetjYGMwOfQWQw/W1WX452NhAZTH+b9Zejnf8mMpj2NCswn/PqGUQGMlsLC1hBZCCz6bCAIbPpGMFDZtNeGFQGjYEwUAZxCFpm4Aj6/H2maAzAFSiDOFI9g4EgLiwrKAwqg8ZAGCgDY+AMmMFABrMacgWz6T4DZWAMnEFnMBDMoXkFhUFl0Bgwg8IMCjOYA1DjDJmFjMPqDBoDYaAMjIEz6AwGgjlor6AwYAaNGTRmIPPftBnE/+JlBsrAGDiDzmAgmIP2CgqDyqAxYAbKDJQZKDOYg9bnIcxBewZz0F5BYVAZNAbCYGYwz0QzBpHBvGOZpYkrGAjmqL+CwqAyaAyEgTIwBszAmYEzg84M+sxg/vS9MmgMhIEyMAbOYGYw+20ayhlMQ5l3U7OScQWVQWMgDJSBMXAGM4M5AKehzGCWNK6gMKgMGgNhoAwig/GYgTPoDAaC6TtXUBhUBo2BMFAGzKAwg8IMpgnNKdssVTyHzKxVXIEz6AwwnGe94goKg8qgMRAGzKAxg8YMGjNoGM6zcnEFhUFl0BgIA2WA4SynpZ0BBtMsYbwCfTAoDCqDxkAYKANj4AyYgTIDYwbGDAzDeRY0rkAYKANj4Aw6AwxnOS3tDDCcxSuDxkAYKANj4Aw6Aw7nzuHcOZw7h3PncO4czp3D+bS0M+Bg6hxMncN5cDgPDufB4Tw4nAeH8+BwHhzOgxkMZjCQwaxuPMf2LGMco83AGDiD2ZrMYCA47ekMCoPKoDEQBsrAGDgDZlCYQWUGdWagM6gMGgNhoAyMgTPoDAaC6W9XwAwaM2jMYLrYvFmdBYxXX0+vuoLCgD0q7FFhjwp7VNijwh4V9qiwR5U9qvxNlRkoM1BmoOxRZY8qe1TZo8oeNfaosUeNPWrsUeNvaszAmIExg+lI568wfWc+NZz1iitQBsbAGXQGA8H0nSsoDObx9Bk0BsJAGRgDZ9AZDASn75zBzGDMoDJoDJ4ZPJ92TKc4fCcDY+AMOoORQVQyZlAYVAaNgTBQBsZg6sQlJyoUn4HOoDEQBsrAGDiDzmAgqA8GhQEzqMygMoM6deI8iPrDZzBmUBhUBo2BMFAGxsAZdAQSDcwnMlE1+AxmbhJ/Np8rR93gCjQSnc+Vo3Iwg0i0zKY1Ep3Pd6J4MANlYAycQWRQ52+qkcF8cBMlhBlEBvPBTRQRZjAzmFnbzGD2tUfT85FOFOutoM8/m8fTlYExmP9mZjAeDAqDyqAxEAbKwBg4g84AGfjjwaAwmE3bDIyBM+gMBoLyYFAYVAaNgTBgBoUZFGYwB9N8fOZzyMwnZj6HzHxIFhVzGRgDRzCHTCszaAyEgTIwBo5AIrf5ZC5q3jKoDBoDYaAMjIEz6AwGAmUGygyUGczBJLNH52C6gs5gIJiD6QoKg8qgMRAGs+n5Y9lA4A8GhUFl0BgIA2VgDJwBM3Bm0JnBHNtaZ6AMjIEziKZ1du8c26ozqAwaA2GgDIyBM+gMRgZ9ju0rKAwqg8ZgNm0zmE33GQwEc2xfQWFQGTQGwkAZGANnwAwKM6jMYA6z+RS0z8FkjxlE0/OxY59D5go6g4FgDpkrKAwqg8ZAGCgDZqDMQJnBeYrNQzhPsTMwBrOBNoPOYCCYF5YrKAzmIcxfe558VyAMlIExcAadwchgzJPvCgqDyqAxEAbKwBg4g86AGRRmUJhBYQaFGRRmUJhBYQaFGRRmUJhBZQaVGVRmUJlBZQaVGVRmUJlBZQaVGTRm0JhBYwaNGTRm0JhBYwaNGTRm0JiBMANhBsIMhBkIMxBmIMxAmIEwA2EGygyUGSgzUGagzECZgTIDZQbKDJQZGDMwZmDMwJiBMQNjBsYMjBnMa6PZDOa/iWlRlHE9gzGDxkAYKIPQmY9Ex/QdrzPoDOJI5+PNMX3nCgqDyqAxEAbKYGYgM3AGncFYQXlMqzmK4I5gNqAzcAadwUAwbSMqycpj2sZRFn0ElUEcQp860zauQBkYA2fQGUQGxzblpTymbcRT0PKYthEPPstj2kafRzr9oM+spx9cQWcwEEw/iMeb5TFHfZ9HOodZnwc3h0w8nSyPOWTGTHQOmStoDISBMjAGkeiYRzqHzBUMBHPIXEFhUBk0BsJgNj07cc4tz2DOLa9gNj27d46fK2gMhIEyMAbOoCOYA3DMX24OwCsQBrPp+WPNAXgFzqAzGAjmALyCwqAymE3P82COrCvoDGbTcYaUeUW/gsKgMmgMhIEymBn0GcwMxgw6g4FgDs0rKAwqgyODEkV3JTY0zEAZGANn0BkMBDE0V6DZVaUaA2fQcdiVPdrYo4092tijjT3a2KPz6nx24rw6n33Q2KONPdrYo8IeFfZoXJ2vIxX2qLBHhT0q7FFhjwp7VNijOlsrM5it1RkYA2fQGczWYpjFZ9kzKAwqg8ZAGMwMZAbGwBl0BgOBPxgUBjMDnUFjIAxmBvPccWPgDDqDmcE8KfqDQWFQGTQGwkAZGIOBH2s88CuMwqAyaAzY10MZGANn0Bng145quqt7o5oug8qgMRAGysAYeP4ksfFiBgNBeeSvEEV3GVQGjQH6uhZlYAycQWeAX7vWB4PCYOqMGSiD0InS4RKFehl0BgNBeNUKCoM40jL7LbxqBcJAGRgDZ9AZDATTd8rs+OkuZfaozgzmYWtjIAxmBn0GM4PZIdNdriAyiEfJpU53OYPpLldQGFQGjYEwiAzq7LfpLlfgDDqDgSOdTlHn6T+d4gqMgTPoDAaC6RR19s50iiuoDBqDyKDN45lO0ebvM53iCpxBZzAQTA+5gsKgMmgMhAEzGMxgMIPpIW124vSQGbTpIVdQGFQGjYEwmBn4DIzBzKDPIDKIp62lTQ85/5fpIVcQGUT1ZmnTQ66gMRAGysAYOIOOIO4kipUZNAbCQBkYA2fQGQwE0zbiGVdp0zZs9sG0DZvpTNuw2aPTHGx24jSHK+gMBgJ5MCgMKoN5PLOv53TlCpxBZzAQ6INBYRD9Nm882/QQn30wPcRnH0wPuYLCIBL12TvTQ65AGCgDY+AMOoOBYM5QrqAwYAbODJwZODNwZuDMwJmBM4PODDoz6MygM4PODDoz6MygM4PODDozGMxgMIPBDAYzGMxgMIPBDAYzGMxgIAN5PBgUBpVBYyAMlIExcAadATMozKAwg8IMCjMozKAwg8IMCjMozKAwg8oMKjOozKAyg8oMKjOozKAyg8oMKjNozKAxg8YMGjNozKAxg8YMGjNozKAxA2EGwgyEGQgzEGYgzECYgTADYQbCDJQZKDNQZqDMQJmBMgNlBsoMlBkoMzBmYMyAnij0RKEnCj1R6IlCTxR6otAThZ4o9EShJwo9UeiJQk8UeqLQE4WeKPREoScKPVHoiUJPFHqi0BOFnij0RKEnCj1R6IlCTxR6otAThZ4o9EShJwo9UeiJQk9UeqLSE5WeqPREpScqPVHpiUpPVHqi0hOVnqj0RKUn6ml2MgNn0BkMBKfZnUFhUBk0BsJAGTCDygwqM6jMoDGDxgwaM2jMoDGDxgwaM2jMoDGDxgyEGQgzEGYgzECYgTADYQbCDIQZCDNQZqDMQJmBMgNlBsoMlBkoM1BmoMzAmIExA2MGxgyMGRgzMGZgzMCYgTEDZwbODJwZODNwZuDMwJmBMwNnBs4MOjPozKAzg84MOjPozKAzg84MOjPozGAwg8EMBjMYzGAwg8EMBjMYzGAwg4EM7PFgUBhUBo2BMFAGxsAZdAbMoDCDwgwKMyjMoDCDwgzoiUZPNHqi0RONnmj0RKMnGj3R6IlGTzR6otETjZ5o9ESjJxo90eiJRk80eqLRE42eaPREoycaPdHoibNCsojOYD4LsBlUBo2BMFAG81mAzyBEJW5WZx3kCgqDyqAxmDpjBsrAGDiDzmAgmCZ0BYVBZKCPGTQGwkAZGIMQjTdTy6zRvILpO1dQGFQGjYEwUAbGIA47ar+KTd+5goFg+s4VFAaVQWMg+BWmu0RZWZl1nSXeWS2zenMFszWdQWMgDObx2AyMgTPo/DcDwfSQKygMmEFhBoUZTNuYxzPrOq9DmOZwBWy6sunKpqc5nFlXHlzlwU1zuP4ND67y4BoPrjGDxgwaM5h+cB7P9IPzEOaoPwNh08KmhU3PmdCZtfDghAc3Z0LXv+HBCQ9OeHDKDJQZKDNQ/ljTXa6AokrROfmJ2rwyS0avYPrOFRQGlUFjIAxmBj6D4/0FnU/Z5m6IKxgI4k2NFZQI6gxqBPPHinc4ViAMNIL5y8U7HCtwBp3BQNAfDAqDyqAxEAbMoDODzgw6M+jMYDCDwQwGMxjMYDCDwQzG1Ilfe26bqG4zEAbKwBjMrH0GncFAUB4MCoPKYGbQZyAMlIExcAadwUBQHwjmQJ/lN33OAq5AGRgDZ9AZDATTD66gMKgMmIEwgzmcZ5nPLEAts8xnFqCWWeYzC1BX0BkMBHOczmqgPsfpFVQGjYEwUAYzgzGDyGBWA/U5P5glO33OD2ZhTp/zgysoDOb0ax7peStyBsbAGXQGA8F5K3IGhcGcAM5OPG9FZu+ctyLz4M5bkXlw563IGTiDzmAgOG9FzqAwqAwaA2HADAYzGMxgMIOBDMbjwaAwqAwaA2GgDIyBM+gMmEFhBnMaMSvjZq3uCubZG6fLLKgts0xuVCZamWhlopWJViZamWhlopWJNiba2FWNGTRm0JhBYwaNGTRm0JhBYwbCDIQZCDMQZiDMQJiBMIM5czj7es4czmDecJwdf3rI7HhlospEjYkaEzUmakzUmKgxUWOixq4yZmDMwJmBMwNnBs4MnBk4M3Bm4MzAmYEzg84MOjPoPK+nu1xBR19PCzj7mhYwaAGDFjBoAYMWMGgBAxZQH7CA+oAF1AcsoD5gAfUBC6gPWEB9wALqAxZQH7CA+ngwg8IMCjMozKAwg8IMCjOYtxXRo/VRHMF0iujeOmtoZ/fWR2WilYlWJtqYaGOijYk2JtqYaGOijV3VmEFjBo0ZCDMQZiDMQJiBMANhBsIMhBkIM5g3D2cnnrONM1D06DmNmD1qTNSYqDFRY6LGRI2JGhM1JmpM1NhVzgycGTgzcGbgzMCZgTMDZwbODJwZdGbQC/oNFlBnfe/ViaOgEwcTHUx0MNHBRAcTHUx0MFFaQKEFFFpAoQUUWkChBRRaQKEFFFpAoQUUWkChBRRaQMEsoJ71vVeQbllLTbespTLRykQrE61MlBZQaAGFFlBoAYUWUGgBhRZQaAGFFlBoAYUWUGgBhRZQaAGFFnAW7p69I+wqYVcpu0qZqDJRZaLKRJWJKhNVJkoLKLSAQgsotIBCCyi0gEILKLSAQgsotIBCCzgrcs8OcXaVYwCeZbNn73Qm2ploZ6KdiXYm2ploZ6KdiQ4mOthVtIBCCyi0gEILKLSAQgsotICzoHb2wVlQewWw9bPqdXZI5TitHKeVl+rKS3XlpbryUn1WvV6BM+gM0FVn1esVMIPKDGgBlRZQaQFnPex52BWThbO29eyDhslC5TitHKeV47RynFaO08pLdeWluvJSXXmprrxUV16qKy/VVZiBMgNlBorT/yybvQI4xVnbeh42x2nlOK0cp5XjtHKcVo7TynFaOU4rL9WVl+rKS3XlpbryUl15qT7rYc+D846gNxxpdxwpx2nlOK0cp5XjtHKcVo7TynFaOU4rx2nlOK0cp5WX6sZL9Vm0Oo/nLFq9AljaWVk6D65xnDaO08Zx2jhOG8dp4zhtHKeN47RxnDaO08Zx2jhOzwLU8xDmOD2Dedk9j+d8/jaPh9fTxutp4zhtHKeN47RxnDaO08Zx2jhOG8dp4zg9K0vPrHFXXZvCUJrCUBqvp43X08braeP1tPF62ng9bRynjeO0cZw2jtOzfvRM1DBKzlrQM2vHKGmc9zbOexvnva0zUV5PG6+njdfTxutp4/X0LPI8c+tMdDDRwUQ5mBoHk3AwCee9wnmvcN4rnPcK571nJeZM56zEPIOCn/4sl5y5CQeTcDAJB5NwMAkHk3AwCQeTcDAJB5NwMAkHk3AwCQeTcDAJB5NwMAkH01nTeIpycnrWJ54ZKOzpKjycDXByKpycCienwsnpWXh46ijOkLOI8BQ1nCHCK5PwyiS8MgmvTMIZ5FkdeAW4hJ4lfKcOz3jhGS88488SvrM1nvFnOd7Z9OCJxMuH8IwXTvOU0zzlNE85zVNO8xQPZavydkzxULYqHsrWs7Dt/LPaGJy987//93/727/9x//1z//5r//x7//9P//Hv/zL3/7pv9Z/+J9/+6f/47/+9v/98//4l3//z7/907//r3/7t//2t//fP//b/4o/+p//3z//e/z///zn//H8X5/N/su//9/P//9s8P/513/7l4P+93/Lf/34/p/GG/7nP48X1VcTzxvSvzRSvm/Ej/cdoonnkt5qwPtf/n39/t/3Yyet+PfP1Z9MYIy7R2F2vEJ8HsTz3urbg5Dv23gO4yuLY9SsJtT+0oJu+rLpyqK5ZAvylxZsk0O86jRzeN50Zwv+lxb8+xaeV8Xr53xentp3LfTvW3h61tXC02PylOrjt46i6Xc5lM0PWuNrVLOJih9D6l+bKLssjtdezixwXv+axbYJWU08H6R+20TbDA2160D8uWb8bRObE7PFnrDzB3k+G15NVP/rL1J2p6a1NcrN8aO2HxzJOrvdZPxWZ7hcVuWu3/fn7uz0fmXxvLA8vu+MsflZn0+Kr5/10eXbztil0dtjpWH2bRp1c3Zpr1ca+lyAznNcfmlj45wWOxJGG/ZAd3xpo+2M7zo1njeraMF+8Luard+19+9+17o5QZv06xrStPTvD8R23ne8jTbbsP59G3ctvD++s/Da37auOnZZjOvsOt6V+i6L7cVsrFNcS/vuYtbevai3t6/qu4Owsc5Mh/H9chC7FrxlC/SsX7pB3/452+566Oukej6ZGb9zHH1dAp7PT74/js1padKvMWqKi3IbvxzI5rwc8cmuaOO5rl+/bUM2V/YRmy7ONh7j8X0bZWcWVxMNw7w9/urfUnenVl1XdmNv/KCNFh92mWkMnFxf2tj8sBLvzM7ryHPpLEeJ/yANX875XH//Po1Nb8SG9rOJ53Lityeo72aNyy6ed7Pfn+ObM/T5tGr9rM9nGd9eU2Vzhqr2qw21It+2obu5p9SxbgRwbf9lerDtjbwfed4/f38vUd/2HW27udJy4Oe9evutn9Wlrybs8e2BvG+gan/2QLTmXU37/hfp27F6Oejz0dT383DdnJ/PJ1drmFTnnO+vA9425+fz1nIN+F4e37dRdrf9VtcU49jp+tvJkm3OUV0DRRuORf96z227ueeaRj8fi3zfwv5IRj7AcHj5lyPZnKRqj/r3fONLG/busWzPMJ4d+r0D2qaNo5T76o5e/Lfcqz9WGl3su7HiWw/NqZvWzKL++jzmbhr6rfd4ff9u0dvbd4vbNG7eLfruBilnCk8c3/6uuxbKuj0q7dvptG9+Eqtl3W5W/qy/Hkh//3GGj7cfZ+wPRcs6FIzXL7ONnRG31aGOJn7p0L45M+ZHFeeBDPHv7vR62zUx1nTlgVu952LmX9uQ9y9LXd+/LHX7QBu7J6DVrv5oFXeuv1r5ro3nEtea9jys/FYbd49lPHbGsa6wTyfeHIu9f2kb9d1L2/4stTxLRb49S8fmLB3xqfp561gxAfv11nHsLvTDL+fQATdvt1uw+DTG9cjNv2tB3r+NHv392+gx3r2Njr0qv/9ZdSz/ghH/qJH5pYHz3MDizc8aycnoc+rkv9vIGrNVrf1mIzefLbxopK3DMfvNRu4+oYhNE998RPEikXvPKLaXSl8rKccrgd9dKstuWanl2H1Kf7+GsVsUurnCVkp9e41tfyxl+fpzZuff57FzokdPQ/1+kW2bxXqs2Gr5fknndhtt04b/2SNRX1nwrudHR9LyEZa032ujZR7Nvj9Hd0tLUuuav3BR50sbu6Ul69c5+lxe37TRPrB0WeX9tcv7B/Obndp0GWHzTRtvn6b7LMb6aUW+X1DerS89L1B13ftgEvRlKXdzmrqsZUMX/f6etmzXmB7Lw/yBDvnayO4BeNecx9jmJGvbZ6X5oICPK+wnB7OqBfyhuslDPzBidgtOt1f7t0fjYx1N3yy03z5JrG0aGR/okt2y0+0uuXs0vumS7fiVNY0R2xWE7E7W+ODb+SQabfSf5GEjn6nj9vRLHvr+46DYkuf9n9ff/3n3R3PvidCLRmitm3NktwJ1u8hFy9vPLfeJ3HxwWXbLUMf3Zvp6Ql+qfvsoJPaH+bacINfA+2h908jOXutqpFWsMX7plN1z/nv1Mrs0Ygv2q0ueE4bvn+yU3XqBrrsIrbLJZLx/MPeyaOV3+6OtiUDsQP19f+zWo26fIrslqb9UEfnYZCJvd+vtPPquR9ruYdW9+rColfyDB3PshbGeE6G8a/xSY2zjH5dGte/T2LXRRz6yx0Xv1zZ2C0LHtvVXGw3z3i9t7PKQup6HSNu0sfPU9VimD/m+hd3I1fV06NgW8jePRPJI9PuTY7ecUx6rRKA82iaP/qePBb8KCiZ+1oatY5H+fRt9tyxeclW81k0b9R/YH1iN+dloWXfNx1cDvm1jPy9b1eB/ueX9MpPp2zoUW9Mh798/EulvPwHYZtFLzg71+4dM+zZ6Tuw2z0N2i1PaVknNUXb1fRu7SWo+1K2DtVY/eYhQlql7KZv77tE+MOXeLezcnXJvE7k75R72kSn38A/Mp3YrVbenIOP9a/8uj5tT//oofzSN+1P/+mjvTv3r4+056t0sdlP/fX/cnfrXxwdO1fro70/962O836138+i7HvnAuKu7haoPHMzNqX8t8o9L4/up/76Ne1P/uluoujn1r7u3j25O/evuJahbU/9aH29PD18cya2pf92t7dyc+tfdQtVnjuXW1P9FG7em/nX3GtTNqX/drVN9vD++n/q/GC33pv77+eF6NuxFvl+EqLtGrK5OtVa/fZu07haqbk3972eh37/Tuu+OVUXlxcumO3RbFHKrFr7ulqnuVh3W9oEyu7p7Oep+EXndrlTdzWW3UnW3fnHfyO1MthU3JStuqm8y2TayqriPnfA3jeyu/7fqD/dn7M3a+rpbq7pZXL+v75D15kUT+Xbxve5elfKS72I/c/q+jfH+snndr1TdWTbfH0tdZen+/J2/PZbdy1K37Wi3TqWyyrlVdu9j71ap7lbb1u0rU/dO922P3D3d1f/06f7I072M73/e8faTprp7a+rmk6ZtuX+WqQ3MiX4p96+2fyf6OpLOcrnyqy9vV4ZuvihZdytUd9+UrLvXpm6+KrnvkpgAzi6RJpsu8T/cyLED97q9Q83tc0bwSyO7V1MeuYNAeaCk6Zc3n7aN+Fg3ZyV7tY1fdiHw3QKArfqd49Mym0Z2t/+P9Zj4+Iz3ppHdC1Q1X3+vfXzfyPYH7svhn/ermx94u1h1+7fZZTJWGWAfqGn6mskHXqSqn3iTqn7gVar6iXeptv06uq23Ivic6Eu/9u1lr60u4TLPcxb6SyPbgpWaz4oeFQ/gjvulvzaze6mqr/u95xpL++6K84NU2kM3qWzmrWarFbO2MfvtC013J4y9vz1h3B+MrhIrs++Xaup4fGDsjPL+2NkfzVp4OoqUN726O+21rfmvqn9/2u9Wr26fJLu3o26fJMPePkn2B3P3JPmEwY4PGOz+aD5ykqxrjhhc+teTJNZjvs1kPRIwvK76fLb6gzw8t2Jw6Zs85P3zLF61e9eMtgeT5bx8K+nrwWyc9d5WS7uViXt7Le2PpD+yN3Af/uVIdnd7d+c1bfuG1c1h13YrVzeH3Yuj+cS8Zqx3ccaQ72/5WtFP9Kt9ol/9A/2qf7hfy+N5o7emRgqP/9Kzdf/KZ+5UgZWw5xLLL43snsu7r0tnxxusz1ufXxqpb88X7yeCR+pfE/nARKDVD0wEWn17IvDiYO5NBFr9wESg1fcnAi+O5t5EYHvKt7Y2nmyNzwZ/PeV3i1l3X91qu7eubp8kTd4+SfYHc+/VrdY+Ya/tA/a6P5p7r27tTxJZb7G3v7zf9+tJIo8POMl2t7+7J4nUt0+S/cHcdBL5wGa+Td7fzffF0XzCSTSfROvom5PkE+YqnzDXm0djfDz4ZSqwbSR3WTIeza+NaP1Al2wb8XXON1Yr//o4u6m8/xi5bdezbj5GbtvXrm4+Rt7/OrZ2oG5e6+bX2a6+PtpafW14Amy/3LHp+MCM3j7wFKvZ+0+xXhzNvRn9vl+trO3BDTsffOnX/ZtX93ae22fS16Ll8468bzKx91fY2v7dq1srbPuT/i/7lPn3J7194C3s5o8/7NL5tORYkf3+aPwTBrt9t+UjR1Pzt+m/e83xsVam+ejma5fYBwxptxJ0v1/7+/26P5qbhlT32xatdzEej82NUi8f6Nf+ifO1f+B83R/NRx7d5NaeT+az6F8f3Wx3tsttgZ9Pbh7fu3Tf33Ct1zFcNteL7SJO6fkb910mH9i7uo33N6/eH01ddmKtb67Duy0D7x9N+8DRbM/YezsytLFdKbj3eljbLWvdfD1sn8jN18Pa9p2b26+Htd3K1sifeJjIt43Ibmu4uy/uyO69rPuZfOBbKvJ4+2Mq24O5n4f+0TxuvjAnj7e3Dngxfu+9uSu7l7LkIXkll+8fVMhuOWiMsvYf5es/vz5cl93iVk8T6A8dm0Z2T/h8fV/Ae9k1svtqz80dvO43stnhScoHNr2S8v6mV/ePZrPD0/Y0ebqrprs+fHei7J5olboKop7MquZfm9nNYXs+Nul/ufz9qJG2ts/r8tgcUH339ZcfdEl77I5G/oGJ7LzgA29qyQfe1HpxOC1fwytN++ZwdvOBsmZro4l838huk7Wbe5u9uPm7N+WT9oFvB0h7/+MB+0RuTvmk6SemfLJb47o90WofeFdbdq9s3c9kfGCqJY+3p1qtfyKP+kfzuDvlk7ff1X4xfm9O+bb7CvZ1wj/vmL9/6in77x/dNIHdAtddE9h/DOWmCeh2e+J73xDZd6vls0b/vl5GdktTt2fSu/e1bs+kd+tbt2fSu/Wt2zPp243sZtL6geevou8/f71/NLuZtNaPzKS3C1z3Z9L7F5VuzqS3jdydSdvbE9j7XbKdSe+WuD6eyM4Ltl+9ujmT3r65dXMmvT+c2zPp3ctbt2fS269O3ZtJvzDqdThj2Gbg7HYZLA/HDh3e6qaZTzwl8A88JXhxPJrLF27y293Ss1s6fqEfNjPW59af3DbN9A/sOSz9/T2H94ncnen0j+w5LP0Dew7L7sNY5XnTvN7hkrZ5KVz69vOC+VmZhoUq+0km6pkJPe5rJjuzrflaeHt8v/vYD3Kxsstl24yt4oaDx+8203NXtufP0H6/Gc1mRv3tZhq2AdLNGbN7a6jEwuf5O432e7/T7VvT8faW2fsm8oPm20PZnrcd5+1v9sfdPeL08fYjg30TN/vj7qFstpnbNiKySqeFO3h97Q95vz/k/f7YXjSK5AW54EbuV7/X3ZpXkawo0MfmdN9f1bHX3PMK//1VXXfrXgWll6WW8vjdZur6KNGT3b5vZrf29fyNcg8OFGzYT5pYGz3UgbLlHzWx7hUaP5j5axPbtw/XK4ytY35uP+nSlp/Oq3/ZxuNLl26ddb2G8cTvD2Y3Jc6hUxq28az9J420vGJxZ7KfNZJbX5W/vJjyayPbbQm75KW8C+pIf9bI+ibhk/3xez+xrVcqn7yZ4Otub0JZ03tp7JNfvp9e5d254z6LXECHRX/NYrsrcdw8nJ4meF/AftSI47W/711k34iuj+aWB2v9f9Ija0cSfWx+l7ZdKhZcccS+dZIXjdzr1heN3OvWfSM3u3U/avyRLvAYv3vlazmpOJ4r1d9tJj8J+uTfbyanSaVZ/f5Bs27XZ+5dd7ZN3HwrRPdf07r3VojK9mHBvbdCdLvodfOtkBe/Tr4W8mTbnHK7la/n6krueOosM/rl99m+29Vs5A0tP+37NZfdMo3lSh7LWn+t4VTZf/r11rZ6ulv9urvLp8oHdtZU3b99sBZ7ikn5/mZWdfsB2HyFCHfmv+zO9yKTsh6UPdnbJpPNFWjYcsrnw1n7vpHtWWs5H36etQ/9LdOWko94pWwe8eruHa+eH6XrXjZ3GfqBfYpU396naH8wvj42PB7t+2fn+oFtC1/6ksGXvr1uWH370rOzttsdoo8/7AR3d+lU2z6QvbNL595gb+7Sqdu1r3u7dL6aLeFZodTN0PPtl9zXzSi/StF+MoW0fNLwMP/2RPP3z9UXeeS875lT+81Gakcj8nv3Knd7xN7ukRd53DqYV4/rFU/9TX73AbnnnfVz0XBzJd8tNd19tq397W/C7Jt4/1nuszPz4fazdzYzit2Cl+WtpG3uJPdNrEunaS2/1YSuXRxNvx81+yZWdzzxuyZevNN8r4pUdy913V1W1e1LXfeWVfeJ3FxW1VE/sayqu9e67i6r6nZPvLuDd7z9msw2j/uLqrr71tbdRdUf5LJbVH3RzF2XftHMXZe2T7wPZY+3i2P3Tdxy6Vcde9Olbfdy1z2XftHEHZfeN3HLYl/0x91l95fN3Ft2f9XMzWV3260v3V12f+G0d9cirbT31yJfXAjvlWPb7h0vz+Uul81LxbZbIDJZW/A/5wiKp331l0Z2GzLGnqDzNvR5q7NpZPf6wWP9PIMP6b42snuqJfmgIkfxUZrwlya22xdaruwYe+QnjbSxdnV9PiEbm0b23+BYE4z64B7EP0lkfZXsiZtEtmearEUIV9zJfjnT6gc+cGT1Ax84svqBDxxZ3X/gaH115snt+4/52O4NL11lqcpKq18eedjunvjeU5P9b3PzqYm1+vZTk/0ear5eYzDfTO5tv33hvTsEa/r2HcI+kZt3CLbdv/D2HYJ94u0u273ddfc2w/af47r1SpTJ248IXp1qjzzVNtdg2W23KWvZruljt13fNpNHZvIYm0w+Ya/yCXuVT9jrdgvDTzRyf1HIds+27y4Kvcjl7lKZbbcgvLVUtm9C8pTdXHL07a/H7c/Xu5ccff/rcfu9XW9+7Nz2i1s3Lzm7u4K7l5xtIncvOdt3bu5fcnYLXLcvOfaBJ1u2fb3rdiYfqNs2e7tue3sw9/PofzSPu9dxf7ts+8X4vfcxWtuub7V19WxtfL/fn/kHXp81/8Drs+YfeH32fiO269gPvD5rH9i+8P7RbF6ffXGu3fvSr+3Wpm7P1Prdr1HuZmq78vzbk6wun2hkd7fV17Os57J5+fYX7m9XD+x/mruTkv5+9cD+qwR374PHB15AtPH+C4j7RO5OSsZHXkC08YEXEG23yHV7PrF7/+r2dXy8vR3c9mDu5zH+aB435xP+eP+5wH7o3bsb90d73+N99wLWXY/33ZrSXXv2h32iEX/b4333Va57Hr//aW56vG93pLvp8ftvNt2rhvDygT21vLy/p9Y+kZse7+Uje2r5blHrrsf79rNct18y97I9Y++8KPQik7v1EL59A+tmPcQPctnVQ7xo5u5L5i+aubva/bKZe6vdr5q5udrt27LAm6vd21xuD4H6gU3UvL49M9g3catOZHsoPxjNuxvAm6N5n8nt0bxbW7r76v2LRm5awv0D2lrCvpnblrBv5rYlvGrmpiW8aOauJcgHCmC2udzdZ8Hl7d249028P5rv7rPwYrJxtyDI5QObE7yYC94rCPLdK12371x2jYzR84XTijesy0+uHPfrHV80c7fe0Xdvdd2+junbO2rsm/jEdexuvaPv3ui6V+/4ook79Y77Jm5Vpb9o4k7J5Ku56N1zdd/M7XPVPnGu2vvnqr1/rr7o2Lvnqr1/rtr756q9f67a2+fqi+9n33xm4J94ZuAfeGbgn3hm4J95ZuAf2Ifb/RN3Xd4/kckH9uH2/vbq7PZg7udR/2gedx8u9/f34d6P35vzvN1C1/N2ZD3BHH+pC/7lMWj/wD7c3t/fh3ufyF0T2K0wlfJYm2iXZ7C51Iz93rl581i4xcnXZnZf6irXiaJ1c1M93r/PupkFXg3/2sR+8931/vGxEe/mTmt84nnsbqXrtpOM/n63fuS5cN/uNnjvSdL4yHPhvnsL6/ZDoPu5bB8Cjc88Fx6feS78qpmbD4HGR54L993a1+2HQNsBcG9avzucu8+Renl7obaX8o87lN1zpPGZ+8fxkfvHXj5QVdCLv//r+B/9de7fP/bdute9+8cXTdy5f9w3cev+8UUTt5517C/osrawf7KWTZfuirfbmoCyifqTCRu2Nzo+WbBJ5AMPX1/Mp7NYo6P489f5dK/7DV0FH0wwfIHXy4+awXcXGs61L8207TcRV+8+r/3f15/09oFPJPf2/ieS90dT1lS2l829yotG1lZyvWAS+rWRdz/P8epYMg3ZHMv+LGnrFvB5WKK/ebI1bJbZuC3XT5tp/olm9LEGc9P6+L6Z3f6FRcZ6Rla07LLZrVLd/NbHqyPS3AVRMTP4msq7bvvifOma++bywxhfE/F3z/4fJDJ2P874xyUy6uan0e319NZXcvr2m0z3vpLz4kz7y96sePng6+HIR8bO7lNVnxk7NRciGyscvqbif3bsaH6A6Pl4qG8S+cOnrHZsfr3rke3LXfi+wJN9Y7P73Qvv7QnZbbvh8509IV8dTu7HL6zF/Ho4uxcQ7u0KuZ9HjrXXpnIb/C/zSHvXY1+ksZ4xPzOqmzR2m1vdLGDuu7e7pKxOfTZSv33u13df7iqajoQ7wF9Kfvd53Cyk7rsFr788JsOM62smH3jjpu9WvO7utblt5P670X234jV0nfNP/O1c7r4b3XdrXvfejd43cevd6L57h6jlEkKr9v0zpW0j9+rc902szyIeH3v4vjc+8O5A7584W3eedr9T7f1Otbc79cWrbu828YOxu3sYdHvs9s+M3d16182xu23i3tjdv4J08zTb7oB47zQbf/Ycafnll2Pt+/d+3Lv9MR6PP9zIvU7dN3HTELcTibX097yx+N4Qx0M+MJHYzs9uvsU0Hu9vn7E3kZubo9xvpLXNKTLev9CM8omTtbx/spYPnKz+gV/mdiO7X6boJ34Z+8QvY+//Mu9PAfbPgNcdWufzkS+Dt37g7e5R33+7e5/IzQKeUT/ydveoH3i7e9QPvBA96tsbvWzzuFmzNmr/o2ncL4oau20K7xVFjfZ20cDdLDZFUS/6425R1GifOFXbB76dOtr7p+rtPPquRz4x7tr4owdTxtoR7Pnoq3/3QH5I+celgQXyX9PYtoFvno7q3x/K9qPHBUsL4/s2th9TyO94Sdu0sf36T1njRb5vwd9eaXlxJLkawK/zfmlj9yQ/V+fLo32fx/aDVx85Fvwq9vjNNgy1bd+3sXs/6+Yq2tguXX26P3DP/LPRsh7gl4Z1kfGj+eHqj+fMbnNzp9tvc7dVcfRkfGH4Z5Uk+Z5x31Ws1/GB7YzGbqXn9oR3t2x1d8K7TeTuhNfkIxNe+8BORMM+UJ89dgtXd2er7+9K+OpUu7Wt79g+58mvror9pQbr8ZNM7r2OO7y+vw43dqtOKquoWkU3s8TdxoS3b+L97Wej+x65++Rr91jj5pOvulsLuG1q/oGvGY3+/teM9oncNbX+ka8Zjf6BPV9H/8Cer6N/4pakv39/1eUTefQ/msddkx9vv1X4YujdtNbxCWsdd3cT25QWjPGBLTTH0E80sn+4eWePtrHdkvCex49PePxuS8K7Hr+7Ttx93/ppfB+YuT5beX/q+iKVmzb/bOUjk9fnX+r7Rv9sxba3bTffyHu2sz1x77yS9yqXu+/klcf287E3X8r7STa7t/JetXP3tbxX7dx9L+91O/dezHvZzs03844NgnY3/fdezdtnc380lA+8J/ts5e25wos2br0Ctj+an4zt7ULXzbH9mX0Yn7lsKwnvbd32qpW7DvGZ/RxftXPfIT6zo+Prdu46xGf2dHw+yX18wiHKB169feZS3x/brf7ZsX130ejVXOTuNm7PI9peC+69Svhivnhvf49nKttPIa5Py40Hpr/l6wHtWqmrQn/w1uRrK7uPU9VRszAe76vZj9ooy3yft9u/2cZ6Jt5YXP+ljV2F4K1vtr/o1Xw2P/gL/51e1fcz2bbh6+2J5nxV5/Elk53B2fqC2XNdIFtpzzW2X1rZbgSzXsKofEPz77SyW7ut652sWvFF06+tbH+hfBvxuRrYN7/Q7s2u5wLeGj2OQp+ftVLSJ0tDwcFROvRLK7vnt+vaYQ9UC3X9QRtW17vjWMP9O21styHNa2HDvf3fOZptn1i+2MWb+6+t7M7bLjlR6GLj2zH0opVVNfxkf/yeJ9w/V3a/0LJr49d2fvYrr6PhPhQ/bWM9WxPbtLG/gq1L+yi2c8ntF6ZuO9y2lceqo2i8Ifo7rdh2JMvfG8lfvWm3SHbfJ7fLZLd98jP7Xr5q5+7GJc8e/8BX6Z+tfGBy6394cnt/85JnLrsViFu7l7xq4872JS/auLV/yas27mxg8vJR1O2zdt/O/bO2f+Ss7R84a/sHztoXvXv7rO0fOGv7B87a/oGztr9/1u6+5P5cH15NOAq+9Ncr0Cc+5/Vs5f2K7xep3F5F+MwXvZ7tfKCS9tnKR8qcn+1shtC9OudnG/6+HdzMY1Pp/KpP7pY6l7J79er2L1R2a1e3n36Vx/tWez+Tvu2V3Y3QvTrjZyP6Zw/nZqXxi0bulRo/G9nucXir1vjZyNiuGdwpNj72id2csneqjY9dzDZ53CtJfXUwt+qN53Zqm2ekdwqOS+xN9YcP51bJ8atGbtUcPw9nN0G/V3T8bKT/I/vk+7LjVyPnVt3x/WkKzrVfpynbRm5tYPIijbWyZR0rW1/TkA/8vNtXfW7+vNuj6XmD0GvdHM1uQqBrH6Pnvb9+261l+zmvXMqyjnWSXzO5/duo/14bPW8ORvn+992+zP3oOY3Fno3Heur9Rsojn8Y8+m828lgPhp6NjN/NJJenCwz6h43kXKDgt/lhI21kI7/bJ1laVwtuMn7YSHZsfdjvNrJuMZ6N/G6f1DVwKl89/tJIkf13v9dNU/3Ltv1/aWT/qV7t62EDpnvtBy3kE+IHboh/1ELNFvSbFj5SVFd2r4Pdvh0u4u/fDu9TuXs7XPZvhd2+HS76kZut7SrN/cKbom9/MfFVLrcLb4p+4HOHP8lmWzLzop3bJTMv2rldMvOynZslM6/auVsyU+wTJTPbbG4/ny32gYcG9v7z2Rdn8M3SsW2f3H+QYvaBPrEP9MlHHsbsWsGumML77K+t+OP9PvHH+33y4g3ju0VRZbvp4d391T9RE1X83U2Q9020suy/VSwo6JdfZzdhyG1p619GYP1BI7fLQsrula2bZSHbNm6Whbw4mpsFHWX77tjdgo5Xrdwr6NifKXU9dHs+hbTNmXKzkcYb/y/Hs9v1SNaP3PSxOfF3n9hqzZdDNozAr5nsq7nvFAK+aONWIeCLNm4VApbdItjN8rsXnbr2dm9tbDp1+5mv+sg7SzyBOJz/N1sp9SOt+G+3kqdJxYZh77SyzWVbJyPZCq/pvw6e3Wtkta1ZcW28W/01lbp7hOC6PtjgfHu6/LqKvF12kvVa3BNR0au/NrLbuPuxfubn4p5sGtnNC5oWeL7Ubw9o37eS8yWR3c9812gF01n90rf2/rlSd2+QPd06C9aKbDLZPcnv+RmM3tDIlx9o07NeVomYPy/e3z+n3W6GeHOP91LL9u3HO5u8vzicWq4r2HON4rE5nLZ9AHfrhd9nK7t9EG5upvBs5QNbIj5beXs7wxe9cvNd21K3C2H3XrZ9cebb+jZO4XOML2f+bjvCmzv5v5gW36ujfdHGrTraV8+I7la7vWjndrVb/cTWiMcXsN6+S9638YEnBz+odqt1+0vfqnZ70catard9G/eq3V60cafabffY7qG+HiM+7PH9F8xK3e6PePMTZs9WdnODm98we7ayK4u89xGzFwd08ytmr1q59xmz4xNhby/SvzicWx8yu3+qWNucKvJuycE2D5c15Xry99+Q2TbSs4rqyf03G1nn61HHKbsesY+sJVX5wAftn630j6wl1e37YffWkl7kcnstqe7fYrq5lvSDbLZrSS/aub2W9KKd22tJL9u5uZb0qp27a0l1+57X3bWkbTZ3t5R65jI+MYey91ca9m3cm0Ptf6H7ZdN19ymwm2XTdfem1+0+kff75Oax7EqvX/Tr7dLruntX7Adn2/hAz44/fba1fF35OevYHc/uDa/P+MHtNcPqHzhrXf5s3/7laP6SyfjRzOP2ymP1/v7K48vr4t375xft3L9//sjbYvUDb4vVD7wt9qp3b98/f+BtsfqBt8XqB94Wq++/Lba/BcibzUfffMr1uYr8idfF6ideF6sfeV2sju0uCHU9Mu3bB69DPjECx9tv3ex/5Zo22Vv93ackNz8l8zyc/pFzZXziXOkfOFfa9mWk+/e/bbdYdvv+t+1Wy26fc+3x/jxhm8nN/VufjdifTeQHtw1tt2Rw87ahPcYHjudeHrsp/4s+uT3lb+UjJ23ZfpHxZpFgKx84aW9n0re98pFBWPzPHs/d9z5bGf/ARDbvfe4bufneZ6vb+7F773227Y6IN9/7bNsviN1677N94q2xFwdz773Ptntt7O57n632P3449977fNHIvfc+2+6DJndfDGy77Q8/3yeb9z5fjJyb733uZ5H3Pjjz7JTtrb+VXLwwvBv0wzntzU/O7Mqt2ppdexMUtlb99YDGB5Yg227nwttLkG339tjdJcj9Ad1dgnzRys0lyLb7UNK9JchXh/PuEiRPFGEB5pcTZbdM9u4CpGdNkfPK9WsW2wLDVcbjWtvvNbFeuHTDdOBrX+iHbr30I7PY3WZ2t5dsmn7ioUHUir47ZdOPzGLV/2wmP1jUbfr+ou6LXG4v6jb7xKLuD7LZLuq+aOf2w+sX7dx+eN3sE8Vf7QOvjb3qmbsPntt2cezeA9/2gVfY9nncewD+oo1bD8Bf9Metrc5e/Da3SwhetnOzhOBVO3dLCJrbB5YMX1wdby+PtU8sj20v9+sFFld86+fr5b5/Ypmh9Q8sM+xTuf3ouH9imaH1j8wY+p9cZnDNiaXyBYuf3QfdXWRovX/kTBmfOFM+ssgwPjTTHR+Z6Y6PzAzHB57Xjk8sMgz7s4n8ZJFhfGCRYXzgee34wCLD+Mwig3xkZUwen1hkkA+sjN3PpG975RODUB7+Z4/n7iKDfGBl7H4im0WGfSM3FxmkfGCRQcoHFhmkvL3IIOUDiwwvDubeIoOUDywyyCc2Urz/22wWGV40cm+RQeoHFhmk1n9kn2wWGV6MnHuLDC9mkTcXGWT33pc3e+QD28fvzmjfX2J4+tojDRavjDwvqb8czttPv7bbD1pu+veQb9PYb4OYu/VhYvGDJgo2hyhc+PnSGW13Db77pY59K3e/GiK7F8dufxdJdktit7/3Ed8s+raVm9/72O+DuJpoTXY/0G7HmbamN9rwNP3Y9/JmIiLrWMTbbthsV8NKWad9KXyZ+9dUXrWT9yrHzPj32+kt2+FF/Wft1DHWdpVjjM25K9vPkeYOi8favu2y2bVTbbnT8caDbeaz+96Ruq4fx/O4XT7bR5y33srensLPx/GrEe4k8DWTNj7xO+0eBj4fu+XTGTzg/JrLdv+z2665fUx69/tGslsou+9324Wyu9832pvVqNdl7bmwqb/Zu/e2O311zuWmybWOXSZjd4e6XpZtzoLh9msu210VH3xLFb3Sfz1bdgtloz3WVxAbdn95Puf6tZXte7vrWfj4yybOX1vZXe8lNynZ7M0r27e+7m5YvG/l7j7BsltQurlP8ItU7u6P/aKVm3tbv+jcm5tbv2jl5sbUL1q5uR/0vhWtKxdtv9+K5KbuWCf7WSvPR9Rrujtk9xttt1f8xEnXxnqu8cTvU9nNUzV329L+W/citeU1SEfbzDD97R0Stk3cvzD38okL8/Z1r9sX5t7+7I2IrYlyNd3diOwWxt4tuHq68xrAzt3LvmaxvS9baVQ+UPx6/dotRt2/lvbxiWvp7k2tu9fS7Stjt6+l21ZuX0tH+4CtbXeLfN/WWl2VPO2v3+K+bWuWd6rGjWd/0ERrqz638THe17N+uwqVO6w+l5Rld6btWml9zc612Pet6G5bxdtjR3dvi90eO7rdWPHe2NHdOsftsbNv5e7Y0ccHpgTbVD4xduSR2zvq92PnmcjufHvk+VZ0+xuPT5xvu30V759vpbx/vu0e7N8/37at3D7fdotit8+3XSofOd9yg+HtDEV3q2JeV4GWc1vFv9NKf3d54FUmuWJSfZfJblvFYrnv8vOHeujPlyqeDzDWb2NDf+cKJi238JTH7gq2e655e2Ku2y+M3Z2Y6+5lsdsTc93uhnj7idnulYzn3H/tANL5bOjXJ0y6fV/M17PRYx939O6XI9o57drF8yiTzIe9j/7bBzQ2B9S2U9F7WwPr7o0xfaxFtudV13ep7C6nPU//sunZ3etVLbd5eWCv8C/n/v5o1urYc/L22B2Nbas61rnPN6O+PIvU3erY/Wty65+4Ju+e9N69JssnPp62b+X2NXm3s+Lta/L+Bbi3r8kq6xr2l3uOH1w6tK7nZKooHPh6Gdxtb3SzQn7bxv3Lz3bznduXn+2WircvP/r4o8+FLD908ZfXF77+PPr2x0dl9+3tm+9ivGjj1rsY+zbuvZvyoo03NyNqvla/njOvx29N2fKzEtK2E+HtW2KraLWyBLf9ZAbrj7Ug+OTvP/uh9v6nQ15mIsikf59J283r14TcG7eb/dKx22f2+WGKxn1D/04ru1z4vjXqBP5OK/b20HvRxq2ht2/j3tB70cabQ09GPq8o3xY73Gug/l4D6xm5/uWrTrcbuPeBqu0zzztfp3psf8lVMfJbh3Cv5GTbwJ2vAGxL62ytEj7wjsnzpv/2agcu8n8p2/qlieey6u7XzDNa+YmHnyTS1otEVdx2idQ/3cr9WVj/yEOA/pGHAP0DDwH2E7m8zrJO62vX9ndnYduTrZU1bo7P9m0SGY+3E9k1obbKfPUv10f90sp2beDeZ9x0/4bXqhewB4v69Eet5C2dFa6wf21ld8be+xrcizZufQ3uRRu3vganu6Wou1O6m6eJPUfO971qj8f7p4ntVrOsKq6a21Q2Z6znAPQi21Z288Kbnz2zx/aB1b3Pntlj/8z31mfP7LF9B/zuZ89e9O3aM8Ara/Z/9gvVlq3w2xk/bWX9QpXV8j9tJdcY+Ghff9NrreE7hl9z2a9G3ftCq22/inXrc7Mv8rj32Nh2r3lZW0WfJnXsusT+dCu3v1pr5f0i7hdt3JlUvzialttCNHw97e8czbZPbn771uonvn37qpV7377dT/P72hbieeX9fpr/zEX/dCu35+hW/QNzdNsta92eo9v2fa+7C3X72fHTT65+4WvtX3u3lT87Ta89vyxc/TfvLAsW+4bp5mferWvds+z94chapHs6pu76dftVxlVm9bxV5Tz98Wsrvlt6yeemBY5wLLf9oJW6tg2Uit1mftiKr/e+xDl5+tKKPN6+Z3jRxq35vu0WtW7O91/0yMjNTB67X0fkAz0iH+gR+8M90tfjoeeDw77rkf6BHnn/C+Gmj/fvCbdu4vnCTq/1N81Rysrk6QP6u61I+oB4+d1HgCxiqPa7rfh6zP/8u20un3jtzfQjcwP9yNxA//jcQEu+o8vdWb9ew+zPzg2eiznrZ37IbpKyW1m6l8i2iftniuknzhT7xAvhZh94IXw/YfL1bKb/pQD7Syabc/b2a/Lmj0/0ipc/PX4kN70RKbs5oO92kVtLFEbn//W1adt91Kv5epDROudu2n/SyliLaEchzq6V3QxhLUI1PI3/tU5rm4hITmil9F0i/e2Hxi8yWTvXiv5lceHXTLYniuZ+dia/28r/v7erWZqrxqHvwpqFbcm2/CxTFAUZZipVKaAysJgF7447CZa679fHur7ub0M1k3BGln+ufo/8QRWUzPIGVTCGL6gCV+MOqmCdeIMqUnYEVSYovqAKvoQy3gMSQZcQ9Xg5g5LoXRLRslpb4Xt8mCCHnNIB3de2P6KgnNgeFP/Hve1I45a2I41b2o5abrhHNZrkANLt5TwuPm/8D4TU8FyMGuBDq8EHAd8epI1RFCSVkBg4vKpEdmQ+gvkRBNNsRD31jZ4+ShVlxLqrPUw3yfU5BlpOG/30sRlisONy4MgPNnTGXPi5KBhleIT99/PKrxlK1cctPw8eTFByG3oJJbQl5SZ9lVJo5bly44QrWidBxmKfpXQOx7z6sbULOLrZyURWzuJob1T/XQLCQR6ZpnT7T1MVGukUStWzZ57bN1DwmopZU13XMaVBKxeI0jqO2XMyV+qIA0tVN+H006JNDSUBLSdcnjRQkiGiPomijkj/yasopMT/HIAsBfWW98jI4PSNtgWmyKMsmDJm9AVZMrQDtWJNMFcwAjac7sh46yMKqqapo0qJJAaE0l6N0t/MUb8ei60jOxCYVZgpKyOm1koENGgTaUitzMIxIGkgVfEojTOtMPyYXYKy5DIK6nNBs1sqIknUqo9knL03JCnOU5cBLWhF2YdYdXKLLU6Vc4846cCVQKWCxw6zw7liFBMMVxKj8vVehZlO2NL7AqaGiV1lhtmEUp9Lw3x9RRNJWL/4JdMqinIahpIXU0RNE6sxgGBjha1gpPaU/USndNBtg0nerEle46yVR1lgK5jz7ENJZKSZWGwv2FGS9GJJlFyLrQ/8hiT8WklysO0cjCQBpzanpCMEuC2iuGOWGMUbK5zI4owVVsiK6I0VzlB8sUK40/1NUEI3Gyc/7FG5XMCIn5WsL3YrDT0rCKWpnWznHR1RUN5sD4o7WFjLjs7bWnZ03ta6ofN2ttOkTPPms3rUbr3cfFtL3rJBGWYyRv8eg1mYsSJKxBrDqIyOURCK17yFTlWtO9yhKq9GOeNUIdvH71RhafxOFWwHczpVEGO8/mQHhx0x+LpLBU+ucl31NACY7FZR5svNiFERR6KTEaMK/IRkDVXXsIiSwtieFEwI6iSKl/p1guKkfoUoburXuoMjcSKKj+Nj9nArUTYbQvTjwUUJtBsZ9zgvzLEgnC3xsLbl0W1b4mFYMzzqOG5U+/xcMxJgYCHrrS4g3igoSaLpGjaNR+mxlWqyopx0Sqi9kG+siDdEUAU1mWWd450ZzY4UFFpwx+YEDhHzfUiwVryxOUGkie7YHHwadKRFyamBbUbRrFSLlheb0nxppz4kTm51jBKD2v9Blj9qTob2iSxOhvYJio6Li3n50+jleZ+gOEm0Jiiq3W4zLKM4OecxipfQS9IGQq9JE4avBo95A8aGWkDYtqCGS8/FgQYZQakzd1xNJo1qvrgaRvHG1SayOONqghJn7rjaDMVZg4cbqkbApX/iQROTXO8yw/1hrMOD5K4wPpxBkaIJItuBdPjCw9FiW1DcYRtBKS93XE14Ry258I5a8slOj8clsS23PGiXL7dACJUtGwSLwNUJaamgw4JQ2shWUbvjLTiDwl/asr9exMJ1GWU8LGxzkidRlCmL7ezgI0rewQoHUdzTDwXlztxtHYJmivmvIsyeea/iZI+Gicuc0+pOK7dKd6XRDch1yx5teXTzlke3bHl0S3z5TtcRt+cKXymUP/PfRsSuyHWMM8o25viGLCgrUkRZOO1b91gkJmVHkZiUHUExKTuCYlL2FFRJDZdj/xNZ3FkRgUk0b1YEn14nW//8DrgYUwVlI5w1O5N75L7T7dWnzh+eq+16eK7sKJ0TOGDMF56DlotoLVTPblkLyA/SA3dR5bhjunyMcMhVBw0uphWdXxDu+MYOckDbP5j64KdFZhDDHxCQHYU2E1m8AYG2o9BmhuIKCECIoO08PRwfwTaj7JkzBjXBcNV6Srv8yk4ucdb7d8fZdFAIMkvzuICUzdjdg7+Kkma+KAuWw8ml2AI8JZX1MagNnJIWoGWrLQfJBPtTW0Yx/HhXUOoyihK1JNMNdwUFygI7Jn1Mew3ny3TyKElAooCD6yW8bAFOEfERXjY0ZMxLeNlg9beb8BLrljUzxAy32X0Z7wqDD5cx8oaXAbaNmR7M/lsyEgacXW3Its2gPfH0iIGeOhoWHFEDdmBDpIqW39se3TdQkF3LWh9jIyRyRiltHBfLHXhUSoob3N0GORWduWssitdOb3DemFcUqFnRjlJ43uC0sTIshZ6JLKsoSirXc/sRocDCoxEbYTtD6g3d4kjC0Esx5uRxm+GCNIteDfPScUEUdyyI0ssXZHbI9FOf3Wd9/Cu8zqjV7IRaysvVYhZk6VbOHn9RlLx8FbUuXhh+QCYN+ONZyAiFt5xc3nFy3QsqZVktYz5djAG9UGjaJFflCRITG39DLZA4jLXoyBS0HNQCRZERdWKxajmKggyFLxUmXw0FQVVuDbW5lDAel2LTF0cU2G6mV9G0a/bczLJd2WIBphxKmnk935Yv9+1gObz2bYb2bTPmRoOeL+zPKoal4W6jH7coQ+fMNQd3IokyI/bfsT1HQXppyh7Qf99N03nUS8FMWfntoNzj8YcZM6desCSjJCySIEmwXrJGGVtuyB9Ckf5MopMezZzuN1DQQxeM8R8rQkEnRj/03eI2lQrh8SaVHfNJW9kxn7SV6/NJG2w5K3rmCioWhSju3oVWN5QzTkRx9i7gIxf5TX/zeORQssx/5FDTmf/IoaYz/5GDTWfeI9e2HLm248hJ3HHk2suPnCYROTF65VDCLKc6mhZSAyFLNMGs1EFbVOpdGe2p9QzDhSmgL6vUHeuRV6+HRly6/8yr3zIanQ9MlVe/qzyauXNm9DwhtkVugySU72v3zqEMp7X/XEXJQd2QkNZRdFBJuKsLo1PWT8kjGtx/t2WcGk2rY6rLOOrp3X7HZZw2XKMUAnCN+p9engSKMXzDQPF6Ut9tdaOzJLQeSOMoI8/Tk/ThWXVYR+Gr1vtMEh+hZAoBZiGGwSCWDLyc0q2WLvXfVZBuUbdvGDMou8NmUFpYlqa2BqSJ10fydRDkpgWJKowUdOwmI8VMQ5KdC3wWJ1NVHGA6dJzL80tmGJ4CihmGp4CiY9SrBRSn9Jrrhf1RosMMPrRTnKKtZxleSZTA8u4zxvDtM8bw7XPil++z1avIhX3OBmfVbLh/7AQ+diiZxkVbpGpIzx87OOIstGE799817VhUDAHZHgRrTFzzIDtIuhiWncnhqlLpIOili8Raac8RfUkoXzfIKF81yGbrYdZG3YzXg4wGZ13hFMXXaHji4BYQxEwB5tN8+YSvmaGLBxfK4TWBYL9vLNp6f9dT9IZS8rtah7fiGiRN3bFFcn2L6oYtgrm02AxJcxNkXeYIcYZuk5mgkx626ASKTZueQ6mDSjJVjMKXdyjj118tBls0cG45NJy9RARVezmbNpMkK0apq+vJRdmU2vJRKaOBJ9kuziMKyqXt2GSdstc/9nF1OazMIMwJLQfZuWEQ0pMdQXASJZbRehbhsYUoWhTY0wHrhyUqaZa1OI6yXB1qMtsgfZpyRI8KSjsVHXpRns+8mGGMTtKSTQ3dKYxMyqyTeRFj1I72n88x8FEbDLdkyVbOHtjBfdcB0YuCEmhehxdj+BxejOFzeGGuyenwQq0qvwn15351b9Kg9iHb9XYWxchyAUWJL1KlZZSm86/DuiwjmHwFhYZlTFSWV0RmoregRxa6hqNNvlhJzrmXrpl2MwzPTLtZbHxYF/2nLMbXPQObJvkPpz4whmvG3yRjphU6dx7YybzbmIiXQ62rKDpWJkdOyygjYNVRljOJcYxcy5OaI5TtZc32cpUdKJJWUXLQOZmw3QbLMr7rHZCXZclqnpflXLryrnLm5T3SqG1HgXuE6u44KnNlskG4+7q7FMNlDrQZhsvKiPH6wHS/Rmy/wUEjKKjurP/oILSj/gOuZ4S8ou2FeqPGE6LocDy2jUwnUbSVPAeo23LZZ5lguHwWjOHzWSYYHp9lWlM8jIMb68dzjaAmM+/dmUiStW8imjf/IAnqMWumcaKh73LHgYOhDLspRVD71HGQ/xO1XKNnPhTloRxyghIKKUpGKChwkAZKS/J8GGNHQewhowEvm/vDdEoSZ3lnXywaauYs7+wosNnAU97ZMRD/gbO8E6N4yztvRwB8233lnTNRfOWds0sUhl84vUT4MiqvVo/iIRzEz+jsbe8pPVhP4+ptv+U2UWzT1dueImw08/e2Tx7eQfp9e4SfPbyXbSf0cVdKoh6vNc9K9NPvmKFo1r88AyFVU7Dm03EGomlkNRiepxMQSR3LWyB4SYoqhgFobSGStHuKlhYS02C4jDYBdgaCjOkY1iBYLwlTWoPQ8XTMbQ1i+JDRTnZ+hLjxjl9+29HhysqdYosVbt7Kgxze6n8hgAI5F9uIKXU3Jy+j6EjdZliQTqOoLCVtQalPUWBzknKtV/sSHgVB1TF1OMRZ7kj4zmwzlzrCJzXmVZQwLiAHjktKyUpDfGd1HpUCpzJGbR5OcVW1MWrELqVllFG+kaOsymLoI7snSst6GW8Ci4SVDbrF60fQvdIahMkhtHIV4u5rcQLizrpLSxCZhhmfKa9BFIWoYRFCC3tk6SmiMkJIZKPtJyCiPs637lBwQAW2CKhPn8rTWBaUQ7QrpS1t69ea/29mWWhrEOomBpJFiKwQ7TIEr0ox/LGQaQ1Cy28sHcSqFLJ00XowYwzPEJPoy4/OMpw/5uTH+DqM5flqXPwYE1Gc/BgpwplU/agr+4hlMn0kmu04FSUNB5+KtLvzfkBBnYxOno2v9XZP1evi2cCSUFIa62Ta/h63KEHGwA2C9PSBvqsx1fRcKQn1XuWRrsiJn8uSYA+Ybz1eOSgu64Q0htBDrYJ0suPQJpSRojL6K6jUhmRpG3TrlUSgVnZcwgTbRTas5ytR47dPuZlq+1jekSK/oyAm1HMQBIJ84dX9B6SC1cCBSZp2JFMTeARBkrCOC2BCIODAyvDTxCQuDxAJmWpZ2VxsRe3JxbAuJoNDAqkTQxx7EwhIkujlyzF7U8IqyPDRekYWgKBMVIxKy29jekeQ+p46MdnCkzdnGPWRTPConbAgh/GXxbitjxZk2kGZ2FGuE8+5FyPPFoMQ2ggb52buzFEdGwjnOsp1wrmJKF6DOsG2LL9BnVACy2+boAyW/1vO1+1YKInboEbTxXYIcsag5nzdoIZEid71+ORABvVEJ36DmrccWjgWzG1Q5w2H1i0JNKjzlkuY+bXrcRvUubyjIMighiBegxrOFPMa1LhgzWlQo54up0Fd0gZrCy/GaVCj0ny3QY1yHpuW4zSoJ9WRPoO6yAaDGs7u2q4TZFDjm3PZoNYcam5VnluQ9erEUSjESNcXS811FCK/UoihiWLTBX5rXPTCSUjIr6gbGOo7ynWGerSaOF5licAtgBDjjEu0DPeHpUh63cb2hagUvLiQUSQksWa0kC2OluxwtGSLoyWbHC3ZYrO2LTZe22Czth2OVqPXCnLG0WobHK22wWZtGxyttsnRajsOLYUdjhZtyHL5JUGOFkRxX0LakOWCkngdLQrlHQUBjhYGcTpaFDY4WhQ3OFoULztaFDc4WpPF+BwtihscLYr55cvxOVoTEJ+jRXGDo0WxvadOgKM1uTlXHS1RhXTb7/lQr55zAEaBaOu/3E14TdktSBp9bP0nr5jDNYwvaA2WWeW4FvC2kmTtBSoRoaAi7ao2tR0WVfyLGYNda8gZidE2eG1E4ZVeW/3C7fFtNbLk7NQ4vlc1RqQQ2lGmRbShTAuL4nV2iPaUaRHtqHgh2lEhQnS94gVK4nV2aEN6Cwpywtkhvl6mRbzBgOXrZVoTnbidHeIth5Z3lGkRbzi0bkmgs8NbLmFOr12P29nJ/I6CIGeHN5RpUd5QpkV5Q5kW5ctlWlQ2lGlNFuN0dsqGMq0vLSovXo7T2ckbyrSobCjTolLfUyfI2ckvLdOqcdix1TIkHS2uGl/q7FTlo6yxIrMc5be8s6E7CmKFtWOd775+j99QlObq/xej00hiQCjQmNVuo/6bKvh2oZlfeRCEWVqV2yC+ExiD7DPbFpsjBrIJhoVvKf7ewMA60Wsc6l0v2aNO0MQv/w6hrBelouSHgmxZiOKXBY4SHxm0aIcMvSELRAmju7xGQihlw06T8yZm9DzB7BcYsP5D/7efPnz8/OOn3z789MfH3379X/8P/7phff7408+ffvn2r//589cP5k//+P/v//zJz58/fvr08b8//v75tw+//PvPz7/ckG5/9l349o9/8U3bzCH98P13sf97d3+6K93/yaX/L3T7GyXk77nEfPsbt7/S/3a5/Sfyw183Gf8G", "is_unconstrained": true, "name": "sync_state" }, { "abi": { "error_types": { "1335198680857977525": { "error_kind": "string", "string": "No public functions" } }, "parameters": [ { "name": "selector", "type": { "kind": "field" }, "visibility": "private" } ], "return_type": null }, "bytecode": "JwAABAEqAAABBRKHlCBFHCK1PAAAAQ==", "custom_attributes": [ "abi_public" ], "debug_symbols": "XY1bCoAgEEX3Mt+toK1EiI9RBkRl0iDEvWeRIH3ee+6jgkFVnKBg4wHrVkExeU9O+Khlphi6W9sCQ4rMiN2CiW97D0hN/C+dkkkqj5+0JeiJ5isNMk4TR42mMD5LL2t7uwE=", "is_unconstrained": true, "name": "public_dispatch" } ], "name": "HandshakeRegistry", "noir_version": "1.0.0-beta.22+c57152f91260ecdb9faad4efc20abb14b6d2ece7", "outputs": { "globals": { "storage": [ { "fields": [ { "name": "contract_name", "value": { "kind": "string", "value": "HandshakeRegistry" } }, { "name": "fields", "value": { "fields": [ { "name": "handshakes", "value": { "fields": [ { "name": "slot", "value": { "kind": "integer", "sign": false, "value": "0000000000000000000000000000000000000000000000000000000000000001" } } ], "kind": "struct" } } ], "kind": "struct" } } ], "kind": "struct" } ] }, "structs": { "functions": [ { "fields": [ { "name": "parameters", "type": { "fields": [ { "name": "sender", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "recipient", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } } ], "kind": "struct", "path": "HandshakeRegistry::get_app_siloed_secrets_parameters" } }, { "name": "return_type", "type": { "fields": [ { "name": "_is_some", "type": { "kind": "boolean" } }, { "name": "_value", "type": { "fields": [ { "name": "shared", "type": { "kind": "field" } }, { "name": "sender_only", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::messages::delivery::handshake::AppSiloedHandshakeSecrets" } } ], "kind": "struct", "path": "std::option::Option" } } ], "kind": "struct", "path": "HandshakeRegistry::get_app_siloed_secrets_abi" }, { "fields": [ { "name": "parameters", "type": { "fields": [ { "name": "recipient", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "page_offset", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "HandshakeRegistry::get_non_interactive_handshakes_parameters" } }, { "name": "return_type", "type": { "fields": [ { "name": "items", "type": { "fields": [ { "name": "storage", "type": { "kind": "array", "length": 32, "type": { "fields": [ { "name": "eph_pk", "type": { "fields": [ { "name": "x", "type": { "kind": "field" } }, { "name": "y", "type": { "kind": "field" } } ], "kind": "struct", "path": "std::embedded_curve_ops::EmbeddedCurvePoint" } } ], "kind": "struct", "path": "aztec::messages::delivery::handshake::DiscoveredHandshake" } } }, { "name": "len", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "std::collections::bounded_vec::BoundedVec" } }, { "name": "total_count", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "aztec::messages::delivery::handshake::HandshakePage" } } ], "kind": "struct", "path": "HandshakeRegistry::get_non_interactive_handshakes_abi" }, { "fields": [ { "name": "parameters", "type": { "fields": [ { "name": "sender", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "recipient", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } } ], "kind": "struct", "path": "HandshakeRegistry::interactive_handshake_parameters" } }, { "name": "return_type", "type": { "fields": [ { "name": "shared", "type": { "kind": "field" } }, { "name": "sender_only", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::messages::delivery::handshake::AppSiloedHandshakeSecrets" } } ], "kind": "struct", "path": "HandshakeRegistry::interactive_handshake_abi" }, { "fields": [ { "name": "parameters", "type": { "fields": [ { "name": "sender", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "recipient", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } } ], "kind": "struct", "path": "HandshakeRegistry::non_interactive_handshake_parameters" } }, { "name": "return_type", "type": { "fields": [ { "name": "shared", "type": { "kind": "field" } }, { "name": "sender_only", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::messages::delivery::handshake::AppSiloedHandshakeSecrets" } } ], "kind": "struct", "path": "HandshakeRegistry::non_interactive_handshake_abi" }, { "fields": [ { "name": "parameters", "type": { "fields": [ { "name": "messages", "type": { "fields": [ { "name": "storage", "type": { "kind": "array", "length": 16, "type": { "fields": [ { "name": "ciphertext", "type": { "fields": [ { "name": "storage", "type": { "kind": "array", "length": 15, "type": { "kind": "field" } } }, { "name": "len", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "std::collections::bounded_vec::BoundedVec" } }, { "name": "recipient", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "tx_hash", "type": { "fields": [ { "name": "_is_some", "type": { "kind": "boolean" } }, { "name": "_value", "type": { "kind": "field" } } ], "kind": "struct", "path": "std::option::Option" } }, { "name": "anchor_block_timestamp", "type": { "kind": "integer", "sign": "unsigned", "width": 64 } } ], "kind": "struct", "path": "aztec::messages::processing::offchain::OffchainMessage" } } }, { "name": "len", "type": { "kind": "integer", "sign": "unsigned", "width": 32 } } ], "kind": "struct", "path": "std::collections::bounded_vec::BoundedVec" } } ], "kind": "struct", "path": "HandshakeRegistry::offchain_receive_parameters" } } ], "kind": "struct", "path": "HandshakeRegistry::offchain_receive_abi" }, { "fields": [ { "name": "parameters", "type": { "fields": [ { "name": "scope", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } } ], "kind": "struct", "path": "HandshakeRegistry::sync_state_parameters" } } ], "kind": "struct", "path": "HandshakeRegistry::sync_state_abi" }, { "fields": [ { "name": "parameters", "type": { "fields": [ { "name": "sender", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "recipient", "type": { "fields": [ { "name": "inner", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::protocol_types::address::aztec_address::AztecAddress" } }, { "name": "secrets", "type": { "fields": [ { "name": "shared", "type": { "kind": "field" } }, { "name": "sender_only", "type": { "kind": "field" } } ], "kind": "struct", "path": "aztec::messages::delivery::handshake::AppSiloedHandshakeSecrets" } } ], "kind": "struct", "path": "HandshakeRegistry::validate_handshake_parameters" } } ], "kind": "struct", "path": "HandshakeRegistry::validate_handshake_abi" } ] } }, "transpiled": true, "aztec_version": "5.0.1" }