@aztec/protocol-contracts 0.84.0 → 0.85.0

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 (21) hide show
  1. package/artifacts/AuthRegistry.json +291 -558
  2. package/artifacts/ContractClassRegisterer.json +182 -437
  3. package/artifacts/ContractInstanceDeployer.json +315 -567
  4. package/artifacts/FeeJuice.json +193 -456
  5. package/artifacts/MultiCallEntrypoint.json +24 -303
  6. package/artifacts/Router.json +249 -516
  7. package/dest/auth-registry/index.d.ts +2 -1
  8. package/dest/auth-registry/index.d.ts.map +1 -1
  9. package/dest/class-registerer/utility_function_broadcasted_event.js +4 -4
  10. package/dest/protocol_contract_data.d.ts +1 -1
  11. package/dest/protocol_contract_data.d.ts.map +1 -1
  12. package/dest/protocol_contract_data.js +8 -8
  13. package/dest/protocol_contract_data_2.d.ts +1 -1
  14. package/dest/protocol_contract_data_2.d.ts.map +1 -1
  15. package/dest/protocol_contract_data_2.js +1 -1
  16. package/dest/scripts/generate_data.js +3 -3
  17. package/package.json +4 -4
  18. package/src/auth-registry/index.ts +2 -2
  19. package/src/class-registerer/utility_function_broadcasted_event.ts +4 -4
  20. package/src/protocol_contract_data.ts +8 -8
  21. package/src/protocol_contract_data_2.ts +1 -1
package/artifacts/ContractInstanceDeployer.json CHANGED
@@ -1,210 +1,205 @@
1
1
  {
2
2
  "transpiled": true,
3
- "noir_version": "1.0.0-beta.3+0000000000000000000000000000000000000000",
3
+ "noir_version": "1.0.0-beta.4+0000000000000000000000000000000000000000",
4
4
  "name": "ContractInstanceDeployer",
5
5
  "functions": [
6
6
  {
7
- "name": "sync_notes",
7
+ "name": "get_update_delay",
8
8
  "is_unconstrained": true,
9
9
  "custom_attributes": [
10
- "aztec::macros::functions::utility"
10
+ "public",
11
+ "view"
11
12
  ],
12
13
  "abi": {
13
14
  "parameters": [],
14
- "return_type": null,
15
+ "return_type": {
16
+ "abi_type": {
17
+ "kind": "integer",
18
+ "sign": "unsigned",
19
+ "width": 32
20
+ },
21
+ "visibility": "public"
22
+ },
15
23
  "error_types": {
16
- "576755928210959028": {
24
+ "206160798890201757": {
17
25
  "error_kind": "string",
18
- "string": "0 has a square root; you cannot claim it is not square"
19
- },
20
- "2588366281349374274": {
21
- "error_kind": "fmtstring",
22
- "length": 136,
23
- "item_types": [
24
- {
25
- "kind": "integer",
26
- "sign": "unsigned",
27
- "width": 32
28
- }
29
- ]
26
+ "string": "Storage slot 0 not allowed. Storage slots must start from 1."
30
27
  },
31
- "2709101749560550278": {
28
+ "5019202896831570965": {
32
29
  "error_kind": "string",
33
- "string": "Cannot serialize point at infinity as bytes."
30
+ "string": "attempt to add with overflow"
34
31
  },
35
- "2920182694213909827": {
32
+ "11343565365413149907": {
36
33
  "error_kind": "string",
37
- "string": "attempt to subtract with overflow"
34
+ "string": "Function get_update_delay can only be called statically"
38
35
  },
39
- "3305101268118424981": {
36
+ "14225679739041873922": {
40
37
  "error_kind": "string",
41
- "string": "Attempted to delete past the length of a CapsuleArray"
42
- },
43
- "3367683922240523006": {
44
- "error_kind": "fmtstring",
45
- "length": 58,
46
- "item_types": [
47
- {
48
- "kind": "field"
49
- }
50
- ]
51
- },
52
- "3473764466780631008": {
53
- "error_kind": "fmtstring",
54
- "length": 106,
55
- "item_types": [
56
- {
57
- "kind": "integer",
58
- "sign": "unsigned",
59
- "width": 32
60
- }
61
- ]
38
+ "string": "Index out of bounds"
62
39
  },
63
- "5019202896831570965": {
40
+ "17843811134343075018": {
64
41
  "error_kind": "string",
65
- "string": "attempt to add with overflow"
66
- },
67
- "5533887251808526417": {
68
- "error_kind": "fmtstring",
69
- "length": 120,
70
- "item_types": [
71
- {
72
- "kind": "integer",
73
- "sign": "unsigned",
74
- "width": 32
75
- }
76
- ]
77
- },
78
- "5727012404371710682": {
42
+ "string": "Stack too deep"
43
+ }
44
+ }
45
+ },
46
+ "bytecode": "JwACBAEoAAABBIBLJwAABAMnAgEEACcCAgQAHxgAAgABgEolAAAARSUAAAB9LgQAAYBKKAIAAgSASicCAwQBOw0AAgADKgCAQwAAAAABAAAAACgAgEQAAQAoAIBFBAADKACARgEAACgAgEcEAAAoAIBIAQABKACASQQAASYlAAADkR4CAAIJJwIDAAEKOAIDBCQCAAQAAACeJQAAA7oeAgACAScCBAAALQgBBScCBgQEABABBgEnAwUEAQAoBQIGLQwGBy0OBAcAKAcCBy0OBAcAKAcCBy0OBActDQUGACgGAgYtDgYFKwIABgAAAAAAAAAAAgAAAAAAAAAALQgBBycCCAQFABABCAEnAwcEAQAoBwIILQwICS0OBAkAKAkCCS0OBAkAKAkCCS0OBAkAKAkCCS0OBgktDQUGACgGAgYtDgYFLQ0HBgAoBgIGLQ4GBy0IAQYAAAECAS0OBQYtCAEFAAABAgEtDgcFLQgBBwAAAQIBLgqARwAHLQgBCAAAAQIBLgqARgAIJwIJBAotCAAKLQwGCy0MBQwtDAcNLQwIDi0MAw8AEAAJACUAAAPMLQQAACcCAwQJLQgACS0MBgotDAULLQwHDC0MCA0tDAIOABAAAwAlAAADzC0EAAAtDQgCCygAAoBGAAMkAgADAAAB/CcCCQQAPAkBCScCAgQJLQgACS0MBgotDAULLQwHDC0MCA0AEAACACUAAAT1LQQAAC0NBgItDQUDLQ0HCS0OAgYtDgMFLQ4JBy4KgEgACAEoAAOASQAFLQ0FAgo4AgQDCygAA4BGAAQkAgAEAAACZyUAAAYIHgIAAwUcDAMFBBwMBQQAHAwEAwQvDAACAAQcDAQFBBwMBQIAAjgEAgUJKAAFgEMAAhwMAgUEHAwFBAAcDAQFBAI4AgQGCSgABoBDAAIcDAIGARwMBgQAHAwEBgECOAIEBwkoAAeARAACHAwCCAQcDAgHABwMBwgEAjgCBwkJKAAJgEMAAhwMAgkBHAwJBwAcDAcJAQI4AgcKCSgACoBEAAIcDAILBBwMCwoAHAwKAgQWDAkKHAwHCQQcDAoLBAQ4CQIKFgwGAhwMBAYEHAwCCQQEOAYIAgw4AwUGKAIAAwQOECQCAAYAAANzIwAAA1YcDAQFBAQ4BQIEBDgJAwIAOAQCAy0MAwEjAAADkBwMBwIEBDgCCgQEOAsDAgA4BAIDLQwDASMAAAOQJigAgAQEeAANAAAAgASAAyQAgAMAAAO5KgEAAQX3ofOvpa3UyjwBAQImKgEAAQWdbHCZW9/80zwBAQImJQAAA5EtDQMGLQ0EBwsoAAeARgAIJAIACAAAA/InAgkEADwJAQkLKAAGgEUAByQCAAcAAASBIwAABActDQEGLQ0CBy0NAwgtDQQJDSgACIBFAAokAgAKAAAELCUAAAYaLgQABoADKACABAQABCUAAAYsLgiABQAKACgKAgsAOAsIDC0OBQwBKAAIgEkABQ44CAUGJAIABgAABGwlAAAGui0OCgEtDgcCLQ4FAy0OCQQjAAAE9CcCBgQHLQgABy0MAQgtDAIJLQwDCi0MBAsAEAAGACUAAAT1LQQAAC0NAQYtDQIHLQ0ECC4EAAaAAygAgAQEAAQlAAAGLC4IgAUACQAoCQIKASgACoBHAAstDgULLQ4JAS0OBwIuCoBJAAMtDggEIwAABPQmJQAAA5EuCIBHAAUjAAAFBQ0oAAWARQAGJAIABgAABXUjAAAFGi0NAQUtDQIGLQ0DBy0NBAgnAgkEBC0IAQonAgsEBQAQAQsBJwMKBAEAKAYCCycCDAQEACgKAg0/DwALAA0tDQoGACgGAgYtDgYKLQ4FAS0OCgItDgcDLQ4IBCYtDQMGDDgFBgcBKAAFgEkABiQCAAcAAAWTIwAABf8tDQEHLQ0CCC0NAwktDQQKACgIAgwAOAwFDS0NDQsAKAcCDQA4DQUOLQ0ODAA4CwwNLgQACIADKACABAQABSUAAAYsLgiABQALACgLAgwAOAwFDi0ODQ4tDgcBLQ4LAi0OCQMtDgoEIwAABf8tDAYFIwAABQUqAQABBQLcbieAdhKdPAEBAiYqAQABBcVrxFoOEAACPAEBAiYuAYADgAYLAIAGAAKAByQAgAcAAAZHIwAABlIuAIADgAUjAAAGuS4AAAGABQEAAAGABAABAQCAA4AEgAkuAIADgAouAIAFgAsLAIAKgAmADCQAgAwAAAalLgGACoAILgKACIALAQCACgACgAoBAIALAAKACyMAAAZ0KAGABQQAAQMAgAYAAoAGIwAABrkmKgEAAQVFp8pxGUHkFTwBAQIm",
47
+ "debug_symbols": "7Z3dbts4EIXfxde+4Aw5/OmrFIsgSdPCgJEUSbrAoui7r5yatBOOxXioIDI0N0FV85hHnynOkBSl36tvdze/flxt7r8/PK2+fP292j7cXj9vHu6Ho99/1qubx812u/lxdfzfK7P7A9a8CJ5+Xt/vjp+erx+fV18ACWG9urv/9vJvZ4cv+b7Z3q2+JPqzrooHMGlfOgzFS2FvmMIJPe4LJ4yvCv+zHgzRewzRsaGdzBmZTFYbWZkscjKfTFb5BKmIiKPnonX7wi46HEcdKWTUkWJ4i9qzZ+FjEQ3OzLgdMN7mMwY4NBMgx5Umvy+M5mDdgufaVHKU21RKh2/GkJjSNphMxbpDWc4yIuQvRrR2vDC5sC9LLh4XfeEXlV8Pv4DKr4tfUH49/KK2vz5+2v66+CVtf338vPLr4IfGKL8ufqT8uvgl5dfDD5zy6+Kn47cmv5inJijiW36o+UsfP82fu/hZUH4Nfr6U9a+L7viRXr99/HT80cXP6/Xbx0/bXxe/oO2vj5+2vy5+Uedf+vg55dfFT+dfuvglXT/v46fzLz38rNHxWx8/nX/p4geaPzNQdFGohoKa6TJQnEKpoWhOUEOxmmgyUDR611CchmQGis5T1VBIQzIDRUMyA0WniWoouneCg6IhuYaiuxw4KJrm11B0PwIHRfuUGspCVx4sZMto0VdQltmnjEJxC10jaEBZ5oBwHAosc0DYgOIUSg1FO9oaykJvhm9AWWbyNg7FakthoGhIrqEsdDa/AWWZC+wNKMucox2HQjpKZqBoSK6hLHQnSgOKdrQ1lKCjZAaKthQGyjJDcnC5LAaSF94RjMuM3+cQBB/z4wAhmLc7pF1aZlybkqBexX0EyTgl2ElwmfOtZxEMKT/oBSK8jcUEGkl6CS5z2DghQdRY3EtwmcOMKQlqNtNJcKFbMaYkqNlMJ0GnbbCXoGYznQRJs5legprN9BLUbKaT4EJ3sUxJUCNJJ8GFPoVtSoLaBpsEky3nl1xFMGos7iU4QSyGGHMNePTyLJ7gEP2zeR/xYD5F1jxRMR8OwMG/vJiLkrtg936KPR6f536KfQef6L7dc7iGexttfnuejd69qqIu7U0sj2Qy6fC2OP4FcNFmMDHSq8I78+94LM9Z5oOt+CB9eBX248/CTnEWMfefNhlq/MpEmAPEMFCERulAZf0weNN4/2KwxUhw2HiD4BDJgi9hzZmqCb3jFuWpycR89ZLH1tWCUL4bIfmjSGv/2vcXbZ9mTn/wn+0jUW1/5vQRQrHvU2Xfu3nbt+W9omgBavvpou2Hy6Yf5k4fywZ0S3Xbj3Onj67YPwro2f47Xr33qfadyUbQAWM/XLL9YC6afjBzp48lbDmKlX2YO/2S+qILVccZJhm0fKT9VHIeMjV9pIu2by+bvp05fcLS8xwP+7J9N3P6hCXnIU+1/Thz+6mMtrxxlf137Cectf3Lpu9nTt8fxrre1T2Pnzl9fxjrel/3PGHmQ/XBSbGfQmU/znyipGX/sumnmdNv9Dxp5knDOP1oZp40tOxfNn2Ye8I8OtaN73gA1ozz/Qgzn2Vr2MfLpo8T04fUMDSskZQ7Gow5as3DwtVgKPF3yoAp90GAiYc6/t7akPjcoSViey0YVqSzCMLbjX6Jf6znuAiMAZHKS1R8bzasv5dFQjSpUvEvagZXRotwvBBZVCRSJYmKv6W+qQoSFYnOy4sc8qOO4UcuvzIdTbFlFb+00lKduE5aKi9R8fP3TVUQqMCgSHXivEqqCR5spQInUiWJCoNEZVGkEtHgp7uaKhFDfnIH7OGuN0tYq6JE5VGk8hIV/8CapsqJVCIaUUQ+iupKIvJJQh6NEalOkPflDjcbq94GT8TllipIVIgiVZSorJWo+JuSmipJXEYnyTeQrEglqotPRUPJlIN/++QdsHz0SuUW5xR8peHbYEPjBJp4vuZEmx3N4QdVkKgsiFReonKiupyoLhLVRaK6vKguL/q9gqiuIDov/pXvTZUTqaJElURXCp9Zj/Yxjh+3pnLfUXKM5vx+6cRDqMfrsQJv/Hi1oUnna/ix6jgDd36feeLxqQ0Nz7pMKr3av7LX8NlwQyOoh7/Oj86H0wjaG/8an4Ymna9J58dOMkagofM1glyABLkACXIBQhRozmwHf4ajf68fN9c327unQbH78Nf97fPm4X5/+Pzfz/zJzeNmu938uPr5+HB79+3X493V9uF299nK7P98tSauLaadl93hMNJaD+Oml8HJ7lNr1tbiUOtQ8/8=",
48
+ "brillig_names": [
49
+ "get_update_delay"
50
+ ]
51
+ },
52
+ {
53
+ "name": "public_dispatch",
54
+ "is_unconstrained": true,
55
+ "custom_attributes": [
56
+ "public"
57
+ ],
58
+ "abi": {
59
+ "parameters": [
60
+ {
61
+ "name": "selector",
62
+ "type": {
63
+ "kind": "field"
64
+ },
65
+ "visibility": "private"
66
+ }
67
+ ],
68
+ "return_type": null,
69
+ "error_types": {
70
+ "206160798890201757": {
79
71
  "error_kind": "string",
80
- "string": "push out of bounds"
72
+ "string": "Storage slot 0 not allowed. Storage slots must start from 1."
81
73
  },
82
- "5870202753060865374": {
74
+ "2830029349304997821": {
83
75
  "error_kind": "fmtstring",
84
- "length": 61,
76
+ "length": 27,
85
77
  "item_types": [
86
- {
87
- "kind": "field"
88
- },
89
78
  {
90
79
  "kind": "field"
91
80
  }
92
81
  ]
93
82
  },
94
- "6485997221020871071": {
95
- "error_kind": "string",
96
- "string": "call to assert_max_bit_size"
97
- },
98
- "6753155520859132764": {
83
+ "2920182694213909827": {
99
84
  "error_kind": "string",
100
- "string": "Failed to deliver note"
85
+ "string": "attempt to subtract with overflow"
101
86
  },
102
- "7233212735005103307": {
87
+ "5019202896831570965": {
103
88
  "error_kind": "string",
104
- "string": "attempt to multiply with overflow"
89
+ "string": "attempt to add with overflow"
105
90
  },
106
- "8830323656616886390": {
91
+ "6504213605561840204": {
107
92
  "error_kind": "string",
108
- "string": "Got a public log emitted by a different contract"
93
+ "string": "New contract class is not registered"
109
94
  },
110
- "12099279057757775880": {
95
+ "10019982601749771606": {
111
96
  "error_kind": "string",
112
- "string": "DST_LEN too large for offset"
97
+ "string": "msg.sender is not deployed"
113
98
  },
114
- "13649294680379557736": {
99
+ "11343565365413149907": {
115
100
  "error_kind": "string",
116
- "string": "extend_from_bounded_vec out of bounds"
101
+ "string": "Function get_update_delay can only be called statically"
117
102
  },
118
103
  "14225679739041873922": {
119
104
  "error_kind": "string",
120
105
  "string": "Index out of bounds"
121
106
  },
122
- "14514982005979867414": {
123
- "error_kind": "string",
124
- "string": "attempt to bit-shift with overflow"
125
- },
126
- "14657895983200220173": {
127
- "error_kind": "string",
128
- "string": "Attempted to read past the length of a CapsuleArray"
129
- },
130
- "15366650908120444287": {
131
- "error_kind": "fmtstring",
132
- "length": 48,
133
- "item_types": [
134
- {
135
- "kind": "field"
136
- },
137
- {
138
- "kind": "field"
139
- }
140
- ]
141
- },
142
- "16218014537381711836": {
143
- "error_kind": "string",
144
- "string": "Value does not fit in field"
145
- },
146
- "16446004518090376065": {
107
+ "15573886522241766899": {
147
108
  "error_kind": "string",
148
- "string": "Input length must be a multiple of 32"
109
+ "string": "New update delay is too low"
149
110
  },
150
- "16761564377371454734": {
111
+ "17595253152434889169": {
151
112
  "error_kind": "string",
152
- "string": "Array index out of bounds"
153
- },
154
- "16775516380094354375": {
155
- "error_kind": "fmtstring",
156
- "length": 40,
157
- "item_types": []
113
+ "string": "offset too large"
158
114
  },
159
- "16954218183513903507": {
115
+ "17843811134343075018": {
160
116
  "error_kind": "string",
161
- "string": "Attempted to read past end of BoundedVec"
162
- },
117
+ "string": "Stack too deep"
118
+ }
119
+ }
120
+ },
121
+ "bytecode": "JwACBAEoAAABBIBRJwAABAMnAgIEAScCAwQAHxgAAwACgFAuCIBQAAElAAAARSUAAADFKAIAAQSAUScCAgQAOw0AAQACKACAQwAAAywAgEQAAAAAAA6S+filNOhY/Pd32iBuCLDGIOz53rIdE0eYE/YoAIBFBAAZKgCARgAAAAABAAAAACgAgEcAAQAoAIBIBAADKACASQEAACgAgEoEAAAoAIBLAAAAKACATAEAASgAgE0EAAEoAIBOAAABKACATwQABCYlAAAK8SkCAAIA+pECywo4AQIDJwIEBAAnAgYEAwA4BAYFLQgBAgAQAQUBJwMCBAEAKAICBS0OBAUAKAUCBS0OBAUnAgUEAwA4AgUEJwIEACskAgADAAABIyMAAARpLQgBAycCBQQCABABBQEnAwMEAQAoAwIFHySATYBNAAUtDQMFACgFAgUtDgUDLQgBBQAAAQIBLQ4DBS0IAQMAAAECAS4KgEoAAycCBwQILQgACC0MBQktDAMKABAABwAlAAALGi0EAAAtDAkGASgABoBNAAUtDQUDLQgBBQAAAQIBLgqASQAFLQgBBgAAAQIBLgqASwAGLQgBBwAAAQIBJwIIAF0tDggHHgIACAEeAgAJADM4AAgACQAKJAIACgAAAeolAAALdzMoAAOAQwAJJAIACQAAAf8lAAALiScCDQQOLQgADi0MBQ8tDAYQLQwHES4IgE4AEi0MBBMtDAgUABAADQAlAAALmy0EAAAtDA8JLQwQCi0MEQstDBIMJwINBA4tCAAOLQwJDy0MChAtDAsRLQwMEgAQAA0AJQAADM0tBAAALQwPBS0MEAYtDBEHLQgBDQAAAQIBLQ4FDS0IAQUAAAECAS0OBgUtCAEGAAABAgEtDgcGJwISBBMtCAATLQwJFC0MChUtDAsWLQwMFwAQABIAJQAADngtBAAALQwUBy0MFQ4tDBYPLQwXEC0MGBEeAgASBRwMEhQEHAwUEwAcDBMSBCcCFAQVLQgAFS0MBxYtDA4XLQwPGC0MEBktDBEaLQwSGwAQABQAJQAAD0ItBAAALQwWEwA4EhMUDjgSFBUkAgAVAAADMyUAAA+xLQ0NEy0NBRUtDQYWDDgSFhcWDBcSHAwXFgAcDBIXAAQ4FhMSBDgXFRMAOBITFS0OFQ0tDgMFLQ4UBicCBQQWLQgAFi0MCRctDAoYLQwLGS0MDBotDBUbLQwDHC0MFB0tDAceLQwOHy0MDyAtDBAhLQwRIgAQAAUAJQAAD8MtBAAAHAwUBQAnAgcEBScCCgQDADgHCgktCAEGABABCQEnAwYEAQAoBgIJLQ4HCQAoCQIJLQ4HCScCCQQDADgGCQctDAcJLgqARAAJACgJAgktDggJACgJAgktDhUJACgJAgktDgMJACgJAgktDgUJJwIDBAUAKAYCCC0NCAcnAgkEAgA4CAkFNw0ABQAHLQ0CAwAoAwIDLQ4DAgAoAgIGLQ0GBScCBwQCADgGBwM7DQADAAUjAAAEaSkCAAMADkFstAo4AQMFJAIABQAABIQjAAAHky0IAQUnAgYEAgAQAQYBJwMFBAEAKAUCBh8kgE2ATQAGLQ0FBgAoBgIGLQ4GBS0IAQYAAAECAS0OBQYtCAEFAAABAgEuCoBKAAUnAggECS0IAAktDAYKLQwFCwAQAAgAJQAACxotBAAALQwKBwEoAAeATQAGLQ0GBRwMBQcEHAwHBgAcDAYFBC0IAQYAAAECAS4KgEkABi0IAQcAAAECAS4KgEsABy0IAQgAAAECAScCCQAxLQ4JCB4CAAkBHgIACgAzOAAJAAoACyQCAAsAAAVaJQAAC3cNKAAFgEUACgsoAAqASQALJAIACwAABXclAAAS0icCDgQPLQgADy0MBhAtDAcRLQwIEi4IgE4AEy0MBBQtDAkVABAADgAlAAALmy0EAAAtDBAKLQwRCy0MEgwtDBMNJwIPBBAtCAAQLQwKES0MCxItDAwTLQwNFAAQAA8AJQAADngtBAAALQwRBi0MEgctDBMILQwUCS0MFQ4tCAEPAAABAgEtDgYPLQgBEAAAAQIBLQ4HEC0IAREAAAECAS0OCBEtCAESAAABAgEtDgkSLQgBEwAAAQIBLQ4OEx4CABQFHAwUFgQcDBYVABwMFRQEJwIWBBctCAAXLQwGGC0MBxktDAgaLQwJGy0MDhwtDBQdABAAFgAlAAAPQi0EAAAtDBgVDDgVBQYkAgAGAAAGrSMAAAaNAjgVBQYOOAUVByQCAAcAAAakJQAAEuQtDAYDIwAABrguCIBKAAMjAAAGuAA4FAMGDjgUBgckAgAHAAAGzyUAAA+xLgqATAAPLQ4VEC4KgEwAES0OBRItDgYTJwIHBBQtCAAULQwKFS0MCxYtDAwXLQwNGAAQAAcAJQAADM0tBAAALQwVAy0MFgUtDBcGLQ0PBy0NEAgtDREJLQ0SDi0NEw8nAhAEES0IABEtDAoSLQwLEy0MDBQtDA0VLQwDFi0MBRctDAYYLQwHGS0MCBotDAkbLQwOHC0MDx0AEAAQACUAAA/DLQQAAAAoAgIGLQ0GBScCBwQCADgGBwM7DQADAAUjAAAHkykCAAIABVV7+go4AQIDJAIAAwAAB64jAAAJJC0IAQIAAAECAS4KgEkAAi0IAQMAAAECAS4KgEsAAy0IAQUAAAECAScCBgAOLQ4GBR4CAAYJCygABoBOAAckAgAHAAAH+CUAABL2HgIABgEnAgsEDC0IAAwtDAINLQwDDi0MBQ8uCIBOABAtDAQRLQwGEgAQAAsAJQAAC5stBAAALQwNBy0MDggtDA8JLQwQCh4CAAIFHAwCBAQcDAQDABwMAwIEJwIMBA0tCAANLQwHDi0MCA8tDAkQLQwKEQAQAAwAJQAADngtBAAALQwOAy0MDwQtDBAFLQwRBi0MEgsnAggEDC0IAAwtDAMNLQwEDi0MBQ8tDAYQLQwLES0MAhIAEAAIACUAAA9CLQQAAC0MDQccDAcCACcCBAQBJwIGBAMAOAQGBS0IAQMAEAEFAScDAwQBACgDAgUtDgQFACgFAgUtDgQFJwIFBAMAOAMFBC0MBAUtDgIFACgDAgUtDQUEJwIGBAIAOAUGAjsNAAIABCMAAAkkJwICAlUnAgMCbicCBAJrJwIFAm8nAgYCdycCBwIgJwIIAnMnAgkCZScCCgJsJwILAmMnAgwCdCcCDQJyJwIOAnsnAg8CfS0IARAnAhEEHAAQAREBJwMQBAEAKBACES0MERItDgISACgSAhItDgMSACgSAhItDgQSACgSAhItDgMSACgSAhItDgUSACgSAhItDgYSACgSAhItDgMSACgSAhItDgcSACgSAhItDggSACgSAhItDgkSACgSAhItDgoSACgSAhItDgkSACgSAhItDgsSACgSAhItDgwSACgSAhItDgUSACgSAhItDg0SACgSAhItDgcSACgSAhItDg4SACgSAhItDggSACgSAhItDgkSACgSAhItDgoSACgSAhItDgkSACgSAhItDgsSACgSAhItDgwSACgSAhItDgUSACgSAhItDg0SACgSAhItDg8SCyCASYBMAAIkAgACAAAK8CcCAwQeLQgBBCcCBQQeABABBQEtDAQFKgMABQUnRkiy9UEXvQAoBQIFACgQAgYnAgcEGy4EAAaAAy4EAAWABC4EAAeABSUAABMIJwIGBBsAOAUGBS4KgE0ABQAoBQIFLQ4BBQAoBQIFPA0EAyYoAIAEBHgADQAAAIAEgAMkAIADAAALGSoBAAEF96Hzr6Wt1Mo8AQECJiUAAArxLQ0BAy0NAgQLKAAEgEoABSQCAAUAAAs8JQAAE04BKAADgE0ABS0NBQQtCAEFJwIGBAIAEAEGAScDBQQBACgFAgYtDAYHLQ4EBy0OAwEuCoBNAAItDAUBJioBAAEFiw4hFpDjtVY8AQECJioBAAEFWkOb0D7Gskw8AQECJiUAAArxKwIABwAAAAAAAAAAAgAAAAAAAAAAJwIMBA0tCAANLQwHDgAQAAwAJQAAE2AtBAAALQwOCC0MDwktDBAKLQwRCy0NCAcAKAcCBy0OBwgtDQkHACgHAgctDgcJLQgBBwAAAQIBLQ4IBy0IAQgAAAECAS0OCQgtCAEJAAABAgEtDgoJLQgBCgAAAQIBLQ4LCicCCwQMLQgADC0MBw0tDAgOLQwJDy0MChAtDAQRABAACwAlAAAUAC0EAAAnAgQECy0IAAstDAcMLQwIDS0MCQ4tDAoPLQwGEAAQAAQAJQAAFAAtBAAAJwIGBAstCAALLQwHDC0MCA0tDAkOLQwKDwAQAAYAJQAAFSktBAAALQwMBAsoAASASwAGCygABoBJAAckAgAHAAAMzCUAABWdJiUAAArxLQgBBicCBwQEABABBwEnAwYEAQAoBgIHLQwHCC4KgEsACAAoCAIILgqASwAIACgIAgguCoBLAAgtCAEHAAABAgEtDgYHLgiASgAFIwAADSINKAAFgEgAASQCAAEAAA4pIwAADTctDQcBLQ0BAgAoAgICLQ4CAQEoAAGATQADLQ0DAicCAwQCADgBAwUtDQUEASgAAYBIAAYtDQYFLQgBAScCBgQEABABBgEnAwEEAQAoAQIGLQwGBy0OAgcAKAcCBy0OBAcAKAcCBy0OBQctDQEEACgEAgQtDgQBJwIFBAYtCAAGLQwBBy4IgE0ACAAQAAUAJQAAFa8tBAAALQwHBCcCBgQHLQgABy0MAQgtDAMJABAABgAlAAAVry0EAAAtDAgFASgABIBNAAMtDQMBASgABYBNAAQtDQQDHAwCBQQcDAUEABwMBAIELQwCBC0MAwItDAQDJi0NBwEcDAUCAAA4BAIDLwwAAwACLgQAAYADKACABAQABCUAABYvLgiABQADACgDAgYAOAYFCC0OAggtDgMHASgABYBNAAEtDAEFIwAADSIlAAAK8S8MAAQABRwMBQYEHAwGBAACOAUEBgkoAAaARgAEHAwEBgQcDAYFABwMBQYEAjgEBQcJKAAHgEYABBwMBAcBHAwHBQAcDAUHAQI4BAUICSgACIBHAAQcDAQJBBwMCQgAHAwICQQCOAQICgkoAAqARgAEHAwECgEcDAoIABwMCAoBAjgECAsJKAALgEcABBwMBAwEHAwMCwAcDAsEBBwMCAsEBDgLBAgcDAUEBAQ4BAkFLQwKAS0MBwMtDAgCLQwFBC0MBgUmJQAACvEMOAYFCCgCAAUEDhAkAgAIAAAPhiMAAA9gFgwDARwMAwIEHAwBAwQEOAIEAQQ4AwUCADgBAgMtDAMHIwAAD6wWDAEDHAwBBAQcDAMBBAQ4BAIDBDgBBQIAOAMCAS0MAQcjAAAPrC0MBwEmKgEAAQVFp8pxGUHkFTwBAQImJQAACvEcDAcOABwMDAcAJwIMAAInAg8AICcCEQQSLQgAEi0MDBMtDA8UABAAEQAlAAAWvS0EAAAtDBMQBDgHEA8AOA4PBxwMCg4AJwIKAEAnAhAEES0IABEtDAwSLQwKEwAQABAAJQAAFr0tBAAALQwSDwQ4Dg8KADgHCg4cDAsHACcCCgBIJwIPBBAtCAAQLQwMES0MChIAEAAPACUAABa9LQQAAC0MEQsEOAcLCgA4DgoHHAwICgAnAggAaCcCDgQPLQgADy0MDBAtDAgRABAADgAlAAAWvS0EAAAtDBALBDgKCwgAOAcIChwMCQcAJwIIAHAnAgsEDi0IAA4tDAwPLQwIEAAQAAsAJQAAFr0tBAAALQwPCQQ4BwkIADgKCActCAEIJwIJBAQAEAEJAScDCAQBACgIAgktDAkKLQ4HCgAoCgIKLQ4FCgAoCgIKLQ4GCi0NCAkAKAkCCS0OCQgrAgAJAAAAAAAAAAADAAAAAAAAAAAnAg8EEC0IABAtDAkRABAADwAlAAATYC0EAAAtDBEKLQwSCy0MEwwtDBQOLQ0KCQAoCQIJLQ4JCi0NCwkAKAkCCS0OCQstCAEJAAABAgEtDgoJLQgBCgAAAQIBLQ4LCi0IAQsAAAECAS0ODAstCAEMAAABAgEtDg4MLgiASgANIwAAEb0NKAANgEgAASQCAAEAABKIIwAAEdInAgMEDS0IAA0tDAkOLQwKDy0MCxAtDAwRABAAAwAlAAAVKS0EAAAtDA4CLQgBAycCCAQFABABCAEnAwMEAQAoAwIILQwICS0OBwkAKAkCCS0OBQkAKAkCCS0OBgkAKAkCCS0OAgkuCIBKAAEjAAASQw0oAAGATwACJAIAAgAAElkjAAASWCYcDAECAAA4BAIFACgDAgYAOAYBBy0NBwIwDAACAAUBKAABgE0AAi0MAgEjAAASQwAoCAICADgCDQMtDQMBJwICBA4tCAAOLQwJDy0MChAtDAsRLQwMEi0MARMAEAACACUAABQALQQAAAEoAA2ATQABLQwBDSMAABG9KgEAAQXYIY9HKnbV8zwBAQImKgEAAQUohpKwR9z9QzwBAQImKgEAAQWdbHCZW9/80zwBAQImAQCAA4AFgAcuAIADgAguAIAEgAkLAIAIgAeACiQAgAoAABNNLgGACIAGLgKABoAJAQCACAACgAgBAIAJAAKACSMAABMcJioBAAEFxWvEWg4QAAI8AQECJiUAAArxLQgBAicCAwQEABABAwEnAwIEAQAoAgIDLQwDBC4KgEsABAAoBAIELgqASwAEACgEAgQuCoBLAAQtDQIDACgDAgMtDgMCLQgBAycCBAQFABABBAEnAwMEAQAoAwIELQwEBS4KgEsABQAoBQIFLgqASwAFACgFAgUuCoBLAAUAKAUCBS0OAQUtDAIBLQwDAi4IgEoAAy4IgEkABCYlAAAK8S0NAwYtDQQHCygAB4BJAAgkAgAIAAAUJicCCQQAPAkBCQsoAAaASAAHJAIABwAAFLUjAAAUOy0NAQYtDQIHLQ0DCC0NBAkNKAAIgEgACiQCAAoAABRgJQAAE04uBAAGgAMoAIAEBAAEJQAAFi8uCIAFAAoAKAoCCwA4CwgMLQ4FDAEoAAiATQAFDjgIBQYkAgAGAAAUoCUAAA+xLQ4KAS0OBwItDgUDLQ4JBCMAABUoJwIGBActCAAHLQwBCC0MAgktDAMKLQwECwAQAAYAJQAAF70tBAAALQ0BBi0NAgctDQQILgQABoADKACABAQABCUAABYvLgiABQAJACgJAgoBKAAKgEoACy0OBQstDgkBLQ4HAi4KgE0AAy0OCAQjAAAVKCYlAAAK8S0NBAULKAAFgEkABiQCAAYAABVLJwIHBAA8CQEHJwIFBAYtCAAGLQwBBy0MAggtDAMJLQwECgAQAAUAJQAAF70tBAAALQ0BBS0NAgYtDQMHLQ4FAS0OBgItDgcDLgqATAAEASgABoBNAAItDQIBJioBAAEFAtxuJ4B2Ep08AQECJiUAAArxASgAAoBNAAMOOAIDBCQCAAQAABXOJQAAD7ENMIBIAAMABAsoAASASQADJAIAAwAAFeslAAAYyw0oAAKASAADJAIAAwAAFgAlAAATTgAoAQIEADgEAgUtDQUDLQgBAScCAgQCABABAgEnAwEEAQAoAQICLQwCBC0OAwQmLgGAA4AGCwCABgACgAckAIAHAAAWSiMAABZVLgCAA4AFIwAAFrwuAAABgAUBAAABgAQAAQEAgAOABIAJLgCAA4AKLgCABYALCwCACoAJgAwkAIAMAAAWqC4BgAqACC4CgAiACwEAgAoAAoAKAQCACwACgAsjAAAWdygBgAUEAAEDAIAGAAKABiMAABa8JiUAAArxLQgBBAAAAQIBLgqATgAEJwIGBAInAgcBAS0IAQUnAggEIQAQAQgBJwMFBAEAKAUCCCcCCQQgQwPwAAIABgAJAAcACCcCCgQgLgQACIADLgQACoAEJQAAGN0nAgIEIScCBgQgLgiATQADIwAAFzAMOAMCByQCAAcAABdHIwAAF0ItDQQBJi0NBAcEOAcHCAI4BgMHDjgDBgkkAgAJAAAXZyUAABLkDDgHBgkkAgAJAAAXeSUAABNOACgFAgoAOAoHCy0NCwkcDAkHAAQ4CAEJBDgHCQoDMIBOAAcACQQ4CQgHADgKBwgtDggEASgAA4BNAActDAcDIwAAFzAlAAAK8S4IgEoABSMAABfNDSgABYBIAAYkAgAGAAAYOCMAABfiLQ0BBS0NAgYtDQMHLQ0ECC0IAQknAgoEBQAQAQoBJwMJBAEAKAYCCicCCwQEACgJAgw/DwAKAAwtDQkGACgGAgYtDgYJLQ4FAS0OCQItDgcDLQ4IBCYtDQMGDDgFBgcBKAAFgE0ABiQCAAcAABhWIwAAGMItDQEHLQ0CCC0NAwktDQQKACgIAgwAOAwFDS0NDQsAKAcCDQA4DQUOLQ0ODAA4CwwNLgQACIADKACABAQABSUAABYvLgiABQALACgLAgwAOAwFDi0ODQ4tDgcBLQ4LAi0OCQMtDgoEIwAAGMItDAYFIwAAF80qAQABBfQu5YS79CHRPAEBAiYoAIAGBAACBwCABIAGgAUuAIAEgAgoAIAJBAAADQCACYAFgAoXAIAKgAokAIAKAAAZXAMAgAgAAoAIAQCAA4AJgAsuAYALgAYBAIADgAiACy4BgAuABwEAgAOACYALLgKAB4ALAQCAA4AIgAsuAoAGgAsBAIAJAAKACSMAABj5Jg==",
122
+ "debug_symbols": "7V3briS3rf2XeZ4HURJJMb8SHBi24wQDDOzAdg5wEPjfT+1LqWtPsVpoWlKzu/xizHhq9VqkKFF3/ffTP3764T//+u7Lz//85bdPf/v7fz99/eXH73//8svPy9/++8fnTz/8+uXr1y//+m77vz+Fl//EEF8Bv/37+59f/v7b79//+vunvyUo8vnTTz//Y/ljAl5+4p9fvv706W+l/PE/nz9FAAuINFAsTO+g5Y/lW1AEC8jClCxMCQ2gHCwgCxNamDBbQGIAUbKAigEkauFCDvkdBJlxC/q8/zjkVNavQ2apn1N448DhHCmECRwT7IAJdsAEO6IawYAQVhSW8E0wpsgGUIoWEBlAevPUAqEFJAYQWlyOxQAitSEEwTXLgTBfD6AC67cl5fppwvxGIIMJOI0m4MEEBUYT0GACGW3BQd7pSNAhTANXAv5AsP+Wcc3kTJf2OfJri5sDOxKj94MjwZo0InG+Loa5VDWw6TQLvjHgaIYYhjPQaIY03IY0vBzy8FjKw23A4eWA422QP82AiyPeP8ZMl8EIBuXjvDS57x/nkuO2h6k0Xchx1Y6Fv+mOZr3Hcpv2RfGqHYka2olg1U4cWtoDVu0Rdto7+B0DVO0Rr2sH5DUMgFK6rn1JL+svC21S5Lt2vRtk106y1f7CUHA0g/z5uouEaWWgTRYe7n8pXbVzDt94BwONZujQl8CSK0MR3jHQaIYOfYkWQx7OUEYz6EP5rgzDbcjDbcjDoxWH1zgcbgMNr3E0vMbR8Gjl4dHKfUtaMF7PnhH58svhkkyAXnuxWMCZHnSmR3zpkeRMD7vSQ8FXPFPwVd8JnPkHfNV3Al/1naKv+k7RWX1PzuI5OavvOTjTk53pcVbf0Vl9R2f1naIzPbPr+9Li1V/GtNPD4EwPOtMjvvSU5EwP+9IjzuJZfNV3Dr78w8FXfefgq74z+KrvDL7qO0dn8Rynx3NZFz8jw8f+xv5rCvVrCvJh16GyrlrqHsVS8NstipzCPS2VnecT+tKTnfknz/YPZ6l6eF9TMDjTk53pKb70TB9JtfSQLz3sLJ7ZWTyzs3iePpJq6XHmH3FW36ePpOTS0xPc5dMyfSTV0uPMP5Cd6Zk9shOq8SybhX29Z14S1Q2YebN5NAG8qp++rtNXPT+y+ulrRrepzzlU9Zu4f1G//xokrNtwQTLsbaXz2Dp9hNY1KqeP57qqx4f2PT607+mhfU++fX+lhXpV77sX0lDPvnshLfWTeyEp0Dojl8LmSPjaIy3RmR7ypUeCMz3ZmZ7iSo8EX/EswVc8C/iKZwFf8SzgLJ6js3iOzuI5OYvn5Cyek/jSk535J//5+k4prl0+Sjld17N0cN6/FfhwTFiZOihSL2hY/kyXhfVlmvFVfIeNl1bx8cOB6FcxxZEY8uQZ8uSZDsfFOophR2KKJ88UT57psKGxoxjyIwZCCK7UoCc14Mo3HUYaHdVEV76JruImiic1yVXcJEd9iZcbJF2pcZQzIaCj7sSiZnbW5FDVtO6/4bppVArQTjrB40p/XK9zeFzp+LDSy+N6vRguJocgwYRCE+rgHu9YLii57twXwfWK5SDx2xMJsGShGSRlAsnBsZ/OJDMs0TuU16/0X8wvFpSeaLvezA1AYQYJTiDhGZbwDEvKDEuK4a5vAIkmlOEqd4j6luQmCi0oCCZUNqEsno+WO/QX1OC70yHqg9quDGU0g35NX1cGGs2AMJxhuA0HyagnQ4doveFedMC6wAi4WWBMCd/0cHSmh+6oR/Z6ejxs0FWPM//I6OvQ4eDBnp4UKYTxFDScAsZbAePLIsJ4ivFWpPFlkSZY0WH5Iud11ECZGltcOl6yD6nD/hzCugWacLNrRRff75Z9SLmH56XeToEg18V3vOYdUodbyz6Ipw9Tf68UHY4ttCh6TBtTjWfaflwpynCKDrvQWxQdNnI3KTpUB4Y1wpdv8VuKZXJjPEUZTgFxPAUNp+ixpaBFMd6KNN6KND5o0/iql8dbkcdXPRxf9XB80NL4oKXOxc2N549SrB3FFOXyy+8bp6HHm0Z9BXU4GNhZEDsT1OHhhM6C0Jsgb0Et3qq9OPMQBmfVHoOzat/j9a3OgpxVewRvQR29BXX0FtQpehNEzgTl4E2Qt2qfvVV79FbtsTgTRN6qPXmr9uwt27O3as/eqn3J3gTNrvYprjt3lxU6+CBI+el+N4hDj8fp7KZuVseq76X4EkTBmYcoTPcQQxUk0ojOFMumcl12oacgb/IhPbZ8fmj5ER5bPj62fHlo+emxq2567KqbH7vqZnpo+fjY3sfHbjjRd8OJ9cxhws1GqCqfXbc8meoVn5lK3Msv8bHlP7b3xXXVbcnnGFzLv+xszyWLIt+391vy02N7P7ke6zblZ9cd5rZ811m3KR8f2/u++zxN+fTY3qfZnYac67Tfkkg/yH8VxNGbIHImqARvgrI3QcWZIPEW1OKs2pfgzEM9HjnrKwicVfsez651FuSs2pfoLaijt6BO3oI6eQvq6UPDnOpV6jnjXtD0wV5TEDsTNH0OvSkIvQkSZ4LIW1CTt6Bmb0HN3oKavQV18RbUxVtQi7egFmdBLSF4E+TOQxPuGz16QKszyYRbOiWmGSQzLEmW+0YPniJqoWj4FUnCYTzF8Gt5pMB4ivFWyPiykNERFcPwq8Nij6dQWhQw3ooOM2kQMa7rQsufNzeCi7YuxEuT9v41L59v27b9xxLrO8lLy4rfNISLfOkuH3c+6nA0sU3S4d6wNkmPE3sSVg6S1v1VHW8OW8R36H6VSrHY8eHmsFeKDg+2NynyeIoynKLHKbkWBQ2n4PFW8HgryvigLeOrnoy3QsZXPRle9SDE8RTDgxagc3HnxjWQqaQ6yin08USi8tP9DgAupuIdTeX07bRBhBi8CfLmoTTdQ2W90Dkt00yKIPQmSJwJ6rE22FcQOxPUY22wryBvQU3eqj2585C3as/eqj17q/bFW7Uv3oK63DOoQfaCeg9U/ryg4ktQ7D0I+vOCyJkgCN4EOQvqCN6COnoL6sjOBCVvHkreqv3BDL/QugqUQgrXBS1ju1U9ZLjclfT+utDCoSbwFKRuJ4XdOnKM+tx6E2XiIhOXfgN2EyUWFJu42MSlb8ZqoooFpR83aaLYgEohmlBkQcFBROVSUbFVrxrbOuLBO069SWQCScwzSGZYkm8t+DcUWlBo4kITF5m4yMTFJi42cRUTVzFxiYlLLFw5BBPKxAUmLsgmlFhQ0cQVTVzJxHXwuHcDlaMJxRaUPh/cRJEFZWptsqm1yWQqZTaVMptK+ahD1kCZSllMESWWUsYAJpSllNHURqGpjUJTG3VwxX4TZYmog8vqmyhLRGE2lXI2RZSpR4SmHhGiqZTJFFFkKmU2RRSbSrmYIqqYSllMEWXqR5GpH0Uhm1CWiDq4vreJskQUxWhCWSKKEphQlogi06iNTKM2yqZSRlNEoamUyRRRZCplNkWUvk0yZan7dDDRH1eH8nUWdfPSek5vP69fE9Pt5w/6WN1+nkf+PB/02rr9/NCiZRir/mBKrtfPH/T2ev28fp10v58fqz6PVX/Qbvf6eRwbOTQ27mlsreWx6semEy5x7M+Pbe9lrO9lqO8PrlzBers1ls3t0JjfQPpUVwukVmCqF1FTwj1I72o1QHptaIFUPxNcQLQH6R2hFkht5rGuElPgPUjvE7VAfDtIQrSALExgYdIfZm+A9C36hOsa5dLNVkDZANLDCAKt+wwAYLNDfoEpq2iVIoYNBZBWtyWvRytY5PLL8eVU/L7Z4DUyl2n4y7fa1ogYYf3hGDdXxMe3hTzRY+vpDE1Brw/PaOg5QjcdnAN/RkPxJIbGs5SonpOe0dByEkPTWdJLOkt6yWdpjPJZGiN9ausJDdUfoHhGQ88yeqGzpBc6S3rhs6QXPsvohc+SXspZ0ks5y+hFzpJe5CTpBfTtC89o6EnSC4STpBeAk4xHAZ4mvSRYJccUaWdofJoOQ8vQpxmPNgxNT5NeWoY+TXppGfo06aVhaD5LY5TP0hjh04xeWoaepUTpLOnleaY7G4Y+z3Rny9B8FkPPMnopZ0kv5SyNkZylMZKTjF5iOEmJxvA06YXz+m1kzHtDn2Y82jAUnmY82jL0aUYvDUPj04xeWoY+TXppGXqWxiidJb08z3Rnw9Dnme5sGaqnFyj12ta4fS1WNRRR6pm/Ei8cot6SKLhaCrI5RPZ+62w6uKX1nor0c5j3VKQf8rynIn24nwnWk7qZcv4AUyoBlvX+TKbQeM2RI651cflj3n78JoicCdKPSt9TkDMPpeDMQwfX+95RkH54756CvHkoeoshfXPDHQUlZy110m9+uaOg7M1D2VsM0XwPlVAFFdgJ0jdXjxSUqHbYEyuCuhQZXwRtLjpTBb0sRLx/vIy8N9dApPymqE//o6sicqbo4GLskYpi7YQvyTR/UKT0wgPX8Wcol/vlk9rBL1V12YwS9W+v3tqy+KX85RfNLxD/8ovqF/7LL5pf4l/xovuF/vKL5hd9YvkvvyTv+Yig+oXDXn/23g609Htv3xv68cH9jw/uf3pw/5P3fNXQz97HOS39+OD65bH1F+/9kpb+m/sPrzCJNhhbYHi0HFL7XEs1Lg0nA6X1Xtrlg00PDdI7CU0gOVq26EuSJ5DEGZZEnECSZliSZpTJ0WDgNpKyPmoLDGVPktMMEp5AgjCDBCeQUJhBMsUSmUDCPUKYUSpJyR9IlK+hHuUH2DxHHVldUqn7pZjww7ev8gs8tvweccRSH5gtmy7TBPmSHlt+j5a1pFDlZ9pVMApxBskMS2KX8VW/9V2KMltQhnUIwTnuBfWZmb1pwbk+Kq4Lmu6hZdH9Iihe/xggMW1qs+z05+khd30FnxC8CSrOBJGzTRdE4kwQZ2+CvHnI28YdKuxLEOtH+hDj2p4ugy3w27AfvHqHWBM+Umw5NEKVFEH2HRbW52V6k/SwZGFZSSLiniSFLiRcSUgUktKBJIW1hxQTwJ5EnzLpTTLDEuxiSazX2iVlGouxiyUxVxJOexJ94epGkhzWCbmYQSHRT6f0JplhSeliSayVMWNRSLpYUtNBzKyEsOQeJPWhsYhBsURkPEkJeQZJD0sw1ujapuhKArkLSW27kPb5pOhbzm4lkZoZKWSFhCeQpBmWpB6W0CXHU1aiK8cuJLVZIVKiC3t0JC5zyi9PRyskOIGEZlhCMyzhGZYwTmggSxhPIvp73EvfvB5pDmGTtZfBxwLLB28Q0bKG9w5b6ktoaJM6YBLZ2CFR25xQUj1WUPbd7UUQzhZ0OecgoAjC2R6SmKqgBIogdCaIvHmI3HlInAnS1zfvKYidCdIP6d9TkDcP6Yfk7ilofurAi6DdeCJDuGNylUSKoOkNI16KrCgegumpo0gVtO8QLoLQmaDozUNHr53fT1BxJihFb4LYmaDszUOZnAmaP+rAdQIuhwCKILxbLlsExb2g2aOOHC7LmoGCIghnC6JcBbHiIQ7eBLnzkDgTVJI3QexMkERvgpx5KAbwJmh6ta9rCoug/TAowv3GZS8zHYqg6R6qu4uX/vN+XBZnjzoWFTW5Lt1VRRA6E5S8eShlb4KKM0GzRx1tQexMEHrzEJIzQfNHHXUR/mXYrAi647gMctoLmj7qgLrEuXQ1giJoduqIoSbXCEqRleBNkDsPiTNBkrwJYl+CUojeBHnzEIA3QdP71PVE6SJon1xTvOO4LO6PAS+CZnsoc52FzUUUQeJM0PRRR1OQNw9lbx7K3jyEyZsgdiaIojdB5EwQgzdBQ1PHG4UMpyh5PEWHaSIIqd6WEJAaZTfuAaFYr2GIMaXtxy+m5iCnMRXyeUw9TwDHeB5T+TSmpvOUaqLTmNrjZMejmHqeZJPPk2zwPM0SnqdZIjiPqXgeU88zsuHzJBs+T7Ip50k25TwjGzlPspHTJBsMpxnZYDhNssFwmmSDkM5j6mmSDcbTJBuMpxmvYn6mUsWLqUQ7U+mJ+sCc6703jHlv6hM1Sw1T+YkCuGXqE/WBW6Y+0YRLw9TyRL2llqnnaZbkPMlGTlOqFE6TbOjgVCvVO0aJMjdMLZdHgUsoF/H6u34JL+/6bW5FXndS0cH2ojsqOtgFdE9F7nwU3fkouvNRSu4UsTdFB6db76mIvCnS36m5qyJ3WeTghOsdFXEXH9WjPiVsbpbXX/XgS5+CN29+0XvqF54tqNB6owUXLt8K4hCnC6oX++mC5nvo8ihaKbITBNGbIG8eijBdUJIqSML1jwFyuTxxuExA7/WzH/2vgp5pV2K6vMuRNjedxtXUJ5qNapiK5ylVfKIV2QSpmhp3Sx9MTzTH2DL1iWajGqY+09JHy9QnWvpomfpMyea6qc+09NEy9TzN0jMtfbRMPU2plmda+rhuqhy8/5TX3iRuHvKqGLkdo2+1b2AMPMXAUww8+i1SDczNPBhCvh2j34nawODtGH2aAcs6SscS9xi8HXPwNux1jD62qxvEaLc/bMGU2zH6a68NjIEHDTxo4DnYOHYdY+Bhgz0HvcWrmGKIAwkGDN6MAb0uQKiL1RA2k3sVJRaUvuy2TL/VJAW8q0Wg75hsosSC0mdjmqiio+pLcBDD3ht6JEGuE4ywfQF8Reld+CaKLSj9uEsThQZUDBa7IoAJpS4kLoVcSxk37/iuKP2yiiZKLCg9c7RQ+hH9JgotKDRxHdSvy8uwQLBroyJFE4otKEYLqgQTyuQN/YKjFkosPkz6IGRpyCsqYdyjyILSe4xNVDahigV10AK0UCZvJJPnk4krmzyfTZ7PJs/jgefrMjakAntUsaD00WgLxcGEIguqgAklFpRY8nISS38jBzChTFx6Xb6+SXNB6eVF9Uo64LDnOsjmDZS+AauJYgtK38i0dFHXoTcUoD2KLCh9Q1ATlU2oYkFxNKFM3igmzxcTl5g8LybPi8XzGKIJZfEGQjChLN5A/SZqkEvWk6ygigV1UCslwQW1uSwb4Q12UMGaMDHB9PeZmzD9Wo0PsM02mwqTYIMVC4wCmWD6WDaGuk9pmURABSYmmL69qQnT7/ZbYHCBkQJjEyzb2PSNwjHUK3aXPyoFoA9p2zA0wcjGRjY2trHpKyYtWNG7SaXURnL54wUG5Q2lT7E3UWhB6ZOKRWLdr7cshm1RyqpWoVpXyqbnXCloOAWOt0KP7q4Uek3oSzHeCh5vBY+3ooy3Qh9R9qUooykk5OEUMLwsJB20UXVtf/lj3KH0WVwJsKZlCYx7lFi46CBaSm3et1sVKqocKKxXx4cYdih9PbCJMnHpI7gWSl+RaaIMXHSw6t9EyQEqXlCwQ0E2oUxcMTVRaW9XPCjlhBWV0w6VUrOm5LxHHXDlcqlfe4X5oJTr9gmlVlJAuL0uLyiyoPRE30Lp+YLrK31M387TLUMpPZ5oHTgL0x5Tbsfos4gNDN2O0bvG19fbF1Q2ocSCyiaubOJCExeauMjExabyYhuXya6DfQQtFFtQB/sIWijDzhSK+mWOV1uLeJDpYm3as4KRm2vxwRvP13mSQdtB/riK0adaGpjbW7J4kG+uYww8B7mmnln8sMF1xeDtGDbwcCs7aRhDvOnvsF7HSDRg+GZM0vf7NDC3Z+gEBh4w2BPBgEED5sY4+GP52/9+/+uX73/4+tNvC+LlH//z84+/f/nl5/e//v5//17/5Ydfv3z9+uVf3/37119+/Okf//n1p+++/vLjy799Cu//+TsA4mcApkXNi8kQl5XFpX8Sl7+/uFpEPsMyCnj555fvl5n+z8uE4Mtf3z+Hz8t/0iJsEff/",
123
+ "brillig_names": [
124
+ "public_dispatch"
125
+ ]
126
+ },
127
+ {
128
+ "name": "sync_notes",
129
+ "is_unconstrained": true,
130
+ "custom_attributes": [
131
+ "aztec::macros::functions::utility"
132
+ ],
133
+ "abi": {
134
+ "parameters": [],
135
+ "return_type": null,
136
+ "error_types": {
163
137
  "17843811134343075018": {
164
138
  "error_kind": "string",
165
139
  "string": "Stack too deep"
166
140
  }
167
141
  }
168
142
  },
169
- "bytecode": "H4sIAAAAAAAA/+29CZAkx3UlGFmZVd2V3dWVjW70jYuAQAAkqLyqKkuiOEWC4E2QEk+R4JFVmQmi0UADfaHvjqo+AJAUKZGSSIoSdVAHSZGiRIoSD0k8xF3ajrQamoZrMtOMSbu2tJVmtKvV7Mwad2VzdQDxI1+++uEZWfm9OgG0m3VXZLj7+9+////9u4eHRy7oplz8txAMkQRk756n/k7Gv8cgP3/530L8uzxcqkwSXUv8RrkxN6m0z5D/2mSMmfODXxZ8T/Ivb4hxHgu7+NgWobvx8r9NcN0Kuvrhq/3Sfz7bv83RZtGdu8IgSV26lVpjtlZtzFarrXa52Zqd68zX5sq1xZna/NJipVybqTZac81audyutZfq5dbs/Eyr3ZyfqXUWm/Ozgv1SFbvWXrwMNdOcbSxWOs3ZTnmxPteoNTtzc61ma77enpsptypLs5WlaqXTaDRnZppLM/OVSqc9P9NpJNh3h15kVhX8lwF+IbDV+Si93A9+4nNe4Qc/kc8r/cg/4f9VXvArifxf7Yf/uuC/xg9+TfBfG+MHgF1p1KrVudr8XHm+0SpX6q2lauOyBS/Wy0vl5lK1PV+vzHfq1XptqbW02Kg3mpVOudNcmu80ngIX7HsU7PJgqcI3BPt1IJecmVxqiV94/fC8c5oR7B9Px16z6AX7JxTsarO2VJ7vlJszjeZcuzFz2d2WL18sNtqd2Wpz8bLjrbYqlUq7fvm/artVn19szVYWZ9tz1ZnFy+QSmb8BZG5oS0uC/0Zj/Nlmeb49O5vEN28yxl9cnJ1rXpan4L/ZGL+2NNvu1OYSX/kWY/zmTL3Tmak1Bf+txvgzlXJ7pjqX6OZPGuPPL5ZnZhuNRH/eZox/OW6oteabi4L/dmv5LLbLS63K/FSMc2+MLzSiJLTfYUw7TvM5ohfE+HxP6BeJV+txO0f0kB+Uj8SfIrt3hqt5LSl56GM4L6/cEzoa1psMsd5siPUWQ6y3GmL9pCHW2wyxxK792lo9GUff6QW/1hD8d3nBL7cF/90+8Cvd2K4J+IEd/wn+oh/5JPhLMb4P3lt+ZJPMl9r2vCfYHT9yT8bn+/zgJ/HFe/zgtwT/fi/4lUQ++wHfbs5UTXTzAS/4tQT/gB/8RD8f9IJfT/Af8oOfrBUc9IOfzIkf9oI/k/D/iB/8ZP5xyAv+bNK/h/3gJ2s1R/zgJ/I/6gc/mR8f84Of6OejfvCT9YPjfvCTuO2EH/x5wT/pBz8ZH0/5wU/Gx9N+8JO49owf/MT/nPWCP5eMj+f84CfrT6Ef/MS/LfvBT/zbih/8xL+d94Of+LcLfvAT/3DRD34Sf17yg9+KnrlGz1u/uu0pvM2X/22Jse9rH3nJgYNLD9xz9MHF9iFc0RIugqB3pUuib04R6jVd1LsOPnTkUHPpyItbrUPtw4cZYUxBDlJQi4D6nub9D72ylcbPgGhvbh86fP/BhxitkBFNniuPQ3nDuKw8FeNNEH9IewNJwYZ2pZVl3RPpF4lXH+ueSE/4YfngumeUt1HhtaTkcR9uVOhsVOiUlDyOE4fBOmeIdcwQ64whlmUbTxlinTDEOm2I9agh1n5DLEvZW9pQOKJYhwyxLHXCUvaW+nXEEMvSti114rAhlqWPPm+INarj44UYy29sVW5MKbQlSR7uacWYihNH4sh3hP+NbV1cLidpM9A7fOKhpXsOHmkfDhwVoiQbGvn+qAmPA8JihjYEQX/Bfi+DYDmAR96mCBPr5hQsbYrDyowyn0jhATGkrzAQNpxE1LK0A+mv1yRCcxLaJELkM+lHPtUc4SM/k4p8WIe576J/ssF6HLCwPG7Gx/J4LfXx3nfiv6VgtR3JA92ckpdX7ol8I5l/k9qGfcN66qcf6pWseir0i4FPu+nqqaYX2mA2GazuZ8uNGVn6VfNtm5Q8wdoc/0Y9xfJFaCOWx2upj/f+l/hvKVit06ynm5T24D3U038VX0+mtGch/l0eKs3NaeMU2wHKyXKjaVY7EPrFwKfede1A6yfNn4jsNiu8lpQ8XvTZrNDZrNApKXkciA6DdcYQ67Ah1lFDrHBEsU4YYp02xHrUEGu/IdZJQyxLvR9FebnGwUGxomSpq8uGWMcNsSx11bKNhwyxRtW2LxpiPWCIJQ9KOc4U/ChNBqttz3ruhvSkHXgP6ReJV1t+urGSJlctphX5TPmRT8LPlMLPlCIf6cstSp5gTce/cc6A5aegjVger6U+3rsh7rASYUaJ5wxblPbgPZwz7M71tg37hvXUZz8gPeEb7yH9YuDTbspOvdDsfzJY3c+G8iln6VfkV/pyWskTLHmJAvUUy2+BNmJ5vJb6eO9O0lPUadbTaaU9eA/19Lkx7mRKexbi3+UhE9u40EDaKCe7lyc6me1A6BcDn3rXtQOtnzR/IvIp+ZFPmXUX+Skp8pG+3KrkCZZsB0I7wPIlaCOWx2upj/deSHaAmKy7W5X24D20g1myA27PQvy7PFSaa2h9aYhfmVLayXaGsjZ8ySqznQn9YrC6D33Y2TXET5oeiOy2KbyWKC9KvOl/m0Jnm0JHwzpuiHXUEGu/IdZhQ6yThliHDLFOGGKdMsSy1IkjhliPGGKFRliafx6Gr3NGfEVp2RDL0rYvGmJZ+kJLezxtiGXZj5cMsSx1wlL2VrYdGLfRUifOGGKNqp+w5OvZEDNdHdOunOwt7fGYIZZVG6Nrnuc+0+IJ6zby8wecW+biv5MKD4bz7HaO6Ek78B7SLxKvtvx059maXK9R5Cqy267wWqK8KPE8e7tCZ7tCR8M6boh11BBrvyGWZRtPGGKdNsRaNsSylP1FQ6yr/TgY1iVDLEudOGKIdcYQy9J/hYZYlrK31FVL2Y+q/7LUVUv9OmWIZdmPlvplaUOW+nXOEOuQIZZlG0c1lrNso2U8Mar9OIqxXHTNc9BnYpxjGWNejSeeGTZk6Scs+bLSr1ywel11GL5WjPiKkqXsLWMAGWtlHQj3HeXiv37X0KqZ9/DyGpqXPVh91tBKilwng9V6aCifSpZ+Rn6lL69V8gRrR/wb94Rh+e3QRiyP11If75VjoZQUTN4Tdq3SHrwn8o32hN0R/5hMac+C0B+y77W+NMRvTCntZDtDWRvqdaZD9JF+MVjdhz7sbAfxk6YHIrudCq8lJY/1badCZ6dC5yrWaGFtM8QSuxZdQt1jO8R61v4c6Uk78B7SLwZe/ULFJdcdilxFPrv8yCfZA71L4WeXIh/py91KnmDF30DsGe+w/C5oI5bHa6mP995E4x1isg3sVtqD93C8e91Yb9uwb1hP/fRD9ndWhH4x8Gk3XT3V9EKz/8lgdZ8YyqecpV+RX+nLPUqeYO2Nf6OeYvnd0EYsj9dSH+8tkZ4iJuvpHqU9eA/19B3xj+kg3T6z2DPian6bZYj12B689HelXc5qD0K/GPi0z6497M4oV5HPHi/yaXWy6A/yK325V8kTrH3xb7QHLL8H2ojl8Vrq470jZA+IyfawV2kP3kN7eIj8NvYN66mXfiiXO1n1VOgXA59+squnml5o499ksLpPDPlpZ+lX5Ff6cp+SJ1jXxb9RT7H8XmgjlsdrqY/3VkhPUaf5XcN9SnvwHurpaZpPc3sW4t/loVK9ofWlHX4n+ajyPi/4Mwn/13nBr84L/vV+8BP+b/DTv8lHs2/0gz8j+Dd5wW8n8nmOH/xkPelmL/jzifxv8YLfSPj/IS/4i4n+3+oFv5n4h+d6wZ9pCf5tfvo3kf/tfuSf6P8dXvBriX4+zwt+vS34z/eC30n8z51+5D8r+D8M+JZrKYJf8YJfrok8ykE35ZU2CX2JpV4A5XMpfwWL84RWkbB8xa1a25B/nreWgR+UQRpWeUCsSSXPR5/+sKPdSH/KwSu3I0p8BtFaZRKlI0ZYmo8ahq9zhnw9x5CvA4Z83WrElxZfD4N1uyHWuCHWjYZYdxpi3TKiWPsMsZ5riHW9IdYdhlg3GWLtMcKK0oXQjq8fMuTrrCFftxnxFV3fYIhlNXZE1883xLrZEGuvIdbUiGLJM3C/+19mqp7XA1t+1wPr837Xi+odv+tFs1W/60Uzs37Xi+pLfteLak2/60X15Nx3iReERpS0tR67edfsYo7oBYE+/xX6ReLVlp/u/Pc24oflw/uzbld4LSl57ANuV+jcrtApKXm8F3wYrPOGWIcMsU4aYp0wxDpiiLXfEMtSXmcMsR41xLKU11lDLEvZW9qQpd5b+pxlQ6yjRljRNb8rNQpt1OKLUbGhUfX3llhXffRgWKEhlqXsTxlirRhiWcrL0q9ayT665vnjKPh7yzZGyTIutGzjYUOsc4ZYFwyxLGO5UYxNojSq845nQ4xpOdaOavw1imNHlCxjJkt7tJT9Mz0GiNJFI6zomp9TD4O1zRDLao0vur7ZCCtKD4Z2WA8bYUXXNwY2WFF6xJCvW4z4iq5vMsS61QgrSpbyutGIr+h6nyGWlZ+IkpUNRdfPM+TrodCOrxtHkK8oWeoqP+sdFXlZ+dUoWfp7y34cxXHImq9RHYduNMSy9F+XQjssy3j1mCGW5RzZcg5jObeyXJ+Q+RB/91DwozQZrPbnhvsBMp91zu+VevmWYJ/3SrVvLIp89vnhp5UjfORHe3dU+vI2JY91Bt8rxfL7oI3sk1B/xuneX8YdVyLMKPF7pdr+D7wn8o3eK/3zfG/bsG9YT/30Q2Upq54K/WLg1W4qLr3QzlXQ9ELqlpQ8jumz9pfW97yePQzWGUOsw4ZYRw2xwhHFOmGIddoQ61FDrP2GWGcNsSxtyLIfzxtiHTLEWjbEsrRtS/2ytCFLv/pskP1JQyxL2YsvnAxWj+mG8UfyDvAdfvCT90Vvd8gC6fN5KpKv/RUszhNaRcIyblvF1TbtbBVtbYDfDRpmnUGwJpU8H316m6PdSH8ypa02/MzUeG+50EDafvR7LvO5qUK/6LdvEp28I1jdN5oeieyer/BaUvL4md3zFTrPV+iUlDwe94bBOm+IdcgQ66Qh1glDrCOGWPsNsc4aYp0zxLKU/ajq6rIh1lFDLEv9svQ5Zwyxng2yt/SFlrJ/1AgruuZ3D0ZF9qM6plliXR2Hro5DV8ehq7Lvh/VMH4eiFBpiWcr+lCHWiiGWpbwsbchS9scNsSz9veU4NKo+Z1THx1H1q5b9aCn7Z4OfuGiEFV3z/oNhsLYZYlmtY0bXNxthRYn3Vg6D9bARVnR9Y2CDFaVHDPl6nhFf0fVNRlhRejbI/hYjvixlH13faoQVJUt53WDEl7W8rGwoSqOo96Paxig9032hteyvjh1P/7EjSgeNsKJry1juRkMsq/ExSvxe0TB83WbI16jGEzcaYln6r0uhHZblnO+YIZblMwrLdQDL9QnL/RP8/g7u3cnFfyeD1XppuG+olSN60g68h/SLxKsxPxWXXO9Q5CryudMPP0s5wkd+7lTkI335w0qeYJXj3/j+Dpa/E9qI5fFa6uO96+JFlxJhRonf39G+44H3RL7R+zs7x3vbhn3DeuqnH6qNrHoq9IuBV7upuPRCs39NL6Su1l887mftLw3rhCFWaIh12BDrjCHWeUOso4ZY50aUryOGWPsNsS4aYj1giHXJEMtSXqcNsSztcdkQy1LvLX2hZT8eM8Sy9DmWOnHKEMtS9odGlK+zhliWOmEZm1iO25b9OKr+y1K/ThpiWfoJ2Vsl8TfG67n47yTVywWmc5d6juhJO/Ae0i8Sr7b8dOcumlzvVOQ6yLcco2ur7+NFyeqbiVE6Y4h12BDrqCFWOKJYJwyxThtiPWqItd8Qy+o7dFE6ZIhlaY/LhliW+mUpr5OGWJb6ZWlDln7VUics/eqo2ralPVra0HlDLEt7fDbol6XPsbRtGWun4zyMt/k820Fjfqwv5aaUern47yTxlwssY+xG5vMBhH5RkYmPmL+cUa4iu4rCa0nJ470YFYVORaFTUvJ4bBoG67wh1iFDrJOGWCcMsY4YYu03xDpriHXOEMtS9qOqq8uGWEcNsSz1y9LnnDHEejbI3tIXWsr+USOs6JrPBxgV2Y/qmGaJNarjkKXsLcc0S59jOT6Oqq5eHYeeGePQ1Rjzytnj1Tjn6R/nRCk0xLKU/SlDrBVDLEt5WdqQpeyPG2JZ+hxLXziqPmdUffSo+lXLfrSU/bPBT1w0woqueQ/KMHw9aMjXNkO+Hjbky3L93lJetxjy9YghX88z4iu6vskIK0qWOnGjIV+WsreybUt7tLSh6PpmI6woWdljlJ4N+mXlcyxtO7q+1QgrSpbyusGIL2t5WfnoKI2i3o9qG6P0TB9rrWV/NTZ5+o8dUTpohBVdW8YTNxpiWcbk/J7zMHzdZsjXqMYTNxpiWfqvS6EdluWawjFDLMvnMEcNsSzXvyz3f/H5JtsgLxf/lX2Y6OsiOgvx7/JQqZL5fBOhXyRebfnp7sPcG6yW6zZFriK7GxVeS0oez41vVOjcqNApKXn8DHMYrDOGWIcNsY4aYoUjinXCEOu0Idajhlj7DbHOGmJZ2pBlP543xDpkiLVsiGVp25b6ZcmXZT9a8mXpJyx1wrIfTxpiWY6P/A1ZjgkW4t/lodLMjBa72eHPLk4pbcsFvW27Ce7bxWm1zHGj0C8Sr7b8dOPGm4ifNL0Q2d2s8FpS8lhHblbo3KzQKSl5bPtrxdJ0axT4itIZI6zoejKwwbJu435DrJOGWFayj9KjhliW8lo2xLpgiHXWEOuoIZal7E8YYh0xxLJs40VDrAcMsS4ZYlnJK7q+PrDBipKlDZ0zxLIc054T2GBF6dCI8mU5pl0wxLLUe0t5Wfr7UY0nLOMvy9jEckwb1TaOavxlqV+WbbTyq1Ea1XmHpc85P6J8WcreUu+vzh8HG2uvi6+1dbsIayH+XR4qVRp+n7nW6pPUHlv87rrj9V7wq22/a4vVRP7P8YNfnVR0y7B/E/nc4kc/K4L/Q17w6wn/t3rBLzcF/zY//Cf68zw/+FW/Z2NV5gW/4kc/E/9Q9cN/TfBrXvBnZgW/7gW/2hH8GT/4Sf/O+sFP5D/nR38S+TSCbupiV2qN2Vq1MVutttrlZmt2rjNfmyvXFmdq80uLlcvqV2205pq1crlday/Vy63Z+ZlWuzk/U+ssNufnBHvej262BP9H/Mgm6dsfBfycGX45iR1e6IX/Rlnwf0zt2yFSpZxgv8gL7/VEL/+FF/xy4jcX/PCf2O2L/eAnuvkSL/iVZFy/ywt+LfH7L/XDf2Jbd3vBn0l828v8yCexr5d7wS8n9vUKL/jVRH9e6Qc/6d9XAb6db+76zlf70c8kLn+NH/1J5P9aP/qfyOceL/j1hP/XecEvJ/7n9X74T/Tzx/30b+J/fsKPfibj4xv88J/Me9/oA7/SSfTzTV74ry4K/pv94Cfyf4uf/k38/1v99G8in5/0gj+T6M/bvODXE/7f7gW/nNjvvX74T/TnHX70J/Gf7/TTv4n/fJcf/UzWfd7tBb+6JPhNP/iJ/Bf94Cf+c8mP/BP5tPzoT9K/bS/49YT/jhf8crLueZ8f/hP9eY8X/Eri3+73oz/J/Hq/H/4T/XnAC341Wbs64Ac/kf+DfvCT8fehoJu62LX24uVlwpnmbGOx0mnOdsqL9blGrdmZm2s1W/P19txMuVVZmq0sVSudRqM5M9NcmpmvVDrt+ZlOI+H9oB/dSWT/sMr7MKn7POcRH7xXWkncdsiLbGYSuzrsBb+eyP6IF/xysi521A//iW4e84Of6M+jfvq3EX3j/vsbnsKSb9PkgNYGuBbaURqH68Wwt4zkY/nbNz31N6L39zHoFNUJ4HqS6hv788zfqJF7RUU2hnpaYfkKPywf2UMhsisovJYoL0oXw245zssr98YcWJcMsfYbYp01xDpqiHXaEOuIIdYJQyzLNj5qiDWq+nXIEOucIdayIZalflnK66QhlqV+WdrQGUMsS52w9KtyTsRkoI+FC/Hv8lBpbkbG2qPB6iR5GP/xGP0olH9p2C3HKU+/sU0bL//7/rYuLpdjfjCWOQb4mpwk+d17WU5i2Q1+8GuiUxNBr0y5TRtSZCX52t8g0ONDoVUMVsvdR3yotQ35Z3uZAH74PWcNa2JArEklz0efjjvajfSnHLxq7SiQTDR/lFNkIvc3OPjC8tMKbakrMtwIeYYyrLpkiLYo9DfDdau9ePS+1xy8L6CUJzmI3HZRuVeGXTmwDk6kYAX0exfdywMeJtd8Mos9C59RKilYMs+N+H5RLKDpYLUuSh2//vTKjkvSpkHHJbQ35A0xZW2B5VqAfCz/6rgvon55VXwdLTdI32wiOlGSvpmCvGdK30ibBu2bzZDHfSP1sW9QrpshH8u/ZWOXl/+0rcsz09sUrOZvE/1+SKE3RfQkP0rSx1vgvuEaUiVrjCD0i4FPnevGCFuIH5aP6NpmkPGBg83WXc2HDx890B4jUWI3IXyJ4KQMlsVUApawPNdnVXhVuLoeJxGlZvJTxBPi55V7PARMKbyJmotszoALasXXU4GuxlGaDFbL1lAVlrKqptAvBqvl5kM1NxM/abL3657Li+zWkJ8pRT7Sl1uUPMGajn+ji8TyU9BGLI/XUh/vHYr1qRSsNu+lsJcHzfTxnsg30tMDFMJo7tjVb5sV3FKQPjRo061m2JtXUNomeeOOvAlH3galXZK3EeotUr2ighnR+Z82dvHSZIN6JSGw5pvSfGsa1t2EhfW3ENZ0H6zXEBbWnyasUh+sVxMW1i8R1lYHVnQtW/ynlfpbCeuaPlivIyysfw1hbeuD9XbCwvr8KZXtfbA6hIX1txPWtX2wjhAW1r+WsHb0wbqVsLD+DsLa6cCKUifsxcL6OwlrVx+s+wgL6+8irN19sN5DWFh/N2Ht6YP1LsLC+lJ3SsHiOMDP68jZ4wA+AnqPH36cR0CjfHg6tE/htaTksd/ap9DZp9DRsEqGWFsNsa4xxNpmiLXdEOtaQ6wdhlg7DbF2GWKx33KN19G1vEbkGq+lHuoulstDGW2MRoy0eADnbHh/T4b24D2WzZ4Uemn8oU+X+aYr/pgOVsuUeZ7qQ8fFs5TTYuZW2JuHS2oc3+LSI8fhuBS9hfI2KO3imBn7lWNmlBvGzLwt6M/j+5PEv/G4U0afybLSlnDTtj0FQbbHLvyIC2V0BdYD2jmiFwRXdj2A59OaLKa90K5nXrabJln4WUbsxkSaX9LWRqS8NvfR5vq4zHdf+8jlhzkvOfHG5n345IrVH9nhldXN9Hsqha0FKjdNv8U9MB+IhWkqhd+08gt9yuN1QbkfBPq0kZdGtG7De66lka0OOluGpLNFoSOmhe7QxxP+7X7wk6fB2lQd2yT0pxQ55VL+ChbnCa1isLqPfLgBrW2ufsYQPsuSxrYBsSaVPB99eo2j3Uh/ysGr1g5+aih9fCA+ejwKT/6Jluw1X+F3l1FtNqs+Cv312nGi7YjQQh8t5JS6JcqLEn8tUNudMK7Q0bDOGGKtGGKdNsQ6Yoi13xDLso2W/WjZxsOGWJZtPGWIddYQ66Qh1lFDrGVDrBOGWJY6YWmPljZkqROW8nrUECs0xLKU/TFDLEvZnzPEspSXpS88ZIhlKa9R9YWW8rL0Oc+GmMlSJyzHbSvZR9eTgQ1WlCz13lL2xw2xLPXeso2WfsIyBrCU10VDrEuElXVeL+W1Nx20dalny5sOM1TO4k2HGbqXD/Q3HVxvHWTtX+GXZTahlEe8cSq/P3aokRx/EC+8lRSeCoD/Ilpvc30d3c9acq2aI3oip4D4Fvrr9XV0beuY6+vo1yq8lpS8G+Aa85DOtQqdkpLHMccwWKcMsc4aYp00xDpqiLVsiHXCEMtSJ04bYu03xLLUCUt5PWqIZSmvY4ZYlvJaMcSy1NUjhljPhn48Z4hlKS/LceiQIZalvEZ1HLKUl6W/t9QvS59jaY+WOmEZM1nJPrrm9aNR0XtL2R83xLLUe8s2WvqJUY2/LhpiyfqR9poRv96gzWG3O+hg/e0ZsLT5sJTXXktyrVNpryXJ2gNu0fexTqX1h/Zq01rWqURuFSrH61To23akYAX0u0L30tapxiE/Sn8bO0+Rr6e9dOp2b95riW3kPZ24TuZaG9X2dOYddLYMSWeLQoexxuEaT+bkExqkzN/D+t0/b+vF7LclmV9tRZ54z+XWFPo5aOc4lf2/gLf/EvPmdz/i4Cd38CsXeFIrv3JxHLDuDrvlOOXpN7b3ST+wvYvL5ZhXlPMxykP7E761V4tZ1wZ9HRzrb3bQuWNIOncodKaUermUv0KH7zEdjWfXWvZa6SCW2LLfdfHB9Z/ljPrPe3aPQx6fwnYC8vD5ECfNNkQWUb1XZrANv8+h1k+GecpDGaJtc9JkKLLIKkPN57Ntb1TasV7+ZdTGCX7FDvuYX6PDPi5R3gmg8/qwN+8k1OPnRKcgb5zyTkMen6R3JuiVH+adhbxBbRbHsxMDjGfaKVWu8Uw7IkRw/b5qVqtl8ftIv0i82vLTfcaoHQ2infwosispvJYoL0oPhd1ynJdX7o05sE4YYoWGWIcNsc4YYp03xDpqiHVuRPk6Yoi13xDroiHWA4ZYlwyxLOV12hDL0h6XDbEs9d7SF1r24zFDLMt+tPRflvI6a4h1yBDLUl6WNmQZT1jK66Qh1lW/euX8qpXso2t+xjgqem8p++OGWJZ6b9lGSz/xqCHWqMarBwyxJF6VejjHx2cTns83SL4cea0f/OT8BNdzUqTPc3rJ1/4KFufxnuiSn7Y590S79ADXxrMczbl9QKwrec4JyprPOdF41doxbSiTLF/Q0NaWBu1b11Gpnm0seV4/7ZAT0h/mvZIqlbs77MqB+25bClZAv6t0L+15/XSwuk83pPApdPke6wrWLzjo5Iekk89IZ9OQdDZlpLNlSDpbMtK52j+9dK5k/4gfxrOM8Ksx3y7qNMeBJu5d4T0TUv7/K3Yxv1PsbaPmC65+iWY1Pz6+RPOvi11e/mGXjpkLdP3i9/FkzJwA2liGeZDyfwU8/OMuHbOQ0q7xFMz/E/Ttr4s6ZqBgau3aQO1iHiaIByn/N9CuH9CXZDYo9YOUe9Fv/JLMhiAdy/Wc3IWVS8Hq51Pl+NSs72BK+f/D0ed5hQd8l5f7p0A8cJkNxIOU//cKD3j05NLBh0/EX5gJKKEZoHuQ39x93AV5BSctSfkIU9TaZQpYj/l8iDCjFDVZ3E+rfaB9pJ3SaG7kWAqxsUBPfr+Q7cena/sb0C9y0uxP7kVK8B92dXG5nCTta21X45p0Olpcw1hjwep4JUrySRG/X/pcKgs/2id3tNh4nMpPxMJ8Ui1297ZRO+dA23vEPGB5V0yNezt4Hq7R1mIEka+fdZeufGV+OZ7SthLkY/ktDvlqa3ou+fZbAxF+tKPsee2nn3zvDp/6O+ry3XEF5Yv2xXv6tNjJJfsNCl+aX93goLNpSDqbMtLZMiSdLQodF1ZewcJ46nJwcf+x9qF7Dh5JTncXSOy+gK4n6R6HHeP0eyKFVd5OzTEZH/fNsRMf511U+NOS8IGJeckH/ZOYlMjqVjCpPJmUNoTisCdumaf/WBen/6JeuH2SVeIctQfLI00pHwIdLWw/S+2W8i+AdkvYri0NCT+TVN/WNTaSLwMsB6uT5K0AbQ47z0P5u8JuOU5aaBkXf1IW3xtgKQH7EXlDTHTx2Ldp/fIj0C/84VSkdy5Yzd85+t1Q6E0RPcmPkvTxMty36+OZ+RzRk7bhPaRfDHzqXPcx0zLxw/LR3LDjw6nYTQj/VoKTMlgW01uBJSzP9bnbH1XqcRJRjhPPb4vbF7mTl8bXmtvi4QFdlOa2eFTE+lJOo7NxSDobM9J5OrdnKlitP82wN09baeMV0SjxxzDxzTX+wKb25g6/kaBhnnJgnnbknVHyorZ8b3OXD7YHzZz57UXNrWZ1DXcTFtZfJqyVPlj8YU6sz8PL+T5Y/GFOrH+esC44sKJr/jAn1r9AWBf7YL2OsLD+RcK61AeLP8yJ9S8R1mN9sDqEhfUfI6zH+2Dxhzmx/uOE9UQfrFsJC+s/QVjvdWBFqRP2YmH99xLW+/pg3UdYWP99hPX+Plj8YU6s/37C+qk+WPxhTqz/U4T1AQdWdP3yoBcL63+AsD7owIoSf1wO63+QsH66D1+3EF9Y/6cJ62f6YO0nLKwvdacULBlrJGT8ENy3C9Eqmd+kEvpF4tWWn27I+KFgtVxRPjw9+bDCa0nJ49jxwwqdDyt0NKxzhljLhlgrhljnDbEuGGJdNMS6ZIj1mCHW44ZYTxhivdcQ632GWO83xPopQ6wPGGJ90BCLxzJXXB9dy243V1wv9ZYhD8vlA325ZlmhnTZvyAf6fOBnMrQH77FsfiaFXhp/IZR5aXw97Dwluv4JwsL6g8xTout3ENYw85T3ENYw85RxwhpmnlImrGHmKS8hrLXOU6J0f9iLtdZ5SpTeQFhrnadE1/NBL9Za5ynR9asJa63zlOj6LYS11nlKdL1IWMPMUx4krLXOU6Lr5xDWMPOUWcJyzVM+1AfrlYSF9T9EWB/ug/VmwsL6Hyasn+2D1SQsrP+zhPVzfbAOEBbW/znC+vk+WDcRFtb/ecL6SB+sGcLC+h8hrI/2wXoFYWH9jxLWx/pgvYmwsP7HCOsX+mC9m7Cw/i8Q1sf7YD1AWFj/44T1i32wricsrP+LhPVLfbDqhIX1f4mwPtEH62WEhfU/QVi/3AfrDYSF9X+ZsH6lD9a7CAvr/wph/WofrPsJC+v/KmH9Wh+svYSF9X+NsD7ZB6tCWFj/k4T1632w7iIsrP/rhPUbfbB+nLCw/m8Q1m86sKL0zrAXC+v/JmH9Vh++foT4wvq/RVif6oP1GsLC+p8irE/3wXorYWH9TxPWZ/pgLREW1v8MYf12H6yDhIX1f5uwPtsH62bCwvqfJazP9cGaIyys/znC+h0HVpTeEfZiYf3fIazP9+HrGPGF9T9PWL/bB+t5hIX1f5ewfq8P1gJhYf3fI6wv9MF6PWFh/S8Q1hf7YN1LWFj/i4T1+32w7iMsrP/7hPWlPlhHCQvrf4mw/qAP1m2EhfX/gLD+sA/WiwkL6/8hYX25D9Y9hIX1v0xYX+mD9TbCwvpfIayv9sFqExbW/yphfa0P1mHCwvpfI6w/6oP1Q4SF9f+IsP64D9aLCAvr/zFh/UkfrNcSFtb/E8L6eh+snyQsrP91wvpGH6wWYWH9bxDWN/tgHSIsrP9NwvpWH6x3EhbWl7pTClYu/ivPuf4U7ts9V6pXckRP2oH3kH6ReLXlp/uc60+D1XJF+fBzrm8rvJaUvGW4xjyk822Fjoa1Yoh13hDrgiHWRUOsS4ZYjxliPW6I9YQh1nsNsd5niPV+Q6yfMsT6gCHWBw2xftoQ60OGWB82xPpZQ6yfM8T6eUOsjxhifdQQ62OGWL9giPVxQ6xfNMT6JUOsTxhi/bIh1q8YYv2qIdavGWJ90hDr1w2xfsMQ6zcNsX7LEOtThlifNsT6jCHWbxtifdYQ63OGWL9jiPV5Q6zfNcT6PUOsLxhifdEQ6/cNsb5kiPUHhlh/aIj1ZUOsrxhifdUQ62uGWH9kiPXHhlh/Yoj1dUOsbxhifZOwVhSsEMpcF1+79slJvfOQh+XyUEbbG4cYGr5gaPvrvpWhPXiPZfOtFHpp/IVQphZfW+z7u5uwsP4Fwuq374+/hob1L1Ie1uO9naGDTpRceztDB51vDUnnWwod7f3BVtibh2vR/F5IAfL4nUQ88ecc5Z1Q2qV90WiZ8vCLRiuUh180Ok95+EUj6Vd8f1DehRU5/FV8f5L4F3ksxL/LQybtq5VCa5p4Yrlxv+WVe6wDXD+NTnFIOkWFDmOlfbWyAPlY/n+N+0T7aqW2nzoP9/i9T03efo85KFcEf8UPfnKC8LIiC2wT2w2/Q679FSzOE1rFwKudOF/Xd+2bXwZ+QrhOw1oeEMvvsQndPg2D9HZrflLjVWtHmm0inaIiEym74uALy7viIJEhjt2GMqy6ZKjFHms5yVnktpfK8ZeXQ6i3nIIV0O+9dC8PeJg037YphU+h28+Pc/0oTaXwqv0VOkEfOhrPfNRKlPBk3f+a8u4/HruC7+ncAvlY/pPbupi5+OwX7T2iNFvJAT0Zu6LEx/UIvaynuyblY560kz4LSptvcfAsmBi3Ic9ydgTzsCnmwfMYqcZDQks7jYz7B9ui9Qnr3VlFDmmyjRLGKbmgV1ZSfiv0V5Y4RTviSWsrx4Xo/zcH/em4xsnNCp1h4wONjsYzzzOihHa+d6pbB/VBO6k5SvK+PR+v9H6w8+sdds7v12nHcmEbBz2Wi/VGyt/ssPMctRnbqfEsmKzTktjOpfxtZOfLUN+3nQstbRxjO2e96zeOaX5co7NlSDpbFDq+x0v+ynBoSCeEPD7LJ81eZ8lepV/TTlbHcRvL3wP2Ok/2yvqOea6xI1Toss0EQbb1lHMKnTQfFSXX2CHlX+wYO8JgNX/om11z3JDqLRO/AfzV5oxcPu+gwXou9yVmTYs9kI4WLxdScHMKjw/H137n3I2adgShJMm7oPAsebgm+dqwW45Tnn5jmyJdmdjdxeVyzA/K6UIKJss0Su2wt6y0eUzBXSFc9AEsLznPi+2/GTcmsv83T+l4rCdRki+k+51XNurcv5i4f1k+nLT+Fb6j/p0doH+xDy9SHtLhc+K0Iy0j2T9AMcGo2dJa7GV2SHvR5NkKe/NQnoKB8hwnjA+Avj9I+i5leLyIktiP2KzIr6DUjxLHflL+ERh7Vnbr9F32FgS6X0A54FwH5cm8aG2Wsu8jfbxIdRbi3+WhUj05lvYS8Yy0H/NEm8fkINDXX4X+lMKP8F1U8gpD8DpTmZurztZbM53F2cbMTDtH+MIr3+O1Q+2MimuU8iLrJ7zIutYSU8uHXfzHQa5RKkDeY5Q3DnnCY2RDF3f38v+4J/6zyB/pl5Tyd4fdcoP0ZUmhw3OtYbDCNWJdE/TagDYWLkM9HgsxfsHzRj+T4pez+Drxbez3sZ3sB3+LfN0For0Q/y4PlWp1LR5lX3fJE+2svk7oTwXpfVtU8obxda2ZeqXemZ9ZbHVq7dZcJxesHhPyyj32dZreblXKe/YVZc3XsT8rQN4lykNfJzxqvs7PuFgrZ5E/0i8p5dnXZe3LkkKHfd0wWOEascTXYRzEceoy1GuFvXkrSnvQ1/G87HPkk/gMtYX4d3nIpK0Rsk9FfqOEc+gVkBPLl3HwHsbNIZVBeUj5L0Hc/oWp1bgB/F1S+NP22eSgXX84lV5uRSkXratPx/fvax95w3uah9qtN7SXDrWP4DQAyQSBLpYwvubpVEDlosTLM6fpN+czpgzBhaB/QrEiltZ1iM1D79dgyvPT5MIKRGsh/lseMmlTRx5qQ7hvZ1LVzNMKoV8MVqucj20dIfHD8uHhcdmPfMrRkMxL7FF6d7haNsyH6Iu2/Jq2XQDbm1PaWwrSXYPvxwqsn9I+zdXyF02k7L8B1/jn9FhA+/yBa8uW67Gv5s6x/KsoL4S25Bz4vNzyl+AvfkBfi8GQStohXzYqUN5CfL88VKpWIj4+DEtZ7GfHQ73dQeB+PC7ll5XyiCGPNLStRSJDTbdQl/4NPdrRHllOOzDWalNZ6ZSGpFNS6Pi23RLRSXtU93cpNpn2qG4R8rH8HDyq+/fUn2m+68l2hd28dbKZ6qA2o/kpl82ESnn0VyJD7RHr68LePE3fWUejdG/Yy8MgOqrVj5JLR/1+iLaSOU6Re8VAH78WTPjpxin5jHL1OzWqlF26yTSjxFsDNLtcjn+j7WP5s9BG9vXLwAdPFwvx/gTXlgKX7eA9ke+T2/9SpkWCp/0Ngmy+VPNZbFt54PFBwJLP72jbF4flS9vG4nmrTl1orTjazfSjf+ehDXnC0MqHxD/jn6fyiX4F7tiE9XFXrI+RDl2zRccMgiDTVi+cfnN5tiksvyOmi3Gk1sfLgC98a69N8as3y4ocntxKR+3VxnvslxXiX8r//9d0Ma8nvjT/o8UCrMuab9XmgCUHHb+20PW7K4rcsvT7rdDv/BFfTfe0z8ExD1iebSpKmuzTtnlgOfFjbJtpeh8CP1KX238ntF+2OEp9tG9uh+Y/+FGxS39z9I+XBqN/2xX62mOX6N9C/Ls8ZGJfWQAaFxR++PFQg+xZlofzSls1uV5U6OKS9Haie5HoRv34adJj4W1ToM8huE/4MT/z+aOUL+VfBH78hfG1Fs+j/3vpFp12MdD1MM1OkFe0w/1hb76UfwnI67Mpcw/kR+NVs1H5bOBabPQ1xKuUf4XDRl26pMWMvFVIs9GQcHJ0P6teSPnXg17cQ3qRNg9+J8lasLL6B45NFuLf5SET9yXaqeYvuS/fSu0S+80rbdX69IJCFx8zsX+4QHQ1/yA00OZeCJgh8cAxCOsx25yUv9dhc3mlzZoeaGOsZq/cJxMp5bktUn5RiQcnU+gtxL/LQ6XKqrEnLZYppPDcUWIZbV1HYhi/6zoVdS0U7X0c6GK7gsAdb7KcsLy2hlgK+o8jUhZljnNIOQJ/nMqfAt/2MPm2HNSXa786VM78VW+hv17rNIP27VmFf1kT08prfiGn4EfPk3hdG9eDhS5+2nmF7mlrNznKWwbaOK6dI3+WU/hGvZP5LdOM0r2hThNxkabrNQQXP5ocS0G6DJ5pz9u0GHZYOmj/0m+ejyOos9/MOke7AG3IEpPzOgDj89wNYyltns3rRlL+O+B7P0R25WpjlHAuzTxp821eG5GYayKFZ55vS/mPKLG8323TlVVbtHCMw368GPTyLOU/7lgj0Y7wcfl1bQsVtlv40daueC6N82LWKQ2bt0tqOHy0N7czbf4hGNp2wejfQvy7PGQSPNlOh/OAxxV+xqn8p8lO3ksydcks+veEQheP5Ob5xxNEV5t/CG+4PoH9zn3CewGYT56HSvnPg7/4HMVqGD/geP2llPVZnCs95uD1ksIr2gzPlaT8Fx1zpbTtgcLrqPuTr2Scp+AacpQKoZf2qPMU9OXjQDfN57nWhbP6PG0L6grl5SAvy3r9MpRhH4m6o5XndUAp/z84npWkrZ19x/FMgudsBWiDa2zV1g5wH8ufbdFxtb0UUXpX2NteKf/v4NnKX2Rcv/rugLTvTqH9i0D7X5MMR21fTjgknVChYxnja7q3g2i6nt9rPGN9fubn6znzDqKzrNDxPJfIvM4g9IuB7l8WbPhJ1hlc64MoVyl/XikfOspfUMovK+VxnQF9eEB0cZ3hAt3T7HyZ+NHWVbT2avsBC5SXU+j083P/NICfi647kI/l7wM/9x/Jz2F9sQNNNrxGMKhstHFEo7NzSDo7FTq+1xh2UnvOOtozqA/E+uvlA3cSHayH+jk+3a2Dtq2trUcp7aiiHwX93Bhjavrp0hvWXW2/xFr7IJ+RTmFIOs/W9jyTbeR6Ixu5BWzkJrKREPhyyRnLrUXOWek8E/pz2ZAOYvGxUml6Uya9wWepWfRGym8Avall0BtNNqGjPUJ3vfTNhRUqWDmF5yyxqxbramuv2jEu0i9+X2PPvm9c6BeJV1t+uvMEbQ3nvCK7zUF3barZPlypNl7aXjp04uEj3BkCWAp6hXyBANko5DfXi5hKG9ywbJTw3EFUJH7RhSci2sS+H0/9yvbL14zwfEo7gyCbEWL9NCNMO/ftAuRj+VfEjijruW+oPPyinOZw2CFwubzShmJKPXwQgXnY5lc62izlX+do83LgbvPdYW+bQ+BpmeotQ16Y0ma5vzHQHwoIhibjXUEv74PqE9Zfr8F9F9HBejjovp0GXZFD2mahRyAfy//fW7uY76RBF89RdAVRfF7joHLW6PiWc9pZsii/R6BMSOVFfgUFM0r8YruU3x/L2PPCnHpGg9Bi3cL2RXpwYLq/bFy6JeX/FnTr4AjplgtLO4vZ5fue1oFZpV3OYktI/2kfmP1trlfIWQMzrucKzLhsSOVEkYYNzDSe0soOGpihEnBgpj1h1BRbC8zwaS4akK0iVVe9iYlPEdGYWMbnoA1awFFIkUUuBZ8dmNQvpMiOdzlJ+UsQlH0+fkqt9dXuFP6CIFtf7ab2RMn3m5y7iY6P1e8o8Vut/XRjkfjKKVhP7jobcMDEyQiWfxwGzJ+jAVNbVV3ryjPrYhBke2KR5Wl9P71mGRUUzChxACXlf48CqBDq2/mP2daVe6o628qi60hf2xEkfBeVvMIQvNbKtZl6c7a8WGvNzHbaq96EEV75XpYnrs9VyvtdmZptajuOzoNco1SAvBXKG4c8fHLLB+/5CZhmm1nkj/RLSvm0t6c1rCiNecCSw/KWgecw6MXip8pRQr+Sh3ws//uOBQ2LD7/w5IF9GfuqKC3Ef/v1cKdPEnoitw0KLyHJRcp+DeTyhd29bQmVtsh13kEjUO7lgnTZMY28gndP2Ju3nIE3pL0MWHmlXkgY2kfRpqktGibeYxuZVvjx+QQHafaLX/7lgE9w3hN287H8IxC//M8Uv2B7kEe0t1ygxw7sU6T+RKAvbLIfkPJ/CfrOH/LJU5uxncwjYvL8RVLaAtBfjcACkOsEKJZHEGSbN+SoHRpWIejuGEf/+LKwt7zIKs3Pc19osQTqK/twbVxkrLRFc47dpcxH4wl0pJP/G9lTv/a/PNQxtwDm9wfEfEUK5n+b7mL+ncNGbwx66bEf4nusD1w/Sn5Pp+p+yPW4H/waj2MoC2yT0B921yrSupJvaLr6WfN/LqzCgFie35Stufyd1g+u0yG0doRBr0w0OjcqMpHyJxx8YXmxYdR9qSsyPEk8L8S/y8Olqqu/8cPWQn8tH3KV3y+kcuKbx4LVsj+eghXQ7xfSvXygf8g18pmFOMbRxtBtKTwLD/3G0G3EQ5T8+sxGWXujWJL2RjHyyClPv5HvqL+/QSezBgqWFp/zhx41n1vog8Hyy2L3UcIHDfKA/fCRg4farz90/7Hmkfbdx9oPHVH0d0PQ274x+p12CjfzNUXl+IHocfp9RqHPiWWAaUopx6mfHdwJ12uxgzsV+hqdfUPS2afQcWHdqWC5/PQ+pfyzxU/fTOUkfh/GT99M99L8NPOCsfzdYbdMWixfjuNuv7FHY3Eq0G0YaZ/wRDtH9IJAjz+F/pTCj/BdVPKGWWOu1tqLi/Ozi/Wl2VazUq+6bAzvsU2eVMr/sFJeZH0q8CLrhrbGfBLkGqUC5J2gvHHIEx61NWY/fqPRyCJ/pF9SyvMaTta+1LDuXiOWrDGj78U1ZYx1qrEPwDVjPmmprpRx+dic0gbXMzzPPmDgDzvmKA/fXuaNW5eUtuYUOlrMKO19cuzZ3sXlcswr+ukLlId9LnyPmnx5QxBugnlp2C3HqZ8Mv58h7tY2hV0AfJaTNuaepN8PKfxI3VNBL/9sM7xmh/VPEdaZPlhsa1j/DGGd7YP1GsLC+rwuGfbBejVhud5IWHZgRdf/IujFwvrLhHW+D9brCAvrnyesC32w3k5YWJ99y8U+WB3CwvppJ26kYR0hLNdpJ4/1wbqVsLQPngnW4w6sKHXCXiztQ5EaDxhDZokr/XzILvubHkK/SLza8tNd19TkjvJh3/uEwmtJyeM5yxMKnScUOhrWiiHWOUOsE4ZYpwyxzhhinTXECg2xlg2xzhtiXTDEumiIdckQ6zFDrIIhlqwdanOH40Rn0DUx9sP9sDQfujn+F6Un10rvaj58+OiBdkAJ8XLB6jXSkyn0S0r9gOrm6F4pBUtwuA7PV6X/JpTyiMd7jz4Ic0Q+QZjrL8S/y0OluYY2/kvS1nF47MM4/qVhbx6vkcg1J21OIuUiWfyHXV1cLidJW2dGO9pD2IM+b8T6rn2z+4aks0+h48Lao2BJeS3edq0zh1Bf6vo9Ga67zqzNy7SYfS3rzCK3vVSO15kxRghTsAL6vZfupa0z83rQV9Zl3XguWTc+Q3wi7dAT7RzRY3kGRF87JVn4Lip5w6wb15eWlmYq1epip7JULc84v2KK97LY2O1Keb92NKeuG+O6VpQKkBdS3jjkCY/auvEFT/xnkT/S175ExuOwCytKYx6wZN0YfUnauvHXlDVhbUy5I+jlZdAx5Q6FF9+nR91BdHCMx/2kf1rq1kG5pZ16eF/Yzcfyb4P9pP9jjOlaL88Fut+N/mp7upm/tP2k/JxQyv8Z9DXvJ+U2Yzs1noUG3kf/zvtJpfx3acwJg962L8S/y0MmbT+p0NLWQnmM1WIBvOd6P0zK+W3j4Ov1/GwUx4GTlIfz0lOUh+uLrw9783CdzrVGtUJ5eBrzOcp7X9ArP8x7P+ShLnLS4vswvo7s4cQAz21Qb/i5jXYCtPZM4PlwjXnCK99jfcP6J1LqsR/x+9y4u5819IOf7H3U3oHBNgl9bX44yPiCtIqEZS07V9uQf9YDXDfltUoN69yAWJNKno8+PeVot+YTNF61dvBasGZnz1dkIuVDB19YXjsoQup6/rJq1SXDEGgK/bXMX0Vuz6VyvJ8VdfBcClZAv59L99Lmr5ofTeNT6Pbzo1ifx0ekj/FisFWnmfX9aSk/A/FiHq55DQmxZJ+k5zm76ZrcXWG3HCdtXJY2RTr6vQH2Amh9mSPMtD5KWw8tbe3y8g+7dMxcoM8TOG4XWWZ9D0zKbwceOG6XMoWUdhVSMG8Hfdu5VccMFEytXSeoXczDceJByu+FdslasxbDsA7yveh3A65d8VBOwTqZASsX6L6H9S5H1+IPs67DS/mbHX2eU3hw7V3LEw9c5gTxIGWeq/AQjR2b4vylgw+fSHlUwlN6flTC3cddkFNw0pKwHDVP1NplClwPfzcUHvDMnlb7QPtI2vMhbuRYCrGxQE9Pp+cs4tO15yyDzsOk3CDPWb4fD4TrFRMw1lig+0bZb+V3rrWUnGOhnd2i7T3jc0l+DGybv46lxZHa2gfzgOWx3cKP9JUW17toa77N71yzK9/lGG88cM81eV31bod8w2B1G13yXVbKh1BG+NHmIMuE1U++d4dP/R11+b72CsoX7WuZ8tKeN6fJ/pTCl+aHTmXAyitYOF5fHrzuP9Y+dM/BI210WdzcgK4n6R4Payv0+2QKq5upHMcIfMTGCfrNMcNphT8tCR+YmJd80D/xubNvARXMkwr2ew1W3Ji2jRnD6YCmgtojHZfaa9MRv0f8lFvCzwWQm2ZW5yEfy7/bYdrnlTaiXLM8GsV2h/G1tnWYtx/4eexYXhJeLyryyiv88Mc571PkpT2KxccSUSqEXtrT0j5Mh/02DnT79VGUuE+1bdfcN1EqUXnsX+1xodDUlhPC+BofF2rHcywTr/30lW3S0xaXttBd68cPH3XYpK8PC2rb5vmDpZf8yCvxYY8p8sop/PAHS89mtMkVaE+UCqGX9rQ1m8R+Y5t09VGUuE+1Vw54a2uUSlQe+1c7EkpoauOk6AkeCaUdD5BL+Su88j3XloylsJfOsiEdxJLH59LmFaij6eFifO3ZLsps87jseEnhh8eqn6elRnxFJB+s9qeLQW/5xxS6/NFipPsY0cUP+fKjpCjhMv9HiVdtfD6Xoc1fhqXWj1M8p03VeKr+CeD9S7vT64dBb14IeXnKQxvjOHJFaSfqJn9wVMr/OvD5ZdqydSXGNc2P8Lj2qYx+Or707ac7mp/G+RX7aW3sxfKDjr0iM+2jvmnfIEAs1JO07WtpH+7FpSws/0XlMYE2RV4h3gsD8p5TeNfGnXPQDj5KWZPvioOPxwBLK58WX/yRIhPGRFvQPjrPmF8HzH+mrf9eXr+rtDrC8xN9eH6ceJbyf+qIS7VX6FzzCu0VF+3j9Nqrjk9QHvIeAi5ijillf4zoa69mBgrdwMEvxzH9+F2Or9lX/lsYx/5ia28Z8SHfhf74Go0Bfl7h7G4h0WzvBSmySdMPzd9pr9wyltQrBKvt0DX+oEz/aquOOT4g5l8r8YIWY7bCLu1/mxLrRIljnSixfzyn8IUxlOs7Kl6PFgUfg+tNWgyNcQ+W/37GGOEctCdKhdBHe9plLUbAfuUYAeMBbZxmP6itWaxQmShpn8uYojzt21fWY/ABOhYU6fBrsisOmtHfW+Jrv9+x6ayaR6FOoqzT1vz+X8e4p62nub4T1G89TfjRjkS4uC7y6tqwJq9cBnn954w2vAztiVIh9NEe3YZdcb7Wp644v1+fsg1r62+aDbMfWFboZLVhqYvfh9PWVPl7W+cVDJeczlMZvMaxSiufpk9T8fsF2muyftZeKmWOAQZdk9wKPLPP0GKnEO6tdb1Pi52k7iT99iWvxxV5XVD4GafyuxR5Xbk13EpF8xnYb+wzXH0UJe5TLR52rdNiDHyR8tBn8DxkGfLYNl3jc5Rc/kTq4keeXR9kHtSHeX1uCjGB9txUkxk/N73DYd9aTOeKCfr5UeFH89fr89y04oyhcgo/7MMrGe07hPZEqRB6aU/lSj83dcUEvLamfQe53xh/vcMmZa3O61wQPrO31rnggsPGNN+Vh3trnWe5jjXzu5ej4vRJOYUf9kkvfxrYmCvudvVRlAb1m2xjaH/LVC5UsHJwT8Ylbb2b52yIPcicOErynXa//rw69Jz4zQ7b1PrFZZsjPyc2GP/ekdE2l6E9USqEXtpTebrPibXxL4yvo/Fv3DH+SR2/41+54Rr/8kqbePw7MOD4F8K9Qcc/1zPr8yl0sFyUNHlGaSH+Wx4yufaBeN5nOZMjeiIPvIf0i4ocDfmpuPoV5TNG8vG0r7IeLflpe3jeHa6WTZp/57FY9t9E6dVhL99R0o40wT0lp67pxdX2WmBdocF7LZav6WKeJUysr411PIdGnZG6Ee4/bXnq2rUm5+rzUMFl3z2RUj4tnrzkWHfztMekLjxre0ywXWnP497r8JnamKTZCvOA5bHdws+V2ztZda5Tnlf44XXKnxmpdbdq5UrvneTYw7Umpx0/4hqf0VewX9DmE5oPK0C7NH/jOjY8R9fLxGOUZL8Z4noeWxvsp9JsPs1PfXLAtbhr4d6gc0q2eW2u5KKt6YDLT2dp/2fW3083XH5am5+xn/6dAf20q88s9rhn7bO7Q53XrH0m5b+07s+0un221rHiKwM+03L1WVY/7HqmlbXP5DVh5jVrn0n5bzwN++zbV7DPUKaPUT3kneehPIYWU+ptd2BeSMF0rWMwRpquuNbHpPxfKLriateFjO26aNSuiwO2S8p/z1O7CintKgzYrgt92lWgdkn5v3bYtp+4pzL0M8i/yRi7496/KBVCL+254uv9IjNtvb9AeTnI4/UHqzn9d2lOz/PyKPk9rqyrY9raR16RHa99/GNGHcNnilEqhF7ao+oYvv/IOrYMeXmlPOuYa/8myqyklJe1J03HeB5mpWN/tqW3HNpULuVvQHiSxqht55W2sS3iPBRlLfPQUXhHDvnh8axAY5j2jtwFBUfK93tHju3qMaKrvSOH+onrmRPEq/Ys6myGNu/Z1sWcpGOoUU9FR7R5k+iG33lm13+t9Z2zaZDzqI6RaGfsv7S5MJYfdC7MY6T2rlIuWK1Lmo3zM3H0KcIjP7NB3Ej/9m7pz/8FpS7b30RK+bR50fWgF4O+0/VgCubNYFc3bettP/bBFPD8/PV49+vyuqq0ba3vfj1XsSP2mUGgz799vPulyRV14fnk17R5Kvc3zluwPM9bMC9tPqbZ7WNKG1mGEynl2b9J+Zqix9q7Irw+rfGnHYPPYxLWxTHJtd7sN8atDh3jvtCh21IH5eTS7azxo7YvYYXk5Wlf3qpnx4PuS7hrpMbUavVKv6PFcwK0u5CwtDFVi/u1OYTwqM0JcEz9u7gzxqne66Hf/nkE1ji0eIHXON7osE2tX1xzu37rB2ybaLcXHPVQdyYVWgvx33K5M1QSeuJ/Nyi8pK3b3Qty/ILjEz+9/A6XXHNSv/OGp8YEpBcEq+e8SL8Y+LSD7n6drPG85/ebOrhfB/UX9+tg32jzBG2ND+erHYqrcfzV/OhbIB/LH4C4+v4UzCAYfB1F6ka4s7HP9LyP1PluZZb194cd/tDl36I07L5b9IcXKY/njpiHehRSOW1ej+XfCPlY/jjIgc+/8fKOG7wz9HgfntPecTudMW7Cd3qiVAi9tOeKv+MmMtPecVsmLM3OUX+z7KXQ1kE43njMMZ/CccN13kcW3lcU3tmfso/q0FwrhHLnMtDU/KLn+K/C/THoM64PrWP8J/yM6nt2eYUfHh8+ltHHhNCeKBVCL+254u/Z8dwMfcAK5aEN8fplWtywNxauduZKjq5DhVdtzcXv/L9SZftBHQsV+fD8/9MOm9Tm1uh3Bp1bh/H1FXwvz+nDtHcz2Yf9bkabXJczbS73/5V+Ti8yc72X53pOr61JhvF1ZJP/NT5w3Kcc5xrlZI4pfSh6wakA+Vj+67FeFKEd8rcwBJ+duWalU2t2mjPNVqu+1OTPc0ZJ+iw6rj7Sh6/SehD6O8N5cFnwx/3gJ+eT4RqtNn4KfdGlMSifS/kbBPoagtAqEpZx2yqutiH//Byf91bJdRpWYUAsv59H6/Zp3tFupp9WXrMBuT/hwMfyMhahDk+QLDb4kUXV1W8TQFPor+Xzg/J7H5WTtZ2xYLW8x1OwAvq9j+7lA/3zg+yXtHe9pI5nn1LN6geEfjHwag+JHxgnftJsFz9LcuBgsxV/UYtdHncdihPhuNncdcmwSPdYHcaonoS/2hDKfOYUDE0Egql93XGM6rHb1ugGQVdd2X30w5LrvIOXNIwcYUw5MK6azlXTUdJV08lmOtbR+NLi7GK9vbg0W6nP1urlVr9o3Jp+faY5t9Scq1Tm65V2vTKz3vTbi/X5ucX5pZlyqzxfma+tN/25ZuMy9fl6sz5bXirPzQ4yG3K5C9TzTthbXiKxicA9+xin8uPxViNtV9oE1BGs94SrMZlndKUY4TbDXh6k/CTw8Ce0SoBy4CEEo09Dl72UdQgR+sXA65BW4f4Qflg+/CTX04xgMUf4yM8GRT7SlxuVPMGSlRNc6cLyG6CNWB6vpT7e2xnrVokwoyRfe8kpeXnlnsg34n3r9t62Yd/kUv4KLt/jGS/KhlcNcLzEJ9/7tve2Be1dG2vFf7AtvmB7F/OG+Fobj7n/tLep0sZVpJfmr8YCnb9bwFfwh5PHqM3YTuYR6RUUulFifyXlb4958BzKlnncQFrTgTvu6BenBMFqvdPikymFjshrU+BemXD5CdcKkdhc2tuygjdO5WvKWCZ9NEn0FuLf5eFS8iWxIvCk+cJJ4lnKzwHP/GRjUpGb5jeYByw/qchtOljtX6WuZ3ktuuRVyCCvFyny0p5sJLFF/LcQemnPkvZkA/V9HOim9SmWH7RP+S1DjGU3Up62Wsf+GOloczPt9BD05fugf75KuweQPrdT8xETSjtdPkJrH/uI1w0Y794XrsZkHrLGu1L+DcDDNx3xLo7vb9ru5pV9ML91LOXvhfH9rTS+ayup2tjAT7ixL0VGODZMKLiaD2Kd0GwFy/P8Q3R/IqV8mk9ZdIwbm6jdC/Hv8nAp8YObgSetHzcRz1K+4xg3pA7KDeeOLOfNSnlsN8cc6GOk7iT9tvazwuuUIq9JhZ9xKv9gxnEDn6pEqRB6aY/6FV3sNx43XH0UJe7TKaU89o20r0TlsX81299EeUh3I/HQb77KY4oWQ6Lv05aYUQbCp19dXKrkiJ60D+8h/WLg1ZdUBtURkc+UH/mUXTo4pchH+NnihZ9yTXSlpNAWXuMPyPT4FSw/BTLE8ngt9fHeB2idYBrqCX6J8qLEaxOYl1fujV0hrJKChXKTPo3s+DzJAvU1l/JXcPke84j9KTovdKYM6SCWxGcyLm5ReMhRntDhe0wH60s5zU6ifwvx7/JQqVZlHRUaSBv71s5GZ+ay+lShXwxW25MPn6rpt2YrIrutCq+lYLWfeDDsluO8vHJvzIG1PKJYRw2xThlinTXEspTXCUOs04ZYjxpi7TfEsmzjGUMsS74OG2JZ2qNlPx4xxLK0odAQy7IfLXX1vCGWpX6dM8S6YIhlqfej6nMs23jREOsBQ6xLhliW8rKMTSz1a1TjQku9H9VY7pAh1klDrGdDLDeqem8Zm1wd0wbDGtVYblR9oWUsZ+kLLfvRUl6jGn8dMMQa1fjrmCGWpW1b2pClvCzHIUsbGlXZW/ovy3U5y9hkVPXLMvYd1RhzFMeO6JqfWVmMHXkFewzKTSp8WD5XFvxtnvBFVtc4ZIX0+Tm35Gt/BYvzhFaRsIzbVnG1DflnPcA90SiDNKxrBsSaVPJ89OlWR7uR/pSDV60dWwxlMm6IxXsAtb1B2nPVQfVEnsWjbkhdz/aavCm/xSEnpL+WN+VFbm+mcvLFqbFgtR5sTcEK6Peb6V4e8DBp+zqz7P3Ce6wr2rtBGp1NQ9LZlJHO07k9rneS/O5rrc5nHWeEflGRiY9xZlNGuYrstL08pWC1fT8cdsul2b5rnw/mHTfEOmGIFRpi7TfEOmyIdcYQ67Qh1rIh1jlDrEOGWJb9aCkvS109YohlqatHDbFG1U9Y2qOl7EdVV1cMsSx1wlJXLeV11hDL0kdbxgDnDbEsxw5LGxpV/Xo2+C8f41CWd4S2wH27eUdtMUf0pB14D+mv1ztCmly1d4S091WkbonyonQw7JbjPNf6joZ1yBDrhCHWSUOso4ZYRwyx9htiLRtinTHEsmzjYUMsyzaeMsQ6a4i1YohlqV+W9mipX5a+0JKv04ZYlnr/bNCJ44ZYlvoVGmJZttFS9scMsSz1/pwh1lU/8czwE5ZtvGCIZRlPjKrsLxpiXbWhwbAeMcS6akNXTvaWc3fLObLsP+M1pCgtxH/Lw6X6pELXCLvKZzkMgV3jG7znzpDv5BwXPBMPz0h7yY6nrqWP8Qy0PNXNQR+PU/lf29HFvDu+5jO8A7ieJLxcYLqnIvOXZYV+kXi15ae7ljhG/LB8eC0xr/BaorwoPRR2y3FeXrnnwjphiBUaYh02xDpjiHXeEOuoIda5EeXriCHWfkOsQyPK17IhlqXeW/JlKfuThliW/Wgp+2OGWJZtvGiI9YAh1iVDLEt5nTbEGlXbthw7JJ6YDnpjouhazrObDlbHTlNETztLPUqev5NREfyNfvCTdyX6nQ0t9F3fDOG/gsV5Qmu9vumhtU37pkeJyrMM0rA2DIjl+dshSZ+6zoZF+lMOXrV28Dnh2lcLc4pM5P5GB19YflqhLXU9n6FfdclQO+96Le+ZiNxuoHJyZu9YsFoHN6RgBfT7BrqXBzxMru9mad+lELp49jj2Ab/ToZ0vjvfYXjTZanTYd1+j1MtRHvLgeqcK66/Pe0315Dzf+PjW1PWUbZCP5T8Xr6FoZ5VLHWy/yz63K+Wx3cKPJvvtlIf1WDe2OeggX5pubHPQmRySzqRCJ6/k4RrZlIIrMhbd2Q73DX1VPUf0hF+8h/SLgU9d7o67Lj2KEvuZaxVeS0reNFxjHtK5VqGjYeUNsVz+ahvRGdQvavo9pdQbdZ3zNF47dU6T6yA6FyU+k3uteuILazpY3d/sBzXZbHfQwfpSbkqpxzrH9rUQ/y4Pl2ay6pzQLwZebaDi6j9NriK7HQqvJcqLEuvJDoXODoXO0wUrF3Sfj4n+av50rXaC9aXclFIvl/JX6PC9tY4B26k9g44Bmm27xoC1tmdQu18rHcSSZ4xsIxZ0EKtJdNK+9fif6DnnzrhM2rce5WyAcSr/m7u6mD+IMbWYFW0C6+Nce5vSDqb3n2Mg8cW7oL6h71O/myi0/M6VKnNT1GZMU0q72fZ3Qx7b0R7IY93fC3nYX5zy9BtlEc1hvk3fRgoULE1HrqW8nUo7JG+X0g7NX22jPLT9nZSH/mcX5aGNtcJuOdbbfLC67/ib5K64WX6j7YktIO1xKv+cmKDfuLjadI0vQnuHJ9pZ/CPSd8UjRSVvqO+FN5ba84v1+uxcfWamtjQ3aOzAfhHLa2dM+PV/1Yb2XbOdINcoFSBvB+WNQ57wGPmGi7t7+d/pif8s8td8AJZfhDYM0pfXBKv9EMdGa7XzxrrYea115ey81hplO6+2F5dmm81ObalTXmp22pZ27vrOmh87rzWf3nZea1rY+SuhDYP0pTbf4++7WviMq2uvSfK+9orvcrP/G3S9dNwIK0qudTCOIQddB8P6I7AOllnnrq6DrQ+WtnbF8cyguo31s6xd+Y05sq+9Cv1i4NUGKq7+0+TKawZYt0R5UWI90eKRnQqdpwtWLli99oq6w/o7qJ1g/bQ4VPK1v0KH77liC372rNnQWscAV9zhY000q92vlQ5i8drrTkM6iJV17fXozi5u9E/i5qxrr1K+CWuvx2NMbV0NbQLrZ117lfJnaO6J64y+116Flue11wavr2LS1lfZ9rOur7Lu74M87C9OvtZed1Cetr4qebuVdmj+itdeXeur6H92Ux7aWCvslkvzc9h3vPZ6NdZ1G0AuWO0/rWLd6JrPWx9mrj1piOXab5W2dod0XPuttLlaljn9qOmc7zn9tRnl+myYX/GcftD5lfZc7er8arXOXZ1frQ0rF7jnV6y/g9qJFpv4nl+5xgCeXw06Bmi27RoD1tqeQe1+rXRGeX7150bzq30wv/pXNL/CuRPPr2S8xzLacz7e4/49ml9dyb0tBS+0bedXbEe+5lcii0HnVwWlHa71e23u5YqlC5Snxaya/+G5l2t+pfk5nAfw/CptTQF/jytlr6E8KfvvYuYiG9y9K52W632ZqUBvE/oDfF/mHaHOyz/GvER68OWUd1DGUjDFx/iN7ZfKPN5iG7WxYZzK/0doY0C6js+IRfYyByuEXtpTifj4MPDB+jcOdHlccs1bWU5Y3rV/zDX/1N4TRBsQW/G7htXVAexjHvc0e5Ty/y2jDohcr4QO4H5g1gHNZ2n7jl06g33Dftb1roNGG/WCdcDPOo5bB7RxgnVgU+xr++mAyPVK6ADKlXVAWxfE8ll0QBujs+iAtu8dxwLebyLYE0p5xOPxaAf00Q+29fK3Geqz/k4p2Di+uvxZUWkHn6mFdfFMLY6vr4f4+p3xtednC8m74xJHpvnG3UEvz1L+OYpd5KgOyss19uxRyu9WZKjFhXsoT1uTn6ayGOsJDxIzFxTsKPFcRco/j/oL42vfc5V91IY90AaWY5R4fiflXwb69wKKLbU5iCZPjt21Oci0wrf0g8jv+sCL/BJ9l/flUd+R1+uDXhlJ+dmM4wA+n4tSIfTSnro2DlwXdBOPA9dDXl4pzzZ5g1Ie+0ZkVqLybJ/4G7H2wj0eB0SGE4HeR7iOgeVf7BgHMF69jnjHOGAP5WWZL6JOr58PrzR5LQCT610WbS2A1xCugzxeQ0A9GHQNQWQx6BqChR/i/byjYrfSD1Fiu0UbzSvl2W772bmsD5aC1X2Z9q4P0hzEZqL0SqKH+iJ9gzbj8hna/IFjYKyLa6Accy3BmPfJp0nMdd+AMZe2Ds88YPmnS8z18DMg5nof6N/hNcZcvB/lmRZznboac418zHVpjTEXrilYxFyffBrGXLzv6ukac7n80NWYyy7mymIzUcoac33SU8x1lGIuof8pGPP+nuzV0zPeZAzCmCrv4J/922cdMZcmL1fMpcVo2G6OubDfdlNe1n2pfN4ExiuMHSWOuaT8l6i/0MZ9x1x7qQ27oQ0sxyhxzCXlvwv692WKubRnzZo8+fyFrH5Q+kHkd50f+dXYJ6G+I6/XBb0ykvLfyBhz4T6JKBVCL+25or5b87Np4zD+RiyMEzjmQp+p9RGeRYPl/8wRc2HsxOMHPqflveXbFbramITjx/r48Mo874fBpO2H4dgJ7ZDPgckajw16Dgy+Az5IzGXhh/jd9FGxW5x/sN2ijWrzFbbbfnbOMRf2Jes32gzPsbLYTJQ45kJ9kb5Bm3H5jKwx107AlXOs8NljAHUW4t/lAVO11WpX6pW5+Ua7Xm/Nz/D4HCXpm00+6Dcas/PVxXJ9rrXUadVr/ehHevfVbbo8RcclTSn3BFd8mqczy6s5ohcE+j5woV8kXo35SfaBjxM/LB/eBz6h8FpS8ji21fokF6zWf9eehZJSP8uZ5Vp7NgfdvQKHjxw81L6r+fDhowfaASXWlRz9Hkuhn1PqBw4srOPDrtqN+VZ5vtNuViqVaqvcXm+7nmktNspz1eZ8a2m2VZtZGsSutX0vuZS/Uco7sEsKVjt86q/nbz5Ute8DBHb4FZGT9g0Hv9+b6HSy+jehv17fiMj6TQK/3x3otKP3/0T30Gdo3+JgPjYQj0VPPGrxI34fJEoFyBM+ojIb9/TyOOaJR7822mlpMQK+Y7GX1oSkb3DejXo/BvlY/sbdXczr4+vpoHdcQD+F32XQvtkhv6W/xpSyfEYTf6dEkyuWxz1zWlsnqK1S/ta4fRFv/0hzSF+6LDxvAp7ySruLxLOUvwN45nVA3Avo8inMA5bHdgs/2jmZm6ge8o77Lfme1v85KstjvIyDWC/td9r3EjQeNio4PA4zJtPUYjmeK+UVOmizGFP4fd+nPKONxZK0WDpHedj2Hw+75ThpaxH43s5EhrUITX4TlGcRe8n9cbjPdDnenqCyfLYY8rjWb1chjyWFzgThbnDwnyOcglJvKtDtUfubld+cwq9rvrtWOoj1E2EvHexnHDNfT/4Tx4m8Uvf+sJuP5d8EY+YbMo6Z7EuwDW8Iu/fYZ3OczDbJa7s8NnIZjBOw/NuUsZH9A2JF9+7NEINocSXHIKdBnu8ieWoxxnSwWjasw7xnH+NvGV9YBvcBH63d6bRErlOONkb37t+tl0MesBxjaGMnfzetoNSbVvhi22PfMeGgoY1nGo1xyhu2f7RxW3u3o9gnX/t+WKDcG1PK94s/iinYGq72nTXNz2+kvJySxz4M24s+jGMTbc6HvlGzu7S+c8X2Gu9Z4qoJB++a/NAPWa8VlRvlSnlpbqbTqbRmm4v1fmtFcn9D2NuuJ//CvXFoV5Q2YnnKm4S8QthLvxj/lufRjCV8jFP5D0JfR2kC6kj9kkJ/guj38K3cQ11jrLxyT8pHffp4zKOXtf2Z+UZzfrFcqXaq1Vpjtl+/anLCtYkoiayxLyaUto1T+Y/AmPMxipHHFXpRuU85yuVS/j6JodwrhL33tD5C3ZXyQrsYruZR8jZB3jjR2Rz/RnkhlvAxTuV/g3QX9U3qlxT6G4l+D9/KPdbdTUr5TUr5qH8+Qf4I2269tvgkTcLHe8zbpzza1Wx9ttJoNBtLs0ud+frS4nqv7S/Nz3bma7XFSm2+1Z6vzK43/Xa9ttipdObnFmudcq1RWfdnG81ytV2vLC7OVNrN+fnOurf/8jOdzmx9sTG7VL28hLm03vTrnbnmbGeuPFNt1dvVVnPd9W9mdnGpfrkX2pXoZ3W96Tfn2vP12Vp1qdaZbzbKjfWmv9iaXSrP1yqtZnOuPDfbWMuzNVw7wbn7dzLM3bEu78WT8n8D4+2/pJhXW9PR5jljlKfN6bU5kMzVtDMUkvE3WD2vsFwPzBIXIP31+q6mtpbt+u7OJj/81IWfzQo/2hkW0fO0LcHqPkP+BAvXLl8dPvVX0y+eJ01klI22d4jn8tjHvG9iTOHBtQbgWoPYFLjXIXgOqNkx102TBdq9zBl5jel/B7ufiJ8Ruua6mv2y3bNNYJ52FoPo7maqtxD/Lg+XEt1N5gWBLtPNQa+MpPw/OJ41afaA6x28bjmllMd281oR2ksy96XfxvJK9ixv6SOvKZKXlP9/HPLS2r/BIa8tSvkph7xQlliXaaf5ovXSxX6yZV2U8v+syNa1L8DzvtIZbV8pPk8dB7pp9qJ9X8rV/5q9lKg89rfm49lXI91NlIe+mf0/+njxbehLOX5DX43xW/J8IuyW87G/UfojD+0qxPeQvrYGJ+WSs5X88FoWXmXdQWwEaWJbxqg8X/M63549Xb6xjdjXrvU6bc0D14KER219bFM4GNZGwtowBJbwpa0DbVgjXxoWr4cOsr65Oe6byAb/O7Fha8oMOwQA",
170
- "debug_symbols": "7b3druw6cqX7LnXtC5EM/vWrNA4M2+1uFFCwG7b7AAeNeveTe+WUMtdOMampyVQMkuPGWOUtzQx+jGSMEUqR//cv/+Nf//n//K9//Ou//c9//8+//Lf//n//8rd//5d/+q+//vu/3f7X//37P/zln//jr3/721//1z8+/7//svzxf8xift3wn//7n/7tj//9n//1T//xX3/5b2YRk/7hL//6b//j179jvP2R//nXv/3r7X+Z/Pd/eLk+pvB1dVpkuzaEnUu99V+Xer88/qy4v/8//3ALx7YIJ7m4huPz+3DE5a9LJaTXcFyTcJKs4eT0PpywrHSCDa/hSItwsrVfV2fnK+Gk5evSuOxMlt8Nx6Vl/QDjsje1cNx6sXHbpRLvnxA+/gnx45+QPv4J+dOfYJaPf4L5+CfYj3+C+/gnyMc/4ePfafPx77T5+HfafPw7bT7+nbYf/07bj3+n7ce/0/bj32n78e+0/fh32n78O20//p22H/9O249/p93Hv9Pu499p9/HvtPv4d9p9/DvtPv6ddh//TruPf6fdx7/T7uPfafn4d1o+/p2Wj3+n5ePfafn4d1o+/p2Wj3+n5ePfafn4d1o+/p32H/9O+49/p/3Hv9P+499p//HvtP/4d9p//DvtP/6d9h//TvuPf6fDx7/T4ePf6fDx73T4+Hc6fPw7HT7+nQ4f/06HJt9p5/36vML5/HhgcXuU8utD0hUfki/4kLhc8SHmig+xV3xIk2+5C8uawS7a9Pwhrxeb9HgIlsLjIWS0e0/94vqH/fNjNn9/rhXl8ujtYtcnqHZxv0X/KyIPF1GAiyjCRZTgIspoEaUFLiIDF5GFi8jBRQS3ZieFNds+IrKuUgOtN+tftj4+4vB+7ycsW7lP8fl3KWbvD5vt5zfWPA1Q9n5hYpNZh7f8dukvhIEIf4owEuFPESYi/CnCTIQ/RJgXIvwpQkOEP0VoifCnCB0R/hShEOFPEdKd/Bgh3cmPEdKd/Bgh3cmPEdKd/BChXehOfoyQ7uTHCOlOfoyQ7uTHCIUIf4qQ7uTHCOlOfoyQ7uTHCOlOfoyQ7uSnCA3dyY8R0p38GCHdyY8RargT2YJ3pva7UrNs28kYkWeEv8KXvsP3fYcf+g4/9h1+6jv83HX4duk7fNN3+Lbv8Puuum02WNELv++qa/uuurbvqmv7rrq276rr+q66ru+q6/quuq7vqttmCyS98Puuuq7vquv6rrqu76rr+q660nfVlb6rrvRddaXvqttmkzK98PuuutJ31ZW+q670XXWl76rr+666vu+q6/uuur7vqttmG0G98Puuur7vquv7rrq+76rr+666oe+qG/quuqHvqhv6rrptNvrUC7/vqhv6rrqh76ob+q66oe+qG/uuurHvqhv7rroRvOo6WdaNdJ1Ifn+xkbiebWn80y7TJsWdq8P2l3873TLdf9ytse1uH2DAlYIeGHANogcGXN3ogQHXTXpgwBWZGpgErvX0wICrSD0w4PpUDwyVbwGMEMw+GCrfAhgq3wIYeOUb1zeynXfx/cXZ5LWTkN3Ta9YxfpoivEzugiK8pu6BYoYX4F1QhFfrXVCEl/ZdUIT3AV1QFFJsQBHeYXRBEd6OdEGR3qUFRXqXFhTpXX5O0S30Li0oDuVdvF3BZB/je4rWxHWI1qT8RGZvhDZuQGy09jHCO8WhvIsaxaG8ixpFIcUGFIfyLmoUh/IuahSH8i5qFIfyLmoUh/IuWhTNUN5FjSK9SwuK9C4tKNK7tKAopNiAIr1LC4pDeZcU1qMfcjaV/qINfjvZIgT/GGGWvTiM3X6OZvzz1btRu7gO0bnsfrv6F/WhvE431IfyRt1QH8pL9UId/biGQakP5dW6oT6Ut+uG+lBesBvqQuoK1Ifymt1QpzfVoE5vqkGd3lSDOr2pAnX0Q40GpU5vqkGd3lSDOr2pBnUhdQXq9KYa1OlNNajTm2pQpzfVoE5vqkAd/ei/QanTm2pQpzfVoE5vqkFdSF2BOr2pBnV6Uw3q9KYa1OlNNajTmypQRz8gd1Dq9KYa1OlNNajTm2pQF1JXoE5vqkGd3lSDOr2pBnV6Uw3q9KYK1NGPkR+UOr2pBnV6Uw3q9KYa1IXUFajTm2pQpzfVoE5vqkGd3lSDOr2pAvVIb6pBnd5Ugzq9qQZ1elMN6kLqCtTpTTWo05tqUKc31aBOb6pBnd5UgXqiN9WgTm+qQZ3eVIM6vakGdSF1Ber0phrU6U01qNObalCnN9WgTm+qQD3Tm2pQpzfVoE5vqkGd3lSDupC6AnV6Uw3q9KYa1OlNNajTm2pQpze9nros9KYa1OlNNajTm2pQpzfVoC6krkCd3lSDOr2pBnV6Uw3q9KYa1OlNFagbelMN6vSmGtTpTTWo05tqUBdSV6BOb6pBnd5Ugzq9qQZ1elMN6vSmx6hb8WscNtWoS96o+2XJL9QtvakGdXpTDer0phrU6U01qAupK1CnN9WgTm+qQZ3eVIM6vakGdXpTBeqO3lSDOr2pBnV6Uw3q9KYa1IXUFajTm2pQpzfVoE5vqkGd3lSDOr2pAnWhN9WgTm+qQZ3eVIM6vakGdSF1Ber0phrU6U01qNObalCnN9WgTm+qQN3Tm2pQpzfVoE5vqkGd3lSDupC6AnV6Uw3q9KYa1OlNNajTm2pQpzdVoB7oTTWo05tqUKc31aBOb6pBXUhdgTq9qQZ1elMN6vSmGtTpTTWo05sqUI/0phrU6U01qNObalCnN9WgLqSuQJ3eVIM6vakGdXpTDer0phrU6U0VqCd6Uw3q9KYa1OlNNajTm2pQF1JXoE5vqkGd3lSDOr2pBnV6Uw3q9KYK1DO9qQZ1elMN6vSmGtTpTTWoC6krUKc31aBOb6pBnd5Ugzq9qQZ1etPrqd/+f6SuQJ3eVIM6vakGdXpTDepC6grU6U01qNObalCnN9WgTm+qQZ3eVIG6oTfVoE5vqkGd3lSDOr2pBnUhdQXq9KYa1OlNNajTm2pQpzfVoE5vqkDd0ptqUKc31aBOb6pBnd5Ug7qQugJ1elMN6vSmGtTpTTWo05tqUKc3VaDu6E01qNObalCnN9WgTm+qQV1IXYE6vakGdXpTDer0phrU6U01qNObKlAXelMN6vSmGtTpTTWo05tqUBdSV6BOb6pBfSRvapYlyhr2YrKpcF/SOkhr/dMk7WE3Ia4zaqJZKhfbZVkvtiY9X/wL+kjWtBvoIznTbqCPZEx7ge5H8qXdQB/JlnYDfSRX2g30kUxpN9CF0K+HPpIl7QY6HakCdDpSBeh0pArQ6Uivhx7oSD8BXewWh0R5f3GQNYoQHgN0Pu12r9PT+CoXB7NdHaxfKlffRhXiY4TZ1f56XlYgIZtH4Gbv4mRlBZJssM8X/8pCWnRmoX4WsmfBLNTPQjZxmIX6WSjMQmahehayzccs1M9C9j2ZhfpZyEYws1A/C9kZZxbqZyEfFTAL1bMw8tkJs1A/C/nshFmon4V8dsIs1M9CPjthFupnoTALmYXqWchnJ8xC/SzksxNmoX4W8tkJs1A/C/nshFmon4V8dsIsVM/CxGcnzEL9LOSzE2ahfhby2QmzUD8L+exk3Cy0Pm5ZmGp/2qTg1kn849/y2/W/ckWYK8yVg7nC5xDMlaO5wqcFzJWjucKePnPlaK6w885cOZor7I8zVw7mSmYXm7lyNFfYa2auHM0VdoSZK0dzhX1b5srRXBHmCnPlYK6wb8tcOZor7NsyV47mCvu2B3MlOr/livvt4l8c2dNsw5H9vhYcw8JeWBuO7BO14cgeShuO7C+04Sjk2IQjfWkbjvRsbTjSz7ThSD/ThiP9TBOOhn6mDcex/EySbbBLtv49R2OS37phJsVHwy/shR03JDZa+3TtL45j+Rk9jmP5GT2OMhJH42XriZtgl/ccb2Jla4k/Frxbv/tOZiiH0pTMUJ6jKZmhXERTMkP5gqZkhlL6LcnYobR7UzJDqfGmZIbS103JDKWYm5IRkimQoQYukaEGLpGhBi6RGUoDW2O3sK15bi/u9iJdTFsg+dHgMHn5ds/CDqWY9Ti6ofS1Iseh1Lgix6G0uyLHoZS+IkchxyYch3IRihyH8hyKHIdyKIoc6WfacKSfacJR6GfacKSfacNxZj8jZlkDEVl+4/iLzcwepcZGyKbIZmYvUWMzsz+osZlZ89fYzKzja2xm1uYVNn5mvV1jM7OGrrGhLi6zoS4usxGyKbKhLi6zoS4us6EuLrOhLi6zoS4usgnUxWU21MVlNtTFZTbUxWU2QjZFNtTFZTbUxWU21MVlNtTFZTbUxUU2kbq4zIa6uMyGurjMhrq4zEbIpsiGurjMhrq4zIa6uMyGurjMhrq4yCZRF5fZUBeX2VAXl9lQF5fZCNkU2VAXl9lQF5fZUBeX2VAXl9lQFxfZjHUud2M21MVlNtTFZTbUxWU2QjZFNtTFZTbUxWU21MVlNtTFZTbUxSU2cawzOhuzoS4us6EuLrOhLi6zEbIpsqEuLrOhLi6zoS4us6EuLrOhLi6yGeusx8ZsqIvLbKiLy2yoi8tshGyKbKiLy2yoi8tsqIvLbKiLy2yoi4tsxjpHsTEb6uIyG+riMhvq4jIbIZsiG+riMhvq4jIb6uIyG+riMhvq4iKbqc8/rLGhLi6zoS4us6EuLrMRsimyoS4us6EuLrOhLi6zQdfFMW1skjXvLw4S1jCC/yPQx8W/xoqucxuOFf6cu5ZjRdehLceKritbjhVdJ7Ycq0w0VnQd13Ks6Lqs5VjRdVbLsU6km+DPN2s4VvjzylqOdSLdBH+eWMuxTqSb4M/7ajnWiXQT/HlcLcc6kW6CPy+r5Vgn0k3w51m1HOtEugn+vKmWY51IN8GfB9VyrBPpJvjzmlqOdSLdBH+eUsuxTqSb4M87ajnWiXQT/HlELcc6kW6CPy+o5Vgn0k3w5/m0HOtEugn+vJ2WY51IN8Gfh9NyrBPpJvjzalqOdSLdBH+eTMuxTqSb4M97aTnWiXQT/HksLcc6kW6CPy+l5Vgn0k3w55m0HOtEugn+vJGWY51IN8GfB9JyrBPpJvjzOlqOdR7dlODP02g51nl0U4I/76LlWOfRTWmRicY6j25K8OdFtBzrPLopwZ/n0HKsE+km+PMWWo51It0Efx5Cy7FOpJvgzytoOdaJdBP8eQItxzqRboLf77/lWCfSTfD78bcc60S6CX6//JZjnUg3we9n33KsE+km+P3mW451It0Evx98y7FOpJvg92tvOdaJdBP8fuotxzqRboLf77zlWCfSTfD7kbcc60S6aaL9wtNE+4WnifYLTxPtF54m2i88TbRfeJpov/A00X7haaL9wtNE+4WnifYLTxPtF54m2i88TbRfeJpov/A00X7haaL9wtNE+4WnifYLTxPtF54m2i88TbRfeJpov/A00X7haaL9wtNE+4WnifYLTxPtF54m2i88TbRfeJpov/A00X7haaL9wtNE+4WnifYLTxPtF54m2i88TbRfeJpov/A00X7haaL9wtNE+4WnifYLTxPtF54m2i88TbRfeJpov/A00X7haaL9wtNE+4WnifYLTxPtF54m2i88TbRfeJpov/A00X7haaL9wtNE+4WnifYLTxPtF54m2i88TbRfeJ5ov/A80X7heaL9wvNE+4XnRSYa6zy6KU+0X3ieaL/wPNF+4Xmi/cLzRPuF54n2C88T7ReeJ9ovPE+0X3ieaL/wPNF+4Xmi/cLzRPuF54n2C88T7ReeJ9ovPE+0X3ieaL/wPNF+4Xmi/cLzRPuF54n2C88T7ReeJ9ovPE+0X3ieaL/wPNF+4Xmi/cLzRPuF54n2C88T7ReeJ9ovPE+0X3ieaL/wPNF+4Xmi/cLzRPuF54n2C88T7ReeJ9ovPE+0X3ieaL/wPNF+4Xmi/cLzRPuF54n2C88T7ReeJ9ovPE+0X3ieaL/wPNF+4Xmi/cLzRPuF54n2C88T7ReeJ9ovPE+0X3ieaL/wPNR+4dEa83VxtNG/v9hIlHWI3rjHCFPcw7iklaINT9eGO8WRFJkexZG0nh7FkVSkHsWR9KkexZGUrxrFofaS16M4klrXoziSD9CjOJLD0KMopNiAIr1LC4r0Li0o0ru0oIjuXZIzG8W4/LklBX/cwfvw4U8wqISPLpMr4aPr00r46MKwEr70HT66FKqEj65BKuGjF/9K+H1XXfjN8t+HD7//fSX8vqsu/C71lfD7rrrwe8lXwu+76sLv+F4Jv++qC78veyX8rquuWeC3T6/F33XdvcXfdeG9xd915b3F33XpvcXfde29xd918b3F33X1vcXfdfm9xd95/YXfhrsWf+f1F3677Fr8nddf+G2ta/F3Xn/ht5+uxd95/YXfJroWf+f1F34751r8nddf+G2Xa/F3Xn/ht0euxd95/YXfxrgWf+f1F3674Vr8nddf+G2Ba/F3Xn/ht++txd95/YXfZrcWf+f1F3473Fr88PU3bfHn2g+uTVx/FW2Xxy+obQw716Zl/bl1crlybd5+9H17XvvbtXeG8BqgA4bwOgSfIfxWvz0whNdjHTCE14QdMITXpR0wFDL8MUN4fd4BQ3iP0AFD+pSfM6RP+TlDdJ+S3RqI2BQqDG1IW9TmEUZ0uzFbv8YcUn6++BcZ+A2z9cigewo9MuhOQY8Muv7XIyMkUyCDrtX1yKArcD0y6Lpajwy6WtYjQw1cIAO/+bkeGWrgEhlq4BIZauASGSGZAhlq4BIZauASGWrgEhlq4BIZauACGfjNyvXIUAOXyFADl8hQA5fICMkUyFADl8hQA5fIUAOXyFADl8hQAxfIwG8BrkeGGrhEhhq4RIYauERGSKZAhhq4RIYauESGGrhEhhq4RIYauEAGfkN+PTLUwCUy1MAlMtTAJTJCMgUy1MAlMtTAJTLUwCUy1MAlMtTA+2QM/OkYemSogUtkqIFLZKiBS2SEZApkqIFLZKiBS2SogUtkqIFLZKiBC2TgT6jRI0MNXCJDDVwiQw1cIiMkUyBDDVwiQw1cIkMNXCJDDVwiQw1cIAN/SpQeGWrgEhlq4BIZauASGSGZAhlq4BIZauASGWrgEhlq4BIZauACGfiT2vTIUAOXyFADl8hQA5fICMkUyFADl8hQA5fIUAOXyFADl8hQAxfIwJ/Qp0eGGrhEhhq4RIYauERGSKZAhhq4RIYauESGGrhEhhq4RIYauECG58QVyVADl8hQA5fIUAOXyAjJFMhQA5fIUAOXyFADl8hQA5fIUAMXyPCcuCIZauASGWrgEhlq4BIZIZkCGWrgEhlq4BIZauASGWrgEhlq4AIZnhNXJEMNXCJDDVwiQw1cIiMkUyBDDVwiQw1cIkMNXCJDDVwiQw1cIMNz4opkqIFLZKiBS2SogUtkhGQKZKiBS2SogUtkqIFLZKiBS2SogQtkeE5ckQw1cIkMNXCJDDVwiYyQTIEMNXCJDDVwiQw1cIkMNXCJDDXwPhnLc+KKZKiBS2SogUtkqIFLZIRkCmSogUtkqIFLZKiBS2SogUtkqIELZHhOXJEMNXCJDDVwiQw1cImMkEyBDDVwiQw1cIkMNXCJDDVwiQw1cIEMz4krkqEGLpGhBi6RoQYukRGSKZChBi6RoQYukaEGLpGhBi6RoQYukOE5cUUy1MAlMtTAJTLUwCUyQjIFMtTAJTLUwCUy1MAlMtTAJTLUwAUyPCeuSIYauESGGrhEhhq4REZIpkCGGrhEhhq4RIYauESGGrhEhhq4QIbnxBXJUAOXyFADl8hQA5fICMkUyFADl8hQA5fIUAOXyFADl8hQAxfI8Jy4Ihlq4BIZauASGWrgEhkhmQIZauASGWrgEhlq4BIZauASGWrgAhmeE1ckQw1cIkMNXCJDDVwiIyRTIEMNXCJDDVwiQw1cIkMNXCJDDVwgw3PiimSogUtkqIFLZKiBS2SEZApkqIFLZKiBS2SogUtkqIFLZKiBC2R4TlyRDDVwiQw1cIkMNXCJjJBMgcy0GlhcDOtfFsnvLzYSZf3L3rgHjhR3rg7LGkaw4ena8MV8WnWtyHxa3a7IfFpHoMh8Wq+hxtzNe9KfIvNp/ZEi82mdlyLzaT2dInMh88uZ04dez5w+9Hrm9KHXM6cPvZ75UD7UbU1U4/+g8Q6jNWnFaMWEv/+p4+rGOhOzKZmhPF1TMkM5r6ZkhvJHTckIyRTIDOU1mpIZyhE0JTOUbm9KZih13ZQMNXCBzFhnYjYlQw1cIkMNXCJDDVwiIyRTIEMNXCJDDVwiQw1cIkMNXCJDDVwgM9aZmE3JUAOXyFADl8hQA5fICMkUyFADl8hQA5fIUAOXyFADl8hQAxfIjHUmZlMy1MAlMtTAJTLUwCUyQjIFMtTAJTLUwCUy1MAlMtTAJTLUwAUyY52J2ZQMNXCJDDVwiQw1cImMkEyBDDVwiQw1cIkMNXCJDDVwiQw1cIHMWGdiNiVDDVwiQw1cIkMNXCIjJFMgQw1cIkMNXCJDDVwiQw1cIkMNXCAz1pmYTclQA5fIUAOXyFADl8gIyRTIUAOXyFADl8hQA5fIUAOXyFADF8iMdSZmUzLUwCUy1MAlMtTAJTJCMgUy1MAlMtTAJTLUwCUy1MAlMtTABTJjnYnZlAw1cIkMuAYWtwUi7nkfcvsVP7hSrcYvnccPrvqq8YNrs2r84AqqGj+4zqnGD65GKvEL+gl01fjBK3s1/r7rr6CfMlaNv+/6K+inX1Xj77v+CvqpTNX4+66/gn5aUC1+9DN9qvF3Xn/Rz8epxt95/UU/a6Yaf+f1F/3clmr8nddf9DNQqvF3Xn/RzxOpxt95/UU/m6Maf+f1F/2ci2r8nddf9DMjqvF3Xn/Rz1+oxt95/UU/y6Aaf+f1F/1cgGr8nddf9D32q/F3Xn/R96uvxt95/UXf+70af+f1F30f9Wr8nddf9D3Jq/F3Xn/R9/euxt95/UXfK7saf+f1F33f6Wr8nddf9D2cq/F3Xn/R90Ouxt95/UXfW7gaf+f1F32f3mr8nddf9D1vq/F3Xn/R94+txt95/UXfi7Uaf+f1F31f02r8nddf9D1Cq/HD19+wrPHLkt5fbGJa//DitkttDDvXpmV9rzK5XLk2p/B1bc6/X3tnCK8BOmAIr0PwGaLvI3pr9ueVoU/+/cU22u3F55js4+JlD6L36xBTsPJ88Z0MusrSI4Ou3/TIoCtDPTJCMgUy6GpWjwy6TtYjg67A9cig62o9MuhqWY0M+j6iimSogUtkqIFLZKiBS2SEZApkqIFLZKiBS2SogUtkqIFLZKiBC2TQ9xFVJEMNXCJDDVwiQw1cIiMkUyBDDVwiQw1cIkMNXCJDDVwiQw28T8bD74urR4YauESGGrhEhhq4REZIpkCGGrhEhhq4RIYauESGGrhEhhq4QAZ+b2o9MtTAJTLUwCUy1MAlMkIyBTLUwCUy1MAlMtTAJTLUwCUy1MAFMvD7w+uRoQYukaEGLpGhBi6REZIpkKEGLpGhBi6RoQYukaEGLpGhBi6QgT+jQY8MNXCJDDVwiQw1cImMkEyBDDVwiQw1cIkMNXCJDDVwiQw1cIEM/DkpemSogUtkqIFLZKiBS2SEZApkqIFLZKiBS2SogUtkqIFLZKiBC2TgzyrSI0MNXCJDDVwiQw1cIiMkUyBDDVwiQw1cIkMNXCJDDVwiQw1cIAN/XpgeGWrgEhlq4BIZauASGSGZAhlq4BIZauASGWrgEhlq4BIZauACGZ4TVyRDDVwiQw1cIkMNXCIjJFMgQw1cIkMNXCJDDVwiQw1cIkMNXCDDc+KKZKiBS2SogUtkqIFLZIRkCmSogUtkqIFLZKiBS2SogUtkqIELZHhOXJEMNXCJDDVwiQw1cImMkEyBDDVwiQw1cIkMNXCJDDVwiQw18D6ZwHPiimSogUtkqIFLZKiBS2SEZApkqIFLZKiBS2SogUtkqIFLZKiBC2R4TlyRDDVwiQw1cIkMNXCJjJBMgQw1cIkMNXCJDDVwiQw1cIkMNXCBDM+JK5KhBi6RoQYukaEGLpERkimQoQYukaEGLpGhBi6RoQYukaEGLpDhOXFFMtTAJTLUwCUy1MAlMkIyBTLUwCUy1MAlMtTAJTLUwCUy1MAFMjwnrkiGGrhEhhq4RIYauERGSKZAhhq4RIYauESGGrhEhhq4RIYauECG58QVyVADl8hQA5fIUAOXyAjJFMhQA5fIUAOXyFADl8hQA5fIUAMXyPCcuCIZauASGWrgEhlq4BIZIZkCGWrgEhlq4BIZauASGWrgEhlq4AIZnhNXJEMNXCJDDVwiQw1cIiMkUyBDDVwiQw1cIkMNXCJDDVwiQw1cIMNz4opkqIFLZKiBS2SogUtkhGQKZKiBS2SogUtkqIFLZKiBS2SogQtkeE5ckQw1cIkMNXCJDDVwiYyQTIEMNXCJDDVwiQw1cIkMNXCJDDXwPpnIc+KKZKiBS2SogUtkqIFLZIRkCmSogUtkqIFLZKiBS2SogUtkqIELZHhOXJEMNXCJDDVwiQw1cImMkEyBDDVwiQw1cIkMNXCJDDVwiQw1cIEMz4krkqEGLpGhBi6RoQYukRGSKZChBi6RoQYukaEGLpGhBi6RoQYukOE5cUUy1MAlMtTAJTLUwCUyQjIFMtTAJTLUwCUy1MAlMtTAJTLUwAUyPCeuSIYauESGGrhEhhq4REZIpkCGGrhEhhq4RAZdA4fFrGSCmOeL7/GjK9Va/Oh6shI//MlotfjRtVktfnQFVYsfXefU4pfO40fXDLX40St7Lf7O6y/8SVK1+Duvv/CnMtXi77z+wp9wVIu/8/oLf1pQLf7O6y/8yTu1+Duvv/Cn2NTi77z+wp8IU4u/8/oLf7pKLf7O6y/8SSW1+Duvv/CnftTi77z+wp+gUYu/8/oLfxpFLf7O6y/8yQ61+Duvv/CnJNTi77z+wp84UIu/8/oLv3t/Lf7O6y/8Tvi1+Duvv/C7ytfi77z+wu/QXou/8/oLv9t5Lf7O6y/8zuG1+Puuvwl+F+5a/H3X3wS/o3Ut/r7rb1r6rr8Jfg/nWvx9198Evx9yLX70+pvCGog3S36NH73+VuKH3wG4Fj96/a3Fj15/a/Gj199a/Oj1txY/ev2txY9ef2vxo9ffWvyd11/4fU0r8cPvPlqLv/P6C7+TZy3+zusv/K6Ytfg7r7/wO0zW4u+8/sLv1liLv/P6C7/zYS3+zusv/C6Ctfg7r7/wO/LV4u+8/sLvbleLv/P6C79TXC3+zusv/K5rtfg7r7/wO5jV4u+8/sLvBlaLv/P6C7+zVi3+zusv/P5Xtfg7r7/w+1/V4u+8/sLvf1WLv/P6C7//VS3+zusv/P5Xtfg7r7/w+1/V4u+8/sLvf1WLv/P6C7//VS3+zusv/P5Xtfg7r7/w+1/V4u+8/sLvf1WLv/P6C7//VS3+zusv/P5Xtfg7r7/w+1/V4u+8/sLvf1WLv/P6C7//VS3+zusv/P5Xtfg7r7/w+1/V4u+8/sLvf1WLv/P6C7//VS3+zusv/P5Xtfg7r7/w+1/V4u+8/sLvf1WLv/P6C7//VS3+zusv/P5Xtfg7r7/w+1/V4u+7/mb4/a9q8fddfzP8/le1+Puuv3npu/5m+P2vavH3XX8z/P5Xtfj7rr+58/2vcuf7X+XO97/Kne9/lTvf/yp3vv9V7nz/q9z5/le58/2vcuf7X+XO97/Kne9/lTvf/yp3vv9V7nz/q9z5/le58/2vcuf7X+XO97/Kne9/lTvf/yp3vv9V7nz/q9z5/le58/2vct/7X9lFQz8vNqzxL05eQ1L4SpoHUuPta0htZjk6v4aUYnwfkgvJbvHnR/xx+QrJ44UU8EKKeCElvJAyXEiNdEXTkAxeSBYvJIcXEt7q7fBWb4e3eju81dvhrd4Ob/UWvNVb8FZvwVu9BW/1FrzVW/BWb8FbvQVv9Ra81VvwVm+Pt3p7vNXb463eHm/19nirt8dbvT3e6u3xVm+Pt3p7vNU74K3eAW/1Dnird8BbvQPe6h3wVu+At3oHvNU74K3eAW/1jnird8RbvSPe6h3xVu+It3pHvNU74q3eUWH1TiFtF2f3GlLCCynDhZQWvJAMXkgWLySHF5LgheRVQ8qLvIaksHqnZbs4G/sc0uvFaZGva5N7/PrKxrBzbU7r76Jy/v3a+1DjPENN8ww1TzPUvMwzVDPPUO08Q3XzDFXmGaqfZ6jzqKU8j1rK86ilPI1aMstIaims196GZXfGOpJcqo11JL1UG+tIgqk2VplorCNJptpYFTRTdmYbq7N/bnqZJeKFlOBCMgteSAp1LsujgRrda0gWLySHF5LgheTxQgp4IUW8kBJeSFkjJHmE5F9Csg4vpOsXAVlk/duyhPhe9Vhx24v1Io9nZd5/xe87jz90Hn/sPP7Uefy57/gV3olvG7/pPH6LHr9Nj/jDa/yu8/jh628lfvT66/3qXq0P7jn+nb98W47Wv2z2vizoxfp7g13y28GiV3Zv3DbYaN4PNi3rKpjk0TwzYr7Giq4CWo4VXTE0HKugq4uWY0VXIi3Hiq5aWo4VXeG0HKtMNFZ45dRwrEPVV79GkWL4baw7f/gmo9Y/bJ4GKHtP7WzaHrQsv116ZzhU3dZh6IfSA0oMh9IZSgyH0i9KDIfSRUoMhQx/zHAoHafEEL6x1gHDofp1SgzpU37OkD7lxwwDfcrPGdKn/JwhfcrPGdKn/JyhkOFPGcZp83DJdmO4hPcMU1qDeH4hY/8Pm5zMxi4n+/SiRf5qfMdpE1cT+rSOXBP6tBZeE/q0nl8T+rRNAk3o03YVFKGnadsQmtCn7VtoQp+20aEJnY5UAboQ+vXQ6UgVoNORKkCnI1WATkeqAJ2O9HromY5UATodqQJ0OlIF6HSkCtCF0K+HTkeqAJ2OVAE6HakCdDpSBeh0pJdDtwsdqQJ0OlIF6HSkCtDpSBWgC6FfD52OVAE6HakCdDpSBeh0pArQ6Uivh27oSBWg05EqQKcjVYBOR6oAXQj9euh0pArQ6UgVoNORKkCnI1WATkd6PXRLR6oAnY5UATodqQJ0OlIF6ELo10OnI1WATkeqAJ2OVAE6HakCdDrS66HDHzs7JHQ6UgXodKQK0OlIFaALoV8PnY5UATodqQJ0OlIF6PM60pgf0ON76G83/rdjHfitw3Csg8SVGHaVh+k9wxjWa2MML0Pt65zZnw21K1P/s6FCWel7SFBG8x6S4IWkYVLyenCPGF/JUSd+DcTJU44a774GEHofQOx9AKn3AeTOB6ByJmLTAZjeB2B7H4DrfQDS+wB6r8QBqhLfQ4KqrfeQoKrlPSSo+vcrpAhV0e4hQdWoe0gKVccusobkon2/ZKTt2uTydqmNew2SnMLaHc2/X3sfqptnqDLPUP08Qw3zDDXOM9Q0z1DzNEPVONxPa6hmnqHOo5bSPGpJ49A2raHOo5Y0jm0ycdnMVno1WxqHGlVC0jjypxaSwQvJ4oXk8EISvJA8XkgBL6SIFxLe6p3hVm+3wK3eboFbvd0Ct3q7BW71dgvc6u0WuNXbLXCrt1vgVm+3wK3ebsFbvQ3e6m3wVm+Dt3obvNXb4K3eBm/1Nnirt8FbvQ3e6m3wVm+Lt3pbvNXb4q3eFm/1tnirt8VbvS3e6m3xVm+Lt3pbvNXb4a3eDm/1dnirt8NbvR3e6u3wVm+Ht3o7vNXb4a3eDm/1FrzVW/BWb8FbvQVv9Ra81VvwVm/BW70Fb/UWvNVb8FZvj7d6e7zV2+Ot3h5v9fZ4q7fHW7093urt8VZvj7d6e7zVO+Ct3gFv9Q54q3fAW70D3uod8FbvgLd6B7zVO+Ct3gFv9Y54q3fEW70j3uod8VbviLd6R7zVO+Kt3hFv9Y54q3fEW70T3uqd8FbvhLd6J7zVO+Gt3glv9U54q3fCW73x3rV0eO9aOrx3LR3eu5YO711Lh/eupcN719LhvWvp8N61dHjvWjq8dy1dHmmnmLBea5bF/nbxH2OVZaStYmpjHWmvmNpYR9ospjbWkXaLqY1VJhor1H4x95AUarrbtpoR97TXzBZSxAsp4YWU4ULSeAO3FpLFC8nhhSR4IXm8kPCWSoO3VBq8pdLgLZUWb6nUeN21FhLe6m3xVm+Lt3pbvNXb4q3eFm/1tnirt8VbvR3e6u3wVm+Ht3o7vNXb4a3eDm/1dnirt8NbvR3e6u3wVm/BW70Fb/UWvNVb8FZvwVu9BW/1FrzVW/BWb8FbvQVv9fZ4q7fHW7093urt8VZvj7d6e7zV2+Ot3h5v9fZ4q7fHW70D3uod8FbvgLd6B7zVO+Ct3gFv9Q54q3fAW70D3uod8FbviLd6R7zVO+Kt3hFv9Y54q3fEW70j3uod8VbviLd6R7zVO+Gt3glv9U54q3fCW70T3uqd8FbvhLd6J7zVO+Gt3glv9c54q3fGW70z3uqd8VbvjLd6Z7zVO+Ot3hlv9c54q3eGW739Ard6+wVu9fYL3OrtF7jV2y9wq7df4FZvj/dio8d7sdHjvdjo8V5s9HgvNnqDt3rjvWvp8d619HjvWnqNdy2jiWtIKZnnkF4v/tYr+NtQc/792vtQwzxDjfMMNQ001Pd7SHiNl1m1xqrxlqzaWM1EY7UTjdVNNFa5fqx5WS++NX8rY43BfV0b/xjf16WyRu+7jj50HX1Eiv4eUsILKcOFpPEqdC0kgxeSxQvp+rp0q/vrGnArFZV915zNaf3LzsjjL3+FL32H7/sOP4CH70Lewn/aEHVP1IjZhirWxJehxnmGmnSHmpfXVSrDhaTw+ng1pOsrno9hTSWfZCckixeSwwtJ8ELyeCEFvJAiXkgJL6QMF5LC6+PVkPBWb4+3enu81Vvh9XF/6+d9XRwWk99LQ8lrG9A/SXiT3Ff4vu/wQ9/hx77DT32Hn7sOX+E1+qbhm77Dt32H77DDvz0KXcOXtBM+eNWthQ9edWvhg1fdWvjgVbcWPnjVrYUPXnUr4UfwqlsLH7zq1sIHr7o3Rf8wizvho1fdSvjoVbcSPnrVrYSPXnUr4aNX3Ur46FW3Ej561X0ffkKvupXw0atuJfy+q26Cqrr3kKAq6T0kqOp4D+n6iheWLZeCGPsaUsQLKeGFlOFCUtg6oxqSwQvJ4oXk8EISvJA8Xkh4q3fGW70z3uqd4VbvsMCt3mGBW73DArd6hwVu9Q4L3OodFrjVOyxwq3dY4FbvsMCt3mHBW70N3upt8FZvg7d6G7zV2+Ct3gZv9TZ4q7fBW70N3upt8FZvi7d6W7zV2+Kt3hZv9bZ4q7fFW70t3upt8VZvi7d6W7zV2+Gt3g5v9XZ4q7fDW70d3urt8FZvh7d6O7zV2+Gt3g5v9Ra81VvwVm/BW70Fb/UWvNVb8FZvwVu9BW/1FrzVW/BWb4+3enu81dvjrd4eb/X2eKu3x1u9Pd7q7fFWb4+3enu81Tvgrd4Bb/UOeKt3wFu9A97qHfBW74C3ege81Tvgrd4Bb/WOeKt3xFu9I97qHfFW74i3eke81Tvird4Rb/WOeKt3xFu9E97qnfBW74S3eie81Tvhrd4Jb/XGe9cy4L1rGfDetQx471oGvHctA967lgHvXcuA965lwHvXMuC9axnw3rUMeO9aBrx3LQPeu5YR713LiPeuZcR71zLivWsZF7jVO+K9axnx3rWMGu9aerf+7dtzXPcaksLqLXajFKx/Dun14nZn2UaNdziVhqrxbqjWUM08Q7XzDNXNM1SZZ6h+nqGGeYYa5xnqPGrJzKOW7Dxqyc6jluw8asnOo5Y03nX/2FDDeq1ZFrsz1pHkUm2sI+ml2lhHEky1sY6kmGpjHUkyVcbqoDTTPSQobXMPCUqD3EOC0gr3kKBq+j0kqNJ7DwmqQt5Dgipk95Cg6s09JKiy8CskwVu9BW/1FrzVW/BWb8FbvQVv9Ra81VvwVm/BW70Fb/X2eKu3x1u9Pd7q7fFWb413+4MsXxdH/9Tj2/WsYtLXtbeBPKJI/iv8jBT+r5AU3nCPOebV2S9LfE/0FuH6l22Mj18E+S+kCq/Dt43fdh6/6zx+6Tx+33n8ofP4Y+fxJ/T48xqITUZe4899xx/h628lfvD66+yyXuzskybb4gevv9X4wetvNX7w+luNH7z+3uJf3sYPvv47Mev5sE7s8ho/+Ppfiz+Br//V+NHX/1r86Ou/y2mL3/wW/177wa1fdjHyWqwTerH43mC3lXl/sOiVRdxWWeQpjnMzi16GvjfYysyCe0YnMWyDzek1fnDPWI0fXjNU4ofXDO/jz/Ca4RG/f/o51hY/vGaoxI+uGWrxo8uAWvzold1tT7GcN/F9sTMhrZXdRHkM1oj5Gi16tbt5gPUv31LrZzomo5fG7w32vY7J6HU0yjbYP/X+dvJ4yW6N+jbJO3mMXnWTle0vv1bdtKBX3Vr86FW3Fj961a3Fj151a/GjV91a/OgWuRY/ug6oxa/wa7l2v91JC9Rvd74dvsYeKy3DN32Hb/sO3/UdvvQdvu87/K5/s5k09gv5VvjbteJ/D39vqPkx1qfGRPgaKnqFbjhU9GrebqgWvfI3HCq6Smg4VHRF0XCo6Oqj4VBlnqGiq5qGQ0VXQA2HOo9asvOoJTuPWnLzqCU3j1py86glN49a0tiJRWuo86glN49acvOoJTePWnLzqCWZRy0JulpyW/RBKkOt/eYsCbpeajpYdMXUdLAy02DRVVPTwaLrpqaDRVdOTQeLrp2aDhZdPbUcrEfXT98YbFzs+qv9KNm+/8Mmx/Un8taEpwF690VmILnVmMxA2uwNmftYB5Jm1bFKr2O9h9+mIodlfYvARZveh2+NPL4q/omo/QopKYQU3OPbm19DynAhNdoBrmlIBi8kixeSuz4ku61h1jp5DmnnYnHbxfL6+lNqtPWaXvy+8/hD5/HHzuNPncef+44/Lp3Hb9Djt+kRf3iN33YeP3z9rcSPXn+9X18/ts+HgZ95sTxF9GL9vcG+fbE8RfTK7s2mbH2s7AaUlvUP33qDf39poUV0FdByrOiKoeVY0dVFw7EmdCXScqzoqqXlWOEr7HfG6tfGYorht7HutS7cU2fu8Ydl7/A++9hSZfnt0jtD+MLdAcOh9IASw6F0hhLDofSLEsOhdJEOwzyU3lJiOJSOU2KI3gHrgSF6F64HhkKGP2ZIn/JThnmZ1qcsj1N2zBLeM0xpDSIbW/nDJiezscvJPq632XxBn9bYaEKf1glpQp/WOilCN9N6LU3o05ozTejTujlN6NPaP03oQujXQ5/WYGpCpyNVgE5HqgCdjlQBOh3p9dAtHakCdDpSBeh0pArQ6UgVoAuhXw+djlQBOh2pAnQ6UgXodKQK0OlIr4fu6EgVoNORKkCnI1WATkeqAF0I/XrodKQK0OlIFaDTkSpApyNVgE5Hej10oSNVgE5HqgCdjlQBOh2pAnQh9Ouh05EqQKcjVYBOR6oAnY5UATod6fXQPR2pAnQ6UgXodKQK0OlIFaALoV8PnY5UATodqQJ0OlIF6HSkCtDpSK+HHuhIFaDTkSpApyNVgE5HqgBdCP166HSkCtDpSBWg05EqQKcjVYBOR3o9dPgTbYeETkeqAJ2OVAE6HakCdCH066HTkSpApyNVgE5HqgCdjlQBOh3p9dDHOtm8F+h0pArQ6UgVoNORKkAXQr8eOh2pAnQ6UgXodKQK0OlIFaDTkV4PPdORKkCnI1WATkeqAJ2OVAG6EPr10OlIFaDTkSpApyNVgE5HqgCdjvRq6G5Z6EgVoNORKkCnI1WATkeqAF0I/XrodKQK0OlIFaDTkSpApyNVgE5Hej10Q0eqAJ2OVAE6HakCdDpSBehC6NdDpyNVgE5HqgCdjlQBOh2pAnQ60uuhWzpSBeh0pArQ6UgVoNORKkAXQr8eOh2pAnQ6UgXodKQK0OlIFaDTkV4P3dGRKkCnI1WATkeqAJ2OVAG6EPr10OlIFaDTkSpApyNVgE5HqgCdjvR66EJHqgCdjlQBOh2pAnQ6UgXoQujXQ6cjVYBOR6oAnY5UATodqQJ0OtLroXs6UgXodKQK0OlIFaDTkSpAF0K/HjodqQJ0OlIF6HSkCtDpSBWg05FeDz3QkSpApyNVgE5HqgCdjlQBuhD69dDpSBWg05EqQKcjVYBOR6oAnY70euiRjlQBOh2pAnQ6UgXodKQK0IXQr4dOR6oAnY5UATodqQJ0OlIF6HSk10NPdKQK0OlIFaDTkSpApyNVgC6Efj10OlIF6HSkCtDpSBWg05EqQKcjvR56piNVgE5HqgCdjlQBOh2pAnQh9Ouh05EqQKcjVYBOR6oAnY5UATod6eXQzUJHqgCdjlQBOh2pAnQ6UgXoQujXQ6cjVYBOR6oAnY5UATodqQJ0OtLroRs6UgXodKQK0OlIFaDTkSpAF0K/HjodqQJ0OlIF6HSkCtDpSBWg05FeD93SkSpApyNVgE5HqgCdjlQBuhD69dDpSBWg05EqQKcjVYBOR6oAnY70euiOjlQBOh2pAnQ6UgXodKQK0IXQr4dOR6oAnY5UATodqQJ0OlIF6HSk10MXOlIF6HSkCtDpSBWg05EqQBdCvx46HakCdDpSBeh0pArQ6UgVoNORXg/d05EqQKcjVYBOR6oAnY5UAboQ+vXQ6UgVoNORKkCnI1WATkeqAJ2O9HrogY5UATodqQJ0OlIF6HSkCtCF0K+HTkeqAJ2OVAE6HakCdDpSBeh0pNdDj3SkCtDpSBWg05EqQKcjVYAuhH49dDpSBeh0pArQ6UgVoNORKkCnI70eeqIjVYBOR6oAnY5UATodqQJ0IfTrodORKkCnI1WATkeqAJ2OVAE6Hen10DMdqQJ0OlIF6HSkCtDpSBWgC6FfD52OVAE6HakCdDpSBeh0pArQ6Ugvh24XOlIF6HSkCtDpSBWg05EqQBdCvx46HakCdDpSBeh0pArQ6UgVoNORXg/d0JEqQKcjVYBOR6oAnY5UAboQ+vXQ6UgVoNORKkCnI1WATkeqAJ2O9Hrolo5UATodqQJ0OlIF6HSkCtCF0K+HTkeqAJ2OVAE6HakCdDpSBeh0pNdDd3SkCtDpSBWg05EqQKcjVYAuhH49dDpSBeh0pArQ6UgVoNORKkCnI70eutCRKkCnI1WATkeqAJ2OVAG6EPr10OlIFaDTkSpApyNVgE5HqgCdjvR66J6OVAE6HakCdDpSBeh0pArQhdCvh05HqgCdjlQBOh2pAnQ6UgXodKTXQw90pArQ6UgVoNORKkCnI1WALoR+PXQ6UgXodKQK0OlIFaDP60hjfkCP76HbZNbhLeb50jvDeQ1mM4ZxXr/YjuG89q8dw3ndXDuG85qzZgyT9MQwvWcYw3ptjOF1qF05nJ8NtStf8bOhQqn5e0hQWvceEpR0/BWSyrntEteQnKnkqJhlXWTFiDzn6D1+03n8tvP4HXb8zm2e2DmXKhfbnLaLn/7y1yKnch621lj9RGMNI43VhbxdnOLTWPe+3BsXsSa+cInkssslgXOxErahSn5/cVpkdTzucamNe1xyWv9uzr9fe+eSyWWHi1vANZYaF3DtpsYFXBOqcUHXmlpchFx2uaBrWC0u6HpXiwu63tXiQr27z4V6d5eLod7d50K9u89lWr0b1mvNstgdMNMK3hoYIZh9MNNK3hqYaTVvDcy0orcGBl31yrI91JAaGCNxG+3tqf8j6D864S9Xh+0vB/v0K5i0kkHXvWpkLLry1SODrn31yKCrXz0y6PJXjwy6mvkgGVkvDs8D3MhMXJvCOsQQ0isZN1Rt8sZvZJ5+1vYHmftoh6o31dEOVUOqox2qLlRHK0OtaGIeo/WVFc1km7YFMNv851/iOIfe7tBkM5ZGaMsGvemhyWasvkdbNv2qy1/xS78a8B5/v6ruHj+8Totbs9W7+P7ibNzydXF+fjUgxt027rufYDuBl3RaYIRg9sHAS7+PgWn2S3Yn8BqxB4jwYvJbEPPKJbunFz13ITbtaQq87uwDI7xE7QKjh1fKfWCEF+x9YBzLN6hhHEszfg7j+2dsnpX6Lw0eyPl5K3XtmUeYt/pW0cxbUato5q2SVTRj9de+tWQ3fQKgsivykCAn1mJtQY7Vw1MEOXEfry3ISfzBfbCTqPhfg42T6PL7YIdS2t6u39nsY3y/Htwecjy2KE/5aT3IX2iGUtpt0QyltNuiEaIpoRlKDbdFM5S+bYtmKMXaFs1QGrQtmqEUa1M0aV5dY7dHZ/b27x0081YoL+vviqz3e2jmrVBVNJNUqPtgJ6k598FOUkV+DRZ9l/zvDTZsB5DlaN37b3jlV7jo2+/rgRlKSbQEM1R/5Ftg2v3kGP4kgi4gDqVonyE6ea1gQ2nU2mCHUp21wQ6lOlNYn0TmbCqPLW2wm2cN7unXeFm+0AylUc+jiS9oBP5MgmvQiN1BM5Sm/R4avx0WFoL/Dc1OHEtYzf/tn0/dtLz7JnaK228MUnKVq5NdeSQxv117n6Kh1PWYUzSUzh9zioRThD5FQ3mUMadoKGc15hQN5QfHnKKJXWwvUzSxm4aZIr+yTj6+ThH8ySszTNHGI/m0M0XsLiBNUXA7UyScovZTZL1bA7He2x3s9DofwR63IQbjd7DTv6hgpydRwU6foYKd3kEDO/55NGNip8ZXwU4B+Qlrlc36i6vbn9vpC+EfRjMmdgpIFewUkCrYKSA1sOMfGjUmdgpIFewsqcewW1m3m3M2+Qp2F9LGI6S8g50lVQU7S6oGdvwzeMbEzpL6Aezitj2Ob8v4zrPUsU48gsGet1aY5LTzK4OxzlMCxO6XZW+REWLXwM7Grwp2Nn5VsNOlqmCnS1XBTpeqgX2s86/6wU6XqoKdLlUFO12qCnYhdg3sdKkq2OlSVbDTpapgp0tVwU6XqoF9rHMi+8FOl6qCnS5VBTtdqgp2IXYN7HSpKtjpUjWwj3Wg4Qexm23TVGd89cd4bsP+x6kYO9gpID+NPe/8GG+sYxv7wU4BqYJdiF0DOwWkCnYKSBXsfMyhgp2POVSw8zGHBvZEl6qCnS5VBTtdqgp2utS/aGAXYtfATpeqgp0uVQU7XaoKdrpUFex0qRrYxzokvR/sdKkq2OlSVbDTpapgF2LXwE4B+cc///hzb7HHsA4wxscflvBFkXrw5xT9zCeGN6Q4r1qLcTt3PS2uQjG7JOufluURh9kbofN5W3XD8ojDxN0lOm97xlpj3l9szBLX35ve/p3TcyD3CZ1XB76Z0DuaebVasnlD45cdNPP2QVOQDU0Ir2iGOiDRLMuyfklu/xZ5DyfHbYyLeSo0Pn6xGWmxufGI8hhuNpXEWdI6SGv9U5btlQ8THudBRrNULr4t7Nsa79L7i1NeR5jNzhfbjLTmjTlDwhkCn6GRns32OUM5u0fVShWtHvKyhhGyqWj1ZGXFkWywL3p6qONIOfnfnPyRnlNz8r85+SM1Ozn535z8kXq0nPzvTf5Qx9Ry8r85+YP1ezj535l8NrQmnnz2yoAn/z5FwilCnyJ2y+CniD0t+Cli5wl+itgfgp8idnG0p8gsdtmClqWi500O288Tch7mR1mOtlI9D912IO+NtX1dKxzdH/4cCecIao7yzhzR/+HPEQ0g/hzRAeLPES0gvmagB4SfI+EDd/w54nNx/DlinwF/jthnwJ8j4RzBzxH7DPhzRA+LP0f0sNfO0Z06XakCdU+fqUGdzvET1O2yPVi3Zoc6vaAGdbo7DepC6grU6cA0qPPZrQZ16vWPUHdhox7MC/WhTpgHov7Y1sk9nUK8UaeG+QR1J1uuuySv1IXUFahTw2hQp4bRoM5uvAZ19tc1qFOvK1CP7K9rUGd//RPUxW5xSJT3FwdZowjhMUDn99jllJ7GV7lY3PaKo8hTX+KPq++TT4s88eTTqU88+cLJH3Xy/W3qvq725qnk718dglu2OJzZSRV2OZgqB1OFrRmmysFUYT+JqXIwVdgEY6ocTBV27pgqx1Ilsd3IVDmYKuyRMlUOpgo7qkyVg6nC/itT5WCqCFOFqXIsVditZaocTBV2a5kqB1OF3VqmysFUYbeWqXIwVditZaocS5XMbi1T5WCqsFvLVPl1dXTLGnN0NuykCru1TJWDqcJuLVPlYKoIU4WpcixV2K1lqnylivNbqvi4kyrs1jJVDqYKu7VMlYOpwm4tU+VgqrBby1R5TZVgX1IlLOyrMFW+UiU9UuXpcNNHqrCvwlQ5mCrCVGGqHEsV9lWYKgdThX0VpsrBVKFZZqrcU+URcxTnXlPF8EcITJWDqSJMFabKr1RJfh1gTGEvVShrx00V2Q5C8vIU8mPyKVQnnnw+0pt48uk7xp38uJlOnxazM/l87Dbv5Fu+9jDx5LOHMPHk8xH6xJPPh+ITT75w8uedfHb4Bp78sGyTb2vNYGNz2P64W5adn9lZdgSZLIeThR1EJsvhZGHHkclyOFnYoWSyfM35sj3Bvv1779UAx44mk+VwsrADymQ5nCzsmDJZ1mSx4SlZXFXjRNmI2BhM7Xrv0/rE/vbvnHeSkR1cJiNMMgqTkcmIkozscDMZYZKRHXQmI0wyskPPZIRJRj4BYDLCJCOfMDAZUZJR+ASDyXhZMi5bMoZl59Ug4RMSJuPZZHTuKRlr0RhJy0ZQktl5AiN000zGq5LRp0cyxrSTjHTTTEaYZKSbZjLCJCPdNJMRJRk9f7XDZFyTMW1BO2NtNbnMtm/G7d/id5KLv8Jhcn0suYTJxeT6VHLxVzJMro8lF/t0TK6zyRWekivtvMHu2Xdjcn0sudhHY3J9LLnYF2NynU2ux9tpt+SqX199lhqEychkvCgZQ3xq0sadZKQbZTLCJCPdK5MRJhnpdpmMMMlId8xkhElGumkmI0oyRr6zwWSESUa+s8FkhElG/v6OyXhVMtZ+DBr5ez0mI0wyCpORyYiSjHwCw2SESUb2GZmMX3Nu7GN3eON3diiI7AMyWY4mS2KfjslyOFnYR2OyHE4W9rkGTpZtWyUf/U6TM7GvNPHkCyd/3sln32TiyecvRSeefP4yc+LJZ4dy4slnx3Heyc/sIE48+ewITjz57PBNPPns8I07+dmvoH1OO/sZZfr8YSc/LMmvf9mYvW8+ff7Ek0+fP/Hk0+dPO/lxoc+fePLp8yeefPr8iSefPn/iyafVG3fyzQY6mD8dRPJr8g1r/sSTz5o/8eSz5k88+cLJH3fyt6uD/dNLG69XJytrzMmGx2usZs0U/tSXmXIsU/i8kJlyLFPoOJkpxzKFTyKZKccyhY8tmSmHMsXyGScz5VimsDnKTDmWKeykMlOOZQrbrsyUrwF6t52dF3z4fQu5e7IIk4XJcjRZ2KllshxOFjZrmSyHk4X9WibLmiyPEQafdpLFsb3CZPkaYHjsqRzisvPbQ8cOC5NlHaB9lKEoYSdZ2GRhshxOFvZZmCyHk0WYLEyWo8nCPguTZR1gCo9kyWknWdhnYbIcThb2WZgsh5OFP41jshxOFv46jslyNFmEHVwmy+FkYQeXyXI4WdjBZbJ8DTAty5YsyZidZGEHl8lyOFmEycJkOZos7OAyWdYBPv2eJRlbu94+tsy+/TuY2vXep+1xgvc57yQjO8RMRphkZAeayQiTjOxwMxlhkpEddCYjSjJ6duiZjDDJyCcATEaYZOQTBiYjTDLyCQaT8bJk3JrePizLTjIKk5HJeDIZnXtKxlo0RtKy/X3589+/JyPdNJPxqmT06ZGMcedXKYFumskIk4x000xGmGSkm2YywiQjf7XDZFwH6J9+aRz2koW/qmGyHE4W/uqFyXI4WfirFCbL4WRhn4vJcjRZIvtQTJbDycI+EZPlcLKwj8NkOZws/NUCk+VwsgiThclyNFnYwWWyHE4WdnCZLIeThR1cJsvXAJOLW7Ikv7PpfGQHl8lyOFnYwWWyHE2WxA4uk+VwsrCDy2Q5nCxsyjFZvgaYH68GhRxkJ1mEycJkOZostM5MljVZwqMM5bjzRmvmg8R/Y7L8ijlaswV9+7ffSRa2+5ksa7J490iWtPN6cma7f8pkuU8+NcjEk892/MSTz/b6uJNvfdwmP8UfXP1HqqSFzXWmysFUYWudqXIwVdjRYKocTBU+g2GqHEwVYaowVX7FnMJjI4zbv2UnWdgnZbIcThb2SZksh5OFfVUmy+FkYR+WyXI4Wdi3ZbIcTRbDzi2T5StZovFbskRvdpKFvVsmy+FkYfeWyXI4Wdi/ZbIcThZhsjBZjiYLO7hMlsPJwg4uk+VwsrCDy2Q5nCzs4DJZDicLO7hMlqPJYtnBZbIcThZ2cJksh5NFmCxMlnuy3J4qb8mSzLKTLHRDTJavZMlPK0t2eysL3dCPk+UOkk6hDUhHFd0IJBXmQZDRbatkdOEVJJ+fNwLJZ8uNQApBtgHJZ5KNQPJ5XSOQdG9HQYaH/An2FSSdTSOQdDZtQAqdTSOQdDaNQNLZNAJJHXkUZHrIn6cG5gaSVfsgyFtd3lq7Iq8gWbXbgPTTVO37cKeprffhTlMB78OdpgN3H67MNdxpVMh9uNP0nO7DnaYzdB/uNErwPtxp9Nqv4Ya5VFWYS1WFsVSVPMJeJC5/f2s+wvLYzPlhPUwKX2jGUmBN0QjRlNCMpeyaohlLBTZFM5ZibIkmjqU/vodG1uodnke4oZm5QoXHD3fTDpppKtR9uNNUnftwp6kk9+GOVR1uz+C24Wbr33/PjUmPs7ZMeqKzftPH6j40hjNWr6ItnMGON28MZ6w+SGM4Y3VNGsMZS5U2hiOEU4YzloptDGdunZOWDU5ezBOc16uz2SLJ5umXS18g89yV7Tsg7YYk2+cxfoGcuwo2BDl3xWwIcprqeh/uNPXyPtyxuj7V4Y7V9cmPnxPfulzudbhj6ZvqcMfqzFSGmwc77bY63LE0ZnW4YynB6nDH0mvV4cpcwx1LVVWHO5aqqg53KlWVBzsFrTrcoVSVMeHREjTpt+Hu/G2b1x/SuOdA7t44j3VqVVs0Q6m1tmiGUnbfRONC3tD81kd+vVbMhlGsiS8Yh1KMehhlXIz5tZqNdQ7Lbbj2abj5dbhDKVFjl+3VC3P7nJ8tw0Op1rZohlK4bdGMpYa/h6Zd1RnrtAA9jGOp7N8wOnmpZnY05WyehutfhzuWwvWy7fV9ky0/eoMlj3UmQFs0YyncpmjGUsNN0YylhpuiGUsNt0Qz1i7r30Tz9kXCPNYu1d9E8/ZFwjzWvtMmLU8/Mg75PRob4xZIjH/+tV0eayfptmjGqlBN0YxVoZqiGatf0xLNWDsyt0Uzlq75FhoTw9Mm/UFe4YzVhWkMZ6yeTWM4QjhlOBOr4jqciRWOifHxGuPt3/nPcMbatfjbcGJ6wEnhBc401eo+3Gnqz32401SU+3DHqhG3ULfh5hxfhztWN6Q63LE6HNXhjlXTq8MdqxNRG+5YexzXhzuWBqsOdyxVVR3uWKqqOlyZa7hzqaqx9gyuD3coVWWN3cK25vl4p902t81mC2R5/G2Tly84Q2mw1nCGUmyN4Yy1h3RrOEOpwR/AMXYHzlDasTWcoZRmazgyMRy39bntbZA7cIZSsa3hDKV5W8OZWSFX4cyskKtwZlbINThj7YXeGs7MCrkKZ2aFXIUzs0L22waX1gezA2dmnVOFM3G1urUp1qvd8rS9yAYnT1yt6nD6rVb3+PstKPf4+13z7/ELePwxbfEna95fHGTbYyd4k18Hi96IaDpY9ILbdLDojYKmg0U3/k0Hiy6N2g1WFviNs5sOFl26NB0sus5pOlh0UdR0sDLTYOdRULfBzqOgboOdR0HdBjuPgroNdiYFBb/xddPBzqSg4DenbjrYmRQU/EbPTQc7k4KC3+S56WBHUlBxSWvUccm58pff7Ux8AzOS2moKZiRl1hIM/CbMnwPTagvmG8SR1KEaxJFUZzSyQXw+K3v3YkkrQ/8URNpj6OM6Ov80NSZ9IRxJyyohFCL8KcKRdLcSwpHUvBLCoTzCdxA+fgLnfXxGeOcylEVoyGUoh/AdLiGsXEK2L1zcUAbhe1xkuza8chlK83+PyxpytPLKZVoZX+EyrTavcJGRuFhjtrFG//5iI3E76sibp18cp2+fwnDDOJTo1sM4lPDWwziU+NbDOJRW18M4lLRXwwi/5zsKxneHAt0wslIfw/juAKEbxnkrtTfbPun+6YTMPzDe0cxbfato5q2oVTTzVskaGj9UD+x7S7aYBxpfWbJNtmlb4bPNL8944U8p6AbkxFqsLcih2nKaIIUg24Ds1x/c4+9XmN/j71c93+NHl7jJmS3+uLzGD65Db9/29ScK4lNlbbC3Rx7rX47p8XT1j3G/XJzdZnmzi/H9xZXfdaIfvYBCsd3vF9FPfxiQOLgI/iBxMWsNyOLMz1YKcL0hbgtEnLy+DIK+fb2EZa13EuS1XqPvEy5p+3Z7s7zyR9/Kuxo/uAOsxi/Y8d86/Vv8NlaMV1rWRTC5x1Bt3KsOedPBOf9+7Z0L+LqmxgXcn6lxAfd9alzA66saF3CfqsUFfctrNS7gOk+NC7h+VOMCrkvVuAi57HKh3t3nQr27z4V6d5/LtHp3e9/JLIvdATOt4K2AQd82Xw/MtJK3BmZazVsDM63orYFBf0pTecqBvkd+NX5wtVSNH/4pmd+e8oXsXuNH/1XI+/gN+n7z1fjRn1LW4kd/SlmLH/0pZS1+QX/Kuv1lSb5S2EPYXpRLjx+w2dtn3MeKXqtbjhW9rrccK7oGKP9SYEdw+mUN2jxtsWr8+oVFFwwtB4u+l3nlN1AGfXvyavzo1bkWP3p1vv3pNf5bI+/9xeZx+OriKra1Xd/VoO9N3gVD+N9ydsAQXdFAMHzfrjLoO7T3ARFdgnUBEb1x1ANE9F3i+4AIL9J7gDjtOz/Jbx22m/WV54vvZNA9iB4ZIZkCGXS/oEcG3QXokUGX9npk0PW6Hplp3+mvkUHfXl2RzLTv01fJUAOXyFADl8gIyRTIUAOXyFADl8hQA5fIUAOXyFADF8gINXCJDDVwiQw1cIkMNXCJjHCHth/vLGjQzy/ohOK02rrh3nUG/aSDTihOq9m/R7HZzpUG/ayF8YijH+HwSeJxPd0i+8W/qCL0MxkUyUy8v2yFzLQeo0pGSKZAZl7fUCMzsReokJlY31fITKzZK2Qm1tbvyQx1JsTtr22e9obmPRkT/eo6TAyPMLz/IjOSBm5LZiQN3JbMSBq4LRkhmQKZkTRwWzIjaeC2ZEbSwG3JjKSBv0cm55WMXZ5e1bqR2euMuu29rtsz0FeMIwnmT2Jc8juMcV51nf0WxuJsBeMStzb941Lzx5Z1r3845ccKkHJ42pMnmy/q8yp3TerzugJN6vM6Dk3qQuoK1Od1SprU53VhmtTndXia1Cd2j4rUJzabetTRz2QblDq9qQZ1elMN6vSmGtSF1BWo05tqUKc31aBOb6pBnd5Ugzq9qQJ19NMTB6VOb6pBnd5Ugzq9qQZ1IXUF6vSmGtTpTTWo05tqUKc31aBOb3o9dQt/au+Y1OlNNajTm2pQpzfVoC6krkCd3lSDOr2pBnV6Uw3q9KYa1OlNFajDn1k/JnV6Uw3q9KYa1OlNNagLqStQpzfVoE5vqkGd3lSDOr2pBnV6UwXqlt5Ugzq9qQZ1elMN6vSmGtSF1BWo05tqUKc31aBOb6pBnd5Ugzq9qQJ1R2/6M+p3ivSaLSjSO7agSC94iOJjG/inv/ugKKTYgOK0Xs2aZT19yhrrnineyUzrp6pkpvU8VTLT+pIqmWm9gzXObWRyfiEj0+r7KplpNXuVzLQ6vEpmWm1dJSMkUyAzsQaukJlYA1fIgCs9l5xZ/3KKy/PF9/jB9Vgtfg+umqrxg2sbl9IWf7bm/cUmpkc/YrvUxrBzbVrWA6KTy5Vrc1p74zn/fu2dIbgK6oIhuF7qgqGQYZ1hWK81y2J3IIKLsD4gguu1PiCCtzf7gAivj3uACC/SO4AY0J1CdmsgYlOoQLQhbVGbJw/rdmO2a0/ehZSfL76TQfcgemTQnYUeGXS/oEdGSKZABl3a65FB1+t6ZNBFuB4ZdGWtRwZdLquRidTAJTLUwCUy1MAlMtTAJTJCMgUy1MAlMtTAJTLUwCUy1MAlMtTABTKJGrhEZloNLM6tDw/ESa5gtHn7/dhzzF/PGdK0erkpxWm1tbi4/spEpEbRSNyeennzeJxmUty5OixrGMGGp2tX5kLmlzOf1g8oMp/WaSgyn9bDKDKf1h3pMUc/n7xP5rJeHJ7RbcyFzNszD2vMIaQd5tQth5h74zfmTn5jfudILdKGI/VFG47UDG04Ttt//WZNEvPg6Cs1yeRbj2K9PN++83/qGjn0c48HpU7Nq0F94j6zInX2pTWoyxzU74OdxFrdBzuJ/7kPdiiT4uxDAqf4fj2wZvuCWzHhlcxQtqMpmaGMREsy6AfJKpIZSpA3JTOUaG5KZihh25SMkEyBzFBKtSmZoWRtUzLUwCUy1MAlMtTABTLoB1YqkqEGLpGhBi6RoQYukRGSKZChBi6RmVcD+2V9+mH908EsG5l5NbDYbTtlL8v7i9ttzenQDwockPi8ml2JOPoBgQMSn9djaBGf17toEZ/XE2kRFxK/mPi8Hk6L+LzeUIs4PefVxOk5ryZOz3kxcfRDKwckTs/ZnPj7kwMc+imbIyKn67wcuRD51cjpOy9HTuN5OXI6z1fkdzJ0iCUydHIFMvCHnX7wVxVbGLenEuH9xWLSFsXj75rkvyhClYF7SArLpNt2BLKudmz2bT1f58rG+Ng+yK9IU+fx577j1zjfrmn8pvP4befxu87jl87j9+jx5zUQm57q1xZ/6Dx++PpbiR+8/jq75PUv2ydNtsUPXn9r8Ufw+luNH7z+VuMHr7+3+Je38YOv/7cnT9shz2KX1/jB1/9q/ODrfzV+9PW/Fj/6+u8eB1aI+S3+vfaDW7/sYuS1WCf0YvG9wW4r8/5g0SuLuK2yyFMc52YWvQx9b7CVmQX3jLdnD2EbbE6v8Uvn8cNrhkr88JqhEj+8ZnjE75+ezW3xw2uGSvzomqESf0aXAbX40Su7s9sjI2/i+2JnQloru4nyGKwR8zVa9GoX06awY3Y/0zEah2p8cLDvdUxGr6Nx207X/an3t5PHS17DMLdJ3slj9KqbrGyj3am6Gb3q1uJHr7q1+NGr7vv4ZUGvurX40atuLX50i1yLH10H1OKf92en7X5CJGPtXK5Gcd4fh7akOO8PSb9FUTbL43+nuEc8P5CbP59IIRNvy65EfOLt3rWIz/uqoRZx/rj7auLzvmioRVxI/GLi9HtXE6c3vJo4feTVxOk5ryZOz3kx8YmPV9AiTs95NXF6zquJ03NeTVxI/GLi9JxXE6fnvJo4PefVxOk5ryZOz3kx8YmP8dAiTs95NXF6zkPE3QYxSIX4mz98R07TeTlyIfKrkdN2Nkee8hqFs8G8/8Mmxw2GebrY+HWC6FLBJ4im9sIJuiOnq70cOW3tz5D/ojjWwQg2pC1qk2pgthejbxhyZc2V7eUd44174hh3rg6yXhye0aUv6zTWyQgozOP6BQpPL1c9mAuZf4C52ZiHHeZDKflOmA8lzjthPpTe7oT5UIK7E+ZDKe4+mPuhHiV1wnyoh0kozMMacwhphzl96PXM6UOvZy5kfjlz+tDrmdOHXs+cPvR65vSh1zOnD72ceaAPvZ45fej1zOlDr2eOrs9j2rbQTta8vzja7YyUaGNlm8emj5UDuuRGwfj+SXFAV9EwGN82UQO6MO4EI7rW7QNjRJevnWBEV6SdYEQXmZ1gRH9+0QlGIcYGLibSxTTBSBfTBCNdTBOMdDFNMNLFtMCY6GKaYKSLaYKRLqYJRrqYJhiFGFtgpItpghFdNz6fCutihYw1dgvbGv/01HEPjfVpfep4++fjQaLJyxccdDWoCSejazxVOOjKTRUOuh5ThYOuslThyMRwotuO5Yyy7MBBV0SqcNC7tapw0HuwqnBmVshVODMr5Aocv8yskKtwZlbIVTgyMZyQ117I7Z9uB87M1SqlvAaSF78DZ+Jq5Ra7bTe22LwDZ+JqVYUDf+axKpyJq5Vbot3gpN8X5O9dfUc5cfenNcqJe0XfQxmS315JSfFBJHyBFIJsA3LiHlRbkBP3q74J8qaDV5DZxheQE7uFtiCndhYtQU7tQhqChD8xtxuQdDeNQNLbNAJJZ9MIpBBkG5B0No1A0tk0AklncxjkY0OS7F9B0tk0Akln0wYk/Lms3YCks2kEks6mEUg6m12Qdzj8leavQKLIDhz+SvMNHP5K8w0c/kqzDEem/pWmfcBx1d8j2O2gdfcc9ldlk6l/0dkS5MzvRzUFOfO7VN8D6ULeQKZn0fp6rZgNuljzInDhD7AcEvrU735pQZ/arWhBn9oFaUGf2l1pQZ/atSlBhz/GUgn6Hc7UDi9sgcSYduBM7drS9s5ezDvvz8Cf4HhV5uzCEcIpw5na2dTgzKzLkl9/HXP75x6cmfVTDQ78MWmqcGbWOVU4M+ucKpyZdU4VjswMR+x7ONzV4lcgu7tawJ/RpQpnap1TgQN/npYqnKlLeQ3OUMbTpC2O279Dfg/HxOi3y2//flz+1SaFP/zms3BiesB5OqlqhTNUKW8NZ6hS3hrOUKW8MRz4Q2VU4QzVsmgNZyid0xrOUC2L1nCEcMpw5lbIFThUyG/gUCG/gUOFXIYz1sEqxss2WhPs8h5OeLxY+DzCtKIZS+V8D03cdkpIfgfNWBrnm2jeHartxzpSpS2asfRNUzRjqZumaMbSNk3RjKVsmqIZq/PXEE0Y6xiVb6J5e3pnGOsQlbZoZlbDFTQzq+EKGiGaEpqZ1XAFzcxquIJmZjVcQTOzGq6gmVkNv0cz1jFNbdFQDRfRUA0X0Qyla5YkayfcLNn692huT2TSspHMy/MxNK9XZ7NFkk3686vTYawjazRBDqWZPgrSmvVvZ2tfQQ6lsDRBDqXHFEGOdWSNJsihtN5nQTqzgXT5BeRQylAT5FBdVU2QQpBtQNLZNAJJZ9MIJJ1NI5B0NodBbkhuOjK9gKSzaQNyrCNrNEHS2TQCSWfTCCSdTSOQQpBtQNLZNAJJZ9MIJJ1NI5B0No1A0tm0ATnWAVGaIOlsGoGUoUDKI+xF4o9egg1jHYTzTTRvX4INYx1X8100b18xGutQmbZoxtJjTdGMpbBaohnrGJW2aMZSQU3RjNWxbYpmrB7s99C8/wH3WMentEUzsxquoJlZDVfQzKyGK2hmVsMVNDOr4fdoxjpspy2amdVwBc3MariChmq4iEaIpoRmLF2zRNnQmGzeo7FLWgdp7fPZGLL3t2PaHm3Ep/cTbxffQY6lgj4IMpnV1Ztk8yvIsTSTHsixjvnRBDmWHlMEOZZ6UwQ5ltZTBCkE2QbkWF3VT+rIvO3Tkpb0CnKsHqwiSDqbRiDpbBqBpLNpA3KsU880QdLZNAJJZ9MIJJ1NI5BCkG1A0tk0Akln0wgknU0jkHQ2jUDS2Rxto4Xt5L/fDv77ApnpbI6C3KI26fkZ+AqSzqYRSDqbRiDpbBqBFIJsA5LOphFIOptGIOlsjoJ0eQMp8gqSzqYRSDqbJiDjWCdWaoKks2kEks6mEUg6m0YghSDbgKSzaQSSzqYRSDqbRiDpbNqAHOtkyE+CfGxDYqJZKheL3eKQKO8vDvJ4N+8xQOf32OWUnsZXuThYv4IONtX+9B/b8D1SJT0N8Y/r78lCrcxkWZPlscdjSt7tJAv9AJPlcLIIk4XJcjRZ6OuYLIeThd6VyXI4WejPmSyHk4U9CCbL4WThE2Qmy16yBPuaLIOdhc5k+VGyyCNZoq/99bxsmyVn8/jrZu/iZLe/nexTHpo1DdkbZhoCpCG7zkxDgDRkP5tpCJCGwjRkGuqnIXvwTEOANGR3n2kIkIZ8bsA0BEhDPpFgGn6lYbaPnVqzDX9/aTI7dveYLOualR+//MzLzi8/nTBZmCxfK4t5PL7KzuwkC9UQk+XwykLNwmTZ0yxuL1n4Kwomy9FkEf6KgslyOFnohpgsh5OFv0hgsqzJ4h7tvvz0gu0jWfi7ASbL4WQRJguT5Wiy8Bk8k+VwsvBJOZPlcLKwg8tkOZws7OAyWQ4nCzu4TJY1WWoPEj07uEyWw8nCDi6T5XCysIPLZDmcLOzgMlkOJ4swWZgsR5OFHVwmy+FkYQeXyXI4WdjBZbIcThZ2cJksh5OFHVwmy9FkCezgMlkOJws7uEyWw8kiTJZhk8VsV9/yZqklS7Ru++PRys7uq4F9FibL4WRhn4XJsiZLcI9kiXknWdhnYbJ8JYtbwjZCZ3f2dQ7sszBZDicL+yxMlqPJEtlnYbIcThb2WZgsh5OFv5RjshxOFv5SjslyOFmEycJk+UoWeUoW73eShR1cJsvhZGEHl8lyOFnYwWWyHE4WdnCZLGuyuOdk2dlhO7KDy2Q5miyJHVwmy+FkYQeXyXI4WdjBZbIcThZ2cJksh5NFmCxMlqPJwg4uk2VNlrQ8kiXt/KwysYPLZDmcLOzgMlkOJws7uEyWw8nCDi6TZU2W+JQseedUkMwOLpPlcLKwg8tkOZws7OAyWQ4nCzu4TJbDySJMFibL0WRhB5fJcjhZ2MFlsnwli5gt6Ch2Z8uNzA4uk+VwsrCDy2Q5nCzs4DJZDiZLWtjBZbKsybI8J4vsJAs7uEyWw8nCDi6T5XCysIPLZDmcLMJkYbIcTRZ2cJksh5OFHVwmy+FkYQeXyfKVLDY9Nk0W52vXizPb9bK3U1Ra2PFlcp1NLucfyeVN9frkt+AlxbSTjOwoMxnPJqN/DNKFnQ60YQeaydVipdtNLnasmVwfSy52uJlcH0sudsSZXB9LLmFyMblOJtc2Nbd/Z/tzd2nYoWcynk3G/Fjpbg3bneRiR5/J1WCl208uPgFgcn0sufgEgMn1seRiR5/J9anksuzoM7lOJpeY+Egu537uLi2fADAZzyaje1rpxO8kF58AMLlarHS7ycUnAEyujyWXMLmYXJ9KLnb0mVwfSy529Jlca3L5R3LZtOwkCzv0TJbDycKOO5PlcLKwg85kOZosjh1xJsvhZGHHmslyOFnYgWayHE4WdpSZLIeTRZgsTJajycKOL5PlcLKwg8tkOZws7OAyWQ4nCzu4TJajySLsszBZvgaYw/bUOeSYd5KFfRYmy5os+XEQzLLsbN4l7LMwWQ4nizBZmCxHk4V9FibL4WRhn4XJcjhZ2GdhshxOFvZZmCyHk4W/lGOyHE0Wz1/KMVkOJws7uEyWw8nCDi6T5XCysIPLZDmcLMJkYbIcTRb2WYZNFn+buq+rvUlSuTpKWP/27Z87z5w9uyxMlYOpwh4LU+VYqgR2WJgq91QJZt09OwYbd1KF/RWmysFUYXeFqXIwVdhbYaocTBVhqjBVjqUKfxnHVDmYKvxdHFPlYKqwW8tUOZYqkX0Vpso9VXxaY44+7zwDinRATJV7qsS8zmFMzuykijBVmCrHUoUOiKlyT5XkzZYqe+f/RjogpsrBVKEDYqocTBX+XoWpcjBV+HsVpsqxVEnsqzBVDqYKf6/CVDmYKvy9ClPlYKqwW8tUOZgqwlRhqhxLFXZrmSoHU4XdWqbKwVRht5apcixVMvsqTJV7qjz/tGnvyXJmX4WpcjBV2FdhqhxMFfZVmCoHU0WYKkyVe6qE7VdwIaadVOGTZabKV6rkdVpiNP4lVfJCB8RUOZgqdEBMlYOpQgfEVDmYKnRATJWDqSJMFabKsVThk2WmysFU4S/2mSr3VInbcam3f8pOqrCvwlT5SpWnF1GNq1xt/tjHdhti2mnZZcM+DFPrnlrJhC21dh4EZMM+DFPldRXaTRX2YZgqB1OFfRimysFUEaYKU+VYqrAPw1Q5mCr8hT9T5WCqsA/ziVSxbo3a2GCeL/5F3bJF8QnqzjzwOXmlTrevQZ3GWYM6PagGdSF1Bep0RhrUaTI0qPON3I/o9fjAt+RX6vxhgwZ1elMF6o7eVIM6vakGdXpTDer0phrUhdQVqNObalCnN9WgTm+qQZ3eVIM6vakCdRlJr2e//Z4g+xgrzK24B/PHr+RN2h2hzetPCtxz0OEL40gCXBGjEOMhjC7kDWOKTxhfrxWzIRdr4gvykeR0J8hH0tKdIB9JSHeCfCQV3QnykSR0H8j9SM92OkE+0oOd7yF34rcw4lJB7uM6QJ/z07VfFOc1fi0pzuv7WlIUUmxAcV4n15LivOZM0tpXtJJThWLIy3p1yE9F2uyNMFlZ40g22Ffo89ozRejzGjRF6PNaND3oYV6Tpgh9XpumCH1eV6cIfV4TqAh9Xp3u7dZ489b/Bv2OZl6N4WXZ0PjlFU2cd33023Fz1oe0g2beVayKRoimhGbeplMVzcQVqoZm3n5PFc28XZkqGuqaHV1zQgWlefshjUHO2+P4FsiQ/PqnQ4oPHl9P9NPEqrwlxokVfEuMQoyHMObFb+0c+/IznTSxM2iJcWIX0RLjxI6jJcaJ3UlLjHQyLTBm+pgmGOlimmCki2mCkS6mCUYhxhYY6WIOYtwe14fb337BSBfTBCNdTBOMdDFNMNLF/ByjXxa6mCYY6WL2H1Pd0MhIaExe3yTNLob3aP44VmYdojfPL6nuXR0eCfZMI60ZNpQW/CDGuCnq5HcwDqUFP4lx+7VsCjsYh9KCehiH0oJ6GIfSgmoYhzppWxHjUFpQD+NQHW09jEN1tD+IMTxOeEw7GIUYW2Cki2mCkS6mCUa6mCYY6WKaYKSLaYFxqMN4FTHSxTTBSBfTBCNdTBOMQowtMMLrxmXb6F4kv7+46VMq/JM1P0fm/YMn/NMvP0jmbYcK/4RKNTLwGkyNDLysUiMDr5TUyAjJFMjAd2XVyMA3Wj9H5r0Gxj8dUI3MxBq4QmZiDfyejEysgStkJtbAFTITa+AKmYk1cIWMkEyBzMQauEKGGrhEhhq4QKZwpkZcw7HL4wNs3DuHKy3bDswuV67NaX1qkPPv196DSUjBZKBgCmcTKAVjkIKxSME4pGAEKRiPFExACgZpBQ5IK3C4dgUOW1VdFvsaTVygojFQ0VioaBxUNAIVzf5qI9svNIz3j9u83w1n/damJ6lqxHx9Qvr4J+RPf0Jh6+OWn2A+/gn245/gfv4Jfv0tRnr6YdAfn7DjqJa8WhlrlsfVsvudSatVy8bW/rDL6zitLI+fhDjnvgYqswzUzzLQMMtA6+t9/G2g97vSqbvymbuy+/Q6leXjn+A//gnh45/wcWWQP64Mcp7ja22WZZaBmlkGamcZqDtRJcwip+7yZ+4qvFHzrbb77Yqvi719Wqi+2u6m8LZJ049wn/8I+fxH+KYfIcvOR4TPf0T8/Eekz39E/vlHhO1BV7CvP+MzhZ+YN/0I8/mPsJ//CPf5j5DPf4T//EeEz39E/PxHpM9/xOe/3fL5b7d8/tstn/92y+e/3fL5b7d8/tstLb4Xb9+Uu/2BBh/x9kcYxu9n1O0/bB/h5LePuN/mzt0m527z524rrL9iHrf5Cj6TbdpoZ5v/vKurKfyKpfGHpCs+JF/wIYVfkzT+EHPFh9grPsRd8SHh4ytZaKFT3r48a0L6/Efkj39EXD7/ES2qyttXoky0n/8I9/mPkM9/hP/8R4TPf0T8/Eekj0uhmD/+EWn5/Ed8XjMm+/mPcJ//CPn8R/jPf0T4/EfEz3/E57/d6fPf7vz5b3fhefISt9v++Hf+s8IrPCReYt4c1JJMeLktnLstnrstnbttf2KX5NzjtqdDJ+632cJjzOpt5txt9txthXnLftP/t8fz5uW2Asmc1mM4zO0xbni5LZ+6rbAlePU2e2pshb2Kq7cVvjg5u6cg/ctt/txt4dxt8dxt+9N9uzQ/brPPE/C67sjt6/d1sdziePmI/PGPKOzJ2PQjzOc/wn7+I9znP0I+/xH+1Kphw7nb4rnbzi2k9txC6s4tpIWnitXb7Lnb3Lnb5Nxt57LEncsSdy5L3LksKTzMiXG7K6anr83ea6E2bm+R2mjtyye4j3+CfPwT/Mc/IXz8E+LHPyF9/BPypz/BLx//BPPxT/j4d9p//DvtP/6d9h//TvuPf6f9x7/T/uPfaf/x73T4+Hc6fPw7Hb77nb7f5U7dJafu8qfuCqfuiqfuSqfuymfuisupu8ypu07lRjyVG/FUbsRTuRFP5UY8lRvxVG7EU7mRTuVGOpUb6VRupFO5kU7lRjqVG+lUbqRTuZFO5UY6lRv5VG7kU7mRT+VGPpUb+VRu5FO5kU/lRj6VG/lUbuQzueGW5dRd5tRd9tRd7tRdcuouf+qucOqueOqudOquU7lhTuWGOZUb5lRumFO5YU7lhjmVG+ZUbphTuWFO5YY5lRv2VG7YU7lhT+WGPZUb9lRu2FO5YU/lhj2VG/ZUbthTueFO5YY7lRvuVG64U7nhTuWGO5Ub7lRuuFO54U7lhjuVG3IqN+RUbsip3JBTuSGnckNO5Yacyg05lRtyKjfkVG74U7nhT+WGP5Ub/lRu+FO54U/lhj+VG/5UbvhTueFP5UY4lRvhVG6c6ou6U31Rd6ov6k71Rd2pvqg71Rd1p/qi7lRf1J3qi7pTfVF3qi/qTvVF3am+qDvVF3Wn+qLuVF/UneqLulN9UXeqL+pO9UXdqb6oO9UXdaf6ou5UX9Sd6ou6U31Rd6ov6k71Rd2pvqg71Rd1p/qi7lRf1J3qi7pTfVF3qi/qTvVF3am+qDvVF5VTfVE51ReVU31ROdUXlVN9UTnVF5VTfVE51ReVU31ROdUXlVN9UTnVF5VTfVE51ReVU31ROdUXlVN9UTnVF5VTfVE51ReVU31ROdUXlVN9UTnVF5VTfVE51ReVU31ROdUXlVN9UTnVF5VTfVE51ReVU31ROdUXlVN9UTnVF5VTfVE51ReVU31ROdUXlVN9UTnVF5VTfVE51ReVU31ROdUXlVN9UTnVF5VTfVEp9EWz2d4+yT693FXqi+b19Uu7LPn5rr09XludICGlfqtSNBYqGgcVjUBF46GiCVDRRKhoElQ0GSmaALUWB6i1OECtxQFqLQ5Qa3GAWosD1FocoNbicPFa/P6oIwkZKpy4YIVjsMKxWOE4rHC+uyLf7/Kn7gqn7oqn7kqn7spn7krLqbvMqbvsqbvcqbtO5UY6lRv7T1ft0yYT6fkV+72vxa1TtV4bnreL3TvQwj6aDc5Y8/4Pvz/N+R5+7Dv81Hf4uevw95/A9xO+6Tt823f4ru/wpe/wfd/h9111c99VN/dddXPXVdcvXVddv3Rddf3SddX1S9dV1y9dV12/dF11/dJ11fVL11XXL11XXb/0XXVN31XX9F11Td9V1/RddU3fVdf0XXVN31XX9F11Td9V1/RddW3fVdf2XXVt31XX9l11bd9V1/ZddW3fVdf2XXVt31XX9l11Xd9V1/VddV3fVdf1XXVd31XX9V11Xd9V1/VddV3fVdf1XXWl76orfVdd6bvqSt9VV/quutJ31ZW+q670XXWl76orfVdd33fV9X1XXd931fV9V13fd9X1fVdd33fV9X1XXd931fV9V93Qd9UNfVfd0HfVDX1X3dB31Q19V93Qd9UNfVfd0HfVDX1X3dh31Y0wVfceDkwVvYcDUxXv4cBUuXs4MFXrHg5MFbqHA1NV7uHAVIl7ODCr/q9wEswqfg8Ha1VOWKtywlqVE9aqnLBWZZy9fO7hYK3KOHvt3MPBWpVx9sK5h4O1KuPsVXMPB2tVxtlL5h4O1qqMs9fLPRysVRlnL5Z7OFCrcsDZK+UeDtSqHHD2MrmHA7UqhwVqVQ44e4fcw4FalQPO3h73cKBW5YCz98avcHD20riHg7Uq4+x1cQ8Ha1XG2YviHg7WqoyzV8Q9HKxVGWcvh3s4WKsyzl4L93CwVmWcvRDu4WCtyjh7FdzDwVqVcfYSuIeDtSrjvOt/DwdrVcZ5F/8eDtaqjPOu/D0crFUZ5132ezhYqzLOu+b3cLBWZZx3we/hYK3KOO9q38PBWpVx3qW+h4O1KuO863wPB2tVxnkX+R4O1qqM867wPRysVRnnXd57OFirMs67tvdwsFZlnHdh7+Fgrco476rew8FalXHeJb2Hg7Uq47zreQ8Ha1XGeRfzHg7WqozzruQ9HKxVGeddxns4WKsyzruG93CwVmWcdwHv4WCtyljv9gWsd/sC1rt9AevdvoD1bl/AercvYL3bF7De7QtY7/YFrHf7Ata7fQHr3b6A9W5fwHq3L2C92xew3u0LWO/2Bax3+wLWu30B692+0OINJLNda+Nv4fzxCfHbr83c77Kn7nKn7pJTd/lTd4VTd8VTd6VTd+Uzd337rYD7Xadyw5zKDXMqN8yp3DCncsOcyg1zKjfMqdwwp3LDnsoNeyo37KncsKdyw57KDXsqN+yp3LCncsOeyg17Kjfcqdxwp3LDncoNdyo33KnccKdyw53KDXcqN9yp3HCnckNO5Yacyg05lRtyKjfkVG7IqdyQU7khp3JDTuWGnMoNfyo3/Knc8Kdyw5/KDX8qN/yp3PCncsOfyg1/Kjf8qdwIp3IjnMqNcCo3wqncCKdyI5zKjXAqN8Kp3AinciOcyo39J2eSklvvykZe7zL7d5nHXdb+/a1LTot8XZtc3i61Mexcm1P4ujbn36+9R2OhonFQ0QhUNB4qmgAVTYSKJkFFk5GiSQtUNFBrcYJaixPUWpyg1uJ08Voc1mvNstidcAJWOBErnIQVToYKJy9Y4XzXl3z7GVKLTQ0rnxA+/gnx45/w8Wd5LTYIfPsJqcWef5VPaPAAVpb1Wv/7J+xF8/jD1jyuDl/RWKhoHFQ0AhWNh4omQEUToaK59vcwlfKYLt6/rxbOxfv3VcMxWOFYrHAcVjhyaTjWh/ViG56/53t/2GS/+r9bPOYp+PgVvAcOPuVVu9vF/R78jng3wa/q3S65cvVtWHEboV22q53kLzCBYPbBRILZB5MIZh9MJphdMFfvT9kPGEMw+2AsweyDcQSzD0YIZh8MlW8BzBTK9z7UKbTsfahTqNP7UMfRm9Y8hupt5erbM6f16ttDCVe52m2dAXlaBazsjdDktQVirbHvL/Z2/bv+6UnD7dJfc+PGkbzjzc04qnu8uRlH+I83N+N4j/HmRjg3sHMzjgMbb27GMYHjzc04rnW8uRnHZo83N+wLwM6NsC+gOTdh/Z2ZD+Z1btgXwJ0b9gVw54Z9Ac252a4Nv196nxvh3MDODfsCuHPDvgDu3LAvgDs37Avgzg37ArBz49kXwJ0b9gVw54Z9Ady5YV8Ad26EcwM7N+wL4M4N+wKXzc0dOM3+xcDp4C8GTlt+LfBAr30xcBroi4HTFV8MnFb3YuBC4NcCpym9GDid5sXA6TQvBk6neTFwOs1rgUc6zYuB02leDJxO82LgdJoXA6cObwzcugdw8a/AqVIaA4/bMeA2Onf64l+zkyhpFGfHhLCO0IT0+ipOov5Bnh2KJeTZobJCnh3h7CjOTozb/voxv2q2xKcDyLNDC4M8O3zugDw7fEiBPDvsFQDPTmavAHl22CtAnh32CpBnh70C5NkRzg7w7LBXgDw77BUgzw57Bcizw14B8uywV4A7O3lhr0BzdrKx6+xkuzM77BUgz87FvYK8xe6MNZXZWUTWP337d06PP27MHvF1pPEx7RK/xukmGadMMk4/yTjDJOOMk4wzTTLOPMc4zTLJOM0k45xED5lJ9JCRScY5iR4yk+ghM4keMpPoITOJHrKT6CE7iR6yinro6QW/QvduexvQJHmMUsJX7K7j2KXj2H3HsYeOY48dx546jj33G7tbOo7ddBx7x3XVdVxXrz7svmnsHddV13FddR3XVddxXXUd11XpuK5Kx3VVOq6r0nFdvfiwWGdl/b2Mc7U/bJ1df4ljRaq/8jHh8SufJVeuvg0rbiN8+uWOk/wFxhPMPphAMPtgIsHsg0kEsw8mE8wumIuPxuwIjCGYfTCWYPbBOILZByMEsw9mCuV7H+oUWvY+1CnU6X2o4+jNHg/TtOvf9TY+X3qfm3Ek73BzE8ZR3ePNzTjCf7y5Gcd7jDc349if8eZGODewczOOCRxvbsZxrePNzTg2e7y5YV8Ad27YF9Ccm7CscxNezmHIkX0B3LlhXwB3btgX0Jyb7drwesRfjuwL4M6NcG5g54Z9Ady5YV8Ad27YF8CdG/YFcOeGfQHYuUnsC+DODfsCuHPDvgDu3LAvgDs3wrmBnRv2BS6bmztwmv2LgdPBXwyctvxi4PTa1wLPNNAXA6crvhg4re7FwOlfLwYuBH4tcDrNi4HTaV4MnE7zYuB0mhcDp9O8EnhYFjrNi4HTaV4MnE7zYuDU4Y2BW/cALv4VOFWK4oHMby6+zw4ljeZx2SGsB4KbkMzL7BjqH+TZoVhCnh0qK+TZYcNfc3ZiXP+wiflVs118jC1n53uzQwuDPDt87oA8O3xIgTw77BUgzw57BcCzY9krQJ4d9gqQZ4e9AuTZYa8AeXaEswM8O+wVIM8OewXIs8NeAfLssFeAPDvsFWjOTjZ2nZ1sX2fHsVeAPDsX9wqcrI9qnSy2MjuPU8ysdbE2Oy2P+LuBsQSzD8YRzD4YIZh9MJ5g9sEEgtkHEwlmH0wimH0wmWB2wchCMPtgqHwLYKZQvvehTqFl70OVeYY6jt4c7BCr29yMI3nHm5txVPd4czOO8B9vbsbxHsPNjR/H/ow3N+M4sPHmZhwTON7cjONax5sb4dzAzg37Arhzw74A6CG9t7lhXwB3btgXwJ0b9gVAD+MJS2BfAHdu2BfAnRv2BXDnhn0B3LkRzg3s3LAvgDs37Avgzg37Arhzw74A7tywLwA7N5F9Ady5YV8Ad27YF7j2bIlIs38xcCHwa4HTll8MnF77YuA00BcDpyu+GDit7rXAE/3rxcBpSi8GTqd5MXA6zYuBC4FfC5xO82LgdJoXA6fTvBg4nebFwOk0rwWeqcOvPdw6U6UAH26dKWmAj4DN1D/Is0OxhDw7VFa4s2MWNvxxj6YwC58OIM8OLQzy7PC5A/LsCGcHeHbYK0CeHfYKkGeHvQLk2WGvAHl22CsAnh3DXgHy7LBXgDw77BUgzw57BcizI5wd4NlhrwB5dtgrwD0+2Rj2CpBn5+JewW102+wE//yHf4VjrxX4YpJ7YJfKHy5ffI/ddhy7w409JL9tq5Hi4/F++Apd+g3d9xt6AA49L+vKG/LTRvpr6LHf0FO/oeduQ3dLv6ED19Na6MDltBY6cjWthI5cTSuhI1fTSuj9VlPXbzV1/VZT1281lX6rqfRbTaXfair9VtOLT5RvGnq/1VT6rabSbzWVfqup9FtNfb/V1PdbTX2/1dT3W00vPji2aej9VlPfbzX1/VZT32819f1W09BvNQ39VtMAXU1lewyW/Wvo0NX0fejQ1fR96NDV9H3o0NX0fejQ1fR96J8sSb8+gUcftP6Vk1vWa60z8nzxHTh/knkxcP7K8mLg/OHkxcD53uTFwPkq5LXAefTB1cD5wmLrHUCz3YAv/v3FZtl+KW+WkF5nhy8sIs8OX1jUnB3jtk31bo/qXmdHODvAs0N3jDw7tNLIs0PfrTo72wiNSa+qINPCaM6OLOv7m7d/vn53Mv0O8uzQ7yDPDv0O8uwIZ0dxdrzdNJv3y+vs0O8gzw79DvLs0O8gzw4fSiLPDp9g4s6O5cEv0LPDXgHy7LBXgDw77BUgz45wdoBnh70C1dmJ24aUPtvX2WGvAHl22CtAnh32CpBnh70C4NnhwS/Qs8NeAfLssFeAPDvC2VGcHffYgN858zo7dKPIs0M3ijw7dKPIs0M3ijw7dKPAs2PpRpFnh24UeXboRpFnh0+ukWdHODvAs8NeAfLssFegOjsSt9kJr7/6sOwVIM8OewXIs8NeAfDsOPYKkGeHvQLk2WGvAHl22CvAfSPeXnxUKGfne7PDXgHy7LBXgDw7dKOXzc4v4Bcf8emsrKE7V/vDN424ARcxnQB/vy+xvfhgUgK/+DhVAr/4EFgCv/joWgK/+MBdAr/4mGACv/hw4wmAN9yf3158fjNn53uzYzk7sHuMW0/Dizw7wtkBnh1aaeTZoe/GPT3BeloY4OcOgX4HeXbod5Bnh34HeXbod4B3RAzC2QGeHfod5Nmh30GeHT6URJ4dPsFEnh32CoBnJ7JXgDw77BUgzw57Bcizw14B8uwIZwd3r9fIXgHy7LBXgDw77BUgzw57Bcizw14B8Owk9gqQZ4e9AuTZoRsF3nMvCWcHeHboRpFnh24UeXboRpFnh24UeXboRoFnJ9ONIs8O3Sjy7PDJNfLssFeAPDvC2QGeHfYKgHfizewVIM8OewXIs8NeAfLssFeAOztuYa8AeXbYK0CeHfYKcN+Idwt7BcizI5wd4NlhrwB5duhGLz094dZYuxS49WG92AYT3/9hk/L6OpFd3Bj7EjvjCPxa4ELg1wL3BH4t8EDg1wKPBH4t8ETg1wLPBA67P7+zC2cHeHYMZwd2j3FnaXiRZ4fuGHl2hLMDPDv03binJzhLCwP83MHS7wDPjqPfQZ4d+h3k2aHfwd0R0Tn6HeTZEc4O8OzQ7yDPDh9KIs8On2Aizw57Bcizw14B8OwIewXIs8NeAfLssFeAPDvsFeDu9epEODvAs8NeAfLssFeAPDvsFSDPDnsFyLPDXgHw7Hj2CpBnh24Ud8895+lGkWdHODvAs0M3ijw7dKPIs0M3ijw7dKPIs0M3Cjw7gW4UeXb45Bp5dtgrQJ4d9gqQZ0c4O7g78Qb2CpBnh70C5NlhrwB5dtgrQJ4d9gqAZyeyV4A8O+wVAL8RH9krQJ4d9gqQZ0c4O8CzQzd67ekJaRe4LHH7gEfo5o8jI3akxDY5twseWJxzXx8RP/8R6fMfkT/+EftHw7f9CPP5j7Cf/wj3+Y+Q733E/SZ/5qZw5qb975RbF1eJaeem9P2bZP88G4nbCpQe67HJ9uumdOamfOIms/ud8cZ83eSt++2mnRUybdse2pTMU8X4+gTz8U+wH/8E9/FPkI9/gv/4J4SPf0L8+Cekj39C/vQn2I9/p+3Hv9P2499pu59LIusnSHxdLvf3ofRxvem2Cu/cZM980v6S49ey65/F+XbT/iqSVgnrs9u5yZ+5KZy5KZ65af8bmZbtpj0Q+cRN+xuH1G4yZ26yZ25yZ26SMzf59zeFZWee9l/h9TFvN6Wdm3YzImw/V7iJrp2bUuWT9r6E++/hVb65/szX3ZszN+0iN9ZvB03YsINi/5fq9dviudvSudvyqdv2fw1Zv82cu82eu82du03O3VbIkrQ9jLBPr9E9bgv123a8QYjnbkvnbsunbtt/Dmbc8vjF097Cs/+Apn6bPXebO3ebnLvNn7stnLstnrotFeYtPJ6rxZ0qk/ZJPoSh8bLzDUgFJDk/uql+57ZQv23na5riudvSudvyqduyPXfbPknZTsY18tTbfdwWzt22T/JWG7bbwuui4JelcNtjbHHZua0wNr+l8i3/dm4L526L527bzxLJsn0Dlr2x5VO3meXcbebcbbbw7d7mzVu/c5s7d5ucC9Kfuy2cuy2euy2dWSf9fnOiett+x6F+mzl3m5xZubw9tXJ5G87dFk/dlncnILp1aFGeHm7dn0GFZfdbk2VdR7L3r/e4E/fIiXv8iXv2ib8/dC8UltPaXenUXfnMXYW1tHaXOXWXPXWXO3WXnLrLn7rrVG6YU7lhTuWGOZUb9lRu7HdJ368W+wfs5WWtJ9nu3HPim7+/AFY+J524J3//nv02buUe830G7sTK7E6szO7E/LgTK/N+17dyTzxxz34ebN2RHO3rPfn79+x3fCv3mBP32BP3uBP3yIl7anmwd8+JPJATebDf6a3ck79/z36ft3LPifXAn1gP/In1wJ9YD/yJ9cCfyAN/Ig/8iTzwJ/IgfDMP/n77X//vP/3HX//pn//2r/95u+OP//h//u1f/uuv//5vX//zv/6//73+l3/+j7/+7W9//V//+L//49//5V//x//5j3/9x7/9+7/88d/+snz9n/9+m7j4Dzeq6RbNH+l1i0j+IYRkb//b/frvzt3+u7g//vsfN9xaFss/3P6P/+P/8esOn253+BRusd3i+/8B",
143
+ "bytecode": "H4sIAAAAAAAA/7WTPQ+CMBCGi2KUjzjgoD+jBAyM+LG4OLpXCkpUSAB3frqQXENtwKjAJU17FJ5736OVUB0SzDLqEAyyglmBecTtj8vhQY67hakIdfvku9i2lQZ/Peq3FGBKw/Ax4w/UfzwFzr6o+bwXVndWDo1b66g+H0P5Z/9vSP+LD5418GpAXnmew/oS5Nt74t+Oz8c5SNnXTR1EgnIxdK5CSd0lcZ4SP99QmgZZJhJGDWTUQlU56pVE8YG26fmRdgrSLEpikSZ/Sav6yu6lXLyr8eA57hCOizHTMAb+BDV3X+b2+feXkKuCJ+bT+1Nn6BAztEhI1oRS2yeGwK+CP38vlizs4eEFAAA=",
144
+ "debug_symbols": "rZLLqoMwEIbfZdYucr/4KuVQosYSCFGiHijiuzeWWKSWduNmyISP4Uvmn6Gx1XS7utB2A5SXGXxXm9F1IXXzUkAVnffudt1fA1oLpk9+6E1Y22E0cYQSI4ZVATY0z7OUaUbrvIVS86U44FKJDCvEXqggH1BOeEY5Ry8UU7n8FYDZCTKKyk2G6+8yjOqMMqEOMvwMGcU2Ga2+ywi0/Ywg4iAjTpDRhGRYU/5DRqGMSvS2piW1/yY6U3mb49VOod6lbbz39i14fexq20zRrhHcpS/VS3oCoWlsGv0A",
171
145
  "brillig_names": [
172
146
  "sync_notes"
173
147
  ]
174
148
  },
175
149
  {
176
- "name": "get_update_delay",
150
+ "name": "update",
177
151
  "is_unconstrained": true,
178
152
  "custom_attributes": [
179
- "public",
180
- "view"
153
+ "public"
181
154
  ],
182
155
  "abi": {
183
- "parameters": [],
184
- "return_type": {
185
- "abi_type": {
186
- "kind": "integer",
187
- "sign": "unsigned",
188
- "width": 32
189
- },
190
- "visibility": "public"
191
- },
156
+ "parameters": [
157
+ {
158
+ "name": "new_contract_class_id",
159
+ "type": {
160
+ "kind": "struct",
161
+ "path": "aztec::protocol_types::contract_class_id::ContractClassId",
162
+ "fields": [
163
+ {
164
+ "name": "inner",
165
+ "type": {
166
+ "kind": "field"
167
+ }
168
+ }
169
+ ]
170
+ },
171
+ "visibility": "private"
172
+ }
173
+ ],
174
+ "return_type": null,
192
175
  "error_types": {
193
176
  "206160798890201757": {
194
177
  "error_kind": "string",
195
178
  "string": "Storage slot 0 not allowed. Storage slots must start from 1."
196
179
  },
180
+ "2920182694213909827": {
181
+ "error_kind": "string",
182
+ "string": "attempt to subtract with overflow"
183
+ },
197
184
  "5019202896831570965": {
198
185
  "error_kind": "string",
199
186
  "string": "attempt to add with overflow"
200
187
  },
201
- "11343565365413149907": {
188
+ "6504213605561840204": {
202
189
  "error_kind": "string",
203
- "string": "Function get_update_delay can only be called statically"
190
+ "string": "New contract class is not registered"
204
191
  },
205
- "16761564377371454734": {
192
+ "10019982601749771606": {
193
+ "error_kind": "string",
194
+ "string": "msg.sender is not deployed"
195
+ },
196
+ "14225679739041873922": {
197
+ "error_kind": "string",
198
+ "string": "Index out of bounds"
199
+ },
200
+ "17595253152434889169": {
206
201
  "error_kind": "string",
207
- "string": "Array index out of bounds"
202
+ "string": "offset too large"
208
203
  },
209
204
  "17843811134343075018": {
210
205
  "error_kind": "string",
@@ -212,10 +207,10 @@
212
207
  }
213
208
  }
214
209
  },
215
- "bytecode": "JwACBAEoAAABBIBJJwAABAMnAgEEACcCAgQAHxgAAgABgEglAAAARSUAAABvLgQAAYBIKAIAAgSASCcCAwQBOw0AAgADKgCAQwAAAAABAAAAACgAgEQAAQAoAIBFBAADKACARgQAACgAgEcEAAEmJQAABQktCAECAAABAgEnAgMBAC0OAwItCAECAAABAgEnAgQAAC0OBAItCAECAAABAgEnAgUAAi0OBQIeAgACCScCBQABCjgCBQYkAgAGAAAAxiUAAAUyHgIAAgEtCAEGJwIHBAMAEAEHAScDBgQBACgGAgctDAcILQ4FCAAoCAIILQ4CCC0IAQInAgUEBAAQAQUBJwMCBAEAKAICBS0MBQctDgQHACgHAgctDgQHACgHAgctDgQHLQ0CBQAoBQIFLQ4FAisCAAUAAAAAAAAAAAIAAAAAAAAAAC0IAQcnAggEBQAQAQgBJwMHBAEAKAcCCC0MCAktDgQJACgJAgktDgQJACgJAgktDgQJACgJAgktDgUJLQ0CBQAoBQIFLQ4FAi0IAQUAAAECAS0OAgUtDQcCACgCAgItDgIHLQgBAgAAAQIBLQ4HAi0IAQcAAAECAS4KgEYABy0IAQgAAAECAS0OAwgnAgkEAi4IgEYAASMAAAHjDDgBCQokAgAKAAADpCMAAAH1LQ0IBgo4BgMJJAIACQAAAg8nAgoEADwJAQonAgYECS0IAAktDAUKLQwCCy0MBwwtDAgNABAABgAlAAAFRC0EAAAtDQUGLQ0CCS0NBwotDgYFLQ4JAi0OCgcnAgIBAS0OAggBKAAJgEcABS0NBQIKOAIEBQo4BQMEJAIABAAAAnolAAAGnB4CAAMFHAwDBQQcDAUEABwMBAMELwwAAgAEHAwEBQQcDAUCAAI4BAIFCSgABYBDAAIcDAIFBBwMBQQAHAwEBQQCOAIEBgkoAAaAQwACHAwCBgEcDAYEABwMBAYBAjgCBAcJKAAHgEQAAhwMAggEHAwIBwAcDAcIBAI4AgcJCSgACYBDAAIcDAIJARwMCQcAHAwHCQECOAIHCgkoAAqARAACHAwCCwQcDAsKABwMCgIEFgwJChwMBwkEHAwKCwQEOAkCChYMBgIcDAQGBBwMAgkEBDgGCAIMOAMFBigCAAMEDhAkAgAGAAADhiMAAANpHAwEBQQEOAUCBAQ4CQMCADgEAgMtDAMBIwAAA6McDAcCBAQ4AgoEBDgLAwIAOAQCAy0MAwEjAAADoyYkAgAKAAADsSMAAAT4JwILBAIMOAELDCQCAAwAAAPIJQAABq4AKAYCCwA4CwEMLQ0MCi0NBwstDQgMCjgMAw0kAgANAAAD9CcCDgQAPAkBDgsoAAuARQAMJAIADAAABIUjAAAECS0NBQstDQIMLQ0HDS0NCA4nAhAEAww4DRARJAIAEQAABDAlAAAGri4EAAuAAygAgAQEAAQlAAAGwC4IgAUADwAoDwIQADgQDREtDgoRASgADYBHAAoOOA0KCyQCAAsAAARwJQAAB04tDg8FLQ4MAi0OCgctDg4IIwAABPgnAgsEDC0IAAwtDAUNLQwCDi0MBw8tDAgQABAACwAlAAAFRC0EAAAtDQULLQ0CDC0NCA0uBAALgAMoAIAEBAAEJQAABsAuCIAFAA4AKA4CDwEoAA+ARgAQLQ4KEC0ODgUtDgwCLgqARwAHLQ4NCCMAAAT4ASgAAYBHAAotDAoBIwAAAeMoAIAEBHgADQAAAIAEgAMkAIADAAAFMSoBAAEF96Hzr6Wt1Mo8AQECJioBAAEFnWxwmVvf/NM8AQECJiUAAAUJLgiARgAFIwAABVQNKAAFgEUABiQCAAYAAAXEIwAABWktDQEFLQ0CBi0NAwctDQQIJwIJBAQtCAEKJwILBAUAEAELAScDCgQBACgGAgsnAgwEBAAoCgINPw8ACwANLQ0KBgAoBgIGLQ4GCi0OBQEtDgoCLQ4HAy0OCAQmLQ0DBgw4BQYHASgABYBHAAYkAgAHAAAF4iMAAAaTLQ0BBy0NAggtDQMJLQ0ECicCDAQEDDgFDA0kAgANAAAGCSUAAAauACgIAgwAOAwFDS0NDQsnAg0EAww4BQ0OJAIADgAABi4lAAAGrgAoBwINADgNBQ4tDQ4MADgLDA0nAgwEBAw4BQwOJAIADgAABlglAAAGri4EAAiAAygAgAQEAAUlAAAGwC4IgAUACwAoCwIMADgMBQ4tDg0OLQ4HAS0OCwItDgkDLQ4KBCMAAAaTLQwGBSMAAAVUKgEAAQUC3G4ngHYSnTwBAQImKgEAAQXonQn+oREtDjwBAQImLgGAA4AGCwCABgACgAckAIAHAAAG2yMAAAbmLgCAA4AFIwAAB00uAAABgAUBAAABgAQAAQEAgAOABIAJLgCAA4AKLgCABYALCwCACoAJgAwkAIAMAAAHOS4BgAqACC4CgAiACwEAgAoAAoAKAQCACwACgAsjAAAHCCgBgAUEAAEDAIAGAAKABiMAAAdNJioBAAEFRafKcRlB5BU8AQECJg==",
216
- "debug_symbols": "7Z3dTt04EMff5VyfC3vs8QevslohoLQ60hFUQFdaVX33TeDYCdhKiMfdOvLcIAKezD+/TDJjx3F+Hr7c3/74dn16+Pr4fLj66+fh/Hh383J6fBi2fv46Hm6fTufz6dv1/M8HMf6Q0rwaPH+/eRi3n19unl4OV9Y6ezzcP3w5XDkp7bCLr6fz/eFKSv/r7+NBgiiywhIrVeRL6SIrV2KlVZFVkS+EIquis2xkkVWRL5s9y0PIgLyYDb9r9c7umHqRwl+a26F9bG10prEHA5fGHty7xq+K8DOKMDkSJwrtCv15VWiXjT/jRTAzfmR8scIcQe2UvjTWTsMyboc24Hbo7AfcILKHYVw0GpSJZTlSGBUOWcpZrBiRa+1MaOxdbKvkRY5tSo6EtuS0RQfaogNt0VGyLTnYlBwt2pKj/285GOSAgHdyMunVawzp1ftpz2BtprWKe9YwSYbcjkH6kEhguNctN0YI+0Ww86av/Bzzo/BDxfxI/Dj+SPwMxx+NH8cfiZ8F5kfiZ5gfhZ+TzI/ED5kfhZ8XzI/ETzO/NX5GBH5GJvy4fqHwU4LrZxo/y/zW+MW25n3TkR/w9Uvip7j/QePH1y+Jn+b4o/Hj+CPxQ44/Gj8efyHxM9z/pfHj8RcaP8/8KPysZn4kftx/I/FzPP5C48f1cwrF80OhDBSudBMoWnD5moGiGUoKhQvNFIrk7J2Bwik5hQI8TpWBwik5haI4JWeg8DBRBgqn5BSK5pScgcKjNCkU1AwlhcKRkkLhlwwyUDoduQQ1QZm9Jf0GBUWfI29WhtfowSpV3PiVYJ+V3haC0kzHZ9zHKYko++xA1CTYZxKsSBD6TA41CfY5iraJoLXx1Xjrk1zc6dTYmgT7HJ+rSFBzLqYS1EyQSJCrGSLBTicZ1yTI1QyRoOEYpBLkaoZI0HI1QyWomSCRIFczRIKOMwmVIGcSIsFOlw2pSZCfk1AJ9jl9ZhNBLwMM6eEjQdPp4hcVCcoKz4ulc8HD/Il0nuDQEw+th4cOE0MJkFWPGNXbWWsr3+SbXcuHfdMHv2v5ar0vpFfkK6fCpajcuIr8zEXa2ggXBBnhp7Xq88vPOxWO1Tl81/hVvK8r3qqEj9a/38XvPwqscRQu5AjlBa6cZZytt4YoV1pbdGE+jzVi5QsQVkUhVgMsNx6y2VR+SC2SEPrE0gG1ybhpJStYu1pAxn2D9GaWbd9O7Cfe3G9Zvm2c/qA/yAfEVH7j9EHaKN/4RP4nJg/+UfkqftUERsmJfLdr+X7f9H3r9AGjfExi34rW6UOc4apmCT3I/0SX5Y/K1yIIAS0z8s2u5cO+6UPr9CGmLY0uka9apx9LX9BWpvJ94/J9rHlQpPSrdIj+oPx908fG6SPEO8+82xflN05/+vweoEnqfWts4/J97G0ZoRP5n/hMRtPy903fNU7fTH1do9M7j2ucvpn6usakdx7feFfduEm+tx/lO9H4QMma/H3Tl43TX77zOKn3Tb/xomFFPuybPrReMC/2dZ1qfJxnud53qvFRthX5et/0dWX6s09z5wUNz0iCfBBiFs3CjoK87nO+kRJmGorW88YjFOxzGtsKFI6UFEqnS4isQOlzLvcyFMuRkoHCkZJC6XQiP/hYdiuBy42liHM1h0N1CcE+J/JXJNjpRP5NBKWajg9lQrDPcqkeQSk6/YhlVYR9JtiaCCWn43WEJk4Jl84lCBVfyKsItQjjNMOvaRR2+kHLmgh1n4s4VkXIRQ0ZYZ+vJ25CiBCPD1EkCDtd4bkqQo5CKkLDGZmK0HJpTUbIHTwqQsdFDRUhDxfSEfKYNRGh7HSV/qoIOQqpCDtdp38bwghDoocUIRc1VISdrtRfE6HidEJGyOmEirDTpearItSMkIqQMzIVYadrpW9CqKZV9ZRKnp3IThdLr4qQMzIVYafLpVdFyBmZjJAzMhUhT7SmI+SihorQcxSSEXJRQ0QIgosaMkLNCKkIuahZR6htRGiSx08gOQqpCIEH/skIOSNTEXb6neOqCLl3QkXIM/7pCHmuNfGlCUCezUBGyPdCKsJOF3upiZBn/H9AOFJRRueo2PgFHqtVYpOfte51cOQx9eP8dpv8RyVWbOxmG52fvLu8TMVgZUqs8lM0V62wxAqKfEGRL1XkSxX50kW+dNH5wiJfWHRc+Tfj1qzyqWHVypZY2aIrxZrN9xjtsty9CB8S8ZCx2X5fwvxVvOgHpSiw0QU2brsNwHYGsP2eiarAT/66XbEpOKdY4AdL/ORzGoa4nn+iMNjk8+2KTYGf/Pryyzb5h9IrNgV+fIGf/HO22flJbUw+ry+eUyPMdhtZ4Edur4dMfvHlZRslCmy23w+MhgIbt90GVYFNgR9TcDymIHZswfmxG+Pg17D1z83T6eb2fP88WIz//PFw93J6fLhsvvz7Pfzn9ul0Pp++XX9/ery7//Lj6f76/Hg3/u8gLj/+UsocFdpRy7gJCEd42xwvBIXuOIxFDV4Hz/8B",
210
+ "bytecode": "JwACBAEoAAABBIBQJwAABAMnAgIEAScCAwQAHxgAAwACgE8uCIBPAAElAAAARSUAAAC+KAIAAQSAUCcCAgQAOw0AAQACKACAQwAAAywAgEQAAAAAAA6S+filNOhY/Pd32iBuCLDGIOz53rIdE0eYE/YqAIBFAAAAAAEAAAAAKACARgABACgAgEcEAAMoAIBIAQAAKACASQQAACgAgEoAAAAoAIBLAQABKACATAQAASgAgE0AAAEoAIBOBAAEJiUAAAkiLQgBAwAAAQIBLgqASAADLQgBAwAAAQIBLgqASgADLQgBAwAAAQIBJwIEAAItDgQDHgIAAwEeAgAFADM4AAMABQAGJAIABgAAARIlAAAJSzMoAAGAQwAFJAIABQAAASclAAAJXSsCAAUAAAAAAAAAAAIAAAAAAAAAACcCCgQLLQgACy0MBQwAEAAKACUAAAlvLQQAAC0MDAYtDA0HLQwOCC0MDwktDQYFACgFAgUtDgUGLQ0HBQAoBQIFLQ4FBy0IAQUAAAECAS0OBgUtCAEGAAABAgEtDgcGLQgBBwAAAQIBLQ4IBy0IAQgAAAECAS0OCQgnAgkECi0IAAotDAULLQwGDC0MBw0tDAgOLgiATQAPABAACQAlAAAKDy0EAAAnAgkECi0IAAotDAULLQwGDC0MBw0tDAgOLQwDDwAQAAkAJQAACg8tBAAAJwIKBAstCAALLQwFDC0MBg0tDAcOLQwIDwAQAAoAJQAACzgtBAAALQwMCQsoAAmASgAFCygABYBIAAYkAgAGAAACVSUAAAusLQgBBScCBgQEABABBgEnAwUEAQAoBQIGLQwGBy4KgEoABwAoBwIHLgqASgAHACgHAgcuCoBKAActCAEGAAABAgEtDgUGLgiASQACIwAAAqUNKAACgEcABSQCAAUAAAjTIwAAArotDQYFLQ0FBgAoBgIGLQ4GBQEoAAWATAAHLQ0HBicCBwQCADgFBwotDQoIASgABYBHAAstDQsKLQgBBScCCwQEABABCwEnAwUEAQAoBQILLQwLDC0OBgwAKAwCDC0OCAwAKAwCDC0OCgwtDQUIACgIAggtDggFJwIKBAstCAALLQwFDC4IgEwADQAQAAoAJQAAC74tBAAALQwMCCcCCwQMLQgADC0MBQ0tDAcOABAACwAlAAALvi0EAAAtDA0KASgACIBMAActDQcFASgACoBMAAgtDQgHHAwGCgQcDAoIABwMCAYELQgBCAAAAQIBLQ4FCC0IAQoAAAECAS0OBwotCAELAAABAgEtDgYLLwwACQAMHAwMDgQcDA4NAAI4DA0OCSgADoBFAAwcDAwOBBwMDg0AHAwNDgQCOAwNDwkoAA+ARQAMHAwMEAEcDBAPABwMDxABAjgMDxEJKAARgEYADBwMDBIEHAwSEQAcDBESBAI4DBETCSgAE4BFAAwcDAwTARwMExEAHAwREwECOAwRFAkoABSARgAMHAwMFQQcDBUUABwMFAwEFgwTFBwMERMEHAwUFQQEOBMMFBYMEAwcDA8QBBwMDBMEBDgQEgweAgAQBRwMEBYEHAwWEgAcDBIQBAw4EA4SKAIADgQOECQCABIAAATSIwAABLUcDA8SBAQ4EgwVBDgTDhIAOBUSDi0MDgIjAAAE7xwMERIEBDgSFBMEOBUOEgA4ExIOLQwOAiMAAATvADgQAhIOOBASEyQCABMAAAUGJQAADD4MOBAGAhYMAgYcDAIQABwMBgIABDgQBQYEOAIHBQA4BgUCLQ4CCC0OAQotDhILHAwSBQAnAgYAICcCCgQVLQgAFS0MBBYtDAYXABAACgAlAAAMUC0EAAAtDBYHBDgNBwYAOAUGBxwMDwUAJwIGAEAnAg0EFS0IABUtDAQWLQwGFwAQAA0AJQAADFAtBAAALQwWCgQ4BQoGADgHBgUcDAwGACcCBwBIJwIMBBUtCAAVLQwEFi0MBxcAEAAMACUAAAxQLQQAAC0MFgoEOAYKBwA4BQcGHAwRBQAnAgcAaCcCDAQVLQgAFS0MBBYtDAcXABAADAAlAAAMUC0EAAAtDBYKBDgFCgcAOAYHBRwMFAYAJwIHAHAnAgwEDy0IAA8tDAQQLQwHEQAQAAwAJQAADFAtBAAALQwQCgQ4BgoEADgFBAYtCAEEJwIFBAQAEAEFAScDBAQBACgEAgUtDAUHLQ4GBwAoBwIHLQ4CBwAoBwIHLQ4BBy0NBAUAKAUCBS0OBQQrAgAFAAAAAAAAAAADAAAAAAAAAAAnAg8EEC0IABAtDAURABAADwAlAAAJby0EAAAtDBEHLQwSCi0MEwwtDBQNLQ0HBQAoBQIFLQ4FBy0NCgUAKAUCBS0OBQotCAEFAAABAgEtDgcFLQgBBwAAAQIBLQ4KBy0IAQoAAAECAS0ODAotCAEMAAABAgEtDg0MLgiASQAOIwAABx8NKAAOgEcADSQCAA0AAAiJIwAABzQnAg8EEC0IABAtDAURLQwHEi0MChMtDAwUABAADwAlAAALOC0EAAAtDBEOLQ0EBQAoBQIFLQ4FBC0IAQQnAgUEBQAQAQUBJwMEBAEAKAQCBS0MBQctDgYHACgHAgctDgIHACgHAgctDgEHACgHAgctDg4HLgiASQANIwAAB7INKAANgE4AAiQCAAIAAAhaIwAAB8ctDQgCLQ0LBBwMBAUAJwIGBAUnAggEAwA4BggHLQgBBAAQAQcBJwMEBAEAKAQCBy0OBgcAKAcCBy0OBgcnAgcEAwA4BAcGLQwGBy4KgEQABwAoBwIHLQ4DBwAoBwIHLQ4CBwAoBwIHLQ4BBwAoBwIHLQ4FBycCAQQFACgEAgUtDQUDJwIGBAIAOAUGAjcNAAIAAyYcDA0CAAA4CQIFACgEAgYAOAYNBy0NBwIwDAACAAUBKAANgEwAAi0MAg0jAAAHsgAoBAIPADgPDhAtDRANJwIPBBAtCAAQLQwFES0MBxItDAoTLQwMFC0MDRUAEAAPACUAAAoPLQQAAAEoAA6ATAANLQwNDiMAAAcfLQ0GBRwMAgcAADgJBwgvDAAIAAcuBAAFgAMoAIAEBAAEJQAADVAuCIAFAAgAKAgCCgA4CgILLQ4HCy0OCAYBKAACgEwABS0MBQIjAAACpSgAgAQEeAANAAAAgASAAyQAgAMAAAlKKgEAAQX3ofOvpa3UyjwBAQImKgEAAQWLDiEWkOO1VjwBAQImKgEAAQVaQ5vQPsayTDwBAQImJQAACSItCAECJwIDBAQAEAEDAScDAgQBACgCAgMtDAMELgqASgAEACgEAgQuCoBKAAQAKAQCBC4KgEoABC0NAgMAKAMCAy0OAwItCAEDJwIEBAUAEAEEAScDAwQBACgDAgQtDAQFLgqASgAFACgFAgUuCoBKAAUAKAUCBS4KgEoABQAoBQIFLQ4BBS4IgEgABC0MAgEtDAMCLgiASQADJiUAAAkiLQ0DBi0NBAcLKAAHgEgACCQCAAgAAAo1JwIJBAA8CQEJCygABoBHAAckAgAHAAAKxCMAAApKLQ0BBi0NAgctDQMILQ0ECQ0oAAiARwAKJAIACgAACm8lAAAN3i4EAAaAAygAgAQEAAQlAAANUC4IgAUACgAoCgILADgLCAwtDgUMASgACIBMAAUOOAgFBiQCAAYAAAqvJQAADD4tDgoBLQ4HAi0OBQMtDgkEIwAACzcnAgYEBy0IAActDAEILQwCCS0MAwotDAQLABAABgAlAAAN8C0EAAAtDQEGLQ0CBy0NBAguBAAGgAMoAIAEBAAEJQAADVAuCIAFAAkAKAkCCgEoAAqASQALLQ4FCy0OCQEtDgcCLgqATAADLQ4IBCMAAAs3JiUAAAkiLQ0EBQsoAAWASAAGJAIABgAAC1onAgcEADwJAQcnAgUEBi0IAAYtDAEHLQwCCC0MAwktDAQKABAABQAlAAAN8C0EAAAtDQEFLQ0CBi0NAwctDgUBLQ4GAi0OBwMuCoBLAAQBKAAGgEwAAi0NAgEmKgEAAQUC3G4ngHYSnTwBAQImJQAACSIBKAACgEwAAw44AgMEJAIABAAAC90lAAAMPg0wgEcAAwAECygABIBIAAMkAgADAAAL+iUAAA7+DSgAAoBHAAMkAgADAAAMDyUAAA3eACgBAgQAOAQCBS0NBQMtCAEBJwICBAIAEAECAScDAQQBACgBAgItDAIELQ4DBCYqAQABBUWnynEZQeQVPAEBAiYlAAAJIi0IAQQAAAECAS4KgE0ABCcCBgQCJwIHAQEtCAEFJwIIBCEAEAEIAScDBQQBACgFAggnAgkEIEMD8AACAAYACQAHAAgnAgoEIC4EAAiAAy4EAAqABCUAAA8QJwICBCEnAgYEIC4IgEwAAyMAAAzDDDgDAgckAgAHAAAM2iMAAAzVLQ0EASYtDQQHBDgHBwgCOAYDBw44AwYJJAIACQAADPolAAAPkAw4BwYJJAIACQAADQwlAAAN3gAoBQIKADgKBwstDQsJHAwJBwAEOAgBCQQ4BwkKAzCATQAHAAkEOAkIBwA4CgcILQ4IBAEoAAOATAAHLQwHAyMAAAzDLgGAA4AGCwCABgACgAckAIAHAAANayMAAA12LgCAA4AFIwAADd0uAAABgAUBAAABgAQAAQEAgAOABIAJLgCAA4AKLgCABYALCwCACoAJgAwkAIAMAAANyS4BgAqACC4CgAiACwEAgAoAAoAKAQCACwACgAsjAAANmCgBgAUEAAEDAIAGAAKABiMAAA3dJioBAAEFxWvEWg4QAAI8AQECJiUAAAkiLgiASQAFIwAADgANKAAFgEcABiQCAAYAAA5rIwAADhUtDQEFLQ0CBi0NAwctDQQILQgBCScCCgQFABABCgEnAwkEAQAoBgIKJwILBAQAKAkCDD8PAAoADC0NCQYAKAYCBi0OBgktDgUBLQ4JAi0OBwMtDggEJi0NAwYMOAUGBwEoAAWATAAGJAIABwAADokjAAAO9S0NAQctDQIILQ0DCS0NBAoAKAgCDAA4DAUNLQ0NCwAoBwINADgNBQ4tDQ4MADgLDA0uBAAIgAMoAIAEBAAFJQAADVAuCIAFAAsAKAsCDAA4DAUOLQ4NDi0OBwEtDgsCLQ4JAy0OCgQjAAAO9S0MBgUjAAAOACoBAAEF9C7lhLv0IdE8AQECJigAgAYEAAIHAIAEgAaABS4AgASACCgAgAkEAAANAIAJgAWAChcAgAqACiQAgAoAAA+PAwCACAACgAgBAIADgAmACy4BgAuABgEAgAOACIALLgGAC4AHAQCAA4AJgAsuAoAHgAsBAIADgAiACy4CgAaACwEAgAkAAoAJIwAADywmKgEAAQUohpKwR9z9QzwBAQIm",
211
+ "debug_symbols": "7V3bbt22Ev0XP/uBMySHnPxKcRAkaVoYMJIiSQ9wUOTfj/ZORMnmSOxmKJsi+VLENZdn1uJtOLzon7vfP77/+8+3D5/++Pz17s1v/9w9fv7w7tvD50/TT/98v797/+Xh8fHhz7fr/32nLv8BtlfA17/efbr8/PXbuy/f7t4459393cdPv9+98QBu+hN/PDx+vHvD9vt/7icQ3w5CZTJAoHJAWZZyOKHNAeVY0jmcdI4loyWQNVb9BFlDPoCs+n4fFTZem5+FjTcYCpNU2FuHszvWu3XhqztedGdyYnbHEiXcIYLZHXIq5Y6ywR2E5+5YWR2rILiDdt8dsG7WH0jrfXfY8vyXmbR57g5B0h3itTtXEGeAnNgALVk9g8i5lyPuMeWOM+o5B1Y5ILGPW28CyHOKuKK5MAAsxMEaUaa5aaNa+o4GEso6NnNrdczLX0bHQmnt5j5sVoqi5DIizH8YcVVXeBVlcmaIEomCMESJRRndRxCFhyiRKHKI07soo6XEomyEqJ2L4oYokSh2TMmCKGNKFkQZA20sCo2BVhDFD1EiURwOUWJRxio5FsWPKVkQZUzJgihjSo5FYTNEiUUZU3IkilFjShZEGavkWBQYU7IgypiSY1FQDVFiUcaULIgypuRYFD3yKYIofU7JGmaXUSM9F8X0GbwlROkzn7Iviu1zSk6I0ueUnBClzyl5XxQaA60gymgpsSiuz+AtIcpoKbEofowpgigjzI9F4T4zbwlR+sy8JUTpczNsVxSrxpQsiDIG2liUTrc4EqKMfEosSqe3OBKi9DklOzOXRWfNc1F0n5m3hChmiBKL0ucqeV+UTrc4EqL0OSXvi9LpFkdClDElx6LQaCmCKGNKFkQpMCWD97MoaGxCFGt59oc8Lv6wl/4021kVYLdoCHR9pMOWuFnwet57c2bvGU/tfTI7xBb3vUfrZu+RlHpiIi5tCHjus2RMorSbPJmHA1KLMuIbIQ7Dyx3TP8268ESVFPRDlbqhCv3UKvRTq9hPraZzac1Q1f3Uqu6nr6YTN+1Q7Sdasrofqv3UKvXTV11TtepVoOqfv0JJ6fuuJ6KqKSSAtHtO1anaG7BbqKLap6rBz4kxjbjkCPSUy7pyrT2GKMi1+mVcSa61R/y3cMWQjNIazBOuUt7Yhbyx8sujslpMdPngtV9ld+WyBCEnpulJ2YviWHsw057itc++zSmuW5oZz6H4aOMvrLhpKUo4h+I8FH9ZxatPvByoePgwwyS+ipXpeLzdV6b6tM7rKTPazIYybrSZLWVGm9lQxnccfyWU6Tins68Mq6HMhjJmKLOhTMerjl1lvKppdXB1qKbJ8uIQ1BTXXB16+W2csHI1TvlEaSA9f3BvKrBa54K+uv8KR7GKum/P7T6f2n19bvWNOrf7J1f/3G3/FRJ5t7kfvvsKDnzsvj+1+6+QEivqfu1Bw777rvaBM+F+7QPnvvv+3Oqn74PV7X7lA6ezHNz35on7QmkIjzUDrL6GjE6JC2MK62L7pOxFGK58THstYVhV3l+nTNVM1a/SHS8gTO1d6bWEgcqjG69VEMbQ8yGSwZ3afTy3+gefzbuYOPim19UEHW7i4OX/1YQ53gQfbuLgpe7VxPGN9uAl49VEgUZLGoIJqxNjgbU4zyPWWkiUvvGmhg/3bwzifmEA7Wg1+/G6+EWZEscRblQm3KmxhKktH4RAFoHjMbXEmYFXdN9Xrv7k//y30drY/crVR3DBfYoyhcy2bve1Cn9bAzx3H1SJ9cur+n9y/aF2/TF88EnHifLJ/9r1RxP8dzr2v8T1oiP9N2reqEADkv/+3P7rk+uva9cfw/RlrI/9N7XrH2JgNE4YPy1U7j+H6McqQX9L5/afTq4/Va6/xTD+rNeAwX9Xuf4Ww9+2ZAX/uXL/WS9JARP7X2LD61X9P7n+XLn+tKx+yQjjD1euPy3LX6J4/AFV+fJ92fCdVu8u9h8qz54k/T+5/li5/onxB7Dy+CGlv648fkj6f3L9Te3x8/76F0zl+Z9E/A+28vxb0v+T608l9PchR+kgtR9PKpSmKfoKpcWtL+/17L739vnG1+S9Lew9P/H+asOpF7DxAjxKnGx0hoMNl2qp02ZZ+GyAUquxa9rBvHg0tftf94iXvsM2Zo3kj7fhXoBHievDSRsF5nKm0EJ4Nd/KLcSb8GEJb57sboDYnlTYBmcDT0pf/Wc4uf+VH51+rUOeoKs/5fl6yow2s6EMjDazpcxoMxvKoKpoBvnhkanOI1+bRwWeb9QqPJ2slbOpNYwNf3pKyqZaP4eDgcyr9Rqj5IfX4f1bHx93mri6drgyzn9ZT6FpzNU0VK9Jrh3Va4EzA+fhajviyv1wTX8JsiGuHdVrgVzOebg2NOf4kP2cuMbnXLRvM0ZkTQLXlmIJu7RhL9QrtxQjeg5chb1KzS3V6z5Xo/qpV1PgYzWn4VogK3cerqYjri3FiAmu2FG9Fsj2nYZrS3nEydM5464UCFxbiv1DPDxxxZhrQ3lEo5YHUxUpgWs79ToRNIGrE+rVtlSvKa4d1Su1kx9Oc20nP5zm2k6MmOTqTEdcO6pX305+OM21pTkn3AObuMY5U9NSHnEdDzthndNQHtGo8IygAYzzw7ahPOJEMMT+0+aNwLWhek1xhY7qFdrJDye5Yjv54TRX0xHXhmLEFFfdUb3qdvLDSa5N5RHDveppmwoFrm3mh6fEd8y1pTwihDt3BpUSuDYUI6IKsT+C0IapoXpNcu2oXl1D+eEk14byw0muDcWIKa4F3q06D9eO6pUbyg8nubaUbwp3DieucexPLZ1HXMXDGH+EaeLaUL0aF87BGB/fpyNoKJZIcm0oj5jiih3VK3ZUr7qjetUNxf5Jrg3FiCmuBT5cdB6uDeWHU1xtQ7F/kutZY8Sr96c9YfjD+7PO91fvXd07vKB0+DClspToJ47N7IljXvYW0LHktwvJeb0ogxJFxPCsDaLW68JXFbnuFnwWFevuSedQ0anRo0uoaIaKBVSsex1xEhUrv7l6FhXrXvucREWsO/N+FhVHpFNART0inRIqjtmlhIpjdimgoqk7Z3cWFevOBp5ExcrfxTyLiiPSKaAijUinhIpmqFhAxZHTKaBi5S+bnkXFEekUULHy11jPouKIdAqoyCPSKaFi3WfVzqLiiHR+XUWvRqRTQsWRXyygIo62+K9UtIuKRJGKlZ+YrUVFFz6Uhc6aWMUxuxRQsfJTvmdRcayjC6hY+Tnms6g41i4lVByzSwEVK3839iwqjrZYQMXK37o9i4o1RTpXj6q6O/LDo5oy2ReP+OXvNBBC8Mgkv4mswhe1p0TN0ppJdETbuYVO/+QnHeUHWdMTWe6ILPRUs9BTzWJPNfvyX6F6RbIv/xmq1yTrOiJroCey1BFZ21O4+PLftH9Fsq72mg2PuXll/T5Z55Y1sDO0LnzlevDC8IcN+wI2xECQNM5VTXr1DrRow/tZVgbYV3Vavtq58GUpu6wmka+vpaCSF1i5DqF6VnOTAT7YABzNAI5mIO/ElzTgDzagj2agj2Ygv6Bf0oA72IB8R6ekATrYAB3NQN5OK2jAHc3AHV0HXh1t4Og68EcP13z0hMMHD3ag9NEGCgx2YZ+DMREps/Nz1MUeKPIGsCpvqtIGoSpvqCZvdFXa6Nozjbcs9zzNH7103vmI68vffT+Sq9W7XJuqV68C19XjnDNX21S9Jrh2VK9U+8bATVw1B66sEhmWqfvObgNYjIdtaqoZbEpz5erHccV/cyxHo/tZFqfM7rrwVcVx7a+IiqMtllBxHFf8VyqCDiri80tCOCX/hooFVBzX/gqoWPnnyc+i4njgoICKlX9S/SwqjtmlhIpjdimgoh4XM0qoONpiARXNiHQKqGh/fQWI1s3ZfiSV0sUQhA+ekjGJ0s6Gb/o4UjaRv8IljYn+yeGpK1fSDXE1MKcBnUGBq2+Iq2ba4+paqlft9cIVvyfS09qFA4BgFMfStNS9dRitnXZxMyiQnj4NV8aOuLpuuGrV1FCW4NrUFLXPFTqqV+iovxb42vdZuJqNdJ6Zd5is8c+XF2YjebWP4dsxOsOOzrBjMuxsnADaxdgMOzaDz8YLRLsYl9EO3EZCfV7DWI8RxqsMjM3AyCeKw/OKFL2uiIZ1BsbfjLFKZ2Ay7ECGnY2TrrsYzLCDGXzk8SCBub0dWGNvx8hXNvcxcl8AFV6AAbU6txVQJgsl6g1gQz4LXNSLrPySSgJFymShOAclt3GAcNQdUEVqkNySwIRTWLBepgeUz0HJKc0kinJQcitMorJ4UZaH8m2bqZJDLdtVlBJQLge10VNSKM5ByUeXEqiNbx0nUXm2NnjxHNXC1JkiFLgclPyVzRRKqyyUzUJlqSGfcU+isjSUr+6B1gGlbdS/nHwfL4myWSjOQcmJ3STK5aB8lho+S3nOssVZynOO8hsv2SdRG8qH2yCgfTTa+I15OYGSV6NJlM1BachCUQ5KXmEmUTnzsreYhcqZzT1l2ZL78v7Lh+g3+jKFZAg4FdvamM0TKDk7nUCxwiyUrLzjeekN65tlMwogC2WzUJyDkleFSZTLQeksNXSW8ibLlslS3mQpb7OUt1nKU5YalKUGZanhZFu8zHpsYpT8Wu0+SquNXjm1zwW13O7RFn7COAsm52GTMPlFuDTMJWGru0gBZmwWzOosGEEeTBwJLg8fzDOSYhvD5Oe1kzD5e3VpmNuAwQKjGMaYB8uyBgpkmMMAc16A2SwYqDxYnjXMs4aZ1jgLJg/jUxw0D5LTPxcY+B8oud8kUZSDcmKD9IzhUuM0W65RwvaaD7tal8AwNuEON+GPZyGvQ4uakBetZU0czgIVHG/ieBZwPAs5Yihrgg83IWf8ipowx9cFbYxR4Rjw9E+MUPJeKKtwcJSfnHn+iZKvJ6ds8UZr8WF4X59qDije8NAED1E9R01xYhYqy5ac006h5Jx2EpVlS9sclFEbKFxQEKNsDspm2bImidIxL7tRyzq8vaNM1A41mWRPWR+1mVEbtoxf+lfsoduo5XB8QuqV2mNGX9be5aDkiT6B2thrdhRO5NPzPJ0mOZRnmhfO7CjG8O0YOcOcwLjbMfJpsP399gllc1BaZaGybJksWybLls2yZbNsUVZ9UZYtl8VLThskUT4HJY8xSRTloOQxZn+0kPe/GMPQbiLMxq75bi92ci/et4MZvsnh7z5GvoCZwNw+kjn5JEoCk2FHftWWwz2uJ3fhZgzdjqEMO5SanQSMy2hv8tnIfYzXGRh/O0aO6xOY22dor0wG5nY+HjADc3v9bOxOb2O+Tz/9992Xh3fvHz9+nRCXX/796cO3h8+ffv747X9/zb95/+Xh8fHhz7d/ffn84ePvf3/5+Pbx84fL7+7Uz//8RsT3xGry5dLwndX3zsHlp8svDZl7Q3z58cdv1b2zOPkw+fF/",
217
212
  "brillig_names": [
218
- "get_update_delay"
213
+ "update"
219
214
  ]
220
215
  },
221
216
  {
@@ -254,13 +249,13 @@
254
249
  "error_kind": "string",
255
250
  "string": "msg.sender is not deployed"
256
251
  },
257
- "15573886522241766899": {
252
+ "14225679739041873922": {
258
253
  "error_kind": "string",
259
- "string": "New update delay is too low"
254
+ "string": "Index out of bounds"
260
255
  },
261
- "16761564377371454734": {
256
+ "15573886522241766899": {
262
257
  "error_kind": "string",
263
- "string": "Array index out of bounds"
258
+ "string": "New update delay is too low"
264
259
  },
265
260
  "17595253152434889169": {
266
261
  "error_kind": "string",
@@ -272,8 +267,8 @@
272
267
  }
273
268
  }
274
269
  },
275
- "bytecode": "JwACBAEoAAABBIBPJwAABAMnAgIEAScCAwQAHxgAAwACgE4dAIBOgE4ELgiATgABJQAAAEwlAAAAoCgCAAEEgE8nAgIEADsNAAEAAigAgEMEABkqAIBEAAAAAAEAAAAAKACARQABACgAgEYEAAMoAIBHAQAAKACASAQAACgAgEkAAAAoAIBKAQABKACASwQAASgAgEwAAAEoAIBNBAAEJiUAAAmELQgBAwAAAQIBLgqARwADLQgBAwAAAQIBLgqASQADLQgBAwAAAQIBJwIEAAItDgQDHgIAAwEeAgAFADM4AAMABQAGJAIABgAAAPQlAAAJrQ0oAAGAQwAFCygABYBHAAYkAgAGAAABESUAAAm/LQgBBScCBgQDABABBgEnAwUEAQAoBQIGLQwGBy4KgEwABwAoBwIHLQ4DBysCAAMAAAAAAAAAAAIAAAAAAAAAACcCCgQLLQgACy0MAwwAEAAKACUAAAnRLQQAAC0MDAYtDA0HLQwOCC0MDwktDQYDACgDAgMtDgMGLQgBAwAAAQIBLQ4GAy0NBwYAKAYCBi0OBgctCAEGAAABAgEtDgcGLQgBBwAAAQIBLQ4IBy0IAQgAAAECAS0OCQgnAgkEAi4IgEgAAiMAAAHaDDgCCQokAgAKAAAJESMAAAHsJwIKBAstCAALLQwDDC0MBg0tDAcOLQwIDwAQAAoAJQAACnEtBAAALQwMBQsoAAWASQADCygAA4BHAAYkAgAGAAACNCUAAArlLwwABQADHAwDBwQcDAcGAAI4AwYHCSgAB4BEAAMcDAMHBBwMBwYAHAwGBwQCOAMGCAkoAAiARAADHAwDCAEcDAgGABwMBggBAjgDBgoJKAAKgEUAAxwMAwsEHAwLCgAcDAoLBAI4AwoMCSgADIBEAAMcDAMMARwMDAoAHAwKDAECOAMKDQkoAA2ARQADHAwDDgQcDA4NABwMDQMEFgwMDRwMCg4EHAwNDwQEOA4DDRYMCAMcDAYOBBwMAxAEBDgOCwMtCAELAAABAgEtDgwLLQgBDAAAAQIBLQ4NDC0IAQ4AAAECAS0OCA4tCAEIAAABAgEtDgMILQgBEQAAAQIBLQ4HER4CABIFHAwSFAQcDBQTABwMExIEDDgSBxMoAgAHBA4QJAIAEwAAA4EjAAADZBwMBgoEBDgKAwYEOBAHAwA4BgMHLQwHAiMAAAOeHAwKAwQEOAMNBgQ4DwcDADgGAwctDAcCIwAAA54MOAIBBiQCAAYAAAPQIwAAA7ACOAIBBg44AQIHJAIABwAAA8clAAAK9y0MBgMjAAAD2y4IgEgAAyMAAAPbADgSAwcOOBIHCiQCAAoAAAPyJQAACwkuCoBKAAstDgIMLgqASgAOLQ4BCC0OBxEtCAEBJwICBAQAEAECAScDAQQBACgBAgItDAIDLgqASQADACgDAgMuCoBJAAMAKAMCAy4KgEkAAy0IAQIAAAECAS0OAQIuCIBIAAYjAAAEWg0oAAaARgABJAIAAQAACKsjAAAEby0NAgMtDQMCACgCAgItDgIDASgAA4BLAAYtDQYCADgDCQctDQcGASgAA4BGAAotDQoHLQgBAycCCgQEABABCgEnAwMEAQAoAwIKLQwKDS0OAg0AKA0CDS0OBg0AKA0CDS0OBw0tDQMGACgGAgYtDgYDJwIHBBItCAASLQwDEy4IgEsAFAAQAAcAJQAACxstBAAALQwTBicCCgQSLQgAEi0MAxMtDAkUABAACgAlAAALGy0EAAAtDBMHASgABoBLAAktDQkDASgAB4BLAAktDQkGHAwCCQQcDAkHAC0NCwItDQwJLQ0OCi0NCAstDREIHAwIDAAnAggAICcCDgQPLQgADy0MBBAtDAgRABAADgAlAAALnS0EAAAtDBANBDgMDQgAOAcIDBwMCgcAJwIIAEAnAg0EDi0IAA4tDAQPLQwIEAAQAA0AJQAAC50tBAAALQwPCgQ4BwoIADgMCAccDAsIACcCCgBIJwIMBA0tCAANLQwEDi0MCg8AEAAMACUAAAudLQQAAC0MDgsEOAgLCgA4BwoIHAwCBwAnAgIAaCcCCwQMLQgADC0MBA0tDAIOABAACwAlAAALnS0EAAAtDA0KBDgHCgIAOAgCBxwMCQIAJwIIAHAnAgoECy0IAAstDAQMLQwIDQAQAAoAJQAAC50tBAAALQwMCQQ4AgkEADgHBAItCAEEJwIHBAQAEAEHAScDBAQBACgEAgctDAcILQ4CCAAoCAIILQ4DCAAoCAIILQ4GCC0NBAcAKAcCBy0OBwQrAgAHAAAAAAAAAAADAAAAAAAAAAAnAgwEDS0IAA0tDAcOABAADAAlAAAJ0S0EAAAtDA4ILQwPCS0MEAotDBELLQ0IBwAoBwIHLQ4HCC0IAQcAAAECAS0OCActDQkIACgIAggtDggJLQgBCAAAAQIBLQ4JCC0IAQkAAAECAS0OCgktCAEKAAABAgEtDgsKLgiASAABIwAAB0kNKAABgEYACyQCAAsAAAg4IwAAB14nAgwEDS0IAA0tDAcOLQwIDy0MCRAtDAoRABAADAAlAAAKcS0EAAAtDA4LLQ0EBwAoBwIHLQ4HBC0IAQQnAgcEBQAQAQcBJwMEBAEAKAQCBy0MBwgtDgIIACgIAggtDgMIACgIAggtDgYIACgIAggtDgsILgiASAABIwAAB9wNKAABgE0AAiQCAAIAAAfyIwAAB/EmHAwBAgAAOAUCAycCBgQEDDgBBgckAgAHAAAIEyUAAAyiACgEAgYAOAYBBy0NBwIwDAACAAMBKAABgEsAAi0MAgEjAAAH3CQCAAsAAAhFIwAACJonAgwEAww4AQwNJAIADQAACFwlAAAMogAoBAIMADgMAQ0tDQ0LJwIMBA0tCAANLQwHDi0MCA8tDAkQLQwKES0MCxIAEAAMACUAAAy0LQQAACMAAAiaASgAAYBLAAstDAsBIwAAB0ktDQIBHAwGAwAAOAUDBy8MAAcAAycCCgQDDDgGCg0kAgANAAAI1iUAAAyiLgQAAYADKACABAQABCUAAA3fLgiABQAHACgHAgoAOAoGDS0OAw0tDgcCASgABoBLAAEtDAEGIwAABFokAgAKAAAJHiMAAAlzJwILBAIMOAILDCQCAAwAAAk1JQAADKIAKAUCCwA4CwIMLQ0MCicCCwQMLQgADC0MAw0tDAYOLQwHDy0MCBAtDAoRABAACwAlAAAMtC0EAAAjAAAJcwEoAAKASwAKLQwKAiMAAAHaKACABAR4AA0AAACABIADJACAAwAACawqAQABBfeh86+lrdTKPAEBAiYqAQABBYsOIRaQ47VWPAEBAiYqAQABBdghj0cqdtXzPAEBAiYlAAAJhC0IAQInAgMEBAAQAQMBJwMCBAEAKAICAy0MAwQuCoBJAAQAKAQCBC4KgEkABAAoBAIELgqASQAELQ0CAwAoAwIDLQ4DAi0IAQMnAgQEBQAQAQQBJwMDBAEAKAMCBC0MBAUuCoBJAAUAKAUCBS4KgEkABQAoBQIFLgqASQAFACgFAgUtDgEFLQwCAS0MAwIuCIBIAAMuCIBHAAQmJQAACYQtDQQFCygABYBHAAYkAgAGAAAKkycCBwQAPAkBBycCBQQGLQgABi0MAQctDAIILQwDCS0MBAoAEAAFACUAAA5tLQQAAC0NAQUtDQIGLQ0DBy0OBQEtDgYCLQ4HAy4KgEoABAEoAAaASwACLQ0CASYqAQABBQLcbieAdhKdPAEBAiYqAQABBSiGkrBH3P1DPAEBAiYqAQABBUWnynEZQeQVPAEBAiYlAAAJhAEoAAKASwADDjgCAwQkAgAEAAALOiUAAAsJDTCARgADAAQLKAAEgEcAAyQCAAMAAAtXJQAAD8AnAgQEAww4AgQFJAIABQAAC24lAAAMogAoAQIEADgEAgUtDQUDLQgBAScCAgQCABABAgEnAwEEAQAoAQICLQwCBC0OAwQmJQAACYQtCAEEAAABAgEuCoBMAAQnAgYEAicCBwEBLQgBBScCCAQhABABCAEnAwUEAQAoBQIIJwIJBCBDA/AAAgAGAAkABwAIJwIKBCAuBAAIgAMuBAAKgAQlAAAP0icCAgQhJwIGBCAuCIBLAAMjAAAMEAw4AwIHJAIABwAADCcjAAAMIi0NBAEmLQ0EBwQ4BwcIAjgGAwcOOAMGCSQCAAkAAAxHJQAACvcnAgoEIAw4BwoLJAIACwAADF4lAAAMogAoBQIKADgKBwstDQsJHAwJBwAEOAgBCQQ4BwkKAzCATAAHAAkEOAkIBwA4CgcILQ4IBAEoAAOASwAHLQwHAyMAAAwQKgEAAQXonQn+oREtDjwBAQImJQAACYQtDQMGLQ0EBwsoAAeARwAIJAIACAAADNonAgkEADwJAQkLKAAGgEYAByQCAAcAAA1rIwAADO8tDQEGLQ0CBy0NAwgtDQQJJwILBAMMOAgLDCQCAAwAAA0WJQAADKIuBAAGgAMoAIAEBAAEJQAADd8uCIAFAAoAKAoCCwA4CwgMLQ4FDAEoAAiASwAFDjgIBQYkAgAGAAANViUAAAsJLQ4KAS0OBwItDgUDLQ4JBCMAAA3eJwIGBActCAAHLQwBCC0MAgktDAMKLQwECwAQAAYAJQAADm0tBAAALQ0BBi0NAgctDQQILgQABoADKACABAQABCUAAA3fLgiABQAJACgJAgoBKAAKgEgACy0OBQstDgkBLQ4HAi4KgEsAAy0OCAQjAAAN3iYuAYADgAYLAIAGAAKAByQAgAcAAA36IwAADgUuAIADgAUjAAAObC4AAAGABQEAAAGABAABAQCAA4AEgAkuAIADgAouAIAFgAsLAIAKgAmADCQAgAwAAA5YLgGACoAILgKACIALAQCACgACgAoBAIALAAKACyMAAA4nKAGABQQAAQMAgAYAAoAGIwAADmwmJQAACYQuCIBIAAUjAAAOfQ0oAAWARgAGJAIABgAADugjAAAOki0NAQUtDQIGLQ0DBy0NBAgtCAEJJwIKBAUAEAEKAScDCQQBACgGAgonAgsEBAAoCQIMPw8ACgAMLQ0JBgAoBgIGLQ4GCS0OBQEtDgkCLQ4HAy0OCAQmLQ0DBgw4BQYHASgABYBLAAYkAgAHAAAPBiMAAA+3LQ0BBy0NAggtDQMJLQ0ECicCDAQEDDgFDA0kAgANAAAPLSUAAAyiACgIAgwAOAwFDS0NDQsnAg0EAww4BQ0OJAIADgAAD1IlAAAMogAoBwINADgNBQ4tDQ4MADgLDA0nAgwEBAw4BQwOJAIADgAAD3wlAAAMoi4EAAiAAygAgAQEAAUlAAAN3y4IgAUACwAoCwIMADgMBQ4tDg0OLQ4HAS0OCwItDgkDLQ4KBCMAAA+3LQwGBSMAAA59KgEAAQX0LuWEu/Qh0TwBAQImKACABgQAAgcAgASABoAFLgCABIAIKACACQQAAA0AgAmABYAKFwCACoAKJACACgAAEFEDAIAIAAKACAEAgAOACYALLgGAC4AGAQCAA4AIgAsuAYALgAcBAIADgAmACy4CgAeACwEAgAOACIALLgKABoALAQCACQACgAkjAAAP7iY=",
276
- "debug_symbols": "7V3bbt22Ev0XP+eBw8tw2F8pDoIkTQsDRlIk6QEOgvz70d6OKDkcid5TyqZIvhRxzeWZtYYih0OK+n73x8f3//z19v7Tn5+/3v32+/e7h88f3n27//xp+un7jzd377/cPzzc//V2/b/v1OU/gO4K+Pr3u0+Xn79+e/fl291v3pN/c/fx0x93vxGAn/7En/cPH+9+Awg//vNmQgUJylsJipQIJbMl4hVEGgaJLa2sCCWyBYZDobX2Jwot6ohy9sebpLElMze2ZJfGyDUm5/XsjyO/bnx1h1h3nFWzOw5Vxh1EmN1Br3LuKBfd0fCrO3pDneCiO5OOu+6A83MAAI3Zdye4MPse0Nhf3TGQdQfN2p0rKAhAlu2CiDHSiN7+CnJaAEIlAZEA5PlgepjjM2FcJpgKzRxMgEU1uHTKtDXh3DhQbGvgpzu+KndI1+VOXeqEutQJValjFNTlTl3qQFV9xwC+tDtudkcr/cSdtK0Pdp6WfAjLX55GS6a1iX/Z6mWi19wf1hDmuUFr0OvGF1GMH6Ikolg9RElFGY9PKopTQ5RUFDdESUTB0VMYUewQJRWFhiiJKH5MyYwoY0pORaEx0DKijIGWESUMURJRghmipKKMVXIiilVjSmZEGVNyKgqMKZkRZaySGVHGlJyKoseUzIgyVsmpKGZMyYwoY0pORbEwRElFGVMyI8qYklNRnB2iJKL4PkXRZhFlxe+nKKHPKdlDmL3wq8N/syh91lN2RXGqzyk5I0qfU3JGlD6n5H1RoM9VckaUMdCmougxJTOijJ6SimLGlMyIUmBKBqJZlHXOzIvinJ9bI62WHaA197eDm2WB4FetPVzdt+bU7js4t/vh1O4/48Cax333jY4vghkd7BMTnPt6fm7dFPtMa+9oXot6VIs07DtX3tA8MnmrM6+vTUOXj4frwaqwbn5RxqsXV4bmd+Mc6lxrDZHsVMXA1dD6GFjvTu0+Va7+5H+skTiXul+5+jo6ojWGxP1nnJl5VfeNml+u1BeXE/fpzO6jOrX6qGpXX7vovkv6PkLt6utYnTXeJO5rqNt9q+a/rS0w7uOp3TfnVt/Urr6O05Z1lLhva1c/pr7a+nTgfMbG5Ou6H2LO41Sq/jO2EKt2/9zqY+XqT0XK6L5L+z5Wrr7TMedxmOT7+IwrIF7X/RBXW6hs4v4zroyo2v1zqx8qVx+XtS7adOQJlauPy1oXMRl5vKp8qY60uB984j5UXijJuX9u9XXl6u+PPF7bc6tfedKQcd+cW31Te8K8u9b1tvI6z36+723lVbaM++7c6rtj1b+YQH28CX+4CQ/Hm3CHmzh4N+pqwh5v4vhOe/DG0dXE4Z2WFBxvAg83Aep4E/Z4E+FwE7pApzWxtGtM9lTDtEUWr2xV4cnJg7QxkZmnIiL36zEF0lTW+dWlvLM+xhxv4ngWJfI94yGaWMWNj7LRtOp2qxxCccfZIOCcn2ilzJPWk/uhxMbYbe47PTtknEkdsvaFHbJTkfhnaztVLFOHQmUOudoUKpFSFnWoROH2NodIzX/akg2JQ0HX5lBlCoEqUS8t61GJRKewR1ibR7o6jXR1GpnqNCpRIbQ2pkXTGJwdsGEZsG2uSnLb6Vzt4ulc7ewveezElfrhWiIXPQ3XjuLqOoqr6yiuJRLn03DtKK6+o+fVh364liimn4VrUB1x7Smu/TyvAE3FNW40T/+EhKtxDXE1GN/YNp7hWnsf9gtXnfnAoFk+xmS0Xh2HMfqRbPWLuqJka88SS5J1taf/t5DVIW7rXK9hWJFldqWmFPln6ymrWlWoHNeaote0+uQl3xYhfgjU4JO2V8mx9qymQclrn4QblLyl+fEckle/5G9PcoIh+UtLXvsi40DJ40fDJ/UVI03HY25GmurLK68ozeg1G9JoNXrNpjSj12xJAx3nYTlp/JBmQxrdcSUmJw0OaTakMR0vQHLS1LRQePSopjnz6lGJk+6FPXr56ntcyFqvcq0BzfzmA2B6xRroVzgnVdZ/f27/EU7u/8n19/rk/p9cfzp5/3+F8t5t/sebI6YGlPr/CmeWyvpvT+5/7fnDvv9G1T5+5vyvffzM+A8n1x/w3P7rysdP70L0n+wT/5nWAPETBWBXn/K4ePU9XSxjXCu7J20flal8ZHs9ZUzlz6yPn2IEWhVBXkAZW/vT9HrK2LqVIaOiMhbTcdKGc/vvjtX/0QYdb+Pg96cebeDxNrx6ARslYm5ctLH+oBDbC9HZuc8igsq0DvF4eFhfpRO40cXQcrA2QLqONUXeSaqEa9AmcjWQcqWG4prl2lFcS1x5dhquvhuutsQlcKfhiv1whY7iWuJ27dNwbWjOoXg/4MTVpVxL3NtdDVez5IgGGa4t5RJu6cPExNU0FNdAIXJNbw+fuLYU1wxX21Fci5xNOQnXIi+GnoVrSzlihiu2lCPmuHYU1yL1u7NwbWnOcfN5GKsUk/u3VEdc8uGJq065NlRHnGos8ZyrQsVwbSeuE0EbuXomrqGluOa49hNXp9qpD+e5tlMfznJtqI6Y59pOjpjlqjuKq26nPpzn2tKcE7/IOnFNa6aupTriOh/2nuHaUlzjSS8LOq0Pu4bqiBPBmPuDYeJqG4prjqvrKK6unfpwliu2Ux/Oc20oR8xx9Q3liFmuHcWV2qkP57k2NOeo+JlzC5bJ/Vs6j7jKh6dN9JRrS3VEiN9EtFophmtDOaJWMffXkPZhVA3FNcu1o7hCQ/XhLNeG6sM5ri3VEbNcG8oRc1xNR3E1DdWHs1xbqjfFt4wnrmnujy2dR1zlw5p5Vx5bqiPa+CF7ayl9nw5dQ7lElmtDdcQcV+worthRXH1HcfUN5f45rtRQjpjl2lDun+MaGqoPZ7k2lPtnuZ41R7x47097wvDR+7PO91fvoe4dXlAm3h2kHGaeEx9s/JxjCMvegr6cu0n9dsvCa3XPEEdRQzzYoteLb/34nUhv6u7BZ1Gx7ifpJCra8USXULHurPAkKrq61xFnUXH0xQIqYt1rn7OoaIeKBVQcmU4BFf3IdEqoOGaXAipWfvLyLCrWXbM7i4p1VwNPomLl92KeRcWR6fx7FUmNTKeEiiPTKaBi5fcGnEXFkemUUHFkOgVUrPw21rOoODKdAiqakemUULHus2onUdGOTKeEiiPTKaCiG/XFAiri6IvPUVGbRcUVxVnFyk/M1qKij5eDam9MomIYs0sJFccTXULFsY7+9yqGys8xn0XFsXYpoOKo0hZRcWQ6BVSs/CaJs6g4Mp0SKtaU6Vw9qurdkUePaqpkXz16+XcaUEP0yPpMa1Lxq9mkaOl0yDpi3Hwp2PTP8ORBeSSLHZF9+TcEXpNsT5HFniKLPUX25b9C9ZpkbU9kQ0dkyfREljoiG3pKF1/+m/avRlYrqD2y8TI3Uo72yXq/rIG9xXXjK9eX/wjKgVwJ5y++ePKUcq194rmJa/xKNsvVNhVXUpHr6maayLWpuO5zdR3FFVsah3Nca59gC3L1HcXVdxRXqr0YcxNXEyLXoPYbA1ia3QZwOk2zqKlusCnNhStUfn99LXtIRs1ttQG7bnxVUY8z6iVUHH2xgIqV33B/EhXtOF1dQsXRFwuoOE76F1HRDhWfc9I/6KiicqmK41xwARUr//rBWVQc+WIBFSv/8utZVByZTgkVx+xSQEUas0sJFcftDQVUHHemFVBRj9u+SqhY5G4gi1FFpIwuFuOrBxatzbT2Ln6Yw+PKfb6ur5ftHU2wbnzlqk1DXC3M2yPeaoYrNcTVBNzjalqKqyGzcNX7jQGMn92etvBUSKVp6fE2GMdI49NuUOTE0Fm4dhRX5/vhWuTE0Fm4NjVF7XMtUgo5Cdcil7yfhSv2w7XIVTxn4dpPXI3q53k1yvbD9RlvRqxqHixXUGji+gKWsgSg4lrHssRUnIltr/vO31+u4LG/5W2esSLqUBU7+gqjitNDFUYVP1RJVcHRVzhVRl9hVHnG8YIWVdnfijDP+MRah6o8YzXdoyp2qMKoQkOVVJXQ58ycU2WMtqkqVo3RllPFDVVSVWD0FU6VPusr+6o4YGdmp2cDTvsEw79AmcH42zFGYMcI7FiBHf6Wx32ME9hxAj78CwsZjKAf8HerOZzPOjmEFEO3Y/gjshkMr1v8vggmnxfRjt9HymDwZgwqEGAEdkBgh/+w4T5GC+xoAZ+N8WAfc3s/QGsEGLodwz8L+1cgayRWBcBlakJKngcMSoQiAcrzH1LIothIXT5wP6N8SOYvz98olkWhBKWVCGVFKJKgjEgNI1LeimxZkfJOpLwTKe9EyqNIDRSp4UVq8FVMCDDnh5c76hMUX8/KoIgfDSEYiKjVzSnGhkeYQxGMv6o4DwsimLdZ2OqelwjbGLZzsI1xOwsjCWzjEziX+4fiSiYgAyMRDGTW+HQjD0MRzMisGZk1/iaLy8VeEeaZuPG75HlYEMGczJqTWUOZNSQRjM/JiMJcJZj+uTpa83ivaeAf7izKS1D8S1oU4lKNwvqNIe6lnmnsm6sN08AEqQk62IRRyhxvwh9ugs8+y5o4noU+noU+noU5ngV/Q05RE3ymW9YEHm4Cj48FbYxRXkUTXv+KAr6MElR8Zy0o7xIUX0jJ2YKN3kJxeF9XemcUv8icPLTRw1XNN6KcBGVEtvjvC+VQfFFlQukFBSmKJCgnssUvI7IolKC8yJYX2SKVRZk0XrTRo+KLyUHZtPcGlX2+1meNZ9SGLUvLU5l4qNVGlK3feZa1IsEIoMGIUF6C4kv+oGJZcBrFlrTwcclt9MYiOIdilZ/2tpZ9LgcJyhsJir/ENotCCWpj2Qy4XCZLiRqGH+dh2nyfUVZBinIiVJCg+DfFsyi+RzkdNXROJaiNYmIOJbLFZ1Y51EZZMIdCCYrfVMuiSILaKDHlUEGCIpEt2uAVV9fggk5QAQUoy2+XZVFBggIrQknUsFqLUCIN+XtmwSxl3GlESlB8NSqLsiIUSVD8lnoWhRIUitRAkfJeZMuLlPci5Umk/MZsbmLOBgaT0cYGLUIFAcopK0GBEqGcBLWRA+RQXpA5OAMilCQjclZiy/PjvF8u0rcmwWyse21cEDmXYqwAQ7dj+G3VDAYFuf/WpmoO5SQoFNlCkS0vsuVFtkhki0TxCiJbQcRrY+zcR9HGwY8cSrLeJQARCm8eLWirIhfLXZrBuJufYrJ4ux0n8I3fvstg6HYM3j6SEf9a3j7GC+yQEmAEMQ0CO0Fih31epy3XGeOTNcEUPAFGYGejCraL4ddGGYzAjhHY4bf2V/FhMHxusxvTjQ/J72OcwA6/L7+PwduzoY3vTmcwt48HG5vxGcztmdrGRnwGc7OdKf3VAgzejgElwNzYD35MP/333Zf7d+8fPn6dEJdf/vPpw7f7z59+/vjtf3/Pv3n/5f7h4f6vt39/+fzh4x//fPn49uHzh8vv7tTP//yOAd948JMvl47vKbyZ0onLT5dfTmvUN5auPz7+dmpLNPkw+fF/",
270
+ "bytecode": "JwACBAEoAAABBIBPJwAABAMnAgIEAScCAwQAHxgAAwACgE4dAIBOgE4ELgiATgABJQAAAEwlAAAAoCgCAAEEgE8nAgIEADsNAAEAAigAgEMEABkqAIBEAAAAAAEAAAAAKACARQABACgAgEYEAAMoAIBHAQAAKACASAQAACgAgEkAAAAoAIBKAQABKACASwQAASgAgEwAAAEoAIBNBAAEJiUAAAjKLQgBAwAAAQIBLgqARwADLQgBAwAAAQIBLgqASQADLQgBAwAAAQIBJwIEAAItDgQDHgIAAwEeAgAFADM4AAMABQAGJAIABgAAAPQlAAAI8w0oAAGAQwAFCygABYBHAAYkAgAGAAABESUAAAkFKwIABQAAAAAAAAAAAgAAAAAAAAAAJwIKBAstCAALLQwFDAAQAAoAJQAACRctBAAALQwMBi0MDQctDA4ILQwPCS0NBgUAKAUCBS0OBQYtDQcFACgFAgUtDgUHLQgBBQAAAQIBLQ4GBS0IAQYAAAECAS0OBwYtCAEHAAABAgEtDggHLQgBCAAAAQIBLQ4JCCcCCQQKLQgACi0MBQstDAYMLQwHDS0MCA4uCIBMAA8AEAAJACUAAAm3LQQAACcCCQQKLQgACi0MBQstDAYMLQwHDS0MCA4tDAMPABAACQAlAAAJty0EAAAnAgkECi0IAAotDAULLQwGDC0MBw0tDAgOABAACQAlAAAK4C0EAAAtDAsDCygAA4BJAAULKAAFgEcABiQCAAYAAAI/JQAAC1QvDAADAAUcDAUHBBwMBwYAAjgFBgcJKAAHgEQABRwMBQcEHAwHBgAcDAYHBAI4BQYICSgACIBEAAUcDAUIARwMCAYAHAwGCAECOAUGCQkoAAmARQAFHAwFCgQcDAoJABwMCQoEAjgFCQsJKAALgEQABRwMBQsBHAwLCQAcDAkLAQI4BQkMCSgADIBFAAUcDAUNBBwMDQwAHAwMBQQWDAsMHAwJDQQcDAwOBAQ4DQUMFgwIBRwMBg0EHAwFDwQEOA0KBS0IAQoAAAECAS0OCwotCAELAAABAgEtDgwLLQgBDQAAAQIBLQ4IDS0IAQgAAAECAS0OBQgtCAEQAAABAgEtDgcQHgIAEQUcDBETBBwMExIAHAwSEQQMOBEHEigCAAcEDhAkAgASAAADjCMAAANvHAwGCQQEOAkFBgQ4DwcFADgGBQctDAcCIwAAA6kcDAkFBAQ4BQwGBDgOBwUAOAYFBy0MBwIjAAADqQw4AgEGJAIABgAAA9sjAAADuwI4AgEGDjgBAgckAgAHAAAD0iUAAAtmLQwGBSMAAAPmLgiASAAFIwAAA+YAOBEFBw44EQcJJAIACQAAA/0lAAALeC4KgEoACi0OAgsuCoBKAA0tDgEILQ4HEC0IAQEnAgIEBAAQAQIBJwMBBAEAKAECAi0MAgUuCoBJAAUAKAUCBS4KgEkABQAoBQIFLgqASQAFLQgBAgAAAQIBLQ4BAi4IgEgABiMAAARlDSgABoBGAAEkAgABAAAIeyMAAAR6LQ0CBS0NBQIAKAICAi0OAgUBKAAFgEsABi0NBgInAgYEAgA4BQYJLQ0JBwEoAAWARgAMLQ0MCS0IAQUnAgwEBAAQAQwBJwMFBAEAKAUCDC0MDA4tDgIOACgOAg4tDgcOACgOAg4tDgkOLQ0FBwAoBwIHLQ4HBScCCQQRLQgAES0MBRIuCIBLABMAEAAJACUAAAuKLQQAAC0MEgcnAgwEES0IABEtDAUSLQwGEwAQAAwAJQAAC4otBAAALQwSCQEoAAeASwAGLQ0GBQEoAAmASwAHLQ0HBhwMAgkEHAwJBwAtDQoCLQ0LCS0NDQotDQgLLQ0QCBwMCAwAJwIIACAnAg4EDy0IAA8tDAQQLQwIEQAQAA4AJQAADAotBAAALQwQDQQ4DA0IADgHCAwcDAoHACcCCABAJwINBA4tCAAOLQwEDy0MCBAAEAANACUAAAwKLQQAAC0MDwoEOAcKCAA4DAgHHAwLCAAnAgoASCcCDAQNLQgADS0MBA4tDAoPABAADAAlAAAMCi0EAAAtDA4LBDgICwoAOAcKCBwMAgcAJwICAGgnAgsEDC0IAAwtDAQNLQwCDgAQAAsAJQAADAotBAAALQwNCgQ4BwoCADgIAgccDAkCACcCCABwJwIKBAstCAALLQwEDC0MCA0AEAAKACUAAAwKLQQAAC0MDAkEOAIJBAA4BwQCLQgBBCcCBwQEABABBwEnAwQEAQAoBAIHLQwHCC0OAggAKAgCCC0OBQgAKAgCCC0OBggtDQQHACgHAgctDgcEKwIABwAAAAAAAAAAAwAAAAAAAAAAJwIMBA0tCAANLQwHDgAQAAwAJQAACRctBAAALQwOCC0MDwktDBAKLQwRCy0NCAcAKAcCBy0OBwgtDQkHACgHAgctDgcJLQgBBwAAAQIBLQ4IBy0IAQgAAAECAS0OCQgtCAEJAAABAgEtDgoJLQgBCgAAAQIBLQ4LCi4IgEgAASMAAAdZDSgAAYBGAAskAgALAAAIMSMAAAduJwIMBA0tCAANLQwHDi0MCA8tDAkQLQwKEQAQAAwAJQAACuAtBAAALQwOCy0NBAcAKAcCBy0OBwQtCAEEJwIHBAUAEAEHAScDBAQBACgEAgctDAcILQ4CCAAoCAIILQ4FCAAoCAIILQ4GCAAoCAIILQ4LCC4IgEgAASMAAAfsDSgAAYBNAAIkAgACAAAIAiMAAAgBJhwMAQIAADgDAgUAKAQCBgA4BgEHLQ0HAjAMAAIABQEoAAGASwACLQwCASMAAAfsACgEAgwAOAwBDS0NDQsnAgwEDS0IAA0tDAcOLQwIDy0MCRAtDAoRLQwLEgAQAAwAJQAACbctBAAAASgAAYBLAAstDAsBIwAAB1ktDQIBHAwGBQAAOAMFBy8MAAcABS4EAAGAAygAgAQEAAQlAAANCi4IgAUABwAoBwIJADgJBgwtDgUMLQ4HAgEoAAaASwABLQwBBiMAAARlKACABAR4AA0AAACABIADJACAAwAACPIqAQABBfeh86+lrdTKPAEBAiYqAQABBYsOIRaQ47VWPAEBAiYqAQABBdghj0cqdtXzPAEBAiYlAAAIyi0IAQInAgMEBAAQAQMBJwMCBAEAKAICAy0MAwQuCoBJAAQAKAQCBC4KgEkABAAoBAIELgqASQAELQ0CAwAoAwIDLQ4DAi0IAQMnAgQEBQAQAQQBJwMDBAEAKAMCBC0MBAUuCoBJAAUAKAUCBS4KgEkABQAoBQIFLgqASQAFACgFAgUtDgEFLQwCAS0MAwIuCIBIAAMuCIBHAAQmJQAACMotDQMGLQ0EBwsoAAeARwAIJAIACAAACd0nAgkEADwJAQkLKAAGgEYAByQCAAcAAApsIwAACfItDQEGLQ0CBy0NAwgtDQQJDSgACIBGAAokAgAKAAAKFyUAAA2YLgQABoADKACABAQABCUAAA0KLgiABQAKACgKAgsAOAsIDC0OBQwBKAAIgEsABQ44CAUGJAIABgAAClclAAALeC0OCgEtDgcCLQ4FAy0OCQQjAAAK3ycCBgQHLQgABy0MAQgtDAIJLQwDCi0MBAsAEAAGACUAAA2qLQQAAC0NAQYtDQIHLQ0ECC4EAAaAAygAgAQEAAQlAAANCi4IgAUACQAoCQIKASgACoBIAAstDgULLQ4JAS0OBwIuCoBLAAMtDggEIwAACt8mJQAACMotDQQFCygABYBHAAYkAgAGAAALAicCBwQAPAkBBycCBQQGLQgABi0MAQctDAIILQwDCS0MBAoAEAAFACUAAA2qLQQAAC0NAQUtDQIGLQ0DBy0OBQEtDgYCLQ4HAy4KgEoABAEoAAaASwACLQ0CASYqAQABBQLcbieAdhKdPAEBAiYqAQABBSiGkrBH3P1DPAEBAiYqAQABBUWnynEZQeQVPAEBAiYlAAAIygEoAAKASwADDjgCAwQkAgAEAAALqSUAAAt4DTCARgADAAQLKAAEgEcAAyQCAAMAAAvGJQAADrgNKAACgEYAAyQCAAMAAAvbJQAADZgAKAECBAA4BAIFLQ0FAy0IAQEnAgIEAgAQAQIBJwMBBAEAKAECAi0MAgQtDgMEJiUAAAjKLQgBBAAAAQIBLgqATAAEJwIGBAInAgcBAS0IAQUnAggEIQAQAQgBJwMFBAEAKAUCCCcCCQQgQwPwAAIABgAJAAcACCcCCgQgLgQACIADLgQACoAEJQAADsonAgIEIScCBgQgLgiASwADIwAADH0MOAMCByQCAAcAAAyUIwAADI8tDQQBJi0NBAcEOAcHCAI4BgMHDjgDBgkkAgAJAAAMtCUAAAtmDDgHBgkkAgAJAAAMxiUAAA2YACgFAgoAOAoHCy0NCwkcDAkHAAQ4CAEJBDgHCQoDMIBMAAcACQQ4CQgHADgKBwgtDggEASgAA4BLAActDAcDIwAADH0uAYADgAYLAIAGAAKAByQAgAcAAA0lIwAADTAuAIADgAUjAAANly4AAAGABQEAAAGABAABAQCAA4AEgAkuAIADgAouAIAFgAsLAIAKgAmADCQAgAwAAA2DLgGACoAILgKACIALAQCACgACgAoBAIALAAKACyMAAA1SKAGABQQAAQMAgAYAAoAGIwAADZcmKgEAAQXFa8RaDhAAAjwBAQImJQAACMouCIBIAAUjAAANug0oAAWARgAGJAIABgAADiUjAAANzy0NAQUtDQIGLQ0DBy0NBAgtCAEJJwIKBAUAEAEKAScDCQQBACgGAgonAgsEBAAoCQIMPw8ACgAMLQ0JBgAoBgIGLQ4GCS0OBQEtDgkCLQ4HAy0OCAQmLQ0DBgw4BQYHASgABYBLAAYkAgAHAAAOQyMAAA6vLQ0BBy0NAggtDQMJLQ0ECgAoCAIMADgMBQ0tDQ0LACgHAg0AOA0FDi0NDgwAOAsMDS4EAAiAAygAgAQEAAUlAAANCi4IgAUACwAoCwIMADgMBQ4tDg0OLQ4HAS0OCwItDgkDLQ4KBCMAAA6vLQwGBSMAAA26KgEAAQX0LuWEu/Qh0TwBAQImKACABgQAAgcAgASABoAFLgCABIAIKACACQQAAA0AgAmABYAKFwCACoAKJACACgAAD0kDAIAIAAKACAEAgAOACYALLgGAC4AGAQCAA4AIgAsuAYALgAcBAIADgAmACy4CgAeACwEAgAOACIALLgKABoALAQCACQACgAkjAAAO5iY=",
271
+ "debug_symbols": "7V3Rbt6oEn6XXOcChmEG+iqro6rtdleRonbVdo90tOq7H+dPjJ0wNv1ZnGDgZtVs+DLzfYNhGAP+5+b3zx///vP93Zc/vn6/effbPzf3Xz99+HH39cv00z8/b28+fru7v7/78/36f9+oh/9oshfA978+fHn4+fuPD99+3Lxjdnx78/nL7zfvnNY8/Yk/7u4/37zz9ud/bieQzwAxZoCcygFlWcrh5HPU8xmWQGEOKMeSNhKIEPEJREgQQFb9vI0aozNzY3S4NCapsbMMszvW8brxxR0numNRze7Yhz+76w6Rnt0hVil3lA3ugH7pDmyo421wR/t9d7TlWX9Nxuy7462fffdk8KU7RifdIbN25wLyGSAUOyBRiDQR40uQhQwQqRyQywCxHEzWc3wmjE0EU5GZg6n1opq2KIaenhqDWh4Lo0loyx7neLD3y18G9kJrw/PzgKteApLLAHr+w1N3NuvGD6J4HKLEovghyktRjBqPjyAKD1EiUTQMUWJRRk+JRQE9RIlFsUOUWJQxJceimDElC6KMgTYWBcdAK4hCQ5RIFKuGKLEoOESJRRlTciwKjSlZEGVMybEoPFbJgihjSo5FcWNKFkQZq2RBlDElx6L4MSULorghyktRUI0pWRBlTMmxKHrUUwRR+pySjZ5dBgP0UhToM3lLiIJDlFiUPqfkfVFMn1NyQpQ+p+R9UXAMtIIoo6fEotg+k7eEKKOnxKLQGFMEUUaaL4jSZ+VtX5ROd1wnROnzZdi+KG5MyYIoY6AVRBkDbSxKp6c4EqKMnhKJYjs9xcHhACGwxUiUPitv+6J0eoojIUqfq+R9UTp9xZEQpc8pOSHKGGhjUTo9xZEQZfSUWBQcU7IgSoEpWTs3iwKrxrIo1vpwG4WDxR/vpD/t7ayK9rxoqOly/4YtcbLg7bwnOLP3rE7tfbo6xLTvvYFwGYsBj89MSN7DPBpYa3WiNVs3X8bBpBZlxHtP2Lh5VGKExBUy07DFFMYwVH7d/EGZXygmllbGzXGdHolUa9CBLGhPq2HVPLpPp3bfV67+5P/sPlgbu1+5+hAcASD/0n1SWLf7RulQndI6dt+f2n19bvV17epD2H5qbNz3oXb1AYP7bCL3f2Gr25u6j2r+24BacJ9P7T6eW32sXX0I0xZaF7lva1c/pL6AHA+cv7BP6G3d9yHnmV52xO7bU7vP51afK1ffQhh51su+2X1XufoWQs5jycbuu8rd92G1NSX3kfu/cLixavdPrT6rytWnZa1L6GL3K1eflrUuUTTysK58qU5ucd9z5D5UXihJuX9u9U3l6idGHlN50pBQHytPGlLun1t9W3vCvLvW5V94Z1Zxvs+28ipbwn06t/p0rPoPJtgcb8IdbsLB8SbocBMHv426mLDHmzi80zqFx5s4vNM6Dceb4MNNgD7exOGd1hl1vIkCndaE0q4xyV0NpFz4bIryz3YexI2dM/NU5Jx9uU3BGV/W+dWHcWZ9EI83cTyLEvmeYR1MrOImR9mAW3W7VQ6hpK1s2lPYn6aUedZ6ct+XeDF2nfsWZoeMNbFD1r6yQ0jkn1ojOYgcKvH6pKxDtSlUIqUs6lCJwu11Djk1/2mcBp2XDmmlTHUeVadRiYppWY9KpDqFPeLaPDLVaWSq0wir06hEjRAxJEbTKJwcsvUyZGOqTnLd/lywYX8urLbgP2ayE1ffD9cS2ehpuHYUV+oortRRXEukzqfh2lFcXUfPq1cdce0nb5oWZB1x7Siuup/nVUNTcQ2vmqd/6ogrUkNcDYXz2oZjrrb2PswLV1D7XI12wRGA1YYYg09ksSeytWeJJclS7en/NWQhnB83RuMzssJ7qWnp89R6ypZXFSrxbLoLXrvVhQxyW9LhGLuhZ20vknPtWU2Dktc+CbcnuWtpfjyJ5KOXv7rkLeUK55Dc85D8dSWH6uswB0pOOkjOSpCm4zE3IU31VZ43lGb0mi1pYPSaTWlGr9mUpuM8LCGN6bjCk5LGDWk2pClx30+r0nS8AElIY2taKDx6VNOcefGIakpwHj3CV/coLGSRVar19I5iPm4yNYjutZv89+f2/w22YJX1n8/tvzu5/s6d239/cv39ufu/eYPy3nX+h+s6pnenTvCfzu3/GxTKyvqPJ/e/9vEz4T/UPn6m/D+5/gZO7n/l4ydbH/x3+Mx/obXW4bsQGpc1KrC4yy98wYXJPmt7UQYrH9neUJnKn1n2cxFEu1UR5BWUsbU/TW+mDFWe5zijgjJI8ThJ9tz+87H6P9rAV7Dhjrfh4BVs0PE2ihyNMjbYWH/ESeyFZHHus0RaJVr7sCPfr+8v8iD54Za9zF4L69giR6Mq4erBBK4mutt3GoobimuSa09x9f1w1aYjrtwPV4COuHYU1xIX7ZyGa0NzjguXMk5cbcwVW8oRzZIjGhK4tpRL2KUPOyGutqUc0fnANb6yfeLaUlwTXKmjuBbZm3IWrq4frtxSjpji2lKOmODqOoprkfrdSbi2VEf0dt4PM5XRhNy/pTrikg9PXCHiahuqI6Ja9rkqUgLXduI6EcTAlYW46pbimuLaU1zbqQ8nuUI79eE013ZyxCRX006OmObaUVyxnfpwmmtLc074DO7ENa6Z2pbqiOt8mFng2lJcw04v1BDXh21DdcSJYMj9tRHiSg3FNcWVO4prkf1mZ+HaTn04ybWhOmKaa0M5Yoqr7yiuvp36cIorNVVHDN+WR40gcG2zPqzRxFxbqiPq8CFKBKUErg3liKBC7g9a6MPQUFyTXHuKa0P14RRX01B9OMm1oRwxxRUbyhGTXDuKq22oPpzk2lK9KZwynrgKuX9L+xFX+TAIZ+WppToictgHg84LXBvKJVJcW6ojJrl2FFfXUVxdR3H1DeX+Sa4N5YgJrqwayv2TXBuqD6e46oZy/yTXs+aIj96fdRa5eA94au/rfsOrlQl3BylLieeEPYYvaHq/vFsA9pLfHIrzq8/VgEQRIFxKBGDMuvFFRay7B59ERVv3k3QWFccTXUBFqjsrPIuKda8jTqJi5SdXz6Ji3Wufk6jo6q68n0VFHCoWUHFkOgVUrHx/5FlUHLPLv1fRqbprdmdRse5q4FlUHDWdAioW+VLHUHFkOgVUrPyW0LOoOGo6BVSs/GbTs6g4Mp0CKlZ+G+tZVMShYgEVR6ZTQEVb9161s6g4Mp0CKtLIdEqoOOqLBVR0oy/+kop2UZHopYq+8h2ztajIOLcFthirOGaXAipWvsv3LCqOdXQJFccbgwIqVn4H61lUHLNLARUrvzf2LCqOvlhAxcrvuj2LijVlOo8e1ZQ1XDyq6hzGo0evXhUm0MEj5ERrp8JXs51yS28m0RFj5x46/dM/e1AuZF//6MFbkuWOyHJPkeWeIut6iuzrf4XqDcm+/meo3pKs7Yms74YsKIU9ke0nXQT1+t+0f0OyUHtkw2VuTlm3T5Z5WQMz0rrxhautfea5hquj+Ysv7NjFXGufeK7iGr6SLXKlpuLqVOC6upkmcG0qrvtcuaO4vv7lhUdyNT5w9Wq/sdboZre1thAP266pbrApzYVr5ffE1VKTNjDrAVNas278oKIe+2mKqDj6YgEVx36aX1NRm6AiUKzi2K1ZQMXKvxhyFhVxqFhAxXEupYCKYz9NERXH7FJAxXHqsYiKY+dwARUr/971WVTEoeK/V5FLrACRgorkErog6fC1H0JMtGYbLrRmUjZRv4KljAlOrxs/crUNcUU9lwEZIeZapC5ZC1fjaZdrS3E1zixc4WeiPG2YQnkaVVS5176lx9tQGCMNx92gSHn6HFxBYUdcfT9cdVND2T5XaGqKSnDtKa4dPa9FPhF8Dq5GLudZnKladC+XF0YuXu1j5KNPCUyGHZthx2bYkXcAJTAZdjiDj7xtfx/jMvqBfHm3dfMaxjqIMPJV1QkMX43BjWuIw90iFF0tMmHs9RitMjAZdiDDDuTY8ddjTIYdzOAjjwf7GJvRDzYujdrFbJz42sXIz4JW4fijVqt9WwFFGSirRL31VHALS02GGOVyUPKr8xQKdBbKyigXltCgYjXknqQx7MLS62X6jJJLvEkUZqFcDkruhSkUZ/HiLA+dmFtNQQ5RtqssJaB8DmrjSdlHkTxzJFGcg9KQhcqytfF8WT+XpjRpE6N8DspgDgohC8U5KJulhrzHPYnK0pDk58uYgDI2er6ITRaKc1DyVWxJlM1C+RyUz1LD5yjPymShcpTf+DBuEmWzUBvKh9Mg2rhotOGNeTmBklejSRTnoNBkoVwOSl5hplCUMy8zYRYqZzZnzrIlP8v7135M70zleFEohjx8B/wlauNzNEmUz0HJH8pIomTl2c9Lb+109IrXyVdsJVGcg5Ivuk+ibBbK56AwSw3MUt5m2bJZylOW8pSlPGUpz1lqcJYaLksNJ9vyy6znMUbJx+gTKL+R6XmjF9RyumcqVj7CiLNg8l0kSZi8iyANs0nY6ixSgG0M2/swozbG7STMZ8HkkRtUOCc2FRFsDJO/RpOEGZUHsxswvcAohqHKg2Vak+d2xRBgLARAHlTTMJcFozxrlGeN86zJY2QSJg93zoVBcvrn6n2Ue0TJW0qSKMpAbZyVcx7CoUa/3rbnpA1wLrzVepgWYhN8uAl9PAu5jlrUhFwUKmvieBbmeBbmeBZ4PAu5Fl3WhD/chJzfFjXBx8fCb4xRYRvw9E94idrYS+RV2DjqFdsIJb89TNmCjd7iwvC+3tUcUH7DQwwegopQcsU4icqyJVeMUygLWagsW2RzUPJ7nAkFC0rHKJuDclm2HCZRJublNqIc9vl7hXE/9Jh8UtZbbWbUhi10y/MVeWjURpTD9gnpqTQaMp5lozkHJU/0CZSV10VTYfIJNBUbfz5fAxsrL1M8zQtnzxRj/PUYueaTwPD1mI03Rbvv2yeUzUFtVHxTqCxbnGWLs2y5LFsuy5bPipfPsUVKZaEwC+VyUBqyUJSDkseY3dGC5PdEHsLQjjFGrp/sPsUb73v37dgM3+T0dx8jlyMSmOtHMpLrhQlMhh25TuvDOa5nZ+FmDF2P8Rl2fGp2ijGsru9vrOh6jDYZGHc9Rs7rE5jrZ2g2GXZMBh+EDExGfOyV/eDn9NN/P3y7+/Dx/vP3CfHwy7+/fPpx9/XL048//vfX/JuP3+7u7+/+fP/Xt6+fPv/+97fP7++/fnr43Y16+s9vZN0tsZ98eej4E+3baWx9+Onhl2jVLVr78OPlt8bfMurJh8mP/wM=",
277
272
  "brillig_names": [
278
273
  "set_update_delay"
279
274
  ]
@@ -2040,9 +2035,9 @@
2040
2035
  "error_kind": "string",
2041
2036
  "string": "call to assert_max_bit_size"
2042
2037
  },
2043
- "16761564377371454734": {
2038
+ "14225679739041873922": {
2044
2039
  "error_kind": "string",
2045
- "string": "Array index out of bounds"
2040
+ "string": "Index out of bounds"
2046
2041
  },
2047
2042
  "17843811134343075018": {
2048
2043
  "error_kind": "string",
@@ -2050,8 +2045,8 @@
2050
2045
  }
2051
2046
  }
2052
2047
  },
2053
- "bytecode": "H4sIAAAAAAAA/+2dBZjUVtuGszO7C4t7S6F4i0MyPsXd3Z3ZEaCl0OK0lG6pewvU3d3d3d3d3d1b+j8vTLqHkBkoewI8/9dc170TOXtyvycnJ54UGBu6tX7DGObf0F8A/NlfH2jmGGf/qv1FLumquoyr7jKupsu42i7jGoCejnFNXdI1cxnX3GVcC5dxrV3GdXSJ13QZF3QZF3EZF83+qp093DP7GzQjoVA6GkhbQSthBuKlsbAZCpdGYlbMCsfCqUAsGEzHQrFovDQeNeNWKJi2MuF4MGNu6Kr5y/MyK9QFkl56Vt9qT8tyjhG3OqBQcZVyWJftb2OU97dV+qtn09j/VwPDNUEtUNtfPt7u/I4yMCvWWe005lXDr2/Z1NFWh0zTy/JrrzGvmhrLry5J+XXQmFctjeVXT2P5ubUNdZS2oa7SX0/pr+1oG+pjuAHYCey8DdqGjhrzqq9x2TQkqdudNObVQGP57UJSfp015rWTxvJr5HHb0FBpA3ZR+hsp/Ts72obGGN4VNAFNt0HbYGrMq7HGZdOMpG5bGvPaVWP5NScpv4DGvJpoLL8WHrcNzZQ2oLnS30Lpb+poG1piuBXYDey+DdqGoMa8WmpcNq1J6nZIY16tNJZfG5LyC2vMazeN5dfW47ahtXq+Qelvq/Tv7mgb2mG4PegAOm6DtiGiMa92GpdNJ5K6HdWYV3uN5dfZ47rdSanDnZX+Dkp/R0fdNjFsgQAIutRtn+Zl09rQV54hfeVpqed/Jd9mjnLQfV417NG6pNszsvWeAeeIzZ3/Vc/5hpXxEUedjWI4BuJgj2ydtaf5jdxdTz3lbdnXC/KVu1mxzmprbJv6YVass6Je1ONCo/yilccLM+hF3pFwpDSayATpCt4DzxCJp19fXqZP8eySbZG62lsX+7eLy1ZG99a2i8a9l24ebW27bcHW1qxYZ3Ul2dp21+ZplXrp2WPrPUPOEW57Bd1zXBVup/T3cOwV9MRwL9Ab9PFvnJ/O2CWPqKH/qEVnXj01rvd9PT5q6ass615Kf2+lv49jWffDcH8wAAx0OWrRvcwHbX0ZBLekDLrn2Avup4wf5CiDwRgeAob6N9wZ5HUZDNdWD4IhLz1HbL1nytyCZTVcWSbtlWXVQekf4VhWIzE8CowGY/xcV6VHamxLxpKcQdJ5VXqUxvIb9z94VXq0xvIb7/G2bKzSNoxT+scr/WMcbcMEDE8Ek8BkP9dV6Qkal80Ukrqt86r0RI3lN/V/8Kr0JI3lN83jtmGK0gZMVfqnKf2THW3DdAzPADNBws91VXq6xmVTSlK3dV6VnqGx/JL/g1elZ2osv5THbUOp0gYklf6U0p9wtA1pDGfALDDbz3VVOq1x2czxeNnMUZZBRumfpfTPdiybPTG8F5gL9t4Gx+bz9JVBxq0M5imx7qn0D85zfmI+hvcB+4IF/vKrdD5j06tnbmViVqyz5musFz7Fc2F2xVrkPKEvE8oc4xZlx6md7hVzvsaVaeGW55XcTF7WIo0LoDBbbj4jd7el89qct+FhpVyoubGyu8XOyigjCjZT8XRWls24WpsLZrHGSrzEr60ymGqZLtmClbmi7os0loPOMl36L8p0c/NSy3Sp0mhWNja+f2NL57eZzlqXP79AMmMFw+lo2IwkQuFUJBhIBaJmKhTOWBAOxEMomkwyFEvFAsFMIBpIrtPrt76O2Q2bvSGxt6qLsv3L8Lsc7JfdkhYb7o2h7gZrP4+OHDQv44BaFvtnK9EKZ6MoE/5yjFuxBQ2lWbFuo0Lc2hUxndnQ7a9xpV6heQtdydiyXbuKeqtlYMWCgUA0KOliKRyBp7BfEgikSkNm0kwkA+l4yIpnQoFQMJlKliLPhJUxM4lkPBPbkJfqe4DfQ2HJ3Hl/R0XlD9C3AK2VGiuWV2W40r9pvhUtw5WaWzjdca/IEXdF8z1Q866o3aAe6N90y6R7L0nn9bllGut92XZqUM2KdVaZ5rpgdwf5PRQ+yK8/31UeN4Jmxbr1ca9S9pE15Zv3pG6FH3vQGP9yjcvnYNKV9WCPVtZD/B4KH+LBynroDr6yStyHbuOV1axYt9HW0KxYp7UxPUxzpS/JLu/DlGPt5Ur/qmx9FWRv45/nqpR++x1ThyPtEeDI7P/YeS/LkfcKJe/NpTkKv0eDY/zerJursnVU997lsTv4XrVXcR+ncf0xlM6n2XOFxnXzeM0xO2M1K9ZZsn7qXC6yTh7rQd05waNzbbrrjqkxrxN38Lojbb/G02SWrCsneFB3VmvembUfwctVh8yKdevvQtS5ryH1aLXH+1qeFUY3jY3xGo2Fqp7WkXybZStGkbHxBYvGhnunxyMU9CbfSMajfNPe5BsNeZRvwKNysDzK16P64FX5huIelYNX9YysfD2rZx6Vr1f1NxL2Jt+QV8vNI9+o6ZFv0qN8PdoORb1qdzxabhGP6lkw4U2+AY/qWbTUo3zX33hT03DvnPOIhWPYEY1HI8FIMhMNhxPpaGkqbQYzgUg0mTatRDiAC65WMmAlg5FYIJHI4E8kaP13oKA3fjs/3Sf+2ngQu27HtgSO7Qgc2xM4diBw7ETg2JnA0SJwDBA4hggcNT7SZeo+aRr1KGaNeW2bE5BrNJ6AXOvRCci12ROQ+cpBx10AutxjhjeVQHfMBRpjjpPE7NMY8x4kMfs1xtxlG8VsVqyzumosP9Ojq7O6Nz7dDA7P7iSePUg8e5J49iLx7E3i2YfEsy+JZz8Sz/4kngNIPAeSeA4i8RxM4jmExHMoiecwEs/hJJ4jSDxHkniOIvEcTeI5hsRzLInnOBLP8SSeE0g8J5J4TiLxnEziOYXEcyqJ5zQSz+kknjNIPGeSeCZIPEtJPJMknikSzzSJZ4bEcxaJ52wSzzkknnuSeO5F4jmXxHNvEs95JJ7zSTz3IfHcl8RzAYnnQhLPRSSei0k8l5B4LiXxXEbiuZzEcz8Sz/1JPFeQeB5A4rmSxPNAEs8yEs+DSDxXkXgeTOJ5CInnoSSeh5F4Hk7ieQSJ55EknkeReB5N4nkMieexJJ7HkXgeT+J5AonniSSeq0k815B4riXxPInE82QSz1NIPE8l8TyNxPN0Es8zSDzPJPE8i8TzbBLPc0g8zyXxPI/E83wSzwtIPC8k8byIxPNiEs9LSDwvJfG8jMTzchLPK0g8ryTxvIrE82oSz2tIPK8l8byOxPN6Es8bSDxvJPG8icTzZhLPW0g8byXxvI3E83YSzztIPO8k8byLxPNuEs97SDzvJfG8j8TzfhLPB0g8HyTxfIjE82ESz0dIPB8l8XyMxPNxEs8nSDyfJPF8isTzaRLPZ0g8nyXxfI7E83kSzxdIPF8k8XyJxPNlEs9XSDxfJfF8jcTzdRLPN0g83yTxfIvE820Sz3dIPN8l8XyPxPN9Es8PSDw/JPH8iMTzYxLPT0g8PyXx/IzE83MSzy9IPL8k8fyKxPNrEs9vSDy/JfH8TrOnz+FX4e/sIo9lGr9HfiLyWu3XX47fe7S8fZo9f9C4bLqRfAP5R4PD8ycSz59JPH8h8fyVxPM3Es/fSTz/IPH8k8TzLxLPdSSef5N4SoYMngUknj4STz+JZyGJZxGJZzGJZyUSz8okniUknlVIPKuSeFYj8axO4lmDxLMmiWctEs/aJJ51SDzrknjWI/GsT+LZgMRzJxLPnUk8G5J47kLi2YjEszGJ564knk1IPJuSeDYj8Wzukafuew4KNMbcgmTZtCyoePmlM+u7tJeerTR4xhLxEJKmvaxDfo0x77aN1huzYp21e4G+8ouS3FvSmmTZtNG4bEJ+jpjbaoy5C0l9bEeyvWlP4tmBxLMjiWcnEs/OJJ4miadF4hkg8QySeIZIPMMknhESzyiJZ4zEM07iuQeJZxcSz64knt1IPLuTePYg8exJ4tmLxLM3iWcfEs++JJ79SDz7k3gOIPEcSOI5iMRzMInnEBLPoSSew0g8h5N4jiDxHEniOYrEczSJ5xgSz7EknuNIPMeTeE4g8ZxI4jmJxHMyiecUEs+pJJ7TSDynk3jOIPGcSeKZIPEsJfFMknimSDzTJJ4ZEs9ZJJ6zSTznkHjuSeK5F4nnXBLPvUk855F4zifx3IfEc18SzwUkngtJPBeReC4m8VxC4rmUxHMZiedyEs/9SDz3J/FcQeJ5AInnShLPA0k8y0g8DyLxXEXieTCJ5yEknoeSeB5G4nk4iecRJJ5HkngeReJ5NInnMSSex5J4HkfieTyJ5wkknieSeK4m8VxD4rmWxPMkEs+TSTxPIfE8lcTzNBLP00k8zyDxPJPE8ywSz7NJPM8h8TyXxPM8Es/zSTwvIPG8UPG034EYLk2UhkvjgXAoHQylI2YqaIajiXA8GE4mrUQokgrFY6lYNBwIWOlYKhIPmdFUOJ7K+67Gir5fUeP3c62LSJbNxQX6ys/LZdNGY8yXeLRsdMfcVmPMl5LE3E5jzJeRxNxeY8yXk8TcQWPMV5DE3EljzFeSxNxZY8xXkcRsaYz5apKYAxpjvoYk5pDGmK8liTmsMebrNMese99Y8oh6UIY6Ha8nOc64gcTzRhLPm0g8b95G7ZpZsc66ReNx8BqS7zTcSlKHbiPxvJ3E8w4SzztJPO8i8bybxPMeEs97STzvI/G8n8TzARLPB0k8HyLxfJjE8xESz0dJPB8j8XycxPMJEs8nSTyfIvF8msTzGRLPZ0k8nyPxfJ7E8wUSzxdJPF8i8XyZxPMVEs9XSTxfI/F8ncTzDRLPN0k83yLxfJvE8x0Sz3dJPN8j8XyfxPMDEs8PSTw/IvH8mMTzExLPT0k8PyPx/JzE8wsSzy9JPL8i8fyaxPMbEs9vSTy/I/H8nsTzBxLPH0k8fyLx/JnE8xcSz19JPH8j8fydxPMPEs8/STz/IvFcR+L5N4mn4ePwLCDx9JF4+kk8C0k8i0g8i0k8K5F4VibxLCHxrELiWZXEsxqJZ3USzxoknjVJPGuReNYm8axD4lmXxLMeiWd9Es8GJJ47kXjuTOLZkMRzFxLPRiSejUk8dyXxbELi2ZTEsxmJZ3MSzxYkni1JPFuReO5G4rk7iWdrEs82JJ5tSTzbkXi2J/HsQOLZkcSzE4lnZxJPk8TTIvEMkHgGSTxDJJ5hEs8IiWeUxDNG4hkn8dyDxLMLiWdXEs9uJJ7dSTx7kHj2JPHsReLZm8SzD4lnXxLPfiSe/Uk8B5B4DiTxHETiOZjEcwiJ51ASz2EknsNJPEeQeI4k8RxF4jmaxHMMiedYEs9xJJ7jSTwnkHhOJPGcROI5mcRzConnVBLPaSSe00k8Z5B4ziTxTJB4lpJ4Jkk8UySeaRLPDInnLBLP2SSec0g89yTx3IvEcy6J594knvNIPOeTeO5D4rkviecCEs+FJJ6LSDwXk3guIfFcSuK5jMRzOYnnfiSe+5N4riDxPIDEcyWJ54EknmUkngeReK4i8TyYxPMQEs9DSTwPI/E8nMTzCBLPI0k8jyLxPJrE8xgSz2NJPI8j8TyexPMEEs8TSTxXk3iuIfFcS+J5EonnySSep5B4nkrieRqJ5+kknmeQeJ5J4nkWiefZJJ7nkHieS+J5Honn+SSeF5B4XkjieRGJ58UknpeQeF5K4nkZieflJJ5XkHheSeJ5FYnn1SSe15B4XkvieR2J5/UknjeQeN5I4nkTiefNJJ63kHjeSuJ5G4nn7SSed5B43knieReJ590knveQeN5L4nkfief9JJ4PkHg+SOL5EInnwySej5B4Pkri+RiJ5+Mknk+QeD5J4vkUiefTJJ7PkHg+S+L5HInn8ySeL5B4vkji+RKJ58sknq+QeL5K4vkaiefrJJ5vkHi+SeL5Fonn2ySe75B4vkvi+R6J5/sknh+QeH5I4vkRiefHHnn6HJ5BMxIKpaOBtBW0EmYgXhoLm6FwaSRmxaxwLJwKxILBdCwUi8ZL41EzboWCaSsTjgcz2bxba4z5k20Us1mxzvrUp6/81vo5lnOhxvL7jKRuF2mM+XOSmIs1xvwFScyVNMb8JUnMlTXG/BVJzCUaY/6aJOYqGmP+hiTmqhpj/pYk5moaY/6OJObqGmP+niTmGhpj/oEk5poaY/6RJOZaGmP+iSTm2hpj/pkk5joaY/6FJOa6GmP+lSTmehpj/o0k5voaY/6dJOYGGmP+gyTmnTTG/CdJzDtrjPkvkpgbaox5HUnMu2iM+W+SmBtpjNkgOb/dWGPMBSQx76oxZh9JzE00xuwnibmpxpgLSWJupjHmIpKYm2uMuZgk5hYaY65EEnNLjTFXJom5lcaYS0hi3k1jzFVIYt5dY8xVNcaMrNbf4/NiNuAYiIM9QBfQFXQD3UGPbAy9QG/QB/QF/UB/MAAMBIPAYDAEDAXDwHAwAowEo8BoMAaMBePAeDABTASTwGQwBUwF08B0MAPMBAlQCpIgBdIgA2aB2WAO2BPsBeaCvcE8MB/sA/YFC8BCsAgsBkvAUrAMLAf7gf3BCnAAWAkOBGXgILAKHAwOAYeCw8Dh4AhwJDgKHA2OAceC48Dx4ARwIlgN1oC14CRwMjgFnApOA6eDM8CZ4CxwNjgHnAvOA+eDC8CF4CJwMbgEXAouA5eDK8CV4CpwNbgGXAuuA9eDG8CN4CZwM7gF3ApuA7eDO8Cd4C5wN7gH3AvuA/eDB8CD4CHwMHgEPAoeA4+DJ8CT4CnwNHgGPAueA8+DF8CL4CXwMngFvApeA6+DN8Cb4C3wNngHvAveA++DD8CH4CPwMfgEfAo+A5+DL8CX4CvwNfgGfAu+A9+DH8CP4CfwM/gF/Ap+A7+DP8Cf4C+wDvwNZGUpAD7gB4WgCBSDSqAyKAFVQFVQDVQHNUBNUAvUBnVAXVAP1AcNwE5gZ9AQ7AIagcZgV9AENAXNQHPQArQErcBuYHfQGrQBbUE70B50AB1BJ9AZmMACARAEIRAGERAFMRAHe4AuoCvoBrqDHqAn6AV6gz6gL+gH+oMBYCAYBAaDIWAoGAaGgxFgJBgFRoMxYCwYB8aDCWAimAQmgylgKpgGpoMZYCZIgFKQBCmQBhkwC8wGc8CeYC8wF+wN5oH5YB+wL1gAFoJFYDFYApaCZWA52A/sD1aAA8BKcCAoAweBVeBgcAg4FBwGDgdHgCPBUeBocAw4FhwHjgcngBPBarAGrAUngZPBKeBUcBo4HZwBzgRngbPBOeBccB44H1wALgQXgYvBJeBScBm4HFwBrgRXgavBNeBacB24HtwAbgQ3gZvBLeBWcBu4HdwB7gR3gbvBPeBecB+4HzwAHgQPgYfBI+BR8Bh4HDwBngRPgafBM+BZ8Bx4HrwAXgQvgZfBK+BV8Bp4HbwB3gRvgbfBO+Bd8B54H3wAPgQfgY/BJ+BT8Bn4HHwBvgRfga/BN+Bb8B34HvwAfgQ/gZ/BL+BX8Bv4HfwB/gR/gXXgbyA7BgXAB/ygEBSBYlAJVAYloAqoCqqB6qAGqAlqgdqgDqgL6oH6oAHYCewMGoJdQCPQGOwKmoCmoBloDlqAlqAV2A3sDlqDNqAtaAfagw6gI+gEOgMTWCAAgiAEwiACoiAG4mAP0AV0Bd1Ad9BDzvOBXqA36AP6gn6gPxgABoJBYDAYAoaCYWA4GAFGglFgNBgDxoJxYDyYACaCSWAymAKmgmlgOpgBZoIEKAVJkAJpkAGzwGwg35qX77jLN9Ll++PybW/5brZ8k1q+9yzfUpbvFMs3gOX7uvLtWvkurHxzVb5nKt8Kle9wyjcu5fuR8m1G+e6hfFOwDMi38OQ7c/INN/k+mnx7TL7rJd/Mku9Rybee5DtK8o0i+f6PfFtHvlsj34SR763It0zkOyHyDQ75voV8O0K+yyDfPJDvCci7+uU9+PKOeXl/u7wbXd47Lu/0PhfIu6jlPc/yDmV5P7G8+1feqyvvrJX3wcq7VuU9pvKOUHn/przbUt4bKe9klPcdyrsE5T198g48eb+cvLtN3osm7xyT93nJu7LkPVTyjid5f5K8m0je+yPv1LkXyLtg5D0r8g4TeT+IvHtD3msh74yQ9zHIuw7kPQLyjL48/y7Plstz2/JMtDxvLM/yynOy8gyq7HfKs5PyXKI88yfP08mzavIcmDxjJc8vybNB8tyNPNPyLpBnMeQ5B3mGQO7Pl3vf5b5yuc9a7mGW+3DlvlS5T1PuW5T7+OS+NrnPS+57kvuA5L4YuU9E7puQ+wjkurpcZ5brrnIdUq7LyXUquW4j1zHkvL6c55bzvnIeVM4LynkyOW8k51HkvIIcZ8txpxyHyXGJ7Kf7NuwyGHKfsXQxo7zLNieS5frpcl+u3Kcq923KfYxyX5/c5yb3fcl9UHJfkNwnI/eNyH0Ucl+BXGeX685yHVauS8p1OrluJddx5LqGnOeX895yHljOi8p5Qjlv1gw0By2AHHfLcagcl8lxitz73ga0Be1Ae9ABdASdQGcgB0sWCIAgCIEwiICosWlXWelvm/2t/2Gvhvs+fkk/NZ2VZ9rw7O85lzW5qdGHvsnqtBF5po3NM218nmmL8rgszTHNjjOe/S3J/vqyv7LMZXn3zA6bFeusEiVf3fnHzFC0xNi40+wfLDE2Xj+8yr/Im/zX32MtXd+y8vzVWOz5+h3pnP8j06tn+wuMTdPYcXhRj7Ccwx6Xk2XnX8mj5WyXW7FSdn6XmOz5V3csK3u626+dl3OaPa8qhqd12MoXm+pv141ajvTOMsiVV/G/zGt7LlO1rNVluj5NWfk0n2NaoTKt2DGtqGzTGKU9b6akc66DhY5pdj2Rrn9ZeR7tlfw6ZPvt8vOy7faqzZCurou/Oi/pKpWVl4ddNn5lnF3m9jKorKZ3TCtRphWWbTyfKtnhQmU+al62R5EjfbvscM3sb7HyP/b/13KZf7Fj/ht5u4xzlkuJS/oSl/RSR1tm+6tmkToUVPLLtY74jE3zq2ls2h7Y/+vx+hywXQtdXNX2xZ6/7PPWz/YvXDR/QXrQvH7L0snFi+bMn9cnkZydNhyduvKpFdO5E64WgBqoWx5+5f/dOlkg9k5SYdnG/9czO96sQBeNmaY9b3uFKHJ4Go75FznS2wcdVZS47N+KPACZiSasTDCRSYQTqVQomajjyN8wyiuelNPUbD/5TnHpttopLvYm/7DHK7rrTrHbCm7X4X5l5WXZr2xjJzvNACXNgBxpBippBipppMu3c+3csKse+TbsbjuRAxzT1HbGdpIG3G7YpL+B4ijdoLJy9wLHtMHKNNu3xOGoub7HPT5IC9R18bfnZW/wuhkbl6u6wftno2p4v0Oqzs8w3A8M7PlXMTxdj/85MKjk8Mm1My8b1LrZ/mRi7tyRC+YsSSxK9188LynbVDUENVufS4jOzaGdxrlZLXAM+xzDzs2t83isyCXfXP/vHGfPu6ax6X5qscPRuUid4/IdD+VrYgpy/NrzMTYzHzdnt+Zqa+fjZdMhXS2Hqzovj5uVsFsTbDjKMN9yVJsR5zpguJSvoaSxY5Kmq4+SrzOd00ddDsVK/mocbsvL7bi4yOGYq4m1x3t8Diji1nQ741fL3Lk8KivT/u3yUI/n/83yyHWewblu+h3T3M4RMBwq9M4Ob+9DBXWTX9PYtO4623Z1OTnbNo82vwHndtIua6dPsTJdTT84+yuxjnfE5nY873cpK6eDml6Nu9BRXm7nRD0ur7y7K27lZae31/tiI//5vyJH+tHZXxmelO132676HdN8Lnm7rfN2GUp91b2+pGPxlBnPpBOWZQVSZnpz64vu+YfCiWgyEbWseMhKh6zw5ubfKtv/3/WuvF3Q43Oyltf7c26H9m77dvkOt2V9rGGU99dS/ke6fkreBY5p/V3m6/Hhb3h7Hv7a9bFPmfFPt5XztZwj7O1sk2x+bvuIzvbEeW7ZuV0ycuSh5uM8bvlnn8UlPztut3Y/l5tbORou49zc/JtxK3Rxc+bryxNHrvm47b+47UsWOKa5uTPsZ7bMDm/v/czm2f7/tlt5u6DH25WAx22s63bLrZ3Y2tPEzm1aTSU/6dTtlp23x/d0RDxeZlZdI/e2wN62NDLKO7Wci4zc24UiR1r79Ljs/9fNkV9xnvzczq2o/9cw2+92Pd7QWF5uHgUuHuxte7Ps8PZu2+16Q962h/87Jsnf6TomqWaU9/9zz4nhvi721LhsPSz7vPfo2G20ffwl8dvrzLz5i+ZklvdZkMb1odTwxXPnzsnMSS8wHF2Bo7/AZbw9px291bIvyG7vVmtutp+71YpkuPdIA6U7yh6p35HO+T/q//VT0vTLkaa/kqZ/jjS5brZQ0+S62UJNM0hJMyhHmsFKmsE50gxR0gzJkWaokmZojjTDlDTDcqQZrqQZniPNCCXNiBxpRippRuZIM0pJMypHmtFKmtE50oxR0ozJkWaskmZsjjTjlDTjcqQZr6QZnyPNBCXNhBxpJippJuZIM0lJMylHmslKmsk50kxR0kzJkWaqkmZqjjTTlDTTcqSZrqSZniPNDCXNDEcaj/c4Qt62a1bS7YYpOxZvrzBbKbf9D79jnDr/Koane6b/XPHKdyVeOvVIdX2asnKfAse0wrJN43C7g129A6GHks6tbknn7dmIiOnx9jSzHeud+f+x3jmnFZZtGse/rXduR2WSTr0SPjTb7207uGH/1Kv6Lt3/h6cjBmWHd+SnI3pn+9VjzD7K/HW2MfYRc8Z2MrxsV8yMc7/Bb5Svx+q67bwS+t9Tdv+6++8puzxxO+evDqvpfS6xuW1bnE/sFSrTtvSpvB4OH5+LT4GLTz5/t+Vc09h02TjvmFLvTNR5VSzfdlxdHvb8qyn9qXTp4llD588yHJ3z6oMdZ2NHOrsN9Rmb1u3iHHkZjuHGjnF+w/1hKobzg3tlh3eEOyMNpbxUH91XZO15epC/qa5/hiMWdb7OMih0+b+CHMM+x2++tM7x6rjqLtPsPO0rkqqvHUeJ47e+kq8X53LreZO/67Kqr/TXc8SplndPTQ52fvY663ZXv88xTT3GUP0K9PtZThe/y7zszq4z9ZRxdnn+H1oWRJYcqQIA",
2054
- "debug_symbols": "7V3bbtw4DP2XeZ4HkRQpqb+yWBRpmxYBgqRI0wUWRf99ZSe6ZCzbq4ynlRu9FPWEh6bOsSWKluUfh0/XH75/eX9z9/n+2+HdXz8Ot/cfrx5v7u/80Y8D2PG3b1+v7obDb49XD4+Hd8jaHA/Xd5/8fwXw5/Hw+eb2+vAOwP08Tq1Rq2CNkqydKhiTcvxsTCB22RjYQQjE/59UNEdjSvbCNpjLYBGsnS5Zk1Cw1qBeWP99PIDr1MxQg6pTM0cNdGrmqMFOzRw11KmZo0Z3auao4U7NHDXSqZmjxnRq5qjp2fAsNT0bnqOGejY8S03Phmep6dnwLDU9G56lRndq5qjp2fAsNT0bnqWm9WyYdaImMy9Tg4ASIgHNZ1LTejb8G6lpPRv+fdTocjasLSRqaIUaDeKerTWqFJDQeAa4+BmKuZn2riIGEqlcYokTp0zisnC4JC/Ea4GAUzgs+74WqPO4CY+687gJj7zKY97Y0hmIMDKT81hmxoRERRMkyvVTMLJBMCYYkyZZDgbEd4sxb7LoTjs901g89hfHY5yLeaVVOBkUXFvxsNo0HlGwHA+6cCOSSnet8BhLcUjWOt7qmomWYwHE2Fp0WbcwpEYTa3/tPBtb5TLbkmeLEPoni4wrHY5xOlh7AWjFmlhSGpFsdTHfcxh6MspSDix3ZBCMgbK+o2ysouag8h517GcYuzbNakNdm2a10V2bVW1MZBBNxkaZbmOCYz+28VnacNemWW3kfG0gaUMv+MbilCJOEfysnles37o6pqvTsDrlOQ/HgreWjPByTu/nCnE27tIcA9kV5+4EaaKfaun+954RTNRxXZ121RHV1WlYHejqNKwOdnUaVoe6Og2ro7s6DavDXZ2G1ZGuTsPqmK5Ow+r0WkHL6vRaQcPqmF4raFmdXitoWZ1eK2hZnV4raPj5jtFdnYbV2aBWgBheASCydkWdt863dL5/Kd8bzOc1Rb61hRW+0biwwhdtvgK6uL40rTnHvKsCM8Zum44dVVQUCfPYp8ZsgmN22UJ8OzbTtd1M5thMY1/fTKuabiZJfI+Lshv/6Uq00HTsOi4aRyazLBGwjXmnKHXaUHwrDaU/p6Emrc0yDGfcobpzMuGE/yBOjEpZBZ3BiXROJpxskWdBelPI4gon3h9E19mrxEVONEA0fpFnyRi7bTp2JI5Z9jR2t9/Yndpx7LDj2HHHsdOOY9c7jp13HLvsOPatx9W16imQje+qa+Dl2FnHNJO1tqex2x3H7vYbOyi15+Ch7eCjMbPSk+Bxz8HTnoPXew6emw4+PRRgZ+2ysXHRs1Uv56pjS+XNtLTpkdufOxQgxAPPa2nT43xVS62KF4BV7CYtbTor2LKl0HQKsdDSMfimU4i14NuenYM1cbaiJl0BtD09XwleF4M38WVubfTKlmNCGO4qIUkPXaS09AQsxz1AncpmfsxP8fD58eh4CvHWy/GgLwGnjcfsZPclAGktoOIYyxAvN0YtywH5fjB0g5S912+eL4ni0MYUd/Fiykrs5a0DiNOeViTA57bZtRWSP/jwcHN7e/Pl/YvPbKnhn/LucxwXaLFJ8izuEbcMMfUQWw9xlRB/BINl+Us3Qi6NvxlQzX8BZhnC9RCph5h6iK2HFKm2GCF52eAJUv4iwTIE6iFYD6F6iK6HcD1E6iGmHmLrIWX10xwkf/qoi1sHS9ydMxtjiHF+t97t3MNl3eNl3dNl3evLuufLupfLujcburc0cW8v695d1H15608XU0+XL3V46kfKO3QuQ7AeQvUQXQ/heojUQ0w1pPxK5jLEVUPMzA7rcWmmmNMLxkA9BOshVA/R9RCuh0g9pPxdCBMXhrrJXVleorwMcdWQ8tLZZQjUQ7AeQpUQf4SDZXni6p99hcmEfxiTZcXFpfpx4mrgxeprH1d52rqde3e+ewrTVaPdifvyp3Yr3Ye1r0ZOFzOXP1db596G9NW401X75U++bueeznZvY09r9am05YlnpftYWGY5dc/nuzcYM4oJObKhe3dy3fsDGu/d8kn8s99wElD2/90xELtjX1uT5cC8V5OsVbZ967AC0x/oMbjy4GIhrgm1WVlyrDT6Ix5sy92/s3FYdpP6WLn7X4a4aki5+1+GQD0E6yFUD9H1EK6HSD2kXn1br76tV9/Vq+/q1Xf16rt69V29+uWFd07i8yalcIKRV2DMKzD2FRhXj5lZ0LQE+ukP/7l6uLn6cHs9lKOHv36/+xiq0/7w8d+v4S+hfv314f7j9afvD9dDJTsVsQedfT6hcQzFHzAcWWJ5d/xJ4Cgy/H249Pzw7SDlesPfSR2J0xAy/ITmSJg67uEnkCNC7JCH8wodDYXzDkOMHwV843wD/wM=",
2048
+ "bytecode": "H4sIAAAAAAAA/+2dBXgUV9uGJ7tJIFjwlkLRtjjMrG9xCe7usNnsAi2FFivQ0qZuSN3d3d3d3V2puzv9n5fukMMwu1ByJvT5v8513dmRkzP3e+bMGZ/JM/7u1voNo7//7/484M/8+kBLxzj7V+0vcElX02VcbZdxxS7j6rmMawx6O8a1cEnX0mVcK5dxrV3GtXUZ19klXtNlXNBlXMRlXDTzq3b2cO/Mb9CMhEKpaCBlBa2EGYiXxsJmKFwaiVkxKxwLlwViwWAqFopF46XxqBm3QsGUlQ7Hg2nz766WvyIvs1JdIOmlZ+1t9rQs5xhxqw/yFVcph/WZ/nZGRX97pb92Jo39f3UwXAzqgnr+ivF253eUgVm5zuqgMa86fn3Lpr62OmSaXpZfR415FWssvwYk5ddJY151NZZfQ43l59Y21FfahgZKf0Olv56jbWiE4cZgB7BjFbQNnTXm1UjjsmlCUre7aMyrscby24mk/LpqzGsHjeXX1OO2oYnSBuyk9DdV+nd0tA3NMLwzaA5aVEHbYGrMq5nGZdOSpG5bGvPaWWP5tSIpv4DGvJprLL/WHrcNLZU2oJXS31rpb+FoG9pgeBewK9itCtqGoMa82mhcNm1J6nZIY167aCy/diTlF9aY164ay6+9x21DW/V8g9LfXunfzdE2dMBwR9AJdK6CtiGiMa8OGpdNF5K6HdWYV0eN5dfV47rdRanDXZX+Tkp/Z0fdNjFsgQAIutRtn+Zl09bQV54hfeVpqed/Jd+WjnLQfV417NG6pNszsu2eAeeILZ3/Vc/5hpXxEUedjWI4BuJg90ydtaf5jexdbz3lbdnXC3KVu1m5zmpvVE39MCvXWVEv6nG+UXHRyuOFGfQi70g4UhpNpIN0Be+BZ4jE068vL9OneHbLtEjd7a2L/dvNZSuje2vbTePeSw+PtrY9tmJra1aus7qTbG17avO0Sr307LXtniHnCLe9gp5Zrgp3UPp7OfYKemO4D+gL+vk3zU9n7JJH1NB/1KIzr94a1/v+Hh+19FeWdR+lv6/S38+xrEswPAAMBINcjlp0L/PB214Gwa0pg55Z9oJLlPGDHWUwBMNDwTAwvArKYIS2ehAMeek5cts9y8ytWFYjlGXSUVlWnZT+kY5lNQrDo8EYMNbPdVV6lMa2ZBzJGSSdV6VHayy/8f+DV6XHaCy/CR5vy8YpbcN4pX+C0j/W0TZMxPAkMBlM8XNdlZ6ocdlMJanbOq9KT9JYftP+B69KT9ZYftM9bhumKm3ANKV/utI/xdE2zMDwTDALJPxcV6VnaFw2pSR1W+dV6Zkayy/5P3hVepbG8ivzuG0oVdqApNJfpvQnHG1DCsNpMBvM8XNdlU5pXDZzPV42c5VlkFb6Zyv9cxzLZg8M7wnmgb2q4Nh8vr4ySLuVwXwl1j2U/iE5zk8swPDeYB+w0F9xlc5nbH71zK1MzMp11gKN9cKneC7KrFiLnSf0ZUK5Y9zizDi1071iLtC4Mi3a+rySW8jLWqxxAeRnys1nZO+2dl5b8jY8rJSLNDdWdrfEWRllRN4WKp7OyrIFV2tLwSzRWImX+rVVBlMt06VbsTJX1n2xxnLQWab7/oMy3dK81DLdV2k0qxub3r+xtfPbQmetz51fIJm2guFUNGxGEqFwWSQYKAtEzbJQOG1BOBAPoWjSyVCsLBYIpgPRQHK9Xr8Ndcxu2OwNib1VXZzpX4bf5WCFWkAe1D+dZz6Xaax/+2nemBQaVbMXsp9HDf7+fg+F9/frz3elxsrgVdwrlZVLU745D5crfUOpxviXa1w+B5CurAd4tLIe6PdQ+EAPVtbyf/nKKnGXV/HKalau22RraFau09qYHqS50hdllvdByl7McqV/pb/ijRuyt7HxjnWl3357x8FIewg4NPM/dt7LsuS9Qsl7S2kOw+/h4Ai/N+vmykwd1X2u50jN53J1+3kV91Ea1x9D6XyaPVdoXDeP1hyz7vtLZf3UuVxknTzSg7pzjN+bbYTuumNqzGvVv7zuSNu/QqOjrCvHeFB3VmvembUfbshWh8zKdRvu79C5ryH1aLXH+1qeFUYPjY3xGo2Fqp4Ck3xbZipGgbHpqaBmhnunxyMU9CbfSNqjfFPe5BsNeZRvwKNysDzK16P64FX5huIelYNX9YysfD2rZx6Vr1f1NxL2Jt+QV8vNI9+o6ZFv0qN8PdoORb1qdzxabhGP6lkw4U2+AY/qWbTUo3w3XNIsNtw75zxi4Rh2ROPRSDCSTEfD4UQqWlqWMnFtMRJNpkwrEQ6Y8ZiVDFjJYCQWSCTS+BMJWv8dKOiN385P94m/dh7ErtuxPYFjBwLHjgSOnQgcuxA4diVwtAgcAwSOIQJHjTfLm7pPmkY9illjXlVzAnKNxhOQaz06Abk2cwIyVznouAtAl3vM8KYS6I45T2PMcZKYfRpj3p0kZr/GmLtVUcxm5Tqru8byMz26Oqt749PD4PDsSeLZi8SzN4lnHxLPviSe/Ug8+5N4lpB4DiDxHEjiOYjEczCJ5xASz6EknsNIPIeTeI4g8RxJ4jmKxHM0iecYEs+xJJ7jSDzHk3hOIPGcSOI5icRzMonnFBLPqSSe00g8p5N4ziDxnEniOYvEM0HiWUrimSTxLCPxTJF4pkk8Z5N4ziHxnEviuQeJ554knvNIPPci8ZxP4rmAxHNvEs99SDwXknguIvFcTOK5hMRzKYnnviSey0g8l5N4riDx3I/Ec38Sz5UkngeQeB5I4llO4nkQiefBJJ6HkHgeSuJ5GInn4SSeR5B4HknieRSJ59EknseQeK4i8VxN4rmGxHMtieexJJ7HkXgeT+J5AonniSSeJ5F4nkzieQqJ56kknqeReJ5O4nkGieeZJJ5nkXieTeJ5DonnuSSe55F4nk/ieQGJ54UknheReF5M4nkJieelJJ6XkXheTuJ5BYnnlSSeV5F4Xk3ieQ2J57UknteReF5P4nkDieeNJJ43kXjeTOJ5C4nnrSSet5F43k7ieQeJ550knneReN5N4nkPiee9JJ73kXjeT+L5AInngySeD5F4Pkzi+QiJ56Mkno+ReD5O4vkEieeTJJ5PkXg+TeL5DInnsySez5F4Pk/i+QKJ54skni+ReL5M4vkKieerJJ6vkXi+TuL5BonnmySeb5F4vk3i+Q6J57sknu+ReL5P4vkBiec6Es8PSTw/IvH8mMTzExLPT0k8PyPx/JzE8wsSzy9JPL8i8fyaxPMbEs9vNXv6HH6V/s4u8lim8Xvkq5DXar/+cvzOo+Xt0+z5vcZl04PkG8g/GByeP5J4/kTi+TOJ5y8knr+SeP5G4vk7iecfJJ5/kniuJ/H8i8RTMmTwzCPx9JF4+kk880k8C0g8C0k8q5F4VifxLCLxrEHiWZPEsxaJZ20SzzoknsUknnVJPOuReNYn8WxA4tmQxLMRiWdjEs8dSDx3JPFsQuK5E4lnUxLPZiSeO5N4NifxbEHi2ZLEs5VHnrrvOcjTGHNrkmXTJq/y5ZdKb+hSXnruosEzloiHkHQTT911yK8x5l2raL0xK9dZu+XpK78oyb0lbUmWTTuNyybk54i5vcaYu5HUxw4k25uOJJ6dSDw7k3h2IfHsSuJpknhaJJ4BEs8giWeIxDNM4hkh8YySeMZIPOMknruTeHYj8exO4tmDxLMniWcvEs/eJJ59SDz7knj2I/HsT+JZQuI5gMRzIInnIBLPwSSeQ0g8h5J4DiPxHE7iOYLEcySJ5ygSz9EknmNIPMeSeI4j8RxP4jmBxHMiieckEs/JJJ5TSDynknhOI/GcTuI5g8RzJonnLBLPBIlnKYlnksSzjMQzReKZJvGcTeI5h8RzLonnHiSee5J4ziPx3IvEcz6J5wISz71JPPch8VxI4rmIxHMxiecSEs+lJJ77knguI/FcTuK5gsRzPxLP/Uk8V5J4HkDieSCJZzmJ50EkngeTeB5C4nkoiedhJJ6Hk3geQeJ5JInnUSSeR5N4HkPiuYrEczWJ5xoSz7UknseSeB5H4nk8iecJJJ4nknieROJ5MonnKSSep5J4nkbieTqJ5xkknmeSeJ5F4nk2iec5JJ7nknieR+J5PonnBSSeFyqe9jsQw6WJ0nBpPBAOpYKhVMQsC5rhaCIcD4aTSSsRipSF4rGyWDQcCFipWFkkHjKjZeF4Wc53NVb2/Yoav59rXUSybC7O01d+Xi6bdhpjvsSjZaM75vYaY76UJOYOGmO+jCTmjhpjvpwk5k4aY76CJOYuGmO+kiTmrhpjvookZktjzFeTxBzQGPM1JDGHNMZ8LUnMYY0xX6c5Zt37xpJH1IMy1Ol4Pclxxg0knjeSeN5E4nlzFbVrZuU66xaNx8FrSL7TcCtJHbqNxPN2Es87SDzvJPG8i8TzbhLPe0g87yXxvI/E834SzwdIPB8k8XyIxPNhEs9HSDwfJfF8jMTzcRLPJ0g8nyTxfIrE82kSz2dIPJ8l8XyOxPN5Es8XSDxfJPF8icTzZRLPV0g8XyXxfI3E83USzzdIPN8k8XyLxPNtEs93SDzfJfF8j8TzfRLPD0g815F4fkji+RGJ58cknp+QeH5K4vkZiefnJJ5fkHh+SeL5FYnn1ySe35B4fkvi+R2J5/cknj+QeP5I4vkTiefPJJ6/kHj+SuL5G4nn7ySef5B4/kniuZ7E8y8ST8PH4ZlH4ukj8fSTeOaTeBaQeBaSeFYj8axO4llE4lmDxLMmiWctEs/aJJ51SDyLSTzrknjWI/GsT+LZgMSzIYlnIxLPxiSeO5B47kji2YTEcycSz6Ykns1IPHcm8WxO4tmCxLMliWcrEs/WJJ5tSDx3IfHclcRzNxLPtiSe7Ug825N4diDx7Eji2YnEszOJZxcSz64kniaJp0XiGSDxDJJ4hkg8wySeERLPKIlnjMQzTuK5O4lnNxLP7iSePUg8e5J49iLx7E3i2YfEsy+JZz8Sz/4kniUkngNIPAeSeA4i8RxM4jmExHMoiecwEs/hJJ4jSDxHkniOIvEcTeI5hsRzLInnOBLP8SSeE0g8J5J4TiLxnEziOYXEcyqJ5zQSz+kknjNIPGeSeM4i8UyQeJaSeCZJPMtIPFMknmkSz9kknnNIPOeSeO5B4rkniec8Es+9SDznk3guIPHcm8RzHxLPhSSei0g8F5N4LiHxXEriuS+J5zISz+UknitIPPcj8dyfxHMliecBJJ4HkniWk3geROJ5MInnISSeh5J4HkbieTiJ5xEknkeSeB5F4nk0iecxJJ6rSDxXk3iuIfFcS+J5LInncSSex5N4nkDieSKJ50kknieTeJ5C4nkqiedpJJ6nk3ieQeJ5JonnWSSeZ5N4nkPieS6J53kknueTeF5A4nkhiedFJJ4Xk3heQuJ5KYnnZSSel5N4XkHieSWJ51UknleTeF5D4nktied1JJ7Xk3jeQOJ5I4nnTSSeN5N43kLieSuJ520knreTeN5B4nknieddJJ53k3jeQ+J5L4nnfSSe95N4PkDi+SCJ50Mkng+TeD5C4vkoiedjJJ6Pk3g+QeL5JInnUySeT5N4PkPi+SyJ53Mkns+TeL5A4vkiiedLJJ4vk3i+QuL5KonnaySer5N4vkHi+SaJ51sknm+TeL5D4vkuied7JJ7vk3h+QOK5jsTzQxLPjzzy9Dk8g2YkFEpFAykraCXMQLw0FjZD4dJIzIpZ4Vi4LBALBlOxUCwaL41HzbgVCqasdDgeTGfybqsx5o+rKGazcp31iU9f+a31cyznfI3l9ylJ3S7QGPNnJDEXaoz5c5KYq2mM+QuSmKtrjPlLkpiLNMb8FUnMNTTG/DVJzDU1xvwNScy1NMb8LUnMtTXG/B1JzHU0xvw9SczFGmP+gSTmuhpj/pEk5noaY/6JJOb6GmP+mSTmBhpj/oUk5oYaY/6VJOZGGmP+jSTmxhpj/p0k5h00xvwHScw7aoz5T5KYm2iMeT1JzDtpjPkvkpibaozZIDm/3UxjzHkkMe+sMWYfSczNNcbsJ4m5hcaY80libqkx5gKSmFtpjLmQJObWGmOuRhJzG40xVyeJeReNMReRxLyrxphrkMS8m8aYa2qMGVltuMfnxUzAMRAHu4NuoDvoAXqCXpkY+oC+oB/oD0rAADAQDAKDwRAwFAwDw8EIMBKMAqPBGDAWjAPjwQQwEUwCk8EUMBVMA9PBDDATzAIJUAqSoAykQBrMBnPAXLAH2BPMA3uB+WAB2BvsAxaCRWAxWAKWgn3BMrAcrAD7gf3BSnAAOBCUg4PAweAQcCg4DBwOjgBHgqPA0eAYsAqsBmvAWnAsOA4cD04AJ4KTwMngFHAqOA2cDs4AZ4KzwNngHHAuOA+cDy4AF4KLwMXgEnApuAxcDq4AV4KrwNXgGnAtuA5cD24AN4KbwM3gFnAruA3cDu4Ad4K7wN3gHnAvuA/cDx4AD4KHwMPgEfAoeAw8Dp4AT4KnwNPgGfAseA48D14AL4KXwMvgFfAqeA28Dt4Ab4K3wNvgHfAueA+8Dz4A68CH4CPwMfgEfAo+A5+DL8CX4CvwNfgGfAu+A9+DH8CP4CfwM/gF/Ap+A7+DP8CfYD34C8jKkgd8wA/yQQEoBNVAdVAEaoCaoBaoDeqAYlAX1AP1QQPQEDQCjcEOYEfQBOwEmoJmYGfQHLQALUEr0Bq0AbuAXcFuoC1oB9qDDqAj6AQ6gy6gKzCBBQIgCEIgDCIgCmIgDnYH3UB30AP0BL1Ab9AH9AX9QH9QAgaAgWAQGAyGgKFgGBgORoCRYBQYDcaAsWAcGA8mgIlgEpgMpoCpYBqYDmaAmWAWSIBSkARlIAXSYDaYA+aCPcCeYB7YC8wHC8DeYB+wECwCi8ESsBTsC5aB5WAF2A/sD1aCA8CBoBwcBA4Gh4BDwWHgcHAEOBIcBY4Gx4BVYDVYA9aCY8Fx4HhwAjgRnAROBqeAU8Fp4HRwBjgTnAXOBueAc8F54HxwAbgQXAQuBpeAS8Fl4HJwBbgSXAWuBteAa8F14HpwA7gR3ARuBreAW8Ft4HZwB7gT3AXuBveAe8F94H7wAHgQPAQeBo+AR8Fj4HHwBHgSPAWeBs+AZ8Fz4HnwAngRvAReBq+AV8Fr4HXwBngTvAXeBu+Ad8F74H3wAVgHPgQfgY/BJ+BT8Bn4HHwBvgRfga/BN+Bb8B34HvwAfgQ/gZ/BL+BX8Bv4HfwB/gTrwV9AdgzygA/4QT4oAIWgGqgOikANUBPUArVBHVAM6oJ6oD5oABqCRqAx2AHsCJqAnUBT0AzsDJqDFqAlaAVagzZgF7Ar2A20Be1Ae9ABdASdQGfQBXQFJrBAAARBCIRBBERBDMTB7qAb6A56gJ6gl5znA31AX9AP9AclYAAYCAaBwWAIGAqGgeFgBBgJRoHRYAwYC8aB8WACmAgmgclgCpgKpoHpYAaYCWaBBCgFSVAGUiANZoM5QL41L99xl2+ky/fH5dve8t1s+Sa1fO9ZvqUs3ymWbwDL93Xl27XyXVj55qp8z1S+FSrf4ZRvXMr3I+XbjPLdQ/mmYDmQb+HJd+bkG27yfTT59ph810u+mSXfo5JvPcl3lOQbRfL9H/m2jny3Rr4JI99bkW+ZyHdC5Bsc8n0L+XaEfJdBvnkg3xOQd/XLe/DlHfPy/nZ5N7q8d1ze6X0ukHdRy3ue5R3K8n5iefevvFdX3lkr74OVd63Ke0zlHaHy/k15t6W8N1LeySjvO5R3Ccp7+uQdePJ+OXl3m7wXTd45Ju/zkndlyXuo5B1P8v4keTeRvPdH3qlzL5B3wch7VuQdJvJ+EHn3hrzXQt4ZIe9jkHcdyHsE5Bl9ef5dni2X57blmWh53lie5ZXnZOUZVNnvlGcn5blEeeZPnqeTZ9XkOTB5xkqeX5Jng+S5G3mm5V0gz2LIcw7yDIHcny/3vst95XKftdzDLPfhyn2pcp+m3Lco9/HJfW1yn5fc9yT3Acl9MXKfiNw3IfcRyHV1uc4s113lOqRcl5PrVHLdRq5jyHl9Oc8t533lPKicF5TzZHLeSM6jyHkFOc6W4045DpPjEtlP9/29y2DIfcbSxYyKLtOcSJYbpst9uXKfqty3Kfcxyn19cp+b3Pcl90HJfUFyn4zcNyL3Uch9BXKdXa47y3VYuS4p1+nkupVcx5HrGnKeX857y3lgOS8q5wnlvFlL0Aq0BnLcLcehclwmxyly73s70B50AB1BJ9AZdAFdgRwsWSAAgiAEwiACosbmXXWlv33mt9G6Pk32efySEjWdlWPaiMzvOZc1v6npOt8UddrIHNPG5Zg2Ice0PXO4zM8yrVrmN575Lcr8+jK/ssxleffODJuV66wiJV/d+cfMULTI2LTT7B8sMjZdP7zKv8Cb/E17efcvr8hfjcWer9+Rzvk/Mr12pj/P2DyNHYcX9QjLOexxOVl2/tU8Ws52uRUqZed3icmef23HsrKnu/3aeTmn2fOqYXhah61csan+dt2o60jvLINseRX+w7y25zJVy1pdphvSlFdM8zmm5SvTCh3TCso3j1G2Wy2VdM51MN8xza4n0g0or8ijo5Jfp0y/XX5ett1etRnSNXDxV+clXbXyivKwy8avjLPL3F4G1dX0jmlFyrT88k3nUyMznK/MR83L9ihwpO+QGS7O/BYq/2P/f12X+Rc65r+Jt8s4Z7kUuaQvckkvdbRNpr9mBqlDQSW/bOuIz9g8v2Jj8/bA/l+P1+eA7Zrv4qq2L/b8ZZ+3UaZ/0eIFC1OD55csSyWXLJ67YH6/RHJOynB06sqnVkznTrhaAGqgbnn4lf9362SB2DtJ+eWb/l/vzHizEl00Zpr2vO0VosDhaTjmX+BIbx901FDisn8r8wBkOpqw0sFEOhFOlJWFkon6jvwNo6LiSTlNz/ST7xSXVtVOcaE3+Yc9XtFdd4rdVnC7DpeUV5RlSfmmTnaagUqagVnSDFLSDFLSSJdr59q5YVc9cm3Y3XYiBzqmqe2M7SQNuN2wSX9jxVG6weUV7nmOaUOUabZvkcNRc32Pe3yQFmjg4m/Py97g9TA2LVd1g7dxo2p4v0Oqzs8w3A8M7PnXMDxdjzceGFRz+GTbmZcNaoNMfzIxb96ohXOXJhanBiyZn5RtqhqCmq3PJUTn5tBO49ys5jmGfY5h5+bWeTxW4JJvtv93jrPnXWxsvp9a6HB0LlLnuFzHQ7mamLwsv/Z8jC3Mx83Zrbna1vl42XRIV9fhqs7L42Yl7NYEG44yzLUc1WbEuQ4YLuVrKGnsmKTp6qfk60zn9FGXQ6GSvxqH2/JyOy4ucDhma2Lt8R6fA4q4Nd3O+NUydy6P6sq0f7o81OP5f7I8sp1ncK6bfsc0t3MEDIcKfTPD2/tQQd3kFxub111n264uJ2fb5lF93ng8a9dnu6yzrYduPoY+H6vA4TM08ytlOdFRdm7nC9R64nOkz7WLocbrdn6hmiP+7bE7pC4PZ5tvtyuFRu7ziwWO9GMzvzJsXzhy2277HdN8Lnm7tSl2Gcr6oHt9TIYjpclQOGGmLBkMbGl91D1/zDqaTEQtKx6yUiErvKX5t8j0/3c9LWcX9Picr+X1/qLbqQO3fcdch/OyPtYxKvrrKv8jXYmSd55j2gCX+Xp8eB3enofXdn3sV25s7LZyvtaWZmxvx5tk8nPbB3W2d85z187tkpElDzUf53HRxn0il/zsuGvncKudYx61c/gy7O81zwxv7/29Vpn+/9r3nF3Q4/Y34HFb5Nq+u7VL23q61tn2Fyv5Sae273beHt9bEfF4mVkNjNxtkJRDU6OiU8u5wMjethU40tqnqWU/uUGW/AqNLbeV/iz/Z28n3K6LGxrLK1dbr3rkOs5naNtbZoa3d9tu1xvytj3837577k7Xvnsto6J/470fhvu62FvjsvWw7HPeK2O30fZxisRvrzPzFyyem17eb2EK12nKRiyZN29uem5qoeHo8hz9eS7j7Tn921st+8Lo9m615mX6uVutSJp7jzRQ+m/ZI/U70jn/R/2/EiVNSZY0A5Q0A7KkyXbTg5om200PaprBSprBWdIMUdIMyZJmqJJmaJY0w5Q0w7KkGa6kGZ4lzQglzYgsaUYqaUZmSTNKSTMqS5rRSprRWdKMUdKMyZJmrJJmbJY045Q047KkGa+kGZ8lzQQlzYQsaSYqaSZmSTNJSTMpS5rJSprJWdJMUdJMyZJmqpJmapY005Q007Kkma6kmZ4lzQwlzYwsaWYqaWY60ni8xxHytl2zkm43LtmxeHtlzCpz2//wO8ap869heLpnuvHKUK4r4tKpR6ob0pRX+OQ5puWXbx6H253k6p0AvZR0bnVLOm/PRkRMj7en6e1Y78z/j/XOOS2/fPM4/mm9czsqk3RDlP5hmX5v28G/90+9qu/S/X94SmFwZvjf/JRC30y/eozZT5m/zjbGPmJO206Gl+2KmXbuN/iNivVYXbedVwz/e9rtH3f/Pe2WI27n/NVhNb3PJTa3bYvzybl8ZdrWPh3Xy+Hjc/HJc/HJ5e+2nIuNzZeN884i9Q5BnVfFcm3H1eVhz7+W0l+WKl0ye9iC2Yajc159sONs5khnt6E+Y/O6XZglL8Mx3Mwxzm+4P9TEcH7Qfip/e58ftMvJ/m1k6C8vUzk/2NCb/E11/TMcsajzdZ4HNTQ62PnZ9cDtjm2fY5q636r65en3s5wufpd52Z19ZbShMs4uz/8DRtmhNFKgAgA=",
2049
+ "debug_symbols": "7V3bbts4EP0XP/uBcyWnv7IoirRNiwBBUqTpAosi/76SU5GMRclgbLd0w5cgsufQh+eI4vBi+ufm8/XHH18/3Nx9uf++effPz83t/aerx5v7u+Hq5wbC7rXv367uxsvvj1cPj5t3KOy3m+u7z8O/Cvi03Xy5ub3evDN52s6Dkd0UjJqCVQvB5Ex+BRNoWA8GMZh4DP+Ti+HorRSvEqZw9T5FW7F0UpqiGdyL6PfbDVhXpqwMuq7MgjLQlVlQBrsyC8pQV2ZBGe7KLCgjXZkFZbQrs6CM78osKNNz4CVleg68oAz1HHhJmZ4DLynTc+AlZXoOvKQMd2UWlOk58JIyPQdeUqbxHFg4KZOFl5VBQJ2YAMuRyjSeA/9BZRrPgf+cMlzOgTlAUobWlWGAiT6DpE8Q230AnPsDihnZgLEJg5AkHeGzYEmKCqklNlDyFuKNQCBJfsHLvhGoy3gKGbnLeAoZ5aCMeWVLMhJhVCaXsayMnxIUJoihQGFHRk9Axk/BxKTrZEDRR3GUg+0/8XxjfMJv5uOzfNJrkH0+1hYfcSflow7W+QxtaIp1WSOHHZdid8wcmzoL0ToXQIy1RcseC8qFaNWpow/OstjSQyEgTM+ngIIHHjjeeIr2ZnQgmryLLZxTbKmCSDDd7kio68FAFNsG5ZyLwS4+rcFl7WgIHr3B7k2z3lD3pllvuHtz0Bufhq9eDgSDtzi9E0CP8ka6N816o8d7A8kbeqE3F4cUcYgAanIg+q2747s7DbtTHvNIHAiwZoKXc3oIaehuGRstDvQdQRropzl0ctIzgpk71t1p1x113Z2G3YHuTsPuYHenYXeou9OwO9zdadgd6e407I52dxp2x3d3GnanzxW07E6fK2jYHd/nClp2p88VtOxOnyto2Z0+V9Dw+o7n7k7D7pxgrgBxYkMUwgF33rre2vX+rXqfYDzPFPXmAIeePuBidL55G4p7ty0+qsA4WQl+xz20zB2di446pJz7PFjitmexRBl2m8K9tV1NjpvxXbb5vbqawTVdTYg8EALv3YkBmuaOwVLeGdYtAko78Mlgv6L4VipKf09FJW7/B2E8ooVy12SmifxFmsQNrcPDjo/QRLsmM01OkWdB+qZQwAOasNlUtDixdU1YLO71VHZ58Mg9nJj7oREqcPQTmMI6d/Uxz1KPM+52udzNXTB3uGDu2DT3EDdPa2Dd504XzJ0vmLtcMHdtmfsw1zH1TcGBPzBh4MzFxM6ZzKrq305Vm+61A2L89lR+yMnrqtp0J39UVW2vquCaTgpOXNemk4iVuu7IN51FHCJPlzNcoRl5vmTy5UTCxw6cPR861sUkDUSzBRAprVFAkHjXmMv6HLZnPno0H3VhWjTRoVms8xlPdMlOd5kdcTEM9VsjVOxoJU0YC2YpV5FQcLHfp2yFxofnDyh2b5J2EwiRX/8AIEwHh9CwwnRkncG1RWm4+Phwc3t78/XDix8sceOf8hE/EpeWxGcJxdpBPOsQXw8J9RCrhAxXMEaWfzhAyWLCmc2bDauV75dO1F+HSD1E6yG+HhLqIUWpA0ZIviD5DCmf87wOgXoI1kOoHsL1EKmHaD3E10NCPaTsfogP6nyKl0rfWyeNR6D5NHNMwsunIZ6ueDhv8Xje4um8xfN5i5fzFq/nLd6fsPhAs+LDeYu3sxZfPl/NYuppWdLz6zlSPgZtHYL1EKqHcD1E6iFaD/HVkPL3XtYhVg3x9e77evd9vfu+3n1f7355KyTGDXGofr+9lHfzrUN8PaR8GrWPRy7brCGX91StQsr7k9YhUA/BegjVQ7gSMlzhGAnl3sFhmktKt01pjVx5ehSrvNgTN7Aq/7rkqQq3YwuP50hr2N+JWP6Nw6rCp/VI714yHy5op3y52zcq9WwrNTaKTTzb+13e/DDMtUzNbvg/OxANngeWvCNWvpcCxP1yQbMVVn4ercsYW27rFiJDm02GlNv6OsSqIeW2vg6BegjWQ6gewvUQqYdoPaTe/VDvfqh33+rdt3r3rd59q3ff6t0vL2WbxiO6ncMZRl+B8a/AhFdgrB6zsMy2BnoaLv+9eri5+nh7Pc49ju/+uPs0TUUOl4//fZvemSYrvz3cf7r+/OPhepy2TDOWo8+EW8YdleFCYCsa5/J2LylsVcf3x1vP3NYw9dLj+yhbcqn72L3kt4TpwT2+BLpFiA/k8XOVtp6mzx1mx7dDLzBUbqjg/w==",
2055
2050
  "brillig_names": [
2056
2051
  "store_in_execution_cache_oracle_wrapper",
2057
2052
  "call_private_function_internal",
@@ -2059,165 +2054,22 @@
2059
2054
  "lte_hint",
2060
2055
  "notify_created_nullifier_oracle_wrapper",
2061
2056
  "debug_log_oracle_wrapper",
2062
- "directive_integer_quotient",
2063
2057
  "directive_invert"
2064
2058
  ],
2065
- "verification_key": "AAAAAAAEAAAAAAAAAAAAEgAAAAAAAAAQAAAAAAAAVgkBAAAAAAAAAAEAAAACAAAAAwAAAAQAAAAFAAAABgAAAAcAAAAIAAAACQAAAAoAAAALAAAADAAAAA0AAAAOAAAADwAAAAAAAAAAAAAAG+li54IzZXogRrd9oq95LUDCz4OaGSEakHYv8MB3PHEJMHx1NkgPOV10o3iSgzoQgkOQeNl4B0Zo/0WwSeRywSp5nYBAkPmr2mVgxYujMVPcPtnAhmkyY90OgKuwKavBHm+8+yetsNRYRkXqKTSksdl2cNjeWun7DXtS4nfpAdkQELpVweorEJfThITH6u0Y/2RYSd47b4LbaU+aC5YOYC8ZyKW777mO6fBbNu0uIFZA3vrldBnSGuQ+wZvPQmP3F4x5U4DPVNohr4y72vvUWtwTTDV63e+DB8v01UMgD+UliADmj9mIHF6fEj0p3ZZU4m8UArqaHMslJlBftCeVyS6gt0Bwv3UR9eYiPyeCOEzDcxL5JqmlX7XJTEun4cQZIPvgMyM3llru5WeBM5eRoOljhw0tRfJmW6xYe3jeTvoMqyl77zzvdlMQe+5l7UTg/hMH+L5tvBJFaJ38nLhrPCqv51gGyxyWirwWRgvQSeCr1gSSjc5QH7z5lMNiSeZMIuSmLVifXcWOAD4X0sKeZqqcjXq3WBuYEO2nPlPhfd8OP4PTyf+mJHwLpRXOLm9SrLCVbfb6d5ltuCSwof5icCmMMxH8kXD5LelAsEKquZDVPGo7JjOc2mtz35IIMUFZB7BfQIphKEclkBa5IErkvzdTfrGWsFwdmPpRAWqbrLsc8n7LPIAo4B9/PFSwmTZSoKiZZ6g1HLzKxBYmLrKgtxPGBSTdo6QHWFXdH+8TTq8SpiB0KoTYC1mg1QRaUywvD+AlphAYGU+Rdm0WKnSqArSydrXsl95FhIdmHBio+2kK1g5nTUefb+pMRLvaCzAUIqM4sDUt8K2f9q8TiZ05Fxmz7hM37OYMZEaDHOA0ls4ypkWhz4tfCGNY/9jEfYwFJnnwhPJ7oSVWC6jwqzoIu2mEI4Ktt7EbaGmvMSBwJ7AEVuXSTSjWon8JnCkPD5HLY15UV7bltMDAtA/ZEjtOqiZVicDmSsLQ1aMvVypGr8pIRjl+qyxgJDh6tkW16gDfCFhw1LUjn/rR9qAWUD/gH3dbynR7chtR69l1bhFoITEpnvkUHLLF65e95nLgfscAitSWQ/pSHJ6/mTCgO+XebRe3nt2YQPlHFtxxP3mgPqHLbw6Yn41Uw36xTpijccsxB5z4yQ5Zx3jAx96mrrYSxjbOZdDchcRuNt7++9OMpt0LAYOKiFcy+qXGqE+5O8UzQQvJ37ncAgxLdJL7ypf/oCtEPvfVqGrX39w3wkJZs256vOZvLpVxVAyrJqey1VkZK51YfuKmdc0GqjHgJTDyyipE2b2WbYyjs+VID1s9RDsJajsuF8IsOIL/QJKS8AI2vl1xg7s2IgwRkytrCy4uHwXasuJoH6eSoMUqvCfrlxxgvOFMbdXlZbZIivCbk2ELC4rbqx0GAHcwU4WTS+8b4R6giQAIG/EPkAQPQtjfWjQClEyA16fVwEmRd2sM0LuKTkFmvnMXpPEWzGUmXpy++ystgWxPpcr2sbNnuysgGAvTNMHSj6JY8h9ksJZs8Ty0JaLRkeH6L7AQ6P8lAjcOU4S6jQX1TwcO2REMBSVudyknx4oETdCeS43CSGdZ3oUha1YKE2S2S765o8A2BYvciQQU8EkpuTTCOpMYfa8hopkRKfwFLbxVKC7ehCENqy81JDaSttW/YsdQmrCKQxJbjAFgIL0AWQ6ONQRdlrDUo8ILekQBVmYZ4Q808lbVWxG5dU4J7vbW6oOavYspRO7cxiV2uMnxDQtcWAjd4GPgUN8iaCLy2vbpeCe6T2QsRi+LChqUiY6yonJmRrHwx8AFPhin3GkXANOrvJRbi66VS+weBoIQbrYuV8Z3+UYonta9rVIYUE/nvSiMhEbVyZjJrgrcicSNdbVxY29bvrSoBvb0WWICMBtq5OsOu+rdIDNABm8oE1dI8RljHD/gf6nXAANOPidFTvmStL+EuXuqdHEuJXg1Ud9QwATsfNH03Ys7ZKZvKsSXm2XlZWjFoxsU7Rj3bPDO7MtHmN50GuibZOglj4RHfBtiVlpVm6e7OIMuLSmftoZ40BULzFsW3IJSNT1D+nDpkjnBwcZ+JxoO6sUV06xaGZq7dJM6TvyYxZsoFO3nzSfa7QDDPBKGC8SwRi041tS6Hkdjp07NsRyh80aWgMJw5VFRU0RZL1kYj6dlEts56JKCazJhDuCCUeAF/OkXwNXcoBlHfFL2B1MythIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACDt0u+U0u3pNT3r1l32scxIyP8edh8Ps4+y2VaI2VGR0ez8ZxpW5a4/CwXueFN/2VG1x+QLESaScFnVHiR+3HNgDENyb3W2/aDeIs4ODfq2vMegX/lalrKJQkxfczZw2WL5tuC04sAZaN5cMkgqp9HQoJ1xeOyTuteFj5bmTwtI0dWKphxkrVIgQ9ecSAIhnlW6GXUa3+bDYyTT+2wtoJiS18GKk8Pa5YgJ+q7saoanj0s7xh8Z1ucGk1m79H5/kH"
2066
- },
2067
- {
2068
- "name": "update",
2069
- "is_unconstrained": true,
2070
- "custom_attributes": [
2071
- "public"
2072
- ],
2073
- "abi": {
2074
- "parameters": [
2075
- {
2076
- "name": "new_contract_class_id",
2077
- "type": {
2078
- "kind": "struct",
2079
- "path": "aztec::protocol_types::contract_class_id::ContractClassId",
2080
- "fields": [
2081
- {
2082
- "name": "inner",
2083
- "type": {
2084
- "kind": "field"
2085
- }
2086
- }
2087
- ]
2088
- },
2089
- "visibility": "private"
2090
- }
2091
- ],
2092
- "return_type": null,
2093
- "error_types": {
2094
- "206160798890201757": {
2095
- "error_kind": "string",
2096
- "string": "Storage slot 0 not allowed. Storage slots must start from 1."
2097
- },
2098
- "2920182694213909827": {
2099
- "error_kind": "string",
2100
- "string": "attempt to subtract with overflow"
2101
- },
2102
- "5019202896831570965": {
2103
- "error_kind": "string",
2104
- "string": "attempt to add with overflow"
2105
- },
2106
- "6504213605561840204": {
2107
- "error_kind": "string",
2108
- "string": "New contract class is not registered"
2109
- },
2110
- "10019982601749771606": {
2111
- "error_kind": "string",
2112
- "string": "msg.sender is not deployed"
2113
- },
2114
- "16761564377371454734": {
2115
- "error_kind": "string",
2116
- "string": "Array index out of bounds"
2117
- },
2118
- "17595253152434889169": {
2119
- "error_kind": "string",
2120
- "string": "offset too large"
2121
- },
2122
- "17843811134343075018": {
2123
- "error_kind": "string",
2124
- "string": "Stack too deep"
2125
- }
2126
- }
2127
- },
2128
- "bytecode": "JwACBAEoAAABBIBQJwAABAMnAgIEAScCAwQAHxgAAwACgE8uCIBPAAElAAAARSUAAAC+KAIAAQSAUCcCAgQAOw0AAQACKACAQwAAAywAgEQAAAAAAA6S+filNOhY/Pd32iBuCLDGIOz53rIdE0eYE/YqAIBFAAAAAAEAAAAAKACARgABACgAgEcEAAMoAIBIAQAAKACASQQAACgAgEoAAAAoAIBLAQABKACATAQAASgAgE0AAAEoAIBOBAAEJiUAAAncLQgBAwAAAQIBLgqASAADLQgBAwAAAQIBLgqASgADLQgBAwAAAQIBJwIEAAItDgQDHgIAAwEeAgAFADM4AAMABQAGJAIABgAAARIlAAAKBTMoAAGAQwAFJAIABQAAASclAAAKFy0IAQUnAgYEAwAQAQYBJwMFBAEAKAUCBi0MBgcuCoBNAAcAKAcCBy0OAwcrAgAGAAAAAAAAAAACAAAAAAAAAAAnAgsEDC0IAAwtDAYNABAACwAlAAAKKS0EAAAtDA0HLQwOCC0MDwktDBAKLQ0HBgAoBgIGLQ4GBy0IAQYAAAECAS0OBwYtDQgHACgHAgctDgcILQgBBwAAAQIBLQ4IBy0IAQgAAAECAS0OCQgtCAEJAAABAgEtDgoJJwIKBAIuCIBJAAIjAAAB8Aw4AgoLJAIACwAACWkjAAACAicCCwQMLQgADC0MBg0tDAcOLQwIDy0MCRAAEAALACUAAArJLQQAAC0MDQULKAAFgEoABgsoAAaASAAHJAIABwAAAkolAAALPS0IAQYnAgcEBAAQAQcBJwMGBAEAKAYCBy0MBwguCoBKAAgAKAgCCC4KgEoACAAoCAIILgqASgAILQgBBwAAAQIBLQ4GBy4IgEkAAiMAAAKaDSgAAoBHAAYkAgAGAAAJAyMAAAKvLQ0HBi0NBgcAKAcCBy0OBwYBKAAGgEwACC0NCAcAOAYKCS0NCQgBKAAGgEcACy0NCwktCAEGJwILBAQAEAELAScDBgQBACgGAgstDAsMLQ4HDAAoDAIMLQ4IDAAoDAIMLQ4JDC0NBggAKAgCCC0OCAYnAgkECy0IAAstDAYMLgiATAANABAACQAlAAALTy0EAAAtDAwIJwILBAwtCAAMLQwGDS0MCg4AEAALACUAAAtPLQQAAC0MDQkBKAAIgEwACi0NCgYBKAAJgEwACi0NCggcDAcKBBwMCgkAHAwJBwQtCAEJAAABAgEtDgYJLQgBCgAAAQIBLQ4ICi0IAQsAAAECAS0OBwsvDAAFAAwcDAwOBBwMDg0AAjgMDQ4JKAAOgEUADBwMDA4EHAwODQAcDA0OBAI4DA0PCSgAD4BFAAwcDAwQARwMEA8AHAwPEAECOAwPEQkoABGARgAMHAwMEgQcDBIRABwMERIEAjgMERMJKAATgEUADBwMDBMBHAwTEQAcDBETAQI4DBEUCSgAFIBGAAwcDAwVBBwMFRQAHAwUDAQWDBMUHAwREwQcDBQVBAQ4EwwUFgwQDBwMDxAEHAwMEwQEOBASDB4CABAFHAwQFgQcDBYSABwMEhAEDDgQDhIoAgAOBA4QJAIAEgAABMIjAAAEpRwMDxIEBDgSDBUEOBMOEgA4FRIOLQwOAiMAAATfHAwREgQEOBIUEwQ4FQ4SADgTEg4tDA4CIwAABN8AOBACEg44EBITJAIAEwAABPYlAAAL0Qw4EAcCFgwCBxwMAhAAHAwHAgAEOBAGBwQ4AggGADgHBgItDgIJLQ4BCi0OEgscDBIGACcCBwAgJwIKBBUtCAAVLQwEFi0MBxcAEAAKACUAAAvjLQQAAC0MFggEOA0IBwA4BgcIHAwPBgAnAgcAQCcCDQQVLQgAFS0MBBYtDAcXABAADQAlAAAL4y0EAAAtDBYKBDgGCgcAOAgHBhwMDAcAJwIIAEgnAgwEFS0IABUtDAQWLQwIFwAQAAwAJQAAC+MtBAAALQwWCgQ4BwoIADgGCAccDBEGACcCCABoJwIMBBUtCAAVLQwEFi0MCBcAEAAMACUAAAvjLQQAAC0MFgoEOAYKCAA4BwgGHAwUBwAnAggAcCcCDAQPLQgADy0MBBAtDAgRABAADAAlAAAL4y0EAAAtDBAKBDgHCgQAOAYEBy0IAQQnAgYEBAAQAQYBJwMEBAEAKAQCBi0MBggtDgcIACgIAggtDgIIACgIAggtDgEILQ0EBgAoBgIGLQ4GBCsCAAYAAAAAAAAAAAMAAAAAAAAAACcCDwQQLQgAEC0MBhEAEAAPACUAAAopLQQAAC0MEQgtDBIKLQwTDC0MFA0tDQgGACgGAgYtDgYILQgBBgAAAQIBLQ4IBi0NCggAKAgCCC0OCAotCAEIAAABAgEtDgoILQgBCgAAAQIBLQ4MCi0IAQwAAAECAS0ODQwuCIBJAA4jAAAHDw0oAA6ARwANJAIADQAACJAjAAAHJCcCDwQQLQgAEC0MBhEtDAgSLQwKEy0MDBQAEAAPACUAAArJLQQAAC0MEQ4tDQQGACgGAgYtDgYELQgBBCcCBgQFABABBgEnAwQEAQAoBAIGLQwGCC0OBwgAKAgCCC0OAggAKAgCCC0OAQgAKAgCCC0ODgguCIBJAA0jAAAHog0oAA2ATgACJAIAAgAACEojAAAHty0NCQItDQsEHAwEBQAnAgYEBScCCAQDADgGCActCAEEABABBwEnAwQEAQAoBAIHLQ4GBwAoBwIHLQ4GBycCBwQDADgEBwYtDAYHLgqARAAHACgHAgctDgMHACgHAgctDgIHACgHAgctDgEHACgHAgctDgUHJwIBBAUAKAQCBS0NBQMnAgYEAgA4BQYCNw0AAgADJhwMDQIAADgFAgYnAgcEBAw4DQcIJAIACAAACGslAAAM6AAoBAIHADgHDQgtDQgCMAwAAgAGASgADYBMAAItDAINIwAAB6IkAgANAAAInSMAAAjyJwIPBAMMOA4PECQCABAAAAi0JQAADOgAKAQCDwA4Dw4QLQ0QDScCDwQQLQgAEC0MBhEtDAgSLQwKEy0MDBQtDA0VABAADwAlAAAM+i0EAAAjAAAI8gEoAA6ATAANLQwNDiMAAAcPLQ0HBhwMAggAADgFCAkvDAAJAAgnAgsEAww4AgsMJAIADAAACS4lAAAM6C4EAAaAAygAgAQEAAQlAAAOJS4IgAUACQAoCQILADgLAgwtDggMLQ4JBwEoAAKATAAGLQwGAiMAAAKaJAIACwAACXYjAAAJyycCDAQCDDgCDA0kAgANAAAJjSUAAAzoACgFAgwAOAwCDS0NDQsnAgwEDS0IAA0tDAYOLQwHDy0MCBAtDAkRLQwLEgAQAAwAJQAADPotBAAAIwAACcsBKAACgEwACy0MCwIjAAAB8CgAgAQEeAANAAAAgASAAyQAgAMAAAoEKgEAAQX3ofOvpa3UyjwBAQImKgEAAQWLDiEWkOO1VjwBAQImKgEAAQVaQ5vQPsayTDwBAQImJQAACdwtCAECJwIDBAQAEAEDAScDAgQBACgCAgMtDAMELgqASgAEACgEAgQuCoBKAAQAKAQCBC4KgEoABC0NAgMAKAMCAy0OAwItCAEDJwIEBAUAEAEEAScDAwQBACgDAgQtDAQFLgqASgAFACgFAgUuCoBKAAUAKAUCBS4KgEoABQAoBQIFLQ4BBS4IgEgABC0MAgEtDAMCLgiASQADJiUAAAncLQ0EBQsoAAWASAAGJAIABgAACusnAgcEADwJAQcnAgUEBi0IAAYtDAEHLQwCCC0MAwktDAQKABAABQAlAAAOsy0EAAAtDQEFLQ0CBi0NAwctDgUBLQ4GAi0OBwMuCoBLAAQBKAAGgEwAAi0NAgEmKgEAAQUC3G4ngHYSnTwBAQImJQAACdwBKAACgEwAAw44AgMEJAIABAAAC24lAAAL0Q0wgEcAAwAECygABIBIAAMkAgADAAALiyUAABAGJwIEBAMMOAIEBSQCAAUAAAuiJQAADOgAKAECBAA4BAIFLQ0FAy0IAQEnAgIEAgAQAQIBJwMBBAEAKAECAi0MAgQtDgMEJioBAAEFRafKcRlB5BU8AQECJiUAAAncLQgBBAAAAQIBLgqATQAEJwIGBAInAgcBAS0IAQUnAggEIQAQAQgBJwMFBAEAKAUCCCcCCQQgQwPwAAIABgAJAAcACCcCCgQgLgQACIADLgQACoAEJQAAEBgnAgIEICcCBgQhLgiATAADIwAADFYMOAMGByQCAAcAAAxtIwAADGgtDQQBJi0NBAcEOAcHCAI4AgMHDjgDAgkkAgAJAAAMjSUAABCYJwIKBCAMOAcKCyQCAAsAAAykJQAADOgAKAUCCgA4CgcLLQ0LCRwMCQcABDgIAQkEOAcJCgMwgE0ABwAJBDgJCAcAOAoHCC0OCAQBKAADgEwABy0MBwMjAAAMVioBAAEF6J0J/qERLQ48AQECJiUAAAncLQ0DBi0NBAcLKAAHgEgACCQCAAgAAA0gJwIJBAA8CQEJCygABoBHAAckAgAHAAANsSMAAA01LQ0BBi0NAgctDQMILQ0ECScCCwQDDDgICwwkAgAMAAANXCUAAAzoLgQABoADKACABAQABCUAAA4lLgiABQAKACgKAgsAOAsIDC0OBQwBKAAIgEwABQ44CAUGJAIABgAADZwlAAAL0S0OCgEtDgcCLQ4FAy0OCQQjAAAOJCcCBgQHLQgABy0MAQgtDAIJLQwDCi0MBAsAEAAGACUAAA6zLQQAAC0NAQYtDQIHLQ0ECC4EAAaAAygAgAQEAAQlAAAOJS4IgAUACQAoCQIKASgACoBJAAstDgULLQ4JAS0OBwIuCoBMAAMtDggEIwAADiQmLgGAA4AGCwCABgACgAckAIAHAAAOQCMAAA5LLgCAA4AFIwAADrIuAAABgAUBAAABgAQAAQEAgAOABIAJLgCAA4AKLgCABYALCwCACoAJgAwkAIAMAAAOni4BgAqACC4CgAiACwEAgAoAAoAKAQCACwACgAsjAAAObSgBgAUEAAEDAIAGAAKABiMAAA6yJiUAAAncLgiASQAFIwAADsMNKAAFgEcABiQCAAYAAA8uIwAADtgtDQEFLQ0CBi0NAwctDQQILQgBCScCCgQFABABCgEnAwkEAQAoBgIKJwILBAQAKAkCDD8PAAoADC0NCQYAKAYCBi0OBgktDgUBLQ4JAi0OBwMtDggEJi0NAwYMOAUGBwEoAAWATAAGJAIABwAAD0wjAAAP/S0NAQctDQIILQ0DCS0NBAonAgwEBAw4BQwNJAIADQAAD3MlAAAM6AAoCAIMADgMBQ0tDQ0LJwINBAMMOAUNDiQCAA4AAA+YJQAADOgAKAcCDQA4DQUOLQ0ODAA4CwwNJwIMBAQMOAUMDiQCAA4AAA/CJQAADOguBAAIgAMoAIAEBAAFJQAADiUuCIAFAAsAKAsCDAA4DAUOLQ4NDi0OBwEtDgsCLQ4JAy0OCgQjAAAP/S0MBgUjAAAOwyoBAAEF9C7lhLv0IdE8AQECJigAgAYEAAIHAIAEgAaABS4AgASACCgAgAkEAAANAIAJgAWAChcAgAqACiQAgAoAABCXAwCACAACgAgBAIADgAmACy4BgAuABgEAgAOACIALLgGAC4AHAQCAA4AJgAsuAoAHgAsBAIADgAiACy4CgAaACwEAgAkAAoAJIwAAEDQmKgEAAQUohpKwR9z9QzwBAQIm",
2129
- "debug_symbols": "7V3djtyoEn6Xuc4FBVX87KusjqIkm12NFCWrJHukoyjvftw9Y+wZyma7gmcwcBN1Z/i66vvAUBQ//nH3x8f3//z19v7zn1++3f32+4+7T18+vPt+/+Xz9O3Hzzd377/ef/p0/9fb9X/fqcs/EOgK+Pb3u8+X79++v/v6/e4357x7c/fx8x93v3kAN/3En/efPt79BhB+/ufNhAoClFYoQYESoWS2RLw0iVAiW0bEy4hsoeFQhKQeUYTWRxThzzdJYfQGHwujRx0LW66wJ6dnf8i7deGrO551Z3JidoeszbhjLczuWKdy7iiK7mh47g7x6pCC6I6mfXeA3FwBYI3ZdydQmH85WIPP3bGQdceGtTtXUBCAHNsEyZKZQda5lyPudc4dh+o5h6AkIPY5J48R5EOOuLJzYQBYiINVXGk/N20Iy4Nm4NGdUJM7hu/dX8+dutSButSButTRpi536lLH1NV2jH9pd2h2Ryv9xJ20rAs4D9ouhOWX9WVISkqb+Muol+5ecz88xYZzJKM16HXhiygUhiiJKBaHKKko4/FJRXF6iJKK4oYoiSh+tBRGFDtESUTZmON1LsoYkhlRxpCciIJqdLSMKKOjTUUBGKKkotAQJRVlzJJTUfQYkhlRxpCcimLGkMyIMmbJqSg4hmRGlDEkp6LQmCUzoowhmRFlDMmpKNYMUVJRxpCciuLGkMyIMvIpqSihT1G0WURBeiYKvfwGmipEcRBmL9xqo9wsSp/5lH1RdJ9DckaUPofkfVFMn0NyRpQ+Z8kZUUZHm4qCY0hmRBktJRWFxpDMiFJgSAbvZ1HWMTMvymRxLm39atoBWnO/HWiWBYJblXZwdd/Sqd135tTuezi3+9kpbiC9775eHNJWqScm0tJo47OIFjFT2k2ezF2CVYs07Pkkp+OpoekjrgtfqOa3obVDlXqhOrnWD9V+ahX6qdV8Pq0ZqrqfWtX9PKv55E07VLuJlizqfqj2U6vUz7Nqm6pVryJV//wGDOtdQ1SNjUkg4xKqofYG7BaqOnOviVmOdxutlySBMfqBa+0xRDmurvppXEmu2BBXHeaeyVyzuiuuXO7Yxdyx8suFNoa40j567Ve3zfBlpxnjnBQz9knZi+JQezDTnuK1j77NKa5bGhnPoXhL4/MpFDdmKP7Citc+tThQ8XhF4SS+SpTBjvvbjDIdj/37ylSffnk9ZUab2VDGjjazpUzH8VdGmTCU4ZVxHedeMsr4oQyvjO941pFRpqbZwcWhqpYHrg7VFNdMDvlXSLTHmSs65TOlwZr56nmwtJrnwqP7dG73w6ndB3Nu98+tfv5+orrdP7f65txt/xUSebe5H1+BMhXwifuvsB2pqPv21O5T7UFDxv3aO86M+7V3nPvu23Orb/2p3XeVd5yOQnTf4xP3mdIA8TQTrN4LpC+vv/qRToxtnBfTk7IXYXzlfdrrCVP58+rinS3gV+mO44UJtT9KryZM5dGNNyoKg/Z5FxkUnNv9c6sPx6p/NUGHmzj4aNPVBB5vwh9u4uBp9NWEO9wEHt9oD54yXkyUmNZZA9EEmUxfQKSXd4QSZErfeG7Ax9MgqPV+YQDj7Gr0C+viV2XsiysTT3iQ1bklHw2RrIaQ9qkl9gy8pvuVqz/5P/+2Jkrcd5Wrr8FF921I3Q91u2/iS3H1NbR95n6J6ctrun9u9UPt6muK7qdZ8hBqV1/HqzmNM8/dB6Vc3f6jmhcpNALjf4mDOq/q/8n117Xrr+PQheQZ/2vXP8a/Gh2k/huq3P8QIx9SjP6oTu7/yfWnyvUnHfuf9fxv8b9y/UnH3yZLqf/WVO5/MEtCABn//bn9dyfX31Wuv11mvhaZ/sdXrr9dpr7WMv1PqHzqviz2TjN3x/hfeeYk4z+oc+sPqnL9M/0PQOXxQ05/qDx+yPmvT66/rj1+3p//gq48/5OJ/8Hgyf0/uf5YQn8fU5QOcmvxVsXSVoUn61hpYe/N7L739HzRa/I+FPY+PPH+aoPwBWy8AI8SuxodLtfSu1xLnRbK5paqlVr1XcpdPZoSSr/uUVienUAp62n++wI2XoBHiaPDORuuwFgebGwhYTXe8i3EI84txON6ceOyvs20JxWXwAPCk9IP/tPJ/a982/RrbfAEXf0Oz9dTZrSZDWXCaDNbyow2wytjFFY0gjx45GvzqMSKd2GPfj2HZVS8xHcKTyk3h6H401NSNtf6Q9wUGMJqvha49mm8iTex+nSrE5gClyZWwzXo+ZfNFJoyXBuq1xxX01G9FtgzcB6uoR+uaDri6vvhSh3Va4Fczmm42obGHB+znxNXYri2GSMGY1OurqVYgpY27Jl6dS3FiD5ErsxapfEt1WuOa0f1WuA9n+fhih1xbSlG3OeKqqUYMce1o3otkO07D9eWxhya9w2hUmnsjy3lEZd4eOKqGa7t1Cuq5bJUZVXKtaE84kQQI1fH1KtpqV4zXLGjesV28sN5ru3kh7NcG8oj5rm2EyNmudqO6tW2kx/Ocm0ojzjFTX7hahmuTeaHJ67MPKehPCKqeIXgNFUlhmtDMSLoGPtPie+Ua2ioXrNc+6lXUu3kh/NcsSOuDcWIOa7QUIyY5dpRvep28sN5ri3lm+K5apwSpCnXlvYjruLhKWnIcG0plohn7lCrND9MLeURtYqxvwamDWND9ZrjSh3VKzWUH85ybSg/nOPaUh4xy7WhGDHH1XVUr66h/HCOa0t5RIhnDieuTOzf0n7EVTys0xcwTUo0VK/o4j4Y9IHh2lAskeFqW8ojZrl2VK/QUb1CT/XaUOyf46obihGzXBuK/XNcTUP54SzXhmL/HNfT5hEfvD/rKHL1ns463j94j1V7D8rEl1IqspnnxAWcPXEhLGsL+rLvJvWblonX6qYajqKGuLFFryff+uHmQ+vqbsEnUdHX/SSdRcXxRJdQse6o8CQqhrrnEWdRcbTFX1fRqbrnPmdRse7M+0lUrDxHeBYVcahYQMUxuhRQsfKdl2dRse6c3UlUrHy36FlUHDmdAiriiHRKqIhDxQIqjkingIqV3xtwFhVHpFNAxcrvTD2LiiOnU0BFNyKdEiriULGAinXvVTuJin5EOiVUHJFOARXDyC/+uopejbb4b1TUZlERKVGx8h2ztajoYHk9qzGJimaMLiVUHE90ARUr3z98FhXHikEJFcfcpYCKI0tbRMUR6RRQsfKbJM6i4oh0CqhY1S26Dx7VFDVcParqHMaDR/jSHlkN0SPMvhNZxTdqe+WXRmdZRwzNl4JNH8OTB+WBrO+I7MufEHhNsh3VbFAd1WxQPdXsy7+F6jXJ2o7Ivvx7qF6TLHVE1qieyGJPZENHZKn2mo2XuXlFfp+sc8sc2KFdF75yPXhi+GAjHG+D30ZhjZ6r2prVPdCsDe9nWQPAvqpTlB2zBdPn1Vv5dJgd8iUdWmUk5poL5mgDxzLQSpmjDbiDDfBBakkDRzPQRzPgb9AvaIA/iFTSAB1sgD++UtLA4QzCwQboaAb26DqweLSBo+vAHd1du6MHHH90Z+eP7q5Dgc7OqWggEykH5+eoK3iwqTe2Im9A1aQNKKrJG1BVeVOVNrr2TOMt0z1v55deOu98ytW1xJXMHlfTVL16FbmuLueMXJuq132u2FG9Uu0Z1ZJca0+VF+RqO6pX21O91p4nv4mrCZFrUPuFATBGWXB5b2IijWuqGWxKc+GqK38VRS3b6CaOj2W1AVwXvqo4LrArouJoiwVUrPxlFWdRcWx1L6DiONRXRMXRFguoiOPI+L867Bx0VFFRquI4dlFAxcpfiHwWFUe8WELFccC0gIrjUF8RFcfoUkDFqg71nVfFcQ1gARUrfw33SVQMI7/46yqaAtddaXLzrgVtVU4XtPH0NVrETGlH8d2Ezq7c5/P6elnemR6ydeErV4CGuCLMyyMONcPVNsTVBLvHVbdUr8abhaveLwxgXDzIAKhCKk1Lj7eJvbUzLm0GBXYMnYdrR/Va4M6s03AtsGPoPFybGqL2uRZIhZyHq++Ha4G7yM/DNfTD1XdUr76j5zX0EyNi/mSED26fKyhr4vwClrQEXM5Mp6VjWkKrRcTruvOPl0t47C95Y35G1KMqZrQVRpX8m+m6VIWGKqkqNNoKp8poK5wqoUtV9pci0OJQhVHFD1VSVVyf8UpOFTtUSVXxfY7MOVVGb8upMnpbRpX8DcxdqjLaSqoKqT7zK/uqWMWPzHo2QNolmI0DlPsYuh2jBXa0wI4R2Nm4pnUXgwI7KOCzcWBhHyNoB5aPde2814kspBh7O2Zji+w+htctvmLRJm9YnDDhdsxGtLKPEdgJAjvhdjtu4+b7fYzADtzOx230B/uY29uB469+zGDs7Rj+Wdh/C4zeeFc32GVosh5SlJegvJWg+Nvksii2psAtG8mmIs9RXikRCkUoL0Hxl7lmUVaC0iI1tEh5I7JlRMobkfIoUh5FypNIDRKpQSI1+Czm5Y0YMyroFMXnszKosPFUBgMRtbo5xWB4hHkRDIwIxu/OzcNsFra65yXCNhp+DrbRhnMwUjIY2xNo5SHOZIJNYfy1U3mYzBp/YWwe5kUwL7PmZdb4bSBauTiJU46pN/7G1AzMKP5q0zxMZg1k1kBmTSsRDNl681Nq4BE2fVxg4B9QpEUoJ0HxOzZ9iFM1H1bvPQfuUM80GMzZBu1XoVg04Q834Y5n4dzhJvibn8uaOJ5FOJ5FOJwFqMNZbFwwXNQE322VNWEPN2GOrwva6KPiBc7TR52g+IXIoOKZtfDkuOUjij8Xm7PlN1qLj937OtM7o/jTo5OHGD1c5XwjigQorZQI5SUoPkifUHpBQYryEpQW2eLTPlmUlaBQZAtFtkhlUSatL9poUSZeeq4wab3aquzztd5rPKM2bKFfnsrUQ7dRy+h2nmXtvKAH0N6IUE6A2jgaCSqmBadlqCUsfJhyG8O33iyKT/2AWda5CBIUGgmKX5bIoqwExbdDALtcJutTNfh+HlDN/fz0MbXF9/NZVJCg+AXvLIpvUaSjhkTqOQr5gCqLEtniI6scaiPdmUNZCYq/HTGL8hIUoggVJCgS2dpIQVKcXQMFnaCslaD45b8sKkhQHkUokRpBi1ASDYm/ORrMksadBpAExS/0Z1EoQnkJij9KlEVZCcqI1DAi5VFkC0XKo0h5Eim/MZqbGLOBsUlvQ1aLUEGCcihBeSVCkQS1EQPkUE4QOVgFIpQkIrIgseX4ft4tF+nj8yV0s7FoPK21zGE5UYpBAcbfjuGXizMYK4j9txaLcyiSoIzIlhHZQpEtFNkikS0S1ZcV2bIiXht9ZwbFz8izKMl813sQoeztvcVWRi6muzSDoZuf4gD2ZjtBKwEGBRh/O8bc3pMF/vqgfQwK7JASYAR1agV2rMQO+7wGmtv1Oj89Y/hIJ4MR2NnIgu1i+LlRBnOznSm00AKMzdQPg+Fjm706xY2F732MFtjR4XaMwdsxqAQYdzuGtADjb8fwC/EZjMCOE/BxgrbjBfXjb2wHP6dv/3339f7d+08fv02Iyx//+fzh+/2Xz49fv//v7/kv77/ef/p0/9fbv79++fDxj3++fnz76cuHy9/u1OM/vzvl3jjtJ18uDX8K7N94uH67/HHKlbwhBZevl7+6MJUNYfJh8uP/",
2130
- "brillig_names": [
2131
- "update"
2132
- ]
2133
- },
2134
- {
2135
- "name": "public_dispatch",
2136
- "is_unconstrained": true,
2137
- "custom_attributes": [
2138
- "public"
2139
- ],
2140
- "abi": {
2141
- "parameters": [
2142
- {
2143
- "name": "selector",
2144
- "type": {
2145
- "kind": "field"
2146
- },
2147
- "visibility": "private"
2148
- }
2149
- ],
2150
- "return_type": null,
2151
- "error_types": {
2152
- "206160798890201757": {
2153
- "error_kind": "string",
2154
- "string": "Storage slot 0 not allowed. Storage slots must start from 1."
2155
- },
2156
- "2830029349304997821": {
2157
- "error_kind": "fmtstring",
2158
- "length": 27,
2159
- "item_types": [
2160
- {
2161
- "kind": "field"
2162
- }
2163
- ]
2164
- },
2165
- "2920182694213909827": {
2166
- "error_kind": "string",
2167
- "string": "attempt to subtract with overflow"
2168
- },
2169
- "5019202896831570965": {
2170
- "error_kind": "string",
2171
- "string": "attempt to add with overflow"
2172
- },
2173
- "6504213605561840204": {
2174
- "error_kind": "string",
2175
- "string": "New contract class is not registered"
2176
- },
2177
- "10019982601749771606": {
2178
- "error_kind": "string",
2179
- "string": "msg.sender is not deployed"
2180
- },
2181
- "11343565365413149907": {
2182
- "error_kind": "string",
2183
- "string": "Function get_update_delay can only be called statically"
2184
- },
2185
- "15573886522241766899": {
2186
- "error_kind": "string",
2187
- "string": "New update delay is too low"
2188
- },
2189
- "16761564377371454734": {
2190
- "error_kind": "string",
2191
- "string": "Array index out of bounds"
2192
- },
2193
- "17595253152434889169": {
2194
- "error_kind": "string",
2195
- "string": "offset too large"
2196
- },
2197
- "17843811134343075018": {
2198
- "error_kind": "string",
2199
- "string": "Stack too deep"
2200
- }
2201
- }
2202
- },
2203
- "bytecode": "JwACBAEoAAABBIBSJwAABAMnAgIEAScCAwQAHxgAAwACgFEuCIBRAAElAAAARSUAAADMKAIAAQSAUicCAgQAOw0AAQACKACAQwAAAywAgEQAAAAAAA6S+filNOhY/Pd32iBuCLDGIOz53rIdE0eYE/YoAIBFBAAZKgCARgAAAAABAAAAACgAgEcAAQAoAIBIBAADKACASQEAACgAgEoEAAAoAIBLAAAAKACATAEAASgAgE0EAAEoAIBOAAABKACATwQAAigAgFAEAAQmJQAACvgpAgACAPqRAssKOAECAycCBAQAJwIGBAMAOAQGBS0IAQIAEAEFAScDAgQBACgCAgUtDgQFACgFAgUtDgQFJwIFBAMAOAIFBCcCBAArJAIAAwAAASojAAAEcC0IAQMnAgUEAgAQAQUBJwMDBAEAKAMCBR8kgE2ATQAFLQ0DBQAoBQIFLQ4FAy0IAQUAAAECAS0OAwUtCAEDAAABAgEuCoBKAAMnAgcECC0IAAgtDAUJLQwDCgAQAAcAJQAACyEtBAAALQwJBgEoAAaATQAFLQ0FAy0IAQUAAAECAS4KgEkABS0IAQYAAAECAS4KgEsABi0IAQcAAAECAScCCABdLQ4IBx4CAAgBHgIACQAzOAAIAAkACiQCAAoAAAHxJQAAC5ozKAADgEMACSQCAAkAAAIGJQAAC6wnAg0EDi0IAA4tDAUPLQwGEC0MBxEuCIBOABItDAQTLQwIFAAQAA0AJQAAC74tBAAALQwPCS0MEAotDBELLQwSDCcCDQQOLQgADi0MCQ8tDAoQLQwLES0MDBIAEAANACUAAA1aLQQAAC0MDwUtDBAGLQwRBy0IAQ0AAAECAS0OBQ0tCAEFAAABAgEtDgYFLQgBBgAAAQIBLQ4HBicCEgQTLQgAEy0MCRQtDAoVLQwLFi0MDBcAEAASACUAAA8cLQQAAC0MFActDBUOLQwWDy0MFxAtDBgRHgIAEgUcDBIUBBwMFBMAHAwTEgQnAhQEFS0IABUtDAcWLQwOFy0MDxgtDBAZLQwRGi0MEhsAEAAUACUAAA/mLQQAAC0MFhMAOBITFA44EhQVJAIAFQAAAzolAAAQVS0NDRMtDQUVLQ0GFgw4EhYXFgwXEhwMFxYAHAwSFwAEOBYTEgQ4FxUTADgSExUtDhUNLQ4DBS0OFAYnAgUEFi0IABYtDAkXLQwKGC0MCxktDAwaLQwVGy0MAxwtDBQdLQwHHi0MDh8tDA8gLQwQIS0MESIAEAAFACUAABBnLQQAABwMFAUAJwIHBAUnAgoEAwA4BwoJLQgBBgAQAQkBJwMGBAEAKAYCCS0OBwkAKAkCCS0OBwknAgkEAwA4BgkHLQwHCS4KgEQACQAoCQIJLQ4ICQAoCQIJLQ4VCQAoCQIJLQ4DCQAoCQIJLQ4FCScCAwQFACgGAggtDQgHJwIJBAIAOAgJBTcNAAUABy0NAgMAKAMCAy0OAwIAKAICBi0NBgUnAgcEAgA4BgcDOw0AAwAFIwAABHApAgADAA5BbLQKOAEDBSQCAAUAAASLIwAAB5otCAEFJwIGBAIAEAEGAScDBQQBACgFAgYfJIBNgE0ABi0NBQYAKAYCBi0OBgUtCAEGAAABAgEtDgUGLQgBBQAAAQIBLgqASgAFJwIIBAktCAAJLQwGCi0MBQsAEAAIACUAAAshLQQAAC0MCgcBKAAHgE0ABi0NBgUcDAUHBBwMBwYAHAwGBQQtCAEGAAABAgEuCoBJAAYtCAEHAAABAgEuCoBLAActCAEIAAABAgEnAgkAMS0OCQgeAgAJAR4CAAoAMzgACQAKAAskAgALAAAFYSUAAAuaDSgABYBFAAoLKAAKgEkACyQCAAsAAAV+JQAAE7YnAg4EDy0IAA8tDAYQLQwHES0MCBIuCIBOABMtDAQULQwJFQAQAA4AJQAAC74tBAAALQwQCi0MEQstDBIMLQwTDScCDwQQLQgAEC0MChEtDAsSLQwMEy0MDRQAEAAPACUAAA8cLQQAAC0MEQYtDBIHLQwTCC0MFAktDBUOLQgBDwAAAQIBLQ4GDy0IARAAAAECAS0OBxAtCAERAAABAgEtDggRLQgBEgAAAQIBLQ4JEi0IARMAAAECAS0ODhMeAgAUBRwMFBYEHAwWFQAcDBUUBCcCFgQXLQgAFy0MBhgtDAcZLQwIGi0MCRstDA4cLQwUHQAQABYAJQAAD+YtBAAALQwYFQw4FQUGJAIABgAABrQjAAAGlAI4FQUGDjgFFQckAgAHAAAGqyUAABPILQwGAyMAAAa/LgiASgADIwAABr8AOBQDBg44FAYHJAIABwAABtYlAAAQVS4KgEwADy0OFRAuCoBMABEtDgUSLQ4GEycCBwQULQgAFC0MChUtDAsWLQwMFy0MDRgAEAAHACUAAA1aLQQAAC0MFQMtDBYFLQwXBi0NDwctDRAILQ0RCS0NEg4tDRMPJwIQBBEtCAARLQwKEi0MCxMtDAwULQwNFS0MAxYtDAUXLQwGGC0MBxktDAgaLQwJGy0MDhwtDA8dABAAEAAlAAAQZy0EAAAAKAICBi0NBgUnAgcEAgA4BgcDOw0AAwAFIwAAB5opAgACAAVVe/oKOAECAyQCAAMAAAe1IwAACSstCAECAAABAgEuCoBJAAItCAEDAAABAgEuCoBLAAMtCAEFAAABAgEnAgYADi0OBgUeAgAGCQsoAAaATgAHJAIABwAAB/8lAAAT2h4CAAYBJwILBAwtCAAMLQwCDS0MAw4tDAUPLgiATgAQLQwEES0MBhIAEAALACUAAAu+LQQAAC0MDQctDA4ILQwPCS0MEAoeAgACBRwMAgQEHAwEAwAcDAMCBCcCDAQNLQgADS0MBw4tDAgPLQwJEC0MChEAEAAMACUAAA8cLQQAAC0MDgMtDA8ELQwQBS0MEQYtDBILJwIIBAwtCAAMLQwDDS0MBA4tDAUPLQwGEC0MCxEtDAISABAACAAlAAAP5i0EAAAtDA0HHAwHAgAnAgQEAScCBgQDADgEBgUtCAEDABABBQEnAwMEAQAoAwIFLQ4EBQAoBQIFLQ4EBScCBQQDADgDBQQtDAQFLQ4CBQAoAwIFLQ0FBCcCBgQCADgFBgI7DQACAAQjAAAJKycCAgJ7JwIDAmMnAgQCcycCBQJvJwIGAlUnAgcCfScCCAJ3JwIJAm4nAgoCdCcCCwJlJwIMAnInAg0CbCcCDgIgJwIPAmstCAEQJwIRBBwAEAERAScDEAQBACgQAhEtDBESLQ4GEgAoEgISLQ4JEgAoEgISLQ4PEgAoEgISLQ4JEgAoEgISLQ4FEgAoEgISLQ4IEgAoEgISLQ4JEgAoEgISLQ4OEgAoEgISLQ4EEgAoEgISLQ4LEgAoEgISLQ4NEgAoEgISLQ4LEgAoEgISLQ4DEgAoEgISLQ4KEgAoEgISLQ4FEgAoEgISLQ4MEgAoEgISLQ4OEgAoEgISLQ4CEgAoEgISLQ4EEgAoEgISLQ4LEgAoEgISLQ4NEgAoEgISLQ4LEgAoEgISLQ4DEgAoEgISLQ4KEgAoEgISLQ4FEgAoEgISLQ4MEgAoEgISLQ4HEgsggEmATAACJAIAAgAACvcnAgMEHi0IAQQnAgUEHgAQAQUBLQwEBSoDAAUFJ0ZIsvVBF70AKAUCBQAoEAIGJwIHBBsuBAAGgAMuBAAFgAQuBAAHgAUlAAAT7CcCBgQbADgFBgUuCoBNAAUAKAUCBS0OAQUAKAUCBTwNBAMmKACABAR4AA0AAACABIADJACAAwAACyAqAQABBfeh86+lrdTKPAEBAiYlAAAK+C0NAQMtDQIEJwIGBAEMOAQGByQCAAcAAAtFJQAAFDIAKAMCBgA4BgQHLQ0HBS0IAQYnAgcEAgAQAQcBJwMGBAEAKAYCBy0MBwgtDgUIASgABIBNAAUOOAQFByQCAAcAAAuNJQAAEFUtDgMBLQ4FAi0MBgEmKgEAAQWLDiEWkOO1VjwBAQImKgEAAQVaQ5vQPsayTDwBAQImJQAACvgtCAEIJwIJBAMAEAEJAScDCAQBACgIAgktDAkKLQ4ECgAoCgIKLQ4GCisCAAQAAAAAAAAAAAIAAAAAAAAAACcCDAQNLQgADS0MBA4AEAAMACUAABRELQQAAC0MDgYtDA8JLQwQCi0MEQstDQYEACgEAgQtDgQGLQgBBAAAAQIBLQ4GBC0NCQYAKAYCBi0OBgktCAEGAAABAgEtDgkGLQgBCQAAAQIBLQ4KCS0IAQoAAAECAS0OCwouCIBKAAcjAAAMhQ0oAAeATwAFJAIABQAADOcjAAAMmicCBwQLLQgACy0MBAwtDAYNLQwJDi0MCg8AEAAHACUAABTkLQQAAC0MDAULKAAFgEsABAsoAASASQAGJAIABgAADOIlAAAVWC0MBQQmJAIABQAADPQjAAANSScCCwQCDDgHCwwkAgAMAAANCyUAABQyACgIAgsAOAsHDC0NDAUnAgsEDC0IAAwtDAQNLQwGDi0MCQ8tDAoQLQwFEQAQAAsAJQAAFWotBAAAIwAADUkBKAAHgE0ABS0MBQcjAAAMhSUAAAr4LQgBBicCBwQEABABBwEnAwYEAQAoBgIHLQwHCC4KgEsACAAoCAIILgqASwAIACgIAgguCoBLAAgtCAEHAAABAgEtDgYHLgiASgAFIwAADa8NKAAFgEgAASQCAAEAAA62IwAADcQtDQcBLQ0BAgAoAgICLQ4CAQEoAAGATQADLQ0DAgEoAAGATwAELQ0EAwEoAAGASAAFLQ0FBC0IAQEnAgUEBAAQAQUBJwMBBAEAKAECBS0MBQYtDgIGACgGAgYtDgMGACgGAgYtDgQGLQ0BAwAoAwIDLQ4DAScCBAQFLQgABS0MAQYuCIBNAAcAEAAEACUAABaVLQQAAC0MBgMnAgUEBi0IAAYtDAEHLgiATwAIABAABQAlAAAWlS0EAAAtDAcEASgAA4BNAAUtDQUBASgABIBNAAUtDQUDHAwCBQQcDAUEABwMBAIELQwCBC0MAwItDAQDJi0NBwEcDAUCAAA4BAIDLwwAAwACJwIGBAMMOAUGCCQCAAgAAA7hJQAAFDIuBAABgAMoAIAEBAAEJQAAFxcuCIAFAAMAKAMCBgA4BgUILQ4CCC0OAwcBKAAFgE0AAS0MAQUjAAANryUAAAr4LwwABAAFHAwFBgQcDAYEAAI4BQQGCSgABoBGAAQcDAQGBBwMBgUAHAwFBgQCOAQFBwkoAAeARgAEHAwEBwEcDAcFABwMBQcBAjgEBQgJKAAIgEcABBwMBAkEHAwJCAAcDAgJBAI4BAgKCSgACoBGAAQcDAQKARwMCggAHAwICgECOAQICwkoAAuARwAEHAwEDAQcDAwLABwMCwQEHAwICwQEOAsECBwMBQQEBDgECQUtDAoBLQwHAy0MCAItDAUELQwGBSYlAAAK+Aw4BgUIKAIABQQOECQCAAgAABAqIwAAEAQWDAMBHAwDAgQcDAEDBAQ4AgQBBDgDBQIAOAECAy0MAwcjAAAQUBYMAQMcDAEEBBwMAwEEBDgEAgMEOAEFAgA4AwIBLQwBByMAABBQLQwHASYqAQABBUWnynEZQeQVPAEBAiYlAAAK+BwMBw4AHAwMBwAnAgwAAicCDwAgJwIRBBItCAASLQwMEy0MDxQAEAARACUAABelLQQAAC0MExAEOAcQDwA4Dg8HHAwKDgAnAgoAQCcCEAQRLQgAES0MDBItDAoTABAAEAAlAAAXpS0EAAAtDBIPBDgODwoAOAcKDhwMCwcAJwIKAEgnAg8EEC0IABAtDAwRLQwKEgAQAA8AJQAAF6UtBAAALQwRCwQ4BwsKADgOCgccDAgKACcCCABoJwIOBA8tCAAPLQwMEC0MCBEAEAAOACUAABelLQQAAC0MEAsEOAoLCAA4BwgKHAwJBwAnAggAcCcCCwQOLQgADi0MDA8tDAgQABAACwAlAAAXpS0EAAAtDA8JBDgHCQgAOAoIBy0IAQgnAgkEBAAQAQkBJwMIBAEAKAgCCS0MCQotDgcKACgKAgotDgUKACgKAgotDgYKLQ0ICQAoCQIJLQ4JCCsCAAkAAAAAAAAAAAMAAAAAAAAAACcCDwQQLQgAEC0MCREAEAAPACUAABRELQQAAC0MEQotDBILLQwTDC0MFA4tDQoJACgJAgktDgkKLQgBCQAAAQIBLQ4KCS0NCwoAKAoCCi0OCgstCAEKAAABAgEtDgsKLQgBCwAAAQIBLQ4MCy0IAQwAAAECAS0ODgwuCIBKAA0jAAASYQ0oAA2ASAABJAIAAQAAE0MjAAASdicCAwQNLQgADS0MCQ4tDAoPLQwLEC0MDBEAEAADACUAABTkLQQAAC0MDgItCAEDJwIIBAUAEAEIAScDAwQBACgDAggtDAgJLQ4HCQAoCQIJLQ4FCQAoCQIJLQ4GCQAoCQIJLQ4CCS4IgEoAASMAABLnDSgAAYBQAAIkAgACAAAS/SMAABL8JhwMAQIAADgEAgUnAgYEBAw4AQYHJAIABwAAEx4lAAAUMgAoAwIGADgGAQctDQcCMAwAAgAFASgAAYBNAAItDAIBIwAAEuckAgABAAATUCMAABOlJwICBAMMOA0CAyQCAAMAABNnJQAAFDIAKAgCAgA4Ag0DLQ0DAScCAgQOLQgADi0MCQ8tDAoQLQwLES0MDBItDAETABAAAgAlAAAVai0EAAAjAAATpQEoAA2ATQABLQwBDSMAABJhKgEAAQXYIY9HKnbV8zwBAQImKgEAAQUohpKwR9z9QzwBAQImKgEAAQWdbHCZW9/80zwBAQImAQCAA4AFgAcuAIADgAguAIAEgAkLAIAIgAeACiQAgAoAABQxLgGACIAGLgKABoAJAQCACAACgAgBAIAJAAKACSMAABQAJioBAAEF6J0J/qERLQ48AQECJiUAAAr4LQgBAicCAwQEABABAwEnAwIEAQAoAgIDLQwDBC4KgEsABAAoBAIELgqASwAEACgEAgQuCoBLAAQtDQIDACgDAgMtDgMCLQgBAycCBAQFABABBAEnAwMEAQAoAwIELQwEBS4KgEsABQAoBQIFLgqASwAFACgFAgUuCoBLAAUAKAUCBS0OAQUtDAIBLQwDAi4IgEoAAy4IgEkABCYlAAAK+C0NBAULKAAFgEkABiQCAAYAABUGJwIHBAA8CQEHJwIFBAYtCAAGLQwBBy0MAggtDAMJLQwECgAQAAUAJQAAGKotBAAALQ0BBS0NAgYtDQMHLQ4FAS0OBgItDgcDLgqATAAEASgABoBNAAItDQIBJioBAAEFAtxuJ4B2Ep08AQECJiUAAAr4LQ0DBi0NBAcLKAAHgEkACCQCAAgAABWQJwIJBAA8CQEJCygABoBIAAckAgAHAAAWISMAABWlLQ0BBi0NAgctDQMILQ0ECScCCwQDDDgICwwkAgAMAAAVzCUAABQyLgQABoADKACABAQABCUAABcXLgiABQAKACgKAgsAOAsIDC0OBQwBKAAIgE0ABQ44CAUGJAIABgAAFgwlAAAQVS0OCgEtDgcCLQ4FAy0OCQQjAAAWlCcCBgQHLQgABy0MAQgtDAIJLQwDCi0MBAsAEAAGACUAABiqLQQAAC0NAQYtDQIHLQ0ECC4EAAaAAygAgAQEAAQlAAAXFy4IgAUACQAoCQIKASgACoBKAAstDgULLQ4JAS0OBwIuCoBNAAMtDggEIwAAFpQmJQAACvgBKAACgE0AAw44AgMEJAIABAAAFrQlAAAQVQ0wgEgAAwAECygABIBJAAMkAgADAAAW0SUAABn9JwIEBAMMOAIEBSQCAAUAABboJQAAFDIAKAECBAA4BAIFLQ0FAy0IAQEnAgIEAgAQAQIBJwMBBAEAKAECAi0MAgQtDgMEJi4BgAOABgsAgAYAAoAHJACABwAAFzIjAAAXPS4AgAOABSMAABekLgAAAYAFAQAAAYAEAAEBAIADgASACS4AgAOACi4AgAWACwsAgAqACYAMJACADAAAF5AuAYAKgAguAoAIgAsBAIAKAAKACgEAgAsAAoALIwAAF18oAYAFBAABAwCABgACgAYjAAAXpCYlAAAK+C0IAQQAAAECAS4KgE4ABCcCBgQCJwIHAQEtCAEFJwIIBCEAEAEIAScDBQQBACgFAggnAgkEIEMD8AACAAYACQAHAAgnAgoEIC4EAAiAAy4EAAqABCUAABoPJwICBCAnAgYEIS4IgE0AAyMAABgYDDgDBgckAgAHAAAYLyMAABgqLQ0EASYtDQQHBDgHBwgCOAIDBw44AwIJJAIACQAAGE8lAAATyCcCCgQgDDgHCgskAgALAAAYZiUAABQyACgFAgoAOAoHCy0NCwkcDAkHAAQ4CAEJBDgHCQoDMIBOAAcACQQ4CQgHADgKBwgtDggEASgAA4BNAActDAcDIwAAGBglAAAK+C4IgEoABSMAABi6DSgABYBIAAYkAgAGAAAZJSMAABjPLQ0BBS0NAgYtDQMHLQ0ECC0IAQknAgoEBQAQAQoBJwMJBAEAKAYCCicCCwQEACgJAgw/DwAKAAwtDQkGACgGAgYtDgYJLQ4FAS0OCQItDgcDLQ4IBCYtDQMGDDgFBgcBKAAFgE0ABiQCAAcAABlDIwAAGfQtDQEHLQ0CCC0NAwktDQQKJwIMBAQMOAUMDSQCAA0AABlqJQAAFDIAKAgCDAA4DAUNLQ0NCycCDQQDDDgFDQ4kAgAOAAAZjyUAABQyACgHAg0AOA0FDi0NDgwAOAsMDScCDAQEDDgFDA4kAgAOAAAZuSUAABQyLgQACIADKACABAQABSUAABcXLgiABQALACgLAgwAOAwFDi0ODQ4tDgcBLQ4LAi0OCQMtDgoEIwAAGfQtDAYFIwAAGLoqAQABBfQu5YS79CHRPAEBAiYoAIAGBAACBwCABIAGgAUuAIAEgAgoAIAJBAAADQCACYAFgAoXAIAKgAokAIAKAAAajgMAgAgAAoAIAQCAA4AJgAsuAYALgAYBAIADgAiACy4BgAuABwEAgAOACYALLgKAB4ALAQCAA4AIgAsuAoAGgAsBAIAJAAKACSMAABorJg==",
2204
- "debug_symbols": "7V3bjt02sv0XP/uBRRbrkl8ZHAS5eAIDhh04yQEGQf591Bdxqy1qc3aF4q4tJQ9Bt1tLa1WxSBYvIv989/OHH//45fuPn//95bd33/3rz3efvvz0w+8fv3yefvvzr/fvfvz68dOnj798v/znd+HpfzHoM+C3X3/4/PT7b7//8PX3d98lEH3/7sPnn6cfE/D0in9//PTh3XcA8a//e/8uglhQMdVQUZheUdOPskaJBZVMXMnEhdGEYgsqm7iyiYvAhCILioMJlS0orZYyYMBXFCDnN6j366cDJpkfD8hanid8IkkhjiDhASQwwhIYYUkcYUmqRjJkCDMqS/g2JlNCE0otKEwmFFtQ9faqiSILikyep2xBcbVtBM1zDwjK3AglgflhSVienVz2wkB7M0jYnQF3Z5C9GTTtzrC3DbjRGfVk6BGtgQsDv2FYP8t57uKZLk12JHlWA+hKTT2rJJj7kUiMDTXMUuTAm9xanznqXVtnDt6fYyNv78sxwA4cUB44IK7yADvygPKgAXZsjHxu4siY57wjI13GLhkrD+PUEr8+jIJxmYlW2rPMcVafhb9JW7Ge0NwofpI8i89EDfFEMIsnDi3xIRfxEVbie3g+ByjiY74uHjLPoQCU0nXxU7czv1lp0Xe+iq8nSX9DPOlS/BOFxv0pOlTiTDnNFLTooPcugim4+opnDN/4J0Pan6JDf5AFC4Uof0sR0/4UvDtFgv0p8v4UujsF7m8F7m9F3j9o8/5Vj/a3gvaverx/1eP9g5b3D1rpXNya4/X+dFokuLw6LGa8GF4EiTNBXZKaroLIl6Dpn7wJQm+CnAU1gbNqT+DNQ9FZtafordonb9U+eav2yVtQo7dqj+xMUAZvgrxVe/JW7clbtSd1JoiHV3tKUF6d01qQOBMk0ZsgciZIgzdB6E2Qs6Dm4Kzac/DmIXBW7RmcVXuOzqo9R2fVnqO3oE7jg1rmVdPI8Db9WD89TYbMT1PQN/saKwuyUnZBiuRvN0Fy4ruaqivfY/QmyJuH8nAPMWoRxOvqktmZIAJvgrI3QepM0PgBVkuQt6AWb0Et3oJ6/ACrJcidh5xVexk/wNJL6qdZ14LEmSDw5qEI3gQNH/EplaDWxYaAerYuicp2TlxsRk3heTOqjF8E6isfH1u++JaPGIr8Rew/yV8/DRrmbb2gCCtjxy9e3dNYfujAHD/K6yv/sb1Pj+19emzvs3PvX2mnnuU7T0ga8sV5QtKSj4Plp0DzfF0Ky8/SX/NTUWeCNHkTxL4EaQBvgrI3Qc6CWsFZUCt4C+roLaijt6CO3oI6eQvq5C2o0VtQIzkTlL15KHeo9pTinARSwnRdkMg8UaDw5ovkyqSCaDkhYvqZLkvxUV/U99i8aVUf33x8/awme1LDrnzDvnyjntT0GCR1VOPKN+rKNz32RHZTA6HHgl1POexKTo/dkD3l+PJOjwFITzm+vJN8xU4iV3LQV+ygp9wCQvaUeE1yPPWgkxxP6QUEGt6FcihyWsfvcNl7qgK01i6Pq50f2O/Mj6td4gNrf2C/q+Vk9QlmOYIcIEQbbOMQ8igXmDYcPGm+HAwdplncb10x/TeEJY9g2fieqDfLEFvqSWbjegKAevbVhNU73r6nik8sPIKF4xCWIbbIEFtkiC1qOaR8glnOh5+aArTBxASDaIOxCVafLWjDTAUQTZcBTLC9z36HiLA/Rd6fQnenyGl/Ctmdgva3YqOH6knR5daFG851h1wWKCEvFihTSq+C1JkgSfcUpBVB4kyQevOQ7n+MO2xcR9SbhAeQQBpBMsKSOKJM4ojoSiMsSSPKBEdY0mMzDyHOIwxCauyd6XhRAKQeO38ol93WlCk01Pe7KQBS7uJ7LSdlZNDr6jueUz9NbGBn9fRm4vCZo8dnEk2OHhOgVIKalk/PHD0+JG9x9Njz3uDAHrvGmxw9agXDHOjTw3nFATCAIw/g0P05etyz0OTg/TnSADvSADtwQOzigDqYB9iRB9TBPKAO0oDYpQGxy73LnBs3O6VYEsgUdfHql53a0OW6pr6Kenyc2FkRulMk3hT1uAGisyJvkZ2Dt9qfgzsfgbfan8Fb7e9yuVhfRdFb7c/RXWQnd5Gd3EV2Um+KMLlTxN4UZXe1P7ur/eSu9lN2p8hd7Wd3tZ/d9f3irvaLu9qv7jJ/HV77U5z3Cadp3eqNosqr+x2ADl3u3rPbSqu7ZiZF2ZsicOcjGO8jhqJItRGh02r+ooZd9r2nwC/6Y3hw/fjg+uWx9af44PrpsfXjg9dffPD6iw9ef3N6cP0P7n968PaTnLefuXzzmPJiL1XRL77bH6RyJCmSxIp+fWz9+tj+5+C7/jb1R/at/7Jxflrg1rV+5/lnW/+D+x99j3+b+rPv/Lmt33f/29RPD+5/5/lPUz8/uP8ZR+tHLDOCU5f6Rv+LIvWmSJI7RexN0fi1j6ai7E6Rt8iW4K32S3DnI/BW+wW81f4ud8l1VuSt9kt0F9nJXWQnd5GN7iJ7/IgRUzkHHjGvFY0fAzYVoTtF4k3R+JnzpiLypojdRTa7i2x2F9niLrLFXWSru8hWd5Gt3iJbg7fI1sDeFIE7H8GIs1G3rgXrzTLiPFFNYQjLEFvQdDbqxu1KTRgPOKxJecDBQCpxBMmAw5pUR1ii+5dJ7HJrTJtkhCUQR5CMsKTH3BvEHOdVpennxeHmTzQVUVNT9/o4T88v27z1wxrLLdEaJX/TQE4GUH8D8tpPPb6D/B9oepxn9r/Q9Mi7NMwspK1TtTqeaBZDl28JpXBMhrw50eyFg/fnIBjAkQdw6P4cXb6ya3EMsEMG2CEDYlcH1EHd3w4IMIAjD+DYP3YB0gCO3mWOjdMqk6QyJhLCN+Pvyqv7fXMYIcZ72srp27mGSRF7U5Tc+SiN95HMJ1InDXmtCKM7ReRNUZdVxr6K0J0i8aaI3EU2uav97M5H7K72i7vaL+5qv7ir/eousvWukQ26UhS7j1/+vqLsTpF6U9R9JPX3FbE3RdFdZEd3kR3dRXaX8wL7KnLnI3RX+zfWA5TmxaMUUmgogqSz/qfLA8rTrxcnTbWn2p2noGXHKqzXpCcYm2BkYyMbW/3Q7jaMTDCxsYmNrb7Zqw3LNphaYCmgDWZjq/ffbdhGcKEUWGxWs8aWkbhxT1V3FhrBkmAIyxBb8ObSf4blaIPZ2MjGRjY2trGxjU1sbGJjUxubmtgwRBvMxgY2NrCxRbDByARLNrZkY0Mb28bd502YmmAZbTAxwSjZYLbgsjVByLbiFltxi624tzK3FsxW3GoKrhySDWYKrmxrubKt5cq2livbWq6N2wPasGyD2Yob0QazFXe2BZctecq25CmTrbjZFlxsK26xBZfYiltswaW24lZTcJEt5yJbzkUANpgpuDZOJm7Dsg1mKm5KaIPZihuTDWYrbtuwj7KtuMkWXGQrbrYFF9uKm23BVd+pmaY0Z4blRH9dnxQoc7SLK+qRX95fP/Om4/t11/fzxoxbv/fLvu+HtPP7d9a/Mc3X7f0baWG399fPzu74/p315531b7Tk3d5PO8cP7Rz/vHP95Z3179y/sOzc/uvO7b/u638J+/p/4xSZXE70zrI4EDvHV5AYQPWaTDCfvU0LOy4gNoDYwlQfObZA2QBSC5OamKqVK5cV8GmQtwJpPeJaIDGAwMIEFqZoYap/ZtAA1eflpwHPDOJYAakBVJ+iaoDq47UWiA0gut0RKdRnDyDQvDEEABYfOzxdtrR+WmYKWF5GAPhKkXenqM9K9KXY34q0vxVpgBW6O0V9xqUvhexOUW8ZbqQotTuG+IaikpQozt+oserlzfEpSVknPOXNuJgFibUXR9B5h0OMEJcPPxvK6SyGykkMlbOEbn1r3AENVTiLoScpUQjhLIbiWQw9SfcCcJLuBeAsjVE8S2PUZZj4EIbqSQxNJxm9QDpL94Jn6V7wLN1LPsnoBfJZupd8lu6F8CyGnqV74bN0L/XPrQ5oqJyle5GzdC96kvHoxqkrj2hoTBdDF2cXz4bGw+S6DPNOo8gprQxNh2mMWoYeJnRbhh4m120YioeZSmkZepjMqGHocQbeLUPP0r3QWUqUztK91I/hB5ByLNMyn6obmjOXTZiySDMhVs880TybCrrYdfh6rlSKGyPHe0raGPrcU1L9q9V7SkrHWbBMoah4pn5baVI8TDPYMvQsJZoOM9HaMvQww4mGoXiWEsWzlGg+zAAxaiyGhrw29DCLIQ1D6TCLIS1DD9OPNgzlw0ydtww9TPfSMvQsjdFxPltoGXqY+ceGoXqSEsVwmPFow9D6h8NIZY4LCfHNxERFfJZ5rZApNC6S5ZhnH04/4vLhF0HsTFD96rN7CvLmIfTmIfTmofq6zT0FefMQeYuh+v65Owpiby11/UC3OwoSbx4SZzG0ccjvroIkFEECK0ERRwtKVBKtxBVBXYqML4IWCVpVULocW5BiXBy4kl6ODMl98o+uitibIoTRiqLOcZ2WM6tPiiojgcBl3BDkciXF07Ew66elqJaEjWevno80+UX/8UvNLzn945eaX+ifelT3S/7HLzW/8D/1qO4Xdu4XguIXDmv94r0daOmnx9avD+5/fWz/U3hs/1Pw3l+19HvPWxv6AR9cvzy2/ug9L2npvzl/eIYlsMHIBKufHI9Uci7kIA0nA6V5eQooLzI0mEnyCBIdQLI15uxLMsISwhEkIyzhEWWyNRi4jUTmO6CnB2RNInEECQ0g0TCCZIAlvJVF9iUZYQmEESQ9mhXOWkgE35BUngYo31/A4vb2SFJNCKjkA/nNs8/yY3xs+T3iiMvX8SCLlGmA/ISPLV86yJcUinykdQXDNIJkhCXUZX6h3zomcxgtCGEeQjDGiqA8WlBSuiZIhnsoSboIitcfBpiCalGbda1/eMhdX6lmBW+CnHlIAnoTpM4EQXYmKEZvgtiZoJS8CRJngtCbh9BbDGVnXYfU52FyjnOfnHMGv8mB1LdC5lySxkyx5dAIRVIEXSe9Ur/DuzdJD0smlpkk5rwmUexCwoWE1tNuWr8W/EaSFOYsOz6PAlckPIAERlgCXSyJuZBUpkI1drEklpPppoHzmqR+r9eNJBjKZzMINZI8gARHWIJdLImlMmJez+1p7mJJ6Q4iciWEN27tvJGkXH8Yc6hYQmkEyQhLuIclOZboWnbRFxLpQlLarkzr/kTrY/NbSbT0jBRwTVIfb/cm2d8SDKGHJXTp4wmlQkJdSEqzQgRrEuiRSFzWJaY8giskOoAkjrAkjrAkjbAk6e4NJAbEAST1idopN59JYgiLXjs8X2uNsT63RRnnqj/Vl9DQpmXApLqwQ2vrF9N4qXyCIet0exKkowVdvglRqAiC0R7SmIqgBBVB6kxQ9Oah6M1D9cm2ewpiZ4IQvAkiZ4KyNw/VL7W5p6DxXUe+CMprQXTHzlUTVQQNbxjzpcik4iEe3nWIFkGVhDCyOhMk3jxU/xj9joLqhwndUxD5EpQCeBPkzUP1jYn3FDS82ud5Au5pYqciSO/Wl02C4lrQ6FHH0wROEUShIkhHCyIsgrjioYTeBHnzECZvgtiZoNGjjrYgciaIvHmIsjdBw6t9WVOYBK2HQWn4qGPZl3Glt+fhHio71BHielyWRo86JhWlc4VU8ZCoM0HqzUMqvgRhiN4EkTNBAN4EefNQDN4EDc+pyyI8AsaKoDuOywDTWtDwUQeUJc4pXEJF0OiuY1pULYKgUmSI3gR581BO3gSxM0EE3gSRM0HszUOcvQkanlOXr5InQZXOdfhax6Ivi+tPySdBoz2EXGZhUdabUVCTN0HiS9DG0cT3FOTNQ+DNQ8DOBEXwJoicCUrBm6DsTdCuXcczxb6rFy8UsjtF7jBNBCGVEzdCpkbZ7XdJDpRp1bjMuF4uycGNY26PaaqcxlQ5TwALncZUhfOYeppSpRDOYyqex9TTdDYEp+lsCM7TLMXzNEsxn8dUPY2p6TQjG0rn6WzwPJ0NnqezyacZ2VA+T2eTz9PZ9Pis7lFMPU9nw+fpbJhPY6qcp7OR83Q2eprxKocDlWpMF1Mxr0yNB8qBuXysFzmllanpQM1Sy9QDBXDL1APlwA1T8UATLi1TD5QtNUw90tC8Zep5Ohs6T6nSeTqbja9aqZwxOs1TcMNUuVwsLUEuHPW7IVO+3A25OBV53knFG9uL7qlIvCkSdz4Sdz5Sdz5SdqZINo7Uuaci8qZo41CdeyrK7hR560Vk4wvXOypKXXxUPvWRsDhZvn6rB19yCl7cG/dyTQcKwWhBQvOJFiwsa0E0XFA52K8qiMd76HKxnoiuBZEzQeLNQ6LOBCl6E+TMQxqceUiDDBeUtAjScP1hAJTLVas5rhp2BfSj/1lQj6MCvIynUyjXriTAv74ZTyseaPK2YWo+T6nSgVb1W6YeaJ66YeqR9mq0TD1PqR5pr0bUcp9UCnlt6oFWHxqmHmmvRsvUA/WrLVMPtDHwqqk5hAN1Ni1Tz9Is5QBnaZYmU4+0hey6qUf6kK1l6oHGq9dNhfqC4OJW7chrDN+MiRtXLV/HGHjAwAMGnvo5Qg2MgScZ7Kl/xnYdg8mAqd+wSJe7D2GFqR//2MDI7Zj65EQuG4JptR94wtDtmPpqSANj4BEDjxh46kOKBuZ2no17axoYvh0D0YCR2zEx3Y6p14Xrm5MmVNULQDR3TkCyqg8bNwe0UPVtR02UWFD1s3aAeW6CgDWvUWxB1U+AaaKyCaUGFNbPOmyiLN5AiCaUiSuCCZVNKJPnk8nzyeQNNHkDTd6ob0AGhTk/BI0VlFpQG7Xycs0SBJIVaqNWtlB1b0AqrQ3kVWuzcZZoC1U/1b+JIguqPt4CoMs6p6y8kTciCsOcLE0/rrk2IqqFUguq3us1UfWIyuXeUJjKdIWqZ4FNlIlr45buBkqCCUUWVH2s10SJAbVxRFUTpRYUmLhgw65y+CdkXeVsFMmCqn+T1kSpBYVoQpm8kaMJZfLhRgabLj1RSqt2gziYUGhCiQW1kfe2UGRBqckbavE8h2BCoQll8TxDNKE2PI9cULRqbThGE0otqIQWFAYTKltQGzlAC8WGzGHjE60mypIRMZu4NuqyJig59mJrWkJ9gdWXRNswtcBkY2jZgm3UsSVssZGuwDaS3yZMTLBEJlg9145BZlgMShUYmWDZxlYfwDVh9YN42jAbG9vY6h3utG5QljwCV8qt3uO2YWyCqY1NTWwaog1GBhiF+sy8TOJfYdOPFxjIC6o+Kmui2IKqz2BOhVI28uriuAyorc1N8+jzkDvKYuKyUMjuFLK/FfXo7kpRrwl9KXa3AkLcn2J/K2B/K+qTtl0p6neV9KWg3Slw/7KgjTaKQ6FYXO88o+qJqQaYu2UNnFeo+jRui0s3okVK877cF/GKivVB5qSw3EsSFjskCipbUGDiqk8ztVD15cQJFS8oWKPEgkomrnry20SRBZVNXNnERaGJSuvyoo2ISrmgcB29HJr1C3GN2uBCudTKtULZKOUy5K7V5ShiaAGiJhOKDahU7wL48u0VfruETmkjnrAUcc5rTDZg9HYMJQPGsNxGicGEIgtKTFxi4lITl1q4MIAJZSmvjSvFmyiTXRvzLy0UmlBiQdU3xjVRfHNrgVs9XenAYwVDN9diJL6dhw3aNvuPaxi9HSO3t2S40d9cxejtPDmAAXN7mW5sGGhgDDz1+qrlUt5lxl0w+XZMMvDUt6Nex9S3ozYwBp5s4KkvQyzKp4KpT3ldL1Pi2zFs4KlvQWhgbs+GNq5da2Bubw8oJAPm9kxtY9tBA2PgiQZ74u2xs7FJoYG5MQ7+mn77/x++fvzhx08ffpsQT3/84/NPv3/88vn119//8+v8lx+/fvz06eMv3//69ctPH37+4+uH7z99+enpb+/C6//+BaD0HiLwpOZJ/rRiK+8hZZp+f3IbhKffp6HR09+fANNq2/tpwefp19fn8/R84knZpO6/",
2205
- "brillig_names": [
2206
- "public_dispatch"
2207
- ]
2208
- }
2209
- ],
2210
- "outputs": {
2211
- "globals": {
2212
- "storage": [
2213
- {
2214
- "fields": [
2215
- {
2216
- "name": "contract_name",
2217
- "value": {
2218
- "kind": "string",
2219
- "value": "ContractInstanceDeployer"
2220
- }
2059
+ "verification_key": "AAAAAAAEAAAAAAAAAAAAEgAAAAAAAAAQAAAAAAAAVgkBAAAAAAAAAAEAAAACAAAAAwAAAAQAAAAFAAAABgAAAAcAAAAIAAAACQAAAAoAAAALAAAADAAAAA0AAAAOAAAADwAAAAAAAAAAAAAAGOCCpDSiJTBrTNrACftcVIpDP0gAUgOfr61Rf1joqhofgWCThwZt/jv2kereHZxpXZaHfOrQXAJfbaEZK/ySgyOpvxlgUWbPhQeZuL84z3NPBHHNv4I2qhOYG96powtQKsK9LNUUHCDged5eO3NwlJaqCJuSsG4hdiuyOH/SveAS1rb1+8MRm94IDWr6xij8Y38RBu5sriBmS2WnWBeZwy5vl6NShiHV4FPDtfzoWza45O/bO0S+UObSmeaPPs9bCsexgAxe6u62RKgMBSU9aZScX50ygsNCvfSZE71hQbgY1w/KXmDcvlUc02Q2x7M+dnwYyoZijoc921LB3NFziwfytnBJRWekOIby1r7JheYBJgl4kgJBtjPKzXj3HGxTCWsCFXYIf+TdtH6Ak9qGDWdovJ06ccwA5rJGZnhBsgkYnlaCx3CGFw4amrFsFXgncZRkjMkfOV/8ngpTjMKq+Awhahc1m7/Qb+0352eJgb64aBH2xl2wp7wppa/1aDTzIuSmLVifXcWOAD4X0sKeZqqcjXq3WBuYEO2nPlPhfd8OP4PTyf+mJHwLpRXOLm9SrLCVbfb6d5ltuCSwof5icCmMMxH8kXD5LelAsEKquZDVPGo7JjOc2mtz35IIMUFZB7BfQIphKEclkBa5IErkvzdTfrGWsFwdmPpRAWqbrLsfNY59QrcOaU1aZJ8elDJYxJPxRxWWvMUwI4RHpzoF9jAUnRq6iJhTkEUKZz6huOwts8iJe/x7ir7PD8afRNIjL44LCn6UMQphDA06F8RT3eZTIXQSd22b1QR+mEl5/WQTtN9b82eFw0c4x2ywwQZIUNSPnd1B0yhJQ1YPww7bYBmz7hM37OYMZEaDHOA0ls4ypkWhz4tfCGNY/9jEfYwFJnnwhPJ7oSVWC6jwqzoIu2mEI4Ktt7EbaGmvMSBwJ7ARRPkkuRVzu5l42nf5CMf6LO0T/Y1+n3qNoK6J5qowYwFm5l0Nm/6f69sf3AZjYN/oQO8ynvkdG6P6slyKuop0CFhw1LUjn/rR9qAWUD/gH3dbynR7chtR69l1bhFoITEpnvkUHLLF65e95nLgfscAitSWQ/pSHJ6/mTCgO+XebRe3nt2YQPlHFtxxP3mgPqHLbw6Yn41Uw36xTpijccsxB5z4yQ5Zx3jAx96mrrYSxjbOZdDchcRuNt7++9OMpt0gHIYjM960V+OSBj3F/gtxo5+W8z/oSZZNItE2JMr+2QPf1uLDN2I9iLA6MvIm9uGXNm9k10riGbvl/Osi5Ek9Jnj60rIdDvqBJ+sqvmBbofV+9KZ1csfuuY7YOihfv8QhdRR0DLCHAepE+oEW7AUlMxpdfxd3gq0PTiehNu8fcxfq3SGG3U0+gWHeuauR7/6cXZqYB9fzblDgo0L10vh6K9z1erXch9xvcAaciLVCzxeofa9m5TIjJTGqxSeJGLUtIJ5IremTJoiB0jRiM3MGfwT+VR+qJhkbqqcCgmGMwx84aPwAwBytJK48rQT1hQTll2gap0wY8W+fy2+h6Uo4KFK4/wPiDr21VBsPzjSS7QB3VhMmsjuvZptDBlNVJ2wlf/5HovAbpydY2Vt+P9jn/A0BC4jyHbPxLNXflH+gJSvnf7ZFW7gXvH8Zu9k6D9Z2Ru2gbogDe+SsTvAkvqtyGjwrispcMF5b+Rd7Mao3E5Gp7cEpnM0Lu6VSD62sKhATt9PqtaK15HdAwpcneGuYc9z1DVW0+q6bZ4w+W18iCAJQu/2KWphNZ1/cfhlhdcZs73bH6QMOTSsStI4T4rlJBmxuufssAmvE4bjup5S4vYeaOGebZodanwpZxCW5/ksbYUqEYBIyxMmCy4L06WNuWLGgQdAEq3Uv8ciOLfTQiArcicSNdbVxY29bvrSoBvb0WWICMBtq5OsOu+rdIDNABm8oE1dI8RljHD/gf6nXAANOPidFTvmStL+EuXuqdHEuJXg1Ud9QwATsfNH03Ys7ZKZvKsSXm2XlZWjFoxsU7Rj3bPDO7MtHmN50GuibZOglj4RHfBtiVlpVm6e7OIMuLSmftoZ40BULzFsW3IJSNT1D+nDpkjnBwcZ+JxoO6sUV06xaGZq7dJM6TvyYxZsoFO3nzSfa7QDDPBKGC8SwRi041tS6Hkdjp07NsRyh80aWgMJw5VFRU0RZL1kYj6dlEts56JKCazJhDuCCUeAF/OkXwNXcoBlHfFL2B1MythIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACDt0u+U0u3pNT3r1l32scxIyP8edh8Ps4+y2VaI2VGR0ez8ZxpW5a4/CwXueFN/2VG1x+QLESaScFnVHiR+3HNgDENyb3W2/aDeIs4ODfq2vMegX/lalrKJQkxfczZw2WL5tuC04sAZaN5cMkgqp9HQoJ1xeOyTuteFj5bmTwtI0dWKphxkrVIgQ9ecSAIhnlW6GXUa3+bDYyTT+2wtoJiS18GKk8Pa5YgJ+q7saoanj0s7xh8Z1ucGk1m79H5/kH"
2060
+ }
2061
+ ],
2062
+ "outputs": {
2063
+ "globals": {
2064
+ "storage": [
2065
+ {
2066
+ "fields": [
2067
+ {
2068
+ "name": "contract_name",
2069
+ "value": {
2070
+ "kind": "string",
2071
+ "value": "ContractInstanceDeployer"
2072
+ }
2221
2073
  },
2222
2074
  {
2223
2075
  "name": "fields",
@@ -2250,71 +2102,6 @@
2250
2102
  },
2251
2103
  "structs": {
2252
2104
  "events": [
2253
- {
2254
- "fields": [
2255
- {
2256
- "name": "DEPLOYER_CONTRACT_INSTANCE_UPDATED_MAGIC_VALUE",
2257
- "type": {
2258
- "kind": "field"
2259
- }
2260
- },
2261
- {
2262
- "name": "address",
2263
- "type": {
2264
- "fields": [
2265
- {
2266
- "name": "inner",
2267
- "type": {
2268
- "kind": "field"
2269
- }
2270
- }
2271
- ],
2272
- "kind": "struct",
2273
- "path": "aztec::protocol_types::address::aztec_address::AztecAddress"
2274
- }
2275
- },
2276
- {
2277
- "name": "prev_contract_class_id",
2278
- "type": {
2279
- "fields": [
2280
- {
2281
- "name": "inner",
2282
- "type": {
2283
- "kind": "field"
2284
- }
2285
- }
2286
- ],
2287
- "kind": "struct",
2288
- "path": "aztec::protocol_types::contract_class_id::ContractClassId"
2289
- }
2290
- },
2291
- {
2292
- "name": "new_contract_class_id",
2293
- "type": {
2294
- "fields": [
2295
- {
2296
- "name": "inner",
2297
- "type": {
2298
- "kind": "field"
2299
- }
2300
- }
2301
- ],
2302
- "kind": "struct",
2303
- "path": "aztec::protocol_types::contract_class_id::ContractClassId"
2304
- }
2305
- },
2306
- {
2307
- "name": "block_of_change",
2308
- "type": {
2309
- "kind": "integer",
2310
- "sign": "unsigned",
2311
- "width": 32
2312
- }
2313
- }
2314
- ],
2315
- "kind": "struct",
2316
- "path": "ContractInstanceDeployer::ContractInstanceUpdated"
2317
- },
2318
2105
  {
2319
2106
  "fields": [
2320
2107
  {
@@ -2544,74 +2331,62 @@
2544
2331
  ],
2545
2332
  "kind": "struct",
2546
2333
  "path": "ContractInstanceDeployer::ContractInstanceDeployed"
2547
- }
2548
- ],
2549
- "functions": [
2334
+ },
2550
2335
  {
2551
2336
  "fields": [
2552
2337
  {
2553
- "name": "parameters",
2338
+ "name": "DEPLOYER_CONTRACT_INSTANCE_UPDATED_MAGIC_VALUE",
2339
+ "type": {
2340
+ "kind": "field"
2341
+ }
2342
+ },
2343
+ {
2344
+ "name": "address",
2554
2345
  "type": {
2555
2346
  "fields": [
2556
2347
  {
2557
- "name": "new_update_delay",
2348
+ "name": "inner",
2558
2349
  "type": {
2559
- "kind": "integer",
2560
- "sign": "unsigned",
2561
- "width": 32
2350
+ "kind": "field"
2562
2351
  }
2563
2352
  }
2564
2353
  ],
2565
2354
  "kind": "struct",
2566
- "path": "ContractInstanceDeployer::set_update_delay_parameters"
2355
+ "path": "aztec::protocol_types::address::aztec_address::AztecAddress"
2567
2356
  }
2568
- }
2569
- ],
2570
- "kind": "struct",
2571
- "path": "ContractInstanceDeployer::set_update_delay_abi"
2572
- },
2573
- {
2574
- "fields": [
2357
+ },
2575
2358
  {
2576
- "name": "parameters",
2359
+ "name": "prev_contract_class_id",
2577
2360
  "type": {
2578
2361
  "fields": [
2579
2362
  {
2580
- "name": "new_contract_class_id",
2363
+ "name": "inner",
2581
2364
  "type": {
2582
- "fields": [
2583
- {
2584
- "name": "inner",
2585
- "type": {
2586
- "kind": "field"
2587
- }
2588
- }
2589
- ],
2590
- "kind": "struct",
2591
- "path": "aztec::protocol_types::contract_class_id::ContractClassId"
2365
+ "kind": "field"
2592
2366
  }
2593
2367
  }
2594
2368
  ],
2595
2369
  "kind": "struct",
2596
- "path": "ContractInstanceDeployer::update_parameters"
2370
+ "path": "aztec::protocol_types::contract_class_id::ContractClassId"
2597
2371
  }
2598
- }
2599
- ],
2600
- "kind": "struct",
2601
- "path": "ContractInstanceDeployer::update_abi"
2602
- },
2603
- {
2604
- "fields": [
2372
+ },
2605
2373
  {
2606
- "name": "parameters",
2374
+ "name": "new_contract_class_id",
2607
2375
  "type": {
2608
- "fields": [],
2376
+ "fields": [
2377
+ {
2378
+ "name": "inner",
2379
+ "type": {
2380
+ "kind": "field"
2381
+ }
2382
+ }
2383
+ ],
2609
2384
  "kind": "struct",
2610
- "path": "ContractInstanceDeployer::get_update_delay_parameters"
2385
+ "path": "aztec::protocol_types::contract_class_id::ContractClassId"
2611
2386
  }
2612
2387
  },
2613
2388
  {
2614
- "name": "return_type",
2389
+ "name": "block_of_change",
2615
2390
  "type": {
2616
2391
  "kind": "integer",
2617
2392
  "sign": "unsigned",
@@ -2620,7 +2395,32 @@
2620
2395
  }
2621
2396
  ],
2622
2397
  "kind": "struct",
2623
- "path": "ContractInstanceDeployer::get_update_delay_abi"
2398
+ "path": "ContractInstanceDeployer::ContractInstanceUpdated"
2399
+ }
2400
+ ],
2401
+ "functions": [
2402
+ {
2403
+ "fields": [
2404
+ {
2405
+ "name": "parameters",
2406
+ "type": {
2407
+ "fields": [
2408
+ {
2409
+ "name": "new_update_delay",
2410
+ "type": {
2411
+ "kind": "integer",
2412
+ "sign": "unsigned",
2413
+ "width": 32
2414
+ }
2415
+ }
2416
+ ],
2417
+ "kind": "struct",
2418
+ "path": "ContractInstanceDeployer::set_update_delay_parameters"
2419
+ }
2420
+ }
2421
+ ],
2422
+ "kind": "struct",
2423
+ "path": "ContractInstanceDeployer::set_update_delay_abi"
2624
2424
  },
2625
2425
  {
2626
2426
  "fields": [
@@ -2822,274 +2622,222 @@
2822
2622
  ],
2823
2623
  "kind": "struct",
2824
2624
  "path": "ContractInstanceDeployer::deploy_abi"
2625
+ },
2626
+ {
2627
+ "fields": [
2628
+ {
2629
+ "name": "parameters",
2630
+ "type": {
2631
+ "fields": [
2632
+ {
2633
+ "name": "new_contract_class_id",
2634
+ "type": {
2635
+ "fields": [
2636
+ {
2637
+ "name": "inner",
2638
+ "type": {
2639
+ "kind": "field"
2640
+ }
2641
+ }
2642
+ ],
2643
+ "kind": "struct",
2644
+ "path": "aztec::protocol_types::contract_class_id::ContractClassId"
2645
+ }
2646
+ }
2647
+ ],
2648
+ "kind": "struct",
2649
+ "path": "ContractInstanceDeployer::update_parameters"
2650
+ }
2651
+ }
2652
+ ],
2653
+ "kind": "struct",
2654
+ "path": "ContractInstanceDeployer::update_abi"
2655
+ },
2656
+ {
2657
+ "fields": [
2658
+ {
2659
+ "name": "parameters",
2660
+ "type": {
2661
+ "fields": [],
2662
+ "kind": "struct",
2663
+ "path": "ContractInstanceDeployer::get_update_delay_parameters"
2664
+ }
2665
+ },
2666
+ {
2667
+ "name": "return_type",
2668
+ "type": {
2669
+ "kind": "integer",
2670
+ "sign": "unsigned",
2671
+ "width": 32
2672
+ }
2673
+ }
2674
+ ],
2675
+ "kind": "struct",
2676
+ "path": "ContractInstanceDeployer::get_update_delay_abi"
2825
2677
  }
2826
2678
  ]
2827
2679
  }
2828
2680
  },
2829
2681
  "file_map": {
2830
- "111": {
2831
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/aztec.nr",
2832
- "source": "use crate::{\n discovery::private_notes::MAX_NOTE_PACKED_LEN,\n macros::{\n dispatch::generate_public_dispatch,\n functions::{\n stub_registry,\n utils::{check_each_fn_macroified, create_message_discovery_call},\n },\n notes::{generate_note_export, NOTES},\n storage::STORAGE_LAYOUT_NAME,\n utils::{get_trait_impl_method, module_has_storage},\n },\n};\n\n/// Marks a contract as an Aztec contract, generating the interfaces for its functions and notes, as well as injecting\n/// the `sync_notes` utility function PXE requires in order to discover notes.\n/// Note: This is a module annotation, so the returned quote gets injected inside the module (contract) itself.\npub comptime fn aztec(m: Module) -> Quoted {\n let interface = generate_contract_interface(m);\n\n // Functions that don't have #[private], #[public], #[utility], #[contract_library_method], or #[test] are not\n // allowed in contracts.\n check_each_fn_macroified(m);\n\n let contract_library_method_compute_note_hash_and_nullifier =\n generate_contract_library_method_compute_note_hash_and_nullifier();\n let note_exports = generate_note_exports();\n let public_dispatch = generate_public_dispatch(m);\n let sync_notes = generate_sync_notes();\n\n quote {\n $note_exports\n $interface\n $contract_library_method_compute_note_hash_and_nullifier\n $public_dispatch\n $sync_notes\n }\n}\n\ncomptime fn generate_contract_interface(m: Module) -> Quoted {\n let module_name = m.name();\n let contract_stubs = stub_registry::get(m);\n let fn_stubs_quote = if contract_stubs.is_some() {\n contract_stubs.unwrap().join(quote {})\n } else {\n quote {}\n };\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: dep::aztec::protocol_types::address::AztecAddress\n }\n\n impl $module_name {\n $fn_stubs_quote\n\n pub fn at(\n addr: aztec::protocol_types::address::AztecAddress\n ) -> Self {\n Self { target_contract: addr }\n }\n\n pub fn interface() -> Self {\n Self { target_contract: aztec::protocol_types::address::AztecAddress::zero() }\n }\n\n $storage_layout_getter\n }\n\n #[contract_library_method]\n pub fn at(\n addr: aztec::protocol_types::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_types::address::AztecAddress::zero() }\n }\n\n $library_storage_layout_getter\n\n }\n}\n\n/// Generates a contract library method called `_compute_note_hash_and_nullifier` which is used for note\n/// discovery (to create the `aztec::discovery::ComputeNoteHashAndNullifier` function) and to implement the\n/// `compute_note_hash_and_nullifier` unconstrained contract function.\ncomptime fn generate_contract_library_method_compute_note_hash_and_nullifier() -> Quoted {\n let notes = NOTES.entries();\n\n if notes.len() > 0 {\n let max_note_packed_len = notes.fold(\n 0,\n |acc, (_, (_, len, _, _)): (Type, (TypeDefinition, u32, Field, [(Quoted, u32, bool)]))| {\n if len > acc {\n len\n } else {\n acc\n }\n },\n );\n\n if max_note_packed_len > MAX_NOTE_PACKED_LEN {\n panic(\n f\"One of the notes has packed len {max_note_packed_len} but the maximum is {MAX_NOTE_PACKED_LEN}\",\n );\n }\n\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) and inner nullifier (also non-siloed).\n\n let mut if_note_type_id_match_statements_list = &[];\n for i in 0..notes.len() {\n let (typ, (_, packed_note_length, _, _)) = notes[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_types::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 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 it's raw storage as a fixed-size array by calling the\n // unpack function on it.\n let expected_len = $packed_note_length;\n let actual_len = packed_note.len();\n assert(\n actual_len == expected_len,\n f\"Expected packed note of length {expected_len} but got {actual_len} for note type id {note_type_id}\"\n );\n\n let note = $unpack(aztec::utils::array::subarray(packed_note.storage(), 0));\n\n let note_hash = $compute_note_hash(note, storage_slot);\n \n // The message discovery process finds settled notes, that is, notes that were created in prior\n // transactions and are therefore already part of the note hash tree. We therefore compute the\n // nullification note hash by treating the note as a settled note with the provided nonce.\n let note_hash_for_nullify = aztec::note::utils::compute_note_hash_for_nullify(\n aztec::note::retrieved_note::RetrievedNote{ \n note, \n contract_address, \n metadata: aztec::note::note_metadata::SettledNoteMetadata::new(nonce).into() \n }, \n storage_slot,\n );\n\n let inner_nullifier = $compute_nullifier_unconstrained(note, note_hash_for_nullify);\n\n Option::some(\n aztec::discovery::NoteHashAndNullifier {\n note_hash, inner_nullifier\n }\n )\n }\n },\n );\n }\n\n let if_note_type_id_match_statements = if_note_type_id_match_statements_list.join(quote {});\n\n quote {\n /// Unpacks an array into a note corresponding to `note_type_id` and then computes its note hash\n /// (non-siloed) and inner nullifier (non-siloed) assuming the note has been inserted into the note hash\n /// tree with `nonce`.\n ///\n /// The signature of this function notably matches the `aztec::discovery::ComputeNoteHashAndNullifier` type,\n /// and so it can be used to call functions from that module such as `discover_new_messages`, \n /// `do_process_log` 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_and_nullifier(\n packed_note: BoundedVec<Field, aztec::discovery::private_notes::MAX_NOTE_PACKED_LEN>,\n storage_slot: Field,\n note_type_id: Field,\n contract_address: aztec::protocol_types::address::AztecAddress,\n nonce: Field,\n ) -> Option<aztec::discovery::NoteHashAndNullifier> {\n $if_note_type_id_match_statements\n else {\n Option::none()\n }\n }\n }\n } else {\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\n /// unconditionally fail.\n ///\n /// This function is automatically injected by the `#[aztec]` macro.\n #[contract_library_method]\n unconstrained fn _compute_note_hash_and_nullifier(\n _packed_note: BoundedVec<Field, aztec::discovery::private_notes::MAX_NOTE_PACKED_LEN>,\n _storage_slot: Field,\n _note_type_id: Field,\n _contract_address: aztec::protocol_types::address::AztecAddress,\n _nonce: Field,\n ) -> Option<aztec::discovery::NoteHashAndNullifier> {\n panic(f\"This contract does not use private notes\")\n }\n }\n }\n}\n\ncomptime fn generate_note_exports() -> Quoted {\n let notes = NOTES.values();\n // Second value in each tuple is `note_packed_len` and that is ignored here because it's only used when\n // generating partial note helper functions.\n notes\n .map(|(s, _, note_type_id, fields): (TypeDefinition, u32, Field, [(Quoted, u32, bool)])| {\n generate_note_export(s, note_type_id, fields)\n })\n .join(quote {})\n}\n\ncomptime fn generate_sync_notes() -> Quoted {\n let message_discovery_call = create_message_discovery_call();\n\n // TODO(https://github.com/noir-lang/noir/issues/7912): Doing the following unfortunately doesn't work. Once\n // the issue is fixed uncomment the following and remove the workaround from TS (look for the issue link in the\n // codebase).\n // let utility: fn(FunctionDefinition) -> () = crate::macros::functions::utility;\n // quote {\n // #[$utility]\n // unconstrained fn sync_notes() {\n // $message_discovery_call\n // }\n // }\n\n quote {\n #[aztec::macros::functions::utility]\n unconstrained fn sync_notes() {\n $message_discovery_call\n }\n }\n}\n"
2833
- },
2834
- "112": {
2835
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/dispatch.nr",
2836
- "source": "use super::utils::compute_fn_selector;\nuse std::panic;\n\n/// Returns an `fn public_dispatch(...)` function for the given module that's assumed to be an Aztec contract.\npub comptime fn generate_public_dispatch(m: Module) -> Quoted {\n let functions = m.functions();\n let functions =\n functions.filter(|function: FunctionDefinition| function.has_named_attribute(\"public\"));\n\n let unit = get_type::<()>();\n\n let ifs = functions.map(|function: FunctionDefinition| {\n let parameters = function.parameters();\n let return_type = function.return_type();\n\n let selector: Field = compute_fn_selector(function);\n\n let mut parameters_size = 0;\n for param in parameters {\n parameters_size += size_in_fields(param.1);\n }\n\n let initial_read = if parameters.len() == 0 {\n quote {}\n } else {\n // The initial calldata_copy offset is 1 to skip the Field selector\n // The expected calldata is the serialization of\n // - FunctionSelector: the selector of the function intended to dispatch\n // - Parameters: the parameters of the function intended to dispatch\n // That is, exactly what is expected for a call to the target function,\n // but with a selector added at the beginning.\n quote {\n let input_calldata: [Field; $parameters_size] = dep::aztec::context::public_context::calldata_copy(1, $parameters_size);\n let mut reader = dep::aztec::protocol_types::utils::reader::Reader::new(input_calldata);\n }\n };\n\n let parameter_index = &mut 0;\n let reads = parameters.map(|param: (Quoted, Type)| {\n let parameter_index_value = *parameter_index;\n let param_name = f\"arg{parameter_index_value}\".quoted_contents();\n let param_type = param.1;\n let read = quote {\n let $param_name: $param_type = reader.read_struct(dep::aztec::protocol_types::traits::Deserialize::deserialize);\n };\n *parameter_index += 1;\n quote { $read }\n });\n let read = reads.join(quote { });\n\n let mut args = &[];\n for parameter_index in 0..parameters.len() {\n let param_name = f\"arg{parameter_index}\".quoted_contents();\n args = args.push_back(quote { $param_name });\n }\n\n let args = args.join(quote { , });\n // name of the function is assigned just before the call so debug metadata doesn't span most of this macro when figuring out where the call comes from.\n let name = function.name();\n let call = quote { $name($args) };\n\n let return_code = if return_type == unit {\n quote {\n $call;\n // Force early return.\n dep::aztec::context::public_context::avm_return([]);\n }\n } else {\n quote {\n let return_value = dep::aztec::protocol_types::traits::Serialize::serialize($call);\n dep::aztec::context::public_context::avm_return(return_value.as_slice());\n }\n };\n\n let if_ = quote {\n if selector == $selector {\n $initial_read\n $read\n $return_code\n }\n };\n if_\n });\n\n if ifs.len() == 0 {\n // No dispatch function if there are no public functions\n quote {}\n } else {\n let ifs = ifs.push_back(quote { panic(f\"Unknown selector {selector}\") });\n let dispatch = ifs.join(quote { });\n\n let body = quote {\n // We mark this as public because our whole system depends on public\n // functions having this attribute. However, the public MACRO will\n // handle the public_dispatch function specially and do nothing.\n #[public]\n pub unconstrained fn public_dispatch(selector: Field) {\n $dispatch\n }\n };\n\n body\n }\n}\n\ncomptime fn size_in_fields(typ: Type) -> u32 {\n let size = array_size_in_fields(typ);\n let size = size.or_else(|| bool_size_in_fields(typ));\n let size = size.or_else(|| constant_size_in_fields(typ));\n let size = size.or_else(|| field_size_in_fields(typ));\n let size = size.or_else(|| int_size_in_fields(typ));\n let size = size.or_else(|| str_size_in_fields(typ));\n let size = size.or_else(|| struct_size_in_fields(typ));\n let size = size.or_else(|| tuple_size_in_fields(typ));\n if size.is_some() {\n size.unwrap()\n } else {\n panic(f\"Can't determine size in fields of {typ}\")\n }\n}\n\ncomptime fn array_size_in_fields(typ: Type) -> Option<u32> {\n typ.as_array().and_then(|typ: (Type, Type)| {\n let (typ, element_size) = typ;\n element_size.as_constant().map(|x: u32| x * size_in_fields(typ))\n })\n}\n\ncomptime fn bool_size_in_fields(typ: Type) -> Option<u32> {\n if typ.is_bool() {\n Option::some(1)\n } else {\n Option::none()\n }\n}\n\ncomptime fn field_size_in_fields(typ: Type) -> Option<u32> {\n if typ.is_field() {\n Option::some(1)\n } else {\n Option::none()\n }\n}\n\ncomptime fn int_size_in_fields(typ: Type) -> Option<u32> {\n if typ.as_integer().is_some() {\n Option::some(1)\n } else {\n Option::none()\n }\n}\n\ncomptime fn constant_size_in_fields(typ: Type) -> Option<u32> {\n typ.as_constant()\n}\n\ncomptime fn str_size_in_fields(typ: Type) -> Option<u32> {\n typ.as_str().map(|typ| size_in_fields(typ))\n}\n\ncomptime fn struct_size_in_fields(typ: Type) -> Option<u32> {\n typ.as_data_type().map(|typ: (TypeDefinition, [Type])| {\n let struct_type = typ.0;\n let generics = typ.1;\n let mut size = 0;\n for field in struct_type.fields(generics) {\n size += size_in_fields(field.1);\n }\n size\n })\n}\n\ncomptime fn tuple_size_in_fields(typ: Type) -> Option<u32> {\n typ.as_tuple().map(|types: [Type]| {\n let mut size = 0;\n for typ in types {\n size += size_in_fields(typ);\n }\n size\n })\n}\n\ncomptime fn get_type<T>() -> Type {\n let t: T = std::mem::zeroed();\n std::meta::type_of(t)\n}\n"
2837
- },
2838
- "115": {
2839
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/functions/call_interface_stubs.nr",
2840
- "source": "use crate::macros::utils::{\n add_to_field_slice, AsStrQuote, compute_fn_selector, is_fn_private, is_fn_view,\n};\nuse std::meta::{type_of, unquote};\n\ncomptime global FROM_FIELD: TypedExpr = {\n let from_field_trait = quote { protocol_types::traits::FromField }.as_trait_constraint();\n let function_selector_typ =\n quote { protocol_types::abis::function_selector::FunctionSelector }.as_type();\n function_selector_typ.get_trait_impl(from_field_trait).unwrap().methods().filter(|m| {\n m.name() == quote { from_field }\n })[0]\n .as_typed_expr()\n};\n\ncomptime global SERIALIZED_ARGS_SLICE_NAME: Quoted = quote { serialized_args };\n\npub comptime fn stub_fn(f: FunctionDefinition) -> Quoted {\n let is_static_call = is_fn_view(f);\n let is_void = f.return_type() == type_of(());\n\n if is_fn_private(f) {\n if is_static_call {\n if is_void {\n create_private_static_void_stub(f)\n } else {\n create_private_static_stub(f)\n }\n } else {\n if is_void {\n create_private_void_stub(f)\n } else {\n create_private_stub(f)\n }\n }\n } else {\n if is_static_call {\n if is_void {\n create_public_static_void_stub(f)\n } else {\n create_public_static_stub(f)\n }\n } else {\n if is_void {\n create_public_void_stub(f)\n } else {\n create_public_stub(f)\n }\n }\n }\n}\n\n/// Utility function creating stubs used by all the stub functions in this file.\ncomptime fn create_stub_base(\n f: FunctionDefinition,\n) -> (Quoted, Quoted, Quoted, Quoted, u32, Field) {\n let fn_name = f.name();\n let fn_parameters = f.parameters();\n let fn_parameters_list =\n fn_parameters.map(|(name, typ): (Quoted, Type)| quote { $name: $typ }).join(quote {,});\n\n // Example of what the fold(...) below will generate for `target_address` and `fee_juice_limit_per_tx` function\n // parameters:\n // ```\n // let mut serialized_args = &[];\n // serialized_args = serialized_args.append(aztec::protocol_types::traits::Serialize::serialize(target_address));\n // serialized_args = serialized_args.push_back(fee_juice_limit_per_tx as Field);\n // ```\n let serialized_args_slice_construction = fn_parameters.fold(\n quote {\n let mut $SERIALIZED_ARGS_SLICE_NAME = &[];\n },\n |args, param: (Quoted, Type)| {\n let (name, typ) = param;\n let arg_to_append = add_to_field_slice(SERIALIZED_ARGS_SLICE_NAME, name, typ);\n quote {\n $args\n $arg_to_append\n }\n },\n );\n\n let (fn_name_str, _) = fn_name.as_str_quote();\n let fn_name_len: u32 = unquote!(quote { $fn_name_str.as_bytes().len()});\n let fn_selector: Field = compute_fn_selector(f);\n\n (\n fn_name, fn_parameters_list, serialized_args_slice_construction, fn_name_str, fn_name_len,\n fn_selector,\n )\n}\n\ncomptime fn create_private_stub(f: FunctionDefinition) -> Quoted {\n let (fn_name, fn_parameters_list, serialized_args_slice_construction, fn_name_str, fn_name_len, fn_selector) =\n create_stub_base(f);\n let fn_return_type = f.return_type();\n\n quote {\n pub fn $fn_name(self, $fn_parameters_list) -> dep::aztec::context::call_interfaces::PrivateCallInterface<$fn_name_len, $fn_return_type> {\n $serialized_args_slice_construction\n let selector = $FROM_FIELD($fn_selector);\n dep::aztec::context::call_interfaces::PrivateCallInterface::new(\n self.target_contract,\n selector,\n $fn_name_str,\n $SERIALIZED_ARGS_SLICE_NAME,\n false\n )\n }\n }\n}\n\ncomptime fn create_private_static_stub(f: FunctionDefinition) -> Quoted {\n let (fn_name, fn_parameters_list, serialized_args_slice_construction, fn_name_str, fn_name_len, fn_selector) =\n create_stub_base(f);\n let fn_return_type = f.return_type();\n\n quote {\n pub fn $fn_name(self, $fn_parameters_list) -> dep::aztec::context::call_interfaces::PrivateStaticCallInterface<$fn_name_len, $fn_return_type> {\n $serialized_args_slice_construction\n let selector = $FROM_FIELD($fn_selector);\n dep::aztec::context::call_interfaces::PrivateStaticCallInterface::new(\n self.target_contract,\n selector,\n $fn_name_str,\n $SERIALIZED_ARGS_SLICE_NAME,\n )\n }\n }\n}\n\ncomptime fn create_private_void_stub(f: FunctionDefinition) -> Quoted {\n let (fn_name, fn_parameters_list, serialized_args_slice_construction, fn_name_str, fn_name_len, fn_selector) =\n create_stub_base(f);\n\n quote {\n pub fn $fn_name(self, $fn_parameters_list) -> dep::aztec::context::call_interfaces::PrivateVoidCallInterface<$fn_name_len> {\n $serialized_args_slice_construction\n let selector = $FROM_FIELD($fn_selector);\n dep::aztec::context::call_interfaces::PrivateVoidCallInterface::new(\n self.target_contract,\n selector,\n $fn_name_str,\n $SERIALIZED_ARGS_SLICE_NAME,\n false\n )\n }\n }\n}\n\ncomptime fn create_private_static_void_stub(f: FunctionDefinition) -> Quoted {\n let (fn_name, fn_parameters_list, serialized_args_slice_construction, fn_name_str, fn_name_len, fn_selector) =\n create_stub_base(f);\n\n quote {\n pub fn $fn_name(self, $fn_parameters_list) -> dep::aztec::context::call_interfaces::PrivateStaticVoidCallInterface<$fn_name_len> {\n $serialized_args_slice_construction\n let selector = $FROM_FIELD($fn_selector);\n dep::aztec::context::call_interfaces::PrivateStaticVoidCallInterface::new(\n self.target_contract,\n selector,\n $fn_name_str,\n serialized_args\n )\n }\n }\n}\n\ncomptime fn create_public_stub(f: FunctionDefinition) -> Quoted {\n let (fn_name, fn_parameters_list, serialized_args_slice_construction, fn_name_str, fn_name_len, fn_selector) =\n create_stub_base(f);\n let fn_return_type = f.return_type();\n\n quote {\n pub fn $fn_name(self, $fn_parameters_list) -> dep::aztec::context::call_interfaces::PublicCallInterface<$fn_name_len, $fn_return_type> {\n $serialized_args_slice_construction\n let selector = $FROM_FIELD($fn_selector);\n dep::aztec::context::call_interfaces::PublicCallInterface::new(\n self.target_contract,\n selector,\n $fn_name_str,\n $SERIALIZED_ARGS_SLICE_NAME,\n false\n )\n }\n }\n}\n\ncomptime fn create_public_static_stub(f: FunctionDefinition) -> Quoted {\n let (fn_name, fn_parameters_list, serialized_args_slice_construction, fn_name_str, fn_name_len, fn_selector) =\n create_stub_base(f);\n let fn_return_type = f.return_type();\n\n quote {\n pub fn $fn_name(self, $fn_parameters_list) -> dep::aztec::context::call_interfaces::PublicStaticCallInterface<$fn_name_len, $fn_return_type> {\n $serialized_args_slice_construction\n let selector = $FROM_FIELD($fn_selector);\n dep::aztec::context::call_interfaces::PublicStaticCallInterface::new(\n self.target_contract,\n selector,\n $fn_name_str,\n $SERIALIZED_ARGS_SLICE_NAME,\n )\n }\n }\n}\n\ncomptime fn create_public_void_stub(f: FunctionDefinition) -> Quoted {\n let (fn_name, fn_parameters_list, serialized_args_slice_construction, fn_name_str, fn_name_len, fn_selector) =\n create_stub_base(f);\n\n quote {\n pub fn $fn_name(self, $fn_parameters_list) -> dep::aztec::context::call_interfaces::PublicVoidCallInterface<$fn_name_len> {\n $serialized_args_slice_construction\n let selector = $FROM_FIELD($fn_selector);\n dep::aztec::context::call_interfaces::PublicVoidCallInterface::new(\n self.target_contract,\n selector,\n $fn_name_str,\n $SERIALIZED_ARGS_SLICE_NAME,\n false\n )\n }\n }\n}\n\ncomptime fn create_public_static_void_stub(f: FunctionDefinition) -> Quoted {\n let (fn_name, fn_parameters_list, serialized_args_slice_construction, fn_name_str, fn_name_len, fn_selector) =\n create_stub_base(f);\n\n quote {\n pub fn $fn_name(self, $fn_parameters_list) -> dep::aztec::context::call_interfaces::PublicStaticVoidCallInterface<$fn_name_len> {\n $serialized_args_slice_construction\n let selector = $FROM_FIELD($fn_selector);\n dep::aztec::context::call_interfaces::PublicStaticVoidCallInterface::new(\n self.target_contract,\n selector,\n $fn_name_str,\n serialized_args\n )\n }\n }\n}\n"
2841
- },
2842
- "119": {
2843
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/functions/utils.nr",
2844
- "source": "use crate::macros::{\n functions::{abi_export::create_fn_abi_export, call_interface_stubs::stub_fn, stub_registry},\n notes::NOTES,\n utils::{\n add_to_hasher, fn_has_noinitcheck, get_fn_visibility, is_fn_contract_library_method,\n is_fn_initializer, is_fn_internal, is_fn_private, is_fn_public, is_fn_test, is_fn_utility,\n is_fn_view, modify_fn_body, module_has_initializer, module_has_storage,\n },\n};\nuse protocol_types::meta::generate_serialize_to_fields;\nuse std::meta::type_of;\n\npub(crate) comptime fn transform_private(f: FunctionDefinition) -> Quoted {\n let fn_abi = create_fn_abi_export(f);\n let fn_stub = stub_fn(f);\n stub_registry::register(f.module(), fn_stub);\n\n // If a function is further modified as unconstrained, we throw an error\n if f.is_unconstrained() {\n let name = f.name();\n panic(\n f\"Function {name} is annotated with #[private] but marked as unconstrained, remove unconstrained keyword\",\n );\n }\n\n let module_has_initializer = module_has_initializer(f.module());\n let module_has_storage = module_has_storage(f.module());\n\n // Private functions undergo a lot of transformations from their Aztec.nr form into a circuit that can be fed to the\n // Private Kernel Circuit.\n // First we change the function signature so that it also receives `PrivateContextInputs`, which contain information\n // about the execution context (e.g. the caller).\n let original_params = f.parameters();\n f.set_parameters(&[(\n quote { inputs },\n quote { crate::context::inputs::private_context_inputs::PrivateContextInputs }.as_type(),\n )]\n .append(original_params));\n\n let mut body = f.body().as_block().unwrap();\n\n // The original params are hashed and passed to the `context` object, so that the kernel can verify we've received\n // the correct values.\n // TODO: Optimize args_hasher for small number of arguments\n let args_hasher_name = quote { args_hasher };\n let args_hasher = original_params.fold(\n quote {\n let mut $args_hasher_name = dep::aztec::hash::ArgsHasher::new();\n },\n |args_hasher, param: (Quoted, Type)| {\n let (name, typ) = param;\n let appended_arg = add_to_hasher(args_hasher_name, name, typ);\n quote {\n $args_hasher\n $appended_arg\n }\n },\n );\n\n let context_creation = quote {\n let mut context = dep::aztec::context::private_context::PrivateContext::new(inputs, dep::aztec::protocol_types::traits::Hash::hash($args_hasher_name));\n };\n\n // Modifications introduced by the different marker attributes.\n let internal_check = if is_fn_internal(f) {\n create_internal_check(f)\n } else {\n quote {}\n };\n\n let view_check = if is_fn_view(f) {\n create_view_check(f)\n } else {\n quote {}\n };\n\n let (assert_initializer, mark_as_initialized) = if is_fn_initializer(f) {\n (create_assert_correct_initializer_args(f), create_mark_as_initialized(f))\n } else {\n (quote {}, quote {})\n };\n\n let storage_init = if module_has_storage {\n quote {\n // Some functions don't access storage, but it'd be quite difficult to only inject this variable if it is\n // referenced. We instead ignore 'unused variable' warnings for it.\n #[allow(unused_variables)]\n let storage = Storage::init(&mut context);\n }\n } else {\n quote {}\n };\n\n // Initialization checks are not included in contracts that don't have initializers.\n let init_check = if module_has_initializer & !is_fn_initializer(f) & !fn_has_noinitcheck(f) {\n create_init_check(f)\n } else {\n quote {}\n };\n\n // All private functions perform message discovery, since they may need to access notes. This is slightly\n // inefficient and could be improved by only doing it once we actually attempt to read any.\n let message_discovery_call = if NOTES.len() > 0 {\n create_message_discovery_call()\n } else {\n quote {}\n };\n\n // Finally, we need to change the return type to be `PrivateCircuitPublicInputs`, which is what the Private Kernel\n // circuit expects.\n let return_value_var_name = quote { macro__returned__values };\n\n let return_value_type = f.return_type();\n let return_value = if body.len() == 0 {\n quote {}\n } else if return_value_type != type_of(()) {\n // The original return value is passed to a second args hasher which the context receives.\n let (body_without_return, last_body_expr) = body.pop_back();\n let return_value = last_body_expr.quoted();\n let return_value_assignment =\n quote { let $return_value_var_name: $return_value_type = $return_value; };\n let return_hasher_name = quote { return_hasher };\n let return_value_into_hasher =\n add_to_hasher(return_hasher_name, return_value_var_name, return_value_type);\n\n body = body_without_return;\n\n quote {\n let mut $return_hasher_name = dep::aztec::hash::ArgsHasher::new();\n $return_value_assignment\n $return_value_into_hasher\n context.set_return_hash($return_hasher_name);\n }\n } else {\n let (body_without_return, last_body_expr) = body.pop_back();\n if !last_body_expr.has_semicolon()\n & last_body_expr.as_for().is_none()\n & last_body_expr.as_assert().is_none()\n & last_body_expr.as_for_range().is_none()\n & last_body_expr.as_assert_eq().is_none()\n & last_body_expr.as_let().is_none() {\n let unused_return_value_name = f\"_{return_value_var_name}\".quoted_contents();\n body = body_without_return.push_back(\n quote { let $unused_return_value_name = $last_body_expr; }.as_expr().unwrap(),\n );\n }\n quote {}\n };\n\n let context_finish = quote { context.finish() };\n\n let to_prepend = quote {\n $args_hasher\n $context_creation\n $assert_initializer\n $init_check\n $internal_check\n $view_check\n $storage_init\n $message_discovery_call\n };\n\n let to_append = quote {\n $return_value\n $mark_as_initialized\n $context_finish\n };\n let modified_body = modify_fn_body(body, to_prepend, to_append);\n f.set_body(modified_body);\n f.set_return_type(\n quote { dep::protocol_types::abis::private_circuit_public_inputs::PrivateCircuitPublicInputs }\n .as_type(),\n );\n f.set_return_data();\n\n fn_abi\n}\n\npub(crate) comptime fn transform_public(f: FunctionDefinition) -> Quoted {\n let fn_abi = create_fn_abi_export(f);\n let fn_stub = stub_fn(f);\n stub_registry::register(f.module(), fn_stub);\n\n // If a function is further modified as unconstrained, we throw an error\n if f.is_unconstrained() {\n let name = f.name();\n panic(\n f\"Function {name} is annotated with #[public] but marked as unconstrained, remove unconstrained keyword\",\n );\n }\n\n let module_has_initializer = module_has_initializer(f.module());\n let module_has_storage = module_has_storage(f.module());\n\n // Public functions undergo a lot of transformations from their Aztec.nr form.\n let original_params = f.parameters();\n let args_len = original_params\n .map(|(name, typ): (Quoted, Type)| {\n generate_serialize_to_fields(name, typ, &[], false).0.len()\n })\n .fold(0, |acc: u32, val: u32| acc + val);\n\n // Unlike in the private case, in public the `context` does not need to receive the hash of the original params.\n let context_creation = quote {\n let mut context = dep::aztec::context::public_context::PublicContext::new(|| {\n // We start from 1 because we skip the selector for the dispatch function.\n let serialized_args : [Field; $args_len] = dep::aztec::context::public_context::calldata_copy(1, $args_len);\n dep::aztec::hash::hash_args_array(serialized_args)\n });\n };\n\n // Modifications introduced by the different marker attributes.\n let internal_check = if is_fn_internal(f) {\n create_internal_check(f)\n } else {\n quote {}\n };\n\n let view_check = if is_fn_view(f) {\n create_view_check(f)\n } else {\n quote {}\n };\n\n let (assert_initializer, mark_as_initialized) = if is_fn_initializer(f) {\n (create_assert_correct_initializer_args(f), create_mark_as_initialized(f))\n } else {\n (quote {}, quote {})\n };\n\n let storage_init = if module_has_storage {\n // Some functions don't access storage, but it'd be quite difficult to only inject this variable if it is\n // referenced. We instead ignore 'unused variable' warnings for it.\n quote {\n #[allow(unused_variables)]\n let storage = Storage::init(&mut context);\n }\n } else {\n quote {}\n };\n\n // Initialization checks are not included in contracts that don't have initializers.\n let init_check = if module_has_initializer & !fn_has_noinitcheck(f) & !is_fn_initializer(f) {\n create_init_check(f)\n } else {\n quote {}\n };\n\n let to_prepend = quote {\n $context_creation\n $assert_initializer\n $init_check\n $internal_check\n $view_check\n $storage_init\n };\n\n let to_append = quote {\n $mark_as_initialized\n };\n\n let body = f.body().as_block().unwrap();\n let modified_body = modify_fn_body(body, to_prepend, to_append);\n f.set_body(modified_body);\n\n // All public functions are automatically made unconstrained, even if they were not marked as such. This is because\n // instead of compiling into a circuit, they will compile to bytecode that will be later transpiled into AVM\n // bytecode.\n f.set_unconstrained(true);\n f.set_return_public(true);\n\n fn_abi\n}\n\npub(crate) comptime fn transform_utility(f: FunctionDefinition) {\n // Check if function is marked as unconstrained\n if !f.is_unconstrained() {\n let name = f.name();\n panic(\n f\"Function {name} is annotated with #[utility] but not marked as unconstrained, add unconstrained keyword\",\n );\n }\n\n // Create utility context\n let context_creation =\n quote { let mut context = dep::aztec::context::utility_context::UtilityContext::new(); };\n let module_has_storage = module_has_storage(f.module());\n\n // Initialize Storage if module has storage\n let storage_init = if module_has_storage {\n quote {\n // Some functions don't access storage, but it'd be quite difficult to only inject this variable if it is\n // referenced. We instead ignore 'unused variable' warnings for it.\n #[allow(unused_variables)]\n let storage = Storage::init(context);\n }\n } else {\n quote {}\n };\n\n // All utility functions perform message discovery, since they may need to access private notes that would be\n // found during this process. This is slightly inefficient and could be improved by only doing it once we actually\n // attempt to read any.\n let message_discovery_call = if NOTES.len() > 0 {\n create_message_discovery_call()\n } else {\n quote {}\n };\n\n // Inject context creation, storage initialization, and message discovery call at the beginning of the function\n // body.\n let to_prepend = quote {\n $context_creation\n $storage_init\n $message_discovery_call\n };\n let body = f.body().as_block().unwrap();\n let modified_body = modify_fn_body(body, to_prepend, quote {});\n f.set_body(modified_body);\n\n f.set_return_public(true);\n}\n\ncomptime fn create_internal_check(f: FunctionDefinition) -> Quoted {\n let name = f.name();\n let assertion_message = f\"Function {name} can only be called internally\";\n quote { assert(context.msg_sender() == context.this_address(), $assertion_message); }\n}\n\ncomptime fn create_view_check(f: FunctionDefinition) -> Quoted {\n let name = f.name();\n let assertion_message = f\"Function {name} can only be called statically\";\n if is_fn_private(f) {\n // Here `context` is of type context::PrivateContext\n quote { assert(context.inputs.call_context.is_static_call == true, $assertion_message); }\n } else {\n // Here `context` is of type context::PublicContext\n quote { assert(context.is_static_call(), $assertion_message); }\n }\n}\n\ncomptime fn create_assert_correct_initializer_args(f: FunctionDefinition) -> Quoted {\n let fn_visibility = get_fn_visibility(f);\n f\"dep::aztec::macros::functions::initialization_utils::assert_initialization_matches_address_preimage_{fn_visibility}(context);\"\n .quoted_contents()\n}\n\ncomptime fn create_mark_as_initialized(f: FunctionDefinition) -> Quoted {\n let fn_visibility = get_fn_visibility(f);\n f\"dep::aztec::macros::functions::initialization_utils::mark_as_initialized_{fn_visibility}(&mut context);\"\n .quoted_contents()\n}\n\ncomptime fn create_init_check(f: FunctionDefinition) -> Quoted {\n let fn_visibility = get_fn_visibility(f);\n f\"dep::aztec::macros::functions::initialization_utils::assert_is_initialized_{fn_visibility}(&mut context);\"\n .quoted_contents()\n}\n\n/// Injects a call to `aztec::discovery::discover_new_messages`, causing for new notes to be added to PXE and made\n/// available for the current execution.\npub(crate) comptime fn create_message_discovery_call() -> Quoted {\n quote {\n /// Safety: message discovery returns nothing and is performed solely for its side-effects. It is therefore\n /// always safe to call.\n unsafe {\n dep::aztec::discovery::discover_new_messages(\n context.this_address(),\n _compute_note_hash_and_nullifier,\n );\n };\n }\n}\n\n/// Checks if each function in the module is marked with either #[private], #[public], #[utility],\n/// #[contract_library_method], or #[test]. Non-macroified functions are not allowed in contracts.\npub(crate) comptime fn check_each_fn_macroified(m: Module) {\n for f in m.functions() {\n let name = f.name();\n if !is_fn_private(f)\n & !is_fn_public(f)\n & !is_fn_utility(f)\n & !is_fn_contract_library_method(f)\n & !is_fn_test(f) {\n panic(\n f\"Function {name} must be marked as either #[private], #[public], #[utility], #[contract_library_method], or #[test]\",\n );\n }\n }\n}\n"
2845
- },
2846
- "122": {
2847
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/storage.nr",
2848
- "source": "use std::{collections::umap::UHashMap, hash::{BuildHasherDefault, poseidon2::Poseidon2Hasher}};\n\nuse super::utils::AsStrQuote;\nuse super::utils::get_storage_size;\nuse super::utils::is_note;\n\n/// Stores a map from a module to the name of the struct that describes its storage layout.\n/// This is then used when generating a `storage_layout()` getter on the contract struct.\npub comptime mut global STORAGE_LAYOUT_NAME: UHashMap<Module, Quoted, BuildHasherDefault<Poseidon2Hasher>> =\n UHashMap::default();\n\n/// Marks a struct as the one describing the storage layout of a contract. Only a single struct in the entire contract\n/// should have this macro (or `storage_no_init`) applied to it.\n/// The contract's storage is accessed via the `storage` variable, which will will automatically be made available in\n/// all functions as an instance of the struct this macro was applied to.\npub comptime fn storage(s: TypeDefinition) -> Quoted {\n // This macro performs three things:\n // - it marks the contract as having storage, so that `macros::utils::module_has_storage` will return true and\n // functions will have the storage variable injected and initialized via the `init` function.\n // - it implements said `init` function by allocating appropriate storage slots to each state variable.\n // - it exposes the storage layout by creating a `StorageLayout` struct that is exposed via the `abi(storage)`\n // macro.\n let mut slot: u32 = 1;\n let mut storage_vars_constructors = &[];\n let mut storage_layout_fields = &[];\n let mut storage_layout_constructors = &[];\n\n // TODO(#8658): uncomment the code below to inject the Context type parameter.\n //let mut new_storage_fields = &[];\n //let context_generic = s.add_generic(\"Context\");\n for field in s.fields_as_written() {\n // FIXME: This doesn't handle field types with generics\n let (name, typ) = field;\n let (storage_field_constructor, storage_size) =\n generate_storage_field_constructor(typ, quote { $slot }, false);\n storage_vars_constructors =\n storage_vars_constructors.push_back(quote { $name: $storage_field_constructor });\n // We have `Storable` in a separate `.nr` file instead of defining it in the last quote of this function\n // because that way a dev gets a more reasonable error if he defines a struct with the same name in\n // a contract.\n storage_layout_fields =\n storage_layout_fields.push_back(quote { pub $name: dep::aztec::prelude::Storable });\n storage_layout_constructors = storage_layout_constructors.push_back(\n quote { $name: dep::aztec::prelude::Storable { slot: $slot } },\n );\n //let with_context_generic = add_context_generic(typ, context_generic);\n //println(with_context_generic);\n //new_storage_fields = new_storage_fields.push_back((name, with_context_generic ));\n slot += storage_size;\n }\n\n //s.set_fields(new_storage_fields);\n let storage_vars_constructors = storage_vars_constructors.join(quote {,});\n let storage_impl = quote {\n impl<Context> Storage<Context> {\n fn init(context: Context) -> Self {\n Self {\n $storage_vars_constructors\n }\n }\n }\n };\n\n let storage_layout_fields = storage_layout_fields.join(quote {,});\n let storage_layout_constructors = storage_layout_constructors.join(quote {,});\n\n let module = s.module();\n let module_name = module.name();\n let storage_layout_name = f\"STORAGE_LAYOUT_{module_name}\".quoted_contents();\n let (module_name_str, module_name_len) = module_name.as_str_quote();\n STORAGE_LAYOUT_NAME.insert(module, storage_layout_name);\n\n quote {\n $storage_impl\n\n pub struct StorageLayoutFields {\n $storage_layout_fields\n }\n\n pub struct StorageLayout<let N: u32> {\n pub contract_name: str<N>,\n pub fields: StorageLayoutFields\n }\n\n #[abi(storage)]\n pub global $storage_layout_name: StorageLayout<$module_name_len> = StorageLayout {\n contract_name: $module_name_str,\n fields: StorageLayoutFields { $storage_layout_constructors }\n };\n }\n}\n\n/// Same as `storage`, except the user is in charge of providing an implementation of the `init` constructor function\n/// with signature `fn init<Context>(context: Context) -> Self`, which allows for manual control of storage slot\n/// allocation. Similarly, no `StorageLayout` struct will be created.\n/// Only a single struct in the entire contract should have this macro (or `storage`) applied to it.\npub comptime fn storage_no_init(_s: TypeDefinition) {\n // All `storage` does is provide the `init` implementation, so we don't need to do anything here. Applying this\n // macro however will cause for `macros::utils::module_has_storage` to return true, resulting in the injection of\n // the `storage` variable.\n}\n\n/// Returns the expression required to initialize a state variable with a given slot, along with its serialization size,\n/// i.e. how many contiguous storage slots the variable requires.\ncomptime fn generate_storage_field_constructor(\n typ: Type,\n slot: Quoted,\n parent_is_map: bool,\n) -> (Quoted, u32) {\n assert(\n typ.as_data_type().is_some(),\n \"Storage containers must be generic structs of the form `Container<_, Context>`, or Map<Key, _, Context>\",\n );\n let (container_struct, generics) = typ.as_data_type().unwrap();\n let struct_name = container_struct.name();\n\n if is_storage_map(typ) {\n // Map state variables recursively initialize their contents - this includes nested maps.\n let (value_constructor, _) =\n generate_storage_field_constructor(generics[1], quote { slot }, true);\n (quote { $struct_name::new(context, $slot, | context, slot | { $value_constructor }) }, 1)\n } else {\n let storage_size = if parent_is_map {\n // Variables inside a map do not require contiguous slots since the map slot derivation is assumed to result\n // in slots very far away from one another.\n 1\n } else {\n let (_, container_struct_generics) = typ.as_data_type().unwrap();\n let stored_struct = container_struct_generics[0];\n\n if is_note(stored_struct) {\n // Private notes always occupy a single slot, since the slot is only used as a state variable\n // identifier.\n 1\n } else {\n get_storage_size(typ)\n }\n };\n\n // We assume below that all state variables implement `fn new<Context>(context: Context, slot: Field) -> Self`.\n (quote { $struct_name::new(context, $slot)}, storage_size)\n }\n}\n\n/// Returns true if `typ` is `state_vars::map::Map`.\ncomptime fn is_storage_map(typ: Type) -> bool {\n if typ.as_data_type().is_some() {\n let (def, generics) = typ.as_data_type().unwrap();\n let maybe_map = if (def.name() == quote { Map }) & (generics.len() == 3) {\n let maybe_key = generics[0];\n let maybe_value = generics[1];\n let maybe_context = generics[2];\n quote { crate::state_vars::map::Map<$maybe_key, $maybe_value, $maybe_context> }.as_type()\n } else {\n quote {()}.as_type()\n };\n typ == maybe_map\n } else {\n false\n }\n}\n\ncomptime fn add_context_generic(typ: Type, context_generic: Type) -> Type {\n let (def, mut generics) = typ.as_data_type().expect(\n f\"Storage containers must be generic structs of the form `Container<..., Context>`\",\n );\n let name = def.name();\n\n if is_storage_map(typ) {\n generics[generics.len() - 2] = add_context_generic(generics[1], context_generic);\n generics[generics.len() - 1] = context_generic;\n } else {\n generics[generics.len() - 1] = context_generic;\n }\n\n let generics = generics.map(|typ: Type| quote {$typ}).join(quote {,});\n quote { $name<$generics> }.as_type()\n}\n"
2849
- },
2850
- "140": {
2682
+ "134": {
2851
2683
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/call_private_function.nr",
2852
2684
  "source": "use dep::protocol_types::{\n abis::function_selector::FunctionSelector, address::AztecAddress, utils::reader::Reader,\n};\n\n#[oracle(callPrivateFunction)]\nunconstrained fn call_private_function_oracle(\n _contract_address: AztecAddress,\n _function_selector: FunctionSelector,\n _args_hash: Field,\n _start_side_effect_counter: u32,\n _is_static_call: bool,\n) -> [Field; 2] {}\n\npub unconstrained fn call_private_function_internal(\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args_hash: Field,\n start_side_effect_counter: u32,\n is_static_call: bool,\n) -> (u32, Field) {\n let fields = call_private_function_oracle(\n contract_address,\n function_selector,\n args_hash,\n start_side_effect_counter,\n is_static_call,\n );\n\n let mut reader = Reader::new(fields);\n let end_side_effect_counter = reader.read_u32();\n let returns_hash = reader.read();\n\n (end_side_effect_counter, returns_hash)\n}\n"
2853
2685
  },
2854
- "141": {
2855
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/capsules.nr",
2856
- "source": "use protocol_types::{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, let N: u32>(contract_address: AztecAddress, slot: Field, value: T)\nwhere\n T: Serialize<N>,\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() if\n/// nothing was stored at the given slot.\npub unconstrained fn load<T, let N: u32>(contract_address: AztecAddress, slot: Field) -> Option<T>\nwhere\n T: Deserialize<N>,\n{\n let serialized_option = load_oracle::<N>(contract_address, slot, 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`.\n/// Supports overlapping source and destination regions (which will result in the overlapped source values being\n/// overwritten). All copied slots must 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) {\n copy_oracle(contract_address, src_slot, dst_slot, num_entries);\n}\n\n#[oracle(storeCapsule)]\nunconstrained fn store_oracle<let N: u32>(\n contract_address: AztecAddress,\n slot: Field,\n values: [Field; N],\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 expected\n/// shape would be single, array, single.). Instead, we return the serialization and deserialize in Noir.\n#[oracle(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(deleteCapsule)]\nunconstrained fn delete_oracle(contract_address: AztecAddress, slot: Field) {}\n\n#[oracle(copyCapsule)]\nunconstrained fn copy_oracle(\n contract_address: AztecAddress,\n src_slot: Field,\n dst_slot: Field,\n num_entries: u32,\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::mock_struct::MockStruct},\n };\n use protocol_types::{address::AztecAddress, traits::{FromField, ToField}};\n\n unconstrained fn setup() -> AztecAddress {\n let env = TestEnvironment::new();\n env.contract_address()\n }\n\n global SLOT: Field = 1;\n\n #[test]\n unconstrained fn stores_and_loads() {\n let contract_address = setup();\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 #[test]\n unconstrained fn store_overwrites() {\n let contract_address = setup();\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 #[test]\n unconstrained fn loads_empty_slot() {\n let contract_address = setup();\n\n let loaded_value: Option<MockStruct> = load(contract_address, SLOT);\n assert_eq(loaded_value, Option::none());\n }\n\n #[test]\n unconstrained fn deletes_stored_value() {\n let contract_address = setup();\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 #[test]\n unconstrained fn deletes_empty_slot() {\n let contract_address = setup();\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 #[test]\n unconstrained fn copies_non_overlapping_values() {\n let contract_address = setup();\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 #[test]\n unconstrained fn copies_overlapping_values_with_src_ahead() {\n let contract_address = setup();\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 #[test]\n unconstrained fn copies_overlapping_values_with_dst_ahead() {\n let contract_address = setup();\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 #[test(should_fail_with = \"copy empty slot\")]\n unconstrained fn cannot_copy_empty_values() {\n let contract_address = setup();\n\n copy(contract_address, SLOT, SLOT, 1);\n }\n\n #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_store_other_contract() {\n let contract_address = setup();\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 #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_load_other_contract() {\n let contract_address = setup();\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 #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_delete_other_contract() {\n let contract_address = setup();\n let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n delete(other_contract_address, SLOT);\n }\n\n #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_copy_other_contract() {\n let contract_address = setup();\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"
2857
- },
2858
- "143": {
2686
+ "137": {
2859
2687
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/execution.nr",
2860
2688
  "source": "use dep::protocol_types::address::AztecAddress;\n\n#[oracle(getContractAddress)]\nunconstrained fn get_contract_address_oracle() -> AztecAddress {}\n\n#[oracle(getBlockNumber)]\nunconstrained fn get_block_number_oracle() -> u32 {}\n\n#[oracle(getChainId)]\nunconstrained fn get_chain_id_oracle() -> Field {}\n\n#[oracle(getVersion)]\nunconstrained fn get_version_oracle() -> Field {}\n\npub unconstrained fn get_contract_address() -> AztecAddress {\n get_contract_address_oracle()\n}\n\npub unconstrained fn get_block_number() -> u32 {\n get_block_number_oracle()\n}\n\npub unconstrained fn get_chain_id() -> Field {\n get_chain_id_oracle()\n}\n\npub unconstrained fn get_version() -> Field {\n get_version_oracle()\n}\n"
2861
2689
  },
2862
- "144": {
2690
+ "138": {
2863
2691
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/execution_cache.nr",
2864
2692
  "source": "/// Stores values represented as slice in execution cache to be later obtained by its hash.\npub fn store(values: [Field], hash: Field) {\n // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n // to call. When loading the values, however, the caller must check that the values are indeed the preimage.\n unsafe { store_in_execution_cache_oracle_wrapper(values, hash) };\n}\n\nunconstrained fn store_in_execution_cache_oracle_wrapper(values: [Field], hash: Field) {\n store_in_execution_cache_oracle(values, hash);\n}\n\npub unconstrained fn load<let N: u32>(hash: Field) -> [Field; N] {\n load_from_execution_cache_oracle(hash)\n}\n\n#[oracle(storeInExecutionCache)]\nunconstrained fn store_in_execution_cache_oracle(_values: [Field], _hash: Field) {}\n\n#[oracle(loadFromExecutionCache)]\nunconstrained fn load_from_execution_cache_oracle<let N: u32>(_hash: Field) -> [Field; N] {}\n"
2865
2693
  },
2866
- "152": {
2867
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/logs.nr",
2868
- "source": "use crate::discovery::MAX_LOG_CONTENT_LEN;\nuse protocol_types::{abis::event_selector::EventSelector, address::AztecAddress};\n\n/// The below only exists to broadcast the raw log, so we can provide it to the base rollup later to be constrained.\npub unconstrained fn notify_created_contract_class_log<let N: u32>(\n contract_address: AztecAddress,\n message: [Field; N],\n counter: u32,\n) {\n notify_created_contract_class_log_private_oracle(contract_address, message, counter)\n}\n\n#[oracle(notifyCreatedContractClassLog)]\nunconstrained fn notify_created_contract_class_log_private_oracle<let N: u32>(\n contract_address: AztecAddress,\n message: [Field; N],\n counter: u32,\n) {}\n\npub unconstrained fn store_private_event_log(\n contract_address: AztecAddress,\n recipient: AztecAddress,\n event_selector: EventSelector,\n log_content: BoundedVec<Field, MAX_LOG_CONTENT_LEN>,\n tx_hash: Field,\n log_index_in_tx: Field,\n) {\n store_private_event_log_oracle(\n contract_address,\n recipient,\n event_selector,\n log_content,\n tx_hash,\n log_index_in_tx,\n )\n}\n\n#[oracle(storePrivateEventLog)]\nunconstrained fn store_private_event_log_oracle(\n contract_address: AztecAddress,\n recipient: AztecAddress,\n event_selector: EventSelector,\n log_content: BoundedVec<Field, MAX_LOG_CONTENT_LEN>,\n tx_hash: Field,\n log_index_in_tx: Field,\n) {}\n"
2869
- },
2870
- "153": {
2871
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/message_discovery.nr",
2872
- "source": "use crate::discovery::private_notes::MAX_NOTE_PACKED_LEN;\nuse dep::protocol_types::{\n address::AztecAddress,\n constants::{MAX_NOTE_HASHES_PER_TX, PUBLIC_LOG_DATA_SIZE_IN_FIELDS},\n};\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 sync_notes(pending_tagged_log_array_base_slot: Field) {\n sync_notes_oracle(pending_tagged_log_array_base_slot);\n}\n\n#[oracle(syncNotes)]\nunconstrained fn sync_notes_oracle(pending_tagged_log_array_base_slot: Field) {}\n\n/// Informs PXE of a note's existence so that it can later be retrieved by the `getNotes` oracle. The note will be\n/// scoped to `contract_address`, meaning other contracts will not be able to access it unless authorized.\n///\n/// The packed note is what `getNotes` will later return. PXE indexes notes by `storage_slot`, so this value\n/// is typically used to filter notes that correspond to different state variables. `note_hash` and `nullifier` are\n/// the inner hashes, i.e. the raw hashes returned by `NoteHash::compute_note_hash` and\n/// `NoteHash::compute_nullifier`. PXE will verify that the siloed unique note hash was inserted into the tree\n/// at `tx_hash`, and will store the nullifier to later check for nullification.\n///\n/// `recipient` is the account to which the note was sent to. Other accounts will not be able to access this note (e.g.\n/// other accounts will not be able to see one another's token balance notes, even in the same PXE) unless authorized.\n///\n/// Returns true if the note was successfully delivered and added to PXE's database.\npub unconstrained fn deliver_note(\n contract_address: AztecAddress,\n storage_slot: Field,\n 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) -> bool {\n deliver_note_oracle(\n contract_address,\n storage_slot,\n nonce,\n packed_note,\n note_hash,\n nullifier,\n tx_hash,\n recipient,\n )\n}\n\n/// The contents of a public log, plus contextual information about the transaction in which the log was emitted. This\n/// is the data required in order to discover notes that are being delivered in a log.\n// TODO(#11639): this could also be used to fetch private logs, but the `BoundedVec` maximum length is that of a public\n// log.\npub struct LogWithTxData {\n pub log_content: BoundedVec<Field, PUBLIC_LOG_DATA_SIZE_IN_FIELDS>,\n pub tx_hash: Field,\n /// The array of new note hashes created by `tx_hash`\n pub unique_note_hashes_in_tx: BoundedVec<Field, MAX_NOTE_HASHES_PER_TX>,\n /// The first nullifier created by `tx_hash`\n pub first_nullifier_in_tx: Field,\n}\n\n/// Fetches a log from the node that has the corresponding `tag`. The log can be either a public or a private log, and\n/// the tag is the first field in the log's content. Returns `Option::none` if no such log exists. Throws if more than\n/// one log with that tag exists.\n/// Public logs have an extra field included at the beginning with the address of the contract that emitted them.\n// TODO(#11627): handle multiple logs with the same tag.\n// TODO(#10273): improve contract siloing of logs, don't introduce an extra field.\npub unconstrained fn get_log_by_tag(tag: Field) -> Option<LogWithTxData> {\n get_log_by_tag_oracle(tag)\n}\n\n#[oracle(deliverNote)]\nunconstrained fn deliver_note_oracle(\n contract_address: AztecAddress,\n storage_slot: Field,\n 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) -> bool {}\n\n#[oracle(getLogByTag)]\nunconstrained fn get_log_by_tag_oracle(tag: Field) -> Option<LogWithTxData> {}\n"
2873
- },
2874
- "155": {
2694
+ "149": {
2875
2695
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/notes.nr",
2876
2696
  "source": "use crate::{\n note::{note_interface::NoteType, note_metadata::NoteMetadata, retrieved_note::RetrievedNote},\n utils::array,\n};\n\nuse dep::protocol_types::{\n address::AztecAddress,\n indexed_tagging_secret::IndexedTaggingSecret,\n traits::{FromField, Packable},\n};\n\n/// Notifies the simulator that a note has been created, so that it can be returned in future read requests in the same\n/// transaction. This note should only be added to the non-volatile database if found in an actual block.\npub fn notify_created_note<let N: u32>(\n storage_slot: Field,\n note_type_id: Field,\n packed_note: [Field; N],\n note_hash: Field,\n counter: u32,\n) {\n // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n // to call.\n unsafe {\n notify_created_note_oracle_wrapper(\n storage_slot,\n note_type_id,\n packed_note,\n note_hash,\n counter,\n )\n };\n}\n\n/// Notifies the simulator that a note has been nullified, so that it is no longer returned in future read requests in\n/// the same transaction. This note should only be removed to the non-volatile database if its nullifier is found in an\n/// actual block.\npub fn notify_nullified_note(nullifier: Field, note_hash: Field, counter: u32) {\n // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe to\n // call.\n unsafe { notify_nullified_note_oracle_wrapper(nullifier, note_hash, counter) };\n}\n\n/// Notifies the simulator that a non-note nullifier has been created, so that it can be used for note nonces.\npub fn notify_created_nullifier(nullifier: Field) {\n // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe to\n // call.\n unsafe { notify_created_nullifier_oracle_wrapper(nullifier) };\n}\n\nunconstrained fn notify_created_note_oracle_wrapper<let N: u32>(\n storage_slot: Field,\n note_type_id: Field,\n packed_note: [Field; N],\n note_hash: Field,\n counter: u32,\n) {\n notify_created_note_oracle(storage_slot, note_type_id, packed_note, note_hash, counter);\n}\n\n#[oracle(notifyCreatedNote)]\nunconstrained fn notify_created_note_oracle<let N: u32>(\n _storage_slot: Field,\n _note_type_id: Field,\n _packed_note: [Field; N],\n _note_hash: Field,\n _counter: u32,\n) {}\n\nunconstrained fn notify_nullified_note_oracle_wrapper(\n nullifier: Field,\n note_hash: Field,\n counter: u32,\n) {\n notify_nullified_note_oracle(nullifier, note_hash, counter);\n}\n\n#[oracle(notifyNullifiedNote)]\nunconstrained fn notify_nullified_note_oracle(_nullifier: Field, _note_hash: Field, _counter: u32) {}\n\nunconstrained fn notify_created_nullifier_oracle_wrapper(nullifier: Field) {\n notify_created_nullifier_oracle(nullifier);\n}\n\n#[oracle(notifyCreatedNullifier)]\nunconstrained fn notify_created_nullifier_oracle(_nullifier: Field) {}\n\n#[oracle(getNotes)]\nunconstrained fn get_notes_oracle<let N: u32, let ORACLE_RETURN_FIELD_LENGTH: u32>(\n _storage_slot: Field,\n _num_selects: u8,\n _select_by_indexes: [u8; N],\n _select_by_offsets: [u8; N],\n _select_by_lengths: [u8; N],\n _select_values: [Field; N],\n _select_comparators: [u8; N],\n _sort_by_indexes: [u8; N],\n _sort_by_offsets: [u8; N],\n _sort_by_lengths: [u8; N],\n _sort_order: [u8; N],\n _limit: u32,\n _offset: u32,\n _status: u8,\n _return_size: u32,\n) -> [Field; ORACLE_RETURN_FIELD_LENGTH] {}\n\nunconstrained fn get_notes_oracle_wrapper<let N: u32, let ORACLE_RETURN_FIELD_LENGTH: u32>(\n storage_slot: Field,\n num_selects: u8,\n select_by_indexes: [u8; N],\n select_by_offsets: [u8; N],\n select_by_lengths: [u8; N],\n select_values: [Field; N],\n select_comparators: [u8; N],\n sort_by_indexes: [u8; N],\n sort_by_offsets: [u8; N],\n sort_by_lengths: [u8; N],\n sort_order: [u8; N],\n limit: u32,\n offset: u32,\n status: u8,\n) -> [Field; ORACLE_RETURN_FIELD_LENGTH] {\n // This wrapper exists to extract the ORACLE_RETURN_FIELD_LENGTH generic numeric param into a value and pass it to\n // the oracle, so that it knows how big the return array must be.\n get_notes_oracle(\n storage_slot,\n num_selects,\n select_by_indexes,\n select_by_offsets,\n select_by_lengths,\n select_values,\n select_comparators,\n sort_by_indexes,\n sort_by_offsets,\n sort_by_lengths,\n sort_order,\n limit,\n offset,\n status,\n ORACLE_RETURN_FIELD_LENGTH,\n )\n}\n\npub unconstrained fn get_notes<Note, let N: u32, let M: u32, let MAX_NOTES: u32, let ORACLE_RETURN_FIELD_LENGTH: u32>(\n storage_slot: Field,\n num_selects: u8,\n select_by_indexes: [u8; M],\n select_by_offsets: [u8; M],\n select_by_lengths: [u8; M],\n select_values: [Field; M],\n select_comparators: [u8; M],\n sort_by_indexes: [u8; M],\n sort_by_offsets: [u8; M],\n sort_by_lengths: [u8; M],\n sort_order: [u8; M],\n limit: u32,\n offset: u32,\n status: u8,\n _placeholder_fields: [Field; ORACLE_RETURN_FIELD_LENGTH], // TODO: Compute this value automatically from MAX_NOTES\n) -> [Option<RetrievedNote<Note>>; MAX_NOTES]\nwhere\n Note: NoteType + Packable<N>,\n{\n let fields: [_; ORACLE_RETURN_FIELD_LENGTH] = get_notes_oracle_wrapper(\n storage_slot,\n num_selects,\n select_by_indexes,\n select_by_offsets,\n select_by_lengths,\n select_values,\n select_comparators,\n sort_by_indexes,\n sort_by_offsets,\n sort_by_lengths,\n sort_order,\n limit,\n offset,\n status,\n );\n let num_notes = fields[0] as u32;\n let contract_address = AztecAddress::from_field(fields[1]);\n\n let mut opt_notes = [Option::none(); MAX_NOTES];\n for i in 0..opt_notes.len() {\n if i < num_notes {\n // lengths named as per typescript.\n let return_header_length: u32 = 2; // num_notes & contract_address.\n let extra_preimage_length: u32 = 2; // nonce & note_hash_counter.\n let read_offset: u32 = return_header_length + i * (N + extra_preimage_length);\n\n let maybe_nonce = fields[read_offset];\n let maybe_note_hash_counter = fields[read_offset + 1] as u32;\n let packed_note = array::subarray(fields, read_offset + 2);\n\n let note = Note::unpack(packed_note);\n let retrieved_note = RetrievedNote {\n note,\n contract_address,\n metadata: NoteMetadata::from_raw_data(maybe_note_hash_counter != 0, maybe_nonce),\n };\n\n opt_notes[i] = Option::some(retrieved_note);\n };\n }\n opt_notes\n}\n\n/// Returns true if the nullifier exists. Note that a `true` value can be constrained by proving existence of the\n/// nullifier, but a `false` value should not be relied upon since other transactions may emit this nullifier before the\n/// current transaction is included in a block. While this might seem of little use at first, certain design patterns\n/// benefit from this abstraction (see e.g. `PrivateMutable`).\npub unconstrained fn check_nullifier_exists(inner_nullifier: Field) -> bool {\n check_nullifier_exists_oracle(inner_nullifier)\n}\n\n#[oracle(checkNullifierExists)]\nunconstrained fn check_nullifier_exists_oracle(_inner_nullifier: Field) -> bool {}\n\n/// Returns the derived app tagging secret ready to be included in a log for a given sender and recipient pair,\n/// siloed for the current contract address.\npub unconstrained fn get_app_tag_as_sender(sender: AztecAddress, recipient: AztecAddress) -> Field {\n get_indexed_tagging_secret_as_sender_oracle(sender, recipient).compute_tag(recipient)\n}\n\n#[oracle(getIndexedTaggingSecretAsSender)]\nunconstrained fn get_indexed_tagging_secret_as_sender_oracle(\n _sender: AztecAddress,\n _recipient: AztecAddress,\n) -> IndexedTaggingSecret {}\n\n/// Notifies the simulator that a tag has been used in a note, and to therefore increment the associated index so that\n/// future notes get a different tag and can be discovered by the recipient.\n/// This change should only be persisted in a non-volatile database if the tagged log is found in an actual block -\n/// otherwise e.g. a reverting transaction can cause the sender to accidentally skip indices and later produce notes\n/// that are not found by the recipient.\npub fn increment_app_tagging_secret_index_as_sender(sender: AztecAddress, recipient: AztecAddress) {\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 {\n increment_app_tagging_secret_index_as_sender_wrapper(sender, recipient);\n }\n}\n\nunconstrained fn increment_app_tagging_secret_index_as_sender_wrapper(\n sender: AztecAddress,\n recipient: AztecAddress,\n) {\n increment_app_tagging_secret_index_as_sender_oracle(sender, recipient);\n}\n\n#[oracle(incrementAppTaggingSecretIndexAsSender)]\nunconstrained fn increment_app_tagging_secret_index_as_sender_oracle(\n _sender: AztecAddress,\n _recipient: AztecAddress,\n) {}\n"
2877
2697
  },
2878
- "157": {
2879
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/shared_secret.nr",
2880
- "source": "use protocol_types::{address::aztec_address::AztecAddress, point::Point};\n\n// TODO(#12656): return an app-siloed secret + document this\n#[oracle(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\n/// ephemeral public key `ephPk`. The app-siloing means that contracts cannot retrieve secrets that belong to\n/// other contracts, and therefore cannot e.g. decrypt their messages. This is an important security consideration\n/// given that both the `address` and `ephPk` are public information.\n///\n/// The shared secret `S` is computed as:\n/// `let S = (ivsk + h) * ephPk`\n/// where `ivsk + h` is the 'preaddress' i.e. the preimage of the address, also called the address secret.\n/// 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"
2698
+ "154": {
2699
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/state_vars/map.nr",
2700
+ "source": "use crate::state_vars::storage::Storage;\nuse dep::protocol_types::{storage::map::derive_storage_slot_in_map, traits::{Packable, ToField}};\n\n// docs:start:map\npub struct Map<K, V, Context> {\n context: Context,\n storage_slot: Field,\n state_var_constructor: fn(Context, Field) -> V,\n}\n// docs:end:map\n\nimpl<K, T, Context, let N: u32> Storage<N> for Map<K, T, Context>\nwhere\n T: Packable<N>,\n{\n fn get_storage_slot(self) -> Field {\n self.storage_slot\n }\n}\n\nimpl<K, V, Context> Map<K, V, Context> {\n // docs:start:new\n pub fn new(\n context: Context,\n storage_slot: Field,\n state_var_constructor: fn(Context, Field) -> V,\n ) -> Self {\n assert(storage_slot != 0, \"Storage slot 0 not allowed. Storage slots must start from 1.\");\n Map { context, storage_slot, state_var_constructor }\n }\n // docs:end:new\n\n // docs:start:at\n pub fn at(self, key: K) -> V\n where\n K: ToField,\n {\n // TODO(#1204): use a generator index for the storage slot\n let derived_storage_slot = derive_storage_slot_in_map(self.storage_slot, key);\n\n let state_var_constructor = self.state_var_constructor;\n state_var_constructor(self.context, derived_storage_slot)\n }\n // docs:end:at\n}\n"
2881
2701
  },
2882
2702
  "16": {
2883
2703
  "path": "std/embedded_curve_ops.nr",
2884
- "source": "use crate::cmp::Eq;\nuse crate::ops::arith::{Add, Neg, Sub};\n\n/// A point on the embedded elliptic curve\n/// By definition, the base field of the embedded curve is the scalar field of the proof system curve, i.e the Noir Field.\n/// x and y denotes the Weierstrass coordinates of the point, if is_infinite is false.\npub struct EmbeddedCurvePoint {\n pub x: Field,\n pub y: Field,\n pub is_infinite: bool,\n}\n\nimpl EmbeddedCurvePoint {\n /// Elliptic curve point doubling operation\n /// returns the doubled point of a point P, i.e P+P\n pub fn double(self) -> EmbeddedCurvePoint {\n embedded_curve_add(self, self)\n }\n\n /// Returns the null element of the curve; 'the point at infinity'\n pub fn point_at_infinity() -> EmbeddedCurvePoint {\n EmbeddedCurvePoint { x: 0, y: 0, is_infinite: true }\n }\n\n /// Returns the curve's generator point.\n pub fn generator() -> EmbeddedCurvePoint {\n // Generator point for the grumpkin curve (y^2 = x^3 - 17)\n EmbeddedCurvePoint {\n x: 1,\n y: 17631683881184975370165255887551781615748388533673675138860, // sqrt(-16)\n is_infinite: false,\n }\n }\n}\n\nimpl Add for EmbeddedCurvePoint {\n /// Adds two points P+Q, using the curve addition formula, and also handles point at infinity\n fn add(self, other: EmbeddedCurvePoint) -> EmbeddedCurvePoint {\n embedded_curve_add(self, other)\n }\n}\n\nimpl Sub for EmbeddedCurvePoint {\n /// Points subtraction operation, using addition and negation\n fn sub(self, other: EmbeddedCurvePoint) -> EmbeddedCurvePoint {\n self + other.neg()\n }\n}\n\nimpl Neg for EmbeddedCurvePoint {\n /// Negates a point P, i.e returns -P, by negating the y coordinate.\n /// If the point is at infinity, then the result is also at infinity.\n fn neg(self) -> EmbeddedCurvePoint {\n EmbeddedCurvePoint { x: self.x, y: -self.y, is_infinite: self.is_infinite }\n }\n}\n\nimpl Eq for EmbeddedCurvePoint {\n /// Checks whether two points are equal\n fn eq(self: Self, b: EmbeddedCurvePoint) -> bool {\n (self.is_infinite & b.is_infinite)\n | ((self.is_infinite == b.is_infinite) & (self.x == b.x) & (self.y == b.y))\n }\n}\n\n/// Scalar for the embedded curve represented as low and high limbs\n/// By definition, the scalar field of the embedded curve is base field of the proving system curve.\n/// It may not fit into a Field element, so it is represented with two Field elements; its low and high limbs.\npub struct EmbeddedCurveScalar {\n pub lo: Field,\n pub hi: Field,\n}\n\nimpl EmbeddedCurveScalar {\n pub fn new(lo: Field, hi: Field) -> Self {\n EmbeddedCurveScalar { lo, hi }\n }\n\n #[field(bn254)]\n pub fn from_field(scalar: Field) -> EmbeddedCurveScalar {\n let (a, b) = crate::field::bn254::decompose(scalar);\n EmbeddedCurveScalar { lo: a, hi: b }\n }\n\n //Bytes to scalar: take the first (after the specified offset) 16 bytes of the input as the lo value, and the next 16 bytes as the hi value\n #[field(bn254)]\n pub(crate) fn from_bytes(bytes: [u8; 64], offset: u32) -> EmbeddedCurveScalar {\n let mut v = 1;\n let mut lo = 0 as Field;\n let mut hi = 0 as Field;\n for i in 0..16 {\n lo = lo + (bytes[offset + 31 - i] as Field) * v;\n hi = hi + (bytes[offset + 15 - i] as Field) * v;\n v = v * 256;\n }\n let sig_s = crate::embedded_curve_ops::EmbeddedCurveScalar { lo, hi };\n sig_s\n }\n}\n\nimpl Eq for EmbeddedCurveScalar {\n fn eq(self, other: Self) -> bool {\n (other.hi == self.hi) & (other.lo == self.lo)\n }\n}\n\n// Computes a multi scalar multiplication over the embedded curve.\n// For bn254, We have Grumpkin and Baby JubJub.\n// For bls12-381, we have JubJub and Bandersnatch.\n//\n// The embedded curve being used is decided by the\n// underlying proof system.\n// docs:start:multi_scalar_mul\npub fn multi_scalar_mul<let N: u32>(\n points: [EmbeddedCurvePoint; N],\n scalars: [EmbeddedCurveScalar; N],\n) -> EmbeddedCurvePoint\n// docs:end:multi_scalar_mul\n{\n let point_array = multi_scalar_mul_array_return(points, scalars);\n EmbeddedCurvePoint { x: point_array[0], y: point_array[1], is_infinite: point_array[2] as bool }\n}\n\n#[foreign(multi_scalar_mul)]\npub(crate) fn multi_scalar_mul_array_return<let N: u32>(\n points: [EmbeddedCurvePoint; N],\n scalars: [EmbeddedCurveScalar; N],\n) -> [Field; 3] {}\n\n// docs:start:fixed_base_scalar_mul\npub fn fixed_base_scalar_mul(scalar: EmbeddedCurveScalar) -> EmbeddedCurvePoint\n// docs:end:fixed_base_scalar_mul\n{\n multi_scalar_mul([EmbeddedCurvePoint::generator()], [scalar])\n}\n\n/// This function only assumes that the points are on the curve\n/// It handles corner cases around the infinity point causing some overhead compared to embedded_curve_add_not_nul and embedded_curve_add_unsafe\n// docs:start:embedded_curve_add\npub fn embedded_curve_add(\n point1: EmbeddedCurvePoint,\n point2: EmbeddedCurvePoint,\n) -> EmbeddedCurvePoint {\n // docs:end:embedded_curve_add\n if crate::runtime::is_unconstrained() {\n embedded_curve_add_unsafe(point1, point2)\n } else {\n // In a constrained context we need to do some black magic in order to satisfy the backend's\n // expectations about the inputs to an `embedded_curve_add` opcode.\n //\n // TODO: document this better.\n let x_coordinates_match = point1.x == point2.x;\n let y_coordinates_match = point1.y == point2.y;\n let double_predicate = (x_coordinates_match & y_coordinates_match);\n let infinity_predicate = (x_coordinates_match & !y_coordinates_match);\n let point1_1 = EmbeddedCurvePoint {\n x: point1.x + (x_coordinates_match as Field),\n y: point1.y,\n is_infinite: x_coordinates_match,\n };\n // point1_1 is guaranteed to have a different abscissa than point2\n let mut result = embedded_curve_add_unsafe(point1_1, point2);\n result.is_infinite = x_coordinates_match;\n\n // dbl if x_match, y_match\n let double = embedded_curve_add_unsafe(point1, point1);\n result = if double_predicate { double } else { result };\n\n // infinity if x_match, !y_match\n if point1.is_infinite {\n result = point2;\n }\n if point2.is_infinite {\n result = point1;\n }\n let mut result_is_infinity =\n infinity_predicate & (!point1.is_infinite & !point2.is_infinite);\n result.is_infinite = result_is_infinity | (point1.is_infinite & point2.is_infinite);\n result\n }\n}\n\n#[foreign(embedded_curve_add)]\nfn embedded_curve_add_array_return(\n _point1: EmbeddedCurvePoint,\n _point2: EmbeddedCurvePoint,\n) -> [Field; 3] {}\n\n/// This function assumes that:\n/// The points are on the curve, and\n/// The points don't share an x-coordinate, and\n/// Neither point is the infinity point.\n/// If it is used with correct input, the function ensures the correct non-zero result is returned.\n/// Except for points on the curve, the other assumptions are checked by the function. It will cause assertion failure if they are not respected.\npub fn embedded_curve_add_not_nul(\n point1: EmbeddedCurvePoint,\n point2: EmbeddedCurvePoint,\n) -> EmbeddedCurvePoint {\n assert(point1.x != point2.x);\n assert(!point1.is_infinite);\n assert(!point2.is_infinite);\n embedded_curve_add_unsafe(point1, point2)\n}\n\n/// Unsafe ec addition\n/// If the inputs are the same, it will perform a doubling, but only if point1 and point2 are the same variable.\n/// If they have the same value but are different variables, the result will be incorrect because in this case\n/// it assumes (but does not check) that the points' x-coordinates are not equal.\n/// It also assumes neither point is the infinity point.\npub fn embedded_curve_add_unsafe(\n point1: EmbeddedCurvePoint,\n point2: EmbeddedCurvePoint,\n) -> EmbeddedCurvePoint {\n let point_array = embedded_curve_add_array_return(point1, point2);\n let x = point_array[0];\n let y = point_array[1];\n\n EmbeddedCurvePoint { x, y, is_infinite: false }\n}\n"
2704
+ "source": "use crate::cmp::Eq;\nuse crate::hash::Hash;\nuse crate::ops::arith::{Add, Neg, Sub};\n\n/// A point on the embedded elliptic curve\n/// By definition, the base field of the embedded curve is the scalar field of the proof system curve, i.e the Noir Field.\n/// x and y denotes the Weierstrass coordinates of the point, if is_infinite is false.\npub struct EmbeddedCurvePoint {\n pub x: Field,\n pub y: Field,\n pub is_infinite: bool,\n}\n\nimpl EmbeddedCurvePoint {\n /// Elliptic curve point doubling operation\n /// returns the doubled point of a point P, i.e P+P\n pub fn double(self) -> EmbeddedCurvePoint {\n embedded_curve_add(self, self)\n }\n\n /// Returns the null element of the curve; 'the point at infinity'\n pub fn point_at_infinity() -> EmbeddedCurvePoint {\n EmbeddedCurvePoint { x: 0, y: 0, is_infinite: true }\n }\n\n /// Returns the curve's generator point.\n pub fn generator() -> EmbeddedCurvePoint {\n // Generator point for the grumpkin curve (y^2 = x^3 - 17)\n EmbeddedCurvePoint {\n x: 1,\n y: 17631683881184975370165255887551781615748388533673675138860, // sqrt(-16)\n is_infinite: false,\n }\n }\n}\n\nimpl Add for EmbeddedCurvePoint {\n /// Adds two points P+Q, using the curve addition formula, and also handles point at infinity\n fn add(self, other: EmbeddedCurvePoint) -> EmbeddedCurvePoint {\n embedded_curve_add(self, other)\n }\n}\n\nimpl Sub for EmbeddedCurvePoint {\n /// Points subtraction operation, using addition and negation\n fn sub(self, other: EmbeddedCurvePoint) -> EmbeddedCurvePoint {\n self + other.neg()\n }\n}\n\nimpl Neg for EmbeddedCurvePoint {\n /// Negates a point P, i.e returns -P, by negating the y coordinate.\n /// If the point is at infinity, then the result is also at infinity.\n fn neg(self) -> EmbeddedCurvePoint {\n EmbeddedCurvePoint { x: self.x, y: -self.y, is_infinite: self.is_infinite }\n }\n}\n\nimpl Eq for EmbeddedCurvePoint {\n /// Checks whether two points are equal\n fn eq(self: Self, b: EmbeddedCurvePoint) -> bool {\n (self.is_infinite & b.is_infinite)\n | ((self.is_infinite == b.is_infinite) & (self.x == b.x) & (self.y == b.y))\n }\n}\n\nimpl Hash for EmbeddedCurvePoint {\n fn hash<H>(self, state: &mut H)\n where\n H: crate::hash::Hasher,\n {\n if self.is_infinite {\n self.is_infinite.hash(state);\n } else {\n self.x.hash(state);\n self.y.hash(state);\n }\n }\n}\n\n/// Scalar for the embedded curve represented as low and high limbs\n/// By definition, the scalar field of the embedded curve is base field of the proving system curve.\n/// It may not fit into a Field element, so it is represented with two Field elements; its low and high limbs.\npub struct EmbeddedCurveScalar {\n pub lo: Field,\n pub hi: Field,\n}\n\nimpl EmbeddedCurveScalar {\n pub fn new(lo: Field, hi: Field) -> Self {\n EmbeddedCurveScalar { lo, hi }\n }\n\n #[field(bn254)]\n pub fn from_field(scalar: Field) -> EmbeddedCurveScalar {\n let (a, b) = crate::field::bn254::decompose(scalar);\n EmbeddedCurveScalar { lo: a, hi: b }\n }\n\n //Bytes to scalar: take the first (after the specified offset) 16 bytes of the input as the lo value, and the next 16 bytes as the hi value\n #[field(bn254)]\n pub(crate) fn from_bytes(bytes: [u8; 64], offset: u32) -> EmbeddedCurveScalar {\n let mut v = 1;\n let mut lo = 0 as Field;\n let mut hi = 0 as Field;\n for i in 0..16 {\n lo = lo + (bytes[offset + 31 - i] as Field) * v;\n hi = hi + (bytes[offset + 15 - i] as Field) * v;\n v = v * 256;\n }\n let sig_s = crate::embedded_curve_ops::EmbeddedCurveScalar { lo, hi };\n sig_s\n }\n}\n\nimpl Eq for EmbeddedCurveScalar {\n fn eq(self, other: Self) -> bool {\n (other.hi == self.hi) & (other.lo == self.lo)\n }\n}\n\nimpl Hash for EmbeddedCurveScalar {\n fn hash<H>(self, state: &mut H)\n where\n H: crate::hash::Hasher,\n {\n self.hi.hash(state);\n self.lo.hash(state);\n }\n}\n\n// Computes a multi scalar multiplication over the embedded curve.\n// For bn254, We have Grumpkin and Baby JubJub.\n// For bls12-381, we have JubJub and Bandersnatch.\n//\n// The embedded curve being used is decided by the\n// underlying proof system.\n// docs:start:multi_scalar_mul\npub fn multi_scalar_mul<let N: u32>(\n points: [EmbeddedCurvePoint; N],\n scalars: [EmbeddedCurveScalar; N],\n) -> EmbeddedCurvePoint\n// docs:end:multi_scalar_mul\n{\n multi_scalar_mul_array_return(points, scalars)[0]\n}\n\n#[foreign(multi_scalar_mul)]\npub(crate) fn multi_scalar_mul_array_return<let N: u32>(\n points: [EmbeddedCurvePoint; N],\n scalars: [EmbeddedCurveScalar; N],\n) -> [EmbeddedCurvePoint; 1] {}\n\n// docs:start:fixed_base_scalar_mul\npub fn fixed_base_scalar_mul(scalar: EmbeddedCurveScalar) -> EmbeddedCurvePoint\n// docs:end:fixed_base_scalar_mul\n{\n multi_scalar_mul([EmbeddedCurvePoint::generator()], [scalar])\n}\n\n/// This function only assumes that the points are on the curve\n/// It handles corner cases around the infinity point causing some overhead compared to embedded_curve_add_not_nul and embedded_curve_add_unsafe\n// docs:start:embedded_curve_add\npub fn embedded_curve_add(\n point1: EmbeddedCurvePoint,\n point2: EmbeddedCurvePoint,\n) -> EmbeddedCurvePoint {\n // docs:end:embedded_curve_add\n if crate::runtime::is_unconstrained() {\n // `embedded_curve_add_unsafe` requires the inputs not to be the infinity point, so we check it here.\n // This is because `embedded_curve_add_unsafe` uses the `embedded_curve_add` opcode.\n // For efficiency, the backend does not check the inputs for the infinity point, but it assumes that they are not the infinity point\n // so that it can apply the ec addition formula directly.\n if point1.is_infinite {\n point2\n } else if point2.is_infinite {\n point1\n } else {\n embedded_curve_add_unsafe(point1, point2)\n }\n } else {\n // In a constrained context, we also need to check the inputs are not the infinity point because we also use `embedded_curve_add_unsafe`\n // However we also need to identify the case where the two inputs are the same, because then\n // the addition formula does not work and we need to use the doubling formula instead.\n // In unconstrained context, we can check directly if the input values are the same when solving the opcode, so it is not an issue.\n\n // x_coordinates_match is true if both abscissae are the same\n let x_coordinates_match = point1.x == point2.x;\n // y_coordinates_match is true if both ordinates are the same\n let y_coordinates_match = point1.y == point2.y;\n // double_predicate is true if both abscissae and ordinates are the same\n let double_predicate = (x_coordinates_match & y_coordinates_match);\n // If the abscissae are the same, but not the ordinates, then one point is the opposite of the other\n let infinity_predicate = (x_coordinates_match & !y_coordinates_match);\n let point1_1 = EmbeddedCurvePoint {\n x: point1.x + (x_coordinates_match as Field),\n y: point1.y,\n is_infinite: x_coordinates_match,\n };\n // point1_1 is guaranteed to have a different abscissa than point2:\n // - if x_coordinates_match is 0, that means point1.x != point2.x, and point1_1.x = point1.x + 0\n // - if x_coordinates_match is 1, that means point1.x = point2.x, but point1_1.x = point1.x + 1 in this case\n // Because the abscissa is different, the addition formula is guaranteed to succeed, so we can safely use `embedded_curve_add_unsafe`\n // Note that this computation may be garbage: if x_coordinates_match is 1, or if one of the input is the point at infinity.\n let mut result = embedded_curve_add_unsafe(point1_1, point2);\n\n // `embedded_curve_add_unsafe` is doing a doubling if the input is the same variable, because in this case it is guaranteed (at 'compile time') that the input is the same.\n let double = embedded_curve_add_unsafe(point1, point1);\n // `embedded_curve_add_unsafe` would not perform doubling, even if the inputs point1 and point2 are the same, because it cannot know this without adding some logic (and some constraints)\n // However we did this logic when we computed `double_predicate`, so we set the result to 2*point1 if point1 and point2 are the same\n result = if double_predicate { double } else { result };\n\n // Same logic as above for unconstrained context, we set the proper result when one of the inputs is the infinity point\n if point1.is_infinite {\n result = point2;\n }\n if point2.is_infinite {\n result = point1;\n }\n\n // Finally, we set the is_infinity flag of the result:\n // Opposite points should sum into the infinity point, however, if one of them is point at infinity, their coordinates are not meaningful\n // so we should not use the fact that the inputs are opposite in this case:\n let mut result_is_infinity =\n infinity_predicate & (!point1.is_infinite & !point2.is_infinite);\n // However, if both of them are at infinity, then the result is also at infinity\n result.is_infinite = result_is_infinity | (point1.is_infinite & point2.is_infinite);\n result\n }\n}\n\n#[foreign(embedded_curve_add)]\nfn embedded_curve_add_array_return(\n _point1: EmbeddedCurvePoint,\n _point2: EmbeddedCurvePoint,\n) -> [EmbeddedCurvePoint; 1] {}\n\n/// This function assumes that:\n/// The points are on the curve, and\n/// The points don't share an x-coordinate, and\n/// Neither point is the infinity point.\n/// If it is used with correct input, the function ensures the correct non-zero result is returned.\n/// Except for points on the curve, the other assumptions are checked by the function. It will cause assertion failure if they are not respected.\npub fn embedded_curve_add_not_nul(\n point1: EmbeddedCurvePoint,\n point2: EmbeddedCurvePoint,\n) -> EmbeddedCurvePoint {\n assert(point1.x != point2.x);\n assert(!point1.is_infinite);\n assert(!point2.is_infinite);\n embedded_curve_add_unsafe(point1, point2)\n}\n\n/// Unsafe ec addition\n/// If the inputs are the same, it will perform a doubling, but only if point1 and point2 are the same variable.\n/// If they have the same value but are different variables, the result will be incorrect because in this case\n/// it assumes (but does not check) that the points' x-coordinates are not equal.\n/// It also assumes neither point is the infinity point.\npub fn embedded_curve_add_unsafe(\n point1: EmbeddedCurvePoint,\n point2: EmbeddedCurvePoint,\n) -> EmbeddedCurvePoint {\n embedded_curve_add_array_return(point1, point2)[0]\n}\n"
2885
2705
  },
2886
- "160": {
2887
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/state_vars/map.nr",
2888
- "source": "use crate::state_vars::storage::Storage;\nuse dep::protocol_types::{storage::map::derive_storage_slot_in_map, traits::{Packable, ToField}};\n\n// docs:start:map\npub struct Map<K, V, Context> {\n context: Context,\n storage_slot: Field,\n state_var_constructor: fn(Context, Field) -> V,\n}\n// docs:end:map\n\nimpl<K, T, Context, let N: u32> Storage<N> for Map<K, T, Context>\nwhere\n T: Packable<N>,\n{\n fn get_storage_slot(self) -> Field {\n self.storage_slot\n }\n}\n\nimpl<K, V, Context> Map<K, V, Context> {\n // docs:start:new\n pub fn new(\n context: Context,\n storage_slot: Field,\n state_var_constructor: fn(Context, Field) -> V,\n ) -> Self {\n assert(storage_slot != 0, \"Storage slot 0 not allowed. Storage slots must start from 1.\");\n Map { context, storage_slot, state_var_constructor }\n }\n // docs:end:new\n\n // docs:start:at\n pub fn at(self, key: K) -> V\n where\n K: ToField,\n {\n // TODO(#1204): use a generator index for the storage slot\n let derived_storage_slot = derive_storage_slot_in_map(self.storage_slot, key);\n\n let state_var_constructor = self.state_var_constructor;\n state_var_constructor(self.context, derived_storage_slot)\n }\n // docs:end:at\n}\n"
2706
+ "165": {
2707
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/state_vars/shared_mutable.nr",
2708
+ "source": "use dep::protocol_types::{\n shared_mutable::{\n ScheduledDelayChange,\n ScheduledValueChange,\n shared_mutable_values::{unpack_delay_change, unpack_value_change},\n SharedMutableValues,\n },\n traits::Packable,\n};\n\nuse crate::{\n context::{PrivateContext, PublicContext, UtilityContext},\n state_vars::storage::Storage,\n utils::with_hash::WithHash,\n};\n\nmod test;\n\npub struct SharedMutable<T, let INITIAL_DELAY: u32, Context> {\n context: Context,\n storage_slot: Field,\n}\n\n// This will make the Aztec macros require that T implements the Packable and Eq traits, and allocate `M` storage\n// slots to this state variable.\nimpl<T, let INITIAL_DELAY: u32, Context, let M: u32> Storage<M> for SharedMutable<T, INITIAL_DELAY, Context>\nwhere\n WithHash<SharedMutableValues<T, INITIAL_DELAY>, _>: Packable<M>,\n{\n fn get_storage_slot(self) -> Field {\n self.storage_slot\n }\n}\n\n// SharedMutable<T> stores a value of type T that is:\n// - publicly known (i.e. unencrypted)\n// - mutable in public\n// - readable in private with no contention (i.e. multiple parties can all read the same value without blocking one\n// another nor needing to coordinate)\n// This is famously a hard problem to solve. SharedMutable makes it work by introducing a delay to public mutation:\n// the value is not changed immediately but rather a value change is scheduled to happen in the future after some delay\n// measured in blocks. Reads in private are only valid as long as they are included in a block not too far into the\n// future, so that they can guarantee the value will not have possibly changed by then (because of the delay).\n// The delay for changing a value is initially equal to INITIAL_DELAY, but can be changed by calling\n// `schedule_delay_change`.\nimpl<T, let INITIAL_DELAY: u32, Context> SharedMutable<T, INITIAL_DELAY, Context> {\n pub fn new(context: Context, storage_slot: Field) -> Self {\n assert(storage_slot != 0, \"Storage slot 0 not allowed. Storage slots must start from 1.\");\n Self { context, storage_slot }\n }\n}\n\nimpl<T, let INITIAL_DELAY: u32> SharedMutable<T, INITIAL_DELAY, &mut PublicContext>\nwhere\n T: Eq,\n{\n\n pub fn schedule_value_change<let N: u32>(self, new_value: T)\n where\n T: Packable<N>,\n {\n let _value_change = self.schedule_and_return_value_change(new_value);\n }\n\n pub fn schedule_and_return_value_change<let N: u32>(\n self,\n new_value: T,\n ) -> ScheduledValueChange<T>\n where\n T: Packable<N>,\n {\n let mut value_change = self.read_value_change();\n let delay_change = self.read_delay_change();\n\n let block_number = self.context.block_number() as u32;\n let current_delay = delay_change.get_current(block_number);\n\n // TODO: make this configurable\n // https://github.com/AztecProtocol/aztec-packages/issues/5501\n let block_of_change = block_number + current_delay;\n value_change.schedule_change(new_value, block_number, current_delay, block_of_change);\n\n self.write(value_change, delay_change);\n\n value_change\n }\n\n pub fn schedule_delay_change<let N: u32>(self, new_delay: u32)\n where\n T: Packable<N>,\n {\n let mut delay_change = self.read_delay_change();\n\n let block_number = self.context.block_number() as u32;\n\n delay_change.schedule_change(new_delay, block_number);\n\n self.write(self.read_value_change(), delay_change);\n }\n\n pub fn get_current_value<let N: u32>(self) -> T\n where\n T: Packable<N>,\n {\n let block_number = self.context.block_number() as u32;\n self.read_value_change().get_current_at(block_number)\n }\n\n pub fn get_current_delay<let N: u32>(self) -> u32\n where\n T: Packable<N>,\n {\n let block_number = self.context.block_number() as u32;\n self.read_delay_change().get_current(block_number)\n }\n\n pub fn get_scheduled_value<let N: u32>(self) -> (T, u32)\n where\n T: Packable<N>,\n {\n self.read_value_change().get_scheduled()\n }\n\n pub fn get_scheduled_delay<let N: u32>(self) -> (u32, u32)\n where\n T: Packable<N>,\n {\n self.read_delay_change().get_scheduled()\n }\n\n fn read_value_change<let N: u32>(self) -> ScheduledValueChange<T>\n where\n T: Packable<N>,\n {\n // We don't read ScheduledValueChange directly by having it implement Packable because ScheduledValueChange\n // and ScheduledDelayChange are packed together (sdc and svc.block_of_change are stored in the same slot).\n let packed = self.context.storage_read(self.storage_slot);\n unpack_value_change::<T, N>(packed)\n }\n\n fn read_delay_change<let N: u32>(self) -> ScheduledDelayChange<INITIAL_DELAY>\n where\n T: Packable<N>,\n {\n // Since all ScheduledDelayChange member are packed into a single field, we can read a single storage slot\n // here and skip the ones that correspond to ScheduledValueChange members. We are abusing the fact that\n // the field containing the ScheduledDelayChange data is the first one in the storage layout - otherwise we'd\n // need to offset the storage slot to get the position where it'd land.\n // We don't read ScheduledDelayChange directly by having it implement Packable because\n // ScheduledValueChange and ScheduledDelayChange are packed together (sdc and svc.block_of_change are\n // stored in the same slot).\n let packed = self.context.storage_read(self.storage_slot);\n unpack_delay_change::<INITIAL_DELAY>(packed)\n }\n\n fn write<let N: u32>(\n self,\n value_change: ScheduledValueChange<T>,\n delay_change: ScheduledDelayChange<INITIAL_DELAY>,\n )\n where\n T: Packable<N>,\n {\n // Whenever we write to public storage, we write both the value change and delay change to storage at once.\n // We do so by wrapping them in a single struct (`SharedMutableValues`). Then we wrap the resulting struct in\n // `WithHash`.\n // Wrapping in `WithHash` makes for more costly writes but it also makes private proofs much simpler because\n // they only need to produce a historical proof for the hash, which results in a single inclusion proof (as\n // opposed to 4 in the best case scenario in which T is a single field). Private shared mutable reads are\n // assumed to be much more frequent than public writes, so this tradeoff makes sense.\n let values = WithHash::new(SharedMutableValues::new(value_change, delay_change));\n\n self.context.storage_write(self.storage_slot, values);\n }\n}\n\nimpl<T, let INITIAL_DELAY: u32> SharedMutable<T, INITIAL_DELAY, &mut PrivateContext>\nwhere\n T: Eq,\n{\n pub fn get_current_value<let N: u32>(self) -> T\n where\n T: Packable<N>,\n {\n // When reading the current value in private we construct a historical state proof for the public value.\n // However, since this value might change, we must constrain the maximum transaction block number as this proof\n // will only be valid for however many blocks we can ensure the value will not change, which will depend on the\n // current delay and any scheduled delay changes.\n let (value_change, delay_change, historical_block_number) =\n self.historical_read_from_public_storage();\n\n // We use the effective minimum delay as opposed to the current delay at the historical block as this one also\n // takes into consideration any scheduled delay changes.\n // For example, consider a scenario in which at block 200 the current delay was 50. We may naively think that\n // the earliest we could change the value would be at block 251 by scheduling immediately after the historical\n // block, i.e. at block 201. But if there was a delay change scheduled for block 210 to reduce the delay to 20\n // blocks, then if a value change was scheduled at block 210 it would go into effect at block 230, which is\n // earlier than what we'd expect if we only considered the current delay.\n let effective_minimum_delay =\n delay_change.get_effective_minimum_delay_at(historical_block_number);\n let block_horizon =\n value_change.get_block_horizon(historical_block_number, effective_minimum_delay);\n\n // We prevent this transaction from being included in any block after the block horizon, ensuring that the\n // historical public value matches the current one, since it can only change after the horizon.\n self.context.set_tx_max_block_number(block_horizon);\n value_change.get_current_at(historical_block_number)\n }\n\n fn historical_read_from_public_storage<let N: u32>(\n self,\n ) -> (ScheduledValueChange<T>, ScheduledDelayChange<INITIAL_DELAY>, u32)\n where\n T: Packable<N>,\n {\n let header = self.context.get_block_header();\n let address = self.context.this_address();\n\n let historical_block_number = header.global_variables.block_number as u32;\n\n let values: SharedMutableValues<T, INITIAL_DELAY> =\n WithHash::historical_public_storage_read(header, address, self.storage_slot);\n\n (values.svc, values.sdc, historical_block_number)\n }\n}\n\nimpl<T, let INITIAL_DELAY: u32> SharedMutable<T, INITIAL_DELAY, UtilityContext>\nwhere\n T: Eq,\n{\n pub unconstrained fn get_current_value<let N: u32>(self) -> T\n where\n T: Packable<N>,\n {\n let smv: SharedMutableValues<T, INITIAL_DELAY> =\n WithHash::utility_public_storage_read(self.context, self.storage_slot);\n\n let block_number = self.context.block_number() as u32;\n smv.svc.get_current_at(block_number)\n }\n}\n"
2889
2709
  },
2890
2710
  "17": {
2891
2711
  "path": "std/field/bn254.nr",
2892
- "source": "use crate::field::field_less_than;\nuse crate::runtime::is_unconstrained;\n\n// The low and high decomposition of the field modulus\nglobal PLO: Field = 53438638232309528389504892708671455233;\nglobal PHI: Field = 64323764613183177041862057485226039389;\n\npub(crate) global TWO_POW_128: Field = 0x100000000000000000000000000000000;\nglobal TWO_POW_64: Field = 0x10000000000000000;\n\n// Decomposes a single field into two 16 byte fields.\nfn compute_decomposition(mut x: Field) -> (Field, Field) {\n // Here's we're taking advantage of truncating 64 bit limbs from the input field\n // and then subtracting them from the input such the field division is equivalent to integer division.\n let low_lower_64 = (x as u64) as Field;\n x = (x - low_lower_64) / TWO_POW_64;\n let low_upper_64 = (x as u64) as Field;\n\n let high = (x - low_upper_64) / TWO_POW_64;\n let low = low_upper_64 * TWO_POW_64 + low_lower_64;\n\n (low, high)\n}\n\npub(crate) unconstrained fn decompose_hint(x: Field) -> (Field, Field) {\n compute_decomposition(x)\n}\n\nunconstrained fn lte_hint(x: Field, y: Field) -> bool {\n if x == y {\n true\n } else {\n field_less_than(x, y)\n }\n}\n\n// Assert that (alo > blo && ahi >= bhi) || (alo <= blo && ahi > bhi)\nfn assert_gt_limbs(a: (Field, Field), b: (Field, Field)) {\n let (alo, ahi) = a;\n let (blo, bhi) = b;\n // Safety: borrow is enforced to be boolean due to its type.\n // if borrow is 0, it asserts that (alo > blo && ahi >= bhi)\n // if borrow is 1, it asserts that (alo <= blo && ahi > bhi)\n unsafe {\n let borrow = lte_hint(alo, blo);\n\n let rlo = alo - blo - 1 + (borrow as Field) * TWO_POW_128;\n let rhi = ahi - bhi - (borrow as Field);\n\n rlo.assert_max_bit_size::<128>();\n rhi.assert_max_bit_size::<128>();\n }\n}\n\n/// Decompose a single field into two 16 byte fields.\npub fn decompose(x: Field) -> (Field, Field) {\n if is_unconstrained() {\n compute_decomposition(x)\n } else {\n // Safety: decomposition is properly checked below\n unsafe {\n // Take hints of the decomposition\n let (xlo, xhi) = decompose_hint(x);\n\n // Range check the limbs\n xlo.assert_max_bit_size::<128>();\n xhi.assert_max_bit_size::<128>();\n\n // Check that the decomposition is correct\n assert_eq(x, xlo + TWO_POW_128 * xhi);\n\n // Assert that the decomposition of P is greater than the decomposition of x\n assert_gt_limbs((PLO, PHI), (xlo, xhi));\n (xlo, xhi)\n }\n }\n}\n\npub fn assert_gt(a: Field, b: Field) {\n if is_unconstrained() {\n assert(\n // Safety: already unconstrained\n unsafe { field_less_than(b, a) },\n );\n } else {\n // Decompose a and b\n let a_limbs = decompose(a);\n let b_limbs = decompose(b);\n\n // Assert that a_limbs is greater than b_limbs\n assert_gt_limbs(a_limbs, b_limbs)\n }\n}\n\npub fn assert_lt(a: Field, b: Field) {\n assert_gt(b, a);\n}\n\npub fn gt(a: Field, b: Field) -> bool {\n if is_unconstrained() {\n // Safety: unsafe in unconstrained\n unsafe {\n field_less_than(b, a)\n }\n } else if a == b {\n false\n } else {\n // Safety: Take a hint of the comparison and verify it\n unsafe {\n if field_less_than(a, b) {\n assert_gt(b, a);\n false\n } else {\n assert_gt(a, b);\n true\n }\n }\n }\n}\n\npub fn lt(a: Field, b: Field) -> bool {\n gt(b, a)\n}\n\nmod tests {\n // TODO: Allow imports from \"super\"\n use crate::field::bn254::{assert_gt, decompose, gt, lte_hint, PHI, PLO, TWO_POW_128};\n\n #[test]\n fn check_decompose() {\n assert_eq(decompose(TWO_POW_128), (0, 1));\n assert_eq(decompose(TWO_POW_128 + 0x1234567890), (0x1234567890, 1));\n assert_eq(decompose(0x1234567890), (0x1234567890, 0));\n }\n\n #[test]\n unconstrained fn check_decompose_unconstrained() {\n assert_eq(decompose(TWO_POW_128), (0, 1));\n assert_eq(decompose(TWO_POW_128 + 0x1234567890), (0x1234567890, 1));\n assert_eq(decompose(0x1234567890), (0x1234567890, 0));\n }\n\n #[test]\n unconstrained fn check_lte_hint() {\n assert(lte_hint(0, 1));\n assert(lte_hint(0, 0x100));\n assert(lte_hint(0x100, TWO_POW_128 - 1));\n assert(!lte_hint(0 - 1, 0));\n\n assert(lte_hint(0, 0));\n assert(lte_hint(0x100, 0x100));\n assert(lte_hint(0 - 1, 0 - 1));\n }\n\n #[test]\n fn check_assert_gt() {\n assert_gt(1, 0);\n assert_gt(0x100, 0);\n assert_gt((0 - 1), (0 - 2));\n assert_gt(TWO_POW_128, 0);\n assert_gt(0 - 1, 0);\n }\n\n #[test]\n unconstrained fn check_assert_gt_unconstrained() {\n assert_gt(1, 0);\n assert_gt(0x100, 0);\n assert_gt((0 - 1), (0 - 2));\n assert_gt(TWO_POW_128, 0);\n assert_gt(0 - 1, 0);\n }\n\n #[test]\n fn check_gt() {\n assert(gt(1, 0));\n assert(gt(0x100, 0));\n assert(gt((0 - 1), (0 - 2)));\n assert(gt(TWO_POW_128, 0));\n assert(!gt(0, 0));\n assert(!gt(0, 0x100));\n assert(gt(0 - 1, 0 - 2));\n assert(!gt(0 - 2, 0 - 1));\n }\n\n #[test]\n unconstrained fn check_gt_unconstrained() {\n assert(gt(1, 0));\n assert(gt(0x100, 0));\n assert(gt((0 - 1), (0 - 2)));\n assert(gt(TWO_POW_128, 0));\n assert(!gt(0, 0));\n assert(!gt(0, 0x100));\n assert(gt(0 - 1, 0 - 2));\n assert(!gt(0 - 2, 0 - 1));\n }\n\n #[test]\n fn check_plo_phi() {\n assert_eq(PLO + PHI * TWO_POW_128, 0);\n let p_bytes = crate::field::modulus_le_bytes();\n let mut p_low: Field = 0;\n let mut p_high: Field = 0;\n\n let mut offset = 1;\n for i in 0..16 {\n p_low += (p_bytes[i] as Field) * offset;\n p_high += (p_bytes[i + 16] as Field) * offset;\n offset *= 256;\n }\n assert_eq(p_low, PLO);\n assert_eq(p_high, PHI);\n }\n}\n"
2893
- },
2894
- "171": {
2895
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/state_vars/shared_mutable.nr",
2896
- "source": "use dep::protocol_types::{\n shared_mutable::{\n ScheduledDelayChange,\n ScheduledValueChange,\n shared_mutable_values::{unpack_delay_change, unpack_value_change},\n SharedMutableValues,\n },\n traits::Packable,\n};\n\nuse crate::{\n context::{PrivateContext, PublicContext, UtilityContext},\n state_vars::storage::Storage,\n utils::with_hash::WithHash,\n};\n\nmod test;\n\npub struct SharedMutable<T, let INITIAL_DELAY: u32, Context> {\n context: Context,\n storage_slot: Field,\n}\n\n// This will make the Aztec macros require that T implements the Packable and Eq traits, and allocate `M` storage\n// slots to this state variable.\nimpl<T, let INITIAL_DELAY: u32, Context, let M: u32> Storage<M> for SharedMutable<T, INITIAL_DELAY, Context>\nwhere\n WithHash<SharedMutableValues<T, INITIAL_DELAY>, _>: Packable<M>,\n{\n fn get_storage_slot(self) -> Field {\n self.storage_slot\n }\n}\n\n// SharedMutable<T> stores a value of type T that is:\n// - publicly known (i.e. unencrypted)\n// - mutable in public\n// - readable in private with no contention (i.e. multiple parties can all read the same value without blocking one\n// another nor needing to coordinate)\n// This is famously a hard problem to solve. SharedMutable makes it work by introducing a delay to public mutation:\n// the value is not changed immediately but rather a value change is scheduled to happen in the future after some delay\n// measured in blocks. Reads in private are only valid as long as they are included in a block not too far into the\n// future, so that they can guarantee the value will not have possibly changed by then (because of the delay).\n// The delay for changing a value is initially equal to INITIAL_DELAY, but can be changed by calling\n// `schedule_delay_change`.\nimpl<T, let INITIAL_DELAY: u32, Context> SharedMutable<T, INITIAL_DELAY, Context> {\n pub fn new(context: Context, storage_slot: Field) -> Self {\n assert(storage_slot != 0, \"Storage slot 0 not allowed. Storage slots must start from 1.\");\n Self { context, storage_slot }\n }\n}\n\nimpl<T, let INITIAL_DELAY: u32> SharedMutable<T, INITIAL_DELAY, &mut PublicContext>\nwhere\n T: Eq,\n{\n\n pub fn schedule_value_change<let N: u32>(self, new_value: T)\n where\n T: Packable<N>,\n {\n let _value_change = self.schedule_and_return_value_change(new_value);\n }\n\n pub fn schedule_and_return_value_change<let N: u32>(\n self,\n new_value: T,\n ) -> ScheduledValueChange<T>\n where\n T: Packable<N>,\n {\n let mut value_change = self.read_value_change();\n let delay_change = self.read_delay_change();\n\n let block_number = self.context.block_number() as u32;\n let current_delay = delay_change.get_current(block_number);\n\n // TODO: make this configurable\n // https://github.com/AztecProtocol/aztec-packages/issues/5501\n let block_of_change = block_number + current_delay;\n value_change.schedule_change(new_value, block_number, current_delay, block_of_change);\n\n self.write(value_change, delay_change);\n\n value_change\n }\n\n pub fn schedule_delay_change<let N: u32>(self, new_delay: u32)\n where\n T: Packable<N>,\n {\n let mut delay_change = self.read_delay_change();\n\n let block_number = self.context.block_number() as u32;\n\n delay_change.schedule_change(new_delay, block_number);\n\n self.write(self.read_value_change(), delay_change);\n }\n\n pub fn get_current_value<let N: u32>(self) -> T\n where\n T: Packable<N>,\n {\n let block_number = self.context.block_number() as u32;\n self.read_value_change().get_current_at(block_number)\n }\n\n pub fn get_current_delay<let N: u32>(self) -> u32\n where\n T: Packable<N>,\n {\n let block_number = self.context.block_number() as u32;\n self.read_delay_change().get_current(block_number)\n }\n\n pub fn get_scheduled_value<let N: u32>(self) -> (T, u32)\n where\n T: Packable<N>,\n {\n self.read_value_change().get_scheduled()\n }\n\n pub fn get_scheduled_delay<let N: u32>(self) -> (u32, u32)\n where\n T: Packable<N>,\n {\n self.read_delay_change().get_scheduled()\n }\n\n fn read_value_change<let N: u32>(self) -> ScheduledValueChange<T>\n where\n T: Packable<N>,\n {\n // We don't read ScheduledValueChange directly by having it implement Packable because ScheduledValueChange\n // and ScheduledDelayChange are packed together (sdc and svc.block_of_change are stored in the same slot).\n let packed = self.context.storage_read(self.storage_slot);\n unpack_value_change::<T, N>(packed)\n }\n\n fn read_delay_change<let N: u32>(self) -> ScheduledDelayChange<INITIAL_DELAY>\n where\n T: Packable<N>,\n {\n // Since all ScheduledDelayChange member are packed into a single field, we can read a single storage slot\n // here and skip the ones that correspond to ScheduledValueChange members. We are abusing the fact that\n // the field containing the ScheduledDelayChange data is the first one in the storage layout - otherwise we'd\n // need to offset the storage slot to get the position where it'd land.\n // We don't read ScheduledDelayChange directly by having it implement Packable because\n // ScheduledValueChange and ScheduledDelayChange are packed together (sdc and svc.block_of_change are\n // stored in the same slot).\n let packed = self.context.storage_read(self.storage_slot);\n unpack_delay_change::<INITIAL_DELAY>(packed)\n }\n\n fn write<let N: u32>(\n self,\n value_change: ScheduledValueChange<T>,\n delay_change: ScheduledDelayChange<INITIAL_DELAY>,\n )\n where\n T: Packable<N>,\n {\n // Whenever we write to public storage, we write both the value change and delay change to storage at once.\n // We do so by wrapping them in a single struct (`SharedMutableValues`). Then we wrap the resulting struct in\n // `WithHash`.\n // Wrapping in `WithHash` makes for more costly writes but it also makes private proofs much simpler because\n // they only need to produce a historical proof for the hash, which results in a single inclusion proof (as\n // opposed to 4 in the best case scenario in which T is a single field). Private shared mutable reads are\n // assumed to be much more frequent than public writes, so this tradeoff makes sense.\n let values = WithHash::new(SharedMutableValues::new(value_change, delay_change));\n\n self.context.storage_write(self.storage_slot, values);\n }\n}\n\nimpl<T, let INITIAL_DELAY: u32> SharedMutable<T, INITIAL_DELAY, &mut PrivateContext>\nwhere\n T: Eq,\n{\n pub fn get_current_value<let N: u32>(self) -> T\n where\n T: Packable<N>,\n {\n // When reading the current value in private we construct a historical state proof for the public value.\n // However, since this value might change, we must constrain the maximum transaction block number as this proof\n // will only be valid for however many blocks we can ensure the value will not change, which will depend on the\n // current delay and any scheduled delay changes.\n let (value_change, delay_change, historical_block_number) =\n self.historical_read_from_public_storage();\n\n // We use the effective minimum delay as opposed to the current delay at the historical block as this one also\n // takes into consideration any scheduled delay changes.\n // For example, consider a scenario in which at block 200 the current delay was 50. We may naively think that\n // the earliest we could change the value would be at block 251 by scheduling immediately after the historical\n // block, i.e. at block 201. But if there was a delay change scheduled for block 210 to reduce the delay to 20\n // blocks, then if a value change was scheduled at block 210 it would go into effect at block 230, which is\n // earlier than what we'd expect if we only considered the current delay.\n let effective_minimum_delay =\n delay_change.get_effective_minimum_delay_at(historical_block_number);\n let block_horizon =\n value_change.get_block_horizon(historical_block_number, effective_minimum_delay);\n\n // We prevent this transaction from being included in any block after the block horizon, ensuring that the\n // historical public value matches the current one, since it can only change after the horizon.\n self.context.set_tx_max_block_number(block_horizon);\n value_change.get_current_at(historical_block_number)\n }\n\n fn historical_read_from_public_storage<let N: u32>(\n self,\n ) -> (ScheduledValueChange<T>, ScheduledDelayChange<INITIAL_DELAY>, u32)\n where\n T: Packable<N>,\n {\n let header = self.context.get_block_header();\n let address = self.context.this_address();\n\n let historical_block_number = header.global_variables.block_number as u32;\n\n let values: SharedMutableValues<T, INITIAL_DELAY> =\n WithHash::historical_public_storage_read(header, address, self.storage_slot);\n\n (values.svc, values.sdc, historical_block_number)\n }\n}\n\nimpl<T, let INITIAL_DELAY: u32> SharedMutable<T, INITIAL_DELAY, UtilityContext>\nwhere\n T: Eq,\n{\n pub unconstrained fn get_current_value<let N: u32>(self) -> T\n where\n T: Packable<N>,\n {\n let smv: SharedMutableValues<T, INITIAL_DELAY> =\n WithHash::utility_public_storage_read(self.context, self.storage_slot);\n\n let block_number = self.context.block_number() as u32;\n smv.svc.get_current_at(block_number)\n }\n}\n"
2712
+ "source": "use crate::field::field_less_than;\nuse crate::runtime::is_unconstrained;\n\n// The low and high decomposition of the field modulus\nglobal PLO: Field = 53438638232309528389504892708671455233;\nglobal PHI: Field = 64323764613183177041862057485226039389;\n\npub(crate) global TWO_POW_128: Field = 0x100000000000000000000000000000000;\n\n// Decomposes a single field into two 16 byte fields.\nfn compute_decomposition(x: Field) -> (Field, Field) {\n // Here's we're taking advantage of truncating 128 bit limbs from the input field\n // and then subtracting them from the input such the field division is equivalent to integer division.\n let low = (x as u128) as Field;\n let high = (x - low) / TWO_POW_128;\n\n (low, high)\n}\n\npub(crate) unconstrained fn decompose_hint(x: Field) -> (Field, Field) {\n compute_decomposition(x)\n}\n\nunconstrained fn lte_hint(x: Field, y: Field) -> bool {\n if x == y {\n true\n } else {\n field_less_than(x, y)\n }\n}\n\n// Assert that (alo > blo && ahi >= bhi) || (alo <= blo && ahi > bhi)\nfn assert_gt_limbs(a: (Field, Field), b: (Field, Field)) {\n let (alo, ahi) = a;\n let (blo, bhi) = b;\n // Safety: borrow is enforced to be boolean due to its type.\n // if borrow is 0, it asserts that (alo > blo && ahi >= bhi)\n // if borrow is 1, it asserts that (alo <= blo && ahi > bhi)\n unsafe {\n let borrow = lte_hint(alo, blo);\n\n let rlo = alo - blo - 1 + (borrow as Field) * TWO_POW_128;\n let rhi = ahi - bhi - (borrow as Field);\n\n rlo.assert_max_bit_size::<128>();\n rhi.assert_max_bit_size::<128>();\n }\n}\n\n/// Decompose a single field into two 16 byte fields.\npub fn decompose(x: Field) -> (Field, Field) {\n if is_unconstrained() {\n compute_decomposition(x)\n } else {\n // Safety: decomposition is properly checked below\n unsafe {\n // Take hints of the decomposition\n let (xlo, xhi) = decompose_hint(x);\n\n // Range check the limbs\n xlo.assert_max_bit_size::<128>();\n xhi.assert_max_bit_size::<128>();\n\n // Check that the decomposition is correct\n assert_eq(x, xlo + TWO_POW_128 * xhi);\n\n // Assert that the decomposition of P is greater than the decomposition of x\n assert_gt_limbs((PLO, PHI), (xlo, xhi));\n (xlo, xhi)\n }\n }\n}\n\npub fn assert_gt(a: Field, b: Field) {\n if is_unconstrained() {\n assert(\n // Safety: already unconstrained\n unsafe { field_less_than(b, a) },\n );\n } else {\n // Decompose a and b\n let a_limbs = decompose(a);\n let b_limbs = decompose(b);\n\n // Assert that a_limbs is greater than b_limbs\n assert_gt_limbs(a_limbs, b_limbs)\n }\n}\n\npub fn assert_lt(a: Field, b: Field) {\n assert_gt(b, a);\n}\n\npub fn gt(a: Field, b: Field) -> bool {\n if is_unconstrained() {\n // Safety: unsafe in unconstrained\n unsafe {\n field_less_than(b, a)\n }\n } else if a == b {\n false\n } else {\n // Safety: Take a hint of the comparison and verify it\n unsafe {\n if field_less_than(a, b) {\n assert_gt(b, a);\n false\n } else {\n assert_gt(a, b);\n true\n }\n }\n }\n}\n\npub fn lt(a: Field, b: Field) -> bool {\n gt(b, a)\n}\n\nmod tests {\n // TODO: Allow imports from \"super\"\n use crate::field::bn254::{assert_gt, decompose, gt, lte_hint, PHI, PLO, TWO_POW_128};\n\n #[test]\n fn check_decompose() {\n assert_eq(decompose(TWO_POW_128), (0, 1));\n assert_eq(decompose(TWO_POW_128 + 0x1234567890), (0x1234567890, 1));\n assert_eq(decompose(0x1234567890), (0x1234567890, 0));\n }\n\n #[test]\n unconstrained fn check_decompose_unconstrained() {\n assert_eq(decompose(TWO_POW_128), (0, 1));\n assert_eq(decompose(TWO_POW_128 + 0x1234567890), (0x1234567890, 1));\n assert_eq(decompose(0x1234567890), (0x1234567890, 0));\n }\n\n #[test]\n unconstrained fn check_lte_hint() {\n assert(lte_hint(0, 1));\n assert(lte_hint(0, 0x100));\n assert(lte_hint(0x100, TWO_POW_128 - 1));\n assert(!lte_hint(0 - 1, 0));\n\n assert(lte_hint(0, 0));\n assert(lte_hint(0x100, 0x100));\n assert(lte_hint(0 - 1, 0 - 1));\n }\n\n #[test]\n fn check_assert_gt() {\n assert_gt(1, 0);\n assert_gt(0x100, 0);\n assert_gt((0 - 1), (0 - 2));\n assert_gt(TWO_POW_128, 0);\n assert_gt(0 - 1, 0);\n }\n\n #[test]\n unconstrained fn check_assert_gt_unconstrained() {\n assert_gt(1, 0);\n assert_gt(0x100, 0);\n assert_gt((0 - 1), (0 - 2));\n assert_gt(TWO_POW_128, 0);\n assert_gt(0 - 1, 0);\n }\n\n #[test]\n fn check_gt() {\n assert(gt(1, 0));\n assert(gt(0x100, 0));\n assert(gt((0 - 1), (0 - 2)));\n assert(gt(TWO_POW_128, 0));\n assert(!gt(0, 0));\n assert(!gt(0, 0x100));\n assert(gt(0 - 1, 0 - 2));\n assert(!gt(0 - 2, 0 - 1));\n }\n\n #[test]\n unconstrained fn check_gt_unconstrained() {\n assert(gt(1, 0));\n assert(gt(0x100, 0));\n assert(gt((0 - 1), (0 - 2)));\n assert(gt(TWO_POW_128, 0));\n assert(!gt(0, 0));\n assert(!gt(0, 0x100));\n assert(gt(0 - 1, 0 - 2));\n assert(!gt(0 - 2, 0 - 1));\n }\n\n #[test]\n fn check_plo_phi() {\n assert_eq(PLO + PHI * TWO_POW_128, 0);\n let p_bytes = crate::field::modulus_le_bytes();\n let mut p_low: Field = 0;\n let mut p_high: Field = 0;\n\n let mut offset = 1;\n for i in 0..16 {\n p_low += (p_bytes[i] as Field) * offset;\n p_high += (p_bytes[i + 16] as Field) * offset;\n offset *= 256;\n }\n assert_eq(p_low, PLO);\n assert_eq(p_high, PHI);\n }\n}\n"
2897
2713
  },
2898
2714
  "18": {
2899
2715
  "path": "std/field/mod.nr",
2900
2716
  "source": "pub mod bn254;\nuse crate::{runtime::is_unconstrained, static_assert};\nuse bn254::lt as bn254_lt;\n\nimpl Field {\n /// Asserts that `self` can be represented in `bit_size` bits.\n ///\n /// # Failures\n /// Causes a constraint failure for `Field` values exceeding `2^{bit_size}`.\n // docs:start:assert_max_bit_size\n pub fn assert_max_bit_size<let BIT_SIZE: u32>(self) {\n // docs:end:assert_max_bit_size\n static_assert(\n BIT_SIZE < modulus_num_bits() as u32,\n \"BIT_SIZE must be less than modulus_num_bits\",\n );\n self.__assert_max_bit_size(BIT_SIZE);\n }\n\n #[builtin(apply_range_constraint)]\n fn __assert_max_bit_size(self, bit_size: u32) {}\n\n /// Decomposes `self` into its little endian bit decomposition as a `[u1; N]` array.\n /// This slice will be zero padded should not all bits be necessary to represent `self`.\n ///\n /// # Failures\n /// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting slice will not\n /// be able to represent the original `Field`.\n ///\n /// # Safety\n /// Values of `N` equal to or greater than the number of bits necessary to represent the `Field` modulus\n /// (e.g. 254 for the BN254 field) allow for multiple bit decompositions. This is due to how the `Field` will\n /// wrap around due to overflow when verifying the decomposition.\n #[builtin(to_le_bits)]\n fn _to_le_bits<let N: u32>(self: Self) -> [u1; N] {}\n\n /// Decomposes `self` into its big endian bit decomposition as a `[u1; N]` array.\n /// This array will be zero padded should not all bits be necessary to represent `self`.\n ///\n /// # Failures\n /// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting slice will not\n /// be able to represent the original `Field`.\n ///\n /// # Safety\n /// Values of `N` equal to or greater than the number of bits necessary to represent the `Field` modulus\n /// (e.g. 254 for the BN254 field) allow for multiple bit decompositions. This is due to how the `Field` will\n /// wrap around due to overflow when verifying the decomposition.\n #[builtin(to_be_bits)]\n fn _to_be_bits<let N: u32>(self: Self) -> [u1; N] {}\n\n /// Decomposes `self` into its little endian bit decomposition as a `[u1; N]` array.\n /// This slice will be zero padded should not all bits be necessary to represent `self`.\n ///\n /// # Failures\n /// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting slice will not\n /// be able to represent the original `Field`.\n ///\n /// # Safety\n /// The bit decomposition returned is canonical and is guaranteed to not overflow the modulus.\n // docs:start:to_le_bits\n pub fn to_le_bits<let N: u32>(self: Self) -> [u1; N] {\n // docs:end:to_le_bits\n let bits = self._to_le_bits();\n\n if !is_unconstrained() {\n // Ensure that the byte decomposition does not overflow the modulus\n let p = modulus_le_bits();\n assert(bits.len() <= p.len());\n let mut ok = bits.len() != p.len();\n for i in 0..N {\n if !ok {\n if (bits[N - 1 - i] != p[N - 1 - i]) {\n assert(p[N - 1 - i] == 1);\n ok = true;\n }\n }\n }\n assert(ok);\n }\n bits\n }\n\n /// Decomposes `self` into its big endian bit decomposition as a `[u1; N]` array.\n /// This array will be zero padded should not all bits be necessary to represent `self`.\n ///\n /// # Failures\n /// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting slice will not\n /// be able to represent the original `Field`.\n ///\n /// # Safety\n /// The bit decomposition returned is canonical and is guaranteed to not overflow the modulus.\n // docs:start:to_be_bits\n pub fn to_be_bits<let N: u32>(self: Self) -> [u1; N] {\n // docs:end:to_be_bits\n let bits = self._to_be_bits();\n\n if !is_unconstrained() {\n // Ensure that the decomposition does not overflow the modulus\n let p = modulus_be_bits();\n assert(bits.len() <= p.len());\n let mut ok = bits.len() != p.len();\n for i in 0..N {\n if !ok {\n if (bits[i] != p[i]) {\n assert(p[i] == 1);\n ok = true;\n }\n }\n }\n assert(ok);\n }\n bits\n }\n\n /// Decomposes `self` into its little endian byte decomposition as a `[u8;N]` array\n /// This array will be zero padded should not all bytes be necessary to represent `self`.\n ///\n /// # Failures\n /// The length N of the array must be big enough to contain all the bytes of the 'self',\n /// and no more than the number of bytes required to represent the field modulus\n ///\n /// # Safety\n /// The result is ensured to be the canonical decomposition of the field element\n // docs:start:to_le_bytes\n pub fn to_le_bytes<let N: u32>(self: Self) -> [u8; N] {\n // docs:end:to_le_bytes\n static_assert(\n N <= modulus_le_bytes().len(),\n \"N must be less than or equal to modulus_le_bytes().len()\",\n );\n // Compute the byte decomposition\n let bytes = self.to_le_radix(256);\n\n if !is_unconstrained() {\n // Ensure that the byte decomposition does not overflow the modulus\n let p = modulus_le_bytes();\n assert(bytes.len() <= p.len());\n let mut ok = bytes.len() != p.len();\n for i in 0..N {\n if !ok {\n if (bytes[N - 1 - i] != p[N - 1 - i]) {\n assert(bytes[N - 1 - i] < p[N - 1 - i]);\n ok = true;\n }\n }\n }\n assert(ok);\n }\n bytes\n }\n\n /// Decomposes `self` into its big endian byte decomposition as a `[u8;N]` array of length required to represent the field modulus\n /// This array will be zero padded should not all bytes be necessary to represent `self`.\n ///\n /// # Failures\n /// The length N of the array must be big enough to contain all the bytes of the 'self',\n /// and no more than the number of bytes required to represent the field modulus\n ///\n /// # Safety\n /// The result is ensured to be the canonical decomposition of the field element\n // docs:start:to_be_bytes\n pub fn to_be_bytes<let N: u32>(self: Self) -> [u8; N] {\n // docs:end:to_be_bytes\n static_assert(\n N <= modulus_le_bytes().len(),\n \"N must be less than or equal to modulus_le_bytes().len()\",\n );\n // Compute the byte decomposition\n let bytes = self.to_be_radix(256);\n\n if !is_unconstrained() {\n // Ensure that the byte decomposition does not overflow the modulus\n let p = modulus_be_bytes();\n assert(bytes.len() <= p.len());\n let mut ok = bytes.len() != p.len();\n for i in 0..N {\n if !ok {\n if (bytes[i] != p[i]) {\n assert(bytes[i] < p[i]);\n ok = true;\n }\n }\n }\n assert(ok);\n }\n bytes\n }\n\n // docs:start:to_le_radix\n pub fn to_le_radix<let N: u32>(self: Self, radix: u32) -> [u8; N] {\n // Brillig does not need an immediate radix\n if !crate::runtime::is_unconstrained() {\n static_assert(1 < radix, \"radix must be greater than 1\");\n static_assert(radix <= 256, \"radix must be less than or equal to 256\");\n static_assert(radix & (radix - 1) == 0, \"radix must be a power of 2\");\n }\n self.__to_le_radix(radix)\n }\n // docs:end:to_le_radix\n\n // docs:start:to_be_radix\n pub fn to_be_radix<let N: u32>(self: Self, radix: u32) -> [u8; N] {\n // Brillig does not need an immediate radix\n if !crate::runtime::is_unconstrained() {\n crate::assert_constant(radix);\n }\n self.__to_be_radix(radix)\n }\n // docs:end:to_be_radix\n\n // `_radix` must be less than 256\n #[builtin(to_le_radix)]\n fn __to_le_radix<let N: u32>(self, radix: u32) -> [u8; N] {}\n\n // `_radix` must be less than 256\n #[builtin(to_be_radix)]\n fn __to_be_radix<let N: u32>(self, radix: u32) -> [u8; N] {}\n\n // Returns self to the power of the given exponent value.\n // Caution: we assume the exponent fits into 32 bits\n // using a bigger bit size impacts negatively the performance and should be done only if the exponent does not fit in 32 bits\n pub fn pow_32(self, exponent: Field) -> Field {\n let mut r: Field = 1;\n let b: [u1; 32] = exponent.to_le_bits();\n\n for i in 1..33 {\n r *= r;\n r = (b[32 - i] as Field) * (r * self) + (1 - b[32 - i] as Field) * r;\n }\n r\n }\n\n // Parity of (prime) Field element, i.e. sgn0(x mod p) = 0 if x `elem` {0, ..., p-1} is even, otherwise sgn0(x mod p) = 1.\n pub fn sgn0(self) -> u1 {\n self as u1\n }\n\n pub fn lt(self, another: Field) -> bool {\n if crate::compat::is_bn254() {\n bn254_lt(self, another)\n } else {\n lt_fallback(self, another)\n }\n }\n\n /// Convert a little endian byte array to a field element.\n /// If the provided byte array overflows the field modulus then the Field will silently wrap around.\n pub fn from_le_bytes<let N: u32>(bytes: [u8; N]) -> Field {\n static_assert(\n N <= modulus_le_bytes().len(),\n \"N must be less than or equal to modulus_le_bytes().len()\",\n );\n let mut v = 1;\n let mut result = 0;\n\n for i in 0..N {\n result += (bytes[i] as Field) * v;\n v = v * 256;\n }\n result\n }\n\n /// Convert a big endian byte array to a field element.\n /// If the provided byte array overflows the field modulus then the Field will silently wrap around.\n pub fn from_be_bytes<let N: u32>(bytes: [u8; N]) -> Field {\n let mut v = 1;\n let mut result = 0;\n\n for i in 0..N {\n result += (bytes[N - 1 - i] as Field) * v;\n v = v * 256;\n }\n result\n }\n}\n\n#[builtin(modulus_num_bits)]\npub comptime fn modulus_num_bits() -> u64 {}\n\n#[builtin(modulus_be_bits)]\npub comptime fn modulus_be_bits() -> [u1] {}\n\n#[builtin(modulus_le_bits)]\npub comptime fn modulus_le_bits() -> [u1] {}\n\n#[builtin(modulus_be_bytes)]\npub comptime fn modulus_be_bytes() -> [u8] {}\n\n#[builtin(modulus_le_bytes)]\npub comptime fn modulus_le_bytes() -> [u8] {}\n\n/// An unconstrained only built in to efficiently compare fields.\n#[builtin(field_less_than)]\nunconstrained fn __field_less_than(x: Field, y: Field) -> bool {}\n\npub(crate) unconstrained fn field_less_than(x: Field, y: Field) -> bool {\n __field_less_than(x, y)\n}\n\n// Convert a 32 byte array to a field element by modding\npub fn bytes32_to_field(bytes32: [u8; 32]) -> Field {\n // Convert it to a field element\n let mut v = 1;\n let mut high = 0 as Field;\n let mut low = 0 as Field;\n\n for i in 0..16 {\n high = high + (bytes32[15 - i] as Field) * v;\n low = low + (bytes32[16 + 15 - i] as Field) * v;\n v = v * 256;\n }\n // Abuse that a % p + b % p = (a + b) % p and that low < p\n low + high * v\n}\n\nfn lt_fallback(x: Field, y: Field) -> bool {\n if is_unconstrained() {\n // Safety: unconstrained context\n unsafe {\n field_less_than(x, y)\n }\n } else {\n let x_bytes: [u8; 32] = x.to_le_bytes();\n let y_bytes: [u8; 32] = y.to_le_bytes();\n let mut x_is_lt = false;\n let mut done = false;\n for i in 0..32 {\n if (!done) {\n let x_byte = x_bytes[32 - 1 - i] as u8;\n let y_byte = y_bytes[32 - 1 - i] as u8;\n let bytes_match = x_byte == y_byte;\n if !bytes_match {\n x_is_lt = x_byte < y_byte;\n done = true;\n }\n }\n }\n x_is_lt\n }\n}\n\nmod tests {\n use crate::{panic::panic, runtime};\n use super::field_less_than;\n\n #[test]\n // docs:start:to_be_bits_example\n fn test_to_be_bits() {\n let field = 2;\n let bits: [u1; 8] = field.to_be_bits();\n assert_eq(bits, [0, 0, 0, 0, 0, 0, 1, 0]);\n }\n // docs:end:to_be_bits_example\n\n #[test]\n // docs:start:to_le_bits_example\n fn test_to_le_bits() {\n let field = 2;\n let bits: [u1; 8] = field.to_le_bits();\n assert_eq(bits, [0, 1, 0, 0, 0, 0, 0, 0]);\n }\n // docs:end:to_le_bits_example\n\n #[test]\n // docs:start:to_be_bytes_example\n fn test_to_be_bytes() {\n let field = 2;\n let bytes: [u8; 8] = field.to_be_bytes();\n assert_eq(bytes, [0, 0, 0, 0, 0, 0, 0, 2]);\n assert_eq(Field::from_be_bytes::<8>(bytes), field);\n }\n // docs:end:to_be_bytes_example\n\n #[test]\n // docs:start:to_le_bytes_example\n fn test_to_le_bytes() {\n let field = 2;\n let bytes: [u8; 8] = field.to_le_bytes();\n assert_eq(bytes, [2, 0, 0, 0, 0, 0, 0, 0]);\n assert_eq(Field::from_le_bytes::<8>(bytes), field);\n }\n // docs:end:to_le_bytes_example\n\n #[test]\n // docs:start:to_be_radix_example\n fn test_to_be_radix() {\n // 259, in base 256, big endian, is [1, 3].\n // i.e. 3 * 256^0 + 1 * 256^1\n let field = 259;\n\n // The radix (in this example, 256) must be a power of 2.\n // The length of the returned byte array can be specified to be\n // >= the amount of space needed.\n let bytes: [u8; 8] = field.to_be_radix(256);\n assert_eq(bytes, [0, 0, 0, 0, 0, 0, 1, 3]);\n assert_eq(Field::from_be_bytes::<8>(bytes), field);\n }\n // docs:end:to_be_radix_example\n\n #[test]\n // docs:start:to_le_radix_example\n fn test_to_le_radix() {\n // 259, in base 256, little endian, is [3, 1].\n // i.e. 3 * 256^0 + 1 * 256^1\n let field = 259;\n\n // The radix (in this example, 256) must be a power of 2.\n // The length of the returned byte array can be specified to be\n // >= the amount of space needed.\n let bytes: [u8; 8] = field.to_le_radix(256);\n assert_eq(bytes, [3, 1, 0, 0, 0, 0, 0, 0]);\n assert_eq(Field::from_le_bytes::<8>(bytes), field);\n }\n // docs:end:to_le_radix_example\n\n #[test(should_fail_with = \"radix must be greater than 1\")]\n fn test_to_le_radix_1() {\n // this test should only fail in constrained mode\n if !runtime::is_unconstrained() {\n let field = 2;\n let _: [u8; 8] = field.to_le_radix(1);\n } else {\n panic(f\"radix must be greater than 1\");\n }\n }\n\n // TODO: Update this test to account for the Brillig restriction that the radix must be greater than 2\n //#[test]\n //fn test_to_le_radix_brillig_1() {\n // // this test should only fail in constrained mode\n // if runtime::is_unconstrained() {\n // let field = 1;\n // let out: [u8; 8] = field.to_le_radix(1);\n // crate::println(out);\n // let expected = [0; 8];\n // assert(out == expected, \"unexpected result\");\n // }\n //}\n\n #[test(should_fail_with = \"radix must be a power of 2\")]\n fn test_to_le_radix_3() {\n // this test should only fail in constrained mode\n if !runtime::is_unconstrained() {\n let field = 2;\n let _: [u8; 8] = field.to_le_radix(3);\n } else {\n panic(f\"radix must be a power of 2\");\n }\n }\n\n #[test]\n fn test_to_le_radix_brillig_3() {\n // this test should only fail in constrained mode\n if runtime::is_unconstrained() {\n let field = 1;\n let out: [u8; 8] = field.to_le_radix(3);\n let mut expected = [0; 8];\n expected[0] = 1;\n assert(out == expected, \"unexpected result\");\n }\n }\n\n #[test(should_fail_with = \"radix must be less than or equal to 256\")]\n fn test_to_le_radix_512() {\n // this test should only fail in constrained mode\n if !runtime::is_unconstrained() {\n let field = 2;\n let _: [u8; 8] = field.to_le_radix(512);\n } else {\n panic(f\"radix must be less than or equal to 256\")\n }\n }\n\n // TODO: Update this test to account for the Brillig restriction that the radix must be less than 512\n //#[test]\n //fn test_to_le_radix_brillig_512() {\n // // this test should only fail in constrained mode\n // if runtime::is_unconstrained() {\n // let field = 1;\n // let out: [u8; 8] = field.to_le_radix(512);\n // let mut expected = [0; 8];\n // expected[0] = 1;\n // assert(out == expected, \"unexpected result\");\n // }\n //}\n\n #[test]\n unconstrained fn test_field_less_than() {\n assert(field_less_than(0, 1));\n assert(field_less_than(0, 0x100));\n assert(field_less_than(0x100, 0 - 1));\n assert(!field_less_than(0 - 1, 0));\n }\n}\n"
2901
2717
  },
2902
- "183": {
2903
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/append.nr",
2904
- "source": "/// Appends two `BoundedVec`s together, returning one that contains all of the elements of the first one followed by all\n/// of the elements of the second one. The resulting `BoundedVec` can have any arbitrary maximum length, but it must be\n/// large enough to fit all of the elements of both the first and second vectors.\npub fn append<T, let A_LEN: u32, let B_LEN: u32, let DST_LEN: u32>(\n a: BoundedVec<T, A_LEN>,\n b: BoundedVec<T, B_LEN>,\n) -> BoundedVec<T, DST_LEN> {\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"
2905
- },
2906
- "185": {
2907
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/mod.nr",
2908
- "source": "pub mod append;\npub mod collapse;\npub mod subarray;\npub mod subbvec;\n\npub use append::append;\npub use collapse::collapse;\npub use subarray::subarray;\npub use subbvec::subbvec;\n\n// This will eventually be replaced by `BoundedVec::for_each`, once that's implemented.\npub unconstrained fn for_each_in_bounded_vec<T, let MaxLen: u32, Env>(\n vec: BoundedVec<T, MaxLen>,\n f: fn[Env](T, u32) -> (),\n) {\n for i in 0..vec.len() {\n f(vec.get_unchecked(i), i);\n }\n}\n"
2909
- },
2910
- "186": {
2911
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/subarray.nr",
2912
- "source": "/// Returns `DST_LEN` elements from a source array, starting at `offset`. `DST_LEN` must not be larger than the number\n/// of 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 SRC_LEN: u32, let DST_LEN: u32>(\n src: [T; SRC_LEN],\n offset: u32,\n) -> [T; DST_LEN] {\n assert(offset + DST_LEN <= SRC_LEN, \"DST_LEN too large for offset\");\n\n let mut dst: [T; DST_LEN] = std::mem::zeroed();\n for i in 0..DST_LEN {\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 DST_LEN to be 0, so we always get back an emtpy 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 = \"DST_LEN 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"
2913
- },
2914
- "187": {
2915
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/subbvec.nr",
2916
- "source": "use crate::utils::array;\n\n/// Returns `DST_MAX_LEN` elements from a source BoundedVec, starting at `offset`. `offset` must not be larger than the\n/// original length, and `DST_LEN` 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 `DST_LEN` 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 SRC_MAX_LEN: u32, let DST_MAX_LEN: u32>(\n bvec: BoundedVec<T, SRC_MAX_LEN>,\n offset: u32,\n) -> BoundedVec<T, DST_MAX_LEN> {\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 = \"DST_LEN 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 supprt capacity increases\n let _: BoundedVec<_, 11> = subbvec(bvec, 0);\n }\n\n #[test(should_fail_with = \"DST_LEN 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"
2917
- },
2918
- "189": {
2919
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/conversion/bytes_to_fields.nr",
2920
- "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.\n/// For example, [1, 10, 3, ..., 0] (31 bytes) is encoded as [1 * 256^30 + 10 * 256^29 + 3 * 256^28 + ... + 0]\n/// 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\n/// are 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).\n/// Each field is converted into 31 big-endian bytes, and the resulting 31-byte chunks are concatenated\n/// back together in the order of the original 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.\n // So 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"
2921
- },
2922
- "190": {
2923
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/conversion/fields_to_bytes.nr",
2924
- "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.\n/// 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\n/// that 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\n/// is assumed to be an array obtained via `fields_to_bytes`, i.e. one that actually represents fields. To convert\n/// a byte 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.\n/// For example, [1, 10, 3, ..., 0] (32 bytes) is encoded as [1 * 256^31 + 10 * 256^30 + 3 * 256^29 + ... + 0]\n/// Note 1: N must be a multiple of 32 bytes\n/// Note 2: The max value check code was taken from 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 let mut fields = BoundedVec::new();\n\n let p = std::field::modulus_be_bytes();\n\n // Since input length is a multiple of 32, we can simply process all chunks fully\n for i in 0..bytes.len() / 32 {\n let mut field = 0;\n\n // Process each byte in the 32-byte chunk\n let mut ok = false;\n\n for j in 0..32 {\n let next_byte = bytes.get(i * 32 + j);\n field = field * 256 + next_byte as Field;\n\n if !ok {\n if next_byte != p[j] {\n assert(next_byte < p[j], \"Value does not fit in field\");\n ok = true;\n }\n }\n }\n assert(ok, \"Value does not fit in field\");\n\n fields.push(field);\n }\n\n fields\n}\n\nmod tests {\n use crate::utils::array::subarray;\n use super::{fields_from_bytes, fields_to_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.\n // So we need to convert the field array to a BoundedVec to be able to feed it to the `fields_from_bytes`\n // function.\n // 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,\n 25, 26, 27, 28, 29, 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\n // and then 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];\n\n // Skip test execution if the selected byte is already at maximum value (255).\n // This is acceptable since we are 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}\n"
2925
- },
2926
2718
  "192": {
2927
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/field.nr",
2928
- "source": "use std::option::Option;\n\nglobal KNOWN_NON_RESIDUE: Field = 5; // This is a non-residue in Noir's native Field.\n\nglobal C1: u32 = 28;\nglobal C3: Field = 40770029410420498293352137776570907027550720424234931066070132305055;\nglobal C5: Field = 19103219067921713944291392827692070036145651957329286315305642004821462161904;\n\n// Power function of two Field arguments of arbitrary size.\n// Adapted from std::field::pow_32.\npub fn pow(x: Field, y: Field) -> Field {\n let mut r = 1 as Field;\n let b: [u1; 254] = y.to_le_bits();\n\n for i in 0..254 {\n r *= r;\n r *= (b[254 - 1 - i] as Field) * x + (1 - b[254 - 1 - i] as Field);\n }\n\n r\n}\n\n// Boolean indicating whether Field element is a square, i.e. whether there exists a y in Field s.t. x = y*y.\nunconstrained fn is_square(x: Field) -> bool {\n let v = pow(x, -1 / 2);\n v * (v - 1) == 0\n}\n\n// Tonelli-Shanks algorithm for computing the square root of a Field element.\n// Requires C1 = max{c: 2^c divides (p-1)}, where p is the order of Field\n// as well as C3 = (C2 - 1)/2, where C2 = (p-1)/(2^c1),\n// and C5 = ZETA^C2, where ZETA is a non-square element of Field.\n// These are pre-computed above as globals.\nunconstrained fn tonelli_shanks_sqrt(x: Field) -> Field {\n let mut z = pow(x, C3);\n let mut t = z * z * x;\n z *= x;\n let mut b = t;\n let mut c = C5;\n\n for i in 0..(C1 - 1) {\n for _j in 1..(C1 - i - 1) {\n b *= b;\n }\n\n z *= if b == 1 { 1 } else { c };\n\n c *= c;\n\n t *= if b == 1 { 1 } else { c };\n\n b = t;\n }\n\n z\n}\n\n// NB: this doesn't return an option, because in the case of there _not_ being a square root, we still want to return a field element that allows us to then assert in the _constrained_ sqrt function that there is no sqrt.\npub unconstrained fn __sqrt(x: Field) -> (bool, Field) {\n let is_sq = is_square(x);\n if is_sq {\n let sqrt = tonelli_shanks_sqrt(x);\n (true, sqrt)\n } else {\n // Demonstrate that x is not a square (a.k.a. a \"quadratic non-residue\").\n // Facts:\n // The Legendre symbol (\"LS\") of x, is x^((p-1)/2) (mod p).\n // - If x is a square, LS(x) = 1\n // - If x is not a square, LS(x) = -1\n // - If x = 0, LS(x) = 0.\n //\n // Hence:\n // sq * sq = sq // 1 * 1 = 1\n // non-sq * non-sq = sq // -1 * -1 = 1\n // sq * non-sq = non-sq // -1 * 1 = -1\n //\n // See: https://en.wikipedia.org/wiki/Legendre_symbol\n let demo_x_not_square = x * KNOWN_NON_RESIDUE;\n let not_sqrt = tonelli_shanks_sqrt(demo_x_not_square);\n (false, not_sqrt)\n }\n}\n\n// Returns (false, 0) if there is no square root.\n// Returns (true, sqrt) if there is a square root.\npub fn sqrt(x: Field) -> Option<Field> {\n // Safety: if the hint returns the square root of x, then we simply square it\n // check the result equals x. If x is not square, we return a value that\n // enables us to prove that fact (see the `else` clause below).\n let (is_sq, maybe_sqrt) = unsafe { __sqrt(x) };\n\n if is_sq {\n let sqrt = maybe_sqrt;\n validate_sqrt_hint(x, sqrt);\n Option::some(sqrt)\n } else {\n let not_sqrt_hint = maybe_sqrt;\n validate_not_sqrt_hint(x, not_sqrt_hint);\n Option::none()\n }\n}\n\nfn validate_sqrt_hint(x: Field, hint: Field) {\n assert(hint * hint == x, f\"The claimed_sqrt {hint} is not the sqrt of x {x}\");\n}\n\nfn validate_not_sqrt_hint(x: Field, hint: Field) {\n // We need this assertion, because x = 0 would pass the other assertions in this\n // function, and we don't want people to be able to prove that 0 is not square!\n assert(x != 0, \"0 has a square root; you cannot claim it is not square\");\n // Demonstrate that x is not a square (a.k.a. a \"quadratic non-residue\").\n //\n // Facts:\n // The Legendre symbol (\"LS\") of x, is x^((p-1)/2) (mod p).\n // - If x is a square, LS(x) = 1\n // - If x is not a square, LS(x) = -1\n // - If x = 0, LS(x) = 0.\n //\n // Hence:\n // 1. sq * sq = sq // 1 * 1 = 1\n // 2. non-sq * non-sq = sq // -1 * -1 = 1\n // 3. sq * non-sq = non-sq // -1 * 1 = -1\n //\n // See: https://en.wikipedia.org/wiki/Legendre_symbol\n //\n // We want to demonstrate that this below multiplication falls under bullet-point (2):\n let demo_x_not_square = x * KNOWN_NON_RESIDUE;\n // I.e. we want to demonstrate that `demo_x_not_square` has Legendre symbol 1\n // (i.e. that it is a square), so we prove that it is square below.\n // Why do we want to prove that it has LS 1?\n // Well, since it was computed with a known-non-residue, its squareness implies we're\n // in case 2 (something multiplied by a known-non-residue yielding a result which\n // has a LS of 1), which implies that x must be a non-square. The unconstrained\n // function gave us the sqrt of demo_x_not_square, so all we need to do is\n // assert its squareness:\n assert(\n hint * hint == demo_x_not_square,\n f\"The hint {hint} does not demonstrate that {x} is not a square\",\n );\n}\n\n#[test]\nfn test_sqrt() {\n let x = 9;\n let maybe_sqrt = sqrt(x);\n assert(maybe_sqrt.is_some());\n let sqrt = maybe_sqrt.unwrap_unchecked();\n assert((sqrt == 3) | (sqrt == -3));\n}\n\n#[test]\nfn test_non_square() {\n let x = 5;\n let maybe_sqrt = sqrt(x);\n assert(maybe_sqrt.is_none());\n}\n\n#[test]\nunconstrained fn test_known_non_residue_is_actually_a_non_residue_in_the_field() {\n assert(!is_square(KNOWN_NON_RESIDUE));\n}\n\n#[test]\nfn test_sqrt_0() {\n let x = 0;\n let sqrt = sqrt(x).unwrap();\n assert(sqrt == 0);\n}\n\n#[test]\nfn test_sqrt_1() {\n let x = 1;\n let sqrt = sqrt(x).unwrap();\n assert((sqrt == 1) | (sqrt == -1));\n}\n\n#[test(should_fail_with = \"The claimed_sqrt 0x04 is not the sqrt of x 0x09\")]\nfn test_bad_sqrt_hint_fails() {\n validate_sqrt_hint(9, 4);\n}\n\n#[test(should_fail_with = \"The hint 0x04 does not demonstrate that 0x0a is not a square\")]\nfn test_bad_not_sqrt_hint_fails() {\n validate_not_sqrt_hint(10, 4);\n}\n\n#[test(should_fail_with = \"0 has a square root; you cannot claim it is not square\")]\nfn test_0_not_sqrt_hint_fails() {\n validate_not_sqrt_hint(0, 0);\n}\n\n#[test]\nunconstrained fn test_is_square() {\n assert(is_square(25));\n}\n\n#[test]\nunconstrained fn test_is_not_square() {\n assert(!is_square(10));\n}\n"
2929
- },
2930
- "194": {
2931
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/point.nr",
2932
- "source": "use crate::utils::field::sqrt;\nuse dep::protocol_types::point::Point;\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 =\n 10944121435919637611123202872628637544274182200208017171849102093287904247808;\n\n/// Converts a point to a byte array.\n///\n/// We don't serialize the point at infinity flag because this function is used in situations where we do not want\n/// to waste the extra byte (encrypted log).\npub fn point_to_bytes(p: Point) -> [u8; 32] {\n // Note that there is 1 more free bit in the 32 bytes (254 bits currently occupied by the x coordinate, 1 bit for\n // the \"sign\") so it's possible to use that last bit as an \"is_infinite\" flag if desired in the future.\n assert(!p.is_infinite, \"Cannot serialize point at infinity as bytes.\");\n\n let mut result: [u8; 32] = p.x.to_be_bytes();\n\n if get_sign_of_point(p) {\n // y is <= (modulus - 1) / 2 so we set the sign bit to 1\n // Here we leverage that field fits into 254 bits (log2(Fr.MODULUS) < 254) and given that we serialize Fr to 32\n // bytes and we use big-endian the 2 most significant bits are never populated. Hence we can use one of\n // the bits as a sign bit.\n result[0] += 128;\n }\n\n result\n}\n\n/**\n * Returns: true if p.y <= MOD_DIV_2, else false.\n */\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\n // the sign we check if the y coordinate is less or equal than the curve's order minus 1 divided by 2.\n // Ideally we'd do `y <= MOD_DIV_2`, but there's no `lte` function, so instead we do `!(y > MOD_DIV_2)`, which is\n // equivalent, 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\npub fn point_from_x_coord(x: Field) -> Point {\n // y ^ 2 = x ^ 3 - 17\n let rhs = x * x * x - 17;\n let y = sqrt(rhs).unwrap();\n Point { x, y, is_infinite: false }\n}\n\n/// Uses the x coordinate and sign flag (+/-) to reconstruct the point.\n/// The y coordinate can be derived from the x coordinate and the \"sign\" flag by solving the grumpkin curve\n/// equation for y.\n/// @param x - The x coordinate of the point\n/// @param sign - The \"sign\" of the y coordinate - determines whether y <= (Fr.MODULUS - 1) / 2\npub fn point_from_x_coord_and_sign(x: Field, sign: bool) -> Point {\n // y ^ 2 = x ^ 3 - 17\n let rhs = x * x * x - 17;\n let y = sqrt(rhs).unwrap();\n\n // If y > MOD_DIV_2 and we want positive sign (or vice versa), negate y\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\n Point { x, y: final_y, is_infinite: false }\n}\n\nmod test {\n use crate::utils::point::{point_from_x_coord_and_sign, point_to_bytes};\n use dep::protocol_types::point::Point;\n\n #[test]\n unconstrained fn test_point_to_bytes_positive_sign() {\n let p = Point {\n x: 0x1af41f5de96446dc3776a1eb2d98bb956b7acd9979a67854bec6fa7c2973bd73,\n y: 0x07fc22c7f2c7057571f137fe46ea9c95114282bc95d37d71ec4bfb88de457d4a,\n is_infinite: false,\n };\n\n let compressed_point = point_to_bytes(p);\n\n let expected_compressed_point_positive_sign = [\n 154, 244, 31, 93, 233, 100, 70, 220, 55, 118, 161, 235, 45, 152, 187, 149, 107, 122,\n 205, 153, 121, 166, 120, 84, 190, 198, 250, 124, 41, 115, 189, 115,\n ];\n assert_eq(expected_compressed_point_positive_sign, compressed_point);\n }\n\n #[test]\n unconstrained fn test_point_to_bytes_negative_sign() {\n let p = Point {\n x: 0x247371652e55dd74c9af8dbe9fb44931ba29a9229994384bd7077796c14ee2b5,\n y: 0x26441aec112e1ae4cee374f42556932001507ad46e255ffb27369c7e3766e5c0,\n is_infinite: false,\n };\n\n let compressed_point = point_to_bytes(p);\n\n let expected_compressed_point_negative_sign = [\n 36, 115, 113, 101, 46, 85, 221, 116, 201, 175, 141, 190, 159, 180, 73, 49, 186, 41, 169,\n 34, 153, 148, 56, 75, 215, 7, 119, 150, 193, 78, 226, 181,\n ];\n\n assert_eq(expected_compressed_point_negative_sign, compressed_point);\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);\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);\n\n assert_eq(p2.x, x2);\n assert_eq(p2.y, 0x26441aec112e1ae4cee374f42556932001507ad46e255ffb27369c7e3766e5c0);\n assert_eq(p2.is_infinite, false);\n }\n}\n"
2933
- },
2934
- "198": {
2935
2719
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/with_hash.nr",
2936
2720
  "source": "use crate::{\n context::{PublicContext, UtilityContext},\n history::public_storage::PublicStorageHistoricalRead,\n oracle,\n};\nuse dep::protocol_types::{\n address::AztecAddress, block_header::BlockHeader, hash::poseidon2_hash, traits::Packable,\n};\n\n/// A struct that allows for efficient reading of value `T` from public storage in private.\n///\n/// The efficient reads are achieved by verifying large values through a single hash check\n/// and then proving inclusion only of the hash in public storage. This reduces the number\n/// of required tree inclusion proofs from `N` to 1.\n///\n/// # Type Parameters\n/// - `T`: The underlying type being wrapped, must implement `Packable<N>`\n/// - `N`: The number of field elements required to pack values of type `T`\npub struct WithHash<T, let N: u32> {\n value: T,\n packed: [Field; N],\n hash: Field,\n}\n\nimpl<T, let N: u32> WithHash<T, N>\nwhere\n T: Packable<N> + Eq,\n{\n pub fn new(value: T) -> Self {\n let packed = value.pack();\n Self { value, packed, hash: poseidon2_hash(packed) }\n }\n\n pub fn get_value(self) -> T {\n self.value\n }\n\n pub fn get_hash(self) -> Field {\n self.hash\n }\n\n pub fn public_storage_read(context: PublicContext, storage_slot: Field) -> T {\n context.storage_read(storage_slot)\n }\n\n pub unconstrained fn utility_public_storage_read(\n context: UtilityContext,\n storage_slot: Field,\n ) -> T {\n context.storage_read(storage_slot)\n }\n\n pub fn historical_public_storage_read(\n header: BlockHeader,\n address: AztecAddress,\n storage_slot: Field,\n ) -> T {\n let historical_block_number = header.global_variables.block_number as u32;\n\n // We could simply produce historical inclusion proofs for each field in `packed`, but that would require one\n // full sibling path per storage slot (since due to kernel siloing the storage is not contiguous). Instead, we\n // get an oracle to provide us the values, and instead we prove inclusion of their hash, which is both a much\n // smaller proof (a single slot), and also independent of the size of T (except in that we need to pack and hash T).\n let hint = WithHash::new(\n // Safety: We verify that a hash of the hint/packed data matches the stored hash.\n unsafe {\n oracle::storage::storage_read(address, storage_slot, historical_block_number)\n },\n );\n\n let hash = header.public_storage_historical_read(storage_slot + N as Field, address);\n\n if hash != 0 {\n assert_eq(hash, hint.get_hash(), \"Hint values do not match hash\");\n } else {\n // The hash slot can only hold a zero if it is uninitialized. Therefore, the hints must then be zero\n // (i.e. the default value for public storage) as well.\n assert_eq(\n hint.get_value(),\n T::unpack(std::mem::zeroed()),\n \"Non-zero hint for zero hash\",\n );\n };\n\n hint.get_value()\n }\n}\n\nimpl<T, let N: u32> Packable<N + 1> for WithHash<T, N>\nwhere\n T: Packable<N>,\n{\n fn pack(self) -> [Field; N + 1] {\n let mut result: [Field; N + 1] = std::mem::zeroed();\n for i in 0..N {\n result[i] = self.packed[i];\n }\n result[N] = self.hash;\n\n result\n }\n\n fn unpack(packed: [Field; N + 1]) -> Self {\n let mut value_packed: [Field; N] = std::mem::zeroed();\n for i in 0..N {\n value_packed[i] = packed[i];\n }\n let hash = packed[N];\n\n Self { value: T::unpack(value_packed), packed: value_packed, hash }\n }\n}\n\nmod test {\n use crate::{\n oracle::random::random,\n test::{\n helpers::{cheatcodes, test_environment::TestEnvironment},\n mocks::mock_struct::MockStruct,\n },\n utils::with_hash::WithHash,\n };\n use dep::protocol_types::hash::poseidon2_hash;\n use dep::protocol_types::traits::{Packable, ToField};\n use dep::std::{mem, test::OracleMock};\n\n global storage_slot: Field = 47;\n\n #[test]\n unconstrained fn create_and_recover() {\n let value = MockStruct { a: 5, b: 3 };\n let value_with_hash = WithHash::new(value);\n let recovered = WithHash::unpack(value_with_hash.pack());\n\n assert_eq(recovered.value, value);\n assert_eq(recovered.packed, value.pack());\n assert_eq(recovered.hash, poseidon2_hash(value.pack()));\n }\n\n #[test]\n unconstrained fn read_uninitialized_value() {\n let mut env = TestEnvironment::new();\n\n let block_header = env.private().historical_header;\n let address = env.contract_address();\n\n let result = WithHash::<MockStruct, _>::historical_public_storage_read(\n block_header,\n address,\n storage_slot,\n );\n\n // We should get zeroed value\n let expected: MockStruct = mem::zeroed();\n assert_eq(result, expected);\n }\n\n #[test]\n unconstrained fn read_initialized_value() {\n let mut env = TestEnvironment::new();\n\n let value = MockStruct { a: 5, b: 3 };\n let value_with_hash = WithHash::new(value);\n\n // We write the value with hash to storage\n cheatcodes::direct_storage_write(\n env.contract_address(),\n storage_slot,\n value_with_hash.pack(),\n );\n\n // We advance block by 1 because env.private() currently returns context at latest_block - 1\n env.advance_block_by(1);\n\n let result = WithHash::<MockStruct, _>::historical_public_storage_read(\n env.private().historical_header,\n env.contract_address(),\n storage_slot,\n );\n\n assert_eq(result, value);\n }\n\n #[test(should_fail_with = \"Non-zero hint for zero hash\")]\n unconstrained fn test_bad_hint_uninitialized_value() {\n let mut env = TestEnvironment::new();\n\n env.advance_block_to(6);\n\n let value_packed = MockStruct { a: 1, b: 1 }.pack();\n\n let block_header = env.private().historical_header;\n let address = env.contract_address();\n\n // Mock the oracle to return a non-zero hint/packed value\n let _ = OracleMock::mock(\"storageRead\")\n .with_params((\n address.to_field(), storage_slot, block_header.global_variables.block_number as u32,\n value_packed.len(),\n ))\n .returns(value_packed)\n .times(1);\n\n // This should revert because the hint value is non-zero and the hash is zero (default value of storage)\n let _ = WithHash::<MockStruct, _>::historical_public_storage_read(\n block_header,\n address,\n storage_slot,\n );\n }\n\n #[test(should_fail_with = \"Hint values do not match hash\")]\n unconstrained fn test_bad_hint_initialized_value() {\n let mut env = TestEnvironment::new();\n\n let value_packed = MockStruct { a: 5, b: 3 }.pack();\n\n // We write the value to storage\n cheatcodes::direct_storage_write(env.contract_address(), storage_slot, value_packed);\n\n // Now we write incorrect hash to the hash storage slot\n let incorrect_hash = random();\n let hash_storage_slot = storage_slot + (value_packed.len() as Field);\n cheatcodes::direct_storage_write(\n env.contract_address(),\n hash_storage_slot,\n [incorrect_hash],\n );\n\n // We advance block by 1 because env.private() currently returns context at latest_block - 1\n env.advance_block_by(1);\n\n let _ = WithHash::<MockStruct, _>::historical_public_storage_read(\n env.private().historical_header,\n env.contract_address(),\n storage_slot,\n );\n }\n}\n"
2937
2721
  },
2938
- "214": {
2939
- "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/abis/event_selector.nr",
2940
- "source": "use crate::traits::{Deserialize, Empty, FromField, Serialize, ToField};\n\npub struct EventSelector {\n // 1st 4-bytes (big-endian leftmost) of abi-encoding of an event.\n inner: u32,\n}\n\nimpl Eq for EventSelector {\n fn eq(self, other: EventSelector) -> bool {\n other.inner == self.inner\n }\n}\n\nimpl Serialize<1> for EventSelector {\n fn serialize(self: Self) -> [Field; 1] {\n [self.inner as Field]\n }\n}\n\nimpl Deserialize<1> for EventSelector {\n fn deserialize(fields: [Field; 1]) -> Self {\n Self { inner: fields[0] as u32 }\n }\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 = crate::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"
2941
- },
2942
- "24": {
2722
+ "20": {
2943
2723
  "path": "std/hash/poseidon2.nr",
2944
- "source": "use crate::default::Default;\nuse crate::hash::Hasher;\n\ncomptime global 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, message_size != N)\n }\n\n pub 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 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 = crate::hash::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>(\n input: [Field; N],\n in_len: u32,\n is_variable_length: bool,\n ) -> Field {\n let two_pow_64 = 18446744073709551616;\n let iv: Field = (in_len as Field) * two_pow_64;\n let mut sponge = Poseidon2::new(iv);\n for i in 0..input.len() {\n if i < in_len {\n sponge.absorb(input[i]);\n }\n }\n\n // In the case where the hash preimage is variable-length, we append `1` to the end of the input, to distinguish\n // from fixed-length hashes. (the combination of this additional field element + the hash IV ensures\n // fixed-length and variable-length hashes do not collide)\n if is_variable_length {\n sponge.absorb(1);\n }\n sponge.squeeze()\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"
2724
+ "source": "use crate::default::Default;\nuse crate::hash::Hasher;\n\ncomptime global RATE: u32 = 3;\n\npub(crate) 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(crate) fn hash<let N: u32>(input: [Field; N], message_size: u32) -> Field {\n Poseidon2::hash_internal(input, message_size, message_size != N)\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 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 = crate::hash::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>(\n input: [Field; N],\n in_len: u32,\n is_variable_length: bool,\n ) -> Field {\n let two_pow_64 = 18446744073709551616;\n let iv: Field = (in_len as Field) * two_pow_64;\n let mut sponge = Poseidon2::new(iv);\n for i in 0..input.len() {\n if i < in_len {\n sponge.absorb(input[i]);\n }\n }\n\n // In the case where the hash preimage is variable-length, we append `1` to the end of the input, to distinguish\n // from fixed-length hashes. (the combination of this additional field element + the hash IV ensures\n // fixed-length and variable-length hashes do not collide)\n if is_variable_length {\n sponge.absorb(1);\n }\n sponge.squeeze()\n }\n}\n\npub(crate) 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"
2945
2725
  },
2946
- "259": {
2726
+ "261": {
2947
2727
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/address/aztec_address.nr",
2948
2728
  "source": "use crate::{\n address::{\n partial_address::PartialAddress, salted_initialization_hash::SaltedInitializationHash,\n },\n constants::{\n AZTEC_ADDRESS_LENGTH, GENERATOR_INDEX__CONTRACT_ADDRESS_V1, MAX_FIELD_VALUE,\n MAX_PROTOCOL_CONTRACTS,\n },\n contract_class_id::ContractClassId,\n hash::poseidon2_hash_with_separator,\n public_keys::{IvpkM, NpkM, OvpkM, PublicKeys, ToPoint, TpkM},\n traits::{Deserialize, Empty, FromField, Packable, Serialize, ToField},\n utils::field::{pow, sqrt},\n};\n\n// We do below because `use crate::point::Point;` does not work\nuse dep::std::embedded_curve_ops::EmbeddedCurvePoint as Point;\n\nuse crate::public_keys::AddressPoint;\nuse std::{\n embedded_curve_ops::{EmbeddedCurveScalar, fixed_base_scalar_mul as derive_public_key},\n ops::Add,\n};\n\n// Aztec address\npub struct AztecAddress {\n pub inner: Field,\n}\n\nimpl Eq for AztecAddress {\n fn eq(self, other: Self) -> bool {\n self.to_field() == other.to_field()\n }\n}\n\nimpl Empty for AztecAddress {\n fn empty() -> Self {\n Self { inner: 0 }\n }\n}\n\nimpl ToField for AztecAddress {\n fn to_field(self) -> Field {\n self.inner\n }\n}\n\nimpl FromField for AztecAddress {\n fn from_field(value: Field) -> AztecAddress {\n AztecAddress { inner: value }\n }\n}\n\nimpl Serialize<AZTEC_ADDRESS_LENGTH> for AztecAddress {\n fn serialize(self: Self) -> [Field; AZTEC_ADDRESS_LENGTH] {\n [self.to_field()]\n }\n}\n\nimpl Deserialize<AZTEC_ADDRESS_LENGTH> for AztecAddress {\n fn deserialize(fields: [Field; AZTEC_ADDRESS_LENGTH]) -> Self {\n FromField::from_field(fields[0])\n }\n}\n\n/// We implement the Packable trait for AztecAddress because it can be stored in contract's storage (and there\n/// the implementation of Packable is required).\nimpl Packable<AZTEC_ADDRESS_LENGTH> for AztecAddress {\n fn pack(self) -> [Field; AZTEC_ADDRESS_LENGTH] {\n self.serialize()\n }\n\n fn unpack(fields: [Field; AZTEC_ADDRESS_LENGTH]) -> Self {\n Self::deserialize(fields)\n }\n}\n\nimpl AztecAddress {\n pub fn zero() -> Self {\n Self { inner: 0 }\n }\n\n pub fn to_address_point(self) -> AddressPoint {\n // We compute the address point by taking our address, setting it to x, and then solving for y in the\n // equation which defines our bn curve:\n // y^2 = x^3 - 17; x = address\n let x = self.inner;\n let y_squared = pow(x, 3) - 17;\n\n // TODO (#8970): Handle cases where we cannot recover a point from an address\n let mut y = sqrt(y_squared);\n\n // If we get a negative y coordinate (any y where y > MAX_FIELD_VALUE / 2), we pin it to the\n // positive one (any value where y <= MAX_FIELD_VALUE / 2) by subtracting it from the Field modulus\n // note: The field modulus is MAX_FIELD_VALUE + 1\n if (!(y.lt(MAX_FIELD_VALUE / 2) | y.eq(MAX_FIELD_VALUE / 2))) {\n y = (MAX_FIELD_VALUE + 1) - y;\n }\n\n AddressPoint { inner: Point { x: self.inner, y, is_infinite: false } }\n }\n\n pub fn compute(public_keys: PublicKeys, partial_address: PartialAddress) -> AztecAddress {\n let public_keys_hash = public_keys.hash();\n\n let pre_address = poseidon2_hash_with_separator(\n [public_keys_hash.to_field(), partial_address.to_field()],\n GENERATOR_INDEX__CONTRACT_ADDRESS_V1,\n );\n\n let address_point = derive_public_key(EmbeddedCurveScalar::from_field(pre_address)).add(\n public_keys.ivpk_m.to_point(),\n );\n\n // Note that our address is only the x-coordinate of the full address_point. This is okay because when people want to encrypt something and send it to us\n // they can recover our full point using the x-coordinate (our address itself). To do this, they recompute the y-coordinate according to the equation y^2 = x^3 - 17.\n // When they do this, they may get a positive y-coordinate (a value that is less than or equal to MAX_FIELD_VALUE / 2) or\n // a negative y-coordinate (a value that is more than MAX_FIELD_VALUE), and we cannot dictate which one they get and hence the recovered point may sometimes be different than the one\n // our secret can decrypt. Regardless though, they should and will always encrypt using point with the positive y-coordinate by convention.\n // This ensures that everyone encrypts to the same point given an arbitrary x-coordinate (address). This is allowed because even though our original point may not have a positive y-coordinate,\n // with our original secret, we will be able to derive the secret to the point with the flipped (and now positive) y-coordinate that everyone encrypts to.\n AztecAddress::from_field(address_point.x)\n }\n\n pub fn compute_from_class_id(\n contract_class_id: ContractClassId,\n salted_initialization_hash: SaltedInitializationHash,\n public_keys: PublicKeys,\n ) -> Self {\n let partial_address = PartialAddress::compute_from_salted_initialization_hash(\n contract_class_id,\n salted_initialization_hash,\n );\n\n AztecAddress::compute(public_keys, partial_address)\n }\n\n pub fn is_protocol_contract(self) -> bool {\n self.inner.lt(MAX_PROTOCOL_CONTRACTS as Field)\n }\n\n pub fn is_zero(self) -> bool {\n self.inner == 0\n }\n\n pub fn assert_is_zero(self) {\n assert(self.to_field() == 0);\n }\n}\n\n#[test]\nfn compute_address_from_partial_and_pub_keys() {\n let public_keys = PublicKeys {\n npk_m: NpkM {\n inner: Point {\n x: 0x22f7fcddfa3ce3e8f0cc8e82d7b94cdd740afa3e77f8e4a63ea78a239432dcab,\n y: 0x0471657de2b6216ade6c506d28fbc22ba8b8ed95c871ad9f3e3984e90d9723a7,\n is_infinite: false,\n },\n },\n ivpk_m: IvpkM {\n inner: Point {\n x: 0x111223493147f6785514b1c195bb37a2589f22a6596d30bb2bb145fdc9ca8f1e,\n y: 0x273bbffd678edce8fe30e0deafc4f66d58357c06fd4a820285294b9746c3be95,\n is_infinite: false,\n },\n },\n ovpk_m: OvpkM {\n inner: Point {\n x: 0x09115c96e962322ffed6522f57194627136b8d03ac7469109707f5e44190c484,\n y: 0x0c49773308a13d740a7f0d4f0e6163b02c5a408b6f965856b6a491002d073d5b,\n is_infinite: false,\n },\n },\n tpk_m: TpkM {\n inner: Point {\n x: 0x00d3d81beb009873eb7116327cf47c612d5758ef083d4fda78e9b63980b2a762,\n y: 0x2f567d22d2b02fe1f4ad42db9d58a36afd1983e7e2909d1cab61cafedad6193a,\n is_infinite: false,\n },\n },\n };\n\n let partial_address = PartialAddress::from_field(\n 0x0a7c585381b10f4666044266a02405bf6e01fa564c8517d4ad5823493abd31de,\n );\n\n let address = AztecAddress::compute(public_keys, partial_address);\n\n // The following value was generated by `derivation.test.ts`.\n // --> Run the test with AZTEC_GENERATE_TEST_DATA=1 flag to update test data.\n let expected_computed_address_from_partial_and_pubkeys =\n 0x24e4646f58b9fbe7d38e317db8d5636c423fbbdfbe119fc190fe9c64747e0c62;\n assert(address.to_field() == expected_computed_address_from_partial_and_pubkeys);\n}\n\n#[test]\nfn compute_preaddress_from_partial_and_pub_keys() {\n let pre_address = poseidon2_hash_with_separator([1, 2], GENERATOR_INDEX__CONTRACT_ADDRESS_V1);\n let expected_computed_preaddress_from_partial_and_pubkey =\n 0x23ce9be3fa3c846b0f9245cc796902e731d04f086e8a42473bb29e405fc98075;\n assert(pre_address == expected_computed_preaddress_from_partial_and_pubkey);\n}\n\n#[test]\nfn from_field_to_field() {\n let address = AztecAddress { inner: 37 };\n assert_eq(FromField::from_field(address.to_field()), address);\n}\n\n#[test]\nfn serde() {\n let address = AztecAddress { inner: 37 };\n assert_eq(Deserialize::deserialize(address.serialize()), address);\n}\n"
2949
2729
  },
2950
- "262": {
2730
+ "264": {
2951
2731
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/address/partial_address.nr",
2952
2732
  "source": "use crate::{\n address::{aztec_address::AztecAddress, salted_initialization_hash::SaltedInitializationHash},\n constants::GENERATOR_INDEX__PARTIAL_ADDRESS,\n contract_class_id::ContractClassId,\n hash::poseidon2_hash_with_separator,\n traits::{Deserialize, Serialize, ToField},\n};\n\nglobal PARTIAL_ADDRESS_LENGTH: u32 = 1;\n\n// Partial address\npub struct PartialAddress {\n pub inner: Field,\n}\n\nimpl ToField for PartialAddress {\n fn to_field(self) -> Field {\n self.inner\n }\n}\n\nimpl Serialize<PARTIAL_ADDRESS_LENGTH> for PartialAddress {\n fn serialize(self: Self) -> [Field; PARTIAL_ADDRESS_LENGTH] {\n [self.to_field()]\n }\n}\n\nimpl Deserialize<PARTIAL_ADDRESS_LENGTH> for PartialAddress {\n fn deserialize(fields: [Field; PARTIAL_ADDRESS_LENGTH]) -> Self {\n PartialAddress { inner: fields[0] }\n }\n}\n\nimpl PartialAddress {\n pub fn from_field(field: Field) -> Self {\n Self { inner: field }\n }\n\n pub fn compute(\n contract_class_id: ContractClassId,\n salt: Field,\n initialization_hash: Field,\n deployer: AztecAddress,\n ) -> Self {\n PartialAddress::compute_from_salted_initialization_hash(\n contract_class_id,\n SaltedInitializationHash::compute(salt, initialization_hash, deployer),\n )\n }\n\n pub fn compute_from_salted_initialization_hash(\n contract_class_id: ContractClassId,\n salted_initialization_hash: SaltedInitializationHash,\n ) -> Self {\n PartialAddress::from_field(poseidon2_hash_with_separator(\n [contract_class_id.to_field(), salted_initialization_hash.to_field()],\n GENERATOR_INDEX__PARTIAL_ADDRESS,\n ))\n }\n\n pub fn to_field(self) -> Field {\n self.inner\n }\n\n pub fn is_zero(self) -> bool {\n self.to_field() == 0\n }\n\n pub fn assert_is_zero(self) {\n assert(self.to_field() == 0);\n }\n}\n"
2953
2733
  },
2954
- "264": {
2734
+ "266": {
2955
2735
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/address/salted_initialization_hash.nr",
2956
2736
  "source": "use crate::{\n address::aztec_address::AztecAddress, constants::GENERATOR_INDEX__PARTIAL_ADDRESS,\n hash::poseidon2_hash_with_separator, traits::ToField,\n};\n\n// Salted initialization hash. Used in the computation of a partial address.\npub struct SaltedInitializationHash {\n pub inner: Field,\n}\n\nimpl ToField for SaltedInitializationHash {\n fn to_field(self) -> Field {\n self.inner\n }\n}\n\nimpl SaltedInitializationHash {\n pub fn from_field(field: Field) -> Self {\n Self { inner: field }\n }\n\n pub fn compute(salt: Field, initialization_hash: Field, deployer: AztecAddress) -> Self {\n SaltedInitializationHash::from_field(poseidon2_hash_with_separator(\n [salt, initialization_hash, deployer.to_field()],\n GENERATOR_INDEX__PARTIAL_ADDRESS,\n ))\n }\n\n pub fn assert_is_zero(self) {\n assert(self.to_field() == 0);\n }\n}\n"
2957
2737
  },
2958
- "268": {
2738
+ "270": {
2959
2739
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/contract_class_id.nr",
2960
2740
  "source": "use crate::constants::GENERATOR_INDEX__CONTRACT_LEAF;\nuse crate::traits::{Deserialize, Empty, FromField, Packable, Serialize, ToField};\n\npub struct ContractClassId {\n pub inner: Field,\n}\n\nimpl Eq for ContractClassId {\n fn eq(self, other: ContractClassId) -> bool {\n other.inner == self.inner\n }\n}\n\nimpl ToField for ContractClassId {\n fn to_field(self) -> Field {\n self.inner\n }\n}\n\nimpl FromField for ContractClassId {\n fn from_field(value: Field) -> Self {\n Self { inner: value }\n }\n}\n\nimpl Serialize<1> for ContractClassId {\n fn serialize(self: Self) -> [Field; 1] {\n [self.inner]\n }\n}\n\nimpl Deserialize<1> for ContractClassId {\n fn deserialize(fields: [Field; 1]) -> Self {\n Self { inner: fields[0] }\n }\n}\n\nimpl Empty for ContractClassId {\n fn empty() -> Self {\n Self { inner: 0 }\n }\n}\n\n// Implement the Packable trait so ContractClassId can be stored in contract's storage.\nimpl Packable<1> for ContractClassId {\n fn pack(self) -> [Field; 1] {\n self.serialize()\n }\n\n fn unpack(fields: [Field; 1]) -> Self {\n Self::deserialize(fields)\n }\n}\n\nimpl ContractClassId {\n pub fn compute(\n artifact_hash: Field,\n private_functions_root: Field,\n public_bytecode_commitment: Field,\n ) -> Self {\n let hash = crate::hash::poseidon2_hash_with_separator(\n [artifact_hash, private_functions_root, public_bytecode_commitment],\n GENERATOR_INDEX__CONTRACT_LEAF,\n ); // TODO(@spalladino): Update generator index\n ContractClassId::from_field(hash)\n }\n\n pub fn assert_is_zero(self) {\n assert(self.to_field() == 0);\n }\n}\n"
2961
2741
  },
2962
- "276": {
2742
+ "278": {
2963
2743
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/debug_log.nr",
2964
2744
  "source": "/// Utility function to console.log data in the acir simulator.\n/// Example:\n/// debug_log(\"blah blah this is a debug string\");\npub fn debug_log<let N: u32>(msg: str<N>) {\n debug_log_format(msg, []);\n}\n\n/// Utility function to console.log data in the acir simulator. This variant receives a format string in which the\n/// `${k}` tokens will be replaced with the k-eth value in the `args` array.\n/// Examples:\n/// debug_log_format(\"get_2(slot:{0}) =>\\n\\t0:{1}\\n\\t1:{2}\", [storage_slot, note0_hash, note1_hash]);\n/// debug_log_format(\"whole array: {}\", [e1, e2, e3, e4]);\npub fn debug_log_format<let M: u32, let N: u32>(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 { debug_log_oracle_wrapper(msg, args) };\n}\n\npub unconstrained fn debug_log_oracle_wrapper<let M: u32, let N: u32>(\n msg: str<M>,\n args: [Field; N],\n) {\n debug_log_oracle(msg, args.as_slice());\n}\n\n// WARNING: sometimes when using debug logs the ACVM errors with: `thrown: \"solver opcode resolution error: cannot solve opcode: expression has too many unknowns x155\"`\n#[oracle(debugLog)]\nunconstrained fn debug_log_oracle<let M: u32>(_msg: str<M>, args: [Field]) {}\n"
2965
2745
  },
2966
- "277": {
2746
+ "279": {
2967
2747
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/hash.nr",
2968
2748
  "source": "use crate::{\n abis::{\n contract_class_function_leaf_preimage::ContractClassFunctionLeafPreimage,\n contract_class_log::ContractClassLog,\n function_selector::FunctionSelector,\n note_hash::ScopedNoteHash,\n nullifier::ScopedNullifier,\n private_log::{PrivateLog, PrivateLogData},\n side_effect::{OrderedValue, scoped::Scoped},\n },\n address::{AztecAddress, EthAddress},\n constants::{\n FUNCTION_TREE_HEIGHT, GENERATOR_INDEX__NOTE_HASH_NONCE, GENERATOR_INDEX__OUTER_NULLIFIER,\n GENERATOR_INDEX__SILOED_NOTE_HASH, GENERATOR_INDEX__UNIQUE_NOTE_HASH, TWO_POW_64,\n },\n merkle_tree::root::root_from_sibling_path,\n messaging::l2_to_l1_message::{L2ToL1Message, ScopedL2ToL1Message},\n poseidon2::Poseidon2Sponge,\n traits::{FromField, Hash, ToField},\n utils::{\n arrays::{array_concat, unsafe_padded_array_length},\n field::{field_from_bytes, field_from_bytes_32_trunc},\n },\n};\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\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 GENERATOR_INDEX__NOTE_HASH_NONCE,\n )\n}\n\npub fn compute_unique_note_hash(nonce: Field, siloed_note_hash: Field) -> Field {\n let inputs = [nonce, siloed_note_hash];\n poseidon2_hash_with_separator(inputs, GENERATOR_INDEX__UNIQUE_NOTE_HASH)\n}\n\npub fn compute_siloed_note_hash(app: AztecAddress, note_hash: Field) -> Field {\n poseidon2_hash_with_separator(\n [app.to_field(), note_hash],\n GENERATOR_INDEX__SILOED_NOTE_HASH,\n )\n}\n\n/// Computes unique note hashes from siloed note hashes\npub fn compute_unique_siloed_note_hash(\n siloed_note_hash: Field,\n first_nullifier: Field,\n note_index_in_tx: u32,\n) -> Field {\n if siloed_note_hash == 0 {\n 0\n } else {\n let nonce = compute_note_hash_nonce(first_nullifier, note_index_in_tx);\n compute_unique_note_hash(nonce, siloed_note_hash)\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 silo_note_hash(note_hash: ScopedNoteHash) -> Field {\n if note_hash.contract_address.is_zero() {\n 0\n } else {\n compute_siloed_note_hash(note_hash.contract_address, note_hash.value())\n }\n}\n\npub fn compute_siloed_nullifier(app: AztecAddress, nullifier: Field) -> Field {\n poseidon2_hash_with_separator(\n [app.to_field(), nullifier],\n GENERATOR_INDEX__OUTER_NULLIFIER,\n )\n}\n\npub fn silo_nullifier(nullifier: ScopedNullifier) -> Field {\n if nullifier.contract_address.is_zero() {\n nullifier.value() // Return value instead of 0 because the first nullifier's contract address is zero.\n } else {\n compute_siloed_nullifier(nullifier.contract_address, nullifier.value())\n }\n}\n\npub fn compute_siloed_private_log_field(contract_address: AztecAddress, field: Field) -> Field {\n poseidon2_hash([contract_address.to_field(), field])\n}\n\npub fn silo_private_log(private_log: Scoped<PrivateLogData>) -> PrivateLog {\n if private_log.contract_address.is_zero() {\n private_log.inner.log\n } else {\n let mut fields = private_log.inner.log.fields;\n fields[0] = compute_siloed_private_log_field(private_log.contract_address, fields[0]);\n PrivateLog { fields }\n }\n}\n\nfn compute_siloed_contract_class_log_field(\n contract_address: AztecAddress,\n first_field: Field,\n) -> Field {\n poseidon2_hash([contract_address.to_field(), first_field])\n}\n\npub fn silo_contract_class_log(contract_class_log: ContractClassLog) -> ContractClassLog {\n if contract_class_log.contract_address.is_zero() {\n contract_class_log\n } else {\n let mut log = contract_class_log;\n log.log.fields[0] = compute_siloed_contract_class_log_field(\n contract_class_log.contract_address,\n log.log.fields[0],\n );\n log\n }\n}\n\npub fn compute_contract_class_log_hash(contract_class_log: ContractClassLog) -> Field {\n let array = contract_class_log.log.fields;\n // Safety: The below length is constrained in the base rollup.\n let length = unsafe { unsafe_padded_array_length(array) };\n if length == 0 {\n 0\n } else {\n poseidon2_hash(array)\n }\n}\n\npub fn merkle_hash(left: Field, right: Field) -> Field {\n poseidon2_hash([left, right])\n}\n\npub fn compute_l2_to_l1_hash(\n contract_address: AztecAddress,\n recipient: EthAddress,\n content: Field,\n rollup_version_id: Field,\n chain_id: Field,\n) -> Field {\n let mut bytes: [u8; 160] = std::mem::zeroed();\n\n let inputs =\n [contract_address.to_field(), rollup_version_id, recipient.to_field(), chain_id, content];\n for i in 0..5 {\n // TODO are bytes be in fr.to_buffer() ?\n let item_bytes: [u8; 32] = inputs[i].to_be_bytes();\n for j in 0..32 {\n bytes[32 * i + j] = item_bytes[j];\n }\n }\n\n sha256_to_field(bytes)\n}\n\npub fn silo_l2_to_l1_message(\n msg: ScopedL2ToL1Message,\n rollup_version_id: Field,\n chain_id: Field,\n) -> Field {\n if msg.contract_address.is_zero() {\n 0\n } else {\n compute_l2_to_l1_hash(\n msg.contract_address,\n msg.message.recipient,\n msg.message.content,\n rollup_version_id,\n chain_id,\n )\n }\n}\n\n// Computes sha256 hash of 2 input hashes.\n//\n// NB: This method now takes in two 31 byte fields - it assumes that any input\n// is the result of a sha_to_field hash and => is truncated\n//\n// TODO(Jan and David): This is used for the encrypted_log hashes.\n// Can we check to see if we can just use hash_to_field or pedersen_compress here?\n//\npub fn accumulate_sha256(input: [Field; 2]) -> Field {\n // This is a note about the cpp code, since it takes an array of Fields\n // instead of a u128.\n // 4 Field elements when converted to bytes will usually\n // occupy 4 * 32 = 128 bytes.\n // However, this function is making the assumption that each Field\n // only occupies 128 bits.\n //\n // TODO(David): This does not seem to be getting guaranteed anywhere in the code?\n // Concatentate two fields into 32x2 = 64 bytes\n // accumulate_sha256 assumes that the inputs are pre-truncated 31 byte numbers\n let mut hash_input_flattened = [0; 64];\n for offset in 0..input.len() {\n let input_as_bytes: [u8; 32] = input[offset].to_be_bytes();\n for byte_index in 0..32 {\n hash_input_flattened[offset * 32 + byte_index] = input_as_bytes[byte_index];\n }\n }\n\n sha256_to_field(hash_input_flattened)\n}\n\npub fn verification_key_hash<let N: u32>(key: [Field; N]) -> Field {\n crate::hash::poseidon2_hash(key)\n}\n\n#[inline_always]\npub fn pedersen_hash<let N: u32>(inputs: [Field; N], hash_index: u32) -> Field {\n std::hash::pedersen_hash_with_separator(inputs, hash_index)\n}\n\npub fn poseidon2_hash<let N: u32>(inputs: [Field; N]) -> Field {\n std::hash::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 = array_concat([separator.to_field()], inputs);\n poseidon2_hash(inputs_with_separator)\n}\n\n// Performs a fixed length hash with a subarray of the given input.\n// Useful for SpongeBlob in which we aborb M things and want to check it vs a hash of M elts of an N-len array.\n// Using stdlib poseidon, this will always absorb an extra 1 as a 'variable' hash, and not match spongeblob.squeeze()\n// or any ts implementation. Also checks that any remaining elts not hashed are empty.\n#[no_predicates]\npub fn poseidon2_hash_subarray<let N: u32>(input: [Field; N], in_len: u32) -> Field {\n let mut sponge = poseidon2_absorb_chunks(input, in_len, false);\n sponge.squeeze()\n}\n\n// NB the below is the same as std::hash::poseidon2::Poseidon2::hash(), but replacing a range check with a bit check,\n// and absorbing in chunks of 3 below.\n#[no_predicates]\npub fn poseidon2_cheaper_variable_hash<let N: u32>(input: [Field; N], in_len: u32) -> Field {\n let mut sponge = poseidon2_absorb_chunks(input, in_len, true);\n // In the case where the hash preimage is variable-length, we append `1` to the end of the input, to distinguish\n // from fixed-length hashes. (the combination of this additional field element + the hash IV ensures\n // fixed-length and variable-length hashes do not collide)\n if in_len != N {\n sponge.absorb(1);\n }\n sponge.squeeze()\n}\n\n// The below fn reduces gates of a conditional poseidon2 hash by approx 3x (thank you ~* Giant Brain Dev @IlyasRidhuan *~ for the idea)\n// Why? Because when we call stdlib poseidon, we call absorb for each item. When absorbing is conditional, it seems the compiler does not know\n// what cache_size will be when calling absorb, so it assigns the permutation gates for /each i/ rather than /every 3rd i/, which is actually required.\n// The below code forces the compiler to:\n// - absorb normally up to 2 times to set cache_size to 1\n// - absorb in chunks of 3 to ensure perm. only happens every 3rd absorb\n// - absorb normally up to 2 times to add any remaining values to the hash\n// In fixed len hashes, the compiler is able to tell that it will only need to perform the permutation every 3 absorbs.\n// NB: it also replaces unnecessary range checks (i < thing) with a bit check (&= i != thing), which alone reduces the gates of a var. hash by half.\n\n#[no_predicates]\nfn poseidon2_absorb_chunks<let N: u32>(\n input: [Field; N],\n in_len: u32,\n variable: bool,\n) -> Poseidon2Sponge {\n let iv: Field = (in_len as Field) * TWO_POW_64;\n let mut sponge = Poseidon2Sponge::new(iv);\n // Even though shift is always 1 here, if we input in_len = 0 we get an underflow\n // since we cannot isolate computation branches. The below is just to avoid that.\n let shift = if in_len == 0 { 0 } else { 1 };\n if in_len != 0 {\n // cache_size = 0, init absorb\n sponge.cache[0] = input[0];\n sponge.cache_size = 1;\n // shift = num elts already added to make cache_size 1 = 1 for a fresh sponge\n // M = max_chunks = (N - 1 - (N - 1) % 3) / 3: (must be written as a fn of N to compile)\n // max_remainder = (N - 1) % 3;\n // max_chunks = (N - 1 - max_remainder) / 3;\n sponge = poseidon2_absorb_chunks_loop::<N, (N - 1 - (N - 1) % 3) / 3>(\n sponge,\n input,\n in_len,\n variable,\n shift,\n );\n }\n sponge\n}\n\n// NB: If it's not required to check that the non-absorbed elts of 'input' are 0s, set skip_0_check=true\n#[no_predicates]\npub fn poseidon2_absorb_chunks_existing_sponge<let N: u32>(\n in_sponge: Poseidon2Sponge,\n input: [Field; N],\n in_len: u32,\n skip_0_check: bool,\n) -> Poseidon2Sponge {\n let mut sponge = in_sponge;\n // 'shift' is to account for already added inputs\n let mut shift = 0;\n // 'stop' is to avoid an underflow when inputting in_len = 0\n let mut stop = false;\n for i in 0..3 {\n if shift == in_len {\n stop = true;\n }\n if (sponge.cache_size != 1) & (!stop) {\n sponge.absorb(input[i]);\n shift += 1;\n }\n }\n sponge = if stop {\n sponge\n } else {\n // max_chunks = (N - (N % 3)) / 3;\n poseidon2_absorb_chunks_loop::<N, (N - (N % 3)) / 3>(\n sponge,\n input,\n in_len,\n skip_0_check,\n shift,\n )\n };\n sponge\n}\n\n// The below is the loop to absorb elts into a poseidon sponge in chunks of 3\n// shift - the num of elts already absorbed to ensure the sponge's cache_size = 1\n// M - the max number of chunks required to absorb N things (must be comptime to compile)\n// NB: The 0 checks ('Found non-zero field...') are messy, but having a separate loop over N to check\n// for 0s costs 3N gates. Current approach is approx 2N gates.\n#[no_predicates]\nfn poseidon2_absorb_chunks_loop<let N: u32, let M: u32>(\n in_sponge: Poseidon2Sponge,\n input: [Field; N],\n in_len: u32,\n variable: bool,\n shift: u32,\n) -> Poseidon2Sponge {\n assert(in_len <= N, \"Given in_len to absorb is larger than the input array len\");\n // When we have an existing sponge, we may have a shift of 0, and the final 'k+2' below = N\n // The below avoids an overflow\n let skip_last = 3 * M == N;\n // Writing in_sponge: &mut does not compile\n let mut sponge = in_sponge;\n let mut should_add = true;\n // The num of things left over after absorbing in 3s\n let remainder = (in_len - shift) % 3;\n // The num of chunks of 3 to absorb (maximum M)\n let chunks = (in_len - shift - remainder) / 3;\n for i in 0..M {\n // Now we loop through cache size = 1 -> 3\n should_add &= i != chunks;\n // This is the index at the start of the chunk (for readability)\n let k = 3 * i + shift;\n if should_add {\n // cache_size = 1, 2 => just assign\n sponge.cache[1] = input[k];\n sponge.cache[2] = input[k + 1];\n // cache_size = 3 => duplex + perm\n for j in 0..3 {\n sponge.state[j] += sponge.cache[j];\n }\n sponge.state = std::hash::poseidon2_permutation(sponge.state, 4);\n sponge.cache[0] = input[k + 2];\n // cache_size is now 1 again, repeat loop\n } else if (!variable) & (i != chunks) {\n // if we are hashing a fixed len array which is a subarray, we check the remaining elts are 0\n // NB: we don't check at i == chunks, because that chunk contains elts to be absorbed or checked below\n let last_0 = if (i == M - 1) & (skip_last) {\n 0\n } else {\n input[k + 2]\n };\n let all_0 = (input[k] == 0) & (input[k + 1] == 0) & (last_0 == 0);\n assert(all_0, \"Found non-zero field after breakpoint\");\n }\n }\n // we have 'remainder' num of items left to absorb\n should_add = true;\n // below is to avoid overflows (i.e. if inlen is close to N)\n let mut should_check = !variable;\n for i in 0..3 {\n should_add &= i != remainder;\n should_check &= in_len - remainder + i != N;\n if should_add {\n // we want to absorb the final 'remainder' items\n sponge.absorb(input[in_len - remainder + i]);\n } else if should_check {\n assert(input[in_len - remainder + i] == 0, \"Found non-zero field after breakpoint\");\n }\n }\n sponge\n}\n\npub fn poseidon2_hash_with_separator_slice<T>(inputs: [Field], separator: T) -> 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[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 poseidon_chunks_matches_fixed() {\n let in_len = 501;\n let mut input: [Field; 4096] = [0; 4096];\n let mut fixed_input = [3; 501];\n assert(in_len == fixed_input.len()); // sanity check\n for i in 0..in_len {\n input[i] = 3;\n }\n let sub_chunk_hash = poseidon2_hash_subarray(input, in_len);\n let fixed_len_hash = std::hash::poseidon2::Poseidon2::hash(fixed_input, fixed_input.len());\n assert(sub_chunk_hash == fixed_len_hash);\n}\n\n#[test]\nfn poseidon_chunks_matches_variable() {\n let in_len = 501;\n let mut input: [Field; 4096] = [0; 4096];\n for i in 0..in_len {\n input[i] = 3;\n }\n let variable_chunk_hash = poseidon2_cheaper_variable_hash(input, in_len);\n let variable_len_hash = std::hash::poseidon2::Poseidon2::hash(input, in_len);\n assert(variable_chunk_hash == variable_len_hash);\n}\n\n#[test]\nfn existing_sponge_poseidon_chunks_matches_fixed() {\n let in_len = 501;\n let mut input: [Field; 4096] = [0; 4096];\n let mut fixed_input = [3; 501];\n assert(in_len == fixed_input.len()); // sanity check\n for i in 0..in_len {\n input[i] = 3;\n }\n // absorb 250 of the 501 things\n let empty_sponge = Poseidon2Sponge::new((in_len as Field) * TWO_POW_64);\n let first_sponge = poseidon2_absorb_chunks_existing_sponge(empty_sponge, input, 250, true);\n // now absorb the final 251 (since they are all 3s, im being lazy and not making a new array)\n let mut final_sponge = poseidon2_absorb_chunks_existing_sponge(first_sponge, input, 251, true);\n let fixed_len_hash = Poseidon2Sponge::hash(fixed_input, fixed_input.len());\n assert(final_sponge.squeeze() == fixed_len_hash);\n}\n\n#[test]\nfn poseidon_chunks_empty_inputs() {\n let in_len = 0;\n let mut input: [Field; 4096] = [0; 4096];\n let mut constructed_empty_sponge = poseidon2_absorb_chunks(input, in_len, true);\n let mut first_sponge =\n poseidon2_absorb_chunks_existing_sponge(constructed_empty_sponge, input, in_len, true);\n assert(first_sponge.squeeze() == constructed_empty_sponge.squeeze());\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 compute_l2_l1_hash() {\n // All zeroes\n let hash_result =\n compute_l2_to_l1_hash(AztecAddress::from_field(0), EthAddress::zero(), 0, 0, 0);\n assert(hash_result == 0xb393978842a0fa3d3e1470196f098f473f9678e72463cb65ec4ab5581856c2);\n\n // Non-zero case\n let hash_result = compute_l2_to_l1_hash(\n AztecAddress::from_field(1),\n EthAddress::from_field(3),\n 5,\n 2,\n 4,\n );\n assert(hash_result == 0x3f88c1044a05e5340ed20466276500f6d45ca5603913b9091e957161734e16);\n}\n\n#[test]\nfn silo_l2_to_l1_message_matches_typescript() {\n let version = 4;\n let chainId = 5;\n\n let hash = silo_l2_to_l1_message(\n ScopedL2ToL1Message {\n message: L2ToL1Message { recipient: EthAddress::from_field(1), content: 2, counter: 0 },\n contract_address: AztecAddress::from_field(3),\n },\n version,\n chainId,\n );\n\n // The following value was generated by `l2_to_l1_message.test.ts`\n let hash_from_typescript = 0x00c6155d69febb9d5039b374dd4f77bf57b7c881709aa524a18acaa0bd57476a;\n\n assert_eq(hash, hash_from_typescript);\n}\n"
2969
2749
  },
2970
- "291": {
2750
+ "293": {
2971
2751
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/meta/mod.nr",
2972
2752
  "source": "use super::traits::{Deserialize, Packable, Serialize};\n\n/// Returns the typed expression of a trait method implementation.\n///\n/// This helper function is preferred over directly inlining with `$typ::target_method()` in a quote,\n/// as direct inlining would result in missing import warnings in the generated code (specifically,\n/// warnings that the trait implementation is not in scope).\n///\n/// # Note\n/// A copy of this function exists in `aztec-nr/aztec/src/macros/utils.nr`. We maintain separate copies\n/// because importing it there from here would cause the `target_trait` to be interpreted in the context\n/// of this crate, making it impossible to compile code for traits from that crate (e.g. NoteType).\ncomptime fn get_trait_impl_method(\n typ: Type,\n target_trait: Quoted,\n target_method: Quoted,\n) -> TypedExpr {\n let trait_constraint = target_trait.as_trait_constraint();\n typ\n .get_trait_impl(trait_constraint)\n .expect(f\"Could not find impl for {target_trait} for type {typ}\")\n .methods()\n .filter(|m| m.name() == target_method)[0]\n .as_typed_expr()\n}\n\n/// Generates code that deserializes a struct, primitive type, array or string from a field array.\n///\n/// # Parameters\n/// - `name`: The name of the current field being processed, used to identify fields for replacement.\n/// - `typ`: The type of the struct or field being deserialized (e.g., a custom struct, array, or primitive).\n/// - `field_array_name`: The name of the field array containing serialized field data (e.g., `\"values\"`).\n/// - `num_already_consumed`: The number of fields already processed in previous recursion calls.\n/// - `should_unpack`: A boolean indicating whether the type should be unpacked (see description of `Packable`\n/// and `Serialize` trait for more information about the difference between packing and serialization).\n///\n/// # Returns\n/// A tuple containing:\n/// - `Quoted`: A code that deserializes a given struct, primitive type, array, or string from the field array.\n/// - `u32`: The total number of fields consumed during deserialization (used for recursion).\n///\n/// # Nested Struct Example\n/// Given the following setup:\n/// ```\n/// struct UintNote {\n/// value: u128,\n/// owner: AztecAddress,\n/// randomness: Field,\n/// }\n///\n/// struct AztecAddress {\n/// inner: Field,\n/// }\n/// ```\n///\n/// If `UintNote` is the input type, the function will generate the following deserialization code:\n/// ```\n/// UintNote {\n/// value: fields[0] as u128,\n/// owner: AztecAddress {\n/// inner: fields[1],\n/// },\n/// randomness: fields[2],\n/// }\n/// ```\n/// # Nested Struct Example with Unpacking\n/// - given the same setup as above and given that u128, AztecAddress and Field implement the `Packable` trait\n/// the result we get is:\n/// ```\n/// UintNote {\n/// value: aztec::protocol_types::traits::Packable::unpack([fields[0]]),\n/// owner: aztec::protocol_types::traits::Packable::unpack([fields[1]]),\n/// randomness: aztec::protocol_types::traits::Packable::unpack([fields[2]]),\n/// }\n/// ```\n///\n/// # Panics\n/// - If the deserialization logic encounters a type it does not support.\n/// - If an incorrect number of fields are consumed when deserializing a string.\npub comptime fn generate_deserialize_from_fields(\n name: Quoted,\n typ: Type,\n field_array_name: Quoted,\n num_already_consumed: u32,\n should_unpack: bool,\n) -> (Quoted, u32) {\n let mut result = quote {};\n // Counter for the number of fields consumed\n let mut consumed_counter: u32 = 0;\n\n // If the type implements `Packable`, its length will be assigned to the `maybe_packed_len_typ` variable.\n let maybe_packed_len_typ = std::meta::typ::fresh_type_variable();\n let packable_constraint = quote { Packable<$maybe_packed_len_typ> }.as_trait_constraint();\n\n if (should_unpack & typ.implements(packable_constraint)) {\n // Unpacking is enabled and the given type implements the `Packable` trait so we call the `unpack()`\n // method, add the resulting field array to `aux_vars` and each field to `fields`.\n let packed_len = maybe_packed_len_typ.as_constant().unwrap();\n\n // We copy the packed fields into a new array and pass that to the unpack function in a quote\n let mut packed_fields_quotes = &[];\n for i in 0..packed_len {\n let index_in_field_array = i + num_already_consumed;\n packed_fields_quotes =\n packed_fields_quotes.push_back(quote { $field_array_name[$index_in_field_array] });\n }\n let packed_fields = packed_fields_quotes.join(quote {,});\n\n // Now we call unpack on the type\n let unpack_method = get_trait_impl_method(typ, quote { Packable<_> }, quote { unpack });\n result = quote { $unpack_method([ $packed_fields ]) };\n\n consumed_counter = packed_len;\n } else if typ.is_field() | typ.as_integer().is_some() | typ.is_bool() {\n // The field is a primitive so we just reference it in the field array\n result = quote { $field_array_name[$num_already_consumed] as $typ };\n consumed_counter = 1;\n } else if typ.as_data_type().is_some() {\n // The field is a struct so we iterate over each struct field and recursively call\n // `generate_deserialize_from_fields`\n let (nested_def, generics) = typ.as_data_type().unwrap();\n let nested_name = nested_def.name();\n let mut deserialized_fields_list = &[];\n\n // Iterate over each field in the struct\n for field in nested_def.fields(generics) {\n let (field_name, field_type) = field;\n // Recursively call `generate_deserialize_from_fields` for each field in the struct\n let (deserialized_field, num_consumed_in_recursion) = generate_deserialize_from_fields(\n field_name,\n field_type,\n field_array_name,\n consumed_counter + num_already_consumed,\n should_unpack,\n );\n // We increment the consumed counter by the number of fields consumed in the recursion\n consumed_counter += num_consumed_in_recursion;\n // We add the deserialized field to the list of deserialized fields.\n // E.g. `value: u128 { lo: fields[0], hi: fields[1] }`\n deserialized_fields_list =\n deserialized_fields_list.push_back(quote { $field_name: $deserialized_field });\n }\n\n // We can construct the struct from the deserialized fields\n let deserialized_fields = deserialized_fields_list.join(quote {,});\n result = quote {\n $nested_name {\n $deserialized_fields\n }\n };\n } else if typ.as_array().is_some() {\n // The field is an array so we iterate over each element and recursively call\n // `generate_deserialize_from_fields`\n let (element_type, array_len) = typ.as_array().unwrap();\n let array_len = array_len.as_constant().unwrap();\n let mut array_fields_list = &[];\n\n // Iterate over each element in the array\n for _ in 0..array_len {\n // Recursively call `generate_deserialize_from_fields` for each element in the array\n let (deserialized_field, num_consumed_in_recursion) = generate_deserialize_from_fields(\n name,\n element_type,\n field_array_name,\n consumed_counter + num_already_consumed,\n should_unpack,\n );\n // We increment the consumed counter by the number of fields consumed in the recursion\n consumed_counter += num_consumed_in_recursion;\n // We add the deserialized field to the list of deserialized fields.\n array_fields_list = array_fields_list.push_back(deserialized_field);\n }\n\n // We can construct the array from the deserialized fields\n let array_fields = array_fields_list.join(quote {,});\n result = quote { [ $array_fields ] };\n } else if typ.as_str().is_some() {\n // The field is a string and we expect each byte of the string to be represented as 1 field in the field\n // array. So we iterate over the string length and deserialize each character as u8 in the recursive call\n // to `generate_deserialize_from_fields`.\n let length_type = typ.as_str().unwrap();\n let str_len = length_type.as_constant().unwrap();\n let mut byte_list = &[];\n\n // Iterate over each character in the string\n for _ in 0..str_len {\n // Recursively call `generate_deserialize_from_fields` for each character in the string\n let (deserialized_field, num_consumed_in_recursion) = generate_deserialize_from_fields(\n name,\n quote {u8}.as_type(),\n field_array_name,\n consumed_counter + num_already_consumed,\n should_unpack,\n );\n\n // We should consume just one field in the recursion so we sanity check that\n assert_eq(\n num_consumed_in_recursion,\n 1,\n \"Incorrect number of fields consumed in string deserialization\",\n );\n\n // We increment the consumed counter by 1 as we have consumed one field\n consumed_counter += 1;\n\n // We add the deserialized field to the list of deserialized fields.\n // E.g. `fields[6] as u8`\n byte_list = byte_list.push_back(deserialized_field);\n }\n\n // We construct the string from the deserialized fields\n let bytes = byte_list.join(quote {,});\n result = quote { [ $bytes ].as_str_unchecked() };\n } else {\n panic(\n f\"Unsupported type for serialization of argument {name} and type {typ}\",\n )\n }\n\n (result, consumed_counter)\n}\n\n/// Generates code that serializes a type into an array of fields. Also generates auxiliary variables if necessary\n/// for serialization. If `should_pack` is true, we check if the type implements the `Packable` trait and pack it\n/// if it does.\n///\n/// # Parameters\n/// - `name`: The base identifier (e.g., `self`, `some_var`).\n/// - `typ`: The type being serialized (e.g., a custom struct, array, or primitive type).\n/// - `omit`: A list of field names (as `Quoted`) to be excluded from the serialized output.\n/// - `should_pack`: A boolean indicating whether the type should be packed.\n///\n/// # Returns\n/// A tuple containing:\n/// - A flattened array of `Quoted` field references representing the serialized fields.\n/// - An array of `Quoted` auxiliary variables needed for serialization, such as byte arrays for strings.\n///\n/// # Examples\n///\n/// ## Struct\n/// Given the following struct:\n/// ```rust\n/// struct MockStruct {\n/// a: Field,\n/// b: Field,\n/// }\n/// ```\n///\n/// Serializing the struct:\n/// ```rust\n/// generate_serialize_to_fields(quote { my_mock_struct }, MockStruct, &[], false)\n/// // Returns:\n/// // ([`my_mock_struct.a`, `my_mock_struct.b`], [])\n/// ```\n///\n/// ## Nested Struct\n/// For a more complex struct:\n/// ```rust\n/// struct NestedStruct {\n/// m1: MockStruct,\n/// m2: MockStruct,\n/// }\n/// ```\n///\n/// Serialization output:\n/// ```rust\n/// generate_serialize_to_fields(quote { self }, NestedStruct, &[], false)\n/// // Returns:\n/// // ([`self.m1.a`, `self.m1.b`, `self.m2.a`, `self.m2.b`], [])\n/// ```\n///\n/// ## Array\n/// For an array type:\n/// ```rust\n/// generate_serialize_to_fields(quote { my_array }, [Field; 3], &[], false)\n/// // Returns:\n/// // ([`my_array[0]`, `my_array[1]`, `my_array[2]`], [])\n/// ```\n///\n/// ## String\n/// For a string field, where each character is serialized as a `Field`:\n/// ```rust\n/// generate_serialize_to_fields(quote { my_string }, StringType, &[], false)\n/// // Returns:\n/// // ([`my_string_as_bytes[0] as Field`, `my_string_as_bytes[1] as Field`, ...],\n/// // [`let my_string_as_bytes = my_string.as_bytes()`])\n/// ```\n///\n/// ## Nested Struct with Omitted Field and packing enabled\n/// - u128 has a `Packable` implementation hence it will be packed.\n///\n/// For a more complex struct:\n/// ```rust\n/// struct MyStruct {\n/// value: u128,\n/// value2: Field,\n/// }\n/// ```\n///\n/// Serializing while omitting `value2`:\n/// ```rust\n/// generate_serialize_to_fields(quote { self }, MyStruct, &[quote { self.value2 }], true)\n/// // Returns:\n/// // ([`value_packed[0]`], [`let value_packed = self.value.pack()`])\n/// ```\n///\n/// # Panics\n/// - If the type is unsupported for serialization.\n/// - If the provided `typ` contains invalid constants or incompatible structures.\npub comptime fn generate_serialize_to_fields(\n name: Quoted,\n typ: Type,\n omit: [Quoted],\n should_pack: bool,\n) -> ([Quoted], [Quoted]) {\n let mut fields = &[];\n let mut aux_vars = &[];\n\n // Proceed if none of the omit rules omits this name\n if !omit.any(|to_omit| to_omit == name) {\n // If the type implements `Packable`, its length will be assigned to the `maybe_packed_len_typ` variable.\n let maybe_packed_len_typ = std::meta::typ::fresh_type_variable();\n let packable_constraint =\n quote { crate::traits::Packable<$maybe_packed_len_typ> }.as_trait_constraint();\n\n if (should_pack & typ.implements(packable_constraint)) {\n // Packing is enabled and the given type implements the `Packable` trait so we call the `pack()`\n // method, add the resulting field array to `aux_vars` and each field to `fields`.\n let packed_len = maybe_packed_len_typ.as_constant().unwrap();\n\n // We collapse the name to a one that gets tokenized as a single token (e.g. \"self.value\" -> \"self_value\").\n let name_at_one_token = collapse_to_one_token(name);\n let packed_struct_name = f\"{name_at_one_token}_aux_var\".quoted_contents();\n\n // We add the individual fields to the fields array\n let pack_method = get_trait_impl_method(\n typ,\n quote { crate::traits::Packable<$packed_len> },\n quote { pack },\n );\n let packed_struct = quote { let $packed_struct_name = $pack_method($name) };\n for i in 0..packed_len {\n fields = fields.push_back(quote { $packed_struct_name[$i] });\n }\n\n // We add the new auxiliary variable to the aux_vars array\n aux_vars = aux_vars.push_back(packed_struct);\n } else if typ.is_field() {\n // For field we just add the value to fields\n fields = fields.push_back(name);\n } else if typ.as_integer().is_some() | typ.is_bool() {\n // For integer and bool we just cast to Field and add the value to fields\n fields = fields.push_back(quote { $name as Field });\n } else if typ.as_data_type().is_some() {\n // For struct we pref\n let nested_struct = typ.as_data_type().unwrap();\n let params = nested_struct.0.fields(nested_struct.1);\n let struct_flattened = params.map(|(param_name, param_type): (Quoted, Type)| {\n let maybe_prefixed_name = if name == quote {} {\n // Triggered when the param name is of a value available in the current scope (e.g. a function\n // argument) --> then we don't prefix the name with anything.\n param_name\n } else {\n // Triggered when we want to prefix the param name with the `name` from function input. This\n // can typically be `self` when implementing a method on a struct.\n quote { $name.$param_name }\n };\n generate_serialize_to_fields(\n quote {$maybe_prefixed_name},\n param_type,\n omit,\n should_pack,\n )\n });\n let struct_flattened_fields = struct_flattened.fold(\n &[],\n |acc: [Quoted], (fields, _): (_, [Quoted])| acc.append(fields),\n );\n let struct_flattened_aux_vars = struct_flattened.fold(\n &[],\n |acc: [Quoted], (_, aux_vars): ([Quoted], _)| acc.append(aux_vars),\n );\n fields = fields.append(struct_flattened_fields);\n aux_vars = aux_vars.append(struct_flattened_aux_vars);\n } else if typ.as_array().is_some() {\n // For array we recursively call `generate_serialize_to_fields(...)` for each element\n let (element_type, array_len) = typ.as_array().unwrap();\n let array_len = array_len.as_constant().unwrap();\n for i in 0..array_len {\n let (element_fields, element_aux_vars) = generate_serialize_to_fields(\n quote { $name[$i] },\n element_type,\n omit,\n should_pack,\n );\n fields = fields.append(element_fields);\n aux_vars = aux_vars.append(element_aux_vars);\n }\n } else if typ.as_str().is_some() {\n // For string we convert the value to bytes, we store the `as_bytes` in an auxiliary variables and\n // then we add each byte to fields as a Field\n let length_type = typ.as_str().unwrap();\n let str_len = length_type.as_constant().unwrap();\n let as_member = name.as_expr().unwrap().as_member_access();\n let var_name = if as_member.is_some() {\n as_member.unwrap().1\n } else {\n name\n };\n let as_bytes_name = f\"{var_name}_as_bytes\".quoted_contents();\n let as_bytes = quote { let $as_bytes_name = $name.as_bytes() };\n for i in 0..str_len {\n fields = fields.push_back(quote { $as_bytes_name[$i] as Field });\n }\n aux_vars = aux_vars.push_back(as_bytes);\n } else {\n panic(\n f\"Unsupported type for serialization of argument {name} and type {typ}\",\n )\n }\n }\n (fields, aux_vars)\n}\n\n/// From a quote that gets tokenized to a multiple tokens we collapse it to a single token by replacing all `.` with `_`.\n/// E.g. \"self.values[0]\" -> \"self_values_0_\"\ncomptime fn collapse_to_one_token(q: Quoted) -> Quoted {\n let tokens = q.tokens();\n\n let mut single_token = quote {};\n for token in tokens {\n let new_token = if ((token == quote {.}) | (token == quote {[}) | (token == quote {]})) {\n quote {_}\n } else {\n token\n };\n single_token = f\"{single_token}{new_token}\".quoted_contents();\n }\n single_token\n}\n\npub(crate) comptime fn derive_serialize(s: TypeDefinition) -> Quoted {\n let typ = s.as_type();\n let (fields, aux_vars) = generate_serialize_to_fields(quote { self }, typ, &[], false);\n let aux_vars_for_serialization = if aux_vars.len() > 0 {\n let joint = aux_vars.join(quote {;});\n quote { $joint; }\n } else {\n quote {}\n };\n\n let field_serializations = fields.join(quote {,});\n let serialized_len = fields.len();\n quote {\n impl Serialize<$serialized_len> for $typ {\n fn serialize(self) -> [Field; $serialized_len] {\n $aux_vars_for_serialization\n [ $field_serializations ]\n }\n }\n }\n}\n\npub(crate) comptime fn derive_deserialize(s: TypeDefinition) -> Quoted {\n let typ = s.as_type();\n let (fields, _) = generate_serialize_to_fields(quote { self }, typ, &[], false);\n let serialized_len = fields.len();\n let (deserialized, _) =\n generate_deserialize_from_fields(quote { self }, typ, quote { serialized }, 0, false);\n quote {\n impl Deserialize<$serialized_len> for $typ {\n fn deserialize(serialized: [Field; $serialized_len]) -> Self {\n $deserialized\n }\n }\n }\n}\n\n/// Generates `Packable` implementation for a given struct and returns the packed length.\n///\n/// Note: We are having this function separate from `derive_packable` because we use this in the note macros to get\n/// the packed length of a note as well as the `Packable` implementation. We need the length to be able to register\n/// the note in the global `NOTES` map. There the length is used to generate partial note helper functions.\npub comptime fn derive_packable_and_get_packed_len(s: TypeDefinition) -> (Quoted, u32) {\n let packing_enabled = true;\n\n let typ = s.as_type();\n let (fields, aux_vars) =\n generate_serialize_to_fields(quote { self }, typ, &[], packing_enabled);\n let aux_vars_for_packing = if aux_vars.len() > 0 {\n let joint = aux_vars.join(quote {;});\n quote { $joint; }\n } else {\n quote {}\n };\n\n let (unpacked, _) =\n generate_deserialize_from_fields(quote { self }, typ, quote { packed }, 0, packing_enabled);\n\n let field_packings = fields.join(quote {,});\n let packed_len = fields.len();\n let packable_trait: TraitConstraint = quote { Packable<$packed_len> }.as_trait_constraint();\n (\n quote {\n impl $packable_trait for $typ {\n fn pack(self) -> [Field; $packed_len] {\n $aux_vars_for_packing\n [ $field_packings ]\n }\n\n fn unpack(packed: [Field; $packed_len]) -> Self {\n $unpacked\n }\n }\n },\n packed_len,\n )\n}\n\npub(crate) comptime fn derive_packable(s: TypeDefinition) -> Quoted {\n let (packable_impl, _) = derive_packable_and_get_packed_len(s);\n packable_impl\n}\n\n#[derive(Packable, Serialize, Deserialize, Eq)]\npub struct Smol {\n a: Field,\n b: Field,\n}\n\n#[derive(Serialize, Deserialize, Eq)]\npub struct HasArray {\n a: [Field; 2],\n b: bool,\n}\n\n#[derive(Serialize, Deserialize, Eq)]\npub struct Fancier {\n a: Smol,\n b: [Field; 2],\n c: [u8; 3],\n d: str<16>,\n}\n\nfn main() {\n assert(false);\n}\n\n#[test]\nfn smol_test() {\n let smol = Smol { a: 1, b: 2 };\n let serialized = smol.serialize();\n assert(serialized == [1, 2], serialized);\n let deserialized = Smol::deserialize(serialized);\n assert(deserialized == smol);\n\n // None of the struct members implements the `Packable` trait so the packed and serialized data should be the same\n let packed = smol.pack();\n assert_eq(packed, serialized, \"Packed does not match serialized\");\n}\n\n#[test]\nfn has_array_test() {\n let has_array = HasArray { a: [1, 2], b: true };\n let serialized = has_array.serialize();\n assert(serialized == [1, 2, 1], serialized);\n let deserialized = HasArray::deserialize(serialized);\n assert(deserialized == has_array);\n}\n\n#[test]\nfn fancier_test() {\n let fancier =\n Fancier { a: Smol { a: 1, b: 2 }, b: [0, 1], c: [1, 2, 3], d: \"metaprogramming!\" };\n let serialized = fancier.serialize();\n assert(\n serialized\n == [\n 1, 2, 0, 1, 1, 2, 3, 0x6d, 0x65, 0x74, 0x61, 0x70, 0x72, 0x6f, 0x67, 0x72, 0x61,\n 0x6d, 0x6d, 0x69, 0x6e, 0x67, 0x21,\n ],\n serialized,\n );\n let deserialized = Fancier::deserialize(serialized);\n assert(deserialized == fancier);\n}\n"
2973
2753
  },
2974
- "294": {
2754
+ "296": {
2975
2755
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/poseidon2.nr",
2976
2756
  "source": "use crate::constants::TWO_POW_64;\n\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\ncomptime global RATE: u32 = 3;\n\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 // In the case where the hash preimage is variable-length, we append `1` to the end of the input, to distinguish\n // from fixed-length hashes. (the combination of this additional field element + the hash IV ensures\n // fixed-length and variable-length hashes do not collide)\n if is_variable_length {\n sponge.absorb(1);\n }\n sponge.squeeze()\n }\n}\n"
2977
2757
  },
2978
- "303": {
2758
+ "305": {
2979
2759
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/public_keys.nr",
2980
2760
  "source": "use crate::{\n address::public_keys_hash::PublicKeysHash,\n constants::{\n DEFAULT_IVPK_M_X, DEFAULT_IVPK_M_Y, DEFAULT_NPK_M_X, DEFAULT_NPK_M_Y, DEFAULT_OVPK_M_X,\n DEFAULT_OVPK_M_Y, DEFAULT_TPK_M_X, DEFAULT_TPK_M_Y, GENERATOR_INDEX__PUBLIC_KEYS_HASH,\n },\n hash::poseidon2_hash_with_separator,\n point::POINT_LENGTH,\n traits::{Deserialize, Hash, Serialize, ToField},\n};\n\nuse dep::std::embedded_curve_ops::EmbeddedCurvePoint as Point;\nuse std::default::Default;\n\npub global PUBLIC_KEYS_LENGTH: u32 = 12;\n\npub struct PublicKeys {\n pub npk_m: NpkM,\n pub ivpk_m: IvpkM,\n pub ovpk_m: OvpkM,\n pub tpk_m: TpkM,\n}\n\npub trait ToPoint {\n fn to_point(self) -> Point;\n}\n\npub struct NpkM {\n pub inner: Point,\n}\n\nimpl ToPoint for NpkM {\n fn to_point(self) -> Point {\n self.inner\n }\n}\n\nimpl Serialize<POINT_LENGTH> for NpkM {\n fn serialize(self) -> [Field; POINT_LENGTH] {\n self.inner.serialize()\n }\n}\n\n// Note: If we store npk_m_hash directly we can remove this trait implementation. See #8091\nimpl Hash for NpkM {\n fn hash(self) -> Field {\n self.inner.hash()\n }\n}\n\npub struct IvpkM {\n pub inner: Point,\n}\n\nimpl ToPoint for IvpkM {\n fn to_point(self) -> Point {\n self.inner\n }\n}\n\nimpl Serialize<POINT_LENGTH> for IvpkM {\n fn serialize(self) -> [Field; POINT_LENGTH] {\n self.inner.serialize()\n }\n}\n\npub struct OvpkM {\n pub inner: Point,\n}\n\nimpl Hash for OvpkM {\n fn hash(self) -> Field {\n self.inner.hash()\n }\n}\n\nimpl ToPoint for OvpkM {\n fn to_point(self) -> Point {\n self.inner\n }\n}\n\nimpl Serialize<POINT_LENGTH> for OvpkM {\n fn serialize(self) -> [Field; POINT_LENGTH] {\n self.inner.serialize()\n }\n}\n\npub struct TpkM {\n pub inner: Point,\n}\n\nimpl ToPoint for TpkM {\n fn to_point(self) -> Point {\n self.inner\n }\n}\n\nimpl Serialize<POINT_LENGTH> for TpkM {\n fn serialize(self) -> [Field; POINT_LENGTH] {\n self.inner.serialize()\n }\n}\n\nimpl Default for PublicKeys {\n fn default() -> Self {\n PublicKeys {\n npk_m: NpkM {\n inner: Point { x: DEFAULT_NPK_M_X, y: DEFAULT_NPK_M_Y, is_infinite: false },\n },\n ivpk_m: IvpkM {\n inner: Point { x: DEFAULT_IVPK_M_X, y: DEFAULT_IVPK_M_Y, is_infinite: false },\n },\n ovpk_m: OvpkM {\n inner: Point { x: DEFAULT_OVPK_M_X, y: DEFAULT_OVPK_M_Y, is_infinite: false },\n },\n tpk_m: TpkM {\n inner: Point { x: DEFAULT_TPK_M_X, y: DEFAULT_TPK_M_Y, is_infinite: false },\n },\n }\n }\n}\n\nimpl Eq for PublicKeys {\n fn eq(self, other: PublicKeys) -> bool {\n (self.npk_m.inner == other.npk_m.inner)\n & (self.ivpk_m.inner == other.ivpk_m.inner)\n & (self.ovpk_m.inner == other.ovpk_m.inner)\n & (self.tpk_m.inner == other.tpk_m.inner)\n }\n}\n\nimpl PublicKeys {\n pub fn hash(self) -> PublicKeysHash {\n PublicKeysHash::from_field(poseidon2_hash_with_separator(\n self.serialize(),\n GENERATOR_INDEX__PUBLIC_KEYS_HASH as Field,\n ))\n }\n}\n\nimpl Serialize<PUBLIC_KEYS_LENGTH> for PublicKeys {\n fn serialize(self) -> [Field; PUBLIC_KEYS_LENGTH] {\n [\n self.npk_m.inner.x,\n self.npk_m.inner.y,\n self.npk_m.inner.is_infinite as Field,\n self.ivpk_m.inner.x,\n self.ivpk_m.inner.y,\n self.ivpk_m.inner.is_infinite as Field,\n self.ovpk_m.inner.x,\n self.ovpk_m.inner.y,\n self.ovpk_m.inner.is_infinite as Field,\n self.tpk_m.inner.x,\n self.tpk_m.inner.y,\n self.tpk_m.inner.is_infinite as Field,\n ]\n }\n}\n\nimpl Deserialize<PUBLIC_KEYS_LENGTH> for PublicKeys {\n fn deserialize(serialized: [Field; PUBLIC_KEYS_LENGTH]) -> PublicKeys {\n PublicKeys {\n npk_m: NpkM {\n inner: Point {\n x: serialized[0],\n y: serialized[1],\n is_infinite: serialized[2] as bool,\n },\n },\n ivpk_m: IvpkM {\n inner: Point {\n x: serialized[3],\n y: serialized[4],\n is_infinite: serialized[5] as bool,\n },\n },\n ovpk_m: OvpkM {\n inner: Point {\n x: serialized[6],\n y: serialized[7],\n is_infinite: serialized[8] as bool,\n },\n },\n tpk_m: TpkM {\n inner: Point {\n x: serialized[9],\n y: serialized[10],\n is_infinite: serialized[11] as bool,\n },\n },\n }\n }\n}\n\npub struct AddressPoint {\n pub inner: Point,\n}\n\nimpl ToPoint for AddressPoint {\n fn to_point(self) -> Point {\n self.inner\n }\n}\n\n#[test]\nunconstrained fn compute_public_keys_hash() {\n let keys = PublicKeys {\n npk_m: NpkM { inner: Point { x: 1, y: 2, is_infinite: false } },\n ivpk_m: IvpkM { inner: Point { x: 3, y: 4, is_infinite: false } },\n ovpk_m: OvpkM { inner: Point { x: 5, y: 6, is_infinite: false } },\n tpk_m: TpkM { inner: Point { x: 7, y: 8, is_infinite: false } },\n };\n\n let actual = keys.hash();\n let expected_public_keys_hash =\n 0x0fecd9a32db731fec1fded1b9ff957a1625c069245a3613a2538bd527068b0ad;\n\n assert(actual.to_field() == expected_public_keys_hash);\n}\n\n#[test]\nunconstrained fn compute_default_hash() {\n let keys = PublicKeys::default();\n\n let actual = keys.hash();\n let test_data_default_hash = 0x1d3bf1fb93ae0e9cda83b203dd91c3bfb492a9aecf30ec90e1057eced0f0e62d;\n\n assert(actual.to_field() == test_data_default_hash);\n}\n\n#[test]\nunconstrained fn test_public_keys_serialization() {\n let keys = PublicKeys {\n npk_m: NpkM { inner: Point { x: 1, y: 2, is_infinite: false } },\n ivpk_m: IvpkM { inner: Point { x: 3, y: 4, is_infinite: false } },\n ovpk_m: OvpkM { inner: Point { x: 5, y: 6, is_infinite: false } },\n tpk_m: TpkM { inner: Point { x: 7, y: 8, is_infinite: false } },\n };\n\n let serialized = keys.serialize();\n let deserialized = PublicKeys::deserialize(serialized);\n\n assert_eq(keys.npk_m.inner.x, deserialized.npk_m.inner.x);\n assert_eq(keys.npk_m.inner.y, deserialized.npk_m.inner.y);\n assert_eq(keys.ivpk_m.inner.x, deserialized.ivpk_m.inner.x);\n assert_eq(keys.ivpk_m.inner.y, deserialized.ivpk_m.inner.y);\n assert_eq(keys.ovpk_m.inner.x, deserialized.ovpk_m.inner.x);\n assert_eq(keys.ovpk_m.inner.y, deserialized.ovpk_m.inner.y);\n assert_eq(keys.tpk_m.inner.x, deserialized.tpk_m.inner.x);\n assert_eq(keys.tpk_m.inner.y, deserialized.tpk_m.inner.y);\n}\n"
2981
2761
  },
2982
- "307": {
2762
+ "309": {
2983
2763
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/shared_mutable/scheduled_delay_change.nr",
2984
2764
  "source": "use crate::traits::Empty;\nuse std::cmp::min;\n\nmod test;\n\n// This data structure is used by SharedMutable to store the minimum delay with which a ScheduledValueChange object can\n// schedule a change.\n// This delay is initially equal to INITIAL_DELAY, and can be safely mutated to any other value over time. This mutation\n// is performed via `schedule_change` in order to satisfy ScheduleValueChange constraints: if e.g. we allowed for the\n// delay to be decreased immediately then it'd be possible for the state variable to schedule a value change with a\n// reduced delay, invalidating prior private reads.\npub struct ScheduledDelayChange<let INITIAL_DELAY: u32> {\n // Both pre and post are stored in public storage, so by default they are zeroed. By wrapping them in an Option,\n // they default to Option::none(), which we detect and replace with INITIAL_DELAY. The end result is that a\n // ScheduledDelayChange that has not been initialized has a delay equal to INITIAL_DELAY, which is the desired\n // effect. Once initialized, the Option will never be none again.\n pub(crate) pre: Option<u32>,\n pub(crate) post: Option<u32>,\n // Block at which `post` value is used instead of `pre`\n pub(crate) block_of_change: u32,\n}\n\nimpl<let INITIAL_DELAY: u32> ScheduledDelayChange<INITIAL_DELAY> {\n pub fn new(pre: Option<u32>, post: Option<u32>, block_of_change: u32) -> Self {\n Self { pre, post, block_of_change }\n }\n\n /// Returns the current value of the delay stored in the data structure.\n /// This function only returns a meaningful value when called in public with the current block number - for\n /// historical private reads use `get_effective_minimum_delay_at` instead.\n pub fn get_current(self, current_block_number: u32) -> u32 {\n // The post value becomes the current one at the block of change, so any transaction that is included in the\n // block of change will use the post value.\n if current_block_number < self.block_of_change {\n self.pre.unwrap_or(INITIAL_DELAY)\n } else {\n self.post.unwrap_or(INITIAL_DELAY)\n }\n }\n\n /// Returns the scheduled change, i.e. the post-change delay and the block at which it will become the current\n /// delay. Note that this block may be in the past if the change has already taken place.\n /// Additionally, further changes might be later scheduled, potentially canceling the one returned by this function.\n pub fn get_scheduled(self) -> (u32, u32) {\n (self.post.unwrap_or(INITIAL_DELAY), self.block_of_change)\n }\n\n /// Mutates the delay change by scheduling a change at the current block number. This function is only meaningful\n /// when called in public with the current block number.\n /// The block at which the new delay will become effective is determined automatically:\n /// - when increasing the delay, the change is effective immediately\n /// - when reducing the delay, the change will take effect after a delay equal to the difference between old and\n /// new delay. For example, if reducing from 3 days to 1 day, the reduction will be scheduled to happen after 2\n /// days.\n pub fn schedule_change(&mut self, new: u32, current_block_number: u32) {\n let current = self.get_current(current_block_number);\n\n // When changing the delay value we must ensure that it is not possible to produce a value change with a delay\n // shorter than the current one.\n let blocks_until_change = if new > current {\n // Increasing the delay value can therefore be done immediately: this does not invalidate prior constraints\n // about how quickly a value might be changed (indeed it strengthens them).\n 0\n } else {\n // Decreasing the delay requires waiting for the difference between current and new delay in order to ensure\n // that overall the current delay is respected.\n //\n // current delay earliest value block of change\n // block block of change if delay remained unchanged\n // =======N=========================|================================X=================>\n // ^ ^ ^\n // |-------------------------|--------------------------------|\n // | blocks until change new delay |\n // ------------------------------------------------------------\n // current delay\n current - new\n };\n\n self.pre = Option::some(current);\n self.post = Option::some(new);\n self.block_of_change = current_block_number + blocks_until_change;\n }\n\n /// Returns the minimum delay before a value might mutate due to a scheduled change, from the perspective of some\n /// historical block number. It only returns a meaningful value when called in private with historical blocks. This\n /// function can be used alongside `ScheduledValueChange.get_block_horizon` to properly constrain the\n /// `max_block_number` transaction property when reading mutable shared state.\n /// This value typically equals the current delay at the block following the historical one (the earliest one in\n /// which a value change could be scheduled), but it also considers scenarios in which a delay reduction is\n /// scheduled to happen in the near future, resulting in a way to schedule a change with an overall delay lower than\n /// the current one.\n pub fn get_effective_minimum_delay_at(self, historical_block_number: u32) -> u32 {\n if self.block_of_change <= historical_block_number {\n // If no delay changes were scheduled, then the delay value at the historical block (post) is guaranteed to\n // hold due to how further delay changes would be scheduled by `schedule_change`.\n self.post.unwrap_or(INITIAL_DELAY)\n } else {\n // If a change is scheduled, then the effective delay might be lower than the current one (pre). At the\n // block of change the current delay will be the scheduled one, with an overall delay from the historical\n // block number equal to the number of blocks until the change plus the new delay. If this value is lower\n // than the current delay, then that is the effective minimum delay.\n //\n // historical\n // block delay actual earliest value\n // v block of change block of change\n // =========NS=====================|=============================X===========Y=====>\n // ^ ^ ^ ^\n // earliest block in | | |\n // which to schedule change | | |\n // | | | |\n // |----------------------|------------------------------ |\n // | blocks new delay |\n // | until change |\n // | |\n // |----------------------------------------------------------------|\n // current delay at the earliest block in\n // which to scheduled value change\n let blocks_until_change = self.block_of_change - (historical_block_number + 1);\n\n min(\n self.pre.unwrap_or(INITIAL_DELAY),\n blocks_until_change + self.post.unwrap_or(INITIAL_DELAY),\n )\n }\n }\n}\n\nimpl<let INITIAL_DELAY: u32> Eq for ScheduledDelayChange<INITIAL_DELAY> {\n fn eq(self, other: Self) -> bool {\n (self.pre == other.pre)\n & (self.post == other.post)\n & (self.block_of_change == other.block_of_change)\n }\n}\n\nimpl<let INITIAL_DELAY: u32> Empty for ScheduledDelayChange<INITIAL_DELAY> {\n fn empty() -> Self {\n Self { pre: Option::none(), post: Option::none(), block_of_change: 0 }\n }\n}\n"
2985
2765
  },
2986
- "309": {
2766
+ "311": {
2987
2767
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/shared_mutable/scheduled_value_change.nr",
2988
2768
  "source": "use crate::traits::Empty;\nuse std::cmp::min;\n\nmod test;\n\n// This data structure is used by SharedMutable to represent a value that changes from `pre` to `post` at some block\n// called the `block_of_change`. The value can only be made to change by scheduling a change event at some future block\n// of change after some minimum delay measured in blocks has elapsed. This means that at any given block number we know\n// both the current value and the smallest block number at which the value might change - this is called the\n// 'block horizon'.\npub struct ScheduledValueChange<T> {\n pub(crate) pre: T,\n pub(crate) post: T,\n // Block at which `post` value is used instead of `pre`\n pub(crate) block_of_change: u32,\n}\n\nimpl<T> ScheduledValueChange<T> {\n pub fn new(pre: T, post: T, block_of_change: u32) -> Self {\n Self { pre, post, block_of_change }\n }\n\n /// Returns the value stored in the data structure at a given block. This function can be called both in public\n /// (where `block_number` is simply the current block number, i.e. the number of the block in which the current\n /// transaction will be included) and in private (where `block_number` is the historical block number that is used\n /// to construct the proof).\n /// Reading in private is only safe if the transaction's `max_block_number` property is set to a value lower or\n /// equal to the block horizon (see `get_block_horizon()`).\n pub fn get_current_at(self, block_number: u32) -> T {\n // The post value becomes the current one at the block of change. This means different things in each realm:\n // - in public, any transaction that is included in the block of change will use the post value\n // - in private, any transaction that includes the block of change as part of the historical state will use the\n // post value (barring any follow-up changes)\n if block_number < self.block_of_change {\n self.pre\n } else {\n self.post\n }\n }\n\n /// Returns the scheduled change, i.e. the post-change value and the block at which it will become the current\n /// value. Note that this block may be in the past if the change has already taken place.\n /// Additionally, further changes might be later scheduled, potentially canceling the one returned by this function.\n pub fn get_scheduled(self) -> (T, u32) {\n (self.post, self.block_of_change)\n }\n\n // Returns the previous value. This is the value that is current up until the block of change. Note that this value\n // might not be the current anymore since block of change might have already passed.\n pub fn get_previous(self) -> (T, u32) {\n (self.pre, self.block_of_change)\n }\n\n /// Returns the largest block number at which the value returned by `get_current_at` is known to remain the current\n /// value. This value is only meaningful in private when constructing a proof at some `historical_block_number`,\n /// since due to its asynchronous nature private execution cannot know about any later scheduled changes.\n /// The caller of this function must know how quickly the value can change due to a scheduled change in the form of\n /// `minimum_delay`. If the delay itself is immutable, then this is just its duration. If the delay is mutable\n /// however, then this value is the 'effective minimum delay' (obtained by calling\n /// `ScheduledDelayChange.get_effective_minimum_delay_at`), which equals the minimum number of blocks that need to\n /// elapse from the next block until the value changes, regardless of further delay changes.\n /// The value returned by `get_current_at` in private when called with a historical block number is only safe to use\n /// if the transaction's `max_block_number` property is set to a value lower or equal to the block horizon computed\n /// using the same historical block number.\n pub fn get_block_horizon(self, historical_block_number: u32, minimum_delay: u32) -> u32 {\n // The block horizon is the very last block in which the current value is known. Any block past the horizon\n // (i.e. with a block number larger than the block horizon) may have a different current value. Reading the\n // current value in private typically requires constraining the maximum valid block number to be equal to the\n // block horizon.\n if historical_block_number >= self.block_of_change {\n // Once the block of change has been mined, the current value (post) will not change unless a new value\n // change is scheduled. This did not happen at the historical block number (or else it would not be\n // greater or equal to the block of change), and therefore could only happen after the historical block\n // number. The earliest would be the immediate next block, and so the smallest possible next block of change\n // equals `historical_block_number + 1 + minimum_delay`. Our block horizon is simply the previous block to\n // that one.\n //\n // block of historical\n // change block block horizon\n // =======|=============N===================H===========>\n // ^ ^\n // ---------------------\n // minimum delay\n historical_block_number + minimum_delay\n } else {\n // If the block of change has not yet been mined however, then there are two possible scenarios.\n // a) It could be so far into the future that the block horizon is actually determined by the minimum\n // delay, because a new change could be scheduled and take place _before_ the currently scheduled one.\n // This is similar to the scenario where the block of change is in the past: the time horizon is the\n // block prior to the earliest one in which a new block of change might land.\n //\n // historical\n // block block horizon block of change\n // =====N=================================H=================|=========>\n // ^ ^\n // | |\n // -----------------------------------\n // minimum delay\n //\n // b) It could be fewer than `minimum_delay` blocks away from the historical block number, in which case\n // the block of change would become the limiting factor for the time horizon, which would equal the\n // block right before the block of change (since by definition the value changes at the block of\n // change).\n //\n // historical block horizon\n // block block of change if not scheduled\n // =======N=============|===================H=================>\n // ^ ^ ^\n // | actual horizon |\n // -----------------------------------\n // minimum delay\n //\n // Note that the current implementation does not allow the caller to set the block of change to an arbitrary\n // value, and therefore scenario a) is not currently possible. However implementing #5501 would allow for\n // this to happen.\n // Because historical_block_number < self.block_of_change, then block_of_change > 0 and we can safely\n // subtract 1.\n min(\n self.block_of_change - 1,\n historical_block_number + minimum_delay,\n )\n }\n }\n\n /// Mutates the value by scheduling a change at the current block number. This function is only meaningful when\n /// called in public with the current block number.\n pub fn schedule_change(\n &mut self,\n new_value: T,\n current_block_number: u32,\n minimum_delay: u32,\n block_of_change: u32,\n ) {\n assert(block_of_change >= current_block_number + minimum_delay);\n\n self.pre = self.get_current_at(current_block_number);\n self.post = new_value;\n self.block_of_change = block_of_change;\n }\n}\n\nimpl<T> Eq for ScheduledValueChange<T>\nwhere\n T: Eq,\n{\n fn eq(self, other: Self) -> bool {\n (self.pre == other.pre)\n & (self.post == other.post)\n & (self.block_of_change == other.block_of_change)\n }\n}\n\nimpl<T> Empty for ScheduledValueChange<T>\nwhere\n T: Empty,\n{\n fn empty() -> Self {\n Self { pre: T::empty(), post: T::empty(), block_of_change: 0 }\n }\n}\n"
2989
2769
  },
2990
- "311": {
2770
+ "313": {
2991
2771
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/shared_mutable/shared_mutable_values.nr",
2992
2772
  "source": "use crate::{\n hash::poseidon2_hash,\n shared_mutable::{\n scheduled_delay_change::ScheduledDelayChange, scheduled_value_change::ScheduledValueChange,\n },\n traits::{Hash, Packable},\n utils::arrays,\n};\nuse std::meta::derive;\n\nmod test;\n\n/// SharedMutableValues is just a wrapper around ScheduledValueChange and ScheduledDelayChange that then allows us\n/// to wrap both of these values in WithHash. WithHash allows for efficient read of values in private.\n///\n/// Note that the WithHash optimization does not work in public (due to there being no unconstrained). But we also want\n/// to be able to read the values efficiently in public and we want to be able to read each value separately. Reading\n/// the values separately is tricky because ScheduledValueChange and ScheduledDelayChange are packed together (sdc and\n/// svc.block_of_change are stored in the same slot). For that reason we expose `unpack_value_change` and\n/// `unpack_delay_change` functions that can be used to extract the values from the packed representation. This\n/// is \"hacky\" but there is no way around it.\n#[derive(Eq)]\npub struct SharedMutableValues<T, let INITIAL_DELAY: u32> {\n pub svc: ScheduledValueChange<T>,\n pub sdc: ScheduledDelayChange<INITIAL_DELAY>,\n}\n\nimpl<T, let INITIAL_DELAY: u32> SharedMutableValues<T, INITIAL_DELAY> {\n pub fn new(svc: ScheduledValueChange<T>, sdc: ScheduledDelayChange<INITIAL_DELAY>) -> Self {\n SharedMutableValues { svc, sdc }\n }\n}\n\npub fn unpack_value_change<T, let N: u32>(packed: [Field; 2 * N + 1]) -> ScheduledValueChange<T>\nwhere\n T: Packable<N>,\n{\n let svc_pre_packed = arrays::subarray(packed, 1);\n let svc_post_packed = arrays::subarray(packed, N + 1);\n ScheduledValueChange::new(\n T::unpack(svc_pre_packed),\n T::unpack(svc_post_packed),\n packed[0] as u32,\n )\n}\n\npub fn unpack_delay_change<let INITIAL_DELAY: u32>(\n packed: Field,\n) -> ScheduledDelayChange<INITIAL_DELAY> {\n // This function expects to be called with just the first field of the packed representation, which contains sdc\n // and svc block_of_change. We'll discard the svc component.\n let svc_block_of_change = packed as u32;\n\n let mut tmp = (packed - svc_block_of_change as Field) / TWO_POW_32;\n let sdc_block_of_change = tmp as u32;\n\n tmp = (tmp - sdc_block_of_change as Field) / TWO_POW_32;\n let sdc_post_is_some = tmp as bool;\n\n tmp = (tmp - sdc_post_is_some as Field) / TWO_POW_8;\n let sdc_post_inner = tmp as u32;\n\n tmp = (tmp - sdc_post_inner as Field) / TWO_POW_32;\n let sdc_pre_is_some = tmp as bool;\n\n tmp = (tmp - sdc_pre_is_some as Field) / TWO_POW_8;\n let sdc_pre_inner = tmp as u32;\n\n ScheduledDelayChange {\n pre: if sdc_pre_is_some {\n Option::some(sdc_pre_inner)\n } else {\n Option::none()\n },\n post: if sdc_post_is_some {\n Option::some(sdc_post_inner)\n } else {\n Option::none()\n },\n block_of_change: sdc_block_of_change,\n }\n}\n\nglobal TWO_POW_32: Field = 2.pow_32(32);\nglobal TWO_POW_8: Field = 2.pow_32(8);\n\n// We pack to `2 * N + 1` fields because ScheduledValueChange contains T twice (hence `2 * N`) and we need one extra\n// field to store ScheduledDelayChange and the block_of_change of ScheduledValueChange.\nimpl<T, let INITIAL_DELAY: u32, let N: u32> Packable<2 * N + 1> for SharedMutableValues<T, INITIAL_DELAY>\nwhere\n T: Packable<N>,\n{\n fn pack(self) -> [Field; 2 * N + 1] {\n let mut result = [0; 2 * N + 1];\n\n // We pack sdc.pre, sdc.post, sdc.block_of_change and svc.block_of_change into a single field as follows:\n // [ sdc.pre_inner: u32 | sdc.pre_is_some: u8 | sdc.post_inner: u32 | sdc.post_is_some: u8 | sdc.block_of_change: u32 | svc.block_of_change: u32 ]\n result[0] = self.svc.block_of_change as Field\n + ((self.sdc.block_of_change as Field) * 2.pow_32(32))\n + ((self.sdc.post.is_some() as Field) * 2.pow_32(64))\n + ((self.sdc.post.unwrap_unchecked() as Field) * 2.pow_32(72))\n + ((self.sdc.pre.is_some() as Field) * 2.pow_32(104))\n + ((self.sdc.pre.unwrap_unchecked() as Field) * 2.pow_32(112));\n\n // Pack the pre and post values from ScheduledValueChange\n let svc_pre_packed = self.svc.pre.pack();\n let svc_post_packed = self.svc.post.pack();\n for i in 0..N {\n result[i + 1] = svc_pre_packed[i];\n result[i + 1 + N] = svc_post_packed[i];\n }\n result\n }\n\n fn unpack(fields: [Field; 2 * N + 1]) -> Self {\n let svc = unpack_value_change::<T, N>(fields);\n let sdc = unpack_delay_change::<INITIAL_DELAY>(fields[0]);\n Self::new(svc, sdc)\n }\n}\n\nimpl<T, let INITIAL_DELAY: u32, let N: u32> Hash for SharedMutableValues<T, INITIAL_DELAY>\nwhere\n T: Packable<N>,\n{\n fn hash(self) -> Field {\n poseidon2_hash(self.pack())\n }\n}\n"
2993
2773
  },
2994
- "314": {
2774
+ "316": {
2995
2775
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/storage/map.nr",
2996
2776
  "source": "use crate::{hash::poseidon2_hash, traits::ToField};\n\npub fn derive_storage_slot_in_map<K>(storage_slot: Field, key: K) -> Field\nwhere\n K: ToField,\n{\n poseidon2_hash([storage_slot, key.to_field()])\n}\n\nmod test {\n use crate::{address::AztecAddress, storage::map::derive_storage_slot_in_map, traits::FromField};\n\n #[test]\n fn test_derive_storage_slot_in_map_matches_typescript() {\n let map_slot = 0x132258fb6962c4387ba659d9556521102d227549a386d39f0b22d1890d59c2b5;\n let key = AztecAddress::from_field(\n 0x302dbc2f9b50a73283d5fb2f35bc01eae8935615817a0b4219a057b2ba8a5a3f,\n );\n\n let slot = derive_storage_slot_in_map(map_slot, key);\n\n // The following value was generated by `map_slot.test.ts`\n let slot_from_typescript =\n 0x15b9fe39449affd8b377461263e9d2b610b9ad40580553500b4e41d9cbd887ac;\n\n assert_eq(slot, slot_from_typescript);\n }\n}\n"
2997
2777
  },
2998
- "332": {
2778
+ "334": {
2999
2779
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/type_packing.nr",
3000
2780
  "source": "use crate::traits::Packable;\n\nglobal BOOL_PACKED_LEN: u32 = 1;\nglobal U8_PACKED_LEN: u32 = 1;\nglobal U16_PACKED_LEN: u32 = 1;\nglobal U32_PACKED_LEN: u32 = 1;\nglobal U64_PACKED_LEN: u32 = 1;\nglobal U128_PACKED_LEN: u32 = 1;\nglobal FIELD_PACKED_LEN: u32 = 1;\nglobal I8_PACKED_LEN: u32 = 1;\nglobal I16_PACKED_LEN: u32 = 1;\nglobal I32_PACKED_LEN: u32 = 1;\nglobal I64_PACKED_LEN: u32 = 1;\n\nimpl Packable<BOOL_PACKED_LEN> for bool {\n fn pack(self) -> [Field; BOOL_PACKED_LEN] {\n [self as Field]\n }\n\n fn unpack(fields: [Field; BOOL_PACKED_LEN]) -> bool {\n fields[0] as bool\n }\n}\n\nimpl Packable<U8_PACKED_LEN> for u8 {\n fn pack(self) -> [Field; U8_PACKED_LEN] {\n [self as Field]\n }\n\n fn unpack(fields: [Field; U8_PACKED_LEN]) -> Self {\n fields[0] as u8\n }\n}\n\nimpl Packable<U16_PACKED_LEN> for u16 {\n fn pack(self) -> [Field; U16_PACKED_LEN] {\n [self as Field]\n }\n\n fn unpack(fields: [Field; U16_PACKED_LEN]) -> Self {\n fields[0] as u16\n }\n}\n\nimpl Packable<U32_PACKED_LEN> for u32 {\n fn pack(self) -> [Field; U32_PACKED_LEN] {\n [self as Field]\n }\n\n fn unpack(fields: [Field; U32_PACKED_LEN]) -> Self {\n fields[0] as u32\n }\n}\n\nimpl Packable<U64_PACKED_LEN> for u64 {\n fn pack(self) -> [Field; U64_PACKED_LEN] {\n [self as Field]\n }\n\n fn unpack(fields: [Field; U64_PACKED_LEN]) -> Self {\n fields[0] as u64\n }\n}\n\nimpl Packable<U128_PACKED_LEN> for u128 {\n fn pack(self) -> [Field; U128_PACKED_LEN] {\n [self as Field]\n }\n\n fn unpack(fields: [Field; U128_PACKED_LEN]) -> Self {\n fields[0] as u128\n }\n}\n\nimpl Packable<FIELD_PACKED_LEN> for Field {\n fn pack(self) -> [Field; FIELD_PACKED_LEN] {\n [self]\n }\n\n fn unpack(fields: [Field; FIELD_PACKED_LEN]) -> Self {\n fields[0]\n }\n}\n\nimpl Packable<I8_PACKED_LEN> for i8 {\n fn pack(self) -> [Field; I8_PACKED_LEN] {\n [self as Field]\n }\n\n fn unpack(fields: [Field; I8_PACKED_LEN]) -> Self {\n fields[0] as i8\n }\n}\n\nimpl Packable<I16_PACKED_LEN> for i16 {\n fn pack(self) -> [Field; I16_PACKED_LEN] {\n [self as Field]\n }\n\n fn unpack(fields: [Field; I16_PACKED_LEN]) -> Self {\n fields[0] as i16\n }\n}\n\nimpl Packable<I32_PACKED_LEN> for i32 {\n fn pack(self) -> [Field; I32_PACKED_LEN] {\n [self as Field]\n }\n\n fn unpack(fields: [Field; I32_PACKED_LEN]) -> Self {\n fields[0] as i32\n }\n}\n\nimpl Packable<I64_PACKED_LEN> for i64 {\n fn pack(self) -> [Field; I64_PACKED_LEN] {\n [self as Field]\n }\n\n fn unpack(fields: [Field; I64_PACKED_LEN]) -> Self {\n fields[0] as i64\n }\n}\n\nimpl<T, let N: u32, let M: u32> Packable<N * M> for [T; N]\nwhere\n T: Packable<M>,\n{\n fn pack(self) -> [Field; N * M] {\n let mut result: [Field; N * M] = std::mem::zeroed();\n let mut serialized: [Field; M] = std::mem::zeroed();\n for i in 0..N {\n serialized = self[i].pack();\n for j in 0..M {\n result[i * M + j] = serialized[j];\n }\n }\n result\n }\n\n fn unpack(fields: [Field; N * M]) -> Self {\n let mut reader = crate::utils::reader::Reader::new(fields);\n let mut result: [T; N] = std::mem::zeroed();\n reader.read_struct_array::<T, M, N>(Packable::unpack, result)\n }\n}\n\n#[test]\nfn test_u16_packing() {\n let a: u16 = 10;\n assert_eq(a, u16::unpack(a.pack()));\n}\n\n#[test]\nfn test_i8_packing() {\n let a: i8 = -10;\n assert_eq(a, i8::unpack(a.pack()));\n}\n\n#[test]\nfn test_i16_packing() {\n let a: i16 = -10;\n assert_eq(a, i16::unpack(a.pack()));\n}\n\n#[test]\nfn test_i32_packing() {\n let a: i32 = -10;\n assert_eq(a, i32::unpack(a.pack()));\n}\n\n#[test]\nfn test_i64_packing() {\n let a: i64 = -10;\n assert_eq(a, i64::unpack(a.pack()));\n}\n"
3001
2781
  },
3002
- "333": {
2782
+ "335": {
3003
2783
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/type_serialization.nr",
3004
2784
  "source": "use crate::traits::{Deserialize, Serialize};\n\nglobal BOOL_SERIALIZED_LEN: u32 = 1;\nglobal U8_SERIALIZED_LEN: u32 = 1;\nglobal U16_SERIALIZED_LEN: u32 = 1;\nglobal U32_SERIALIZED_LEN: u32 = 1;\nglobal U64_SERIALIZED_LEN: u32 = 1;\nglobal U128_SERIALIZED_LEN: u32 = 1;\nglobal FIELD_SERIALIZED_LEN: u32 = 1;\nglobal I8_SERIALIZED_LEN: u32 = 1;\nglobal I16_SERIALIZED_LEN: u32 = 1;\nglobal I32_SERIALIZED_LEN: u32 = 1;\nglobal I64_SERIALIZED_LEN: u32 = 1;\n\nimpl Serialize<BOOL_SERIALIZED_LEN> for bool {\n fn serialize(self) -> [Field; BOOL_SERIALIZED_LEN] {\n [self as Field]\n }\n}\n\nimpl Deserialize<BOOL_SERIALIZED_LEN> for bool {\n fn deserialize(fields: [Field; BOOL_SERIALIZED_LEN]) -> bool {\n fields[0] as bool\n }\n}\n\nimpl Serialize<U8_SERIALIZED_LEN> for u8 {\n fn serialize(self) -> [Field; U8_SERIALIZED_LEN] {\n [self as Field]\n }\n}\n\nimpl Deserialize<U8_SERIALIZED_LEN> for u8 {\n fn deserialize(fields: [Field; U8_SERIALIZED_LEN]) -> Self {\n fields[0] as u8\n }\n}\n\nimpl Serialize<U16_SERIALIZED_LEN> for u16 {\n fn serialize(self) -> [Field; U16_SERIALIZED_LEN] {\n [self as Field]\n }\n}\n\nimpl Deserialize<U16_SERIALIZED_LEN> for u16 {\n fn deserialize(fields: [Field; U16_SERIALIZED_LEN]) -> Self {\n fields[0] as u16\n }\n}\n\nimpl Serialize<U32_SERIALIZED_LEN> for u32 {\n fn serialize(self) -> [Field; U32_SERIALIZED_LEN] {\n [self as Field]\n }\n}\n\nimpl Deserialize<U32_SERIALIZED_LEN> for u32 {\n fn deserialize(fields: [Field; U32_SERIALIZED_LEN]) -> Self {\n fields[0] as u32\n }\n}\n\nimpl Serialize<U64_SERIALIZED_LEN> for u64 {\n fn serialize(self) -> [Field; U64_SERIALIZED_LEN] {\n [self as Field]\n }\n}\n\nimpl Deserialize<U64_SERIALIZED_LEN> for u64 {\n fn deserialize(fields: [Field; U64_SERIALIZED_LEN]) -> Self {\n fields[0] as u64\n }\n}\n\nimpl Serialize<U128_SERIALIZED_LEN> for u128 {\n fn serialize(self) -> [Field; U128_SERIALIZED_LEN] {\n [self as Field]\n }\n}\n\nimpl Deserialize<U128_SERIALIZED_LEN> for u128 {\n fn deserialize(fields: [Field; U128_SERIALIZED_LEN]) -> Self {\n fields[0] as u128\n }\n}\n\nimpl Serialize<FIELD_SERIALIZED_LEN> for Field {\n fn serialize(self) -> [Field; FIELD_SERIALIZED_LEN] {\n [self]\n }\n}\n\nimpl Deserialize<FIELD_SERIALIZED_LEN> for Field {\n fn deserialize(fields: [Field; FIELD_SERIALIZED_LEN]) -> Self {\n fields[0]\n }\n}\n\nimpl Serialize<I8_SERIALIZED_LEN> for i8 {\n fn serialize(self) -> [Field; I8_SERIALIZED_LEN] {\n [self as Field]\n }\n}\n\nimpl Deserialize<I8_SERIALIZED_LEN> for i8 {\n fn deserialize(fields: [Field; I8_SERIALIZED_LEN]) -> Self {\n fields[0] as i8\n }\n}\n\nimpl Serialize<I16_SERIALIZED_LEN> for i16 {\n fn serialize(self) -> [Field; I16_SERIALIZED_LEN] {\n [self as Field]\n }\n}\n\nimpl Deserialize<I16_SERIALIZED_LEN> for i16 {\n fn deserialize(fields: [Field; I16_SERIALIZED_LEN]) -> Self {\n fields[0] as i16\n }\n}\n\nimpl Serialize<I32_SERIALIZED_LEN> for i32 {\n fn serialize(self) -> [Field; I32_SERIALIZED_LEN] {\n [self as Field]\n }\n}\n\nimpl Deserialize<I32_SERIALIZED_LEN> for i32 {\n fn deserialize(fields: [Field; I32_SERIALIZED_LEN]) -> Self {\n fields[0] as i32\n }\n}\n\nimpl Serialize<I64_SERIALIZED_LEN> for i64 {\n fn serialize(self) -> [Field; I64_SERIALIZED_LEN] {\n [self as Field]\n }\n}\n\nimpl Deserialize<I64_SERIALIZED_LEN> for i64 {\n fn deserialize(fields: [Field; I64_SERIALIZED_LEN]) -> Self {\n fields[0] as i64\n }\n}\n\nimpl<T, let N: u32, let M: u32> Serialize<N * M> for [T; N]\nwhere\n T: Serialize<M>,\n{\n fn serialize(self) -> [Field; N * M] {\n let mut result: [Field; N * M] = std::mem::zeroed();\n let mut serialized: [Field; M] = std::mem::zeroed();\n for i in 0..N {\n serialized = self[i].serialize();\n for j in 0..M {\n result[i * M + j] = serialized[j];\n }\n }\n result\n }\n}\n\nimpl<T, let N: u32, let M: u32> Deserialize<N * M> for [T; N]\nwhere\n T: Deserialize<M>,\n{\n fn deserialize(fields: [Field; N * M]) -> Self {\n let mut reader = crate::utils::reader::Reader::new(fields);\n let mut result: [T; N] = std::mem::zeroed();\n reader.read_struct_array::<T, M, N>(Deserialize::deserialize, result)\n }\n}\n\n#[test]\nfn test_u16_serialization() {\n let a: u16 = 10;\n assert_eq(a, u16::deserialize(a.serialize()));\n}\n\n#[test]\nfn test_i8_serialization() {\n let a: i8 = -10;\n assert_eq(a, i8::deserialize(a.serialize()));\n}\n\n#[test]\nfn test_i16_serialization() {\n let a: i16 = -10;\n assert_eq(a, i16::deserialize(a.serialize()));\n}\n\n#[test]\nfn test_i32_serialization() {\n let a: i32 = -10;\n assert_eq(a, i32::deserialize(a.serialize()));\n}\n\n#[test]\nfn test_i64_serialization() {\n let a: i64 = -10;\n assert_eq(a, i64::deserialize(a.serialize()));\n}\n"
3005
2785
  },
3006
- "349": {
2786
+ "351": {
3007
2787
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/utils/arrays.nr",
3008
2788
  "source": "pub mod assert_array_appended;\npub mod assert_array_prepended;\npub mod assert_combined_array;\npub mod assert_combined_transformed_array;\npub mod assert_exposed_sorted_transformed_value_array;\npub mod assert_sorted_array;\npub mod assert_sorted_transformed_value_array;\npub mod assert_split_sorted_transformed_value_arrays;\npub mod assert_split_transformed_value_arrays;\npub mod get_sorted_result;\npub mod get_sorted_tuple;\npub mod sort_by;\npub mod sort_by_counter;\n\n// Re-exports.\npub use assert_array_appended::{\n assert_array_appended, assert_array_appended_and_scoped, assert_array_appended_reversed,\n assert_array_appended_scoped,\n};\npub use assert_array_prepended::assert_array_prepended;\npub use assert_combined_array::{assert_combined_array, combine_arrays};\npub use assert_combined_transformed_array::{\n assert_combined_transformed_array, combine_and_transform_arrays,\n};\npub use assert_exposed_sorted_transformed_value_array::{\n assert_exposed_sorted_transformed_value_array,\n get_order_hints::{get_order_hints_asc, get_order_hints_desc, OrderHint},\n};\npub use assert_sorted_array::assert_sorted_array;\npub use assert_sorted_transformed_value_array::{\n assert_sorted_transformed_value_array, assert_sorted_transformed_value_array_capped_size,\n};\npub use assert_split_sorted_transformed_value_arrays::{\n assert_split_sorted_transformed_value_arrays_asc,\n assert_split_sorted_transformed_value_arrays_desc,\n get_split_order_hints::{get_split_order_hints_asc, get_split_order_hints_desc, SplitOrderHints},\n};\npub use assert_split_transformed_value_arrays::assert_split_transformed_value_arrays;\npub use get_sorted_result::{get_sorted_result, SortedResult};\npub use sort_by_counter::{sort_by_counter_asc, sort_by_counter_desc};\n\nuse crate::traits::{Empty, is_empty};\n\npub fn subarray<let SRC_LEN: u32, let DST_LEN: u32>(\n src: [Field; SRC_LEN],\n offset: u32,\n) -> [Field; DST_LEN] {\n assert(offset + DST_LEN <= SRC_LEN, \"offset too large\");\n\n let mut dst: [Field; DST_LEN] = std::mem::zeroed();\n for i in 0..DST_LEN {\n dst[i] = src[i + offset];\n }\n\n dst\n}\n\n// Helper function to convert a validated array to BoundedVec.\n// Important: Only use it for validated arrays: validate_array(array) should be true.\npub unconstrained fn array_to_bounded_vec<T, let N: u32>(array: [T; N]) -> BoundedVec<T, N>\nwhere\n T: Empty + Eq,\n{\n let len = array_length(array);\n BoundedVec::from_parts_unchecked(array, len)\n}\n\n// Helper function to find the index of the first element in an array that satisfies a given predicate. If the element\n// is not found, the function returns N as the index.\npub unconstrained fn find_index_hint<T, let N: u32, Env>(\n array: [T; N],\n find: fn[Env](T) -> bool,\n) -> u32 {\n let mut index = N;\n for i in 0..N {\n // We check `index == N` to ensure that we only update the index if we haven't found a match yet.\n if (index == N) & find(array[i]) {\n index = i;\n }\n }\n index\n}\n\n// Routine which validates that all zero values of an array form a contiguous region at the end, i.e.,\n// of the form: [*,*,*...,0,0,0,0] where any * is non-zero. Note that a full array of non-zero values is\n// valid.\npub fn validate_array<T, let N: u32>(array: [T; N]) -> u32\nwhere\n T: Empty + Eq,\n{\n let mut seen_empty = false;\n let mut length = 0;\n for i in 0..N {\n if is_empty(array[i]) {\n seen_empty = true;\n } else {\n assert(seen_empty == false, \"invalid array\");\n length += 1;\n }\n }\n length\n}\n\n// Helper function to count the number of non-empty elements in a validated array.\n// Important: Only use it for validated arrays where validate_array(array) returns true,\n// which ensures that:\n// 1. All elements before the first empty element are non-empty\n// 2. All elements after and including the first empty element are empty\n// 3. The array forms a contiguous sequence of non-empty elements followed by empty elements\npub fn array_length<T, let N: u32>(array: [T; N]) -> u32\nwhere\n T: Empty + Eq,\n{\n // We get the length by checking the index of the first empty element.\n\n // Safety: This is safe because we have validated the array (see function doc above) and the emptiness\n // of the element and non-emptiness of the previous element is checked below.\n let length = unsafe { find_index_hint(array, |elem: T| is_empty(elem)) };\n if length != 0 {\n assert(!is_empty(array[length - 1]));\n }\n if length != N {\n assert(is_empty(array[length]));\n }\n length\n}\n\npub fn array_concat<T, let N: u32, let M: u32>(array1: [T; N], array2: [T; M]) -> [T; N + M] {\n let mut result = [array1[0]; N + M];\n for i in 1..N {\n result[i] = array1[i];\n }\n for i in 0..M {\n result[i + N] = array2[i];\n }\n result\n}\n/// This function assumes that `array1` and `array2` contain no more than N non-empty elements between them,\n/// if this is not the case then elements from the end of `array2` will be dropped.\npub fn array_merge<T, let N: u32>(array1: [T; N], array2: [T; N]) -> [T; N]\nwhere\n T: Empty + Eq,\n{\n // Safety: we constrain this array below\n let result = unsafe { array_merge_helper(array1, array2) };\n // We assume arrays have been validated. The only use cases so far are with previously validated arrays.\n let array1_len = array_length(array1);\n let mut add_from_left = true;\n for i in 0..N {\n add_from_left &= i != array1_len;\n if add_from_left {\n assert_eq(result[i], array1[i]);\n } else {\n assert_eq(result[i], array2[i - array1_len]);\n }\n }\n result\n}\n\nunconstrained fn array_merge_helper<T, let N: u32>(array1: [T; N], array2: [T; N]) -> [T; N]\nwhere\n T: Empty + Eq,\n{\n let mut result: [T; N] = [T::empty(); N];\n let mut i = 0;\n for elem in array1 {\n if !is_empty(elem) {\n result[i] = elem;\n i += 1;\n }\n }\n for elem in array2 {\n if !is_empty(elem) {\n result[i] = elem;\n i += 1;\n }\n }\n result\n}\n\n// Helper fn to create a subarray from a given array\npub fn array_splice<T, let N: u32, let M: u32>(array: [T; N], offset: u32) -> [T; M]\nwhere\n T: Empty,\n{\n assert(M + offset <= N, \"Subarray length larger than array length\");\n let mut result: [T; M] = [T::empty(); M];\n for i in 0..M {\n result[i] = array[offset + i];\n }\n result\n}\n\npub fn check_permutation<T, let N: u32>(\n original_array: [T; N],\n permuted_array: [T; N],\n original_indexes: [u32; N],\n)\nwhere\n T: Eq + Empty,\n{\n let mut seen_value = [false; N];\n for i in 0..N {\n let index = original_indexes[i];\n let original_value = original_array[index];\n assert(permuted_array[i].eq(original_value), \"Invalid index\");\n assert(!seen_value[index], \"Duplicated index\");\n seen_value[index] = true;\n }\n}\n\n// Helper function to find the index of the last element in an array, allowing empty elements.\n// e.g. useful for removing trailing 0s from [1, 0, 2, 0, 0, 0] -> [1, 0, 2]\n// Nothing to do with validated arrays. Correctness constrained by padded_array_length.\npub unconstrained fn find_last_value_index<T, let N: u32>(array: [T; N]) -> u32\nwhere\n T: Empty + Eq,\n{\n let mut index = N;\n for i in 0..N {\n let j = N - i - 1;\n // We check `index == N` to ensure that we only update the index if we haven't found a match yet.\n if (index == N) & !is_empty(array[j]) {\n index = j;\n }\n }\n index\n}\n\n// Routine which returns the length of an array right padded by empty elements\n// of the form: [*,*,*...,0,0,0,0] where * is any value (zeroes allowed).\n// See smoke_validate_array_trailing for examples.\n// Nothing to do with validated arrays. Correctness constrained by padded_array_length.\npub unconstrained fn unsafe_padded_array_length<T, let N: u32>(array: [T; N]) -> u32\nwhere\n T: Empty + Eq,\n{\n let index = find_last_value_index(array);\n if index == N {\n 0\n } else {\n index + 1\n }\n}\n\n// Routine which validates that zero values of an array form a contiguous region at the end, i.e.,\n// of the form: [*,*,*...,0,0,0,0] where * is any value (zeroes allowed).\npub fn padded_array_length<T, let N: u32>(array: [T; N]) -> u32\nwhere\n T: Empty + Eq,\n{\n // Safety: this value is constrained in the below loop.\n let length = unsafe { unsafe_padded_array_length(array) };\n // Check the elt just before length is non-zero:\n if length != 0 {\n assert(!is_empty(array[length - 1]), \"invalid right padded array\");\n }\n // Check all beyond length are zero:\n let mut check_zero = false;\n for i in 0..N {\n check_zero |= i == length;\n if check_zero {\n assert(is_empty(array[i]), \"invalid right padded array\");\n }\n }\n length\n}\n\n#[test]\nfn smoke_validate_array() {\n let valid_array: [Field; 0] = [];\n assert(validate_array(valid_array) == 0);\n\n let valid_array = [0];\n assert(validate_array(valid_array) == 0);\n\n let valid_array = [3];\n assert(validate_array(valid_array) == 1);\n\n let valid_array = [1, 2, 3];\n assert(validate_array(valid_array) == 3);\n\n let valid_array = [1, 2, 3, 0];\n assert(validate_array(valid_array) == 3);\n\n let valid_array = [1, 2, 3, 0, 0];\n assert(validate_array(valid_array) == 3);\n}\n\n#[test]\nfn smoke_validate_array_trailing() {\n let valid_array: [Field; 0] = [];\n assert(padded_array_length(valid_array) == 0);\n\n let valid_array = [0];\n assert(padded_array_length(valid_array) == 0);\n\n let valid_array = [3];\n assert(padded_array_length(valid_array) == 1);\n\n let valid_array = [1, 0, 3];\n assert(padded_array_length(valid_array) == 3);\n\n let valid_array = [1, 0, 3, 0];\n assert(padded_array_length(valid_array) == 3);\n\n let valid_array = [1, 2, 3, 0, 0];\n assert(padded_array_length(valid_array) == 3);\n\n let valid_array = [0, 0, 3, 0, 0];\n assert(padded_array_length(valid_array) == 3);\n}\n\n#[test(should_fail_with = \"invalid array\")]\nfn smoke_validate_array_invalid_case0() {\n let invalid_array = [0, 1];\n let _ = validate_array(invalid_array);\n}\n\n#[test(should_fail_with = \"invalid array\")]\nfn smoke_validate_array_invalid_case1() {\n let invalid_array = [1, 0, 0, 1, 0];\n let _ = validate_array(invalid_array);\n}\n\n#[test(should_fail_with = \"invalid array\")]\nfn smoke_validate_array_invalid_case2() {\n let invalid_array = [0, 0, 0, 0, 1];\n let _ = validate_array(invalid_array);\n}\n\n#[test]\nfn test_empty_array_length() {\n assert_eq(array_length([0]), 0);\n assert_eq(array_length([0, 0, 0]), 0);\n}\n\n#[test]\nfn test_array_length() {\n assert_eq(array_length([123]), 1);\n assert_eq(array_length([123, 0, 0]), 1);\n assert_eq(array_length([123, 456]), 2);\n assert_eq(array_length([123, 456, 0]), 2);\n}\n\n#[test]\nfn test_array_length_invalid_arrays() {\n // Result can be misleading (but correct) for invalid arrays.\n assert_eq(array_length([0, 0, 123]), 0);\n assert_eq(array_length([0, 123, 0]), 0);\n assert_eq(array_length([0, 123, 456]), 0);\n assert_eq(array_length([123, 0, 456]), 1);\n}\n\n#[test]\nunconstrained fn find_index_greater_than_min() {\n let values = [10, 20, 30, 40];\n let min = 22;\n let index = find_index_hint(values, |v: Field| min.lt(v));\n assert_eq(index, 2);\n}\n\n#[test]\nunconstrained fn find_index_not_found() {\n let values = [10, 20, 30, 40];\n let min = 100;\n let index = find_index_hint(values, |v: Field| min.lt(v));\n assert_eq(index, 4);\n}\n\n#[test]\nfn test_array_concat() {\n let array0 = [1, 2, 3];\n let array1 = [4, 5];\n let concatenated = array_concat(array0, array1);\n assert_eq(concatenated, [1, 2, 3, 4, 5]);\n}\n\n#[test]\nfn check_permutation_basic_test() {\n let original_array = [1, 2, 3];\n let permuted_array = [3, 1, 2];\n let indexes = [2, 0, 1];\n check_permutation(original_array, permuted_array, indexes);\n}\n\n#[test(should_fail_with = \"Duplicated index\")]\nfn check_permutation_duplicated_index() {\n let original_array = [0, 1, 0];\n let permuted_array = [1, 0, 0];\n let indexes = [1, 0, 0];\n check_permutation(original_array, permuted_array, indexes);\n}\n\n#[test(should_fail_with = \"Invalid index\")]\nfn check_permutation_invalid_index() {\n let original_array = [0, 1, 2];\n let permuted_array = [1, 0, 0];\n let indexes = [1, 0, 2];\n check_permutation(original_array, permuted_array, indexes);\n}\n"
3009
2789
  },
3010
- "352": {
2790
+ "354": {
3011
2791
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/utils/reader.nr",
3012
2792
  "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_bool(&mut self) -> bool {\n self.read() as bool\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 finish(self) {\n assert(self.offset == self.data.len(), \"Reader did not read all data\");\n }\n}\n"
3013
2793
  },
3014
- "358": {
3015
- "path": "/home/aztec-dev/nargo/github.com/noir-lang/sha256/v0.1.2/src/sha256.nr",
3016
- "source": "use std::hash::sha256_compression;\nuse std::runtime::is_unconstrained;\n\nuse constants::{\n BLOCK_BYTE_PTR, BLOCK_SIZE, HASH, INITIAL_STATE, INT_BLOCK, INT_BLOCK_SIZE, INT_SIZE,\n INT_SIZE_PTR, MSG_BLOCK, MSG_SIZE_PTR, STATE, TWO_POW_16, TWO_POW_24, TWO_POW_32, TWO_POW_8,\n};\n\nmod constants;\nmod tests;\n\n// Implementation of SHA-256 mapping a byte array of variable length to\n// 32 bytes.\n\n// Deprecated in favour of `sha256_var`\n// docs:start:sha256\npub fn sha256<let N: u32>(input: [u8; N]) -> HASH\n// docs:end:sha256\n{\n digest(input)\n}\n\n// SHA-256 hash function\n#[no_predicates]\npub fn digest<let N: u32>(msg: [u8; N]) -> HASH {\n sha256_var(msg, N as u64)\n}\n\n// Variable size SHA-256 hash\npub fn sha256_var<let N: u32>(msg: [u8; N], message_size: u64) -> HASH {\n let message_size = message_size as u32;\n assert(message_size <= N);\n\n if std::runtime::is_unconstrained() {\n // Safety: SHA256 is running as an unconstrained function.\n unsafe {\n __sha256_var(msg, message_size)\n }\n } else {\n let mut msg_block: MSG_BLOCK = [0; INT_BLOCK_SIZE];\n // Intermediate hash, starting with the canonical initial value\n let mut h: STATE = INITIAL_STATE;\n // Pointer into msg_block on a 64 byte scale\n let mut msg_byte_ptr = 0;\n let num_blocks = N / BLOCK_SIZE;\n for i in 0..num_blocks {\n let msg_start = BLOCK_SIZE * i;\n let (new_msg_block, new_msg_byte_ptr) =\n unsafe { build_msg_block(msg, message_size, msg_start) };\n\n if msg_start < message_size {\n msg_block = new_msg_block;\n }\n\n // Verify the block we are compressing was appropriately constructed\n let new_msg_byte_ptr = verify_msg_block(msg, message_size, msg_block, msg_start);\n if msg_start < message_size {\n msg_byte_ptr = new_msg_byte_ptr;\n }\n\n // If the block is filled, compress it.\n // An un-filled block is handled after this loop.\n if (msg_start < message_size) & (msg_byte_ptr == BLOCK_SIZE) {\n h = sha256_compression(msg_block, h);\n }\n }\n\n let modulo = N % BLOCK_SIZE;\n // Handle setup of the final msg block.\n // This case is only hit if the msg is less than the block size,\n // or our message cannot be evenly split into blocks.\n if modulo != 0 {\n let msg_start = BLOCK_SIZE * num_blocks;\n let (new_msg_block, new_msg_byte_ptr) =\n unsafe { build_msg_block(msg, message_size, msg_start) };\n\n if msg_start < message_size {\n msg_block = new_msg_block;\n }\n\n let new_msg_byte_ptr = verify_msg_block(msg, message_size, msg_block, msg_start);\n if msg_start < message_size {\n msg_byte_ptr = new_msg_byte_ptr;\n verify_msg_block_padding(msg_block, msg_byte_ptr);\n }\n }\n\n // If we had modulo == 0 then it means the last block was full,\n // and we can reset the pointer to zero to overwrite it.\n if msg_byte_ptr == BLOCK_SIZE {\n msg_byte_ptr = 0;\n }\n\n // Pad the rest such that we have a [u32; 2] block at the end representing the length\n // of the message, and a block of 1 0 ... 0 following the message (i.e. [1 << 7, 0, ..., 0]).\n // Here we rely on the fact that everything beyond the available input is set to 0.\n let index = msg_byte_ptr / INT_SIZE;\n msg_block[index] = set_item_byte_then_zeros(msg_block[index], msg_byte_ptr, 1 << 7);\n\n msg_byte_ptr = msg_byte_ptr + 1;\n let last_block = msg_block;\n\n // If we don't have room to write the size, compress the block and reset it.\n if msg_byte_ptr > MSG_SIZE_PTR {\n h = sha256_compression(msg_block, h);\n // `attach_len_to_msg_block` will zero out everything after the `msg_byte_ptr`.\n msg_byte_ptr = 0;\n }\n\n msg_block = unsafe { attach_len_to_msg_block(msg_block, msg_byte_ptr, message_size) };\n\n verify_msg_len(msg_block, last_block, msg_byte_ptr, message_size);\n\n hash_final_block(msg_block, h)\n }\n}\n\n// Variable size SHA-256 hash\nunconstrained fn __sha256_var<let N: u32>(msg: [u8; N], message_size: u32) -> HASH {\n let num_full_blocks = message_size / BLOCK_SIZE;\n // Intermediate hash, starting with the canonical initial value\n let mut h: STATE = INITIAL_STATE;\n // Pointer into msg_block on a 64 byte scale\n for i in 0..num_full_blocks {\n let (msg_block, _) = build_msg_block(msg, message_size, BLOCK_SIZE * i);\n h = sha256_compression(msg_block, h);\n }\n\n // Handle setup of the final msg block.\n // This case is only hit if the msg is less than the block size,\n // or our message cannot be evenly split into blocks.\n let modulo = message_size % BLOCK_SIZE;\n let (mut msg_block, mut msg_byte_ptr): (INT_BLOCK, u32) = if modulo != 0 {\n let msg_start = BLOCK_SIZE * num_full_blocks;\n let (new_msg_block, new_msg_byte_ptr) = build_msg_block(msg, message_size, msg_start);\n\n (new_msg_block, new_msg_byte_ptr)\n } else {\n // If we had modulo == 0 then it means the last block was full,\n // and we can reset the pointer to zero to overwrite it.\n ([0; INT_BLOCK_SIZE], 0)\n };\n\n // Pad the rest such that we have a [u32; 2] block at the end representing the length\n // of the message, and a block of 1 0 ... 0 following the message (i.e. [1 << 7, 0, ..., 0]).\n // Here we rely on the fact that everything beyond the available input is set to 0.\n let index = msg_byte_ptr / INT_SIZE;\n msg_block[index] = set_item_byte_then_zeros(msg_block[index], msg_byte_ptr, 1 << 7);\n\n // If we don't have room to write the size, compress the block and reset it.\n let (h, mut msg_byte_ptr): (STATE, u32) = if msg_byte_ptr >= MSG_SIZE_PTR {\n // `attach_len_to_msg_block` will zero out everything after the `msg_byte_ptr`.\n (sha256_compression(msg_block, h), 0)\n } else {\n (h, msg_byte_ptr + 1)\n };\n msg_block = attach_len_to_msg_block(msg_block, msg_byte_ptr, message_size);\n\n hash_final_block(msg_block, h)\n}\n\n// Take `BLOCK_SIZE` number of bytes from `msg` starting at `msg_start`.\n// Returns the block and the length that has been copied rather than padded with zeros.\nunconstrained fn build_msg_block<let N: u32>(\n msg: [u8; N],\n message_size: u32,\n msg_start: u32,\n) -> (MSG_BLOCK, BLOCK_BYTE_PTR) {\n let mut msg_block: MSG_BLOCK = [0; INT_BLOCK_SIZE];\n\n // We insert `BLOCK_SIZE` bytes (or up to the end of the message)\n let block_input = if message_size < msg_start {\n // This function is sometimes called with `msg_start` past the end of the message.\n // In this case we return an empty block and zero pointer to signal that the result should be ignored.\n 0\n } else if message_size < msg_start + BLOCK_SIZE {\n message_size - msg_start\n } else {\n BLOCK_SIZE\n };\n\n // Figure out the number of items in the int array that we have to pack.\n // e.g. if the input is [0,1,2,3,4,5] then we need to pack it as 2 items: [0123, 4500]\n let mut int_input = block_input / INT_SIZE;\n if block_input % INT_SIZE != 0 {\n int_input = int_input + 1;\n };\n\n for i in 0..int_input {\n let mut msg_item: u32 = 0;\n // Always construct the integer as 4 bytes, even if it means going beyond the input.\n for j in 0..INT_SIZE {\n let k = i * INT_SIZE + j;\n let msg_byte = if k < block_input {\n msg[msg_start + k]\n } else {\n 0\n };\n msg_item = lshift8(msg_item, 1) + msg_byte as u32;\n }\n msg_block[i] = msg_item;\n }\n\n // Returning the index as if it was a 64 byte array.\n // We have to project it down to 16 items and bit shifting to get a byte back if we need it.\n (msg_block, block_input)\n}\n\n// Verify the block we are compressing was appropriately constructed by `build_msg_block`\n// and matches the input data. Returns the index of the first unset item.\n// If `message_size` is less than `msg_start` then this is called with the old non-empty block;\n// in that case we can skip verification, ie. no need to check that everything is zero.\nfn verify_msg_block<let N: u32>(\n msg: [u8; N],\n message_size: u32,\n msg_block: MSG_BLOCK,\n msg_start: u32,\n) -> BLOCK_BYTE_PTR {\n let mut msg_byte_ptr = 0;\n let mut msg_end = msg_start + BLOCK_SIZE;\n if msg_end > N {\n msg_end = N;\n }\n // We might have to go beyond the input to pad the fields.\n if msg_end % INT_SIZE != 0 {\n msg_end = msg_end + INT_SIZE - msg_end % INT_SIZE;\n }\n\n // Reconstructed packed item.\n let mut msg_item: u32 = 0;\n\n // Inclusive at the end so that we can compare the last item.\n let mut i: u32 = 0;\n for k in msg_start..=msg_end {\n if k % INT_SIZE == 0 {\n // If we consumed some input we can compare against the block.\n if (msg_start < message_size) & (k > msg_start) {\n assert_eq(msg_block[i], msg_item as u32);\n i = i + 1;\n msg_item = 0;\n }\n }\n // Shift the accumulator\n msg_item = lshift8(msg_item, 1);\n // If we have input to consume, add it at the rightmost position.\n if k < message_size & k < msg_end {\n msg_item = msg_item + msg[k] as u32;\n msg_byte_ptr = msg_byte_ptr + 1;\n }\n }\n\n msg_byte_ptr\n}\n\n// Verify the block we are compressing was appropriately padded with zeros by `build_msg_block`.\n// This is only relevant for the last, potentially partially filled block.\nfn verify_msg_block_padding(msg_block: MSG_BLOCK, msg_byte_ptr: BLOCK_BYTE_PTR) {\n // Check all the way to the end of the block.\n verify_msg_block_zeros(msg_block, msg_byte_ptr, INT_BLOCK_SIZE);\n}\n\n// Verify that a region of ints in the message block are (partially) zeroed,\n// up to an (exclusive) maximum which can either be the end of the block\n// or just where the size is to be written.\nfn verify_msg_block_zeros(\n msg_block: MSG_BLOCK,\n mut msg_byte_ptr: BLOCK_BYTE_PTR,\n max_int_byte_ptr: u32,\n) {\n // This variable is used to get around the compiler under-constrained check giving a warning.\n // We want to check against a constant zero, but if it does not come from the circuit inputs\n // or return values the compiler check will issue a warning.\n let zero = msg_block[0] - msg_block[0];\n\n // First integer which is supposed to be (partially) zero.\n let mut int_byte_ptr = msg_byte_ptr / INT_SIZE;\n\n // Check partial zeros.\n let modulo = msg_byte_ptr % INT_SIZE;\n if modulo != 0 {\n let zeros = INT_SIZE - modulo;\n let mask = if zeros == 3 {\n TWO_POW_24\n } else if zeros == 2 {\n TWO_POW_16\n } else {\n TWO_POW_8\n };\n assert_eq(msg_block[int_byte_ptr] % mask, zero);\n int_byte_ptr = int_byte_ptr + 1;\n }\n\n // Check the rest of the items.\n for i in 0..max_int_byte_ptr {\n if i >= int_byte_ptr {\n assert_eq(msg_block[i], zero);\n }\n }\n}\n\n// Verify that up to the byte pointer the two blocks are equal.\n// At the byte pointer the new block can be partially zeroed.\nfn verify_msg_block_equals_last(\n msg_block: MSG_BLOCK,\n last_block: MSG_BLOCK,\n mut msg_byte_ptr: BLOCK_BYTE_PTR,\n) {\n // msg_byte_ptr is the position at which they are no longer have to be the same.\n // First integer which is supposed to be (partially) zero contains that pointer.\n let mut int_byte_ptr = msg_byte_ptr / INT_SIZE;\n\n // Check partial zeros.\n let modulo = msg_byte_ptr % INT_SIZE;\n if modulo != 0 {\n // Reconstruct the partially zero item from the last block.\n let last_field = last_block[int_byte_ptr];\n let mut msg_item: u32 = 0;\n // Reset to where they are still equal.\n msg_byte_ptr = msg_byte_ptr - modulo;\n for i in 0..INT_SIZE {\n msg_item = lshift8(msg_item, 1);\n if i < modulo {\n msg_item = msg_item + get_item_byte(last_field, msg_byte_ptr) as u32;\n msg_byte_ptr = msg_byte_ptr + 1;\n }\n }\n assert_eq(msg_block[int_byte_ptr], msg_item);\n }\n\n for i in 0..INT_SIZE_PTR {\n if i < int_byte_ptr {\n assert_eq(msg_block[i], last_block[i]);\n }\n }\n}\n\n// Set the rightmost `zeros` number of bytes to 0.\n#[inline_always]\nfn set_item_zeros(item: u32, zeros: u8) -> u32 {\n lshift8(rshift8(item, zeros), zeros)\n}\n\n// Replace one byte in the item with a value, and set everything after it to zero.\nfn set_item_byte_then_zeros(msg_item: u32, msg_byte_ptr: BLOCK_BYTE_PTR, msg_byte: u8) -> u32 {\n let zeros = INT_SIZE - msg_byte_ptr % INT_SIZE;\n let zeroed_item = set_item_zeros(msg_item, zeros as u8);\n let new_item = byte_into_item(msg_byte, msg_byte_ptr);\n zeroed_item + new_item\n}\n\n// Get a byte of a message item according to its overall position in the `BLOCK_SIZE` space.\nfn get_item_byte(mut msg_item: u32, msg_byte_ptr: BLOCK_BYTE_PTR) -> u8 {\n // How many times do we have to shift to the right to get to the position we want?\n let max_shifts = INT_SIZE - 1;\n let shifts = max_shifts - msg_byte_ptr % INT_SIZE;\n msg_item = rshift8(msg_item, shifts as u8);\n // At this point the byte we want is in the rightmost position.\n msg_item as u8\n}\n\n// Project a byte into a position in a field based on the overall block pointer.\n// For example putting 1 into pointer 5 would be 100, because overall we would\n// have [____, 0100] with indexes [0123,4567].\n#[inline_always]\nfn byte_into_item(msg_byte: u8, msg_byte_ptr: BLOCK_BYTE_PTR) -> u32 {\n let mut msg_item = msg_byte as u32;\n // How many times do we have to shift to the left to get to the position we want?\n let max_shifts = INT_SIZE - 1;\n let shifts = max_shifts - msg_byte_ptr % INT_SIZE;\n lshift8(msg_item, shifts as u8)\n}\n\n// Construct a field out of 4 bytes.\n#[inline_always]\nfn make_item(b0: u8, b1: u8, b2: u8, b3: u8) -> u32 {\n let mut item = b0 as u32;\n item = lshift8(item, 1) + b1 as u32;\n item = lshift8(item, 1) + b2 as u32;\n item = lshift8(item, 1) + b3 as u32;\n item\n}\n\n// Shift by 8 bits to the left between 0 and 4 times.\n// Checks `is_unconstrained()` to just use a bitshift if we're running in an unconstrained context,\n// otherwise multiplies by 256.\n#[inline_always]\nfn lshift8(item: u32, shifts: u8) -> u32 {\n if is_unconstrained() {\n // Brillig wouldn't shift 0<<4 without overflow.\n if shifts >= 4 {\n 0\n } else {\n item << (8 * shifts)\n }\n } else {\n // We can do a for loop up to INT_SIZE or an if-else.\n if shifts == 0 {\n item\n } else if shifts == 1 {\n item * TWO_POW_8\n } else if shifts == 2 {\n item * TWO_POW_16\n } else if shifts == 3 {\n item * TWO_POW_24\n } else {\n // Doesn't make sense, but it's most likely called on 0 anyway.\n 0\n }\n }\n}\n\n// Shift by 8 bits to the right between 0 and 4 times.\n// Checks `is_unconstrained()` to just use a bitshift if we're running in an unconstrained context,\n// otherwise divides by 256.\nfn rshift8(item: u32, shifts: u8) -> u32 {\n if is_unconstrained() {\n item >> (8 * shifts)\n } else {\n // Division wouldn't work on `Field`.\n if shifts == 0 {\n item\n } else if shifts == 1 {\n item / TWO_POW_8\n } else if shifts == 2 {\n item / TWO_POW_16\n } else if shifts == 3 {\n item / TWO_POW_24\n } else {\n 0\n }\n }\n}\n\n// Zero out all bytes between the end of the message and where the length is appended,\n// then write the length into the last 8 bytes of the block.\nunconstrained fn attach_len_to_msg_block(\n mut msg_block: MSG_BLOCK,\n mut msg_byte_ptr: BLOCK_BYTE_PTR,\n message_size: u32,\n) -> MSG_BLOCK {\n // We assume that `msg_byte_ptr` is less than 57 because if not then it is reset to zero before calling this function.\n // In any case, fill blocks up with zeros until the last 64 bits (i.e. until msg_byte_ptr = 56).\n // There can be one item which has to be partially zeroed.\n let modulo = msg_byte_ptr % INT_SIZE;\n if modulo != 0 {\n // Index of the block in which we find the item we need to partially zero.\n let i = msg_byte_ptr / INT_SIZE;\n let zeros = INT_SIZE - modulo;\n msg_block[i] = set_item_zeros(msg_block[i], zeros as u8);\n msg_byte_ptr = msg_byte_ptr + zeros;\n }\n\n // The rest can be zeroed without bit shifting anything.\n for i in (msg_byte_ptr / INT_SIZE)..INT_SIZE_PTR {\n msg_block[i] = 0;\n }\n\n // Set the last two 4 byte ints as the first/second half of the 8 bytes of the length.\n let len = 8 * message_size;\n let len_bytes: [u8; 8] = (len as Field).to_be_bytes();\n for i in 0..=1 {\n let shift = i * 4;\n msg_block[INT_SIZE_PTR + i] = make_item(\n len_bytes[shift],\n len_bytes[shift + 1],\n len_bytes[shift + 2],\n len_bytes[shift + 3],\n );\n }\n msg_block\n}\n\n// Verify that the message length was correctly written by `attach_len_to_msg_block`,\n// and that everything between the byte pointer and the size pointer was zeroed,\n// and that everything before the byte pointer was untouched.\nfn verify_msg_len(\n msg_block: MSG_BLOCK,\n last_block: MSG_BLOCK,\n msg_byte_ptr: BLOCK_BYTE_PTR,\n message_size: u32,\n) {\n // Check zeros up to the size pointer.\n verify_msg_block_zeros(msg_block, msg_byte_ptr, INT_SIZE_PTR);\n\n // Check that up to the pointer we match the last block.\n verify_msg_block_equals_last(msg_block, last_block, msg_byte_ptr);\n\n // We verify the message length was inserted correctly by reversing the byte decomposition.\n let mut reconstructed_len: u64 = 0;\n for i in INT_SIZE_PTR..INT_BLOCK_SIZE {\n reconstructed_len = reconstructed_len * TWO_POW_32;\n reconstructed_len = reconstructed_len + msg_block[i] as u64;\n }\n let len = 8 * message_size as u64;\n assert_eq(reconstructed_len, len);\n}\n\n// Perform the final compression, then transform the `STATE` into `HASH`.\nfn hash_final_block(msg_block: MSG_BLOCK, mut state: STATE) -> HASH {\n let mut out_h: HASH = [0; 32]; // Digest as sequence of bytes\n // Hash final padded block\n state = sha256_compression(msg_block, state);\n\n // Return final hash as byte array\n for j in 0..8 {\n let h_bytes: [u8; 4] = (state[j] as Field).to_be_bytes();\n for k in 0..4 {\n out_h[4 * j + k] = h_bytes[k];\n }\n }\n\n out_h\n}\n\nmod equivalence_test {\n\n #[test]\n fn test_implementations_agree(msg: [u8; 100], message_size: u64) {\n let message_size = message_size % 100;\n let unconstrained_sha = unsafe { super::__sha256_var(msg, message_size as u32) };\n let sha = super::sha256_var(msg, message_size);\n assert_eq(sha, unconstrained_sha);\n }\n}\n"
3017
- },
3018
- "46": {
3019
- "path": "std/option.nr",
3020
- "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"
3021
- },
3022
- "47": {
2794
+ "43": {
3023
2795
  "path": "std/panic.nr",
3024
2796
  "source": "pub fn panic<T, U, let N: u32>(message: fmtstr<N, T>) -> U {\n assert(false, message);\n crate::mem::zeroed()\n}\n"
3025
2797
  },
3026
- "54": {
3027
- "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-contracts/contracts/contract_instance_deployer_contract/src/main.nr",
2798
+ "50": {
2799
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-contracts/contracts/protocol/contract_instance_deployer_contract/src/main.nr",
3028
2800
  "source": "use dep::aztec::macros::aztec;\n\n#[aztec]\npub contract ContractInstanceDeployer {\n use dep::aztec::macros::{events::event, functions::{private, public, view}, storage::storage};\n use dep::aztec::prelude::{Map, SharedMutable};\n use dep::aztec::protocol_types::{\n address::{AztecAddress, PartialAddress},\n constants::{\n DEFAULT_UPDATE_DELAY, DEPLOYER_CONTRACT_INSTANCE_DEPLOYED_MAGIC_VALUE,\n DEPLOYER_CONTRACT_INSTANCE_UPDATED_MAGIC_VALUE, MINIMUM_UPDATE_DELAY,\n REGISTERER_CONTRACT_ADDRESS,\n },\n contract_class_id::ContractClassId,\n public_keys::PublicKeys,\n traits::{Serialize, ToField},\n utils::arrays::array_concat,\n };\n use dep::contract_class_registerer::ContractClassRegisterer;\n use std::meta::derive;\n\n #[derive(Serialize)]\n #[event]\n struct ContractInstanceDeployed {\n DEPLOYER_CONTRACT_INSTANCE_DEPLOYED_MAGIC_VALUE: Field,\n address: AztecAddress,\n version: u8,\n salt: Field,\n contract_class_id: ContractClassId,\n initialization_hash: Field,\n public_keys: PublicKeys,\n deployer: AztecAddress,\n }\n\n // We need to impl this separately because ts deserializes a point as two fields only.\n // We had issues that:\n // Notice how the 'is_infinite' field is deserialized as the next point.\n // {\n // masterNullifierPublicKey: Point {\n // x: Fr<0x0000000000000000000000000000000000000000000000000000000000000012>,\n // y: Fr<0x0000000000000000000000000000000000000000000000000000000000000034>,\n // isInfinite: false,\n // kind: 'point'\n // },\n // masterIncomingViewingPublicKey: Point {\n // x: Fr<0x0000000000000000000000000000000000000000000000000000000000000000>,\n // y: Fr<0x0000000000000000000000000000000000000000000000000000000000000056>,\n // isInfinite: false,\n // kind: 'point'\n // },\n // masterOutgoingViewingPublicKey: Point {\n // x: Fr<0x0000000000000000000000000000000000000000000000000000000000000078>,\n // y: Fr<0x0000000000000000000000000000000000000000000000000000000000000000>,\n // isInfinite: false,\n // kind: 'point'\n // },\n // masterTaggingPublicKey: Point {\n // x: Fr<0x0000000000000000000000000000000000000000000000000000000000000910>,\n // y: Fr<0x0000000000000000000000000000000000000000000000000000000000001112>,\n // isInfinite: false,\n // kind: 'point'\n // }\n\n impl ContractInstanceDeployed {\n fn serialize_non_standard(self) -> [Field; 15] {\n [\n self.DEPLOYER_CONTRACT_INSTANCE_DEPLOYED_MAGIC_VALUE,\n self.address.to_field(),\n self.version.to_field(),\n self.salt,\n self.contract_class_id.to_field(),\n self.initialization_hash,\n self.public_keys.npk_m.serialize()[0],\n self.public_keys.npk_m.serialize()[1],\n self.public_keys.ivpk_m.serialize()[0],\n self.public_keys.ivpk_m.serialize()[1],\n self.public_keys.ovpk_m.serialize()[0],\n self.public_keys.ovpk_m.serialize()[1],\n self.public_keys.tpk_m.serialize()[0],\n self.public_keys.tpk_m.serialize()[1],\n self.deployer.to_field(),\n ]\n }\n }\n\n #[derive(Serialize)]\n #[event]\n struct ContractInstanceUpdated {\n DEPLOYER_CONTRACT_INSTANCE_UPDATED_MAGIC_VALUE: Field,\n address: AztecAddress,\n prev_contract_class_id: ContractClassId,\n new_contract_class_id: ContractClassId,\n block_of_change: u32,\n }\n\n #[storage]\n struct Storage<Context> {\n updated_class_ids: Map<AztecAddress, SharedMutable<ContractClassId, DEFAULT_UPDATE_DELAY, Context>, Context>,\n }\n\n #[private]\n fn deploy(\n salt: Field,\n contract_class_id: ContractClassId,\n initialization_hash: Field,\n public_keys: PublicKeys,\n universal_deploy: bool,\n ) {\n // contract class must be registered to deploy an instance\n ContractClassRegisterer::at(REGISTERER_CONTRACT_ADDRESS)\n .assert_class_id_is_registered(contract_class_id)\n .call(&mut context);\n\n let deployer = if universal_deploy {\n AztecAddress::zero()\n } else {\n context.msg_sender()\n };\n\n let partial_address =\n PartialAddress::compute(contract_class_id, salt, initialization_hash, deployer);\n\n let address = AztecAddress::compute(public_keys, partial_address);\n\n // Emit the address as a nullifier to be able to prove that this instance has been (not) deployed\n context.push_nullifier(address.to_field());\n\n // Broadcast the event\n let event = ContractInstanceDeployed {\n DEPLOYER_CONTRACT_INSTANCE_DEPLOYED_MAGIC_VALUE,\n contract_class_id,\n address,\n public_keys,\n initialization_hash,\n salt,\n deployer,\n version: 1,\n };\n\n let payload = event.serialize_non_standard();\n dep::aztec::oracle::debug_log::debug_log_format(\"ContractInstanceDeployed: {}\", payload);\n\n let padded_log = array_concat(payload, [0; 3]);\n context.emit_private_log(padded_log);\n }\n\n #[public]\n fn update(new_contract_class_id: ContractClassId) {\n let address = context.msg_sender();\n\n assert(\n context.nullifier_exists(address.to_field(), context.this_address()),\n \"msg.sender is not deployed\",\n );\n\n assert(\n context.nullifier_exists(new_contract_class_id.to_field(), REGISTERER_CONTRACT_ADDRESS),\n \"New contract class is not registered\",\n );\n\n let scheduled_value_update = storage\n .updated_class_ids\n .at(address)\n .schedule_and_return_value_change(new_contract_class_id);\n let (prev_contract_class_id, block_of_change) = scheduled_value_update.get_previous();\n\n let event = ContractInstanceUpdated {\n DEPLOYER_CONTRACT_INSTANCE_UPDATED_MAGIC_VALUE,\n address,\n prev_contract_class_id,\n new_contract_class_id,\n block_of_change,\n };\n\n context.emit_public_log(event);\n }\n\n #[public]\n fn set_update_delay(new_update_delay: u32) {\n let address = context.msg_sender();\n\n assert(\n context.nullifier_exists(address.to_field(), context.this_address()),\n \"msg.sender is not deployed\",\n );\n\n assert(new_update_delay >= MINIMUM_UPDATE_DELAY, \"New update delay is too low\");\n\n storage.updated_class_ids.at(address).schedule_delay_change(new_update_delay);\n }\n\n #[public]\n #[view]\n fn get_update_delay() -> u32 {\n storage.updated_class_ids.at(context.msg_sender()).get_current_delay()\n }\n}\n"
3029
2801
  },
3030
- "55": {
3031
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/capsules/mod.nr",
3032
- "source": "use crate::oracle::capsules;\nuse protocol_types::{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<let N: u32>(self, value: T)\n where\n T: Serialize<N>,\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<let N: u32>(self, index: u32) -> T\n where\n T: Deserialize<N>,\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 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 use protocol_types::address::AztecAddress;\n\n global SLOT: Field = 1230;\n\n unconstrained fn setup() -> AztecAddress {\n TestEnvironment::new().utility().this_address()\n }\n\n #[test]\n unconstrained fn empty_array() {\n let contract_address = setup();\n\n let array: CapsuleArray<Field> = CapsuleArray::at(contract_address, SLOT);\n assert_eq(array.len(), 0);\n }\n\n #[test(should_fail_with = \"Attempted to read past the length of a CapsuleArray\")]\n unconstrained fn empty_array_read() {\n let contract_address = setup();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n let _: Field = array.get(0);\n }\n\n #[test]\n unconstrained fn array_push() {\n let contract_address = setup();\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 #[test(should_fail_with = \"Attempted to read past the length of a CapsuleArray\")]\n unconstrained fn read_past_len() {\n let contract_address = setup();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n array.push(5);\n\n let _ = array.get(1);\n }\n\n #[test]\n unconstrained fn array_remove_last() {\n let contract_address = setup();\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 #[test]\n unconstrained fn array_remove_some() {\n let contract_address = setup();\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 #[test]\n unconstrained fn array_remove_all() {\n let contract_address = setup();\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"
3033
- },
3034
- "56": {
2802
+ "52": {
3035
2803
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/call_interfaces.nr",
3036
2804
  "source": "use dep::protocol_types::{\n abis::function_selector::FunctionSelector,\n address::AztecAddress,\n traits::{Deserialize, ToField},\n};\n\nuse crate::context::{gas::GasOpts, private_context::PrivateContext, public_context::PublicContext};\n\nuse crate::hash::{hash_args, hash_calldata};\nuse crate::oracle::execution_cache;\n\npub trait CallInterface<let N: u32> {\n fn get_args(self) -> [Field];\n fn get_selector(self) -> FunctionSelector;\n fn get_name(self) -> str<N>;\n fn get_contract_address(self) -> AztecAddress;\n fn get_is_static(self) -> bool;\n}\n\n// PrivateCallInterface\n\npub struct PrivateCallInterface<let N: u32, T> {\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args_hash: Field,\n args: [Field],\n return_type: T,\n is_static: bool,\n}\n\nimpl<let N: u32, T> PrivateCallInterface<N, T> {\n pub fn new(\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args: [Field],\n is_static: bool,\n ) -> Self {\n let args_hash = hash_args(args);\n Self {\n target_contract,\n selector,\n name,\n args_hash,\n args,\n return_type: std::mem::zeroed(),\n is_static,\n }\n }\n\n pub fn call<let M: u32>(self, context: &mut PrivateContext) -> T\n where\n T: Deserialize<M>,\n {\n execution_cache::store(self.args, self.args_hash);\n let returns_hash = context.call_private_function_with_args_hash(\n self.target_contract,\n self.selector,\n self.args_hash,\n false,\n );\n let returns: T = returns_hash.get_preimage();\n returns\n }\n\n pub fn view<let M: u32>(self, context: &mut PrivateContext) -> T\n where\n T: Deserialize<M>,\n {\n execution_cache::store(self.args, self.args_hash);\n let returns_hash = context.call_private_function_with_args_hash(\n self.target_contract,\n self.selector,\n self.args_hash,\n true,\n );\n returns_hash.get_preimage()\n }\n}\n\nimpl<let N: u32, T> CallInterface<N> for PrivateCallInterface<N, T> {\n fn get_args(self) -> [Field] {\n self.args\n }\n\n fn get_selector(self) -> FunctionSelector {\n self.selector\n }\n\n fn get_name(self) -> str<N> {\n self.name\n }\n\n fn get_contract_address(self) -> AztecAddress {\n self.target_contract\n }\n\n fn get_is_static(self) -> bool {\n self.is_static\n }\n}\n\n// PrivateVoidCallInterface\n\npub struct PrivateVoidCallInterface<let N: u32> {\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args_hash: Field,\n args: [Field],\n return_type: (), // Unit type () indicates this interface is for functions that return nothing (void)\n is_static: bool,\n}\n\nimpl<let N: u32> PrivateVoidCallInterface<N> {\n pub fn new(\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args: [Field],\n is_static: bool,\n ) -> Self {\n let args_hash = hash_args(args);\n Self { target_contract, selector, name, args_hash, args, return_type: (), is_static }\n }\n\n pub fn call(self, context: &mut PrivateContext) {\n execution_cache::store(self.args, self.args_hash);\n context\n .call_private_function_with_args_hash(\n self.target_contract,\n self.selector,\n self.args_hash,\n false,\n )\n .assert_empty();\n }\n\n pub fn view(self, context: &mut PrivateContext) {\n execution_cache::store(self.args, self.args_hash);\n context\n .call_private_function_with_args_hash(\n self.target_contract,\n self.selector,\n self.args_hash,\n true,\n )\n .assert_empty();\n }\n}\n\nimpl<let N: u32> CallInterface<N> for PrivateVoidCallInterface<N> {\n fn get_args(self) -> [Field] {\n self.args\n }\n\n fn get_selector(self) -> FunctionSelector {\n self.selector\n }\n\n fn get_name(self) -> str<N> {\n self.name\n }\n\n fn get_contract_address(self) -> AztecAddress {\n self.target_contract\n }\n\n fn get_is_static(self) -> bool {\n self.is_static\n }\n}\n\n// PrivateStaticCallInterface\n\npub struct PrivateStaticCallInterface<let N: u32, T> {\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args_hash: Field,\n args: [Field],\n return_type: T,\n is_static: bool,\n}\n\nimpl<let N: u32, T> PrivateStaticCallInterface<N, T> {\n pub fn new(\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args: [Field],\n ) -> Self {\n let args_hash = hash_args(args);\n Self {\n target_contract,\n selector,\n name,\n args_hash,\n args,\n return_type: std::mem::zeroed(),\n is_static: true,\n }\n }\n\n pub fn view<let M: u32>(self, context: &mut PrivateContext) -> T\n where\n T: Deserialize<M>,\n {\n execution_cache::store(self.args, self.args_hash);\n let returns = context.call_private_function_with_args_hash(\n self.target_contract,\n self.selector,\n self.args_hash,\n true,\n );\n returns.get_preimage()\n }\n}\n\nimpl<let N: u32, T> CallInterface<N> for PrivateStaticCallInterface<N, T> {\n fn get_args(self) -> [Field] {\n self.args\n }\n\n fn get_selector(self) -> FunctionSelector {\n self.selector\n }\n\n fn get_name(self) -> str<N> {\n self.name\n }\n\n fn get_contract_address(self) -> AztecAddress {\n self.target_contract\n }\n\n fn get_is_static(self) -> bool {\n self.is_static\n }\n}\n\n// PrivateStaticVoidCallInterface\n\npub struct PrivateStaticVoidCallInterface<let N: u32> {\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args_hash: Field,\n args: [Field],\n return_type: (), // Unit type () indicates this interface is for functions that return nothing (void)\n is_static: bool,\n}\n\nimpl<let N: u32> PrivateStaticVoidCallInterface<N> {\n pub fn new(\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args: [Field],\n ) -> Self {\n let args_hash = hash_args(args);\n Self { target_contract, selector, name, args_hash, args, return_type: (), is_static: true }\n }\n\n pub fn view(self, context: &mut PrivateContext) {\n execution_cache::store(self.args, self.args_hash);\n context\n .call_private_function_with_args_hash(\n self.target_contract,\n self.selector,\n self.args_hash,\n true,\n )\n .assert_empty();\n }\n}\n\nimpl<let N: u32> CallInterface<N> for PrivateStaticVoidCallInterface<N> {\n fn get_args(self) -> [Field] {\n self.args\n }\n\n fn get_selector(self) -> FunctionSelector {\n self.selector\n }\n\n fn get_name(self) -> str<N> {\n self.name\n }\n\n fn get_contract_address(self) -> AztecAddress {\n self.target_contract\n }\n\n fn get_is_static(self) -> bool {\n self.is_static\n }\n}\n\n// PublicCallInterface\n\npub struct PublicCallInterface<let N: u32, T> {\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args: [Field],\n gas_opts: GasOpts,\n return_type: T,\n is_static: bool,\n}\n\nimpl<let N: u32, T> PublicCallInterface<N, T> {\n pub fn new(\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args: [Field],\n is_static: bool,\n ) -> Self {\n Self {\n target_contract,\n selector,\n name,\n args,\n gas_opts: GasOpts::default(),\n return_type: std::mem::zeroed(),\n is_static,\n }\n }\n\n pub fn with_gas(self: &mut Self, gas_opts: GasOpts) -> &mut Self {\n self.gas_opts = gas_opts;\n self\n }\n\n pub unconstrained fn call<let M: u32>(self, context: &mut PublicContext) -> T\n where\n T: Deserialize<M>,\n {\n let returns = context.call_public_function(\n self.target_contract,\n self.selector,\n self.args,\n self.gas_opts,\n );\n Deserialize::deserialize(returns.as_array::<M>())\n }\n\n pub unconstrained fn view<let M: u32>(self, context: &mut PublicContext) -> T\n where\n T: Deserialize<M>,\n {\n let returns = context.static_call_public_function(\n self.target_contract,\n self.selector,\n self.args,\n self.gas_opts,\n );\n Deserialize::deserialize(returns.as_array::<M>())\n }\n\n pub fn enqueue(self, context: &mut PrivateContext) {\n let calldata = self.args.push_front(self.selector.to_field());\n let calldata_hash = hash_calldata(calldata);\n execution_cache::store(calldata, calldata_hash);\n context.call_public_function_with_calldata_hash(\n self.target_contract,\n calldata_hash,\n /*static=*/\n false,\n )\n }\n\n pub fn enqueue_view(self, context: &mut PrivateContext) {\n let calldata = self.args.push_front(self.selector.to_field());\n let calldata_hash = hash_calldata(calldata);\n execution_cache::store(calldata, calldata_hash);\n context.call_public_function_with_calldata_hash(\n self.target_contract,\n calldata_hash,\n /*static=*/\n true,\n )\n }\n}\n\nimpl<let N: u32, T> CallInterface<N> for PublicCallInterface<N, T> {\n fn get_args(self) -> [Field] {\n self.args\n }\n\n fn get_selector(self) -> FunctionSelector {\n self.selector\n }\n\n fn get_name(self) -> str<N> {\n self.name\n }\n\n fn get_contract_address(self) -> AztecAddress {\n self.target_contract\n }\n\n fn get_is_static(self) -> bool {\n self.is_static\n }\n}\n\n// PublicVoidCallInterface\n\npub struct PublicVoidCallInterface<let N: u32> {\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args: [Field],\n return_type: (), // Unit type () indicates this interface is for functions that return nothing (void)\n is_static: bool,\n gas_opts: GasOpts,\n}\n\nimpl<let N: u32> PublicVoidCallInterface<N> {\n pub fn new(\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args: [Field],\n is_static: bool,\n ) -> Self {\n Self {\n target_contract,\n selector,\n name,\n args,\n return_type: (),\n is_static,\n gas_opts: GasOpts::default(),\n }\n }\n\n pub fn with_gas(self: &mut Self, gas_opts: GasOpts) -> &mut Self {\n self.gas_opts = gas_opts;\n self\n }\n\n pub unconstrained fn call(self, context: &mut PublicContext) {\n let returns = context.call_public_function(\n self.target_contract,\n self.selector,\n self.args,\n self.gas_opts,\n );\n assert(returns.len() == 0);\n }\n\n pub unconstrained fn view(self, context: &mut PublicContext) {\n let returns = context.static_call_public_function(\n self.target_contract,\n self.selector,\n self.args,\n self.gas_opts,\n );\n assert(returns.len() == 0);\n }\n\n pub fn enqueue(self, context: &mut PrivateContext) {\n let calldata = self.args.push_front(self.selector.to_field());\n let calldata_hash = hash_calldata(calldata);\n execution_cache::store(calldata, calldata_hash);\n context.call_public_function_with_calldata_hash(\n self.target_contract,\n calldata_hash,\n /*static=*/\n false,\n )\n }\n\n pub fn enqueue_view(self, context: &mut PrivateContext) {\n let calldata = self.args.push_front(self.selector.to_field());\n let calldata_hash = hash_calldata(calldata);\n execution_cache::store(calldata, calldata_hash);\n context.call_public_function_with_calldata_hash(\n self.target_contract,\n calldata_hash,\n /*static=*/\n true,\n )\n }\n\n pub fn set_as_teardown(self, context: &mut PrivateContext) {\n let calldata = self.args.push_front(self.selector.to_field());\n let calldata_hash = hash_calldata(calldata);\n execution_cache::store(calldata, calldata_hash);\n context.set_public_teardown_function_with_calldata_hash(\n self.target_contract,\n calldata_hash,\n false,\n )\n }\n}\n\nimpl<let N: u32> CallInterface<N> for PublicVoidCallInterface<N> {\n fn get_args(self) -> [Field] {\n self.args\n }\n\n fn get_selector(self) -> FunctionSelector {\n self.selector\n }\n\n fn get_name(self) -> str<N> {\n self.name\n }\n\n fn get_contract_address(self) -> AztecAddress {\n self.target_contract\n }\n\n fn get_is_static(self) -> bool {\n self.is_static\n }\n}\n\n// PublicStaticCallInterface\n\npub struct PublicStaticCallInterface<let N: u32, T> {\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args: [Field],\n return_type: T,\n is_static: bool,\n gas_opts: GasOpts,\n}\n\nimpl<let N: u32, T> PublicStaticCallInterface<N, T> {\n pub fn new(\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args: [Field],\n ) -> Self {\n Self {\n target_contract,\n selector,\n name,\n args,\n return_type: std::mem::zeroed(),\n is_static: true,\n gas_opts: GasOpts::default(),\n }\n }\n\n pub fn with_gas(self: &mut Self, gas_opts: GasOpts) -> &mut Self {\n self.gas_opts = gas_opts;\n self\n }\n\n pub unconstrained fn view<let M: u32>(self, context: &mut PublicContext) -> T\n where\n T: Deserialize<M>,\n {\n let returns = context.static_call_public_function(\n self.target_contract,\n self.selector,\n self.args,\n self.gas_opts,\n );\n Deserialize::deserialize(returns.as_array::<M>())\n }\n\n pub fn enqueue_view(self, context: &mut PrivateContext) {\n let calldata = self.args.push_front(self.selector.to_field());\n let calldata_hash = hash_calldata(calldata);\n execution_cache::store(calldata, calldata_hash);\n context.call_public_function_with_calldata_hash(\n self.target_contract,\n calldata_hash,\n /*static=*/\n true,\n )\n }\n}\n\nimpl<let N: u32, T> CallInterface<N> for PublicStaticCallInterface<N, T> {\n fn get_args(self) -> [Field] {\n self.args\n }\n\n fn get_selector(self) -> FunctionSelector {\n self.selector\n }\n\n fn get_name(self) -> str<N> {\n self.name\n }\n\n fn get_contract_address(self) -> AztecAddress {\n self.target_contract\n }\n\n fn get_is_static(self) -> bool {\n self.is_static\n }\n}\n\n// PublicStaticVoidCallInterface\n\npub struct PublicStaticVoidCallInterface<let N: u32> {\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args: [Field],\n return_type: (), // Unit type () indicates this interface is for functions that return nothing (void)\n is_static: bool,\n gas_opts: GasOpts,\n}\n\nimpl<let N: u32> PublicStaticVoidCallInterface<N> {\n pub fn new(\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args: [Field],\n ) -> Self {\n Self {\n target_contract,\n selector,\n name,\n args,\n return_type: (),\n is_static: true,\n gas_opts: GasOpts::default(),\n }\n }\n\n pub fn with_gas(self: &mut Self, gas_opts: GasOpts) -> &mut Self {\n self.gas_opts = gas_opts;\n self\n }\n\n pub unconstrained fn view(self, context: &mut PublicContext) {\n let returns = context.static_call_public_function(\n self.target_contract,\n self.selector,\n self.args,\n self.gas_opts,\n );\n assert(returns.len() == 0);\n }\n\n pub fn enqueue_view(self, context: &mut PrivateContext) {\n let calldata = self.args.push_front(self.selector.to_field());\n let calldata_hash = hash_calldata(calldata);\n execution_cache::store(calldata, calldata_hash);\n context.call_public_function_with_calldata_hash(\n self.target_contract,\n calldata_hash,\n /*static=*/\n true,\n )\n }\n}\n\nimpl<let N: u32> CallInterface<N> for PublicStaticVoidCallInterface<N> {\n fn get_args(self) -> [Field] {\n self.args\n }\n\n fn get_selector(self) -> FunctionSelector {\n self.selector\n }\n\n fn get_name(self) -> str<N> {\n self.name\n }\n\n fn get_contract_address(self) -> AztecAddress {\n self.target_contract\n }\n\n fn get_is_static(self) -> bool {\n self.is_static\n }\n}\n"
3037
2805
  },
3038
- "6": {
3039
- "path": "std/collections/bounded_vec.nr",
3040
- "source": "use crate::{cmp::Eq, convert::From, runtime::is_unconstrained, static_assert};\n\n/// A `BoundedVec<T, MaxLen>` is a growable storage similar to a `Vec<T>` except that it\n/// is bounded with a maximum possible length. Unlike `Vec`, `BoundedVec` is not implemented\n/// via slices and thus is not subject to the same restrictions slices are (notably, nested\n/// slices - and thus nested vectors as well - are disallowed).\n///\n/// Since a BoundedVec is backed by a normal array under the hood, growing the BoundedVec by\n/// pushing an additional element is also more efficient - the length only needs to be increased\n/// by one.\n///\n/// For these reasons `BoundedVec<T, N>` should generally be preferred over `Vec<T>` when there\n/// is a reasonable maximum bound that can be placed on the vector.\n///\n/// Example:\n///\n/// ```noir\n/// let mut vector: BoundedVec<Field, 10> = BoundedVec::new();\n/// for i in 0..5 {\n/// vector.push(i);\n/// }\n/// assert(vector.len() == 5);\n/// assert(vector.max_len() == 10);\n/// ```\npub struct BoundedVec<T, let MaxLen: u32> {\n storage: [T; MaxLen],\n len: u32,\n}\n\nimpl<T, let MaxLen: u32> BoundedVec<T, MaxLen> {\n /// Creates a new, empty vector of length zero.\n ///\n /// Since this container is backed by an array internally, it still needs an initial value\n /// to give each element. To resolve this, each element is zeroed internally. This value\n /// is guaranteed to be inaccessible unless `get_unchecked` is used.\n ///\n /// Example:\n ///\n /// ```noir\n /// let empty_vector: BoundedVec<Field, 10> = BoundedVec::new();\n /// assert(empty_vector.len() == 0);\n /// ```\n ///\n /// Note that whenever calling `new` the maximum length of the vector should always be specified\n /// via a type signature:\n ///\n /// ```noir\n /// fn good() -> BoundedVec<Field, 10> {\n /// // Ok! MaxLen is specified with a type annotation\n /// let v1: BoundedVec<Field, 3> = BoundedVec::new();\n /// let v2 = BoundedVec::new();\n ///\n /// // Ok! MaxLen is known from the type of `good`'s return value\n /// v2\n /// }\n ///\n /// fn bad() {\n /// // Error: Type annotation needed\n /// // The compiler can't infer `MaxLen` from the following code:\n /// let mut v3 = BoundedVec::new();\n /// v3.push(5);\n /// }\n /// ```\n ///\n /// This defaulting of `MaxLen` (and numeric generics in general) to zero may change in future noir versions\n /// but for now make sure to use type annotations when using bounded vectors. Otherwise, you will receive a\n /// constraint failure at runtime when the vec is pushed to.\n pub fn new() -> Self {\n let zeroed = crate::mem::zeroed();\n BoundedVec { storage: [zeroed; MaxLen], len: 0 }\n }\n\n /// Retrieves an element from the vector at the given index, starting from zero.\n ///\n /// If the given index is equal to or greater than the length of the vector, this\n /// will issue a constraint failure.\n ///\n /// Example:\n ///\n /// ```noir\n /// fn foo<let N: u32>(v: BoundedVec<u32, N>) {\n /// let first = v.get(0);\n /// let last = v.get(v.len() - 1);\n /// assert(first != last);\n /// }\n /// ```\n pub fn get(self, index: u32) -> T {\n assert(index < self.len, \"Attempted to read past end of BoundedVec\");\n self.get_unchecked(index)\n }\n\n /// Retrieves an element from the vector at the given index, starting from zero, without\n /// performing a bounds check.\n ///\n /// Since this function does not perform a bounds check on length before accessing the element,\n /// it is unsafe! Use at your own risk!\n ///\n /// Example:\n ///\n /// ```noir\n /// fn sum_of_first_three<let N: u32>(v: BoundedVec<u32, N>) -> u32 {\n /// // Always ensure the length is larger than the largest\n /// // index passed to get_unchecked\n /// assert(v.len() > 2);\n /// let first = v.get_unchecked(0);\n /// let second = v.get_unchecked(1);\n /// let third = v.get_unchecked(2);\n /// first + second + third\n /// }\n /// ```\n pub fn get_unchecked(self, index: u32) -> T {\n self.storage[index]\n }\n\n /// Writes an element to the vector at the given index, starting from zero.\n ///\n /// If the given index is equal to or greater than the length of the vector, this will issue a constraint failure.\n ///\n /// Example:\n ///\n /// ```noir\n /// fn foo<let N: u32>(v: BoundedVec<u32, N>) {\n /// let first = v.get(0);\n /// assert(first != 42);\n /// v.set(0, 42);\n /// let new_first = v.get(0);\n /// assert(new_first == 42);\n /// }\n /// ```\n pub fn set(&mut self, index: u32, value: T) {\n assert(index < self.len, \"Attempted to write past end of BoundedVec\");\n self.set_unchecked(index, value)\n }\n\n /// Writes an element to the vector at the given index, starting from zero, without performing a bounds check.\n ///\n /// Since this function does not perform a bounds check on length before accessing the element, it is unsafe! Use at your own risk!\n ///\n /// Example:\n ///\n /// ```noir\n /// fn set_unchecked_example() {\n /// let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n /// vec.extend_from_array([1, 2]);\n ///\n /// // Here we're safely writing within the valid range of `vec`\n /// // `vec` now has the value [42, 2]\n /// vec.set_unchecked(0, 42);\n ///\n /// // We can then safely read this value back out of `vec`.\n /// // Notice that we use the checked version of `get` which would prevent reading unsafe values.\n /// assert_eq(vec.get(0), 42);\n ///\n /// // We've now written past the end of `vec`.\n /// // As this index is still within the maximum potential length of `v`,\n /// // it won't cause a constraint failure.\n /// vec.set_unchecked(2, 42);\n /// println(vec);\n ///\n /// // This will write past the end of the maximum potential length of `vec`,\n /// // it will then trigger a constraint failure.\n /// vec.set_unchecked(5, 42);\n /// println(vec);\n /// }\n /// ```\n pub fn set_unchecked(&mut self, index: u32, value: T) {\n self.storage[index] = value;\n }\n\n /// Pushes an element to the end of the vector. This increases the length\n /// of the vector by one.\n ///\n /// Panics if the new length of the vector will be greater than the max length.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<Field, 2> = BoundedVec::new();\n ///\n /// v.push(1);\n /// v.push(2);\n ///\n /// // Panics with failed assertion \"push out of bounds\"\n /// v.push(3);\n /// ```\n pub fn push(&mut self, elem: T) {\n assert(self.len < MaxLen, \"push out of bounds\");\n\n self.storage[self.len] = elem;\n self.len += 1;\n }\n\n /// Returns the current length of this vector\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<Field, 4> = BoundedVec::new();\n /// assert(v.len() == 0);\n ///\n /// v.push(100);\n /// assert(v.len() == 1);\n ///\n /// v.push(200);\n /// v.push(300);\n /// v.push(400);\n /// assert(v.len() == 4);\n ///\n /// let _ = v.pop();\n /// let _ = v.pop();\n /// assert(v.len() == 2);\n /// ```\n pub fn len(self) -> u32 {\n self.len\n }\n\n /// Returns the maximum length of this vector. This is always\n /// equal to the `MaxLen` parameter this vector was initialized with.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<Field, 5> = BoundedVec::new();\n ///\n /// assert(v.max_len() == 5);\n /// v.push(10);\n /// assert(v.max_len() == 5);\n /// ```\n pub fn max_len(_self: BoundedVec<T, MaxLen>) -> u32 {\n MaxLen\n }\n\n /// Returns the internal array within this vector.\n ///\n /// Since arrays in Noir are immutable, mutating the returned storage array will not mutate\n /// the storage held internally by this vector.\n ///\n /// Note that uninitialized elements may be zeroed out!\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<Field, 5> = BoundedVec::new();\n ///\n /// assert(v.storage() == [0, 0, 0, 0, 0]);\n ///\n /// v.push(57);\n /// assert(v.storage() == [57, 0, 0, 0, 0]);\n /// ```\n pub fn storage(self) -> [T; MaxLen] {\n self.storage\n }\n\n /// Pushes each element from the given array to this vector.\n ///\n /// Panics if pushing each element would cause the length of this vector\n /// to exceed the maximum length.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut vec: BoundedVec<Field, 3> = BoundedVec::new();\n /// vec.extend_from_array([2, 4]);\n ///\n /// assert(vec.len == 2);\n /// assert(vec.get(0) == 2);\n /// assert(vec.get(1) == 4);\n /// ```\n pub fn extend_from_array<let Len: u32>(&mut self, array: [T; Len]) {\n let new_len = self.len + array.len();\n assert(new_len <= MaxLen, \"extend_from_array out of bounds\");\n for i in 0..array.len() {\n self.storage[self.len + i] = array[i];\n }\n self.len = new_len;\n }\n\n /// Pushes each element from the given slice to this vector.\n ///\n /// Panics if pushing each element would cause the length of this vector\n /// to exceed the maximum length.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut vec: BoundedVec<Field, 3> = BoundedVec::new();\n /// vec.extend_from_slice(&[2, 4]);\n ///\n /// assert(vec.len == 2);\n /// assert(vec.get(0) == 2);\n /// assert(vec.get(1) == 4);\n /// ```\n pub fn extend_from_slice(&mut self, slice: [T]) {\n let new_len = self.len + slice.len();\n assert(new_len <= MaxLen, \"extend_from_slice out of bounds\");\n for i in 0..slice.len() {\n self.storage[self.len + i] = slice[i];\n }\n self.len = new_len;\n }\n\n /// Pushes each element from the other vector to this vector. The length of\n /// the other vector is left unchanged.\n ///\n /// Panics if pushing each element would cause the length of this vector\n /// to exceed the maximum length.\n ///\n /// ```noir\n /// let mut v1: BoundedVec<Field, 5> = BoundedVec::new();\n /// let mut v2: BoundedVec<Field, 7> = BoundedVec::new();\n ///\n /// v2.extend_from_array([1, 2, 3]);\n /// v1.extend_from_bounded_vec(v2);\n ///\n /// assert(v1.storage() == [1, 2, 3, 0, 0]);\n /// assert(v2.storage() == [1, 2, 3, 0, 0, 0, 0]);\n /// ```\n pub fn extend_from_bounded_vec<let Len: u32>(&mut self, vec: BoundedVec<T, Len>) {\n let append_len = vec.len();\n let new_len = self.len + append_len;\n assert(new_len <= MaxLen, \"extend_from_bounded_vec out of bounds\");\n\n if is_unconstrained() {\n for i in 0..append_len {\n self.storage[self.len + i] = vec.get_unchecked(i);\n }\n } else {\n let mut exceeded_len = false;\n for i in 0..Len {\n exceeded_len |= i == append_len;\n if !exceeded_len {\n self.storage[self.len + i] = vec.get_unchecked(i);\n }\n }\n }\n self.len = new_len;\n }\n\n /// Creates a new vector, populating it with values derived from an array input.\n /// The maximum length of the vector is determined based on the type signature.\n ///\n /// Example:\n ///\n /// ```noir\n /// let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from_array([1, 2, 3])\n /// ```\n pub fn from_array<let Len: u32>(array: [T; Len]) -> Self {\n static_assert(Len <= MaxLen, \"from array out of bounds\");\n let mut vec: BoundedVec<T, MaxLen> = BoundedVec::new();\n vec.extend_from_array(array);\n vec\n }\n\n /// Pops the element at the end of the vector. This will decrease the length\n /// of the vector by one.\n ///\n /// Panics if the vector is empty.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<Field, 2> = BoundedVec::new();\n /// v.push(1);\n /// v.push(2);\n ///\n /// let two = v.pop();\n /// let one = v.pop();\n ///\n /// assert(two == 2);\n /// assert(one == 1);\n ///\n /// // error: cannot pop from an empty vector\n /// let _ = v.pop();\n /// ```\n pub fn pop(&mut self) -> T {\n assert(self.len > 0);\n self.len -= 1;\n\n let elem = self.storage[self.len];\n self.storage[self.len] = crate::mem::zeroed();\n elem\n }\n\n /// Returns true if the given predicate returns true for any element\n /// in this vector.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<u32, 3> = BoundedVec::new();\n /// v.extend_from_array([2, 4, 6]);\n ///\n /// let all_even = !v.any(|elem: u32| elem % 2 != 0);\n /// assert(all_even);\n /// ```\n pub fn any<Env>(self, predicate: fn[Env](T) -> bool) -> bool {\n let mut ret = false;\n if is_unconstrained() {\n for i in 0..self.len {\n ret |= predicate(self.storage[i]);\n }\n } else {\n let mut ret = false;\n let mut exceeded_len = false;\n for i in 0..MaxLen {\n exceeded_len |= i == self.len;\n if !exceeded_len {\n ret |= predicate(self.storage[i]);\n }\n }\n }\n ret\n }\n\n /// Creates a new vector of equal size by calling a closure on each element in this vector.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n /// let result = vec.map(|value| value * 2);\n ///\n /// let expected = BoundedVec::from_array([2, 4, 6, 8]);\n /// assert_eq(result, expected);\n /// ```\n pub fn map<U, Env>(self, f: fn[Env](T) -> U) -> BoundedVec<U, MaxLen> {\n let mut ret = BoundedVec::new();\n ret.len = self.len();\n\n if is_unconstrained() {\n for i in 0..self.len() {\n ret.storage[i] = f(self.get_unchecked(i));\n }\n } else {\n for i in 0..MaxLen {\n if i < self.len() {\n ret.storage[i] = f(self.get_unchecked(i));\n }\n }\n }\n\n ret\n }\n\n /// Creates a new vector of equal size by calling a closure on each element\n /// in this vector, along with its index.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n /// let result = vec.mapi(|i, value| i + value * 2);\n ///\n /// let expected = BoundedVec::from_array([2, 5, 8, 11]);\n /// assert_eq(result, expected);\n /// ```\n pub fn mapi<U, Env>(self, f: fn[Env](u32, T) -> U) -> BoundedVec<U, MaxLen> {\n let mut ret = BoundedVec::new();\n ret.len = self.len();\n\n if is_unconstrained() {\n for i in 0..self.len() {\n ret.storage[i] = f(i, self.get_unchecked(i));\n }\n } else {\n for i in 0..MaxLen {\n if i < self.len() {\n ret.storage[i] = f(i, self.get_unchecked(i));\n }\n }\n }\n\n ret\n }\n\n /// Calls a closure on each element in this vector.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n /// let mut result = BoundedVec::<u32, 4>::new();\n /// vec.for_each(|value| result.push(value * 2));\n ///\n /// let expected = BoundedVec::from_array([2, 4, 6, 8]);\n /// assert_eq(result, expected);\n /// ```\n pub fn for_each<Env>(self, f: fn[Env](T) -> ()) {\n if is_unconstrained() {\n for i in 0..self.len() {\n f(self.get_unchecked(i));\n }\n } else {\n for i in 0..MaxLen {\n if i < self.len() {\n f(self.get_unchecked(i));\n }\n }\n }\n }\n\n /// Calls a closure on each element in this vector, along with its index.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n /// let mut result = BoundedVec::<u32, 4>::new();\n /// vec.for_eachi(|i, value| result.push(i + value * 2));\n ///\n /// let expected = BoundedVec::from_array([2, 5, 8, 11]);\n /// assert_eq(result, expected);\n /// ```\n pub fn for_eachi<Env>(self, f: fn[Env](u32, T) -> ()) {\n if is_unconstrained() {\n for i in 0..self.len() {\n f(i, self.get_unchecked(i));\n }\n } else {\n for i in 0..MaxLen {\n if i < self.len() {\n f(i, self.get_unchecked(i));\n }\n }\n }\n }\n\n /// Creates a new BoundedVec from the given array and length.\n /// The given length must be less than or equal to the length of the array.\n ///\n /// This function will zero out any elements at or past index `len` of `array`.\n /// This incurs an extra runtime cost of O(MaxLen). If you are sure your array is\n /// zeroed after that index, you can use `from_parts_unchecked` to remove the extra loop.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 0], 3);\n /// assert_eq(vec.len(), 3);\n /// ```\n pub fn from_parts(mut array: [T; MaxLen], len: u32) -> Self {\n assert(len <= MaxLen);\n let zeroed = crate::mem::zeroed();\n\n if is_unconstrained() {\n for i in len..MaxLen {\n array[i] = zeroed;\n }\n } else {\n for i in 0..MaxLen {\n if i >= len {\n array[i] = zeroed;\n }\n }\n }\n\n BoundedVec { storage: array, len }\n }\n\n /// Creates a new BoundedVec from the given array and length.\n /// The given length must be less than or equal to the length of the array.\n ///\n /// This function is unsafe because it expects all elements past the `len` index\n /// of `array` to be zeroed, but does not check for this internally. Use `from_parts`\n /// for a safe version of this function which does zero out any indices past the\n /// given length. Invalidating this assumption can notably cause `BoundedVec::eq`\n /// to give incorrect results since it will check even elements past `len`.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 0], 3);\n /// assert_eq(vec.len(), 3);\n ///\n /// // invalid use!\n /// let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 1], 3);\n /// let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 2], 3);\n ///\n /// // both vecs have length 3 so we'd expect them to be equal, but this\n /// // fails because elements past the length are still checked in eq\n /// assert_eq(vec1, vec2); // fails\n /// ```\n pub fn from_parts_unchecked(array: [T; MaxLen], len: u32) -> Self {\n assert(len <= MaxLen);\n BoundedVec { storage: array, len }\n }\n}\n\nimpl<T, let MaxLen: u32> Eq for BoundedVec<T, MaxLen>\nwhere\n T: Eq,\n{\n fn eq(self, other: BoundedVec<T, MaxLen>) -> bool {\n // TODO: https://github.com/noir-lang/noir/issues/4837\n //\n // We make the assumption that the user has used the proper interface for working with `BoundedVec`s\n // rather than directly manipulating the internal fields as this can result in an inconsistent internal state.\n if self.len == other.len {\n self.storage == other.storage\n } else {\n false\n }\n }\n}\n\nimpl<T, let MaxLen: u32, let Len: u32> From<[T; Len]> for BoundedVec<T, MaxLen> {\n fn from(array: [T; Len]) -> BoundedVec<T, MaxLen> {\n BoundedVec::from_array(array)\n }\n}\n\nmod bounded_vec_tests {\n\n mod get {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n fn panics_when_reading_elements_past_end_of_vec() {\n let vec: BoundedVec<Field, 5> = BoundedVec::new();\n\n crate::println(vec.get(0));\n }\n }\n\n mod set {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn set_updates_values_properly() {\n let mut vec = BoundedVec::from_array([0, 0, 0, 0, 0]);\n\n vec.set(0, 42);\n assert_eq(vec.storage, [42, 0, 0, 0, 0]);\n\n vec.set(1, 43);\n assert_eq(vec.storage, [42, 43, 0, 0, 0]);\n\n vec.set(2, 44);\n assert_eq(vec.storage, [42, 43, 44, 0, 0]);\n\n vec.set(1, 10);\n assert_eq(vec.storage, [42, 10, 44, 0, 0]);\n\n vec.set(0, 0);\n assert_eq(vec.storage, [0, 10, 44, 0, 0]);\n }\n\n #[test(should_fail_with = \"Attempted to write past end of BoundedVec\")]\n fn panics_when_writing_elements_past_end_of_vec() {\n let mut vec: BoundedVec<Field, 5> = BoundedVec::new();\n vec.set(0, 42);\n\n // Need to use println to avoid DIE removing the write operation.\n crate::println(vec.get(0));\n }\n }\n\n mod map {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn applies_function_correctly() {\n // docs:start:bounded-vec-map-example\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = vec.map(|value| value * 2);\n // docs:end:bounded-vec-map-example\n let expected = BoundedVec::from_array([2, 4, 6, 8]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn applies_function_that_changes_return_type() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = vec.map(|value| (value * 2) as Field);\n let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 4, 6, 8]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn does_not_apply_function_past_len() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n let result = vec.map(|value| if value == 0 { 5 } else { value });\n let expected = BoundedVec::from_array([5, 1]);\n\n assert_eq(result, expected);\n assert_eq(result.get_unchecked(2), 0);\n }\n }\n\n mod mapi {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn applies_function_correctly() {\n // docs:start:bounded-vec-mapi-example\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = vec.mapi(|i, value| i + value * 2);\n // docs:end:bounded-vec-mapi-example\n let expected = BoundedVec::from_array([2, 5, 8, 11]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn applies_function_that_changes_return_type() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = vec.mapi(|i, value| (i + value * 2) as Field);\n let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 5, 8, 11]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn does_not_apply_function_past_len() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n let result = vec.mapi(|_, value| if value == 0 { 5 } else { value });\n let expected = BoundedVec::from_array([5, 1]);\n\n assert_eq(result, expected);\n assert_eq(result.get_unchecked(2), 0);\n }\n }\n\n mod for_each {\n use crate::collections::bounded_vec::BoundedVec;\n\n // map in terms of for_each\n fn for_each_map<T, U, Env, let MaxLen: u32>(\n input: BoundedVec<T, MaxLen>,\n f: fn[Env](T) -> U,\n ) -> BoundedVec<U, MaxLen> {\n let mut output = BoundedVec::<U, MaxLen>::new();\n let output_ref = &mut output;\n input.for_each(|x| output_ref.push(f(x)));\n output\n }\n\n #[test]\n fn smoke_test() {\n let mut acc = 0;\n let acc_ref = &mut acc;\n // docs:start:bounded-vec-for-each-example\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n vec.for_each(|value| { *acc_ref += value; });\n // docs:end:bounded-vec-for-each-example\n assert_eq(acc, 6);\n }\n\n #[test]\n fn applies_function_correctly() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = for_each_map(vec, |value| value * 2);\n let expected = BoundedVec::from_array([2, 4, 6, 8]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn applies_function_that_changes_return_type() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = for_each_map(vec, |value| (value * 2) as Field);\n let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 4, 6, 8]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn does_not_apply_function_past_len() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n let result = for_each_map(vec, |value| if value == 0 { 5 } else { value });\n let expected = BoundedVec::from_array([5, 1]);\n\n assert_eq(result, expected);\n assert_eq(result.get_unchecked(2), 0);\n }\n }\n\n mod for_eachi {\n use crate::collections::bounded_vec::BoundedVec;\n\n // mapi in terms of for_eachi\n fn for_eachi_mapi<T, U, Env, let MaxLen: u32>(\n input: BoundedVec<T, MaxLen>,\n f: fn[Env](u32, T) -> U,\n ) -> BoundedVec<U, MaxLen> {\n let mut output = BoundedVec::<U, MaxLen>::new();\n let output_ref = &mut output;\n input.for_eachi(|i, x| output_ref.push(f(i, x)));\n output\n }\n\n #[test]\n fn smoke_test() {\n let mut acc = 0;\n let acc_ref = &mut acc;\n // docs:start:bounded-vec-for-eachi-example\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n vec.for_eachi(|i, value| { *acc_ref += i * value; });\n // docs:end:bounded-vec-for-eachi-example\n\n // 0 * 1 + 1 * 2 + 2 * 3\n assert_eq(acc, 8);\n }\n\n #[test]\n fn applies_function_correctly() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = for_eachi_mapi(vec, |i, value| i + value * 2);\n let expected = BoundedVec::from_array([2, 5, 8, 11]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn applies_function_that_changes_return_type() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = for_eachi_mapi(vec, |i, value| (i + value * 2) as Field);\n let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 5, 8, 11]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn does_not_apply_function_past_len() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n let result = for_eachi_mapi(vec, |_, value| if value == 0 { 5 } else { value });\n let expected = BoundedVec::from_array([5, 1]);\n\n assert_eq(result, expected);\n assert_eq(result.get_unchecked(2), 0);\n }\n }\n\n mod from_array {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn empty() {\n let empty_array: [Field; 0] = [];\n let bounded_vec = BoundedVec::from_array([]);\n\n assert_eq(bounded_vec.max_len(), 0);\n assert_eq(bounded_vec.len(), 0);\n assert_eq(bounded_vec.storage(), empty_array);\n }\n\n #[test]\n fn equal_len() {\n let array = [1, 2, 3];\n let bounded_vec = BoundedVec::from_array(array);\n\n assert_eq(bounded_vec.max_len(), 3);\n assert_eq(bounded_vec.len(), 3);\n assert_eq(bounded_vec.storage(), array);\n }\n\n #[test]\n fn max_len_greater_then_array_len() {\n let array = [1, 2, 3];\n let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from_array(array);\n\n assert_eq(bounded_vec.max_len(), 10);\n assert_eq(bounded_vec.len(), 3);\n assert_eq(bounded_vec.get(0), 1);\n assert_eq(bounded_vec.get(1), 2);\n assert_eq(bounded_vec.get(2), 3);\n }\n\n #[test(should_fail_with = \"from array out of bounds\")]\n fn max_len_lower_then_array_len() {\n let _: BoundedVec<Field, 2> = BoundedVec::from_array([0; 3]);\n }\n }\n\n mod trait_from {\n use crate::collections::bounded_vec::BoundedVec;\n use crate::convert::From;\n\n #[test]\n fn simple() {\n let array = [1, 2];\n let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from(array);\n\n assert_eq(bounded_vec.max_len(), 10);\n assert_eq(bounded_vec.len(), 2);\n assert_eq(bounded_vec.get(0), 1);\n assert_eq(bounded_vec.get(1), 2);\n }\n }\n\n mod trait_eq {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn empty_equality() {\n let mut bounded_vec1: BoundedVec<Field, 3> = BoundedVec::new();\n let mut bounded_vec2: BoundedVec<Field, 3> = BoundedVec::new();\n\n assert_eq(bounded_vec1, bounded_vec2);\n }\n\n #[test]\n fn inequality() {\n let mut bounded_vec1: BoundedVec<Field, 3> = BoundedVec::new();\n let mut bounded_vec2: BoundedVec<Field, 3> = BoundedVec::new();\n bounded_vec1.push(1);\n bounded_vec2.push(2);\n\n assert(bounded_vec1 != bounded_vec2);\n }\n }\n\n mod from_parts {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn from_parts() {\n // docs:start:from-parts\n let vec: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 0], 3);\n assert_eq(vec.len(), 3);\n\n // Any elements past the given length are zeroed out, so these\n // two BoundedVecs will be completely equal\n let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 1], 3);\n let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 2], 3);\n assert_eq(vec1, vec2);\n // docs:end:from-parts\n }\n\n #[test]\n fn from_parts_unchecked() {\n // docs:start:from-parts-unchecked\n let vec: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 0], 3);\n assert_eq(vec.len(), 3);\n\n // invalid use!\n let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 1], 3);\n let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 2], 3);\n\n // both vecs have length 3 so we'd expect them to be equal, but this\n // fails because elements past the length are still checked in eq\n assert(vec1 != vec2);\n // docs:end:from-parts-unchecked\n }\n }\n}\n"
3041
- },
3042
- "63": {
2806
+ "59": {
3043
2807
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/private_context.nr",
3044
- "source": "use dep::protocol_types::debug_log::debug_log_format;\n\nuse crate::{\n context::{inputs::PrivateContextInputs, returns_hash::ReturnsHash},\n hash::{ArgsHasher, hash_args_array, hash_calldata_array},\n keys::constants::{NULLIFIER_INDEX, NUM_KEY_TYPES, OUTGOING_INDEX, sk_generators},\n messaging::process_l1_to_l2_message,\n oracle::{\n block_header::get_block_header_at,\n call_private_function::call_private_function_internal,\n enqueue_public_function_call::{\n notify_enqueued_public_function_call, notify_set_min_revertible_side_effect_counter,\n notify_set_public_teardown_function_call,\n },\n execution_cache,\n key_validation_request::get_key_validation_request,\n notes::{notify_created_nullifier, notify_nullified_note},\n },\n};\nuse dep::protocol_types::{\n abis::{\n call_context::CallContext,\n function_selector::FunctionSelector,\n gas_settings::GasSettings,\n log::Log,\n log_hash::LogHash,\n max_block_number::MaxBlockNumber,\n note_hash::NoteHash,\n nullifier::Nullifier,\n private_call_request::PrivateCallRequest,\n private_circuit_public_inputs::PrivateCircuitPublicInputs,\n private_log::PrivateLogData,\n public_call_request::PublicCallRequest,\n read_request::ReadRequest,\n side_effect::Counted,\n validation_requests::{KeyValidationRequest, KeyValidationRequestAndGenerator},\n },\n address::{AztecAddress, EthAddress},\n block_header::BlockHeader,\n constants::{\n MAX_CONTRACT_CLASS_LOGS_PER_CALL, MAX_ENQUEUED_CALLS_PER_CALL,\n MAX_KEY_VALIDATION_REQUESTS_PER_CALL, MAX_L2_TO_L1_MSGS_PER_CALL,\n MAX_NOTE_HASH_READ_REQUESTS_PER_CALL, MAX_NOTE_HASHES_PER_CALL,\n MAX_NULLIFIER_READ_REQUESTS_PER_CALL, MAX_NULLIFIERS_PER_CALL,\n MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL, MAX_PRIVATE_LOGS_PER_CALL,\n PRIVATE_LOG_SIZE_IN_FIELDS,\n },\n messaging::l2_to_l1_message::L2ToL1Message,\n traits::{Empty, Hash, ToField},\n utils::arrays::array_concat,\n};\n\n// When finished, one can call .finish() to convert back to the abi\npub struct PrivateContext {\n // docs:start:private-context\n pub inputs: PrivateContextInputs,\n pub side_effect_counter: u32,\n\n pub min_revertible_side_effect_counter: u32,\n pub is_fee_payer: bool,\n\n pub args_hash: Field,\n pub return_hash: Field,\n\n pub max_block_number: MaxBlockNumber,\n\n pub note_hash_read_requests: BoundedVec<ReadRequest, MAX_NOTE_HASH_READ_REQUESTS_PER_CALL>,\n pub nullifier_read_requests: BoundedVec<ReadRequest, MAX_NULLIFIER_READ_REQUESTS_PER_CALL>,\n key_validation_requests_and_generators: BoundedVec<KeyValidationRequestAndGenerator, MAX_KEY_VALIDATION_REQUESTS_PER_CALL>,\n\n pub note_hashes: BoundedVec<NoteHash, MAX_NOTE_HASHES_PER_CALL>,\n pub nullifiers: BoundedVec<Nullifier, MAX_NULLIFIERS_PER_CALL>,\n\n pub private_call_requests: BoundedVec<PrivateCallRequest, MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL>,\n pub public_call_requests: BoundedVec<Counted<PublicCallRequest>, MAX_ENQUEUED_CALLS_PER_CALL>,\n pub public_teardown_call_request: PublicCallRequest,\n pub l2_to_l1_msgs: BoundedVec<L2ToL1Message, MAX_L2_TO_L1_MSGS_PER_CALL>,\n // docs:end:private-context\n\n // Header of a block whose state is used during private execution (not the block the transaction is included in).\n pub historical_header: BlockHeader,\n\n pub private_logs: BoundedVec<PrivateLogData, MAX_PRIVATE_LOGS_PER_CALL>,\n pub contract_class_logs_hashes: BoundedVec<LogHash, MAX_CONTRACT_CLASS_LOGS_PER_CALL>,\n\n // Contains the last key validation request for each key type. This is used to cache the last request and avoid\n // fetching the same request multiple times.\n // The index of the array corresponds to the key type (0 nullifier, 1 incoming, 2 outgoing, 3 tagging).\n pub last_key_validation_requests: [Option<KeyValidationRequest>; NUM_KEY_TYPES],\n}\n\nimpl PrivateContext {\n pub fn new(inputs: PrivateContextInputs, args_hash: Field) -> PrivateContext {\n PrivateContext {\n inputs,\n side_effect_counter: inputs.start_side_effect_counter + 1,\n min_revertible_side_effect_counter: 0,\n is_fee_payer: false,\n args_hash,\n return_hash: 0,\n max_block_number: MaxBlockNumber::empty(),\n note_hash_read_requests: BoundedVec::new(),\n nullifier_read_requests: BoundedVec::new(),\n key_validation_requests_and_generators: BoundedVec::new(),\n note_hashes: BoundedVec::new(),\n nullifiers: BoundedVec::new(),\n historical_header: inputs.historical_header,\n private_call_requests: BoundedVec::new(),\n public_call_requests: BoundedVec::new(),\n public_teardown_call_request: PublicCallRequest::empty(),\n l2_to_l1_msgs: BoundedVec::new(),\n private_logs: BoundedVec::new(),\n contract_class_logs_hashes: BoundedVec::new(),\n last_key_validation_requests: [Option::none(); NUM_KEY_TYPES],\n }\n }\n\n pub fn msg_sender(self) -> AztecAddress {\n self.inputs.call_context.msg_sender\n }\n\n pub fn this_address(self) -> AztecAddress {\n self.inputs.call_context.contract_address\n }\n\n pub fn chain_id(self) -> Field {\n self.inputs.tx_context.chain_id\n }\n\n pub fn version(self) -> Field {\n self.inputs.tx_context.version\n }\n\n pub fn gas_settings(self) -> GasSettings {\n self.inputs.tx_context.gas_settings\n }\n\n pub fn selector(self) -> FunctionSelector {\n self.inputs.call_context.function_selector\n }\n\n pub fn get_args_hash(self) -> Field {\n self.args_hash\n }\n\n pub fn push_note_hash(&mut self, note_hash: Field) {\n self.note_hashes.push(NoteHash { value: note_hash, counter: self.next_counter() });\n\n // WARNING(https://github.com/AztecProtocol/aztec-packages/issues/10558): if you delete this debug_log_format line, some tests fail.\n debug_log_format(\n \"Context.note_hashes, after pushing new note hash: {0}\",\n self.note_hashes.storage().map(|nh: NoteHash| nh.value),\n );\n }\n\n pub fn push_nullifier(&mut self, nullifier: Field) {\n notify_created_nullifier(nullifier);\n self.nullifiers.push(\n Nullifier { value: nullifier, note_hash: 0, counter: self.next_counter() },\n );\n }\n\n pub fn push_nullifier_for_note_hash(&mut self, nullifier: Field, nullified_note_hash: Field) {\n let nullifier_counter = self.next_counter();\n notify_nullified_note(nullifier, nullified_note_hash, nullifier_counter);\n self.nullifiers.push(\n Nullifier {\n value: nullifier,\n note_hash: nullified_note_hash,\n counter: nullifier_counter,\n },\n );\n }\n\n // Returns the header of a block whose state is used during private execution (not the block the transaction is\n // included in).\n pub fn get_block_header(self) -> BlockHeader {\n self.historical_header\n }\n\n // Returns the header of an arbitrary block whose block number is less than or equal to the block number\n // of historical header.\n pub fn get_block_header_at(self, block_number: u32) -> BlockHeader {\n get_block_header_at(block_number, self)\n }\n\n pub fn set_return_hash(&mut self, returns_hasher: ArgsHasher) {\n self.return_hash = returns_hasher.hash();\n execution_cache::store(returns_hasher.fields, self.return_hash);\n }\n\n pub fn finish(self) -> PrivateCircuitPublicInputs {\n PrivateCircuitPublicInputs {\n call_context: self.inputs.call_context,\n args_hash: self.args_hash,\n returns_hash: self.return_hash,\n min_revertible_side_effect_counter: self.min_revertible_side_effect_counter,\n is_fee_payer: self.is_fee_payer,\n max_block_number: self.max_block_number,\n note_hash_read_requests: self.note_hash_read_requests.storage(),\n nullifier_read_requests: self.nullifier_read_requests.storage(),\n key_validation_requests_and_generators: self\n .key_validation_requests_and_generators\n .storage(),\n note_hashes: self.note_hashes.storage(),\n nullifiers: self.nullifiers.storage(),\n private_call_requests: self.private_call_requests.storage(),\n public_call_requests: self.public_call_requests.storage(),\n public_teardown_call_request: self.public_teardown_call_request,\n l2_to_l1_msgs: self.l2_to_l1_msgs.storage(),\n start_side_effect_counter: self.inputs.start_side_effect_counter,\n end_side_effect_counter: self.side_effect_counter,\n private_logs: self.private_logs.storage(),\n contract_class_logs_hashes: self.contract_class_logs_hashes.storage(),\n historical_header: self.historical_header,\n tx_context: self.inputs.tx_context,\n }\n }\n\n pub fn set_as_fee_payer(&mut self) {\n dep::protocol_types::debug_log::debug_log_format(\n \"Setting {0} as fee payer\",\n [self.this_address().to_field()],\n );\n self.is_fee_payer = true;\n }\n\n pub fn end_setup(&mut self) {\n // dep::protocol_types::debug_log::debug_log_format(\n // \"Ending setup at counter {0}\",\n // [self.side_effect_counter as Field]\n // );\n self.min_revertible_side_effect_counter = self.side_effect_counter;\n notify_set_min_revertible_side_effect_counter(self.min_revertible_side_effect_counter);\n }\n\n // docs:start:max-block-number\n pub fn set_tx_max_block_number(&mut self, max_block_number: u32) {\n // docs:end:max-block-number\n self.max_block_number =\n MaxBlockNumber::min_with_u32(self.max_block_number, max_block_number);\n }\n\n pub fn push_note_hash_read_request(&mut self, note_hash: Field) {\n let side_effect = ReadRequest { value: note_hash, counter: self.next_counter() };\n self.note_hash_read_requests.push(side_effect);\n }\n\n pub fn push_nullifier_read_request(&mut self, nullifier: Field) {\n let request = ReadRequest { value: nullifier, counter: self.next_counter() };\n self.nullifier_read_requests.push(request);\n }\n\n pub fn request_nsk_app(&mut self, npk_m_hash: Field) -> Field {\n self.request_sk_app(npk_m_hash, NULLIFIER_INDEX)\n }\n\n pub fn request_ovsk_app(&mut self, ovpk_m_hash: Field) -> Field {\n self.request_sk_app(ovpk_m_hash, OUTGOING_INDEX)\n }\n\n fn request_sk_app(&mut self, pk_m_hash: Field, key_index: Field) -> Field {\n let cached_request =\n self.last_key_validation_requests[key_index].unwrap_or(KeyValidationRequest::empty());\n\n if cached_request.pk_m.hash() == pk_m_hash {\n // We get a match so the cached request is the latest one\n cached_request.sk_app\n } else {\n // We didn't get a match meaning the cached result is stale\n // Typically we'd validate keys by showing that they are the preimage of `pk_m_hash`, but that'd require\n // the oracle returning the master secret keys, which could cause malicious contracts to leak it or learn\n // about secrets from other contracts. We therefore silo secret keys, and rely on the private kernel to\n // validate that we siloed secret key corresponds to correct siloing of the master secret key that hashes\n // to `pk_m_hash`.\n\n // Safety: Kernels verify that the key validation request is valid and below we verify that a request\n // for the correct public key has been received.\n let request = unsafe { get_key_validation_request(pk_m_hash, key_index) };\n assert_eq(request.pk_m.hash(), pk_m_hash, \"Obtained invalid key validation request\");\n\n self.key_validation_requests_and_generators.push(\n KeyValidationRequestAndGenerator {\n request,\n sk_app_generator: sk_generators[key_index],\n },\n );\n self.last_key_validation_requests[key_index] = Option::some(request);\n request.sk_app\n }\n }\n\n // docs:start:context_message_portal\n pub fn message_portal(&mut self, recipient: EthAddress, content: Field) {\n // docs:end:context_message_portal\n let message = L2ToL1Message { recipient, content, counter: self.next_counter() };\n self.l2_to_l1_msgs.push(message);\n }\n\n // docs:start:context_consume_l1_to_l2_message\n // docs:start:consume_l1_to_l2_message\n pub fn consume_l1_to_l2_message(\n &mut self,\n content: Field,\n secret: Field,\n sender: EthAddress,\n leaf_index: Field,\n ) {\n // docs:end:context_consume_l1_to_l2_message\n let nullifier = process_l1_to_l2_message(\n self.historical_header.state.l1_to_l2_message_tree.root,\n self.this_address(),\n sender,\n self.chain_id(),\n self.version(),\n content,\n secret,\n leaf_index,\n );\n\n // Push nullifier (and the \"commitment\" corresponding to this can be \"empty\")\n self.push_nullifier(nullifier)\n }\n // docs:end:consume_l1_to_l2_message\n\n pub fn emit_private_log(&mut self, log: [Field; PRIVATE_LOG_SIZE_IN_FIELDS]) {\n let counter = self.next_counter();\n let private_log = PrivateLogData { log: Log::new(log), note_hash_counter: 0, counter };\n self.private_logs.push(private_log);\n }\n\n pub fn emit_raw_note_log(\n &mut self,\n log: [Field; PRIVATE_LOG_SIZE_IN_FIELDS],\n note_hash_counter: u32,\n ) {\n let counter = self.next_counter();\n let private_log = PrivateLogData { log: Log::new(log), note_hash_counter, counter };\n self.private_logs.push(private_log);\n }\n\n pub fn call_private_function<let ARGS_COUNT: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ARGS_COUNT],\n ) -> ReturnsHash {\n let args_hash = hash_args_array(args);\n execution_cache::store(args, args_hash);\n self.call_private_function_with_args_hash(\n contract_address,\n function_selector,\n args_hash,\n false,\n )\n }\n\n pub fn static_call_private_function<let ARGS_COUNT: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ARGS_COUNT],\n ) -> ReturnsHash {\n let args_hash = hash_args_array(args);\n execution_cache::store(args, args_hash);\n self.call_private_function_with_args_hash(\n contract_address,\n function_selector,\n args_hash,\n true,\n )\n }\n\n pub fn call_private_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n ) -> ReturnsHash {\n self.call_private_function_with_args_hash(contract_address, function_selector, 0, false)\n }\n\n pub fn static_call_private_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n ) -> ReturnsHash {\n self.call_private_function_with_args_hash(contract_address, function_selector, 0, true)\n }\n\n pub fn call_private_function_with_args_hash(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args_hash: Field,\n is_static_call: bool,\n ) -> ReturnsHash {\n let mut is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n let start_side_effect_counter = self.side_effect_counter;\n\n // Safety: The oracle simulates the private call and returns the value of the side effects counter after\n // execution of the call (which means that end_side_effect_counter - start_side_effect_counter is\n // the number of side effects that took place), along with the hash of the return values. We validate these\n // by requesting a private kernel iteration in which the return values are constrained to hash\n // to `returns_hash` and the side effects counter to increment from start to end.\n let (end_side_effect_counter, returns_hash) = unsafe {\n call_private_function_internal(\n contract_address,\n function_selector,\n args_hash,\n start_side_effect_counter,\n is_static_call,\n )\n };\n\n self.private_call_requests.push(\n PrivateCallRequest {\n call_context: CallContext {\n msg_sender: self.this_address(),\n contract_address,\n function_selector,\n is_static_call,\n },\n args_hash,\n returns_hash,\n start_side_effect_counter,\n end_side_effect_counter,\n },\n );\n\n // TODO (fees) figure out why this crashes the prover and enable it\n // we need this in order to pay fees inside child call contexts\n // assert(\n // (item.public_inputs.min_revertible_side_effect_counter == 0 as u32)\n // | (item.public_inputs.min_revertible_side_effect_counter\n // > self.min_revertible_side_effect_counter)\n // );\n // if item.public_inputs.min_revertible_side_effect_counter\n // > self.min_revertible_side_effect_counter {\n // self.min_revertible_side_effect_counter = item.public_inputs.min_revertible_side_effect_counter;\n // }\n self.side_effect_counter = end_side_effect_counter + 1;\n ReturnsHash::new(returns_hash)\n }\n\n pub fn call_public_function<let ARGS_COUNT: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ARGS_COUNT],\n ) {\n let calldata = array_concat([function_selector.to_field()], args);\n let calldata_hash = hash_calldata_array(calldata);\n execution_cache::store(calldata, calldata_hash);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, false)\n }\n\n pub fn static_call_public_function<let ARGS_COUNT: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ARGS_COUNT],\n ) {\n let calldata = array_concat([function_selector.to_field()], args);\n let calldata_hash = hash_calldata_array(calldata);\n execution_cache::store(calldata, calldata_hash);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, true)\n }\n\n pub fn call_public_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n ) {\n let calldata_hash = hash_calldata_array([function_selector.to_field()]);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, false)\n }\n\n pub fn static_call_public_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n ) {\n let calldata_hash = hash_calldata_array([function_selector.to_field()]);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, true)\n }\n\n pub fn call_public_function_with_calldata_hash(\n &mut self,\n contract_address: AztecAddress,\n calldata_hash: Field,\n is_static_call: bool,\n ) {\n let counter = self.next_counter();\n\n let mut is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n notify_enqueued_public_function_call(\n contract_address,\n calldata_hash,\n counter,\n is_static_call,\n );\n\n let call_request = PublicCallRequest {\n msg_sender: self.this_address(),\n contract_address,\n is_static_call,\n calldata_hash,\n };\n\n self.public_call_requests.push(Counted::new(call_request, counter));\n }\n\n pub fn set_public_teardown_function<let ARGS_COUNT: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ARGS_COUNT],\n ) {\n let calldata = array_concat([function_selector.to_field()], args);\n let calldata_hash = hash_calldata_array(calldata);\n execution_cache::store(calldata, calldata_hash);\n self.set_public_teardown_function_with_calldata_hash(contract_address, calldata_hash, false)\n }\n\n pub fn set_public_teardown_function_with_calldata_hash(\n &mut self,\n contract_address: AztecAddress,\n calldata_hash: Field,\n is_static_call: bool,\n ) {\n let counter = self.next_counter();\n\n let mut is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n notify_set_public_teardown_function_call(\n contract_address,\n calldata_hash,\n counter,\n is_static_call,\n );\n\n self.public_teardown_call_request = PublicCallRequest {\n msg_sender: self.this_address(),\n contract_address,\n is_static_call,\n calldata_hash,\n };\n }\n\n fn next_counter(&mut self) -> u32 {\n let counter = self.side_effect_counter;\n self.side_effect_counter += 1;\n counter\n }\n}\n\nimpl Empty for PrivateContext {\n fn empty() -> Self {\n PrivateContext {\n inputs: PrivateContextInputs::empty(),\n side_effect_counter: 0 as u32,\n min_revertible_side_effect_counter: 0 as u32,\n is_fee_payer: false,\n args_hash: 0,\n return_hash: 0,\n max_block_number: MaxBlockNumber::empty(),\n note_hash_read_requests: BoundedVec::new(),\n nullifier_read_requests: BoundedVec::new(),\n key_validation_requests_and_generators: BoundedVec::new(),\n note_hashes: BoundedVec::new(),\n nullifiers: BoundedVec::new(),\n private_call_requests: BoundedVec::new(),\n public_call_requests: BoundedVec::new(),\n public_teardown_call_request: PublicCallRequest::empty(),\n l2_to_l1_msgs: BoundedVec::new(),\n historical_header: BlockHeader::empty(),\n private_logs: BoundedVec::new(),\n contract_class_logs_hashes: BoundedVec::new(),\n last_key_validation_requests: [Option::none(); NUM_KEY_TYPES],\n }\n }\n}\n"
2808
+ "source": "use crate::{\n context::{inputs::PrivateContextInputs, returns_hash::ReturnsHash},\n hash::{ArgsHasher, hash_args_array, hash_calldata_array},\n keys::constants::{NULLIFIER_INDEX, NUM_KEY_TYPES, OUTGOING_INDEX, sk_generators},\n messaging::process_l1_to_l2_message,\n oracle::{\n block_header::get_block_header_at,\n call_private_function::call_private_function_internal,\n enqueue_public_function_call::{\n notify_enqueued_public_function_call, notify_set_min_revertible_side_effect_counter,\n notify_set_public_teardown_function_call,\n },\n execution_cache,\n key_validation_request::get_key_validation_request,\n notes::{notify_created_nullifier, notify_nullified_note},\n },\n};\nuse dep::protocol_types::{\n abis::{\n call_context::CallContext,\n function_selector::FunctionSelector,\n gas_settings::GasSettings,\n log::Log,\n log_hash::LogHash,\n max_block_number::MaxBlockNumber,\n note_hash::NoteHash,\n nullifier::Nullifier,\n private_call_request::PrivateCallRequest,\n private_circuit_public_inputs::PrivateCircuitPublicInputs,\n private_log::PrivateLogData,\n public_call_request::PublicCallRequest,\n read_request::ReadRequest,\n side_effect::Counted,\n validation_requests::{KeyValidationRequest, KeyValidationRequestAndGenerator},\n },\n address::{AztecAddress, EthAddress},\n block_header::BlockHeader,\n constants::{\n MAX_CONTRACT_CLASS_LOGS_PER_CALL, MAX_ENQUEUED_CALLS_PER_CALL,\n MAX_KEY_VALIDATION_REQUESTS_PER_CALL, MAX_L2_TO_L1_MSGS_PER_CALL,\n MAX_NOTE_HASH_READ_REQUESTS_PER_CALL, MAX_NOTE_HASHES_PER_CALL,\n MAX_NULLIFIER_READ_REQUESTS_PER_CALL, MAX_NULLIFIERS_PER_CALL,\n MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL, MAX_PRIVATE_LOGS_PER_CALL,\n PRIVATE_LOG_SIZE_IN_FIELDS,\n },\n messaging::l2_to_l1_message::L2ToL1Message,\n traits::{Empty, Hash, ToField},\n utils::arrays::array_concat,\n};\n\n// When finished, one can call .finish() to convert back to the abi\npub struct PrivateContext {\n // docs:start:private-context\n pub inputs: PrivateContextInputs,\n pub side_effect_counter: u32,\n\n pub min_revertible_side_effect_counter: u32,\n pub is_fee_payer: bool,\n\n pub args_hash: Field,\n pub return_hash: Field,\n\n pub max_block_number: MaxBlockNumber,\n\n pub note_hash_read_requests: BoundedVec<ReadRequest, MAX_NOTE_HASH_READ_REQUESTS_PER_CALL>,\n pub nullifier_read_requests: BoundedVec<ReadRequest, MAX_NULLIFIER_READ_REQUESTS_PER_CALL>,\n key_validation_requests_and_generators: BoundedVec<KeyValidationRequestAndGenerator, MAX_KEY_VALIDATION_REQUESTS_PER_CALL>,\n\n pub note_hashes: BoundedVec<NoteHash, MAX_NOTE_HASHES_PER_CALL>,\n pub nullifiers: BoundedVec<Nullifier, MAX_NULLIFIERS_PER_CALL>,\n\n pub private_call_requests: BoundedVec<PrivateCallRequest, MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL>,\n pub public_call_requests: BoundedVec<Counted<PublicCallRequest>, MAX_ENQUEUED_CALLS_PER_CALL>,\n pub public_teardown_call_request: PublicCallRequest,\n pub l2_to_l1_msgs: BoundedVec<L2ToL1Message, MAX_L2_TO_L1_MSGS_PER_CALL>,\n // docs:end:private-context\n\n // Header of a block whose state is used during private execution (not the block the transaction is included in).\n pub historical_header: BlockHeader,\n\n pub private_logs: BoundedVec<PrivateLogData, MAX_PRIVATE_LOGS_PER_CALL>,\n pub contract_class_logs_hashes: BoundedVec<LogHash, MAX_CONTRACT_CLASS_LOGS_PER_CALL>,\n\n // Contains the last key validation request for each key type. This is used to cache the last request and avoid\n // fetching the same request multiple times.\n // The index of the array corresponds to the key type (0 nullifier, 1 incoming, 2 outgoing, 3 tagging).\n pub last_key_validation_requests: [Option<KeyValidationRequest>; NUM_KEY_TYPES],\n}\n\nimpl PrivateContext {\n pub fn new(inputs: PrivateContextInputs, args_hash: Field) -> PrivateContext {\n PrivateContext {\n inputs,\n side_effect_counter: inputs.start_side_effect_counter + 1,\n min_revertible_side_effect_counter: 0,\n is_fee_payer: false,\n args_hash,\n return_hash: 0,\n max_block_number: MaxBlockNumber::empty(),\n note_hash_read_requests: BoundedVec::new(),\n nullifier_read_requests: BoundedVec::new(),\n key_validation_requests_and_generators: BoundedVec::new(),\n note_hashes: BoundedVec::new(),\n nullifiers: BoundedVec::new(),\n historical_header: inputs.historical_header,\n private_call_requests: BoundedVec::new(),\n public_call_requests: BoundedVec::new(),\n public_teardown_call_request: PublicCallRequest::empty(),\n l2_to_l1_msgs: BoundedVec::new(),\n private_logs: BoundedVec::new(),\n contract_class_logs_hashes: BoundedVec::new(),\n last_key_validation_requests: [Option::none(); NUM_KEY_TYPES],\n }\n }\n\n pub fn msg_sender(self) -> AztecAddress {\n self.inputs.call_context.msg_sender\n }\n\n pub fn this_address(self) -> AztecAddress {\n self.inputs.call_context.contract_address\n }\n\n pub fn chain_id(self) -> Field {\n self.inputs.tx_context.chain_id\n }\n\n pub fn version(self) -> Field {\n self.inputs.tx_context.version\n }\n\n pub fn gas_settings(self) -> GasSettings {\n self.inputs.tx_context.gas_settings\n }\n\n pub fn selector(self) -> FunctionSelector {\n self.inputs.call_context.function_selector\n }\n\n pub fn get_args_hash(self) -> Field {\n self.args_hash\n }\n\n pub fn push_note_hash(&mut self, note_hash: Field) {\n self.note_hashes.push(NoteHash { value: note_hash, counter: self.next_counter() });\n }\n\n pub fn push_nullifier(&mut self, nullifier: Field) {\n notify_created_nullifier(nullifier);\n self.nullifiers.push(\n Nullifier { value: nullifier, note_hash: 0, counter: self.next_counter() },\n );\n }\n\n pub fn push_nullifier_for_note_hash(&mut self, nullifier: Field, nullified_note_hash: Field) {\n let nullifier_counter = self.next_counter();\n notify_nullified_note(nullifier, nullified_note_hash, nullifier_counter);\n self.nullifiers.push(\n Nullifier {\n value: nullifier,\n note_hash: nullified_note_hash,\n counter: nullifier_counter,\n },\n );\n }\n\n // Returns the header of a block whose state is used during private execution (not the block the transaction is\n // included in).\n pub fn get_block_header(self) -> BlockHeader {\n self.historical_header\n }\n\n // Returns the header of an arbitrary block whose block number is less than or equal to the block number\n // of historical header.\n pub fn get_block_header_at(self, block_number: u32) -> BlockHeader {\n get_block_header_at(block_number, self)\n }\n\n pub fn set_return_hash(&mut self, returns_hasher: ArgsHasher) {\n self.return_hash = returns_hasher.hash();\n execution_cache::store(returns_hasher.fields, self.return_hash);\n }\n\n pub fn finish(self) -> PrivateCircuitPublicInputs {\n PrivateCircuitPublicInputs {\n call_context: self.inputs.call_context,\n args_hash: self.args_hash,\n returns_hash: self.return_hash,\n min_revertible_side_effect_counter: self.min_revertible_side_effect_counter,\n is_fee_payer: self.is_fee_payer,\n max_block_number: self.max_block_number,\n note_hash_read_requests: self.note_hash_read_requests.storage(),\n nullifier_read_requests: self.nullifier_read_requests.storage(),\n key_validation_requests_and_generators: self\n .key_validation_requests_and_generators\n .storage(),\n note_hashes: self.note_hashes.storage(),\n nullifiers: self.nullifiers.storage(),\n private_call_requests: self.private_call_requests.storage(),\n public_call_requests: self.public_call_requests.storage(),\n public_teardown_call_request: self.public_teardown_call_request,\n l2_to_l1_msgs: self.l2_to_l1_msgs.storage(),\n start_side_effect_counter: self.inputs.start_side_effect_counter,\n end_side_effect_counter: self.side_effect_counter,\n private_logs: self.private_logs.storage(),\n contract_class_logs_hashes: self.contract_class_logs_hashes.storage(),\n historical_header: self.historical_header,\n tx_context: self.inputs.tx_context,\n }\n }\n\n pub fn set_as_fee_payer(&mut self) {\n dep::protocol_types::debug_log::debug_log_format(\n \"Setting {0} as fee payer\",\n [self.this_address().to_field()],\n );\n self.is_fee_payer = true;\n }\n\n pub fn end_setup(&mut self) {\n // dep::protocol_types::debug_log::debug_log_format(\n // \"Ending setup at counter {0}\",\n // [self.side_effect_counter as Field]\n // );\n self.min_revertible_side_effect_counter = self.side_effect_counter;\n notify_set_min_revertible_side_effect_counter(self.min_revertible_side_effect_counter);\n }\n\n // docs:start:max-block-number\n pub fn set_tx_max_block_number(&mut self, max_block_number: u32) {\n // docs:end:max-block-number\n self.max_block_number =\n MaxBlockNumber::min_with_u32(self.max_block_number, max_block_number);\n }\n\n pub fn push_note_hash_read_request(&mut self, note_hash: Field) {\n let side_effect = ReadRequest { value: note_hash, counter: self.next_counter() };\n self.note_hash_read_requests.push(side_effect);\n }\n\n pub fn push_nullifier_read_request(&mut self, nullifier: Field) {\n let request = ReadRequest { value: nullifier, counter: self.next_counter() };\n self.nullifier_read_requests.push(request);\n }\n\n pub fn request_nsk_app(&mut self, npk_m_hash: Field) -> Field {\n self.request_sk_app(npk_m_hash, NULLIFIER_INDEX)\n }\n\n pub fn request_ovsk_app(&mut self, ovpk_m_hash: Field) -> Field {\n self.request_sk_app(ovpk_m_hash, OUTGOING_INDEX)\n }\n\n fn request_sk_app(&mut self, pk_m_hash: Field, key_index: Field) -> Field {\n let cached_request = self.last_key_validation_requests[key_index as u32].unwrap_or(\n KeyValidationRequest::empty(),\n );\n\n if cached_request.pk_m.hash() == pk_m_hash {\n // We get a match so the cached request is the latest one\n cached_request.sk_app\n } else {\n // We didn't get a match meaning the cached result is stale\n // Typically we'd validate keys by showing that they are the preimage of `pk_m_hash`, but that'd require\n // the oracle returning the master secret keys, which could cause malicious contracts to leak it or learn\n // about secrets from other contracts. We therefore silo secret keys, and rely on the private kernel to\n // validate that we siloed secret key corresponds to correct siloing of the master secret key that hashes\n // to `pk_m_hash`.\n\n // Safety: Kernels verify that the key validation request is valid and below we verify that a request\n // for the correct public key has been received.\n let request = unsafe { get_key_validation_request(pk_m_hash, key_index) };\n assert_eq(request.pk_m.hash(), pk_m_hash, \"Obtained invalid key validation request\");\n\n self.key_validation_requests_and_generators.push(\n KeyValidationRequestAndGenerator {\n request,\n sk_app_generator: sk_generators[key_index as u32],\n },\n );\n self.last_key_validation_requests[key_index as u32] = Option::some(request);\n request.sk_app\n }\n }\n\n // docs:start:context_message_portal\n pub fn message_portal(&mut self, recipient: EthAddress, content: Field) {\n // docs:end:context_message_portal\n let message = L2ToL1Message { recipient, content, counter: self.next_counter() };\n self.l2_to_l1_msgs.push(message);\n }\n\n // docs:start:context_consume_l1_to_l2_message\n // docs:start:consume_l1_to_l2_message\n pub fn consume_l1_to_l2_message(\n &mut self,\n content: Field,\n secret: Field,\n sender: EthAddress,\n leaf_index: Field,\n ) {\n // docs:end:context_consume_l1_to_l2_message\n let nullifier = process_l1_to_l2_message(\n self.historical_header.state.l1_to_l2_message_tree.root,\n self.this_address(),\n sender,\n self.chain_id(),\n self.version(),\n content,\n secret,\n leaf_index,\n );\n\n // Push nullifier (and the \"commitment\" corresponding to this can be \"empty\")\n self.push_nullifier(nullifier)\n }\n // docs:end:consume_l1_to_l2_message\n\n pub fn emit_private_log(&mut self, log: [Field; PRIVATE_LOG_SIZE_IN_FIELDS]) {\n let counter = self.next_counter();\n let private_log = PrivateLogData { log: Log::new(log), note_hash_counter: 0, counter };\n self.private_logs.push(private_log);\n }\n\n pub fn emit_raw_note_log(\n &mut self,\n log: [Field; PRIVATE_LOG_SIZE_IN_FIELDS],\n note_hash_counter: u32,\n ) {\n let counter = self.next_counter();\n let private_log = PrivateLogData { log: Log::new(log), note_hash_counter, counter };\n self.private_logs.push(private_log);\n }\n\n pub fn call_private_function<let ARGS_COUNT: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ARGS_COUNT],\n ) -> ReturnsHash {\n let args_hash = hash_args_array(args);\n execution_cache::store(args, args_hash);\n self.call_private_function_with_args_hash(\n contract_address,\n function_selector,\n args_hash,\n false,\n )\n }\n\n pub fn static_call_private_function<let ARGS_COUNT: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ARGS_COUNT],\n ) -> ReturnsHash {\n let args_hash = hash_args_array(args);\n execution_cache::store(args, args_hash);\n self.call_private_function_with_args_hash(\n contract_address,\n function_selector,\n args_hash,\n true,\n )\n }\n\n pub fn call_private_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n ) -> ReturnsHash {\n self.call_private_function_with_args_hash(contract_address, function_selector, 0, false)\n }\n\n pub fn static_call_private_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n ) -> ReturnsHash {\n self.call_private_function_with_args_hash(contract_address, function_selector, 0, true)\n }\n\n pub fn call_private_function_with_args_hash(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args_hash: Field,\n is_static_call: bool,\n ) -> ReturnsHash {\n let mut is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n let start_side_effect_counter = self.side_effect_counter;\n\n // Safety: The oracle simulates the private call and returns the value of the side effects counter after\n // execution of the call (which means that end_side_effect_counter - start_side_effect_counter is\n // the number of side effects that took place), along with the hash of the return values. We validate these\n // by requesting a private kernel iteration in which the return values are constrained to hash\n // to `returns_hash` and the side effects counter to increment from start to end.\n let (end_side_effect_counter, returns_hash) = unsafe {\n call_private_function_internal(\n contract_address,\n function_selector,\n args_hash,\n start_side_effect_counter,\n is_static_call,\n )\n };\n\n self.private_call_requests.push(\n PrivateCallRequest {\n call_context: CallContext {\n msg_sender: self.this_address(),\n contract_address,\n function_selector,\n is_static_call,\n },\n args_hash,\n returns_hash,\n start_side_effect_counter,\n end_side_effect_counter,\n },\n );\n\n // TODO (fees) figure out why this crashes the prover and enable it\n // we need this in order to pay fees inside child call contexts\n // assert(\n // (item.public_inputs.min_revertible_side_effect_counter == 0 as u32)\n // | (item.public_inputs.min_revertible_side_effect_counter\n // > self.min_revertible_side_effect_counter)\n // );\n // if item.public_inputs.min_revertible_side_effect_counter\n // > self.min_revertible_side_effect_counter {\n // self.min_revertible_side_effect_counter = item.public_inputs.min_revertible_side_effect_counter;\n // }\n self.side_effect_counter = end_side_effect_counter + 1;\n ReturnsHash::new(returns_hash)\n }\n\n pub fn call_public_function<let ARGS_COUNT: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ARGS_COUNT],\n ) {\n let calldata = array_concat([function_selector.to_field()], args);\n let calldata_hash = hash_calldata_array(calldata);\n execution_cache::store(calldata, calldata_hash);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, false)\n }\n\n pub fn static_call_public_function<let ARGS_COUNT: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ARGS_COUNT],\n ) {\n let calldata = array_concat([function_selector.to_field()], args);\n let calldata_hash = hash_calldata_array(calldata);\n execution_cache::store(calldata, calldata_hash);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, true)\n }\n\n pub fn call_public_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n ) {\n let calldata_hash = hash_calldata_array([function_selector.to_field()]);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, false)\n }\n\n pub fn static_call_public_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n ) {\n let calldata_hash = hash_calldata_array([function_selector.to_field()]);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, true)\n }\n\n pub fn call_public_function_with_calldata_hash(\n &mut self,\n contract_address: AztecAddress,\n calldata_hash: Field,\n is_static_call: bool,\n ) {\n let counter = self.next_counter();\n\n let mut is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n notify_enqueued_public_function_call(\n contract_address,\n calldata_hash,\n counter,\n is_static_call,\n );\n\n let call_request = PublicCallRequest {\n msg_sender: self.this_address(),\n contract_address,\n is_static_call,\n calldata_hash,\n };\n\n self.public_call_requests.push(Counted::new(call_request, counter));\n }\n\n pub fn set_public_teardown_function<let ARGS_COUNT: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ARGS_COUNT],\n ) {\n let calldata = array_concat([function_selector.to_field()], args);\n let calldata_hash = hash_calldata_array(calldata);\n execution_cache::store(calldata, calldata_hash);\n self.set_public_teardown_function_with_calldata_hash(contract_address, calldata_hash, false)\n }\n\n pub fn set_public_teardown_function_with_calldata_hash(\n &mut self,\n contract_address: AztecAddress,\n calldata_hash: Field,\n is_static_call: bool,\n ) {\n let counter = self.next_counter();\n\n let mut is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n notify_set_public_teardown_function_call(\n contract_address,\n calldata_hash,\n counter,\n is_static_call,\n );\n\n self.public_teardown_call_request = PublicCallRequest {\n msg_sender: self.this_address(),\n contract_address,\n is_static_call,\n calldata_hash,\n };\n }\n\n fn next_counter(&mut self) -> u32 {\n let counter = self.side_effect_counter;\n self.side_effect_counter += 1;\n counter\n }\n}\n\nimpl Empty for PrivateContext {\n fn empty() -> Self {\n PrivateContext {\n inputs: PrivateContextInputs::empty(),\n side_effect_counter: 0 as u32,\n min_revertible_side_effect_counter: 0 as u32,\n is_fee_payer: false,\n args_hash: 0,\n return_hash: 0,\n max_block_number: MaxBlockNumber::empty(),\n note_hash_read_requests: BoundedVec::new(),\n nullifier_read_requests: BoundedVec::new(),\n key_validation_requests_and_generators: BoundedVec::new(),\n note_hashes: BoundedVec::new(),\n nullifiers: BoundedVec::new(),\n private_call_requests: BoundedVec::new(),\n public_call_requests: BoundedVec::new(),\n public_teardown_call_request: PublicCallRequest::empty(),\n l2_to_l1_msgs: BoundedVec::new(),\n historical_header: BlockHeader::empty(),\n private_logs: BoundedVec::new(),\n contract_class_logs_hashes: BoundedVec::new(),\n last_key_validation_requests: [Option::none(); NUM_KEY_TYPES],\n }\n }\n}\n"
3045
2809
  },
3046
- "64": {
2810
+ "60": {
3047
2811
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/public_context.nr",
3048
2812
  "source": "use crate::context::gas::GasOpts;\nuse crate::hash::{\n compute_l1_to_l2_message_hash, compute_l1_to_l2_message_nullifier, compute_secret_hash,\n};\nuse dep::protocol_types::abis::function_selector::FunctionSelector;\nuse dep::protocol_types::address::{AztecAddress, EthAddress};\nuse dep::protocol_types::constants::MAX_FIELD_VALUE;\nuse dep::protocol_types::traits::{Empty, FromField, Packable, Serialize, ToField};\n\npub struct PublicContext {\n pub args_hash: Option<Field>,\n pub compute_args_hash: fn() -> Field,\n}\n\nimpl PublicContext {\n pub fn new(compute_args_hash: fn() -> Field) -> Self {\n PublicContext { args_hash: Option::none(), compute_args_hash }\n }\n\n pub fn emit_public_log<T, let N: u32>(_self: &mut Self, log: T)\n where\n T: Serialize<N>,\n {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { emit_public_log(Serialize::serialize(log).as_slice()) };\n }\n\n pub fn note_hash_exists(_self: Self, note_hash: Field, leaf_index: Field) -> bool {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { note_hash_exists(note_hash, leaf_index) } == 1\n }\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\n unsafe { l1_to_l2_msg_exists(msg_hash, msg_leaf_index) } == 1\n }\n\n pub fn nullifier_exists(_self: Self, unsiloed_nullifier: Field, address: AztecAddress) -> bool {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { nullifier_exists(unsiloed_nullifier, address.to_field()) } == 1\n }\n\n pub fn consume_l1_to_l2_message(\n &mut self,\n content: Field,\n secret: Field,\n sender: EthAddress,\n leaf_index: Field,\n ) {\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(\n !self.nullifier_exists(nullifier, self.this_address()),\n \"L1-to-L2 message is already nullified\",\n );\n assert(\n self.l1_to_l2_msg_exists(message_hash, leaf_index),\n \"Tried to consume nonexistent L1-to-L2 message\",\n );\n\n self.push_nullifier(nullifier);\n }\n\n pub fn message_portal(_self: &mut Self, recipient: EthAddress, content: Field) {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { send_l2_to_l1_msg(recipient, content) };\n }\n\n pub unconstrained fn call_public_function(\n _self: &mut Self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field],\n gas_opts: GasOpts,\n ) -> [Field] {\n let calldata = args.push_front(function_selector.to_field());\n\n call(gas_for_call(gas_opts), contract_address, calldata);\n // Use success_copy to determine whether the call succeeded\n let success = success_copy();\n\n let result_data = returndata_copy(0, returndata_size());\n if !success {\n // Rethrow the revert data.\n avm_revert(result_data);\n }\n result_data\n }\n\n pub unconstrained fn static_call_public_function(\n _self: &mut Self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field],\n gas_opts: GasOpts,\n ) -> [Field] {\n let calldata = args.push_front(function_selector.to_field());\n\n call_static(gas_for_call(gas_opts), contract_address, calldata);\n // Use success_copy to determine whether the call succeeded\n let success = success_copy();\n\n let result_data = returndata_copy(0, returndata_size());\n if !success {\n // Rethrow the revert data.\n avm_revert(result_data);\n }\n result_data\n }\n\n pub fn push_note_hash(_self: &mut Self, note_hash: Field) {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { emit_note_hash(note_hash) };\n }\n pub fn push_nullifier(_self: &mut Self, nullifier: Field) {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { emit_nullifier(nullifier) };\n }\n\n pub fn this_address(_self: Self) -> AztecAddress {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n address()\n }\n }\n pub fn msg_sender(_self: Self) -> AztecAddress {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n sender()\n }\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 { calldata_copy(0, 1) };\n FunctionSelector::from_field(raw_selector[0])\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 pub fn transaction_fee(_self: Self) -> Field {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n transaction_fee()\n }\n }\n\n pub fn chain_id(_self: Self) -> Field {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n chain_id()\n }\n }\n pub fn version(_self: Self) -> Field {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n version()\n }\n }\n pub fn block_number(_self: Self) -> Field {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n block_number()\n }\n }\n pub fn timestamp(_self: Self) -> u64 {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n timestamp()\n }\n }\n pub fn fee_per_l2_gas(_self: Self) -> Field {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n fee_per_l2_gas()\n }\n }\n pub fn fee_per_da_gas(_self: Self) -> Field {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n fee_per_da_gas()\n }\n }\n\n pub fn l2_gas_left(_self: Self) -> Field {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n l2_gas_left()\n }\n }\n pub fn da_gas_left(_self: Self) -> Field {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n da_gas_left()\n }\n }\n pub fn is_static_call(_self: Self) -> bool {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { is_static_call() } == 1\n }\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 { storage_read(storage_slot + i as Field) };\n }\n out\n }\n\n pub fn storage_read<T, let N: u32>(self, storage_slot: Field) -> T\n where\n T: Packable<N>,\n {\n T::unpack(self.raw_storage_read(storage_slot))\n }\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 { storage_write(storage_slot + i as Field, values[i]) };\n }\n }\n\n pub fn storage_write<T, let N: u32>(self, storage_slot: Field, value: T)\n where\n T: Packable<N>,\n {\n self.raw_storage_write(storage_slot, value.pack());\n }\n}\n\n// Helper functions\nfn gas_for_call(user_gas: GasOpts) -> [Field; 2] {\n // It's ok to use the max possible gas here, because the gas will be\n // capped by the gas left in the (STATIC)CALL instruction.\n [user_gas.l2_gas.unwrap_or(MAX_FIELD_VALUE), user_gas.da_gas.unwrap_or(MAX_FIELD_VALUE)]\n}\n\n// Unconstrained opcode wrappers (do not use directly).\nunconstrained fn address() -> AztecAddress {\n address_opcode()\n}\nunconstrained fn sender() -> AztecAddress {\n sender_opcode()\n}\nunconstrained fn transaction_fee() -> Field {\n transaction_fee_opcode()\n}\nunconstrained fn chain_id() -> Field {\n chain_id_opcode()\n}\nunconstrained fn version() -> Field {\n version_opcode()\n}\nunconstrained fn block_number() -> Field {\n block_number_opcode()\n}\nunconstrained fn timestamp() -> u64 {\n timestamp_opcode()\n}\nunconstrained fn fee_per_l2_gas() -> Field {\n fee_per_l2_gas_opcode()\n}\nunconstrained fn fee_per_da_gas() -> Field {\n fee_per_da_gas_opcode()\n}\nunconstrained fn l2_gas_left() -> Field {\n l2_gas_left_opcode()\n}\nunconstrained fn da_gas_left() -> Field {\n da_gas_left_opcode()\n}\nunconstrained fn is_static_call() -> Field {\n is_static_call_opcode()\n}\nunconstrained fn note_hash_exists(note_hash: Field, leaf_index: Field) -> u1 {\n note_hash_exists_opcode(note_hash, leaf_index)\n}\nunconstrained fn emit_note_hash(note_hash: Field) {\n emit_note_hash_opcode(note_hash)\n}\nunconstrained fn nullifier_exists(nullifier: Field, address: Field) -> u1 {\n nullifier_exists_opcode(nullifier, address)\n}\nunconstrained fn emit_nullifier(nullifier: Field) {\n emit_nullifier_opcode(nullifier)\n}\nunconstrained fn emit_public_log(message: [Field]) {\n emit_public_log_opcode(message)\n}\nunconstrained fn l1_to_l2_msg_exists(msg_hash: Field, msg_leaf_index: Field) -> u1 {\n l1_to_l2_msg_exists_opcode(msg_hash, msg_leaf_index)\n}\nunconstrained fn send_l2_to_l1_msg(recipient: EthAddress, content: Field) {\n send_l2_to_l1_msg_opcode(recipient, content)\n}\nunconstrained fn call(gas: [Field; 2], address: AztecAddress, args: [Field]) {\n call_opcode(gas, address, args)\n}\n\nunconstrained fn call_static(gas: [Field; 2], address: AztecAddress, args: [Field]) {\n call_static_opcode(gas, address, args)\n}\n\npub unconstrained fn calldata_copy<let N: u32>(cdoffset: u32, copy_size: u32) -> [Field; N] {\n calldata_copy_opcode(cdoffset, copy_size)\n}\n\n// `success_copy` is placed immediately after the CALL opcode to get the success value\nunconstrained fn success_copy() -> bool {\n success_copy_opcode()\n}\n\nunconstrained fn returndata_size() -> u32 {\n returndata_size_opcode()\n}\n\nunconstrained fn returndata_copy(rdoffset: u32, copy_size: u32) -> [Field] {\n returndata_copy_opcode(rdoffset, copy_size)\n}\n\npub unconstrained fn avm_return(returndata: [Field]) {\n return_opcode(returndata)\n}\n\n// This opcode reverts using the exact data given. In general it should only be used\n// to do rethrows, where the revert data is the same as the original revert data.\n// For normal reverts, use Noir's `assert` which, on top of reverting, will also add\n// an error selector to the revert data.\nunconstrained fn avm_revert(revertdata: [Field]) {\n revert_opcode(revertdata)\n}\n\nunconstrained fn storage_read(storage_slot: Field) -> Field {\n storage_read_opcode(storage_slot)\n}\n\nunconstrained fn storage_write(storage_slot: Field, value: Field) {\n storage_write_opcode(storage_slot, value);\n}\n\nimpl Empty for PublicContext {\n fn empty() -> Self {\n PublicContext::new(|| 0)\n }\n}\n\n// AVM oracles (opcodes) follow, do not use directly.\n#[oracle(avmOpcodeAddress)]\nunconstrained fn address_opcode() -> AztecAddress {}\n\n#[oracle(avmOpcodeSender)]\nunconstrained fn sender_opcode() -> AztecAddress {}\n\n#[oracle(avmOpcodeTransactionFee)]\nunconstrained fn transaction_fee_opcode() -> Field {}\n\n#[oracle(avmOpcodeChainId)]\nunconstrained fn chain_id_opcode() -> Field {}\n\n#[oracle(avmOpcodeVersion)]\nunconstrained fn version_opcode() -> Field {}\n\n#[oracle(avmOpcodeBlockNumber)]\nunconstrained fn block_number_opcode() -> Field {}\n\n#[oracle(avmOpcodeTimestamp)]\nunconstrained fn timestamp_opcode() -> u64 {}\n\n#[oracle(avmOpcodeFeePerL2Gas)]\nunconstrained fn fee_per_l2_gas_opcode() -> Field {}\n\n#[oracle(avmOpcodeFeePerDaGas)]\nunconstrained fn fee_per_da_gas_opcode() -> Field {}\n\n#[oracle(avmOpcodeL2GasLeft)]\nunconstrained fn l2_gas_left_opcode() -> Field {}\n\n#[oracle(avmOpcodeDaGasLeft)]\nunconstrained fn da_gas_left_opcode() -> Field {}\n\n#[oracle(avmOpcodeIsStaticCall)]\nunconstrained fn is_static_call_opcode() -> Field {}\n\n#[oracle(avmOpcodeNoteHashExists)]\nunconstrained fn note_hash_exists_opcode(note_hash: Field, leaf_index: Field) -> u1 {}\n\n#[oracle(avmOpcodeEmitNoteHash)]\nunconstrained fn emit_note_hash_opcode(note_hash: Field) {}\n\n#[oracle(avmOpcodeNullifierExists)]\nunconstrained fn nullifier_exists_opcode(nullifier: Field, address: Field) -> u1 {}\n\n#[oracle(avmOpcodeEmitNullifier)]\nunconstrained fn emit_nullifier_opcode(nullifier: Field) {}\n\n// TODO(#11124): rename unencrypted to public in avm\n#[oracle(avmOpcodeEmitUnencryptedLog)]\nunconstrained fn emit_public_log_opcode(message: [Field]) {}\n\n#[oracle(avmOpcodeL1ToL2MsgExists)]\nunconstrained fn l1_to_l2_msg_exists_opcode(msg_hash: Field, msg_leaf_index: Field) -> u1 {}\n\n#[oracle(avmOpcodeSendL2ToL1Msg)]\nunconstrained fn send_l2_to_l1_msg_opcode(recipient: EthAddress, content: Field) {}\n\n#[oracle(avmOpcodeCalldataCopy)]\nunconstrained fn calldata_copy_opcode<let N: u32>(cdoffset: u32, copy_size: u32) -> [Field; N] {}\n\n#[oracle(avmOpcodeReturndataSize)]\nunconstrained fn returndata_size_opcode() -> u32 {}\n\n#[oracle(avmOpcodeReturndataCopy)]\nunconstrained fn returndata_copy_opcode(rdoffset: u32, copy_size: u32) -> [Field] {}\n\n#[oracle(avmOpcodeReturn)]\nunconstrained fn return_opcode(returndata: [Field]) {}\n\n// This opcode reverts using the exact data given. In general it should only be used\n// to do rethrows, where the revert data is the same as the original revert data.\n// For normal reverts, use Noir's `assert` which, on top of reverting, will also add\n// an error selector to the revert data.\n#[oracle(avmOpcodeRevert)]\nunconstrained fn revert_opcode(revertdata: [Field]) {}\n\n#[oracle(avmOpcodeCall)]\nunconstrained fn call_opcode(\n gas: [Field; 2], // gas allocation: [l2_gas, da_gas]\n address: AztecAddress,\n args: [Field],\n) {}\n\n#[oracle(avmOpcodeStaticCall)]\nunconstrained fn call_static_opcode(\n gas: [Field; 2], // gas allocation: [l2_gas, da_gas]\n address: AztecAddress,\n args: [Field],\n) {}\n\n#[oracle(avmOpcodeSuccessCopy)]\nunconstrained fn success_copy_opcode() -> bool {}\n\n#[oracle(avmOpcodeStorageRead)]\nunconstrained fn storage_read_opcode(storage_slot: Field) -> Field {}\n\n#[oracle(avmOpcodeStorageWrite)]\nunconstrained fn storage_write_opcode(storage_slot: Field, value: Field) {}\n"
3049
2813
  },
3050
- "65": {
2814
+ "61": {
3051
2815
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/returns_hash.nr",
3052
2816
  "source": "use crate::{hash::hash_args_array, oracle::execution_cache};\nuse dep::protocol_types::traits::Deserialize;\n\npub struct ReturnsHash {\n hash: Field,\n}\n\nimpl ReturnsHash {\n pub fn new(hash: Field) -> Self {\n ReturnsHash { hash }\n }\n\n pub fn assert_empty(self) {\n assert_eq(self.hash, 0);\n }\n\n pub fn raw(self) -> Field {\n self.hash\n }\n\n /// This is only used during private execution, since in public it is the VM itself that keeps track of return\n /// values.\n pub fn get_preimage<T, let N: u32>(self) -> T\n where\n T: Deserialize<N>,\n {\n // Safety: We verify that the value returned by `load` is the preimage of `hash`, fully constraining it.\n let preimage: [Field; N] = unsafe { execution_cache::load(self.hash) };\n assert_eq(self.hash, hash_args_array(preimage));\n\n Deserialize::deserialize(preimage)\n }\n}\n"
3053
2817
  },
3054
- "66": {
2818
+ "62": {
3055
2819
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/utility_context.nr",
3056
2820
  "source": "use crate::oracle::{\n execution::{get_block_number, get_chain_id, get_contract_address, get_version},\n storage::storage_read,\n};\nuse dep::protocol_types::{address::AztecAddress, traits::Packable};\n\npub struct UtilityContext {\n block_number: u32,\n contract_address: AztecAddress,\n version: Field,\n chain_id: Field,\n}\n\nimpl UtilityContext {\n pub unconstrained fn new() -> Self {\n // We could call these oracles on the getters instead of at creation, which makes sense given that they might\n // not even be accessed. However any performance gains are minimal, and we'd rather fail early if a user\n // incorrectly attempts to create a UtilityContext in an environment in which these oracles are not\n // available.\n let block_number = get_block_number();\n let contract_address = get_contract_address();\n let chain_id = get_chain_id();\n let version = get_version();\n Self { block_number, contract_address, version, chain_id }\n }\n\n pub unconstrained fn at(contract_address: AztecAddress) -> Self {\n let block_number = get_block_number();\n let chain_id = get_chain_id();\n let version = get_version();\n Self { block_number, contract_address, version, chain_id }\n }\n\n pub unconstrained fn at_historical(contract_address: AztecAddress, block_number: u32) -> Self {\n let chain_id = get_chain_id();\n let version = get_version();\n Self { block_number, contract_address, version, chain_id }\n }\n\n pub fn block_number(self) -> u32 {\n self.block_number\n }\n\n pub fn this_address(self) -> AztecAddress {\n self.contract_address\n }\n\n pub fn version(self) -> Field {\n self.version\n }\n\n pub fn chain_id(self) -> Field {\n self.chain_id\n }\n\n pub unconstrained fn raw_storage_read<let N: u32>(\n self: Self,\n storage_slot: Field,\n ) -> [Field; N] {\n storage_read(self.this_address(), storage_slot, self.block_number())\n }\n\n pub unconstrained fn storage_read<T, let N: u32>(self, storage_slot: Field) -> T\n where\n T: Packable<N>,\n {\n T::unpack(self.raw_storage_read(storage_slot))\n }\n}\n"
3057
2821
  },
3058
- "68": {
3059
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/discovery/mod.nr",
3060
- "source": "use crate::encrypted_logs::log_encryption::PRIVATE_LOG_PLAINTEXT_SIZE_IN_FIELDS;\nuse protocol_types::{address::AztecAddress, debug_log::debug_log};\n\npub mod nonce_discovery;\npub mod partial_notes;\npub mod pending_tagged_log;\npub mod private_logs;\npub mod private_notes;\n\n/// We reserve two fields in the note private log that are not part of the note content: one for the storage slot, and\n/// one for the combined log and note type ID.\nglobal PRIVATE_LOG_EXPANDED_METADATA_LEN: u32 = 1;\n\n/// The maximum length of the log's content, i.e. after log type ID and metadata extraction.\npub global MAX_LOG_CONTENT_LEN: u32 =\n PRIVATE_LOG_PLAINTEXT_SIZE_IN_FIELDS - PRIVATE_LOG_EXPANDED_METADATA_LEN;\n\nuse private_notes::MAX_NOTE_PACKED_LEN;\n\npub struct NoteHashAndNullifier {\n /// The result of NoteHash::compute_note_hash\n pub note_hash: Field,\n /// The result of NoteHash::compute_nullifier_unconstrained (since all of message discovery is unconstrained)\n pub inner_nullifier: Field,\n}\n\n/// A function which takes a note's packed content, address of the emitting contract, nonce, storage slot and note type\n/// ID and attempts to compute its note hash (not siloed by nonce nor address) and inner nullifier (not siloed by\n/// address).\n///\n/// This function must be user-provided as its implementation requires knowledge of how note type IDs are allocated in a\n/// contract. The `#[aztec]` macro automatically creates such a contract library method called\n/// `_compute_note_hash_and_nullifier`, which looks something like this:\n///\n/// ```\n/// |packed_note, contract_address, nonce, storage_slot, note_type_id| {\n/// if note_type_id == MyNoteType::get_id() {\n/// assert(packed_note.len() == MY_NOTE_TYPE_SERIALIZATION_LENGTH);\n///\n/// let note = MyNoteType::unpack(aztec::utils::array::subarray(packed_note.storage(), 0));\n///\n/// let note_hash = note.compute_note_hash(storage_slot);\n/// let note_hash_for_nullify = aztec::note::utils::compute_note_hash_for_nullify(\n/// RetrievedNote{ note, contract_address, metadata: SettledNoteMetadata::new(nonce).into() },\n/// storage_slot\n/// );\n///\n/// let inner_nullifier = note.compute_nullifier_unconstrained(note_hash_for_nullify);\n///\n/// Option::some(\n/// aztec::discovery::NoteHashAndNullifier {\n/// note_hash, inner_nullifier\n/// }\n/// )\n/// } else if note_type_id == MyOtherNoteType::get_id() {\n/// ... // Similar to above but calling MyOtherNoteType::unpack_content\n/// } else {\n/// Option::none() // Unknown note type ID\n/// };\n/// }\n/// ```\ntype ComputeNoteHashAndNullifier<Env> = unconstrained fn[Env](/* packed_note */BoundedVec<Field, MAX_NOTE_PACKED_LEN>, /* storage_slot */ Field, /* note_type_id */ Field, /* contract_address */ AztecAddress, /* nonce */ Field) -> Option<NoteHashAndNullifier>;\n\n/// Performs the message discovery process, in which private are downloaded and inspected to find new private notes,\n/// partial notes and events, etc., and pending partial notes are processed to search for their completion logs.\n/// This is the mechanism via which a contract updates its knowledge of its private state.\n///\n/// Receives the address of the contract on which discovery is performed along with its\n/// `compute_note_hash_and_nullifier` function.\npub unconstrained fn discover_new_messages<Env>(\n contract_address: AztecAddress,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n) {\n debug_log(\"Performing message discovery\");\n\n private_logs::fetch_and_process_private_tagged_logs(\n contract_address,\n compute_note_hash_and_nullifier,\n );\n\n partial_notes::fetch_and_process_public_partial_note_completion_logs(\n contract_address,\n compute_note_hash_and_nullifier,\n );\n}\n"
3061
- },
3062
- "69": {
3063
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/discovery/nonce_discovery.nr",
3064
- "source": "use crate::{\n discovery::{ComputeNoteHashAndNullifier, private_notes::MAX_NOTE_PACKED_LEN},\n utils::array,\n};\n\nuse dep::protocol_types::{\n address::AztecAddress,\n constants::MAX_NOTE_HASHES_PER_TX,\n debug_log::debug_log_format,\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 struct DiscoveredNoteInfo {\n pub nonce: Field,\n pub note_hash: Field,\n pub 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 unconstrained fn attempt_note_nonce_discovery<Env>(\n unique_note_hashes_in_tx: BoundedVec<Field, MAX_NOTE_HASHES_PER_TX>,\n first_nullifier_in_tx: Field,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n contract_address: AztecAddress,\n storage_slot: 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 debug_log_format(\n \"Attempting nonce discovery on {0} potential notes on contract {1} for storage slot {2}\",\n [unique_note_hashes_in_tx.len() as Field, contract_address.to_field(), storage_slot],\n );\n\n // We need to find nonces (typically just one) that result in a note hash that, once siloed into a unique note hash,\n // is one of the note hashes created by the transaction.\n array::for_each_in_bounded_vec(\n unique_note_hashes_in_tx,\n |expected_unique_note_hash, i| {\n // Nonces are computed by hashing the first nullifier in the transaction with the index of the note in the\n // new note hashes array. We therefore know for each note in every transaction what its nonce is.\n let candidate_nonce = compute_note_hash_nonce(first_nullifier_in_tx, i);\n\n // Given nonce, note content and metadata, we can compute the note hash and silo it to check if it matches\n // the note hash at the array index we're currently processing.\n // TODO(#11157): handle failed note_hash_and_nullifier computation\n let hashes = compute_note_hash_and_nullifier(\n packed_note,\n storage_slot,\n note_type_id,\n contract_address,\n candidate_nonce,\n )\n .expect(f\"Failed to compute a note hash for note type {note_type_id}\");\n\n let siloed_note_hash = compute_siloed_note_hash(contract_address, hashes.note_hash);\n let unique_note_hash = compute_unique_note_hash(candidate_nonce, siloed_note_hash);\n\n if unique_note_hash == expected_unique_note_hash {\n // Note that while we did check that the note hash is the preimage of the expected unique note hash, we\n // perform no validations on the nullifier - we fundamentally cannot, since only the application knows\n // how to compute nullifiers. We simply trust it to have provided the correct one: if it hasn't, then\n // PXE may fail to realize that a given note has been nullified already, and calls to the application\n // could result in invalid transactions (with duplicate nullifiers). This is not a concern because an\n // application already has more direct means of making a call to it fail the transaction.\n discovered_notes.push(\n DiscoveredNoteInfo {\n nonce: candidate_nonce,\n note_hash: hashes.note_hash,\n inner_nullifier: hashes.inner_nullifier,\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 debug_log_format(\n \"Discovered a total of {0} notes\",\n [discovered_notes.len() as Field],\n );\n\n *discovered_notes\n}\n"
3065
- },
3066
- "70": {
3067
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/discovery/partial_notes.nr",
3068
- "source": "use crate::{\n capsules::CapsuleArray,\n discovery::{\n ComputeNoteHashAndNullifier,\n MAX_LOG_CONTENT_LEN,\n nonce_discovery::{attempt_note_nonce_discovery, DiscoveredNoteInfo},\n },\n oracle::message_discovery::{deliver_note, get_log_by_tag},\n utils::array,\n};\n\nuse dep::protocol_types::{\n address::AztecAddress,\n constants::PUBLIC_LOG_DATA_SIZE_IN_FIELDS,\n debug_log::debug_log_format,\n hash::sha256_to_field,\n traits::{Deserialize, Serialize, ToField},\n};\n\nglobal PARTIAL_NOTE_PRIVATE_LOG_CONTENT_NON_NOTE_FIELDS_LEN: u32 = 2;\n\n/// Partial notes have a maximum packed length of their private fields bound by extra content in their private log (e.g.\n/// the storage slot, note completion log tag, etc.).\npub global MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN: u32 =\n MAX_LOG_CONTENT_LEN - PARTIAL_NOTE_PRIVATE_LOG_CONTENT_NON_NOTE_FIELDS_LEN;\n\n/// The slot in the PXE capsules where we store a `CapsuleArray` of `DeliveredPendingPartialNote`.\npub 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/// Public logs contain an extra field at the beginning with the address of the contract that emitted them, and partial\n/// notes emit their completion tag in the log, resulting in the first two fields in the public log not being part of\n/// the packed public content.\n// TODO(#10273): improve how contract log siloing is handled\npub global NON_PACKED_CONTENT_FIELDS_IN_PUBLIC_LOG: u32 = 2;\n\n/// The maximum length of the packed representation of public fields in a partial note. This is limited by public log\n/// size and extra fields in the log (e.g. the tag).\npub global MAX_PUBLIC_PARTIAL_NOTE_PACKED_CONTENT_LENGTH: u32 =\n PUBLIC_LOG_DATA_SIZE_IN_FIELDS - NON_PACKED_CONTENT_FIELDS_IN_PUBLIC_LOG;\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) note_completion_log_tag: Field,\n pub(crate) storage_slot: 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 unconstrained fn process_partial_note_private_log(\n contract_address: AztecAddress,\n recipient: AztecAddress,\n log_metadata: u64,\n log_content: BoundedVec<Field, MAX_LOG_CONTENT_LEN>,\n) {\n let (note_type_id, storage_slot, note_completion_log_tag, packed_private_note_content) =\n decode_partial_note_private_log(log_metadata, log_content);\n\n // We store the information of the partial note we found in a persistent capsule in PXE, so that we can later search\n // for the public log that will complete it.\n let pending = DeliveredPendingPartialNote {\n note_completion_log_tag,\n storage_slot,\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}\n\n/// Searches for public logs that would result in the completion of pending partial notes, ultimately resulting in the\n/// notes being delivered to PXE if completed.\npub unconstrained fn fetch_and_process_public_partial_note_completion_logs<Env>(\n contract_address: AztecAddress,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n) {\n let pending_partial_notes = CapsuleArray::at(\n contract_address,\n DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT,\n );\n\n debug_log_format(\n \"{} pending partial notes\",\n [pending_partial_notes.len() as Field],\n );\n\n let mut i = 0;\n while i < pending_partial_notes.len() {\n let pending_partial_note: DeliveredPendingPartialNote = pending_partial_notes.get(i);\n\n let maybe_log = get_log_by_tag(pending_partial_note.note_completion_log_tag);\n if maybe_log.is_none() {\n debug_log_format(\n \"Found no completion logs for partial note with tag {}\",\n [pending_partial_note.note_completion_log_tag],\n );\n i += 1 as u32;\n // Note that we're not removing the pending partial note from the PXE DB, so we will continue searching\n // for this tagged log when performing message discovery in the future until we either find it or the\n // entry is somehow removed from the PXE DB.\n } else {\n debug_log_format(\n \"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 // Public logs have an extra field at the beginning with the contract address, which we use to verify\n // that we're getting the logs from the expected contract.\n // TODO(#10273): improve how contract log siloing is handled\n assert_eq(\n log.log_content.get(0),\n contract_address.to_field(),\n \"Got a public log emitted by a different contract\",\n );\n\n // Public fields are assumed to all be placed at the end of the packed representation, so we combine the\n // private and public packed fields (i.e. the contents of the log sans the extra fields) to get the\n // complete packed content.\n let packed_public_note_content: BoundedVec<_, MAX_PUBLIC_PARTIAL_NOTE_PACKED_CONTENT_LENGTH> =\n array::subbvec(log.log_content, NON_PACKED_CONTENT_FIELDS_IN_PUBLIC_LOG);\n let complete_packed_note = array::append(\n pending_partial_note.packed_private_note_content,\n packed_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_and_nullifier,\n contract_address,\n pending_partial_note.storage_slot,\n pending_partial_note.note_type_id,\n complete_packed_note,\n );\n\n debug_log_format(\n \"Discovered {0} notes for partial note with tag {1}\",\n [discovered_notes.len() as Field, pending_partial_note.note_completion_log_tag],\n );\n\n array::for_each_in_bounded_vec(\n discovered_notes,\n |discovered_note: DiscoveredNoteInfo, _| {\n // TODO:(#10728): decide how to handle notes that fail delivery. This could be due to e.g. a\n // temporary node connectivity issue - is simply throwing good enough here?\n assert(\n deliver_note(\n contract_address,\n pending_partial_note.storage_slot,\n discovered_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 \"Failed to deliver note\",\n );\n },\n );\n\n // Because there is only a single log for a given tag, once we've processed the tagged log then we\n // simply delete the pending work entry, regardless of whether it was actually completed or not.\n // TODO(#11627): only remove the pending entry if we actually process a log that results in the note\n // being completed.\n pending_partial_notes.remove(i);\n\n // We don't increment `i` here, because CapsuleArray is contiguous and its `remove(...)` function\n // shifts the elements to the left if the removed element is not the last element.\n }\n }\n}\n\nfn decode_partial_note_private_log(\n log_metadata: u64,\n log_content: BoundedVec<Field, MAX_LOG_CONTENT_LEN>,\n) -> (Field, Field, Field, BoundedVec<Field, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN>) {\n let note_type_id = log_metadata as Field; // TODO: make note type id not be a full field\n\n assert(\n log_content.len() > PARTIAL_NOTE_PRIVATE_LOG_CONTENT_NON_NOTE_FIELDS_LEN,\n f\"Invalid private note log: all partial note private logs must have at least {PARTIAL_NOTE_PRIVATE_LOG_CONTENT_NON_NOTE_FIELDS_LEN} fields\",\n );\n\n // If PARTIAL_NOTE_PRIVATE_LOG_CONTENT_NON_NOTE_FIELDS_LEN is changed, causing the assertion below to fail, then the\n // destructuring of the partial note private log encoding below must be updated as well.\n std::static_assert(\n PARTIAL_NOTE_PRIVATE_LOG_CONTENT_NON_NOTE_FIELDS_LEN == 2,\n \"unexpected value for PARTIAL_NOTE_PRIVATE_LOG_CONTENT_NON_NOTE_FIELDS_LEN\",\n );\n\n // We currently have two fields that are not the partial note's packed representation, which are the storage slot\n // and the note completion log tag.\n let storage_slot = log_content.get(0);\n let note_completion_log_tag = log_content.get(1);\n\n let packed_private_note_content = array::subbvec(log_content, 2);\n\n (note_type_id, storage_slot, note_completion_log_tag, packed_private_note_content)\n}\n"
3069
- },
3070
- "72": {
3071
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/discovery/private_logs.nr",
3072
- "source": "use crate::{\n capsules::CapsuleArray,\n discovery::{\n ComputeNoteHashAndNullifier,\n MAX_LOG_CONTENT_LEN,\n partial_notes::process_partial_note_private_log,\n pending_tagged_log::{PENDING_TAGGED_LOG_ARRAY_BASE_SLOT, PendingTaggedLog},\n PRIVATE_LOG_EXPANDED_METADATA_LEN,\n private_notes::process_private_note_log,\n },\n encrypted_logs::{\n log_assembly_strategies::default_aes128::aes128::AES128,\n log_encryption::LogEncryption,\n log_type::{\n PARTIAL_NOTE_PRIVATE_LOG_TYPE_ID, PRIVATE_EVENT_LOG_TYPE_ID, PRIVATE_NOTE_LOG_TYPE_ID,\n },\n metadata_packing::from_expanded_metadata,\n },\n oracle::{logs::store_private_event_log, message_discovery::sync_notes},\n utils::array,\n};\n\nuse protocol_types::{\n abis::event_selector::EventSelector,\n address::AztecAddress,\n debug_log::{debug_log, debug_log_format},\n traits::FromField,\n};\n\n// TODO(#12750): don't make these values assume we're using AES.\nuse crate::encrypted_logs::log_encryption::PRIVATE_LOG_PLAINTEXT_SIZE_IN_FIELDS;\n\n/// Searches for private logs that signal new private notes that are then delivered to PXE, or new partial notes that\n/// are stored in the PXE capsules so that `fetch_and_process_public_partial_note_completion_logs` can later search for\n/// public logs that will complete them.\npub unconstrained fn fetch_and_process_private_tagged_logs<Env>(\n contract_address: AztecAddress,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n) {\n // We will eventually perform log discovery via tagging here, but for now we simply call the `syncNotes` oracle.\n // This makes PXE synchronize tags, download logs and store the pending tagged logs in capsule array which are then\n // retrieved and processed here.\n sync_notes(PENDING_TAGGED_LOG_ARRAY_BASE_SLOT);\n\n // Get logs from capsules\n let logs =\n CapsuleArray::<PendingTaggedLog>::at(contract_address, PENDING_TAGGED_LOG_ARRAY_BASE_SLOT);\n let len = logs.len();\n\n // We iterate over the logs in reverse order to avoid shifting elements.\n let mut i = len;\n while i > 0 {\n i -= 1;\n\n // Get and process each log\n let log = logs.get(i);\n process_log(contract_address, compute_note_hash_and_nullifier, log);\n\n // Remove the log from the capsule array\n logs.remove(i);\n }\n}\n\n/// Processes a log's ciphertext by decrypting it and then searching the plaintext for private notes or partial notes.\n///\n/// Private notes result in nonce discovery being performed prior to delivery, which requires knowledge of the\n/// transaction hash in which the notes would've been created (typically the same transaction in which the log was\n/// emitted), along with the list of unique note hashes in said transaction and the `compute_note_hash_and_nullifier`\n/// function.\n///\n/// Partial notes result in a pending partial note entry being stored in a PXE capsule, which will later be retrieved to\n/// search for the note's completion public log.\nunconstrained fn process_log<Env>(\n contract_address: AztecAddress,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n pending_tagged_log: PendingTaggedLog,\n) {\n debug_log_format(\n \"Processing log with tag {0}\",\n [pending_tagged_log.log.get(0)],\n );\n\n // The tag is ignored for now.\n let ciphertext = array::subbvec(pending_tagged_log.log, 1);\n\n let log_plaintext = AES128::decrypt_log(ciphertext, pending_tagged_log.recipient);\n\n // The first thing to do after decrypting the log is to determine what type of private log we're processing. We\n // have 3 log types: private note logs, partial note logs and event logs.\n\n let (log_type_id, log_metadata, log_content) = decode_log_plaintext(log_plaintext);\n\n if log_type_id == PRIVATE_NOTE_LOG_TYPE_ID {\n debug_log(\"Processing private note log\");\n\n process_private_note_log(\n contract_address,\n pending_tagged_log.tx_hash,\n pending_tagged_log.unique_note_hashes_in_tx,\n pending_tagged_log.first_nullifier_in_tx,\n pending_tagged_log.recipient,\n compute_note_hash_and_nullifier,\n log_metadata,\n log_content,\n );\n } else if log_type_id == PARTIAL_NOTE_PRIVATE_LOG_TYPE_ID {\n debug_log(\"Processing partial note private log\");\n\n process_partial_note_private_log(\n contract_address,\n pending_tagged_log.recipient,\n log_metadata,\n log_content,\n );\n } else if log_type_id == PRIVATE_EVENT_LOG_TYPE_ID {\n debug_log(\"Processing private event log\");\n\n // In the case of event logs, the log metadata is the event selector.\n let event_selector = EventSelector::from_field(log_metadata as Field);\n\n store_private_event_log(\n contract_address,\n pending_tagged_log.recipient,\n event_selector,\n log_content,\n pending_tagged_log.tx_hash,\n pending_tagged_log.log_index_in_tx,\n );\n } else {\n debug_log_format(\n \"Unknown log type id {0} (probably belonging to an event log)\",\n [log_type_id as Field],\n );\n }\n}\n\n/// Decodes a log's plaintext following aztec-nr's standard log encoding.\n///\n/// The standard private log layout is composed of:\n/// - an initial field called the 'expanded metadata'\n/// - an arbitrary number of fields following that called the 'log content'\n///\n/// ```\n/// log_plaintext: [ log_expanded_metadata, ...log_content ]\n/// ```\n///\n/// The expanded metadata itself is (currently) interpreted as a u128, of which:\n/// - the upper 64 bits are the log type id\n/// - the lower 64 bits are called the 'log metadata'\n///\n/// ```\n/// log_expanded_metadata: [ log_type_id | log_metadata ]\n/// <--- 64 bits --->|<--- 64 bits --->\n/// ```\n///\n/// The meaning of the log metadata and log content depend on the value of the log type id. Note that there is\n/// nothing special about the log metadata, it _can_ be considered part of the content. It just has a different name\n/// to make it distinct from the log content given that it is not a full field.\nunconstrained fn decode_log_plaintext(\n log_plaintext: BoundedVec<Field, PRIVATE_LOG_PLAINTEXT_SIZE_IN_FIELDS>,\n) -> (u64, u64, BoundedVec<Field, MAX_LOG_CONTENT_LEN>) {\n assert(\n log_plaintext.len() >= PRIVATE_LOG_EXPANDED_METADATA_LEN,\n f\"Invalid log plaintext: all logs must be decrypted into at least {PRIVATE_LOG_EXPANDED_METADATA_LEN} fields\",\n );\n\n // If PRIVATE_LOG_EXPANDED_METADATA_LEN is changed, causing the assertion below to fail, then the destructuring of\n // the log encoding below must be updated as well.\n std::static_assert(\n PRIVATE_LOG_EXPANDED_METADATA_LEN == 1,\n \"unexpected value for PRIVATE_LOG_EXPANDED_METADATA_LEN\",\n );\n\n // See the documentation of this function for a description of the log layout\n let expanded_log_metadata = log_plaintext.get(0);\n let (log_metadata, log_type_id) = from_expanded_metadata(expanded_log_metadata);\n let log_content = array::subbvec(log_plaintext, PRIVATE_LOG_EXPANDED_METADATA_LEN);\n\n (log_type_id, log_metadata, log_content)\n}\n"
3073
- },
3074
- "73": {
3075
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/discovery/private_notes.nr",
3076
- "source": "use crate::{\n discovery::{\n ComputeNoteHashAndNullifier,\n MAX_LOG_CONTENT_LEN,\n nonce_discovery::{attempt_note_nonce_discovery, DiscoveredNoteInfo},\n },\n oracle,\n utils::array,\n};\nuse protocol_types::{\n address::AztecAddress, constants::MAX_NOTE_HASHES_PER_TX, debug_log::debug_log_format,\n};\n\n/// The number of fields in a private note log content that are not the note's packed representation.\nglobal PRIVATE_NOTE_LOG_CONTENT_NON_NOTE_FIELDS_LEN: u32 = 1;\n\n/// The maximum length of the packed representation of a note's contents. This is limited by private log size,\n/// encryption overhead and extra fields in the log (e.g. log type id, storage slot, etc.).\npub global MAX_NOTE_PACKED_LEN: u32 =\n MAX_LOG_CONTENT_LEN - PRIVATE_NOTE_LOG_CONTENT_NON_NOTE_FIELDS_LEN;\n\npub unconstrained fn process_private_note_log<Env>(\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_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n log_metadata: u64,\n log_content: BoundedVec<Field, MAX_LOG_CONTENT_LEN>,\n) {\n let (note_type_id, storage_slot, packed_note) =\n decode_private_note_log(log_metadata, log_content);\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_and_nullifier,\n storage_slot,\n note_type_id,\n packed_note,\n );\n}\n\n/// Attempts discovery of a note given information about its contents and the transaction in which it is\n/// suspected the note was created.\npub unconstrained fn attempt_note_discovery<Env>(\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_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n storage_slot: 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_and_nullifier,\n contract_address,\n storage_slot,\n note_type_id,\n packed_note,\n );\n\n debug_log_format(\n \"Discovered {0} notes from a private log\",\n [discovered_notes.len() as Field],\n );\n\n array::for_each_in_bounded_vec(\n discovered_notes,\n |discovered_note: DiscoveredNoteInfo, _| {\n // TODO:(#10728): handle notes that fail delivery. This could be due to e.g. a temporary node connectivity\n // issue, and we should perhaps not have marked the tag index as taken.\n assert(\n oracle::message_discovery::deliver_note(\n contract_address,\n storage_slot,\n discovered_note.nonce,\n packed_note,\n discovered_note.note_hash,\n discovered_note.inner_nullifier,\n tx_hash,\n recipient,\n ),\n \"Failed to deliver note\",\n );\n },\n );\n}\n\nfn decode_private_note_log(\n log_metadata: u64,\n log_content: BoundedVec<Field, MAX_LOG_CONTENT_LEN>,\n) -> (Field, Field, BoundedVec<Field, MAX_NOTE_PACKED_LEN>) {\n let note_type_id = log_metadata as Field; // TODO: make note type id not be a full field\n\n assert(\n log_content.len() > PRIVATE_NOTE_LOG_CONTENT_NON_NOTE_FIELDS_LEN,\n f\"Invalid private note log: all private note logs must have at least {PRIVATE_NOTE_LOG_CONTENT_NON_NOTE_FIELDS_LEN} fields\",\n );\n\n // If PRIVATE_NOTE_LOG_CONTENT_NON_NOTE_FIELDS_LEN is changed, causing the assertion below to fail, then the destructuring of\n // the private note log encoding below must be updated as well.\n std::static_assert(\n PRIVATE_NOTE_LOG_CONTENT_NON_NOTE_FIELDS_LEN == 1,\n \"unexpected value for PRIVATE_NOTE_LOG_CONTENT_NON_NOTE_FIELDS_LEN\",\n );\n\n // We currently have a single field that is not the note's packed representation, which is the storage slot.\n let storage_slot = log_content.get(0);\n let packed_note = array::subbvec(log_content, PRIVATE_NOTE_LOG_CONTENT_NON_NOTE_FIELDS_LEN);\n\n (note_type_id, storage_slot, packed_note)\n}\n"
2822
+ "66": {
2823
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/hash.nr",
2824
+ "source": "use dep::protocol_types::{\n address::{AztecAddress, EthAddress},\n constants::{\n GENERATOR_INDEX__FUNCTION_ARGS, GENERATOR_INDEX__MESSAGE_NULLIFIER,\n GENERATOR_INDEX__PUBLIC_CALLDATA, GENERATOR_INDEX__SECRET_HASH,\n },\n hash::{poseidon2_hash_with_separator, poseidon2_hash_with_separator_slice, sha256_to_field},\n point::Point,\n traits::{Hash, ToField},\n};\n\npub use dep::protocol_types::hash::{compute_siloed_nullifier, pedersen_hash};\n\npub fn pedersen_commitment<let N: u32>(inputs: [Field; N], hash_index: u32) -> Point {\n std::hash::pedersen_commitment_with_separator(inputs, hash_index)\n}\n\npub fn compute_secret_hash(secret: Field) -> Field {\n poseidon2_hash_with_separator([secret], GENERATOR_INDEX__SECRET_HASH)\n}\n\npub fn compute_l1_to_l2_message_hash(\n sender: EthAddress,\n chain_id: Field,\n recipient: AztecAddress,\n version: Field,\n content: Field,\n secret_hash: Field,\n leaf_index: Field,\n) -> Field {\n let mut hash_bytes = [0 as u8; 224];\n let sender_bytes: [u8; 32] = sender.to_field().to_be_bytes();\n let chain_id_bytes: [u8; 32] = chain_id.to_be_bytes();\n let recipient_bytes: [u8; 32] = recipient.to_field().to_be_bytes();\n let version_bytes: [u8; 32] = version.to_be_bytes();\n let content_bytes: [u8; 32] = content.to_be_bytes();\n let secret_hash_bytes: [u8; 32] = secret_hash.to_be_bytes();\n let leaf_index_bytes: [u8; 32] = leaf_index.to_be_bytes();\n\n for i in 0..32 {\n hash_bytes[i] = sender_bytes[i];\n hash_bytes[i + 32] = chain_id_bytes[i];\n hash_bytes[i + 64] = recipient_bytes[i];\n hash_bytes[i + 96] = version_bytes[i];\n hash_bytes[i + 128] = content_bytes[i];\n hash_bytes[i + 160] = secret_hash_bytes[i];\n hash_bytes[i + 192] = leaf_index_bytes[i];\n }\n\n sha256_to_field(hash_bytes)\n}\n\n// The nullifier of a l1 to l2 message is the hash of the message salted with the secret\npub fn compute_l1_to_l2_message_nullifier(message_hash: Field, secret: Field) -> Field {\n poseidon2_hash_with_separator([message_hash, secret], GENERATOR_INDEX__MESSAGE_NULLIFIER)\n}\n\npub struct ArgsHasher {\n pub fields: [Field],\n}\n\nimpl Hash for ArgsHasher {\n fn hash(self) -> Field {\n hash_args(self.fields)\n }\n}\n\nimpl ArgsHasher {\n pub fn new() -> Self {\n Self { fields: [] }\n }\n\n pub fn add(&mut self, field: Field) {\n self.fields = self.fields.push_back(field);\n }\n\n pub fn add_multiple<let N: u32>(&mut self, fields: [Field; N]) {\n for i in 0..N {\n self.fields = self.fields.push_back(fields[i]);\n }\n }\n}\n\n// Computes the hash of input arguments or return values for private functions, or for authwit creation.\npub fn hash_args_array<let N: u32>(args: [Field; N]) -> Field {\n if args.len() == 0 {\n 0\n } else {\n poseidon2_hash_with_separator(args, GENERATOR_INDEX__FUNCTION_ARGS)\n }\n}\n\n// Same as `hash_args_array`, but takes a slice instead of an array.\npub fn hash_args(args: [Field]) -> Field {\n if args.len() == 0 {\n 0\n } else {\n poseidon2_hash_with_separator_slice(args, GENERATOR_INDEX__FUNCTION_ARGS)\n }\n}\n\n// Computes the hash of calldata for public functions.\npub fn hash_calldata_array<let N: u32>(calldata: [Field; N]) -> Field {\n if calldata.len() == 0 {\n 0\n } else {\n poseidon2_hash_with_separator(calldata, GENERATOR_INDEX__PUBLIC_CALLDATA)\n }\n}\n\n// Same as `hash_calldata_array`, but takes a slice instead of an array.\npub fn hash_calldata(calldata: [Field]) -> Field {\n if calldata.len() == 0 {\n 0\n } else {\n poseidon2_hash_with_separator_slice(calldata, GENERATOR_INDEX__PUBLIC_CALLDATA)\n }\n}\n\n#[test]\nunconstrained fn compute_var_args_hash() {\n let mut input = ArgsHasher::new();\n for i in 0..100 {\n input.add(i as Field);\n }\n let hash = input.hash();\n dep::std::println(hash);\n assert(hash == 0x19b0d74feb06ebde19edd85a28986c97063e84b3b351a8b666c7cac963ce655f);\n}\n"
3077
2825
  },
3078
- "74": {
3079
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/encrypted_logs/encrypt/aes128.nr",
3080
- "source": "use dep::protocol_types::{\n constants::{GENERATOR_INDEX__SYMMETRIC_KEY, GENERATOR_INDEX__SYMMETRIC_KEY_2},\n hash::poseidon2_hash_with_separator,\n point::Point,\n};\n\nuse crate::utils::point::point_to_bytes;\n\nfn extract_close_to_uniformly_random_256_bits_from_ecdh_shared_secret_using_poseidon2(\n shared_secret: Point,\n) -> [u8; 32] {\n let rand1: Field = poseidon2_hash_with_separator(\n [shared_secret.x, shared_secret.y],\n GENERATOR_INDEX__SYMMETRIC_KEY,\n );\n let rand2: Field = poseidon2_hash_with_separator(\n [shared_secret.x, shared_secret.y],\n GENERATOR_INDEX__SYMMETRIC_KEY_2,\n );\n let rand1_bytes: [u8; 16] = rand1.to_le_bytes();\n let rand2_bytes: [u8; 16] = rand2.to_le_bytes();\n let mut bytes: [u8; 32] = [0; 32];\n for i in 0..16 {\n bytes[i] = rand1_bytes[i];\n bytes[i + 1] = rand2_bytes[i];\n }\n bytes\n}\n\n// TODO(#10537): Consider nuking this function.\nfn extract_close_to_uniformly_random_256_bits_from_ecdh_shared_secret_using_sha256(\n shared_secret: Point,\n) -> [u8; 32] {\n let shared_secret_bytes: [u8; 32] = point_to_bytes(shared_secret);\n\n let mut shared_secret_bytes_with_separator: [u8; 33] = std::mem::zeroed();\n for i in 0..shared_secret_bytes.len() {\n shared_secret_bytes_with_separator[i] = shared_secret_bytes[i];\n }\n shared_secret_bytes_with_separator[32] = GENERATOR_INDEX__SYMMETRIC_KEY;\n\n sha256::digest(shared_secret_bytes_with_separator)\n}\n\nfn derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret(\n shared_secret: Point,\n randomness_extraction_fn: fn(Point) -> [u8; 32],\n) -> ([u8; 16], [u8; 16]) {\n let random_256_bits = randomness_extraction_fn(shared_secret);\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 (sym_key, iv)\n}\n\n// TODO(#10537): Consider nuking this function.\npub fn derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_sha256(\n shared_secret: Point,\n) -> ([u8; 16], [u8; 16]) {\n derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret(\n shared_secret,\n extract_close_to_uniformly_random_256_bits_from_ecdh_shared_secret_using_sha256,\n )\n}\n\n// TODO(#10537): This function is currently unused. Consider using it instead of the sha256 one.\npub fn derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_poseidon2(\n shared_secret: Point,\n) -> ([u8; 16], [u8; 16]) {\n derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret(\n shared_secret,\n extract_close_to_uniformly_random_256_bits_from_ecdh_shared_secret_using_poseidon2,\n )\n}\n"
2826
+ "88": {
2827
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/dispatch.nr",
2828
+ "source": "use super::utils::compute_fn_selector;\nuse std::panic;\n\n/// Returns an `fn public_dispatch(...)` function for the given module that's assumed to be an Aztec contract.\npub comptime fn generate_public_dispatch(m: Module) -> Quoted {\n let functions = m.functions();\n let functions =\n functions.filter(|function: FunctionDefinition| function.has_named_attribute(\"public\"));\n\n let unit = get_type::<()>();\n\n let ifs = functions.map(|function: FunctionDefinition| {\n let parameters = function.parameters();\n let return_type = function.return_type();\n\n let selector: Field = compute_fn_selector(function);\n\n let mut parameters_size = 0;\n for param in parameters {\n parameters_size += size_in_fields(param.1);\n }\n\n let initial_read = if parameters.len() == 0 {\n quote {}\n } else {\n // The initial calldata_copy offset is 1 to skip the Field selector\n // The expected calldata is the serialization of\n // - FunctionSelector: the selector of the function intended to dispatch\n // - Parameters: the parameters of the function intended to dispatch\n // That is, exactly what is expected for a call to the target function,\n // but with a selector added at the beginning.\n quote {\n let input_calldata: [Field; $parameters_size] = dep::aztec::context::public_context::calldata_copy(1, $parameters_size);\n let mut reader = dep::aztec::protocol_types::utils::reader::Reader::new(input_calldata);\n }\n };\n\n let parameter_index = &mut 0;\n let reads = parameters.map(|param: (Quoted, Type)| {\n let parameter_index_value = *parameter_index;\n let param_name = f\"arg{parameter_index_value}\".quoted_contents();\n let param_type = param.1;\n let read = quote {\n let $param_name: $param_type = reader.read_struct(dep::aztec::protocol_types::traits::Deserialize::deserialize);\n };\n *parameter_index += 1;\n quote { $read }\n });\n let read = reads.join(quote { });\n\n let mut args = &[];\n for parameter_index in 0..parameters.len() {\n let param_name = f\"arg{parameter_index}\".quoted_contents();\n args = args.push_back(quote { $param_name });\n }\n\n let args = args.join(quote { , });\n // name of the function is assigned just before the call so debug metadata doesn't span most of this macro when figuring out where the call comes from.\n let name = function.name();\n let call = quote { $name($args) };\n\n let return_code = if return_type == unit {\n quote {\n $call;\n // Force early return.\n dep::aztec::context::public_context::avm_return([]);\n }\n } else {\n quote {\n let return_value = dep::aztec::protocol_types::traits::Serialize::serialize($call);\n dep::aztec::context::public_context::avm_return(return_value.as_slice());\n }\n };\n\n let if_ = quote {\n if selector == $selector {\n $initial_read\n $read\n $return_code\n }\n };\n if_\n });\n\n if ifs.len() == 0 {\n // No dispatch function if there are no public functions\n quote {}\n } else {\n let ifs = ifs.push_back(quote { panic(f\"Unknown selector {selector}\") });\n let dispatch = ifs.join(quote { });\n\n let body = quote {\n // We mark this as public because our whole system depends on public\n // functions having this attribute. However, the public MACRO will\n // handle the public_dispatch function specially and do nothing.\n #[public]\n pub unconstrained fn public_dispatch(selector: Field) {\n $dispatch\n }\n };\n\n body\n }\n}\n\ncomptime fn size_in_fields(typ: Type) -> u32 {\n let size = array_size_in_fields(typ);\n let size = size.or_else(|| bool_size_in_fields(typ));\n let size = size.or_else(|| constant_size_in_fields(typ));\n let size = size.or_else(|| field_size_in_fields(typ));\n let size = size.or_else(|| int_size_in_fields(typ));\n let size = size.or_else(|| str_size_in_fields(typ));\n let size = size.or_else(|| struct_size_in_fields(typ));\n let size = size.or_else(|| tuple_size_in_fields(typ));\n if size.is_some() {\n size.unwrap()\n } else {\n panic(f\"Can't determine size in fields of {typ}\")\n }\n}\n\ncomptime fn array_size_in_fields(typ: Type) -> Option<u32> {\n typ.as_array().and_then(|typ: (Type, Type)| {\n let (typ, element_size) = typ;\n element_size.as_constant().map(|x: u32| x * size_in_fields(typ))\n })\n}\n\ncomptime fn bool_size_in_fields(typ: Type) -> Option<u32> {\n if typ.is_bool() {\n Option::some(1)\n } else {\n Option::none()\n }\n}\n\ncomptime fn field_size_in_fields(typ: Type) -> Option<u32> {\n if typ.is_field() {\n Option::some(1)\n } else {\n Option::none()\n }\n}\n\ncomptime fn int_size_in_fields(typ: Type) -> Option<u32> {\n if typ.as_integer().is_some() {\n Option::some(1)\n } else {\n Option::none()\n }\n}\n\ncomptime fn constant_size_in_fields(typ: Type) -> Option<u32> {\n typ.as_constant()\n}\n\ncomptime fn str_size_in_fields(typ: Type) -> Option<u32> {\n typ.as_str().map(|typ| size_in_fields(typ))\n}\n\ncomptime fn struct_size_in_fields(typ: Type) -> Option<u32> {\n typ.as_data_type().map(|typ: (TypeDefinition, [Type])| {\n let struct_type = typ.0;\n let generics = typ.1;\n let mut size = 0;\n for field in struct_type.fields(generics) {\n size += size_in_fields(field.1);\n }\n size\n })\n}\n\ncomptime fn tuple_size_in_fields(typ: Type) -> Option<u32> {\n typ.as_tuple().map(|types: [Type]| {\n let mut size = 0;\n for typ in types {\n size += size_in_fields(typ);\n }\n size\n })\n}\n\ncomptime fn get_type<T>() -> Type {\n let t: T = std::mem::zeroed();\n std::meta::type_of(t)\n}\n"
3081
2829
  },
3082
- "77": {
3083
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/encrypted_logs/log_assembly_strategies/default_aes128/aes128.nr",
3084
- "source": "use crate::{\n encrypted_logs::{\n encrypt::aes128::derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_sha256,\n log_assembly_strategies::default_aes128::arithmetic_generics_utils::{\n get_arr_of_size__log_bytes__from_PT, get_arr_of_size__log_bytes_padding__from_PT,\n },\n log_encryption::{\n EPH_PK_SIGN_BYTE_SIZE_IN_BYTES, EPH_PK_X_SIZE_IN_FIELDS,\n HEADER_CIPHERTEXT_SIZE_IN_BYTES, LogEncryption, PRIVATE_LOG_CIPHERTEXT_LEN,\n PRIVATE_LOG_PLAINTEXT_SIZE_IN_FIELDS,\n },\n },\n keys::{\n ecdh_shared_secret::derive_ecdh_shared_secret_using_aztec_address,\n ephemeral::generate_ephemeral_key_pair,\n },\n oracle::{aes128_decrypt::aes128_decrypt_oracle, shared_secret::get_shared_secret},\n prelude::AztecAddress,\n utils::{\n array,\n conversion::{\n bytes_to_fields::{bytes_from_fields, bytes_to_fields},\n fields_to_bytes::{fields_from_bytes, fields_to_bytes},\n },\n point::{get_sign_of_point, point_from_x_coord_and_sign},\n random::get_random_bytes,\n },\n};\nuse std::aes128::aes128_encrypt;\n\npub struct AES128 {}\n\nimpl LogEncryption for AES128 {\n fn encrypt_log<let PLAINTEXT_LEN: u32>(\n plaintext: [Field; PLAINTEXT_LEN],\n recipient: AztecAddress,\n ) -> [Field; PRIVATE_LOG_CIPHERTEXT_LEN] {\n // AES 128 operates on bytes, not fields, so we need to convert the fields to bytes.\n // (This process is then reversed when processing the log in `do_process_log`)\n let plaintext_bytes = fields_to_bytes(plaintext);\n\n // *****************************************************************************\n // Compute the shared secret\n // *****************************************************************************\n\n let (eph_sk, eph_pk) = generate_ephemeral_key_pair();\n\n let eph_pk_sign_byte: u8 = get_sign_of_point(eph_pk) as u8;\n\n // (not to be confused with the tagging shared secret)\n let ciphertext_shared_secret =\n derive_ecdh_shared_secret_using_aztec_address(eph_sk, recipient);\n\n // TODO: also use this shared secret for deriving note randomness.\n\n // *****************************************************************************\n // Convert the plaintext into whatever format the encryption function expects\n // *****************************************************************************\n\n // Already done for this strategy: AES expects bytes.\n\n // *****************************************************************************\n // Encrypt the plaintext\n // *****************************************************************************\n\n let (sym_key, iv) = derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_sha256(\n ciphertext_shared_secret,\n );\n\n let ciphertext_bytes = aes128_encrypt(plaintext_bytes, iv, sym_key);\n\n // |full_pt| = |pt_length| + |pt|\n // |pt_aes_padding| = 16 - (|full_pt| % 16)\n // or... since a % b is the same as a - b * (a // b) (integer division), so:\n // |pt_aes_padding| = 16 - (|full_pt| - 16 * (|full_pt| // 16))\n // |ct| = |full_pt| + |pt_aes_padding|\n // = |full_pt| + 16 - (|full_pt| - 16 * (|full_pt| // 16))\n // = 16 + 16 * (|full_pt| // 16)\n // = 16 * (1 + |full_pt| // 16)\n assert(ciphertext_bytes.len() == 16 * (1 + (PLAINTEXT_LEN * 32) / 16));\n\n // *****************************************************************************\n // Compute the header ciphertext\n // *****************************************************************************\n\n // Header contains only the length of the ciphertext stored in 2 bytes.\n // TODO: consider nuking the header altogether and just have a fixed-size ciphertext by padding the plaintext.\n // This would be more costly constraint-wise but cheaper DA-wise.\n let mut header_plaintext: [u8; 2] = [0 as u8; 2];\n let ciphertext_bytes_length = ciphertext_bytes.len();\n header_plaintext[0] = (ciphertext_bytes_length >> 8) as u8;\n header_plaintext[1] = ciphertext_bytes_length as u8;\n\n // TODO: this is insecure and wasteful:\n // \"Insecure\", because the esk shouldn't be used twice (once for the header,\n // and again for the proper ciphertext) (at least, I never got the\n // \"go ahead\" that this would be safe, unfortunately).\n // \"Wasteful\", because the exact same computation is happening further down.\n // I'm leaving that 2nd computation where it is, because this 1st computation\n // will be imminently deleted, when the header logic is deleted.\n let (sym_key, iv) = derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_sha256(\n ciphertext_shared_secret,\n );\n\n // Note: the aes128_encrypt builtin fn automatically appends bytes to the\n // input, according to pkcs#7; hence why the output `header_ciphertext_bytes` is 16\n // bytes larger than the input in this case.\n let header_ciphertext_bytes = aes128_encrypt(header_plaintext, iv, sym_key);\n // I recall that converting a slice to an array incurs constraints, so I'll check the length this way instead:\n assert(header_ciphertext_bytes.len() == HEADER_CIPHERTEXT_SIZE_IN_BYTES);\n\n // *****************************************************************************\n // Prepend / append more bytes of data to the ciphertext, before converting back\n // to fields.\n // *****************************************************************************\n\n let mut log_bytes_padding_to_mult_31 =\n get_arr_of_size__log_bytes_padding__from_PT::<PLAINTEXT_LEN * 32>();\n // Safety: this randomness won't be constrained to be random. It's in the\n // interest of the executor of this fn to encrypt with random bytes.\n log_bytes_padding_to_mult_31 = unsafe { get_random_bytes() };\n\n let mut log_bytes = get_arr_of_size__log_bytes__from_PT::<PLAINTEXT_LEN * 32>();\n\n assert(\n log_bytes.len() % 31 == 0,\n \"Unexpected error: log_bytes.len() should be divisible by 31, by construction.\",\n );\n\n log_bytes[0] = eph_pk_sign_byte;\n let mut offset = 1;\n for i in 0..header_ciphertext_bytes.len() {\n log_bytes[offset + i] = header_ciphertext_bytes[i];\n }\n offset += header_ciphertext_bytes.len();\n\n for i in 0..ciphertext_bytes.len() {\n log_bytes[offset + i] = ciphertext_bytes[i];\n }\n offset += ciphertext_bytes.len();\n\n for i in 0..log_bytes_padding_to_mult_31.len() {\n log_bytes[offset + i] = log_bytes_padding_to_mult_31[i];\n }\n\n assert(\n offset + log_bytes_padding_to_mult_31.len() == log_bytes.len(),\n \"Something has gone wrong\",\n );\n\n // *****************************************************************************\n // Convert bytes back to fields\n // *****************************************************************************\n\n // TODO(#12749): As Mike pointed out, we need to make logs produced by different encryption schemes\n // indistinguishable from each other and for this reason the output here and in the last for-loop of this function\n // should cover a full field.\n let log_bytes_as_fields = bytes_to_fields(log_bytes);\n\n // *****************************************************************************\n // Prepend / append fields, to create the final log\n // *****************************************************************************\n\n let mut ciphertext: [Field; PRIVATE_LOG_CIPHERTEXT_LEN] = [0; PRIVATE_LOG_CIPHERTEXT_LEN];\n\n ciphertext[0] = eph_pk.x;\n\n let mut offset = 1;\n for i in 0..log_bytes_as_fields.len() {\n ciphertext[offset + i] = log_bytes_as_fields[i];\n }\n offset += log_bytes_as_fields.len();\n\n for i in offset..PRIVATE_LOG_CIPHERTEXT_LEN {\n // We need to get a random value that fits in 31 bytes to not leak information about the size of the log\n // (all the \"real\" log fields contain at most 31 bytes because of the way we convert the bytes to fields).\n // TODO(#12749): Long term, this is not a good solution.\n\n // Safety: we assume that the sender wants for the log to be private - a malicious one could simply reveal its\n // contents publicly. It is therefore fine to trust the sender to provide random padding.\n let field_bytes = unsafe { get_random_bytes::<31>() };\n ciphertext[i] = Field::from_be_bytes::<31>(field_bytes);\n }\n\n ciphertext\n }\n\n unconstrained fn decrypt_log(\n ciphertext: BoundedVec<Field, PRIVATE_LOG_CIPHERTEXT_LEN>,\n recipient: AztecAddress,\n ) -> BoundedVec<Field, PRIVATE_LOG_PLAINTEXT_SIZE_IN_FIELDS> {\n let eph_pk_x = ciphertext.get(0);\n\n let ciphertext_without_eph_pk_x_fields = array::subbvec::<Field, PRIVATE_LOG_CIPHERTEXT_LEN, PRIVATE_LOG_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS>(\n ciphertext,\n EPH_PK_X_SIZE_IN_FIELDS,\n );\n\n // Convert the ciphertext represented as fields to a byte representation (its original format)\n let ciphertext_without_eph_pk_x = bytes_from_fields(ciphertext_without_eph_pk_x_fields);\n\n // First byte of the ciphertext represents the ephemeral public key sign\n let eph_pk_sign_bool = ciphertext_without_eph_pk_x.get(0) as bool;\n // With the sign and the x-coordinate of the ephemeral public key, we can reconstruct the point\n let eph_pk = point_from_x_coord_and_sign(eph_pk_x, eph_pk_sign_bool);\n\n // Derive shared secret and symmetric key\n let ciphertext_shared_secret = get_shared_secret(recipient, eph_pk);\n let (sym_key, iv) = derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_sha256(\n ciphertext_shared_secret,\n );\n\n // Extract the header ciphertext\n let header_start = EPH_PK_SIGN_BYTE_SIZE_IN_BYTES; // Skip eph_pk_sign byte\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 designed to work\n // with logs with unknown length at compile time. This would not be necessary here as the header ciphertext length\n // is fixed. But we do it anyway to not have to have duplicate oracles.\n let header_ciphertext_bvec =\n BoundedVec::<u8, HEADER_CIPHERTEXT_SIZE_IN_BYTES>::from_array(header_ciphertext);\n\n // Decrypt header\n let header_plaintext = aes128_decrypt_oracle(header_ciphertext_bvec, iv, sym_key);\n\n // Extract ciphertext length from header (2 bytes, big-endian)\n let ciphertext_length =\n ((header_plaintext.get(0) as u32) << 8) | (header_plaintext.get(1) as u32);\n\n // Extract and decrypt main ciphertext\n let ciphertext_start = header_start + HEADER_CIPHERTEXT_SIZE_IN_BYTES;\n let ciphertext_with_padding: [u8; (PRIVATE_LOG_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS) * 31 - HEADER_CIPHERTEXT_SIZE_IN_BYTES - EPH_PK_SIGN_BYTE_SIZE_IN_BYTES] =\n array::subarray(ciphertext_without_eph_pk_x.storage(), ciphertext_start);\n let ciphertext: BoundedVec<u8, (PRIVATE_LOG_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS) * 31 - HEADER_CIPHERTEXT_SIZE_IN_BYTES - EPH_PK_SIGN_BYTE_SIZE_IN_BYTES> =\n BoundedVec::from_parts(ciphertext_with_padding, ciphertext_length);\n\n // Decrypt main ciphertext and return it\n let plaintext_bytes = aes128_decrypt_oracle(ciphertext, iv, sym_key);\n\n // Each field of the original note log was serialized to 32 bytes so we convert the bytes back to fields.\n fields_from_bytes(plaintext_bytes)\n }\n}\n\nmod test {\n use crate::{\n encrypted_logs::log_encryption::{LogEncryption, PRIVATE_LOG_PLAINTEXT_SIZE_IN_FIELDS},\n keys::ecdh_shared_secret::derive_ecdh_shared_secret_using_aztec_address,\n test::helpers::test_environment::TestEnvironment,\n };\n use super::AES128;\n use protocol_types::{\n address::AztecAddress,\n indexed_tagging_secret::IndexedTaggingSecret,\n traits::{Deserialize, FromField},\n };\n use std::{embedded_curve_ops::EmbeddedCurveScalar, test::OracleMock};\n\n #[test]\n unconstrained fn encrypt_decrypt_log() {\n let mut env = TestEnvironment::new();\n // Advance 1 block so we can read historic state from private\n env.advance_block_by(1);\n\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(\"getRandomField\").returns(eph_sk).times(1);\n\n let randomness = 0x0101010101010101010101010101010101010101010101010101010101010101;\n let _ = OracleMock::mock(\"getRandomField\").returns(randomness).times(1000000);\n\n let _ = OracleMock::mock(\"getIndexedTaggingSecretAsSender\").returns(\n IndexedTaggingSecret::deserialize([69420, 1337]),\n );\n let _ = OracleMock::mock(\"incrementAppTaggingSecretIndexAsSender\").returns(());\n\n // Encrypt the log\n let encrypted_log = BoundedVec::from_array(AES128::encrypt_log(plaintext, recipient));\n\n // Mock shared secret for deterministic test\n let shared_secret = derive_ecdh_shared_secret_using_aztec_address(\n EmbeddedCurveScalar::from_field(eph_sk),\n recipient,\n );\n let _ = OracleMock::mock(\"getSharedSecret\").returns(shared_secret);\n\n // Decrypt the log\n let decrypted = AES128::decrypt_log(encrypted_log, recipient);\n\n // The decryption function spits out a BoundedVec because it's designed to work with logs with unknown length\n // at compile time. For this reason we need to convert the original input to a BoundedVec.\n let plaintext_bvec =\n BoundedVec::<Field, PRIVATE_LOG_PLAINTEXT_SIZE_IN_FIELDS>::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"
2830
+ "91": {
2831
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/functions/call_interface_stubs.nr",
2832
+ "source": "use crate::macros::utils::{\n add_to_field_slice, AsStrQuote, compute_fn_selector, is_fn_private, is_fn_view,\n};\nuse std::meta::{type_of, unquote};\n\ncomptime global FROM_FIELD: TypedExpr = {\n let from_field_trait = quote { protocol_types::traits::FromField }.as_trait_constraint();\n let function_selector_typ =\n quote { protocol_types::abis::function_selector::FunctionSelector }.as_type();\n function_selector_typ.get_trait_impl(from_field_trait).unwrap().methods().filter(|m| {\n m.name() == quote { from_field }\n })[0]\n .as_typed_expr()\n};\n\ncomptime global SERIALIZED_ARGS_SLICE_NAME: Quoted = quote { serialized_args };\n\npub comptime fn stub_fn(f: FunctionDefinition) -> Quoted {\n let is_static_call = is_fn_view(f);\n let is_void = f.return_type() == type_of(());\n\n if is_fn_private(f) {\n if is_static_call {\n if is_void {\n create_private_static_void_stub(f)\n } else {\n create_private_static_stub(f)\n }\n } else {\n if is_void {\n create_private_void_stub(f)\n } else {\n create_private_stub(f)\n }\n }\n } else {\n if is_static_call {\n if is_void {\n create_public_static_void_stub(f)\n } else {\n create_public_static_stub(f)\n }\n } else {\n if is_void {\n create_public_void_stub(f)\n } else {\n create_public_stub(f)\n }\n }\n }\n}\n\n/// Utility function creating stubs used by all the stub functions in this file.\ncomptime fn create_stub_base(\n f: FunctionDefinition,\n) -> (Quoted, Quoted, Quoted, Quoted, u32, Field) {\n let fn_name = f.name();\n let fn_parameters = f.parameters();\n let fn_parameters_list =\n fn_parameters.map(|(name, typ): (Quoted, Type)| quote { $name: $typ }).join(quote {,});\n\n // Example of what the fold(...) below will generate for `target_address` and `fee_juice_limit_per_tx` function\n // parameters:\n // ```\n // let mut serialized_args = &[];\n // serialized_args = serialized_args.append(aztec::protocol_types::traits::Serialize::serialize(target_address));\n // serialized_args = serialized_args.push_back(fee_juice_limit_per_tx as Field);\n // ```\n let serialized_args_slice_construction = fn_parameters.fold(\n quote {\n let mut $SERIALIZED_ARGS_SLICE_NAME = &[];\n },\n |args, param: (Quoted, Type)| {\n let (name, typ) = param;\n let arg_to_append = add_to_field_slice(SERIALIZED_ARGS_SLICE_NAME, name, typ);\n quote {\n $args\n $arg_to_append\n }\n },\n );\n\n let (fn_name_str, _) = fn_name.as_str_quote();\n let fn_name_len: u32 = unquote!(quote { $fn_name_str.as_bytes().len()});\n let fn_selector: Field = compute_fn_selector(f);\n\n (\n fn_name, fn_parameters_list, serialized_args_slice_construction, fn_name_str, fn_name_len,\n fn_selector,\n )\n}\n\ncomptime fn create_private_stub(f: FunctionDefinition) -> Quoted {\n let (fn_name, fn_parameters_list, serialized_args_slice_construction, fn_name_str, fn_name_len, fn_selector) =\n create_stub_base(f);\n let fn_return_type = f.return_type();\n\n quote {\n pub fn $fn_name(self, $fn_parameters_list) -> dep::aztec::context::call_interfaces::PrivateCallInterface<$fn_name_len, $fn_return_type> {\n $serialized_args_slice_construction\n let selector = $FROM_FIELD($fn_selector);\n dep::aztec::context::call_interfaces::PrivateCallInterface::new(\n self.target_contract,\n selector,\n $fn_name_str,\n $SERIALIZED_ARGS_SLICE_NAME,\n false\n )\n }\n }\n}\n\ncomptime fn create_private_static_stub(f: FunctionDefinition) -> Quoted {\n let (fn_name, fn_parameters_list, serialized_args_slice_construction, fn_name_str, fn_name_len, fn_selector) =\n create_stub_base(f);\n let fn_return_type = f.return_type();\n\n quote {\n pub fn $fn_name(self, $fn_parameters_list) -> dep::aztec::context::call_interfaces::PrivateStaticCallInterface<$fn_name_len, $fn_return_type> {\n $serialized_args_slice_construction\n let selector = $FROM_FIELD($fn_selector);\n dep::aztec::context::call_interfaces::PrivateStaticCallInterface::new(\n self.target_contract,\n selector,\n $fn_name_str,\n $SERIALIZED_ARGS_SLICE_NAME,\n )\n }\n }\n}\n\ncomptime fn create_private_void_stub(f: FunctionDefinition) -> Quoted {\n let (fn_name, fn_parameters_list, serialized_args_slice_construction, fn_name_str, fn_name_len, fn_selector) =\n create_stub_base(f);\n\n quote {\n pub fn $fn_name(self, $fn_parameters_list) -> dep::aztec::context::call_interfaces::PrivateVoidCallInterface<$fn_name_len> {\n $serialized_args_slice_construction\n let selector = $FROM_FIELD($fn_selector);\n dep::aztec::context::call_interfaces::PrivateVoidCallInterface::new(\n self.target_contract,\n selector,\n $fn_name_str,\n $SERIALIZED_ARGS_SLICE_NAME,\n false\n )\n }\n }\n}\n\ncomptime fn create_private_static_void_stub(f: FunctionDefinition) -> Quoted {\n let (fn_name, fn_parameters_list, serialized_args_slice_construction, fn_name_str, fn_name_len, fn_selector) =\n create_stub_base(f);\n\n quote {\n pub fn $fn_name(self, $fn_parameters_list) -> dep::aztec::context::call_interfaces::PrivateStaticVoidCallInterface<$fn_name_len> {\n $serialized_args_slice_construction\n let selector = $FROM_FIELD($fn_selector);\n dep::aztec::context::call_interfaces::PrivateStaticVoidCallInterface::new(\n self.target_contract,\n selector,\n $fn_name_str,\n serialized_args\n )\n }\n }\n}\n\ncomptime fn create_public_stub(f: FunctionDefinition) -> Quoted {\n let (fn_name, fn_parameters_list, serialized_args_slice_construction, fn_name_str, fn_name_len, fn_selector) =\n create_stub_base(f);\n let fn_return_type = f.return_type();\n\n quote {\n pub fn $fn_name(self, $fn_parameters_list) -> dep::aztec::context::call_interfaces::PublicCallInterface<$fn_name_len, $fn_return_type> {\n $serialized_args_slice_construction\n let selector = $FROM_FIELD($fn_selector);\n dep::aztec::context::call_interfaces::PublicCallInterface::new(\n self.target_contract,\n selector,\n $fn_name_str,\n $SERIALIZED_ARGS_SLICE_NAME,\n false\n )\n }\n }\n}\n\ncomptime fn create_public_static_stub(f: FunctionDefinition) -> Quoted {\n let (fn_name, fn_parameters_list, serialized_args_slice_construction, fn_name_str, fn_name_len, fn_selector) =\n create_stub_base(f);\n let fn_return_type = f.return_type();\n\n quote {\n pub fn $fn_name(self, $fn_parameters_list) -> dep::aztec::context::call_interfaces::PublicStaticCallInterface<$fn_name_len, $fn_return_type> {\n $serialized_args_slice_construction\n let selector = $FROM_FIELD($fn_selector);\n dep::aztec::context::call_interfaces::PublicStaticCallInterface::new(\n self.target_contract,\n selector,\n $fn_name_str,\n $SERIALIZED_ARGS_SLICE_NAME,\n )\n }\n }\n}\n\ncomptime fn create_public_void_stub(f: FunctionDefinition) -> Quoted {\n let (fn_name, fn_parameters_list, serialized_args_slice_construction, fn_name_str, fn_name_len, fn_selector) =\n create_stub_base(f);\n\n quote {\n pub fn $fn_name(self, $fn_parameters_list) -> dep::aztec::context::call_interfaces::PublicVoidCallInterface<$fn_name_len> {\n $serialized_args_slice_construction\n let selector = $FROM_FIELD($fn_selector);\n dep::aztec::context::call_interfaces::PublicVoidCallInterface::new(\n self.target_contract,\n selector,\n $fn_name_str,\n $SERIALIZED_ARGS_SLICE_NAME,\n false\n )\n }\n }\n}\n\ncomptime fn create_public_static_void_stub(f: FunctionDefinition) -> Quoted {\n let (fn_name, fn_parameters_list, serialized_args_slice_construction, fn_name_str, fn_name_len, fn_selector) =\n create_stub_base(f);\n\n quote {\n pub fn $fn_name(self, $fn_parameters_list) -> dep::aztec::context::call_interfaces::PublicStaticVoidCallInterface<$fn_name_len> {\n $serialized_args_slice_construction\n let selector = $FROM_FIELD($fn_selector);\n dep::aztec::context::call_interfaces::PublicStaticVoidCallInterface::new(\n self.target_contract,\n selector,\n $fn_name_str,\n serialized_args\n )\n }\n }\n}\n"
3085
2833
  },
3086
- "86": {
3087
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/encrypted_logs/metadata_packing.nr",
3088
- "source": "global U64_SHIFT_MULTIPLIER: Field = 2.pow_32(64);\n\npub fn to_expanded_metadata(log_metadata: u64, log_type: u64) -> Field {\n let metadata_field = log_metadata as Field;\n // We use multiplication instead of bit shifting operations to shift the type bits as bit shift operations are\n // expensive in circuits.\n let type_field: Field = (log_type as Field) * U64_SHIFT_MULTIPLIER;\n type_field + metadata_field\n}\n\npub fn from_expanded_metadata(input: Field) -> (u64, u64) {\n input.assert_max_bit_size::<128>();\n let metadata = (input as u64);\n // Use division instead of bit shift since bit shifts are expensive in circuits\n let log_type = ((input - (metadata as Field)) / U64_SHIFT_MULTIPLIER) as u64;\n (metadata, log_type)\n}\n\nmod tests {\n use super::{from_expanded_metadata, to_expanded_metadata};\n\n global U64_MAX: Field = 2.pow_32(64) - 1;\n global U128_MAX: Field = 2.pow_32(128) - 1;\n\n #[test]\n fn packing_metadata() {\n // Test case 1: All bits set\n let packed = to_expanded_metadata(U64_MAX as u64, U64_MAX as u64);\n let (metadata, log_type) = from_expanded_metadata(packed);\n assert(metadata == U64_MAX as u64, \"Metadata bits should be all 1s\");\n assert(log_type == U64_MAX as u64, \"Log type bits should be all 1s\");\n\n // Test case 2: Only log type bits set\n let packed = to_expanded_metadata(0, U64_MAX as u64);\n let (metadata, log_type) = from_expanded_metadata(packed);\n assert(metadata == 0, \"Metadata bits should be 0\");\n assert(log_type == U64_MAX as u64, \"Log type bits should be all 1s\");\n\n // Test case 3: Only metadata bits set\n let packed = to_expanded_metadata(U64_MAX as u64, 0);\n let (metadata, log_type) = from_expanded_metadata(packed);\n assert(metadata == U64_MAX as u64, \"Metadata bits should be all 1s\");\n assert(log_type == 0, \"Log type bits should be 0\");\n\n // Test case 4: Zero\n let packed = to_expanded_metadata(0, 0);\n let (metadata, log_type) = from_expanded_metadata(packed);\n assert(metadata == 0, \"Metadata bits should be 0\");\n assert(log_type == 0, \"Log type bits should be 0\");\n }\n\n #[test]\n fn unpacking_metadata() {\n // Test case 1: All bits set\n let input = U128_MAX;\n let (metadata, log_type) = from_expanded_metadata(input);\n assert(metadata == U64_MAX as u64, \"Metadata bits should be all 1s\");\n assert(log_type == U64_MAX as u64, \"Log type bits should be all 1s\");\n\n // Test case 2: Only log type bits set\n let input = U128_MAX - U64_MAX;\n let (metadata, log_type) = from_expanded_metadata(input);\n assert(metadata == 0, \"Metadata bits should be 0\");\n assert(log_type == U64_MAX as u64, \"Log type bits should be all 1s\");\n\n // Test case 3: Only metadata bits set\n let input = U64_MAX;\n let (metadata, log_type) = from_expanded_metadata(input);\n assert(metadata == U64_MAX as u64, \"Metadata bits should be all 1s\");\n assert(log_type == 0, \"Log type bits should be 0\");\n\n // Test case 4: Zero\n let input = 0;\n let (metadata, log_type) = from_expanded_metadata(input);\n assert(metadata == 0, \"Metadata bits should be 0\");\n assert(log_type == 0, \"Log type bits should be 0\");\n }\n\n #[test]\n fn roundtrip_metadata(original_metadata: u64, original_type: u64) {\n let packed = to_expanded_metadata(original_metadata, original_type);\n let (unpacked_metadata, unpacked_type) = from_expanded_metadata(packed);\n assert(original_type == unpacked_type, \"Log type bits should match after roundtrip\");\n assert(\n original_metadata == unpacked_metadata,\n \"Metadata bits should match after roundtrip\",\n );\n }\n}\n"
2834
+ "95": {
2835
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/functions/utils.nr",
2836
+ "source": "use crate::macros::{\n functions::{abi_export::create_fn_abi_export, call_interface_stubs::stub_fn, stub_registry},\n notes::NOTES,\n utils::{\n add_to_hasher, fn_has_noinitcheck, get_fn_visibility, is_fn_contract_library_method,\n is_fn_initializer, is_fn_internal, is_fn_private, is_fn_public, is_fn_test, is_fn_utility,\n is_fn_view, modify_fn_body, module_has_initializer, module_has_storage,\n },\n};\nuse protocol_types::meta::generate_serialize_to_fields;\nuse std::meta::type_of;\n\npub(crate) comptime fn transform_private(f: FunctionDefinition) -> Quoted {\n let fn_abi = create_fn_abi_export(f);\n let fn_stub = stub_fn(f);\n stub_registry::register(f.module(), fn_stub);\n\n // If a function is further modified as unconstrained, we throw an error\n if f.is_unconstrained() {\n let name = f.name();\n panic(\n f\"Function {name} is annotated with #[private] but marked as unconstrained, remove unconstrained keyword\",\n );\n }\n\n let module_has_initializer = module_has_initializer(f.module());\n let module_has_storage = module_has_storage(f.module());\n\n // Private functions undergo a lot of transformations from their Aztec.nr form into a circuit that can be fed to the\n // Private Kernel Circuit.\n // First we change the function signature so that it also receives `PrivateContextInputs`, which contain information\n // about the execution context (e.g. the caller).\n let original_params = f.parameters();\n f.set_parameters(&[(\n quote { inputs },\n quote { crate::context::inputs::private_context_inputs::PrivateContextInputs }.as_type(),\n )]\n .append(original_params));\n\n let mut body = f.body().as_block().unwrap();\n\n // The original params are hashed and passed to the `context` object, so that the kernel can verify we've received\n // the correct values.\n // TODO: Optimize args_hasher for small number of arguments\n let args_hasher_name = quote { args_hasher };\n let args_hasher = original_params.fold(\n quote {\n let mut $args_hasher_name = dep::aztec::hash::ArgsHasher::new();\n },\n |args_hasher, param: (Quoted, Type)| {\n let (name, typ) = param;\n let appended_arg = add_to_hasher(args_hasher_name, name, typ);\n quote {\n $args_hasher\n $appended_arg\n }\n },\n );\n\n let context_creation = quote {\n let mut context = dep::aztec::context::private_context::PrivateContext::new(inputs, dep::aztec::protocol_types::traits::Hash::hash($args_hasher_name));\n };\n\n // Modifications introduced by the different marker attributes.\n let internal_check = if is_fn_internal(f) {\n create_internal_check(f)\n } else {\n quote {}\n };\n\n let view_check = if is_fn_view(f) {\n create_view_check(f)\n } else {\n quote {}\n };\n\n let (assert_initializer, mark_as_initialized) = if is_fn_initializer(f) {\n (create_assert_correct_initializer_args(f), create_mark_as_initialized(f))\n } else {\n (quote {}, quote {})\n };\n\n let storage_init = if module_has_storage {\n quote {\n // Some functions don't access storage, but it'd be quite difficult to only inject this variable if it is\n // referenced. We instead ignore 'unused variable' warnings for it.\n #[allow(unused_variables)]\n let storage = Storage::init(&mut context);\n }\n } else {\n quote {}\n };\n\n // Initialization checks are not included in contracts that don't have initializers.\n let init_check = if module_has_initializer & !is_fn_initializer(f) & !fn_has_noinitcheck(f) {\n create_init_check(f)\n } else {\n quote {}\n };\n\n // All private functions perform message discovery, since they may need to access notes. This is slightly\n // inefficient and could be improved by only doing it once we actually attempt to read any.\n let message_discovery_call = if NOTES.len() > 0 {\n create_message_discovery_call()\n } else {\n quote {}\n };\n\n // Finally, we need to change the return type to be `PrivateCircuitPublicInputs`, which is what the Private Kernel\n // circuit expects.\n let return_value_var_name = quote { macro__returned__values };\n\n let return_value_type = f.return_type();\n let return_value = if body.len() == 0 {\n quote {}\n } else if return_value_type != type_of(()) {\n // The original return value is passed to a second args hasher which the context receives.\n let (body_without_return, last_body_expr) = body.pop_back();\n let return_value = last_body_expr.quoted();\n let return_value_assignment =\n quote { let $return_value_var_name: $return_value_type = $return_value; };\n let return_hasher_name = quote { return_hasher };\n let return_value_into_hasher =\n add_to_hasher(return_hasher_name, return_value_var_name, return_value_type);\n\n body = body_without_return;\n\n quote {\n let mut $return_hasher_name = dep::aztec::hash::ArgsHasher::new();\n $return_value_assignment\n $return_value_into_hasher\n context.set_return_hash($return_hasher_name);\n }\n } else {\n let (body_without_return, last_body_expr) = body.pop_back();\n if !last_body_expr.has_semicolon()\n & last_body_expr.as_for().is_none()\n & last_body_expr.as_assert().is_none()\n & last_body_expr.as_for_range().is_none()\n & last_body_expr.as_assert_eq().is_none()\n & last_body_expr.as_let().is_none() {\n let unused_return_value_name = f\"_{return_value_var_name}\".quoted_contents();\n body = body_without_return.push_back(\n quote { let $unused_return_value_name = $last_body_expr; }.as_expr().unwrap(),\n );\n }\n quote {}\n };\n\n let context_finish = quote { context.finish() };\n\n let to_prepend = quote {\n $args_hasher\n $context_creation\n $assert_initializer\n $init_check\n $internal_check\n $view_check\n $storage_init\n $message_discovery_call\n };\n\n let to_append = quote {\n $return_value\n $mark_as_initialized\n $context_finish\n };\n let modified_body = modify_fn_body(body, to_prepend, to_append);\n f.set_body(modified_body);\n f.set_return_type(\n quote { dep::protocol_types::abis::private_circuit_public_inputs::PrivateCircuitPublicInputs }\n .as_type(),\n );\n f.set_return_data();\n\n fn_abi\n}\n\npub(crate) comptime fn transform_public(f: FunctionDefinition) -> Quoted {\n let fn_abi = create_fn_abi_export(f);\n let fn_stub = stub_fn(f);\n stub_registry::register(f.module(), fn_stub);\n\n // If a function is further modified as unconstrained, we throw an error\n if f.is_unconstrained() {\n let name = f.name();\n panic(\n f\"Function {name} is annotated with #[public] but marked as unconstrained, remove unconstrained keyword\",\n );\n }\n\n let module_has_initializer = module_has_initializer(f.module());\n let module_has_storage = module_has_storage(f.module());\n\n // Public functions undergo a lot of transformations from their Aztec.nr form.\n let original_params = f.parameters();\n let args_len = original_params\n .map(|(name, typ): (Quoted, Type)| {\n generate_serialize_to_fields(name, typ, &[], false).0.len()\n })\n .fold(0, |acc: u32, val: u32| acc + val);\n\n // Unlike in the private case, in public the `context` does not need to receive the hash of the original params.\n let context_creation = quote {\n let mut context = dep::aztec::context::public_context::PublicContext::new(|| {\n // We start from 1 because we skip the selector for the dispatch function.\n let serialized_args : [Field; $args_len] = dep::aztec::context::public_context::calldata_copy(1, $args_len);\n dep::aztec::hash::hash_args_array(serialized_args)\n });\n };\n\n // Modifications introduced by the different marker attributes.\n let internal_check = if is_fn_internal(f) {\n create_internal_check(f)\n } else {\n quote {}\n };\n\n let view_check = if is_fn_view(f) {\n create_view_check(f)\n } else {\n quote {}\n };\n\n let (assert_initializer, mark_as_initialized) = if is_fn_initializer(f) {\n (create_assert_correct_initializer_args(f), create_mark_as_initialized(f))\n } else {\n (quote {}, quote {})\n };\n\n let storage_init = if module_has_storage {\n // Some functions don't access storage, but it'd be quite difficult to only inject this variable if it is\n // referenced. We instead ignore 'unused variable' warnings for it.\n quote {\n #[allow(unused_variables)]\n let storage = Storage::init(&mut context);\n }\n } else {\n quote {}\n };\n\n // Initialization checks are not included in contracts that don't have initializers.\n let init_check = if module_has_initializer & !fn_has_noinitcheck(f) & !is_fn_initializer(f) {\n create_init_check(f)\n } else {\n quote {}\n };\n\n let to_prepend = quote {\n $context_creation\n $assert_initializer\n $init_check\n $internal_check\n $view_check\n $storage_init\n };\n\n let to_append = quote {\n $mark_as_initialized\n };\n\n let body = f.body().as_block().unwrap();\n let modified_body = modify_fn_body(body, to_prepend, to_append);\n f.set_body(modified_body);\n\n // All public functions are automatically made unconstrained, even if they were not marked as such. This is because\n // instead of compiling into a circuit, they will compile to bytecode that will be later transpiled into AVM\n // bytecode.\n f.set_unconstrained(true);\n f.set_return_public(true);\n\n fn_abi\n}\n\npub(crate) comptime fn transform_utility(f: FunctionDefinition) {\n // Check if function is marked as unconstrained\n if !f.is_unconstrained() {\n let name = f.name();\n panic(\n f\"Function {name} is annotated with #[utility] but not marked as unconstrained, add unconstrained keyword\",\n );\n }\n\n // Create utility context\n let context_creation =\n quote { let mut context = dep::aztec::context::utility_context::UtilityContext::new(); };\n let module_has_storage = module_has_storage(f.module());\n\n // Initialize Storage if module has storage\n let storage_init = if module_has_storage {\n quote {\n // Some functions don't access storage, but it'd be quite difficult to only inject this variable if it is\n // referenced. We instead ignore 'unused variable' warnings for it.\n #[allow(unused_variables)]\n let storage = Storage::init(context);\n }\n } else {\n quote {}\n };\n\n // All utility functions perform message discovery, since they may need to access private notes that would be\n // found during this process. This is slightly inefficient and could be improved by only doing it once we actually\n // attempt to read any.\n let message_discovery_call = if NOTES.len() > 0 {\n create_message_discovery_call()\n } else {\n quote {}\n };\n\n // Inject context creation, storage initialization, and message discovery call at the beginning of the function\n // body.\n let to_prepend = quote {\n $context_creation\n $storage_init\n $message_discovery_call\n };\n let body = f.body().as_block().unwrap();\n let modified_body = modify_fn_body(body, to_prepend, quote {});\n f.set_body(modified_body);\n\n f.set_return_public(true);\n}\n\ncomptime fn create_internal_check(f: FunctionDefinition) -> Quoted {\n let name = f.name();\n let assertion_message = f\"Function {name} can only be called internally\";\n quote { assert(context.msg_sender() == context.this_address(), $assertion_message); }\n}\n\ncomptime fn create_view_check(f: FunctionDefinition) -> Quoted {\n let name = f.name();\n let assertion_message = f\"Function {name} can only be called statically\";\n if is_fn_private(f) {\n // Here `context` is of type context::PrivateContext\n quote { assert(context.inputs.call_context.is_static_call == true, $assertion_message); }\n } else {\n // Here `context` is of type context::PublicContext\n quote { assert(context.is_static_call(), $assertion_message); }\n }\n}\n\ncomptime fn create_assert_correct_initializer_args(f: FunctionDefinition) -> Quoted {\n let fn_visibility = get_fn_visibility(f);\n f\"dep::aztec::macros::functions::initialization_utils::assert_initialization_matches_address_preimage_{fn_visibility}(context);\"\n .quoted_contents()\n}\n\ncomptime fn create_mark_as_initialized(f: FunctionDefinition) -> Quoted {\n let fn_visibility = get_fn_visibility(f);\n f\"dep::aztec::macros::functions::initialization_utils::mark_as_initialized_{fn_visibility}(&mut context);\"\n .quoted_contents()\n}\n\ncomptime fn create_init_check(f: FunctionDefinition) -> Quoted {\n let fn_visibility = get_fn_visibility(f);\n f\"dep::aztec::macros::functions::initialization_utils::assert_is_initialized_{fn_visibility}(&mut context);\"\n .quoted_contents()\n}\n\n/// Injects a call to `aztec::messages::discovery::discover_new_messages`, causing for new notes to be added to PXE and made\n/// available for the current execution.\npub(crate) comptime fn create_message_discovery_call() -> Quoted {\n quote {\n /// Safety: message discovery returns nothing and is performed solely for its side-effects. It is therefore\n /// always safe to call.\n unsafe {\n dep::aztec::messages::discovery::discover_new_messages(\n context.this_address(),\n _compute_note_hash_and_nullifier,\n );\n };\n }\n}\n\n/// Checks if each function in the module is marked with either #[private], #[public], #[utility],\n/// #[contract_library_method], or #[test]. Non-macroified functions are not allowed in contracts.\npub(crate) comptime fn check_each_fn_macroified(m: Module) {\n for f in m.functions() {\n let name = f.name();\n if !is_fn_private(f)\n & !is_fn_public(f)\n & !is_fn_utility(f)\n & !is_fn_contract_library_method(f)\n & !is_fn_test(f) {\n panic(\n f\"Function {name} must be marked as either #[private], #[public], #[utility], #[contract_library_method], or #[test]\",\n );\n }\n }\n}\n"
3089
2837
  },
3090
- "90": {
3091
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/hash.nr",
3092
- "source": "use dep::protocol_types::{\n address::{AztecAddress, EthAddress},\n constants::{\n GENERATOR_INDEX__FUNCTION_ARGS, GENERATOR_INDEX__MESSAGE_NULLIFIER,\n GENERATOR_INDEX__PUBLIC_CALLDATA, GENERATOR_INDEX__SECRET_HASH,\n },\n hash::{poseidon2_hash_with_separator, poseidon2_hash_with_separator_slice, sha256_to_field},\n point::Point,\n traits::{Hash, ToField},\n};\n\npub use dep::protocol_types::hash::{compute_siloed_nullifier, pedersen_hash};\n\npub fn pedersen_commitment<let N: u32>(inputs: [Field; N], hash_index: u32) -> Point {\n std::hash::pedersen_commitment_with_separator(inputs, hash_index)\n}\n\npub fn compute_secret_hash(secret: Field) -> Field {\n poseidon2_hash_with_separator([secret], GENERATOR_INDEX__SECRET_HASH)\n}\n\npub fn compute_l1_to_l2_message_hash(\n sender: EthAddress,\n chain_id: Field,\n recipient: AztecAddress,\n version: Field,\n content: Field,\n secret_hash: Field,\n leaf_index: Field,\n) -> Field {\n let mut hash_bytes = [0 as u8; 224];\n let sender_bytes: [u8; 32] = sender.to_field().to_be_bytes();\n let chain_id_bytes: [u8; 32] = chain_id.to_be_bytes();\n let recipient_bytes: [u8; 32] = recipient.to_field().to_be_bytes();\n let version_bytes: [u8; 32] = version.to_be_bytes();\n let content_bytes: [u8; 32] = content.to_be_bytes();\n let secret_hash_bytes: [u8; 32] = secret_hash.to_be_bytes();\n let leaf_index_bytes: [u8; 32] = leaf_index.to_be_bytes();\n\n for i in 0..32 {\n hash_bytes[i] = sender_bytes[i];\n hash_bytes[i + 32] = chain_id_bytes[i];\n hash_bytes[i + 64] = recipient_bytes[i];\n hash_bytes[i + 96] = version_bytes[i];\n hash_bytes[i + 128] = content_bytes[i];\n hash_bytes[i + 160] = secret_hash_bytes[i];\n hash_bytes[i + 192] = leaf_index_bytes[i];\n }\n\n sha256_to_field(hash_bytes)\n}\n\n// The nullifier of a l1 to l2 message is the hash of the message salted with the secret\npub fn compute_l1_to_l2_message_nullifier(message_hash: Field, secret: Field) -> Field {\n poseidon2_hash_with_separator([message_hash, secret], GENERATOR_INDEX__MESSAGE_NULLIFIER)\n}\n\npub struct ArgsHasher {\n pub fields: [Field],\n}\n\nimpl Hash for ArgsHasher {\n fn hash(self) -> Field {\n hash_args(self.fields)\n }\n}\n\nimpl ArgsHasher {\n pub fn new() -> Self {\n Self { fields: [] }\n }\n\n pub fn add(&mut self, field: Field) {\n self.fields = self.fields.push_back(field);\n }\n\n pub fn add_multiple<let N: u32>(&mut self, fields: [Field; N]) {\n for i in 0..N {\n self.fields = self.fields.push_back(fields[i]);\n }\n }\n}\n\n// Computes the hash of input arguments or return values for private functions, or for authwit creation.\npub fn hash_args_array<let N: u32>(args: [Field; N]) -> Field {\n if args.len() == 0 {\n 0\n } else {\n poseidon2_hash_with_separator(args, GENERATOR_INDEX__FUNCTION_ARGS)\n }\n}\n\n// Same as `hash_args_array`, but takes a slice instead of an array.\npub fn hash_args(args: [Field]) -> Field {\n if args.len() == 0 {\n 0\n } else {\n poseidon2_hash_with_separator_slice(args, GENERATOR_INDEX__FUNCTION_ARGS)\n }\n}\n\n// Computes the hash of calldata for public functions.\npub fn hash_calldata_array<let N: u32>(calldata: [Field; N]) -> Field {\n if calldata.len() == 0 {\n 0\n } else {\n poseidon2_hash_with_separator(calldata, GENERATOR_INDEX__PUBLIC_CALLDATA)\n }\n}\n\n// Same as `hash_calldata_array`, but takes a slice instead of an array.\npub fn hash_calldata(calldata: [Field]) -> Field {\n if calldata.len() == 0 {\n 0\n } else {\n poseidon2_hash_with_separator_slice(calldata, GENERATOR_INDEX__PUBLIC_CALLDATA)\n }\n}\n\n#[test]\nunconstrained fn compute_var_args_hash() {\n let mut input = ArgsHasher::new();\n for i in 0..100 {\n input.add(i as Field);\n }\n let hash = input.hash();\n dep::std::println(hash);\n assert(hash == 0x19b0d74feb06ebde19edd85a28986c97063e84b3b351a8b666c7cac963ce655f);\n}\n"
2838
+ "98": {
2839
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/storage.nr",
2840
+ "source": "use poseidon::poseidon2::Poseidon2Hasher;\nuse std::{collections::umap::UHashMap, hash::BuildHasherDefault};\n\nuse super::utils::AsStrQuote;\nuse super::utils::get_storage_size;\nuse super::utils::is_note;\n\n/// Stores a map from a module to the name of the struct that describes its storage layout.\n/// This is then used when generating a `storage_layout()` getter on the contract struct.\npub comptime mut global STORAGE_LAYOUT_NAME: UHashMap<Module, Quoted, BuildHasherDefault<Poseidon2Hasher>> =\n UHashMap::default();\n\n/// Marks a struct as the one describing the storage layout of a contract. Only a single struct in the entire contract\n/// should have this macro (or `storage_no_init`) applied to it.\n/// The contract's storage is accessed via the `storage` variable, which will will automatically be made available in\n/// all functions as an instance of the struct this macro was applied to.\npub comptime fn storage(s: TypeDefinition) -> Quoted {\n // This macro performs three things:\n // - it marks the contract as having storage, so that `macros::utils::module_has_storage` will return true and\n // functions will have the storage variable injected and initialized via the `init` function.\n // - it implements said `init` function by allocating appropriate storage slots to each state variable.\n // - it exposes the storage layout by creating a `StorageLayout` struct that is exposed via the `abi(storage)`\n // macro.\n let mut slot: u32 = 1;\n let mut storage_vars_constructors = &[];\n let mut storage_layout_fields = &[];\n let mut storage_layout_constructors = &[];\n\n // TODO(#8658): uncomment the code below to inject the Context type parameter.\n //let mut new_storage_fields = &[];\n //let context_generic = s.add_generic(\"Context\");\n for field in s.fields_as_written() {\n // FIXME: This doesn't handle field types with generics\n let (name, typ) = field;\n let (storage_field_constructor, storage_size) =\n generate_storage_field_constructor(typ, quote { $slot }, false);\n storage_vars_constructors =\n storage_vars_constructors.push_back(quote { $name: $storage_field_constructor });\n // We have `Storable` in a separate `.nr` file instead of defining it in the last quote of this function\n // because that way a dev gets a more reasonable error if he defines a struct with the same name in\n // a contract.\n storage_layout_fields =\n storage_layout_fields.push_back(quote { pub $name: dep::aztec::prelude::Storable });\n storage_layout_constructors = storage_layout_constructors.push_back(\n quote { $name: dep::aztec::prelude::Storable { slot: $slot } },\n );\n //let with_context_generic = add_context_generic(typ, context_generic);\n //println(with_context_generic);\n //new_storage_fields = new_storage_fields.push_back((name, with_context_generic ));\n slot += storage_size;\n }\n\n //s.set_fields(new_storage_fields);\n let storage_vars_constructors = storage_vars_constructors.join(quote {,});\n let storage_impl = quote {\n impl<Context> Storage<Context> {\n fn init(context: Context) -> Self {\n Self {\n $storage_vars_constructors\n }\n }\n }\n };\n\n let storage_layout_fields = storage_layout_fields.join(quote {,});\n let storage_layout_constructors = storage_layout_constructors.join(quote {,});\n\n let module = s.module();\n let module_name = module.name();\n let storage_layout_name = f\"STORAGE_LAYOUT_{module_name}\".quoted_contents();\n let (module_name_str, module_name_len) = module_name.as_str_quote();\n STORAGE_LAYOUT_NAME.insert(module, storage_layout_name);\n\n quote {\n $storage_impl\n\n pub struct StorageLayoutFields {\n $storage_layout_fields\n }\n\n pub struct StorageLayout<let N: u32> {\n pub contract_name: str<N>,\n pub fields: StorageLayoutFields\n }\n\n #[abi(storage)]\n pub global $storage_layout_name: StorageLayout<$module_name_len> = StorageLayout {\n contract_name: $module_name_str,\n fields: StorageLayoutFields { $storage_layout_constructors }\n };\n }\n}\n\n/// Same as `storage`, except the user is in charge of providing an implementation of the `init` constructor function\n/// with signature `fn init<Context>(context: Context) -> Self`, which allows for manual control of storage slot\n/// allocation. Similarly, no `StorageLayout` struct will be created.\n/// Only a single struct in the entire contract should have this macro (or `storage`) applied to it.\npub comptime fn storage_no_init(_s: TypeDefinition) {\n // All `storage` does is provide the `init` implementation, so we don't need to do anything here. Applying this\n // macro however will cause for `macros::utils::module_has_storage` to return true, resulting in the injection of\n // the `storage` variable.\n}\n\n/// Returns the expression required to initialize a state variable with a given slot, along with its serialization size,\n/// i.e. how many contiguous storage slots the variable requires.\ncomptime fn generate_storage_field_constructor(\n typ: Type,\n slot: Quoted,\n parent_is_map: bool,\n) -> (Quoted, u32) {\n assert(\n typ.as_data_type().is_some(),\n \"Storage containers must be generic structs of the form `Container<_, Context>`, or Map<Key, _, Context>\",\n );\n let (container_struct, generics) = typ.as_data_type().unwrap();\n let struct_name = container_struct.name();\n\n if is_storage_map(typ) {\n // Map state variables recursively initialize their contents - this includes nested maps.\n let (value_constructor, _) =\n generate_storage_field_constructor(generics[1], quote { slot }, true);\n (quote { $struct_name::new(context, $slot, | context, slot | { $value_constructor }) }, 1)\n } else {\n let storage_size = if parent_is_map {\n // Variables inside a map do not require contiguous slots since the map slot derivation is assumed to result\n // in slots very far away from one another.\n 1\n } else {\n let (_, container_struct_generics) = typ.as_data_type().unwrap();\n let stored_struct = container_struct_generics[0];\n\n if is_note(stored_struct) {\n // Private notes always occupy a single slot, since the slot is only used as a state variable\n // identifier.\n 1\n } else {\n get_storage_size(typ)\n }\n };\n\n // We assume below that all state variables implement `fn new<Context>(context: Context, slot: Field) -> Self`.\n (quote { $struct_name::new(context, $slot)}, storage_size)\n }\n}\n\n/// Returns true if `typ` is `state_vars::map::Map`.\ncomptime fn is_storage_map(typ: Type) -> bool {\n if typ.as_data_type().is_some() {\n let (def, generics) = typ.as_data_type().unwrap();\n let maybe_map = if (def.name() == quote { Map }) & (generics.len() == 3) {\n let maybe_key = generics[0];\n let maybe_value = generics[1];\n let maybe_context = generics[2];\n quote { crate::state_vars::map::Map<$maybe_key, $maybe_value, $maybe_context> }.as_type()\n } else {\n quote {()}.as_type()\n };\n typ == maybe_map\n } else {\n false\n }\n}\n\ncomptime fn add_context_generic(typ: Type, context_generic: Type) -> Type {\n let (def, mut generics) = typ.as_data_type().expect(\n f\"Storage containers must be generic structs of the form `Container<..., Context>`\",\n );\n let name = def.name();\n\n if is_storage_map(typ) {\n generics[generics.len() - 2] = add_context_generic(generics[1], context_generic);\n generics[generics.len() - 1] = context_generic;\n } else {\n generics[generics.len() - 1] = context_generic;\n }\n\n let generics = generics.map(|typ: Type| quote {$typ}).join(quote {,});\n quote { $name<$generics> }.as_type()\n}\n"
3093
2841
  }
3094
2842
  }
3095
2843
  }