@aztec/protocol-contracts 0.0.1-commit.9ee6fcc6 → 0.0.1-commit.9ef841308

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (9) hide show
  1. package/artifacts/AuthRegistry.json +736 -990
  2. package/artifacts/ContractClassRegistry.json +344 -340
  3. package/artifacts/ContractInstanceRegistry.json +776 -768
  4. package/artifacts/FeeJuice.json +998 -1002
  5. package/artifacts/MultiCallEntrypoint.json +465 -875
  6. package/artifacts/PublicChecks.json +438 -848
  7. package/dest/protocol_contract_data.js +37 -37
  8. package/package.json +4 -4
  9. package/src/protocol_contract_data.ts +37 -37
package/artifacts/PublicChecks.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "transpiled": true,
3
- "noir_version": "1.0.0-beta.19+e7e4dda4773c63d89791f15e902f7069346ab56d",
3
+ "noir_version": "1.0.0-beta.19+0ea490f9eaf15585e3f55d4c44c154f66436e40c",
4
4
  "name": "PublicChecks",
5
5
  "functions": [
6
6
  {
@@ -37,19 +37,19 @@
37
37
  "error_kind": "string",
38
38
  "string": "Block number mismatch."
39
39
  },
40
- "7259463707251703666": {
41
- "error_kind": "string",
42
- "string": "Function check_block_number can only be called statically"
43
- },
44
- "15015303112667403944": {
40
+ "5920041279672922605": {
45
41
  "error_kind": "fmtstring",
46
42
  "length": 17,
47
43
  "item_types": []
44
+ },
45
+ "7259463707251703666": {
46
+ "error_kind": "string",
47
+ "string": "Function check_block_number can only be called statically"
48
48
  }
49
49
  }
50
50
  },
51
- "bytecode": "JwACBAEoAAABBIBLJwAABEslAAAATycCBAQCJwIFBAAfCgAEAAUASRwASUkCHABKSgQtCEkCLQhKAyUAAABuJwICBEsnAgMEADsOAAMAAicAQwIBJwBEAgInAEUCAycARgIEJwBHAgUnAEgCBiYeAgAFAB4CAAYAHgIABwknAggBASQCAAcAAACPJQAAAu4eAgAHBRwKBwkAHAoDBwAKKgkHAwwqCQcKCiICQwckAgAHAAAC1yMAAAC6CiICRAYWCgMHJAIABgAAAsUjAAAA0AoiAkUJJAIACQAAArMjAAAA4goiAkYLJAIACwAAAqAjAAAA9AoiAkcLFgoKDCQCAAsAAAKNIwAAAQoKIgJIByQCAAcAAAJ/IwAAARwnAgICSScCAwJuJwIEAnYnAgUCYScCBgJsJwIHAmknAgkCZCcCCgIgJwILAm8nAgwCcCcCDQJlJwIOAnInAg8CdC0IARAnAhEEEgAIAREBJwMQBAEAIhACES0KERItDgISACISAhItDgMSACISAhItDgQSACISAhItDgUSACISAhItDgYSACISAhItDgcSACISAhItDgkSACISAhItDgoSACISAhItDgsSACISAhItDgwSACISAhItDg0SACISAhItDg4SACISAhItDgUSACISAhItDg8SACISAhItDgcSACISAhItDgsSACISAhItDgMSJwICAQAnAgMAAAoqAggEJAIABAAAAn8nAgUEEy0IAQYnAgcEEwAIAQcBLQoGByoDAAcF0GESoGFblqgAIgcCBwAiEAIJJwIKBBEtAgkDLQIHBC0CCgUlAAADACcCCQQRACoHCQctDgMHACIHAgc8DgUGIwAAAoQtCgwDIwAAApcEKgwHAyMAAAKXLQoDCSMAAAKqEioKAwkjAAACqi0KCQYjAAACvC0KCgYjAAACvC0KBgUjAAACzi0KBwUjAAACzi0KBQQjAAAC4C0KAwQjAAAC4CQCAAQAAALtJQAAAzImKgEAAQVkvsvHipP/cjwEAgEmAAADBQctAAMILQAECQoACAcKJAAACgAAAzEtAQgGLQQGCQAACAIIAAAJAgkjAAADDSYqAQABBS/SUCsOkdCZPAQCASY=",
52
- "debug_symbols": "tZfdbqNADIXfhetcjD2ev75KVVVpSqtIKIlostKqyruvncwhoRKoy25vwscBDrbHhvDZvLYvp/fn7e5t/9E8PH42L/2267bvz91+sz5u9ztVPxtnP0S68SvdhuYh6ZZ1n5yBCkQK3gFyBfEKYmBKUAimRANTskJUhc04qsJ2co4KdnKhK7CzQ3oVsx3Su7OIQjYoFaIdKgpZAKVCgVKq4p0AoBAUgsJQGIqH4qEIFIFiCV4hV4hQIpQEJaUKmQA1C18cIADqLQTBi6uGQh5QDYUZUA3FE6AaijgADJGFIAtBFhJhGHGLBMOEW2QYZtwCSyBYAinVMDgPqIaBGFANAxNADb12VLAeuwIUgWI9dgEL/gqpggV/BSgW/AWsW65QKhQopSrReUC9PBIBYgWGwlAQakSo8RIYKySLR3s+eT2ZtJ+TLQGl83nVYPSej33b2uTdzaJO6GHdt7tj87A7dd2q+bXuTpeTPg7r3WV7XPd6VOey3b3qVg3ftl1rdF7drnbTl7J3oV7NnsNgQFRGFjRtQUUEHsqhDCaJRx48E0bKiKLILYgUv51HzBEOKefJPGTawt/S8BJvpfgSRPgPlYg/WAmvz5khDSeTlcgzFs7ZHF49nAtuKo8yUwuXBaUgl/49kziZyYwFsaCcxMkPFmE8IDTXmiEKY0lCjDRVDPLTJnGoZ7yr5l/UYpRIlqlE5hz8EAN58Usc2N7c1SHkyWKmmSUtaIr71uQg33bQdx0cOE87zHRm0tdBtUhhNGPjp9VcZwrR0Jl0G3MaryfT7Iz5YcRYJi1mOlPnauhM5btH1pdUZuspw4okt2hFgsOTN3i/zCHhDRZKXORwP1/LHJJDDIkXOiQsRiplkUP2yCLH6Rj8TGMmGUIYrhf+fgo+D5OxcCEiHGL+MuBPurvebPvR58bZrPrt+qVr6+7babe5O3r8fcARfK4c+v2mfT31rTndvln079YjBVlRlCf7crns0ko/Qp7Odvc/"
51
+ "bytecode": "JwACBAEoAAABBIBLJwAABEslAAAATycCBAQCJwIFBAAfCgAEAAUASRwASUkCHABKSgQtCEkCLQhKAyUAAABuJwICBEsnAgMEADsOAAMAAicAQwIBJwBEAgInAEUCAycARgIEJwBHAgUnAEgCBiYeAgAFAB4CAAUAHgIABQknAgYBASQCAAUAAACPJQAAAu4eAgAFBRwKBQcAHAoDBQAKKgcFAwwqBwUICiICQwUkAgAFAAAC1yMAAAC6CiICRAcWCgMJJAIABwAAAsUjAAAA0AoiAkUKJAIACgAAArMjAAAA4goiAkYLJAIACwAAAqAjAAAA9AoiAkcLFgoIDCQCAAsAAAKNIwAAAQoKIgJICCQCAAgAAAJ/IwAAARwnAgICSScCAwJuJwIEAnYnAgUCYScCBwJsJwIIAmknAgkCZCcCCgIgJwILAm8nAgwCcCcCDQJlJwIOAnInAg8CdC0IARAnAhEEEgAIAREBJwMQBAEAIhACES0KERItDgISACISAhItDgMSACISAhItDgQSACISAhItDgUSACISAhItDgcSACISAhItDggSACISAhItDgkSACISAhItDgoSACISAhItDgsSACISAhItDgwSACISAhItDg0SACISAhItDg4SACISAhItDgUSACISAhItDg8SACISAhItDggSACISAhItDgsSACISAhItDgMSJwICAQAnAgMAAAoqAgYEJAIABAAAAn8nAgUEEy0IAQcnAggEEwAIAQgBLQoHCCoDAAgFUig2LZqNse0AIggCCAAiEAIJJwIKBBEtAgkDLQIIBC0CCgUlAAADACcCCQQRACoICQgtDgMIACIIAgg8DgUHIwAAAoQtCgwDIwAAApcEKgwJAyMAAAKXLQoDCiMAAAKqEioIAwojAAACqi0KCgcjAAACvC0KCAcjAAACvC0KBwUjAAACzi0KCQUjAAACzi0KBQQjAAAC4C0KAwQjAAAC4CQCAAQAAALtJQAAAzImKgEAAQVkvsvHipP/cjwEAgEmAAADBQctAAMILQAECSMAAAMkLQEIBi0EBgkAAAgCCAAACQIJDAAIBwokAAAKAAADEiYqAQABBS/SUCsOkdCZPAQCASY=",
52
+ "debug_symbols": "tZfdbuJADIXfJddcjD2ev75KVVWUphVSBCiFlVYV7742zAmkUiKU3b0hJyfJN/aMnSHfzXv7dvp83e4+9l/N0/N389Zvu277+drtN+vjdr9T97tx9kOkB7/SY2iekh5Zz8mZUINIhXcQuQrxKsSEOUFFMCeaMCeriOqwgaM6bDfnqMJuLnQV7OySPsVsl3R0FlGRTZQqol0qKrJAlCoKnFId7wQCDsEhOAyH4Xg4Ho7AETiW4FXkKiKcCCfBSamKTBA1C18cRICoQwiCF1eBQh6iAoUZogLFE0QFijgIAJGFIAtBFhIBjBgiAZgwRAYwYwgsgWAJpFRgcB6iAgMxRAUGJggFeq2oYDV2FXAEjtXYRVjwV5GqsOCvAo4FfxFWLVdRqihwSnWi8xD18UgEEatgOAwHoUaEGi+BsYpk8WjNJ683k9ZzsiWgdD6vGrTe67FvW+u8u17UDj2s+3Z3bJ52p65bNb/W3ely09dhvbscj+ter2pftrt3PSrwY9u1ps6r29Nu+lH2LtSn2XMYAERlhKAZhBOXwHDCNEASjxg8w0gZhCK3IFJ8OI+YIwgp58k8ZBqh7Y2p8BJvU/EjiPAPZiL+x5nw+p4Z0nAyORN5BuFKITDIEU/lUaYZ5LJUhG4m6e8ziZOZzCCIBdNJnPyACOMGobnSjNEhE9XspyaD/DQk2nvtgojBLZmLUSJZphKZI/ghBvLilxDYdu5KCHlyMtPMkhZM5X1pcvAPE3SvA4HzNGGmMpNuBxWRwqjHxm+rucoUGvpDtBoHxHg9meZ6zGEyvWOZRMxUpvaV8K3H7l5ZP1KZnU8ZViS5RSsSHN68wftlhIQdLJS4iHDfX8sIySGGxAsJCYuRSllEyB5Z5Dgdg5/bBh0ITLeaEn48CZ+H3li4FBGEmH+0+IuerjfbfvTBcTZUv12/dW09/TjtNndXj78PuIIPlkO/37Tvp7410u2rRf9wPVOQFUV5sW+Xyymt9DPk5Wyj/wE="
53
53
  },
54
54
  {
55
55
  "name": "check_timestamp",
@@ -81,6 +81,11 @@
81
81
  ],
82
82
  "return_type": null,
83
83
  "error_types": {
84
+ "5920041279672922605": {
85
+ "error_kind": "fmtstring",
86
+ "length": 17,
87
+ "item_types": []
88
+ },
84
89
  "6989792215391248978": {
85
90
  "error_kind": "string",
86
91
  "string": "Function check_timestamp can only be called statically"
@@ -88,16 +93,11 @@
88
93
  "13950240626967988787": {
89
94
  "error_kind": "string",
90
95
  "string": "Timestamp mismatch."
91
- },
92
- "15015303112667403944": {
93
- "error_kind": "fmtstring",
94
- "length": 17,
95
- "item_types": []
96
96
  }
97
97
  }
98
98
  },
99
- "bytecode": "JwACBAEoAAABBIBLJwAABEslAAAATycCBAQCJwIFBAAfCgAEAAUASRwASUkCHABKSgUtCEkCLQhKAyUAAABuJwICBEsnAgMEADsOAAMAAicAQwIBJwBEAgInAEUCAycARgIEJwBHAgUnAEgCBiYeAgAFAB4CAAYAHgIABwknAggBASQCAAcAAACPJQAAAu4eAgAHBhwKBwkAHAoDBwAKKgkHAwwqCQcKCiICQwckAgAHAAAC1yMAAAC6CiICRAYWCgMHJAIABgAAAsUjAAAA0AoiAkUJJAIACQAAArMjAAAA4goiAkYLJAIACwAAAqAjAAAA9AoiAkcLFgoKDCQCAAsAAAKNIwAAAQoKIgJIByQCAAcAAAJ/IwAAARwnAgICSScCAwJuJwIEAnYnAgUCYScCBgJsJwIHAmknAgkCZCcCCgIgJwILAm8nAgwCcCcCDQJlJwIOAnInAg8CdC0IARAnAhEEEgAIAREBJwMQBAEAIhACES0KERItDgISACISAhItDgMSACISAhItDgQSACISAhItDgUSACISAhItDgYSACISAhItDgcSACISAhItDgkSACISAhItDgoSACISAhItDgsSACISAhItDgwSACISAhItDg0SACISAhItDg4SACISAhItDgUSACISAhItDg8SACISAhItDgcSACISAhItDgsSACISAhItDgMSJwICAQAnAgMAAAoqAggEJAIABAAAAn8nAgUEEy0IAQYnAgcEEwAIAQcBLQoGByoDAAcF0GESoGFblqgAIgcCBwAiEAIJJwIKBBEtAgkDLQIHBC0CCgUlAAADACcCCQQRACoHCQctDgMHACIHAgc8DgUGIwAAAoQtCgwDIwAAApcEKgwHAyMAAAKXLQoDCSMAAAKqEioKAwkjAAACqi0KCQYjAAACvC0KCgYjAAACvC0KBgUjAAACzi0KBwUjAAACzi0KBQQjAAAC4C0KAwQjAAAC4CQCAAQAAALtJQAAAzImKgEAAQVhALr8hC+iUjwEAgEmAAADBQctAAMILQAECQoACAcKJAAACgAAAzEtAQgGLQQGCQAACAIIAAAJAgkjAAADDSYqAQABBcGZNfBNpkozPAQCASY=",
100
- "debug_symbols": "tZdNbuMwDIXv4nUWIkX99SpFUaSpWwQwksBNBhgUufuQiZ4TF7DR8Uw39edn64mUSKX+bF7bl9P783b3tv9oHh4/m5d+23Xb9+duv1kft/udqp+Nsz9EevErvYbmIemV9Z6cgQpECt4BcgXxCmJgSlAIpkQDU7JCVIXNOKrC9nKOCvZyoSuws0c6itke6ewsopANSoVoj4pCFkCpUKCUqngnACgEhaAwFIbioXgoAkWgWIJXyBUilAglQUmpQiZAzcIXBwiAOoUgeHHVUMgDqqEwA6qheAJUQxEHgCGyEGQhyEIiDCOmSDBMmCLDMGMKbIFgC6RUw+A8oBoGYkA1DEwANfRaUcFq7ApQBIrV2AUs+CukChb8FaBY8BewarlCqVCglKpE5wF1eCQCxAoMhaEg1IhQ4yUwVkgWj9Z88voyaT0n2wJK5/OqQes9H/u2tc6760Xt0MO6b3fH5mF36rpV82vdnS4vfRzWu8v1uO71qfZlu3vVqxq+bbvW6Ly6jXbTQ9m7UEez5zAYEJWRBU1bUBGBh3Iog0nikQfPhJEyoihyCyLFb+cRc4RDynkyD5m28Lc0vMTbUnwJIvyHlYg/uBJez5khDSeTK5FnLJyzPrx6OBfcVB5lZi1cFiwFufTvmcTJTGYsUkEemWkwCOP2oLnCjCkgD+U0uRTkp03iEEWiRStxl4bnqTRmxueAospp0fiM+QuXyWVMM1tZsIj3JclBvu2gv3Fw4DztMFORSX8GsA1h1FvjU2quIoVoqEi6rQSNd5Jptrf80FoskxYzNan9JHzrrbuj6ksqs+spw47cFfXf7EhwOHGD98scEn65QomLHOJwTsWwzCE5xJB4oUPCZmibLnLIfmjvOB2DnzsgZAhhGC/8/RR8Hjpj4UZEOMT8pcGf9Ha92fajz4yzWfXb9UvX1tu3025z9/T4+4An+Ew59PtN+3rqW3O6favov1mPpIc0RXmyLxa7jUFv09PZZv8D"
99
+ "bytecode": "JwACBAEoAAABBIBLJwAABEslAAAATycCBAQCJwIFBAAfCgAEAAUASRwASUkCHABKSgUtCEkCLQhKAyUAAABuJwICBEsnAgMEADsOAAMAAicAQwIBJwBEAgInAEUCAycARgIEJwBHAgUnAEgCBiYeAgAFAB4CAAUAHgIABQknAgYBASQCAAUAAACPJQAAAu4eAgAFBhwKBQcAHAoDBQAKKgcFAwwqBwUICiICQwUkAgAFAAAC1yMAAAC6CiICRAcWCgMJJAIABwAAAsUjAAAA0AoiAkUKJAIACgAAArMjAAAA4goiAkYLJAIACwAAAqAjAAAA9AoiAkcLFgoIDCQCAAsAAAKNIwAAAQoKIgJICCQCAAgAAAJ/IwAAARwnAgICSScCAwJuJwIEAnYnAgUCYScCBwJsJwIIAmknAgkCZCcCCgIgJwILAm8nAgwCcCcCDQJlJwIOAnInAg8CdC0IARAnAhEEEgAIAREBJwMQBAEAIhACES0KERItDgISACISAhItDgMSACISAhItDgQSACISAhItDgUSACISAhItDgcSACISAhItDggSACISAhItDgkSACISAhItDgoSACISAhItDgsSACISAhItDgwSACISAhItDg0SACISAhItDg4SACISAhItDgUSACISAhItDg8SACISAhItDggSACISAhItDgsSACISAhItDgMSJwICAQAnAgMAAAoqAgYEJAIABAAAAn8nAgUEEy0IAQcnAggEEwAIAQgBLQoHCCoDAAgFUig2LZqNse0AIggCCAAiEAIJJwIKBBEtAgkDLQIIBC0CCgUlAAADACcCCQQRACoICQgtDgMIACIIAgg8DgUHIwAAAoQtCgwDIwAAApcEKgwJAyMAAAKXLQoDCiMAAAKqEioIAwojAAACqi0KCgcjAAACvC0KCAcjAAACvC0KBwUjAAACzi0KCQUjAAACzi0KBQQjAAAC4C0KAwQjAAAC4CQCAAQAAALtJQAAAzImKgEAAQVhALr8hC+iUjwEAgEmAAADBQctAAMILQAECSMAAAMkLQEIBi0EBgkAAAgCCAAACQIJDAAIBwokAAAKAAADEiYqAQABBcGZNfBNpkozPAQCASY=",
100
+ "debug_symbols": "tZfdbuIwEIXfJddceMbjv75KVVWUphVSBCiFlVYV774z4JNApUQou3vTnBzHn2fsGdJ8N+/t2+nzdbv72H81T8/fzVu/7brt52u336yP2/1O3e/G2R8ivfiVXkPzlPTKek/OhBpEKryDyFWIVyEmzAkqgjnRhDlZRVSHDRzVYXs4RxX2cKGrYGdDOovZhnR1FlGRTZQqog0VFVkgShUFTqmOdwIBh+AQHIbDcDwcD0fgCBxL8CpyFRFOhJPgpFRFJoiahS8OIkDUJQTBi6tAIQ9RgcIMUYHiCaICRRwEgMhCkIUgC4kARiyRAExYIgOYsQSOQHAEUiowOA9RgYEYogIDE4QCvVZUsBq7CjgCx2rsIiz4q0hVWPBXAceCvwirlqsoVRQ4pTrReYg6PRJBxCoYDsNBqBGhxktgrCJZPFrzyevDpPWc7Agonc+rBq33euzb1jrvphe1Qw/rvt0dm6fdqetWza91d7o89HVY7y7X47rXUe3LdveuVwV+bLvW1Hk1znbTU9m7UGez5zAAiModgmYQTlwCwwnTAEl8x+AZRsogFBmDSPHhPGKOIKScJ/OQaYS2N7bCSxy34kcQ4R/sRPyPO+H1d2ZIw8nkTuQZhCuFwCBHPJVHmWaQy1IR+jJJf59JnMxkBpFKqYR8cxrhvj1otjATjYWV/ORWkJ+GxCGKRIt24iaNmwjCw12eA4oqp0XzM9YvXCa3Mc0cZUEx3JYkB/8wQd9xIHCeJsxUZNLXAI4h3PXW/a/UXEUKDX0hNO4E3Z8k01xvOQ+EY5lEzNSk9pPw2Fs3P1U/UpndTxlOJLlFJxIcGiN4v4yQ8OYKJS4iREZhxrCMkBxiSLyQkHAY2qaLCNkP7R2nY/Bzrz8HAtNYU8KPJ+Hz0BsLjyKCEPOPFn/R2/Vm2999aJwN1W/Xb11bbz9Ou83N6PH3ASP4UDn0+037fupbI41fK/qP1jMFWVGUF/tmsdsY9Da9nG31Pw=="
101
101
  },
102
102
  {
103
103
  "name": "offchain_receive",
@@ -234,204 +234,8 @@
234
234
  }
235
235
  }
236
236
  },
237
- "bytecode": "H4sIAAAAAAAA/+2dd3xUxRbHk2ySLWmbBDsQerMixa5AAEVBkCIiKq7JElaWJCYLElRgBayoCcVegQQUsSE2sIuNM/YuFsTeBbGXN8Hs7uTeO7N7N788P+99hr9Odu79nnOnnDln9nLWsajuqrsqJk8umeILlE+q8pf4AzP8LHVAXXj1oKpAMBgoK/YFg0tSFoXrB1ZV+Wo2pw5YXFu36KkOKep/qSlxL0lJDJSKAqWhQA4UKB0FykCBMlEgJwrkQoHcKJAHBcpCgbJRoBwUKBcFykOBvChQPgpUgAIVokBtUKBdUKBdUaDdUKDdUaA9UKA9UaC9UKC2KFA7FKg9ClSEAnVAgTqiQJ1QoM4oUBcUqCsK1A0F6o4C9UCBeqJAvVCgvVGgfVCgfVGg/VCg/VGgA1Cg3ijQgShQHxSoLwrUDwXqjwIdhAIdjAIdggIdigIdhgIdjgIdgQIdiQIdhQINQIEGokCDUKBiFGgwCjQEBRqKAh2NAh2DAg1DgY5FgY5DgYajQCNQoONRoJEo0CgU6AQUaDQKNAYFGosCjUOBTkSBxqNAJ6FAE1Cgk1GgiSjQKSjQqSjQaSjQJBTodBTIhwKdgQKVoEClKJAfBZqMApWhQFNQoAAKdCYKNBUFCqJA01CgchSoAgWqRIHOQoGqUKBqFCiEAk1HgWagQGejQDNRoBoUaBYKdA4KdC4KdB4KNBsFmoMC0VwYKQwjnQ8jzYOR5sNIC2CkC2CkC2Gki2Cki2GkS2CkS2GkhTDSZTDS5TDSFTBSLYxUByMtgpEWw0hLYKSlMNKVMNJVMNLVMNI1MNK1MNJ1MNL1MNINMNKNMNJNMNLNMNItMNIyGGk5jLQCRqqHkRpgpJUw0ioY6VYY6TYYaTWMdDuMtAZGugNGuhNGugtGuhtGugdGWgsj3QsjrYOR7oOR7oeRHoCRHoSRHoKR1sNIG2Ckh2GkR2CkR2Gkx2Ckx2GkJ2CkJ2Gkp2CkjTDS0zDSMzDSszDSczDS8zDSJhiJYCQGI70AI70II70EI70MI70CI70KI70GI70OI70BI70JI70FI70NI70DI70LI22Gkd6Dkd6HkT6AkT6EkbbASB/BSFthpI9hpE9gpE9hpM9gpM9hpC9gpC9hpK9gpK9hpG9gpG9hpO9gpO9hpB9gpG0w0nYY6UcYaQeM9BOM9DOM9AuM9CuM9BuM9DuM9AeM9CeM9BeM9DeKxHAVmBiuBhPDVWFiuDpMDFeJieFqMTFcNSaGq8fEcBWZGK4mE8NVZWK4ukwMV5mJ4WozMVx1Joarz8RwFZoYrkYTw1VpYrg6TQxXqYnhajUxXLUmhqvXxHAVmxiuZhPDVW1iuLpNDFe5ieFqNzFc9SaGq9/EcBWcGK6GE8NVcWK4Ok4MV8mJ4Wo5MVw1J4ar58RwFZ0YrqYTw1V1Yri6TgxX2YnhajsxXHUnhqvvxHAVnhiuxhPDVXliuDpPDFfpieFqPTFctSeGq/fEcBWfGK7mE8NVfWK4uk8MV/mJ4Wo/MVz1J5ZI/adww5hAeVnQnygygUpQtYtr4/93mtTNqQNTUtMc6RmZTpfbk5Wdk5vnzS8obLPLrrvtvseee7Vt176oQ8dOnbt07da9R89ee++z7377H9D7wD59+/U/6OBDDj3s8COOPGrAwEHFg4cMPfqYYcceN3zE8SNHnTB6zNhxJ44/acLJE0859bRJp/vOKCn1Ty6bEjhzanBaeUXlWVXVoekzzp5ZM+ucc8+bPYfmUpjOp3k0nxbQBXQhXUQX0yV0KS2ky+hyuoJqqY4W0WJaQkvpSrqKrqZr6Fq6jq6nG+hGuolupltoGS2nFVRPDbSSVtGtdButpttpDd1Bd9JddDfdQ2vpXlpH99H99AA9SA/RetpAD9Mj9Cg9Ro/TE/QkPUUb6Wl6hp6l5+h52kREjF6gF+klepleoVfpNXqd3qA36S16m96hd2kzvUfv0wf0IW2hj2grfUyf0Kf0GX1OX9CX9BV9Td/Qt/QdfU8/0DbaTj/SDvqJfqZf6Ff6jX6nP+hP+ov+5qeS/DSRnwLy0zt+6sZPy/gpFz+d4qdK/DSIn+Lw0xd+asJPO/gpBT9d4KcCPJvnWTjPnnnWy7NVnmXy7JBndTwb41kUz3541sKzDZ4l8OieR+U8muZRMI9eedTJo0Ue5fHojEdVPBriUQyPPnjUwHd7vkvz3ZXvinw347sQ3z241+femntZ7h25V+PeiHsRvvr5quWrja8SPrv5bKyt5fPWVDJ/s+PScH1xRXl1aHG4YXCAfxpKC68cVh7yl/mrlo/rE3+bSzXen2rr/vAC4/0ptu5PXRBe0Vjqv46llUVJq0b7g74Qf7x0e6yBZkKGvd5ICd/eaE2pL+QrrqisiT7UYNEmAc5tFx59TEwQtRquGhcTIlctG9fbcNH4mBBD9e9ruKosJigUBmKCXOHUmKBQeE5MUCg8LybIFc6JCQqFdIUgKVRSnSDJlZIoqdQuFySV2npBUqhdKUgqtfcLkkrtg4KkULtekFRqNwmSSi0TJIXaFwVJpfYDQVKp3SJICrVbBUmldrsgqdTuECSF2p8FSaGWbzeiqFDMtyRRlKvmu5YoKpXvJYpK5e1EUaW8SBSVyvcXRaXy3qKoUt5HFJXKi0VRqXyIKKqUHy2KSuXjRVGpfIIoqpRPFEWl8qmiqFQ+TRRVyitEUal8jigqlYdFUaV8nigqlc8XxWbKTRGCzXhpcItjjNPDy0dUzFgkRhTR0MvEzrTH9oVXDwqU+6pq+E0jK5dGwcsHlpbufPyoJkHDmmHlpTs/bVn4xUPJ5spjKqLqzc+cZuwNlzg0hja3aLapr7LsmZtnpHsU45Btj+21Pw7Z8nHwgMYh2zwOHuM4NP3pEAekWUu6aHKzlgxxKCJRfSBcPyZUUeW3HkUPYBQlD+syP6xL1CK5zW2+zR3roxXDK3ylwqM4RbjqQZ22zIzq00ZqI/8vjNTOWjtr7ay1kdpI7ay1s9bOWq9ebaQ2Ujtr7ay1s9YuRhupnbV21tpZa2etjdRGametnbV21nr1aiO1kdpZa2etnbV2MdpI7ay1s9bOWjtrbaQ2Ujtr7ay1s9arVxupjdTOWjtr7ay1kdpI7ay1s9bOWq9ebaQ2Ujtr7ay1s9arVxupnbV21tpZa2etjdRGametnbV21nr1aiO1kdpZa2etnbV2MdpI7ay1s9bOWjtrbaQ28l800uBq02JiurHNEbmrsbx5xI2EWlrbPHWBmeCw+/spK3hvVtZZP4fD+FsxxfVDA/5gKce+V3JAxYVL/b+umnhC7cyFU9jw28Zkfv1qv9/qp2x9bsOGbQ2j/aHpVeXWW4bTuGU4Yu62mfd1xS5o9rk75rgtFXgahpw13ResFnVEWc5ww7HTp1UOmxzFeVhadWTKNX2UGbstMt2MujOtdbuMDyedZhGg8QZxHTRayqdKMNqfQ7ktgbLyxim0dL1vVshfMml6KDipzB8aFwoEA6EaPmAh/8zQ5pTdwmtG+KdVVNVwfJW/ulpcJLIWl7TFLW3xSFuypC3Z0pYcaUuutCVP2uKVtuRLWwqkLYXSljbSll2kLbtKW+Qjt7u0ZQ9py57Slr2kLW2lLe0aJ1bDmMC0yqD/H2fwv/ZX85+XiHdJ/762mCvG9T7wYPWn8S2trTX79fZRzxvPodv4sYoie5tFvv0MoKj1f6yiyLxJpysyqg4ty3piHLPaDuJzG4aho9gmQXa6Yzhfa2On+MqF7cuK3jG2hcVuZmnzzKGRoLa9TG1H85N0NG9Bs01BWZEYMyQ+OEXC4BjNTRMva+l0TVEN/rJxvROYciZAR7uzx0ToZI9g8bMpne0uHBOhiz2CxSrqao/gMBO62SOkmwnd7REyzIQeCYaz28239rSb0psIvewRCo0eJUPhbTLFtsgKXipbpM5VEb/TfKVmNktgTB7HydKui8KvlsHTlO65WTz7dtdYQBson+ELBkp9IX9jQFvlKwmNqSkvKfaVTPHX1i6WhyfhW4/x+yoHVlX5akS/Ig8EMxYbtuL6f26ua/6x1zJ8iITlRtfoTsA1xjkJVLhGt/Vg3BzJLB2BFox0R2v48ig8KIUvHzE9KOV2kt3mMfdDWjKZuUdMcBQD4rZhiFP0uomfQMa3P8t8U7b4KEb7s0QxKfu7yG7LScZ+i4fOUdmfLYpJ2d9VdltuMvZbPHSuyv4cUUzK/m6y2/KSsd/iofNU9ueKYlL2d4fa77Rpv1O1uD3JLW6Pwts2O883O8QclvZEdOt7TPGLeO2jVz1jjdloDgw8to/wxlb5Go/wzOmXR2FarmCasUfzEujRPKshTKhHTd9SeRU5ar7dWNV2jpovz1G9oBw139xXXkkQtC4WAwX5oBT7KqunB3lHyg+/LCOe/NRFpoil8Sc6raObVFVEZWiJHAVL7+i82P4xjJ1+E7Zk47zNF8Wm3xi1ujOvyZY1/6jd+cfIyiXi5OaxjOWtZm6+OBhWP5xqiWmywHhJnmzyyW3d2UmxP3uIBMNCy1EsNJtzvY39heaVL7Qc0ELzWsUl8sOgArs5mERtgVltgWIYCsU2CbKN8jCoQISZN5Y2LO0TswsuFPclidpC85MUmg+DPjStPG8CO4ZX6QVVO4b3v67P9B5FVDQl27liW6SHvpUaJUnBBA09pdNMcq9gQS+L2eBljrFRw7aZXI7w3FkRH21iFLC0HUIKKHuxIsf4jWG6Xa8S0VEhfZUlw0ZS5YkbiVpMkiyxZ03TJJGZ51amF9JUMku55nNFxeYRymKOlGjvnS9VIZlCbvUU4nBHAsPvab3hz4o7/DlWI5lEIpUj9opp+IVRsJPJuhMY/hzl8MdNSRy58YffHd/7WA2/mznyExj+rNYbfncyw+9u4fB7lMPvsvGuiafFq98jKrZcoG2F4Tf6ePFwrMnH2zwidKlniJM5OiQwQ9ytN0OcyewPzmROirLEXjHNkGbzJ/H9wZXADPEoZ4hLvT94mGPv+A7C1RDH91gNvos59ouiF9hYFk5JEnxfLAmubuzepixYffIvf9XDMkN2FarzVOtMuTC5Ey3pkLqUQ5rXrKus+r2vYtG7zItetmYs8kF3qx+8uOX5oBOUD7qVc04e5Fts/J7kPH9rTvHoUYz1BE9NZoKn2t0YhO8hrb87cgyMztGLpBtDegs3hvyWbAyuZDYGtQ/PUOaX2TYsyUjAi7iVXiRDHTrw4G54ApGj2bLMFm9ZmXG3rFGCZaY3m4TRkn857lJ8Oe6O/+V4YTJhpdfqFEXwJIrTDK9l8u2Y8O8m3wVx11Ch1RFYvH5qo+wni+S7jdhRiXd+Isl3YaLJt9UIFTJHafw1VBgnMZDvR4Xmk1yhm+UHUl7hQMq42UY3ZPFtR/kkydn4wMgtv1R2M3/dFBnlyNsQLVT0sWvUkLR1C4viK5K8s+2QvHZu8VZ4ZmyKGt8K5xvXXON/Bopakmiso35P3S19ET69uWaP5EV46aFI08fZFo/sEd4zNzxyNnPMNnSqK3ab4UX4rNgl1i/hGx/OE+dF+CzjDVmmg2fH2bLJlWE3YIwQw5IxdoBm80vOr37c9HRZbasvm/nFT+770WdrZ7W6orX99jk056Ruc+Mq+g/Ryk3lNfgAAA==",
238
- "debug_symbols": "tZnRbuMqEIbfJde9gBlgoK9SrVbZNl1FitIq2x7pqOq7n5mYHyc6Anmd9qZ8aeLPMJ4BbH9snna/3n//3B+fX/5s7h8+Nr9O+8Nh//vn4eVx+7Z/Oep/PzbO/iTKm3u+07Zs7pO27Grra0u15dqG2sbaptpKbXNtqy9UX6i+UH1BfWJtqG2c2qS/y9bq/70ziACp3+TalqkVPYMnAw/Qc/hgwIAAiIAEEEAGlArZATwA5gxzhjnDnGHOMGeYM8wF5gJzgbnAXGAuMBeYC8wF5lLN4hzAA+yoZCCAXMHbb8SAAAzQs5M3iIAEEEAGlAqkZyc7nDyAAAwwczaIgARQMzsDy0rrvKXlGSwvJ/AAAjAgACIgAQQAM8McYLYUZQuL5egEDDCz9dDSdIJUIerhwfoc9fDABvrjEA30x8GGHBNAuxHOR2VAqZAcwAMIwAAzF4MISAABqDnatbD6OIMVyARqjmRAAAYEQAQkgADMbAO0AjmDFcgEHmBmG7sVyAQBYGYLphXIBALIgFLBCmQCDzCzxdAKZIIAiAAzW6CsQJJdFCuQCcoE2QokeQMPIAADAiACEsDMZJABpYJ3ADMHAwIwwMzRIALMnAwEkAGlgpWVWOetrMROYWU1AQMCIAISQABqFjYoFaysxLphZTUBAcxsZ7eymiACEkAAGVAqWFmJGHgAARhg5mwQAQkgFaIdVQwYEABxqrh8rq8z2BphgbL6mqBUsPqawAMIwAA1Z7vKVl8TJIAArHL95+fdBqvpz7fTbmeL6cXyqovu6/a0O75t7o/vh8Pd5p/t4f38oz+v2+O5fdue9Fs97e74pK0Kn/eHndHn3Xy06x/qiSynzod7Yuebwju+kvi+JFCqihCkCSRcHU/94zliBCx57kD2y0fB7OZRlNgdRehLomQ4ohb/rIjpShH7CkpEVaFhpaZIi/ugNY0+aFV3+zBUJGmKzGsUuiHDBdVRUFdR+gpxyCpdVS4uqVs8jNIMsQwi4Qd5yeQzEos4dC7H2JALDOykZ+BBbfjWh+BZVqREycip5JzrB2KQl7r642rIHMrgFyeE47kPvC6nXOSmSH2FRatb5rqrQpXrnmmO5fVA/CAvfXRtooiRewoaTDYiqC9dzOZxSFls0OUMhkR9w2DGJFfaRONd95LSIDFzQmbnkvudGF1SvcHDJdU7qotOxGvHIDP1tgjloTdGpe9Ig2CE2CZduTDQuqyQblYMc3MuU19K6CZWGZUIzSUS87peBCjI+a6CR1NegSG4fl4wjaa83PYD5MPFFblei5lHV6RF86JKg0/Le0HcBnK5r/lfL+JoX5Hh8Ox9vx8DB8+TL+vGuN8P+V6H11v20mZPT65bazyqFBdcuzLKvNbSyl45UNcSBpmqz4P8vE3p9ySMskTvH5AlegvQH80wstwmdOUo/Z4MZlNO8yY4dDNtaAhtrxJL35Buj8bIQW0nTpFW9YKkGXLq11y+PTOiuz0WI8eyWAwNy2IhXxCL8AWxCDfHInxnLLTz0sYhblW1L45F+V7HwniWm+M5mj3Zl7bGDtalxF+wxo4eQPi24Uihu2cZbZx0Q+3nDXVZs/ci34Kh952xp0hy694r5ZHBYRxcqL+uplF2Omm3rBqWlY4Um0P6K6L4WzN8FM9leTF8EjJPnjx4EiIjhwiKXV8L+c4TgKEhU2w3SUFWGdpTPn2ltOIphL6zkxaI2L99/4tdH8VVO7aF+wtaNe/90I/bx/3p6i3np6lO++2vw65+fH4/Pl58+/bvK77BW9LX08vj7un9tDPT/KpU/zxkfe6ci/y42+gj44ekb8oS2Sd74v9gT72KSz8+rS//AQ=="
239
- },
240
- {
241
- "name": "process_message",
242
- "is_unconstrained": true,
243
- "custom_attributes": [
244
- "abi_utility"
245
- ],
246
- "abi": {
247
- "parameters": [
248
- {
249
- "name": "message_ciphertext",
250
- "type": {
251
- "kind": "struct",
252
- "path": "std::collections::bounded_vec::BoundedVec",
253
- "fields": [
254
- {
255
- "name": "storage",
256
- "type": {
257
- "kind": "array",
258
- "length": 15,
259
- "type": {
260
- "kind": "field"
261
- }
262
- }
263
- },
264
- {
265
- "name": "len",
266
- "type": {
267
- "kind": "integer",
268
- "sign": "unsigned",
269
- "width": 32
270
- }
271
- }
272
- ]
273
- },
274
- "visibility": "private"
275
- },
276
- {
277
- "name": "message_context",
278
- "type": {
279
- "kind": "struct",
280
- "path": "aztec::messages::processing::message_context::MessageContext",
281
- "fields": [
282
- {
283
- "name": "tx_hash",
284
- "type": {
285
- "kind": "field"
286
- }
287
- },
288
- {
289
- "name": "unique_note_hashes_in_tx",
290
- "type": {
291
- "kind": "struct",
292
- "path": "std::collections::bounded_vec::BoundedVec",
293
- "fields": [
294
- {
295
- "name": "storage",
296
- "type": {
297
- "kind": "array",
298
- "length": 64,
299
- "type": {
300
- "kind": "field"
301
- }
302
- }
303
- },
304
- {
305
- "name": "len",
306
- "type": {
307
- "kind": "integer",
308
- "sign": "unsigned",
309
- "width": 32
310
- }
311
- }
312
- ]
313
- }
314
- },
315
- {
316
- "name": "first_nullifier_in_tx",
317
- "type": {
318
- "kind": "field"
319
- }
320
- },
321
- {
322
- "name": "recipient",
323
- "type": {
324
- "kind": "struct",
325
- "path": "aztec::protocol_types::address::aztec_address::AztecAddress",
326
- "fields": [
327
- {
328
- "name": "inner",
329
- "type": {
330
- "kind": "field"
331
- }
332
- }
333
- ]
334
- }
335
- }
336
- ]
337
- },
338
- "visibility": "private"
339
- }
340
- ],
341
- "return_type": null,
342
- "error_types": {
343
- "361444214588792908": {
344
- "error_kind": "string",
345
- "string": "attempt to multiply with overflow"
346
- },
347
- "737457407951538843": {
348
- "error_kind": "string",
349
- "string": "BoundedVec has non-zero trailing elements"
350
- },
351
- "992401946138144806": {
352
- "error_kind": "string",
353
- "string": "Attempted to read past end of BoundedVec"
354
- },
355
- "1998584279744703196": {
356
- "error_kind": "string",
357
- "string": "attempt to subtract with overflow"
358
- },
359
- "2967937905572420042": {
360
- "error_kind": "fmtstring",
361
- "length": 61,
362
- "item_types": [
363
- {
364
- "kind": "field"
365
- },
366
- {
367
- "kind": "field"
368
- }
369
- ]
370
- },
371
- "3330370348214585450": {
372
- "error_kind": "fmtstring",
373
- "length": 48,
374
- "item_types": [
375
- {
376
- "kind": "field"
377
- },
378
- {
379
- "kind": "field"
380
- }
381
- ]
382
- },
383
- "5421095327929394772": {
384
- "error_kind": "string",
385
- "string": "attempt to bit-shift with overflow"
386
- },
387
- "7158692485152407286": {
388
- "error_kind": "fmtstring",
389
- "length": 101,
390
- "item_types": [
391
- {
392
- "kind": "integer",
393
- "sign": "unsigned",
394
- "width": 32
395
- }
396
- ]
397
- },
398
- "9791669845391776238": {
399
- "error_kind": "string",
400
- "string": "0 has a square root; you cannot claim it is not square"
401
- },
402
- "9829419490427811213": {
403
- "error_kind": "string",
404
- "string": "DstLen too large for offset"
405
- },
406
- "10791800398362570014": {
407
- "error_kind": "string",
408
- "string": "extend_from_bounded_vec out of bounds"
409
- },
410
- "11692359521570349358": {
411
- "error_kind": "fmtstring",
412
- "length": 40,
413
- "item_types": []
414
- },
415
- "12469291177396340830": {
416
- "error_kind": "string",
417
- "string": "call to assert_max_bit_size"
418
- },
419
- "12913276134398371456": {
420
- "error_kind": "string",
421
- "string": "push out of bounds"
422
- },
423
- "14990209321349310352": {
424
- "error_kind": "string",
425
- "string": "attempt to add with overflow"
426
- },
427
- "16431471497789672479": {
428
- "error_kind": "string",
429
- "string": "Index out of bounds"
430
- }
431
- }
432
- },
433
- "bytecode": "H4sIAAAAAAAA/+19eZhdR3Vn6+1r93vdrX1ptZBae2+vN73e1dp3a7eMLbWktqyhLYmWZGzIYkEIGQKJZMkQQvKRwdg4Ey9JTFgyyQyfIUMCevkYkoGYMfPFCV/CFsasA3wE0m31u/fce+qce+u+utIr+vkPf09dt35VdepsdepUVfCxa+99/sLE+VNjFy8ef3Dyf6Nnxg5cu/JHGyfOjo+fPTMyOj5+o+q9V54cnpgYfeQD169ee+zTS6v4/2ZVOX5S5Q5oliqggCqgoCqgkCqgsCqgiCqgqCqgmCqguCqghCqgpCqglCqgtCqgamegK08dOHvuzPiYO8Aa1YAZF4C3FN7LVUPuILOqqFerCqhOFVC9KqDZqoDmqAKaqwponiqg+aqAFqgCWqgKaJEqoMWqgJaoAmpQBbRUFVCjKqBlqoBepwpouSqgFaqAmlQBrVQFtEoV0GpVQGtUAa1VBbROFdB6VUDNqoBaVAG1qgJqUwXUrgoopwqoQxVQpyqgLlVA3aqAelQBbVAFlFcF1KsKqE8VUL8qoAFVQIOqgIZUAQ2rAtqoCmhEFdAmVUCbVQFtUQW0VRXQNlVA21UB7VAFtFMV0C5VQLtVAe1RBbRXFdA+ZyC50NRdqgH3qwY84Ax49frVq85AL1cdnAzMB0PhSDQWTyRT6eqaTLa2rn72nLnz5i9YuGjxkoaljctet3xF08pVq9esXbe+uaW1rT3X0dnV3bMh39vXPzA4NLxxZNPmLVu3bd+xc9fuPXv33bX/wNWrk8Ow72i8XD985cmR8+cuXrp+5alNZyfGTl0KXPnw9nOXxs6MTTxxKOfsVc6y158lVf/Rj9nrV8m1/7ErH5rai7m2xsB5ev/Y+Oilsw+NxeWQDmKEhBxC1ZVnpvpyevTS6Mj5C48YQzoF+wTAJ3sOBj5h/oCt2r66+RHwy/Id6r3kTJ4qefw1V57Yff6hx+BoDaZA2Ek57Mzk1tvZc6MTj0xW2nvhcQP4ieHTp18bvtESaOHZ7edOv/bXElljlq1xswmjeTzmwDQ1pv8ZhBNjKQnBLltKwjZumeTznXYaB2DTtrKgyVK2klCx5CKembAccS6VzDdDPvLN8C8Q34RV8k2Y4ZsI0DG2oqhR9Gf2ophR9NHpRg+XrJQ+hhGCskr5Qwcunb9wTSwyQbv5GXlyy9mx8dOTsF971/t/teb5x/5g6drCDyJbf/tbx7+3Pdzz5cIvzf/UW3/69Vev2ytuMip+4dhPv/KRmutvfvjdn3hLz6q60Weuf+k73/jM556r+d4rz77xS532ipvlxhOz198iVz9hr7+1RIO/Tar+rMfs9bfLGgJb/R2gfpeLoJO9/k65+mj8u+TqB+z1d8vUn4X7v8eo/8FDzvEkxPB7i3w7r33lhgu/8/n6l1ct+z9Dn3ym+cb87y/ve/nj2/7Lqz/5mx8J6LavWHGWQ5P2incZkjLwseCxB/7kJ+eTW9/2/Ju+/NKey+lFoy82/MaTx/7qWsPXj/+6veJ+CU45/8uXnrfXP2A0jIjK9/ggUREB2CsekpqbiL36YTnRQHN7RFZV2uoflauPWPtuB7oV/wvbKx4DFWe9bdnF98bfPWv3i29d/5FU4sWvD39g40jhc7/2zoaaZz5gr3hPseKavvirT77zV95e9Y8f/uZv/XDNXwytzy4Zzjb//fu/uPDcxD3zX7VXfL3cUBfZ698rVz9kr38f4JQ2+Zk67pLSqOIJqXaR8ht12S6qeFKOXsmn9o9dujxxTuzNRe3eXND0hCyOUcz8wPL3uOlTCRtIPLX5jZdHxy/CNgysSZdox+UHL2y/34BLHLryoV3nR08bf4iYlZ6c9EYmxnDLEXHLMfvQYqafKKwQt1cAjuWHpvp5bY9Byy2TPTl75tyUr/b4fxt986WxU8cvXxo/fmbs0qFLZ8fPXnpkcs4ujT186eWquVee3T324PmJRybBJyZjB6YHlSZLqsmSGrIkQ5ZkyZJasqSOLKknS2aTJXPIEpo688iS+WTJArJkIVmyiCxZTJYsIUsayJKlZEkjWbKMLHndFGNNRtkevDA+dkuR6PYvawjG6ZOuDinMDx1qa+/h/+rc06tXi7rIIPtyuBQiVqjL8Qp1ualIikpMtKRaTkI+vWty9g8+MHoOqqcjcDFmW1GuYOIATbKxKek4QBMdB1ihKA7QhKm8AlDZ3uxKuWarqWZX4mZXwnHbpmEVLCMgVz9XnFxgKUXoq0xraVZ+AHPUKsO1oZpchUexym7rTpXMONWC/i6/OA3/BiRbATiTRMcDuOMBRrZW4Mjh0yhqdJ+9JGHSz1aShNC2spQplrdGePM6GmK1C/VRjYdY7U59VJdTeysUtbcCfoY4srrEMHvUnDRbSRp2YXpCH6XGVGPVzwAeyA4WhppC7bIi9tso7NQTBy6ftMIGzQAUUSkq0ilGJQiEOhW9+Y7pGGShNkfhB4kBN0F5oPo2vSKYXDUJhnSfsEvvKnnqJ4OZBydGp4KZ2FwJFdXN3zLI0EUNJcGoo61IOhLwJ6WNTjA6J21qFsSttLmXJFRa3txX0+Y+rcjcC7RGmjH3NXLNkrxag5utgeO2TUMGlhGQWdbc10AwzJXZm3+AVWTG0d5n8DAydnt/8/320VQzTFUjG7SRZqoamqmqFTFVDWuK6LmtUT8HtxWQmU03wdZRDJCRAhDse2alAMYwQK0UgMC5rZMCOIcB6qUAJjDAbCmAezHAHCmApRhgrhTACAaYJwVwHgPMlwK4jAEWSAGMY4CFUgCnMcAiKYBHMMBiKYALGGCJFMCDGKBBCkCQCLFUCuAsBmiUAngAAyyTAngYAyyXArgfA6yQAngLF7NwA9CKAVZJAfwyBlgtBSBIA1sjBbAPA6yVAmjDAOukAHIYYL2sK4m9tvjN/1V0sj6LVgVx6NESpj7OJr0gU5+Gn6GkJyrsEYQA9Dr51kAK4cErz97q7Gux0r0Xbphftzyx+/I4se4hK7VaK7XASmhSWlxunmXp9tqm1tWgedg0aq9Vjgna7fRrN3M0bSUdoEf2sk4j00DsPlfZ3ecq2OPi6nWDdcMOfIM60wL7xcyUhXItxo4mXaWdnNxWho2mAwUCMh53zUdtxo66QDBbbn6rKJj/LGCy2zHprfJT22JM7Un3U9sMW6dDodPU+MEdokZbOVHjhEkNkttyVm5rhj8RCTukbNEbMUCnS7UXEBmhwqzfKQ7oJ/SA4kjo2hxXol2iiF6ci+h13fyZMW2/J5PD2iXHhQPycYcu/3NYu1zksBol3bBryNR3Q2eNaK4bN9fNeA/d0AtXDplVDzlHi4EvVQ9Zpx4yo8X0rKjMeDnP+CotmGihesh5WujLBi2mp06L6dFDXy7Ugi+XaDHjdVoIpA98Wa8eskaLgevhsma08In0mHE9XNZlM9VzW1rxiSo+URlqojla8GWHesj5WkxPvR+uARlI7UCB1Jz5s1UQE+0ozHq85IDnMA4f0sHUHt8vBOixd6cH9owMtPa4PNi7urX35is17/ssNbE9eGJ7zIklKm3gN1vtfc3LEbGfvKNgA3lHQQ95R0HeuKMA9WuDbL9kaAhaQeIBSju9TQwH2awess0bZDGfWKQXuvDOKrXtDvY0p7fWA/O5G3ncbB2hgwut6rZU2pRuqbT6t6XSWtlSKSdPplY95AIt3A4fVitLtGAiH6KO8ZnqYdfP1GVaZauvstVXjtNTCRjNNE2kR4BdD2ewYnTLenp8kPHlWgx82Uz1iXzZS5JIMgWx0TZh8mpgDpdP6yp4gDJ9u5ioSLcstnRUpJsNS5ARk26XsdHm7i+3fObvYv/J28S6j4i1MrFRyRhkKxkb7SFjo91kbHQDHRvtke2XDA1BK5x4dKqXuGb1kG3eIFFstAtKLRUbPYFjo2BsZnRUcJCjEGgwPljo/qqXZjP4SkVMzbDsGuaoinEfRrHaXjiKJ/ach+wHsuRbpnLmmdMFUydtjI4AxOmrzQFRTcjpu6zsn4BDN23TnzCHoyzHGjqgonZ7FqIF9pc5rjPJR0LS5NzfkQGOXSTAdAntSM74YN2dPouXIPmyBQLYyozzGOZZvF7rhYSfsFxIeOCB0Ymx0wfGTk2MTbIDdaFcjizpIEs6r0tdyjbJ6jdIrBhZ0kyWtNpLiuS8UcJ1dFMCSW3RCPyEZt8vU2umfYF2RbsnzZin2xmzLrlpQ16F0iryJsC4kbvmwtKxt6u0Wnw/pB26C4FhLMFdpgJ2v/nUBWzhtLrpQ+oGqK2kxNQ0M+omabGYt7k9Sl8biiqwnWyWuFAKaGTRyermQva7Bvgubm/TzbZplcy2qdwCYdYLXhYIvm+bdsv583J+86w/9ZZTgBZGG2AZAZlnBd+SsYDZKF8IHMO8vQHykftkkQ1Y9A8hUeyGmlaN1275rFR2rSp50dRQ6nJwkn1ohUJfktbOOIcp8oS9qaLGSA7zpqLyhezHDfAHECOAG/NIOym467SJYYRq+Bm+xNPNGeJ/HfvUBRkvSJI3PFwH1uO/F9TDekE2auRh19AU5OEUUPyEm8szs5qHvrpyyI6S5zSPKTTdMjKrfYy09hdrHRbzCHcVQI9xpvwD7q8CaIL9sktnuwvpbOedZ0Y6BS+PtbuRzh8uW/8gTqykpTPvu3Tm3eVyliKdeZHPQElnL+wamoJeF8a3FzfXy8xqrwvp9A7ZUfKc9mIKUdLZDwlsKxsoQTrzXqSzHfaLIYK7pz8kZKZXjr6N8jLT67/M9LIyg8bcJ9fs0itPbxwfPfWGjecfvvLhg+f3j54++/DjQsXaLeTqPouQKp7bpnKd2yb/5rbpts1tu9TcUjelC6am3fepaaenJqVoagQeQYqZmrzs1Mh4f7Sn5cYK9rGr6rzFnKCVT18h8AJr1rq8WcriYuq5ktlnqYuQ1Ufl14PTGNvFq8HHDehPIH+zx4W/KXnQodqyUEGWxt1q8NMXSO++dP0aUqpf8/7p1zzpb/bBrqEp6INTQEkabq6PmdU+F/6md8iOkue0D1OI8jcHGFMxWIK/2evF3+yB/bJLZ96FdEouwat5H8jdarD5QdK7n1WyJ+BBOvto6exVJJ19rIWgVzR9eAr64RQQzfXj5vqZWe13IZ3eITtKzoTyJp29KqWzw4t05mC/VK8YOsp1xdDhn0XruG0rBsv+ztP7b/NqsLLS93Nuc6WsBrmFes73qcn5v1DPyS3UuxWtBvncxByzn0EHMNnVYLfF40Ern95CMMRuQXR5c6mKi6mfO6/lghFyjrys5XKF7IQBHZcxJ5JzHFSaO6DKnHSz5oS794E7jJ9Sf76/idt9TynafU/Bz5DboowVskpZIecfK+SUpZFUZRSlkeRhmScV1+Oo4pb5qOKCi3283MUDY/W4O6SgeEu+W10kNeMtktrDRFJ7fIqkBlt8jKQG1zD+slu2cKWKu10Yafognxcj3V3IHjSguzlL0MNFY5sUmaUmho0UbuF7kOY7voVf6sIsIyUDT5MLEstihQresNJsWflgluwvBLex4dcubxHdIpePMLH60qU575GDe33nYO2X2RmpeQfjpuOdvRTkAMvBfRAMc/BAIXiUDVF2eYt6Fjn4ABPPLp2DexkOFtije0nV78Ue9RSynQb0Cc7k5Ln9h14fI/7hGRTx9yE8360eskc9JOYuH7YUc/Azpr1uRe11u2zvdo9P1a5vj8v28oray5fp+FoVtdcKP6O2xAQKtd93X6afVqh9ihRqP08re7MDinyZAdzsABw32mMEZQTkEOvLDEAwbJCHCsFrmDMGXfgyg3gkg9iXeReZ4a7Cl+lnOFjgy7yHFBwvvkxfIdtkQL+PE9h+hgilcpoH6RqgpatfkXQN8JbZ3uygIukS8iQYt20ahmAZATnMStcgBMMsMlwIfhhz7ZAL6RrCIxnC0vVBMkNdhXQNuONgFWJsiKqzED9PTr4XIR4sZKsN6D9FQrwdUoMj0HZmVNslbNB2k0zuRSvvWGmHzPGRXYx22u27dtpNa6ddirTTHkyNXYCE8DKJPzcvk7g08cjw2MW29p5NY6cmHrnA3Cax88ofbhsbvTA8MTH6CKDrngxZY/d14U0MT96CuCYo7MmgP06N6Ia46f4McVnEdvH3Axnx33dkbnjolEMVB0AkszsLwZcMmf2kjOd6R3eF+vzbFeorv10hN+v3Abe7QkQUruBnFO6v3d+jNEjaL2Dqk/ayYfMnujxiI1yl2cpGzJ+d9rJN5k900dRm8yc6Cb7F/NlkL9tq/kRxt23mT+NmoeB3uNDdLm+bwGiid8HPbnd7VODf9FJekT030cN5KflCdpYB/VX3N0P1wf7TS8vdFbZ9jW1FN2YFf2h88D187wKlEVKII0LzuQtp+hRdSNMHP5O8bMbQYkeFV82E6gxC/LRMh2LQHI5JNJSAkX7dJdFbw8pu5cbfzN1O12zzi0p0UMj0x04hYTZb1A0iTGchFC8Spq6HJsyBB8aJxLfNVKUOYX+28hPVUQilnSeqg5moo2iiOuBP+0R1wkLLRFFXk3xw74Sdo2ktB/R0USnMce9kNGGVMgcrJACEVBKAMpUSJnuyEFpifLCwpA4ulxPcbRZVb701EgrR1NKIAI5P3cI4VS6qmEQznpSe8Sl865QnYa/NkYuMSajL+KBJ5lxwXO7qoOvy65a4/+eC43LnguUS0Gc9Rs+YIAGdFpNWWEapHHbd0gTBhFotx+7FkJpOeGGgfd0SanbvpTRjib1XJpG703e27PQ/kbtT7lxQjyK25LN3O5ns3U6fsndDIz5m74YGyMvHVESQLZbbMYYc2ubST8EY24QSnfm2Ab0TuRytzLR2qCRCB2yT0iFOhpdM9eycvrXeYlxbTd0i9CcPluziVhm3aYuCbWiqBT7OYZe0cDfZrYXMPxrQd6PJTjGMmCTX6c2ift8r9s0eNj44LnOYLOm7rk76f5gsKbLltK5OKdLVKZHnAsZNzyZ50WyO1dUpi40WHL0KjWPxb3ahq/k1eJGxzrh3+lvJ0CfQRkNY9xs/h5mzUhuZq1BHGAu5iTmisJmJkW1hgthbmaPh2wzKkW/xHmCdX6LSQfb8B1HpEHsayTaII4zGOOq7xjhKa4wjijTG3ZgaR1Ru9R0W75PdXZjUJlSdo/KbfVNwEtt9B7jmm8V1DhJbfocctvyorine9DtcCP2eIWZvI3dgZpVsBTzwcYrm40FFfJxis61KvJeftnxCewHGTd9QQZ8sZS1fs0VrCc4zha6yiahdEufQc9jy/ab7xfN20vLtYCzfTsby7WIs327G8u1hLN9exvLtYyzfXYzl2y+yfH+JXOF7oMolZuUePCv3MCucI/Cz290evcVD+39DjIQM4/Os9PwfYOb/IDP/h5j5P8zM/93M/B8Tzf+zZCYbscpKcausoULm7wzoP3a/kBqEc4cEFjgetMg2MyKbY0S2mxHZA4zIHmRE9hAjsocZkb2bEdljQGTp5XMSry0BkemY6XZmGbCDWQbsZJYBu5hlwG5mGbCHWQbsZZYB+5hlwF3MMmA/WAYIo/8mS9+8048vcVvXAMAxYBzGh4oHIdN4Sh7nzg0PYmdnSNGm6fATm84+ZI+vg1aIahvxltCwi2qDU6+bka1tJNXpU+I8ZGNiRMo09FWD877CvcGQltpEccV5Te5jCTmG87ox5+W4bF1yJNvZnFtuJNtJD1BF8HY7M/i0yobSgJI2+u1wIbmCTOId7iR3Bw3JyZ0gS2Kn1LtGezDALimAV7g0aDcAf4AB9kgBrMYAe6UAPo4B9kkBbMYAd0kBfBQD7JcCuIIBDkgBHMUAB6UAVmGAQ1IAX8MAh6UAtmGAI1IAn+DCfG4ArmGAu6UAfoABjkkBXMcA90gBvIoBXi8FIIgx3evmqlrxw1L3SbUduOIl97iDSeLsZJI4e5gkzg1MEmeeSeLsZZI4+5gkzn4miXPAcAoysju7gxY7JtrbNfIew3VcOtl2VNgJja69MA1BiD6nsa1Nu9v/Jd2ftNB97OSJkC6E1xpEWEhuAQnkIi3nmqflY69p/58JTLN5N6XeRpySSGzsYJzEThez38XGXjsgGOaCrkJ4lSjzYpoSxyUSbDpR5DX8OnIzG60T2vFaoIWsfYIJVnRgZNBFEjvOrG5ysCE6vtcOVjFoZQ4aotfmOSbq2A1W57avErAhW1kLbMhW1gYbMh9etn0VgA3ZyoKwIVtZFDZURB/kYiRBRTGSIEPtOKPYEnJCHpBXbAlascUVKbYESyuaLxPsS7ghjlpufJx7uOwVNwBv5jYB3QCs5yyZG4AzXD6rG4B1AgUcKIT/xZCOfUg6AnAWiRkP4BkPMNIRh58hWaelIyjHoFvkpSNIS0dAkXQEWVrZqBGCXUN0DEFRIJoL4eZCzNQAyBr1kEn1kBn1kFn1kLXqIVPqIevUQ9arh5ytHnKOesi56iHnqYecrx5ygXrIhVrMeJ0WM57RgpYLZ6pW90FfLlIPuXim8uUSLfiyQQtIH/zLtBbTM0cLTbRUC7XRqMWM12uhL30Y+LKZaiiWa8FE87SwkHO0YKJlWgx8hXrIleohV6mHbNJiepZq4RPpsdKt12J66m7jjPOhZ/f9iBNH3Z41j7qNnz9z9eoN4nbIPeIjYcHNxPdbxd+HZt0QHfNiz4Btdneo7FbejXE5WvWnxPsmX8d7FJLZAVXMOfRWbi8mqGgvJgg/u93tUZDCbJIol4w8ORk/NjaxvksCO13sFRVD/8D5vqgWTIagyb92wrbAn1Q2/AljQD8lv7kP77YbiRNmbdFtZREzSeJn5CYcfTB7B97KN0qmcSPzrjx7i1ivSdPeCzfMr828KUHXDwgzpiJxAzjsnh7tZIdzuMP13N1dLUCyuzq469g6b6kP9EkOfm0BI+nUOZXOL+QbwYPlLcV0weVf/PPo//+vvx3603949fybfrDm+me3vvu//1HfY4X1A48e+Of3fHs3My9Tpw6I4bu810xAmxZn2rSThHYUj8lpoxNGmplEnXYmHSUHuLjEG4qqwhihSw4hUvIbp9GSr0yJC3VjpNUg1BJSwgR7+YHS0tlc7OUH/H+iNcCe/i01fyEp4cdZzCqdBkWa3FY2hS/IW8jWQmQttvRRxxS+KB5HFKXwRZo8GL8d7s1AB0r7i7yxbBwhxqk4ynWSRNzAIB5GiBvgTwIxzyDey12hTL6n1MuydyfC7IU/Ccw+FrOLe2aFvHm2n8XEJxj74U8Cc4Ch5maEOAB/uj8TGYQ2gDlnOUieFmR6uQUhDsGf5CFJGvEkQhyGP8nzk9y41yPMjfCnhCEL+m7Igv4bsqDM7T4jsGtIr4240EIjuLkRRlWOuFBD3iHz6iF71UP2qYfsVw85oB5yUD3kkHrIYfWQG+kTHOiId9QMNVCuhMjBMyo9zbl3k07+A0YAJCcXWzkJHS1K+YiugAQhCNyjYCHyINbEUXWhtyiz6qSPN7QyBz/a3HmXOUXeZc7ymSD8E40ZHXroFyjne1Ml57vMcnIqOd/qICs532W9e1vJ+S7rDOBKzndZ03LG5nzPm6m0rCRolzVkJUFbHeRiLYyuDzOuR8pUJZu6rKWnkk1d1tNTyaZWB1nJpi5r21PJpp5proG22dQj/mdTj6jLpp7ckUiWnCXGbem4yDbuAjmcdCpR0AR3u9dgTDC50xBUtNMQZfIoBIlhT5H7Ls2yyYHS+y7NNDWiiqjRzCaY0YmhzVgjtDpms/HvaFYAZzqgPeMZ3KzXPp0UTbXpdGyB3Fpvc3ogm6zZzmQE4dTDdviTSj0U9uUo7AvSQnmp280ewgC9UgDtwuyH9PuKliva4tGI4Oc7w1BBE6BhPAdhhteC8DP3kDmTLZhOkogRBhFnlEbgTxGxk68axN7gkdi7hMDxCwZwn5scFiH0biTF8P7JaSlG+/m0lQ37ft9jmLayIUVWNsz61jZqRGDXEAtHIGGZXBA3wnySI7cbgDdhgIgUwBu4HCU3AM0YICYFcIB79N0NQB4DVEsBtAiFMTZqCOMeLvsopCj7KAQ/Y1YZbka0387ScxkBXyYnY78mL+DLaAGfq0jAl2FizyUFfDXsGpoIUEqmL63Gza1m5hZA1qiHTKqHzKiHzKqHrFUPmVIPWacesl495Gz1kHPUQwZmKl/60Mul6iHzWgx8oRas7gMTzVcP2aCF7ZmnHnKJFky0RAuBbNAC0gfPLa3F9PjAl2EtzJkPmqhRi+nxYeCL1EMunqnSs3Sm+kQr1EOuVA+5SgtaBrXwLzNa0LJOC5d1jhbmrEaL6fFBXy7QwpzVz1QL2aDFwGu10EQ+CORyLZgorYXRrddCE/mggptmqnJLz1SfqF6L6anTYsajWkhPTAvlpkcgwgf3P6MF5GIt/Mu4eshqLSAXamF7arVgIh+0eiUHpqyZKKqFA5PVYsbDWmgiH7zgiBaGQo8AWf1MZaIGLZiIvEpVkAEMklKJSoIzmyBVXeXxy8DNt8mdvwx6OH852YbHA5ia5VxvwgBzpQB2Y4AFUgDb7XnOS4pDLz3r+4qN4kVgg95GS6AFMut7iX9Z30vM6bZRYznsGmIFUEpmfS/HzS1nuGu5C4/XO2RSPWRGPWRWPWStesiUesg69ZD16iFnq4ecox5yrhZ82aAFpA+aKK3F9MzRQl8uUg+5eKZOzwL1kAEtBr5CPeRK9ZCrtKDlUi20uh4Dr5upWr1xpqrg+pnquWW1oGVei4EvnKmsXqOFCp6x7n9QPeR8LcxZxc0qa4GcN1OZSA9vo1aLGU9rweo+qI3kTPWJmmaqodCD1edpoS/1iBr4MONRLaQnpoVy08P9b9TCzfIB0ocNBR989bh6yGotIBdqYXtqtWAiH7R6JRWkrJkoqoUDk9VixsMz1QuOaGEo9NijqJ+pTNSgBROtoyADbG4mUel2Jj8/ehuSnx/1mvxsy11dW+ycIJN3nVwyrT3toghsUN5oCbRAZvKuVZTJuw5P/Fpz4m3UaIFdQ8wJSslM3hbcXAvD7y0u3DfvkEn1kBn1kFn1kLXqIVPqIevUQ9arh5ytHnKOesg1WtBynhas7oNANmgBuVQLGU9rIZCLtRBIH2Y8r4VroIcdn6NFL/Na9LJOCybyYcaXaGF70uhY6hrzJ5kQtga3t4ZpLwg/cw+51nF5LVhlBUtcXh8Sr5bXrCS+PyL+fl2V/Op6pcziugpNHKByTiIeEWQmLmf5DD0q1VaIf6u4xo//rX1V28is8SXfXk3Kr/GD9Bq/UdEaX0DMRnKNb3l8EBHaeGOQfART8mHCCmAFsMwAbQJh3GNwH/lG8hF7ySISbbVZZ1ohJdahhyOBabO+tcw9Mblm+olJ+ydRSpuVgWJuLcS/P9Xh8fFrhdqu294h95DGs6X3cp2U8UNARzo534Z0RNaymJiYa+FP934KwOxGmOvgTwKzmaHmZoTYDH+69yJBL3sQZgv8SWC2Mr3cghBb4U8CsY1BPIkQ2+BPCQcl57uDkvPfQcnJOCgbYNeQfINS+rVp3NwGRmUAyIh6yKB6yDXqIdeqh1ynHrJZPWSLeshW9ZBtFOTqJw5cPmmF7DD3Wyn791zxqeviW9o58fvw2KAHC4nlhkGnbbbwufct0Esiakamn/f+4KE2gb2/T9CjSCGxGqvNNXKaa3IRe3Bi9MK1xwT6cQ3pMJ7AbuHTpr8J3D/ao2hU5PY08n5YoJD4nNGhNu4GsLhE2gF3A1gcfkYRsPQF+TalC/KAfwvyAGnvQrBriI6glNx0D7HJHRxkjXrIpHrIjHrIrHrIWvWQKfWQdeoh69VDzlYPOUc95Fz1kPPUQ85XD7lAPeRCLWa8TosZz2hBy4UzVavPm6m09IGJFmthzpaqh8xr4Qzq4bnN0aKXeS16WTdTzdkSLaanQQtIHzRReqZqouVaWMh5WgjkHC2U2zItBr5CPeRK9ZCr1EM2aTE9S7VQwXqsx/VYUdTdxhnnA+Tu+xEHlRSeYQxulTvCGPJwhHGr1xOMwt2dv8U7KWF1W2BhbseoUdGOUSP8zJ7kBNqLTudBobzGp8hNpYgcKdLym0oRelMprGhTKcImvKHUNdA1RGpQSt6LH8XNRZnZi8K5UgXplANYAawA6g1oE9uIqVrcqiC6mQhUFLS2LL0hA+woshNRF3ZCknqN8DNHSKNnRhmZexJn0mKOWvqGLHC8kPhpMS2mjny2Lm5NizH+vt7FiBKixJg4lxiTKCSrjD4N2BnASCYx8pSTAdl+ByFRRURJfsEAxy5EnDVREfihgOMAxezAYVhVTfZ4HH7mHjJq+o2UURfxnEh6wsLUp2QN4Dq7zwTlf9pnevZWL177x94LN2Dnd18eF+ihg4i6ALVawlWJMNSthp/RGhG5dQk5zyos79YlaLcuositS7C0slEjCbuG6Jh0NFRJ3FiSmRgdAG+bjQPsamsoobKhhDthUOEeGBYAcZnCZpKmjUICnLqllnjheU/qRcELnmk58duAs8ynu1VlL+llWKoPzpOtrJ+ZuAFID1vZIKCHmN5VdnpXQToUDcDwNDD+pgop8ZQLE5nCkphyZyJTLpyNfrJZZ2dD5IGlCsk/N8CHuJRbMkExKp17HC0kN2PWjKsLvMRLTpAtJ8aXZu6gwdy/IsHcQTgOZkGSkHRJ+ZOzCdiGpDtr6MgT3GASEp5n0PQ8Gfc4LONtReUYLyDvbUX997airLdliSH/GYwhj54eGb1w8fL45KzZIsOA5MLYcHTWY4LwbxsV6L1O4r+OiElvomLV163Q4n9Zo88eqLaVE7EotygJOi1KgvZFCYPLnIKlexAljtQGKcYTSIXhwnzh2E+/8pGa629++N2feEvPqrrRZ65/6Tvf+Mznnqv53ivPvvFLXfQw41PUFY4kwq2+GhWtvhrvZHvuIRtphou4QIwyiEd5Fna/cDMQDyPEhAs9nmQQ8bnkpAuXJiVCNH52cn4hefYgzWLic8lp+JPArGYx8bnkaviTwKxhqInPJdfAnwRihu0lPpecgT8JzCzTS3wuOQt/2rVWrflztXiPrI4x7/VyFrZW3rzX0+a9TpF5r8fUrCODKbNh15Camg0tL9HcbNzcbEbzAciAeshF6iEj6iGj6iET6iGT6iFT6iHT6iGr1UPWqIfMqIfMqoesVQ8ZVg8ZUg8Zk8gIqSNWXx81V18Xp1qaXn5dvSqxQDJK4sRV5Vl+iSReomUlRhd03AAKsRtAQWgxcPwpVEg+z2wAwdpih4A7iR3yfb0f8v8kdojNQaKvRgs5hH+85bWpZnAjAkBcrO+FvWGqGePKxyWWB2l3YeO0OKz7P8AFUt5jxuvF4C8a4vNFiQHBtEPXC6807Be78KpsdpS02eF+SoB6RjsWoJ/mngUbMGaW/GGJJX/ChZ5JsVYjASdAyPb/AK0GzYqNivaGGulZdyHDxmpYOJT/60mCG/2VYKojxBiTvJ5KF5JfBaO0cH4QMmNRcUyXhWTTXottvGQXB0ODhyWiLWlHGgsCKjWQKoiRMhY1yWyypFn7Ta4Y4x51RBwkUdm+Wse4WOvlJqhF3sVaT7tY6xS5WOsxzdaRLlYL7BqaosoLM5UXZlRCVl6YUQdZeWGmrAWy8sKMOsgZ+8JMjRYyntGCL32g5QIt+LJOC60+Yx8AqjxMVdYyPmP5svJMEcABn7mHXOcYb1nPhDcUP1PULPdM0XoPzxQ1l/czRRQkEQPsMHPHRNdup369GGJK3VsWD3ukTt7Bhz1ET0ClzpRVhzYUUuN3sEOlnhvoxTtF1B5SP+wC2gsyuLqE7P9vMbs96P0d0C+CrmuZS/MPk5PBnA4+bAESSe9bvF6avxl0W+XBldSj5XJpPrgvBm1BgjzPduay/Qh+UcX42WzozWucEEYVCaElD931S1PGfTrHMQWoEvoNqkayZDXsqK1srWmiXVFstSKKreb1aKCQHjA69J5foKcL9srv5lSeLjB/Vp4uUAdZebpAHWTl6QJ1kJWnC8paeipPF8w0rV55ukAd5GItfKJ6LWR8qRa0XFAxFDPMsa68eKIOsvLiSVnzZeX9i7Lmy8r7F2WtLyvvX6iDrLx/oQ6y8v5FWavgyvsXZU1Lbd+/2OP/+xd7VL5/kR4ueTuO280Okhdazir53Q0P5+bD9DZgUNE2IHelYIn35AXEPBT2+568u/y/J6+Eixhd3N1AXiAXsN6TF+Rww3Ai2HvyIAxxT16AYjyBVBj35A18LHjsgT/5yfnk1rc9/6Yvv7TncnrR6IsNv/Hksb+61vD14++gh/napXDCkQRve57C7W7PPeRqmuGCLhDDDOJRnoWp7CQG8bCnm/fiDOK93Bl9MkMkIUI0fnaqus0PYHapus8PYHarus9vtZl9xt7mZ9cHNebPteILZzKM4czK2a4aecOZpQ1nRpHhFNznlyHzZ2ph15ACqIU+JdFcLW6ultEpALJaPeQi9ZCN6iGD6iHD6iGj6iHj6iET6iGT6iFT6iHT6iFr1EPGJPyGDOHeK72ILUKsN6u93FRV7WV17fEiNounK7qILf1bzEVssLbYLnILyjt6EVvQv4vYgqRddH0RW0Ai5TfoI4MbS0zxPYMlX8RGJYULuEXyWpeV8tyyjuaWakXcsg5PXzXJLeth1xC3rHdhrQTn4tYzGna9C6XtHTKpHjKjHjKrHrJWPWRKPWSdesh69ZCz1UPOUQ+5RgtaztOC1X0QyAYtIJdqIeNpLQRysRYC6cOM57VwDfSw43O0EMh5lelRBrlEC0NRznd3VDvu/q9zv6It9e6OJrm7O9Z5uLujSdndHWFF221utxPv4F0hxqaZ8YH4toHqqmLoIP1jHc+8xyB0MQjSVBa3nlSHy+zWk+pEmd16Ul2j8a0nffgO/OmWq5hb7nP4lntDVIXRNeW3nsRgv0i6erj1JOr91pNooXqJ860nUadbT2jlKLr1JGqqG6FmfB1mkWp1eWLVnm49aXen42KKBCbGS3CgUP0Zo0Nrf4Hu29gqH+mu3Ldh/qzct6EOsnLfhjrIyn0b6iAr922UtfRU7tuYaVq9ct+GOsjKwfmydgZn7MH5yn0bZT09lXsNylptVO41KGtzVrnXQB1k5V4DdZCVew3KWgVX7jUoa1pqe6/BFv/vNdji9V4DtL8RMI5M8//FBFsjLqsmrOR9qdWk70Oj42dPj14aGz53+jVO2HzujZfHLo+d3nP+0tjFyT9ufmjs3KWLV68+Ln1KYoR8xp6+MoAqCT7u5vC+87+e2j926fLEOfF+2Gd9vlyC2WOLKdpji8HPmPbCitqznNFhjkNF5I9DSd6vEZLf9rvj92vYqBGBXUOkjkDCEs1FcHMRZvYiUIiVQ4YEqg5qUEeqDpOpRKWzy0ml7BLyj11CpbNLQv3c1qiHTKqHzKiHzKqHrFUPmVIPWacesl495Gz1kHPUQwa0YHU9pGeJesjFWtByqRYyntZCIH0Y+DwtelmrhYz7MOMLtRDIBi1m3AdWz2vBlz44MIu0kB49lJsPA1+hHnKleshVWtBysRZ8qYcXXKfFwH2wkD4EIhZUXNYZJj0NFaNbzgPXw2XVQwXXa6GCa7WgpR7+5dqZ6l8u10Jt1GtBywYtBFKP6fFBX6a1cLP04MsFWvDljDVnvbfRnAXY7XhPKR8qL/AJjBLfHyaeXgnKp7mNyqS53f4UJ/+uEVgtnyCi7TUCq9WnjjZqkTPrw9kXH3K59Thw6kP+sQ+HK3zI5a7RYsZn7AlwH1hdj4N9lTOsZU3L+VowUeXMf1k7MJUz/xV9OUOmh1RuQXBB4DTSfcUfJ4TXA2bqSn59Zw1+y4ZeekZksaWXnhH2cAC5LIUd6+qgO/bBkffH++8ZbfYWeyEqRfl1v72vMTkirrLeqmm5DtdSEsJUnC4Jw8Zv3XC5E/crKtsvGRqCVgQRrOl+Hvc2LcWjaoBRgDTYIzknzJ/kCegTuL0TjHA3wc9IyN2Xx62Qg+ZP8oXek09sOvuQvSfO1UafEj0KdhK2jfXJaCGzsHgBav0KzCAn5RhkKUY4LYdAXqV6Cs/PSdiKTYeMmopGWiGdopXOqKJYmGA0owy3nYKDdg95yi0kmrVTimbtpGicoBXbrFk7xXR5pXoqLFQPuVM9ZL16yF3qIdeqh9ytHnKPesi96iHXqIfcpx7yLvWQ+7WAPKAecrZ6yIPqIdephzykHvKweshF6iGPqIdcrB7yqHrIuVqYs7vVQx5TD3mPesguLSBfb3cjT8o7/3RDJ82lKvJWFTZjIZGtIeMNjCP2kk7z55C9rMf8iW6j2GD+3Ggvy5s/R+xlvebPTfgdEuPnZntZv/lzC/NKyVZ72XHz57biPUSZhykWOm19qAPQz/jZLlgEny5k/tAAfwuKHlgWLBTzGnG8HmHF1wuaPVXIvNVo9lfJOUePEp0wGbJY++1cyOMkCX0CAOD+dRQy7zA++H3xB+/ES8dRddcOjaJhgZnczk0UmVR4kmARUHe9YKgnC5nfNuIkdHiuwyCHEaCTIkbaeFjnJVKnhaUiJE6BzNMirQuogvTUachjBGgHE90gH7c/wT5uP2phXzQ/JwqZ3wWP26Neb4c0QaVpCG5yvPvRDZqjQ88sAWhb2RDU47ayYajHbWUboR63lY1APW4r2wT1uK1sM9TjtrItUI/byrZCPW4r2wb1+DRZwxkktoCjmiTY9LS76OxpCcgTcLKIamMsm56w9A+x6Vgh88eATakmCB0FCNUqBn8BvGsmDT5Nzm1i6I8a/f4iBX0/pmiTowIaw5Xuh72yc8sY/Mmw0skrz95q8LXszr0XbsB+TsblhZXuRffAgcLipXwk7pmpoRDDELiVZj1uHKTLcb/I5QAVuwTzeH8h86Kh4D6PbfcZRWHf+9mw7xkJkbzfopppMpFifr/B7xZCjfGCOkmovzUI9TeS2JBnxNg34SQwK4H7XH73evCde9p2kFarwyKBTm73EKFSUubPowI6DBUyXzHASaUyjPt9xFGpDOFKw7BfdkYagj+pjojkbYiXt+FC5mXDbVxrDPYrEv1OkZOUgt2Yhg49i8bWaZlwwXuhmX8Gqp3ybDtL82xnXac921ZHz7YHk6XVkQc24Epg4uJYnjbAuUSlHbBtoslW3GScnL44BCxO32EJp9OA3k7SzXk9vEHAEj2FzHedrX3ey6QIZjLPafge+JNZDHb6tSTjGDfvyLi9ouE60agPV+plGbcPEgmVdsK2PXAXx7jGaim0jWQTggfBzO4W8GC+kE0WwbMhCrwf93uXI30FjNvPsVneBQH7RcYhzxuH/kI2gY1DNinR7x5ykizdmIYOvoLGBpanA5xV7Jcwz0OQVYhqG9lV1BA025hwGwvZeudV1AjuWZ8jb2zElUbgcOwk2gh/Uh0hJGDY1N94jCOF7AIXZnmwxIBTltZuI47abZOIWE4U3owrbYI0QfprMyQxKh2AbaPSfhd+3aBH3TdoiNXzFPSAFxMpUP8DHAv2wZ/2wgFIC4qJBvxjokFHJhpiomkBr1oHMcIwJBLHJoMS0+KKTfoMNnmPBHSTF0+qj2MT1pPqg9aCYpM+/9ik35FNBkRG24lGgw6ihBhhkPWk8i7sYY8XP73P2UcS7Vv1FbKbnf30fi/c1SfpI7FKqAc6shR39cwo7hIood4SuYtTQj2GErpXwrtMOZKgm13OYSXUDX9SnJDzjxPKcMXWLUFbZ03SS2iSbl6T9BayJ501SZ8XFull7VQ3YpFe+JPhnx6Sf7r9458+R/7p97LqGGC1bZz1egWbnT2wbQ/cxWmSbntZDgpKUcuQu2e5Jw5cPmlt1tIDsreoWs5xQzkvWmMalSCQKPrwJmMrLUcOxpuw5QrZN3sKr3U4MlKO1cdY2HLwJyVPTSXKU6NW+jjnTFtDCTszbh8Ts/FHZVISRPBqjufV7kL2N12EIfL+sUiTI4t0K3Jwuy0uCMMivRLi50qp5gzFGaHVgSfF2Yur5R0VZ587xZkXL0l+11lxUjHhXp4ZJ7Xy73vyUpxFLs+KXC8fE6akIuWfVJShI5J3pq2E4hzwItT97IoMz2I//CnpUecdPernXCjOPv9YJOXFtqa8sEivxRAwLNIvIX6uFKfhcQY+yoU+2yUGM8CklVk/E+mnv3ROwKKUX9zC6SLwTzorP8GA2r0oPzbibFF+9oQpqBGmE6ZQmtGg8fTrz/n/6FyrIZuNEnZgUJh1kv1rY9etWdA3cINgm4vsZZTMbqQxI+gh2cPUbk8VgBbIk8sDik4uD/EiY292WK7ZhitPbxwfPfWGjecfvvLhg+f3j54++/DjQs7rhqMGzYGJRGcXqFMUwNS3MicXOo092r8vwbPpEQv3ywb4l9RrSZRxA4ZOnyjpN7TrmFQM1IO+GXTtbFEdIQgPpk+U6jJYyP6Ti7z+Es30rBfKbIesn90hy0tMXL/jamKI3ervh80KtfW/OW/1D4l8EkoweiFFaEUwyCiCPFAEdmZtNn+SmRzNuL/NjNuRhJ9RkN68iuZC9kfOXoUgry3pyIHNos1vxqtodjHKVrvt2w8RiUqdzHJ2P+wcJk9nIftzwH52XwfoylbxI+GtjDvQ5fsj4V20O9CqyB3oYlMcbNTohl1DbN4NCes+1tPNSI4lpKMcsqPkOe3GFJpuuYo5sdlKhlEPi3mkys4jVbDHxRXLB6zmD3xTxTgJG2gfvXUq+CQU8E66kqnIBBy1jxPBZqfzGc3Wcx+dmKLY8reXuECvKSXvudNL/pBAIjuhlkQc3eXGvHh0PZvtZZahFN1LcjuzBjcbdXQ4MoQprDF/Vgt0faZQ2+RsCrO4RwHHKcngSlnYL7spzMCfFGem/ePMrCNn1opG5ESGOlypFk4s4sw6TAfwOSCgrSwNe3WLyW4+imyhYS/d3SO48C/GPj/48jdexueVi+N+av/YpcsT50ptKP1XH9/7yo8uNDk3VOp9fuxNhW7CH7Pw1Y20vxOX69zP5f2duLvbIkvxd+KYhyNM+CMh1+zP+PBHUMj+cdgcmEhKccTJOyTNdPS2kt+g+FnJ3Pnv+E0IKoBjXGA6WrQptTuoGYwR5sHy4gQ2D7FC7V4DfDd+vMPsi6EGKD8kZvVDwvAnyXZoHy8Ku05US7Br75DFqqIRJwq1B5338hLOC8+gGPyIs7VNstJG9Ui0WgX9slvbhE0AbErLLHTyLxPWeY1D9iArJV9zkg32hbqMqhK3njNOwHGSlcLWzsVgS5SkYEKGSKcvBLFNISzVCiTs7STIFVIK0ht5BNO1jsmvkOKGEGxwv0KKwX4xM0lNSsz1TLpjsxDZksBqSb74s9A++CCpqC1XOyOPbrrWPQb/TMgq8aDFLRcp8TcZ4JcZJR4qKnFSxxT18XSfXw/7QGozpMQTjquZlLtkjIRgtKlC7S8BBY441MX6LWJQ61dlDUAMqiWhAXivAf5WRqk+Zd/gi5vaUghrXFpU+3ZGKqPGV/+ZpMwo+MatDIdcybDNBYjCn0/sOQ+FEdiuxNQ18XYLlcIWyv4JtBBORixp7VnC1XASVouUcmWRIqQblJAw7UGSjYMQkLZWcexMAvanV50xoKU8uASk1U3hMdKiajEztBgngBiXuDp9xz/9/B/e9Zb533Zendq5EOj+oBMXRq10M5y+g1f8e7ogLL/gjNALzrCiBafgHvwwGWCPwa4JXh+crndcwuOLMbFwHQCB6JIURvftB82AOr0GLYrUn1DAUeeVZkRinGFTC9iXMBbH0X3kwkA8ihAtmgqb2Wih9kcGAT5OEoClLKnj0asJUcdKEexaBV3Yk6jwzYQIcF+tthhYw+iULX5uUupPn7109vy50fFJPrkhnOOw8K9RMVX/1aDqJ2mqcmMlOSrJxgIililCPUsWaj/tHAtIEgwP5k8I/RnnSEDKS9w9KUpwBL2yM33Sld+Ssjo7Fj+XirmFSwzWh+lgfcwxWJ9kPQou3SBFQYatM43XIxHBTIcLtf/bVdjgX8lmvewHRVjGj1rUIepzpFD7knMCSoRg/DDH+JPQLzszftQL40dEdAK9sjN+xOLSUIwfsDJ+HPvJmPFj/jF+yJHxw0wA6yhm/DAksTMvCm0HCH0Q9YIf3Du1tyJsNiF88qv2W1ykwujp9/FXtG8c9N03vjMvSnt64xwIlLn/8pF95y+OnT19/lz7vrGJBy9fGp0y84/BiQlB3oHz4L67AdqnC8Kf9PwHHSJVUexOhRzdqSR23Jx9sIRQIJKWdkXxmn8HD1BJxphYxyJRqKvytMXgrF/5LYYov8XAhF4oxyJRno5FQs6xsGxUuId0tvBJtxY+IfQ/66qdLTzl2iZ417Yue0dc24RH1zZBWvjknbDwcS+ubZyx8DCW6mXlfdjTypvj6aN+8XSjM09HvfB0tFC33CetGmW1KuZpS9TcLU9bIkJ0ioRvPB115OkYwy6H2RBXQiY6GvPdA4z5Hx3laBXwEgmT8gBj0AOMhyT42tU+ehSEGEuM2u/sfd+b3/rivxz0PXnt89Fvfv9z//PMVd8bevzT67f9v7v+bYmLfQhabQQ4fR7kgqIhzsejzRV47hmr2/vEmnw7lt2UujdWUnLufNzB4zYeeqjbJZ8xxEPvdXGeOlqi4g7RijvhxRlJOCqjlEO2EtL3wM2LSMR/4o5edJT1OCzRHqFbcIx7gCUAaYJKre4k85B6RBS1McSnyHq/XHLuYYxcDFVhvgCDtJUl4RDpdKUQk8Aclk9YihoT8StMwtKdUIt3QGyTjmKbYk63bXWQP47PkyXweZyNTia4AG6Am9kg2+MI2+OoqMc0naz9LUomZZTdD4BhzRDHmmGX9siI30LZF9mjtxujetxbNIONEnnIiN2qZkPLEqbxS2LDfhlapw0t7/yfYCU2xkpAHPBK2bP+VkfW/z1jOM94C3qoZv2jFdZ3CnjdedZ/pvxZ/6gj679gDOdTXlj/sHLWP1xhfWFcrKxY/1N3hPUZVotKMG+CSbCzBKKpKRVEH5O+Rx+TdPQxoSj6mPQSfUyxBJaIPiZh9DEVulM8riie99XYvs2BP3tXg+t43vSfI6aaErKIJcXPXgecESl+Xqj7hlX9gRi6Wx40lKOwQtxeIWhWsLScMD+w/J1c0k7/OSUYsoEVR0NOFeq+ZiNqzKxWnHt72zFx2wn74MgIWBHQXgHcLFPUnq9QzCW9jVBE/CYxx07ZFBHmAMJmb4E1S+6mMLD2qvRW3nSPTkJoakSikHSUC0lHCnXfN1I2BnxMyI/rn5AfZVWwQebjEltHUdYaVwBnFKDj6YT6pGzOasjUZyLZr88Y0NVuTsG7lyLLAXxPqjTkpErr671nRURMrSqEnuucFRFTlBVhOebDZkX4lTYWpxdyEceFXMzLqf44SwaB9xt3sdjxvjPPnRk0Ra9EnzgcWvi+pc+f2OX7ZvoLnevy6aNNj/reUKL3x7/7g2+/8/2+N/Rs8gsb//IDsfucG7KISNRhNRFjfHeigu2geMzBH44z571joJs2Jz5eqO+3OfFh82tiyRSze/dR8xNbScxhzRG1EybqME6OMEUB6lDEDL9xdtF3XxjqfLcjM/wHpj0Ub8dQAwA=",
434
- "debug_symbols": "tZ3RruS4kW3/pZ/9IEYEGaR/ZTAwPB7PoIGGPfDYF7gw/O83Gang0jl1k5Uns+rFtdzdFUuixJ0SSUn//OU///wf//jvP/z6l//66//+8vt/++cv//G3X3/77df//sNvf/3TH//+61//cvun//zlmP/T2y+/19/90v2X37fbH/3+x4g/xu2/8Nsf5Zffl+P2p5x/6vmnnX/W8892/unnn/38c9z/LMeRUBIkQRPmX5YJPWGcUGpsTint/NPPP+d/qRPGCXIkpEhSJCmS+bfsBjr/mzpBEjTBEuYuTpe2BE/oCeMEm/YxoSTcKkuZoAm3vy5tQk8YJ9QjoSRIgiZYQk1oCVm5ZuWaldutss6WbCVBEjTBEmpCS/CEnjBO8LOyzAOqNkETLGH+x7fNkDL/Y58wN6NPkITb37JZp1hCTWgJntATxgnzuN/hVtl0wq2yTfs87lYnzMrTLrPOlM4z4Q7jBD0SSoIkaMLcnjHBE3rCOGGeCXcoCZJw2696OxNkHu46t3ke7jtIgibctrnO3ZmH+w4twRN6wjhhHu47lARJ0ISs3LJyy8otK7es3LKyZ2XPyp6VPSt7Vvas7FnZs7JnZc/KPSv3rNyzcs/KPSv3rNyzcs/KPSv3rDyy8sjKIyuPrDyy8sjKIyuPrDyy8jgr63EklARJ0ARLqAktwRN6QlYuWblk5ZKVS1YuWblk5ZKVS1YuWblkZcnKkpUlK0tWlqwsWVmysmRlycqSlTUra1bWrKxZWbOyZmXNypqVNStrVrasbFnZsrJlZcvKlpUtK1tWtqxsWblm5ZqVa1auWTn7oGYf1OyDmn1Qsw9q9kHNPqjZBzX7oGYf1OyDmn1Qsw9q9kHNPqjZBzX7oGYf1OyDmn1Qsw9q9kHNPqjZBzX7oGYf1OyDmn1Qsw9q9kHNPqjZBzX7oGYf1OyDmn1Qsw9q9kHNPqjZBzX7oGYf1OyDmn1Qsw9q9kHLPmjZBy37oGUftOyDFh3NJowToqMFlARJ0ARLqAktwROycsnKkpUlK0tWlqwsWVmysmRlycqSlSUra1bWrKxZWbOyZmXNypqVNStrVtasbFnZsrJlZcvKlpUtK1tWtqxsWdmycs3KNSvXrFyzcs3KNSvXrFyzcs3KNSu3rNyycsvKLSu3rNyycsvKLSu3rNyysmdlz8qelT0re1b2rOxZ2bOyZ2XPyj0r96zcs3LPyj0r96zcs3LPyj0r96w8svLIyiMrj6w8svLIyiMrj6w8svI4K9fjSCgJkqAJllATWoIn9ISsnH2wZh+s2Qdr9sGafbBmH6zZB2v2wZp9sGYfrNkHa/bBmn2wZh+s2Qdr9sGafbBmH6zZB2v2wZp9sGYfrNkHa/bBOrtMKxOmwifcFE0mtARP6AnjhNll7nBe4de8wq95hV/nGd7qhJui9Qk1oSV4Qk8YJ8wz/A4lQRI0ISt7VvasPM/wNvdrnuF3GCfMM7yNCSVBEmrC7W/53MF59gbEfWdASZAETbCEmtASPCErj7NyO46EkjAr6wRNsBNK/pO44ewTPKEnzMq3vWjzHLtDSZAETbCEmtASPKEnZGXNyvMc63Ob5zl2B02whJrQEjyhJ9wq99vZ0mbO36EkzMptgiZYQk1oCZ7QE8YJ86S9Q0nIyjUrz5zvc79mzt+hJXhCTxgnzJy/Q0m4VR5zv2YvuIMl1ISW4Ak9YZwwe8GYjTB7wR0kQRMsoSa0BE+YlecOzl4QMHvBHUqCJGiCJdSEluAJWbln5ZGVZ3cYPiFP0ZGnaJz8N/DjPJH8KAmSoAmWUBNagif0hPMU9ZKVS1Yu5ynqRRMsoSa0BE/oCeMEOU9Rl5IgCeeJ5GIJNaEleEJPOE9R1yOhJEhCVtasrOcp6toSPKEnnKeo25FQEiThPEXdLKEmtARP6AnnKeqzW93hPEW9SoImWEJNaAme0BPOE8nbkVASJEETLKEmtARP6AlZ2bOyZ2U/z1WPLjPPzOgyAeOE6DIBJUESNMESakKMQB6TfFFfFOOQt19iH8eiskgW6SJbVBe1Rb6oL0pHP45FZVE4ZJIuskV1UVvki/qikVSORWXRcpTlKMtRlqMsR1mOGDc9dFL8XZtkZ/t1qYvaomyDLn3RagNdbaCrDVQW6SJbVBe1Rcuhy6HLYcthy2HLYasNbLWBrTaw1Qa22sBWO9tq57raua52rqud63LU5ajLUZejLkddjlayxZtli7e6KP5uneSL+qKR5MeiskgW6SJbVBcthy+HL4eHI2YGjkVlkSzSRbaoLmqLfFE4fNJIuvfLoLJIFukiW1QXtUXh6JP6onHSiH4Z0xLRL+8ki3SRLaqL2iJf1BeNpLIcZTnKcpTlKMtRliNmM0qZ0y3xd2VS/N06SRfZorqoLfJFfdFIin55p7JoOXQ5dDmiX87pkhH98k6+qC8aSdEv7xT15kRS9Lcyj0L0tzv1RTHRExNKx6KySBbpIltUF7VFntSink4qi2SRLrJFdVFb5Iv6opHky+HL4csRfUFmS0ZfuJMvinqzhaIvBEVfuFNsX495s7mBMeNyxBlzYgNnTdWYWjvAAgo462oNNLCCUdcDHYzptticOKN0xPzdARZQQAWnzUpgBRs4bRYbGafWidM2J3Nu4ThtFhsZ54DF5sRJcMc4ujWKxeE90cAKNtDBDo6FcZRPLCA2x+bYIlBrbHok6h0jUk8soIAKGljBBjqIrWMb2Aa2gW1gizCt0b6RnHVOH97nb2sPLKCAUWEEGljBBvrCiMt2BM4Kc7Sk3Gdz29yc+3zuiQUUUEEDK9hABzuITbEptrh+aDHfHBcQJzbQwQ6OhZFqJxZQwJhljnaIFDvRwQ6OhZFuJxZQQAUNxNawNWxxenrMvMfpeaKAUTdaJ07PE+vC+CX2eRrFJGuZt6ElpllPjKY+cf61XgIb6OCsMG8KS0ywnhhJcGIB50Z2DYy6sQ1xsE70hXEAugcqaGBUaIENdLCDY2EclhMLKKCCYYt2iK43bxZLzDCWMY9FzDEmFlBABWexUQLnRg4N7OBYGF3vxAIKqKCBFWwgtoKtYIvZgwBLqAlRxgId7OBYGB3pxALKwtn0cl+uURbJotilFmhgBRvoYAfHwvhBOLGAAmJzbI7NsTk2x+bYOraOrWPr2Dq2jq1j69g6to5tYBvYBraBbWAb2Aa2gW1gG8tmxwEWUEAFDaxgAx3sILaCrWAr2Aq2gq1gK9gKtoKtYBNsgk2wCTbBJtgEm2ATbIJNsSk2xabYFJtiU2yKTbEpNsNm2AybYTNshs2wGTbDZtgqtoqtYqvYKraKrWKr2Cq2iq1ha9gaNrLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbKkkiWVLKlkSSVLKllSyZKYsZQ5xFVizjKxL5wBInMMp8SEZaKAc7HeHMYpMW2ZWMFQeKCDHZwL9+agRYkJS4l1izFlmWjgrBvLJGPi8sTZY0XiP5j9TWLtYUw7JjoY/238tViLOO9bS0w/Js7dlNj0WJF4oi5sUTc2vTnYwbHQD7CAAipoYAWxOTbHNk/a2xVmYAUbOP9a3DfHJGTiWDhP2sQCCqiggRVsILaBbSxbTE4mFlBABQ2sYAMd7GDY5tFscf6eWEABFTSwgg10sIPYBJtgE2yCTbAJNsEm2ASbYFNsik2xKTbFptg0bBboYAfHQgtbCyyggAoaGL07bNHJTixgBFMo7j9fd2xgbFkP7OBYGNfBJxZQQAUNrGADsTVsDZtjc2yOzbE5Nsfm2BybY3NsHVvH1rF1bB1bx9axdWwdW8c2sA1sA9vANrANbAPbwDawjWXz4wALKKCCBlawgQ52EFvBVrAVbAVbwVawFWwFW8FWsAk2wSbYBJtgE2yCTbAJNsGm2BSbYlNsik2xKTbFptgUm2EzbIbNsBk2w2bYDJthM2wVW8VWsVVsFVvFVrGRJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFkSc9AyH3QoMQmd2BNj8lliqDxmnxMFnIoYQI8JaJlPRJSYgU5soINTEUPaMQt9YgTIiQUUUEEDK9hAB7EVbIJNsAk2wSbYBJtgE2yCLQKkRktGgMSgeMxhS4yExyS2xJh3zGInTluMY8f8tMQ4dkxQn80XoXCigLNCi7oRCifO7Z0L5EpMUyfOujE8GxPQ4qGIjh5jsjEFnVjBBjrYwbHwPngWGL1wLoErMbGcKGCIo3WiF55YwQY62MGxMHrhiQUUEFvH1rF1bB1bx9axDWwD28A2sA1sA9vANrANbGPZYtY5sYACKmhgBRvoYAexFWwFW8FWsBVsBVvBVrAVbAWbYBNsgk2wCTbBJtgEm2ATbIpNsSk2xabYFJtiU2yKTbEZNsNm2AybYTNshs2wGTbDVrFVbBVbxVaxVWwVW8VWsVVsDVvD1rA1bA1bw9awNWwNW8Pm2BybYyNLBlkyyJJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmSQJYMsGWTJIEsGWTLIkkGWDLJkkCWDLBlkySBLBlkyVpbchp8OsIACKmhgBRvoYAexFWwFW8FWsBVsBVvBVrAVbAWbYBNsgk2wCTbBJtgEm2ATbIpNsSk2xabYFJtiU2yKTbEZNsNm2AybYTNshs2wGTbDVrFVbBVbxVaxVWwVW8VWsVVsDVvD1rA1bA1bw9awNWwNW8Pm2BybY3Nsjs2xOTbH5tgcW8fWsXVsHVvH1rF1bB1bx9axDWwD28A2sA1sA9vANrANbGRJIUsKWVLIkkKWFLKkkCWFLClkSSFLCllSyJJClhSypJAlhSwpZEkhSwpZUsiSQpYUsqSQJYUsKWRJIUsKWVLIkkKWFLKkkCWFLClkSSFLCllSyJJClhSypJAlhSwpZEkhS8o9S+J5+nuW3FHBvA+QYg10MBQjcCy8B8gdCyigggZWsIEOYqvYGraGrWFr2Bq2hq1ha9gatobNsTk2x+bYHJtjc2yOzbE5to6tY+vYOraOrWPr2Dq2jq1jG9gGtoFtYBvYBraBbWAb2MayyXGABRRQQQMr2EAHO4itYCvYCraCrWAr2Aq2gq1gK9gEm2ATbIJNsAk2wSbYBJtgU2yKTbEpNsWm2BSbYlNsis2wGTbDZtgMm2EzbIaNLBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0tiNaHMVcgSqwkTDQzFEehgB8fCe4DcsYACKmhgBbEJNsEm2BSbYlNsik2xKTbFptgUm2IzbIbNsBk2w2bYDJthM2yGrWKr2Cq2iq1iq9gqtoqtYqvYGraGrWFr2Bq2hq1ha9gatobNsTk2x+bYHJtjc2yOzbE5to6tY+vYOraOrWPr2Dq2jq1jG9gGtoFtYBvYBraBbWAb2CJA4u1w9TjAAkaXvqOCBk7bXL4v9yWEJ/rCiIoRb36LqDhRQAUNrGADHezgWCjYBJtgE2yCTbAJNsEm2ASbYlNsik2xKbbo/vMJgRsWUMD4axZoYAVjI1ugg7GRPXAsjO5/4s2mczmnxIrGRAUNrGADHezgWBjvXDwRW8PWsDVsDVvDFm9gPKLN4h2MJ46F8R7GEwsooIIGVrCB2BybY+vYOraOrWPr2Dq2jq1j69g6toFtYBthk0AFDaxg2OKEGQ52cCTGYszE6N09sIINjL82Xy4ZqyoTCxgb6YEKGljBBjrYwbFQDrCA2ASbYBNsgk2wCTbBptgUm2JTbIpNsSk2xabYFJthM2yGzbAZNsNm2AybYTNsFVvFVrFVbBVbxVaxVWwVW8XWsDVsDVvD1rA1bA1bw9awNWyOzbE5Nsfm2BybY3Nsjs2xdWwdW8fWsXVsHVvH1rF1bB3bwDawDWwD28A2sA1sA9vANpbNjwMsoIAKGljBBjrYQWwFW8FGljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mRJrMvU+ZIIiXWZiQWcivkKbInFmIkVnIr5kIjEYszEDoZi/nzFYkydr2iQWIyZKKCCBlawgQ52cCzs2Dq2jq1j69g6to6tY+vYOraBbWAb2Aa2gW1gG9gGtoEtAqTMK9JYl5lYQAEVNHDa5mM8EusyEx2ctvkYj8S6zBMjQE4s4LTN53wk1mUmGljBqDtPmFhrqfM5H4m1lokKRoUaWMEGxvbGDkUonDgWRiicGDYPDFsPDFuQLaqLQjUCHezgWBiJcGIBBVTQwApiM2yGLRIhWjwC4U5lkSzSRbaoLmqLfFFftBxtOSIFNE6LuKI4UUEDK9hABzs4FkYgnIgtAuG+DREIJxroC6OTa5xY0cnjDfGx1jNRQQNje+Nsik5+ooMdHAujk59YQAEVNBDbwDawDWxj2WKtZ2LYWmDYPFDBaZsvPZFY65nYQAc7OBZGJ4/BiVjrmSiggmHrgRVs4LTVI7CD0zbXQEus9Uws4LTV2OMIhBMNnLYa2xCBcKKDHRwLIxBOLKCAChqITbEpNsWm2AybYTNshs2wRSbMF5lIrPXUFoclMuHEDo6FEQonFlBABQ2sILaKrWKr2Bq2hq1ha9gatoatYWvYGraGzbE5Nsfm2BybY3Nsjs2xObaOrWPr2Dq2ji2yZL5ZV2KtZ2LYNLCDY2FkyYlhi5MgsqTFSRBZcqKBFWyggx2ctjkgqbHWMzHjVY9DQQOnYq7o0VjgmTgVc6WQxgLPxLHw/jmOOxZQwGmbb3HRWOCZWMEGOtjBsTAC5MQCCojtfu2ggQ5G3RY4FkZUnFhAARU0MPaiBzbQwQ6OhREVJ4bNAwVUMC4foiXvlw93bKCDHRwLIypOLKCACsazInE+3N8TfccOjoUxNXFiAQVU0MAKYmvYGraGzbE5Nsfm2BybY3Nsjs2xObaOrWPr2Dq2jq1j69g6to6tYxvYBraBbWAb2Aa2gW1gG9jGst0XbZ5YQAEVNLCCDXSwg9gKtoKtYCvYCraCrWAr2Aq2gk2wCTbBJtgEm2ATbIJNsAk2xabYFJtiU2yKTbEpNsWm2AybYTNshs2wGTbDZtgMm2Gr2Cq2ii2mOeeFod7Xb55YwRjivqODHYxEHBPjAuPEAs6M6kfgzL4e4riUONHBmX3z9V16/67UHeNSYs6Wa6zUTBRwZt98k5fGSs3EsFlgAx0MWwscC+NSYg7qa6zUTBQwbLFvcSlxYgUb6GAHx8K4lDhx2kY0VFxKnKiggdM2onXiUuJEBzs4EmOdpc7pMo11lol94b1vamAHx8L4lZ7vjdZY+ZhoYGyZBzbQwQ6OhfHbfWIBBVTQQGyKTbEpNsVm2AybYTNshs2wGTbDZtgMW8VWsVVsFVvFVrFVbBVbxVaxNWwNW8PWsDVsDVvD1rA1bA2bY3Nsjs2xOTbH5tgcm2NzbB1bx9axdWwdW8fWsXVsHVvHNrANbAPbwDawDWwD28A2sI1li5WPiQUUUEEDK9hABzuIrWAr2Aq2gq1gK9gKtoKtYCvYBJtgE2yCTbCRJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJbHy0eYSBI2Vj4l94QwQmy/y0VjumCigTmyBBlawgQ528LZDNmdrNJY7JhZQwGmbUz8ayx0TKzhtc75HY7lj4rTNb5hqLHc8sRzgtM1JCI3ljokKTpvENty/5XnHBjrYwbHw/lXPOxZQQAWxCTbBJtgEm2CLb3/GvXSsfLQ5H6Gx8jFRQQMr2EAHOzgWxhdCT8Rm2AybYTNshs2wGTbDVrFVbBVbxVaxVWwVW8VWsVVsDVvD1rA1bC1sHljBsPVABzs4Fs4AMY1DOAPENA7hDJBEBQ2sYAMdnDaNzjAD5MQYU7A7CqiggRVsoIMdHAtjTOFEbAPbwDawDWwD28A2sI1lO5c73rGAAipoYAUb6GAHsRVsBVvBVrAVbAVbwVawFWwFm2ATbIJNsAk2wSbYBJtgE2yKTbEpNsWm2BSbYlNsik2xGTbDZtgMm2EzbIbNsBk2w1axVWwVW8VWsVVsFVvFVrFVbA1bwxbjkzFAEWsnEw2sOUBxfyPliQ6GrQWOhTE+eWIEyB0FVDACJIrFSOR8bZDe3z154ljY47/tgRVsYFSwwA5G2Mzf2Fj5mFjA2Q41NieS4MTZDjUaKpLgxAbGXf4R2MFpmxOKGisfEws422G+XErjNZSJBlawgQ52cCyMS4n5fQeNBZOJAioYthpYwQY62BfeO/oIVNDA+GstsINjYVwTzBlSjZWPiQIqaGAFG+hgB8dCw2bYDJthM2yGzbAZNsNm2Cq2iq1iq9gqtoqtYqvYKraKrWFr2Bq2hq1ha9gatoatYWvYHJtjc2yOzbE5Nsfm2BybY+vYOraOrWPr2Dq2jq1j69g6toFtYBvYBraBbWAb2Aa2gW0smx8HWEABFTSwgg10sIPYCraCrWAr2Aq2gq1gK9gKtoJNsAk2wSbYBJtgE2yCTbAJNrLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbIkFkHafJWgxiLIRAenIn6aY+VjYgFn3bnURGO5Y2IFo27YIjVO7OBUxO98LHdMLODci5gUiuWO1mLLIjVOrGADHezgSIzljokFFFDBsFlgBRvoYAfHwkiNEwsooILYCraCrWAr2Ao2wSbYBJtgE2yCTbAJNsEm2BSbYlNsik2xKTbFptgUm2IzbIbNsBk2w2bYDJthM2yGrWKr2Cq2iq1iq9gqtoqtYqvYGraGrWFr2Bq2hq1ha9gatobNsTk2x+bYHJtjc2yOzbE5to6tY+vYOraOrWPr2Dq2jq1jG9gGtoFtYBvYBraBbWAb2MayjeMACyigggZWsIEOdhAbWTLIkkGWDLJkkCWDLBlkySBLBlkyyJJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmSQJYMsGWTJIEsGWTLIkkGWDLJkkCWDLBlkySBLBlkyyJJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmSQJYMsGWTJIEsGWTLIkkGWDLJkkCWDLBlkySBLBlkyyJJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmSQJYMsGWTJIEsGWTLIkkGWDLJkkCWDLBlkySBLBlkyyJJBlgyyZJAlgywZZMkgSwZZMlaW2LGyxI6VJXasLLFjZYkd9yzpgRVsYNg0sINjYWTJXMNpscAyUUAFDaxgAx3s4Fgo2ASbYBNsgk2wCTbBJtgEm2JTbIpNsSk2xabYFJtiU2yGzbAZNsNm2AybYTNshs2wVWwVW8VWsVVsFVvFVrFVbBVbw9awNWwNW8PWsDVsDVvD1rA5Nsfm2BybY3Nsjs2xOTbH1rF1bB1bx9axdWwdW8fWsXVsA9vANrANbANbZMlcM22xGDPRwQ6OxFiMmVhAARU0sIINdLCD2Aq2gq1gK9gKtvhs3VxpZrEYM9HBsGngWHjPkjsWUMCw1UADK9hABzs4Ft6z5I4FFBCbYlNsik2xKTbFZtgMm2EzbIbNsBk2w2bYDFvFVrFVbBVbxVaxVWwVW8VWsTVsDVvD1rA1bA1bw9awNWwNm2NzbI7NsTk2x+bYHJtjc2wdW8fWsXVsHVvH1rF1bB1bxzawDWwD28A2sA1sA9vANrDds+Q2z2Byz5I7FjBsHqigLbxfHvTAKDa7dLy90ubaW4vFmCdGz5pLay0WWCYqOOvOpbUWCywTo4IFOtjBKZ5rby0WWCYWUEAFDaxg2GLno2ed2MGxMHrWiQXU+ZWs2OP7WR2t02io+1l9x6gbLRln9R3jrD6xgLEX0b5xVp9o4LTN19pYLG5MdLCDY2Gc1SeGLbYszuoRhyXO6hHHIs7qEa0eZ/WJDQxbtGScvyOaJM7fEwVUMOrGbsaZOt+RY3o/J0dg/LU7Gv/09t/W+X4ai4WFdS5/slhYmCigTpRAAyvoC+8f/Y66949+31HAeYxb1L1/9PuOFWyggx0cC+8f/b5jAWMjNTA20gIb6GAHx0I7wALOvZgTthYrBBMNrGADHezgWBhfRz0xmroGxvbe/6mDHYztnUc+Vv0lFlDBuTnljg5GsThh2ljoB1jAOB/i3HEFDaxgAx2cO1/uxcbC+KDpiQUUUEEDK9hAXzj7UC1xys0+lCigglE3zt/4dOmJDXSwgyPx/hnkEwso4Gyd+ZYHizV7iQ52cB6L+1+LvnliAQVU0MAKNjBsGhg2CxwL5QALKKCCBs42O+7YQAc7OBZG5z2xgAIqSJspbaa0mdJmRpsZbWa0mdFmRpsZbWZtNZT52k2jzYw2q7RZpc0qbVZps/g25H2HKm1WabNKm1XarNJmjTZrtFmjzVpseg2MTW+BHRwLo6OfGJvugQIqaGAFGxi2HtjBsbAfYAEFVDBsI3Da5qJUi3V4iQ52cCyM7n/itEmcJdH9T1TQwAo20MGeGCvu7k0dK+7uLRkr7hINrOBqs3rv/nfs4Fh47/53LOBqs1oUNLCCDXSwgyObOlbc3dssVtwlCqiggRVcbRYr7hJpMxkL9QALKKCCt7px7xpL607qi6JoYPT9E6NoHJ7o+ycqaGAFGxi7EE0eff/EsTD6/okFnDaN9oi+f6KBFWyggx0cC1tUiPaIrj2XzVosdasaexzd9UQDw2aBDXQwbLHH0V3vGN31xAIKqKCBYYsTPbrriQ52cKy9mF2wxUk4e+BJbVH89Thdo/+dOBJj9VtiAQWcGzvXrlmsfkusYAOnbS5Cs1j9Vuf6RIvVbydGrzyxgAIqaGAFG+ggtuiV8z0eFq8LTCyggAoaWMEGTttc4WixaK7GVWcsmjv/afTKE8MWmxO98kQFDaxgAx3sC6M31jgs0RvnWzgs1sQlVrCBDnZwbnrcWcSauMQCCqiggXXhvOlsescGOtjBsXD+jiYWUEAFDcTm2Hr8tTgAPcRxTvYQa+BYOA6wgFHBAhU0sIINdDBs0QNG2OZZEqvJ2lw+a7GarEXPitVkba5ttVhNljjrlvt/62AHx8LZnRILKKCCcy/ihyvWjbX44Yp1Yy1+gWIBWIsfjVjU1ebjIRaLulr8LMSirhPnuZ5YwArGX5tNEmurWvwsxNqqJtEk5vwHnX86FtYDLGBsZOzQPCcT46/FvrUDnKd9DOfEEqcaAzexxKnGsEsscUosoIAKGljBBjrYQWwdW8cWPwsxhhNLnBKjbuxb/ACcGHVj3+IH4I5xZRaDMbGYKdHAWTfGhmIx0x1jrVKNEZhYq5QooIKzWIzLxFqlxAY62MGxMII/hnNirVKNgZtYq5SooIEVbGDYZvPFUqQawzmxFClRQQOjmAc20MEOjoWR6yeGrQeGbQQqaGAFG+jgPGljHCnWH7UYMYrlRS1GYGJ5UWIDHezgWBgd58TZW+LuJtYUJUaxaL7qYAfHwuhOJ85eGOMnsXooUUEDK9jAsEVL3jvkHcfCe4e8YwEFVDBscSzi5+DEBjoY+xat7mNhP8ACCqhgpGccrHs3jbr3bnpHBzu4ummsHkqMrI7DHb84J0ZWR2+JX5wTK9jA+GWIYxy/OCeOxFg9lFhAAcNmgZbbEKuHEhvoYAfHwvvvUAssoIAKGljBBoZtnnKxiKfGyGQs4kksoIBxiSKBBlawgfNgxWKFWK5TY+VDLNdJFDDqxubEhdaJFWyggx0cC+8XWrGb9wutOwqooIEVbKCDoZj9ItboJBZQQAUNrGADHewgNsfm2KLHxmqRWKOTaGAFG+hgB8fC+Ak9sYAcrLizOtHACjbQF0bfjBumWI2TKKCCs27MoMe6m+px9sXN1Ylze+c0dI11N4mz7rzprrHuJv7bGutuEg2sYAMd7OBYGL+xJxYwN73GYpvECjbQz32rsazmrCAUi9/Y+w7Fb+yJtvZN2HRh04VNFzZd2HTFptiUhlIaSmkoZdPvXfqOHRwLo6Pf980oZhSLLn3foejSJ/raN2PTjU2vbHpl0yubXrFVbJWGqjRUpaEqioaioWgoGoqGoqGILj2nX2sslUns4FgYXfrEAgoYNgs0sIItsdx7QAssoIAKRjEPrGADHYxN74Fj4b0H3LGAAipoYAUb6CC2gk2wCTbBJtgEm2ATbIJNsN07wwiMa40j0MEOjoVxrs+3TNVY65EooIIGVjBsEuhgB8fC6AEnFlDAsMm//vW7X37765/++Pdf//qXP/z9b3/+8y+//+f6B//7y+//7Z+//M8f//bnv/z9l9//5R+//fa7X/7PH3/7R/xH//s/f/xL/Pn3P/7t9m9v+/jnv/zn7c9bwf/69bc/T/rX7/jbx+O/ejv1zM6/fuNeVonbmfihSHlcJJ7hjxK3YfpVwO3D35fHfz9eMxt//zazxwbcNubpvYjXnp97cbtuergXtiky5r1x1Jgf3aaEftyR+riE9NwKPWhJK8/+/dLjI0H3/bjdaI3LRrTni5hQ5HbX+bBI3xSJp3LuNeplX6TKhxLjcYm4L4kKtxumS4EvtEb85pw7chsJeLgjpbx5TDYtYTELfD+7b0mzKrRn2yFGgO7tIONhO+yORaxAOI+FyMNjsT2cnBK3SY2HJeYdx+P+UeZF+73I7a6kP2iK/RE9Okf0si/fHNHNzszX0+UhlVvn/P9vxr7C6mbzdVkPKsjx7lnxna7eVlPcBiIfNoXskjPeM37uiI1Hp/c8Ax9vyLgc1tsl7+MNsd2GOC069OGGvBuem02YH7PP/NZNfs8h0oeHVVfszSmsxzU2J1dfvfU2vnCp8LGnySYx5Dh8/RINYq9//FnX7S9iKeuo3u552BWt/WOVsqtC8txuyKhxa5rnT9GnzgzVN8+ML5zjx+POprsTtOg6wYpef9LGizXG+zXMXqxRy6rRjsc1xvawrO3o5RI+x8c2tV2Oiq8clXE8rlF2aa78HlR5sUbTVaP1F2tUtqON92u4PayxPS5jrB+F43KefrMdmx/729huBuFtiFVfO7aj563FHCl5rYZyb6HWX2uPvs6x+ZWNhzXqZjtqrHO878vthvSlNq22rgRvOF47Lr624zYBPN7fF318bJ/Pj8cZVHc1jiGrxtEe3i9tmmN++X795l8u5L7ZjM1vvseYUNS4TZyyK7croQ8ldteTtm4/55sLKfHpoGxOUuWnVm/35I9KtN1v/m3EaN0v3Rq0PtyVXYuq06L++MDuLwafuiptur3ZEONmoz2+iW2bDRl+uQa6NMfoX9gQObh0kEsUfrMhu3unOZmaVeZM5oMbhrY5TyVWINyPTDN5VGG7FUNXo87pm0c1tu3R1tXHjS9d/3N7+LGLj7Yi+XYjeDnL6sca5d322G6FHNkcIpdBo89bsW8PN86Pcbk+/aY9bPdzK3UNEuimTTdxOpfV5E+l++NLXN+cIbfZyAyy2x3+8fCmwTfnaR1rO+qt81Dj6Qq32fo1ZHKbe3hUYbsf69Lj1mfLw/3om7PjNhed59ft9uHxDVTfXc7ZCvXOEZkXh08f1b7uBedU++OxPH3/qHZ796juKjx3VPf78eRR9R9wVPtPPapj/brNefaHR3XsLuOkryMil1GCTz/2o+yuJldj3K4m+6MS+z1ZN+dz1vfxnuj7e2I/dU/mROm6XdHxUgbPmcVVo/XXanxoDXnt90RWj2+3W8rHR2U3ft/WxUJt1V+ssQY5b/hiDS+rhpdXa6xZrhu212r0Y21HL+XFGnXdenXfXNRurzhGVa44Wnmpym2MsTDIeGzOkX2VImsM6MavboswonXIJkXK8faE07bEc3M1+xKWu9KsPSyxbw5vNEe3YzPvtTtPbj/13A765bb0cxF79yL7e9vB5FPxejwssrugO0ZblzAPZ2z2JcraldsFUX/h3ud2MBpTxEM301dl7EbVGYwu19vSTzPmXygyHheRsh1JXhlwG9B5dKNeduP7Tw3O77fiuXGgshtyeL45dkXKGny91ZBNkfaTi/hqVL/8aor1187V8nE9w6dzdTcV9eRQTtHtzT4HR24DU5t41/Lzy0jzddLfrtnt1TLOL5+4bkJa7e257H2JZyazi7Z3Z7O/0h67H63vlCnjUqa9XIbxafHNNVLZzT48eXT2JZ46OiY/++hc28PL60enX8rIi5d712gqtjs4u5O2riHV+fzsw2iy3Zjq7YqB357bbOoP2CGxTaTYeP/XeDe389yv8XYrnvw1rrKdHbo0a9sMaJaqb1/Q70o8eUG/LfHUBf132qO1NdJctj8W1X96mds1+LqjvrE8vDHYF2F44MZ2vFikDoo0f/ei/DaXsPnFaO8vUynt3XUq39mK5y632nZqtjvrQ8ZmxqpsJ4uevUt5vsjmsrz193OxjbcPTX8/F738gObYFnn2BsP1Jxf5wXcptx/jzaXAbrrn2c67m3R67gzZb8Vzndd35+l1cdecJX3cIP346WXmpw3WTIdel1e8WsTktSLGatn5SrpNEXv3EO/3ZUXrfEH+ZjPa22Nq2+0YJX985/vcXzwwo8oq0l49MAcL+I4+XixS1sKV+V7QV0+RdaFmUu1xkfHuaNZuBXH1NbNXR732u4/BujtNlcURdn0i51OJMupPL8Jdo13W/5bj+FRkd5EnY10oql5mbdvnIttf3841zXX6+Zsi23CtrPe4nKufi9h+mCNL6KEPm1WOzS+4r9889/bKSabFV/eXwzdboe9uxa5CreuJqdv93nUwoH4qUt/+1ZSjbafV1uzv8aE96vNF2rF6bjvaeLFIWXNzrXxYHPW5yHh32Ok7JZ56wmX34NRzw07PniBNPlzcfWqN3fzRsydI2c6Ha1sb0ncbsjlTvazBBC+6K7Ib2X9utamUXfd/brmpbB+Bem69qWznoJ5dcPqdZl2rNG+ji/7isZH1uMvtB7i9XMRWkQ+z818rohTpmwR4tuOM+riI1Lfvm2U3EfXc9ZC8v8pbdo9UNV13q83K5odmN5X1Q4o8+1ys7IbRm2U2tw9L58tXSjwzKLnflScfK/1Oezz3YKnsHiZ49snS7XX3GGvFU/nw3N2nSyL92UWevWiW3TMrz140y27u6dmLZrHy/kXz9npVVgbcrkba43a1t69Xd1uhwla0x7dEuxq3/r+Gzu06jfb54Nrbobq9ADCGIT5MN31uz91zquvG/eNKFv1UYrs6YAwuRC53Q/apyNtTVvvNsHWKql2GD77ZjG2RsaYT5zfpNvuib1+577Zjfg5sDahcnjT7djvq29uxL/HUHcRueufJO4hta/Ac4vxe0aY13r+f2nW43hhvK69Fx/wY3Rqfks2Py26CaL7Qg1/K6yXqp/6yG3Wvbd0u1+uk23yY+GORt5edyG6m6snzY7srvWV63GaL22ZX/P1defstIdtXDwhjoNLlpVPM6srj+SLll2rUsoa4axnHazV4yOJ2jyubwUf7AddRu4XwT19Hef0B11Hefu51lPFAY5XddZT3t6+j+g84Mrvh+qePTC8/4Mh0+QFHZndN5+vOoV+eJPx2O3bnanMWQ1x+674t8iPO1f4jztW+y4A14lavP5if7gv722fq9kmtti7Xb/MhlzD7XGS8fYG63QyeTlL33WbIdl9WDS4L+xfaU3kxxPwS3+PN2BWZ36Nbv1Mfrsg+78v716f77RjMCF9XIn6zHdv3/axxtvldn9eKPD0mNMbbY0Lj7SdP9rvy7JjQvj2eGxPSQ3/AmNDmFBnrTqpcr8m+zaDdEPd6FKfoUR/W0KP95CLP/ujq0d//0dVjvP8To+X4uT8xbkylbFq1yNs/MbtRlBxj72NstmHzu2/r3tK6Pgz2sb0p9NVVLi90+fy+sO3b/Z58Skt3E1PPPWK13ZWhayvG5S7om13ZPhrlvAz0emp9emvZ94qwvvW4nl/tS0V4g+XhfbxWpI8VH8c4jteKjPVcxY0fvoBk+xzPj3gtHZPs841yj99F8J0q7fJeustvw1ercHCOyyLIr70i78mTbf+yPru+qObV/SmDQ3ydbv9aFbm0rbg/rqLy08tIPAFy/tS0xy8g3BeRenmkqL9YxNbT3zf0F4vougC/FdlsyW7BTGvrPQXNLz+/pdqnLdldCDgz9x/C/vNbGfcTiCuXatWHNXZTVM7P53W86nN77Er0dRXQm2xKyNtz1LqbnuptrAuBvtkM2x7ZNf3Yri8hLPVTkd3p0detVevXt8x9U2R3sbnySC7jw3PW/LWzwx+fHduzdKzXu92yzR6fYbu7ooNHgI5LtH5tO4znvsvjGnX3KqDBtM7m/Ng9RjS/075ueT8MReinIrspKi55bze/siliP7nIbaC5Xwa85Hh8rtbtMya2zvi5IKluymy3RleQ3Lj6psx2xIl32V9e31k+v1px14NZ3tXs+u7Nz9uxexng5Y0a11eifrMd2wWAa4DlupLxmx+8/UMzvCby8jr7r3Q+KTwRfH1X3Oca28mq5zrfbrJKx7GGAcf1babfHJXdM6vX1fKjvFpkjYzc6m3O0+3jTM+dH7tGffL82F9srnWZ80sU7fFVopd3RxO/U+KZKUDdPQ313BTgd5pDuCORywXRt3ck+3s9lcu9nr14w8hM8+1u7+ENo7+/AKC9vepnV8F8DZzbh5fpfDNFvH1F2Xq7Qf240uVLU+ZPjXrvp+4LL7KS9uLO+FqkXv36bNinItp/wM74T22PdthlvX3Z7MrufZNljdK0D++f+0qRZ2cB9kWeHH//zpY8Of6+ezXg0+Pv267X15j1/Abm44Ydb7/9v23v3VeJ2393nQj4ShEeVZePr3/7dB0y2s8u8uxMwPgRMwHjB8wE2PEjZgK2R0cub5/58L6JT98POd6dDNDdvOaTwyp22NvDKrYbI3puWGVb4rlhFTv87WEV281YPTesYts38j05rGK7+apnh1Vs+y2qp4ZVnj87NsMq27P0uWEV2z5R9eSwyn47nhpWsd281XN3dlb8/WEV2z5P9eSIiO0uun9IkeeHVUzKjxhW+c7WPDusYrsv+Dw3rGK7T3Y9O6xi26eZnrpt3p6xT942j/r+sMq2xnPDKrZ9O+BznU+P94dVbDcJ9+ywyneKPDesYttPVT13fsh49/zYrpp/7qZ5/2QHL+24vuT8a49U+HF5UfrxYpFBkdHttSK3iOLdEO3xEyK2m2h69jZxW+TZ28R9kSdvE7+zJc/dJprZD7hN3D2JdLs25LMkHx6s1i8U4SGgUj+8QvrzIfafXOTZ+zOzH/AAoNUf8ACg1R/wAOB2YLPLdQnL5X7i8/d5d1NXXousXLuutvo08227eR6ewikfHhQf5Ssn7Hqyuhz18Qlru3mrp0LarP2IE2271ps3cFXbnPJ1u2yLu5Lx4R39x/NF5Pp+3+vufKlIYZ3Gx5c0HF/ZHeE9ix+WFn4qsn232bNHZ1fkw2sarh9h+KbI7j7ryQcLbDfr9HSWbL9h9ewbePaHeH0G5nbntjlPdi8EHLyI73JnI88XUDWeJr6+Qe/4VGQ37bRe43P51uynjfjO27dWrt7wuuj7S+8BW/eLtyKPX2pmvv1QwLoXEP9wNfGVInxL68O7n79URMv6xoZe19J9sYivpy2uVzVfK2J03msCfLEIXxuyWl47xLe7onWeXF9s8M2W9HdfW1XefpJmW6H56jK3UCsPrjb3JTrfWuvmr5VYF6yt+6MS+8Mq6+O5KnK8eG7IQZFjbA7r259T/06JZ2bPbbz9QfXvtMZaO65SX27SevkQ8KsRdN2S14t0Dm5/NYJ0PQNzQ3+1yLqmeqdIW7GsLyfq9UfXHv/KbF9b29eIU7/2mU+vrd2XWM8GXF+/8WqJtimxfTM575pr17b40svNn3nsbPutkiebc1viueZ8ssSuOfcfCFovmhvFXvzGUOVLi/Xhi9WPtx8E3H/szFkjsvmA3L4G71XYfS5i/7GzNRh6w1c/usZ6l66PP/62/aBe4aN8ZfPNiudrtNdqyOopVUp9cTvG5e0Mr35gUHmLwObrG/saRo364scSZQ1A3sptjst28YDybIddr4A+DtrX3SesnrsC+k6JZ66Aqti7V0DbxmCqTbS1TWPs3qXqLKi6DNn781thfF/Jhm22Yvf2gOc+CVq3L/x78pugu32pTJJVKQ/3ZV9jrXG9jX60F2usJzxvlzqbNt09ffTcvdO+xFP3Tt8p8cy903c+Y94rcyiXtzB/3oy3l6Z+bzOOy2Y8bo39SOMaaChD5fGXcur2TX8qzAirbr4MU7fv+lNOEdFe5NUy7bI1vYxNmf1nq3mauD1+VLRun6laW+KXEZjbkNeXtuOpz2dX275d+pmvX39nO577/HXdvvXvye9f1/0L9y7zuoTRpw9gf++M7fLkGbsto1wAqNZNmd2TVU++lbluH6x67q3Mdftc1XNvZa67x4eefivzd8KN53dtPMzp8e7d6ft3QrsCz7wQ5Xg3PHYTn23NWJZ2Occ/P/C7LbE+XV2uL+v7SonO/M91HcYXSsxPRGc3O2S8VoL5sONyS/mVHeEtW6WX15qzy/q97frSjhTh82nXoduvlNA1El7seK2E8UIHu6wV/FIJnr4yG29vxasl1oucbhP5+rBE3Q0MXt9a+OGLGE93VbailvJKWFwKyEsFnvvc4S6unvrY4fFuZB/vRvbxEyO7dCJiXNacf7442ZdgMcN1auYLJQarvMZllfYXStziksS9/Ih/qcS6T5qfK3+pxOU7YrfQeqmErUkquT4696USbMWHOdCvlOBZhHqdw/hCiQ834eO1Emvo7YeUsNeas64TXK6DPF8p0fgxb/5iievTEK8d1LZuqn5ICXuphPa1bkmv7yD+WgneL3281Jw6hHWy7fGOtN0TUO//jN4ujtmM8dohKcfl89CvlTgGnz65DGO8GJ6vlijrEWq5DmB8rcTlQ8rl7Qh/tYRfnhV4LTwLR+TDUoUvleAb5i/G1mVHXi3BKwvmB+of97NSf2o/a3yJ8vpmWzva8yXWUti5Uv/9Ev5SCWeFgl+GTb5UwtmKyyMCXynRWY5zfYHzqyXktSPSnU+l+mvN2S+PkI3X2mIc6/fs+rGDL5XghcejvnZq9dXPPnw29gslrkub5fJdkM8l2vaNlML4i3x4Evb5zRgkxnjpDBdd59YN22sllKF9qy+WYMjW2tsl6qtbcZnlPF4r0WiLUd7eivHa6alrKOrbEv9++79//NOvf/vDb3/90x///utf//K/t7/5r1nsb7/+8T9++/P5f//rH3/50+Xf/v3//k/+m//426+//fbrf//hf/721z/9+T//8bc/z0rz3/1ynP/zb/W4jULVY4x//90vZf7/+Qn1ehtZu/1/vf3/2+R9r/Pfnf/yuP3LJv/+r7l1/w8="
237
+ "bytecode": "H4sIAAAAAAAA/+2dd3xUxRbHk9300Ek2IQkpqNgLUuwKBFAUBAkRERXXZAkrSxKSDRIssApW1IRir4QEFLFhB7vYOGPvYkHsXRB7eRNkd2fvvTO7d/Pj+XnvM/51yOx8z7lTzpwzez3rXNh85Z01U6ZUTHV7qyfXeSo83pkelji4ObByaJ3X5/NWlbp9vsUJCwOtQ+rq3I0bEgcvampe+FRxgvq/xISoH0mIDZSIAjlQICcKlIQCJaNAKShQKgqUhgKlo0AZKFAmCtQJBeqMAnVBgbqiQN1QoO4oUA8UqCcKlIUCZaNALhQoBwXKRYF6oUB5KFA+ClSAAvVGgQpRoCIUqBgFKkGB+qBAO6FAO6NAu6BAfVGgXVGg3VCg3VGgPVCgPVGgvVCgvVGgfVCgfVGg/VCgfijQ/ihQfxRoAAo0EAUahAIdgAIdiAIdhAIdjAIdggIdigIdhgIdjgIdgQINRoGGoEBDUaBSFGgYCjQcBRqBAh2JAh2FAo1EgY5GgY5BgUahQKNRoGNRoDEo0FgU6DgUaBwKVIYCjUeBylGg41GgCSjQCSjQRBToRBRoEgp0Egp0Mgp0Cgo0GQU6FQVyo0CnoUAVKFAlCuRBgaagQFUo0FQUyIsCnY4CTUOBfCjQdBSoGgWqQYFqUaAZKFAdClSPAvlRoAYUaCYKdAYKNAsFakSBZqNAZ6JAZ6FAZ6NA56BAc1AgmgsjBWCkc2Gk82CkeTDSfBjpfBjpAhjpQhjpIhjpYhjpEhhpAYx0KYx0GYx0OYzUBCM1w0gLYaRFMNJiGGkJjHQFjHQljHQVjHQ1jHQNjHQtjHQdjHQ9jHQDjHQjjHQTjHQzjLQURmqBkZbBSK0wUhuMtBxGWgEj3QIj3QojrYSRboORVsFIt8NId8BId8JId8FId8NIq2Gke2Cke2Gk+2Ck+2GkB2CkB2Gkh2CkNTDSWhjpYRjpERjpURjpMRjpcRjpCRjpSRjpKRhpHYz0NIz0DIz0LIz0HIz0PIy0HkYiGInBSC/ASC/CSC/BSC/DSK/ASK/CSK/BSK/DSG/ASG/CSG/BSG/DSO/ASO/CSBtgpPdgpPdhpA9gpA9hpI0w0kcw0iYY6WMY6RMY6VMY6TMY6XMY6QsY6UsY6SsY6WsY6RsY6VsY6TsY6XsY6QcYaTOMtAVG+hFG2goj/QQj/Qwj/QIj/Qoj/QYj/Q4j/QEj/Qkj/QUj/Y0iMVwFJoarwcRwVZgYrg4Tw1ViYrhaTAxXjYnh6jExXEUmhqvJxHBVmRiuLhPDVWZiuNpMDFedieHqMzFchSaGq9HEcFWaGK5OE8NVamK4Wk0MV62J4eo1MVzFJoar2cRwVZsYrm4Tw1VuYrjaTQxXvYnh6jcxXAUnhqvhxHBVnBiujhPDVXJiuFpODFfNieHqOTFcRSeGq+nEcFWdGK6uE8NVdmK42k4MV92J4eo7MVyFJ4ar8cRwVZ4Yrs4Tw1V6YrhaTwxX7Ynh6j0xXMUnhqv5xHBVnxiu7hPDVX5iuNpPDFf9icVS/ynQVuatrvJ5YkXGUAmqaVFT9P+dJnFD4pCERIczKTklNS09I7NT5y5du3Xv0TMr25WT2ysvv6B3YVFxSZ+ddt6l76677b7Hnnvtvc+++/Xbv/+AgYMOOPCggw859LDDjxg8ZGjpsOEjjjxq5NHHjBp97Jixx40rG19+/IQTJp446aSTT5l8qvu0ikrPlKqp3tOn+aZX19TOqKv3N8w8Y1bj7DPPOvucOTSXAnQunUfzaD6dTxfQhXQRXUyX0AK6lC6jy6mJmmkhLaLFtISuoCvpKrqarqFr6Tq6nm6gG+kmupmWUgsto1Zqo+W0gm6hW2kl3Uar6Ha6g+6ku+huWk330L10H91PD9CD9BCtobX0MD1Cj9Jj9Dg9QU/SU7SOnqZn6Fl6jp6n9UTE6AV6kV6il+kVepVeo9fpDXqT3qK36R16lzbQe/Q+fUAf0kb6iDbRx/QJfUqf0ef0BX1JX9HX9A19S9/R9/QDbaYt9CNtpZ/oZ/qFfqXf6Hf6g/6kv+hvfivJbxP5LSC/veO3bvy2jN9y8dspfqvEb4P4LQ6/feG3Jvy2g99S8NsFfivAs3mehfPsmWe9PFvlWSbPDnlWx7MxnkXx7IdnLTzb4FkCj+55VM6jaR4F8+iVR508WuRRHo/OeFTFoyEexfDog0cN/LTnpzQ/XfmpyE8zfgrx04N7fe6tuZfl3pF7Ne6NuBfhu5/vWr7b+C7hq5uvxqYmvm5NJfM3OC8JtJbWVNf7FwXahnn5X/2OwPKR1X5Plaeupbx/9GMu0dg/0Vb/wHxj/wRb/RPnB5a1l/pvZo6qEGnFOI/P7eePl2SPNcRMSLY3GgmB29qtqXT73aU1tY2hhxom2iTAue3Co5eFBVGr4VPlYSH4qaXl/QwfmhAWwqhBAwyfqgoLCoXesCBXOC0sKBSeGRYUCs8OC3KFc8KCQiFdLkgKldQsSHKlJEoqtS2CpFLbKkgKtcsFSaX2fkFSqX1QkBRq1wiSSu16QVKpZYKkUPuiIKnUfiBIKrUbBUmhdpMgqdRuESSV2q2CpFD7syAp1PLjRhQVivmRJIpy1fzUEkWl8nxRVCrvLYoq5UWiqFS+rygqlfcTRZXy/qKoVF4qikrlw0VRpfxIUVQqnyCKSuUTRVGlfJIoKpVPE0Wl8umiqFJeI4pK5XNEUak8IIoq5eeJolL5PFGMUG6KEGzGS8M6HGOcGmgZXTNzoRhRhEIvEzvFHtsdWDnUW+2ua+SdxtQuCYFbhlRWbnv8kCZBw6qR1ZXb/tqx8IuHkpHKwypC6s3P7DCORpo4NYa2dNFs01hl2jO3q5GeoZiHTvbY3ezPQyf5PGSA5qGTeR4yjPOw/Z9OcUIiWpJEkyNaksWpCEb13kBrmb+mzmM9ixmAWZQ8bJr5YdNELZJu6eZu6eExWjaqxl0pPEqqCFc9aKotM0P6tJHayP8LI7Wz1s5aO2ttpDZSO2vtrLWz1rtXG6mN1M5aO2vtrLWL0UZqZ62dtXbW2llrI7WR2llrZ62dtd692khtpHbW2llrZ61djDZSO2vtrLWz1s5aG6mN1M5aO2vtrPXu1UZqI7Wz1s5aO2ttpDZSO2vtrLWz1rtXG6mN1M5aO2vtrPXu1UZqZ62dtXbW2llrI7WR2llrZ62dtd692khtpHbW2llrZ61djDZSO2vtrLWz1s5aG6mN/BeNNLhaR1hMMrY5g73ay5sH3Yi/o7XNE+ebCU67v5+yjI9mbbP1cziNvxVT2jrC6/FVcux7FfvVXLDE8+uKScc1zVowlY26tSzl61cH/tY6ddNza9dubhvn8TfUVVsfGanGI8MZdrcR3jct/IGIv6eHHfeyoxum1/LBnBFcM9tbUsKM4Hoxdk6xti7NaJ10nQSBxg7pUTpkrBjlqa8fP9VdbakmNdDW/lAjp4RMzmCO6aERHcEfxltV3b6Ilqxxz/Z7KiY3+H2Tqzz+cr/X5/U38inze2b5NyTkBFaN9kyvqWvk9tVxjeI2kbWkSVvSpS0Z0pZMaUsnaUtnaUsXaUtXaUs3aUt3aUsPaUtPaUuWtCVb2uKStshnLlfa0kvakidtyZe2FEhbercvrLYy7/Ran+cfd/C/9q/IH5iI9pFBA2wxl5X32/9A9V+jW9rUZPbsqSHfG82lGw6fZEUOkGbvuOhuPwdIk+cAyaAcwOJsT1bkVOkdy3vU0cEKY4oheEmhLXhsBczRTEYM0UyGMuuRdMqMPHasFKaHj55wN+aYYwrIIn70I66Qy/TcjogYr4MLNUE17UvL+8Ww2Fo7mLJ263AemNLhnN3iKTrbI1jsny72CE4zoas9QpKZ0M0eIdlM6B5jKLvF3LWH3XTeROhpj9DT/AtEcj+TYuVnlsg2aZbEKSRFJC8mp5DFHNeG4FfJ4A6lY46IZN/eJRzK1nvajwp/nbvCX9ZYXVHqrpjqGVk90+3z8oNxkTwwCdxylMddO6Suzt0o+hV5CJiyyHAIt/7TuTnyz90sA4dgQG50ja4YXKPLPDCu2Fyjy3oybgpmlU5vB2Y6wxreEoL7pPCW0Q0+KVd6M5VjHgdH1HPMYvByxEBcMSEuG4ZkiV5X0q1XPPbnmjv1Eh/FaH+uKMZlf2dZt7x47Ld46DyV/b1EMS77u8i65cdjv8VD56vszxPFuOyXXugWxGO/xUMXqOzPF8W47O8GtT/Lpv1Zqs2dE9/mzlF4W1fEx0wOMY85nggdfY8ZT99sMXoPfuoZa8w6c2CQY/v6bnydu/36zpx45ShMyxdMM45oQQwjWmA1hTGNaIHRqkJFdlpkN1a1nZ0WybPTQlB2WmQeq0JJEHRPxHVeqbu2vsHHx1F+R2MZ8BQlLjQFLO2/zmkd3CQuVgRUhpbgLXAct3q9Fnf0ZsbO8AoGGZd3kShu/xlSq54F29Wu+kfttn+MqV0s7gEe8lh2NXOLxEmz+m1VS8x2C4wfKZCtUbmt2wYp/M/uIsGwH/MU+9Hmlsiyvx8L5fsxD7QfC63CF/ltUbHdVE2ittistlgxDSViW9BZbzK71hLxvJGoLjGrLol6SveRpAslov3mY60Pc2w07bnCGI6UQqWbVB0phf91fYa5EmIQUzaeL7YF5/FbqVGSQRc09JAuMElfwYKeFhNWyJzjQ4ZtNjkb4blzg77axChmjq1Cjih76yLP+HVikl1/EtRRY56C0DeIsWddOVE3gcUiyRVH1rRMYll5LmX+Ic01c28Pzu/wGQ1uX72UYHVFkMucCaHRO1eqQrKEXOolxOHOGKY/Z8dNf27U6c+zmsk4Mq08cVRM0y/Mgp1U1xXD9Ocppz9qzuLsEn36XdG9j9X0u5izewzTn7vjpt8Vz/S7Ojj9Ocrpz5ZBs5W3V3Hu/hxRseUGLRCm3+jjxdszdbAtu0PMVq+QLOYsjmGFuHbcCsmK53zIiucqKVccFdMKiVg/sZ8P2TGskBzlCslWnw85zLlndAeR3RbF91hNfjZz7hNCz7exLbKiZ8n1oSy5qclGHhtqKbLOoLN7xpvHWufYPWNLZdUXY9KJz1ZOfEHEgFrNzgCFa8g2uwbZzrLIF107/P7GJc8Xs0D5oku5MuWpgEV4kBPf+bDjNkLoQsd6GyRit0FijNtAcsgIX2xaf1HlHBJayRdKD5nkDh4y3TtyyGTHc8ioz4MUZa7ay4YlKTH4GpfS16SowxAeKI6KIQo1W5bU4eMvKerxN1awTP5tu8v8cpUwk/Jv4rOjfxNfEk+IWmh1tSP4G8XNSKFlIu+c+O8m8sVR91CJ1UVa1Nss5ThZJPJ9xIGKffBjSeRLYk3krWaohDkro++hkihJhvzUKjHfBwvDLL/cKhQut4xHcujYFl+qlC+SzuseGLPxl9q+5u+2grMcfPWig4o+Ths73HHvgqLoiiTvljsl77eLYbKxj8P0dncqc841/l9HIUtijYhCGzG2V9Sd4Q4RmjMkb9xnhk3bPs/OswyjkhZmGN64zwx/xPp9eKN1GVFeoM80dsiM0qGT5Rv3GcIL+4Y56cScs2TLy/Zrq8ERC0hm2Qlazy+lfvXj+qermnb4xplX+uTeH322evYOV7R64F4Hdz6h79yoiv4D9+ocjaD4AAA=",
238
+ "debug_symbols": "tZnRbho7EIbfhetceMYztievElUVTekREiIRTY50VOXdj4f1b6CSLQLtTfwR2G9nZ2dsL/xafd98e//n63b/4+Xn6vHp1+rbYbvbbf/5unt5Xr9tX/b1v79Wwf8kLqvH+FBHWz2mOsbQRmojtzG2UdqobUxtzG0sbWw+aT5pPmk+qb7so7RRlzHVzxUf6/8pOCggt3dKG20Zcz0DsQMB6jlIHCJAAApIgAwoAGtQAoAAMBeYC8wF5gJzgbnAXGA2mA1mg9lgNpgNZoPZYDaYrZlzCAAC+FHJIQNKA/LPZAcGREA9O5ODAhIgAwrAGnA9O/vhTAAGRICbi4MCEqCaY3DwqvTgvSyP4HW5AAEYEAECUEACZADMEWaB2Us0elq8RheIADd7hF6mC6QGWg8Xj1nr4RId6odFHeqHxS9ZE6CGIcejCsAapAAgAAMiwM3moIAEyIBqVr8X3h9H8AZZoJqVHRgQAQJQQAJkgJv9Ar1BjuANsgAB3OzX7g2ygADc7Mn0BlkgAwrAGniDLEAAN3sOvUEWEIAC3OyJ8gZJflO8QRawBYo3SCIHAjAgAgSggARwMzsUgDWgAHCzODAgAtysDgpwc3LIgAKwBt5W2YP3tsp+Cm+rBSJAAApIgAyo5hwdrIG3VfYwvK0WYICb/ezeVgsoIAEyoACsgbdVzg4EYEAEuLk4KCABcgP1o8whAgSgS8eVY38dwdcIT5T31wLWwPtrAQIwIAKqufhd9v5aIAEywDuXPj4eVlhNv74dNhtfTM+W17rovq4Pm/3b6nH/vts9rP5d796PH/r5ut4fx7f1ob5bT7vZf69jFf7Y7jZOHw+no8P4UAp1dW6HV07WFRTihYTGEuHUFCK5C7JcHM/j46PiCmIupwAKfeIqrPSrqHPd8CpkLNFarc2hRU+5JE0XCh0rODGSyXWX0hXp+hhS6TGc3wy9XmGMbKrFdIsiqc+ER0XdS8lQYWNF3TE0Q106zm5puP4yegxqk0zQpC4jE7IZOcrgdswNxWCIIY8McdIb1GMQivnzJZFCVNyMoHGciEldGqGyjU8VIXR1DOQLzxLDeSI/U1MsJ4WOFZ6tYZtbQlWR5bP7eXkhNKlLytSnu7orGSk4zJKJIKyczVbZrjeY9MmKdKyYTJnM0mca1uE95TibNPk08yuNw5jd1fqM12eKVM7C+G3ynxRnfTJCh9RnIxs70iQdon3ezWeGGwvDhoUxK0/mnox6e+Kwtmw682K+SWpyUxSUMHHWeIZRxNl6rn09z+O6iDyb9UpX8NkKIsSXjll9ar8hZ9Oe1Ia5OgruK7rEQOMoJtVJXOCgSDSOY+KIdUeCVaTujcdx5L/roPrUbr3IicOw1+KsU4KE08QhId5qodOWTYSHFplUav1KqM8/9W6PHbMqKX1lknIxlconMhuFemaj5nEkk9k0ptM+WIaVNjVI366ojQ3p/mzMHBxxHax8UxScu6Gkcc+V+ytDw/25mDmuy8XUcF0u8h/IhfyBXMjduZC/mYsafO7XkcNN3X51LuzvOq7Mp92dz9nsGcn6GjtZl1L8A2vsbM+SEYZKGO5Zphun2PcsLOG2vZeQ9DtytqX+TZHyvXuvNAkiWkC3R+Pxuppm1Rlyf2oNRjc6knZHHq+Ime6t8Gk+r6qL6ZchfbeTlMbP33nmyLk//OazdH7CULh/C1Ak32Q4PcOXfMsXERr7c5rK+An+E7s+1pt2bFfuL/imee9Lfbl+3h4ufuj8cNVhu/6227SXP973z2fvvv33infwQ+nr4eV58/39sHHT6dfS+uep1KIslr88rOq3xk+p/liW2F/5l/5PFuTBQvry4bH8Dw=="
435
239
  },
436
240
  {
437
241
  "name": "public_dispatch",
@@ -455,6 +259,11 @@
455
259
  "error_kind": "string",
456
260
  "string": "Block number mismatch."
457
261
  },
262
+ "5920041279672922605": {
263
+ "error_kind": "fmtstring",
264
+ "length": 17,
265
+ "item_types": []
266
+ },
458
267
  "6989792215391248978": {
459
268
  "error_kind": "string",
460
269
  "string": "Function check_timestamp can only be called statically"
@@ -463,7 +272,7 @@
463
272
  "error_kind": "string",
464
273
  "string": "Function check_block_number can only be called statically"
465
274
  },
466
- "12511970388699677811": {
275
+ "9663057235827813545": {
467
276
  "error_kind": "fmtstring",
468
277
  "length": 27,
469
278
  "item_types": [
@@ -475,16 +284,11 @@
475
284
  "13950240626967988787": {
476
285
  "error_kind": "string",
477
286
  "string": "Timestamp mismatch."
478
- },
479
- "15015303112667403944": {
480
- "error_kind": "fmtstring",
481
- "length": 17,
482
- "item_types": []
483
287
  }
484
288
  }
485
289
  },
486
- "bytecode": "JwACBAEoAAABBIBTJwAABFMlAAAAQScCAwQBJwIEBAAfCgADAAQAUi0IUgIlAAAAjScCAgRTJwIDBAA7DgADAAInAEMCAScARAICJwBFAgMnAEYCBCcARwIFJwBIAgYnAEkBACcASgEBJwBLAiAnAEwCZScATQJsJwBOAm4nAE8CbycAUAJyJwBRAnQmKQIAAwAY1alOCioCAwQnAgUEACcCBwQDACoFBwYtCAEDAAgBBgEnAwMEAQAiAwIGLQ4FBgAiBgIGLQ4FBicCBgQDACoDBgUnAgUEAScCBgQCJwIHBAAkAgAEAAAA8CMAAAHALQgBBCcCCAQDAAgBCAEnAwQEAQAiBAIIHzoABgAFAAgAKgQFCC0LCAgcCggKAhwKCgkAHAoJCAIAKgQGCS0LCQkcCgkKBRwKCgQAHgIACQAeAgAKAB4CAAsJJAIACwAAAVclAAAETh4CAAsGHAoLDAAnAg0EDi0IAA4tCgwQLQoIES0KBBIACAANACUAAARgLQIAAC0KEAskAgALAAABlSUAAAZ/LQsDBAAiBAIELQ4EAwAiAwIILQsICCcCCwQDACoDCwQ7DgAIAAQjAAABwCkCAAQAT2MoqAoqAgQIJAIACAAAAdsjAAACqy0IAQQnAggEAwAIAQgBJwMEBAEAIgQCCB86AAYABQAIACoEBQgtCwgIHAoICQIcCgkFABwKBQgCACoEBgUtCwUFHAoFBgQcCgYEAB4CAAUAHgIABgAeAgAJCSQCAAkAAAJCJQAABpEeAgAJBRwKCQoAJwILBAwtCAAMLQoKDi0KCA8tCgQQAAgACwAlAAAEYC0CAAAtCg4JJAIACQAAAoAlAAAGoy0LAwQAIgQCBC0OBAMAIgMCCC0LCAgnAgkEAwAqAwkEOw4ACAAEIwAAAqsnAgMCVScCBAJrJwIFAncnAgYCcycCBwJjJwIIAnsnAgkCfS0IAQonAgsEHAAIAQsBJwMKBAEAIgoCCy0KCwwtDgMMACIMAgwtDE4MACIMAgwtDgQMACIMAgwtDE4MACIMAgwtDE8MACIMAgwtDgUMACIMAgwtDE4MACIMAgwtDEsMACIMAgwtDgYMACIMAgwtDEwMACIMAgwtDE0MACIMAgwtDEwMACIMAgwtDgcMACIMAgwtDFEMACIMAgwtDE8MACIMAgwtDFAMACIMAgwtDEsMACIMAgwtDggMACIMAgwtDgYMACIMAgwtDEwMACIMAgwtDE0MACIMAgwtDEwMACIMAgwtDgcMACIMAgwtDFEMACIMAgwtDE8MACIMAgwtDFAMACIMAgwtDgkMJwIDAAEKIElKBCQCAAQAAAROJwIFBB4tCAEGJwIHBB4ACAEHAS0KBgcqAwAHBa2jcsb6poRzACIHAgcAIgoCCCcCCQQbLQIIAy0CBwQtAgkFJQAABrUnAggEGwAqBwgHLQ4DBwAiBwIHLQ4CBwAiBwIHPA4FBioBAAEFYQC6/IQvolI8BAIBJgoqAgQGDCoCBAcKIgNDAiQCAAIAAAZxIwAABHwKIgNEBBYKBggkAgAEAAAGXyMAAASSCiIDRQkkAgAJAAAGTSMAAASkCiIDRgokAgAKAAAGOiMAAAS2CiIDRwoWCgcLJAIACgAABicjAAAEzAoiA0gHJAIABwAABhkjAAAE3icCAgJJJwIDAnYnAgQCYScCBQJpJwIGAmQnAgcCcC0IAQgnAgkEEgAIAQkBJwMIBAEAIggCCS0KCQotDgIKACIKAgotDE4KACIKAgotDgMKACIKAgotDgQKACIKAgotDE0KACIKAgotDgUKACIKAgotDgYKACIKAgotDEsKACIKAgotDE8KACIKAgotDgcKACIKAgotDEwKACIKAgotDFAKACIKAgotDgQKACIKAgotDFEKACIKAgotDgUKACIKAgotDE8KACIKAgotDE4KJwICAAAKIElKAyQCAAMAAAYZJwIEBBMtCAEFJwIGBBMACAEGAS0KBQYqAwAGBdBhEqBhW5aoACIGAgYAIggCBycCCQQRLQIHAy0CBgQtAgkFJQAABrUnAgcEEQAqBgcGLQ4CBgAiBgIGPA4EBSMAAAYeLQoLBiMAAAYxBCoLCAYjAAAGMS0KBgkjAAAGRBIqBwYJIwAABkQtCgkEIwAABlYtCgcEIwAABlYtCgQCIwAABmgtCggCIwAABmgtCgIFIwAABnotCgYFIwAABnotCgUCJioBAAEFwZk18E2mSjM8BAIBJioBAAEFZL7Lx4qT/3I8BAIBJioBAAEFL9JQKw6R0Jk8BAIBJgAAAwUHLQADCC0ABAkKAAgHCiQAAAoAAAbmLQEIBi0EBgkAAAgCCAAACQIJIwAABsIm",
487
- "debug_symbols": "tZnbbhs7DEX/xc95kERSl/xKURRu6hYGDCdwkwMcBPn3iiNu2g4wQmo0L9ESndkUKeoy9uvmx+77y69v++PPx9+b+y+vm++n/eGw//Xt8Piwfd4/Hrv1dRP0T+S4uY93myjBWtncp97mYK31i/ULW9tGW61frd/I2rq0KSRry2i567C2bG0brVhfrJ+tX/rzRdsy2trHW7XNo23Wb70fw92GQgT0kcceEsUAUIt0SGppChpdHxaRhkcK1YA1kKyglu6aRC1VoRrkBMgGS5oWYEAzqLBUPN7scQ4BMLLNYWSTI1vbH6EeFCcCFANKAFh0wD1cljLaIksquYzUcmVrrd+s30Zfwki1xGTtSLWkaK31qfcpKWQDnVwiBTFYykoUZKRclsLSf14qS/+nEECj7CmXqlGqa00VqS8tqwFlQNZ5HiCAZqBZGwBLIgAeJzzFo7Azs7Uj9Vks01ks9zkngGU6F1h0wKkpVIMGSzNLCQSAJcISYUkJUAwIFoKFYeFsoEkeIIBmoMtoAFwUOC0QrBCsENRFNcAEawgABpiLiigqoqiIoiKKShFgLipDkOGCIShwIRDMcJEhWOCiQLDCRYVgg4sGwWYuGuaiYS5aTABz0VIEmItGASAACDIDIChwIRDMcJEhWOCiQLDCxbJIg0IzaGaJQfdUowKK0SmDktt0nxuk+9sg3eCM3CZuE1fOrpJdRbc5I7dVt1UfKQYfQ3PlBm9Rt2GOC6lKVtIcc1FaRlWVllEttPhtSrrQRFVS6PGKqiTNwaCkn+oxlHSRDJLo5Lbstuy24rbiNo3NSEDNbQ02CsGJnTAW0pViVEC6VozgjSg6uTK7MruyrphB4sri3rIrZ/fmsZHHRh4beWxUXbm5twZlDuQEZY7JCcqcohOUmYITO8EbsyuzexNV5oUKKLtNK8JInBpIK9HIbVqJC8lSOQstlTPIbcltSZygIuQquqIGsdvYbT568dHLMlJRWrKb397uNriafXs+7XZ6M7u4q/Ub3NP2tDs+b+6PL4fD3ea/7eFl+affT9vj0j5vT/3Tvh52xx+97YI/94ed0tvd+emw/ihzIXua+43ABfoa/rBErAUS/T54i0Rizcsi0ddrWJWgmURll0hylij5w6NoDbmgkNPqKGQmkTAZqVF0CY5yJZGnuYBCLhcC6bYxtNUxTCR6ArNJyPUoriXaJ4ZxNYY+iWtjmEwo1QyJftden9CYJnH0FwoEQpd1Fdu1xqQ2Y78nQKSznOekXKcj8mQgpfqs8mp5T0PJFenoYnU9lEl10jkS4nxOx/thlH+RjfqZ2SAqxSMJvJqNNCuwXlXNt4wgYS2UFCf5CL5zxX6x+gfB5PWpnWiUhlBqOu9ccn2UpFmF5iJ8XvRlPRuTZZ99FCXelouLOCitxTETqBUCLbU1gemB6DsXx7Z+mqU2qyxO57NoPREyPdr9XOaL5f5+A6X4ibv41SDa+kkym49+m8di75dzWpsRmpWmZM9n5xzXSpNmpelrPV+s9L8pzatIKt9SnP0lB5cUvfXfUJ79DotBCBVZv2xNyrNgnZeL+0X68Lnc2I/lcxL6d4EfXmEJk8mprgrwbJOQEhGCXJ0g1xI0Owpj9D03Xtx7r+uBeXp+nG+ciVclJkXZjwyv7Kjv6muhTF8CfD4uNu2/mI/+SuUVRTcJFFxZpeVbBC7X5k0CJWAEJd0mUJKviXaLQCU/t/L6CIQ+a1UW3xbKbSnMGQK5vlvWX3t3+7A/Xf0U8aZSp/32+2Fn3Z8vx4eLT5//f8In+Cnj6fT4sPvxctqp0vn3jP4G/oX690ck5at+TaTdHk6/C319U+9/AA=="
290
+ "bytecode": "JwACBAEoAAABBIBTJwAABFMlAAAAQScCAwQBJwIEBAAfCgADAAQAUi0IUgIlAAAAjScCAgRTJwIDBAA7DgADAAInAEMCAScARAICJwBFAgMnAEYCBCcARwIFJwBIAgYnAEkBACcASgEBJwBLAiAnAEwCZScATQJsJwBOAm4nAE8CbycAUAJyJwBRAnQmKQIAAwAY1alOCioCAwQnAgUEACcCBwQDACoFBwYtCAEDAAgBBgEnAwMEAQAiAwIGLQ4FBgAiBgIGLQ4FBicCBgQDACoDBgUnAgUEAScCBgQCJwIHBAAkAgAEAAAA8CMAAAHALQgBBCcCCAQDAAgBCAEnAwQEAQAiBAIIHzoABgAFAAgAKgQFCC0LCAgcCggKAhwKCgkAHAoJCAIAKgQGCS0LCQkcCgkKBRwKCgQAHgIACQAeAgAJAB4CAAkJJAIACQAAAVclAAAETh4CAAkGHAoJCgAnAgsEDC0IAAwtCgoOLQoIDy0KBBAACAALACUAAARgLQIAAC0KDgkkAgAJAAABlSUAAAZ/LQsDBAAiBAIELQ4EAwAiAwIILQsICCcCCQQDACoDCQQ7DgAIAAQjAAABwCkCAAQAT2MoqAoqAgQIJAIACAAAAdsjAAACqy0IAQQnAggEAwAIAQgBJwMEBAEAIgQCCB86AAYABQAIACoEBQgtCwgIHAoICQIcCgkFABwKBQgCACoEBgUtCwUFHAoFBgQcCgYEAB4CAAUAHgIABQAeAgAFCSQCAAUAAAJCJQAABpEeAgAFBRwKBQYAJwIJBAotCAAKLQoGDC0KCA0tCgQOAAgACQAlAAAEYC0CAAAtCgwFJAIABQAAAoAlAAAGoy0LAwQAIgQCBC0OBAMAIgMCBS0LBQUnAgYEAwAqAwYEOw4ABQAEIwAAAqsnAgMCVScCBAJrJwIFAncnAgYCcycCBwJjJwIIAnsnAgkCfS0IAQonAgsEHAAIAQsBJwMKBAEAIgoCCy0KCwwtDgMMACIMAgwtDE4MACIMAgwtDgQMACIMAgwtDE4MACIMAgwtDE8MACIMAgwtDgUMACIMAgwtDE4MACIMAgwtDEsMACIMAgwtDgYMACIMAgwtDEwMACIMAgwtDE0MACIMAgwtDEwMACIMAgwtDgcMACIMAgwtDFEMACIMAgwtDE8MACIMAgwtDFAMACIMAgwtDEsMACIMAgwtDggMACIMAgwtDgYMACIMAgwtDEwMACIMAgwtDE0MACIMAgwtDEwMACIMAgwtDgcMACIMAgwtDFEMACIMAgwtDE8MACIMAgwtDFAMACIMAgwtDgkMJwIDAAEKIElKBCQCAAQAAAROJwIFBB4tCAEGJwIHBB4ACAEHAS0KBgcqAwAHBYYaE1vhyOypACIHAgcAIgoCCCcCCQQbLQIIAy0CBwQtAgkFJQAABrUnAggEGwAqBwgHLQ4DBwAiBwIHLQ4CBwAiBwIHPA4FBioBAAEFYQC6/IQvolI8BAIBJgoqAgQGDCoCBAcKIgNDAiQCAAIAAAZxIwAABHwKIgNEBBYKBggkAgAEAAAGXyMAAASSCiIDRQkkAgAJAAAGTSMAAASkCiIDRgokAgAKAAAGOiMAAAS2CiIDRwoWCgcLJAIACgAABicjAAAEzAoiA0gHJAIABwAABhkjAAAE3icCAgJJJwIDAnYnAgQCYScCBQJpJwIGAmQnAgcCcC0IAQgnAgkEEgAIAQkBJwMIBAEAIggCCS0KCQotDgIKACIKAgotDE4KACIKAgotDgMKACIKAgotDgQKACIKAgotDE0KACIKAgotDgUKACIKAgotDgYKACIKAgotDEsKACIKAgotDE8KACIKAgotDgcKACIKAgotDEwKACIKAgotDFAKACIKAgotDgQKACIKAgotDFEKACIKAgotDgUKACIKAgotDE8KACIKAgotDE4KJwICAAAKIElKAyQCAAMAAAYZJwIEBBMtCAEFJwIGBBMACAEGAS0KBQYqAwAGBVIoNi2ajbHtACIGAgYAIggCBycCCQQRLQIHAy0CBgQtAgkFJQAABrUnAgcEEQAqBgcGLQ4CBgAiBgIGPA4EBSMAAAYeLQoLBiMAAAYxBCoLCAYjAAAGMS0KBgkjAAAGRBIqBwYJIwAABkQtCgkEIwAABlYtCgcEIwAABlYtCgQCIwAABmgtCggCIwAABmgtCgIFIwAABnotCgYFIwAABnotCgUCJioBAAEFwZk18E2mSjM8BAIBJioBAAEFZL7Lx4qT/3I8BAIBJioBAAEFL9JQKw6R0Jk8BAIBJgAAAwUHLQADCC0ABAkjAAAG2S0BCAYtBAYJAAAIAggAAAkCCQwACAcKJAAACgAABscm",
291
+ "debug_symbols": "tZnbamM7DIbfJde9sC3Jh77KMAyZTjoEQloy7YZN6buPtaxfSQrLlDC9qT8rXb8sWT6s5G3za/fz9feP/fHx6c/m/tvb5udpfzjsf/84PD1sX/ZPx2592wT9Ezlu7uPdJkqwVjb3qbc5WGv9Yv3C1rbRVutX6zeyti5tCsnaMlruOqwtW9tGK9YX62frl/580baMtvbxVm3zaJv1W+/HcLehEAF95LGHRDEA1CIdklqagkbXh0Wk4ZFCNWANJCuopbsmUUtVqAY5AbLBkqYFGNAMKiwVjzd7nEMAjGxzGNnkyNb2R6gHxYkAxYASABYdcA+XpYy2yJJKLiO1XNla6zfrt9GXMFItMVk7Ui0pWmt96n1KCtlAJ5dIQQyWshIFGSmXpbD0n5fK0v8pBNAoe8qlapTqWlNF6kvLakAZkHWeBwigGWjWBsCSCIDHCU/xKOzMbO1IfRbLdBbLfc4JYJnOBRYdcGoK1aDB0sxSAgFgibBEWFICFAOChWBhWDgbaJIHCKAZ6DIaABcFTgsEKwQrBHVRDTDBGgKAAeaiIoqKKCqiqIiiUgSYi8oQZLhgCApcCAQzXGQIFrgoEKxwUSHY4KJBsJmLhrlomIsWE8BctBQB5qJRAAgAgswACApcCAQzXGQIFrgoEKxwsSzSoNAMmlli0D3VqIBidMqg5Dbd5wbp/jZINzgjt4nbxJWzq2RX0W3OyG3VbdVHisHH0Fy5wVvUbZjjQqqSlTTHXJSWUVWlZVQLLX6bki40UZUUeryiKklzMCjpp3oMJV0kgyQ6uS27LbutuK24TWMzElBzW4ONQnBiJ4yFdKUYFZCuFSN4I4pOrsyuzK6sK2aQuLK4t+zK2b15bOSxkcdGHhtVV27urUGZAzlBmWNygjKn6ARlpuDETvDG7Mrs3kSVeaECym7TijASpwbSSjRym1biQrJUzkJL5QxyW3JbEieoCLmKrqhB7DZ2m49efPSyjFSUluzm9/e7Da5mP15Ou53ezC7uav0G97w97Y4vm/vj6+Fwt/lve3hd/unP8/a4tC/bU/+0r4fd8Vdvu+Dj/rBTer87Px3WH2UuZE9zvxG4QF/Dn5aItUCi3wdvkUiseVkk+noNqxI0k6jsEknOEiV/ehStIRcUclodhcwkEiYjNYou0W90VxJ5mgso5HIhEG8bQ1sdw0SiJzCbhFyP4lqifWEYV2Pok7g2hsmEUs2Q6Hft9QmNaRJHf6FAIHRZV7Fda8xqM/QdEyKh74+uUtK1CE9ESvVZ5dXynoaSK9LRxep6KJPq7McQ0kGcz+n4OIzyL7JRvzIbRKV4JIFXs5FmBRZaixDpV7C0FkqK6yJ6cTKN2C9W/yCYvD61E43SmknUizmR66MkTSu0xHOB9VeY1WxMln32UZR4Wy4u4rgYwoc4ZgK1QqCltiYwPRB95+LY1k+z1GaVxel8Fq0nQqZHu5/LfLHcP26gFL9wF78aRFs/SWbz0W/zWOz9ck5rM0Kz0sw5+PWgv9HTWmnSrDQT6iJLuKk0ryKpfEtx9pccXFL01n9DefY7LAYhVGT9sjU73QNSkeI5DE6fPpkb+8F8fj4JfXqNJSwPTnVVgGfbhBRs3f17k8sz5FqCZodh9N2/r/SzxHVFMM/WeTjfOROvSkzKsh8avldEfVtfC2X6GuDzUcIt89Ffqrym6CaBgkurtHyLwOXqvEmgBIygpNsECqahH0G3CFTykyuvj0Do69Zl8a2h3JbEnCGQ64eF/b13tw/709XPEe8qddpvfx521n18PT5cfPry/zM+wc8Zz6enh92v19NOlc6/afS38G/Uv0MiKd/1qyLt9nD6fej7u3r/Cw=="
488
292
  },
489
293
  {
490
294
  "name": "sync_state",
@@ -493,17 +297,35 @@
493
297
  "abi_utility"
494
298
  ],
495
299
  "abi": {
496
- "parameters": [],
300
+ "parameters": [
301
+ {
302
+ "name": "scope",
303
+ "type": {
304
+ "kind": "struct",
305
+ "path": "aztec::protocol_types::address::aztec_address::AztecAddress",
306
+ "fields": [
307
+ {
308
+ "name": "inner",
309
+ "type": {
310
+ "kind": "field"
311
+ }
312
+ }
313
+ ]
314
+ },
315
+ "visibility": "private"
316
+ }
317
+ ],
497
318
  "return_type": null,
498
319
  "error_types": {
320
+ "291858071673084052": {
321
+ "error_kind": "fmtstring",
322
+ "length": 40,
323
+ "item_types": []
324
+ },
499
325
  "361444214588792908": {
500
326
  "error_kind": "string",
501
327
  "string": "attempt to multiply with overflow"
502
328
  },
503
- "737457407951538843": {
504
- "error_kind": "string",
505
- "string": "BoundedVec has non-zero trailing elements"
506
- },
507
329
  "992401946138144806": {
508
330
  "error_kind": "string",
509
331
  "string": "Attempted to read past end of BoundedVec"
@@ -512,45 +334,26 @@
512
334
  "error_kind": "string",
513
335
  "string": "attempt to subtract with overflow"
514
336
  },
515
- "2967937905572420042": {
337
+ "2767104006428505934": {
516
338
  "error_kind": "fmtstring",
517
- "length": 61,
339
+ "length": 101,
518
340
  "item_types": [
519
341
  {
520
- "kind": "field"
521
- },
522
- {
523
- "kind": "field"
342
+ "kind": "integer",
343
+ "sign": "unsigned",
344
+ "width": 32
524
345
  }
525
346
  ]
526
347
  },
527
- "3330370348214585450": {
348
+ "3632530479893888919": {
528
349
  "error_kind": "fmtstring",
529
- "length": 48,
530
- "item_types": [
531
- {
532
- "kind": "field"
533
- },
534
- {
535
- "kind": "field"
536
- }
537
- ]
350
+ "length": 98,
351
+ "item_types": []
538
352
  },
539
353
  "5421095327929394772": {
540
354
  "error_kind": "string",
541
355
  "string": "attempt to bit-shift with overflow"
542
356
  },
543
- "7158692485152407286": {
544
- "error_kind": "fmtstring",
545
- "length": 101,
546
- "item_types": [
547
- {
548
- "kind": "integer",
549
- "sign": "unsigned",
550
- "width": 32
551
- }
552
- ]
553
- },
554
357
  "9530675838293881722": {
555
358
  "error_kind": "string",
556
359
  "string": "Writer did not write all data"
@@ -575,20 +378,34 @@
575
378
  "error_kind": "string",
576
379
  "string": "Attempted to delete past the length of a CapsuleArray"
577
380
  },
578
- "11692359521570349358": {
579
- "error_kind": "fmtstring",
580
- "length": 40,
581
- "item_types": []
582
- },
583
- "12327971061804302172": {
381
+ "11127167352969888584": {
584
382
  "error_kind": "fmtstring",
585
- "length": 98,
586
- "item_types": []
383
+ "length": 61,
384
+ "item_types": [
385
+ {
386
+ "kind": "field"
387
+ },
388
+ {
389
+ "kind": "field"
390
+ }
391
+ ]
587
392
  },
588
393
  "12469291177396340830": {
589
394
  "error_kind": "string",
590
395
  "string": "call to assert_max_bit_size"
591
396
  },
397
+ "12643885028103362594": {
398
+ "error_kind": "fmtstring",
399
+ "length": 48,
400
+ "item_types": [
401
+ {
402
+ "kind": "field"
403
+ },
404
+ {
405
+ "kind": "field"
406
+ }
407
+ ]
408
+ },
592
409
  "12913276134398371456": {
593
410
  "error_kind": "string",
594
411
  "string": "push out of bounds"
@@ -607,8 +424,8 @@
607
424
  }
608
425
  }
609
426
  },
610
- "bytecode": "H4sIAAAAAAAA/+19aYAcR3WwNPd97Jw7e8zsvZLxiW1sfMoX8iFZ+Egwl7RYa0lYluSVZGwTgyUhy7KwvdKufMmOwRcGbEi4IflyQPhy4P5CwvcFQshBnARzxglXSEj4RtZOz+uueq+qeqp3p72jX6PtrlfV736vXr3yHzr44Ee237bl+rXbd0zsmFxycNdHL5jatHnzpg0XTmzePLtkenpmevqPakvof0un6/8OHgKAvrW8vOvpC7du2b5jZtczF22amrx+h2/Xhy7dsmNyw+TUk9e+9hQxTPv4pUrj73zCPn6J2vxP7HrqKAoOxk04z141uXlix6ZbJhW/ZAkLwa8K4bmja1k/sWPiwq3bbjM/6YUn4KIA9GNLv7HlpT+hYelPXb1j67aDh5CV2oh04dOXbJrcvL4O9m+vP2nrvsOTv3j2LW+cvvX9G40rPnJ16AdfO+0/n9744p/+7u/+u33gRebA6cw/nfi3J3/vF5/5yqln/t2hq39/7T9feFlhyZs+91tvePipD77r/9gHXmwOfGH90IvfmD1v1f+7N7/m9uP+6vd3/03kwq7PPPSTK18869n1t++yD7zEHJj5+KVbrj/r42eeNDv7nrGr/vjBP/v9//jizrcd3HboS0ce/9Tq/7YPfAPA4OmnCjC49KYP2MevNCf+yfavP/OVez/5R8/u+NDTD2S/mXw4/prYe/fu/deeH/U+8vLeJ+0DLzUnfuLaM4SUY2hzmdLwkH345eayz/2s/80bf/s/t8bfsOfj7/rmX6/emeyd+GL17qff/OWD1e+uvcs+8Apz4EvvP/Le9McPfaB2nPHT0Bvu/8HaH18aPOObxm90f2n3L7/78ox94Cpz4F+++Zd/+6n0zO233vv5d58xnpt4bubr//a9P/7Kx9I//vbzN3/9NPvA1Wo8HrGPv1JtfMw+fk2LqvKNSuOXHrKPv0pt/ox9/NUqHL4EKMi58deojWe+/1q18T77+F9TklB2/b9uMt6up5792xX3Gie9+MvYPasm3nfraw987dd/eHv5QyP//M7ne5/L2ge+yRz4jzsuPLijdNPpP4z8+b0nf7Cn7+9/8qFPfednt02e8YPvvPSZgR/bB16nRrHz7ePf3Ji4fMrYmdse+mr+W+ODf3P+Hzx3wmz3T4bP/tbnVn7w5f/80//gkOotjYFLBVPaB75VYcVb79jxcfv4t5moYshBT/x2ZCADwD5wrRqOGf25zqnbMDd+Qm08w9XvEHx441/QPvB6MHDpnsHtD0bvXbrqi7uP/1Qi9sXvrnj8gguNr7zvnmr6ucftA9c3Bi4/O/ry0/e8Z++Sf/jQ9+/72fLfPf/4bP+K7An/98hf9WyZekv3y/aBk2qf2msff4Pa+IB9/AZg6k5Wp9RGSUwzAzcpzcvovXdKzssMvFENXwyHbFYbz/gGN6mND9vHb1EbH7eP36o2PmUfv01tfNo+/ma18Tn7+Ckl16xmH75dafjx9uE7lIafZB++U2n4yfbhtygNP8U+/F2SMnO2feCtSvOusA+/TWn4hfbhtysNv8g+/N1qDMeM/w1JrF1hH3iH0rrX2Ie/R2n41fbh71Uafo19+At3qqGNBbBLaQFvYcbvVhr/Nmb8HqXxE8z49ymNfwczfq/S+OuZ8XcpjV/PjN+nNH6SGX+30vgbmPH7lcZvYMbfozR+IzP+gNL4Tcz490vKPTvyXqWZb2TG36c0fjMz/n6l8Tcx46eVxm9hxh9UGr+VGX9Iafw2ZvyM0vgpZvys0vjtzPjDSuN3MOMfUBq/kxn/oNL4W5jxDymNfxcz/mGl8bcy4x9RGn8bM/6I0vjbmfGPKo1/NzP+MaXxdzDjf1NS8+xhRj4uN3Jpkhn5AcmU5T5m5Aclc5azz1w1uWPn1JZdH71k69Tkpg1bjibuD//OxO07Jq9fu3PH5rUbJndcu2PT5k07bqvPsGPy1h3fWlLa9fyqyZu2Tt22Yv36qcnt22E6HXsSQJ8E0Sch9EkYfRJBn0TRJzH0SRx9kkCfJNEnKfRJGn2SQZ9k0Sdd6JMc+iSPPimgT4roE5xDyuiT7qOM9czVm27atnnyGPN67X8W31z4yumnKsF86tqTTzmD/qt4pdPTu55ctfUWsBdWae5uMjttPWrBxmvqW7ebtkxM3VYfdOW2wybgJ+ukPoaRxkxghucv3bL+2MabbfKK6haEdfLmFOb07Df77NjohUt7ur5vODVpedqMopDZetnZepuzERD3aId4RDvEw9oh7tMOca9uiNu1L3FaO8QZ7RB364Y4pRvgHR5gRv10uVs7xIMe+Or7tUM84AGp3t/2MliPydvfxuxZjHbQC6R+xAMyqN2dqCdQ21/fHvQAZfRr8COLUvUc8AT32OK0nmYsKRtzmvOgEWePpoiT85k9zenlB1WEg/romWBG7/lmRm/z1g3T07P2PMzcsMt2fXjl5MS2FVNTE7dBWhyHvL+O/37fklkmV1FPu+56+tiLB3kPj+PnUexDjmUyllg/7/PNz7thcsf1G6+Z2LBhcv0VWzdsn54+iCx9pQ0kwWRMaqRXtRRKOTXSu+CMCvH7acg+E+svnNi2fefmurBiybwKwkZLD3EofzJC46UzeLIQoyny9zUz6gk8huj9aniv2hmq2ljNEvuTAYg527NBSB3bs6EGxHfxGWyJncGWwK85VqRvpCbmwLLvLCESZAP2Z31wzXXYtnReE8Yc0p8/tuJX/nPltlnwmU+u2rmZO7SPgduLiYXMCuyv+ODbNC9UJGvgn2o5rXpty9onu+upy3betO3gCy9hmsD/7BV1Yblm48QWyCzrIGaeOQri0hsAvf1GItmA/H07MwQJ5RlyXXmGcOUZ1KQ8Q6zyDGpSngG+8gy5rTwvcVN5RtTw3sdqF0x5ViHmbM9qkDqM0nWuPCNOlGcIrtn2LAzXbNdLAQBDpDyDVuUZgFPY4YYwsZBZgf0VP3yb5oWA5Mml/5lTL8ZS1AUOijSXn6O5gkb8BRM0wxdRQnXFXFddMVx1RTWprhiruqKaVFeEr7pibquui9xUXYn5UF0RQnVFdaquhBPVFSNUV5xSXREAQ6S6olbVFYFT2OHGMLGQWYH9lTBmpjhmTPKY55+zDhFwpnDD4Df1Uj8mvj6RygtzVJ7PiL/dBM247n5C5UVdV3lRXOX5Nam8KKvy/JpUno+v8qJuq7yL3VR58flQeT5C5fl1qry4E5UXJVRejFJ5IIqMilSe36ryfHAKO9woJhYyKyC8NeuRfPun+lpItTIpXe7J++afJE/C7zYV2Vm7nrqiLqN8qqE+Y0ykQKMcBRozYj8w5z3PZSyZS2L4DtfTcdf1dBzX0zFNejrO6umYJj0d5evpuNt6+kI39XRyPvR0lNDTMZ16OulET8cJPZ2g9DRQFXGRno5Z9XTU5k7bBBERC5kVyPu5rAKQbF3yY1ONXceoz4SE+kxa1SdvbIyjQJNG7G5z5rdZZfmvx5rCvPNYtflVk9u3br5lclV9qokNk3O15/XdHH2x4cUz8oWzdsaKEIo44boiTuCKOKJJESdYRRxx12FOeNphTi20wxzRqYhTThRxglDESUmHOSFSxBHUYU4ycBOYWLS2gmcuvnnnxObtfHebo/gixtJbWtYSS3Y9dc3UxNE2Vjx1oOXwjk/roZrOARndB2Qq6JMe9Ekf+qQffVJFn9TQJwOdwzsLcHhnUGfUOWjJPcz5ae9mPEQfHIE4DxEn28kRI7rEnPe9KhnKiOsOV8T9DGVk3jOUEU/vJ8deVRnKmBOHK0I4XFFJhyviPEMZpbZa5DOUkfbNUDa00UOMFvRLxMkRJ1vTESPycXPeR1W0YMB1LRhwXwsG5l0LBtzWgpe7qQWjryotGHWiBQOEFoxIasGAcy0YoWpl5LVggJ9nWuQCj5MzwKruCMGxPn14HNaKR597ePQ5xuPcOPyYe4TMDhIQ92iHeEQ7xMPaIe7TDnGvbojbtS9xWjvEGe0Qd+uGOKV9iY9qh/hY+3/0IQ+IoH7+vks7xAMe+Or9i5Ed93hAOR72ADvqx+N97c+O+mXw4KJ0omadOdOtJ3BbPIwbGMJSCliiV/0w7pDKYdylC1QOFyCiugXdFAi4tykQ0JQO8y/QpsDlnt8U8BPpsIB3NwVASlu4KRCwpsP8cApiUyBAp8M4K5DPrRHVxPQdOF2NdLuvyqT5LSkl7GgBUg5n+W420R81Im8wZx6yyvIXmrL8jp2bb7xqcsfUpslbJo+1M1AXuV9H/v6mFgrgOofkvHdI7k2dQ3KdQ3LSh+Q6Rw88f/TAVV+rc/TgVXb0AF8BU/EasRhFzlkp35qWtcQSouI13nFHOu5Ixx1ZzGf2o/BtqjwsojMXZVF8bDWOGXLSt6f+hFJSMreTXMIm3MyfQbaGxPwZIopnwmY0uoWJg4MQA1hDJFG5W5BjKUKG7xZz3ikWLT7JS1ciVPxP/4vZjqKd1FSft0xs3rR+Ysfkii3rX2GEi7fcvHNy5+T61Vt3TG6v//HiWya3HD2TdlhZ912B/H2Vg9MZ/sN6KuHNm2D49M09efXOd1gtULCZeEYG5T/WYIpjLgRkjTU0a+QN3+2m2rudFMWcna3zhDtQcN0dKODuQF6TO1Bg3YG8JncgyHcHCp52B0rz4Q4ECXcgr9MdKDlxBwqEO1Ck3AGg/AsidyBvdQeCcAo73AImFjIrsL+Sh29bgMk1DgO6BEoUp3WYb8bE/h3USnNiXNUpzHVogix9cH2myNrXquuzEq7Pipr0WYnVZ0VN+qzA12ela1T02TUK+gzwD1+jvXCnA5XGsmLB8P2B6Ts9xnr42kxgRqsJjLtnAuPAc2+RU9PYtEUep4LvtpGhBJ8hIMs8J4kHvcThgrLh+wjrHJUamNioIHGlJvoabPW0/XtS+thqhVa2SrnHVil9bHW+h9jqs+6x1SfYDnhz72xgG6NiTxJoXUiyuUzbkzQ6JgNDLduzLAymbc+6YDA9933+L9vf6m8hCcE4nM5BIUSrEdZ3DZMMqMGfDIv0QxjM02oTLOoXDTDp5lqTniynDhj1ALjBWF9B3WyOvhp03QwO4vpqQJO+GmRpN0DoqyFNZnCInXYIfreNDMPwGQJyhNRXQxAYywUjhu8bLLsNC/XVMPsdw6y++tp8nbwfIPi39YkGmtpPnqzAUPQyumAI/rQHQ8MY2zFvgjmGkQBvCLO5bNBtfmSDfP+MWl0kCDRhbOOwWtHwbzFBv4Tr1Ea6zAQFvgXjRoEIEKsaNnw/AOkyefrWhEk8elU1ywJ563rZXNedlDHpZx4OQ8OBaQ2eAIsxPUp+E4AwwvmmUcP3M+KbLIrQ/tAi7MjiBhC2HGlGkFxD6Psvc1V7FBReTeggDJBIHmE+ckDiIzkLGRGyIk22EdpGjBp+HyAb5brUeK4LAG7TOSOElzHqelQ0insZI5q8jFGCWBwvY0xTVDTGTjsGv9tGhnH4DAG5jOSgMQiM5aBlhj/Lcsa40MsYZ79jnPEy/An794zqNP6jkHQ4/7Y+0YjQyxgjnK7rUBzKauwxDuHGDX8PEH1MJSF6d4zUu8OGv1+sd8ed6N1hHt+AZREGc5jxoMbgQ9IdA0Z5DHHHhuHblDtWZNwxPyqbNQT/xSZzsOivGX6zkNq/DM+v2Nyx6+C3YOsRsBy9quPF7hgdeDtyxyxbOVxmPZlwXYqtumNjpKdQc0u4X0d8Uw/UgfaHfVBvKbIlrRbqHHC2WC3UeBauNQ4YE3LA+ZJeUJH0gmrsDuPcwjcR6coh+7My9I1tzyrQj2zI+GfU1cezlFtYJ9RlJvAb1SKUMQmRGHfEPnWmvlLMPsucWBWOKVpGWZVx+FN+IWI+Xi7Lx8s4CFpu+H9Nize/jCL5KEVyVGMsE5H8Or5z+Tbzg+6ybuz7LR8z527PPQuoBhiNOfbbxW1ZA2QQpRiPdUT8dhw7aDnECUOc4yQYzpHiHG9FcdYlciPFcKMQJxyvGABvahtHjgFZvSFysvCcF9DR3KzXzSbwQ/odhxFkWcOklhwx/LeIteQoXV0gnVgahcuyf+SIhF4YJQIflGnHZH2jUQ6Cxgz/HVqs/ShF8kGK5GgGaFRE8m38JM77JLRksUUtmcG15KhQS47xWMeBVbZEbJy0g5jhik4YbkSW4Yp8ibyfYrhBiBPODgUA3tQ28l9XQ7VkjQO6vjPgdAOzro4YJxdPAhZd32os4knAkqYkYJHc22/1umx0q7GfndZCI4rOWD6b5PB+2g+obzg/xTJGTZgErJG+eoPZH7d/T48+tlqhla163GOrHn1sdb6H2Oq33WOr59BgfQMbkGM1MhW0rqaPzfJ9hnIYUDew/xl+UotyAvsN/xdMk/MoWlq0iS0tAtjAD0iViKOdZbb0CGCLqZ0DDM4UJgFculuaxDuF4/+Tlsv5lhDnNQso97Wu1HxalVrBPaVW2KWnoDnEL2guevqARnk+DmiECKVe0HlAo+zkgIZFPeIJ1Bp1jXtRdOigYD2gEYJTEFU5BXrDiLMC4rRHSOqARkh8QKPA12X/YGL/cRQ4e5itIIyLinKH2Qr87Mk/ibeDilzjl7PYMh7on5va/TsK+ign/OAS6c/kLPaZWVfJ8H8f7srY+KGkwLRF9KRMCa9D5hAYLN1RzbSA9cqG/9/ERC6wKysJKVGWYz1+Jbf/p3BViOm5fuu22+ZMD6chIW4coFFVvzprttWLmhqM/3PqRFhIxGAhlMHyVoR9tomw9ZObJ3dMmig75ABloUMqLbdCu7QdvdB7qDXk3tGL0C6sDN5inJiwqWihIHI2mZzOQvbPNMm+/ehMJtWdeFFc7y2/lPaiJBtvdg4+a/erC57u0lRaaL/awwefgVerevAZOsQtHHzmrIAyc7r86jzXrw70gIPPAlPaSNd8oPkg6KKuSneaNBybMaWiq1JODjWHEG21VYe2qqphvoae/VjCHtjBGXGI0FbN7efH1dVV1RSYJxypq0FCXQ0RKYJhosZqhKixGmX3HsyfY6xlMH+Os8cdzZ/LuCfXA6exxA/qyzcGqQ5GcbQlBCuvQaLOOS45X0rTfCmChYOELs277vflcV0a1KRL8ySucBHKs3gsQLlgmTNsBL7WCCsDFzGEDcEFoNklKrJgFhQkPCkq6Au7vvsXdj/oC6sEfXG4NI5ANnQ1enFZnG4agUPcox3iEe0QD2uHuE87xL26IW7XvsRp7RBntEPcrRvilDaA5s+Y9q8+qB3iAx7gnrval9buffTB9v/ovR7g7/u1QzykHeJ9HjBb+k3rAQ9wz3T7C+F9HkDjfu0QZ9ufMHd7gDAz7Y9G/ep2T/uj0RPqdk/767JF6eh5IQzWT5iHPCAx+glzT/sT5rAHFM/+9kfjo9ohPuYsIym/DJCf1nn7a/h8tdtf4w5ufz2/xdtfzZ8Z4jKKLHEZRRdxGUUBolh+67VAcAVsMK5Sql5RS4Kfo56Br7hfql4hcYVXfVSo03FoBr7KzlYlKFMVqz3HEI9oh3hYO8R92iHu1Q1xu/YlTmuHOKMd4m7dEKd0A7xN+zcf1A7xfu0QD2mHeJ8HhFq/4jngAe6ZbnsZdIF59KNxf/uj8W4PoPEBD9jBuzqkbkt3YsoDdnBP+6PRE3ZwT/sbmSkPqLKDHmCefe1PmIc8IDH6CXNP+xPmsAcUjwc8x0e1Q3zMWSJNfhkuJY4rZ6sljqsOEsdnqyWOedXXweteZUcDMJCi+5IT3Osng2sbh0qyIwqrjTeJTXw/i5ywBHI4GyZhOeSE532+Vk+aVXdh13EtYQ86giVg9wet4W8JUKeKCiYDjMufKgrDdaGbJkxnggS2zqZWketMwGPmihHcLu6XkODKyVaID2xpc+00jp6AY79oA39Ft7Z8Ko3SPlWG4UEzqR4UBSzDJwiG74GvMb2rzEW1upsV1bqblXBvNwvgytlu1kbdPkQH4OIAiPXP03HNSkVOylufCNyzaVdeVQnlpYi9HvgaBpJrElY3X+jDRtZ4JqFKmYSaEXzMNLjXoWfY1zUKFoKPS64awADrZhdQNSLLTOBPUCSokExS5VEWzEwADmuibViGtizIPglbT1/V0mdZH4/Gz4lvB+oTcV1Viev6BFz3W0pc9wnJVfO4jtfLqs+IxE3gn6bcdJrrwiTXke5QSpM7lIKvEfOFNc0Xhq+1Gm84a3GQIlocpNkWB+bPbvZiMPNnkO2DjqJOKYp5q3wUk4BfywgF+Fo7mdMQBkLmNEvmNGkWwWsYSG5DPyC+rOCljfDxpuB9lSp+S+BxHJWHoj6kQPaq4bclqxARRZ8as/vVI4o+PKKoaIoo+lh0VtCIogaXxqC6JmPJ2OlqBPUAyLJK6aJiw9Vz1UlTdr90saxSutgHl8bg0TTHeOliH881wSnTJ068O4Z4RDvEw9oh7tMOca9uiNu1L3FaO8QZ7RB364Y4pRvg7dq/+YB2iLPtz974HrljiA96QE3MeGCNd7W9DOI7p04h7tC+xMfaH4vTHhBqL9j+2fYn9d0eIPVM+6PxkAf87xkPyOABD+Dxvo4CXyQKXD9hHvKAxOgnzD3tT5jDHlA8+xeh/71z/vzvspNSSDrRqrMUsnwO8v4E//0+n3op5DkqpZC+eU/0y4M0a+vWUIssKLBCuIluO8Qy/Clf4mNCXMtArMCf8pxnQryBgdgHf8pn8U2IN1IXztcwiAMExM0MxAH4E4E4SEC8iYE4CH8iEIcIiKsZiEPwp33jCd4Zzt94Mjfn1jX2y0I7VWsvwL5gnlt7EfqsCfxWtqZybgGc7ZW460234/j2SljT9kqcIKc7FxjEPX3ZSnI+LlsJEluOYZ2XrSSdXLYSh2vGd+9rjLzDKnzRZSth62UrQTiFHW4cEwuZFdhfCcO3ZS5bCYovWwlzy/xD0+JLDINsvTaw1ZhMy9Vr81YVN0Kz4nrtuOgSwyAf9IdMRfuggj4SX2KYkL3SL85ZV8IIHSEuMUwoMO0rizc95w9IuHcJHn3BypFhSdkP5tE4aYQ+KKZx2MlJgaTzkwL1VT09H3cYxuWvvWniQtcdhkclAL//KSjiryDGXyE3rzAMKl1hSF1TEnbdYwq7f01JmDwnpnibBaQgf7qQ/OFBjVcYXs733UJ6rjB0uXuc2yXr811GTcwX1zRfXHK+lKb5UpLzJTTNZylIVg4g5+Bexw8f/9Q0W8Tp67o3i0Bdiw0aJWuSkUEj7KBRCtcj8Kf8QqpCV2DcyerH2EHj8EPsqx+DPx2sfkLr6quKq6/CnzZVN06Y0WWum9FluBkd12RGl/GQpSfxMMo3XsvcTjxc4Wbi4Tg1vL/GzlCvQRMPJ0DM2Z6dCKlje3ZSC4mH45wkHpbBNdueLYdrtvvYQAMuE/nY49bEwyicwg53GSYWMiuwv2JRFRZg6FqXWeKBD1K6ZlTCRxnl2Q4pH2X+52MOquDqcrma5OTU1eVyXF2OalKXy0lc2bBxHFwag8fjoCZDpjuOne44gjQAZFE/yKB+kCX9IEf0gyzoB1nWD7KiH2SffpA1/SAH9IMc1A9ySD/IYf0gx/SDrOoHmdQPsl8hmhh1MfEDnBp+q6guJ6mfLqVYSRRTjpBp73FIejZSHzHCNSLPDwJhZDO6SvgYo66HZKO4j1HV5GOMkjkVGzbG4NIYBh+TsIsj5HRuZTav4LP3iMPMpjx7p5vszVQ5AAQ06xwYJvPB2iMhmcfYzCrOvwE1FrpenX8DOP/6NfFvgEW6H+XfIFwaw79miv1WfGeWysvjAKd0A8SL6R1D3KMd4ox2iIe1QzzgATze1/7sOK0d4kEPMM8+bRCBute9yNn25569HuCe+z2gwu9rYw73kgo/2P76ccoDzKMfjfvbH413eYC/7+o4FG2pyvSjccYDFkG7g4Lf2NNGytEDzHNgMZrBPR5QZY909PerPSD0UPT2Pg+g0QOqzAvO7d0ekOoHPEDq9nfAt7c/M+pX3/d4QO94wCDMeoAwXtA79y1CveOCstXvTTzogTXOtD+p9Uu1/uDtkAcg7ps/IfSBGw/mXt7Q+LGJU3/jO3rdQKuFB0rHDUOqsJWLGkL25cDTnHjBA1zY6afiC/to4Q/edtHQr96KkYBzNjDUJCoyKExWSTBIjKgh8R3Wcn5wmi9sfRJgsTj3JAgnnyvY6vpgy6dJ36GERTALIxwmjjc6I0zj7jDAKkAeiFY0FaqrDHpUjtNVBgzLY8MGyWI7AGGAI+yDRiQLi+3wRjPo6QBO65pBQmOF4WsYSPSilDm4W/mfUhKf8KPa4vgUPnEIrspRfx7kG802Ias53zhkRPrAN2Ii3GcKoSnEitfJNebYz95eYko/8mHDPGSJMDzCDhqGOGHYaASimHlagXNTh0zRanNOGyqT+9YQ9530gWuAyPuhPKQhTpTTED2aNESPDg2xmv8ppznSED2e0hBnSWiIakdDtKohqg41RBVcT2d7K0Y4yQvaxSzmXhezGKB8K4eJo50uZg67mEWJLmYx73YxiwIYosPEMeth4iicguhiFqMPE3NWYH8lBt+W6WIWRYxCxCJRjFmIGhHzsvLUHdRKI2JcreA3N4qypMPVmeIdw2l1dZbA1Vlckzrj3EYYd1edJVIq6izl5FxZDFFoW3UotNxCK7Q4qtBeeFxdo+VMmXpCXqPFZDWa7VkSLtr2LAWdHfzY0pD9WQZ6U7ZnWehL2Z51NX+OctRNzIjczhI/qu/y9mjHdfK+6/TrbrpO+VeV65TX7Trl3HedcgvlOgn6fpr/9ROEjBL6RNGIObhKNYfrk6gmfZJj9Um0qU/w8DXHRst5KOrIdHkiWvaRINFWdinyC9w7eB/nq8uUz8nJZDTfESX0vVpHYb7E8Br/Rh4nDt7D0fyD99F2tcFR92wwLjMpuDSGwVMQsch0sfllcNMqc9k7pvfgPYe9I0L2jpHsHaHZu+6TPg/Ym6GIDw5vNC1Fe5NE2LbLfuH6o3Jtl/38AP6ToO0ytfqIilzGXJfLmPtyqSAoqr6xH5MGl33jS9z0jRPz4Rv7Cd84qtM3TjjxjakgPE75xsBpjIl846jVN/bDKeTdWYkVEO6zXyqt6BenFXk61W9EXiDSimClETGuLL55gGAkjbH+tYst1kf0WfwaFX12jRO3OYpotBfu1KHSuhZapeHh/gu/qa7TusyCqufkdVpUVqfhSccBIuk4SHi4Q0TScZhIOo4QScdRvhv0HZb4fn2JRT+zVW/R2pj6pGv17M5aHL7W6tc4Y+VulpXN4lCGkcHCbc8GIRcxhQCAi2zPhiEX2Z6NQC5i+scCTlGWKn9DqvLrCalqN4JcQhAk0gISRr5BIGEuAFr6kEIA5NMVAPm4kh8NUAHQIERKJwDSFgD5FigAuriN6iqG0BqnJYTy8hHKK8q2aZznuooYYYQTcM12p97nPADywSmcB0A+pQDIJxUA+ZwFQD4j2kcEQD7nAZCfYKQEoc8UWftidX2WxPVZQpM+S7L6LKFJn8X4+ix5kYo+u0hnAPTuBYh/nGm0GKHREqhG+40Wwp/RkqPwZ4QIY0aJMGaMCGPGiTBmGRHGLOc7M6e37IpQYUxMJWeScN0FSrifM0nMe31Ewm0X6EI3XaDcfCiMKKEwYjpdoJwTFyhBKIwuygWC9aHO6yO6qDtM5esjEgteWhpdDVwgWf8mTvg3GpVVfrEpKyReS+RUlFVOp39zsw51VVroiA1XVy+8X11fmScVx8Zc0Fd4rdcYUdnDODgFwsEp0g5OwojeQDXGb9nBQetmfMewfvqpcK1z498gX1hgHQ+m5RUWRN8JCguwKYB2hcBBiFjmA7+pkYyLfrjj1bmvKD3t1RXbV0068OqKur26AuXV+Zx7dT44hXOvzqfk1WlLbMX4ia29JvYfx5UtswkgLlJMyG0CxPhmZT+8fB6Z4BlBeZiPD/pRU9G+X0EficvWCrJlawnOugpGdJqoyiwoMG0C9cDRC+wKPAKDpSPDirJfzCNy0Yg+ICYyZ/+p4KyAkGW9At8QPwJXhZie67duu80svpx14EUn5P3rJi5mZUwHZUgajP8ow2BQbEQM5kMZLGJF2GebCFs/uXlyR7Ne9ZADlPkOkR9sswE+wmeKuu4zRXGfyafJZ+KU1vrQKmVLloDZVJWR9Qg5nVtVyhfyvbeIwyrlpodtL/8ANjktiDkQFDBYTdOWKGlEP24u6GPmTvy7+a9+ouVWUFSYFWHwEZHAR4SwkjQ+Olv3m/Rt3UdejbXL87J1H3l1bt1Dx0tx697ipTrfuuesgOpFIHmuL4bWDjOEjOjLmFyrNWMScS9jAnVvi+J0jcKOfRJ+Nx6IJ5wFEUnaXa8HEd9gLY0ZIWzEAx7mOwpN9DWs8teIigxZpsDtYUKOf1ufyAS2jjHzAL1dSjTHZ+uyqL15ng8LAtaZNP0XdFokg2LC2Mb1zGLbTNDfZZQc+NxcQw/aMNJl0bi2hzkJx7yArDtnblzcyc83/KtEA7GuFhuIXYs3EDPlDW0gViSFFBlUYgcVIVIY/ilBcsmzZE6YhegiFVvOwt0MfbqM6H+Kdxu6ENonSdrXYf+3BO0L7tG+S0h7zrn1LiHtizwyAaQwtAecoXL+PCmkfU7WqKU49MkZsQh1hDVhkU9W2wPghP5Na9K/aUl978p8Qn0f63Ks76/j6/s3maALVGY/g+j7JKXvUxL6Po2sO0XKfNqI9UjIfNI9mU8LZT7DMkJaKPNd7KAMRArlL4h2l7noRWU+Scp8ysJhPMYaFet7Ic9yaV+HvUyC9mn3aJ8U0j5FKgF5hrGgmaE94IyswkrEJ17SJO19tL6vy+apYtr7HMm9z4i9bmHl3iekfZpOLSsoC0ruAe3zCqYo1SLtU7SfV6f9BZK23kfaetR3jTzDd0EorokYsTc0VjX+mjbZEjCfILX9kWucbApco2ADokJeiJC8EKVtQB3rq4g9YM4WXWfP61W453WJK3te9Y0leYMndruSAtNLuL1Jyu1NUAkSlFA5xDZ2kVquHmetk7CNKfdsY05oGwtE5kElDi5ApFBxsEoOpEuoD1OkPuyibWPKiN0oaRtzzmxjkvT1GO0KWVgUXhacJDCSJOEUpapASVVRQqpKiFQVSakqGbFbFza7VBJKVYXFc0lInB52UAUihbrhQoUDiy1WmhVpqSoYsT2SUlVaIKmqJ+mZw3u4Z5N23bNJ455NSpNnkyYijxbrA5J8fyLt6Qro7Hw060iyzToAdTT2Nss6qQ9IwzXjh1Zr1K5UWlQfkLLWByThFHa4aUwsZFZgf8USN8tUQGO5sYRFonjJsQ8QR/thulaMK6wuMokmQzn6LOP60bcMrs/SmvSZIJfrgj7LuH/0LeXm0bfCQmu0NN7azMHRt4KTo28pWZWGn8MfII7MDRJH5oaII3PD/ODk8y3X2VA1mcmOD+R9H+iiNjoF1uY+UFG3D1Rw3wcqLJQPhK41bfVBIgQhk4Q+KbiuTwq4Pklq0icFck8RP+lcIBNkOYWSleR8bIek+botp7eT+4JsjX2L2A6Bo/nbIcl2NZhJ9wwmzuA5uDSGwXMQsc726F3aDrkIuYfDdfZOtJjdTtDsXXcgvyd5UYGZGFt6HX6+hDknKd6tjMudk+TfIhJ7WfKiAuasuMYLA/W2M/DwhYGe7tOZmg9H1tl1gQ4c2VSL7QyqrB0jHFmVJlVxtElVkmpnEG+5SVUcvt1Kk6qYRaI4TariUbn7T2NiXK2QvUSs06dTuz6bhz6dcTf7dC74BagJVKM56NOZc9KnM0lotBRcMx7SDxA5wEEiBzhE5ACHuXsA8cH5vcdUo8rwdVTGsRk97QIt+D2mCZ0ukKN7TCmFkZN0gZLi5jjy95gmMbGQWQHhT2lzgRJ8F+j14o5OUTZcFIe7SblwMcHXsOeKm/0kn3Fwn2Ud9Bsb8XF8hYI+ErewSsnes8mP7+MXq6WvUKZNor4okavhEBgs3VHCTsB6aSN+uZjInEyFOJEo2Uwsxe34Fb9yPjo6JeU9zSYudHV0OioC4otcHVxKEHOzo1NUqaNT595ZJGEQJ4v42uze2Yv13jvbSIyepdC7MCxUN345dRPm3pUYfwdQN50+R56/o9XVPfzOHa2dO1ptugc940u6wXW9c7vcHa0+RW8gQjBSrF1tsofvaHVNnwH+aZ/ObfN5Ret8dW6LExotAdfM21eN3+/yzacdEfauCM+HS5J6VQlwSrcAJyVdkrhic3m/TelgG6gxaZckLm4ur80lifFdkg+JU5F+J83l486by9c17EfFWar4M4JGHn4+6N8zMzIfU9BH4gYjCdkGI3F+CuwTRCoyocC0cdQ3TODVMFRzeZ+zdjoC1qsnhT/nKBXpdhb8d+cjFRl30FxeXyry98gYSMRgfpTBom6mIv1KqUh/u6Zx/O6lcfxoKtJinJhUpKX2R76vh3/BKkujDlORNqyEobJqpCn7MQwEWVXkF6qikJwq4pmqkBH/Kp6mDBP8HXGdvyM4f4c18Tens0tYU0wQwtq3eLkde2w+YoIQEROEdcYEMScxQYSICaJUTBACMETWL2yNCUJwCqIfVJiOCTgrsL8Shm/LxAQhJCYIWiSKp3deItKUYKVBMa5WIO3gQyztcH2muPPhoB181P128FGyHbwb+ix6jYo+u8ZJmjKMaLQX7tSh0jILrdIi+Hnr31TXaZmGVHU9J6/TwrI6Dd+yGSC8wUEi+TlE5FWGiXrREaJedJSjcMJGws8SP6QvoRpqGboz1upmWcv0BBjGAupZmbNCDc4a+YY8Z/nhlA3v14enRBjv12FKhPV++bcAJrK490udG0y57v2m3D83qHCQT9VaJLDTei57vyvd9H7nxVQkCFOR1On9Zpx4v1RnjjTl/cL2O+I6R4v3m4BTyJ+Nl1iBfKUvpnsQ79fS84erd5YR3q9KItZWE1ohGElj45BfW2yNQxB9lr5WRZ9d68T7xetJexzoNEZkcZZQ1HZZD/afarWdXAabNstOm4XfjZ9LQkHSV4lkITBei9vEubwrEOYwsVHhVgXQvXTOn0ucyVdx5g0ZifOZvqMWnS5/fBqcHaIuBEmoJDIVS+9WaD1qriuRmSATma26r+creJApggwZ+AwTHdleIRkO12WNxBpey38Rn2d4t4cwfH45uv+zwf4kAPnS9izYGLXO/iTUXCiWuVqHlhJvJKLzuPkNL1D9gdMKLXQKcqJYUAAJiNtLLZNtt1SCD0kvEHTwKSFeYAG+TVnPBEqUDEQ9fkA1xRoCDGKOYKh8c1SDzBtQiUXbY87BuIp7hil1tgn6nRjoqhm9m6DEbFAjxb1ArapmJLaIN/c5fFYV5hToVVUtC+Sta0p8j0uVZ1pbxVeX5SN5K7vF+W1y4LN7uNfJJW4DDb/lyZEFPrq0G1KA6yLuCuhSaI4v5ouCLF8UuR23E3cC7GPJgdbbsDlwUYg2bH3utWHrI1yUqiYXpcqjM/huPNuCyuCALBfwKnsHjMS9rMWsCV2UGvsdNdZFuVsB+2aDebSbVFW2wTxPDVaNxEEJNYgomwKtbOrAZ8XKpuZE2VR5iIa+h03ZVC2ayOZL1DCGpryOGuKYVFEvR9oxsfjPeP4ua39Wgp6I7VkZeiK2Z/2sa/JB1AkXuSa8mxgzRqpkgn5KXHtoggJYxdYjEHNyVYlnxa5JxkmzuaxsszkkPnpOLJMJnq4AcB2trGj5SN7Kfku8soy4uXsPnxyfFGuLBSHHZyXIgXx0hv7oegbmC+KPTtAN2qXLDCxfaleRUfhTfiEZIfbpPgUZmuXSRuIPxdhPPyMgbA8f9B+ZoB9F0wabiLRBjk0b4Go2BB1efHO/jyhm6ifSBymQPuDV9yf+vOW0GrW1zl5b5IcoQw8UUMWkjAcWgK9hILm8API5POQkbzWx9/+oK88CSkk2qQ9JSWYBzPXDb+JkARJ/02Dq7IjCagNNOSa+P+Xi5oSD/fcF35zA00YZluhUUimlD49jWvGYcg+PKcd4bNRe7VLa28HFsQlxj3aIR7RDPKwd4j7tEPfqhrhd+xKntUOc0Q5xt26IU7oB3uEBLB5sf/Z2QQRnPQDxgAeken/by+AL93lAZDyAxoc8wN/6jf897U+Ywx7w8zzA34/qhrhD+xIfcxY/yC8Du9nweVhsuIFzlntu2GXIjYajWFEz//3s0llOUeIZTFEifDiKlEBj7fbmOY0x3/MptOlOtVYyKBFBp9xv052iS+1aTICkFQp20wQZMvCZo3x8GgLj5eOTl7tWPpa8BM0Dm5tjyVWqdTsmjG3cjF1ygwka73LJnroJCjPvAblTN7w8YsBIXiPeHAtwU5Tb4JcjI4NzWdqjhdhAvOcgbOCsKGgkr2tZsqkMdoqFHpiPwyT44bANxOEwpm5zEGLd9myo+ZM55Tjc/Mkc3B5p/mROQI42f0bVD7YEGsyVX08cbGmIxTcVdKK4FUMaEVPT8lzF3S1K3uhoezIg9FLSPM1EGNY0/GlBnh/yR4Ob554FVG1g42P3syp+DmRQwe/KCNHQRdbj+3ml8QwewOuUpwBW1VTqCn1jAq7vbATc7xsTIGTHR2xsBlhKBAn9EiDwGFT7lOXqeAzieAxowmOQlHl8EzjI4jEk3tkIsbOFCI85JI54HUM8oh3iYe0Q92mHuFc3xO3alzitHeKMdoi7dUOc0g3wPdq/+V7tEA9oh3jIAxAPeEBi9rc9f7ugG+/3APPotzGPtD+p79MO8eBilJi7PWBYD7a/VE95QKgfbv+PflQ3xB3al/iYs6BJfhn+FrdzLuVvzwSXqW3nhBxs5yxT3M4xc2HuBdgOEhULHmC7cSlA0NMtkMLzkbWmLgUI6GyBFHbSAikI14ynYGpUS35hU8sAeilAiIEbxMRCZgX2Vyxl8K1cChC3SBSvLv7fHV0KEBDm4INyW1MB/kbQz8RbU0HuMYC4xXJwQKeipqL9hYI+igs/OETuecYhp/A6sSb/m7gUQKUT6yuLb/63AqGgZpdDYLB0ZFhY9osD3FaQKb/E/iO7spCQEmE51gvxVxWej0sBgg46TQV0XQqQipIKR/FSgAqE4olLARbUZ/K75zP5HW9KQApigijtmWu8FGAl33sL6LkUwHJtyTHZeOElDAE18aFXfrOPVB9RQVMkDsYw4wrNn/2mLJ+uumBwBLiHv+CaeBt8wMmBVU4jgAG4Lvs2eA3+lN+PLwoNxIDsGekMt3VEakx8YHUAwb55FP86PujlJui70J3/vhZ3/lfgO/9Z4c7/AFn4iQwaJCnfz6qkQQnSc5pp9AtJT3fu6YfCxpWN06CXJhRB8iw7dReh7ZmFJZlgDhCCafwAvkfY+qEkVnE8rJSM1AVEh4suosNFjvjQvInft6guuItWcfUFXyxWcWUnjF5iB5XhuuwqrgR/ypdAdQn5vCzboSrFQVDZSF0hVnFlBPtmI7Sr+KCvlFBxuRZVXBZXcWmhiis7MW59JOXzrIrrkyA9pz1WXkj6Ekn6vMVQ8mTjzRwV9xYFhpdScSWi+2pKre0e9CDMxnvsl/mM1A3m91yPtoPcQLSDbIx+Fycld8zHFDLmWXhcFZlLaEBvvAkfDXbJAkm7vgnDnyyOIkZqyvzKzUQIyFmqmQDkpZlS21q+u2oJUdkbIVz7sPlBO5y9ZbLGJiKs8gHmwGcJElWMoWeumtyxc2oLEzqan9tE1+mn4ujq+d3Jr573re99i0VXQ4Vpmmj/KYHsfdetWun6RF8Nf/8nX/nfG6Zdn+ifImsu9n36/VXXJ/rkaa95ffJNo3eKJ5oT4Lk/h5qmkpuTCD/DZrzAPp4pmY3XjdQjVhMcbK5ENulhGmjugKh9gL85wDJzrPmC5e9xzFzP/TnB+WQTVpT55ISResiG1EhzWMNI2+eO8OeO2T8uhrkJDYD2AfHmgIb+OIgxV1A1c9SAeAShsV8TN/80eP/XL/7Gga+7LjYP/WT1aXvKQ/8qnsi9S2SiWo+Ozc8lMngAluK1jTb9HZUDY3ixQAfgIgPI9b2/bKqjzzNeqQ9yLbIcH7scH7GcJHzNia+P3V2AN4Xf6KgpfJK9sm1u1Dr0AKwZiWR7Oc2k5CKRpQncvc9SkUhGIRVLRCIZCYhdBMQJR/2mcwTEtQzEHPyJQMwTEG9gIOYtKYEWO0wnFdIGfjiLfVVF+FM+22p+541q9wSU4XRkqQRIj5WRUgl4lYBUqURJ1HWvKJnwYneU0ZHd3JETEiMr3JFrJUb2cEfeIDGylzvyRomRfdyRmyVG9nNH3gRH8k6Kp39smpVv4/psAE9XvPA4fx/mn1npHNSXrxhkBCYgYQIDZJkcZQID/EzfD9HtnxuIwrAkepx5XYMY6SA7HvfAA6574MRhy6omD5xDnCrqgVtIQxEO7X6fJB1+DkiRu9cB+KoCiAn2jajwrgHCy9u3SceIPslZgsOrRB1DzZx0SHWTz/ykrVzllk462uLzYxmcJmhyoyfraIsvQOw1Otziy9Lav07PvHiLL4vg3mSa1XyrXJLY4qu2uMUXxbf4kljOsLlGUrBUdoQBThh5LEuQnuNX14Skp/vrWC7K4NJnkN3iqwsg+2q3kR4nKpQCxAUVSeKCCrMWIb1C0mN+lnF4tvKXe5xY6qtOpL6bZ97BquxS3w1/yjOhuK6avg3GopJ5F7akTxFLfQC9DYaQ+oCRPk1C6pPuSX1JKPUcNVsSUr7KoxLACSP1VQnSc1RJQUj6gOCWNiBqXPqcz5H6FZxXK0b6Eoe2vkTY+rI56VpVqc8KpP5SsdRXNEl9hbL1MlLvyNZXWrH1dXqucW7rywJbf7WE1Jc8Z+srpK0vs1JfkSB9gec6tmbry0Jb/3aO1K/lvNpjpNe7auvv0G3rNyyI1M+jra+0YuvrUr/FPVt/86vS1ldUbb2M1C+Irf8NjtTfwXm110jvdtXWH9Ft6/d2bD1t69/vnq2/v2Pr29rWP8KR+iOcV/uM9AdctfWf123rn+zYetrWf8Q9W/98x9a3ta3/HEfqP895td9I/56rtv7rum39H3ZsPW3r/8Q9W/+Vjq1va1v/Vxyp/zqOK9vVy6ubz4rODhIVKf6p77/9jbi7Q9GJyJRkRYZ/vCn99xIiQ5oGh/gSmPD6yl50bsJJRVo3Ef8iVqQBJ4o0TWIqS3c2R2D6nXBFQJYr/HwE/VAC99yGM34B5l/GbyD2EV51iuNVZ3MqVTU116tqau5X1dRUqmoG4NIYRT4grLYY4J1Sx6stOgAXGUCe0s4kWY8aq6GjamKyTA1dZkTlFEvJdWkvuX+KpaRyiqVqcUOJTdiCws5uleCEqpC1OgBfVQAxwb4RFd41QHh5NVeZ5UQcrZR1q1q8rLlJL5SsXGc/aSt/uceL3caaE7exzCt6Aquyu41l+FM+CBNn3WqyLju/HUzmVA0uOz/rlnndqzLrVhMEDIw81iRIX3U1Yqjy6XMBG3/XBZCXxsqsJLJuBZWsm2VVjUknVKW+IJD6y8VS361J6rstYY4DqQ84Sbh2yyZcA3x6XiWW+gKC+yol9QUjc227Z90KTrJu3TwqAZwwUt8tQfosYdhR0hdI0lusKpc+6zhSP8HNzWZu0GXryzxb/17NO2yZTR7aYXNk6yut2Po6Pbe5Z+u3L8Idtqy2HTaNtp6/w5Z5D0fq38utocu8zwVbb+6wZR5TlfqCQOr3LYjUF3TtsBValHqBra9L/X3ObX1ZYOsPviptfYW09Q532LJOdtgKsjtsiK1/lCP1j3Fr6DJPuGrrf0e3rX+6Y+tpW/+ce7b+4x1b39a2/gscqf8dbg1d5g9ctfV/rdvWf6lj62lb/2fu2XqjY+vb2tZ/gyP1f82tocv8nau2/ue6bf23O7aetvUvuWfrv9+x9W1t63/Gkfqf47hyUEOXdF5DlzQy/yWuoUs6EZmsrMgkubWHmV9JiAxpGpLOViYw4Vkj6xevLOlEkSaNbEisSJOaauiSlCJ1WEMn5oqkLFf4+QhKulRDl81I1dCViBq6Ml5DJ9XeO8P2gzR/drEdIc2fObYnpPkzT3SF9LFdIcFnMX0hAUM0O0MqtCEPwsXjXxOn2pcT2IsSWEgQMVSYwHpMU0/h5Jc/d+W3/2PbqLinMMLS1J21W7FB9NV5FrTyLqnLvkYsamFuR71tEDT2RXNCevRCVID6OQgbuNcXZk9qrGj8RFTCOHVrITVnJ61etxbC69aCmurWOCwQBCVGLV7fmkIpzE4bJgQyIkH6KMmXYQiM5YKokT2Hdf5Af1xk0gj7HZEm+hoK7Qy0Hsssmcyeh1LIic2vc/VFJugLKH2qriIs1tSRkggIlcRKZSUBITb0BRe0RIkIh6o+oS8U5rECWBV5nwkWYQVbjLDSeIQVEkZYHDSEhGiIkmjgtIyMQjzI4xb4hApWOGihiCl6LRriw390/Mp/feMP+6XvxOAxgU9JV+JVoNabYWwth8FDv/rto4raP6Bu8cLu3z4aJgMd3PCEefZBTD3aQlAgA/pBBllLgFNbUdW8Q53aRG9bn3u9bX0otYOkojL9ohd2YbMFaW8Kh7hHO8Qj2iEe1g5xn3aIe3VD3K59idPaIc5oh7hbN8Qp3QBv9QB7e0Fg7tcO8ZAH8HjAA1K9v+1l0IWPPuiBNe5tf7HWT+q7PCCDsx4gtX4Gf9ADVka/h/JI+4uMB3SZ/o9+VDfEHdqX+Fj7Y/GQB5jRC97ttAe+Wr8d1J9MuK/jiy4WkZntGNa2/GgvuKJeULczHlC3e9sfjx7wHHcuRs/xbg+oiZn2R+OsBzSZBwjjgm7c3/4+lBfY8T4PsONiNFq3zJ/RCjipcgrSZeKX1FexacOWozVHh5+fuH3H5PVrd+7YvHbz1g3T07O7nl81edPWqdvqEKYmt29vDLts14dXTk5sWzE1NXEb+ILABPL+Wv77Qf/srmeu3nTTts2TZu3AE9eesevpYy8e5D2cYP74yqfZhxyrlPEz1TugmgYtS/SRWGboFoKvKRRrKFbHLFMv1vC7X6zhVynWsJQhMng0y8Peq8D+1JXUzWu379EO8YB2iLO6IU5pX+Je7RAPaoc4rR3iYe0QZ7RD3OMBWh9ufwa/ywMMvm8xap5pDxDGA/z9QPvzjn7+1o/GQx6wCPodlAc9YLUOL0Z2XJTKcT7toB8cUZx7eUPjxybOkSW/0fXBlovzl7t4sHG5eixJnbgN4nFmSPI8zhMXHome85aJEzAScA61iQ82helA3r7WiBoSx9EjYLbDYQEWi3NPLCeh54598VgnrLoyFSyCWTi5jbmVbnRGmMbpKsAqQB64TBi2M6G/iS0L8iLNFyx/jzbxzp0gBrsC2GGFm+LceN3o+mgjjTT3p1BzWANj9rlD/Lkj9o+LYEzcAGgfEAXIPXYYruupxlE1hRs8UmoclVFXGCn3b/BIsbyXJOQ73drp7yYcdto0/G4bGTLwGQKSbkSShsB4jUi6Ps+KbkYouhn2OzIsd32KbXSBs5Uiileos1UaZ6uUJrbi0DdFsFVGbdrzlcgBvhvv4odyahfJVhkIjGWrLqPrf7NslRWyFaejWpZlqz/kzOgzur5uvvAnVO4+qSl3n4SvEfOlNM2Xgq9h/t0GwtVKsk1K5katYw/CmpTCG6Kk2LYwGLw4Ci/RfDJHvXyWlZPCsT0ZoYDs3vX8MVy/8vqV22abIIpzphs6EU34GI0KxAbYVQzVC/Cn/TC25aJMywaU/U3Qiq88d2zb/koBvm0BxopG0cjNmqLxDziGejgYasQ3v8ntId71TyypetVU2hL2FD0AZUdwQEKMFWM4SwcrG3MWUYYuQX5guiVio7oJYaw0RzVo9UM0qESaYZjr3caNLHNbTdAvY6CT9t5x2ySkpCjohUasqmh0/UTcO47q+bnG2aqSlgXy1vUfEh3a2HWVW8ZX2fKRvJX90nn7VxNtL9zJ7S/a9StxwxTObbjiXowcEhbhskhdKi/qGtkiwNelIdiK0bbopITZT9KRB2H2k0SUJusMSynCFOG3tz5Rqqnp5BnMVOHXYYPKsk2IitzLpHI5sVCVRXqXK1R12EWxUPU4ESpOL9IeuCzyoiq7T9EDH5IOChDcHsRBKcO3LcCwDjSm3cv1o3yB4N/fZA6uyF5mgh7Ai1Fsdu86+C0O9Ti9qhFH9477hQquLNuyDxGEZWJB4HbtBHBbFVE/f2XHE6o3SxmTLgm9HBAxF1e4A0buFEdXlouFO0cima1Py8Gf8gsRM1RSlqEC3HaruTMlGErU9o6L/LpLe7YY+X4nyM/zEAWWZUd+Hv5UkZrWkC/sdZu7sOVetxjfXyLV7Lbb/gxkJCtEvtO8TD4fQU0mKrFQB3Pi1txqNtKDtJ0zFjeqTkxza33eN4q5tdcJt3Kch16KW3vgTwdOGMqtva04Yb1G7k2Ehu+lNHyfhIbvR8jWRxnqfiP3Nonm+L0ttm5cgbdu7G9uYiEfxrlWtl/IMzV2UBXihPHbaxJMw2HEvhaZpg9Oy2WajYBpqLCmn4yueiTknrSeeMvpHqKauSh2e3vQsANoS66+2UksqkwsqpuNNIHSbiz4PtUFl0X68dYF0Y9lR/rRz8v9tMbqZdqa11n9vWJr3osgv0Kl4eqgd0toue4WtVwG13IBoZbrJRO7yKA+kvIVViP0SZCek8KpCEnfQ5K+AmWNKxv3sleAEBLIy7ZhmqpIaCoLS+Lp7ACbzobG2kxoYwl2zn5w2fUygzK+H1zUtB9cJujA2Q/u1lRmwLnyqJvQ/BX4zBH7dlskgce+H2RFrSLcD64QgmbuB+ceJRqu43bMjyY516HXEzVzVM84jmT5ezP580zQH8ax4WBvpsf53kydas872pvRqAwRx+a3xXawwivFaBVfKSGff1q8spTIQnPdo5SR+5zYPXJ0Ox6nGKpgcfhs7lEK/pTPNInZoiDLFgHu5lXu9wHysV1ZjqkpuF56VMBNTVmTqSkQ/ijH1FQ0lR5xVTT4bhsZeiREsFeWC5B48AXW1PQITU0PbyuFMTV/rIB98ZZVixcC5r4qoQVFV7BydU0d9tccbVk5uonTwhN2XVOxKCJ8y6pCb1kBfYZtWVUwhUBsWTEeMeMofEt1h57czCoY+Wb8/fdONrMqTnUvuarci44cBfHeQ0V27wERke+0uplVaFl4/fyVfd/5bZ7C1PyPHG1JiYW3bbakCq1sSdXZ9acubkn9h6MtKTHyXzVbUr9ya0sq75PakioSW1IlsgSfug3d9qwLWoXmVpaTOx19xO2CaeIOmwxRvJsl7nTsIu50zBF3OuZBCe8iudMRyzqKdyZ54WOfka+p3NndQ/BfL4//zlRdMK3s6usdEiu7fifKro+3pUUouz7404GPjiq7/lZ89H4jv1ys7LB9yW56XzJ/vETGvuzevmSPMGPfT8ZUKpuZACdMbFeVIH0vLyEqIn2fbMqzly8bZ7AZe0ICHe4t9hEqrEBk83uIbH6vOHqpoAqDFIiKkb+Y+JgUseAiseCSid+3qy44JQiE8ysXJBBO0YGwvDuXajEXm6LduR4jf6VYw2EbwiU6/Zy/SkLDFd3bkywLNVwPmXSTV0Y9ECeMhuuVIH03sS/uMLouWZQlTzbextFwb1dgeKlrPSvsRg1gSXwvs0wc2ukGGzlEdjugkDFPESXvAfia3K6AmUh6tuknM2ELntLOtLaTKJHSzuAp7bSmlHaGd1oaT2lnNV1XzT2FCr4bj/QyaOKEFLQsBMYKWs7I72R5qkuY0u5iv6OLSWnnt3H3mvLvNV94F3UML62Q1qGO4aXha9i50g0q50oBaOzYjJmlzT/KfGNGQgvQp+ApLZCZ9/la1RBZNvkxN/MS+5McQcs8ZpMawOwaZ4kFacesTdbWPwW8s4RghBxez9PIlwNlK7KdGZ5Im4MgIEa8Mkb+oDhfHuQahK2Qj7GlgaZD7Bdt4K/ogZYV6hLiLG+Wr2UeMkk6gn1MnHQb7GIUhz8xPbIJyD2T7sNtqiI6kuo2NYvb1Iwmm5qldYh92i61aRNKtgh8N65Csmg+nLSpXRAYy3t5I/9hVmPmhDaVswOSY23qU6iyXNoyih3cs96Fs1VWE1t18XwmEy84dbv0E2FeARLUfOLaM4T4fC0LIKcqcSxzx4z875u8+DlGR8YkHNYYi5EYgZEMfA2rxttAZP4zRDXe3Jd0d+G9KwpPrtq5GbECeEsQ66ACHOS4BUkWn6901M0A08Opn26xArWM5i6WENWeJTSn+2Z198w85Dx+irx7ZqkzIyhlwZxZvPJOfEgZJW6RYCOmBUq5KeqyfGSmXd7BL+D4pimaf9FyKZozshfViVswifsWeeLm4ex4UNdAx4sLhI5SO6FjE0AHynHdVo6z7PQTlX4yFulmFkCPpOrzcU1R4S7zi17CvyjGSF5JaLV7eWFOjApzeo38D0zKHUZpsLTltkbnqjtpvbiTFtPkpPWSRt2GjT64NM4xmblx71XY0OojPAjzGX7jhmOI+3RDnPLARx/QDnFaO8TD7U+YRzukbk9S41ddtQ/z3KUd4sH2V454M/T2Icy0BwjjAeV4lwe48X4PkHq6/WXQBQU+ox3iHg98tQec0cMe8Hk8QGovOKMPL0a37EDH5em4PO2id6bamBnNnxXti3zAAxZhxgXjj2ZAK0wGFBQ4F7n1l4U9LScqV7BpPzwJ2u/6Ofl+tvkZWBmaIO2XvCpq2UlnvfDt9MN/pnBgQdxIrUpvldrXWlND4jlo4XN1F3ZVVP8u7KqoGnVVVFV1ZSpYBLMw8gGe9jgjDQUyrx9kyRlI5korS46d2RmdG7cB3dQy78wohllqxpS2fdaqtGZS1DEna90MKbq3GQJaM3U2QxbQgdmrHeJ9HvA29Ecl97c/82hMIQLNtyg96pnFGI51tuc623OdPNDC8s6izAN5IUfuAVevY1nblTL6pfru9v/ohxejx+PGHpBCoaeljwOvgrQYaLl95alsexw8vdGnCls5vdFH5hfQ1EefZJrzhNd988Q//lrknc7oKp/aolpZKyYTT0LTnP1omrMPTXNWqTRnv+rKVLAIZnnaSWt552Yvrx9kyRlIJs1p6V+BpTk3Eb1f8iDRyTtTUTR7zBej8qfH8808Kpb8bGZYy8SpEfOgbmPYm+FXPLl6K3K7b+Fo5TpR5H/00Iu5EACR6lwqcWHw3CvEOSXL6YIKVNWyRxIKcL3EyZk6H3FR000ckMCPVcQBubiWZMB8obLQx+LiKF8WIABhK/ru1K6PXlKfdtOGLUd13uHPT9y+Y/L6tTt3bF67YXLH1RsnpibXXz15/dRknR2eXzV509ap2+rfMFXnWAtdkScV9EnPzK5nrt5007bNk3P8xP0f2IQ4eRaFFUWf5NEnRfuTBjpnZdaFr5Lqo4l2u+D05swTfJG2qDZ8voSm+RILOR8myOsIhZ825fQEbElppKcUEGPeTSppY+RZE/jJrHeQV9o247SbwP1KtZ2rpZ9U9yuLuO+Y0LRtxrkWLkG4gT1q3/wJbFpue3bw3Xj3S/Q2Urq9Xw8ExmvvVzyP5fteCXeMs+/YC3ynOc58PSOmls5W8sQpEmJq6a7XKrsuaZX4S6qt7jTX2Uda2aQZQ1pciXKKM1XTZ4xsMYFfTrUszWry3bPwNTaulTnH+Z3JL21ji3BwpVZ1vXtFVa7upxWlRl+gaMNGDS6NIUENkgCZjnP1Yo2gag06atpBVlqmaY3F0NzMjHkchAi2PRtqjFrL5xHqPLYZ8I8/JH8euw+uyy6d/RLSqVhAlIWvsWkJGen82eDxN9k/o0pIZ8116azh0lnVJJ3cm0ox6RyAS2NIMABJgEw3wE43QFB1QEI6nYOstEzTARZDmHQOQQTbng23IJ01J9LZD9dFIKEesqm76ZTMDKjiV1lmBtyXmQFSZphvHlTV+M9esHni+hsv2Hrrrg9ds/WqifWbbj3MVaxFLlcPWoRUM2372pW2fe7Rtm/eaNuvRFusvVDrxeUOSNOPk6ZHE2nojvetqvKakveHe1oyVnCQjI5rFnPCRD6DRvEB0qzlnVnKRjB1sGX2qRGRYmMWdF+0hsaDczCu4uCkZoxcboJm+81WJfzNKq3UCX+TE1pX5aLBP9qGevet69eAVv1ac0+/1lB/cxAujSHBICQBJmnsdIMEVQcl/E3nICst03SQxRDmbw4TpmKkBX9zwIm/WYXrsktnTUI6FUPwLO0DyUWDJ9yEevdLW/YEHEjnIC6dA5qkc5C0EHhEM8iSYAiSAJluiJ1uiKDqkIR0OgdZabkQxpl0DuiUzooT6eyG69IdMVTaNWKouGfRKvMWMVQXNBrsRPpu0ra7lWiwT9teqRPSFN0P1ItqgXq3pmiQcxWQhU74fga6VzogexVajRP5DBjF75BbEHlnLlUjmPpHiVjuuyiNnMRyRWNk3AT9AxVzoij1fq3bZbrMSZU0J063y3r07231UWF2j6Ywuwe+pnCKWpEVslpZoegeKxT1JbwyzhJeVSLhVXUp4VUKupjwKnH84TZlrG73GKt7cTJWl5uMlRTbzhI6RdWJ7awaI2aZbqlEKeg+TQq6jyCgxs1zB3K04JvnrYZEGSXuexYNBSxhApY2IeXIEnOwXDdklMbIxGfeWS61wciDRJZcli2kXJqqiwFudhEGuBkluoPvxjONAxjIYZKDByEwloOHjdLryORg3lm+scHBpxCZ5NY5eIDgYI7JOVuzyRn+gQn6PMrk1KjM/4CLufbgIsq1Fz2Ra6/qB8ly16AEVhQ384rwNWI+XZuH3ZLzzff36dpvrUrOV9M0X61Nvy+hab4EfA3bjOIo1CHXfZkhXKEOalKoQzSu7NMOa/Jlhtlph+F3M7t74BkCcpT0ZYYhMNYgjxqlbSxnjEj4MiPsl4ywvsyNaG25Dl9miOBgji+zExUcJ77MoDH8tyboWymBHSKQ0CqnOZCuYVy6hjRJ1zBtme3TjmiSLi5Pgu+2kWEUPkNAjpHSNQKBsSwyZpTuYrl2VEK6RtkvGWWlaxdaG65DuoblOFiHGJuiKhZitIHkiBMhHjGGv2yCPsgIsYVDKASNEl91lYINAkSWF62acNCYysGNZYR2Wu66dlqOa6dlmrTTcSw2lgEUwjP8X2ie4d8xdduKye0nn3LGRZPXT922jTjEP77rwysnJ7atmJqauA3g9bgMOmL5DPcA/NPHQBzkPDwjw/zx6BfN8qceyiBn9K/ivz+c4f99LDPrYFGCIQKAjMyOG6WPmzL7uIrnuqD7MYPu7ccMtt9+jEz8Piy7H4Nk4Z5zMwv3Ifn2NSOslfo9Kn21TNP++jL42nzPhyW/mzj4rGrVfpWy1DVj+HMm6C/IN6UZhOvHw6vlgHS8hjWlL5kv/AH67RvQvYcmVv6FodQwXKxK3IhTalDCsx1GqGBy8wRf6v7B/JQ/bdNPMXEOv4n3KX/eKIDNjiis1tS2a6jvH2Y6P41iQR6rtMc1FaCNcRGzGk7EjVr+qoGYZSfjiLl642bEeV2NhjXc9ayhCVXPUXxTTKgRglATDKFG4E87oQbhQwuhMIvyxJVTaNplUHzDeOlFeWMzxKqUF4kTFDGiCmwIKCXeXk3p++YLL8kvcJBd4L+hiOPywxstdsbatA0GpUddZARw7GgTNMt15MMQPXaKV1HRRFOtdfh26wWtsfnlPGNS9psv/FjlUJfa9eNLZ9T915j7h7pitNPRYuOZQ9i03G4/uJgMwmeO/Ndei0hwzE95iZt1EP8l76WwKqW8nMgstZi+c8KWIzhbDmtiyxHaLbFPO6qJLbmJPvDdNjKMwWcIyHGSLUchMF5wXc6wbDkmwZacHNMYw5blOBo86cgkUtleNpdYLqj6xrGmieJJ9PDTJugy43L0EmR1K2/bi2pDkeFF3feRubbRFuPa29QtvBxreaBVAVqyxGxmy2qHUZbU4DsaFBmSxIUcsXuN4QdN0KNU9D2MKuJNZOFGUxXzfLPyJeYLr2F77ulKgTnR1UQKrNe9FFivthQYrqtdSIGd0EoK7ASjfKaLKbDyqY6cfvzwapnIvySJzbkEYQXT9mfjzZ8VdmfD/Nljf7a8+ZNpCn9c8ydTevaa5k/mQNfxzZ/dJlbRawNe72Rn5yyyOh8ZdDZ5VsT2EecS2uQ817XJebg2OVeTNjmfxca5OreDzuHvpZxv1DUNNuY89Q2ho+AUtoReT00/xB9zFrItdLZgWwhbmuaNoXOM8o2mmL3RzscnEHxcc52PiQMGJ7h3wOAEwioOabKKXFsCvttGhtfDZ5hSI63iEATGcsFZRvntrFV8vYRV5Cjg17NW8Tr5wPpE1CqeRFjFkwmreAphFV9LWMVTCat4GmEVTyes4usIq3gGYRXP5FnF+xgX+mKojhGKXcxS7GIiMjoXvjbf8+FbQ7jfWCakh+GNswjeOJvgjXMI3jif4I0VBG9cQPDGhQRvXMTjjTswciSQyK1GRW4JY/geE/Sd8sHZCZCujKADhwUX9SFC1F9PiPpZhKifTYj6OYSon0+I+gpC1C8gRP1CQtQvAqKOh+tVNpYFBMBztCcSYcdJRNhxMhF2nEKEHa8lwo5TibDjNCLsOJ0IO15HhB1nEGHHmSDs4O5ENDNWv7nQ97AkUDuahABsz9j28d0x5ku6IUOpNOvAv6QXvtZqMyjUE+p58qJNt9hz/WAWZFgfuz3VIzHslYuO0NnQU8CVZ/i9SEzCsJxXMcqfMTnv49RNKCjnKd6EkoGvSec1igTnlVnOCzFfcrLEl5zMfsnJcl9yMmtQNCaSTyY+PqNzogzApA1/p0hI7iks/k6Rk9xTcJCU3HGaxr9W6baa1SyAU5UAfJsFcJoSgA+wAE5XArCMBfA6JQCfYwGcoQTgYhbAmUoAPsMCeL0SgF0sgLOUALyJBXC2EoBxFsA5SgBeYgGcqwRgJZUVlAHweRbA+UoAOD2IVygB+CkL4AIlADMsgAuVALzMArhICQAnp3WxTONS/nVBlyjN7UNb4jChbQU66LZnPdBBtz3rgw46E7EBB50JsoGDzpwZBw46HoIvJ+LA44g48DVEHHi86fq8qLoD3W2xcZw96KE/MYGzpaY90LgTG9QZ5mEGAkHWnGHtcIawwz0SrlHmGUFpDQ8JGaP8PyYSfoRyJ0dmMmpue1I9D5xxv2FTRq1hk2LH/QQeqnA67uMOZK8E9Vu8GK78Xzznbw4TG5UKxZgs8M/s35NHY4gKGyf40NGbWHYFH4yr014cdoyIfIpwIia+ARM1IxwmagcT4XF7kY3bwUTNyN32VhxOZHtWgBPZnpXgRM37WW1vBeBEtmdBOJHtWQpO1IDeReVPgpryJ0EC2zFCscXVhNynrtjiuGKLaVJscRJXOF/Gyd4HIQpbMv7PazjKJ2B0f9rkjCrDGT74BcjX+tiv9RGcEYOv2XDhIzjDr0acS9Q5w49zhk8TZ/hJXOFS72fxGGiMe2EXNluAnS1AUKYJcY92iEe0QzysHeI+7RD36oa4XfsSp7VDnNEOcbduiFO6Ad6m/ZsPaof4gHaI92mHeFfbU9oFgTnY/rpxqv0p7QX17YJufEQ7xEOLkR3v9wA7znoAon7PcX/7U2bKA5rngAf0xD0eEMKZ9teOLnz1w4vRJtztAeY52P6WcMoDEvNw+3/0o7oh7tC+xMe0QTR/xtufMAc84PJ4IWid8QBlpueP1nSqWH4ZYOfBckTs+eYRsc1bN0xPzyKd9y7lH6XyX4y8v4b/fmDpLO94FHl26mK5w1jH6keWNrYxht7M3+fg1HGl9Z3tTjN7J0CLBTWxTRC+Nt/zYSC5lQ+pBtR1fGKYxR/df4gCFjXLSvFB/5G4B1OSRUOwyb92xCbhT6wW3OyR1P0VlXrxuScbwWjeSZDuvzBfMNhtIgy8WXJ+NVoVe7UJ9zu7nj+GrFek6cpts823mzcecpb+Nu5th93fMAH/X3l85NEFF9gFv8h0RyrB5TUl+/RTmTdBOUHpmPpgXinAty3AUDyVjpalc/mmyOqeZKPsbfivvhD++UfuD3ziGy9vfddPl8/82Rvu/b2Pnn3IOP7cO69+8YEfrSLocrR6Hvl8AjdFGjdJMW7yKKLF4vEisc2ZIIov8iwPA1o1uZhBdElNyUf5WuWX5hTfQ3mTs2sdaK1oqQGY2LUO4LvWBU271hyrUQBWwz5tUG1a1MUP8rQ0+G682AU1VmmyUCtI25a00f1z1kammjocmTTFfkeqib4GW/27A7NxtbwCLTYN6NyMlXPaxoUgzPEEtUgUYpmAuJaBWIY/5U9dmRBvoM5xobfmVAiINzIQK/CnfGWjCXEzVWPbo1BjaEK8iSrM7cVPfOEQVzMQ++BPBGI/qSbY+yL74U8EZpVY5ZXUdWBVhaYHJsQtVFsm9MjdAPndOQbmAPypYMKCrpuwoPsmLEiaMPy8bpBsfYjqH8UbjgYlFJBzkN36QVb0g+zRD7JXP8g+/SD79YOs6gdZ0w8SvfWyyB7vTTXDc8yJ4Ll25qBnKccuYFRObSQNUrer5SO2QBcLUz68VoQgbGdXFDQqZ7KaOKUvXZUiIjW8OD7N+pvmz4ycX1nQ5FcWLK9xUiaV/2su6IJXUV3zRZ265k5dsxrETl1zp665U9esALFT19ypa24bSnuirvngYsRjpwq5U4X8qmbHQx6wrPpJ7YWqoU7NcKdmuFMzvLAS06kZ7tQMd2qGF1bxdGqGPVUzfKH7NcMX6qsZru8hfL3liq4lxCaMRE3t6aBLNl72E2wCl90dMAmM7g0ENe0NJIjKBx9TWgga3uTnqg+xsipRfTC6H5cmigHY8t80/IlAzIjui0XXkifWMkH1G0Zvhyhz1zIhsZZuYi1r6Ron3qbqwFZzB+4lh5x+DTNrGHIRAjTMfkeYUKxBy2ucD6l+zPyQHzn8kGu5gPtGTcDo1bM+QE4u6F9jZAj4QnNVxoTCYBRcyPUWXCH3lU6IVDo2bITh0hj2CEPEEuZApgXXCRS6ZQC8ngUQVgJwIocRfUav2dqu8ivOC36jN994oWcptZse1LSbHoSvPY1vW8t88lV2evsJ7o+oMeD71Lk/gnO/XxP3R1hk+1Huj8KlMYSIml4nuh0fZWeLEqSNinN3jiEe0Q7xsHaI+7RD3Ksb4nbtS5zWDnFGO8TduiFOaQMINN8iZEcX1nhAO8QHPfDVd7Uvh7vHPA9ohzjrAStzUDvE+9ufee73gAzOegCifsdsf/tTRj87PuQBs6Vf89zT/oTR/9GPaId4aDFKzIHF6PI8qhviDu1LfKz9sfg+DziOh9sfjdPt74lOtb/JcsGDmm5/1YiX97WR/z2zGK3gbPt/9N72VzwuyODdHmCe/R6wrDMe0Dz69K35M74Yldn+xej0uMDhBzyAx/36ZSbQ9jLzHg8oMw8kE/R79Yc9APFQGzuP5s+QfpDhdgap3wVwz9Ds9QIDaVfinWKUtmMfF4k97QFE6if2Qx7QPvrd3Hu9YBg8kOdyAaIX2GfWA+xzCwaQU3ULCkGRQVQ7Vr0Hgnx1q+v6iaD6HNqOBPmN3hJVjnwUcEtHgnxgeo+VWa+iepvJALjUXpkcaSKIAR1Vw7m9eLkB2EQXS4ooXqcd0VSnzZH3SJNazLXpYGkMJc0je3idtuIV7jGxa+wY4hHtEA9rh7hPO8S9uiFu177Eae0QZ7RD3K0b4pQ2gEB1tj87znoAon7Vs7/9KTPlAe34iHaIhxYTYZ5tukia13h7+3Pjo7oh7tC+xMfaH4sH2l99e+Gjpxej9r5nMRrBmfb/aBc8qH0ewOODHvjquxYjg+9pf3W7OB3692mH+ED7m62OD9WmInhwMfKOF9yJvR4g9X4PMLh+PXFkUbk85s/4YrQJXuDwgx7Qjx4I/jXS2vwZaHuZeY8HlJkHnPp72t+NcgGi/rz/rH4ZDOkHGW5nkPpdAPcMzV4vMJB2Jd6pymg79nGR2NMeQKR+Yj+0KN3ce71gGLywrTCzKNln1hOuShcG0kfWRCKDOBcfuFayfKdaybLfScnynU5Llm01o12NxXEqaMtqRazjNtw3AJuYN2cCM6AVtF2aKmjLLOG7moS3YaMCl8YwZ8WUILSCtsLOViHYvSL21RxDPKId4mHtEPdph7hXN8Tt2pc4rR3ijHaIu3VDnNIN8A4PYPFg+7O3CyI46wGIBzwg1fvbXgbxzFwbCaF+Uj/oAevvAVs91f5LdIHU+zygeQ63P6nv94CR2c8c0CzD6FM+YCkT0wXha45iIPnPbjVivowfAJfHkPfX8d+vLFEPmMdU4uUlDOEAlgsYwoIkwhjCFSyvMQeJM0bfE42wve99KgdfFW/IiquH7UH3D74GySSPDRsJuDQG0YnGuI3YZJwLCBME5ToAOwDbDCB2f9kG+5NAU7cyd9xh0JLNMQ2F9I/MlYIZuC6LjrW/CXRpZu7yQeJ+wqAN2IIr5pTR95GjC968+aCRHZn3BcmDNG/mvIFaZFCBGU2INzIQE/AnAjFFQNzMQEzBnwjEDAHxJgZiBv5EIHYREFczELvgT3nnCxC0RPmIZQXfzFzllQzECvyJQOwhIG5hIPbAnwquScF116TgvmtSUHFNeuHSGMkGT9HbenvZ6XoJZQFAdusHGdQPMqEfZEo/yIx+kF36QZb1g6zoB9mDgUw+efXOd1hBFhsg16CW72ON648b9yu/ln+/NmvKg0bfNxumPIUeiw9yr8u+EvpHmAmdu/L5iWtP5lj6Ddwb5fv+nlWbKX3to1Koq7iJuPQ4DR0/3JeIaHJ4IrQH5jf6d5kL+g7VBSumUENAdcGy9G2xoclH2DvF63pXqts7P27vfJrsnZ/EFRNfgKUxeDSjD3wHndNbLkBQJiDOoTuGeEQ7xMPaIe7TDnGvbojbtS9xWjvEGe0Qd+uGOKUb4G3av/mgdogPaId4n3aId7U9pV0QmIPtrxun2p/SXlDfLpDaA3jUzzyHPGC0DmiH+KAH/DwPeGVTHtA8D3pgjdOL0Wzd7wHCzHoAon7Ns38xap67PWAID7a/EE55wA4+3P4f/ahuiDu0L/ExbRDNn/H2J8wBD2hbL8TVXogSpueP1nQ2W34Z4BSjztOD/je4f9/JG3Red9L/PnbbI6ZvvyrGbO/4mz8jCkT2E2wTga/Za5HAfIG5ciWspmppy6hIqu8AxfAdoICmHaAYKYU2bMTh0hhUg6fomeE4O12coF4c0koXyLlnGzsAOwBfnQCZy4NM1SKrgvBpLJ1OcG3Z+kQmsAnGTsQl7IQi9iISDnTcvvyJ5jO8UISoYZmwrI1TMdL/CbOG5U50AmsNi/n3nMQXpXhVLGbt8QZuiWz/Z8wS2evsDGBWfqxruBb9n1NddxAilYeU6rQJ/HeoYtUYybwJQRBlBxyAQ/W4tAn4mjzIeNNvxIw6j+d40hPgIDhm9H8ZcJ3dZ4qxPtPzx1bxyn+u3DYLF79q52aOHno7g10ANavgqlD9RrLwNVwjtlqRFVR361K4WxfT5NalSFzZsJGGS2PwmBYaqjQ7WZogjBcAzpuNA+xqmyilc6KUnDDocA9MC8BwmcZp0k0bxQjw3MkTWngeSHyRc2dlVk38yvZvNE9zLiHazzAs1QPphBeZM4Trg/iwPesH+ODje4kd30sgHuYMwLJT5wCz7yyhDmGgJpJzrCMjZyIzEs7Gj9Fpxc5GnHtSs3qrCfxnVH1sGnUalQuF40b/f7GsmdCXeEm0fLC0nRhfmbmDJnPfrMDcQfgdRECSUnRJLefhKL0dV3VnTR25iXJmUwqF3YGm50keO1PwtuJqjOdT97bi7ntbcfkc8qdhDnli/YUT27bv3Fynmi0zDFDOzQ3Hlx7ipH9PxhK9Myh8H5KTXoXlqmesoPn/s2WfW3Sx9WubGKtt5iC+S12fpMxoaYLQJ3gqtUKcee+hzs/GRfFXzBp/WUJYO9w4JhYyK6CCRAEvxE1v7S/f/Mu//VR65vZb7/38u88Yz008N/P1f/veH3/lY+kff/v5m79+Ov6Zrxxn5X5JgNJ8EU1hfGQh55MHGcGVd0ACYpyASGbo4goxqglxraMzw2kCIntSOi3hvWUIiDc6OoWcJSCyJ6Wz8CcCsYuAeJOjc805AiJ7UjoHfyIQ8zyI5k/2pHQe/kRgUod12ZPSBfjTrq/AWpL8jcAk4cMU1cxZl7oPU8R9mKQmH6bIYjOJZoxKcGmMgipB9wKZrsROVyJ0HgDp1w8yrB9kQD/IuH6QKf0g0/pBZvSDzOoH2aUfZE4/yLx+kAX9ICP6QQb1gwzpBxlVKHtJIiHmZ5oh5vajM83FmNPTClGg+SSB1DJl6TiQH4dmFb4uJtzlCpC7XDFoMdgkW8Co3kTscsGzznyHwE84BEHXkxpEmza/e23a/KhDEIJLYxg8JGEXA+R02hncTHMgpXdO2BvW0xGOfEIhNMjK5caz/Nz1HaCZlfPEeI4P/E5TfPYofBBoeiYfcmXhusigq7Oj09KOjjxJgk31zGzLgHU2N2bIrDgR7AcUgv2UhLnPkFYjBQnAZfsHoNXAWTGiaQMsglNdQobNaJj7KY+KJZjKLahIcJe0BGMLQb4xTeupLqP6BPhKC+f7ITM2FMfcs4BqbW9jjv3oLSxBhdyIuIUvJ/mRh1hhGKlgUZPETlIXuUeFRowJhzoiASrFFC6wyakR6ER1Fyvn/gU2OZLyeM4lx4sh5sbh7XeUo5IGxD3aIR7RDvGwdoj7tEPcqxvidu1LnNYOcUY7xN26IU7pBniHB7B4sP3Z2wURnPUAxAMekOr9bS+DeFOWNrKDMx6wgwc8gMf72p8dpz2gwT3gRHlBT8x4QAYf9IBUL0p2vN8DHsp+qgYkqBDt5ojpLBloRwG0/Ge7dPtR7gS1249KDm4/OqG9bz/CQCLpPLMn+FpuT+/aRY1sUa2nLe4LqdUW8L4QXlK3NtJWCyobteULuKBWd2Yr7KYPth1kuQ2C2dYxubqF0wp/Kl9dnITrQjfn8I78a1FiEKeZ11oA8aT3TKcd+VeDZaPlpMoHberiey7n+Ji+gzYZ+Y78IMWeJjbX80Qn/272uhbzp5llr61TqWxUFJeo1kKGpHuFDHhlY+e+uQ7A9rrNbSOrDrAn+D1vEfRJtumTNlUEYaeTmux0knYc/MZA0lzQ5KvoIpAr1XVk5yIQYY6hcxGIEsTORSBaIHYuAtEBsXMRSJsKTOcikMWivjsXgehZ4iEPeDwz7S/VLrQh3tP+RqZjEjp6onNh0AJL9aJkx84tMu3Kjp1bZNpUO3ZukdECsXOLjI4ldm6RaVdt27lFpl3x6NlbZFa7f4vMap23yAxkWq4rWELUWATRtrCtX9nioDEDcWVLUNNeXUy+flG126Sfz0Mxt7tNXu5mt8mEansu7BgqU2aVh5izPSsQLGrWWTnoNplw0m0yBteMd6IsUDckxUTdJoPWbpN+OAXRIDJId5vkrMD+ShC+bQFGdMasY9i0BR+AAIhLqZIKNoO6lCq5kPPJg0w2TQuxSJWLmUyIzjpGJgiIa6kOE2jLlRQB8QZdPShNiDfq6kFpQtzsrJkCAVFbx0gToqBjpF2aAbNm+a2XsoSFz6sp+7S6hc/jFj6rycJzOkKARkC4ocmT5dBoJxVOL4kCoU0AyJB+kGH9ICP6Qfr1g4zrB5nQDzKlH2RaP8iMfpBd+kHm9INM6gep0pIwi8QhWlsSxpDAOOWkZ1tK4etAPxssDUA2l7L4qbyWhAPrOy0Jlyz2loSXu9WS0IafHMEtJTWCjalzSwnnlpwmbuGc88yh3FKBS2O4xTz2hdc0V9jZKoSCrYg3DR1DPKId4mHtEPdph7hXN8Tt2pc4rR3ijHaIu3VDnNIN8A4PYPFg+7O3CyI46wGIBzwg1fvbXgbxCrY2EkL9pH7QA9bfA7Z6ygMyeLBDGB1LvN8DJoFtZ+PCvRFB+JqjiEX+s11qZ1MaVWtnU3HQzmZUWzubsEIWgTqoHIavtWf7HHMLzHyB34Bj4HuNdMDAn6tsqixoG4ise8kjfFPF0kmeIZF5NfdGhX3FFEHzDsBFBlBDGwi8qUQSfdLV1NhzimCwqy36aA38a5v10Rr4SZv10Rr4RaeP1rz30crCdaHFFPPdR2swoqGPFrqf6aSP1mDSC320QEFQnuiY1i2nG7OaBC1LS77fGPy4uaDSq6gRzhvUvcROIxxh2qjTCEcJYqcRjhaInUY4OiB2GuG0qcB0GuEsFvXdaYSjZ4mdBhft6uctygYXnUY4bUqYTueRdtUTnc4jbWq2Op1HtEDsdB7RscRO55F21badziPtikfPdh65xP3OI5fo7Dwy+ImWO4AsIXalYtSp+KwCkamj+1n4GvM1cbWvyaFngJYQp4rDbPsK82eEuKWc2S4pN38m7M+6cdQ1lkhs7sbNvfG3ym/u+uHX4g0zigyZwxAGQuYwS+YwQWY/fM1+8g/MF+Of/Is02bNVHnFw8i+Ob8tFNG3LcXpJRJroxIu34rwqHJyzw/rw+DqteAy7h8ewYzw2DNou3fVReDjrGOIR7RAPa4e4TzvEvbohbte+xGntEGe0Q9ytG+KUboC3a//mA9ohzrY/e+MxjmOID3pATcx4YI13tb0M4vkapxB3aF/iY+2PxWkPCLUXbP9s+5P6bg9oMv3Mc3/7E2ZP+y/xkAd454AHvIk9i1E5TrW/UHvBIrgAUT877p8/ytDZFfllRFpM4CPnd+OnqyXwUw4S+KcrJvDnObUqDzLbRA6xSBRihIDINr+NwJ/yzGVCXOuonW6KgKit+a0JUVvzWxOis+a3OQLiTXSrWgQi1a6VbX6bhz/tqf5C82cXP9VvHiVaZ+5+/Rq2sC7rITAAw/wZ4+ycdRlDbzGBX9fcZHvmqskdO6e2UA2C0W0vTsvhLkJos/A1Yj6/pvn88DVlbM7BvY6Py2ZTxz34alft3IxARc8QlsidRGRQkR1UonBdhD/lF9LV1J7IoG4nqy+zg7rhh9hXX4Y/Hax+QuvquxRX3wV/Mvulc7Nxdqoqru/4VfCdqm5NO1UVHrL4bpHqLRclpF2J27dcXOHmLRe9anjvQ89WM/vkVYg527MapI7t2UADooNbLnqd3HJRgWu2PeuBa7ZbXaABK6JbLrqtt1yU4BR2uBVMLGRWYH/Foirkbrl4RYbMsOWDlK4pSdhwxY5H2YWcjylLwdVlj2oRjbK67MHVZUmTuuwhcYX3WOhh8dgLNRkyXS87XS9BGgAyoB9kQj/IpH6QRf0gw/pBRvSDjOsHmdIPMq0fZEY/yJx+kHn9IAv6QZb1g+zSDzKkH2RUIZooIQ6y1usXKnzvuavLSX/6LqVYSRRTFsnrF7oh6dlIvWgM/Q5x/QIIhJHMTBfhY5RcD8mIhvpd7jXU70J9jDJcGsPgZQm7WCSnc+v6hSv47F10eP2CPHuD20WYlB9AQDPpZ3epV0L9gcy7kp13pZweWomDZHJXQNL6sWGXPXnRplvsKxEPu/QZnmhfZtESjGhfagx9tSHay32sdF6mJiA1FsIVahDQtOXlLH0ug7PYOOPSpiJQVhiX4wrjUk0Kg/M1lxLcdjn8aHmQl8uCZKh2uSaqXcb7TjCLjWrWRbFLnvucHdpw0MgA3KUfq6/VvsgZ/Ys8Vfcid+pf42n6QZ6uH+TrdGPyDv1rPEM/yDP1g3y9J0CepV28d+tf5Nn6QXbpB3mOfpDnaqfOI/oXeZ72RR7Sv8jzdS/ytna2YubPFfpBXqAf5IX6QeY9AfIiu+d4mbq/j09kAtvIOqgap7GgyDbRcLOYxfZkpPmTaR492vzZY3821vzJbHGON38y+4PLmj9r9mfLmz8H7M+Oa/4csj97TfPnCfZnxzd/nmh/9obmz5Ma8f7wCRh7XYGUpQw3f/ZzYuIrjGGzgmj4ZCaZYIlfMMY2O0WfwR14EWfay43hM8xpT0P5gemDv7LJrI3RZ1EZkMtQ0JsAAHZ9w8bwOeYLV/NfOJ+NJC/V11bgUuazACVJQqH7DZchLALG5jifepkxfLGZEb3Lug/vh8troGPuWUANGUlzjv2ovgsqJUxEhThX8DQywAqjw66APIYAHSaSHWjGeiWZsb7Uwr4MfVYaw2tAxppZ9ckQJ8zTDATe5Hj5r+tGE5bdEDRepDFCFGmMsvUpQMfjFSrjRIXKMrZCBeh427MhqONtz06AOt727ESo423PToI6fg7l5RcZkQbc1qvAwlfIJXKvUAC5EhISGbaKZOGVlvUxLLzKGN4AWBibAtFfAFGDfODvBJdmKAOfQ+cb+aBvEpd1riZ3/bD1sINWw1XZuWUV/Emw0mV4ndBqa00TGHQxsw8GHq4S1Upd+Ur9Ef8zOO5ocxz1Hag7sprnjoCBeQ4dVxvDt5nKbx9r16/UlCFeTWaIr1QQydUWtY2jCRXz1Sa/WxC1ihbUOqL2moi6UxE25Bk+7D2QCEQEcYnkexeB9+RxO4xatGGLBIpc8gSiUoAtOo+Dh4QxPGsCvxcDnmTXfa5QqSTYQUm4LjsjJeBPbCE8eUvQ8pY0hmfMnbig+bGzCuuuoUSqwWU0zOsdzLeNWAjOLLHXGH4EqHbM6x1pzetdOoN7vb1Cr3fUiWEZYweBSDrGytMYpCXzdFjCS+GUvcRQ8sUgwAb5hhQcUhP0VSjexLFyL4clRo3hD4utPQe/CSFROJQcozT8KPxJBIojboVrFOOOCRl3nPe5IhwtYweNk4y7DCKJeToC53bAXRTjmpFUGa2BqyE8CIKY5RwerBnDXzT15e9gwIfYdS8T4rfGDhqC67KzWQ3+xBbCMw412jgMGcN/yDEOX1RYdxUlUtVi7o6BLn2WNg6E8A051bKYYJBR1KhFXBjEjRvDXxFHURwxGhTyxjiPocDn2FE0Dn9iC0EkYKypv9lvXGYM/4X7ZnlJFtduy4TabbkT6TuOHbQc4oTRX8dBFFNmeRn7dAjyFLKgEYe6b8QUq/sU1KrYRA7yHHWCBQfhT8JEDrmW0SSYaMSJbzfiqm83SLLJiAJZpNhk0GSTnQqg+4QoqPLUG8EmVcrEDUJrgbHJoHtsMiRkk2Ge0RbhaEQgSpSvVGWf1iTsYdWJnz4o9pF4e1qDxvAvxX76kBPuGlT0kUglBD5jAOWu6qLiLo4SGmiRuyglVDWV0NkK3mWPEyVUk1ZCGCcU3eOEmpATBogMjIq0DJCcMAjxoFOTDDjTJAPGSLdYkww6YZEB0k6xmmRARll0u8ciVSGLDBJxmE9BCw+SLDIE8SCPWyl1MEC0uK8Ru5tNNZLHT7Ew14P3wzUgw7qJW8XR3eQacav4GgsgTnph5HjxreJFRJq6aWkqGiMniaWJo3ArQjYqkgq3m+5ngklTX4vSNOAphStxAMvUsmLGdaQMaJ3YTetETIIQXi3SvNptjKyQyDPU3GORPiGLdGvyYLstPgbBIgMK4ielcIsNxVn8Lq4OHCnOAXZYTag4B+UUZ40bc4ysEStOLOk7QDNjXStf7cgNEYtcjRS5ATrpi0lFj3tSMSiUiiEn+c1hMq6Lkfm1mhi3Copz2IlQD5EhF0vFIfhT0WWuCV3m9RKKc9A9FulxYlt7nLDIgMUQECwypCB+UorT3LsoPkxZxbICBgaIurGy5TWG5n3GyHZxhVUfwlDmB2/lg75FrPo4n1MWErRP4CzZ8doHf9rrocDIvsZZcHsV0eCxB3Xe/hX9Dy+lGrJZKO4CBrmbaiPvMTfVIpy1wV5nEoXLWJMvTtODIdVj1bKHDcAM6BnmAU1nmIdogbFPO6w2bT0NccHmietvvGDrrbs+dM3WqybWb7r1MJfzilwlPgwJaSNNP3q4AiQ/EkQRTbqha0buURXtfouC5Qn3IRP4vQpyKqUjmYMfCfjptmdpnm5dqRRnOdA3gxBVpL5RzJAD8vXyvdWHJEr6W8w9L/1km/lxtJHuUyCcOJYYInfyaxbvjqetnxTv5HMw1I8KRj/ECK4IBglF0AcUAdHEGa0U5LSFThNORwK+hoF04lOkjZGPiX2KvJNNas4n5imfQqb3dd5u+d4KIWIRORHKvhUujpum+7RcB6Q8vwNSnnAGFLssBtSdAaLLYt69Lov5JmswZZxgafPcGbBbP8hKyzTtRQtdlxBKK49uSKzl8wjVV7anwd/jD8n3lbVkDFEPPX808cQV8CI+qKnGOBz1FkoE06LDF2nroY4ii1HW7pdbDM7TuN3PC+1+kRQueYksQi3JcHSPjHFx6HimiSZoedO5ZM4Chwi1GXa9cVwYV5shTWqTc71GCFC2lV7eQX67trBrvbzNJ343u3lH1TAfY5kS06wJiDvbsySkD3MZ8BxEB928o066eYfhmpn7rsGa7UoStMsLi5RkyKokg3AK4hruEN3Nm7MC+ysh+LYFGCJDQcThDVhkivHpgsbIyyb2H0eBs5smIWGgE5bbNOGtKmyM/ES8aRLm9voLQMyhhI1Yjx6alzO8k7ua0ZgZ4fyHghILCHEUJYPBAGQudl1RY+SXhD8eVeDzsBUdEZtsYnADIrgxAi6GEh6vAZQgw+KymOTxW9wYDYj5LcCuLCqkcEhOCqKcVYWM0QhcFWIHr9+67TazoemsA0sVRp/E0CeBWRkrRtm0OYE6Klo2BoMSLGKwIMpgASvCPttE2PrJzZM7mj1gDzlAWfAQ+cHYnUwcBy7kugMXwh24oCYHLsTqviAa91rsJON/hyVkPUBO515raz/fmQw46/3buC7Lhp44wSwJNXqtUGeWBM4scU3MwjmzGyd2TJJq06Kd2pLkEecE68+CZ1gcSNqcpMU55iQbR4eJWyQ3YpPS11I2tGqVM6PPGDX7RY2yp0N9kB7I5D52ch+RHorD1zCluAGNdzewqsPEDu7xx+3PouhGV6wJbw4vY5zmzRlze5b+dzluprLP2LdlgZFD+zJxLjf0N30HJ5cbdhEQJ+gLxoibD1F24dylmJNjlxxLhpyaIrhQIX/vh7OQFzKiFM4xFM4A5sKvcczToSIgagEJFfPwbQswVgVkjdHfMlXABcQtVhx+nfua3+AWRY5e0vI9c0uIpmcVzqQ5Y9RshzG6kiGbCzfMxOFrNlUSQJVMDvIZUytuCh/eByuOFjKtM7//jdgn+tG8wBwM3q2UfmN0qwn6GhS0GQ+ZoABTYr4baTPz1KoCxuibZKI0Smk6ih79FrTxose3ijdl/WR9rcO4ttvykbyVrROvLICwiIm2d/OJcb14rzRAGgBkUImXSQGrIu6KK2Ewy064IiDLFWU+gt4JcG8TYdM4bLI/sVxta3tWgPoB34XqMWX3Q6qFOQGLLHIKc0Z32ie2HDNighl8wb28Bd+nuuBuiknry71VzKT9Tpi0j1djAVblpGiHqyJETNrfioLoN0bfK1YQ/QjueyhtXQe9W6KUqNLiluIKfEsxLtxS7CdDUflzhpZyNsZtqEqQvpeoPEZJ30eSvsfi1PBk416YPRYKIJnfZrwh8Mn4+Ti/mtcDvqfp9zAqEk+f+F1Pn/jx9ElBU/qEoyQKRPokoCl9EhAYZVzx43ewy6bs49yL00c/yPPQRemTOCnyDbZ6FLXXG1h7jeUkimhIUELHlJvmTGjD/dz9rzJlEOuO/UdMoWc+0ge/F98XzhL7wgUij1YkamtLZgKmmx/q/beJj08wtrUH0lK+EKRHLtTrYQM6jK5lNJzrJhRbhQ3nvoCyL2KKc5QprocB3zBB/y9cMhyEcznn4VydqH8oDudyhLyihjFPrsqSZmLXlTdGvyz2ieK8kyUArqOVlWmdV1/Zn4pXlkNYJE4phjoxXhB7yjkiilI5gm3JHZJHsOVDRDFX+GW5osTXnF/Dw7kAGs6BBF4XEep1k6FeQzdmVKOjnEUWeT7g3xGWu0y4YN1EOGcuePTnqgsuC8K5bzsK58RMSodzZUfhXJw4fOYwnBMoiHrM9ZLzcK4iCOe+LxHOdbsXzomPb/ZrasnTD3GiK5yrtBjOVaCocWXjZ5xw7ucKDJ9Dw7kc/GS8hjVOeD09RKjXC/wezLtut3Au6144lyXCubimcI4bBoHvtpGhCz5z5ArGITCe/zHGKcbuEoZznA3NLiacGwui9noDGuhtRDML69BAbyMa6L1bbMP54VyJDufGclLhXIAI5zJEOJclwrkCEc4VQTiH7ftvYvf9wdKdVvsye/9g6VRlfnP/H8dikP0WsAg8LR4ivjRKpM7CBBZi7pcPZRZh+VDaO+VDY6e6Vj40diK3fGjsfPOF09u5fOhZ1CEJozo8gurwKPrELB+6uoGX8SXOy4c2zmf50FV0+ZC9xiQHH5IFK11gEFKwYgmJhQUrY79tMt2lOIaKeMHKC+/nnmUdW8WSqqSvYqXEIDggISABYpOFFpAA6jmvI5056dxmnhCrApPBHPs11YIUc73b+I7O+03Q10kXpGyTkBJ6kz9DrSpgjL2tPQtSxiYcFaTkIFxHK7MUO3FXNqmhIOVmPjE2OipI6RKmCJKKBSlJ+LOduGKrBFeI6sVu5ovnlBj3fie4T5HVmgEG9yn4U34hgRZxHxDy/W3u8f1viHEfd4L7gCBJQFi4gMJCxHyfkeV7XlI0Y4ztIY7JZeCim+b/9FOZN/2MT8e8koZvW4ApBf1xgbDtlwr680TQXzCt6S/QfRvUUEPryPOsDhGxcI6Id/PEXkRzwR9VXXCOwmZ9uYfF4lNyIj6cja8SXJWTjS8/mbbFVt+KyS4ZY4+KVVcJwX2B8p/qoB+X2FPIt7inkMH3FALCPYUS6ZHLV5uWIE6oPopFBc1ZEJK+SJK+QGvOumx8hN1TIASQyGWvITY/i7sUSubzkBD4pmkcRCJM/IOnyPKup8jyeIqsS1OKLE9qq6dbrExDU2QFHoPiyt3SccaR5ipAYFz18nusqBWFKbIir2cMkyL7vPwJEGpnJUucG2GC6i859tr5QfV42AT9v9soqP4zl4LqTCvhU92N/D+OguqshFdMryxLW+j6yv7SveDi/zkKqsVl1G0TVLfKFd9yL6j+e0dBtRj3bRNUZ1oJquu4/xf3+P67YtxnnOCew6MZiu/bNqh++VUWVP9MKqjuIoLqHAiqPbXrPb7Ea7veiikAy3YZL9AZTxJfkiViEOqMnskP46PqSRYyZzGecZSzEGsnOmeR1ZWzyLaYsxB4RCVjvOQ8Z5GjcxbjFYmcRZd7OQtxp8ySk06ZZUG2ylHOouAkXVWUTVcV+LIxwuYsCAF0eKytSOQzqPK5PJHrKIBAz54kMBMJ0ADibPS+C790/D9+55O3szvUDT5oaNIWJ7p7U++/f/L80+4VT9R671IGQkTpcoqlrEHCE0GKHTZ/pZ4IirrfWDVKNlZlvjmmNu3/0JdT+LkWPMr1RCKoIo1anwTg8Ma1JfGWa4P/p2Xu/G/5dJDpC77TVE9os5qI2KHhGcCIMb7SBH4J5dyZagCrrImgLVCDONsxjRJl2rrFWmmGGTPGV4nTRjEEnVEanXXgaxztsYaEZjdG7rFGGYcrZhMArDVnTNya00LXKGQPdNArZwSb7At1GTYkau3QGIPfSbR1tCxOpm9oxKEhjwAhXJg+yz62AHtu1PV8qyLVS3n8FKvmpHopR+C6CEpiRIlIU1KOzQLoTByr5VOjUQ8b6GGK2tKEGaskXW/yz42qStwPP4KrxLeZwLdQ1f2CqDhmT+FPwjWg2oxR4jGh656Q63Yb43xtwhjfCRQ4Vp67hsh1hExs3apqACz9A7kGYNoE/m5CqTJlqNGmtuSCbYYo7yGk0tynGd+NYuad4B1ZGQ5IybDNBQjDn0+u3mqt8m9+3NGG+nYLlWAtlP0VaCFERixuXVlM6nNsTakTUhYJ7wQfUzDtfpSN/RAgbq2iRDIuRCTOIkBLOXAJogqnMXBRtZgZXIxjQIxbjE73/eOvvvH+d3f/SBydEg34/eLu6Ra8mU7f21HPv/VG0EH1gLPdGkFH4NKY9FJEuE8fIXjP502AQHRRDF+06RZEqawlYtCGSH0EAxyWuUBC/juDTS1gD2EsjqN85sKEyDaqtWgq3gUO4/9mIuC3UQSQmEV1fF307aGuaFCIda38EvaEf99FCLivVlsMrGH4qC3+WF3q12/asWnrlonNdT6Z5dI4yP1rmI/VfzCx+nkcq9S3hpxVW4csJOJUW4//L3EuAGulA+jHBf0H4kxAgjznJp8+SFg8QBvTx6X8lgR6QUIczbkFW9y8COKbFxHh5kWc9CioI1DoQUvb3ThsPMK/GWf8/0ilDf4BnZb9krAwggqRjB+2qENmzSFjXKISKIQwfpBi/DpoiUqgsBPGD/HwBFZlZ/yQxaXBGN9nZfwo6yezjB9xj/HFlcZBIoE1wTJ+EKJYzIvP8Is8TNuB7d0+ceUrF6Pxpo3xawr/mexD0FjpD9m3cN/Y77pvTHT68Gnyjf1OKsmDpEA1918+tWbr9slN67duOWXN5NRNO3dMHDXzhyBhApB3IB3kl+vDfTo//InT3y/IVIVZdyogdKfirOMm9sFizwi6lAT4+RqzSmi5TzXHRDoWddC/cLTFINav9BZDmN5iIFIvmGMRa0/HIqbmWFg2KuRBii18XNbCx7j+57KwRHNC0e3XfNd2WWxBXNuYQ9c2hlr4+EJY+KgT1zZKWHiYS3USea91FHlTPD3hFk9XxDwddsLTYWNZn0taNUxqVZanLVlzBxcmhokSCdd4Oizk6QjBLmvJFFdMJTsacd0DjLifHaVw5XOSCVPyACPQA4wGFPhaah89DFKMLWbtLz/r4dt3f/FfrpHI2uNC5qO0n59KIQYojwhX7nMOpSVaMpXTBr7eO7vlJl1LiB40CTXnN0r7p8uualB42Xnq9TU06AuAksbUXLhFNRfA1VzMiemOCUU3IajtYbQjcIpCCtkS8S20YdI+W3IjXCO6CthnZtU+iBPmqdX5sj+17C5wchym+DRYb1vLlXoRNHRYQpyV8Kkc6kzAD2SKe1BdIlHeYzr/y24mynsWQi0ugNiKL3ihmgWuEcgfxefxFvg8SubyYlS600dR1k+uOESuOMxbMY4n63obkokZZfkPIFgzQLFmUNIemdlOKPs8e3Sr+VV3O4v9yZyKg/rRNXq2fyxJDbckNuiWoRVt/zjn/xgpsRFSAqKAV9qe9dcIWf9+83Med5Yi0M36Ex3WF6WHFp71H29/1p8Qsv4z5ud8xgnrr9XO+ms7rM/NIrUV639mQVifYLWwAvPGiHI0S9oWI+nSlu8ocJCri+O5upimXF3cSa4uQSJYIVcXh7m6RGCheFywWxsiCpxXO0tFWGrDuKkIQ3mrYG5FWyBo7It4SbwwlcQLGcv+wjxyc6KLBb9R7xf8hkmmDQvLacOkTHYALnaAwurnZS+p1sQFmvqMK/s/NEF/X+aUrbwUWQ74OlKlAaEq/Tfnu66hplblgv6JeNc1omnX1XKMgNx1dassJYq7viEnG6jiU8NREg0cfyEq4R463/mjziQ1Ra/FXcFgoOfh2sfXXeF6S4vYWb945Kc/uueI6xM9H//LC/7X45G3iyeycG64ycJclyBidwn8Tb5GBtjOh0YwBpz7c5Q45hkBy2xohsYwY7l5LYYpFubb1gehJrwGM9s/P2R/gtaANUbaERMWfCeFmDm+Xp6ao9H/BzOIJQbUrAYA",
611
- "debug_symbols": "vf3dzuW8cp4Ln8vc9oZYVSSLOZWFIHAcJzBg2IHjfMCHIOe+Bos/993dfvjoGRrv2pl9jXd21yVRYkkiS9T/+dt/+8f/+r//x3/5p3/57//6v/72n/6f//O3//pv//TP//xP/+O//PO//sPf//s//eu/vP7r//nb1f8nXfVv/0n/7vWn/+0/5f5nG3+ma/6Z5p8y/9T5p80/8/yzzD/r/HPGSzOezHgy48mMJzOezHgy48mMJzOezHgy4+mMpzOezng64+mMpzOezng64+mMpzOezXg249mMZzOezXg249mMZzOezXg24+UZL894ecbLM16e8fKMl2e8POPlGS/PeGXGKzNemfHKjFdmvDLjlRmvzHhlxiszXp3x6oxXZ7w649UZr854dcarM16d8eqM5zOez3g+4/mM5zOez3g+4/mM5zOez3htxmszXpvx2ozXZrw247UZr814bcZrr3j17/4m1zX/TPNPmX++4qXUwRbkBa+QyTq8Yibv4AvahN5NBqQFsqBHbh1sQV5QFtQFvqBN6B1mQFogC1ZkWZF7r5GrQ1lQJ/SOIX13ek+Q0qEsqAt8QZvQu8OAl116Q/UOMUAX2IK8oCyoC3xBm9A7xoAVOa/IvW9Ib7reOQbkBT1O39N+/qt2kAW6wBbkBWVBz3L9UPZuMKBN6B1hQFogC3SBLcgLyoIVua7IvUfo69ST3iUGpAX9X/VW7We59aPTT/MBaYEs0AW24GW3fij7yT6gLvAFbYD2E35AWiALdIEtyAvKgh5ZOviCNqGf8+od0gJZkBf0ONqh/6tXs2g/nwekBX17agddYAvygrKgLujb0xX9ShDQLwUD0gJZoAtsQV5QFtQFK7KuyL0XWOuQFsiCHid36Inn6tAzV9/lSP2lQ1ogC3SBLcgLepy+g3EFCPAFbUJcBALSAlmgC2xBXrAilxU5LgZ9B+Nq0CEuB32/4noQIAt0wSty6SdA7wWl72nvBQPqgjahn/ylH+V+AShd0a8AA/KCsqAu8AU9Tpf2DjIgLZAFusAW5AVlQV3gC2Zku64F/ZJwdZAFuqBHLh3ygrLAF/QrzKvLWO8FNXfQBbYgLygL6oJXnNrj9J4S0HvKgLRAFugCW5AXlAV1wYosK3LvKbV2SAt6ZO+gC2xBXlAW1AW+4BXZe0P1njIgLZAFusAW5AVlQV3gC1bkvCLnFTmvyHlFzityXpHzipxX5Lwi5xW5rMhlRS4rclmRy4pcVuSyIpcVuazIZUWuK3JdkeuKXFfkuiLXFbmuyHVFrityXZF9RfYV2VdkX5F9RfYV2VdkX5F9RfYVua3IbUVuK3JbkduK3FbktiK3FbmtyG1Gzte1IC2QBbrAFuQFZUFd4AtW5LQipxU5rchpRe590K1DXlAW9Milgy9oE3of9NYhLZAFusAW5AWvyK1Lex8c4AvahN4HB6QFskAX2IK8YEXWFbn3wZY6tAm9Dw7oW1g79DjSof+rvsu9f7X4v9qE3r8GpAWyQBf0ON4hLygL6gJf0Cb0/jUgLZAFumBFLity71+tN2bvXwP6vfHVd6N3sEG9h01Km2STbup3yJd2ypvKprrJN7VFfm1Km2STbtoO3w4PR29xr5vCkTu1Re3alDaFo+950022KW8qm+qm7kj9/OjdL6j0/jcpbZJNusk25U1lU93km7YjnoP6U1OJB6FBsin2o3ayTXlRPNcMim2RTuHNneomX6RhK53SJtmkm2xTt/XnodJ70qS6yTe1Rb03TeqO/ghV+jVtkm6yTXlT2VQ3+aa2KF+btiNvRw5Hb41sm/KmcGinusk3haO3VQlHb4MSDu8km3STbcqbyqYeT/tWRc8blDbJJt1km/Kmsqlu8k3b4dvh2+Hb4dvh2+Hb4dvh2+Hb4dvRtqNtR9uOth1tOWr0j/6IV6N/DCqb6qaweae2KPqHtk5pU7f1B7safaE/E9UYGRhUN/mmtihGBwalTbJJN9mm7ZDtkO2IvtUf2Kq0RdHLBqVNskk3haN0ypvCUTvVTb4oelR/wqrRe/oDVY3eM6hsqpv6v+2PWTV6T1D0nkFpU9++LJ10U3f0J7MavWdQ2VQ3haMf6eg9QdF7cu6UNskm3WSb8qZw9NYodZNvaouiRw1Km/axrPtY1n0s6z6WdR/Luo9l3edL3eeL7/PF9/ni2+Hb4dsRPSqOb/SoQXXTPl98ny9tny/Ro/qTZo0eNUg32aZ9vsS1bFDd5JvaJI9r2aA0zyaPa9kg3VTmGebRB/s55NEHB6VNsknnOeRxjRqUN5VNdZ5XHv1yUJvnkEe/HJQ2ySad55VHvxy0zhePfjmoblrni8s6X1yvTWmTbNJN8S96G8R1q3RbXLcG9S3oj/MePW9Q2VQ3+aa2KHpef8z36HmDZJNusk15Uzj6vkXPGxSOvs3R84Ki5w0KRz+q0fMG6SbblDeVTXVTOHprRM8Lip43KG2STbopIlsnX20a/Sha0nfrRj+KFvLdur5b13fr+m5d360b/ShaqO3Wbbt1227dtlu37daNftTHMjz60aC62q/t1m2rdVv0o94u7UqbZJNusk15U9lUZwu1yzet1m3p2pQ2ySabbdqiR/URlBY9alCPUl/71qJHDUqbZJNusk15U9lUN/mm7dDt0O3Q7dDt0O3Q7dDt0O3Q7dDtsO2w7bDtsO2w7Yhe1seNW/SyGiSbdFGc9300p8V5P6huijkL6dQWxXk/KG2STbqpb4v3bYkeMKhsqpt8U1sUV5xBaZNs0k3b4dsRPaU/orfoKYN8Uzj6nkdPGZQ2haOf49FTBtmmvCkcvYWiV7j3yc/oFhMTUIAx9XIFxuRLCoyJHQkswAp0YEzwxJRrdJCJCSjAsMW07Jg7qoGhiM1JMcsTm9P7jlzj77aNvfcsTEABKtCAMZ9UAguw21LYei9a2Db2frQwAQXYbSnarPelhRlYgBXowLYx5qgmJqAAYTPYYrYqxbGI+aqJFRi2OAAxazUw5q0mhi0aKuauUhyWmL2aaMAMLMAKDFsczdw2lguYgAJUoAEzsAArELYCW4WtwlZhq7D1nCASR7MnhYUFGOdk7Ft1YNvoFzABBdhtEgfLDZiBBViBDmwbez4QiQPbFGjAiBsHthVgBTqwLUw9VSxMQAEq0IAZWIAV6EDYEmwJtgRbgi3BlmBLsCXYEmwJNoFNYBPYBDaBTWAT2AQ2gU1gU9gUNoVNYVPYFDaFTWFT2BQ2g81gM9gMNoPNYDPYDDaDzWDLsGXYMmwZtgxbhi3DlmHLsGXYCmwFtgJbga3AVmArsBXYCmwFtgpbha3CVmGrsFXYKmwVtgpbhc1hc9gcNofNYXPYHDaHzWFz2BpsDbYGW4OtwYZckpBLEnJJQi5JyCWCXCLIJYJcIsglglwiyCWCXCLIJYJcIsglglwiyCWCXCLIJYJcIsglglwiyCWCXCLIJYJcIsglglwiyCWCXCLIJYJcIsglMnJJCWwbRy4ZuK8Xo+JlYgVGBA9sG0d+GJiAAlSgATOwACsQNoMtw5Zhy7Bl2DJsGbYMW4Ytw5ZhK7AV2ApsBbYCW4GtwFZgK7AV2CpsFbYKW4WtwlZhq7BV2CpsFTaHzWFz2Bw2h81hc9gcNofNYWuwNdgabA22BluDrcHWYGuwtW3T6wImoAAVaMAMLMAKdCBsCbYEW4ItwZZgS7Al2BJsCbYEm8AmsAlsApvAJrAJbAKbwCawKWwKm8KmsClsCpvCprAhlyhyiSKXKHKJIpcocokilyhyiSKXKHKJIpcocokilyhyiSKXKHKJIpcocokilyhyiSKXKHKJIpcocokil0RFkqgEGjADu63PmKSoTFrowG7r9Xsp6pMWJmC39YK6FFVKCw0YtticyCUTwzaqgR3YNkYu6TMzL0xAAXZbr5NLUda0MAMLsAId2DZGLpkYtmidyCUTFWjAsEVDRS6ZWIEObAuj7En6/FOKwqeFAgxbDTRgBhZgBTqwbYxcMjEBBQhbgi3BlmBLsCXYEmwCm8AmsAlskUv6TEKKGqqFBViBDmwbI5dYtFnkkokC7LY+aZCiqmphBhZgj9snBFJUTkmfV0hRO7XQgBEhjmbkh4kV2Lc3j7L1tjHyw8QEDFvsUOSHiQbMwIgbzRd9vg+Ep6iaWqjAaN9RKp+BBViBDmwbo8/naMno8xMFqEADZmABVqAD20aHzWFz2Bw2hy36fIlDGL27xCGM3j0wevfEHrfEIYzePVGBBszAAqxAB7aFUWu1MGwWKEAFGjADC7ACHdg2Ru+eCFuCLcGWYEuwJdgSbAm2BJvAJrAJbAKbwCawCWwCm8AmsClsCpvCprApbAqbwqawKWwKm8FmsBlsBpvBZrAZbAabwWawZdgybBm2DFuGLcOWYcuwZdgybAW2AluBrcBWYCuwFdgKbAW2AluFrcJWYauwVdgqbBW2CluFrcLmsDlsDpvD5rA5bA6bw+awOWwNtgZbg63B1mBrsDXYGmwNtrZt5bqACShABRowAwuwAh0IG3JJQS4pyCUFuaQglxTkkoJcUpBLCnJJQS4pyCUFuaQglxTkkoJcUpBLCnJJQS4pI5d4YNs4csnAbuu15Skq1hYqMN6qaYEZWIAV6MC2MXLJxAQUoAJhM9gMNoPNYDPYIpd4CsReRH7w8UJaBTqwbYz8MDEB+/b2mboURWoLDZiBBViBDmwbIz9MTEDYKmyRH/ocYYoitoUFGLY4sJEfJraNkR88Giryw0QBKrDbYm4xStck5hajdm1h2xiZYGKPG/OFUb8mLU7EyARtvPFnwAwswLDFHkcmmNgW1sgEE8PmgS+FxuRjlMa9hiYCc0cNLB3H361AB7aN8VLRxAQUYNhaoAHbOuWiJG5hAgpQgQbMwAKsQAfCprChS1d06YouHQVyGpOPUSG3sAAr0IFtY+/SCxNQgAqEzWAz2Aw2g83C1s+dKKxbmIACVKABwzZeGi3ACnRg21guYAIKUIEGhK3AFi/6pThT41W/iW1jvO4XM5lRbSe9RiJFud1CBYYtzrN48W9iAXZbDCZH0d3CtjFeAZyYgAJUoAEzsABhc9gctgZbg63B1mBrsDXYGmwNtgZb27YoxVuYgAJUoAEzsAAr0IGwJdgSbAm2BFuCLcGWYEuwpbBJYNsoYdPABBSgAsNWA8PWAguwAh3YNuoFTMBu0ytQgZG5YtPHQ8X4rw5sG8dDxcAEFKACDZiBBQibwWawZdgybBm2DFuGLcOWYcuwZdgybAW2AluBrcBWYCuwFdgKbAW2AluFrcJWYauwVdgqbBW2CluFrcLmsDlsDpvD5rBhKMIdNofNYXPYGmwNtgZbg63B1mBrsDXYGmxt29p1ARNQgAo0YAYWYAU6ELYEW4ItwZZgS7Al2BJsCbYEW4JNYBPYBDaBTWAT2AQ2gU1gE9gUNoVNYVPYFDaFTWFDLmnIJQ25pCGXNOSShlzSkEsacklDLmnIJQ25pCGXNOSShlzSkEsacklDLmnIJQ25pCGXNOSShlzSkEsacklDLmnIJQ25pCGXNOSShlzSkEsacklDLmnIJQ25pCGXNOSShlzSkEsacklDLmnIJQ25pCGXNOSShlzSkEsacklDLmnIJQ25pCGXNOSShlzSkEsacklDLmnIJQ25pCGXNOSShlzSdi6Ra+cSuXYukWvnErl2LpFr5xK5di6Ra+cSuXYukWvnErku2BJsCbYEW4ItwZZgS7Al2BJsCTaBTWAT2AQ2gU1gE9gENoFNYFPYFDaFTWFT2BQ2hU1hU9jiaaa/RyVRuLkwAQWoQANmYAFWoANhy7Bl2DJsGbYMW4Ytw5Zhy7BFLsmxnEzkkolhk0ABKtCAGViAFRg2C2wb42lmYgIKUIFh08AMLMCYIvFAB7aNY4pkYAIKUIEGzMACXBNeckXWmBh7kQMFqEADZmABVmC0WRyLeG4JjMLNhQkoQAWGrQRmYAFGm0mgA9vGyBoTE1CACjRgBhZg34tY5iVKNBcmoAAVaMC+FxbB4gllYgU6sG2MJ5SJCShABRoQNoUtRjv6e2ISJZoL28bID322WqJEc6EAwxYHIPKDxcGK/GBjxaUCrEAHto2RHyZ2W5+PlSjRXKhAA2ZgAVagA9vGGO2YCFuBrcBWYCuwFdgiP4xTI/LDxLYx8kOOhor8MFGACjRgBoYt2jdGOyY6sG0cCx4NTEABKtCAGQibwxajHZE1okRzYox2TOy2uMxEiaaW2PTIGhMNmIEFWIEObAujRHNh2GqgAMPmgQbMwALstiqB3VYtsG2M0Y6JCShABRqw2/o7QRIlmgvDFpseox0T28bIJRMTMBSxb5FAJmZgAVZgV/T5AIm6zImRQCYmoAAV2G0erRMJZGIBVqAD28ZIIBMTUIAKhM1giwTS30WSqOFc6MCwRatHApmYgGGLlowE4tE6kUB8LNmWgQVYgQ5sGyOB9FkCGWuhTRSgAg2YgQVYgQ5sGytsFbYKW4WtwlZhiwTSolEjgUx0YNiizSKBTEzAsMWpHAlkogEzsAAr0IFtYySQiQkIW4OtwRYJpMWBjQQysQId2BZGDefCBBRgKGpgBhZgBTqw9dXheseJws2FCShABRowd5TAAqxAB7aNsaDbxAQUoAINCJvAFsu79VkjGQu8TWwbY5G3voyKjGXeJgowbNGSsdjbFa0Ty731qSIZC75NrEAHto2x8NvEbutvr8lY/G2iAg2YgQVYgQ5sG3sCWQhbhi3DlmHLYYvmywVYgWGLJsltY7mACShABYYtWrJkYAFWoAPbxnoBE1CACoStwlbD5oEV6MCwxcHyC5iA3TbWwOwJxCTOqJ5AFmZgAVagA7tN4pSLxRsnJqAAFWjADCzACnTgtkXh5sIEFGDYSqABMzBsNbACHdg2Ri7phbwSJZoWT6FRorkwAwuwAh3Y48ZDZpRoLkxAASrQgBlYgBXoQNgUtsga8SQcJZoLFRi2HJiBBRi2aMnIGhPbxsgaE8MWLRn5QaMlIz9MLMAK7HFjrc8o3LR4aIvCTYtnpyjcXChABXZbPEZF4ebCAqzAsMW+RVKIx6io7DSLzYmkEI8aUdlpefxdA2ZgAVagA9vGSArxfBGVnQvj/G2BBszAiBBbFh19YgLG9sZeREefaMAerERDRUefWIEObBujo0/sthLNFx19ogINmIEFWIEObAujhnNhAgowbBZowAwMWwnstl6GIFHDubBtjI4+MQEFqEADZmABwpZgS7BF9+/rU0jUcC4UoAINmIFhk8AKdGDYoh2i+09MwNiLaJ3o0n0lS8lj9dfYyLH+a2B06YkJKMC+vfHcEnWZCzOwACvQgW1jdPR4AIm6zIUCVGDYcmAGFmDYYjejo09sG6PPT0xAASowbDUwAwuwAh3YNkafj2enqMtcKMCwxbGI7j8xA3vceKiIWkuLx4eotbR4UIhay4UGzMAC7NsbN/RRa7mwbYw+PzEBBajAsEVDRZ+fWIAV6PsIRZ8PjFrLhftYRK3lQgUaMAMLsAL3sYhay4nR5ycmYOybByrQgLFvLbAAK9CBbWP0+YkJKH3d5CtQgQbMwAKsQO8ogW1jfBhgYuqogQIMmwUaMAMLMGyx8/HBgLjxjlrLifHZgIkJKEAFGrDbYpH5qLVcGIrY9FhMemAsJz0xFHGWxJLSExVowAwMRZwPsbj0RAe2jbHE9MQEFGDY4oSJpaYnZmABVqADwxbHIhaZjrv4KLtcaMAeN27do+xyYQU6sG2MrxFItFl8kGCiABVowAwswLDF9sZXCia2jfGtgokJKMDYtzjt4zsFcYsdZZcLHdgWRtnlwgSMuB6oQANmYAFWoAPbxvjix8QEhC3BFl//iJuyWLtwYQF2W69Ykli+cGHbGN8DiaeDqNbMcZMe1Zo57rajWnOhATOwACswbCWwbYykMDEBBahAA2ZgAVYgbAqbwWawRVKI2/yo1lxowG6Lu/io1lxYgQ5sGyM/TOy2uLePas2FCjRgBhZgBTqwbYz8MBG2Alvkh5imiWrNhRkYtmiSyA8x8RfVmgvbxliWfmICClCB3RbTHlGtubDbcmxZZI2JDmwbI2vEg0JUa+Ycp3JkjYkKNGAGFmAFdltMT0S15sTIGiU2PbLGRAEq0IBdEc8iUaK50IFtYZRoLgxFCRSgAg2YgQUYthrowLYxEsjEBBSgAg2YgQUIW4ItEkjMoUSJ5sIEDFsLVKABu63XT0qUaOZ4ZogSzRxPB1GiubBtjAQyMQEF2G0x3xIlmgszsAAr0IFtYySQiQkoQNgMNoPNYIsEEnMzUbi5sG2MBBIPFVG4uVCACjRgBnZb3MVH4eZCB7aNkUAmJqAAFWjADIStwDa+aRHHYnzVIjASyMSwRZNEApmowLDFuR4JZGIBVmDYovkiVcQTSpRoLlSgAXvceISJEs3c4kSMVBFPM1GiubBtjFQxsdta7HGkiokKNGDYYt8iVcSEQdRl5rihj7rMEjfTUZdZ+uJvEnWZCwWoQANmYAHWjiXQN6ZQ1MAEFKACuyLuiqMYc2EBVqAD28aeH0rcNkcx5kIBKtCAGViAFejAtlFhU9g0bBqoQAOGzQILsALDFs2nYYvWsbC1wAQUoAINmIHdFt+HimLMhQ5sG3t+WJiAAlSgATMwbNEkuQIdGLbYt3IBE1CACjRg2DywACvQgW1jvYAJKEAFGhC2Clt8BSfuf6MYc2HbGB/FifvfKMZcKMBui5qyKMZcmIEF2G1xBx1llyXuoKPscqEAFRhxo5vG53Li5jTKLkuMV0fZ5UIHtokaZZclvvIUZZcLBajAbusD2hq1lmV8SSryQ3weKmotS3xIKWotS3xKKWotFyagABVowAzstn5jqFFrOTGSQo5tiKQwUYAKjLglMAMLsAId2DZGUogPLkVV5UIBKtCAGViAFejAttFgM9giKcQnnqKqcqEBw9YCC7ACu61E80VSiE9ARVVl6aPNGlWVCwWoQANmYLeVOPKRFCY6sG2MpDAxAQWoQANmIGwFtgJbga3CVmGLpFCiUSMpTDRg2KLNIilMrEAHto2RFCYmoAB73BpndXT/iRXowB63RvtGUpiYgAJUoAHDFnscSWFiBTqwLYyqyoUJKEAFGjADCzBsJdCBbWPkh373qlFVuVCAYWuB3dYH6zWqKku/ZdWoqlxYgQ5sGyNrTOw2j7iRNSYq0IAZWIAV6MC2MbLGRNgUNoUt8kO/idSoqlzowLYx8sPEBBSgAg2YgbAZbAabwZZhy7AV7FvBvhXsW/TjfveqUf24MLbBAguwboyu1+LciU7W4iyJTjYwOtnEBIydjxMmrrwTDZiBIY6NjK430YFtY+969YoTpne9hQJUoAEzsHSMne9db6ED28LxadN+463j66YTBahAA2ZgAVagA9vGBFuCLcEWX7/rd/EapYkLM7AAw+aBDmwb41t4ExNQgGFrgQbMG+PDdn3UXaOEsPanA40SwoUObBt7b6n9Ll6jhHChABXYxf1+XaOEcGEBVqCvYxwlhBPzBUz7wGYBKtCAYYuWzAVYgQ5sG8sFjH2LliwCVKABu02iJXsvXFg31vivsRe1Ah3Yt0GiHXqHXJiAfRskTiMPWwkswAqMuLFl3jZG15vY42psWXS9iX3fJHY+ut7EDCzACnRgWxhFfbXfg2sU9S0UoAINmIEFWIEObBsTbAm2BFuCLcGWYEuwJdgSbAk2gU1gE9gENoFNYBPYBDaBTWBT2BQ2hU1hU9gUNoVNYVPYFDaDzWAz2Aw2g81gM9gMNoPNYMuwZdgybBm2DFuGLcOWYcuwZdgKbAW2AluBrcBWYCuwFdgKbAW2CluFrcJWYauwVdgqbBW2CluFzWGLrNEfXjXq+xYqMGwpMAMLMGwe6MC2MXJJPLxGfd9CASrQgBlYgBXowLYw6vsWJqAAI24KjAgS2DZGfpiYgBHBAhVowAwswNjeHOjAtjHyw8QEFKACDZiBBQibwCawRVLos0Y6vlkb34IeX62daMAMLMAKDIUHto2RFCYmoAAVaMC4MsRGRp8fGH1+YgIKUIEGjE1vgQVYgQ5sG6PPT0xAASrQgLAV2ApsBbYCW4WtwlZhq7BV2CpsFbYKW4WtwuawOWwOm8PmsDlsDpvD5rA5bA22BluDrcHWYGuwNdgabA22tm35uoAJKEAFGjADC7ACHQhbgi3BlmBLsCXYEmwJtgRbgi3BJrAJbAKbwCawCWwCm8AmsAlsCpvCprApbAqbwqawKWwKm8JmsBlskSrGJ+AjVUw0YFeMT7rHTcNEB7aNkUAmJmAoPFCBBszAAqxAB7aNkUAmJiBsBbZIIDE2GLWACwuw2/okt0Yt4MK2MRJIDClGLeBCASqw22LMMVZjrPF1+agFXNg2RqqYGHFzYMQtgRE3WjJSxcQMLMCwxR5HqpjYNkaqmNhtMQIXZYG1xvZGfqixOZEfYnArygKrj79bgQ5sC6MscGECCrDbevGoRlngwojbtyEq+Wqf39So5FuYgQVYgQ6MzenNF5V8CxNQgGHzQANmYNhaYAU6sG2MLj0xAQXYbS3aIbr0xAwswFD0Axt1eDXGo6K2rsYQUtTWLRSgAg2YgaGIhopONtGBbWN0shhNitq6hQIMWzRUdLKJGViAFejAtjE6WYxHxUKHCwWowFDEIRzfio82G1+LH+gdY4/HF+MDxxfi4y+Mb8QPNGBeGCVNHnM+UdK00IFtYz8sCxNQgAo0YAbClmHLsGXYCmwFtgJbga3AVmArsPUD4DGEFMVLC9PGnphmk7gAu6Iv3q1RWbSwKyLxR2XRwgp0YNvYE9PC2KEcKEAFdlsksVgHbmHsUAmsQAd2W6TXKDJamIACVKABM7AA22qSKCdamIAC3IclyokW7sMSdUEeqTjqghYq0IAZWIAV6MC2seeohbApbAqbwqawKWwKm8KmsBlsBlv0ljhuUb+zUIAKNGAGxgFogRXowLYxeksvoNKo31koQOxxwR4X7HHBHhfsccEeF+xx9KG4hEb9zkIB6kZHOzjawdEOjnZwtIOjHRzt4GgHRzs42qGhHRraoaEdGtqhoR0a2qGhHRraoaEd2m6HKM8ZuxnlOQsFuNsh6mzGDkWdzUIBKtCAGbjbIepsFjpwt0PU2Yw9bpKAAtzt0NDfGvpbQ39r6G8N/a2hvzVFOyjaQdEOinYwtIOhHQztYGgHQzsY2sHQDoZ2MLSDoR0y2iGjHTLaIaMdMtohox0y2iGjHTLaIaMdCtqhoB0K2qGgHSraoaIdKtqhoh0q2qGiHSraoaIdKtqhoh0c7eBoB0c7ONrB0Q6OdnC0g6MdHO3gaIeGdmhoh4Z2aKsd7LpWO9h1JaAAFWjADFztYFHCstCBbWNa7WBRwrJQgKsdLEpYFmZgAVagA9tGufZuSgIKEO2gaAdFOyjaQdEOinZQtIOiHRTtoGgHRTsY2sHQDoZ2MLSDoR0M7WBoB0M7GNrB0A4Z7ZDRDhntkNEO43YxdmjcLg6sQAfG7WLs0LhdHJiAAox7udi3uABOzMACjHs5C3Rg2xidd2ICCjBsOdCAGViAcbDGP3Ng2+jrlspiAa+FGViAFejAtrFdwAQUIGwNtgZbg63B1mBr2xYFKAsTUIAK3CdMShcwAQWoQANmYAFWoANhE9gENoFNYBPYBDaBTWAT2AS20SE9sG3cl0VL+7JoaV8WLe3LoqVxWWyBGViAFeirS6fRIQP3ZdFSxh5n7HHGHmfsccYeZ+xxxh6Py2IczXFZDNyXRUv7smixNtbcoYJ2qGiHinaoaIeKdqhoh4p2qGiHinaoaIeKdnC0g6MdHO3gaAdHOzjawdEOjnZwtIOjHRraoaEdGtqh7XYQXBYFl0XBZVFwWZRrt4NcGViAFbjbQa7dDoLLoqC/CfqboL8J+pugvwn6m6C/SdrtIGm3g+CyKLgsxhJVc4cE7YDLouCyKLgsCi6LomgHRTvgsii4LIqiHRTtgMuiGNrB0A64LAoui4LLouCyKLgsiqEdDO2Ay6LgsigZ7ZDRDgXtUNAOBe1Q0A4F7VDQDgXtUNAOBe1Q0A4V7VDRDhXtUNEOFe1Q0Q4V7VDRDhXtUNEOjnZwtIOjHRzt0NAODe3Q0A4N7dDQDg3t0NAODe3Q0A5tt4NeF3C3g14CVKABM7AAK3C3g167HTRdwATc7aBpt0PUgSxMQAEqcLdD1IEsLMAK3O2ggnZQtIOiHRTtoGgHRTso2kHRDop2ULSDoh0M7WBoh+h6cd8XxR8LM7AA474kdmiMZQ7ct4uaL2DcwMW+xQVwogINGDdwFliAFejAfbsYxR8Lw5YDBahAA8bBGv+sAPftYhQ9NI8t66f9QgNmYOkYrd5P+4UObAuj6KH1F7gsih4WClCBBszAAqxAB7aNCbYEW4ItRdy+x1He0PoMiEV5w0IBKjC2rARmYAFWoAPbRg1bDUxAASrQgBlYgHVjP3+bxg7183dhAfa/q7EX/fxtGpvTz9+J/fxdmIACVKABM7AAKxC2HLbenaKQYWECClCBBszAAqxAB8JWYauwVdgqbBW2CluFrcJWYauwOWwOm8PmsDlsDpvD5rA5bA5bg63B1mBrsDXYGmwNtgZbg61tWxQyLExAASrQgBlYgBXoQNgSbAm2BFuCLcGWYEuwJdgSbAk2gU1gE9gENoFNYBPYBDaBTWBT2BQ2hU1hU9gUNoVNYVPYFDaDzWAz2Aw2g81gM9gMNoPNYMuwZdgybBm2DFuGLcOWYcuwIZdk5JKMXJKRSzJySUYuycglGbkkI5dk5JKMXJKRSzJySUYuycglGbkkI5dk5JKMXJKRSzJySUYuycglGbkkI5dk5JKMXJKRSzJySUYuycglGbkkI5dk5JKMXJKRSzJySUYuycglGbkkI5cU5JKCXFKQSwpySUEuKcglBbmkIJcU5JKCXFKQSwpySUEuKcglBbmkIJcU5JKCXFKQSwpySUEuKcglBbmkIJcU5JKCXFKQSwpySUEuKcglBbmkIJcU5JKCXFKQSwpySUEuKcglBbmkIJcU5JKCXFKQSwpySUEuKcglBbmkIJcU5JKCXFKQSwpySUEuKcglBbmkIJcU5JKCXBKlG61XzlqUbkyMXDIxbDVQgArstl5Ea1G6sbAAK9CBbWPkkokJKEAFwlZhq7BV2CpsFTaHzWFz2Bw2h81hc9gcNofNYWuwNdgabA22BluDrcHWYGuwtW2LJZQWJqAAFWjADCzACnQgbAm2BFuCLcGWYEuwJdgSbAm2BJvAJrAJbAKbwCawCWwCm8AmsClsCpvCprApbAqbwqawKWwKm8FmsBlsBpvBZrAZbAabwRa5pFezWNQbLUxAASrQgBlYgBXoQNgKbAW2AluBrcBWYCuwFdgKbL4nQ0a90UQBKtCAGViAFejAPfVSMdFTMdFTMdET9Uatv/FnUW+0MAMLsAId2BZGvdHCBBSgAg2YgX0vejWWjXqjgekCJqAAdaOsajcbNUQTo/lyYAGuAiobNUQT20aVHUERVxFXM3AfllEtNHEfFh+jVLGbtqcvfYxHBY7xqIEJuKcvR7XQRANm4J6+HNVCEx3YNsa5fsU/i3N9ogAVaMAM7KdGip2Pc32iA9vGilOj4tSoODXiunlFq8d1c2IGFmAFOjBs/UYg6o0WJqAAuy3FYYnr5sQMLMAKdGDYerqKeqOFCRhx4zyLjpNiI6PjTGwLo4ZoYUSogQJUoAFje1tgAVagA8PWz6ioQlq4j3xUIS1UoAEzsAD3kY8qpIX7yEcV0sJu6++bWlQhLVSgATOwALutr9xoUYW0sG2Ma+HEtMZIRxXSRAVGhMC4fEk0aly+JhowAwuwAiNYNGpcvgbG5WtiAsbNaTTJuBUeGLfCKTADCzBuhaMdxmP1wLZxPFYPTEABKjBs0VDjsXpgAVagA9vG6McSJ0FdFaPWdn2ftV3fZ23X91nb9X3Wdn2fjcqiiXsiou36Pmu7vs9GZdHEXbfSdn2fzcqigXsiou36Pmu7vs/aru+ztuv7rO36vjxqkyauiYh87fq+fO36vjxqkyaG4uqY1uU2X7swNl+7MDZfuzA2j8qiiRXowLZRLmACwiawCWwxj9OvQ3mUE/XLTB7lRBMzsADXdEoe5UQT20a7gGs6JY9yookKNOBKKznKiRZWoAPbxnwB08wwOcqJFirQgOteI0dl0cIKdGDbWC5gAgpQgQaErcBWYBsXyzi5SttYL2ACyrz45KgsWmjADCzACvR5dcpXbRv9Aq5rVr58XbPy5Q5sG9sFXNesHDVECxVowHXNylFDtLACHbgPd7ouYAIKUIEGzOvIp6sAK9CBbV5mcpQeLUxAASrQgHlefHKUHi2sQAeu0q48So8mpo3jMhOY19UpR03OQgNmYAFW4Lo65ajJmVguYALKvOLkNK4XAw2Y51Ukp3G9GFiBDmwb6wVMQJkXlJzGMOxAA2ZgnVecPGpy+hUnp10YkNMuDMhpFwbktAsDctqFATnt1yty2oUBOe3CgJx2YUCe5TkD14R4ll0YkEd5zsQ1IZ5lFwZk2YUBWXZhQJZdGJBlFwbkWZ4zcE2IZ9mFAVl2YUCe5TkDbV1xZMyQtsAEFGBv6jb+bm/q/pJTjrVZFhZgBTqwbYx7rokJKEAFwqawKWwx0tBiI2OkYWIC1r3pcWWY2Db2K8MrX8TB6JeGzUKswdHGvR9tzsSFuBI7cQOXi3h447gUIVZiIx7eHFyIK7ETN3Ad3mi9moiHNxqtKnHET9EOtRI7cQP7RZyIhViJjTgTk9fJ6+T14Y3tbxdxIhZiJTbiTFyIK7ETwxs1PC9uwZm4gFNsT1/RPscqLy+W4NieyPCxzsvmiBO5OFZ62VyJnbiB5SJOxEI8vB48vLGdEt7+fJGj1ufFsZ0S8SOrRl3P5kQsxEpsxJk4tr/XLuQo5FlsF3EiFmIlNuJon16LkHX0X439Hf13shFn4rG/0Saj/0524gYe/XdyIhZiJTbiTEzeQt5C3kLeSt5K3kreSt5K3kreSt5K3kreSl4nr5PXyevkdfI6eZ28Tl4nr5O3kbeRt5G3kbeRt5G3kbeRt5G3wRsFTZsTsRArsRFn4kJciZ2YvIm8ibyJvIm8ibyJvIm8ibyJvIm8Ql4hr5BXyCvkFfIKeYW8Ql4hr5JXyavkVfIqeZW8Sl4lr5JXyWvkNfIaeY28Rl4jr5HXyGvkNfJm8mbyZvJm8mbyZvJSvjLKV0b5yihfGeUro3xllK+M8pVRvjLKV0b5yihfGeUro3xllK+M8pVRvjLKV0b5yihfGeUro3xllK+M8pVRvjLKV0b5yihfGeUro3xllK+M8pVRvjLKV0b5yihfGeUro3xllK+M8pVRvjLKV0b5yihfZcpXmfJVpnyVKV9lyleZ8lWmfJVnLmrBiViIldiIM3EhrsRO3MBCXiGvkFfIK+QV8gp5hbxCXiGvklfJq+RV8ip5lbxKXiWvklfJa+Q18hp5jbxGXiOvkdfIa+Q18mbyZvJm8mbyZvJm8mbyZvJm8mbyFvIW8hbyFvIW8hbyFvIW8hbyFvJW8lbyVvJW8lbyVvJW8lbyVvJW8jp5nbxOXievk9fJ6+R18jp5nbyNvI28jbyNvI28jbyNvI28jbwN3nJdxIlYiJXYiDNxIa7ETkxeyleF8lWhfFUoXxXKV4XyVaF8VShfFcpXhfJVoXxVKF8VyleF8lWhfFUoXxXKV4XyVaF8VShfFcpXhfJVoXxVKF8VyleF8lUZOaRPYucyckivkMpl5JAY/C8jh0xu4JFDJidiIcYze8kYKyjlIh7bENtT9gDPKLGa6MAYv4ntjXHCiQkY9v4FgVxGj55sxA4evbIv7pXL6JWTldiIM3EhrsRO3MCjV04mbyNvI28j7+iV/b2QXEavnFw319GbJo//3oKduIFHr+kLeuU6es1kIVZiI87EhbgSO3EDC3mFvKPX9NW/ch29ZrIRZ+JCXImduIFHr+nriOU6es1kIR7eGmzEmbgQV2InbuBxlZ+ciIWYvEbe0UNjuLaOHjq5EjtxA48eOjkRC3F4Y2S4jqv85ExciCuxEzfw6N2ThzfadlzlJyuxEWfiQlyJnXh4o63GVX5yIhZiJTbiTFyIK7ETk9fJ6+QduaJ/nDhXpz7o1AdnThhMfaFRH2zUBxv1wUZ9sFEfbNQHG/XBhj7o10WciIUYfdAvI87EhbgSOzH6oM+cMxh90JMQKzH6gqdMXIgrsROjD7pcxIlYiJWYvEJeQR90qcROjD7oehEnYiFWYvRB10xciCuxE6MPul3EiRh90E2JjTgTF+JK7MQNnNEXPCdiIVZiI87EhbgSOzH6oBfyFvIW8hb0R585pAU38MwhgxOxECuxEWfiQhzb31+tzD5yyOQGHjmkv1KZfeSQyUKsxEaciQtxJXbiBm7kbeRt5B35x+P8GflnciYuxJXYidvmNvLP5EQsxEpsxJl4xO/3PG3kk2jPNvLJZCVGu7WUiQtxJXZitFuTizgRC7ESk1fIK+QV8gp5hbxK7abUbkrtptRuSu2m1G5aiCuxE9PxMvIaeY28Rl4jr5HX6HiN/NBfwM1t5IfJI04JNuJMXIgrsRM38MgPkxOxEJO3kLeQd9yT9Fdzcxv3JJOduIFHPpmciIVYiY14eD24EFdiJ27gmU8GJ2IhVuLhbcGZuBCHt0U/GvlkcgOPfDI5EQuxEhtxJi7E5G3kbdtbrusiTsRCPOJL8IijwSNO6TzuTyYnYiFWYiPOxIW4EjsxeYW8Qt6RT/rqs+Ua+WSyEWfiQlzBI2/0dWXLNfJDL5Mo18gPkzNxj5OuaLfID4uduIEjPyxOxEKsxEY84luwEzdwvogTsRArsRFn4kJM3kzeTN4yYsaxKEaciUfMaNtSiR1cxzZH20a/SynOveh3izNxxEyxDdG/Jkf/WpyIox1SbE9TYiMe8WN7WiGObU6xbdG/Uv8aUIm6uslRWLc5EQtxeHuFQ4nius2ZOLy9Xq1Efd3m4c3Bw9u3OZbTenELNnBc+5JGzLj2LVZiI87EhbgSO3EDj3N7MnmNvEbecT5r7Ms4nyc38DifJydiIVZiI87EhZi8mbyZvIW8hbyFvOPc1mj/cQ73SokSRXovjvavF3EijjgW50Nc1xYbcSYuxBG/fx+lxLpaL472jGtNsti20RcGj74wORELsRIbcSYuxJWYvA1eueCNaroXe3AmLsSV2IkbWC7iRCzEEb+XQ5covNtciZ24gSP/L07EQqzERkxeJa+Sd5zDfayyjAq6xUo8Yka7jXN4cgGPc6x/fbXoyC19bKToyC2TjTj+fv+6QIk1kTYn4ojTxxzKqLxabMSZOLanl9eWUWGVSmzPOEaTE/H4+x5ciZ14xOn9aFRSLU7EQqzERpyJC3ElHt5on9E3+9hCGRVBqZefllERtLgQV2Inju2v0Z6jb9Zon3Etm2zEmbgQV2InbuDRrycnYvI28jZ4o8ql9VvaEkUuE0eh68ARMAcLsRIbcSYuxBU8HsR6+X2Z5SuTlXjErMGZuBBXYidu4HExmpyIhViJyWvkNfIaeY28Rt5M3kzeTN5M3kzeTN5M3kzeTN5M3kLeQt5C3kLeQt5C3kLeQt5C3kLeSt5K3kreSt5K3kreSt5K3kreSl4nr5PXyevkdfI6eZ28Tl4nr5O3kbeRt5G3kbeRt5G3kbeRt5G3wTvKVxYnYiFWYiPOxIW4EjsxeRN5E3kTeRN5E3kTeRN5E3kTeRN5hbxCXiGvkFfIK+QV8gp5hbxCXiWvklfJq+SlfJUpX2XKV5nyVaZ8lSlfZcpXmfJVpnyVKV9lyleZ8lWmfJUpX2XKV5nyVaZ8lSlfZcpXmfJVpnyVKV9lyleZ8lWmfJUpX2XKV5nyVaZ8lSlfZcpXmfJVpnyVKV9lyleZ8lWmfJUpX2XKV5nyVaZ8lSlfZcpXo8Ql9YHTMkpcFjfwyFF9cK+MspbFShyuPrhXRlnL4kI8XB7sxA08clQfjCqjfCXFwM4oX1mciSN+DPKM8pXBo3REYvBhlHxIfx2jjJKPxU48/n782+i/EoMDo+RjsQTnYCU2sA724ExciCuxEzewXcSJWIiVmLxGXiNv9AtJ0SbRLxYbcfzbGKCItXc2V2InbuDoF4sTsRArsRGTt5C3kLeQt5C3kreSt5K3kreSt5K3krcObxz36sQN7BdxIhZiJTbiTFyIyevkdfI28jbyNvI28jbyNvI28jbyNvI2eGOdns2JWIiVeHhzcCYuxJV4eGtwA6eLOBEL8cgt4R3X5ckNTM8ClZ4FKj0LjOITiYGyUXyyuBI7cQPrRZyIhViJjZi8Sl4lr5JXyWvkNfIaeY28Rl4jr5HXyGvkNfJm8mbyZvJm8mbyZvJm8mbyZvJm8hbyFvIW8hbyFvIW8hbyFvIW8hbyVvJW8lbyVvJW8lbyVvJW8lbyVvI6eZ28Tl4nr5PXyevkdfI6eZ28jbyNvI28jbyNvI28jbyNvI28DV6/LuJELMRKbMSZuBBXYicmbyJvIm8ibyJvIm8ibyJvIm8ibyKvkFfIK+QV8gp5KV855SunfOWUr5zylVO+cspXTvnKKV855SunfOWUr5zylVO+cspXTvnKKV855SunfOWUr5zylVO+cspXTvnKKV855SunfOWUr5zylVO+cspXTvnKKV855SunfOWUr5zylVO+cspXPvJVf120jIKWxYU4XDGZMopbJo8cNTlcMckyilukvxZaRnHLYiPOxOHqb/mXUdwiGt6Ro3TEb+CRo2ISYRS3SEwWjOKWxeGNwf9R3CIWMUeOmhzx++JvZRSxzO0ZuWhyIh5xYhtGbrHY35FbLLZn5JbgUZSyOBELsRIbcQaPPBCD9qPgZHEmjjbsZc9lFJwsduIGHnlgciIWYiU24kxMXiGvkFfIq+RV8ip5lbxKXiWvklfJq+RV8hp5jbxGXiOvkdfIa+Q18hp5jbyZvJm8mbyZvJm8mbyZvJm8mbyZvIW8hbyFvIW8hbyFvIW8hbyFvIW8lbyVvJW8lbyVvJW8lbyVvJW8lbxOXievk9fJ6+R18jp5nbxOXidvI28jbyNvI28jbyNvI28jbyNv2956XRdxIhZiJTbiTFyIK7ETkzeRN5E3kTeRN5E3kTeRN5E3kTeRV8gr5BXyCnmFvEJeIa+QV8gr5FXyKnmVvEpeJa+SV8mr5FXyKnmNvEZeI6+R18hr5DXyGnmNvEbeTN5M3kzeTN5M3kzeTN5M3kzeTN5C3kLeQt5C3kLeQt5C3kLeQt5C3kreSt5K3kreSt5K3kreSt5K3kpeJ6+T18nr5HXyOnmdvE5eJ6+Tt5G3kbeRt5G3kbeRt5G3kbeRl/JVonyVKF8lyleJ8lWifJUoXyXKV4nyVaJ8lShfJcpXifJVonyVKF8lyleJ8lWifJUoXyXKV4nyVaJ8lShfJcpXifJVonyVKF8lyleJ8lWifJUoXyXKV4nyVaJ8lShfJcpXifJVonyVKF8lyleJ8lWifJUoXyXKV4nyVaJ8lShfJcpXifJVonyVKF8lyleJ8lWifJUoXyXKV4nyVaJ8lShfJcpXifJVonyVKF8lyleJ8lWifJUoXyXKV4nyVaJ8lShfJcpXifJVonyVKF8lyleJ8lWifJUoXyXKV4nyVaJ8lShfJcpXifJVGvkqS3AmLsTh6i8Y1lGINXnkqMn7WammpsRGPOKX4EJciZ24bR7FV4sTsRArsRFn4kJciZ2YvIm8ibyJvIm8ibyJvIm8ibyJvIm8Ql4hr5BXyCvkFfIKeYW8Ql4hr5JXyavkVfIqeZW8Sl4lr5JXyWvkNfIaeY28Rl4jr5HXyGvkNfJm8mbyZvJm8mbyZvJm8mbyZvJm8hbyFvIW8hbyFvIW8hbyFvIW8hbyVvJW8lbyVvJW8lbyVvJW8lbyVvI6eZ28Tl4nr5PXyevkdfI6eZ28jbyNvI28jbyNvJSvhPKVUL4SyldC+UopXynlK6V8pZSvlPKVUr5SyldK+UopXynlK6V8pZSvlPKVUr5SyldK+UopXynlK6V8pZSvlPKVUr5SyldK+UopXynlK6V8pZSvlPKVUr5SyldK+UopXynlK6V8pZSvlPKVUr5SyldK+UopXynlK6V8pZSvlPKVUr5SyldK+UopXynlK6V8pZSvlPKVUr5SyldK+UopXynlK6V8pZSvlPKVUr5SyldK+UopXynlK6V8pZSvlPKVUr5SyldK+UopXynlK6V8pZSvlPKVUr5SyldK+UopXynlK6V8pZSvlPKVUr5SyldK+UopXynlK6V8pZSvlPKVUr5SyldK+UopXynlK6V8pZSvjPKVUb4yyldG+cooXxnlK6N8ZZSvjPKVUb4yyldG+cooXxnlK6N8ZZSvjPKVUb4yyldG+cooXxnlK6N8ZZSvjPKVUb4yyldG+cooXxnlK6N8ZZSvjPKVUb4yyldG+cooXxnlK6N8ZZSvjPKVUb4yyldG+cooXxnlK6N8ZZSvjPKVUb4yyldG+cooXxnlK6N8ZZSvjPKVUb4a9cPSFy6oo3548shXk8ezSQ5WYiPOxIW4EjtxA89nvcGJmLyVvJW8lbyVvJW8lbyVvE5eJ6+T18nr5HXyOnmdvE5eJ28jbyNvI28jbyNvI28jbyNvI2+DN18XcSIWYiU24kxciCuxE5M3kTeRN5E3kTeRN5E3kTeRN5E3kVfIK+QV8gp5hbxCXiGvkFfIK+RV8ip5lbxKXiWvklfJq+RV8ip5jbxGXiOvkdfIa3ueuo6a4cWVeOQKC27gkaMmh7e/4FNHzfBiJY74JWKOXDTZiRt45qLBiViIldiIMzF5C3kLeQt5K3kreSt5K3kreSt5K3kreSt5K3mdvCO39BeR6qj1XezE8W/7C0d11PouTsSxzX0xkzpqgBfHNtc4B0ZumVyIh7cGO3HbPJawW5yIhViJjTgTF+JK7MTkTeRN5E3kHbmlL2BSxxJ2izNxIa7ETtzAI7dMTsRCTF4hr5BXyCvkFfIKeZW8Sl4lr5JXyavkVfIqeUdu6Quw1Fk7PXjklsmJOLy9pr3O2unJRpyJC3jmjRyciIV4/FsJLsSVOLa516PWWTs9eOSNyYlYiJXYiDNxIa7E5C3kreSt5K3kreSt5K3kreSt5K3kreR18jp5nbxOXievk9fJ6+R18jp5G3kbeRt5G3kbeRt5G3kbeRt5G7yzdnpyIhZiJTbiTFyIK7ETkzeRN5E3kTeRN5E3kTeRN5E3kTeRV8gr5BXyCnmFvEJeIa+QV8gr5FXyKnmVvEpeJa+SV8mr5FXyKnmNvEZeI6+R18hr5DXyGnmNvEbeTN5M3kzeTN5M3kzeTN5MXspXlfJVpXxVKV9VyleV8lWlfFUpX1XKV5XyVaV8VSlfVcpXlfJVpXxVKV9VyleV8lWlfFUpX1XKV5XyVaV8VSlfVcpXlfJVpXxVKV9VyleV8lWlfFUpX1XKV5XyVaV8VSlfVcpXlfJVpXxVKV9VyleV8pVTvnLKV075yilfOeWrWYPd3+eqswZ7ciUOV/9MT51115MT8XC1YCU24nD1BX/qrLvui+HUWXc92YkbeOSoyYlYiJXYiDMxeYW8Ql4hr5JXyavkVfIqeZW8Sl4lr5JXyWvkNfIaeY28Rt6Ro/q7dXXWXU+uxE7cwCNHTR7eGizESjy8cZ6MHDW5EFfi4Y3zYeSowSNHTU7EPb5ecY5FztH+nmAdNdWLGzhyjl5xjkXOWSzEGhz7WI04Exfi4Y3+Uoc32nl+binaYX5uaXAiHt4SrMRGnIkLcSV24gZuF3EiJm8jbyPv/NzS4EJciZ24bZ4LBk5OxEKsxEaciQvx2N8a7MQNnC7iRCzESmzEmbgQkzcNrwc3sFzEShxx+qcI66jf1v5uZh3124sbOPLJ4tj+vh5FHfXbi5XYiDNxIa7ETtzAdhGT18hr5DXyGnmNvDa8Gjy8FtzAeXijrXIiFmIlNuJMPLwtuBI7cQOXizgRC7ESG3EmJm8h78g/Esd95J/BI/9MDq9EW438Mzm8Euf8yD+TM3F4Jc7JkX8mO/Hwxvb4RZyIhViJjTgTF+JK7MTkbeRt5G3kbeRt5G3kbeRt5G3kjfyj/T0XH/Xb2t9z8VG/vViIldiIM3EhrsRO3MCJvIm8ibyJvIm8ibyJvIm8ibyJvEJeIa+QV8gr5BXyCnmFvEJeIa+SV8mr5FXyKnmVvEpeJa+Sd+Sr/gk5H/Xbi4c3BwuxEhvx8Lbg8FqcMyNfTXbiBh75anIiFuLw9sXQfNRvLx7XFA+uxE48XLFfI0dNHq4SLMRKbMSZuBCPfazBTtzAI0dNTsRCrMRGnIkLMXlHLur3bD5qsxeP+NEOIxdNNuJMXIgrsRPHfuWIP3LR5EQsxEpsxMMb58zIRZMr8b7n9FGbPXjUZi9OxEKsxEaciQtxBc95LgtOxEKsxEaciQtxJXbiBhbyCnmFvEJeIa+QV8gr5BXyCnmVvEpeJa+SV8mr5FXyKnmVvEpeI6+R18hr5DXyGnmNvEZeI6+RN5M3kzeTN5M3kzeTN5M3kzeTN5O3kLeQt5C3kLeQt5C3kLeQt5C3kLeSt5K3kreSt5K3kreSt5K3kreS18nr5HXyOnmdvE5eJ6+T18nr5G3kbeRt5G3kbeRt5G3kbeRt5G3wztrsyYlYiJXYiDNxId7ztj5rsyc3cNrztj5rsycL8cjDGmzEmTjyYR5/f+T5fn0fNdiLE/HI8zVYiUf82LZxLzS5EEe+7XUpPmqwFw9vz/+jBntxIg5vX9zSRw324vCO/R33QpML8fDG9o97ockNPO6FJidiIVZiIx7eElyIK7ETD2+0ybgXmpyIhVjB436mRruN+5nJQqzERpyJC3ElduIGruSt5K3kreSt5K3kreSt5K3kreR18o57khzHfd6TBM97ksFjG1KwEWfisQ1x/o97j8lO3DaPeubFiViIldiIM3EhrsROTN5E3kTeRN5E3kTeRN5E3kTeRN5EXiGvkFfIK+QV8gp5hbxCXiGvkFfJq+RV8ip5lbxKXiWvklfJq+Q18hp5jbxGXiOvkdfIa+Q18hp5M3kzeTN5M3kzeTN5M3kzeTN5M3kLeQt5C3kLeQt5C3kLeQt5C3kLeSt5K3kreSt5K3kreSt5K3kreSt5nbxOXievk9fJ6+R18jp5nbxO3kbeRt5G3kbeRt5GXspXSvlKKV8p5SujfGWUr4zylVG+MspXRvnKKF8Z5SujfGWUr4zylVG+MspXRvnKKF8Z5SujfGWUr4zylVG+MspXRvnKKF8Z5SujfGWUr4zylVG+MspXRvnKKF8Z5SujfGWUr4zylVG+MspXRvnKKF8Z5SujfGWUr4zylVG+MspXRvnKKF8Z5SujfGWUr4zylVG+MspXRvnKKF8Z5SujfGUzX9VgJ27gmaNasBArcbh6TZGPeubFhbgSO3EDjxzlsW0jR00WYiU24kxciCuxEzewk9fJO3JUn0f2Uc+82IiHtwSHt88X+6hnXuzE4e3rhfqoZ16ciMPbYhtGjppsxJm4EFdiJ26bRz3z4kQsxEpsxJm4EFfi4c3Bw9vPpVHPvDgRC7ESG3EmLsSV2InJK+QV8gp5hbxCXiGvkFfIK+QV8ip5lbxKXiWvklfJq+RV8ip5lbxGXiPvyFF9ntpHPfPi4W3BmbgQV+LutSuOdeQou+JYR45anIiFWImNOBOX4BJcicczePAY25mciIVYiY04ExfiSuzE5K3kreSt5K3kreSt5K3kreSt5K3kdfI6eZ28Tl4nr5PXyevkdfI6eRt5G3kbeRt5G3kbeRt5G3kbeRu8sy56ciIWYiU24kxciCuxE5M3kTeRN5E3kTeRN5E3kTeRN5E3kVfIK+QV8gp5hbxCXiGvkFfIK+RV8ip5lbxKXiWvklfJq+RV8ip5x1h0jKfNuujJQjzeEbBgI87Ew1uDK7ETjxwVPHPU4EQ8clR4Ry7qNQ8+aqcXV2InbuDIS4sTsRArsRGTt5C3kLeQt5C3kreSt5K3kreSt5LXx99PwUpsxNH+Mac5a54nj+2UYCdu4JFPNNp85JPJcdw1zo2RTyYb8RizjW2YY8WDhzfOh+bEbfOoeba+trOPmufFQqzERpyJC3ElHt4S3MDpIk7Ew+vBSmzEmbiAR07QK1iJjXhsWwt24gaOvv96agtOxEKsxEaciQtxJXbiBjbyGnmNvEZeI6+R18hr5DXyGnkzeTN5M3kzeTN5M3kzeTN5M3kzeQt5C3kLeQt5C3kLeQt5C3kLeQt5K3kreSt5K3kreSt5K3kreSt5K3mdvE5eJ6+T18nr5HXyOnmdvE7eRt5G3kbeRt5G3kbeRt5G3kbeBu+oT16ciIVYiY04ExfiSuzE5E3kTeRN5E3kTeRN5E3kTeRN5E3kFfIKeYW8Ql4hr5BXyCvkFfIKeSlfOeUrp3zllK+c8pVTvnLKV075yilfOeUrp3zllK+c8pVTvnLKV075yilfOeUrp3zllK+c8pVTvnLKV075yilfOeUrp3zllK+c8pVTvnLKV075yilfOeUrp3zllK+c8pVTvnLKV075yilfOeUrp3zllK+c8pXPfJWDC3ElHq5+v+EzRw1OxMPlwUpsxMPVggtxJXbiBp45anAiFmIlNmLyNvI28jbyNnhHPbPFvcGoZ14sxEpsxJm4EFfi8PYPkvqoZ548ctTkRCzESmzEmbgQV2LyJvIKeYW8Ql4hr5BXyCvkFfIKeYW8Sl4lr5JXyavkVfIqeZW8Sl4lr5HXyGvkNfIaeY28Rl4jr5HXyJvJm8mbyZvJm8mbyZvJm8mbyZvJW8hbyFvIW8hbyFvIW8hbyFvIW8hbyVvJW8lbyVvJW8lbyVvJW8lbyevkdfI6eZ28Tl4nr5PXyevkdfI28jbyNvI28jbyNvI28jbyNvK27W3XdREnYiFWYiPOxIW4EjsxeRN5E3kTeRN5E3kTeRN5E3kTeRN5hbwzX5VgIVbi4fXgTFyIw9trVtuof17cwCNfTU7EQqzERpyJCzF5lbxKXiOvkdfIO/JVr01tl9F+zTwzWIiVmNonU/tkjhPb2T8o3EYN8+IGHnlmciIWYiU24kxciMlbyFvIW8lbyTvyTK8Za6OGebERZ+JCXImHNwc38MgzkxOxECuxEWfiQlyJyevkHXkmx7k98sxkIR7eOHYjz9j4t5m4EA9vnD8jz0xum0dt82uWMzgRC7ESG3EmLsSV2IkbOJE3kTeRN5E3kTeRN5E3kTeRN5FXyCvkFfIKeYW8Ql4hr5BXyCvkVfIqeZW8Sl4lr5JXyavkVfIqeY28I8/02sUXC/HwarARZ+JCPLw1eHjjXBr3RYPHfdHkRCzESmzE4e11d23UPC8e15H4O/O7n/HfIy8tFuKIX2PfR16anIkLcSWO/aqxvyMvDR55aXIiFmIlNuJMXIgrMXkreZ28Tl4nr5PXyevkdfI6eZ28Tt5G3kbeRt5G3kbeRt5G3kbeRt4G76htXpyIhViJjTgTF+JK7MTkTeRN5E3kTeRN5E3kTeRN5E3kTeQV8gp5hbxCXiGvkFfIK+QV8gp5lbxKXiWvklfJq+RV8ip5lbxKXiOvkdfIa+Qdeal/dL6NmufFhXh4c7ATN/C4b6kleMSpwSNOv7bK7MuDI6ZfwU7cwKNv9rWJ2lhjeXHE6bU9bayxvNiIYxs89nH0zcmV2IkbePTNyYl4eKNNRt+cbMSZuBBX4ha5tO+LJrSbzvN/sBGPmDm4EFdiJx770tt/1P0uTsRjX1qwEhtxJi7ElXh4YzvH+d/rkdqo+7UW+zjO/75+RRt1v4uVOLy9zqeN+l5rFuzEDTzO88kjfuz7OJ9bbM88b2N/x7nagsd1c/z3cX3s9Spt1Nlai/0a9+2TGziuj/mKfYzr42IhNuIeM1m0w/jm9eQGHt+8tmiH8c3ryUKsxEaciQtxJXawj20Or49tHv9diY04ExfiSuzEsV8abTu+cz05EQuxEhtxJi7EdfOoic29XqiN2tfc15poo/Z1cSYe25+DK7GD00XcY15xboy61sUjZgkuxJXYiVtwbLNcxIlYiJXYiHNsQwsuxJXYiRs4+uPiRCzESmzEY79i39WJG9gu4hE/josJsRIbcSYuxJXYiRs4j3aL7cxKbMSZOI5Xr0loo051sRM38OjvkxOxECtxeHs9Qxs1q7nXJ7RRs7q4EjtxA9eLOBFHe0aeHzWri404ExfiSuzEDTzWY5lM7enUnk7t6dSeTu3p1J5O7dmoPRu1Z6P2bIo2bIZ9b9SejdqzUXs2as+G9hy1qWO/Rm3qYiFWYiPOxIUY7TlqTXNf06ONWtPc60PaqDVdnIkL8dj+EceJG3jkjcmJWIiHtwQbcSYuxJXYiRtYh7cGD68HC7ESG3EmLsTD24KduIFHPpmciIVYiY244liYo52tgfNFnIipPUc+mWzEmbgQ03HM1J6Z2nPmk8GJWIjpOBY6jjOfxLEo1J4znwx24gae+WQwHcdK7VmpPSu1Z83EhZiOY6XjWOk4xj3GFWODo450sRFH/D7f2kYd6eKIL3EcRz6Z3MAjn0xOxEIc+yVxXEY+mZyJC3ElHt5oq5FPgkcd6eJELMRKbMQZPO43+lxqG/Wfuc97tlHPmfuaLW3Uc04eeWByeGNsf9RzLlbi8PY6ujbqORcX4krsxA088sDk4bVgIVZiI87Yr+jXVx6ciIV4xCnBRpyJC3ElduLYfouYo79PTsRCHF6LfRz9PcZ7R93m4kJciZ24gUd/n5yIhViJyTv6u8V5Mvr75ErsxA08+vvkRCzEwxvn3ujv0R9H3eb674U4vDGuPta8XdzAcf+wOBELsRIb8SumxyNvlHZO7D18YQIKUIHWsQZmYAFWoAPbwqjnXJiAAlSgATMwbB5YgQ4MW2/RqOJcmIDdFkMgUcK50IAZ2G0xLBJL1nqMVMTKtB6DDbEw7UIBKjDilsCIG3shETc2p6cHj6f6qPj0eKiPgs+JPTcsTMBui4f7KPZcaMAM7LZ4mI/iTo9n+ajt9HiUj9JOj6evqOxs8dAXhZ0LFWjADCzACvSOIe7ZYmJPEB73t1HDuVCBBszAAqxAB7aNPS8shK3AVmDrfd/jdjjKMxf6xhriOEK1AuMvxA71Hjqxd1CP+4mooVwIsUPs2M1+jfa4ZYjyyYUVGLbxd7tNYhui805MQNsbGd10Ivai7b2IIsixDVEDuVCAYevtEAWK3teKa1GfuNCAGdhtcX8QtYkLHdg2RneK+4GoS1woQAXaatSoSVxYgBXowLYxupMMTEABKjA2svfYqAj0uMhGQeDCCnRg29gvjAu7LW4tohRwoQINGLZonTjtJ1Zg2CywbYzTfmICClCBBgxbtG90hokV6BtrKOIYR7+IsaKo11vowLYx+sXEBBSgAg2YgbA5bA5bnOsxzRZldgvrwiiCG2d11MAt3AmkjVM5BdZ1Krdx0g5sG8dJOzCtU7mNk3agAg2Y16kcNWoLK9CB+6SN+rSFCShABRowr1M5KtMWVqBvNFvnesNJ28ZJO1CACjRgBpZ1Krdx0g50YNs4TtponXHSDhTgPmkbTto2TtqBBViBDtxdpI3zN9q3JqAAFZjXud5w0jactA0nbcNJ23DSNpy0DSdtw0kbRVsT2wWErcHWli1dUWgVp3XnRCzgOAP7/XZnI87EhbgSO3EDx4m4OBELMXmVvEpeXZfXzg0cdyKLo2degxs4Ts9+D985Ecc2lMFKbMSV4lD8TPHHzcNk2sdC+1hoH+OUsnFc4uzp9/+djTgTF+Jo83G8InMubuDInYv79uTRPnEiLlZiI+7e/tzRuRBXYidu4DghF4d3tHOckouV2IjDO9oksvHiSuzEbXMU92wOrw8WYiU24u4t1+BCXImduIHjcWFx95Y0WIiV2IjDK4MLcSUOrw1u4LiULI6Y0YZRfONl7Ff0tcVCrMRGnIlje9rgSuzEDRx9sI79skQsxPGcNvYrrhyLM3EhrsRO3MDRr6sOTsRCrMThGseL+mmifpqon0YxzeZMXIgrsRMjB6Z6EZO3kreSd/TlcT5Hnx19PwpfNhtxJi6770fhy2YnRq5Io8+OY9QSsRArse0+nlomLsSV2ImRK2T02Tw4EQuxEtvu41H4srkQV2InRq6IwpfZ96PwZbMQK7HtPi4pExfiSuzEyBUy+mwanIiFWIlt54EofNlciOvOA1H4shm5IopFZn6IRe5mH48PjW/OxIW4Ejsx+n4slrc5EQux7jwQi+VtzsTo+7FY3mYnRt+PxfI2J2IhRt+PxfI2Z+JC7Ds/jKKT7KMRx0j2+iH8Q/mH8Y/MPwr/qPzD+UfDj7Ek3v6R+McIEAd1VKxkL+PH2Jw6fhj/yPyj8I8RzccP5x+NfoyR7vUj8Q/hH2ML2vgRW9Cu8SO2oKXxI7agyfgRW9B0/HD6MYa2xykyalX2D+Ufxj8y/yj8o/IP5x+xp+O0GbUseZwTo5gl19HwY2S7joYfQ9V1NPwYq66jRcdg9fqR+UehH2Msev0YAUYjjtHiOhpxDBf7aMQxXrz+mvL/Y/wj84/CP8bRHrs9Ro3njzH066MNxhzQ/NHP+DauR1Eg0sa1JgpE2riORIHI5kJciZ24bY7Ckc2JWIiV2IgzcSHu3hz7HEUkm3v8cS2LRdM29/hZBhtxxNHBTtzAEvFtcCLu2zauX1EgsrkSO3HEjBMqCkQ2J2IhVmIjDm8dHF4fXImduIHtIk7E4R1tG2O347oWRSGbnbiB+31aG9e1WNRssxArsRFn4vCO45LDO9o/O3EDl4s4EQtxuMbxKuEax6JEnNGG9SJOxEKsxEaciWObR3tWB3vEHG3rQqzERpyJe5uMa1YUfGx24gbu17XNibh7RzaMgo/VL6KPL87EhbgSO3F443hFwcfmRCzE3TvybhR8bM7EhbgSO3F445jm0fdH/NH3JwuxEhtxJg5vHlyJw1sGN3DkhMWJOPa3DlZiI87EhbgSh9cHN2xP5I3FiViIldiIu3dcJ6JAZHMlduIGjryxOBGHtw0ek5SjIcZs8PwxpoPXj8Q/xkTl2OlxlV0/jH9k/hEXvJG4ZrXHyFyz3GP9SPwjPCNhzYqP9cP4R+YfhX9U/uH8I7Zg5LBZ+LF+JP4h/EP5h/GPzD8K/xjScb6OSeD5Y8wCrx+Jfwj/UP5h/CPzj8I/Kv/gLXDegsZbMG6nRwKelSHrh/IP4x+ZfxT+UfmH84+GH7NCZP2gQz9rRNYP5R/GPzL/KPxjeCLhzAqS9SPxD+EfY0/z+DH2p4wflX+M/anjR6Mf4358XEFm6cn8N+N+fP1Q/mH8I/MP3gLhLRj34+tHox+jBmX94J0bN+frh/GPzD8KtYFyaOPQ4xZ87vYoOFs/lNrAeOeMd85454x3znjnjLcg8xZkbt7MzZu5eTPv3EhC60flH84/GrVB4dCFQ88kNHZ7JqH5o1AbFN65wjtXeOcq71zlnau8BZW3oHLzVm7eys1bWVpZ6ix1ljpLnaXO0pGExv3KWJBs/6j8w/lHox8jCa0fiX+MLRjdeSah+cP4R+YfcVVMg524bY7ylc1xVZTBQqzERhxXYx1ciCuxEzdw3PUsTsRCrMRGTN5E3kTeRN5EXiGvkFfIK+QV8gp54+5mjHZEtUobgx1RrrI5Exfi2M4y2IkbeNytTE7EQhzeOtiIM3EhrsRO3MDxJOT1//7fv/vbP//rP/z9v//Tv/7Lf/n3f/vHf/zbf/o/+z/8r7/9p//n//ztf/79v/3jv/z73/7Tv/zvf/7nv/vb/+/v//l/x1/6X//z7/8l/vz3v/+31//7Onv/8V/+2+vPV8D//k///I+d/u/f4V9fX//TvobD/Nd9SYAd4PVs/kuI9HUI6xPBEeH1GLgDVPvl38vX/z6+WRX//jUSgQ3wdHcf+nv7ax80fb0PdtiG+OjZ2IjXQAeFkLshXvMWqx36a7UU4teDUU5bsSK8Bk8QoKW7AWofV4sAr5n8HeA1xPRLAD/sROk36WMnXl39yxDt6xCvMfd1NF7D6deXIdLhiL7GutdZ+RrSbl/GOByO1+WxzhCvqx4dDmm/bsbhzHwNTevajFfSQYz868ndi9qfHdPjjrS9I6+M/vWO5K9jvB4x1mF9PWDgsJZftyIdTq3x6tw4M15PYF+GqIezs64dcc3Yj9puR3Db53eRryPc3Y369W4cG7MXDszGzNdXIQ6HtH/Qcu3H64r95SGVw7lZ4/PPEaMqHdLXjcmvMfTxaSH2+LSQ/PS0OEW4d1rc3o2vT4tzY946LY7HNJY+GcfU+Cr02zHV6/Ex1fT4mKo8PaanCPeO6e3d+PqYnhvz+TGNMv1xTF8xvj6m9fkx9efHtD0+pu3xMfXnx7T+tce0tBXiheXr3HvsIb1Ce8Soh/xt+fFBtfL0oJ4i3Duot3fjkHyPrbm3or563HtHpGneV+XydYx8yDkeH/QeMXKqX94x5tNdZ3xgZtx1vkbBv7xnPO1L/1TxfhK4vr6S5OeX9vz40p4fX9qz/aVn1y+tmfJbZ1f/yO+OcThDy/XwSbukp4/at3ejvNfR+jdYVwzh5/XfU9/xiFy7rzb98g66PH8oKs8fisrjh6Ly+KGoPH8oKn/tQ1H1/VDUtH55SOtpKEn3s/JrQIcaQ3/djKqPj2m1p8f0FOHeMb29G18f09utqfp1a8q9gTXjxvg9Rnu+K4cQel0rbelrVvTLwTlPz8fGXJ4Pjrk+Hxw7HhZ0V3W++/ztsPihyzfHsKuX9OW9zjFGu9aJ3t9s+jpGfdxh3Z922FOEex329m58fZafW9P2EWn1vSMSRcRrO3qR3ZdR2in71D2tkJq1L+9hT+eopb0hlvLX6ac9f0Jqj5+Q2uMnpJb/0mT+asK6W9O/vjSm63o+CHylx6PApxA3h4Fv78m7LUrnp9tbl0dLbV0eX/crp6NSno/uX/UDR9afH1l/fmSf59FvWvTp3Wxf23alYrHDrM1p7qjGMllzVKO1r+ef0mlL2k7nYl/PQH3THgXtQReWn7Vpu3aM5l/GOM3/SHy/b9z6GD2I/xHj+UhoSo+HQo8hbp7p6flg6LlF4yuvq0XrezGyyB6womnS32OcJmDKZeuGoVzZ34wheifG+QzbT6Gv22z5ejuez3PK84lOOc3Dx3qc81GDhhHttz05zX/IHvfS6+sIx6249gVOXunh6604jReVtgcG/OvG0NP9aPI9bvXiLLQh+Udhat5hWjqFOd3OvQbAdpjXI2E6hDll1LSTshiFkN9CHE/3FUJKfTPEPtuFBuL+DHFvRzQdQhybNKW0mzTl+nWT2unOsu0h1v61HQryWzmUySkvy05mLy6Hw2un5/yCtFo4Ff1kS7JgSzif/bklx8atu/PodTjVfrAt5bQt5zCeEcbLu2F8jwj1d9+u98MIwmh7N0x1XMr9Opwxp9mne+n6FOHV0/fu6Kk7n/am+J7aLC6HJjlN29zMTMcQ9zLT+cx3OvP13TO/XDjzS0rvniQlJ4RphxSX2weOzmkm6iNBbh7iY4ibh/jcrIq+V/IhExT7SBc+hSm17vvgSmWL5QchYh2oeWxonvBHIcreCq9vhbidSb65qjueXl/3kl83ar3+8m0RK9iWcjhPTiM+93L0+Sa07RuDF9Mjxp8bcqxXNqpXPlzU7z8utS8fl+ppgLXoHuT4+gHhPLSwbwn69fjrrTg8TFt81mOMxOXr69G8dJpmet0n7dKNal8/CfsHxlj9+RirPx9j9edjrN+0aEEJtue3YmjamVnTYeTpHKOmxzHU6SWD9GaM/TD8Cvd1DG/Px1rOMe6NtRz3Jb78OOeGS3se481zTGUPkar51/vSTtm07O14XYra1x3muCE17xOklq/Tx2my6e7BPcf4wMGtCfty6LjtNPF/YcY90QstP2zUhqnur88yOU04aVvtYdfXI1BynWbcMdOtTb5++JXrcOk3jBu9RsLrIcjpsWjf7sov42DlfntY2tdKrgH747Ccrrd53/1b5ncg9Pfj8nw+QK7n8wFyPZ4POIa4+Q7D9Xw+4Nyi9+YDzjHuzQdIej6W/83ZcWssX9Lj2f9jiLtH9vltthznrG7dZh+7bJG1J1ZPJQTnfu+7DqEc7rNFTvn4ZjmXnF7YuVvPJac5p7sFXXJ6f+luRdexYXPaufA15nxq2PrwJDlGuH9o2gcOzXHy6u6hOb1E9JlDI3sUI+vpnD899j/vv9n22EN+XSoOm5FPN8t75E+Fk/tPQjieYa76ZYh6ugFJqL3RLweojq2BRPSajEiH1jg9nuLl3Bf6l7tyOtfju9Tzqk1DQv3m7H6QTLMZdHf5syAmDUH06yCnWavUvzi9ovQqmLeOTdtPU+XiNxV+PzansXu6SaXiZbH6W4jydAruvBW7JNNokPvPrfCnJ/sxxOvagCHQV4u294L4LuFJV6MM8qMgbVervdjyW426x+rydTi0Wf/SELESCRo1f7kr3wS5d2TOQW4emXOQe0fm2HNfs1urXUump+0f3SOWut+iKzX7u0H2rXtpYu8FqdeecqvXu7e8pe1lJGoqh+tu0cdJ4BTi9q3Z6UWf27dmpxeObt+and57+sit2WsX9qu8cronKserb82Y4P1l5O5HQZwqEr6+L6qngX/ZRV+16uGm5jRF9bo3lJ0bnQrvfys7leP7R832wP2Vvn6AP01R3Rx2q6crhey6L/t1wk1/C3Jalwf33uoqhyCnuuRXAqGeI1/PH0o9Xj8t0fsZkg9hjluje1jixYd6KTlN8WjBC6X25VjiuQe2PSvymjU/9MDje1X3Jt7En7/4J/74zb9jiJvDRbf35DAQeG7RWxNvxxg3J96+iXFr4u0c497E2zcxbk28SZPHczPfxLg3MHrcl3sTb/djvHmO3Zx4k1afT7ydN+TexJu09oGD2/7ig3tv4k1Pk1V3J96+2ZBbE296Pb4DeN3NPp9401OFyd2JNz3PrdyZeDu2x72Jt2/vMzPdZ+oX95l6WqDv5tPI8Qax7jfD0+EdK03y+JKtx5es7i1rdApxd60qeX7JPt9y78vca1rdvm6N+jwDne4t794u62m6qtiu53+NvOnXPU6upz3u+Axys8edjstr3jftp92rvXVsJe2xmdcA/NdZXZ4nU/lEMpVjMt3vRtrV0rtBbmZk8ccZWT6QkU8P7eu+oVJ9q/xo4E6FBu7szdE/w3NlK1+N/qk+H6T6Znz43s58E+TmzpSnO3NeS+G6MKJ6HVaQ1dOidzerXFTb8yulXY+vlKcQN6+Ut/fksATgsUXvVbmcY9yrctHTPMbNZ4ZvYty6Yn9zht2qlFHz52eHPz87bu/J1w8dp5egbs20f9Pv8VDaP+j7db/PH7hD/sAifvp8FT99voyffmAdv3OL3rxDzs+f0b/ZjluD41oe16RqkeeD43qcVbp7t3984eju3f5paurm3Vx5XNh6PLY37/bPMW7e7Z+e82+eH6f3pm7f7Z+mpG7f7Z+D3LzbPz5D3Tw/2tPz45v1teieUH5ZTfS3hTyPyy3eWpDlHOLWeixaP3BnWj9wZ+rP70z9+Z3pB9YpPLfozTvT+oE7U//Anal/4M60fuDO9Pnqfvp8eb8f7MnX14X29M703OlvvSmp7QNlJMcgHq+VzoPCi6f9tj7WOUhJdFjkyyCnxYhblb1mYpX31nJvmD5qteqXMbR9IJe257nUrse59BjiZm9pH8il7QO5tD3PpXY9z6XfxLiXS9vzXGrP1/iz52v8/WBPvsyl8VDxKJeee31bN4PNr69XhbfT1NHNXm/p+TO+pcfP+McQNz8EkZ4/459b9F6vP8e42etPc083e+w3Z8e9HiuPP8VzDHH3yOrzHnv8UNTjHhufsR89tvFScj+41r/ucgqN6bf8ZpSUULCd5OsvdJg8X2/C9Pl6E6aP15s4hrh5jt3ek0P2kOfrTRxj3Cx7+ybGrbK3c4x7ZW/fxLhV9mb6vDLqmxj3sqk8X2/ifow3z7GbZW9mH1hv4rwh98rezJ6vN/FNjA8c3Htlb2YfWG/imw25VfZm+fHYvuUPrDdh+QPrTVh+vN7EsT1uFlnIuSLAqCLg+vqCm+tfeAuSkqC8IUnWw3a0x1ODVj5w4S/PL/zl+YW/fODCf2zRe1ODVp4/pH+zHbemBu30ZtTN9FGO75zuj9CZJPtyVs/OpaZ4s1m/7vnH7bg5RWmn2aNfVvH8ZfnNcj/I3XlOO01B3Z3ntHPl7N03iaweZ6IMa9e++O2tufsmkR2LRm+9SXQOsb+0+prAP4Rof2mIm5e786J3O8Qv6xuX+0fl9tnqnzhbT+8z3WxSf34HcQxxr0n9r27SH/Rdbx/pu/6ZvnualrrZd48h7p0lx3mp5yFunmjHEDdPNP9At2vPk2Grz1ujPm6N4x2A7loY00O3y9cn7gBKffoUcry7u1kcdI5xrzgon1+KunOHmE+vRN19wMynV6LuFgd9E+TeU2q+Hl+2j4168/z4Jq/ffLv7J2EO333I6QPX/5weX/+PIW4em/T8+v/N/fLdY/ODMMdj84H3o/JpjurmsXn+itU5xK1j880c117Fo/rh0+3HpfzuTcVmef69ySyPl5w8hrj51fTbe1IPe2KPp2LPMe5NxebT3NLNMepvYtwa2/nmDLs1nZv18QoTxxB3z47be9K+3pO/ciy11r34XuWPkPzR6/X5SGq25yOp2R6PpB5D3Dyu9nwk9dyi90ZS8wdeavpmO26NpGZ7PJKaTy81FcFahlL86wu1feJqn59fqu3xI9DxsNx8BDrHuPkIlB+/DZ3zB96GzvkDb0N/E+TmI1B+/Db0sVGfT9S95m73N289f12jc7qy3Hw74hzi1tsRuTyv7cvleW1fLo9r+44hbl5ayvPavnOL3ryhLM9r+3K9nt9Q1uf1gd+cYfduKOvj9U+OIe6eHc/rA/PjD0mdO/2ttyPycTk7fJ6ylutwU/qB70jlD3xHKj//jlR+/h2p/IHvSOUPfEcqf+A7UvkD35HKH/iOVP7Ad6TyB74jlT/wHan8ge9I5Q98Ryp/4DtS+RPfkcof+I5U/sB3pPIHviOVP/AdqfyJ70jlD3xHqjz/jlT5xHekyie+I1Wef0eqPP+O1Knm++6t/vX4Vr9cz1/eK9fzl/dKevzy3jHEvQv2/T35OpmeW/Terf45xr1b/ZKev7z3TYxbefCbM+zWrX5J/vzs8Odnx/OX94o8fXnv3Olv3eqX0wekXsPFe6gi69evDpfjSPq9W/3ygVmn8nzWqTyfdSofmHX6pkVv3eofY9y81f8mxq1b/XOMe7f638S4datf1J5nQX3+Sb/zvty71b8f481z7OatfjnOT9y81T9vyL1b/WLPp0e/ifGBg3vvVr8c34u6eav/zYbcu9W38vhW/zz5dPNW//jxqLu3+va4OOrYHjdnBvTxrf45xL1b/fx8VL98YFW+8nxVvvJ8Vb7ygVX5zi1681Y/Px/VL+X5qP43Me7lwfx8VL+Ux6P6xxB3z47no/qlPB3VP3f6e7f6pyLkqviukh5eHkzP12xLz9dsK6f3mO7mr/p83f3yfN6pPJ93ur8nh/x1bNGb+esY42b+On5n7mb+Ose4l7/OZ9i9/PV85qk8n3kqfl7Lcx+VdH294trxe0776cvb4UbwvGZkojXRU+FSXf0tzOn5vEnBpsghyOl7O1nwInWW8nXBSjm943Lvy6rng5N2TpaU05cHp51KovYXkX99ufQn7RGFkisXHsq5y+mzTim+/jCi8CeiLcnb21IO2/JNGPpCTP6lJvtHYZw+Suzpej8MXiN2be+GqY5M79fhvD2tPPY65/bGvB7x3jtOdztiPS2y98p9awiicPXr77tTr2OqzrsX1i935hxiZ2o5tMdxV+7nlHqckLqVU77Zkru9uZ7ejfrldbPr1CrleUr4yQ6V0w5dn0gJ34S5mxK+DXMvJXwT5m5KqKe3pO6mhOO2tCKrG7Xi/nVKOM4z3U0JqTxOCccQt1LCd7c8jk8o8Jd5/2yR4yftbWXaZPVwWb1/P/vlU2x9PGGVnq/cW48TVnc24hih1LI/710bjVn/tuLuOYin/ZzS+IuvPwrS9kNXvehdvD+DnEZYZXcYFf3qU0PfhHDMrnz50eYqx0Xl73xo6JvWMHynXA9NqunxdpxC3F0bup6+InX3E+P1NNt09xPjVU9flLj5ifFzr0v7ZqCK2OHY1MfjFOcYVnDVpKtdH9P/NcjhZM07LRda81Zyuh+iYIiBLlJ/hjg3B+4jaGrkz105toc0BNGvg9jxUy5pD+u9uPo73ff1f+5klq9DWj02a97NWvTNI7PfBy40SfPDEOs8fU0HfR3iVEdwO4mcgkh84mkOytHd8x9BTm9Mvdp/3zyrpq/7/2nxutuZ6LSc32cykeOaebzw5ucFKzU/L1ip+XHByjHEvRHC+3tyyMv5ecHKMcbNgpVvYtwqWDnHuFew8k2MWwUrtTwvWPkmxq2x8PO+3CtYuR/jzXPsZsFKLR8oWDlvyL2ClVqfF6x8E+MDB/dewUqtHyhY+WZDbhWs1Pq4YKXWDxSs1PqBgpX6fBG+Y3vcK1j5ZoApCujn1aGk9O44Vdn3Mi9uhzZx/cDo0HEdvXujQ+el+D4wYFwUl92SD+OIp3H4Uvenl1+PnOmrO/djCJe8G9XqeyHK3gqv9cupsPqJE+27MHdPtNNc1u0T7biO3r0T7bwU371hyPqRE+34ItS9E+0Y4t6Jdg5x50S7Hk+H+/HbULemw/004/R6vN2LYZTDihp+feAk9evxSXrcmdeY2167Kr0GEOSwJafnEEl7hZAXH1by9OsDJQJ+faREwK/HJQLX4wIBT08LBL45MrihebEfWiMdztec9vC/fD2P4ekDZ2v9QK85TWV8YDvuz9N6qs+nWO8eGU0f2Z1ySgIfKdz4JszdWdpvw9ybpf0mzN1ZWj/V9N+dpT2fubfuKL7Znbu3at+FuXmr5uIf6M/Hbybd68/nzy59omFv3qq5ytNbtXOIW7dq34S4c6v2zXVHMPctUk7tUR5fAI93OE3wyZOm+bAh/nwq/7wttysp/bRM3u3bpNMrUz+4TTJ5epv0zZbcvpoe3726ezX9wbacLoXfhLl7KTyHuX0p/C7MzUvhOcztS+FxVuvupfC0LXcLljx/4iEsP7+tzY9HCo7tcX9XyvNdKX/prmTJZT9rlMOdRX5+U5Db/3e7Uk/3w+eLxs1aND+9T3X7AnZOAbdvH78Jc/f2sZQPnPSnzyrcPFOOIZ6fKT+4fTyu6nfv9vEY4t7t4znE05G+e5P8Xp+/5Or18UuuxxD3Jvnv78nXE7DX4yn+6/EE//V4ev96PHfrLjfnXS29sxX3SgyuxwUG7s/XBfomxq056OMHHPZnpNVEvt4K/8Ce+F+7J7cKJe5GeKuX3iyS8KbPiyS+6SQ3D4n8pYfkXnmDnz4Adbe84Xpc3OCnFQDvFTe008TV3eKGdlzw7mZxQztNXd0rbji2x73ihuMN090xkHYcpLo9BtJO01b3xkCOW3L3Vradlza7cyt7DnHrVvabRr07nNPS3W+mHV5i+ybIvTGhn+xQOXW+/IkxoW/C3B0T+jbMvTGhb8LcHRNq6QPvtR635e6YUJMPvNfa5PF7recQn+iIdx/Wvwtz82G9yScynJTnDVv+6oa9+bDepH2k75zC3HvmP4e49cz/TYiHz/yp4Sm30WtXr7x9+zEXtzeS+KWLH4RI1x55SDSf/oMQr/kmQ91H/jJE0+PHT++9P3IMcvdNlnZeJ/De63DNjkfm3kso7XTLd/cllOPhxbu0ql+fIe30zlVDwRRNJsr9AC8zDSHQqND1e5DT2NTakdq+2ojTSer7M0ivjkdvSpX2gxDosHRMfxKi4ZXARs/MPwgh1x4U6t3/vRD7vkyu9t5WJDwUJfW3QtjOf9LvWN4Kga0wqjj7UQjUWGbq7T8JkfcQxGv6o70XQvMnQ9h7zZn3Cf56NHzrBBfcOr1uWN4Mwfc87x3UovrJEPZWiNfoCQZSankzhO1BkOut5nzl231NbOXrHWmniadXz9gL4Qm9dZ/8/mY4NqO9d0jSvrr36tv3Ml9DiSrV/r6ZPN8Nkcx3iHK9GQKl4SU9TuHvhqj0XcD3kmfCEZGrvRli5xx5M23RjrwbQjCFJzTd/Ec/O71H9byfWdsT8NxFcnojgLwV4N6KBacRiVvrFZwC3Hoz/xTg1nv5xwB33so/3ig6PqZq/Exlv55Nx0X/7tQSHiMkx3IryZXnV7T8LMyuxfBCH4f9I0w7rXai+xbn9UTRvtyj48J/3mj9iOuX5+7fN0U/sCl2fG6+sClCK2L8uSmnwRmLkuMRxpxOlt+DPB/RPx/kjDFN5+HeP3fnLz5paaERN7++3JDXuMDxFhCXptK+WmjkHOPuGjDfRLm5/Mp323Jv/ZVXlONZe28Blu/OlctxrtAu/QeH6PQS9a0Fpb6LcWdFqVeM00vUt5Zy+iajVGzGLwO1v23H49enzrfY+55QD5ed11YccqzpPukt13aKclptep/z7eLz4/eTNR1XpcLi21dDRvLr9yDntfH2K0d9k2kgLvvvcU4LTGJ0sncxRPl9Wvx8Dbx7mjzOsT+4jF5+6MByexyJbxfb21HaJ6KYvR0FIyC/PNz9GcWOR2hviye6v7j+aN3DmWuCb51Lu05RjglSkWS5AuKHUXZJ3gv97SgZ21LaJ6JwafCfUU7HqKFQ5uLXbP6IclrC7zXQtpJlSXRV/uGRbnucP18i70bRXWNiav5uu/g+614n3bFdTgtwplT3k6z4m62bbT9MvrC9e4zq3pZSrX1ij/R4pG/nl1OWsudLC7yCHOendmWo8J3Tf7Aph0tJzbtOtubG1VG/BzndPdl+Hf+FdMvxe9OeXqj6ZfqQV478I8jpbmHs7Zwv4xmaP3fo+JGLiratXx/mb54wEwp5Gl+N/rxKnz5q1Srd/9AONf/JY2rTvS3WzL68ST7uEBUiNB6c+XOHjmsEpoIRWOfbjvx7lMevAn6zJXJhjjeVL7fkm2aphruxdqVTs5xKVhLKIkSPjXtayanuhwir9XRnmA9z+S3tFwleT5nX4Z47H87cjCKLzHO2+oMY5VIqoS9fxzjuzb4+v0Z60mFvyrkGdJ1wr/vv03NIOX3S2naW869nbr85xr4frMw9H47xacW/+8e45OfHuOTnx/i8N7ePsX/kGLe/+BijrueVr085pR5fCXRMabTy9dWwHlcJ2I3yugHzr4Oc92c/9lprp7x0ejnp/v7kv3h/XoOCvu/5tb2ZrfO1l5h/ob8b5ZdWkXevP7LzQVE5ZRU/TUCVfaORS65vR9lTFi98O0rdlf+5pvej7Kr9F5Z3o/gu9cue0ttR8n6K8XodBvmPNyxtz9G9uKT3wryG9xLG967DGfNNmCR7tOXFb28NvSlyyTHDtMcTqOcY9+ZQv4lxaxLzmyapBU3idnoAOZ4vr7sDPFRVesD7I0p+fr/+zZZgFiVVKoX+I8rpdvDas+wtHeYcjjHS3pvXfZS/8zj1OiR4T/Zqesjb6TizREuucY1oqvZ2lHaKIsdR3Dur0KV0XGjwzgD5N9txc4QlHQvv7zfJcUhiD3f2xYFOUepfHaXulq1cMGT+5lmbfq2O+P2sTdfjOfyU0nEkgWvw02kiJCX5/yCOFLzv8brft7fjVFwTpep1ipMfz9B+E+PWDG06LT14b4b2R21i1/ttmxrFKe/HwViw1MNd1CtMen6MzjHuHaPT9zI+dIy4TWp6cIyc4si794Scq5IdD9Hp9M27xsfyL+9f/R7kNO2bUsE16TXH+Yl9EjulGL0+cKU+Tc3cvFLrB+ZCkh6/jpupbYseG8Ue3/wfY9y8+T/HuHXz/12blII3w87XEPW/Ps7rdn0/jb9YvnyK+CYKxhdebNe7UTJeMyulPr5/f81jnC4k9oHao2T2uCfa86rKV5BTKWPyijqOdiirfMWpn3iouR/ldAdv7QOpMl/PD1D7QKo8TZvdb5JjlNuPI9n+6iiffqj55fWWP8/a00TT7a6c/fGZct6Om125HN+poJKsPmd7aJSS/vo46rIbxpULHt6OYvJmFENJvSm/GvZnlPz4SJ93Z6fb11zTsVHq47G585a0hLfl9Hr38DSsutbK24fnQund5e3dKHjNy153LG+fKvtmziTbIUp9PCZ2LAzOdc8o5pa5F/6abU8pQVG5YZ6+DPHal/LXR7m3ZsEryulO8OZHL1M6foHr5oIDKfkx4T5fcUCocOnSQ9OeVlO79/3u48mmaa8YoL+8S/fnhtjTDTmGyHm/y/V6RuSBhPx7lPKBC+rp+0rZd24r1y9tkn8QpVyC5fJKezdKwmt66ZdKrt+jtOv52NU5xr2xq1NB/N2xq5snSpFf7gD/aBH7wInSjjPx+23WIn7clNM3Y9Meiai/Li7zR5TTlMHNAtF0eq3sboFoOi5reLNAVI7TXLcLRL9p212UWZPXd4+Q7FdbXtfm8n6UvTiL/FIT8MMo+HD7L3WD+d1O1PLXUeS4wuHNB245zXXdu2M6b8fNB+7X3zt0Zt0PucXS4QIkp+myz0S5/UKknK7t917Q/i7GrRHO897cfTHzmza5+WKmHF8vu/li5je36G0vptDfTPn6rkmS/9VRbt9fy+mFidv31yIf+Kr8K8oHPiv/zZ2tNCyndZVD68rjO9vzhqhgQ8rhMeoY5ZUS6EMN6XSYHyfb8+6YYSTjl2mtP9r1kG3x9tOvBTW/lRLLaUpKbZ8navTc/xo9/0mUticNtdGSUP9BFHl8h/1NjFt32HKakbp5h31sEbsSFqaml8r+gxYpH2iR8oEW8b+4RfD64StcPbSIPX8K+ybGvRax509h5yzAa26ld5OaCUbuxOXdKLmtNrGi776Pz6sKpXa9GwUvJryewuQ0ZpY/cU0/zUPdv6bnDyzS+YrygVU6v2ldLNyd9XjHdPqw1geu6YaX/bIcby5Olfz3NuQY4v6ZkutHzhT/yJnSPnCmHG906r61dnpf8M8YpxmBu2vcvqLIJ1rl9J2uH/QfPWWnPV6VOWf//gRVnp+0pxBa9r3sa4qBUu2fUZ4PHBw3BG8Yaa3HDWnH3dlBcLfkP2lUxSoJluhF5vSj3THBbYr8cpvye5T6gVvZ85Y0zLtyWeCfW3K6mdU9SmVm70a5P5hymsa6O5hyjnFvMOWbz37dHEw5t8ndwRS/PjKYclo4ez9tJL4b/Q/WMDp94SjtV2iSXvmQ2/wvj3L/muz5E9dkL5+4+pxmoT5z9amGGYpj27bn926nJbPw+b7WDptxWmDK9tOPuX6Z8o+rbr3G5/c3uRotdPL7qlty/LDX3RetpB3fyb7zktQ3uxOfC5i7Q49yf+7OcfGvPYmVuB7k98W/vo2C2tOLz7XysyhYqfGq3t6MQuvhX7w69c+itP0uRH/zLn99iE7PCp9Z5w3z2n2BttN6BN/EKbTQG107fh4Hh+mi6sSfrjt389T7bhU841Vg3t+r1HDAeZr7p3GEWlnoCyx/xNHT5Nin4kgyfEilfL263zdRJNObQf5uFMNHXYyG0n4YRfedu/Bn/P5MWcfvIpa9SkGpdJlO+bfxBD0e7Yo581+uBen3IOV4g7kT1uELua8gp8fvW5/IPce4943cH+xMPe3MqVmb43skzb4Ocpoau/nly++2xPAmcjoEOb1Adu+zk68Ypycz2SvB2K9P3/p7lOPjN1Y7dJVTlPJXR3mN/jqN9sjXX+96xTkVKl62H597DUs+xTluj+7z/8W5HuIcp7f2E43+8nn38vu2nIrQUBZUjFdf/HNLHn8h9Hzu3vtE6LkTve59sDbg1d7ria9LMn3UIX8d5Di9dbMnHr/mdfMLsK8op0kyLsRu6e0o9z4k+xolv56fJ6eWvXmefHfvtMv7+lqe5XDPc3xf69542jcxbk376WnNxdvTfuc2EdxtC13b/2iT7x5oVOiBxt59LDLk2lby1+3SPtAuchy/xRrCcpiY0tMkWV+HH8NpPAX5e1bJj6vCjyGs7iFt+2U9GrMfRMmyFwLI/O2yH0Ypuxo78xug/0GU59UI32xJwgJTUt7dn7orunPll6z+jNL+4v3xsi4dmT+99eeWlPTXbkm5jKrc02lLDkmypD1gU35ZdO5HUW5PF5yj3B2m/2Zbbg7T62mi7PYw/Tkn+B7VNud67D9btz2dtDtmyf4u0rpBKFJPWfIUBW+Wy6/rvP0epcpfHuXuhIEe53TuThjosfTk7oSBHl/6ujthcD5GQivJ/LJYxB+t64+vh6flOW8PrPj1gYEVT88HVk4x7g6s3N6Z08DKsVnvDqx4/sDAynlLbg6seH3+OHf65s/9gZXTLNn9IZHjG18fifKTgZXjx1R+MLBy3p77AyvHN8huDqycphHvD6wcP0t284HZ6/OBlZo+MLByDHJzYMWu63FPtCt9YGDFTgsc3h5Y+SbKzYEVO32U7OZ5cmzZm+fJsZr6ZgXZcVRTsToEr939w9J/3ZNs+usDqv7eJI9vac8bUi9aifx6d3caojS3N6NYalgHoRzeqrD0iWexY5Tbz2LnKHefxb7ZlpvPYpY+8Sx2fHtmLLE/gtgvrwzrT6Lg/ZmUf1mI+fcjfXxz7CNRbj8C2enNsduPQHaaZLj9CGTHDzzdr2M+Hun9im3/RMqpdcvTjGupfeIAHaOgjODVPKeT5Ril7K4o5Zfv9fwoSs4ZUQ4vodlpacXX048ju/jXY/PHKL+8M8+r8f/RuqelBG8XrJvaJ07/03e8bp/+3xzpgiP9yzK9fxyjejxGlKNqsa+PUf3IkT7tURU60nrYo9Mc2evpew+KX1SB+Ee9iNkHnnrN5Pm99ml66/ZTrx2/THb3edWOnya7/7xqVj7yvPrN9tx+XrXT58luPq9+2wUydQH9sgvk6/GE2/nUvTkiZ8fVEW+OyNnxbbJ7I3LHGDdH5O7vzGFE7puMcG9EznJ9PiJ3PO3vd+bTNNntARYrzysS7PzS7a0H5+PRuTvAcg5yd4Dl9BWvu0n//M7T3QGWUj4xwHKOcneApfjz86TY4/Pkm2UV97zJC/lNo58t8bivg68ohyUr7TxDtk+VfuvzbhR8uvGXTwH8LIqm/VUm5drsn0ap+30/foD/YRTDHT8/T/00Cj5hZzm9eaTtwpAPL0TzH2zL41dzUn2+Tn09foV4L2j4ehpKX91cnGM4vvDpVt+MsYdoitevb3K+eRNz37OJXO+eI3IhynVYZNX8eQHNNzFuVbGZP1/O45sW2e8qqeT32zXTt9rfzkm8LQ+iOI6xv52TdL+K+cL6dpT9XsWjKGXnan0/y6ph7SU7XH2OK5f7vlFx7j+/rVz+TYz9ShovmvR2jHKKcfxkBdYTLdweP/vsxa13oY+fuLrbpscYN9v0ZoxTm37zkbm9mGhL9u6H6jK+8psPn+67Hh+Xb76iWVHkePxG6TkKSguPnxf65iua+4b6he9/0RNlm66nr4sev92a8AXYVOUjUcq7UWR3niwpv70tjRY8ev+btoqVcI7fPz5HMUTJb3+lV/a8wCvg8Rgdq84Ubxca3y/99iyY5fliX9/EuHW/lOUDi30dWwQjkKK/3KP80SKnNWcranxpzqb+ZEMMn+2zZqcNuf0Z5q8/Tp2P70Td/jj1aX8yxmKypK/355so+z2V16RLeTvKXo/gdXd0attT9cDNx69zjHuPX9/EuPP41U6reydrNNh9fT3YnfXxWzffbshFG3JokWPlgexxi9RUDt9ey8fvjKlgFFL19J2xfJwIU5wqop7k7TiFtsfT4eKRT+OiDV8RaakcljXIp2FebEulQZ3XUNrPtgS3gvW4Jaeb9EsxCs8vr/1oS3wdotcIbTptySHfOtZE9EZfQvgPopyqa41KpJCdSvvZuety99w9xlHcI6jmU5zTTNjdRfvzKXHfXbQ/n2aP7i7an/NxNZqbi/Z/l+6w1oS1L5P34xnGU1FTSXtHCp0mv6/qcAxhu+aA31v7SQhHPQeXBf4ghKBQQC5p74VA5c9Fz3I/2REsx5g8vdecLvvq5frWjoyV4UcIHk79SQjdI9S9TvatEIalfIwmNn8UAi8mm7XHW/FuiL3G3ytz65chUj69EMbL7v7yASK/ux2vgcI99smrSb7m9O6H2K/v9lLc5yHqWyEqhl8rJfIfhajYCioB/kkIx6QDr536bgh574h4xef/6nvN6VRB0N5ri3btrwTxKtc/CoElRlt+79Ty3d1/+RTiD0Jw3aXQUvm/h0j5uDyi4JImvxSq3N+OnTNe+NYpLrpPrheW90IonjwsvxkCN5JWHofI724FDcxc74XAV6O1pcdb0d47P3Vf3f8M8Z9fP//+H/7p3/7LP//rP/z9v//Tv/7L/3r9y//bg/3bP/39f/3nf5w///v//pd/oP/33////3P9P//13/7pn//5n/7Hf/mf//av//CP/+1//9s/9kj9//vbNf/n/9Eq6e+0avvPf/e39Pr9mjN49Zi+BmB+/Rd9/Rerr8vYa/wp/kaKf/K6yXz9u+s//9++jf8v"
427
+ "bytecode": "H4sIAAAAAAAA/+19a4BdVXXw5D7mvt/3ztw79847JIBPECn4QJLwVAiBhCo+moxkSFJCEjITIKjoxCSESJJ5JEDANw+pivZTtFr9aj9rPz+VW2trRam0Wmyttioq2lpf3wTm7rvO2Xutvfe5+8ycw9z8Oplz99rrrPdee+21g9NTd35wbPe2q9ePjY+Mj3ZMTXxo5c4tW7du2bRqZOvWo7P/f2Dtlm2bto7OTE5Nf2Ggg/63pEP6k47JmclJOaCpjsnJ2RkBat8+acnE/au2bxsbn5l44LwtO0evHg9MfODibeOjm0Z33nvli06XA7WPX6I1/m3vtY/v0Jv/vRP3nSDqVJLBefCK0a0j41tuGA06/RIGIaQHoWPiwydw2TgyPrJq+47d7JMeeQ9ECkC/99LtN0w3/xAAA575qi08TgFd+rRKl46J+9aOb98xZUEUALPxb9X9F2wZ3bpxFuzjV79w+63HRn/14Osun7zp9s31Sz64tvM///7F/3P/5ie+9NnP/sw+8Dw2cDL7vRc8ftoPf/XJr5xx9j9Nr/3c+n9d9cpSx2s+9acXHr/vfTf+jX3g+WzgIxuHn/jm0Vdc+g+Himtufs43PrfnH6Or8p+866nLnnjpgxtvnrAPvIANzH704m1Xv/SjZ7/w6NFbll/xxTu//Ln//vyuN0ztmP6re97z8Orf2gdeCCh45hkSCi65jpPxi9jET409+sBXDn38Cw+Of+D+O3KPpY4nnht/6759P6n+uHb3k/vutQ+8mE38/ivPknKO480rtYZ32oe/iqF9zp8FX7v5f/3P9sSFb//ojY99a/WuVG3k8/0H7n/tX0/1/2D9fvvAS9jAf7/9nrdmPjr93oHn1H/ReeGR/1z/84vDZz1Wf3Plr/b85gdPztgHXsoG/t1rf/P4w5mZm2869Ok3nXVyYeTDM4/+9Idf/MpHMj//7kPXP/pi+8DVejIetY+/TG983D5+TYtW9HKt8Uum7eOv0Js/ax+/VkfCZ//Zx6/TG899/5V64wP28X+opaE8/q9mgjdx34OPrzhUf+ETv4kfvHRk700vesffv/pHN5c/cNK//vFDtQ/n7ANfwwb+y/iqqfHu6878UfSrh057X7X3n5/6wMPf/+Xu0bP+8/v//snBn9sHXqXHsXPt41/bmLh8+vKzd9z1t8Vvnzz0j+f+5Yeff7Ty1NKXfftTF73vyf/50n8LWPW6xsAlkintA1+vgXHidZdcYh//BkYqjh30xH+EDOQA2Aeu16MxZz836HpO2/gRvfGcVL9R8uGNf2H7wKvBwCVvHxq7M3ZoyaWf3/O8h5Pxz/9gxXtWrqp/Ze/B/syH32MfuLEx8NSXxZ68/+At+zq+84H/OPzLUz977vNyfStyz//6Pd+obtv5usqT9oGjep9as4+/Rm98yD5+E3B1p+lzarMipbmBW7Tm5ezeHyvOyw28Vo9enIRs1RvPxQbX6Y2P2Mdv0xufsI/frjc+ZR+/Q2982j7+er3xGfv4nXrjC/bxY1qh3YB9+LjW8OfZh+/SGv5C+/AbtIafZh9+o9bw0+3Db9IavsI+fLfW8FX24TdrDT/PPvxNenLDjX+z1vRr7MPfojV8rX34LXrYc+PfqjX9OvvwR96mNf513PgJrfFv4Mbv0Ro/wo1/u9b4N3Lj92qNv5obv09r/EZu/H6t8aPc+Fu1xl/DjT+gNX4TN/42rfGbufEHtcZv4ca/Q2v8tdz427XGb+XGH9Iafx03/rDW+G3c+CNa47dz4ye1xu/gxk9pjd/JjZ/WGj/GjZ/RGj/OjT+qNX4XN/6Y1vgbuPF3aI2/kRt/p9b4m7jxd2mN382NP641/mZu/N1a49/Ejb9Ha/xbuPHvlCw3Ao0HbuS7FHOBt3Ij362YDDz6wBWj47t2bpv40AXbd45u2bTtREb82GdGbh4fvXr9rvGt6zeNjl85vmXrlvHdszOMj940/u2O7omHLh29bvvO3Ss2btw5OjYGk+3YmzD6phN9E0HfRNE3MfRNHH2TQN8k0Tcp9E0afZNB32TRNzn0TR59U0DfFNE3JfRNF/oGl4My+qaCvuk5IVizW3bX7dg6+ozw+u1/ljBb+pMzz9CCed+Vp51+Fv1XOaaTk/bdsFBzR5HbwgrrrRueO7sBu2XbyM7ds4Mu23GMAb53ltXPUKQxE7QKF2/b+MyOVmu7gktskzenYNPz3xywU6MTonb/7IbczlHL2+aKBpmtk5+tszkbAXGPcYjHjUOcMQ5xv3GIe01DHDeO4mHjEKeMQ5wwDXHMNMA3+0AYzfPlVuMQj/jgqw8Zh3jQB1p9wPM6OLuy9r6P2bMY/aAfWH2XD3TQeDgxm8z0vr094gPOmLfgxxel6TnoC+mxrdPCzbWk6pqTzYOuOMOGVpyCzww3p1cfFJIOitAzwYzeQ82M3tbtmyYnj9rzMHPDXjnxJxeNjuxYsXPnyG7Ii+cgv98g/n2k4yiXq5hNnk7c/8wPp0QvnyPOo9iHPJPJ6LB+3l9YEpZrRmdZvG3TupFNm0Y3XrJ909jk5DSC/0VoPiowTeZVcInk8iidugVJ2nmUzgWXasiMhy3MWDWyY2zX1tFpImksFrkl0wIpOQ2RhyVH8cSiKuvn/r4GF4mjraYBHRB3zcR9l2wf2SjOUnWeKGG38btJ2LlJH3pm0qf/c9mOo+AH9166a6twKA+3EzLM8oUEBp1zGNh/EsTkU3A6QLGK+76W85frWtbc3MR9r9x13Y6pR/4JtdgPXjIrUes2j2yDmrwBUuaBEyAuvgYa03r8ngbk79oNT4QwPFHXDU8UNzwRQ4YnyutGxFXDE3Xb8FzgHcNDEZc3PFH4aNfpiHPDE6HgRpUNDwQjNzwRZcNDn1v5XUM1nzSt9Fc3IP/crvRRQuljrit9DFf6qCGlj/FyGTWj9BGx0sfcVvrzvKP0FHF5pY/BR0I5IzKlj1iVPkrBjaF6SmAQkyt9VKL0EcXjcV+dU836EnRxFnWi9dF6PMNAh+1qHyPUPu662sdxtY8ZUvs4L5kxM2ofFat93G21P987ak8Rl1f7OHwk1DMqU/uoVe1jFNw4qqkEBnG52sckah9VPNy6h+lmETWuTtQ+Vo99hIHutqt9nFD7hOtqn8DVPm5I7RO8ZMbNqH1MrPYJt9V+lXfUniIur/YJ+EioZ0ym9jGr2scpuAlUUwkMEojaxzD5FCiP4il6Lv4ONvW6obXLMfonrQZBbJ54k5Csx17HgJ9qVYJvLbVowaWz8Ec2jc7VZ46t3L3upotGxjYLkryOo9TzW5RblRRqkjBzKdfNXAo3c0lDZi7Fa2LS1UVNahFFNxRxeTOXgo92C5J0vqhJUnBTyosaCEaKwQPnX79rZOuYcHRcmFlY8tKWNaxj4r51O0dO9CsRqZKRYvKIg1LudsH2/BVsV9E3NfRNL/qmD33Tj74ZQN8MtovJF6CY3BLSNGKXcwynRaNlBnpFOy/q+7yohzZD2nlRBmxOwS4zrLuRv2Wgr2hvZPp+I/NV7Y3M+drI1Di2taDKEnJPWfBjWzAdzdcRWmyme0ZnqQ+NjiYdG/WYb9PwoDGiwjMmr5R1DPG4cYgzxiHuNw5xr2mI48ZRPGwc4pRxiBOmIY4ZR/Fu4xDv8f5HT/pABc3L9z7jEA/64KsPLEZx3OMD4zjjA3E0T8fbvS+O5nXwyKIMoqYdruCV0Qghy/4WD+lEh9H1OJLb0z+kM6xzSGdJO8fTzvG0czxOi9VDmHxSdavEvy91/uNfUrVvdBP2vEIRzBcUq+IADGgUBXVxkY0M+Bet+vNJi/6cOOW3cve6kU1Oql5ejfz9NfNQ9dI2ib4zia9pm8QFSnu393dNK0tsEcUP7uzv6iqL6v5uSHt/F8eAKxGzaCzvd0P1Jd9rWcOoErFY2w223WDbDTpdGTg6xkpflfSUYFGh1ff4AhaoP2X4SNySXzPQ/yW4aE9l6dMBbx8T0Ib+F7eV37+wqaA3jGzdsnFkfHTFto1PJ5TO33b9rtFdoxtXbx8fHZv94/k3jG4bH5ucvENbvS5B/n4pCilImAhUJe9wo4iRNZUWy0Hm3rW73mhfCDJ1RQZlP9IQnmecGRShNbQIZetLfj9312M9+TW768kRrifvuuvJ464nZ8j15HnrmDPjerJi15NfRK6HIi7vevLw0W7Vc4CwMteTtbqeHAU3DxlGuh4IBnE9WUw+MQLlkNRPBsLkdTZXD2SYzn6dQiMjo1XuBIugMQRQbLagQNiCop46XqlvC4q4LSgYsgVFXlwLZmxBXmwLiut0bME6DVsA5BB7E3bRHvAim68Hzm5EKoGKzileTTeTNepm4u65GXCK9/4WJTqDTVsQSTT4bhsbihZLOcespfx2YLGB+mYNVSpKdwNLiDUsWvSRE61SPTBk/5KUOYFaYVSgUu4JVMqcQJ3rpkCd5gOBegGaXd2ENh7h3iSaqzjsOO9m+5s0t3EUHMA+r0r4Kz68qsJHNB6ocemwahNXnlS1euAXjLHn2D+mj9DCAdfN+gCuhX2GtHCA50AfoYWDhsz6ID/tIPxuGxuG4LsGsy7mtXBIqoVD/MRDUi0cRrRwCGLPi9ZwPXChBt2BGerkZH/AQgFbuDyECSX3S0DkIWQJMIBx286UKmocavCjbO96m/pte9PPGY7AlagVRzjCcLpewI9CPcBOKAVeg4FextIXDBSgDTJouSh9AYYRWC2vB14P0hfq8rJMmlShsVpmQVCE1waG16M4tTi8elumV6/lI0WYbZRj1ouIyDK4gOCB99YDmxjwxzTYUZOakV5+0ADEy67zvfBR3ZDK5WJAVS5EVm2gHtgGqG9T4qXmHOYKow5zqXsOcynhMJcZCluXifiMO8zlIoe5m3eYy6UOczk/8XKppJ+M6N5yWrFPrgdu1KD7YAOPq1CqkYI+SBvAZfXAWxUMIPKpA7SZmQW+R25mljsxM8tEHIPiYDMzyyw2yBYNLMdEmYobliOhxTI0TsESdRv4oANQAo8S++zvhmGcYXt3Eh94oMXWNYTdhaYsCtcYH2Kgp/CVqS3wuApSDltBSUw5gVW1HjgmDzzoJRpGJRKrgiVeE1HruFzvCuQKouoMs0HLR4owe5ccsyoqIqRFmGXHe+UWoeKEHVVVdlTEeN2H+/t8Y/ItROaE08YSoY1dMOqxveuGTtf2rgwVupF5KOl6qILUQ/0vYrUzaH83QCC8XIBw4Mu6CA/SUjWL8MNyqTqFl6qq3Mnzg06BeNn9zMnwEVNPwsuj4n2Kqk7XBAQ6pR74jFynT0GofxJlYGdB/wUD/fgc++d+H4SCYbveOaQbJzfm+A4vfnMgwxqcH5By/lSS8yfxYeapCqwXxDonSVl/Msn6k6CyCXXjS4D1chUkbS8XwoBPtr0bJIKYpZARXKACvkcaqgyjORLIalHW6hvEx/QSH9NHRGT9DOGf6CLcS5u4WYS/JTdxS52E0sOixR7Ay27ihuGjeuDSK5Xzpar5ElHYsrQe+I7cxC1FqN9PJa9mQT+hYOL6WjRxWdzEDUpN3FLCp6CcP4nkfD9v4k5SYL0g+dwvZf0wyfp+qGxC3fixwMT9REPgq6iJq8JP5tK8QCS5TRU8YLJ8TzMNzMWWeJap4Pq2TAHPMhUNZZkK5GYh981VQ9syVRH7cUZa8vyNkLuD142aNMtUc5RPRSxWzSK8ogzv7/iFhTGBWmFUoLrdE6hucwJ1rpsClfK+QAUT6Lp4E7/2xXJbXeieehkdU4GxkXTVW3hA5EMqdHxVqAfLzIfglxVtIfpN5flyKWDXuKIDQCuu7ABQi6uYAaLNFSUAWjbLEkT16MHhlgtuOoizMXlUUlo3PQGjpifvnunJmylKRK59KSyiAmWKuHwFTcFiX/FCYt1rX/IU3AJkGLmFAMEgWwhRTD7RMjN5gXJUWO0ZfBEzer/Ea9i4ow5RaUBfUDvqEBWb4j+Qp+zFVj5jkRAR6Fcyy/gSDXHLSD+4SK5gMlBSeLyK9eA5cAVjk4ciLzKo0BbQSvEiXrQnYDBAHSvbU/3iqLB4L3ienMlRHrOilBMlNdErirG6CGIFzfYnmmb76u07ds/Z7cnJYw7KvQsOCsGjuN09ZrY3e0NBXkkaJudHFqJWwv5Zk7AbR7eOjo8y0s4YraQPzDhvcbHID1jhmdI8v26xuEJUsZ2c5xpj4ZKTFimvwQ4ZOw1osI5RbUly56hedIGO6nmo/4M7R/V0I2HVo3rRlo/qRTH5bOGoXlR4VC94DTiqRxDihFObI/gj72q+yLqo5+n2kdynJ0zp6HnKyTG8KKLp213UdE46KnoMqqIl6x3EfkWW2K/IieWtwy5vHRDnhvL8yro/Bn7TwSeFAGZ4iNFHFN30E0U3A0TRzSBRdDNEFN0Mi1fRt/BczJrLpmU5ww6ODsfRZgO8fmZBMtwetcUV50sZmi9FyGKWsJ0512OkHG47s4ZsZ46kFa4mOZ6OeSj7ovaDoQpb0B2i+shkNWL1KMHYLPyZe83PHOxALXjzM3x/ICZSyEaYgd5VEaePK+MQ9xiHeNw4xBnjEPcbh7jXNMRx4ygeNg5xyjjECdMQx4wBZI8R4199xDjEoz6Qnn3e5bV7H33E+x+91wfyfcg4xEnjEG/3gdsy71oP+kB6DntfCW/3ARkPGIc47X3G3OoDxkx5n4zmze0e75PRF+Z2j/dt2aIM9PywDDbPmDt8oDHmGXOb9xkz4wPDc8D7ZLzbOESdmy/hdQzKaID8tMkLv2Ln6l34FXdw4de5ehd+zWXLwz/gsuVdkBwI6bp40nURHMzCn2Gl8kta3iR8uX62vIJny7sMZcsrJK3wg1gVno5s0xPPlguPaeCcqcpNlGOIx41DnDEOcb9xiHtNQxw3juJh4xCnjEOcMA1xzDTA3ca/+YhxiIeMQ5w0DvF2Hyi1ecNz0AfSc9jzOuiC8Jgn4wHvk/FWH5DxqA/84L42qz0ZToz5wA/u8T4ZfeEH93jfyYz5wJQd8YHw7Pc+Y+7wgcaYZ8xt3mfMjA8Mjw8ix7uNQ7zHWSJNHQ2XkryVl+kleasOkrwv00vyCiul3zPPZfygeUhcI38fI4TFUlOMgZTdYZkQk+f+xiGP9OUa2MabzKbvJ/bOGQdX5ru/xSy6s3M+cfSylzXiLQHqlE8XE4B16qd8shAvdNOEO+efwPBsWhW1c/4iYa7UQ5+Wdx9ICPVkB6QHhtpcc4oTx9P4L9okxugvWu5QRVmfKifwoAVRN0oCXuAThMB3w59ptABK6H1nTH83K+F+CyABrUALILylVYKnY6UxbrOGx68QjGkDXGQA51vZtUzo6uYPykZN6OPMQe1Dz2NvaGzwh/5ZEWsAA+DNI5CoR9Yw4P/CsaACfaIZhmfhz9RBlhVcGN1Ov2zBT9BOP/QD7TsEeOFAv6kmEo4qJRy1euhHuHDgVwBaWx3M8fZJDC+sD1cCElx0gjjyYgb855Tupgzpbgr+jJgvZ2i+nMXdteiBnUXCKeLEe5ro0NtDXHcQI/qEOzhFn2cSekA9vk7Ar8Vj7z6OzWkF+53m2Zwm2JyAP8NAChu3ZZsayOtHut75alaWxctrWeFDyiIrqPQhZa4pCZgvK27yUyVi3ZqesAf1Y90aHutWDcW6NTKFhSthjSd1r0IwILhUrpfgHgBZQjvTClhT1qPOOfqsKeOsKRlijUDSSyhrahA1jo6smTBeVEe3ICYg7jEO8bhxiDPGIe43DnGvaYjjxlE8bBzilHGIE6YhjpkGeLPxbz5oHOK098Ub3711DPGYD8zElA9w3Od5HcT39JxC3GUcxXu8T8XDPlBqP/j+ae+z+lYfsHrK+2Sc9EH8PeUDHTzoAzre3jbgi8SAm2fMHT7QGPOMuc37jJnxgeE5sAjj7xvmL/6mE3OOEq0mi/TKL0d+PyL+fS2gX6T3cp0ivQCX6C81H9FEf4mkMpXoL2mAJJqulxQglgmII9T+RlmjmJNBXM9BrMJHdcljEK/hINbgo3oWn0G8loPYCx8RiH0ExK0cxD74iEDsJyBex0Hsh48IxAEC4moO4gB8tG88gd3FinjjiW3ObSC7COONsVmz4PDH0IICZJMb7CdmheUZ4f9gwD/B98KdQ7z16jAHLZ+J6rC4e9VhccSQa7bLj4ntc2IRXYuR0Co7TsBHu47BAmrZtRgx67UYcQpuAjKMvBYDgkGuxYhh8okRKC6/FiMm0Nl4PfzX8gvi4nz1bqxJfYxlatW7MWGdVfhLCtW7sgvi4mLQ32ZG6hENcZNfEJdUvS5NVLCcrIf/lrggLsmLDCq0TyPPotV3QSAY5iL+AsyRYSnVDxbxOFUPf0PO4xiPWVLKiJSa5CXFWD02H/fDJRzcAheb7/vhTmgKfl1PXG48ETl09Xq4mCvXw8WI6CXuevQSx6OXmKHoJU6eQsIr0uLkikvneriYPFhq7Xq4Vy3M9XDNbmM2KgahrZz71ZKnqKribkNVxd2W5QA+X87QfDnF+eKG5osrzpcyNF9Kcb6EofkS8Gfai7g5uFeJl3C/Ze7vMRzb2agYgboeGzRM1hMjg4b4QcMUrYfgozoiFWlIcZIT7Jfyg06CH2LHfil8dID9iFHsK5rYV+CjzdSdRLjPZa67z2W4+zzJkPtcJiKWkcX/sNhrLXN78X+Jdxb/FHH5xf8y+GiPX6EEy+LXYevi/yQK7jLIMHLxD8Egi/9hTD5xXJdZYu13QwB2+pyk4N9PIsWZ8u/zP5+GqVmup+15fVOz3H1Ts5yklY0aJ0PUODqeDM0AMt3J/HQnE6wBIAvmQcbMgyyaBzlkHmTJPMiyeZBV8yBr5kH2mgfZZx5kv3mQA+ZBDpoHudQ8yIp5kEmtsNmtzAaIP8R9eXJmcxs5tYCtIlq2yZZYQ2Q22bLs4xeuQ/XOVxLpc7AuRPZVK0TYMOz6CmUYDxsqhsKGYTLFYKPGUogapwZLFVzdEDmdOwm+S8RKMORygk9dCdJNJeC29QGZmhv0nCgGYLGNVBiW8ylHXMpDeoJ2tb6Uh3ApDxqS8hBP9CAq5WGIGifl4ca4m7DJwvxkYcJ7hKVVc04B4tXjjiHuMQ5xyjjEGeMQD/qAjrd7XxwPG4d4xAfCs98YRGDuTSM57X3p2esD6TnkAxN+u4cl3E8m/Ij37eOYD4THPBkPeJ+M+3wg3/vaAYUnTZl5Mk75wCMYD1Dwy1M8ZBx9IDwHF6Mb3OMDU3ZX234/2xeEPlq9vd0HZPSBKfNDcHurD7T6qA9Y7f0AfNz7wmjefN/mA7vjA4cw7QPG+MHu3L4I7Y4LxtZ8NHHMBzhOeZ/V5rXa/OJt0gcQ98+fEgZAl/65H29qPGwRVOkETrTBb7XwYCO/jT83paCooVMXtnZRQ6cdnU6IGVrwABE78wwcsdO3vPrsTz/2uTsxFnTyTO1sMhUZFCGrJDgiRvWI+EZra3twzC1ifRPiqTj3JgwnnyvrytR5zCK6mOlQEczCKQej8WZnjGlc4wREBegDAjLPg1TpjK980UdeeNFH5GxYWIf3mUGvPNG8DTELf4aBRK/hmIO7Q/wpr5AfbhN0xclKFUrwiTWIlaP2PMg3siunVgtvQYmcD74RU8QcUyWmipr3czXm+A7fcJ7pMPJhvSJiySgsaATUC2nCiVGfAokFCgVupcMPPeeJS2Rq4BIZb97RBLAmJClRj/yhylFQDttuKS8TotpQgBXZzgUT6bx7Il2RinRV9EUyMgg7v0EVtfO6psJrHmgOFekcT1hAT/ApzQu12l2d2l2d2l2dTqC8kF2dghCmqKtTZJyZs69TaARltHq6LwhbCb4LAsGuWBOYgqSeNqb1TUESNwUJQ6YgSXpmF0xBMqVjClJOzg3FEWOw3UVjsDC3w8WI2+ESYnnrsMub6Ca35K/Ub3KLQ8xs75IQM9s70F+knzg5MmB/B1pwDRI3xw0RccGw2Lwc4rmo2Ymog7jKOOZi+6Wwvm3xbfuliKFFhsqtf9ogZQkUpwAfeaeLQWrYL0FqTLr8SJKR7YMrt45cfe3K7TdNPLxm+9jolo3bt52+ZnTndbvGZ3+5fds0pHwImjE0exXTCvZi8xNpBBZZpBFHIg23Fx2v9s6iI0kmfexymISPxOIgLg+kLYuOBAU3ia4TCAySyKIjjsknjuvTJGr+NwohaOhiyvWLUFPu62KK1EU8GEvxLioN9QSZTvM+3jQ0k+qGV8GatNqRICm2NLGA2cPYATWlp50P5lbJjZO4xdmK8qd/SXQkEOQrNGLeBU2txeYlasGXRwleDSwG01GI7U5HgleLlSC+MB0JYsS2L6oEcVIJ5ImovwFKgDdAjbEGqF/AN625VtBy7KNqraCDAtyj9cjXQSvodkNgFXVRiUGjmFK4HINe4J0YlCIuH4PG4SORzI3KYtCoNQaNUXDjkGFkDBrjo2CibXhMKfEdQxLfEQiT19lYPfI9IvEN0IiodS9n/w1BKO7lF9Ytsk0wxBYk1urYgrVO4tMYYg1umc/Md24+Mt9RIvMd189851hB1jfVM98xiBmezuwjwr5+Iis+QCzEBoms+BCRFR8W25fftlwfR2W+o5zxtyy+sSiH18+oWjo32vLXOJPJHl4mWQGp7U0/RNz2bgBKiu3dIJQU27shKCm2d8NQUvC+aAF9zWGljNnPEJrjNYZcQDAkQDAk0gKBhtapmxZLfWljFXGZ0VVEzPkqIlaP1vBVRNyrmey4e5lsd8tnXM9kn+/pTHbcYSbbTPkMmclWL59Jul0+E4EwRVmL6HPVymci8qw/lkmP8eEMbgvSeup4vr4tSOO2IGXIFghS2ykztgDJNafP07EF55msn3nTfK4iCvMRICSJVURK39UXmKt/h5n6mTSxisgQq4gssYrIEauIPIwmhTbkvJZ9OrVSSPJLJWM7cQGjO3FJ93bikq7uiqfcjiVWeSeWoIjLxxIp+EjtXmvuiicpuCnU/RMYpOS74kmlWCIpjyXiwns9o+tALKEaKCSIQMGgohcXmaIji4ZUQUfRCyYDhZ3zGSiUF7rQNqkfKJQb2jO8TD1QSBGBQoEIFIpEoFAiAoUuIlDopgOFVD16rcvFtPR28JlnQFznxl+ImkEuFWId/yC1sJo1htvBdrCCpYXAwbqrIga+s5H/iT7Qjo5cN5rt6KjF6Eg306IaHcVajo5iLkRHiEHYI79+Punk+vmU8+vnZ03yfvnV5Cnh9fMRi4SIQB9nRuo2DXGLSD+4RBbqRKCk8HiV6tFDRLVaiRcZVGhTaCSLXmJWIu+fR08xdKl+sYjJXfXojKP750tSTnSpiV5JjNWd83H/fEo9UAVUnOf750+oCmGYNHOvliWVixfQx125gH6R7xTh8X2S399OqQe/mhtTrVWDrkJKoufnAvrZmJg4ZJPVIFSMqC3I0lY3XY8+xBD6kNJW7jliMH/achxPLZpSfHoZ17+S6/pXwvUvbUj/SuTBg1bWDymx2JcWUb0nRVx+/VCCj3YPmNYKxSzrhzQFt4TpEYVBCVk/pDD5xHEtofWWaR1fqKkO64zulJryhWnSOXHf3KU37Vo0buWn7SLY0A3fNWz6l0QtiuZQR4/6djvpIlRGlpzdEHvedZTr0S9yGgdEumDoZFbBQp15ng87rLABTYttYBz8OooQQnAG/XpUsJCRyWbRrcjHxy5gSH2TMzGAzcWGfRYtp/5RoR1avMXeUevw3lHFBsiwhtYV5cJPqqogJi5DyqmfSkg6W+yC8dCCifjzb3oJYaFNvEWcWvqBAuuL7rE+LWV9ko65lOXFQmWO9UAwMhjQgpPzkUnV85EFMX+eIhpLxhWWJnHaTRJLk/i8z4db5IaJ+41uFRuDcZWu4hQoxYnXY6c1kIp1UBmYHGp3k/VYUEH50u4pX9yJ8sWlypchla/AC0EGUk59iV1oUfkKFjER8Sft3O7GaLsbyy2sy01KWZ+m98qUWW85fU+xPu/sICCGPsn6GO1yZ8Oqmpz1sQfEJp1gfKwe62d79Z/QkHWFbcpWmxGUkMzbWrOZt7WOz2GnpEynz2GnaH2fteknudaMYEHTzzH30s+x1tPPnmpGcMHCNCNQy/GqG115N24BcS1umDxfLfRoZy5sMCP3aBknHq1I0kkQzBSdSbY8mMmoBjMi/mTqsRVyj5YhPS1n7gBF8ELzJFFbFpcH9t0EqQIasUs3Jdxp+ChagcdetbDhWpdUuLtFyQ4HGZJu0myXIaEcBI6ocHerZkhE/Omux/5QLtzdDoW7mzhh0cVbIYBpM1vo3jEmB5HCs/IY0yIqtEuToTFp24g9KGmpSNK6UZai4KaxyJfcBUM2ypKYfKKlYfKO4OK6s9i1xJFGgEZQvqmIldUkdTbNM66fVMi4v2mecW3THLEFGfdPKqS8cFKhuNBHGtP6JxWKpk8qZCBm+LHFfuLY4gBxbHGQiF7FJxVib5/fI43tWMJ3scR57VjCe7EEimva6sstReIauphxXRcz7utihtRF3PxmyJ2/vLPp3EqEp5GwYmEakqacLKfTqsvplHj3491EIlxwNKbtkgg1yEDUqA2wpEbe3T01YD4KaR20IEqQdNKVN6XalRdZDH5YqStvkiXol2sckHHYU5gNgoBEO1kfw/tptW+G8N3NEN7up7VIb4bA+sCiBSEApqgVfuzzRPJJp/dYAu2nFXfxxLeDflrPyn447vfTSiyaflpxs20yHPXTopJPHuunNRuzPNZyp30q+eSm/Wj303pmwkUUS7T7aTnsGCGJJZL12A8ddYyIO1tT8auSuNg6/dhpx4iYbLEWX8LKsX+qIW4G60iRTMoviEyK3jFFLKgjCjEEDAaoO6ozkoheph77tZzJcR6ztLP6J1700mKsfr+wHSMSTlohuNMx4oSqyPsKO1pduNgxIuFKx4hFnguZj5Jd967RYwGNx0p2m/d0FTE6Ree9w3684KzD/oLeouf9u3mQvm+JRbSFnNDqsJ+Aj+502E9QeT71DvsJtzvsWxrdi7L48WG1DvtR+YoH28Ju3xu9xdjuwLzftoHHkPNgDYRO5vktOxAq/ZRoC6t/hdV7jsudrSxdx6W6lRVreSsrhsmn7laWxHEl6vFz5OmnhJOGpUnnDUuT9fhKeWYiKUw/We6XE4K+kq2uz9cQt2iLNQxRKCnCtNjFRPpJr2APL4JD021Uw9Kos4SbRPTS9fhljhqWys8Wp9VET5wGjK+dj/RT0g8NS0+oCmGYWglln1UNSxfBwvteh9fXe6ph6XkL07AUTz9FWfoJPfc5/9fExze1r4kXhjrta+JbjOLb18Rvcuma+PiN7Wvi59kjtq+Jd1yQ1r4mfovPromPT7p8TXz7lvCWbwl/5EmN5X3Q1CI6KF5EvwePITOE38i6HkNmcb+RMeQ3sqI+REb8BnLcLet2DHmRd2JIirh8DJmFj/a4CJ72ksVFaWsMmaHgZiHDyBgSgkFiyDQmn2jtFRJDWg7uiuqu4h8lYkid+reMeuv7LGELNKOEK/VtQQ63BVlDtiBHN3wzbwty63RswTonMWQGfROe103MWTfzTZaq/LRdtKLmTrbmjJ5sjRoSrTSxSRFo2bVmNQxwltDwHHzXYNYX+JxhroH6Zg1VygFVEg/KI9YwZ9FHTrTy9fjndXawNQVqhVGBSrgnUAlzAnWumwL1NR8I1FftX8LuQNykfsFFvPlV0qsvEufxh5JwES66bhOLuAjnDYmwoAVonhDhkiGbKLgPqQS/G79euchE+AnRTQcyERZecSMT4W5EhLsg9qLWjfHvatAd6HAnF5cXLRSwxZpdmFBSlzx1IfFzEeM22txtA29xsDcFTufiP0ZlBKE6m/cK4T2myQ8z0D/Fe4M21vcMFPh+ZFCF3LwvUlhV6vFfyLfuBTJRlmYdaKzKFgRFeP1K3ly0LDL7rdIrZ/lIEWa/lWOWQ0SkDCNsHniunugAPW91VFRmKnKiy3wAXna9zsFHdWMpl4uiqlyILFexnojgDUK6zDnFFUadYpd7TrGLcIplQ3FdWcRn3ClWBE4xkeedYkXqFCv8xBWppFcR3avQil2tJ7IadGeXLaN33JRJQS/RBrBcT5QVDCDyqUXazMwCr8rNTMWJmSmLOAbFwWZmyhYbZPP4FUyUqdiggoQPZTQWUQ4fuvnAfCkqMrIg4SqheUveykAvlx8xZaDAV2JrM4nZJbDK1hPPkQcJWaLjrENnkLZInsgZvECuI2kyos86w6xk+UgRZi+SY5ZFRYTU3ll2nCnX3gVhx0sU2CGs9c3Sn5yuJ17OQP8cXX1v4TOH7DFP7OgW+LU5CH7w3V6qEX03WLvzHxSpJy5sOfdE7cPyN3taKk/QEjVOaCIgvrA7cFiOgoJEWgswSyokzpOMepdSO0FRrUyU0odkFbWV4Q+/SaSrrAg5fbkGtlHFnTBsgSuIgPOu78jm8Qg4ZygCzpOZPrxtdJ68lzars5ulScflRumYdY+OWcd0nBv3yNuw2QrkfTIExD3GIR43DnHGOMT9xiHuNQ1x3DiKh41DnDIOccI0xDHTAN/sAyoe8b54u6CC0z6AeNAHWn3A8zr4yO0+UBkfkPEOH8i3eed/m/cZM+ODOM8H8n23aYi7jKN4j7P1gzoasEwDltA91Cyh27p9k+CI4NywV4pr5/LL0DpX4e8LS44Kau3O4mrt4Mtl4lo37CThfKcx5ns+jRvWWixgU1hBZ92/YY1KsAZaroHNaJU64WzIW0RiLqf2f3hW5qV7cXmyIAfTeCTFnbdYAC5tVqgnPodmeZubL3+tm1lnMK4X5+r+mYH+fxPqp3jlHTSizjtoROuJR+SbL1FhcvJ6+OXYQcW5/OyJymKg2HMQNgnPECW+1rJOU7nrrOfOEG0izhClyTNEtneDzUeurfdQ85HruTTcfOTuolvafAy0cGYp+xnizNKcWiSv0LCGEalaYFUyzOdcIa6ReUK+/ZUnS6rVbWuecqmWGhm3bl/P4hdUM/sb1oi45Ea7KIoWAVup29dzvNmmYgSAVdOoY4Z/Sct2wcGeRhSPJCKGIokooTsBYtsyynMiRtgX6hiFZtOFU/XpGHP/GEWM1Hl8izfG0zEu39OIk2fKCYh7jEM8bhzijHGI+41D3Gsa4rhxFA8bhzhlHOKEaYhjpgG+xfg3v8M4xIPGIU76AOJBH2jMAc/Ltwu28ZAPhMe8j7nL+6y+3TjEI4tRY271gWM94n2tHvOBUt/p/Y++2zTEXcZRvMfZokkdjUiLGzkXIx0dT9HbyIk72Mg5RXMjh+XC3FtgO0hULPgCu5UWGBGsn+fiaYcT0yoCjsHHVtoERqztcKIU3BhkGHkeB4JBzuNEMPlU3ONgf09ZjJBgAyX5RnljdMHdQPL8teLdQBHhJkryGoWe2cLi+ZRFQkSgdzMjtUVD3OTtuOPk+ZAUlBTR1SrJ64jG6HrX0KxA+hIRl2QJGAxQR4YlVL84IuzJnxyTMzni5ErIhPMrIWexunE+GqPHHLQdisx3Y/QTqkIYJnlDWkwQI242Ro+60hh9kccvmhsEkNOYYjsJl1prjH6ROJCKLFhj9FSjp+U/YWSqyY9Bis5r1+rJQ/Z5LS1C8FPpXXx5AHtk5/aSD+giXGo+hsUIT8o3rnudFNbV+EG9EC979FiDj+q7wCWpW+pt5cx7bz15p/wAaS9CfXY4+yox6LsZ6MfRvfquFvfqV+B79RXpXn2vk2YHfSTnu3nD1afA+ioPtFvK+hrJ+m6obELduB/GhlIVJE8342UGNfs7i0jizZ0qfCsA8D3SZgBluYkTN4FIfoxAOEcgnCcQLjD6fkUX4Rxt4mYR/sSCNJbI0Y0lEJgloh7ZYV+jnMVaCroHJT8rN3EVhPoFqi5qFvTnFExcvkUTl8NNXJfUxAk4L29yViU5X+BNXFWB9d1ERTzKerqjS8FiLUW68WWBifuKhsArmbgy0WaxRJQHdxGnfrtBUzR7lM4i+aYYnXkGLkbVz47+7Su+/cNv8/WfDTl44IrR8V07t7U60W2nh3KHr7r0Itcn+tvIfzz1lf+7adL1ib4XXXN+4BO397s+0cdf/NyXpF6z7G3yieas7tyfO5v2Rrj8s/SCsI8JNHWm8fN68qdWOxZuYqK6vmRWTjggZh8QbA6wzBxv/sDy90QTtYZG/8hGlWgTRsNU2QdHxdjF7djFMWPZAGgfkJAMSArrxtk0MY4nyXryB5h4hXWX6Q2K/QzhctCQPP8ifOTR87/5jkddV5y7nlr94reXh38in4j3D4F6qrn2/PWExnVdAT26x/RzMwH3r+sK8O4uhuZmghA1zv8zHUbPsgT5yYLENmob4CIDaBO3UOMNdw4kjI7pRN9E0DdR9A2zyBsaJiJ9MfbZKeKz+Y3EFHxEIKYJiCMcxDR8RCBmCIjrOYgZ+Kh+AIVBvIbuoaR+GoRB3O6oX2qegHgtBzEPH4mGhzl6KxaE8UVkKzYHf62yFVuQ9cJCSVAUjlyjMLIkHDmiMLJLOHK9wshu4chrFEaWhSOvVRhZEY7cqjCyRzjyOjgSOxYniCpqrkcVNTyqqBqKKgR5wioaVfRC1Dj30Cv1N72iXCzub9oAFxlA0Tnn1EV2KQw0zQzeebIqvzMitYEfj2t7wXVtL7h/7YngtGMC1fYqRI3KIeY1EpNVQhKqUtFqA3xWAcQU+1pUedcA5RU12E2NEglcqm1jgpD+JJv0FsWojf+k7WJ0N8s3g2rkIk19b7oGsSIvKVEPzgNNvjja9AxAPok2PVPb5ZtBAYT2TGhWi5NJOxU2gxItbgbF8M2gQjObp57xKUg5XxNxCdCE08eaAusFKp6Usj5Asj5psQgi/ryF3wyaVUDRxTGpt/OmBAgWHiUUiP7UbNc69U5drc9LtH6/XOtLhrS+BLFyovUBokECyvoSyXqLSRby85Bc67HLyaqU1ufrqUkFrS+4p/UJqdbnyRhNXVzykCac1pcUWJ8kHDvK+jzJeotXFfLnHoHWv1Pw06566n2mfH1R5Ov/XDHPoubrZ4X6PrnWdznR+pKoZoDw9SX4aNLXd7Xi62f5+SH3fP1HnpW+vkvX13cpsL7oqq8vivnzaYHW/7nwYr7U51zw9ewWptQ3dbU+L9H6zy+I1ucdab0jX9/Viq+f1fovOff1RYmvf+RZ6eu7SF9fdKb1Al9fbNHXF6W+/lGB1n9TWBmWetxVX/9L077+O21fT/v677vn63/Y9vWe9vW/EGj9L4X1uqlfu+nr00XTvv53bV9P+vp02DVfn462fb2XfX26wGt9WmQgeurpipu+Pn26YV+frj3bfX2wFV8frKeHXfP16WXPSl8f1PX1QY/6+vRpAq0/HaeV7drW1c13OWfCmaPkZ1Y0z5R3Hwg6UZmEqsoEhf0H0gr3hAZI1xB0hpnEhc9ido4cs+AD4o8mzOgsK1bg95ey8tItfHkpe0zxBabsMU00Xc7wRabsMTvh7E7UIihCxSPYEP+dAHn8a6IExnGiEjxMUC9CUChmqPg/9defuuy7/71jmbz4HxGsTsKN7sAGRUiBD0IKi25aTb9GLvAR2eUCnegXiS4XYPXPossFOuvp1zcwGv4UWm4tqGDqbO2CDYUKpk68gilsqIJJIAJhUGzSYgdytBxbeO8vrqxR+K5hCjaJ7oeRFddEnXSfiyHRlOU6YlFfpPQoanpZ2Vz6WpQ3yLShpo4K5XkHA72NsJZhfeMQUvCHtHkISc3DuLZ5gBAblkII+kb5wiJKBCcBDWG2Cix+MXYEjbLDLUbZGTzK7pRG2QIydMq1hCRDiLw7QKelTagZLeL+PkL45k6gei264GNfeN5FP7n8R33KB1dFQhDQspJ4JWAA/sx+5ALGyFgPHdzXadr9kL6vi+C+LmjI10XIrAHuciLkRWQBZ66GAhkyDzKMFocKuK1pat6oz+0Qzu2AIW6HSFOOWweBoWIREX45R5iOo3CIe4xDPG4c4oxxiPuNQ9xrGuK4cRQPG4c4ZRzihGmIY6YB3uQD8faDwhwyDnHSB3Q86AOtPuB5HXTho4/4AMe93ldr86ze5wMdnPYBq80L+DEfeBnzEcpd3lcZH9gy8x99t2mIu4yjeI/3qTjpA2H0Q3R72Adfbd4Pmk8m3N6ORReLyky3HasnP9oPoagfzO2UD8ztXu/T0QeR4w2LMXK81QdmYsr7ZJz2gSXzAWNcsI0HvB9D+UEcb/eBOC5Gp3Xj/DmtkJMqpzBZPeHoCtZXiu+OCo0gv18v/n04qH8F64jOFaxBrnoHVNN0ahSUBwi+dcKfaRRraFbHnKJfrBF0v1gjqFOsYSlD5OjIysPeqiH+IYIx7N0jtxmHeNA4xGnTEMeMo7jXOMQjxiEeNg5xxjjEKeMQ9/iA1zPeF/B9PhDw/YvR8hz2AWN8IN9HvS875uXbPBknfeARzAcox3zgtWYWozguSuM4n34wCA4nzv14U+Nhi/AQb6becnH+qS4eaTxVfy1JncMN4+vMTsXzOKHkE3/0ke/fhToowaE2+cGmCL2Qb/Hy8JPRI2C2w2GC08xzb8Jw8rljXyLRiehipkNFMIsgtzGH6WZnjGmcrgKiAvRBKIQRuxAGm9SyEC/a/IHl77Em3eeOi2X+Abt+MMo+2T64U4xd1I4degi1AdA+ICYZEBeeoWbTRLiL9uL1zNeoy+Iy/8Po8JiOTdFMEWX1bUrA/WPSAToH22JOLqORFrPcRId37AowZv0rr44JqTom+InlzZWSyLncBMSeF61kPfMEejFZ6wK1wqhARd0TqKg5gTrXTYH6mQ8E6kn1G/WYEd+gfm9eDB0Tb46Zo1d2C/Z51C13V9C33NlP92bhS/J2NnC1XRa5nS0Nf20Bhl0jItDSjOtmP4NradKQlgpuDUwSWpo1ZPYFVwtm4Xfj921nmNTFeS3NSbVUcANhTqqlWIfBHMRe1MMuG0X3ufCrpLg3qeabxrejNyxmZC3pRJ0jMvXsHQx0AaWCvdnW9VChkEEFsllGmsKqUM92y5ttCUyMvCtlQbWlVVqMV1WhK6XIHbRKr4TlI0WY9csxS8h6ld4i7OOVHZI3F6HsfUDDcaYhVnY3kYCP6mZNLhVpVanICAiUrmdPAbS3qXCW8CNp16O9NO5Hsob8SFpk0HE/kjcU7eVFfAbfjbf+TDODdwbvRwpSPyK4F0/epRG7/adAq3Wxnj1dg+6ZBh5XoVQjBT1Dm79Zr/YS501505SRmQX9crmRKTgxMnkRv6Aw6NwUXMAEmQo0C0gsmkcDW+XQIccHCBegAiMLEK4SG7frGeiL8RWfLUC4Cn6lQ6NLY3WpowBB3o0zr9qNE9GQyx1148woBAjKuhsQY3alHDOpiNwiZsZrXAoQ4mSAwLc1jsNHB+VYDgMESY/WWQKtV5CKB8Q9JwnKB+rZN7bYCTVJ7FmkiD6fCYedUHMgdfAs6naK8BRvE066/VI9e6N9VkviAg9uskRf8ybtJ3URzlBiOIvuzQvS1zzjqK85FTg5vM1AEjh11bMTcgPQheYaCE84C3qvQl/zbIsdF1e00te8y0nE3E1yPsdH7t0KrC8SOSCHF1TmoKoJdeMI39ecUEDSO+EWs2R/ZxFJbk0KGIEn3IrymDIvN3BInPROAuEEgXCSQDjFEP6ELsIJyerkPQuyOknQqxP1FEiixcRYwmIrRemnB+QGroDQPiXJBf6JgoFLtmjgsriBy0oNXIFMgajbogKkCWfgigqsFyS5Uy0ueVIWWynSjYcFBu4TGgKvZOCoK5wy/OYNHhClRAFRltqSCmlEEmmyjAr8TG0Fxlb3DzYjU+EC4+/Yp/wfnZ2sUGu7OgoZyJD7O1khvZ0szboJlFXCs2vgu/EAnlXdZB/hpSQtzUDSYqe5PZSmRWt2g+jL6D7wJnQna7PCTtZPOJ3LKOhchojeaZ3LzPt8rW8cY66og7j2KoRG6GvE6tthV98OC9Gese3pdVbfC37TQZhf1FOlWMoQyp/EU2VEnooNkgny9+Qpw7DQ/O6AcoyhJrqdI9zUFCFGP2h5n72D784OpUXkKv6DsfRyjY050Jme3JbDbMUWoPeEXrz/yrOk3/yilqkmuncuXs8FGY4/16kCjOtNntJ3onH3qwDjelWACV2C69ROge/GLUucMet3vBlOSp1okgwaMKOFXj0HXSAnWql69jfqRVtpzlUWvzrx0DMIPb2RdNmOozCevnTXVkQX0UEF66A8HMTv2D6zfSXlcQ6fr3jC2EOHBKbm5ivoiRaX+SihTrIbLqZs78qNUa/Vd5Lsvsrhz6g7yTzEi+CUhXJsV+yP8SEllLkFQozm3JeAjJuV5YjdDPpG4UIx19cQ6Fyp5cIAZ2wv6DM3z5j7PXXm5uDsePjcIMfyBSJH0Uvk2ALIgUpcl1XicvCRo2G3VlhxPQ+grGj6AuJ44svsi56Lf1Gc07yi1HlVRMFmnAo2K/XcCxucW9qD8kAQ3VT0BPEc/eimgkc3cUPRTYX39vGmt7dRoweixoUWPY1xaA+OHn6yHmLJyN7hPTgcQ9xvGuKYDz76oHGIh41DnPE+Y+5us9qbrMabX3lHePYZh3jE+8YRPx7tHcYc9gFjfGAc9/lAGg/5gNWHva+DLhjwKeMQ9/jgq30QjM74IObxAav9EIzeuRjDsoPtkKcd8njF7ox5WBjZY7dxJI/6wCNMueD80QxoN5cBBZW+BUEys7ue+2LLicoVfNoPT4JWXT+pWbWjU4WYoQnSqmLzqLuvvfcvv1EOXoTxtcrztdrkKzKoRmZVOSL26hHx5WixZw1tHlVFm0f1Us2jarqY6VARzMLpB3hbdsYaCmTOPMiiM5BckytLjp3bGZ0btwnd1GIdSPKvouoxVLZ91qPlUq1vhpxmdDOk4N5mCDiP0d4MWcAAZq9xiLf7INowvyo55H3hMZhCBJZvUUbUU4txOdbenmtvz7XzQAsrO4syD+SHHLkPQr22Z/UqZ8xr9a3e/+g7F2PE48YekEahJ0hzFoUVpPmLqKJWpSzAGfYFfYVIb/TowtZOb/SQ+QU09dGjmOb86E0912/4dXnIGV/VU1sFIs2pmUx8IZrmrKJpzh40zVmj0pxVXcx0qAhmoXxU2bzby5kHWXQGkktzVqDeYmnOLXyaE3xbM9EpOlORv5z94FL1c7qgWy6W/GxmWF9PnBph56Eaw14Lv+Le1duh+MEGBicq14ki/xOHXhgiAKK9hR44y5CXd9krzv2EOKdkOV3QDU216pGEPMSXODkzK0dC0nQRByTwYxUJwC6hJ9nGfvBHqCB67Wxj3r2zjXnCgCcNnW0UHjEE3403pmBnG/NbeDOVamoGMnGKnzgl9XI5tDsLwJ4XrVw9j7cB2MR3I5t7s4GdbfyK9X7dTzfv1900Or5288jO0Y1rR6/eOTo+Zb85t6kytjttj6G/jKFvcuibAnJj7yZ0ROCYFR+V/4E9q9Nsv8A2wQTqmnO9n0cOV9eSIXUVNLEpEepaMNTPQ9jYF3w3foyu6aRvFvUlk6mroNVZt1Rdy4i6Wg478uparudv4g7w56CKqzMlR8RSSQt15nk+zIEyo5Pfq2sF4xZTKrCCQ4MM+K2UjKpsSXfotPDRWw8u+bi+yne738KnW+QqcZUv633zx1Al4qctExG7JZpvcHuGF8YKZLz6JnxFqvQ9iHRWIP68dPbU81OcEqr0S6QtE/fdJfizVgW1o1W2d/S3Wr8xKzi4KZF24s6/W5eNEiPTUx/8PgP+Pv7jSiqnlX/3X59YjvY+aD0lFHaSEkLNS9mQeekR6TmTY6rwjqqFKpkvr+oyBlIWdDgF+Mg7deLRBZWe0rxIjzp9QRD74MqtI1dfu3L7TRMPr9k+Nrpl4/Ztp68Z3XndrvHZX27fNg21PgTZENJwZWw+vmVTGT46NiQnu1hC60AUqmr541ZEoUqm/2zUqEHUOI2qKRgSQYFtjVDSmoIh0QYpMyROAeoZkgWVntK8SI86fZ0Zkio0JLWQhrUjDEmPxVniXJvNaugveyiB0NxlGdQXiJr7AlHTy3RoFtAPAOn4wLrtV4xs3HLTMWSlI7IhvRb7ZZi3Za/ytuweb8vzxtseLd5ivVpbD+gGjQZ0KfcCuhTBmqouaxydDukhwocetuz7Ien1C86cNDKoF1mmWuIafpnaW8//e8uCM6CQxPsJSmh0fT0H4woB2tX64BcY6J857AU2GxSfwq8njVm6sFFLV3XP0lXRoLgXosbJci80lphY8tP1EgFnr0JQrA1SFhQ7BcgHxWWvSk95XqRHnb5lR0FxDQbFvSEN013Gg+IqGTipGpJTeYeAi0Kv66LQi4tCzZAo9JJeykaNPogap1F9Coakj5+uj1DSPgVDog1SZkicAuQNSRchPWXXpaeMS0+XIekpO4px+EFdjgxJWc2QlIn5dNN0tdZWYF3mzMmgUXPS5Z456SLC/D6jK7CqcAXWKzQnNeO8rXqVt1X3eFudN96WtXirkdTqdp013e4ntbr1klplXdaY2cuvwXdzy77CS721ui4LV9eFs+Vr48IrUO44WRt31wffx0CvpNxUSos9eCCTgj9zL5LJ+SWS6TKXn8o6y0+VCQ0qM+FY44f8VGE1X8znUZHqdk+kun0iUm/whUi9TsEoj+gWc5JGuVwf3MtAb6SSEKYKVUrwZxqbBlXXNajq/qZBVW/ToGZIg4RijLPBsq/TEI6dZFa04CyJiSUsEFG25H15Ye6rF3bopD4XVKTK7olU2Sci9VZfiNRbFIzy203vIrFrfQr7KaNsqtSvy8IefL5uQ/N1K84339+XMjRfSnE+U/36yh79vqSh+ZKEaSl51cK7WPFV8omFf8AXFv4+BQv/QdMW/ioG+iEXN/sdSPSCb/a3mmzOaokV+G58c7DGmPUpck+v4GwLDhnUj4iWZdeSF67+euGTChL9WZQ7TiS6Vh98FQP9uXncp1cneArdBh4gFG7QdYUbxBVuwJDCDfHUGAAkhGen/6x5dnrj6NU7d+8YXzE6dtrpZ82gJ5X7J/7kotGRHSt27hzZDYg6lEVHDM4ITyzf/wyIKcHLs7LcH098zlHx1LUsctz6CvHve7Piv/dljzpASjJEAlCkznWmWV9W789R4lX+SS5Wq0GBcJQE48zhAPyZpokZbMAdEZqYwg/Zp/y9Rz+F0Rx+k+hTviW/Qb1GaO0a6vtrXAOTXiyC4A1ev6G9tD4hYVbDiYTR2HfYFaO9OGHWbt6KxIerFdOyjI4ko2aTst+TM6qXYNQIx6he+GhnVB8W9qBp3/dfthON0vvQDCu7KLfwI/Q3m9Bk2gZ8tOX8Kd6TqAyMkqjXTOEX7Ac/awnBX+sp7uUQW1vvIahEJ/wVAjh1opeP5VbdXkgeO8fj2hw/Ad8emgGsm18uukW+mGI/+K3OUlovBb5kRj8OSrm/lE65WVawZNpZWUGKaBHAmFWMzmOLgF5nLQJ668VO9fikxulq8fl8UgEXyD7XBbIPF8heQwLZR9d4t+abcYHs56ftJ7zGAHzXYFaZjJdQgRyglyLiQYOIQA7Q0cRgvdiFOo+m2NV0U0qpprcQhTCDZzPQ/XrR0eVQwTDeie5t72uqmWgFUVzKy5Lm2rKDNSbkFWWAaENWJqxbL6PTcl1TRLKgtz74XAb6VPVeeCWIpUJZwazBEsUuxXPZD16osx8Zd92ixd3fj4zr7UeWDFm0ksizg+/myr9gRDbHrJeSG0eoResiK600S+i6LJGJoIiueLZ6OFzhbd0rNfhWcpKak3cd6yPppaEv/a7rS7/7+tJPZzdbS82lxHmt/vqsImFjKvrJuRPgNNJzcWr6mtkUHYZaS0m6pjIJV1ivZz+4RGeFpdkHzUGb1KT7K6yk3gpLs7AqqbGws/QcxZveJhmzXs2bf9DjGJmYbjGIDCogxj9nMeqcaBXqxSvV11ddvPH/IpWLMnVWtgx/1vohCtRsnrflBnR12oevPrjcSb/CsN4TzaTR2fAU6FyojhBvg3D1ULyB8esanRLjBTUf3e6ZD6rEOGfIfAi1GDcfBZH5uJ5XhYLUfAj7xcrMB1bpa+k0K6r1LW5Xjx0F6Zm/sv9miBDHpa6L41JcHIcMieNSnj1DhDieZEgcT+KnPQl+t40Ny+C7BrMmeHFcJhXHZfzEy6TiuBwRx2UQe14cl9eLb+X80VIFfyRgylI1f7QUB0l5kx6K0yq9eFfzAJZpAfguD2C5FoD38gBO1gJwCg/gFC0An+IBnKoF4HwewHO0AHySB/BcLQATPIDnaQF4DQ/g+VoATuYBvEALgKCpzgu1AAguEzpNC8CneQCnawGY4gG8SAvAL3gAZ2gBmOEBvFgLwJM8gDO1AAj87R+odAQRt0Q+S2vuALpJs4GooONiqH4YrOD7DVyd6WCzlsf2ZpiPWN6PxpnyYtGlAp+VrA/sZsDvp86wDmntBeLea0jBIZaFy4xh+lNmo8HPsE/5EL9AxiO7suuRHXGWMWcosiuT6/ZW72xPam3Hgu/GLzZrbjp8krg7Do3snF1ahmiJ5b41UXVz8WH09oFN/GKKU9vPoaOp64uGiGXaMA6byhN1E0bKcn4UXSIplsN0ExsUNZC/4S7JARNxNzKBibgrdMBEzUt0bL8KwYls78JwItu7NJyoAf2rnLWMQ2jquxJxwlqGCXrECZOW0FPvgL5JS+AmLW7IpCVIWnEaBVCjztt0UtRSiReeK7AQoXppJ5OMb3OSEYBfgHxtgP/aACEZcfgzGy0ChGQE9Zhzgb5kBHHJCBiSjCBJK1zrgzwdQ41xj7wNmy3EzxYiONOEuMc4xOPGIc4Yh7jfOMS9piGOG0fxsHGIU8YhTpiGOGYa4G7j33zEOMSjxiHebhziPs9z2gWFOeJ92zjmfU77wXy7YBvvMg5xcjGK4yEfiOO0DyCajxwPeJ8zYz6wPAd9YCdu84ESTnnfOrrw1XcuRp9wqw+E54j3PeGYDzTmTu9/9N2mIe4yjuI9xiCyx4T3GXPQByGPHxatUz7gzOH54zWdKlZHA+w8WM4wPNQ8w7B1+6bJyaNIp46LxeX+wfOR368R/z605KiohJ+s7z9f7cDAM/UWSxrbGANh8T7HrparVjuIk3c5bu8EWLGwIbEJw5/N93wYSGHNQ7oBdYOYGfsa3CrdggKW9fNIi0FPyNtECA4phJvyaydsCj7i++GNDzqgvuPOin43g9GiYpfSYfaDg/w2EQae1VGs5bek2ZsG3PsmHnqGWE9r02U7jjZ/XWKcEKD+BgHCpXrpGAM85aACYS2/T84h/F6ugUMXRK+p2Weewf2yBAY9Yz64nxThry3AUDp1nTicIJSbkuDATaNMbOk3/jzyXx88EvrYN5/cfuMvTp358oWH/uJDL5uuP++ct6194o4fX0rw5cQZCuTzCdqUaNqk5LQpoISWq8d7iW1O6nhQgSirKAIpvr/FPv4xsVX5NJviA6hsCnatQ62VKzUAE7vWIXzXumho11rgNYrAa9inDetNi4b4YZGVBt+NF7uEGLM+xju1dNPoIhOn+YnT0tArh5RopS0+hhOtXL30pw4cxlp108m3Hyv9j2eCB8IRj1BIohC7CYjrOYjd8FG9QJFBvIa+5Eu99pBBvJaDWIGP6kWFDOJW+ppvrOKQgHgdfUciArFGQFxNN1FTPw8Zhnaf7PeFnRQksLyMg9gHH9EDkjjEbRzEfviInp2kvjvLwRyAjxrOK+y68wq777zCpPPiatoBapxFG1SwP4P8dIOEkRxUMEDOQZbNg6yYB9ljHmTVPMiaeZC95kH2mQfZbx4kek67xB/vTjcX5lgQ8ZFG5AUyEWwQBCQK7H/aSBckv6aXidgGQyzM+IhaRIEFO49RuF76JW+J0+YSVWn1kn6wEswRJf15tbiyaCiuLFp+JkiWdE0xhH7/LKpoPq9d0dyuaNaD2K5oblc0tyuaNSC2K5rbFc2e4bQvKpqPLEY6tuuP2/XHz2pxnPSBZzXPaj/UC7WrhdvVwu1q4YXVmHa1cLtauF0tvLCGp10t7Ktq4VXuVwuvMlctPLuHcLTlWq4OYhNGoZr2zDOaf8XLfsJN4Kq7A4zB6N5A2NDeQJKofAhwRYWg1U1hru4Qq8+SVQaj+3E5ohiAL/zNwUcEYl52mR2KS4HAha99KsBHrPZJiMuIAi5lApf1dI0T0aFNpSnRS4S7sr25hn52PeBQVdZxaEegGCJAIzwhIoRlDlt+JviQ6hvYh3zY4YdcKQRcfoIB/ii6jwnkQQj6DzklBMHUXIEyYXE41ne63r2r032r1UlaLRs1IhA1TjwikLCEP1FRlOdT5FYB8AKBHAXq3f/A5Oizgh8E691fYz/4C2o3PWxoNz0Mf3Y/vm2t8slcZ9IgIbwRPfnZqy+8EVx4g4aEV2C/gqjwRiFqHCOiLOpEt+Oj/GxRgrVRee7OMcTjxiHOGIe43zjEvaYhjhtH8bBxiFPGIU6YhjhmDCCwfItQHF3A8aBxiMd88NX7vCvh7gnPUeMQp33gZY4Yh3jI+8JzyAc6OO0DiOYDswPe54x5cbzDB27LvOW5zfuMMf/RdxmHOLkYNebgYgx57jYNcZdxFO/xPhXf7oPAccb7ZDzs/Uh0zPsuy4UI6rD3TSNe3ueh+HtqMXrBae9/9F7vGx4XdPBWHwjPAR941ikfWB5z9pY9JhajMTuwGIMeFyT8oA/oeMC8zoQ8rzNv8YEx80EywXxUP+MDiJMeDh7ZY8U8yE4vgzQfArjnaPb6QYCMG/F2MYrnxMdFZh/2ASHNM/sOH1gf82HuO/zgGHyQ53IBoh/EZ9oH4nMjBlBQdQsKQZFBVDtWsweCArO7Nq6fCJqdw9iRoGC9++tUOfIJwC0dCQqA6X1WZn0p1dtMBcDFfFk9IxAHOqpHc3ttZwMwIxfPiihepx0xVKct0HdwzsRGjRhEjeNkjBkstE47xs8WI2QjJg+NHUM8bhzijHGI+41D3Gsa4rhxFA8bhzhlHOKEaYhjxgAC0+l9cZz2AUTzpueA9zkz5gPreJdxiJOLiTEPNkMkwzje7H1pvNs0xF3GUbzH+1Q86H3z7YePPrwYrfdti9EJTnn/o12IoPb7gI7HfPDV+xajgO/xvrldnAH9241DPOp9t9WOoTyqgkcWo+z4IZzY6wNWH/CBgJu3E8cXVcjDHhOL0Sf4QcKP+MA++mDxb5DX7DHkeZ15iw+MmQ+C+tu8H0a5ANF83n/avA5WzIPs9DJI8yGAe45mrx8EyLgRb1dleE58XGT2YR8Q0jyz71iUYe47/OAY/LCtMLUoxWfaF6FKBgMZIGsikUGCiw9cK1l+m17JctBJyfLbnJYs22pGMw3kBBW03XpFrCfbaN8AzCjPZgIzoBW0GUMVtN084zNNxtuoUYGoccJZYRqEVtBW+NkqhLhX5LGaY4jHjUOcMQ5xv3GIe01DHDeO4mHjEKeMQ5wwDXHMNMA3+4CKR7wv3i6o4LQPIB70gVYf8LwO4pk5DymheVYf84H394GvHvM+ii6wer8PLM+M91l9yAdO5gB3QLMbrj7VFyzdxHRh+DNHayD1z251xfxK8QK4ezny+w3i31c69BfMy3XWyx0c4wCVixjBwiTBOMYVLT/jDhLn65X1jWV7ZQV/JQ++bNe84Cqhv2wP48v2qKFlu4CYUXTZnoSocYRONsZtxiYTXECYJDjXBtgG6DGA2P1lm+xvQk3bip2l56ClmmMaBuk93I2AGYiXxcbafwlsaWbu7kDiesGwDdiCG+Z0vbLpBMJbt07V05fPO0LqINnNnNdQSIY1hJFBvJaDmISPCMQ0AXErBzENHxGIGQLidRzEDHxEIOYJiKs5iHn4qB58AYZ2UTFit0ZsxrC8jINYgY8IxB4C4jYOYg981AhNiq6HJkX3Q5OiTmhShahxmg3eFrDpqvx0VcJYAJBl8yDD5kEmzYNMmweZMQ8ybx5kt3mQFfMgezCQqXvX7nqjFWSpAXIN6vk+0ri9uHE98ovE92vzrjxcr9zZcOXJr6ETCK/LvgzGR5gLnbux+f1Xnibw9JuEN8pX3smbzbS59lFpNFTcQtxZnIOBHx5LRA0FPFE6AgvWe85hCN1HdcGKa9QQUF2w4vBnNjIFCH+neV3vRfr+Loj7u4AhfxckacWtLwBqHB3Z6gPfQRf0lgsRnAnJc+iOIR43DnHGOMT9xiHuNQ1x3DiKh41DnDIOccI0xDHTAHcb/+YjxiEeNQ7xduMQ93me0y4ozBHv28Yx73PaD+bbBVb7gI7mhWfSB07roHGIx3wQ5/kgKhvzgeU55gMcDy9Gt3XIB4yZ9gFE85bnwGK0PLf6wBEe8b4SjvnAD97p/Y++2zTEXcZRvMcYRPaY8D5jDvrA2vphXe2HVcLh+eM1nc1WRyMOBhk8PRi80P37Ti40ed1Jzwp+2yNhbr8qwW3vBJuPUQ0mBwmxicKf2WuRwHyhuXIl255HvIk3R4qQHilS+jtAIXwHKG5oB4gWfxs1EhA1jtTgbQSbLsFPlyC4l4C8MgVy7t3mNsA2wGcnQLtdDSnYVU13rHJDY8hu2kaa79DCigRR8zFiwY3zWIl6zxZW8/EoOoG15oP9PavwRcKqD0Z4cdVHz3WspHSf3aCySokNDVfcs10X7zAkqogo1ZUM+E5ONBLQ7psRxLjCWiRBSBtaDpQUicaDwiWQkBG7gXDYQwFQ5JqYCwUeegaLp/9z2Y6jEPlLd22FQ+cQ/yP+8AIePWgW/oT0o4c0Hj0kDUUPabKqnetHAVDjpCYjtYeCiuAMIYZuArR9WZrgs2azi7A+nzM4n9OG+CygVBrlcw6ixlExJ2VLjp8sR7DFDwCBZeJCasZQVcYrhctJwha1PlESygGuDK1PlG46SLy7TevTZJounFPg3DPugFaeO5KfF1yBmddTv277N7LDoR1ENxtOpHoIKagSjKtBetje9UJpFtK7w07vDkiHOce7dGAOMP+bDi40ySmEJpqaGIc/k8diH0WnlcdiogA1V6+eyoB/jArT0Zr0sCgCDVERaLje82e8aMbN5XHiLadGvCT42sIdYsL9Bg3htkSrRN11knsZJ8MoOkVDn6ZNW3iK2sgt1MckNerEQcRPnmLTyMlppicD+tFWwv2cXEI9Jf1wMyW9aXR81ciOsV1bZ5lmyzMDigszzYkl04Jk8mlY2vgoCj+AZLgvRTPfGKTYUeuk4v9Zs9zWnzgg7hpqeZzg1oxAE0OyNWPIumaMU3ATmCGlMEjIz9vGbZsCnPKwSOfvXvubxx/OzNx806FPv+mskwsjH5559Kc//OJXPpL5+Xcfuv7RM/HPfPpkqfBL4pQhQ7NScVIVqKzU/M+nDjKKC1xcAWKCgDhCi7D6Op5BXG/q+C6DeI2j47tZAiJ/aDkLH9WDRwZxKxWO5jCIeQLidY6OGBcIiPyh5QJ8RCAKz7iyR/7QchE+IjBLBJb8oeUSfLTbK4BLSrwnlyL8f5eeC87p+/8u3P+nDPn/Lp6aKTTb0g1R4wxUN/TNyHSaXYkAyKB5kBHzIOPmQSbMg0ybB5kxDzJrHmTOPMi8eZAF8yCL5kGWzIOMmgcZNg+yU6NcJCVfS42xtZSgygdYVOxNEqkAyjpd74hXYlm1JU/QyWZbWHWzLSjMOVX7ic02OFrs44OEjw+7vsYnmqAF3WuCFkR9fCdEjVODTkhY9d39oGtqwBb9SFmbWSVYYvtVs6aNiLfjGhF8Xi2hnBcnfF8AGko5zyZnxcBPZ0r2mMYHwWSS8sooD/Ei10btbZCWtkHUWRJuGnFuLwPgKd3NSBB1OmGtYgx+vLgUo3oB9A54vzE0+NBspxeFP8NAolrIFrLCT7lEroNUeiWg8YlpSgeV2rQh35igLU26Xr0CfKVFdoPQrjRUf+6ddoVsY47voJvKYWclCupKlYFUobbykxrpOSVNTfAbHeBTmvVhtl9lzaVDXmA0HZJ1Lx2SRUOlCkSNY1/7mhfTENvXvBiB2L7mxZtUbF/z4lWI7WtejKA46QM/OOUDP3jQB3S83fvieNgHFnxR3r/Tvg7Kq1q9KMXRn3cEdTUfwxqr3S5iujD8maMFtPpnu3RHUNfz3b8j6PneviMIA4mk61jn7PXivbefN7JF1S974laN6lcX8FYN0f1L1a97CqHuevVbC4hQqzusFT4Jh23YWO5M4DZemFRrb62E2dbKJ4itFa6QDOCFppXxvvXrtfbO2SAISKS9/+60b/1qgDa6A6Ddt35WfX/Ei0jW3PmRrHrfelA4kCM2yQtEv/syf6kJe0w27GYto1N0qKkuMaMFCSn3ChLwosP2rWxtgN6682wzbw6wN/htaFH0TaYZkzZNBOGnU4b8dIoOHIL12mcZQsVn0XUZl+nbyPZ1GdIcQ/u6DC2I7esyjEBsX5dhAmL7ugyPKkz7uozFYr7b12WYQXHSBxHPlPe12oVmvXu872TaLqFtJ9rX6iywVi9KcWzfteJVcWzfteJR69i+a8UIxPZdKyZQbN+14lVr275rxat09O1dK6vdv2tltcm7Vmqfa7muoIOosQij3U6XtNwb1EGDhTi+Vxc2tFcXV69f1GyiGBSLUNztJoqv8k4TRYq4kp529l4gYNM8KGuiGLQ2UQxTcOOQYWQTRQgGaaIYxOQTx/VpEjE7+i4IYL7rBhxU/Eg6siIQEwREZ40JkwTE9c6OwBMQr3HU6jBLQDTWmJBBNNaYkEE01piQQZQ0JrRrFxDWjLgdUIbwVkU9h5HW91ZF3FtlDHkrQVNGcBWFjRoliBqn+iUYxyHTCfo1lghrAkB2mgcZMQ8yah5k2DzIhHmQSfMg0+ZBZs2DzJkHmTcPsmAeZEpjsZWRB8Ctdr6LI+urlNmmXym1OJVqe+aw8x28M1JYv9/bSXS+k984GSJc3YJ2vgu5V2geQl2dcue7oEaiIuSaGrCVmjgpMW+d72xU7CJkqkePrcv1ZaoHl6kuQzLVwzO5C5WpKkSNk6kqW7OhhblVfrYqYayr8p0vxxCPG4c4YxzifuMQ95qGOG4cxcPGIU4ZhzhhGuKYaYBv9gEVj3hfvF1QwWkfQDzoA60+4HkdxMuwPKSE5ll9zAfe3we+eswHOnikzRgTKB7ygUvge7L0wBWm+vKih5guDH/maMWi/tku9WTpWabXk6XqoCfLMmM9WSKGds0i8Gfe7AHD9r7YD8RdJHpvb6QDeq/X2U1Z0F4GGfdSTPhuiqWpNsci1kN6s8aGYprgeRvgIgNooJcB3hkhhb7JNi12wxA87IlmUL1THmsG1XuHx5pB9d7j42ZQPfw9HHMzdxA3bRT5mzaYpxN6GOPNoDIQL7TSY76bQfV+0EAzKHS71UkzqN6PtnzBSwdRqJg30wwKVAIViLZfZTXbiN/GrqdoGVrzg/W+yxlCn34WdXO5cEI7Smx3c5GmjdrdXLQgtru5GIHY7uZiAmK7m8uiOTjU7ubiTfPd7uZiBsV2lwavxnmLsktDu5uLRxnTbp/hVTvRbp/hUbfVbp9hBGK7fYYJFNvtM7xqbdvtM7xKR9+2z7jA/fYZF5hsn9G3zuX2GfbNGHCQK6PB5CAhNhn4s1abcjjbho3w27DsMWp/1wdl1/auv/mYtL8bwEnXQJHY3I2zvfED6pu7Qfi1+A3svRybIxAGwuYIz+YIweYg/BkG8gHR0UO2tbhBoAORen+qoSR9W+b9Q+wHHWEpnfigY7SpZ60Ke1B/f5HoQBN1rwNNtElOGzUSEDWO1AkFmRE030gQ3EsQ2hsxx5qLjLIm4h5rIo5Z03D2bzPGGelS3zHE48YhzhiHuN84xL2mIY4bR/GwcYhTxiFOmIY4Zhrgzca/+aBxiNPeF298/ecY4jEfmIkpH+C4z/M6iOeynELcZRzFe7xPxcM+UGo/+P5p77P6Vh9YMvPCc8j7jNnjfRQnfSA7B30QTexZjMZxzPtK7QeP4AJE8+J4YDGK460+8INT3iejHxaYh31gwKd8YCf2ep+OPliy3jB/S1Y6l62OBtibMNlJIn4h8vsR8e8TAf2t5At1tpIDjV2y/l/r7HtEXd+Sirq/7xHV2feIQ9Q4yQRvOzVEM04IO3Ua0eBu4fZn/25hw2i0t6TaW1LtLakFjS3aW1JeNTzmpXGfD3htXqsPeF4H21nSdpbUS+LY3ttrp6/b6euFdTKLM33d3hj2qHG8s13XYwBFH9T1tLek2ltS7S2pBeZ1e0vKW9aWPVbai7dFsjDyQyrBvOG5rZ0hbGt1OyWzoBpj3vJMe/+rF+dC5qgP7IQPTvT4wMf4Icdz22K03/OYKqNLaNTRgOVzBpuqxLe5Xwm3zWklnL1fRLT5GNSoJosSHAzCn9n7RYD5suJ+EYwrG1gvGLyYynolAoDBHkV9ZOL1gU4GPNRsOfPAFaPju3Zu44gECtYyhmrgMvBnxHxBQ/MF4c+0qTkH9yoxLTPs7orHcGwv3bUVgYreqCG4iyfoRM/TFK0T8FEdEUZr9Hr5nBPss/ygHPwQO/ZZ+OgA+xGj2Mc1sY/DR5sZyDVmW9LyPSQB/ULQPF4ImjNUCJoXEUvskMCF9ZvYhfXT6CXzabGfyS+ZFriS07BOXEdR+AHEv12CNhPDIMWO2q62F/7P6uOsP3FA3DWcHObho91jQQmem/ShZyZ9+j+X7TgKVW3WzAmH8nDzkGGWLyQwyM9hYP9JGpNPHNenScSCrXdDAHb65BT8X44UZ8r/zf986iAzuNDkFCAWCIgjHMQCfEQgFgmI6zmIRfiIQCwREK/hIJbgIwKxi4B4LQexCz4iELsJiFs5iN3wEYFYJiBex0Esw0cEYoWAuJqDWIGPWAs/geur6nmfvL7rq+Kur8eQ6xPcbwvu2cXbFlZ5va5Bt4RMV+OnqxGmAoAMmQeZNA8yZR5kwjzInHmQBfMgi+ZBlsyD7DIPsts8yLJ5kBXzIKPmQWbNg4ybB6lznK9HvjIZYysTQcYMGGnsTR7JpuWcrh7E65qc2gIiLkojyJb8CdEVoGA84CafSEnUB7ayRMqjXIQPjwKKE2dxImxIu75iTuNhQ9xQ2JAmU17cvcgANU4NsgquLkFOZ1gN2BJanCJeYlYJljhWgkhTCbi8LSBTM3NrD3xfoeAfXsHP+wrCppXhz1CQXAKyF5o3ZNiKe8/bcoMdE/mwc4V9nVfAuXkDcG59YILdaPxjXodX6KnRAA9hVWtn2xmclTx/VsBZbJJxbtNcaJuVlbhZOdeQWRF8zbmEtK2EH60OcqUqSI5rKw1xbYXoO8EsNq5ZkeJRnvucXcZoIN0od07Vk4wjOWUeyWWmkbzBPI7LzYM82TzIU0xT8s3mcTzVPMjnmAf5XF+AfJ5x9Z4wj+TzzYPMmAf5AvMgX2icO3eZR/I040hOmkfydNNI7vayF2OPLzIP8gzzIF9sHmTBFyDPtEeOyWYFD7apv9n+pgpRtL07u/nYZ3/3kuZjv/3dS5uPA/Z3L2s+Dtrfvbz5OGR/d07zcZitch9FQ26koibZfOwRrARX1Ad+y4A/JltknqgVE9HxTC6HBBZp58q2sldat7JXWJgoWrt+lxcDQFHbu1dAija+9Cl0Y1b6pTxGufrAv/JrqXPN3RV2LootwnQgOlkxwv/O8n+PW++8CkJSNj5q7l1I75NSbI7voHob1tghT0qrgqpkVdA5vG2pQjOjniI6R16SReZnz4HiKeTPz2F+Viq0PIa9aPKsF9IGv3/tbOL+tZcQ96+91P5uEFpC27shyFzbu2FIozkSFN/PJfmAdygbcjhlBaFYKcobgo9Bhq0ixeIVFvw4sVhVHwwBscCmQGwCIFRFDDzC7sG7XB/4HDkvF4OOy+s2z+MpWpYq/Cp+0HkQK7u0rIKPqg4JmJA/4BwdmG6VzNGd/3QdlIgj56FyJvFHBQG9V9YHi3ZtWgFHz2nT4HLea11oKAN4AZkBvFBDCC6AamXn53kKJLyAyayFiKvgUJ6IF9QHWdQ1WMVgXyiGDYVCAPvC+iAXQV4gYtAg8auz8F+thAMavzqJ+NWZ+K9WWNSJCY66WUyinigJQXPhe1NriAB+BQiMeTr31gefDwwPFudUWotzlszgcU6vNM7pI3w3avb6+UHAdad4l9YPLYY6JimUdyk4s+1dBX5Kw3MvdzLtFSgBED/URzu5/vrgy+WeaMBJ6ClgyQDEy265+uEjJpm97klmn1QyB0RCJiPDIEkGgWQOQjqo01ZJMvuJ2LePSWYNm7aXn7YkJUBNpM/skT8UUoOPmBxUW1yJ5TxmoeKkhapp0DaOykGcJ6zIgzALVfisxrSOlqI1Sg6q8BGTg5J7clCTykGv6ItkZOiTqAMnB32QDuq0VZKDqv1dCX5KQw4+qCEHpYWRg1RbDmRygIYOvUjoAAjfI44ld8lDhz4nItJL2soqJyK98BETkbJ7IlJ14jKqrrqMXg3aKpmKXiKs4NxJ2cKtOTPydg2pTUmJUxZRlDAjlmMkmIx0LaSM1JzISK/EmnIy0gvpoE5buRmpIWakTJuRWn1wWm5Gep2ICB15lp1Fnt3uiUjZiacpu+pp3I88u4hopNvCrTkzgh6b7r537a432kvnAQ6osHPDuqW7GTVR2poNgoBEAv8Ak4GvoR/jTJu664N/ItcmAfO6pGLUTVqaMn0S0K34fdBXcVu3nLbMysoFt8+Qv+ijuNirEFKUEVntpmW1XB/8c4VkZM09ESlJRaTsJHztE1lp6EAIEenVUD8lg9vNDOcr8PjLkeGs8cOqUsPZq2Y4q+IFx5fkhrOKCGONFsZqffARR2GIowVvL8RrQRa8g75KgCkseDUMZ7+hKKqf4mIffNQMmavSkPlxBcPZ656IpJwsZlJORIQ+gd6vQGTnubE5w5n/CcXckobA9BE1FiXLzzie99QH/1NejdCDCBT74B1i0D9xKZHTI9F5O1174KO9sACM7GmcsLPv1vc/82JWtn9P/8NrEgZsHkqIQL+AjgP1wf9iZ8h+KsANdv5RKH/D9qcER0wHdI+nWfnVAEycBRvAz4L1GToLRm+vcd88qDftrKlYuXXk6mtXbr9p4gPrtl8xsnHLTceEktcNvxpMBxiJ5XY28IsQ9pgk687mbM1QUFe1qxYnJlDuoQQD3qmhp0o2soeoYKgRFQxsjyn/bq1wwYG9sUQRpL3R3FkH7BPvrA/lFEpKW1zdLPk47qT7nWxo97e4od1Lbmj3aDCuV7qWGCBrB3vpIGqgPlST1w4OEGvsNcQm6gBhCKhN+B5gCIimV0mNwleqM1cS/kyzpJqMKXL1oeXymKLgZB9Z8IkFKqbQ6xU2N/vrIURsRU4sZV8PkROl6YaeT/SbAB6oIO43USCCgbKeYwzrBwNlPBgoGAoGyiIuM9HA66vKvJBXIGGR6QQNxCqE3gCQXcZAsuM5hgE+8k4+r+5R6emeF+lRp293c1Azenx4zfax0S0bt287fc3ozut2jc/+cvu2aZjYDEE2hDSsH9h4IBsUoouXp/dAhLaPGNS08AJMXsdZJ4BJTlbgnbMWjhfgBG7tCWTwkKggDYm6nUhOWcRJ4ECoAxU6HTGVYvIcUdNTYHH3XrT1t8AmRF3vYBTFbULEkE0QdFLHmtBr9vztFDcOirrW85e9CWp3/Q251fWXIu8aqvU936cedDPqlBmYTquBiVBwo5BlZNdfCAbp+tuJSShGoAgSR4chTD5UjNSHNjKD9ksUOL8X0yldP0XV9mJEWEXrQ5vlezFRYSumMKQcytiY9WgQa4D+x2JsbmELp60aEhqW0ihOrjHDULhE/fmHdhBhfpyXMpQcUSs5YpYVDw43LIObIOBiJBHJGiAJMiypSkmRvCXrQzfJ5S3MYya/K6BTTQtEbQM760NvhlhBH/KJpg+5evuO3awv3TEHZj6Kvkmgb8K4Czim4gLUHUJD8W7hBBFqutyQY4IYthL2z5qE3Ti6dXR8lJF2xgFpO3EyzWiQyRZMdRLBVMT1YCqCB1OdhoKpCG9LO9HleRSixsXCUQXbESanc6sralAc14WXOI2ulBpCNi7C4c1NoD70XqZth3QC+IAe21foy1zA/QA+QAbw3DcH9aZFW0oE+WmD8LvxlRi7+2noLl7s49J8D33LEDIogWZrYSglaIA7dIf9S0KNyTbZ34TRN53Nr+KMALZHFmuOmaPXMHrwLSNiBrrKyMBHBGKWgDhC3/lzf4vX06zCcMqTIpej71DBczEP2De0M4DyeJInT6+VAJELyFopD39tjSQEOwfDTb15yC4rRcLIdblu5LpwI1c0ZOQE93cUCSPXbcjIdZMZrC7ifEcXY9anRHkumZErO6nFqsiLo0WV15X60CftX5JBzVIOKh+WRxxBS0o3MLp8DvUsyGcwnER3vgXrQ48z0J/HnVZjJcRAAW3EjCu5QstTWGXqQ/9Xvj6jrTdmDEmsghaycXjl60Nflu/yBsktxYwzzAq0x53F7G/kmGUQEWFke5OYGV+Tb75myK1iZFCKH5SBWNk9Uwo+IjDTTqQioyoVaTGBvglob1PhQGPyLURsl7W/S0CDjVfFlFiMU9Itp89YdFFQTj/0hH3iIBRH/OBNkTh4wxAe+o0uwgVKSGfR/Te5kFacCGlZtFEKsHJyw1SQ2BdChbTSioGY9VY/khsIzBWWKGs9C/pJhdqkYosbcSvwjbgu6UZcxckZpR6S8yU+QOlRYH03UfmKsr5Msr5EByqzuvFrvt0doYAiq4xtFWbgJ3NxDR7zFIl40PI9zbiHM5F48B50PXgP4sF7wlDwLjASCSJ4zxgK3jMSp4zfzhJk3igluqdFFrwL1s5Zef0WYrGydCQ3uy5MoJ56E++psTwE3iA3hY5JNx2Z1HsHHxDfP0S4wmB9uMzU/edoGmYLn4YBlOASMYAWXKYQiCeeq03yiRpAq2aqhmMKQJ37FoAgjnGUiGPCBBUixJfGqLzq8EvZ95yMJrtaz6tmjeZVw+7lVcPm8qoZF/Oqwy/yfl51+DT1vGonapsi8rzqZjSvupbR6zYna7AruIA5DR/tyT7L5V+qmcOs/G5lW+YQM+tLWvazDrQ0g2tp0pCWZshaae6bs4a0VOjiwXfjSbMMk7pX8Vqak2ppzsnKL49oac4SoAhyMcMXo7HFBsISBdEQF48uWGJw+ArdxCDD6XpxFDHJQF+JG3tbYvB6qGwYPpK7FWmsrpInBgW+ICBdYqVJrAK0YU7Xh98gX10HRAE9gOsIs4TlI0WYjSikLGUislPMjI3ynEvQiX+MSLy53YVE4KNJqUi0IhWz7vpaBamQJWV3ioPMbXLaB5zQPiqiE8CKLL5URyTYIu2DtNzP0n6Xe3J/k5z2CSe0D5IWgpf7oIL5iLsq9+L7b4ffqnb/LYz+zzyD+yWYJ4GEdDH4awswTBSFK+q4RNn2tbiiThLr0xQIqH22+tVMygQsbl6UlLmDwDZB5B6TRFqqSd+P6iKcoMRiFt3jcjuQd2IHBOFqHmLl5FQilU50uF2aoP3fbCD8XrkNxqLsFBUIzoK+V2HPIdninkMW33PISPcc8kQePaBxjCsPacKtfQoKrM8S7VMcXrGTgqom1I2P8HsOhAKSTgq3ijli4zRIbJxm+AUV+J7mksq+EGeLdehqcDHau+qvnvcv3//4zfzlUw05aFjSFic6sKX2s4+f++JD8olaryAmDnSptCJZolPeHNND7vf6yZaY++XNMbLemPvmuN60v6NbkQTFHhxOx8UKvCGNWd+E4PBGk5qnWs7u/q5l6fwtGp1tQDPxf8z0/RF0TYT4qBDtAKP14a8x4F8lzFiYmQH8xI7lZFoYPqJix51fiUDUHZ1RCkFgojNKw9+QJ2jiCDljNDlngX/L0cKrU+p24+TCK8YFXHGbAmBrkrjsoErcylfLcoY4ZnXiXDYTX2jLFA/AxeF3ooPCVuSicCb17EEIdeQhCLuphK16gTi6f9tBhAQBNMd6tdirdNi9SodFYp6R0+HPWC0n+E0HuVtKcBJjSlSZk2piFkJnCrS8eVnlF3qYobYcB8R2stjBseGndI24JJM0a8R/xYD/F7VCl6yK4/Zk+SjEAbVmDg4hJp0fQkzWh38HDDi2PbiG2M3vbFBr6RJdBxCFZknkAJayAsKlIcJZcmcTYk1ree/q7Yixjp44T69wrJY4CR6T2XtceyPKx2rjihbfMlNIyeIn0APwBHpJ9JsSykeQ40q2rxONgqIaDimISnEQAsSdVYzIm3WS9TFNI+UgIkCdbpL/RlxTFWty4kCLW1yc3vovv//m7W+q/Nj1VfCrXnr85j2f/7d18omIDaSwrP/ACSvBO6BNQtex9KSWo5kO4ubqGPUhIb1GCuxL1ou/hN3uvfQUag+I36SIKbg5zCGQSM26A5X7J6MtJgFDeBIwLk0COtoGSpKrkQjZeQ/tytlJtlTRaeohEjZxW4+lZ4MkIIe1ZRuJe2vJPnBvLbsf3FtwpLQhtK9vObcQRaOhDrK8zFmGMkRkKMP6CxJ2+fTSNxALEsKaBCilD1JKH6JWz2FUbSPuqW1CqrZJcrOE1j9KzhOknEdJOY+J5Bz6axuVOynmRSACFMadJMYREcY4ncKi+OL1mFPuVPBltj5IbA1JGqZIfekIm36cpo16WKncoApXFZ38VAyfzpKdUl1VRClZis6HxoZbcbRJssEdpbEJUv5jpPzH9T0TlARUBJ2L/hqp6N/E5n2HcdEfmV/RH2mLvkT0Rzwu+u8wKPojUtE/wuZ9v3HRXz+/or++LfoS0V/vcdF/PyX6QUo+OzXqZmFTIztalq6TGg2goroc1t6VX5gOrvJ9whhJYI2uztEQtAUhveA9CuWOMCxh05E9wICScVl9YCeRk12NyrZqOTBi+z8tL0UTu5VtCorXqZ0b7Kwv/d9sk/BTOscENctSYvra1+n+McFO8pggnkIXCC04zWbGLLYBLjKAeM1Qw1d/HZVjtDKI2TOh7n+LgX5UpS5IXYtCCmFsRLXEBzGlj2ubUt7FbhOD/o68wCdK1IrqnCiyNPAmTxRhoW+4xdA3hoe+ndLQ11T8YgkmOC2JQTqo01ap5idCbqM2Va/FXcFwqHp84KMbLnF9+/GhxN+t/N/vif6RfCKLQEWakiX01FG7pw42xQ0ZYCs0iTblokHV3zUknokZw8b6orMJpCEcdrw77W+imPA2Rtq/KIIJrsIXCQfEhJFcBAxvGJ/GgPrS/57jzv8H5FMJb0wgBgA=",
428
+ "debug_symbols": "vb3djuU8cqZ7L33sA5FBxo9vZTAwPJ6eQQON9qDH3sCG4Xvfi0GJ75tVTqYytb594nr8dVU8WhQZksgQ9R9/+p9//h///r//6S9/+1//+n//9I//7T/+9D/+/pe//vUv//uf/vqv//LP//aXf/3b67/+x5+O8X/K0f/0j/IPrz/1T//Yx592/unnnzH/LMf5Zzn/rOefcv7Zzj/7+ecZr5zxyhmvnPHqGa+e8eoZr57x6hmvnvHqGa+e8eoZr57x5IwnZzw548kZT854csaTM56c8eSMJ2e8dsZrZ7x2xmtnvHbGa2e8dsZrZ7x2xmtnvH7G62e8fsbrZ7x+xutnvH7G62e8fsbrZzw94+kZT894esbTM56e8fSMp2c8PePpGc/OeHbGszOenfHsjGdnPDvj2RnPznh2xvMznp/x/IznZzw/4/kZz894fsbzM56f8eKMF2e8OOPFGS/OeHHGizNevOLZ+NPPPyP/rMdx/vmKV8qAeoFc8ApZ2oBXzOID9AK7wC+IE8ZAmfCKXMc/H0NlglzQLnhFrn2AXmAnjAFRdcAYoeN4xhCYYBf4BXHCGAYTXnYZP3AMhAlyQbtgRB6HOgbDBDthdH+JAa9/1WRAu6BfoBfYBX7B63ja+Oej208oF9QLxpk7BrQL+gXj5I9fkb17tEZ27wS5oF3QL9ALXsej+c/9gjhhdPMJr8haB9QL5IJXHB2/YvRlHadgdOYJ5YJ6gVzQLngdj404o0tPsAv8gtELh2J06wnlgvHPR9/IHjtO0+iy/moWGX12QrmgXiAXtAtecVwH6AV2gV8wIr8UMjrthBHZB9QL5IJ2wStylAGvOPH6OTKSeIyAo9NOkAvaBf0CvWAMoiP/vS+Ki0ZPPmkM0UMG1UWyaAzOow3KKOMIJS5qx6KyqC6SRWOsj8Euo3ufpIts0XCUPiguGn38db0bVBbVRbKoLeqLdFE6xrF0XxQX6bGoLKqLZFFb1BfpouXQ5dDlsOWw5bDlsOWw5bDlsOWw5bDlsOXw5fDl8OXw5fDl8OXw5fDl8OXw5YjliOWI5YjliOWI5YjliOWI5YjL0Y5jUVlUF8mitqgv0kW2yBctR1mOshxlOcpylOUoy1GWoyxHWY6yHHU56nLU5ajLUZejLkddjrocdTnqcshyyHLkSK51kCxqi4ZjXPzauDKdZIt8UVyU43zScMiIkuN8kixqi4ZDZJAusoty/EoblH9vRM6xOi6KLcfqJF8UF+VYnVQWjXitD5JFbVFfNBxt2HKsThqOllHiohyrk8qiukgWDce4KLYcq5N0kS0ajj5sOVaTcqx2G1QW1UWyaDjGRbXlWJ2ki2yRL4qLcqzqiJJjdVJdJIvSMXpOjtVJelLP0agxaPyLcYntOfIm9UXjWMZVtud4mxQX5XibNI5lXHt7jrdJsqgt6ot0Ud4aZhRfFBfleJs0HN4G1UWyaDi8D+qLdFE6hi3H27gq9xxv8bry9xxvk8qiukgWtUUjXoyjyrE1KS7KsTWpLKqLZFFb1BfpouVoy9GWoy9HX46+HH05+nL05ejL0ZejL0dfDl0OXQ5djhxbMfpQjq1J4xb+GC00xlEddxl9jKOTdJEt8kVx0RhHJ5VFdZEsWg5fDl8OT4cO8kXpGP0gjkVlUf6LV9/QI//XGFQW1UWyaBxBOQb1RbrIFo0jKHVQXDRGz0ll0XCM+ybNR59JbVFfpItsUTr6oLioHovKoqsltcqitqgv0kW2yBddZ0vlWFQWLYcshyyH5O/QQbrIFvmiOM+btmNRWVQXyaK2qJ9nVZsusot6u850t+tcdl8UF+nqB1quc6l1kSxa/UD7dS5VF9mi1Q80rvNmx6KyqF5ny2RRW9QvyrFQxi/Knl3HEWTPnlQW1UWyqC0a8WoZpItskS9Kx2vsW46PSWVROtogWdQW9UW6yBb5onS8fpvl+JhUFtVFGfnVkjb7uA3S8xdZ9thJvuhqIZNjUVlUz19p2WMntUV9kV6/N3vsJF8U1+/IHjupLFot1FYLtdVCbbVQ9tj8ldljJ/mi1UK9XG2QvbiONshePCkuyl48qSyqi2RRW9QX6aLl0OXQ5bDlsOWw5bDlsOWw5bDlsOWw5bDl8OXw5fDlmCPgNVZtjoCkcpJnjx0TPZ49dlJdNI5v3LN69thJfZEuskW+aHjb6yx49thJZVFdlJNZMqgt6ouGo7VBtsgXpeN1zj17+6SyqC5KxziqHAvNBtkiXxQX5VgYd76eY2HMJnmOhTGd5DkWJrVFfVHOwY3flmNhki+Ki3Is9PE7cgSMe2XPETDuhj1HQB9HkCNA8+/pIlvki+KicRd0UlmU84CjNcZd0EnDMe53vfdFusgW+aK4KEePjSg5eibVRbJoOGz8thw9k3TRcIz7Xc/RMykuytFjw5ajx0fr5uiZJIvaor5IFw2HjxbP0TMpLsrRM6ksqotkUVvUF+mi5fDl8OWI5ciRN+7MPa89k2RRno/RLnntmaSLbJEvipMiR/K4q48cyZPqIlnUFvVFuiiPecTLUTupLMp4NkgWtUV9kS6yRb4oLspRO6ksWo66HHU56nLU5ajLUZejLocshyyHLIcshyyHLIcshyyHLIcsR1uOthxtOdpytOVoy9GWoy1HW462HH05+nL05ejL0ZejL0dfjr4cfTn6cuhy6HLocuhy6HLocuhy6HLocuhy2HLYcthy2HLYcthy2HLYcthy2HL4cvhy+HL4cvhy+HL4cvhy+HL4csRyxHLEcsRyxHLEcsRyxHLEcsTlKMdxAAuwAgXYgB2oQAM6ELYCW4GtwFZgK7AV2ApsBbYCW4GtwlZhq7BV2CpsFbYKW4WtwlZhE9gENoFNYBPYBDaBTWAT2AS2BluDrcHWYGuwZVYYMykvVKABUzHWI49+AAtwKMZaygsF2IAdqEADOjAWZmY4sQBhU9gUNoVNYVPYFDaFzWAz2Aw2g81gM9gMNoPNYDPYHDaHzWFz2Bw2h81hc9gcNoctYAvYAraALWAL2AK2gC1gi2UrxwEswAoUYAN2oAIN6EDYCmwFtgJbga3AVmArsBXYCmwFtgpbha3CVmGrsFXYKmwVtgpbhU1gE9gENoFNYBPYBDaBTWAT2BpsDbYGW4OtwdZga7A12BpsDbYOW4cNuaQglxTkkoJcUpBLCnJJQS4pyCUFuaQglxTkkoJcUpBLCnJJQS4pyCUFuaQglxTkkoJcUpBLCnJJQS4pyCUFuaTMXKKJDoyFM5d4YgFWYNossQE7cNRQjLnikjUsFzpw1GgceTgjl1yYtkisQAGOao0xz1iytuVCBaatJzowLsxSlwsLsAIF2IBp00QFGtCBaRsNlfUvFxZgBQowbZLYgQrMSpeS6MBYWA9gAVagABuwAxUIW4WtwiawCWwCm8AmsAlsApvAJmnLXyyxMGtwTkxbS6xAATZgxs1T2DOCJRZgBWaEPBe9ATtQgRk3Eh0YC/UAjmBjIrJkMY4c8786MBbaASzAChwHWbOhrAE7UIEGdGAsHAP9wgKsQNgcNofNYXPYcqCPycuSpTxS87xFBQow4+bJyiF9ogIN6MC4MCuBLizAChRg2jSxAxVoQAfGwhzSJxZgBQoQtgJbga3AVmArsFXYKmwVtgpbha3CVmGrsFXYKmwCm8AmsAlsApvAJrAJbAKbwNZga7A12BpsDbYGW4OtwdZga7B12DpsHbYOW4etw9Zh67B12DpsCpvCprApbAqbwqawKWwKm8JmsBlsBpvBZrAZbAabwWawGWwOm8PmsDlsDpvD5rA5bA6bwxawBWwBW8AWsAVsAVvAFrDFsrXjABZgBQqwATtQgQZ0IGzIJQ25pCGXNOSShlzSkEsacklDLmnIJQ25pCGXNOSShlzSkEsacklDLmnIJQ25pCGXNOSShlySlU6v3JJYgQIctlGIVLLa6UIFDlsriQ6MhZlLTizAChRgA3agAmFrsDXYOmwdtg5b5pKx9lOyKOr8FZkJxspMyRKoCwXYgB2owHFkPeNmJjgxFmYmOHHYxspMyWKoCwU4bH3W6XegAtOWpzAzwYmxMDPBiWnLg8wx3z2xAxVowBFXsxPkmNdsvhzzmm2WY/7EChTgsGn+4hzzJyrQgGmbbyCkwhJT4YlZH34kZoX4/LsN2IEKNKADY2EO9LFWVLKc6sLV17Nk6kIDOjAW5jg+sQArUIANCFuFrcJWYauw5Ti2bJ1ZRj+xAgXYgB2oQAM6MBY22BpsDbYGW4Mtx/FYJytZZHWhAR0YC3McnzhsOYGZpVYXCrAB05bivCc40YDDlpOdWXElo+qxZMnVhQU4bJHHkJngxAYctlGV9UIFGtCBsTAzwYkFWIECbEDYDDaDzWAz2Bw2h81hc9gcNofNYXPYHDaHLWAL2AK2gC1gC9gCtoAtYItly4KxCwuwAgWYtpbYgWmbbyoZ0IGxMFNFznZk7djrNiSxAgXYgB2oQAOO11FymiVryE6cuSQPfV79539twA5UoAEdGAvn1X9iAVYgbAKbwCawCWwCm8DWYGuwNdgabA22BluDrcHWYGuwddg6bB22DluHrcPWYeuwddg6bAqbwqawKWwKm8KmsClsCpvCZrAZbAabwWawGWwGm8FmsBlsDpvD5rA5bA6bw+awOWyYf1CHLWAL2AK2gC1gC9gCtoAtYItls+MAFmAFCrABO1CBBnQgbAW2AluBrcBWYCuwFdgKbAW2AluFrcJWYUMuMeQSQy4x5BJDLjHkEkMuMeQSQy4x5BJDLjHkEkMuMeQSQy4x5BJDLjHkEkMuMeQSQy4x5BJDLjHkEkMuMeQSQy4x5BJDLjHkEkMuMeQSQy4x5BJDLjHkEkMuMeQSQy4x5BJDLjHkEkMuMeQSQy4x5BJDLjHkEkMuMeQSQy4x5BJDLjHkEkMuMeQSQy4x5BJDLjHkEkMuMeQSQy4x5BJDLjHkEkMuMeQSQy4x5BJDLjHkEkMuMeQSQy4x5BJDLnHkEkcuceQSRy5x5BJHLnHkEkcuceQSRy5x5BJHLnHkEkcuceQSRy5x5BJHLnHkEkcuceQSRy5x5BJHLnHkEq95vyOJCjSgA2PhyCUXFmAFCrABYRPYBDaBTWBrsDXYGmwNtgZbvlSc61lZLHmhAR0YC/P14hMLMG2aKMAG7EAFGjBt8/30WKgHMG2WWIECbMAOVKABfaFlME8UYAOOYKM0v2Sl5IUGdGAsHKniwnHoue6U9ZIXCrABO1CBBvSFkcHmO/sCbMAOVKABR7A6g8WFWSB5YQEOW46LrJG8sAGHLddbskzyQgOmbe4tkLZx5rN88jW9l1iAFSjABuzAtEWiAR0YC+sBLMAKFGADdiBsFbYKW4UtM4Fk82UmOLECh21sDVCyrPLCDlSgAR0YCzMTnFiAFQhbg63BNjcYyEOfWwxMdGAszExwYgFW4LC1I7EBh23UpJcstrzQgA6MhZkJThy2nsEyE5wowAYctp5NnZngRAMOW85lZuVl63no467iwgKsQAE2YAcq0IDDljORWYN5YqaKnJTMKswLK1CAw5azi1mJ2XJ2MUsxLzSgA2NhHMACTFsOp8wlJ6YtDz1zyYkKtBNrVmC2Ma1ZswLzwgoU4Iibey5kBeaFCjSgA2NhZg3PYJk1TqxAAQ7bmIGrWYF5oQKHbVSd16zAvDAWZtbwFGfWGCWENSsw25itq1mBeWEDdqACDZg2T4yFmTVOLMAKFGADdqACDQibwNZga7Bl1ohsvswaJzbgsEW2TmaNEw04bGPCqh5zc5LEuT3JxAKsQAE2YAcq0ICwddgUtswakacws8aJAmzADlSgAR0YCzM/RHaNzA8nNmAHZtwcOJkfTnRgLMz8cGIB1rF3SwbLLX5ObMAO1IGaaEAHxsDsk7nvz4kFmLYU5wZAJTtB7gFU8nTnNkAnKtCADowLs+yyj5KbmmWXF1agABuwAxVoQAfGwgJbga3AlptrldwWKPfXOrED0xaJBnRgLMwdt04swGGbOw/l1lsnNmAHDtu4TapzG64THThs4+21OvfjOrEA05bi3Jgrtyqae3Od2IEKNKADh03yvOVuXScWYAUKsAE7UIEGdCBsHbYOW+7oJXNXJwE2YNqyJXN3rxMN6MC0ZaPm1kfjbqXOzb1ObMAOVKABR9w2g8XC3PHrxAJMW56s3PrrxAZMmycq0IBpy3Ocm4FNzP3ATizAYcstn+ZGYLnp09wL7EQDOnDE7TlEMj/0bN/MD7kB1Nwd7EQBNmDa8hdnfjjRgA5M2/htWT/Zx21SzfrJnltJZf1kzx2jsn6y6/y7HahAAzowFmZSODFtkViB2aMssQN1YY5uyyPL0X2iAEcEm5uMdaACDejAWJijO+9WshDywgoU4LDljUsWQl6owGHL25kshOx5yc9CyBNzdJ9YgBUowAbsQAUaELYGW4ctR3feYGTR5IUCHLa8wZibl52oC3Obvrwez73MIs9QDt68bubuZXpkQ43Be6ENnBEcGAtzH7MTC7ACBdgGZve0DlSgAdOmibEw9z87MW35K3IPtBMF2IAdqEADpi2b2mNhHMACTFu2ZAiwAdOWjRoKtAuzaFJzZ78smtTc2y/LI3Xsz1CzPFJz774sj7xwRCgzggNjYTmABViBAhy2URhbszzyQgUacJ2LLI88sR7AdS6kVqAAG7ADFWjAdS6yPPJEOYAFOGxjmqVmeeSFDZi/TRIVmL8tW30M9Atj4RjoFw5bTdsY6CrZJGOgX9iAHahAAzpw2OYOiWOgX5hx89B7A3agrg7TDZhx87f1WKgHsAArUIANmLaMm5ngRAM6MHtfHlmO7rxpyOLGCxVoV97J4sYL83izG+XoPrEAK1CADdiBacu4ObpPdGAszAt2PnVkwaK2PAE5Yk80oAPjwixYvHAcb96XZMHihQJswLR5ogINmLbc9DJH98Qc3ScOW96BZMGijt0AahYsat6BZMHihR2oQAM6cNjyviQLFi8swAoUYAN2oAIN6EDYBDaBLUd3zzbL0X1iAw5b3vpkweKFBnRgLMzRfeKwaQbL0X2iABswbXmGcnSfaMBhy5mcLFjUvEXJgsULC7ACBdiAHThso2yt5oZvF6YtjyzH/MQc8ycW4LDlXVCWPOrY+KtmyeOFHahAAzowFubVP++YsuTxwrTloefV/8QG7MCMmz8oM8HEzAQnFuCIm/c7uenbhQ3YgQo04LDFDBYL8zp/YgGmLZsvr/MnNmDa8sxn1jjRgC+bHSnO3X7zliqrHy1vcrL68cIKFGADdqAObIkGdGAsLAewACtQgA3YgbAV2ApsJW2jzbI88sICHLa838nyyAsbsAMVaMBhG28K1SyPPHFkjQsLMG2eKMAGTNvc+VeBBhy2vPXJ8sgTR9a4sACHreZBjvxgeduRhZAXGtCBGTebr2fcnphxs816BQqwAdOWv7gr0IAOTFv+tpEULO81svrR8q4iqx8tr+hZ/Wgy/24HKtCADoyFIylcOGz57J/VjxeOuHndzDrHCw3owBG3ZeuMpHBhAVagABtw2PJimXWOFxrQgcOWV9Osc7ywAIctH/izzvHCBkxbiiNtebJy8+98cs86xwvjwqxzvLAAK3DY8oE/6xwv7MBhGysgNescL3RgLMykcGIBDls+mGed44UN2IHDljtIZ53jhQ4cttxHOuscLyzAtLVEATZgB6YtDzKHf14As87xwgKswIybzZfDf2wEVLPO0XIFJOscLzSgA4ctr5tZ53hhAVbgsOVlMYsbLa9vWdxoefnK4kbL5/ksbrSYfzcWZiY4sQArUIANOGz5aJ/FjRdm3DwGPYAFWIEZN1snh/+JHahAAzowxm7fGWwM/wsLsAJlYDbJuCe4sAN1oCUa0IFpS/FICp6z7lnG6PkskmWMFwqwATtQgcOWM95ZxnhhLIwDWIAVKMAG7EAFwhawxbJlGeOFaeuJFSjAtFliByrQgA6Mhbn1+okFWIEZ1xMVaEAHjrh5qcuCxQsLsAIF2IDDls/dWbB4oQEdmLbRH7Jg8cICHLZ87s6CxQsbcNjyWpgFi55Pwlmw6PnwmgWLF8bCkRQuLMAKzLh5kE2BBnRgLOwHsAArUIANCFuHrcPWYeuwKWwKm8KmsClsCpvCprApbAqbwZYDfVQv1KwxvNCBsTAH+okFWIECbMAOhM1hc9hyoOfqQ9YYXpi2HAE50E8UYEYYPygrBD2f0bNC8EIBNuA4slxyyArBCw3owHFkeQeSFYIXFmAFDlvegWSF4IUdqEADOjBt48dnheCFBViBacsfn4P3xA5UoAEdGAtz8J5YgBUIm8AmsOXgzRuirBC80IGxMAdvTgNkheCFFSjABuzAtGWr55A+0RfmiM0FmSz187GRYs1SvwsN6MA8yDwXOTZPLMAKzIO0xAbsQAXidCtOd47NiYbTbTjdhtOd1+4T05ZdOa/dJ+rCHIV5u5jlexcqcBxO3g1m+d6FsTBHYd4CZiWf5y1gVvJd2IEZN39mXlhPdGDGHUeWlXwXjp+Zt4tZyXehABuwAxVowGHLu8Gs5DsxR+yJBViBAmzADlSgAWErsFXYKmwVtgpbha3CVmGrsFXYKmwCm8AmsAlsApvAJrAJbAKbwNZga7A12BpsDbYGW4OtwdZga7B12DpsHbYOW4etw9Zh67B12DpsCpvCprApbAqbwqawKWwKm8JmsBlsBpvBZrAZbAabwWawGWwOm8PmsDlsDpvD5rA5bA5bZo185MpKvgsLMG1HogAbMG2WqEADpi2zRuaSgZL1fRcWYAUKsAE7UIEGdCBsBbbMGpFfWMr8kF9Cypq9Cx0YCzM/jAdHyZq9CytQgA04jnc8WUrW7F1oQAfGwswPJxZgBQqwAWET2AS2TArj4VWyUM/zO05ZqHdhBQqwATswFZZoQAfGwkwKJxZgBeaVIQ8yx/yJDoyFegALsALz0D2xATtQgQZ0YCzMMX9iAVYgbAabwWawGWwGm8HmsDlsDpvD5rA5bA6bw+awOWwBW8AWsAVsAVvAFrAFbAFbLFtW511YgBUowAbsQAUa0IGwFdgKbAW2AluBrcBWYCuwFdgKbBW2CluFrcJWYauwVdgqbBW2CpvAJrAJbAKbwCawCWwCm8AmsDXYGmwNtgZbg63B1mBrsDXYGmwjVUR+OC6r8y6swDZQEztQgQZ0YCwcCSRKBhsJ5MIKFOCwjdkkyUK9CxU4bPlxuSzUuzAWWtp6YgFWoADTlgdpGdcSHRgL/QBm3Egccccii+SehzEWWST3PLywAxU4bDV/8UgVF8bCkSouHLaavy1SkccbqcjDiVTk4Yz8EDL/rgEdGBfmRocXFmAFDtuYIZIs1Lsw445jyL0JY6yhSJbZXdiBCjSgA8fhjPUWyb0JLyzAChy28TEFyZK8Cztw2MaeOpIleRc6MBbKASzACkxbtoM0YAcqMBXjxGZBXbRsqBxZY8ZFsjLuwgoUYAN2YCqyoXKQnejAWJiDrOcx5CA7sQKHrWdD5SA7sQMVaEAHxsIcZD0bKgfZiRUowFSMU5jFVmPPieRG3ImV2IidOMD5/a6LC3ElJq+QV8gr5BXyCnmFvI28jbyNvI28+aWuLNKQ+b3Li/PvWLZPfq/r4k6sxEbsxHlsY9ZD5vcvL07veP6Q+Q3Mi9Pb8xjy23oXd+Lp9WQjduIA57fALi7ElViIpzeSO7ESG7ETB9gP4kJciYWYvE5eJ6+T18nr5A3yBnmDvEHegHd+EzPrS2R+FfPiSizEjbgTK7ERO3GAC3kLeQt5C3kLeQt5C3kLeQt5C3kreef4zX44v3d5cSGuxELciOfx1GQlNmInnt6RtOc3MC8uxNQOjdqhUTs0aodG7dCoHRq1Q5veMR6z0mpxIa7E1D5K7UNjudFYnl/JvJjaR6l9lNpHqX2U2kepfYzax6h9jNrHqH2M2seofYzax6h9jNrHqH2c2sepfZzax6l9gtonqH2C2ieofYLaJ6h9gtonqH2C2ifQPudXNE8uxGifTuO30/jtNH47jd9O47fT+O0H2qeXg7gQV2K0T68HcSGuxELciNE+83uaFxuxE1P7CLWPUPsItY9Q+wi1j1D7CLWPUPsItY9Q+zRqn0bt06h9GrVPp/bp1D6d2qdT+3Rqn07t06l9OrVPp/bp1D5K7aPUPkrto9Q+Su2j1D5K7aPUPkrto9Q+Ru1j1D5G7WPUPk7t49Q+Tu3j1D5O7ePUPk7t49Q+Tu3j1D5B7RPUPkHtE9Q+Qe0T1D5B7RPUPkHtE2gfPQ7iQlyJ0T5aDuJCXImFuBGjfbQosRE7MdpH60FciNE+WoW4EXdiJTZiJ6b2EWofofYRap85ljV/4xzLJyuxEadL8zfOsTx5juWTC/G8f87fO6/RJzfiTjzvYy3ZiB2c4+UYtauShUIX53i5uBDX5Iyf18GLG3En1uRsz7wOXuzEAfaDuBBXYiFuxJ2YvE5eJ2/M+HnuYv79bJMwYieOxVn/Mz61lFyIK7EQN+JOPL2RbMROHOByEBfiSizgnF/IlYis8LmwAscjay4/ZIVPjFfSJCt8LlSgAR0YC3N+4cQCrEABwpbzC7l4kBU+FxrQgbGwHcACrEABNiBsDbYGW4OtwdZh67B12DpsHbYOW4etw9Zh67ApbAqbwqawKWwKm8KmsClsCpvBZrAZbAabwWawGWwGm8FmsDlsDpvD5rA5bA6bw+awOWwOW8AWsAVsAVvAFrAFbAFbwBbLlluSXViAFSjABuxABRrQgbAV2ApsBbYCW4GtwFZgK7AV2ApsFbYKW4WtwlZhq7BV2CpsFbYKm8AmsAlsApvAhlziyCWOXOLIJY5c4sgljlziyCWOXOLIJY5c4sgljlziyCWOXOLIJY5c4sgljlziyCWOXOLIJY5c4sgljlziyCWOXOLIJY5c4sgljlziyCWOXOLIJY5c4sgljlziyCWOXOLIJY5c4sgljlziyCWOXOLIJY5c4sgljlziyCWOXOLIJY5c4sgljlziyCWOXOLIJY5c4sgljlziyCWOXOLIJY5cEsglgVwSyCWBXBLIJYFcEsglgVwSyCWBXBLIJYFcEsglgVwSyCWBXBLIJYFcEsglgVwSyCWBXBLIJYFcEsglgVwSyCWBXBLIJYFcEsglgVwSyCWBXBIzl3hiByowbZLowFjY5j3akVyIK7EQN+JOrMRG7MQB7uTt5O3k7eTt5O3k7eTt5O3k7eRV8ip5lbxKXiWvklfJq+RV8ip5jbxGXiOvkdfIa+Q18hp5jbxGXievk9fJ6+R18jp5nbxOXievkzfIG+QN8gZ5g7xB3iBvkDfIG8vbjuMgLsSVWIgbcSdWYiN2YvIW8hbyFvIW8hbyFvIW8hbyFvIW8lbyVvJW8lbyVvLW6a3JSmzEThxgOYgLcSUW4kZMXiGvkFfIK+Rt5G3kbeRt5G3k7WudsB09wHoQF+JKLMSNuBMrsRGTV8lr5DXyGnmNvEZeI6+R18hr5DXyOnmdvE5eJ2+stcp2nGtok+ca2vw7QtyI19pdO0KJjdiJ19rdaxnsIC7ElViIG3EnVmJ4y5z/G0X8rZQ1B9ZKUWIjduI1B9ZKPYgLcSVec2Ct1EbciZV4zvPlcZ7zfJMDfM7zTS7ElTi9kb9xzvmd3ImVOL2Rxzzn/E4O8JzzO7kQV2IhbsSdWInJ28jbyDvXASLbZ64DnFyJhXh6e3InVmIjduIAz/wwajxbmfnh5Eo8Y1ry/Lc+eI7xkwtxJZ7HnOdrjvGTO7ESj2POXQBaVkItDnCO8Yupbzj1jXNNYHIj7sRKbOgnc03g5ADPXHHyrC/INpm54mRZnBuFjU8qDM4xaGO+s2Vd0mIjduIA14O4JGtyJRbiRjy9nqzERjy9kRxgOYgLcSUW4kac3vHSactapcVG7OA2XdlubdV9tIp1sFaxDtYq1sFaPdfBJiuxEa91jFbPdbDkcx1sciGe3pYsxI14rWO0inWwVrEO1irWwVrVANtBXIjXOkar5/r25EbciadLBs973ZK/d97rntyJ856k5G+c97Qlf8u8pz25EFdiIW7EnViJjdiJ4ZXjIC7EOE6Z96gnO/GMM9pB5j3qyYV4Hr8lC3Ej7sRKbMROHOB5jzpe6G0y71FPrsRCnN5Rstlm3dnFSmzETpzemr993qOenN6a7TbvUU+efz+Pc95bnlyIK7EQN+JOrMRG7MTk7eTt5J3PuZK/az7njg032qwvOyR/13zOPTljSp7T+Zx7ciGuxELciDuxEk9vHtt8zpU8X/M5d5SLtllfdrQ8zvk82/LY5vPsyZ1YiY3YiQM8n1tHAWib9WIXN+JOrMRG7OA5lkdJaJM5Nlv+3jk2T3biWDxrxI7xAm+bNWIXV2IhbsSdWImN2IkDXMhbyFvIW8hbyFvIW8hbyFvIW8hbyVvJW8lbyVvJW8lbyVvJW8lbySvkFfIKeYW8Ql4hr5BXyCvkFfI28jbyNvI28jbyNvI28jbyNvI28nbydvJ28nbydvJ28nbydvJ28nbyKnmVvEpeJa+SV8mr5FXyKnmVvEZeI6+R18hr5DXyGnmNvEZeI6+T18nr5HXyOnmdvE5eJ6+T18kb5A3yBnmDvEHeIG+QN8gb5A14O+WrTvmqU77qlK865atO+apTvuqUrzrlq075qlO+6pSvOuWrTvmqU77qlK865atO+apTvuqUrzrlq075qlO+6pSvOuWrTvmqU77qlK865atO+apTvuqUrzrlq075qlO+6pSvOuWrTvmqU77qlK865atO+apTvuqUrzrlq075qlO+6pSvOuWrTvmqU77qZy7y5E6sxEbsxAE+c9HkQlyJhZi8Sl4lr5JXyavkNfIaeY28Rl4jr5HXyGvkNfIaeZ28Tl4nr5PXyevkdfI6eZ28Tt4gb5A3yBvkDfIGeYO8Qd4gb8Crx0FciCuxEDfiTqzERuzE5C3kLeQt5C3kLeQt5C3kLeQt5C3kreSt5K3kreSt5K3kreSt5K3kreQV8gp5hbxCXiGvkFfIK+QV8gp5G3kbeRt5G3kbeRt5G3kbeRt5G3k7eTt5O3k7eSlfKeUrpXyllK+U8pVSvlLKV0r5SilfKeUrpXyllK+U8pVSvlLKV0r5SilfKeUrpXyllK+U8pVSvlLKV0r5SilfKeUrnTlk7PjSdOaQ8R5bO2sVc41AZw45WYgbcSfWxWd9Ys7Vn/WJJzfiTqzERuzEAZ554ORCTN5C3kLeOcZzbt/mGB/b6DSbY/zkQlyJhbgRd2IlNmInJq+QV8g7x3iuKdgc4yc34unNNp9j/GQDz7F88oyT7TDH7MmdWImN2IkDPMfsyYW4EpO3k7eTt5N3jtnx7l2zOWZPDvAcayfP/z76ts0xdXIhrsRC3Ig7sRIbsROT18nr5HXyznsAz2Oe9wAnd2IlNmInDvAcvzkPbHP8npzesXFJszl+T27EnViJjdiJY7HPe4CTC3ElFuJG3ImnN5KN2IkDPMf+yYW4Eqc31zJ8jv2T0zvqZ5rPe4CTjdiJAzzzw8mFuBJPryY34k6sxEbsxAGe+eHk6c12m/nhZCFuxJ1YiY3YiQM888bJ5G3kbeSduSLXxbxjLHgvxJVYiBtxJ1ZiI3ZijEFX8ip5lbxKXsUYdO3ESmzETowx6DPnnIwx6DPnnExjwWgsGI0FU2IjdmIag05j0GkMOo1BJ6+T18nr5HUag05j0GkMBo3BoDEYNAbPnDOZxuDMOSfTGAwag0FjMDAG4ziIC3ElFmKMwTg6sRIbsRNjDEY5iAsxxkIUIW7EnViJjdiJMQajHsSFmLyVvJW8FeMxKxNLydqhLE1cXIkluSQ34k6sxEbsxAFuB3EhrsTkbeRt5G3TW5ON2IkD3A/iQlyJhbgRd2LydvJ28uqMn/1NG9pTO7ESU7sptZtSuxm1m1G7GbWbUbsZtZtRuxmdLyOvkdfI69RuTu3m1G5O7ebUbk7t5tRuTu3m1G5O5yvIG+QN8kZHO8eM05Lj4j5rCC8uxJVYiBtxJ1biefw92YkDXA7iQlyJhbgRd+Lp1WQjduLp9cH1IC7ElViIG3EnVmIjdmLyCnmFvGfeiOSMM9ay+6wJvDjAMz+cXIgrsRA34k6sxORt5G3knXmg5Pmd471k287xfrIRO3GA9SAuxJVYiPPfjvXuPmsILy7E+W/HVkZ91gperMRGnMc2PmvVZ63gyXMsnzzjZx+bY/nkPLaaxzbH8li/7sccyycrsRE78fTmeZ9j+eRCnF7JY857g4vTK3le5hgfW2/3MsfXWL/uZY6vk/MYxpp1n3V9Fwd4jouTC3ElFuJG3ImVmLyVvJW88xo61rv7rNm7uBMrsRE7cYDnGDm5EFdi8jbyNvLOsdCybec1cayb91mDd7EQN+JOPI8tz8W8frX87bNvT559++RCXImFuBF3YiU2YvIaeZ28sz/3/O2zP5+sxEbsxAGe/fnkQlyJZ8xsnzBiJ47FdV6nTi7ElViIG3EnVmIjhrfOa9DYHLvXeQ06uRHPmJGsxEbsxPlbRv1tn3V6Zcyn9Vmnd3Ej7sRKbMROHOB5rTm5EJNXyCvknWNqzJX1OsfU5DmmTi7ElViIG3EnVmIjJm8jbyfvHINja/A+6wAvFuLpzfM48/aYx+uz5q2MPa76rHm72IjnMeT5nf3W8nzNfnuyEDfiTqzERuzEsXjWvF1ciCsxvGc9WJnsxAGefWB8V6bPerCLK7EQN+JOrODZB8Y+5H3WjF1ciWfMltyIO7ESG7ETB3j2gZMLcSUmbydvJ28nbydvJ28nr5JXyavkVfIqeZW8Sl4lr5JXyWvkNfIaeY28Rl4jr5HXyGvkNfI6eZ28Tl4nr5PXyevkdfI6eZ28Qd4gb5A3yBvkDfIGeYO8Qd6Atx0HcSGuxELciDuxEhuxE5O3kLeQt5C3kLeQt5C3kLeQt5C3kLeSt5K3kreSt5K3kreSt5K3kreSV8gr5BXyCnmFvEJeIa+QV8gr5G3kbeRt5KV81ShfNcpXjfJVo3zVKF81yleN8lWjfNUoXzXKV43yVaN81ShfNcpXjfJVo3zVKF81yleN8lWjfNUoXzXKV43yVaN81ShfNcpXjfJVo3zVKF81yleN8lWjfNUoXzXKV43yVaN81ShfNcpXjfJVo3zVKF81ylftzFeebMQOnjlqzFf3WcN2cSVO13hfoM8atos7cbpGbX+fNWwXO3H+xlHP32etWhlfQOuzVu3iRpzxx/xwn7VqJ888EPl35vgd79T0Wd91sRGPv1+P/Lc5fuuY4+qzvuviklyTK7GA2+Se3Ig7sRIbsRMHuB/EhbgSk7eTt5NX57/NNtFKLMT5b/M+atZWXazERuzEAc5xcXEhrsRCTF4jr5HXyGvkNfI6eZ28Tl4nr5PXyevTm+fdjdiJAxwHcSGuxELciDsxeYO8Qd6Ad9ZWXVyIK7EQN+JOrMRG7MTkLeQt5C3kLdNbkxtxJ1bi6W3JThzgehAX4plb0jvH9ckOpmcBpWcBpWeBWRNVc/5t1kRdrMRG7MQBbgdxIa7EQkzeRt5G3kbeRt5G3k7eTt5O3k7eTt5O3k7eTt5O3k5eJa+SV8mr5FXyKnmVvEpeJa+S18hr5DXyGnmNvEZeI6+R18hr5HXyOnmdvE5eJ6+T18nr5HXyOnmDvEHeIG+QN8gb5A3yBnmDvAGvHQdxIa7EQtyIO7ESG7ETk7eQt5C3kLeQt5C3kLeQt5C3kLeQt5K3kreSt5K3kreSt5K3kreSt5JXyCvkFfIKeSlfGeUro3xllK+M8pVRvjLKV0b5yihfGeUro3xllK+M8pVRvjLKV0b5yihfGeUro3xllK+M8pVRvjLKV0b5yihfGeUro3xllK+M8pVRvjLKV0b5yihfGeUro3xllK+M8pVRvjLKV7PerOb6zqw3u7gTp2u889hnjdnFAZ45Ktd0Zo1ZzXWcWWN2sRA34uny5PyNkt6Zo2TGd+L0jq9V9FljVnP9ZdaYXZxeyZgzR7WMOXPUyRlzvFfYZ/3YPJ5ZP3ZxIZ7/tibnseWaxawHq+OjEH3Wg50888nJhbgSC3Ej7uCZB3KNY9ZxXdyI59/XZCU2YicO8MwDJxfiSizEjZi8Ql4hr5BXyNvI28jbyNvI28jbyNvI28jbyNvI28nbydvJ28nbydvJ28nbydvJ28mr5FXyKnmVvEpeJa+SV8mr5FXyGnmNvEZeI6+R18hr5DXyGnmNvE5eJ6+T18nr5HXyOnmdvE5eJ2+QN8gb5A3yBnmDvEHeIG+QN+CdNWAXF+JKLMSNuBMrsRE7MXkLeQt5C3kLeQt5C3kLeQt5C3kLeSt5K3kreSt5K3kpXwXlq6B8FZSvgvJVUL4KyldB+SooXwXlq6B8FZSvgvJVUL4KyldB+SooXwXlq6B8FZSvgvJVUL4KyldB+SooXwXlq6B8FZSvgvJVUL4KyldB+SooXwXlq6B8FZSvgvJVUL4KyldB+SooXwXlq6B8FZSvgvJVUL4KyldB+SooXwXlq6B8FZSvgvJVUL4KyldB+SooXwXlq6B8FZSvgvJVUL4KyldB+SooXwXlq6B8FZSvgvJVUL4KyldB+SooXwXlq0C+0gP5Sg/kKz2Qr/RAvtID+UoP5Cs9kK/0QL7SA/lKj4O8hbyFvIW8hbyFvIW8hbyFvIW8hbyVvJW8lbyVvJW8lbyVvJW8lbyVvEJeIa+QV8gr5BXyCnmFvEJeIW8jbyNvI28jbyNvI28jbyNvI28jbydvJ28nbydvJ28nbydvJ28nbyevklfJq+RV8ip5lbxKXiWvklfJa+Q18hp5jbxGXiOvkdfIa+Q18jp5nbxOXievk9fJ6+R18jp5nbxB3iBvkPfMV5HciDtxusb7fTr367s4FpdjPTdpOSqxEGf88dk5nXv0XazERuzEAZ556eRCXImFmLyFvIW8hbyFvIW8lbyVvJW8lbyVvJW8lbyVvJW8lbxCXiGvkFfIK+QV8gp5hbxCXiFvI28jbyNvI28jbyNvI28jbyNvI28nbydvJ28nbydvJ28nbydvJ28nr5JXyavkVfIqeZW8Sl4lr5JXyWvkNfIaeY28Rl4jr5HXyGvkNfI6eZ28Tl4nr5PXyevkdfI6eZ28Qd4gb5A3yBvkDfIGeYO8Qd6Ad9ZMXlyIK7EQN+JOrMRG7MTkpXxVKV9VyleV8lWlfFUpX1XKV5XyVaV8VSlfVcpXlfJVpXxVKV9VyleV8lWlfFUpX1XKV5XyVaV8VSlfVcpXlfJVpXxVKV9VyleV8lWlfFUpX1XKV5XyVaV8VSlfVcpXlfJVpXxVKV9VyleV8lWlfFUpX1XKV5XyVaV8VSlfVcpXlfJVpXxVKV9VyleV8lWlfFUpX1XKV5XyVaV8VSlfVcpXlfJVpXxVKV9VyleV8lWlfFUpX1XKV5XyVaV8VSlfVcpXlfJVpXxVKV9VyleV8lWlfFUpX1XKV5XyVaV8VSlfVcpXlfJVpXxVKV9VyleV8lWlfFUpXwnlK6F8JZSvhPKVUL4SyldC+UooXwnlK6F8JZSvhPKVUL4SyldC+UooXwnlK6F8JZSvhPKVUL4SyldC+UooXwnlK6F8JZSvhPKVUL4SyldC+UooXwnlK6F8JZSvhPKVUL4SyldC+UooXwnlK6F8JZSvhPKVUL4SyldC+UooXwnlK6F8JZSvhPKVUL4SyldC+UooXwnlK6F8JZSvhPKVUL4SyldC+UooXwnlK6F8JZSv5MxXluzEAT6f9WpyJRbiRtyJldiInTjA57PeZPI6eZ28Tl4nr5PXyevkdfIGeYO8Qd4gb5A3yBvkDfIGeQPedhzEhbgSC3Ej7sRKbMROTN5C3kLeQt5C3kLeQt5C3kLeQt5C3kreSt5K3kreSt5K3kreSt5K3kpeIa+QV8gr5BXyCnmFvEJeIa+Qt5G3kbeRt5G3kbeRt5G3kbeRt5G3k7eTt5O3k7evdWqdNcMXK3F6xx7+OmuGLw7wzFHj/RqdNcMXV+KMP96j0VkbfLERO3GA573TyYW4EgtxIyavkdfIa+Q18jp5nbxOXievk9fJ6+R18jp5nbwzt4x3iHTW+l5sxPPfRnIsnvtVXpzHPN6p0VkDfHEes0lyI+7E6bWebMROHOCZW04uxJVYiBtxJyZvIW8hbyFvJW8l78wtpslC3Ig7sRIbsRMHeOaWkwsxeYW8Ql4hr5BXyCvkFfI28jbyNvI28jbyNvI28s7cMr4voGft9MkBnrnl5OnNPjZzy8lC3Ig78eyr2cfOvDG5EOe/HfXwetZOn6zEecyjHl7P2umTAzzzxsmFuBILcSPuxEpMXiOvkdfJ6+R18jp5nbxOXievk9fJ6+QN8gZ5g7xB3iBvkDfIG+QN8ga8Z+30yYW4EgtxI+7ESmzETkzeQt5C3kLeQt5C3kLeQt5C3kLeQt5K3kreSt5K3kreSt5K3kreSt5KXiGvkFfIK+QV8gp5hbxCXiGvkLeRt5G3kbeRt5G3kbeRt5G3kbeRt5O3k7eTt5O3k7eTt5O3k7eTt5NXyavkVfIqeZW8Sl4lL+UrpXyllK+U8pVSvlLKV0r5SilfKeUrpXyllK+U8pVSvlLKV0r5SilfKeUrpXyllK+U8pVSvlLKV0r5SilfKeUrpXyllK+U8pVSvlLKV0r5SilfKeUro3xllK+M8pVRvjLKV0b5yihfGeUro3xllK+M8pVRvjLKV0b56qzBHu9w6VmDfbIST5cnB/jMUZOny5IrsRCna7zzpWfd9fgmlJ511ycbsRMHeOaokwtxJRbiRkxeIa+QV8gr5G3kbeRt5G3kbeRt5G3kbeRt5G3k7eTt5O3k7eSdOSry3M0cdbIST2+el5mjTg7wzFEnT2+e65mjThbiRjzjj/uxWUct4708nXXUF1diSc4+mTnn4k6sxJYsyZ6cvz1zjhz5G/0gLsSVWIgbcSdWYiN2YvLG9Ga7RSGuxELciDuxEhuxE8fiWXd9cSGuxNPbkxtxJ1ZiI3biAJeDuBBXYvIW8pbp9WQlNmInDnA9iAtxJRbiRkzeOr2RbMQOlkKcccZ7czrrt2W8E6ezfvtiI3biPP4y+u2s3764EFdiIW7EnViJjdiJydvJ28nbydvJ28nbp7clT2+ex27E05tt1QOsB3EhrsRCnN6cI5r12xcrsRGnd+x5pbN+++SZf05Ob83zPvPPyemVPEcz/5zcidMr2Q4z/5zsxOmVPJ6Zf04uxJVYiBtxJ1ZiI3Zi8gZ5g7xB3iBvkDfIG+QN8gZ5Z/4Z35/SWb8tY78snfXbF1diIW7EnViJjdiJA1zIW8hbyFvIW8hbyFvIW8hbyFvIW8lbyVvJW8lbyVvJW8lbyVvJW8kr5BXyCnmFvEJeIa+Qd+ar8V6Pzvrti9M73vHRWb99cSGuxOkd79TorN+Wln1j5quTldiInTjAM1+dPL2eXIlnbs/fMnPUyUqcrp6/a+aok9M19vvSWbN9cSGuxELciNOb61+zZvtiI3biAM8cdXIhrsRC3IjJO3NRb8kBnrno5EJciYW4Ec/4mqzERuzEAZ656OTpzb4xc9HJQjy9ea5nLjpZiY3YieNim7XZFxfiufZRkpXYiJ04wOfa1uRCXImFuBGTt5C3kLeQt5C3kreSt5K3kreSt5K3kreSt5K3klfIK+QV8gp5hbxCXiGvkFfIK+Rt5G3kbeRt5G3kbeRt5G3kbeRt5O3k7eTt5O3k7eTt5O3k7eTt5O3kVfIqeZW8Sl4lr5JXyavkVfIqeY28Rl4jr5HXyGvkNfIaeY28Rl4nr5PXyevkdfI6eZ28Tl4nr5M3yBvkDfIGeYO8Qd4gb5A3yBvwluMgLsTr3V4767FPbsRznW7+fSU24syBY89Gm/XYJ8/7opMzB86/P+9/xj6KNuuuL1bizLFjXdVm3fXFM34e27z/ObkQZ24fexXarLu+eHo1uRMr8fRGshOn1/L45/3PyYU4vZbHP+9/Tm7EnViJjdiJAzzvf8bapc2664srsRBPb7bJvP85WYmN2MHzHsay3eY9zMlG7MQBnvcwJxfiSizEjZi8Sl4lr5JXyWvkNfIaeY28Rl4j73kfkuf9vA+Z3InnMXhygOf9xsl5DJ79f95vnCzEjbgTK7ERO3EsnjXMFxfiSizEjbgTK7EROzF5C3kLeQt5C3kLeQt5C3kLeQt5C3kreSt5K3kreSt5K3kreSt5K3kreYW8Ql4hr5BXyCvkFfIKeYW8Qt5G3kbeRt5G3kbeRt5G3kbeRt5G3k7eTt5O3k7eTt5O3k7eTt5O3k5eJa+SV8mr5FXyKnmVvEpeJa+S18hr5DXyGnmNvEZeI6+R18hr5HXyOnmdvE5eJ6+T18nr5HXyOnmDvJSvKuWrSvmqUr6qlK8q5atK+apSvqqUr4TylVC+EspXQvlKKF8J5SuhfCWUr4TylVC+EspXQvlKKF8J5SuhfCWUr4TylVC+EspXQvlKKF8J5SuhfCWUr4TylVC+EspXQvlKKF8J5SuhfCWUr4TylVC+EspXQvlKKF8J5SuhfCWUr4TylVC+EspXQvlKKF8J5SuhfCWUr4TylVC+EspXQvlKznzVkoW4EU+XJhuxE0/XuAeQM0dNLsSVWIgbcf7G6MlKbMROnN7IY5g56uRCnN6x/mWzhrmN9SmbNcwXd2JNzviZoy524gBnjrq4EFdiIW7EnZi8Tl4nr5M3yBvkjem15OnNto1G3ImV2IidOBbPGuaLC3ElFuJG3ImV2IidmLyFvIW8hbyFvIW8hbyFvIW8hbyFvJW8lbyVvJW8maPa2APTZg3zxekd61M2a5gvduIAZ45qY+3GZg3z62iTK7EQN+JOrMRGPL2eHOA5tzP2vLKzbvlkIW7EnViJjdiJAzzndk4mbydvJ28nbydvJ28nbydvJ6+SV8mr5FXyKnmVvEpeJa+SV8lr5DXyGnmNvEZeI6+R18hr5DXyOnmdvE5eJ6+T18nr5HXyOnmdvEHeIG+QN8gb5A3yBnmDvEHegPeshT65EFdiIW7EnViJjdiJyVvIW8hbyFvIW8hbyFvIW8hbyFvIW8lbyVsxl3XWQp/ciDGXddZCn2zE09uSAzznok+eOSqSK7EQZ44a++/ZrHluY589mzXPFwc475cuLsSVWIgbcSdWYvI28jbydvJ28nbydvJ28nbydvJ28ur8+3mOtBMrcba/ZFvNfHLyPM5sczuIC3Ged5ksxHneJePPfHKyEk+vJzvx9I57qlnnfHEhnu1jyULciDuxEhuxEwd43vPUPJ55z3NyJRbi9M52m/c8JyuxEfvis1Y5vWet8slKnMc2vqtlsyb54kKcx5ZtO2uSL27EnViJjdiJAzzvT04uxOSt5K3kreSt5K3kreSt5BXyCnmFvEJeIa+QV8gr5BXyCnkbeRt5G3kbeRt5G3kbeRt5G3kbeTt5O3k7eTt5O3k7eTt5O3k7eTt5lbxKXiWvklfJq+RV8ip5lbxKXiOvkdfIa+Q18hp5jbxGXiOvkdfJ6+R18jp5nbxOXievk9fJ6+QN8gZ5g7xB3iBvkDfIG+QN8ga8syb54kJciYW4EXdiJTZiJyZvIW8hL+Uro3xllK+M8pVRvjLKV0b5yihfGeUro3xllK+M8pVRvjLKV0b5yihfGeUro3xllK+M8pVRvjLKV0b5yihfGeUro3xllK+M8pVRvjLKV0b5yihfGeUro3xllK+M8pVRvjLKV0b5yihfGeUro3xllK+M8pVRvrIzX1myEwf4zFGRXImFOF2jlsnmXtAXK3G6ck127gV9cYBnjjq5EFdiIW7EnViJyWvkNfI6eZ28M0eNd2xt1iq3lu02c9HJRjzjt+QZf9yTz1rliwtxJRbiRtyJldiIpzfP18xFybNW+eJCXImFuBF3YiU2YicmbyFvIW8hbyFvIW8hbyFvIW8hbyFvJW8lbyVvJW8lbyVvJW8lbyVvJa+QV8gr5BXyCnmFvEJeIa+QV8jbyNvI28jbyNvI28jbyNvI28jbyNvJ28nbydvJ28nbydvJ28nbydvJq+RV8ip5lbxKXiWvklfJq+RV8hp5jbxGXiOvkdfIa+Q18hp5jbxOXievk9fJ6+R18jp5nbxOXidvkDfIG+QN8gZ5g7xB3iAv5SunfBWUr4LyVVC+CspXQfkqKF8F5augfBWUr4LyVVC+CspXQfkqKF8F5augfBWUr4LyVVC+CspXQfkqKF8F5augfBWUr4LyVVC+CspXQfkqKF8F5augfBWUr4LyVVC+CspXQfkqKF8F5augfBWUr4LyVVC+CspXQflq1ja3sd+mzdrmi404XaNO2GY988WFuBILcSPuxEpsxPkbRz2wzdrmk2eOOrkQV2IhbsSdWImNmLxKXiOvkdfIa+Q18hp5jbxGXiOvkdfJ6+R18jp5nbxOXievk9fJ6+QN8gZ5g7xB3iBvkDfIG+QN8sby+qx5vrgQV2IhbsSdWImN2InJW8hbyFvIW8hbyFvIW8hbyFvIW8hbyVvJW8lbyVvJW8lbyVvJW8lbySvkFfIKeYW8Ql4hr5BXyCvkFfI28jbyNvI28jbyNvI28jbyNvI28nbydvJ28nbydvJ28nbydvJ28nbyKnmVvEpeJa+SV8mr5FXyKnmVvEZeI6+R18hr5DXyGnmNvEZeI6+T18nr5HXyOnmdvE5eJ6+T18kb5A3yBnmDvEHeIG+QN8gb5KV8VShfFcpXhfJVoXxVKF8VyleF8lWhfFUoXxXKV4XyVaF8VShfFcpXhfJVoXxVKF8VyleF8lWhfFUoXxXKV4XyVaF8VShfFcpXhfJVoXxVKF8VyleF8lWhfFUoXxXKV4XyVaF8VShfFcpXhfJVoXxVKF8VyleF8lWhfFUoXxXKV4XyVaF8VShfFcpXhfJVoXxVKF8VyleF8lWhfFUoXxXKV4XyVaF8VShfFcpXhfJVoXxVKF8VyleF8lWhfFUoXxXKV4XyVaF8VShfFcpXhfJVoXxVKF8VyleF8lWhfFUoXxXKV4XyVTnzlSU34k48XZHsxAGeOWrsS+blzEXzv9PfD/z9euaWyYW4EgtxHpsdyZ1YiY3YiQM8c8vJhbgSCzF5C3kLeQt5C3lnbhnvGvisx764EFdiIW7E05vtMHPLyUbsxOn1PIaZW04uxOkde4z4rMdu4/0On/XYF3fi9Hoez8wtJzvx9PbBM7ecXIgrsRA34k6sxEbsxOTt5O3k7eTt5O3knbll7IXisx77YiN24gDP3HJyIa7EQtyIyavkVfIqeZW8Rl4jr5HXyGvkNfIaeY28Rl4jr5PXyevkdfI6eZ28Tl4nr5PXyRvkDfIGeYO8815o7IHjsx774unN8TLvhU524lg867FbSHJ6R92pz3rsi4W4EXdiJTbi9I46VZ/12CfPfDXeEfNZd110/vdG3IlnfEs2YicO8MxLJ8/flb935qWThbgRd2IlNmInDvDMSyeTV8gr5BXyCnmFvEJeIa+Qt5G3kbeRt5G3kbeRt5G3kbeRt5G3k7eTt5O3k7eTt5O3k7eTt5O3k1fJq+RV8ip5lbxKXiWvklfJq+Q18hp5jbxGXiOvkdfIa+Q18hp5nbxOXievk9fJ6+R18jp5nbxO3iBvkDfIG+QN8gZ5A95ZC92PMfZnzXMfezH5rFXuo0bdZ63yxQGuB3FJbsmVWIhbck/uxEpsxE4cYDmIp1eTK7EQN2LNPDZy0awlPn97U2JqkzaPYf79APeDuBDPY8i27ULciNNbsp1zrF1sxE4c4BxrF6d37Cnks5a4lzwXOdZ6yTbPsdZLtpXOmNkOGmA7iAvxjJm/y+Yxj+varMXtJX9L9r3S8u9n37s4vTXbMPvexUpsxE4ci2dt7cWFeMYsyTNmTTZiJw7w7OcnF+L8vaMe0mfd7MWNuBMrsRE7cYDnWBg1kz5rYi/uxDNmTzZiJw7wHAsnF+JKLMQzpiY7cYDbjGnJhbgSC3Ej7sRKbOA5XkbNpM8a14uFeMaM5E6sxEbsxAGe4+Xk9Er2nzleJPvPHC8nN+JOrMRGnF7J/jPH1OQ5pk4uxJVYiBtxB/uBNnFqN6d2c8FvdGo3p3ZzajendnNqN6d2iwNtFQW/N6jdgtotqN2C2i2o3eZ4n78rqN0C7Tb3+L24EFdiIW7EM84Ya7M+to86ZJ/1sRdXYiGecXpyJ1ZiI3biAM9r4vh+us/62IsrsRA34k6sxNNrydPryQGeeeDkQlyJhXh6I7kTK7ERO3GAZ644uRA3nIuZE2Y7z5xwshE7MbXnvM6eXIgrsRDTeezUnp3ac+aNk504wErnUek8nnkjz4VSe555Y3InVmIjpvOo1J5G7WnUnmfemCzEdB6NzqPRecx71yPni2a968WFOOOPujKf9a4XZ/yW53Hmk5OV2IidOMAzn7Q8LzOfnFyJhbgRT2+21cwnJxuxE8fiWe96cSGuxDPOaKtZp9rHnmA+6077WLv3WXd6sRGnd6y5+6w7PXnmgZPTm3Ohs+70YiFuxJ1YiY14eltygGceOLkQV/yuHNdHPsvPOtKLAzzHdZ9ciCuxEDfiTpzHn3MLs470YicO8Bzvmr9xjve8V591pBcLcSPuxEpsxE4c4DneTyavklfJO8e7Zp+Z4/1kJTZiJw7wHO8npzfH46wpvTi9lv1tjnfLtp3j/fzvSpxey+PMZ9iLAzzvK04uxJVYiBvxK2bM0zuG+IljhF9YgBUowFe00BwcY3BfqEADDtvsEGNgT8za0QuHbexM5Fk5eqEA09YTO1CBBkybJqZtZIisDI08SVkYemEDduCImycii0Jj7BvkWRMalocz0kRY2kaWiDyZWRB6YQUKcNjyBGQx6IUKNGDa8nBGQoicj8/az/A8spEOImfUs/IzcsIyCz8v7EAFGtCBsbClLcWtAEdH1XyQnMWcFxuxEwc4E8LFhbgSC3EjJm8nbydvDmTNB7RZhHlx/v06/44R53HmTfIswjw5B/LFeZx58zyLMDVvgGcR5sWNOOPnzdIstrw4wDlgLy7ElViIG3EnVmLyOnmdvDH/bfbcmH8nu27E4lkYeXEhnsemyULciDvxPDZPNmInDnA51nmZhZEXV2IhbsSdeHoj2YidOMB5gdbx4oDPAkXNm5xZoHixEDfiTqzE6R3F+T4LFC8OcF6UL57ebLdWiYV4evM3zjF4shIbsRMHeI7Bk6c323+OwZOFuBFPV/aHvJhq3oTMIsOLG3EnVmIjduIAzzF4ciEmr5HXyDvHVN6wzeLAi+XimMV1mTdiFtddXImFuBF3YiU2YicOcCFvIW8h7+yf4/Iasyju4vm78u/USizEsx0iuRMrsRE7cYDlIC7ElViIySvkFfLOvj1uDmMWsOl4STxmAdvFRuzEeWya52724ZMLcSXOYxs3DTEL2C7uxEo8vdmG3YkDrAdxIa7E0+vJjbgTK3F6LdtkjoWTAzzHwsmFuBKn17Kt5lg4uRMr8fRKshMHeF6nTi7ElXh6sw3nderkTqzE09uTnTjAMb3ZnlGI6+JZPKZjY8CYBWA67oZiFoBdXImFuBF34jzOUeQQswDsYicO8BybY7OjmAVgF1fi6e3JjbgTK7ERO3GA59gcGyjFLAC7uBIL8XSN8zULrvTI/z7H18kBnuPr5EJciYW4EXdiJSZvJ+8cI0ee09nnjzyns8+PRZaYRVAXV2Ihnvn5SO7ESmzEThzg2edL9ofZ50ue69nnS7bh7PMlz+/s8yXPy+zzJ+fDWsy/H+A5eXJyIa7EQtyIO3E+JEYew5w8ifTOyZNRDBCzCKqPxfqYRU19bGYVs6ipj0XDmEVNF1diITbw7PNjQS1mYdLF81yX5Hmua7ITB3j24bHgGLPQ6OL5b1uyg+ckQ473WcDTLY9nTjKcXIgrsRBnm3ge85xMyLE/C3UuDvCcTDi5EGf8zAOzUOfiRtyJldiInXh6sx3mZMLJhbgSC3Ej7sRKPF3ZnnMCYfKcQDi5EFdiIW7EnViJjZi8Tt4g7xwLmd9mcc7FQtyIO7ESG7ETx+JZnHMxzukszrlYiBtxJ1biGX+Mu1mE00dBUcwinItnHE/uxEo8jz+SnXiO39FvZxHOxQX/dk5InizE5K3kreSdE5InO3GA54TkyRW/V+g3zkWHkymmUEyhmHNycv7GOTl5csVvnJOTJ9NvafRbGv2WRt5G3kbeTr+lUxt2asNObTgnJOfv7fQbz1yRrBRTKaZSzDNX5G88c8Xkjt84c8XJ9FuUfovSbzHyGnmNvEa/xagNjdrQqA2NXEYuJ5eTa+aKqMlC3Ig7sRIbsRPPPp/j67xuTi7ElViIG3EnzgnzvNbMjQovjsVzo8KLc2Elr0Fzo8KLhbgR9+SerMRG7MQBLgdxIa7EQtyIyVvIW8hbyFvIW8lbyVvJW8lbyVvJW2f8MUZm0c6R93WzaOfiTqzE8zg92YkD3A7iQlyJpzeSG3EnVmIjduIA9+mN//zPf/jTX//1X/753/7yr3/7p3/7+5///Kd//I/1H/7vn/7xv/3Hn/7PP//9z3/7tz/949/+/a9//Yc//T///Nd/z7/0f//PP/8t//y3f/776399jew//+1/vv58Bfxff/nrnwf95z/gXx+f/9MxcXv+6zHxuAKUQz6EKJ+HyC23MsLr168Ar1j87+vn/z4/s5P//pUlcABebv+GGGMrI4yb8k9/Q9scQ37XYB7Ea3xQiHo3RMklhQzxwk4hPp4M3RzFuCeeLWl0DFHuBrCRlObJLLoCvC4qHwL45keoXYfwekyyT0PE5yHq4df5fD0BHJ+GKJszWmu/2vJ1xx+fxticjvEN1DPE+FwmWrP+chibnllzsnQehgkNjv6xc4/HuGfndPtDxqePzh+i/vkP6ZsYFTFejxcrhn48irLpWq/uUFfPoEH2awj7PESUqzVfS0L4HRb3I8QaYkfpn4fYdc/a6upaHYOkffwdddM7X0lhNcVrwvDTw6ibpKm5vjPPiNJZfV2EP8bYdM/x6csrhtf4PMame9Z2dYzXYyRF+GHHiM87xrZ7+mqM11PfZyE2g2S88bkyX/98kNRN5xq7K54xxqaCNNr1Ywx/PNBqPB5ocjwdaNsI9waa1McDTeT5QJP2fKBJfz7QRJ8OtNsd4/OBtu+etwbadpRYvy5oY4uvT0dJOx6PklYej5JWn46SbYR7o6S1x6Ok9eejpOnzUdLs+Shp/nSU3O4Yn4+Sffd8Pkq8X0cxNsn6dJT0+niUdHk8Snp7Okq2Ee6Nkq6PR0m356Ok+/NR0uP5KNHj6Si53TE+HyX77vl4lIx9ea67tmNzx6XtcRfX/rSLbyPc6+Jqj7u4+vMurvG8i9vxvItbedrFb3eMze3Stn+2tvpnt8+fCHYxctf6GeM1Q/xpDNt0L+9ris138xCm27mMa5Lstfh2fDoTsf0t+RWYeRyv2dbPf4s/Hq8WT8frNsK98erl8Xj1+ny8ujwfr96ej1fvT8fr7Y7xw/HK/ZPn/L4zXpuuCfHmn49Xj4cz4nE8nRLf/ozerhDjzcvPH9N2cyq6MtdQfzanEvL4HjaeX+Dj8QU+nl/g4/kFPt5wgY83XODL8YYrfDkeX+Lj+SV+30EfTz16XL9jlGt+Pj9/9N36kwfWn+gKL7/Moh5vmKI/ns/RH2+YpD+ez9KX8oZp+lLeME9fyhsm6kt5PlN/vGGq/nZPrX3TU7dBpCGIfR5ktxh099fsYohZw5XWPl20LbslpbuLpmW3qHR72bSW5+um+5Njq6eJyyYX1e3UfVmJ9TUQD/188bQ+v/iX+vjqvw9xM6XV59f/Ut9wA1DqO+4A5B13APL4DuB+B9kkgfrFMtOBvsrt+ltf3YYx0xUmdFcvsJvOj5Vga6F+8uuD+nYMt1TMR5Cix+djWOz54BN/PPi2IW4OvnY8H3zblYW7g2+3ZHR78DV5w+DbrjzdG3xif+z9xKt7ttVT6ZL1W09tb+ip7XlPbW/oqf0NPbW/o6f2d/TU/o6e2p/31PaH91TKqVF+duf7+perHqzWTXfvz6tMSn9eZlL0cZ3JPsTNIaPPK02KvqHUpOgbak2KvqHYJHdcfThk+vNyky866tPZlfG2zNXHxDazK7sFKcuXhOdqfGj9/L5styJVyjq5RaJ9fl+2bRA5VoPI8cNGlTW9rELPZ79VYu5SqtlaDTKa2/0tRn+eQXarUndLQvV5BtmtPdzNILs1pdsZxI83ZJDd0tTtDLJbnLqZQW53kE0G2XdU7eio8rMY7ld71DiOT2P4rkCqr+kZ7dF+GGOVzm1j7H/LWhqqUTe/5fH66T7E3ULs7WSVXytt9ZUWPx10semlbQ2X1jcRnq/jlu06xN2hv1tiKsXt6uqv6UZ6CeW3cRu7Od7XXNsK85pULJswmxvmvlZSe22fD/94XMt39yikbEJs2yPn98/2KN0+bY+6W6zyQAlGOJ+b+kuQ3YL/qy3XuOlVy+ZYdisBurpb1YZj0e8cSW4qfB5Jb3VzJLs+W9dtxGu28PN+8p1j0d2x7MN4RxjXn4bx9TbZeBn7+HmYijASPw1j67ozQm56zG4V6zWLU3HvKj87T7dfN3m+irUPYeuysf0p237r1G/lp/1WD/RbLeWnp1h7QZjYJKji7zg78fzsxPOzs28RQafXvhmC29ejsLb3WqArn6XJ/RtWdU20OJXyfCvEmt9Ut89CfHEJq+s9xBfrrj308b3S9hYlcKNTQvrmQHarWA0/p9nm7uL+jfDn5WL796TWe8N1M9O6fxbH87z450exu4dtKxm9Tszn84p196qUlLIWsl995PMDeb7YWuXxYus+xL1niyrPF1urvGGxtcobFltre8Nia22PF1vvd5BNiea+o7ayOurmDcltjN6v9pBu+sMYLR7HMEWdpsYPYzRbMfrnMXbrTjcnJ76IcWtyYv9bcLmUD5fLn8bo5WcxdC3Ei29+y/YNGcctc7Td6Jfdag9Se6GXJX87kP785O5jPD+5r0zha+WqH58fxy6lZpOfNzKUQL7XqHWNutaOzxt1t+zU+qrQts251U0+lVhT+RJ189C6W7pqmKxph21u/XdrV3XdLdfOx9G/0R6rgq23Y3Nadj+lr1ceW7fPa/rqdt3q3rpE1efFAFUfFwPsQ9y8jbHnxQDV3lAMUO0NxQA5H/T4NsYeFwPc7yCb25h9R721LrGPcW9dotobLtv747i1plD9cSnAPsTNAXP/p2z2SJCHT4X7VKh1XSptU9P0RT5d7dF091jo21ree/XNuRTz6Xi5Wd9cfbcacLO+ufr2tYB79c3bhu14VO7VNg27Wza610l2EW6fmt3rK7dPzW756vap2c0NvefU1KAFn92psT9y/Pa2EnPvx+ZWZveildR1tZPKZRrfCYF3LT5Ui3wIIbt1K75rf60CfHYU29ZAInotzvinrSH7NatY88JKr0Hr/RClKVZUaCVkFGzfD9JpdYfu2r8XpNVAENkE2WXVKFioHRuI/+jcxBp1enjfnJvd66rr2t2EfszrAf5DiO2GfbeWJPdHsV5YbXRj9/tR1KedfRtiFPHjdpkv3t8K4oEXCj7c2n2jPdYcRj92Z0X/0BCvNhDcllnvn7aHvqNR9XmjbseL5hsc5+0yzfp9685MTbC1pPafBvE1ckPKz4LYsSZC7fjpjaYGqiOLfn61k9ofD736hntVqW+4V5X6hntVqX/0vapljd48N3VzJyK716xKt46FatPP7kW+CuJUF/H53chu6s5Q/2JWZPNzNrer/VgTb71wCf0v1byyW2SqRVF8Vj59fpfdln73JhFlt07VcqbzvPZ+qO6ovwTx7TKErOluqZsg23Lvw2nk1M8XmaVtX7puKxG8uH6+RPzF0chaJnrxpmpLdm9bCa3PtM9nRrcjENs6W0T9vMvu3rW6uTor7Xm5tbTH5db7EDd3Bm3Py62lvaHcWvobyq2lv6HcWvrjcuv7HSQ2HaQ9Xp3dx7i3OvtFjFurs/sY91Znv4hxa3VWtjv+3VvA+yLGrWne/W+5tzp7P8bnq7P7GPdWZ2W7udvN1dntgdxcnRV9/l7AFzGen9ybq7Oy2/vv7urs/kDurc7Kbsnq5o3VbsHq7uqs7Bas7q7OynbB6tbq7L49bq3Ofnn73un2XT67fTd7/JC3391AV+1f2Od93d6wQ/rz9Sp5w3qV+Bs2Sfd37JLu79gm3d+xT7o/fnX1fgfZ3AltHxDrapDXSfr8TsjfcNXePQm95eFO23oH5jU7K5+fmN27VjcT2faJ+WYi252X7DzzMNrRfnZu23ocq31zFxPPH/53C1W3r1G7t6xeF6aVk48oPw1y70LXdpsC3uwf8bx/bD9ocmD3HHrkr9+ZaA5BQo3WfjZbHQ3zIPw9qF8/k/B8UvWL4yhBP6b/bD3jbovUd7RI/MErPPda5KstozBbdkj5fK+ntv3A1L1yt1ae7/GfKe/Z3dA+xM1vYZTn2/y38oZ9/lt5w0b/rbxhp/9WH2/1f7+DbL6Ise+ot8rd9jHulbu13XZvNx+3v4hx667si99yq2Su1cdbre5D3B10t3/K593j+YtU+4SKd73LoR92rP5luGzXMtu6O9RO76eNFYSPQXYFgLI+BDY+HLwJssuHx9pvP16r1ZsguyXRhnt/dJH6ykgfQ2z3/V8rTFVppuxbQV63p+tAQndBNkm1Y6e3Xmmtq3zrQBwHEp8fyBd9TTv1Nf98Q6C23Q/w3lRG2y1Q3b14N3mcR7Yh7n7Iqj+/eDd9w8V7+x2quxfv9obXqVt7/Dr1/Q6yuXhv3/y7N5XRtrsB3rxobo/j3pp72+0FeO+xu+1ehrq75t52X6S6Oy3Tdt+kujst03bvVN177N436q3H7v25vTcts49xb1qmbV+outc/VJ5Py7TdAtXdaZkvgtycltm+EnGvf2wb9Vb/+Gpz5G4rtRt/J+GXa+72aw33ts/bh7i1e17bfpzq5mO7veHKb8+v/PaGK7+94cpv77jy2zuu/PaOK789v/LbG678+45677F9G+PmY/v2K1U3H9v3Me7dgex/y73Hdn9cQ7UPcXfQ3f4pn3eP/UaANx7bv0imd7Y/ae94D2obxCu+/934q8S/bBO7D2IrB7nJ53vNbuuPjwO1tsehm8+I76M4PiVQjs8/Pdji+dvULZ6/Td3i8dvU+xA3PyJ7PH+buh9veJu6H294m7ofb3ibuh+P36a+30E216l4/jb1Psa961Q/nm+k8kWMe9epeP5Gdi/l6aDbh7h5nbr/Uz7/0vB+eerOG53bfFqwo9yLP/80ZC/P82kvz/NpL/781L4hn9Y35NP6jnxa35FP6zvyaX2cT/sbPmv2RUe9lU/3MW7m0/o8F35xHPdyoTyu9tuHuDlgyhtyocgfmgtrYMiJ1B/eoTa8SH20Gj+Ngg2Rj9Y//6R0371FdfP1mi7Pv0vdJZ53s+cbq/f2fEvzvl13uJuX2xs+Tt3bG75O3dvjz1Pf7yCbvLzvqLder9nHuPd6zRcxbr1es49x7/WaL2Lcer2m71em7t2zv2F1a/9b7r1ecz/G5ysg+xj3Xq/pu4Wpu6/XbA/k5us1/Q3vTvU3vDv1xW+59XpN362i3H29Zn8g916v6fp4DbXvPlJ1d42s71am7i5v9d1mbveWt/btcW/zw914eZ3Q9Xz5etTc3MfY0zKq/XEI3r4usnvO3S493Kts6fa8LLXb47LUfYib91P2vCy12xvKUru9oSy12xvKUrs/Lku930E291O2fX3qVmVLf8O60v447lW29N3LUzez8m5dqZW1atA+vP3wS1FK3+7217HLlnyeULfHcbPCpvv2bVT6RseHj2v0+0Hulun03brQ3TKdbZD7+2v07YZ/r+duJJJ2yI/D8DYdm+//9N2mf/dbZldKRc8i8flp3jfu3e1C+m6R6d52IfsQt36M7pap3hDi3k3RPoStEB8+pfSNs3J38OluhepuF9OjP2/S/rxJ+9Mm3bbGW5r0firScrwjFX0V5mYq0lLf0E92r8rc7SftHalIS3+aivYh7v2Y3VrEG0LcHDfbEPdSke+/fbQ+uy27cbNdq7p9R9KfPmzu7zbv1druY9yrtdX6+I5Vqz6fR9DdU+/dWtsvgtybjNDtnn/3Ont93D++k1E3e7Btk+HdkSvPbyLkHT9me5N5c5poX6Ry58fs+pijo/rhnxd16W4d4mYRgsrzHVS0PV5T3Ye4Nzmj7fkOKtresIOKtjfsoKLtDTuoaHu8g8r9DvL55MwXHfVWEcI+xr0iBN1u8ndvDeGLGLcmib74LbcKGbQ/rvjfh7g56O7/lM+7R9c/cLLby3EdhJdNGYNuv0h1b6pb+xuyqT7PpvqGbKpvyKb6jmyq78im+o5sqs+zaX9DNt2+5ndvqlv1+Uro/jjuTXXr8/39dPtBqroqB7Tu+sf2g1R35wye7++nz/f325+We8+E+xg3nwl3S1R3T2284Zlwt0B1+5lwH+TmM6HX5/3D/8gFai9rxwMvtIHDb8vCuyF37+XLfYhbL1+q2/PnH39e7Kf+uNhvH+LmFTueF/tpvKHYT+MNxX4abyj203hc7He/g2yu2PuOeu/5Zxvj5vNPPK+h+iLGvTuH/W+59fxjuzen7g26fYibg+7+T7HPf0p/+PzzRTK98/Kl7T5CZehfFuXzZyjbvfF0s/zajufPUFYeP0PtQ9zrHFaeP0NZecMzlJU3PENZecMzlJXHz1D3O0hshty2o94qv97HuFd+/UWMW+XX+xj3yq+/iHGr/Nrq81f7v4hx6+qy/y33yq/vx/j8AWgf4175te1em7pbfr09kJvl1ybPp06/iPH85N4sv7bdi1N3y6/3B3Kv/Nrk8bKpyRuWTU3esOJp8nj3qX173Nt96nj8ZLoPcevJ1Nrz3XytPS+btva4bHof4uZ9UHteNm3tDWXT1t5QNm3tDWXT1h+XTd/vIJv7oPZ8N999jHtPptaf7+b7RYx7l5f2fDdf6/Z80D3fidf60y19vkiEt54qteyeKtduPK/u9flLKLZbirr7VKlvyKb6PJvqG7KpviGb6juyqb4jm+o7sqk9z6b6hmy676j3niq3MW4+Ve5j3Huq3Ma4+VS5j3HvqXK7k9/NK8M+xr0rw/a33HyqvB1j81S5jXHzqXK3EHX7qXK7FejNp0p/w2Xf2x97cu8+VW7flrr7VLk9kJtPlbu1pJtPlXG84alytx51+6ny+aem9u1xb83UHz9V7kPce6p8wyZ+9oZN/Oz5Jn72hk38/A2b+Pk7NvHzd2zi5+/YxM+fb+Jnb9jEz96wiZ+9YRM/f8Mmfv6GTfzsDZv4+fNN/PwNm/jZGzbx8+eb+PnjJ1PfLURZ1qPPJ1P9sAn5Lx//6o+vC/sQt64Lvvu81M3rgu928Lt5XfD6vIvW513Ut9/9u3ld2O3ed/u6sHuB5/Z1Yfde1O3rwq7o69514X4HCfthR711XdjHuHld2H0C+e51YR/j1nXhi99y77ogjyel9iFuDrrtx6Wqoxj4w0YPv8TYLUOt4dL6JsLzqTHfvvByd+i37Yt3hb6TWZTHbf0lzG4f8lhXBw+vmyC7p/1esbVir/p5CazvlhuqrnapSu9m63eOJLdMPY+kb17w9t2rUaUa3r492uf57BvHortj2Yehr6n3D68DfiuMYxPN7uX4eRjs2cIT7t8MYytBjpCbHtN3D1eCaSYJ+dl5uj0E+jservrjh6t9CFtJctceu5/yjdG8W6S6OZr3R3J7NPe7u/scu1aJN6SEb/ygXUr4IszdlLAPczslfBXmZkrYh7mdEnZrV/dTwv7i6viCVD2Oz5PCbvmq5AcIZ5Rmmz5z/xbu89vix5v9ffEQeet52OrDg9hGUF+jR512O/n1oylfBFkdRIOemb4VxI71hTE7XDZBdpVVdV0zpMpnHzr/IsTaXUc+zA/8EuJmvdvnnznfN2lEoDU2Tbp9AerecexC3P28j2+XrtRowyIEGbvSfAyyu5U9Vi6rvOnR70F21/K6Pu/zeviJz4Nse2pdK8ZW+fOzv50bff5ovo2Rn/070ztl99p/DbL7ru9Ky0prV2NB7XYIXZ8XVrpP+z3E7qd0um7S4tXvP2XbHjUQRD4Psn2b6vVwvu4Eopj/ZPhajZXMOn0++vcusp3FXs2q8sMzs2oKVNtPQ6xpl6afh9h9YfB2EtkGOY5Vl3DQ+P8tSGxvOTFtIlI+Hf+xXcO6mYniKH90Jop1JMbf0/61m8VuEetmpVbst027NRMd+zeq7kyK7UPcmxSL3TtVN6ejYrf+dHc6KnavzNydiY7dG1F3H6KjlKcP0fc7SGw6yLaj3qrU2se4V6n1RYxblVr7GPcqtb6IcatSK8rz1dYvYtyaVd//lnuVWvdjfF6ptY9xr1Irth9LvlmptT2Qm5VasV3Lunly9zGen9yblVqxfanqZqXW/kDuVWrF7oWoe5VasVuGulupFbKrOrtZqRXyeJPAfXvcqtT6Yp4q92Q9b9y1lJ9Od2kvCBO7NrE3XDK3L1bdu2R+sVPg83lnxYcTX63z+XRk7Fa0FPfvryf58skD0T4EcrN+yO/fCaGYqjL72VrW7Y72RZi7Ha29oUog2uMqgX2Iex3tixa529G2+/Td62jbEPc62j7EnY52PH+i6m94ourPn6j6G56o+hueqPo7nqj6O56o9B1PVPr8iao/f6I6Hj9PHY+fpo7Hz1LH8xtlvfuuif2oLe89zx3Pn+bs+Qv/X8S4dcO//SWr2kv882qvMHnDL5E/9Jfceyq9G+HzZ9Lj+ROpvWFHii8Gyb1TovZHnpK7z5L+hk/5Hc+fJP3xh/zC3/Ahv/A3fMgv/PGHIvbtcetJcldjEGtL4bFygxBy3A1R0Ra1UE3Kd0KUY+3lWWiN4RshSqxV+Vp6/zRE7Hb0u7tgsg9yc+kmdjv63V3/je1LDHdXXcKer7psT6+vEFz8//u5ufmlCXpWqvcjiKy1X2m89dvxMcjrRO3uQ49Ybdo+O45dGoyrq/dSPl0cvBeg/ijAveXr4+ni9fF0mfZ4ukh7PF2i3Wa99SxRD7oLL9J+6Uy7taZbpeD7EK9H3bUR8mvpnb/EKvqdOK9/ulKOfygn+j2O/ME/CcWw40HNdoey2xZVV0nBCz+rStjHuFsw8kWUm7UaXx3LvWKNV5R4Xq3xZXdZW568uMTmHO3ehLpXfvZVjDv1Z68YNxdcPi/8+noortPshSd/fm+T3S1qr3jCb/L5IKr6eBxuj6OtAl9pEZsg2wcpGkHej22j7K7/BTcARfi65T+OEu+I0tqPo6wp8Vr02ETZrkd5wVeaaBiOR6xfouweJCp2j69UffVfRNl1mCoYzPxM880o+OTjhy8dfDMKJtqqxjuicPH071F25yjv9c/nCuq7v0fZblRVVoW7Fv54w/fOdKyb8X7U+tMoeJ+3vdLET9vFjV5y3LbL5lhe99G2bqmr/7B1e1t3tS+Mn54jW8ei1uIdv0h2Z/p+ftllqd02gDeXIl5LDNs9LHwF4Sv074eye9HKuq0qYp4Kez0f/xJkt7EQPoHyQrpt+fVi1PcTBYKJgrYJsluOGF/3u66MrxmQvvlBu7bFuyaVP536X1yM7l+mS9tcpncrV7fvXXZLVzfvXbbHcffeRbc3uVitKa48Z/Bbo+j2DcE19flaQKJ1xfBvHY2u9z1ebLs7qe0WcM3r+lXNW//0Zne3xd+9N+u+OpKQtVjaon1++6/7Ocx1w/Di2D0u7mbaX0lyXY1eZ54G0q+P9LvXrW63y3bO7cCcW9HdkWzbpazL65gePTbtsvtYU5decWXcjQHbFl81fJ/Id4+Ltt2+EPPVRveG8euFcfcBq5D16Prqf5WmNH/Nu7vq+jjaepXsiGMXZffuVMPnzfFzxm3vLzG2L7mKoMuVH0aRWDdAErqNErtbl1UJ0ivNl5TvHYrjUGJ7KDd3u+PF+t973Hbl626P272Jdb/H7VZ77ve47QLYzR63W/+63+Nc39Hjtm9j3e1x+0N5S4+r6wmt1e2U2G5DwV7Xss3rZko/vyvcvZOlti5DrwcR/zzI/vestefXBMFuZnn3iav7v6f/0b9HCp5ai/30SiZrZ4IX6k+vqpjM7b3sstNuTavFWoZ43Uv1H0dZQ+iFP48SiBI/jdJRttY/PFrJ9+4Ja6B+Q47jx3Gk43O5oj8/nraG0ov158fTsUoTKps+XHavbN1bA9zHuLcMuP899TjWW9uv5G2bnFm2U+/FsP3Da8U8PrvvLtu3tu7du391JFilKcb1Nr9G2d0wHGuVN8pmSWPftrgcvYgLZn5v292y04ENJF7XHEq97cdHI952R/OGB/uye//q9XyFJ6zXVNxuGG23xXhXnFffXxUwr9aRn8dZaebFuhtOtT5elfsixq1VubLbn/Dmqtx32mSfYr6I44jj/edx4sDT/e7SVHYzdrfPkT8/R3L84eeI26QcD86RUZzyw8vsx2TVfHc822USxbKafdjA59cguzKG1/Tvmsg/epe3/Ki+q/Aosp2durUH4ivI4yneL47j3spEadtGCWrcsF2j7F61untDtX1d694N1f73FCxNjLLKXbZr23clekENTq+f31DtoygmeMdWxM9vZErZPVqU9oa1idKed9z2jluY7bJP4UrEqpt52bLdvfD9d3el9V3C3C6s3T1FvT0+RdvjuH2KdrNkpSlOUT92d4fbt8HeFEd87Z8mLrwK238apdUfRmnVMRVzHJsou4W1u2d6+3PswHzorlH08a6xXxxJ4B3I15TFT09PrNWa16Tqj0/PYf/las03o5R1hW7F+o+7yirWbWMFbHOG4mFX2ebbFaBK8GX1lzxZtrN+KNbVD28Y/BJl+xEwdLX+YcrvtwORPzrK3RcmxkTI5hJ0c4upV5Q3vO3wivIHv+4guAP7+LrDb0379LuG+84mdT0MCRf1/X4gXh4fyC5E72t1peuHFeRfR7C/45q8W0PrvtKjHh+upP0bUV5jd73v/vEe+1tRCt6DKB+mln+LYs/nAfYx7s0DbL8/dXMe4GZH0frh6f3XFtktoN3uKNsFtCorU1ffHsqmz1pZz3T28c2236JsOsrdwrcS23Xfe4VvZfdK2d3Ct7L99tLtwrcv2tbWR1eL20/PUC0rSv2wmvfNKG1FsePnUQRRfJcQ7g6iDw/Lv0Sphzyf5anH4yexL47j3ixPPXb7xsiautUPr/793iT2R0e5/UZR3W51eOsNuK9i3HkJ7otfc/fNpi/a5OabTXW3aHb7zabtXZMen12V26/H0v/oKLfvr2uxN9xf1/2a2c3767qfob93f/3Fna2s1C/im4exWp/f2W4PpB241Wjth0+FBfUX5UP9xW+nuT6f9tr+nE4VWR/uv35rV92169VR4kPPl19jbOdIVz+RxqXO7VtRYlU6S9B04n8RJR7fYX8R49Yddt1tgnjzDnvbIu1Ynb4d9LLM7y2ye3HnbovsY9xskf4Htwheq3qFs12L2BtaxN7QIm94CttmgRBskfLhNvQ7Se11SV89TT5UNHwrChaQXoupx0+n3epK06+blP7TKHh17jV3sE329R3X9N1OiPev6dt9DG9f03dLYu+5pnc5rp7b5UNh26/Xnn78odf0fhTUq7bdRbA//dDMPsT9nrJ9zex2T+n9HT1luyJ2t6dsb3Tyc+wZxOnlmP/iSHbvu93cYKfUHu9ole3i6VvGT2u4smvZPXFo3eW4NevFe0ZK/TWGPO76ut1UXNcWbsrlN79H6Y+nH7YHgrpzMdseiG1/zgqC66l/p1EF75C3Qq95lm/9nI9vKNgmym7Dw7s3O/sjCSwAW90dybYWH1tZtvbTKPenZHavld2dktnHuDcls/01t6dk9m1yd0pmu43i3SmZbVJCQinlw51B/UaQ1/LwepFLPmxD8muU3eTqe6Lcv7LvFsTuX9m3H/i6fQ3bvVV2/8q+O0eGz4T1bdva86vP7mOsa3tv/7DS/9th7B7E8EoNVVr6d3osPowZR90cxm4t7LUAud4ZD3oK81872vYDX3ffaaixvS1Yl9Io7fNMsP05IXj9hT4k9/vP2b7QsJbTChe3jGvzt6KgtvHg/qrfi4KNZg/z+GEUX/XT5fjwvfhvNG5FVnqtG+injSv7T329IUg5ytrue3xXnHObfS+O027sEQ/irEvQUel1ve/Gwary2L7r2MXZnm9c4nkm4rce/EWUm+Pgq9+k9Jvs520sFX1YpP48Dp1zoX3/fo9T/n+IM6o31/VVd+eq7J8R8RIL3UZ9M0rDRruNZhi/GUXWo8gryuZYqm+3Sjrw2Qkuk/p1k4t8aXezdIL3M+3T7bFfQXYLZPe+HPEK4rvL251PR3wR4963I0qOlKcr5lK3ZeH3vh7xirIrorn5+YhXlN2u9De/H/GK8vi79t/oKLHrKNtJMFSS1iafB6nPt4X/4kiKosaj7I5kd6N7a0/21wPKdm94wVrBh2KT+muU3VOVYeNAl7qLUv/oKMUOpwnGemx67e4NsnK01flH2VTfxdkej6xnqxd328XZFYDRRzv4W/L9G8eiqETTxhsZ/n4ku1WHW9vnf9F3b+2f/8UgEqdr6k9HYlv1Y69p+PJ5kN0npe6OxLadZrz3eYQiu/e+Prw+EOXHUe59ZeEVRZ/3k23L3uwnX9yXYvu2Q9Q295PteTXCFzFurTRLf16N8FWbNDzISNfP2+SL59/88OP1/Pv5RnJfRWnItVyI81u7vKEm4YsjKUG/p/9oHZ/HT7XNCrxsV8ocHwB05QLZX3NTf/w6wzaE+GoT8eBinvaNKKMl1ooB/5zvRcHDSzOewP0tij4vo9kfia57uGa8ucH3fo+vB8Pm9FmJ/+L36B/8e/AWXIu6+z3qf+yR9IO/tNE2R7JbKxv1JqusocUPo9xeodpHubsy9MWx3FwZkt1K1+2VoX1OiAPvTPLOqr+37uO98rdZ8sMN3Ic9Rr4VRdedcbUPWxb+1rTxR0e5vUYl2/Wyu2tUstuE8fYalbi8YY1qf46KYT7vw1t1v7au98fXw/3a6s2pL3/H1Je/YerL3zH1Fe+Y+oq3TH3FW6a+4i1TX/GGqS9/x9SX+RumvuIdU1/bI7k79RXPp77a8Y6pr3a8Y+qrHfWPjvKNqa92vGfq64vjuT311Y7nU1/7GPTt3tjFeMPEV7xh4ms7hO5OfNnd+6bNxFcrzye+WnnHxFce8OOJry+i3Jz4auX5xNe+Ze/1k+0LFjcLcrbv8Qj2nOFdq7/5NpCsvUZfGWHzNlCrj/ec2R+IHbQH9/HTnxOIEryf5reitBLYXUX7rlH6G55yt1FuP+Xuo9x9yv3iWG4+5bb6jo/tbV+oK5iJeDURP9DJd6I0fChS5fg8StsuJL0lyu2HyybveLWhyTtebWjynlcbtmca2zt//Abnb63rTzNuk/KWE7SrKKuoFOm+7Sy7KB2bg+qHbdu/FSXwi0r96bFIxXZhfLv+zSjYIuh1afOfRin4lAN/VeL3KNs3yTp9tfJ1kj5dsdhGufvV61eUd7yV09o73spp/R1v5XwxjnzduZQPH+f97RzJW1r3Hbt1tbe8T9be8j5Ze8v7ZF+Mxk67Cewyw3adrNs6mBfrp4sOX0W5ORp3b5RJW3uDiklsfpFuX4Rcj0S98FLMrxV6bVfFfnempW3fFrr5hKftHTMtu3fK7s+R7FbKvjMnsX+x7N6cxFddrlOXk8+73PMXz7dd5e6MdttupnFzRrtZfTyjvY9xc0a77ZbJ7s5ot+0Gi3dntNtulez2jHbbbbB4e0a77aeNbs1o3+8omxntfXa7OaPddotkd2e0tynlXYnp/uStv2nydnc8t2sFm79hKmx7Cbo3FbbvLTenTPdB7k6Z7lbK7l5Qt/ss3p4yjfqOKdN9lLtTptuFspv9ZNuy9/rJF9svr1dhXsgvAn9vK+g1lF9RNltbt9jWJKx9XKp9mAj7ThTBqrnwNNg3ozQ88fLs63c3t8aUZzk2W2T34/EGH2V396Z4rHs9+JbP7pn2MbziNZpmP4yxXlZVt8/v3WJfcbVuRWs9fnqC64EoR+xOzfPqry9i3CqR7eX5p3G+aJH1xqvU/vN2XdsRSlX9cRQ6lgdRHOfYf5wKpGDyq9iPo6y6x0dR1iOuyIPkhklBvjn4Pbl98ckVfGnQVD/PCNtP0WD3SuWU/63P2dzbD+OLGLf2w9h/Sy+/fzIzdembLwM+f3d9/73Em+2xj3GrPb74wia+533Y7kuU+ygrF/SjxU+jFGz6VUr78bGsj32+ovz8y6Prfd/+xRfKdzeiDV+H3X4H5xtR2o+jrHvR14S5/DiKrqtY234FeBulY3uqXn7cutigtHX58Rd8+5oIfwXcfot1+6kIwSvZje9Vfnnk6O35XkpfxLh3r9Lq43uVfYtgUrPKh/uD31pk94kGw87J/AD1nQNpaweX15lpuwPRXVHDvQ9X97a9x7/54ert7+nr1ZfXg2n5/Pd8EWVtPvH6h/rjKGtHmdeE5K5t+/H40Wcf496jzxcxbj36HLuZoXFbhwn04/MJ9P6G98a+PJKDjmTTJrtSX7e1bfKL+ybN9m2lPH8Vq/Kt6H8RZ7uei4968oU5+reCrOYd33z8PMhuRSyq4qHfN7vS9N0Enq79K433bgn7zpHIegEteO3/vziSTaqNo2GLqTh2UbZfFqFqNuQD9V9j7GZodS3OVaVNV78X5TUNiZI43Ubx3U3pygmvuwOaHf3eoTgOJXaH8sUQWrdNXw6hfRy8tfI6hF2c3Z3T3S/R9O1Xw25+iabvFsbufommbxfGbn+J5qu0u/LCiz+9jDyeKtq9ladYzeK6vF835dmGWA8dhbvad0I4Cni4svUbIV4zgPTV+vhZiI5v+tLyxnd+CDYZLl5+1pxe12q2y49+SKn4CC9Pqn4nhKwCpPEiyo9CNLyM3nhfru+EwL5nrcXjo/hpCNTR8tdlf9u4qu+WvW5eHnbPa4oiQt7duB39fohYj41Gd5w/DmE/CmGYhDXK5N8KYTgKqmL/TgjH0gPvCP7TEPVnZ8QN38W1nzWn0xJ+/KwtAh+k4S+4fCsEtryO/rOu5Wu4f/hG8DdCVNxq10ofgPk1RNHtFocVl7QP38i2+8cRuHGKH3XxKqtzvVB/FmLtNfqaZOk/DFERQh+H6D89CpoiOn4WQtEWUR4fRfysf8q6uv84xM1P7Gl5unfBG16Z1t2+hbcLzHT3bbDxjdI1j1KibCpKtG7vmlAM8mIvuzjbCz0+GsPFlb+2TN0W69wqVPvi95T1wDS+F2e737N5ZPJYXdZ58+TfKsR092LU7QI+rfqGdtm+6NUrKq572/aXXe/FlkBFju2ZvtdbpLznF+n2F23j0HWvV92NgN1rWjc/a//Vb6LZ0e7649/k9F4fP5N9Pw7eMuQHs+/GMZpr9WPbxrvZVsEG4BKy6zm78YQFj32M7S9SbPX1mn0sP24ZXc/fL45dvtou/t/ONO0NGXgb4z2tK+gv2nf9t/XHKyf7GPdWTr6IcWvl5IsrW200waHbNomHN0Ff3XzgsWd8pXlTsKy7bRHna3LnNIXtLibbozkKbWhYNDYX6y7vuORvX/n6xoW293dcaL9xNNuL5D7O/YvkftOuexfJL37T7YvkPs79i+RXce5eJPdx7l8ktzPsty+Su6MJrVceD3XfjAZ9yw2wvuEGWN9w0d+1yTd+Tbzh18Qf+2t67dizUXc3HvaGWwar/z/+GtvlhC+uJY6Nh+txbPq96TuubPuMcP8m84s4t28yd9sc3u//fjzvMdsYb+gx37nJ3G2VePcmcxvj5k3mPsa9m8z+lmkPt7f0E39DP/Hn/WS7m9837n22n4y6ee+zP5b7d5ex/Rye093lrmX2Ue7eo37jN23vUb+Ic/u+cB/n/n3hV3Hu3hfu49y+L7TtBvK37wv3R3P/mvRFnLvXpNwB7HGuseP5rp/7GG/JNbevSXY8f1tuH+PeNemLGJ9ek/776//553/5y9//6a//+i///G9/+de//d/Xv/vPEervf/nn//HXP5//7//697/9C/2v//b//p/rf/kff//LX//6l//9T//n7//6L3/+n//+9z+PSON/+9Nx/p//JmNB8rV+1f77P/ypvP7/GDuBRLP6+v/l9f+343XeX6tQffzvZf4D+YfX/+n//T/HEf5/"
612
429
  }
613
430
  ],
614
431
  "outputs": {
@@ -622,7 +439,7 @@
622
439
  "type": {
623
440
  "fields": [
624
441
  {
625
- "name": "_operation",
442
+ "name": "operation",
626
443
  "type": {
627
444
  "kind": "integer",
628
445
  "sign": "unsigned",
@@ -630,7 +447,7 @@
630
447
  }
631
448
  },
632
449
  {
633
- "name": "_value",
450
+ "name": "value",
634
451
  "type": {
635
452
  "kind": "integer",
636
453
  "sign": "unsigned",
@@ -653,7 +470,7 @@
653
470
  "type": {
654
471
  "fields": [
655
472
  {
656
- "name": "_operation",
473
+ "name": "operation",
657
474
  "type": {
658
475
  "kind": "integer",
659
476
  "sign": "unsigned",
@@ -661,7 +478,7 @@
661
478
  }
662
479
  },
663
480
  {
664
- "name": "_value",
481
+ "name": "value",
665
482
  "type": {
666
483
  "kind": "integer",
667
484
  "sign": "unsigned",
@@ -800,111 +617,22 @@
800
617
  "type": {
801
618
  "fields": [
802
619
  {
803
- "name": "message_ciphertext",
804
- "type": {
805
- "fields": [
806
- {
807
- "name": "storage",
808
- "type": {
809
- "kind": "array",
810
- "length": 15,
811
- "type": {
812
- "kind": "field"
813
- }
814
- }
815
- },
816
- {
817
- "name": "len",
818
- "type": {
819
- "kind": "integer",
820
- "sign": "unsigned",
821
- "width": 32
822
- }
823
- }
824
- ],
825
- "kind": "struct",
826
- "path": "std::collections::bounded_vec::BoundedVec"
827
- }
828
- },
829
- {
830
- "name": "message_context",
620
+ "name": "scope",
831
621
  "type": {
832
622
  "fields": [
833
623
  {
834
- "name": "tx_hash",
624
+ "name": "inner",
835
625
  "type": {
836
626
  "kind": "field"
837
627
  }
838
- },
839
- {
840
- "name": "unique_note_hashes_in_tx",
841
- "type": {
842
- "fields": [
843
- {
844
- "name": "storage",
845
- "type": {
846
- "kind": "array",
847
- "length": 64,
848
- "type": {
849
- "kind": "field"
850
- }
851
- }
852
- },
853
- {
854
- "name": "len",
855
- "type": {
856
- "kind": "integer",
857
- "sign": "unsigned",
858
- "width": 32
859
- }
860
- }
861
- ],
862
- "kind": "struct",
863
- "path": "std::collections::bounded_vec::BoundedVec"
864
- }
865
- },
866
- {
867
- "name": "first_nullifier_in_tx",
868
- "type": {
869
- "kind": "field"
870
- }
871
- },
872
- {
873
- "name": "recipient",
874
- "type": {
875
- "fields": [
876
- {
877
- "name": "inner",
878
- "type": {
879
- "kind": "field"
880
- }
881
- }
882
- ],
883
- "kind": "struct",
884
- "path": "aztec::protocol_types::address::aztec_address::AztecAddress"
885
- }
886
628
  }
887
629
  ],
888
630
  "kind": "struct",
889
- "path": "aztec::messages::processing::message_context::MessageContext"
631
+ "path": "aztec::protocol_types::address::aztec_address::AztecAddress"
890
632
  }
891
633
  }
892
634
  ],
893
635
  "kind": "struct",
894
- "path": "PublicChecks::process_message_parameters"
895
- }
896
- }
897
- ],
898
- "kind": "struct",
899
- "path": "PublicChecks::process_message_abi"
900
- },
901
- {
902
- "fields": [
903
- {
904
- "name": "parameters",
905
- "type": {
906
- "fields": [],
907
- "kind": "struct",
908
636
  "path": "PublicChecks::sync_state_parameters"
909
637
  }
910
638
  }
@@ -920,85 +648,89 @@
920
648
  "function_locations": [
921
649
  {
922
650
  "name": "log_prefix",
923
- "start": 289
651
+ "start": 525
924
652
  },
925
653
  {
926
654
  "name": "aztecnr_fatal_log",
927
- "start": 481
655
+ "start": 717
928
656
  },
929
657
  {
930
658
  "name": "aztecnr_error_log",
931
- "start": 669
659
+ "start": 943
932
660
  },
933
661
  {
934
662
  "name": "aztecnr_warn_log",
935
- "start": 856
663
+ "start": 1168
936
664
  },
937
665
  {
938
666
  "name": "aztecnr_info_log",
939
- "start": 1042
667
+ "start": 1392
940
668
  },
941
669
  {
942
670
  "name": "aztecnr_verbose_log",
943
- "start": 1231
671
+ "start": 1619
944
672
  },
945
673
  {
946
674
  "name": "aztecnr_debug_log",
947
- "start": 1421
675
+ "start": 1847
948
676
  },
949
677
  {
950
678
  "name": "aztecnr_trace_log",
951
- "start": 1609
679
+ "start": 2073
952
680
  },
953
681
  {
954
682
  "name": "aztecnr_fatal_log_format",
955
- "start": 1865
683
+ "start": 2367
956
684
  },
957
685
  {
958
686
  "name": "aztecnr_error_log_format",
959
- "start": 2082
687
+ "start": 2622
960
688
  },
961
689
  {
962
690
  "name": "aztecnr_warn_log_format",
963
- "start": 2298
691
+ "start": 2876
964
692
  },
965
693
  {
966
694
  "name": "aztecnr_info_log_format",
967
- "start": 2513
695
+ "start": 3129
968
696
  },
969
697
  {
970
698
  "name": "aztecnr_verbose_log_format",
971
- "start": 2731
699
+ "start": 3385
972
700
  },
973
701
  {
974
702
  "name": "aztecnr_debug_log_format",
975
- "start": 2950
703
+ "start": 3642
976
704
  },
977
705
  {
978
706
  "name": "aztecnr_trace_log_format",
979
- "start": 3167
707
+ "start": 3897
708
+ },
709
+ {
710
+ "name": "resolve_fn",
711
+ "start": 4151
980
712
  }
981
713
  ],
982
714
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/logging.nr",
983
- "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\nuse std::meta::ctstring::AsCtString;\n\ncomptime fn log_prefix<let N: u32>(msg: str<N>) -> CtString {\n \"[aztec-nr] \".as_ctstring().append_str(msg)\n}\n\n// --- No-args variants (direct call) ---\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_fatal_log<let N: u32>(msg: str<N>) -> Quoted {\n let msg = log_prefix(msg);\n quote { crate::protocol::logging::fatal_log($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_error_log<let N: u32>(msg: str<N>) -> Quoted {\n let msg = log_prefix(msg);\n quote { crate::protocol::logging::error_log($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_warn_log<let N: u32>(msg: str<N>) -> Quoted {\n let msg = log_prefix(msg);\n quote { crate::protocol::logging::warn_log($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_info_log<let N: u32>(msg: str<N>) -> Quoted {\n let msg = log_prefix(msg);\n quote { crate::protocol::logging::info_log($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_verbose_log<let N: u32>(msg: str<N>) -> Quoted {\n let msg = log_prefix(msg);\n quote { crate::protocol::logging::verbose_log($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_debug_log<let N: u32>(msg: str<N>) -> Quoted {\n let msg = log_prefix(msg);\n quote { crate::protocol::logging::debug_log($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_trace_log<let N: u32>(msg: str<N>) -> Quoted {\n let msg = log_prefix(msg);\n quote { crate::protocol::logging::trace_log($msg) }\n}\n\n// --- Format variants (return lambda for runtime args) ---\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_fatal_log_format<let N: u32>(msg: str<N>) -> Quoted {\n let msg = log_prefix(msg);\n quote { (|args| crate::protocol::logging::fatal_log_format($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_error_log_format<let N: u32>(msg: str<N>) -> Quoted {\n let msg = log_prefix(msg);\n quote { (|args| crate::protocol::logging::error_log_format($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_warn_log_format<let N: u32>(msg: str<N>) -> Quoted {\n let msg = log_prefix(msg);\n quote { (|args| crate::protocol::logging::warn_log_format($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_info_log_format<let N: u32>(msg: str<N>) -> Quoted {\n let msg = log_prefix(msg);\n quote { (|args| crate::protocol::logging::info_log_format($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_verbose_log_format<let N: u32>(msg: str<N>) -> Quoted {\n let msg = log_prefix(msg);\n quote { (|args| crate::protocol::logging::verbose_log_format($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_debug_log_format<let N: u32>(msg: str<N>) -> Quoted {\n let msg = log_prefix(msg);\n quote { (|args| crate::protocol::logging::debug_log_format($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_trace_log_format<let N: u32>(msg: str<N>) -> Quoted {\n let msg = log_prefix(msg);\n quote { (|args| crate::protocol::logging::trace_log_format($msg, args)) }\n}\n"
715
+ "source": "// Not all log levels are currently used, but we provide the full set so that new call sites can use any level. Because\n// of that we tag all with `#[allow(dead_code)]` to prevent warnings.\n//\n// All wrappers resolve function paths at comptime via `resolve_fn` so that the emitted `Quoted` code works both inside\n// aztec-nr (where `crate::` = aztec) and inside macro-generated contract code (where `crate::` = the contract).\n\nuse std::meta::ctstring::AsCtString;\n\ncomptime fn log_prefix<let N: u32>(msg: str<N>) -> CtString {\n \"[aztec-nr] \".as_ctstring().append_str(msg)\n}\n\n// --- No-args variants (direct call) ---\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_fatal_log<let N: u32>(msg: str<N>) -> Quoted {\n let msg = log_prefix(msg);\n let f = resolve_fn(quote { crate::protocol::logging::fatal_log });\n quote { $f($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_error_log<let N: u32>(msg: str<N>) -> Quoted {\n let msg = log_prefix(msg);\n let f = resolve_fn(quote { crate::protocol::logging::error_log });\n quote { $f($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_warn_log<let N: u32>(msg: str<N>) -> Quoted {\n let msg = log_prefix(msg);\n let f = resolve_fn(quote { crate::protocol::logging::warn_log });\n quote { $f($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_info_log<let N: u32>(msg: str<N>) -> Quoted {\n let msg = log_prefix(msg);\n let f = resolve_fn(quote { crate::protocol::logging::info_log });\n quote { $f($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_verbose_log<let N: u32>(msg: str<N>) -> Quoted {\n let msg = log_prefix(msg);\n let f = resolve_fn(quote { crate::protocol::logging::verbose_log });\n quote { $f($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_debug_log<let N: u32>(msg: str<N>) -> Quoted {\n let msg = log_prefix(msg);\n let f = resolve_fn(quote { crate::protocol::logging::debug_log });\n quote { $f($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_trace_log<let N: u32>(msg: str<N>) -> Quoted {\n let msg = log_prefix(msg);\n let f = resolve_fn(quote { crate::protocol::logging::trace_log });\n quote { $f($msg) }\n}\n\n// --- Format variants (return lambda for runtime args) ---\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_fatal_log_format<let N: u32>(msg: str<N>) -> Quoted {\n let msg = log_prefix(msg);\n let f = resolve_fn(quote { crate::protocol::logging::fatal_log_format });\n quote { (|args| $f($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_error_log_format<let N: u32>(msg: str<N>) -> Quoted {\n let msg = log_prefix(msg);\n let f = resolve_fn(quote { crate::protocol::logging::error_log_format });\n quote { (|args| $f($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_warn_log_format<let N: u32>(msg: str<N>) -> Quoted {\n let msg = log_prefix(msg);\n let f = resolve_fn(quote { crate::protocol::logging::warn_log_format });\n quote { (|args| $f($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_info_log_format<let N: u32>(msg: str<N>) -> Quoted {\n let msg = log_prefix(msg);\n let f = resolve_fn(quote { crate::protocol::logging::info_log_format });\n quote { (|args| $f($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_verbose_log_format<let N: u32>(msg: str<N>) -> Quoted {\n let msg = log_prefix(msg);\n let f = resolve_fn(quote { crate::protocol::logging::verbose_log_format });\n quote { (|args| $f($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_debug_log_format<let N: u32>(msg: str<N>) -> Quoted {\n let msg = log_prefix(msg);\n let f = resolve_fn(quote { crate::protocol::logging::debug_log_format });\n quote { (|args| $f($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_trace_log_format<let N: u32>(msg: str<N>) -> Quoted {\n let msg = log_prefix(msg);\n let f = resolve_fn(quote { crate::protocol::logging::trace_log_format });\n quote { (|args| $f($msg, args)) }\n}\n\n// See module-level comment for why this is needed.\ncomptime fn resolve_fn(path: Quoted) -> TypedExpr {\n path.as_expr().unwrap().resolve(Option::none())\n}\n"
984
716
  },
985
717
  "102": {
986
718
  "function_locations": [
987
719
  {
988
720
  "name": "generate_contract_library_methods_compute_note_hash_and_nullifier",
989
- "start": 514
721
+ "start": 534
990
722
  },
991
723
  {
992
724
  "name": "generate_contract_library_method_compute_note_hash",
993
- "start": 2429
725
+ "start": 2449
994
726
  },
995
727
  {
996
728
  "name": "generate_contract_library_method_compute_note_nullifier",
997
- "start": 7577
729
+ "start": 7674
998
730
  }
999
731
  ],
1000
732
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/aztec/compute_note_hash_and_nullifier.nr",
1001
- "source": "use 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<Field, aztec::messages::logs::note::MAX_NOTE_PACKED_LEN>,\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<aztec::messages::discovery::NoteHashAndNullifier> {\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<Field, aztec::messages::logs::note::MAX_NOTE_PACKED_LEN>,\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<Field> {\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 we correct `unpack` method from the `Packable` trait to obtain the underlying note type, and\n // compute the note hash (non-siloed).\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 aztec::protocol::logging::warn_log_format(\n \"[aztec-nr] Packed note length mismatch for note type id {2}: expected {0} fields, got {1}. Skipping note.\",\n [expected_len as Field, actual_len as Field, note_type_id],\n );\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 (non-siloed).\n ///\n /// The signature of this function notably matches the `aztec::messages::discovery::ComputeNoteHash` type, and so it can be used to call functions from that module such as `do_sync_state` and `attempt_note_discovery`.\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<Field, aztec::messages::logs::note::MAX_NOTE_PACKED_LEN>,\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<Field> {\n $if_note_type_id_match_statements\n else {\n aztec::protocol::logging::warn_log_format(\n \"[aztec-nr] Unknown note type id {0}. Skipping note.\",\n [note_type_id],\n );\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<Field, aztec::messages::logs::note::MAX_NOTE_PACKED_LEN>,\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<Field> {\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 we correct `unpack` method from the `Packable` trait to obtain the underlying note type, and\n // compute the inner nullifier (non-siloed).\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 aztec::protocol::logging::warn_log_format(\n \"[aztec-nr] Packed note length mismatch for note type id {2}: expected {0} fields, got {1}. Skipping note.\",\n [expected_len as Field, actual_len as Field, note_type_id],\n );\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` type, and so it can be used to call functions from that module such as `do_sync_state` and `attempt_note_discovery`.\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<Field, aztec::messages::logs::note::MAX_NOTE_PACKED_LEN>,\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<Field> {\n $if_note_type_id_match_statements\n else {\n aztec::protocol::logging::warn_log_format(\n \"[aztec-nr] Unknown note type id {0}. Skipping note.\",\n [note_type_id],\n );\n Option::none()\n }\n }\n }\n }\n}\n"
733
+ "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<Field, aztec::messages::logs::note::MAX_NOTE_PACKED_LEN>,\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<aztec::messages::discovery::NoteHashAndNullifier> {\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<Field, aztec::messages::logs::note::MAX_NOTE_PACKED_LEN>,\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<Field> {\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 note type, and\n // 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 (non-siloed).\n ///\n /// The signature of this function notably matches the `aztec::messages::discovery::ComputeNoteHash` type, and so it can be used to call functions from that module such as `do_sync_state` and `attempt_note_discovery`.\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<Field, aztec::messages::logs::note::MAX_NOTE_PACKED_LEN>,\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<Field> {\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<Field, aztec::messages::logs::note::MAX_NOTE_PACKED_LEN>,\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<Field> {\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 note type, and\n // 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` type, and so it can be used to call functions from that module such as `do_sync_state` and `attempt_note_discovery`.\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<Field, aztec::messages::logs::note::MAX_NOTE_PACKED_LEN>,\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<Field> {\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"
1002
734
  },
1003
735
  "103": {
1004
736
  "function_locations": [
@@ -1016,27 +748,23 @@
1016
748
  },
1017
749
  {
1018
750
  "name": "generate_contract_interface",
1019
- "start": 6801
751
+ "start": 6527
1020
752
  },
1021
753
  {
1022
754
  "name": "generate_sync_state",
1023
- "start": 8663
1024
- },
1025
- {
1026
- "name": "generate_process_message",
1027
- "start": 9515
755
+ "start": 8389
1028
756
  },
1029
757
  {
1030
758
  "name": "generate_offchain_receive",
1031
- "start": 11168
759
+ "start": 9443
1032
760
  },
1033
761
  {
1034
762
  "name": "check_each_fn_macroified",
1035
- "start": 12719
763
+ "start": 11087
1036
764
  }
1037
765
  ],
1038
766
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/aztec.nr",
1039
- "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 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,\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. These are advanced features that require careful understanding of\n/// the behavior of these systems.\n///\n/// ## Examples\n///\n/// ```noir\n/// #[aztec(aztec::macros::AztecConfig::new().custom_message_handler(my_handler))]\n/// contract MyContract { ... }\n/// ```\npub struct AztecConfig {\n custom_message_handler: Option<CustomMessageHandler<()>>,\n}\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() }\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(_self: Self, handler: CustomMessageHandler<()>) -> Self {\n Self { custom_message_handler: Option::some(handler) }\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), `sync_state` and `process_message` functions only if they are not\n // already implemented. If they are implemented we just insert empty quotes.\n let contract_library_method_compute_note_hash_and_nullifier = if !m.functions().any(|f| {\n // Note that we don't test for `_compute_note_hash` or `_compute_note_nullifier` in order to make this simpler\n // - users must either implement all three or none.\n // Down the line we'll remove this check and use `AztecConfig`.\n f.name() == quote { _compute_note_hash_and_nullifier }\n }) {\n generate_contract_library_methods_compute_note_hash_and_nullifier()\n } else {\n quote {}\n };\n let process_custom_message_option = if config.custom_message_handler.is_some() {\n let handler = config.custom_message_handler.unwrap();\n quote { Option::some($handler) }\n } else {\n quote { Option::<aztec::messages::discovery::CustomMessageHandler<()>>::none() }\n };\n\n let offchain_inbox_sync_option = quote {\n Option::some(aztec::messages::processing::offchain::sync_inbox)\n };\n\n let sync_state_fn_and_abi_export = if !m.functions().any(|f| f.name() == quote { sync_state }) {\n generate_sync_state(process_custom_message_option, offchain_inbox_sync_option)\n } else {\n quote {}\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 process_message_fn_and_abi_export = if !m.functions().any(|f| f.name() == quote { process_message }) {\n generate_process_message(process_custom_message_option)\n } else {\n quote {}\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 $process_message_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(process_custom_message_option: Quoted, offchain_inbox_sync_option: Quoted) -> Quoted {\n quote {\n pub struct sync_state_parameters {}\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() {\n let address = aztec::context::UtilityContext::new().this_address();\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 );\n }\n }\n}\n\n/// Generates the `process_message` utility function that processes a single message ciphertext.\ncomptime fn generate_process_message(process_custom_message_option: Quoted) -> Quoted {\n quote {\n pub struct process_message_parameters {\n pub message_ciphertext: BoundedVec<Field, aztec::messages::encoding::MESSAGE_CIPHERTEXT_LEN>,\n pub message_context: aztec::messages::processing::MessageContext,\n }\n\n #[abi(functions)]\n pub struct process_message_abi {\n parameters: process_message_parameters,\n }\n\n #[aztec::macros::internals_functions_generation::abi_attributes::abi_utility]\n unconstrained fn process_message(\n message_ciphertext: BoundedVec<Field, aztec::messages::encoding::MESSAGE_CIPHERTEXT_LEN>,\n message_context: aztec::messages::processing::MessageContext,\n ) {\n let address = aztec::context::UtilityContext::new().this_address();\n\n aztec::messages::discovery::process_message::process_message_ciphertext(\n address,\n _compute_note_hash,\n _compute_note_nullifier,\n $process_custom_message_option,\n message_ciphertext,\n message_context,\n );\n\n // At this point, the note is pending validation and storage in the database. We must call\n // validate_and_store_enqueued_notes_and_events to complete that process.\n aztec::messages::processing::validate_and_store_enqueued_notes_and_events(address);\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 quote {\n pub struct offchain_receive_parameters {\n pub messages: BoundedVec<\n aztec::messages::processing::offchain::OffchainMessage,\n aztec::messages::processing::offchain::MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL,\n >,\n }\n\n #[abi(functions)]\n pub struct offchain_receive_abi {\n parameters: offchain_receive_parameters,\n }\n\n /// Receives offchain messages into this contract's offchain inbox for subsequent processing.\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(\n messages: BoundedVec<\n aztec::messages::processing::offchain::OffchainMessage,\n aztec::messages::processing::offchain::MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL,\n >,\n ) {\n let address = aztec::context::UtilityContext::new().this_address();\n aztec::messages::processing::offchain::receive(address, messages);\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"
767
+ "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 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,\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. These are advanced features that require careful understanding of\n/// the behavior of these systems.\n///\n/// ## Examples\n///\n/// ```noir\n/// #[aztec(aztec::macros::AztecConfig::new().custom_message_handler(my_handler))]\n/// contract MyContract { ... }\n/// ```\npub struct AztecConfig {\n custom_message_handler: Option<CustomMessageHandler<()>>,\n}\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() }\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(_self: Self, handler: CustomMessageHandler<()>) -> Self {\n Self { custom_message_handler: Option::some(handler) }\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) and `sync_state` functions only if they are not already implemented.\n // If they are implemented we just insert empty quotes.\n let contract_library_method_compute_note_hash_and_nullifier = if !m.functions().any(|f| {\n // Note that we don't test for `_compute_note_hash` or `_compute_note_nullifier` in order to make this simpler\n // - users must either implement all three or none.\n // Down the line we'll remove this check and use `AztecConfig`.\n f.name() == quote { _compute_note_hash_and_nullifier }\n }) {\n generate_contract_library_methods_compute_note_hash_and_nullifier()\n } else {\n quote {}\n };\n let process_custom_message_option = if config.custom_message_handler.is_some() {\n let handler = config.custom_message_handler.unwrap();\n quote { Option::some($handler) }\n } else {\n quote { Option::<aztec::messages::discovery::CustomMessageHandler<()>>::none() }\n };\n\n let offchain_inbox_sync_option = quote {\n Option::some(aztec::messages::processing::offchain::sync_inbox)\n };\n\n let sync_state_fn_and_abi_export = if !m.functions().any(|f| f.name() == quote { sync_state }) {\n generate_sync_state(process_custom_message_option, offchain_inbox_sync_option)\n } else {\n quote {}\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(process_custom_message_option: Quoted, offchain_inbox_sync_option: Quoted) -> Quoted {\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 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\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 quote {\n pub struct offchain_receive_parameters {\n pub messages: BoundedVec<\n aztec::messages::processing::offchain::OffchainMessage,\n aztec::messages::processing::offchain::MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL,\n >,\n }\n\n #[abi(functions)]\n pub struct offchain_receive_abi {\n parameters: offchain_receive_parameters,\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(\n messages: BoundedVec<\n aztec::messages::processing::offchain::OffchainMessage,\n aztec::messages::processing::offchain::MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL,\n >,\n ) {\n let address = aztec::context::UtilityContext::new().this_address();\n aztec::messages::processing::offchain::receive(address, messages);\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"
1040
768
  },
1041
769
  "108": {
1042
770
  "function_locations": [
@@ -1066,23 +794,23 @@
1066
794
  "function_locations": [
1067
795
  {
1068
796
  "name": "do_sync_state",
1069
- "start": 6428
797
+ "start": 6479
1070
798
  },
1071
799
  {
1072
800
  "name": "test::do_sync_state_does_not_panic_on_empty_logs",
1073
- "start": 9795
801
+ "start": 9994
1074
802
  },
1075
803
  {
1076
804
  "name": "test::dummy_compute_note_hash",
1077
- "start": 10994
805
+ "start": 11223
1078
806
  },
1079
807
  {
1080
808
  "name": "test::dummy_compute_note_nullifier",
1081
- "start": 11355
809
+ "start": 11584
1082
810
  }
1083
811
  ],
1084
812
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/mod.nr",
1085
- "source": "use crate::logging::{aztecnr_debug_log, aztecnr_debug_log_format, aztecnr_warn_log_format};\nuse crate::protocol::address::AztecAddress;\n\npub(crate) mod nonce_discovery;\npub(crate) mod partial_notes;\npub(crate) mod private_events;\npub mod private_notes;\npub mod process_message;\n\nuse crate::{\n capsules::CapsuleArray,\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 get_private_logs, MessageContext, offchain::OffchainInboxSync, OffchainMessageWithContext,\n pending_tagged_log::PendingTaggedLog, validate_and_store_enqueued_notes_and_events,\n },\n },\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<Field>,\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<Field, MAX_NOTE_PACKED_LEN>, /*\n owner */ AztecAddress, /* storage_slot */ Field, /* note_type_id */ Field, /* contract_address */ AztecAddress, /*\nrandomness */ Field) -> Option<Field>;\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<Field, MAX_NOTE_PACKED_LEN>,\n/* owner */ AztecAddress, /* storage_slot */ Field, /* note_type_id */ Field, /* contract_address */ AztecAddress,\n/* randomness */ Field) -> Option<Field>;\n\n/// Deprecated: use [`ComputeNoteHash`] and [`ComputeNoteNullifier`] instead.\npub type ComputeNoteHashAndNullifier<Env> = unconstrained fn[Env](/* packed_note */BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n/* owner */ AztecAddress, /* storage_slot */ Field, /* note_type_id */ Field, /* contract_address */ AztecAddress,\n/*randomness */ Field, /* note nonce */ Field) -> Option<NoteHashAndNullifier>;\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<Env> = unconstrained fn[Env](\n/* contract_address */AztecAddress,\n/* msg_type_id */ u64,\n/* msg_metadata */ u64,\n/* msg_content */ BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n/* message_context */ MessageContext);\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<CustomMessageHandlerEnv>(\n contract_address: AztecAddress,\n compute_note_hash: ComputeNoteHash,\n compute_note_nullifier: ComputeNoteNullifier,\n process_custom_message: Option<CustomMessageHandler<CustomMessageHandlerEnv>>,\n offchain_inbox_sync: Option<OffchainInboxSync<()>>,\n) {\n aztecnr_debug_log!(\"Performing state synchronization\");\n\n // First we process all private logs, which can contain different kinds of messages e.g. private notes, partial\n // notes, private events, etc.\n let logs = get_private_logs(contract_address);\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 );\n }\n\n // We need to delete each log from the array so that we won't process them again. `CapsuleArray::for_each`\n // allows deletion of the current element during iteration, so this is safe.\n // Note that this (and all other database changes) will only be committed if contract execution succeeds,\n // including any enqueued validation requests.\n logs.remove(i);\n });\n\n if offchain_inbox_sync.is_some() {\n let msgs: CapsuleArray<OffchainMessageWithContext> = offchain_inbox_sync.unwrap()(contract_address);\n msgs.for_each(|i, msg| {\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.message_context,\n );\n // The inbox sync returns _a copy_ of messages to process, so we clear them as we do so. This is a\n // volatile array with the to-process message, not the actual persistent storage of them.\n msgs.remove(i);\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::fetch_and_process_partial_note_completion_logs(\n contract_address,\n compute_note_hash,\n compute_note_nullifier,\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(contract_address);\n}\n\nmod test {\n use crate::{\n capsules::CapsuleArray,\n messages::{\n discovery::{CustomMessageHandler, do_sync_state},\n logs::note::MAX_NOTE_PACKED_LEN,\n processing::{\n offchain::OffchainInboxSync, pending_tagged_log::PendingTaggedLog, PENDING_TAGGED_LOG_ARRAY_BASE_SLOT,\n },\n },\n test::helpers::test_environment::TestEnvironment,\n };\n use crate::protocol::address::AztecAddress;\n\n #[test]\n unconstrained fn do_sync_state_does_not_panic_on_empty_logs() {\n let env = TestEnvironment::new();\n\n let contract_address = AztecAddress { inner: 0xdeadbeef };\n\n env.utility_context_at(contract_address, |_| {\n let base_slot = PENDING_TAGGED_LOG_ARRAY_BASE_SLOT;\n\n let logs: CapsuleArray<PendingTaggedLog> = CapsuleArray::at(contract_address, 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<CustomMessageHandler<()>> = Option::none();\n let no_inbox_sync: Option<OffchainInboxSync<()>> = 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 );\n\n assert_eq(logs.len(), 0);\n });\n }\n\n unconstrained fn dummy_compute_note_hash(\n _packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n _owner: AztecAddress,\n _storage_slot: Field,\n _note_type_id: Field,\n _contract_address: AztecAddress,\n _randomness: Field,\n ) -> Option<Field> {\n Option::none()\n }\n\n unconstrained fn dummy_compute_note_nullifier(\n _unique_note_hash: Field,\n _packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n _owner: AztecAddress,\n _storage_slot: Field,\n _note_type_id: Field,\n _contract_address: AztecAddress,\n _randomness: Field,\n ) -> Option<Field> {\n Option::none()\n }\n}\n"
813
+ "source": "use crate::logging::{aztecnr_debug_log, aztecnr_debug_log_format, aztecnr_warn_log_format};\nuse crate::protocol::address::AztecAddress;\n\npub(crate) mod nonce_discovery;\npub(crate) mod partial_notes;\npub(crate) mod private_events;\npub mod private_notes;\npub mod process_message;\n\nuse crate::{\n capsules::CapsuleArray,\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 get_private_logs, MessageContext, offchain::OffchainInboxSync, OffchainMessageWithContext,\n pending_tagged_log::PendingTaggedLog, validate_and_store_enqueued_notes_and_events,\n },\n },\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<Field>,\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<Field, MAX_NOTE_PACKED_LEN>, /*\n owner */ AztecAddress, /* storage_slot */ Field, /* note_type_id */ Field, /* contract_address */ AztecAddress, /*\nrandomness */ Field) -> Option<Field>;\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<Field, MAX_NOTE_PACKED_LEN>,\n/* owner */ AztecAddress, /* storage_slot */ Field, /* note_type_id */ Field, /* contract_address */ AztecAddress,\n/* randomness */ Field) -> Option<Field>;\n\n/// Deprecated: use [`ComputeNoteHash`] and [`ComputeNoteNullifier`] instead.\npub type ComputeNoteHashAndNullifier<Env> = unconstrained fn[Env](/* packed_note */BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n/* owner */ AztecAddress, /* storage_slot */ Field, /* note_type_id */ Field, /* contract_address */ AztecAddress,\n/*randomness */ Field, /* note nonce */ Field) -> Option<NoteHashAndNullifier>;\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<Env> = unconstrained fn[Env](\n/* contract_address */AztecAddress,\n/* msg_type_id */ u64,\n/* msg_metadata */ u64,\n/* msg_content */ BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n/* message_context */ MessageContext,\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<CustomMessageHandlerEnv>(\n contract_address: AztecAddress,\n compute_note_hash: ComputeNoteHash,\n compute_note_nullifier: ComputeNoteNullifier,\n process_custom_message: Option<CustomMessageHandler<CustomMessageHandlerEnv>>,\n offchain_inbox_sync: Option<OffchainInboxSync<()>>,\n scope: AztecAddress,\n) {\n aztecnr_debug_log!(\"Performing state synchronization\");\n\n // First we process all private logs, which can contain different kinds of messages e.g. private notes, partial\n // notes, private events, etc.\n let logs = get_private_logs(contract_address, scope);\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 // We need to delete each log from the array so that we won't process them again. `CapsuleArray::for_each`\n // allows deletion of the current element during iteration, so this is safe.\n // Note that this (and all other database changes) will only be committed if contract execution succeeds,\n // including any enqueued validation requests.\n logs.remove(i);\n });\n\n if offchain_inbox_sync.is_some() {\n let msgs: CapsuleArray<OffchainMessageWithContext> = offchain_inbox_sync.unwrap()(contract_address, scope);\n msgs.for_each(|i, msg| {\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.message_context,\n scope,\n );\n // The inbox sync returns _a copy_ of messages to process, so we clear them as we do so. This is a\n // volatile array with the to-process message, not the actual persistent storage of them.\n msgs.remove(i);\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::fetch_and_process_partial_note_completion_logs(\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(contract_address, scope);\n}\n\nmod test {\n use crate::{\n capsules::CapsuleArray,\n messages::{\n discovery::{CustomMessageHandler, do_sync_state},\n logs::note::MAX_NOTE_PACKED_LEN,\n processing::{\n offchain::OffchainInboxSync, pending_tagged_log::PendingTaggedLog, PENDING_TAGGED_LOG_ARRAY_BASE_SLOT,\n },\n },\n test::helpers::test_environment::TestEnvironment,\n };\n use crate::protocol::address::AztecAddress;\n\n global SCOPE: AztecAddress = AztecAddress { inner: 0xcafe };\n\n #[test]\n unconstrained fn do_sync_state_does_not_panic_on_empty_logs() {\n let env = TestEnvironment::new();\n\n let contract_address = AztecAddress { inner: 0xdeadbeef };\n\n env.utility_context_at(contract_address, |_| {\n let base_slot = PENDING_TAGGED_LOG_ARRAY_BASE_SLOT;\n\n let logs: CapsuleArray<PendingTaggedLog> = CapsuleArray::at(contract_address, base_slot, SCOPE);\n logs.push(PendingTaggedLog { log: BoundedVec::new(), context: std::mem::zeroed() });\n assert_eq(logs.len(), 1);\n\n let no_handler: Option<CustomMessageHandler<()>> = Option::none();\n let no_inbox_sync: Option<OffchainInboxSync<()>> = 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 assert_eq(logs.len(), 0);\n });\n }\n\n unconstrained fn dummy_compute_note_hash(\n _packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n _owner: AztecAddress,\n _storage_slot: Field,\n _note_type_id: Field,\n _contract_address: AztecAddress,\n _randomness: Field,\n ) -> Option<Field> {\n Option::none()\n }\n\n unconstrained fn dummy_compute_note_nullifier(\n _unique_note_hash: Field,\n _packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n _owner: AztecAddress,\n _storage_slot: Field,\n _note_type_id: Field,\n _contract_address: AztecAddress,\n _randomness: Field,\n ) -> Option<Field> {\n Option::none()\n }\n}\n"
1086
814
  },
1087
815
  "130": {
1088
816
  "function_locations": [
@@ -1092,69 +820,69 @@
1092
820
  },
1093
821
  {
1094
822
  "name": "bvec_filter",
1095
- "start": 7324
823
+ "start": 7210
1096
824
  },
1097
825
  {
1098
826
  "name": "test::compute_note_hash",
1099
- "start": 8572
827
+ "start": 8458
1100
828
  },
1101
829
  {
1102
830
  "name": "test::compute_note_nullifier",
1103
- "start": 9221
831
+ "start": 9107
1104
832
  },
1105
833
  {
1106
834
  "name": "test::no_note_hashes",
1107
- "start": 9878
835
+ "start": 9764
1108
836
  },
1109
837
  {
1110
838
  "name": "test::failed_hash_computation_is_ignored",
1111
- "start": 10476
839
+ "start": 10362
1112
840
  },
1113
841
  {
1114
842
  "name": "test::failed_nullifier_computation_is_ignored",
1115
- "start": 11073
843
+ "start": 10959
1116
844
  },
1117
845
  {
1118
846
  "name": "test::construct_note",
1119
- "start": 12166
847
+ "start": 12052
1120
848
  },
1121
849
  {
1122
850
  "name": "test::single_note",
1123
- "start": 13199
851
+ "start": 13085
1124
852
  },
1125
853
  {
1126
854
  "name": "test::multiple_notes_same_preimage",
1127
- "start": 14363
855
+ "start": 14249
1128
856
  },
1129
857
  {
1130
858
  "name": "test::single_note_misaligned_nonce",
1131
- "start": 16389
859
+ "start": 16275
1132
860
  },
1133
861
  {
1134
862
  "name": "test::single_note_nonce_with_index_past_note_hashes_in_tx",
1135
- "start": 17629
863
+ "start": 17515
1136
864
  },
1137
865
  {
1138
866
  "name": "test::duplicate_unique_note_hashes",
1139
- "start": 19051
867
+ "start": 18937
1140
868
  }
1141
869
  ],
1142
870
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/nonce_discovery.nr",
1143
- "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<Field, MAX_NOTE_HASHES_PER_TX>,\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<Field, MAX_NOTE_PACKED_LEN>,\n) -> BoundedVec<DiscoveredNoteInfo, MAX_NOTE_HASHES_PER_TX> {\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 aztecnr_debug_log_format!(\"Found valid nonces for a total of {0} notes\")([discovered_notes.len() as Field]);\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<Env, T, let MAX_LEN: u32>(\n bvec: BoundedVec<T, MAX_LEN>,\n filter: fn[Env](T) -> bool,\n) -> BoundedVec<T, MAX_LEN> {\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<Field, MAX_NOTE_PACKED_LEN>,\n owner: AztecAddress,\n storage_slot: Field,\n note_type_id: Field,\n _contract_address: AztecAddress,\n randomness: Field,\n ) -> Option<Field> {\n if (note_type_id == MockNote::get_id()) & (packed_note.len() == <MockNote as Packable>::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<Field, MAX_NOTE_PACKED_LEN>,\n owner: AztecAddress,\n _storage_slot: Field,\n note_type_id: Field,\n _contract_address: AztecAddress,\n _randomness: Field,\n ) -> Option<Field> {\n if (note_type_id == MockNote::get_id()) & (packed_note.len() == <MockNote as Packable>::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"
871
+ "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<Field, MAX_NOTE_HASHES_PER_TX>,\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<Field, MAX_NOTE_PACKED_LEN>,\n) -> BoundedVec<DiscoveredNoteInfo, MAX_NOTE_HASHES_PER_TX> {\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<Env, T, let MAX_LEN: u32>(\n bvec: BoundedVec<T, MAX_LEN>,\n filter: fn[Env](T) -> bool,\n) -> BoundedVec<T, MAX_LEN> {\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<Field, MAX_NOTE_PACKED_LEN>,\n owner: AztecAddress,\n storage_slot: Field,\n note_type_id: Field,\n _contract_address: AztecAddress,\n randomness: Field,\n ) -> Option<Field> {\n if (note_type_id == MockNote::get_id()) & (packed_note.len() == <MockNote as Packable>::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<Field, MAX_NOTE_PACKED_LEN>,\n owner: AztecAddress,\n _storage_slot: Field,\n note_type_id: Field,\n _contract_address: AztecAddress,\n _randomness: Field,\n ) -> Option<Field> {\n if (note_type_id == MockNote::get_id()) & (packed_note.len() == <MockNote as Packable>::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"
1144
872
  },
1145
873
  "131": {
1146
874
  "function_locations": [
1147
875
  {
1148
876
  "name": "process_partial_note_private_msg",
1149
- "start": 1828
877
+ "start": 1784
1150
878
  },
1151
879
  {
1152
880
  "name": "fetch_and_process_partial_note_completion_logs",
1153
- "start": 3185
881
+ "start": 3162
1154
882
  }
1155
883
  ],
1156
884
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/partial_notes.nr",
1157
- "source": "use crate::{\n capsules::CapsuleArray,\n messages::{\n discovery::{ComputeNoteHash, ComputeNoteNullifier, nonce_discovery::attempt_note_nonce_discovery},\n encoding::MAX_MESSAGE_CONTENT_LEN,\n logs::partial_note::{decode_partial_note_private_message, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN},\n processing::{\n enqueue_note_for_validation,\n get_pending_partial_notes_completion_logs,\n log_retrieval_response::{LogRetrievalResponse, MAX_LOG_CONTENT_LEN},\n },\n },\n utils::array,\n};\n\nuse crate::logging::{aztecnr_debug_log_format, aztecnr_warn_log_format};\nuse crate::protocol::{address::AztecAddress, hash::sha256_to_field, traits::{Deserialize, Serialize}};\n\n/// The slot in the PXE capsules where we store a `CapsuleArray` of `DeliveredPendingPartialNote`.\npub(crate) global DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT: Field = sha256_to_field(\n \"AZTEC_NR::DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT\".as_bytes(),\n);\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<Field, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN>,\n pub(crate) recipient: AztecAddress,\n}\n\npub(crate) unconstrained fn process_partial_note_private_msg(\n contract_address: AztecAddress,\n recipient: AztecAddress,\n msg_metadata: u64,\n msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n tx_hash: Field,\n) {\n let decoded = decode_partial_note_private_message(msg_metadata, msg_content);\n\n if decoded.is_some() {\n // We store the information of the partial note we found in a persistent capsule in PXE, so that we can later\n // search for the public log that will complete it.\n let (owner, randomness, note_completion_log_tag, note_type_id, packed_private_note_content) = decoded.unwrap();\n\n let pending = DeliveredPendingPartialNote {\n owner,\n randomness,\n note_completion_log_tag,\n note_type_id,\n packed_private_note_content,\n recipient,\n };\n\n CapsuleArray::at(\n contract_address,\n DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT,\n )\n .push(pending);\n } else {\n aztecnr_warn_log_format!(\n \"Could not decode partial note private message from tx {0}, ignoring\",\n )(\n [tx_hash],\n );\n }\n}\n\n/// Searches for logs that would result in the completion of pending partial notes, ultimately resulting in the notes\n/// being delivered to PXE if completed.\npub(crate) unconstrained fn fetch_and_process_partial_note_completion_logs(\n contract_address: AztecAddress,\n compute_note_hash: ComputeNoteHash,\n compute_note_nullifier: ComputeNoteNullifier,\n) {\n let pending_partial_notes = CapsuleArray::at(\n contract_address,\n DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT,\n );\n\n aztecnr_debug_log_format!(\"{} pending partial notes\")([pending_partial_notes.len() as Field]);\n\n // Each of the pending partial notes might get completed by a log containing its public values. For performance\n // reasons, we fetch all of these logs concurrently and then process them one by one, minimizing the amount of time\n // waiting for the node roundtrip.\n let maybe_completion_logs = get_pending_partial_notes_completion_logs(contract_address, pending_partial_notes);\n\n // Each entry in the maybe completion logs array corresponds to the entry in the pending partial notes array at the\n // same index. This means we can use the same index as we iterate through the responses to get both the partial\n // note and the log that might complete it.\n assert_eq(maybe_completion_logs.len(), pending_partial_notes.len());\n\n maybe_completion_logs.for_each(|i, maybe_log: Option<LogRetrievalResponse>| {\n // We clear the completion logs as we read them so that the array is empty by the time we next query it.\n // TODO(#14943): use volatile arrays to avoid having to manually clear this.\n maybe_completion_logs.remove(i);\n\n let pending_partial_note = pending_partial_notes.get(i);\n\n if maybe_log.is_none() {\n aztecnr_debug_log_format!(\"Found no completion logs for partial note with tag {}\")(\n [pending_partial_note.note_completion_log_tag],\n );\n\n // Note that we're not removing the pending partial note from the capsule array, so we will continue\n // searching for this tagged log when performing message discovery in the future until we either find it or\n // the entry is somehow removed from the array.\n } else {\n aztecnr_debug_log_format!(\"Completion log found for partial note with tag {}\")([\n pending_partial_note.note_completion_log_tag,\n ]);\n let log = maybe_log.unwrap();\n\n // The first field in the completion log payload is the storage slot, followed by the public note\n // content fields.\n let storage_slot = log.log_payload.get(0);\n let public_note_content: BoundedVec<Field, MAX_LOG_CONTENT_LEN - 1> = array::subbvec(log.log_payload, 1);\n\n // Public fields are assumed to all be placed at the end of the packed representation, so we combine\n // the private and public packed fields (i.e. the contents of the private message and public log\n // plaintext) to get the complete packed content.\n let complete_packed_note = array::append(\n pending_partial_note.packed_private_note_content,\n public_note_content,\n );\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 contract_address,\n pending_partial_note.owner,\n storage_slot,\n pending_partial_note.randomness,\n pending_partial_note.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\n // being 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_partial_note.note_completion_log_tag,\n ]);\n\n discovered_notes.for_each(|discovered_note| {\n enqueue_note_for_validation(\n contract_address,\n pending_partial_note.owner,\n storage_slot,\n pending_partial_note.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 pending_partial_note.recipient,\n );\n });\n\n // Because there is only a single log for a given tag, once we've processed the tagged log then we simply\n // delete the pending work entry, regardless of whether it was actually completed or not.\n pending_partial_notes.remove(i);\n }\n });\n}\n"
885
+ "source": "use crate::{\n capsules::CapsuleArray,\n messages::{\n discovery::{ComputeNoteHash, ComputeNoteNullifier, nonce_discovery::attempt_note_nonce_discovery},\n encoding::MAX_MESSAGE_CONTENT_LEN,\n logs::partial_note::{decode_partial_note_private_message, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN},\n processing::{\n enqueue_note_for_validation,\n get_pending_partial_notes_completion_logs,\n log_retrieval_response::{LogRetrievalResponse, MAX_LOG_CONTENT_LEN},\n },\n },\n utils::array,\n};\n\nuse crate::logging::{aztecnr_debug_log_format, aztecnr_warn_log_format};\nuse crate::protocol::{address::AztecAddress, hash::sha256_to_field, traits::{Deserialize, Serialize}};\n\n/// The slot in the PXE capsules where we store a `CapsuleArray` of `DeliveredPendingPartialNote`.\npub(crate) global DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT: Field = sha256_to_field(\n \"AZTEC_NR::DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT\".as_bytes(),\n);\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<Field, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN>,\n}\n\npub(crate) unconstrained fn process_partial_note_private_msg(\n contract_address: AztecAddress,\n msg_metadata: u64,\n msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n tx_hash: Field,\n scope: AztecAddress,\n) {\n let decoded = decode_partial_note_private_message(msg_metadata, msg_content);\n\n if decoded.is_some() {\n // We store the information of the partial note we found in a persistent capsule in PXE, so that we can later\n // search for the public log that will complete it.\n let (owner, randomness, note_completion_log_tag, note_type_id, packed_private_note_content) = decoded.unwrap();\n\n let pending = DeliveredPendingPartialNote {\n owner,\n randomness,\n note_completion_log_tag,\n note_type_id,\n packed_private_note_content,\n };\n\n CapsuleArray::at(\n contract_address,\n DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT,\n scope,\n )\n .push(pending);\n } else {\n aztecnr_warn_log_format!(\n \"Could not decode partial note private message from tx {0}, ignoring\",\n )(\n [tx_hash],\n );\n }\n}\n\n/// Searches for logs that would result in the completion of pending partial notes, ultimately resulting in the notes\n/// being delivered to PXE if completed.\npub(crate) unconstrained fn fetch_and_process_partial_note_completion_logs(\n contract_address: AztecAddress,\n compute_note_hash: ComputeNoteHash,\n compute_note_nullifier: ComputeNoteNullifier,\n scope: AztecAddress,\n) {\n let pending_partial_notes = CapsuleArray::at(\n contract_address,\n DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT,\n scope,\n );\n\n aztecnr_debug_log_format!(\"{} pending partial notes\")([pending_partial_notes.len() as Field]);\n\n // Each of the pending partial notes might get completed by a log containing its public values. For performance\n // reasons, we fetch all of these logs concurrently and then process them one by one, minimizing the amount of time\n // waiting for the node roundtrip.\n let maybe_completion_logs =\n get_pending_partial_notes_completion_logs(contract_address, pending_partial_notes, scope);\n\n // Each entry in the maybe completion logs array corresponds to the entry in the pending partial notes array at the\n // same index. This means we can use the same index as we iterate through the responses to get both the partial\n // note and the log that might complete it.\n assert_eq(maybe_completion_logs.len(), pending_partial_notes.len());\n\n maybe_completion_logs.for_each(|i, maybe_log: Option<LogRetrievalResponse>| {\n // We clear the completion logs as we read them so that the array is empty by the time we next query it.\n // TODO(#14943): use volatile arrays to avoid having to manually clear this.\n maybe_completion_logs.remove(i);\n\n let pending_partial_note = pending_partial_notes.get(i);\n\n if maybe_log.is_none() {\n aztecnr_debug_log_format!(\"Found no completion logs for partial note with tag {}\")(\n [pending_partial_note.note_completion_log_tag],\n );\n\n // Note that we're not removing the pending partial note from the capsule array, so we will continue\n // searching for this tagged log when performing message discovery in the future until we either find it or\n // the entry is somehow removed from the array.\n } else {\n aztecnr_debug_log_format!(\"Completion log found for partial note with tag {}\")([\n pending_partial_note.note_completion_log_tag,\n ]);\n let log = maybe_log.unwrap();\n\n // The first field in the completion log payload is the storage slot, followed by the public note\n // content fields.\n let storage_slot = log.log_payload.get(0);\n let public_note_content: BoundedVec<Field, MAX_LOG_CONTENT_LEN - 1> = array::subbvec(log.log_payload, 1);\n\n // Public fields are assumed to all be placed at the end of the packed representation, so we combine\n // the private and public packed fields (i.e. the contents of the private message and public log\n // plaintext) to get the complete packed content.\n let complete_packed_note = array::append(\n pending_partial_note.packed_private_note_content,\n public_note_content,\n );\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 contract_address,\n pending_partial_note.owner,\n storage_slot,\n pending_partial_note.randomness,\n pending_partial_note.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\n // being 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_partial_note.note_completion_log_tag,\n ]);\n\n discovered_notes.for_each(|discovered_note| {\n enqueue_note_for_validation(\n contract_address,\n pending_partial_note.owner,\n storage_slot,\n pending_partial_note.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 scope,\n );\n });\n\n // Because there is only a single log for a given tag, once we've processed the tagged log then we simply\n // delete the pending work entry, regardless of whether it was actually completed or not.\n pending_partial_notes.remove(i);\n }\n });\n}\n"
1158
886
  },
1159
887
  "132": {
1160
888
  "function_locations": [
@@ -1164,35 +892,35 @@
1164
892
  }
1165
893
  ],
1166
894
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/private_events.nr",
1167
- "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 recipient: AztecAddress,\n msg_metadata: u64,\n msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\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 recipient,\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"
895
+ "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<Field, MAX_MESSAGE_CONTENT_LEN>,\n tx_hash: Field,\n recipient: AztecAddress,\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 recipient,\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"
1168
896
  },
1169
897
  "133": {
1170
898
  "function_locations": [
1171
899
  {
1172
900
  "name": "process_private_note_msg",
1173
- "start": 858
901
+ "start": 890
1174
902
  },
1175
903
  {
1176
904
  "name": "attempt_note_discovery",
1177
- "start": 2234
905
+ "start": 2266
1178
906
  }
1179
907
  ],
1180
908
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/private_notes.nr",
1181
- "source": "use crate::logging::{aztecnr_debug_log_format, aztecnr_warn_log_format};\nuse crate::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};\nuse crate::protocol::{address::AztecAddress, constants::MAX_NOTE_HASHES_PER_TX};\n\npub(crate) unconstrained fn process_private_note_msg(\n contract_address: AztecAddress,\n tx_hash: Field,\n unique_note_hashes_in_tx: BoundedVec<Field, MAX_NOTE_HASHES_PER_TX>,\n first_nullifier_in_tx: Field,\n recipient: AztecAddress,\n compute_note_hash: ComputeNoteHash,\n compute_note_nullifier: ComputeNoteNullifier,\n msg_metadata: u64,\n msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\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 recipient,\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.\npub unconstrained fn attempt_note_discovery(\n contract_address: AztecAddress,\n tx_hash: Field,\n unique_note_hashes_in_tx: BoundedVec<Field, MAX_NOTE_HASHES_PER_TX>,\n first_nullifier_in_tx: Field,\n recipient: AztecAddress,\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<Field, MAX_NOTE_PACKED_LEN>,\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 aztecnr_debug_log_format!(\"Discovered {0} notes from a private message\")([discovered_notes.len() as Field]);\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 recipient,\n );\n });\n}\n"
909
+ "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\npub(crate) unconstrained fn process_private_note_msg(\n contract_address: AztecAddress,\n tx_hash: Field,\n unique_note_hashes_in_tx: BoundedVec<Field, MAX_NOTE_HASHES_PER_TX>,\n first_nullifier_in_tx: Field,\n compute_note_hash: ComputeNoteHash,\n compute_note_nullifier: ComputeNoteNullifier,\n msg_metadata: u64,\n msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n recipient: AztecAddress,\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 recipient,\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.\npub unconstrained fn attempt_note_discovery(\n contract_address: AztecAddress,\n tx_hash: Field,\n unique_note_hashes_in_tx: BoundedVec<Field, MAX_NOTE_HASHES_PER_TX>,\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<Field, MAX_NOTE_PACKED_LEN>,\n recipient: AztecAddress,\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 recipient,\n );\n });\n}\n"
1182
910
  },
1183
911
  "134": {
1184
912
  "function_locations": [
1185
913
  {
1186
914
  "name": "process_message_ciphertext",
1187
- "start": 1946
915
+ "start": 1975
1188
916
  },
1189
917
  {
1190
918
  "name": "process_message_plaintext",
1191
- "start": 2885
919
+ "start": 2968
1192
920
  }
1193
921
  ],
1194
922
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/process_message.nr",
1195
- "source": "use crate::messages::{\n discovery::{\n ComputeNoteHash, ComputeNoteNullifier, CustomMessageHandler, partial_notes::process_partial_note_private_msg,\n private_events::process_private_event_msg, 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::MessageContext,\n};\n\nuse crate::logging::{aztecnr_debug_log, aztecnr_warn_log_format};\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<CustomMessageHandlerEnv>(\n contract_address: AztecAddress,\n compute_note_hash: ComputeNoteHash,\n compute_note_nullifier: ComputeNoteNullifier,\n process_custom_message: Option<CustomMessageHandler<CustomMessageHandlerEnv>>,\n message_ciphertext: BoundedVec<Field, MESSAGE_CIPHERTEXT_LEN>,\n message_context: MessageContext,\n) {\n let message_plaintext_option = AES128::decrypt(message_ciphertext, message_context.recipient);\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 message_context,\n );\n } else {\n aztecnr_warn_log_format!(\"Could not decrypt message ciphertext from tx {0}, ignoring\")([message_context.tx_hash]);\n }\n}\n\npub(crate) unconstrained fn process_message_plaintext<CustomMessageHandlerEnv>(\n contract_address: AztecAddress,\n compute_note_hash: ComputeNoteHash,\n compute_note_nullifier: ComputeNoteNullifier,\n process_custom_message: Option<CustomMessageHandler<CustomMessageHandlerEnv>>,\n message_plaintext: BoundedVec<Field, MESSAGE_PLAINTEXT_LEN>,\n message_context: MessageContext,\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 message_context.tx_hash,\n message_context.unique_note_hashes_in_tx,\n message_context.first_nullifier_in_tx,\n message_context.recipient,\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 message_context.recipient,\n msg_metadata,\n msg_content,\n message_context.tx_hash,\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 message_context.recipient,\n msg_metadata,\n msg_content,\n message_context.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 message_context,\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\")([message_context.tx_hash]);\n }\n}\n"
923
+ "source": "use crate::messages::{\n discovery::{\n ComputeNoteHash, ComputeNoteNullifier, CustomMessageHandler, partial_notes::process_partial_note_private_msg,\n private_events::process_private_event_msg, 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::MessageContext,\n};\n\nuse crate::logging::{aztecnr_debug_log, aztecnr_warn_log_format};\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<CustomMessageHandlerEnv>(\n contract_address: AztecAddress,\n compute_note_hash: ComputeNoteHash,\n compute_note_nullifier: ComputeNoteNullifier,\n process_custom_message: Option<CustomMessageHandler<CustomMessageHandlerEnv>>,\n message_ciphertext: BoundedVec<Field, MESSAGE_CIPHERTEXT_LEN>,\n message_context: MessageContext,\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 message_context,\n recipient,\n );\n } else {\n aztecnr_warn_log_format!(\"Could not decrypt message ciphertext from tx {0}, ignoring\")([message_context.tx_hash]);\n }\n}\n\npub(crate) unconstrained fn process_message_plaintext<CustomMessageHandlerEnv>(\n contract_address: AztecAddress,\n compute_note_hash: ComputeNoteHash,\n compute_note_nullifier: ComputeNoteNullifier,\n process_custom_message: Option<CustomMessageHandler<CustomMessageHandlerEnv>>,\n message_plaintext: BoundedVec<Field, MESSAGE_PLAINTEXT_LEN>,\n message_context: MessageContext,\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 message_context.tx_hash,\n message_context.unique_note_hashes_in_tx,\n message_context.first_nullifier_in_tx,\n compute_note_hash,\n compute_note_nullifier,\n msg_metadata,\n msg_content,\n recipient,\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 message_context.tx_hash,\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 message_context.tx_hash,\n recipient,\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 message_context,\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\")([message_context.tx_hash]);\n }\n}\n"
1196
924
  },
1197
925
  "135": {
1198
926
  "function_locations": [
@@ -1259,92 +987,88 @@
1259
987
  "136": {
1260
988
  "function_locations": [
1261
989
  {
1262
- "name": "extract_many_close_to_uniformly_random_256_bits_from_ecdh_shared_secret_using_poseidon2_unsafe",
1263
- "start": 1834
990
+ "name": "extract_many_close_to_uniformly_random_256_bits_using_poseidon2",
991
+ "start": 1736
1264
992
  },
1265
993
  {
1266
994
  "name": "derive_aes_symmetric_key_and_iv_from_uniformly_random_256_bits",
1267
- "start": 5477
995
+ "start": 4755
1268
996
  },
1269
997
  {
1270
- "name": "derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_poseidon2_unsafe",
1271
- "start": 6069
998
+ "name": "derive_aes_symmetric_key_and_iv_from_shared_secret",
999
+ "start": 5304
1272
1000
  },
1273
1001
  {
1274
1002
  "name": "<impl MessageEncryption for AES128>::encrypt",
1275
- "start": 10883
1003
+ "start": 10337
1276
1004
  },
1277
1005
  {
1278
1006
  "name": "<impl MessageEncryption for AES128>::decrypt",
1279
- "start": 18163
1007
+ "start": 17660
1280
1008
  },
1281
1009
  {
1282
1010
  "name": "encode_header",
1283
- "start": 22337
1011
+ "start": 21676
1284
1012
  },
1285
1013
  {
1286
1014
  "name": "extract_ciphertext_length",
1287
- "start": 22668
1015
+ "start": 22007
1288
1016
  },
1289
1017
  {
1290
1018
  "name": "unmask_field",
1291
- "start": 23261
1292
- },
1293
- {
1294
- "name": "derive_field_mask",
1295
- "start": 23685
1019
+ "start": 22592
1296
1020
  },
1297
1021
  {
1298
1022
  "name": "random_address_point",
1299
- "start": 24049
1023
+ "start": 23005
1300
1024
  },
1301
1025
  {
1302
1026
  "name": "test::encrypt_decrypt_deterministic",
1303
- "start": 25180
1027
+ "start": 24172
1304
1028
  },
1305
1029
  {
1306
1030
  "name": "test::encrypt_decrypt_random",
1307
- "start": 27437
1031
+ "start": 26650
1308
1032
  },
1309
1033
  {
1310
1034
  "name": "test::encrypt_to_invalid_address",
1311
- "start": 28082
1035
+ "start": 27496
1312
1036
  },
1313
1037
  {
1314
1038
  "name": "test::pkcs7_padding_always_adds_at_least_one_byte",
1315
- "start": 28643
1039
+ "start": 27946
1316
1040
  },
1317
1041
  {
1318
1042
  "name": "test::encrypt_decrypt_max_size_plaintext",
1319
- "start": 29207
1043
+ "start": 28510
1320
1044
  },
1321
1045
  {
1322
1046
  "name": "test::encrypt_oversized_plaintext",
1323
- "start": 29905
1047
+ "start": 29409
1324
1048
  },
1325
1049
  {
1326
1050
  "name": "test::random_address_point_produces_valid_points",
1327
- "start": 30186
1051
+ "start": 29767
1328
1052
  },
1329
1053
  {
1330
1054
  "name": "test::decrypt_invalid_ephemeral_public_key",
1331
- "start": 30637
1055
+ "start": 30218
1332
1056
  },
1333
1057
  {
1334
1058
  "name": "test::decrypt_returns_none_on_empty_ciphertext",
1335
- "start": 31381
1059
+ "start": 31063
1336
1060
  },
1337
1061
  {
1338
1062
  "name": "test::decrypt_returns_none_on_empty_header",
1339
- "start": 31832
1063
+ "start": 31617
1340
1064
  },
1341
1065
  {
1342
1066
  "name": "test::decrypt_returns_none_on_oversized_ciphertext_length",
1343
- "start": 32660
1067
+ "start": 32543
1344
1068
  }
1345
1069
  ],
1346
1070
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/encryption/aes128.nr",
1347
- "source": "use crate::protocol::{\n address::AztecAddress,\n constants::{DOM_SEP__CIPHERTEXT_FIELD_MASK, DOM_SEP__SYMMETRIC_KEY, DOM_SEP__SYMMETRIC_KEY_2},\n hash::poseidon2_hash_with_separator,\n point::Point,\n public_keys::AddressPoint,\n traits::ToField,\n};\n\nuse crate::{\n keys::{ecdh_shared_secret::derive_ecdh_shared_secret, ephemeral::generate_positive_ephemeral_key_pair},\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_to_fields::{bytes_from_fields, bytes_to_fields},\n fields_to_bytes::{fields_to_bytes, try_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 ECDH shared_secret.\n///\n/// NEVER re-use the same iv and sym_key. DO NOT call this function more than once with the same shared_secret.\n///\n/// This function is only known to be safe if shared_secret is computed by combining a random ephemeral key with an\n/// address point. See big comment within the body of the function. See big comment within the body of the function.\nfn extract_many_close_to_uniformly_random_256_bits_from_ecdh_shared_secret_using_poseidon2_unsafe<let N: u32>(\n shared_secret: Point,\n) -> [[u8; 32]; N] {\n /*\n * Unsafe because of https://eprint.iacr.org/2010/264.pdf Page 13, Lemma 2 (and the * two\n paragraphs below it).\n *\n * If you call this function, you need to be careful and aware of how the arg\n * `shared_secret` has been derived.\n *\n * The paper says that the way you derive aes keys and IVs should be fine with poseidon2\n * (modelled as a RO), as long as you _don't_ use Poseidon2 as a PRG to generate the * two\n exponents x & y which multiply to the 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\n * which can be public and 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\n curve (which is 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)\n using poseidon2 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\n * discussion about whether address_sk is independent of poseidon2.\n * 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,\n * in order to derive a symmetric key.\n *\n * If you're calling this function for a differently-derived `shared_secret`, be\n * careful.\n *\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.\n * So we compute two \"random\" fields, by poseidon-hashing with two different\n * generators.\n * 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\n * be careful not to take bytes from the \"big end\", because the \"big\" byte is\n * not uniformly random over the byte: it only has < 6 bits of randomness, because\n * 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 // We restrict N to be < 2^8, because of how we compute the domain separator from k below (where k <= N must be 8\n // bits). In practice, it's extremely unlikely that an app will want to compute >= 256 ciphertexts.\n std::static_assert(N < 256, \"N too large\");\n for k in 0..N {\n // We augment the domain separator with the loop index, so that we can generate N lots of randomness.\n let k_shift = (k << 8);\n let separator_1 = k_shift + DOM_SEP__SYMMETRIC_KEY;\n let separator_2 = k_shift + DOM_SEP__SYMMETRIC_KEY_2;\n\n let rand1: Field = poseidon2_hash_with_separator([shared_secret.x, shared_secret.y], separator_1);\n let rand2: Field = poseidon2_hash_with_separator([shared_secret.x, shared_secret.y], separator_2);\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<let N: u32>(\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_ecdh_shared_secret_using_poseidon2_unsafe<let N: u32>(\n shared_secret: Point,\n) -> [([u8; 16], [u8; 16]); N] {\n let many_random_256_bits: [[u8; 32]; N] =\n extract_many_close_to_uniformly_random_256_bits_from_ecdh_shared_secret_using_poseidon2_unsafe(shared_secret);\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_field_mask`) is added to each so that the resulting fields appear as\n /// uniformly random `Field` values to any observer without knowledge of the shared secret, hiding the fact\n /// 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 /// Two (key, IV) pairs are derived from the ECDH shared secret via Poseidon2 hashing with different domain\n /// separators: one pair for the body ciphertext and one for the header ciphertext.\n fn encrypt<let PlaintextLen: u32>(\n plaintext: [Field; PlaintextLen],\n recipient: 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 = fields_to_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 ciphertext_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 // AES128-CBC encrypt the plaintext bytes.\n // It is safe to call the `unsafe` function here, because we know the `shared_secret` was derived using an\n // AztecAddress (the recipient). See the block comment at the start of this unsafe target function for more\n // info.\n let pairs = derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_poseidon2_unsafe::<2>(\n ciphertext_shared_secret,\n );\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::<PlaintextLen * 32>();\n\n let mut message_bytes = get_arr_of_size__message_bytes__from_PT::<PlaintextLen * 32>();\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 = bytes_to_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_field_mask(ciphertext_shared_secret, 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<Field, MESSAGE_CIPHERTEXT_LEN>,\n recipient: AztecAddress,\n ) -> Option<BoundedVec<Field, MESSAGE_PLAINTEXT_LEN>> {\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<Field, MESSAGE_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS> =\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`.\n point_from_x_coord_and_sign(eph_pk_x, true).and_then(|eph_pk| {\n // Derive shared secret\n let ciphertext_shared_secret = get_shared_secret(recipient, eph_pk);\n\n let unmasked_fields = masked_fields.mapi(|i, field| {\n let unmasked = unmask_field(ciphertext_shared_secret, 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 = bytes_from_fields(unmasked_fields);\n\n // Derive symmetric keys:\n let pairs = derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_poseidon2_unsafe::<2>(\n ciphertext_shared_secret,\n );\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 necessary\n // here as the header ciphertext length is fixed. But we do it anyway to not have to have duplicate\n // oracles.\n let header_ciphertext_bvec =\n BoundedVec::<u8, HEADER_CIPHERTEXT_SIZE_IN_BYTES>::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_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<let N: u32>(header: BoundedVec<u8, N>) -> Option<u32> {\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(shared_secret: Point, index: u32, masked: Field) -> Option<Field> {\n let unmasked = masked - derive_field_mask(shared_secret, index);\n if unmasked.lt(TWO_POW_248) {\n Option::some(unmasked)\n } else {\n Option::none()\n }\n}\n\n/// Derives a field mask from an ECDH shared secret and field index. Applied only to data fields (those carrying\n/// packed message bytes). Padding fields use `random()` instead.\nfn derive_field_mask(shared_secret: Point, index: u32) -> Field {\n poseidon2_hash_with_separator(\n [shared_secret.x, shared_secret.y],\n DOM_SEP__CIPHERTEXT_FIELD_MASK + index,\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 keys::ecdh_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(|_| {\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_utl_getRandomField\").returns(eph_sk).times(1);\n\n let randomness = 0x0101010101010101010101010101010101010101010101010101010101010101;\n let _ = OracleMock::mock(\"aztec_utl_getRandomField\").returns(randomness).times(1000000);\n\n let _ = OracleMock::mock(\"aztec_prv_getNextAppTagAsSender\").returns(42);\n\n // Encrypt the message\n let encrypted_message = BoundedVec::from_array(AES128::encrypt(plaintext, recipient));\n\n // Mock shared secret for deterministic test\n let shared_secret = derive_ecdh_shared_secret(\n EmbeddedCurveScalar::from_field(eph_sk),\n recipient.to_address_point().unwrap().inner,\n );\n\n let _ = OracleMock::mock(\"aztec_utl_getSharedSecret\").returns(shared_secret);\n\n // Decrypt the message\n let decrypted = AES128::decrypt(encrypted_message, recipient).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::<Field, MESSAGE_PLAINTEXT_LEN>::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(|_| {\n let plaintext = [1, 2, 3];\n let ciphertext = AES128::encrypt(plaintext, recipient);\n\n assert_eq(\n AES128::decrypt(BoundedVec::from_array(ciphertext), recipient).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\n // We just test that we produced some output and did not crash - the result is gibberish as it is encrypted\n // using a public key for which we do not know the private key.\n let _ = AES128::encrypt([1, 2, 3, 4], invalid_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(|_| {\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);\n\n assert_eq(\n AES128::decrypt(BoundedVec::from_array(ciphertext), recipient).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 plaintext: [Field; MESSAGE_PLAINTEXT_LEN + 1] = [0; MESSAGE_PLAINTEXT_LEN + 1];\n let _ = AES128::encrypt(plaintext, 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(|_| {\n let plaintext = [1, 2, 3, 4];\n let ciphertext = AES128::encrypt(plaintext, recipient);\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).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(|_| { assert(AES128::decrypt(BoundedVec::new(), recipient).is_none()); });\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(|_| {\n let plaintext = [1, 2, 3];\n let ciphertext = BoundedVec::from_array(AES128::encrypt(plaintext, recipient));\n\n let empty_header = BoundedVec::<u8, HEADER_CIPHERTEXT_SIZE_IN_BYTES>::new();\n let _ = OracleMock::mock(\"aztec_utl_tryAes128Decrypt\").returns(Option::some(empty_header)).times(1);\n\n assert(AES128::decrypt(ciphertext, recipient).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(|_| {\n let plaintext = [1, 2, 3];\n let ciphertext = BoundedVec::from_array(AES128::encrypt(plaintext, recipient));\n\n let bad_header = BoundedVec::<u8, HEADER_CIPHERTEXT_SIZE_IN_BYTES>::from_array(encode_header(\n MESSAGE_PLAINTEXT_SIZE_IN_BYTES + 1,\n ));\n let _ = OracleMock::mock(\"aztec_utl_tryAes128Decrypt\").returns(Option::some(bad_header)).times(1);\n\n assert(AES128::decrypt(ciphertext, recipient).is_none());\n });\n }\n\n}\n"
1071
+ "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_to_fields::{bytes_from_fields, bytes_to_fields},\n fields_to_bytes::{fields_to_bytes, try_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<let N: u32>(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<let N: u32>(\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<let N: u32>(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<let PlaintextLen: u32>(\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 = fields_to_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::<PlaintextLen * 32>();\n\n let mut message_bytes = get_arr_of_size__message_bytes__from_PT::<PlaintextLen * 32>();\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 = bytes_to_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<Field, MESSAGE_CIPHERTEXT_LEN>,\n recipient: AztecAddress,\n contract_address: AztecAddress,\n ) -> Option<BoundedVec<Field, MESSAGE_PLAINTEXT_LEN>> {\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<Field, MESSAGE_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS> =\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`.\n point_from_x_coord_and_sign(eph_pk_x, true).and_then(|eph_pk| {\n let s_app = get_shared_secret(recipient, eph_pk, contract_address);\n\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 = 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 necessary\n // here as the header ciphertext length is fixed. But we do it anyway to not have to have duplicate\n // oracles.\n let header_ciphertext_bvec =\n BoundedVec::<u8, HEADER_CIPHERTEXT_SIZE_IN_BYTES>::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_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<let N: u32>(header: BoundedVec<u8, N>) -> Option<u32> {\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<Field> {\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 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_utl_getRandomField\").returns(eph_sk).times(1);\n\n let randomness = 0x0101010101010101010101010101010101010101010101010101010101010101;\n let _ = OracleMock::mock(\"aztec_utl_getRandomField\").returns(randomness).times(1000000);\n\n let _ = OracleMock::mock(\"aztec_prv_getNextAppTagAsSender\").returns(42);\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 let _ = OracleMock::mock(\"aztec_utl_getSharedSecret\").returns(s_app);\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::<Field, MESSAGE_PLAINTEXT_LEN>::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::<u8, HEADER_CIPHERTEXT_SIZE_IN_BYTES>::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::<u8, HEADER_CIPHERTEXT_SIZE_IN_BYTES>::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"
1348
1072
  },
1349
1073
  "141": {
1350
1074
  "function_locations": [
@@ -1416,113 +1140,109 @@
1416
1140
  },
1417
1141
  "144": {
1418
1142
  "function_locations": [
1419
- {
1420
- "name": "compute_partial_note_private_content_log",
1421
- "start": 1718
1422
- },
1423
1143
  {
1424
1144
  "name": "encode_partial_note_private_message",
1425
- "start": 2662
1145
+ "start": 1715
1426
1146
  },
1427
1147
  {
1428
1148
  "name": "decode_partial_note_private_message",
1429
- "start": 4757
1149
+ "start": 3810
1430
1150
  },
1431
1151
  {
1432
1152
  "name": "test::encode_decode",
1433
- "start": 6969
1153
+ "start": 6022
1434
1154
  },
1435
1155
  {
1436
1156
  "name": "test::decode_empty_content_returns_none",
1437
- "start": 7946
1157
+ "start": 6999
1438
1158
  },
1439
1159
  {
1440
1160
  "name": "test::decode_succeeds_with_only_reserved_fields",
1441
- "start": 8144
1161
+ "start": 7197
1442
1162
  }
1443
1163
  ],
1444
1164
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/logs/partial_note.nr",
1445
- "source": "use crate::{\n messages::{\n encoding::{encode_message, MAX_MESSAGE_CONTENT_LEN, MESSAGE_EXPANDED_METADATA_LEN},\n encryption::{aes128::AES128, message_encryption::MessageEncryption},\n logs::utils::prefix_with_tag,\n msg_type::PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID,\n },\n note::note_interface::NoteType,\n utils::array,\n};\nuse crate::protocol::{\n address::AztecAddress,\n constants::PRIVATE_LOG_SIZE_IN_FIELDS,\n traits::{FromField, Packable, ToField},\n};\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// TODO(#16881): once partial notes support delivery via an offchain message we will most likely want to remove this.\npub fn compute_partial_note_private_content_log<PartialNotePrivateContent>(\n partial_note_private_content: PartialNotePrivateContent,\n owner: AztecAddress,\n randomness: Field,\n recipient: AztecAddress,\n note_completion_log_tag: Field,\n) -> [Field; PRIVATE_LOG_SIZE_IN_FIELDS]\nwhere\n PartialNotePrivateContent: NoteType + Packable,\n{\n let message_plaintext = encode_partial_note_private_message(\n partial_note_private_content,\n owner,\n randomness,\n note_completion_log_tag,\n );\n let message_ciphertext = AES128::encrypt(message_plaintext, recipient);\n\n prefix_with_tag(message_ciphertext, recipient)\n}\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<PartialNotePrivateContent>(\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 + <PartialNotePrivateContent as Packable>::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 + <PartialNotePrivateContent as Packable>::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<Field, MAX_MESSAGE_CONTENT_LEN>,\n) -> Option<(AztecAddress, Field, Field, Field, BoundedVec<Field, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN>)> {\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<Field, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN> = 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"
1165
+ "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<PartialNotePrivateContent>(\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 + <PartialNotePrivateContent as Packable>::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 + <PartialNotePrivateContent as Packable>::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<Field, MAX_MESSAGE_CONTENT_LEN>,\n) -> Option<(AztecAddress, Field, Field, Field, BoundedVec<Field, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN>)> {\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<Field, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN> = 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"
1446
1166
  },
1447
1167
  "154": {
1448
1168
  "function_locations": [
1449
1169
  {
1450
1170
  "name": "get_private_logs",
1451
- "start": 2416
1171
+ "start": 2409
1452
1172
  },
1453
1173
  {
1454
1174
  "name": "enqueue_note_for_validation",
1455
- "start": 4843
1175
+ "start": 4842
1456
1176
  },
1457
1177
  {
1458
1178
  "name": "enqueue_event_for_validation",
1459
- "start": 6478
1179
+ "start": 6545
1460
1180
  },
1461
1181
  {
1462
1182
  "name": "validate_and_store_enqueued_notes_and_events",
1463
- "start": 7506
1183
+ "start": 7654
1464
1184
  },
1465
1185
  {
1466
- "name": "resolve_message_contexts",
1467
- "start": 8325
1186
+ "name": "get_message_contexts_by_tx_hash",
1187
+ "start": 8520
1468
1188
  },
1469
1189
  {
1470
1190
  "name": "get_pending_partial_notes_completion_logs",
1471
- "start": 9320
1191
+ "start": 9562
1472
1192
  }
1473
1193
  ],
1474
1194
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/processing/mod.nr",
1475
- "source": "pub(crate) mod event_validation_request;\npub mod offchain;\n\nmod message_context;\npub use message_context::MessageContext;\npub(crate) use message_context::MessageTxContext;\n\npub(crate) mod note_validation_request;\npub(crate) mod log_retrieval_request;\npub(crate) mod log_retrieval_response;\npub(crate) mod pending_tagged_log;\n\nuse crate::{\n capsules::CapsuleArray,\n event::EventSelector,\n messages::{\n discovery::partial_notes::DeliveredPendingPartialNote,\n encoding::MESSAGE_CIPHERTEXT_LEN,\n logs::{event::MAX_EVENT_SERIALIZED_LEN, note::MAX_NOTE_PACKED_LEN},\n processing::{\n log_retrieval_request::LogRetrievalRequest, log_retrieval_response::LogRetrievalResponse,\n note_validation_request::NoteValidationRequest, pending_tagged_log::PendingTaggedLog,\n },\n },\n oracle,\n};\nuse crate::protocol::{address::AztecAddress, hash::sha256_to_field, traits::{Deserialize, Serialize}};\nuse event_validation_request::EventValidationRequest;\n\n// Base slot for the pending tagged log array to which the fetch_tagged_logs oracle inserts found private logs.\npub(crate) global PENDING_TAGGED_LOG_ARRAY_BASE_SLOT: Field =\n sha256_to_field(\"AZTEC_NR::PENDING_TAGGED_LOG_ARRAY_BASE_SLOT\".as_bytes());\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\nglobal LOG_RETRIEVAL_RESPONSES_ARRAY_BASE_SLOT: Field = sha256_to_field(\n \"AZTEC_NR::LOG_RETRIEVAL_RESPONSES_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 OffchainMessageWithContext {\n pub message_ciphertext: BoundedVec<Field, MESSAGE_CIPHERTEXT_LEN>,\n pub message_context: MessageContext,\n}\n\n/// Searches for private logs emitted by `contract_address` that might contain messages for one of the local accounts,\n/// and stores them in a `CapsuleArray` which is then returned.\npub(crate) unconstrained fn get_private_logs(contract_address: AztecAddress) -> CapsuleArray<PendingTaggedLog> {\n // We will eventually perform log discovery via tagging here, but for now we simply call the `fetchTaggedLogs`\n // oracle. This makes PXE synchronize tags, download logs and store the pending tagged logs in a capsule array.\n oracle::message_processing::fetch_tagged_logs(PENDING_TAGGED_LOG_ARRAY_BASE_SLOT);\n\n CapsuleArray::at(contract_address, PENDING_TAGGED_LOG_ARRAY_BASE_SLOT)\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/// `recipient` 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<Field, MAX_NOTE_PACKED_LEN>,\n note_hash: Field,\n nullifier: Field,\n tx_hash: Field,\n recipient: AztecAddress,\n) {\n // We store requests in a `CapsuleArray`, which PXE will later read from and deserialize into its version of the\n // Noir `NoteValidationRequest`\n CapsuleArray::at(contract_address, NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT).push(\n NoteValidationRequest {\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 recipient,\n },\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<Field, MAX_EVENT_SERIALIZED_LEN>,\n event_commitment: Field,\n tx_hash: Field,\n recipient: AztecAddress,\n) {\n // We store requests in a `CapsuleArray`, which PXE will later read from and deserialize into its version of the\n // Noir `EventValidationRequest`\n CapsuleArray::at(contract_address, EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT).push(\n EventValidationRequest {\n contract_address,\n event_type_id,\n randomness,\n serialized_event,\n event_commitment,\n tx_hash,\n recipient,\n },\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).\n///\n/// This automatically clears both validation request queues, so no further work needs to be done by the caller.\npub unconstrained fn validate_and_store_enqueued_notes_and_events(contract_address: AztecAddress) {\n oracle::message_processing::validate_and_store_enqueued_notes_and_events(\n contract_address,\n NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT,\n EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT,\n MAX_NOTE_PACKED_LEN as Field,\n MAX_EVENT_SERIALIZED_LEN as Field,\n );\n}\n\n/// Resolves message contexts for a list of tx hashes stored in a CapsuleArray.\n///\n/// The `message_context_requests_array_base_slot` must point to a CapsuleArray<Field> containing tx hashes.\n/// PXE will store `Option<MessageContextResponse>` values into the responses array at\n/// `message_context_responses_array_base_slot`.\npub unconstrained fn resolve_message_contexts(\n contract_address: AztecAddress,\n message_context_requests_array_base_slot: Field,\n message_context_responses_array_base_slot: Field,\n) {\n oracle::message_processing::resolve_message_contexts(\n contract_address,\n message_context_requests_array_base_slot,\n message_context_responses_array_base_slot,\n );\n}\n\n/// Efficiently queries the node for logs that result in the completion of all `DeliveredPendingPartialNote`s stored in\n/// a `CapsuleArray` by performing all node communication concurrently. Returns a second `CapsuleArray` with Options\n/// for the responses that correspond to the pending partial notes at the same index.\n///\n/// For example, given an array with pending partial notes `[ p1, p2, p3 ]`, where `p1` and `p3` have corresponding\n/// completion logs but `p2` does not, the returned `CapsuleArray` will have contents `[some(p1_log), none(),\n/// some(p3_log)]`.\npub(crate) unconstrained fn get_pending_partial_notes_completion_logs(\n contract_address: AztecAddress,\n pending_partial_notes: CapsuleArray<DeliveredPendingPartialNote>,\n) -> CapsuleArray<Option<LogRetrievalResponse>> {\n let log_retrieval_requests = CapsuleArray::at(contract_address, LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT);\n\n // We create a LogRetrievalRequest for each PendingPartialNote in the CapsuleArray. Because we need the indices in\n // the request array to match the indices in the partial note array, we can't use CapsuleArray::for_each, as that\n // function has arbitrary iteration order. Instead, we manually iterate the array from the beginning and push into\n // the requests array, which we expect to be empty.\n let mut i = 0;\n let pending_partial_notes_count = pending_partial_notes.len();\n while i < pending_partial_notes_count {\n let pending_partial_note = pending_partial_notes.get(i);\n log_retrieval_requests.push(\n LogRetrievalRequest { contract_address, unsiloed_tag: pending_partial_note.note_completion_log_tag },\n );\n i += 1;\n }\n\n oracle::message_processing::bulk_retrieve_logs(\n contract_address,\n LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT,\n LOG_RETRIEVAL_RESPONSES_ARRAY_BASE_SLOT,\n );\n\n CapsuleArray::at(contract_address, LOG_RETRIEVAL_RESPONSES_ARRAY_BASE_SLOT)\n}\n"
1195
+ "source": "pub(crate) mod event_validation_request;\npub mod offchain;\n\nmod message_context;\npub use message_context::MessageContext;\n\npub(crate) mod note_validation_request;\npub(crate) mod log_retrieval_request;\npub(crate) mod log_retrieval_response;\npub(crate) mod pending_tagged_log;\n\nuse crate::{\n capsules::CapsuleArray,\n event::EventSelector,\n messages::{\n discovery::partial_notes::DeliveredPendingPartialNote,\n encoding::MESSAGE_CIPHERTEXT_LEN,\n logs::{event::MAX_EVENT_SERIALIZED_LEN, note::MAX_NOTE_PACKED_LEN},\n processing::{\n log_retrieval_request::LogRetrievalRequest, log_retrieval_response::LogRetrievalResponse,\n note_validation_request::NoteValidationRequest, pending_tagged_log::PendingTaggedLog,\n },\n },\n oracle,\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\n// Base slot for the pending tagged log array to which the fetch_tagged_logs oracle inserts found private logs.\npub(crate) global PENDING_TAGGED_LOG_ARRAY_BASE_SLOT: Field =\n sha256_to_field(\"AZTEC_NR::PENDING_TAGGED_LOG_ARRAY_BASE_SLOT\".as_bytes());\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\nglobal LOG_RETRIEVAL_RESPONSES_ARRAY_BASE_SLOT: Field = sha256_to_field(\n \"AZTEC_NR::LOG_RETRIEVAL_RESPONSES_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 OffchainMessageWithContext {\n pub message_ciphertext: BoundedVec<Field, MESSAGE_CIPHERTEXT_LEN>,\n pub message_context: MessageContext,\n}\n\n/// Searches for private logs emitted by `contract_address` that might contain messages for the given `scope`.\npub(crate) unconstrained fn get_private_logs(\n contract_address: AztecAddress,\n scope: AztecAddress,\n) -> CapsuleArray<PendingTaggedLog> {\n // We will eventually perform log discovery via tagging here, but for now we simply call the `fetchTaggedLogs`\n // oracle. This makes PXE synchronize tags, download logs and store the pending tagged logs in a capsule array.\n oracle::message_processing::fetch_tagged_logs(PENDING_TAGGED_LOG_ARRAY_BASE_SLOT, scope);\n\n CapsuleArray::at(contract_address, PENDING_TAGGED_LOG_ARRAY_BASE_SLOT, scope)\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<Field, MAX_NOTE_PACKED_LEN>,\n note_hash: Field,\n nullifier: Field,\n tx_hash: Field,\n scope: AztecAddress,\n) {\n // We store requests in a `CapsuleArray`, which PXE will later read from and deserialize into its version of the\n // Noir `NoteValidationRequest`\n CapsuleArray::at(\n contract_address,\n NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT,\n scope,\n )\n .push(\n NoteValidationRequest {\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\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<Field, MAX_EVENT_SERIALIZED_LEN>,\n event_commitment: Field,\n tx_hash: Field,\n scope: AztecAddress,\n) {\n // We store requests in a `CapsuleArray`, which PXE will later read from and deserialize into its version of the\n // Noir `EventValidationRequest`\n CapsuleArray::at(\n contract_address,\n EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT,\n scope,\n )\n .push(\n EventValidationRequest {\n contract_address,\n event_type_id,\n randomness,\n serialized_event,\n event_commitment,\n tx_hash,\n },\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).\n///\n/// This automatically clears both validation request queues, so no further work needs to be done by the caller.\npub unconstrained fn validate_and_store_enqueued_notes_and_events(contract_address: AztecAddress, scope: AztecAddress) {\n oracle::message_processing::validate_and_store_enqueued_notes_and_events(\n contract_address,\n NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT,\n EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT,\n MAX_NOTE_PACKED_LEN as Field,\n MAX_EVENT_SERIALIZED_LEN as Field,\n scope,\n );\n}\n\n/// Resolves message contexts for a list of tx hashes stored in a CapsuleArray.\n///\n/// The `message_context_requests_array_base_slot` must point to a CapsuleArray<Field> containing tx hashes.\n/// PXE will store `Option<MessageContextResponse>` values into the responses array at\n/// `message_context_responses_array_base_slot`.\npub unconstrained fn get_message_contexts_by_tx_hash(\n contract_address: AztecAddress,\n message_context_requests_array_base_slot: Field,\n message_context_responses_array_base_slot: Field,\n scope: AztecAddress,\n) {\n oracle::message_processing::get_message_contexts_by_tx_hash(\n contract_address,\n message_context_requests_array_base_slot,\n message_context_responses_array_base_slot,\n scope,\n );\n}\n\n/// Efficiently queries the node for logs that result in the completion of all `DeliveredPendingPartialNote`s stored in\n/// a `CapsuleArray` by performing all node communication concurrently. Returns a second `CapsuleArray` with Options\n/// for the responses that correspond to the pending partial notes at the same index.\n///\n/// For example, given an array with pending partial notes `[ p1, p2, p3 ]`, where `p1` and `p3` have corresponding\n/// completion logs but `p2` does not, the returned `CapsuleArray` will have contents `[some(p1_log), none(),\n/// some(p3_log)]`.\npub(crate) unconstrained fn get_pending_partial_notes_completion_logs(\n contract_address: AztecAddress,\n pending_partial_notes: CapsuleArray<DeliveredPendingPartialNote>,\n scope: AztecAddress,\n) -> CapsuleArray<Option<LogRetrievalResponse>> {\n let log_retrieval_requests = CapsuleArray::at(\n contract_address,\n LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT,\n scope,\n );\n\n // We create a LogRetrievalRequest for each PendingPartialNote in the CapsuleArray. Because we need the indices in\n // the request array to match the indices in the partial note array, we can't use CapsuleArray::for_each, as that\n // function has arbitrary iteration order. Instead, we manually iterate the array from the beginning and push into\n // the requests array, which we expect to be empty.\n let mut i = 0;\n let pending_partial_notes_count = pending_partial_notes.len();\n while i < pending_partial_notes_count {\n let pending_partial_note = pending_partial_notes.get(i);\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 { contract_address, unsiloed_tag: log_tag });\n i += 1;\n }\n\n oracle::message_processing::get_logs_by_tag(\n contract_address,\n LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT,\n LOG_RETRIEVAL_RESPONSES_ARRAY_BASE_SLOT,\n scope,\n );\n\n CapsuleArray::at(\n contract_address,\n LOG_RETRIEVAL_RESPONSES_ARRAY_BASE_SLOT,\n scope,\n )\n}\n"
1476
1196
  },
1477
1197
  "156": {
1478
1198
  "function_locations": [
1479
1199
  {
1480
1200
  "name": "receive",
1481
- "start": 5382
1201
+ "start": 5542
1482
1202
  },
1483
1203
  {
1484
1204
  "name": "sync_inbox",
1485
- "start": 6750
1205
+ "start": 6983
1486
1206
  },
1487
1207
  {
1488
1208
  "name": "test::make_msg",
1489
- "start": 11920
1209
+ "start": 12050
1490
1210
  },
1491
1211
  {
1492
1212
  "name": "test::advance_by",
1493
- "start": 12290
1213
+ "start": 12340
1494
1214
  },
1495
1215
  {
1496
1216
  "name": "test::empty_inbox_returns_empty_result",
1497
- "start": 12481
1217
+ "start": 12531
1498
1218
  },
1499
1219
  {
1500
1220
  "name": "test::tx_bound_msg_expires_after_max_msg_ttl",
1501
- "start": 12936
1221
+ "start": 13000
1502
1222
  },
1503
1223
  {
1504
1224
  "name": "test::tx_bound_msg_not_expired_before_max_msg_ttl",
1505
- "start": 13886
1225
+ "start": 13964
1506
1226
  },
1507
1227
  {
1508
1228
  "name": "test::tx_less_msg_expires_after_max_msg_ttl",
1509
- "start": 14829
1229
+ "start": 14921
1510
1230
  },
1511
1231
  {
1512
1232
  "name": "test::unresolved_tx_stays_in_inbox",
1513
- "start": 15756
1233
+ "start": 15862
1514
1234
  },
1515
1235
  {
1516
1236
  "name": "test::multiple_messages_mixed_expiration",
1517
- "start": 16635
1237
+ "start": 16755
1518
1238
  },
1519
1239
  {
1520
1240
  "name": "test::resolved_msg_is_ready_to_process",
1521
- "start": 18345
1241
+ "start": 18479
1522
1242
  }
1523
1243
  ],
1524
1244
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/processing/offchain.nr",
1525
- "source": "use crate::{\n capsules::CapsuleArray,\n context::UtilityContext,\n messages::{\n encoding::MESSAGE_CIPHERTEXT_LEN,\n processing::{MessageContext, MessageTxContext, OffchainMessageWithContext, resolve_message_contexts},\n },\n oracle::contract_sync::invalidate_contract_sync_cache,\n protocol::{\n address::AztecAddress,\n constants::MAX_TX_LIFETIME,\n hash::sha256_to_field,\n traits::{Deserialize, Serialize},\n },\n};\n\n/// Base capsule slot for the persistent inbox of [`PendingOffchainMsg`] entries.\n///\n/// This is the slot where we accumulate messages received through [`receive`].\nglobal OFFCHAIN_INBOX_SLOT: Field = sha256_to_field(\"AZTEC_NR::OFFCHAIN_INBOX_SLOT\".as_bytes());\n\n/// Capsule array slot used by [`sync_inbox`] to pass tx hash resolution requests to PXE.\nglobal OFFCHAIN_CONTEXT_REQUESTS_SLOT: Field = sha256_to_field(\"AZTEC_NR::OFFCHAIN_CONTEXT_REQUESTS_SLOT\".as_bytes());\n\n/// Capsule array slot used by [`sync_inbox`] to read tx context responses from PXE.\nglobal OFFCHAIN_CONTEXT_RESPONSES_SLOT: Field = sha256_to_field(\"AZTEC_NR::OFFCHAIN_CONTEXT_RESPONSES_SLOT\".as_bytes());\n\n/// Capsule array slot used by [`sync_inbox`] to collect messages ready for processing.\nglobal OFFCHAIN_READY_MESSAGES_SLOT: Field = sha256_to_field(\"AZTEC_NR::OFFCHAIN_READY_MESSAGES_SLOT\".as_bytes());\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/// Tolerance added to the `MAX_TX_LIFETIME` cap for message expiration.\nglobal TX_EXPIRATION_TOLERANCE: u64 = 7200; // 2 hours\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.\nglobal MAX_MSG_TTL: u64 = MAX_TX_LIFETIME + TX_EXPIRATION_TOLERANCE;\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 expiration\n/// based eviction and automatic transaction context resolution.\npub(crate) type OffchainInboxSync<Env> = unconstrained fn[Env](\n/* contract_address */AztecAddress) -> CapsuleArray<OffchainMessageWithContext>;\n\n/// A message delivered via the `offchain_receive` utility function.\npub struct OffchainMessage {\n /// The encrypted message payload.\n pub ciphertext: BoundedVec<Field, MESSAGE_CIPHERTEXT_LEN>,\n /// The intended recipient of the message.\n pub recipient: AztecAddress,\n /// The hash of the transaction that produced this message. `Option::none` indicates a tx-less message.\n pub tx_hash: Option<Field>,\n /// Anchor block timestamp at message emission.\n pub anchor_block_timestamp: u64,\n}\n\n/// An offchain message awaiting processing (or re-processing) in the inbox.\n///\n/// Messages remain in the inbox until they expire, even if they have already been processed. This is necessary to\n/// handle reorgs: a processed message may need to be re-processed if the transaction that provided its context is\n/// reverted. On each sync, resolved messages are promoted to [`OffchainMessageWithContext`] for processing.\n#[derive(Serialize, Deserialize)]\nstruct PendingOffchainMsg {\n /// The encrypted message payload.\n ciphertext: BoundedVec<Field, MESSAGE_CIPHERTEXT_LEN>,\n /// The intended recipient of the message.\n recipient: AztecAddress,\n /// The hash of the transaction that produced this message. A value of 0 indicates a tx-less message.\n tx_hash: Field,\n /// Anchor block timestamp at message emission. Used to compute the effective expiration: messages are evicted\n /// after `anchor_block_timestamp + MAX_MSG_TTL`.\n anchor_block_timestamp: u64,\n}\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 kept in the inbox until they expire. The effective expiration is\n/// `anchor_block_timestamp + MAX_MSG_TTL`.\n///\n/// Processing order is not guaranteed.\npub unconstrained fn receive(\n contract_address: AztecAddress,\n messages: BoundedVec<OffchainMessage, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL>,\n) {\n let inbox: CapsuleArray<PendingOffchainMsg> = CapsuleArray::at(contract_address, OFFCHAIN_INBOX_SLOT);\n // May contain duplicates if multiple messages target the same recipient. This is harmless since\n // cache invalidation on the TS side is idempotent (deleting an already-deleted key is a no-op).\n let mut scopes: BoundedVec<AztecAddress, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL> = BoundedVec::new();\n let mut i = 0;\n let messages_len = messages.len();\n while i < messages_len {\n let msg = messages.get(i);\n let tx_hash = if msg.tx_hash.is_some() {\n msg.tx_hash.unwrap()\n } else {\n 0\n };\n inbox.push(\n PendingOffchainMsg {\n ciphertext: msg.ciphertext,\n recipient: msg.recipient,\n tx_hash,\n anchor_block_timestamp: msg.anchor_block_timestamp,\n },\n );\n scopes.push(msg.recipient);\n i += 1;\n }\n\n invalidate_contract_sync_cache(contract_address, scopes);\n}\n\n/// Returns offchain-delivered messages to process during sync.\n///\n/// Messages remain in the inbox and are reprocessed on each sync until their originating transaction is no longer at\n/// risk of being dropped by a reorg.\npub unconstrained fn sync_inbox(address: AztecAddress) -> CapsuleArray<OffchainMessageWithContext> {\n let inbox: CapsuleArray<PendingOffchainMsg> = CapsuleArray::at(address, OFFCHAIN_INBOX_SLOT);\n let context_resolution_requests: CapsuleArray<Field> = CapsuleArray::at(address, OFFCHAIN_CONTEXT_REQUESTS_SLOT);\n let resolved_contexts: CapsuleArray<Option<MessageTxContext>> =\n CapsuleArray::at(address, OFFCHAIN_CONTEXT_RESPONSES_SLOT);\n let ready_to_process: CapsuleArray<OffchainMessageWithContext> =\n CapsuleArray::at(address, OFFCHAIN_READY_MESSAGES_SLOT);\n\n // Clear any stale ready messages from a previous run.\n ready_to_process.for_each(|i, _| { ready_to_process.remove(i); });\n\n // Clear any stale context resolution requests/responses from a previous run.\n context_resolution_requests.for_each(|i, _| { context_resolution_requests.remove(i); });\n resolved_contexts.for_each(|i, _| { resolved_contexts.remove(i); });\n\n // Build a request list aligned with the inbox indices.\n let mut i = 0;\n let inbox_len = inbox.len();\n while i < inbox_len {\n let msg = inbox.get(i);\n context_resolution_requests.push(msg.tx_hash);\n i += 1;\n }\n\n // Ask PXE to resolve contexts for all requested tx hashes.\n resolve_message_contexts(\n address,\n OFFCHAIN_CONTEXT_REQUESTS_SLOT,\n OFFCHAIN_CONTEXT_RESPONSES_SLOT,\n );\n\n assert_eq(resolved_contexts.len(), inbox_len);\n\n let now = UtilityContext::new().timestamp();\n\n let mut j = inbox_len;\n while j > 0 {\n // This loop decides what to do with each message in the offchain message inbox. We need to handle 3\n // different scenarios for each message.\n //\n // 1. The TX that emitted this message is still not known to PXE: in this case we can't yet process this\n // message, as any notes or events discovered will fail to be validated. So we leave the message in the inbox,\n // awaiting for future syncs to detect that the TX became available.\n //\n // 2. The message is not associated to a TX to begin with. The current version of offchain message processing\n // does not support this case, but in the future it will. Right now, a message without an associated TX will\n // sit in the inbox until it expires.\n //\n // 3. The TX that emitted this message has been found by PXE. That gives us all the information needed to\n // process the message. We add the message to the `ready_to_process` CapsuleArray so that the `sync_state` loop\n // processes it.\n //\n // In all cases, if the message has expired (i.e. `now > anchor_block_timestamp + MAX_MSG_TTL`), we remove it\n // from the inbox.\n //\n // Note: the loop runs backwards because it might call `inbox.remove(j)` to purge expired messages and we also\n // need to align it with `resolved_contexts.get(j)`. Going from last to first simplifies the algorithm as\n // not yet visited element indexes remain stable.\n j -= 1;\n let maybe_ctx = resolved_contexts.get(j);\n let msg = inbox.get(j);\n\n // Compute the message's effective expiration timestamp to determine if we can purge it from the inbox.\n let effective_expiration = msg.anchor_block_timestamp + MAX_MSG_TTL;\n\n // Message expired. We remove it from the inbox.\n if now > effective_expiration {\n inbox.remove(j);\n }\n\n // Scenario 1: associated TX not yet available. We keep the message in the inbox, as it might become\n // processable as new blocks get mined.\n // Scenario 2: no TX associated to message. The message will sit in the inbox until it expires.\n if maybe_ctx.is_none() {\n continue;\n }\n\n // Scenario 3: Message is ready to process, add to result array. Note we still keep it in the inbox unless we\n // consider it has expired: this is because we need to account for reorgs. If reorg occurs after we processed\n // a message, the effects of processing the message get rewind. However, the associated TX can be included in\n // a subsequent block. Should that happen, the message must be re-processed to ensure consistency.\n let ctx = maybe_ctx.unwrap();\n let message_context = MessageContext {\n tx_hash: ctx.tx_hash,\n unique_note_hashes_in_tx: ctx.unique_note_hashes_in_tx,\n first_nullifier_in_tx: ctx.first_nullifier_in_tx,\n recipient: msg.recipient,\n };\n ready_to_process.push(OffchainMessageWithContext { message_ciphertext: msg.ciphertext, message_context });\n }\n\n ready_to_process\n}\n\nmod test {\n use crate::{\n capsules::CapsuleArray,\n oracle::random::random,\n protocol::{address::AztecAddress, traits::FromField},\n test::helpers::test_environment::TestEnvironment,\n };\n use super::{\n MAX_MSG_TTL, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL, OFFCHAIN_INBOX_SLOT, OffchainMessage, PendingOffchainMsg,\n receive, sync_inbox,\n };\n\n /// Creates an `OffchainMessage` with dummy ciphertext/recipient.\n fn make_msg(tx_hash: Option<Field>, anchor_block_timestamp: u64) -> OffchainMessage {\n OffchainMessage {\n ciphertext: BoundedVec::new(),\n recipient: AztecAddress::from_field(42),\n tx_hash,\n anchor_block_timestamp,\n }\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 = TestEnvironment::new();\n env.utility_context(|context| {\n let result = sync_inbox(context.this_address());\n let inbox: CapsuleArray<PendingOffchainMsg> =\n CapsuleArray::at(context.this_address(), OFFCHAIN_INBOX_SLOT);\n\n assert_eq(result.len(), 0);\n assert_eq(inbox.len(), 0);\n });\n }\n\n #[test]\n unconstrained fn tx_bound_msg_expires_after_max_msg_ttl() {\n let env = TestEnvironment::new();\n let anchor_ts = advance_by(env, 10);\n\n env.utility_context(|context| {\n let mut msgs: BoundedVec<OffchainMessage, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL> = BoundedVec::new();\n msgs.push(make_msg(Option::some(random()), anchor_ts));\n receive(context.this_address(), msgs);\n });\n\n // Advance past anchor_ts + MAX_MSG_TTL.\n let _now = advance_by(env, MAX_MSG_TTL + 1);\n\n env.utility_context(|context| {\n let address = context.this_address();\n let result = sync_inbox(address);\n let inbox: CapsuleArray<PendingOffchainMsg> = CapsuleArray::at(address, OFFCHAIN_INBOX_SLOT);\n\n assert_eq(result.len(), 0); // context is None, not ready\n assert_eq(inbox.len(), 0); // expired, removed\n });\n }\n\n #[test]\n unconstrained fn tx_bound_msg_not_expired_before_max_msg_ttl() {\n let env = TestEnvironment::new();\n let anchor_ts = advance_by(env, 10);\n\n env.utility_context(|context| {\n let mut msgs: BoundedVec<OffchainMessage, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL> = BoundedVec::new();\n msgs.push(make_msg(Option::some(random()), anchor_ts));\n receive(context.this_address(), msgs);\n });\n\n // Advance, but not past anchor_ts + MAX_MSG_TTL.\n let _now = advance_by(env, 100);\n\n env.utility_context(|context| {\n let address = context.this_address();\n let result = sync_inbox(address);\n let inbox: CapsuleArray<PendingOffchainMsg> = CapsuleArray::at(address, OFFCHAIN_INBOX_SLOT);\n\n assert_eq(result.len(), 0); // context is None, not ready\n assert_eq(inbox.len(), 1); // not expired, stays\n });\n }\n\n #[test]\n unconstrained fn tx_less_msg_expires_after_max_msg_ttl() {\n let env = TestEnvironment::new();\n let anchor_ts = advance_by(env, 10);\n\n env.utility_context(|context| {\n let mut msgs: BoundedVec<OffchainMessage, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL> = BoundedVec::new();\n msgs.push(make_msg(Option::none(), anchor_ts));\n receive(context.this_address(), msgs);\n });\n\n // Advance past anchor_ts + MAX_MSG_TTL.\n let _now = advance_by(env, MAX_MSG_TTL + 1);\n\n env.utility_context(|context| {\n let address = context.this_address();\n let result = sync_inbox(address);\n let inbox: CapsuleArray<PendingOffchainMsg> = CapsuleArray::at(address, OFFCHAIN_INBOX_SLOT);\n\n assert_eq(result.len(), 0); // context is None, not ready\n assert_eq(inbox.len(), 0); // expired, removed\n });\n }\n\n #[test]\n unconstrained fn unresolved_tx_stays_in_inbox() {\n let env = TestEnvironment::new();\n let anchor_ts = advance_by(env, 10);\n\n env.utility_context(|context| {\n let mut msgs: BoundedVec<OffchainMessage, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL> = BoundedVec::new();\n msgs.push(make_msg(Option::some(random()), anchor_ts));\n receive(context.this_address(), msgs);\n });\n\n let _now = advance_by(env, 100);\n\n env.utility_context(|context| {\n let address = context.this_address();\n let result = sync_inbox(address);\n let inbox: CapsuleArray<PendingOffchainMsg> = CapsuleArray::at(address, OFFCHAIN_INBOX_SLOT);\n\n assert_eq(result.len(), 0); // not resolved, not ready\n assert_eq(inbox.len(), 1); // not expired, stays\n });\n }\n\n #[test]\n unconstrained fn multiple_messages_mixed_expiration() {\n let env = TestEnvironment::new();\n let anchor_ts = advance_by(env, 10);\n\n let survivor_tx_hash = random();\n\n env.utility_context(|context| {\n let address = context.this_address();\n let mut msgs: BoundedVec<OffchainMessage, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL> = BoundedVec::new();\n // Message 0: tx-bound, anchor_ts in the past so it expires at\n // anchor_ts + MAX_MSG_TTL. We set anchor to 0 so it expires quickly.\n msgs.push(make_msg(Option::some(random()), 0));\n // Message 1: tx-bound, anchor_ts is recent so it survives.\n msgs.push(make_msg(Option::some(survivor_tx_hash), anchor_ts));\n // Message 2: tx-less, anchor_ts=0 so it also expires.\n msgs.push(make_msg(Option::none(), 0));\n receive(address, msgs);\n });\n\n // Advance past MAX_MSG_TTL for anchor_ts=0, but not for anchor_ts=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);\n let inbox: CapsuleArray<PendingOffchainMsg> = CapsuleArray::at(address, OFFCHAIN_INBOX_SLOT);\n\n assert_eq(result.len(), 0); // all contexts are None\n // Message 0 expired (anchor=0), message 1 survived (anchor=anchor_ts),\n // Message 2 expired (anchor=0).\n assert_eq(inbox.len(), 1);\n assert_eq(inbox.get(0).tx_hash, survivor_tx_hash);\n });\n }\n\n // -- Resolved context (ready to process) ------------------------------\n\n #[test]\n unconstrained fn resolved_msg_is_ready_to_process() {\n let env = TestEnvironment::new();\n // TestEnvironment::new() deploys protocol contracts, creating blocks with tx effects.\n // In TXE, tx hashes equal Fr(blockNumber), so Fr(1) is the tx effect from block 1.\n // We use this as a \"known resolvable\" tx hash.\n let known_tx_hash: Field = 1;\n let anchor_ts = advance_by(env, 10);\n\n env.utility_context(|context| {\n let mut msgs: BoundedVec<OffchainMessage, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL> = BoundedVec::new();\n msgs.push(make_msg(Option::some(known_tx_hash), anchor_ts));\n receive(context.this_address(), msgs);\n });\n\n let _now = advance_by(env, 100);\n\n env.utility_context(|context| {\n let address = context.this_address();\n let result = sync_inbox(address);\n let inbox: CapsuleArray<PendingOffchainMsg> = CapsuleArray::at(address, OFFCHAIN_INBOX_SLOT);\n\n // The message should be ready to process since its tx context was resolved.\n assert_eq(result.len(), 1);\n\n let ctx = result.get(0).message_context;\n assert_eq(ctx.tx_hash, known_tx_hash);\n assert_eq(ctx.recipient, AztecAddress::from_field(42));\n assert(ctx.first_nullifier_in_tx != 0, \"resolved context must have a first nullifier\");\n\n // Message stays in inbox (not expired) for potential reorg reprocessing.\n assert_eq(inbox.len(), 1);\n });\n }\n}\n"
1245
+ "source": "use crate::{\n capsules::CapsuleArray,\n context::UtilityContext,\n messages::{\n encoding::MESSAGE_CIPHERTEXT_LEN,\n processing::{get_message_contexts_by_tx_hash, MessageContext, OffchainMessageWithContext},\n },\n oracle::contract_sync::set_contract_sync_cache_invalid,\n protocol::{\n address::AztecAddress,\n constants::MAX_TX_LIFETIME,\n hash::sha256_to_field,\n traits::{Deserialize, Serialize},\n },\n};\n\n/// Base capsule slot for the persistent inbox of [`PendingOffchainMsg`] entries.\n///\n/// This is the slot where we accumulate messages received through [`receive`].\nglobal OFFCHAIN_INBOX_SLOT: Field = sha256_to_field(\"AZTEC_NR::OFFCHAIN_INBOX_SLOT\".as_bytes());\n\n/// Capsule array slot used by [`sync_inbox`] to pass tx hash resolution requests to PXE.\nglobal OFFCHAIN_CONTEXT_REQUESTS_SLOT: Field = sha256_to_field(\"AZTEC_NR::OFFCHAIN_CONTEXT_REQUESTS_SLOT\".as_bytes());\n\n/// Capsule array slot used by [`sync_inbox`] to read tx context responses from PXE.\nglobal OFFCHAIN_CONTEXT_RESPONSES_SLOT: Field = sha256_to_field(\"AZTEC_NR::OFFCHAIN_CONTEXT_RESPONSES_SLOT\".as_bytes());\n\n/// Capsule array slot used by [`sync_inbox`] to collect messages ready for processing.\nglobal OFFCHAIN_READY_MESSAGES_SLOT: Field = sha256_to_field(\"AZTEC_NR::OFFCHAIN_READY_MESSAGES_SLOT\".as_bytes());\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/// Tolerance added to the `MAX_TX_LIFETIME` cap for message expiration.\nglobal TX_EXPIRATION_TOLERANCE: u64 = 7200; // 2 hours\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.\nglobal MAX_MSG_TTL: u64 = MAX_TX_LIFETIME + TX_EXPIRATION_TOLERANCE;\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 expiration\n/// based eviction and automatic transaction context resolution.\npub(crate) type OffchainInboxSync<Env> = unconstrained fn[Env](\n/* contract_address */AztecAddress, /* scope */ AztecAddress) -> CapsuleArray<OffchainMessageWithContext>;\n\n/// A message delivered via the `offchain_receive` utility function.\npub struct OffchainMessage {\n /// The encrypted message payload.\n pub ciphertext: BoundedVec<Field, MESSAGE_CIPHERTEXT_LEN>,\n /// The intended recipient of the message.\n pub recipient: AztecAddress,\n /// The hash of the transaction that produced this message. `Option::none` indicates a tx-less message.\n pub tx_hash: Option<Field>,\n /// Anchor block timestamp at message emission.\n pub anchor_block_timestamp: u64,\n}\n\n/// An offchain message awaiting processing (or re-processing) in the inbox.\n///\n/// Messages remain in the inbox until they expire, even if they have already been processed. This is necessary to\n/// handle reorgs: a processed message may need to be re-processed if the transaction that provided its context is\n/// reverted. On each sync, resolved messages are promoted to [`OffchainMessageWithContext`] for processing.\n#[derive(Serialize, Deserialize)]\nstruct PendingOffchainMsg {\n /// The encrypted message payload.\n ciphertext: BoundedVec<Field, MESSAGE_CIPHERTEXT_LEN>,\n /// The intended recipient of the message.\n recipient: AztecAddress,\n /// The hash of the transaction that produced this message. A value of 0 indicates a tx-less message.\n tx_hash: Field,\n /// Anchor block timestamp at message emission. Used to compute the effective expiration: messages are evicted\n /// after `anchor_block_timestamp + MAX_MSG_TTL`.\n anchor_block_timestamp: u64,\n}\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/// Each message is routed to the inbox scoped to its `recipient` field, so messages for different accounts are\n/// automatically isolated.\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 kept in the inbox until they expire. The effective expiration is\n/// `anchor_block_timestamp + MAX_MSG_TTL`.\n///\n/// Processing order is not guaranteed.\npub unconstrained fn receive(\n contract_address: AztecAddress,\n messages: BoundedVec<OffchainMessage, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL>,\n) {\n // May contain duplicates if multiple messages target the same recipient. This is harmless since\n // cache invalidation on the TS side is idempotent (deleting an already-deleted key is a no-op).\n let mut scopes: BoundedVec<AztecAddress, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL> = BoundedVec::new();\n let mut i = 0;\n let messages_len = messages.len();\n while i < messages_len {\n let msg = messages.get(i);\n let tx_hash = if msg.tx_hash.is_some() {\n msg.tx_hash.unwrap()\n } else {\n 0\n };\n let inbox: CapsuleArray<PendingOffchainMsg> =\n CapsuleArray::at(contract_address, OFFCHAIN_INBOX_SLOT, msg.recipient);\n inbox.push(\n PendingOffchainMsg {\n ciphertext: msg.ciphertext,\n recipient: msg.recipient,\n tx_hash,\n anchor_block_timestamp: msg.anchor_block_timestamp,\n },\n );\n scopes.push(msg.recipient);\n i += 1;\n }\n\n set_contract_sync_cache_invalid(contract_address, scopes);\n}\n\n/// Returns offchain-delivered messages to process during sync.\n///\n/// Messages remain in the inbox and are reprocessed on each sync until their originating transaction is no longer at\n/// risk of being dropped by a reorg.\npub unconstrained fn sync_inbox(\n contract_address: AztecAddress,\n scope: AztecAddress,\n) -> CapsuleArray<OffchainMessageWithContext> {\n let inbox: CapsuleArray<PendingOffchainMsg> = CapsuleArray::at(contract_address, OFFCHAIN_INBOX_SLOT, scope);\n let context_resolution_requests: CapsuleArray<Field> =\n CapsuleArray::at(contract_address, OFFCHAIN_CONTEXT_REQUESTS_SLOT, scope);\n let resolved_contexts: CapsuleArray<Option<MessageContext>> =\n CapsuleArray::at(contract_address, OFFCHAIN_CONTEXT_RESPONSES_SLOT, scope);\n let ready_to_process: CapsuleArray<OffchainMessageWithContext> =\n CapsuleArray::at(contract_address, OFFCHAIN_READY_MESSAGES_SLOT, scope);\n\n // Clear any stale ready messages from a previous run.\n ready_to_process.for_each(|i, _| { ready_to_process.remove(i); });\n\n // Clear any stale context resolution requests/responses from a previous run.\n context_resolution_requests.for_each(|i, _| { context_resolution_requests.remove(i); });\n resolved_contexts.for_each(|i, _| { resolved_contexts.remove(i); });\n\n // Build a request list aligned with the inbox indices.\n let mut i = 0;\n let inbox_len = inbox.len();\n while i < inbox_len {\n let msg = inbox.get(i);\n context_resolution_requests.push(msg.tx_hash);\n i += 1;\n }\n\n // Ask PXE to resolve contexts for all requested tx hashes.\n get_message_contexts_by_tx_hash(\n contract_address,\n OFFCHAIN_CONTEXT_REQUESTS_SLOT,\n OFFCHAIN_CONTEXT_RESPONSES_SLOT,\n scope,\n );\n\n assert_eq(resolved_contexts.len(), inbox_len);\n\n let now = UtilityContext::new().timestamp();\n\n let mut j = inbox_len;\n while j > 0 {\n // This loop decides what to do with each message in the offchain message inbox. We need to handle 3\n // different scenarios for each message.\n //\n // 1. The TX that emitted this message is still not known to PXE: in this case we can't yet process this\n // message, as any notes or events discovered will fail to be validated. So we leave the message in the inbox,\n // awaiting for future syncs to detect that the TX became available.\n //\n // 2. The message is not associated to a TX to begin with. The current version of offchain message processing\n // does not support this case, but in the future it will. Right now, a message without an associated TX will\n // sit in the inbox until it expires.\n //\n // 3. The TX that emitted this message has been found by PXE. That gives us all the information needed to\n // process the message. We add the message to the `ready_to_process` CapsuleArray so that the `sync_state` loop\n // processes it.\n //\n // In all cases, if the message has expired (i.e. `now > anchor_block_timestamp + MAX_MSG_TTL`), we remove it\n // from the inbox.\n //\n // Note: the loop runs backwards because it might call `inbox.remove(j)` to purge expired messages and we also\n // need to align it with `resolved_contexts.get(j)`. Going from last to first simplifies the algorithm as\n // not yet visited element indexes remain stable.\n j -= 1;\n let maybe_ctx = resolved_contexts.get(j);\n let msg = inbox.get(j);\n\n // Compute the message's effective expiration timestamp to determine if we can purge it from the inbox.\n let effective_expiration = msg.anchor_block_timestamp + MAX_MSG_TTL;\n\n // Message expired. We remove it from the inbox.\n if now > effective_expiration {\n inbox.remove(j);\n }\n\n // Scenario 1: associated TX not yet available. We keep the message in the inbox, as it might become\n // processable as new blocks get mined.\n // Scenario 2: no TX associated to message. The message will sit in the inbox until it expires.\n if maybe_ctx.is_none() {\n continue;\n }\n\n // Scenario 3: Message is ready to process, add to result array. Note we still keep it in the inbox unless we\n // consider it has expired: this is because we need to account for reorgs. If reorg occurs after we processed\n // a message, the effects of processing the message get rewind. However, the associated TX can be included in\n // a subsequent block. Should that happen, the message must be re-processed to ensure consistency.\n let message_context = maybe_ctx.unwrap();\n ready_to_process.push(OffchainMessageWithContext { message_ciphertext: msg.ciphertext, message_context });\n }\n\n ready_to_process\n}\n\nmod test {\n use crate::{\n capsules::CapsuleArray, oracle::random::random, protocol::address::AztecAddress,\n test::helpers::test_environment::TestEnvironment,\n };\n use super::{\n MAX_MSG_TTL, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL, OFFCHAIN_INBOX_SLOT, OffchainMessage, PendingOffchainMsg,\n receive, sync_inbox,\n };\n\n global SCOPE: AztecAddress = AztecAddress { inner: 0xcafe };\n\n /// Creates an `OffchainMessage` with dummy ciphertext and `SCOPE` as recipient.\n fn make_msg(tx_hash: Option<Field>, anchor_block_timestamp: u64) -> OffchainMessage {\n OffchainMessage { ciphertext: BoundedVec::new(), recipient: SCOPE, 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 = TestEnvironment::new();\n env.utility_context(|context| {\n let result = sync_inbox(context.this_address(), SCOPE);\n let inbox: CapsuleArray<PendingOffchainMsg> =\n CapsuleArray::at(context.this_address(), OFFCHAIN_INBOX_SLOT, SCOPE);\n\n assert_eq(result.len(), 0);\n assert_eq(inbox.len(), 0);\n });\n }\n\n #[test]\n unconstrained fn tx_bound_msg_expires_after_max_msg_ttl() {\n let env = TestEnvironment::new();\n let anchor_ts = advance_by(env, 10);\n\n env.utility_context(|context| {\n let mut msgs: BoundedVec<OffchainMessage, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL> = BoundedVec::new();\n msgs.push(make_msg(Option::some(random()), anchor_ts));\n receive(context.this_address(), msgs);\n });\n\n // Advance past anchor_ts + MAX_MSG_TTL.\n let _now = advance_by(env, MAX_MSG_TTL + 1);\n\n env.utility_context(|context| {\n let address = context.this_address();\n let result = sync_inbox(address, SCOPE);\n let inbox: CapsuleArray<PendingOffchainMsg> = CapsuleArray::at(address, OFFCHAIN_INBOX_SLOT, SCOPE);\n\n assert_eq(result.len(), 0); // context is None, not ready\n assert_eq(inbox.len(), 0); // expired, removed\n });\n }\n\n #[test]\n unconstrained fn tx_bound_msg_not_expired_before_max_msg_ttl() {\n let env = TestEnvironment::new();\n let anchor_ts = advance_by(env, 10);\n\n env.utility_context(|context| {\n let mut msgs: BoundedVec<OffchainMessage, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL> = BoundedVec::new();\n msgs.push(make_msg(Option::some(random()), anchor_ts));\n receive(context.this_address(), msgs);\n });\n\n // Advance, but not past anchor_ts + MAX_MSG_TTL.\n let _now = advance_by(env, 100);\n\n env.utility_context(|context| {\n let address = context.this_address();\n let result = sync_inbox(address, SCOPE);\n let inbox: CapsuleArray<PendingOffchainMsg> = CapsuleArray::at(address, OFFCHAIN_INBOX_SLOT, SCOPE);\n\n assert_eq(result.len(), 0); // context is None, not ready\n assert_eq(inbox.len(), 1); // not expired, stays\n });\n }\n\n #[test]\n unconstrained fn tx_less_msg_expires_after_max_msg_ttl() {\n let env = TestEnvironment::new();\n let anchor_ts = advance_by(env, 10);\n\n env.utility_context(|context| {\n let mut msgs: BoundedVec<OffchainMessage, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL> = BoundedVec::new();\n msgs.push(make_msg(Option::none(), anchor_ts));\n receive(context.this_address(), msgs);\n });\n\n // Advance past anchor_ts + MAX_MSG_TTL.\n let _now = advance_by(env, MAX_MSG_TTL + 1);\n\n env.utility_context(|context| {\n let address = context.this_address();\n let result = sync_inbox(address, SCOPE);\n let inbox: CapsuleArray<PendingOffchainMsg> = CapsuleArray::at(address, OFFCHAIN_INBOX_SLOT, SCOPE);\n\n assert_eq(result.len(), 0); // context is None, not ready\n assert_eq(inbox.len(), 0); // expired, removed\n });\n }\n\n #[test]\n unconstrained fn unresolved_tx_stays_in_inbox() {\n let env = TestEnvironment::new();\n let anchor_ts = advance_by(env, 10);\n\n env.utility_context(|context| {\n let mut msgs: BoundedVec<OffchainMessage, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL> = BoundedVec::new();\n msgs.push(make_msg(Option::some(random()), anchor_ts));\n receive(context.this_address(), msgs);\n });\n\n let _now = advance_by(env, 100);\n\n env.utility_context(|context| {\n let address = context.this_address();\n let result = sync_inbox(address, SCOPE);\n let inbox: CapsuleArray<PendingOffchainMsg> = CapsuleArray::at(address, OFFCHAIN_INBOX_SLOT, SCOPE);\n\n assert_eq(result.len(), 0); // not resolved, not ready\n assert_eq(inbox.len(), 1); // not expired, stays\n });\n }\n\n #[test]\n unconstrained fn multiple_messages_mixed_expiration() {\n let env = TestEnvironment::new();\n let anchor_ts = advance_by(env, 10);\n\n let survivor_tx_hash = random();\n\n env.utility_context(|context| {\n let address = context.this_address();\n let mut msgs: BoundedVec<OffchainMessage, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL> = BoundedVec::new();\n // Message 0: tx-bound, anchor_ts in the past so it expires at\n // anchor_ts + MAX_MSG_TTL. We set anchor to 0 so it expires quickly.\n msgs.push(make_msg(Option::some(random()), 0));\n // Message 1: tx-bound, anchor_ts is recent so it survives.\n msgs.push(make_msg(Option::some(survivor_tx_hash), anchor_ts));\n // Message 2: tx-less, anchor_ts=0 so it also expires.\n msgs.push(make_msg(Option::none(), 0));\n receive(address, msgs);\n });\n\n // Advance past MAX_MSG_TTL for anchor_ts=0, but not for anchor_ts=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 let inbox: CapsuleArray<PendingOffchainMsg> = CapsuleArray::at(address, OFFCHAIN_INBOX_SLOT, SCOPE);\n\n assert_eq(result.len(), 0); // all contexts are None\n // Message 0 expired (anchor=0), message 1 survived (anchor=anchor_ts),\n // Message 2 expired (anchor=0).\n assert_eq(inbox.len(), 1);\n assert_eq(inbox.get(0).tx_hash, survivor_tx_hash);\n });\n }\n\n // -- Resolved context (ready to process) ------------------------------\n\n #[test]\n unconstrained fn resolved_msg_is_ready_to_process() {\n let env = TestEnvironment::new();\n // TestEnvironment::new() deploys protocol contracts, creating blocks with tx effects.\n // In TXE, tx hashes equal Fr(blockNumber), so Fr(1) is the tx effect from block 1.\n // We use this as a \"known resolvable\" tx hash.\n let known_tx_hash: Field = 1;\n let anchor_ts = advance_by(env, 10);\n\n env.utility_context(|context| {\n let mut msgs: BoundedVec<OffchainMessage, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL> = BoundedVec::new();\n msgs.push(make_msg(Option::some(known_tx_hash), anchor_ts));\n receive(context.this_address(), msgs);\n });\n\n let _now = advance_by(env, 100);\n\n env.utility_context(|context| {\n let address = context.this_address();\n let result = sync_inbox(address, SCOPE);\n let inbox: CapsuleArray<PendingOffchainMsg> = CapsuleArray::at(address, OFFCHAIN_INBOX_SLOT, SCOPE);\n\n // The message should be ready to process since its tx context was resolved.\n assert_eq(result.len(), 1);\n\n let ctx = result.get(0).message_context;\n assert_eq(ctx.tx_hash, known_tx_hash);\n assert(ctx.first_nullifier_in_tx != 0, \"resolved context must have a first nullifier\");\n\n // Message stays in inbox (not expired) for potential reorg reprocessing.\n assert_eq(inbox.len(), 1);\n });\n }\n}\n"
1526
1246
  },
1527
1247
  "16": {
1528
1248
  "function_locations": [
@@ -1815,24 +1535,24 @@
1815
1535
  "174": {
1816
1536
  "function_locations": [
1817
1537
  {
1818
- "name": "try_aes128_decrypt_oracle",
1819
- "start": 255
1538
+ "name": "aes128_decrypt_oracle",
1539
+ "start": 194
1820
1540
  },
1821
1541
  {
1822
1542
  "name": "try_aes128_decrypt",
1823
- "start": 1059
1543
+ "start": 1040
1824
1544
  },
1825
1545
  {
1826
1546
  "name": "test::aes_encrypt_then_decrypt",
1827
- "start": 1857
1547
+ "start": 1894
1828
1548
  },
1829
1549
  {
1830
1550
  "name": "test::aes_encrypt_then_decrypt_with_bad_sym_key_is_caught",
1831
- "start": 3213
1551
+ "start": 3264
1832
1552
  }
1833
1553
  ],
1834
1554
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/aes128_decrypt.nr",
1835
- "source": "use crate::utils::array::assert_bounded_vec_trimmed;\n\n#[oracle(aztec_utl_tryAes128Decrypt)]\nunconstrained fn try_aes128_decrypt_oracle<let N: u32>(\n ciphertext: BoundedVec<u8, N>,\n iv: [u8; 16],\n sym_key: [u8; 16],\n) -> Option<BoundedVec<u8, N>> {}\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). Note that decryption with the wrong key will still return `Some` with garbage data, it's up to\n/// the calling function to verify correctness (e.g. via a MAC check).\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.\npub unconstrained fn try_aes128_decrypt<let N: u32>(\n ciphertext: BoundedVec<u8, N>,\n iv: [u8; 16],\n sym_key: [u8; 16],\n) -> Option<BoundedVec<u8, N>> {\n try_aes128_decrypt_oracle(ciphertext, iv, sym_key).map(|result: BoundedVec<u8, N>| {\n assert_bounded_vec_trimmed(result);\n result\n })\n}\n\nmod test {\n use crate::{\n messages::encryption::aes128::derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_poseidon2_unsafe,\n utils::{array::subarray::subarray, point::point_from_x_coord},\n };\n use crate::test::helpers::test_environment::TestEnvironment;\n use super::try_aes128_decrypt;\n use poseidon::poseidon2::Poseidon2;\n use std::aes128::aes128_encrypt;\n\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 ciphertext_shared_secret = point_from_x_coord(1).unwrap();\n\n let (sym_key, iv) = derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_poseidon2_unsafe::<1>(\n ciphertext_shared_secret,\n )[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::<u8, TEST_CIPHERTEXT_LENGTH>::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 global TEST_MAC_LENGTH: u32 = 32;\n\n #[test(should_fail_with = \"mac does not match\")]\n unconstrained fn aes_encrypt_then_decrypt_with_bad_sym_key_is_caught() {\n let env = TestEnvironment::new();\n\n env.utility_context(|_| {\n // The AES decryption oracle will not fail for any valid ciphertext; it will always return\n // `Some` with some data. Whether the decryption was successful is up to the app to check in a\n // custom way.\n //\n // E.g. if it's a note that's been encrypted, upon decryption the app can check whether the\n // note hash exists onchain. If it doesn't, that's a strong indicator that decryption failed.\n //\n // E.g. for non-note messages, the plaintext could include a MAC\n // (https://en.wikipedia.org/wiki/Message_authentication_code). We demonstrate this approach in\n // this test: we compute a MAC, include it in the plaintext, encrypt, and then verify that\n // decryption with a bad key produces a MAC mismatch.\n let ciphertext_shared_secret = point_from_x_coord(1).unwrap();\n\n let (sym_key, iv) = derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_poseidon2_unsafe::<1>(\n ciphertext_shared_secret,\n )[0];\n\n let mac_preimage = 0x42;\n let mac = Poseidon2::hash([mac_preimage], 1);\n let mac_as_bytes = mac.to_be_bytes::<TEST_MAC_LENGTH>();\n\n let plaintext: [u8; TEST_PLAINTEXT_LENGTH] = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9];\n\n // We append the mac to the plaintext. It doesn't necessarily have to be 32 bytes; that's quite an extreme\n // length. 16 bytes or 8 bytes might be sufficient, and would save on data broadcasting costs. The shorter\n // the mac, the more possibility of false positive decryptions (decryption seemingly succeeding, but the\n // decrypted plaintext being garbage). Some projects use the `iv` (all 16 bytes or the first 8 bytes) as a\n // mac.\n let mut plaintext_with_mac = [0 as u8; TEST_PLAINTEXT_LENGTH + TEST_MAC_LENGTH];\n for i in 0..TEST_PLAINTEXT_LENGTH {\n plaintext_with_mac[i] = plaintext[i];\n }\n for i in 0..TEST_MAC_LENGTH {\n plaintext_with_mac[TEST_PLAINTEXT_LENGTH + i] = mac_as_bytes[i];\n }\n\n let ciphertext = aes128_encrypt(plaintext_with_mac, iv, sym_key);\n\n // We now would broadcast the tuple [ciphertext, mac] to the network. The recipient will then decrypt the\n // ciphertext, and if the mac inside the received plaintext matches the mac that was broadcast, then the\n // recipient knows that decryption was successful.\n\n // For this test, we intentionally mutate the sym_key to a bad one, so that decryption fails. This allows\n // us to explore how the recipient can detect failed decryption by checking the decrypted mac against the\n // broadcasted mac.\n let mut bad_sym_key = sym_key;\n bad_sym_key[0] = 0;\n\n // We need to convert the array to a BoundedVec because the oracle expects a BoundedVec as it's designed to\n // work with logs of unknown length.\n let ciphertext_bvec = BoundedVec::<u8, 48>::from_array(ciphertext);\n // Decryption with wrong key still returns Some (with garbage).\n let received_plaintext = try_aes128_decrypt(ciphertext_bvec, iv, bad_sym_key).unwrap();\n\n let extracted_mac_as_bytes: [u8; TEST_MAC_LENGTH] =\n subarray(received_plaintext.storage(), TEST_PLAINTEXT_LENGTH);\n\n assert_eq(mac_as_bytes, extracted_mac_as_bytes, \"mac does not match\");\n });\n }\n}\n"
1555
+ "source": "#[oracle(aztec_utl_decryptAes128)]\nunconstrained fn aes128_decrypt_oracle<let N: u32>(\n ciphertext: BoundedVec<u8, N>,\n iv: [u8; 16],\n sym_key: [u8; 16],\n) -> Option<BoundedVec<u8, N>> {}\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). Note that decryption with the wrong key will still return `Some` with garbage data, it's up to\n/// the calling function to verify correctness (e.g. via a MAC check).\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<let N: u32>(\n ciphertext: BoundedVec<u8, N>,\n iv: [u8; 16],\n sym_key: [u8; 16],\n) -> Option<BoundedVec<u8, N>> {\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 poseidon::poseidon2::Poseidon2;\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::<u8, TEST_CIPHERTEXT_LENGTH>::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 global TEST_MAC_LENGTH: u32 = 32;\n\n #[test(should_fail_with = \"mac does not match\")]\n unconstrained fn aes_encrypt_then_decrypt_with_bad_sym_key_is_caught() {\n let env = TestEnvironment::new();\n\n env.utility_context(|_| {\n // The AES decryption oracle will not fail for any valid ciphertext; it will always return\n // `Some` with some data. Whether the decryption was successful is up to the app to check in a\n // custom way.\n //\n // E.g. if it's a note that's been encrypted, upon decryption the app can check whether the\n // note hash exists onchain. If it doesn't, that's a strong indicator that decryption failed.\n //\n // E.g. for non-note messages, the plaintext could include a MAC\n // (https://en.wikipedia.org/wiki/Message_authentication_code). We demonstrate this approach in\n // this test: we compute a MAC, include it in the plaintext, encrypt, and then verify that\n // decryption with a bad key produces a MAC mismatch.\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 mac_preimage = 0x42;\n let mac = Poseidon2::hash([mac_preimage], 1);\n let mac_as_bytes = mac.to_be_bytes::<TEST_MAC_LENGTH>();\n\n let plaintext: [u8; TEST_PLAINTEXT_LENGTH] = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9];\n\n // We append the mac to the plaintext. It doesn't necessarily have to be 32 bytes; that's quite an extreme\n // length. 16 bytes or 8 bytes might be sufficient, and would save on data broadcasting costs. The shorter\n // the mac, the more possibility of false positive decryptions (decryption seemingly succeeding, but the\n // decrypted plaintext being garbage). Some projects use the `iv` (all 16 bytes or the first 8 bytes) as a\n // mac.\n let mut plaintext_with_mac = [0 as u8; TEST_PLAINTEXT_LENGTH + TEST_MAC_LENGTH];\n for i in 0..TEST_PLAINTEXT_LENGTH {\n plaintext_with_mac[i] = plaintext[i];\n }\n for i in 0..TEST_MAC_LENGTH {\n plaintext_with_mac[TEST_PLAINTEXT_LENGTH + i] = mac_as_bytes[i];\n }\n\n let ciphertext = aes128_encrypt(plaintext_with_mac, iv, sym_key);\n\n // We now would broadcast the tuple [ciphertext, mac] to the network. The recipient will then decrypt the\n // ciphertext, and if the mac inside the received plaintext matches the mac that was broadcast, then the\n // recipient knows that decryption was successful.\n\n // For this test, we intentionally mutate the sym_key to a bad one, so that decryption fails. This allows\n // us to explore how the recipient can detect failed decryption by checking the decrypted mac against the\n // broadcasted mac.\n let mut bad_sym_key = sym_key;\n bad_sym_key[0] = 0;\n\n // We need to convert the array to a BoundedVec because the oracle expects a BoundedVec as it's designed to\n // work with logs of unknown length.\n let ciphertext_bvec = BoundedVec::<u8, 48>::from_array(ciphertext);\n // Decryption with wrong key still returns Some (with garbage).\n let received_plaintext = try_aes128_decrypt(ciphertext_bvec, iv, bad_sym_key).unwrap();\n\n let extracted_mac_as_bytes: [u8; TEST_MAC_LENGTH] =\n subarray(received_plaintext.storage(), TEST_PLAINTEXT_LENGTH);\n\n assert_eq(mac_as_bytes, extracted_mac_as_bytes, \"mac does not match\");\n });\n }\n}\n"
1836
1556
  },
1837
1557
  "176": {
1838
1558
  "function_locations": [
@@ -2076,91 +1796,91 @@
2076
1796
  "function_locations": [
2077
1797
  {
2078
1798
  "name": "store",
2079
- "start": 370
1799
+ "start": 433
2080
1800
  },
2081
1801
  {
2082
1802
  "name": "load",
2083
- "start": 747
1803
+ "start": 886
2084
1804
  },
2085
1805
  {
2086
1806
  "name": "delete",
2087
- "start": 1073
1807
+ "start": 1247
2088
1808
  },
2089
1809
  {
2090
1810
  "name": "copy",
2091
- "start": 1641
1811
+ "start": 1866
2092
1812
  },
2093
1813
  {
2094
- "name": "store_oracle",
2095
- "start": 1855
1814
+ "name": "set_capsule_oracle",
1815
+ "start": 2131
2096
1816
  },
2097
1817
  {
2098
- "name": "load_oracle",
2099
- "start": 2624
1818
+ "name": "get_capsule_oracle",
1819
+ "start": 2931
2100
1820
  },
2101
1821
  {
2102
1822
  "name": "delete_oracle",
2103
- "start": 2739
1823
+ "start": 3067
2104
1824
  },
2105
1825
  {
2106
1826
  "name": "copy_oracle",
2107
- "start": 2889
1827
+ "start": 3261
2108
1828
  },
2109
1829
  {
2110
1830
  "name": "test::stores_and_loads",
2111
- "start": 3500
1831
+ "start": 3937
2112
1832
  },
2113
1833
  {
2114
1834
  "name": "test::store_overwrites",
2115
- "start": 3882
1835
+ "start": 4333
2116
1836
  },
2117
1837
  {
2118
1838
  "name": "test::loads_empty_slot",
2119
- "start": 4374
1839
+ "start": 4846
2120
1840
  },
2121
1841
  {
2122
1842
  "name": "test::deletes_stored_value",
2123
- "start": 4727
1843
+ "start": 5206
2124
1844
  },
2125
1845
  {
2126
1846
  "name": "test::deletes_empty_slot",
2127
- "start": 5220
1847
+ "start": 5720
2128
1848
  },
2129
1849
  {
2130
1850
  "name": "test::copies_non_overlapping_values",
2131
- "start": 5626
1851
+ "start": 6140
2132
1852
  },
2133
1853
  {
2134
1854
  "name": "test::copies_overlapping_values_with_src_ahead",
2135
- "start": 6456
1855
+ "start": 7019
2136
1856
  },
2137
1857
  {
2138
1858
  "name": "test::copies_overlapping_values_with_dst_ahead",
2139
- "start": 7652
1859
+ "start": 8285
2140
1860
  },
2141
1861
  {
2142
1862
  "name": "test::cannot_copy_empty_values",
2143
- "start": 8870
1863
+ "start": 9573
2144
1864
  },
2145
1865
  {
2146
1866
  "name": "test::cannot_store_other_contract",
2147
- "start": 9191
1867
+ "start": 9901
2148
1868
  },
2149
1869
  {
2150
1870
  "name": "test::cannot_load_other_contract",
2151
- "start": 9663
1871
+ "start": 10380
2152
1872
  },
2153
1873
  {
2154
1874
  "name": "test::cannot_delete_other_contract",
2155
- "start": 10110
1875
+ "start": 10834
2156
1876
  },
2157
1877
  {
2158
1878
  "name": "test::cannot_copy_other_contract",
2159
- "start": 10529
1879
+ "start": 11260
2160
1880
  }
2161
1881
  ],
2162
1882
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/capsules.nr",
2163
- "source": "use crate::protocol::{address::AztecAddress, traits::{Deserialize, Serialize}};\n\n/// Stores arbitrary information in a per-contract non-volatile database, which can later be retrieved with `load`. If\n/// data was already stored at this slot, it is overwritten.\npub unconstrained fn store<T>(contract_address: AztecAddress, slot: Field, value: T)\nwhere\n T: Serialize,\n{\n let serialized = value.serialize();\n store_oracle(contract_address, slot, serialized);\n}\n\n/// Returns data previously stored via `storeCapsule` in the per-contract non-volatile database. Returns Option::none()\n/// if nothing was stored at the given slot.\npub unconstrained fn load<T>(contract_address: AztecAddress, slot: Field) -> Option<T>\nwhere\n T: Deserialize,\n{\n let serialized_option = load_oracle(contract_address, slot, <T as Deserialize>::N);\n serialized_option.map(|arr| Deserialize::deserialize(arr))\n}\n\n/// Deletes data in the per-contract non-volatile database. Does nothing if no data was present.\npub unconstrained fn delete(contract_address: AztecAddress, slot: Field) {\n delete_oracle(contract_address, slot);\n}\n\n/// Copies a number of contiguous entries in the per-contract non-volatile database. This allows for efficient data\n/// structures by avoiding repeated calls to `loadCapsule` and `storeCapsule`. Supports overlapping source and\n/// destination regions (which will result in the overlapped source values being overwritten). All copied slots must\n/// exist in the database (i.e. have been stored and not deleted)\npub unconstrained fn copy(contract_address: AztecAddress, src_slot: Field, dst_slot: Field, num_entries: u32) {\n copy_oracle(contract_address, src_slot, dst_slot, num_entries);\n}\n\n#[oracle(aztec_utl_storeCapsule)]\nunconstrained fn store_oracle<let N: u32>(contract_address: AztecAddress, slot: Field, values: [Field; N]) {}\n\n/// We need to pass in `array_len` (the value of N) as a parameter to tell the oracle how many fields the response must\n/// have.\n///\n/// Note that the oracle returns an Option<[Field; N]> because we cannot return an Option<T> directly. That would\n/// require for the oracle resolver to know the shape of T (e.g. if T were a struct of 3 u32 values then the expected\n/// response shape would be 3 single items, whereas it were a struct containing `u32, [Field;10], u32` then the\n/// expected shape would be single, array, single.). Instead, we return the serialization and deserialize in Noir.\n#[oracle(aztec_utl_loadCapsule)]\nunconstrained fn load_oracle<let N: u32>(\n contract_address: AztecAddress,\n slot: Field,\n array_len: u32,\n) -> Option<[Field; N]> {}\n\n#[oracle(aztec_utl_deleteCapsule)]\nunconstrained fn delete_oracle(contract_address: AztecAddress, slot: Field) {}\n\n#[oracle(aztec_utl_copyCapsule)]\nunconstrained fn copy_oracle(contract_address: AztecAddress, src_slot: Field, dst_slot: Field, num_entries: u32) {}\n\nmod test {\n // These tests are sort of redundant since we already test the oracle implementation directly in TypeScript, but\n // they are cheap regardless and help ensure both that the TXE implementation works accordingly and that the Noir\n // oracles are hooked up correctly.\n\n use crate::{\n oracle::capsules::{copy, delete, load, store},\n test::{helpers::test_environment::TestEnvironment, mocks::MockStruct},\n };\n use crate::protocol::{address::AztecAddress, traits::{FromField, ToField}};\n\n global SLOT: Field = 1;\n\n #[test]\n unconstrained fn stores_and_loads() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let value = MockStruct::new(5, 6);\n store(contract_address, SLOT, value);\n\n assert_eq(load(contract_address, SLOT).unwrap(), value);\n });\n }\n\n #[test]\n unconstrained fn store_overwrites() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let value = MockStruct::new(5, 6);\n store(contract_address, SLOT, value);\n\n let new_value = MockStruct::new(7, 8);\n store(contract_address, SLOT, new_value);\n\n assert_eq(load(contract_address, SLOT).unwrap(), new_value);\n });\n }\n\n #[test]\n unconstrained fn loads_empty_slot() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let loaded_value: Option<MockStruct> = load(contract_address, SLOT);\n assert_eq(loaded_value, Option::none());\n });\n }\n\n #[test]\n unconstrained fn deletes_stored_value() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let value = MockStruct::new(5, 6);\n store(contract_address, SLOT, value);\n delete(contract_address, SLOT);\n\n let loaded_value: Option<MockStruct> = load(contract_address, SLOT);\n assert_eq(loaded_value, Option::none());\n });\n }\n\n #[test]\n unconstrained fn deletes_empty_slot() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n delete(contract_address, SLOT);\n let loaded_value: Option<MockStruct> = load(contract_address, SLOT);\n assert_eq(loaded_value, Option::none());\n });\n }\n\n #[test]\n unconstrained fn copies_non_overlapping_values() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let src = 5;\n\n let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n store(contract_address, src, values[0]);\n store(contract_address, src + 1, values[1]);\n store(contract_address, src + 2, values[2]);\n\n let dst = 10;\n copy(contract_address, src, dst, 3);\n\n assert_eq(load(contract_address, dst).unwrap(), values[0]);\n assert_eq(load(contract_address, dst + 1).unwrap(), values[1]);\n assert_eq(load(contract_address, dst + 2).unwrap(), values[2]);\n });\n }\n\n #[test]\n unconstrained fn copies_overlapping_values_with_src_ahead() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let src = 1;\n\n let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n store(contract_address, src, values[0]);\n store(contract_address, src + 1, values[1]);\n store(contract_address, src + 2, values[2]);\n\n let dst = 2;\n copy(contract_address, src, dst, 3);\n\n assert_eq(load(contract_address, dst).unwrap(), values[0]);\n assert_eq(load(contract_address, dst + 1).unwrap(), values[1]);\n assert_eq(load(contract_address, dst + 2).unwrap(), values[2]);\n\n // src[1] and src[2] should have been overwritten since they are also dst[0] and dst[1]\n assert_eq(load(contract_address, src).unwrap(), values[0]); // src[0] (unchanged)\n assert_eq(load(contract_address, src + 1).unwrap(), values[0]); // dst[0]\n assert_eq(load(contract_address, src + 2).unwrap(), values[1]); // dst[1]\n });\n }\n\n #[test]\n unconstrained fn copies_overlapping_values_with_dst_ahead() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let src = 2;\n\n let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n store(contract_address, src, values[0]);\n store(contract_address, src + 1, values[1]);\n store(contract_address, src + 2, values[2]);\n\n let dst = 1;\n copy(contract_address, src, dst, 3);\n\n assert_eq(load(contract_address, dst).unwrap(), values[0]);\n assert_eq(load(contract_address, dst + 1).unwrap(), values[1]);\n assert_eq(load(contract_address, dst + 2).unwrap(), values[2]);\n\n // src[0] and src[1] should have been overwritten since they are also dst[1] and dst[2]\n assert_eq(load(contract_address, src).unwrap(), values[1]); // dst[1]\n assert_eq(load(contract_address, src + 1).unwrap(), values[2]); // dst[2]\n assert_eq(load(contract_address, src + 2).unwrap(), values[2]); // src[2] (unchanged)\n });\n }\n\n #[test(should_fail_with = \"copy empty slot\")]\n unconstrained fn cannot_copy_empty_values() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n copy(contract_address, SLOT, SLOT, 1);\n });\n }\n\n #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_store_other_contract() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n let value = MockStruct::new(5, 6);\n store(other_contract_address, SLOT, value);\n });\n }\n\n #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_load_other_contract() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n let _: Option<MockStruct> = load(other_contract_address, SLOT);\n });\n }\n\n #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_delete_other_contract() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n delete(other_contract_address, SLOT);\n });\n }\n\n #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_copy_other_contract() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n copy(other_contract_address, SLOT, SLOT, 0);\n });\n }\n}\n"
1883
+ "source": "use crate::protocol::{address::AztecAddress, traits::{Deserialize, Serialize}};\n\n/// Stores arbitrary information in a per-contract non-volatile database, which can later be retrieved with `load`. If\n/// data was already stored at this slot, it is overwritten.\n// TODO(F-498): review naming consistency\npub unconstrained fn store<T>(contract_address: AztecAddress, slot: Field, value: T, scope: AztecAddress)\nwhere\n T: Serialize,\n{\n let serialized = value.serialize();\n set_capsule_oracle(contract_address, slot, serialized, scope);\n}\n\n/// Returns data previously stored via `storeCapsule` in the per-contract non-volatile database. Returns\n/// Option::none() if nothing was stored at the given slot.\n// TODO(F-498): review naming consistency\npub unconstrained fn load<T>(contract_address: AztecAddress, slot: Field, scope: AztecAddress) -> Option<T>\nwhere\n T: Deserialize,\n{\n let serialized_option = get_capsule_oracle(contract_address, slot, <T as Deserialize>::N, scope);\n serialized_option.map(|arr| Deserialize::deserialize(arr))\n}\n\n/// Deletes data in the per-contract non-volatile database. Does nothing if no data was present.\npub unconstrained fn delete(contract_address: AztecAddress, slot: Field, scope: AztecAddress) {\n delete_oracle(contract_address, slot, scope);\n}\n\n/// Copies a number of contiguous entries in the per-contract non-volatile database. This allows for efficient data\n/// structures by avoiding repeated calls to `loadCapsule` and `storeCapsule`. Supports overlapping source and\n/// destination regions (which will result in the overlapped source values being overwritten). All copied slots must\n/// exist in the database (i.e. have been stored and not deleted)\npub unconstrained fn copy(\n contract_address: AztecAddress,\n src_slot: Field,\n dst_slot: Field,\n num_entries: u32,\n scope: AztecAddress,\n) {\n copy_oracle(contract_address, src_slot, dst_slot, num_entries, scope);\n}\n\n#[oracle(aztec_utl_setCapsule)]\nunconstrained fn set_capsule_oracle<let N: u32>(\n contract_address: AztecAddress,\n slot: Field,\n values: [Field; N],\n scope: AztecAddress,\n) {}\n\n/// We need to pass in `array_len` (the value of N) as a parameter to tell the oracle how many fields the response must\n/// have.\n///\n/// Note that the oracle returns an Option<[Field; N]> because we cannot return an Option<T> directly. That would\n/// require for the oracle resolver to know the shape of T (e.g. if T were a struct of 3 u32 values then the expected\n/// response shape would be 3 single items, whereas it were a struct containing `u32, [Field;10], u32` then the\n/// expected shape would be single, array, single.). Instead, we return the serialization and deserialize in Noir.\n#[oracle(aztec_utl_getCapsule)]\nunconstrained fn get_capsule_oracle<let N: u32>(\n contract_address: AztecAddress,\n slot: Field,\n array_len: u32,\n scope: AztecAddress,\n) -> Option<[Field; N]> {}\n\n#[oracle(aztec_utl_deleteCapsule)]\nunconstrained fn delete_oracle(contract_address: AztecAddress, slot: Field, scope: AztecAddress) {}\n\n#[oracle(aztec_utl_copyCapsule)]\nunconstrained fn copy_oracle(\n contract_address: AztecAddress,\n src_slot: Field,\n dst_slot: Field,\n num_entries: u32,\n scope: AztecAddress,\n) {}\n\nmod test {\n // These tests are sort of redundant since we already test the oracle implementation directly in TypeScript, but\n // they are cheap regardless and help ensure both that the TXE implementation works accordingly and that the Noir\n // oracles are hooked up correctly.\n\n use crate::{\n oracle::capsules::{copy, delete, load, store},\n test::{helpers::test_environment::TestEnvironment, mocks::MockStruct},\n };\n use crate::protocol::{address::AztecAddress, traits::{FromField, ToField}};\n\n global SLOT: Field = 1;\n global SCOPE: AztecAddress = AztecAddress { inner: 0xcafe };\n\n #[test]\n unconstrained fn stores_and_loads() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let value = MockStruct::new(5, 6);\n store(contract_address, SLOT, value, SCOPE);\n\n assert_eq(load(contract_address, SLOT, SCOPE).unwrap(), value);\n });\n }\n\n #[test]\n unconstrained fn store_overwrites() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let value = MockStruct::new(5, 6);\n store(contract_address, SLOT, value, SCOPE);\n\n let new_value = MockStruct::new(7, 8);\n store(contract_address, SLOT, new_value, SCOPE);\n\n assert_eq(load(contract_address, SLOT, SCOPE).unwrap(), new_value);\n });\n }\n\n #[test]\n unconstrained fn loads_empty_slot() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let loaded_value: Option<MockStruct> = load(contract_address, SLOT, SCOPE);\n assert_eq(loaded_value, Option::none());\n });\n }\n\n #[test]\n unconstrained fn deletes_stored_value() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let value = MockStruct::new(5, 6);\n store(contract_address, SLOT, value, SCOPE);\n delete(contract_address, SLOT, SCOPE);\n\n let loaded_value: Option<MockStruct> = load(contract_address, SLOT, SCOPE);\n assert_eq(loaded_value, Option::none());\n });\n }\n\n #[test]\n unconstrained fn deletes_empty_slot() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n delete(contract_address, SLOT, SCOPE);\n let loaded_value: Option<MockStruct> = load(contract_address, SLOT, SCOPE);\n assert_eq(loaded_value, Option::none());\n });\n }\n\n #[test]\n unconstrained fn copies_non_overlapping_values() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let src = 5;\n\n let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n store(contract_address, src, values[0], SCOPE);\n store(contract_address, src + 1, values[1], SCOPE);\n store(contract_address, src + 2, values[2], SCOPE);\n\n let dst = 10;\n copy(contract_address, src, dst, 3, SCOPE);\n\n assert_eq(load(contract_address, dst, SCOPE).unwrap(), values[0]);\n assert_eq(load(contract_address, dst + 1, SCOPE).unwrap(), values[1]);\n assert_eq(load(contract_address, dst + 2, SCOPE).unwrap(), values[2]);\n });\n }\n\n #[test]\n unconstrained fn copies_overlapping_values_with_src_ahead() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let src = 1;\n\n let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n store(contract_address, src, values[0], SCOPE);\n store(contract_address, src + 1, values[1], SCOPE);\n store(contract_address, src + 2, values[2], SCOPE);\n\n let dst = 2;\n copy(contract_address, src, dst, 3, SCOPE);\n\n assert_eq(load(contract_address, dst, SCOPE).unwrap(), values[0]);\n assert_eq(load(contract_address, dst + 1, SCOPE).unwrap(), values[1]);\n assert_eq(load(contract_address, dst + 2, SCOPE).unwrap(), values[2]);\n\n // src[1] and src[2] should have been overwritten since they are also dst[0] and dst[1]\n assert_eq(load(contract_address, src, SCOPE).unwrap(), values[0]); // src[0] (unchanged)\n assert_eq(load(contract_address, src + 1, SCOPE).unwrap(), values[0]); // dst[0]\n assert_eq(load(contract_address, src + 2, SCOPE).unwrap(), values[1]); // dst[1]\n });\n }\n\n #[test]\n unconstrained fn copies_overlapping_values_with_dst_ahead() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let src = 2;\n\n let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n store(contract_address, src, values[0], SCOPE);\n store(contract_address, src + 1, values[1], SCOPE);\n store(contract_address, src + 2, values[2], SCOPE);\n\n let dst = 1;\n copy(contract_address, src, dst, 3, SCOPE);\n\n assert_eq(load(contract_address, dst, SCOPE).unwrap(), values[0]);\n assert_eq(load(contract_address, dst + 1, SCOPE).unwrap(), values[1]);\n assert_eq(load(contract_address, dst + 2, SCOPE).unwrap(), values[2]);\n\n // src[0] and src[1] should have been overwritten since they are also dst[1] and dst[2]\n assert_eq(load(contract_address, src, SCOPE).unwrap(), values[1]); // dst[1]\n assert_eq(load(contract_address, src + 1, SCOPE).unwrap(), values[2]); // dst[2]\n assert_eq(load(contract_address, src + 2, SCOPE).unwrap(), values[2]); // src[2] (unchanged)\n });\n }\n\n #[test(should_fail_with = \"copy empty slot\")]\n unconstrained fn cannot_copy_empty_values() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n copy(contract_address, SLOT, SLOT, 1, SCOPE);\n });\n }\n\n #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_store_other_contract() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n let value = MockStruct::new(5, 6);\n store(other_contract_address, SLOT, value, SCOPE);\n });\n }\n\n #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_load_other_contract() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n let _: Option<MockStruct> = load(other_contract_address, SLOT, SCOPE);\n });\n }\n\n #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_delete_other_contract() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n delete(other_contract_address, SLOT, SCOPE);\n });\n }\n\n #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_copy_other_contract() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n copy(other_contract_address, SLOT, SLOT, 0, SCOPE);\n });\n }\n}\n"
2164
1884
  },
2165
1885
  "18": {
2166
1886
  "function_locations": [
@@ -2206,137 +1926,137 @@
2206
1926
  },
2207
1927
  {
2208
1928
  "name": "derive_generators",
2209
- "start": 3597
1929
+ "start": 3591
2210
1930
  },
2211
1931
  {
2212
1932
  "name": "__derive_generators",
2213
- "start": 3956
1933
+ "start": 3950
2214
1934
  },
2215
1935
  {
2216
1936
  "name": "from_field_unsafe",
2217
- "start": 4271
1937
+ "start": 4265
2218
1938
  },
2219
1939
  {
2220
1940
  "name": "poseidon2_permutation",
2221
- "start": 4928
1941
+ "start": 4922
2222
1942
  },
2223
1943
  {
2224
1944
  "name": "poseidon2_permutation_internal",
2225
- "start": 5324
1945
+ "start": 5318
2226
1946
  },
2227
1947
  {
2228
1948
  "name": "poseidon2_config_state_size",
2229
- "start": 5417
1949
+ "start": 5411
2230
1950
  },
2231
1951
  {
2232
1952
  "name": "derive_hash",
2233
- "start": 5728
1953
+ "start": 5722
2234
1954
  },
2235
1955
  {
2236
1956
  "name": "<impl BuildHasher for BuildHasherDefault<H>>::build_hasher",
2237
- "start": 6699
1957
+ "start": 6693
2238
1958
  },
2239
1959
  {
2240
1960
  "name": "<impl Default for BuildHasherDefault<H>>::default",
2241
- "start": 6831
1961
+ "start": 6825
2242
1962
  },
2243
1963
  {
2244
1964
  "name": "<impl Hash for Field>::hash",
2245
- "start": 6963
1965
+ "start": 6957
2246
1966
  },
2247
1967
  {
2248
1968
  "name": "<impl Hash for u1>::hash",
2249
- "start": 7093
1969
+ "start": 7087
2250
1970
  },
2251
1971
  {
2252
1972
  "name": "<impl Hash for u8>::hash",
2253
- "start": 7232
1973
+ "start": 7226
2254
1974
  },
2255
1975
  {
2256
1976
  "name": "<impl Hash for u16>::hash",
2257
- "start": 7372
1977
+ "start": 7366
2258
1978
  },
2259
1979
  {
2260
1980
  "name": "<impl Hash for u32>::hash",
2261
- "start": 7512
1981
+ "start": 7506
2262
1982
  },
2263
1983
  {
2264
1984
  "name": "<impl Hash for u64>::hash",
2265
- "start": 7652
1985
+ "start": 7646
2266
1986
  },
2267
1987
  {
2268
1988
  "name": "<impl Hash for u128>::hash",
2269
- "start": 7793
1989
+ "start": 7787
2270
1990
  },
2271
1991
  {
2272
1992
  "name": "<impl Hash for i8>::hash",
2273
- "start": 7932
1993
+ "start": 7926
2274
1994
  },
2275
1995
  {
2276
1996
  "name": "<impl Hash for i16>::hash",
2277
- "start": 8078
1997
+ "start": 8072
2278
1998
  },
2279
1999
  {
2280
2000
  "name": "<impl Hash for i32>::hash",
2281
- "start": 8225
2001
+ "start": 8219
2282
2002
  },
2283
2003
  {
2284
2004
  "name": "<impl Hash for i64>::hash",
2285
- "start": 8372
2005
+ "start": 8366
2286
2006
  },
2287
2007
  {
2288
2008
  "name": "<impl Hash for bool>::hash",
2289
- "start": 8520
2009
+ "start": 8514
2290
2010
  },
2291
2011
  {
2292
2012
  "name": "<impl Hash for ()>::hash",
2293
- "start": 8667
2013
+ "start": 8661
2294
2014
  },
2295
2015
  {
2296
2016
  "name": "<impl Hash for [T; N]>::hash",
2297
- "start": 8799
2017
+ "start": 8793
2298
2018
  },
2299
2019
  {
2300
2020
  "name": "<impl Hash for [T]>::hash",
2301
- "start": 8988
2021
+ "start": 8982
2302
2022
  },
2303
2023
  {
2304
2024
  "name": "<impl Hash for (A, B)>::hash",
2305
- "start": 9228
2025
+ "start": 9222
2306
2026
  },
2307
2027
  {
2308
2028
  "name": "<impl Hash for (A, B, C)>::hash",
2309
- "start": 9444
2029
+ "start": 9438
2310
2030
  },
2311
2031
  {
2312
2032
  "name": "<impl Hash for (A, B, C, D)>::hash",
2313
- "start": 9707
2033
+ "start": 9701
2314
2034
  },
2315
2035
  {
2316
2036
  "name": "<impl Hash for (A, B, C, D, E)>::hash",
2317
- "start": 10017
2037
+ "start": 10011
2318
2038
  },
2319
2039
  {
2320
2040
  "name": "assert_pedersen",
2321
- "start": 10413
2041
+ "start": 10407
2322
2042
  }
2323
2043
  ],
2324
2044
  "path": "std/hash/mod.nr",
2325
- "source": "// Exposed only for usage in `std::meta`\npub(crate) mod poseidon2;\n\nuse crate::default::Default;\nuse crate::embedded_curve_ops::{\n EmbeddedCurvePoint, EmbeddedCurveScalar, multi_scalar_mul, multi_scalar_mul_array_return,\n};\nuse crate::meta::derive_via;\nuse crate::static_assert;\n\n/// The size of the state accepted by the backend in `poseidon2_permutation`.\nglobal POSEIDON2_CONFIG_STATE_SIZE: u32 = poseidon2_config_state_size();\n\n#[foreign(sha256_compression)]\n// docs:start:sha256_compression\npub fn sha256_compression(input: [u32; 16], state: [u32; 8]) -> [u32; 8] {}\n// docs:end:sha256_compression\n\n#[foreign(keccakf1600)]\n// docs:start:keccakf1600\npub fn keccakf1600(input: [u64; 25]) -> [u64; 25] {}\n// docs:end:keccakf1600\n\npub mod keccak {\n #[deprecated(\"This function has been moved to std::hash::keccakf1600\")]\n pub fn keccakf1600(input: [u64; 25]) -> [u64; 25] {\n super::keccakf1600(input)\n }\n}\n\n#[foreign(blake2s)]\n// docs:start:blake2s\npub fn blake2s<let N: u32>(input: [u8; N]) -> [u8; 32]\n// docs:end:blake2s\n{}\n\n// docs:start:blake3\npub fn blake3<let N: u32>(input: [u8; N]) -> [u8; 32]\n// docs:end:blake3\n{\n if crate::runtime::is_unconstrained() {\n // Temporary measure while Barretenberg is main proving system.\n // Please open an issue if you're working on another proving system and running into problems due to this.\n crate::static_assert(\n N <= 1024,\n \"Barretenberg cannot prove blake3 hashes with inputs larger than 1024 bytes\",\n );\n }\n __blake3(input)\n}\n\n#[foreign(blake3)]\nfn __blake3<let N: u32>(input: [u8; N]) -> [u8; 32] {}\n\n// docs:start:pedersen_commitment\npub fn pedersen_commitment<let N: u32>(input: [Field; N]) -> EmbeddedCurvePoint {\n // docs:end:pedersen_commitment\n pedersen_commitment_with_separator(input, 0)\n}\n\n#[inline_always]\npub fn pedersen_commitment_with_separator<let N: u32>(\n input: [Field; N],\n separator: u32,\n) -> EmbeddedCurvePoint {\n let mut points = [EmbeddedCurveScalar { lo: 0, hi: 0 }; N];\n for i in 0..N {\n // we use the unsafe version because the multi_scalar_mul will constrain the scalars.\n points[i] = from_field_unsafe(input[i]);\n }\n let generators = derive_generators(\"DEFAULT_DOMAIN_SEPARATOR\".as_bytes(), separator);\n multi_scalar_mul(generators, points)\n}\n\n// docs:start:pedersen_hash\npub fn pedersen_hash<let N: u32>(input: [Field; N]) -> Field\n// docs:end:pedersen_hash\n{\n pedersen_hash_with_separator(input, 0)\n}\n\n#[no_predicates]\npub fn pedersen_hash_with_separator<let N: u32>(input: [Field; N], separator: u32) -> Field {\n let mut scalars: [EmbeddedCurveScalar; N + 1] = [EmbeddedCurveScalar { lo: 0, hi: 0 }; N + 1];\n let mut generators: [EmbeddedCurvePoint; N + 1] =\n [EmbeddedCurvePoint::point_at_infinity(); N + 1];\n crate::assert_constant(separator);\n let domain_generators: [EmbeddedCurvePoint; N] =\n derive_generators(\"DEFAULT_DOMAIN_SEPARATOR\".as_bytes(), separator);\n\n for i in 0..N {\n scalars[i] = from_field_unsafe(input[i]);\n generators[i] = domain_generators[i];\n }\n scalars[N] = EmbeddedCurveScalar { lo: N as Field, hi: 0 as Field };\n\n let length_generator: [EmbeddedCurvePoint; 1] =\n derive_generators(\"pedersen_hash_length\".as_bytes(), 0);\n generators[N] = length_generator[0];\n multi_scalar_mul_array_return(generators, scalars, true)[0].x\n}\n\n#[field(bn254)]\n#[inline_always]\npub fn derive_generators<let N: u32, let M: u32>(\n domain_separator_bytes: [u8; M],\n starting_index: u32,\n) -> [EmbeddedCurvePoint; N] {\n crate::assert_constant(domain_separator_bytes);\n crate::assert_constant(starting_index);\n __derive_generators(domain_separator_bytes, starting_index)\n}\n\n#[builtin(derive_pedersen_generators)]\n#[field(bn254)]\nfn __derive_generators<let N: u32, let M: u32>(\n domain_separator_bytes: [u8; M],\n starting_index: u32,\n) -> [EmbeddedCurvePoint; N] {}\n\n#[field(bn254)]\n// Decompose the input 'bn254 scalar' into two 128 bits limbs.\n// It is called 'unsafe' because it does not assert the limbs are 128 bits\n// Assuming the limbs are 128 bits:\n// Assert the decomposition does not overflow the field size.\nfn from_field_unsafe(scalar: Field) -> EmbeddedCurveScalar {\n // Safety: xlo and xhi decomposition is checked below\n let (xlo, xhi) = unsafe { crate::field::bn254::decompose_hint(scalar) };\n // Check that the decomposition is correct\n assert_eq(scalar, xlo + crate::field::bn254::TWO_POW_128 * xhi);\n // Check that the decomposition does not overflow the field size\n let (a, b) = if xhi == crate::field::bn254::PHI {\n (xlo, crate::field::bn254::PLO)\n } else {\n (xhi, crate::field::bn254::PHI)\n };\n crate::field::bn254::assert_lt(a, b);\n\n EmbeddedCurveScalar { lo: xlo, hi: xhi }\n}\n\npub fn poseidon2_permutation<let N: u32>(input: [Field; N], state_len: u32) -> [Field; N] {\n assert_eq(input.len(), state_len);\n\n static_assert(\n N == POSEIDON2_CONFIG_STATE_SIZE,\n f\"the input length must equal the state size in the Poseidon2 config; expected {POSEIDON2_CONFIG_STATE_SIZE}, got {N}\",\n );\n poseidon2_permutation_internal(input)\n}\n\n#[foreign(poseidon2_permutation)]\nfn poseidon2_permutation_internal<let N: u32>(input: [Field; N]) -> [Field; N] {}\n\n#[foreign(poseidon2_config_state_size)]\ncomptime fn poseidon2_config_state_size() -> u32 {}\n\n// Generic hashing support.\n// Partially ported and impacted by rust.\n\n// Hash trait shall be implemented per type.\n#[derive_via(derive_hash)]\npub trait Hash {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher;\n}\n\n// docs:start:derive_hash\ncomptime fn derive_hash(s: TypeDefinition) -> Quoted {\n let name = quote { $crate::hash::Hash };\n let signature = quote { fn hash<H>(_self: Self, _state: &mut H) where H: $crate::hash::Hasher };\n let for_each_field = |name| quote { _self.$name.hash(_state); };\n crate::meta::make_trait_impl(\n s,\n name,\n signature,\n for_each_field,\n quote {},\n |fields| fields,\n )\n}\n// docs:end:derive_hash\n\n// Hasher trait shall be implemented by algorithms to provide hash-agnostic means.\n// TODO: consider making the types generic here ([u8], [Field], etc.)\npub trait Hasher {\n fn finish(self) -> Field;\n\n fn write(&mut self, input: Field);\n}\n\n// BuildHasher is a factory trait, responsible for production of specific Hasher.\npub trait BuildHasher {\n type H: Hasher;\n\n fn build_hasher(self) -> H;\n}\n\npub struct BuildHasherDefault<H>;\n\nimpl<H> BuildHasher for BuildHasherDefault<H>\nwhere\n H: Hasher + Default,\n{\n type H = H;\n\n fn build_hasher(_self: Self) -> H {\n H::default()\n }\n}\n\nimpl<H> Default for BuildHasherDefault<H>\nwhere\n H: Hasher + Default,\n{\n fn default() -> Self {\n BuildHasherDefault {}\n }\n}\n\nimpl Hash for Field {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self);\n }\n}\n\nimpl Hash for u1 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u8 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u16 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u32 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u64 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u128 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for i8 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as u8 as Field);\n }\n}\n\nimpl Hash for i16 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as u16 as Field);\n }\n}\n\nimpl Hash for i32 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as u32 as Field);\n }\n}\n\nimpl Hash for i64 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as u64 as Field);\n }\n}\n\nimpl Hash for bool {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for () {\n fn hash<H>(_self: Self, _state: &mut H)\n where\n H: Hasher,\n {}\n}\n\nimpl<T, let N: u32> Hash for [T; N]\nwhere\n T: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n for elem in self {\n elem.hash(state);\n }\n }\n}\n\nimpl<T> Hash for [T]\nwhere\n T: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.len().hash(state);\n for elem in self {\n elem.hash(state);\n }\n }\n}\n\nimpl<A, B> Hash for (A, B)\nwhere\n A: Hash,\n B: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n self.1.hash(state);\n }\n}\n\nimpl<A, B, C> Hash for (A, B, C)\nwhere\n A: Hash,\n B: Hash,\n C: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n self.1.hash(state);\n self.2.hash(state);\n }\n}\n\nimpl<A, B, C, D> Hash for (A, B, C, D)\nwhere\n A: Hash,\n B: Hash,\n C: Hash,\n D: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n self.1.hash(state);\n self.2.hash(state);\n self.3.hash(state);\n }\n}\n\nimpl<A, B, C, D, E> Hash for (A, B, C, D, E)\nwhere\n A: Hash,\n B: Hash,\n C: Hash,\n D: Hash,\n E: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n self.1.hash(state);\n self.2.hash(state);\n self.3.hash(state);\n self.4.hash(state);\n }\n}\n\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 is_infinite: false,\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 is_infinite: false,\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 is_infinite: false,\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 is_infinite: false,\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 is_infinite: false,\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 is_infinite: false,\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 is_infinite: false,\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 is_infinite: false,\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 is_infinite: false,\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 is_infinite: false,\n },\n );\n}\n"
2045
+ "source": "// Exposed only for usage in `std::meta`\npub(crate) mod poseidon2;\n\nuse crate::default::Default;\nuse crate::embedded_curve_ops::{\n EmbeddedCurvePoint, EmbeddedCurveScalar, multi_scalar_mul, multi_scalar_mul_array_return,\n};\nuse crate::meta::derive_via;\nuse crate::static_assert;\n\n/// The size of the state accepted by the backend in `poseidon2_permutation`.\nglobal POSEIDON2_CONFIG_STATE_SIZE: u32 = poseidon2_config_state_size();\n\n#[foreign(sha256_compression)]\n// docs:start:sha256_compression\npub fn sha256_compression(input: [u32; 16], state: [u32; 8]) -> [u32; 8] {}\n// docs:end:sha256_compression\n\n#[foreign(keccakf1600)]\n// docs:start:keccakf1600\npub fn keccakf1600(input: [u64; 25]) -> [u64; 25] {}\n// docs:end:keccakf1600\n\npub mod keccak {\n #[deprecated(\"This function has been moved to std::hash::keccakf1600\")]\n pub fn keccakf1600(input: [u64; 25]) -> [u64; 25] {\n super::keccakf1600(input)\n }\n}\n\n#[foreign(blake2s)]\n// docs:start:blake2s\npub fn blake2s<let N: u32>(input: [u8; N]) -> [u8; 32]\n// docs:end:blake2s\n{}\n\n// docs:start:blake3\npub fn blake3<let N: u32>(input: [u8; N]) -> [u8; 32]\n// docs:end:blake3\n{\n if crate::runtime::is_unconstrained() {\n // Temporary measure while Barretenberg is main proving system.\n // Please open an issue if you're working on another proving system and running into problems due to this.\n crate::static_assert(\n N <= 1024,\n \"Barretenberg cannot prove blake3 hashes with inputs larger than 1024 bytes\",\n );\n }\n __blake3(input)\n}\n\n#[foreign(blake3)]\nfn __blake3<let N: u32>(input: [u8; N]) -> [u8; 32] {}\n\n// docs:start:pedersen_commitment\npub fn pedersen_commitment<let N: u32>(input: [Field; N]) -> EmbeddedCurvePoint {\n // docs:end:pedersen_commitment\n pedersen_commitment_with_separator(input, 0)\n}\n\n#[inline_always]\npub fn pedersen_commitment_with_separator<let N: u32>(\n input: [Field; N],\n separator: u32,\n) -> EmbeddedCurvePoint {\n let mut points = [EmbeddedCurveScalar { lo: 0, hi: 0 }; N];\n for i in 0..N {\n // we use the unsafe version because the multi_scalar_mul will constrain the scalars.\n points[i] = from_field_unsafe(input[i]);\n }\n let generators = derive_generators(\"DEFAULT_DOMAIN_SEPARATOR\".as_bytes(), separator);\n multi_scalar_mul(generators, points)\n}\n\n// docs:start:pedersen_hash\npub fn pedersen_hash<let N: u32>(input: [Field; N]) -> Field\n// docs:end:pedersen_hash\n{\n pedersen_hash_with_separator(input, 0)\n}\n\n#[no_predicates]\npub fn pedersen_hash_with_separator<let N: u32>(input: [Field; N], separator: u32) -> Field {\n let mut scalars: [EmbeddedCurveScalar; N + 1] = [EmbeddedCurveScalar { lo: 0, hi: 0 }; N + 1];\n let mut generators: [EmbeddedCurvePoint; N + 1] =\n [EmbeddedCurvePoint::point_at_infinity(); N + 1];\n crate::assert_constant(separator);\n let domain_generators: [EmbeddedCurvePoint; N] =\n derive_generators(\"DEFAULT_DOMAIN_SEPARATOR\".as_bytes(), separator);\n\n for i in 0..N {\n scalars[i] = from_field_unsafe(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)[0].x\n}\n\n#[field(bn254)]\n#[inline_always]\npub fn derive_generators<let N: u32, let M: u32>(\n domain_separator_bytes: [u8; M],\n starting_index: u32,\n) -> [EmbeddedCurvePoint; N] {\n crate::assert_constant(domain_separator_bytes);\n crate::assert_constant(starting_index);\n __derive_generators(domain_separator_bytes, starting_index)\n}\n\n#[builtin(derive_pedersen_generators)]\n#[field(bn254)]\nfn __derive_generators<let N: u32, let M: u32>(\n domain_separator_bytes: [u8; M],\n starting_index: u32,\n) -> [EmbeddedCurvePoint; N] {}\n\n#[field(bn254)]\n// Decompose the input 'bn254 scalar' into two 128 bits limbs.\n// It is called 'unsafe' because it does not assert the limbs are 128 bits\n// Assuming the limbs are 128 bits:\n// Assert the decomposition does not overflow the field size.\nfn from_field_unsafe(scalar: Field) -> EmbeddedCurveScalar {\n // Safety: xlo and xhi decomposition is checked below\n let (xlo, xhi) = unsafe { crate::field::bn254::decompose_hint(scalar) };\n // Check that the decomposition is correct\n assert_eq(scalar, xlo + crate::field::bn254::TWO_POW_128 * xhi);\n // Check that the decomposition does not overflow the field size\n let (a, b) = if xhi == crate::field::bn254::PHI {\n (xlo, crate::field::bn254::PLO)\n } else {\n (xhi, crate::field::bn254::PHI)\n };\n crate::field::bn254::assert_lt(a, b);\n\n EmbeddedCurveScalar { lo: xlo, hi: xhi }\n}\n\npub fn poseidon2_permutation<let N: u32>(input: [Field; N], state_len: u32) -> [Field; N] {\n assert_eq(input.len(), state_len);\n\n static_assert(\n N == POSEIDON2_CONFIG_STATE_SIZE,\n f\"the input length must equal the state size in the Poseidon2 config; expected {POSEIDON2_CONFIG_STATE_SIZE}, got {N}\",\n );\n poseidon2_permutation_internal(input)\n}\n\n#[foreign(poseidon2_permutation)]\nfn poseidon2_permutation_internal<let N: u32>(input: [Field; N]) -> [Field; N] {}\n\n#[foreign(poseidon2_config_state_size)]\ncomptime fn poseidon2_config_state_size() -> u32 {}\n\n// Generic hashing support.\n// Partially ported and impacted by rust.\n\n// Hash trait shall be implemented per type.\n#[derive_via(derive_hash)]\npub trait Hash {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher;\n}\n\n// docs:start:derive_hash\ncomptime fn derive_hash(s: TypeDefinition) -> Quoted {\n let name = quote { $crate::hash::Hash };\n let signature = quote { fn hash<H>(_self: Self, _state: &mut H) where H: $crate::hash::Hasher };\n let for_each_field = |name| quote { _self.$name.hash(_state); };\n crate::meta::make_trait_impl(\n s,\n name,\n signature,\n for_each_field,\n quote {},\n |fields| fields,\n )\n}\n// docs:end:derive_hash\n\n// Hasher trait shall be implemented by algorithms to provide hash-agnostic means.\n// TODO: consider making the types generic here ([u8], [Field], etc.)\npub trait Hasher {\n fn finish(self) -> Field;\n\n fn write(&mut self, input: Field);\n}\n\n// BuildHasher is a factory trait, responsible for production of specific Hasher.\npub trait BuildHasher {\n type H: Hasher;\n\n fn build_hasher(self) -> H;\n}\n\npub struct BuildHasherDefault<H>;\n\nimpl<H> BuildHasher for BuildHasherDefault<H>\nwhere\n H: Hasher + Default,\n{\n type H = H;\n\n fn build_hasher(_self: Self) -> H {\n H::default()\n }\n}\n\nimpl<H> Default for BuildHasherDefault<H>\nwhere\n H: Hasher + Default,\n{\n fn default() -> Self {\n BuildHasherDefault {}\n }\n}\n\nimpl Hash for Field {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self);\n }\n}\n\nimpl Hash for u1 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u8 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u16 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u32 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u64 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u128 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for i8 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as u8 as Field);\n }\n}\n\nimpl Hash for i16 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as u16 as Field);\n }\n}\n\nimpl Hash for i32 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as u32 as Field);\n }\n}\n\nimpl Hash for i64 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as u64 as Field);\n }\n}\n\nimpl Hash for bool {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for () {\n fn hash<H>(_self: Self, _state: &mut H)\n where\n H: Hasher,\n {}\n}\n\nimpl<T, let N: u32> Hash for [T; N]\nwhere\n T: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n for elem in self {\n elem.hash(state);\n }\n }\n}\n\nimpl<T> Hash for [T]\nwhere\n T: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.len().hash(state);\n for elem in self {\n elem.hash(state);\n }\n }\n}\n\nimpl<A, B> Hash for (A, B)\nwhere\n A: Hash,\n B: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n self.1.hash(state);\n }\n}\n\nimpl<A, B, C> Hash for (A, B, C)\nwhere\n A: Hash,\n B: Hash,\n C: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n self.1.hash(state);\n self.2.hash(state);\n }\n}\n\nimpl<A, B, C, D> Hash for (A, B, C, D)\nwhere\n A: Hash,\n B: Hash,\n C: Hash,\n D: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n self.1.hash(state);\n self.2.hash(state);\n self.3.hash(state);\n }\n}\n\nimpl<A, B, C, D, E> Hash for (A, B, C, D, E)\nwhere\n A: Hash,\n B: Hash,\n C: Hash,\n D: Hash,\n E: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n self.1.hash(state);\n self.2.hash(state);\n self.3.hash(state);\n self.4.hash(state);\n }\n}\n\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 is_infinite: false,\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 is_infinite: false,\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 is_infinite: false,\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 is_infinite: false,\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 is_infinite: false,\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 is_infinite: false,\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 is_infinite: false,\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 is_infinite: false,\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 is_infinite: false,\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 is_infinite: false,\n },\n );\n}\n"
2326
2046
  },
2327
2047
  "180": {
2328
2048
  "function_locations": [
2329
2049
  {
2330
- "name": "invalidate_contract_sync_cache_oracle",
2331
- "start": 241
2050
+ "name": "set_contract_sync_cache_invalid_oracle",
2051
+ "start": 242
2332
2052
  },
2333
2053
  {
2334
- "name": "invalidate_contract_sync_cache",
2335
- "start": 698
2054
+ "name": "set_contract_sync_cache_invalid",
2055
+ "start": 700
2336
2056
  }
2337
2057
  ],
2338
2058
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/contract_sync.nr",
2339
- "source": "use crate::protocol::address::AztecAddress;\n\n#[oracle(aztec_utl_invalidateContractSyncCache)]\nunconstrained fn invalidate_contract_sync_cache_oracle<let N: u32>(\n contract_address: AztecAddress,\n scopes: BoundedVec<AztecAddress, N>,\n) {}\n\n/// Forces the PXE to re-sync the given contract for a set of scopes on the next query.\n///\n/// Call this after writing data (e.g. offchain messages) that the contract's `sync_state` function needs to discover.\n/// Without invalidation, the sync cache would skip re-running `sync_state` until the next block.\npub unconstrained fn invalidate_contract_sync_cache<let N: u32>(\n contract_address: AztecAddress,\n scopes: BoundedVec<AztecAddress, N>,\n) {\n invalidate_contract_sync_cache_oracle(contract_address, scopes);\n}\n"
2059
+ "source": "use crate::protocol::address::AztecAddress;\n\n#[oracle(aztec_utl_setContractSyncCacheInvalid)]\nunconstrained fn set_contract_sync_cache_invalid_oracle<let N: u32>(\n contract_address: AztecAddress,\n scopes: BoundedVec<AztecAddress, N>,\n) {}\n\n/// Forces the PXE to re-sync the given contract for a set of scopes on the next query.\n///\n/// Call this after writing data (e.g. offchain messages) that the contract's `sync_state` function needs to discover.\n/// Without invalidation, the sync cache would skip re-running `sync_state` until the next block.\npub unconstrained fn set_contract_sync_cache_invalid<let N: u32>(\n contract_address: AztecAddress,\n scopes: BoundedVec<AztecAddress, N>,\n) {\n set_contract_sync_cache_invalid_oracle(contract_address, scopes);\n}\n"
2340
2060
  },
2341
2061
  "181": {
2342
2062
  "function_locations": [
@@ -2356,53 +2076,53 @@
2356
2076
  "function_locations": [
2357
2077
  {
2358
2078
  "name": "fetch_tagged_logs",
2359
- "start": 330
2079
+ "start": 393
2360
2080
  },
2361
2081
  {
2362
- "name": "fetch_tagged_logs_oracle",
2363
- "start": 523
2082
+ "name": "get_pending_tagged_logs_oracle",
2083
+ "start": 631
2364
2084
  },
2365
2085
  {
2366
2086
  "name": "validate_and_store_enqueued_notes_and_events",
2367
- "start": 992
2087
+ "start": 1125
2368
2088
  },
2369
2089
  {
2370
2090
  "name": "validate_and_store_enqueued_notes_and_events_oracle",
2371
- "start": 1595
2091
+ "start": 1768
2372
2092
  },
2373
2093
  {
2374
- "name": "bulk_retrieve_logs",
2375
- "start": 1788
2094
+ "name": "get_logs_by_tag",
2095
+ "start": 1983
2376
2096
  },
2377
2097
  {
2378
- "name": "bulk_retrieve_logs_oracle",
2379
- "start": 2177
2098
+ "name": "get_logs_by_tag_oracle",
2099
+ "start": 2402
2380
2100
  },
2381
2101
  {
2382
- "name": "resolve_message_contexts",
2383
- "start": 2380
2102
+ "name": "get_message_contexts_by_tx_hash",
2103
+ "start": 2637
2384
2104
  },
2385
2105
  {
2386
- "name": "resolve_message_contexts_oracle",
2387
- "start": 2802
2106
+ "name": "get_message_contexts_by_tx_hash_oracle",
2107
+ "start": 3110
2388
2108
  }
2389
2109
  ],
2390
2110
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/message_processing.nr",
2391
- "source": "use crate::protocol::address::AztecAddress;\n\n/// Finds new private logs that may have been sent to all registered accounts in PXE in the current contract and makes\n/// them available for later processing in Noir by storing them in a capsule array.\npub unconstrained fn fetch_tagged_logs(pending_tagged_log_array_base_slot: Field) {\n fetch_tagged_logs_oracle(pending_tagged_log_array_base_slot);\n}\n\n#[oracle(aztec_utl_fetchTaggedLogs)]\nunconstrained fn fetch_tagged_logs_oracle(pending_tagged_log_array_base_slot: Field) {}\n\n// This must be a single oracle and not one for notes and one for events because the entire point is to validate all\n// notes and events in one go, minimizing node round-trips.\npub(crate) unconstrained fn validate_and_store_enqueued_notes_and_events(\n contract_address: AztecAddress,\n note_validation_requests_array_base_slot: Field,\n event_validation_requests_array_base_slot: Field,\n max_note_packed_len: Field,\n max_event_serialized_len: Field,\n) {\n validate_and_store_enqueued_notes_and_events_oracle(\n contract_address,\n note_validation_requests_array_base_slot,\n event_validation_requests_array_base_slot,\n max_note_packed_len,\n max_event_serialized_len,\n );\n}\n\n#[oracle(aztec_utl_validateAndStoreEnqueuedNotesAndEvents)]\nunconstrained fn validate_and_store_enqueued_notes_and_events_oracle(\n contract_address: AztecAddress,\n note_validation_requests_array_base_slot: Field,\n event_validation_requests_array_base_slot: Field,\n max_note_packed_len: Field,\n max_event_serialized_len: Field,\n) {}\n\npub(crate) unconstrained fn bulk_retrieve_logs(\n contract_address: AztecAddress,\n log_retrieval_requests_array_base_slot: Field,\n log_retrieval_responses_array_base_slot: Field,\n) {\n bulk_retrieve_logs_oracle(\n contract_address,\n log_retrieval_requests_array_base_slot,\n log_retrieval_responses_array_base_slot,\n );\n}\n\n#[oracle(aztec_utl_bulkRetrieveLogs)]\nunconstrained fn bulk_retrieve_logs_oracle(\n contract_address: AztecAddress,\n log_retrieval_requests_array_base_slot: Field,\n log_retrieval_responses_array_base_slot: Field,\n) {}\n\npub(crate) unconstrained fn resolve_message_contexts(\n contract_address: AztecAddress,\n message_context_requests_array_base_slot: Field,\n message_context_responses_array_base_slot: Field,\n) {\n resolve_message_contexts_oracle(\n contract_address,\n message_context_requests_array_base_slot,\n message_context_responses_array_base_slot,\n );\n}\n\n#[oracle(aztec_utl_utilityResolveMessageContexts)]\nunconstrained fn resolve_message_contexts_oracle(\n contract_address: AztecAddress,\n message_context_requests_array_base_slot: Field,\n message_context_responses_array_base_slot: Field,\n) {}\n"
2111
+ "source": "use crate::protocol::address::AztecAddress;\n\n/// Finds new private logs that may have been sent to all registered accounts in PXE in the current contract and makes\n/// them available for later processing in Noir by storing them in a capsule array.\n// TODO(F-498): review naming consistency\npub unconstrained fn fetch_tagged_logs(pending_tagged_log_array_base_slot: Field, scope: AztecAddress) {\n get_pending_tagged_logs_oracle(pending_tagged_log_array_base_slot, scope);\n}\n\n#[oracle(aztec_utl_getPendingTaggedLogs)]\nunconstrained fn get_pending_tagged_logs_oracle(pending_tagged_log_array_base_slot: Field, scope: AztecAddress) {}\n\n// This must be a single oracle and not one for notes and one for events because the entire point is to validate all\n// notes and events in one go, minimizing node round-trips.\npub(crate) unconstrained fn validate_and_store_enqueued_notes_and_events(\n contract_address: AztecAddress,\n note_validation_requests_array_base_slot: Field,\n event_validation_requests_array_base_slot: Field,\n max_note_packed_len: Field,\n max_event_serialized_len: Field,\n scope: AztecAddress,\n) {\n validate_and_store_enqueued_notes_and_events_oracle(\n contract_address,\n note_validation_requests_array_base_slot,\n event_validation_requests_array_base_slot,\n max_note_packed_len,\n max_event_serialized_len,\n scope,\n );\n}\n\n#[oracle(aztec_utl_validateAndStoreEnqueuedNotesAndEvents)]\nunconstrained fn validate_and_store_enqueued_notes_and_events_oracle(\n contract_address: AztecAddress,\n note_validation_requests_array_base_slot: Field,\n event_validation_requests_array_base_slot: Field,\n max_note_packed_len: Field,\n max_event_serialized_len: Field,\n scope: AztecAddress,\n) {}\n\npub(crate) unconstrained fn get_logs_by_tag(\n contract_address: AztecAddress,\n log_retrieval_requests_array_base_slot: Field,\n log_retrieval_responses_array_base_slot: Field,\n scope: AztecAddress,\n) {\n get_logs_by_tag_oracle(\n contract_address,\n log_retrieval_requests_array_base_slot,\n log_retrieval_responses_array_base_slot,\n scope,\n );\n}\n\n#[oracle(aztec_utl_getLogsByTag)]\nunconstrained fn get_logs_by_tag_oracle(\n contract_address: AztecAddress,\n log_retrieval_requests_array_base_slot: Field,\n log_retrieval_responses_array_base_slot: Field,\n scope: AztecAddress,\n) {}\n\npub(crate) unconstrained fn get_message_contexts_by_tx_hash(\n contract_address: AztecAddress,\n message_context_requests_array_base_slot: Field,\n message_context_responses_array_base_slot: Field,\n scope: AztecAddress,\n) {\n get_message_contexts_by_tx_hash_oracle(\n contract_address,\n message_context_requests_array_base_slot,\n message_context_responses_array_base_slot,\n scope,\n );\n}\n\n#[oracle(aztec_utl_getMessageContextsByTxHash)]\nunconstrained fn get_message_contexts_by_tx_hash_oracle(\n contract_address: AztecAddress,\n message_context_requests_array_base_slot: Field,\n message_context_responses_array_base_slot: Field,\n scope: AztecAddress,\n) {}\n"
2392
2112
  },
2393
2113
  "198": {
2394
2114
  "function_locations": [
2395
2115
  {
2396
2116
  "name": "get_shared_secret_oracle",
2397
- "start": 262
2117
+ "start": 267
2398
2118
  },
2399
2119
  {
2400
2120
  "name": "get_shared_secret",
2401
- "start": 969
2121
+ "start": 1354
2402
2122
  }
2403
2123
  ],
2404
2124
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/shared_secret.nr",
2405
- "source": "use crate::protocol::{address::aztec_address::AztecAddress, point::Point};\n\n// TODO(#12656): return an app-siloed secret + document this\n#[oracle(aztec_utl_getSharedSecret)]\nunconstrained fn get_shared_secret_oracle(address: AztecAddress, ephPk: Point) -> Point {}\n\n/// Returns an app-siloed shared secret between `address` and someone who knows the secret key behind an ephemeral\n/// public key `ephPk`. The app-siloing means that contracts cannot retrieve secrets that belong to other contracts,\n/// and therefore cannot e.g. decrypt their messages. This is an important security consideration given that both the\n/// `address` and `ephPk` are public information.\n///\n/// The shared secret `S` is computed as: `let S = (ivsk + h) * ephPk` where `ivsk + h` is the 'preaddress' i.e. the\n/// preimage of the address, also called the address secret. TODO(#12656): app-silo this secret\npub unconstrained fn get_shared_secret(address: AztecAddress, ephPk: Point) -> Point {\n get_shared_secret_oracle(address, ephPk)\n}\n"
2125
+ "source": "use crate::protocol::address::aztec_address::AztecAddress;\nuse crate::protocol::point::Point;\n\n#[oracle(aztec_utl_getSharedSecret)]\nunconstrained fn get_shared_secret_oracle(\n address: AztecAddress,\n ephPk: Point,\n contract_address: AztecAddress,\n) -> Field {}\n\n/// Returns an app-siloed shared secret between `address` and someone who knows the secret key behind an ephemeral\n/// public key `ephPk`.\n///\n/// The returned value is a Field `s_app`, 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).\npub unconstrained fn get_shared_secret(address: AztecAddress, ephPk: Point, contract_address: AztecAddress) -> Field {\n get_shared_secret_oracle(address, ephPk, contract_address)\n}\n"
2406
2126
  },
2407
2127
  "247": {
2408
2128
  "function_locations": [
@@ -2426,41 +2146,7 @@
2426
2146
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/append.nr",
2427
2147
  "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<T, let ALen: u32, let BLen: u32, let DstLen: u32>(\n a: BoundedVec<T, ALen>,\n b: BoundedVec<T, BLen>,\n) -> BoundedVec<T, DstLen> {\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<Field, 5> = 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<Field, 8> = 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<Field, 5> = append(a, b);\n }\n}\n"
2428
2148
  },
2429
- "248": {
2430
- "function_locations": [
2431
- {
2432
- "name": "assert_bounded_vec_trimmed",
2433
- "start": 705
2434
- },
2435
- {
2436
- "name": "test::trimmed_empty_vec",
2437
- "start": 1039
2438
- },
2439
- {
2440
- "name": "test::trimmed_full_vec",
2441
- "start": 1200
2442
- },
2443
- {
2444
- "name": "test::trimmed_partial_vec",
2445
- "start": 1370
2446
- },
2447
- {
2448
- "name": "test::dirty_trailing_element_fails",
2449
- "start": 1613
2450
- },
2451
- {
2452
- "name": "test::dirty_last_element_fails",
2453
- "start": 1983
2454
- },
2455
- {
2456
- "name": "test::trimmed_array_elements",
2457
- "start": 2191
2458
- }
2459
- ],
2460
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/assert_trimmed.nr",
2461
- "source": "/// Asserts that elements past `len()` in a `BoundedVec` are zeroed.\n///\n/// Oracle functions may return `BoundedVec` values with dirty trailing storage (non-zero elements past `len()`).\n/// This is problematic because `BoundedVec`'s `Eq` implementation and other operations assume trailing elements\n/// are zeroed.\n///\n/// This function should be called on any `BoundedVec` obtained from an oracle to guard against malformed data.\n///\n/// TODO(https://github.com/noir-lang/noir/issues/4218): Remove once Noir natively validates `BoundedVec` returned\n/// from unconstrained functions.\npub(crate) unconstrained fn assert_bounded_vec_trimmed<T, let MaxLen: u32>(vec: BoundedVec<T, MaxLen>)\nwhere\n T: Eq,\n{\n let storage = vec.storage();\n let len = vec.len();\n for i in 0..MaxLen {\n if i >= len {\n assert_eq(storage[i], std::mem::zeroed(), \"BoundedVec has non-zero trailing elements\");\n }\n }\n}\n\nmod test {\n use super::assert_bounded_vec_trimmed;\n\n #[test]\n unconstrained fn trimmed_empty_vec() {\n let vec: BoundedVec<Field, 3> = BoundedVec::new();\n assert_bounded_vec_trimmed(vec);\n }\n\n #[test]\n unconstrained fn trimmed_full_vec() {\n let vec = BoundedVec::<Field, 3>::from_array([1, 2, 3]);\n assert_bounded_vec_trimmed(vec);\n }\n\n #[test]\n unconstrained fn trimmed_partial_vec() {\n let vec = BoundedVec::<Field, 5>::from_array([1, 2, 3]);\n assert_bounded_vec_trimmed(vec);\n }\n\n #[test(should_fail_with = \"BoundedVec has non-zero trailing elements\")]\n unconstrained fn dirty_trailing_element_fails() {\n let mut vec = BoundedVec::<Field, 3>::from_array([1]);\n // We use the unchecked setter to write past the length, knowingly breaking the invariant.\n vec.set_unchecked(1, 42);\n assert_bounded_vec_trimmed(vec);\n }\n\n #[test(should_fail_with = \"BoundedVec has non-zero trailing elements\")]\n unconstrained fn dirty_last_element_fails() {\n let mut vec = BoundedVec::<Field, 3>::from_array([1, 2]);\n vec.set_unchecked(2, 99);\n assert_bounded_vec_trimmed(vec);\n }\n\n #[test]\n unconstrained fn trimmed_array_elements() {\n // Test with array element type (like get_notes_oracle returns BoundedVec<[Field; N], MaxNotes>).\n let vec = BoundedVec::<[Field; 2], 3>::from_array([[1, 2], [3, 4]]);\n assert_bounded_vec_trimmed(vec);\n }\n}\n"
2462
- },
2463
- "251": {
2149
+ "250": {
2464
2150
  "function_locations": [
2465
2151
  {
2466
2152
  "name": "subarray",
@@ -2490,7 +2176,7 @@
2490
2176
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/subarray.nr",
2491
2177
  "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<T, let SrcLen: u32, let DstLen: u32>(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::<Field, _, _>([], 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::<Field, _, _>([], 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"
2492
2178
  },
2493
- "252": {
2179
+ "251": {
2494
2180
  "function_locations": [
2495
2181
  {
2496
2182
  "name": "subbvec",
@@ -2532,7 +2218,7 @@
2532
2218
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/subbvec.nr",
2533
2219
  "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<T, let SrcMaxLen: u32, let DstMaxLen: u32>(\n bvec: BoundedVec<T, SrcMaxLen>,\n offset: u32,\n) -> BoundedVec<T, DstMaxLen> {\n // from_parts_unchecked does not verify that the elements past len are zeroed, but that is not an issue in our case\n // because we're constructing the new storage array as a subarray of the original one (which should have zeroed\n // storage past len), guaranteeing correctness. This is because `subarray` does not allow extending arrays past\n // their original length.\n BoundedVec::from_parts_unchecked(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::<Field, 0>::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"
2534
2220
  },
2535
- "254": {
2221
+ "253": {
2536
2222
  "function_locations": [
2537
2223
  {
2538
2224
  "name": "compare",
@@ -2546,7 +2232,7 @@
2546
2232
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/comparison.nr",
2547
2233
  "source": "struct ComparatorEnum {\n pub EQ: u8,\n pub NEQ: u8,\n pub LT: u8,\n pub LTE: u8,\n pub GT: u8,\n pub GTE: u8,\n}\n\npub global Comparator: ComparatorEnum = ComparatorEnum { EQ: 1, NEQ: 2, LT: 3, LTE: 4, GT: 5, GTE: 6 };\n\npub fn compare(lhs: Field, operation: u8, rhs: Field) -> bool {\n // Values are computed ahead of time because circuits evaluate all branches\n let is_equal = lhs == rhs;\n let is_lt = lhs.lt(rhs);\n\n if (operation == Comparator.EQ) {\n is_equal\n } else if (operation == Comparator.NEQ) {\n !is_equal\n } else if (operation == Comparator.LT) {\n is_lt\n } else if (operation == Comparator.LTE) {\n is_lt | is_equal\n } else if (operation == Comparator.GT) {\n !is_lt & !is_equal\n } else if (operation == Comparator.GTE) {\n !is_lt\n } else {\n panic(f\"Invalid operation\")\n }\n}\n\nmod test {\n use super::Comparator;\n use super::compare;\n\n #[test]\n unconstrained fn test_compare() {\n let lhs = 10;\n let rhs = 10;\n assert(compare(lhs, Comparator.EQ, rhs), \"Expected lhs to be equal to rhs\");\n\n let lhs = 10;\n let rhs = 11;\n assert(compare(lhs, Comparator.NEQ, rhs), \"Expected lhs to be not equal to rhs\");\n\n let lhs = 10;\n let rhs = 11;\n assert(compare(lhs, Comparator.LT, rhs), \"Expected lhs to be less than rhs\");\n\n let lhs = 10;\n let rhs = 10;\n assert(compare(lhs, Comparator.LTE, rhs), \"Expected lhs to be less than or equal to rhs\");\n\n let lhs = 11;\n let rhs = 10;\n assert(compare(lhs, Comparator.GT, rhs), \"Expected lhs to be greater than rhs\");\n\n let lhs = 10;\n let rhs = 10;\n assert(compare(lhs, Comparator.GTE, rhs), \"Expected lhs to be greater than or equal to rhs\");\n\n let lhs = 11;\n let rhs = 10;\n assert(compare(lhs, Comparator.GTE, rhs), \"Expected lhs to be greater than or equal to rhs\");\n\n let lhs = 10;\n let rhs = 11;\n assert(!compare(lhs, Comparator.EQ, rhs), \"Expected lhs to be not equal to rhs\");\n\n let lhs = 10;\n let rhs = 10;\n assert(!compare(lhs, Comparator.NEQ, rhs), \"Expected lhs to not be not equal to rhs\");\n\n let lhs = 11;\n let rhs = 10;\n assert(!compare(lhs, Comparator.LT, rhs), \"Expected lhs to not be less than rhs\");\n\n let lhs = 11;\n let rhs = 10;\n assert(!compare(lhs, Comparator.LTE, rhs), \"Expected lhs to not be less than or equal to rhs\");\n\n let lhs = 10;\n let rhs = 10;\n assert(!compare(lhs, Comparator.GT, rhs), \"Expected lhs to not be greater than rhs\");\n\n let lhs = 10;\n let rhs = 11;\n assert(!compare(lhs, Comparator.GTE, rhs), \"Expected lhs to not be greater than or equal to rhs\");\n\n let lhs = 10;\n let rhs = 11;\n assert(!compare(lhs, Comparator.GTE, rhs), \"Expected lhs to not be greater than or equal to rhs\");\n }\n}\n"
2548
2234
  },
2549
- "255": {
2235
+ "254": {
2550
2236
  "function_locations": [
2551
2237
  {
2552
2238
  "name": "bytes_to_fields",
@@ -2568,7 +2254,7 @@
2568
2254
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/conversion/bytes_to_fields.nr",
2569
2255
  "source": "use std::static_assert;\n\n// These functions are used to facilitate the conversion of log ciphertext between byte and field representations.\n//\n// `bytes_to_fields` uses fixed-size arrays since encryption contexts have compile-time size information.\n// `bytes_from_fields` uses BoundedVec for flexibility in unconstrained contexts where sizes are dynamic.\n//\n// Together they provide bidirectional conversion between bytes and fields when processing encrypted logs.\n\n/// Converts the input bytes into an array of fields. A Field is ~254 bits meaning that each field can store 31 whole\n/// bytes. Use `bytes_from_fields` to obtain the original bytes array.\n///\n/// The input bytes are chunked into chunks of 31 bytes. Each 31-byte chunk is viewed as big-endian, and is converted\n/// into a Field. For example, [1, 10, 3, ..., 0] (31 bytes) is encoded as [1 * 256^30 + 10 * 256^29 + 3 * 256^28 + ...\n/// + 0] Note: N must be a multiple of 31 bytes\npub fn bytes_to_fields<let N: u32>(bytes: [u8; N]) -> [Field; N / 31] {\n // Assert that N is a multiple of 31\n static_assert(N % 31 == 0, \"N must be a multiple of 31\");\n\n let mut fields = [0; N / 31];\n\n // Since N is a multiple of 31, we can simply process all chunks fully\n for i in 0..N / 31 {\n let mut field = 0;\n for j in 0..31 {\n // Shift the existing value left by 8 bits and add the new byte\n field = field * 256 + bytes[i * 31 + j] as Field;\n }\n fields[i] = field;\n }\n\n fields\n}\n\n/// Converts an input BoundedVec of fields into a BoundedVec of bytes in big-endian order. Arbitrary Field arrays are\n/// not allowed: this is assumed to be an array obtained via `bytes_to_fields`, i.e. one that actually represents\n/// bytes. To convert a Field array into bytes, use `fields_to_bytes`.\n///\n/// Each input field must contain at most 31 bytes (this is constrained to be so). Each field is converted into 31\n/// big-endian bytes, and the resulting 31-byte chunks are concatenated back together in the order of the original\n/// fields.\npub fn bytes_from_fields<let N: u32>(fields: BoundedVec<Field, N>) -> BoundedVec<u8, N * 31> {\n let mut bytes = BoundedVec::new();\n\n for i in 0..fields.len() {\n let field = fields.get(i);\n\n // We expect that the field contains at most 31 bytes of information.\n field.assert_max_bit_size::<248>();\n\n // Now we can safely convert the field to 31 bytes.\n let field_as_bytes: [u8; 31] = field.to_be_bytes();\n\n for j in 0..31 {\n bytes.push(field_as_bytes[j]);\n }\n }\n\n bytes\n}\n\nmod tests {\n use crate::utils::array::subarray;\n use super::{bytes_from_fields, bytes_to_fields};\n\n #[test]\n unconstrained fn random_bytes_to_fields_and_back(input: [u8; 93]) {\n let fields = bytes_to_fields(input);\n\n // At this point in production, the log flies through the system and we get a BoundedVec on the other end. So\n // we need to convert the field array to a BoundedVec to be able to feed it to the `bytes_from_fields`\n // function.\n let fields_as_bounded_vec = BoundedVec::<_, 6>::from_array(fields);\n\n let bytes_back = bytes_from_fields(fields_as_bounded_vec);\n\n // Compare the original input with the round-tripped result\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 bytes_to_fields_input_length_not_multiple_of_31() {\n // Try to convert 32 bytes (not a multiple of 31) to fields\n let _fields = bytes_to_fields([0; 32]);\n }\n\n}\n"
2570
2256
  },
2571
- "256": {
2257
+ "255": {
2572
2258
  "function_locations": [
2573
2259
  {
2574
2260
  "name": "fields_to_bytes",
@@ -2618,7 +2304,7 @@
2618
2304
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/conversion/fields_to_bytes.nr",
2619
2305
  "source": "// These functions are used to facilitate the conversion of log plaintext represented as fields into bytes and back.\n//\n// `fields_to_bytes` uses fixed-size arrays since encryption contexts have compile-time size information.\n// `fields_from_bytes` uses BoundedVec for flexibility in unconstrained contexts where sizes are dynamic.\n//\n// Together they provide bidirectional conversion between fields and bytes.\n\n/// Converts an input array of fields into a single array of bytes. Use `fields_from_bytes` to obtain the original\n/// field array. Each field is converted to a 32-byte big-endian array.\n///\n/// For example, if you have a field array [123, 456], it will be converted to a 64-byte array:\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,123, // 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,1,200] // Second field (32 bytes)\n///\n/// Since a field is ~254 bits, you'll end up with a subtle 2-bit \"gap\" at the big end, every 32 bytes. Be careful that\n/// such a gap doesn't leak information! This could happen if you for example expected the output to be\n/// indistinguishable from random bytes.\npub fn fields_to_bytes<let N: u32>(fields: [Field; N]) -> [u8; 32 * N] {\n let mut bytes = [0; 32 * N];\n\n for i in 0..N {\n let field_as_bytes: [u8; 32] = fields[i].to_be_bytes();\n\n for j in 0..32 {\n bytes[i * 32 + j] = field_as_bytes[j];\n }\n }\n\n bytes\n}\n\n/// Converts an input BoundedVec of bytes into a BoundedVec of fields. Arbitrary byte arrays are not allowed: this is\n/// assumed to be an array obtained via `fields_to_bytes`, i.e. one that actually represents fields. To convert a byte\n/// array into Fields, use `bytes_to_fields`.\n///\n/// The input bytes are chunked into chunks of 32 bytes. Each 32-byte chunk is viewed as big-endian, and is converted\n/// into a Field. For example, [1, 10, 3, ..., 0] (32 bytes) is encoded as [1 * 256^31 + 10 * 256^30 + 3 * 256^29 + ...\n/// + 0] Note 1: N must be a multiple of 32 bytes Note 2: The max value check code was taken from\n/// std::field::to_be_bytes function.\npub fn fields_from_bytes<let N: u32>(bytes: BoundedVec<u8, N>) -> BoundedVec<Field, N / 32> {\n // Assert that input length is a multiple of 32\n assert(bytes.len() % 32 == 0, \"Input length must be a multiple of 32\");\n\n try_fields_from_bytes(bytes).expect(f\"Value does not fit in field\")\n}\n\n/// Converts a single 32-byte big-endian chunk (starting at `offset`) into a Field, returning\n/// `Option::none()` if the chunk's value is >= the field modulus.\nfn try_field_from_be_bytes<let N: u32>(bytes: BoundedVec<u8, N>, offset: u32) -> Option<Field> {\n let p = std::field::modulus_be_bytes();\n let mut field = 0;\n // Field arithmetic silently wraps values >= the modulus, so we compare each 32-byte chunk against\n // the modulus byte-by-byte (big-endian, most significant first). The first byte that differs\n // determines the result: if our byte is smaller we're valid, if larger we've overflowed.\n // cmp tracks the result: 0 = equal so far, 1 = less than modulus, 2 = exceeds modulus.\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\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 if cmp == 1 {\n Option::some(field)\n } else {\n Option::none()\n }\n}\n\n/// Non-panicking version of `fields_from_bytes`. Returns `Option::none()` if the input\n/// length is not a multiple of 32 or if any 32-byte chunk exceeds the field modulus.\npub(crate) fn try_fields_from_bytes<let N: u32>(bytes: BoundedVec<u8, N>) -> Option<BoundedVec<Field, N / 32>> {\n if bytes.len() % 32 == 0 {\n let mut fields = BoundedVec::new();\n let num_chunks = bytes.len() / 32;\n for i in 0..num_chunks {\n let field = try_field_from_be_bytes(bytes, i * 32);\n if field.is_some() {\n fields.push(field.unwrap());\n }\n }\n if fields.len() as u32 == num_chunks {\n Option::some(fields)\n } else {\n Option::none()\n }\n } else {\n Option::none()\n }\n}\n\nmod tests {\n use crate::utils::array::subarray;\n use super::{fields_from_bytes, fields_to_bytes, try_fields_from_bytes};\n\n #[test]\n unconstrained fn random_fields_to_bytes_and_back(input: [Field; 3]) {\n // Convert to bytes\n let bytes = fields_to_bytes(input);\n\n // At this point in production, the log flies through the system and we get a BoundedVec on the other end. So\n // we need to convert the field array to a BoundedVec to be able to feed it to the `fields_from_bytes`\n // function. 113 is an arbitrary max length that is larger than the input length of 96.\n let bytes_as_bounded_vec = BoundedVec::<_, 113>::from_array(bytes);\n\n // Convert back to fields\n let fields_back = fields_from_bytes(bytes_as_bounded_vec);\n\n // Compare the original input with the round-tripped result\n assert_eq(fields_back.len(), input.len());\n assert_eq(subarray(fields_back.storage(), 0), input);\n }\n\n #[test(should_fail_with = \"Input length must be a multiple of 32\")]\n unconstrained fn to_fields_assert() {\n // 143 is an arbitrary max length that is larger than 33\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\n // This should fail since 33 is not a multiple of 32\n let _fields = fields_from_bytes(input);\n }\n\n #[test]\n unconstrained fn fields_from_bytes_max_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 = fields_from_bytes(input);\n\n // The result should be a largest value storable in a field (-1 since we are modulo-ing)\n assert_eq(fields.get(0), -1);\n }\n\n // In this test we verify that overflow check works by taking the max allowed value, bumping a random byte and then\n // feeding it to `fields_from_bytes` as input.\n #[test(should_fail_with = \"Value does not fit in field\")]\n unconstrained fn fields_from_bytes_overflow(random_value: u8) {\n let index_of_byte_to_bump = random_value % 32;\n\n // Obtain the byte representation of the maximum field value\n let max_field_value_as_bytes: [u8; 32] = (-1).to_be_bytes();\n\n let byte_to_bump = max_field_value_as_bytes[index_of_byte_to_bump as u32];\n\n // Skip test execution if the selected byte is already at maximum value (255). This is acceptable since we are\n // using fuzz testing to generate many test cases.\n if byte_to_bump != 255 {\n let mut input = BoundedVec::<_, 32>::from_array(max_field_value_as_bytes);\n\n // Increment the selected byte to exceed the field's maximum value\n input.set(index_of_byte_to_bump as u32, byte_to_bump + 1);\n\n // Attempt the conversion, which should fail due to the value exceeding the field's capacity\n let _fields = fields_from_bytes(input);\n }\n }\n\n #[test]\n unconstrained fn try_fields_from_bytes_returns_none_on_unaligned_length() {\n let input = BoundedVec::<_, 64>::from_parts([0 as u8; 64], 33);\n assert(try_fields_from_bytes(input).is_none());\n }\n\n #[test]\n unconstrained fn try_fields_from_bytes_returns_none_on_field_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::<u8, 32>::from_array(p);\n assert(try_fields_from_bytes(input).is_none());\n }\n\n #[test]\n unconstrained fn try_fields_from_bytes_round_trips(input: [Field; 3]) {\n let bytes = BoundedVec::<_, 113>::from_array(fields_to_bytes(input));\n let fields = try_fields_from_bytes(bytes).unwrap();\n\n assert_eq(fields.len(), input.len());\n assert_eq(subarray(fields.storage(), 0), input);\n }\n}\n"
2620
2306
  },
2621
- "259": {
2307
+ "258": {
2622
2308
  "function_locations": [
2623
2309
  {
2624
2310
  "name": "get_sign_of_point",
@@ -2668,7 +2354,7 @@
2668
2354
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/point.nr",
2669
2355
  "source": "use crate::protocol::{point::Point, 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: Point) -> 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 a `Point` 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<Point> {\n // y ^ 2 = x ^ 3 - 17\n let rhs = x * x * x - 17;\n sqrt(rhs).map(|y| Point { x, y, is_infinite: false })\n}\n\n/// Returns a `Point` 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<Point> {\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 Point { x, y: final_y, is_infinite: false }\n })\n}\n\nmod test {\n use crate::protocol::point::Point;\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 = Point { x: point.x, y: 0 - point.y, is_infinite: false };\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 = Point { x: 0, y: 0, is_infinite: false };\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 = Point { x: 0, y: BN254_FR_MODULUS_DIV_2, is_infinite: false };\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 = Point { x: 0, y: BN254_FR_MODULUS_DIV_2 + 1, is_infinite: false };\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"
2670
2356
  },
2671
- "269": {
2357
+ "268": {
2672
2358
  "function_locations": [
2673
2359
  {
2674
2360
  "name": "Poseidon2::hash",
@@ -2710,149 +2396,7 @@
2710
2396
  "path": "/home/aztec-dev/nargo/github.com/noir-lang/poseidon/v0.2.6/src/poseidon2.nr",
2711
2397
  "source": "use std::default::Default;\nuse std::hash::Hasher;\n\nglobal RATE: u32 = 3;\n\npub struct Poseidon2 {\n cache: [Field; 3],\n state: [Field; 4],\n cache_size: u32,\n squeeze_mode: bool, // 0 => absorb, 1 => squeeze\n}\n\nimpl Poseidon2 {\n #[no_predicates]\n pub fn hash<let N: u32>(input: [Field; N], message_size: u32) -> Field {\n Poseidon2::hash_internal(input, message_size)\n }\n\n pub(crate) fn new(iv: Field) -> Poseidon2 {\n let mut result =\n Poseidon2 { cache: [0; 3], state: [0; 4], cache_size: 0, squeeze_mode: false };\n result.state[RATE] = iv;\n result\n }\n\n fn perform_duplex(&mut self) {\n // add the cache into sponge state\n self.state[0] += self.cache[0];\n self.state[1] += self.cache[1];\n self.state[2] += self.cache[2];\n self.state = crate::poseidon2_permutation(self.state, 4);\n }\n\n fn absorb(&mut self, input: Field) {\n assert(!self.squeeze_mode);\n if self.cache_size == RATE {\n // If we're absorbing, and the cache is full, apply the sponge permutation to compress the cache\n self.perform_duplex();\n self.cache[0] = input;\n self.cache_size = 1;\n } else {\n // If we're absorbing, and the cache is not full, add the input into the cache\n self.cache[self.cache_size] = input;\n self.cache_size += 1;\n }\n }\n\n fn squeeze(&mut self) -> Field {\n assert(!self.squeeze_mode);\n // If we're in absorb mode, apply sponge permutation to compress the cache.\n self.perform_duplex();\n self.squeeze_mode = true;\n\n // Pop one item off the top of the permutation and return it.\n self.state[0]\n }\n\n fn hash_internal<let N: u32>(input: [Field; N], in_len: u32) -> Field {\n let two_pow_64 = 18446744073709551616;\n let iv: Field = (in_len as Field) * two_pow_64;\n let mut state = [0; 4];\n state[RATE] = iv;\n\n if std::runtime::is_unconstrained() {\n for i in 0..(in_len / RATE) {\n state[0] += input[i * RATE];\n state[1] += input[i * RATE + 1];\n state[2] += input[i * RATE + 2];\n state = crate::poseidon2_permutation(state, 4);\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, 4);\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, 4);\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"
2712
2398
  },
2713
- "3": {
2714
- "function_locations": [
2715
- {
2716
- "name": "[T; N]::len",
2717
- "start": 480
2718
- },
2719
- {
2720
- "name": "[T; N]::as_vector",
2721
- "start": 735
2722
- },
2723
- {
2724
- "name": "[T; N]::as_slice",
2725
- "start": 1112
2726
- },
2727
- {
2728
- "name": "[T; N]::map",
2729
- "start": 1442
2730
- },
2731
- {
2732
- "name": "[T; N]::mapi",
2733
- "start": 2002
2734
- },
2735
- {
2736
- "name": "[T; N]::for_each",
2737
- "start": 2549
2738
- },
2739
- {
2740
- "name": "[T; N]::for_eachi",
2741
- "start": 2966
2742
- },
2743
- {
2744
- "name": "[T; N]::fold",
2745
- "start": 3832
2746
- },
2747
- {
2748
- "name": "[T; N]::reduce",
2749
- "start": 4349
2750
- },
2751
- {
2752
- "name": "[T; N]::all",
2753
- "start": 4858
2754
- },
2755
- {
2756
- "name": "[T; N]::any",
2757
- "start": 5330
2758
- },
2759
- {
2760
- "name": "[T; N]::concat",
2761
- "start": 5872
2762
- },
2763
- {
2764
- "name": "[T; N]::sort",
2765
- "start": 6768
2766
- },
2767
- {
2768
- "name": "[T; N]::sort_via",
2769
- "start": 7783
2770
- },
2771
- {
2772
- "name": "[u8; N]::as_str_unchecked",
2773
- "start": 8811
2774
- },
2775
- {
2776
- "name": "<impl From<str<N>> for [u8; N]>::from",
2777
- "start": 8938
2778
- },
2779
- {
2780
- "name": "test::map_empty",
2781
- "start": 9012
2782
- },
2783
- {
2784
- "name": "test::sort_u32",
2785
- "start": 10122
2786
- },
2787
- {
2788
- "name": "test::test_sort",
2789
- "start": 10177
2790
- },
2791
- {
2792
- "name": "test::test_sort_100_values",
2793
- "start": 10408
2794
- },
2795
- {
2796
- "name": "test::test_sort_100_values_comptime",
2797
- "start": 11576
2798
- },
2799
- {
2800
- "name": "test::test_sort_via",
2801
- "start": 11721
2802
- },
2803
- {
2804
- "name": "test::test_sort_via_100_values",
2805
- "start": 11968
2806
- },
2807
- {
2808
- "name": "test::mapi_empty",
2809
- "start": 13129
2810
- },
2811
- {
2812
- "name": "test::for_each_empty",
2813
- "start": 13224
2814
- },
2815
- {
2816
- "name": "test::for_eachi_empty",
2817
- "start": 13362
2818
- },
2819
- {
2820
- "name": "test::map_example",
2821
- "start": 13501
2822
- },
2823
- {
2824
- "name": "test::mapi_example",
2825
- "start": 13638
2826
- },
2827
- {
2828
- "name": "test::for_each_example",
2829
- "start": 13787
2830
- },
2831
- {
2832
- "name": "test::for_eachi_example",
2833
- "start": 14127
2834
- },
2835
- {
2836
- "name": "test::concat",
2837
- "start": 14338
2838
- },
2839
- {
2840
- "name": "test::concat_zero_length_with_something",
2841
- "start": 14597
2842
- },
2843
- {
2844
- "name": "test::concat_something_with_zero_length",
2845
- "start": 14800
2846
- },
2847
- {
2848
- "name": "test::concat_zero_lengths",
2849
- "start": 14989
2850
- }
2851
- ],
2852
- "path": "std/array/mod.nr",
2853
- "source": "use crate::cmp::{Eq, Ord};\nuse crate::convert::From;\nuse crate::runtime::is_unconstrained;\n\nmod check_shuffle;\nmod quicksort;\n\nimpl<T, let N: u32> [T; N] {\n /// Returns the length of this array.\n ///\n /// ```noir\n /// fn len(self) -> Field\n /// ```\n ///\n /// example\n ///\n /// ```noir\n /// fn main() {\n /// let array = [42, 42];\n /// assert(array.len() == 2);\n /// }\n /// ```\n #[builtin(array_len)]\n pub fn len(self) -> u32 {}\n\n /// Returns this array as a vector.\n ///\n /// ```noir\n /// let array = [1, 2];\n /// let vector = array.as_vector();\n /// assert_eq(vector, [1, 2].as_vector());\n /// ```\n #[builtin(as_vector)]\n pub fn as_vector(self) -> [T] {}\n\n /// Returns this array as a vector.\n /// This method is deprecated in favor of `as_vector`.\n ///\n /// ```noir\n /// let array = [1, 2];\n /// let vector = array.as_slice();\n /// assert_eq(vector, [1, 2].as_vector());\n /// ```\n #[builtin(as_vector)]\n #[deprecated(\"This method has been renamed to `as_vector`\")]\n pub fn as_slice(self) -> [T] {}\n\n /// Applies a function to each element of this array, returning a new array containing the mapped elements.\n ///\n /// Example:\n ///\n /// ```rust\n /// let a = [1, 2, 3];\n /// let b = a.map(|a| a * 2);\n /// assert_eq(b, [2, 4, 6]);\n /// ```\n pub fn map<U, Env>(self, f: fn[Env](T) -> U) -> [U; N] {\n let uninitialized = crate::mem::zeroed();\n let mut ret = [uninitialized; N];\n\n for i in 0..self.len() {\n ret[i] = f(self[i]);\n }\n\n ret\n }\n\n /// Applies a function to each element of this array along with its index,\n /// returning a new array containing the mapped elements.\n ///\n /// Example:\n ///\n /// ```rust\n /// let a = [1, 2, 3];\n /// let b = a.mapi(|i, a| i + a * 2);\n /// assert_eq(b, [2, 5, 8]);\n /// ```\n pub fn mapi<U, Env>(self, f: fn[Env](u32, T) -> U) -> [U; N] {\n let uninitialized = crate::mem::zeroed();\n let mut ret = [uninitialized; N];\n\n for i in 0..self.len() {\n ret[i] = f(i, self[i]);\n }\n\n ret\n }\n\n /// Applies a function to each element of this array.\n ///\n /// Example:\n ///\n /// ```rust\n /// let a = [1, 2, 3];\n /// let mut b = [0; 3];\n /// let mut i = 0;\n /// a.for_each(|x| {\n /// b[i] = x;\n /// i += 1;\n /// });\n /// assert_eq(a, b);\n /// ```\n pub fn for_each<Env>(self, f: fn[Env](T) -> ()) {\n for i in 0..self.len() {\n f(self[i]);\n }\n }\n\n /// Applies a function to each element of this array along with its index.\n ///\n /// Example:\n ///\n /// ```rust\n /// let a = [1, 2, 3];\n /// let mut b = [0; 3];\n /// a.for_eachi(|i, x| {\n /// b[i] = x;\n /// });\n /// assert_eq(a, b);\n /// ```\n pub fn for_eachi<Env>(self, f: fn[Env](u32, T) -> ()) {\n for i in 0..self.len() {\n f(i, self[i]);\n }\n }\n\n /// Applies a function to each element of the array, returning the final accumulated value. The first\n /// parameter is the initial value.\n ///\n /// This is a left fold, so the given function will be applied to the accumulator and first element of\n /// the array, then the second, and so on. For a given call the expected result would be equivalent to:\n ///\n /// ```rust\n /// let a1 = [1];\n /// let a2 = [1, 2];\n /// let a3 = [1, 2, 3];\n ///\n /// let f = |a, b| a - b;\n /// a1.fold(10, f); //=> f(10, 1)\n /// a2.fold(10, f); //=> f(f(10, 1), 2)\n /// a3.fold(10, f); //=> f(f(f(10, 1), 2), 3)\n ///\n /// assert_eq(a3.fold(10, f), 10 - 1 - 2 - 3);\n /// ```\n pub fn fold<U, Env>(self, mut accumulator: U, f: fn[Env](U, T) -> U) -> U {\n for elem in self {\n accumulator = f(accumulator, elem);\n }\n accumulator\n }\n\n /// Same as fold, but uses the first element as the starting element.\n ///\n /// Requires the input array to be non-empty.\n ///\n /// Example:\n ///\n /// ```noir\n /// fn main() {\n /// let arr = [1, 2, 3, 4];\n /// let reduced = arr.reduce(|a, b| a + b);\n /// assert(reduced == 10);\n /// }\n /// ```\n pub fn reduce<Env>(self, f: fn[Env](T, T) -> T) -> T {\n let mut accumulator = self[0];\n for i in 1..self.len() {\n accumulator = f(accumulator, self[i]);\n }\n accumulator\n }\n\n /// Returns true if all the elements in this array satisfy the given predicate.\n ///\n /// Example:\n ///\n /// ```noir\n /// fn main() {\n /// let arr = [2, 2, 2, 2, 2];\n /// let all = arr.all(|a| a == 2);\n /// assert(all);\n /// }\n /// ```\n pub fn all<Env>(self, predicate: fn[Env](T) -> bool) -> bool {\n let mut ret = true;\n for elem in self {\n ret &= predicate(elem);\n }\n ret\n }\n\n /// Returns true if any of the elements in this array satisfy the given predicate.\n ///\n /// Example:\n ///\n /// ```noir\n /// fn main() {\n /// let arr = [2, 2, 2, 2, 5];\n /// let any = arr.any(|a| a == 5);\n /// assert(any);\n /// }\n /// ```\n pub fn any<Env>(self, predicate: fn[Env](T) -> bool) -> bool {\n let mut ret = false;\n for elem in self {\n ret |= predicate(elem);\n }\n ret\n }\n\n /// Concatenates this array with another array.\n ///\n /// Example:\n ///\n /// ```noir\n /// fn main() {\n /// let arr1 = [1, 2, 3, 4];\n /// let arr2 = [6, 7, 8, 9, 10, 11];\n /// let concatenated_arr = arr1.concat(arr2);\n /// assert(concatenated_arr == [1, 2, 3, 4, 6, 7, 8, 9, 10, 11]);\n /// }\n /// ```\n pub fn concat<let M: u32>(self, array2: [T; M]) -> [T; N + M] {\n let mut result = [crate::mem::zeroed(); N + M];\n for i in 0..N {\n result[i] = self[i];\n }\n for i in 0..M {\n result[i + N] = array2[i];\n }\n result\n }\n}\n\nimpl<T, let N: u32> [T; N]\nwhere\n T: Ord + Eq,\n{\n /// Returns a new sorted array. The original array remains untouched. Notice that this function will\n /// only work for arrays of fields or integers, not for any arbitrary type. This is because the sorting\n /// logic it uses internally is optimized specifically for these values. If you need a sort function to\n /// sort any type, you should use the [`Self::sort_via`] function.\n ///\n /// Example:\n ///\n /// ```rust\n /// fn main() {\n /// let arr = [42, 32];\n /// let sorted = arr.sort();\n /// assert(sorted == [32, 42]);\n /// }\n /// ```\n pub fn sort(self) -> Self {\n self.sort_via(|a, b| a <= b)\n }\n}\n\nimpl<T, let N: u32> [T; N]\nwhere\n T: Eq,\n{\n /// Returns a new sorted array by sorting it with a custom comparison function.\n /// The original array remains untouched.\n /// The ordering function must return true if the first argument should be sorted to be before the second argument or is equal to the second argument.\n ///\n /// Using this method with an operator like `<` that does not return `true` for equal values will result in an assertion failure for arrays with equal elements.\n ///\n /// Example:\n ///\n /// ```rust\n /// fn main() {\n /// let arr = [42, 32]\n /// let sorted_ascending = arr.sort_via(|a, b| a <= b);\n /// assert(sorted_ascending == [32, 42]); // verifies\n ///\n /// let sorted_descending = arr.sort_via(|a, b| a >= b);\n /// assert(sorted_descending == [32, 42]); // does not verify\n /// }\n /// ```\n pub fn sort_via<Env>(self, ordering: fn[Env](T, T) -> bool) -> Self {\n // 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 }\n}\n\nimpl<let N: u32> [u8; N] {\n /// Converts a byte array of type `[u8; N]` to a string. Note that this performs no UTF-8 validation -\n /// the given array is interpreted as-is as a string.\n ///\n /// Example:\n ///\n /// ```rust\n /// fn main() {\n /// let hi = [104, 105].as_str_unchecked();\n /// assert_eq(hi, \"hi\");\n /// }\n /// ```\n #[builtin(array_as_str_unchecked)]\n pub fn as_str_unchecked(self) -> str<N> {}\n}\n\nimpl<let N: u32> From<str<N>> for [u8; N] {\n /// Returns an array of the string bytes.\n fn from(s: str<N>) -> Self {\n s.as_bytes()\n }\n}\n\nmod test {\n #[test]\n fn map_empty() {\n assert_eq([].map(|x| x + 1), []);\n }\n\n global arr_with_100_values: [u32; 100] = [\n 42, 123, 87, 93, 48, 80, 50, 5, 104, 84, 70, 47, 119, 66, 71, 121, 3, 29, 42, 118, 2, 54,\n 89, 44, 81, 0, 26, 106, 68, 96, 84, 48, 95, 54, 45, 32, 89, 100, 109, 19, 37, 41, 19, 98,\n 53, 114, 107, 66, 6, 74, 13, 19, 105, 64, 123, 28, 44, 50, 89, 58, 123, 126, 21, 43, 86, 35,\n 21, 62, 82, 0, 108, 120, 72, 72, 62, 80, 12, 71, 70, 86, 116, 73, 38, 15, 127, 81, 30, 8,\n 125, 28, 26, 69, 114, 63, 27, 28, 61, 42, 13, 32,\n ];\n global expected_with_100_values: [u32; 100] = [\n 0, 0, 2, 3, 5, 6, 8, 12, 13, 13, 15, 19, 19, 19, 21, 21, 26, 26, 27, 28, 28, 28, 29, 30, 32,\n 32, 35, 37, 38, 41, 42, 42, 42, 43, 44, 44, 45, 47, 48, 48, 50, 50, 53, 54, 54, 58, 61, 62,\n 62, 63, 64, 66, 66, 68, 69, 70, 70, 71, 71, 72, 72, 73, 74, 80, 80, 81, 81, 82, 84, 84, 86,\n 86, 87, 89, 89, 89, 93, 95, 96, 98, 100, 104, 105, 106, 107, 108, 109, 114, 114, 116, 118,\n 119, 120, 121, 123, 123, 123, 125, 126, 127,\n ];\n fn sort_u32(a: u32, b: u32) -> bool {\n a <= b\n }\n\n #[test]\n fn test_sort() {\n let arr: [u32; 7] = [3, 6, 8, 10, 1, 2, 1];\n\n let sorted = arr.sort();\n\n let expected: [u32; 7] = [1, 1, 2, 3, 6, 8, 10];\n assert(sorted == expected);\n }\n\n #[test]\n fn test_sort_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"
2854
- },
2855
- "358": {
2399
+ "357": {
2856
2400
  "function_locations": [
2857
2401
  {
2858
2402
  "name": "sha256_to_field",
@@ -2886,91 +2430,95 @@
2886
2430
  "name": "create_protocol_nullifier",
2887
2431
  "start": 6116
2888
2432
  },
2433
+ {
2434
+ "name": "compute_log_tag",
2435
+ "start": 6480
2436
+ },
2889
2437
  {
2890
2438
  "name": "compute_siloed_private_log_first_field",
2891
- "start": 6530
2439
+ "start": 6651
2892
2440
  },
2893
2441
  {
2894
2442
  "name": "compute_siloed_private_log",
2895
- "start": 6761
2443
+ "start": 6882
2896
2444
  },
2897
2445
  {
2898
2446
  "name": "compute_contract_class_log_hash",
2899
- "start": 7021
2447
+ "start": 7142
2900
2448
  },
2901
2449
  {
2902
2450
  "name": "compute_app_siloed_secret_key",
2903
- "start": 7212
2451
+ "start": 7333
2904
2452
  },
2905
2453
  {
2906
2454
  "name": "compute_l2_to_l1_message_hash",
2907
- "start": 7507
2455
+ "start": 7628
2908
2456
  },
2909
2457
  {
2910
2458
  "name": "accumulate_sha256",
2911
- "start": 8588
2459
+ "start": 8709
2912
2460
  },
2913
2461
  {
2914
2462
  "name": "poseidon2_hash",
2915
- "start": 8916
2463
+ "start": 9037
2916
2464
  },
2917
2465
  {
2918
2466
  "name": "poseidon2_hash_with_separator",
2919
- "start": 9107
2467
+ "start": 9228
2920
2468
  },
2921
2469
  {
2922
2470
  "name": "poseidon2_hash_subarray",
2923
- "start": 9593
2471
+ "start": 9714
2924
2472
  },
2925
2473
  {
2926
2474
  "name": "poseidon2_hash_with_separator_bounded_vec",
2927
- "start": 10005
2475
+ "start": 10126
2928
2476
  },
2929
2477
  {
2930
2478
  "name": "poseidon2_hash_bytes",
2931
- "start": 10366
2479
+ "start": 10487
2932
2480
  },
2933
2481
  {
2934
2482
  "name": "subarray_hash_matches_fixed",
2935
- "start": 10942
2483
+ "start": 11063
2936
2484
  },
2937
2485
  {
2938
2486
  "name": "subarray_hash_matches_variable",
2939
- "start": 11341
2487
+ "start": 11462
2940
2488
  },
2941
2489
  {
2942
2490
  "name": "smoke_sha256_to_field",
2943
- "start": 11757
2491
+ "start": 11878
2944
2492
  },
2945
2493
  {
2946
2494
  "name": "unique_siloed_note_hash_matches_typescript",
2947
- "start": 13159
2495
+ "start": 13280
2948
2496
  },
2949
2497
  {
2950
2498
  "name": "siloed_nullifier_matches_typescript",
2951
- "start": 14381
2499
+ "start": 14502
2952
2500
  },
2953
2501
  {
2954
2502
  "name": "siloed_private_log_first_field_matches_typescript",
2955
- "start": 14761
2503
+ "start": 14882
2956
2504
  },
2957
2505
  {
2958
2506
  "name": "empty_l2_to_l1_message_hash_matches_typescript",
2959
- "start": 15171
2507
+ "start": 15292
2960
2508
  },
2961
2509
  {
2962
2510
  "name": "l2_to_l1_message_hash_matches_typescript",
2963
- "start": 15622
2511
+ "start": 15743
2964
2512
  },
2965
2513
  {
2966
2514
  "name": "poseidon2_hash_with_separator_bounded_vec_matches_non_bounded_vec_version",
2967
- "start": 16238
2515
+ "start": 16359
2968
2516
  }
2969
2517
  ],
2970
2518
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/hash.nr",
2971
- "source": "mod poseidon2_chunks;\n\nuse crate::{\n abis::{\n contract_class_function_leaf_preimage::ContractClassFunctionLeafPreimage,\n function_selector::FunctionSelector, nullifier::Nullifier, private_log::PrivateLog,\n transaction::tx_request::TxRequest,\n },\n address::{AztecAddress, EthAddress},\n constants::{\n CONTRACT_CLASS_LOG_SIZE_IN_FIELDS, DOM_SEP__NOTE_HASH_NONCE,\n DOM_SEP__PRIVATE_LOG_FIRST_FIELD, DOM_SEP__SILOED_NOTE_HASH, DOM_SEP__SILOED_NULLIFIER,\n DOM_SEP__UNIQUE_NOTE_HASH, FUNCTION_TREE_HEIGHT, NULL_MSG_SENDER_CONTRACT_ADDRESS,\n TWO_POW_64,\n },\n merkle_tree::root_from_sibling_path,\n messaging::l2_to_l1_message::L2ToL1Message,\n poseidon2::Poseidon2Sponge,\n side_effect::{Counted, Scoped},\n traits::{FromField, Hash, ToField},\n utils::field::{field_from_bytes, field_from_bytes_32_trunc},\n};\n\npub use poseidon2_chunks::poseidon2_absorb_in_chunks_existing_sponge;\nuse poseidon2_chunks::poseidon2_absorb_in_chunks;\nuse std::embedded_curve_ops::EmbeddedCurveScalar;\n\n// TODO: refactor these into their own files: sha256, poseidon2, some protocol-specific hash computations, some merkle computations.\n\npub fn sha256_to_field<let N: u32>(bytes_to_hash: [u8; N]) -> Field {\n let sha256_hashed = sha256::digest(bytes_to_hash);\n let hash_in_a_field = field_from_bytes_32_trunc(sha256_hashed);\n\n hash_in_a_field\n}\n\npub fn private_functions_root_from_siblings(\n selector: FunctionSelector,\n vk_hash: Field,\n function_leaf_index: Field,\n function_leaf_sibling_path: [Field; FUNCTION_TREE_HEIGHT],\n) -> Field {\n let function_leaf_preimage = ContractClassFunctionLeafPreimage { selector, vk_hash };\n let function_leaf = function_leaf_preimage.hash();\n root_from_sibling_path(\n function_leaf,\n function_leaf_index,\n function_leaf_sibling_path,\n )\n}\n\n/// Siloing in the context of Aztec refers to the process of hashing a note hash with a contract address (this way\n/// the note hash is scoped to a specific contract). This is used to prevent intermingling of notes between contracts.\npub fn compute_siloed_note_hash(contract_address: AztecAddress, note_hash: Field) -> Field {\n poseidon2_hash_with_separator(\n [contract_address.to_field(), note_hash],\n DOM_SEP__SILOED_NOTE_HASH,\n )\n}\n\n/// Computes unique, siloed note hashes from siloed note hashes.\n///\n/// The protocol injects uniqueness into every note_hash, so that every single note_hash in the\n/// tree is unique. This prevents faerie gold attacks, where a malicious sender could create\n/// two identical note_hashes for a recipient (meaning only one would be nullifiable in future).\n///\n/// Most privacy protocols will inject the note's leaf_index (its position in the Note Hashes Tree)\n/// into the note, but this requires the creator of a note to wait until their tx is included in\n/// a block to know the note's final note hash (the unique, siloed note hash), because inserting\n/// leaves into trees is the job of a block producer.\n///\n/// We took a different approach so that the creator of a note will know each note's unique, siloed\n/// note hash before broadcasting their tx to the network.\n/// (There was also a historical requirement relating to \"chained transactions\" -- a feature that\n/// Aztec Connect had to enable notes to be spent from distinct txs earlier in the same block,\n/// and hence before an archive block root had been established for that block -- but that feature\n/// was abandoned for the Aztec Network for having too many bad tradeoffs).\n///\n/// (\n/// Edit: it is no longer true that all final note_hashes will be known by the creator of a tx\n/// before they send it to the network. If a tx makes public function calls, then _revertible_\n/// note_hashes that are created in private will not be made unique in private by the Reset circuit,\n/// but will instead be made unique by the AVM, because the `note_index_in_tx` will not be known\n/// until the AVM has executed the public functions of the tx. (See an explanation in\n/// reset_output_composer.nr for why).\n/// For some such txs, the `note_index_in_tx` might still be predictable through simulation, but\n/// for txs whose public functions create a varying number of non-revertible notes (determined at\n/// runtime), the `note_index_in_tx` will not be deterministically derivable before submitting the\n/// tx to the network.\n/// )\n///\n/// We use the `first_nullifier` of a tx as a seed of uniqueness. We have a guarantee that there will\n/// always be at least one nullifier per tx, because the init circuit will create one if one isn't\n/// created naturally by any functions of the tx. (Search \"protocol_nullifier\").\n/// We combine the `first_nullifier` with the note's index (its position within this tx's new\n/// note_hashes array) (`note_index_in_tx`) to get a truly unique value to inject into a note, which\n/// we call a `note_nonce`.\npub fn compute_unique_note_hash(note_nonce: Field, siloed_note_hash: Field) -> Field {\n let inputs = [note_nonce, siloed_note_hash];\n poseidon2_hash_with_separator(inputs, DOM_SEP__UNIQUE_NOTE_HASH)\n}\n\npub fn compute_note_hash_nonce(first_nullifier_in_tx: Field, note_index_in_tx: u32) -> Field {\n // Hashing the first nullifier with note index in tx is guaranteed to be unique (because all nullifiers are also\n // unique).\n poseidon2_hash_with_separator(\n [first_nullifier_in_tx, note_index_in_tx as Field],\n DOM_SEP__NOTE_HASH_NONCE,\n )\n}\n\npub fn compute_note_nonce_and_unique_note_hash(\n siloed_note_hash: Field,\n first_nullifier: Field,\n note_index_in_tx: u32,\n) -> Field {\n let note_nonce = compute_note_hash_nonce(first_nullifier, note_index_in_tx);\n compute_unique_note_hash(note_nonce, siloed_note_hash)\n}\n\npub fn compute_siloed_nullifier(contract_address: AztecAddress, nullifier: Field) -> Field {\n poseidon2_hash_with_separator(\n [contract_address.to_field(), nullifier],\n DOM_SEP__SILOED_NULLIFIER,\n )\n}\n\npub fn create_protocol_nullifier(tx_request: TxRequest) -> Scoped<Counted<Nullifier>> {\n // The protocol nullifier is ascribed a special side-effect counter of 1. No other side-effect\n // can have counter 1 (see `validate_as_first_call` for that assertion).\n Nullifier { value: tx_request.hash(), note_hash: 0 }.count(1).scope(\n NULL_MSG_SENDER_CONTRACT_ADDRESS,\n )\n}\n\npub fn compute_siloed_private_log_first_field(\n contract_address: AztecAddress,\n field: Field,\n) -> Field {\n poseidon2_hash_with_separator(\n [contract_address.to_field(), field],\n DOM_SEP__PRIVATE_LOG_FIRST_FIELD,\n )\n}\n\npub fn compute_siloed_private_log(contract_address: AztecAddress, log: PrivateLog) -> PrivateLog {\n let mut fields = log.fields;\n fields[0] = compute_siloed_private_log_first_field(contract_address, fields[0]);\n PrivateLog::new(fields, log.length)\n}\n\npub fn compute_contract_class_log_hash(log: [Field; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS]) -> Field {\n poseidon2_hash(log)\n}\n\npub fn compute_app_siloed_secret_key(\n master_secret_key: EmbeddedCurveScalar,\n app_address: AztecAddress,\n key_type_domain_separator: Field,\n) -> Field {\n poseidon2_hash_with_separator(\n [master_secret_key.hi, master_secret_key.lo, app_address.to_field()],\n key_type_domain_separator,\n )\n}\n\npub fn compute_l2_to_l1_message_hash(\n message: Scoped<L2ToL1Message>,\n rollup_version_id: Field,\n chain_id: Field,\n) -> Field {\n let contract_address_bytes: [u8; 32] = message.contract_address.to_field().to_be_bytes();\n let recipient_bytes: [u8; 20] = message.inner.recipient.to_be_bytes();\n let content_bytes: [u8; 32] = message.inner.content.to_be_bytes();\n let rollup_version_id_bytes: [u8; 32] = rollup_version_id.to_be_bytes();\n let chain_id_bytes: [u8; 32] = chain_id.to_be_bytes();\n\n let mut bytes: [u8; 148] = std::mem::zeroed();\n for i in 0..32 {\n bytes[i] = contract_address_bytes[i];\n bytes[i + 32] = rollup_version_id_bytes[i];\n // 64 - 84 are for recipient.\n bytes[i + 84] = chain_id_bytes[i];\n bytes[i + 116] = content_bytes[i];\n }\n\n for i in 0..20 {\n bytes[64 + i] = recipient_bytes[i];\n }\n\n sha256_to_field(bytes)\n}\n\n// TODO: consider a variant that enables domain separation with a u32 (we seem to have standardised u32s for domain separators)\n/// Computes sha256 hash of 2 input fields.\n///\n/// @returns A truncated field (i.e., the first byte is always 0).\npub fn accumulate_sha256(v0: Field, v1: Field) -> Field {\n // Concatenate two fields into 32 x 2 = 64 bytes\n let v0_as_bytes: [u8; 32] = v0.to_be_bytes();\n let v1_as_bytes: [u8; 32] = v1.to_be_bytes();\n let hash_input_flattened = v0_as_bytes.concat(v1_as_bytes);\n\n sha256_to_field(hash_input_flattened)\n}\n\npub fn poseidon2_hash<let N: u32>(inputs: [Field; N]) -> Field {\n poseidon::poseidon2::Poseidon2::hash(inputs, N)\n}\n\n#[no_predicates]\npub fn poseidon2_hash_with_separator<let N: u32, T>(inputs: [Field; N], separator: T) -> Field\nwhere\n T: ToField,\n{\n let inputs_with_separator = [separator.to_field()].concat(inputs);\n poseidon2_hash(inputs_with_separator)\n}\n\n/// Computes a Poseidon2 hash over a dynamic-length subarray of the given input.\n/// Only the first `in_len` fields of `input` are absorbed; any remaining fields are ignored.\n/// The caller is responsible for ensuring that the input is padded with zeros if required.\n#[no_predicates]\npub fn poseidon2_hash_subarray<let N: u32>(input: [Field; N], in_len: u32) -> Field {\n let mut sponge = poseidon2_absorb_in_chunks(input, in_len);\n sponge.squeeze()\n}\n\n// This function is unconstrained because it is intended to be used in unconstrained context only as\n// in constrained contexts it would be too inefficient.\npub unconstrained fn poseidon2_hash_with_separator_bounded_vec<let N: u32, T>(\n inputs: BoundedVec<Field, N>,\n separator: T,\n) -> Field\nwhere\n T: ToField,\n{\n let in_len = inputs.len() + 1;\n let iv: Field = (in_len as Field) * TWO_POW_64;\n let mut sponge = Poseidon2Sponge::new(iv);\n sponge.absorb(separator.to_field());\n\n for i in 0..inputs.len() {\n sponge.absorb(inputs.get(i));\n }\n\n sponge.squeeze()\n}\n\n#[no_predicates]\npub fn poseidon2_hash_bytes<let N: u32>(inputs: [u8; N]) -> Field {\n let mut fields = [0; (N + 30) / 31];\n let mut field_index = 0;\n let mut current_field = [0; 31];\n for i in 0..inputs.len() {\n let index = i % 31;\n current_field[index] = inputs[i];\n if index == 30 {\n fields[field_index] = field_from_bytes(current_field, false);\n current_field = [0; 31];\n field_index += 1;\n }\n }\n if field_index != fields.len() {\n fields[field_index] = field_from_bytes(current_field, false);\n }\n poseidon2_hash(fields)\n}\n\n#[test]\nfn subarray_hash_matches_fixed() {\n let values_to_hash = [3; 17];\n let padded = values_to_hash.concat([0; 11]);\n let subarray_hash = poseidon2_hash_subarray(padded, values_to_hash.len());\n\n // Hash the entire values_to_hash.\n let fixed_len_hash = poseidon::poseidon2::Poseidon2::hash(values_to_hash, values_to_hash.len());\n\n assert_eq(subarray_hash, fixed_len_hash);\n}\n\n#[test]\nfn subarray_hash_matches_variable() {\n let values_to_hash = [3; 17];\n let padded = values_to_hash.concat([0; 11]);\n let subarray_hash = poseidon2_hash_subarray(padded, values_to_hash.len());\n\n // Hash up to values_to_hash.len() fields of the padded array.\n let variable_len_hash = poseidon::poseidon2::Poseidon2::hash(padded, values_to_hash.len());\n\n assert_eq(subarray_hash, variable_len_hash);\n}\n\n#[test]\nfn smoke_sha256_to_field() {\n let full_buffer = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47,\n 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70,\n 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93,\n 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112,\n 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130,\n 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148,\n 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159,\n ];\n let result = sha256_to_field(full_buffer);\n\n assert(result == 0x448ebbc9e1a31220a2f3830c18eef61b9bd070e5084b7fa2a359fe729184c7);\n\n // to show correctness of the current ver (truncate one byte) vs old ver (mod full bytes):\n let result_bytes = sha256::digest(full_buffer);\n let truncated_field = crate::utils::field::field_from_bytes_32_trunc(result_bytes);\n assert(truncated_field == result);\n let mod_res = result + (result_bytes[31] as Field);\n assert(mod_res == 0x448ebbc9e1a31220a2f3830c18eef61b9bd070e5084b7fa2a359fe729184e0);\n}\n\n#[test]\nfn unique_siloed_note_hash_matches_typescript() {\n let inner_note_hash = 1;\n let contract_address = AztecAddress::from_field(2);\n let first_nullifier = 3;\n let note_index_in_tx = 4;\n\n let siloed_note_hash = compute_siloed_note_hash(contract_address, inner_note_hash);\n let siloed_note_hash_from_ts =\n 0x1986a4bea3eddb1fff917d629a13e10f63f514f401bdd61838c6b475db949169;\n assert_eq(siloed_note_hash, siloed_note_hash_from_ts);\n\n let nonce: Field = compute_note_hash_nonce(first_nullifier, note_index_in_tx);\n let note_hash_nonce_from_ts =\n 0x28e7799791bf066a57bb51fdd0fbcaf3f0926414314c7db515ea343f44f5d58b;\n assert_eq(nonce, note_hash_nonce_from_ts);\n\n let unique_siloed_note_hash_from_nonce = compute_unique_note_hash(nonce, siloed_note_hash);\n let unique_siloed_note_hash = compute_note_nonce_and_unique_note_hash(\n siloed_note_hash,\n first_nullifier,\n note_index_in_tx,\n );\n assert_eq(unique_siloed_note_hash_from_nonce, unique_siloed_note_hash);\n\n let unique_siloed_note_hash_from_ts =\n 0x29949aef207b715303b24639737c17fbfeb375c1d965ecfa85c7e4f0febb7d16;\n assert_eq(unique_siloed_note_hash, unique_siloed_note_hash_from_ts);\n}\n\n#[test]\nfn siloed_nullifier_matches_typescript() {\n let contract_address = AztecAddress::from_field(123);\n let nullifier = 456;\n\n let res = compute_siloed_nullifier(contract_address, nullifier);\n\n let siloed_nullifier_from_ts =\n 0x169b50336c1f29afdb8a03d955a81e485f5ac7d5f0b8065673d1e407e5877813;\n\n assert_eq(res, siloed_nullifier_from_ts);\n}\n\n#[test]\nfn siloed_private_log_first_field_matches_typescript() {\n let contract_address = AztecAddress::from_field(123);\n let field = 456;\n let res = compute_siloed_private_log_first_field(contract_address, field);\n\n let siloed_private_log_first_field_from_ts =\n 0x29480984f7b9257fded523d50addbcfc8d1d33adcf2db73ef3390a8fd5cdffaa;\n\n assert_eq(res, siloed_private_log_first_field_from_ts);\n}\n\n#[test]\nfn empty_l2_to_l1_message_hash_matches_typescript() {\n // All zeroes\n let res = compute_l2_to_l1_message_hash(\n L2ToL1Message { recipient: EthAddress::zero(), content: 0 }.scope(AztecAddress::from_field(\n 0,\n )),\n 0,\n 0,\n );\n\n let empty_l2_to_l1_msg_hash_from_ts =\n 0x003b18c58c739716e76429634a61375c45b3b5cd470c22ab6d3e14cee23dd992;\n\n assert_eq(res, empty_l2_to_l1_msg_hash_from_ts);\n}\n\n#[test]\nfn l2_to_l1_message_hash_matches_typescript() {\n let message = L2ToL1Message { recipient: EthAddress::from_field(1), content: 2 }.scope(\n AztecAddress::from_field(3),\n );\n let version = 4;\n let chainId = 5;\n\n let hash = compute_l2_to_l1_message_hash(message, version, chainId);\n\n // The following value was generated by `yarn-project/stdlib/src/hash/hash.test.ts`\n let l2_to_l1_message_hash_from_ts =\n 0x0081edf209e087ad31b3fd24263698723d57190bd1d6e9fe056fc0c0a68ee661;\n\n assert_eq(hash, l2_to_l1_message_hash_from_ts);\n}\n\n#[test]\nunconstrained fn poseidon2_hash_with_separator_bounded_vec_matches_non_bounded_vec_version() {\n let inputs = BoundedVec::<Field, 4>::from_array([1, 2, 3]);\n let separator = 42;\n\n // Hash using bounded vec version\n let bounded_result = poseidon2_hash_with_separator_bounded_vec(inputs, separator);\n\n // Hash using regular version\n let regular_result = poseidon2_hash_with_separator([1, 2, 3], separator);\n\n // Results should match\n assert_eq(bounded_result, regular_result);\n}\n"
2519
+ "source": "mod poseidon2_chunks;\n\nuse crate::{\n abis::{\n contract_class_function_leaf_preimage::ContractClassFunctionLeafPreimage,\n function_selector::FunctionSelector, nullifier::Nullifier, private_log::PrivateLog,\n transaction::tx_request::TxRequest,\n },\n address::{AztecAddress, EthAddress},\n constants::{\n CONTRACT_CLASS_LOG_SIZE_IN_FIELDS, DOM_SEP__NOTE_HASH_NONCE,\n DOM_SEP__PRIVATE_LOG_FIRST_FIELD, DOM_SEP__SILOED_NOTE_HASH, DOM_SEP__SILOED_NULLIFIER,\n DOM_SEP__UNIQUE_NOTE_HASH, FUNCTION_TREE_HEIGHT, NULL_MSG_SENDER_CONTRACT_ADDRESS,\n TWO_POW_64,\n },\n merkle_tree::root_from_sibling_path,\n messaging::l2_to_l1_message::L2ToL1Message,\n poseidon2::Poseidon2Sponge,\n side_effect::{Counted, Scoped},\n traits::{FromField, Hash, ToField},\n utils::field::{field_from_bytes, field_from_bytes_32_trunc},\n};\n\npub use poseidon2_chunks::poseidon2_absorb_in_chunks_existing_sponge;\nuse poseidon2_chunks::poseidon2_absorb_in_chunks;\nuse std::embedded_curve_ops::EmbeddedCurveScalar;\n\n// TODO: refactor these into their own files: sha256, poseidon2, some protocol-specific hash computations, some merkle computations.\n\npub fn sha256_to_field<let N: u32>(bytes_to_hash: [u8; N]) -> Field {\n let sha256_hashed = sha256::digest(bytes_to_hash);\n let hash_in_a_field = field_from_bytes_32_trunc(sha256_hashed);\n\n hash_in_a_field\n}\n\npub fn private_functions_root_from_siblings(\n selector: FunctionSelector,\n vk_hash: Field,\n function_leaf_index: Field,\n function_leaf_sibling_path: [Field; FUNCTION_TREE_HEIGHT],\n) -> Field {\n let function_leaf_preimage = ContractClassFunctionLeafPreimage { selector, vk_hash };\n let function_leaf = function_leaf_preimage.hash();\n root_from_sibling_path(\n function_leaf,\n function_leaf_index,\n function_leaf_sibling_path,\n )\n}\n\n/// Siloing in the context of Aztec refers to the process of hashing a note hash with a contract address (this way\n/// the note hash is scoped to a specific contract). This is used to prevent intermingling of notes between contracts.\npub fn compute_siloed_note_hash(contract_address: AztecAddress, note_hash: Field) -> Field {\n poseidon2_hash_with_separator(\n [contract_address.to_field(), note_hash],\n DOM_SEP__SILOED_NOTE_HASH,\n )\n}\n\n/// Computes unique, siloed note hashes from siloed note hashes.\n///\n/// The protocol injects uniqueness into every note_hash, so that every single note_hash in the\n/// tree is unique. This prevents faerie gold attacks, where a malicious sender could create\n/// two identical note_hashes for a recipient (meaning only one would be nullifiable in future).\n///\n/// Most privacy protocols will inject the note's leaf_index (its position in the Note Hashes Tree)\n/// into the note, but this requires the creator of a note to wait until their tx is included in\n/// a block to know the note's final note hash (the unique, siloed note hash), because inserting\n/// leaves into trees is the job of a block producer.\n///\n/// We took a different approach so that the creator of a note will know each note's unique, siloed\n/// note hash before broadcasting their tx to the network.\n/// (There was also a historical requirement relating to \"chained transactions\" -- a feature that\n/// Aztec Connect had to enable notes to be spent from distinct txs earlier in the same block,\n/// and hence before an archive block root had been established for that block -- but that feature\n/// was abandoned for the Aztec Network for having too many bad tradeoffs).\n///\n/// (\n/// Edit: it is no longer true that all final note_hashes will be known by the creator of a tx\n/// before they send it to the network. If a tx makes public function calls, then _revertible_\n/// note_hashes that are created in private will not be made unique in private by the Reset circuit,\n/// but will instead be made unique by the AVM, because the `note_index_in_tx` will not be known\n/// until the AVM has executed the public functions of the tx. (See an explanation in\n/// reset_output_composer.nr for why).\n/// For some such txs, the `note_index_in_tx` might still be predictable through simulation, but\n/// for txs whose public functions create a varying number of non-revertible notes (determined at\n/// runtime), the `note_index_in_tx` will not be deterministically derivable before submitting the\n/// tx to the network.\n/// )\n///\n/// We use the `first_nullifier` of a tx as a seed of uniqueness. We have a guarantee that there will\n/// always be at least one nullifier per tx, because the init circuit will create one if one isn't\n/// created naturally by any functions of the tx. (Search \"protocol_nullifier\").\n/// We combine the `first_nullifier` with the note's index (its position within this tx's new\n/// note_hashes array) (`note_index_in_tx`) to get a truly unique value to inject into a note, which\n/// we call a `note_nonce`.\npub fn compute_unique_note_hash(note_nonce: Field, siloed_note_hash: Field) -> Field {\n let inputs = [note_nonce, siloed_note_hash];\n poseidon2_hash_with_separator(inputs, DOM_SEP__UNIQUE_NOTE_HASH)\n}\n\npub fn compute_note_hash_nonce(first_nullifier_in_tx: Field, note_index_in_tx: u32) -> Field {\n // Hashing the first nullifier with note index in tx is guaranteed to be unique (because all nullifiers are also\n // unique).\n poseidon2_hash_with_separator(\n [first_nullifier_in_tx, note_index_in_tx as Field],\n DOM_SEP__NOTE_HASH_NONCE,\n )\n}\n\npub fn compute_note_nonce_and_unique_note_hash(\n siloed_note_hash: Field,\n first_nullifier: Field,\n note_index_in_tx: u32,\n) -> Field {\n let note_nonce = compute_note_hash_nonce(first_nullifier, note_index_in_tx);\n compute_unique_note_hash(note_nonce, siloed_note_hash)\n}\n\npub fn compute_siloed_nullifier(contract_address: AztecAddress, nullifier: Field) -> Field {\n poseidon2_hash_with_separator(\n [contract_address.to_field(), nullifier],\n DOM_SEP__SILOED_NULLIFIER,\n )\n}\n\npub fn create_protocol_nullifier(tx_request: TxRequest) -> Scoped<Counted<Nullifier>> {\n // The protocol nullifier is ascribed a special side-effect counter of 1. No other side-effect\n // can have counter 1 (see `validate_as_first_call` for that assertion).\n Nullifier { value: tx_request.hash(), note_hash: 0 }.count(1).scope(\n NULL_MSG_SENDER_CONTRACT_ADDRESS,\n )\n}\n\npub fn compute_log_tag(raw_tag: Field, dom_sep: u32) -> Field {\n poseidon2_hash_with_separator([raw_tag], dom_sep)\n}\n\npub fn compute_siloed_private_log_first_field(\n contract_address: AztecAddress,\n field: Field,\n) -> Field {\n poseidon2_hash_with_separator(\n [contract_address.to_field(), field],\n DOM_SEP__PRIVATE_LOG_FIRST_FIELD,\n )\n}\n\npub fn compute_siloed_private_log(contract_address: AztecAddress, log: PrivateLog) -> PrivateLog {\n let mut fields = log.fields;\n fields[0] = compute_siloed_private_log_first_field(contract_address, fields[0]);\n PrivateLog::new(fields, log.length)\n}\n\npub fn compute_contract_class_log_hash(log: [Field; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS]) -> Field {\n poseidon2_hash(log)\n}\n\npub fn compute_app_siloed_secret_key(\n master_secret_key: EmbeddedCurveScalar,\n app_address: AztecAddress,\n key_type_domain_separator: Field,\n) -> Field {\n poseidon2_hash_with_separator(\n [master_secret_key.hi, master_secret_key.lo, app_address.to_field()],\n key_type_domain_separator,\n )\n}\n\npub fn compute_l2_to_l1_message_hash(\n message: Scoped<L2ToL1Message>,\n rollup_version_id: Field,\n chain_id: Field,\n) -> Field {\n let contract_address_bytes: [u8; 32] = message.contract_address.to_field().to_be_bytes();\n let recipient_bytes: [u8; 20] = message.inner.recipient.to_be_bytes();\n let content_bytes: [u8; 32] = message.inner.content.to_be_bytes();\n let rollup_version_id_bytes: [u8; 32] = rollup_version_id.to_be_bytes();\n let chain_id_bytes: [u8; 32] = chain_id.to_be_bytes();\n\n let mut bytes: [u8; 148] = std::mem::zeroed();\n for i in 0..32 {\n bytes[i] = contract_address_bytes[i];\n bytes[i + 32] = rollup_version_id_bytes[i];\n // 64 - 84 are for recipient.\n bytes[i + 84] = chain_id_bytes[i];\n bytes[i + 116] = content_bytes[i];\n }\n\n for i in 0..20 {\n bytes[64 + i] = recipient_bytes[i];\n }\n\n sha256_to_field(bytes)\n}\n\n// TODO: consider a variant that enables domain separation with a u32 (we seem to have standardised u32s for domain separators)\n/// Computes sha256 hash of 2 input fields.\n///\n/// @returns A truncated field (i.e., the first byte is always 0).\npub fn accumulate_sha256(v0: Field, v1: Field) -> Field {\n // Concatenate two fields into 32 x 2 = 64 bytes\n let v0_as_bytes: [u8; 32] = v0.to_be_bytes();\n let v1_as_bytes: [u8; 32] = v1.to_be_bytes();\n let hash_input_flattened = v0_as_bytes.concat(v1_as_bytes);\n\n sha256_to_field(hash_input_flattened)\n}\n\npub fn poseidon2_hash<let N: u32>(inputs: [Field; N]) -> Field {\n poseidon::poseidon2::Poseidon2::hash(inputs, N)\n}\n\n#[no_predicates]\npub fn poseidon2_hash_with_separator<let N: u32, T>(inputs: [Field; N], separator: T) -> Field\nwhere\n T: ToField,\n{\n let inputs_with_separator = [separator.to_field()].concat(inputs);\n poseidon2_hash(inputs_with_separator)\n}\n\n/// Computes a Poseidon2 hash over a dynamic-length subarray of the given input.\n/// Only the first `in_len` fields of `input` are absorbed; any remaining fields are ignored.\n/// The caller is responsible for ensuring that the input is padded with zeros if required.\n#[no_predicates]\npub fn poseidon2_hash_subarray<let N: u32>(input: [Field; N], in_len: u32) -> Field {\n let mut sponge = poseidon2_absorb_in_chunks(input, in_len);\n sponge.squeeze()\n}\n\n// This function is unconstrained because it is intended to be used in unconstrained context only as\n// in constrained contexts it would be too inefficient.\npub unconstrained fn poseidon2_hash_with_separator_bounded_vec<let N: u32, T>(\n inputs: BoundedVec<Field, N>,\n separator: T,\n) -> Field\nwhere\n T: ToField,\n{\n let in_len = inputs.len() + 1;\n let iv: Field = (in_len as Field) * TWO_POW_64;\n let mut sponge = Poseidon2Sponge::new(iv);\n sponge.absorb(separator.to_field());\n\n for i in 0..inputs.len() {\n sponge.absorb(inputs.get(i));\n }\n\n sponge.squeeze()\n}\n\n#[no_predicates]\npub fn poseidon2_hash_bytes<let N: u32>(inputs: [u8; N]) -> Field {\n let mut fields = [0; (N + 30) / 31];\n let mut field_index = 0;\n let mut current_field = [0; 31];\n for i in 0..inputs.len() {\n let index = i % 31;\n current_field[index] = inputs[i];\n if index == 30 {\n fields[field_index] = field_from_bytes(current_field, false);\n current_field = [0; 31];\n field_index += 1;\n }\n }\n if field_index != fields.len() {\n fields[field_index] = field_from_bytes(current_field, false);\n }\n poseidon2_hash(fields)\n}\n\n#[test]\nfn subarray_hash_matches_fixed() {\n let values_to_hash = [3; 17];\n let padded = values_to_hash.concat([0; 11]);\n let subarray_hash = poseidon2_hash_subarray(padded, values_to_hash.len());\n\n // Hash the entire values_to_hash.\n let fixed_len_hash = poseidon::poseidon2::Poseidon2::hash(values_to_hash, values_to_hash.len());\n\n assert_eq(subarray_hash, fixed_len_hash);\n}\n\n#[test]\nfn subarray_hash_matches_variable() {\n let values_to_hash = [3; 17];\n let padded = values_to_hash.concat([0; 11]);\n let subarray_hash = poseidon2_hash_subarray(padded, values_to_hash.len());\n\n // Hash up to values_to_hash.len() fields of the padded array.\n let variable_len_hash = poseidon::poseidon2::Poseidon2::hash(padded, values_to_hash.len());\n\n assert_eq(subarray_hash, variable_len_hash);\n}\n\n#[test]\nfn smoke_sha256_to_field() {\n let full_buffer = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47,\n 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70,\n 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93,\n 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112,\n 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130,\n 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148,\n 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159,\n ];\n let result = sha256_to_field(full_buffer);\n\n assert(result == 0x448ebbc9e1a31220a2f3830c18eef61b9bd070e5084b7fa2a359fe729184c7);\n\n // to show correctness of the current ver (truncate one byte) vs old ver (mod full bytes):\n let result_bytes = sha256::digest(full_buffer);\n let truncated_field = crate::utils::field::field_from_bytes_32_trunc(result_bytes);\n assert(truncated_field == result);\n let mod_res = result + (result_bytes[31] as Field);\n assert(mod_res == 0x448ebbc9e1a31220a2f3830c18eef61b9bd070e5084b7fa2a359fe729184e0);\n}\n\n#[test]\nfn unique_siloed_note_hash_matches_typescript() {\n let inner_note_hash = 1;\n let contract_address = AztecAddress::from_field(2);\n let first_nullifier = 3;\n let note_index_in_tx = 4;\n\n let siloed_note_hash = compute_siloed_note_hash(contract_address, inner_note_hash);\n let siloed_note_hash_from_ts =\n 0x1986a4bea3eddb1fff917d629a13e10f63f514f401bdd61838c6b475db949169;\n assert_eq(siloed_note_hash, siloed_note_hash_from_ts);\n\n let nonce: Field = compute_note_hash_nonce(first_nullifier, note_index_in_tx);\n let note_hash_nonce_from_ts =\n 0x28e7799791bf066a57bb51fdd0fbcaf3f0926414314c7db515ea343f44f5d58b;\n assert_eq(nonce, note_hash_nonce_from_ts);\n\n let unique_siloed_note_hash_from_nonce = compute_unique_note_hash(nonce, siloed_note_hash);\n let unique_siloed_note_hash = compute_note_nonce_and_unique_note_hash(\n siloed_note_hash,\n first_nullifier,\n note_index_in_tx,\n );\n assert_eq(unique_siloed_note_hash_from_nonce, unique_siloed_note_hash);\n\n let unique_siloed_note_hash_from_ts =\n 0x29949aef207b715303b24639737c17fbfeb375c1d965ecfa85c7e4f0febb7d16;\n assert_eq(unique_siloed_note_hash, unique_siloed_note_hash_from_ts);\n}\n\n#[test]\nfn siloed_nullifier_matches_typescript() {\n let contract_address = AztecAddress::from_field(123);\n let nullifier = 456;\n\n let res = compute_siloed_nullifier(contract_address, nullifier);\n\n let siloed_nullifier_from_ts =\n 0x169b50336c1f29afdb8a03d955a81e485f5ac7d5f0b8065673d1e407e5877813;\n\n assert_eq(res, siloed_nullifier_from_ts);\n}\n\n#[test]\nfn siloed_private_log_first_field_matches_typescript() {\n let contract_address = AztecAddress::from_field(123);\n let field = 456;\n let res = compute_siloed_private_log_first_field(contract_address, field);\n\n let siloed_private_log_first_field_from_ts =\n 0x29480984f7b9257fded523d50addbcfc8d1d33adcf2db73ef3390a8fd5cdffaa;\n\n assert_eq(res, siloed_private_log_first_field_from_ts);\n}\n\n#[test]\nfn empty_l2_to_l1_message_hash_matches_typescript() {\n // All zeroes\n let res = compute_l2_to_l1_message_hash(\n L2ToL1Message { recipient: EthAddress::zero(), content: 0 }.scope(AztecAddress::from_field(\n 0,\n )),\n 0,\n 0,\n );\n\n let empty_l2_to_l1_msg_hash_from_ts =\n 0x003b18c58c739716e76429634a61375c45b3b5cd470c22ab6d3e14cee23dd992;\n\n assert_eq(res, empty_l2_to_l1_msg_hash_from_ts);\n}\n\n#[test]\nfn l2_to_l1_message_hash_matches_typescript() {\n let message = L2ToL1Message { recipient: EthAddress::from_field(1), content: 2 }.scope(\n AztecAddress::from_field(3),\n );\n let version = 4;\n let chainId = 5;\n\n let hash = compute_l2_to_l1_message_hash(message, version, chainId);\n\n // The following value was generated by `yarn-project/stdlib/src/hash/hash.test.ts`\n let l2_to_l1_message_hash_from_ts =\n 0x0081edf209e087ad31b3fd24263698723d57190bd1d6e9fe056fc0c0a68ee661;\n\n assert_eq(hash, l2_to_l1_message_hash_from_ts);\n}\n\n#[test]\nunconstrained fn poseidon2_hash_with_separator_bounded_vec_matches_non_bounded_vec_version() {\n let inputs = BoundedVec::<Field, 4>::from_array([1, 2, 3]);\n let separator = 42;\n\n // Hash using bounded vec version\n let bounded_result = poseidon2_hash_with_separator_bounded_vec(inputs, separator);\n\n // Hash using regular version\n let regular_result = poseidon2_hash_with_separator([1, 2, 3], separator);\n\n // Results should match\n assert_eq(bounded_result, regular_result);\n}\n"
2972
2520
  },
2973
- "360": {
2521
+ "359": {
2974
2522
  "function_locations": [
2975
2523
  {
2976
2524
  "name": "fatal_log",
@@ -3038,13 +2586,13 @@
3038
2586
  },
3039
2587
  {
3040
2588
  "name": "log_oracle",
3041
- "start": 2449
2589
+ "start": 2801
3042
2590
  }
3043
2591
  ],
3044
2592
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/logging.nr",
3045
- "source": "// Log levels matching the JS logger:\n\n// global SILENT_LOG_LEVEL: u8 = 0;\nglobal FATAL_LOG_LEVEL: u8 = 1;\nglobal ERROR_LOG_LEVEL: u8 = 2;\nglobal WARN_LOG_LEVEL: u8 = 3;\nglobal INFO_LOG_LEVEL: u8 = 4;\nglobal VERBOSE_LOG_LEVEL: u8 = 5;\nglobal DEBUG_LOG_LEVEL: u8 = 6;\nglobal TRACE_LOG_LEVEL: u8 = 7;\n\n// --- Per-level log functions (no format args) ---\n\npub fn fatal_log<let N: u32>(msg: str<N>) {\n fatal_log_format(msg, []);\n}\n\npub fn error_log<let N: u32>(msg: str<N>) {\n error_log_format(msg, []);\n}\n\npub fn warn_log<let N: u32>(msg: str<N>) {\n warn_log_format(msg, []);\n}\n\npub fn info_log<let N: u32>(msg: str<N>) {\n info_log_format(msg, []);\n}\n\npub fn verbose_log<let N: u32>(msg: str<N>) {\n verbose_log_format(msg, []);\n}\n\npub fn debug_log<let N: u32>(msg: str<N>) {\n debug_log_format(msg, []);\n}\n\npub fn trace_log<let N: u32>(msg: str<N>) {\n trace_log_format(msg, []);\n}\n\n// --- Per-level log functions (with format args) ---\n\npub fn fatal_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n log_format(FATAL_LOG_LEVEL, msg, args);\n}\n\npub fn error_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n log_format(ERROR_LOG_LEVEL, msg, args);\n}\n\npub fn warn_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n log_format(WARN_LOG_LEVEL, msg, args);\n}\n\npub fn info_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n log_format(INFO_LOG_LEVEL, msg, args);\n}\n\npub fn verbose_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n log_format(VERBOSE_LOG_LEVEL, msg, args);\n}\n\npub fn debug_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n log_format(DEBUG_LOG_LEVEL, msg, args);\n}\n\npub fn trace_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n log_format(TRACE_LOG_LEVEL, msg, args);\n}\n\nfn log_format<let M: u32, let N: u32>(log_level: u8, msg: str<M>, args: [Field; N]) {\n // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n // to call.\n unsafe { log_oracle_wrapper(log_level, msg, args) };\n}\n\nunconstrained fn log_oracle_wrapper<let M: u32, let N: u32>(\n log_level: u8,\n msg: str<M>,\n args: [Field; N],\n) {\n log_oracle(log_level, msg, N, args);\n}\n\n#[oracle(aztec_utl_log)]\nunconstrained fn log_oracle<let M: u32, let N: u32>(\n log_level: u8,\n msg: str<M>,\n length: u32,\n args: [Field; N],\n) {}\n"
2593
+ "source": "// Log levels matching the JS logger:\n\n// global SILENT_LOG_LEVEL: u8 = 0;\nglobal FATAL_LOG_LEVEL: u8 = 1;\nglobal ERROR_LOG_LEVEL: u8 = 2;\nglobal WARN_LOG_LEVEL: u8 = 3;\nglobal INFO_LOG_LEVEL: u8 = 4;\nglobal VERBOSE_LOG_LEVEL: u8 = 5;\nglobal DEBUG_LOG_LEVEL: u8 = 6;\nglobal TRACE_LOG_LEVEL: u8 = 7;\n\n// --- Per-level log functions (no format args) ---\n\npub fn fatal_log<let N: u32>(msg: str<N>) {\n fatal_log_format(msg, []);\n}\n\npub fn error_log<let N: u32>(msg: str<N>) {\n error_log_format(msg, []);\n}\n\npub fn warn_log<let N: u32>(msg: str<N>) {\n warn_log_format(msg, []);\n}\n\npub fn info_log<let N: u32>(msg: str<N>) {\n info_log_format(msg, []);\n}\n\npub fn verbose_log<let N: u32>(msg: str<N>) {\n verbose_log_format(msg, []);\n}\n\npub fn debug_log<let N: u32>(msg: str<N>) {\n debug_log_format(msg, []);\n}\n\npub fn trace_log<let N: u32>(msg: str<N>) {\n trace_log_format(msg, []);\n}\n\n// --- Per-level log functions (with format args) ---\n\npub fn fatal_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n log_format(FATAL_LOG_LEVEL, msg, args);\n}\n\npub fn error_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n log_format(ERROR_LOG_LEVEL, msg, args);\n}\n\npub fn warn_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n log_format(WARN_LOG_LEVEL, msg, args);\n}\n\npub fn info_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n log_format(INFO_LOG_LEVEL, msg, args);\n}\n\npub fn verbose_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n log_format(VERBOSE_LOG_LEVEL, msg, args);\n}\n\npub fn debug_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n log_format(DEBUG_LOG_LEVEL, msg, args);\n}\n\npub fn trace_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n log_format(TRACE_LOG_LEVEL, msg, args);\n}\n\nfn log_format<let M: u32, let N: u32>(log_level: u8, msg: str<M>, args: [Field; N]) {\n // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n // to call.\n unsafe { log_oracle_wrapper(log_level, msg, args) };\n}\n\nunconstrained fn log_oracle_wrapper<let M: u32, let N: u32>(\n log_level: u8,\n msg: str<M>,\n args: [Field; N],\n) {\n log_oracle(log_level, msg, N, args);\n}\n\n// While the length parameter might seem unnecessary given that we have N, we keep it around because at the AVM\n// bytecode level we want to support non-comptime-known lengths for such opcodes, even if Noir code will not generally\n// take that route. The AVM transpiler maps this oracle to the DEBUGLOG opcode, which reads the fields size from memory.\n#[oracle(aztec_utl_log)]\nunconstrained fn log_oracle<let M: u32, let N: u32>(\n log_level: u8,\n msg: str<M>,\n length: u32,\n args: [Field; N],\n) {}\n"
3046
2594
  },
3047
- "379": {
2595
+ "378": {
3048
2596
  "function_locations": [
3049
2597
  {
3050
2598
  "name": "Poseidon2Sponge::hash",
@@ -3074,7 +2622,7 @@
3074
2622
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/poseidon2.nr",
3075
2623
  "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<let N: u32>(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, 4);\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<let N: u32>(\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"
3076
2624
  },
3077
- "398": {
2625
+ "397": {
3078
2626
  "function_locations": [
3079
2627
  {
3080
2628
  "name": "<impl ToField for Field>::to_field",
@@ -3116,7 +2664,7 @@
3116
2664
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/traits/to_field.nr",
3117
2665
  "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 u1 {\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<let N: u32> ToField for str<N> {\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"
3118
2666
  },
3119
- "406": {
2667
+ "405": {
3120
2668
  "function_locations": [
3121
2669
  {
3122
2670
  "name": "field_from_bytes",
@@ -3246,101 +2794,101 @@
3246
2794
  "function_locations": [
3247
2795
  {
3248
2796
  "name": "Option<T>::none",
3249
- "start": 239
2797
+ "start": 389
3250
2798
  },
3251
2799
  {
3252
2800
  "name": "Option<T>::some",
3253
- "start": 403
2801
+ "start": 553
3254
2802
  },
3255
2803
  {
3256
2804
  "name": "Option<T>::is_none",
3257
- "start": 521
2805
+ "start": 671
3258
2806
  },
3259
2807
  {
3260
2808
  "name": "Option<T>::is_some",
3261
- "start": 622
2809
+ "start": 772
3262
2810
  },
3263
2811
  {
3264
2812
  "name": "Option<T>::unwrap",
3265
- "start": 746
2813
+ "start": 896
3266
2814
  },
3267
2815
  {
3268
2816
  "name": "Option<T>::unwrap_unchecked",
3269
- "start": 1044
2817
+ "start": 1194
3270
2818
  },
3271
2819
  {
3272
2820
  "name": "Option<T>::unwrap_or",
3273
- "start": 1216
2821
+ "start": 1366
3274
2822
  },
3275
2823
  {
3276
2824
  "name": "Option<T>::unwrap_or_else",
3277
- "start": 1516
2825
+ "start": 1666
3278
2826
  },
3279
2827
  {
3280
2828
  "name": "Option<T>::expect",
3281
- "start": 1817
2829
+ "start": 1967
3282
2830
  },
3283
2831
  {
3284
2832
  "name": "Option<T>::map",
3285
- "start": 2038
2833
+ "start": 2188
3286
2834
  },
3287
2835
  {
3288
2836
  "name": "Option<T>::map_or",
3289
- "start": 2338
2837
+ "start": 2488
3290
2838
  },
3291
2839
  {
3292
2840
  "name": "Option<T>::map_or_else",
3293
- "start": 2632
2841
+ "start": 2782
3294
2842
  },
3295
2843
  {
3296
2844
  "name": "Option<T>::and",
3297
- "start": 2857
2845
+ "start": 3007
3298
2846
  },
3299
2847
  {
3300
2848
  "name": "Option<T>::and_then",
3301
- "start": 3294
2849
+ "start": 3444
3302
2850
  },
3303
2851
  {
3304
2852
  "name": "Option<T>::or",
3305
- "start": 3517
2853
+ "start": 3667
3306
2854
  },
3307
2855
  {
3308
2856
  "name": "Option<T>::or_else",
3309
- "start": 3750
2857
+ "start": 3900
3310
2858
  },
3311
2859
  {
3312
2860
  "name": "Option<T>::xor",
3313
- "start": 4040
2861
+ "start": 4190
3314
2862
  },
3315
2863
  {
3316
2864
  "name": "Option<T>::filter",
3317
- "start": 4484
2865
+ "start": 4634
3318
2866
  },
3319
2867
  {
3320
2868
  "name": "Option<T>::flatten",
3321
- "start": 4913
2869
+ "start": 5063
3322
2870
  },
3323
2871
  {
3324
2872
  "name": "<impl Default for Option<T>>::default",
3325
- "start": 5090
2873
+ "start": 5240
3326
2874
  },
3327
2875
  {
3328
2876
  "name": "<impl Eq for Option<T>>::eq",
3329
- "start": 5205
2877
+ "start": 5355
3330
2878
  },
3331
2879
  {
3332
2880
  "name": "<impl Hash for Option<T>>::hash",
3333
- "start": 5554
2881
+ "start": 5704
3334
2882
  },
3335
2883
  {
3336
2884
  "name": "<impl Ord for Option<T>>::cmp",
3337
- "start": 5823
2885
+ "start": 5973
3338
2886
  }
3339
2887
  ],
3340
2888
  "path": "std/option.nr",
3341
- "source": "use crate::cmp::{Eq, Ord, Ordering};\nuse crate::default::Default;\nuse crate::hash::{Hash, Hasher};\n\npub struct Option<T> {\n _is_some: bool,\n _value: T,\n}\n\nimpl<T> Option<T> {\n /// Constructs a None value\n pub fn none() -> Self {\n Self { _is_some: false, _value: crate::mem::zeroed() }\n }\n\n /// Constructs a Some wrapper around the given value\n pub fn some(_value: T) -> Self {\n Self { _is_some: true, _value }\n }\n\n /// True if this Option is None\n pub fn is_none(self) -> bool {\n !self._is_some\n }\n\n /// True if this Option is Some\n pub fn is_some(self) -> bool {\n self._is_some\n }\n\n /// Asserts `self.is_some()` and returns the wrapped value.\n pub fn unwrap(self) -> T {\n assert(self._is_some);\n self._value\n }\n\n /// Returns the inner value without asserting `self.is_some()`\n /// Note that if `self` is `None`, there is no guarantee what value will be returned,\n /// only that it will be of type `T`.\n pub fn unwrap_unchecked(self) -> T {\n self._value\n }\n\n /// Returns the wrapped value if `self.is_some()`. Otherwise, returns the given default value.\n pub fn unwrap_or(self, default: T) -> T {\n if self._is_some {\n self._value\n } else {\n default\n }\n }\n\n /// Returns the wrapped value if `self.is_some()`. Otherwise, calls the given function to return\n /// a default value.\n pub fn unwrap_or_else<Env>(self, default: fn[Env]() -> T) -> T {\n if self._is_some {\n self._value\n } else {\n default()\n }\n }\n\n /// Asserts `self.is_some()` with a provided custom message and returns the contained `Some` value\n pub fn expect<let N: u32, MessageTypes>(self, message: fmtstr<N, MessageTypes>) -> T {\n assert(self.is_some(), message);\n self._value\n }\n\n /// If self is `Some(x)`, this returns `Some(f(x))`. Otherwise, this returns `None`.\n pub fn map<U, Env>(self, f: fn[Env](T) -> U) -> Option<U> {\n if self._is_some {\n Option::some(f(self._value))\n } else {\n Option::none()\n }\n }\n\n /// If self is `Some(x)`, this returns `f(x)`. Otherwise, this returns the given default value.\n pub fn map_or<U, Env>(self, default: U, f: fn[Env](T) -> U) -> U {\n if self._is_some {\n f(self._value)\n } else {\n default\n }\n }\n\n /// If self is `Some(x)`, this returns `f(x)`. Otherwise, this returns `default()`.\n pub fn map_or_else<U, Env1, Env2>(self, default: fn[Env1]() -> U, f: fn[Env2](T) -> U) -> U {\n if self._is_some {\n f(self._value)\n } else {\n default()\n }\n }\n\n /// Returns None if self is None. Otherwise, this returns `other`.\n pub fn and(self, other: Self) -> Self {\n if self.is_none() {\n Option::none()\n } else {\n other\n }\n }\n\n /// If self is None, this returns None. Otherwise, this calls the given function\n /// with the Some value contained within self, and returns the result of that call.\n ///\n /// In some languages this function is called `flat_map` or `bind`.\n pub fn and_then<U, Env>(self, f: fn[Env](T) -> Option<U>) -> Option<U> {\n if self._is_some {\n f(self._value)\n } else {\n Option::none()\n }\n }\n\n /// If self is Some, return self. Otherwise, return `other`.\n pub fn or(self, other: Self) -> Self {\n if self._is_some {\n self\n } else {\n other\n }\n }\n\n /// If self is Some, return self. Otherwise, return `default()`.\n pub fn or_else<Env>(self, default: fn[Env]() -> Self) -> Self {\n if self._is_some {\n self\n } else {\n default()\n }\n }\n\n // If only one of the two Options is Some, return that option.\n // Otherwise, if both options are Some or both are None, None is returned.\n pub fn xor(self, other: Self) -> Self {\n if self._is_some {\n if other._is_some {\n Option::none()\n } else {\n self\n }\n } else if other._is_some {\n other\n } else {\n Option::none()\n }\n }\n\n /// Returns `Some(x)` if self is `Some(x)` and `predicate(x)` is true.\n /// Otherwise, this returns `None`\n pub fn filter<Env>(self, predicate: fn[Env](T) -> bool) -> Self {\n if self._is_some {\n if predicate(self._value) {\n self\n } else {\n Option::none()\n }\n } else {\n Option::none()\n }\n }\n\n /// Flattens an Option<Option<T>> into a Option<T>.\n /// This returns None if the outer Option is None. Otherwise, this returns the inner Option.\n pub fn flatten(option: Option<Option<T>>) -> Option<T> {\n if option._is_some {\n option._value\n } else {\n Option::none()\n }\n }\n}\n\nimpl<T> Default for Option<T> {\n fn default() -> Self {\n Option::none()\n }\n}\n\nimpl<T> Eq for Option<T>\nwhere\n T: Eq,\n{\n fn eq(self, other: Self) -> bool {\n if self._is_some == other._is_some {\n if self._is_some {\n self._value == other._value\n } else {\n true\n }\n } else {\n false\n }\n }\n}\n\nimpl<T> Hash for Option<T>\nwhere\n T: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self._is_some.hash(state);\n if self._is_some {\n self._value.hash(state);\n }\n }\n}\n\n// For this impl we're declaring Option::none < Option::some\nimpl<T> Ord for Option<T>\nwhere\n T: Ord,\n{\n fn cmp(self, other: Self) -> Ordering {\n if self._is_some {\n if other._is_some {\n self._value.cmp(other._value)\n } else {\n Ordering::greater()\n }\n } else if other._is_some {\n Ordering::less()\n } else {\n Ordering::equal()\n }\n }\n}\n"
2889
+ "source": "use crate::cmp::{Eq, Ord, Ordering};\nuse crate::default::Default;\nuse crate::hash::{Hash, Hasher};\n\n/// Represents a value of type T or its absence.\n/// Use `Option::some(value)` to construct a value or `Option::none()` to record the absence of one.\npub struct Option<T> {\n _is_some: bool,\n _value: T,\n}\n\nimpl<T> Option<T> {\n /// Constructs a None value\n pub fn none() -> Self {\n Self { _is_some: false, _value: crate::mem::zeroed() }\n }\n\n /// Constructs a Some wrapper around the given value\n pub fn some(_value: T) -> Self {\n Self { _is_some: true, _value }\n }\n\n /// True if this Option is None\n pub fn is_none(self) -> bool {\n !self._is_some\n }\n\n /// True if this Option is Some\n pub fn is_some(self) -> bool {\n self._is_some\n }\n\n /// Asserts `self.is_some()` and returns the wrapped value.\n pub fn unwrap(self) -> T {\n assert(self._is_some);\n self._value\n }\n\n /// Returns the inner value without asserting `self.is_some()`\n /// Note that if `self` is `None`, there is no guarantee what value will be returned,\n /// only that it will be of type `T`.\n pub fn unwrap_unchecked(self) -> T {\n self._value\n }\n\n /// Returns the wrapped value if `self.is_some()`. Otherwise, returns the given default value.\n pub fn unwrap_or(self, default: T) -> T {\n if self._is_some {\n self._value\n } else {\n default\n }\n }\n\n /// Returns the wrapped value if `self.is_some()`. Otherwise, calls the given function to return\n /// a default value.\n pub fn unwrap_or_else<Env>(self, default: fn[Env]() -> T) -> T {\n if self._is_some {\n self._value\n } else {\n default()\n }\n }\n\n /// Asserts `self.is_some()` with a provided custom message and returns the contained `Some` value\n pub fn expect<let N: u32, MessageTypes>(self, message: fmtstr<N, MessageTypes>) -> T {\n assert(self.is_some(), message);\n self._value\n }\n\n /// If self is `Some(x)`, this returns `Some(f(x))`. Otherwise, this returns `None`.\n pub fn map<U, Env>(self, f: fn[Env](T) -> U) -> Option<U> {\n if self._is_some {\n Option::some(f(self._value))\n } else {\n Option::none()\n }\n }\n\n /// If self is `Some(x)`, this returns `f(x)`. Otherwise, this returns the given default value.\n pub fn map_or<U, Env>(self, default: U, f: fn[Env](T) -> U) -> U {\n if self._is_some {\n f(self._value)\n } else {\n default\n }\n }\n\n /// If self is `Some(x)`, this returns `f(x)`. Otherwise, this returns `default()`.\n pub fn map_or_else<U, Env1, Env2>(self, default: fn[Env1]() -> U, f: fn[Env2](T) -> U) -> U {\n if self._is_some {\n f(self._value)\n } else {\n default()\n }\n }\n\n /// Returns None if self is None. Otherwise, this returns `other`.\n pub fn and(self, other: Self) -> Self {\n if self.is_none() {\n Option::none()\n } else {\n other\n }\n }\n\n /// If self is None, this returns None. Otherwise, this calls the given function\n /// with the Some value contained within self, and returns the result of that call.\n ///\n /// In some languages this function is called `flat_map` or `bind`.\n pub fn and_then<U, Env>(self, f: fn[Env](T) -> Option<U>) -> Option<U> {\n if self._is_some {\n f(self._value)\n } else {\n Option::none()\n }\n }\n\n /// If self is Some, return self. Otherwise, return `other`.\n pub fn or(self, other: Self) -> Self {\n if self._is_some {\n self\n } else {\n other\n }\n }\n\n /// If self is Some, return self. Otherwise, return `default()`.\n pub fn or_else<Env>(self, default: fn[Env]() -> Self) -> Self {\n if self._is_some {\n self\n } else {\n default()\n }\n }\n\n // If only one of the two Options is Some, return that option.\n // Otherwise, if both options are Some or both are None, None is returned.\n pub fn xor(self, other: Self) -> Self {\n if self._is_some {\n if other._is_some {\n Option::none()\n } else {\n self\n }\n } else if other._is_some {\n other\n } else {\n Option::none()\n }\n }\n\n /// Returns `Some(x)` if self is `Some(x)` and `predicate(x)` is true.\n /// Otherwise, this returns `None`\n pub fn filter<Env>(self, predicate: fn[Env](T) -> bool) -> Self {\n if self._is_some {\n if predicate(self._value) {\n self\n } else {\n Option::none()\n }\n } else {\n Option::none()\n }\n }\n\n /// Flattens an Option<Option<T>> into a Option<T>.\n /// This returns None if the outer Option is None. Otherwise, this returns the inner Option.\n pub fn flatten(option: Option<Option<T>>) -> Option<T> {\n if option._is_some {\n option._value\n } else {\n Option::none()\n }\n }\n}\n\nimpl<T> Default for Option<T> {\n fn default() -> Self {\n Option::none()\n }\n}\n\nimpl<T> Eq for Option<T>\nwhere\n T: Eq,\n{\n fn eq(self, other: Self) -> bool {\n if self._is_some == other._is_some {\n if self._is_some {\n self._value == other._value\n } else {\n true\n }\n } else {\n false\n }\n }\n}\n\nimpl<T> Hash for Option<T>\nwhere\n T: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self._is_some.hash(state);\n if self._is_some {\n self._value.hash(state);\n }\n }\n}\n\n// For this impl we're declaring Option::none < Option::some\nimpl<T> Ord for Option<T>\nwhere\n T: Ord,\n{\n fn cmp(self, other: Self) -> Ordering {\n if self._is_some {\n if other._is_some {\n self._value.cmp(other._value)\n } else {\n Ordering::greater()\n }\n } else if other._is_some {\n Ordering::less()\n } else {\n Ordering::equal()\n }\n }\n}\n"
3342
2890
  },
3343
- "412": {
2891
+ "411": {
3344
2892
  "function_locations": [
3345
2893
  {
3346
2894
  "name": "Reader<N>::new",
@@ -3390,7 +2938,7 @@
3390
2938
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/serde/src/reader.nr",
3391
2939
  "source": "pub struct Reader<let N: u32> {\n data: [Field; N],\n offset: u32,\n}\n\nimpl<let N: u32> Reader<N> {\n pub fn new(data: [Field; N]) -> Self {\n Self { data, offset: 0 }\n }\n\n pub fn read(&mut self) -> Field {\n let result = self.data[self.offset];\n self.offset += 1;\n result\n }\n\n pub fn read_u32(&mut self) -> u32 {\n self.read() as u32\n }\n\n pub fn read_u64(&mut self) -> u64 {\n self.read() as u64\n }\n\n pub fn read_bool(&mut self) -> bool {\n self.read() != 0\n }\n\n pub fn read_array<let K: u32>(&mut self) -> [Field; K] {\n let mut result = [0; K];\n for i in 0..K {\n result[i] = self.data[self.offset + i];\n }\n self.offset += K;\n result\n }\n\n pub fn read_struct<T, let K: u32>(&mut self, deserialise: fn([Field; K]) -> T) -> T {\n let result = deserialise(self.read_array());\n result\n }\n\n pub fn read_struct_array<T, let K: u32, let C: u32>(\n &mut self,\n deserialise: fn([Field; K]) -> T,\n mut result: [T; C],\n ) -> [T; C] {\n for i in 0..C {\n result[i] = self.read_struct(deserialise);\n }\n result\n }\n\n pub fn peek_offset(&mut self, offset: u32) -> Field {\n self.data[self.offset + offset]\n }\n\n pub fn advance_offset(&mut self, offset: u32) {\n self.offset += offset;\n }\n\n pub fn finish(self) {\n assert_eq(self.offset, self.data.len(), \"Reader did not read all data\");\n }\n}\n"
3392
2940
  },
3393
- "413": {
2941
+ "412": {
3394
2942
  "function_locations": [
3395
2943
  {
3396
2944
  "name": "derive_serialize",
@@ -3416,7 +2964,7 @@
3416
2964
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/serde/src/serialization.nr",
3417
2965
  "source": "use crate::{reader::Reader, writer::Writer};\n\n// docs:start:serialize\n/// Trait for serializing Noir types into arrays of Fields.\n///\n/// An implementation of the Serialize trait has to follow Noir's intrinsic serialization (each member of a struct\n/// converted directly into one or more Fields without any packing or compression). This trait (and Deserialize) are\n/// typically used to communicate between Noir and TypeScript (via oracles and function arguments).\n///\n/// # On Following Noir's Intrinsic Serialization\n/// When calling a Noir function from TypeScript (TS), first the function arguments are serialized into an array\n/// of fields. This array is then included in the initial witness. Noir's intrinsic serialization is then used\n/// to deserialize the arguments from the witness. When the same Noir function is called from Noir this Serialize trait\n/// is used instead of the serialization in TS. For this reason we need to have a match between TS serialization,\n/// Noir's intrinsic serialization and the implementation of this trait. If there is a mismatch, the function calls\n/// fail with an arguments hash mismatch error message.\n///\n/// # Associated Constants\n/// * `N` - The length of the output Field array, known at compile time\n///\n/// # Example\n/// ```\n/// impl<let N: u32> Serialize for str<N> {\n/// let N: u32 = N;\n///\n/// fn serialize(self) -> [Field; Self::N] {\n/// let mut writer: Writer<Self::N> = Writer::new();\n/// self.stream_serialize(&mut writer);\n/// writer.finish()\n/// }\n///\n/// fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n/// let bytes = self.as_bytes();\n/// for i in 0..bytes.len() {\n/// writer.write(bytes[i] as Field);\n/// }\n/// }\n/// }\n/// ```\n#[derive_via(derive_serialize)]\npub trait Serialize {\n let N: u32;\n\n fn serialize(self) -> [Field; Self::N];\n\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>);\n}\n\n/// Generates a `Serialize` trait implementation for a struct type.\n///\n/// # Parameters\n/// - `s`: The struct type definition to generate the implementation for\n///\n/// # Returns\n/// A quoted code block containing the trait implementation\n///\n/// # Example\n/// For a struct defined as:\n/// ```\n/// struct Log<N> {\n/// fields: [Field; N],\n/// length: u32\n/// }\n/// ```\n///\n/// This function generates code equivalent to:\n/// ```\n/// impl<let N: u32> Serialize for Log<N> {\n/// let N: u32 = <[Field; N] as Serialize>::N + <u32 as Serialize>::N;\n///\n/// fn serialize(self) -> [Field; Self::N] {\n/// let mut writer: Writer<Self::N> = Writer::new();\n/// self.stream_serialize(&mut writer);\n/// writer.finish()\n/// }\n///\n/// #[inline_always]\n/// fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n/// Serialize::stream_serialize(self.fields, writer);\n/// Serialize::stream_serialize(self.length, writer);\n/// }\n/// }\n/// ```\npub comptime fn derive_serialize(s: TypeDefinition) -> Quoted {\n let typ = s.as_type();\n let nested_struct = typ.as_data_type().unwrap();\n\n // We care only about the name and type so we drop the last item of the tuple\n let params = nested_struct.0.fields(nested_struct.1).map(|(name, typ, _)| (name, typ));\n\n // Generates the generic parameter declarations (to be placed after the `impl` keyword) and the `where` clause\n // for the `Serialize` trait.\n let generics_declarations = get_generics_declarations(s);\n let where_serialize_clause = get_where_trait_clause(s, quote {Serialize});\n\n let params_len_quote = get_params_len_quote(params);\n\n let function_body = params\n .map(|(name, _typ): (Quoted, Type)| {\n quote {\n $crate::serialization::Serialize::stream_serialize(self.$name, writer);\n }\n })\n .join(quote {});\n\n quote {\n impl$generics_declarations $crate::serialization::Serialize for $typ\n $where_serialize_clause\n {\n let N: u32 = $params_len_quote;\n\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: $crate::writer::Writer<Self::N> = $crate::writer::Writer::new();\n $crate::serialization::Serialize::stream_serialize(self, &mut writer);\n writer.finish()\n }\n\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut $crate::writer::Writer<K>) {\n $function_body\n }\n }\n }\n}\n\n// docs:start:deserialize\n/// Trait for deserializing Noir types from arrays of Fields.\n///\n/// An implementation of the Deserialize trait has to follow Noir's intrinsic serialization (each member of a struct\n/// converted directly into one or more Fields without any packing or compression). This trait is typically used when\n/// deserializing return values from function calls in Noir. Since the same function could be called from TypeScript\n/// (TS), in which case the TS deserialization would get used, we need to have a match between the 2.\n///\n/// # Associated Constants\n/// * `N` - The length of the input Field array, known at compile time\n///\n/// # Example\n/// ```\n/// impl<let M: u32> Deserialize for str<M> {\n/// let N: u32 = M;\n///\n/// fn deserialize(fields: [Field; Self::N]) -> Self {\n/// let mut reader = Reader::new(fields);\n/// let result = Self::stream_deserialize(&mut reader);\n/// reader.finish();\n/// result\n/// }\n///\n/// fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n/// let mut bytes = [0 as u8; M];\n/// for i in 0..M {\n/// bytes[i] = reader.read() as u8;\n/// }\n/// str::<M>::from(bytes)\n/// }\n/// }\n/// ```\n#[derive_via(derive_deserialize)]\npub trait Deserialize {\n let N: u32;\n\n fn deserialize(fields: [Field; Self::N]) -> Self;\n\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self;\n}\n\n/// Generates a `Deserialize` trait implementation for a given struct `s`.\n///\n/// # Arguments\n/// * `s` - The struct type definition to generate the implementation for\n///\n/// # Returns\n/// A `Quoted` block containing the generated trait implementation\n///\n/// # Requirements\n/// Each struct member type must implement the `Deserialize` trait (it gets used in the generated code).\n///\n/// # Example\n/// For a struct like:\n/// ```\n/// struct MyStruct {\n/// x: AztecAddress,\n/// y: Field,\n/// }\n/// ```\n///\n/// This generates:\n/// ```\n/// impl Deserialize for MyStruct {\n/// let N: u32 = <AztecAddress as Deserialize>::N + <Field as Deserialize>::N;\n///\n/// fn deserialize(fields: [Field; Self::N]) -> Self {\n/// let mut reader = Reader::new(fields);\n/// let result = Self::stream_deserialize(&mut reader);\n/// reader.finish();\n/// result\n/// }\n///\n/// #[inline_always]\n/// fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n/// let x = <AztecAddress as Deserialize>::stream_deserialize(reader);\n/// let y = <Field as Deserialize>::stream_deserialize(reader);\n/// Self { x, y }\n/// }\n/// }\n/// ```\npub comptime fn derive_deserialize(s: TypeDefinition) -> Quoted {\n let typ = s.as_type();\n let nested_struct = typ.as_data_type().unwrap();\n let params = nested_struct.0.fields(nested_struct.1);\n\n // Generates the generic parameter declarations (to be placed after the `impl` keyword) and the `where` clause\n // for the `Deserialize` trait.\n let generics_declarations = get_generics_declarations(s);\n let where_deserialize_clause = get_where_trait_clause(s, quote {Deserialize});\n\n // The following will give us:\n // <type_of_struct_member_1 as Deserialize>::N + <type_of_struct_member_2 as Deserialize>::N + ...\n // (or 0 if the struct has no members)\n let right_hand_side_of_definition_of_n = if params.len() > 0 {\n params\n .map(|(_, param_type, _): (Quoted, Type, Quoted)| {\n quote {\n <$param_type as $crate::serialization::Deserialize>::N\n }\n })\n .join(quote {+})\n } else {\n quote {0}\n };\n\n // For structs containing a single member, we can enhance performance by directly deserializing the input array,\n // bypassing the need for loop-based array construction. While this optimization yields significant benefits in\n // Brillig where the loops are expected to not be optimized, it is not relevant in ACIR where the loops are\n // expected to be optimized away.\n let function_body = if params.len() > 1 {\n // This generates deserialization code for each struct member and concatenates them together.\n let deserialization_of_struct_members = params\n .map(|(param_name, param_type, _): (Quoted, Type, Quoted)| {\n quote {\n let $param_name = <$param_type as Deserialize>::stream_deserialize(reader);\n }\n })\n .join(quote {});\n\n // We join the struct member names with a comma to be used in the `Self { ... }` syntax\n // This will give us e.g. `a, b, c` for a struct with three fields named `a`, `b`, and `c`.\n let struct_members = params\n .map(|(param_name, _, _): (Quoted, Type, Quoted)| quote { $param_name })\n .join(quote {,});\n\n quote {\n $deserialization_of_struct_members\n\n Self { $struct_members }\n }\n } else if params.len() == 1 {\n let param_name = params[0].0;\n quote {\n Self { $param_name: $crate::serialization::Deserialize::stream_deserialize(reader) }\n }\n } else {\n quote {\n Self {}\n }\n };\n\n quote {\n impl$generics_declarations $crate::serialization::Deserialize for $typ\n $where_deserialize_clause\n {\n let N: u32 = $right_hand_side_of_definition_of_n;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = $crate::reader::Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut $crate::reader::Reader<K>) -> Self {\n $function_body\n }\n }\n }\n}\n\n/// Generates a quoted expression that computes the total serialized length of function parameters.\n///\n/// # Parameters\n/// * `params` - An array of tuples where each tuple contains a quoted parameter name and its Type. The type needs\n/// to implement the Serialize trait.\n///\n/// # Returns\n/// A quoted expression that evaluates to:\n/// * `0` if there are no parameters\n/// * `(<type1 as Serialize>::N + <type2 as Serialize>::N + ...)` for one or more parameters\ncomptime fn get_params_len_quote(params: [(Quoted, Type)]) -> Quoted {\n if params.len() == 0 {\n quote { 0 }\n } else {\n let params_quote_without_parentheses = params\n .map(|(_, param_type): (Quoted, Type)| {\n quote {\n <$param_type as $crate::serialization::Serialize>::N\n }\n })\n .join(quote {+});\n quote { ($params_quote_without_parentheses) }\n }\n}\n\ncomptime fn get_generics_declarations(s: TypeDefinition) -> Quoted {\n let generics = s.generics();\n\n if generics.len() > 0 {\n let generics_declarations_items = generics\n .map(|(name, maybe_integer_typ)| {\n // The second item in the generics tuple is an Option of an integer type that is Some only if\n // the generic is numeric.\n if maybe_integer_typ.is_some() {\n // The generic is numeric, so we return a quote defined as e.g. \"let N: u32\"\n let integer_type = maybe_integer_typ.unwrap();\n quote {let $name: $integer_type}\n } else {\n // The generic is not numeric, so we return a quote containing the name of the generic (e.g. \"T\")\n quote {$name}\n }\n })\n .join(quote {,});\n quote {<$generics_declarations_items>}\n } else {\n // The struct doesn't have any generics defined, so we just return an empty quote.\n quote {}\n }\n}\n\ncomptime fn get_where_trait_clause(s: TypeDefinition, trait_name: Quoted) -> Quoted {\n let generics = s.generics();\n\n // The second item in the generics tuple is an Option of an integer type that is Some only if the generic is\n // numeric.\n let non_numeric_generics =\n generics.filter(|(_, maybe_integer_typ)| maybe_integer_typ.is_none());\n\n if non_numeric_generics.len() > 0 {\n let non_numeric_generics_declarations =\n non_numeric_generics.map(|(name, _)| quote {$name: $trait_name}).join(quote {,});\n quote {where $non_numeric_generics_declarations}\n } else {\n // There are no non-numeric generics, so we return an empty quote.\n quote {}\n }\n}\n"
3418
2966
  },
3419
- "415": {
2967
+ "414": {
3420
2968
  "function_locations": [
3421
2969
  {
3422
2970
  "name": "<impl Serialize for bool>::serialize",
@@ -3746,7 +3294,7 @@
3746
3294
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/serde/src/type_impls.nr",
3747
3295
  "source": "use crate::{reader::Reader, serialization::{Deserialize, Serialize}, writer::Writer};\nuse std::embedded_curve_ops::EmbeddedCurvePoint;\nuse std::embedded_curve_ops::EmbeddedCurveScalar;\n\nglobal U1_SERIALIZED_LEN: u32 = 1;\nglobal BOOL_SERIALIZED_LEN: u32 = 1;\nglobal U8_SERIALIZED_LEN: u32 = 1;\nglobal U16_SERIALIZED_LEN: u32 = 1;\nglobal U32_SERIALIZED_LEN: u32 = 1;\nglobal U64_SERIALIZED_LEN: u32 = 1;\nglobal U128_SERIALIZED_LEN: u32 = 1;\nglobal FIELD_SERIALIZED_LEN: u32 = 1;\nglobal I8_SERIALIZED_LEN: u32 = 1;\nglobal I16_SERIALIZED_LEN: u32 = 1;\nglobal I32_SERIALIZED_LEN: u32 = 1;\nglobal I64_SERIALIZED_LEN: u32 = 1;\n\nimpl Serialize for bool {\n let N: u32 = BOOL_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as Field);\n }\n}\n\nimpl Deserialize for bool {\n let N: u32 = BOOL_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> bool {\n reader.read() != 0\n }\n}\n\nimpl Serialize for u1 {\n let N: u32 = U1_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as Field);\n }\n}\n\nimpl Deserialize for u1 {\n let N: u32 = U1_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u1\n }\n}\n\nimpl Serialize for u8 {\n let N: u32 = U8_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as Field);\n }\n}\n\nimpl Deserialize for u8 {\n let N: u32 = U8_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u8\n }\n}\n\nimpl Serialize for u16 {\n let N: u32 = U16_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as Field);\n }\n}\n\nimpl Deserialize for u16 {\n let N: u32 = U16_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u16\n }\n}\n\nimpl Serialize for u32 {\n let N: u32 = U32_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as Field);\n }\n}\n\nimpl Deserialize for u32 {\n let N: u32 = U32_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u32\n }\n}\n\nimpl Serialize for u64 {\n let N: u32 = U64_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as Field);\n }\n}\n\nimpl Deserialize for u64 {\n let N: u32 = U64_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u64\n }\n}\n\nimpl Serialize for u128 {\n let N: u32 = U128_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as Field);\n }\n}\n\nimpl Deserialize for u128 {\n let N: u32 = U128_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u128\n }\n}\n\nimpl Serialize for Field {\n let N: u32 = FIELD_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self);\n }\n}\n\nimpl Deserialize for Field {\n let N: u32 = FIELD_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read()\n }\n}\n\nimpl Serialize for i8 {\n let N: u32 = I8_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as u8 as Field);\n }\n}\n\nimpl Deserialize for i8 {\n let N: u32 = I8_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u8 as i8\n }\n}\n\nimpl Serialize for i16 {\n let N: u32 = I16_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as u16 as Field);\n }\n}\n\nimpl Deserialize for i16 {\n let N: u32 = I16_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u16 as i16\n }\n}\n\nimpl Serialize for i32 {\n let N: u32 = I32_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as u32 as Field);\n }\n}\n\nimpl Deserialize for i32 {\n let N: u32 = I32_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u32 as i32\n }\n}\n\nimpl Serialize for i64 {\n let N: u32 = I64_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as u64 as Field);\n }\n}\n\nimpl Deserialize for i64 {\n let N: u32 = I64_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u64 as i64\n }\n}\n\nimpl<T, let M: u32> Serialize for [T; M]\nwhere\n T: Serialize,\n{\n let N: u32 = <T as Serialize>::N * M;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n for i in 0..M {\n self[i].stream_serialize(writer);\n }\n }\n}\n\nimpl<T, let M: u32> Deserialize for [T; M]\nwhere\n T: Deserialize,\n{\n let N: u32 = <T as Deserialize>::N * M;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n let mut result: [T; M] = std::mem::zeroed();\n for i in 0..M {\n result[i] = T::stream_deserialize(reader);\n }\n result\n }\n}\n\nimpl<T> Serialize for Option<T>\nwhere\n T: Serialize,\n{\n let N: u32 = <T as Serialize>::N + 1;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write_bool(self.is_some());\n if self.is_some() {\n self.unwrap_unchecked().stream_serialize(writer);\n } else {\n writer.advance_offset(<T as Serialize>::N);\n }\n }\n}\n\nimpl<T> Deserialize for Option<T>\nwhere\n T: Deserialize,\n{\n let N: u32 = <T as Deserialize>::N + 1;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n if reader.read_bool() {\n Option::some(<T as Deserialize>::stream_deserialize(reader))\n } else {\n reader.advance_offset(<T as Deserialize>::N);\n Option::none()\n }\n }\n}\n\nglobal SCALAR_SIZE: u32 = 2;\n\nimpl Serialize for EmbeddedCurveScalar {\n\n let N: u32 = SCALAR_SIZE;\n\n fn serialize(self) -> [Field; SCALAR_SIZE] {\n [self.lo, self.hi]\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self.lo);\n writer.write(self.hi);\n }\n}\n\nimpl Deserialize for EmbeddedCurveScalar {\n let N: u32 = SCALAR_SIZE;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n Self { lo: fields[0], hi: fields[1] }\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n Self { lo: reader.read(), hi: reader.read() }\n }\n}\n\nglobal POINT_SIZE: u32 = 3;\n\nimpl Serialize for EmbeddedCurvePoint {\n let N: u32 = POINT_SIZE;\n\n fn serialize(self) -> [Field; Self::N] {\n [self.x, self.y, self.is_infinite as Field]\n }\n\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self.x);\n writer.write(self.y);\n writer.write(self.is_infinite as Field);\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], is_infinite: fields[2] != 0 }\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n Self { x: reader.read(), y: reader.read(), is_infinite: reader.read_bool() }\n }\n}\n\nimpl<let M: u32> Deserialize for str<M> {\n let N: u32 = M;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n let u8_arr = <[u8; Self::N] as Deserialize>::stream_deserialize(reader);\n str::<Self::N>::from(u8_arr)\n }\n}\n\nimpl<let M: u32> Serialize for str<M> {\n let N: u32 = M;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n self.as_bytes().stream_serialize(writer);\n }\n}\n\n// Note: Not deriving this because it's not supported to call derive_serialize on a \"remote\" struct (and it will never\n// be supported).\nimpl<T, let M: u32> Deserialize for BoundedVec<T, M>\nwhere\n T: Deserialize,\n{\n let N: u32 = <T as Deserialize>::N * M + 1;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n let mut new_bounded_vec: BoundedVec<T, M> = BoundedVec::new();\n let payload_len = Self::N - 1;\n\n // Length is stored in the last field as we need to match intrinsic Noir serialization and the `len` struct\n // field is after `storage` struct field (see `bounded_vec.nr` in noir-stdlib)\n let len = reader.peek_offset(payload_len) as u32;\n\n for i in 0..M {\n if i < len {\n new_bounded_vec.push(<T as Deserialize>::stream_deserialize(reader));\n }\n }\n\n // +1 for the length of the BoundedVec\n reader.advance_offset((M - len) * <T as Deserialize>::N + 1);\n\n new_bounded_vec\n }\n}\n\n// This may cause issues if used as program input, because noir disallows empty arrays for program input.\n// I think this is okay because I don't foresee a unit type being used as input. But leaving this comment as a hint\n// if someone does run into this in the future.\nimpl Deserialize for () {\n let N: u32 = 0;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(_reader: &mut Reader<K>) -> Self {\n ()\n }\n}\n\n// Note: Not deriving this because it's not supported to call derive_serialize on a \"remote\" struct (and it will never\n// be supported).\nimpl<T, let M: u32> Serialize for BoundedVec<T, M>\nwhere\n T: Serialize,\n{\n let N: u32 = <T as Serialize>::N * M + 1; // +1 for the length of the BoundedVec\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n self.storage().stream_serialize(writer);\n // Length is stored in the last field as we need to match intrinsic Noir serialization and the `len` struct\n // field is after `storage` struct field (see `bounded_vec.nr` in noir-stdlib)\n writer.write_u32(self.len() as u32);\n }\n}\n\n// Create a slice of the given length with each element made from `f(i)` where `i` is the current index\ncomptime fn make_slice<Env, T>(length: u32, f: fn[Env](u32) -> T) -> [T] {\n let mut slice = @[];\n for i in 0..length {\n slice = slice.push_back(f(i));\n }\n slice\n}\n\n// Implements Serialize and Deserialize for an arbitrary tuple type\ncomptime fn impl_serialize_for_tuple(_m: Module, length: u32) -> Quoted {\n // `T0`, `T1`, `T2`\n let type_names = make_slice(length, |i| f\"T{i}\".quoted_contents());\n\n // `result0`, `result1`, `result2`\n let result_names = make_slice(length, |i| f\"result{i}\".quoted_contents());\n\n // `T0, T1, T2`\n let field_generics = type_names.join(quote [,]);\n\n // `<T0 as Serialize>::N + <T1 as Serialize>::N + <T2 as Serialize>::N`\n let full_size_serialize = type_names\n .map(|type_name| quote {\n <$type_name as Serialize>::N\n })\n .join(quote [+]);\n\n // `<T0 as Deserialize>::N + <T1 as Deserialize>::N + <T2 as Deserialize>::N`\n let full_size_deserialize = type_names\n .map(|type_name| quote {\n <$type_name as Deserialize>::N\n })\n .join(quote [+]);\n\n // `T0: Serialize, T1: Serialize, T2: Serialize,`\n let serialize_constraints = type_names\n .map(|field_name| quote {\n $field_name: Serialize,\n })\n .join(quote []);\n\n // `T0: Deserialize, T1: Deserialize, T2: Deserialize,`\n let deserialize_constraints = type_names\n .map(|field_name| quote {\n $field_name: Deserialize,\n })\n .join(quote []);\n\n // Statements to serialize each field\n let serialized_fields = type_names\n .mapi(|i, _type_name| quote {\n $crate::serialization::Serialize::stream_serialize(self.$i, writer);\n })\n .join(quote []);\n\n // Statements to deserialize each field\n let deserialized_fields = type_names\n .mapi(|i, type_name| {\n let result_name = result_names[i];\n quote {\n let $result_name = <$type_name as $crate::serialization::Deserialize>::stream_deserialize(reader);\n }\n })\n .join(quote []);\n let deserialize_results = result_names.join(quote [,]);\n\n quote {\n impl<$field_generics> Serialize for ($field_generics) where $serialize_constraints {\n let N: u32 = $full_size_serialize;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: $crate::writer::Writer<Self::N> = $crate::writer::Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut $crate::writer::Writer<K>) {\n\n $serialized_fields\n }\n }\n\n impl<$field_generics> Deserialize for ($field_generics) where $deserialize_constraints {\n let N: u32 = $full_size_deserialize;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = $crate::reader::Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n \n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut $crate::reader::Reader<K>) -> Self {\n $deserialized_fields\n ($deserialize_results)\n }\n }\n }\n}\n\n// Keeping these manual impls. They are more efficient since they do not\n// require copying sub-arrays from any serialized arrays.\nimpl<T1> Serialize for (T1,)\nwhere\n T1: Serialize,\n{\n let N: u32 = <T1 as Serialize>::N;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: crate::writer::Writer<Self::N> = crate::writer::Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n self.0.stream_serialize(writer);\n }\n}\n\nimpl<T1> Deserialize for (T1,)\nwhere\n T1: Deserialize,\n{\n let N: u32 = <T1 as Deserialize>::N;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = crate::reader::Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n (<T1 as Deserialize>::stream_deserialize(reader),)\n }\n}\n\n#[impl_serialize_for_tuple(2)]\n#[impl_serialize_for_tuple(3)]\n#[impl_serialize_for_tuple(4)]\n#[impl_serialize_for_tuple(5)]\n#[impl_serialize_for_tuple(6)]\nmod impls {\n use crate::serialization::{Deserialize, Serialize};\n}\n\n#[test]\nunconstrained fn bounded_vec_serialization() {\n // Test empty BoundedVec\n let empty_vec: BoundedVec<Field, 3> = BoundedVec::from_array([]);\n let serialized = empty_vec.serialize();\n let deserialized = BoundedVec::<Field, 3>::deserialize(serialized);\n assert_eq(empty_vec, deserialized);\n assert_eq(deserialized.len(), 0);\n\n // Test partially filled BoundedVec\n let partial_vec: BoundedVec<[u32; 2], 3> = BoundedVec::from_array([[1, 2]]);\n let serialized = partial_vec.serialize();\n let deserialized = BoundedVec::<[u32; 2], 3>::deserialize(serialized);\n assert_eq(partial_vec, deserialized);\n assert_eq(deserialized.len(), 1);\n assert_eq(deserialized.get(0), [1, 2]);\n\n // Test full BoundedVec\n let full_vec: BoundedVec<[u32; 2], 3> = BoundedVec::from_array([[1, 2], [3, 4], [5, 6]]);\n let serialized = full_vec.serialize();\n let deserialized = BoundedVec::<[u32; 2], 3>::deserialize(serialized);\n assert_eq(full_vec, deserialized);\n assert_eq(deserialized.len(), 3);\n assert_eq(deserialized.get(0), [1, 2]);\n assert_eq(deserialized.get(1), [3, 4]);\n assert_eq(deserialized.get(2), [5, 6]);\n}\n"
3748
3296
  },
3749
- "416": {
3297
+ "415": {
3750
3298
  "function_locations": [
3751
3299
  {
3752
3300
  "name": "Writer<N>::new",
@@ -3796,11 +3344,11 @@
3796
3344
  "function_locations": [
3797
3345
  {
3798
3346
  "name": "panic",
3799
- "start": 61
3347
+ "start": 196
3800
3348
  }
3801
3349
  ],
3802
3350
  "path": "std/panic.nr",
3803
- "source": "pub fn panic<T, U>(message: T) -> U\nwhere\n T: StringLike,\n{\n assert(false, message);\n crate::mem::zeroed()\n}\n\ntrait StringLike {}\n\nimpl<let N: u32> StringLike for str<N> {}\nimpl<let N: u32, T> StringLike for fmtstr<N, T> {}\n"
3351
+ "source": "/// Halt the program at runtime with the given error message.\n///\n/// The provided error message must be either a `str` or a `fmtstr`.\npub fn panic<T, U>(message: T) -> U\nwhere\n T: StringLike,\n{\n assert(false, message);\n crate::mem::zeroed()\n}\n\ntrait StringLike {}\n\nimpl<let N: u32> StringLike for str<N> {}\nimpl<let N: u32, T> StringLike for fmtstr<N, T> {}\n"
3804
3352
  },
3805
3353
  "50": {
3806
3354
  "function_locations": [
@@ -4178,209 +3726,213 @@
4178
3726
  "function_locations": [
4179
3727
  {
4180
3728
  "name": "CapsuleArray<T>::at",
4181
- "start": 1273
3729
+ "start": 1478
4182
3730
  },
4183
3731
  {
4184
3732
  "name": "CapsuleArray<T>::len",
4185
- "start": 1429
3733
+ "start": 1641
4186
3734
  },
4187
3735
  {
4188
3736
  "name": "CapsuleArray<T>::push",
4189
- "start": 1711
3737
+ "start": 1935
4190
3738
  },
4191
3739
  {
4192
3740
  "name": "CapsuleArray<T>::get",
4193
- "start": 2382
3741
+ "start": 2748
4194
3742
  },
4195
3743
  {
4196
3744
  "name": "CapsuleArray<T>::remove",
4197
- "start": 2705
3745
+ "start": 3083
4198
3746
  },
4199
3747
  {
4200
3748
  "name": "CapsuleArray<T>::for_each",
4201
- "start": 4809
3749
+ "start": 5345
4202
3750
  },
4203
3751
  {
4204
3752
  "name": "CapsuleArray<T>::slot_at",
4205
- "start": 5877
3753
+ "start": 6413
4206
3754
  },
4207
3755
  {
4208
3756
  "name": "test::empty_array",
4209
- "start": 6253
3757
+ "start": 6902
4210
3758
  },
4211
3759
  {
4212
3760
  "name": "test::empty_array_read",
4213
- "start": 6668
3761
+ "start": 7324
4214
3762
  },
4215
3763
  {
4216
3764
  "name": "test::array_push",
4217
- "start": 6984
3765
+ "start": 7647
4218
3766
  },
4219
3767
  {
4220
3768
  "name": "test::read_past_len",
4221
- "start": 7443
3769
+ "start": 8113
4222
3770
  },
4223
3771
  {
4224
3772
  "name": "test::array_remove_last",
4225
- "start": 7787
3773
+ "start": 8464
4226
3774
  },
4227
3775
  {
4228
3776
  "name": "test::array_remove_some",
4229
- "start": 8166
3777
+ "start": 8850
4230
3778
  },
4231
3779
  {
4232
3780
  "name": "test::array_remove_all",
4233
- "start": 8839
3781
+ "start": 9530
4234
3782
  },
4235
3783
  {
4236
3784
  "name": "test::for_each_called_with_all_elements",
4237
- "start": 9347
3785
+ "start": 10045
4238
3786
  },
4239
3787
  {
4240
3788
  "name": "test::for_each_remove_some",
4241
- "start": 10381
3789
+ "start": 11086
4242
3790
  },
4243
3791
  {
4244
3792
  "name": "test::for_each_remove_all",
4245
- "start": 11014
3793
+ "start": 11726
4246
3794
  },
4247
3795
  {
4248
3796
  "name": "test::for_each_remove_all_no_copy",
4249
- "start": 11493
3797
+ "start": 12212
3798
+ },
3799
+ {
3800
+ "name": "test::different_scopes_are_isolated",
3801
+ "start": 12924
4250
3802
  }
4251
3803
  ],
4252
3804
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/capsules/mod.nr",
4253
- "source": "use crate::oracle::capsules;\nuse crate::protocol::{address::AztecAddress, traits::{Deserialize, Serialize}};\n\n/// A dynamically sized array backed by PXE's non-volatile database (called capsules). Values are persisted until\n/// deleted, so they can be e.g. stored during simulation of a transaction and later retrieved during witness\n/// generation. All values are scoped per contract address, so external contracts cannot access them.\npub struct CapsuleArray<T> {\n contract_address: AztecAddress,\n /// The base slot is where the array length is stored in capsules. Array elements are stored in consecutive slots\n /// after the base slot. For example, with base slot 5: the length is at slot 5, the first element (index 0) is at\n /// slot 6, the second element (index 1) is at slot 7, and so on.\n base_slot: Field,\n}\n\nimpl<T> CapsuleArray<T> {\n /// Returns a CapsuleArray connected to a contract's capsules at a base slot. Array elements are stored in\n /// contiguous slots following the base slot, so there should be sufficient space between array base slots to\n /// accommodate elements. A reasonable strategy is to make the base slot a hash of a unique value.\n pub unconstrained fn at(contract_address: AztecAddress, base_slot: Field) -> Self {\n Self { contract_address, base_slot }\n }\n\n /// Returns the number of elements stored in the array.\n pub unconstrained fn len(self) -> u32 {\n // An uninitialized array defaults to a length of 0.\n capsules::load(self.contract_address, self.base_slot).unwrap_or(0) as u32\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 current_length = self.len();\n\n // The slot corresponding to the index `current_length` is the first slot immediately after the end of the\n // array, which is where we want to place the new value.\n capsules::store(self.contract_address, self.slot_at(current_length), value);\n\n // Then we simply update the length.\n let new_length = current_length + 1;\n capsules::store(self.contract_address, self.base_slot, new_length);\n }\n\n /// Retrieves the value stored in the array at `index`. Throws if the index is out of bounds.\n pub unconstrained fn get(self, index: u32) -> T\n where\n T: Deserialize,\n {\n assert(index < self.len(), \"Attempted to read past the length of a CapsuleArray\");\n\n capsules::load(self.contract_address, self.slot_at(index)).unwrap()\n }\n\n /// Deletes the value stored in the array at `index`. Throws if the index is out of bounds.\n pub unconstrained fn remove(self, index: u32) {\n let current_length = self.len();\n assert(index < current_length, \"Attempted to delete past the length of a CapsuleArray\");\n\n // In order to be able to remove elements at arbitrary indices, we need to shift the entire contents of the\n // array past the removed element one slot backward so that we don't end up with a gap and preserve the\n // contiguous slots. We can skip this when deleting the last element however.\n if index != current_length - 1 {\n // The source and destination regions overlap, but `copy` supports this.\n capsules::copy(\n self.contract_address,\n self.slot_at(index + 1),\n self.slot_at(index),\n current_length - index - 1,\n );\n }\n\n // We can now delete the last element (which has either been copied to the slot immediately before it, or was\n // the element we meant to delete in the first place) and update the length.\n capsules::delete(self.contract_address, self.slot_at(current_length - 1));\n capsules::store(self.contract_address, self.base_slot, current_length - 1);\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. The order in which values\n /// are processed is arbitrary.\n ///\n /// ## Array Mutation\n ///\n /// It is safe to delete the current element (and only the current element) from inside the callback via `remove`:\n /// ```noir\n /// array.for_each(|index, value| {\n /// if some_condition(value) {\n /// array.remove(index); // safe only for this index\n /// }\n /// }\n /// ```\n ///\n /// If all elements in the array need to iterated over and then removed, then using `for_each` results in optimal\n /// efficiency.\n ///\n /// It is **not** safe to push new elements into the array from inside the callback.\n pub unconstrained fn for_each<Env>(self, f: unconstrained fn[Env](u32, T) -> ())\n where\n T: Deserialize,\n {\n // Iterating over all elements is simple, but we want to do it in such a way that a) deleting the current\n // element is safe to do, and b) deleting *all* elements is optimally efficient. This is because CapsuleArrays\n // are typically used to hold pending tasks, so iterating them while clearing completed tasks (sometimes\n // unconditionally, resulting in a full clear) is a very common access pattern.\n //\n // The way we achieve this is by iterating backwards: each element can always be deleted since it won't change\n // any preceding (lower) indices, and if every element is deleted then every element will (in turn) be the last\n // element. This results in an optimal full clear since `remove` will be able to skip the `capsules::copy` call\n // to shift any elements past the deleted one (because there will be none).\n let mut i = self.len();\n while i > 0 {\n i -= 1;\n f(i, self.get(i));\n }\n }\n\n unconstrained fn slot_at(self, index: u32) -> Field {\n // Elements are stored immediately after the base slot, so we add 1 to it to compute the slot for the first\n // element.\n self.base_slot + 1 + index as Field\n }\n}\n\nmod test {\n use crate::test::helpers::test_environment::TestEnvironment;\n use super::CapsuleArray;\n\n global SLOT: Field = 1230;\n\n #[test]\n unconstrained fn empty_array() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let array: CapsuleArray<Field> = CapsuleArray::at(contract_address, SLOT);\n assert_eq(array.len(), 0);\n });\n }\n\n #[test(should_fail_with = \"Attempted to read past the length of a CapsuleArray\")]\n unconstrained fn empty_array_read() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n let _: Field = array.get(0);\n });\n }\n\n #[test]\n unconstrained fn array_push() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n array.push(5);\n\n assert_eq(array.len(), 1);\n assert_eq(array.get(0), 5);\n });\n }\n\n #[test(should_fail_with = \"Attempted to read past the length of a CapsuleArray\")]\n unconstrained fn read_past_len() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n array.push(5);\n\n let _ = array.get(1);\n });\n }\n\n #[test]\n unconstrained fn array_remove_last() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(5);\n array.remove(0);\n\n assert_eq(array.len(), 0);\n });\n }\n\n #[test]\n unconstrained fn array_remove_some() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(7);\n array.push(8);\n array.push(9);\n\n assert_eq(array.len(), 3);\n assert_eq(array.get(0), 7);\n assert_eq(array.get(1), 8);\n assert_eq(array.get(2), 9);\n\n array.remove(1);\n\n assert_eq(array.len(), 2);\n assert_eq(array.get(0), 7);\n assert_eq(array.get(1), 9);\n });\n }\n\n #[test]\n unconstrained fn array_remove_all() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(7);\n array.push(8);\n array.push(9);\n\n array.remove(1);\n array.remove(1);\n array.remove(0);\n\n assert_eq(array.len(), 0);\n });\n }\n\n #[test]\n unconstrained fn for_each_called_with_all_elements() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(4);\n array.push(5);\n array.push(6);\n\n // We store all values that we were called with and check that all (value, index) tuples are present. Note\n // that we do not care about the order in which each tuple was passed to the closure.\n let called_with = &mut BoundedVec::<(u32, Field), 3>::new();\n array.for_each(|index, value| { called_with.push((index, value)); });\n\n assert_eq(called_with.len(), 3);\n assert(called_with.any(|(index, value)| (index == 0) & (value == 4)));\n assert(called_with.any(|(index, value)| (index == 1) & (value == 5)));\n assert(called_with.any(|(index, value)| (index == 2) & (value == 6)));\n });\n }\n\n #[test]\n unconstrained fn for_each_remove_some() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(4);\n array.push(5);\n array.push(6);\n\n array.for_each(|index, _| {\n if index == 1 {\n array.remove(index);\n }\n });\n\n assert_eq(array.len(), 2);\n assert_eq(array.get(0), 4);\n assert_eq(array.get(1), 6);\n });\n }\n\n #[test]\n unconstrained fn for_each_remove_all() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(4);\n array.push(5);\n array.push(6);\n\n array.for_each(|index, _| { array.remove(index); });\n\n assert_eq(array.len(), 0);\n });\n }\n\n #[test]\n unconstrained fn for_each_remove_all_no_copy() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(4);\n array.push(5);\n array.push(6);\n\n // We test that the aztec_utl_copyCapsule was never called, which is the expensive operation we want to\n // avoid.\n let mock = std::test::OracleMock::mock(\"aztec_utl_copyCapsule\");\n\n array.for_each(|index, _| { array.remove(index); });\n\n assert_eq(mock.times_called(), 0);\n });\n }\n}\n"
3805
+ "source": "use crate::oracle::capsules;\nuse crate::protocol::{address::AztecAddress, traits::{Deserialize, Serialize}};\n\n/// A dynamically sized array backed by PXE's non-volatile database (called capsules). Values are persisted until\n/// deleted, so they can be e.g. stored during simulation of a transaction and later retrieved during witness\n/// generation. All values are scoped per contract address, so external contracts cannot access them.\npub struct CapsuleArray<T> {\n contract_address: AztecAddress,\n /// The base slot is where the array length is stored in capsules. Array elements are stored in consecutive slots\n /// after the base slot. For example, with base slot 5: the length is at slot 5, the first element (index 0) is at\n /// slot 6, the second element (index 1) is at slot 7, and so on.\n base_slot: Field,\n /// Scope for capsule isolation. Capsule operations are scoped to the given address, allowing multiple independent\n /// namespaces within the same contract.\n scope: AztecAddress,\n}\n\nimpl<T> CapsuleArray<T> {\n /// Returns a CapsuleArray scoped to a specific address.\n ///\n /// Array elements are stored in contiguous slots\n /// following the base slot, so there should be sufficient space between array base slots to accommodate elements.\n /// A reasonable strategy is to make the base slot a hash of a unique value.\n pub unconstrained fn at(contract_address: AztecAddress, base_slot: Field, scope: AztecAddress) -> Self {\n Self { contract_address, base_slot, scope }\n }\n\n /// Returns the number of elements stored in the array.\n pub unconstrained fn len(self) -> u32 {\n // An uninitialized array defaults to a length of 0.\n capsules::load(self.contract_address, self.base_slot, self.scope).unwrap_or(0) as u32\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 current_length = self.len();\n\n // The slot corresponding to the index `current_length` is the first slot immediately after the end of the\n // array, which is where we want to place the new value.\n capsules::store(\n self.contract_address,\n self.slot_at(current_length),\n value,\n self.scope,\n );\n\n // Then we simply update the length.\n let new_length = current_length + 1;\n capsules::store(\n self.contract_address,\n self.base_slot,\n new_length,\n self.scope,\n );\n }\n\n /// Retrieves the value stored in the array at `index`. Throws if the index is out of bounds.\n pub unconstrained fn get(self, index: u32) -> T\n where\n T: Deserialize,\n {\n assert(index < self.len(), \"Attempted to read past the length of a CapsuleArray\");\n\n capsules::load(self.contract_address, self.slot_at(index), self.scope).unwrap()\n }\n\n /// Deletes the value stored in the array at `index`. Throws if the index is out of bounds.\n pub unconstrained fn remove(self, index: u32) {\n let current_length = self.len();\n assert(index < current_length, \"Attempted to delete past the length of a CapsuleArray\");\n\n // In order to be able to remove elements at arbitrary indices, we need to shift the entire contents of the\n // array past the removed element one slot backward so that we don't end up with a gap and preserve the\n // contiguous slots. We can skip this when deleting the last element however.\n if index != current_length - 1 {\n // The source and destination regions overlap, but `copy` supports this.\n capsules::copy(\n self.contract_address,\n self.slot_at(index + 1),\n self.slot_at(index),\n current_length - index - 1,\n self.scope,\n );\n }\n\n // We can now delete the last element (which has either been copied to the slot immediately before it, or was\n // the element we meant to delete in the first place) and update the length.\n capsules::delete(\n self.contract_address,\n self.slot_at(current_length - 1),\n self.scope,\n );\n capsules::store(\n self.contract_address,\n self.base_slot,\n current_length - 1,\n self.scope,\n );\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. The order in which values\n /// are processed is arbitrary.\n ///\n /// ## Array Mutation\n ///\n /// It is safe to delete the current element (and only the current element) from inside the callback via `remove`:\n /// ```noir\n /// array.for_each(|index, value| {\n /// if some_condition(value) {\n /// array.remove(index); // safe only for this index\n /// }\n /// }\n /// ```\n ///\n /// If all elements in the array need to iterated over and then removed, then using `for_each` results in optimal\n /// efficiency.\n ///\n /// It is **not** safe to push new elements into the array from inside the callback.\n pub unconstrained fn for_each<Env>(self, f: unconstrained fn[Env](u32, T) -> ())\n where\n T: Deserialize,\n {\n // Iterating over all elements is simple, but we want to do it in such a way that a) deleting the current\n // element is safe to do, and b) deleting *all* elements is optimally efficient. This is because CapsuleArrays\n // are typically used to hold pending tasks, so iterating them while clearing completed tasks (sometimes\n // unconditionally, resulting in a full clear) is a very common access pattern.\n //\n // The way we achieve this is by iterating backwards: each element can always be deleted since it won't change\n // any preceding (lower) indices, and if every element is deleted then every element will (in turn) be the last\n // element. This results in an optimal full clear since `remove` will be able to skip the `capsules::copy` call\n // to shift any elements past the deleted one (because there will be none).\n let mut i = self.len();\n while i > 0 {\n i -= 1;\n f(i, self.get(i));\n }\n }\n\n unconstrained fn slot_at(self, index: u32) -> Field {\n // Elements are stored immediately after the base slot, so we add 1 to it to compute the slot for the first\n // element.\n self.base_slot + 1 + index as Field\n }\n}\n\nmod test {\n use crate::protocol::address::AztecAddress;\n use crate::test::helpers::test_environment::TestEnvironment;\n use super::CapsuleArray;\n\n global SLOT: Field = 1230;\n global SCOPE: AztecAddress = AztecAddress { inner: 0xface };\n\n #[test]\n unconstrained fn empty_array() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let array: CapsuleArray<Field> = CapsuleArray::at(contract_address, SLOT, SCOPE);\n assert_eq(array.len(), 0);\n });\n }\n\n #[test(should_fail_with = \"Attempted to read past the length of a CapsuleArray\")]\n unconstrained fn empty_array_read() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let array = CapsuleArray::at(contract_address, SLOT, SCOPE);\n let _: Field = array.get(0);\n });\n }\n\n #[test]\n unconstrained fn array_push() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let array = CapsuleArray::at(contract_address, SLOT, SCOPE);\n array.push(5);\n\n assert_eq(array.len(), 1);\n assert_eq(array.get(0), 5);\n });\n }\n\n #[test(should_fail_with = \"Attempted to read past the length of a CapsuleArray\")]\n unconstrained fn read_past_len() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let array = CapsuleArray::at(contract_address, SLOT, SCOPE);\n array.push(5);\n\n let _ = array.get(1);\n });\n }\n\n #[test]\n unconstrained fn array_remove_last() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let array = CapsuleArray::at(contract_address, SLOT, SCOPE);\n\n array.push(5);\n array.remove(0);\n\n assert_eq(array.len(), 0);\n });\n }\n\n #[test]\n unconstrained fn array_remove_some() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let array = CapsuleArray::at(contract_address, SLOT, SCOPE);\n\n array.push(7);\n array.push(8);\n array.push(9);\n\n assert_eq(array.len(), 3);\n assert_eq(array.get(0), 7);\n assert_eq(array.get(1), 8);\n assert_eq(array.get(2), 9);\n\n array.remove(1);\n\n assert_eq(array.len(), 2);\n assert_eq(array.get(0), 7);\n assert_eq(array.get(1), 9);\n });\n }\n\n #[test]\n unconstrained fn array_remove_all() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let array = CapsuleArray::at(contract_address, SLOT, SCOPE);\n\n array.push(7);\n array.push(8);\n array.push(9);\n\n array.remove(1);\n array.remove(1);\n array.remove(0);\n\n assert_eq(array.len(), 0);\n });\n }\n\n #[test]\n unconstrained fn for_each_called_with_all_elements() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let array = CapsuleArray::at(contract_address, SLOT, SCOPE);\n\n array.push(4);\n array.push(5);\n array.push(6);\n\n // We store all values that we were called with and check that all (value, index) tuples are present. Note\n // that we do not care about the order in which each tuple was passed to the closure.\n let called_with = &mut BoundedVec::<(u32, Field), 3>::new();\n array.for_each(|index, value| { called_with.push((index, value)); });\n\n assert_eq(called_with.len(), 3);\n assert(called_with.any(|(index, value)| (index == 0) & (value == 4)));\n assert(called_with.any(|(index, value)| (index == 1) & (value == 5)));\n assert(called_with.any(|(index, value)| (index == 2) & (value == 6)));\n });\n }\n\n #[test]\n unconstrained fn for_each_remove_some() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let array = CapsuleArray::at(contract_address, SLOT, SCOPE);\n\n array.push(4);\n array.push(5);\n array.push(6);\n\n array.for_each(|index, _| {\n if index == 1 {\n array.remove(index);\n }\n });\n\n assert_eq(array.len(), 2);\n assert_eq(array.get(0), 4);\n assert_eq(array.get(1), 6);\n });\n }\n\n #[test]\n unconstrained fn for_each_remove_all() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let array = CapsuleArray::at(contract_address, SLOT, SCOPE);\n\n array.push(4);\n array.push(5);\n array.push(6);\n\n array.for_each(|index, _| { array.remove(index); });\n\n assert_eq(array.len(), 0);\n });\n }\n\n #[test]\n unconstrained fn for_each_remove_all_no_copy() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let array = CapsuleArray::at(contract_address, SLOT, SCOPE);\n\n array.push(4);\n array.push(5);\n array.push(6);\n\n // We test that the aztec_utl_copyCapsule was never called, which is the expensive operation we want to\n // avoid.\n let mock = std::test::OracleMock::mock(\"aztec_utl_copyCapsule\");\n\n array.for_each(|index, _| { array.remove(index); });\n\n assert_eq(mock.times_called(), 0);\n });\n }\n\n #[test]\n unconstrained fn different_scopes_are_isolated() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let scope_a = AztecAddress { inner: 0xaaa };\n let scope_b = AztecAddress { inner: 0xbbb };\n\n let array_a = CapsuleArray::at(contract_address, SLOT, scope_a);\n let array_b = CapsuleArray::at(contract_address, SLOT, scope_b);\n\n array_a.push(10);\n array_a.push(20);\n array_b.push(99);\n\n assert_eq(array_a.len(), 2);\n assert_eq(array_a.get(0), 10);\n assert_eq(array_a.get(1), 20);\n\n assert_eq(array_b.len(), 1);\n assert_eq(array_b.get(0), 99);\n });\n }\n}\n"
4254
3806
  },
4255
3807
  "72": {
4256
3808
  "function_locations": [
4257
3809
  {
4258
3810
  "name": "<impl Eq for PublicContext>::eq",
4259
- "start": 3326
3811
+ "start": 3353
4260
3812
  },
4261
3813
  {
4262
3814
  "name": "PublicContext::new",
4263
- "start": 3911
3815
+ "start": 3938
4264
3816
  },
4265
3817
  {
4266
- "name": "PublicContext::emit_public_log",
4267
- "start": 4251
3818
+ "name": "PublicContext::emit_public_log_unsafe",
3819
+ "start": 4887
4268
3820
  },
4269
3821
  {
4270
3822
  "name": "PublicContext::note_hash_exists",
4271
- "start": 4849
3823
+ "start": 5811
4272
3824
  },
4273
3825
  {
4274
3826
  "name": "PublicContext::l1_to_l2_msg_exists",
4275
- "start": 5847
3827
+ "start": 6809
4276
3828
  },
4277
3829
  {
4278
3830
  "name": "PublicContext::nullifier_exists_unsafe",
4279
- "start": 9047
3831
+ "start": 10009
4280
3832
  },
4281
3833
  {
4282
3834
  "name": "PublicContext::consume_l1_to_l2_message",
4283
- "start": 10897
3835
+ "start": 11859
4284
3836
  },
4285
3837
  {
4286
3838
  "name": "PublicContext::message_portal",
4287
- "start": 13014
3839
+ "start": 13976
4288
3840
  },
4289
3841
  {
4290
3842
  "name": "PublicContext::call_public_function",
4291
- "start": 13904
3843
+ "start": 14866
4292
3844
  },
4293
3845
  {
4294
3846
  "name": "PublicContext::static_call_public_function",
4295
- "start": 15536
3847
+ "start": 16498
4296
3848
  },
4297
3849
  {
4298
3850
  "name": "PublicContext::push_note_hash",
4299
- "start": 17320
3851
+ "start": 18282
4300
3852
  },
4301
3853
  {
4302
3854
  "name": "PublicContext::push_nullifier",
4303
- "start": 18759
3855
+ "start": 19721
4304
3856
  },
4305
3857
  {
4306
3858
  "name": "PublicContext::this_address",
4307
- "start": 19349
3859
+ "start": 20311
4308
3860
  },
4309
3861
  {
4310
3862
  "name": "PublicContext::maybe_msg_sender",
4311
- "start": 20444
3863
+ "start": 21406
4312
3864
  },
4313
3865
  {
4314
3866
  "name": "PublicContext::selector",
4315
- "start": 21216
3867
+ "start": 22178
4316
3868
  },
4317
3869
  {
4318
3870
  "name": "PublicContext::get_args_hash",
4319
- "start": 21955
3871
+ "start": 22917
4320
3872
  },
4321
3873
  {
4322
3874
  "name": "PublicContext::transaction_fee",
4323
- "start": 23347
3875
+ "start": 24309
4324
3876
  },
4325
3877
  {
4326
3878
  "name": "PublicContext::chain_id",
4327
- "start": 23936
3879
+ "start": 24898
4328
3880
  },
4329
3881
  {
4330
3882
  "name": "PublicContext::version",
4331
- "start": 24606
3883
+ "start": 25568
4332
3884
  },
4333
3885
  {
4334
3886
  "name": "PublicContext::block_number",
4335
- "start": 25546
3887
+ "start": 26508
4336
3888
  },
4337
3889
  {
4338
3890
  "name": "PublicContext::timestamp",
4339
- "start": 26658
3891
+ "start": 27620
4340
3892
  },
4341
3893
  {
4342
3894
  "name": "PublicContext::min_fee_per_l2_gas",
4343
- "start": 27939
3895
+ "start": 28901
4344
3896
  },
4345
3897
  {
4346
3898
  "name": "PublicContext::min_fee_per_da_gas",
4347
- "start": 28466
3899
+ "start": 29428
4348
3900
  },
4349
3901
  {
4350
3902
  "name": "PublicContext::l2_gas_left",
4351
- "start": 28864
3903
+ "start": 29826
4352
3904
  },
4353
3905
  {
4354
3906
  "name": "PublicContext::da_gas_left",
4355
- "start": 29480
3907
+ "start": 30442
4356
3908
  },
4357
3909
  {
4358
3910
  "name": "PublicContext::is_static_call",
4359
- "start": 29945
3911
+ "start": 30907
4360
3912
  },
4361
3913
  {
4362
3914
  "name": "PublicContext::raw_storage_read",
4363
- "start": 30772
3915
+ "start": 31734
4364
3916
  },
4365
3917
  {
4366
3918
  "name": "PublicContext::storage_read",
4367
- "start": 31630
3919
+ "start": 32592
4368
3920
  },
4369
3921
  {
4370
3922
  "name": "PublicContext::raw_storage_write",
4371
- "start": 32298
3923
+ "start": 33260
4372
3924
  },
4373
3925
  {
4374
3926
  "name": "PublicContext::storage_write",
4375
- "start": 33032
3927
+ "start": 33994
4376
3928
  },
4377
3929
  {
4378
3930
  "name": "<impl Empty for PublicContext>::empty",
4379
- "start": 33157
3931
+ "start": 34119
4380
3932
  }
4381
3933
  ],
4382
3934
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/public_context.nr",
4383
- "source": "use crate::{\n context::gas::GasOpts,\n hash::{\n compute_l1_to_l2_message_hash, compute_l1_to_l2_message_nullifier, compute_secret_hash,\n compute_siloed_nullifier,\n },\n oracle::avm,\n};\nuse crate::protocol::{\n abis::function_selector::FunctionSelector,\n address::{AztecAddress, EthAddress},\n constants::{MAX_U32_VALUE, NULL_MSG_SENDER_CONTRACT_ADDRESS},\n traits::{Empty, FromField, Packable, Serialize, ToField},\n};\n\n/// # PublicContext\n///\n/// The **main interface** between an #[external(\"public\")] function and the Aztec blockchain.\n///\n/// An instance of the PublicContext is initialized automatically at the outset of every public function, within the\n/// #[external(\"public\")] macro, so you'll never need to consciously instantiate this yourself.\n///\n/// The instance is always named `context`, and it will always be available within the body of every\n/// #[external(\"public\")] function in your smart contract.\n///\n/// Typical usage for a smart contract developer will be to call getter methods of the PublicContext.\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/// ## Responsibilities\n/// - Exposes contextual data to a public function:\n/// - Data relating to how this public function was called:\n/// - msg_sender, this_address\n/// - Data relating to the current blockchain state:\n/// - timestamp, block_number, chain_id, version\n/// - Gas and fee information\n/// - Provides state access:\n/// - Read/write public storage (key-value mapping)\n/// - Check existence of notes and nullifiers (Some patterns use notes & nullifiers to store public (not private)\n/// information)\n/// - Enables consumption of L1->L2 messages.\n/// - Enables calls to other public smart contract functions:\n/// - Writes data to the blockchain:\n/// - Updates to public state variables\n/// - New public logs (for events)\n/// - New L2->L1 messages\n/// - New notes & nullifiers (E.g. pushing public info to notes/nullifiers, or for completing \"partial notes\")\n///\n/// ## Key Differences from Private Execution\n///\n/// Unlike private functions -- which are executed on the user's device and which can only reference historic state --\n/// public functions are executed by a block proposer and are executed \"live\" on the _current_ tip of the chain. This\n/// means public functions can:\n/// - Read and write _current_ public state\n/// - Immediately see the effects of earlier transactions in the same block\n///\n/// Also, public functions are executed within a zkVM (the \"AVM\"), so that they can _revert_ whilst still ensuring\n/// payment to the proposer and prover. (Private functions cannot revert: they either succeed, or they cannot be\n/// included).\n///\n/// ## Optimising Public Functions\n///\n/// Using the AVM to execute public functions means they compile down to \"AVM bytecode\" instead of the ACIR that\n/// private functions (standalone circuits) compile to. Therefore the approach to optimising a public function is\n/// fundamentally different from optimising a public function.\n///\npub struct PublicContext {\n pub args_hash: Option<Field>,\n pub compute_args_hash: fn() -> Field,\n}\n\nimpl Eq for PublicContext {\n fn eq(self, other: Self) -> bool {\n (self.args_hash == other.args_hash)\n // Can't compare the function compute_args_hash\n }\n}\n\nimpl PublicContext {\n /// Creates a new PublicContext instance.\n ///\n /// Low-level function: This is called automatically by the #[external(\"public\")] macro, so you shouldn't need to\n /// be called directly by smart contract developers.\n ///\n /// # Arguments\n /// * `compute_args_hash` - Function to compute the args_hash\n ///\n /// # Returns\n /// * A new PublicContext instance\n ///\n pub fn new(compute_args_hash: fn() -> Field) -> Self {\n PublicContext { args_hash: Option::none(), compute_args_hash }\n }\n\n /// Emits a _public_ log that will be visible onchain to everyone.\n ///\n /// # Arguments\n /// * `log` - The data to log, must implement Serialize trait\n ///\n pub fn emit_public_log<T>(_self: Self, log: T)\n where\n T: Serialize,\n {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::emit_public_log(Serialize::serialize(log).as_vector()) };\n }\n\n /// Checks if a given note hash exists in the note hash tree at a particular leaf_index.\n ///\n /// # Arguments\n /// * `note_hash` - The note hash to check for existence\n /// * `leaf_index` - The index where the note hash should be located\n ///\n /// # Returns\n /// * `bool` - True if the note hash exists at the specified index\n ///\n pub fn note_hash_exists(_self: Self, note_hash: Field, leaf_index: u64) -> bool {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::note_hash_exists(note_hash, leaf_index) } == 1\n }\n\n /// Checks if a specific L1-to-L2 message exists in the L1-to-L2 message tree at a particular leaf index.\n ///\n /// Common use cases include token bridging, cross-chain governance, and triggering L2 actions based on L1 events.\n ///\n /// This function should be called before attempting to consume an L1-to-L2 message.\n ///\n /// # Arguments\n /// * `msg_hash` - Hash of the L1-to-L2 message to check\n /// * `msg_leaf_index` - The index where the message should be located\n ///\n /// # Returns\n /// * `bool` - True if the message exists at the specified index\n ///\n /// # Advanced\n /// * Uses the AVM l1_to_l2_msg_exists opcode for tree lookup\n /// * Messages are copied from L1 Inbox to L2 by block proposers\n ///\n pub fn l1_to_l2_msg_exists(_self: Self, msg_hash: Field, msg_leaf_index: Field) -> bool {\n // Safety: AVM opcodes are constrained by the AVM itself TODO(alvaro): Make l1l2msg leaf index a u64 upstream\n unsafe { avm::l1_to_l2_msg_exists(msg_hash, msg_leaf_index as u64) } == 1\n }\n\n /// Returns `true` if an `unsiloed_nullifier` has been emitted by `contract_address`.\n ///\n /// Note that unsiloed nullifiers are not the actual values stored in the nullifier tree: they are first siloed via\n /// [`crate::hash::compute_siloed_nullifier`] with the emitting contract's address.\n ///\n /// ## Use Cases\n ///\n /// Nullifiers are typically used as a _privacy-preserving_ record of a one-time action, but they can also be used\n /// to efficiently record _public_ one-time actions as well. This is cheaper than using public storage, and has the\n /// added benefit of the nullifier being emittable from a private function.\n ///\n /// An example is to check whether a contract has been published: we emit a nullifier that is deterministic and\n /// which has a _public_ preimage.\n ///\n /// ## Public vs Private\n ///\n /// In general, one should not attempt to prove 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\n /// [`crate::context::PrivateContext::assert_nullifier_exists`]\n /// and 'prove' non-existence by _emitting_ the nullifer, which would cause the transaction to fail if the\n /// 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\n /// reliably prove whether a nullifier exists or not.\n ///\n /// ## Safety\n ///\n /// While it is safe to rely on this function's return value to determine if a nullifier exists or not, it is often\n /// **not** safe to infer additional information from that. In particular, it is **unsafe** to infer that the\n /// existence of a nullifier emitted from a private function implies that all other side-effects of said private\n /// execution have been completed, more concretely that any enqueued public calls have been executed.\n ///\n /// For example, if a function in contract `A` privately emits nullifier `X` and then enqueues public function `Y`,\n /// then it is **unsafe** for a contract `B` to infer that `Y` has alredy executed simply because `X` exists.\n ///\n /// This is because **all** private transaction effects are committed _before_ enqueued public functions are run\n /// (in\n /// order to not reveal detailed timing information about the transaction), so it is possible to observe a\n /// nullifier that was emitted alongside the enqueuing of a public call **before** said call has been completed.\n ///\n /// ## Cost\n ///\n /// This emits the `CHECKNULLIFIEREXISTS` opcode, which conceptually performs a merkle inclusion proof on the\n /// nullifier tree (both when the nullifier exists and when it doesn't).\n pub fn nullifier_exists_unsafe(_self: Self, unsiloed_nullifier: Field, contract_address: AztecAddress) -> bool {\n let siloed_nullifier = compute_siloed_nullifier(contract_address, unsiloed_nullifier);\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::nullifier_exists(siloed_nullifier) } == 1\n }\n\n /// Consumes a message sent from Ethereum (L1) to Aztec (L2) -- effectively marking it as \"read\".\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, using\n /// the `l1_to_l2_msg_exists` method. Messages never technically get deleted from that tree.\n ///\n /// The message will first be inserted into an Aztec \"Inbox\" smart contract on L1. It will not be available for\n /// consumption immediately. Messages get copied-over from the L1 Inbox to L2 by the next Proposer in batches. So\n /// you will need to wait until the messages are copied before you can consume them.\n ///\n /// # Arguments\n /// * `content` - The message content that was sent from L1\n /// * `secret` - Secret value used for message privacy (if needed)\n /// * `sender` - Ethereum address that sent the message\n /// * `leaf_index` - Index of the message in the L1-to-L2 message tree\n ///\n /// # Advanced\n /// * Validates message existence in the L1-to-L2 message tree\n /// * Prevents double-consumption by emitting a nullifier\n /// * Message hash is computed from all parameters + chain context\n /// * Will revert if message doesn't exist or was already consumed\n ///\n pub fn consume_l1_to_l2_message(self: Self, content: Field, secret: Field, sender: EthAddress, leaf_index: Field) {\n let secret_hash = compute_secret_hash(secret);\n let message_hash = compute_l1_to_l2_message_hash(\n sender,\n self.chain_id(),\n /*recipient=*/\n self.this_address(),\n self.version(),\n content,\n secret_hash,\n leaf_index,\n );\n let nullifier = compute_l1_to_l2_message_nullifier(message_hash, secret);\n\n assert(!self.nullifier_exists_unsafe(nullifier, self.this_address()), \"L1-to-L2 message is already nullified\");\n assert(self.l1_to_l2_msg_exists(message_hash, leaf_index), \"Tried to consume nonexistent L1-to-L2 message\");\n\n self.push_nullifier(nullifier);\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)\n ///\n pub fn message_portal(_self: Self, recipient: EthAddress, content: Field) {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::send_l2_to_l1_msg(recipient, content) };\n }\n\n /// Calls a public function on another contract.\n ///\n /// Will revert if the called function reverts or runs out of gas.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract to call\n /// * `function_selector` - Function to call on the target contract\n /// * `args` - Arguments to pass to the function\n /// * `gas_opts` - An optional allocation of gas to the called function.\n ///\n /// # Returns\n /// * `[Field]` - Return data from the called function\n ///\n pub unconstrained fn call_public_function<let N: u32>(\n _self: Self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; N],\n gas_opts: GasOpts,\n ) -> [Field] {\n let calldata = [function_selector.to_field()].concat(args);\n\n avm::call(\n gas_opts.l2_gas.unwrap_or(MAX_U32_VALUE),\n gas_opts.da_gas.unwrap_or(MAX_U32_VALUE),\n contract_address,\n calldata,\n );\n // Use success_copy to determine whether the call succeeded\n let success = avm::success_copy();\n\n let result_data = avm::returndata_copy(0, avm::returndata_size());\n if !success {\n // Rethrow the revert data.\n avm::revert(result_data);\n }\n result_data\n }\n\n /// Makes a read-only call to a public function on another contract.\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 /// Useful for querying data from other contracts safely.\n ///\n /// Will revert if the called function reverts or runs out of gas.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract to call\n /// * `function_selector` - Function to call on the target contract\n /// * `args` - Array of arguments to pass to the called function\n /// * `gas_opts` - An optional allocation of gas to the called function.\n ///\n /// # Returns\n /// * `[Field]` - Return data from the called function\n ///\n pub unconstrained fn static_call_public_function<let N: u32>(\n _self: Self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; N],\n gas_opts: GasOpts,\n ) -> [Field] {\n let calldata = [function_selector.to_field()].concat(args);\n\n avm::call_static(\n gas_opts.l2_gas.unwrap_or(MAX_U32_VALUE),\n gas_opts.da_gas.unwrap_or(MAX_U32_VALUE),\n contract_address,\n calldata,\n );\n // Use success_copy to determine whether the call succeeded\n let success = avm::success_copy();\n\n let result_data = avm::returndata_copy(0, avm::returndata_size());\n if !success {\n // Rethrow the revert data.\n avm::revert(result_data);\n }\n result_data\n }\n\n /// Adds a new note hash to the Aztec blockchain's global Note Hash Tree.\n ///\n /// Notes are ordinarily constructed and emitted by _private_ functions, to ensure that both the content of the\n /// note, and the contract that emitted the note, stay private.\n ///\n /// There are however some useful patterns whereby a note needs to contain _public_ data. The ability to push a new\n /// note_hash from a _public_ function means that notes can be injected with public data immediately -- as soon as\n /// the public value is known. The slower alternative would be to submit a follow-up transaction so that a private\n /// function can inject the data. Both are possible on Aztec.\n ///\n /// Search \"Partial Note\" for a very common pattern which enables a note to be \"partially\" populated with some data\n /// in a _private_ function, and then later \"completed\" with some data in a public function.\n ///\n /// # Arguments\n /// * `note_hash` - The hash of the note to add to the tree\n ///\n /// # Advanced\n /// * The note hash will be siloed with the contract address by the protocol\n ///\n pub fn push_note_hash(_self: Self, note_hash: Field) {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::emit_note_hash(note_hash) };\n }\n\n /// Creates a new [nullifier](crate::nullifier).\n ///\n /// While nullifiers are primarily intended as a _privacy-preserving_ record of a one-time action, they can also\n /// be used to efficiently record _public_ one-time actions. This function allows creating nullifiers from public\n /// contract functions, which behave just like those created from private functions.\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 ///\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). Note nullifiers should only be created via\n /// [`crate::context::PrivateContext::push_nullifier_for_note_hash`].\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(_self: Self, nullifier: Field) {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::emit_nullifier(nullifier) };\n }\n\n /// Returns the address of the current contract 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: Self) -> AztecAddress {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::address()\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: If the calling function is a _private_ function, then it had the option of hiding its address\n /// when enqueuing this public function call. In such cases, this method will return `Option<AztecAddress>::none`.\n /// If the calling function is a _public_ function, it will always return an `Option<AztecAddress>::some` (i.e. a\n /// non-null value).\n ///\n /// # Returns\n /// * `Option<AztecAddress>` - The address of the smart contract that called this function (be it an app contract\n /// or a user's account contract).\n ///\n /// # Advanced\n /// * Value is provided by the AVM sender opcode\n /// * In nested calls, this is the immediate caller, not the original transaction sender\n ///\n pub fn maybe_msg_sender(_self: Self) -> Option<AztecAddress> {\n // Safety: AVM opcodes are constrained by the AVM itself\n let maybe_msg_sender = unsafe { avm::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 function selector of the currently-executing function.\n ///\n /// This is similar to `msg.sig` in Solidity, returning the first 4 bytes of the function signature.\n ///\n /// # Returns\n /// * `FunctionSelector` - The 4-byte function identifier\n ///\n /// # Advanced\n /// * Extracted from the first element of calldata\n /// * Used internally for function dispatch in the AVM\n ///\n pub fn selector(_self: Self) -> FunctionSelector {\n // The selector is the first element of the calldata when calling a public function through dispatch.\n // Safety: AVM opcodes are constrained by the AVM itself.\n let raw_selector: [Field; 1] = unsafe { avm::calldata_copy(0, 1) };\n FunctionSelector::from_field(raw_selector[0])\n }\n\n /// Returns the hash of the arguments passed to the current function.\n ///\n /// Very low-level function: The #[external(\"public\")] macro uses this internally. Smart contract developers\n /// typically won't need to access this directly as arguments are automatically made available.\n ///\n /// # Returns\n /// * `Field` - Hash of the function arguments\n ///\n pub fn get_args_hash(mut self) -> Field {\n if !self.args_hash.is_some() {\n self.args_hash = Option::some((self.compute_args_hash)());\n }\n\n self.args_hash.unwrap_unchecked()\n }\n\n /// Returns the \"transaction fee\" for the current transaction. This is the final tx fee that will be deducted from\n /// the fee_payer's \"fee-juice\" balance (in the protocol's Base Rollup circuit).\n ///\n /// # Returns\n /// * `Field` - The actual, final cost of the transaction, taking into account: the actual gas used during the\n /// setup and app-logic phases, and the fixed amount of gas that's been allocated by the user for the teardown\n /// phase. I.e. effectiveL2FeePerGas * l2GasUsed + effectiveDAFeePerGas * daGasUsed\n ///\n /// This will return `0` during the \"setup\" and \"app-logic\" phases of tx execution (because the final tx fee is not\n /// known at that time). This will only return a nonzero value during the \"teardown\" phase of execution, where the\n /// final tx fee can actually be computed.\n ///\n /// Regardless of _when_ this function is called during the teardown phase, it will always return the same final tx\n /// fee value. The teardown phase does not consume a variable amount of gas: it always consumes a pre-allocated\n /// amount of gas, as specified by the user when they generate their tx.\n ///\n pub fn transaction_fee(_self: Self) -> Field {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::transaction_fee()\n }\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: Self) -> Field {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::chain_id()\n }\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: Self) -> Field {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::version()\n }\n }\n /// Returns the current block number.\n ///\n /// This is similar to `block.number` in Solidity.\n ///\n /// Note: the current block number is only available within a public function (as opposed to a private function).\n ///\n /// Note: the time intervals between blocks should not be relied upon as being consistent:\n /// - Timestamps of blocks fall within a range, rather than at exact regular intervals.\n /// - Slots can be missed.\n /// - Protocol upgrades can completely change the intervals between blocks (and indeed the current roadmap plans to\n /// reduce the time between blocks, eventually). Use `context.timestamp()` for more-reliable time-based logic.\n ///\n /// # Returns\n /// * `u32` - The current block number\n ///\n pub fn block_number(_self: Self) -> u32 {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::block_number()\n }\n }\n\n /// Returns the timestamp of the current block.\n ///\n /// This is similar to `block.timestamp` in Solidity.\n ///\n /// All functions of all transactions in a block share the exact same timestamp (even though technically each\n /// transaction is executed one-after-the-other).\n ///\n /// Important note: Timestamps of Aztec blocks are not at reliably-fixed intervals. The proposer of the block has\n /// some flexibility to choose a timestamp which is in a valid _range_: Obviously the timestamp of this block must\n /// be strictly greater than that of the previous block, and must must be less than the timestamp of whichever\n /// ethereum block the aztec block is proposed to. Furthermore, if the timestamp is not deemed close enough to the\n /// actual current time, the committee of validators will not attest to the block.\n ///\n /// # Returns\n /// * `u64` - Unix timestamp in seconds\n ///\n pub fn timestamp(_self: Self) -> u64 {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::timestamp()\n }\n }\n\n /// Returns the fee per unit of L2 gas for this transaction (aka the \"L2 gas price\"), as chosen by the user.\n ///\n /// L2 gas covers the cost of executing public functions and handling side-effects within the AVM.\n ///\n /// # Returns\n /// * `u128` - Fee per unit of L2 gas\n ///\n /// Wallet developers should be mindful that the choice of gas price (which is publicly visible) can leak\n /// information about the user, e.g.:\n /// - which wallet software the user is using;\n /// - the amount of time which has elapsed from the time the user's wallet chose a gas price (at the going rate),\n /// to the time of tx submission. This can give clues about the proving time, and hence the nature of the tx.\n /// - the urgency of the transaction (which is kind of unavoidable, if the tx is indeed urgent).\n /// - the wealth of the user.\n /// - the exact user (if the gas price is explicitly chosen by the user to be some unique number like 0.123456789,\n /// or their favorite number). Wallet devs might wish to consider fuzzing the choice of gas price.\n ///\n pub fn min_fee_per_l2_gas(_self: Self) -> u128 {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::min_fee_per_l2_gas()\n }\n }\n\n /// Returns the fee per unit of DA (Data Availability) gas (aka the \"DA gas price\").\n ///\n /// DA gas covers the cost of making transaction data available on L1.\n ///\n /// See the warning in `min_fee_per_l2_gas` for how gas prices can be leaky.\n ///\n /// # Returns\n /// * `u128` - Fee per unit of DA gas\n ///\n pub fn min_fee_per_da_gas(_self: Self) -> u128 {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::min_fee_per_da_gas()\n }\n }\n\n /// Returns the remaining L2 gas available for this transaction.\n ///\n /// Different AVM opcodes consume different amounts of gas.\n ///\n /// # Returns\n /// * `u32` - Remaining L2 gas units\n ///\n pub fn l2_gas_left(_self: Self) -> u32 {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::l2_gas_left()\n }\n }\n\n /// Returns the remaining DA (Data Availability) gas available for this transaction.\n ///\n /// DA gas is consumed when emitting data that needs to be made available on L1, such as public logs or state\n /// updates. All of the side-effects from the private part of the tx also consume DA gas before execution of any\n /// public functions even begins.\n ///\n /// # Returns\n /// * `u32` - Remaining DA gas units\n ///\n pub fn da_gas_left(_self: Self) -> u32 {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::da_gas_left()\n }\n }\n\n /// Checks if the current execution is within a staticcall context, where no state changes or logs are allowed to\n /// be emitted (by this function or any nested function calls).\n ///\n /// # Returns\n /// * `bool` - True if in staticcall context, false otherwise\n ///\n pub fn is_static_call(_self: Self) -> bool {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::is_static_call() } == 1\n }\n\n /// Reads raw field values from public storage. Reads N consecutive storage slots starting from the given slot.\n ///\n /// Very low-level function. Users should typically use the public state variable abstractions to perform reads:\n /// PublicMutable & PublicImmutable.\n ///\n /// # Arguments\n /// * `storage_slot` - The starting storage slot to read from\n ///\n /// # Returns\n /// * `[Field; N]` - Array of N field values from consecutive storage slots\n ///\n /// # Generic Parameters\n /// * `N` - the number of consecutive slots to return, starting from the `storage_slot`.\n ///\n pub fn raw_storage_read<let N: u32>(self: Self, storage_slot: Field) -> [Field; N] {\n let mut out = [0; N];\n for i in 0..N {\n // Safety: AVM opcodes are constrained by the AVM itself\n out[i] = unsafe { avm::storage_read(storage_slot + i as Field, self.this_address().to_field()) };\n }\n out\n }\n\n /// Reads a typed value from public storage.\n ///\n /// Low-level function. Users should typically use the public state variable abstractions to perform reads:\n /// PublicMutable & PublicImmutable.\n ///\n /// # Arguments\n /// * `storage_slot` - The storage slot to read from\n ///\n /// # Returns\n /// * `T` - The deserialized value from storage\n ///\n /// # Generic Parameters\n /// * `T` - The type that the caller expects to read from the `storage_slot`.\n ///\n pub fn storage_read<T>(self, storage_slot: Field) -> T\n where\n T: Packable,\n {\n T::unpack(self.raw_storage_read(storage_slot))\n }\n\n /// Writes raw field values to public storage. Writes to N consecutive storage slots starting from the given slot.\n ///\n /// Very low-level function. Users should typically use the public state variable abstractions to perform writes:\n /// PublicMutable & PublicImmutable.\n ///\n /// Public storage writes take effect immediately.\n ///\n /// # Arguments\n /// * `storage_slot` - The starting storage slot to write to\n /// * `values` - Array of N Fields to write to storage\n ///\n pub fn raw_storage_write<let N: u32>(_self: Self, storage_slot: Field, values: [Field; N]) {\n for i in 0..N {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::storage_write(storage_slot + i as Field, values[i]) };\n }\n }\n\n /// Writes a typed value to public storage.\n ///\n /// Low-level function. Users should typically use the public state variable abstractions to perform writes:\n /// PublicMutable & PublicImmutable.\n ///\n /// # Arguments\n /// * `storage_slot` - The storage slot to write to\n /// * `value` - The typed value to write to storage\n ///\n /// # Generic Parameters\n /// * `T` - The type to write to storage.\n ///\n pub fn storage_write<T>(self, storage_slot: Field, value: T)\n where\n T: Packable,\n {\n self.raw_storage_write(storage_slot, value.pack());\n }\n}\n\nimpl Empty for PublicContext {\n fn empty() -> Self {\n PublicContext::new(|| 0)\n }\n}\n"
3935
+ "source": "use crate::{\n context::gas::GasOpts,\n hash::{\n compute_l1_to_l2_message_hash, compute_l1_to_l2_message_nullifier, compute_secret_hash,\n compute_siloed_nullifier,\n },\n oracle::avm,\n};\nuse crate::protocol::{\n abis::function_selector::FunctionSelector,\n address::{AztecAddress, EthAddress},\n constants::{MAX_U32_VALUE, NULL_MSG_SENDER_CONTRACT_ADDRESS},\n traits::{Empty, FromField, Packable, Serialize, ToField},\n utils::writer::Writer,\n};\n\n/// # PublicContext\n///\n/// The **main interface** between an #[external(\"public\")] function and the Aztec blockchain.\n///\n/// An instance of the PublicContext is initialized automatically at the outset of every public function, within the\n/// #[external(\"public\")] macro, so you'll never need to consciously instantiate this yourself.\n///\n/// The instance is always named `context`, and it will always be available within the body of every\n/// #[external(\"public\")] function in your smart contract.\n///\n/// Typical usage for a smart contract developer will be to call getter methods of the PublicContext.\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/// ## Responsibilities\n/// - Exposes contextual data to a public function:\n/// - Data relating to how this public function was called:\n/// - msg_sender, this_address\n/// - Data relating to the current blockchain state:\n/// - timestamp, block_number, chain_id, version\n/// - Gas and fee information\n/// - Provides state access:\n/// - Read/write public storage (key-value mapping)\n/// - Check existence of notes and nullifiers (Some patterns use notes & nullifiers to store public (not private)\n/// information)\n/// - Enables consumption of L1->L2 messages.\n/// - Enables calls to other public smart contract functions:\n/// - Writes data to the blockchain:\n/// - Updates to public state variables\n/// - New public logs (for events)\n/// - New L2->L1 messages\n/// - New notes & nullifiers (E.g. pushing public info to notes/nullifiers, or for completing \"partial notes\")\n///\n/// ## Key Differences from Private Execution\n///\n/// Unlike private functions -- which are executed on the user's device and which can only reference historic state --\n/// public functions are executed by a block proposer and are executed \"live\" on the _current_ tip of the chain. This\n/// means public functions can:\n/// - Read and write _current_ public state\n/// - Immediately see the effects of earlier transactions in the same block\n///\n/// Also, public functions are executed within a zkVM (the \"AVM\"), so that they can _revert_ whilst still ensuring\n/// payment to the proposer and prover. (Private functions cannot revert: they either succeed, or they cannot be\n/// included).\n///\n/// ## Optimising Public Functions\n///\n/// Using the AVM to execute public functions means they compile down to \"AVM bytecode\" instead of the ACIR that\n/// private functions (standalone circuits) compile to. Therefore the approach to optimising a public function is\n/// fundamentally different from optimising a public function.\n///\npub struct PublicContext {\n pub args_hash: Option<Field>,\n pub compute_args_hash: fn() -> Field,\n}\n\nimpl Eq for PublicContext {\n fn eq(self, other: Self) -> bool {\n (self.args_hash == other.args_hash)\n // Can't compare the function compute_args_hash\n }\n}\n\nimpl PublicContext {\n /// Creates a new PublicContext instance.\n ///\n /// Low-level function: This is called automatically by the #[external(\"public\")] macro, so you shouldn't need to\n /// be called directly by smart contract developers.\n ///\n /// # Arguments\n /// * `compute_args_hash` - Function to compute the args_hash\n ///\n /// # Returns\n /// * A new PublicContext instance\n ///\n pub fn new(compute_args_hash: fn() -> Field) -> Self {\n PublicContext { args_hash: Option::none(), compute_args_hash }\n }\n\n /// Emits a _public_ log that will be visible onchain to everyone.\n ///\n /// # Arguments\n /// * `tag` - A tag placed at `fields[0]` of the emitted log. Nodes index logs by this value, allowing\n /// clients to efficiently query for matching logs without scanning all of them.\n /// * `log` - The data to log, must implement Serialize trait.\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 `self.emit(event)` for events, which\n /// handles tagging automatically.\n pub fn emit_public_log_unsafe<T>(_self: Self, tag: Field, log: T)\n where\n T: Serialize,\n {\n // We use a Writer to serialize the log directly after the tag, avoiding an extra O(n) copy that would\n // result from serializing first and then prepending the tag.\n let mut writer: Writer<1 + <T as Serialize>::N> = Writer::new();\n writer.write(tag);\n Serialize::stream_serialize(log, &mut writer);\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::emit_public_log(writer.finish().as_vector()) };\n }\n\n /// Checks if a given note hash exists in the note hash tree at a particular leaf_index.\n ///\n /// # Arguments\n /// * `note_hash` - The note hash to check for existence\n /// * `leaf_index` - The index where the note hash should be located\n ///\n /// # Returns\n /// * `bool` - True if the note hash exists at the specified index\n ///\n pub fn note_hash_exists(_self: Self, note_hash: Field, leaf_index: u64) -> bool {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::note_hash_exists(note_hash, leaf_index) } == 1\n }\n\n /// Checks if a specific L1-to-L2 message exists in the L1-to-L2 message tree at a particular leaf index.\n ///\n /// Common use cases include token bridging, cross-chain governance, and triggering L2 actions based on L1 events.\n ///\n /// This function should be called before attempting to consume an L1-to-L2 message.\n ///\n /// # Arguments\n /// * `msg_hash` - Hash of the L1-to-L2 message to check\n /// * `msg_leaf_index` - The index where the message should be located\n ///\n /// # Returns\n /// * `bool` - True if the message exists at the specified index\n ///\n /// # Advanced\n /// * Uses the AVM l1_to_l2_msg_exists opcode for tree lookup\n /// * Messages are copied from L1 Inbox to L2 by block proposers\n ///\n pub fn l1_to_l2_msg_exists(_self: Self, msg_hash: Field, msg_leaf_index: Field) -> bool {\n // Safety: AVM opcodes are constrained by the AVM itself TODO(alvaro): Make l1l2msg leaf index a u64 upstream\n unsafe { avm::l1_to_l2_msg_exists(msg_hash, msg_leaf_index as u64) } == 1\n }\n\n /// Returns `true` if an `unsiloed_nullifier` has been emitted by `contract_address`.\n ///\n /// Note that unsiloed nullifiers are not the actual values stored in the nullifier tree: they are first siloed via\n /// [`crate::hash::compute_siloed_nullifier`] with the emitting contract's address.\n ///\n /// ## Use Cases\n ///\n /// Nullifiers are typically used as a _privacy-preserving_ record of a one-time action, but they can also be used\n /// to efficiently record _public_ one-time actions as well. This is cheaper than using public storage, and has the\n /// added benefit of the nullifier being emittable from a private function.\n ///\n /// An example is to check whether a contract has been published: we emit a nullifier that is deterministic and\n /// which has a _public_ preimage.\n ///\n /// ## Public vs Private\n ///\n /// In general, one should not attempt to prove 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\n /// [`crate::context::PrivateContext::assert_nullifier_exists`]\n /// and 'prove' non-existence by _emitting_ the nullifer, which would cause the transaction to fail if the\n /// 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\n /// reliably prove whether a nullifier exists or not.\n ///\n /// ## Safety\n ///\n /// While it is safe to rely on this function's return value to determine if a nullifier exists or not, it is often\n /// **not** safe to infer additional information from that. In particular, it is **unsafe** to infer that the\n /// existence of a nullifier emitted from a private function implies that all other side-effects of said private\n /// execution have been completed, more concretely that any enqueued public calls have been executed.\n ///\n /// For example, if a function in contract `A` privately emits nullifier `X` and then enqueues public function `Y`,\n /// then it is **unsafe** for a contract `B` to infer that `Y` has alredy executed simply because `X` exists.\n ///\n /// This is because **all** private transaction effects are committed _before_ enqueued public functions are run\n /// (in\n /// order to not reveal detailed timing information about the transaction), so it is possible to observe a\n /// nullifier that was emitted alongside the enqueuing of a public call **before** said call has been completed.\n ///\n /// ## Cost\n ///\n /// This emits the `CHECKNULLIFIEREXISTS` opcode, which conceptually performs a merkle inclusion proof on the\n /// nullifier tree (both when the nullifier exists and when it doesn't).\n pub fn nullifier_exists_unsafe(_self: Self, unsiloed_nullifier: Field, contract_address: AztecAddress) -> bool {\n let siloed_nullifier = compute_siloed_nullifier(contract_address, unsiloed_nullifier);\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::nullifier_exists(siloed_nullifier) } == 1\n }\n\n /// Consumes a message sent from Ethereum (L1) to Aztec (L2) -- effectively marking it as \"read\".\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, using\n /// the `l1_to_l2_msg_exists` method. Messages never technically get deleted from that tree.\n ///\n /// The message will first be inserted into an Aztec \"Inbox\" smart contract on L1. It will not be available for\n /// consumption immediately. Messages get copied-over from the L1 Inbox to L2 by the next Proposer in batches. So\n /// you will need to wait until the messages are copied before you can consume them.\n ///\n /// # Arguments\n /// * `content` - The message content that was sent from L1\n /// * `secret` - Secret value used for message privacy (if needed)\n /// * `sender` - Ethereum address that sent the message\n /// * `leaf_index` - Index of the message in the L1-to-L2 message tree\n ///\n /// # Advanced\n /// * Validates message existence in the L1-to-L2 message tree\n /// * Prevents double-consumption by emitting a nullifier\n /// * Message hash is computed from all parameters + chain context\n /// * Will revert if message doesn't exist or was already consumed\n ///\n pub fn consume_l1_to_l2_message(self: Self, content: Field, secret: Field, sender: EthAddress, leaf_index: Field) {\n let secret_hash = compute_secret_hash(secret);\n let message_hash = compute_l1_to_l2_message_hash(\n sender,\n self.chain_id(),\n /*recipient=*/\n self.this_address(),\n self.version(),\n content,\n secret_hash,\n leaf_index,\n );\n let nullifier = compute_l1_to_l2_message_nullifier(message_hash, secret);\n\n assert(!self.nullifier_exists_unsafe(nullifier, self.this_address()), \"L1-to-L2 message is already nullified\");\n assert(self.l1_to_l2_msg_exists(message_hash, leaf_index), \"Tried to consume nonexistent L1-to-L2 message\");\n\n self.push_nullifier(nullifier);\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)\n ///\n pub fn message_portal(_self: Self, recipient: EthAddress, content: Field) {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::send_l2_to_l1_msg(recipient, content) };\n }\n\n /// Calls a public function on another contract.\n ///\n /// Will revert if the called function reverts or runs out of gas.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract to call\n /// * `function_selector` - Function to call on the target contract\n /// * `args` - Arguments to pass to the function\n /// * `gas_opts` - An optional allocation of gas to the called function.\n ///\n /// # Returns\n /// * `[Field]` - Return data from the called function\n ///\n pub unconstrained fn call_public_function<let N: u32>(\n _self: Self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; N],\n gas_opts: GasOpts,\n ) -> [Field] {\n let calldata = [function_selector.to_field()].concat(args);\n\n avm::call(\n gas_opts.l2_gas.unwrap_or(MAX_U32_VALUE),\n gas_opts.da_gas.unwrap_or(MAX_U32_VALUE),\n contract_address,\n calldata,\n );\n // Use success_copy to determine whether the call succeeded\n let success = avm::success_copy();\n\n let result_data = avm::returndata_copy(0, avm::returndata_size());\n if !success {\n // Rethrow the revert data.\n avm::revert(result_data);\n }\n result_data\n }\n\n /// Makes a read-only call to a public function on another contract.\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 /// Useful for querying data from other contracts safely.\n ///\n /// Will revert if the called function reverts or runs out of gas.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract to call\n /// * `function_selector` - Function to call on the target contract\n /// * `args` - Array of arguments to pass to the called function\n /// * `gas_opts` - An optional allocation of gas to the called function.\n ///\n /// # Returns\n /// * `[Field]` - Return data from the called function\n ///\n pub unconstrained fn static_call_public_function<let N: u32>(\n _self: Self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; N],\n gas_opts: GasOpts,\n ) -> [Field] {\n let calldata = [function_selector.to_field()].concat(args);\n\n avm::call_static(\n gas_opts.l2_gas.unwrap_or(MAX_U32_VALUE),\n gas_opts.da_gas.unwrap_or(MAX_U32_VALUE),\n contract_address,\n calldata,\n );\n // Use success_copy to determine whether the call succeeded\n let success = avm::success_copy();\n\n let result_data = avm::returndata_copy(0, avm::returndata_size());\n if !success {\n // Rethrow the revert data.\n avm::revert(result_data);\n }\n result_data\n }\n\n /// Adds a new note hash to the Aztec blockchain's global Note Hash Tree.\n ///\n /// Notes are ordinarily constructed and emitted by _private_ functions, to ensure that both the content of the\n /// note, and the contract that emitted the note, stay private.\n ///\n /// There are however some useful patterns whereby a note needs to contain _public_ data. The ability to push a new\n /// note_hash from a _public_ function means that notes can be injected with public data immediately -- as soon as\n /// the public value is known. The slower alternative would be to submit a follow-up transaction so that a private\n /// function can inject the data. Both are possible on Aztec.\n ///\n /// Search \"Partial Note\" for a very common pattern which enables a note to be \"partially\" populated with some data\n /// in a _private_ function, and then later \"completed\" with some data in a public function.\n ///\n /// # Arguments\n /// * `note_hash` - The hash of the note to add to the tree\n ///\n /// # Advanced\n /// * The note hash will be siloed with the contract address by the protocol\n ///\n pub fn push_note_hash(_self: Self, note_hash: Field) {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::emit_note_hash(note_hash) };\n }\n\n /// Creates a new [nullifier](crate::nullifier).\n ///\n /// While nullifiers are primarily intended as a _privacy-preserving_ record of a one-time action, they can also\n /// be used to efficiently record _public_ one-time actions. This function allows creating nullifiers from public\n /// contract functions, which behave just like those created from private functions.\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 ///\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). Note nullifiers should only be created via\n /// [`crate::context::PrivateContext::push_nullifier_for_note_hash`].\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(_self: Self, nullifier: Field) {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::emit_nullifier(nullifier) };\n }\n\n /// Returns the address of the current contract 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: Self) -> AztecAddress {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::address()\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: If the calling function is a _private_ function, then it had the option of hiding its address\n /// when enqueuing this public function call. In such cases, this method will return `Option<AztecAddress>::none`.\n /// If the calling function is a _public_ function, it will always return an `Option<AztecAddress>::some` (i.e. a\n /// non-null value).\n ///\n /// # Returns\n /// * `Option<AztecAddress>` - The address of the smart contract that called this function (be it an app contract\n /// or a user's account contract).\n ///\n /// # Advanced\n /// * Value is provided by the AVM sender opcode\n /// * In nested calls, this is the immediate caller, not the original transaction sender\n ///\n pub fn maybe_msg_sender(_self: Self) -> Option<AztecAddress> {\n // Safety: AVM opcodes are constrained by the AVM itself\n let maybe_msg_sender = unsafe { avm::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 function selector of the currently-executing function.\n ///\n /// This is similar to `msg.sig` in Solidity, returning the first 4 bytes of the function signature.\n ///\n /// # Returns\n /// * `FunctionSelector` - The 4-byte function identifier\n ///\n /// # Advanced\n /// * Extracted from the first element of calldata\n /// * Used internally for function dispatch in the AVM\n ///\n pub fn selector(_self: Self) -> FunctionSelector {\n // The selector is the first element of the calldata when calling a public function through dispatch.\n // Safety: AVM opcodes are constrained by the AVM itself.\n let raw_selector: [Field; 1] = unsafe { avm::calldata_copy(0, 1) };\n FunctionSelector::from_field(raw_selector[0])\n }\n\n /// Returns the hash of the arguments passed to the current function.\n ///\n /// Very low-level function: The #[external(\"public\")] macro uses this internally. Smart contract developers\n /// typically won't need to access this directly as arguments are automatically made available.\n ///\n /// # Returns\n /// * `Field` - Hash of the function arguments\n ///\n pub fn get_args_hash(mut self) -> Field {\n if !self.args_hash.is_some() {\n self.args_hash = Option::some((self.compute_args_hash)());\n }\n\n self.args_hash.unwrap_unchecked()\n }\n\n /// Returns the \"transaction fee\" for the current transaction. This is the final tx fee that will be deducted from\n /// the fee_payer's \"fee-juice\" balance (in the protocol's Base Rollup circuit).\n ///\n /// # Returns\n /// * `Field` - The actual, final cost of the transaction, taking into account: the actual gas used during the\n /// setup and app-logic phases, and the fixed amount of gas that's been allocated by the user for the teardown\n /// phase. I.e. effectiveL2FeePerGas * l2GasUsed + effectiveDAFeePerGas * daGasUsed\n ///\n /// This will return `0` during the \"setup\" and \"app-logic\" phases of tx execution (because the final tx fee is not\n /// known at that time). This will only return a nonzero value during the \"teardown\" phase of execution, where the\n /// final tx fee can actually be computed.\n ///\n /// Regardless of _when_ this function is called during the teardown phase, it will always return the same final tx\n /// fee value. The teardown phase does not consume a variable amount of gas: it always consumes a pre-allocated\n /// amount of gas, as specified by the user when they generate their tx.\n ///\n pub fn transaction_fee(_self: Self) -> Field {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::transaction_fee()\n }\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: Self) -> Field {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::chain_id()\n }\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: Self) -> Field {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::version()\n }\n }\n /// Returns the current block number.\n ///\n /// This is similar to `block.number` in Solidity.\n ///\n /// Note: the current block number is only available within a public function (as opposed to a private function).\n ///\n /// Note: the time intervals between blocks should not be relied upon as being consistent:\n /// - Timestamps of blocks fall within a range, rather than at exact regular intervals.\n /// - Slots can be missed.\n /// - Protocol upgrades can completely change the intervals between blocks (and indeed the current roadmap plans to\n /// reduce the time between blocks, eventually). Use `context.timestamp()` for more-reliable time-based logic.\n ///\n /// # Returns\n /// * `u32` - The current block number\n ///\n pub fn block_number(_self: Self) -> u32 {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::block_number()\n }\n }\n\n /// Returns the timestamp of the current block.\n ///\n /// This is similar to `block.timestamp` in Solidity.\n ///\n /// All functions of all transactions in a block share the exact same timestamp (even though technically each\n /// transaction is executed one-after-the-other).\n ///\n /// Important note: Timestamps of Aztec blocks are not at reliably-fixed intervals. The proposer of the block has\n /// some flexibility to choose a timestamp which is in a valid _range_: Obviously the timestamp of this block must\n /// be strictly greater than that of the previous block, and must must be less than the timestamp of whichever\n /// ethereum block the aztec block is proposed to. Furthermore, if the timestamp is not deemed close enough to the\n /// actual current time, the committee of validators will not attest to the block.\n ///\n /// # Returns\n /// * `u64` - Unix timestamp in seconds\n ///\n pub fn timestamp(_self: Self) -> u64 {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::timestamp()\n }\n }\n\n /// Returns the fee per unit of L2 gas for this transaction (aka the \"L2 gas price\"), as chosen by the user.\n ///\n /// L2 gas covers the cost of executing public functions and handling side-effects within the AVM.\n ///\n /// # Returns\n /// * `u128` - Fee per unit of L2 gas\n ///\n /// Wallet developers should be mindful that the choice of gas price (which is publicly visible) can leak\n /// information about the user, e.g.:\n /// - which wallet software the user is using;\n /// - the amount of time which has elapsed from the time the user's wallet chose a gas price (at the going rate),\n /// to the time of tx submission. This can give clues about the proving time, and hence the nature of the tx.\n /// - the urgency of the transaction (which is kind of unavoidable, if the tx is indeed urgent).\n /// - the wealth of the user.\n /// - the exact user (if the gas price is explicitly chosen by the user to be some unique number like 0.123456789,\n /// or their favorite number). Wallet devs might wish to consider fuzzing the choice of gas price.\n ///\n pub fn min_fee_per_l2_gas(_self: Self) -> u128 {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::min_fee_per_l2_gas()\n }\n }\n\n /// Returns the fee per unit of DA (Data Availability) gas (aka the \"DA gas price\").\n ///\n /// DA gas covers the cost of making transaction data available on L1.\n ///\n /// See the warning in `min_fee_per_l2_gas` for how gas prices can be leaky.\n ///\n /// # Returns\n /// * `u128` - Fee per unit of DA gas\n ///\n pub fn min_fee_per_da_gas(_self: Self) -> u128 {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::min_fee_per_da_gas()\n }\n }\n\n /// Returns the remaining L2 gas available for this transaction.\n ///\n /// Different AVM opcodes consume different amounts of gas.\n ///\n /// # Returns\n /// * `u32` - Remaining L2 gas units\n ///\n pub fn l2_gas_left(_self: Self) -> u32 {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::l2_gas_left()\n }\n }\n\n /// Returns the remaining DA (Data Availability) gas available for this transaction.\n ///\n /// DA gas is consumed when emitting data that needs to be made available on L1, such as public logs or state\n /// updates. All of the side-effects from the private part of the tx also consume DA gas before execution of any\n /// public functions even begins.\n ///\n /// # Returns\n /// * `u32` - Remaining DA gas units\n ///\n pub fn da_gas_left(_self: Self) -> u32 {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::da_gas_left()\n }\n }\n\n /// Checks if the current execution is within a staticcall context, where no state changes or logs are allowed to\n /// be emitted (by this function or any nested function calls).\n ///\n /// # Returns\n /// * `bool` - True if in staticcall context, false otherwise\n ///\n pub fn is_static_call(_self: Self) -> bool {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::is_static_call() } == 1\n }\n\n /// Reads raw field values from public storage. Reads N consecutive storage slots starting from the given slot.\n ///\n /// Very low-level function. Users should typically use the public state variable abstractions to perform reads:\n /// PublicMutable & PublicImmutable.\n ///\n /// # Arguments\n /// * `storage_slot` - The starting storage slot to read from\n ///\n /// # Returns\n /// * `[Field; N]` - Array of N field values from consecutive storage slots\n ///\n /// # Generic Parameters\n /// * `N` - the number of consecutive slots to return, starting from the `storage_slot`.\n ///\n pub fn raw_storage_read<let N: u32>(self: Self, storage_slot: Field) -> [Field; N] {\n let mut out = [0; N];\n for i in 0..N {\n // Safety: AVM opcodes are constrained by the AVM itself\n out[i] = unsafe { avm::storage_read(storage_slot + i as Field, self.this_address().to_field()) };\n }\n out\n }\n\n /// Reads a typed value from public storage.\n ///\n /// Low-level function. Users should typically use the public state variable abstractions to perform reads:\n /// PublicMutable & PublicImmutable.\n ///\n /// # Arguments\n /// * `storage_slot` - The storage slot to read from\n ///\n /// # Returns\n /// * `T` - The deserialized value from storage\n ///\n /// # Generic Parameters\n /// * `T` - The type that the caller expects to read from the `storage_slot`.\n ///\n pub fn storage_read<T>(self, storage_slot: Field) -> T\n where\n T: Packable,\n {\n T::unpack(self.raw_storage_read(storage_slot))\n }\n\n /// Writes raw field values to public storage. Writes to N consecutive storage slots starting from the given slot.\n ///\n /// Very low-level function. Users should typically use the public state variable abstractions to perform writes:\n /// PublicMutable & PublicImmutable.\n ///\n /// Public storage writes take effect immediately.\n ///\n /// # Arguments\n /// * `storage_slot` - The starting storage slot to write to\n /// * `values` - Array of N Fields to write to storage\n ///\n pub fn raw_storage_write<let N: u32>(_self: Self, storage_slot: Field, values: [Field; N]) {\n for i in 0..N {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::storage_write(storage_slot + i as Field, values[i]) };\n }\n }\n\n /// Writes a typed value to public storage.\n ///\n /// Low-level function. Users should typically use the public state variable abstractions to perform writes:\n /// PublicMutable & PublicImmutable.\n ///\n /// # Arguments\n /// * `storage_slot` - The storage slot to write to\n /// * `value` - The typed value to write to storage\n ///\n /// # Generic Parameters\n /// * `T` - The type to write to storage.\n ///\n pub fn storage_write<T>(self, storage_slot: Field, value: T)\n where\n T: Packable,\n {\n self.raw_storage_write(storage_slot, value.pack());\n }\n}\n\nimpl Empty for PublicContext {\n fn empty() -> Self {\n PublicContext::new(|| 0)\n }\n}\n"
4384
3936
  },
4385
3937
  "74": {
4386
3938
  "function_locations": [
@@ -4505,6 +4057,44 @@
4505
4057
  ],
4506
4058
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/event/event_selector.nr",
4507
4059
  "source": "use crate::protocol::{hash::poseidon2_hash_bytes, traits::{Deserialize, Empty, FromField, Serialize, ToField}};\n\n#[derive(Deserialize, Eq, Serialize)]\npub struct EventSelector {\n // 1st 4-bytes (big-endian leftmost) of abi-encoding of an event.\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<let N: u32>(signature: str<N>) -> 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"
4060
+ },
4061
+ "95": {
4062
+ "function_locations": [
4063
+ {
4064
+ "name": "derive_ecdh_shared_secret",
4065
+ "start": 954
4066
+ },
4067
+ {
4068
+ "name": "compute_app_siloed_shared_secret",
4069
+ "start": 1303
4070
+ },
4071
+ {
4072
+ "name": "derive_shared_secret_subkey",
4073
+ "start": 1694
4074
+ },
4075
+ {
4076
+ "name": "derive_shared_secret_field_mask",
4077
+ "start": 2012
4078
+ },
4079
+ {
4080
+ "name": "test_consistency_with_typescript",
4081
+ "start": 2154
4082
+ },
4083
+ {
4084
+ "name": "test_shared_secret_computation_in_both_directions",
4085
+ "start": 3268
4086
+ },
4087
+ {
4088
+ "name": "test_shared_secret_computation_from_address_in_both_directions",
4089
+ "start": 3807
4090
+ },
4091
+ {
4092
+ "name": "test_app_siloed_shared_secret_differs_per_contract",
4093
+ "start": 5040
4094
+ }
4095
+ ],
4096
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/keys/ecdh_shared_secret.nr",
4097
+ "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::Point,\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: Point) -> Point {\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(crate) fn compute_app_siloed_shared_secret(shared_secret: Point, 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 = Point {\n x: 0x2688431c705a5ff3e6c6f2573c9e3ba1c1026d2251d0dbbf2d810aa53fd1d186,\n y: 0x1e96887b117afca01c00468264f4f80b5bb16d94c1808a448595f115556e5c8e,\n is_infinite: false,\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 = Point {\n x: 0x15d55a5b3b2caa6a6207f313f05c5113deba5da9927d6421bcaa164822b911bc,\n y: 0x0974c3d0825031ae933243d653ebb1a0b08b90ee7f228f94c5c74739ea3c871e,\n is_infinite: false,\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"
4508
4098
  }
4509
4099
  }
4510
4100
  }