@aztec/protocol-contracts 0.85.0-alpha-testnet.2 → 0.85.0-alpha-testnet.4
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/artifacts/AuthRegistry.json +228 -228
- package/artifacts/ContractClassRegisterer.json +151 -151
- package/artifacts/ContractInstanceDeployer.json +254 -254
- package/artifacts/FeeJuice.json +327 -327
- package/artifacts/MultiCallEntrypoint.json +13 -13
- package/artifacts/Router.json +222 -222
- package/package.json +4 -4
- package/dest/protocol_contract_data_2.d.ts +0 -21
- package/dest/protocol_contract_data_2.d.ts.map +0 -1
- package/dest/protocol_contract_data_2.js +0 -41
- package/src/protocol_contract_data_2.ts +0 -61
|
@@ -71,6 +71,55 @@
|
|
|
71
71
|
"is_consumable"
|
|
72
72
|
]
|
|
73
73
|
},
|
|
74
|
+
{
|
|
75
|
+
"name": "set_authorized",
|
|
76
|
+
"is_unconstrained": true,
|
|
77
|
+
"custom_attributes": [
|
|
78
|
+
"public"
|
|
79
|
+
],
|
|
80
|
+
"abi": {
|
|
81
|
+
"parameters": [
|
|
82
|
+
{
|
|
83
|
+
"name": "message_hash",
|
|
84
|
+
"type": {
|
|
85
|
+
"kind": "field"
|
|
86
|
+
},
|
|
87
|
+
"visibility": "private"
|
|
88
|
+
},
|
|
89
|
+
{
|
|
90
|
+
"name": "authorize",
|
|
91
|
+
"type": {
|
|
92
|
+
"kind": "boolean"
|
|
93
|
+
},
|
|
94
|
+
"visibility": "private"
|
|
95
|
+
}
|
|
96
|
+
],
|
|
97
|
+
"return_type": null,
|
|
98
|
+
"error_types": {
|
|
99
|
+
"206160798890201757": {
|
|
100
|
+
"error_kind": "string",
|
|
101
|
+
"string": "Storage slot 0 not allowed. Storage slots must start from 1."
|
|
102
|
+
},
|
|
103
|
+
"5019202896831570965": {
|
|
104
|
+
"error_kind": "string",
|
|
105
|
+
"string": "attempt to add with overflow"
|
|
106
|
+
},
|
|
107
|
+
"14225679739041873922": {
|
|
108
|
+
"error_kind": "string",
|
|
109
|
+
"string": "Index out of bounds"
|
|
110
|
+
},
|
|
111
|
+
"17843811134343075018": {
|
|
112
|
+
"error_kind": "string",
|
|
113
|
+
"string": "Stack too deep"
|
|
114
|
+
}
|
|
115
|
+
}
|
|
116
|
+
},
|
|
117
|
+
"bytecode": "JwACBAEoAAABBIBKJwAABAMnAgMEAicCBAQAHxgABAADgEgdAIBJgEkBLgiASAABLgiASQACJQAAAFIlAAAAdigCAAEEgEonAgIEADsNAAEAAigAgEMEAAMoAIBEAQAAKACARQQAACgAgEYBAAEoAIBHBAABJiUAAAScHgIABAEnAgUAAi0IAQYnAgcEAwAQAQcBJwMGBAEAKAYCBy0MBwgtDgUIACgIAggtDgQIJwIEAAAtCAEFJwIHBAQAEAEHAScDBQQBACgFAgctDAcILQ4ECAAoCAIILQ4ECAAoCAIILQ4ECC0NBQcAKAcCBy0OBwUrAgAHAAAAAAAAAAACAAAAAAAAAAAtCAEIJwIJBAUAEAEJAScDCAQBACgIAgktDAkKLQ4ECgAoCgIKLQ4ECgAoCgIKLQ4ECgAoCgIKLQ4HCi0NBQkAKAkCCS0OCQUtDQgJACgJAgktDgkILQgBCQAAAQIBLQ4FCS0IAQUAAAECAS0OCAUtCAEIAAABAgEuCoBFAAgtCAEKAAABAgEuCoBEAAonAgsEAi4IgEUAAyMAAAGkDDgDCwwkAgAMAAAEQCMAAAG2LQ0KBgsoAAaARAAMJAIADAAAAdMnAg0EADwJAQ0nAgYEDC0IAAwtDAkNLQwFDi0MCA8tDAoQABAABgAlAAAExS0EAAAtDQkGLQ0FDC0NCA0tDgYJLQ4MBS0ODQguCoBGAAoBKAAMgEcABi0NBgUKOAUEBgsoAAaARAAIJAIACAAAAj4lAAAF2C0IAQYnAggEAwAQAQgBJwMGBAEAKAYCCC0MCAktDgUJACgJAgktDgEJLQgBAScCBQQEABABBQEnAwEEAQAoAQIFLQwFCC0OBAgAKAgCCC0OBAgAKAgCCC0OBAgtDQEFACgFAgUtDgUBLQgBBScCCAQFABABCAEnAwUEAQAoBQIILQwICS0OBAkAKAkCCS0OBAkAKAkCCS0OBAkAKAkCCS0OBwktDQEHACgHAgctDgcBLQ0FBwAoBwIHLQ4HBS0IAQcAAAECAS0OAQctCAEBAAABAgEtDgUBLQgBBQAAAQIBLgqARQAFLQgBCAAAAQIBLgqARAAILgiARQADIwAAAz4MOAMLCSQCAAkAAAPkIwAAA1AtDQgDCygAA4BEAAYkAgAGAAADbScCCQQAPAkBCScCAwQJLQgACS0MBwotDAELLQwFDC0MCA0AEAADACUAAATFLQQAAC0NBwMtDQEGLQ0FCS0OAwctDgYBLQ4JBS4KgEYACAEoAAaARwADLQ0DAQo4AQQDCygAA4BEAAQkAgAEAAAD2CUAAAXYHAwCAwAwDAADAAEmJAIACQAAA/EjAAAELwAoBgIKADgKAwwtDQwJJwIKBAwtCAAMLQwHDS0MAQ4tDAUPLQwIEC0MCREAEAAKACUAAAXqLQQAACMAAAQvASgAA4BHAAktDAkDIwAAAz4kAgAMAAAETSMAAASLACgGAg0AOA0DDi0NDgwnAg0EDi0IAA4tDAkPLQwFEC0MCBEtDAoSLQwMEwAQAA0AJQAABeotBAAAIwAABIsBKAADgEcADC0MDAMjAAABpCgAgAQEeAANAAAAgASAAyQAgAMAAATEKgEAAQX3ofOvpa3UyjwBAQImJQAABJwuCIBFAAUjAAAE1Q0oAAWAQwAGJAIABgAABUUjAAAE6i0NAQUtDQIGLQ0DBy0NBAgnAgkEBC0IAQonAgsEBQAQAQsBJwMKBAEAKAYCCycCDAQEACgKAg0/DwALAA0tDQoGACgGAgYtDgYKLQ4FAS0OCgItDgcDLQ4IBCYtDQMGDDgFBgcBKAAFgEcABiQCAAcAAAVjIwAABc8tDQEHLQ0CCC0NAwktDQQKACgIAgwAOAwFDS0NDQsAKAcCDQA4DQUOLQ0ODAA4CwwNLgQACIADKACABAQABSUAAAcTLgiABQALACgLAgwAOAwFDi0ODQ4tDgcBLQ4LAi0OCQMtDgoEIwAABc8tDAYFIwAABNUqAQABBQLcbieAdhKdPAEBAiYlAAAEnC0NAwYtDQQHCygAB4BEAAgkAgAIAAAGECcCCQQAPAkBCQsoAAaAQwAHJAIABwAABp8jAAAGJS0NAQYtDQIHLQ0DCC0NBAkNKAAIgEMACiQCAAoAAAZKJQAAB6EuBAAGgAMoAIAEBAAEJQAABxMuCIAFAAoAKAoCCwA4CwgMLQ4FDAEoAAiARwAFDjgIBQYkAgAGAAAGiiUAAAezLQ4KAS0OBwItDgUDLQ4JBCMAAAcSJwIGBActCAAHLQwBCC0MAgktDAMKLQwECwAQAAYAJQAABMUtBAAALQ0BBi0NAgctDQQILgQABoADKACABAQABCUAAAcTLgiABQAJACgJAgoBKAAKgEUACy0OBQstDgkBLQ4HAi4KgEcAAy0OCAQjAAAHEiYuAYADgAYLAIAGAAKAByQAgAcAAAcuIwAABzkuAIADgAUjAAAHoC4AAAGABQEAAAGABAABAQCAA4AEgAkuAIADgAouAIAFgAsLAIAKgAmADCQAgAwAAAeMLgGACoAILgKACIALAQCACgACgAoBAIALAAKACyMAAAdbKAGABQQAAQMAgAYAAoAGIwAAB6AmKgEAAQXFa8RaDhAAAjwBAQImKgEAAQVFp8pxGUHkFTwBAQIm",
|
|
118
|
+
"debug_symbols": "7Z3dbts4EIXfxde5IDnDv77KYlEkaVoYMJIiSRdYFH33tbOR7ISUaM8IrlOem6Cq54jjzyRnSFHkz9WXu5sf3z6v778+PK0+/fVztXm4vX5eP9xvr37+ulrdPK43m/W3z4f/vTK7P9bRi+Dp+/X97vrp+frxefXJepuvVnf3X3b/pLi9xdf15m71yZtfV4UxJ+JXY07sRuOQK8bJR/dqnHyKh8Z/X23dSVV3ONvRHZvm3bEm0GBsLY3GNlDNOoXBOO9vTM6/uEN0We7Ei3KH3WW5c1l0/GXR8ZdFJ9jLcsdflDvRXJY7fG53/OCOM+6NO6VtzOxfjWPO+zu7lCrWFM0Qq4j3tjWXnbPDjZ0jmjf2HF9tPadD0xd+Gfw0/BKBn4pfAj8Nv4z6p+OH+qfh5wzqn45fBD8NP2vBT8UvgJ+GnzPgp+LnwU/FD+O3Jr80sPDJvedHyF90/JA/q/idf6L6w/ELo214a7rjF9B+dfww/lDxi2i/On6ofyp+CfVPxw/1T8UvY/5Fxw/jXw0/Mph/0fFj8FPxw/yLip/F+E3HD/MvKn4O+XMFCh4KlVAImW4FCtLXChTkBCUUZkApoSB6l1A8QnIFCuapSigBIbkCBSG5hBIxTVSBgpBcgYKQXELBWw41KEjzSyh4H6EGBX1KAYV7XTnr91BCeA+l0+V0kQdbF73ceEew0wV1pxC0IQ27Itho3i9JZN9nw1ySIFqxkmCnyzqXJNjnhNFJBGMe3qywyRaxuNOlnUsS7PM54oIEE2KxliCDoJIgshklwYxIoiWIbEZH0BvUQS1BZDNKghbZjJYgg6CSILIZJcFOl8wuSRCRREmQEEm0BFEHmwQzjd8vc0Gw0xWtSxJcIBbblAZjx75B0Ps8OO+zP7A2sWId8rDTeDxoP7s775z39IGdX2Ll5O9zPn9g549YdMe0aK8xt3+yP2K52zndOWKh2VnduSw6+bLo5IuiE46Y4TqrO+Gi3Dlio8yzuuPP7c4fte9fsBn8NPwcg5+KH+qfih+h/un4of6p+DGBn4pfBD8NP+/AT8UvgJ+GX7Dgp+KH8Ztm3+cQkL+o+J1/GvUP45fAr8Fvbt+wkJC/6Pghf1bxy6h/On6ofxp+0aD+6fhh/Kbid8RSYvCb44fxm44fxm8qfnj+puSH8ZuKH+H5h44f8ucSCmNSuQIFmW4JxSN9rUBhQCmhINEsoQRE7woUhOQSSsQ8VQUKQnIJJSEkV6BgmqgCBSG5hJIRkitQMEtTQEmGAaWEgppSQrHoU0oo1GmeMrdvduI+m89y+2anThdkL7fjbgp9NswlCaIVKwnGPiPmkgT7nEVbbmeh1OnS2CUJ9jk/tyDBjFisJcggqCSIbEZHMHe6yHhJgshmlAQt6qCWILIZJUGHbEZLkEFQSRDZjJIgIZJoCSKSKAkyIomWIOqgbtfn3Oky3yUJLhCLpRsgh+T2ztc3QI5h8CPG/cYxNroX55dYu/vbnI/2IzufP7DzR5zjF1rOsxmN2cU3RZTWycShDSaT9rcOuWLM4zMlzvsbE9P/vuez+05h9N2ned9jonHD8u3E+byxtZz82PV6Fw7Nt9/VGtPn6khyQ9bgiPy7HtuaIw5u6pEK6kqFiuvzIT5ZGqm4UFLpcwKiQaXTSYUWlT4HaQ0qnQ7+W1Q6jcwNKuhtK1Q6XSTbotLnQ+YGlYC6UqES+9wiY57KdiDU5VGC8+Mg2+mB2w0qFnWlRsX3SWW+X3F9HpPbosKgUqHS58HoDSrU52HnLSqdRuZ5KozetkYFvW2NSgaVkopHXalQCQQqBRVX34E0hqGAGLjQ1BfO5JFNjmU59XmchiacrolGoKm3FzMuNbIm5VKVJaqJo7lbqiRRZVFZWVIWGRKpRGVZUVlW8nuRE5XlRN9rIktuqYJENZFltVQsUuWT+xjyVe7ZDb1k5orm9H6J6q14vpwk8K1+Us+8JluBxp/MgI0RaCTl1FmnoR68CXyvmvqKn4ZGUE69nR98n5rm9PrG9ROL5zX1DbEbmtNjJ3sn0MTTNYJcgAW5AAtyAY6C3yeeXg+8KBp5UTTyrv5kcTtOGJPZ6AoVeYlq4kTklipJVBPPkW0a8u7tzG1JY2pzF3ewMrQsa2pDk3lVsiKVF6myRJUl3ysYiYdh4rQhz+Ov7KMtVUGimmgpLVWSqCZOoW+pskTForIm2pfP43A22CK+TZ2O3FBNnAncUmWJamLk1lKJaExsyNNSiRjWs7htrj+qyBftK9bzuKaKRaokUU1sA9BSBYnKiWg4EXkSlUUi8iQizyLyE6/pURhfX6FU9DZxIi63VFmiCixRRSNSeYlqYsanpZLE5ZitSCWJ5smcXNav7dU/14/r65vN3dNWs/vwx/3t8/rh/vXy+d/vwyc3j+vNZv3t8/fHh9u7Lz8e7z5vHm53n63M65+/aJthU+KdN7tLR/nK8cvlzjVK6Yqy2Za6Lfk/",
|
|
119
|
+
"brillig_names": [
|
|
120
|
+
"set_authorized"
|
|
121
|
+
]
|
|
122
|
+
},
|
|
74
123
|
{
|
|
75
124
|
"name": "public_dispatch",
|
|
76
125
|
"is_unconstrained": true,
|
|
@@ -143,7 +192,7 @@
|
|
|
143
192
|
]
|
|
144
193
|
},
|
|
145
194
|
{
|
|
146
|
-
"name": "
|
|
195
|
+
"name": "set_reject_all",
|
|
147
196
|
"is_unconstrained": true,
|
|
148
197
|
"custom_attributes": [
|
|
149
198
|
"public"
|
|
@@ -151,52 +200,23 @@
|
|
|
151
200
|
"abi": {
|
|
152
201
|
"parameters": [
|
|
153
202
|
{
|
|
154
|
-
"name": "
|
|
155
|
-
"type": {
|
|
156
|
-
"kind": "struct",
|
|
157
|
-
"path": "authwit::aztec::protocol_types::address::aztec_address::AztecAddress",
|
|
158
|
-
"fields": [
|
|
159
|
-
{
|
|
160
|
-
"name": "inner",
|
|
161
|
-
"type": {
|
|
162
|
-
"kind": "field"
|
|
163
|
-
}
|
|
164
|
-
}
|
|
165
|
-
]
|
|
166
|
-
},
|
|
167
|
-
"visibility": "private"
|
|
168
|
-
},
|
|
169
|
-
{
|
|
170
|
-
"name": "inner_hash",
|
|
203
|
+
"name": "reject",
|
|
171
204
|
"type": {
|
|
172
|
-
"kind": "
|
|
205
|
+
"kind": "boolean"
|
|
173
206
|
},
|
|
174
207
|
"visibility": "private"
|
|
175
208
|
}
|
|
176
209
|
],
|
|
177
|
-
"return_type":
|
|
178
|
-
"abi_type": {
|
|
179
|
-
"kind": "field"
|
|
180
|
-
},
|
|
181
|
-
"visibility": "public"
|
|
182
|
-
},
|
|
210
|
+
"return_type": null,
|
|
183
211
|
"error_types": {
|
|
184
212
|
"206160798890201757": {
|
|
185
213
|
"error_kind": "string",
|
|
186
214
|
"string": "Storage slot 0 not allowed. Storage slots must start from 1."
|
|
187
215
|
},
|
|
188
|
-
"715723737710351018": {
|
|
189
|
-
"error_kind": "string",
|
|
190
|
-
"string": "rejecting all"
|
|
191
|
-
},
|
|
192
216
|
"5019202896831570965": {
|
|
193
217
|
"error_kind": "string",
|
|
194
218
|
"string": "attempt to add with overflow"
|
|
195
219
|
},
|
|
196
|
-
"12737498021964987455": {
|
|
197
|
-
"error_kind": "string",
|
|
198
|
-
"string": "unauthorized"
|
|
199
|
-
},
|
|
200
220
|
"14225679739041873922": {
|
|
201
221
|
"error_kind": "string",
|
|
202
222
|
"string": "Index out of bounds"
|
|
@@ -207,23 +227,23 @@
|
|
|
207
227
|
}
|
|
208
228
|
}
|
|
209
229
|
},
|
|
210
|
-
"bytecode": "
|
|
211
|
-
"debug_symbols": "
|
|
230
|
+
"bytecode": "JwACBAEoAAABBIBIJwAABAMnAgIEAScCAwQAHxgAAwACgEcdAIBHgEcBLgiARwABJQAAAEwlAAAAaSgCAAEEgEgnAgIEADsNAAEAAigAgEMEAAMoAIBEAQAAKACARQQAACgAgEYEAAEmJQAAAi4eAgACAScCAwAALQgBBCcCBQQEABABBQEnAwQEAQAoBAIFLQwFBi0OAwYAKAYCBi0OAwYAKAYCBi0OAwYtDQQFACgFAgUtDgUEKwIABQAAAAAAAAAAAgAAAAAAAAAALQgBBicCBwQFABABBwEnAwYEAQAoBgIHLQwHCC0OAwgAKAgCCC0OAwgAKAgCCC0OAwgAKAgCCC0OBQgtDQQFACgFAgUtDgUELQ0GBQAoBQIFLQ4FBi0IAQUAAAECAS0OBAUtCAEEAAABAgEtDgYELQgBBgAAAQIBLgqARQAGLQgBBwAAAQIBLgqARAAHJwIIAAEnAgkECi0IAAotDAULLQwEDC0MBg0tDAcOLQwIDwAQAAkAJQAAAlctBAAAJwIIBAktCAAJLQwFCi0MBAstDAYMLQwHDS0MAg4AEAAIACUAAAJXLQQAAC0NBwILKAACgEQACCQCAAgAAAHRJwIJBAA8CQEJJwICBAgtCAAILQwFCS0MBAotDAYLLQwHDAAQAAIAJQAAA4UtBAAALQ0EAgEoAAKARgAFLQ0FBAo4BAMCCygAAoBEAAMkAgADAAACIiUAAASYHAwBAgAwDAACAAQmKACABAR4AA0AAACABIADJACAAwAAAlYqAQABBfeh86+lrdTKPAEBAiYlAAACLi0NAwYtDQQHCygAB4BEAAgkAgAIAAACfScCCQQAPAkBCQsoAAaAQwAHJAIABwAAAxEjAAACki0NAQYtDQIHLQ0DCC0NBAkNKAAIgEMACicCCwEBJAIACgAAArwlAAAEqi4EAAaAAygAgAQEAAQlAAAEvC4IgAUACgAoCgILADgLCAwtDgUMASgACIBGAAUOOAgFBiQCAAYAAAL8JQAABUotDgoBLQ4HAi0OBQMtDgkEIwAAA4QnAgYEBy0IAActDAEILQwCCS0MAwotDAQLABAABgAlAAADhS0EAAAtDQEGLQ0CBy0NBAguBAAGgAMoAIAEBAAEJQAABLwuCIAFAAkAKAkCCgEoAAqARQALLQ4FCy0OCQEtDgcCLgqARgADLQ4IBCMAAAOEJiUAAAIuLgiARQAFIwAAA5UNKAAFgEMABiQCAAYAAAQFIwAAA6otDQEFLQ0CBi0NAwctDQQIJwIJBAQtCAEKJwILBAUAEAELAScDCgQBACgGAgsnAgwEBAAoCgINPw8ACwANLQ0KBgAoBgIGLQ4GCi0OBQEtDgoCLQ4HAy0OCAQmLQ0DBgw4BQYHASgABYBGAAYkAgAHAAAEIyMAAASPLQ0BBy0NAggtDQMJLQ0ECgAoCAIMADgMBQ0tDQ0LACgHAg0AOA0FDi0NDgwAOAsMDS4EAAiAAygAgAQEAAUlAAAEvC4IgAUACwAoCwIMADgMBQ4tDg0OLQ4HAS0OCwItDgkDLQ4KBCMAAASPLQwGBSMAAAOVKgEAAQUC3G4ngHYSnTwBAQImKgEAAQXFa8RaDhAAAjwBAQImLgGAA4AGCwCABgACgAckAIAHAAAE1yMAAATiLgCAA4AFIwAABUkuAAABgAUBAAABgAQAAQEAgAOABIAJLgCAA4AKLgCABYALCwCACoAJgAwkAIAMAAAFNS4BgAqACC4CgAiACwEAgAoAAoAKAQCACwACgAsjAAAFBCgBgAUEAAEDAIAGAAKABiMAAAVJJioBAAEFRafKcRlB5BU8AQECJg==",
|
|
231
|
+
"debug_symbols": "7Z3Rbts6DIbfJde5ECVKovoqBwdD2qZDgCAt0nbAUPTd52Sxk0aUBVPBhsG8GZaWv0V/lUWKjqSPxeP6/v37t83u6fl1cfffx2L7/LB62zzvuk8fn8vF/X6z3W6+f7v88cIc/gEwR8Hry2p3+Pz6ttq/Le4gmbBcrHePh/9a7C7xtNmuF3fefC4zYySHJ2MktINxSIwx+WhPxuQpXhr/v+zc8aw7RDi4Y/y4O2CC640B3GAMwXHWvr9Ra86uO+sZ25jQn4xjSucrWyLG2kXTU3FngpZz2VroL2ytc+PGHuPJ1iNdmh74WaP8mvih8mvil5RfCz+n/a+Nn/a/Jn6o/a+NHym/Fn7eKr8mflH5tfALoPya+AXl18Iv6vytyo+g50c244fKr4mf5s9N/Mgpvwq/MNiGr6YdP2v0+W3jp/OPJn6gz28bP+1/Tfys9r82ftr/mvg5rb+08dP5bxM/1PpLGz99f97Ez2v9pY0fKr8mflp/aeIXNH9moOhLoRxK1EyXgaLpaw6FNCdgoGiiyUDR6J1DSRqSGShap8qgOKMhmYGiITmHAlomYqBoSGagaEjOoegqBwaK0zSfgaI9hYGiY0oOZaZvHhz0LnfvTsM1lJm+TqhA0Z7CQJnnmDIOZabV/AqUeVbzx6HEeU4IK1B0oGWg6ECbQyFUKDkU7Sk5lJlW8ytQ5lnNH4WCM63mV6DMs5o/DgV0lsxA0ZDMQNGBNodidaBloOgsOYcy09UdFSjzDMkRe1sbvdz4QBDnGb+nEIRwhhGNzQjOM67dkKDXp7iR4Ey3vrklwXnWWycRjKnf/QYIslg80+1vbkkQlWAjQY3FjQRpntOMWxLUbKaRYNJI0kpQs5k2gt5oH2wliEqwkaBmM1WCyQ33lzAjCBqLGwne4lCKzro3tugrBL1PvfOBLo4vARM5hqHf0DHG84asEO1v5/0/7Lxz/7Dzt9gL6O85Xx81Lr5DzzuPpm8BuvdZX5rIrcnE/hkkQ+dLs6fw4OAGpvOFHbqj7x7+uO8uDL57Gvc9kks9eEpm3BgAyQ9Dr794+/P7wKFQyDDMMPqBoXQ1oIVCUB0XAT8rBj9QPcL5KioMnRURCUSFoaIi4t+yAg2nR1mTgfC8e2gvekzWUrASURCICjXIiggFIpLcE0WBqDCXGxXFwvTF49AjfIRMFASiwq6rFREJRIWVjxVREoicpCVXuKc0pFcBrldexUKoGRcVxviKKAlEASUiCYjClj4VkYReYfcTd06Dnc+ep0JJqiJCiYimi6jwfc2KKAhEYCQiAXKykpYsSkQS5E6CvPB9FReGTNfR9cBCaCWiJBAVdgAcFwUjEXmBKDqJSBBziUAiEgRqSoKWErD3FEOfwnbj9rWEj05pqG2keD31T3y/G5eEyRJ+me24RJD3p0L8GxcVFjFWRIIZRoqSlqKkJZK0RJKWkqSlJPg7gTFOpCKJqjAZrKmCRFUIgjUVilRp6qgChp95JtvP2xMymslDERj+6R1vJwh84xfojmv49asVjZ/OgIxAI2mHZ019P/hSqz5p+FS3opneDvDP+cX9cJrp/Q34FRzjGgsCTZiucVagidM1KGgHBfczPQM4VLYEmon94LP79GO136zut+vTYexP77uHi7PZ336+rK+OaX/ZPz+sH9/368OB7eez2g+3aLvh1wY49v3uY/fHX3Z1uaNrh98G2/0Wu1a7ln8B",
|
|
212
232
|
"brillig_names": [
|
|
213
|
-
"
|
|
233
|
+
"set_reject_all"
|
|
214
234
|
]
|
|
215
235
|
},
|
|
216
236
|
{
|
|
217
|
-
"name": "
|
|
237
|
+
"name": "_set_authorized",
|
|
218
238
|
"is_unconstrained": true,
|
|
219
239
|
"custom_attributes": [
|
|
220
240
|
"public",
|
|
221
|
-
"
|
|
241
|
+
"internal"
|
|
222
242
|
],
|
|
223
243
|
"abi": {
|
|
224
244
|
"parameters": [
|
|
225
245
|
{
|
|
226
|
-
"name": "
|
|
246
|
+
"name": "approver",
|
|
227
247
|
"type": {
|
|
228
248
|
"kind": "struct",
|
|
229
249
|
"path": "authwit::aztec::protocol_types::address::aztec_address::AztecAddress",
|
|
@@ -237,14 +257,23 @@
|
|
|
237
257
|
]
|
|
238
258
|
},
|
|
239
259
|
"visibility": "private"
|
|
260
|
+
},
|
|
261
|
+
{
|
|
262
|
+
"name": "message_hash",
|
|
263
|
+
"type": {
|
|
264
|
+
"kind": "field"
|
|
265
|
+
},
|
|
266
|
+
"visibility": "private"
|
|
267
|
+
},
|
|
268
|
+
{
|
|
269
|
+
"name": "authorize",
|
|
270
|
+
"type": {
|
|
271
|
+
"kind": "boolean"
|
|
272
|
+
},
|
|
273
|
+
"visibility": "private"
|
|
240
274
|
}
|
|
241
275
|
],
|
|
242
|
-
"return_type":
|
|
243
|
-
"abi_type": {
|
|
244
|
-
"kind": "boolean"
|
|
245
|
-
},
|
|
246
|
-
"visibility": "public"
|
|
247
|
-
},
|
|
276
|
+
"return_type": null,
|
|
248
277
|
"error_types": {
|
|
249
278
|
"206160798890201757": {
|
|
250
279
|
"error_kind": "string",
|
|
@@ -254,9 +283,9 @@
|
|
|
254
283
|
"error_kind": "string",
|
|
255
284
|
"string": "attempt to add with overflow"
|
|
256
285
|
},
|
|
257
|
-
"
|
|
286
|
+
"6304245522015439386": {
|
|
258
287
|
"error_kind": "string",
|
|
259
|
-
"string": "Function
|
|
288
|
+
"string": "Function _set_authorized can only be called internally"
|
|
260
289
|
},
|
|
261
290
|
"14225679739041873922": {
|
|
262
291
|
"error_kind": "string",
|
|
@@ -268,51 +297,44 @@
|
|
|
268
297
|
}
|
|
269
298
|
}
|
|
270
299
|
},
|
|
271
|
-
"bytecode": "
|
|
272
|
-
"debug_symbols": "
|
|
273
|
-
"brillig_names": [
|
|
274
|
-
"is_reject_all"
|
|
275
|
-
]
|
|
276
|
-
},
|
|
277
|
-
{
|
|
278
|
-
"name": "sync_notes",
|
|
279
|
-
"is_unconstrained": true,
|
|
280
|
-
"custom_attributes": [
|
|
281
|
-
"aztec::macros::functions::utility"
|
|
282
|
-
],
|
|
283
|
-
"abi": {
|
|
284
|
-
"parameters": [],
|
|
285
|
-
"return_type": null,
|
|
286
|
-
"error_types": {
|
|
287
|
-
"17843811134343075018": {
|
|
288
|
-
"error_kind": "string",
|
|
289
|
-
"string": "Stack too deep"
|
|
290
|
-
}
|
|
291
|
-
}
|
|
292
|
-
},
|
|
293
|
-
"bytecode": "H4sIAAAAAAAA/7WTPQ+CMBCGi2KUjzjgoD+jBAyM+LG4OLpXCkpUSAB3frqQXENtwKjAJU17FJ5736OVUB0SzDLqEAyyglmBecTtj8vhQY67hakIdfvku9i2lQZ/Peq3FGBKw/Ax4w/UfzwFzr6o+bwXVndWDo1b66g+H0P5Z/9vSP+LD5418GpAXnmew/oS5Nt74t+Oz8c5SNnXTR1EgnIxdK5CSd0lcZ4SP99QmgZZJhJGDWTUQlU56pVE8YG26fmRdgrSLEpikSZ/Sav6yu6lXLyr8eA57hCOizHTMAb+BDV3X+b2+feXkKuCJ+bT+1Nn6BAztEhI1oRS2yeGwK+CP38vlizs4eEFAAA=",
|
|
294
|
-
"debug_symbols": "rZLdCoMgGIbvxeMO/P/ZrYwxrCwEsbAajOjeZ2EsarSTTj789OHjUd8RlCYf6qf1VdOB230Eril0bxsfu3HKQB6sc7Z+brcBnAsiC9+12s9t1+vQgxuCFMkMGF8uayHijMo6s3RTduCF5ImW83liBfqBMswSyhj8jqV8emQA0StsJBGrDVPnNpSohFIuDzbsEhtJVxslz204XN+GY36w4VfYKIwTrQj7YyNhQgXc/dQU25cOVufOpIhVgy82ievfrdmFrw1NYcohmDmGmwTGeo93wCSOjaM/",
|
|
300
|
+
"bytecode": "JwACBAEoAAABBIBLJwAABAMnAgQEAycCBQQAHxgABQAEgEgdAIBKgEoBLgiASAABLgiASQACLgiASgADJQAAAFglAAAAfCgCAAEEgEsnAgIEADsNAAEAAigAgEMEAAMoAIBEAQAAKACARQQAACgAgEYBAAEoAIBHBAABJiUAAAS5HgIABQEeAgAGAAo4BQYHJAIABwAAAJ0lAAAE4icCBQACLQgBBicCBwQDABABBwEnAwYEAQAoBgIHLQwHCC0OBQgAKAgCCC0OAQgnAgEAAC0IAQUnAgcEBAAQAQcBJwMFBAEAKAUCBy0MBwgtDgEIACgIAggtDgEIACgIAggtDgEILQ0FBwAoBwIHLQ4HBSsCAAcAAAAAAAAAAAIAAAAAAAAAAC0IAQgnAgkEBQAQAQkBJwMIBAEAKAgCCS0MCQotDgEKACgKAgotDgEKACgKAgotDgEKACgKAgotDgcKLQ0FCQAoCQIJLQ4JBS0NCAkAKAkCCS0OCQgtCAEJAAABAgEtDgUJLQgBBQAAAQIBLQ4IBS0IAQgAAAECAS4KgEUACC0IAQoAAAECAS4KgEQACicCCwQCLgiARQAEIwAAAcEMOAQLDCQCAAwAAARdIwAAAdMtDQoGCygABoBEAAwkAgAMAAAB8CcCDQQAPAkBDScCBgQMLQgADC0MCQ0tDAUOLQwIDy0MChAAEAAGACUAAAT0LQQAAC0NCQYtDQUMLQ0IDS0OBgktDgwFLQ4NCC4KgEYACgEoAAyARwAGLQ0GBQo4BQEGCygABoBEAAgkAgAIAAACWyUAAAYHLQgBBicCCAQDABABCAEnAwYEAQAoBgIILQwICS0OBQkAKAkCCS0OAgktCAECJwIFBAQAEAEFAScDAgQBACgCAgUtDAUILQ4BCAAoCAIILQ4BCAAoCAIILQ4BCC0NAgUAKAUCBS0OBQItCAEFJwIIBAUAEAEIAScDBQQBACgFAggtDAgJLQ4BCQAoCQIJLQ4BCQAoCQIJLQ4BCQAoCQIJLQ4HCS0NAgcAKAcCBy0OBwItDQUHACgHAgctDgcFLQgBBwAAAQIBLQ4CBy0IAQIAAAECAS0OBQItCAEFAAABAgEuCoBFAAUtCAEIAAABAgEuCoBEAAguCIBFAAQjAAADWww4BAsJJAIACQAABAEjAAADbS0NCAQLKAAEgEQABiQCAAYAAAOKJwIJBAA8CQEJJwIEBAktCAAJLQwHCi0MAgstDAUMLQwIDQAQAAQAJQAABPQtBAAALQ0HBC0NAgYtDQUJLQ4EBy0OBgItDgkFLgqARgAIASgABoBHAAQtDQQCCjgCAQQLKAAEgEQAASQCAAEAAAP1JQAABgccDAMBADAMAAEAAiYkAgAJAAAEDiMAAARMACgGAgoAOAoEDC0NDAknAgoEDC0IAAwtDAcNLQwCDi0MBQ8tDAgQLQwJEQAQAAoAJQAABhktBAAAIwAABEwBKAAEgEcACS0MCQQjAAADWyQCAAwAAARqIwAABKgAKAYCDQA4DQQOLQ0ODCcCDQQOLQgADi0MCQ8tDAUQLQwIES0MChItDAwTABAADQAlAAAGGS0EAAAjAAAEqAEoAASARwAMLQwMBCMAAAHBKACABAR4AA0AAACABIADJACAAwAABOEqAQABBfeh86+lrdTKPAEBAiYqAQABBVd9Leakk8oaPAEBAiYlAAAEuS4IgEUABSMAAAUEDSgABYBDAAYkAgAGAAAFdCMAAAUZLQ0BBS0NAgYtDQMHLQ0ECCcCCQQELQgBCicCCwQFABABCwEnAwoEAQAoBgILJwIMBAQAKAoCDT8PAAsADS0NCgYAKAYCBi0OBgotDgUBLQ4KAi0OBwMtDggEJi0NAwYMOAUGBwEoAAWARwAGJAIABwAABZIjAAAF/i0NAQctDQIILQ0DCS0NBAoAKAgCDAA4DAUNLQ0NCwAoBwINADgNBQ4tDQ4MADgLDA0uBAAIgAMoAIAEBAAFJQAAB0IuCIAFAAsAKAsCDAA4DAUOLQ4NDi0OBwEtDgsCLQ4JAy0OCgQjAAAF/i0MBgUjAAAFBCoBAAEFAtxuJ4B2Ep08AQECJiUAAAS5LQ0DBi0NBAcLKAAHgEQACCQCAAgAAAY/JwIJBAA8CQEJCygABoBDAAckAgAHAAAGziMAAAZULQ0BBi0NAgctDQMILQ0ECQ0oAAiAQwAKJAIACgAABnklAAAH0C4EAAaAAygAgAQEAAQlAAAHQi4IgAUACgAoCgILADgLCAwtDgUMASgACIBHAAUOOAgFBiQCAAYAAAa5JQAAB+ItDgoBLQ4HAi0OBQMtDgkEIwAAB0EnAgYEBy0IAActDAEILQwCCS0MAwotDAQLABAABgAlAAAE9C0EAAAtDQEGLQ0CBy0NBAguBAAGgAMoAIAEBAAEJQAAB0IuCIAFAAkAKAkCCgEoAAqARQALLQ4FCy0OCQEtDgcCLgqARwADLQ4IBCMAAAdBJi4BgAOABgsAgAYAAoAHJACABwAAB10jAAAHaC4AgAOABSMAAAfPLgAAAYAFAQAAAYAEAAEBAIADgASACS4AgAOACi4AgAWACwsAgAqACYAMJACADAAAB7suAYAKgAguAoAIgAsBAIAKAAKACgEAgAsAAoALIwAAB4ooAYAFBAABAwCABgACgAYjAAAHzyYqAQABBcVrxFoOEAACPAEBAiYqAQABBUWnynEZQeQVPAEBAiY=",
|
|
301
|
+
"debug_symbols": "7Z3fThs7EMbfJddc+L/HfZXqCAGlVaQIKqBHOqp497NB2U3AkziZWaWh/m5Qt/G3nvxie8azXvv34tv97a8f18uH74/Piy9ffy9Wj3c3L8vHh+Hq9+vV4vZpuVotf1zv/vfCrP9YV94Ezz9vHtbXzy83Ty+LL9aWQleL+4dvw7+dsWm4yffl6n64MuH1qiofyIdN8UDBTaVTYQpTzG5TmCLl3cL/XC2sD6xFzji3tWinjj0WpWRHi1I2LYtMnCxytrLoGEYhvLNorQtBpotOqMucLkSbRhIx+EkVDUPCmuTHOqzdFrbJc6VpvLMtNJX1Lr6Zk9xlmZMuypxsL8ucy6JDl0WHLotOMZdlTrgsc8olmeOMP7c5cbzz4DPfmVOXzSWMni+Xsr2zI2JK+2xGm/3W/TjOZOfseGPnvD9cOIa8KRsD7RZ940fgp+FnHfip+GXw0/BzaH86fmh/Kn4e7U/HL4Gfhl8w4KfiF8FPxa+An4ZfDOCn4of5W5MfjbnqSO4jv4T4RccP8bOK3/kT1Z+OX5rKpvdF1/wK+q+OH+YfGn7eoP/q+KH9qfhZtD8dP7Q/FT+H/IuOXwA/FT/kX1T8PJ6f6/gh/6LiFzB/0/FD/kXFLyJ+ZqDgoVANJSHSZaAEQKmhICaooWQEmgwUeO8aCsElM1CQp6qhFLhkBgpcMgMFaaIKSsC7ExwUuOQaCt5y4KAgzK+h4H0EDgrGlBpKrytn4xZKSh+hdLqcLoexrMtRXnhNsNMFdacQtInG/SRsNq4i2GfHnJEgoRcrCXa6rHNOgn0mjE4imMv4ZoUl+9EXx06Xds5JsM/niHMShC9WErR9JrnmJIhoRknQwZNoCSKaURL0aINagohmtAQRzSgJBkQzWoKIZpQEO10yOydBeBItQXgSJcGENtgkWPz0/UqoCHa6onVOgjP4YkvbbbtDbBAcxo3R+FjiTmmTmdKplBHh7h7tw53XxpP7xMbPsXLyzxlPn9f4dMSiu5hmHTUO7Z+cjljudk5zjlhodlZzLouOuyw67rLoHJHhOqs58aLMOWKjzLOaE85tzl+1718KBH4aftGDn4of2p+KX0L70/FD+1Pxyw78VPwS+Gn4kQU/Fb8Ifhp+xYCfil8Avxa/A/s+p4L4RcMvG8TPOn4Z/Br8Du0bli3iFx0/xM8qfg7tT8cP7U/Fz6P96fhh/qbjV8BPww/P35T8MH9T8cPzNyU/zN9U/BKef+j4IX6uoWQklRkoiHQZKAhfayiEmICBgkCzhlLgvRkocMkVFDLIUzFQ4JIZKHDJNRQbAKWGApdcQ3FwyQwUZGlqKB5hPgMFLaWGEjCm1FBip3HKoX2zKffZfebbN5s6XZA93467RH12zBkJFvRiHcFi+vSYcxLsM4s2385CpdOlsXMS7DM/NydB+GIlQdfnLH1OgohmlAQ7XWQ8J0FEM0qCAW1QSxDRjJYgohklwU6XG89JENGMkmCCJ9EShCfREoQnURLsdDnzfLs+l06X+c5JcAZfLN0AOZHbGs9vgJzTuPFEztuNY2x2b8bPsXb3TxlvjTGf2nr6zNYfcZRfblkfzFiFDS6/q6MuTSaP3ZAMbQeDVJjCYXqsFMr2xj74jfF0duN9moyPdNj4TH7atJyKOVzY2kBxGn6jS7vF376s73OFpHdj5OC8jx9GbWtCn46vRQVthaES+3yQ762fqLhUU+kzCdGg0mlioUWlz4lai0qfCYAGldypZ25QwWjLUOl0oWyLSp8PmhtUCtpKTcWaPrfJaFDxMxzJ9tfNg2ynh243qAS0FY5K6JPK4XEl9HlUboNK7PPw1haVPg9Hb1BJfR543qLSqWduUMFoy1Dp9KjsFhUClZoKoa0wVIoDlYqKo8BRyWmsIKeP77kP02zWb5WJTcmp1pTTNfxqhYYmn67hT4IYnquOEIbkXKlVSaLicxRNVZSogqiuIKoriuqKorqSqK4k+r2yqK4s+l78lqYtFT/aN1VZoiqinsJvq3hwjAl8hrO4cZQsgdGcPi4FvhcfrscLbPNBoKHTNfyGP4cZhNPHzBAF9USeNY3t4J3j22j4mWNDI6iH7+c734fTCNob/+yroaHTNcULNKf76GiCQCOoRxALREEsEJ0VaE5vB1HkjaLIG8XM/kZDrmraxeNt/eMHFTmJij8VtKmKIhXvLy2Ncbd1pqKRHG9hcDsrQ12tCiIVSVTeiVRJogqi7xVFFvK50eFHnn7lmG2l4s95b6n29JSWKkpU/JjeVCWJqojq2tO/Ypmms8lW/m3PCaFNFUlUNklUe2ZuLZWIhisSlRcx5KO4YR44qXx0tSpLVNGKVFGkKhLVnhGgpRLRyCLyWVQXiciTiDyJyJc95NP0AosnW6uKQEX8tmEtlbUiVZaonJOo9mR8WiqJXyYviTf2bBLbVJ1c1+tw9e/N0/LmdnX/PGjWH/56uHtZPj5sLl/++zl+cvu0XK2WP65/Pj3e3X/79XR/vXq8W3+2MJs/X322V764tTXrSzf4QBfK+nLdKIa0w/ApDbUONf8P",
|
|
295
302
|
"brillig_names": [
|
|
296
|
-
"
|
|
303
|
+
"_set_authorized"
|
|
297
304
|
]
|
|
298
305
|
},
|
|
299
306
|
{
|
|
300
|
-
"name": "
|
|
307
|
+
"name": "is_reject_all",
|
|
301
308
|
"is_unconstrained": true,
|
|
302
309
|
"custom_attributes": [
|
|
303
|
-
"public"
|
|
310
|
+
"public",
|
|
311
|
+
"view"
|
|
304
312
|
],
|
|
305
313
|
"abi": {
|
|
306
314
|
"parameters": [
|
|
307
315
|
{
|
|
308
|
-
"name": "
|
|
316
|
+
"name": "on_behalf_of",
|
|
309
317
|
"type": {
|
|
310
|
-
"kind": "
|
|
318
|
+
"kind": "struct",
|
|
319
|
+
"path": "authwit::aztec::protocol_types::address::aztec_address::AztecAddress",
|
|
320
|
+
"fields": [
|
|
321
|
+
{
|
|
322
|
+
"name": "inner",
|
|
323
|
+
"type": {
|
|
324
|
+
"kind": "field"
|
|
325
|
+
}
|
|
326
|
+
}
|
|
327
|
+
]
|
|
311
328
|
},
|
|
312
329
|
"visibility": "private"
|
|
313
330
|
}
|
|
314
331
|
],
|
|
315
|
-
"return_type":
|
|
332
|
+
"return_type": {
|
|
333
|
+
"abi_type": {
|
|
334
|
+
"kind": "boolean"
|
|
335
|
+
},
|
|
336
|
+
"visibility": "public"
|
|
337
|
+
},
|
|
316
338
|
"error_types": {
|
|
317
339
|
"206160798890201757": {
|
|
318
340
|
"error_kind": "string",
|
|
@@ -322,6 +344,10 @@
|
|
|
322
344
|
"error_kind": "string",
|
|
323
345
|
"string": "attempt to add with overflow"
|
|
324
346
|
},
|
|
347
|
+
"9474245853673257536": {
|
|
348
|
+
"error_kind": "string",
|
|
349
|
+
"string": "Function is_reject_all can only be called statically"
|
|
350
|
+
},
|
|
325
351
|
"14225679739041873922": {
|
|
326
352
|
"error_kind": "string",
|
|
327
353
|
"string": "Index out of bounds"
|
|
@@ -332,10 +358,10 @@
|
|
|
332
358
|
}
|
|
333
359
|
}
|
|
334
360
|
},
|
|
335
|
-
"bytecode": "
|
|
336
|
-
"debug_symbols": "
|
|
361
|
+
"bytecode": "JwACBAEoAAABBIBJJwAABAMnAgIEAScCAwQAHxgAAwACgEcuCIBHAAElAAAASyUAAABoLgQAAYBIKAIAAgSASCcCAwQBOw0AAgADKACAQwQAAygAgEQBAAAoAIBFBAAAKACARgQAASYlAAACSR4CAAIJJwIDAAEKOAIDBCQCAAQAAACJJQAAAnInAgIAAC0IAQQnAgUEBAAQAQUBJwMEBAEAKAQCBS0MBQYtDgIGACgGAgYtDgIGACgGAgYtDgIGLQ0EBQAoBQIFLQ4FBCsCAAUAAAAAAAAAAAIAAAAAAAAAAC0IAQYnAgcEBQAQAQcBJwMGBAEAKAYCBy0MBwgtDgIIACgIAggtDgIIACgIAggtDgIIACgIAggtDgUILQ0EBQAoBQIFLQ4FBC0NBgUAKAUCBS0OBQYtCAEFAAABAgEtDgQFLQgBBAAAAQIBLQ4GBC0IAQYAAAECAS4KgEUABi0IAQcAAAECAS4KgEQABycCCAQJLQgACS0MBQotDAQLLQwGDC0MBw0tDAMOABAACAAlAAAChC0EAAAnAgMECC0IAAgtDAUJLQwECi0MBgstDAcMLQwBDQAQAAMAJQAAAoQtBAAALQ0HAQsoAAGARAADJAIAAwAAAeInAggEADwJAQgnAgEECC0IAAgtDAUJLQwECi0MBgstDAcMABAAAQAlAAADsi0EAAAtDQQBASgAAYBGAAQtDQQDCjgDAgELKAABgEQAAiQCAAIAAAIzJQAABMUvDAADAAEcDAEDARwMAwIAHAwCAQEmKACABAR4AA0AAACABIADJACAAwAAAnEqAQABBfeh86+lrdTKPAEBAiYqAQABBYN7SGg+6XpAPAEBAiYlAAACSS0NAwYtDQQHCygAB4BEAAgkAgAIAAACqicCCQQAPAkBCQsoAAaAQwAHJAIABwAAAz4jAAACvy0NAQYtDQIHLQ0DCC0NBAkNKAAIgEMACicCCwEBJAIACgAAAuklAAAE1y4EAAaAAygAgAQEAAQlAAAE6S4IgAUACgAoCgILADgLCAwtDgUMASgACIBGAAUOOAgFBiQCAAYAAAMpJQAABXctDgoBLQ4HAi0OBQMtDgkEIwAAA7EnAgYEBy0IAActDAEILQwCCS0MAwotDAQLABAABgAlAAADsi0EAAAtDQEGLQ0CBy0NBAguBAAGgAMoAIAEBAAEJQAABOkuCIAFAAkAKAkCCgEoAAqARQALLQ4FCy0OCQEtDgcCLgqARgADLQ4IBCMAAAOxJiUAAAJJLgiARQAFIwAAA8INKAAFgEMABiQCAAYAAAQyIwAAA9ctDQEFLQ0CBi0NAwctDQQIJwIJBAQtCAEKJwILBAUAEAELAScDCgQBACgGAgsnAgwEBAAoCgINPw8ACwANLQ0KBgAoBgIGLQ4GCi0OBQEtDgoCLQ4HAy0OCAQmLQ0DBgw4BQYHASgABYBGAAYkAgAHAAAEUCMAAAS8LQ0BBy0NAggtDQMJLQ0ECgAoCAIMADgMBQ0tDQ0LACgHAg0AOA0FDi0NDgwAOAsMDS4EAAiAAygAgAQEAAUlAAAE6S4IgAUACwAoCwIMADgMBQ4tDg0OLQ4HAS0OCwItDgkDLQ4KBCMAAAS8LQwGBSMAAAPCKgEAAQUC3G4ngHYSnTwBAQImKgEAAQXFa8RaDhAAAjwBAQImLgGAA4AGCwCABgACgAckAIAHAAAFBCMAAAUPLgCAA4AFIwAABXYuAAABgAUBAAABgAQAAQEAgAOABIAJLgCAA4AKLgCABYALCwCACoAJgAwkAIAMAAAFYi4BgAqACC4CgAiACwEAgAoAAoAKAQCACwACgAsjAAAFMSgBgAUEAAEDAIAGAAKABiMAAAV2JioBAAEFRafKcRlB5BU8AQECJg==",
|
|
362
|
+
"debug_symbols": "7Z3bbts8DMffJde5EKkj9yofPgxpmw4BgrRI2wFD0Xefk8WHRIxVU8EOMG+GeePfon6WRYmKpffFw/ru7dvXze7x6WXx5b/3xfbpfvW6edo1V+8fy8XdfrPdbr59Hf7zwhz+AENHwcvzane4fnld7V8XXwA9wnKx3j0c/+5sc5PHzXbdXBn3sczsY3Ofk3ls7DvrQIwxYcCTMWE6M/5/uQBwn/HIn3l01JFMh8LyLAp1kdO5lOxJ5ujA+KTyhiEIJrTGADB4OMFy1j6cjNFgZ2sPjyl/kOR8+yCJ+jtjSoy1jab12fYuI+cyIrQ3RrR23Ni7eLL1Lg1ND/wcKr8qfkH51fDzoPyq+Gn7q+IXtP3V8dP2V8UvGuVXxc8pvyp+pPxq+CWr/Kr4JeVXw490/lbkl9oUgk+Y8dPxSw0/NDp+ruPnlV+BX+hsw7npgR/q+1vFz+r8o46fvr9V/Jy2vzp+2v6q+Hltf3X8nPKr4qfz3yp+QfMvdfx0/byKX9T8Sx0/nb9V8Uuaf6njp+NnBoouCuVQyCmUHIoOXzMo1uiYgIGiA80cCmj0ZqBoSM6hoOapGCgakhkoGpJzKFbTRAwUDck5FKchmYGiWZocitdhPgNFW0oORT8y4KDMM/pYaF1Gi+ESykyXEwpQ5tmnjENJ85wQFqA4hZJDmeeEcBzKTH83X4CiHW0Gxc30F+4FKNpSciigIZmBMs9sfgHKPBfYx6HgPHO0BSg6S86hWA3JDBTtaBko2tHmUJxTKDkUbSk5FD/PkBxda4vRy42PBOcZv6cQhJBcW79oLr+QdmGece2GBKO+xbUE55lCvSHBNM986ySCkdqNXiBBFouTRpJKgjTPaeMtCWosriU4z2nG7Qh6o6OZWoIaSSoJgo5maglqG6wkiDqaqSWoo5kiQbJd/chlBGf6WcUtCd6gH4SU2hJweEQGS9B7ap0PCftbg4kcw9DuXRhjv/coRDw6f4vDI/6Y87fY+enPOZ/+Yec/sWcP2pLz3bsNTbrprAjGHd/lpmIwhQN1ou38iA5x3LjpsWLoHHGGhubHutJvr2vs64pm3H0f27ODfOpdt84eff/E3up/r+//LvfAL0WC6aIOmIHqVyAJ/FJdScRGHwDv+opfpnIDvyBTEPFrECVREoj4THPT23XvKZpLEJFPKoDrT58adgWtKApE/Cf/JZGXiEggQkmdrhzeNS7id/4siXgQ3nUtwke4FPFnDJVESSDiI1tJRAIR3zeXRJKS0pU6UTesDXD5cVckkIjCdFEyTiIigQisRBQFIhTQS/xOzmD76Yf1mIm8REQCkbMSURSIrrzuBZEERJAgD6KSJMijBHmUIE9XkIduhmETZKIoEPG7cJVENF1ExgtEYCSiJBChIOYSv1t+QWSNRCQpKbB1aqZs3cD68vdVxEcn6nJKFEMmiZMlfDgbl/jpEsG4H8yVAFhSJYkKrEglKgtFZaGoLCsqy4rKcqLn5URleVG9rswKCyp+k4OiyotUojeFHzOPdS+NhuVO2GYGyOWa6X0SAP8Wj5YDZrpvwK9cFjRhuobfr2ycAfrpGisox/KsU9sOzhYLWg1N1zhBOfx7PqgPo/GC9uZpuoY/63NcE0GgidM1fNanoBGUQ4L6kKBd0/Tng2ZiO/horr6v9pvV3XZ9Otv+8W13Pzjq/vXH8/ri1Pvn/dP9+uFtvz6cf98ffX94DdGlJQY69oHNZfMgl4B4rM7hf5sFNozYlNqU/BM=",
|
|
337
363
|
"brillig_names": [
|
|
338
|
-
"
|
|
364
|
+
"is_reject_all"
|
|
339
365
|
]
|
|
340
366
|
},
|
|
341
367
|
{
|
|
@@ -401,6 +427,28 @@
|
|
|
401
427
|
"utility_is_consumable"
|
|
402
428
|
]
|
|
403
429
|
},
|
|
430
|
+
{
|
|
431
|
+
"name": "sync_notes",
|
|
432
|
+
"is_unconstrained": true,
|
|
433
|
+
"custom_attributes": [
|
|
434
|
+
"aztec::macros::functions::utility"
|
|
435
|
+
],
|
|
436
|
+
"abi": {
|
|
437
|
+
"parameters": [],
|
|
438
|
+
"return_type": null,
|
|
439
|
+
"error_types": {
|
|
440
|
+
"17843811134343075018": {
|
|
441
|
+
"error_kind": "string",
|
|
442
|
+
"string": "Stack too deep"
|
|
443
|
+
}
|
|
444
|
+
}
|
|
445
|
+
},
|
|
446
|
+
"bytecode": "H4sIAAAAAAAA/7WTPQ+CMBCGi2KUjzjgoD+jBAyM+LG4OLpXCkpUSAB3frqQXENtwKjAJU17FJ5736OVUB0SzDLqEAyyglmBecTtj8vhQY67hakIdfvku9i2lQZ/Peq3FGBKw/Ax4w/UfzwFzr6o+bwXVndWDo1b66g+H0P5Z/9vSP+LD5418GpAXnmew/oS5Nt74t+Oz8c5SNnXTR1EgnIxdK5CSd0lcZ4SP99QmgZZJhJGDWTUQlU56pVE8YG26fmRdgrSLEpikSZ/Sav6yu6lXLyr8eA57hCOizHTMAb+BDV3X+b2+feXkKuCJ+bT+1Nn6BAztEhI1oRS2yeGwK+CP38vlizs4eEFAAA=",
|
|
447
|
+
"debug_symbols": "rZLdCoMgGIbvxeMO/P/ZrYwxrCwEsbAajOjeZ2EsarSTTj789OHjUd8RlCYf6qf1VdOB230Eril0bxsfu3HKQB6sc7Z+brcBnAsiC9+12s9t1+vQgxuCFMkMGF8uayHijMo6s3RTduCF5ImW83liBfqBMswSyhj8jqV8emQA0StsJBGrDVPnNpSohFIuDzbsEhtJVxslz204XN+GY36w4VfYKIwTrQj7YyNhQgXc/dQU25cOVufOpIhVgy82ievfrdmFrw1NYcohmDmGmwTGeo93wCSOjaM/",
|
|
448
|
+
"brillig_names": [
|
|
449
|
+
"sync_notes"
|
|
450
|
+
]
|
|
451
|
+
},
|
|
404
452
|
{
|
|
405
453
|
"name": "set_authorized_private",
|
|
406
454
|
"is_unconstrained": false,
|
|
@@ -2025,7 +2073,7 @@
|
|
|
2025
2073
|
"verification_key": "AAAAAAAEAAAAAAAAAAAAEgAAAAAAAAAQAAAAAAAAVgkBAAAAAAAAAAEAAAACAAAAAwAAAAQAAAAFAAAABgAAAAcAAAAIAAAACQAAAAoAAAALAAAADAAAAA0AAAAOAAAADwAAAAAAAAAAAAAAJ8TdMlWfOU2ViCHv8uyUZDcwcOkGqbx/YtzeHKJHf1ouMScmMX4zhaUAnJHLB6OUQpGRV+QgYa/mcymkFrqwxx2q85MF+Z6/Xgnw3b4PKECpeJThizYBTlE+ut7Nhl5LMDtNbQABTLQH13eb9YUWEW1AM5aQEBNbY/+5EZk0NRcDq+0q/jG9GP/f9/bxAiYemMZx58ceUj76oTLU4j8yRRd06Wlb4qcs1nhDmRgrR3PlysUHG1PwvB4bjla0Ie47B08yoAwaZQqwy3I5NcfAh+N5oU1Fu0S7J4ix8KbOTUUNrXRMTNGFhtJLHKgUitw3aD3dzU2J3IMPqb9d8cpCxBXlqXI+BbHYn7cQ0EX7ArFgLn5y5OuaS475tHjZyx1GAvSSkLhNf8B3mI1mDWoEK9XyLd7uqbJ9VBa4FB8J5hYGco1iASnbQLHY4m6/84J9tq5H1yTdcfAWMlmSQQw9jg3wboPiVqCEZZR4MdIMu+IWWC7DF/wTcPqwGp7NmS/fIuSmLVifXcWOAD4X0sKeZqqcjXq3WBuYEO2nPlPhfd8OP4PTyf+mJHwLpRXOLm9SrLCVbfb6d5ltuCSwof5icCmMMxH8kXD5LelAsEKquZDVPGo7JjOc2mtz35IIMUFZB7BfQIphKEclkBa5IErkvzdTfrGWsFwdmPpRAWqbrLsKmpY6cZIcYg58qBzrH0uNwI8/6L+oM7A9gJB4q8y79xreGXYq5OjlclVyGHzg35+f7ChMpLS2wvQKXjYculqjItSSS5jMY1+2OU9rwu1Sg3gmX9QciLRqDAvnJE6ZDBgMcltqlvfI9dIm/W8QUbmF9DcvtTo01DakchasgVI+ViHrSJuRmKhkLL92LlSOA5ve52T8+85x9jwkt2+sZv9oEf1BtfmTbZMquuTG6TPg05wk6o4uDu5wKlMm81nJR8AUoX18ClXS1F7o7fbsFlwRPSgrmEfVYv1BQCIOR+GCrxpw0tC/U/KBmNxua015bsn0E4YWuRKVxKct3D6sKlhhHfWKf0zqTShDD09yQw2Hv+h1T+PCDLbvfFKtQvU4pdsKfT4OAkUDvRsvO03KkY/tWgA/zcH2P9+RhmmEjVLm8hrP29pg7ocfjkGADu/NVWUEJXhtCA0EJ8P7KKhaz+T+GtHpKUm05AOzXknXhH9FCOqTq8znVFvLcjsiWjrjQUUXQ5XnFwgyaOuQKmSE+yyFU6P5GpWDf9H4LtOWgP1Q+CuJvzf+PS9En88+f3kB9pzTEvRQbttLpa1uIMum9vlLLgpCf7Ub5V3mOe2TpEPTdjwZzmfdPHh30oahyXUThTUrDeE6LGO/alY5WHeRlJwLOpBSyQEPTdFI0p3zd9CEax2N3NLsIh1GqB3KAN8vG6joPx/scCASi327GFqS5yJjATYzpsFmh/0i+xAvR5Hp6oojDxv2YIWktbi6TV7woyIkd3cshbsOiH0JVPBIR3eNLmvWvLO6l7FvI00iHPHiAioXOyMPaVoDuVkhik3/L8UF0zxCBNk1f/YKayzmpGMdCB0oJQMFRrdyn7/d94pk3SGlCbRI5KCc2qPc8VhTvZ0byy7wYI6tDzfnxjBXPMHDAnVFTZIH6GJAt4pxJa0d0xVK8dqYEPwihmKtniXBiy5YniB7tQrwEHm9NAEWGa3yJnZQSStBOo3cjAOOSww3vxqx+Urmh+yrJpIgSjhl3w8If5AqmcMTUmruYK+R7RyYhVjqZvejuxWon/TU7MgbwiBS5KGhmzPIBuUIE9TaKLr2gr43EYIq7pDMayTUD4BxKl7AC+jQDIR5YxwLtIZu1aHLI3kwHNuagzoFhmw53g4G7epYDHPl8NF29eI4jcD2Bga1pBCJSUZ82oMbNZNeoArcicSNdbVxY29bvrSoBvb0WWICMBtq5OsOu+rdIDNABm8oE1dI8RljHD/gf6nXAANOPidFTvmStL+EuXuqdHEuJXg1Ud9QwATsfNH03Ys7ZKZvKsSXm2XlZWjFoxsU7Rj3bPDO7MtHmN50GuibZOglj4RHfBtiVlpVm6e7OIMuLSmftoZ40BULzFsW3IJSNT1D+nDpkjnBwcZ+JxoO6sUV06xaGZq7dJM6TvyYxZsoFO3nzSfa7QDDPBKGC8SwRi041tS6Hkdjp07NsRyh80aWgMJw5VFRU0RZL1kYj6dlEts56JKCazJhDuCCUeAF/OkXwNXcoBlHfFL2B1MythIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACJ2fA5Wa7LlOBymgvADlTZwg7C8Ppm73VPNQmV4KkdpoJ+eV6//PhraWZmum2YDVateD+shv5yOZBnvdDZyX4uQDENyb3W2/aDeIs4ODfq2vMegX/lalrKJQkxfczZw2WL5tuC04sAZaN5cMkgqp9HQoJ1xeOyTuteFj5bmTwtI0dWKphxkrVIgQ9ecSAIhnlW6GXUa3+bDYyTT+2wtoJiS18GKk8Pa5YgJ+q7saoanj0s7xh8Z1ucGk1m79H5/kH"
|
|
2026
2074
|
},
|
|
2027
2075
|
{
|
|
2028
|
-
"name": "
|
|
2076
|
+
"name": "consume",
|
|
2029
2077
|
"is_unconstrained": true,
|
|
2030
2078
|
"custom_attributes": [
|
|
2031
2079
|
"public"
|
|
@@ -2033,57 +2081,7 @@
|
|
|
2033
2081
|
"abi": {
|
|
2034
2082
|
"parameters": [
|
|
2035
2083
|
{
|
|
2036
|
-
"name": "
|
|
2037
|
-
"type": {
|
|
2038
|
-
"kind": "field"
|
|
2039
|
-
},
|
|
2040
|
-
"visibility": "private"
|
|
2041
|
-
},
|
|
2042
|
-
{
|
|
2043
|
-
"name": "authorize",
|
|
2044
|
-
"type": {
|
|
2045
|
-
"kind": "boolean"
|
|
2046
|
-
},
|
|
2047
|
-
"visibility": "private"
|
|
2048
|
-
}
|
|
2049
|
-
],
|
|
2050
|
-
"return_type": null,
|
|
2051
|
-
"error_types": {
|
|
2052
|
-
"206160798890201757": {
|
|
2053
|
-
"error_kind": "string",
|
|
2054
|
-
"string": "Storage slot 0 not allowed. Storage slots must start from 1."
|
|
2055
|
-
},
|
|
2056
|
-
"5019202896831570965": {
|
|
2057
|
-
"error_kind": "string",
|
|
2058
|
-
"string": "attempt to add with overflow"
|
|
2059
|
-
},
|
|
2060
|
-
"14225679739041873922": {
|
|
2061
|
-
"error_kind": "string",
|
|
2062
|
-
"string": "Index out of bounds"
|
|
2063
|
-
},
|
|
2064
|
-
"17843811134343075018": {
|
|
2065
|
-
"error_kind": "string",
|
|
2066
|
-
"string": "Stack too deep"
|
|
2067
|
-
}
|
|
2068
|
-
}
|
|
2069
|
-
},
|
|
2070
|
-
"bytecode": "JwACBAEoAAABBIBKJwAABAMnAgMEAicCBAQAHxgABAADgEgdAIBJgEkBLgiASAABLgiASQACJQAAAFIlAAAAdigCAAEEgEonAgIEADsNAAEAAigAgEMEAAMoAIBEAQAAKACARQQAACgAgEYBAAEoAIBHBAABJiUAAAScHgIABAEnAgUAAi0IAQYnAgcEAwAQAQcBJwMGBAEAKAYCBy0MBwgtDgUIACgIAggtDgQIJwIEAAAtCAEFJwIHBAQAEAEHAScDBQQBACgFAgctDAcILQ4ECAAoCAIILQ4ECAAoCAIILQ4ECC0NBQcAKAcCBy0OBwUrAgAHAAAAAAAAAAACAAAAAAAAAAAtCAEIJwIJBAUAEAEJAScDCAQBACgIAgktDAkKLQ4ECgAoCgIKLQ4ECgAoCgIKLQ4ECgAoCgIKLQ4HCi0NBQkAKAkCCS0OCQUtDQgJACgJAgktDgkILQgBCQAAAQIBLQ4FCS0IAQUAAAECAS0OCAUtCAEIAAABAgEuCoBFAAgtCAEKAAABAgEuCoBEAAonAgsEAi4IgEUAAyMAAAGkDDgDCwwkAgAMAAAEQCMAAAG2LQ0KBgsoAAaARAAMJAIADAAAAdMnAg0EADwJAQ0nAgYEDC0IAAwtDAkNLQwFDi0MCA8tDAoQABAABgAlAAAExS0EAAAtDQkGLQ0FDC0NCA0tDgYJLQ4MBS0ODQguCoBGAAoBKAAMgEcABi0NBgUKOAUEBgsoAAaARAAIJAIACAAAAj4lAAAF2C0IAQYnAggEAwAQAQgBJwMGBAEAKAYCCC0MCAktDgUJACgJAgktDgEJLQgBAScCBQQEABABBQEnAwEEAQAoAQIFLQwFCC0OBAgAKAgCCC0OBAgAKAgCCC0OBAgtDQEFACgFAgUtDgUBLQgBBScCCAQFABABCAEnAwUEAQAoBQIILQwICS0OBAkAKAkCCS0OBAkAKAkCCS0OBAkAKAkCCS0OBwktDQEHACgHAgctDgcBLQ0FBwAoBwIHLQ4HBS0IAQcAAAECAS0OAQctCAEBAAABAgEtDgUBLQgBBQAAAQIBLgqARQAFLQgBCAAAAQIBLgqARAAILgiARQADIwAAAz4MOAMLCSQCAAkAAAPkIwAAA1AtDQgDCygAA4BEAAYkAgAGAAADbScCCQQAPAkBCScCAwQJLQgACS0MBwotDAELLQwFDC0MCA0AEAADACUAAATFLQQAAC0NBwMtDQEGLQ0FCS0OAwctDgYBLQ4JBS4KgEYACAEoAAaARwADLQ0DAQo4AQQDCygAA4BEAAQkAgAEAAAD2CUAAAXYHAwCAwAwDAADAAEmJAIACQAAA/EjAAAELwAoBgIKADgKAwwtDQwJJwIKBAwtCAAMLQwHDS0MAQ4tDAUPLQwIEC0MCREAEAAKACUAAAXqLQQAACMAAAQvASgAA4BHAAktDAkDIwAAAz4kAgAMAAAETSMAAASLACgGAg0AOA0DDi0NDgwnAg0EDi0IAA4tDAkPLQwFEC0MCBEtDAoSLQwMEwAQAA0AJQAABeotBAAAIwAABIsBKAADgEcADC0MDAMjAAABpCgAgAQEeAANAAAAgASAAyQAgAMAAATEKgEAAQX3ofOvpa3UyjwBAQImJQAABJwuCIBFAAUjAAAE1Q0oAAWAQwAGJAIABgAABUUjAAAE6i0NAQUtDQIGLQ0DBy0NBAgnAgkEBC0IAQonAgsEBQAQAQsBJwMKBAEAKAYCCycCDAQEACgKAg0/DwALAA0tDQoGACgGAgYtDgYKLQ4FAS0OCgItDgcDLQ4IBCYtDQMGDDgFBgcBKAAFgEcABiQCAAcAAAVjIwAABc8tDQEHLQ0CCC0NAwktDQQKACgIAgwAOAwFDS0NDQsAKAcCDQA4DQUOLQ0ODAA4CwwNLgQACIADKACABAQABSUAAAcTLgiABQALACgLAgwAOAwFDi0ODQ4tDgcBLQ4LAi0OCQMtDgoEIwAABc8tDAYFIwAABNUqAQABBQLcbieAdhKdPAEBAiYlAAAEnC0NAwYtDQQHCygAB4BEAAgkAgAIAAAGECcCCQQAPAkBCQsoAAaAQwAHJAIABwAABp8jAAAGJS0NAQYtDQIHLQ0DCC0NBAkNKAAIgEMACiQCAAoAAAZKJQAAB6EuBAAGgAMoAIAEBAAEJQAABxMuCIAFAAoAKAoCCwA4CwgMLQ4FDAEoAAiARwAFDjgIBQYkAgAGAAAGiiUAAAezLQ4KAS0OBwItDgUDLQ4JBCMAAAcSJwIGBActCAAHLQwBCC0MAgktDAMKLQwECwAQAAYAJQAABMUtBAAALQ0BBi0NAgctDQQILgQABoADKACABAQABCUAAAcTLgiABQAJACgJAgoBKAAKgEUACy0OBQstDgkBLQ4HAi4KgEcAAy0OCAQjAAAHEiYuAYADgAYLAIAGAAKAByQAgAcAAAcuIwAABzkuAIADgAUjAAAHoC4AAAGABQEAAAGABAABAQCAA4AEgAkuAIADgAouAIAFgAsLAIAKgAmADCQAgAwAAAeMLgGACoAILgKACIALAQCACgACgAoBAIALAAKACyMAAAdbKAGABQQAAQMAgAYAAoAGIwAAB6AmKgEAAQXFa8RaDhAAAjwBAQImKgEAAQVFp8pxGUHkFTwBAQIm",
|
|
2071
|
-
"debug_symbols": "7Z3dbts4EIXfxde5IDnDv77KYlEkaVoYMJIiSRdYFH33tbOR7ISUaM8IrlOem6Cq54jjzyRnSFHkz9WXu5sf3z6v778+PK0+/fVztXm4vX5eP9xvr37+ulrdPK43m/W3z4f/vTK7P9bRi+Dp+/X97vrp+frxefXJepuvVnf3X3b/pLi9xdf15m71yZtfV4UxJ+JXY07sRuOQK8bJR/dqnHyKh8Z/X23dSVV3ONvRHZvm3bEm0GBsLY3GNlDNOoXBOO9vTM6/uEN0We7Ei3KH3WW5c1l0/GXR8ZdFJ9jLcsdflDvRXJY7fG53/OCOM+6NO6VtzOxfjWPO+zu7lCrWFM0Qq4j3tjWXnbPDjZ0jmjf2HF9tPadD0xd+Gfw0/BKBn4pfAj8Nv4z6p+OH+qfh5wzqn45fBD8NP2vBT8UvgJ+GnzPgp+LnwU/FD+O3Jr80sPDJvedHyF90/JA/q/idf6L6w/ELo214a7rjF9B+dfww/lDxi2i/On6ofyp+CfVPxw/1T8UvY/5Fxw/jXw0/Mph/0fFj8FPxw/yLip/F+E3HD/MvKn4O+XMFCh4KlVAImW4FCtLXChTkBCUUZkApoSB6l1A8QnIFCuapSigBIbkCBSG5hBIxTVSBgpBcgYKQXELBWw41KEjzSyh4H6EGBX1KAYV7XTnr91BCeA+l0+V0kQdbF73ceEew0wV1pxC0IQ27Itho3i9JZN9nw1ySIFqxkmCnyzqXJNjnhNFJBGMe3qywyRaxuNOlnUsS7PM54oIEE2KxliCDoJIgshklwYxIoiWIbEZH0BvUQS1BZDNKghbZjJYgg6CSILIZJcFOl8wuSRCRREmQEEm0BFEHmwQzjd8vc0Gw0xWtSxJcIBbblAZjx75B0Ps8OO+zP7A2sWId8rDTeDxoP7s775z39IGdX2Ll5O9zPn9g549YdMe0aK8xt3+yP2K52zndOWKh2VnduSw6+bLo5IuiE46Y4TqrO+Gi3Dlio8yzuuPP7c4fte9fsBn8NPwcg5+KH+qfih+h/un4of6p+DGBn4pfBD8NP+/AT8UvgJ+GX7Dgp+KH8Ztm3+cQkL+o+J1/GvUP45fAr8Fvbt+wkJC/6Pghf1bxy6h/On6ofxp+0aD+6fhh/Kbid8RSYvCb44fxm44fxm8qfnj+puSH8ZuKH+H5h44f8ucSCmNSuQIFmW4JxSN9rUBhQCmhINEsoQRE7woUhOQSSsQ8VQUKQnIJJSEkV6BgmqgCBSG5hJIRkitQMEtTQEmGAaWEgppSQrHoU0oo1GmeMrdvduI+m89y+2anThdkL7fjbgp9NswlCaIVKwnGPiPmkgT7nEVbbmeh1OnS2CUJ9jk/tyDBjFisJcggqCSIbEZHMHe6yHhJgshmlAQt6qCWILIZJUGHbEZLkEFQSRDZjJIgIZJoCSKSKAkyIomWIOqgbtfn3Oky3yUJLhCLpRsgh+T2ztc3QI5h8CPG/cYxNroX55dYu/vbnI/2IzufP7DzR5zjF1rOsxmN2cU3RZTWycShDSaT9rcOuWLM4zMlzvsbE9P/vuez+05h9N2ned9jonHD8u3E+byxtZz82PV6Fw7Nt9/VGtPn6khyQ9bgiPy7HtuaIw5u6pEK6kqFiuvzIT5ZGqm4UFLpcwKiQaXTSYUWlT4HaQ0qnQ7+W1Q6jcwNKuhtK1Q6XSTbotLnQ+YGlYC6UqES+9wiY57KdiDU5VGC8+Mg2+mB2w0qFnWlRsX3SWW+X3F9HpPbosKgUqHS58HoDSrU52HnLSqdRuZ5KozetkYFvW2NSgaVkopHXalQCQQqBRVX34E0hqGAGLjQ1BfO5JFNjmU59XmchiacrolGoKm3FzMuNbIm5VKVJaqJo7lbqiRRZVFZWVIWGRKpRGVZUVlW8nuRE5XlRN9rIktuqYJENZFltVQsUuWT+xjyVe7ZDb1k5orm9H6J6q14vpwk8K1+Us+8JluBxp/MgI0RaCTl1FmnoR68CXyvmvqKn4ZGUE69nR98n5rm9PrG9ROL5zX1DbEbmtNjJ3sn0MTTNYJcgAW5AAtyAY6C3yeeXg+8KBp5UTTyrv5kcTtOGJPZ6AoVeYlq4kTklipJVBPPkW0a8u7tzG1JY2pzF3ewMrQsa2pDk3lVsiKVF6myRJUl3ysYiYdh4rQhz+Ov7KMtVUGimmgpLVWSqCZOoW+pskTForIm2pfP43A22CK+TZ2O3FBNnAncUmWJamLk1lKJaExsyNNSiRjWs7htrj+qyBftK9bzuKaKRaokUU1sA9BSBYnKiWg4EXkSlUUi8iQizyLyE6/pURhfX6FU9DZxIi63VFmiCixRRSNSeYlqYsanpZLE5ZitSCWJ5smcXNav7dU/14/r65vN3dNWs/vwx/3t8/rh/vXy+d/vwyc3j+vNZv3t8/fHh9u7Lz8e7z5vHm53n63M65+/aJthU+KdN7tLR/nK8cvlzjVK6Yqy2Za6Lfk/",
|
|
2072
|
-
"brillig_names": [
|
|
2073
|
-
"set_authorized"
|
|
2074
|
-
]
|
|
2075
|
-
},
|
|
2076
|
-
{
|
|
2077
|
-
"name": "_set_authorized",
|
|
2078
|
-
"is_unconstrained": true,
|
|
2079
|
-
"custom_attributes": [
|
|
2080
|
-
"public",
|
|
2081
|
-
"internal"
|
|
2082
|
-
],
|
|
2083
|
-
"abi": {
|
|
2084
|
-
"parameters": [
|
|
2085
|
-
{
|
|
2086
|
-
"name": "approver",
|
|
2084
|
+
"name": "on_behalf_of",
|
|
2087
2085
|
"type": {
|
|
2088
2086
|
"kind": "struct",
|
|
2089
2087
|
"path": "authwit::aztec::protocol_types::address::aztec_address::AztecAddress",
|
|
@@ -2099,33 +2097,35 @@
|
|
|
2099
2097
|
"visibility": "private"
|
|
2100
2098
|
},
|
|
2101
2099
|
{
|
|
2102
|
-
"name": "
|
|
2100
|
+
"name": "inner_hash",
|
|
2103
2101
|
"type": {
|
|
2104
2102
|
"kind": "field"
|
|
2105
2103
|
},
|
|
2106
2104
|
"visibility": "private"
|
|
2107
|
-
},
|
|
2108
|
-
{
|
|
2109
|
-
"name": "authorize",
|
|
2110
|
-
"type": {
|
|
2111
|
-
"kind": "boolean"
|
|
2112
|
-
},
|
|
2113
|
-
"visibility": "private"
|
|
2114
2105
|
}
|
|
2115
2106
|
],
|
|
2116
|
-
"return_type":
|
|
2107
|
+
"return_type": {
|
|
2108
|
+
"abi_type": {
|
|
2109
|
+
"kind": "field"
|
|
2110
|
+
},
|
|
2111
|
+
"visibility": "public"
|
|
2112
|
+
},
|
|
2117
2113
|
"error_types": {
|
|
2118
2114
|
"206160798890201757": {
|
|
2119
2115
|
"error_kind": "string",
|
|
2120
2116
|
"string": "Storage slot 0 not allowed. Storage slots must start from 1."
|
|
2121
2117
|
},
|
|
2118
|
+
"715723737710351018": {
|
|
2119
|
+
"error_kind": "string",
|
|
2120
|
+
"string": "rejecting all"
|
|
2121
|
+
},
|
|
2122
2122
|
"5019202896831570965": {
|
|
2123
2123
|
"error_kind": "string",
|
|
2124
2124
|
"string": "attempt to add with overflow"
|
|
2125
2125
|
},
|
|
2126
|
-
"
|
|
2126
|
+
"12737498021964987455": {
|
|
2127
2127
|
"error_kind": "string",
|
|
2128
|
-
"string": "
|
|
2128
|
+
"string": "unauthorized"
|
|
2129
2129
|
},
|
|
2130
2130
|
"14225679739041873922": {
|
|
2131
2131
|
"error_kind": "string",
|
|
@@ -2137,10 +2137,10 @@
|
|
|
2137
2137
|
}
|
|
2138
2138
|
}
|
|
2139
2139
|
},
|
|
2140
|
-
"bytecode": "
|
|
2141
|
-
"debug_symbols": "
|
|
2140
|
+
"bytecode": "JwACBAEoAAABBIBOJwAABAMnAgMEAicCBAQAHxgABAADgEsuCIBLAAEuCIBMAAIlAAAAUSUAAACMLgQAAYBNKAIAAgSATScCAwQBOw0AAgADKQCAQwBH2s1zKACARAQAAygAgEUBAAAoAIBGBAAAKACARwAAACgAgEgBAAEoAIBJBAABKACASgQABCYlAAAKVC0IAQQAAAECAS4KgEUABC0IAQQAAAECAS4KgEcABC0IAQQAAAECAScCBQACLQ4FBCcCBAABLQgBBicCBwQDABABBwEnAwYEAQAoBgIHLQwHCC0OBAgAKAgCCC0OAQgrAgAEAAAAAAAAAAACAAAAAAAAAAAnAgsEDC0IAAwtDAQNABAACwAlAAAKfS0EAAAtDA0HLQwOCC0MDwktDBAKLQ0HCwAoCwILLQ4LBy0NCAsAKAsCCy0OCwgtCAELAAABAgEtDgcLLQgBBwAAAQIBLQ4IBy0IAQgAAAECAS0OCQgtCAEJAAABAgEtDgoJJwIKBAIuCIBGAAMjAAABjQw4AwoMJAIADAAACfgjAAABnycCDAQNLQgADS0MCw4tDAcPLQwIEC0MCREAEAAMACUAAAsdLQQAAC0MDgYLKAAGgEcABwsoAAeARQAIJAIACAAAAeclAAALkS8MAAYABxwMBwgBHAwIBgAcDAYHAQsoAAeARQAGJAIABgAAAhElAAALox4CAAYBHgIABwMeAgAIBC0IAQknAgsEBQAQAQsBJwMJBAEAKAkCCy0MCwwtDgYMACgMAgwtDgcMACgMAgwtDggMACgMAgwtDgIMJwICAC4tCAEGJwIHBAYAEAEHAScDBgQBACgGAgctDAcILQ4CCAAoCAIILQ4CCAAoCAIILQ4CCAAoCAIILQ4CCAAoCAIILQ4CCC0IAQIAAAECAS0OBgInAgYEBS4IgEYAAyMAAALBDSgAA4BKAAckAgAHAAAJmSMAAALWLQ0CBy0NBwIAKAICAi0OAgcrAgACAAAAAAAAAAAFAAAAAAAAAAAnAg0EDi0IAA4tDAIPABAADQAlAAAKfS0EAAAtDA8ILQwQCS0MEQstDBIMLQ0IAgAoAgICLQ4CCC0NCQIAKAICAi0OAgktCAECAAABAgEtDggCLQgBCAAAAQIBLQ4JCC0IAQkAAAECAS0OCwktCAELAAABAgEtDgwLLgiARgADIwAAA4AMOAMGDCQCAAwAAAlPIwAAA5InAgcEDC0IAAwtDAINLQwIDi0MCQ8tDAsQABAABwAlAAALHS0EAAAtDA0GLQgBAicCBwQDABABBwEnAwIEAQAoAgIHLQwHCC0OBQgAKAgCCC0OAQgnAgkECy0IAAstDAQMABAACQAlAAAKfS0EAAAtDAwBLQwNBS0MDgctDA8ILQ0BCQAoCQIJLQ4JAS0NBQkAKAkCCS0OCQUtCAEJAAABAgEtDgEJLQgBAQAAAQIBLQ4FAS0IAQUAAAECAS0OBwUtCAEHAAABAgEtDggHLgiARgADIwAABGoMOAMKCCQCAAgAAAjzIwAABHwnAgsEDC0IAAwtDAkNLQwBDi0MBQ8tDAcQABAACwAlAAALHS0EAAAtDA0ICygACIBHAAELKAABgEUABSQCAAUAAATEJQAAC5EtCAEBJwIFBAMAEAEFAScDAQQBACgBAgUtDAUHLQ4IBwAoBwIHLQ4GBycCCwQMLQgADC0MBA0AEAALACUAAAp9LQQAAC0MDQUtDA4HLQwPCC0MEAktDQULACgLAgstDgsFLQ0HCwAoCwILLQ4LBy0IAQsAAAECAS0OBQstCAEFAAABAgEtDgcFLQgBBwAAAQIBLQ4IBy0IAQgAAAECAS0OCQguCIBGAAMjAAAFcQw4AwoJJAIACQAACJcjAAAFgycCCQQMLQgADC0MCw0tDAUOLQwHDy0MCBAAEAAJACUAAAsdLQQAAC0MDQMLKAADgEcABQsoAAWARQAHJAIABwAABcslAAALkS8MAAMABRwMBQcBHAwHAwAcDAMFASQCAAUAAAXtJQAAC7UnAgkECy0IAAstDAQMABAACQAlAAAKfS0EAAAtDAwDLQwNBS0MDgctDA8ILQ0DCQAoCQIJLQ4JAy0NBQkAKAkCCS0OCQUtCAEJAAABAgEtDgMJLQgBAwAAAQIBLQ4FAy0IAQUAAAECAS0OBwUtCAEHAAABAgEtDggHLgiARgABIwAABnEMOAEKCCQCAAgAAAg7IwAABoMnAggECy0IAAstDAkMLQwDDS0MBQ4tDAcPABAACAAlAAALHS0EAAAtDAwCCygAAoBHAAMLKAADgEUABSQCAAUAAAbLJQAAC5EtCAEDJwIFBAMAEAEFAScDAwQBACgDAgUtDAUHLQ4CBwAoBwIHLQ4GBycCCAQLLQgACy0MBAwAEAAIACUAAAp9LQQAAC0MDAItDA0FLQwOBi0MDwctDQIEACgEAgQtDgQCLQ0FBAAoBAIELQ4EBS0IAQQAAAECAS0OAgQtCAECAAABAgEtDgUCLQgBBQAAAQIBLQ4GBS0IAQYAAAECAS0OBwYuCIBGAAEjAAAHeAw4AQoHJAIABwAAB98jAAAHiicCAwQHLQgABy0MBAgtDAIJLQwFCi0MBgsAEAADACUAAAsdLQQAAC0MCAELKAABgEcAAgsoAAKARQADJAIAAwAAB9IlAAALkTAIgEcAAS4IgEMAASYkAgAHAAAH7CMAAAgqACgDAggAOAgBCS0NCQcnAggECy0IAAstDAQMLQwCDS0MBQ4tDAYPLQwHEAAQAAgAJQAAC8ctBAAAIwAACCoBKAABgEkABy0MBwEjAAAHeCQCAAgAAAhIIwAACIYAKAICCwA4CwEMLQ0MCCcCCwQMLQgADC0MCQ0tDAMOLQwFDy0MBxAtDAgRABAACwAlAAALxy0EAAAjAAAIhgEoAAGASQAILQwIASMAAAZxJAIACQAACKQjAAAI4gAoAQIMADgMAw0tDQ0JJwIMBA0tCAANLQwLDi0MBQ8tDAcQLQwIES0MCRIAEAAMACUAAAvHLQQAACMAAAjiASgAA4BJAAktDAkDIwAABXEkAgAIAAAJACMAAAk+ACgCAgsAOAsDDC0NDAgnAgsEDC0IAAwtDAkNLQwBDi0MBQ8tDAcQLQwIEQAQAAsAJQAAC8ctBAAAIwAACT4BKAADgEkACC0MCAMjAAAEagAoBwINADgNAw4tDQ4MJwINBA4tCAAOLQwCDy0MCBAtDAkRLQwLEi0MDBMAEAANACUAAAvHLQQAAAEoAAOASQAMLQwMAyMAAAOALQ0CBwEoAAOASQAIACgJAgwAOAwDDS0NDQsMOAgGDCQCAAwAAAnFJQAADPAuBAAHgAMoAIAEBAAGJQAADQIuCIAFAAwAKAwCDQA4DQgOLQ4LDi0ODAItDAgDIwAAAsEkAgAMAAAKBSMAAApDACgGAg0AOA0DDi0NDgwnAg0EDi0IAA4tDAsPLQwHEC0MCBEtDAkSLQwMEwAQAA0AJQAAC8ctBAAAIwAACkMBKAADgEkADC0MDAMjAAABjSgAgAQEeAANAAAAgASAAyQAgAMAAAp8KgEAAQX3ofOvpa3UyjwBAQImJQAAClQtCAECJwIDBAQAEAEDAScDAgQBACgCAgMtDAMELgqARwAEACgEAgQuCoBHAAQAKAQCBC4KgEcABC0NAgMAKAMCAy0OAwItCAEDJwIEBAUAEAEEAScDAwQBACgDAgQtDAQFLgqARwAFACgFAgUuCoBHAAUAKAUCBS4KgEcABQAoBQIFLQ4BBS4IgEUABC0MAgEtDAMCLgiARgADJiUAAApULQ0EBQsoAAWARQAGJAIABgAACz8nAgcEADwJAQcnAgUEBi0IAAYtDAEHLQwCCC0MAwktDAQKABAABQAlAAANkC0EAAAtDQEFLQ0CBi0NAwctDgUBLQ4GAi0OBwMuCoBIAAQBKAAGgEkAAi0NAgEmKgEAAQUC3G4ngHYSnTwBAQImKgEAAQUJ7sLyh4pSqjwBAQImKgEAAQWwxK72/na8PzwBAQImJQAAClQtDQMGLQ0EBwsoAAeARQAIJAIACAAAC+0nAgkEADwJAQkLKAAGgEQAByQCAAcAAAx8IwAADAItDQEGLQ0CBy0NAwgtDQQJDSgACIBEAAokAgAKAAAMJyUAAAzwLgQABoADKACABAQABCUAAA0CLgiABQAKACgKAgsAOAsIDC0OBQwBKAAIgEkABQ44CAUGJAIABgAADGclAAAOni0OCgEtDgcCLQ4FAy0OCQQjAAAM7ycCBgQHLQgABy0MAQgtDAIJLQwDCi0MBAsAEAAGACUAAA2QLQQAAC0NAQYtDQIHLQ0ECC4EAAaAAygAgAQEAAQlAAANAi4IgAUACQAoCQIKASgACoBGAAstDgULLQ4JAS0OBwIuCoBJAAMtDggEIwAADO8mKgEAAQXFa8RaDhAAAjwBAQImLgGAA4AGCwCABgACgAckAIAHAAANHSMAAA0oLgCAA4AFIwAADY8uAAABgAUBAAABgAQAAQEAgAOABIAJLgCAA4AKLgCABYALCwCACoAJgAwkAIAMAAANey4BgAqACC4CgAiACwEAgAoAAoAKAQCACwACgAsjAAANSigBgAUEAAEDAIAGAAKABiMAAA2PJiUAAApULgiARgAFIwAADaANKAAFgEQABiQCAAYAAA4LIwAADbUtDQEFLQ0CBi0NAwctDQQILQgBCScCCgQFABABCgEnAwkEAQAoBgIKJwILBAQAKAkCDD8PAAoADC0NCQYAKAYCBi0OBgktDgUBLQ4JAi0OBwMtDggEJi0NAwYMOAUGBwEoAAWASQAGJAIABwAADikjAAAOlS0NAQctDQIILQ0DCS0NBAoAKAgCDAA4DAUNLQ0NCwAoBwINADgNBQ4tDQ4MADgLDA0uBAAIgAMoAIAEBAAFJQAADQIuCIAFAAsAKAsCDAA4DAUOLQ4NDi0OBwEtDgsCLQ4JAy0OCgQjAAAOlS0MBgUjAAANoCoBAAEFRafKcRlB5BU8AQECJg==",
|
|
2141
|
+
"debug_symbols": "7Z3dbtw4EoXfxde+4F+xyLzKYBEkmUxgwIgDJ1lgEeTdV/6R1DaPRDfR6ZaG5yawY51m8WuqjoqiqF9Xf3/++PPL+5uv/9x9v3r316+r27tPH37c3H0dfvv1+/rq4/3N7e3Nl/eH/31lHv6xQR4F3799+Prw+/cfH+5/XL1TTXp99fnr31fvkrU6fMQ/N7efr95ZE37/53pQ5RaVhBZVNE2qtraa+qVNDLWprdTUr9TUVvZI5UT8s8qJhkkl5vd1cbA1cTzYWuvnJqJHR6c4HpzTdKx38hRO2lI4zrhthaObCsdui47dFh23LToubiocb7YVjmwrnHzucGQMZ8h5L8Ipj9Uc5PlgzXn+ZJcSONqreT44+Dlkh0J2zo4f7Jz3hwc/QImGUEooQiglFJ4+JRT1hFJCSYRSQEkcKQCKEkoBJVtCKaHQkgEUWnIBxRsmWgCFibaEcv6plj1AiYRSQHGskgEUWjKAQksuoXhaMoDCKrmEEmjJAAotuYQirJIBFFoygEJLLqHgZR69Q6Ell1CUlgygcD6lhJI7hSIzlBhfQQm2T0vWMB7rVMJrKJ3Op1Sg9GnJFSh9WvI6FN+nJVeg9Fklr0MJTLQACi25hCIcKQAKLRlAOYEl25RGKC5IBYpIHuOJyc0fbY0iLNGOVHReBGzVPQYf446D17Dj4JPbc/D10vbgDFwIfjpdrVXzogkQjqQwxhPN3NWY0cE+jXFocG794CEJ6bRM3gaTDw9/6Osbnl46dV917qsz6+GLuudjJc2h++CfYk+7jV3MfrmLWeAe4hy7HMb+IFpaarIqWqqS10X4FkBM08yNmgrakPwIK6RQOcfSTCtJ0ldnmHjcB7V5CsfLejii07AQjb4SjtoxEyZ1ZTiYjoqdwjmY18LhZDs+ESnZxVo4Mx1N6XU4AdOJYToPUu3Lcmb+toafxc6Hu6c20p9vQ/wZ2jhDP+IZ+hHP0I+FGxmnbSP++TaSPUMb8ufbyOYMbZwhlyyswj5lG9Gc4hwcCsapjezdYRsgSds4mmNyBxeJuLoMg3+O7qj2oHKN5in+tO/4rdt5/Lrv+N3O+bud8/c75+/jvuMPZufxy87jz/uOX8LO49/59UPc+fVb3Ll/6c79S3fuX2nn/pX27V9qNh9/lin+HIv43dbHfzI6zQ4fTKWP8ftNjf/HiMLmItrUNdZDROH8rj2vsE1OXGXUXWihr8ZALpBLJhfERXkeYS5KLohLcuQCuXC8QC7ZkgvkIuQCudCnEZdk6NOYC/Mu5GKZdzGXSC6IizPkArkEcoFc6NOQi6dPYy70acglsJ7GXOjTkIvQpzEX1tOYC30acon0acwlkQviovRpzIU+Dbkkzr9ALrnf8bK2F1W2oVcuqzsaZNvt9cs6F9ft9UuFS7fzDOtcfLd+VOHSbd1Y4cK8C7mc5An4fyMXjhfIRejTmAv26eSnjS2SpHUuJ3wBbY52W+HETYWj26Kj26KTtkVn4XmYi4WTNxXOwq4TFwsnnTuc7W9Wbs3CYrfeqSiplFSsJRVAJZJKScVxrCAqQiqASiaVkoqnMyMqdGZAJTDbIirMtoDKwrK23qkEUgFUWDMDKpHOjKjQmQEVpTMjKqyZAZVEZ0ZU6MyICmtmQCXTmREVOnNJZZh2IhVAhc4MqFg6M6LC+RVAxXc6VtbW3Fsb+pxJWF2ZNZxAfV6v1Kj0eb1SoRL7nEmoUenTg2pU+qwOK1SU2RZRoTMDKoljBVGhMwMq+QTO3PpOX8lycDR8p2/M4ws11cYXn/wUfd5x9O4UKzUvF/0pKujLRe/qla7KSbPB2gLvIZ6wsXjytuLxG+PjN8YnbIzPG+ZMzhqPuI3Fo9uK5w0V+onj2cF8qHvDA3YdUlFDKoBKIBVAJZNKSSVxrCAqiVRKKtmRCqBCZy6peENnRlSYbREVZltAxXpSAVSUVEoqjjUzokJnBlQ8nRlRoTMjKqyZAZVAZ0ZU6MyAirBmRlTozIBKpDMjKkIqgAqdGVBROjOiwvkVQCV3OlZWnzAJts+ZhPW1icH2eb1SoeL6vF6pUQmkAqj06UEVKr7P6rBGhdkWUAl0ZkSFYwVQETozonICZ259TiAmNweEnxPQOMahOq+Lteqeoo9uz9GfYqXmBaNPe47+DU/h5VCLfjpnrVXzog0Qj6Tx/S8azdzXmNHBPo2JRoNz6wcPmUin1eM2mHx4+FNn89k7q3NnnVmPX9Q9Hytpjn24o/QU/Bte9rDh4HdMXgwmn62OweeDOSR5chSxrkmF75TlOLlXTvovnHlanY8T50gFUImkUlJZWMPSOxUhlZJK4FhBVAKpACqJVEoqQmdGVOjMgEpktkVUmG0RlUwqJZWFNSy9U2HNDKgkOjOiQmcGVDKdGVFhzYyo0JlLKtHQmREV1syAiqUzIyp0ZkBl4end3qnQmREVOjOg4jm/AqiETsfK6hMOMfY5k7C+Ni5qn9crNSp9Xq9UqKQ+ZxJqVPr0oBqVPqvDCpXMbIuo0JlLKmo4VhAVOjOgYk/gzBd7E4LatOfoT7FS83LRn6KCvmD0tUrXGxNOmg1W97DX4DcWT9pWPLIxPrIxPnFjfKpzJmeOR+3G4onbiqdaoZ88nh3Mh2oSUgFUMqmUVLInFUAlkUpBJRmOFURFSaWkYi2pACp0ZkSFzgyoOGZbRIXZFlDxjlQAlUgqJZXAmhlRoTMjKnRmQEXozIgKa2ZAJdKZERU6M6CirJkRFTozokJnBlSqaxP7pEJnBlQynRlR4fxKSSXbTsfK6hMm2fc5k7C+NjH7Pq9XalT6vF6pUAl9ziTUqPTpQRUq0md1WKPCbAuoRDozosKxgqjQmQEVPYEzX+xNCDnZXUef9xz9KSroS0XvjKlXuq4WfTBjEzY4fdFGeXQyfkwHycgcEX6HRvLT8zEpm/WDrQ1JprQkLh4e/thZ1+fEmHfTaxu8l1epzxnfZ1FSo8KxAqiEPifGvPUTFRdLKn0WsBUqnRawNSp9FiU1Kn0WJRUqsVNnrlBhtgVUOl1MUqPS58KjCpXEsQKo5D4nUdepWNfnpmjrdZDtdBPXCpVOX19XoxL6pLKeV3yfm7hWqIQ+t+KvUelzA70KFelze/UalU6duUKF2RZQicy2iEqfW9tWqHT6+roKlU5f1LZOxS0sH09+vE/ukkpvddBwCpFKScVxrCAqsU8q63nFW1IBVIRUAJVMKiWVhfmV3ql06szrVITZFlFhtgVUFh7A6J0KxwqgooFUCire1KkcrBbvpA7yJpNKScVyrCAqqU8q63nFeVIBVJRUSipvmF/pkYqQCqDSqTOvUwnMtogKsy2gIo5UABWOFUAlRlIpqSScbWOYVMn4dSrODNFPPc1+7qvAp7fnjdOSE1fp6sVKoYUdEAkmc8QsgNFuwazmmLCwQQTBLLypmWAWXtZMMAvTlgRj+7XrdTCOyXcBDJMvBrMwhUkwniMGgwm0awxGzl8S2DiDMbnS1aB5PHr4cY7fx+cORLvxDiQ7fvbwYwYdyFvvgPNTBw4+euqAhr13YO/fwAWmyE7cgbTzDuS47w6I2XwaNTp14MHpig5s3chqHbCbT6O1Dmw+jVY6sLDfyX464M3eO7D7b2Dv58DCamaRqQOi3e0IK2pIBVDhWEFUcp9UVucZZOElhr1TSaRSUll4iWHvVCKpFFSi6dSZK1SYbREVZltAxXpSAVQ4VgCVhSdqOqeC91SWMJYJElKpCQ2afLRGTWjQNLRjG9rB59i6xjW04xr6g2ei1jXBNGjgVZ2kccm3JFdoxDRopEEDucXpvnYsXirtFO82WNGk4zXa0I42tJMa2kl6vCY3tJOP70/C+aCiOX4cJCvHa/Au7OsafC6svwhxUEEKNqZx4tWqKc6HFF2LCs8dVlXSpILflNU8piA7TBcXKjw3U1WlFhWu7auq2KDKuDasqkKTqoV8tk1t2Rby2bkmVRN530TeN9HwTTRCE42A28p+uqTNoVRJPF7lDc6G1kyZzZqUS1VoUuF+WZmyzeN7Ll+p8GrDmiqEJlVuUYnHqjRWFfbFLbNnFV7QZIM7eANo2Ra+uqip8N6yVVVsUeE6papq6Zc1LREOBSFUSZi+ZVFbqrRFtXCm1FS5RYWriZoK1xNVVVtbC/3KU46K1hcq0RbVwnVURbVwHVVTSZOqiQauFaqqJoYLV0R+9hQvxfnl8CqvqkqaVLlFhWcjqyptUbkmGq6JvG9qyzeR903kQxP5sEA+Tu/69qnINm7BlysqvP9gVSUtKrVNqtiiWqi/aqoWX3bZNala3NyblrYW1gLrtNm+xtf1vBeca/I005y1uL4WnGkqGj1eg7NMRSMNV/GycG1SUfnQpGpqKzS1FZrakqa2pKmt2PR9xaa2tKlfC9VJRbVQndRUsUWVTZNKjs8W+D5KduM8Yw6FZuGO+upZHPFZvN6Oa4jN+waNHq8Jx2eyiO9vrGukoR18fyOncRy8uCH4rMHXExVNSzs1dwIabRhvyTRojne0iK8hKpp0tEaNb9A0tGNdg+b4ca3ONGiOHAe/h9/+++H+5sPH28/fB8XDH39+/fTj5u7r868//vdt/MvH+5vb25sv77/d3336/PfP+8/vb+8+Pfztyjz/81fUeB2zDrE87nghwV0PNzQffn04SaN119GGodWh5f8D",
|
|
2142
2142
|
"brillig_names": [
|
|
2143
|
-
"
|
|
2143
|
+
"consume"
|
|
2144
2144
|
]
|
|
2145
2145
|
}
|
|
2146
2146
|
],
|
|
@@ -2238,12 +2238,12 @@
|
|
|
2238
2238
|
}
|
|
2239
2239
|
],
|
|
2240
2240
|
"kind": "struct",
|
|
2241
|
-
"path": "AuthRegistry::
|
|
2241
|
+
"path": "AuthRegistry::_set_authorized_parameters"
|
|
2242
2242
|
}
|
|
2243
2243
|
}
|
|
2244
2244
|
],
|
|
2245
2245
|
"kind": "struct",
|
|
2246
|
-
"path": "AuthRegistry::
|
|
2246
|
+
"path": "AuthRegistry::_set_authorized_abi"
|
|
2247
2247
|
},
|
|
2248
2248
|
{
|
|
2249
2249
|
"fields": [
|
|
@@ -2252,25 +2252,34 @@
|
|
|
2252
2252
|
"type": {
|
|
2253
2253
|
"fields": [
|
|
2254
2254
|
{
|
|
2255
|
-
"name": "
|
|
2256
|
-
"type": {
|
|
2257
|
-
"kind": "field"
|
|
2258
|
-
}
|
|
2259
|
-
},
|
|
2260
|
-
{
|
|
2261
|
-
"name": "authorize",
|
|
2255
|
+
"name": "on_behalf_of",
|
|
2262
2256
|
"type": {
|
|
2263
|
-
"
|
|
2257
|
+
"fields": [
|
|
2258
|
+
{
|
|
2259
|
+
"name": "inner",
|
|
2260
|
+
"type": {
|
|
2261
|
+
"kind": "field"
|
|
2262
|
+
}
|
|
2263
|
+
}
|
|
2264
|
+
],
|
|
2265
|
+
"kind": "struct",
|
|
2266
|
+
"path": "authwit::aztec::protocol_types::address::aztec_address::AztecAddress"
|
|
2264
2267
|
}
|
|
2265
2268
|
}
|
|
2266
2269
|
],
|
|
2267
2270
|
"kind": "struct",
|
|
2268
|
-
"path": "AuthRegistry::
|
|
2271
|
+
"path": "AuthRegistry::is_reject_all_parameters"
|
|
2272
|
+
}
|
|
2273
|
+
},
|
|
2274
|
+
{
|
|
2275
|
+
"name": "return_type",
|
|
2276
|
+
"type": {
|
|
2277
|
+
"kind": "boolean"
|
|
2269
2278
|
}
|
|
2270
2279
|
}
|
|
2271
2280
|
],
|
|
2272
2281
|
"kind": "struct",
|
|
2273
|
-
"path": "AuthRegistry::
|
|
2282
|
+
"path": "AuthRegistry::is_reject_all_abi"
|
|
2274
2283
|
},
|
|
2275
2284
|
{
|
|
2276
2285
|
"fields": [
|
|
@@ -2278,21 +2287,6 @@
|
|
|
2278
2287
|
"name": "parameters",
|
|
2279
2288
|
"type": {
|
|
2280
2289
|
"fields": [
|
|
2281
|
-
{
|
|
2282
|
-
"name": "approver",
|
|
2283
|
-
"type": {
|
|
2284
|
-
"fields": [
|
|
2285
|
-
{
|
|
2286
|
-
"name": "inner",
|
|
2287
|
-
"type": {
|
|
2288
|
-
"kind": "field"
|
|
2289
|
-
}
|
|
2290
|
-
}
|
|
2291
|
-
],
|
|
2292
|
-
"kind": "struct",
|
|
2293
|
-
"path": "authwit::aztec::protocol_types::address::aztec_address::AztecAddress"
|
|
2294
|
-
}
|
|
2295
|
-
},
|
|
2296
2290
|
{
|
|
2297
2291
|
"name": "message_hash",
|
|
2298
2292
|
"type": {
|
|
@@ -2307,12 +2301,12 @@
|
|
|
2307
2301
|
}
|
|
2308
2302
|
],
|
|
2309
2303
|
"kind": "struct",
|
|
2310
|
-
"path": "AuthRegistry::
|
|
2304
|
+
"path": "AuthRegistry::set_authorized_parameters"
|
|
2311
2305
|
}
|
|
2312
2306
|
}
|
|
2313
2307
|
],
|
|
2314
2308
|
"kind": "struct",
|
|
2315
|
-
"path": "AuthRegistry::
|
|
2309
|
+
"path": "AuthRegistry::set_authorized_abi"
|
|
2316
2310
|
},
|
|
2317
2311
|
{
|
|
2318
2312
|
"fields": [
|
|
@@ -2356,6 +2350,27 @@
|
|
|
2356
2350
|
"kind": "struct",
|
|
2357
2351
|
"path": "AuthRegistry::is_consumable_abi"
|
|
2358
2352
|
},
|
|
2353
|
+
{
|
|
2354
|
+
"fields": [
|
|
2355
|
+
{
|
|
2356
|
+
"name": "parameters",
|
|
2357
|
+
"type": {
|
|
2358
|
+
"fields": [
|
|
2359
|
+
{
|
|
2360
|
+
"name": "reject",
|
|
2361
|
+
"type": {
|
|
2362
|
+
"kind": "boolean"
|
|
2363
|
+
}
|
|
2364
|
+
}
|
|
2365
|
+
],
|
|
2366
|
+
"kind": "struct",
|
|
2367
|
+
"path": "AuthRegistry::set_reject_all_parameters"
|
|
2368
|
+
}
|
|
2369
|
+
}
|
|
2370
|
+
],
|
|
2371
|
+
"kind": "struct",
|
|
2372
|
+
"path": "AuthRegistry::set_reject_all_abi"
|
|
2373
|
+
},
|
|
2359
2374
|
{
|
|
2360
2375
|
"fields": [
|
|
2361
2376
|
{
|
|
@@ -2405,7 +2420,7 @@
|
|
|
2405
2420
|
"type": {
|
|
2406
2421
|
"fields": [
|
|
2407
2422
|
{
|
|
2408
|
-
"name": "
|
|
2423
|
+
"name": "approver",
|
|
2409
2424
|
"type": {
|
|
2410
2425
|
"fields": [
|
|
2411
2426
|
{
|
|
@@ -2418,85 +2433,70 @@
|
|
|
2418
2433
|
"kind": "struct",
|
|
2419
2434
|
"path": "authwit::aztec::protocol_types::address::aztec_address::AztecAddress"
|
|
2420
2435
|
}
|
|
2421
|
-
}
|
|
2422
|
-
],
|
|
2423
|
-
"kind": "struct",
|
|
2424
|
-
"path": "AuthRegistry::is_reject_all_parameters"
|
|
2425
|
-
}
|
|
2426
|
-
},
|
|
2427
|
-
{
|
|
2428
|
-
"name": "return_type",
|
|
2429
|
-
"type": {
|
|
2430
|
-
"kind": "boolean"
|
|
2431
|
-
}
|
|
2432
|
-
}
|
|
2433
|
-
],
|
|
2434
|
-
"kind": "struct",
|
|
2435
|
-
"path": "AuthRegistry::is_reject_all_abi"
|
|
2436
|
-
},
|
|
2437
|
-
{
|
|
2438
|
-
"fields": [
|
|
2439
|
-
{
|
|
2440
|
-
"name": "parameters",
|
|
2441
|
-
"type": {
|
|
2442
|
-
"fields": [
|
|
2436
|
+
},
|
|
2443
2437
|
{
|
|
2444
|
-
"name": "
|
|
2438
|
+
"name": "message_hash",
|
|
2439
|
+
"type": {
|
|
2440
|
+
"kind": "field"
|
|
2441
|
+
}
|
|
2442
|
+
},
|
|
2443
|
+
{
|
|
2444
|
+
"name": "authorize",
|
|
2445
2445
|
"type": {
|
|
2446
2446
|
"kind": "boolean"
|
|
2447
2447
|
}
|
|
2448
2448
|
}
|
|
2449
2449
|
],
|
|
2450
2450
|
"kind": "struct",
|
|
2451
|
-
"path": "AuthRegistry::
|
|
2451
|
+
"path": "AuthRegistry::set_authorized_private_parameters"
|
|
2452
2452
|
}
|
|
2453
2453
|
}
|
|
2454
2454
|
],
|
|
2455
2455
|
"kind": "struct",
|
|
2456
|
-
"path": "AuthRegistry::
|
|
2456
|
+
"path": "AuthRegistry::set_authorized_private_abi"
|
|
2457
2457
|
}
|
|
2458
2458
|
]
|
|
2459
2459
|
}
|
|
2460
2460
|
},
|
|
2461
2461
|
"file_map": {
|
|
2462
2462
|
"104": {
|
|
2463
|
-
"path": "/
|
|
2463
|
+
"path": "/mnt/user-data/phil/aztec3-packages/noir-projects/aztec-nr/aztec/src/macros/functions/utils.nr",
|
|
2464
2464
|
"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"
|
|
2465
2465
|
},
|
|
2466
2466
|
"107": {
|
|
2467
|
-
"path": "/
|
|
2467
|
+
"path": "/mnt/user-data/phil/aztec3-packages/noir-projects/aztec-nr/aztec/src/macros/storage.nr",
|
|
2468
2468
|
"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"
|
|
2469
2469
|
},
|
|
2470
2470
|
"143": {
|
|
2471
|
-
"path": "/
|
|
2471
|
+
"path": "/mnt/user-data/phil/aztec3-packages/noir-projects/aztec-nr/aztec/src/oracle/call_private_function.nr",
|
|
2472
2472
|
"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"
|
|
2473
2473
|
},
|
|
2474
2474
|
"145": {
|
|
2475
|
-
"path": "/
|
|
2475
|
+
"path": "/mnt/user-data/phil/aztec3-packages/noir-projects/aztec-nr/aztec/src/oracle/enqueue_public_function_call.nr",
|
|
2476
2476
|
"source": "use dep::protocol_types::address::AztecAddress;\n\n#[oracle(notifyEnqueuedPublicFunctionCall)]\nunconstrained fn notify_enqueued_public_function_call_oracle(\n _contract_address: AztecAddress,\n _calldata_hash: Field,\n _side_effect_counter: u32,\n _is_static_call: bool,\n) {}\n\nunconstrained fn notify_enqueued_public_function_call_wrapper(\n contract_address: AztecAddress,\n calldata_hash: Field,\n side_effect_counter: u32,\n is_static_call: bool,\n) {\n notify_enqueued_public_function_call_oracle(\n contract_address,\n calldata_hash,\n side_effect_counter,\n is_static_call,\n )\n}\n\npub fn notify_enqueued_public_function_call(\n contract_address: AztecAddress,\n calldata_hash: Field,\n side_effect_counter: u32,\n is_static_call: bool,\n) {\n // Safety: Notifies the simulator that a public call has been enqueued, allowing it to prepare hints for the AVM to process this call.\n unsafe {\n notify_enqueued_public_function_call_wrapper(\n contract_address,\n calldata_hash,\n side_effect_counter,\n is_static_call,\n )\n }\n}\n\n#[oracle(notifySetPublicTeardownFunctionCall)]\nunconstrained fn notify_set_public_teardown_function_call_oracle(\n _contract_address: AztecAddress,\n _calldata_hash: Field,\n _side_effect_counter: u32,\n _is_static_call: bool,\n) {}\n\nunconstrained fn notify_set_public_teardown_function_call_wrapper(\n contract_address: AztecAddress,\n calldata_hash: Field,\n side_effect_counter: u32,\n is_static_call: bool,\n) {\n notify_set_public_teardown_function_call_oracle(\n contract_address,\n calldata_hash,\n side_effect_counter,\n is_static_call,\n )\n}\n\npub fn notify_set_public_teardown_function_call(\n contract_address: AztecAddress,\n calldata_hash: Field,\n side_effect_counter: u32,\n is_static_call: bool,\n) {\n // Safety: Notifies the simulator that a teardown call has been set, allowing it to prepare hints for the AVM to process this call.\n unsafe {\n notify_set_public_teardown_function_call_wrapper(\n contract_address,\n calldata_hash,\n side_effect_counter,\n is_static_call,\n )\n }\n}\n\npub fn notify_set_min_revertible_side_effect_counter(counter: u32) {\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 { notify_set_min_revertible_side_effect_counter_oracle_wrapper(counter) };\n}\n\npub unconstrained fn notify_set_min_revertible_side_effect_counter_oracle_wrapper(counter: u32) {\n notify_set_min_revertible_side_effect_counter_oracle(counter);\n}\n\n#[oracle(notifySetMinRevertibleSideEffectCounter)]\nunconstrained fn notify_set_min_revertible_side_effect_counter_oracle(_counter: u32) {}\n"
|
|
2477
2477
|
},
|
|
2478
2478
|
"146": {
|
|
2479
|
-
"path": "/
|
|
2479
|
+
"path": "/mnt/user-data/phil/aztec3-packages/noir-projects/aztec-nr/aztec/src/oracle/execution.nr",
|
|
2480
2480
|
"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"
|
|
2481
2481
|
},
|
|
2482
2482
|
"147": {
|
|
2483
|
-
"path": "/
|
|
2483
|
+
"path": "/mnt/user-data/phil/aztec3-packages/noir-projects/aztec-nr/aztec/src/oracle/execution_cache.nr",
|
|
2484
2484
|
"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"
|
|
2485
2485
|
},
|
|
2486
2486
|
"158": {
|
|
2487
|
-
"path": "/
|
|
2487
|
+
"path": "/mnt/user-data/phil/aztec3-packages/noir-projects/aztec-nr/aztec/src/oracle/notes.nr",
|
|
2488
2488
|
"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"
|
|
2489
2489
|
},
|
|
2490
2490
|
"161": {
|
|
2491
|
-
"path": "/
|
|
2491
|
+
"path": "/mnt/user-data/phil/aztec3-packages/noir-projects/aztec-nr/aztec/src/oracle/storage.nr",
|
|
2492
2492
|
"source": "use dep::protocol_types::{address::AztecAddress, traits::{Packable, ToField}};\n\n#[oracle(storageRead)]\nunconstrained fn storage_read_oracle<let N: u32>(\n address: Field,\n storage_slot: Field,\n block_number: Field,\n length: Field,\n) -> [Field; N] {}\n\npub unconstrained fn raw_storage_read<let N: u32>(\n address: AztecAddress,\n storage_slot: Field,\n block_number: u32,\n) -> [Field; N] {\n storage_read_oracle(\n address.to_field(),\n storage_slot,\n block_number as Field,\n N as Field,\n )\n}\n\npub unconstrained fn storage_read<T, let N: u32>(\n address: AztecAddress,\n storage_slot: Field,\n block_number: u32,\n) -> T\nwhere\n T: Packable<N>,\n{\n T::unpack(raw_storage_read(address, storage_slot, block_number))\n}\n\nmod tests {\n use crate::oracle::storage::{raw_storage_read, storage_read};\n use dep::protocol_types::{address::AztecAddress, traits::{FromField, Packable}};\n\n use crate::test::mocks::mock_struct::MockStruct;\n use std::test::OracleMock;\n\n global address: AztecAddress = AztecAddress::from_field(29);\n global slot: Field = 7;\n global block_number: u32 = 17;\n\n #[test]\n unconstrained fn test_raw_storage_read() {\n let written = MockStruct { a: 13, b: 42 };\n\n let _ = OracleMock::mock(\"storageRead\").returns(written.pack());\n\n let read: [Field; 2] = raw_storage_read(address, slot, block_number);\n assert_eq(read[0], 13);\n assert_eq(read[1], 42);\n }\n\n #[test]\n unconstrained fn test_storage_read() {\n let written = MockStruct { a: 13, b: 42 };\n\n let _ = OracleMock::mock(\"storageRead\").returns(written.pack());\n\n let read: MockStruct = storage_read(address, slot, block_number);\n assert_eq(read.a, 13);\n assert_eq(read.b, 42);\n }\n}\n"
|
|
2493
2493
|
},
|
|
2494
2494
|
"163": {
|
|
2495
|
-
"path": "/
|
|
2495
|
+
"path": "/mnt/user-data/phil/aztec3-packages/noir-projects/aztec-nr/aztec/src/state_vars/map.nr",
|
|
2496
2496
|
"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"
|
|
2497
2497
|
},
|
|
2498
2498
|
"172": {
|
|
2499
|
-
"path": "/
|
|
2499
|
+
"path": "/mnt/user-data/phil/aztec3-packages/noir-projects/aztec-nr/aztec/src/state_vars/public_mutable.nr",
|
|
2500
2500
|
"source": "use crate::context::{PublicContext, UtilityContext};\nuse crate::state_vars::storage::Storage;\nuse dep::protocol_types::traits::Packable;\n\n// docs:start:public_mutable_struct\npub struct PublicMutable<T, Context> {\n context: Context,\n storage_slot: Field,\n}\n// docs:end:public_mutable_struct\n\nimpl<T, Context, let N: u32> Storage<N> for PublicMutable<T, Context>\nwhere\n T: Packable<N>,\n{\n fn get_storage_slot(self) -> Field {\n self.storage_slot\n }\n}\n\nimpl<T, Context> PublicMutable<T, Context> {\n // docs:start:public_mutable_struct_new\n pub fn new(\n // Note: Passing the contexts to new(...) just to have an interface compatible with a Map.\n context: Context,\n storage_slot: Field,\n ) -> Self {\n assert(storage_slot != 0, \"Storage slot 0 not allowed. Storage slots must start from 1.\");\n PublicMutable { context, storage_slot }\n }\n // docs:end:public_mutable_struct_new\n}\n\nimpl<T> PublicMutable<T, &mut PublicContext> {\n // docs:start:public_mutable_struct_read\n pub fn read<let T_PACKED_LEN: u32>(self) -> T\n where\n T: Packable<T_PACKED_LEN>,\n {\n self.context.storage_read(self.storage_slot)\n }\n // docs:end:public_mutable_struct_read\n\n // docs:start:public_mutable_struct_write\n pub fn write<let T_PACKED_LEN: u32>(self, value: T)\n where\n T: Packable<T_PACKED_LEN>,\n {\n self.context.storage_write(self.storage_slot, value);\n }\n // docs:end:public_mutable_struct_write\n}\n\nimpl<T> PublicMutable<T, UtilityContext> {\n pub unconstrained fn read<let T_PACKED_LEN: u32>(self) -> T\n where\n T: Packable<T_PACKED_LEN>,\n {\n self.context.storage_read(self.storage_slot)\n }\n}\n"
|
|
2501
2501
|
},
|
|
2502
2502
|
"20": {
|
|
@@ -2504,35 +2504,35 @@
|
|
|
2504
2504
|
"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"
|
|
2505
2505
|
},
|
|
2506
2506
|
"270": {
|
|
2507
|
-
"path": "/
|
|
2507
|
+
"path": "/mnt/user-data/phil/aztec3-packages/noir-projects/noir-protocol-circuits/crates/types/src/address/aztec_address.nr",
|
|
2508
2508
|
"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"
|
|
2509
2509
|
},
|
|
2510
2510
|
"288": {
|
|
2511
|
-
"path": "/
|
|
2511
|
+
"path": "/mnt/user-data/phil/aztec3-packages/noir-projects/noir-protocol-circuits/crates/types/src/hash.nr",
|
|
2512
2512
|
"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"
|
|
2513
2513
|
},
|
|
2514
2514
|
"305": {
|
|
2515
|
-
"path": "/
|
|
2515
|
+
"path": "/mnt/user-data/phil/aztec3-packages/noir-projects/noir-protocol-circuits/crates/types/src/poseidon2.nr",
|
|
2516
2516
|
"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"
|
|
2517
2517
|
},
|
|
2518
2518
|
"325": {
|
|
2519
|
-
"path": "/
|
|
2519
|
+
"path": "/mnt/user-data/phil/aztec3-packages/noir-projects/noir-protocol-circuits/crates/types/src/storage/map.nr",
|
|
2520
2520
|
"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"
|
|
2521
2521
|
},
|
|
2522
2522
|
"343": {
|
|
2523
|
-
"path": "/
|
|
2523
|
+
"path": "/mnt/user-data/phil/aztec3-packages/noir-projects/noir-protocol-circuits/crates/types/src/type_packing.nr",
|
|
2524
2524
|
"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"
|
|
2525
2525
|
},
|
|
2526
2526
|
"344": {
|
|
2527
|
-
"path": "/
|
|
2527
|
+
"path": "/mnt/user-data/phil/aztec3-packages/noir-projects/noir-protocol-circuits/crates/types/src/type_serialization.nr",
|
|
2528
2528
|
"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"
|
|
2529
2529
|
},
|
|
2530
2530
|
"360": {
|
|
2531
|
-
"path": "/
|
|
2531
|
+
"path": "/mnt/user-data/phil/aztec3-packages/noir-projects/noir-protocol-circuits/crates/types/src/utils/arrays.nr",
|
|
2532
2532
|
"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"
|
|
2533
2533
|
},
|
|
2534
2534
|
"363": {
|
|
2535
|
-
"path": "/
|
|
2535
|
+
"path": "/mnt/user-data/phil/aztec3-packages/noir-projects/noir-protocol-circuits/crates/types/src/utils/reader.nr",
|
|
2536
2536
|
"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"
|
|
2537
2537
|
},
|
|
2538
2538
|
"43": {
|
|
@@ -2540,39 +2540,39 @@
|
|
|
2540
2540
|
"source": "pub fn panic<T, U, let N: u32>(message: fmtstr<N, T>) -> U {\n assert(false, message);\n crate::mem::zeroed()\n}\n"
|
|
2541
2541
|
},
|
|
2542
2542
|
"50": {
|
|
2543
|
-
"path": "/
|
|
2543
|
+
"path": "/mnt/user-data/phil/aztec3-packages/noir-projects/noir-contracts/contracts/protocol/auth_registry_contract/src/main.nr",
|
|
2544
2544
|
"source": "/**\n * @title AuthRegistry Contract\n * @notice Manages authorization of public actions through authentication witnesses (authwits)\n * @dev This contract allows users to approve/reject public actions that can be performed on their behalf by other\n * addresses\n */\nuse dep::aztec::macros::aztec;\n\n#[aztec]\npub contract AuthRegistry {\n use dep::authwit::auth::{\n assert_current_call_valid_authwit, compute_authwit_message_hash, IS_VALID_SELECTOR,\n };\n use dep::aztec::{\n macros::{functions::{internal, private, public, utility, view}, storage::storage},\n protocol_types::address::AztecAddress,\n state_vars::{Map, PublicMutable},\n };\n\n #[storage]\n struct Storage<Context> {\n /// Map of addresses that have rejected all actions\n reject_all: Map<AztecAddress, PublicMutable<bool, Context>, Context>,\n /// Nested map of approvers to their authorized message hashes\n /// First key is the approver address, second key is the message hash, value is authorization status\n approved_actions: Map<AztecAddress, Map<Field, PublicMutable<bool, Context>, Context>, Context>,\n }\n\n /**\n * Updates the `authorized` value for `msg_sender` for `message_hash`.\n *\n * @param message_hash The message hash being authorized\n * @param authorize True if the caller is authorized to perform the message hash, false otherwise\n */\n #[public]\n fn set_authorized(message_hash: Field, authorize: bool) {\n storage.approved_actions.at(context.msg_sender()).at(message_hash).write(authorize);\n }\n\n /**\n * Updates the `reject_all` value for `msg_sender`.\n *\n * When `reject_all` is `true` any `consume` on `msg_sender` will revert.\n *\n * @param reject True if all actions should be rejected, false otherwise\n */\n #[public]\n fn set_reject_all(reject: bool) {\n storage.reject_all.at(context.msg_sender()).write(reject);\n }\n\n /**\n * Consumes an `inner_hash` on behalf of `on_behalf_of` if the caller is authorized to do so.\n *\n * Will revert even if the caller is authorized if `reject_all` is set to true for `on_behalf_of`.\n * This is to support \"mass-revoke\".\n *\n * @param on_behalf_of The address on whose behalf the action is being consumed\n * @param inner_hash The inner_hash of the authwit\n * @return `IS_VALID_SELECTOR` if the action was consumed, revert otherwise\n */\n #[public]\n fn consume(on_behalf_of: AztecAddress, inner_hash: Field) -> Field {\n assert_eq(false, storage.reject_all.at(on_behalf_of).read(), \"rejecting all\");\n\n let message_hash = compute_authwit_message_hash(\n context.msg_sender(),\n context.chain_id(),\n context.version(),\n inner_hash,\n );\n\n let authorized = storage.approved_actions.at(on_behalf_of).at(message_hash).read();\n\n assert_eq(true, authorized, \"unauthorized\");\n storage.approved_actions.at(on_behalf_of).at(message_hash).write(false);\n\n IS_VALID_SELECTOR\n }\n\n /**\n * Updates a public authwit using a private authwit\n *\n * Useful for the case where you want someone else to insert a public authwit for you.\n * For example, if Alice wants Bob to insert an authwit in public, such that they can execute\n * a trade, Alice can create a private authwit, and Bob can call this function with it.\n *\n * @param approver The address of the approver (Alice in the example)\n * @param message_hash The message hash to authorize\n * @param authorize True if the message hash should be authorized, false otherwise\n */\n #[private]\n fn set_authorized_private(approver: AztecAddress, message_hash: Field, authorize: bool) {\n assert_current_call_valid_authwit(&mut context, approver);\n AuthRegistry::at(context.this_address())\n ._set_authorized(approver, message_hash, authorize)\n .enqueue(&mut context);\n }\n\n /**\n * Internal function to update the `authorized` value for `approver` for `messageHash`.\n * Used along with `set_authorized_private` to update the public authwit.\n *\n * @param approver The address of the approver\n * @param message_hash The message hash being authorized\n * @param authorize True if the caller is authorized to perform the message hash, false otherwise\n */\n #[public]\n #[internal]\n fn _set_authorized(approver: AztecAddress, message_hash: Field, authorize: bool) {\n storage.approved_actions.at(approver).at(message_hash).write(authorize);\n }\n\n /**\n * Fetches the `reject_all` value for `on_behalf_of`.\n *\n * @param on_behalf_of The address to check\n * @return True if all actions are rejected, false otherwise\n */\n #[public]\n #[view]\n fn is_reject_all(on_behalf_of: AztecAddress) -> bool {\n storage.reject_all.at(on_behalf_of).read()\n }\n\n /**\n * Fetches the `authorized` value for `on_behalf_of` for `message_hash`.\n *\n * @param on_behalf_of The address on whose behalf the action is being consumed\n * @param message_hash The message hash to check\n * @return True if the caller is authorized to perform the action, false otherwise\n */\n #[public]\n #[view]\n fn is_consumable(on_behalf_of: AztecAddress, message_hash: Field) -> bool {\n storage.approved_actions.at(on_behalf_of).at(message_hash).read()\n }\n\n /**\n * Just like `is_consumable`, but a utility function and not public.\n */\n #[utility]\n unconstrained fn utility_is_consumable(\n on_behalf_of: AztecAddress,\n message_hash: Field,\n ) -> bool {\n storage.approved_actions.at(on_behalf_of).at(message_hash).read()\n }\n}\n"
|
|
2545
2545
|
},
|
|
2546
2546
|
"52": {
|
|
2547
|
-
"path": "/
|
|
2547
|
+
"path": "/mnt/user-data/phil/aztec3-packages/noir-projects/aztec-nr/authwit/src/auth.nr",
|
|
2548
2548
|
"source": "use dep::aztec::{context::{gas::GasOpts, PrivateContext, PublicContext}, hash::hash_args_array};\nuse dep::aztec::protocol_types::{\n abis::function_selector::FunctionSelector,\n address::AztecAddress,\n constants::{\n CANONICAL_AUTH_REGISTRY_ADDRESS, GENERATOR_INDEX__AUTHWIT_INNER,\n GENERATOR_INDEX__AUTHWIT_NULLIFIER, GENERATOR_INDEX__AUTHWIT_OUTER,\n },\n hash::poseidon2_hash_with_separator,\n traits::ToField,\n};\n\n/**\n * Authenticaion witness helper library\n *\n * Authentication Witness is a scheme for authenticating actions on Aztec, so users can allow third-parties\n * (e.g. protocols or other users) to execute an action on their behalf.\n *\n * This library provides helper functions to manage such witnesses.\n * The authentication witness, is some \"witness\" (data) that authenticates a `message_hash`.\n * The simplest example of an authentication witness, is a signature. The signature is the \"evidence\",\n * that the signer has seen the message, agrees with it, and has allowed it.\n * It does not need to be a signature. It could be any kind of \"proof\" that the message is allowed.\n * Another proof could be knowing some kind of secret, or having some kind of \"token\" that allows the message.\n *\n * The `message_hash` is a hash of the following structure:\n * hash(consumer, chain_id, version, inner_hash)\n * - consumer: the address of the contract that is \"consuming\" the message,\n * - chain_id: the chain id of the chain that the message is being consumed on,\n * - version: the version of the chain that the message is being consumed on,\n * - inner_hash: the hash of the \"inner\" message that is being consumed, this is the \"actual\" message or action.\n *\n * While the `inner_hash` could be anything, such as showing you signed a specific message, it will often be\n * a hash of the \"action\" to approve, along with who made the call. As part of this library, we provide a few\n * helper functions to deal with such messages.\n *\n * For example, we provide helper function that is used for checking that the message is an encoding of the current call.\n * This can be used to let some contract \"allow\" another contract to act on its behalf, as long as it can\n * show that it is acting on behalf of the contract.\n *\n * If we take a case of allowing a contract to transfer tokens on behalf of an account, the `inner_hash` can be\n * derived as:\n * inner_hash = hash(caller, \"transfer\", hash(to, amount))\n *\n * Where the `caller` would be the address of the contract that is trying to transfer the tokens, and `to` and `amount`\n * the arguments for the transfer.\n *\n * Note that we have both a `caller` and a `consumer`, the `consumer` will be the contract that is consuming the message,\n * in the case of the transfer, it would be the `Token` contract itself, while the caller, will be the actor that is\n * allowed to transfer the tokens.\n *\n *\n * The authentication mechanism works differently in public and private contexts. In private, we recall that everything\n * is executed on the user's device, so we can use `oracles` to \"ask\" the user (not contract) for information. In public\n * we cannot do this, since it is executed by the sequencer (someone else). Therefore we can instead use a \"registry\"\n * to store the messages that we have approved.\n *\n * A simple example would be a \"token\" that is being \"pulled\" from one account into another. We will first outline\n * how this would look in private, and then in public later.\n *\n * Say that a user `Alice` wants to deposit some tokens into a DeFi protocol (say a DEX).\n * `Alice` would make a `deposit` transaction, that she is executing using her account contract.\n * The account would call the `DeFi` contract to execute `deposit`, which would try to pull funds from the `Token`\n * contract. Since the `DeFi` contract is trying to pull funds from an account that is not its own, it needs to\n * convince the `Token` contract that it is allowed to do so.\n *\n * This is where the authentication witness comes in The `Token` contract computes a `message_hash` from the\n * `transfer` call, and then asks `Alice Account` contract to verify that the `DeFi` contract is allowed to\n * execute that call.\n *\n * `Alice Account` contract can then ask `Alice` if she wants to allow the `DeFi` contract to pull funds from her\n * account. If she does, she will sign the `message_hash` and return the signature to the `Alice Account` which\n * will validate it and return success to the `Token` contract which will then allow the `DeFi` contract to pull\n * funds from `Alice`.\n *\n * To ensure that the same \"approval\" cannot be used multiple times, we also compute a `nullifier` for the\n * authentication witness, and emit it from the `Token` contract (consumer).\n *\n * Note that we can do this flow as we are in private were we can do oracle calls out from contracts.\n *\n *\n * Person Contract Contract Contract\n * Alice Alice Account Token DeFi\n * | | | |\n * | Defi.deposit(Token, 1000) | |\n * |----------------->| | |\n * | | deposit(Token, 1000) |\n * | |---------------------------------------->|\n * | | | |\n * | | | transfer(Alice, Defi, 1000)\n * | | |<---------------------|\n * | | | |\n * | | Check if Defi may call transfer(Alice, Defi, 1000)\n * | |<-----------------| |\n * | | | |\n * | Please give me AuthWit for DeFi | |\n * | calling transfer(Alice, Defi, 1000) | |\n * |<-----------------| | |\n * | | | |\n * | | | |\n * | AuthWit for transfer(Alice, Defi, 1000) |\n * |----------------->| | |\n * | | AuthWit validity | |\n * | |----------------->| |\n * | | | |\n * | | throw if invalid AuthWit |\n * | | | |\n * | | emit AuthWit nullifier |\n * | | | |\n * | | transfer(Alice, Defi, 1000) |\n * | | | |\n * | | | |\n * | | | success |\n * | | |--------------------->|\n * | | | |\n * | | | |\n * | | | deposit(Token, 1000)\n * | | | |\n * | | | |\n *\n *\n * If we instead were in public, we cannot do the same flow. Instead we would use an authentication registry to store\n * the messages that we have approved.\n *\n * To approve a message, `Alice Account` can make a `set_authorized` call to the registry, to set a `message_hash`\n * as authorized. This is essentially a mapping from `message_hash` to `true` for `Alice Contract`. Every account\n * has its own map in the registry, so `Alice` cannot approve a message for `Bob`.\n *\n * The `Token` contract can then try to \"spend\" the approval by calling `consume` on the registry. If the message\n * was approved, the value is updated to `false`, and we return the success flag. For more information on the\n * registry, see `main.nr` in `auth_registry_contract`.\n *\n * Person Contract Contract Contract Contract\n * Alice Alice Account Registry Token DeFi\n * | | | | |\n * | Registry.set_authorized(..., true) | | |\n * |----------------->| | | |\n * | | set_authorized(..., true) | |\n * | |------------------->| | |\n * | | | | |\n * | | set authorized to true | |\n * | | | | |\n * | | | | |\n * | Defi.deposit(Token, 1000) | | |\n * |----------------->| | | |\n * | | deposit(Token, 1000) | |\n * | |-------------------------------------------------------------->|\n * | | | | |\n * | | | transfer(Alice, Defi, 1000) |\n * | | | |<---------------------|\n * | | | | |\n * | | | Check if Defi may call transfer(Alice, Defi, 1000)\n * | | |<------------------| |\n * | | | | |\n * | | throw if invalid AuthWit | |\n * | | | | |\n * | | | | |\n * | | set authorized to false | |\n * | | | | |\n * | | | | |\n * | | | AuthWit validity | |\n * | | |------------------>| |\n * | | | | |\n * | | | | transfer(Alice, Defi, 1000)\n * | | | |<-------------------->|\n * | | | | |\n * | | | | success |\n * | | | |--------------------->|\n * | | | | |\n * | | | | deposit(Token, 1000)\n * | | | | |\n *\n *\n * --- FAQ ---\n * Q: Why are we using a success flag of `poseidon2_hash_bytes(\"IS_VALID()\")` instead of just returning a boolean?\n * A: We want to make sure that we don't accidentally return `true` if there is a collision in the function selector.\n * By returning a hash of `IS_VALID()`, it becomes very unlikely that there is both a collision and we return\n * a success flag.\n *\n * Q: Why are we using static calls?\n * A: We are using static calls to ensure that the account contract cannot re-enter. If it was a normal call, it\n * could make a new call and do a re-entry attack. Using a static ensures that it cannot update any state.\n *\n * Q: Would it not be cheaper to use a nullifier instead of updating state in public?\n * A: At a quick glance, a public state update + nullifier is 96 bytes, but two state updates are 128, so it would be\n * cheaper to use a nullifier, if this is the way it would always be done. However, if both the approval and the\n * consumption is done in the same transaction, then we will be able to squash the updates (only final tx state diff is posted to DA), and now it is cheaper.\n *\n * Q: Why is the chain id and the version part of the message hash?\n * A: The chain id and the version is part of the message hash to ensure that the message is only valid on a specific\n * chain to avoid a case where the same message could be used across multiple chains.\n */\n\npub global IS_VALID_SELECTOR: Field = 0x47dacd73; // 4 last bytes of poseidon2_hash_bytes(\"IS_VALID()\")\n\n/**\n * Assert that `on_behalf_of` has authorized the current call with a valid authentication witness\n *\n * Compute the `inner_hash` using the `msg_sender`, `selector` and `args_hash` and then make a call out to the\n * `on_behalf_of` contract to verify that the `inner_hash` is valid.\n *\n * @param on_behalf_of The address that has allegedly authorized the current call\n */\n// docs:start:assert_current_call_valid_authwit\npub fn assert_current_call_valid_authwit(context: &mut PrivateContext, on_behalf_of: AztecAddress) {\n let inner_hash = compute_inner_authwit_hash([\n context.msg_sender().to_field(),\n context.selector().to_field(),\n context.args_hash,\n ]);\n assert_inner_hash_valid_authwit(context, on_behalf_of, inner_hash);\n}\n// docs:end:assert_current_call_valid_authwit\n\n/**\n * Assert that a specific `inner_hash` is valid for the `on_behalf_of` address\n *\n * Used as an internal function for `assert_current_call_valid_authwit` and can be used as a standalone function when\n * the `inner_hash` is from a different source, e.g., say a block of text etc.\n *\n * @param on_behalf_of The address that has allegedly authorized the current call\n * @param inner_hash The hash of the message to authorize\n */\npub fn assert_inner_hash_valid_authwit(\n context: &mut PrivateContext,\n on_behalf_of: AztecAddress,\n inner_hash: Field,\n) {\n // We perform a static call here and not a standard one to ensure that the account contract cannot re-enter.\n let result: Field = context\n .static_call_private_function(\n on_behalf_of,\n comptime { FunctionSelector::from_signature(\"verify_private_authwit(Field)\") },\n [inner_hash],\n )\n .get_preimage();\n assert(result == IS_VALID_SELECTOR, \"Message not authorized by account\");\n // Compute the nullifier, similar computation to the outer hash, but without the chain_id and version.\n // Those should already be handled in the verification, so we just need something to nullify, that allows the same inner_hash for multiple actors.\n let nullifier = compute_authwit_nullifier(on_behalf_of, inner_hash);\n context.push_nullifier(nullifier);\n}\n\n/**\n * Assert that `on_behalf_of` has authorized the current call in the authentication registry\n *\n * Compute the `inner_hash` using the `msg_sender`, `selector` and `args_hash` and then make a call out to the\n * `on_behalf_of` contract to verify that the `inner_hash` is valid.\n *\n * Note that the authentication registry will take the `msg_sender` into account as the consumer, so this will only\n * work if the `msg_sender` is the same as the `consumer` when the `message_hash` was inserted into the registry.\n *\n * @param on_behalf_of The address that has allegedly authorized the current call\n */\n// docs:start:assert_current_call_valid_authwit_public\npub unconstrained fn assert_current_call_valid_authwit_public(\n context: &mut PublicContext,\n on_behalf_of: AztecAddress,\n) {\n let inner_hash = compute_inner_authwit_hash([\n (*context).msg_sender().to_field(),\n (*context).selector().to_field(),\n (*context).get_args_hash(),\n ]);\n assert_inner_hash_valid_authwit_public(context, on_behalf_of, inner_hash);\n}\n// docs:end:assert_current_call_valid_authwit_public\n\n/**\n * Assert that `on_behalf_of` has authorized a specific `inner_hash` in the authentication registry\n *\n * Compute the `inner_hash` using the `msg_sender`, `selector` and `args_hash` and then make a call out to the\n * `on_behalf_of` contract to verify that the `inner_hash` is valid.\n *\n * Note that the authentication registry will take the `msg_sender` into account as the consumer, so this will only\n * work if the `msg_sender` is the same as the `consumer` when the `message_hash` was inserted into the registry.\n *\n * @param on_behalf_of The address that has allegedly authorized the `inner_hash`\n */\npub unconstrained fn assert_inner_hash_valid_authwit_public(\n context: &mut PublicContext,\n on_behalf_of: AztecAddress,\n inner_hash: Field,\n) {\n let results: [Field] = context.call_public_function(\n CANONICAL_AUTH_REGISTRY_ADDRESS,\n comptime { FunctionSelector::from_signature(\"consume((Field),Field)\") },\n [on_behalf_of.to_field(), inner_hash].as_slice(),\n GasOpts::default(),\n );\n assert(results.len() == 1, \"Invalid response from registry\");\n assert(results[0] == IS_VALID_SELECTOR, \"Message not authorized by account\");\n}\n\n/**\n * Compute the `message_hash` from a function call to be used by an authentication witness\n *\n * Useful for when you need a non-account contract to approve during execution. For example if you need a contract\n * to make a call to nested contract, e.g., contract A wants to exit token T to L1 using bridge B, so it needs to allow\n * B to transfer T on its behalf.\n *\n * @param caller The address of the contract that is calling the function, in the example above, this would be B\n * @param consumer The address of the contract that is consuming the message, in the example above, this would be T\n * @param chain_id The chain id of the chain that the message is being consumed on\n * @param version The version of the chain that the message is being consumed on\n * @param selector The function selector of the function that is being called\n * @param args The arguments of the function that is being called\n */\n// docs:start:compute_authwit_message_hash_from_call\npub fn compute_authwit_message_hash_from_call<let N: u32>(\n caller: AztecAddress,\n consumer: AztecAddress,\n chain_id: Field,\n version: Field,\n selector: FunctionSelector,\n args: [Field; N],\n) -> Field {\n let args_hash = hash_args_array(args);\n let inner_hash =\n compute_inner_authwit_hash([caller.to_field(), selector.to_field(), args_hash]);\n compute_authwit_message_hash(consumer, chain_id, version, inner_hash)\n}\n// docs:end:compute_authwit_message_hash_from_call\n\n/**\n * Computes the `inner_hash` of the authentication witness\n *\n * This is used internally, but also useful in cases where you want to compute the `inner_hash` for a specific message\n * that is not necessarily a call, but just some \"bytes\" or text.\n *\n * @param args The arguments to hash\n */\npub fn compute_inner_authwit_hash<let N: u32>(args: [Field; N]) -> Field {\n poseidon2_hash_with_separator(args, GENERATOR_INDEX__AUTHWIT_INNER)\n}\n\n/**\n * Computes the `authwit_nullifier` for a specific `on_behalf_of` and `inner_hash`\n *\n * Using the `on_behalf_of` and the `inner_hash` to ensure that the nullifier is siloed for a specific `on_behalf_of`.\n *\n * @param on_behalf_of The address that has authorized the `inner_hash`\n * @param inner_hash The hash of the message to authorize\n */\npub fn compute_authwit_nullifier(on_behalf_of: AztecAddress, inner_hash: Field) -> Field {\n poseidon2_hash_with_separator(\n [on_behalf_of.to_field(), inner_hash],\n GENERATOR_INDEX__AUTHWIT_NULLIFIER,\n )\n}\n\n/**\n * Computes the `message_hash` for the authentication witness\n *\n * @param consumer The address of the contract that is consuming the message\n * @param chain_id The chain id of the chain that the message is being consumed on\n * @param version The version of the chain that the message is being consumed on\n * @param inner_hash The hash of the \"inner\" message that is being consumed\n */\npub fn compute_authwit_message_hash(\n consumer: AztecAddress,\n chain_id: Field,\n version: Field,\n inner_hash: Field,\n) -> Field {\n poseidon2_hash_with_separator(\n [consumer.to_field(), chain_id, version, inner_hash],\n GENERATOR_INDEX__AUTHWIT_OUTER,\n )\n}\n\n/**\n * Helper function to set the authorization status of a message hash\n *\n * Wraps a public call to the authentication registry to set the authorization status of a `message_hash`\n *\n * @param message_hash The hash of the message to authorize\n * @param authorize True if the message should be authorized, false if it should be revoked\n */\npub unconstrained fn set_authorized(\n context: &mut PublicContext,\n message_hash: Field,\n authorize: bool,\n) {\n let res = context.call_public_function(\n CANONICAL_AUTH_REGISTRY_ADDRESS,\n comptime { FunctionSelector::from_signature(\"set_authorized(Field,bool)\") },\n [message_hash, authorize as Field].as_slice(),\n GasOpts::default(),\n );\n assert(res.len() == 0);\n}\n\n/**\n * Helper function to reject all authwits\n *\n * Wraps a public call to the authentication registry to set the `reject_all` flag\n *\n * @param reject True if all authwits should be rejected, false otherwise\n */\npub unconstrained fn set_reject_all(context: &mut PublicContext, reject: bool) {\n let res = context.call_public_function(\n CANONICAL_AUTH_REGISTRY_ADDRESS,\n comptime { FunctionSelector::from_signature(\"set_reject_all(bool)\") },\n [context.this_address().to_field(), reject as Field].as_slice(),\n GasOpts::default(),\n );\n assert(res.len() == 0);\n}\n"
|
|
2549
2549
|
},
|
|
2550
2550
|
"61": {
|
|
2551
|
-
"path": "/
|
|
2551
|
+
"path": "/mnt/user-data/phil/aztec3-packages/noir-projects/aztec-nr/aztec/src/context/call_interfaces.nr",
|
|
2552
2552
|
"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"
|
|
2553
2553
|
},
|
|
2554
2554
|
"68": {
|
|
2555
|
-
"path": "/
|
|
2555
|
+
"path": "/mnt/user-data/phil/aztec3-packages/noir-projects/aztec-nr/aztec/src/context/private_context.nr",
|
|
2556
2556
|
"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"
|
|
2557
2557
|
},
|
|
2558
2558
|
"69": {
|
|
2559
|
-
"path": "/
|
|
2559
|
+
"path": "/mnt/user-data/phil/aztec3-packages/noir-projects/aztec-nr/aztec/src/context/public_context.nr",
|
|
2560
2560
|
"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"
|
|
2561
2561
|
},
|
|
2562
2562
|
"70": {
|
|
2563
|
-
"path": "/
|
|
2563
|
+
"path": "/mnt/user-data/phil/aztec3-packages/noir-projects/aztec-nr/aztec/src/context/returns_hash.nr",
|
|
2564
2564
|
"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"
|
|
2565
2565
|
},
|
|
2566
2566
|
"71": {
|
|
2567
|
-
"path": "/
|
|
2567
|
+
"path": "/mnt/user-data/phil/aztec3-packages/noir-projects/aztec-nr/aztec/src/context/utility_context.nr",
|
|
2568
2568
|
"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"
|
|
2569
2569
|
},
|
|
2570
2570
|
"75": {
|
|
2571
|
-
"path": "/
|
|
2571
|
+
"path": "/mnt/user-data/phil/aztec3-packages/noir-projects/aztec-nr/aztec/src/hash.nr",
|
|
2572
2572
|
"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"
|
|
2573
2573
|
},
|
|
2574
2574
|
"97": {
|
|
2575
|
-
"path": "/
|
|
2575
|
+
"path": "/mnt/user-data/phil/aztec3-packages/noir-projects/aztec-nr/aztec/src/macros/dispatch.nr",
|
|
2576
2576
|
"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"
|
|
2577
2577
|
}
|
|
2578
2578
|
}
|