@aztec/protocol-contracts 0.87.1 → 0.87.2-nightly.20250524
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 +30 -30
- package/artifacts/ContractClassRegisterer.json +15 -15
- package/artifacts/ContractInstanceDeployer.json +25 -25
- package/artifacts/FeeJuice.json +22 -22
- package/artifacts/MultiCallEntrypoint.json +10 -10
- package/artifacts/Router.json +15 -15
- package/dest/protocol_contract_data.js +7 -7
- package/package.json +4 -4
- package/src/protocol_contract_data.ts +7 -7
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"transpiled": true,
|
|
3
|
-
"noir_version": "1.0.0-beta.
|
|
3
|
+
"noir_version": "1.0.0-beta.6+0000000000000000000000000000000000000000",
|
|
4
4
|
"name": "AuthRegistry",
|
|
5
5
|
"functions": [
|
|
6
6
|
{
|
|
@@ -67,8 +67,8 @@
|
|
|
67
67
|
}
|
|
68
68
|
}
|
|
69
69
|
},
|
|
70
|
-
"bytecode": "
|
|
71
|
-
"debug_symbols": "
|
|
70
|
+
"bytecode": "JwACBAEoAAABBIBNJwAABAMnAgQEAycCBQQAHwoABAAFgEodAIBMgEwBLgiASgABLgiASwACLgiATAADJQAAAFglAAAAiigCAAEEgE0nAgIEADsOAAIAASgAgEMEAAMoAIBEAQAAKACARQQAACgAgEYAAAAoAIBHAQABKACASAQAASgAgEkEAAImJQAAAZ4eAgAEAR4CAAUACioEBQYkAgAGAAAAqyUAAAHHJwIEAAItCAEFJwIGBAMACAEGAScDBQQBACIFAgYtCgYHLQ4EBwAiBwIHLQ4BBycCBAQGLQgABi0KBQcuCIBJAAguCIBEAAkACAAEACUAAAHZLQIAAC0KBwELIgABgEYABAsiAASARAAFJAIABQAAASElAAAD7S0IAQQnAgUEAwAIAQUBJwMEBAEAIgQCBS0KBQYtDgEGACIGAgYtDgIGJwICBAUtCAAFLQoEBi4IgEkABy4IgEQACAAIAAIAJQAAAdktAgAALQoGAQsiAAGARgACCyIAAoBEAAQkAgAEAAABkiUAAAPtHAoDAgAwCgACAAEmKACABAR4AA0AAACABIADJACAAwAAAcYqAQABBfeh86+lrdTKPAQCASYqAQABBVd9Leakk8oaPAQCASYlAAABnhwKAgUAKwIABgAAAAAAAAAAAQAAAAAAAAAABCoFBgctCAEFJwIGBAQACAEGAScDBQQBACIFAgYtCgYILgyARgAIACIIAgguDIBGAAgAIggCCC4MgEYACC0IAQYnAggEBQAIAQgBJwMGBAEAIgYCCC0KCAkuDIBGAAkAIgkCCS4MgEYACQAiCQIJLgyARgAJACIJAgktDgcJLQgBBwAAAQIBLQ4FBy0IAQUAAAECAS0OBgUtCAEGAAABAgEuDIBFAAYtCAEIAAABAgEuDIBEAAgtCwEJACIJAgktDgkBLgiARQAEIwAAAsYNIgAEgEkACSQCAAkAAAOMIwAAAtskAgADAAAC6CMAAAMdJwIBAAEnAgIECS0IAAktCgcKLQoFCy0KBgwtCggNLQoBDgAIAAIAJQAAA/8tAgAAIwAAAx0tCwgBCyIAAYBEAAIkAgACAAADOicCAwQAPAYDAScCAQQJLQgACS0KBwotCgULLQoGDC0KCA0ACAABACUAAAUjLQIAAC0LBwEtCwUCLQsGAy0OAQctDgIFLQ4DBi4MgEcACAEiAAKASAADLQsDASYMKgQCCSQCAAkAAAOeIwAAA9wAIgECCgAqCgQLLQsLCScCCgQLLQgACy0KBwwtCgUNLQoGDi0KCA8tCgkQAAgACgAlAAAD/y0CAAAjAAAD3AEiAASASAAJLQoJBCMAAALGKgEAAQUC3G4ngHYSnTwEAgEmJQAAAZ4tCwQGCyIABoBEAAckAgAHAAAEIScCCAQAPAYIAS0LAwYLIgAGgEMAByQCAAcAAAS0IwAABDotCwMGLQsBBy0LAggtCwQJDSIABoBDAAokAgAKAAAEXyUAAAY2LgIAB4ADKACABAQABCUAAAZILgiABQAKACIKAgsAKgsGDC0OBQwBIgAGgEgABQ4qBgUHJAIABwAABJ8lAAAG1i0OCgEtDggCLQ4FAy0OCQQjAAAFIicCBgQHLQgABy0KAQgtCgIJLQoDCi0KBAsACAAGACUAAAUjLQIAAC0LAQYtCwIHLQsECC4CAAaAAygAgAQEAAQlAAAGSC4IgAUACQEiAAmASAAKLQ4FCi0OCQEtDgcCLgyASAADLQ4IBCMAAAUiJiUAAAGeLgiARQAFIwAABTMNIgAFgEMABiQCAAYAAAWjIwAABUgtCwIFLQsFBgAiBgIGLQ4GBScCBgQELQgBBycCCAQFAAgBCAEnAwcEAQAiBQIIJwIJBAQAIgcCCj8PAAgACi0LAQUtCwMGLQsECC0OBQEtDgcCLQ4GAy0OCAQmLQsDBgwqBQYHJAIABwAABbkjAAAGJS0LAgYAIgYCCAAqCAUJLQsJBy0LAQgAIggCCgAqCgULLQsLCQAqBwkKLQsDBy0LBAkuAgAGgAMoAIAEBAAFJQAABkguCIAFAAsAIgsCDAAqDAUNLQ4KDS0OCAEtDgsCLQ4HAy0OCQQjAAAGJQEiAAWASAAGLQoGBSMAAAUzKgEAAQXFa8RaDhAAAjwEAgEmLgGAA4AGCwCABgACgAckAIAHAAAGYyMAAAZuLgCAA4AFIwAABtUuAAABgAUBAAABgAQAAQEAgAOABIAJLgCAA4AKLgCABYALCwCACoAJgAwkAIAMAAAGwS4BgAqACC4EgAiACwEAgAoAAoAKAQCACwACgAsjAAAGkCgBgAUEAAEDAIAGAAKABiMAAAbVJioBAAEFRafKcRlB5BU8BAIBJg==",
|
|
71
|
+
"debug_symbols": "tZndbhs5DIXfxde50A9JSXmVoijS1C0MGE7gJgssirz7kpIO7QSYgTvB3ng+0yJNUmckefxn92P//fXXt8Pp59Pv3f2XP7vv58PxePj17fj0+PByeDqp9c8u2EukvLvPd3qtu3vRK+v7Ytc6riLjWuLuPgYDmVADgCc0WNq0pBAABKgTYgYUBU0hpQSQCTkAYCGMIXgxLIwxYl5iUCf0nA0qAZpCU2gZUAfkkAGwRFh6qgYpAmSCpZqSAQPaBGvxAFgYYwRe4haMKebFCjUC2oRWBlDQ2lMzUEtWLyqac9YmULV5pbsdW+cHqHvW2tnKGVAnJFgSLBmWXCYQLIQxTABEtipyMWgTCgFgqbBUWGwKBkyLhDlGYgDMyGKdHyATrPOZDQjQJvScO5QJppYBMkHg3pM3MKkPgKViTDWvqmBSH8ADSpyWQpZGM2gTGBa7qTpIAsiEEgAYXDC4T2UHWEwAFO92NWiqlAzaBJNoB7ubBuhXkEqi5ghgQJtgjRpQJjAGM9wFFoG7wL3AvcC9YnDF4IrB1jFSQTa70QZoXaTtbT1VFVLrqXaAhbQ/VAwY0CbYkjWgTOipdsBgwWBr7wBYrKsGMZj6qRpla14z6t87qIL6Fw4qIPtKtrUvVPXl2ElAJpdJ5FQnqTMokpOmx8koMciymlRANnOTKojdZvmxLe/ROjHIlDapgkxik9yjRSf49mWcqVMD2XIyqYDsLp3ETu6RPUp2G3kU8ijsUWzBZDbqfR5UQSa/SQ3U6+jU64id2KlNygG2bJpj2wKzLRJcOgnIlolJ7NSmXnJX1SBoKFtPJ7mtua3BRiE7uS2Sk9v6DT1IQLb2TXKP7B69p9LJutFtPftBbdZBlv0kt3VFDDJf0zi15AQb2wokoZOAbCmchMicglMB5eRUQZSd3ObzwT4f7PPB4t/RdVDe3u52OOh8eznv93bOuTr56Hno+eG8P73s7k+vx+Pd7p+H42sf9Pv54dSvLw9n/VQr2J9+6FUD/jwc90ZvdxfvsOxqd0Wd7sosHkLXkXdB4nIQDgUpKFYPIe1dhLQcoer0zAi6oMtShPVCJF0KqWmxEFoOQrWVGYNaWEyDVwohO8KMQojDtkKuZ6TSYiErQYjt8DgKUaV6CH4vjLqSRhYUYnf5JQl5n0RbCVGRQ2wXUeRUbg7ACJBCWgwQV5RZWoUya1A/xNBj9fsYK9rMDF3RlTJ1X7m5lSorNIJJFlsZV5QpJWA6SqjxShMfmrGizRgCmhFDLIt53Kqrq8Xig65i+bywYv2sslYj3CStFD4vrRQ/K63Vbt6orZRv01YSWdRWWtFnEazf5WoDiCVvUlZZVFaStV74JqJHj7KYRVrpZ9VzFmY1R17cyuraJkK+h1ySyMS3J6FHRiSR2uImklfaWUPxDVVPtIshVsRph3K/zaJcLRi3b2a6l6GdergIixJfD0EeQmhbiIZmJHNbCpFXFk9OuM84h20R/GwhV8L6mzJSvpRBaVMI8UUrScubQhS/UfX3zHIr6H+OoQ/8fDeTqzXnr2KUkhGjtLQtRgu+Are0bVaSl5JS2XaX6NNAhMgxbsvCtxKNtqkQfTLhZ/Agm0Sujwx8WnVz2xbi8ktAn/luCpH9ZrVfwJtCcAqXnblsCyGXzb22bYVc1JnTtkIy+YEt86ZCCmFCCsmWAI2wjTTeVEQLmE99drcpgGuqFf5kCR8DfNW3D4+H87u/Pd4s1Pnw8P24n29/vp4erz59+fcZn+Bvk+fz0+P+x+t5b5Eu/53oy5esP3Fyzl/tgZ6+LeWuJnsT7TPdYXOWr2+Wyn8=",
|
|
72
72
|
"brillig_names": [
|
|
73
73
|
"_set_authorized"
|
|
74
74
|
]
|
|
@@ -138,8 +138,8 @@
|
|
|
138
138
|
}
|
|
139
139
|
}
|
|
140
140
|
},
|
|
141
|
-
"bytecode": "
|
|
142
|
-
"debug_symbols": "
|
|
141
|
+
"bytecode": "JwACBAEoAAABBIBQJwAABAMnAgMEAicCBAQAHwoAAwAEgE0uCIBNAAEuCIBOAAIlAAAAUSUAAACaLgIAAYBPKAIAAgSATycCAwQBOw4AAwACKQCAQwBH2s1zKACARAQAAygAgEUBAAAoAIBGBAAAKACARwAAACgAgEgBAAEoAIBJBAABKACASgAAASgAgEsEAAIoAIBMBAAEJiUAAAWlLQgBBCcCBQQDAAgBBQEnAwQEAQAiBAIFLQoFBi4MgEoABgAiBgIGLQ4BBicCBgQHLQgABy0KBAguCIBLAAkuCIBFAAoACAAGACUAAAXOLQIAAC0KCAULIgAFgEcABAsiAASARQAGJAIABgAAARIlAAAHnC8KAAUABBwKBAYBHAoGBQAcCgUEAQsiAASARQAFJAIABQAAATwlAAAHrh4CAAQBHgIABQMeAgAGBC0IAQcnAggEBQAIAQgBJwMHBAEAIgcCCC0KCAktDgQJACIJAgktDgUJACIJAgktDgYJACIJAgktDgIJJwICAC4tCAEEJwIFBAYACAEFAScDBAQBACIEAgUtCgUGLQ4CBgAiBgIGLQ4CBgAiBgIGLQ4CBgAiBgIGLQ4CBgAiBgIGLQ4CBi0IAQIAAAECAS0OBAInAgQEBS4IgEYAAyMAAAHsDSIAA4BMAAUkAgAFAAAFRiMAAAIBLQsCBS0IAQInAgYEBAAIAQYBJwMCBAEAIgICBi0KBgcuDIBHAAcAIgcCBy4MgEcABwAiBwIHLgyARwAHKwIABgAAAAAAAAAABQAAAAAAAAAALQgBBycCCAQFAAgBCAEnAwcEAQAiBwIILQoICS4MgEcACQAiCQIJLgyARwAJACIJAgkuDIBHAAkAIgkCCS0OBgktCAEGAAABAgEtDgIGLQgBAgAAAQIBLQ4HAi0IAQcAAAECAS4MgEYABy0IAQgAAAECAS4MgEUACC0LBQkAIgkCCS0OCQUuCIBGAAMjAAAC4wwqAwQJJAIACQAABPwjAAAC9ScCBAQJLQgACS0KBgotCgILLQoHDC0KCA0ACAAEACUAAAfALQIAAC0KCgMnAgIAAi0IAQQnAgUEAwAIAQUBJwMEBAEAIgQCBS0KBQYtDgIGACIGAgYtDgEGJwICBAUtCAAFLQoEBi4IgEsABy4IgEUACAAIAAIAJQAABc4tAgAALQoGAQsiAAGARwACCyIAAoBFAAUkAgAFAAADliUAAAecLQgBAicCBQQDAAgBBQEnAwIEAQAiAgIFLQoFBi0OAQYAIgYCBi0OAwYnAgUEBi0IAAYtCgIHLgiASwAILgiARQAJAAgABQAlAAAFzi0CAAAtCgcBCyIAAYBHAAILIgACgEUABSQCAAUAAAQHJQAAB5wvCgABAAIcCgIFARwKBQEAHAoBAgEkAgACAAAEKSUAAAg0LQsEAQAiAQIBLQ4BBCcCAgQFLQgABS0KBAYuCIBLAAcuCIBFAAgACAACACUAAAXOLQIAAC0KBgELIgABgEcAAgsiAAKARQAEJAIABAAABH4lAAAHnC0IAQInAgQEAwAIAQQBJwMCBAEAIgICBC0KBAUtDgEFACIFAgUtDgMFJwIDBAQtCAAELQoCBS4IgEsABi4IgEUABwAIAAMAJQAABc4tAgAALQoFAQsiAAGARwACCyIAAoBFAAMkAgADAAAE7yUAAAecMAiARwABLgiAQwABJgAiBQIKACoKAwstCwsJJwIKBAstCAALLQoGDC0KAg0tCgcOLQoIDy0KCRAACAAKACUAAAhGLQIAAAEiAAOASQAJLQoJAyMAAALjASIAA4BJAAUAIgcCCAAqCAMJLQsJBi0LAggMKgUECSQCAAkAAAVyJQAACWouAgAIgAMoAIAEBAAGJQAACXwuCIAFAAkAIgkCCgAqCgULLQ4GCy0OCQItCgUDIwAAAewoAIAEBHgADQAAAIAEgAMkAIADAAAFzSoBAAEF96Hzr6Wt1Mo8BAIBJiUAAAWlHAoCBQArAgAGAAAAAAAAAAABAAAAAAAAAAAEKgUGBy0IAQUnAgYEBAAIAQYBJwMFBAEAIgUCBi0KBgguDIBHAAgAIggCCC4MgEcACAAiCAIILgyARwAILQgBBicCCAQFAAgBCAEnAwYEAQAiBgIILQoICS4MgEcACQAiCQIJLgyARwAJACIJAgkuDIBHAAkAIgkCCS0OBwktCAEHAAABAgEtDgUHLQgBBQAAAQIBLQ4GBS0IAQYAAAECAS4MgEYABi0IAQgAAAECAS4MgEUACC0LAQkAIgkCCS0OCQEuCIBGAAQjAAAGuw0iAASASwAJJAIACQAABzsjAAAG0CQCAAMAAAbdIwAABw8nAgEECS0IAAktCgcKLQoFCy0KBgwtCggNLgiASgAOAAgAAQAlAAAIRi0CAAAjAAAHDycCAgQJLQgACS0KBwotCgULLQoGDC0KCA0ACAACACUAAAfALQIAAC0KCgEmDCoEAgkkAgAJAAAHTSMAAAeLACIBAgoAKgoECy0LCwknAgoECy0IAAstCgcMLQoFDS0KBg4tCggPLQoJEAAIAAoAJQAACEYtAgAAIwAAB4sBIgAEgEkACS0KCQQjAAAGuyoBAAEFAtxuJ4B2Ep08BAIBJioBAAEFCe7C8oeKUqo8BAIBJiUAAAWlLQsEBQsiAAWARQAGJAIABgAAB+InAgcEADwGBwEnAgUEBi0IAAYtCgEHLQoCCC0KAwktCgQKAAgABQAlAAAKCi0CAAAtCwEFLQsCBi0LAwctDgUBLQ4GAi0OBwMuDIBIAAQBIgAGgEkAAi0LAgEmKgEAAQWwxK72/na8PzwEAgEmJQAABaUtCwQGCyIABoBFAAckAgAHAAAIaCcCCAQAPAYIAS0LAwYLIgAGgEQAByQCAAcAAAj7IwAACIEtCwMGLQsBBy0LAggtCwQJDSIABoBEAAokAgAKAAAIpiUAAAlqLgIAB4ADKACABAQABCUAAAl8LgiABQAKACIKAgsAKgsGDC0OBQwBIgAGgEkABQ4qBgUHJAIABwAACOYlAAALGC0OCgEtDggCLQ4FAy0OCQQjAAAJaScCBgQHLQgABy0KAQgtCgIJLQoDCi0KBAsACAAGACUAAAoKLQIAAC0LAQYtCwIHLQsECC4CAAaAAygAgAQEAAQlAAAJfC4IgAUACQEiAAmASQAKLQ4FCi0OCQEtDgcCLgyASQADLQ4IBCMAAAlpJioBAAEFxWvEWg4QAAI8BAIBJi4BgAOABgsAgAYAAoAHJACABwAACZcjAAAJoi4AgAOABSMAAAoJLgAAAYAFAQAAAYAEAAEBAIADgASACS4AgAOACi4AgAWACwsAgAqACYAMJACADAAACfUuAYAKgAguBIAIgAsBAIAKAAKACgEAgAsAAoALIwAACcQoAYAFBAABAwCABgACgAYjAAAKCSYlAAAFpS4IgEYABSMAAAoaDSIABYBEAAYkAgAGAAAKhSMAAAovLQsCBS0LBQYAIgYCBi0OBgUtCAEGJwIHBAUACAEHAScDBgQBACIFAgcnAggEBAAiBgIJPw8ABwAJLQsBBS0LAwctCwQILQ4FAS0OBgItDgcDLQ4IBCYtCwMGDCoFBgckAgAHAAAKmyMAAAsHLQsCBgAiBgIIACoIBQktCwkHLQsBCAAiCAIKACoKBQstCwsJACoHCQotCwMHLQsECS4CAAaAAygAgAQEAAUlAAAJfC4IgAUACwAiCwIMACoMBQ0tDgoNLQ4IAS0OCwItDgcDLQ4JBCMAAAsHASIABYBJAAYtCgYFIwAAChoqAQABBUWnynEZQeQVPAQCASY=",
|
|
142
|
+
"debug_symbols": "tZvbbhQ5EIbfZa5z4XNV5VUQQgHCKlIUUBZWWiHefV12HRIkW7Pd4Yb+psb+2y6XD+UhPy+f7z/++OvDw9OXr39fbt/9vHx8fnh8fPjrw+PXT3ffH74+devPS+B/YqXLbb65xJblifMJ8hnkM8pnhPkk+Uzz+xTS5bbxE+YzRnnW+UzyOcn3Wcpn+Vzk+9LLU3/WPJ8typPmE8rlNpYO2NsfuQZWAVILsQVuLjlkAW7NhHa5TaEDtydlBrb0WjmzBRmqQAkKaqlqqWYhAXbgBBSApAACqK/AJsBtzpGhKtCEEoqCWqJaolpSVgAB9uuEJsCenSCvKDUoqGBVwaaCTQVBBYkh3Vxq5DKZgcv0XlR25oQmkNWS1VLUMprBUNVStUxLCqo8wrCPe6WigBNayApqiWqJaklJQS1Zy2QSKKLchlsGVAUu08OmDbcMQIHhlgFNgAd3QlXQ6qPxHSAEBbNIGeCJUgIDCaQikNVSu1tKHwtgR01oAhAUigIKoBZGrU5qIamO3LBSGKoCCXDUTVBLUktSC3t1AgiUpMCv6B1EHu4JVYEEmlpAy4DWQrWglmGv1u4NJJhA3OYBHAATet9rD1HiAJgAAlktWS1FLdzUARwJE6oCv7SvEtSKAgpwJExQC2oZ1FqkFpIyMfCCWYkpBiNU4ok0iWdSK4N4qRx1ucVCZqtsA6YWjHrzIQwiJY4Pof424DU88OIuBEoUjdQWQzbSujGaLVo5Xg+gDSIlbv0kXgAmsZ+BBhUjUmpma2YDs43WD+L4FgIlbj2mQU0ocYwLFaVotmjlUjQyW7ZymetWJh6FSdwPIVTiJYPYz4ljmSITB7OQ2XgHoKHMW4AQCY0dTAiUeDMTqkZWgyenkNmyqXBLKQ/qLSWOq7FzCZmNg1qoKY3WTyKlsbKxXhlL2yRQiskIlVI2Mlu2cjxuVAfxezlKxjYziWcz4aCmxPNDyGzFbMVso+eTzNasHG84k8DewRFGHE2VI0wIlMhspLYWklFTimaLVo59IKTvaBxXQqRUuBwMAiWe50JNiWe8UDUiJTCV0aNBvEQJmY2sHMdfX6H4+DeOUIJomNzKe1JfuRh5V1JshrwzKRZHNESvhm6l7GhWDONtHMoYk2MzTMGxOKJh9mrZxYpbi4vxltUXPcY2XMIxj7MXE92Ko711IBpScmyKFIJjcbRqFJMjGCa35miIpO2l4bNxOg4hOpIh7+WK/LZYx9E9O4LheIVgdSTD4tWKi1W3VhdrLtZcrLkYeDXwaujVcFhHijHO9wPjDMSJw1HAONo7cTRSEA1rchzDgozjxYGzjDheLFgdyXCGJ2MK0dEKpOnqwDhiUhAMRyAKouF06kS3jvbGyNiCYzWc7puIhujVeMMRJFcYEz0mzsNGIAqi4QhEwWY4OzTRqyUXy27NLlZcrLhYHWJ5YDNs2RENx9SbOPs2sanXRz6lWBRLMGudfuCRb2MtiTiSzOhYDWc3JxaNszbXkoE5O7q1uLW4tbq1urW5bnMrJMdmODJeQa+GXm1O/9E3Gn0bCfPs0ETSDsEct4luHR0SZAVOlXvKnRzdOhbHFAc2wxGegv4KCI7m9bnwC6IheRvIrBiSYzOMwdHehnM9w1+/bi564/Hh+/P9PV94vLgC6Rcj3+6e75++X26ffjw+3lz+uXv8MQr9/e3uaTy/3z33b3t3758+92cX/PLweM/068Zrh3XVVDl9GLVThWIC9bVCXCv0U1kRhX6McoV+JnglkTYS2FSB0ARygqsFqgr0HWIpUNYCfSTViX0kwSQS0iuJupbINYlCic0FAl3tyIKkbujnwqUjYS3RIOhYQJ+wLhFeewI3nmhRFcDHol+3HYooysuI2khwCqae6Me6ZSvixpuAUWMC+kHKNNpv45G2rtBmQKtlKZG3PeFMV7pSQ1iKbLsSvCs1LSU2wdmzBlGoPaJtgpR6/aiW5qNaV6O6U2io3kz91L6Mi01s1gA6Szvi0hG0lsAaNL776bmtJHb9gEjWj7z0RNoMaL8jVIlKRKtGpE1sYssq0W+njvWjRuvHi7Xi935sVs0+P3Sqt54qLvuxCUwEHw+IcKQf/Tyj/cB1XKXNstkP77nYBtLjwkXS/xABcpF+jbcU2YVnJBvWftRe7kN545B+u6DtqP02w2f7b/vIVqPaktMRDmrwXBaNHJcaW3+k4v7AtvbHG+zt+fTmntsmPCLZdON6S41NiNVky0YOxxQIbMLWY/1I2ftR0jENsL25L6HrnuxmPXozsOJq1pd0/uBa8tmT61bhuqNrPR/fpZ2N7603rzy9Frzu+NqvVpbH17JZMfqtn3qjX8nBsh3XxhYsd/j6BklRPZ0V1dNpUX2LvOj02lnfIDOqb5Aa1T+aG72MLFpm2+0NcqN2Pjdq53Oj9ha5UTufG7U/mhtR1H4kyvlIbkQtmALCMi7w/IrT6OyKs1W4asWBeH7FgXR2xdl689q7mHJ+N4P6Z3czj60cwnLNATgfW4BnY2urcFVsYTgfWxjPxtbWm1fGFuY3uOgrf3I3exlZaRlZ2Ha+sPS//94Oy1Yg7HLEhpYj0nIXwU1o9Z9t7RYipuUugruVr/8ebxHOv6WvRLaJUQ52l5FjPJigWXh1uU2Ctk3dU/XUPRxM/+1OpdayvobYBVjMdmXYDwiH8sToNzs8wQ5JXJe50+nMnU5n7uF84r6/wrVjSntxtf9/JN4g9U9+WEpwTOLKeRbOT7PdUT6kZJt7OzSo/QdmOx/0feWYRLNWRDzWimzB2fFYK2oKvinCMYnm+yrSsY4Ek8jpWEdysbNSrsc60izA+b9EHZIA0ACPQMeik9wXlA5JQNHIgtKOCJDlulQP+YGCBialYy2wyUFQT3bhd4H3/ePdp4fnV3/28Iulnh/uPj7ey8cvP54+vfj2+7/f9Bv9s4lvz18/3X/+8XzPSv63E/2fd6X/YlYovr+58H9FeJf6AbtfQvDHyN9295RA739xY/4D",
|
|
143
143
|
"brillig_names": [
|
|
144
144
|
"consume"
|
|
145
145
|
]
|
|
@@ -206,8 +206,8 @@
|
|
|
206
206
|
}
|
|
207
207
|
}
|
|
208
208
|
},
|
|
209
|
-
"bytecode": "
|
|
210
|
-
"debug_symbols": "
|
|
209
|
+
"bytecode": "JwACBAEoAAABBIBOJwAABAMnAgMEAicCBAQAHwoAAwAEgEsuCIBLAAEuCIBMAAIlAAAAUSUAAACKLgIAAYBNKAIAAgSATScCAwQBOw4AAwACKACAQwQAAygAgEQBAAAoAIBFBAAAKACARgAAACgAgEcBAAEoAIBIBAABKACASQAAASgAgEoEAAImJQAAAaoeAgADCQsiAAOASQAEJAIABAAAAKklAAAB0ycCAwACLQgBBCcCBQQDAAgBBQEnAwQEAQAiBAIFLQoFBi0OAwYAIgYCBi0OAQYnAgMEBS0IAAUtCgQGLgiASgAHLgiARAAIAAgAAwAlAAAB5S0CAAAtCgYBCyIAAYBGAAMLIgADgEQABCQCAAQAAAEfJQAAA/YtCAEDJwIEBAMACAEEAScDAwQBACIDAgQtCgQFLQ4BBQAiBQIFLQ4CBScCAgQELQgABC0KAwUuCIBKAAYuCIBEAAcACAACACUAAAHlLQIAAC0KBQELIgABgEYAAgsiAAKARAADJAIAAwAAAZAlAAAD9i8KAAEAAhwKAgMBHAoDAQAcCgECAS0KAgEmKACABAR4AA0AAACABIADJACAAwAAAdIqAQABBfeh86+lrdTKPAQCASYqAQABBUuQaMa9+INwPAQCASYlAAABqhwKAgUAKwIABgAAAAAAAAAAAQAAAAAAAAAABCoFBgctCAEFJwIGBAQACAEGAScDBQQBACIFAgYtCgYILgyARgAIACIIAgguDIBGAAgAIggCCC4MgEYACC0IAQYnAggEBQAIAQgBJwMGBAEAIgYCCC0KCAkuDIBGAAkAIgkCCS4MgEYACQAiCQIJLgyARgAJACIJAgktDgcJLQgBBwAAAQIBLQ4FBy0IAQUAAAECAS0OBgUtCAEGAAABAgEuDIBFAAYtCAEIAAABAgEuDIBEAAgtCwEJACIJAgktDgkBLgiARQAEIwAAAtINIgAEgEoACSQCAAkAAAOVIwAAAuckAgADAAAC9CMAAAMmJwIBBAktCAAJLQoHCi0KBQstCgYMLQoIDS4IgEkADgAIAAEAJQAABAgtAgAAIwAAAyYtCwgBCyIAAYBEAAIkAgACAAADQycCAwQAPAYDAScCAQQJLQgACS0KBwotCgULLQoGDC0KCA0ACAABACUAAAUsLQIAAC0LBwEtCwUCLQsGAy0OAQctDgIFLQ4DBi4MgEcACAEiAAKASAADLQsDASYMKgQCCSQCAAkAAAOnIwAAA+UAIgECCgAqCgQLLQsLCScCCgQLLQgACy0KBwwtCgUNLQoGDi0KCA8tCgkQAAgACgAlAAAECC0CAAAjAAAD5QEiAASASAAJLQoJBCMAAALSKgEAAQUC3G4ngHYSnTwEAgEmJQAAAaotCwQGCyIABoBEAAckAgAHAAAEKicCCAQAPAYIAS0LAwYLIgAGgEMAByQCAAcAAAS9IwAABEMtCwMGLQsBBy0LAggtCwQJDSIABoBDAAokAgAKAAAEaCUAAAY/LgIAB4ADKACABAQABCUAAAZRLgiABQAKACIKAgsAKgsGDC0OBQwBIgAGgEgABQ4qBgUHJAIABwAABKglAAAG3y0OCgEtDggCLQ4FAy0OCQQjAAAFKycCBgQHLQgABy0KAQgtCgIJLQoDCi0KBAsACAAGACUAAAUsLQIAAC0LAQYtCwIHLQsECC4CAAaAAygAgAQEAAQlAAAGUS4IgAUACQEiAAmASAAKLQ4FCi0OCQEtDgcCLgyASAADLQ4IBCMAAAUrJiUAAAGqLgiARQAFIwAABTwNIgAFgEMABiQCAAYAAAWsIwAABVEtCwIFLQsFBgAiBgIGLQ4GBScCBgQELQgBBycCCAQFAAgBCAEnAwcEAQAiBQIIJwIJBAQAIgcCCj8PAAgACi0LAQUtCwMGLQsECC0OBQEtDgcCLQ4GAy0OCAQmLQsDBgwqBQYHJAIABwAABcIjAAAGLi0LAgYAIgYCCAAqCAUJLQsJBy0LAQgAIggCCgAqCgULLQsLCQAqBwkKLQsDBy0LBAkuAgAGgAMoAIAEBAAFJQAABlEuCIAFAAsAIgsCDAAqDAUNLQ4KDS0OCAEtDgsCLQ4HAy0OCQQjAAAGLgEiAAWASAAGLQoGBSMAAAU8KgEAAQXFa8RaDhAAAjwEAgEmLgGAA4AGCwCABgACgAckAIAHAAAGbCMAAAZ3LgCAA4AFIwAABt4uAAABgAUBAAABgAQAAQEAgAOABIAJLgCAA4AKLgCABYALCwCACoAJgAwkAIAMAAAGyi4BgAqACC4EgAiACwEAgAoAAoAKAQCACwACgAsjAAAGmSgBgAUEAAEDAIAGAAKABiMAAAbeJioBAAEFRafKcRlB5BU8BAIBJg==",
|
|
210
|
+
"debug_symbols": "tZnbTis5EEX/pZ/z4Fv5wq8cIRQgHEWKAsqBkUaIf58qu3YlGalbodF5wasr9u5yebf7wuf0vHv8+P2wP768/pnufn1Oj6f94bD//XB4fdq+71+PHP2cnPzxKU53ccNtne4St5RHm5O2bbor3JakbR1tjdrqcdPjNo6DC9rm0XqvLU133jEEB0iAqhARSeiTMIoQIfQhGcUzCDkrSKodagAUhszQPCAPiM4DEPGI9FQ7NIWeagc5aWOIEVAUkgcgQuhDGJURyehTeFQIAk1Bcu7QaEByPPdQBDjVwKOSpDoAkcZ9ohPgUdFvJpKfOgTuHKMAKUQHQCQhkizSFAiRjD5S8A4FyoVzjuwaqh6QFRoiTSPZeQApeEQ8+oQAUOUsBR9QFZL0CQJZgTyAAE1BbD2gKhQM78kLiLUHINLQR9wdaTMVsfeAohAQkSsosklK9gACNIUSAUWhonNFpJ+0g0aqrHusDF6WoAlUhZAVogfwSRM7ocqaDkiAqkABkBUyOmcML4gUDC8YXjG8YnhD54bOTTs3JxH2YfMBwPNKXNXWU2X/tJ5qB4twxRKvcpPrfUBVyAGQFXqqHdC5oLOs6QBEpKoC3smlm0hIrt2UOzUQFVA/4aAM6qeUfc+JwVPtREZNiU9iVEAe/XywX2VjSU1INsFBPatBGdRXblABZYtJfuSEpBJKDSQOGyQWU8KIILuMEsYGz/mR71RB4nelDJINRSkZ2YhkKsliZCpkKtlU5GqlICR1ViogsZ9SBfV5CEWZR69p7M4bVEHeYuI5kjtglOuVUicyaqBeyUFV/RK7qwbBQ1FqqoRYcsHIYt5i3mIhGllMLmglMmqgZCOSjeg17ff0XtMe69kPqjqPJNkrWaw7YpCMFY+TbNRKFpMdiEonMmqgAGUKqB/FDEreqIAoGFnM1oNsPcjWg4qdo/sgfX1tJjzfPLyfdjt5vLl44OHHoLftaXd8n+6OH4fDZvpne/jonf68bY+9fd+e+Fd2/O74zC0LvuwPO6GvzXm0mx/Kjs1ehzPXaBK8o1yJ+HmREhM0SqRiErldKYR5hcaXuCq04N2cwjcmQrMTWRAhfqpRDYqtmgRd15MW0og5IYvk0zmJfJ1EXpCoGQoXKcRQbhYgCPAz7axAXVjPVmGp6sJ5PUO9Xo42LxFlS+sK/KR3FnDt5kKm2lAGSnm2kH7Bl7k4LEZx1V844roUfsGZ3jnUwjtfZvO40VXJ05yrfPq5rTz91FeLCjcZy5efO8vXn1prsZo3eiu427zFW8+st8LSvmk7VinnFfElrnJWTHPOCnGhFl5uwaMWvrjZLMJCPflVAMYoNc7v/7RYCqTBLx9pViIvziQXmwq52bvI8lTceSoUZiUW/EkF/iR2tV0liW5dVX54RS3444ObtfiyRDKJnNZJNHgryLA5ibiweVJodjt16xQaljRf7JzfmUaI52mksEoi26YVcourJIpdIaEslaL8XQ1+z7K7Wb7Yc76lwd8CoMGv/Os0mrMduIV1qxJsKiGUdVdJdJgJu8Svy8JuJay2aiLehWBPGHmVyfnd25aVb27rJLJl4eu6LKJdrP7y6fk7EhTc+c5c1knk8829tnUTObuTP5yuk0j2wHb5SvQNiZKwICXlNQLN7uz8CWqVgDu/lK3LwDzVCv1wCv8XuOfD7dP+dPUvgi+ROu23j4edHr58HJ8ufn3/9w2/4F8Mb6fXp93zx2knSuf/M/CfX5G/xceY7uXLGB+Wtqn9wMtvfJPmb+j3X5LKfw==",
|
|
211
211
|
"brillig_names": [
|
|
212
212
|
"is_consumable"
|
|
213
213
|
]
|
|
@@ -267,8 +267,8 @@
|
|
|
267
267
|
}
|
|
268
268
|
}
|
|
269
269
|
},
|
|
270
|
-
"bytecode": "
|
|
271
|
-
"debug_symbols": "
|
|
270
|
+
"bytecode": "JwACBAEoAAABBIBJJwAABAMnAgIEAScCAwQAHwoAAgADgEcuCIBHAAElAAAASyUAAABoLgIAAYBIKAIAAgSASCcCAwQBOw4AAwACKACAQwQAAygAgEQBAAAoAIBFBAAAKACARgQAASYlAAACIh4CAAIJJwIDAAEKKgIDBCQCAAQAAACJJQAAAksnAgIAAC0IAQQnAgUEBAAIAQUBJwMEBAEAIgQCBS0KBQYtDgIGACIGAgYtDgIGACIGAgYtDgIGKwIABQAAAAAAAAAAAgAAAAAAAAAALQgBBicCBwQFAAgBBwEnAwYEAQAiBgIHLQoHCC0OAggAIggCCC0OAggAIggCCC0OAggAIggCCC0OBQgtCAEFAAABAgEtDgQFLQgBBAAAAQIBLQ4GBC0IAQYAAAECAS4MgEUABi0IAQcAAAECAS4MgEQABycCCAQJLQgACS0KBQotCgQLLQoGDC0KBw0tCgMOAAgACAAlAAACXS0CAAAnAgMECC0IAAgtCgUJLQoECi0KBgstCgcMLQoBDQAIAAMAJQAAAl0tAgAALQsHAQsiAAGARAADJAIAAwAAAbsnAggEADwGCAEnAgEECC0IAAgtCgUJLQoECi0KBgstCgcMAAgAAQAlAAADhi0CAAAtCwQBASIAAYBGAAQtCwQDCioDAgELIgABgEQAAiQCAAIAAAIMJQAABJkvCgADAAEcCgEDARwKAwIAHAoCAQEmKACABAR4AA0AAACABIADJACAAwAAAkoqAQABBfeh86+lrdTKPAQCASYqAQABBYN7SGg+6XpAPAQCASYlAAACIi0LBAYLIgAGgEQAByQCAAcAAAJ/JwIIBAA8BggBLQsDBgsiAAaAQwAHJAIABwAAAxcjAAACmC0LAwYtCwEHLQsCCC0LBAkNIgAGgEMACicCCwEBJAIACgAAAsIlAAAEqy4CAAeAAygAgAQEAAQlAAAEvS4IgAUACgAiCgILACoLBgwtDgUMASIABoBGAAUOKgYFByQCAAcAAAMCJQAABUstDgoBLQ4IAi0OBQMtDgkEIwAAA4UnAgYEBy0IAActCgEILQoCCS0KAwotCgQLAAgABgAlAAADhi0CAAAtCwEGLQsCBy0LBAguAgAGgAMoAIAEBAAEJQAABL0uCIAFAAkBIgAJgEYACi0OBQotDgkBLQ4HAi4MgEYAAy0OCAQjAAADhSYlAAACIi4IgEUABSMAAAOWDSIABYBDAAYkAgAGAAAEBiMAAAOrLQsCBS0LBQYAIgYCBi0OBgUnAgYEBC0IAQcnAggEBQAIAQgBJwMHBAEAIgUCCCcCCQQEACIHAgo/DwAIAAotCwEFLQsDBi0LBAgtDgUBLQ4HAi0OBgMtDggEJi0LAwYMKgUGByQCAAcAAAQcIwAABIgtCwIGACIGAggAKggFCS0LCQctCwEIACIIAgoAKgoFCy0LCwkAKgcJCi0LAwctCwQJLgIABoADKACABAQABSUAAAS9LgiABQALACILAgwAKgwFDS0OCg0tDggBLQ4LAi0OBwMtDgkEIwAABIgBIgAFgEYABi0KBgUjAAADlioBAAEFAtxuJ4B2Ep08BAIBJioBAAEFxWvEWg4QAAI8BAIBJi4BgAOABgsAgAYAAoAHJACABwAABNgjAAAE4y4AgAOABSMAAAVKLgAAAYAFAQAAAYAEAAEBAIADgASACS4AgAOACi4AgAWACwsAgAqACYAMJACADAAABTYuAYAKgAguBIAIgAsBAIAKAAKACgEAgAsAAoALIwAABQUoAYAFBAABAwCABgACgAYjAAAFSiYqAQABBUWnynEZQeQVPAQCASY=",
|
|
271
|
+
"debug_symbols": "tZjdbuM4DIXfxde5kKgfSnmVQVGkbToIEKRFJllgUeTdl5R55GQBG1MP5ib+TEvHpChRcr6Gt/3L9efz4fT+8WvY/vgaXs6H4/Hw8/n48bq7HD5OYv0anP54V4dt2Azex2Eb9VrHK9l9ILvysPVeIBIgGyQPgCXDkmFhB4iAalACoBhUfQVtBvIBwAaERwRLgCXAEj0gGSQHiIBqkPGKXAxYBZ1CNigekADVoEZAGSE4ArBBi6IBLIQ2pL1k+EMIADZoUTRIgGqQ0DihcSYALIzuLQqF4gARgLdXdK/WODoHsLdHD4vOFJ8UtHsWoGwQIqAaRHWVFYpBIkA2yA4QAWjM6M6wFHQv2r0ItBQ0kDYk8ye5YOA9oBrotCZxLAV5KRWFZBDNkjVSqgrSOEiasuargfYaIQGqgUYa5BVZowikUAx0Ro2QDTQXI6BNDSOw8wBtLAPOngDVQKNo0PxpkAwiLFHbyMplHfAR2CAnA12VI6CxjnODgl5V/UkKeYSic2OECCgGzdUGaEweAEtA94DuAd21toSsUAxSMtBJMkI2aD43sDEshQA2zqWapepcDTJtasuXZLm2fDVggzZQDfI4AarWsRGSATsALAWWAkuFpZrFO+c7TbYK0gJhxCDqPaj3aCPHjTT2ZmtOj5RH971Tt426raV6JK3srlEFlW7TCRm1CDudkUZs5B2UvWNQWyUjVZD6PFJwnSZbb4ckCHW91N/Rcl5ut82Ajev5ct7vdd+628lkf/vcnfeny7A9XY/HzfDP7nhtjX597k7tetmd5anEtz+9yVUE3w/HvdJtM/V281095eytu3AJXcK7+CDi50U4RGjIeuUukeuDAs0ryDRmU6jk3ZzCNwJJs4EsiMRSgmnEKt0gkR7HMy24EXKEF7KhTE7kRyfygkTKpkCOukAgfhDghXTI0jWF4mhKh2zuDxJlXiIkwjj4PAm4R4E6L0C+Ihuk3eYk/EI2khaHJiGb2jqFilmVfVoVhowZwgh32fiOBPueT16KI/5dDTmyYlb4zGWdBjPWhxxzaZ1GdRhSOQ/Paywtstiz4lPMs4vML6Qls8NCZSkdd9XicZ3RwvTiXnH4bkA9h1X1hsJcvaGFyikbTMJYyMfIrBcUFuIofXpxCfP1Oy4OBdyQU1iclUiLkWTuoSQ3uwssh+KmUBLNSiyUz8SofalMhUu+Vn57K3IEBTmozNedJQkf+mKV2b5OIncvfFnnRej1U3CdF4nctFR5nUSeVnup6wKZao58mq6TiH1jvz/jfEOCIxLCMa8RqH2p17QqiOqmU9Y6D/qcku+EPwzh/wJPcrt7PZwf/sy5qdT5sHs57u32/Xp6vXt6+fcTT/Bn0Of543X/dj3vVWn6R0h+fpCcv+Uvkic9/MutfBVsZKnprdenskNSpqebOvMf",
|
|
272
272
|
"brillig_names": [
|
|
273
273
|
"is_reject_all"
|
|
274
274
|
]
|
|
@@ -338,8 +338,8 @@
|
|
|
338
338
|
}
|
|
339
339
|
}
|
|
340
340
|
},
|
|
341
|
-
"bytecode": "JwACBAEoAAABBIBSJwAABAMnAgIEAScCAwQAHwoAAgADgFEuCIBRAAElAAAARSUAAAC4KAIAAQSAUicCAgQAOw4AAgABKQCAQwBH2s1zKACARAQAAygAgEUBAAAoAIBGBAAAKACARwAAACgAgEgBAAEoAIBJBAABKACASgQAAigAgEsEAAQoAIBMAAAEKACATQAADigAgE4AADMoAIBPAAA3KwCAUAAAAAAAAAAAAgAAAAAAAAAAJiUAABYnKQIAAgC4Od6RCioBAgMnAgQEACcCBgQDACoEBgUtCAECAAgBBQEnAwIEAQAiAgIFLQ4EBQAiBQIFLQ4EBScCBQQDACoCBQQnAgQAAiQCAAMAAAEWIwAAA60tCAEDJwIFBAMACAEFAScDAwQBACIDAgUfMIBKgEkABS0IAQUAAAECAS0OAwUtCAEDAAABAgEuDIBGAAMnAgcECC0IAAgtCgUJLQoDCi4IgEwACwAIAAcAJQAAFlAtAgAALQoJBicCCAQJLQgACS0KBQotCgMLAAgACAAlAAAWyS0CAAAtCgoHJwIFBAgtCAAILQoHCQAIAAUAJQAAF0AtAgAALQoJAy0IAQUAAAECAS4MgEUABS0IAQcAAAECAS4MgEcABy0IAQgAAAECAScCCQBrLQ4JCB4CAAkBLQgBCicCCwQEAAgBCwEnAwoEAQAiCgILLQoLDC4MgEcADAAiDAIMLgyARwAMACIMAgwuDIBHAAwtCAELJwIMBAUACAEMAScDCwQBACILAgwtCgwNLgyARwANACINAg0uDIBHAA0AIg0CDS4MgEcADQAiDQINLgyAUAANLQgBDAAAAQIBLQ4KDC0IAQoAAAECAS0OCwotCAELAAABAgEuDIBGAAstCAENAAABAgEuDIBFAA0nAg4EDy0IAA8tCgwQLQoKES0KCxItCg0TLQoEFAAIAA4AJQAAF2UtAgAAJwIOBA8tCAAPLQoMEC0KChEtCgsSLQoNEy0KCRQACAAOACUAABdlLQIAACcCDgQPLQgADy0KDBAtCgoRLQoLEi0KDRMACAAOACUAABiOLQIAAC0KEAkLIgAJgEcACgsiAAqARQALJAIACwAAA0MlAAAZAicCDgQPLQgADy0KBRAtCgcRLQoIEi0KCRMuCIBPABQtCgYVAAgADgAlAAAZFC0CAAAtChAKLQoRCy0KEgwtChMNHAoDBQAwCgAFAA0AIgICBi0LBgUnAgcEAgAqBgcDOw4ABQADIwAAA60pAgADAIlV9fwKKgEDBS0LAgMAIgMCAy0OAwInAgMAASQCAAUAAAPaIwAABQQtCAEFJwIGBAIACAEGAScDBQQBACIFAgYfMIBJgEkABi0IAQYAAAECAS0OBQYtCAEFAAABAgEuDIBGAAUnAggECS0IAAktCgYKLQoFCwAIAAgAJQAAGugtAgAALQoKBycCBgQILQgACC0KBwkACAAGACUAABdALQIAAC0KCQUtCAEGAAABAgEuDIBFAAYtCAEHAAABAgEuDIBHAActCAEIAAABAgEnAgkAai0OCQgeAgAJAScCDgQPLQgADy0KBhAtCgcRLQoIEi0KAxMuCIBOABQtCgkVAAgADgAlAAAbRS0CAAAtChAKLQoRCy0KEgwtChMNHAoFBgAwCgAGAA0tCwIFACIFAgUtDgUCACICAgctCwcGJwIIBAIAKgcIBTsOAAYABSMAAAUEKQIABQAnFrFmCioBBQYkAgAGAAAFHyMAAAwFLQgBBicCBwQDAAgBBwEnAwYEAQAiBgIHHzCASoBJAActCAEHAAABAgEtDgYHLQgBBgAAAQIBLgyARgAGJwIJBAotCAAKLQoHCy0KBgwuCIBNAA0ACAAJACUAAB0ZLQIAAC0KCwgnAgoECy0IAAstCgcMLQoGDS4IgEwADgAIAAoAJQAAFlAtAgAALQoMCS0IAQYAAAECAS4MgEUABi0IAQcAAAECAS4MgEcABy0IAQoAAAECAScCCwBdLQ4LCicCDwQQLQgAEC0KBhEtCgcSLQoKEy0KAxQuCIBOABUtCggWAAgADwAlAAAbRS0CAAAtChELLQoSDC0KEw0tChQOJwIQBBEtCAARLQoLEi0KDBMtCg0ULQoOFQAIABAAJQAAHZItAgAALQoSDwsiAA+ARQALJAIACwAABl4lAAAdsR4CAAsBHgIADAMeAgANBC0IAQ4nAg8EBQAIAQ8BJwMOBAEAIg4CDy0KDxAtDgsQACIQAhAtDgwQACIQAhAtDg0QACIQAhAtDgkQJwIJAC4tCAELJwIMBAYACAEMAScDCwQBACILAgwtCgwNLQ4JDQAiDQINLQ4JDQAiDQINLQ4JDQAiDQINLQ4JDQAiDQINLQ4JDS0IAQkAAAECAS0OCwknAgsEBS4IgEYABSMAAAcODSIABYBLAAwkAgAMAAAVyCMAAAcjLQsJDC0IAQknAg0EBAAIAQ0BJwMJBAEAIgkCDS0KDQ4uDIBHAA4AIg4CDi4MgEcADgAiDgIOLgyARwAOKwIADQAAAAAAAAAABQAAAAAAAAAALQgBDicCDwQFAAgBDwEnAw4EAQAiDgIPLQoPEC4MgEcAEAAiEAIQLgyARwAQACIQAhAuDIBHABAAIhACEC0ODRAtCAENAAABAgEtDgkNLQgBCQAAAQIBLQ4OCS0IAQ4AAAECAS4MgEYADi0IAQ8AAAECAS4MgEUADy0LDBAAIhACEC0OEAwuCIBGAAUjAAAIBQwqBQsQJAIAEAAAFX4jAAAIFycCCwQQLQgAEC0KDREtCgkSLQoOEy0KDxQACAALACUAABiOLQIAAC0KEQUtCAEJJwILBAQACAELAScDCQQBACIJAgstCgsMLgyARwAMACIMAgwuDIBHAAwAIgwCDC4MgEcADC0IAQsnAgwEBQAIAQwBJwMLBAEAIgsCDC0KDA0uDIBHAA0AIg0CDS4MgEcADQAiDQINLgyARwANACINAg0uDIBQAA0tCAEMAAABAgEtDgkMLQgBCQAAAQIBLQ4LCS0IAQsAAAECAS4MgEYACy0IAQ0AAAECAS4MgEUADScCDgQPLQgADy0KDBAtCgkRLQoLEi0KDRMtCgQUAAgADgAlAAAXZS0CAAAnAg4EDy0IAA8tCgwQLQoJES0KCxItCg0TLQoIFAAIAA4AJQAAF2UtAgAAJwIPBBAtCAAQLQoMES0KCRItCgsTLQoNFAAIAA8AJQAAGI4tAgAALQoRDgsiAA6ARwAJCyIACYBFAAskAgALAAAJkyUAABkCJwIPBBAtCAAQLQoGES0KBxItCgoTLQoOFC4IgE8AFS0KBRYACAAPACUAABkULQIAAC0KEQktChILLQoTDC0KFA0nAg8EEC0IABAtCgkRLQoLEi0KDBMtCg0UAAgADwAlAAAdki0CAAAtChEOJAIADgAACgwlAAAdwy0IAQknAgsEBAAIAQsBJwMJBAEAIgkCCy0KCwwuDIBHAAwAIgwCDC4MgEcADAAiDAIMLgyARwAMLQgBCycCDAQFAAgBDAEnAwsEAQAiCwIMLQoMDS4MgEcADQAiDQINLgyARwANACINAg0uDIBHAA0AIg0CDS4MgFAADS0IAQwAAAECAS0OCQwtCAEJAAABAgEtDgsJLQgBCwAAAQIBLgyARgALLQgBDQAAAQIBLgyARQANJwIOBA8tCAAPLQoMEC0KCREtCgsSLQoNEy0KBBQACAAOACUAABdlLQIAACcCDgQPLQgADy0KDBAtCgkRLQoLEi0KDRMtCggUAAgADgAlAAAXZS0CAAAnAg4EDy0IAA8tCgwQLQoJES0KCxItCg0TAAgADgAlAAAYji0CAAAtChAICyIACIBHAAkLIgAJgEUACyQCAAsAAAtdJQAAGQInAg4EDy0IAA8tCgYQLQoHES0KChItCggTLgiATwAULQoFFQAIAA4AJQAAGRQtAgAALQoQCS0KEQstChIMLQoTDTAIgEcADScCBgQBJwIIBAMAKgYIBy0IAQUACAEHAScDBQQBACIFAgctDgYHACIHAgctDgYHJwIHBAMAKgUHBi0KBgcuDIBDAAcAIgUCCC0LCAcnAgoEAgAqCAoGOw4ABwAGIwAADAUpAgAFAGGWa3wKKgEFBiQCAAYAAAwgIwAADwMtCAEFJwIGBAQACAEGAScDBQQBACIFAgYfMIBEgEkABi0IAQYAAAECAS0OBQYtCAEFAAABAgEuDIBGAAUnAggECS0IAAktCgYKLQoFCwAIAAgAJQAAHdUtAgAALQoKBwEiAAeASQAJLQsJCCcCCQQKLQgACi0KBgstCgUMAAgACQAlAAAd1S0CAAAtCgsHASIAB4BJAAotCwoJJwIKBAstCAALLQoGDC0KBQ0ACAAKACUAAB3VLQIAAC0KDAcnAgYECi0IAAotCgcLAAgABgAlAAAXQC0CAAAtCgsFLQgBBgAAAQIBLgyARQAGLQgBBwAAAQIBLgyARwAHLQgBCgAAAQIBJwILAEstDgsKHgIACwEeAgAMAAoqCwwNJAIADQAADUglAAAeTC0IAQsnAgwEBAAIAQwBJwMLBAEAIgsCDC0KDA0uDIBHAA0AIg0CDS4MgEcADQAiDQINLgyARwANLQgBDCcCDQQFAAgBDQEnAwwEAQAiDAINLQoNDi4MgEcADgAiDgIOLgyARwAOACIOAg4uDIBHAA4AIg4CDi4MgFAADi0IAQ0AAAECAS0OCw0tCAELAAABAgEtDgwLLQgBDAAAAQIBLgyARgAMLQgBDgAAAQIBLgyARQAOJwIPBBAtCAAQLQoNES0KCxItCgwTLQoOFC0KBBUACAAPACUAABdlLQIAACcCDwQQLQgAEC0KDREtCgsSLQoMEy0KDhQtCggVAAgADwAlAAAXZS0CAAAnAg8EEC0IABAtCg0RLQoLEi0KDBMtCg4UAAgADwAlAAAYji0CAAAtChEICyIACIBHAAsLIgALgEUADCQCAAwAAA6ZJQAAGQInAg8EEC0IABAtCgYRLQoHEi0KChMtCggULgiATwAVLQoJFgAIAA8AJQAAGRQtAgAALQoRCy0KEgwtChMNLQoUDhwKBQYAMAoABgAOACICAgctCwcGJwIIBAIAKgcIBTsOAAYABSMAAA8DKQIAAgBG+0TaCioBAgUkAgAFAAAPHiMAABCgLQgBAicCBQQCAAgBBQEnAwIEAQAiAgIFHzCASYBJAAUtCAEFAAABAgEtDgIFLQgBAgAAAQIBLgyARgACJwIHBAgtCAAILQoFCS0KAgoACAAHACUAABroLQIAAC0KCQYBIgAGgEkABS0LBQItCAEFAAABAgEuDIBFAAUtCAEGAAABAgEuDIBHAAYtCAEHAAABAgEnAggAQi0OCAceAgAICQoqCAMJJAIACQAAD9AlAAAeXicCDAQNLQgADS0KBQ4tCgYPLQoHEC0KAxEuCIBOABItCgITAAgADAAlAAAbRS0CAAAtCg4ILQoPCS0KEAotChELJwIFBAwtCAAMLQoIDS0KCQ4tCgoPLQoLEAAIAAUAJQAAHZItAgAALQoNAhwKAgUAJwIGBAEnAggEAwAqBggHLQgBAgAIAQcBJwMCBAEAIgICBy0OBgcAIgcCBy0OBgcnAgcEAwAqAgcGLQoGBy0OBQcAIgICBy0LBwYnAggEAgAqBwgFOw4ABgAFIwAAEKApAgACAPjUXpsKKgECBSQCAAUAABC7IwAAE7EtCAECJwIFBAMACAEFAScDAgQBACICAgUfMIBKgEkABS0IAQUAAAECAS0OAgUtCAECAAABAgEuDIBGAAInAgcECC0IAAgtCgUJLQoCCi4IgE0ACwAIAAcAJQAAHRktAgAALQoJBicCCAQJLQgACS0KBQotCgILLgiATAAMAAgACAAlAAAWUC0CAAAtCgoHLQgBAgAAAQIBLgyARQACLQgBBQAAAQIBLgyARwAFLQgBCAAAAQIBJwIJAB0tDgkIHgIACQkKKgkDCiQCAAoAABGQJQAAHnAtCAEDJwIJBAQACAEJAScDAwQBACIDAgktCgkKLgyARwAKACIKAgouDIBHAAoAIgoCCi4MgEcACi0IAQknAgoEBQAIAQoBJwMJBAEAIgkCCi0KCgsuDIBHAAsAIgsCCy4MgEcACwAiCwILLgyARwALACILAgsuDIBQAAstCAEKAAABAgEtDgMKLQgBAwAAAQIBLQ4JAy0IAQkAAAECAS4MgEYACS0IAQsAAAECAS4MgEUACycCDAQNLQgADS0KCg4tCgMPLQoJEC0KCxEtCgQSAAgADAAlAAAXZS0CAAAnAgQEDC0IAAwtCgoNLQoDDi0KCQ8tCgsQLQoGEQAIAAQAJQAAF2UtAgAAJwIGBAwtCAAMLQoKDS0KAw4tCgkPLQoLEAAIAAYAJQAAGI4tAgAALQoNBAsiAASARwADCyIAA4BFAAYkAgAGAAAS4SUAABkCJwILBAwtCAAMLQoCDS0KBQ4tCggPLQoEEC4IgE8AES0KBxIACAALACUAABkULQIAAC0KDQMtCg4GLQoPCS0KEAonAgQECy0IAAstCgMMLQoGDS0KCQ4tCgoPAAgABAAlAAAdki0CAAAtCgwCHAoCAwAnAgQEAScCBgQDACoEBgUtCAECAAgBBQEnAwIEAQAiAgIFLQ4EBQAiBQIFLQ4EBScCBQQDACoCBQQtCgQFLQ4DBQAiAgIFLQsFBCcCBgQCACoFBgM7DgAEAAMjAAATsScCAgJVJwIDAm4nAgQCaycCBQJvJwIGAncnAgcCICcCCAJzJwIJAmUnAgoCbCcCCwJjJwIMAnQnAg0CcicCDgJ7JwIPAn0tCAEQJwIRBBwACAERAScDEAQBACIQAhEtChESLQ4CEgAiEgISLQ4DEgAiEgISLQ4EEgAiEgISLQ4DEgAiEgISLQ4FEgAiEgISLQ4GEgAiEgISLQ4DEgAiEgISLQ4HEgAiEgISLQ4IEgAiEgISLQ4JEgAiEgISLQ4KEgAiEgISLQ4JEgAiEgISLQ4LEgAiEgISLQ4MEgAiEgISLQ4FEgAiEgISLQ4NEgAiEgISLQ4HEgAiEgISLQ4OEgAiEgISLQ4IEgAiEgISLQ4JEgAiEgISLQ4KEgAiEgISLQ4JEgAiEgISLQ4LEgAiEgISLQ4MEgAiEgISLQ4FEgAiEgISLQ4NEgAiEgISLQ4PEgsggEWASAACJAIAAgAAFX0nAgMEHi0IAQQnAgUEHgAIAQUBLQoEBSoDAAUFJ0ZIsvVBF70AIgUCBQAiEAIGJwIHBBsuAgAGgAMuAgAFgAQuAgAHgAUlAAAegicCBgQbACoFBgUuDIBJAAUAIgUCBS0OAQUAIgUCBTwOAwQmACIMAhEAKhEFEi0LEhAnAhEEEi0IABItCg0TLQoJFC0KDhUtCg8WLQoQFwAIABEAJQAAF2UtAgAAASIABYBJABAtChAFIwAACAUBIgAFgEkADAAiDgIPACoPBRAtCxANLQsJDwwqDAsQJAIAEAAAFfQlAAAeyC4CAA+AAygAgAQEAAYlAAAe2i4IgAUAEAAiEAIRACoRDBItDg0SLQ4QCS0KDAUjAAAHDigAgAQEeAANAAAAgASAAyQAgAMAABZPKgEAAQX3ofOvpa3UyjwEAgEmJQAAFicnAgYEBy0IAActCgEILQoCCQAIAAYAJQAAFsktAgAALQoIBQsiAAOATAABASIABYBJAAYtCwYCJAIAAQAAFrsjAAAWmQsiAAOATQABJAIAAQAAFrInAgUEADwGBQEtCgIEIwAAFsQtCgIEIwAAFsQtCgQBJiUAABYnLQsBAy0LAgQNIgAEgEoABSQCAAUAABbrJQAAHsgAIgMCBgAqBgQHLQsHBS0IAQYnAgcEAgAIAQcBJwMGBAEAIgYCBy0KBwgtDgUIASIABIBJAAUOKgQFByQCAAcAABczJQAAH2gtDgMBLQ4FAi0KBgEmJQAAFicBIgABgEkAAy0LAwIcCgIDARwKAwEAHAoBAgEtCgIBJiUAABYnLQsEBgsiAAaARQAHJAIABwAAF4cnAggEADwGCAEtCwMGCyIABoBEAAckAgAHAAAYGiMAABegLQsDBi0LAQctCwIILQsECQ0iAAaARAAKJAIACgAAF8UlAAAeyC4CAAeAAygAgAQEAAQlAAAe2i4IgAUACgAiCgILACoLBgwtDgUMASIABoBJAAUOKgYFByQCAAcAABgFJQAAH2gtDgoBLQ4IAi0OBQMtDgkEIwAAGI0nAgYEBy0IAActCgEILQoCCS0KAwotCgQLAAgABgAlAAAfei0CAAAtCwEGLQsCBy0LBAguAgAGgAMoAIAEBAAEJQAAHtouCIAFAAkAIgkCCgEiAAqARgALLQ4FCy0OCQEtDgcCLgyASQADLQ4IBCMAABiNJiUAABYnLQsEBQsiAAWARQAGJAIABgAAGLAnAgcEADwGBwEnAgUEBi0IAAYtCgEHLQoCCC0KAwktCgQKAAgABQAlAAAfei0CAAAtCwEFLQsCBi0LAwctDgUBLQ4GAi0OBwMuDIBIAAQBIgAGgEkAAi0LAgEmKgEAAQUC3G4ngHYSnTwEAgEmJQAAFictCAELJwIMBAQACAEMAScDCwQBACILAgwtCgwNLgyARwANACINAg0uDIBHAA0AIg0CDS4MgEcADS0IAQwnAg0EBQAIAQ0BJwMMBAEAIgwCDS0KDQ4uDIBHAA4AIg4CDi4MgEcADgAiDgIOLgyARwAOACIOAg4uDIBQAA4tCAENAAABAgEtDgsNLQgBCwAAAQIBLQ4MCy0IAQwAAAECAS4MgEYADC0IAQ4AAAECAS4MgEUADicCDwQQLQgAEC0KDREtCgsSLQoMEy0KDhQtCgQVAAgADwAlAAAXZS0CAAAnAgQEDy0IAA8tCg0QLQoLES0KDBItCg4TLQoGFAAIAAQAJQAAF2UtAgAAJwIGBA8tCAAPLQoNEC0KCxEtCgwSLQoOEwAIAAYAJQAAGI4tAgAALQoQBAsiAAWATgAGCyIABIBHAAskAgAGAAAarSMAABpqCyIABYBPAAYkAgAGAAAagycCDAQAPAYMAQsiAAuARQAFJAIABQAAGpglAAAZAi0KAQctCgIILQoDCS0KBAojAAAa1wsiAAuARQAFJAIABQAAGsIlAAAZAi0KAQctCgIILQoDCS0KBAojAAAa1y0KCgQtCgcBLQoIAi0KCQMmJQAAFictCwEDLQsCBAsiAASARgAFJAIABQAAGwolAAAeyAEiAAOASQAFLQsFBC0IAQUnAgYEAgAIAQYBJwMFBAEAIgUCBi0KBgctDgQHLQ4DAS4MgEkAAi0KBQEmJQAAFictCAELJwIMBAQACAEMAScDCwQBACILAgwtCgwNLgyARwANACINAg0uDIBHAA0AIg0CDS4MgEcADS0IAQwnAg0EBQAIAQ0BJwMMBAEAIgwCDS0KDQ4uDIBHAA4AIg4CDi4MgEcADgAiDgIOLgyARwAOACIOAg4uDIBQAA4tCAENAAABAgEtDgsNLQgBCwAAAQIBLQ4MCy0IAQwAAAECAS4MgEYADC0IAQ4AAAECAS4MgEUADicCDwQQLQgAEC0KDREtCgsSLQoMEy0KDhQtCgQVAAgADwAlAAAXZS0CAAAnAgQEDy0IAA8tCg0QLQoLES0KDBItCg4TLQoGFAAIAAQAJQAAF2UtAgAAJwIGBA8tCAAPLQoNEC0KCxEtCgwSLQoOEwAIAAYAJQAAGI4tAgAALQoQBAsiAAWATgAGCyIABIBHAAskAgAGAAAc3iMAABybCyIABYBPAAYkAgAGAAActCcCDAQAPAYMAQsiAAuARQAFJAIABQAAHMklAAAZAi0KAQctCgIILQoDCS0KBAojAAAdCAsiAAuARQAFJAIABQAAHPMlAAAZAi0KAQctCgIILQoDCS0KBAojAAAdCC0KCgQtCgcBLQoIAi0KCQMmJQAAFicnAgYEBy0IAActCgEILQoCCQAIAAYAJQAAFsktAgAALQoIBQsiAAOATAABASIABYBJAAYtCwYCJAIAAQAAHYQjAAAdYgsiAAOATQABJAIAAQAAHXsnAgUEADwGBQEtCgIEIwAAHY0tCgIEIwAAHY0tCgQBJiUAABYnLwoABAAFHAoFBgEcCgYEABwKBAUBLQoFASYqAQABBQnuwvKHilKqPAQCASYqAQABBbDErvb+drw/PAQCASYlAAAWJy0LAQMtCwIEDSIABIBEAAUkAgAFAAAd9yUAAB7IACIDAgYAKgYEBy0LBwUtCAEGJwIHBAIACAEHAScDBgQBACIGAgctCgcILQ4FCAEiAASASQAFDioEBQckAgAHAAAePyUAAB9oLQ4DAS0OBQItCgYBJioBAAEFV30t5qSTyho8BAIBJioBAAEFg3tIaD7pekA8BAIBJioBAAEFS5Boxr34g3A8BAIBJgEAgAOABYAHLgCAA4AILgCABIAJCwCACIAHgAokAIAKAAAexy4BgAiABi4EgAaACQEAgAgAAoAIAQCACQACgAkjAAAeliYqAQABBcVrxFoOEAACPAQCASYuAYADgAYLAIAGAAKAByQAgAcAAB71IwAAHwAuAIADgAUjAAAfZy4AAAGABQEAAAGABAABAQCAA4AEgAkuAIADgAouAIAFgAsLAIAKgAmADCQAgAwAAB9TLgGACoAILgSACIALAQCACgACgAoBAIALAAKACyMAAB8iKAGABQQAAQMAgAYAAoAGIwAAH2cmKgEAAQVFp8pxGUHkFTwEAgEmJQAAFicuCIBGAAUjAAAfig0iAAWARAAGJAIABgAAH/UjAAAfny0LAgUtCwUGACIGAgYtDgYFLQgBBicCBwQFAAgBBwEnAwYEAQAiBQIHJwIIBAQAIgYCCT8PAAcACS0LAQUtCwMHLQsECC0OBQEtDgYCLQ4HAy0OCAQmLQsDBgwqBQYHJAIABwAAIAsjAAAgdy0LAgYAIgYCCAAqCAUJLQsJBy0LAQgAIggCCgAqCgULLQsLCQAqBwkKLQsDBy0LBAkuAgAGgAMoAIAEBAAFJQAAHtouCIAFAAsAIgsCDAAqDAUNLQ4KDS0OCAEtDgsCLQ4HAy0OCQQjAAAgdwEiAAWASQAGLQoGBSMAAB+K",
|
|
342
|
-
"debug_symbols": "
|
|
341
|
+
"bytecode": "JwACBAEoAAABBIBOJwAABAMnAgIEAScCAwQAHwoAAgADgE0uCIBNAAElAAAARSUAAACOKAIAAQSATicCAgQAOw4AAgABKQCAQwBH2s1zKACARAQAAygAgEUBAAAoAIBGBAAAKACARwAAACgAgEgBAAEoAIBJBAABKACASgAAASgAgEsEAAIoAIBMBAAEJiUAABFwKQIAAgC4Od6RCioBAgMnAgQEACcCBgQDACoEBgUtCAECAAgBBQEnAwIEAQAiAgIFLQ4EBQAiBQIFLQ4EBScCBQQDACoCBQQtCwIEACIEAgQtDgQCJwIEAAIkAgADAAAA+SMAAAK1LQgBAycCBQQDAAgBBQEnAwMEAQAiAwIFHzCAS4BJAAUtCAEFAAABAgEtDgMFLQgBAwAAAQIBLgyARgADJwIHBAgtCAAILQoFCS0KAwoACAAHACUAABGZLQIAAC0KCQYBIgAGgEkACC0LCAcnAggECS0IAAktCgUKLQoDCwAIAAgAJQAAEZktAgAALQoKBgEiAAaASQAFLQsFAxwKAwYBHAoGBQAeAgADAS0IAQYnAggEAwAIAQgBJwMGBAEAIgYCCC0KCAktDgQJACIJAgktDgMJJwIIBAktCAAJLQoGCi4IgEsACy4IgEUADAAIAAgAJQAAEhAtAgAALQoKAwsiAAOARwAGCyIABoBFAAgkAgAIAAACEyUAABPeLQgBBicCCAQDAAgBCAEnAwYEAQAiBgIILQoICS0OAwkAIgkCCS0OBwknAgcECC0IAAgtCgYJLgiASwAKLgiARQALAAgABwAlAAASEC0CAAAtCgkDCyIAA4BHAAYLIgAGgEUAByQCAAcAAAKEJQAAE94wCgAFAAMtCwIDACIDAgMtDgMCACICAgYtCwYFJwIHBAIAKgYHAzsOAAUAAyMAAAK1KQIAAwCJVfX8CioBAwUkAgAFAAAC0CMAAAPhLQgBAycCBQQCAAgBBQEnAwMEAQAiAwIFHzCASYBJAAUtCAEFAAABAgEtDgMFLQgBAwAAAQIBLgyARgADJwIHBAgtCAAILQoFCS0KAwoACAAHACUAABPwLQIAAC0KCQYBIgAGgEkABS0LBQMcCgMGARwKBgUAHgIAAwEtCAEGJwIHBAMACAEHAScDBgQBACIGAgctCgcILgyASgAIACIIAggtDgMIJwIHBAgtCAAILQoGCS4IgEsACi4IgEUACwAIAAcAJQAAEhAtAgAALQoJAwsiAAOARwAGCyIABoBFAAckAgAHAAADvSUAABPeMAoABQADACICAgYtCwYFJwIHBAIAKgYHAzsOAAUAAyMAAAPhKQIAAwAnFrFmCioBAwUkAgAFAAAD/CMAAAlILQgBBScCBgQDAAgBBgEnAwUEAQAiBQIGHzCAS4BJAAYtCAEGAAABAgEtDgUGLQgBBQAAAQIBLgyARgAFJwIIBAktCAAJLQoGCi0KBQsACAAIACUAABGZLQIAAC0KCgcBIgAHgEkACS0LCQgnAgkECi0IAAotCgYLLQoFDAAIAAkAJQAAEZktAgAALQoLBwEiAAeASQAGLQsGBS0IAQYnAgcEAwAIAQcBJwMGBAEAIgYCBy0KBwkuDIBKAAkAIgkCCS0OCAknAgkECi0IAAotCgYLLgiASwAMLgiARQANAAgACQAlAAASEC0CAAAtCgsHCyIAB4BHAAYLIgAGgEUACSQCAAkAAAUJJQAAE94vCgAHAAYcCgYJARwKCQcAHAoHBgELIgAGgEUAByQCAAcAAAUzJQAAFE0eAgAGAR4CAAcDHgIACQQtCAEKJwILBAUACAELAScDCgQBACIKAgstCgsMLQ4GDAAiDAIMLQ4HDAAiDAIMLQ4JDAAiDAIMLQ4FDCcCBQAuLQgBBicCBwQGAAgBBwEnAwYEAQAiBgIHLQoHCS0OBQkAIgkCCS0OBQkAIgkCCS0OBQkAIgkCCS0OBQkAIgkCCS0OBQktCAEFAAABAgEtDgYFJwIGBAUuCIBGAAMjAAAF4w0iAAOATAAHJAIABwAAEREjAAAF+C0LBQctCAEFJwIJBAQACAEJAScDBQQBACIFAgktCgkKLgyARwAKACIKAgouDIBHAAoAIgoCCi4MgEcACisCAAkAAAAAAAAAAAUAAAAAAAAAAC0IAQonAgsEBQAIAQsBJwMKBAEAIgoCCy0KCwwuDIBHAAwAIgwCDC4MgEcADAAiDAIMLgyARwAMACIMAgwtDgkMLQgBCQAAAQIBLQ4FCS0IAQUAAAECAS0OCgUtCAEKAAABAgEuDIBGAAotCAELAAABAgEuDIBFAAstCwcMACIMAgwtDgwHLgiARgADIwAABtoMKgMGDCQCAAwAABDHIwAABuwnAgYEDC0IAAwtCgkNLQoFDi0KCg8tCgsQAAgABgAlAAAUXy0CAAAtCg0DLQgBBScCBgQDAAgBBgEnAwUEAQAiBQIGLQoGBy0OBAcAIgcCBy0OCAcnAgcECC0IAAgtCgUJLgiASwAKLgiARQALAAgABwAlAAASEC0CAAAtCgkGCyIABoBHAAcLIgAHgEUACCQCAAgAAAeIJQAAE94tCAEHJwIIBAMACAEIAScDBwQBACIHAggtCggJLQ4GCQAiCQIJLQ4DCScCCAQJLQgACS0KBwouCIBLAAsuCIBFAAwACAAIACUAABIQLQIAAC0KCgYLIgAGgEcABwsiAAeARQAIJAIACAAAB/klAAAT3i8KAAYABxwKBwgBHAoIBgAcCgYHASQCAAcAAAgbJQAAFNMtCwUGACIGAgYtDgYFJwIHBAgtCAAILQoFCS4IgEsACi4IgEUACwAIAAcAJQAAEhAtAgAALQoJBgsiAAaARwAFCyIABYBFAAckAgAHAAAIcCUAABPeLQgBBScCBwQDAAgBBwEnAwUEAQAiBQIHLQoHCC0OBggAIggCCC0OAwgnAgYEBy0IAActCgUILgiASwAJLgiARQAKAAgABgAlAAASEC0CAAAtCggDCyIAA4BHAAULIgAFgEUABiQCAAYAAAjhJQAAE94wCIBHAAMnAgUEAScCBwQDACoFBwYtCAEDAAgBBgEnAwMEAQAiAwIGLQ4FBgAiBgIGLQ4FBicCBgQDACoDBgUtCgUGLgyAQwAGACIDAgctCwcGJwIIBAIAKgcIBTsOAAYABSMAAAlIKQIAAwBhlmt8CioBAwUkAgAFAAAJYyMAAAtYLQgBAycCBQQEAAgBBQEnAwMEAQAiAwIFHzCARIBJAAUtCAEFAAABAgEtDgMFLQgBAwAAAQIBLgyARgADJwIHBAgtCAAILQoFCS0KAwoACAAHACUAABTlLQIAAC0KCQYBIgAGgEkACC0LCAcnAggECS0IAAktCgUKLQoDCwAIAAgAJQAAFOUtAgAALQoKBgEiAAaASQAJLQsJCCcCCQQKLQgACi0KBQstCgMMAAgACQAlAAAU5S0CAAAtCgsGASIABoBJAAUtCwUDHAoDBgEcCgYFAB4CAAMBHgIABgAKKgMGCSQCAAkAAApSJQAAFVwtCAEDJwIGBAMACAEGAScDAwQBACIDAgYtCgYJLQ4ECQAiCQIJLQ4HCScCBwQJLQgACS0KAwouCIBLAAsuCIBFAAwACAAHACUAABIQLQIAAC0KCgYLIgAGgEcAAwsiAAOARQAHJAIABwAACsMlAAAT3i0IAQMnAgcEAwAIAQcBJwMDBAEAIgMCBy0KBwktDgYJACIJAgktDggJJwIHBAgtCAAILQoDCS4IgEsACi4IgEUACwAIAAcAJQAAEhAtAgAALQoJBgsiAAaARwADCyIAA4BFAAckAgAHAAALNCUAABPeMAoABQAGACICAgYtCwYFJwIHBAIAKgYHAzsOAAUAAyMAAAtYKQIAAgBG+0TaCioBAgMkAgADAAALcyMAAAzaLQgBAicCAwQCAAgBAwEnAwIEAQAiAgIDHzCASYBJAAMtCAEDAAABAgEtDgIDLQgBAgAAAQIBLgyARgACJwIGBActCAAHLQoDCC0KAgkACAAGACUAABPwLQIAAC0KCAUBIgAFgEkAAy0LAwIeAgADCQsiAAOASgAFJAIABQAAC/glAAAVbi0IAQMnAgUEAwAIAQUBJwMDBAEAIgMCBS0KBQYuDIBKAAYAIgYCBi0OAgYnAgUEBi0IAAYtCgMHLgiASwAILgiARQAJAAgABQAlAAASEC0CAAAtCgcCCyIAAoBHAAMLIgADgEUABSQCAAUAAAxrJQAAE94vCgACAAMcCgMFARwKBQIAJwIFBAEnAgcEAwAqBQcGLQgBAwAIAQYBJwMDBAEAIgMCBi0OBQYAIgYCBi0OBQYnAgYEAwAqAwYFLQoFBi0OAgYAIgMCBi0LBgUnAgcEAgAqBgcCOw4ABQACIwAADNopAgACAPjUXpsKKgECAyQCAAMAAAz1IwAADvotCAECJwIDBAMACAEDAScDAgQBACICAgMfMIBLgEkAAy0IAQMAAAECAS0OAgMtCAECAAABAgEuDIBGAAInAgYEBy0IAActCgMILQoCCQAIAAYAJQAAEZktAgAALQoIBQEiAAWASQAHLQsHBicCBwQILQgACC0KAwktCgIKAAgABwAlAAARmS0CAAAtCgkFASIABYBJAAMtCwMCHgIAAwkLIgADgEoABSQCAAUAAA2pJQAAFYAtCAEDJwIFBAMACAEFAScDAwQBACIDAgUtCgUHLQ4EBwAiBwIHLQ4GBycCBQQGLQgABi0KAwcuCIBLAAguCIBFAAkACAAFACUAABIQLQIAAC0KBwQLIgAEgEcAAwsiAAOARQAFJAIABQAADholAAAT3i0IAQMnAgUEAwAIAQUBJwMDBAEAIgMCBS0KBQYtDgQGACIGAgYtDgIGJwIEBAUtCAAFLQoDBi4IgEsABy4IgEUACAAIAAQAJQAAEhAtAgAALQoGAgsiAAKARwADCyIAA4BFAAQkAgAEAAAOiyUAABPeLwoAAgADHAoDBAEcCgQCACcCBAQBJwIGBAMAKgQGBS0IAQMACAEFAScDAwQBACIDAgUtDgQFACIFAgUtDgQFJwIFBAMAKgMFBC0KBAUtDgIFACIDAgUtCwUEJwIGBAIAKgUGAjsOAAQAAiMAAA76JwICAlUnAgMCbicCBAJrJwIFAm8nAgYCdycCBwIgJwIIAnMnAgkCZScCCgJsJwILAmMnAgwCdCcCDQJyJwIOAnsnAg8CfS0IARAnAhEEHAAIAREBJwMQBAEAIhACES0KERItDgISACISAhItDgMSACISAhItDgQSACISAhItDgMSACISAhItDgUSACISAhItDgYSACISAhItDgMSACISAhItDgcSACISAhItDggSACISAhItDgkSACISAhItDgoSACISAhItDgkSACISAhItDgsSACISAhItDgwSACISAhItDgUSACISAhItDg0SACISAhItDgcSACISAhItDg4SACISAhItDggSACISAhItDgkSACISAhItDgoSACISAhItDgkSACISAhItDgsSACISAhItDgwSACISAhItDgUSACISAhItDg0SACISAhItDg8SCyCARYBIAAIkAgACAAAQxicCAwQeLQgBBCcCBQQeAAgBBQEtCgQFKgMABQUnRkiy9UEXvQAiBQIFACIQAgYnAgcEGy4CAAaAAy4CAAWABC4CAAeABSUAABWSJwIGBBsAKgUGBS4MgEkABQAiBQIFLQ4BBQAiBQIFPA4DBCYAIgcCDQAqDQMOLQsODCcCDQQOLQgADi0KCQ8tCgUQLQoKES0KCxItCgwTAAgADQAlAAAV2C0CAAABIgADgEkADC0KDAMjAAAG2gEiAAOASQAHACIKAgsAKgsDDC0LDAktCwULDCoHBgwkAgAMAAARPSUAABb8LgIAC4ADKACABAQABiUAABcOLgiABQAMACIMAg0AKg0HDi0OCQ4tDgwFLQoHAyMAAAXjKACABAR4AA0AAACABIADJACAAwAAEZgqAQABBfeh86+lrdTKPAQCASYlAAARcC0LAQMtCwIEDSIABIBLAAUkAgAFAAARuyUAABb8ACIDAgYAKgYEBy0LBwUtCAEGJwIHBAIACAEHAScDBgQBACIGAgctCgcILQ4FCAEiAASASQAFDioEBQckAgAHAAASAyUAABecLQ4DAS0OBQItCgYBJiUAABFwHAoCBQArAgAGAAAAAAAAAAABAAAAAAAAAAAEKgUGBy0IAQUnAgYEBAAIAQYBJwMFBAEAIgUCBi0KBgguDIBHAAgAIggCCC4MgEcACAAiCAIILgyARwAILQgBBicCCAQFAAgBCAEnAwYEAQAiBgIILQoICS4MgEcACQAiCQIJLgyARwAJACIJAgkuDIBHAAkAIgkCCS0OBwktCAEHAAABAgEtDgUHLQgBBQAAAQIBLQ4GBS0IAQYAAAECAS4MgEYABi0IAQgAAAECAS4MgEUACC0LAQkAIgkCCS0OCQEuCIBGAAQjAAAS/Q0iAASASwAJJAIACQAAE30jAAATEiQCAAMAABMfIwAAE1EnAgEECS0IAAktCgcKLQoFCy0KBgwtCggNLgiASgAOAAgAAQAlAAAV2C0CAAAjAAATUScCAgQJLQgACS0KBwotCgULLQoGDC0KCA0ACAACACUAABRfLQIAAC0KCgEmDCoEAgkkAgAJAAATjyMAABPNACIBAgoAKgoECy0LCwknAgoECy0IAAstCgcMLQoFDS0KBg4tCggPLQoJEAAIAAoAJQAAFdgtAgAAIwAAE80BIgAEgEkACS0KCQQjAAAS/SoBAAEFAtxuJ4B2Ep08BAIBJiUAABFwLQsBAy0LAgQLIgAEgEYABSQCAAUAABQSJQAAFvwBIgADgEkABS0LBQQtCAEFJwIGBAIACAEGAScDBQQBACIFAgYtCgYHLQ4EBy0OAwEuDIBJAAItCgUBJioBAAEFCe7C8oeKUqo8BAIBJiUAABFwLQsEBQsiAAWARQAGJAIABgAAFIEnAgcEADwGBwEnAgUEBi0IAAYtCgEHLQoCCC0KAwktCgQKAAgABQAlAAAXri0CAAAtCwEFLQsCBi0LAwctDgUBLQ4GAi0OBwMuDIBIAAQBIgAGgEkAAi0LAgEmKgEAAQWwxK72/na8PzwEAgEmJQAAEXAtCwEDLQsCBA0iAASARAAFJAIABQAAFQclAAAW/AAiAwIGACoGBActCwcFLQgBBicCBwQCAAgBBwEnAwYEAQAiBgIHLQoHCC0OBQgBIgAEgEkABQ4qBAUHJAIABwAAFU8lAAAXnC0OAwEtDgUCLQoGASYqAQABBVd9Leakk8oaPAQCASYqAQABBYN7SGg+6XpAPAQCASYqAQABBUuQaMa9+INwPAQCASYBAIADgAWABy4AgAOACC4AgASACQsAgAiAB4AKJACACgAAFdcuAYAIgAYuBIAGgAkBAIAIAAKACAEAgAkAAoAJIwAAFaYmJQAAEXAtCwQGCyIABoBFAAckAgAHAAAV+icCCAQAPAYIAS0LAwYLIgAGgEQAByQCAAcAABaNIwAAFhMtCwMGLQsBBy0LAggtCwQJDSIABoBEAAokAgAKAAAWOCUAABb8LgIAB4ADKACABAQABCUAABcOLgiABQAKACIKAgsAKgsGDC0OBQwBIgAGgEkABQ4qBgUHJAIABwAAFnglAAAXnC0OCgEtDggCLQ4FAy0OCQQjAAAW+ycCBgQHLQgABy0KAQgtCgIJLQoDCi0KBAsACAAGACUAABeuLQIAAC0LAQYtCwIHLQsECC4CAAaAAygAgAQEAAQlAAAXDi4IgAUACQEiAAmASQAKLQ4FCi0OCQEtDgcCLgyASQADLQ4IBCMAABb7JioBAAEFxWvEWg4QAAI8BAIBJi4BgAOABgsAgAYAAoAHJACABwAAFykjAAAXNC4AgAOABSMAABebLgAAAYAFAQAAAYAEAAEBAIADgASACS4AgAOACi4AgAWACwsAgAqACYAMJACADAAAF4cuAYAKgAguBIAIgAsBAIAKAAKACgEAgAsAAoALIwAAF1YoAYAFBAABAwCABgACgAYjAAAXmyYqAQABBUWnynEZQeQVPAQCASYlAAARcC4IgEYABSMAABe+DSIABYBEAAYkAgAGAAAYKSMAABfTLQsCBS0LBQYAIgYCBi0OBgUtCAEGJwIHBAUACAEHAScDBgQBACIFAgcnAggEBAAiBgIJPw8ABwAJLQsBBS0LAwctCwQILQ4FAS0OBgItDgcDLQ4IBCYtCwMGDCoFBgckAgAHAAAYPyMAABirLQsCBgAiBgIIACoIBQktCwkHLQsBCAAiCAIKACoKBQstCwsJACoHCQotCwMHLQsECS4CAAaAAygAgAQEAAUlAAAXDi4IgAUACwAiCwIMACoMBQ0tDgoNLQ4IAS0OCwItDgcDLQ4JBCMAABirASIABYBJAAYtCgYFIwAAF74=",
|
|
342
|
+
"debug_symbols": "tZ3Zbh03EobfRde+YHEt5lWCIHASJTBgOIFjDzAI/O7D2o80aKZ9+ujG/PoXu7gV95b1z9Nvz798/ePnD59+//Pvpx9+/Ofpl88fPn788MfPH//89f2XD39+Wuo/T4n+gTqefoB3T9C6hB2efsgUdgmHPg99xqRhk3Dq87TnyWFOVUOUEIqG+pyzhkPCut6rK2xFQ5Sw63PX56HPuPLVKGwSUj44rBoihyUVDZf9sUKoGqKElA8Ou4QFNNTnmjRc780Vtqyh/rxr/N401HQonxxqOqjPOCSc6z1IBFOgUk4BCFCB6gwaASm4gHIrMBSKKcWUakrtCi0ZNANqJUqiVwNUGNnAFLQ4aG9NU6bGaYneWu3SIBmgAtUsA1VtHgRNgSpXwJRmSnNlKpAnCKACZbUkgqFAXiHQFKYpU+P0lA1MATCgt8qCXBQozwJTgRyhrDrsTTy/t6qheH5njyVr7LIElE+BoYCmzMLdblCmKMyJ3XvkqqF0i1H0uehz1Wdyx0Zhl7CDhk3DKeGQbjFQ3Hlg01DcdcyiobgnpqyhPgNo2MRbkWpIYIi3InsiA5VyVRWSJ9ZO0BUaGJjSTemmjGRgClocynVdvQ+ptwtUAxSYSZUJyUDfmtmUbHEyjRKr0SZ1dwaqWAauWYZVnLbKPq1hpzXstIad1rDTGnZqw0LSloWkTbugGkyFYkoxpZqiDbygK2gTL2gGU0FbGZI284JmMBW0pRdI0wJoWy8wRVt7hZQEElF7K1msYu/pWAmgg+WCaqDJQjOloUKXkRSAGlxgxenAhEY0biq5Nl2bpmUqhJJrUJxWnjvVJ887St2oJCfXqser/m5zrXm8Tu8OJjQixxWioVOJKoImyEwz5aB3S0pOrpHXjsaERjw3MfHshExLQypbqUtDfpe6GXYiGpuUmlF3rbs2XKO6V0IjqnulYTSzk6VWEziRZWrLSuVQqk7TKLuWXSuuFTSiVlAaRjSGKHWj7ql1z0F3y8MtD7eMbhnNciP/n4mIxoXJyyJy8tmZuhHVuJJrzbXmGuVKybXh8WjMEEJPg3x8kr90Wq8IkRcr+U+za9m14hoNwELVterxqCcqeRpUa0LcGYUoXmNCI/IIpWFEM6xSVxrk2UrVaRrRqKLkWvZ41BsnMlWnadRco8F3TqZhRDOFUnOaRjRuKNkbPNEpuQbgxNMdr3dhOlJeDUMtoZZQawkcjjSSGNIqLVHJeS40bIHTcYSKERfDwgx1RlxZYlKlzTQcpWyMMpkL8uKTXH/KhC44HGuoNdQWKhdIkDqAYQuk7ACNWJN8zBAdMQeGOiPuNAs5pRqIjsAWBmFOgehYuiP15jUbMFKBMlvgAimG2lml/UWijmJIZcvIOB1p7DekhAsQ8rpAcRgCjaCGoUIJdAs8ExtG3MIWKuN05AIJ8tpfkJulDMYaOB1HqCNUDFUKxEgTguEwzFwgWggt7I40KRhWxxxqjrglLJRQa8StbKEQcmMJctkU0ZF2Y2ukZ6QC0eIv8+xsGOoMdaIh7yMNQ4VQaYmhyLs0xe4oBRIMVQokSGqj1iw0mxg2Ry6bYqhDdu650JBHwDvJyjAUqD8ImJJNyaYU3UnXMhVqNUAFXY0uGApdlpOZN5AMIxt0BV2NLmgK05RZDVDWl7mRvwiBxmrQDKZCLgZDQVejC0ypYNB4gZkbHS4IWJxub3XNbBuW6KgGliiaglrWxs5P3thpxlOqsg/KPIcLsbc3PsfgeYT2E7nzPMJF7TyPCPJYK8hjbWcL7ByC7ByKofZQe6g8SinWwOlIMzp0OWFBRy6XYjeUTaqixx1QAkPNEZf7AK2CM8/oilI2Rj6fUCQfHolxOvIopRjqCHWEygVSHI5cIEXKzqBhAXmUUmyB0xFCzRE3h4USaom4PAKPTsgjsKCUjbGXQD7bobZAKhCPbUjlEcLihEbTNN7s0qsTigJlqDI0hZoMTGmmNFN60VOzrv2at7YC3Q7U7ITNj9ymdrA59TAspWRQDfT8K0ExMMWO3lLWHl94I6zE1VIJeQmFfIjHrq84Hdk9kF+T2mTkMV8xVAwVQ2X3UHQVUgmkZqQdQQFeWyh2R57EFEMtEbeEhRpqjbjcC2ZlREfuy4Ls74pUeFqiFjmITWyBz2IVm04rJacUGCqECjVwOuZQc6ilBKJjzYHDsYXauqNPYgtb4HTkYiqGSmUTmAJFp7JSMhh0hWJKMaWaUmVyK6UVAz0pLj0bdIUBBnpqWzAb2HmxTmULqsG0o+NqoC7P8zD7dyV/UbJY2d4rxWDY4TMY2LF0M6U1gykn05X6MMMA60M8F0tv4eNcRXF7QTqHTxS30aho2B0hVAg1h5pb4HSkHm1I57aJ8tqoSxsOxwaBofaI28PCCHVEXNoVZT5Wb3JYzchlY+zUAxT5pBoKYw2cjjnUHGoJlQskWHPgcOQCQWfsjj0FVscR6oi4GBYw1Blx5SiempunZ0UpmyA60qIp00am8LnyWiETcoEUvaOPWgNDbaE27/6jl8BQR6jDB4WBOdAHhTEh0FWMkQuTDwoyPQvKBYkgOuZQeb3REuN0rKHWUFuoLdQeag91hDpCxVAx1BnqdFVmbkV0lAIJhppDzaHy3KLYHXk3q9gceW5RjISjmLwAMIwkRiTBTSiIkQRGwjOSmJGwl7gmL3FNXuKavMQLh2POgd2xQGBzrCkwkqiRcIskWiTcI4keCY9IYkTCGElgJIyRxIyEpych6wdFT0LWD4qeBGQI9CSgpMAa6AlDjSRqJNwiiRYJ90iiR8I87tAxReVTd0UebASpbxo2Q15VGN6o05EveBWHYwm1hMrTgWJYaGG3R2o91Mg6H7krIgRG3BlxpRST7kylFII3KuWBLgQrXxcboiOXTbE7UmMZxmslXuNiKobawljnhIFvc6l2SibEHBgqN4tiM6xcIEV05CNkYJpGlHEh6lZKw4jmMyXXmsWTS96eGGsgJdg5AteKIFeFIhWvU45arYGhUk9dG2DG4Ug91TDUEeoIlRtfkWqFdqBrZVQC0bDz4kaQFzeK/prM+nTpW2XWL6yyWwqyW5bOWAOn4wh1hIqhIjrOUKfHHeyWgpAC2esGYU6BzbGEWkKtoXIDCLZQW8TlD0EUIzWudcXhyLVeGmNz5C6nWAPREFMJHI4Agd1RupxgqCXi8nBCF/NrgQuB3bGHKh2G+vqUDiNYA9ERcmB3zPFaDlWyIxgqf9xA+/XK87BhDURH9nXF7jjitRHGMFQMY7zurfxNBldqzYRcCsVQefVOJ6QtyVcajOw7ijUQHXmxqxivtXiN3Uiwh8r9ghF4hKVRo/Eht+HQoaLxHKhYSiDqUNF446zICXe2y5WqOB17qD3UESpPfII82Hb5gMXGh8ZH1Fy/jffFmT4MaDKZCXLPUmyBlFoju5lzpoiO3NyK3ZGbWzFeG2EMQ8UwNsPYdGMyxSnWQH+tQA5klb/VYX8QbDbEN94rK8qoTM3Ct8iG6IjFWqigt1uZoU4bthvfIBt2RwgVQs2hipcITmssnsUUq7dmFS8RbIH+muwSK2Hn7NTGOB2l4zDyaKTYHaXjdELe+dXB2AKnI+9qFYfjiLgYEbj66PaiySTBOCSTgt1ROrrgcMyhSn4nofRuwenI+1dBXpooxmvSpQXDAm/IaUm5EB25Oyl2R54ZFGugvyYzg2KokAPdGOYUyMbI+5DbQnE4sj8ooiOXTVDKNhhrIDoOU3uSYjZCnrBbp0/IJOuCw1GyLtjVzzrIsCLYHEuoJdQaag21hdrCbg9VSiGIjjyNK8ZrGK/xNM5lA55Q6MKiZykQI/dNLlCWtmDMoXKBFNkC8nd1NTBUXhi3yYiO7H2KkUTPgV7rOk4ycikUIw8z1BlxxeUIS8qBnloBsfDt27sn+3j25y+fn5/p29mbr2l//Ofpr/efnz99efrh09ePH989/ef9x68c6e+/3n/i8Mv7z+uny02fP/22wmXw9w8fn4m+vYu30/GrhQ98+e111DncwBxnLazJoqsFuk64w8LywqoW1t1yO7JQNhbWzboVY/GIiujzdC4aWD2uo/J0Tzlm90xMPKzLfmwBwQysQyZ/f53dnTZAJ5ZqYBwawE1rlumtuU42wkTtZ02siUMtDLhqIJdDAzuX7LQnl0KsfdFRQ0DeeoO3ZbupyvayZ8HGKVsa5lAL8cgl6duSw+ZsdPEi7bmWmYcmdgWpE7wggIcF2TgVlB79E6I61zTw0sbY2PBBYnWNaNM8zlto7pgpH1uYG79amxurzXQz1q27zxc28m68pDU4m6g37bGOqM7XZsXwrNoPazNvGnWd61uLrEtzCBvpZW3k7ZiZfLxb27fjVj3rXLUcORd90HTVuXK/6lxbC6ecK+MDnGteda5tbZ50LjoOPONcawN56Fxl4xijm1+Mm5EPRrnPtfqha5W6XVe4iXrTJK+zUTYVus6FbCrBtdw7GoHLfk72QRxyPjSxG/vWibu7+DpyH3esbzIWjHXaPFxlzd2QMelrWs1GyumuCWmm6K25HjVshcsza81vO7Mi+sg1b5ZKrwtSrw9+tV0d/LYWTg1+dVwf/CpeHfy2tXly8Gvp+uDX4E0Hv1vXKoeDXyvXB79WLw9+rV0e/Fp/wOC3cS7o2U30En01DzjdKPSlp/WTdaB12Cjzen/v6Wp/31o41d97vt7fe7na37e1ebK/93a9v/f+lv39hWvNw/7edx4ONabmmwOQ19nouw0Sgu+8b88PXvWzkbZ1YdkYvdVDE7AtSR9elHXhdGRkX5Q4RMB2OO6M3f59mIO2m+VSqe07mrX2aNbDFcLWREerz3WDc+gZo19eLY3xpqulNdJOL0g5rIuxadN1zW4m2pzzcBrYuCf24idsvd1ZkAZekJsR41VBcLd9B+/u6wD90Dlx45w4okXG8ZS4d63qgw4euxZuRs+csFSfS5ZrhJH8HUbGDCOz5EMjY3ty6g2bb04iXs9IuBlC14Wg5WNd/d2cPL6aT7Y2mo87C8edNgDdRoFjG7v64As0rQ/sh/UxHzDLz8uz/NwsQjP4QUCm9w5tbFwsbgfWJfV9FubwHtvuKwd/g6XlqPk+G8Mn6DWIHpdk2+0x8oHt+EA4pQecCCe4fCS8NXHuTDiV604OqV4+Fd5W6cnFLKR+/VwY0njbg+EXTjaOVz7pAZslgMu7pb2Jc04GDxhJAcp1J3vAjgngAVsmgLfdM9262DzcjgM8YNMEcH3XBPn6tgnyI/ZN/1KaUxsnyG+7c5pgRcmbA7C9iZ7cBB7f4OZH3Hzm61ef+frdZ37A5SeU67ef+QHXn1AecP8J5Y0vQG+cjH499fgzgQfcgEK5fAW6N3HOyQo+wsku34Luq/Ssk9UH3INCfdOL0BcudnxfBvUBN6FQr1+FQr1+Fwr1jS9DC/gsV+Cuz95KaugWyuHnYrC7bHrMfWoGv9hd3G4d9ZW3t3z5lBB2d06PuFTN0HOUBvOmNBtfXf3f1g913Tcfl2bnq9XPtrC2R7TNzado/1eajZXafIFZN1/ZwCNunuD61RNcv3uCR1w+wfXbJ3jE9ROcvX/armR2F1CPWMm8cLJ2eKwN2zuo0042rzvZvOxku0uo00428mUn21bpWScb9QErmdHeciXzwsXGsYvtbqJOr2QGXl/J7C6jzq5kdrdRp1cy+zmme8vQ/xdajueY3Z3UKNXbt7TjnOwupSagzbozQ3pEadp9MyZiien/eM2Mj9j74/W9P17f++Mj9v7z+t4fH7H3n/kBg9nuWuoBg9mti+XjRdnuUun08ePs148f57h+/DjxEceP+9KcOn7Mu6uU68ePrfjg3so8vCPLKV8fP/Ludurkl+1bE+c+bU/t+viRd3dTJz9u31bp2V+dSHh9xZ23FykPWHHfOlmFwzuyDPAAJ9t/bXrKyfa/LnXKyXa/63TayXZ3UyedbFulZ51s98tKZyepvLuduj5JvXCxcrgOyjldn6Ty7m7q5CSVc748SeXtLz2dnaT+pTTnJqndb+qcm6S267Hkv7l766evDiDz7l7J8zCiSerLZt1+jlKSf0FWAA772/6zGO9uy9zxZzH7D6ayeUa7/cDn+z668tO+dnvI9trG7jds+E5CigLt+OucvQn/FI4GnLtMnPteKpfLH0ztTZz6YmpXkJMfTG1/EdjnlNxvvqv+HhMnP7naFiRuovO4z8TJnpaud7TtfUX2s/nU72pU4PtlHX8r3mcibggA78tFceeE2/X995hoOf67gDruMxH/X8DtJPBdBfFJYF2Y31eQUn0JeXvw8z0mujs4/V2Pu0yMYQ6+jt3u884ZdTHzXSZG9Qmx9nsMTF8rzXZXPcwUJ2j35cA7xxztYhHuM9AwVja38+jpq9XuPev2V7W+xwCEgX6PgTbtfLincVcOfD/UR35p4Kf1+P7XD59f/N3Eb2Tq84f3v3x81sffv3769eanX/77l/3E/u7iX5///PX5t6+fn8lS/PHF9c+PdLD8jv7g1U/vngo9p7XFW7fNfT3Tf/j3I67j8XWARY/AP1/X1PSfqPz0jTL4Pw==",
|
|
343
343
|
"brillig_names": [
|
|
344
344
|
"public_dispatch"
|
|
345
345
|
]
|
|
@@ -387,8 +387,8 @@
|
|
|
387
387
|
}
|
|
388
388
|
}
|
|
389
389
|
},
|
|
390
|
-
"bytecode": "
|
|
391
|
-
"debug_symbols": "
|
|
390
|
+
"bytecode": "JwACBAEoAAABBIBMJwAABAMnAgMEAicCBAQAHwoAAwAEgEodAIBLgEsBLgiASgABLgiASwACJQAAAFIlAAAAhCgCAAEEgEwnAgIEADsOAAIAASgAgEMEAAMoAIBEAQAAKACARQQAACgAgEYAAAAoAIBHAQABKACASAQAASgAgEkEAAImJQAAAYEeAgADAScCBAACLQgBBScCBgQDAAgBBgEnAwUEAQAiBQIGLQoGBy0OBAcAIgcCBy0OAwcnAgQEBi0IAAYtCgUHLgiASQAILgiARAAJAAgABAAlAAABqi0CAAAtCgcDCyIAA4BGAAQLIgAEgEQABSQCAAUAAAEEJQAAA74tCAEEJwIFBAMACAEFAScDBAQBACIEAgUtCgUGLQ4DBgAiBgIGLQ4BBicCAwQFLQgABS0KBAYuCIBJAAcuCIBEAAgACAADACUAAAGqLQIAAC0KBgELIgABgEYAAwsiAAOARAAEJAIABAAAAXUlAAADvhwKAgMAMAoAAwABJigAgAQEeAANAAAAgASAAyQAgAMAAAGpKgEAAQX3ofOvpa3UyjwEAgEmJQAAAYEcCgIFACsCAAYAAAAAAAAAAAEAAAAAAAAAAAQqBQYHLQgBBScCBgQEAAgBBgEnAwUEAQAiBQIGLQoGCC4MgEYACAAiCAIILgyARgAIACIIAgguDIBGAAgtCAEGJwIIBAUACAEIAScDBgQBACIGAggtCggJLgyARgAJACIJAgkuDIBGAAkAIgkCCS4MgEYACQAiCQIJLQ4HCS0IAQcAAAECAS0OBQctCAEFAAABAgEtDgYFLQgBBgAAAQIBLgyARQAGLQgBCAAAAQIBLgyARAAILQsBCQAiCQIJLQ4JAS4IgEUABCMAAAKXDSIABIBJAAkkAgAJAAADXSMAAAKsJAIAAwAAArkjAAAC7icCAQABJwICBAktCAAJLQoHCi0KBQstCgYMLQoIDS0KAQ4ACAACACUAAAPQLQIAACMAAALuLQsIAQsiAAGARAACJAIAAgAAAwsnAgMEADwGAwEnAgEECS0IAAktCgcKLQoFCy0KBgwtCggNAAgAAQAlAAAE9C0CAAAtCwcBLQsFAi0LBgMtDgEHLQ4CBS0OAwYuDIBHAAgBIgACgEgAAy0LAwEmDCoEAgkkAgAJAAADbyMAAAOtACIBAgoAKgoECy0LCwknAgoECy0IAAstCgcMLQoFDS0KBg4tCggPLQoJEAAIAAoAJQAAA9AtAgAAIwAAA60BIgAEgEgACS0KCQQjAAAClyoBAAEFAtxuJ4B2Ep08BAIBJiUAAAGBLQsEBgsiAAaARAAHJAIABwAAA/InAggEADwGCAEtCwMGCyIABoBDAAckAgAHAAAEhSMAAAQLLQsDBi0LAQctCwIILQsECQ0iAAaAQwAKJAIACgAABDAlAAAGBy4CAAeAAygAgAQEAAQlAAAGGS4IgAUACgAiCgILACoLBgwtDgUMASIABoBIAAUOKgYFByQCAAcAAARwJQAABqctDgoBLQ4IAi0OBQMtDgkEIwAABPMnAgYEBy0IAActCgEILQoCCS0KAwotCgQLAAgABgAlAAAE9C0CAAAtCwEGLQsCBy0LBAguAgAGgAMoAIAEBAAEJQAABhkuCIAFAAkBIgAJgEgACi0OBQotDgkBLQ4HAi4MgEgAAy0OCAQjAAAE8yYlAAABgS4IgEUABSMAAAUEDSIABYBDAAYkAgAGAAAFdCMAAAUZLQsCBS0LBQYAIgYCBi0OBgUnAgYEBC0IAQcnAggEBQAIAQgBJwMHBAEAIgUCCCcCCQQEACIHAgo/DwAIAAotCwEFLQsDBi0LBAgtDgUBLQ4HAi0OBgMtDggEJi0LAwYMKgUGByQCAAcAAAWKIwAABfYtCwIGACIGAggAKggFCS0LCQctCwEIACIIAgoAKgoFCy0LCwkAKgcJCi0LAwctCwQJLgIABoADKACABAQABSUAAAYZLgiABQALACILAgwAKgwFDS0OCg0tDggBLQ4LAi0OBwMtDgkEIwAABfYBIgAFgEgABi0KBgUjAAAFBCoBAAEFxWvEWg4QAAI8BAIBJi4BgAOABgsAgAYAAoAHJACABwAABjQjAAAGPy4AgAOABSMAAAamLgAAAYAFAQAAAYAEAAEBAIADgASACS4AgAOACi4AgAWACwsAgAqACYAMJACADAAABpIuAYAKgAguBIAIgAsBAIAKAAKACgEAgAsAAoALIwAABmEoAYAFBAABAwCABgACgAYjAAAGpiYqAQABBUWnynEZQeQVPAQCASY=",
|
|
391
|
+
"debug_symbols": "tZjRbts6DIbfJde9kEhKlPoqwzBkXTYECNIiaw9wUPTdDymRTHsAG5mL3VSfGek3Rf2WXL/ufhy+v/z6djz/fPy9u//yuvt+OZ5Ox1/fTo8P++fj41mir7ukfzLy7h7vdplgd1+15dmWbG2dbbXratds11ys7bNtZG3b3XdpO1rLo4WUrbXrjNbO/gB2DfY7Sv8MCt1AMxxQikGVqeSiQA7dgD3CHmke0QwHdHDgCahJ5qZQDXJyIAPwCHgf9FHoEfI+JKMgCxQw0JwnNAOWmYPenTUio0gFoSuIICaBwgZVdBAUqoEuyASPNI80j/TkYJGSsgMbZHCQNFCsUQAc2AA9gh4hj1A1KB4p3qeigyvr6kzoBk37ZAU20NWZUCfUlByKQzfI6NAMgBw8gt5HHYUkQOjQDKpH1BIoi8IJHDySs0Nx6AZq4gneGb3zWEoF8kjR6bCCpirrzmNxFTg5FAe9hViC1cYTmsEo1IA6oY1CDSAHG96yR7INbwAOPhx9OHpn9M7knbViJIZsuk8M0I2CpLxNUyUxUtNUJ3hENwVChTaha3knVAN94iaQg3cG76zlHYAe0aoOUPMTKUjpSOrcx00FclLTG1WncbtJej/dwhLqUB7UndQrRuyke6VR9KvxK2tubVBzGkkN0kfSqBrlkd+kiI38+qDmpDabpPYyqk4UI3T3MYqx+lSWpKRuM6pOajwjCmpOLUa0UOkR664CKQVRkKpkJa3zJMhB1UlXdJLOw4ispjDmMUi3GaOIqeGK+Cyj7hAFB3Un3SOMmtNwFA1iJ8xB1YkiRhErESsRqxGroccR06fZqDvpxmcUI3qMGDXVGdGoqcZoZD9Isy/zEGcnjJhmP2lUsgwqTiViuv2U8QqgLp6k+6BRKLPXj1oK8jqT5mzk9x2HjFEJ8vUosR4l+z3K8AG+vd3t/JXl2/PlcNA3lnfvMPJm87S/HM7Pu/vzy+l0t/tnf3oZnX4/7c+jfd5f5Fdx3uH8Q1oR/Hk8HZTe7q6j0/JQyarb6CzHXQiUjwp5WUGOVr+/YAuF2j8owLJCkwqaQiu5LimszULWJWaR29IsaEUBK7kCZQqFXOmDRFmRaNUV+jUFeeJuFiguAAkWBXhZgHvzpWgJrosJ7WMl27IE6mM4FOjdSkDqNxeS2tVQVBcLmVeWs3LyxeDU8lUjfSxFXrGlHH5eCzlweDGPW11FuPhs4OdtlemzvlpVuMlYuX7eWZk/a63Vat7qrX6bt6DWRW/BijG4ui/43YaXGTc5qy46C2BNIjZNPRcXs4CVesorcPFVxVwWt+4Va1HzalK/JoFUbk8CavMkoKfFJFbc2RLHASIvWYsSK+bUN8Z4zORrAG84heSffS8nyBvAosXXJSgkKm2TCG+BDluSwLUzHfw5K5i2KXQ2hfrOWH8yDcDrNAg2SdTYtOSLCW6S4BxbJ6+Vov5dDfnfJU6z+m7P+SMNZnQN+W96m0ZPsQN32LYqEFORr2DbnhJMPhNxSd6WRRwlorZpIjkBxBtG3WRy+X82llUOt20SNbLIbVsWGA+r4LYsCqTryczbJOr1cG9920Su7kTYNhGkeGHDsmkiTL4gTHWLQCc/RnrZNImefD07bMsgPNW5fHIK/xf4Kpf7h+Plw9f6N5W6HPffTwe7/Plyfnj36/O/T/6Lf+1/ujw+HH68XA6qdP3kL3++oLzjIZSv+t1JLhnumPUi62/yJiHm+PqmqfwH",
|
|
392
392
|
"brillig_names": [
|
|
393
393
|
"set_authorized"
|
|
394
394
|
]
|
|
@@ -2022,7 +2022,7 @@
|
|
|
2022
2022
|
}
|
|
2023
2023
|
},
|
|
2024
2024
|
"bytecode": "H4sIAAAAAAAA/+2dBXQUVxuGZ3eTQHB3CS5JYDe7m91FAyEJ7u6bZAOBAEVCoZq6UncFKrTUlXqpt9TdW9pSd3f6v1+709wMk1RyJ/D+Zc55zo7tzPPdmbljd+51GX90eR7DaOv5o98FPPFfN0ixjDN/1f5Em/nq2oyrbzOuoc24xjbjWoAsy7iONvOl2IzrZDOus824Hjbjesd/1c4czor/+r2ZgUAslBHz+X1Rb0YkPxz0BoL5mWFf2BcMBwszwn5/LBwIhyL5kZA34gv4Y76iYMRf5P2ja+gpX5a3Wl1GgZOejf69Z8A6QtyagATFVdJhZ7y/p1He30vpbxSfx/xfYww3AU1BM0/5eLPzWNLAW73O11vjshp79G2b5tr2Iftt01zZNk2U/qZKfzPLtmmB4ZagFWhts23cmrdND437eht96elT8xNZboolHXQfp2315SeFdvtCW2WbS2f2u43Kj9N2GG4POoCONXCcttC4/dppPE5THD5OU5Rt017p76D0d7Rsm04Y7gy6gK4220b3/tlNYxo46dn933tmWEf81fmuk9LfTenvbtlWPTDcE/QCvePbypzmMSrvsvSkt8+89qsq3b3V63ydamj/8Fav8/VwwjPBKL+oNhxO6J6GMwmta6crCIXCgYgvRLcRHfBs49mzt5Xp6VaWmRrPkdKsd4+pNldBuq8GUzWetdMduhpMj6dDQjx+a87qxI6UpvkKxHQ0+/uYwVV1uuvzN093fTHsBT6QUQO3EGkad5q+JDlLHw0xR8MZQX9GOFaVZ3XT06/vtqbISc/Av/f0W0fYHUf+Sh6TqJeQActxFMRwJgiBsHLZ6DFqJtMJOnz20p4RpGvMCCIOnT0iNfAsoZ++gy7fSc/+GjwzfZHMzPxQgZOeA/69Z9A6wi5z6KdkAv0rySgGWDKHgRgeBAaLWw08m+mlcVkDNR6nQxzKpPbkZ9CDNKbfUIefbQ1R9uehSv9gpT/Lsm9nY3gYyAG5yokvwaiR5yUBl7Hr8aRrHdb8iuHxgG7HXgSOvQ1n8hXdntlsF2kRjZlXnkMXaXnKLX6iYZ8Z6N6QLuO/vcPp9oyQeHqMGj6Aq3vQ6Qw+1aHgdces8eD0pZHE7NYYczpJzBoPRl+fGorZW73O11dj+rUgyXS9Boenj8Qzg8TTT+IZIPEMknhmkniGSDzDJJ4REs9+JJ79STwHkHgOJPEcROI5mMQzi8RzCInnUBLPbBLPYSSeOSSeuSSeeSSew0k8R5B4jiTxHEXiOZrEcwyJ51gSz3EknuNJPCeQeE4k8ZxE4jmZxHMKiedUEs9pJJ7TSTxnkHjOJPGcReI5m8RzDonnXBLPeSSe80k8oySe+SSeBSSehSSeMRLPIhLPBSSeC0k8i0k8F5F4LibxLCHxXELiuZTEcxmJ5z4knstJPFeQeK4k8VxF4llK4rmaxHNfEs81JJ5rSTz3I/Hcn8TzABLPA0k8DyLxPJjEs4zE8xASz0NJPA8j8TycxPMIEs8jSTyPIvE8msTzGBLPY0k8jyPxPJ7Ecx2J5wkknieSeJ5E4nkyiecpJJ6nknieRuJ5OonnGSSeZ5J4nkXieTaJ5zkknueSeJ5H4nk+iecFJJ4XkniuJ/HcQOK5kcTzIhLPi0k8LyHxvJTEcxOJ52UknpeTeG4m8byCxPNKEs+rSDyvJvG8hsTzWhLP60g8ryfxvIHE80YSz5tIPG8m8dxC4nkLieetJJ63kXjeTuJ5B4nnnSSed5F43k3iuZXE8x4Sz3tJPO8j8byfxPMBEs8HSTwfIvF8mMTzERLPbSSej5J4Pkbi+TiJ5xMknk+SeD5F4vk0ieczJJ7Pkng+R+L5PInnCySeL5J4vkTi+TKJ5ysknq+SeL5G4vk6iecbJJ5vknhuJ/F8i8TzbRLPd0g8dzjk6dbs+a6yrOq23Rv0cMT8nsaY00naK37f4PD8gMTzQxLPj0g8Pybx/ITE81MSz89IPD8n8fyCxPNLEs+vSDy/JvH8hsTzWxLP70g8vyfx/IHE80cSz59IPH8m8fyFxPNXEs+dJJ6/kXjKAhk8XSSebhJPD4lnAolnIolnEolnLRLP2iSeySSedUg865J41iPxrE/i2YDEsyGJZyMSz8Yknk1IPJuSeDZzyNP6jry677VdGmNuThJzT40xtyDZH1u6qp9+GeFwKD8zFnXSs5VL33auah/yVq/ztdbo2YOkPE0bjTGnkcTcVmPMbUhibqcx5lSSclPtSfLxDiSeHUk8U0g8O5F4dibx7ELi2ZXEsxuJZ3cSzx4knj1JPHuRePYm8Uwl8Uwj8Uwn8exD4tmXxNNL4ukj8cwg8fSTeAZIPIMknpkkniESzzCJZ4TEsx+JZ38SzwH/wfeAA/+DMQ8iidmjMebBNRSzt3qdL0vj+4xsknc4QzTGHCF5hzOU5JyQTeI5jMQzh8Qzl8Qzj8RzOInnCBLPkSSeo0g8R5N4jiHxHEviOY7EczyJ5wQSz4kknpNIPCeTeE4h8ZxK4jmNxHM6iecMEs+ZJJ6zSDxnk3jOIfGcS+I5j8RzPolnlMQzn8SzgMSzkMQzRuJZROK5gMRzIYlnMYnnIhLPxSSeJSSeS0g8l5J4LiPx3IfEczmJ5woSz5UknqtIPEtJPFeTeO5L4rmGxHMtied+JJ77k3geQOJ5IInnQSSeB5N4lpF4HkLieSiJ52EknoeTeB5B4nkkiedRJJ5Hk3geQ+J5LInncSSex5N4riPxPIHE80QSz5NIPE8m8TyFxPNUEs/TSDxPJ/E8g8TzTBLPs0g8zybxPIfE81wSz/NIPM8n8byAxPNCEs/1JJ4bSDw3knheROJ5MYnnJSSel5J4biLxvIzE83ISz80knleQeF5J4nkViefVJJ7XkHheS+J5HYnn9SSeN5B43kjieROJ580knltIPG8h8byVxPM2Es/bSTzvIPG8k8TzLhLPu0k8t5J43kPieS+J530knveTeD5A4vkgiedDJJ4Pk3g+QuK5jcTzURLPx0g8HyfxfILE80kSz6dIPJ8m8XyGxPNZEs/nSDyfJ/F8gcTzRRLPl0g8XybxfIXE81USz9dIPF8n8XyDxPNNEs/tJJ5vkXi+TeL5DonnDhLPd0k83yPxfJ/E8wMSzw9JPD8i8fyYxPMTEs9PSTw/I/H8nMTzCxLPL0k8vyLx/JrE8xsSz29JPL8j8fyexPMHEs8fSTx/IvH8mcTzFxLPX0k8d5J4/kbiabg5PF0knm4STw+JZwKJZyKJZxKJZy0Sz9oknskknnVIPOuSeNYj8axP4tmAxLMhiWcjEs/GJJ5NSDybkng2I/FsTuLZgsSzJYlnKxLP1iSebUg825J4tiPxbE/i2YHEsyOJZwqJZycSz84knl1IPLuSeHYj8exO4tmDxLMniWcvEs/eJJ6pJJ5pJJ7pJJ59SDz7knh6STx9JJ4ZJJ5+Es8AiWeQxDOTxDNE4hkm8YyQePYj8exP4jmAxHMgiecgEs/BJJ5ZJJ5DSDyHknhmk3gOI/HMIfHMJfHMI/EcTuI5gsRzJInnKBLP0SSeY0g8x5J4jiPxHE/iOYHEcyKJ5yQSz8kknlNIPKeSeE4j8ZxO4jmDxHMmiecsEs/ZJJ5zSDznknjOI/GcT+IZJfHMJ/EsIPEsJPGMkXgWkXguIPFcSOJZTOK5iMRzMYlnCYnnEhLPpSSey0g89yHxXE7iuYLEcyWJ5yoSz1ISz9UknvuSeK4h8VxL4rkfief+JJ4HkHgeSOJ5EInnwSSeZSSeh5B4HkrieRiJ5+EknkeQeB5J4nkUiefRJJ7HkHgeS+J5HInn8SSe60g8TyDxPJHE8yQSz5NJPE8h8TyVxPM0Es/TSTzPIPE8k8TzLBLPs0k8zyHxPJfE8zwSz/NJPC8g8byQxHM9iecGEs+NJJ4XkXheTOJ5CYnnpSSem0g8LyPxvJzEczOJ5xUknleSeF5F4nk1iec1JJ7XknheR+J5PYnnDSSeN5J43kTieTOJ5xYSz1tIPG8l8byNxPN2Es87SDzvJPG8i8TzbhLPrSSe95B43kvieR+J5/0kng+QeD5I4vkQiefDJJ6PkHhuI/F8lMTzMRLPx0k8nyDxfJLE8ykSz6dJPJ8h8XyWxPM5Es/nSTxfIPF8kcTzJRLPl0k8XyHxfJXE8zUSz9dJPN8g8XyTxHM7iedbJJ5vk3i+Q+K5g8TzXRLP90g83yfx/IDE80OHPN0WT783MxCIhTJiPr8v6s2I5IeD3kAwPzPsC/uC4WBhRtjvj4UD4VAkPxLyRnwBf8xXFIz4i+LL7qEx5o9qKGZv9Trfx2596Zfn4djOCRrT7xOSfTtRY8yfksScpDHmz0hirqUx5s9JYq6tMeYvSGJO1hjzlyQx19EY81ckMdfVGPPXJDHX0xjzNyQx19cY87ckMTcw9MX8HUnMDTXG/D1JzI00xvwDScyNNcb8I0nMTTTG/BNJzE01xvwzSczNNMb8C0nMzTXG/CtJzC00xryTJOaWGmP+jSTmVhpjNkieAbbWGLOLJOY2GmN2k8TcVmPMHpKY22mMOYEk5vYaY04kibmDxpiTSGLuqDHmWiQxp2iMuTZJzJ00xpxMEnNnjTHXIYm5i8aY65LE3FVjzPVIYu6mMeb6JDF31xhzA40xY1G/l/HZEQ84FaSBdNAH9JV1AB/IkHQAARAEmSAEwiAC+oH+YAAYCAaBwfG4h4ChIBsMAzkgF+SB4WAEGAlGgdFgDBgLxoHxYAKYCCaByWAKmAqmgelgBpgJZoHZYA6YC+aB+SAK8kEBKAQxUAQWgIWgGCwCi0EJWAKWgmVgH7AcrAArwSpQClaDfcEasBbsB/YHB4ADwUHgYFAGDgGHgsPA4eAIcCQ4ChwNjgHHguPA8WAdOAGcCE4CJ4NTwKngNHA6OAOcCc4CZ4NzwLngPHA+uABcCNaDDWAjuAhcDC4Bl4JN4DJwOdgMrgBXgqvA1eAacC24DlwPbgA3gpvAzWALuAXcCm4Dt4M7wJ3gLnA32AruAfeC+8D94AHwIHgIPAweAdvAo+Ax8Dh4AjwJngJPg2fAs+A58Dx4AbwIXgIvg1fAq+A18Dp4A7wJtoO3wNvgHbADvAveA++DD8CH4CPwMfgEfAo+A5+DL8CX4CvwNfgGfAu+A9+DH8CP4CfwM/gF/Ap2gt+AHGAu4AYekAASQRKoBWqDZFAH1AX1QH3QADQEjUBj0AQ0Bc1Ac9ACtAStQGvQBrQF7UB70AF0BCmgE+gMuoCuoBvoDnqAnqAX6A1SQRpIB31AX+AFPpAB/CAAgiAThEAYREA/0B8MAAPBIDAYZIEhYCjIBsNADsgFeWA4GAFGglFgNBgDxoJxYDyYACaCSWAymAKmgmlgOpgBZoJZYDaYA+aCeWA+iIJ8UAAKQQwUgQVgISgGi8BiUAKWgKVgGdgHLAcrwEqwCpSC1WBfsAasBfuB/cEB4EBwEDgYlIFDwKHgMHA4OAIcCY4CR4NjwLHgOHA8WAdOACeCk8DJ4BRwKjgNnA7OAGeCs8DZ4BxwLjgPnA8uABeC9WAD2AguAheDS8ClYBO4DFwONoMrwJXgKnA1uAZcC64D14MbwI3gJnAz2AJuAbeC28Dt4A5wJ7gL3A22gnvAveA+cD94ADwIHgIPg0fANvAoeAw8Dp4AT4KnwNPgGfAseA48D14AL4KXwMvgFfAqeA28Dt4Ab4Lt4C3wNngH7ADvgvfA++AD8CH4CHwMPgGfgs/A5+AL8CX4CnwNvgHfgu/A9+AH8CP4CfwMfgG/gp3gNyAXEy7gBh6QABJBEqgFaoNkUAfUBfVAfdAANASNQGPQBDQFzUBz0AK0BK1Aa9AGtAXtQHvQAXQEKaAT6Ay6gK6gG+gOeoCeoBfoDVJBGkgHfUBf4AU+kAH8IACCIBOEQBhEQD/QHwwAA8EgMBhkgSFgKMgGw0AOyAV5YDgYAUaCUWA0GAPGgnFgPJgAJoJJYDKYAqaCaWA6mAFmgllgNpgD5oJ5YD6IgnxQAApBDBSBBWAhKAaLwGIgbdVLO/DSxrq0Xy5tg0u729KmtbQXLW0xSzvH0oawtM8rbd9Ku7LSZqu0hyptjUo7ntJGprQ/WQak3URpk1Da+5O29KSdOmkDTtpXk7bLpF0waXNL2rOStqKkHSZp40jaD5K2eaTdG2lTRtprkbZQpJ0RacND2seQtiekXQdpM0HaI5C6/qUefamjXup/Xw+k3nKpE1zq25a6rKWeaKmDWeo3lrqDpV5eqfNW6pOVulqlHlSpY1Tq75S6MaXeSanTUepLlLoIpZ4/qUNP6qeTut+kXjWps0zqA5O6tqQeK6kjSupf2gqk3iCpk0fqu5G6ZKSeFqkDReoXkbo7pF4MqXNC6nOQuhKkHgL5xl++n5dv0+W7b/mmWr5Xlm+B5Ttb+YZVvg+Vby/lu0b5ZlC+x5Nv3eQ7MvlGS75/2g7kux35Jka+N5FrXflOQr5BkPL9UnZeyqVLOW0pAy3leKVcq5TzlHKPUg5QysVJOTEpNyXliKRcjZQzkXIXUg5B3svLe2p5byvvMeW9nrznkvc+8h5E3gvIc3J5bizPUeW5ojxnk+dO8hxGnkvIfbrct8p9nNzXyHW++4/LB0PKKUuXapR38axFFv/7dCnXK+VcpdynlIOUcoFSTk7KjUk5KilXJOVspNyJlMOQcgnynl7eW8t7XHmvKe/55L2XvAeS9yLynkCem8tzZHmuKs8Z5blbCugEOgO5b5f7WLmvk/scKTvfE/QCvY1du0Slv1n8t/mOIa2Xb9uUo86XUsW0rvHfLVkbNvbavG6YOq13Ff8LVDItKf4bif8mx3/d8V9Ja0nnrPiwt3qdL1lZru7lh72BULJRsdPs7082Ku6XTi0/0Znl/142WrphZeXLV2Mx1+uxzGf9j0yvH+93GbvOY8bhxH6E7Rx0OJ185vJrObSdzXRLUtLOYxOTuf76lm1lTrf7NZdlnWauq47h6D7sqyo21d/cNxpZ5remQWXLSvqHy9qd21RNa3Wb/j5PWfk0t2VagjItyTItsWzXGOX8l6LMZz0GEyzTzP1Eutyy8mWkKstLi/eb6edk3u1UniFdUxt/dV3S1SorTw8zbTzKODPNzW1QW53fMi1ZmZZQVnE9deLDCcp61GWZHomW+c1zfMP4b5LyH/P/jWzWn2RZfwVvm3HWdEm2mT/ZZn7ZR7vE++vGkX3IryyvsmPEbey6vIbGrvmB+V+Hj+cM0zXBxlXNX8z1y7Vm83j/ylXLVsRGLM1ZEysoXVW8bGl2tGBhzLB06sGn7pjWi181AdRA7ZbhUf5v18kGMS+SEsoq/i8rPt5bjS4U9nrNdZsHRKLF07CsP9Eyfzg+XEeJy/ytzoeLRaGor8gfLYoGo4WFgYJoE8vyDaN8x5N0mhnvJ78ozq+pi+IkZ5YfdPhAt70otjvAzX04p6w8LXPKKjqZ8+Qp8+RVMs9wZZ7hyjzSVXVxbT2xqx5VndjtLiLzLNPUfMZ0kgzczNikv4XiKN2IsnJ3l2XaSGWa6ZtscdS8v0ccvknLaGrjb67LPOH1Myqmq3rC+/Okajh/QaquzzDsbwzM9dcxHD2O/7wxqGXxqexiXk6oTeP9BdGSkvErildHV8VyS5cWyDlVDUFdrNsmROvp0JzHelp1WYbdlmHr6dZ6P5Zos9zK/m8dV9Wh76rk17D5v2Hsej+k/i/Jsh63hvU4eUhL18iwvzdQ1+3Q4R60yxoNSxqqh4x1O6qHt3XfNGzS11DmMWNSv++ubzOf1UfdDknK8tU47LaX3f1qosWxsqzPHO/ws5lMuyzVGr+a5tbtUVuZ9k+3h3qfnaUs1zqf1aey+3/rsemxTLO7d2e4hB8cH97dl/Dqqbihseu+67JMU7eTNW9zaH/+8z7T3J/NtK7sOLTzMfT5+BItPsPjv5KWky1pZ3cfr+4nbsv8VZ361Xjt7vtrWeLfHZcp6vaw5vlmvpJkVP3cL9Ey//j4rwxPi/fbnbc9lmlum2Xb5SlmGsrxoPt4LAhm5hcEglFvzCeDGX91POpeP1YdKoiGfL5IwBcL+IJ/tf4+8X7yW/rMmrqldzJ97K4/NC3f9pbe7tqxqttsOR7N2w/pb6b8X12eYZQf7zV9bay+C3Pqfc4/fU/hsUxLVKap17PtLenj9LtCh/Y1X1Oj8v3LvAbpqaSJdd9xWdLBIc8Ml2V9hmH/OMAcV8fB7eJVzrMei481fdTHAeajp5Jl0cLcFcuWVHzArkbhqiQ6dbra2aWOq5Lx0tmdadUzjTl+T3+j1CM+vCe/UUqJ9zPc+aTHh3f3nY95pJBf6QT3XulU3em60qlnlPf/md8Y9nchWRq3rYNpX+Ubf/PMbOZt6tll6bJVxUVrs1fE8LS5cGxpSUlxUXFshWHp/u6ZgiHXMl/v7O5c6/+kHGKUvBxi5t5yiH/d1UA5xMDecoj/uttbDrGKuK3b9Pd5ysqnVXV/73Q5RLM4wW4qhxjdWw6xfP7K7hr3lkPcWw6xwoHrsRnvNiqeDNRubznEv39R3DbeT35RHK6pi2KnL8YcevFoe1Fsl+GY+3BuWXla5pZVdDLnyVPmyVPmka6myxhKBtzYKO8393uHT+jhPeExg5khS+acEu//4zFDztLlpbHSWOH40vyS4gKzcFt2tKTEsHTWi26XZdj6UsGaJyfYLMfaqf9zKTHs6Xl1m/jw7s6r/wc9U8SNc14CAA==",
|
|
2025
|
-
"debug_symbols": "
|
|
2025
|
+
"debug_symbols": "rVrRbhwrDP2Xfd4HbDC28yvRVbVNt1WkVRJtk0pXVf/9wjAwk9XFmQ55yWFmwlljbGPAvw/fzl/ffnx5fPr+/PNwd//78PX6eLk8/vhyeX44vT4+P6W3vw8u/wl0uMPjIcQCXEAKaII/xwPkf0R/uAvHA4YCVCAW4AJSIHWj48G7AlAAC/gCoQAVSCycgAtIAZ0guAJQAAv4AolFjtMQpAxByhC0DEHLEBKQKwAFsIAvECaIVCAWKCyxsMTCwoWFCwsnFnAJ/YxhxkQEkDDOyDPKjFpQ3IyQMakZJzXnp6R7xBn9jGFGmjGz58nxuRekrz49hK1TSlOvLMmf9FTN4svr9XzOX1Z2kqzn5XQ9P70e7p7eLpfj4dfp8jb908+X09OEr6dr+pqGfn76ljARfn+8nHPrz3Hp7fpdA+PcOWJo3SHQVgLyMBMQxxUBbyVAcVUElLCSgWQrRfQ6M4ijlQx+K4FgIwiyi0BCJVDtEsQ+gY80E3hedOAj7yAQ3yUwhqAYZwL1vEcHGKoEGHmPBMhcCXTXECI1Y1a3xxYhiJ8ZIOhKCy5sHgSFNoo4hYn/p4BgcGCoLo0YFw5+75VAhjk4bfYAUboUhkUBKVUxUjsuU4Ki71nYYIkklSTyyi5cfM8hBgdKtU3AlX/9FYePy9SC63PYGhFug3EOuhpBMGYXmqdhDrQ9SRDHNbKVI9nIPo6NWjX1kUy8WTv39WGGHoHF6XzX6dAw1ABQF4EAtIgRNy9DnqO2GIyLQun9apzXmr4+FbFNioZlZgnfkXhDDtY6J7IKQIjyF2KklXgRQ2JXDMs2NEKNQakt2CXx1soc2tKMKzluHc4HSx/iWn6A3Oew4mlbWsLKVdDdMETLzKWOBL3DPocVTKG5CoDQPo60NLSpRelzGPahbalX2scAbrFzF2mfRmObV4yrjOGWI+C4NoIf1cZGBt6pC4a2qLB3fSms5Y25BXPWvoUGHtYFj1uGORJdZjUF1C7HB6FYmyDBrUZzE74IzIRykSQIhS6JZaOBeCFJeUdvbSJvbbNaMocK3EsIKYzHYqLxWExxNBYTj8dikvFYbMqx0WujG/faCKNeazFs9VpzJBu91vaV6JeMNK52sre+YpOAW0hWWdgNSbSslOu+J3jobkY/EIMWv+e+30fLTKOPLc1PezHcRcJM0IyMWbpa3RoLya2UchML2SBhqoNhWe1q3WYCQWhHPbFLMB5I2QqkoEsgDf19NRuBlMjXDJ0orI9LwnY5NgZ05vGAzjIa0FnHA7q48YBuyrExoAuOB3QZTkkthq0B3RzJxoBu+muLxIa/mmGHXIhL2GG/K48jry0AUgjdvaxYxuEA29mgw34yqG7cZxXGfVZx1GfVj/ushvHtmxqRVF2dFMWdI9no9crjXq8y6vUWw1avN0eyNY0z/S0EWfyNXc9VwBk2mg6wKwnp6oDgJmkBZ8VBCc3xRaF7PWUKEp1Wh0uZJfcFIevYmJrnp3Y/B7NOKMVXQ/XpdK53QgnOPIPi5ZIExK3UCn/DIktuC7JOS29Z1Lr08tiuzQC6txzgPuWaA+AT7jngE471bZKtNx3wCZcDtk54WXk5WDpxn3HpAtY91NZbF/iUi6itJLZqP+M6y9TJxpuXjzx5OScD9dr1ZPSju+UPBNGwhBTV2BeEzFuLJdNTdt0wO9nTcLD+QBaBNstpQLHPYmUF1G5hAGVXjUf67bp8uZWxTddr/6TH08Pj9X2FUy6LwUQJNGOcMdfEJHlAZsxVMUl4dDNCTihLEc6EufZJ5+InLUU42fJzEc6EPGPii1wqoPItXC6BmjBXL7lSBDVhrl/CUgYlcx1UDi+5EEqkVEKBc6UWqjR0buR6qDTiUhGVsqNSE1UauVQo3+jnuqjSoNqItZGZ8+FDrgcqDZ0buUYKMJQqqWmPQFgbUxFS9qlfp+vj6evlnNWbZ+Dt6aFqOz2+/vtSv9SKs5fr88P529v1nGdmKTtLhPdp1Qz4T9J+enOf8jCKeRanYrPySo7R5+/p1X1Sj2j+jrV7Ojb3WrsHdwyUP/vWPWXDCPlVsH+QWo+kBUyvsjX9Bw==",
|
|
2026
2026
|
"brillig_names": [
|
|
2027
2027
|
"store_in_execution_cache_oracle_wrapper",
|
|
2028
2028
|
"call_private_function_internal",
|
|
@@ -2069,14 +2069,14 @@
|
|
|
2069
2069
|
}
|
|
2070
2070
|
}
|
|
2071
2071
|
},
|
|
2072
|
-
"bytecode": "
|
|
2073
|
-
"debug_symbols": "
|
|
2072
|
+
"bytecode": "JwACBAEoAAABBIBIJwAABAMnAgIEAScCAwQAHwoAAgADgEcdAIBHgEcBLgiARwABJQAAAEwlAAAAaSgCAAEEgEgnAgIEADsOAAIAASgAgEMEAAMoAIBEAQAAKACARQQAACgAgEYEAAEmJQAAAgceAgACAScCAwAALQgBBCcCBQQEAAgBBQEnAwQEAQAiBAIFLQoFBi0OAwYAIgYCBi0OAwYAIgYCBi0OAwYrAgAFAAAAAAAAAAACAAAAAAAAAAAtCAEGJwIHBAUACAEHAScDBgQBACIGAgctCgcILQ4DCAAiCAIILQ4DCAAiCAIILQ4DCAAiCAIILQ4FCC0IAQUAAAECAS0OBAUtCAEEAAABAgEtDgYELQgBBgAAAQIBLgyARQAGLQgBBwAAAQIBLgyARAAHJwIIAAEnAgkECi0IAAotCgULLQoEDC0KBg0tCgcOLQoIDwAIAAkAJQAAAjAtAgAAJwIIBAktCAAJLQoFCi0KBAstCgYMLQoHDS0KAg4ACAAIACUAAAIwLQIAAC0LBwILIgACgEQACCQCAAgAAAGqJwIJBAA8BgkBJwICBAgtCAAILQoFCS0KBAotCgYLLQoHDAAIAAIAJQAAA1ktAgAALQsEAgEiAAKARgAFLQsFBAoqBAMCCyIAAoBEAAMkAgADAAAB+yUAAARsHAoBAgAwCgACAAQmKACABAR4AA0AAACABIADJACAAwAAAi8qAQABBfeh86+lrdTKPAQCASYlAAACBy0LBAYLIgAGgEQAByQCAAcAAAJSJwIIBAA8BggBLQsDBgsiAAaAQwAHJAIABwAAAuojAAACay0LAwYtCwEHLQsCCC0LBAkNIgAGgEMACicCCwEBJAIACgAAApUlAAAEfi4CAAeAAygAgAQEAAQlAAAEkC4IgAUACgAiCgILACoLBgwtDgUMASIABoBGAAUOKgYFByQCAAcAAALVJQAABR4tDgoBLQ4IAi0OBQMtDgkEIwAAA1gnAgYEBy0IAActCgEILQoCCS0KAwotCgQLAAgABgAlAAADWS0CAAAtCwEGLQsCBy0LBAguAgAGgAMoAIAEBAAEJQAABJAuCIAFAAkBIgAJgEYACi0OBQotDgkBLQ4HAi4MgEYAAy0OCAQjAAADWCYlAAACBy4IgEUABSMAAANpDSIABYBDAAYkAgAGAAAD2SMAAAN+LQsCBS0LBQYAIgYCBi0OBgUnAgYEBC0IAQcnAggEBQAIAQgBJwMHBAEAIgUCCCcCCQQEACIHAgo/DwAIAAotCwEFLQsDBi0LBAgtDgUBLQ4HAi0OBgMtDggEJi0LAwYMKgUGByQCAAcAAAPvIwAABFstCwIGACIGAggAKggFCS0LCQctCwEIACIIAgoAKgoFCy0LCwkAKgcJCi0LAwctCwQJLgIABoADKACABAQABSUAAASQLgiABQALACILAgwAKgwFDS0OCg0tDggBLQ4LAi0OBwMtDgkEIwAABFsBIgAFgEYABi0KBgUjAAADaSoBAAEFAtxuJ4B2Ep08BAIBJioBAAEFxWvEWg4QAAI8BAIBJi4BgAOABgsAgAYAAoAHJACABwAABKsjAAAEti4AgAOABSMAAAUdLgAAAYAFAQAAAYAEAAEBAIADgASACS4AgAOACi4AgAWACwsAgAqACYAMJACADAAABQkuAYAKgAguBIAIgAsBAIAKAAKACgEAgAsAAoALIwAABNgoAYAFBAABAwCABgACgAYjAAAFHSYqAQABBUWnynEZQeQVPAQCASY=",
|
|
2073
|
+
"debug_symbols": "tZjfbiI7DMbfhWsu4vxz0ldZVRVt6QoJ0YotRzqqePdjJ/7CUGlGZ2e1N+Q3Jv7GSRwn8LV53T9ffj4dTm/vvzYPP742z+fD8Xj4+XR8f9l9Ht5PYv3aOP0gkiZspU2bB3IC3gEioBoEWAIsEZZYDJIHsEEmQDZgfQUJVAKkDt45ACwECw1LNfABUAyCB7BBJEA2SCJYtY3W1t7mYC33lr21ubfF/ErqrQbf2v4cnLNWX+QFiACwtLltEAHFoEXeAJ0jOsdkkGBJcNfYG2jwHdiA8XaGO6NzQeeCt1dYqrrH7SY6dU8K1YDYwHuAhpoFAgESoBrEAGCDhM4J7hmWDPes7izAbFCkj3cK2aDGDsl5gHT2EnwitYhXUkFfFETQy+okFWygy9igOkAEyLQEEcyaaUFyJmumdWADHXKHZBDRR/dCAx1gAx1g8ApswBFQDTSeBhpPh2HRPrJJWQfYQAfYQDOqQwKgcwgAeOkWCDI/rEvQIQGqgSZSBzZgdGa4F1gK3AvcK9w1kYIkSXHBoFWaBsnAE6AaBJvDEmyeSyQALKx9JEmKrldghdKhaiZ0YAPdg5oAVfdgA52xDpYbNcASYImwRFgSLAk6GZYcAcVAK0cHdC7o3GYsK+iQxUKuxdpIg9WohTLID1tb4U7qW5W0IhsNm+ZhdI0KSKuy0VDOflAFcQRpxEbjvXXY6uiHuZeDxA/CO9qpEvh63W5w9Dx9nvd7PXkmZ5GcUB+78/70uXk4XY7H7eaf3fHSOv362J1a+7k7y7cygv3pVVoRfDsc90rX7c3bzbtSddm8qfo4BNK9As0rSHnB+wXLUMj1TsHPK5TkyBRKojynsDSKUuIYhUtzo4gLCiEPhUi3eaAc7yTSgkTCTHrnh0DwfCeQ5wVY9gPmwYkbJHy5nwielwjJm0KcTKR39wJlXkBuEVgLr25zEnUhIfSw6PkQ3CqByiaQKa0ahMwYBhEma/E7EkxjNXlhGBT+robcDpETlCe767c0mAM0uPp1GtXVW52Y11jaYnGsCqWYZ7cYLSxLZodtyj5PNNz9LqOF9OKMDOfJhBKHVdUmhLlq42lpLkbJozjZ6t+j8EtlM7iEchEmG+V74V1Y1TgGEustCLlZ//8gfC4Iwlc3G8RC3SyOR/mnSWp9l1ionHKg8jjG5JcVrzlDnEftlJN6vu4sSVAYm1WyfZ1EHlFQWRdFGPVTcF0UybvbVuV1Evm220tdN5BbzZFfhOsk4tiqIa0aCEcsCMe8RkBuyyZQ06pByLUdAn5dBCOnKqc/HMJ3gUd53L0cznd/olxV6nzYPR/39vh2Ob1Mvv389wPf4E+Yj/P7y/71ct6r0u2fGPn4IYf41id61Iu1PMqtfiv3b30k/VbuPPKvxeNVg/kP",
|
|
2074
2074
|
"brillig_names": [
|
|
2075
2075
|
"set_reject_all"
|
|
2076
2076
|
]
|
|
2077
2077
|
},
|
|
2078
2078
|
{
|
|
2079
|
-
"name": "
|
|
2079
|
+
"name": "sync_private_state",
|
|
2080
2080
|
"is_unconstrained": true,
|
|
2081
2081
|
"custom_attributes": [
|
|
2082
2082
|
"utility"
|
|
@@ -2094,7 +2094,7 @@
|
|
|
2094
2094
|
"bytecode": "H4sIAAAAAAAA/7WTPQ+CMBCGi2KUjzjgoD+jBAyM+LG4OLpXCkpUSAB3frqQXENtwKjAJU17FJ5736OVUB0SzDLqEAyyglmBecTtj8vhQY67hakIdfvku9i2lQZ/Peq3FGBKw/Ax4w/UfzwFzr6o+bwXVndWDo1b66g+H0P5Z/9vSP+LD5418GpAXnmew/oS5Nt74t+Oz8c5SNnXTR1EgnIxdK5CSd0lcZ4SP99QmgZZJhJGDWTUQlU56pVE8YG26fmRdgrSLEpikSZ/Sav6yu6lXLyr8eA57hCOizHTMAb+BDV3X+b2+feXkKuCJ+bT+1Nn6BAztEhI1oRS2yeGwK+CP38vlizs4eEFAAA=",
|
|
2095
2095
|
"debug_symbols": "nZPRioQgFIbf5Vx3oaWmvsowDFY2CGLh1MISvfvqoDu14DLMjSfzfF9/pRsMulvvN+PG6QHyskHnjbXmfrNTrxYzuXB3AxQH3IBsKsAEJA2FgmxDYSDFvleQ+2+L1zq2HwRBOyuv3QLSrdZW8KXs+mx6zMo966J8WEUVaDeEGoSjsTpe7dWLRmUUI0pYwjFiiP4qMCInCS5LWp4VPEBZ0OITX5d5WtPEU/p6B0zYuwF40+YAVJQCkDJPGpF4wvhHATjJAQQvBWBlPnz4xLOafRJA1HUSiIaWAvB/AvC8iVr05xdcw1T1xp/29h5V3qjO6jQdV9cfVpfvOa/kszH7qdfD6nU0HQ5IGC+YV3Vz3ePTfgA=",
|
|
2096
2096
|
"brillig_names": [
|
|
2097
|
-
"
|
|
2097
|
+
"sync_private_state"
|
|
2098
2098
|
]
|
|
2099
2099
|
},
|
|
2100
2100
|
{
|
|
@@ -2154,8 +2154,8 @@
|
|
|
2154
2154
|
}
|
|
2155
2155
|
}
|
|
2156
2156
|
},
|
|
2157
|
-
"bytecode": "H4sIAAAAAAAA/+
|
|
2158
|
-
"debug_symbols": "
|
|
2157
|
+
"bytecode": "H4sIAAAAAAAA/+VazW7rVBA+buw4TvoTLgs2LHiEJE2aFgmpl6aXll/pInUDmzRJL1dAK7Vl7y0SYs+Gd0DiCZCQWLFgx54Nb0FO42k+fx67bupzeyVGiux45nwzczwzZ85JPLOgtfnHS+59eMYkMvvJtfMw6laI1XFpp1ehnR7YuZa5AePxXuOfJDcRydjHtQqdj0hvlfi7nf4sMmmq2P7tCDAd4PcE33eD3wkTnI/iNL4hvRvJd4wfGSM8jKOPE15j/tk0y/u3AM/SJ6BXsCPCqzgmpo7fWffNHPvFN0sHsRPd24I/AnxTHX5H8A/d2H+L/yzBd2H7B27m5raWHbmZm1v84+rn5hb7Qze291pmkf8nCd66WdaFF7Pr97+5mHz96Xffns4ueYXCLNWeI1nUJ0vUg4vz68vx5PrpdHo5u7piBF9BNjmoTUD9avzy/HjKaMFqaCezy6uXF+eMVi+JJrUshGf7ybXzMOpJXW+QbagX1+8q65hH+ozJRgLqb5KtVeeeR/rEHp4fqfkyd03F1rbCC+EeeainqejRsPgdhW7mZG/DZOfEFPjfIF4L5KXuCG8deKN4icHEVQD9tfq+BJ0sx7ZiXDVzMAOT7YOegX3op6+MtzSK01givw12/062hWSPpcg4jfnSOSj6m8ZpvHV5fsUenh/OwUixta3wPLrXcj1S9GhYwnPZy85pV6vRpsD/kHgY55yDmJ+jeInBpOWg+PuQHIxyMMvkoPjpK+MtjeI0lsgfg92SgzWjv0O2vUb2GuO8BvfK5qjob5KtrnI0JHt4fmQubZ2XOLu6vrgcv5g9n42nnIqh4hLykeS7T8/4u0ff+UxK2mzflCNPwdFcl+3BlsmG/FrOOJZDmbywrBXgyzM79ZJmfpzG2U+edx5Aw93lmVQtwQ+M3rz7wEf5L5Lv2ErI1X+AnWfDcfdse3w2Hoyn0/5k/ITwDcwXb19kbrHpx/cuaV+HZ/ur2dnlB6IvBBvZFtG7QTzhazZWXAr6ZUuT6G8qfrgoTXWyh+eH24eGYmvbZJfdvDYQ9WhbhVeFtWGy/r+iVnKwaivpKDYLW8m6Mq/3aSUt8ftbtZV8XbG0VlLbopR575oeXO8D0hNUqKeoZtYr1INYh3FaT6NCPYg1ihdX6TOq3OrgeJETf7BfEl+t/9/n6AxAJ46V7UhA8r+YJeYPJi0jc/QjyPyU3Ecma/tjHodw/rSAxzG/DjyO0w3g8RHLJtgg/SzGj5C2hRM5i/kH4LKcEM611ts2CFtiyqfnQqN4cQ1I/ufk6vhnnA73g6jr/xRLq8SL5y1xWU5Ii5GQeGuKH8KrKX5o64dHPK1n5zqN+FptxZ+QUNaY7L7MUtGeT8a2TLnaiNhcG39NrtaP30zaRu1IWVtL5HlLkceYE3u09UXGRsq4CvPkVDuqEtLinfME453zZBN4nCdbwOOa2wYe/70BScshmaf71Fx+z9pajuuqxCKv1zgW1+uq992d3nSyM+vNjwaGO93e3vQ++26JtTrZgv5rR3/Yf43ixZWP/v5Mro73Quq60ijwr1bgn7ZnOcjx79/kamX/KqFvy+TX0i1ljtaIh7HP70hiKijpg8j/nVyt3ndpjZHzIrTZ5dnWnPrWjvfADq6zQZz2u6imWuIavK7I49rO6x7WuoCwAgUL5/yIbJU5rCvyiMdx9k9ytXPzuZe2D2O+Sbaj77y3ril6hZdXv0SZ43Ouobb/FdLOkDziaT8baT1ejXgYB0V/ZdDWGZmL+/ZqdcUPrU5wLWgotmp5K/iPkbe4bnLear0TykvuaD/Hc7xiDvBfAjAHQuLVCvTh+5e5xhzgdVQ7SzmMl+N8b4mH7wXrNY7lei3yb3tLzDC53zLZ+sTxotUZtsWY4jO7ojMe12ffj/iz/cpnrY/xs7127u74r0X9opzW/kbwhlnsBfidoX2CpfWcWrxz7Szqv7TaqdUSrjNlaonWQ2i1pGXu15tqdYLrCMq/A3Vi6OXPDfdHZc/vRb7o71toq7amRcTT1vSi2GoU2HXXXpvt0vbaRtF9lw+c83k6XoM1e6Ct2eg7r9lFvbMlfgcbirzWT7dJHudcy0vuZVFvi3iYT5yzeX3uMGetRj+wzvL+X8tP7AGq3v9PBjunk/5g3Jnd/LTdu2v/L2ct9Rj8itNjwuS77IlZHs/LUP4p1J0DiK0bWUWflXteIOflXG8wlGd+nH4WxVn5WpyVF93NOGuj8FrAw9ywtJ58x/lCLLEjIPnPoDZbasAYGd9W9DdIf8pu5VnmfyqKfEuRt+/niOIWfa+6r7nRSfj4jG2T2GmZ6vNqnlLDyXjY7e71u7N+d3BXXv0H5pXP7KA3AAA=",
|
|
2158
|
+
"debug_symbols": "tZnhTuM6EIXfJb/5YXs8HruvslqtCpRVpaqgLlzpCvHudyaZk7RIsbhB+4fzheKDPT6xnfR9eDzcv/3+dTw/Pf8Zdj/eh/vL8XQ6/v51en7Yvx6fz/rb9yHYj5SHHd0NiYcdq5RhJyoy7JpKHXYxqbZJKbhG1+RKrtmVXYuruJqf/hdqk+bgGl2TK7lmV3YtruZXVatrm5SDq/qlqJpcyTW7smtxFdfq2iYt6peyanRNruSaXdm1uIprdTU/LasE1+iaXNWPdBLE5kL/Xti1uIprdW2TVvUjnacaXdUva78rueZJm11r/Ztd6/9p7Kr+WevZxLW6tkljCIAISAACZAADCsB8i0EFNIcYABGQAATIAAYUAJwjnCOckzlngwhIAAJkAAMKQAAV0BwIzgRnuwGyGBAgA8TBQp2rAQEygAEFIIAKaA4W7gkiQA05GKghRwMGFIAA1JCTQXOwdE8QAQlAgAxgQAEIAM4FzgJngbPAWeBsWWcyYIAZWlUt1mz5sVxPkADW3GbZoj0BAwpAABXQHFoAREACuGGyqLOtgRZ1rgYEyAAGFID9U1syLdglGERAAhAgAxhQAOpTokEFNAcL9gQRkAAEMGdbsS3YExSAACqgOViwJ4gAM7RtwfI8AQMKQAAV0BxsYZ8gAhIAzhnOdheUbFAAAqiA5mB3wQQoL6O8jPIyymsJL+OuZh/Z5FqeJ2BAAYjP+5jnEZrDmOcRkI0xzyMQIAMYUABwFjgLnCucK5wrnC3hY+ct4WX8TQU077PleYIISAAbsiXTgj0BA2zIllVb9yeoAHemEAARkAAEyAAGFIAAKgDO431RPj7uBhxGfr1eDgc7i1ydTvTM8rK/HM6vw+78djrdDf/sT2/jH/152Z9Hfd1f9FOd58P5UVUNn46ng9HH3dI6rDfVHct2jLG5blqBZwvd1G5M4rqJVFhUbQQDiTft03p7TuztmZcx6I7w1Q5UEnSA21oH8nr7bCeHsX0udVMHakYHWl3rQFlvr4X39iWVLR1oKblBI17rQO10oCJEEtanoBMkLjViEiUsNeDbKMZeFqmgijHHJUi6A996dOoQ5yjGq4mgJF93YDjo7rfuQJ3boc3FrEHbwUPXrFuPTiKJMZ85LoFIoX29mrki1Ho4KuvV7MVSQp5jUePV2vCpGtJbYUKYF5goq/34arYSr2arfT9bKXw3W12HL2Urpe9nK9G3s9W+ny1b17+SLT2BrGYrdfIpBbkQuVq3hTYlK+e1ZKXOyqkPAXOySmurvUideurZtyIYelJfW7+pF62W25ytq9vss0VvG4/YhOR6Fyzp1qGTziUWHMM2h4h4M8m6Q28UYRlFW3foJJP0TOkWRFdrBWW+9Si9VU9oXvWuZpTKbbqps3LWiGpWyusOvV19rmahsurQTybPyUzrh7vcu8cEyw1fF+JTMUOvD8Tz3XF1QPy8YvUt8mxR8jaLFpdKtFWLnHsH3fn+oLDNoeGkWyJvGkaiZRg5bbJYDov6fEibLCTOO6H0StH+roe+ypkPJ+VqC/lfHrLc6tLSNo8W5g1Vj/LbJnYeir7n2HaX6HMtLPQZdVsv5i1A3TYNRN+vpuWJdFPI9f3pPK16VtlmUeZe6Au2TRY036yK23rBKSwHLdlmUZazWm3bBrKkk9K2gVCeT0nEmwYiGRMiuWwxaBnbSONNg2gB89nSth7MmWrC3xzCZ4Oferl/OF5uvt/6MKvLcX9/Ovjl09v54erT139f8Am+H3u5PD8cHt8uB3NaviTTHz9IH/SI6k/7FkMv9XmoRbuI9pm+Q6Ecf35YV/4D",
|
|
2159
2159
|
"brillig_names": [
|
|
2160
2160
|
"utility_is_consumable"
|
|
2161
2161
|
]
|
|
@@ -2479,12 +2479,12 @@
|
|
|
2479
2479
|
"type": {
|
|
2480
2480
|
"fields": [],
|
|
2481
2481
|
"kind": "struct",
|
|
2482
|
-
"path": "AuthRegistry::
|
|
2482
|
+
"path": "AuthRegistry::sync_private_state_parameters"
|
|
2483
2483
|
}
|
|
2484
2484
|
}
|
|
2485
2485
|
],
|
|
2486
2486
|
"kind": "struct",
|
|
2487
|
-
"path": "AuthRegistry::
|
|
2487
|
+
"path": "AuthRegistry::sync_private_state_abi"
|
|
2488
2488
|
},
|
|
2489
2489
|
{
|
|
2490
2490
|
"fields": [
|
|
@@ -2538,7 +2538,7 @@
|
|
|
2538
2538
|
},
|
|
2539
2539
|
"107": {
|
|
2540
2540
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/storage.nr",
|
|
2541
|
-
"source": "use poseidon::poseidon2::Poseidon2Hasher;\nuse std::{collections::umap::UHashMap, hash::BuildHasherDefault};\n\nuse super::utils::AsStrQuote;\nuse super::utils::get_storage_size;\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.\n///\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.\n///\n/// Only a single struct in the entire contract should have this macro (or `storage_no_init`) applied to it, and the\n/// struct has to be called 'Storage'.\npub comptime fn storage(s: TypeDefinition) -> Quoted {\n let struct_name = s.name();\n if struct_name != quote { Storage } {\n panic(\n f\"The #[storage] macro can only be applied to a struct with name 'Storage', got '{struct_name}' instead.\",\n )\n }\n\n assert(\n !s.has_named_attribute(\"storage_no_init\"),\n f\"Only one of #[storage] and #[storage_no_init] can be applied to the Storage struct.\",\n );\n\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 });\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///\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.\n///\n/// Only a single struct in the entire contract can have this macro (or storage_no_init) applied to it, and the struct\n/// has to be called 'Storage'.\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 // We do need to make sure that the type is called Storage, since we'll do `Storage::init` later on.\n\n if s.name() != quote { Storage } {\n let name = s.name();\n panic(\n f\"The #[storage_no_init] macro can only be applied to a struct with name 'Storage', got '{name}' instead.\",\n )\n }\n\n assert(\n !s.has_named_attribute(\"storage\"),\n f\"Only one of #[storage] and #[storage_no_init] can be applied to the Storage struct.\",\n );\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(typ: Type, slot: Quoted) -> (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 let constructor = 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 });\n\n quote { $struct_name::new(context, $slot, | context, slot | { $value_constructor }) }\n } else {\n // We assume below that all state variables implement `fn new<Context>(context: Context, slot: Field) -> Self`.\n quote { $struct_name::new(context, $slot)}\n };\n\n (constructor, get_storage_size(typ))\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"
|
|
2541
|
+
"source": "use poseidon::poseidon2::Poseidon2Hasher;\nuse std::{collections::umap::UHashMap, hash::BuildHasherDefault};\n\nuse super::utils::AsStrQuote;\nuse super::utils::get_storage_size;\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.\n///\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.\n///\n/// Only a single struct in the entire contract should have this macro (or `storage_no_init`) applied to it, and the\n/// struct has to be called 'Storage'.\npub comptime fn storage(s: TypeDefinition) -> Quoted {\n let struct_name = s.name();\n if struct_name != quote { Storage } {\n panic(\n f\"The #[storage] macro can only be applied to a struct with name 'Storage', got '{struct_name}' instead.\",\n )\n }\n\n assert(\n !s.has_named_attribute(\"storage_no_init\"),\n f\"Only one of #[storage] and #[storage_no_init] can be applied to the Storage struct.\",\n );\n\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 });\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///\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.\n///\n/// Only a single struct in the entire contract can have this macro (or storage_no_init) applied to it, and the struct\n/// has to be called 'Storage'.\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 // We do need to make sure that the type is called Storage, since we'll do `Storage::init` later on.\n\n if s.name() != quote { Storage } {\n let name = s.name();\n panic(\n f\"The #[storage_no_init] macro can only be applied to a struct with name 'Storage', got '{name}' instead.\",\n )\n }\n\n assert(\n !s.has_named_attribute(\"storage\"),\n f\"Only one of #[storage] and #[storage_no_init] can be applied to the Storage struct.\",\n );\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(typ: Type, slot: Quoted) -> (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 let constructor = 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 });\n\n quote { $struct_name::new(context, $slot, | context, slot | { $value_constructor }) }\n } else {\n // We assume below that all state variables implement `fn new<Context>(context: Context, slot: Field) -> Self`.\n quote { $struct_name::new(context, $slot)}\n };\n\n (constructor, get_storage_size(typ))\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"
|
|
2542
2542
|
},
|
|
2543
2543
|
"143": {
|
|
2544
2544
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/call_private_function.nr",
|
|
@@ -2573,7 +2573,7 @@
|
|
|
2573
2573
|
"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"
|
|
2574
2574
|
},
|
|
2575
2575
|
"209": {
|
|
2576
|
-
"path": "/home/aztec-dev/nargo/github.com/noir-lang/poseidon/v0.1.
|
|
2576
|
+
"path": "/home/aztec-dev/nargo/github.com/noir-lang/poseidon/v0.1.1/src/poseidon2.nr",
|
|
2577
2577
|
"source": "use std::default::Default;\nuse std::hash::Hasher;\n\ncomptime global RATE: u32 = 3;\n\npub struct Poseidon2 {\n cache: [Field; 3],\n state: [Field; 4],\n cache_size: u32,\n squeeze_mode: bool, // 0 => absorb, 1 => squeeze\n}\n\nimpl Poseidon2 {\n #[no_predicates]\n pub fn hash<let N: u32>(input: [Field; N], message_size: u32) -> Field {\n Poseidon2::hash_internal(input, message_size, message_size != N)\n }\n\n pub(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::poseidon2_permutation(self.state, 4);\n }\n\n fn absorb(&mut self, input: Field) {\n assert(!self.squeeze_mode);\n if self.cache_size == RATE {\n // If we're absorbing, and the cache is full, apply the sponge permutation to compress the cache\n self.perform_duplex();\n self.cache[0] = input;\n self.cache_size = 1;\n } else {\n // If we're absorbing, and the cache is not full, add the input into the cache\n self.cache[self.cache_size] = input;\n self.cache_size += 1;\n }\n }\n\n fn squeeze(&mut self) -> Field {\n assert(!self.squeeze_mode);\n // If we're in absorb mode, apply sponge permutation to compress the cache.\n self.perform_duplex();\n self.squeeze_mode = true;\n\n // Pop one item off the top of the permutation and return it.\n self.state[0]\n }\n\n fn hash_internal<let N: u32>(\n input: [Field; N],\n in_len: u32,\n is_variable_length: bool,\n ) -> Field {\n let two_pow_64 = 18446744073709551616;\n let iv: Field = (in_len as Field) * two_pow_64;\n let mut sponge = Poseidon2::new(iv);\n for i in 0..input.len() {\n if i < in_len {\n sponge.absorb(input[i]);\n }\n }\n\n // In the case where the hash preimage is variable-length, we append `1` to the end of the input, to distinguish\n // from fixed-length hashes. (the combination of this additional field element + the hash IV ensures\n // fixed-length and variable-length hashes do not collide)\n if is_variable_length {\n sponge.absorb(1);\n }\n sponge.squeeze()\n }\n}\n\npub struct Poseidon2Hasher {\n _state: [Field],\n}\n\nimpl Hasher for Poseidon2Hasher {\n fn finish(self) -> Field {\n let iv: Field = (self._state.len() as Field) * 18446744073709551616; // iv = (self._state.len() << 64)\n let mut sponge = Poseidon2::new(iv);\n for i in 0..self._state.len() {\n sponge.absorb(self._state[i]);\n }\n sponge.squeeze()\n }\n\n fn write(&mut self, input: Field) {\n self._state = self._state.push_back(input);\n }\n}\n\nimpl Default for Poseidon2Hasher {\n fn default() -> Self {\n Poseidon2Hasher { _state: &[] }\n }\n}\n"
|
|
2578
2578
|
},
|
|
2579
2579
|
"271": {
|
|
@@ -2582,7 +2582,7 @@
|
|
|
2582
2582
|
},
|
|
2583
2583
|
"289": {
|
|
2584
2584
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/hash.nr",
|
|
2585
|
-
"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 CONTRACT_CLASS_LOG_SIZE_IN_FIELDS, FUNCTION_TREE_HEIGHT, GENERATOR_INDEX__NOTE_HASH_NONCE,\n GENERATOR_INDEX__OUTER_NULLIFIER, GENERATOR_INDEX__SILOED_NOTE_HASH,\n 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::{arrays::array_concat, field::{field_from_bytes, field_from_bytes_32_trunc}},\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::new(fields, private_log.inner.log.length)\n }\n}\n\npub fn 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(log: [Field; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS]) -> Field {\n poseidon2_hash(log)\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 poseidon::poseidon2::Poseidon2::hash(inputs, N)\n}\n\n#[no_predicates]\npub fn poseidon2_hash_with_separator<let N: u32, T>(inputs: [Field; N], separator: T) -> Field\nwhere\n T: ToField,\n{\n let inputs_with_separator = 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 poseidon::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 = poseidon::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 = poseidon::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"
|
|
2585
|
+
"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 CONTRACT_CLASS_LOG_SIZE_IN_FIELDS, FUNCTION_TREE_HEIGHT, GENERATOR_INDEX__NOTE_HASH_NONCE,\n GENERATOR_INDEX__OUTER_NULLIFIER, GENERATOR_INDEX__SILOED_NOTE_HASH,\n 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::{arrays::array_concat, field::{field_from_bytes, field_from_bytes_32_trunc}},\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_nonce_and_unique_note_hash(\n siloed_note_hash: Field,\n first_nullifier: Field,\n note_index_in_tx: u32,\n) -> Field {\n let nonce = compute_note_hash_nonce(first_nullifier, note_index_in_tx);\n compute_unique_note_hash(nonce, siloed_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 compute_nonce_and_unique_note_hash(siloed_note_hash, first_nullifier, note_index_in_tx)\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::new(fields, private_log.inner.log.length)\n }\n}\n\npub fn 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(log: [Field; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS]) -> Field {\n poseidon2_hash(log)\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 poseidon::poseidon2::Poseidon2::hash(inputs, N)\n}\n\n#[no_predicates]\npub fn poseidon2_hash_with_separator<let N: u32, T>(inputs: [Field; N], separator: T) -> Field\nwhere\n T: ToField,\n{\n let inputs_with_separator = 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 poseidon::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 = poseidon::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 = poseidon::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"
|
|
2586
2586
|
},
|
|
2587
2587
|
"306": {
|
|
2588
2588
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/poseidon2.nr",
|
|
@@ -2600,11 +2600,11 @@
|
|
|
2600
2600
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/type_serialization.nr",
|
|
2601
2601
|
"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"
|
|
2602
2602
|
},
|
|
2603
|
-
"
|
|
2603
|
+
"364": {
|
|
2604
2604
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/utils/arrays.nr",
|
|
2605
|
-
"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, 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 get_split_order_hints::{get_split_order_hints_asc, 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;\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\n// Returns the number of consecutive elements at the start of the array for which the predicate returns false.\n// This function ensures that any element after the first matching element (predicate returns true) also matches the predicate.\npub fn array_length_until<T, let N: u32, Env>(array: [T; N], predicate: fn[Env](T) -> bool) -> u32 {\n let mut length = 0;\n let mut stop = false;\n for i in 0..N {\n if predicate(array[i]) {\n stop = true;\n } else {\n assert(\n stop == false,\n \"matching element found after already encountering a non-matching element\",\n );\n length += 1;\n }\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\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// Helper function to check if an array is padded with a given value from a given index.\n// Different to padded_array_length in that it allows the elements before the given index to be the same as the padded value.\npub fn array_padded_with<T, let N: u32>(array: [T; N], from_index: u32, padded_with: T) -> bool\nwhere\n T: Eq,\n{\n let mut is_valid = true;\n let mut should_check = false;\n for i in 0..N {\n should_check |= i == from_index;\n is_valid &= !should_check | (array[i] == padded_with);\n }\n is_valid\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]\nfn test_array_length_until() {\n let array = [11, 22, 33, 44, 55];\n assert_eq(array_length_until(array, |x| x == 55), 4);\n assert_eq(array_length_until(array, |x| x == 56), 5);\n assert_eq(array_length_until(array, |x| x > 40), 3);\n assert_eq(array_length_until(array, |x| x > 10), 0);\n}\n\n#[test(should_fail_with = \"matching element found after already encountering a non-matching element\")]\nfn test_array_length_until_non_consecutive_fails() {\n let array = [1, 1, 0, 1, 0];\n let _ = array_length_until(array, |x| x == 0);\n}\n\n#[test(should_fail_with = \"matching element found after already encountering a non-matching element\")]\nfn test_array_length_until_first_non_matching_fails() {\n let array = [1, 0, 0, 0, 0];\n let _ = array_length_until(array, |x| x == 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\n#[test]\nfn test_array_padded_with() {\n let array = [11, 22, 33, 44, 44];\n assert_eq(array_padded_with(array, 0, 44), false);\n assert_eq(array_padded_with(array, 1, 44), false);\n assert_eq(array_padded_with(array, 2, 44), false);\n assert_eq(array_padded_with(array, 3, 44), true);\n assert_eq(array_padded_with(array, 4, 44), true);\n assert_eq(array_padded_with(array, 4, 33), false);\n assert_eq(array_padded_with(array, 5, 44), true); // Index out of bounds.\n assert_eq(array_padded_with(array, 0, 11), false);\n}\n"
|
|
2605
|
+
"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_padded_array;\npub mod assert_sorted_transformed_value_array;\npub mod assert_split_sorted_transformed_value_arrays;\npub mod assert_split_transformed_padded_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, OrderHint},\n};\npub use assert_sorted_array::assert_sorted_array;\npub use assert_sorted_transformed_padded_array::{\n assert_sorted_transformed_i_padded_array_capped_size,\n assert_sorted_transformed_padded_array_capped_size, validate_padded_items,\n};\npub use assert_split_sorted_transformed_value_arrays::{\n assert_split_sorted_transformed_value_arrays_asc,\n get_split_order_hints::{get_split_order_hints_asc, SplitOrderHints},\n};\npub use assert_split_transformed_padded_arrays::assert_split_transformed_padded_arrays;\npub use get_sorted_result::{get_sorted_result, SortedResult};\npub use sort_by_counter::sort_by_counter_asc;\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\n// Returns the number of consecutive elements at the start of the array for which the predicate returns false.\n// This function ensures that any element after the first matching element (predicate returns true) also matches the predicate.\npub fn array_length_until<T, let N: u32, Env>(array: [T; N], predicate: fn[Env](T) -> bool) -> u32 {\n let mut length = 0;\n let mut stop = false;\n for i in 0..N {\n if predicate(array[i]) {\n stop = true;\n } else {\n assert(\n stop == false,\n \"matching element found after already encountering a non-matching element\",\n );\n length += 1;\n }\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\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// Helper function to check if an array is padded with a given value from a given index.\n// Different to padded_array_length in that it allows the elements before the given index to be the same as the padded value.\npub fn array_padded_with<T, let N: u32>(array: [T; N], from_index: u32, padded_with: T) -> bool\nwhere\n T: Eq,\n{\n let mut is_valid = true;\n let mut should_check = false;\n for i in 0..N {\n should_check |= i == from_index;\n is_valid &= !should_check | (array[i] == padded_with);\n }\n is_valid\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]\nfn test_array_length_until() {\n let array = [11, 22, 33, 44, 55];\n assert_eq(array_length_until(array, |x| x == 55), 4);\n assert_eq(array_length_until(array, |x| x == 56), 5);\n assert_eq(array_length_until(array, |x| x > 40), 3);\n assert_eq(array_length_until(array, |x| x > 10), 0);\n}\n\n#[test(should_fail_with = \"matching element found after already encountering a non-matching element\")]\nfn test_array_length_until_non_consecutive_fails() {\n let array = [1, 1, 0, 1, 0];\n let _ = array_length_until(array, |x| x == 0);\n}\n\n#[test(should_fail_with = \"matching element found after already encountering a non-matching element\")]\nfn test_array_length_until_first_non_matching_fails() {\n let array = [1, 0, 0, 0, 0];\n let _ = array_length_until(array, |x| x == 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\n#[test]\nfn test_array_padded_with() {\n let array = [11, 22, 33, 44, 44];\n assert_eq(array_padded_with(array, 0, 44), false);\n assert_eq(array_padded_with(array, 1, 44), false);\n assert_eq(array_padded_with(array, 2, 44), false);\n assert_eq(array_padded_with(array, 3, 44), true);\n assert_eq(array_padded_with(array, 4, 44), true);\n assert_eq(array_padded_with(array, 4, 33), false);\n assert_eq(array_padded_with(array, 5, 44), true); // Index out of bounds.\n assert_eq(array_padded_with(array, 0, 11), false);\n}\n"
|
|
2606
2606
|
},
|
|
2607
|
-
"
|
|
2607
|
+
"367": {
|
|
2608
2608
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/utils/reader.nr",
|
|
2609
2609
|
"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"
|
|
2610
2610
|
},
|
|
@@ -2630,7 +2630,7 @@
|
|
|
2630
2630
|
},
|
|
2631
2631
|
"69": {
|
|
2632
2632
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/public_context.nr",
|
|
2633
|
-
"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(\n gas_opts.l2_gas.unwrap_or(MAX_FIELD_VALUE),\n gas_opts.da_gas.unwrap_or(MAX_FIELD_VALUE),\n contract_address,\n calldata,\n );\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(\n gas_opts.l2_gas.unwrap_or(MAX_FIELD_VALUE),\n gas_opts.da_gas.unwrap_or(MAX_FIELD_VALUE),\n contract_address,\n calldata,\n );\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// 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(\n l2_gas_allocation: Field,\n da_gas_allocation: Field,\n address: AztecAddress,\n args: [Field],\n) {\n call_opcode(l2_gas_allocation, da_gas_allocation, address, args)\n}\n\nunconstrained fn call_static(\n l2_gas_allocation: Field,\n da_gas_allocation: Field,\n address: AztecAddress,\n args: [Field],\n) {\n call_static_opcode(l2_gas_allocation, da_gas_allocation, 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 l2_gas_allocation: Field,\n da_gas_allocation: Field,\n address: AztecAddress,\n args: [Field],\n) {}\n\n#[oracle(avmOpcodeStaticCall)]\nunconstrained fn call_static_opcode(\n l2_gas_allocation: Field,\n da_gas_allocation: Field,\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"
|
|
2633
|
+
"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_U32_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(\n gas_opts.l2_gas.unwrap_or(MAX_U32_VALUE),\n gas_opts.da_gas.unwrap_or(MAX_U32_VALUE),\n contract_address,\n calldata,\n );\n // Use success_copy to determine whether the call succeeded\n let success = 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(\n gas_opts.l2_gas.unwrap_or(MAX_U32_VALUE),\n gas_opts.da_gas.unwrap_or(MAX_U32_VALUE),\n contract_address,\n calldata,\n );\n // Use success_copy to determine whether the call succeeded\n let success = 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) -> u32 {\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) -> u32 {\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// 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() -> u32 {\n l2_gas_left_opcode()\n}\nunconstrained fn da_gas_left() -> u32 {\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(\n l2_gas_allocation: u32,\n da_gas_allocation: u32,\n address: AztecAddress,\n args: [Field],\n) {\n call_opcode(l2_gas_allocation, da_gas_allocation, address, args)\n}\n\nunconstrained fn call_static(\n l2_gas_allocation: u32,\n da_gas_allocation: u32,\n address: AztecAddress,\n args: [Field],\n) {\n call_static_opcode(l2_gas_allocation, da_gas_allocation, 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() -> u32 {}\n\n#[oracle(avmOpcodeDaGasLeft)]\nunconstrained fn da_gas_left_opcode() -> u32 {}\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 l2_gas_allocation: u32,\n da_gas_allocation: u32,\n address: AztecAddress,\n args: [Field],\n) {}\n\n#[oracle(avmOpcodeStaticCall)]\nunconstrained fn call_static_opcode(\n l2_gas_allocation: u32,\n da_gas_allocation: u32,\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"
|
|
2634
2634
|
},
|
|
2635
2635
|
"70": {
|
|
2636
2636
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/returns_hash.nr",
|
|
@@ -2646,7 +2646,7 @@
|
|
|
2646
2646
|
},
|
|
2647
2647
|
"97": {
|
|
2648
2648
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/dispatch.nr",
|
|
2649
|
-
"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"
|
|
2649
|
+
"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 u32 = &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"
|
|
2650
2650
|
}
|
|
2651
2651
|
}
|
|
2652
2652
|
}
|