npm - @aztec/protocol-contracts - Versions diffs - 3.0.0-nightly.20251211 → 3.0.0-nightly.20251213 - Mend

@aztec/protocol-contracts 3.0.0-nightly.20251211 → 3.0.0-nightly.20251213

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (7) hide show

package/artifacts/AuthRegistry.json +67 -67
package/artifacts/ContractClassRegistry.json +50 -50
package/artifacts/ContractInstanceRegistry.json +66 -66
package/artifacts/FeeJuice.json +66 -66
package/artifacts/MultiCallEntrypoint.json +46 -46
package/artifacts/Router.json +42 -42
package/package.json +4 -4

package/artifacts/ContractInstanceRegistry.json CHANGED Viewed

@@ -36,7 +36,7 @@
         }
       },
       "bytecode": "JwACBAEoAAABBIBGJwAABEYnAgEEACcCAgQAHwoAAQACAEUlAAAAQSUAAABsLQIBRScCAgRFJwIDBAE7DgADAAIsAABDADBkTnLhMaApuFBFtoGBWF0oM+hIeblwkUPh9ZPwAAAAJwBEBAMmJQAAA/QeAgACAB4CAAMAHgIABAknAgUBASQCAAQAAACSJQAABBoeAgAEAQoiBEMGFgoGBxwKBwgABCoIBAcnAgQBAAoqBgQIJAIACAAAAMUnAgkEADwGCQEnAgYAACsCAAgAAAAAAAAAAAIAAAAAAAAAAC0IAQknAgoEBQAIAQoBJwMJBAEAIgkCCi0KCgstDgYLACILAgstDgYLACILAgstDgYLACILAgstDggLLQgBCAAAAQIBLQgBCgAAAQIBLQgBCwAAAQIBLQgBDAAAAQIBJwINAAEtCAEOJwIPBAQACAEPAScDDgQBACIOAg8tCg8QLQ4NEAAiEAIQLQ4HEAAiEAIQLQ4GEC0ODggtDgkKJwIHBAItDgcLLQ4EDCcCBwQAJwIJBAEtCgcBIwAAAZ0MIgFEAiQCAAIAAANuIwAAAa8tCwoCLQsCAwAiAwIDLQ4DAi0IAQMnAgcEBQAIAQcBJwMDBAEAIgICBycCDQQEACIDAg4/DwAHAA4tCwgCLQsLBy0OAggtDgMKLQ4HCy0OBQwAKgMJBS0LBQIKKgIGAwoqAwQFJAIABQAAAiAlAAAELB4CAAMGLwoAAgAEHAoEBQQcCgUCAAIqBAIFLAIAAgAtXgmLgro3tDuZoTFhGP0g1C9RZsnp8T+16mWpbR4KbQQqBQIEHAoEBgQcCgYFAAIqBAUGBCoGAgQcCgQHARwKBwYAHAoGBwECKgQGCCwCAAQAMDPqJG5QbomOl/Vwyv/XBMsLtGAxP7cgsp4TnlwQAAEEKggECRwKCQoEHAoKCAACKgkICgQqCgIJHAoJCgEcCgoCABwKAgoBAioJAgsEKgsECRwKCQsEHAoLBAAcCgQJBRYKCgQcCgIKBRwKBAIFBCoKCQQcCggJBRYKBwgcCgYHBRwKCAYFBCoHCQgcCgUJBQwqAwkFKQIAAwUAAVGAJAIABQAAA1UjAAADPQQqBwgCBCoGAwQAKgIEAy0KAwEjAAADbQQqCgQFBCoCAwQAKgUEAi0KAgEjAAADbSYtCwsCDCoBAgMkAgADAAADhCMAAAPmLQsKAwAiAwINACoNAQ4tCw4HLQsIDQAiDQIPACoPARAtCxAOACoHDg8tCwwHLQIDAycABAQFJQAABD4tCAUOACIOAhAAKhABES0ODxEtDg0ILQ4OCi0OAgstDgcMIwAAA+YAKgEJAi0KAgEjAAABnSgAAAQEeEYMAAAEAyQAAAMAAAQZKgEAAQXaxfXWtEoybTwEAgEmKgEAAQVP30qK18/w0zwEAgEmKgEAAQW6uyHXgjMYZDwEAgEmLQEDBgoABgIHJAAABwAABFQjAAAEXS0AAwUjAAAEnC0AAQUAAAEEAQAAAwQJLQADCi0ABQsKAAoJDCQAAAwAAASXLQEKCC0ECAsAAAoCCgAACwILIwAABHMnAQUEASY=",
-      "debug_symbols": "tZndbts6DMffJde90Acpkn2VYRiyLhsCBGmRtQc4KPruh7RF2WkhofHObpqf6fgfkqIopnnd/Th8f/n17Xj++fh7d//ldff9cjydjr++nR4f9s/Hx7NaX3fB/sSYd/f5Tl95d0/6mvQ6BgM1xKiQcwWIDkUBFdAs9hSWCiXUWwUrkFnEACuwW5grSHag3X0qd7sUUgXzZwa/lf1Wdgu4Bdxijs2AFcyxGcBBKpB/BHEFNkE0KBUkOuAMOQQHcJAKltMZTJAVpigmoApTFBO4BdwCbpmimAArTFFMAA5SYYpCDKgCR4dSQcIMMK16Usj6npwN0EEqADhoFFnDAUwOVKG4pbiF3EJuYbfYcmdQkOSgjmWtKLRkzgAOXCHam4sBVUjmMxuUCtktk/MG5jwkA7WAViZaDkFjR8vhDGpBLXW0EkX9rBKogn0oJgOqkMySDcyizhdbQUQDqgBusRVEdbVYxlA/vbBUEHUM2UBmIAsZxUAtRf2hqJYSDaRCcksyi/pD2SzZwCzqD1nIM5hF3SD0p5CrpWQHt1jZlGLAs/Nk6zVZmCqIW2x7Fo2CbXsW9ZntKSsktqdInRdbyhlq/UioFSXRLbYvJrCsUjSgCtktWReXVFms7cxQS1TABdEF0S0W4Az+EeSWqSANODq4IPvjMj319na381b57flyOFinXPVO7ahP+8vh/Ly7P7+cTne7f/anl+lNv5/25+n1eX/Ru5qGw/mHvqrgz+PpYPR2tzwd+o+mzFKfThCkCcQIVxKxL6GNtnDVUCZqInTtRuprZO2gWDWUKfY0RqFwdDeSpNgNBUbZQCbX0C64CiVfaeD/kI7yd9OR0ep7lkDhbjp4kA7JObSUZig9N2Tghh5BzY+cAf4wlBJCN5SBhLY2qBKUcKlzjNdlPqjRBGydue4V5twrjpgH1SG0VIf2im5KI4zKQ8+JVh56MHRFxuFI2y8gGLrhjAoVvEwhpiUW3LQshbvLMihSKr4o62xC+rwLMTQXIPdcSAMJHRW8PnVYWHUeeacx6qJ2kM+LEVJTyOU6jjRYUFoqizjiopGvd0nKo52W2nouyUxwvaBp1EI1aA8krQ6UDxqDForiTbis4rjJi7Qca3mVzw8aNFqR5IUREWijRpGmwbItFoqtNCiHrkYeVGjUAcz90DmrrzGoUAKvDYKySUFatxDkTQoxtMYXQ+nXRh7kEzi2psWYVrv18+nUYbM18TQor1HTiAVb06DUbRp5VF46D7dRQ1bTm4RN7Y+7B2MeHfFcvEAzM3e9gNHwhiJt1NAzvjvxQBydi4LLuSgUeiLDaPSrhWus1/ZDNIM2ihjagYCrc/GDxuiQD5L9bFRG7GYERyJ6zDeRxN1JAUaHPJbFEyylLzJMSZto8WocfZ+S0TwKyyEJZalVnYFu0FjOJ8xpq0arVVz1wps0sG1drf2NfpTQ8lFWk/WNGtg0Vl35Ng1uk2QR2qZBsX3zIuCtGstJuZrDbtNYYiHZ6AfHtrYMcatGq1Nebf7bNBiahuRtGhLblx6BzRotH4Ib94ss+0U27hd97/KtmrflNEPwfOi/UrftOf2PaztiEEJX49PHVO4fMYVHY4y0+gh5Xevy+Zku+LaVtHEqLL6wQvinc+V7ha96uX84Xq5+k3gzqctx//10qJc/X84Pq7vP/z75Hf9N4+ny+HD48XI5mNLyw4b++RL1e3SK9FV/WJguudzpEGeXcbqLeklf38yZ/wA="
+      "debug_symbols": "tZnRbts6DIbfJde5kERRJPsqwzBkXTYECNIiaw9wUPTdD2mLstNCQuud3TSf6fgPSVGk0rzsfhy/P//6drr8fPi9u/vysvt+PZ3Pp1/fzg/3h6fTw0WtL7tgf2KE3R3s9ZV3d6SvSa9jMFBDjAoAFXJ0KAqogGaxp7BUKKHeKliBzCIGWIHdwlxBwIF2d6nsdymkCubPDH4L/Ba4Jbslu8UcmwErmGMzZAepQP4RxBXYBNGgVJDogDNACA7ZQSpYTmcwQVaYopiAKkxRTOCW7JbslimKCbDCFMUE2UEqTFGIAVXg6FAqSJghT6ueFEDfA2CADlIhZweNAjScjMmBKhS3FLeQW8gt7BZbbsgKkhzUMdCKQkvmDNmBK0R7czGgCsl8ZoNSAdwyOW9gzudkoJaslYmWw6yxo+VwBrWgljpaiaJ+VglUwT4UkwFVSGYBA7Oo88VWENGAKmS32AqiulosY6ifXlgqiDqGbCAzkIWMYqCWov5QVEuJBlIhuSWZRf0hMAsYmEX9IQt5BrOoG4T+FHK1FHBwi5VNKQY8O0+2XpOFqYK4xbZn0SjYtmdRn9meskJie4rUebGlnKHWj4RaURLdYvtiAssqRQOqAG4BXVxSZbG2M0MtUckuiC6IbrEAZ/CPILdMBWnA0cEF2R+X6anX1/3OW+W3p+vxaJ1y1Tu1oz4ersfL0+7u8nw+73f/HM7P05t+Px4u0+vT4ap3NQ3Hyw99VcGfp/PR6HW/PB36jyZgqU+nHKQJxIg3ErEvoY22cNVQJmoidOtG6muAdlCsGsoUexqjUDi6G0lS7IaSBxI5Ymjp0JmyuAE3Gvg/pKP83XQAWn3PEijcTQcP0iEALR0CufTckIEbOoKaHwA5/2EoJYRuKAMJbW25SlDCpc4x3pb5oEYT5lg8G9r5S684IgyqQ2ipDu0V3ZTGPCoPnROtPHQwdEXG4ZTYwsEI3XBGhZq9THNMSyzblqVwd1kGRUo2nmaFVTZz+rgLMTQXMvRcSAMJPSp4JvWwsOo8cutFGnVRbLUVUlOAQrcKgwWlpbKIdWc0DZBbDRjttNTWc0lmwjeNfNRCo7SqSquB8k5j0EJRqEqUVRyf8iItYw1W+XynQaMVSV4YETNt1CjSNFi2xUJL2yEIXQ0YVGjUA5j7oeesvsagQil7bVAumxSkdQtB3qQQQ2t8MZR+bcAgn5lja1qMabVbP55OPWy2Jp4G5TVqGrFgaxqUuk0DRuWl5+F21JDV6U3ipvbH3cEIoxHPxQsUmLnrRR4d3lCkHTV0xndPPDmO5qLgMhdlfXwLH49Gv1q4xnpt30UzaKOIoQ0EXM3FdxqjIR8EfDYqI3YzgiORlLmJJO6eFPJoyGNZPMFS+iLDlLQTLd4cR9+mZHQezcuQzEVWE+4zGst8QkhbNcJyECzbNLBtXa39jX6U0PJRVifrT2pg01h15c9pcPvmVYS2aVCkNuUyb9VYJuXqHPY5jSUWko1+cGxryzlu1Wh1yogbNTg3DYFtGhKhfQXMmzVaPgQ37hdZ9ots3C/6XWn5Vs3bcgo5eD70X6nb9pz+x7WNGMyhq/HhMQX9EVN4dIyRVh8B1rWeP36mC75tJW08FRZfWCH803PlW4Wvenm4P11vfpN4Nanr6fD9fKyXP58v96u7T/8++h3/TePx+nB//PF8PZrS8sOG/vkShfcp0lf9YWG65LLXVbDLON1FvaSvr+bMfw=="
     },
     {
       "name": "publish_for_public_execution",
@@ -2020,7 +2020,7 @@
         }
       },
       "bytecode": "H4sIAAAAAAAA/+2dB5jUVNi239kZeu8dBum9FxGkLLv03uuyLAusLruwhaYi2LsUewV7w15ARbFg770jCoqiYMOu/M8LiYYws5uTsA+/3/flum4yZM/J/ebkJDM5Sc4JyYGpozVPSUldmpeelpKVk5KRlZeek5WamZuSMj9/ZmZG7tyU2dk5Bz6npaQvTk/Lz8vIzhodEakdOZA7BMLWPAFEXcvsufNzpRjpqoA+rmXVwXLXshoxltWNsb56MZbVj7GsQYxl0RiOhjGWHRVjWaMYyxrHcLSMUS5tYixrH2NZpxjLOltza7cUPIWsedSat581PGdbh7UtNoxMenDFionTmnfaOXDJxvmrErftXfMd/v5I+N+0hUytg3geLdxTybnusvLvBoesOHXexPp/U2uu67XTbcLnx8DjYHP44JWHXfEWMoWaGaTdFPZeDk94L++DJtP4mxukfcwg/idJ8bcwSPu4QfxPGcQfqx4+YdXDJ635U9Z8s6MePo3PW8Az4NmA9bClQdqnDcrhOdJ+bGWQdotB/M+T4m9tkPYZg/hfCFgPn7Pq3fPW/AVr/qyjHr6Izy+Bl8ErAethG4O0LxqUw6uk/djWIO1LBvG/Roq/nUHalw3ifz1gPXzVqnevWfPXrfkrjnr4Bj6/Cd4Cbwesh+0N0r5hUA7vkPZjB4O0bxrE/y4p/o4Gad8yiP+9gPXwHavevWvN37Pmbzvq4fv4/AH4EHwUsB52Mkj7vkE5fEzaj50N0n5gEP8nAffjx9Z++8Saf2jNP3Lsx634/CnYBj5z7ccEax4VbyFUEe/b9rnXbQuNWu68gNN8fSRYnI3Fe5zbve+DkDNOO19E/r0IPSSDYdzbDeuDPe1wtzLsCP97FVxcjmxwX4QDCL8Im+f70uAI9BvXl44jKSreJ1PXDsvlPmMVtl07DMrApLx2Ghwt//xjGHes7fVSTl7TmmzvV+Gi3b9al3aEzcvpa5/ffKZn0u0GZbXL55l0l+NMerhOViZpnb5v/J6s7MymBfyNQaF9W8QnNv3nWx8n3G+L+CDpbMVlehLsbJDWpGx3G54E7cm0bpj87NxNqBu7fZyo9vg8UZl6vvPuqRPE833hnohz3e6f7N+FD26ab2bNv3f8ZP8Bn38EP4G94X/zOuMsZNpfH/b4OB/9YFCPfg54+fKzVRY/WvOfrPleR1n8gs+/gt/A7+FD1+nctsLi/aPweMMFxWvvO/t2yi/W//9wxPsnPv8F/gb7AsarK42Kp6lzEE+ocE8557rd5aL/0Xlz6/8trLmu106XgA9h/T8o5ro5Z/pjz6SZPyHivRyKey/vgybT+E2a+cMG8ZcgxW/SzB8xiL+kQfyx6mFxqx6WsOYlrXkxRz0shQ+lQRlQNmA9NGnmL2VQDuVI+9Gkmb+0QfzlSfGbNPOXMYi/QsB6WM6qd+WteQVrXtZRDyviQyVQGVQJWA9NmvkrGpRDVdJ+NGnmr2QQfzVS/CbN/JUN4q8esB5WtepdNWte3ZpXcdTDGvhQE9RyPMtkT0XZzF/DoBzqBCyHOtZ217Tmtax5bUc51MWHeqA+aBA5dJ0i3uONeo+3Qqx4o1Z8da35nzF+ZzbEh6NAI9DY2o4EcV1wOtbpjL+QKdTQoLwTHJ+bWME1tdvE7RYe/cNy17Km1jLnZFrhGhpUoibx0051pQ01NSiAiBV3QgFponGWu73Ov5nutCaGB4k9NXPvrGaRQ2uRactLAcEcUkGbGezE5hHPhXnQNjX3UNkKczc1iNNkm1oUsE3uvM5tauE4qEo6tse5TYVMoRhpE16tMj2/+A3T0to0K5f0fc3KF53a++nzT+ndrLXBev85GOyD3z7gTWJrifStQOtCvpUKK1+Tq62WBvutjeFJ4nA1bbfxeaC3jQQQto2Y52tnUJh+42rnqBxRMZ9MK5PJpW8rg+1vf4QqU3uflamD38qkwg4+KlPHIq5MGldHn5XJz4HRMWL+u7KT4c4qZc1bWq5W1rx1pODl6ukMuoCuhZx9CwujZcSsXOy0hZVFt4jZPrInd3u4SZkXlra7wbY69083x35wxlboSuTAt9v+fSfmeTXeo0EPcIxrP5uWU2uDcuppUE6xYiksj11/vaa3y8H0eOxFqoNtDNIeW8Rlq/WttYFD93UvH2Xb2/AL0b6KsSfT7dIyNjlXaTn3Dvjj45/JNNhdBjfp+hielOzLCzufbmMxOfjywj1FxdNUXNdbL9g6En3my/aZL8tnvjyf+XJ85kv1mS/NZz6/2zfIZz6/+yHXZz6/2+d3P/jdPr/7L91nvpE+8+X7zDfTZ75Mn/kyfObzW8/m+sznd//N8pmvh898UZ/5TvCZ7yT9jqkghQezcUP7uZseGJiwLrPh14NOXvdm195bb1+2YtyJ61uOG/Bf+fEQ9ZYs5P4Q9ZQNbcpiHpupo6kUvcPg/WTfDoN3iH07DN7z9e0waC717TBoRfPtMHi4wbfD4AEE3w6Dm+O+HQY3sI3XbT+IKGb5Yk+mJ+Y+Bq0SfX1eKPV1XCiF5OCr0H8yGMZtEMtBvn7um3n9HJfepkHouw9f+3jkN/EItWUn+iy0/n7bslXY30dbdlIRt2VrXEk+fl5olhJy8K1s050fr9IUFrPHGh+K94eoeMvr3LZkq4wGuI+a5Mi/h7K9bIAjQL+FYtp43tdbRVmtzw4kG1SqAYaF7aeCazymDZ0m2zDQsKHTdBv0zDnQR8PlIMNGYdO49I2snT7OyoMDxlXY+v2W15Ai3o9+v8WGGn6LuU+c9mR6DJj8DBl8BE6aw6yT5nD3SXNYjJPm8BgBRlzyoiqQwk6YwwxONsOL+ISpB4/GY/o4Qj+DbTDZ3hEBD0ovccfaXi/l5DWtyfaONDw5ml6H6JfCYMN6PMTHyXRUEW+HHosGX3Ah3YahPrZjtOF22JPp9pi8Jt/vMMXk5Rd/VDxNoS7CiSkk3mPqKpyYEsR7TN2EE1NYvMfUXTh1/GjxHv/WsL+YTL/vegjHc4xwPD2Fsy97ifd9+TlpXx4rHE9v4Xj6CMfTVziefsLxJArH0184niTheJKF4xkgHM9A4XgGCcczWDieIcLxDBWOZ5hwPMOF4xkhHM9I4XhGCcczWjieMcLxjBWOZ5xwPOOF45kgHM9E4XgmCcczWTieKcLxTBWOZ5pwPNOF40kRjmeGcDypwvHMFI4nTTieWcLxpAvHM1s4njnC8cwVjidDOJ7jhOM5XjieTOF45gnHkyX+PKZt2wYP6oay5fDEVJhnvniPfzupPXSBx5j27Nv3dxBPjnC2J1c4njzhePKF41koHM8i4XgWC8ezRDiepcLxnCAcz4nC8ZwkHM8y4XhOFo5nuXA8K4TjOUU4nlOF4zlNOJ7TheM5QzieM4XjOUs4nrOF4zlHOJ5zheM5Tzie84XjuUA4nguF41kpHM8q4XhWC8ezRjiei4TjuVg4nkuE47lUOJ7LhOO5XDieK4TjuVI4nquE47laOJ5rhOO51pHWy7PJfj1rhbM964TjuU44nuuF47lBOJ4bheO5STiem4XjuUU4nluF47lNOJ7bheO5Qzie9cLx3Ckcz13C8dwtHM89wvHcKxzPfcLx3C8czwPC8TwoHM9DwvFsEI5no3A8DwvH84hwPI8Kx7NJOJ7HhON5XDiezcLxPCEcz5PC8TwlHM/TwvFsEY7nGeF4nhWO5znheJ4XjucF4XheFI7nJeF4XhaO5xXheF4Vjuc14XheF47nDeF43hSO5y3heN4Wjucd4XjeFY7nPeF43heO5wPheD4Ujucj4Xg+Fo7nE+F4tgrH86lwPNuE4/lMOJ7PhePZLhzPDuF4vhCO50vheHYKx/OVcDxfC8ezSzieb4Tj+VY4nt3C8ewRjuc74Xi+F47nB+F4fhSO5yfhePYKx/OzcDy/CMfzq3A8vwnH87twPH8Ix/OncDx/Ccfzt3A8+4Tj0Qwe07oymnlCJE8CyRMmeSIkTzGSpzjJU4LkKUnylCJ5SpM8ZUiesiRPOZKnPMlTgeSpSPJUMvT4GQ25pUHf7vZge6bbUZlUXlV8ekz7yqga8l5mu0h9ZVQjlXF1kqcGyVOT5KlF8tQmeeqQPHVJnnokT32SpwHJEyV5GpI8R5E8jUiexiRPE5KnKcnTjORpTvK0IHlakjytSJ7WJE8bkqctydOO5GlP8nQgeTqSPJ1Ins4kTxeSpyvJ043k6U7yHE3y9CB5jiF5epI8vUieY0me3iRPH5KnL8nTz+Epyj4sEknb05/kSSJ5kkmeASTPQJJnEMkzmOQZQvIMJXmGkTzDSZ4RJM9IkmcUyTOa5BlD8owlecaRPONJngkkz0SSZxLJM5nkmULyTCV5ppE800meFJJnBsmTSvLMJHnSSJ5ZJE86yTOb5JlD8swleTJInuNInuNJnkySZx7Jk0XyZJM880meBSRPDsmTS/LkkTz5JM9CkmcRybOY5FlC8iwleU4geU4keU4ieZaRPCeTPMtJnhUkzykkz6kkz2kkz+kkzxkkz5kkz1kkz9kkzzkkz7kkz3kkz/kkzwUkz4Ukz0qSZxXJs5rkWUPyXETyXEzyXELyXEryXEbyXE7yXEHyXEnyXEXyXE3yXEPyXEvyrCV51pE815E815M8N5A8N5I8N5E8N5M8t5A8t5I8t5E8t5M8d5A860meO0meu0ieu0mee0iee0me+0ie+0meB0ieB0meh0ieDSTPRpLnYZLnEZLnUZJnE8nzGMnzOMmzmeR5guR5kuR5iuR5muTZQvI8Q/I8S/I8R/I8T/K8QPK8SPK8RPK8TPK8QvK8SvK8RvK8TvK8QfK8SfK8RfK8TfK8Q/K8S/K8R/K8T/J8QPJ8SPJ8RPJ8TPJ8QvJsJXk+JXm2kTyfkTyfkzzbSZ4dJM8XJM+XJM9OkucrkudrkmcXyfMNyfMtybOb5NlD8nxH8nxP8vxA8vxI8vxE8uwleX4meX4heX4leX4jeX4nef4gef4kef4ief4mefaRPDp4gMe0roxmnhDJk0DyhEmeCMlTjOQpTvKUIHlKkjylSJ7SJE8ZkqcsyVOO5ClP8lQgeSqSPJVInsokTxWSpyrJU43kqU7y1CB5apI8tUie2iRPHZKnLslTj+SpT/I0IHmiJE9DkucokqcRydOY5GlC8jQleZqRPM1JnhYkT0uSpxXJ05rkaUPytCV52pE87UmeDiRPR5KnE8nTmeTpQvJ0JXm6kTzdSZ6jSZ4eJM8xJE9PkqcXyXMsydOb5OlD8vQlefo5PDr+T7Ml2Zt/v+Kv+z6t1jXnk/uT8xOXrNyxZcbaGv3evu1hZ0bTsccNxgQPJZK2vX+C9/idk+m2NxHvMSX53HbTmJqK95iSSTE1E+8xDSDF1Fy8xzSQFFML8R7TIFJMrcR7TINJMbUW7zENIcXUVrzHNJQUUzvxHtMwUkwdxHtMw0kxdRTvMY0wjClkGMvusMiesPl33kjSd+sokmc0yTOG5Bnr8TfJnn37fgjiGXeYjpnCPOMNfmP1iXDKeAJpX04keSaRPJNJnikkz1SSZxrJM53kSSF5ZpA8qSTPTJInjeSZRfKkkzyzSZ45JM9ckieD5DmO5Dme5MkkeeaRPFkkTzbJM5/kWUDy5JA8uSRPHsmTT/IsJHkWkTyLSZ4lJM9SkucEkudEkuckkmcZyXMyybOc5FlB8pxC8pxK8pxG8pxO8pxB8pxJ8pxF8pxN8pxD8pxL8pxH8pxP8lxA8lxI8qwkeVaRPKtJnjUkz0Ukz8UkzyUkz6Ukz2Ukz+UkzxUkz5Ukz1Ukz9UkzzUkz7Ukz1qSZx3Jcx3Jcz3JcwPJcyPJcxPJczPJcwvJcyvJcxvJczvJcwfJs57kuZPkuYvkuZvkuYfkuZfkuY/kuZ/keYDkeZDkeYjk2UDybCR5HiZ5HiF5HiV5NpE8j5E8j5M8m0meJ0ieJ0mep0iep0meLSTPMyTPsyTPcyTP8yTPCyTPiyTPSyTPyyTPKyTPqyTPayTP6yTPGyTPmyTPWyTP2yTPOyTPuyTPeyTP+yTPByTPhyTPRyTPxyTPJyTPVpLnU5JnG8nzGcnzOcmzneTZQfJ8QfJ8SfLsJHm+Inm+Jnl2kTzfkDzfkjy7SZ49JM93JM/3JM8PJM+PJM9PJM9ekudnkucXkudXkuc3kud3kucPkudPkucvkudvkmcfySNhjidE8iSQPGGSJ0LyFCN5ipM8JUiekiRPKZKnNMlThuQpS/KUI3nKkzwVSJ6KJE8lkqcyyVOF5KlK8lQjeaqTPDVInpokTy2SpzbJU4fkqUvy1CN56pM8DUieKMnTkOQ5iuRpRPI0JnmakDxNSZ5mJE9zkqcFydOS5GlF8rQmedqQPG1JnnYkT3uSpwPJ05Hk6UTydCZ5upA8XUmebiRPd5LnaJKnB8lzDMnTk+TpRfIcS/L0Jnn6kDx9SZ5+JE8iydOf5EkieZJJngEkz0CSZxDJM5jkGULyDCV5hpE8w0meESTPSJJnFMkzmuQZQ/KMJXnGkTzjSZ4JJM9EkmcSyTOZ5JlC8kwleaaRPNNJnhSSZwbJk0ryzCR50kieWSRPOskzm+SZQ/LMJXkySJ7jSJ7jSZ5MkmceyZNF8mSTPPNJngUkTw7Jk0vy5JE8+STPQpJnEcmzmORZQvIsJXlOIHlOJHlOInmWkTwnkzzLSZ4VJM8pJM+pJM9pJM/pJM8ZJM+ZJM9ZJM/ZJM85JM+5JM95JM/5JM8FJM+FJM9KkmcVybPa4Wk/a3jOtg5rW2wYmfTgihUTpzXvtHPgko3zVyVu27vmu4CeNaTtuYjkuZjkucSnJ8HlKWzfNhbvMV16mGIqzHOZQd3sGzGLybR8dP0jIt7Tj0TaURHz/X15uGi3Y6iP7RjtYzuuINXbiHiP6UpSTMXEe0xXkWIqLt5jupoUUwnxHtM1pJhKiveYriXFVEq8x7SWFFNp8R7TOlJMZcR7TNeRYior3mO6nhRTOfEe0w2kmMqL95huJMVUQbzHdBMpporiPaabSTFVEu8x3UKKqbJ4j+lWUkxVxHtMt5FiqireY7qdFFM18R7THaSYqov3mNaTYqoh3mO6kxRTTfEe012kmGqJ95juJsVUW7zHdA8ppjriPaZ7STHVFe8x3UeKqZ54j+l+Ukz1xXtMD5BiaiDeY3qQFFNUvMf0ECmmhuI9pg2kmI4S7zFtJMXUSLzH9LBBTGE50L6l9/p06gK6gm6gOzga9ADHgJ6gFzgW9AZ9QF/QDySC/iAJJIMBYCAYBAaDIWAoGAaGgxFgJBgFRoMxYCwYB8aDCWAimAQmgylgKpgGpoMUMAOkgpkgDcwC6WA2mAPmggxwHDgeZIJ5IAtkg/lgAcgBuSAP5IOFYBFYDJaApeAEcCI4CSwDJ4PlYAU4BZwKTgOna1mCM8FZ4GxwDjgXnAfOBxeAC8FKsAqsBmvAReBicAm4FFwGLgdXgCvBVeBqcA24FqwF68B14HpwA7gR3ARuBreAW8Ft4HZwB1gP7gR3gbvBPeBecB+4HzwAHgQPgQ1gI3gYPAIeBZvAY+BxsBk8AZ4ET4GnwRbwDHgWPAeeBy+AF8FL4GXwCngVvAZeB2+AN8Fb4G3wDngXvAfeBx+AD8FH4GPwCdgKPgXbwGfgc7Ad7ABfgC/BTvAV+BrsAt+Ab8FusAfocfU9+AH8CH4Ce8HP4BfwK/gN/A7+AH+Cv8DfYB/QAycEEkAYREAxUByUACVBKVAalAFlQTlQHlQAFUElUBlUAVVBNVAd1AA1QS1QG9QBdUE9UB80AFHQEBwFGoHGoAloCpqB5qAFaAlagdagDWgL2oH2oAPoCDqBzqAL6Aq6ge7gaNADHAN6gl7gWNAb9AF9QT+QCPqDJJAMBoCBYBAYDIaAoWAYGA5GgJFgFBgNxoCxYBwYDyaAiWASmAymgKlgGpgOUsAMkApmgjQwC6SD2WAOmAsywHHgeJAJ5oEskA3mgwUgB+SCPJAPFoJFYDFYApaCE8CJ4CSwDJwMloMV4BRwKjgNnA7OAGeCs8DZ4BxwLjgPnA8uABeClWAVWA3WgIvAxeAScCm4DFwOrgBXgqvA1eAacC1YC9aB68D14AZwI7gJ3AxuAbeC28Dt4A6wHtwJ7gJ3g3vAveA+cD94ADwIHgIbwEbwMHgEPAo2gcfA42AzeAI8CZ4CT4Mt4BnwLHgOPA9eAC+Cl8DL4BXwKngNvA7eAG+Ct8Db4B3wLngPvA8+AB+Cj8DH4BOwFXwKtoHPwOdgO9gBvgBfgp3gK/A12AW+Ad+C3WAP+A58D34AP4KfwF7wM/gF/Ap+A7+DP8Cf4C/wN9gH9Es8BBJAGERAMVAclAAlQSlQGpQBZUE5UB5UABVBJVAZVAFVQTVQHdQANUEtUBvUAXVBPVAfNNA+p0FDcBRoBBqDJqApaAaagxagJWgFWoM2oC1oB9qDDqAj6AQ6gy6gK+gGuoOjQQ9wDOgJeoFjQW/QB/QF/UAi6A+SQDIYAAaCQWAwGAKGgmFgOBgBRoJRYDQYA8aCcWA8mAAmgklgMpgCpoJpYDpIATNAKpgJ0sAskA5mgzlgLsgAx4HjQSaYB7JANpgPFoAckAvyQD5YCBaBxWAJWApOACeCk8AycDJYDlaAU8Cp4DRwOjgDnAnOAmeDc8C54DxwPrgAXAhWglVgNVgDLgIXg0vApeAycDm4AlwJrgJXg2vAtWAtWAeuA9eDG8CN4CZwM7gF3ApuAzqGvY4vr2O/67jsOma6jmeuY43rOOA6RreOn61jW+u40zomtI7XrGMp6zjHOgaxjg+sY/fquLo65u1moGPF6jiuOsaqjn+qY5PquKE6pqeOt6ljYeo4lTqGpI7vqGMv6riIOmahjieoY/3pOHw6Rp6OX6djy+m4bzomm46XpmOZ6ThjOgaYjs+lY2fpuFY65tSnQMdq0nGUdIwjHX9IxwbScXt0TB0d70bHotFxYnQMFx1fRcc+0XFJdMwQHc9Dx9rQcTB0jAodP0LHdtBxF3RMBB2vQMcS0H7+tQ9+7R9f+67XfuW1z3f98ax9pWs/5trHuPb/rX1za7/Z2qe19jetfUFrP83ah7L2b6x9D2u/wNpnr/anq33daj+02kes9t+qfatqv6faJ6n2F6p9eWo/m9oHpvZPqX1Har+O+/tcBNpXofYjqH38af972jee9lunfcppf2/aF5v2k6Z9mGn/Ytr3l/bLpX1maX9W2teU9gOlfTRp/0nat5H2O6R9Aml/PdqXjvZzo33QaP8w2neL9quifZ5ofyTaV4j246F9bGj/F9o3hfYboX06aH8L2heC9lOgfQjo+/367r2+F6/vrOv75Pqut76Hre9I6/vL+m6xvver7+Tq+7L6Lqu+Z6rvgOr7mfrupL7XqO8c6vuA+q6evken77jp+2f6bpi+t6XvVOn7Tvoukr4npO/w6Ps1+u6Lvpei74zo+xz6roW+B6HvKOj7A/psvz53r8/E6/Pq+iy5Puetz2Dr89H67LI+V6zP/OrzuPqsrD7Hqs+Y6vOf+mymXkvpM436vKE+C6jP6ekzdPp8mz57ps+F6TNb+jyVPuukzyHpM0L6/I4+W6PPvehzJvoMiD4Toc8T6P17vV+u96f1frDef9X7nXp/Ue/n6f0zvV+l94f0foze/9D7Ddq+r+3p2n6t7cXaPqvtodr+qO192r6m7VnafqTtNdo+ou0Rev2v19t6favXk1rd9drQnqyvv/3Xj/ocgt731/vsel9b7yPrfVu9T6r3JfU+oN530/tcel9J7+PofRO9T6H3BbQdXtu9tZ1Z23W1HVXbLbWdUNvltB1M2520ncduV2koB67TG8mB53eagKagGWgOWoCWoBVoDdqAtqAdaA86gI6gE+gsh06lHZ9bW/OVc5558addJV5zpmtbwN+6F/C3ydZ8eslrN/V7o8x659+mFPC3GQX8bWYBf1tUQCxLC/jbamt+36Uj09OnzFkwTeJPUfE0jQyQd26AvKkB8uYGyJseIG/U88JDp7QAeY9UOWcFyDsnQN4jtY9mBcgbJOa8AHmDeIPUySMVc5B9FPW88NApO0DeIMdR1PPCQ6fZAfLmB8gbZHuPVJ3MCJD3v1g3FgXIG6SsguyjIN+DUc8LD53mB8j7f7+RhHLsBynnI/UdenyAvG0D5I16XnjoNChA3iDfR1HPCw+djtQ5J8h5MsjxG/W88NDpvxhzkON3cYC8Qb4X/u93u/e8rQPkjXpeeOgU5Dfwf/H7t1GAvFMC5A3yGzjIb+//+10nlHPO/7bfZtMC5N3fXq9Tc2uempubnpOXkpY9b35qXsbMzPSU7JzUNMwWpufkZmRnpSzKSZ0/Pz2nuit/gjXXewNh7/5QSUc+8/zL+5d0r9Aov+zPHxK//gPbb98P8ZO/uB2II78zFnu9em+ljONzOZffZ/z9g8ZfuYCY7X2T6EgfFU9TMb0Ho9tZ0Vqg297Y+pyfl5GZkbek7/6qmvhPTR2xv6KOP1BP3SsMuf6fGGd5aUfcEUca72WyuL+9zrC9MY7PzinimttpqlnzUg6/Pffy3u8HW/a+c//gjvMqufLrZO8b3c721ueM3JTcjFnpKemzZ6en6bGfn5WXnpOSk45j/qBzgHXs17LyHeFjPzngsZ8csO6HSjry+Mgf89h3xyKOeX9H3v6udGXl4OPQmUaPo/KOzxWsz2WteZJjXXb+gGWTFLBsQpUlfnnY54Yq1v+d54b5ORkLU/PSB+WOQY1O2l+hEw/U59H/VGdnGbkd4vrsXhZveax94Fz3YTivJAc9r9S05kV9XrHr2qx0/RmRnZueMjcjK6++tfQInzUGBDxrDPivnDUO9xnB/ltyDG/AbfrnbOHvyJCEynKo316Xfbawa384RlpnXSrmSBOrXCXGspAU/CvIvR+i1rxKB3m3wdYuS1pV75o9YuFpW8euX1b1+hZfVqi5O7/nwt8+ynZvS0IBsRd09ikbY3uc5RPwzDQg6JmpnjUv6jOTvZ2ZeQfOSQ2t//9POSf5PP4SAh5/Mc9JsY7Fgs5J7jqqk30eKux85TwnHaZfMMmMXzB1nBnk33IqJvGP5YgrbXVHnipx1ldcCj83hOPE4fy1716HTlHxNIVieUIxPLHOY85yO9Lnqqg1L+pzVTPrc1Z2XsbsJSlpOen4XTsrJSs/MzNjdgauzw6+KPv/pEEmKeCpLOl/ys+rso7Ph6mxJmjZFNhYE6vBxf5ati6qhu+viYkHKuJwux66JSHX51CM5bYw4LGcFPRYZrW02Nc+s9Jn5s9Jycyek5Kak5O6xHUI288FH+FDeEHAQ3hBwF8Tbez8xfzlj3kIO2Ox11tYu4rzcE9ypEmKkybZkSY5TpoBjjQD4qQZ6EgzME4a54MRg+KkGexIMzhOmiGONEPipBnqSDM0TpphjjTD4qQZ7kgzPE6aEY40I+KkcT5EPjJOmlGONKPipBntSDM6TpoxjjRj4qQZ60gzNk6acY404+KkGe9IMz5OmgmONBPipJnoSDMxTppJjjST4qSZ7EgzOU4a543YKXHSTHWkmRonjfMm1rQ4aaY70kyPkybFkSYlTpoZjjQz4qRJdaRJdaUp6Kv/cLWb+jz31bNjizgWhlyxFfe37vqxvsnDrmXO9ZeSQN8DoZBrfbbPvX3OKxk7je1z/y0SI077b84ytz/rT6J+jnTufWuvL+DPzpkB93uFItzvFf+L+z3s+tvh2O+xrpA13TDHZ/s7K+BP/QVF+VM/5IjXntz3mnSyy8Iup5Ix0tt/K+X4m7OsdSrtWB6Osa4Srnx2evu3ht3y46wPdv4KMfzOei5x4nYuc5dLqRjpS8VIr+WT5IjZfb/b9Bi2L8HcvyEirnic+9Idv7MOO9OHY6TXSzy7/Kx76v31AmVo9iGvU7lPK6E4IdZz5UuME1qFAtbrXL9zeT3XsnCMtM51H4YLzAX2uv1eYNo/rYr6AtO+ap+VkYM7nhkL01MysvR2p+21y6GaYz1+Limr+st/0KErrlic63Vf+oqBw56c+8o9ORtRnWlLuuYhc38oXhyhGIkrW/OqjmV2edS25s59mZc+By1+C/LRApOeleeOtrTDZNrsr1MZf/lj7lXny9Nl3EJrHomRLxTn/wmueUFpQwWst2yMv9nrtPeGM157O/4fVo7vdOEYAgA=",
-      "debug_symbols": "tVvbbts8DH6XXOdCFCWK6qsMw9Bt2VCg6IauHfBj2Lv/lCPRTgZxqpXdhLRjfaYonnTwr8Pn08fXrx8enr58+3G4e/fr8PH54fHx4euHx2+f7l8evj3J3V8HV34gHO4Afh8PsFyRXDm58u0qyD/pTPhwF4Xkwx3JA9Ka5EFsD6bzX1nuhQbs5SKWC5an4XhgOBNBh9/yXxPnw8vz6VSe28gnUn+/fz49vRzunl4fH4+Hn/ePr8tDP77fPy305f5Z/nXHw+nps1AB/PLweCrc7+Pa2vWbInmqrZESKgD6MArhc8IG4SAqBLAfhWAfKgIHXgHSRXvstydqnaAUd7RPrvUggdvV3rf2vvt+o/8ZYm2fPexpH7m1T7nXnvvtAVxoPRCetoM4bga0MQO/IlAehQAH0KRwRBshhjXBMakpEaYVAvACAryBkZsuMoY9QngPTRXepxUCw6U2IdwAIxr6pNwwIEUDg/oYgVKFCNlvEPJwT8i3+ES4CTAMw+oM0MzbB8L+mGYLw60YmxiRLjXhLdNy2DrCjlbTQrwMlR6MQJGoiZF4Eyv/wDDME2MzzwCrj/gQLxHQsi3OTRnofB8jWCGD1ojBcR8GuiYHoOc+hmGfOWjojPsQwHm/Rh2jJ0YADawRPHDcBL+8pyMp7hvWBC0N+oSui4GGgUJKa8jIfdNAPzskgwiGLiyE0UHFOD2opjrzauHZ99VpRr/cpPBxmxSvoh9a+d1F9XhRR15t4yo52yApOQWRENgDMToTUSu9iLHfmWDoFDdyoGOMPTlsEOZmICh1B+0CEbFBQSCnHRrBnDTBOlgR4mV6DJadiqcGTQkM0O0LWYUT+eb5wm/MfbwvwaPKIWbb7QtbSRayJtm09iRd2YeR6lGDRwC/jmvc1YtNALvqRbTSvJbCkvAVIAzPhwKukQdz6IqAlre6tZbeKBLFby8wrMotNSnYbyo3d1kzxThfM0War5limq2ZIs/XTDHP10wmxmDNRDCboC2E0fRKOJ1ezUEhbublZa7TFyPeQKHTRShNV3+miWdWE4/7THywfkxuvn5M0+ZpIrik6ym0C2HUwFOYNnBTnYP1o5UJ8iYRsO8mgmTYFvisYgTiPgbPp4KU51MBu9lUwDCfCtjPpwJTjkF/5TDvrxxn/dVCGPU2TtPeZipjfrYWgtavISTXq9yyuZCq1bwspLqNs13WwNkyDQy0LndtnD5eLmJmP++wGecdNodZh81x3mEzzTusiTFYamSedbbM884mM4hpbxvsiVHymAhDad60jMECUvZH5odVVmFmx3UUwlJomK0hTYUO5iRweT4pyVbVtEJNiCH7MiGGnQ3mZ0q2Tgdzm5WZ0AVd7vLOdzMTWBtKo2kFIM3nFQCeTSxgbisNZhawNpZGU4styajjWVtLw45nbUMMOp7HG3iNn1++txVyC6/xcfWaHPteY20wyRp10pXmsNmfpysMMwREHd2cuuccTAy/jox3oXvWAaxNkahGRtvTFvwWKdT9vcvQlwL/qRSwOr/fbIe8SZ/AeAMMN42BevTCY+zbhrlBhLpTBQFwH0bQxXcI4RYYaSeGOq2seNBeDN0vk2A035e9GHFdAYrg5jFwL0ZYMSh0MUKa9VpbCvU4IMNbrC2mISnsnIC45gTq5wRrlym60ECi2xwRus4JNoaPisHUx7DK07huP1K4BUbuYYzqFJ0zdGpN0YPmWXE97vclWdtmvmFQ2saft2Cw5mrizbnMN2Fk1iLZ+bwLI7FzWmgH6GKYm0USCDUxSCDhW6AA7OtPRtVJJtqJoWdmBWPf+HIGPaeYY39siG6iV7qBXq3VIFq9N21OsF6tegKZVUwELWMkVXSPdYC5YcJ6VhB4s1NxfRj5L6KQerDwIfRF8f/2RIUMqp6Xgc2h2mvFWttQMl9gnTr0l6QtKWA9teMd96UwAyu5tQjZbCGNHzSPQXehYvSGGEb2jzFrkRppe075j6HN/3hoY1x7s53DXJ9q5VuchfoLCvN6djuj34myzi/Lkar9sowdzLKOjLhmrwlXzfqrE9y2HDc42xWjBiMZ4v7BZfPLCA0AXAqZC4j3cnn/6eH58qOW8l1KWU30UPaShPpKsdJQaayUKk2VcqX5TNFVWvGw4mHFw4qHFQ8rHlY8rHhY8YIr35oIhUp9pVgWoIWGSmM5EieUKi0f4YhpBK40lz224yG6SqFSf34+Yr0OlRY8CeuRKk0lvgrlSvOZEpQwJ1Tak7SjUGmstHzqIzGEUqXSvhRalM80Ff2X2VKCxvjGYGNCY2JjqDGpMdyYXBluyNyQuSFzQ+aGzHHJ7cJQYwpyKV2YG1OQy3JsXmxGOp0Lcply5oKMoqZckMt45NCYuExGhaHGpGWGKAw3Ji/zveNBdpGWOVfhQDmvHCpX4EtIlD0O5Ui5pFx5RVkwleXuxkF5R/lQAQCU88phLYFg+dTrzC3vKB9zLR98nbnyjnIoBMqHXlDmeFA+6Dpzi1uVQxJQHGtZcoHiWpXDpcYoXFCuvIOXtqRcUo6VK+8obg7F1SoHynnllncUSXF5R+kHRuVIudSkwuUdRWbMjQtOOVBO+xFQuaCcviMs7yiZ9+f988P9x8dTiTglKL0+fWoBSC5f/vve/mnf3X1//vbp9Pn1+VSC1ebjO/l9JyvXHkowg/VWPvpQbnm9JTWIz+UWrrfSEX25Ff7EWr66k0ffyXgnen88/y2KZAEpsfN/",
+      "debug_symbols": "tVvbbts8DH6XXOdCFCWK6qsMw9Bt2VCg6IauHfBj2Lv/lCPRTgZxqpXdhLRjfaYonnTwr8Pn08fXrx8enr58+3G4e/fr8PH54fHx4euHx2+f7l8evj3J3V8HV34gHO4Afh8PsFyRXDm58u0qyD/pTPhwF4Xkwx3JA9Ka5EFsD6bzX1nuhQbs5SKWC5an4XhgOBNBh9/yXxPnw8vz6VSe28gnUn+/fz49vRzunl4fH4+Hn/ePr8tDP77fPy305f5Z/nXHw+nps1AB/PLweCrc7+Pa2vWbInmqrZESKgD6PArhc8IG4SAqBDCOQrAPFYEDrwDpoj322xO1TlCKO9on13qQwO1q71t7332/0f8MsbbPHva0j9zap9xrz/32AC60HghP20EcNwPamIHfSDFsjOAAmhSOaCPEsBQck5oSYVohIFxAgDcwctNFxrBHCO+hqcL7tEJgvPQICDfAiIY+KTcMSNHAoD5GoFQhQvYbhDDcE/ItPhFuAgzTsDoDNPP2gbA/ptnCcCvGJkakyzDnLdNy2DrCjlbTQrzCACNQJGpiJN7Eyj8wDPPE2MwzwOojPl66mUfLtjg3ZaDzfYxghQxaIwbHfRjomhyAnvsYhn3moKEz7kMA5/0adYyeGAE0sEbwwHET/PKejqS4b1gTtDToE7ouBhoGCimtISP3TQP97JAMIhi6sBBGBxXj9KCa6syrhWffV6cZ/XKTwsdtUryKfmjldxfV40UdebUNym8ASckpiITAHojRmYha6UWM/c4EQ6e4kQMdY+zJYYMwNwNBqTtoFwgAgoJATjs0gjlpgnWwIkS4FMOyU/HUoCmBAbp9IatwIt88X/iNuY/3JXhUOcRsu31hK8nGZu0sBrfm6cuKJRipHjV4BPDruMZdvdgEsKteRCvNayksCV8Bgh8WAdfIgzl0RUDLW91aS6fVJMROLzGsyi3pWPhN5QaXYxHjfM0Uab5mimm2Zoo8XzPFPF8zmRiDNRPBbIK2EEbTK+F0ejUHhbiZl5e5Tl+MeAOFThehNF39mSaeWU087jPxwfoxufn6MU2bp4ngkq6n0C6EUQNPYdrATXUO1o9WJsibRMC+mwiSYVvgs4oRiPsYPJ8KUp5PBexmUwHDfCpgP58KTDkG/ZXDvL9ynPVXC2HU2zhNe5upjPnZWgjQIEJIrle5ZXMhVat5WUhdIWTKcolhmQYGWpe7Nk5PlzVo9vMOm3HeYXOYddgc5x0207zDmhiDpUbmWWfLPO9sMoOY9rbBnhglj4kwlOZNyxgsIGV/ZH5YZRVmdlxHISyFhtka0lToYE4Cl+eTkmxVTSvUhBiyLxNi2NlgfqZk63Qwt1mZCV3Q5S6/iaPXmQmsDaXRtAKQ5vMKAM8mFjC3lQYzC1gbS6OpxZZk1PGsraVhx7O2IQYdz+MNvMbPL9/bCrmF1/i4ek2Ofa+xNphkjTrpSnPY7M/TFYYZAqKObk7dcw4mhl9HxrvQPesA1qZIVCOj7WkLfosU6v7eZehLgf9UClid32+2Q96kT2C8AYabxkA9euEx9m3D3CBC3amCALgPI+jiO4RwC4y0E0OdVlY8aC+G7pdJMJrvy16MuK4ARXDzGLgXI6wYFLoYIc16rS2FehyQ4S3WFtOQFHZOQFxzAvVzgrXLFF1oINFtjghd5wQbw0fFYOpjWOVpXLcfKdwCI/cwRnWKzhk6taboQfOsuB73+5KsbTPfMCht489bMFhzNfHmXOabMDJrkex83oWR2DkttAN0MczNIgmEmhgkkPAtUAD29Sej6iQT7cTQM7OCsW98OYOeU8yxPzZEN9Er3UCv1moQrd6bNidYr1Y9gcwqJoKWMZIqusc6wNwwYT0rCLzZqbg+jPwXUUg9WPgQ+qL4f3uiQgZVz8vA5lDttWKtbSiZL7BOHfpL0pYUsJ7a8Y77UpiBldxahGy2kMYPmsegu1AxekMMI/vHmLVIjbQ9p/zH0OZ/PLQxrr3ZzmGuT7XyLc5C/QWFeT27ndHvRFnnl+VI1X5Zxg5mWUdGXLPXhKtmffZvkOMGZ7ti1GAkQ9w/uGx+GaEBgNFdQbyXy/tPD8+XH7WU71LKaqKH0mWhvlKsNFQaK6VKU6VcaT5TdJVWPKx4WPGw4mHFw4qHFQ8rHla84Mo+lFCo1FeKZQFaaKg0liNxQqnS8hGOmEbgSnPZYzseoqsUKvXn5yPW61BpwZOwHqnSVOKrUK40nylBCXNCpT1JOwqVxkrLpz4SQyhVKu1LoUX5TFPRf5ktJWiMbww2JjQmNoYakxrDjcmV4YbMDZkbMjdkbsgcFysRhhpTkEvpwtyYglyWY/NiM9LpXJDLlDMXZBQ15YJcxiOHxsRlMioMNSYtM0RhuDF5me8dD7KLtMy5CgfKeeVQuQJfQqLscShHyiXlyivKgqksdzcOyjvKhwoAoJxXDmsJBMunXmdueUf5mGv54OvMlXeUQyFQPvSCMseD8kHXmVvcqhySgOJYy5ILFNeqXHlHCVxQ3Ktycak7CkfKJeVYufKO4uZQXK1yoJxXbnlHkRSXd5R+YFSOlEtNKlzeUWTG3LjglAPltB8BlQvK6TvC8o6SeX/ePz/cf3w8lYhTgtLr06cWgOTy5b/v7Z/23d3352+fTp9fn08lWG0+vpPfd7Jy7aEEM1hv5aMP5ZbXW1KD+Fxu4XorHdGXW+FPrOWrO3n0nYx3ovfH89+iSBaQEjv/Bw==",
       "verification_key": "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA0AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAOQAAAAAAAAAAAAAAAAAAAA17g3XUB04hzuBpNktctc2nMAAAAAAAAAAAAAAAAAAAAAADAWazvUrHCcPLxk/VZ24gAAAAAAAAAAAAAAAAAAAMm/MBAdfc4BOZaeUdJ6xI1jAAAAAAAAAAAAAAAAAAAAAAAepmcV4iw30YFKtJWcoCoAAAAAAAAAAAAAAAAAAADVObxjZ7JDoS88IjG8RccxowAAAAAAAAAAAAAAAAAAAAAABIsqHa/2pva1b9XAV1dbAAAAAAAAAAAAAAAAAAAAY+5+sDs8iJGzVPkfVKBU9tIAAAAAAAAAAAAAAAAAAAAAAAqZEQAiANbFExUgR7ouWgAAAAAAAAAAAAAAAAAAAAp8mU0BvTHK+d+cIxuXax7nAAAAAAAAAAAAAAAAAAAAAAAgoSvAauJQCBLxoabyEx0AAAAAAAAAAAAAAAAAAADkAPqwOqNWt4W6g2DTymuoJAAAAAAAAAAAAAAAAAAAAAAAAd7iQrPk+vWY9BSCJD3tAAAAAAAAAAAAAAAAAAAA0AqPBFVByKKaceseMgFr3OQAAAAAAAAAAAAAAAAAAAAAACyNa2/9OTfwo7igQeDNagAAAAAAAAAAAAAAAAAAAKlx8+No6vek5MBBez4IBgkuAAAAAAAAAAAAAAAAAAAAAAADEie62c+V8KwXjWkrLIAAAAAAAAAAAAAAAAAAAADU+JT7OipVOu187ZS+Sk3yiAAAAAAAAAAAAAAAAAAAAAAAMEDABn2T99cJqaXISfITAAAAAAAAAAAAAAAAAAAAQZIox3XBmObJ5VT4Bi/3KgUAAAAAAAAAAAAAAAAAAAAAABTwigoKcZ6Fn7f9iH1LzgAAAAAAAAAAAAAAAAAAALtVndAhGQ/yfZ2Rmb/HsL6XAAAAAAAAAAAAAAAAAAAAAAAISbLRo6vWZiLkVvOnplEAAAAAAAAAAAAAAAAAAAAJ/9Gv1lEtdI/dQUG8dUToTwAAAAAAAAAAAAAAAAAAAAAAB7wK8gr2lwcyst5DlMcoAAAAAAAAAAAAAAAAAAAAJzF9LwqADNbKcfUoT8KtTa8AAAAAAAAAAAAAAAAAAAAAAA518y3hD5iLVkztpJIXywAAAAAAAAAAAAAAAAAAAB5J8PjTkTM7ZuCKjl4o1N0dAAAAAAAAAAAAAAAAAAAAAAAGAYYZQRXqMgE23QeNvXEAAAAAAAAAAAAAAAAAAACDqQDTFOp4DIDArZuFIzoM8wAAAAAAAAAAAAAAAAAAAAAACWWBWtbJb0b3DJB/sUm/AAAAAAAAAAAAAAAAAAAAzddxH9m3Wxos0sgmUx2zSUoAAAAAAAAAAAAAAAAAAAAAACslai25UE7q+UTCKPoK+AAAAAAAAAAAAAAAAAAAAHLfKW3ueQwpdjiSlUj85IRSAAAAAAAAAAAAAAAAAAAAAAAYDXwKlQEooG3s8YU30lkAAAAAAAAAAAAAAAAAAAAXcjtlfR5N+9Eyyojv59xVMwAAAAAAAAAAAAAAAAAAAAAAKFS1r0nqhY5pp8Jj+KK5AAAAAAAAAAAAAAAAAAAAVYeHlvSq25EaKSyNSEMZ3UoAAAAAAAAAAAAAAAAAAAAAABPts1J8B9+M0iTlOq2yowAAAAAAAAAAAAAAAAAAAI7mJv7vD2afOrSrE1BWb8agAAAAAAAAAAAAAAAAAAAAAAAeeN501A1BYFUURfXFE7cAAAAAAAAAAAAAAAAAAADuIPKm4uZe5p9bXnIXMxd3HgAAAAAAAAAAAAAAAAAAAAAAFkRlMv+ZrsJYIAsOh6u1AAAAAAAAAAAAAAAAAAAASamE5pgmbewW7UUD6JBGCIwAAAAAAAAAAAAAAAAAAAAAABc6wqaSLD3DJ8v80KJYjgAAAAAAAAAAAAAAAAAAANVTDHviC37F5O6vaIy5Sz8DAAAAAAAAAAAAAAAAAAAAAAAob20OvTMuwa+5Yfy6/wMAAAAAAAAAAAAAAAAAAAAFoCdctbRl+NNHed/XyWUXhAAAAAAAAAAAAAAAAAAAAAAADzdsErdA/OxqXlRgcdCNAAAAAAAAAAAAAAAAAAAAtHrdKqLhA2814/UdmFKfTacAAAAAAAAAAAAAAAAAAAAAACkm1ggl/1GbLk7OKK+JmAAAAAAAAAAAAAAAAAAAANy51zMtu9/oAGA7wapWr4yeAAAAAAAAAAAAAAAAAAAAAAAEr+0F1XDaTmBwRnnCYyIAAAAAAAAAAAAAAAAAAACilbUqiAzTtdSZEUdKD9+w7wAAAAAAAAAAAAAAAAAAAAAAIk335lOgk/z3xDjRyB5SAAAAAAAAAAAAAAAAAAAAefxSPuDV3dHBZmYe4Ob47SwAAAAAAAAAAAAAAAAAAAAAACJMwcryVkgVgpNQ/TWZkwAAAAAAAAAAAAAAAAAAAIGEs+xiWY9RDRtw6pxnDvV2AAAAAAAAAAAAAAAAAAAAAAAXwIp470s3dXQY8jmLSikAAAAAAAAAAAAAAAAAAADahyugl7X5OzFBBMoXLHu7+gAAAAAAAAAAAAAAAAAAAAAAHr3jYyR74i1QYd62oFaVAAAAAAAAAAAAAAAAAAAA1cdv3h4y40QE5qJ08Tuf8YoAAAAAAAAAAAAAAAAAAAAAACo3gtOF3gdgKeWKBt4augAAAAAAAAAAAAAAAAAAALkDYQ9FnF6uPN8t0/VfA/RFAAAAAAAAAAAAAAAAAAAAAAAbZrImKr9OUEnWH3KkLZUAAAAAAAAAAAAAAAAAAABMxkKtEq5yFXtCaMB2bJVpiwAAAAAAAAAAAAAAAAAAAAAABxwQ2sSv5P9KYExpGmfbAAAAAAAAAAAAAAAAAAAAzG/KUKjzDycg6BRl93fuI08AAAAAAAAAAAAAAAAAAAAAACAVmbf0SUAkIRxPdEtBhgAAAAAAAAAAAAAAAAAAADYvMijsCfcJ8cUgCUNT1jlbAAAAAAAAAAAAAAAAAAAAAAAa3IQoMwv+DF0W3vTzg7QAAAAAAAAAAAAAAAAAAAAL/PgpGPa2KpX7lCWelXs+wwAAAAAAAAAAAAAAAAAAAAAAFcKuVJvkxuzxGeOz1Pz+AAAAAAAAAAAAAAAAAAAAsFroaIyGsX76YGy3AStNYxIAAAAAAAAAAAAAAAAAAAAAACK4EuJRkQu0W5osyE15OgAAAAAAAAAAAAAAAAAAANE7Prqz0iZeLaHIJ1I/X4z7AAAAAAAAAAAAAAAAAAAAAAAjdaXtsH7jvmDF3jTHBvYAAAAAAAAAAAAAAAAAAABPZtUv2HtVACVB/jizN0/GygAAAAAAAAAAAAAAAAAAAAAAIVsZ4ZyaCs/uGhg02bbmAAAAAAAAAAAAAAAAAAAA1+AXZAraxzZrl0Jf3loly1wAAAAAAAAAAAAAAAAAAAAAAB8ef6Eic/cYKBnyppzMUwAAAAAAAAAAAAAAAAAAAEELFnZA2NBbzJ4+bxraFWbMAAAAAAAAAAAAAAAAAAAAAAAG1pGHW0uqhK6EH5nYpk0AAAAAAAAAAAAAAAAAAABD+fzMSXmY0rBxbQwe829WHAAAAAAAAAAAAAAAAAAAAAAACai0i1YJJdHfTQ7zjMDJAAAAAAAAAAAAAAAAAAAAfvbDGM+Xi7dEdgLeoIgRpQ0AAAAAAAAAAAAAAAAAAAAAAB0leTIJ9mRwElya0bITNAAAAAAAAAAAAAAAAAAAAK/X9zL9qz/R16GyO6aRWN7HAAAAAAAAAAAAAAAAAAAAAAAHYMz+oel5a3Mx4/gY/1oAAAAAAAAAAAAAAAAAAADOj8XcoTuxiO5OhJdZrrYyPgAAAAAAAAAAAAAAAAAAAAAAL9qgFEF6SMI5oORkXWWeAAAAAAAAAAAAAAAAAAAAN0uoYl6UdfYs3kCtBfDGyWcAAAAAAAAAAAAAAAAAAAAAACA+1AZb9aYSWW/phQ//dAAAAAAAAAAAAAAAAAAAAJW12Le0pjsF32UrDRDvFG0mAAAAAAAAAAAAAAAAAAAAAAAJnjvVoKAKt/4YBAEFubMAAAAAAAAAAAAAAAAAAAAhKa86Y39aYioyRA+GDR4qfwAAAAAAAAAAAAAAAAAAAAAAABW40lFdduLM7Jnc0ZRZAAAAAAAAAAAAAAAAAAAAIiuIgQjcJdGqRQ4LS8ISw34AAAAAAAAAAAAAAAAAAAAAABuRdReSC609i8AclZUJKgAAAAAAAAAAAAAAAAAAAEghQcfr5CAAodWMy3Q4H20ZAAAAAAAAAAAAAAAAAAAAAAAwXomSsUju2yLm6ZIHeoQAAAAAAAAAAAAAAAAAAAA47Y2iN1GGtRjHNFxgsRNLLQAAAAAAAAAAAAAAAAAAAAAABh9kSXmW6JFXIlAenjZ5AAAAAAAAAAAAAAAAAAAAKtPXy1l5LhHA0mkfMX/VDm4AAAAAAAAAAAAAAAAAAAAAABuE04M5Mh9AXrr2ovgwhAAAAAAAAAAAAAAAAAAAACjt0afkbIQNnJQ/30VSHGTOAAAAAAAAAAAAAAAAAAAAAAAEPQY7Ewrfs3NCr0XQFVoAAAAAAAAAAAAAAAAAAACTMJUq50xXPRaG2ctKAHM4VAAAAAAAAAAAAAAAAAAAAAAAJhUixAiTMGRq/5ZzYZSUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAjZjkWYz1+NwMbDU0PvtRefQAAAAAAAAAAAAAAAAAAAAAAF6ndqlr015rzRDTJa4kbAAAAAAAAAAAAAAAAAAAAG+S3+qDqoZFf1GCshtUDh5YAAAAAAAAAAAAAAAAAAAAAABWKcUFWvFWZFgFRoYPtDAAAAAAAAAAAAAAAAAAAAGvMegX/lalrKJQkxfczZw2WAAAAAAAAAAAAAAAAAAAAAAAAxDcm91tv2g3iLODg36sAAAAAAAAAAAAAAAAAAAAdCgnXF47JO614WPluZPC0jQAAAAAAAAAAAAAAAAAAAAAAL5tuC04sAZaN5cMkgqp9AAAAAAAAAAAAAAAAAAAAFLmaKhz1vbFNGPy31tW7G0MAAAAAAAAAAAAAAAAAAAAAABibwBFKqYLGRXSxHbsAPgAAAAAAAAAAAAAAAAAAAIFYESpGMQpiuEn23VYsLIaUAAAAAAAAAAAAAAAAAAAAAAASkF6WwsjbCGXWk491oyQ="
     },
     {
@@ -2074,7 +2074,7 @@
         }
       },
       "bytecode": "JwACBAEoAAABBIBMJwAABEwnAgIEAScCAwQAHwoAAgADAEscAEtLBS0ISwElAAAARiUAAACRJwIBBEwnAgIEADsOAAIAASgAAEMFAlgsAABEADBkTnLhMaApuFBFtoGBWF0oM+hIeblwkUPh9ZPwAAAAJwBFBAMnAEYBACcARwQAJwBIAQEnAEkEAScASgABJiUAAAg3HgIAAwAeAgAEAB4CAAUBCiIFRAYWCgYHHAoHCAAEKggFBwoiBkYFJAIABQAAAM4nAggEADwGCAEzKgAHAAQABSQCAAUAAADjJQAACF0MIgFDBAoiBEYFJAIABQAAAPolAAAIbycCBAAALQgBBScCBgQEAAgBBgEnAwUEAQAiBQIGLQoGCC0OBAgAIggCCC0OBAgAIggCCC0OBAgrAgAGAAAAAAAAAAACAAAAAAAAAAAtCAEIJwIJBAUACAEJAScDCAQBACIIAgktCgkKLQ4ECgAiCgIKLQ4ECgAiCgIKLQ4ECgAiCgIKLQ4GCi0IAQYAAAECAS0OBQYtCAEFAAABAgEtDggFLQgBCAAAAQIBLQxHCC0IAQkAAAECAS0MRgknAgoECy0IAAstCgYMLQoFDS0KCA4tCgkPLQhKEAAIAAoAJQAACIEtAgAAJwIKBAstCAALLQoGDC0KBQ0tCggOLQoJDy0KBxAACAAKACUAAAiBLQIAACcCCgQLLQgACy0KBgwtCgUNLQoIDi0KCQ8ACAAKACUAAAmALQIAAC0KDAcKKgcEBQoiBUYGJAIABgAAAk0lAAAJ7C8KAAcABRwKBQgEHAoIBgACKgUGCCwCAAUALV4Ji4K6N7Q7maExYRj9INQvUWbJ6fE/teplqW0eCm0EKggFBhwKBgkEHAoJCAACKgYICQQqCQUGHAoGCgEcCgoJABwKCQoBAioGCQssAgAGADAz6iRuUG6Jjpf1cMr/1wTLC7RgMT+3ILKeE55cEAABBCoLBgwcCgwNBBwKDQsAAioMCw0EKg0FDBwKDA0BHAoNBQAcCgUNAQIqDAUOBCoOBgwcCgwOBBwKDgYAHAoGDAUWCg0GHAoFDgUcCgYFBQQqDgwGHAoLDAUWCgoLHAoJDwUcCgsJBQQqDwwLHAoIDAUtCAEIAAABAgEtDg0ILQgBDQAAAQIBLQ4GDS0IARAAAAECAS0OChAtCAEKAAABAgEtDgsKLQgBEQAAAQIBLQ4MER4CABIGDCoSDBMpAgAMBQABUYAkAgATAAADwyMAAAOrBCoPCwMEKgkMBQAqAwUGLQoGAiMAAAPbBCoOBgMEKgUMBgAqAwYFLQoFAiMAAAPbDCoCAQUkAgAFAAAEDSMAAAPtAioCAQUOKgECBiQCAAYAAAQEJQAACf4tCgUDIwAABBsnAgUFAC0KBQMjAAAEGwAqEgMGDioSBgkkAgAJAAAEMiUAAAoQLQxICC0OAg0tDEgQLQ4BCi0OBhEtCAEBJwICBAQACAECAScDAQQBACIBAgItCgIDLQ4EAwAiAwIDLQ4EAwAiAwIDLQ4EAy0IAQIAAAECAS0OAQItCEcFIwAABI4MIgVFASQCAAEAAAfxIwAABKAtCwIDLQgBAicCBQQEAAgBBQEnAwIEAQAiAgIFLQoFBi0OBAYAIgYCBi0OBAYAIgYCBi0OBAYAIgNJBi0LBgUnAgYEAgAqAwYLLQsLCQAiA0ULLQsLBhwKBQsEHAoLAwAtCwgFLQsNCC0LEAstCwoMLQsRChwKCg0AJwIKAAInAg4AICcCEAQRLQgAES0KChItCg4TAAgAEAAlAAAKIi0CAAAtChIPBCoNDw4AKgMODRwKCwMAJwILAEAnAg8EEC0IABAtCgoRLQoLEgAIAA8AJQAACiItAgAALQoRDgQqAw4LACoNCwMcCgwLACcCDABIJwIOBA8tCAAPLQoKEC0KDBEACAAOACUAAAoiLQIAAC0KEA0EKgsNDAAqAwwLHAoFAwAnAgUAaCcCDQQOLQgADi0KCg8tCgUQAAgADQAlAAAKIi0CAAAtCg8MBCoDDAUAKgsFAxwKCAUAJwIIAHAnAgwEDS0IAA0tCgoOLQoIDwAIAAwAJQAACiItAgAALQoOCwQqBQsIACoDCAUtCwIDACIDAgMtDgMCKwIAAwAAAAAAAAAAAwAAAAAAAAAALQgBCCcCCgQFAAgBCgEnAwgEAQAiCAIKLQoKCy0OBAsAIgsCCy0OBAsAIgsCCy0OBAsAIgsCCy0OAwstCAEDAAABAgEtDgIDLQgBAgAAAQIBLQ4IAi0IAQQAAAECAS0MRwQtCAEIAAABAgEtDEYIJwIKBAstCAALLQoDDC0KAg0tCgQOLQoIDy0KBRAACAAKACUAAAiBLQIAACcCCgQLLQgACy0KAwwtCgINLQoEDi0KCA8tCgkQAAgACgAlAAAIgS0CAAAnAgoECy0IAAstCgMMLQoCDS0KBA4tCggPLQoGEAAIAAoAJQAACIEtAgAAJwILBAwtCAAMLQoDDS0KAg4tCgQPLQoIEAAIAAsAJQAACYAtAgAALQoNCi0IAQInAgMEBQAIAQMBJwMCBAEAIgICAy0KAwQtDgUEACIEAgQtDgkEACIEAgQtDgYEACIEAgQtDgoEJwIDBAQtCEcBIwAAB7IMKgEDBCQCAAQAAAfFIwAAB8QmHAoBBAAAKgcEBQAiAgIGACoGAQgtCwgEMAoABAAFACIBSQQtCgQBIwAAB7IcCgUBAAAqBwEDLwoAAwABLQsCAy0CAwMnAAQEBCUAAAsPLQgFBgAiBgIJACoJBQstDgELLQ4GAgAiBUkBLQoBBSMAAASOKAAABAR4TAwAAAQDJAAAAwAACFwqAQABBdrF9da0SjJtPAQCASYqAQABBdUSfSnC0ujtPAQCASYqAQABBV5tPy7czYcJPAQCASYlAAAINy0LBAYKIgZGByQCAAcAAAigJwIIBAA8BggBLQsDBgoiBkUHJAIABwAACRwjAAAIti0LAQctCwIIDCIGRQkkAgAJAAAI0CUAAAtuLQIHAycABAQEJQAACw8tCAUJACIJAgoAKgoGCy0OBQsAIgZJBQ4qBgUHJAIABwAACQclAAAKEC0OCQEtDggCLQ4FAy0MRgQjAAAJfycCBgQHLQgABy0KAQgtCgIJLQoDCi0KBAsACAAGACUAAAuALQIAAC0LAQYtCwIHLQsECC0CBgMnAAQEBCUAAAsPLQgFCQAiCUkKLQ4FCi0OCQEtDgcCLQxJAy0OCAQjAAAJfyYlAAAINy0LBAUKIgVGBiQCAAYAAAmfJwIHBAA8BgcBJwIFBAYtCAAGLQoBBy0KAggtCgMJLQoECgAIAAUAJQAAC4AtAgAALQsBBS0LAgYtCwMHLQ4FAS0OBgItDgcDLQxIBAAiBkkCLQsCASYqAQABBbq7IdeCMxhkPAQCASYqAQABBRu8ZdA/3OrcPAQCASYqAQABBdAH6/TLxmeQPAQCASYlAAAINy0IAQQAAAECAS0MSgQnAgYEAicCBwEBLQgBBScCCAQhAAgBCAEnAwUEAQAiBQIIJwIJBCBDA6oAAgAGAAkABwAILQIIAy0CCQQlAAAMfCcCAgQhJwIGBCAtCEkDIwAACogMKgMCByQCAAcAAAqfIwAACpotCwQBJi0LBAcEKgcHCAIqBgMHDioDBgkkAgAJAAAKvyUAAAn+DCoHBgkkAgAJAAAK0SUAAAtuACIFAgoAKgoHCy0LCwkcCgkHAAQqCAEJBCoHCQoCKEoHCQQqCQgHACoKBwgtDggEACIDSQctCgcDIwAACogtAQMGCgAGAgckAAAHAAALJSMAAAsuLQADBSMAAAttLQABBQAAAQQBAAADBAktAAMKLQAFCwoACgkMJAAADAAAC2gtAQoILQQICwAACgIKAAALAgsjAAALRCcBBQQBJioBAAEF5AhQRQK1jB88BAIBJiUAAAg3LQhHBSMAAAuODCIFRQYkAgAGAAAL9iMAAAugLQsCBS0LBQYAIgYCBi0OBgUtCAEGJwIHBAUACAEHAScDBgQBACIFAgcnAggEBAAiBgIJPw8ABwAJLQsBBS0LAwctCwQILQ4FAS0OBgItDgcDLQ4IBCYtCwMGDCoFBgckAgAHAAAMDCMAAAxuLQsCBwAiBwIJACoJBQotCwoILQsBCQAiCQILACoLBQwtCwwKACoICgstCwQILQIHAycABAQFJQAACw8tCAUKACIKAgwAKgwFDS0OCw0tDgkBLQ4KAi0OBgMtDggEIwAADG4AIgVJBi0KBgUjAAALjicABgQCBgAEBgUtAAQIJwAJBAAOAAUJCiQAAAoAAAzPAgAIAggAAAMJCy0BCwYAAAMICy0BCwcAAAMJCy0EBwsAAAMICy0EBgsAAAkCCSMAAAyPJg==",
-      "debug_symbols": "tZtbbl23Dobn4uc86EZR7FSKokhTtwhgOIGbHOCgyNxLUiK53WKptpy+xN+mt/5FStSFWvGfd7/e//L1958/Pv726Y+7H3788+6Xp48PDx9///nh04f3Xz5+emTrn3dJ/snAP+o7/gl3PyD/7Pw5ZwE2ZPkNJoO2foW0YIgFBGgB4YSSikFnGAxZvkwMpRjwl0tiqMXALA0WiH8FBcCAFvRmYBY0C5plVANcQMWgT6gpG8gj2NVa+oKaDOxXzSzNLGAWaAZjQa8GuACLgT1iZAMR7AK0gJrBmNCkVyfggpwNVvNWkkEzsOa1GkhzHoLWikFfoOEoNIOxoNuXu30Zs4FZhjXXcBRoAVWD9XRI2QAM1pchNwOzFG5ek8BYIGkzoS+Q0ZnQDOzLYM3BLN2aSzi1MEg4E8wiGT6B3ag8TEDsauNWPSUDsfB06Fks/OXecAHwI1oVwAXy0NYExMITpEtKtC6AC4ZZJGkbZ2aXpG38dCy0oLJjjQRogYQMSYAtwP6gjCAUAVrQzSJTBtgflCkDTUAs7A9KyBPEwm4gWSvJQ7GMVA3MksWCAmM6P2Saq0WmuUI1i6QfcBRD0q82gb4AsgEY0AJxfsJYgNZcuk5hWPNhzSkZWHNazUmimMDNO/cYZRbsYpGe77KgJRnd3oVkeBe5TZJykjjeUakbdbdJf0+SDl80jGTAF3lb8XsRt8CsNBZlcX2R27LbsttkEBZ1o5qdwEgmzqLm5CrgyjJVsAhJmmBVku9JX2VJ00W4SDeCRW7LbsvdSJatReBERpLui+RpJNSqExrJhFvkNhmFRd1INrWRlcBIlq4+lJrTMJLYFvVFVZaAAUqiInlQJUsWua24TdbkRcNIpsUiNGpuk5kxSVbmgUqirB7Idj1IiW2UhCS2RWEjI9kRF6GRxLbIbE3W5kWiIj3UJDYqSmKT0dfthpoSGFW3ybgtGkYS2yI0ArfJ7JkksREoibL0QdPYUEls0ge65SwKGxnJrrMIF4Hk5CK3yUa6SFSkT0Fi4xVAUY5DSXoBqlqLIji2sMoUMhyOEqIhOvawSnYu1DNX0nMZ6iOkQ2CoVT3Tk9dCcpRYeUWQ05uethYOxxJfKGGtYa1hlWEy7I6yzBmC4zw1TowHd3JEeUQaiug4SmB3pBQIgWSIqQYOx1wCXQxLDlR/9QCrQ7iwBQ7HGfzE7gjRDKIZkGMPaw8xDX4hOo4cGJ6NEKNoRt5spBIY1pwD3d9RUmALdM90RzaMZi2aNfdsRPBjBl8UybHXQHTEHAiB0WyE2AgrhdgMXquLlAO7Yw5rDmsJ6xz5ieQ4R37icGw1MB6sk3dVONoPsgbR9FeSi0jFSFGsWryk1ALDKhs1b26Kas2COgtLVRR3ShNUd+TMzqjf1ZpKN2T9qm5zSrKSLHKbdP6ibjTcJmm3iBZlnZJaH2WdkkVLN8qBZFhmdBOHo87DovWdTjM5YhfdwA2Ho0Y3UReWhfLgKp1SdGFZCI4YVi1KF5LjCOvQp0lnF82phW6tmkgTNZEWQiA5FlfQXZt3bEV0bDkQAskRamA06yHWw4ohhiGGITZUrCmiI5VAt+p+btgds49Qyy3QR6hpsT5xhin512aYXbE76rKwkBx1WaioOByxBHZH3eEWtsBoRiFGbtX93NDFIKfAFhjNSjQr0Wwm7VAER017qWs4JWvgcNS0l9KMER1LWPURE+UEbhjWFtYWVgir7i4LhyPGI0ibydRDjVjKQUZyq+av1IaMoiBVXUFdeRaGVX2YqD4sDKu6s1DvfyQntaA0DKtmqtSZjPoI0FsatXZFtepNjfavlIdFy8sZhRaYhmhIoKMpsZGmUVOrptHCFkiO+mCp0BlxIZ/mS2BYc1hzWEtYS1i1J+UugBEd58BOhEByhGgG0WwuCqSosVXBGdDEsQKqaQY00a15BjRRFZqgrnILw6pnBbmQYIRAcoVaA+MRLay6XU6EeDCEtedACIxHYIiNqfDt27s7u7X8+cvT/b1cWt5cY/Ll5uf3T/ePX+5+ePz68PDu7n/vH77ql/74/P5Rf355/8S/ZdH7x1/5Jwv+9vHhXujbu2idrpvy4kqrNa+d5AJcIT+TyNcSfFaTilE15NyGLoLP3SjXGpWvQGFpMGO+0tiFMrK5wQVtvgyl7XoDpAidGlx/3oRSn2nAd+iO/t92R0cwN7gsqa4A+ZnC2PQG15zVk2OMetUbtOkNXrq8NwixX0WS0647upwoV3f0etml+2DI06MRpKtg8i5Nm41K43NrdOnRmIxyNSZ5k6LYbUhuO7OVF7swssXQR2uXLmyyE4cPKVJplyOKm46svZkGMx0l+G0kI19FslMgsLTiErwcKHC5bj4gT/srhbJZPqFI3akSfFK7WbbobxqbvNRzxkztFGHwyfu5Qt0EEtOUi3cIjfp88Syb1Kzemy1HavJ5+bnCZu2UYswCKTe70T80+q4/bUPj0+6ZAtke0G964lVxlNhV682IvEoDsw8q7iLZ5Vbu4LmF5TK36nZ7H8W3M7o5IVA6mSU5Xc6zWndbgHvBLy7bpRd1k58AyWca3Czf/9DYjIqcRps5kgjgauGqu+09lVj9Er++vRTZLaHQwxO+X70W2XaJnzMAaFx3Ce121lh9Wo8E4Z36FRox8fnV56lGco3WzzTA04zL4kM/evL+6Dc77Cs1wDVgHGoMP/B0wjMNzH4exjZONWIhu9ngXqcRsSAd+jGyj+1o+VTD83TcTP7XaYzmGlTPNCj7yZxvdU81vD8IDucLxXyhw/nC341aZ5z1aW3J+oNfL57NuQo5+Xra0rXGbpuqLcextl6up7BdgygWsp7S5dm4b0umONsyY7rcHbbRYPde3Wy6fVcy1eK7VH3Wq/Rco+6KSPIZw+8PrjV2fgCgjy6mI42GPuv4jrefaQzfcbkiLZca23GJHbc2vN61+6Ye5jfQlmStF7jWoO9wGMJdpqac4zDEr5kORbw0F+5nIqWmOJbVS5F/6ZNy0yfXEw93lVRU2HWMm0Qbr9EgTxIq6Vpjc1DNen86z/6532j8LUlwc04dvphRgmuFsS30vcbGS4V9skPziZuuT/4j7RYhn3R8kVXOtocWWdrgetKNzQLCL03Mjw6UrjU2fsR6mtPNus6Xwc8l2nb9yL5+1OsT2V6j+Y1Bh3SocbOOQTvTgIahAYd+YIkUO/QD03CN3E/9yLFHpTf3B5Z8GEuNWJAONUbst3TsR8RC8Pb+oMNxGXF2GO0wP4ZfG/Ax4tgPz9PR85v7Y/Ry6AfaFRnX/of5QcX7lGo+9WOERn9zf1C9rrR3S3JOsdXyK9HLNTknePstbk79rde4OeHb73H1P6+97SJ3L/Gim9x9KC+8yt2LvPAud7vvx4bbe8HLfT/n7TVq7X4qLHXzOi7vj6d+jBl4fX74N1d8gJkhX7uyS1Z+8e51LnM9VEG/oWZucKpS0vdQ8dWEGfqpit9Cisrl7XDevT/gSrnVqJpHOyyr4hqBb7tPa7Oev4PIy+7d8+7FzIsv3tN2F45bALh9MfNShZy9VpW/ZrhcUrYS3d/s5AFHEtVXWMYzL8AnTeZ99Eyik0sMOgskuQTfQp5JxA5e4SiQl+4TOy969+7seBYIok36jFSOJCi6k8qRBHptiK2fCJDX2gRn/ZD8f53wgWlzfmj5v5zplGyKUTnrCJ/mhPDGnjwT4Lq2+RXOzUqTx4sVspdPfAlbrhRy25zCcokJWno58sIvkRnpSMH/FxKe+oDel3mkE4XiJ0lGPIuCQmG8VSEf+VB8dmKp6a1jcVM+vsaH+I8NBc6i8LPEP/LhJ/70/sPHp2d/2v5NtJ4+vv/l4X59/O3r44eb3375/2f7jf1p/OenTx/uf/36dC9K8ffx/M+PsnPCGD+9u8v8qfP06b3JJ/ll47NhK10+Zv2I/JF++iau/QU="
+      "debug_symbols": "tZvbbl03Dobfxde50Imi2FcpiiJN3cKA4QRuMsCgyLsPSYnk9hRLteX2Jv42vfUvkqKOK/7z7tf7X779/vPD02+f/7j74cc/7355fnh8fPj958fPnz5+ffj8xNY/75L8k4F/1A/8E+5+QP7Z+XPOAmzI8htMBm39CmnBEAsI0ALCCSUVg84wGLJ8mRhKMeAvl8RQi4FZGiwQ/woKgAEt6M3ALGgWNMuoBriAikGfUFM2kEewq7X0BTUZ2K+aWZpZwCzQDMaCXg1wARYDe8TIBiLYBWgBNYMxoUlWJ+CCnA1W81aSQTOw5rUaSHPugtaKQV+g4Sg0g7Gg25e7fRmzgVmGNddwFGgBVYP1dEjZAAzWlyE3A7MUbl6TwFggZTOhL5DemdAM7MtgzcEs3ZpLOLUwSDgTzCIVPoHdqNxNQOxq41Y9JQOx8HDoWSz85d5wAfAjWhXABfLQ1gTEwgOkS0m0LoALhlmkaBtXZpeibfx0LLSgsmONBGiBhAxJgC3A/qD0IBQBWtDNIkMG2B+UIQNNQCzsD0rIE8TCbiBZK6lDsYxUDcySxYICYzo/ZJirRYa5QjWLlB9wFEPKrzaBvgCyARjQAnF+wliA1lxSpzCs+bDmlAysOa3mJFFM4OadM0aZBbtYJPNdJrQkvdu7kHTvIrdJUU4SxzsqdaPuNsn3JEn4omEkHb7I24rfi7gFZqWxKIvri9yW3ZbdJp2wqBvV7ARGMnAWNSdXAVeWoYJFSMoEq5J8T3KVpUwX4SJdCBa5LbstdyOZthaBExlJuS+Sp5FQq05oJANukdukFxZ1I1nURlYCI5m6+lBqTsNIYlvUF1WZAgYoiYrUQZUqWeS24jaZkxcNIxkWi9CouU1GxiSZmQcqibJ6IMv1ICW2URKS2BaFjYxkRVyERhLbIrM1mZsXiYpkqElsVJTEJr2vyw01JTCqbpN+WzSMJLZFaARuk9EzSWIjUBJlyUHT2FBJbJIDXXIWhY2MZNVZhItAanKR22QhXSQqklOQ2HgGUJTtUJIsQFVrUQTHFlYZQobDUUI0RMceVqnOhbrnSrovQ32EJASGWtUz3XktJEeJlWcE2b3pbmvhcCzxhRLWGtYaVukmw+4o05whOM5d48R4cCdHlEekoYiOowR2R0qBEEiGmGrgcMwl0MWw5ED1Vzew2oULW+BwnMFP7I4QzSCaATn2sPYQ0+AXouPIgeHZCDGKZuTNRiqBYc050P0dJQW2QPdMV2TDaNaiWXPPRgQ/ZvBFkRx7DURHzIEQGM1GiI2wUojN4PV0kXJgd8xhzWEtYZ09P5EcZ89PHI6tBsaDdfCuE47mQeYgmv5KcRGpGCmKVQ8vKbXAsMpCzYubolqzoI7CUhXFndIE1R3ZszPqd/VMpQuyflWXOSWZSRa5TZK/qBsNt0nZLaJFWYekno+yDsmiRzfKgWRYZnQTh6OOw6LnOx1mssUuuoAbDkeNbqJOLAvlwVWSUnRiWQiOGFY9lC4kxxHWoU+TZBetqYVurVpIE7WQFkIgORZX0FWbV2xFdGw5EALJEWpgNOsh1sOKIYYhhiE2VKwpoiOVQLfqem7YHbP3UMst0Huo6WF94gxT6q/NMLtid9RpYSE56rRQUXE4YgnsjrrCLWyB0YxCjNyq67mhi0FOgS0wmpVoVqLZLNqhCI5a9nKu4ZKsgcNRy16OZozoWMKqj5goO3DDsLawtrBCWHV1WTgcMR5B2kyGHmrEchxkJLdq/crZkFEU5FRXUGeehWFVHyaqDwvDqu4s1PsfqUk9UBqGVStVzpmM+gjQWxq1dkW16k2N5leOh0WPlzMKPWAaoiGB9qbERlpGTa1aRgtbIDnqg+WEzogLeTdfAsOaw5rDWsJawqqZlLsARnScHTsRAskRohlEszkpkKLGVgVnQBPHCqimGdBEt+YZ0ERVaII6yy0Mq+4V5EKCEQLJFWoNjEe0sOpyORHiwRDWngMhMB6BITamwvfvH+7s1vLnr8/393JpeXONyZebXz4+3z99vfvh6dvj44e7/3x8/KZf+uPLxyf9+fXjM/+WRe+ffuWfLPjbw+O90PcP0TpdN+XJlVZrnjvJBXg/8EIiX0vwXk1OjKoh+zZ0EXzpRrnWqHwFCkuDGfOVxi6Ukc0NPtDmy1DaRqLp0Fvp4B14uFFfaMA/kI7+76ajI5gbfCyprgD5hcLYZANa7pYNPvj1q2zQJhs8dXk2CLFfRZLTLh1ddpQrHb1epnQfjNyCrWAg16tg8q5Mm/VK431rpPSoT0a56pO8KVHsdSncJrOVV7swssXQR2uXLmyqE4d3KVJplz2Km0TW3kyDmY4K/DaSka8i2SkQWFnxEbwcKPBx3XxAHvZXCmUzfULJVpe8U7uZtuhln5ZNXeo+Y5Z2ijB4u/1SoW4CiWHKh3cIjUovNTalWT2bPG+4Am9bXyps5k45jFkg5WY1+otG3+XTFjTe7Z4pyCXcrIqbTLwpjhKrar3pkTdpYEy+uItkV1u5g9cWlsvaqtvlfRRfzuhmh0BHoySny3FW624JcC/4xWW79KJu6hMg+UiDm+n7LxqbXpHdaDNHEgFcTVx1t7ynErNf4te3lyK7KRR6eML3q9ci25T4PgOAxnVKaLdpitmndbqZOt6iEQOfX32eaqTYrfQzDfAy42PxoR89eT76zQr7Rg1wDRiHGsP3w53wTAMz+iTUxqlGTGQ3C9zbNCIWpEM/Rva+HS2fanidDoBDjdFcg+qZBuXqZ512rOH5IDgcLxTjhQ7HC+/o46wzznJaW7J88OvFszFXISefT1u61tgtU7Xl2NbWy/kUtnMQxUTWU7rcG/ftkSn2tsy3J9n0hmiwe1Y3i27fHZlq8VWqvshqe6lRd4dI8hHD7w+uNXZ+AKD3LqYjjYY+6viOt59pDF9x+UVuudTY9kusuLXh9ardN+dhfgNtRdZ6gWsN+gc2Q7ir1JRzbIb4NdOhiB/NhfuZSKkptmX1UuRvclJucnI98HB3kooTdh3jptAGvEGDvEiopGuNzUY16/3p3PvnfqNB/6ex2acOn8wowbXC2B70/YyNlwr7YofmAzdd7/xH2k1CPuj4IqucLQ8tqrTB9aAbmwmEX5qYHx0oXWts/Ij5NKebeZ1fg72UaNv5I/v8Ua93ZHuN5jcGHdKhxs08Bu1MAxqGBhz6gSVK7NAPTMM1cj/1I8cald6dDyz5MJYasSAdaoxYb+nYj4iF4P35oMN+GbF3GO2wPoZfG/A24tgPr9PR87vzMXo59APtiozP/of1QcVzSjWf+jFCo787H1SvT9q7KTmnWGr5lejlnJwTvP8WN6f+3mvcnPD997j6n9fed5G7l3jVTe4+lFde5e5FXnmXu133Y8HtveDlup/z9hq1dt8Vlrp5HZf321Pfxgy83j/8nSvewcyQr13ZFSu/ePdzLnM9VEG/oWZucKpS0j+h4rMJM/RTFb+FFJXL2+G8e3/AJ+VW49Q82uGxKq4R+Lb79Gzmr2/fI/K6e/e8ezHz6ov3tF2F4xYAbl/MvFYhZz+ryl8zXE4pW4nub3bygCOJ6jMs45kX4IMm8zp6JtHJJQadBZJcgm8hzyRiBa9wFMhr14mdF717OjueBYJogz4jlSMJinRSOZJAPxti6ycC5GdtgrM8JP9fJ7xh2uwfWv43RzolG2JUzhLhw5wQ3pnJMwE+1za/wrmZafJ4tUL24xNfwpYrhdw2u7BcYoCWXo688EtkRjpSIN+hn/qAnss80olC8Z0kI55FQaEw3quQj3woPjqx1PTevrg5Pr7Fh/iPDQXOovC9xF/q4Sf+9PHTw/OLP23/LlrPDx9/ebxfH3/79vTp5rdf//vFfmN/Gv/l+fOn+1+/Pd+LUvx9PP/zo6ycMMZPH+4yf+o8fHpv8kl+2Xhv2EqXj1k/In+kn76La/8D"
     },
     {
       "name": "update",
@@ -2134,7 +2134,7 @@
         }
       },
       "bytecode": "JwACBAEoAAABBIBNJwAABE0nAgIEAScCAwQAHwoAAgADAEwtCEwBJQAAAEElAAAArycCAQRNJwICBAA7DgACAAEnAEMAAywAAEQAAAAAAA6S+filNOhY/Pd32iBuCLDGIOz53rIdE0eYE/YsAABFADBkTnLhMaApuFBFtoGBWF0oM+hIeblwkUPh9ZPwAAAAJwBGBAMnAEcBACcASAQAJwBJAQEnAEoEAScASwABJiUAAAh9HgIAAwAeAgAEAB4CAAUBCiIFRQYWCgYHHAoHCAAEKggFBwoiBkcFJAIABQAAAOwnAggEADwGCAEzKgAHAAQABSQCAAUAAAEBJQAACKMzIgABAEMABCQCAAQAAAEWJQAACLUnAgQAAC0IAQUnAgYEBAAIAQYBJwMFBAEAIgUCBi0KBggtDgQIACIIAggtDgQIACIIAggtDgQIKwIABgAAAAAAAAAAAgAAAAAAAAAALQgBCCcCCQQFAAgBCQEnAwgEAQAiCAIJLQoJCi0OBAoAIgoCCi0OBAoAIgoCCi0OBAoAIgoCCi0OBgotCAEGAAABAgEtDgUGLQgBBQAAAQIBLQ4IBS0IAQgAAAECAS0MSAgtCAEJAAABAgEtDEcJJwIKBAstCAALLQoGDC0KBQ0tCggOLQoJDy0ISxAACAAKACUAAAjHLQIAACcCCgQLLQgACy0KBgwtCgUNLQoIDi0KCQ8tCgcQAAgACgAlAAAIxy0CAAAnAgsEDC0IAAwtCgYNLQoFDi0KCA8tCgkQAAgACwAlAAAJxi0CAAAtCg0KCioKBAUKIgVHBiQCAAYAAAJpJQAACjItCAEFJwIGBAQACAEGAScDBQQBACIFAgYtCgYILQ4ECAAiCAIILQ4ECAAiCAIILQ4ECC0IAQYAAAECAS0OBQYtCEgCIwAAArEMIgJGAyQCAAMAAAg3IwAAAsMtCwYDLQgBBScCBgQEAAgBBgEnAwUEAQAiBQIGLQoGCC0OBAgAIggCCC0OBAgAIggCCC0OBAgAIgNKCC0LCAYnAggEAgAqAwgLLQsLCQAiA0YLLQsLCBwKBgsEHAoLAwAcCgMGBS0IAQMAAAECAS0OCQMtCAELAAABAgEtDgYLLwoACgAMHAoMDgQcCg4NAAIqDA0OLAIADAAtXgmLgro3tDuZoTFhGP0g1C9RZsnp8T+16mWpbR4KbQQqDgwNHAoNDwQcCg8OAAIqDQ4PBCoPDA0cCg0QARwKEA8AHAoPEAECKg0PESwCAA0AMDPqJG5QbomOl/Vwyv/XBMsLtGAxP7cgsp4TnlwQAAEEKhENEhwKEhMEHAoTEQACKhIREwQqEwwSHAoSEwEcChMMABwKDBMBAioSDBQEKhQNEhwKEhQEHAoUDQAcCg0SBRYKEw0cCgwTBRwKDRQFBCoTEg0cChESBRYKEBEcCg8QBRwKERUFBCoQEhEcCg4SBR4CABYGDCoWEhcpAgASBQABUYAkAgAXAAAEdyMAAARfBCoQERMEKhUSEAAqExASLQoSAiMAAASPBCoTDRAEKhQSEwAqEBMSLQoSAiMAAASPACoWAhIOKhYSEyQCABMAAASmJQAACkQMKhYGAhYKAgYcCgITABwKBgIABCoTCQYEKgIICQAqBgkCLQ4CAy0OEgscChIGACcCCAACJwIJACAnAhMEFC0IABQtCggVLQoJFgAIABMAJQAAClYtAgAALQoVEgQqDhIJACoGCQ4nAgYAQCcCEgQTLQgAEy0KCBQtCgYVAAgAEgAlAAAKVi0CAAAtChQJBCoPCQYAKg4GCRwKEQYAJwIOAEgnAhEEEi0IABItCggTLQoOFAAIABEAJQAAClYtAgAALQoTDwQqBg8OACoJDgYnAgkAaCcCDwQRLQgAES0KCBItCgkTAAgADwAlAAAKVi0CAAAtChIOBCoMDgkAKgYJDBwKDQYAJwIJAHAnAg4EES0IABEtCggSLQoJEwAIAA4AJQAAClYtAgAALQoSDQQqBg0IACoMCAYtCwUIACIIAggtDggFKwIACAAAAAAAAAAAAwAAAAAAAAAALQgBCScCDAQFAAgBDAEnAwkEAQAiCQIMLQoMDS0OBA0AIg0CDS0OBA0AIg0CDS0OBA0AIg0CDS0OCA0tCAEEAAABAgEtDgUELQgBBQAAAQIBLQ4JBS0IAQgAAAECAS0MSAgtCAEJAAABAgEtDEcJJwIMBBEtCAARLQoEEi0KBRMtCggULQoJFS0KBhYACAAMACUAAAjHLQIAACcCDAQRLQgAES0KBBItCgUTLQoIFC0KCRUtCgIWAAgADAAlAAAIxy0CAAAnAgwEES0IABEtCgQSLQoFEy0KCBQtCgkVLQoBFgAIAAwAJQAACMctAgAAJwINBBEtCAARLQoEEi0KBRMtCggULQoJFQAIAA0AJQAACcYtAgAALQoSDC0IAQQnAgUEBQAIAQUBJwMEBAEAIgQCBS0KBQgtDgYIACIIAggtDgIIACIIAggtDgEIACIIAggtDgwIJwICBAQtCEgQIwAAB2QMKhACBSQCAAUAAAgLIwAAB3YtCwMCLQsLAxwKAwQAJwIFBAUnAggEAwAqBQgGLQgBAwAIAQYBJwMDBAEAIgMCBi0OBQYAIgYCBi0OBQYnAgYEAwAqAwYFLQoFBi0MRAYAIgYCBi0OBwYAIgYCBi0OAgYAIgYCBi0OAQYAIgYCBi0OBAYnAgEEBQAiAwIFLQsFBS0KBQQnAgYEAwAqAwYCNw4ABAACJhwKEAUAACoKBQYAIgQCCAAqCBAJLQsJBTAKAAUABgAiEEoFLQoFECMAAAdkHAoCAwAAKgoDBS8KAAUAAy0LBgUtAgUDJwAEBAQlAAALQy0IBQgAIggCCQAqCQILLQ4DCy0OCAYAIgJKAy0KAwIjAAACsSgAAAQEeE0MAAAEAyQAAAMAAAiiKgEAAQXaxfXWtEoybTwEAgEmKgEAAQXVEn0pwtLo7TwEAgEmKgEAAQWuko9rqY6SjDwEAgEmJQAACH0tCwQGCiIGRwckAgAHAAAI5icCCAQAPAYIAS0LAwYKIgZGByQCAAcAAAliIwAACPwtCwEHLQsCCAwiBkYJJAIACQAACRYlAAALoi0CBwMnAAQEBCUAAAtDLQgFCQAiCQIKACoKBgstDgULACIGSgUOKgYFByQCAAcAAAlNJQAACkQtDgkBLQ4IAi0OBQMtDEcEIwAACcUnAgYEBy0IAActCgEILQoCCS0KAwotCgQLAAgABgAlAAALtC0CAAAtCwEGLQsCBy0LBAgtAgYDJwAEBAQlAAALQy0IBQkAIglKCi0OBQotDgkBLQ4HAi0MSgMtDggEIwAACcUmJQAACH0tCwQFCiIFRwYkAgAGAAAJ5ScCBwQAPAYHAScCBQQGLQgABi0KAQctCgIILQoDCS0KBAoACAAFACUAAAu0LQIAAC0LAQUtCwIGLQsDBy0OBQEtDgYCLQ4HAy0MSQQAIgZKAi0LAgEmKgEAAQW6uyHXgjMYZDwEAgEmKgEAAQXQB+v0y8ZnkDwEAgEmJQAACH0tCAEEAAABAgEtDEsEJwIGBAInAgcBAS0IAQUnAggEIQAIAQgBJwMFBAEAIgUCCCcCCQQgQwOqAAIABgAJAAcACC0CCAMtAgkEJQAADLAnAgIEIScCBgQgLQhKAyMAAAq8DCoDAgckAgAHAAAK0yMAAArOLQsEASYtCwQHBCoHBwgCKgYDBw4qAwYJJAIACQAACvMlAAANBAwqBwYJJAIACQAACwUlAAALogAiBQIKACoKBwstCwsJHAoJBwAEKggBCQQqBwkKAihLBwkEKgkIBwAqCgcILQ4IBAAiA0oHLQoHAyMAAAq8LQEDBgoABgIHJAAABwAAC1kjAAALYi0AAwUjAAALoS0AAQUAAAEEAQAAAwQJLQADCi0ABQsKAAoJDCQAAAwAAAucLQEKCC0ECAsAAAoCCgAACwILIwAAC3gnAQUEASYqAQABBeQIUEUCtYwfPAQCASYlAAAIfS0ISAUjAAALwgwiBUYGJAIABgAADCojAAAL1C0LAgUtCwUGACIGAgYtDgYFLQgBBicCBwQFAAgBBwEnAwYEAQAiBQIHJwIIBAQAIgYCCT8PAAcACS0LAQUtCwMHLQsECC0OBQEtDgYCLQ4HAy0OCAQmLQsDBgwqBQYHJAIABwAADEAjAAAMoi0LAgcAIgcCCQAqCQUKLQsKCC0LAQkAIgkCCwAqCwUMLQsMCgAqCAoLLQsECC0CBwMnAAQEBSUAAAtDLQgFCgAiCgIMACoMBQ0tDgsNLQ4JAS0OCgItDgYDLQ4IBCMAAAyiACIFSgYtCgYFIwAAC8InAAYEAgYABAYFLQAECCcACQQADgAFCQokAAAKAAANAwIACAIIAAADCQstAQsGAAADCAstAQsHAAADCQstBAcLAAADCAstBAYLAAAJAgkjAAAMwyYqAQABBRu8ZdA/3OrcPAQCASY=",
-      "debug_symbols": "tZzbbl03Dobfxde5ECVRFPsqRVGkqVsEMJLATQYYFHn3ISmJ3HaxNLbc3MSfuff6l0hR1MnI33e/3//27c9fP3764/Nfdz/9/Pfdb48fHx4+/vnrw+cP779+/PxJrH/fJf0Huvwo7+Qn3v1E8pPldwAFMYB8klNaUMdHOfEEUAsq8IRME0pe0AS6QNUvswDmBfLlnAWavCvrK6gs6NKsJNDLAprAecG0lJQXLAvAApyQ04K6gCcUfYW4U7Au6BPa+qgtCy0LLUvPC9oEhgU4oGoMB9QFPAHUZVagCTkvaBNKWoALeEJdj9c+AdfjuB5vsEDbIwGvlBbUBX2CuWPQJvD6Mq8vMw/AVBfMx1HdGUATMizABevxsr5c1pdrXrAsqI8XhTahpQV1QZ9AecH6cl+P92Xh9bi5gwo8oKVpaZAXSDOqJElTLwa0CWVZyrLUZam4gCdoag3oEzS1BqxX0HqclmDXxyVJSBO7SjRIE7tWBZygiT1gWcqyFLfwBM2WAX2CZssAmqDZUrtCm6DZMgAn9GXpdQFPYHkFJoU+oCe1gIJ2kxSZbuE1oAmWJAY4Qb0YIK/AJlDFgl0BJ6BaWEEsTd+lxWGAKDd5KWtxGKAWiSHr21tRUIu4zDriBiyLlq+GCmqRt7OOlAHiaZOGsfo+QC3SHtaMaqwgFpJmQNKUmuQ2LZsERmrLSlqWqBjxIvWcqpE/qz04bNqFg9Btml2ESppezWyaX8Omo2OS23S4UzNSGytpELu2D/TZru0DfXaS23TOGKRjqqMROs2MAJs4JrkN3AZu0xj0atQXaUd0NpL3ssYga5GY5DZ0m9aJQVooJlUnXkRu09o3SKPBYKTK6pvNN1yMaJLNOJPaIkhO1YkXZbepb4PUN65GqqxRK+ZbM1KbTsnFfBvkNh2lk9CJF5lvg9ymM+kkVdGIF/ONjXTiThqEqs4tDKtWnoUYyI7q4cKwaolfaGIa3VrtFdnQrBoPm7kkrw3JsYVVK9JErUkLayA79rD27sgmhob2Cg01mse26kHtz4nm8UT1GLS9aOuZgTUFxhcwrBjWFtZWA7ujLiwWkmPPgfFihkB7RTLkhW0s1QZ2R8iB5Jgh0MVaSYEhVkKslkAT0y5s1oUTm+NwfmAN7I4Uj1E81iEwrBxiw/mBvJBSCfSWEUAgBsZjuQaGtYRY8fZSzYHeMsIUGGIYj7V4rEXLwnkazmum0nB+IAayI5dAWtgTBLpYh7ACBpqYloSeS2B3LGEtYa1hHT1viBDYHEfPD8TAeLEN3oE2NnVjAKy1tDej6qQt0M0BsLU2V8PuWMJawmpdNZEcMawYVi2qC5ujlZqJ6NjDaqVmYryYozm8XiGbqRzYHAEC0TGnQHtFM2THEtbhseHweCA5YljRFEjRhmPuhmbVfVmyTpkYVp1AoNgG0NLQNmFgo01X6oLaBl1aZwCz2tbQsqyoF6D9Vu2rmRbpJDjJbbaQHtQWodu0qk7iSWNPWZqhhlVXjjlbf05kR/NuYne0Sls0EmXseNmwBnbH4Z2hVc+J+mJdt+di1XMiOtaw2mZ4IjtiWK1q6No/2yZ0YVitVAy0UjERA9mRXWFM7hazMbkPtPybiIHsaCNuYjxWQqyEtYZYDbEaYmhixZAcrThODCtBYHPs3kNjnp/oPTTmeUMcbmr+jRm9omFztLE1kR2tmtRm2B1tbE1sjlb4J9bAeKyFWAsrhRiFWA+xHmI9HuN4jP2xZklbyRAdrSojGqKjVeWJdoRj37UhMpDCakNkoBWAiWHlsLJbxyQ80EI90CraRH+FbUZBN3TZ9pygW7pM1vPDamVXt3XZdp6g+7k8psWBHFZrg6FtPBeG1Zoz0Aav7gkFm2MJqw1e3Stm232C7qiy7T9Bd4fZdqCg28Jse1DQ/WAes555MWa9iTyxJLDO6nZ2ZR1r1jGcBjbHMZwGmhgYsqOl3MSwtrC2sFJYKawWSbQTNKsaA0fHDqSFYAuMiRjoj4EdCppvYFM2ZkVzaOAog2yIjhjWMYYGmkJRtDE0Maw2hrAakmP3mEGPV3C8gm+svHCccE4Mq1X7ieSYIdDFchkK37+/u1uHrb9+fby/17PWm9NXOZP98v7x/tPXu58+fXt4eHf3n/cP3+xLf315/8l+fn3/KJ9KRO8//S4/RfCPjw/3St/fxdPp+lGdAebTUuvZBaSDnkjAtYSuIfvUECZyEXrajHytUaQQ4tQQJrjS2LnSYTVDtuNw6UrdRQM7LY3S0o0r5YkG/gvhaD82HNi0fJkEyn7JFRCeKPRNNGrX4TOTo/dyFQ3eRIMposF0045nnkDahaPpDcAMRyuXId07w54elTFdOQO7NK2rV6qskiOkR33S8apPYJOi1FaX3Aaz5hc3gXyUIFW6bMImO6l7lxLnetmjtAlkaXVpCPNRgt960uHKk51Cb6s/sXO9UsjpzbHI8INjEZ60BHQQCzn3WdNIkw3zZSw2qSmXOJ7dsquKAszPNHbVUw/xxyBN0YjSnuZ33mVnFBzJihhjpTydBvIuPTH7OI9BJhuRpwq7cgO8YpHzzbz6Dw3exXNNzVjSmQKT9yme+ZFjfVBueuRVGgTeqbTzZJdbEENVtgWXuVXqbmbu2SdmvlnrcDoZJfm6epZNfsr+0aOBtV+2omzys7a0miE7YrzW2PSKLt3rKjuJEa/KTuGdCHgRVuZDEZ9XlduZSC7JRWTxdimyj0m+iQmlKxE9YLgUiSmh9B7tKP01GrySRK5f0rXGrpTaecZId9kXh8azJKmbZO28YsoJrxU2qdr6qoN0s5wur0p2XH7IhU67TPa6XYb6vCKr0JuJRVZxr9BA1+jpUmM/+MnLqUzUl77gZhEqB0k+zWK+jgeWf2HwY90OuVi4yBHF5bIccTfVtmiJrI+vRbYh8a5B5OuairTbIMTSoza+7N69Rsz6WPKpRor5oZ1poM90ehJ4ptGSx6PVeqqBroH9UKP7vq0xnWkQ+Laeaj/ViFXMzer2dRrhC/FhOzp43/YKpxqep/1m8L9Oo1fX4HKmweAHDFyPNTweUuUPNWK88OF4ke/GkU0/i6lc/qx4lJrPxlxB8HUQ1sNpqpUYczdLh+f1lLY1iKOQyXr1cltLuwWZdGmc/GwWZHtv2HuX4HrC7Gk3+bNnu1yj3kSVX94OOULzLNu0Y6vBsXtgrNe+bCb/XvvqmF5v9kGlPDsa3O6lKI71oF5q7HyRhYdnKqTrLOsbDbm7WvFoyBuNTaZG1+pf4sX2VLr5icQmTyvWNcFUuZC7HHRbjVb91KFhOtS42RjiYTtufGmbyWGrQan7mh3aoS8ErpHTm32hDIe+lPCF+FDDh34lPm5H+ML49njwYb90X/XLBcGphk/atTd4sy+95cN2+H5Mlu6HfcvZ+5YLnLajh0Z7czy4XC+Ud6UQUpwZpNYuayEkevsJLKT+1iNYuVJ++xks7O6eXnYIu5d40Sns3pUXHsPuRV54Drudb5sfPrSW6XK+Bdjt+eV4zo+39I+ULq+QdtdQJe48Sqfrefv/NcU7WBjhuim7ZNU/m/WlTINycIUjV4PVI1svL2BgdxtVa/FRU/HyKAV211E5x54s34S11GdhzXknwhj5erNc7qfetOsk2Wt4ztfbU51/aOxypHRfmQlTOcwRKp6vQBVPVXL6N1R8rhDGdqriR0Sqcp1vZXe5L9fQvumVi9x6ePpP7eYo8vQKwa/n3yLyskNR2F1VvfhUNG3XWBjrtNsrs5cqAPiVilwm9MsJYyvR/M4NOh5JFJ8/Bc9agT5oAG+u7V4l0dglOp85klxCjojOJGJ9VvDIkZeuAnataM3D2ejMEaI16IE4H0lwhJPzkQR5XafaTgTYLy4Zz+KQ/C+bZMG9WR3iDx3pnNYQ43wWCB/mTPjGSJ4JyIlD9ZvGm0oD/cUK4Csfgpvbm2cK9icql/2ZY4Dmlo9ageStQD5S8L90o9M2kMcSbq46X6GQfZ8gSGdecCj0tyrAURuyj07KJb21L24OB17TBl82UsYzL3wt8Y98+EV+e//h4+OT//Xhu2o9fnz/28P9/PWPb58+3Hz69b9f1ifrf4348vj5w/3v3x7vVSn+6wj552dZ4L1DLr+8uwP5rcnGvjXW3/TDKtuvWqr+qp9WcbYW+uW7Nu1/"
+      "debug_symbols": "tZzdbl6pDobvJcc9wIABz62MRqNMJx1FitIq025pq+q9b9uAvdIKdkLak+aJv2+9Cxtj/qJ+vfn77q8v//x5//jh4783v/3+9eavp/uHh/t//nz4+P728/3HR7Z+vQnyDzT+kd7xT7z5rfJP4t8BBNgA/EkMYULuH8VAA0AsKEADYh2Q4oTC0BiyfJkYME7gL8fIUPhdUV5R04TGzQoMLU2oAyhOGJYU4oRpAZiAA2KYkCfQgCSvYHcS5gltQJkflWmp01KnpcUJZQDBBOyQJYYd8gQaAOIyCdQBMU4oA1KYgBNoQJ6P5zYA5+M4Hy8wQdrDAc81TMgT2gB1R6EMoPllml8m6oAhTxiPo7jToQ6IMAEnzMfT/HKaX85xwrSgPJ4EyoASJuQJbUCNE+aX23y8TQvNx9UdFKAOJQxLgTiBm5E5SYp40aEMSNOSpiVPS8YJNEBSq0MbIKnVYb6izsfrFGzyOCdJlcTOHI0qiZ2zAA6QxO4wLWlakllogGRLhzZAsqVDHSDZkptAGSDZ0gEHtGlpeQINIH4FBoHWoQWxgIB0ExeZpuFVqAM0SRRwgHjRgV+BhSGzBZsADkCxkABbirxLikMHVi78UpLi0EEsHEOSt5ckIBZ2mWTEdZgWKV8FBcTCbycZKR3Y08INI/G9g1i4PSQZVUiALZWbAUFSapDZpGxWUBJbFJKyVJMSTRLPa1ayZ6UHu026sBOaTbKropCkV1Gb5Fe3yegYZDYZ7rUoiY2EJIhN2gfybJP2gTw7yGwyZ3SSMdVQCY1GRoBOHIPMBmYDs0kMWlZqk6QjGinxe0liEKVIDDIbmk3qRCcpFIOyEU2qZpPa10miQaAkyuKbzjeUlOognXEGlUkQjLIRTYpmE986iW+UlURZopbUt6IkNpmSk/rWyWwySgehEU1S3zqZTWbSQaIiEU/qGynJxB0kCFmcm+hWqTwT0ZEMxcOJbpUSP1HFJLo56yuiololHjpzcV4rVsPiVqlIA6UmTcyOZNjc2pohqRgq6isk1Kge66oHpT8HqscDxWOQ9qKuZzrm4OhfQLeiW4tbS3ZshrKwmFgNW3T0FxM46iuCIk0sfanWsRlCdKyGERxNrKTg6GLJxXJyVDHpwqJdOLAYduc7ZsdmWP2x6o81cHQruVh3viNNrCE5WssqgCM6+mMxO7o1uViy9tYcHa1lFYOji6E/Vvyx4i1z52t3XjK1duc7oiMZUnKsE1sARxNr4FZARxWTktBicmyGya3JrdmtvecVERyLYe/5jujoL9bB21HHpmwMgKSWtqKUjaQFsjkA0tbGrNgMk1uTW7WrBlZDdCu6VYrqxGKopWYgGja3aqkZ6C8mbw7NV/BmKjoWQwBHNIzBUV9RFMkwubV7rNg97lgN0a2oClVQh2NsimqVfVnQThnoVplAIOkGUNNQN2Ggo01W6ozSBllaRwC16tZQsyyJFyD9lvWrsU6SSXCQ2XQh3alMQrNJVR1Eg/qeMhVFCausHGPU/hxIhurdwGaolTZJJFLf8ZJidmyG3TtFrZ4D5cWybo9Jq+dANMxu1c3wQDJEt2rVkLV/1E3oRLdqqeiopWIgOpIhmUKf3DVmfXLvqPk3EB3JUEfcQH8suVhya3ax7GLZxVDFkmI11OI40K0VHIthsx7q8/xA66E+zytid1Pyr8/oGRWLoY6tgWSo1SQXxWaoY2tgMdTCPzA7+mPFxYpbq4tVF2su1lys+WPkj5E9VjRpc1VEQ63KiIpoqFV5oB7h6Hd1iHSsbtUh0lELwEC3klvJrH0S7qih7qgVbaC9QjejIBu6qHtOkC1drNrz3aplV7Z1UXeeIPu52KfFjuRWbYOibjwnulWb01EHr+wJGYthcqsOXtkrRt19guyoou4/QXaHUXegINvCqHtQkP1g7LOeetFnvYE0MAXQzmp6dqUdq9Y+nDoWwz6cOqoYKJKhptxAtxa3FrdWt1a3aiRRT9C0anTsHduxTgRdYAxER3sM9FBQfQOdsjEKqkMdexkkRTREt/Yx1FEVkqCOoYFu1TGEWbEaNosZNH8F+SvoYqWJ/YRzoFu12g+shhEcTSymrvDt27ubedj65+enuzs5a72cvvKZ7Kfbp7vHzze/PX55eHh385/bhy/6pX8/3T7qz8+3T/wpR/Tu8W/+yYIf7h/uhL6986fD+lGZAcbTXOvJBADwmQSsJWQN2YYGc60mUp83I641EhdCHBrMFVYaO1cazGbwdhyWruSNRNb0HOHgnYE3Iz3TwJ8QjvJrw4FFypdKIO+XTAHhmULbRAMzlBkNzLmsokGbaFD1aFC9tOM7TyDswlHkBmCEo6RlSPfOWDw4upBWzsAuTfPslcyrZA/pUZ80XPUJbFK0ykSjCtdg5vjiJlQbJVhzXTZhk521WZdWinnZo3UTyFTy1GCmowS/etJg5clOoZXZn9gorxRieHMsIvziWLgnJUA9iAWf+8zKV3jDvIzFJjX5Eseym3dVXoDpeXbGXfVEqzjBG5FKfa6wy04vOJwVPsZSoucau/TEaOPcBxnvEp4r7MoNkFWbeJlXf9CgXTzn1IwpnCnIUe7oUzzzI/r6IF165FUa1aeRuvNkl1vgQ5W3BcvcSnk3M7doEzNd1jp0NEriunqmspuI4mVSbctWpE1+5hJmM3hHjGuNTa/I0j3PshMIcVV2Eu1EwIqwMB2K2LwqXM5EYgomwocgS5F9TOIlJtf133MROWBYiviUkFrzdvCxyys0aCYJX7+EtcaulOp5Rk933he7Bn2nsUnWRjOmFHCtsEnV0mYd5HP2pcI+2XH6wRc6ZZnsebsMtXmFV6GXiSW9SgNNo4Wlxn7wVyunPFEvfcHNIpQPkmyaxbiOB6afMPgxb4ecL1z4iGK5LEfcTbXFW8Lr47XINiTWNYi0rqlYd3s/X3rkQsvu3Wv4rI8pnmoEnx/KmQbaTCcngWcaJVg8Ss6nGmga2A41mm3rC9UzjQrVViC5nWr4Kuayun2dhvtS6bAdDaxvW4ZTDcvThnio0bJpUDrTIEh2ZJOPNSweXOUPNXy80OF44YMJP7JpZzHly58Zj5Tj2ZhLCLYOwnw4TZXkY+6ydPi+ntZtDSIvZLxeXW5r625Bxl3qJz+bBdneG7LerbCeMFvYTf5k2c7XqJeo5pe3ozXP9k07thrkuwfCvPZlM/m33GbHtEzXma4819jupaof60Feaux84YWHZSqEdZa1jQbfXc14FKSNxiZTvWvlL/F8e5qfHwy2TZ5mzHOCyXwhtxx0W42S7dShYDjUuGwM8bAdF1/KZnLYatTQbM0O5dCXCqYRw5t9qREOfUnuS6VDDRv6udJxO9wXwrfHgw77pdmqPzc81bBJO7cCb/allXjYDtuP8dL9sG8pWt9SgtN2NNcob44HpfVCeVcKIfiZQShlWQsh1LefwEJobz2C5Svlt5/Bwu7u6WWHsHuJF53C7l154THsXuSF57Db+bbY4UMpsS7nW4Ddnp+P5+x4S/5IaXmFtLuGSn7nkVpdz9v/rynWwcwI66bsklX+bNaWMuV6ufjiKxy+GswW2by8gIHdbVTOyUZNxuVRCuyuo2L0PVm8hDXh9/ekcSdC6Pl6WS63cuhNWSfJXsNyPl9PdX7Q2OVIarYyY67pMEdqsnyFmvFUJYafoWJzBTOWUxU7IhKVdb6l3eU+X0PbppcvcvPh6X8tl6PI0ysEu55/i8jLDkVhd1X14lPRsF1joa/TrldmL1UAsCsVvkxoywljK1Hszg0aHkkkmz8Zz1qBNmgAL9d2r5IoZBKNzhwJJsFHRGcSvj5LeOTIS1cBu1aUYuEs9cyRWuegh0rxSII8nBSPJKrV9ZrLiQDZxSXhWRyC/WUTL7g3q0P8pSOdwhxiFM8CYcOcKr4xkmcCfOKQ7abxUmmgvVgBbOVT4XJ7852C/onKsj+jD9BY4lErsForkI4UyPZfp22oFku4XHW+QiHaPoGxnnlBrtDeqgBHbYg2OmtM4a19cTkceE0bbNlYI555YWuJH/LhD/7t9v3907P/9eGbaD3d3/71cDd+/fDl8f3l08///TQ/mf9rxKenj+/v/v7ydCdK/l9H8D+/8wLvHVL6490N8G+FN/alkPwmH2befuWU5Vf5NLOzOdU/vknT/gc="
     },
     {
       "name": "process_message",
@@ -2385,7 +2385,7 @@
         }
       },
       "bytecode": "H4sIAAAAAAAA/+29CZRdR3UuXKfvVatvd6tvt2QNllrWbU0eZBOGZ0IC4WFsY9mxjWdjm4CFJDxKrdGSJdlgEzLwAoSYkIGfhEwvLBLgQcgj85+fhGQRfhb5IQsIj0ACyR9IHDBjsvJIeBScrf766+/UPefcfaWL3bWWdE+f2vXtXbt27RpPVRa+E9r5774Dszt3Hzz44j3f+m/HHbtv/NarLI9q5r9L89/4firMD0bbCaVCVoF2fqIKPLLQfx5Dof88GqH/PJqh/zyWhP7zGA7957E09J/HSOg/j1boP4/R0H8eY6H/PMZD/3ksC/3nMRH6z6Md+s9jMlTnUYfPVDg1fJaXp/029nPEuyr8VoT+l9EZof88Vob+81gV+s9jdeg/jzWh/zzODP3nsTb0n8e60H8e06H/PNaH/vM4K/Sfx4bQfx6d0H8eM6H/PDaG/vPYFPrPY3PoP48tof88tob+8zg79J/HOaH/PM4N/edxXug/j22h/zzOD/3ncUHoP48nhf7z+J7Qfx5PDv3n8ZTQfx5PDf3n8bTQfx7/JfSfx4Wh/zyeHvrP43tD/3k8I/Sfx/eF/vP4/tB/Hs8M/efxrNB/Hj8Q+s/j2aH/PP5r6D+P54T+87go9J/Hc0P/eVwc+s/jktB/HpeG/vN4Xug/j8tC/3lsD/3ncXnoP48rQv95/GDoP48rQ/95XBX6z+Pq0H8ezw/953FN6D+Pa0P/eVwXqvOow+f6cGr43BBODZ8bQw0+NxHDuKEhbjiIGwLign1cUI8L3nFBOi4YxwXduOAaF0TjgmVcUIwLfnFBLi6WxYWsuLgUF3/i4kxcPImLG3HxIS4OxMn7OLkeJ7/j5HScPLbJ3Zlv/YuTl3FyMU7+xcm5OHkWJ7fi5FOcHIqTN3FyJU5+xMmJOHkQB/dx8B0Hx3HwGgeXcfAXB2dx8BQHN3HwEQcHsfMeO9ex8xs7p7HzGDt3z/nWv9g5ip2X2LmIjX9snGPjGRu32PjExiE67+hco/OLzik6j1i5Y+WLlSMabzSsWOg3huJghVuw/+aD67/zeiSPHoJkFfaDZCPErlr6l//1CANWSh++nT6mGamX/iZL36qX/tvmG8MrID3KYriN/Pf1kPb1xNNoPgo0HyUak7eevsMreszv1HiYn0fDCCDbaD3s5ZgnCw16h/it0FPZZxnhGT/On9WNcaAxfhnFNYWcFrcE4kz/0fWdB3RctiMUZ7LE8HqKa0DcT+e/ViYoVwUdvaFHe3lOH+3lou9Ge2lSnIe9IAbbi2HE8FGKG4a4j1HcUoj7OPC+EJ7vy5979EknfXjNNujbXQLmj1gmr4UG/cZgejLdjwh6i2tBHOo+hlF43xBYSymd0f+X/Hci/8WysfRtwX+Y+Cu5lW1mAqsh3hl91M8FILNhXgy0HXv46sGP/fcPvPq3/vQth379194w9YllPzd2/ujLXvnKL677wvTPP/bKX7G0l4AsWShd3sOW/lLF+9nvadx65zv/fXbssle848gn/vrqw8umd7x3w4/92q3ve92Gz7/4Ryzt81Taz/3EG1/WfsdPvbmz7YNfG77stY+++CuXL3nGJz544sw/efgbn3/sEUt7mUr74Vu/8Tfvbj9y7Oirf/f4M85ZseM3H/nYl/7pzz/w9vZX/u5t+z92oaXdDnmu08+6vF76SUt/BaSvsifX0v9gvfQn5b+yXvohS38VvOzYw0O/+pa/uejVH3zyZ78x+qqrdvzw0af9t4/c/C/H1vz6ln+4+23Tvzllaa9WaT9z6OLXHVq95+n/MvKhVz/ll9at//RXf/3d//j1+3c/49F//Nz/nPmKpX2+SLvmqWd/376f/cszPnnOxv/1nD/+zSe9/syvbn7WJ39n+y899u/v/7cwp7NrIM8Vyuxknq+tl75p6a+rl75h6a+Hl510mpNNsaW9oR7vk+lvLM/bwhJLe5NOm71i48Gfab06u+q9D1/w7vHR937+ol987sUf/MAPv2pD+zd/0dLeLNKe96zWY7/2qgdfGf721//5NV8/7w+ec8HUWRdNPemv3vjRdXsP3HbmY5b2BcYoVMrztKW/BdKT7Mlg6W8NC2Uvm/a2erxP1u8XVud9Mu0PVU97so68yMBCJZ2ftJUX10vfsvS310s/aul31Et/0re9pF765ZZ+J6Sv0BZ3LP2ueumfbOl310v/FEv/UkhfZXxi6e+ox/8iS39nvfQXW/q76qW/xNLfXS/98yz9PfXSX2Pp762X/gZLv6de+h2Wfm+99Dst/Wy99Lss/b566Xdb+v310r/U0h+ol/4OS3+wXvo7Lf2heunvsvSH66W/19LfVy/9Hkt/pF76vZb+aL30s5b+/nrp91n6Y/XSH7D0x+ulP2jpT9RLf8jSP1Av/WFL/2C99PdZ+pfVS3/E0r+8Xvr7Lf1D9dIft/QP10v/QBzLxzmJS/JBf1x6WZNHHj501713Hbr/st2HbvzO08Wzew/tPnoI55QiL57ba9Hfo/T3GP3N8132Xs2blQk2h7WM8EKYm6uaID6dUCqszwgvBD3naPgtkqUiv5NzjhPEj/OHc44xri1kaVNcDNzutwWftuCjsPY5Yh1zxNrviHXUEcszj/c5Yh1yxDriiHXAEWunI5an7j3r0PEBxdrjiOVpE56697SvWUcsz7rtaRN7HbE8ffSDjliD2j6+PP+1vgP2NbKCX+PD74xPK/TUz8pS+ZoQ/FL0yxL0kyXxxwA77xdfsvslh++4cvaOQIG7qpcUiDhNdDckRGPcjP7x+2l61xC0GGL2VuXPefaet/vQzjtv2HHHHbt3fSuTBzkFI11c8D5lVNYZb5OknVAqDJUxSsQ/1UYZtbo8f861euXsjl0X79h38PC9u3ErB5opc8kIFd+pMs1AMnw3SnQX09/bRbogsHEb0hS974RSYblZxXIRaXErAHsZxZ0BcViaHBpCfpM5DnuvaM3hMh3Lg+WxguImIe4M4M3l2hZ8TP4hQT9JWGpYZ7rvxq8h0vGwNDV0LlPbLB8hzDU1y4TMffQKZwy6V7D8TdbjtyLVdCGmyWO6nhJxhmX1cLgAy9I2if7v8t820cVwK/GYEvLiO9xq8kmSHXXLdtKLHhHP5MJ3iN8KPdlllio31VXr1ceW0TvKwz6ZdYt+b7gAy9I2if4L+W87LPT7bCfLhbz4Du3k8yQ76pbtpKYeS28zNPxW6Mkus1S5Yf7YTpbX4/ecMnpHeVT7jLrFNnC4AMvSNon+f+e/baKLge1khZAX36GdfJ1kR92yndTU43RZOzH8VujJLrNUuSm/qsrN0ip989RwWX0rrGOOWEcdsfY6Yu1zxDo+oFiHHLGOOGIdcMTa6Yh12BHL0+4HVV8vc8TytNUTjlgHHbE8de+Zxz2OWINqqw85Yu1yxHo4/1VzLNzXwb5A1bEF4pmc+A7xW6GnvlWW0osaG1j+zqjHbyqj9MgPMXkeaKWIMyybXx0uwLK0TaK/OFdom+hi4D7xSiEvvsM+8bNz3AkhL88PVLXH1FwZpmN7rFlel5a1R8NvhZ7sP0vZh9KL5W9lPX6XlClflMd0vUrEGdbq/O/hAixL2yT668keV4FMbI+rhLz4Du3x6my+7KhbtpOaenxuWTsx/FboyS6zVLlh/thOVtXjd1EZvaM8puvVIs6wbDvYcAGWpW0S/e1kJ6tBJraT1UJefId2chv5LZSX56vK+sO2SG90IyJdxx7Sn7r9ao/lebOlX10v/QpLv6Ze+kss/Zn10l8Uy+suKi/8/JbXvGzr4JIwVy9xXdTSNon++NK5dHvIj/D2xBDmyrTmZ81nlvUjhu/16TF/rsn547meMSFLm+JieAjoOK4h3g0lsB52xNrpiHW/I9Y+R6wjjlizjliHHLE883jAEWtQ7WuPI9YxR6wTjlie9uWpr8OOWJ725VmHjjpiedqEp1+1ee9xEcf9gHF4X6FdLr0DCY+O4Ha5Tj9gnPgV6aXaDiTsDbFWEBXfZWF+7jGuQe94B9Kl9HedHUg1d22sNatYKyItbh1gtyhuGuKwNDk0hPwmc9UdSFge6ygOe9LTwJvLVfEx+YcE/TLCGhfpTPfd+D2Ra6IqJ0urdkpxXSzb86/jIZw2tpqIa4hue4FomcDN6B+/X0PvGiHtglKDwDImEwM3Moh1A/FZbGQWG5mTYbGREfL3u5FpiHQ8zcPTPzF07CF9mtDyOMX08VxxE0JenOLBvC3pkr8m0X8vTGl9MucXaW0qMK9pzz187z3X7T504K7d9+1W+/S7VY+r6O+rRToVzCT4Y98YRkJPDqi0wzP8VtDF3AmlwkmHp0Yb6jC0ag6PDYIrsrfDu5r+ruPwan6uXNnh8XGF6PCwNDkoh2cyV3V4WB7s8LCissPDch0TfEz+IUE/TlgpZ9WN32LX4zthsesBYbHrIeTvd9eD0y0JC2uupW0S7dLc+HqssfN2E7OMi232d8Jimw1hsc0W8ve7zVaehNeG+zl1gbyTg6H08ahf7dFr3NSjt7sxetiNeSZtMIb1gOuxtUxF+wssbZPoLxyaS7c1f4553pLH5x7lph333rVrx6Hdl+7df3j34d27rp49tPvgRXt3XXrf7r2HKg/Nnkd/XybSqWBKrbnZYEx1KC2oSjZKcbypA+OwO8NTo/xhHcbhxpwmxWGTt4TicMPpMMXh5r+l8MxBOS7TbUx3bQnHNRrm9IHO1BwBfnDL86XmxGwDFtOw0Rr99w3NyTidT5wqR8AOlA8PCGHOptaT7J1QKpTuHhh+KyxsXOp0D9YTP86fz6f6qBVExXdYGzjuVHQPNtD7TigVOmYVit7iZgCbP9XfCHFYmhxULTOZq3YPsDxmKO4siNsIvLlc1ws+Jr/6VP8swlov0nH3oIhfQ6Tj7l1G73F+cZ3gzfOL14J32LCmWA/rQrEe7G81oGJ9W3wMPdrkzWW9ieG3wsKyr+NNNhA/zl89b4KWglxuIlSjQVoMN4FkSM/nL3LpjYl0HExjTZL5bugY3UYdMczXcpJbWTu+444rpjc6xWeyRz6Tgg/3XWK4heKmEnHqg1v+YCQGXktUG+vVhm3+gH9NAnOtwIxl12rM4cV/W4FOWbq1QFYGW0AeTIt/LyHaGOy8+CbRPgB2NUt2hbWY7eqsLnKn7OqsUMxnskc+k4IPt1YxsO1sEHlVLTKX8wzEse1sFPmyuE0JzM0C89v97cZ8Oi7/GMzjnw3vqwwUy3p8w2+RLHU9/tnEj/PHH26cU4/fjRmlR36IafKYrs8VcYZl90QNF2BZ2ibRvyrPVJvoYuAPN84V8uI7/HDjlUPzZUfdZgW/hsvvuH5h3q18jA/6mxtAntcOzc8L+qlGWOjXrOfJvmozrNT+FPkqTM9lp+pJ3fxvFXmcCAt1wx/2Kfs+O8GnnchPv8qTDzJCP4vl+QtUnudAnPLRL8l/m0S/DMrzl6g8VV1UeuZ2qaqelws+/dYzty/nOvJBLD7ocBthsR+0cjI9nwfpt1G68yEO6XDUtQ3eny94K3zD6GaD7xrSeVM2iLyaRP/l4bl0v13TBs+lOGwrsF1EOVAPWGYvCTpfw4I+la8/gFHnxjXzMS096grLgv2v0f/fgLlljZYT84XtAW+bVPawTeRL6fT80J036nl7Ae/hkLbFJtH/mdAptwuYXtUj/jj4vC6yc/3G9Hw/Jabr1Y8ombvVyQ9VrJP2sSPb7v+COvlhqpMpG0GZeRxRVc+Tgk+/9cxjhPMd+SAWtwtPIizWs5WT6fkCiHsSpfseiEM6bBeeBO+/R/BW+GXbhc8O6bwV2aDxahL9H4MN/v+JcXHKBs+nONQptwvd/OGZRG9yD4d0e9sk+n9JtAuqvqKv5XbB6B9LtAvGF/OVaheULV4g8qV0+iTC2iKwUM/cLiidYv63UP6N/l9LtguWXs1H3EZxOB9xDsV1II77rDMQdy7F4XwEz41sgjj2d5shDm2E5yMmEvnBtUOe78N5uw0Uh4cOdCgOP/afoTict9tIcfiR/iaKWwtxmyGvNm/HC9bj+fse1+3kdqLUvGhW8BtCufYA14d5XXm9Ix/EupT4nOXI56xEfjqCj5UX1pd+rLMafissrLt15slmiB/nr97KCHob1gqi4rsszM89xvVzndX4boQ4pQmeOcc8bSxIh7oI4t2QoJ8hrBmRzmRvJNIjBqbrEEZG74vWIw2jSfRbciXH1uocaq0VL9QHt5gme9GOCZbB6M8FGabXaMxmQb46BZjPaszp4/yGxgwCU+VrI+WLZZghGYz+yZCvjbTWu1GkDwXv4t+41ruxQD5VTixr/LepS364nIz+6Yly2iBkwDq5vYsMTLOxQIbvFzII73bx7L77c+8WKPB3j7xOy5rnddsNAqcomDaiFZpFql0GHZFuA/3dEjLFnNt4/ORnpPfuPrS7IO/suUcLeA4FHbg/auliGAk9tWml29BO/twK2vI6oVTI2MsZP84f75ebEbK0RRyWL9tRik8sU+sD52V6/aHZA0VFWrZxzYRYnD4QVibexWBFXXOZ72w1pW7B4nC6lbtwOEXK3UgccqNT48D5xvxE57JtzRwu07GsqFMenqF58hCsA3E8zEJT2kZx6PDPpzgcul1AcTh0exLF4ZKZTcNYZwnLmc/XVFsW1FJtW6TfmuCzukc+qwWfPi6Vl3Zfp2upXNUrS9sWcbyBzYakfwMdqztoyN+Hq1+fXlavp/vq1ykhi7qf5W6g47iGeDeUwDrqiPWAI9YRR6xZR6ydjlieefQsR8887nXE8szjfY5Y9ztiHXbE2ueIdcIR65AjlqdNeNZHzzrkaROe+jrgiHXcEctT9/sdsTx1f8wRy1Nfnr5wjyOWp74G1Rd66svT5zwR+kyeNuHZbnvq/mWOWJ5276n7g45Ynrr3zKOnn/DsA3jq6yFHrIfzX5tjwnkI3najxvwTCT6YfqIEVupKdJVHNY/jeHLkyc/siW57gWiZwM3oH7+/kN41BC1i49ECqZ3XPX758dSM8ELQ00qG3yJZKvI7Oa2kvjRRO9LVlyaWVu3uvhPoOK4h3qV2ih91xLrPEet+R6zDjlj7HLFOOGIdcsTytIkjjlg7HbE8bcJTXwccsTz1td8Ry1NfDzhiedrqrCPWE6EcjzlieerLsx3a44jlqa9BbYc89eXp7z3ty9PneNZHT5vw7DN56v5ljliedu+p+4OOWJ6698yjp58Y1P7XQ45YD+e/6mtXniZJnZag+GD6c0pgqfFwKo99niYxEZ9CdNsLRMsEbkb/+P1T6F23aRLelXNVzqzHnXkLpnoQa4J4xudNYX4+qs7UYfqpBJ8VPfJZIfiMi3SW7x71OIb6QznxHeK3wsI815leUrvklF54ag3TtsPCasgHkFQ9WGERaxHrVGP188CXsn6kLh/ESh0sw/63qt4w/dkFWHhq7+1As5norZ1sCswYboF4pL8/T7A05jH/spl3OseAH3Yfb6ZlxbQoa5Pofxk+7H4wx1R6Zt+4VeSRyw75Kkxu06qW3QohQwoLy4tvG7eyGC6gNzwuux+DsuMPyPGDWWU/ZxfIgPaDh58V2c9P1LCf1zTTsrL9rCTeRv/DYD+vI/tBHafsZyXFof3wQTMYxzvkq/aJMH2q75U6oI/tqOoBfSsFH+t7of1V6AudwzvdMahltdUUh1+QrKE4PGBgLcXh4QDcNuChBR2Kw4MKUB8cGvQ36ija/hTYPtMF4olleC7Fod3zgRb4sTxiYJzJyu+47DH9mgIs/OxT1eUm0f9qfhJ5/Hl7c36+8BBO00mPtva0Mu074rdIlor8MvZXxo/zx/38rUIW9kUx3AV0HJcabiusQ45Yxx2x9jpiHXXEetARa58j1rEBlWvWEWunI9ZDjli7HLEedsTy1NcRRyzP+njCEcvT7j19oWc57nfE8ixHT//lqa/7HbH2OGJ56suzDnn2Jzz1ddgRa9Gvnj6/6qn7lzliedq9p+4POmJ56t4zj55+4oAj1qD2V3c7Yll/1eYecIzOcw9qPLw5wQfTby5IF583AkaZ0yNqbkdvZIRn8uA7xG+RLBX5Jbejq/Kpsh2ddYhxyKfM1oT4XOYgHTX3kbINlUfHLQMm4lOJ7poC0YYEbkb/+P1T6V3RlgHDtmqEU0+bCBPVmFKtWj5am+Czskc+K0vyWdEjnxUl+azukc/qknzO6pHPWYIPn3saAy6NPGOJ5olLIzhday6ySfQHYSr2mUvm5xGXFyYo//ghFZ95ivc2sevF818ruMLSB/cYfisstMk6rncV8eP8oVsqf3Yn1wDUCqLiuyws9BoZSIbveJF7gtLVObtzNcQpTfDZnZin1QXpUBdBvBsS9KsIa5VIZ7I3EukRA9OxxWT0vujsTsNoEv1Vea1SZ3cqXqgP3rxmsg+HubLbnpDB6K8FGfhMyFWQRuWLa/Nq+htt64UF/F8KXubGJZp/EPw5f+jVhgvkXUUyGP0toAM+53ONSB8K3nHLsIbi1iRo+W5UdW8l2iKfCbq2S965/I3+9kT5rxAypG7cZRmYZlmBDLuEDL2dCcpejkuJS2KFwCkKpo0otFkva4drB/Oxv5UF9HomKOd9haDDwOe2W7oYrG2u2VaWbpsNvxW05XVCqZCx9zR+nD8eFq0SsrRFXFEt7canxzNBixpt5Sw4faC0mXgXg7oTfnGoUczniTDUYCw1hIjhpfkvO/ZXgmPnq0TWghwK8zqSQc0CqJ1JRq9mrjaLPJoucZZiawneqEtuCM+pKKuaXcGZKN6FiPKdW1HWa06xrGuFrKd6hxjv5sIdYnxFCe4Q61Ac7hCboTjcITZNcWqHmMV9D8Tx9S9PhritFPcUiOOpgadC3CqKexrE4ZnBHLgNwfKK9fnRtXO4TIfPRb4I6/p2knGNyBtObYwANvLphFLhbEs/VC/9Syx9o176Cyyf3G2NwbCXwPsKdWMn6sSC6nIZfotkqcjvZJdrCfHj/HGXa1jI0qa4GO4AOo5riHdDCaydjlj3O2LtccQ65oh1whHrkCOWp74OO2J52tcRR6yjjlieNrHPCcvSe8l13BHL0yb2OmJ52sR9jlieftWzbnvZagyD6lc9bcLTf3nWIU+b8NTXAUcsT33NOmJ52qqnXIvt9unTl2d/1dNHe/YBHnDE8vRfg2oTnn5iUNshzzGMZx5f7oi16FcfH/7LqxyzsHDObVD0Nag+Z1D7hfsdsTzro2db61mOg9hfzcLCOexBsS9Pv3rQEcvTTwzqPJOnXJ66H1Q/4dknH0Q/EYOnL/Rstx8cULk8x7We5ehZHz3HMJ7zvp5YnjbBdSjL/8Z10lvg+TaIR3o7tUitY1dYu901DmkCYCB2zXXoXRnhhTC/rxEIf7yAXwwtEdcsIctvP+eH7vlU52tnZZTeZOF3ZcYmak3bdLWUZO+EUuEl48AjEG+Lw/X5JRSHejEZ4u95JN9wTfnK6A/x24L+VqCrUhZTYb4toL2rLwu3UhzuTZoiGbrtZdpI9KbP4QJ6w2sS/atyxeAG8wmiic8rCvihfPgutSfxvAIsdUJaDDsKZP9JkJ338G0T8qntr0Z/vqDH/VYmj9LN+UHzxvxged5O+TH6N4j8qPpnNjUCOBZXoe6MRT4fXzfHh/WG9aebjmJgnV4g6FFXppM20aN++etd5GlxWHf4EGi15xBti/d3Yb3Ck/teU+IEx0Gq128pWa83FfBD+VL1GtNXrdcvLpD97RXr9SYh3yDV63eXrNdmU4v1unu9VqeQlq3XeKIrn/b6JIgzXNx/nh+EeLKMjf5PEjb7PULWlH6fLOhxLy6fmol7eJ9McZiOT1zEPbxs608RekC5Xpr/Non+A6CHR8EGLS+B5OrR1i9Sto4n3rOt46ftDUHPZfE0QY97mE0nbaLncsG/EQt1ynv1TUfDgh7xmkT/UeH7TT70b08h2c+vKPtZQnZ1CijWqc/mCjYbRF+8lXien+DJadHPDBfQG16T6P9W6Cvl81FP44Rp9J9N+APlP7fAO7ZBpfsLRL6UTp9EcSi72YKqn0bXY/18rqqfmH+un6m8xsC6Ub4VbdfKvx0W+kNub7BuXEB8VL+jrP2jDX1oSOMuKcB9Sf7L9vW1hH2peqMuUSnbnnN7g/Z1AcVhOj5hGnXK3wapdhfl2pH/crv7HyXbGyd7Xq7sGW2W7TllnzFUbftNJ+2wsD1gf6hsFnXK7Y3paDhoP2N4TaIfySd2VHuD46QnkeznVpS9Tn17F7U3qcuHzk3w5LToL4ram6Kx2XKhr4x4qDGGam+MfiVgsj9QY7pUe6N0f57Il9LpNopD2fEbMsNmzB7r5wpVPzH/XD9TeY2h6niS2xv0h3yqFdYNHjt3+/YxZf9oQ79A7c1WwkUstIuUPWK9Gcuf2R7PSdhjqp7FwDpX9ot2lZp/4TEPyp6yR6Pr0R5vUvaI+Wd7TOU1hqp11cqzHRbaasoeuX3eKvigD2F7RDvaCnl9bZ4Bm/eveVr9OuOzTkRaHH43PUpx64H+UorDujQOzxwa9DfmJ5b7NprrCQLLeOI5CfyNburYKnWbBh+bEZ/5W2I8i6BDcXisxAzF4Tf/GykOv43dRHFYTpb/kbCwnCrYQOkjPAy/RbJU5Hfye1J1SiDmz+poteO1+GQD1Aqi4rssLLTMDCTDd6NEdxX9XeV4LSu5s+h9J5QKG8wqNohIi+sANn9FPgNxWJocVA01mWMNvaI1h8t0LA+WR4fi1kPcDPDmcp0WfEz+IUG/nrCmRTrTfTd+DZGOva9KF/9uiTRl7j5ZT/idUCqUPrPU8L3uPllP/Dh/VgdVS2Fp2yJuFJ4xDvmk7jJCrDIH/SiZezzoZ5T+ni4QY0ikD5SWq+pQAZbhsIPtdroXm3nR6V73iIGYqkYoz7h4x2Zfs4Ep3aAZfissNIk6Zr+O+HH+2OyVG2qLuKLDerrxcTTVGK4qEEO1lIGwMvEO45SpYmtSxlSxj1lkqvcn5lhGRPrY1/54Np/3BqBrUFola4dkZZoRktXoXwayTpOsaKrcJ+3MibKgSs2Q7EibCKWrlOG3SJa6VWqG+HH+6vURsaRZK4iK71JW3K3mXEx/1+kjbqL3nVAqbDar2Cwi1ShzhOJwpN+BZw6qj2gyV+0jYnlsoThcgd4KvLlcZwSfTv48JOg3EtaMSGe678avIdKNEEZG73FmaIPg3ST6nwHvsIEaXeTFYwPlIVYKOVnfFh9Czzb5grLexPBbYWHZ1/Emm4gf56+eN0FLQS43E6rRIC2Gm0EypOcuY4f+XiXScTCNNUnm/5FbUbS+X8qfJ8JC622T3B3ATvnltkhvdIrPZI98JgUfs+QWpLuF4sbCwrxaHHqsGygOu2K3Utw6kS/u+inM9QnMs0RcLLsLR+bTzQBdVvAbQ0O8Y53OCFmt7NAD8JmlqrZtSvDB9Dzvhel6zY+SWfWd8Mj93186lyb+U7cRdwDX5vf4NuILWnPp/ojqG+5xNhmVnrkuVtVzW/Dpt565Tm1x5INYNwB9/Kf2t6GerZxS6xq89s902CPAuf/UzS1MG+O72eCHluq8Fdmg8eIb1ZeDDX64pg1uoTjsQc6E+XKm1jywDDhfwwX0Rfn668TYbkakV7Lz/vwtCdljSO3P555rP2weeXazn8+Q/eB6krIfvOEZ6f/3yFy6fyD7wR5aP/Kfqtdq32qqXiv/wemwjp5RQoazhcxtkZ7PgcV0vdqGkrmbbXyFbEOtV3cAl/fvGv3fg218nWwD/SfvaUKZuQ9YVc+Tgk+/9cz9u3Md+SAWt29q3Rr1bOWk9uVvo3TnQxzSYfuG695qD4fCL9u+LR3ReSuyQePFe/reDzY4OjI//5g+ZYOpvTm8t6PbtyhnEn3db1Gm8rzU2e/EvtzozwDMMvud1Gg5ZYtV9zuleKOetxfwHg46/0W2si6hU0u/pCA/rFOjPyuhU6WjlE677ZPifTmYZ/4WYaPAQj2X0SnmfyPl3+i3CJ2qfgt/M4R9hxmSRfXDkH4N0as6pvomXMe2JWSfEenV3MJtFIdzC5spDtcseCyG6ytbKQ7nFjoUh0tH3P7hSvI5FKf2XOLcQpPy+oz8fY9rC/P23gTCUvrNCn5DKNee4io872eaceQzk+Cz0ZEPYl2c/6oxG39DWXXeANOnxoZjPfIZE3wYy3xyDNgn4n29Rn8F1OsvrpuPqb5tHYN32xN55fqMWFZmVj/Q9/Vj7c3wWyRLRX5ZyueqG3vVShHvl8S4ojJFPlOCT1W5HG+LNRF5m+T2AtEygZvRP37PW/saghaxT1XVO518lvfIZ7ng0++pzuXEpwPpcLizi4Y7qSnlGHbkvzyl/B4Y7txBw52UK+3A38YvteXC0hdtYyhyvfeC6+X7B8cpz5hPlhExm4JvDLcUyLCfuio1XaPsqvB1SNils67GCP1dke8mZbMWuOlBGdQC/xjFqQV+ni6Jz7xhEYdv6yhOXQ7On5HEZ96GrT4BwXpnoUF/o26jnV1bYrPBRFhYJjMUh/WHt2mnNmye6p1rvW7YVDvXijY/ll8Yx5rAWkFUfJeFhSWegWT4jgcFY5SuyjYb49vt6nruDGKepgvSsZfid2rL8jrCWifSmeyNRHrEwHRsMRm9L9qOwl7e6F8HXv6cgosAy7Y0JnvZlsbofzrR0qyDNCpfXJt56zba1gsL+L8VWuKfG9H8g+DP+UPPOFwg7zqSwejfJCYwGkTD8qh3qANMW/Q30vL2OrX1CW1xA9Gf1SXvXP5G/6slehooQ2rTJsvANCMFMrxFyNDbTcfs5biUuCTGBU5RMG1EizXrZe1w7WA+9reygF5vOm4V8BwKOowXyBZCz5/KlW6bDb8VtOV1QqmQsfc0fpw/HoarD1PaIq6olnbj0+Ou8qJGWzkLTh8obSbexRDN+a5sPp2a5enAu6KhPDaEiPGS/LdJ9L+fmP1XOyGwYSmzyo3ddR56YDefV7fUDEwfv9iVJzxgfpYAbvx3DsSlVnmNvtuqWyd/Vqck8OwUDo15xrwDcThE31VxtZJXzI3+/03Yy/mhOI8xVD2BpJM/n84TSF6a//IJJH8FejgFJ5BctHgCycITSD6dWP3yPIGkI2RX9Q3r1FKa2qq6Io+45xC9Wi1E+qIV+c/3YUX+0QFbkT9NJ5A893SfQNLJn/txAkkH3qXsH23oK7SbCtvzGeJ5doInp0U+RfZveGyr1plT9q92F6KeVhHmyW95AHNLQZ3CfKXsv1sfIdVH4rqBsuPqv2EzZo/2f6myf8w/238qrzFUPQ2mkz+rU922Uhz6X/atqs/bgXcp+0cb+kzF3c+8A9/oV1a0L7WyWNa+Ovlz1R1mmyhO9V25HFU7EwOPU4x+Pegh1d8yuXq059N+ohSfpqv6tyn/mdp9pvynai8XnO4k/GfqRGhV38rI3hGyq/qGdepDiS8DZojnlgRPTov1uqi94d1ZRv/URHujlk9RT9zeGP2FCX+gfFeqvek2XuevJlAv3Bah7KnxutH1WD/PUPUT88/1M5XXGFg3qfG9am/QH26mOKwb3JcpO8/TbXxvX3z1ptejf52BLIat5rSa9Gs0l+f2icuU9lvmhpRPvO9rH333FU/dw0vXMVgZxd1pMbuXtOZoDD+APFmYP/XKi2ENkk2ly0gGph8S9IY7LuKaBXkwmfDMGJZhVOQP3/E2D0w/WoBVtDPN3jWJ/gXgf3hn2piQL6V/lGmM4nCelfWg+Kh5SaUH3k6A6aycbeq95lT4FNo8yonvEL8VFua5ztT7OPEr0ovlr+YBMpMZpUd+iMnbOiZEnGHZzrfhAixL2yT6u3N75K9yY+AbfiaEvPjO9BPrxO7WfNnVEk2ZckbcdliYd7ZHXG/A7Vez5OvGIK4h0l6e/zaJfnTNXLoD5HvQZ3P5sG3arwXuY1r6ogVJ9i9GfwT8Cy+KqjbpcsAcK5ChKfjGcEuBDCdyGXqsJ3L7lWGNhIVtELf9qVBm6bCe3NmXyvovw/daOux2qhL7r4la/LLHyvgDlMd03RZxhmVf1A0XYFnaJtG/ivxXm/KEPCwO5cV36L9eSf5LHVxW13+lfHw//GQMfJID6hb9VrdyVXwwvdH1aGMn07drpQ8bLP1kPf6Pcd8zBmxPfpbakymIU31gPvHZ6D+8ei7dG6k9QX9sNjMRim1IbUkt8ukhpH2E2ro9XoBV1AfmU9mM/lcSfWDlw1JfZ4wLflkBf+VjLc9FWEG8M3rsf/OpPW2iXSZoRwSvTigVpgyLv/JRPrbHurTc6sJyEWlxeBLCFMWdAfTPBzoOPE5GmaOtfJnmLYPAYn+NsjGmsrkXEq3lWZVjm2jxFEHW160FMhgufgFzY/7bJNw/gZM8fpf6WPjpQ5V5Wi4/DFx+rDsOqvxMrlh+nek5XKZjnqhnPtUAfTKf7IRtEZbHB0+TvtQ8jIXToS/+WrWbvizO8jsk0vFnD3xyRieUCi+29Cvrpd9v6VfVS3/U6pvpa3/uqKM+PkL6wL4i118eN+PaFKePgcdRRv8xaCfvAVvg9GYPI5S+om0/OyO8EPS4xfBbJEtFfhnrx/hx/njL4xohS5viYrgX6DiuId4NJbAOOmLtc8Ta6YjlmcdDjlhHHLFOOGJ56v4hR6zFcqyG9bAjlqdNzDpiHXXE8vRfxx2xPHXvaaueuh9U/+Vpq572dZ8jlmc5etqXZx3ytK9jjlh7HLE88ziofTnPPHr2Jwa1HAexLxefVzlhxTCo/RzPPuZif+LxUYc8/YSnXF72FZ9XOmHF8IAjlqfuPfsA++AZ9WdzcLgGwevFRrs3n9Prca7sIp6LMgzEPrMmdkZ4Ieh5OMMfF/xMrpaIK7OPcO+/7njajuFj788ovcnC73iPmfqMWc3p9XiEyg+oPbJ4dE0MOO96JsXhPleTIc63nkfy1fyM/AfK6A/x24L+h4CuSlm0BZ+WI9ZUTaypsNAXWj1U+y14jUetq8Vy/NLofDq0N66bNddCn1K2bhq+1xy52ruSmiNfLWRpU1wMPEeu5uJXCz4K66Aj1j5HrJ2OWHsdsQ47Yu1xxDrkiHWfI5anTcw6YcXnM5ywYjjuKNdKJ6wYjjlinXDE8qzbDzliefpCz/p4xBHLsxwfdsTytAlP3XvV7eCcR0+bOOqINah+wlOuJ0KfabFNO32696yP+x2xvPIYn1c5YXnKFcNDTljeeXwYnrMwNz5U82g2xufvxr5A82hYLyuMb/8Lj1cNA7HX1MTOCC8EPVY3/NT+spaIKzOPduc3Ltr33us+sj6j9CYLv+N5NDWnkppHqzlP9WQ1j8ZzZTiPtobicB7NZFDzaDXnRJ9cRn+Ir+aPeR6tl7n7liPWVE0sm0dT7aOaR+O9v8tFfnAejfef/xvsh/1KYq6taE92DHzDbTsRNyUwv302GHwQgv5qOP99PsTx/v2VIp39je/Q1jEN1oV5GGNz8v3H6Hxc/K4E84nyqX3cWLeGxorplifosFxSe7/5xhqcH+Xv+LqVy0RYaF/8HRLO4TbEO64vYyK/aj6Y2w5syyr4m3bZtsPwW2FhnuvM864gfkV66bHdncgoPfJTdUTNK/PtqeajhguwLG2T6Ffnhav6KkV76VFe1e+J9rg8xx0pkLcTSoVLe/wu4QVqrbFC+qt77AdN8HcNm8FXrac6i/0Pvo4FfUmqL9IW6Xl9Ar+X4/ZiXMig2jP8HvNXxufTYb8pK/i1fPC71JqX+aH4a33y/Fjky3Yfuv7OHQd277p+984Duw81SAI+KYOPoMcrAIqCScmHho/Q33zqcpv+nhI43XiOF2CH0POq2kxZb8urajUvWEmuqmH+2NtO1ePXySg98kNMk8d0PS3iDEtdGYBYlpavDLiQvO005Ql5qOsx8B162yeTJ0F5ubes9N4WuG2RnnXEth1Dj+XVKGuPht8KPdl/lrIPpRdlH5ZWlSvrv2y5prBS/qCM/hSfU1zOM4Nezpa/6Xr8OmXKG+UxXa8XcYalrutQV4fwVRnXkt9ZT3lCHuuFvPgO/c6V1MtDeSNdJ5QKI0rXFdI/fSQszFeF9N9r6fEirCpl3e3EipvH5nCxv6FOrIjhmvyXr715/uq5dLeSz8dRWhk/0dspIeVPCjN8r36DOiEl1W+o6S8my7SXKA+P0Fm38Z/1O4cLsHjG1+jvpPrLPhd5pPo5MWD93Uk21O+TaR5vfMZFOq5fNe1vSdn6xf3ymvU52S9XelH2zrvdMI71X9ZOvxux+t0/OwX2V9q/ny7767H/OVmmvFEe0/VaEcftetG40NJyu/4a8u+8koQ81O5udYFk9O8/nhgXcttUdVyoTojr1g96ZEzzLNsPMvoh6Ae9oUQ/KJXH1AlXakyUspsxIbvS/RTFefqjVkk+ZfKT4nM685OqC1gG1yXkWktY67pgXUtY6gpQZYMsc9UTgDF96qThtT3yWVuSz6nKz5kUh1+psO9SZbcuIQOm5wuV+dJH9Wt8+B3zUTJ385G/Rz5yAuKUj7w8/20S/WOr5tL9YcJHcv5TfYmaXwqV7kvwZcu99iWUXaT6EjXnek72JbrN9bCu1TWxhmXXsJad6zH6D/RprufPaHX7VNWTCUc+iHUD8Smqjx+h+jgNcWXqo9F/HOrjR0vUR6WbsUR+8DRpjkv55VRdWZugV7au2nG2dcOIweodXjncD79i+K2g60QnlAon/UqH+BXVG3Ep70W7Dz7lqc+45FvLlPfvO8Q6NdxJZAryM32gvzldlK1JNBOCRwxsP+uIjsvd3jN+GZm60XaLV/VmPdFW7Zdg+rECrKLTdq18+MT6z+UP6rRdVT/RhrYn8jpB6SYKZI/xIwXvO6FUGDF5rW6PluBbpDM8Rb9IZ4/1oDMec9XVGedhJOjxfGq+kb8QR9/I/q/ezszsb8v6P8NviTzU8X9qZ6zy/b3tjM0+nVF65IeYrOt1Io7913ABlqXl9nso3+Wi2mXuV5Udj3x7xyL1q/q1e8bKp7d5s+zT3fpLI+NzuKjbotPZi9Y83gf9pbEcs0w94/ZG/YZQTn/YHvGYU43L1NiW60xTYMbAJ9Ea/Rl53nvcZS5v9MDTGrhc0H+vojJNjUlVmRr9e6BMz0yUKfcDsExT47iUf2on6JV/UWuKqbFPb2PI8r7c8FtB+6FOKMfQ8q7GgMpXVe3LGu6nIUPz/CnRB/qb06m+7GQBj6K6x3a1lt5368sqmYpoq/ZlcZ6T5wLQFlP2qdomPiG8Zj+ww3W/EfS8BOv+5Jx9KNdv5P0BjM/z1ni7h9LNDRCP9Bfk/if2M/fmDFRZLC+QL4RyZaG+9Oj3+iDv3B1z5INYplu1lyT+64RS4e/UWmWF9G9WN85USH+uupmgQvrfUf34Cun/p2rbK6R/SO1/qpD+h9Q8TIX054wQfcX0T7P0M/XSf87Sb6yXfrul31Qv/e9a+s310r/O0m+pl/5rln5rvfSPWPqz66V/zNKfUy99Zunx5vMqbZOlP79e+obJuw1fCpkM3/zquUBfxa8irxZhVZQ9S8mO8rEf3wb8MI9FWNsqYo2IuDplcl4ozhfijydkYTlj2AV0veQ5hlknrPi82gkrhmOOck04YcWw21GutiPWpCPWciesGO5xlGuFI9aZjlhrBxRrpSPWekesDY5YHUesGUesjU5YMbzcUa5NTlgx3O8o12YnrBjudJTLq+2Iz1scsbY6Yp3tiNUYUCzr308IbJ6zagg+jQSf1HpKA3DUnJB9t8PzEDF0QpmQdd0H8vM0B57au4oy897VO2AO/E00B47pbT5H6Xosf1ZfdPNJE/hFN89j8y3bJtevJOTim2irfpmu5GlSPtrL5mR5C61/ZMS/E0qF88ucTIw6rjBWOR9lstCgd4jvdTKxqmNK95b3JUKWNsXFcDfQcVxDvBtKYB11xHrAEeuII9asI9ZOR6xDjlie+nrQEWuPI9ZhRyxP3Q+qfd3niLXPEev4gGJ52uoBRyxP3Xva135HrGOOWJ5tmmcd8tT9CSes+LzKCcs7jw85Yu1yxHrYCcvSe8k1qH0TT1/o2c/x9BOe/mtQ+4VWjuNhvu0GeO5xrDaE9QHlxHeI3woL65HXWA1lqDNWi8+8Z0nxUWPCjNJ3k2sszM1h5Pu/Ltn9ksN3XDl7R6DAR5tdUiDiNqLbXiBaJnAz+sfvt9E7lTXEjio9c9Ucn/jepiOW59MRPZqe3IJpWGqah6daqk6pjQs+jIXbptQBf5Zn/oy3E0qFyy39aL3036+2rVVIf1WPW5Ou73Fr0mU9bk26ssznAzUPPr26rCs0fK/PB9QBtKlPx1YJWdoijm10leCzSvBpi7gjjlgPOmLtccQ67Ih1yBFr1hFrpyPWfY5Y+xyxjg8olqetHnDE8tK9atcGxVY96+MJR6xBrY8POGJ51qFB1f1BRyxPP+HZ1nr6aE/de+prUO3Ls2/iWY6eun8i+ImHnLDi85gj1gpHrIkBxIrhDke52o5Ynro/Y0DlWumEFcM9jlieNrHaCSuGuxzl8ipHb7k8bXUQfWEM9zpiedlqDF7l6C3XIOrL21YnHbE8fbSn/3rYEcuz/7XfEctzTsGzT+45Vph1xOL+vc1d47oWrt/wESBG///R+lPNi8eu4fl0w0DsmpdEXpMRXgh6LYGPa0F+JldLxJW58PPzrWf9xT//1hs/lFF6k4Xf8VKoOgYkdaxRzaM3rlIXfuJRLDGgjfBloLj8azKoCz9rHhVzVRn9IX5b0L8Q6KqUhcLaXhPLLulU/fLTtd66BJ7xCDlbe20S/cfyCHUcmjpKeRzebU/kdYrSqSslYuA1xhg6QYdvUjA80/lSwQt9ItJ+CvK9f3q+rLzeac/NgvwsJzkZo0g3vN6Ped/80d9b+q9vfW3zXR9/bPbI18575C8ue/Uf/cazfuqDFzz75dd/9g1fuIrzPpSQXeVrZUG+GgX5KqObCYHNNp+6lNLyEYOyeb4AF9NxO7OK5OyEUmGibDvDbUnNNjNL9QOUXnpsR5eV9b0mj7qWAHWLbcRwSPtxvpbg63kdbBNdDHw5aJVrCb60bL7sqj9SppwRNzUH02O/aVm3T8O+sWwOF3Vrvh7Tohx81NuNq+bSfTPHVJ9gcflyu4PtSQzcflp6swem4bbI6Jv55GT0ydNr5mMuE3lO+ZlVwIP5xnBLgQytXIYeL2aVe7HWBJ2nZljYJ4/hivzX045boSf/eNJfqYvM1biF6bF/ch3QcPmdKehvSNCrIzGxPnFfRR3JyVjIe3uC9/ouvPnYWHXMOmMh72sSvDd04c1XVOAVdJa2x+OZruvxeKabejye6fl8mf3X80mcqMP1E/MxbWxTVOd+MP81fQ2DTOwXhyFdQ7xLtR3DIAfKdfXUnOybKsp+ZQHmSyfmMLeSf8soT51QKtxo6Yfqpb/HfBrvuUXZeItyJ5QKazBPFlQfzvBbJEtdn6i2pmP+eN/hsJClLeK4jKraHcYdccJSZT8IcsVw1BHrZY5Ynnnc6Yh1nyPWcUesA45Ynvo64Yj1ckes+x2x9jlieer+kCPWrCOWZx4fcsTa5Yj1cP5b5vMpbBsqtKWlP5/i8UxWj9/JtnuI+HH+uO1eImRRn0/xPK3io/oIGaXvJpfj51MGuZrotheIlgncjP7x+9X0TmUNsfHzKS4CpDPzGybsTigV1pc1P8NvBV3knVAqZKlqqb5qtLwvFbK0KS4G3tqzVPBZKvgorGOOWEcdsfY6Yu1zxDo+oFiHHLGOOGIdcMTa6Yh1vyOWZx3yLMcHHbH2OGKdcMTyrNue9uUpl2c5esrl6Sc8bcKzHO9zxPL09+ZXT9WUZtU+TSqPaknBsatrIk4T3Q0J0Rg3o3/8fpreFXV1LbDa4zPvnmB1srpVUfc6WzckeI2LdJYv64ovJdk7oVR4ZUZ4Jie+Q/xWWJjnOl1xZYZKL+qQS0vbFnH89fgywWeZ4NMWcUccsR50xNrjiHXYEeuQI9asI9ZOR6z7HbGOOWJ56n5QbfWEI9Y+RyxP+/KUy7McPeXy9KueNuFZjvc5Ynnq/viAYnn6iQOOWF66j8+jTlgxeNrqoPYnPLEW+wCLfYB++tXFPsBiH2CxD7DYB+iG5amvQbXVBxyxPPU1qH7ioCOWZx0a1LZjUPu+g2pfnv1oz3L01P0TwU885Ih1jxNWfN7giOU1fx+fO05YMdzhiHWvE1Z8XuGIdcaAytUZULlWO2HF4GkTnuU45og14YjVdsTy0lcMdzrKNeOINai2ulgfT08eB9W+FtuhRbtXct3tKJdnH9OzHCedsGK4y1Euz3bbs2576WuQ6+PDjlg7HbH2O2J5rlt5zk94zpvMOmLZXAef9PKXeae4xz2BP2p77lrwMgvzsUdrYmeEF/L0+A7xxwU/k6sl4sqcMHfeHz3wy8/cdOfzM0pvsvC7IcCP/8YEvdq7aLpC31BBVz+sTpjDS8NjwK/pRykO962aDOqEubGa8pXRH+K3BT2fMFe2LBTW9ppYdsIc9gus7pyqPb6nik8KS506Z/Smj2FBj3hNov9E7pPi3xvXzOenPq8L4t0Q0cdwff47LuLYV2G5VrDvZllfxf6opt89uTe6Rfw4f1auKd+o6gef9tVLXesHVh/bnSVV251W6Ml2spReMH9clmNCljbFxcD6V23SmODz3YKF9T/1/UOZclV80B8uJT5LHfmgL2gRn5YjH8S6gfiMOvJBLDvdjfsRMXRCqfDMHvtIq9SpbRYsDsdjbFN4WhzbAZ6uyGWHJ5txXxVPOkN75tCgv1EPUZZD03O4TGdhQvAp019N1cEhIb/lDWXG0xMnJzVPPEkQ7Qv7r0j/dDiZa8VkcR6L9tI2hewx8EmERr8m56FuGK1gh/IkQsPqsZ89UDZe1o4tr5Hfb9S0Y+4bLxP5sLgJkQ/l63ksgv55GcVh2z9BcegHbwM6xIxBje35lMThRL5QvqESfFKfqw4JPn3sPy8r08Yg/qnuP/fYpxzPwkJbUONfrldjIo792HBIj6XZj31/7sc8+2TRB184OV/2fvRZsHx6nLsa79ZOPYfaqVGIU+2UycG3iW+GdupiaqcwPZcv1yVsC2MomsMYBlx1SirLtz2XSZ3yq/K8NCEz2lwIC22e21ajv4raVj7huBPKBdW2GhbXKaTrkW/pU7IMvxUW1u86/muc+BXVz/jOTibNP9G/cnbHrot37Dt4+N7dQwgdFvaYUCuIiu+yMD/3GNegd0x3Gf29XaQLAjvG99gbq9xj4h489piq9uBN5lijrmjN4TIdy4PlsZrisOezBnhzuSo+Jv+QoF9GWOMinem+G7+GSMct64hI17GHD9/6jb95d/uRY0df/bvHn3HOih2/+cjHvvRPf/6Bt7e/8ndv2/+xp7PMQchctGpg8erXZOd3PDMz7og1IbBMN214X8HmV5T1VobfCj3VsZPeqk38OH+c90khS1vEsQ+aFHwmBR+FtcQJK4ZbF7EWsRaxFrFOAxbPPqCvtThsp67Jf21kkjozVZ2rviQhH6Y3ujKHhtZsb0rfGWT4XoeGThC/Ir302H4vS7WniGnyqPaUd2rZyGm4AMvSNon+l2k2wcOuo87eRLMJqh9UppwRtx0W5t3K51TbPY6hcNbhrZOaZ9HdQjzrYPQrYdbhbZPzZVazDqFAB2hDIeg8jYAMIVSvrzEPH183xwfzZXkwXJZZzUrYPURq9qhBcWgLPNNZVEa/Q2XUgDhVRnz/k9H/5+Rcut+nmSFMX+aeQsWPbWi4gL5B8hn9H8PMkO3IUPKNFvBTM2UxvKSA358Cvy05P2V36EcNB/PSCaXCCmV3WJ/Z7tQseuoAxW52yraIdsq7cIYEFuqUZwMt/XDQ9d7wmkT/IVHmZew8Bi5Xo/9wyXJ18ieyXFFXXK5qhxPSl1lNUbux1MpRk7CaAgt1yuXarS4bHtetv0mUK7a7DSEXl6vR/23JcrXnfpQr6orLVbXXSF9m1xximtxqtXCE4tAnMh/lv1HfZcpc3SnNZf6oKHPu+7Nf6Na+hDB/Vtl2w+ezytcfmj2wO59WDhRS08DxeVmBGMtF+pDAwjQp94kT5UV3KQwHPV3J7tPovyJUnnK/MShTtvzYUKFmlSm9MGH4raC7B51QKmRl3RpP9aWqWapLfhpMNYbLCsTIRPrQBcv+xis1ytxWnfJuSlXWuyhqOfA2O6Rv5CMJ1XKUXT83ejVCxl6P0av8T1Acphst4IMtGuqLWzSjH4W8plo0492PFg11xC1a2Rl0o1cjbhzV8y13k5QPjFMzSWWroblXdnWYVo2sVH4bPeSX7Qv1O0lxRTMpIcy3BaPrxygY88O2oG6DV7MpRq9uD8f1cu61YhPKdoLlzysx3XpdKVvAkeNbC/ZfIG5qBKT2FaIN86jc6M8RPsAwl3XJWxl/h90ck0ftaWN/p75LVfZodD3a47LT7ZvY/6Cd8d48tf+OR36ob9zfo/TLslb9Bg/T435TlP2ZYGdfXDefX7c9sUW2++xTaLsmT8p2F/dszwXUQ9k922wPhlvk+5TNoy1N0qx6H2773ZwRnsmM7xB/kG/7jeEeoOO4hng3lMA65ojleavuXkesfY5YnrfXemJ53nrqeQvxoN7Q63kT7h5HLM/66HkLsad9eerrsCOWp30N6m3lnjYxqDdAe9Ztz/roWYcedMTyrI9PBPu6zxHLsw/A1/hhf5mv8au6cwTTl1nVSt1YrfLY52v8TMRNRHdDQjTGzegfv99E7xqCFoMVEw4zWFVq1UKpVg3zixZ2cQiPQ71r898+3p79uozwQtBDMcMf5Nuzs7Dwc6NBuQF1UG/rPeyI5Xm78awj1k5HrMWbpU+frT4Rbpb29DlHHbGeCLr3vA3aM4+eN0t7YnnW7QOOWF66j8+jTlgxeNrqoPYBPLEGtd321L1nH8DTR3v2JwbVVhfb7dPXpi32yathLfbJT599LfYLT599DWK/MAZPfQ2qrT7giOWpL0+f46n7g45YnnXIs+0YVB89qG2aZx49+76e5eip+yeCn3jIEeseR6w7nLDi8wYnrBjudZTLc33IU1+TjlhnOGKtdsSaccKKwdMmVjhieek+Bq+67VkfPetQfO44YcXgVR9jeLzbV3wec8SacMRqO2J51sc7HeWaccTy8tExDKrdD2oeH+9trbdci32T7/62I4a7HeXy7E946surTx7DXY5yeba1nvXRcwwzqG3Hw45YOx2x9jtiea5bec4zec5/zTpiFW0Zx/2+uEeYj7g3+k/l39P3eG3BI328+uyRjPBCnh7fIf644NfrlZu/95Zrl33kvc8odWVkDEOAH/+pT2VTh3DW/DT5Jwf8ys2fLKM/xG8Les8rN6+tiVXmys1+7+m3umyfjH82r8tRDvt0/1TLYp+hf24AZFmf//0vAyCLffL/ZSGL8et2RInZqpI9dWAs56vqZz9Dgk8fvw8ZLevvvxu+D4mBDxzupd1fxFrEKsLiIyQMX/0aH37HfNRxFN2uqFqxYi4Npis6ePfF+S8fFPnZFXPpVuXP6gg2lFH5gSzob9y43g8DLtLwFVVGvy6XKZYFX1E1THnGfLKMWJ5Nka8YuP9u9J1chh6vupNXVPHxM2hz7Otr8i19EuTpumKv2hVVbImoFUTFd1mYn3uMa9A7pruU/q5zRVXNnvwGs4oNItLiOoDNhyDNQByWJoeGkB8v56xyRRWWR4ficPQxA7y5XFuCj8k/JOhHCUuNGEz33fg1QnHPg8sV03Xs4dnvadx65zv/fXbssle848gn/vrqw8umd7x3w4/92q3ve92Gz7/4R1nmIGTmcvRobTwvZ+zjhXpTZb3V6bpQT123ZmnbIo6/Dq96oBxirXXEmnbEOssRa8oJK4ZbF7EWsZ7AWGqEUXSAZgwvyn/V7EeD5Ks6c4Ppja7MYYQ1/fpY2XbE8L0OI1Sz0KnDCNV1mm2Ki4HtQ7VX44LPItYi1unCSvUTy9RPxQf9gdWrU+2vcIyJszKvXKF5Fl2bw7MyRv9XMCvzYyvmy4xy4cyp0gGvSqk89XhY9FgcJ1W5SknZFdLfnv+yXWHelS2UvWbtESqjBsSpMro9/+X7Pv4QyugNNHOGs/m8CwbH2il+bEPDgh7x2IbeCDNnqSu8hgv4Fc0kXl7A7xeB3ym4wmtK2R3W514PT0utJnezRb4SCHXM48EhwQf1XeZKIKVfnun9DWEP3Adk2yiST+nN+Uqg0QIxJkX6kMDCNKks4cRkmSuBcHqIVW707xIqTxVZDItXAn3XXQl0aYEYmUgfumDZ392uBOJWJaVipSrzVkWtCq+tG/17hUmX8ZghLPQsqRk3lCd1JZK6gmC4gE/RJXfcohn9+0u2aMa7Hy0a6ohbNDVDoHroRt/tWgeuanwJM8ahjvl6qm7VsOyVQNxTU/bSSOQ3pR9lX1huyyhOjdKVLdi7fvSqMT9sC6myjYF10xb0WN48GsJvd9hOsO7xTX5lL7lUtoA90VcWrHcjLtoCrz8vBSzVm+NrVYz+H4UPMMxWl7yxztW+N/TjvL8Iuxh8XRDKjqtFhs2YPdrjqLJHzD/bYyqvMZTpbfNe1hiUzS2lOLWyV9ZuUtep4B4L23+h6qa14dZdm6J8dEKpMJ0RnsmM7xC/FRbWwTrdNXW9mPIllvflQpY2xcXA372qa8mWCz4K65gj1lFHrL2OWPscsY4PKNYhR6wjjlgHHLF2OmLd74jlWYc8y/FBR6w9jlgnHLE867anfXnWIU+/+kTQ/X2OWJ4++kD+a31P7M/wdReq7zCV4IPpp0pgpcY0Ko99vu7CRFxHdDckRGPcjP7x+3X0riFoMahbLctMHaQ2F6hPlk7V7Zl97GI/lBGeyYnvEH+Qu9hZWDjcGZSmYFCb9MOOWJ5doFlHrMXu5+PDVhe7n9WwFruf1bA8u59PhKkLz7p9wBHLS/fxedQJKwZPWx3UPoAn1mK7vdhuf7e0HYvt9mK7vdhuPz51P6i2+oAjlqe+PH2Op+4POmJ51iHPdntQffSg9ic88+jZ9/UsR0/dPxH8xEOOWF5bPuLzBkcsr3ny+NxxworhDkese52w4vMKR6wzHLFWO2LNOGHF8ETQ/Zgj1oQjVtsRy0tfMdzpKNeMI5ZXHYphUO1+UPP4ePeF3nItth3f/W1HDHc7yuXZl/PU16QTVgx3Ocrl2dZ61kcvfQ1y2/GwI9ZOR6z9jlieazqe8wCe8xOzjlg2p8DHGN+cf5PU4/GPr+DD9wwDsWsesvOKjPBCnh7fIf644GdyqYPcyhwb/4X2je+796v//a0ZpTdZ+N0Q4KM/RHq1F890heOLCrp6ufo8y3irY+P5M0Pcg2kyqGPjJ2rKV0Z/iN8W9HxsfNmyUFjX1cSyY+PV1QQTYWFdYntQn/W1EjIPCT58bPwL87qsjkc/VbLYPuIdAyCLHRv/0tMoSx+v0yh9+Bj7vpo+/uS+4rKfXab8sKqLfDhUL/V6EWsR61Rgpfo9Zeqn4qPaFP5UOAY8cOpHV86lwXRFByzdnv82if65q+bSvSrHVEdj8J499ilZmH+UArezlh6PakcaPqrd6F8LvpyPah+lPGM+WUYsT3WNTgx8VLvRv576zDUPIZZHtfORI+rz9JQfTl2Xo8qvxzxUPjycD1CbgTg+kHojxC2luE0Ql1HcZoibprgtEKfqooUG/Y06irJMnTmHy3SBeGIZdigO28YZiuvDlSznl/FJiD/oV7LwnNWgXF133BFrryPWUUesBx2xPK/6Ozagcs06Yu10xHrIEWuXI9bDjlie+jriiOVZH084Ynnavacv9CxHz2tPPX2Op03c54jlqfs9AyrX/Y5Ynjbh2TfxbLc9y3FQ/ZenfXnWx0H10Z5YnvZ1wBHLdG/jdHVRVEZxyGc4wQfTDxeki884H8XjJqOJoccxfukTffmypKX1+CUvS1LlU/WyJD66tezYtKpcjkfAmIjbiG57gWiZwM3oH7/fRu8aghax1SmRPEVV9YZaTJ+6CXe0Rz6jgk+3M/1XrtI81Zn+WD35jPS1MMW6Bp7tJObR8PjTbRmdxfDS/Jd1tinXTaxmfELqEpBDYfLUs3L7qRvfU9Vd6TJ1arHijbrk+rysoqzdTl9eSrKifBMVZb3mFMu6RMg6EnpqaipPX2cUNwNxayluI8TxNPQmiDuL4nD6mqfE1fS1xW2FOF42OhvixinuHIhjX3guxPH9NOdB3Ag8c1BT6VZe8ffRtXO4TIfPRb4I63rqpGf0PezL1VI/yl20TQT9GC4v8UnPRv+8hB9b1iVvVesPb0dR22vUNgirs2orkdF9t588bnlqEz3qSbVnfPJ4N7tJnfSMS7S8fHumwFV2bvRrAatBGPHZtvs1if6WhD2uEzKkTv6fFvTrgMbkmSAZMO2ESGenKyp7NLoe7XFC2SPmh+1xPcQ1BD3r5ixBvx5ouA+Fd52upTg8zZLbFeR7Jsj+jWXz6SZBnqzg12TldywrYvG2iOWOfBDrFuKD9R377LPk51EnjbCw7pveeWvdf4N++gG6MQXTL6f0J4d/UM8+M12c3nQ5QX8rf47bx/kzOZVPpF9TkM/jIOejUB9CmF9GJleP9a6t6h36Pq53ayGuIei53ql6in7HdNIOC+skf+Kn2hS0SfbJpqPhoMvA8JpE/yNQBqk7tM4k2ccqyl6232RpY1n8fG4ME2FhG7OOeKo2TJVVOxS3FYylxnjsL7EcG0G3h0xvNtEMaf/M7ecjUFb/MK0xQ4EM7QKZhwvo15IMRv8zwl5SfkC1u+wHfh4wbctsWcypAsw3Jfoaqp5i/4Pr9QZBj+Vl8ig73UBxKDu3i+uBP9NOEH+MQztnviEhL7ep3eTl9sbi3g3t1Vvy5xHCq+irG6myOlfIW7as2on8MZala4aF9piqI6iPd6zSmEsqYr5LtOmqr3Ib4L+7oD8SA/dHYmC/jD4D6+Es9UlQ/kmS3+z290R9VG29YfXW1md/q9p6HNeVaeuRnn2CGq+gLaXaGx4PYv3jeTE1Fi3blk5AXleNd88v4u4IOr9FfpjL3ejfn/DDagyX0nlqHKT8MOp8PcUp/6ns0ej6YY+eY75ufo/tEX3dOorD+jxNfLrZTcoecd5ghPp200KeCZGPiZr5NvpO/vdwAb3hNYn+U4l+z4yQIfV53kZBPyNkniAZMC3zxnqJOrmc8mP0f1/SH1u59OMmSNQb239KRzGwTjcJetSV6aRN9Khf5atnKA7tbz3JoPxZ2bphaaMePjI2H7dsG5AJLDUfyb7a6L9asc+csvFu9ZLnhLH+cx8U01nZKFs1un7YKuaHbbUDcaoOsm5mBH0HaNhXo2+Ypji0VePZrS/we2RfyqenyrZs30fdrsO+XY3lUnKtFXK1Rfq1CT4TPfKZEHzGRbqs4Nf48Dvmo2RWfRvOjyqfdSXzs47yw1f1qF/j0y0/SuZuc6qrVs+lKfJtmJbbO6N/8uq5dGfmz2pOlO2mrO3y517rQAfKZ18D+Q+hH33OsOR09zm5X4l9zjJzhmh72HYaTSAZ+6EvrM+sr5QfjKHM+AXrhOlAzQ/zFUlob2uJj9f86yNj3eVXN6GVtQ+eiynbB0Cfa9ghPL76AGwLMxDHfYDUHJbqkyp/yWWM/hXLhdesjP45uU9VfUdlBym76Qh6zBev36JtdChOjStP9ThnUOxmPcWpvmNZu0nNFWIbbe13qp9rz6qskb5RgLOBcNjuRuE9puP+psUFoFd2x2UxXEBveDz2vhnqSmouQWHymHNjFxlmSAajv03IkNJ/DOPiXZb/jhB+xXrTzAjP5MF3iN8K2j46oVTIWH/GT9lBDGovnaVVcwpcn9T8xCbBR2GNOWJh37KH8trE+sCg9hZ2KG4L0F9HcVsh7hbA4NCgvzE/0a4/Nz2Hy3QsK5bXZsBnG5sRaWcE9umqDzP1+CXrA/ukGKrWhw48L9aHhccvDFp96ECcya10FEJpHZWqL1g2FfQ/U7a+GL5XfVG2p+qL5W9zPX6dOGc7Ghb6Kpy7Qd0hn40kQ6/lx3sLEPtUl1/N/QXJ8lP9b8/y6wBGlfJT60E8j9IJC/PTEflRe5GNLtXPK1NOik9HyKzmGHHu700097cR4tQcEc/9Gf3bYO7vzTT3h2OgTpgfh7aF3zhwno2ux7FjQ40dO0DAY8cZTByKy5r1h/To/7jM0E/wXB7OP3WIj5oXKzv/hPsMbh7T8meAe5ZIy3Ub6TcKOYze6hweE4Y0lrZJ9O+CsRQfE6ZsFuXi+RSj/+3EfIrxDSGUWhvdIujRv5g8E2GhnrdQXFGf3rBDWNhnsPxZXJV2QdUJzA/XCewrNQQ96+ZsQY/fNrHd47dNGwmL61cMlwuslKwbepCVyxHL6mzCMlq0S8wP26XR/7mwS1X+pvN+lD+22WXKX40FyuqUxzSox80U14G4TcRH+d6i9Q22FfQhb6L2C4+F5zWoFYInvmN/j+mNzsrf5so+BuXPe3WnQE7l9y8vwPxEwtepPKjjX43+jFCcZ5RHre+dkUiH89UjglfHHr6ZDoZn3+wtFbwMt0m0nwE97Z/WsmQsT5cwHhbqOaN8roT3Vfq8GeGFoPv0ht8KC3VRp0+/kvgV2b3lb1U9fhuwT492hH161B3ysfJS3y5hH/hR6gOrOpb6zsPovwx94C8WYIZQvb+G8vxsaz5uqi6GsLDuqnJDu7Z8qrq7kuIw3TKKwzLhb+ZXQX4agp73Thn9v0PdTH3LZHL1uJ/0S6pdXAUU3C6uhriGoOeyWCPo8doQ00mb6LlciuwLy5r74aaj4aDLgL/5MPoluRDqWyb8lnYVyT5eUXb1HRbXY64bXI/VcdAtgZuR/GiXiLEj/20S/QTohNvWbvsK2Sa6feds8kyEhTrntX5Mh2cEGHYgun6sy2J+uL7gtzlq/ZN1o+xEfU+p9qotozi0R54rwT4angswm0dgvP2WuXJk3R/s/sv/+sl/+iQfEx0gr6M94P/4U5tTr7nlqu39wv/Lpf/81Q/82R0/2S/8vx+55tKh3/6JDf3C/9mvXn3hK9Zs+mI3/GjHl+RM1Hctlq7Hq11KH8Nl+K2wsF7X6bulfMy3Bct/o+2br82Pu7pydseui3fsO3j43t3oxdgTsVYQFd9lYX7uMa5B7zL6e4jSbRfpgsCO8VZyU/S+E0qF5apHaYF7+6gbi8OeE5YmB7XaZDJHK70CrJTpWB4sjxUUh16UR2iqhQlC/iFBP0lYbZHOdN+Nn2oNlxFGqiVXLR635BdDS75hzfx8LqN8o/29kGQcIrkCpWXbXiZwxwv4xtDjpU1TZT2P4beC1ncnlApZqjekTn2p5nm4n2BcJgnVaJAWA1prKKBTJXq5SMfB0o0XYMYwEhZaagUtj5YtVXvXIlnqlmqD+HH+2KJT5/aghdwKdEXWo9qtRaxFrCpY1goY7YHc88fWY3f+PBG0r8HnISHLUEIWTM91BM/55LNxlog8WNxwIm5pIm4kEddKxPHZkhiHY+cbKG5cYMZ8/eWa+XTsi9VvCAv9XAxlxtbY+lgPUo2feQ/AZBesawhLnQlkWFNdsK4jLEzPcynLu2BdS1iYfjlhreiC9SLCUlfp8lmlmK7MvDj2lCu0TaWv0jN8r3nxsvOxlveVQpY2xcXAfk/N464UfBaxFrFOFxaPdg1f/Roffsd80B/wKBbb2nl7nArWO4vWUG/Pf5tE/6/QL3gz9QvU2qJaJ8noWfkLfJfqM/D6Vr/0zO165sgH424gnqsIC/Ucw+35r1pzWkXp1LqK+Xheq0F6xChaZ8RxXZENvnONzlvRWeN83qzRfxJs8N2JvinbIF9tj3EZ5QXplH1imd1O9Cb3sKBHPF53/32xrpRRetQVysV7Hoz+jxLrMsq/pc6fVbao2m6l01WEpc4FxvzwupTSqVp7ZZ2+L7FW1xDp1djjNopTZ3bz2CMLC9dU8DzvSYrDs6anKA7n+pdTHI49uF+F3y9wO8Hr0SHMH3s0SQ8fyd+PBF1fOqFcUNeDFvlW1LXSPZ8HjvbKZ4yrq0x4fIVlpMpsjOJwjXCE4rA8TdejoZzvi+H2/Jd936cT9Vn569Q+iG5r77yHCevwGorDdOwH1hBffFbnLqJcL85/+dzFfwQ9pPZBmFw9ruuO9vtM125nnZhO1De17FuVn0adsm81HQ0LesRrEv2XE74VfTOf6ZpVlL3sHiGsU+9M9E25fV+Z4Mlpkc9wqNZv+UaifVf9cZSL23ej/2bCHyhdptr31N4dlEfpdDXFqX6Bqp9G14+z90/lPiXu02P94XkgrBts/2q+qaz9ow3ZeK/uPoGf/tMLtn/x2n85q84+AZxHtXTWb+Ar1TuhVPh/UH4Lai7L8FskS0V+J+ey1F0ImD/e4zlaj98fZ5Qe+SFmi/iN1ePX4JVVLpv4z/q2wwWycJ/b6LfANeJZmN/XLNqDFAPPv2BcQ7wbOk1YauyCesT9UutyXSj7j/86oVR4Kvf3DQOxa9rCzWXrluG3Qk+2frJuqb2J6m4lZUd8nwmW1x1A12vZnxhQrH2OWPc5Yt3viOWpr0OOWEccsQ44Yu10xPLM49EBlWuvI5ZnffQsx1lHLM86dNwRy7McPW31QUcsT/s65oj1ckcsT7sfVJ/jmceHHLF2OWI97IjlqS/PvomnfQ1qv9DT7ge1L7fHEeuwI9YToS83qHbv2TdZbNOqYQ1qX25QfaFnX87TF3qWo6e+BrX/tdsRa1D7X/sdsTzrtmcd8tSXZzvkWYcGVfee/stzXm5Q54Y87cuz7zuofcxBbDvic8sJKwZrOyYKsPFZrY22EnwyIXND8MH17vH8Ha4VGc5IWKiLCutQpc8+NvwWyVKRX5YqH3UPkuV9mZClLeK4rFLrlMhHYTUdsXjvRVNgqXW/jNIjvdLXWJjbc5l/MXvJ7pccvuPK2TsChSb9fUmBiDcR3XUFojUEbkb/+P1N9K4haBF7IiwsmuECuQPg4TsuJkzfTPDJeuSTCT7jIh1XbTSdClXt3LJV2/BbYWGe61RtZapKL5b3lpClTXEx3At0dVwvxh10xDrkiHXcEWunI9ZeR6yjjlhHHLFOOGIdc8Ta44jlWY6e+vK01VlHLE9b3eeINah+wrM+eup+UG31AUcsT5vwtFVPfd3viOXpoz37AA86Ynm2HZ51aFDt64ngv/rRDllfHo8Wwc9en7d2Ps8lENegtBnwbBL9e9bOpbt87XzeGfC25xHCy0KlMc35GeGFoMdQht8iWSryOzmGGiJ+nD8eQzWELG2Ki+FuoOO4hniXwjrqiPWAI9YRR6xZR6ydjlgPOmLtccQ67Ih1yBFrUMvR01Y966OnXHsdsfY5Yh13xPK0if2OWJ42ccwRy1Nfnv7LU64Tjlie5egp16C2HZ7l6Kl7z7rtmceHHLF2OWI97Ijlqa9Bbbc963Y/2lp1RNEI8VFjn6EEH0zP4yJMl+W/PR6vW/q4dnvXCgvzXIFf8nhdpRdeU8S0bYqLgT/tVXwywScTWCm5HJemTcRtRLe9QLRM4Gb0j99vo3dKFYitTnwaEbwspFTbLkgfw3iCjzJ7m4YZDbr68fJ51eqH6S3uVJ2Sy3pV00kxvDT/5ZPB/jifQsKTQxqCH2KVcS01l+xL78bhJfteXYtask+5lmEhC9tDDD8EdBzXEO9SttVwxHJqCpaYPpaISKUr1iPaFd9EjidsVL2J3N5VvYkcbczkVnWZt8VUrcuYfqgAS518HcNtEI/0j+Z1uccyPU+VKdvLcE3ssvU7dXIb133evtQJ6XDrpSc+8gtv+dR5VeuR0S8V9Gp7j+mq5ukz54wDj0C8LU5tA7M49MEmQ0x/Hsm3tKZ8ZfSH+Mo/cterbFlMBd3OhLB4axF2Nwfz1qIYnkd/L95aNJ+O5cHyeLzeWjQi0nXs4XM/8caXtd/xU2/ubPvg14Yve+2jL/7K5Uue8YkPnjjzTx7+xucfez3LHITMXI7qRqEytToG7sm0HbGmBJbpBu8WqGDzK8t6K8NvhZ7q2Elvpe5hwPxx3lcIWdoijn1Q1fun1T3NHlgNR6ymI9YSJ6wYbl3EWsRaxFrEKollcdjeT1Ectp98n06/Z+v6OFk+XrbdPV2T5Za/umfuZpQe+akJeJ5dUG2m2cZwAZal5Xvnn5ef/dsmuhjYrtWMH74z/cR3F9GZwjy2Ub8hpPt6vEiE5XOq7R7HH7hp8ep1mifOMmPa2/Nfnpl6/7q5dNeumy8zlivOrJgOlJ30OAs1pmZWlgC25aEG9rg6gxrzxf0w9R0ozshYHttEj7pTtrQU8tOD/zojtaIS8/IispEmxLFdYn74bol3gY3syJ9VPcDxXJHfSdUb03/Rue1Nks/oX5rLhOe2K/mWFfBDfSi/yPzuBn5b4C7AELTP6NFuVyq7RX/Idqtm6pT/NHo1a6o+PG2HhXWgzAI52sH2AlmL2hOccUf6w6LMy9o5l6vRHy1Zrk7+SJYr6qpMuarZ7bLlyu0QlmuLsLqtwpUpV5SP+wlG/4pEuao2TrVB3Mb9SMlyNV32o1xRV2XKVfUXypYrr3piufJdqMpHY1mXKVfMD/too39dolzr+uHXD4Afxv4ml6uqM0jP5Zry28oPY5nzees8f4t8qvpo1S6nfLTRv1mUOY8p2S8Uyaf0FvNsY9p8FeX6Q7MHdufLKIFCatkjPk8WiHGGSB8SWJgmlSVcGGKVG6/hoKfnWeVG/+tC5axClqfMELtmlSm9EGf4XkPssvu+1JCXq1lqOFx2KO9oqjE8r0CMTKQPXbDsb9yDhcXNvfpUT4DTxn/mkcv2BIz+PYkWIzUyC2GhR1G3V+NojUf3mIcpisN0ywr4lO2hGP0flWzJ7F0/WjLUEbdkZVeKjF7NTOLqGPdQ1MpKamaybDVP3caEo4SikTLipvadpI6VwXJTo9IlFFc0MxdCX3qr41VHl6oupUaXKdtB3bTDQjtJzcixXKqJRT/BtqDqP86s4e1KiGtpYjCf0wzzm2wLvF/M6D8JMyqfotsR2Zbs3T8n6LKCXyUzymPvWoK+IeiN96igtzg8+QvLCGlQX4jVgnik/ycqE9x/aOnbgj/OToQCuYtONmOshniHdvPZdfPzUHOfbTYa5o++7bfM/rnfuvD871/2gq0v73YrXF38Ze/7nef/3b/t21rn1jl1jFhZey3aoxnDC/PfHmeeh9Seu1A+fVZmb2bN/YbfLKMnxG8F3ffohFLhZDd6hPgV+foebw/8zzj0stt3i2aIUXfIh/ddNkQa9DuMEdNftX5+PmoOP/6zRxv8DzWrgDP6w9NzuJh37G+qYV6T6Mem59K18mf1jYjpC8cGS0W8/W36HhK0+Mx/q1ksHmpZeQ0X5JVXL4x+Ks9f5De9RmOWPerD6M8ATL7VVd0QmeofpW7ZQ3nUia9jlE7N4AbxTpVPRrQoQwwvFDIV/d0SOEUyjAgctRefZ6TVLCjWG+7vqRU4rFPYZvU47VH524uM4jBvNwEdhwb9jTJHjC9TnzEILKUf3uPv0Xbb+yXwnvnyvMcw0XKfH2XspT/M/YslQgb7e2lC/oxw1Ap66kiguvJmQt5+7oiI4eb8t8c2b123VexnlmjzUqvYRv8caPOeXbLNszjut8XwAnjHPp37QYgRA0/3mo8cBnykGaE8Gf2lom1TPsSwYt4vI32OQFyqHWkS/W7Q5xWkT9QXH1vMfjzA36MgC9LG8MICHVwHcjx/upgXjlOL8hgxbpjWdCgD0jFG3XZN9a+47pbpX6m5kpEED/bHRW232cZYl3h1G3YQ74YE/UhBfoPg3eqCq3YpKP/eorhMxLHvwfyWnW9Ev/XMRH3Jwvx8jVK+RhL5ykQ6ruco+9KE7Ep/6D/qziH86Ge++fGfOH7mF/o1R/EDv3jkx8cvfMc7+4X/trEPP/cPf3HkRVXmQKyc1a4ati313WAMt0A80h/Ly6PHOYbA+VF+IzU+47lQlv+6AvkfAf/9INULNT5Rdaao/V1SUhajf4UY16W+9exx7r2p5t7Rr3F/V/lbdRym0XcbW/IORvSvZXYzoE65T2M6Gg4huUuF7eE1UAa8a0D5ZovDvLNfVOsGai7R6likeSvVq5r926WqH2GBv6fHPLI9YB4tbpRkwjgsS57vx6DGkJbXKPNvlPhGX/kHrq9qXiXVX1T1zvAHrd6Z7bfDwnJheytrw0X9OcUP9YBttdlw0Zw81mkcc72dxgjDEKfmtNifGv37wLe/k3w76pjtQfkJliWE9Npsaiw/LtJZufT47f0SLF+UE98hvjoroc5cveqbpubqa/YTmtzGIj9VDpNB61TN5/NYUc33pMZJKX+i6h/XTTWPkNrBn6p/OGdept9UtGekaD7j/VC3Pp3oNxX1jUIot3cm5ftQVqX7UYpTY397HkvwUXKlbulScqFPxrTMu1seyrZVTn3EJaqtwjIp89VK6vYudXMY7o3gOoL7cXjXadm2bZTiVBvfrW37dEEbhflQO5nVlj9s397e4/j2mVtes2bd+/eP92v8uaS57uc677j9yirjT+VXhggX9cDz7TFcn/+WWeeu2XaWPmOM285e17nLtp2qv85tAc6z8JeNag5mRPA5VVhqbMJlWbOfULofxHsWatpOcs+Cat/U+IrHjdj+sP57uZpiELGw/qf6x2XKVfFRffp+r93xmttSRz6IdQPx4Xlr9VuWjzprT63L4vhtav0cLpax+sImhqL5sO9bP5fujPXzaUz2VUAzQ/toMM8V6nJLjcktqLkPtlvVD1T7Ptk+sG8zQnH4uQbuheCg5lOMLvJ78fo5XKazgLosc3Yr7zPNCI/njo1+K5UXr8V3Qrmg5o4N6/FkC3XK+w0lyluVceqMSx7bpMamak5O+coi/4b4yifdRvioj9QamcqzpcW195TvYttH+meBX7qC/KEa0yofbO+7zaOn1rgt7YhIV6EejLE9Y1D2zPVA3fjMvk3VA/z+h30ifjLH4xkMqo6YHqr4xCsK2jXjgWURA4/51Lo7tpeWv7p7iDPANJks7ygXnweK9Ym/66i5p/ak7tTeEuxv8dyb0b9o/XwctQdGjTeMXu2dbwi+6juLsYpYI4S1tAcsnLdg+qU15VJYw4TVEliq3x7L7tq8bE7lOvNu6ivUHBeetnXmB6E9uIv6Vqd6nXlvzn9xnfn0rTPfD2VwOteZf5rq1RN1nblKP3lxnXlhuZzOdeafLmiPuq0z/xz15+quM/8P8O3/F/n2xXXm74TFdebFdeYQqq8zvxvq1l8k+k2L68wLffLiOvMc/XfrOvNfFLRRmI8668zW9v0f+0x0XOKPBAA=",
-      "debug_symbols": "tb3fruy6dWf9Lr7Ohcj5j8yrNBqBk3Y3DBh24Dgf8CHIu3dxSuSovU8Xl1bVPjc+w/ZZc0iU+JNEUaz/+sP/+tO//uf/+Zc///V//+0//vDP/+O//vCvf//zX/7y5//zL3/527/98R9//ttfH//rf/3hGP9RSv/DP8s//aHUx3+18c9y/bNe/5Trn3r9065/+vXPuP7Zrn/2859y1ZOrnlz15KonVz256slVT656ctWTq55e9fSqp1c9verpVU+venrV06ueXvX0qmdXPbvq2VXPrnp21bOrnl317KpnVz276vlVz696ftXzq55f9fyq51c9v+r5Vc+venHVi6teXPXiqhdXvbjqxVUvrnpx1YurXrvqtUe9GP+s1z/l+qde/3zUK8cAnxATHiXLOFfao2YZ/3I/JpQJdYJM0AmjchvgE2JCm9BPqMcxoUyoE2SCTrAJo3IfEBPahFH50QC1HBPKhEflmiATdIJN8AkxoU3oF4wudEKZMCvXWbnOyqMf1RjgE2JCm9AvGJ3phDKhTpAJOmFWlllZZmWZlWVW1llZZ2WdlXVW1llZZ2WdlXVW1llZZ2WblUcPq+MQjC52gkzQCTbBJ8SENqFfMLraCbOyz8o+K/us7LOyz8o+K/us7LNyzMoxK8esHLNyzMoxK8esHLNyzMoxK7dZuc3KbVZus3Kbldus3GblNiu3WbnNyn1W7rNyn5X7rNxn5T4r91m5z8p9Vu5XZTmOCWVCnSATdIJN8AkxoU2YlUcflDqgTKgTZIJOsAk+ISa0Cf2COivXWbnOyqMPig3QCTbh6t1SY0KbcPVukWNCmVAnyASdYBNmZZmVZVYefVD8AaMPnlAm1AkyQSfYBJ8QE9qEWdlmZZuVRx+UcQhGHzxBL/ArD2X0Jj0GPFw6mm70nRNiQpvQLxh954QyoU6QCTphVo5ZOWblmJVjVm6zcpuV26zcZuU2K7dZuc3KbVZus3Kblfus3GflPiv3WbnPyn1W7rNyn5X7rNyvynocE8qEOkEm6ASb4BNiQpswK5dZuczKZVYus3KZlcusXGblMiuPvqM2oF8w+s4JZUKdIBNGZR9gE3xCTGgT+gWj75xQJtQJMmFWHn1HY4BPGJXbgDahXzD6zgllQp0gE8atUhlgE3zCuFuSAW1CvyBvEMf25B1iQp0gE3SCTRiVxzbnfWJCm9AvyFvFhDKhTpAJOsEmzMp5xzj2K28ZE/oFeZOoA0adPuDxVz72dPQvz/+rTegXjP51QplQJzzq+Djuo3+dYBN8QkxoE/oFo3+dUCbUCbPy6F8+mm70rxNG5bHxo3+d0Cb0E2z0rxPKhHFDewyQCTrBJviEmNAm9AtG/zqhTJiVR/+KMkAnjMp1gE+ICW3CqPzYLxv964QyoU6QCTphVI4BPiEmtAn9gtG/TigT6gSZoBNm5dG/og2ICW3CqPw4AWz0rxPKBJ8w/mq0/Ogpbezp6ClNBtQJMkEn2ASfEBPahH7B6CknzMo+K/usPDpIG9szOsgJMaFN6BeMi1QbOzguUifUCTJBJ9iEUXns6ehEJ7QJ/YLRiU4oE+oEmaATbMKsPDpRH+fY6EQn9AtGJ+rjZBud6IQ64VG5j0YYnaiPHRydqI/zZ3SiE2JCm9BP8NGJThh1+gCdYBN8QkxoF4wzvBx1UJ80zvFyyKDxmHbYIF1ki3xRLGqTJP+3sWXSFvVJeiwqi+oiWaSLbJEvWg5dDl0OWw5bDlsOy3oxKP+2DRp/O56TfZy1F5VF429LGSSLdJEt8kUxKbLeaN3Ivx2tG/m3Y1vCFvmi/NvRkuNEvahPaseisqguSsfYt6aL0jH2MkcFTopJOQowHrI9H/rr2N986j8p/1YHjb+tY4/ywf+ktqhfFPnsX+ugsqguSocM0kW2yFeVWNQWLUeOApxUrnaOUhfJIl1ki3xRv45M1HodmcjzfhyFqLrIFvnVzlFjUVs0j1HIsagsqtfxCJFFeh2FEFvki/p1ZCL7xzgeobJIryMT2T+yNXS1n67209V+2T/yKNg6RraOUfaPPAq2jpGtY2TLYcthy2HLYesY5Vk8HpUiz+KT+qQ8i8cAQ+RZfFJdJIt0kS3yRbGoLRoOGVuQZ/ZJZVFdJIt00XCMZ8rIs/2kWNQWpeNxRrQ8208qi9IRg2SRLkpHG+SLYlFblI7H0W95Zo9HupZn9km6yBaNeuPpoI3bmMfY6qBRT3VQn5Qpf1JZlA4bJIt0kS1Kx9iPPO91bF+e9za2IM97G1uQ572Nv8jz/iRZpItskS+KRcMx7sxb9oWkvH6MW+mW14+T6iJZpItskS+KRW1Rn2TLYcthy2HLYcthy2HLYcthy2HL4cvhy5HXmfEs0PI6c5IuskW+KBa1SZH1xpGJukgW6SJb5ItiUVvUJ2WvPWk52nK05WjL0ZajLUdbjrYcbTn6cvTl6MvRl6MvR1+Ovhx9Ofpy9Onox7GoLKqLZJEuskW+KBa1RctRlqMsR1mOshxlOcpylOUoy1GWoyxHXY66HHU56nLU5ajLUZejLkddjrocshyyHLIcshyyHLIcshyyHLIcshy6HLocuhy6HLocuhy6HLocuhy6HLYcthy2HLYcthy2HLYcthy2HLYcvhy+HL4cvhy+HL4cvhy+HL4cvhyxHKuf99XP++rnffXzvvp5X/28r37eVz/vq5/31c/76ud99fO++nlf/bxnPx9DFT37+UmxqF/Z1M/enVQW1UWySBfZIl8Ui9qi6SjHcYAFrKCAChroYIANxFawFWwFW8FWsBVsBVvBVrAVbBVbxVaxVWwVW8VWsVVsFVvFJtgEm2ATbIJNsAk2wSbYBJtiU2yKTbEpNsWm2BSbYlNshs2wGTbDZtgMm2EzbIbNsDk2x+bYHJtjc2yOzbE5NscW2AJbYAtsgS2wBbbAFtgCW8PWsDVsDVvD1rA1bA1bw9awdWwdW8fWsXVsmSNjWPSBDgY4bGMI84F9YsksuXDYxqjnAysooIIGOpi2ntjAvjCz5MICVlBABQ10EFvBVrBVbBVbxVaxVWwVW8VWsVVsFZtgE2yZJd4SBVTQQAcDHLYxnltyusmFmSUX5vSGmlhBARUcdWNMk8g5JleFzIcLK5gV8sBmPlxo4NjeyHMn8+HCBvaFmQ9jYLfkJJSJFRQw6+bOZ5+PbMns8xcWMNs3/yz7/IUKGuhggA3MCR5jNknOSJlYwAoKqKCBDgbYQGwdW8fWsXVsHds5aSUP1jlJJY/xOU1l4DVR5cQCVlBABQ10MMAGYivYCraCrWAr2Aq2gq1gK9gKtoqtYqvYKraKrWKr2Cq2iq1iE2yCTbAJNsEm2ASbYBNsgk2xKTbFptgUm2JTbIpNsSk2w2bYDJthM2yGzbAZNsNm2BybY3Nsjs2xOTbH5tgcm2MLbIEtsAW2wBbYAltgC2yBrWFr2Bq2hq1ha9gatoatYWvYOraOrWPr2Dq2jq1j69jIkkqWCFkiZImQJUKWCFkiZImcWSKJATawLzyz5MQCVlBABQ1MmycG2MC0jXsjObPkxAJWUEAFDXQwwAZiE2xnlrTECgroYFYYFyo58+HEUaFn+2Y+XCigggY6mNMRs0kyHy7sCzMfLkxbijMfLhQwbbm9mQ8XOpi2ntjAvjDz4cIxmek4Esd0piO3NyfNHXmMc9rchQE2cEyQGm/tSk4BqkfuRU6gO3JzcgrdkbacRHehggYOW042zQlBExvYF+aUupLbm3PpcmpqzgiqJY98zqcruTk5o66kIufUXRhgA/vCnFt3YQGHreY25Ay7C22dRp0z6uzzJzawT9Szz59YwAoKqKCBDgbYQGyjz9fxsqbk9KGJFcwdkkQFDXQwwAb2hTkh9sICVhBbxZZTY2tO1s6JeRcG2MC+MCfoXVjACgqoIDbBJtgEm2BTbDl1tmpiHqGSaKCDATawLzzvFE4sYAUFxGbYDJthM2yGzbE5Nsfm2BybY3Nsjs2xObbAFtgCW2ALbIEtsAW2wBbYGraGrWFr2Bq2hq1ha9gatoatY+vYOraOrWPj+UI7to6tY+vLZscBFrCCAipooIMBNhBbwVawFWwFW8FWsBVsBVvBVrBVbBVbxVaxVWwVW8VWsVVsFZtgE2yCTbAJNsEm2ASbYBNsik2xKTbFRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlOR3uMXCT2Bfm5zwXFrCCAipooIMBYjNsjs2xOTbH5tgcm2NzbJklOe7p57hnYj63jKk/DyxgBQVU0EAH09YTG9gX5nOLHIkFrGDacsvyEeZCA3P09iwWYAPXmO45Oe/CAlZQQAUNzLqS2CfmJL06pjyVnKU3sYICKmigg6PN5KzbwL4wn1tEEwtYwbTVRAUNzDZLW6bGhQ1cI/9RD7CAFRRQQQNzL87vNvvCfEK5MPfCEysoYO5FJBqYbdYSA2xg2sZxi3xCubCAFRRQQQOHbUwMKzkbcGID+8LMhwsLOKcdlnP+Xz6uXxMATwywgX2hH2ABKzjnGj5QQQMdzDmXJzawLzyn2p5YwAoKqKCBHPngyDeOfOPIN45848g3jnzjyDeOfOPIN45848h3jnznyHeOfOfId45858h3jnznyHeOfF9HPicwTizgOvLnfMU88ueExXpigA1cR76VAyxgBdeRPyczXmigg+vInxMaL1xH/pzSeGEBKyigggZm65TEvjD7/IUFHMdCcy+yz1+ooIE5Zb0lBtjAvvCcGn9iASsooIJ5jHMvzt59Yl949u4TC1hBARU00EFshs2wOTbH5tjy6q/5uXpe/S800MEAG5i23Pm8+l9YwAoKqKCBDgbYQGyZBGPSa8kZkBMrOGyWZ0kmwfieq+QsyIkOBtjAvjCT4MICVjBtuTBAJsGFafNEBwNsYNrGpuekyIkFrKCAChro4LD5kdjAYRszwkpOj5xYwAoKOBReEx0MsIF9YQ5g5sSLnB45sYICKmhg2jwxwAb2hRkVFxawggIqaCC2vD3wcyWGBvaFeXuQ8x9yyuTECg5bZKufKwBkS55rAGTrnKsAnBhgA/vCczWAE7Nuki6yRb4oFrVJ2YPzBjTnM16YPfjCPO+S6iJZpItskS/KiqNb5FTFmlMwcq6inKSLbNHjr+X8k1jUFvVJoyNeVBalJI9WdsMLs1Fyb7MbXuhgbmbLRTKyQk8UcGynJI0CYyJDzfmIEwNsYF+YPcuSyqK6SBbpIlvUrkasObswG7Hm7MI6Hi9rzi6cOP5+vLisObtwYm5pbv/oMuOmqObkwov6pNFfLiqL6qKsmBuSHaDlhuRH99lK+dX9SWXR+Ots2fzw/iRdZIt8USxKSarzvD8xz/vxGrHmFMGJFczNzAp5mrfckLwYnjguhpL/al4Lz4bJa+GFAio4yvY8mufCFycG2FaDZ086MXvShdgCW2ALbIEtsAW2wBbYGraGrWFr2Bq2vBZe6PNUb5zUjZO6cVLnpfDCMrGcS1vUxAoKOLw9yRb5oljUFvVJ2Y9OKovqIlm0HGU5ynKU5SjLkdeo8cFnzSl4EwuYGk8UMEWSaKCDATawL8xr1IVpy83Ja9SFAqYtEg10cHSeI4/D6KIT+8Lso3kYso+eVBfJIl1ki7LiyJmcfCdH/q+5/sWR258rYFyooIHj5BpvtmtOvpvYwL4we+mFaUtKWba8C6iggQ4G2MC+MA6wgNgCW2ALbIFt9FIpub2jl07sC0cvnVjACg5bydMuL5EXGuhg2rKd8jJ5YV+YF8qSW5ZXygsrmLY8f7qCBjqYtpY4bON5tOY8PRlfGNacpzdRQAXzfJLEUXe85q05T0/GiGLNeXpyrtY0Ov6F5wI3JxYwbS1RQAUNzGTL7c1VbiQ3J9e5yfM7J+eJ5ObkWjd5jcjJeRMFVNBABwNMW25DXmpPzCtsXiRzRt5EARUcCs1NFwcDbGCfXTNn5E0sYAUFVNBAB/POK9ssF8G5sICjrua/m0FwoYK5F3nkMwguzL3IVs8guLAvzCAYHzrWnHs3sYICKmigg2nL8yyT4MK+MJPgwgJWUOaNxLlMVd4QVa7M11JVJ/aF53JVJxawggKuu7hz4aoLHQxw3YmdC1ideF6aTyxgBQVU0EAH5118zfl0Mp73a86nm1hBARU00ME8Fi2xgX1h9vkL151vzqebKKCCBjoYYAP7wuzoY8SgngtbXahgPqMciQ4GOPZiDDTUnDl3Yd5Ujw9wa86cm1jBfB6SRAUNdDDABvaF2ectD1b2+QsrKKCCBmab5R4rR9448saRN468ceSNI28ceePIG0feOPLGkXeOvHPknSPvHHnnyDtH3jnyzpF3jrxz5Ec3jezHOQVuYgErmMfCEwNsYB6L3PS88l5YwHygyhMmr7wXjjbzPB/yynuhg/nkltuQV94L+8Sc9zaxgBUUUEEDHQywgdgKtoKtYMsr7xiyqTmXTcYgSs25bDKGS2rOZZtYwArm9vZEBQ10MMBhGwMjNeeyXZi98MICVlBABQ10MEBsgk2xKbbshWPQp+ZSWhMVNNDBANMmiX1h9s0LHcx/IY/F+cR7Ym7OkVhBAXNz8mDlJfRCB3NzWmID05YHIC+hFw5bDk3kpDTJa1ZOSpN83MxJaRNzMCCPfN5MXxhgA/vCvJm+sIAVTFtuZN5M57U7J6VJXm5zUprks2lOP5N8GMvpZxMLWEEBFTQwi41Wz9llEwtYQQEVNDCLjQOQs8Akn/dyFtjEABuYfzZ2PmeBTSxgBQVU0EAHA2wgNsEm2ASbYBNsgk2wCTbBJtgUm2JTbIpNsSk2xabYFJtiM2yGzbAZNsNm2AybYTNshs2xOTbH5tgcm2NzbI7NsTm2wBbYAltgC2yBLbAFtsAW2Bq2hq1ha9gatoatYWvYGraGrWPr2Dq2jq1j69g6to6tY+vL5scBFrCCAipooIMBNhBbwVawFWwFW8FWsBVsBVvBRpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZ9R0RMVNNDBABvYF55RcWIBK4itYWvYGraGrWFr2Dq2jq1j69g6to6tY+vYOra+bHEcYAErKKCCBjoYYAOxFWwFW8FWsBVsBVvBVrAVbAVbxVaxVWwVW8VWsVVsFVvFVrEJNsEm2ASbYBNsgk2wCTbBptgUm2JTbIpNsSk2xabYFJthM2yGzbAZNsNm2AybYTNsjs2xOTbH5tgcm2NzbI7NsQW2wBbYyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJKc5KX5yiEneWmO0+YkLx0radaczqVjPlLNuVaSL+hyrtVEAx8KHdOuHhhgA/vCXHz6wgJWUEAFDcQm2ASb5r9riQ7GQktb7rwJqGBWyJ0fp73m24ecKTWxgX3hOO0nFrCCAipoIDbH5tgcW2ALbIEtsAW2wBbYAltgC2wNW8PWsDVs5/LveUadC8Cf6GCADewLz6XgTyxgBQXE1rH1ZevnEu+SmP+rJuY2eGID+8JzafcTC1hBARU00EFsBVvBVrFVbBVbxVaxVWwVW8VWsVVsgk2wCTbBJtgEm2ATbIJNsCk2xabYFJtiy36c7+pyctPEABvYF9oBFrCCAiqIzbAZtrPPt8S+8OzzJ2bdnjgq5PvCXP1N831hzpea2BdmP76wgBUUUEEDHcQW2AJb9uN8Z5lrwU2soIAKGuhggA3sCzu2jq1j69iyH+cr1JxqNdHBABvYL5ScgKX5EyI510rzNzZyrpXmb2rkXKuJDewLs89fWMAKCqiggdgKtoIt+/x4jSu59tvEAlZQQAVH3fHeVHLSleZvXeSsq4kVHBXGy1LJ9dwmGuhggA3sC7MfX1jACmJTbNmPNQ9L9uMLA0xbJPaF2Y819zj7sWbzZT++cNgs2yH78YUGDpvlNmQ/vnDYLE+Y7MeW25D92PKEyWu3pTiv3RcKqKCBDgbYwL4w+/yF2AJbYAtsgS2wZZe2bJLsvOOlkOQULfU8CbLzXujg2EjPJsnOe2FfmJ33wgJm3Wy+7JCezZcd0rP5skMm5mJrEwtYQQEVNNDBtEViA/vC7LxjtqzkDK+JFRQwbT3RQAfnraXkRK+JfWF23vEdheRMr4kVFFBBA4dtvDiRnOk1sYF9YXb0CwtYQQEVNBCbYBNsgk2xKTbFptgUm2JTbIpNsSk2w2bYDJthM2yGzbAZNsNm2BybY3Nsjs2xOTbH5tgcm2MLbIEtsAW2wBbYAltgC2yBrWFr2Bq2hq1ha9gatoatYWvYOraOrWPr2Dq2jq1j69g6tr5subTbxAJWUEAFDXQwwAZiK9gKtoKtYCvYCraCrWAr2DJLxqtZydljEwtYQQfzz0aA1DMUTsw5GJboYCw8u7QkFrCCAipooIMBNrAvNGyGzbAZNsNm2AybYTNshs2xOTbH5tgcm2NzbI7NsTm2wBbYAltgC2yBLbAFtsAW2Bq2hq1ha9gatoatYWvYGraGrWPr2Dq2jq1j69g6to6tY+vLJscBFrCCAipooIMBNhBbwVawFWwFW8FWsBVsBVvBVrBVbBVbxVaxVWwVW8VWsVVsFZtgE2yCTbAJNsEm2ASbYDtvD8admJxZcmIBU9ESFTRwKMaIoeQSbBMbOBRjxofklLGJBayggAoa6GCADcTm2BybY3Nsjs2xOTbH5tgcW2ALbIEtsAW2wBbYAltgC2wNW8PWsDVsDVvD1rA1bA1bw9axdWwdW8fWsXVsHVvH1rH1ZTt/1/HCAlZQQAUNdDDABmIr2Aq2gq1gK9gKtoKtYCvYCraKrWKr2Cq2iq1iq9gqtoqtYhNsgk2wCTbBJtgEm2ATbIJNsSk2xabYFJtiU2yKTbGRJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImdWVITG9gXnlmiiQWsYNo8UcG09UQHA2xgX5hZMqZ+Sk7fmzhsPbc3s6TnlmWWXDhsY2an5PS9iQEOW7fEvjCz5MK0RWIFBVTQQAcDbGBfmFlyIbbAFtgCW2ALbBkVYyqP5Dw87dl8IxTsyDYboTDRwQDbwGy+EQoXjlCYWMAKysBs1J62bL5uoIMBpi23d4SCjY/pJOfhWY7W5Ty8icM2vqCTnIdn46Wx5Dy8icM23h9LzsOzehaLhaN323hZKjmhzsbbSckJdRMdHJtT0zZ6rOXPleckuYkKGuhggA3sC0ePnVhAbIJNsAk2wSbYBJtgU2yKTbEpNsWm2BSbYlNsis2wGTbDZtgMm2EzbIbNsBk2x+bYHJtjc2yOzbE5Nsfm2AJbYAtsgS2wRdryTA0HA2xgX9gOsIBp64kCKujr/M3efWEDOcGzd19YwAoKqKCB2Dq2jq0vW06dm1jACgqooIEOBthAbAVbwVawFWwFW8FWsBVsBRtRkVPnJmKr2Cq2iq1iq9gqtoqtYhNsgk2wCTbBJtgEm2ATbIJNsSk2xabYFJtiU2znj86XxAb2hRkg+YI5p85NrOCw5bvmnDo3cdjyZXROnZsYYNoisS/MALmwgBUUUEEDHQwQm2MLbIEtsAW2wBbYAltgC2yBrWFr2Bq2hq1ha9gatoatYWvYOraOrWPr2Dq2jq1j69g6tr5sue7axAJWUEAFDXQwwAZiK9gKtoKtYCvYCraCrWAr2Aq2iq1iq9gqtoqtYqvYKraKrWITbIJNsAk2wSbYBJtgE2yCTbEpNsWm2BSbYlNsik2xKTbDZtgMm2EzbIbNsBk2sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJEljSxpZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJElnSzpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLOlkSSdLOlnSyZJOlnSypJMlnSzpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLOlkSSdLOlnSyZJOlnSypJMlnSzpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLOlkSSdLOlnSyZJOlnSypJMlnSzpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLOlkSSdLOlnSyZJOlnSypJMlnSzpZEknS/rKEj1WluixskSPlSV6rCzRY2WJHitL9FhZosfKEj1WluhxYCvYCraCrWAr2Aq2gq1gK9gKtoqtYqvYKraKrWKr2Cq2iq1iE2yCTbAJNsEm2ASbYBNsgk2xKTbFptgUm2JTbIrtzJKW2BeeWXLisI3lgDTnWk4UcNjG9FPNuZYTHQxw2MZMVM25ljYmhGrOtbQx9VNzruXECgqooIEOBtjAvjCwZZaMpXg051pOFFBBAx0MsIF9YWbJhdgatoYts2QsVKQ5RXOigwE2sC/MLLmwgBUUEFvHllmieWpkllzYwD4xp3NOLGAFBVTQQAfT1hIb2Bdmalw4Kox1cjSnaNqY3qs5RXNiA/vCzIexTo7mFM2JFRRQQQMdDLCBfaFgE2yCTbAJNsGW+TAmKWtO0ZyYNkvsCzMfLkxbNmrmw4UCKmiggwE2sC/MfLgQm2EzbIbNsBm27P6WBzY7+pi6rDnX0jyPcXb0Cx0McGykZ5tlRz8xO/qFBazgsHluQ3b0Cw10MMAGpi03PTv6hQWsoIAKGuhggA3Elh3ds6Gyo19YwWGLPO2zo184bGPxFs25lhOHLfLcyY5+4bCNqTyacy0nFrCCAipooIMBNhBbwVawFWwFW8FWsBVsBVvBVrBVbBVbxVaxVWwVW8VWsVVsFZtgE2yCTbAJNsEm2ASbYBNsii1DYSxRrDnJc6KACqatJzoYYAP7wgyFCwtYQQEVxGbYDJthM2yOzbE5NseWqTHmlGlO3LTxKllz4ubEUWG8P9acuDlRQAUNdDAWZhKMdYg0J2NeB6DRvtnnL3QwwLHH42215mTMC7PPX1hAzp2OrXPudM6dzrnTOXc6587Z58c2yNnnTyxgBWVuQ07GnGjgsgl9XujzQp8X+rzQ54U+L2WdqVIUNNDBWNtQGrhaUujzQp8X+rzQ54U+L/R5oc8LfV7OPp/bUGlJoSWFlhRaMvv8WB9RczLmxGzJrJt9/sIAG5j7Ns71nIw5sYAVFFBBAx0ctjGnQXNe5oW2TvCcjGljpoPmZMyJAirIqZEd/UIOlnGwjIPlB1hADpZzsJyD5Rws52A5B8s5EZ0TMTg1svuP+Rqa0y4nGjjq9myH7P49tyxvDy7sCzMULixgBQVU0MCsm6dGhsKJGQoXFjDr5l5kKFyooIF5J5aHO0Phwgb2iTnBcmIBKyhg3tu3xAAbmHuRmN3/wkddHzM+NKdSThRQB5ZEAx2MgTWxgX3h6P4TC1hBARU00EFs51vP3IbzreeJFRRQQQMdDLCBfaFiU2yKTbEpNsWm2BSbYlNshs2wGTbDZtgMm2EzbIbNsDk2x+bYHJtjc2yOzbE5NscW2AJbYAtsgS2wBbbAFtgCW8PWsDVsDVvD1rA1bA1bw9awdWwdW8fWsXVsHVvH1rF1bH3Z7DjAAlZQQAXnRCe1w8EAsx9bYl9YDjD7cUusoIDZj3uigQ4G2MC+8EyNEwtYQQGxVWwVW8VWsVVsgk2wCTbBJtgEm2ATbIJNsCk2xabYFJtiU2yKTbEpNsVm2AybYTNshs2wGTbDZtgMm2NzbI7NsTk2x+bYHJtjc2yBLbAFtsAW2AJbYAtsgS2wNWwNW8PWsDVsDVvD1rA1bA1bx9axdWwdW8fWsXVsHVvH1pct51pOLGAFBVTQQAcDbCC2gq1gK9gKNrLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyZIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJJGljSypJEljSxpZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJEljSxpZEkjS3Jmp48PazRndk6s4LCNb2w0Z3ZOHLax6I7mzM6JAQ7bWNpRc2bnhZkl4ysdzZmdEyuYtkhUMG2e6GCAacsdyiw5MbMkn25zZufEYctH2pzZOVHBYau5vZklFwbYwL4ws+TCAlZQQAWxOTbH5tgcW2ALbIEtsAW2wBbYAltgC2wNW6ZGzVbPfKh5hDIfxpJ7mrM1J/aFmQ8Xju2VPLkyHy4UUEEDh03yLMl8uLCBfWLO1pxYwLRZooAKGuhggA3sCzMfLiwgtsyH8QmC5mzNiQamrSUGOGw5aSdna16Y+ZDzd3K25sRhy6k8OVtzooIGOhhgA/vCzIcLC4hNsAk2wSbYBJtgE2yKTbEpNsWm2BSbYlNsik2xGTbDZtgMm2EzbIbNsBk2w5b5kBN8crbmxAoKmLY8NTIfLnQwwAb2hZkPFxawggJiC2yBLbAFtsDWsDVsDVvD1rA1bA1bw9awNWwdW8fWsXVsHVumxpjoZDkD08cbEMsZmBOzQk8UUEEDHQywLcwkGPOjLGdV5klgOasyj7HlrMqJATZw7PGYNWU5q3JiASsoS1GxrT5vx+rzdqw+b8fq83asPm/H6vN2SFmbIxUUUEH2Lfv8mEBlOaty4rDZWbcvzD5/YQFz3zxRQAUNdDDABvaF2ectT4Ls8xfKOljZ0S3Ph+zoFzoYYFsHwDhYzsFyDpZzsLKjX6ggB8s5WM7Bcg6Wc7CCgxUFrCCnRnZpy9Mzu/SFDRx1Pdshu7TnlmWXvrCCAipooIMBtoXZeT1Pjey8FwqoYNbNvcgbgQsDbGDedowDm9MjJxawggIqaKCDsTBflo4v2i3XtZxYQQEVNNDBABvYF1ZsFVvFVrFVbBVbxVaxVWwVm2ATbIJNsAk2wSbYBJtgE2yKTbEpNsWm2BSbYlNsik2xGTbDZtgMm2EzbIbNsBk2w+bYHJtjc2yOzbE5Nsfm2PIV6nj/ZudcywsLmD3LEwVUMG2a6GCA2bPytD/zIfHMhxPT1hIrKKCCBjoYYAP7wnOJiROxdWwdW8fWsXVsHVvH1pftnGt5YQErKKCCBjoYYAOxFWwFW8FWsBVsBVvBVrAVbAVbxVaxVWwVW8VWsVVsFVvFVrEJNsEm2ASbYBNsgk2wCTbBptgUm2JTbIpNsSk2xabYFJthM2yGzbAZNsNm2AybYTNsjs2xOTbH5tgcm2NzbI7NsQW2wBbYAltgC2yBLbAFtsDWsJEllSypZEklSypZUsmSSpZUsqSSJZUsqWRJJUsqWVLJkkqWVLKkkiWVLKlkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWZLTRN1PVNDAYRsvm+ycJnphPnX0xL4wRzsuHLbx1sjOaaIXjn0br6DsnCZ6oYFpS3FmyYXDNr7PspwmemE+41w4Rg8iK+QYyIUCKmiggwE2sC/MYc0LsXVsHVvH1rF1bB1bx9aXLaeJTixgBQVU0EAHA1y2c0Lo+LzNzqmf45s2O6d+jtn9dk79vDDABub2jiN0Tv28sIAVFHDYxrdGdk79vNDBYRufHdk59fPCvjCHQC8sYAUFVNBAB7EJNsGm2BSbYlNsik2xKTbFptgUm2EzbIbNsBk2w2bYDJthM2yOzbE5Nsfm2BybY3Nsjs2xBbbAFtgCW2ALbIEtsAW2wNawNWwNW8PWsDVsDVvD1rA1bB1bx9axdWwdW8fWsXVsHVtftnPq54UFrKCAChroYIANxFawFWwFW8FWsBVsBVvBVrAVbBVbxVaxVWwVW8VWsZElTpY4WeJkiZMlTpY4WXJO/RyfMNo59fNCBwNsYF94ZsmJBUybJQqoYNok0cEA0xaJfeGZJScKyL9r/LvOv3smwYkVpMKZBD3RQAfHlo1P4eycuHlhX5hJcGEBKyigggY6iC2wZRL0bN9MggsLWEEBFTTQwQAbiK1j69g6to6tY8sk6HmeZZ/veWCzzyeeUzQvLGDW1UQBFTQwr+iWGGAD+8Ls8xcWsIICKpitc2ID+8Ls3RfmXnhiBQVU0K4lkS0nY04MsIF9Ya6sfWEBK5itE4kOBtjAvjD78YW5vS0xK2Td0TdjfI5nOZVyYl84+maMz/Esp1JOrANrooAK2sA88uM6PzHABvaFfoAFTFueGi6gggY6GOBo9cgtO/txtsPZj0+kdSLr5pEPAx0MsIG5F3kStAMsYAVzL9LWFDRw2PIRJidNTmzgsJU8FqMfTyxg2vLIj34cJXd+9OPIR5icNBn5uJOTJifGxJweGWPGneX0yIkVFDDremLMk+ucCHlhX5g99sIKjo7jKT5/rO/EAMch9LTlAvgn5gL4FxawggIqaKCD2aijzXJG48QCVjB3viUqaKCDuRdHYgP7wlzq/sICVlBABQ0cdcfULmvnL20mZuct2b7ZeS+soIBjL2oWy857oYMBNrAvzEXtx0QyO38l+8IKCqiggQ4G2MC+cHTeqLmbo/NOVNDA3IvzzwJsYF94/o5unsrn7+ieWEEBFTTQwViY3XTMDbWcuzixggIqaOComzMHcu7ixAb2iTl3cWIBx16M+ZN2/Xb2iQoa6GAsLLkXmpjba4kKGpjtcCQG2MC+8PzF3BMLWEEBFTQQW8VWsVVsgk2wCTbBlv14TFW1nHk4sYF9oWbrZFNrASsooIIGOhhg2vIA5KX5xOzdFxYwbT1RQAUN9HWwzt59YgP7wrw0X1jACnI+OOdDXoTPlhz9eGJfOG6xYyzIbTnHMMZvRlvOMZwooIJjL0QSHQywgWnLI5SXZsmGykvzhRUUUEEDHQywgX1hx5Z9PlM55xhOFFBBAx0MsIH9Qs/5iDGmznnOR4wxYdFzPuJEARU00MEAG9gXZhJciK2krScKqKCBDgbYwL6wHuCwjbmAnnMXJwqooIEOBtjAYRsLr3nOXZxYwAoKqKCBDmZ6piKv/hf2hXn1v7CAFcy62b6ZBGO6oed8xAvzx2tqHvn88ZoLKyigggY6GGBbmH1+TFj0nIQYlsci+/yFChroYIANHHsx7mE8JyFOLGAFh83zXM8kuNBABwNsYF+YSeDZvpkEY9af59TEiQIqaKCDsY5F4wg1jlAmwYUFrKCAChr4qCuRttHnT8ypiRNzLyyxgrkXkaiggbkXLTHABo69GL9s6zlhcWIBKyjgsJ1bln3+QgcDbGBfmH3+wgJmXU2MsfOJ2WMj9zh77IUVzC3zRAVzy7IdssdeGGBuWbZDXudPzOv8hQWsoIAKpq0nOhhgA/vCvM5fWNYe5xW9ZVPnFf1CBwMcdcfYoOfEwgvzin5hAR97IZ6tM3r3RAUNdDDABvaFo1/0ksdi9IsLR7+YWMAKCqgDs9joFxMdDLCBfWJOyZtYwAoKqGDaItHBANPWEvvCcoDDNp6SPKfk9fFY4jklr2fE55S8nkmbU/ImOhhgA/vC0Vu6pGL0lokVFFBBAx0MsIF9oWATbIJNsAk2wSbYBJtgE2yKTbEpNs262ZLqYCy0rCuJfaFn3Ww+L2AFBVTQQAcDbGBfGGmzxLTlyRUVFFBBAx0MsIF9YTtAbA1bw9awNWwNW8PWsDVsHVvH1rF1bB1bx9axdWx92XLiWx9rXXtOcevjvtpzitt5EuQUt4kBZm/piX1h9s0LC1hBAdN2ooHDpqnIvnlhW5i9MO/Mc9paH8MWntPWJmbvzr04+5slNrAvlAPMupJYQQHXmSpioIPYBJtgU2xnf0u0tJ0ooC7MLpLPATnLa6KD2VB5CLOLXNgXZhfRbJLsIhemOFs9u8iFCg6bZatnF7kwwAb2hdlFLizgsFket+wiFypooIMBtnWMOydt52B1DlZ2hgsNdDDABq5YyflcEwtYQZm9Rek4enacEx0MsIF9YXacCwv4+HfbeDXgORvrwnFJmljACgqooIEOBoitYhNsgk2wCTbBJtgEm6TtSGxgX6gHWMAKCqiggQ5iU2yKzbAZNsNm2AybYTNshs2wGTbH5tgcm2NzbI7NsTk2x+bYAltgC2yBLbAFtsAW2AJbYGvYGraGrWFr2Bq2hq1ha9gato6tY+vYOraOrWPr2Dq2jq0vW87GmljACgqooIEOBthAbAVbwVawFWwFW8FWsBVsBVvBVrFVbBVbxVaxVWwVW8VWsVVsgk2wCTbBJtgEm2AjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS/zMkpqYtnHz5GeWnFjACgqooIEOBthAbGeWeGIBK5g2TVTQwLS1xAAbOGzjvb/nzK2JBayggAoa6GCADcRm2AybYTNshs2wGTbDZtgMm2NzbI7NsTk2x+bYHJtjc2yBLbAFtsAW2AJbYAtsgS2wNWwNW8PWsDVsDVvD1rA1bA1bx9axdWwdW8fWsXVsHVvH1pctZ4RNLGAFBVTQQAcDbCC2gq1gK9gKtoKtYCvYCraCrWCr2Cq2iq1iq6sfx5kP47kwznw4sYAVFFBBAx0MsIHYFJtiU2yKTbEpNsWm2BSbYjNshs2wGTbDZtgMm2EzbIbNsTk2x+bYHJtjc2yOzbE5tsAW2AJbYAtsgS2wBbbAFtgatoatYWvYGraGrWFr2Bq2hq1j69g6to6tY+vYOraOrWPry9aOAyxgBQVU0EAHA2wgtoKtYCvYCraCrWAr2Aq2gq1gq9gqtortzIeaqKCBDgbYwL4wsyTfluS0tYkVTJskKmhgnxnVzqg4sYAVFFDBLJb7dt5KnBhgbnpPHLZ8A5Jz1SYWsIICKmiggwE2EFtGRc0myai4sIICKmiggwE2cF0kGrcSjVuJnMHWajZJRsWFChroYIAN7AszKi4sILaGrWFr2Bq2hq1ha9g6to4t80FyNzMfLjTQwQAbOBT58iYns00sYAUFVNBABwNsILbMh3w/lAvxTaxg2ixRwbS1RAfT1hMbOGz5liAnvk0sYAUFVNBABwNsIDbBJtgEm2ATbIJNsAk2wSbYFJtiU2yKTbEpNsWm2BSbYjNshs2wGTbDZtgMm2EzbIbNsTk2x+bYHFsGSL4UyoX4JgbYwLTlKZcBcmEBKyigggY6GGADsTVsDVvD1rA1bA1bw9awZVTkBLWc+NbyrVFOfJuYFTzRwQAb2C+MnPg2sYAVzGKROA9h5Ay2bOrIGWwTKyhgbmRLNNDBABsKbKujx7E6ehyro8exOnocq6PHUW1tQ3UwwAb2tQ1nRz+xgNgEm2BbHT2O1dHjWB09DmHfzo6eYqUllZZUWvLs6LkNSksqLanYFJtiU1rSaEmjJY19M47b2dFPpCWNljSO29nRT6QlHZtjc2xOSzot6bSks2/OvjnHzWnJoCWDlgxa8uzoPVHBYbOsmx39wgAbOGxjfcTIOXATC1hBARU00MG0aWJbePb57Hp5ezDmREZOfJsooIKcGp1O1jlYnYPV18EqxwEWcB2snA43UUEDHQywgetELOUAcy88UUEDs6EiMRsqtyyj4sK+MKPiwgJWUEAFbeE41/t4kxk5I2xigOPl7hifjJwRdmHOh7mwgBUUUEEDHQwQm2PLF/hjhDNyobg+vqOKXB3u+l/z/fyRzZfv549svnw/f6GAChroYIC5OdlQOYXlxJzCcmHaemJODstjfE5Fy+Y7p6LVRFubnm/tL1w7lDPNHvfOiRUUUEEDHQywgX1hnogXpq0nDtv4yDRyptlEBQ0ctvFVZ+RMs4kN7Avz9LywgBUUMIuNhsopY218DBo5T6yNbz0j54m1ng2V16ELDXSwL8xry/jkMnI5tolZIRJTnE2SV4aeTZJXhgsVzEOY7XD2lhMDbKvu2Vvyfz17y4kFrKCsPc4rw4UGOsi+5TXg3KG8BlzIHucc5Jb/bs5Bbuf/GmAD+8Kcg3xhzvfMHcrZxue5k7ONL3QwwAZm3dF8uTjZxAJWUEAFDRy2PBFz5tbEBvaFOQf5wgJWUMChyBMxp2tNDLCBfWFOPL6wgBUUUEFsFVt+bJA9IKd2TewLc+ryhQWsoMxWz6ldEw1cByuXFos8o3IRschOlouITQywgbk549TIRcQmFrCCAipooINps8QG9oU5B/nCAlZQQFv7lp8VZIfM2WMX5gcE5w7lBwQXVlDA3PRss/yA4EIHc9Pz9MwPCC7sq0LD1rA1bA1bfkBwIYelcVgah6VxWBq2vhQ5y6uNryciZ3m18XFE5CyvNr5niJzlNdFABwNsYF+YF5QLC1hBbHlBGZ9BRK7aNdHBABvYF+YF5cICVlBAbBVbxZZXnPGJR5zzxC7sC/M6dGEBKyigggY6iE2w5UOQ58HKB5vxKUacs7wubGBfmA82FxawggIqaGAqIjEVLbEvzKeZCwuYijyj8pp1oYIGOhhgA/vCvJJdWEBsgS2wBbbAFtjyaSbytM+nmRPzESbyAOTDSuTpmQ8rFzo4ikWeMPmwcmFfmM8tFxawggIqaKCDS3HOYxpfcMQ5j2l8nRLnPKYLBVTQwKzribm943CfM5YuLGAFBcy6LdFABwNsYF+YD/wXpq0nVlBABQ10MMC2MDvD+HwlzmlKF1ZQQAUNdDDABvaFjs2xZb8Yn8XEOU3pQgUNdDDAtlrdOVjBwQoOVp7gY6WdOGcWtTxh8qy+sIIC5ubkGZXn+oUOBtjAvjDP9QsLWNeZep7rJypooIMBtonndKLct3M6Ud69nhOHLrS5Q+fEoQsDbGBu+ugB58ShCwuYDRWJAuqqULAVbAVbwZYXqhPrARawggJiq6fiv//7n/7wl7/92x//8ee//fVf/vH3P/3pD//8X+t/+I8//PP/+K8//Psf//6nv/7jD//81//8y1/+6Q//3x//8p/5L/3Hv//xr/nPf/zx74//93Fu/umv/+vxz0fB//3nv/xp0H//E399vP7T8rhL1evPy+PWs60Svf9Qo7yuoWOwNis8Lgbr76P+8Pf19d+Lzy2QXtffl/jGTsh4u3LtxOOC/mon9HWNcR95Fiiy/lzl7p9Lfk9+7sTj5T17UfWHEr4pMRLiagY2Ifzu3+dPq+Xfu9j6e/lpA9qmGXPtkLMRrLSXJfruUNbVDB7yssSuJfOzi6sdmr5sybI5I2sdn3BnjceAAptRtP1YY3dWiq3NoDkfY1D3d6TPHdHjkNc7sqlh+TNlWWMszbZq+I9bMd7lvz6q40nlOqpWX5bYnFn5cWxWaPJ0QLzdrpCjomcFL68r3N2NeL0bu8bMxarOxnyMEr8qUTdJU7XNnHjkZnlZonzaFHVzZj5G+tbZ/RifJq1+SlzZbITPvHwMY73eiF1e1jpb4oGcFY8Bhfs7UsaXUNeOWHm5I5sTqxKax8sC+x7WfZ0UT9H/8xFtn4fersbj0XPWeDxZvr5+yLHN77q6yFNr1PrjYZXN2WltHpHHHdhThbh/YqitE8OeetnPJ4ZsTs/H6/a+anTO8MfIy481NttRuSLXx802B/b+Vtw8xbc17rZG/ILWaJ+2xr6j2Ooo7i+jb1NBcwmg8xx/DFK9PMd1c34+RmjXzeJjoPmpht+vIbHuMH64tv9cQz6+qqp+elXdVbh3Kbm9G6+vqndbU5+uRt87IkesGkVf1+if373a8QtuX8v2SWCm8OOO/vW+2ObC2GqdZ/kD7eX9676G26rRj9c19OOz3OzTs3xX4d5Zfns3Xp/l29aUYx0RkTePiK/bncdo0OunEt9d403Xk248P1S0+z32MYS/crjo6wz1+vGZ4fLpmbGrcO/MuL0b7+Xfowl1tab3160Zn7dm+7g128etGb9zaz6dm1Heupo8/nBuxuNV0usjEvLxg3d8Hp7xcXjGx+EZn4fnvjE/vXUcP7Q6KxR7PZbSNtE5PrqbzzYtXsdv25xafZ2d5Xi+prZvjFWqrvZ83GT0V2OV+wYNGrS9d0zuDYY02w2GHOuZ4vmu7ecS/nEfafFpH9lVuNdHbu/G6z6ybUzpjcb0t0pYLWtwSl4OZfTN9XCsBjvPiu79vRKiN0rsT6xbo2z94+TsHydnj4+Ht3r7cHhruw33xgrLcXw6WJgJ/frdhMwd8edbzscT0rtF7M0iuh41xypEmyL66ajjfl/WOMYD392XugZ1vD6l5zeLhK0i/d1DI+uxZCy5tSmye4J/vCVZj/APLi9Hy7Zl7g7bfVGkz+PTpfQ3i8h6ldXl6dXo94rcHEEsu8G7u0OIZfcK5uYY4nY7Wl0t0p7u4367HXeLPI0jfrPIusY80N8r8ugT6872wbEpsz3EtoKtP98+fPNka5xsz/34e0W8U+R1B7x/9X79znL3EiGXUc4SES8vWvs75Fuvdcru3dLd58h9EV278rjxL5si+9F7Wz1PN3vTP38PvHvDdPNF8K7EzTfB8vn7zyIfvwAtuxdMUnQNFj9a9PU17/ZR2bzW3p8d671fjaZv1RDO9cflLt6tcXxc42kWzHOKfa/GOriPcq9r7MaQbj4IfVHj1pPQfl+Uk0y9fV7jzXNMaucNTXt9bHX3lOzrjUSJuul12w0JWyfI4yrxekPaLzi47Xc+uPnbXNe+bDquld0tSKwXAo+7t3cbdd3tStucZbZJVFmh/HjCer0Z2/c03da+9Ng8m+22QxlAfjo9ftscu2u2rVd4aj9MxvjOhd+PuTP6fBPzvSIW6+WC7e4e7BfM6yv+C16NbnfneRj38Xry9e7s39nc3R35vXentnnRNDl2u2Mf3uruN8PX6Tp+PHGzGbHrNuuUr5Sov2nTz+eYbLdiVXjuvL/ZitgNsD/OsTWj+TGKc7zajm2RI7+auR7s2nM2f6dIb0+vC55mmnynRWIdl745LqG/a4lHG9ROe9jrRtVf0aj6Cxp1W+TuObLtdrFuicYPTrwX8D8MR4q+W2QNEY2FWt8sEuuGZiyB92YRX6fJWJ3sdZGmvyDgd6MQvyTgx+pma3d8tzu7t+KWvxBx7U/X/s7JFr6ercJ722xJ/3wYoR+fDyP08vEwQv94FnXp8vkwQtePhxF275luDyPcPiqbR7z92XFvGGFX4+4wwhc1jo9r3HtKrMfdx3d7r03vDmfsa9wazqi7F1Y3n3i/qHHviXe7L3qs8+P57dtvtiN+7+24N6xyu8abfe7msErdfex0d1jli5P95glSfucDc29IpG4/Fbo7JLLfkFtDIrXEp0MitbTPh0S223FzSOSLm5jgpuzxxuzFTUzdffpUxm/+UuTpY89vFNHK4Ex9mlXxvTuym9uxiUPva0bwWLxic0e2GctYT2ZPn4z+9NHpVw8yNXiQkf7m05Dy9evhx8vm2A4yH/L/TPb7JW4e2S8e/m+2x/EL2mP3kuruI+a2yM0W2b+iftqZ43h+u/y9N92H+FOZzav7evySF+a7Mp6Lm53PZf14OQSwLcFD2Vix9b0SwVb0lyX282YOPto+3p4GtD5eHz96+LLI/vuGkPVM9vx8+Z3vG3Rdu5vK6xp1901TyR8vv+5m9PWNiH7+yXPVj7953pa4+aXv7T2JzZ5s36qsZ5DS++tnod2HUTdv7b7YjjWY8riNfH2vuzvFbt5R7d4PPdJrDYJoPE8Pa/e3494d1bY5HsMPB8MP7a0mfTwXrEnDZXO3bJ/fpNqvuEm1j29S999XrdZo/jTx7zerPmy/cr01s36/RsCtafHVP/+8tPrH35duS9xMMP/8C9Ntg96bGr8tcW9qfPX++SPyvsa9HC2fX5j293L35tnuF4C4N0N2W+PmBNntF/Y3p5TerrGZUbqvcW9CqcivuD3eturN6aT7Lbl7jmzb5OZ00v1aEJ/vzd1zdb8vN8/V+AXnavyCczV+wbkav+Jc3bfqvVnL9xfleX0ntX0ldWcWxnbwoqz+8riTeZ7u89MiMLtXUiKsHSD6coxtW+LeOMzujdS9UYdtYxzr1PjpK96fGyM+fw1c+y9Ym0c+f7km+y911lSB5ykYcb/CuhVz9dcVtksHrDOjWK1PNdo3moJpIFZlU2P7IEiUPvj59dz9M4yXYvp8g1y+s+aSOdP84vVHxbJ7G3Xznboc7eO7fdl9uXHvtnBb4t7dvmwX3rv3Tl1K/fSduhT5/J36/aOy6fb7s+PWO/VtjZvv1L+qcXxc4947dSl3n3/svTa9+U79ixq33qlL/fxb6S9q3Hoe3O/LvXfqUu333o5b79Tv13izz918py7bz3JuvlP/4mS/d4KU/jsfmHvv1GX/PHjvnfoXG3LrnXquvPrZcKWIfz5cud2Oe8OV2zu6p0mb8uY94XqF5fq6QvyKt4NfVLn5crC2/ktGP3Zl7r0c3Je49XLwixJ3Xg7uB8duPhrr7zsA841zRH7JORK/5hyJz8+R+PwciY/Pkd3jWKyRj8frn+c52z+uJST28eP+tkRxWwsWPvj53a/8lKnbV1G3hj/2JW4Nf4j137s9WE9+/OL86/bw3dNUWxfuB76apbQtcXtN4N07nHuLAm9L3BwA2Za4NwKybY27QyD7Jr05BuLt8zGQL06zvtb8L+MXhl+fZrv5TrUED+3t6ejIT/dlUbbjIHeWW95uR11fTNYHb7Zj+6ZvnSbVbFNk27DxdLs7fuJz07D2cZ5tS9zLs4jfN89+bI+nyRu/zfdtmczuq4yWTSzuFvJ7jO4wIGJPN76i7xZpv6DI803894o8jc1E3xTZzQR5vJKap/3jhHp6pvnpMG+/mWrC85n6pshuRX4e8mp7mtfyvSKt9FXkeQ2nbxZhS6r9giJybIrsjo4Z0w+eb8N/LrJ7RWW+Hlvted3Ibx1iJR4fY97t3fOkrVzrh77ZJrpOtqq+a5Pd7viatvgYctL3GlY76/z0Zu8V8RpPkzDtV+zO7hDfzZP2OpR0t+bfzYF8PfarujNQW32zIbsZ8hazyPixMa4YPy1yf2zfiTIA9sNU/fipxm61n4ML8fE8ueznGrvrXznWFMgxsdxe7822WdcTsMjTdwO/bdZtkf40iL65cn3neu4vr+e6e+9091wruyfh3tcTxoPt9R2Kbt9fybrPqc8/DVF/U6R+eiu8b5J7S4dq+XSRyn2j3j+++zJ2UMZUNmV2k1aCFQieO/Ejsb+xKazKUiK0bTZlN3BT13RCl+dxl5+L7KatPM6hFfblaZXbbxWxshLlgfLmljwtu6ESb26JrBVNTbq/2bCyfrjNHxu12ZLdyyx3bpTau0ViTc9+YHmzCHO1HvhukVgfmj3Q3izSfa28059mvX+zI8dK6sfQ4/NKE98r055+xKLZu7HyeLpg9PM5JX9TRj4e3NqWuDe4tS9xa3Dri/YwhpSay+bobF/mlNb4hO759v7nX0f6eCmgL7ajP31A1+XVIL3qpk16XQNkvb4cPvmixNqVXv3VIOwXRybYlRbt7RO+rw8cHrwZZdfdRyP3RqX2JW6NSunu46h7o1LfaY/txfyLMkEZ07fLWKdMvB4z1O1PUN07OtsS946O1d/76Dy3R+vvHx2nTH/3mtMPbh97qfZuGeEXQB49cHOvtHtLdfOasytx85qzLfELrjmdBQpLd90cnc9fdG1LPO5NDj4cjaLvFWHc8cHV3iyyfhFq3N68d8nowfcXfX/JKL//Y3FdowWP9yixeSy+W+TpIH+viK4LelU93ixi6xfLqz0NPX6ryKMdVlAfPwyzlduv7/v6+vvx6itevr7fvrujPaq8ngGg8QsWXNP4BQuubQcdGWs/dLczu98DuvMlh+7Wjn+M86/xqOa7zfgVv4S+K2J13dFb/eGZ+vhGESL6p+fH7xQJ5XH4h0etn4q0jz9v2Ze4d2/TPp7v8kVrrHdc1qRvWmN7+V3vc1ybbIrslqHmrUM5Xg4nbzfD1k202w8Pjd/ZF7O1eKQ1e7vI0zKW/e0iawTJf3hR/Z2zva0Qebyu2xTZrQ34S4rcnb+j3T++3dyVuHm72f3j281ta9ycv/NFk96bv2PH9sbq3vydLy4066eXHvdGurnQ7Ir0SpHN1cp+xSdZX2xJ8GKqtM2WbH8kYF03x8y5pyI/H53tRHNZV4l4/ojoO0VU14C2Pi+c/Nsi/dNL3r7ErUuelY/XTNu3hvE7Ns8TB37TGuXjG4B9iZutYb9va7iyUPnzx3K/aY34vDXi89b4eLrrtuM/dmTNGxofUbyVY8KXHaI//Cr1T+mx+57ql+SY8Nu/j1v3483deYqgXv3NIn3dZz7e5uu7RdYktUcR3zTsL/gY2+ov+Bj7i6PDe+2o9fXu7L5jfvqE8GnyQ/j9Cl5YuM1eN4f8gh+yMPkFP2RhdTsxZZ1npepzm8ZPW2Kftul2Mypf3YmU15tR95Oijbdgx5tFugYjM5si0j8Po22RznV3/Igjx1f0G0X8mNnanx+KvltkLcTizwvCfK/IelDs/jz/8Ociu9dPfd029+cPgOy4X+J5ic/jefbhz0X2O9PYmf5us4a0tTdPE9a/V6RxgNtTxv+2WX/vIj8sSSe7o7MrUteaP7U+t8m3isj6tZH6/I33b4rsguAxaL3GAh/Dwa+DwD6dibWtcHcYwOzjYYBtiXvDAPsSt4YB9q1xcxjgiya9OQzgv2AYYH+OKV3G+uZis/9Gi0lP/anL/GYBV/988VXzzxdfNf948dVtiXuLmdzfk9jsyeeLr1p8vvjqF9txa/FVi48XX7XtEJGv727rDxPc9TtFeBfxwPJekbvLwO63xISVx/zdIrWsInW7JbvvCctRntYsf3pW/Pm76K/KNKfM0zvJb5YxfvLokQLt7TLrII2Svimza2DpHOrn+5pvHaV86XgVeb7X+02Rj5cN3nbkm8sG72vcWzbY2sfLBlv7BcsGb7fjZpPuD+16xHocZXm3AxY+gS9F3u6AVek51d/ugHXNqBklNz1ne692a4mSL2737qxR8sUT0tPz3vP3WT8/l/TPB1v754Otvf+uJW6OXu8bdE0Gf7Stvm7Q3VDrvQEwP+TzATDffpj1SwYVlbXNfDPQ6rtXV9Webm42PxvsuzcL0dejb/QfFjb8RpEm69dcmzR7s0iseSOtW3mvSC/rU9Fe+qZNtlOtbvXdL7Zjfcn0eF/a39yZynhP7ZsiRX/fnRECUfqx2Q7/fbdD10+xPh45d9vRPt6O8vFvD/n2E6hbqbpvDX9K1c0PqPouVX9JkbujRV7109GibYl7o0X7ErdGi/atcXO06IsmvTda5PUXvBDYX2Xc1yTJ6K9/MdilfDzQ4/vXV7cGenz39ureQM+2xL2Bnvt7Eps9KR8P9Lh8/suWX2zHrYEe390f3nu2891XU3cHevZFbg70bIvcHejZb8nNgZ59kZsDPa72KwZ6vipzc6DnizJ3B3q+KnNzoGffwDcHevZFbg70bHvQvVGJbUe+OdCzr3FvoMd370luhsF2nYibAz3b7bjZpPtDe2+g54tz9e5Azxdl7g70fFXm5kDP/jbr1kDPF3dqtwZ6do/yN4cU/Bd8yuL+Cz5l2c9B9XUhludG/d4c1LKmS6g8L7v8vYms60NM/WFtzm8Vibp+cKEdr2c8+u5N1i8pcvvpZjcSf/PpZlfi5tPNtsS9p5v4Bb/q8UWT3ny62X14dftd+H76N2s69B8mXv28Jf13LlKdefWt1zeL9OepH+8WaevxRI662Z32K8Za2y8Ya93ujvATzXLYpk12y/IVY/nlB+urH3r+qsitHzX37Vusmz8mvi1yc/jpi525tx19+1Fre1opbRfQ9eObiX0w3rmZ2H9udGsrvvhi6dZW7D815jnYflhb9zvfKztfTnuXN4u0tpbUfF7y/JsfPT/13brZne08kptfTm+L3FvBfV/i1gruX5S4s4L7/rgE62DG21+0/1BE3y1SKSKvj0scH79njePj96zx+TdT2xJ3l0DZNigzUCPau0dlRfJjvPfdBHnekreLNOOOyN4uwvjktsh25ZJ72b5f/ORWtu9Xhlo1evU3F5daXzz0Gi+/VtquHHavLfaLj91qi/0idWsWu4W/vVzeWhfOmh1vFmFN/Ae+u1xeC7akv7uEYFsH91Hv7YX7nt4J6PttwuTgd5eaVON7WOv1VxR5c6lJ5TFEnx9DvleE9YI0tifbtgijoy1eF8nL88uXYH3dyrTjeP3dRWx/j8rXRAv1p5Vrfx4G/GpLYm1J2W3J7i2Wr9sq86fnO7m/HY0fn26Hx2Y79r+IOZv1cQl9PW0sdgHNeqTPLxSq2jfOkb5GaHW3DFpo/QXniMovOEe+2JJ754jax+fIbjtunyMav+Icab/rOWLHGhi1Y7OgcOzW/bPa/t+rBf10dG23jH3UtXzKD8sjt+/szJoWZOWom52RX7Az+jvvDKvpP/DNq57Jen1sov5mkcqW1PgVRdrx7u6st7Umpb+7JayhJMf7DdtpWHu3iFLk7R9RqsrLfXt+eP7xXWv4x3MD9yXuPfnuPp36BSVu/ubQtkGFRfokjk2DbhfqurE81n4zlMfvx+X79Wbsfhzrbphth5ruhdkXP45VmcZS7eXOfFHk6cdsvG2KbH8R5+bPdO2K3BsD3Je4NQb4RYk7Y4D7n7a791Ow/vEz/Oe/+BLt459uj/YLfrp9+1C2Rrofb5lf/1zp9q1q4/csn0v89O34roSzbrE/rRH4nRJt9bTyvI7sd0r0YEnNo7xToh6ExvH0ExPf2QoW5RzL6r5XorPWd3lrR8bK9rNE6e9tBT+bU/T5l6++UUKfXtM9P3L8VCK2PxTVmA31fGaUfn9PVuYUifcaQ/ktlef7hHfb880S7WB98Po8z+bH56+2/bmrW79XsF8Im3XBf5iVbfdL9LUNx/OPhXyjRBMWFP5hAd2f2+IXTKFqx++8GnDlnVb1ttmZ3aQUD336JV57NcT+VZH1xvLBvb8ssp/Fse6qS3l9hrTy8Wcq+wFLro3Pq73eP8k01s8lPEpsjkv5BdNRWvkF01G+PLjxdHBf3Ua24r/3GcL6t/X5puO3Ddu2t3FMG96MaH1RpPLzY74psnusvjtQ2Gr5dKBwux13Bwpblc8HCttuiuy9gcJtAJTCm/4yfmlglen9pw3Zra8yt+Pp5wNVbgeAH51h5NdLzbTdWoA3v0Bq2++p7n2B1Hbr+N37Amlb4t4XSPf35PUXSPsWvfcFUtu9eLn5BdIX23HrC6QmuyGoWx8dtN1rqLtfIO2L3PwCaVvk7hdI+y25+QXSvsjNL5Da7sXL/S+Qvipz8wukL8rc/QLpqzI3v0DaN/DNL5D2RW5+gbTtQfc+l9l25JtfIO1r3PsCqe3eSd0MA9uuC3zvC6Ttdtxs0v2hvfcF0hfn6t0vkL4oc/cLpK/K3PwCafszNrL6TXkeDlb7RgnlnlXfK8E82/r0AxS/uUPz7Vg/L5OON0v09XHK063md3bkef3Mp/V8v1PC1yuLH+ccf6NEFAZVtm3hv3OR4jxtPq86+70iEQxi9vpmkX7wM3T1vSNT1848LuLv9RVZb/geZ0p5byuYTv78+vYbJcqx3mj98GPo3ylR+JW0ou29EnxOVtp7WyGrwz7wva2wyniIxnslnGeI1t/bEc5Oqe/tiPDjd2Jv7Uis54dQf6dAV5al2XT23Uu9zwfY+8GCQ+/txTove9iHzfBeAamMr9XnW+Lm90usD1jled2ld0s83Xh9q8TqGlLD3irx/BsXT/Nwv1NC14vix/uN99pCnJ/YeX5r826J9w7q0091POfdt9qCD4lU3juo/Gq9PP9q/bdKrJ/7FLU3D6rzxZy/tRVjGI8bC32rxNPvlrbntfl/KtGP3Z18Jbqff+m63H9t3tYI5/g18vf2ZM1RLc8/6fytEs4bwfc6SWmdT5mP8uaO8Mh51I9LlHe3IijxVm9/3KfSFhofb8V7B7Xqes37GFl5OZDQ9y+dbo0X9907p3vjxdsS98aL7+/J6/Hi7SPAmk/xw0jVNypYZR6YyOvW7DfHm3dHZFtjvXrfjVnf347XNfbzBBmffRop/nkr6seroW1L3Dy3tj9HcG8iWN+9YLo3EazX7eKSxg/fPN8tafxUZDP8OH4yZxXpr4em+u7lzL3JIfs2LcILVXv5GyBd9j+SPm80Xv+KyLZJHy8ieFx+cNk06nb50XU33aW/W8TWEFV/TrDvFalratoD9d0iayJ6f57N/s02WWufPJrH3zxb27rS9vY0VeW3Z+vdIk+/f/XNIivNHujvFXm8G7J1I/Z4E7grs23aRtM+vW7+uWlvh/PLNxl994tRt35X/Iv2eP7RqSPqu816iD+V2Zwn23H7+0dHP16HYV/i1hzsL0q8nIP9Px//5Y//9ue//8tf/vZvf/zHn//21/94/N1/j1J///Mf//Uvf7r+6//+z7/+29P/+4///9/n//Ovf//zX/7y5//zL//+97/925/+13/+/U+j0vj//nBc//E/ojwOWBSN//lPfyjjv4/fDg4r7fHf5fHfH5tudfx/41+ujwf3f3r8R/7L+W8/Ri4ff23H//zvsbn/Fw=="
+      "debug_symbols": "tb3druy6daZ9Lz7OgcjxR+ZWGo3ASbsbBgw7cJwP+BDk3rs4JPKptXYXp2bV2ifej+09x6M/vpKoIdV//eF//elf//P//Muf//q///Yff/jn//Fff/jXv//5L3/58//5l7/87d/++I8//+2vj//1v/5wjP8opf/hn+Wf/lDq47/a+Ge5/lmvf8r1T73+adc//fpnXP9s1z/7+U+56slVT656ctWTq55c9eSqJ1c9uerJVU+venrV06ueXvX0qqdXPb3q6VVPr3p61bOrnl317KpnVz276tlVz656dtWzq55d9fyq51c9v+r5Vc+ven7V86ueX/X8qudXvbjqxVUvrnpx1YurXlz14qoXV7246sVVr1312qNejH/W659y/VOvfz7qlWOAT4gJj5JlHCvtUbOMf7kfE8qEOkEm6IRRuQ3wCTGhTegn1OOYUCbUCTJBJ9iEUbkPiAltwqj82AC1HBPKhEflmiATdIJN8AkxoU3oF4whdEKZMCvXWbnOymMc1RjgE2JCm9AvGIPphDKhTpAJOmFWlllZZmWZlWVW1llZZ2WdlXVW1llZZ2WdlXVW1llZZ2WblccIq2MXjCF2gkzQCTbBJ8SENqFfMIbaCbOyz8o+K/us7LOyz8o+K/us7LNyzMoxK8esHLNyzMoxK8esHLNyzMoxK7dZuc3KbVZus3Kbldus3GblNiu3WbnNyn1W7rNyn5X7rNxn5T4r91m5z8p9Vu5XZTmOCWVCnSATdIJN8AkxoU2YlccYlDqgTKgTZIJOsAk+ISa0Cf2COivXWbnOymMMig3QCTbhGt1SY0KbcI1ukWNCmVAnyASdYBNmZZmVZVYeY1D8AWMMnlAm1AkyQSfYBJ8QE9qEWdlmZZuVxxiUsQvGGDxBL/ArD2WMJj0GPFw6Nt0YOyfEhDahXzDGzgllQp0gE3TCrByzcszKMSvHrNxm5TYrt1m5zcptVm6zcpuV26zcZuU2K/dZuc/KfVbus3Kflfus3GflPiv3WblflfU4JpQJdYJM0Ak2wSfEhDZhVi6zcpmVy6xcZuUyK5dZuczKZVYeY0dtQL9gjJ0TyoQ6QSaMyj7AJviEmNAm9AvG2DmhTKgTZMKsPMaOxgCfMCq3AW1Cv2CMnRPKhDpBJoxLpTLAJviEcbUkA9qEfkFeII7lySvEhDpBJugEmzAqj2XO68SENqFfkJeKCWVCnSATdIJNmJXzinGsV14yJvQL8iJRB4w6fcDjr3ys6Rhfnv9Xm9AvGOPrhDKhTnjU8bHfx/g6wSb4hJjQJvQLxvg6oUyoE2blMb58bLoxvk4YlcfCj/F1QpvQT7Axvk4oE8YF7TFAJugEm+ATYkKb0C8Y4+uEMmFWHuMrygCdMCrXAT4hJrQJo/JjvWyMrxPKhDpBJuiEUTkG+ISY0Cb0C8b4OqFMqBNkgk6Ylcf4ijYgJrQJo/LjALAxvk4oE3zC+Kux5cdIaWNNx0hpMqBOkAk6wSb4hJjQJvQLxkg5YVb2Wdln5TFA2lieMUBOiAltQr9gnKTaWMFxkjqhTpAJOsEmjMpjTccgOqFN6BeMQXRCmVAnyASdYBNm5TGI+jjGxiA6oV8wBlEfB9sYRCfUCY/KfWyEMYj6WMExiPo4fsYgOiEmtAn9BB+D6IRRpw/QCTbBJ8SEdsE4wstRB/VJ4xgvhwwat2mHDdJFtsgXxaI2SfJ/G0smbVGfpMeisqgukkW6yBb5ouXQ5dDlsOWw5bDlsKwXg/Jv26Dxt+M+2cdRe1FZNP62lEGySBfZIl8UkyLrja0b+bdj60b+7ViWsEW+KP92bMlxoF7UJ7VjUVlUF6VjrFvTRekYa5mzAifFpJwFGDfZnjf9daxv3vWflH+rg8bf1rFGeeN/UlvUL4q89691UFlUF6VDBukiW+SrSixqi5YjZwFOKtd2jlIXySJdZIt8Ub/2TNR67ZnI437shai6yBb5tZ2jxqK2aO6jkGNRWVSv/REii/TaCyG2yBf1a89Ejo+xP0JlkV57JnJ85NbQtf10bT9d2y/HR+4FW/vI1j7K8ZF7wdY+srWPbDlsOWw5bDls7aM8isetUuRRfFKflEfxmGCIPIpPqotkkS6yRb4oFrVFwyFjCfLIPqksqotkkS4ajnFPGXm0nxSL2qJ0PI6Ilkf7SWVROmKQLNJF6WiDfFEsaovS8dj7LY/scUvX8sg+SRfZolFv3B20cRnzmFsdNOqpDuqTMuVPKovSYYNkkS6yRekY65HHvY7ly+PexhLkcW9jCfK4t/EXedyfJIt0kS3yRbFoOMaVecuxkJTnj3Ep3fL8cVJdJIt0kS3yRbGoLeqTbDlsOWw5bDlsOWw5bDlsOWw5bDl8OXw58jwz7gVanmdO0kW2yBfFojYpst7YM1EXySJdZIt8USxqi/qkHLUnLUdbjrYcbTnacrTlaMvRlqMtR1+Ovhx9Ofpy9OXoy9GXoy9HX44+Hf04FpVFdZEs0kW2yBfForZoOcpylOUoy1GWoyxHWY6yHGU5ynKU5ajLUZejLkddjrocdTnqctTlqMtRl0OWQ5ZDlkOWQ5ZDlkOWQ5ZDlkOWQ5dDl0OXQ5dDl0OXQ5dDl0OXQ5fDlsOWw5bDlsOWw5bDlsOWw5bDlsOXw5fDl8OXw5fDl8OXw5fDl8OXI5ZjjfO+xnlf47yvcd7XOO9rnPc1zvsa532N877GeV/jvK9x3tc472uc9xznY6qi5zg/KRb1K5v6ObqTyqK6SBbpIlvki2JRWzQd5TgOsIAVFFBBAx0MsIHYCraCrWAr2Aq2gq1gK9gKtoKtYqvYKraKrWKr2Cq2iq1iq9gEm2ATbIJNsAk2wSbYBJtgU2yKTbEpNsWm2BSbYlNsis2wGTbDZtgMm2EzbIbNsBk2x+bYHJtjc2yOzbE5Nsfm2AJbYAtsgS2wBbbAFtgCW2Br2Bq2hq1ha9gatoatYWvYGraOrWPr2Dq2ji1zZEyLPtDBAIdtTGE+sE8smSUXDtuY9XxgBQVU0EAH09YTG9gXZpZcWMAKCqiggQ5iK9gKtoqtYqvYKraKrWKr2Cq2iq1iE2yCLbPEW6KAChroYIDDNuZzS7abXJhZcmG2N9TECgqo4Kgbo00ie0yuCpkPF1YwK+SOzXy40MCxvJHHTubDhQ3sCzMfxsRuySaUiRUUMOvmyueYj9ySOeYvLGBu3/yzHPMXKmiggwE2MBs8RjdJdqRMLGAFBVTQQAcDbCC2jq1j69g6to7tbFrJnXU2qeQ+PttUBl6NKicWsIICKmiggwE2EFvBVrAVbAVbwVawFWwFW8FWsFVsFVvFVrFVbBVbxVaxVWwVm2ATbIJNsAk2wSbYBJtgE2yKTbEpNsWm2BSbYlNsik2xGTbDZtgMm2EzbIbNsBk2w+bYHJtjc2yOzbE5Nsfm2BxbYAtsgS2wBbbAFtgCW2ALbA1bw9awNWwNW8PWsDVsDVvD1rF1bB1bx9axdWwdW8dGllSyRMgSIUuELBGyRMgSIUvkzBJJDLCBfeGZJScWsIICKmhg2jwxwAambVwbyZklJxawggIqaKCDATYQm2A7s6QlVlBAB7PCOFHJmQ8njgo9t2/mw4UCKmigg9mOmJsk8+HCvjDz4cK0pTjz4UIB05bLm/lwoYNp64kN7AszHy4czUzHkTjamY5c3myaO3IfZ9vchQE2cDRIjad2JVuA6pFrkQ10Ry5OttAdacsmugsVNHDYstk0G4ImNrAvzJa6ksubvXTZmpodQbXkns9+upKLkx11JRXZU3dhgA3sC7O37sICDlvNZcgOuwttHUadI+oc8yc2sE/Uc8yfWMAKCqiggQ4G2EBsY8zX8bCmZPvQxArmCkmiggY6GGAD+8JsiL2wgBXEVrFla2zNZu1szLswwAb2hdmgd2EBKyiggtgEm2ATbIJNsWXrbNXE3EMl0UAHA2xgX3heKZxYwAoKiM2wGTbDZtgMm2NzbI7NsTk2x+bYHJtjc2yBLbAFtsAW2AJbYAtsgS2wNWwNW8PWsDVsDVvD1rA1bA1bx9axdWwdW8fG/YV2bB1bx9aXzY4DLGAFBVTQQAcDbCC2gq1gK9gKtoKtYCvYCraCrWCr2Cq2iq1iq9gqtoqtYqvYKjbBJtgEm2ATbIJNsAk2wSbYFJtiU2yKjSwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLnCxxssTJEidLnCxxssTJEidLnCxxssTJEidLnCxxssTJEidLnCxxssTJEidLnCxxssTJEidLnCxxssTJEidLnCxxssTJEidLnCxxssTJEidLnCxxssTJEidLnCxxssTJEidLnCxxssTJEidLsh3uMXGT2Bfm6zwXFrCCAipooIMBYjNsjs2xOTbH5tgcm2NzbJklOe/p57xnYt63jNafBxawggIqaKCDaeuJDewL875FjsQCVjBtuWR5C3OhgTl7exYLsIFrTvdszruwgBUUUEEDs64k9onZpFdHy1PJLr2JFRRQQQMdHNtMzroN7AvzvkU0sYAVTFtNVNDA3GZpy9S4sIFr5j/qARawggIqaGCuxfneZl+YdygX5lp4YgUFzLWIRANzm7XEABuYtrHfIu9QLixgBQVU0MBhG41hJbsBJzawL8x8uLCAs+2wnP1/ebt+NQCeGGAD+0I/wAJWcPYaPlBBAx3MnssTG9gXnq22JxawggIqaCB7PtjzjT3f2PONPd/Y840939jzjT3f2PONPd/Y850939nznT3f2fOdPd/Z850939nznT3f157PBsaJBVx7/uxXzD1/NizWEwNs4NrzrRxgASu49vzZzHihgQ6uPX82NF649vzZ0nhhASsooIIG5tYpiX1hjvkLCzj2heZa5Ji/UEEDs2W9JQbYwL7wbI0/sYAVFFDB3Me5FufoPrEvPEf3iQWsoIAKGuggNsNm2BybY3NsefbXfF09z/4XGuhggA1MW658nv0vLGAFBVTQQAcDbCC2TILR9FqyA3JiBYfN8ijJJBjvc5XsgpzoYIAN7AszCS4sYAXTlh8GyCS4MG2e6GCADUzbWPRsipxYwAoKqKCBDg6bH4kNHLbREVayPXJiASso4FB4TXQwwAb2hTmBmY0X2R45sYICKmhg2jwxwAb2hRkVFxawggIqaCC2vDzw80sMDewL8/Ig+x+yZXJiBYctcqufXwDILXl+AyC3zvkVgBMDbGBfeH4N4MSsm6SLbJEvikVtUo7gvADNfsYLcwRfmMddUl0ki3SRLfJFWXEMi2xVrNmCkb2KcpIuskWPv5bzT2JRW9QnjYF4UVmUktxbOQwvzI2Sa5vD8EIHczFbfiQjK/REAcdyStIoMBoZavYjTgywgX1hjixLKovqIlmki2xRuzZize7C3Ig1uwvruL2s2V04cfz9eHBZs7twYi5pLv8YMuOiqGZz4UV90hgvF5VFdVFWzAXJAdByQfKl+9xK+db9SWXR+Ovcsvni/Um6yBb5oliUklTncX9iHvfjMWLNFsGJFczFzAp5mLdckDwZnjhOhpL/ap4Lzw2T58ILBVRwlO25N88PX5wYYFsbPEfSiTmSLsQW2AJbYAtsgS2wBbbA1rA1bA1bw9aw5bnwQp+HeuOgbhzUjYM6T4UXlonl/LRFTayggMPbk2yRL4pFbVGflOPopLKoLpJFy1GWoyxHWY6yHHmOGi981mzBm1jA1HiigCmSRAMdDLCBfWGeoy5MWy5OnqMuFDBtkWigg2PwHLkfxhCd2BfmGM3dkGP0pLpIFukiW5QVR85k850c+b/m9y+OXP78AsaFCho4Dq7xZLtm893EBvaFOUovTFtSynLLu4AKGuhggA3sC+MAC4gtsAW2wBbYxiiVkss7RunEvnCM0okFrOCwlTzs8hR5oYEOpi23U54mL+wL80RZcsnyTHlhBdOWx09X0EAH09YSh23cj9bs05PxhmHNPr2JAiqYx5MkjrrjMW/NPj0ZM4o1+/Tk/FrTGPgXnh+4ObGAaWuJAipoYCZbLm9+5UZycfI7N3l8Z3OeSC5OfusmzxHZnDdRQAUNdDDAtOUy5Kn2xDzD5kkyO/ImCqjgUGguujgYYAP7HJrZkTexgBUUUEEDHcwrr9xm+RGcCws46mr+uxkEFyqYa5F7PoPgwlyL3OoZBBf2hRkE40XHmr13EysooIIGOpi2PM4yCS7sCzMJLixgBWVeSJyfqcoLosqZ+fpU1Yl94fm5qhMLWEEB11Xc+eGqCx0McF2JnR+wOvE8NZ9YwAoKqKCBDs6r+Jr9dDLu92v2002soIAKGuhg7ouW2MC+MMf8hevKN/vpJgqooIEOBtjAvjAH+pgxqOeHrS5UMO9RjkQHAxxrMSYaanbOXZgX1eMF3JqdcxMrmPdDkqiggQ4G2MC+MMe85c7KMX9hBQVU0MDcZrnGyp439ryx5409b+x5Y88be97Y88aeN/a8seedPe/seWfPO3ve2fPOnnf2vLPnnT3v7PkxTCPHcbbATSxgBXNfeGKADcx9kYueZ94LC5g3VHnA5Jn3wrHNPI+HPPNe6GDeueUy5Jn3wj4x+94mFrCCAipooIMBNhBbwVawFWx55h1TNjV72WRMotTsZZMxXVKzl21iASuYy9sTFTTQwQCHbUyM1OxluzBH4YUFrKCAChroYIDYBJtiU2w5CsekT81PaU1U0EAHA0ybJPaFOTYvdDD/hdwX5x3vibk4R2IFBczFyZ2Vp9ALHczFaYkNTFvugDyFXjhsOTWRTWmS56xsSpO83cymtIk5GZB7Pi+mLwywgX1hXkxfWMAKpi0XMi+m89ydTWmSp9tsSpO8N832M8mbsWw/m1jACgqooIFZbGz17C6bWMAKCqiggVls7IDsApO838susIkBNjD/bKx8doFNLGAFBVTQQAcDbCA2wSbYBJtgE2yCTbAJNsEm2BSbYlNsik2xKTbFptgUm2IzbIbNsBk2w2bYDJthM2yGzbE5Nsfm2BybY3Nsjs2xObbAFtgCW2ALbIEtsAW2wBbYGraGrWFr2Bq2hq1ha9gatoatY+vYOraOrWPr2Dq2jq1j68vmxwEWsIICKmiggwE2EFvBVrAVbAVbwVawFWwFW8FGljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJn1HRExU00MEAG9gXnlFxYgEriK1ha9gatoatYWvYOraOrWPr2Dq2jq1j69g6tr5scRxgASsooIIGOhhgA7EVbAVbwVawFWwFW8FWsBVsBVvFVrFVbBVbxVaxVWwVW8VWsQk2wSbYBJtgE2yCTbAJNsGm2BSbYlNsik2xKTbFptgUm2EzbIbNsBk2w2bYDJthM2yOzbE5Nsfm2BybY3Nsjs2xBbbAFtjIkiBLgiwJsiTIkiBLgiwJsiTIkiBLgiwJsiTIkiBLgiwJsiTIkiBLgiwJsiTIkiBLgiwJsiTIkmzy0nzkkE1emvO02eSl40uaNdu5dPQj1ey1knxAl71WEw18KHS0XT0wwAb2hfnx6QsLWEEBFTQQm2ATbJr/riU6GAstbbnyJqCCWSFXfhz2mk8fslNqYgP7wnHYTyxgBQVU0EBsjs2xObbAFtgCW2ALbIEtsAW2wBbYGraGrWFr2M7Pv+cRdX4A/kQHA2xgX3h+Cv7EAlZQQGwdW1+2fn7iXRLzf9XEXAZPbGBfeH7a/cQCVlBABQ10EFvBVrBVbBVbxVaxVWwVW8VWsVVsFZtgE2yCTbAJNsEm2ASbYBNsik2xKTbFpthyHOezumxumhhgA/tCO8ACVlBABbEZNsN2jvmW2BeeY/7ErNsTR4V8Xphff9N8Xpj9UhP7whzHFxawggIqaKCD2AJbYMtxnM8s81twEysooIIGOhhgA/vCjq1j69g6thzH+Qg1W60mOhhgA/uFkg1Ymj8hkr1Wmr+xkb1Wmr+pkb1WExvYF+aYv7CAFRRQQQOxFWwFW4758RhX8ttvEwtYQQEVHHXHc1PJpivN37rIrquJFRwVxsNSye+5TTTQwQAb2BfmOL6wgBXEpthyHGvulhzHFwaYtkjsC3Mca65xjmPNzZfj+MJhs9wOOY4vNHDYLJchx/GFw2Z5wOQ4tlyGHMeWB0yeuy3Fee6+UEAFDXQwwAb2hTnmL8QW2AJbYAtsgS2HtOUmycE7HgpJtmip50GQg/dCB8dCem6SHLwX9oU5eC8sYNbNzZcD0nPz5YD03Hw5IBPzY2sTC1hBARU00MG0RWID+8IcvKNbVrLDa2IFBUxbTzTQwXlpKdnoNbEvzME73qOQ7PSaWEEBFTRw2MaDE8lOr4kN7AtzoF9YwAoKqKCB2ASbYBNsik2xKTbFptgUm2JTbIpNsRk2w2bYDJthM2yGzbAZNsPm2BybY3Nsjs2xOTbH5tgcW2ALbIEtsAW2wBbYAltgC2wNW8PWsDVsDVvD1rA1bA1bw9axdWwdW8fWsXVsHVvH1rH1ZctPu00sYAUFVNBABwNsILaCrWAr2Aq2gq1gK9gKtoIts2Q8mpXsHptYwAo6mH82AqSeoXBi9mBYooOx8BzSkljACgqooIEOBtjAvtCwGTbDZtgMm2EzbIbNsBk2x+bYHJtjc2yOzbE5Nsfm2AJbYAtsgS2wBbbAFtgCW2Br2Bq2hq1ha9gatoatYWvYGraOrWPr2Dq2jq1j69g6to6tL5scB1jACgqooIEOBthAbAVbwVawFWwFW8FWsBVsBVvBVrFVbBVbxVaxVWwVW8VWsVVsgk2wCTbBJtgEm2ATbILtvDwYV2JyZsmJBUxFS1TQwKEYM4aSn2Cb2MChGB0fki1jEwtYQQEVNNDBABuIzbE5Nsfm2BybY3Nsjs2xObbAFtgCW2ALbIEtsAW2wBbYGraGrWFr2Bq2hq1ha9gatoatY+vYOraOrWPr2Dq2jq1j68t2/q7jhQWsoIAKGuhggA3EVrAVbAVbwVawFWwFW8FWsBVsFVvFVrFVbBVbxVaxVWwVW8Um2ASbYBNsgk2wCTbBJtgEm2JTbIpNsSk2xabYFJtiI0uULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSO7OkJjawLzyzRBMLWMG0eaKCaeuJDgbYwL4ws2S0fkq2700ctp7Lm1nSc8kySy4cttHZKdm+NzHAYeuW2BdmllyYtkisoIAKGuhggA3sCzNLLsQW2AJbYAtsgS2jYrTySPbhac/NN0LBjtxmIxQmOhhgG5ibb4TChSMUJhawgjIwN2pPW26+bqCDAaYtl3eEgo2X6ST78Cxn67IPb+KwjTfoJPvwbDw0luzDmzhs4/mxZB+e1bNYLByj28bDUsmGOhtPJyUb6iY6OBanpm2MWMufK88muYkKGuhggA3sC8eInVhAbIJNsAk2wSbYBJtgU2yKTbEpNsWm2BSbYlNsis2wGTbDZtgMm2EzbIbNsBk2x+bYHJtjc2yOzbE5Nsfm2AJbYAtsgS2wRdrySA0HA2xgX9gOsIBp64kCKujr+M3RfWEDOcBzdF9YwAoKqKCB2Dq2jq0vW7bOTSxgBQVU0EAHA2wgtoKtYCvYCraCrWAr2Aq2go2oyNa5idgqtoqtYqvYKraKrWKr2ASbYBNsgk2wCTbBJtgEm2BTbIpNsSk2xabYFNv5o/MlsYF9YQZIPmDO1rmJFRy2fNacrXMThy0fRmfr3MQA0xaJfWEGyIUFrKCAChroYIDYHFtgC2yBLbAFtsAW2AJbYAtsDVvD1rA1bA1bw9awNWwNW8PWsXVsHVvH1rF1bB1bx9ax9WXL765NLGAFBVTQQAcDbCC2gq1gK9gKtoKtYCvYCraCrWCr2Cq2iq1iq9gqtoqtYqvYKjbBJtgEm2ATbIJNsAk2wSbYFJtiU2yKTbEpNsWm2BSbYjNshs2wGTbDZtgMm2EjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJEljSxpZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyZJOlnSypJMlnSzpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLOlkSSdLOlnSyZJOlnSypJMlnSzpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLOlkSSdLOlnSyZJOlnSypJMlnSzpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLOlkSSdLOlnSyZJOlnSypJMlnSzpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLOlkSSdLOlnSyZJOlnSypK8s0WNliR4rS/RYWaLHyhI9VpbosbJEj5Uleqws0WNliR4HtoKtYCvYCraCrWAr2Aq2gq1gq9gqtoqtYqvYKraKrWKr2Co2wSbYBJtgE2yCTbAJNsEm2BSbYlNsik2xKTbFptjOLGmJfeGZJScO2/gckGav5UQBh220n2r2Wk50MMBhG52omr2WNhpCNXstbbR+avZaTqyggAoa6GCADewLA1tmyfgUj2av5UQBFTTQwQAb2BdmllyIrWFr2DJLxoeKNFs0JzoYYAP7wsySCwtYQQGxdWyZJZqHRmbJhQ3sE7Odc2IBKyigggY6mLaW2MC+MFPjwlFhfCdHs0XTRnuvZovmxAb2hZkP4zs5mi2aEysooIIGOhhgA/tCwSbYBJtgE2yCLfNhNClrtmhOTJsl9oWZDxemLTdq5sOFAipooIMBNrAvzHy4EJthM2yGzbAZthz+ljs2B/poXdbstTTPfZwD/UIHAxwL6bnNcqCfmAP9wgJWcNg8lyEH+oUGOhhgA9OWi54D/cICVlBABQ10MMAGYsuB7rmhcqBfWMFhizzsc6BfOGzj4y2avZYThy3y2MmBfuGwjVYezV7LiQWsoIAKGuhggA3EVrAVbAVbwVawFWwFW8FWsBVsFVvFVrFVbBVbxVaxVWwVW8Um2ASbYBNsgk2wCTbBJtgEm2LLUBifKNZs8pwooIJp64kOBtjAvjBD4cICVlBABbEZNsNm2AybY3Nsjs2xZWqMnjLNxk0bj5I1Gzcnjgrj+bFm4+ZEARU00MFYmEkwvkOk2Yx57YDG9s0xf6GDAY41Hk+rNZsxL8wxf2EBOXY6ts6x0zl2OsdO59jpHDvnmB/LIOeYP7GAFZS5DNmMOdHAZRPGvDDmhTEvjHlhzAtjXso6UqUoaKCDsZahNHBtSWHMC2NeGPPCmBfGvDDmhTEvjHk5x3wuQ2VLCltS2JLClswxP76PqNmMOTG3ZNbNMX9hgA3MdRvHejZjTixgBQVU0EAHh230NGj2ZV5o6wDPZkwbnQ6azZgTBVSQQyMH+oXsLGNnGTvLD7CA7CxnZzk7y9lZzs5ydpZzIDoHYnBo5PAf/RqabZcTDRx1e26HHP49lywvDy7sCzMULixgBQVU0MCsm4dGhsKJGQoXFjDr5lpkKFyooIF5JZa7O0Phwgb2idlgObGAFRQwr+1bYoANzLVIzOF/4aOuj44PzVbKiQLqwJJooIMxsCY2sC8cw39iASsooIIGOojtfOqZy3A+9TyxggIqaKCDATawL1Rsik2xKTbFptgUm2JTbIrNsBk2w2bYDJthM2yGzbAZNsfm2BybY3Nsjs2xOTbH5tgCW2ALbIEtsAW2wBbYAltga9gatoatYWvYGraGrWFr2Bq2jq1j69g6to6tY+vYOraOrS+bHQdYwAoKqOBsdFI7HAwwx7El9oXlAHMct8QKCpjjuCca6GCADewLz9Q4sYAVFBBbxVaxVWwVW8Um2ASbYBNsgk2wCTbBJtgEm2JTbIpNsSk2xabYFJtiU2yGzbAZNsNm2AybYTNshs2wOTbH5tgcm2NzbI7NsTk2xxbYAltgC2yBLbAFtsAW2AJbw9awNWwNW8PWsDVsDVvD1rB1bB1bx9axdWwdW8fWsXVsfdmy13JiASsooIIGOhhgA7EVbAVbwVawkSVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBljSypJEljSxpZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJEljSxpZEkjSxpZkp2dPl6s0ezsnFjBYRvv2Gh2dk4ctvHRHc3OzokBDtv4tKNmZ+eFmSXjLR3Nzs6JFUxbJCqYNk90MMC05QpllpyYWZJ3t9nZOXHY8pY2OzsnKjhsNZc3s+TCABvYF2aWXFjACgqoIDbH5tgcm2MLbIEtsAW2wBbYAltgC2yBrWHL1Ki51TMfau6hzIfxyT3Nbs2JfWHmw4VjeSUPrsyHCwVU0MBhkzxKMh8ubGCfmN2aEwuYNksUUEEDHQywgX1h5sOFBcSW+TBeQdDs1pxoYNpaYoDDlk072a15YeZD9u9kt+bEYctWnuzWnKiggQ4G2MC+MPPhwgJiE2yCTbAJNsEm2ASbYlNsik2xKTbFptgUm2JTbIbNsBk2w2bYDJthM2yGzbBlPmSDT3ZrTqyggGnLQyPz4UIHA2xgX5j5cGEBKyggtsAW2AJbYAtsDVvD1rA1bA1bw9awNWwNW8PWsXVsHVvH1rFlaoxGJ8sOTB9PQCw7MCdmhZ4ooIIGOhhgW5hJMPqjLLsq8yCw7KrMfWzZVTkxwAaONR5dU5ZdlRMLWEFZioptjXk71pi3Y415O9aYt2ONeTvWmLdDylocqaCACrJuOeZHA5VlV+XEYbOzbl+YY/7CAua6eaKAChroYIAN7AtzzFseBDnmL5S1s3KgWx4POdAvdDDAtnaAsbOcneXsLGdn5UC/UEF2lrOznJ3l7CxnZwU7KwpYQQ6NHNKWh2cO6QsbOOp6bocc0p5LlkP6wgoKqKCBDgbYFubg9Tw0cvBeKKCCWTfXIi8ELgywgXnZMXZstkdOLGAFBVTQQAdjYT4sHW+0W37XcmIFBVTQQAcDbGBfWLFVbBVbxVaxVWwVW8VWsVVsgk2wCTbBJtgEm2ATbIJNsCk2xabYFJtiU2yKTbEpNsVm2AybYTNshs2wGTbDZtgMm2NzbI7NsTk2x+bYHJtjy0eo4/mbnb2WFxYwR5YnCqhg2jTRwQBzZOVhf+ZD4pkPJ6atJVZQQAUNdDDABvaF5ycmTsTWsXVsHVvH1rF1bB1bX7az1/LCAlZQQAUNdDDABmIr2Aq2gq1gK9gKtoKtYCvYCraKrWKr2Cq2iq1iq9gqtoqtYhNsgk2wCTbBJtgEm2ATbIJNsSk2xabYFJtiU2yKTbEpNsNm2AybYTNshs2wGTbDZtgcm2NzbI7NsTk2x+bYHJtjC2yBLbAFtsAW2AJbYAtsga1hI0sqWVLJkkqWVLKkkiWVLKlkSSVLKllSyZJKllSypJIllSypZEklSypZUskSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyJNtE3U9U0MBhGw+b7GwTvTDvOnpiX5izHRcO23hqZGeb6IVj3cYjKDvbRC80MG0pziy5cNjG+1mWbaIX5j3OhWP2ILJCzoFcKKCCBjoYYAP7wpzWvBBbx9axdWwdW8fWsXVsfdmyTXRiASsooIIGOhjgsp0NoeP1NjtbP8c7bXa2fo7ufjtbPy8MsIG5vGMPna2fFxawggIO23jXyM7WzwsdHLbx2pGdrZ8X9oU5BXphASsooIIGOohNsAk2xabYFJtiU2yKTbEpNsWm2AybYTNshs2wGTbDZtgMm2FzbI7NsTk2x+bYHJtjc2yOLbAFtsAW2AJbYAtsgS2wBbaGrWFr2Bq2hq1ha9gatoatYevYOraOrWPr2Dq2jq1j69j6sp2tnxcWsIICKmiggwE2EFvBVrAVbAVbwVawFWwFW8FWsFVsFVvFVrFVbBVbxUaWOFniZImTJU6WOFniZMnZ+jleYbSz9fNCBwNsYF94ZsmJBUybJQqoYNok0cEA0xaJfeGZJScKyL9r/LvOv3smwYkVpMKZBD3RQAfHko1X4exs3LywL8wkuLCAFRRQQQMdxBbYMgl6bt9MggsLWEEBFTTQwQAbiK1j69g6to6tY8sk6Hmc5ZjvuWNzzCeeLZoXFjDraqKAChqYZ3RLDLCBfWGO+QsLWEEBFcytc2ID+8Ic3RfmWnhiBQVU0K5PIls2Y04MsIF9YX5Z+8ICVjC3TiQ6GGAD+8Icxxfm8rbErJB1x9iM8TqeZSvlxL5wjM0Yr+NZtlJOrANrooAK2sDc8+M8PzHABvaFfoAFTFseGi6gggY6GODY6pFLdo7j3A7nOD6RrRNZN/d8GOhggA3MtciDoB1gASuYa5G2pqCBw5a3MNk0ObGBw1ZyX4xxPLGAacs9P8ZxlFz5MY4jb2GyaTLydiebJifGxGyPjNFxZ9keObGCAmZdT4x5cJ2NkBf2hTliL6zgGDie4vPH+k4McOxCT1t+AP/E/AD+hQWsoIAKGuhgbtSxzbKjcWIBK5gr3xIVNNDBXIsjsYF9YX7q/sICVlBABQ0cdUdrl7XzlzYTc/CW3L45eC+soIBjLWoWy8F7oYMBNrAvzI/aj0YyO38l+8IKCqiggQ4G2MC+cAzeqLmaY/BOVNDAXIvzzwJsYF94/o5uHsrn7+ieWEEBFTTQwViYw3T0hlr2Lk6soIAKGjjqZudA9i5ObGCfmL2LEws41mL0T9r129knKmigg7Gw5FpoYi6vJSpoYG6HIzHABvaF5y/mnljACgqooIHYKraKrWITbIJNsAm2HMejVdWy83BiA/tCza2Tm1oLWEEBFTTQwQDTljsgT80n5ui+sIBp64kCKmigr511ju4TG9gX5qn5wgJWkOPBOR7yJHxuyTGOJ/aF4xI7xge5LXsMY/xmtGWP4UQBFRxrIZLoYIANTFvuoTw1S26oPDVfWEEBFTTQwQAb2Bd2bDnmM5Wzx3CigAoa6GCADewXevYjxmid8+xHjNGw6NmPOFFABQ10MMAG9oWZBBdiK2nriQIqaKCDATawL6wHOGyjF9Czd3GigAoa6GCADRy28eE1z97FiQWsoIAKGuhgpmcq8ux/YV+YZ/8LC1jBrJvbN5NgtBt69iNemD9eU3PP54/XXFhBARU00MEA28Ic86Nh0bMJMSz3RY75CxU00MEAGzjWYlzDeDYhTixgBYfN81jPJLjQQAcDbGBfmEnguX0zCUbXn2dr4kQBFTTQwVj7orGHGnsok+DCAlZQQAUNfNSVSNsY8ydma+LEXAtLrGCuRSQqaGCuRUsMsIFjLcYv23o2LE4sYAUFHLZzyXLMX+hggA3sC3PMX1jArKuJMVY+MUds5BrniL2wgrlknqhgLlluhxyxFwaYS5bbIc/zJ+Z5/sICVlBABdPWEx0MsIF9YZ7nLyxrjfOM3nJT5xn9QgcDHHXH3KBnY+GFeUa/sICPtRDPrTNG90QFDXQwwAb2hWNc9JL7YoyLC8e4mFjACgqoA7PYGBcTHQywgX1ituRNLGAFBVQwbZHoYIBpa4l9YTnAYRt3SZ4teX3clni25PWM+GzJ65m02ZI30cEAG9gXjtHSJRVjtEysoIAKGuhggA3sCwWbYBNsgk2wCTbBJtgEm2BTbIpNsWnWzS2pDsZCy7qS2Bd61s3N5wWsoIAKGuhggA3sCyNtlpi2PLiiggIqaKCDATawL2wHiK1ha9gatoatYWvYGraGrWPr2Dq2jq1j69g6to6tL1s2vvXxrWvPFrc+rqs9W9zOgyBb3CYGmKOlJ/aFOTYvLGAFBUzbiQYOm6Yix+aFbWGOwrwyz7a1PqYtPNvWJubozrU4x5slNrAvlAPMupJYQQHXkSpioIPYBJtgU2zneEu0tJ0ooC7MIZL3AdnlNdHB3FC5C3OIXNgX5hDR3CQ5RC5McW71HCIXKjhslls9h8iFATawL8whcmEBh81yv+UQuVBBAx0MsK193DloOzurs7NyMFxooIMBNnDFSvZzTSxgBWWOFmXg6DlwTnQwwAb2hTlwLizg499t49GAZzfWheOUNLGAFRRQQQMdDBBbxSbYBJtgE2yCTbAJNknbkdjAvlAPsIAVFFBBAx3EptgUm2EzbIbNsBk2w2bYDJthM2yOzbE5Nsfm2BybY3Nsjs2xBbbAFtgCW2ALbIEtsAW2wNawNWwNW8PWsDVsDVvD1rA1bB1bx9axdWwdW8fWsXVsHVtftuzGmljACgqooIEOBthAbAVbwVawFWwFW8FWsBVsBVvBVrFVbBVbxVaxVWwVW8VWsVVsgk2wCTbBJtgEm2AjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS/zMkpqYtnHx5GeWnFjACgqooIEOBthAbGeWeGIBK5g2TVTQwLS1xAAbOGzjub9n59bEAlZQQAUNdDDABmIzbIbNsBk2w2bYDJthM2yGzbE5Nsfm2BybY3Nsjs2xObbAFtgCW2ALbIEtsAW2wBbYGraGrWFr2Bq2hq1ha9gatoatY+vYOraOrWPr2Dq2jq1j68uWHWETC1hBARU00MEAG4itYCvYCraCrWAr2Aq2gq1gK9gqtoqtYqvY6hrHcebDuC+MMx9OLGAFBVTQQAcDbCA2xabYFJtiU2yKTbEpNsWm2AybYTNshs2wGTbDZtgMm2FzbI7NsTk2x+bYHJtjc2yOLbAFtsAW2AJbYAtsgS2wBbaGrWFr2Bq2hq1ha9gatoatYevYOraOrWPr2Dq2jq1j69j6srXjAAtYQQEVNNDBABuIrWAr2Aq2gq1gK9gKtoKtYCvYKraKrWI786EmKmiggwE2sC/MLMmnJdm2NrGCaZNEBQ3sM6PaGRUnFrCCAiqYxXLdzkuJEwPMRe+Jw5ZPQLJXbWIBKyigggY6GGADsWVU1NwkGRUXVlBABQ10MMAGrpNE41KicSmRHWyt5ibJqLhQQQMdDLCBfWFGxYUFxNawNWwNW8PWsDVsDVvH1rFlPkiuZubDhQY6GGADhyIf3mQz28QCVlBABQ10MMAGYst8yOdD+SG+iRVMmyUqmLaW6GDaemIDhy2fEmTj28QCVlBABQ10MMAGYhNsgk2wCTbBJtgEm2ATbIJNsSk2xabYFJtiU2yKTbEpNsNm2AybYTNshs2wGTbDZtgcm2NzbI7NsWWA5EOh/BDfxAAbmLY85DJALixgBQVU0EAHA2wgtoatYWvYGraGrWFr2Bq2jIpsUMvGt5ZPjbLxbWJW8EQHA2xgvzCy8W1iASuYxSJx7sLIDrbc1JEdbBMrKGAuZEs00MEAGwpsa6DHsQZ6HGugx7EGehxroMdRbS1DdTDABva1DOdAP7GA2ASbYFsDPY410ONYAz0OYd3OgZ5iZUsqW1LZkudAz2VQtqSyJRWbYlNsypY0tqSxJY11M/bbOdBPZEsaW9LYb+dAP5Et6dgcm2NztqSzJZ0t6aybs27OfnO2ZLAlgy0ZbMlzoPdEBYfNsm4O9AsDbOCwje8jRvbATSxgBQVU0EAH06aJbeE55nPo5eXB6ImMbHybKKCCHBqdQdbZWZ2d1dfOKscBFnDtrGyHm6iggQ4G2MB1IJZygLkWnqiggbmhIjE3VC5ZRsWFfWFGxYUFrKCACtrCcaz38SQzsiNsYoDj4e6Yn4zsCLsw+2EuLGAFBVTQQAcDxObY8gH+mOGM/FBcH+9RRX4d7vpf8/n8kZsvn88fufny+fyFAipooIMB5uLkhsoWlhOzheXCtPXEbA7LfXy2ouXmO1vRaqKtRc+n9heuFcpOs8e1c2IFBVTQQAcDbGBfmAfihWnricM2XjKN7DSbqKCBwzbe6ozsNJvYwL4wD88LC1hBAbPY2FDZMtbGy6CRfWJtvOsZ2SfWem6oPA9daKCDfWGeW8Yrl5GfY5uYFSIxxblJ8szQc5PkmeFCBXMX5nY4R8uJAbZV9xwt+b+eo+XEAlZQ1hrnmeFCAx1k3fIccK5QngMuZI2zB7nlv5s9yO38XwNsYF+YPcgXZr9nrlB2G5/HTnYbX+hggA3MumPz5cfJJhawggIqaOCw5YGYnVsTG9gXZg/yhQWsoIBDkQditmtNDLCBfWE2Hl9YwAoKqCC2ii1fNsgRkK1dE/vCbF2+sIAVlLnVs7VrooFrZ+WnxSKPqPyIWOQgy4+ITQywgbk449DIj4hNLGAFBVTQQAfTZokN7AuzB/nCAlZQQFvrlq8V5IDM7rEL8wWCc4XyBYILKyhgLnpus3yB4EIHc9Hz8MwXCC7sq0LD1rA1bA1bvkBwIbulsVsau6WxWxq2vhTZ5dXG2xORXV5tvBwR2eXVxvsMkV1eEw10MMAG9oV5QrmwgBXElieU8RpE5Fe7JjoYYAP7wjyhXFjACgqIrWKr2PKMM17xiLNP7MK+MM9DFxawggIqaKCD2ARb3gR57qy8sRmvYsTZ5XVhA/vCvLG5sIAVFFBBA1MRialoiX1h3s1cWMBU5BGV56wLFTTQwQAb2BfmmezCAmILbIEtsAW2wJZ3M5GHfd7NnJi3MJE7IG9WIg/PvFm50MFRLPKAyZuVC/vCvG+5sIAVFFBBAx1cirOPabzBEWcf03g7Jc4+pgsFVNDArOuJubxjd58dSxcWsIICZt2WaKCDATawL8wb/gvT1hMrKKCCBjoYYFuYg2G8vhJnm9KFFRRQQQMdDLCBfaFjc2w5LsZrMXG2KV2ooIEOBtjWVnd2VrCzgp2VB/j40k6cnUUtD5g8qi+soIC5OHlE5bF+oYMBNrAvzGP9wgLWdaSex/qJChroYIBt4tlOlOt2thPl1evZOHShzRU6G4cuDLCBuehjBJyNQxcWMDdUJAqoq0LBVrAVbAVbnqhOrAdYwAoKiK2eiv/+73/6w1/+9m9//Mef//bXf/nH3//0pz/883+t/+E//vDP/+O//vDvf/z7n/76jz/881//8y9/+ac//H9//Mt/5r/0H//+x7/mP//xx78//t/Hsfmnv/6vxz8fBf/3n//yp0H//U/89fH6T8vjKtWvPy+P601KPOZOfihSXhfRMVubJR5ng1Ug6g9/X1//vYxTY/699MoCRLm/FqLHWovHufvlWujrIuNK8qxQZP29yt0/l3yj/FyLx+N7lqDaDyV8U2JkxLUdWIRHrZt/nz+uln/vYuvvH/cWPxRom+2YXw85N4KV9rJE3+3LujaDh7wssduS+eLFtR2avtySZXNI1jpe4s4ajykFFqPoj4tRdoel2FoMNudj6un+ivS5Inoc8npFNjUsf6gsa4yPs60a/tPotN1eHfcq1161+rLE5sjK12OzQpOnHeL9doW2Bujjmvh1hburEa9XY7cx83NV58Z8zBO/KlE3UVO1zZx4TBmVlyXKp5uibo7Mx1zfOrofM9Sk1U+RK5uFGFf650L0eL0Qu7ysdW6JB3JUPOYG7q9IGe9CXSti5eWKbA6sSmgeLwvsR1j3dVA8Rf/Pe7R9Hnq7Go+bz1njcW/5+vwhxza/6xoiT1vjEYE/1tgcndbmHnlcgz1VqPcPDLV1YNjTKPv5wJDN4fl44N5Xjc4RLu2nNdksR+WMXB+X2+zY+0tx8xDf1ri7NeIXbI326dbYD5R1qTg+tvlqoGwqaH4E6DzGH9NUL49x3RyfjznadbX4mGp+qhH3a0isK4wfzu0/15CPz6qqn55VdxXunUpur8brs+rdralPZ6Pv7ZEjVo2ir2v0z69e7fgFl69leycwU/hxRf96XWxzYmy1zqP8gfby+nVfw23V6MfrGvrxUW726VG+q3DvKL+9Gq+P8u3WlGPtEZE394ivy53HfNDruxLfneNN55Vbieebip/vS3Y37KWsHC76OkO9fnxkuHx6ZOwq3Dsybq/Ge/n32IS6tqb311szPt+a7eOt2T7emvE7b82nYzPKW2eTxx/OxXg8THq9R0I+vvGOz8MzPg7P+Dg84/Pw3G/MTy8dx0+tzgrFXs+ltE10jtfu5r1Ni9fx2zaHVl9HZzmez6ntG5OVamVNVnorLycr91s02KLtvZ1ybzak2W425Fg3Fc+XbT+X8I8HSYtPB8muwr1Bcns1Xg+S7caU3tiY/lYJq2XNTsnLuYy+OSGOD8LOo6J7f6+E6I0S+wPr1jRb/zg6+8fR2ePj+a3ePpzf2i7DvcnCchyfzhZmRL9+OCFzRfz5mlOav1vE3iyi615zfIhoU0Q/nXbcr8uayHjgu+tS16yO16f0/GaRsFWkv7trZN2XjK9ubYrsbuEfj0nWPfyDy8vpsm2Zu/N2XxTpc/90Kf3NIrKeZXV5ejj6vSI3pxDLbvbu7hxi2T2DuTmJuF2OVtcWaU8Xcr9djrtF/Hi3yDrHPNDfK/IYEzxAP0psymx3sa1g68+XD9882BoH2/M4/l4R7xR5PQDvn71fP7TcPUXILylniYiXJ639FfKt5zpl93Dp7o3kvoiuVVHtZVNkP31va+TpZm365w+Cd4+Ybj4J3pW4+ShYPn8AWuTjJ6Bl94RJiq7Z4scWfX3Ou71XNs+190fHevBXo+lbNYRj/XG6i3drHB/XeGqDeU6x79VYO/dR7nWN3STSzRuhL2rcuhPar4tykKm3z2u8eYw9HoHwiKa93re6u0v29UiiRN2Muu2CxJo/eVxovo5Cbb9g57bfeefmz3Nd67IZuFZ2lyCxngg8rt7e3ajraveRXps+o02iygrlxx3W68XYPqjpttalx+bebLccygzy0+Hx282xO2fbeoan9kM3xndO/H7MldHni5jvFbFYTxdsd/Vgv6Cxr/gveDa6XZ3nedzH88nXq7N/aHN3deT3Xp3a5knT5Nitjn14qbtfDF+H6/j9xM1ixG7YrEO+UqL+Zpt+3mSyXYpV4Xnw/mYpYjfD/jjGdCXi8TTZ5N8ocuSLM9eNXXvO5u8U6e3pecFTq8l3tkis/dI3+yX0dy3x2Aa1sz3s9UbVX7FR9Rds1G2Ru8fIdtjFuiQavznxXsD/MB0p+m6RNUU0vtX6ZpFYFzTjK3hvFvF1mIwPlL0u0vQXBPxuFuKXBPz4wNlaHd+tzu6xuOWPRFzr07W/c7CFr3ur8N42S9I/n0box+fTCL18PI3QP26jLl0+n0bo+vE0wu450+1phNt7ZXOLtz867k0j7GrcnUb4osbxcY17d4n1uHv7bu9t07vTGfsat6Yz6u6B1c073i9q3Lvj3a6LHuv4eH769pvliN97Oe5Nq9yu8eaYuzmtUndvO92dVvniYL95gJTfecfcmxKp23eF7k6J7Bfk1pRILfHplEgt7fMpke1y3JwS+eIiJrgoezwxe3ERU3fvPpXxs78UeXrd8xtFtDI5U5+6KvxbK3NzOTZx6H21BI/vV2yuyDZzGevO7Omd0Z/eOv3qRqYGNzLS37wbUl5/Pfx4uTm2k8yH/D+T/X6Jm3v2i5v/m9vj+AXbY/eQ6u4t5rbIzS2yf0T9tDLH8fx0+XtPug/xpzKbR/f1+CUPzHdlPL9vdt6X9ePlFMC2BDdl46Ot75UIlqK/LLHvmzl4a/t4uw1ovb0+fvfwZZH9Cw4h657s+f7yOy846Dp3N5XXNerupaaSv19+Xc3o6wsR/fyd56ofv/S8LXHzVd/baxKbNdk+VVn3IKX31/dCuzejbl7afbEcazLlcRn5+lp3d4jdvKLaPR96pNeaBNF4bg+T+8tx74pquzke0w8H0w/trU36uC9YTcNlc7Vsn1+k2q+4SLWPL1L3L1itrdH8qfHvN5992L7mequzfv+RgFtt8dU/f7+0+scvmG5L3Eww//wV0+0Gvdcavy1xrzW+ev/8Fnlf416Ols9PTPtruXt9tvsvQNzrkN3WuNkgu33F/mZL6e0am47SfY17DaUiv+LyeLtVb7aT7pfk7jGy3SY320n3H4P4fG3uHqv7dbl5rMYvOFbjFxyr8QuO1fgVx+p+q97rWr7/VZ7XV1LbR1J3ujC2kxdljZfHlcxzu4/9tBS7rhTh4wGiL+fYtiXuzcPsnkjdm3XYboxjHRo/vcb788aIzx8D1/4LPs4jnz9ck/2bOqtV4KkF46fv6sj+vaXVJ+CvK2y/HbCOjGK1PtWQb2wK2kCsyqbG9kaQKH3w8+O5+0cYD8X0+QL5N0fYroY5bX7x+q1i2T2NuvlMXY728dW+7N7cuHdZuC1x72pftl/eu/dMXUr99Jm6FPn8mfr9vbIZ9vuj49Yz9W2Nm8/Uv6pxfFzj3jN1KXfvf+y9bXrzmfoXNW49U5f6+bvSX9S4dT+4X5d7z9Sl2u+9HLeeqd+v8eaYu/lMXbav5dx8pv7FwX7vACn9d94x956py/5+8N4z9S8W5NYz9fz06mfTlSL++XTldjnuTVdur+iemjblzWvC9QjL9XWF+BVPB7+ocvPhYG39l8x+7Mrcezi4L3Hr4eAXJe48HNxPjt28NdbfdwLmG8eI/JJjJH7NMRKfHyPx+TESHx8ju9uxWDMfj8c/T6ksPyWqfXy7vy1R3NYXCx/8/Oz35zDaPoq6Nf2xL3Fr+kOs/97bgw/Kjx+df709fHc31daJ+4GvupS2JW5/FHj3DOfeV4G3JW5OgGxL3JsB2W6Nu1Mg+016cw7E2+dzIF8cZn199L+MHxl+fZjt+p1qCW7a2/Pe+WkeJMp2HuTO95a3y1HXG5P1wZvl2D7pW4dJNdsU2W7YeLrcHb/yudmw9nGebUvcy7OI3zfPftweT80bv833bZnM7quMlk0s7r7k95jdYULEni98+7tF2i8o8sNF/LeKPM3NRN8U2XWCPB5JzcP+cUBxVdTLT0V2B1sT7s+eMva3RXaf5Ocmr7anvpbvFWmlryLP33D6ZhGWpNovKCLHpshu75jRfvB8Gf5zkd0jKvN122r+dJx8axcr8fiY827vHidt5Vo/9M1toutgq+q7bbJbHV9ti48pJ31vw2rnOz+92XtFvMZTE6b9itXZ7eK7edJeh5Luvvl3cyJfj/1n3Zmorb5ZkF2HvMUsMn5vjDNG+6nG9pkoE2A/tOr/9FHh3UMrOTgRH8/NZT/X2J3/yrFaIEdjub1em+1mXXfAIk/vDfx2s26L9KdJ9M2Z6zvnc395Ptfdc6e7x1rZ3Qn3vu4wHmyvr1B0+/xK1nVOff5tiMfp9aci9dNL4f0muffpUC2ffqRyv1Hv7999GTsoYyqbMrumleALBM+DuPl3FoWvspQIbZtF2U3c1NVO6PLDvMtPRXZtK49jaIV9efrK7beKWFmJ8kB5c0mePruhEm8uiawvmpp0f3PDyvrlNn8s1GZJdg+z3LlQau8WidWe/cDyZhF6tR74bpFYL5o90N4s0n19eac/db1/cyDHSurH1OPzlya+V6Y9/YpFs3dj5XF3weznc0r+pox8PLm1LXFvcmtf4tbk1hfbw5hSai6bvbN9mFNa4xW658v7n3L289+b+mI5+tMLdF1eTdKrbrZJr2uCrNeX0ydflFir0qu/moT9Ys8Eq9KivX3A9/WCw4M3s+y6e2nk3qzUvsStWSndvRx1b1bqO9tjezL/okxQxvTtMtYpE6/nDHX7G1T39s62xL29Y/X33jvP26P19/eOU6a/e87pB5ePvVR7t4zwEyCPEbi5Vto9pbp5ztmVuHnO2Zb4BeeczgcKS3fd7J3PH3RtSzyuTQ5eHI2i7xVh3vHB1d4ssn4SalzevHfK6MH7F31/yii//21xXbMFVY7Y3BbfLVLqm0V0ndCr6vFmEVu/WV7Ny3tFHtthBfXxwzTb/cf3fb39/Xj0FS8f32+f3bE9qrzuAND4BR9c0/gFH1zbTjoy137obmV2vwd0500O3X07/jHPv+ajmu8W41f8FPquiNV1RW/1h3vq8o0iRPRP94/fKRLK7fAPt1o/FWkfv96yL3Hv2qZ93O/yxdZYz7isSd9sje3pdz3PcW2yKbL7DDVPHcrxcjp5uxi2LqLdfrhp/M66mK2PR1qzt4s8fcayv11kzSD5Dw+qv3O0txUij8d1myK7bwP+kiJ3+3e0+8eXm7sSNy83u398ubndGjf7d77YpPf6d+zYXljd69/54kSzfnrpcW2kmxPNrkivFNmcrexXvJL1xZIED6ZK2yzJ9kcC1nlzdM5R5De/47xtNJd1lojnl4i+U0R1TWjr84eTf1ukf3rK25e4dcqz8vE30/Zbw/gdm+fGgd9sjfLxBcC+xM2tYb/v1nDlQ+XPL8v9ZmvE51sjPt8aH7e7bgf+Y0VW35A8/6Tpd3JMeLND9IeJhJ9/prv+zjkm/Pjv49L9eHN1niKoV3+zSF/XmY+n+fpukdWk9ijimw37C17GtvoLXsb+Yu/wXDtqfb06u/eYn14hfGp+iLhfwQsfbrPXm0N+wQ9ZmPyCH7Kwum1MWcdZqfr8NnX7aUns0226XYzKW3ci5fVi1H1TtPEU7HizSNdgZmZTRPrnYbQt0jnvjh9xZP9K/0YRP2a29uebou8WWR9i8ecPwnyvyLpR7P7cf/hzkd3jp74um/vzC0Bm90s8f+LzeO4+/LnIfmUaK9Pf3awhba3NU8P694o0dnB7yvjfbtbfu8gPn6ST3d7ZFanrmz+1Pm+TbxWR9Wsj9fkd798U2QXBY9J6zQU+poNfB4F92om1rXB3GsDs42mAbYl70wD7EremAfZb4+Y0wBeb9OY0gP+CaYD9MaYMGeubk83+HS2anvrTkPnNB1z984+vmn/+8VXzjz++ui1x72Mm99ckNmvy+cdXLT7/+OoXy3Hr46sWH3981bZTRL7eu60/NLj/9PHVfRGeRTywvFfk7mdg90tiwpfH/N0itawidbsku/cJy1Gevln+dK/483vRX5VpTpmnZ5LfLGP85NEjBdrbZdZOGiV9U2a3gaWzq5+va761l/Kh41Xk+VrvN0U+/mzwdiDf/Gzwvsa9zwZb+/izwdZ+wWeDt8txc5Pud+26xXrsZXl3ABZegS9F3h6AVRk51d8egHV11IySm5GzvVa79YmSLy737nyj5Is7pKf7vef3s36+L+mfT7b2zydbe/9dS9ycvd5v0NUM/ti2+nqD7qZa702A+SGfT4D59sWsXzKpqHzbzDcTrb57dFXt6eJm87PBvnuyEH3d+kb/4cOG3yjSZP2aa5NmbxaJ1TfSupX3ivSyXhXtpW+2ybbV6tbY/WI51ptMj+el/c2Vqcz31L4pUvT3XRkhEKUfm+Xw33c5dP0U6+OWc7cc7ePlKB//9pBvX4G6lar7reFPqbr5AVXfpeovKXJ3tsirfjpbtC1xb7ZoX+LWbNF+a9ycLfpik96bLfL6Cx4I7M8y7qtJMvrrXwx2KR9P9Pj+8dWtiR7fPb26N9GzLXFvouf+msRmTcrHEz0un/+y5RfLcWuix3fXh/fu7Xz31tTdiZ59kZsTPdsidyd69ktyc6JnX+TmRI+r/YqJnq/K3Jzo+aLM3Ymer8rcnOjZb+CbEz37IjcnerYj6N6sxHYg35zo2de4N9Hju+ckN8Ng+52ImxM92+W4uUn3u/beRM8Xx+rdiZ4vytyd6PmqzM2Jnv1l1q2Jni+u1G5N9Oxu5W9OKfgveJXF/Re8yrLvQfV1Ipbnjfq9HtSy2iVUnj+7/L1G1vUipv7wbc5vFYm6fnChHa87Hn33JOuXFLl9d7Obib95d7MrcfPuZlvi3t1N/IJf9fhik968u9m9eHX7Wfi+/ZtvOvQfGq9+PkL671ykOn31rdc3i/Tn1o93i7R1eyJH3axO+xVzre0XzLVuV0f4iWY5bLNNdp/lK8bnlx+sr37o+asit37U3LdPsW7+mPi2yM3ppy9W5t5y9O1Lre3pS2m7gK4fX0zsg/HOxcT+daNbS/HFG0u3lmL/qjH3wfbDt3W/876y8+a0d3mzSGvrk5r9sPeK/DB262Z1tn0kN9+c3ha59wX3fYlbX3D/osSdL7jv90vwHcx4+432H4rou0UqReT1fonj4+escXz8nDU+f2dqW+LuJ1C2G5QO1Ij27l5ZkfyY7303QZ6X5O0izbgisreLMD+5LbL9csm9bN9//ORWtu+/DLVq9OpvflxqvfHQa7x8W2n75bB722L/8bFb22L/kbrVxW7hb38ub30Xzpodbxbhm/gPfPdzeS1Ykv7uJwTb2rmPem9/uO/pmYC+v01oDn73U5NqvA9rvf6KIm9+alK5DdHn25DvFeF7QRrbg21bhNnRFq+L5On55UOwvi5l2nG8fu8itr9H5avRQr3by2nAr5Yk1pKU3ZLsnmL5uqwyf7q/+8ZyNH58uh0em+XY/yLm3KyPU+jrtrHYBTTfI31+oDDeSbl/jPQ1Q6u7z6CF1l9wjKj8gmPkiyW5d4yofXyM7Jbj9jGi8SuOkfa7HiN2rIlROzYfFI7dd/+stv/314LaTzV2n7GPuj6f8sPnkdt3Vma1BVk56mZl5BesjP7OK8PX9B/45lnPZD0+NlF/s0hlSWr8iiLteHd11tNak9LfXRK+oSTH+xu2s2Ht3SJKkbd/RKkqD/ft+UL8x7cNwz/uDdyXuHfnu3t16heUuPmbQ9sNKnykT+LYbNDth7pufB5rvxjK7ffj9P16MXY/jnU3zLZTTffC7Isfx6q0sVR7uTJfFHn6MRtvmyLbX8S5+TNduyL35gD3JW7NAX5R4s4c4P6n7e79FKx/fA//+S++RPv4p9uj/YKfbt/elK2Z7sdT5tc/V7p9qtr4PcvnEj+9O74r4Xy32KW/VaKtkVaevyP7nRI9+KTmUd4pUQ9C41B5ayn4KOf4rO57JTrf+i5vrcj4sv0sUfp7S8HP5hR9/uWrb5TQp8d0z7ccP5WI7Q9FNbqhno+M0u+vycqcIvHexlB+S+X5OuHd7flmiXbwffD63GfzY2C07c9d3fq9gv2HsPku+A9d2d8o0dcyHM8/FvKNEk34oPDz5fBvtsUvaKFqx+/8NeDKM63qbbMyu6YUD336JV57NcX+VZH1xPLBvb8ssu/iWFfVpbw+Qlr5+DWV/YQl58bnr73Wb5RYP5fwKLHZL+UXtKO08gvaUb7cufG0c19dRrbiv/cRwvdv6/NFx283bNtextE2vJnR+qJI5efHfFNkd1t9d6Kw1fLpROF2Oe5OFLYqn08Utl2L7L2Jwm0AlMKZ6sHPvwtw/FSm7j6wMhfk6fcD9fbV8WPsduaRX39rpu0+BnjzFaS2faHq3itIbfchv3uvIG1L3HsF6f6avH4Fab9F772C1HZPXm6+gvTFctx6BanJbg7q1lsHbfcc6u4rSPsiN19B2ha5+wrSfkluvoK0L3LzFaS2e/Jy/xWkr8rcfAXpizJ3X0H6qszNV5D2G/jmK0j7IjdfQdqOoHvvy2wH8s1XkPY17r2C1HYPpW6GgW0/DHzvFaTtctzcpPtde+8VpC+O1buvIH1R5u4rSF+VufkK0vZ3bGSNm/I8H2zf+Ckc7hfL8xzod0rQaFuffoHiN5dovp3s52nS8WaJvt5OebrW/M6KPH9A8+mDvt8p4euZxY9Nx98oEYVZle228N+5SHFuN58/O/u9IhHMYvb6ZpF+8Dt09b09U9fKPE7i740VWY/4HkdKeW8p6Cd/fn77jRLlWI+0fvg19O+UKPxMWtH2XgneJyvtvaWQNWAf+N5SWGVCROO9Es49ROvvrQhHp9T3VkT49Tuxt1Yk1v1DqL9ToCvfpdkM9t1Tvc9n2PvBF4feW4t1XPawDzfDewWkMsFWny+Je7lfYr3BKs8fXnq3xNOF17dKrKEh9WlbfKfE849cPDXifqeErifFYsd720Kc39h5fmzzbon3durTb3U85923tgVvEqm8t1P52Xp5/tn6b5VYv/cpam/uVOeVOX9rKcYvhnJhoW+VePrh0vb8cf6fSvRjdyVfie7nn7r+qcVk/8R6nUub2XtrsppUy/NvOn+rhPNI8L1BUlrnXeajvLki3HIe9eMS5d2lCEq8Ndof16lsC42Pl+K9nVp1Ped9zKy8nEjo+6dOt+aL++6h07354m2Je/PF99fk9Xzx9hZgNVT8MFP1jQpWaQQTeb01+8355t0e2dZYz953c9b3l+N1jX2jIPOzTzPFPy9F/fhzaNsSN4+t7e8R3OsE67sHTPc6wXrdfl3S+OWb56sl+3k5NtOP4zdzVpH+emqq7x7O3OsO2W/TIjxRtZc/AtJl/yvp80Lj9c+IbDfp40EEt8sPLpuNuv3+6Lqa7tLfLWJriqrbDw1I3ylSV2/aA/XdIqsTvT+3s39zm6yPnzw2j795tLZ1pu3tqVflt0fr3SJPP4D1zSIrzR7o7xV5PBuydSH2eBK4K7PdtI1N24+Xm/Z2OL98ktF3Pxl164fFv9gez786dUR9d7Me9AA8ymyOk+28/f29ox9/iGFf4lYT9hclXjZh/8/Hf/njv/357//yl7/92x//8ee//fU/Hn/336PU3//8x3/9y5+u//q///Ov//b0//7j///3+f/869///Je//Pn//Mu///1v//an//Wff//TqDT+vz8c13/8jyiPHRZF43/+0x/K+O/jx4PDSnv8d3n898eiWx3/3/iX6+PG/Z8e/5H/cv7bj5nLx1/b8T//eyzu/wU="
     },
     {
       "name": "public_dispatch",
@@ -2453,7 +2453,7 @@
         }
       },
       "bytecode": "JwACBAEoAAABBIBSJwAABFInAgIEAScCAwQAHwoAAgADAFEtCFEBJQAAAEElAAAA2icCAQRSJwICBAA7DgACAAEnAEMAAywAAEQAAAAAAA6S+filNOhY/Pd32iBuCLDGIOz53rIdE0eYE/YoAABFBQJYLAAARgAwZE5y4TGgKbhQRbaBgVhdKDPoSHm5cJFD4fWT8AAAACcARwQDJwBIAQAnAEkEACcASgAAJwBLAQEnAEwEAScATQABJwBOBAInAE8AMSsAAFAAAAAAAAAAAAEAAAAAAAAAACYlAAAMTykCAAIA+pECywoqAQIDJwIEBAAnAgYEAwAqBAYFLQgBAgAIAQUBJwMCBAEAIgICBS0OBAUAIgUCBS0OBAUnAgUEAwAqAgUEJAIAAwAAATMjAAAFMS0IAQMnAgQEAgAIAQQBJwMDBAEAIgMCBB8wAEwATAAELQgBBAAAAQIBLQ4DBC0IAQMAAAECAS0MSQMnAgYEBy0IAActCgQILQoDCQAIAAYAJQAADHUtAgAALQoIBQAiBUwELQsEAx4CAAQAHgIABQAeAgAGAQoiBkYHFgoHCBwKCAkABCoJBggKIgdIBiQCAAYAAAHRJwIJBAA8BgkBMyoACAAFAAYkAgAGAAAB5iUAAAzKMyIAAwBDAAUkAgAFAAAB+yUAAAzcLQgBBScCBgQDAAgBBgEnAwUEAQAiBQIGLQoGBy0MTQcAIgcCBy0OCAcnAgcECS0IAAktCgUKLQhOCy0ISAwACAAHACUAAAzuLQIAAC0KCgYKIgZKBQoiBUgHJAIABwAAAmIlAAAOgCcCBwQJLQgACS0KBgoACAAHACUAAA6SLQIAAC0KCgUtCAEHAAABAgEtDgUHLQgBBQAAAQIBLQxJBS0IAQknAgoEBAAIAQoBJwMJBAEAIgkCCi0KCgstDEoLACILAgstDEoLACILAgstDEoLJwILBAwtCAAMLQoHDS0KBQ4tCE8PLQoJEAAIAAsAJQAADzwtAgAALQoNCicCCwQMLQgADC0KCg0ACAALACUAABAqLQIAAC0KDQUtCg4HLQoPCS8KAAYACicCEAQRLQgAES0KChIACAAQACUAABCALQIAAC0KEgstChMMLQoUDS0KFQ4tChYPHgIACgYnAhEEEi0IABItCgsTLQoMFC0KDRUtCg4WLQoPFy0KChgACAARACUAABF7LQIAAC0KExAAKgoQEQ4qChESJAIAEgAAA6MlAAAR7AwqCgkQFgoQCRwKEAoAHAoJEAAEKgoFCQQqEAcFACoJBQcnAgkEEi0IABItCgcTLQoDFC0KERUtCgsWLQoMFy0KDRgtCg4ZLQoPGgAIAAkAJQAAEf4tAgAALQoTBS0LBQkAIgkCCS0OCQUnAgoEEi0IABItCgUTLQhHFC0ISBUACAAKACUAABNXLQIAAC0KEwknAgsEEi0IABItCgUTLQoJFAAIAAsAJQAAFOktAgAALQoTCicCBQQSLQgAEi0KBhMtCgoUAAgABQAlAAAVRS0CAAAcChEFACcCCQQFJwILBAMAKgkLCi0IAQYACAEKAScDBgQBACIGAgotDgkKACIKAgotDgkKJwIKBAMAKgYKCS0KCQotDEQKACIKAgotDggKACIKAgotDgcKACIKAgotDgMKACIKAgotDgUKJwIDBAUAIgYCCC0LCAgtCggHJwIJBAMAKgYJBTcOAAcABS0LAgMAIgMCAy0OAwIAIgICBi0LBgYtCgYFJwIHBAMAKgIHAzsOAAUAAyMAAAUxKQIAAwDAe14ZCioBAwQkAgAEAAAFTCMAAAjtLQgBBCcCBQQCAAgBBQEnAwQEAQAiBAIFHzAATABMAAUtCAEFAAABAgEtDgQFLQgBBAAAAQIBLQxJBCcCBwQILQgACC0KBQktCgQKAAgABwAlAAAMdS0CAAAtCgkGACIGTAUtCwUEHAoEBgUcCgYFABwKBQQFHgIABQAeAgAGAB4CAAcBCiIHRggWCggJHAoJCgAEKgoHCQoiCEgHJAIABwAABfknAgoEADwGCgEzKgAJAAYAByQCAAcAAAYOJQAADMoMIgRFBgoiBkgHJAIABwAABiUlAAAVly0IAQYnAgcEAwAIAQcBJwMGBAEAIgYCBy0KBwgtDE0IACIIAggtDgkIJwIIBAktCAAJLQoGCi0ITgstCEgMAAgACAAlAAAM7i0CAAAtCgoHCiIHSgYKIgZICCQCAAgAAAaMJQAADoAvCgAHAAYnAg0EDi0IAA4tCgYPAAgADQAlAAAQgC0CAAAtCg8ILQoQCS0KEQotChILLQoTDB4CAAYGJwIOBA8tCAAPLQoIEC0KCREtCgoSLQoLEy0KDBQtCgYVAAgADgAlAAARey0CAAAtChANDCoNBAgkAgAIAAAHKyMAAAcLAioNBAUOKgQNCCQCAAgAAAciJQAAFaktCgUDIwAABzknAgUFAC0KBQMjAAAHOQAqBgMFDioGBQgkAgAIAAAHUCUAABHsJwIGBA4tCAAOLQoHDwAIAAYAJQAADpItAgAALQoPAy0IAQYAAAECAS0OAwYtCAEDAAABAgEtDEkDLQgBCCcCCQQEAAgBCQEnAwgEAQAiCAIJLQoJCi0MSgoAIgoCCi0MSgoAIgoCCi0MSgonAgoEDi0IAA4tCgYPLQoDEC0ITxEtCggSAAgACgAlAAAPPC0CAAAtCg8JJwIKBA4tCAAOLQoJDwAIAAoAJQAAECotAgAALQoPAy0KEAYtChEIJwIKBA4tCAAOLQoDDy0KBhAtCggRLQhLEi0KDRMtCEsULQoEFS0KBRYACAAKACUAABH+LQIAAC0KDwktCwkDACIDAgMtDgMJJwIEBAotCAAKLQoJCy0IRwwtCEgNAAgABAAlAAATVy0CAAAtCgsDJwIFBAotCAAKLQoJCy0KAwwACAAFACUAABTpLQIAAC0KCwQnAgMECC0IAAgtCgcJLQoECgAIAAMAJQAAFUUtAgAALQsCAwAiAwIDLQ4DAgAiAgIFLQsFBS0KBQQnAgYEAwAqAgYDOw4ABAADIwAACO0pAgACAAVVe/oKKgECAyQCAAMAAAkIIwAACo4eAgACAB4CAAMAHgIABAkkAgAEAAAJJCUAABW7HgIABAEKIgRGBRYKBQYcCgYHAAQqBwQGCiIFSAQkAgAEAAAJUicCBwQAPAYHAS0IAQQnAgUEAwAIAQUBJwMEBAEAIgQCBS0KBQctDE0HACIHAgctDgYHJwIGBActCAAHLQoECC0ITgktCEgKAAgABgAlAAAM7i0CAAAtCggFCiIFSgQKIgRIBiQCAAYAAAm5JQAADoAeAgAEBi8KAAUABicCCwQMLQgADC0KBg0ACAALACUAABCALQIAAC0KDQUtCg4HLQoPCC0KEAktChEKJwILBAwtCAAMLQoFDS0KBw4tCggPLQoJEC0KChEtCgQSAAgACwAlAAARey0CAAAtCg0GHAoGBAAnAgYEAScCCAQDACoGCActCAEFAAgBBwEnAwUEAQAiBQIHLQ4GBwAiBwIHLQ4GBycCBwQDACoFBwYtCgYHLQ4EBwAiBQIHLQsHBy0KBwYnAggEAwAqBQgEOw4ABgAEIwAACo4nAgICVScCAwJuJwIEAmsnAgUCbycCBgJ3JwIHAiAnAggCcycCCQJlJwIKAmwnAgsCYycCDAJ0JwINAnInAg4CeycCDwJ9LQgBECcCEQQcAAgBEQEnAxAEAQAiEAIRLQoREi0OAhIAIhICEi0OAxIAIhICEi0OBBIAIhICEi0OAxIAIhICEi0OBRIAIhICEi0OBhIAIhICEi0OAxIAIhICEi0OBxIAIhICEi0OCBIAIhICEi0OCRIAIhICEi0OChIAIhICEi0OCRIAIhICEi0OCxIAIhICEi0ODBIAIhICEi0OBRIAIhICEi0ODRIAIhICEi0OBxIAIhICEi0ODhIAIhICEi0OCBIAIhICEi0OCRIAIhICEi0OChIAIhICEi0OCRIAIhICEi0OCxIAIhICEi0ODBIAIhICEi0OBRIAIhICEi0ODRIAIhICEi0ODxIKIEhLAiQCAAIAAAxPJwIDBB4tCAEEJwIFBB4ACAEFAS0KBAUqAwAFBelJQ+ibN90sACIFAgUAIhACBicCBwQbLQIGAy0CBQQtAgcFJQAAFc0nAgYEGwAqBQYFLQxNBQAiBQIFLQ4BBQAiBQIFPA4DBCgAAAQEeFIMAAAEAyQAAAMAAAx0KgEAAQXaxfXWtEoybTwEAgEmJQAADE8tCwIDLQsBBAoiA0kFJAIABQAADJQlAAAV/wAiBEwFLQsFAy0IAQUnAgYEAgAIAQYBJwMFBAEAIgUCBi0KBgctDgMHLQ4EAS0MTAItCgUBJioBAAEF1RJ9KcLS6O08BAIBJioBAAEFrpKPa6mOkow8BAIBJiUAAAxPHAoCBQAEIgVQBi0IAQUnAgcEBAAIAQcBJwMFBAEAIgUCBy0KBwgtDEoIACIIAggtDEoIACIIAggtDEoILQgBBycCCAQFAAgBCAEnAwcEAQAiBwIILQoICS0MSgkAIgkCCS0MSgkAIgkCCS0MSgkAIgkCCS0OBgktCAEGAAABAgEtDgUGLQgBBQAAAQIBLQ4HBS0IAQcAAAECAS0MSQctCAEIAAABAgEtDEgILQhJBCMAAA2nDCIETgkkAgAJAAAOIiMAAA25JAIAAwAADcYjAAAN9icCAQQJLQgACS0KBgotCgULLQoHDC0KCA0tCE0OAAgAAQAlAAAWES0CAAAjAAAN9icCAgQJLQgACS0KBgotCgULLQoHDC0KCA0ACAACACUAABcQLQIAAC0KCgEmDCoEAgkkAgAJAAAONCMAAA5yACIBAgoAKgoECy0LCwknAgoECy0IAAstCgYMLQoFDS0KBw4tCggPLQoJEAAIAAoAJQAAFhEtAgAAIwAADnIAIgRMCS0KCQQjAAANpyoBAAEFursh14IzGGQ8BAIBJiUAAAxPLQgBAycCBAQEAAgBBAEnAwMEAQAiAwIELQoEBS0MSgUAIgUCBS0MSgUAIgUCBS0MSgUtCAEEAAABAgEtDgMELQhJAiMAAA7fDCICRwMkAgADAAAO9iMAAA7xLQsEASYcCgIDAAAqAQMFLwoABQADLQsEBS0CBQMnAAQEBCUAABd8LQgFBgAiBgIHACoHAggtDgMILQ4GBAAiAkwDLQoDAiMAAA7fJQAADE8tCAEGAAABAgEtDgQGJwIEAAUKKgMEBy0ISQUjAAAPYQwiBUcEJAIABAAAD3gjAAAPcy0LBgEmLQsBCC0LAgkMIglHCiQCAAoAAA+SJQAAFf8AIggCCwAqCwkMLQsMCgAiCUwLDioJCwwkAgAMAAAPtyUAABHsLQ4IAS0OCwIkAgAHAAAP6yMAAA/MCiIDTwgkAgAIAAAP4icCCQQAPAYJAS0KCgQjAAAP9C0KCgQjAAAP9C0LBggtAggDJwAEBAQlAAAXfC0IBQkAIgkCCgAqCgULLQ4ECy0OCQYAIgVMBC0KBAUjAAAPYSUAAAxPLQsBAgAiAgICLQ4CAQAiAU4DLQsDAi0LAQMAIgMCAy0OAwEAIgFHBC0LBAMAIgFMBS0LBQQcCgQFBBwKBQEAHAoBBAUtCgIBLQoDAi0KBAMmJQAADE8cCgEDBBwKAwIAAioBAgMsAgABAC1eCYuCuje0O5mhMWEY/SDUL1FmyenxP7XqZaltHgptBCoDAQIcCgIEBBwKBAMAAioCAwQEKgQBAhwKAgUBHAoFBAAcCgQFAQIqAgQGLAIAAgAwM+okblBuiY6X9XDK/9cEywu0YDE/tyCynhOeXBAAAQQqBgIHHAoHCAQcCggGAAIqBwYIBCoIAQccCgcIARwKCAEAHAoBCAECKgcBCQQqCQIHHAoHCQQcCgkCABwKAgcFHAoBAgUEKgIHARwKBgIFHAoEBgUEKgYCBBwKAwIFLQoFAy0KAgUtCgECLQoIASYlAAAMTwwqBgUIKQIABQUAAVGAJAIACAAAEcEjAAARmxYKAwEcCgMCBRwKAQMFBCoCBAEEKgMFAgAqAQIDLQoDByMAABHnFgoBAxwKAQQFHAoDAQUEKgQCAwQqAQUCACoDAgEtCgEHIwAAEectCgcBJioBAAEF0Afr9MvGZ5A8BAIBJiUAAAxPHAoDCQAcCggDACcCCAACJwIKACAnAgwEDS0IAA0tCggOLQoKDwAIAAwAJQAAF9stAgAALQoOCwQqAwsKACoJCgMcCgYJACcCBgBAJwILBAwtCAAMLQoIDS0KBg4ACAALACUAABfbLQIAAC0KDQoEKgkKBgAqAwYJHAoHAwAnAgYASCcCCgQLLQgACy0KCAwtCgYNAAgACgAlAAAX2y0CAAAtCgwHBCoDBwYAKgkGAxwKBAYAJwIEAGgnAgkECi0IAAotCggLLQoEDAAIAAkAJQAAF9stAgAALQoLBwQqBgcEACoDBAYcCgUDACcCBABwJwIHBAktCAAJLQoICi0KBAsACAAHACUAABfbLQIAAC0KCgUEKgMFBAAqBgQDLQgBBCcCBQQEAAgBBQEnAwQEAQAiBAIFLQoFBi0OAwYAIgYCBi0OAQYAIgYCBi0OAgYtCgQBJiUAAAxPHAoCBQAEIgVQBi0IAQUnAgcEBAAIAQcBJwMFBAEAIgUCBy0KBwgtDEoIACIIAggtDEoIACIIAggtDEoILQgBBycCCAQFAAgBCAEnAwcEAQAiBwIILQoICS0MSgkAIgkCCS0MSgkAIgkCCS0MSgkAIgkCCS0OBgktCAEGAAABAgEtDgUGLQgBBQAAAQIBLQ4HBS0IAQcAAAECAS0MSQctCAEIAAABAgEtDEgILQhJBCMAABQQDCIERwkkAgAJAAAUiyMAABQiJAIAAwAAFC8jAAAUXycCAQQJLQgACS0KBgotCgULLQoHDC0KCA0tCE0OAAgAAQAlAAAWES0CAAAjAAAUXycCAgQJLQgACS0KBgotCgULLQoHDC0KCA0ACAACACUAABcQLQIAAC0KCgEmDCoEAgkkAgAJAAAUnSMAABTbACIBAgoAKgoECy0LCwknAgoECy0IAAstCgYMLQoFDS0KBw4tCggPLQoJEAAIAAoAJQAAFhEtAgAAIwAAFNsAIgRMCS0KCQQjAAAUECUAAAxPACIBTAQtCwQDACIBTgUtCwUEACIBRwYtCwYFLQgBAScCBgQFAAgBBgEnAwEEAQAiAQIGLQoGBy0OAwcAIgcCBy0OBAcAIgcCBy0OBQcAIgcCBy0OAgcmJQAADE8nAgQEBC0ISQMjAAAVWAwqAwQFJAIABQAAFWsjAAAVaiYcCgMFAAAqAQUGACICAgcAKgcDCC0LCAUwCgAFAAYAIgNMBS0KBQMjAAAVWCoBAAEFXm0/LtzNhwk8BAIBJioBAAEFG7xl0D/c6tw8BAIBJioBAAEFT99KitfP8NM8BAIBJgAAAwUHLQADCC0ABAkKAAgHCiQAAAoAABX+LQEIBi0EBgkAAAgCCAAACQIJIwAAFdomKgEAAQXkCFBFArWMHzwEAgEmJQAADE8tCwQGCiIGSAckAgAHAAAWMCcCCAQAPAYIAS0LAwYKIgZHByQCAAcAABasIwAAFkYtCwEHLQsCCAwiBkcJJAIACQAAFmAlAAAV/y0CBwMnAAQEBCUAABd8LQgFCQAiCQIKACoKBgstDgULACIGTAUOKgYFByQCAAcAABaXJQAAEewtDgkBLQ4IAi0OBQMtDEgEIwAAFw8nAgYEBy0IAActCgEILQoCCS0KAwotCgQLAAgABgAlAAAYyC0CAAAtCwEGLQsCBy0LBAgtAgYDJwAEBAQlAAAXfC0IBQkAIglMCi0OBQotDgkBLQ4HAi0MTAMtDggEIwAAFw8mJQAADE8tCwQFCiIFSAYkAgAGAAAXLycCBwQAPAYHAScCBQQGLQgABi0KAQctCgIILQoDCS0KBAoACAAFACUAABjILQIAAC0LAQUtCwIGLQsDBy0OBQEtDgYCLQ4HAy0MSwQAIgZMAi0LAgEmLQEDBgoABgIHJAAABwAAF5IjAAAXmy0AAwUjAAAX2i0AAQUAAAEEAQAAAwQJLQADCi0ABQsKAAoJDCQAAAwAABfVLQEKCC0ECAsAAAoCCgAACwILIwAAF7EnAQUEASYlAAAMTy0IAQQAAAECAS0MTQQnAgYEAicCBwEBLQgBBScCCAQhAAgBCAEnAwUEAQAiBQIIJwIJBCBDA6oAAgAGAAkABwAILQIIAy0CCQQlAAAZxCcCAgQhJwIGBCAtCEwDIwAAGEEMKgMCByQCAAcAABhYIwAAGFMtCwQBJi0LBAcEKgcHCAIqBgMHDioDBgkkAgAJAAAYeCUAABWpDCoHBgkkAgAJAAAYiiUAABX/ACIFAgoAKgoHCy0LCwkcCgkHAAQqCAEJBCoHCQoCKE0HCQQqCQgHACoKBwgtDggEACIDTActCgcDIwAAGEElAAAMTy0ISQUjAAAY1gwiBUcGJAIABgAAGT4jAAAY6C0LAgUtCwUGACIGAgYtDgYFLQgBBicCBwQFAAgBBwEnAwYEAQAiBQIHJwIIBAQAIgYCCT8PAAcACS0LAQUtCwMHLQsECC0OBQEtDgYCLQ4HAy0OCAQmLQsDBgwqBQYHJAIABwAAGVQjAAAZti0LAgcAIgcCCQAqCQUKLQsKCC0LAQkAIgkCCwAqCwUMLQsMCgAqCAoLLQsECC0CBwMnAAQEBSUAABd8LQgFCgAiCgIMACoMBQ0tDgsNLQ4JAS0OCgItDgYDLQ4IBCMAABm2ACIFTAYtCgYFIwAAGNYnAAYEAgYABAYFLQAECCcACQQADgAFCQokAAAKAAAaFwIACAIIAAADCQstAQsGAAADCAstAQsHAAADCQstBAcLAAADCAstBAYLAAAJAgkjAAAZ1yY=",
-      "debug_symbols": "tZ3bjh03robfpa99oRMlKq8yCAIncQYGDCfwJBvYCPLuI/6iyOoelFxdq/vG9TV7FXWiJJLSav/99Ounn//690+fv/72+3+efvjX308/f/v85cvnf//05fdfPv75+fevQ/r3U5B/UspPP8QPTyknfbanH9J4lqRP/Zn0Z6rzWaM+9eemPzeaTw76LPrseOYw9JXxjFGfdT6T/pz056w/5/EejWfJ+uT5lPrgWedT6oPnKL+NZwv6LPrk+eSkzzafXX/uFc8SxnsxCNCCUYM4qlLiUBVZQNoyGlOSNE5+lbpCzvqrzApS8VQFWAFdKIA+BEin9QFtfDhLoRwXjA/nPKCPsvIogkJaMJqQR51J+nJCVUhLkpYkL0mmBV2hlAWjhmUUSpQXNAWp6gRa0BWkhycsCa/XpZPL6ASSXp6gkirdC4ijw0sVoAVdQWxzAivkJREzBRSpGAuQAoUFZQEr1LxAXh8dXsVsJ1QFXhJekr4knRb0CS2UBawQ84JRBI1OaCktqAo5LCgLWKGsD5f1Oi0JrdervB4FaEFXEPuZwAq8JDIWAGnOhPW6NIdGZ7IMCg1LYBmUCWUBK8igTFgSWTomVIWyXi/r9bI+LM2pQWDUp47SuaYFVUHm7oSygBV4fZjXh/v6sDRHoIewoCyQ14exdRmdCUsigwKQCVJJoCoU7edetKM6LQktyRqLLmNRh2l1VB5QFrACKg+oCn19uK8Pd/1wDCEZ1UUy05VMloJRMTItMmOUZMWLQmJkSnWRNE2pGPEimThKJmumReZOy0IyeZTIqC/q2YiVRrWM2iJpZSugukhaqVSMeJG0UslkaCWDRHMXEutTMlk1mRjgJFkWlEzGJkPbQDJ+SsWoK6VQjHhRTEarBilFo1VaysGIjExzMc0ysVhGIcmirWQyaZtSXSRtUzIZz919QFXoccEonmVYsswrpWLEi2RqKZlMtkXRn2VUADS395hl4kwghbYkbUl4SXhu+hG79YQ2oYS4gBSwdgHm1h+xXwNk7ZrQFGTWT6gKZUkKLRivs9SjyNRQkjaiFJkaSiaTZTjiczL3xWeIRRZi7qAh69IbRSaEUtPfYntXGrIu/UhiNJNkGiiR0ahfr0IyxbvUmaTyk2RidwbRomoyqfMk1DlEYDMUw1jo0u7SbtIqQ7GQDGNwFAcqFGA3hAeq2AxzdCTDEhwPUldGUFaBbFhd2qLjGPKxiAiimTEDm6HMgYW0sMFDVDxIu6HMhIWmrKXo6K9hhkSpDpyBCFtpuRuW7NgMKTqSo79W/bXqr7Xk6FJ2ZQxlYn0sC/NYuIBsGF2KBk3EACQZY5YpstClqMNE1EF85YHNEHVQJENZXhcepH1hn5WswGYYk2M1TMGRHKFMZkrP2ZENi0uLS8ml1AxrdKyGLTiSIwqWXu9cHNkQk0yxKqYA61Msjt0wujSyYYKyDmyGmGSKZIhJpniQdsPZ+ImuDI3PCVgN0XjF4siGmHqK/lr317q/1u21GJJjM4wujaYMvsPC4tgNMfKZgGxYkmM1pOBYHLthdWl1ZTB7ibIGNkOYvSI5dsPZ+IkmTTB7RSiTMU6z8ROr4Wz8xOLYDbNLEbQKrOjfwv8kK45s6gkZgEk1GBWjvqiZDE0TQGskyYCqFpDUn5GAgGzmIkQo0WHKsMuJsEsJ+gZCitcwHorFPoDxmIjxkMBpYDfEIEyEBSpKv5FUOsMCFWnhTA8oujS6FNNPkQ2xxymiYKlZQc5FsRqimYrFkQ0x/RRdWl0Zph8xsjfR0aVYcBSlSyoyPRidKlZFaKaEDQPJsRtiH1Bkw+RSNHMiVhlFV5ZdWfHXsMdVWU9IfPWF1bAGx+LIhs1fa/4a+2uwxondpd2VYZWRyGYYuNSsIc+FTXBidGl0KexXsRlml2aXipO5sBrClBXJsLoULVZEwTKFKjw3xWaIpUWxGnaTNqygEnANbIbRpdGlyaXJpdml2aXFpcWl5FJyaXVpdWlzKYZw4mzQRJd2l3aTMuxXsTh2wzmEE9nQm8neTM7R0YsoXgRWI0Uvgrxg8iKqF+wtZm8xe4vZWzydoondC+5eRLeCp1OkaAV3H9juA9tTdLSCew6O5OhFlOLoRZAX7GPcfYynUzSxecHNi2AvmL0I9oK7F9FXwTmYKQ9shjE6VsMUHMmxG+biiCKqINaoiXC+FavhnKYTybC5FO7PRMQYE+HlKZp0ejeKVkSMwbE4dsPk0uTSnB2tQdO7UfSCxaLGmALFGeiSU09SnYXNMJKhdGqSGHQgOUpWXKLQnJAXV2TD4tLiUnIpNUMkyyVUHUgLc0RXywfyHFhIMbAcgN0QA6vo0uLS4lKYsmIzhCkrVkOYsiIKjsBuCFNWdGl3aTdpweRVbIaYvIrVEJNX0QoumLyKsIcOZMNpyhOb4bTqidVwWvVEVwY/amJzZc2VwaWaCOeJE45sUHWZWdMnUCTHbohKKjZD8tfIX0MlFV2K+SbZmkxzLICcHZshdhFFcrTXaiiOLo3ZEYkenEBhk2CZAXOfV3Qp9nluQHLshtgkFJvhtLOJ/lrz16adTXQp1klgk65OcnaUkWJQlBmw0KXkUnKp1GxhM5Tta2E1lO1roRfMrqxbEYxlRSKl4Y3js9JRLKacMo7rZtVldmPnTXK+NBCliZ0xBXttVn1iN6wuFedJsWVHlyIfqlgXdnGFk0QoA7thLI6ioYj1dXGFFXGkWqSZODcYXrtgRSvm0WNxhAZpZkfNJqInFaU6csA0Fo3ouKQFCYJEOLhEfSdGl6KSE1FJxWYIe5CqFwT9iliKJ8oyqIjjXQnPBrK2rWBTW9gWYlNbWA1jdHQpNhTFYoj9Aiem2LMUcTStKBoSzmixXyhKP0jWZWA3lPVhIUZeGh85O8ImIw58kyPsAae/ITpCKl0yd70gehFaL4SUcWgMqQxWwsAqigYcOM/cuyKkUnBGaRFnyyhNEogF5+gLXZogxYF0glS6L2PyKkqLJe9YMuxMEdKG42tIGQipVDL37GhS7FlJMoEDcewt9S0RUhyBw+QmwuRSBrJhduk8OJeqz6NzRZfCPUiEE3WxkjCP0qXF1IE4X5fqVPSDHAEOrIbZpdmlWFYUiyMbomBFl2IyKEKZNBNr9Yj4gJBK1RGTJTlbLIjJFLtLZfNZ2Bc29K8iG0aXikOvOFtcgSii4VoBpAyEFJcNSnR0KRZSxeLIhjAjRZdiD1AUZU0GYO4BEksXBG1JgteCoC2Ji10QtE3kEB3JsRuixYpsmFyKRWwiWiyBbkHQNqJOQbRYPN0ytw7xHAtTdHQpFmjF4siGmDiKLsXWoQhl0us8W9yBIhV3seCkeiEZRpdGlyaXYkVUZEPMIcVmiEzexOnWSc1moho16+bIlpmoViRDdim7tLu0F0dWHBmk7NgMY3JcjizNmEyRDLNLs0uLS0txZEPKjs2wJkcvuEVHUpd1YDfk4siGPTkup5diiI6mTIO2icXRlMWUDafnmHCTZzm9NFPHitWQg2NxZMPur3V7DXvWQpfG5fTSzBcrFkc2RNZHsRoWf624MnIpubLp6ZIgYgbxigln0Atd2pfTS2m2AleXQnAsjmw47Wyiv5b8tUSG2aW5G2LBIyAWPMVmiAVPsRpiwVOE+8XAbginV9GkJRRHl2LBU2yGKTlWQyx4ilYwksmKWMTkrgrhLHqkaIFophgBTqPHMAF5IYXsiDrIsNCsGeFCGAaAgRgAMWUNYYBzkk2shtN+J4qGjitkSHzIkfjAaog5pEiGmDiKUnCXBs2kpGIzLC5FIDYR4aSiSxFOytE64YaVYnMpTq8mIpxUbIYwWkXTMDORkluhmYmciBhSsRkitFckR38tu7Ls0uLKiisjV4Z4U3I2NI9nJyK0V3QpQntFNmQbIexvij04loXdQmXqs5kVyIbICExERkARlZQ5hDtYC4sjGyKvrFgNq79WXVlzaXNlzZWxK2NX1v217q/19Vqd6UfJR9W51QFxFplkb6kzsJkI/0wRm3sWRKCreJB2Q3ikii4ll5JLq0tbM8TCpGhFJCw2MkLj+AKfJdy7TCaF88S4hAnnSRbHgdWQXDrrAJx1mOjSWR0g3CRZNSpWe8Xu0ukmyW3LGfnI+lBn5CPGVWfkIzO2zshHJlmdkQ9aMSOfibN/gVijOvRi2Q7QOyOJicWxG2JxDCgNIS2wIKRVdGl0aXRpcmlyKbw2uR4zsBmiqxXJsRuSv0b+GpwctA1ngOOcWHA2aCKvBs3VXtGkNBs0ERrECHDBeKFL4ZEGApKj9Rnl7OhFFJciiJ9IXjC5FEG8Ijl6Ec2V8dTwzz8fntY995/+/Pbpk1xzP1x8/9ffT398/Pbp659PP3z968uXD0//9/HLX/jQf/74+BXPPz9+G78dSj99/XU8h8LfPn/5JPTPB387nL86NuP19hjgaApiKFdVDOegqYqB/Y6KhMwCVAz/7bwWeVOLEYfWVY0ROzZT0i53xsibLBVywH6rJU3Ct6mi9Xyqop6r4L5GZIRapmAk8i4rkHBJFfCpAj5XMPJftOoQR3DjAzJ69pmSvhkQXGqY4xHp0JAxvlctq9Iyi5GCpdPOlKzT+ZiymdZwWF1HfKEjbfqDQ11dOrid2lbcGehwQpdpyHFRPFWyaw3HVRE5ET1vDe16hLiZmddwaE1+rqS+RZe0d+6S4cBH1SFeu6mg52YWN6Y6EtYSV6iRMOezHkkbYx0elvdIb4eavGhMirseqZJ81B6p56vYd5rTzUpGMiWcNme7nq6RGU7CoVfvjQvT2bikjaW2ukbl2J0lXa9Ds+kyoql2WoeNjY5k4FLRRjrrdFA3y+k4gi1Lx+B+z8yPTTlskS/NfKeC6xpTiX3OVOT4cG/k9N694U2pIbY7vVFxI3iqGOH0aW9s7JNw3jE7dCTWfTXuL3RsF9Jqi8Zhs67pugYypyWkcw0bA22+cg3TOmzV+YX7tdvuKdl64XN1ZNiu92Z08xzZ99PeLHHXm5xsVzr6oj3cMox0vmiUzeI5MlY2JiNxdVoNOWo99cxrMM98BKznOjZdmkOXQ+s510I/eGHtVUrSQUkLp0p2W33rtq9xzgdv8BU6fPGRw+6bOjxKGAcV5zq2I0OrP8YxVz0fma2FNHNLa4inOmizko40py0/lM7rQfkNLITKTknyJT2MLMmpkp2ZUfWaDOfhXMm2S8yhJOp8b2hqNu+p1nDerbwb3m5R3BjfcLrJ0W5JTZ3cGdxNvG1rbOKN082bxsps7nG/q6P7ktipnOqoGx1ceHUql8PqLomLZzrKbodo7qXHcqqj7CdNsNA2nFtI3ezakp9au8xIP5/r2CxmvReL0oM3ZYS8l1WMUNp11Hquoz/uPrTwqPuw7dBqq2Ed+dvTDm0733TEw7Y9pHwew31HSequhG45uCN4Ktaacuqdts2CWkq2Ph2p19Om1F1eLtrET+0wWcpz62htp6NbRiwf81F8syn1fFS2Kmy+DRX9TAXvbHQk3G09lvt4N1KM41B12YZcgDtNafHOwAhfg9GdMp5vt7sNqlRPERyyNy9H5aoKLqcqtmbeaOmo7dChL8yc6xskb7i9QfKG+Q2SN99pzrXkTQ/vmLx5Ni58uvz09I7Jm8rRYnwup+mKXh5OV3R653TFs6bcS95U9wVrP09X7FS0kFctRtjCpx3aH894xBAeTXnsVVzKecSQHvdaYsiPui3bHr2Y9YiB3jftcbSOGM4NLGwT+uwbZDh38mPgx8PaGPobxLUxhjcIbOOuZy9Htt/plmuh7X6Acom+mOWNoZQ3CG7j7hjqcnT7nQY1P/XdWdz2HCp7gmto8aUg9VcoIbJjcGo3lchdaUstHWz/dUrYLGU4E+lcybZjCx2O0zfmltLjOcyY3iJF9T0t17KYcXcidTWNuVdyMY/5HSXXEpnfGZ9rmczvWIp5m8NoNoOcw+PpkLg7nbqYD9nquJoQiTm/gW+Ry6O+xb5XL+ZE4u586XJS5HtaHs+KjIXVtq9ne+DL6w+7k6rUc7btaywt5+0p22RATr6V5lIebU89ZgPi9QsuLZnBtrEzn/pt2+Ts1Rg67s5FLgfRcXvcdPkKxHdadC2MjqW9Yxz9bHDOQ65Y+jsG0i3ZHb9Rn9MkS6T4BoEfpYcDv62Ka4Hf7rTq8uK8P626tDhvu/Rq5EftnSO/o33w+QqyPati3yOYN+5iDW8RWNT4FoHFtkHdXNfhX6VNg/IbhLK1vIX/W+ktQtndIcv1UHbfLRdD2csDlM/7dnf5OTDbLKbza8exhcfPN3b1wDeZZz3Ezzyrx04F/iKUqii7puQ3OFjYVaQmD/kOp07/W5Hdxb9kO55vePlqFVK0TJb8EbzT1XmvopiKWu6p6NHOzg4Xj/9nj2jbfOsaVcrhpgq7nV8Pm91rGoI/J6ANORxFvkZFZV/XD7fiX6Oi+d38lu8NKr5qv04z76nIwfzkHOO9WviF9BxudWfx44ThuB/3pqsaYrQQaMQafKcS0dcK+TvTt1Rks82B92pBttwMp6/dU2FLZyTu9xpi31+JIwd+T4XnHTLda0g1+4613atFa8u+x6JyyzjH/mt9cXScXqGi2TF7K/WOgm5xW6d7/RAsBh1ZoHPjxrfZ3m+a9rDmR0/3OsLmaG/0YE/eUxA9KZfCwbd5mYzerZieik7HqxsjO3BdhW/GlNNNFbZ7UKm3VJAFayPUuVeLGqwv6iHp9DoV5h5V4nsq2K9I9nZLRTOfN7XCN1W4S3DISbxKhTek9Xu14GiDyiXeVGHWycevyr1GBds044OH9RoV3S979XJXhfVFp3tzpPsc6ffmSE7Vv1XGt7pT/rqhnWmkW9NsBFAWn9KzQ8XLKq4ez2x9AjsfHVHs+aCm3Xeg2HQ8My1+hVthIURsNW1q0d+zFp08/1hv2cUzFS3dVEGeBb1lF/IHYz2XE2O/EaeP9/zYbnC9pSNZGCF8U4ef4I+81E0d9l3DB3Rcy4+l/begLubHtomD0jx9cX48vI3NPJiIh68wvPwOOP4e4vl8u/I18m0tbH8e2O6pyB5kHjfXVzXk0hfqU9ne1s92Ol1uqjAP9LiUv04Fu4p2T0VLzUKrfGdE8si9W45w8K1L0GM/sLUntkL3dKTwuA6baoOp3tMR6kHH+bqxP05qxRwOalzu1IRtk8186I+XNxe2Ktxz4lbuqChkXVqIb3lOxW8tlJr5ngpLIQwn6qbzdbi7RPcacuiLes+vL9Vy4cMFvFeLFuyU4/gNsNfVwkakpfBoX7QU7zUke0Nav6eC/X5dv1sLb0inh/ui3xsR9ouCfC8PMN5jT0/drYVZJ9+LwI99wTXdq4V9l3akee7ZRU/WnT3Hm7VgV1Ef7Yueb6VVKNlkp+NhzStUjOXC7qyEQ/gcL+8BLZpxtnjItr3QkHZfcop+c0b+c8hbtbALuQP7LQ12h6jdrUOzvoyHYO8VGpJthgPbvVZ018CPaoi36pAsn95SDo+OxfEPlb2iDv4Fh0T3WpHLY/ZwLY4Ij0YR4dEYYqfATsuOZ0yvULAJQX4cP3785fO3Z//9+z+i6tvnjz9/+aQ//vbX118Ov/3z//9Yv1n/ffwf337/5dOvf337JJr8/5Af//wryv8+MJYU/vHDU5Sf8/Bt5D9uHT9n+VnufY3IleT38kKl+KFSlR/l85JQGy3/8R+p7n8B"
+      "debug_symbols": "tZ3dbh23zobvxcc50B8lqrdSFEXaphsBgrTIbj/gQ5F73+IrihynGHk8yznJPKaXqD9KIqlZzj9Pv3345e///Pzx8+9//Pfphx//efrly8dPnz7+5+dPf/z6/q+Pf3we0n+egvyTUn76Ib57Sjnpsz39kMazJH3qz6Q/U53PGvWpPzf9udF8ctBn0WfHM4ehr4xnjPqs85n056Q/Z/05j3I0niXrk+dT2oNnnU9pD56j/jaeLeiz6JPnk5M+23x2/blXPEsY5WIQoAWjBXE0pcShKrKA9GV0piTpnPwqdYWc9VeZFaThqQqwAoZQAGMIkEHrA9r4cJZKOS4YH855QB915VEFhbRgdCGPNpOM5YSqkJYkLUlekkwLukIpC0YLy6iUKC9oCtLUCbSgK8gIT1gSXsVlkMsYBJJRnqCSKsMLiGPASxWgBV1BbHMCK+QlETMFFGkYC5AChQVlASvUvECKjwGvYrYTqgIvCS9JX5JOC/qEFsoCVoh5waiCxiC0lBZUhRwWlAWsUNaHyypOS0KreJXiUYAWdAWxnwmswEsicwGQ7kxYxaU7NAaTZVJoWALLpEwoC1hBJmXCksjWMaEqlFW8rOJlfVi6U4PAaE8dtXNNC6qCrN0JZQEr8Powrw/39WHpjkAPYUFZIMWHsXWZnQlLIpMCkAVSSaAqFB3nXnSgOi0JLcmaiy5zUYdpdTQeUBawAhoPqAp9fbivD3f9cAwhGdVFstKVTJaCUTEyLbJilGTHi0JiZEp1kXRNqRjxIlk4SiZrpkXWTstCsniUyKgv6tmIlUazjNoi6WUroLpIeqlUjHiR9FLJZOglg0RzFxLrUzJZNZkY4CTZFpRMxiZD30Ayf0rFqCulUIx4UUxGqwUpRaNVW8rBiIxMczHNsrBYZiHJpq1kMumbUl0kfVMyGc/TfUBV6HHBqJ5lWrKsK6VixItkaSmZTI5F0Z9lVgA0j/eYZeFMIIW2JG1JeEl4HvoRp/WENqGEuIAUsHcB5tEfcV4DZO+a0BRk1U+oCmVJCi0YxVnaUWRpKEkfUYssDSWTyTYc8TlZ++IzxCIbMXfQkHUZjSILQqnpb3G8Kw1Zl3EkMZpJsgyUyGi0r1chWeJd2kzS+EmysDuDaFE1mbR5EtocIrAZimEsdGl3aTdplalYSIYxOIoDFQqwG8IDVWyGOTqSYQmOB6krIyirQDasLm3RcUz52EQE0c2Ygc1Q1sBCWtjgISoepN1QVsJCU9ZSdPRiWCFRmgNnIMJWWu6GJTs2Q4qO5OjFqherXqwlR5eyK2MoE+tj2ZjHxgVkw+hSdGgiJiDJHLMskYUuRRsmog3iKw9shmiDIhnK9rrwIO0L+2xkBTbDmByrYQqO5AhlslJ6zo5sWFxaXEoupWZYo2M1bMGRHFGxjHrn4siGWGSKVTEFWJ9iceyG0aWRDROUdWAzxCJTJEMsMsWDtBvOzk90Zeh8TsBqiM4rFkc2xNJT9GLdi3Uv1q1YDMmxGUaXRlMG32FhceyGmPlMQDYsybEaUnAsjt2wurS6Mpi9RFkDmyHMXpEcu+Hs/ESTJpi9IpTJHKfZ+YnVcHZ+YnHshtmlCFoFVvRv4X+SHUcO9YQMwKQajIpRX9RMhq4JoDeSZEBTC0jaz0hAQDZzESKU6DBl2OVE2KUEfQMhRTHMh2KxD2A+JmI+JHAa2A0xCRNhgYoybiSNzrBARVo40wOKLo0uxfJTZEOccYqoWFpWkHNRrIbopmJxZEMsP0WXVleG5UeM7E10dCk2HEUZkopMD2anilURuilhw0By7IY4BxTZMLkU3ZyIXUbRlWVXVrwYzrgq+wmJr76wGtbgWBzZsHmx5sXYi8EaJ3aXdleGXUYim2Hg0rKGPBcOwYnRpdGlsF/FZphdml0qTubCaghTViTD6lL0WBEVyxKq8NwUmyG2FsVq2E3asINKwDWwGUaXRpcmlyaXZpdmlxaXFpeSS8ml1aXVpc2lmMKJs0MTXdpd2k3KsF/F4tgN5xROZEPvJns3OUdHr6J4FdiNFL0K8orJq6hesfeYvcfsPWbv8XSKJnavuHsV3SqeTpGiVdx9YrtPbE/R0SruOTiSo1dRiqNXQV6xz3H3OZ5O0cTmFTevgr1i9irYK+5eRV8V52CmPLAZxuhYDVNwJMdumIsjqqiC2KMmwvlWrIZzmU4kw+ZSuD8TEWNMhJenaNLp3ShaFTEGx+LYDZNLk0tzdrQOTe9G0SsWixpzChRnoEtOPUlzFjbDSIYyqEli0IHkKFlxiUJzQl5ckQ2LS4tLyaXUDJEsl1B1IC3MEUMtH8hzYiHFxHIAdkNMrKJLi0uLS2HKis0QpqxYDWHKiqg4ArshTFnRpd2l3aQFi1exGWLxKlZDLF5Fq7hg8SrCHjqQDacpT2yG06onVsNp1RNdGfyoic2VNVcGl2oinCdOuLJB02VlTZ9AkRy7IRqp2AzJi5EXQyMVXYr1JtmaTHMugJwdmyFOEUVytGI1FEeXxuyIRA9uoHBIsKyAec4ruhTnPDcgOXZDHBKKzXDa2UQv1rzYtLOJLsU+CWwy1EnujjJSDIqyAha6lFxKLpWWLWyGcnwtrIZyfC30itmVdauCsa1IpDS8cXxWBorFlFPGdd1suqxunLxJ7pcGojaxM6ZgxWbTJ3bD6lJxnhRbdnQp8qGKdWEXVzhJhDKwG8biKBqKWF8XV1gRV6pFuol7g+G1C1b0Yl49FkdokG52tGwiRlJRmiMXTGPTiI5LWpAgSISLS7R3YnQpGjkRjVRshrAHaXpB0K+IrXiibIOKuN6V8Gwga98KDrWFbSEOtYXVMEZHl+JAUSyGOC9wY4ozSxFX04qiIeGOFueFooyDZF0GdkPZHxZi5qXzkbMjbDLiwjc5wh5w+xuiI6QyJPPUC6IXofVCSBmXxpDKZCVMrKJowIXzzL0rQioVZ9QWcbeM2iSBWHCPvtClCVJcSCdIZfgyFq+i9FjyjiXDzhQhbbi+hpSBkEojc8+OJsWZlSQTOBDX3tLeEiHFFThMbiJMLmUgG2aXzotzafq8Old0KdyDRLhRFysJ8ypdekwdiPt1aU7FOMgV4MBqmF2aXYptRbE4siEqVnQpFoMilEk3sVePiA8IqTQdMVmSu8WCmEyxu1QOn4V9YcP4KrJhdKk49IqzxxWIKhpeK4CUgZDiZYMSHV2KjVSxOLIhzEjRpTgDFEVZkwmYZ4DE0gVBW5LgtSBoS+JiFwRtEzlER3LshuixIhsml2ITm4geS6BbELSNqFMQPRZPt8yjQzzHwhQdXYoNWrE4siEWjqJLcXQoQpmMOs8ed6BIxV0suKleSIbRpdGlyaXYERXZEGtIsRkikzdxunXSspmoRsu6ObJlJqoVyZBdyi7tLu3FkRVHBik7NsOYHJcjSzMmUyTD7NLs0uLSUhzZkLJjM6zJ0Stu0ZHUZR3YDbk4smFPjsvppRiioynToG1icTRlMWXD6TkmvMmznF6aqWPFasjBsTiyYfdi3YrhzFro0ricXpr5YsXiyIbI+ihWw+LFiisjl5Irm54uCSJmEK+YcAe90KV9Ob2UZi/w6lIIjsWRDaedTfRiyYslMswuzd0QGx4BseEpNkNseIrVEBueItwvBnZDOL2KJi2hOLoUG55iM0zJsRpiw1O0ipFMVsQmJu+qEO6iR4oWiG6KEeA2ekwTkBdSyI5og0wLzZYRXgjDBDAQEyCmrCEMcC6yidVw2u9E0dDxChkSH3IlPrAaYg0pkiEWjqJU3KVDMymp2AyLSxGITUQ4qehShJNytU54w0qxuRS3VxMRTio2QxitommYmUjJrdDMRE5EDKnYDBHaK5KjF8uuLLu0uLLiysiVId6UnA3N69mJCO0VXYrQXpEN2WYI55tiD45lYbdQmfrsZgWyITICE5ERUEQjZQ3hHayFxZENkVdWrIbVi1VX1lzaXFlzZezK2JV1L9a9WF/F6kw/Sj6qzqMOiLvIJGdLnYHNRPhnijjcsyACXcWDtBvCI1V0KbmUXFpd2pohNiZFqyJhs5EZGtcX+CzhvctkUjhPjJcw4TzJ5jiwGpJLZxuAsw0TXTqbA4SbJLtGxW6v2F063SR523JGPrI/1Bn5iHHVGfnIiq0z8pFFVmfkg17MyGfiHF8g9qgOvdi2A/TOSGJiceyG2BwDakNICywIaRVdGl0aXZpcmlwKr01ejxnYDDHUiuTYDcmLkReDk4O+4Q5w3BMLzg5N5NWhudsrmpRmhyZCgxgBXjBe6FJ4pIGA5GhjRjk7ehXFpQjiJ5JXTC5FEK9Ijl5Fc2U8NXz9+u5pvef+819fPnyQ19wPL77/+M/Tn++/fPj819MPn//+9Ond0/+9//Q3PvTfP99/xvOv91/Gb4fSD59/G8+h8PePnz4IfX3npcN50XEYr9JjgqMpGH7hVRXDOWiqYmC/oyIhswAVw387b0XetGLEoXU1Y8SOzZS0y4Mx8iZLhVyw3+pJk/Btqmg9n6qo5yq4rxkZoZYpGBm5ywokXFIFfKqAzxWM/BetNsQR3PiEjMz4MyV9MyF4qWHOR6RDR8bAXrWsSsssRgqWTgdTsk7nc8pmWsNhdR3xGx1pMx4c6hrSwe3UtuLOQIcTukxDroviqZJdbziuhsiN6HlvaKOjRJvdwc13jZafK6lvMSTtOw/JcOCj6hCv3VRQfK5iY6ojaPCFPyKRejYiaWOsw8PyEent0JJvOpPibkSqJB91ROr5LvZCd2xIkgRAp93Z7qdrZoaTcBjVe/PCdDYvaWOpTdKS0HAczpKut6HZchnRVDttw8ZGRzJwqWgjnXU6qZvtdFzBlqVjcL9n5seuHI7Ib818p4LrmlOJfc5U5PjwaOT0vUfDu1JDbHdGo+KN4KlihNOno7GxT8J9xxzQkVj33bg/N9G83UirbRqHw7q26xrI9q6QzjVsDLT5zjVM63BU5/5cx+64p2T7ha/V4UdcH83o5jmy76ejWeJuNDnZqXT0Rfs9w0jnm0bJux04Hc4TPm2GXLWeeuY1mGc+AtZzHZshzaHLpfVca6EfvLBv1toLStJBydFf+EbJ7qhv3c41zvngDdJ1Hb75yGX3TR0eJYyLinMd25mhNR7jmquez8zWQpq5pTXEUx202UlHmtO2H0rn7aD8BhZCZack+ZYeRpbkVMnOzKh6S4bzcK5kOyTmUBJ1vjc1NZuPXWs4H1beTW+3KG7Mbzg95Gi3paZO7gzuFt62N7bwxu3mTWNlzhZ13NXRfUvsVE511I0OLrwGlcthdx9uxHMdZXdCNPfSYznVUfaLJlhoG84tpG5ObclPrVNmpJ/PdWw2s96LRenBu5JKvqwihuI6aj3X0R93H1p41H3YDmi13bCO/O3pgLadbzqSyHY8pHwew72gJHVXQrcc3BE8FetNOfVO22ZDLSXbmI7U62lX6i4vF23hp3ZYLPTcOlrb6eiWEcvHfNQ3eaDLXanns7JVYettqOhnKnhnoyPhbvuxvI93I8U4LlWXbcgLcKcpLd4ZGOFrMHpSxvPjdndAFVuzw8dtp7NyVQWXUxVbM2+0dNR2GNBvzJzrGyRvuL1B8ob5DZI3L3TnWvKmh++YvHk2L3y6/fT0HZM3laPF+FxO0xW9PJyu6PSd0xXPunIveVPdF6z9PF2xU9FCXq0YYQufDmh/POMRQ3g05bFXcSnnEUN63GuJIT/qtmxH9GLWIwb6vmmPo3XEcG5gYZvQZz8gw7mTHwM/HtbG0N8gro0xvEFgG3cjezmyfWFYroW2+wnKJfpmljeGUt4guI27a6jL0e0LHWp+67uzuO09VPYE19By2ArKK5QQ2TU4tZtK5F1pSy0dbP91StgspfDhqPiXku3AFjpcp2/MLaXHc5gxvUWK6iUt17KYcXcjdTWNuVdyMY/5gpJricwX5udaJvMFSzFvcxjNZpJzeDwdEne3UxfzIVsdVxMiMec38C1yedS32I/qxZxI3N0vXU6KvKTl8azI2Fjt+Hp2Bn77+sPupir1nO34GlvLeX/KNhmQkx+luZRH+1OP2YB4PVRryQy2jZP51G/b30ZcjKHj7l7kchAdt9dNl1+BeKFH18LoWNp3jKOfTc55yBVL/46BdEv2jl+TbeysERTfIPCj9HDgt1VxLfDb3VZd3pz3t1WXNuftkF6N/Kh958jvaB98voNs76rYzwjmjbtYw1sEFjW+RWCx7VA313X4V2nTofwGoWwtb+H/VnqLUHZ3yXI9lN0Py8VQ9vIE5fOx3b38HJhtFdP5a8exhcfvN3btwDeZZztS5tN27FTgL0KpirLrSn6Di4VdQ2rykO9w6/Tvhuxe/Et24vmBl682IUXLZMkfwTvdnfcqiqmo5Z6Kbg5IOrx4/K8zom3zrWtWKYebKuzt/Ho47F7TEfw5Ae3I4SryNSoq+75+eCv+NSqae6gt35tUfNV+3WbeU5GDXYjmGO+1wl9Iz+HWcBa/Thi5nuPZdFVDjBYCjVQf32lE9L1C/s70LRXZbHPgvVaQbTfD6Wv3VNjWGYn7vY7Y91fiyIHfU+F5h0z3OlLNvmNt91rR2rLvsancMs7YfSyOjtMrVDS7Zm+l3lHQLW7rdG8cgsWgIwt0btz4Ntv3W6Y9rPXR072BsDXaGz04kvcURE/KpXDwbb5NRu92TE9Fp+OrG/J9tcsq/DCmnG6qCJ4iqbdUkAVrI9S514oabCxqKTdVmHtUie+pYH9FsrdbKpr5vKkVvqnCXYJDTuJVKrwjrd9rBUebVC7xpgqzTj5+Ve41KtiWGR88rNeo6P6yVy93VdhYdLq3RrqvkX5vjeRU/VtlfGs45a8b2p1GurXMRgBl8Sk9u1S8Hp9evJ7Z+gR2Pzqi2PNJTbvvQLHpeGZa/RVuhYUQsdW0aUX/nq3o5PnHessunqlo6aYK8izoLbuQPxjruZwY+404fZTza7vB9ZaOZGGE8E0dfoM/8lI3dViy/wEd1/Jjaf8tqIv5sW3ioDRPX5xfD29jMw8m4uErDN9+Bxx/D/F8vV35Gvm2FXY+D2z3VGQPMo+H66s6cukL9als39bPdjtdbqowD/S4lb9OBbuKdk9FS81Cq3xnRvLIvVuOcPCtl6DHeWB7T2yF7ulI4XEdttQGU72nI9SDjvN9Y3+d1Io5HNS43GkJ2yGb+TAe6XrmNPvXajO3ckdFIRvSQnzLcyr+1kKpme+psBTCcKJuOl+Hd5foXkcOY1Hv+fWlWi58uID3WtGC3XIcvwH2ulbYjLQUHh2LluK9jmTvSOv3VLC/X9fvtsI70unhsej3ZoT9RUG+lwcY5djTU3dbYdbJ9yLw41hwTfdaYd+lHWmee3bRkw1nz/FmK9hV1EfHoudbaRVKttjpeFnzChVju7B3VsIhfI58WUM042zxkG37RkPafckp+psz8p9D3mqFvZA7sN/S0O1NkbttaDaW8RDsvUJDssNwYLvXi+4a+FEN8VYbkuXTW8rh0bk4/qGyV7TBv+CQ6F4vcnnMHq7FEeHRKCI8GkPsFNht2fGO6RUKNiHIT+PH979+/PLsv3//Kqq+fHz/y6cP+uPvf3/+9fDbv/7/z/Wb9d/H//nlj18//Pb3lw+iyf8P+fHPj1H+94GxpfBP756i/JyHbyP/cev4OcvP8t7XiFxJfi8FKsV3lar8KJ+XhNro+U9fpbn/Aw=="
     },
     {
       "name": "sync_private_state",
@@ -2611,7 +2611,7 @@
         }
       },
       "bytecode": "H4sIAAAAAAAA/+29CZhdV3Umuk/VrVLdUklXpdkarFu2bCxLnmRsDBiD8CQbydYsWbbBZVu25tJQkizLJCRAhyGGgJN0hn6PpBsC6TbhpSEDaTqPJiG8hLgzkA5pMkPzgQmD05h0oP1Cc/BZqr/++s++55y7SrpYtb9PqnvPXutfa6+99trj2TcJz6fZ2d+jJw8+8LpDR/YcHx7d9bqjo9/7P32aZLm1UDElLcU8ufT5nL6Mogs4u7/3rxmKCeojieX43/D6PgYsxR++z5+EqvKfL3/KU7H8odcUAX7UxXCnfe/fdPh8C8mvqP/r29V/dkRnq5sbgb5pH549+tlf+vTjH/7dD4y+/30/Pfi5GT87fVX/D7/5zd9Y/PUlP/fMm/+d8d4EuEkorFev8d+sZN/wG907d//qd0am3/rGD5343H+/49iMJcOfWPaW9+385LuWPf26f2W8tyjeL//4z/9w40Pv/oXmyqe+1XvrO7/6um/e1nPd55567Lzf+dHnnn7mCeO9VfH+6c7n/vojjScefeTxj5667pI5w08+8dl//MqnPv0rjW/+/QcPf/Ya410LZa7Slm6rxj/L+G8H/loo1xbS9Jpq/Kf1X1eNv8v418PDpn34kfd+4K/XPP7UlV94rv9t64ff9MjVb//M9q89uvD9F31x7weXPDlovHco3s+P3viu0QUHrv1a3x89ftUvLl76t8++/yNf+qeTu6776pe+/OtD3zTeOwXvwtUveumhn/njuX91yQV/+aqPP3n5T5737PLr/+o31/7iM9/5/X8OYzbbAGUuUWeny7yxGn/N+DdV4+82/s3wsBnnsVBxuuxbqsk+zb+1uGxLPca7TfMmb7zg6L+uP56s/8SPXvaRgf5PPL3mPa++8alPv+ltyxpPvsd4twveS6+vP/O+t/3Qm8Pfvf8f3vFPl37sVZcNnr9m8PI/+/k/X3zwyN3nPWO8O0xQKFXmJcZ/F/CT7tFk/DvDRN2L8t5dTfbp9n1Pedmnee8tz3u6jbzWwEIpm5/2lddV468b/33V+PuNfxj4S/SFTeO/vxr/lcb/QDX+q4z/QeAvUf5XGf+uavLXGP9D1fhvMf6Hq/FvMf7d1fiHjX9PNf4HjH9vNf4HjX9fNf5dxr+/Gv9Dxn+gGv/Dxn+wGv9u4x+pxr/H+A9V499v/Ier8R8w/iPV+A8a/9Fq/CPGP1qN/5DxH6vGf8T4j1fjP2r8J6rxjxr/I9X4jxn/yWr8x43/0Wr8J43/VDX+U8b/WDX+1/eH5+e8X1jw/IN0Hrwwyzw2umf/ntGTt+4a3fr8pxtHDo7uemS0BwBMHn7vou/d9L1G3w2vJ4ePeVolm3f3ko7NYuwbBjL6aaQPYveRns1QKC1NCC+E8eUMhF8nXUrKSxLCM3lcPqszK3td6NIQeWzjupBTF3IaIm+fI9YxR6z9jlhHHbE8y3jYEWvEEeuII9YBR6xhRyxP23u2oeMdirXbEcvTJzxt7+lfex2xPNu2p0/sccTyjNEnHbE6tX+0sa+NHXCskeT8NTn8zOTUCavquEeVq0/Ii9FPi9D3F8RPx9WN7HM2rr5p1/3HHl438nCgxEPdm3JUXEJ0WyKqMW5C//j5EnrWLWgxpcWbn33OinfLrtEHdm8ZfvjhXQ9+r5BHmYORbsx5zgNSpLHBeD9p2gyFUlcRp0T8OulS1SmV06jGllrVtokzq64bGX7wxuFDR4/t38XTLJwisFUQFZ+pOk1AM3zWTXQ30ve1gi8I7DTfam6AnjdDoTTDvGKGyLS8mYA9jfIakIe1yalb6G86p5hPLxjDZTrWB+tjJuVNh7wGyOZ67RdyTP8uQT+dsPoFn9m+lbxuwcfT0tjUuUhrs3KkqSFkmOxJjApzOz0qWPmmV5M3JyF+lIeYpo/ZekDkGZa1w94cLOOtEf1/zP42iC5NO0nGgNAXn5l90mWkD5LuaFv2k3bsiHimFz5D/Hpoyy+TWL1h+dhPKsbY2UXsjvpwTGbbYtzrzcEy3hrR/7/Z30aYGPfZT2YIffEZ+slvke5oW/aTinZcU9RPDL8e2vLLJFZvWD72kxnV5L2qiN1RH9U/o22xD+zNwTLeGtH/Yfa3QXRpYj+ZKfTFZ+gnn8o+9+Xo2wyF0gk1bmE/Q7uUOb5Q1M8Mvx7aqvckZkfV3tTYy3gbIo+XlhtCTkPIaYi8Y45YRx2x9jhi7XPEOt6hWCOOWEccsQ44Yg07Yh1yxPL0+060V6wfKouVJk9fPeGIddARy9NXPcu42xGrU9v2KUes+x2x7CgCj/MMP019YWLbKzs3QTzTE58hfp10KSkvidlFjRmtfLOqyRtMiB/lIabpY7YeFHmGZSuJvTlYxlsj+nmZQRtElyYeUw8KffEZjqlnZbgzhb68vlDWH5GfbYR87I/t1BfimZ74DPHroS3/T2L+oexi5RusJm9WkfpFfczWs0WeYc3JvvfmYBlvjegvIn+cDTqxP84W+uIz9MdmMl53tC37SUU73lzUTwy/HtryyyRWb1g+9pPZ1eTdVMTuqI/Zeo7IM6y52ffeHCzjrRH9avKTOaAT+8kcoS8+Qz+5LMPty9G3GYolbiOGgdhol+L1kPxjUT8z/Hpoq96TmB1Ve7Pyza0kL3mGfQPlIabpY7aeJ/IMy/Yve3OwjLdG9K8iP0MZ7BuWh/riM/Szl1M8Qtuyn1SzY3h1UT8x/Hpoxy/H/ETVm2pvVr551eStKWJ31MdsPV/kGVa25TfOTxDLeGtEv578ZD7oxPFovtAXn6GfrM1wZwp9ef091l4QtyH4jU75XIm49zpVpyX4Dxv//Gr8j1gdL4CH3J4WwvMS/nZV0fZk+HXSpWp7WkjyuHy8Bnue0KVBeWni13LOE3LOE3IU1kFHrH2OWMOOWHscsQ45Yu12xBpxxDrsiOXpE3udsFScbEev4456zXPCStMxR6wTjljDjlinHLE8Y6FnezziiOVZj485Ynn6hKftvdp2cC6jp08cdcTq1Djhqde5MGaa6tPOnu092+N+RyyvMqaf5ztheeqVJq/xhHcZef8O55ZJ9rdP6FBi3npDQnimJz5D/DrpUlJeErMLlo/nyYuELg3KSxPPkxcJOYuEHIV10BFrnyPWsCOWZxlHHLGOOGKdcMTytP0pR6ypeiyH9ZgjlqdP7HXEOuqI5Rm/jjtiedre01c9bd+p8cvTVz3967Ajlmc9evqXZxvy9K9jjli7HbE8y9ipYznPMnqOJzq1Hj1t7zWWSz/Pd8JKU6eOczzHmFPjiRdGG/KME556eflX+nmeE1aaHnHE8rS95xjA+lo+N2b4aWpzDWwoITzTE58hfj1MrEuvNTB1Bs3Kt6iavGaRekB9zNaLRZ5h2b0kvTlYxlsj+puyQjWEDD6jZ3moLz7Ds1evzL7MFPq2uxeB/Gwj5GN/rFhf3UX90fDroS3/T2L+oeyi/MN4Vb2y/YvWawyL14UtP019gq+EPRpF7W/49dBWfScxu6g4aeVbUk3eTG7DKA8xTR+z9VKRZ1jnZ997c7CMt0b091I8WAo67SQZS4W++AzjwQ6KB57+iPxsI+Rjf6xYX4XfaTH8emjL/5OYfyi7WPmWVpM3q0j9oj5m6/NFnmEty7735mAZb43oD5A/ogzunywP9cVn6I+7yR9VOyvSLhFXxUeje6HJGRB83L4q+l9P0fZl+PXQVntOYv6u7KL83XiVn+bFZpSj/PQHEcv8L9Y3Fe03lP8tPcNylC+n/5qhULrN+M+vxv8y419WjX99H9GX5L/Z+Ieq8W82/guq8d9q/BdW499h/Mur8d9h/BdV47/J+C+uxr/OYs2L4CHH2UvgeYm4d0fROGv4ddKlapy9hORx+TjOrhC6NEQet9EVQs4KIach8o44Yp10xNrtiHXIEWvEEWuvI9awI9ZhR6x9jljHOxTL01cPOGJ52V71653iq57t8YQjVqe2x0ccsTzbUKfa/qAjlmec8OxrPWO0p+097dWp/uU5NvGsR0/bnwtx4pQTVvp5mSNW0xFrqAOx0rTLUa8LHLGajlhzO1SvCx2xep2w0uTpE8sdsS5yxGp2qF6evtqJsTBNDztiefqqVz166pWmTrWXp69e7IjVdMTyil9peswRa9gRa78j1ogjlueY3HOu4Ln2aON7W8fGde8k+9sXJvpl2bMjiGd64jPEr5MuJeUlMbtg+fgswqXV5M1IiB/lIabpY7ZeKfIMa1X2vTcHy3hrRP/KzLANoksTn41ZKfTFZ3gW4WUZbl+Ovs1QKK0aCBNtxX6GdilRD6uK+pnh10Nb9Z7E7Ijl472iVUKXBuWl6SGg47xu8awrgnXUEesRR6wjjlh7HbGGHbFGHLE87XXSEWu3I9YhRyxP23eqfx12xNrniHW8Q7E8ffWAI5an7T39a78j1jFHLM8+zbMNedr+hBNW+nm+E5Z3GU85Yt3viPWYE1b6eYUTVpo8be/ZP3rGQs9xjmec8IxfnToutHq086sYN/j8atG7rhuC3+gGBF+S/W1z7aHw7+rx2sP8avKiaw/KLlZ2tRbQEHm8z1J0Dq/WA445Yh11xNrjiLXPEet4h2KNOGIdccQ64Ig17Ig16ojl2YY86/GkI9ZuR6wTjliebdvTvzzbkGdcPRdsf9gRyzNG85gKxzN9JKfsfg7yG12b6/Sb1Fp8Cf5txr+qGv+dxn9ZNf4bbVx1OTxMsr+GfQU8LzHG+5GE8ELQY0rDr5MuJeWdHlNeQfK4fDymvFLo0hB5/E7KlULOlUJOQ+QdccQ66Yi12xHrkCPWiCPWXkesYUesUUesY45YnrbvVF894Yi1zxHL0788Y85RR6xzwfaHHbE8y3i8Q7E82/YBRywv26efz3fCSpOnr3bqGMATy9NeU/32VL891W9P9dutsKb67R/8fjtNnvbqVF99xBHL016eMcfT9gcdsTzbkGe/3akxulPHE55lPOSI5VmPnrY/F+LEKSes9HOvI9YKRyyvdfL080onrDTtcsR62Akr/dx0xJrriLXcEWuVE1aazgXbL3PEGnLEusARy9NelzliefmqZxtKU6f6faeW8YUeC731muo7fvD7jjQ95KiX51iu6Yh1sSPWRY5YQ45Ynu3R015NRyzPvuMxR6xhR6z9jlgjjlie6wCHHLE8z+fwvQ1XQF6S/e0LE/0yldMMhdL0hPBMT3yG+HXSpaS8JGYXLJ/Zxcp+ldClQXlp4vsPrhJyrhJyprCmsM4Wlp0XxjbM72CVjSPIb3QDgo/jCLazEu16edE4Yvj10FbcSmL2V3axsq8WujREHq9PrhZyVgs5DZF3zBHrqCPWHkesfY5YxzsUa8QR64gj1gFHrGFHrFFHrN2OWJ7t8YQjlqd/edrrkCOWp395tiHPuOrpE55xtVPbtmd79GxDJx2xPNvjueBfhx2xPMcA/I4fjpf5Hb+ycwPkN7oBwZdkf/tIvySUGkO/KyE80xOfIX49TCxzlTG7sr+yi5X9aqFLQ+Txeu/VQs7VQk5D5B1xxDrpiLXbEeuQI9aII9ZeR6xhR6xRR6xjjlietu9UXz3hiLXPEcvTvzxjzlFHrHPB9ocdsTzLeLxDsTzb9gFHLC/bp5/Pd8JKk6evduoYwBPL016e/ban7T3HAJ4x2nM80am+6ulfU/32C6NtT43Jp/yL86bGhWfPvzpxXJgmT3t1qq8+4ojlaS/PmONp+4OOWJ5tyLPv6NQY3al9mmcZPce+nvXoaftzIU6ccsJKP/c6YaVpl6NeK5yw0vSwo16e+0Oe9rrYEWuuI9ZyR6xVTlhp8vSJpiOWp+292rZne/RsQ+nnlU5YafJqj2k6F/xrmSPWkCPWBY5Ynva6zBHLKxZ6xug0darfd2oZX+h9rbdeU2OTH/y+I00POerlOZ5owud2sTzH5Bc5Yg05Ynm2R097NR2xPPuOxxyxhh2x9jtijThiea4zea5/eZ4v5Hd08Wxrkv3tCxP9MpXTDIVSf0J4pic+Q/w66VJSXhKzizonbWV/sdClQXlp4ncoXyzkvFjImcKawiqDxefHDT9NfWGiz5ZoI4V/h97w66GtGJDE7KJilZX9GqFLQ+TxGOUaIecaIach8kYcsY47Yu1xxDrqiHXSEWufI9axDtVrryPWsCPWKUes+x2xHnPE8rTXEUcsz/Z4whHL0+89Y6FnPe53xDrmiOXpE4cdsTxtv7tD9Rp1xPL0Cc+xiWe/7VmPnRq/PP3Lsz12aoz2xPL0rwOOWGZ7XkMw/DT1EV8SSs2dliaEZ3riM8Svky4l5SUxu6g5rJX9WqFLQ+Tx2YBrhZxrhZyGyDvmiHXUEWuPI9Y+R6zjHYo14oh1xBHrgCPWsCPWqCOWZxvyrMeTjli7HbFOOGJ5tm1P//LUy7MePfXyjBOePuFZj4cdsY47YvE9NDg24ntoyo7PkN/oBgRfkv3tCxPHKCXGS29OCM/0xGeIXw8Ty1xlfKbsr+xiZX+J0KUh8vhMw0uEnJcIOQ2Rd8QR66Qj1m5HrEOOWCOOWHsdsYYdsUYdsY45YnnavlN99YQj1j5HLE//8tTLsx499fKMq54+4VmPhx2xPG1/vEOxPOPEAUcsL9unn893wkqTp6926njCE8vTXlNjgKkxwNQYYGoM0ApragwwNQaYTHt1qq8+4ojlaa9OjRMHHbE821Cn9h2etu/UsYlnGT3H0Z716Gn7cyFOnHLCSj/3OmKtcMTyWr9PP690wkrTLkesh52w0s9NR6y5HaqXVz1667XcCStNnj7hWY/LHLGGHLEucMTytNdljlirHLE61VebjljnQnv0KmOn+tdUPzTl90qvhxz18hxjNh2xLnbEusgRa8gRy7Nte9qr6Yjl2R4fc8QadsTa74g14ojluT7huW7ieZ6J772YC3lJ9tfOBWKsS+U0Q6FUSwjP9MRniF8PE9t3CXmnzwUuJXlcPrOLlf18oUuD8tLEdxycL+ScL+ScKSxVXxiXWqStfWGiPUrw7zN7LoOH7EtD8LxE3S4s6kuGXyddqvrSEMnj8rEvXSB0aYg8rqMLhJwLhJyGyDvihKXqvhP0StNRJ6z084ATlncZhx2xDjtiHXfEOuCI5WmvE45YjzpijTpi7XPE8rT9iCPWXkcszzKecsS63xHL5gbWf+HYiftu7BuK96XJ3xXtuw2/Hib2kVX6bjWmwvKZXdobmyR/GxsrIKbpo8YK3O/avLQ3B8t4a0T/huzlH9XvDZKMon7T871/p/rG6462ZT+pZscwo6ifGH49tOOX8TGeGntb+S6oJm+giN1RH7P1xSLPsGzftDcHy3hrRP84+cnFoBPPTS4W+uIz9JO3ZLgzhb5XEG6svSBuQ/AbnZKzqE05i4Qc5dvpv2YolP5e+U4J/l8w/our8a8w/hXV+H/T+FdW4/91419Vjf9H1DuKJfjvNf6XVOO/xPivq8Z/tfG/tBr/l43/ZdX41xr/y6vxf9T4r6/G/y7jf0U1/m8Z/w3V+J8w/ldW43/G+F9VjT8x/lcDf4m+o2n8N1Xj7zZ9b8SHQifDt75nDdAnOX8Ni/NMVp2wSuqexHRH/TiO3wjysIx5WDeWxOoTeVXq5NUhv1yIPxDRhfVME88TqpY5TXudsNLPy52w0nTMUa8hJ6w0PeCo1wWOWBc7Yq1wxOp1xGo6Yq10xFrVoVgXOmJd64j1Ekes6xyxXuqI9TInrDQ96qjXy52w0jTqqNf1jliXOWINOWK9whHrBkesVzpiDXYo1quyz7augP3SJSSnV8jpjchBfqPrE3xN+/Ds0c/+0qcf//DvfmD0/e/76cHPzfjZ6av6f/jNb/7G4q8v+bln3vxe420Cbjfyx9P2Ntfr5rS5Hjbb+C+sxj9o/Mur8d+k1lRK8K9RayrF+ZPAayohlC/7qkqyw7L27nxKnlHrKV2F+UOfWk8pwX+tWk8pwf8SXk8JwLv8z39r2v/69++s/ce/eGbkxLcufeIPbn38t//D9e9+6rIb3rD5Cz/99fVqLaWE7WeotZQS/E21llKCfyavpXwftBBreLlaRykhu0+to5Twu7/ldZSAvDf8RvfO3b/6nZHpt77xQyc+99/vODZjyfAnlr3lfTs/+a5lT7/ux9qcrw/wGsw42X+687m//kjjiUcfefyjp667ZM7wk0989h+/8qlP/0rjm3//wcOfPe2vNyveaEq+v64+o/78N+uXktO5IUyDz9YO0tQTxtZlthBNmmpE/9zMMb7BTN4A8QT43Ef8Je15HpbBUjc9Q/x6mFj2EvISto/J4/JZvpW9JnRpUF6aeI+3JuTUhByF9Zgj1rAj1qgj1j5HrCOOWHsdsUYcsTzLeMARq1P9a7cj1jFHrBOOWJ7+5WmvQ45Ynv7l2YaOOmJ5+oRnXOVz4pjH44AeeF6iX+4qOg4w/HqY2C9XGQf0kLw8u0z/3r/Z2edjo3v27xk9uW5k+MEbhw8dPbZ/F44mcITAUhJCxWdJGF96zOumZ91EdzN9Xyv4gsBO863mptHzZiiUrjSvuFJkWt5VgM0jK/yFS6xNTt1Cf9M5/fv0gjFcpmN9sD6uojxc7VkNsrlee4Qc079L0PcSVo/gM9u3kncut0RVT8bbEHncFouO/KtEiEb2OYsQN+26/9jD60YeDpRq9P2mHBUXEt3aHNUSgZvQP36+kJ4pUyB2bBJYxGXSxJ0M5m0hOVOdzFQnczpNdTJC/8nuZLoFHy/z8PJPmpr24Ufe+4G/XvP4U1d+4bn+t60fftMjV7/9M9u/9ujC91/0xb0fXPLk7FTWY7Skhfqyz1rZelqUr0b0vwlLWm/I5KUtLatKa2mvPrZ/36Zdo0f27Dq+63sx+2ig1Kp5rKfvdwg+lcwlVHM181YMQIUDnuHXg67mZiiUTgc8NdvA8lULeOwQ3JC9A94d9L1KwOul581QKJUOeNxNY8DD2uSkAp7pXDbgYX1wwMOGygFPeWIQ+ncJ+h7CigWrVvKmhh7Pp6mhB6SpoYfQf7KHHszXEya2XOOtEe1/yLr4NlvsuBMlrONUn/18muqzIU312UL/ye6zVSRJCGMyly5QdnQy9PnRG981uuDAtV/r+6PHr/rFxUv/9tn3f+RL/3Ry13Vf/dKXf33o2TajxrY2o93WlO/3aDLG57Hxs/VMeecLjLdG9H9YH+P7A5iMXZTlZxFl2/D+PQ8Oj+66+eDhY7uO7XrwjpHRXUfXHHzw5uO7Do6WnprdQt9vFXwq9YexAvOFNFjINPHa3Lzsu72UyTRsIKP/48woqcGeyRqycjrTZ4D4Q5jYFc0n3ZuhUCrcFRl+nXSp2hXNJ3lcvmpdEbszWgVR8RmHDcw7E13RQnreDIVS6a6ol/KwK8La5KS6ItO5bFeE9cFd0QLI464I63W+kGP6dwn6BYQ1X/BxV5Qnr1vw8VAioee4ljVXyOa1rC9DdPjmgnw74FVXjGnf1eCd7W35aWrTJ7cXjSaGXw8T675KNFlI8rh81aIJegpK2UaoRoO0mLaBZkjP37n2aoKPk+HUWOf+5/+m3vc/qdPHcs0kvZW34zMeJCG/0Sk509uUM13IMU+eBnx3UV5fJK8OmDMpbwbw8b5VA/J2Ut4swJxOeYMRzNkCM627X+gfw0v/4aVkytOtB7I6wEsz+MK2ZSAHadN0T/a3RrRzwa96+8fLwlbMfrWghd4xv1oQ8uVMb1POdCGHe6s0se8sFGW1vPOAj+t5EeSx7ywW5bK8JRHMpQIzrZ9/3T+eLnZhXxOel5mUFI34zeyz14V9TZLH5eMJ21A1eVsT4kd5iNnMPputl4s8w3pR9j3v0h/jrRH9UFafDaJLE1/mslzoi8/w8PgS8pMm0CU5fw2Xn3H7agKN1Y+6XGgL6HNxTszDkRTGNZsQc6x6H+wKrqBYhfxN0ku1k6rlXybKODNMtE0/fM7z72ZETn+kPMjnWZ/9JAfjLNbnNVSfQ5DHMTr9fEH2uUb074D6vI7qU7VFZWfulywvhGJ2ninkTLaduX9Z7igHsfjlkUsIi+1s9WR2fhHkXUJ8+PIc0uGsC1+cXCFkK3zDaOWDt/XrsuX5oMmqEf1R8MF1FX1wOeVhX8E/omJ6oB2Q/oKgy9WbQ59Xrs1ZWdKx9D8tGI9p/GgrrAuOv0a/DTC/vUDrieVSl7EZvfKHS0S5lE35AgslG+28Nkd2b4j7Yo3o7xU25X4B+VU7mkO6vKiF7ty+kd/oBgRfu3FE6dyqTT5Usk3yJXdGfw+0yT3UJmM+gjrzPKKsnacLOZNtZ54jrHCUg1jcL6wkLLaz1ZPZ+VLIW0l8qyAP6bBfwMtZVgnZCr9ov/Bovy5bng+arBrRrwEffH1kXhzzwRWUhzblfqFVPOQLgEzv3hDvb2tE/6ZIv6DaK8Za7heM/sci/YLJxXLF+gXli5eKcimb8qU/6iJZtDP3C8qmWP7zqfxG/46C/QJfJIvrEXdTHq5HDFHeeZDXpDy8BHM55eF6BK+NLIE8jnd4oS/6CK9HTIuUpw8weL0P1+0WUt4MyDuP8hqQt4jycN1uMeXhMZEllDcb8pZCWW3djjdH/132vM19O3l0JbYumuT8DaFYf8BHq1DOfEc5iHUzyVngKId3HFDOeUKO1dci4muGQqnwPqvh18PEtltlnWwRyePyVdsZwWjDVkFUfJaE8aXHvMncZzW5iyFPWYJXzrFMi3P40BZBPOsS9IsIa5HgM927I/yIgXzsMQk9z9uPNIwa0X8MeqvnqLdWstAe3GOa7nknJlgHo/846PDMAo1ZyynXeTmYn4GdjN/p15hBYKpyLaZysQ6LSAej/5QYCXQTDeujnqXfcWS0OEc/VU+sK/ZyeeXhejL6pyL1tFDogG1ybQsdmGZxjg5/InQQ0e3GkUMns+gWKPHhcI5ObHnet10ocPKS4adeaB6pThmcJ/j4/b4uoVNacqu5068s7t81uiun7F1CNyWzK+jE41HjS1NfaKtPK9yHGn49aM9rhkIp4Shn8rh8fBx8kdBFXTqP9ct+FJOT1qmtsWR1unl05EhelRbtXBOhVgj5nWwSxlcF8lhVV9zmK324iYdwq4Geh5FXAx8GNU5cbixPGly+W+LgE9qUDz6he66mPGwqV1MeutKLKQ8D/jWUh1O3aykPp24voTzcMrP73GywhPWM0zPMS1Nsq7Yh+JdF5MxqU84sIWcSt8oLh69m9vlMb5Vb2YeELg2RxwfYbMo+mq1Lpl3av9CUH4/Tsl0rvr1zbVG7Gn6ddKlq12kkj8vHdu0TujQoL00PAR3ndYtnXRGso45YjzhiHXHE2uuINeyI5VlGz3r0LOMeRyzPMh52xBp1xDrkiLXPEeuEI9aII5anT3i2x2FHLE+f8LTXAUes445Ynrbf74jlaftjjlie9vKMhbsdsTzt1amx0NNenjHH0786dczk6ROe/baX7dPPA05YafL0e0/bH3TE8vR7zzJ6xgnPMYCnvU45Ytkd3LbGhOsQfOxGzfmnReQg/7QCWGr9IFZGtY7jeEuhqXgN0a3NUS0RuAn94+fX0LNuQYvY+Bp77OR1X/Z5iLCboVBanRBeCHpZyfDrpEtJedGfKW7CM15WWi50aYg8/hmkom+INETeUUesw45Yo45Yhxyx9jlinXDEGnHE8vSJI45Yw45Ynj7haa8Djlie9trviOVpr0ccsTx9da8j1rlQj8ccsTzt5dkP7XbE8rRXp/ZDnvbyjPee/uUZczzbo6dPeI6ZvGyffh5wwkqTp9972v6gI5an33uW0TNOdOr465QjFi+TDAE2L5MMCTlDETnIP1QAqymwYmWc5GUSU/Eqolubo1oicBP6x8+vometlklq2Wdbmvkf2akcWxapeKpIvnjCp7RwOQhPm2FeCMVW6pC/LyKn3qacekE5V7Qp5wohZ0DwJTl/TQ4/i63sX0FyzsYFF+wHTZKT16yVHzRzsPCmyvuAZinRD2XfawIzTXdBPtJ/J2tD6bLo57Njm3ziMk34gulz0+O6Ii/qWiP6C+EF0+9mmMrOVu/KD5qUt0zIVZjctiwvhGJ1Vxc6xLCwvmYQvdVFbw694XHd1bNxm3qRFV/cU/7TzNEB/QcvYcrznxmgQ1H/aQzEdWX/mUGyT9OD/8zOMGeGiTaO+c8MykP/aYbxmMjHJ3XLxsxZQj8lJ3ZRGPtR2YvCZgg51pei/5XoS0ufcp9FeXiF5yDl4Sn32ZT3YsjjPugayOMXaPFXxNEenLrpO9oo9f0vgu8zXSCZWId8ch793mxhdY/jFMTAPNOVn3HdI/9gDlYtTGyPadoC+Uh/UWbAtD1eMTC+XHgZoNmkTV+7OiG8EPR2luHXSZeS8hKOVyaPy8fbWapPUvHmIviMeSgndvof80YcsY47Yu1xxDrqiHXSEWufI9axDtVrryPWsCPWKUes+x2xHnPE8rTXEUcsz/Z4whHL0+89Y6FnPe53xPKsR8/45WmvUUes3Y5YnvbybEOe4wlPex1yxPL0r6m4enZsn34ecMJKk6ffe9r+oCOWp997ltEzThxwxPK0l+d49QFHLN4awzk6rz2o+fDSiBzkX5rDl37GNYcib7EPwfMS8/ruhPBMH3yG+F5vsQ+RvLz6KXsslvcG2jkaUORCD7X2EfMNVUbHrUtTcTXRbchRrUvgJvSPn6+mZ3lbl4ZtzQiXnnj7CM0YM63aPpodkTOjTTkzCsqptymnXlDOrDblzCooZ0GbchYIOXz/Yppwa+SjA1ombo3gci3fGGX0zw6M8X2MtkZwe2EalR9f6OC7F/H3Yzj0NuB5iVBY+AIRw6+HiT5ZJfQ2SB6XD8NS8TsEuQWgVRAVnyVhYtRIQDN8xpvp04hvreALAhuj1SzIU5YwTPMQLNOsHD60RRDPugR9g7Aags90747wIwbyscck9DzvDkHDsBZm9P8VNj75DkElC+3Bh2hM97x74VgHo/9T0IHvpmsAjyoXt+ZZ9B19654c+V+CKPPnA1p+EPK5fBjV8u7na5AORv85sQmuIiXqo55xzzBIeYMRWv6NRvX7eeiLfDehRZi8snP9G/3fR+q/LnSI/fIn68A0vTk6fFHo0N7dhBzluJa4JuoCJy+ZNVKPNe9l63DrYDn2XXlAu3cT9uXI7Ao68f3RxhfCWN9csa8s3Dcbfj1oz2uGQinh6GnyuHw8LWoIXRoiL6+VtpLT5t2EeZ22ChbMH4g3Ec/SpH4HeWqqkS/nXJhqMJaaQqTpwewvB/berDLUTxrMBj0U5ibSQa0CqJNJRq9WrpaKMpotcZViWQHZaEvuCIdK6qpWV4aAhk8hon7LS+q64QzrOlvoeqZPiPFprtWQxz+VgCfE+KQXnhDjn0rAE2LzKE+dELO8l0Bek/Kug7xllPdSyOOlgZdBXoPyXg55eHcpJ+5DsL7S9vzxRWO4TIef82IRtvW1pOOgKBsubfQBNspphkLpRcbfVY3/fuPvrsZ/mZWTh61pMuweeF6ibTyANrGkhlyGXyddSso7PeTqIXlcPh5y9QpdGpSXpl1Ax3lqUtIVwRp2xBp1xNrtiHXMEeuEI9aII5anvQ45Ynn61xFHrKOOWJ4+sc8Jy/i99DruiOXpE3scsTx94rAjlmdc9WzbXr6apk6Nq54+4Rm/hh2xPH3C014HHLE87bXXEcvTVz318rTXudBve9rLc7zqGaM9xwCPOGJ5xq9O9QnPONGp/ZDnHMazjI86Yk3F1RdG/PKqxyRMXHPrFHt1aszp1HHhfkcsz/bo2dd61mMnjleTMHENu1P8yzOuHnTE8owTnbrO5KmXp+07NU54jsnPhXmtZ799skP18pzXetajZ3v0nMN4rvt6Ynn6BLehJPuO+6R3wee7IR/p7dYitY9dYu/2wQHgCYCB2BX3oR9MCC+E8WONQPgDOfLSVBd5tQK6/Nqr7t33N81vnZ8Qv+nCz4rMTdSettmq4m913j8AMgLJtjzcn++hPLSL6ZD+fXLxeP16K+pXxH6I3xD0O4GuTF0MhvG+gP6u3izkm7CGII/PdbU6y8Q/GP+i7HtvDr3h1Yh+etZe8YD5TKJJP9dz5KF++Cx2JvFFOVh5N6RdmKP7IOjOZ/guEfqp469Gv0LQXwI0po+yzYqgZWN5sD7vo/IY/QJRHtX+zKf6AMfySrSd6amc31g8Jofthu2nlY3SxDa9VNCjrcwmDaJH+1oevtZ1CeVh2xkiHdSZQ3zzls93qZsd8Va/2A2OndSuVxRs10ty5KF+sXaN/GXadZpel6P7FSXb9RKhXye162sKtutm9nmqXbdu102hQ9F2bbzqtteVkGe4eP784uxzjehvivjsqjBR15h9Lxf0q4CGb81cCXmXUx7yvYjyLoc89vUrhR1QLz5Xb/TrwA6fBh+0sgTSq01fX6N8Hc9es6/jrdzdgp7rYrWgx/PbZpMG0XO94HfEQpvyWX2zUa+gR7wa0W8Xsd/0w/h2Jem+oqTuC4Tu6hZQbFOP9j//2XwQYzH3lSsiMpkX40xvDr3h1Yh+WNgrFvPRTj2EafQPRuKBip/nwzP2QWX7S0W5lE1XUh7qbr6g2qfRtdk+X63aJ5af22esrGli26jYir5r9d8IE+Mh9zfYNi4lOWrcUdT/0Yce6te4ef3NBdln9q/jEf9S7WYInpXtz7m/Qf+6lPKQr0l5aFN+N0j1u0h/YRhvB6P/oYL9jZM/z1b+jD7L/hzzzzSV7fvNJo0wsT/geKh8Fuua+xuzUW/QdWB4NaJ/a6S/aQL/StJ9eUndq7S326i/GQK6InMzxB0iejU3Q/q8udkTkf5mCHTnOYbqb4z+pyPxQM3pYv2Nsv2LRLmUTS+hPNS9mX1W7RPfv7PyWV6J9jlHtU8sP7fPWFnTVHY+yf0NxsMhymtCHs+dh4Scov6PPnQN9Tf87ilioV/E/BHbjdUT++MvR/wx1s7SxDZX/ot+Zfoof+Q5D+rezD4rfzS6Nv1xm/JHLD/7Y6ysaSrbVq0+G2Gir8b8kftn9c4yxhD2R/SjZVDWizN/tHX/irfVl37PtpvycF53M+Xhe7ZYP5y66TuWJ63379JaTxBY6p1D/tUE3LtZTXm4fnI15eGa+4spD+8iuIbyGpB3LeXhO/8voTx8N/Y6ysPLcaz85gP4fnsJHyh8hYfh10mXkvJOv0+qbgnE8lkbLXe9Ft9sgFZBVHyWhImemYBm+Iy9dT19L3O9ltXcAnreDIVS6dbLb5HjKgvWJifVQk3ntFU9XaKFYn1wC50PeatBNtfrPCHH9O8S9PMJa57gM9u3ktct+Dj6Kr4kjO91uC5iv30yn/CboVAqfGep4Xv99sl8ksfl4zfFFwhdGkG3DfuMeSgn9ltGiNVLWL0FdW7zoh/+Pi9HjS7BH4iXm2qRww2x29Va3TBmeHwJzFfFREw1I9RnQDxjt6/YwRTu0Ay/Hia6RBW3n0vyuHzs9ioMNURe3mU9reQ4umqa1ueooXrKQFiJeIZ5ylXxrEgRV1XnVNhVvxNZY0kEf4r5WH287NcAXXeYWD7WdR3pqmhQV6O3ASRemme64ljW9Blg/jCxSa0n3ZuhUCrcpAy/TrpUbVLrSR6Xr9oYkb0PrYKoQdAGkdeq5dxI36uMEe+k581QKG0wr9ggMi1vI2AnlLcJ8rA2OakxoulcdoyI9bGR8u6AvE0gm+t1vZBj+ncJ+jsIa73gM9u3ktct+BLCSOg5rgy9RsjmE6ILITp8kzpdlPWaMD6pCMFjoTSxvUOYGE0q+uSOotHE8OthYt1XiSZ3kjwuX7Vowv2iSdlOqEaDtJi2g2ZIz9+59pqCj5Ph1EjnqzIvSr3vguzzzDDRe/tJb9QhFpcbgt/olJzpbcqZLuSYJ2M93EV5NVFWPq+cpi2Udwvk7aS8W0W5LG9tBPO2CObtIi/V79cb4+kwGiU5f9PULZ6xTdcLXa3uMALw2VbV2u6MyEF+oxsQfO2WR+msxk545f71jTEe7E0xaqMfD2Wfa0T/hwvG+F5J7Q3vbTQdlZ25LZa1c7+QM9l25ja10VEOYm0B+vTfZsJiO1s9mZ1xtLOZ+BAb6XBEsBmebxGyFb5htPLBDQ1dtjwfNFk1ov9V8MHNFX1wI+XhCJL7Q9MD7YD0Q0GXqzeHPq9cO2FExHO79YJf6c53+W6M6J4m9kXk55HrZPg8ymzlPw+Q/2yCPOU/vO9u9D8H/vMQ+Q+O0Caj/LF2jSM5/kEK1e5U/GA+bKNzCuiwWejcEPxGNyD42vUNpXMr3xgl38A85Rt8ftfo3wi+cYJ8A+On6ajszGPAsnaeLuRMtp15fLfVUQ5icf+2nbDYzlZPZudtkLed+HZAHtJh/7Ydnu8QshV+0f7tLQ1dtjwfNFk1ot8NPvj2yJwm5oNbKQ9tyqslW4UdVB0kpHdvDv1WKpfRv1v0b7H2uhUwOZYb/U8BJp8vMblYLjVbjvniNlEuZdPtobVstPPaHNm9QZc/z1f+TcSmxt+TUx62qdG/J2JTZaOYTVUb2y7KNVOUeQdh3SGw0M5FbIrlv4PKb/S/FBmHbRT8auzAY0g1DkN6Pmej2pgam3Abe7LgGJLHNri2cDfl4drCBsrDPQuei90CeZsoD9cWeJ0D65H7v9sgj9cdboc89H1bW6hRWT+aPW9zb2HceZdAWMq+Sc7fEIr1p/wuPcqZjHUTJecORzmIdWP2V83Z+HdXyq4bIH9sblhrU05NyGEsi8lpwn6Ez/Ua/aehXf/XxeMxNwj98A6AtZGycntGLKszax8Y+yZj783w66RLSXlJLOZi+Xg7e5PQpSHy8uoU5aifWSyrl+OvxZqKi4lubY5qicBN6B8/X0zP1NYyYp+ppnc25cxsU85MIWeylzpnkpy86c4XSy4pX5h95iXlbTDd+XJkupPX7NDXYkcuTF7eMYaeHP2+Jo4xJMSDZb4wovMGkMFy03RXjg7/k4YqFUOxHKrwUigO6fgaEwxlvDmMQ5xu8Yx9bp2Qw1h53aTZlYd03y7ZTaJvr42UdQPlYdfEdlByVHhXdojJabQppyHkxLr9qrFE6cxTiTRhLOmdNcaDPontCnltGlAj+psgltQzTBVL+CfGeKjB8TWvn8yLJXfm6Dcz00nFEjU0vC2iM04BWW6a7srRYU6mg8US3gpqhmJJxRLemsD4x6cAy/aFyH+m+kI+5DzZ235quZ/ji9qO2hSRo7bUWrXHoVlapmqP3K+NkwPtcTm1R4+turw2EUKx7a4NQk5eDEpTrA8y+lXQxrkPajX0j03V8vTDg1VIPwhlzsMK4pnRY//HyxebiHZjhJb1Rt+2V4EtFvGWcjMUSlvMn7eITN7SQJ0sD5cR0U6c+IgS6pzW95/Qq+dBYKnp5tYcTNXm7yFaK3OXwOXtImzHbK+dOTpwHYcwcYnfcF8zawx/DfUz2HZK1O1WtSVlieuPbcdJ1Z/p9f1X9SrW3zbKU9dl8nyK62PrWbIXz/kxnQ178fJzK3tZnpW3S/DxIVST9yj46w7Cq4Es9n++KhK3Z5g/TTwWM/p7oK+4Pbu/bGaY2L8uJHmIrcbH3M8tzNFLlRPj5GbS22hPkK/ydmszFEprrI63k06IvaMidkJ4IehlR8MfEPJMr7rIK3K968H/NXz1cO+jv58Qv+nCz3gefJegXyjozVbolyVs9YoBkBFItuWhP+6gPFwzMB3U9a53VdSviP0QvyHo7wW6MnXREHLWOWJtrIhl186q7VSOuWnifkj1/Wk9/gyN07HeF5CuZeMQ8peJQzzWNdqfojhUcfz4YjUO5Di0vSJ20Thk+AMhv17rIq9IHNr93JpDn9j0maVJmBhvu8WzItv46kXVNtv5lSoOcaxBf9xOeRiHTAcVhyr2KVcWsR/iNwQ9x6GiddEQctY5Ym2siGVxSI3BVRzi8d0WUR6MQzzHeA+M2X5u1nisIuPuNPFrCRsjeZsFZir7V3LGn/YyEs4jeY6mjhXZd3yGvo48vPZg9O8H27yX9ON57U6hnxqr47rkL8/Kp9sSoSs6vuctWXVsumi9qGNavF6kjrjjs9h6kdFxn/RbUAcfjvSli0iXsn0p8htdkVeF7hQ6qHaK9fnWwfF0aKMk56+Vg59xOVT9pFvfdpFCtvV9667RzbuHj+x6cPOuB47sGu0mDXgHg1vVNtJIJdOSRya30/d19J1XhTcLnFYy1S4F361Q9mWyeULnsynnvDblnCfkqOjerkcqnVutmP9hyR0sXjE3+rfOH+P7o8iKeczOfHl8WTsvnpIzqXKWtClniZAz2e1gCZUHe2a2W9ldGOTfeIbltGrXX3Fq19dDu/5agXYdK2Nsx2idKKNhbW6BxacPkD/2ssG6AnJiL7ysKyinSHlics5meQxLvWyBdbApotdWwtrWAovbknqhQPkg61z2pAnyx060bG1TztaCcs5UeXgXH2dsHLtU3W2L6ID8vMqnVq2qxnylc6sYOTg4xpP+Uy8+xU7vGP2lECPnZpjKzuy7LzQ7b3eUg1g8y8+rzybV5w7IK1KfRj8b6vPCAvWpbLMhUh48HVUkHhZ54WtrhF6tgqp+wOyLuzdWR23u1AwW8QPEr5MuJeWdPkx/N8nj8uGh9bnZ52zmvmbX0atWX3fT96btJw+Nsk0NdxYKBf2ZPtB35kt149Pd24SMNLH/bCc6rnd7zvhFdGpF2ypftZu7iLZsv4b8eSci804/Wf3wSeVrsnauTj+pcRT60NpIWfkyi805uneLMvTn8L0yaP2wzGsjZTb66yNl3tqizDyeUOM9jk1M1y3K0Bcm+gBiFBm/YH3jD1hiHuoXWzldKuRM9mriUpKT19/dRv2denEW2/yrss+8+v7deWN86yL93Zkqf6s2jWVhn8JyqZOeaeJTLUa/NSt7m6dD5AnjvJND3H63U52qssfq1Oj/Eep0Z4E6jbWP2FhExYmNEXo11lFrRpN3wib5uyI+ivhq97rKWESdilE7k2XHIob7t1Ag1L/VWIT51FhkS46MvLbH4wMey7Qaiyid8mjLjkVwnYMvQCi7pql2tc0/uX9vhkKpabpsBD3UqSGOk3jylduiol9H+jF+3vpDLWjb8M6i0R+EccZ6Oi2IOizK0S+EYnWB/GdqfZl3Ijc4ykEsHuNgva6Bz5hncvJickPwx9axt7cpJ3Zqo5WvX599bjUmegP1n+qytprQg8fGvwj95xup/0T+2H4Jv60Wu6wCd7d5V1y9VYO720ovfoOz7C690offWvw3g2O6vIN0wT6Hf4yw7BuXyM/jA+SzttQXJtqjRPwt/OK/4dfDxDJXGR+oOlJ2sbL3CF0aIg8vNMmTE/uRyp6Cejm++G/5K4lubY5qicBN6B8/X0nP1BADsVNZS+aNyUEzvIemDty1NkOxpKYOHGKweriZl21ayJ/3MjN29+qgjQp9/HtwZbty5F+Xg1UTuqeJp3dG/zGqo4rDsw3q8B2HnooHejcUDT159+uhXnWRV+TQ7dP16//gHz7883/EXajpws/Yb9QUUv0modkKl4dK2Gr9AMgIJFsdut1MeRg7TAd16LbiC03ri9gP8RuC/h6gK1MXCmttRSw7KKumEmcrJuUt7/IdtUb/ichSp4pN6iX62GUSHNO4jBxz0tQMOn2XkuGZ/acJWXnHN34fyr1hyXhdNwhdLUZ0R2QE8SwJ+bZhGV2C92VhvG4bC+imXoJGjK4cPVMMNb1hvy07vSn68vclbcq5RMiJ9Un81+Tws9ixk0tITt706y9LTr9enn3m6dc7Yfr1N5FpDk8j1eU6OGYpeyEGxxOj/wK0K74QQx21ejlgsp+hDC5Xmng8Y/RfpvFMxTGHHHPy0g9Okzm2pun2nDJhnI7dRaa2sLZE6NWyM/okx2x1zytj5W2fseztLWRz35h3Ny9+R9kbIrLvaiGbj2GplwzZl39x7pgO36L2eyvwqHp/DWEa/TvmjGH+c0nMdTmY9dljmP87stzAv4tedvyB/FPLDeWXG3hMoOQsE3ISwmql1yQsNywgOs/lhgX0rMxyg7k5Xj/7YsK/FTC6xTN2c+Q3OiWnr005fUJODOvFAsvo1wr6PkHv6Bqm4hKi2xJRjXFbucYSepbnGpa6SWb6mVecuGpYx5kCoxYpU7d4xlVdE7KUnGvalHONkMOb+VdkvUWfkF8iWv6YRT/8dSiO/BVX+36saOTP28xCvdQvPxZZ7bn0t1//b19+4e47E+I3XfgZN0l1eOsaQd/mFZBvUqs9uMGSJrUxo1Z7cCbNqz0VVwXfVMR+iN8Q9LzaU3bVFPPWVsSy1R48ZBhry2cqZkyGnBiWWgEyerNNr6BXMcnoX5rFJPWDzcreQTzrChPjEb8Uglhzc3RXsg0/TQ3Bb3STGBN7ysbEephY5iqjYdU+lF14ox951cY9X7lU9rBrp2Ohbw6Eif6b5Pw1OfyM5WDbm0tyJutQRxE/ryoHsfhA5WQdHrGZf5t98CY+kIBJ7USxX6grMywPV2XY/urFCj4gmH6+AT5z6qbvPA7YvGQMl+ksqdVc7pfKruaqVT+12oCrrA/N1jJxxVHtyPDKz3FYpdkzO7+MPKOvumJ5kMbkk7Fi+ULy8Sp+/LaKfhz75T4+gbBZlEPF642UhzF2E+Vh/82/FIix7G6g43gaW/FXY8rbKA91qBWQExs31QrKOb9NOecLOZPZb6HMVnHq7RSn8PCailM3Zp/55MaDEKfeQXFK2TkR34uM601e0evRjf4JGNfzbpAq840RnVFGIIw0cWw1+p+h2FpxHitjK/e5aEOja1Nu4VVww6+TLiXlnR73q3Evlg+XFDMTF/htej6zxBFd7SMkYXzpMa+bnvUQ3a30fa3gCwI7zW/zQv3N3CtiKtsrYm1yUj2f6Zy2vKcXjOEyHesTe60Je0V+la3VeQjTv0vQbySsvH2+7gLy1KoDz7gVX/r9JsHjOaPyPIugRmMccSqOIucUjTiGXw9ttZPTEUedu1I/hKDaDo+M1G+wJZSHcmKvOiLWrU5Yado5hTWFNYU1hXUWsIrMPLGf4rM7GAd5Rlh2Ixz5Yxvul7Qp5xIhZ0DwVe2TGxGd1eoB263sDwEhP1+mmjfz/MpsLbPozNPot8LM82uzx+usZp4h6Fk+1oNhMG8f6GB5JcYXM9Mx8G/AD1uwXXl8EBuHpJ/tzCKfJceyK18oWkf/THVUgzxVR3xW1OhvgDr637Q6gPx8VjR2/gnlcTvszaHn1+ROt7VMP9z1i50lZ3l5Z2cvyJFXA3nfpjkR+h3uzIdQ2e/mKL/DOMN+p1a4VDyLxQu1UtcIE32YV3jUWUB1bjQh/t6g6wDfkUL6hqjzon7O9Wr0swvWq9lyMuoVbcX1qnbR1SumMT9A+8dWIPmVxlsEFtY112urtmx43LaWRuqV301hPblejb5ZsF7NlpNRr2grrlc1/lDnMWN+gP2D2UTtGNxOeep9mlj8Rj8oUudYP3nxe5Woc/WORK2AfnnnWDMRtrK4eXTkyK5saTFQii0Fpt/zjt/OFvyBeBN6xr99qcJnbEHdZOcdlOHwafRXC5PHwm+aihzRxuqejMVpw/c6ot0qrPFSUayZxaYyZ8FVQ5i4yoRqMX8grEQ8C0Efm469MRSLbspU6uwX0uPbDUh/Y6TnaLWHyZFPjdyxdzR6Vf7YWbF1OXKwR8M64x7N6G8v2KM5zXxkj4Y2KrIyGnujWb1tpFZL1QW/PDpFG/NbVq2aIZ81UH6qZlbKX2Ijs5h9lH+pn1NRZwVis2A8vxGC7ywYy8O+EKvbNLFt1AVmWN88asVzHbzyhG2J3ydQs56ivoCrHV/J2YNvhWv06gI69GGelRv9bhEDDFOdkYr5o7IFxnE+n4JDIH4jDvnwvIRhB6Jr0x9neK7KpKlqW41dtKhmWHmrOGhvPONxplb++AzbKfCzvJ+tLrqiZPQ/FPFdVYaY77ZaZeNYqi77P9M79BxbML7xjjHGNz5/hGcz+QxJ3k9JcuIxINqh6LnNWNwpGlPRlx4in8dpxZUkUw3h8Rn7PPIbnZLT16acPiEnhnWlwDJ6NYae5NfyTMULiW5LRDXGTegfP7+QnnULWkyqmmo5eodQrJqQP6+aMLzhbJwvocDhxlWEVXaTCfnz3upUuqeJj7AZ/UeysNvmK3tPFHk9peIxtScSwgshRI+pqQNH/MoeX07SDPH0Wx/YOOMzn7ju9CtnRV/diIXBqwR9m7+K+hOxYZV6ZY9f5yv6q6gVj3r/RBH7Ib46jsyv7LXzSs7GilhFXtmb7JjESwAfFcOyM62LDVt+uwN0saHQ73SALjZ8+v8iQ2fVH2DfyX0L6h473HCmDlGsblPOaiFnsg9RrCY5eRvn/23OGA+2dTXNSdPrsr+8SfmOuWN8f5FhqiXDvP49CfFxB+uHx+rVxVus31+Df/Kxei4zllPpjL/1EwgjTTwmMfrP05ik4nFzeazesIqMVyrKLbxzYfher9PeSfK4fNWO1fPiFFoFUfFZEsaXHvNabVDcTN+rHKuvODq5y7ziLpFpeXhkjiev+KIU1iYnNcHGF8rKHKvH+uDfI8cR1d0gm+v1TiHH9O8S9BsI607BZ7ZvJU9tpvAsRPGl318teDxfiGY7emDFrrCtuNhU+Je+DL8e2monpyNObJE4TVz2zUIXddSNZ91Vr2BNP29xxNrmiLXDEWudE1aadk5hTWGdw1hFXqrG/uC12d8zNaNUcq5oU84VQs6A4Kva9zUiOqur7NluRS9SUnbjzZO8Gd6Vc7XMojM8o/9hmOFdPXe8zmqGlyY1m8Z6MAzmbXOjdLraKEW78kapWsVE+vuyv7GjesoXitbRDVRHsWO9qA+fddsNdbQm+6yOhxe5VlPJ43ZY9Pi60d+S6dTq+PraHHlFf33X6G8HeWfg+Pqg8juMM0WOw6p4FosXakVMHRDi47BoYx6Xlj3aro7Dxo62G/024Q/cF7Fv5Omn7OZ8HPbOHDVmCf5AvAk9m5WDZTjpM1zkKHIcVp3b4xBxrzB5rMrSNHUc9gfuOOzNOWokgj8QViKehdD6OCz3KjETK1NVfZHigHDpWIRVI6zYSACrN3YcNrZHvjZHjnrBI03coxn9aMEezWkkJXs0tBH3aEVXToy+1ZEmbmqxFwfVzKZoMyx6HJZHat7HD9m/1MvG6nhXbFTtdPxweicfP1xHedgdbSI5RY+ttjquyDOrtS1w2SdvAyy1msxHCo3+3SIGGKba54/5o/JfdR2nOuLP8Q51jx3PNro2/bFf+SOWv8gsL3a2pWhbVS+L8lV22BdwP9nKb2L+iHuX/432XTF2zCeZZVcekJ+PSKOcvjbl9Ak5Maz5AivWFib5KKGpuJjotkRUY9yE/vHzxfSsW9BiUtV0a47eIRSrJuSPucNkLHgpOZe3KedyIWfCEZcs7LZ5K/UbY5tvbW70vjEhvBD0bCrvt75QL7WZVuRI4dcbWz+5/9lf+vexsBsbEqrfJbpc0JutcLG8hK3eoLomk62OFPJxQ+xeTAd1pLDikcc3FLEf4jcEPR8pLHujMOZtqohlRwrVLednKmbwkcKnYAjFR+fOlC52pPBPO0AXO1L42bOoi5JzRZtyrhBy1IZAkvPX5PAzlqN0brXo/3maPqi342KL/kb/GPy+4Rdp0V/ZOQm6/0r/4kEUbu8mD4/eqd/hY/2+Aj7FR+/upDJjOZXO+NukLDdNd+Xo8A3quyv2r/LoHU+DcJWY24k6IITPYu3E6M70YTA+soqHwXhqgv0Nv8F1L+T1UN5rIW8b5eFRTF7GxMRLmmij1Pe+uHAMl+kCySx7+Ewt+V0NnzHPdOVnXPfIHzuefGebcu4UctTSJ45XY4fRzD8rHvssvCPAr75UfMXn9I5A7A6h7yuW/VVjZp7uY17ekWeUc7WQU1avSfihupVEtzZHtUTgJvSPn6+kZ3nTWPt+Nt8AmIwm1mp4sHCelpn3AjL/bLfRb4HhwWL4zDs5iLU+jM9DO91B+qtzNH1hog0nIwQYfp10qRoCiu7HlztpnrfrnxAqPou1BN77Y35u3WVOmptctSapLsSK7XUxH9oiiGddgj7WIfWQ7t0RfsRAPvaYhJ5ja3uNkM0nTi7PWlU64HiOBrtKFtqj1akKpmEdjH416PBMzn5oLadc3Jq5g0ffuidH/q0QZa7NiWJByOfyYQ/Tm6PvraSD0b8MbBD7eTzURz1Lgv6Zl7zvrD9+xu/KF19D9Le3KDvXv9GvidR/j9DB9ApCf9ZB0SgdbhY6iKh548ihkzknHHgswVGOa4lrokfg5CWzRspj3svW4dbBcuy7sk5a8mwGOjY0279rNO90B5c1r0fpCjoNBK1bms7WgZ2eavKiB3awfFUP7OS10lZy2jywk9dpq2DB/IF4E/EsZGrPqD//+YU2fGasvFWzB7O/3EndCwHq2zmdZFcOJq+MqRmaWtUxerVyrjoltbG+sYBstCWHo00ldW11QId/j0zdOVRU17zfBpwsXW8Vura5elF6dY1XwnB1jX9NCFfXeJUMV9d2UB6urvGKnVpds7z7II9Xz4chj3cT74c8nu4+AHn8SsaDkHc7fOakVvqsvtL2/PFFY7hMh5/zYlHRwxcYe3i6vqEFbt5uGsYxbA9594u9IRLHvO8X41+0UG1d3ZuHvmPYjNnph9PU3Y6xw2l4z1mR364s6jcxf8QdJN5danVvJ/cTuBSlyvuK7HON6J+I+KOyYSyet7ofk30OT9lsozxVH8ofjW4y7g7F8rA/boe8bkHPttkh6PGOPD4ci6/lbqE8bMfcr2D58Q7fvxwcT4eHN5Ocv6YrP8s72Jkm3n3Z6igHse4iOdhesC38MsX5bZCn2sn12eca0X8SFkmepKVY5N9K/Jb3IWhn/2VJPj/foasOzao2wmMxVU6kf0VOOX8N9Pw0tIcQxteR6dVmu2uUbXfqtFGs3e0U9HjCx2zSIHqul7yYjD6ZF5N7Qzweckz+uFgMU33RNtJ9Q0ndVX/SKo68IYsjM0kHjmd5/YGqq4bg35aD1SX0x3bL9d4tZCt6PInQHSb6Ar8iafRPQV397hKNGXJ02Jyjc28OPZ+WMPo/Ef4SiwPo/zsI0+j/DDD5grBWmK/KwfxsZKyh2in2sdyu7xb0WF+mj/JTPgWAunO/uBPkM+3NJB/z0M9Zbojoq16WiOnL/Y3lfR36q89nn/sIr2Ss7o7V1Rqhb9G62hwpH2MZXy1M9MdYG0F7PD1PY/aUxPyq6NPVWOVuwP96zngkTTweSRPHZXUNDI5z1NhgC+lv/cSzoj1O3hg7+buyL4Ao28ReAImNyTGGq/5mkPLUXemJ0KFsX4pzvu2D43G3RnDTzxeSHq3GeNdmnzkOd2dvYag4rGwYs3mreY3po+LwDspTPnum/RHLz/4YK2uaipyMx3kd+6PqP5Q/8jgr5jdpivnjVijrbTS22yH0UTGa9Wk15uZ9DIuPvTn0HPONfiH4MY977hE6xPz4XkF/j9B5JumAvCwb2yXahF8WNvrzRbtU/m/1MhkvC6Pd2P9jNkoT2/S1gh5txVcd4br33ZSHceMeykP/u4t0UG22aNsw3tQOTYrV2wviJgJLxUmO1UZ/eSRWq/gS8/FW7dL0Ue1/J+WpWBV7Q2cyfBXLw74aG3OmiW2j4gW2cY7VGBt2UB76Kq+HYfm3g+6DBcYCsbpttfbK8UuNI1U/zHPUrRE5qJe6AGBrRM7iNuUsFnImcw0SZaqxDZen7FoI8vMa7zbH8iid+cR0mnBNdcP8MR72427By/2d0e+dP8a3Ofus9qrYb4r6Lr+NEltDShP/CIH/mDP0nO0xJ48rMY7zWQV17gF9D/tOowmk42TYC9tzkTmjihsx+2Kb4L1AtOVmykN/20pyWl08EhuH4F7zV2a11j/2e4at/IPfjlJjKzU+wJhr2IHoJmMMgOVhX4iNd9JUdk2RfQHHB9spD+ufx6Rq7KjiJddx3tiR96yM/tGSY8eY33iOHdU6/yTGkI72m9jYsazfcAzBeI59tPXfsTWyJIzvJ/Oun87bX+GzFgk974fnyPcSKjOPkRj7OqK3cvbm0Bsej0XeFVlL2N5Ch5eSDjta6LCddDD6nxI6xOyfptiYsC9MbIsl2k0tITzTB58hfj1o/2iGQilh+5k85Qdp4ras2hPm8VxGxUDVzhXWBkcsHFu2UV+lzzLyvALjGP8GKM6PUXdO3fQdy5P69acK/Gaj2uvA/Vz2se2Cd7vAPlvtYXs1edH2oOYAZdsD77Gf6+1hO+V1WntQ60rKRmlqhmKpSHupeCPOUNH2Yvhe7UX5nmovbd5I1EynYv1hYqxaAZ/VPgbWl1f94dj9bNff5mryovWn5iae9Ydtq0z9qbW/efAZ87A8sbU/5D9Ta3/zSE7e2t9nae1PzU1ja39G/yVY+/tcZO2P1/fUz82ouSO+H2LyLa/MmZdOPhccO6fOfbvX+tMf5qw/JYB7veDlto30O4QeRs9n4piGz6+dPpsDcyl+qVb5LOqVt57yjch6ymSfX0M783mwvDG9YYcwccxg5bO8Mv2CahNYHm4Tsb21NJXdi2e/V+9S5bWvNKlLcWO6bm5DV65HrCs+N2C06JdYHvbL0z6b+WKrcwNm88mo/9h6mrJpbD2tlU15ThM7UxBbT1Oxt+h6GsaQz1L/pc7sJ5SHMvFZ7KY6Psdnc5JBqH8+q7sJ9FRx/7YczLnCp2JlULf6Gf3WSJlRn5mkA/IqPnz/q0/IatqH78aT4ZmvTBOy+Jyt0S4BO21YonVJWJ8WKfaOTl+Y6NdlxrwJ4YWgx/SGXw8TbVFlTK/GwMrvrXwV54DLcEyPfoRj+rx3FvjcQN47RRfnvLeZ907Rquwzt7FVC8b4VuRghlB+vIb6DNF4LdYW09TuO31o89je/J2Up/ZcTQd1vgDpr80+85r+i6Ftxt5lcjpP+o+dvLfP760q/1J7++w3ee+mGB7flvtKqAN+lwnvieD9040ldS96Zh7bBrfjonOkWLtHvS/MPnO7XxvpW9V7WrG+tdWPcPB+PtqS3zVEvthZGKe5tdyXxfJwe/GOXTy3Vv6s3q3jex7y5sq9FHvVewNYt0V+dAj1uCD7zHcM7Iz419m8Y0DdPqz8y+ja9K/Zyr+wPOxfsbaUprLjWqvbIncMYCw0mQOEg/b+/u3RjfH6qH4SeS/OPnM/uS/iLzsiZUxT2T6K32Euer4o9o4Yn7XaKeyAej2Y/eU1o6MFxwtO55nWnO0zzfzOIc6x+Z0Ota6JNs077573TkfeGYgfiowX1H6waltFdFdxV7U3bFNvydqbmufzmHVrRCbzYt/Tm0OfN/98i7AXx7O898OWE6bRvz0SD1Sfegc8K/tOHp/tVe85xc6lT954Prz6bK/9c/8RuxMk73wW0qKcov6PPjRK/o/9+XqSGRvHMi/KyfP/vLsS3hPx/1bz8iZhGv2/Lbn2FfP/VmOE2Bgpdu49dieO0/j85rM9Pmf/j43PMf5ybFVj3qL+jz70AI238F4M5bND2We+C+YjJf0r9t5P0TFo7K4aFXt5fUaNXbke8/oZnqcY/ccKjrec7pqZc7bjOd81o8a3sfg5GXfNfKrg+gyvLW0sqXvR9oZtagP1Nzj35f5mY0Qm82K7zutvDI/7hj+J9DfqF4HQTk3CNPo/Kzlfj/U3rebrvB6k7gxSc/nYfN3pB2vnTvadgK3Wyri/UXdAqLZR5E7Aov6PPnR95v/t2fWR1yegi2F3C8oa/TWaL2c+WQf59rdWQI/PffJbf/6R21cfGCT+NFkdpXs2af1/gfwf16bMlup+RfPZbtJN8SWkA9N3CXrDHRB5NShDVRst/tiuP37lX33lr1rZqCr+W1fXBt9x1/q1k4X/x9P+4dlP/97DPzFZ+P+jb8PNXb/248smC/9nnr3jmjcuvPAbZXzUfGEm0Bqf7WM24HmJWFj42nbDr5MuJeWd3qdtkDwuX7WfVJkBn9kqiIrP8lqpaRZy6DhCpKnMT6pYzQ3S82YolGabV8wWmZY3B7BnUN5cyMPa5NQt9DedUy99mk4CBYFlMrE+5lDeLMibC7K5XhtCjunfJehnEVZD8JntW8nrFnwzCCOh5zhK6xaya0S/YOHzf1PbfnNBGFfOGWH8d/S/e0hH1auEnGdcDn7Tg+WmqS+0FQkGi0Yew68Hbe9mKJROR56ZJI/LVy3ycJ9vUmYRqtEgLSb01pBDp2r0NsHHyfgGcjDT1BcmemoJK/cXrVV7ViddqtZqN8nj8rFHs9emqREmegieo8zzHtVvTWFNYZXBsl7AaG/JeoG093hp9ln9JB/Hki6hS1dEF+TnNoJzIr4Hu0eUwfJ6I3nTInl9kbx6JK8fypBQ3nTg4/MUAwIzLdd7F46n41is/oYwMc6lietKjSaw9+F5JsapBmHNaoHFZyaQfxZhDbbA2kRYyD9IWLNbYPHaEPLPJqw5LbBeS1jIb7zm692Cb0DI4b4QR8ol+qbpRftCw6+TLlX7wrkkj8vH7Xye0IXfEUsTx715Qs48IWcKawrrbGHxbNfw1V+Tw89YDsYDnsViX4t72ocXjvEgX97vk92X/a0R/adhXDBK4wKMG6bjTKFzQp9VvMBnsTHDXCr/ZNmZ+/XEUQ7m8Z7ufMJCO6fpvuyv2Rlj6XziWwB5SIcrD/Ph+QIhW+EbRisffPNCXTblgyirRvT/D/jgWyJjU/ZB9M+E8hIqC9Ip/8Q6u4/oTe9eQY94NaJ/J6y88J6b8aOtUC9+v8no3w2YvOem4ptaiYj5ouq7lU3nE9YMgYXl4X1fZVNsnzOo/Eb/s8KmPB5DfjX3uJvycH9uJuX1Ql6D8qZB3izK64O8QcrDtf7ZlIdzDx5XTYc87icGIA99y+YeNbLD+7PnfUG3l2YolnjfIRZb0dbK9nXKQ3/tpTysl37KQz+YRnlYZ9MpD/cp+ygP69Ns3R+Kxb403Zf95dj34Uh7VvFajbuNfqGgxz7C6GeGiW14IeUhH8eBhSQXP5+XfUc7oF72O5A1ov9PYIfYmRrTq809+361Z38eEPCe/SLI6xb0XBeLBf0ioDGbqHtzObaqOI025dhqNuoV9IhXI/rfi8RWjM3nke5JSd3VPrhq89im3hwZm3L/Pi8ik3lRTm8oN27540j/rsbjqBf370b/mUg8ULaM9e8qfswX5VI2XUB5alyg2qfRTcbvbGL5uX3GypqmqrGyESa2H14HwrbB/q/Wm4r6P/qQzfeqnhP4qd+9bO03Nn7t/CrnBHAd1fhs3ID6lKjf/4L6W1JrWYZfJ11Kyju9llUneVw+fp+7v5q8jyfEj/IQs07ypleT1807q1w36T8b2/bm6MJjbqP/Nq1fDwieBuWliddfMK9bPOs6S1hq7oJ2tDpJ2+E3aNzMNm6GQmk1j/cNA7Er+sL2om3L8OuhLV8/3bamkzwuH89nBoQuqr52AV27dX+iQ7H2OWIddsQadcTytNeII9YRR6wDjljDjlieZTzaoXrtccTybI+e9bjXEcuzDR13xPKsR09fPemI5elfxxyxHnXE8vT7To05nmU85Yh1vyPWY45YnvbyHJt4+lenjgs9/b5Tx3K7HbEOOWJ5+n2njuU61e89xyae9Xgu9GmdOpbr1FjoOZbzjIWe9ehpL09f9Rx/PeCI1anjr/2OWJ5t27MNedrLsx/ybEOdanvP+OW5Ltepa0Oe/uU59u3UMaan7b36jvRz3QkrTdZ3zMzBxs9qb7QekZMInbuFHNzvHsie4V6R4fSFibYosQ9V+HfODL9OupSUl8TqB8vH+14zhC4Nkcd1FdunRDkKq+aIxWcv1F0Xat8vIX6kV/aaHsbOXGZvzN606/5jD68beThQqtH3m3JU3EZ0m3JU6xa4Cf3j5/wTR92CFrFnholV05ujdwA8de1tQ/DXInKSNuUkQs6A4OOmja5ToqmtKNq0Db8eJpa5StNWrqrsYmWvC10alJemh4GuSujFvIOOWCOOWMcdsYYdsfY4Yh11xDriiHXCEeuYI9ZuRyzPevS0l6ev7nXE8vTVfY5YnRonPNujp+071VcfccTy9AlPX/W016gjlmeM9hwDnHTE8uw7PNtQp/rXuRC/JqMfsrE8Xi2Cr70uWjReZg/kdRNvAjJrRP/2RWN8SxeNl52AbPvcR3hJKDWnWZUQXgh6DmX4ddKlpLzTc6guksfl4zlUt9ClQXlpegjoOK9bPIthHXXEesQR64gj1l5HrGFHrJOOWLsdsQ45Yo04YnVqPXr6qmd79NRrjyPWPkes445Ynj6x3xHL0yeOOWJ52sszfnnqdcIRy7MePfXq1L7Dsx49be/Ztj3LeMoR635HrMccsTzt1an9tmfbnoy+Vl1R1Edy1NynKyIH+XlehHxJ9rfN63ULX9duz+phYplLyIter6vswnuKyNugvDTxq71KTiLkJAIrppfj1rSpuJLo1uaolgjchP7x85X0TJkCsdWNT31ClqWYaRs5/GkaiMhRbm/LMP1BNz/ePi/b/JDf8s7ULblsV7WclKYHs798M9hPZktIeHNIt5CHWEVCS8Ut+8KncXjLvt3QorbsY6GlV+jC/pCme4GO87rFs5hvdTtiOXUFPWaPHpGpbMV2RL/aRHl4wwb+miqnbvqO5UnxP7VkDJfpWFf0MdNbtWU+FlO2LSN/Vw6Wuvk6TXdDPtJ/PGvLbdbppapO2V96K2IXbd+xm9u47fPxpWaIp503P/aZ//sDf3Np2XZk9NMEvTreY7aqePvMJQMgI5Bsy1PHwCwPY7DpkPI/uXi8ftMq6peE1vZDfBUfeehVtC4Gg+5nQpj61SIcbnbmrxal6Rb6PvWrRePpWB+sjxfqrxb1Cb6mffjyj//8Dzc+9O5faK586lu9t77zq6/75m09133uqcfO+50ffe7pZ36SdQ5CZ65H9YtCRVp1mngk03DEGhRYZhv8bYESPj+vaLQy/Hpoq42djlbqdxiwfFz2OUKXhsjjGKTuzFP3niqsLkesbkesmiNWjxNWmnZOYU1hTWFNYRXEsjzs7wcpD/tP/j2dyV6tm8TF8oGi/e7ZWiy38lW9czchfpSnFuB5dUH1meYbvTlYxlsj+kXZzLZBdGliv1YrfvjM7JM+m0d3CvPcRv0NIT7W400irJ8z7fc4/8BDixcs1jJxlRl578v+8srU/7V4jO+ixeN1xnrFlRWzgfKTNlehpquVlR7AtjJUwB5Qd1BjuXgcpt4DxRUZK2OD6NF2ypemQXnaiF9zYzsqaVlWk4/UII/9EsvDvy3xr8BHrsk+q3aA87m8uBNrN2b/vHvba6Sf0b8s0wnvbVf6zciRh/ZQcZHl3QDyvk3rBCpmtOm385TfYjxkv1UrdSp+Gr1aNVUvnjbCxDZQZIMc/WBtjq55/QmuuCP9baLOi/o516vRrytYr07xSNYr2qpIvarV7aL1yv0Q1mudsFrtwhWpV9SPxwlGvz1Sr6qPU30Q93E7C9ar2XIy6hVtVaRe1XihaL3yrifWK/8WqorRWNdF6hXLwzHa6HdF6rVqHN7dAXEYx5tcr6rNID3XayxuqziMdc73rfP6LcopG6NVvxyL0UY/Kuqc55QcF/L0U3ZLy2xz2mwXZfPoyJFd2TZKoBTb9kg/z8pRY67gDxEs5IkVCTeG2OQmqzfo5Xk2udGfEiZnE7I+RabYFZtM4Y04w/eaYhc996WmvNzMYtPholN5R1dN0y05aiSCP7TAsu94Bgurm0f1sZEA86b/LCIXHQkY/dsjPUZsZhbCxIiifr0aZ2s8u8cyDFIe8s3IkVN0hGL07y7Yk9mzyejJ0EbckxXdKTJ6tTKJu2M8QlE7K7GVyaLNPPZrTDhLyJspI27s3EnsWhmsNzUr7aG8vJW5ECZltDpQdnap2lJsdhnzHbRNI0z0k9iKHOululiME+wLqv3zylqaeLSNf40nhIltE+nwhjJLfP63H553C6xpxGf0vw4rMmlCPzV+POcSiC4h2pAjv4vo64JevZqd2udDi8d0Vnpy/4Vl7Rb0fA7P6P8TrFT9Z/rVSW6j9uwPInRJzl+lM+oTs1G3oDfZ/YLe8vBGNfR9pEF7IVYd8pH+98l3sL6NvyHk46pPyNE778Y4xuoWz9B3PrF4fBkqnl9O+sP4VQ37W+Rc4oevWfWyGTsufkOrX9urij/jk79559//86GLq/yan7qerai/5p19TdM92d82V/S71FnGUJw/KXLmteI5zu8WsRPi14Me0zVDoXR6esKxNq8PbfNXGf8lndLarxrnrbyj7VAOn2ftFjwYdxgj5V+1dHw5Kk7r/qVNH/z/1WoN7pR8kcZ/0yAvNn2uEf1XoP/5Mu2UcExIE865pol8+2727hK0+Jm/q9VBnsJaffXmlJV3hYz+GZizPLNAYxa9QsXovynmQYapfnkzNu6M/Xoh6qNu0p1OfGplPIhnqn4SokUd0nSP0Cnve13g5OnQJ3DUOw680q9Wl7Hd8Dha7Wxim8I+q83lpNLvtCSUh2XbBnScuuk76pxi/AmNGYPAUvbhdyc8+m573gPPWS6vJ/USLc+lUMd2xsM8vugROtj3aRH9E8JRJxNiVy1V1TcR+k7mSZM0bc/+ttnnLW51OmDRkjHcvD4vdjrA6JctGeNbmn1u1edZHo/b0rQDnnFM53EQYqSJl9EtRvYCPtL0UZmMfnlWDuzbVAwxrLTsF5M9+yAv1o/UiP4msOcKsifai6+D5jge4Hs/6IK0abonxwZXgR6XL8mXhfPUvDKmGFcv0XSoA9IxRtV+TY2vuO0WGV+pNai+iAyOx3l9t/nG9Bb56lfGg3jWJej7csobhOx6C1x1+kPF9zrlJSKPYw+Wt+g6LsatRZH2koTx5eqncvVFypUIPm7nqPu0iO7Kfhg/qq4h/Njnv/sXP37qvK9P1hrFK95z4q0D13zoVycL/4PT//TV//k9fa8tswZi9axOK7Fvqfcx03QX5CP9XVl9tLnGELg8Km7E5me8Fsr6b8rR/wjE73upXaj5iWozef1vT0FdjP5+6E9j+1t4MtJwLK+EzWtqTwPjGo93VbxVa9lG32puySdDMb4WOSWCNuUxjdmoN+j5Pe+nGv0BqAM+jaFis+Vh2Tkuqv0YtZZobSyleSu1q4rj22lqHGGJ7ynAMrI/YBktr590wjysS17vx6TmkFbWVOe3Fbj7QMUHbq9qXSU2XlTtzvA7rd2Z7zfCxHphfyvqw3njOSUP7YB9tflw3po8tmmccz1Oc4ReyFNrWhxPjf69ENt/gmI72pj9QcUJ1iWE+J53bC4/IPisXtq806AH6xf1xGeIr+6gqLJWr8amsbX6iuOEGvexKE/Vw6ygbarW83muqNZ7YvOkWDxR7Y/bplpHiL0ZEWt/uGZeZNyUdxYnbz3jA9C2fjsybsobG4Wg5wFMH4t9qKuyfT/lqbm/fZ4ekaP0iv36mdILYzLysuxWZSjaVzmNEXtUX4V1UuRtoNivoqlfZMMzJ9xG8JwTn+Yt2rf1U57q41v1bb+d00dhOdQJcXWUEvu3x9uc3778oncsXPz7hwcma/7ZU1v8s80P3beuzPxTxZUuwkU78Hp7mjZnf4vsc1fsOwvf3cZ9Z7v73EX7TjVe574A11n4jVG1BqPOLp0pLDU34bqsOE4oPA7iMwsVfSd6ZkH1b2p+xfNG7H/Y/u385EcnYmH7j42Pi9SrkqPG9JO9d8d7btMc5SDWFpLD69bqb1E56g5DtS+L87dnqG9U62HIm7cetnDpGN83l4ynMd2/BePQQOdosMwl2nJdzcktqbUP9ls1DlTnadk/cGzTR3n4GgyeheCk1lOMLpV3w9IxXKazhLYscicunzNNCI/Xjk+fW6T64r34ZiiW1NqxYb2QfKFKfR8rUN+qjmN3h/LcJjY3VWtyKlbmxTfEVzHpbsJHe8T2yFSZjRf33mOxi30f6RdD7FqxdLyOak6rYrA9b7WOHtvjNt4+wVeiHUxnf8ak/JnbgfolbY5tqh3ge1UcE/FVRJ7PYFJtxOxQJiZyPaqxjnpDlPtL9qtnYK0/TVXPECeAaTpZ2VEvvmcV2xO/L1PxTO1p26mzJTje4rU3o3/F0vE46gxM7L0LdXa+W8hV71lML4nVR1jT2sDCdQumn1ZRL4XF77WUeU/lyqxuzuQ+8000Vqg4Lzxr+8z3Qn+wlsZWZ3qfeX0mf2qf+eztM++AOjib+8yj1K7O1X3mMuPkqX3mifVyNveZR3P6o1b7zI/QeK7qPvM7Ibafotg+tc/8fJraZ57aZw6h/D7zE9C2fjkybpraZ54Yk6f2mcfof1D3mX85p4/CclTZZ7a+7/8Ao2qQKpRlBAA=",
-      "debug_symbols": "tb3Rruw4cmD7L/XsB5GMIBn+lcHA6PH0DBpodBtt+wIXhv/9JkOKWHlO3eTRztz10md1VZ1YkqiIlKgQ9V+//e8//6///L//8pe//Z+///tv//w//uu3//WPv/z1r3/5v//y17//65/+4y9//9vjn/7Xb8f6n1F+++f2T7+N+ts/6+OPdv4h5x96/tHPP8b5xzz/MP9jHucf5fzjjDLPKPOMMs8o84wyzyjzjDLPKHZGsTOKnVHsjGJnFDuj2BnFzih2RrEzSjmO689y/VmvP9v1p1x/6vVnv/4c15/z+vOKV6545YpXrnjlileueOWKV6545YpXrnjlilevePWKV6949YpXr3j1ilevePWKV6949YrXrnjtiteueO2K1x7xxvpTrz/79ee4/nzEK8cCu0COgEfI0hY8Ypb1H0sLkAAN6AEjYEWeC+wCPQJKQA1oARKgAT1gBERkXZHtAf0IKAEr8joAvQVIwCNydegBI2AG2AXjCCgBNaAFSEBEHhF5ROSVMnUdlpU0DittTigBNaAFSIAG9IAREJFnRLaIbBHZIrJFZIvIFpEtIltEtohsV+R6HAEloAa0gBXZFmhADxgBM8AuWHl2QgmoAS0gIpeIXCJyicglIpeIXCNyjcg1IteIXCNyjcg1IteIXCNyjcgtIreI3CJyi8gtIreI3CJyi8gtIreILBFZIrJEZInIEpElIktElogsEVkiskZkjcgakTUia0TWiKwRWSOyRmSNyD0i94jcI3KPyCsHW12gAT1gBMwAu2Dl4AkloAa0gIg8IvKIyCsHmy6YAXbBykE5FpSAGtACJEADesAImAF2gUVki8gWke2qG9UkQAN6wAiYAVdFascRUAJqQAuQAA1Y29wWjIAZYBesHDyhBNSAFiABGhCRS0QuEblE5JWDIgtKQA1oARKgAT1gBMwAu6BF5BaRW0ReOShjgQRowPpVLQtGwAywC1YOnlACakALkAANiMgSkSUiS0TWiKwRWSOyRmSNyBqRNSJrRNaIrBG5R+QekXtE7hG5R+QekXtE7hG5R+QekUdEHhF5ROQRkUdEHhF5ROQRkUdEHhF5RuQZkWdEnhF5RuQZkWdEnhF5RuQZkS0iW0S2iGwR2SKyRWSLyBaRLSLbFVmOI6AE1IAWIAEa0ANGwAyIyCUil4hcInKJyCUil4hcInKJyCUil4hcI3KNyDUi14hcI3KNyDUi14hcI3KNyC0it4jcInKLyC0it4gcOSiRgxI5KJGD4jnYFpSAGtACJEADesAImAF2gUZkjcgakTUia0TWiKwRWSOyRmSNyD0i94jcI3KPyD0i94jcI3KPyD0i94g8IvKIyCMij4g8IvKIyCMij4g8IvKIyDMiz4g8I/KMyDMiz4g8I/KMyDMiz4hsEdkiskVki8gWkS0iW0S2iGwR2a7IehwBJaAGtAAJ0IAeMAJmQEQuEblE5BKRS0QuEblE5BKRS0QuEblE5BqRa0SuEblG5BqRa0SuEblG5BqRa0RuEblF5BaRW0RuEblF5BaRW0RuEblF5MhBjRzUyEGNHNTIQY0c1MhBjRzUyEGNHNTIQY0c1MhBjRzUyEGNHNTIQY0c1MhBjRzUyEGNHNTIQY0c1MhBjRzUyEH1HJwLZoBd4DnoUAJqQAuQAA3oARF5ROQRkWdEnhF5RuQZkWdEnhF5RuQZkWdEnhHZIrJF5JWD/VjQAiRAA3rACJgBdkJfOXhCCagBLUACVuSyoAeMgBW5LbALVg6eUAJqQAuQAA3oASMgIpeIXCNyjcg1IteIXCNyjcg1IteIXCNyjcgtIreI3CJyi8gtIreI3CJyi8gtIreILBFZIrJE5JWDXRZIgAasyLpgBMyAFflxJvSVgyeUgBrQAiRAA3rACJgBEblH5B6Re0TuEblH5B6Re0TuEblH5B6RR0QeEXlE5BGRR0QeEXlE5BGRR0QeEXlG5BmRZ0SeEXlG5BmRZ0SeEXlG5BmRLSJbRLaIbBHZIrJFZIvIFpEtItsVeRxHQAmoAS1AAjSgB4yAGRCRS0QuEblE5BKRS0QuEblE5BKRS0QuEblG5BqRa0SuEblG5BqRa0SuEblG5BqRW0RuEblF5BaRW0RuEblF5BaRW0RuEVkiskRkicgSkSUiS0SWiCwRWSJy5OCIHByRgyNycEQOjsjBETk4IgdH5OCIHByRgyNycEQOjsjBETk4IgdH5OCIHByRgyNycEQOjsjBETk4IgdH5OCIHByRgyNycEQOjsjBETk4IgdH5OCIHByRgyNycEQOjsjBETk4IgdH5OCIHByRgyNycEQOjsjBETk4IgdH5OCIHByRgzNycEYOzsjBGTk4Iwdn5OCMHJyRgzNycEYOzsjBGTk4Iwdn5OCMHJyRgzNycEYOzpWDoyywC1YOnlACakALkAAN6AEjICLXiNwisudgX1ADWoAEaEAPGAEzwC7wHHSIyBKRJSJLRJaILBFZIrJEZInIGpE1ImtE1oisEVkjskZkjcgakTUi94jcI3KPyD0i94jcI3KPyD0i94jcI/KIyCMij4g8IvKIyCMij4g8IvKIyCMiz4g8I/KMyDMiz4g8I/KMyDMiz4g8I7JFZIvIFpEtIltEtohsEdkiskVkuyLbcQSUgBrQAiRAA3rACJgBEblE5BKRS0QuEblE5BKRS0QuEblE5BKRa0SuEblGZM/BtkACNGDloCwYATPALvAcdCgBNaAFSIAGROQWkVtEbhFZIrJEZInIEpElIktElogsEVkiskRkjcgakTUia0TWiKwRWSOyRmSNyBqRe0TuEblH5B6Re0TuEblH5B6Re0TuEXlE5BGRR0QeEXlE5BGRR0QeEXlE5BGRZ0SeEXlG5BmRZ0ReOTjWabNy8IQRsCLbArtg5eAJJaAGtAAJ0IAeMAIisl2RH0/fj6SSVJNakiRpUk8aSTMpHSUdJR0lHSUdJR0lHSUdJR0lHSUdNR01HTUdNR01HTUdNR01HTUdNR0tHS0dLR0tHS0dLR0tHS0dLR0tHZIOSYekQ9Ih6ZB0SDokHZIOSYemQ9Oh6dB0aDo0HZoOTYemQ9PR09HT0dPR09HT0dPR09HT0dPR0zHSMdIx0jHSMdIx0jHSMdIx0jHSMdMx0zHTMdMx0zHTMdMx0zHTMdNh6bB0WDosHZYOS4elw9Jh6cg8L5nnJfO8ZJ6XzPOSeV4yz0vmeck8L5nnJfO8ZJ6XzPOSeV4yz0vmeck8L5nnJfO8ZJ6XzPOSeV4yz0vmeck8L5nnJfO8ZJ6XzPOSeV4yz0vmeck8L5nnJfO8ZJ6XzPOSeV4yz0vmeck8L5nnJfO8ZJ6XzPOSeV4yz0vmeck8L5nnJfO8ZJ6XzPOSeV4yz0vmeck8L5nnJfO8ZJ6XzPOSeV4yz0vmeck8L5nnJfO8ZJ6XzPOSeV4yz0vmeck8L5nnJfO8ZJ6XzPOSeV4yz0vmeck8L5nnJfO8ZJ6XzPOSeV4yz0vmeck8L5nnJfO8ZJ6XzPOSeV4yz0vmeck8L5nnJfO8ZJ6XzPOaeV4zz2vmec08r5nnNfO8Zp7XzPOaeV4zz2vmec08r5nnNfO8Zp7XzPOaeV4zz2vmec08r5nnNfO8Zp7XzPOaeV4zz2vmec08r5nnNfO8Zp7XzPOaeV4zz2vmec08r5nnNfO8Zp7XzPOaeV4zz2vmec08r5nnNfO8Zp7XzPOaeV4zz2vmec08r5nn3iU0q5MkaVJPGkkzyYJWnl9UkmpSOno6ejp6Ono6ejp6OkY6RjpGOkY6RjpGOkY6RjpWns+zF9OCVp5ftBzdqSa1JEnSpJ40kmaSBa08vygdlg5Lh6XD0mHpsHRYOiwc3lR0UUmqSS1JkjSpJ42kmZSOko6SjpKOko6SjpKOko6SjpKOko6ajpqOmo6ajpqOmo6ajpqOmo6ajpaOlo6WjpaOlo6WjpaOlo6WjpYOSYekQ9Ih6ZB0SDokHZIOSYekQ9Oh6dB0aDo0HZoOz/PpNJJm0sNhZdHK84tKUk1qSZKkST1pJM2kdIx0jHSMdIx0jHSMdIx0jHSMdIx0zHTMdMx0zHTMdMx0zHTMdMx0zHRYOiwdlg5Lh6XD0mHpsHRYOiwc3rh0UUmqSS1JkjSpJ42kmZSOko6SjpKOko6SjpKOko6SjpKOko6ajpqOmo6ajpqOmo6ajpqOmo6ajpaOlo6WjpaOlo6WjpaOlo6WjpYOSYekQ9Ih6ZB0SDokHZIOSYekQ9Oh6dB0aDo0HZoOTYemQ9OReS6Z55J5LpnnknkumeeSeS6Z55J5LpnnknkumeeSeS6Z55J5LpnnknkumeeSeS6Z55J5LpnnknkumeeSeS6Z55J5LpnnknkumeeSeS6Z55J5LpnnknkumeeSeS6Z55J5Lpnnknmumeeaea6Z55p5rpnnmnmumeeaea6Z55p5rpnnmnmumeeaea6Z55p5rpnnmnmumeeaea6Z55p5rpnnmnmumeeaea6Z55p5rpnnmnmumeeaea6Z55p5rpnnmnmumeeaea6Z55p5rpnnmnmumeeaea6Z55p5rpnnmnmumeeaea6Z55p5rpnnmnmumeeaea6Z55p5rpnnmnmumeeaea6Z55p5rpnnmnmumeeaea6Z55p5rpnnmnmumeeaea6Z55p5rpnnmnmumeeaea6Z55p5rpnnmnmumeeaea6Z55p5rpnnmnmumeeaea6Z55p5rpnnmnmumeeaea6Z55p53jPPe+Z5zzzvmec987xnnvfM85553jPPe+Z5zzzvmec987xnnvfM85553jPPe+Z5zzzvmec987xnnvfM85553jPPe+Z5zzzvmec987xnnvfM85553jPPe+Z5zzzvmec987xnnvfM85553jPPe+Z5zzzvmec987xnnvfM85553jPPe+Z5zzzvmefetGXi1JIkSZN60kiaSRbkeX5SSUpHT0dPR09HT0dPR09HT8dIx0jHSMdIx0iH53l36kkjaSZZkOf5SSWpJrUkSUrHTMdMx0zHTIelw9Jh6bB0WDosHZYOS4elw8LhTV4XlaSa1JIkSZN60kiaSeko6SjpKOko6SjpKOko6SjpKOko6ajpqOmo6ajpqOmo6ajpqOmo6ajpaOlo6WjpaOlo6WjpaOlo6WjpaOmQdEg6JB2SDkmHpEPSIemQdEg6NB2aDk2HpkPToenQdGg6NB2ajp6Ono6ejp6Ono6eDs9zf6XV8/ykmWRBnucnlaSa1JIkSZPSMdIx0jHSMdMx0zHTMdMx0zHTMdMx0zHTMdNh6bB0WDosHZYOS4elw9Jh6bBweCPZRSWpJrUkSdKknjSSZlI6SjpKOko6SjpKOko6SjpKOko6SjpqOmo6ajpqOmo6ajpqOjzPzWkmWdDK88fjR8cCVrCBAirYwQFO0BIFm2ATbIJNsAk2wSbYBJtgU2yKTbEpNsWm2BSbYlNsiq1j69g6to6tY+vYOraOrWPr2Aa2gW1gG9gGtoFtYBvYBraBbWKb2Ca2iW1im9gmtoltYpvYDJthM2yGzbAZNsNm2Aybpc1b3gILWMEGCqhgBwc4QWwFW8FWsBVsBVvBVrAVbAVbwVaxVWwVW8VWsVVsFVvFVrFVbNQSo5YYtcSoJUYtMWqJUUuMWmLUEqOWGLXEqCVGLTFqiVFLjFpi1BKjlhi1xKglRi0xaolRS4xaYtQSo5YYtcSoJUYtMWqJUUuMWmLUEqOWGLXEqCVGLTFqiVFLjFpi1BKjlhi1xKglRi0xaolRS4xaYtQSo5YYtcSoJUYtMWqJUUuMWmLUEqOWGLXEqCVGLTFqiVFLjFpi1BKjlhi1xKglRi2xrCX1yFpSj6wl9chaUo+sJfXIWlKPrCX1yFpSj6wl9chaUo8DW8FWsBVsBVvBVrAVbAVbwVawVWwVW8VWsVVsFVvFVrFVbBVbw9awNWwNW8PWsDVsDVvD1rAJNsEm2ASbYBNsgk2wCTbBptgUm2JTbIpNsSk2xabYFFvH1rF1bB1bx9axdWwdW8fWsQ1sA9vANrANbAPbwDawDWwD28Q2sU1sE9vENrFNbBPbxDaxGTbDZtgMm2EzbIbNsBm2s5Y85mlqOWvJiQWsYAMFVLCDA5wgtrOWHI4FrGADBVSwgwOcoCVWbBVbxVaxVWwVW8VWsVVsFVvD1rA1bA1bw9awNWwNW8PWsAk2wSbYBJtgE2yCTbAJNsGm2BSbYlNsik2xKTbFptgUW8fWsXVsZy3pjgIq2MEBTtASz1pyYgEriG1gG9jOWmKOA5ygJZ615MQCVrCBAiqIbWKb2LyWFM83ryUXFnDZ1sJv1VsPAwVctrVsW/Xuw8ABTtACvQMxsIAVbKCACnZwgBPEVrAVbAVbwVawFWwFW8FWsBVsFVvFVrFVbBVbxVaxVWwVW8XWsDVsDVvD1rA1bA1bw9awNWyCTbAJNsEm2ASbYBNsgk2wKTbFptgUm2JTbIpNsSk2xdaxdWwdW8fWsXVsHVvH1rF1bAPbwDawDWwD28A2sA1sA9vANrFNbBPbxDaxTWwT28TmtaSKoyV6LXH0xr61PmP1xr7ii555F1/xZQW9jS+wgQIq2MEBTtASPS0uxNawNWwNW8PWsDVsDVvDJtgEm2ATbIJNsAk2wSbYBJtiU2yKTbEpNsWm2BSbYlNsHVvH1rF1bB1bx9axdWwdW8c2sA1sA9vA5mnRDkcFOzjACVqip0UrjgWsYAMFVLCDA5ygJRo2/4n1dQy9GTDQbc1RQAU7OMAJWqA3BT6uEx0LWEG3TUcBFVw2KY4DnKAl+k/shQVcNqmODRRQwQ4OcIKW6D+xFxYQm9cS8ePgteRCBf2YmaPHXdXKGwEfV7uOHsH/A68PFyrYwQFOcMXVdZ55Q2BgASvYQAEV7OAAJ4jN64P6AHh9uNBtvpteHy4UUMEODtBt6miJXh8uLGAFGyiggh0cIDavD+rD4vXhQrcNxwo2UMBl634cvD5cOMAJWqLXhwuXrfvJ5fXhwgYKqGAHBzhBS/T6cCE2rw/dT1qvDxcK6EfSTzmvDxeOQG8RDPQI4uhbNhx9c6ajJXpKX1jACq5gozoKqGAHBzjBZVtvv1fvCQwsYAUbKKCCHRzgBLH55cHw4+CXBxdW0G3qKKCCbvPD5+k//JB4+s/D0RI9/S8sYAUbuOJO30hP9AsnaInn0tsnlkTPwtXQX72JL9AVvr2eb9PPB8+3CydoiZ5vF5ZEzwvz7fW8uLCCDRRQwQ4OcIKWaNgMm2EzbIbNsPkv5Oqpqt5R97itdfQI4thAAT2COnZwgBO0RE+cCz1ud/QIw/ERofr8hLfNBVqiJ8N6Hl69cy6wgg0UUMG+gvke+1rXF7rNd97Xuz7RV7y+sC1sjh7Bj4OvaX2h7/F09Ai+m76y9YUFrKDH9ePgK1xfqKDb/Oj4OtcXThCbYlNsis3XvL5QciyU0VRGUxlNZTSV0fQcOofQf7POIfRV5s/B6oxmZzQ9h86xGIzmYDQHozkYzcFo+rrz57gNRtPXnj8HazCag9H09ebPIfT15c9xm4zmmW8+hL7K/HmgJsfXOL7G8fXV5s/BMkbTGE1f7/ocLGM0jdE0bJY2b4ILLGCOpneXVZ+v8vaywAquzSnFUUAFOzjACVqiJ8OFBVw2v4/1VrNAARXs4ADd5tvriXOiJ86FBVy2ejg2UMBlq75lnjgXDnDZ6rmEuiV64lxYQLc1R48rjh0c4AQ97hp57zerfk/mDWePuQDHCjZQQLf5Hns6XTjACS6b3zt5v1n1exxvOHvcGjsuhd/YeMtZ9Wt77zkL7OAAJ2iJ/hWHC5fNV3j31rPAZfN7HG8+C1SwgwOcoCV6vl1YwApiM2yGzbAZNsNmafNmtMACVrCBArqtOnZwgBO0RP8CxIUF9LjNUcEODnCCluhF4cICVrCB2Cq2iq1iq9gqtoatYWvYGraGrWFr2Bq2hq1hE2yCTbAJNsEm2ASbYBNsgk2xKTbFptgUm2JTbIpNsSm2jq1j69g6to6tY+vYOraOrWMb2Aa2gW1gG9gGtoFtYBvYBraJbWKb2Ca2iW1im9gmtoltYjNshs2wGTbDZtgMm2EzbJY2Ow6wgBVsoIAKdnCAE8RWsBVsBVvBRi0xaolRS4xaYtQSo5YYtcSoJUYtMWqJUUuMWmLUEqOW2FlL/DMfZy1xPGvJiTUqop0F5EQBFezgACeYRdfkAAuITbAJNsEm2ASbYBNsik2xKTbFptgUm2JTbIpNsXVsHVvH1rF1bB1bx9axdWwd28A2sA1sA9vANrANbAPbwDawTWwT28Q2sU1sE9vENrFNbBObYTNshs2wGTbDZtgMm2GzsLXjOMACVrCBAirYwQFOEFvBVrAVbAVbwVawFWwFW8FWsFVsFVvFVrFVbBVbxVaxVWwVW8PWsDVsDVvD1rA1bA3bWUumoyWeteTEZVtTzM070QIb6DZzVLCDA5ygJXotWav1N+9EC6yg23x7vZZcqGAHBzjBZdPz60kHWEC3dccGCqigxx0Lz0/J+YE6PyZ3YgNXhO4HyuvDhR1c27tmm5t3lwVaoteHC5et+w55fbiwgQJ6XD98nvNr/rd5x1hgBX17XXF+yOpEBTs4wAlaoHeM1bUyffOOscAKNlBABTs4wAlaYsFWsBVsBVvBVrB5zq91Wpv3htU1O968NyywgBVsoIAKdnCAE8TWsDVsDVvD1rA1bA1bw9awNWyCTbAJNsEm2ASbYBNsgk2wKTbFptgUm2JTbIpNsSk2xdaxdWwdW8fWsXVsHVvH1rF1bAPbwDawDWwD28A2sA1sA9vANrFNbBPbxDaxTWwT28Q2sU1shs2wGTbDZtgMm2EzbIbN0nZ+jvLCAlawgQIq2MEBThBbwVawFWwFW8FWsBVsBVvBRi2p1JJKLanUkkotqdSSSi2p1JLzI5brUVw7P2N5oSWeteTEAlawgQIq2MFlWwvAt/PTlhda4llLzLGAFWyggAp2cIATtETFpti8lqxHfO388OWFAo5Erw/rOWQ7P255oUfw4+v14UIBFezgANf2Tj8kXh9O9PpwYQGXbbrY68OFAi7b9O31+nDhAN0mjpbo9eHCArpNHd3m2+uVYPoYeyW4cIKW6JVgPVNrvmxdNd8LrwTmm+OVwNzmleBCBTu4bOab45XgQgs8P4p5oduGoyumoyvM8aFo6xFJ86Xr2nrW0XztusAJWuJK/8ACVrAt9G1Y6R/Y4zTyDrfACVqi5/yFBaxgAwVUEFvFVrFVbA1b8x3yY9Yq2EDfIT+STcEODnCCligHWMAKNhCbYFs539aXqZs3vgVO0BJXzgcWsIINFFBBbIpNsSm2jq1j675vfsqdVwrdsYMDnKAlnlcKJxawgg0UENvANrANbAPbxDaxTWwT28Q2sU1sE9vENrEZNsNm2AybYTNshs2wGTZLmxwHWMAKNlBABTs4wAliK9gKtoKtYCvYCjbuL6RgK9gKtoqtYqvYKraKrWKr2Cq2iq1ia9gatoatYWvYGraGrWFr2Bo2wSbYBJtgE2yCTbAJNsEm2BSbYlNsik2xKTbFptgUm2Lr2Dq2jq1j69ioJUItEWqJUEuEWiLUEqGWCLVEqCVCLRFqiVBLhFoi1BKhlgi1RKglQi0RaolQS4RaItQSoZYItUSoJUItEWqJUEuEWiLUEqGWCLVEqCVCLRFqiVJLlFqi1BKllii1RKklSi1RaolSS5RaotQSpZYotUSpJUotUWqJUkuUWqLUEqWWKLVEqSVKLVFqiVJLlFqi1BKllii1RKklSi1RaolSS5RaotQSpZYotUSpJUotUWqJUkuUWqLUEqWWKLVEqSVKLVFqiVJLlFqi1BKllii1RKklSi1RaolSS5RaotQSpZYotUSpJUotUWqJUkuUWqLUEqWWKLXEW/3a6nFp3uoXWMAKNlBABTs4wAlim9gmtoltYpvYJraJbWKb2M5asi6F9awlJ7qtOlawgQIq2MEBuk0cLdDX7wt0mzpWsIFua44KdtDH7Qw2QUssB1jACjZQQAU76LO36+7AmxADfS+6YwUbKKCCHRygH7PpaIntAN1mjhVsoNt8y/y+5cIO+sz0GWyCluhV48ICVrCBAirYwbUXqzGreWtiYAHXXqzGrOatiYECrr1Y3VjNWxMD1zGrfhL4HcqFluh3KNXHze9QLqxgAwVUsINu83OyT9ASvT5cWMAKelugB/Mme/PhPhsWT5ygJfpVxYUFrGADvd3Qx3gq2MEBzqtbs/WzmdjxbCY+sYAVbKCACnYwR97bGAMLmCPvy/kFCpgj7yv6BebI+5p+gTnyvqrfOW6+rF9gBRsooIIdzJH31f0Cc+S9AzOwgBXMkfdey3Pkz17L48QJ5sifvZYXFrCCDcyRP3stL+zgAHPkvdfyQjnAAlawgQIq2EE/Or5lZ86fWMAK+lj4Xztz/kQFOziu9vQ2znbkEy3RX7e5sIAVbKCACvoYT0dLPLP7xAJWsIECKtjBAWIb2Ca2iW1im9j817/5pvuv/4UdHOAELXHlfGueOP7rf2EFGyiggh0c4AQt0BssA90mjhVsoNu6o9vMsYMDnKAleiW4sIAVbOCyrQbW5m2Xgcu2mjybt10GTtASvRKIb7pXggsr2EABFezgAN2mjpbo1wTiR8evCS6sYAMFdMVwHOAELdEnMC9cCm9k8F7LwAYKqGAHl80ffXuvZaAleqm4sIAVbKCACnYQm18eeHuD91pe6JcHF7rNz0m/PLiwgW7zo+6XB97e4L2WzS8BvdcycIKW6AXkwgL6hLaTJvWkkTSTLMgz2C+xvNkxsIB+vebUkiRJk3rSuMgbGtt6Ka5562LzFgxvXWznv9eknuRnk9NMsiDPxJNKUk1ySXEUcFm8S8M7FgNHoiec37h4F2Lzq3TvQgz0suHkAXxDPbMunKAlemZdWOKQtJrUkiRJk3qS5UH0lDkPoqeM3156d2Gg7+pw7KBv6XR8bKlXA28uPGklzEUlqSa1JI/oG+IJMHxDVgJ4bnur4EU1af1t37R18l+kST1pJM0kl/gQ+nl/4Rp3f4zoLYKBDVyb6Q9nvO2vDd94/zG8cG2nH1r/LTwPjP8WXiiggh72/GsDnKDlAfdMurCA2AybYTNshs2wGTYLm3jXX2ABwybH0UABFezgOE918aY/P33Fm/4uLAdYwJrov1PDN8GT6UIB/TmlU08aSTPJgvwS9qSSVJNakiSlo6WjpaOlo6XDf6PGiQWs4NqZ9UBZvAUvcB3E4UfOE+7CAU7QEv036sICLtt6iizeghco4LKtZ9biLXiBA1y26ePgKXqi/0Zd6BeCTjWpJUmSJvUkj9gXeuZNH07PvOnb75esFyrYwbWl68m2ePNdoCV6ll5YQH8c6LRk5kfes/RCBZfM/Pz1LL1wgi7zY+FZeqHLfNc8Sy9s4KpevgkrSS/qSSNpJtlF3ovX1h2NeNddW4/Vxbvu2nqsLt51FzhBS1xJJ+u5u3jXXWAFGyjg2tTm1JNG0trU6mRB65fwopJUk1qSS05UsIOW2HwzXdkauCL4Vq5cvagn+QFVxwlaovgR8WMqBXSVH15poG+sH0hxl4+KuMxtK11lTSWK99QFWqL/Ql5YwAo2UEC3+faq27qj23x71W2+kf7jWXwj/dfzwgYKqGAHR+LwwfPdHBVsoIAKdnAk+s9l9QM1/a/5qE4FOzjAx76pD/VKuZNWxl1UkmpSS5IkTepJIykdFg7vbLuoJNWkliRJmtSTRtJMSkdJR0lHSUdJR0nHSrZ1GyHeqHbSSraLSlJNakmSpEk9aSSlo6ajpaOlo6WjpaOlo6WjpaOlo6WjpUPSIemQdEg6JB2eGP6764uHybrQFW8bE6/z3jYmzf/bdem3WuPFW7ouqkmPSN3/yjp5LxpB64dD/MfLe7ECBfQKKY5rbz3mOokvmkkW5OfwSSWpJrUkSdKkdFg4vP9K1q2PeNOVrIkK8aardUci3nN1UU8aSTPJgtbZeVFJqkktKR0lHSUdJR0lHSUdNR01HevcXfdL4s1WF0nScvhurnP3ohHU/CgMRz8Kfmz8R2JNq4j3TgV2cIATtET/nbiwgBVsIDbBJtj8d8J/09t5H3WiJZ53UicWsIINFFDBDmJTbIqtY/NPfvsg+Ce/T2pJkqRJPckjrlzz/ijxX3jvj/JLRm+PukiTHn/bL0m9N+qimWRB/pHfk0qS7/iJvosecU7QEs130TPCCljBBgqoYAcHOEEL9FanwAK6bTo2UMBlW5NT4q1Ogcvm5c5bnWTNEYm3Osla6Um81SmwgMumLvaLuguXbU32iLc6iZcOb3WSNTMg52pex/nfTtASz8V3TyxgBf2u3De9+i24b7pfx3l6e/tSYAHX9nqGe/tSoIAKdtDjrjH2liTpvg2ejH776i1JgQp2cIATtERPxgsL6DY/fJ6MFwroNj+onowXDnCCyzb8mJ3TICcWcB1fv9Y7V+i6UMD1yMCvC88Vui4c4AQt8VzY8sQ1mn4NKbmwpUgubCnekiTDR9Ov9S7s4EicB7iOzvCT1jP2Qr+HXeR3TyeVpFXtfatWBl7Uk0bSTLKLvDfoopJUk1qSb4w6KtjBNT4+1eDNQBd6tl3o4zMdK9jAtRsnaVJPGkkzyYL8h/GkklSTWlI6ajpqOmo6ajpqOlo6WjpaOlo6WjpaOlo6WjpaOlo6/IfTZz685Sewgut4+SSIt/wEKriGZPXPi7f8BK7R8UkEb/m50HP1wgJW0G0+fJ6rF7rNt9dzdfqWea76zIG3/ARaoueqzxd4y09gBddP50mSpEk9aSTNIL9KXQ8BxRt4xKcdvIFHVke+eANP4AAn6Fvqu+35eGEBK9jAtakeYF3VnoPkt2Y+3+DtO3r4/vtl7YXrutbv0719Rw8P4Fe2F65LW/+F8PYd9Vtqb98JHOeXzaXHF7jkXOnLBedKXxcquC6E/ZbcW28CJ2iJfrN1YQEr6HcY1VFABUdsWHxwS3p8cEvOD2h6IP/g1kk1yYOro4AK+l3SGWmAfp/kh+W8GXM878ZO9B/h4ljBBgqoYAcHOEFLzO9bSBdsgk2wCTbBJtgEm2ATbIpNsSk2xabY1I/kdOzgAP1I+lioJfYDXCeFT1V4V05gAwVcNp/L8K4c9amKfq5JL44TtMT1c6urKUS8Kyewgg0UUMEODnCCljixTWwT27km/YkCKtjBAU7QEs/vW5xYwApiM2x+U1v96Phd7YUDnKAFegdPYAEr2EAB3aaOHRyJXiQu9AjD0SNMRwU7OEDfXnO0RJ+jubCAFWyggAp2cIDYKraGrWFr2Bo2n7Hx2RLv1Qn0GaziOMAJ+sh7hLM+nFjACjZQQI+7Ese7ctSfFnlXjvpMinflBDZQQN/e7tjBAU7QEj3n/U7cu3ICK9hAARVcNr9j9hXQAidoiZ7zFxawgg0UUEFsnvN+j+29OoGW6Dnv8/Leq6N+f+y9OoFu8xN8Cug2Pzo+f3XhACdoif5Tf2EBK9hAAbEZNsNm2Cxt3qsTWMAKNlBABTs4wAliK9gKtoKtYCvYCraCrWAr2Aq2iq1iq9gqtoqtYqvYvD6s5+bivTqBluj14cKVsV4cz+92XthAARXs4AAnaIk+h+tTHN6Ko2v1EPFWnMC1vT7b4a04gZbo9eHCAlawgSuuz5d4e811SDp77Dl/YQUbuI6vT7N4e01gBwfIaHZsg9EcjOZgNAejORjNM+d9G86cP5HRHIym5/y5DZ7zFxYQ28Q2sZHzk5yf5Pwk5+fk3DGOpHEkjSPpOX9ug3EkjSNJzk9yfpLzk5w3ct7IeSPnjZy3M+eHo4IdHOAE/UiukuldQYF+JMWxgg0U0PfNg3nOXzjACVqi5/yFBayg26ajgHmCe+uQ+sSdtw4FWqIn+oV5anjvUGADBVSwgwPMwfK2oguFwRIGSxgsYbBEQAU7uOL6PKI3FgUWcMX12UXvLdLuW+aXBxcq2MEBTtASvVRcWECP66eGF4ULOzhAj+unhheFE70oXFhAv+zwv+ZF4UIBFezgACdoiedlvjo2UEDfCz/Unv4X+l74eebpf6Elevr7rKW3JAVWcNl81tJbkgIV7OAAJ2gXqrckBRawgg3s5wSCeu/RRTNpPUuYi1aSX1SSPGJzbKCAvv3i2MEBrhmB4mRBPiNwUkmqSS1JkjSpJ42kdNR0tHS0dLR0tHS0dLR0tHS0dLR0tHRIOiQdkg5Jh+f0mjxV72cK7KAfr+E4QR9vHwfP9AsL6I9FfZA90y90mzkq2EF/NlodJ+hPYH17PdMvLKDbfFD9ouBCfwzrp5Ln/4X+INb3wvP/wgmug+gBVvpfVJJqUkuSJI/oR8B/4qfvlf/Emx8Bz/ELGyjg2lLz3fYcv3CAE7REz3HzEfMcv7CCDRRQQbf5IfIcv3CCFugLjwUWsIINFFDBDrptOE7QEv0nfk3JqbdA9TWPqN4CFbimvdecknoLVKD3B1THDg5wgpbos/gXFrCCDRQQW8VWsVVsFVvD1rA1bA1bw9awNWwNW8PWsAk2wSbYBJtgE2yCTbAJNsGm2BSbYlO3NUcBFeygPxcTxwla4vl5uRMLWMEGCqig74Xj8O1Vxwr69vpJOwRUsIMDnKAlTo/rJ/jk+E72eA5wgpZofnynYwEr2EBG07AZo2mMpjGalqPpzVWBBayxOd5fFSiggh10mzlOcNlWi556m1VgASu4bMWDec5fqGAHBzhBS/Scv9Bt4lhBicHyRqy+5v/VO7ECBzhBiwGo7QALWMEGCqhgDlYl0SuJXkn0SqJXEr2S6JVEryS6rwrW10MK9VXBAi3RU7r4cfCULr5lntIXNlBABTs4wAlaYve4fmr0Bgqo4Ipb/dRYP+uBE7TEkT/N3lgWWMEGCqhgBwc4E9dPvl9leiPaRS1pPa/zA+rP607qSb79fjZ64l9oiSvx/erM+9AuqknrUFX3eNZfqGA/nxGqt6JdNJPsIm9Pu6gk1aSWJEma1JNG0kxKR0lHSUdJR0lHSUdJR0lHSUdJR0mHZ/e6g9KzY+3CCrbrUal601qgH7Hu2MEB+jPL6miJfv/uVyC+QFhgBf1Zqkfw+/cL3TYcOzjAdV90GixopflFJakmtSSP6HvlyVz9uHgyr2cH6i1rgRVsoDcMejBP5gs7OMAJetfgOmm9ZS2wgOty2g/AyvCLJEmTetJImkkW5JfsJ5WkdIx0jHSMdIx0jHSMdIx0zHRM3xFxrGADBVSwgwOcoB82H3b/kb+wgG7zk9fT/UIB3ebD7D/yF45Ab3gLXK9TdCdNWn9pPZRQ72YLnKAl+m/1hQX0ltDh2EABFXTbdBzgBN3mW+vZfGEBl23NJqsv3BUooILehFocvQvVt9d/oNfkoHqPW2AFG+hx/UB53qrvheet+uZ43na3+Q/0hZboP9AXes+Tb47/QF/YQAG9t8q313+ru2+O/1avjjr1JrjefXM8vX2exZvgAivYQAEV7OCyDd8GT+8TOyfRmdMnVrCBAiroCt8h/9m+cIJrh/xX0zvfAgtYwQYKqGAHBzhBbBObp7n/NvtiXIENFFDBDg5wgpboaX4hNsNm2AybYTNsnuZ+MXC21vmczdlbd2EFG+hxp6OCHRygX5iYY/6ieKddYAEr2EABFeygHx1Hz/kLC1hBb3w7HAVUsIPjas1S77ALtETvdr2wgBVsoIDeVFccJ2iJnvMXFrCCvr3V0SN4XE9pn9HyXrnAAnoEH25P6Qv9OHRHBTvo2+sj7yl9oSV6dl9YwAo20G1+anh2X9jBAU7QEv1lj+E773l8HgfP4ws5Op7HfqHtfXSBE7REz+ML1174NJv30QU2UMBl87k176QLHOCy+ayfd9Jd6Hl8odt8LDyPL2yg23zkPY/9msIXwuo+8eX9dd0vRn0hrEAL9CWvus+Med9doIAKrqtlny/zDrvz5PIOu8ACVlDAcTVuqzfTBVqiv0K4Hkqo99MFVrCBAirYwQHOxJWQw6+jvXcusIECrjsFvyj33rnAAU7Qrr539d65wAJWsIECKtjBkXi+ISKOBfS98OOrDRRQQd+L868NcIKWuJI3sID+QoMPlr9feKGACnZwgBO0RE/eCwvoe3Gigh0coO+Fj/GwxHmABYx3VdT74QIFVLCDA5ygJfo9tM/yeOdboIAKdnCAfsnqZBd539tFJakmtSS/qHTSpJ40kmaSBfkts08Tebfb8Pk073YLHKC/LXX+t5bouXthASvYQAEV7OAAsVVsDVvD1rA1bA1bw+a561OB3td24crdwAKuo7Pe91XvawsUUMEODnCClqhuq44FrGAD3dYcFezgAGcO1pnRjmdGn1jACjZQQM6HzvnQfS/8vBsHWEDfCz+5hu9FdxRQwQ76XgzHCVqiZ/SFy+Yzct7tNqofKJ8lu1BABTs4wAlaos+UXVhAbJ7nPgvk3W6BCnZwgBO0QO92Cyyg26bjsvmEine7BSrYwQFO0BJ96uzCAlYQm0+f+YyLd7sFdnCAE7TEeoAFrKDbuqOACnZwgBO0xHaAbjPHCjZQQAU7OMAJ+jzzIr8uP6kk1aSWJEkroviR9Rog/k+9Blzolcy3319fuVBABTs4wAla4vly9Ik+m1wd/fUPHwXP9gs7OMAJWqLXgAt9L8Sxgg0U0G1+lnsNuHCAE7RErwEXFtBtvm/nTPlwFFDBDg5wgpZjYYyQMUJeAy5soIAKdnAEep+br3Oh3ucWWEGPa44Crrh6RujgANde6BnBEj3bL/RJf3GsYAMFVNBtw3GAE7REz/YLC1jBBnrc6bjOVL9W9Ya14ZNh3rAWKKA/+TgcO7i2zJPMG9YCLdF/4bsfB/+Fv7CCDRRQwQ66zbfXf+EvtETP7gsLWMGWe+y/5X4p5w1rgRO0RP8t90s3b1gLrGAD5Vo4Rr2NLbCDA5ygJfoSWhcW0I9Od1SwgwP0vfDh9jw+0fP4wgLWa4EgPVfWulBABTs4wAlaomds9033jL1QQN8LP7k8Yy8c4NoLn8/0hjXH7g1rY81ndm9YC6zgsq2Zie5raAUq2MEBTtASPY/X1Gb3XrbACjZQQAX7tZxZ9741X5ate+Oarw/WvXMtsIINFFDBDo5rLbF+nOvbnWiJ5/p2J7rNj6SvHHlhAwVUsIMDnKAlnstF+m56dp8779l9oYIdHOAELdGz+9xjz+4LK9hAf0jim+NLcV3YwQFO0BJ9Ka4LC1hB34vu2MEB+l74Ufff7hP9t/tC34vpWEHfCz98nvMXKrhs07fBc/7CCVqi5/yFBazgsk1PHP/tvlDBDg5wgn7MfISMkTdG3hh5Y+SNkTdG3hh5y5EvR458OQpYwQbmyJ9reF3YwQFOMEe+lAMsYI68d5fNNbXZvbssUEBN9NN++l74aX9hBwc4QUv00376vvlpf2EFGyiggh0c4AQtsWPzn7o1+dy9LyuwgW4bjgp20G3m6E/6/fB5MqyJ1O6fiRxrPr57D1dgBRsooILeVeAKT4YLJ2iJngwXFrCCDRRQQWwT28Q2sRk2w2bYDJthM2yGzbBZ2ryza67Z0+6dXYEtcf0kzXV5273XKnD1ca+roO69VoETtMT1QxVYwAo2UEAF3SaOblPHCVpiO8ACVrCBAirYQWwNW8Mm2ASbYBNsgk2wCTbBJtgEm2JTbIpNsSk29bgr33ytrblmLrt/ovE6CXoFG+hn1HRUsIMDnKAlDredWEDfXlf4wkMXCri2d03kdf/s4ix+IvqiQhf69vpezJanxhRQQc6d6XH9/F35FmiJxplqnKnGmWrYDJthM2y+VoKj90HNcqIl+jsOJ3qKrLm37g1LgRVc4jXh1r1hKVDBJV6zbN0blgJdPB0t0VPkQreZYwUbKKCCHRygNywdjpZ4tiydWMAKNlBijJvkSevrb50j5M1MF3oyXFjACjZQwCwr3swUOMAJWmRLI3G8mSmwgg0UUMEOjkQ/7atvma+4dWEHBzhBS/QUubCAFWwgtoltYpvYJraJzbAZNsPmKVJ9CD1FLlSwgwOcoAV6z1JgASvYQAEV7OAAJ4itYCvYCraCrWAr2Aq2gq1gK9gqtoqtYqvYKraKrWKr2Cq2iq1ha9gatoatYWvYGraGrWFr2ASbYBNsgk2wCTbBJtgEm2BTbIpNsSk2xabYFJtiU2yKrWPr2Dq2jq1j69g6to6tY+vYBraBbWAb2Aa2gW1gG9gGtoFtYpvYJraJbWKb2Ca2iW1im9gMm2EzbNQSoZYItUSoJUItEWqJUEuUWqLUEqWWKLVEqSVKLVFqiVJLlFqi1BKllii1RKklSi1RaolSS5RaotQSpZYotUSpJUotUWqJUkuUWqLUEqWWKLVEqSVKLVFqiVJLlFqi1BKllii1RKklSi1RaolSS5RaotQSpZYotUSpJUotUWqJUkuUWqLUEqWWKLVEqSVKLVFqiVJLlFqi1BKllii1RKklSi1RaolSS5RaotQSpZYotUSpJUotUWqJUkuUWqLUEj1rSXN0mzh2cIATtMSzlpxYwAo2UEBsZy0ZjgOcoNvWBbKeteTEArrNHBso4LKtzvXubViBA5ygBfrqZ4EFrGADBVSwgwOcILaCrWAr2Aq2gq1gK9gKtoKtYKvYKraKrWKr2Cq2iq1iq9gqtoatYWvYGraGrWFr2Bq2hq1hE2yCTbAJNsEm2ASbYBNsgk2xKTbFptgUm2JTbIpNsSm2jq1j69g6to6tY+vYOraOrWMb2Aa2gW1gG9gGtoFtYBvYBraZedzP+jAdOzjACVriWR9OLGAFGyggNsNm2AybpW0cB1jACjZQQAU7OMAJYivYCraCrWAr2Aq2gq1gK9gKtoqtYqvYKraKrWKr2Cq2iq1ia9gatoatYWvYGraGrWFr2Bo2wSbYBJtgE2yCTbAJNsEm2BSbYlNsik2xKTbFptgUm2Lr2Dq2jq1j69g6to6tY+vYOraBbWAb2Aa2gW1gG9gGtoHtrA/rEsV7zAILWMEGCqigV6PuOMAJum1dl3iPWWABfdPNsYMDnKAFzrNUnOjBpmMFG7g2fXUhdW8hm6t/p3sLWeAAJ2iJXiouLGAFGyggNi8Vq2mnewtZ4AQt0UvFhQWsYAMFzB+JyaXE5FLCW8im+CHxUnGil4oLC1jBBgqoYAcHiK1hE2yCTbAJNsEm2ASbYPP6oL6bXh8uLGAFGyjgUqgPlteHCwc4QUv0+nBhASvYQAGxeX1YrUfd+88CJ+g2H2OvDxe6zTPA68OFy+YPS73/LHDZVl9Q9/6zwAFO0BK9PlxYwAo2UEBsE9vENrFNbIbNsBk2w2bYDJthM2yGzdLmXWmBBaxgAwVUsIMDnCC2gq1gK9gKtoKtYCvYCraCrWCr2LyArCau7l1pgQ0U0G3i2MEBTtASvYBcWMAKNlBAbA1bw9awNWyCTbAJNsHmpWI1h3XvVZurR6t7r1qgRxiOFWyggAp2cIAz0dN/NVt1b0W7xsIT/TzUnugXTtASPdG9Y8lb0QIr2EBOGBLdSHQj0Y1ENxLdSHSbnDCTE2ZywkxOmDPRfRvORD9xgNhIdCPRjUQ3Et1IdCPR7Ux0FxtH0jiSxpE8E/2xDeM4DrCAYRtHJvo4MtHHkYk+jkz0cWSijyMTfZwLsC3xOFdgu7CAFWy5DWein6ggtoKtYMtEH0cm+jhqAdm3yr5loo+jKtjBAU5w2VZ72fBmtsBlGx7XE/3CBgq4bKudaHgzW+AAJ2iJnugXFrCCblNHAfuVesP72ubqCBve1xZoiV4JLuTU0AoyWMpgKYOlHRwgg6UMVmewOoPVGazOYHVOxM6J2Dk1vFSsZrbhfW2BBfQD5cfBS8XwLfNScaGCHRzgBC3RS8WFJdAbs2y1ew9vzAoUUBc2xw4OcIKW6EsAXljACjZQQGwNm6/wtxryhzeH2WqnH94RFv/UN6c7+uYMR0vUAyxgBRsooG/OdOzgAN3mR3KdMLbWXxjeEWbqh2+dMLauU4d3hF2b7kuBXMgO+XIf1eP6eh8n+oIfFxawgg0UUMEODtBtvum+8kfzTfelPy4sYAWXrfm+rR+UQAU7OMAJWqIdoAfzA2X+13zkzf/bNca+PJettT+GN3EFVrCBHfQI69TwJbcCPcJwdPF09P92HRJv4gosoA/h4dhAATXjntly/tMBTtASPVt8j72JK7CCDWTffIXMc4d8icwL2WM/wYv/NT/Bix9JP8EvVLCDA1xxi9v8VC4e10/lCxsooIIe1w+Jr2xz4QQt0c/1CwtYQbf5YPm5fqGCHRzgBC3Rz/ULXeFj7Cf4hQIq2MEBTtAS/QS/sIDYDJtnQPXzwRTs4AAnaIG+ntV51H1Bq8AKNtD/2ko9X47KVjfL8PWoAgVU0DdHHAc4QUv0HLqwgBVsoNuao4IdHOAELdFz6MKa++aJsx6ODW/iChy5Q544F1qiry57oW+6HzNfX/bCBvqmD0cFOxGwCTbBptj81+lChkUZFmVYlGFRbIrC71CmHxK/7Jh+qP2yY/qm+2XHhRVsoIAKdnCAE7TEic0vO6YfHb9DubCBAirYwQFO0BL9DuVCbIbNsPkdyvTzwe9QLuzgACdogWe71oUFrGADBVTQ464SdDZbrc7vcTZbXahgBwc4QUv0+4sLC1jBpVgd5ePssFpLfoyzw+rCAU5wKVYb+Tg7rC4sYAUbKKCCHRzgBLEJNsEm2ASbYPPpx7VayTg7rC50hQ+A3z6sdUnG2UB1YQM92HBUsIMDnKAl+u3DhQWsYANR+Llufmr4uW4+bn6un+jn+oUFrOCqGmtBlOGNQ3b4cPuvyIUTtEBvHApc1Wh1wA9vHApsoIAKdnCAbmuOlugXZRcWsIINFFBBV4jjBC3Rf4cuLGAFGyiggh3EVrH579DqPh/eLRRYwAo2UEDNo946OMAcLG/7sdUrPLzBx1Zr7fAGn0BL9N+WC31zzLGCDRRQwQ4OcIJuW2eqN/gEFrCCDRRQwZH7dl4jrvNXz6vBE2vukF8NXiiggn6p5sfsvBo8cYJ+qean53k1eGLJCBPbxDaxTWx+YXghwzIZlsmwGMNi2M6MHf/93//021///q9/+o+//P1v//If//jzn3/75//Kf/Dvv/3z//iv3/7tT//489/+47d//tt//vWv//Tb//Onv/6n/0f//m9/+pv/+R9/+sfj3z4O2J//9r8ffz4C/p+//PXPi/77n/jbx+u/+pgZWPcb/tcfPEeGMPshRnkdw1fJ8QjSe/79UX/4+/X13/d35PzvP37C8+8/7ojv70Rbd7jXTjx+Cl/thLyOYXkUSsu/Lu3uX2++ysO5E48Hu+xFlR9C9E2IpnkYlADzuBvAV5T2AL0RoP20BXNzHP3jyedReBTZlyFsN5Y1j0Mf7WWI3aH06ZXrQEx5eSjL5pR83KHXK8bj/GYzHvNGP8aon47HdkcsduRxDdle78gmhvq6tR5jrfOVMfqPW7Fu3V+PqmVyPH4RXobYnFn+3q5HeDxiZj/6vB3Bn++fEXp5HeHubozXu7E7mL6g2nkwx2GvQtRNqan+DeDzxFIpL0OUTw9F3ZyZj9muPLvLQcmVn0pu22zEmoI/N8LG643YFcxa40g8kLPicR98f0fKmkS7dkTLyx3ZnFh1xpA+JkNeBdhnmPU8KZ5q/88jOj8versYj7uriPG4eXr9A9KObf2umSJPR+Pxu/5jjM3Z6R+POX9EDn2KMO6fGKJ5YuhTlv18YrTN6Wn+HZ0rhnGGP2Yffoyx2Y7KT/Jj6pAY/Qtjklkiz5Xzd2OyOT8fE/B5ZTHl6Xek/nhpshLhZYzV5x1BVnMbUVr5Mcr8hrPDPj079vtieZny4N5e7ovsft/LoAJOzrHHFPuPMeqn58f2LL1ZArcxbmaL6OfZIv3jo7Eb2cekZJwdj0dU5fVZKrtaWkZe/T2eWD2N7E8XkLb7kW5xR1Hl6Tf2Mcf4Qwzd1FLxdbuvu5qnM+znGNvt8G8lXhcLttmOzVm63ibPq/qnnPs5xldGpr8cGZWPrzp0dw03/Bsw14Y8prleb8juPqfWkofkuaT+HGNzSB6nZw5vebqO+9IBuXf1ovbh1ctuP9ZXr+LqpUh773i2vFla78O+jNHr7ioqfyrXWrXvxRh5v7SWuXwvhr9yf8aY9XWM7U+2z6ae43rM8fInu28vS1smy+yvf/b7bmxr3givj9087ctxP8bscZ6v5fJex7DPLxzG8emFw7Z2zOPpSuo5334e21E/3Y79yI6YF3g87JX3zg5/QHnF2JwdY3c8rOXp8eCnC6n+he3IG/vWniZ8frcd2wu6vPlZ16ZPMX46O+Z29qzl7Nnz/egXYoivTXtW9Pl0lv4cY37DDdQsf+yZrozsI3+Pl2f63FxYljJzS8qjpMmL82N+fAvVt5OaeSn2eAZf3sqWxxP7GJXHU/jjZYw5/thseVxr5K9132T+3F4SzjhLa//hNv/H7bDNWTpbqTkdN/WtGOYf4jlvGUbfxKifZ4u1T7NlX3/4WbB5vMx722Rc7dTj+fwM4qcY27ODmdrHJNDx3pneuR4ctb6MYfPjxwj9XjW22l9uRTm2z2R6bEd5/LY8BRlfCOINmnEldmyC1N2prlGCrI+npxo/3VGWY3ebnj/69vQb96gp96u6taJUoOfryp+qejn004TZHtVauZGTshua8Xnyl2N+ujPbetrz4WEdJi/rWCn70ywPyPF0kfzzo4XdEyd+o+R4PaFedg+cHre1+WyhjufppJ+DbH/2j8KjzOPpZ+rn2aD9yWqVqmq6OVl3z2xqG/lr91yN6u+CfDwztd8OyTnH+nwF8bvt2KaNlMlszqYYle0EKvfJj/m+zYPJbzhf6+fna/2O87V+y/m6f4ij+RCn95eP5WR7+5BdDLMfrx/W7h5GPe6huNo9jtfVaBukMQP6w0/474LMzx/6Vvv4qe8uxM3Hvrf3ZPPc9+4hlaO/Oy7HyCBl81Ozeyh1t8WiNP38eeN+d0bOUD1uzHa7s7kKmLXGCf9AfV3O9kHyUnFW29TEZp+f8HJ8fMLvQtw84W/vyeaE3x7SduS4tPbuuPSc356zbJpods+migoz/s9NMPML+SslL50fmbepqzK+4QyZn58h8+Mz5PaevFkSH8dR8pB2e31ItX5+SLV9fEh3Ie42F9U/+pA+naWjvPcr8/ibsSFSj9247O6r7naNfUNB7Z8X1P55QdVvKKj7I/rpBaYWms8eZ/PrC8y+qabdP3F83jHPsSnJu/kdYx7ieP65nV86HoPjMd88pvfa8UrfPuo/OnMZ8jLGOD4/00f5+EwfH/cF3t+TzZm+PaL+WaU4ov29GFppfGjt9RHdnKWP22PNO+Vub8bIpw/bGPsz7FbHp5ftT8+Oz++kZvm4X6HM+mHDwn4r7rWRlN1zqXvdq2XuKmlp2UTyfEm5HlK9GUTfDCJ5X9mf3134fZD58bhs9yXnLtaXXd7cl5pzdesLHu8Gycn2/nw/+LUgLe871ocHXgfZPZ16zAfmhdTip8H5qT1vG+Zun+Avglg+xmjF3gzCU9DHQ9D+ZpCbLYtl95jqbs9iMft4ani7HTQM2Xy6LPv9dtwN8jR5+MUg+UPzwP5ekMdFZl6oPnjswmz7r7Ow2fOFxBdPtsnJ9pzHXwvSjSCbBLz/G/7yfqjunlWNbKQa4/Wv1v6a+d6bBrtHVXdvD/dBJPdFxMomyL59Op+ZD9nsTfv4yrvupv7vXVttQ9x8I2f7kOrmKzllfHpVU8u2e1pyZvhxRF/+6t0flbEZle3ZkY+H65jyVozGuf74wRvvxjg+jtG4uHquY1+LkYP7CPc6RtWP74h+EePWHdF+X4STTPr8PMab51irxgOZ+Xpst69MddpURt1l3W5DBo1ho78uha1+Prj7GN8wuKOwL5vE3T2fKkc+9i+POdF3D2pe77a5Oct2TzDuPeSu27emTHNfbLy+O9tuhzAx/PzC0+8Ox+43W/NxneimcXAfhNcvZIz+ZhAd+eRAd1cPUj9/DlpFPn8Out2d53nZuumErLu3p+7vzvijd6fO+NHU5/eFfr879uG17n4zep6uOnRznaq7hSWyz1Xq05tgPx8O/fglv/1WZITn5P39VuyaSyrJW59m3vr9EOXwtYuvG7s55b0gNp/m/p+aS74SZHXpZHk/nubOvnJQ8/3Nx8Xm5qDaHxricSBZOOSY+npX7DtGxr5jZOwbRmabuSOvqtYXfd/7jfhhTrPJu0Fynml9m+rNICOvifqu0X0fpOdpsr7Y8DrIL16juvcbsXvC8y2/EeuDDrk7fbM7uzepHo9cG7eJJvbOyTZ63p6NbnOzJfL5TMT4fJGUOj5eJWUb4uZMxO49qLszEduHTfdmInavUt2eibg9Kpu7xP3ZcW8mYhfj7kzEL2IcH8e4eaM57z4T1feO6d0ZkX2MezMiu+7/uzfN+xj3bpq3+yJHnh/Pj/B+jmH1j96OezMzt2O8mXN3Z2asf8PMzOzfcIL0P3hg7s2qtO3LUHdnVfYbcmtWpe1eqLo3q9J2r1PdnVXZbsfNWZVfXMQMLsoej91eXMS0o2+DZCl78NP7g18IcvMW8Rc7c3M7NuWwW3YOr6WGN5e6m5mMvDN7Wgnxp7UUf3UjU3l3+Wj25t2QPL1Z0l/dDbVfvU5155ZqG+Q7bv9vHxH5jiMyvuOIjE+PyC+edD/tzHE8P6T+2gPzo/WnMK87AOoh3/HcfRumz3w9fH3L7NUgb0NwW/Z43lzeCzHYCns5Ovv2m4PFSI+3u4nsae2jTQ/P/lWIXEBptudbzC+9CiH5+z2lvQ7Sdi9DraWX8opGXl5ItPZ5r2prH/eqbkPcu0+9vyevrzP3R9TyPqSYtddH4/Mnor/YjlsvZLbPn1W1tq9lOREimxcy2+fPqraH4zEFcTAFMd86pLXwtm3ZXDHL5xeq8h0XqvLxheov3sXKwzH7Uwvh79/F2j2TudWzv1/+9la7fZPPX01t8nFD9TbEzRJ2e0/Gewf0Xrf9NsS9Zvu2uzK8eZ/8ixg3uw8+nkGV/eXcvY7d/drG93pttzFuttpuFwe92Zx6O8amN3Uf415ramvfcoW8O6o3G1Pbt3R1t29oTG3tj92bu+dq+4a28O0itDfP1dsxNufqPsa9c3X70vLtc7V9Q//z/fXmX19KbZ9L3erm2C2tVzJfHpcyz21DP62DvV3jr7HeQJOXE23bEHK0/99p9h9D7B5L3ZyK2R2MI0+Nn97y/elgzG9of2q7Ff7uPgve3YXdPKRld5Oe9+g/NOmM+xHySqxLfx1hdy+puRdFn9ZN+93S5tv7UVpBtLbXMeb2RvDeMoPt47mxX6wXn8tyPLi9Xma5Wf04Y7ch7p1e9nHvVNu/G5cXyLO8nBW3j89x+/gcn99wjs/Pz3HZL8p37xzfrt9fsxG1PpgN+Xn9/l0MzWNaVV/H2K+M/vRQbZTnF2p+XrP+kE8zZR/iVqbI54+QvnA4yutl3/ZL+AvdEipPAyNvxpifx3hu3fzKpwRazwmPNl4vvy/bVvbJIrhT+ibI5te+8uS2zqdJta8FmcUyyPObqF8MwpZU/YYg7XgZRLeLziuLzg97b3CEMiI65rsjPLMAPC+1/P4XJ+StIyLG64E2N0Nz9wscc5M2u2X9bnahSd1W1YMuo6d1aH+/IZtbufVRybj70ecFQn/6xdsulcbTn/bDM/Gf7o7rbnr/oL4fzxO4P8eY++e39en5rb7em+1hVRZ9f3pA//vDug1iTx1gr0+S/ddAbn+WZBtFD6Lo5hsYsr1ZHzSCPw/xI4l+2JLdhfvTmwLSXv92br/n0XIVBm327nc0soXjgfpeDMv1wdWeHiV9bWRGFoEy5nG8GWU+rSA39fUxGfXTK/hthFtX8PsV+e2pc8Laq8f7ItvpvlzK1urr68R9iDxPrfZX90P7LxQM9mSO+WbmTsuHWg/e3KbK9rWpexff2xD3Lr53F4r3Lr6/cDh2H0f6RZRBFJV3o6gRZWzui3YL890cmm2Ie0Oz25lvGZrnwzHt7aHpRLE366Ed/FRZqa/r+3Yd+XsFcR/iVkXc7wvvkhbr8vqISK+fTvBsQzx+qw6ac0aR94Jwe/Xgqm8GyZU51+/dW/XZBk+4bFeft8umf9cq8DWvFR9zM88XnO8GeRrjrwXR/FR51aen/l8K8tiFLGrHD/dH9z8xVgsL0tf2+gNQMtrnDxFkfMM71Nu9oSO0HrLbm0+fUvVveH16+7k06tFPl85f+OTaED5j98Nnyn6a29y+PnXvl3N+/GhHdo+p7v1y7g9GzlrpbLY5GLt+VMl5ni6zbYLs+vz4jmY5Xt44bzdD8/rs8VDleHNfNL9G85i90reDPL0Za28HybdA+5ufBrz7ecHdK603b82OTy9Etu/m3ny4sn+/9+bDFfuGr/ptv4QnOYcgz6/Gl99tyOd3Vfb5XZV9fFe1PRjKWmfP07s/Hww9yqcHYx/i1sHQo/2hB6MLa1n0sjkY+vnB0M8PxsdPybefObP8aZLjzQ95Pp5cGzFefypNy/H5dZxuvz918+pn9y5ML7yzoZvNaN+xL99wTbr/dlzJ4S1Vnr+l99P96W5Zv6f3nJ8muUf/wmZ0y9dYf/yu0Bc+YXf3V2H/HTwq4Vp8laP6u+/gbT+md0Ta2fNFw1eDZNtjf26//MoX+Z7fZTueP/L+0zf5frElk28D2ru7M1pcF9p4akT4WpDJgZ1PleTnILp7UPUtQX5486JtPna4DVKzs7XW52PypSAtF9apz0sE/H6Iv+FjKbu1X+9Ols1Pr1H3e3LzIvUXh+PeVaq2b7hK3X/F7t7rcNo+/6aPto+/6bMNce9dkvt7svsAzbYz69brcCqfL0Ox/zBgf/rI8XxuSf/K1wWZRnlgeS/I3Tfi9luijR7s/v53Dmfn2f3Tohi/e115H0ZZdelxys+3w+SBWSE3y4Rvj0wzDu/z782XDq/kN22qPP8G/y7IdqnAW6/YbVvt7721uI9x761F3U3e33trUbVvn6vcemtxux13D+l2aPOS8zHK7d3MKXQzl9Lk3VO+CplT+9sJWPNh0wq5yZzt5cDTBF5794oi3/N/Kkr1S5/GHk+ftX5uF/v5erF/Ph/QP58P6OMPDXFzUYr9Ac22mcexlZcHdI6P78J3n5K6fRe+a3i5PaOwW9/P8jZgPC829vNqMrsYc+Qzmcdj+PJWDCvZn2nPi6/9HENH//RE329GNrxZ3ayKu41RuWWtZptdsT90Vxqlo9nrxTl1lj90MySXTTU9dpvxcZvKPsS98jM/blOx7WzGU/XZrHW6+97KvVvdbYRbd7pWP7/R3ca4e59r5Rvuc8s33Ofa5x9KUfv4QynbEDfvc2/vyeY+t3zDfe5urvvufW75jvvc8h33ueU77nPLd9znlu+5zy3fc59bvuc+t3zHfW75jvvc8vl9bvmG+9zy+X1u3z6xunWf27en/c373P4dh/Q77nPL99znlu+5zy3fcp+7vRa4dZu7v5q4c5c79NP7qV6/4X6q12+4n9qugNDzBaD2fER/foC/bQIo2YEk7Xkd2a/EkOyHlh/eL/8pxnYphlHzYzTzeN2MMD9efGB+vPjA/IbFB+Y3LD7Q2zdcrW77j/qk43ceLwdlF6Pa88do63sxZl4mtqO+3o6+fUx1N213za23p0G2LcO5eGs7tG72ZrsAwM0PLuy7ofiK1Hj9EXrPitdXrLe+t9ClfHxD03ePqu7d0GxD3Luh6buPUN1807Xv1hu6972FvvsC1d3vLdwflbEZle3Zcet7C9sYN7+38KsYx8cx7n1voevdB6r63jG9+b2FX8S49b2Frp9/gfIXMW7deO/35d73FrrOP3o7bn1v4X6MN3Pu5vcW+va9o5vfW/jFyX7zBKl/8MDc+95C3/V23v3ewi825Nb3FnqfH98ob3vT794o9/npjfKvrmFufW+hf8d3DrZBbvYP/2Jnbm7H9tJwPq0t8eZd0K277P1d0K277OPTbdi/xXHrefb+/T4mZPVpQvZrLwl23jTs1t4MMvMznPV5If8vvmn4dNtQX++ObB/j3nxdcRvk3ncJ9iFufZfgFyFufZdgOy58DnBNvL85uD8EkXeDVIK01+PS7eMHqPsQt55cdmt/aIibvRf7A0q38Bjz3VHJclyHvVtBnrfk7SAzL6Ue+HYQPkywDbJ9z/9mr5J+Wtt/sWpJxrDa31z4JC9xrY6Xr9bVj3/l6qdHYr+8T75uoON51uIry/uwpo4+f/b2a0sE5cT6A99cZmgOtuPd5Y5mjuoj3LvLHT3dc8jbx2MS4/W4bJeQ0vn0bfX6DTHeW4ZKmPSU50nPL8VgRQ0Zm3NsH4N7nzlexxhl1+BvefEyj+P1WzGj7N5E7dlBJv3p88w/Pw371ZaM3JLN+zlj9zBKe15IaX+aUGr3t2OyAP48+thsR9tOv8Zhffxo6ibI7lW/fAf9+bn6+u707VPE8lZfdivzjN2bRrdPkTq+4RT5xZbcPEXs41Nktx23T5FffGnq3inS6h95iuiRTxr1h/VJfj5F2u7zJjVX89f6/FP10+DuHkg9ZiRyyYXxvMDX/MK+ZMOjlqNu9mV8w77MP3ZfmKJ/4Hu/dtqyaUmb9PdiVLajjm+IMY839yWblfT5Ux5f2w4WXGnH28fUOKb6ZgwhRt8syrldJTxf8a1Vn2+Rf1pdRD7+7sQ+xK3726HHHxri3i3y9ng2lr9q4/WK6WO3IN+9dXR2WyHcYovNzVbo5xVs95bUzQq2X4O+0jJZ9eW+7GMo3+/qr4+H7N6Gv7sY/jbIzVm+bYh7s3z7EHdm+bYfW7h1l77/XMOdu/T28Zx8+3hOfv8Zo7ufyP1FlJtfyG3jW76Quw1z7xzdh7h1jv4ixJ1zdP95uJsfh9rG+PwTZPfPkV99Uu3mOdK/5xzpn58j/fNzpH98jnz+sc2x/9DUrT6rMfc3+nEnuOmz2oa412d1f09e90l8/q3Nzz+1OebdvpPdiMyP2yzub8frGLe/TfeyC2fYxz182xA3zy37vIdv2Mc9fMN2y/eIskLT8fpTjmO36p5p9s6Z2usKOnZvRz2ejmTpGU9L7vcvHFP/nvF1TJ9uV346pnO3eFZ9biR+PSp9/8N071uf+5G5+Uu7D3Lza5/7IDXvOB4o7wa5983QXxyTex8N3Z+tN78aej/I5rOhvwhy77uh2yD3L2B+cWjvXRx+/uHQuXsH6NaSzL84HnevLn8V5ubl5dy96XV/dLZh7l1e7kPcurz8RYgPLy/LPPgaQX1+F+DHmfW5exh174di+y5vXsoUe/4+009bsQ1huQ1HLW+FmPkr8dMK5j8fi2943WTWb3jdZJf6lfak2udmZ3bNjY8psczcPvRVt8SvgmTz2YPt1Ssrs20vAiynTkt5fYbM7btRj8nTvH2ozzOwZneP6+NhdL709vzJui+cZzLy4yyPEJuh2T2Jun2e7R5F3T3Pfjm+42l8X9bC/ddqv+MkYUX02p8fe/zuwNr2NoA3ozePK38RpHLd2zdBdnPCd58Cz+1SfreeAm+34+5T4Cny+VPguZuFvPcUeF8DCn2bpTy/FvBTDZi7b0Xlufr06TxptwtAzzdXpD8vm/PTm+Jz962pmyuKTD0+nhiaWj69ed+GuHfzfn9PXk8M7Y/ovRVF5je82PSL7aBf8yjj9XbsVkK79brI3L0bdXdhk32QmwubbIPcXdhkvyU3FzbZB6mFh9G7Len71VEyyuLXazz8KszNRVZ+EebuIiu/CnNzkZX9Ab65yMo+yM1FVrYZdO9Fp20i31xkZR/j3iIrc/v2x71isP3M1M13x7bbcfOQ7of23iIrvzhX7y6y8oswdxdZ+VWYm4usHB9PXs/d+hP3Jq/ndi2/my+gb1cVYmGB8tzEIPqFEHnvW54fm38lBO9/1adZ+N9da26/NlXpfjreDJHv9Pani+av7MjzGvxPX8D4SoieE5E/vgv3hRCjMEO0Oxb2Rwcpnfvm/vyC0JeCjOx/KsPqm0Hs4BOe9b2Rqbkzj8uR93KlZU/a40wp720Frzk+dxt+IYRMfhqev3ZZbs/LPMp4jmuR+c5GlNL5sPp8K9tKy3x94HtboZWJHRnvhejcDE17b0c4OVt9b0canzBt+taOjLwRGtLfCWDCwrDv7cSR7YGPn9XX54TtFun+/Oy2gyWD3zsQeWrb0A+P5HsB7nWubs/qfKWpPM/u/fwhmG3x59vL/elDlF8JMbNRszyP5VdC2OBLqUd5J8RjfjGr9vG0+tJXtoIHe+szxe+FML5VXt7akUehZX0Ne28rWl6qFTnkrRDytIbD8+TkTyFs9yrUN/yGtZy/Lm28dzDkyD15fsDx7vF8L0SrPFeoz1MBs98PkQsUtudV0t8N8XTD+aUQ+Uva6tC3QrS8GXnQ8VYIyae87YeWoK9sRc8R+eHUejfEe4PKTER7vjz60rFgOQxp7w2qNBZbauO9EIW1p/TNQe2s+dLf2or1+ILbEHkrxNPH6udzY9RPIWz3jOkxacFXFvtT5Ztf+FWt/Krqe3uSL14+JtDneyE6zRDvJUmZOeX3uL8rb+4IU21H/ThEeXcrBiHeyvbH7znHQsbHW/HzoP7Px//907/+5R//8te//+uf/uMvf//bvz/+5n+vYP/4y5/+11//fP3f//Off/vXp3/7H//vv8W/+V//+Mtf//qX//sv//aPv//rn//3f/7jzyvS+ne/Hdf//I9xPOajx+OO8n/+029l/f91pTAev++P/9/83z9S8PEf+b9ff6GvpTh6qcf6B/431j94/M/4n/+9Nvn/Aw=="
+      "debug_symbols": "tb3RruU4cqb7LnXtC5GMIBl+lcHA6PH0DBpodBtt+wAHht/9LIYU8a3MOoupvdaum9pfZeb+f4lkhCgqRP3Xb//7z//rP//vv/zlb//n7//+2z//j//67X/94y9//etf/u+//PXv//qn//jL3//2+NP/+u1Y/xnlt39u//TbqL/9sz5+tPOHnD/0/NHPH+P8Mc8f5j/mcf4o549TZZ4q81SZp8o8VeapMk+VearYqWKnip0qdqrYqWKnip0qdqrYqWKnSjmO62e5ftbrZ7t+yvVTr5/9+jmun/P6eemVS69ceuXSK5deufTKpVcuvXLplUuvXHr10quXXr306qVXL7166dVLr1569dKrl1679Nql1y69dum1h95YP/X62a+f4/r50CvHArtAjoCHZGkLHppl/WNpARKgAT1gBCzlucAu0COgBNSAFiABGtADRkAo61K2B/QjoAQs5dUAvQVIwEO5OvSAETAD7IJxBJSAGtACJCCURyiPUF4hU1ezrKBxWGFzQgmoAS1AAjSgB4yAUJ6hbKFsoWyhbKFsoWyhbKFsoWyhbJdyPY6AElADWsBStgUa0ANGwAywC1acnVACakALCOUSyiWUSyiXUC6hXEO5hnIN5RrKNZRrKNdQrqFcQ7mGcgvlFsotlFsot1BuodxCuYVyC+UWyhLKEsoSyhLKEsoSyhLKEsoSyhLKGsoayhrKGsoayhrKGsoayhrKGso9lHso91DuobxisNUFGtADRsAMsAtWDJ5QAmpACwjlEcojlFcMNl0wA+yCFYNyLCgBNaAFSIAG9IARMAPsAgtlC2ULZbvyRjUJ0IAeMAJmwJWR2nEElIAa0AIkQAPWMbcFI2AG2AUrBk8oATWgBUiABoRyCeUSyiWUVwyKLCgBNaAFSIAG9IARMAPsghbKLZRbKK8YlLFAAjRgXVXLghEwA+yCFYMnlIAa0AIkQANCWUJZQllCWUNZQ1lDWUNZQ1lDWUNZQ1lDWUO5h3IP5R7KPZR7KPdQ7qHcQ7mHcg/lEcojlEcoj1AeoTxCeYTyCOURyiOUZyjPUJ6hPEN5hvIM5RnKM5RnKM9QtlC2ULZQtlC2ULZQtlC2ULZQtktZjiOgBNSAFiABGtADRsAMCOUSyiWUSyiXUC6hXEK5hHIJ5RLKJZRrKNdQrqFcQ7mGcg3lGso1lGso11BuodxCuYVyC+UWyi2UIwYlYlAiBiViUDwG24ISUANagARoQA8YATPALtBQ1lDWUNZQ1lDWUNZQ1lDWUNZQ7qHcQ7mHcg/lHso9lHso91DuodxDeYTyCOURyiOURyiPUB6hPEJ5hPII5RnKM5RnKM9QnqE8Q3mG8gzlGcozlC2ULZQtlC2ULZQtlC2ULZQtlO1S1uMIKAE1oAVIgAb0gBEwA0K5hHIJ5RLKJZRLKJdQLqFcQrmEcgnlGso1lGso11CuoVxDuYZyDeUayjWUWyi3UG6h3EK5hXIL5RbKLZRbKLdQjhjUiEGNGNSIQY0Y1IhBjRjUiEGNGNSIQY0Y1IhBjRjUiEGNGNSIQY0Y1IhBjRjUiEGNGNSIQY0Y1IhBjRjUiEGNGFSPwblgBtgFHoMOJaAGtAAJ0IAeEMojlEcoz1CeoTxDeYbyDOUZyjOUZyjPUJ6hbKFsobxisB8LWoAEaEAPGAEzwE7oKwZPKAE1oAVIwFIuC3rACFjKbYFdsGLwhBJQA1qABGhADxgBoVxCuYZyDeUayjWUayjXUK6hXEO5hnIN5RbKLZRbKLdQbqHcQrmFcgvlFsotlCWUJZQllFcMdlkgARqwlHXBCJgBS/kxEvqKwRNKQA1oARKgAT1gBMyAUO6h3EO5h3IP5R7KPZR7KPdQ7qHcQ3mE8gjlEcojlEcoj1AeoTxCeYTyCOUZyjOUZyjPUJ6hPEN5hvIM5RnKM5QtlC2ULZQtlC2ULZQtlC2ULZTtUh7HEVACakALkAAN6AEjYAaEcgnlEsollEsol1AuoVxCuYRyCeUSyjWUayjXUK6hXEO5hnIN5RrKNZRrKLdQbqHcQrmFcgvlFsotlFsot1BuoSyhLKEsoSyhLKEsoSyhLKEsoRwxOCIGR8TgiBgcEYMjYnBEDI6IwRExOCIGR8TgiBgcEYMjYnBEDI6IwRExOCIGR8TgiBgcEYMjYnBEDI6IwRExOCIGR8TgiBgcEYMjYnBEDI6IwRExOCIGR8TgiBgcEYMjYnBEDI6IwRExOCIGR8TgiBgcEYMjYnBEDI6IwRExOCIGR8TgjBicEYMzYnBGDM6IwRkxOCMGZ8TgjBicEYMzYnBGDM6IwRkxOCMGZ8TgjBicEYNzxeAoC+yCFYMnlIAa0AIkQAN6wAgI5RrKLZQ9BvuCGtACJEADesAImAF2gcegQyhLKEsoSyhLKEsoSyhLKEsoayhrKGsoayhrKGsoayhrKGsoayj3UO6h3EO5h3IP5R7KPZR7KPdQ7qE8QnmE8gjlEcojlEcoj1AeoTxCeYTyDOUZyjOUZyjPUJ6hPEN5hvIM5RnKFsoWyhbKFsoWyhbKFsoWyhbKdinbcQSUgBrQAiRAA3rACJgBoVxCuYRyCeUSyiWUSyiXUC6hXEK5hHIN5RrKNZQ9BtsCCdCAFYOyYATMALvAY9ChBNSAFiABGhDKLZRbKLdQllCWUJZQllCWUJZQllCWUJZQllDWUNZQ1lDWUNZQ1lDWUNZQ1lDWUO6h3EO5h3IP5R7KPZR7KPdQ7qHcQ3mE8gjlEcojlEcoj1AeoTxCeYTyCOUZyjOUZyjPUJ6hvGJwrGGzYvCEEbCUbYFdsGLwhBJQA1qABGhADxgBoWyX8uPp+5FUkmpSS5IkTepJI2kmpUdJj5IeJT1KepT0KOlR0qOkR0mPkh41PWp61PSo6VHTo6ZHTY+aHjU9anq09Gjp0dKjpUdLj5YeLT1aerT0aOkh6SHpIekh6SHpIekh6SHpIekh6aHpoemh6aHpoemh6aHpoemh6aHp0dOjp0dPj54ePT16evT06OnR06Onx0iPkR4jPUZ6jPQY6THSY6THSI+RHjM9ZnrM9JjpMdNjpsdMj5keMz1melh6WHpYelh6WHpYelh6WHpYemScl4zzknFeMs5LxnnJOC8Z5yXjvGScl4zzknFeMs5LxnnJOC8Z5yXjvGScl4zzknFeMs5LxnnJOC8Z5yXjvGScl4zzknFeMs5LxnnJOC8Z5yXjvGScl4zzknFeMs5LxnnJOC8Z5yXjvGScl4zzknFeMs5LxnnJOC8Z5yXjvGScl4zzknFeMs5LxnnJOC8Z5yXjvGScl4zzknFeMs5LxnnJOC8Z5yXjvGScl4zzknFeMs5LxnnJOC8Z5yXjvGScl4zzknFeMs5LxnnJOC8Z5yXjvGScl4zzknFeMs5LxnnJOC8Z5yXjvGScl4zzknFeMs5LxnnJOC8Z5yXjvGScl4zzknFeMs5LxnnNOK8Z5zXjvGac14zzmnFeM85rxnnNOK8Z5zXjvGac14zzmnFeM85rxnnNOK8Z5zXjvGac14zzmnFeM85rxnnNOK8Z5zXjvGac14zzmnFeM85rxnnNOK8Z5zXjvGac14zzmnFeM85rxnnNOK8Z5zXjvGac14zzmnFeM85rxnnNOK8Z5zXjvGac14xzrxKa1UmSNKknjaSZZEErzi8qSTUpPXp69PTo6dHTo6dHT4+RHiM9RnqM9BjpMdJjpMdIjxXn86zFtKAV5xctj+5Uk1qSJGlSTxpJM8mCVpxflB6WHpYelh6WHpYelh6WHhYeXlR0UUmqSS1JkjSpJ42kmZQeJT1KepT0KOlR0qOkR0mPkh4lPUp61PSo6VHTo6ZHTY+aHjU9anrU9Kjp0dKjpUdLj5YeLT1aerT0aOnR0qOlh6SHpIekh6SHpIekh6SHpIekh6SHpoemh6aHpoemh6aHx/l0Gkkz6eFhZdGK84tKUk1qSZKkST1pJM2k9BjpMdJjpMdIj5EeIz1Geoz0GOkx0mOmx0yPmR4zPWZ6zPSY6THTY6bHTA9LD0sPSw9LD0sPSw9LD0sPSw8LDy9cuqgk1aSWJEma1JNG0kxKj5IeJT1KepT0KOlR0qOkR0mPkh4lPWp61PSo6VHTo6ZHTY+aHjU9anrU9Gjp0dKjpUdLj5YeLT1aerT0aOnR0kPSQ9JD0kPSQ9JD0kPSQ9JD0kPSQ9ND00PTQ9ND00PTQ9ND00PTI+NcMs4l41wyziXjXDLOJeNcMs4l41wyziXjXDLOJeNcMs4l41wyziXjXDLOJeNcMs4l41wyziXjXDLOJeNcMs4l41wyziXjXDLOJeNcMs4l41wyziXjXDLOJeNcMs4l41wyziXjXDPONeNcM84141wzzjXjXDPONeNcM84141wzzjXjXDPONeNcM84141wzzjXjXDPONeNcM84141wzzjXjXDPONeNcM84141wzzjXjXDPONeNcM84141wzzjXjXDPONeNcM84141wzzjXjXDPONeNcM84141wzzjXjXDPONeNcM84141wzzjXjXDPONeNcM84141wzzjXjXDPONeNcM84141wzzjXjXDPONeNcM84141wzzjXjXDPONeNcM84141wzzjXjXDPONeNcM84141wzzjXjXDPONeNcM84141wzzjXjXDPONeNcM84141wzzjXjXDPONeNcM84147xnnPeM855x3jPOe8Z5zzjvGec947xnnPeM855x3jPOe8Z5zzjvGec947xnnPeM855x3jPOe8Z5zzjvGec947xnnPeM855x3jPOe8Z5zzjvGec947xnnPeM855x3jPOe8Z5zzjvGec947xnnPeM855x3jPOe8Z5zzjvGec947xnnPeM855x3jPOvWjLxKklSZIm9aSRNJMsyOP8pJKUHj09enr09Ojp0dOjp0dPj5EeIz1Geoz0GOnhcd6detJImkkW5HF+UkmqSS1JktJjpsdMj5keMz0sPSw9LD0sPSw9LD0sPSw9LD0sPLzI66KSVJNakiRpUk8aSTMpPUp6lPQo6VHSo6RHSY+SHiU9SnqU9KjpUdOjpkdNj5oeNT1qetT0qOlR06OlR0uPlh4tPVp6tPRo6dHSo6VHSw9JD0kPSQ9JD0kPSQ9JD0kPSQ9JD00PTQ9ND00PTQ9ND00PTQ9ND02Pnh49PXp69PTo6dHTw+PcX2n1OD9pJlmQx/lJJakmtSRJ0qT0GOkx0mOkx0yPmR4zPWZ6zPSY6THTY6bHTI+ZHpYelh6WHpYelh6WHpYelh6WHhYeXkh2UUmqSS1JkjSpJ42kmZQeJT1KepT0KOlR0qOkR0mPkh4lPUp61PSo6VHTo6ZHTY+aHjU9PM7NaSZZ0Irzx+NHxwJWsIECKtjBAU7QEgU3wU1wE9wEN8FNcBPcBDfBTXFT3BQ3xU1xU9wUN8VNcVPcOm4dt45bx63j1nHruHXcOm4dt4HbwG3gNnAbuA3cBm4Dt4HbwG3iNnGbuE3cJm4Tt4nbxG3iNnEz3Aw3w81wM9wMN8PNcDPcLN285C2wgBVsoIAKdnCAE8St4FZwK7gV3ApuBbeCW8Gt4FZwq7hV3CpuFbeKW8Wt4lZxq7hV3MglRi4xcomRS4xcYuQSI5cYucTIJUYuMXKJkUuMXGLkEiOXGLnEyCVGLjFyiZFLjFxi5BIjlxi5xMglRi4xcomRS4xcYuQSI5cYucTIJUYuMXKJkUuMXGLkEiOXGLnEyCVGLjFyiZFLjFxi5BIjlxi5xMglRi4xcomRS4xcYuQSI5cYucTIJUYuMXKJkUuMXGLkEiOXGLnEyCVGLjFyiZFLjFximUvqkbmkHplL6pG5pB6ZS+qRuaQemUvqkbmkHplL6pG5pB4HbgW3glvBreBWcCu4FdwKbgW3glvFreJWcau4VdwqbhW3ilvFreLWcGu4Ndwabg23hlvDreHWcGu4CW6Cm+AmuAlugpvgJrgJboKb4qa4KW6Km+KmuCluipviprh13DpuHbeOW8et49Zx67h13DpuA7eB28Bt4DZwG7gN3AZuA7eB28Rt4jZxm7hN3CZuE7eJ28Rt4ma4GW6Gm+FmuBluhpvhZridueSxTlPLmUtOLGAFGyiggh0c4ARxO3PJ4VjACjZQQAU7OMAJWmLFreJWcau4VdwqbhW3ilvFreLWcGu4Ndwabg23hlvDreHWcGu4CW6Cm+AmuAlugpvgJrgJboKb4qa4KW6Km+KmuCluipviprh13DpuHbczl3RHARXs4AAnaIlnLjmxgBXEbeA2cDtziTkOcIKWeOaSEwtYwQYKqCBuE7eJm+eS4vHmueTCAi63tfFb9dLDQAGX29q2rXr1YeAAJ2iBXoEYWMAKNlBABTs4wAniVnAruBXcCm4Ft4Jbwa3gVnAruFXcKm4Vt4pbxa3iVnGruFXcKm4Nt4Zbw63h1nBruDXcGm4Nt4ab4Ca4CW6Cm+AmuAlugpvgJrgpboqb4qa4KW6Km+KmuCluilvHrePWceu4ddw6bh23jlvHreM2cBu4DdwGbgO3gdvAbeA2cBu4TdwmbhO3idvEbeI2cZu4eS6p4miJnkscvbBv7c9YvbCv+KZnXsVXfFtBL+MLbKCACnZwgBO0RA+LC3FruDXcGm4Nt4Zbw63h1nAT3AQ3wU1wE9wEN8FNcBPcBDfFTXFT3BQ3xU1xU9wUN8VNceu4ddw6bh23jlvHrePWceu4ddwGbgO3gdvAzcOiHY4KdnCAE7RED4tWHAtYwQYKqGAHBzhBSzTc/BLr+xh6MWCguzVHARXs4AAnaIFeFPiYJzoWsILuNh0FVHC5SXEc4AQt0S+xFxZwuUl1bKCACnZwgBO0RL/EXlhA3DyXiLeD55ILFfQ2M0fXXdnKCwEfs11HV/B/4PnhQgU7OMAJLl1d48wLAgMLWMEGCqhgBwc4Qdw8P6h3gOeHC93NT9Pzw4UCKtjBAbqbOlqi54cLC1jBBgqoYAcHiJvnB/Vu8fxwobsNxwo2UMDl1r0dPD9cOMAJWqLnhwuXW/fB5fnhwgYKqGAHBzhBS/T8cCFunh+6D1rPDxcK6C3pQ87zw4Uj0EsEA11BHP3IhqMfznS0RA/pCwtYwSU2qqOACnZwgBNcbuvt9+o1gYEFrGADBVSwgwOcIG4+PRjeDj49uLCC7qaOAirobt58Hv7Dm8TDfx6Olujhf2EBK9jApTv9ID3QL5ygJZ5bb59YEj0KV0F/9SK+QLfw4/V4mz4ePN4unKAlerxdWBI9LsyP1+Piwgo2UEAFOzjACVqi4Wa4GW6Gm+FmuPkVctVUVa+oe9zWOrqCODZQQFdQxw4OcIKW6IFzoet2R1cYjg+F6usTXjYXaIkeDOt5ePXKucAKNlBABfsS8zP2va4vdDc/ed/v+kTf8frCtrA5uoK3g+9pfaGf8XR0BT9N39n6wgJW0HW9HXyH6wsVdDdvHd/n+sIJ4qa4KW6Km+95faFkXyi9qfSm0ptKbyq96TF0dqFfs84u9F3mz87q9GanNz2Gzr4Y9OagNwe9OejNQW/6vvNnvw160/eePztr0JuD3vT95s8u9P3lz36b9OYZb96Fvsv82VCT9jXa12hf323+7CyjN43e9P2uz84yetPoTcPN0s2L4AILmL3p1WXV16u8vCywgutwSnEUUMEODnCClujBcGEBl5vfx3qpWaCACnZwgO7mx+uBc6IHzoUFXG71cGyggMut+pF54Fw4wOVWzy3ULdED58ICultzdF1x7OAAJ+i6q+e93qz6PZkXnD3WAhwr2EAB3c3P2MPpwgFOcLn5vZPXm1W/x/GCs8etseOy8BsbLzmrPrf3mrPADg5wgpboX3G4cLn5Du9eeha43Pwex4vPAhXs4AAnaIkebxcWsIK4GW6Gm+FmuBlulm5ejBZYwAo2UEB3q44dHOAELdG/AHFhAV23OSrYwQFO0BI9KVxYwAo2ELeKW8Wt4lZxq7g13BpuDbeGW8Ot4dZwa7g13BpugpvgJrgJboKb4Ca4CW6Cm+CmuCluipviprgpboqb4qa4KW4dt45bx63j1nHruHXcOm4dt47bwG3gNnAbuA3cBm4Dt4HbwG3gNnGbuE3cJm4Tt4nbxG3iNnGbuBluhpvhZrgZboab4Wa4GW6WbnYcYAEr2EABFezgACeIW8Gt4FZwK7iRS4xcYuQSI5cYucTIJUYuMXKJkUuMXGLkEiOXGLnEyCV25hL/zMeZSxzPXHJijYxoZwI5UUAFOzjACWbSNTnAAuImuAlugpvgJrgJboKb4qa4KW6Km+KmuCluipviprh13DpuHbeOW8et49Zx67h13DpuA7eB28Bt4DZwG7gN3AZuA7eB28Rt4jZxm7hN3CZuE7eJ28Rt4ma4GW6Gm+FmuBluhpvhZrhZuLXjOMACVrCBAirYwQFOELeCW8Gt4FZwK7gV3ApuBbeCW8Gt4lZxq7hV3CpuFbeKW8Wt4lZxa7g13BpuDbeGW8Ot4dZwO3PJdLTEM5ecuNzWEnPzSrTABrqbOSrYwQFO0BI9l6zd+ptXogVW0N38eD2XXKhgBwc4weWm59eTDrCA7tYdGyiggq47Fp6fkvOGOj8md2IDl0L3hvL8cGEH1/Gu1ebm1WWBluj54cLl1v2EPD9c2EABXdebz2N+rf82rxgLrKAfr1ucH7I6UcEODnCCFugVY3XtTN+8Yiywgg0UUMEODnCCllhwK7gV3ApuBbeCm8f82qe1eW1YXavjzWvDAgtYwQYKqGAHBzhB3BpuDbeGW8Ot4dZwa7g13BpuDTfBTXAT3AQ3wU1wE9wEN8FNcFPcFDfFTXFT3BQ3xU1xU9wUt45bx63j1nHruHXcOm4dt45bx23gNnAbuA3cBm4Dt4HbwG3gNnCbuE3cJm4Tt4nbxG3iNnGbuE3cDDfDzXAz3Aw3w81wM9wMN0u383OUFxawgg0UUMEODnCCuBXcCm4Ft4Jbwa3gVnAruBXcyCWVXFLJJZVcUskllVxSySWVXHJ+xHI9imvnZywvtMQzl5xYwAo2UEAFO7jc1gbw7fy05YWWeOYScyxgBRsooIIdHOAELVFxU9w8l6xHfO388OWFAo5Ezw/rOWQ7P255oSt4+3p+uFBABTs4wHW805vE88OJnh8uLOBym27s+eFCAZfb9OP1/HDhAN1NHC3R88OFBXQ3dXQ3P17PBNP72DPBhRO0RM8E65la823rqvlZeCYwPxzPBOZungkuVLCDy838cDwTXGiB50cxL3S34egW09EtzPFh0dYjkuZb17X1rKP53nWBE7TEFf6BBaxgW+jHsMI/sMcw8gq3wAlaosf8hQWsYAMFVBC3ilvFreLWcGt+Qt5mrYIN9BPylmwKdnCAE7REOcACVrCBuAluK+bb+jJ188K3wAla4or5wAJWsIECKoib4qa4KW4dt45b93PzIXfOFLpjBwc4QUs8ZwonFrCCDRQQt4HbwG3gNnCbuE3cJm4Tt4nbxG3iNnGbuE3cDDfDzXAz3Aw3w81wM9wMN0s3OQ6wgBVsoIAKdnCAE8St4FZwK7gV3ApuBTfuL6TgVnAruFXcKm4Vt4pbxa3iVnGruFXcKm4Nt4Zbw63h1nBruDXcGm4Nt4ab4Ca4CW6Cm+AmuAlugpvgJrgpboqb4qa4KW6Km+KmuCluilvHrePWceu4ddzIJUIuEXKJkEuEXCLkEiGXCLlEyCVCLhFyiZBLhFwi5BIhlwi5RMglQi4RcomQS4RcIuQSIZcIuUTIJUIuEXKJkEuEXCLkEiGXCLlEyCVCLhFyiZJLlFyi5BIllyi5RMklSi5RcomSS5RcouQSJZcouUTJJUouUXKJkkuUXKLkEiWXKLlEySVKLlFyiZJLlFyi5BIllyi5RMklSi5RcomSS5RcouQSJZcouUTJJUouUXKJkkuUXKLkEiWXKLlEySVKLlFyiZJLlFyi5BIllyi5RMklSi5RcomSS5RcouQSJZcouUTJJUouUXKJkkuUXKLkEiWXKLnES/3aqnFpXuoXWMAKNlBABTs4wAniNnGbuE3cJm4Tt4nbxG3iNnE7c8maCuuZS050t+pYwQYKqGAHB+hu4miBvn9foLupYwUb6G7NUcEOer+dYhO0xHKABaxgAwVUsIO+ervuDrwIMdDPojtWsIECKtjBAXqbTUdLbAfobuZYwQa6mx+Z37dc2EFfmT7FJmiJnjUuLGAFGyiggh1cZ7EKs5qXJgYWcJ3FKsxqXpoYKOA6i1WN1bw0MXC1WfVB4HcoF1qi36FU7ze/Q7mwgg0UUMEOupuPyT5BS/T8cGEBK+hlgS7mRfbm3X0WLJ44QUv0WcWFBaxgA73c0Pt4KtjBAc6rWrP1s5jY8SwmPrGAFWyggAp2MHveyxgDC5g979v5BQqYPe87+gVmz/uefoHZ876r39lvvq1fYAUbKKCCHcye9939ArPnvQIzsIAVzJ73Wsuz589ay+PECWbPn7WWFxawgg3Mnj9rLS/s4ACz573W8kI5wAJWsIECKthBbx0/sjPmTyxgBb0v/NfOmD9RwQ6Oqzy9jbMc+URL9NdtLixgBRsooILex9PREs/oPrGAFWyggAp2cIC4DdwmbhO3idvEza/+zQ/dr/4XdnCAE7TEFfOteeD41f/CCjZQQAU7OMAJWqAXWAa6mzhWsIHu1h3dzRw7OMAJWqJnggsLWMEGLrdVwNq87DJwua0iz+Zll4ETtETPBOKH7pngwgo2UEAFOzhAd1NHS/Q5gXjr+Jzgwgo2UEC3GI4DnKAl+gLmhcvCCxm81jKwgQIq2MHl5o++vdYy0BI9VVxYwAo2UEAFO4ibTw+8vMFrLS/06cGF7uZj0qcHFzbQ3bzVfXrg5Q1ea9l8Cui1loETtERPIBcW0Be0nTSpJ42kmWRBHsE+xfJix8AC+nzNqSVJkib1pHGRFzS29VJc89LF5iUYXrrYzr/XpJ7ko8lpJlmQR+JJJakmuUlxFHC5eJWGVywGjkQPOL9x8SrE5rN0r0IM9LTh5AJ+oB5ZF07QEj2yLizRJK0mtSRJ0qSeZNmIHjJnI3rI+O2lVxcG+qkOxw76kU7Hx5F6NvDiwpNWwFxUkmpSS3JFPxAPgOEHsgLAY9tLBS+qSeu3/dDW4L9Ik3rSSJpJbuJd6OP+wtXv/hjRSwQDG7gO0x/OeNlfG37wfjG8cB2nN61fC8+G8WvhhQIq6LLnrw1wgpYN7pF0YQFxM9wMN8PNcDPcDDcLN/Gqv8AChpscRwMFVLCD4xzq4kV/PnzFi/4uLAdYwJro16nhh+DBdKGA/pzSqSeNpJlkQT6FPakk1aSWJEnp0dKjpUdLj5Yefo0aJxawgutk1gNl8RK8wNWIw1vOA+7CAU7QEv0adWEBl9t6iixeghco4HJbz6zFS/ACB7jcpveDh+iJfo260CeCTjWpJUmSJvUkV+wLPfKmd6dH3vTj9ynrhQp2cB3perItXnwXaIkepRcW0B8HOi0z85b3KL1QwWVmPn49Si+coJt5W3iUXuhmfmoepRc2cGUvP4QVpBf1pJE0k+wir8Vr645GvOqurcfq4lV3bT1WF6+6C5ygJa6gk/XcXbzqLrCCDRRwHWpz6kkjaR1qdbKgdSW8qCTVpJbkJicq2EFLbH6YbtkauBT8KFesXtSTvEHVcYKWKN4i3qZSQLfy5pUG+sF6Q4p7ea+Im7nbCldZS4niNXWBluhXyAsLWMEGCuhufrzqbt3R3fx41d38IP3iWfwg/ep5YQMFVLCDI3F45/lpjgo2UEAFOzgS/XJZvaGm/5r36lSwgwN8nJt6V6+QO2lF3EUlqSa1JEnSpJ40ktLDwsMr2y4qSTWpJUmSJvWkkTST0qOkR0mPkh4lPUp6rGBbtxHihWonrWC7qCTVpJYkSZrUk0ZSetT0aOnR0qOlR0uPlh4tPVp6tPRo6dHSQ9JD0kPSQ9JD0sMDw6+7vnmYrImueNmYeJ73sjFp/m/X1G+VxouXdF1Ukx5K3X9lDd6LRtC6cIhfvLwWK1BAz5DiuM7WNdcgvmgmWZCP4ZNKUk1qSZKkSelh4eH1V7JufcSLrmQtVIgXXa07EvGaq4t60kiaSRa0RudFJakmtaT0KOlR0qOkR0mPkh41PWp6rLG77pfEi60ukqTl4ae5xu5FI6h5KwxHbwVvG79IrGUV8dqpwA4OcIKW6NeJCwtYwQbiJrgJbn6d8Gt6O++jTrTE807qxAJWsIECKthB3BQ3xa3j5p/89k7wT36f1JIkSZN6kiuuWPP6KPErvNdH+ZTRy6Mu0qTHb/uU1GujLppJFuQf+T2pJPmJn+in6IpzgpZofooeEVbACjZQQAU7OMAJWqCXOgUW0N2mYwMFXG5rcUq81ClwuXm681InWWtE4qVOsnZ6Ei91CizgclM39kndhcttLfaIlzqJpw4vdZK1MiDnbl7H+W8naInn5rsnFrCCflfuh179FtwP3edxHt5evhRYwHW8HuFevhQooIIddN3Vx16SJN2PwYPRb1+9JClQwQ4OcIKW6MF4YQHdzZvPg/FCAd3NG9WD8cIBTnC5DW+zcxnkxAKu9vW53rlD14UCrkcGPi88d+i6cIATtMRzY8sTV2/6HFJyY0uR3NhSvCRJhvemz/Uu7OBInAe4Wmf4oPWIvdDvYRf53dNJJWllez+qFYEX9aSRNJPsIq8Nuqgk1aSW5Aejjgp2cPWPLzV4MdCFHm0Xev9Mxwo2cJ3GSZrUk0bSTLIgvzCeVJJqUktKj5oeNT1qetT0qOnR0qOlR0uPlh4tPVp6tPRo6dHSo6WHXzh95cNLfgIruNrLF0G85CdQwdUlq35evOQncPWOLyJ4yc+FHqsXFrCC7ubd57F6obv58XqsTj8yj1VfOfCSn0BL9Fj19QIv+Qms4Lp0niRJmtSTRtIM8lnqeggoXsAjvuzgBTyyKvLFC3gCBzhBP1I/bY/HCwtYwQauQ3WBNas9O8lvzXy9wct39PDz92nthWte6/fpXr6jhwv4zPbCNbX1K4SX76jfUnv5TuA4v2wuPb7AJedOX25w7vR1oYJrIuy35F56EzhBS/SbrQsLWEG/w6iOAio44sDig1vS44Nbcn5A04X8g1sn1SQXV0cBFfS7pFNpgH6f5M1y3ow5nndjJ/pFuDhWsIECKtjBAU7QEvP7FtIFN8FNcBPcBDfBTXAT3AQ3xU1xU9wUN8VNvSWnYwcH6C3pfaGW2A9wDQpfqvCqnMAGCrjcfC3Dq3LUlyr6uSe9OE7QEtflVldRiHhVTmAFGyiggh0c4AQtceI2cZu4nXvSnyiggh0c4AQt8fy+xYkFrCBuhpvf1FZvHb+rvXCAE7RAr+AJLGAFGyigu6ljB0eiJ4kLXWE4usJ0VLCDA/TjNUdL9DWaCwtYwQYKqGAHB4hbxa3h1nBruDXcfMXGV0u8VifQV7CK4wAn6D3vCmd+OLGAFWyggK67AserctSfFnlVjvpKilflBDZQQD/e7tjBAU7QEj3m/U7cq3ICK9hAARVcbn7H7DugBU7QEj3mLyxgBRsooIK4ecz7PbbX6gRaose8r8t7rY76/bHX6gS6mw/wKaC7eev4+tWFA5ygJfql/sICVrCBAuJmuBluhpulm9fqBBawgg0UUMEODnCCuBXcCm4Ft4Jbwa3gVnAruBXcCm4Vt4pbxa3iVnGruFXcPD+s5+bitTqBluj54cIVsZ4cz+92XthAARXs4AAnaIm+hutLHF6Ko2v3EPFSnMB1vL7a4aU4gZbo+eHCAlawgUvX10u8vOZqks4Ze8xfWMEGrvb1ZRYvrwns4ADpzY7boDcHvTnozUFvDnrzjHk/hjPmT6Q3B73pMX8eg8f8hQXEbeI2cSPmJzE/iflJzM/J2DFa0mhJoyU95s9jMFrSaElifhLzk5ifxLwR80bMGzFvxLydMT8cFezgACfoLblSplcFBXpLimMFGyign5uLecxfOMAJWqLH/IUFrKC7TUcBc4B76ZD6wp2XDgVaogf6hTk0vHYosIECKtjBAWZneVnRhUJnCZ0ldJbQWSKggh1cur6O6IVFgQVcur666LVF2v3IfHpwoYIdHOAELdFTxYUFdF0fGp4ULuzgAF3Xh4YnhRM9KVxYQJ92+K95UrhQQAU7OMAJWuI5zVfHBgroZ+FN7eF/oZ+FjzMP/wst0cPfVy29JCmwgsvNVy29JClQwQ4OcIJ2oXpJUmABK9jAfi4gqNceXTST1rOEuWgF+UUlyRWbYwMF9OMXxw4OcK0IFCcL8hWBk0pSTWpJkqRJPWkkpUdNj5YeLT1aerT0aOnR0qOlR0uPlh4tPSQ9JD0kPSQ9PKbX4ql6PVNgB729huMEvb+9HzzSLyygPxb1TvZIv9DdzFHBDvqz0eo4QX8C68frkX5hAd3NO9UnBRf6Y1gfSh7/F/qDWD8Lj/8LJ7ga0QVW+F9UkmpSS5IkV/QW8Ev89LPyS7x5C3iMX9hAAdeRmp+2x/iFA5ygJXqMm/eYx/iFFWyggAq6mzeRx/iFE7RA33gssIAVbKCACnbQ3YbjBC3RL/FrSU69BKqvdUT1EqjAtey91pTUS6ACvT6gOnZwgBO0RF/Fv7CAFWyggLhV3CpuFbeKW8Ot4dZwa7g13BpuDbeGW8Ot4Sa4CW6Cm+AmuAlugpvgJrgJboqb4qa4qbs1RwEV7KA/FxPHCVri+Xm5EwtYwQYKqKCfhePw41XHCvrx+qAdAirYwQFO0BKn6/oAn7Tv5IznACdoiebtOx0LWMEG0puGm9GbRm8avWnZm15cFVjAGofj9VWBAirYQXczxwkut1Wip15mFVjACi634mIe8xcq2MEBTtASPeYvdDdxrKBEZ3khVl/r/+qVWIEDnKBFB9R2gAWsYAMFVDA7qxLolUCvBHol0CuBXgn0SqBXAt13BevrIYX6rmCBlughXbwdPKSLH5mH9IUNFFDBDg5wgpbYXdeHRm+ggAou3epDY13WAydoiSMvzV5YFljBBgqoYAcHOBPXJd9nmV6IdlFLWs/rvEH9ed1JPcmP30ejB/6FlrgC32dnXod2UU1aTVXdx6P+QgX7+YxQvRTtoplkF3l52kUlqSa1JEnSpJ40kmZSepT0KOlR0qOkR0mPkh4lPUp6lPQo6eHRve6g9KxYu7CC7XpUql60Fugt1h07OEB/ZlkdLdHv330G4huEBVbQn6W6gt+/X+huw7GDA1z3RaeDBa0wv6gk1aSW5Ip+Vh7M1dvFg3k9O1AvWQusYAO9YNDFPJgv7OAAJ+hVg2vQeslaYAHXdNobYEX4RZKkST1pJM0kC/Ip+0klKT1Geoz0GOkx0mOkx0iPkR4zPaafiDhWsIECKtjBAU7Qm8273S/yFxbQ3XzwerhfKKC7eTf7Rf7CEegFb4HrdYrupEnrl9ZDCfVqtsAJWqJfqy8soJeEDscGCqigu03HAU7Q3fxoPZovLOByW6vJ6ht3BQqooBehFkevQvXj9Qv0WhxUr3ELrGADXdcbyuNW/Sw8btUPx+O2u5tfoC+0RL9AX+g1T344foG+sIECem2VH69fq7sfjl+rV0WdehFc7344Ht6+zuJFcIEVbKCACnZwuQ0/Bg/vEzuD6IzpEyvYQAEVdAs/Ib9sXzjBdUJ+1fTKt8ACVrCBAirYwQFOELeJm4e5X5t9M67ABgqoYAcHOEFL9DC/EDfDzXAz3Aw3w83D3CcDZ2mdr9mctXUXVrCBrjsdFezgAH1iYo55RfFKu8ACVrCBAirYQW8dR4/5CwtYQS98OxwFVLCD4yrNUq+wC7REr3a9sIAVbKCAXlRXHCdoiR7zFxawgn681dEVXNdD2le0vFYusICu4N3tIX2ht0N3VLCDfrze8x7SF1qiR/eFBaxgA93Nh4ZH94UdHOAELdFf9hh+8h7HZzt4HF9I63gc+0Tb6+gCJ2iJHscXrrPwZTavowtsoIDLzdfWvJIucIDLzVf9vJLuQo/jC93N+8Lj+MIGupv3vMexzyl8I6zuC19eX9d9MuobYQVaoG951X1lzOvuAgVUcM2Wfb3MK+zOweUVdoEFrKCA4yrcVi+mC7REf4VwPZRQr6cLrGADBVSwgwOciSsgh8+jvXYusIECrjsFn5R77VzgACdoV927eu1cYAEr2EABFezgSDzfEBHHAvpZePtqAwVU0M/i/LUBTtASV/AGFtBfaPDO8vcLLxRQwQ4OcIKW6MF7YQH9LE5UsIMD9LPwPh6WOA+wgPGuino9XKCACnZwgBO0RL+H9lUer3wLFFDBDg7Qp6xOdpHXvV1UkmpSS/JJpZMm9aSRNJMsyG+ZfZnIq92Gr6d5tVvgAP1tqfPfWqLH7oUFrGADBVSwgwPEreLWcGu4Ndwabg23hpvHri8Fel3bhSt2Awu4Wme976te1xYooIIdHOAELVHdrToWsIINdLfmqGAHBzizs86Idjwj+sQCVrCBAjIeOuOh+1n4uBsHWEA/Cx9cw8+iOwqoYAf9LIbjBC3RI/rC5eYrcl7tNqo3lK+SXSiggh0c4AQt0VfKLiwgbh7nvgrk1W6BCnZwgBO0QK92Cyygu03H5eYLKl7tFqhgBwc4QUv0pbMLC1hB3Hz5zFdcvNotsIMDnKAl1gMsYAXdrTsKqGAHBzhBS2wH6G7mWMEGCqhgBwc4QV9nXuTz8pNKUk1qSZK0FMVb1nOA+J96DrjQM5kfv7++cqGACnZwgBO0xPPl6BN9Nbk6+usf3gse7Rd2cIATtETPARf6WYhjBRsooLv5KPcccOEAJ2iJngMuLKC7+bmdK+XDUUAFOzjACVr2hdFDRg95DriwgQIq2MER6HVuvs+Fep1bYAVd1xwFXLp6KnRwgOss9FSwRI/2C33RXxwr2EABFXS34TjACVqiR/uFBaxgA113Oq6R6nNVL1gbvhjmBWuBAvqTj8Oxg+vIPMi8YC3QEv0K370d/Ap/YQUbKKCCHXQ3P16/wl9oiR7dFxawgi3P2K/lPpXzgrXACVqiX8t96uYFa4EVbKBcG8eol7EFdnCAE7RE30LrwgJ663RHBTs4QD8L726P4xM9ji8sYL02CNJzZ60LBVSwgwOcoCV6xHY/dI/YCwX0s/DB5RF74QDXWfh6phesOXYvWBtrPbN7wVpgBZfbWpnovodWoIIdHOAELdHjeC1tdq9lC6xgAwVUsF/bmXWvW/Nt2boXrvn+YN0r1wIr2EABFezguPYS68e5v92Jlnjub3eiu3lL+s6RFzZQQAU7OMAJWuK5XaSfpkf3efIe3Rcq2MEBTtASPbrPM/bovrCCDfSHJH44vhXXhR0c4AQt0bfiurCAFfSz6I4dHKCfhbe6X7tP9Gv3hX4W07GCfhbefB7zFyq43KYfg8f8hRO0RI/5CwtYweU2PXD82n2hgh0c4AS9zbyHjJ43et7oeaPnjZ43et7oecueL0f2fDkKWMEGZs+fe3hd2MEBTjB7vpQDLGD2vFeXzbW02b26LFBATfRhP/0sfNhf2MEBTtASfdhPPzcf9hdWsIECKtjBAU7QEjtufqlbi8/d67ICG+huw1HBDrqbOfqTfm8+D4a1kNr9M5Fjrcd3r+EKrGADBVTQqwrcwoPhwglaogfDhQWsYAMFVBC3idvEbeJmuBluhpvhZrgZboab4Wbp5pVdc62edq/sCmyJ65I01/S2e61V4KrjXrOg7rVWgRO0xHWhCixgBRsooILuJo7upo4TtMR2gAWsYAMFVLCDuDXcGm6Cm+AmuAlugpvgJrgJboKb4Ka4KW6Km+KmuKnrrnjzvbbmWrns/onGaxD0CjbQR9R0VLCDA5ygJQ53O7GAfrxu4RsPXSjgOt61kNf9s4uz+ED0TYUu9OP1s5gth8YUUEHGznRdH78r3gIt0Ripxkg1RqrhZrgZboab75Xg6HVQs5xoif6Ow4keImvtrXvBUmAFl/FacOtesBSo4DJeq2zdC5YC3Xg6WqKHyIXuZo4VbKCACnZwgF6wdDha4lmydGIBK9hAiT5ukoPW9986e8iLmS70YLiwgBVsoICZVryYKXCAE7SIlkbgeDFTYAUbKKCCHRyJPuyrH5nvuHVhBwc4QUv0ELmwgBVsIG4Tt4nbxG3iNnEz3Aw3w81DpHoXeohcqGAHBzhBC/SapcACVrCBAirYwQFOELeCW8Gt4FZwK7gV3ApuBbeCW8Gt4lZxq7hV3CpuFbeKW8Wt4lZxa7g13BpuDbeGW8Ot4dZwa7g13AQ3wU1wE9wEN8FNcBPcBDfBTXFT3BQ3xU1xU9wUN8VNcVPcOm4dt45bx63j1nHruHXcOm4dt4HbwG3gNnAbuA3cBm4Dt4HbwG3iNnGbuE3cJm4Tt4nbxG3iNnEz3Aw3w41cIuQSIZcIuUTIJUIuEXKJkkuUXKLkEiWXKLlEySVKLlFyiZJLlFyi5BIllyi5RMklSi5RcomSS5RcouQSJZcouUTJJUouUXKJkkuUXKLkEiWXKLlEySVKLlFyiZJLlFyi5BIllyi5RMklSi5RcomSS5RcouQSJZcouUTJJUouUXKJkkuUXKLkEiWXKLlEySVKLlFyiZJLlFyi5BIllyi5RMklSi5RcomSS5RcouQSJZcouUTJJUouUXKJkkuUXKJnLmmO7iaOHRzgBC3xzCUnFrCCDRQQtzOXDMcBTtDd1gRZz1xyYgHdzRwbKOByW5Xr3cuwAgc4QQv03c8CC1jBBgqoYAcHOEHcCm4Ft4Jbwa3gVnAruBXcCm4Ft4pbxa3iVnGruFXcKm4Vt4pbxa3h1nBruDXcGm4Nt4Zbw63h1nAT3AQ3wU1wE9wEN8FNcBPcBDfFTXFT3BQ3xU1xU9wUN8VNceu4ddw6bh23jlvHrePWceu4ddwGbgO3gdvAbeA2cBu4DdwGbgO3mXHcz/wwHTs4wAla4pkfTixgBRsoIG6Gm+FmuFm6jeMAC1jBBgqoYAcHOEHcCm4Ft4Jbwa3gVnAruBXcCm4Ft4pbxa3iVnGruFXcKm4Vt4pbxa3h1nBruDXcGm4Nt4Zbw63h1nAT3AQ3wU1wE9wEN8FNcBPcBDfFTXFT3BQ3xU1xU9wUN8VNceu4ddw6bh23jlvHrePWceu4ddwGbgO3gdvAbeA2cBu4DdwGbmd+WFMUrzELLGAFGyiggp6NuuMAJ+hua17iNWaBBfRDN8cODnCCFjjPVHGii03HCjZwHfqqQupeQjZX/U73ErLAAU7QEj1VXFjACjZQQNw8Vayine4lZIETtERPFRcWsIINFDAvEpOpxGQq4SVkU7xJPFWc6KniwgJWsIECKtjBAeLWcBPcBDfBTXAT3AQ3wU1w8/ygfpqeHy4sYAUbKOCyUO8szw8XDnCCluj54cICVrCBAuLm+WGVHnWvPwucoLt5H3t+uNDdPAI8P1y43PxhqdefBS63VRfUvf4scIATtETPDxcWsIINFBC3idvEbeI2cTPcDDfDzXAz3Aw3w81wM9ws3bwqLbCAFWyggAp2cIATxK3gVnAruBXcCm4Ft4Jbwa3gVnCruHkCWUVc3avSAhsooLuJYwcHOEFL9ARyYQEr2EABcWu4Ndwabg03wU1wE9wEN08Vqzise63aXDVa3WvVAl1hOFawgQIq2MEBzkQP/1Vs1b0U7eoLD/SzqT3QL5ygJXqge8WSl6IFVrCBDBgC3Qh0I9CNQDcC3Qh0mwyYyYCZDJjJgDkD3Y/hDPQTB4gbgW4EuhHoRqAbgW4Eup2B7sZGSxotabTkGeiPYxjHcYAFDLdxZKCPIwN9HBno48hAH0cG+jgy0Me5AdsyHucObBcWsIItj+EM9BMVxK3gVnDLQB9HBvo4agE5t8q5ZaCPoyrYwQFOcLmt8rLhxWyBy224rgf6hQ0UcLmtcqLhxWyBA5ygJXqgX1jACrqbOgrYr9AbXtc2V0XY8Lq2QEv0THAhQ0MrSGcpnaV0lnZwgHSW0lmdzup0VqezOp3VGYidgdgZGp4qVjHb8Lq2wAJ6Q3k7eKoYfmSeKi5UsIMDnKAleqq4sAR6YZatcu/hhVmBAurC5tjBAU7QEn0LwAsLWMEGCohbw813+FsF+cOLw2yV0w+vCIs/9cPpjn44w9ES9QALWMEGCuiHMx07OEB385ZcA8bW/gvDK8JMvfnWgLE1Tx1eEXYdum8FciEn5Nt9VNf1/T5O9A0/LixgBRsooIIdHKC7+aH7zh/ND923/riwgBVcbs3PbV1QAhXs4AAnaIl2gC7mDWX+a97z5v929bFvz2Vr74/hRVyBFWxgB11hDQ3fcivQFYajG09H/7erSbyIK7CA3oWHYwMF1NQ9o+X80wFO0BI9WvyMvYgrsIIN5Nx8h8zzhHyLzAs5Yx/gxX/NB3jxlvQBfqGCHRzg0i3u5kO5uK4P5QsbKKCCrutN4jvbXDhBS/SxfmEBK+hu3lk+1i9UsIMDnKAl+li/0C28j32AXyiggh0c4AQt0Qf4hQXEzXDzCKg+HkzBDg5wghbo+1mdre4bWgVWsIH+ayv0fDsqW9Usw/ejChRQQT8ccRzgBC3RY+jCAlawge7WHBXs4AAnaIkeQxfWPDcPnPVwbHgRV+DIE/LAudASfXfZC/3Qvc18f9kLG+iHPhwV7CjgJrgJboqbX50upFuUblG6RekWxU2x8DuU6U3i047pTe3TjumH7tOOCyvYQAEV7OAAJ2iJEzefdkxvHb9DubCBAirYwQFO0BL9DuVC3Aw3w83vUKaPB79DubCDA5ygBZ7lWhcWsIINFFBB110p6Cy2WpXf4yy2ulDBDg5wgpbo9xcXFrCCy2JVlI+zwmpt+THOCqsLBzjBZbHKyMdZYXVhASvYQAEV7OAAJ4ib4Ca4CW6Cm+Dmy49rt5JxVlhd6BbeAX77sPYlGWcB1YUNdLHhqGAHBzhBS/TbhwsLWMEGYuFj3Xxo+Fg37zcf6yf6WL+wgBVcWWNtiDK8cMgO726/ilw4QQv0wqHAlY1WBfzwwqHABgqoYAcH6G7N0RJ9UnZhASvYQAEVdAtxnKAl+nXowgJWsIECKthB3Cpufh1a1efDq4UCC1jBBgqo2eqtgwPMzvKyH1u1wsMLfGyV1g4v8Am0RL+2XOiHY44VbKCACnZwgBN0tzVSvcAnsIAVbKCACo48t3OOuMavnrPBE2uekM8GLxRQQZ+qeZuds8ETJ+hTNR+e52zwxJIKE7eJ28Rt4uYTwwvplkm3TLrF6BbD7YzY8d///U+//fXv//qn//jL3//2L//xjz//+bd//q/8g3//7Z//x3/99m9/+sef//Yfv/3z3/7zr3/9p9/+nz/99T/9H/37v/3pb/7zP/70j8ffPhrsz3/734+fD8H/85e//nnRf/8Tv328/tXHysC6yfBff/C0lCjHjyLltYhvk+MS0nsKjPrD79fXv+8vyfnvP67hHMAo98+irdvL6yyktpdnIa9F1qXkVCj8vrS7v958n4fzLB6PdjmCqj9I9I1EdsVjqoLALHcFfE9pF+gNgcf0+QeBuWlI/3zy2QqPNPtSwnadWbMd+mgvJXZN6QssV0NMedmUZTMmH/fo9dJ4DI6nASE/Hkapn/bH9kQsTuQxi2yvT2Sjob5zrWusnb5So/8Unrrr1TVTuHpV60uJzcjyN3dd4fGQmfPodlvBn/CfCr28Vrh7GuP1aewa07dUOxtzHPZKom5yTfWvAJ8DS6W8lCifNkXdjMzHeleO7nKQc+WnnNs2B7EW4c+DsPH6IHYJs9ZoiQcyKh63tPdPpKxltOtEtLw8kc3AqjO69LEc8kpgH2HWc1A85f6fe3R+nvR2Go/7q9B43D69voC0Y5u/a4bIU2s8UuCPGpvR6Z+POS8ihz4p1PsDQzQHhj5F2c8Do22Gp/mXdC4NY4Q/FhJ+1NgcR+WS/Fg8RKN/oU8ySuQ5c/6uTzbj87EEnzOLKU/Xkfbj+FqB8FJjVXqHyCpve1L5qU3nN4wO+3R07M/Fcpry4N5enovsru9lkAGfpq2P6eyPGvXT8bEdpTdT4FbjZrSIfh4t0j9ujV3PPpYlY3Q8HlKV16NUdrm0jJz9PZ5ZPfXsTxNI212kW9xSVHm6xj6WC3/Q0E0uFd+5+7qteRphP2tsj8O/lnhNFmxzHJtRut4nz1n9U8z9rPGVnukve0bl41mH7uZww78Ccx3IY6Hr9YHs7nNqLdkkP6TUnzQ2TfIYntm95Wke96UGuTd7Uftw9rI7j/Xdq5i9FGnvtWfLm6X1RuxLjV53s6i8VK7dat/TGHm/tDa6fE/DX7o/NWZ9rbG9ZPt66tmvxxwvL9l9Oy1tGSyzv77s913f1rwRXp+7edIo9zVmj3G+Nsx7rWGfTxzG8enEYZs75vE0k3qOt5/7dtRPj2PfsyPWBR6Pe+W90eGPKC+NzegYu/awlsPjwU8Tqf6F48gb+8cS2nx9HNsJXd78rLnp0yT5xwv2mNvVs5arZ8/3o1/QEN+d9szo82mU/qwxv+EGapY/dqQrPfuI3+PlSJ+biWUpM4+kPFKavBgf8+NbqL5d1Myp2OMpfHkrWh7P7KNXHs/hj5cac/yx0fKYa+TVum8if26nhDNGae0/3OaPH5dYN6N0tlJzOW7qWxrmn+I5bxlG32jUz6PF2qfRss8/XBZsHi/j3jYRVzv5eD4/hPhJYzs6WKl9LAId7430znxw1PpSw+bHjxH6vWxstb88inJsH8r0fLL0uLY8Nen8goiXaMZM7NiI1N1Q10hB1sfTU42f7ijLsbtNz4u+PV3jmur9rG6tKBnoh3nlT6uVh34aMNtWrZUbOSm7rhmfB3855qcns82nPZ8e1mHyMo+Vsh9m2SDH0yT550cLuydOXKPkeL2gXnYPnB63tflsoY7n5aSfmrRsL/tH4VHm8XSZ+nk1aD9YrZJVTTeDdffMpraRV7vnbFRb/0nk45Wp/XFIrjnW5xnE745jGzZSJqs5m2RUtguo3Cc/1vs2Dya/YbzWz8dr/Y7xWr9lvO4f4mg+xOn95WM52d4+ZBnD7Mfrh7W7h1GPeyhmu8fxOhttRRoroD9cwn8nMj9/6Fvt46e+O4mbj31vn8nmue/dJpWjv9svx0iRsrnU7B5K3S2xKE0/f964P52RK1SPG7Pd6WxmAbPWGPAP1NfpbC+SU8VZbZMTm30+4OX4eMDvJG4O+Ntnshnw2yZtR/ZLa+/2S8/17TnLpohm92yqqLDi/1wE89MNyXasSsmp8yPyNnlVxjeMkPn5CJkfj5DbZ/JmSny0o2STdnvdpFo/b1JtHzfpTuJucVH9o5v0aZSO8t5V5vGbcSBSj12/7O6r7laNfUNC7Z8n1P55QtVvSKj7Fv10gqmF4rPHaH49weybbNr9I8fnHfMcm5S8W98x1iGO58vtzxl53x6D9phvtum9crzSt4/6j85ahrzUGMfnI32Uj0f6+Lgu8P6ZbEb6tkX9w0rRov09Da0UPrT2ukU3o/Rxe6x5p9ztTY18+rDV2I+wWxWfnrY/HR2f30nN8nG9Qpn1w4KF/VHcKyMpu+dS96pXy9xl0pLvDPTnKWWb/V0RfVNE8r5y7Zq+EZkf98v2XHLtYn3b5c1zqblWt77h8a5ILrb35/vBr4m0vO9Ynx54LbJ7OvVYD8yJ1OKnzvmpPG8rc7dO8Bcilo8xWrE3RXgK+ngI2t8UuVmyWHaPqe7WLBazj5eGt8dBwZDNp2nZ74/jrkg/3hXJC80D+3sij0lmTlQfPHYy2/rrTGz2PJH44mCbDLbnOP6aSDdENgF4/xr+8n6o7p5VjSykGuP1VWs/Z773psHuUdXd28O9iOS5iFjZiOzLp/OZ+ZDN2bSPZ951t/R/b261lbj5Rs72IdXNV3LK+HRWU8u2elpyZfjRoi+vevd7ZWx6ZTs68vFwHVPe0miM9ccFb7yrcXys0ZhcPeexr2lk5z7kXmtU/fiO6Bcat+6I9uciDDLp83ONN8fY43EHD2Tm677dvjLVKVMZdRd1uwMZFIaN/joVtvp55+41vqFzR+FcNoG7ez5VjnzsXx5rou82as53H9nr9SjbPcG495C7bt+aMs1zsfH67mx7HMLC8PMLT79rjt01W/NxneimcHAvwusXMkZ/U0RHPjnQ3exB6ufPQavI589Bt6fzvC5bN5WQdff21P3TGX/06dQZF019fl/o96djH85194fRc7jq0M08VXc7S2Sdq9SnN8F+bg79+CW//VGkwnPw/v4odsUlleCtTytv/b5EOXz34uvGbk55T8Tm09r/U3HJV0RWlU6m9+Np7ewrjZrvbz4mm5tGtT9U4tGQ1WhUfX0q9h09Y9/RM/YNPbON3JGzqvVN3/euET+saTZ5VyTXmdbXqd4UGTkn6rtC971Iz2GyvtnwWuQXr1Hdu0bsnvB8yzVifdIhT6dvTmf3JtXjkWvjNtHE3hlso+ft2eg2N0cin69EjM83Sanj411SthI3VyJ270HdXYnYPmy6txKxe5Xq9krE7V7Z3CXuR8e9lYidxt2ViF9oHB9r3LzRnHefiep7bXp3RWSvcW9FZFf9f/emea9x76Z5ey5y5Ph4foT3s4bVP/o47q3M3NZ4M+bursxY/4aVmdm/YYD0P7hj7q2qtO3LUHdXVfYHcmtVpe1eqLq3qtJ2r1PdXVXZHsfNVZVfTGIGk7LHY7cXk5h29K1IprIHP70/+AWRm7eIvziZm8exSYfdsnJ4bTa8mepuVjLyzuxpJ8Sf9lL81Y1M5d3lo9mbd0Py9GZJf3U31H71OtWdW6qtyHfc/t9uEfmOFhnf0SLj0xb5xZPup5M5jueH1F97YH60/iTzugKgHvIdz923Mn3m6+Hra2avOnkrwW3Z43lzeU9icBT2snf25TcHm5Eeb1cT2dPeR5sanv2rELmB0mzPt5hfehVC8vo9pb0WabuXodbWSzmjkZcTidY+r1Vt7eNa1a3EvfvU+2fyep65b1HL+5Bi1l63xudPRH9xHLdeyGyfP6tqbZ/LciFENi9kts+fVW2b47EEcbAEMd9q0lp427ZsZszy+URVvmOiKh9PVH/xLlY2x+xPJYS/fxdr90zmVs3+fvvbW+X2TT5/NbXJxwXVW4mbKez2mYz3GvRetf1W4l6xfdvNDG/eJ/9C42b1wccrqLKfzt2r2N3vbXyv1narcbPUdrs56M3i1Nsam9rUvca90tTWvmWGvGvVm4Wp7Vuquts3FKa29seezd2x2r6hLHy7Ce3NsXpbYzNW9xr3xur2peXbY7V9Q/3z/f3mX0+lts+lblVz7LbWKxkvj6nMc9nQT/tgb/f4a+w30OTlQttWQo72/7vM/qPE7rHUzaWYXWMcOTR+esv3p8aY31D+1HY7/N19Fry7C7vZpGV3k5736M9FOj/vt1q2xQJZK9BfK+zuJTXPoujTvmm/29p8ez9KKYg+fUPmdxpzeyN4b5vB9vHa2C/2i89tOR7cXm+z3Kx+HLFbiXvDyz6unWr7d+NygjzLy1Vx+3iM28djfH7DGJ+fj3HZb8p3b4xv9++vWYhaH/x0IHpfQ7NNq+prjf3O6E8P1UZ5fqHm5z3rD/k0UvYStyJFPn+E9IXmKK+3fdtv4S9US6g8dYy9qTE/13gu3fzKpwRazwWPNl5vvy/bUvbJJrjzKfx/L7K52lee3Nb5tKj2NZFZLEWe30T9oghHUvUbRJ62OP7KtxG0K5vOD3uvc4Q0Ijrmuz08MwE8b7X8/hcn5K0WEeP1QJubrrn7BY65CZvdtn43q9CkbrPqQZVR7ZsD2dzKrc9Kxt2PPm8QOn/S2G78TPXGD8/Ex08au+X9g/x+PC/g/qwx989v69PzW319NttmVTZ9f3pA//tm3YrYUwXY60Gy/xrI7c+SbFX0QEU338CQ7c36oBD8uYt/WuffflPk6U0Baa+vndvvebTchUGbvfsdjSzheKC+p2G5P7jakDd7ZmQSKGMex5sq82kHuamv22TUT2fwW4VbM/j9jvz2VDlh7dXjfZHtcl9uZWv19TxxL5Hj1Gp/dT+0/0LB4EzmmG9G7rR8qPXgzW2qbF+bujf53krcm3zvJor3Jt9faI7dx5F+oTJQUXlXRQ2Vsbkv2m3Md7NrthL3umZ3Mt/SNc/NMe3trumo2Jv50A4uVVbq6/y+3Uf+XkLcS9zKiPtz4V3SYl1et4j0+ukCz1bica06KM4ZRd4T4fbqwVXfFMmdOdf17q38bIMnXLbLz9tt079rF/iac8XajucJZ39TpNQ3RTS/VV61l/dEHqeQSe344f7op4WW3XYhhQ3pa3v9ASgZ7fOHCDK+4R3q7dlQEVoP2Z3Np0+p+je8Pr39XBr56Kep8xc+uTaEz9j98Jmyn+/Bj4+vnPPjRzuye0x178q5b4xctdLZbNMYu3pUyXWeLrNtRHZ1fnxHsxwvb5y3h6E5P3s8VDnePBfNr9E8Vq/0bZGnN2PtbZF8C7S/+WnAu58X3L3SevPW7Ph0IrJ9N/fmw5X9+703H67YN3zVb/slPMk1BHl+Nf7nr1mJfX5XZZ/fVdnHd1XbxlD2Onte3v25MfQonzbGXuJWY+jR/tDG6MJeFr1sGkM/bwz9vDE+fkq+/cyZ5aVJjjc/5Pl4cm1ovP5Umpbj83mcbr8/dXP2s3sXphfe2dDNYbTvOJdvmJPuvx1XsntLledv+s2fjmTXv7zn/LTIPcYXDqNbvsb643eFvvAJu7tXhf138MiEa/NVWvV338HbfkzviLCz50nDV0Wy7LE/l19+5Yt8z++yHc8fef/pm3y/OJLJtwHt3dMZLeaFNp4KEb4mMmnY+ZRJfhbR3YOqbxH54c2LtvnY4VakZmVrrc9t8iWRlhvr1OctAn7fxd/wsZTd3q93F8vmp3PU/ZncnKT+ojnuzVK1fcMsdf8Vu3uvw2n7/Js+2j7+ps9W4t67JPfPZPcBmm1l1q3X4VQ+34Zi/2HA/vSR4/lckt6+IMIyygPLeyJ334jbH4k2arD7+985nJ1n90+bYvzudeW9jLLr0mPIz7dlsmGW5Gab8G3LNKN5n683X2peyW/aVHm+Bv9OZLtV4K1X7Lal9vfeWtxr3HtrUXeL9/feWlTt2+cqt95a3B7H3Sbddm1OOR+93N6NnEI1cylN3h3yVYic2t8OwJoPm5bkJnK204GnBbz27owi3/PvspHYzlyfPmv9XC7283yxf74e0D9fD+jjD5W4uSnFvkGzbObRtvKyQef4+C589ymp23fhu4KX2ysKu/39LG8DxvNmYz/vJrPTmCOfyTwew5e3NKxkfaY9b772s4aO/ulA3x9GFrxZ3eyKu9Wo3LJWs82p2B96Ko3U0ez15pw6yx96GJLbppoeu8P4uExlL3Ev/cyPy1Rsu5rxlH02e53uvrdy71Z3q3DrTtfq5ze6W42797lWvuE+t3zDfa59/qEUtY8/lLKVuHmfe/tMNve55Rvuc3dr3Xfvc8t33OeW77jPLd9xn1u+4z63fM99bvme+9zyPfe55Tvuc8t33OeWz+9zyzfc55bP73P79onVrfvcvh32N+9z+3c06Xfc55bvuc8t33OfW77lPnc7F7h1m7ufTdy5yx366f1Ur99wP9XrN9xPbXdA6PkCUHtu0fIFjcd4z+fe7Xkf2a9oSNZDyw/vl/+ksd2KYdT8GM08XhcjzI83H5gfbz4wv2HzgfkNmw/09g2z1W39UZ9U/M7jZafsNKo9f4y2vqcxc5rYjvr6OPr2MdXdsN0Vt95eBtmWDOfmre3Qujmb7QYANz+4sK+G4itS4/VH6D0qXs9Yb31voUv5+Iam7x5V3buh2Urcu6Hpu49Q3XzTte/2G7r3vYW++wLV3e8t3O+VsemV7ei49b2FrcbN7y38SuP4WOPe9xa63n2gqu+16c3vLfxC49b3Frp+/gXKX2jcuvHen8u97y10nX/0cdz63sJ9jTdj7ub3Fvr2vaOb31v4xWC/OUDqH9wx97630He1nXe/t/CLA7n1vYXe58c3ytva9Ls3yn1+eqP8qznMre8t9O/4zsFW5Gb98C9O5uZxbKeG82lviTfvgm7dZe/vgm7dZR+fHsP+LY5bz7P37/exIKvz+YbwKy8Jdt407NbeFJn5Gc76vJH/F980fLptqK9PR7aPcW++rrgVufddgr3Ere8S/ELi1ncJtv3C5wDXwvubnfuDiLwrUhFpr/ul28cPUPcSt55cdmt/qMTN2ot9g1ItPMZ8t1cyHddh72aQ5yN5W2TmVOqBb4vwYYKtyPY9/5u1Svppbv/FriWpYbW/ufFJTnGtjpev1tWPr3L105bYb++TrxvoeF61+IoGe+ro82dvv7ZFUC6sP/DNbYbm4Dje3e5oZq8+5N7d7ujpnkPebo+Jxut+2W4hpfPp2+r1GzTe24ZKWPSU50XPL2mwo4aMzRjba3DvM8drjVF2Bf6Wk5d5HK/fihll9yZqzwoy6aYvn4b96khGHsnm/ZyxexilPSdS2p8WlL5wHJMN8OfRx+Y42nb5NZr1cdHUjcjuVb98B/35ufp6Y+j2ELG81Zfdzjxj96bR7SFSxzcMkV8cyc0hYh8Pkd1x3B4iv/jS1L0h0uofOUT0yCeN+uP+JD8Nkbb7vEnN3fy1Pl+q5k8au2nQqLnlwnje4Gt+4Vyy4FHLUTfnMr7hXOYfey4s0T/wvaudtixa0ib9PY3KcdTxDRrzePNcslhJnz/l8bXjYMOVdrzdpkab6psagkbfbMq53SU8X/GtVZ/n2z8+rRzy8Xcn9hK37m+HHn+oxL1b5G17Nra/auP1juljtyHfvX10dkch3GKLzc1R6OcZbPeW1M0Mtt+DvlIyWfXluew1lO939dftIbu34e9uhr8VubnKt5W4t8q3l7izyrf92MKtu/T95xru3KW3j9fk28dr8vvPGN39RO4vVG5+IbeNb/lC7lbm3hjdS9wao7+QuDNG95+Hu/lxqK3G558guz9GfvVJtZtjpH/PGOmfj5H++RjpH4+Rzz+2OfYfmrpVZzXm/kY/7gQ3dVZbiXt1VvfP5HWdxOff2vz8U5tj3q072fXI/LjM4v5xvNa4/W26l1U4wz6u4dtK3Bxb9nkN37CPa/iG7bbvEWWHpuP1pxzHbtc906ydM7XXGXTs3o56PB3J1DOettzvX2hT/57x1aZPtyvyc2X1boQ9FxK/7pW+vzDd+9bnvmduXmn3Ije/9rkXqXnH8UB5V+TeN0N/0Sb3Phq6H603vxp6X2Tz2dBfiNz7buhW5P4E5hdNe29y+PmHQ+fuHaBbWzL/oj3uzi5/JXNzejl3b3rd752tzL3p5V7i1vTyFxIfTi/LPPgaQX1+F+Cno9g9jLp3odi+y5tTmWLP32eqX5CwPIajlrckZl4lftzB/Hdt8Q2vm8z6Da+b7EK/Up5U+9yczK648bEklpHbh76qlviVSBafPdhevbIy23YSYLl0WsrrETK370bVlhfftR3o03A/bk94H0+j862352/WfWGgycivszwkNn2zexR1e6DtnkXdHWi/7ODx1MEvk+H+c7XfMUrYEr325+cev2tY294H8Gr05nnlL0QqE9++EdktCt99DDy3e/ndegy8PY67j4GnyOePgeduGfLeY+B9EihcrR78/FmUn5LA3H0tKgfr08fzpN3OAD3fXZH+vHGO/NwYu3r+e3uKTD0+XhqaWj69fd9K3Lt9v38mr5eG9i16b0+R+Q2vNv3iOKjYPMp4fRy7vdBuvTAyd29H3d3aZC9yc2uTrcjdrU32R3Jza5O9SC08jt4dSd/vj5Iqi1/v8vArmZvbrPxC5u42K7+SubnNyr6Bb26zshe5uc3KNoLuveq0DeSb26zsNe5tszK373/cSwbbD03dfHtsexw3m3Tftfe2WfnFWL27zcovZO5us/IrmZvbrBwfL1/P3Q4U95av53Y3v5uvoG/3FWJrgfJcxqDHFySE6be8J8EbYPVpHf53k83t96Yq9U/HmxL5Vm9/mjV/5USed+F/+gbGVyR6LkX++DbcFyRGYY1o1xb2R4uUzo1zf35F6EsiIyugyrD6pogdfMSzvtczNU/mMR15L1ZaVqU9Rkp57yh40fG53vALEjK5NDx/77LcXvF6pPHs1yLznYMopfNp9flWtJWW8frA945CKys7Mt6T6NwMTXvvRBicrb53Io2PmDZ960RG3ggN6e8ImLA17HsncWSB4OOy+npM2G6b7s9Htx1sGvxeQ+TQtqEftuR7AvdqV7ejOl9qKs/Lez9/Cmab/Pn6cm/2lsTMUs3y3JdfkbDBt1KP8o7EY4Gx8bCivXUUPNpbHyp+T8L4Wnl560QeiZYdNuy9o2g5VStyyFsS8rSLw/Pq5E8StnsZ6huuYS0XsEsb7zWGHHkmz0Xm77bnexKt8mChPi8FWLkvkVsUtud90t+VeLrh/JJEXklbfcp7X5FoeTPyoOMtCcnnvO2HoqCvHEXPHvlhaL0r8V6nshLRnqdHX2oLNsSQ9l6nSmO7pTbekyjsPqVvdmpn15f+1lGs78RzGyJvSTx9rn4+l0b9JGG7h0yPRQu+s9ifMt/8wlW1clXV984kX718LKDP9yQ65RDvBUmZueT3uL8rb54IS21H/ViivHsUA4m3ov1xPactZHx8FD936v98/O+f/vUv//iXv/79X//0H3/5+9/+/fGb/73E/vGXP/2vv/75+t//859/+9env/2P//ff4m/+1z/+8te//uX//su//ePv//rn//2f//jzUlp/99tx/ed/jOOxHj0ed5T/859+K+v/10xhPK7vj/9v/vePEHz8I//79Qt9bcbRSz3WH/hvrD94/Gf8z/9eh/z/AQ=="
     }
   ],
   "outputs": {
@@ -3353,51 +3353,55 @@
     }
   },
   "file_map": {
-    "104": {
+    "100": {
+      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/aztec.nr",
+      "source": "use crate::macros::{\n    calls_generation::{\n        external_functions::{\n            generate_external_function_calls, generate_external_function_self_calls_structs,\n        },\n        internal_functions::generate_call_internal_struct,\n    },\n    dispatch::generate_public_dispatch,\n    internals_functions_generation::{create_fn_abi_exports, process_functions},\n    notes::NOTES,\n    storage::STORAGE_LAYOUT_NAME,\n    utils::{\n        get_trait_impl_method, is_fn_contract_library_method, is_fn_external, is_fn_internal,\n        is_fn_test, module_has_storage,\n    },\n};\n\n/// Marks a contract as an Aztec contract, generating the interfaces for its functions and notes, as well as injecting\n/// the `sync_private_state` utility function.\n/// Note: This is a module annotation, so the returned quote gets injected inside the module (contract) itself.\npub comptime fn aztec(m: Module) -> Quoted {\n    // Functions that don't have #[external(...)], #[contract_library_method], or #[test] are not allowed in contracts.\n    check_each_fn_macroified(m);\n\n    // We generate new functions prefixed with `__aztec_nr_internals__` and we replace the original functions' bodies\n    // with `static_assert(false, ...)` to prevent them from being called directly from within the contract.\n    let functions = process_functions(m);\n\n    // We generate structs and their implementations necessary for convenient functions calls.\n    let interface = generate_contract_interface(m);\n    let self_call_structs = generate_external_function_self_calls_structs(m);\n    let call_internal_struct = generate_call_internal_struct(m);\n\n    // We generate ABI exports for all the external functions in the contract.\n    let fn_abi_exports = create_fn_abi_exports(m);\n\n    // We generate `_compute_note_hash_and_nullifier`, `sync_private_state` and `process_message`\n    // functions only if they are not already implemented. If they are implemented we just insert empty\n    // quotes.\n    let contract_library_method_compute_note_hash_and_nullifier = if !m.functions().any(|f| {\n        f.name() == quote { _compute_note_hash_and_nullifier }\n    }) {\n        generate_contract_library_method_compute_note_hash_and_nullifier()\n    } else {\n        quote {}\n    };\n    let sync_private_state_fn_and_abi_export = if !m.functions().any(|f| {\n        f.name() == quote { sync_private_state }\n    }) {\n        generate_sync_private_state()\n    } else {\n        quote {}\n    };\n\n    let process_message_fn_and_abi_export = if !m.functions().any(|f| {\n        f.name() == quote { process_message }\n    }) {\n        generate_process_message()\n    } else {\n        quote {}\n    };\n    let public_dispatch = generate_public_dispatch(m);\n\n    quote {\n        $interface\n        $self_call_structs\n        $call_internal_struct\n        $functions\n        $fn_abi_exports\n        $contract_library_method_compute_note_hash_and_nullifier\n        $public_dispatch\n        $sync_private_state_fn_and_abi_export\n        $process_message_fn_and_abi_export\n    }\n}\n\ncomptime fn generate_contract_interface(m: Module) -> Quoted {\n    let calls = generate_external_function_calls(m);\n\n    let module_name = m.name();\n\n    let has_storage_layout = module_has_storage(m) & STORAGE_LAYOUT_NAME.get(m).is_some();\n    let storage_layout_getter = if has_storage_layout {\n        let storage_layout_name = STORAGE_LAYOUT_NAME.get(m).unwrap();\n        quote {\n            pub fn storage_layout() -> StorageLayoutFields {\n                $storage_layout_name.fields\n            }\n        }\n    } else {\n        quote {}\n    };\n\n    let library_storage_layout_getter = if has_storage_layout {\n        quote {\n            #[contract_library_method]\n            $storage_layout_getter\n        }\n    } else {\n        quote {}\n    };\n\n    quote {\n        pub struct $module_name {\n            pub target_contract: dep::aztec::protocol_types::address::AztecAddress\n        }\n\n        impl $module_name {\n            $calls\n\n            pub fn at(\n                addr: aztec::protocol_types::address::AztecAddress\n            ) -> Self {\n                Self { target_contract: addr }\n            }\n\n            pub fn interface() -> Self {\n                Self { target_contract: aztec::protocol_types::address::AztecAddress::zero() }\n            }\n\n            $storage_layout_getter\n        }\n\n        #[contract_library_method]\n        pub fn at(\n            addr: aztec::protocol_types::address::AztecAddress\n        ) -> $module_name {\n            $module_name { target_contract: addr }\n        }\n\n        #[contract_library_method]\n        pub fn interface() -> $module_name {\n            $module_name { target_contract: aztec::protocol_types::address::AztecAddress::zero() }\n        }\n\n        $library_storage_layout_getter\n\n    }\n}\n\n/// Generates a contract library method called `_compute_note_hash_and_nullifier` which is used for note\n/// discovery (to create the `aztec::messages::discovery::ComputeNoteHashAndNullifier` function) and to implement the\n/// `compute_note_hash_and_nullifier` unconstrained contract function.\ncomptime fn generate_contract_library_method_compute_note_hash_and_nullifier() -> Quoted {\n    if NOTES.len() > 0 {\n        // Contracts that do define notes produce an if-else chain where `note_type_id` is matched against the\n        // `get_note_type_id()` function of each note type that we know of, in order to identify the note type. Once we\n        // know it we call we correct `unpack` method from the `Packable` trait to obtain the underlying note type, and\n        // compute the note hash (non-siloed) and inner nullifier (also non-siloed).\n\n        let mut if_note_type_id_match_statements_list = &[];\n        for i in 0..NOTES.len() {\n            let typ = NOTES.get(i);\n\n            let get_note_type_id = get_trait_impl_method(\n                typ,\n                quote { crate::note::note_interface::NoteType },\n                quote { get_id },\n            );\n            let unpack = get_trait_impl_method(\n                typ,\n                quote { crate::protocol_types::traits::Packable },\n                quote { unpack },\n            );\n\n            let compute_note_hash = get_trait_impl_method(\n                typ,\n                quote { crate::note::note_interface::NoteHash },\n                quote { compute_note_hash },\n            );\n\n            let compute_nullifier_unconstrained = get_trait_impl_method(\n                typ,\n                quote { crate::note::note_interface::NoteHash },\n                quote { compute_nullifier_unconstrained },\n            );\n\n            let if_or_else_if = if i == 0 {\n                quote { if }\n            } else {\n                quote { else if }\n            };\n\n            if_note_type_id_match_statements_list = if_note_type_id_match_statements_list.push_back(\n                quote {\n                    $if_or_else_if note_type_id == $get_note_type_id() {\n                        // As an extra safety check we make sure that the packed_note BoundedVec has the expected\n                        // length, since we're about to interpret its raw storage as a fixed-size array by calling the\n                        // unpack function on it.\n                        let expected_len = <$typ as $crate::protocol_types::traits::Packable>::N;\n                        let actual_len = packed_note.len();\n                        assert(\n                            actual_len == expected_len,\n                            f\"Expected packed note of length {expected_len} but got {actual_len} for note type id {note_type_id}\"\n                        );\n\n                        let note = $unpack(aztec::utils::array::subarray(packed_note.storage(), 0));\n\n                        let note_hash = $compute_note_hash(note, owner, storage_slot, randomness);\n    \n                        // The message discovery process finds settled notes, that is, notes that were created in prior\n                        // transactions and are therefore already part of the note hash tree. We therefore compute the\n                        // nullification note hash by treating the note as a settled note with the provided note nonce.\n                        let note_hash_for_nullification = aztec::note::utils::compute_note_hash_for_nullification(\n                            aztec::note::retrieved_note::RetrievedNote{ \n                                note,\n                                contract_address,\n                                owner,\n                                randomness,\n                                storage_slot,\n                                metadata: aztec::note::note_metadata::SettledNoteMetadata::new(note_nonce).into()\n                            }\n                        );\n\n                        let inner_nullifier = $compute_nullifier_unconstrained(note, owner, note_hash_for_nullification);\n\n                        Option::some(\n                            aztec::messages::discovery::NoteHashAndNullifier {\n                                note_hash, inner_nullifier\n                            }\n                        )\n                    }\n                },\n            );\n        }\n\n        let if_note_type_id_match_statements = if_note_type_id_match_statements_list.join(quote {});\n\n        quote {\n            /// Unpacks an array into a note corresponding to `note_type_id` and then computes its note hash\n            /// (non-siloed) and inner nullifier (non-siloed) assuming the note has been inserted into the note hash\n            /// tree with `note_nonce`.\n            ///\n            /// The signature of this function notably matches the `aztec::messages::discovery::ComputeNoteHashAndNullifier` type,\n            /// and so it can be used to call functions from that module such as `discover_new_messages`, \n            /// `do_process_message` and `attempt_note_discovery`.\n            ///\n            /// This function is automatically injected by the `#[aztec]` macro.\n            #[contract_library_method]\n            unconstrained fn _compute_note_hash_and_nullifier(\n                packed_note: BoundedVec<Field, aztec::messages::discovery::private_notes::MAX_NOTE_PACKED_LEN>,\n                owner: aztec::protocol_types::address::AztecAddress,\n                storage_slot: Field,\n                note_type_id: Field,\n                contract_address: aztec::protocol_types::address::AztecAddress,\n                randomness: Field,\n                note_nonce: Field,\n            ) -> Option<aztec::messages::discovery::NoteHashAndNullifier> {\n                $if_note_type_id_match_statements\n                else {\n                    Option::none()\n                }\n            }\n        }\n    } else {\n        // Contracts with no notes still implement this function to avoid having special-casing, the implementation\n        // simply throws immediately.\n        quote {\n            /// This contract does not use private notes, so this function should never be called as it will\n            /// unconditionally fail.\n            ///\n            /// This function is automatically injected by the `#[aztec]` macro.\n            #[contract_library_method]\n            unconstrained fn _compute_note_hash_and_nullifier(\n                _packed_note: BoundedVec<Field, aztec::messages::discovery::private_notes::MAX_NOTE_PACKED_LEN>,\n                _owner: aztec::protocol_types::address::AztecAddress,\n                _storage_slot: Field,\n                _note_type_id: Field,\n                _contract_address: aztec::protocol_types::address::AztecAddress,\n                _randomness: Field,\n                _nonce: Field,\n            ) -> Option<aztec::messages::discovery::NoteHashAndNullifier> {\n                panic(f\"This contract does not use private notes\")\n            }\n        }\n    }\n}\n\ncomptime fn generate_sync_private_state() -> Quoted {\n    quote {\n        pub struct sync_private_state_parameters {}\n\n        #[abi(functions)]\n        pub struct sync_private_state_abi {\n            parameters: sync_private_state_parameters,\n        }\n\n        #[aztec::macros::internals_functions_generation::abi_attributes::abi_utility]\n        unconstrained fn sync_private_state() {\n            let address = aztec::context::utility_context::UtilityContext::new().this_address();\n            \n            aztec::messages::discovery::discover_new_messages(address, _compute_note_hash_and_nullifier);\n        }\n    }\n}\n\ncomptime fn generate_process_message() -> Quoted {\n    quote {\n        pub struct process_message_parameters {\n            pub message_ciphertext: BoundedVec<Field, aztec::messages::encoding::MESSAGE_CIPHERTEXT_LEN>,\n            pub message_context: aztec::messages::processing::message_context::MessageContext,\n        }\n\n        #[abi(functions)]\n        pub struct process_message_abi {\n            parameters: process_message_parameters,\n        }\n\n        #[aztec::macros::internals_functions_generation::abi_attributes::abi_utility]\n        unconstrained fn process_message(\n            message_ciphertext: BoundedVec<Field, aztec::messages::encoding::MESSAGE_CIPHERTEXT_LEN>,\n            message_context: aztec::messages::processing::message_context::MessageContext,\n        ) {\n            let address = aztec::context::utility_context::UtilityContext::new().this_address();\n\n            aztec::messages::discovery::discover_new_messages(address, _compute_note_hash_and_nullifier);     \n            aztec::messages::discovery::process_message::process_message_ciphertext(\n                address,\n                _compute_note_hash_and_nullifier,\n                message_ciphertext,\n                message_context,\n            );\n        }\n    }\n}\n\n/// Checks if each function in the module is marked with either #[external(...)], #[contract_library_method], or #[test].\n/// Non-macroified functions are not allowed in contracts.\ncomptime fn check_each_fn_macroified(m: Module) {\n    for f in m.functions() {\n        let name = f.name();\n        if !is_fn_external(f)\n            & !is_fn_contract_library_method(f)\n            & !is_fn_internal(f)\n            & !is_fn_test(f) {\n            // We  don't suggest that #[contract_library_method] is allowed because we don't want to introduce another\n            // concept\n            panic(\n                f\"Function {name} must be marked as either #[external(...)], #[internal(...)], or #[test]\",\n            );\n        }\n    }\n}\n"
+    },
+    "105": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/dispatch.nr",
       "source": "use crate::macros::internals_functions_generation::external_functions_registry::get_public_functions;\nuse super::utils::compute_fn_selector;\nuse poseidon::poseidon2::Poseidon2Hasher;\nuse protocol_types::meta::utils::get_params_len_quote;\nuse std::{collections::umap::UHashMap, hash::BuildHasherDefault, 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 = get_public_functions(m);\n\n    let unit = get_type::<()>();\n\n    let seen_selectors =\n        &mut UHashMap::<Field, Quoted, BuildHasherDefault<Poseidon2Hasher>>::default();\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        let fn_name = function.name();\n\n        // Since function selectors are computed as the first 4 bytes of the hash of the function signature,\n        // it's possible to have collisions. With the following check, we ensure it doesn't happen within\n        // the same contract.\n        if seen_selectors.contains_key(selector) {\n            let existing_fn = seen_selectors.get(selector).unwrap();\n            panic(\n                f\"Public function selector collision detected between functions '{fn_name}' and '{existing_fn}'\",\n            );\n        }\n        seen_selectors.insert(selector, fn_name);\n\n        let params_len_quote = get_params_len_quote(parameters);\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; $params_len_quote] = dep::aztec::context::public_context::calldata_copy(1, $params_len_quote);\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        // We call a function whose name is prefixed with `__aztec_nr_internals__`. This is necessary because the\n        // original function is intentionally made uncallable, preventing direct invocation within the contract.\n        // Instead, a new function with the same name, but prefixed by `__aztec_nr_internals__`, has been generated to\n        // be called here. For more details see the `process_functions` function.\n        let name = f\"__aztec_nr_internals__{fn_name}\".quoted_contents();\n        let args = args.join(quote { , });\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 functions having this attribute.\n            #[aztec::macros::internals_functions_generation::abi_attributes::abi_public]\n            pub unconstrained fn public_dispatch(selector: Field) {\n                $dispatch\n            }\n        };\n\n        body\n    }\n}\n\ncomptime fn get_type<T>() -> Type {\n    let t: T = std::mem::zeroed();\n    std::meta::type_of(t)\n}\n"
     },
-    "113": {
+    "114": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/internals_functions_generation/external/private.nr",
       "source": "use crate::macros::{\n    internals_functions_generation::external::helpers::{\n        create_authorize_once_check, create_message_discovery_call, get_abi_relevant_attributes,\n    },\n    notes::NOTES,\n    utils::{\n        fn_has_authorize_once, fn_has_noinitcheck, fn_has_nophasecheck, is_fn_initializer,\n        is_fn_only_self, is_fn_view, module_has_initializer, module_has_storage,\n    },\n};\nuse protocol_types::meta::utils::derive_serialization_quotes;\nuse std::meta::{ctstring::AsCtString, type_of};\n\npub(crate) comptime fn generate_private_external(f: FunctionDefinition) -> Quoted {\n    let module_has_initializer = module_has_initializer(f.module());\n    let module_has_storage = module_has_storage(f.module());\n\n    // Private functions undergo a lot of transformations from their Aztec.nr form into a circuit that can be fed to the\n    // Private Kernel Circuit.\n    // First we change the function signature so that it also receives `PrivateContextInputs`, which contain information\n    // about the execution context (e.g. the caller).\n    let original_params = f.parameters();\n\n    let original_params_quotes = original_params\n        .map(|(param_name, param_type)| quote { $param_name: $param_type })\n        .join(quote {, });\n\n    let params = quote { inputs: aztec::context::inputs::private_context_inputs::PrivateContextInputs, $original_params_quotes };\n\n    let mut body = f.body().as_block().unwrap();\n\n    // The original params are hashed and passed to the `context` object, so that the kernel can verify we've received\n    // the correct values.\n    let (args_serialization, _, serialized_args_name) =\n        derive_serialization_quotes(original_params, false);\n\n    let storage_init = if module_has_storage {\n        // Contract has Storage defined so we initialize it.\n        quote {\n            let storage = Storage::init(&mut context);\n        }\n    } else {\n        // Contract does not have Storage defined, so we set storage to the unit type `()`. ContractSelf requires a\n        // storage struct in its constructor. Using an Option type would lead to worse developer experience and higher\n        // constraint counts so we use the unit type `()` instead.\n        quote {\n            let storage = ();\n        }\n    };\n\n    let contract_self_creation = quote {\n        #[allow(unused_variables)]\n        let mut self = {\n            $args_serialization\n            let args_hash = aztec::hash::hash_args($serialized_args_name);\n            let mut context = aztec::context::private_context::PrivateContext::new(inputs, args_hash);\n            $storage_init\n            let self_address = context.this_address();\n            let call_self: CallSelf<&mut aztec::context::private_context::PrivateContext> = CallSelf { address: self_address, context: &mut context };\n            let enqueue_self: EnqueueSelf<&mut aztec::context::private_context::PrivateContext> = EnqueueSelf { address: self_address, context: &mut context };\n            let call_self_static: CallSelfStatic<&mut aztec::context::private_context::PrivateContext> = CallSelfStatic { address: self_address, context: &mut context };\n            let enqueue_self_static: EnqueueSelfStatic<&mut aztec::context::private_context::PrivateContext> = EnqueueSelfStatic { address: self_address, context: &mut context };\n            let internal: CallInternal<&mut aztec::context::private_context::PrivateContext> = CallInternal { context: &mut context };\n            aztec::contract_self::ContractSelf::new_private(&mut context, storage, call_self, enqueue_self, call_self_static, enqueue_self_static, internal)\n        };\n    };\n\n    let original_function_name = f.name();\n\n    // Modifications introduced by the different marker attributes.\n    let internal_check = if is_fn_only_self(f) {\n        let assertion_message =\n            f\"Function {original_function_name} can only be called by the same contract\";\n        quote { assert(self.msg_sender().unwrap() == self.address, $assertion_message); }\n    } else {\n        quote {}\n    };\n\n    let view_check = if is_fn_view(f) {\n        let assertion_message = f\"Function {original_function_name} can only be called statically\"\n            .as_ctstring()\n            .as_quoted_str();\n        quote { assert(self.context.inputs.call_context.is_static_call, $assertion_message); }\n    } else {\n        quote {}\n    };\n\n    let (assert_initializer, mark_as_initialized) = if is_fn_initializer(f) {\n        (\n            quote { aztec::macros::functions::initialization_utils::assert_initialization_matches_address_preimage_private(*self.context); },\n            quote { aztec::macros::functions::initialization_utils::mark_as_initialized_private(self.context); },\n        )\n    } else {\n        (quote {}, quote {})\n    };\n\n    // Initialization checks are not included in contracts that don't have initializers.\n    let init_check = if module_has_initializer & !is_fn_initializer(f) & !fn_has_noinitcheck(f) {\n        quote { aztec::macros::functions::initialization_utils::assert_is_initialized_private(self.context); }\n    } else {\n        quote {}\n    };\n\n    // Phase checks are skipped in functions that request to manually handle phases\n    let initial_phase_store = if fn_has_nophasecheck(f) {\n        quote {}\n    } else {\n        quote { let within_revertible_phase: bool = self.context.in_revertible_phase(); }\n    };\n\n    let no_phase_change_check = if fn_has_nophasecheck(f) {\n        quote {}\n    } else {\n        quote {   \n            assert_eq(\n                within_revertible_phase,\n                self.context.in_revertible_phase(),\n                f\"Phase change detected on function with phase check. If this is expected, use #[nophasecheck]\",\n            ); \n        }\n    };\n\n    // All private functions perform message discovery, since they may need to access notes. This is slightly\n    // inefficient and could be improved by only doing it once we actually attempt to read any. Note that the message\n    // discovery call syncs private events as well. We do not sync those here if there are no notes because we don't\n    // have an API that would access events from private functions.\n    let message_discovery_call = if NOTES.len() > 0 {\n        create_message_discovery_call()\n    } else {\n        quote {}\n    };\n\n    // Inject the authwit check if the function is marked with #[authorize_once].\n    let authorize_once_check = if fn_has_authorize_once(f) {\n        create_authorize_once_check(f, true)\n    } else {\n        quote {}\n    };\n\n    // Finally, we need to change the return type to be `PrivateCircuitPublicInputs`, which is what the Private Kernel\n    // circuit expects.\n    let return_value_var_name = quote { macro__returned__values };\n\n    let return_value_type = f.return_type();\n    let return_value = if body.len() == 0 {\n        quote {}\n    } else if return_value_type != type_of(()) {\n        // The original return value is serialized and hashed before being passed to the context.\n        let (body_without_return, last_body_expr) = body.pop_back();\n        let return_value = last_body_expr.quoted();\n        let return_value_assignment =\n            quote { let $return_value_var_name: $return_value_type = $return_value; };\n\n        let (return_serialization, _, serialized_return_name) =\n            derive_serialization_quotes([(return_value_var_name, return_value_type)], false);\n\n        body = body_without_return;\n\n        quote {\n            $return_value_assignment\n            $return_serialization\n            self.context.set_return_hash($serialized_return_name);\n        }\n    } else {\n        let (body_without_return, last_body_expr) = body.pop_back();\n        if !last_body_expr.has_semicolon()\n            & last_body_expr.as_for().is_none()\n            & last_body_expr.as_assert().is_none()\n            & last_body_expr.as_for_range().is_none()\n            & last_body_expr.as_assert_eq().is_none()\n            & last_body_expr.as_let().is_none() {\n            let unused_return_value_name = f\"_{return_value_var_name}\".quoted_contents();\n            body = body_without_return.push_back(\n                quote { let $unused_return_value_name = $last_body_expr; }.as_expr().unwrap(),\n            );\n        }\n        quote {}\n    };\n\n    let context_finish = quote { self.context.finish() };\n\n    // Preserve all attributes that are relevant to the function's ABI.\n    let abi_relevant_attributes = get_abi_relevant_attributes(f);\n\n    let fn_name = f\"__aztec_nr_internals__{original_function_name}\".quoted_contents();\n\n    let to_prepend = quote {\n        dep::aztec::oracle::version::assert_compatible_oracle_version();\n        $contract_self_creation\n        $initial_phase_store\n        $assert_initializer\n        $init_check\n        $internal_check\n        $view_check\n        $message_discovery_call\n        $authorize_once_check\n    };\n\n    let body_quote = body.map(|expr| expr.quoted()).join(quote { });\n\n    let to_append = quote {\n        $return_value\n        $mark_as_initialized\n        $no_phase_change_check\n        $context_finish\n    };\n\n    quote {\n        #[aztec::macros::internals_functions_generation::abi_attributes::abi_private]\n        $abi_relevant_attributes\n        fn $fn_name($params) -> return_data aztec::protocol_types::abis::private_circuit_public_inputs::PrivateCircuitPublicInputs {\n            $to_prepend\n            $body_quote\n            $to_append\n        }\n    }\n}\n"
     },
-    "114": {
+    "115": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/internals_functions_generation/external/public.nr",
       "source": "use crate::macros::{\n    internals_functions_generation::external::helpers::{\n        create_authorize_once_check, get_abi_relevant_attributes,\n    },\n    utils::{\n        fn_has_authorize_once, fn_has_noinitcheck, is_fn_initializer, is_fn_only_self, is_fn_view,\n        module_has_initializer, module_has_storage,\n    },\n};\nuse std::meta::ctstring::AsCtString;\n\npub(crate) comptime fn generate_public_external(f: FunctionDefinition) -> Quoted {\n    let module_has_initializer = module_has_initializer(f.module());\n    let module_has_storage = module_has_storage(f.module());\n\n    // Public functions undergo a lot of transformations from their Aztec.nr form.\n    let original_params = f.parameters();\n\n    let args_len_quote = if original_params.len() == 0 {\n        // If the function has no parameters, we set the args_len to 0.\n        quote { 0 }\n    } else {\n        // The following will give us <type_of_struct_member_1 as Serialize>::N + <type_of_struct_member_2 as Serialize>::N + ...\n        original_params\n            .map(|(_, param_type): (Quoted, Type)| {\n                quote {\n            <$param_type as $crate::protocol_types::traits::Serialize>::N\n        }\n            })\n            .join(quote {+})\n    };\n\n    let storage_init = if module_has_storage {\n        quote {\n            let storage = Storage::init(context);\n        }\n    } else {\n        // Contract does not have Storage defined, so we set storage to the unit type `()`. ContractSelf requires a\n        // storage struct in its constructor. Using an Option type would lead to worse developer experience and higher\n        // constraint counts so we use the unit type `()` instead.\n        quote {\n            let storage = ();\n        }\n    };\n\n    // Unlike in the private case, in public the `context` does not need to receive the hash of the original params.\n    let contract_self_creation = quote {\n        #[allow(unused_variables)]\n        let mut self = {\n            let context = dep::aztec::context::public_context::PublicContext::new(|| {\n            // We start from 1 because we skip the selector for the dispatch function.\n            let serialized_args : [Field; $args_len_quote] = dep::aztec::context::public_context::calldata_copy(1, $args_len_quote);\n            dep::aztec::hash::hash_args(serialized_args)\n            });\n            $storage_init\n            let self_address = context.this_address();\n            let call_self: CallSelf<aztec::context::public_context::PublicContext> = CallSelf { address: self_address, context };\n            let call_self_static: CallSelfStatic<aztec::context::public_context::PublicContext> = CallSelfStatic { address: self_address, context };\n            let internal: CallInternal<aztec::context::public_context::PublicContext> = CallInternal { context };\n            aztec::contract_self::ContractSelf::new_public(context, storage, call_self, call_self_static, internal)\n        };\n    };\n\n    let original_function_name = f.name();\n\n    // Modifications introduced by the different marker attributes.\n    let internal_check = if is_fn_only_self(f) {\n        let assertion_message =\n            f\"Function {original_function_name} can only be called by the same contract\";\n        quote { assert(self.msg_sender().unwrap() == self.address, $assertion_message); }\n    } else {\n        quote {}\n    };\n\n    let view_check = if is_fn_view(f) {\n        let assertion_message = f\"Function {original_function_name} can only be called statically\"\n            .as_ctstring()\n            .as_quoted_str();\n        quote { assert(self.context.is_static_call(), $assertion_message); }\n    } else {\n        quote {}\n    };\n\n    let (assert_initializer, mark_as_initialized) = if is_fn_initializer(f) {\n        (\n            quote { aztec::macros::functions::initialization_utils::assert_initialization_matches_address_preimage_public(self.context); },\n            quote { aztec::macros::functions::initialization_utils::mark_as_initialized_public(self.context); },\n        )\n    } else {\n        (quote {}, quote {})\n    };\n\n    // Initialization checks are not included in contracts that don't have initializers.\n    let init_check = if module_has_initializer & !fn_has_noinitcheck(f) & !is_fn_initializer(f) {\n        quote { aztec::macros::functions::initialization_utils::assert_is_initialized_public(self.context); }\n    } else {\n        quote {}\n    };\n\n    // Inject the authwit check if the function is marked with #[authorize_once].\n    let authorize_once_check = if fn_has_authorize_once(f) {\n        create_authorize_once_check(f, false)\n    } else {\n        quote {}\n    };\n\n    let to_prepend = quote {\n        $contract_self_creation\n        $assert_initializer\n        $init_check\n        $internal_check\n        $view_check\n        $authorize_once_check\n    };\n\n    let to_append = quote {\n        $mark_as_initialized\n    };\n\n    let fn_name = f\"__aztec_nr_internals__{original_function_name}\".quoted_contents();\n    let body = f.body();\n    let return_type = f.return_type();\n\n    // New function parameters are the same as the original function's ones.\n    let params = original_params\n        .map(|(param_name, param_type)| quote { $param_name: $param_type })\n        .join(quote {, });\n\n    // Preserve all attributes that are relevant to the function's ABI.\n    let abi_relevant_attributes = get_abi_relevant_attributes(f);\n\n    // All public functions are automatically made unconstrained, even if they were not marked as such. This is because\n    // instead of compiling into a circuit, they will compile to bytecode that will be later transpiled into AVM\n    // bytecode.\n    quote {\n        #[aztec::macros::internals_functions_generation::abi_attributes::abi_public]\n        $abi_relevant_attributes\n        unconstrained fn $fn_name($params) -> pub $return_type {\n            $to_prepend\n            $body\n            $to_append\n        }\n    }\n}\n"
     },
-    "124": {
+    "125": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/mod.nr",
       "source": "use protocol_types::{address::AztecAddress, debug_log::{debug_log, debug_log_format}};\n\npub mod nonce_discovery;\npub mod partial_notes;\npub mod private_events;\npub mod private_notes;\npub mod process_message;\n\nuse crate::{\n    messages::{\n        discovery::{\n            private_notes::MAX_NOTE_PACKED_LEN, process_message::process_message_ciphertext,\n        },\n        processing::{\n            get_private_logs, pending_tagged_log::PendingTaggedLog,\n            validate_enqueued_notes_and_events,\n        },\n    },\n    utils::array,\n};\n\npub struct NoteHashAndNullifier {\n    /// The result of NoteHash::compute_note_hash\n    pub note_hash: Field,\n    /// The result of NoteHash::compute_nullifier_unconstrained (since all of message discovery is unconstrained)\n    pub inner_nullifier: Field,\n}\n\n/// A function which takes a note's packed content, address of the emitting contract, note nonce, storage slot and note\n/// type ID and attempts to compute its note hash (not hashed by note nonce nor siloed by address) and inner nullifier\n/// (not siloed by address).\n///\n/// This function must be user-provided as its implementation requires knowledge of how note type IDs are allocated in a\n/// contract. The `#[aztec]` macro automatically creates such a contract library method called\n/// `_compute_note_hash_and_nullifier`, which looks something like this:\n///\n/// ```\n/// |packed_note, owner, storage_slot, note_type_id, contract_address, randomness, note_nonce| {\n///     if note_type_id == MyNoteType::get_id() {\n///         assert(packed_note.len() == MY_NOTE_TYPE_SERIALIZATION_LENGTH);\n///\n///         let note = MyNoteType::unpack(aztec::utils::array::subarray(packed_note.storage(), 0));\n///\n///         let note_hash = note.compute_note_hash(owner, storage_slot, randomness);\n///         let note_hash_for_nullification = aztec::note::utils::compute_note_hash_for_nullification(\n///             RetrievedNote{ note, contract_address, metadata: SettledNoteMetadata::new(note_nonce).into() },\n///             storage_slot\n///         );\n///\n///         let inner_nullifier = note.compute_nullifier_unconstrained(owner, note_hash_for_nullification);\n///\n///         Option::some(\n///             aztec::messages::discovery::NoteHashAndNullifier {\n///                 note_hash, inner_nullifier\n///             }\n///         )\n///     } else if note_type_id == MyOtherNoteType::get_id() {\n///           ... // Similar to above but calling MyOtherNoteType::unpack_content\n///     } else {\n///         Option::none() // Unknown note type ID\n///     };\n/// }\n/// ```\npub type ComputeNoteHashAndNullifier<Env> = unconstrained fn[Env](/* packed_note */BoundedVec<Field, MAX_NOTE_PACKED_LEN>, /* owner */ AztecAddress, /* storage_slot */ Field, /* note_type_id */ Field, /* contract_address */ AztecAddress, /* randomness */ Field, /* note nonce */ Field) -> Option<NoteHashAndNullifier>;\n\n/// Performs the message discovery process, in which private logs are downloaded and inspected to find new private\n/// notes, partial notes and events, etc., and pending partial notes are processed to search for their completion logs.\n/// This is the mechanism via which a contract updates its knowledge of its private state.\n///\n/// Note that the state is synchronized up to the latest block synchronized by PXE. That should be close to the chain\n/// tip as block synchronization is performed before contract function simulation is done.\n///\n/// Receives the address of the contract on which discovery is performed along with its\n/// `compute_note_hash_and_nullifier` function.\npub unconstrained fn discover_new_messages<Env>(\n    contract_address: AztecAddress,\n    compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n) {\n    debug_log(\"Performing message discovery\");\n\n    // First we process all private logs, which can contain different kinds of messages e.g. private notes, partial\n    // notes, private events, etc.\n    let mut logs = get_private_logs(contract_address);\n    logs.for_each(|i, pending_tagged_log: PendingTaggedLog| {\n        debug_log_format(\n            \"Processing log with tag {0}\",\n            [pending_tagged_log.log.get(0)],\n        );\n\n        // We remove the tag from the pending tagged log and process the message ciphertext contained in it.\n        let message_ciphertext = array::subbvec(pending_tagged_log.log, 1);\n\n        process_message_ciphertext(\n            contract_address,\n            compute_note_hash_and_nullifier,\n            message_ciphertext,\n            pending_tagged_log.context,\n        );\n        logs.remove(i);\n    });\n\n    // Then we process all pending partial notes, regardless of whether they were found in the current or previous\n    // executions.\n    partial_notes::fetch_and_process_partial_note_completion_logs(\n        contract_address,\n        compute_note_hash_and_nullifier,\n    );\n\n    // Finally we validate all notes and events that were found as part of the previous processes, resulting in them\n    // being added to PXE's database and retrievable via oracles (get_notes) and our TS API (PXE::getPrivateEvents).\n    validate_enqueued_notes_and_events(contract_address);\n}\n"
     },
-    "125": {
+    "126": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/nonce_discovery.nr",
-      "source": "use crate::messages::discovery::{ComputeNoteHashAndNullifier, private_notes::MAX_NOTE_PACKED_LEN};\n\nuse dep::protocol_types::{\n    address::AztecAddress,\n    constants::MAX_NOTE_HASHES_PER_TX,\n    debug_log::debug_log_format,\n    hash::{compute_note_hash_nonce, compute_siloed_note_hash, compute_unique_note_hash},\n    traits::ToField,\n};\n\n/// A struct with the discovered information of a complete note, required for delivery to PXE. Note that this is *not*\n/// the complete note information, since it does not include content, storage slot, etc.\npub struct DiscoveredNoteInfo {\n    pub note_nonce: Field,\n    pub note_hash: Field,\n    pub inner_nullifier: Field,\n}\n\n/// Searches for note nonces that will result in a note that was emitted in a transaction. While rare, it is possible\n/// for multiple notes to have the exact same packed content and storage slot but different nonces, resulting in\n/// different unique note hashes. Because of this this function returns a *vector* of discovered notes, though in most\n/// cases it will contain a single element.\n///\n/// Due to how nonces are computed, this function requires knowledge of the transaction in which the note was created,\n/// more specifically the list of all unique note hashes in it plus the value of its first nullifier.\npub unconstrained fn attempt_note_nonce_discovery<Env>(\n    unique_note_hashes_in_tx: BoundedVec<Field, MAX_NOTE_HASHES_PER_TX>,\n    first_nullifier_in_tx: Field,\n    compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n    contract_address: AztecAddress,\n    owner: AztecAddress,\n    storage_slot: Field,\n    randomness: Field,\n    note_type_id: Field,\n    packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n) -> BoundedVec<DiscoveredNoteInfo, MAX_NOTE_HASHES_PER_TX> {\n    let discovered_notes = &mut BoundedVec::new();\n\n    debug_log_format(\n        \"Attempting nonce discovery on {0} potential notes on contract {1} for storage slot {2}\",\n        [unique_note_hashes_in_tx.len() as Field, contract_address.to_field(), storage_slot],\n    );\n\n    // We need to find nonces (typically just one) that result in a note hash that, once siloed into a unique note hash,\n    // is one of the note hashes created by the transaction.\n    unique_note_hashes_in_tx.for_eachi(|i, expected_unique_note_hash| {\n        // Nonces are computed by hashing the first nullifier in the transaction with the index of the note in the\n        // new note hashes array. We therefore know for each note in every transaction what its nonce is.\n        let candidate_nonce = compute_note_hash_nonce(first_nullifier_in_tx, i);\n\n        // Given note nonce, note content and metadata, we can compute the note hash and silo it to check if it matches\n        // the note hash at the array index we're currently processing.\n        // TODO(#11157): handle failed note_hash_and_nullifier computation\n        let hashes = compute_note_hash_and_nullifier(\n            packed_note,\n            owner,\n            storage_slot,\n            note_type_id,\n            contract_address,\n            randomness,\n            candidate_nonce,\n        )\n            .expect(f\"Failed to compute a note hash for note type {note_type_id}\");\n\n        let siloed_note_hash = compute_siloed_note_hash(contract_address, hashes.note_hash);\n        let unique_note_hash = compute_unique_note_hash(candidate_nonce, siloed_note_hash);\n\n        if unique_note_hash == expected_unique_note_hash {\n            // Note that while we did check that the note hash is the preimage of the expected unique note hash, we\n            // perform no validations on the nullifier - we fundamentally cannot, since only the application knows\n            // how to compute nullifiers. We simply trust it to have provided the correct one: if it hasn't, then\n            // PXE may fail to realize that a given note has been nullified already, and calls to the application\n            // could result in invalid transactions (with duplicate nullifiers). This is not a concern because an\n            // application already has more direct means of making a call to it fail the transaction.\n            discovered_notes.push(\n                DiscoveredNoteInfo {\n                    note_nonce: candidate_nonce,\n                    note_hash: hashes.note_hash,\n                    inner_nullifier: hashes.inner_nullifier,\n                },\n            );\n\n            // We don't exit the loop - it is possible (though rare) for the exact same note content to be present\n            // multiple times in the same transaction with different nonces. This typically doesn't happen due to\n            // notes containing random values in order to hide their contents.\n        }\n    });\n\n    debug_log_format(\n        \"Found valid nonces for a total of {0} notes\",\n        [discovered_notes.len() as Field],\n    );\n\n    *discovered_notes\n}\n\nmod test {\n    use crate::{\n        messages::discovery::{NoteHashAndNullifier, private_notes::MAX_NOTE_PACKED_LEN},\n        note::{\n            note_interface::{NoteHash, NoteType},\n            note_metadata::SettledNoteMetadata,\n            retrieved_note::RetrievedNote,\n            utils::compute_note_hash_for_nullification,\n        },\n        oracle::random::random,\n        test::mocks::mock_note::MockNote,\n        utils::array,\n    };\n\n    use dep::protocol_types::{\n        address::AztecAddress,\n        hash::{compute_note_hash_nonce, compute_siloed_note_hash, compute_unique_note_hash},\n        traits::{FromField, Packable},\n    };\n\n    use super::attempt_note_nonce_discovery;\n\n    // This implementation could be simpler, but this serves as a nice example of the expected flow in a real\n    // implementation, and as a sanity check that the interface is sufficient.\n    unconstrained fn compute_note_hash_and_nullifier(\n        packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n        owner: AztecAddress,\n        storage_slot: Field,\n        note_type_id: Field,\n        contract_address: AztecAddress,\n        randomness: Field,\n        note_nonce: Field,\n    ) -> Option<NoteHashAndNullifier> {\n        if note_type_id == MockNote::get_id() {\n            let note = MockNote::unpack(array::subarray(packed_note.storage(), 0));\n            let note_hash = note.compute_note_hash(owner, storage_slot, randomness);\n\n            let note_hash_for_nullification = compute_note_hash_for_nullification(\n                RetrievedNote {\n                    note,\n                    contract_address,\n                    owner,\n                    randomness,\n                    metadata: SettledNoteMetadata::new(note_nonce).into(),\n                },\n                storage_slot,\n            );\n\n            let inner_nullifier =\n                note.compute_nullifier_unconstrained(owner, note_hash_for_nullification);\n\n            Option::some(NoteHashAndNullifier { note_hash, inner_nullifier })\n        } else {\n            Option::none()\n        }\n    }\n\n    global VALUE: Field = 7;\n    global FIRST_NULLIFIER_IN_TX: Field = 47;\n    global CONTRACT_ADDRESS: AztecAddress = AztecAddress::from_field(13);\n    global OWNER: AztecAddress = AztecAddress::from_field(14);\n    global STORAGE_SLOT: Field = 99;\n    global RANDOMNESS: Field = 99;\n\n    #[test]\n    unconstrained fn no_note_hashes() {\n        let unique_note_hashes_in_tx = BoundedVec::new();\n        let packed_note = BoundedVec::new();\n\n        let discovered_notes = attempt_note_nonce_discovery(\n            unique_note_hashes_in_tx,\n            FIRST_NULLIFIER_IN_TX,\n            compute_note_hash_and_nullifier,\n            CONTRACT_ADDRESS,\n            OWNER,\n            STORAGE_SLOT,\n            RANDOMNESS,\n            MockNote::get_id(),\n            packed_note,\n        );\n\n        assert_eq(discovered_notes.len(), 0);\n    }\n\n    #[test(should_fail_with = \"Failed to compute a note hash\")]\n    unconstrained fn failed_hash_computation() {\n        let unique_note_hashes_in_tx = BoundedVec::from_array([random()]);\n        let packed_note = BoundedVec::new();\n        let note_type_id = 0; // This note type id is unknown to compute_note_hash_and_nullifier\n\n        let discovered_notes = attempt_note_nonce_discovery(\n            unique_note_hashes_in_tx,\n            FIRST_NULLIFIER_IN_TX,\n            compute_note_hash_and_nullifier,\n            CONTRACT_ADDRESS,\n            OWNER,\n            STORAGE_SLOT,\n            RANDOMNESS,\n            note_type_id,\n            packed_note,\n        );\n\n        assert_eq(discovered_notes.len(), 0);\n    }\n\n    struct NoteAndData {\n        note: MockNote,\n        note_nonce: Field,\n        note_hash: Field,\n        unique_note_hash: Field,\n        inner_nullifier: Field,\n    }\n\n    unconstrained fn construct_note(value: Field, note_index_in_tx: u32) -> NoteAndData {\n        let note_nonce = compute_note_hash_nonce(FIRST_NULLIFIER_IN_TX, note_index_in_tx);\n\n        let retrieved_note = MockNote::new(value)\n            .contract_address(CONTRACT_ADDRESS)\n            .owner(OWNER)\n            .randomness(RANDOMNESS)\n            .note_metadata(SettledNoteMetadata::new(note_nonce).into())\n            .build_retrieved_note();\n        let note = retrieved_note.note;\n\n        let note_hash = note.compute_note_hash(OWNER, STORAGE_SLOT, RANDOMNESS);\n        let unique_note_hash = compute_unique_note_hash(\n            note_nonce,\n            compute_siloed_note_hash(CONTRACT_ADDRESS, note_hash),\n        );\n        let inner_nullifier = note.compute_nullifier_unconstrained(\n            OWNER,\n            compute_note_hash_for_nullification(retrieved_note, STORAGE_SLOT),\n        );\n\n        NoteAndData { note, note_nonce, note_hash, unique_note_hash, inner_nullifier }\n    }\n\n    #[test]\n    unconstrained fn single_note() {\n        let note_index_in_tx = 2;\n        let note_and_data = construct_note(VALUE, note_index_in_tx);\n\n        let mut unique_note_hashes_in_tx = BoundedVec::from_array([\n            random(), random(), random(), random(), random(), random(), random(),\n        ]);\n        unique_note_hashes_in_tx.set(note_index_in_tx, note_and_data.unique_note_hash);\n\n        let discovered_notes = attempt_note_nonce_discovery(\n            unique_note_hashes_in_tx,\n            FIRST_NULLIFIER_IN_TX,\n            compute_note_hash_and_nullifier,\n            CONTRACT_ADDRESS,\n            OWNER,\n            STORAGE_SLOT,\n            RANDOMNESS,\n            MockNote::get_id(),\n            BoundedVec::from_array(note_and_data.note.pack()),\n        );\n\n        assert_eq(discovered_notes.len(), 1);\n        let discovered_note = discovered_notes.get(0);\n\n        assert_eq(discovered_note.note_nonce, note_and_data.note_nonce);\n        assert_eq(discovered_note.note_hash, note_and_data.note_hash);\n        assert_eq(discovered_note.inner_nullifier, note_and_data.inner_nullifier);\n    }\n\n    #[test]\n    unconstrained fn multiple_notes_same_preimage() {\n        let first_note_index_in_tx = 3;\n        let first_note_and_data = construct_note(VALUE, first_note_index_in_tx);\n\n        let second_note_index_in_tx = 5;\n        let second_note_and_data = construct_note(VALUE, second_note_index_in_tx);\n\n        // Both notes have the same preimage (and therefore packed representation), so both should be found in the same\n        // call.\n        assert_eq(first_note_and_data.note, second_note_and_data.note);\n        let packed_note = first_note_and_data.note.pack();\n\n        let mut unique_note_hashes_in_tx = BoundedVec::from_array([\n            random(), random(), random(), random(), random(), random(), random(),\n        ]);\n        unique_note_hashes_in_tx.set(first_note_index_in_tx, first_note_and_data.unique_note_hash);\n        unique_note_hashes_in_tx.set(second_note_index_in_tx, second_note_and_data.unique_note_hash);\n\n        let discovered_notes = attempt_note_nonce_discovery(\n            unique_note_hashes_in_tx,\n            FIRST_NULLIFIER_IN_TX,\n            compute_note_hash_and_nullifier,\n            CONTRACT_ADDRESS,\n            OWNER,\n            STORAGE_SLOT,\n            RANDOMNESS,\n            MockNote::get_id(),\n            BoundedVec::from_array(packed_note),\n        );\n\n        assert_eq(discovered_notes.len(), 2);\n\n        assert(discovered_notes.any(|discovered_note| {\n            (discovered_note.note_nonce == first_note_and_data.note_nonce)\n                & (discovered_note.note_hash == first_note_and_data.note_hash)\n                & (discovered_note.inner_nullifier == first_note_and_data.inner_nullifier)\n        }));\n\n        assert(discovered_notes.any(|discovered_note| {\n            (discovered_note.note_nonce == second_note_and_data.note_nonce)\n                & (discovered_note.note_hash == second_note_and_data.note_hash)\n                & (discovered_note.inner_nullifier == second_note_and_data.inner_nullifier)\n        }));\n    }\n}\n"
+      "source": "use crate::messages::discovery::{ComputeNoteHashAndNullifier, private_notes::MAX_NOTE_PACKED_LEN};\n\nuse dep::protocol_types::{\n    address::AztecAddress,\n    constants::MAX_NOTE_HASHES_PER_TX,\n    debug_log::debug_log_format,\n    hash::{compute_note_hash_nonce, compute_siloed_note_hash, compute_unique_note_hash},\n    traits::ToField,\n};\n\n/// A struct with the discovered information of a complete note, required for delivery to PXE. Note that this is *not*\n/// the complete note information, since it does not include content, storage slot, etc.\npub struct DiscoveredNoteInfo {\n    pub note_nonce: Field,\n    pub note_hash: Field,\n    pub inner_nullifier: Field,\n}\n\n/// Searches for note nonces that will result in a note that was emitted in a transaction. While rare, it is possible\n/// for multiple notes to have the exact same packed content and storage slot but different nonces, resulting in\n/// different unique note hashes. Because of this this function returns a *vector* of discovered notes, though in most\n/// cases it will contain a single element.\n///\n/// Due to how nonces are computed, this function requires knowledge of the transaction in which the note was created,\n/// more specifically the list of all unique note hashes in it plus the value of its first nullifier.\npub unconstrained fn attempt_note_nonce_discovery<Env>(\n    unique_note_hashes_in_tx: BoundedVec<Field, MAX_NOTE_HASHES_PER_TX>,\n    first_nullifier_in_tx: Field,\n    compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n    contract_address: AztecAddress,\n    owner: AztecAddress,\n    storage_slot: Field,\n    randomness: Field,\n    note_type_id: Field,\n    packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n) -> BoundedVec<DiscoveredNoteInfo, MAX_NOTE_HASHES_PER_TX> {\n    let discovered_notes = &mut BoundedVec::new();\n\n    debug_log_format(\n        \"Attempting nonce discovery on {0} potential notes on contract {1} for storage slot {2}\",\n        [unique_note_hashes_in_tx.len() as Field, contract_address.to_field(), storage_slot],\n    );\n\n    // We need to find nonces (typically just one) that result in a note hash that, once siloed into a unique note hash,\n    // is one of the note hashes created by the transaction.\n    unique_note_hashes_in_tx.for_eachi(|i, expected_unique_note_hash| {\n        // Nonces are computed by hashing the first nullifier in the transaction with the index of the note in the\n        // new note hashes array. We therefore know for each note in every transaction what its nonce is.\n        let candidate_nonce = compute_note_hash_nonce(first_nullifier_in_tx, i);\n\n        // Given note nonce, note content and metadata, we can compute the note hash and silo it to check if it matches\n        // the note hash at the array index we're currently processing.\n        // TODO(#11157): handle failed note_hash_and_nullifier computation\n        let hashes = compute_note_hash_and_nullifier(\n            packed_note,\n            owner,\n            storage_slot,\n            note_type_id,\n            contract_address,\n            randomness,\n            candidate_nonce,\n        )\n            .expect(f\"Failed to compute a note hash for note type {note_type_id}\");\n\n        let siloed_note_hash = compute_siloed_note_hash(contract_address, hashes.note_hash);\n        let unique_note_hash = compute_unique_note_hash(candidate_nonce, siloed_note_hash);\n\n        if unique_note_hash == expected_unique_note_hash {\n            // Note that while we did check that the note hash is the preimage of the expected unique note hash, we\n            // perform no validations on the nullifier - we fundamentally cannot, since only the application knows\n            // how to compute nullifiers. We simply trust it to have provided the correct one: if it hasn't, then\n            // PXE may fail to realize that a given note has been nullified already, and calls to the application\n            // could result in invalid transactions (with duplicate nullifiers). This is not a concern because an\n            // application already has more direct means of making a call to it fail the transaction.\n            discovered_notes.push(\n                DiscoveredNoteInfo {\n                    note_nonce: candidate_nonce,\n                    note_hash: hashes.note_hash,\n                    inner_nullifier: hashes.inner_nullifier,\n                },\n            );\n\n            // We don't exit the loop - it is possible (though rare) for the exact same note content to be present\n            // multiple times in the same transaction with different nonces. This typically doesn't happen due to\n            // notes containing random values in order to hide their contents.\n        }\n    });\n\n    debug_log_format(\n        \"Found valid nonces for a total of {0} notes\",\n        [discovered_notes.len() as Field],\n    );\n\n    *discovered_notes\n}\n\nmod test {\n    use crate::{\n        messages::discovery::{NoteHashAndNullifier, private_notes::MAX_NOTE_PACKED_LEN},\n        note::{\n            note_interface::{NoteHash, NoteType},\n            note_metadata::SettledNoteMetadata,\n            retrieved_note::RetrievedNote,\n            utils::compute_note_hash_for_nullification,\n        },\n        oracle::random::random,\n        test::mocks::mock_note::MockNote,\n        utils::array,\n    };\n\n    use dep::protocol_types::{\n        address::AztecAddress,\n        hash::{compute_note_hash_nonce, compute_siloed_note_hash, compute_unique_note_hash},\n        traits::{FromField, Packable},\n    };\n\n    use super::attempt_note_nonce_discovery;\n\n    // This implementation could be simpler, but this serves as a nice example of the expected flow in a real\n    // implementation, and as a sanity check that the interface is sufficient.\n    unconstrained fn compute_note_hash_and_nullifier(\n        packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n        owner: AztecAddress,\n        storage_slot: Field,\n        note_type_id: Field,\n        contract_address: AztecAddress,\n        randomness: Field,\n        note_nonce: Field,\n    ) -> Option<NoteHashAndNullifier> {\n        if note_type_id == MockNote::get_id() {\n            let note = MockNote::unpack(array::subarray(packed_note.storage(), 0));\n            let note_hash = note.compute_note_hash(owner, storage_slot, randomness);\n\n            let note_hash_for_nullification = compute_note_hash_for_nullification(\n                RetrievedNote {\n                    note,\n                    contract_address,\n                    owner,\n                    randomness,\n                    storage_slot,\n                    metadata: SettledNoteMetadata::new(note_nonce).into(),\n                },\n            );\n\n            let inner_nullifier =\n                note.compute_nullifier_unconstrained(owner, note_hash_for_nullification);\n\n            Option::some(NoteHashAndNullifier { note_hash, inner_nullifier })\n        } else {\n            Option::none()\n        }\n    }\n\n    global VALUE: Field = 7;\n    global FIRST_NULLIFIER_IN_TX: Field = 47;\n    global CONTRACT_ADDRESS: AztecAddress = AztecAddress::from_field(13);\n    global OWNER: AztecAddress = AztecAddress::from_field(14);\n    global STORAGE_SLOT: Field = 99;\n    global RANDOMNESS: Field = 99;\n\n    #[test]\n    unconstrained fn no_note_hashes() {\n        let unique_note_hashes_in_tx = BoundedVec::new();\n        let packed_note = BoundedVec::new();\n\n        let discovered_notes = attempt_note_nonce_discovery(\n            unique_note_hashes_in_tx,\n            FIRST_NULLIFIER_IN_TX,\n            compute_note_hash_and_nullifier,\n            CONTRACT_ADDRESS,\n            OWNER,\n            STORAGE_SLOT,\n            RANDOMNESS,\n            MockNote::get_id(),\n            packed_note,\n        );\n\n        assert_eq(discovered_notes.len(), 0);\n    }\n\n    #[test(should_fail_with = \"Failed to compute a note hash\")]\n    unconstrained fn failed_hash_computation() {\n        let unique_note_hashes_in_tx = BoundedVec::from_array([random()]);\n        let packed_note = BoundedVec::new();\n        let note_type_id = 0; // This note type id is unknown to compute_note_hash_and_nullifier\n\n        let discovered_notes = attempt_note_nonce_discovery(\n            unique_note_hashes_in_tx,\n            FIRST_NULLIFIER_IN_TX,\n            compute_note_hash_and_nullifier,\n            CONTRACT_ADDRESS,\n            OWNER,\n            STORAGE_SLOT,\n            RANDOMNESS,\n            note_type_id,\n            packed_note,\n        );\n\n        assert_eq(discovered_notes.len(), 0);\n    }\n\n    struct NoteAndData {\n        note: MockNote,\n        note_nonce: Field,\n        note_hash: Field,\n        unique_note_hash: Field,\n        inner_nullifier: Field,\n    }\n\n    unconstrained fn construct_note(value: Field, note_index_in_tx: u32) -> NoteAndData {\n        let note_nonce = compute_note_hash_nonce(FIRST_NULLIFIER_IN_TX, note_index_in_tx);\n\n        let retrieved_note = MockNote::new(value)\n            .contract_address(CONTRACT_ADDRESS)\n            .owner(OWNER)\n            .randomness(RANDOMNESS)\n            .storage_slot(STORAGE_SLOT)\n            .note_metadata(SettledNoteMetadata::new(note_nonce).into())\n            .build_retrieved_note();\n        let note = retrieved_note.note;\n\n        let note_hash = note.compute_note_hash(OWNER, STORAGE_SLOT, RANDOMNESS);\n        let unique_note_hash = compute_unique_note_hash(\n            note_nonce,\n            compute_siloed_note_hash(CONTRACT_ADDRESS, note_hash),\n        );\n        let inner_nullifier = note.compute_nullifier_unconstrained(\n            OWNER,\n            compute_note_hash_for_nullification(retrieved_note),\n        );\n\n        NoteAndData { note, note_nonce, note_hash, unique_note_hash, inner_nullifier }\n    }\n\n    #[test]\n    unconstrained fn single_note() {\n        let note_index_in_tx = 2;\n        let note_and_data = construct_note(VALUE, note_index_in_tx);\n\n        let mut unique_note_hashes_in_tx = BoundedVec::from_array([\n            random(), random(), random(), random(), random(), random(), random(),\n        ]);\n        unique_note_hashes_in_tx.set(note_index_in_tx, note_and_data.unique_note_hash);\n\n        let discovered_notes = attempt_note_nonce_discovery(\n            unique_note_hashes_in_tx,\n            FIRST_NULLIFIER_IN_TX,\n            compute_note_hash_and_nullifier,\n            CONTRACT_ADDRESS,\n            OWNER,\n            STORAGE_SLOT,\n            RANDOMNESS,\n            MockNote::get_id(),\n            BoundedVec::from_array(note_and_data.note.pack()),\n        );\n\n        assert_eq(discovered_notes.len(), 1);\n        let discovered_note = discovered_notes.get(0);\n\n        assert_eq(discovered_note.note_nonce, note_and_data.note_nonce);\n        assert_eq(discovered_note.note_hash, note_and_data.note_hash);\n        assert_eq(discovered_note.inner_nullifier, note_and_data.inner_nullifier);\n    }\n\n    #[test]\n    unconstrained fn multiple_notes_same_preimage() {\n        let first_note_index_in_tx = 3;\n        let first_note_and_data = construct_note(VALUE, first_note_index_in_tx);\n\n        let second_note_index_in_tx = 5;\n        let second_note_and_data = construct_note(VALUE, second_note_index_in_tx);\n\n        // Both notes have the same preimage (and therefore packed representation), so both should be found in the same\n        // call.\n        assert_eq(first_note_and_data.note, second_note_and_data.note);\n        let packed_note = first_note_and_data.note.pack();\n\n        let mut unique_note_hashes_in_tx = BoundedVec::from_array([\n            random(), random(), random(), random(), random(), random(), random(),\n        ]);\n        unique_note_hashes_in_tx.set(first_note_index_in_tx, first_note_and_data.unique_note_hash);\n        unique_note_hashes_in_tx.set(second_note_index_in_tx, second_note_and_data.unique_note_hash);\n\n        let discovered_notes = attempt_note_nonce_discovery(\n            unique_note_hashes_in_tx,\n            FIRST_NULLIFIER_IN_TX,\n            compute_note_hash_and_nullifier,\n            CONTRACT_ADDRESS,\n            OWNER,\n            STORAGE_SLOT,\n            RANDOMNESS,\n            MockNote::get_id(),\n            BoundedVec::from_array(packed_note),\n        );\n\n        assert_eq(discovered_notes.len(), 2);\n\n        assert(discovered_notes.any(|discovered_note| {\n            (discovered_note.note_nonce == first_note_and_data.note_nonce)\n                & (discovered_note.note_hash == first_note_and_data.note_hash)\n                & (discovered_note.inner_nullifier == first_note_and_data.inner_nullifier)\n        }));\n\n        assert(discovered_notes.any(|discovered_note| {\n            (discovered_note.note_nonce == second_note_and_data.note_nonce)\n                & (discovered_note.note_hash == second_note_and_data.note_hash)\n                & (discovered_note.inner_nullifier == second_note_and_data.inner_nullifier)\n        }));\n    }\n}\n"
     },
-    "126": {
+    "127": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/partial_notes.nr",
       "source": "use crate::{\n    capsules::CapsuleArray,\n    messages::{\n        discovery::{ComputeNoteHashAndNullifier, nonce_discovery::attempt_note_nonce_discovery},\n        encoding::MAX_MESSAGE_CONTENT_LEN,\n        processing::{\n            enqueue_note_for_validation, get_pending_partial_notes_completion_logs,\n            log_retrieval_response::LogRetrievalResponse,\n        },\n    },\n    utils::array,\n};\n\nuse protocol_types::{\n    address::AztecAddress,\n    debug_log::debug_log_format,\n    hash::sha256_to_field,\n    traits::{Deserialize, FromField, Serialize},\n};\n\n/// [ owner, storage slot, randomness, note_completion_log_tag ]\nglobal PARTIAL_NOTE_PRIVATE_MSG_CONTENT_NON_NOTE_FIELDS_LEN: u32 = 4;\nglobal PARTIAL_NOTE_PRIVATE_MSG_CONTENT_OWNER_INDEX: u32 = 0;\nglobal PARTIAL_NOTE_PRIVATE_MSG_CONTENT_STORAGE_SLOT_INDEX: u32 = 1;\nglobal PARTIAL_NOTE_PRIVATE_MSG_CONTENT_RANDOMNESS_INDEX: u32 = 2;\nglobal PARTIAL_NOTE_PRIVATE_MSG_CONTENT_NOTE_COMPLETION_LOG_TAG_INDEX: u32 = 3;\n\n/// Partial notes have a maximum packed length of their private fields bound by extra content in their private message\n/// (e.g. the storage slot, note completion log tag, etc.).\npub global MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN: u32 =\n    MAX_MESSAGE_CONTENT_LEN - PARTIAL_NOTE_PRIVATE_MSG_CONTENT_NON_NOTE_FIELDS_LEN;\n\n/// The slot in the PXE capsules where we store a `CapsuleArray` of `DeliveredPendingPartialNote`.\npub global DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT: Field = sha256_to_field(\n    \"AZTEC_NR::DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT\".as_bytes(),\n);\n\n/// A partial note that was delivered but is still pending completion. Contains the information necessary to find the\n/// log that will complete it and lead to a note being discovered and delivered.\n#[derive(Serialize, Deserialize)]\npub(crate) struct DeliveredPendingPartialNote {\n    pub(crate) note_completion_log_tag: Field,\n    pub(crate) owner: AztecAddress,\n    pub(crate) storage_slot: Field,\n    pub(crate) randomness: Field,\n    pub(crate) note_type_id: Field,\n    pub(crate) packed_private_note_content: BoundedVec<Field, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN>,\n    pub(crate) recipient: AztecAddress,\n}\n\npub unconstrained fn process_partial_note_private_msg(\n    contract_address: AztecAddress,\n    recipient: AztecAddress,\n    msg_metadata: u64,\n    msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n) {\n    // We store the information of the partial note we found in a persistent capsule in PXE, so that we can later search\n    // for the public log that will complete it.\n    let pending = decode_partial_note_private_msg(msg_metadata, msg_content, recipient);\n\n    CapsuleArray::at(\n        contract_address,\n        DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT,\n    )\n        .push(pending);\n}\n\n/// Searches for logs that would result in the completion of pending partial notes, ultimately resulting in the notes\n/// being delivered to PXE if completed.\npub unconstrained fn fetch_and_process_partial_note_completion_logs<Env>(\n    contract_address: AztecAddress,\n    compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n) {\n    let pending_partial_notes = CapsuleArray::at(\n        contract_address,\n        DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT,\n    );\n\n    debug_log_format(\n        \"{} pending partial notes\",\n        [pending_partial_notes.len() as Field],\n    );\n\n    // Each of the pending partial notes might get completed by a log containing its public values. For performance\n    // reasons, we fetch all of these logs concurrently and then process them one by one, minimizing the amount of time\n    // waiting for the node roundtrip.\n    let maybe_completion_logs =\n        get_pending_partial_notes_completion_logs(contract_address, pending_partial_notes);\n\n    // Each entry in the maybe completion logs array corresponds to the entry in the pending partial notes array at the\n    // same index. This means we can use the same index as we iterate through the responses to get both the partial note\n    // and the log that might complete it.\n    assert_eq(maybe_completion_logs.len(), pending_partial_notes.len());\n\n    maybe_completion_logs.for_each(|i, maybe_log: Option<LogRetrievalResponse>| {\n        // We clear the completion logs as we read them so that the array is empty by the time we next query it.\n        // TODO(#14943): use volatile arrays to avoid having to manually clear this.\n        maybe_completion_logs.remove(i);\n\n        let pending_partial_note = pending_partial_notes.get(i);\n\n        if maybe_log.is_none() {\n            debug_log_format(\n                \"Found no completion logs for partial note with tag {}\",\n                [pending_partial_note.note_completion_log_tag],\n            );\n\n            // Note that we're not removing the pending partial note from the capsule array, so we will continue\n            // searching for this tagged log when performing message discovery in the future until we either find it or\n            // the entry is somehow removed from the array.\n        } else {\n            debug_log_format(\n                \"Completion log found for partial note with tag {}\",\n                [pending_partial_note.note_completion_log_tag],\n            );\n            let log = maybe_log.unwrap();\n\n            // Public fields are assumed to all be placed at the end of the packed representation, so we combine the\n            // private and public packed fields (i.e. the contents of the private message and public log plaintext to get\n            // the complete packed content.\n            let complete_packed_note = array::append(\n                pending_partial_note.packed_private_note_content,\n                log.log_payload,\n            );\n\n            let discovered_notes = attempt_note_nonce_discovery(\n                log.unique_note_hashes_in_tx,\n                log.first_nullifier_in_tx,\n                compute_note_hash_and_nullifier,\n                contract_address,\n                pending_partial_note.owner,\n                pending_partial_note.storage_slot,\n                pending_partial_note.randomness,\n                pending_partial_note.note_type_id,\n                complete_packed_note,\n            );\n\n            // TODO(#11627): is there anything reasonable we can do if we get a log but it doesn't result in a note\n            // being found?\n            if discovered_notes.len() == 0 {\n                panic(\n                    f\"A partial note's completion log did not result in any notes being found - this should never happen\",\n                );\n            }\n\n            debug_log_format(\n                \"Discovered {0} notes for partial note with tag {1}\",\n                [discovered_notes.len() as Field, pending_partial_note.note_completion_log_tag],\n            );\n\n            discovered_notes.for_each(|discovered_note| {\n                enqueue_note_for_validation(\n                    contract_address,\n                    pending_partial_note.owner,\n                    pending_partial_note.storage_slot,\n                    pending_partial_note.randomness,\n                    discovered_note.note_nonce,\n                    complete_packed_note,\n                    discovered_note.note_hash,\n                    discovered_note.inner_nullifier,\n                    log.tx_hash,\n                    pending_partial_note.recipient,\n                );\n            });\n\n            // Because there is only a single log for a given tag, once we've processed the tagged log then we\n            // simply delete the pending work entry, regardless of whether it was actually completed or not.\n            pending_partial_notes.remove(i);\n        }\n    });\n}\n\nfn decode_partial_note_private_msg(\n    msg_metadata: u64,\n    msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n    recipient: AztecAddress,\n) -> DeliveredPendingPartialNote {\n    let note_type_id = msg_metadata as Field; // TODO: make note type id not be a full field\n\n    // The following ensures that the message content contains at least the minimum number of fields required for a\n    // valid partial note private message. (Refer to the description of\n    // PARTIAL_NOTE_PRIVATE_MSG_CONTENT_NON_NOTE_FIELDS_LEN for more information about these fields.)\n    assert(\n        msg_content.len() >= PARTIAL_NOTE_PRIVATE_MSG_CONTENT_NON_NOTE_FIELDS_LEN,\n        f\"Invalid private note message: all partial note private messages must have at least {PARTIAL_NOTE_PRIVATE_MSG_CONTENT_NON_NOTE_FIELDS_LEN} fields\",\n    );\n\n    // If PARTIAL_NOTE_PRIVATE_MSG_CONTENT_NON_NOTE_FIELDS_LEN is changed, causing the assertion below to fail, then the\n    // destructuring of the partial note private message encoding below must be updated as well.\n    std::static_assert(\n        PARTIAL_NOTE_PRIVATE_MSG_CONTENT_NON_NOTE_FIELDS_LEN == 4,\n        \"unexpected value for PARTIAL_NOTE_PRIVATE_MSG_CONTENT_NON_NOTE_FIELDS_LEN\",\n    );\n\n    // We currently have four fields that are not the partial note's packed representation,\n    // which are the owner, the storage slot, the randomness, and the note completion log tag.\n    let owner = AztecAddress::from_field(msg_content.get(\n        PARTIAL_NOTE_PRIVATE_MSG_CONTENT_OWNER_INDEX,\n    ));\n    let storage_slot = msg_content.get(PARTIAL_NOTE_PRIVATE_MSG_CONTENT_STORAGE_SLOT_INDEX);\n    let randomness = msg_content.get(PARTIAL_NOTE_PRIVATE_MSG_CONTENT_RANDOMNESS_INDEX);\n    let note_completion_log_tag =\n        msg_content.get(PARTIAL_NOTE_PRIVATE_MSG_CONTENT_NOTE_COMPLETION_LOG_TAG_INDEX);\n\n    let packed_private_note_content: BoundedVec<Field, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN> = array::subbvec(\n        msg_content,\n        PARTIAL_NOTE_PRIVATE_MSG_CONTENT_NON_NOTE_FIELDS_LEN,\n    );\n\n    DeliveredPendingPartialNote {\n        note_completion_log_tag,\n        owner,\n        storage_slot,\n        randomness,\n        note_type_id,\n        packed_private_note_content,\n        recipient,\n    }\n}\n"
     },
-    "127": {
+    "128": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/private_events.nr",
       "source": "use crate::{\n    event::event_selector::EventSelector,\n    messages::{encoding::MAX_MESSAGE_CONTENT_LEN, processing::enqueue_event_for_validation},\n    utils::array,\n};\nuse protocol_types::{\n    address::AztecAddress, constants::GENERATOR_INDEX__EVENT_COMMITMENT,\n    hash::poseidon2_hash_with_separator_bounded_vec, traits::FromField,\n};\n\n/// The number of fields in a private event message content that are not the event's serialized representation\n/// (1 field for randomness).\nglobal PRIVATE_EVENT_MSG_CONTENT_NON_EVENT_FIELDS_LEN: u32 = 1;\n\n/// The maximum length of the packed representation of an event's contents. This is limited by private log size,\n/// encryption overhead and extra fields in the message (e.g. message type id, randomness, etc.).\npub global MAX_EVENT_SERIALIZED_LEN: u32 =\n    MAX_MESSAGE_CONTENT_LEN - PRIVATE_EVENT_MSG_CONTENT_NON_EVENT_FIELDS_LEN;\n\npub unconstrained fn process_private_event_msg(\n    contract_address: AztecAddress,\n    recipient: AztecAddress,\n    msg_metadata: u64,\n    msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n    tx_hash: Field,\n) {\n    // In the case of events, the msg metadata is the event selector.\n    let event_type_id = EventSelector::from_field(msg_metadata as Field);\n\n    assert(\n        msg_content.len() > PRIVATE_EVENT_MSG_CONTENT_NON_EVENT_FIELDS_LEN,\n        f\"Invalid private event message: all private event messages must have at least {PRIVATE_EVENT_MSG_CONTENT_NON_EVENT_FIELDS_LEN} fields\",\n    );\n\n    // If PRIVATE_EVENT_MSG_CONTENT_NON_EVENT_FIELDS_LEN is changed, causing the assertion below to fail, then the\n    // destructuring of the private event message encoding below must be updated as well.\n    std::static_assert(\n        PRIVATE_EVENT_MSG_CONTENT_NON_EVENT_FIELDS_LEN == 1,\n        \"unexpected value for PRIVATE_EVENT_MSG_CONTENT_NON_EVENT_FIELDS_LEN\",\n    );\n\n    let serialized_event_with_randomness = msg_content;\n\n    let event_commitment = poseidon2_hash_with_separator_bounded_vec(\n        serialized_event_with_randomness,\n        GENERATOR_INDEX__EVENT_COMMITMENT,\n    );\n\n    // Randomness was injected into the event payload in `emit_event_in_private` but we have already used it\n    // to compute the event commitment, so we can safely discard it now.\n    let serialized_event = array::subbvec(\n        serialized_event_with_randomness,\n        PRIVATE_EVENT_MSG_CONTENT_NON_EVENT_FIELDS_LEN,\n    );\n\n    enqueue_event_for_validation(\n        contract_address,\n        event_type_id,\n        serialized_event,\n        event_commitment,\n        tx_hash,\n        recipient,\n    );\n}\n"
     },
-    "128": {
+    "129": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/private_notes.nr",
       "source": "use crate::{\n    messages::{\n        discovery::{ComputeNoteHashAndNullifier, nonce_discovery::attempt_note_nonce_discovery},\n        encoding::MAX_MESSAGE_CONTENT_LEN,\n        processing::enqueue_note_for_validation,\n    },\n    utils::array,\n};\nuse protocol_types::{\n    address::AztecAddress, constants::MAX_NOTE_HASHES_PER_TX, debug_log::debug_log_format,\n    traits::FromField,\n};\n\n/// The number of fields in a private note message content that are not the note's packed representation.\n// See the call to `std::static_assert` below to see what's in these fields.\nglobal PRIVATE_NOTE_MSG_CONTENT_NON_NOTE_FIELDS_LEN: u32 = 3;\nglobal PRIVATE_NOTE_MSG_CONTENT_OWNER_INDEX: u32 = 0;\nglobal PRIVATE_NOTE_MSG_CONTENT_STORAGE_SLOT_INDEX: u32 = 1;\nglobal PRIVATE_NOTE_MSG_CONTENT_RANDOMNESS_INDEX: u32 = 2;\n\n/// The maximum length of the packed representation of a note's contents. This is limited by private log size,\n/// encryption overhead and extra fields in the message (e.g. message type id, storage slot, randomness, etc.).\npub global MAX_NOTE_PACKED_LEN: u32 =\n    MAX_MESSAGE_CONTENT_LEN - PRIVATE_NOTE_MSG_CONTENT_NON_NOTE_FIELDS_LEN;\n\npub unconstrained fn process_private_note_msg<Env>(\n    contract_address: AztecAddress,\n    tx_hash: Field,\n    unique_note_hashes_in_tx: BoundedVec<Field, MAX_NOTE_HASHES_PER_TX>,\n    first_nullifier_in_tx: Field,\n    recipient: AztecAddress,\n    compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n    msg_metadata: u64,\n    msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n) {\n    let (note_type_id, owner, storage_slot, randomness, packed_note) =\n        decode_private_note_msg(msg_metadata, msg_content);\n\n    attempt_note_discovery(\n        contract_address,\n        tx_hash,\n        unique_note_hashes_in_tx,\n        first_nullifier_in_tx,\n        recipient,\n        compute_note_hash_and_nullifier,\n        owner,\n        storage_slot,\n        randomness,\n        note_type_id,\n        packed_note,\n    );\n}\n\n/// Attempts discovery of a note given information about its contents and the transaction in which it is\n/// suspected the note was created.\npub unconstrained fn attempt_note_discovery<Env>(\n    contract_address: AztecAddress,\n    tx_hash: Field,\n    unique_note_hashes_in_tx: BoundedVec<Field, MAX_NOTE_HASHES_PER_TX>,\n    first_nullifier_in_tx: Field,\n    recipient: AztecAddress,\n    compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n    owner: AztecAddress,\n    storage_slot: Field,\n    randomness: Field,\n    note_type_id: Field,\n    packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n) {\n    let discovered_notes = attempt_note_nonce_discovery(\n        unique_note_hashes_in_tx,\n        first_nullifier_in_tx,\n        compute_note_hash_and_nullifier,\n        contract_address,\n        owner,\n        storage_slot,\n        randomness,\n        note_type_id,\n        packed_note,\n    );\n\n    debug_log_format(\n        \"Discovered {0} notes from a private message\",\n        [discovered_notes.len() as Field],\n    );\n\n    discovered_notes.for_each(|discovered_note| {\n        enqueue_note_for_validation(\n            contract_address,\n            owner,\n            storage_slot,\n            randomness,\n            discovered_note.note_nonce,\n            packed_note,\n            discovered_note.note_hash,\n            discovered_note.inner_nullifier,\n            tx_hash,\n            recipient,\n        );\n    });\n}\n\nfn decode_private_note_msg(\n    msg_metadata: u64,\n    msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n) -> (Field, AztecAddress, Field, Field, BoundedVec<Field, MAX_NOTE_PACKED_LEN>) {\n    let note_type_id = msg_metadata as Field; // TODO: make note type id not be a full field\n\n    assert(\n        msg_content.len() > PRIVATE_NOTE_MSG_CONTENT_NON_NOTE_FIELDS_LEN,\n        f\"Invalid private note message: all private note messages must have at least {PRIVATE_NOTE_MSG_CONTENT_NON_NOTE_FIELDS_LEN} fields\",\n    );\n\n    // If PRIVATE_NOTE_MSG_CONTENT_NON_NOTE_FIELDS_LEN is changed, causing the assertion below to fail, then the\n    // destructuring of the private note message encoding below must be updated as well.\n    std::static_assert(\n        PRIVATE_NOTE_MSG_CONTENT_NON_NOTE_FIELDS_LEN == 3,\n        \"unexpected value for PRIVATE_NOTE_MSG_CONTENT_NON_NOTE_FIELDS_LEN\",\n    );\n\n    // We currently have two fields that are not the note's packed representation, which are the owner and the storage slot.\n    let owner = AztecAddress::from_field(msg_content.get(PRIVATE_NOTE_MSG_CONTENT_OWNER_INDEX));\n    let storage_slot = msg_content.get(PRIVATE_NOTE_MSG_CONTENT_STORAGE_SLOT_INDEX);\n    let randomness = msg_content.get(PRIVATE_NOTE_MSG_CONTENT_RANDOMNESS_INDEX);\n    let packed_note = array::subbvec(msg_content, PRIVATE_NOTE_MSG_CONTENT_NON_NOTE_FIELDS_LEN);\n\n    (note_type_id, owner, storage_slot, randomness, packed_note)\n}\n"
     },
-    "129": {
+    "130": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/process_message.nr",
       "source": "use crate::messages::{\n    discovery::{\n        ComputeNoteHashAndNullifier, partial_notes::process_partial_note_private_msg,\n        private_events::process_private_event_msg, private_notes::process_private_note_msg,\n    },\n    encoding::{decode_message, MESSAGE_CIPHERTEXT_LEN, MESSAGE_PLAINTEXT_LEN},\n    encryption::{aes128::AES128, message_encryption::MessageEncryption},\n    msg_type::{\n        PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID, PRIVATE_EVENT_MSG_TYPE_ID, PRIVATE_NOTE_MSG_TYPE_ID,\n    },\n    processing::message_context::MessageContext,\n};\n\nuse protocol_types::{address::AztecAddress, debug_log::{debug_log, debug_log_format}};\n\n/// Processes a message that can contain notes, partial notes, or events.\n///\n/// Notes result in nonce discovery being performed prior to delivery, which requires knowledge of the transaction hash\n/// in which the notes would've been created (typically the same transaction in which the log was emitted), along with\n/// the list of unique note hashes in said transaction and the `compute_note_hash_and_nullifier` function. Once\n/// discovered, the notes are enqueued for validation.\n///\n/// Partial notes result in a pending partial note entry being stored in a PXE capsule, which will later be retrieved to\n/// search for the note's completion public log.\n///\n/// Events are processed by computing an event commitment from the serialized event data and its randomness field, then\n/// enqueueing the event data and commitment for validation.\npub unconstrained fn process_message_ciphertext<Env>(\n    contract_address: AztecAddress,\n    compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n    message_ciphertext: BoundedVec<Field, MESSAGE_CIPHERTEXT_LEN>,\n    message_context: MessageContext,\n) {\n    let message_plaintext_option = AES128::decrypt(message_ciphertext, message_context.recipient);\n\n    if message_plaintext_option.is_some() {\n        process_message_plaintext(\n            contract_address,\n            compute_note_hash_and_nullifier,\n            message_plaintext_option.unwrap(),\n            message_context,\n        );\n    } else {\n        debug_log_format(\n            \"Found invalid message from tx {0}, ignoring\",\n            [message_context.tx_hash],\n        );\n    }\n}\n\npub unconstrained fn process_message_plaintext<Env>(\n    contract_address: AztecAddress,\n    compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n    message_plaintext: BoundedVec<Field, MESSAGE_PLAINTEXT_LEN>,\n    message_context: MessageContext,\n) {\n    // The first thing to do after decrypting the message is to determine what type of message we're processing. We\n    // have 3 message types: private notes, partial notes and events.\n\n    // We decode the message to obtain the message type id, metadata and content.\n    let (msg_type_id, msg_metadata, msg_content) = decode_message(message_plaintext);\n\n    if msg_type_id == PRIVATE_NOTE_MSG_TYPE_ID {\n        debug_log(\"Processing private note msg\");\n\n        process_private_note_msg(\n            contract_address,\n            message_context.tx_hash,\n            message_context.unique_note_hashes_in_tx,\n            message_context.first_nullifier_in_tx,\n            message_context.recipient,\n            compute_note_hash_and_nullifier,\n            msg_metadata,\n            msg_content,\n        );\n    } else if msg_type_id == PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID {\n        debug_log(\"Processing partial note private msg\");\n\n        process_partial_note_private_msg(\n            contract_address,\n            message_context.recipient,\n            msg_metadata,\n            msg_content,\n        );\n    } else if msg_type_id == PRIVATE_EVENT_MSG_TYPE_ID {\n        debug_log(\"Processing private event msg\");\n\n        process_private_event_msg(\n            contract_address,\n            message_context.recipient,\n            msg_metadata,\n            msg_content,\n            message_context.tx_hash,\n        );\n    } else {\n        debug_log_format(\"Unknown msg type id {0}\", [msg_type_id as Field]);\n    }\n}\n"
     },
-    "130": {
+    "131": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/encoding.nr",
       "source": "// TODO(#12750): don't make these values assume we're using AES.\nuse crate::utils::array;\nuse protocol_types::constants::PRIVATE_LOG_CIPHERTEXT_LEN;\n\n// We reassign to the constant here to communicate the distinction between a log and a message. In Aztec.nr, unlike in\n// protocol circuits, we have a concept of a message that can be emitted either as a private log or as an offchain\n// message. Message is a piece of data that is to be eventually delivered to a contract via the `process_message(...)`\n// utility function function that is injected by the #[aztec] macro.\n// Note: PRIVATE_LOG_CIPHERTEXT_LEN is an amount of fields,\n// so MESSAGE_CIPHERTEXT_LEN is the size of the message in fields.\npub global MESSAGE_CIPHERTEXT_LEN: u32 = PRIVATE_LOG_CIPHERTEXT_LEN;\n\n// TODO(#12750): The global variables below should not be here as they are AES128 specific.\n// ciphertext_length (2) + 14 bytes pkcs#7 AES padding.\npub(crate) global HEADER_CIPHERTEXT_SIZE_IN_BYTES: u32 = 16;\n\npub global EPH_PK_X_SIZE_IN_FIELDS: u32 = 1;\npub global EPH_PK_SIGN_BYTE_SIZE_IN_BYTES: u32 = 1;\n\n// (17 - 1) * 31 - 16 - 1 = 479\n// Note: We multiply by 31 because ciphertext bytes are stored in fields using bytes_to_fields, which packs 31 bytes per\n// field (since a Field is ~254 bits and can safely store 31 whole bytes).\nglobal MESSAGE_PLAINTEXT_SIZE_IN_BYTES: u32 = (MESSAGE_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS)\n    * 31\n    - HEADER_CIPHERTEXT_SIZE_IN_BYTES\n    - EPH_PK_SIGN_BYTE_SIZE_IN_BYTES;\n// The plaintext bytes represent Field values that were originally serialized using fields_to_bytes, which converts each\n// Field to 32 bytes. To convert the plaintext bytes back to fields, we divide by 32.\n// 479 / 32 = 14\npub global MESSAGE_PLAINTEXT_LEN: u32 = MESSAGE_PLAINTEXT_SIZE_IN_BYTES / 32;\n\npub global MESSAGE_EXPANDED_METADATA_LEN: u32 = 1;\n\n// The standard message layout is composed of:\n//  - an initial field called the 'expanded metadata'\n//  - an arbitrary number of fields following that called the 'message content'\n//\n// ```\n// message: [ msg_expanded_metadata, ...msg_content ]\n// ```\n//\n// The expanded metadata itself is interpreted as a u128, of which:\n//  - the upper 64 bits are the message type id\n//  - the lower 64 bits are called the 'message metadata'\n//\n// ```\n// msg_expanded_metadata: [  msg_type_id    |  msg_metadata  ]\n//                        <---  64 bits --->|<--- 64 bits --->\n// ```\n//\n// The meaning of the message metadata and message content depend on the value of the message type id. Note that there\n// is nothing special about the message metadata, it _can_ be considered part of the content. It just has a different\n// name to make it distinct from the message content given that it is not a full field.\n\n/// The maximum length of a message's content, i.e. not including the expanded message metadata.\npub global MAX_MESSAGE_CONTENT_LEN: u32 = MESSAGE_PLAINTEXT_LEN - MESSAGE_EXPANDED_METADATA_LEN;\n\n/// Encodes a message following aztec-nr's standard message encoding. This message can later be decoded with\n/// `decode_message` to retrieve the original values.\n///\n/// - The `msg_type` is an identifier that groups types of messages that are all processed the same way, e.g. private\n/// notes or events. Possible values are defined in `aztec::messages::msg_type`.\n/// - The `msg_metadata` and `msg_content` are the values stored in the message, whose meaning depends on the\n///  `msg_type`. The only special thing about `msg_metadata` that separates it from `msg_content` is that it is a u64\n/// instead of a full Field (due to details of how messages are encoded), allowing applications that can fit values into\n/// this smaller variable to achieve higher data efficiency.\npub fn encode_message<let N: u32>(\n    msg_type: u64,\n    msg_metadata: u64,\n    msg_content: [Field; N],\n) -> [Field; (N + MESSAGE_EXPANDED_METADATA_LEN)] {\n    std::static_assert(\n        msg_content.len() <= MAX_MESSAGE_CONTENT_LEN,\n        \"Invalid message content: it must have a length of at most MAX_MESSAGE_CONTENT_LEN\",\n    );\n\n    // If MESSAGE_EXPANDED_METADATA_LEN is changed, causing the assertion below to fail, then the destructuring of\n    // the message encoding below must be updated as well.\n    std::static_assert(\n        MESSAGE_EXPANDED_METADATA_LEN == 1,\n        \"unexpected value for MESSAGE_EXPANDED_METADATA_LEN\",\n    );\n    let mut message: [Field; (N + MESSAGE_EXPANDED_METADATA_LEN)] = std::mem::zeroed();\n\n    message[0] = to_expanded_metadata(msg_type, msg_metadata);\n    for i in 0..msg_content.len() {\n        message[MESSAGE_EXPANDED_METADATA_LEN + i] = msg_content[i];\n    }\n\n    message\n}\n\n/// Decodes a standard aztec-nr message, i.e. one created via `encode_message`, returning the original encoded values.\n///\n/// Note that `encode_message` returns a fixed size array while this function takes a `BoundedVec`: this is because\n/// prior to decoding the message type is unknown, and consequentially not known at compile time. If working with\n/// fixed-size messages, consider using `BoundedVec::from_array` to convert them.\npub unconstrained fn decode_message(\n    message: BoundedVec<Field, MESSAGE_PLAINTEXT_LEN>,\n) -> (u64, u64, BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>) {\n    assert(\n        message.len() >= MESSAGE_EXPANDED_METADATA_LEN,\n        f\"Invalid message: it must have at least {MESSAGE_EXPANDED_METADATA_LEN} fields\",\n    );\n\n    // If MESSAGE_EXPANDED_METADATA_LEN is changed, causing the assertion below to fail, then the destructuring of\n    // the message encoding below must be updated as well.\n    std::static_assert(\n        MESSAGE_EXPANDED_METADATA_LEN == 1,\n        \"unexpected value for MESSAGE_EXPANDED_METADATA_LEN\",\n    );\n\n    let msg_expanded_metadata = message.get(0);\n    let (msg_type_id, msg_metadata) = from_expanded_metadata(msg_expanded_metadata);\n    let msg_content = array::subbvec(message, MESSAGE_EXPANDED_METADATA_LEN);\n\n    (msg_type_id, msg_metadata, msg_content)\n}\n\nglobal U64_SHIFT_MULTIPLIER: Field = 2.pow_32(64);\n\nfn to_expanded_metadata(msg_type: u64, msg_metadata: u64) -> Field {\n    // We use multiplication instead of bit shifting operations to shift the type bits as bit shift operations are\n    // expensive in circuits.\n    let type_field: Field = (msg_type as Field) * U64_SHIFT_MULTIPLIER;\n    let msg_metadata_field = msg_metadata as Field;\n\n    type_field + msg_metadata_field\n}\n\nfn from_expanded_metadata(input: Field) -> (u64, u64) {\n    input.assert_max_bit_size::<128>();\n    let msg_metadata = (input as u64);\n    let msg_type = ((input - (msg_metadata as Field)) / U64_SHIFT_MULTIPLIER) as u64;\n    // Use division instead of bit shift since bit shifts are expensive in circuits\n    (msg_type, msg_metadata)\n}\n\nmod tests {\n    use crate::utils::array::subarray::subarray;\n    use super::{\n        decode_message, encode_message, from_expanded_metadata, MAX_MESSAGE_CONTENT_LEN,\n        to_expanded_metadata,\n    };\n\n    global U64_MAX: u64 = (2.pow_32(64) - 1) as u64;\n    global U128_MAX: Field = (2.pow_32(128) - 1);\n\n    #[test]\n    unconstrained fn encode_decode_empty_message(msg_type: u64, msg_metadata: u64) {\n        let encoded = encode_message(msg_type, msg_metadata, []);\n        let (decoded_msg_type, decoded_msg_metadata, decoded_msg_content) =\n            decode_message(BoundedVec::from_array(encoded));\n\n        assert_eq(decoded_msg_type, msg_type);\n        assert_eq(decoded_msg_metadata, msg_metadata);\n        assert_eq(decoded_msg_content.len(), 0);\n    }\n\n    #[test]\n    unconstrained fn encode_decode_short_message(\n        msg_type: u64,\n        msg_metadata: u64,\n        msg_content: [Field; MAX_MESSAGE_CONTENT_LEN / 2],\n    ) {\n        let encoded = encode_message(msg_type, msg_metadata, msg_content);\n        let (decoded_msg_type, decoded_msg_metadata, decoded_msg_content) =\n            decode_message(BoundedVec::from_array(encoded));\n\n        assert_eq(decoded_msg_type, msg_type);\n        assert_eq(decoded_msg_metadata, msg_metadata);\n        assert_eq(decoded_msg_content.len(), msg_content.len());\n        assert_eq(subarray(decoded_msg_content.storage(), 0), msg_content);\n    }\n\n    #[test]\n    unconstrained fn encode_decode_full_message(\n        msg_type: u64,\n        msg_metadata: u64,\n        msg_content: [Field; MAX_MESSAGE_CONTENT_LEN],\n    ) {\n        let encoded = encode_message(msg_type, msg_metadata, msg_content);\n        let (decoded_msg_type, decoded_msg_metadata, decoded_msg_content) =\n            decode_message(BoundedVec::from_array(encoded));\n\n        assert_eq(decoded_msg_type, msg_type);\n        assert_eq(decoded_msg_metadata, msg_metadata);\n        assert_eq(decoded_msg_content.len(), msg_content.len());\n        assert_eq(subarray(decoded_msg_content.storage(), 0), msg_content);\n    }\n\n    #[test]\n    unconstrained fn to_expanded_metadata_packing() {\n        // Test case 1: All bits set\n        let packed = to_expanded_metadata(U64_MAX, U64_MAX);\n        let (msg_type, msg_metadata) = from_expanded_metadata(packed);\n        assert_eq(msg_type, U64_MAX);\n        assert_eq(msg_metadata, U64_MAX);\n\n        // Test case 2: Only log type bits set\n        let packed = to_expanded_metadata(U64_MAX, 0);\n        let (msg_type, msg_metadata) = from_expanded_metadata(packed);\n        assert_eq(msg_type, U64_MAX);\n        assert_eq(msg_metadata, 0);\n\n        // Test case 3: Only msg_metadata bits set\n        let packed = to_expanded_metadata(0, U64_MAX);\n        let (msg_type, msg_metadata) = from_expanded_metadata(packed);\n        assert_eq(msg_type, 0);\n        assert_eq(msg_metadata, U64_MAX);\n\n        // Test case 4: No bits set\n        let packed = to_expanded_metadata(0, 0);\n        let (msg_type, msg_metadata) = from_expanded_metadata(packed);\n        assert_eq(msg_type, 0);\n        assert_eq(msg_metadata, 0);\n    }\n\n    #[test]\n    unconstrained fn from_expanded_metadata_packing() {\n        // Test case 1: All bits set\n        let input = U128_MAX as Field;\n        let (msg_type, msg_metadata) = from_expanded_metadata(input);\n        assert_eq(msg_type, U64_MAX);\n        assert_eq(msg_metadata, U64_MAX);\n\n        // Test case 2: Only log type bits set\n        let input = (U128_MAX - U64_MAX as Field);\n        let (msg_type, msg_metadata) = from_expanded_metadata(input);\n        assert_eq(msg_type, U64_MAX);\n        assert_eq(msg_metadata, 0);\n\n        // Test case 3: Only msg_metadata bits set\n        let input = U64_MAX as Field;\n        let (msg_type, msg_metadata) = from_expanded_metadata(input);\n        assert_eq(msg_type, 0);\n        assert_eq(msg_metadata, U64_MAX);\n\n        // Test case 4: No bits set\n        let input = 0;\n        let (msg_type, msg_metadata) = from_expanded_metadata(input);\n        assert_eq(msg_type, 0);\n        assert_eq(msg_metadata, 0);\n    }\n\n    #[test]\n    unconstrained fn to_from_expanded_metadata(original_msg_type: u64, original_msg_metadata: u64) {\n        let packed = to_expanded_metadata(original_msg_type, original_msg_metadata);\n        let (unpacked_msg_type, unpacked_msg_metadata) = from_expanded_metadata(packed);\n\n        assert_eq(original_msg_type, unpacked_msg_type);\n        assert_eq(original_msg_metadata, unpacked_msg_metadata);\n    }\n}\n"
     },
-    "131": {
+    "132": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/encryption/aes128.nr",
       "source": "use dep::protocol_types::{\n    address::AztecAddress,\n    constants::{GENERATOR_INDEX__SYMMETRIC_KEY, GENERATOR_INDEX__SYMMETRIC_KEY_2},\n    hash::poseidon2_hash_with_separator,\n    point::Point,\n    public_keys::AddressPoint,\n};\n\nuse crate::{\n    keys::{ecdh_shared_secret::derive_ecdh_shared_secret, ephemeral::generate_ephemeral_key_pair},\n    messages::{\n        encoding::{\n            EPH_PK_SIGN_BYTE_SIZE_IN_BYTES, EPH_PK_X_SIZE_IN_FIELDS,\n            HEADER_CIPHERTEXT_SIZE_IN_BYTES, MESSAGE_CIPHERTEXT_LEN, MESSAGE_PLAINTEXT_LEN,\n        },\n        encryption::message_encryption::MessageEncryption,\n        logs::arithmetic_generics_utils::{\n            get_arr_of_size__message_bytes__from_PT,\n            get_arr_of_size__message_bytes_padding__from_PT,\n        },\n    },\n    oracle::{\n        aes128_decrypt::aes128_decrypt_oracle, random::random, shared_secret::get_shared_secret,\n    },\n    utils::{\n        array,\n        conversion::{\n            bytes_to_fields::{bytes_from_fields, bytes_to_fields},\n            fields_to_bytes::{fields_from_bytes, fields_to_bytes},\n        },\n        point::{get_sign_of_point, point_from_x_coord_and_sign},\n        random::get_random_bytes,\n    },\n};\n\nuse std::aes128::aes128_encrypt;\n\n/**\n * Computes N close-to-uniformly-random 256 bits from a given ECDH shared_secret.\n *\n * NEVER re-use the same iv and sym_key.\n * DO NOT call this function more than once with the same shared_secret.\n *\n * This function is only known to be safe if shared_secret is computed by combining a \n * random ephemeral key with an address point. See big comment within the body of the function.\n * See big comment within the body of the function.\n */\nfn extract_many_close_to_uniformly_random_256_bits_from_ecdh_shared_secret_using_poseidon2_unsafe<let N: u32>(\n    shared_secret: Point,\n) -> [[u8; 32]; N] {\n    /*\n     * Unsafe because of https://eprint.iacr.org/2010/264.pdf Page 13, Lemma 2 (and the * two paragraphs below it).\n     *\n     * If you call this function, you need to be careful and aware of how the arg\n     * `shared_secret` has been derived.\n     *\n     * The paper says that the way you derive aes keys and IVs should be fine with poseidon2\n     * (modelled as a RO), as long as you _don't_ use Poseidon2 as a PRG to generate the * two exponents x & y which multiply to the shared secret S:\n     *\n     * S = [x*y]*G.\n     *\n     * (Otherwise, you would have to \"key\" poseidon2, i.e. generate a uniformly string K\n     * which can be public and compute Hash(x) as poseidon(K,x)).\n     * In that lemma, k would be 2*254=508, and m would be the number of points on the * grumpkin curve (which is close to r according to the Hasse bound).\n     *\n     * Our shared secret S is [esk * address_sk] * G, and the question is: * Can we compute hash(S) using poseidon2 instead of sha256?\n     *\n     * Well, esk is random and not generated with poseidon2, so that's good.\n     * What about address_sk?\n     * Well, address_sk = poseidon2(stuff) + ivsk, so there was some\n     * discussion about whether address_sk is independent of poseidon2.\n     * Given that ivsk is random and independent of poseidon2, the address_sk is also\n     * independent of poseidon2.\n     *\n     * Tl;dr: we believe it's safe to hash S = [esk * address_sk] * G using poseidon2,\n     * in order to derive a symmetric key.\n     *\n     * If you're calling this function for a differently-derived `shared_secret`, be\n     * careful.\n     *\n     */\n\n    /* The output of this function needs to be 32 random bytes.\n     * A single field won't give us 32 bytes of entropy.\n     * So we compute two \"random\" fields, by poseidon-hashing with two different\n     * generators.\n     * We then extract the last 16 (big endian) bytes of each \"random\" field.\n     * Note: we use to_be_bytes because it's slightly more efficient. But we have to\n     * be careful not to take bytes from the \"big end\", because the \"big\" byte is\n     * not uniformly random over the byte: it only has < 6 bits of randomness, because\n     * it's the big end of a 254-bit field element.\n     */\n\n    let mut all_bytes: [[u8; 32]; N] = std::mem::zeroed();\n    // We restrict N to be < 2^8, because of how we compute the domain separator\n    // from k below (where k <= N must be 8 bits). In practice, it's extremely\n    // unlikely that an app will want to compute >= 256 ciphertexts.\n    std::static_assert(N < 256, \"N too large\");\n    for k in 0..N {\n        // We augment the domain separator with the loop index, so that we can\n        // generate N lots of randomness.\n        let k_shift = (k as u16 << 8);\n        let separator_1 = k_shift + GENERATOR_INDEX__SYMMETRIC_KEY as u16;\n        let separator_2 = k_shift + GENERATOR_INDEX__SYMMETRIC_KEY_2 as u16;\n\n        let rand1: Field =\n            poseidon2_hash_with_separator([shared_secret.x, shared_secret.y], separator_1);\n        let rand2: Field =\n            poseidon2_hash_with_separator([shared_secret.x, shared_secret.y], separator_2);\n\n        let rand1_bytes: [u8; 32] = rand1.to_be_bytes();\n        let rand2_bytes: [u8; 32] = rand2.to_be_bytes();\n\n        let mut bytes: [u8; 32] = [0; 32];\n        for i in 0..16 {\n            // We take bytes from the \"little end\" of the be-bytes arrays:\n            let j = 32 - i - 1;\n            bytes[i] = rand1_bytes[j];\n            bytes[16 + i] = rand2_bytes[j];\n        }\n\n        all_bytes[k] = bytes;\n    }\n\n    all_bytes\n}\n\nfn derive_aes_symmetric_key_and_iv_from_uniformly_random_256_bits<let N: u32>(\n    many_random_256_bits: [[u8; 32]; N],\n) -> [([u8; 16], [u8; 16]); N] {\n    // Many (sym_key, iv) pairs:\n    let mut many_pairs: [([u8; 16], [u8; 16]); N] = std::mem::zeroed();\n    for k in 0..N {\n        let random_256_bits = many_random_256_bits[k];\n        let mut sym_key = [0; 16];\n        let mut iv = [0; 16];\n        for i in 0..16 {\n            sym_key[i] = random_256_bits[i];\n            iv[i] = random_256_bits[i + 16];\n        }\n        many_pairs[k] = (sym_key, iv);\n    }\n\n    many_pairs\n}\n\npub fn derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_poseidon2_unsafe<let N: u32>(\n    shared_secret: Point,\n) -> [([u8; 16], [u8; 16]); N] {\n    let many_random_256_bits: [[u8; 32]; N] = extract_many_close_to_uniformly_random_256_bits_from_ecdh_shared_secret_using_poseidon2_unsafe(\n        shared_secret,\n    );\n\n    derive_aes_symmetric_key_and_iv_from_uniformly_random_256_bits(many_random_256_bits)\n}\n\npub struct AES128 {}\n\nimpl MessageEncryption for AES128 {\n    fn encrypt<let PlaintextLen: u32>(\n        plaintext: [Field; PlaintextLen],\n        recipient: AztecAddress,\n    ) -> [Field; MESSAGE_CIPHERTEXT_LEN] {\n        // AES 128 operates on bytes, not fields, so we need to convert the fields to bytes.\n        // (This process is then reversed when processing the message in `do_process_message`)\n        let plaintext_bytes = fields_to_bytes(plaintext);\n\n        // *****************************************************************************\n        // Compute the shared secret\n        // *****************************************************************************\n\n        let (eph_sk, eph_pk) = generate_ephemeral_key_pair();\n\n        let eph_pk_sign_byte: u8 = get_sign_of_point(eph_pk) as u8;\n\n        // (not to be confused with the tagging shared secret)\n        // TODO (#17158): Currently we unwrap the Option returned by derive_ecdh_shared_secret.\n        // We need to handle the case where the ephemeral public key is invalid to prevent potential DoS vectors.\n        let ciphertext_shared_secret = derive_ecdh_shared_secret(\n            eph_sk,\n            recipient\n                .to_address_point()\n                .unwrap_or(\n                    // Safety: if the recipient is an invalid address, then it is not possible to encrypt a message for\n                    // them because we cannot establish a shared secret. This is never expected to occur during normal\n                    // operation. However, it is technically possible for us to receive an invalid address, and we must\n                    // therefore handle it.\n                    // We could simply fail, but that'd introduce a potential security issue in which an attacker forces\n                    // a contract to encrypt a message for an invalid address, resulting in an impossible transaction -\n                    // this is sometimes called a 'king of the hill' attack.\n                    // We choose instead to not fail and encrypt the plaintext regardless using the shared secret that\n                    // results from a random valid address. The sender is free to choose this address and hence shared\n                    // secret, but this has no security implications as they already know not only the full plaintext\n                    // but also the ephemeral private key anyway.\n                    unsafe { random_address_point() },\n                )\n                .inner,\n        );\n        // TODO: also use this shared secret for deriving note randomness.\n\n        // *****************************************************************************\n        // Convert the plaintext into whatever format the encryption function expects\n        // *****************************************************************************\n\n        // Already done for this strategy: AES expects bytes.\n\n        // *****************************************************************************\n        // Encrypt the plaintext\n        // *****************************************************************************\n\n        // It is safe to call the `unsafe` function here, because we know the `shared_secret`\n        // was derived using an AztecAddress (the recipient). See the block comment\n        // at the start of this unsafe target function for more info.\n        let pairs = derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_poseidon2_unsafe::<2>(\n            ciphertext_shared_secret,\n        );\n        let (body_sym_key, body_iv) = pairs[0];\n        let (header_sym_key, header_iv) = pairs[1];\n\n        let ciphertext_bytes = aes128_encrypt(plaintext_bytes, body_iv, body_sym_key);\n\n        // |full_pt| = |pt_length| + |pt|\n        // |pt_aes_padding| = 16 - (|full_pt| % 16)\n        // or... since a % b is the same as a - b * (a // b) (integer division), so:\n        // |pt_aes_padding| = 16 - (|full_pt| - 16 * (|full_pt| // 16))\n        // |ct| = |full_pt| + |pt_aes_padding|\n        //      = |full_pt| + 16 - (|full_pt| - 16 * (|full_pt| // 16))\n        //      = 16 + 16 * (|full_pt| // 16)\n        //      = 16 * (1 + |full_pt| // 16)\n        std::static_assert(\n            ciphertext_bytes.len() == 16 * (1 + (PlaintextLen * 32) / 16),\n            \"unexpected ciphertext length\",\n        );\n\n        // *****************************************************************************\n        // Compute the header ciphertext\n        // *****************************************************************************\n\n        // Header contains only the length of the ciphertext stored in 2 bytes.\n        let mut header_plaintext: [u8; 2] = [0 as u8; 2];\n        let ciphertext_bytes_length = ciphertext_bytes.len();\n        header_plaintext[0] = (ciphertext_bytes_length >> 8) as u8;\n        header_plaintext[1] = ciphertext_bytes_length as u8;\n\n        // Note: the aes128_encrypt builtin fn automatically appends bytes to the\n        // input, according to pkcs#7; hence why the output `header_ciphertext_bytes` is 16\n        // bytes larger than the input in this case.\n        let header_ciphertext_bytes = aes128_encrypt(header_plaintext, header_iv, header_sym_key);\n        // I recall that converting a slice to an array incurs constraints, so I'll check the length this way instead:\n        std::static_assert(\n            header_ciphertext_bytes.len() == HEADER_CIPHERTEXT_SIZE_IN_BYTES,\n            \"unexpected ciphertext header length\",\n        );\n\n        // *****************************************************************************\n        // Prepend / append more bytes of data to the ciphertext, before converting back\n        // to fields.\n        // *****************************************************************************\n\n        let mut message_bytes_padding_to_mult_31 =\n            get_arr_of_size__message_bytes_padding__from_PT::<PlaintextLen * 32>();\n        // Safety: this randomness won't be constrained to be random. It's in the\n        // interest of the executor of this fn to encrypt with random bytes.\n        message_bytes_padding_to_mult_31 = unsafe { get_random_bytes() };\n\n        let mut message_bytes = get_arr_of_size__message_bytes__from_PT::<PlaintextLen * 32>();\n\n        std::static_assert(\n            message_bytes.len() % 31 == 0,\n            \"Unexpected error: message_bytes.len() should be divisible by 31, by construction.\",\n        );\n\n        message_bytes[0] = eph_pk_sign_byte;\n        let mut offset = 1;\n        for i in 0..header_ciphertext_bytes.len() {\n            message_bytes[offset + i] = header_ciphertext_bytes[i];\n        }\n        offset += header_ciphertext_bytes.len();\n\n        for i in 0..ciphertext_bytes.len() {\n            message_bytes[offset + i] = ciphertext_bytes[i];\n        }\n        offset += ciphertext_bytes.len();\n\n        for i in 0..message_bytes_padding_to_mult_31.len() {\n            message_bytes[offset + i] = message_bytes_padding_to_mult_31[i];\n        }\n        offset += message_bytes_padding_to_mult_31.len();\n\n        // Ideally we would be able to have a static assert where we check that the offset would be such that we've\n        // written to the entire log_bytes array, but we cannot since Noir does not treat the offset as a comptime\n        // value (despite the values that it goes through being known at each stage). We instead check that the\n        // computation used to obtain the offset computes the expected value (which we _can_ do in a static check), and\n        // then add a cheap runtime check to also validate that the offset matches this.\n        std::static_assert(\n            1\n                + header_ciphertext_bytes.len()\n                + ciphertext_bytes.len()\n                + message_bytes_padding_to_mult_31.len()\n                == message_bytes.len(),\n            \"unexpected message length\",\n        );\n        assert(offset == message_bytes.len(), \"unexpected encrypted message length\");\n\n        // *****************************************************************************\n        // Convert bytes back to fields\n        // *****************************************************************************\n\n        // TODO(#12749): As Mike pointed out, we need to make messages produced by different encryption schemes\n        // indistinguishable from each other and for this reason the output here and in the last for-loop of this function\n        // should cover a full field.\n        let message_bytes_as_fields = bytes_to_fields(message_bytes);\n\n        // *****************************************************************************\n        // Prepend / append fields, to create the final message\n        // *****************************************************************************\n\n        let mut ciphertext: [Field; MESSAGE_CIPHERTEXT_LEN] = [0; MESSAGE_CIPHERTEXT_LEN];\n\n        ciphertext[0] = eph_pk.x;\n\n        let mut offset = 1;\n        for i in 0..message_bytes_as_fields.len() {\n            ciphertext[offset + i] = message_bytes_as_fields[i];\n        }\n        offset += message_bytes_as_fields.len();\n\n        for i in offset..MESSAGE_CIPHERTEXT_LEN {\n            // We need to get a random value that fits in 31 bytes to not leak information about the size of the message\n            // (all the \"real\" message fields contain at most 31 bytes because of the way we convert the bytes to fields).\n            // TODO(#12749): Long term, this is not a good solution.\n\n            // Safety: we assume that the sender wants for the message to be private - a malicious one could simply reveal its\n            // contents publicly. It is therefore fine to trust the sender to provide random padding.\n            let field_bytes = unsafe { get_random_bytes::<31>() };\n            ciphertext[i] = Field::from_be_bytes::<31>(field_bytes);\n        }\n\n        ciphertext\n    }\n\n    unconstrained fn decrypt(\n        ciphertext: BoundedVec<Field, MESSAGE_CIPHERTEXT_LEN>,\n        recipient: AztecAddress,\n    ) -> Option<BoundedVec<Field, MESSAGE_PLAINTEXT_LEN>> {\n        let eph_pk_x = ciphertext.get(0);\n\n        let ciphertext_without_eph_pk_x_fields = array::subbvec::<Field, MESSAGE_CIPHERTEXT_LEN, MESSAGE_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS>(\n            ciphertext,\n            EPH_PK_X_SIZE_IN_FIELDS,\n        );\n\n        // Convert the ciphertext represented as fields to a byte representation (its original format)\n        let ciphertext_without_eph_pk_x = bytes_from_fields(ciphertext_without_eph_pk_x_fields);\n\n        // First byte of the ciphertext represents the ephemeral public key sign\n        let eph_pk_sign_bool = ciphertext_without_eph_pk_x.get(0) != 0;\n\n        // With the sign and the x-coordinate of the ephemeral public key, we can reconstruct the point. This may fail\n        // however, as not all x-coordinates are on the curve. In that case, we simply return `Option::none`.\n        point_from_x_coord_and_sign(eph_pk_x, eph_pk_sign_bool).map(|eph_pk| {\n            // Derive shared secret\n            let ciphertext_shared_secret = get_shared_secret(recipient, eph_pk);\n\n            // Derive symmetric keys:\n            let pairs = derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_poseidon2_unsafe::<2>(\n                ciphertext_shared_secret,\n            );\n            let (body_sym_key, body_iv) = pairs[0];\n            let (header_sym_key, header_iv) = pairs[1];\n\n            // Extract the header ciphertext\n            let header_start = EPH_PK_SIGN_BYTE_SIZE_IN_BYTES; // Skip eph_pk_sign byte\n            let header_ciphertext: [u8; HEADER_CIPHERTEXT_SIZE_IN_BYTES] =\n                array::subarray(ciphertext_without_eph_pk_x.storage(), header_start);\n            // We need to convert the array to a BoundedVec because the oracle expects a BoundedVec as it's designed to work\n            // with messages with unknown length at compile time. This would not be necessary here as the header ciphertext length\n            // is fixed. But we do it anyway to not have to have duplicate oracles.\n            let header_ciphertext_bvec =\n                BoundedVec::<u8, HEADER_CIPHERTEXT_SIZE_IN_BYTES>::from_array(header_ciphertext);\n\n            // Decrypt header\n            let header_plaintext =\n                aes128_decrypt_oracle(header_ciphertext_bvec, header_iv, header_sym_key);\n\n            // Extract ciphertext length from header (2 bytes, big-endian)\n            let ciphertext_length =\n                ((header_plaintext.get(0) as u32) << 8) | (header_plaintext.get(1) as u32);\n\n            // Extract and decrypt main ciphertext\n            let ciphertext_start = header_start + HEADER_CIPHERTEXT_SIZE_IN_BYTES;\n            let ciphertext_with_padding: [u8; (MESSAGE_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS) * 31 - HEADER_CIPHERTEXT_SIZE_IN_BYTES - EPH_PK_SIGN_BYTE_SIZE_IN_BYTES] =\n                array::subarray(ciphertext_without_eph_pk_x.storage(), ciphertext_start);\n            let ciphertext: BoundedVec<u8, (MESSAGE_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS) * 31 - HEADER_CIPHERTEXT_SIZE_IN_BYTES - EPH_PK_SIGN_BYTE_SIZE_IN_BYTES> =\n                BoundedVec::from_parts(ciphertext_with_padding, ciphertext_length);\n\n            // Decrypt main ciphertext and return it\n            let plaintext_bytes = aes128_decrypt_oracle(ciphertext, body_iv, body_sym_key);\n\n            // Each field of the original note message was serialized to 32 bytes so we convert the bytes back to fields.\n            fields_from_bytes(plaintext_bytes)\n        })\n    }\n}\n\n/// Produces a random valid address point, i.e. one that is on the curve. This is equivalent to calling\n/// [AztecAddress::to_address_point] on a random valid address.\nunconstrained fn random_address_point() -> AddressPoint {\n    let mut result = std::mem::zeroed();\n\n    loop {\n        // We simply produce random x coordinates until we find one that is on the curve. About half of the x\n        // coordinates fulfill this condition, so this should only take a few iterations at most.\n        let x_coord = random();\n        let point = point_from_x_coord_and_sign(x_coord, true);\n        if point.is_some() {\n            result = AddressPoint { inner: point.unwrap() };\n            break;\n        }\n    }\n\n    result\n}\n\nmod test {\n    use crate::{\n        keys::ecdh_shared_secret::derive_ecdh_shared_secret,\n        messages::{\n            encoding::MESSAGE_PLAINTEXT_LEN, encryption::message_encryption::MessageEncryption,\n        },\n        test::helpers::test_environment::TestEnvironment,\n    };\n    use super::{AES128, random_address_point};\n    use protocol_types::{address::AztecAddress, traits::FromField};\n    use std::{embedded_curve_ops::EmbeddedCurveScalar, test::OracleMock};\n\n    #[test]\n    unconstrained fn encrypt_decrypt_deterministic() {\n        let env = TestEnvironment::new();\n\n        // Message decryption requires oracles that are only available during private execution\n        env.private_context(|_| {\n            let plaintext = [1, 2, 3];\n\n            let recipient = AztecAddress::from_field(\n                0x25afb798ea6d0b8c1618e50fdeafa463059415013d3b7c75d46abf5e242be70c,\n            );\n\n            // Mock random values for deterministic test\n            let eph_sk = 0x1358d15019d4639393d62b97e1588c095957ce74a1c32d6ec7d62fe6705d9538;\n            let _ = OracleMock::mock(\"utilityGetRandomField\").returns(eph_sk).times(1);\n\n            let randomness = 0x0101010101010101010101010101010101010101010101010101010101010101;\n            let _ = OracleMock::mock(\"utilityGetRandomField\").returns(randomness).times(1000000);\n\n            let _ = OracleMock::mock(\"privateGetNextAppTagAsSender\").returns(42);\n\n            // Encrypt the message\n            let encrypted_message = BoundedVec::from_array(AES128::encrypt(plaintext, recipient));\n\n            // Mock shared secret for deterministic test\n            let shared_secret = derive_ecdh_shared_secret(\n                EmbeddedCurveScalar::from_field(eph_sk),\n                recipient.to_address_point().unwrap().inner,\n            );\n\n            let _ = OracleMock::mock(\"utilityGetSharedSecret\").returns(shared_secret);\n\n            // Decrypt the message\n            let decrypted = AES128::decrypt(encrypted_message, recipient).unwrap();\n\n            // The decryption function spits out a BoundedVec because it's designed to work with messages with unknown length\n            // at compile time. For this reason we need to convert the original input to a BoundedVec.\n            let plaintext_bvec = BoundedVec::<Field, MESSAGE_PLAINTEXT_LEN>::from_array(plaintext);\n\n            // Verify decryption matches original plaintext\n            assert_eq(\n                decrypted,\n                plaintext_bvec,\n                \"Decrypted bytes should match original plaintext\",\n            );\n\n            // The following is a workaround of \"struct is never constructed\" Noir compilation error (we only ever use\n            // static methods of the struct).\n            let _ = AES128 {};\n        });\n    }\n\n    #[test]\n    unconstrained fn encrypt_decrypt_random() {\n        // Same as `encrypt_decrypt_deterministic`, except we don't mock any of the oracles and rely on\n        // `TestEnvironment` instead.\n        let mut env = TestEnvironment::new();\n\n        let recipient = env.create_light_account();\n\n        env.private_context(|_| {\n            let plaintext = [1, 2, 3];\n            let ciphertext = AES128::encrypt(plaintext, recipient);\n\n            assert_eq(\n                AES128::decrypt(BoundedVec::from_array(ciphertext), recipient).unwrap(),\n                BoundedVec::from_array(plaintext),\n            );\n        });\n    }\n\n    #[test]\n    unconstrained fn encrypt_to_invalid_address() {\n        // x = 3 is a non-residue for this curve, resulting in an invalid address\n        let invalid_address = AztecAddress { inner: 3 };\n\n        // We just test that we produced some output and did not crash - the result is gibberish as it is encrypted\n        // using a public key for which we do not know the private key.\n        let _ = AES128::encrypt([1, 2, 3, 4], invalid_address);\n    }\n\n    #[test]\n    unconstrained fn random_address_point_produces_valid_points() {\n        // About half of random addresses are invalid, so testing just a couple gives us high confidence that\n        // `random_address_point` is indeed producing valid addresses.\n        for _ in 0..10 {\n            let random_address = AztecAddress { inner: random_address_point().inner.x };\n            assert(random_address.to_address_point().is_some());\n        }\n    }\n\n    #[test]\n    unconstrained fn decrypt_invalid_ephemeral_public_key() {\n        let mut env = TestEnvironment::new();\n\n        let recipient = env.create_light_account();\n\n        env.private_context(|_| {\n            let plaintext = [1, 2, 3, 4];\n            let ciphertext = AES128::encrypt(plaintext, recipient);\n\n            // The first field of the ciphertext is the x-coordinate of the ephemeral public key. We set it to a known\n            // non-residue (3), causing `decrypt` to fail to produce a decryption shared secret.\n            let mut bad_ciphertext = BoundedVec::from_array(ciphertext);\n            bad_ciphertext.set(0, 3);\n\n            assert(AES128::decrypt(bad_ciphertext, recipient).is_none());\n        });\n    }\n}\n"
     },
-    "148": {
+    "149": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/processing/mod.nr",
       "source": "pub(crate) mod event_validation_request;\npub mod message_context;\npub(crate) mod note_validation_request;\npub(crate) mod log_retrieval_request;\npub(crate) mod log_retrieval_response;\npub(crate) mod pending_tagged_log;\n\nuse crate::{\n    capsules::CapsuleArray,\n    event::event_selector::EventSelector,\n    messages::{\n        discovery::{\n            partial_notes::DeliveredPendingPartialNote, private_events::MAX_EVENT_SERIALIZED_LEN,\n            private_notes::MAX_NOTE_PACKED_LEN,\n        },\n        processing::{\n            log_retrieval_request::LogRetrievalRequest,\n            log_retrieval_response::LogRetrievalResponse,\n            note_validation_request::NoteValidationRequest, pending_tagged_log::PendingTaggedLog,\n        },\n    },\n    oracle,\n};\nuse event_validation_request::EventValidationRequest;\nuse protocol_types::{address::AztecAddress, hash::sha256_to_field};\n\n// Base slot for the pending tagged log array to which the fetch_tagged_logs oracle inserts found private logs.\nglobal PENDING_TAGGED_LOG_ARRAY_BASE_SLOT: Field =\n    sha256_to_field(\"AZTEC_NR::PENDING_TAGGED_LOG_ARRAY_BASE_SLOT\".as_bytes());\n\nglobal NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT: Field = sha256_to_field(\n    \"AZTEC_NR::NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT\".as_bytes(),\n);\n\nglobal EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT: Field = sha256_to_field(\n    \"AZTEC_NR::EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT\".as_bytes(),\n);\n\nglobal LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT: Field = sha256_to_field(\n    \"AZTEC_NR::LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT\".as_bytes(),\n);\n\nglobal LOG_RETRIEVAL_RESPONSES_ARRAY_BASE_SLOT: Field = sha256_to_field(\n    \"AZTEC_NR::LOG_RETRIEVAL_RESPONSES_ARRAY_BASE_SLOT\".as_bytes(),\n);\n\n/// Searches for private logs emitted by `contract_address` that might contain messages for one of the local accounts,\n/// and stores them in a `CapsuleArray` which is then returned.\npub(crate) unconstrained fn get_private_logs(\n    contract_address: AztecAddress,\n) -> CapsuleArray<PendingTaggedLog> {\n    // We will eventually perform log discovery via tagging here, but for now we simply call the `fetchTaggedLogs`\n    // oracle. This makes PXE synchronize tags, download logs and store the pending tagged logs in a capsule array.\n    oracle::message_processing::fetch_tagged_logs(PENDING_TAGGED_LOG_ARRAY_BASE_SLOT);\n\n    CapsuleArray::at(contract_address, PENDING_TAGGED_LOG_ARRAY_BASE_SLOT)\n}\n\n/// Enqueues a note for validation by PXE, so that it becomes aware of a note's existence allowing for later retrieval\n/// via `get_notes` oracle. The note will be scoped to `contract_address`, meaning other contracts will not be able to\n/// access it unless authorized.\n///\n/// In order for the note validation and insertion to occur, `validate_enqueued_notes_and_events` must be later called.\n/// For optimal performance, accumulate as many note validation requests as possible and then validate them all at the\n/// end (which results in PXE minimizing the number of network round-trips).\n///\n/// The `packed_note` is what `getNotes` will later return. PXE indexes notes by `storage_slot`, so this value\n/// is typically used to filter notes that correspond to different state variables. `note_hash` and `nullifier` are\n/// the inner hashes, i.e. the raw hashes returned by `NoteHash::compute_note_hash` and\n/// `NoteHash::compute_nullifier`. PXE will verify that the siloed unique note hash was inserted into the tree\n/// at `tx_hash`, and will store the nullifier to later check for nullification.\n///\n/// `owner` is the address used in note hash and nullifier computation, often requiring knowledge of their\n/// nullifier secret key.\n///\n/// `recipient` is the account to which the note message was delivered (i.e. the address the message was encrypted to).\n/// This determines which PXE account can see the note - other accounts will not be able to access it (e.g. other\n/// accounts will not be able to see one another's token balance notes, even in the same PXE) unless authorized. In most\n/// cases `recipient` equals `owner`, but they can differ in scenarios like delegated discovery.\npub(crate) unconstrained fn enqueue_note_for_validation(\n    contract_address: AztecAddress,\n    owner: AztecAddress,\n    storage_slot: Field,\n    randomness: Field,\n    note_nonce: Field,\n    packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n    note_hash: Field,\n    nullifier: Field,\n    tx_hash: Field,\n    recipient: AztecAddress,\n) {\n    // We store requests in a `CapsuleArray`, which PXE will later read from and deserialize into its version of the\n    // Noir `NoteValidationRequest`\n    CapsuleArray::at(contract_address, NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT).push(\n        NoteValidationRequest {\n            contract_address,\n            owner,\n            storage_slot,\n            randomness,\n            note_nonce,\n            packed_note,\n            note_hash,\n            nullifier,\n            tx_hash,\n            recipient,\n        },\n    )\n}\n\n/// Enqueues an event for validation by PXE, so that it can be efficiently validated and then inserted into the event\n/// store.\n///\n/// In order for the event validation and insertion to occur, `validate_enqueued_notes_and_events` must be later\n/// called. For optimal performance, accumulate as many event validation requests as possible and then validate them\n/// all at the end (which results in PXE minimizing the number of network round-trips).\npub(crate) unconstrained fn enqueue_event_for_validation(\n    contract_address: AztecAddress,\n    event_type_id: EventSelector,\n    serialized_event: BoundedVec<Field, MAX_EVENT_SERIALIZED_LEN>,\n    event_commitment: Field,\n    tx_hash: Field,\n    recipient: AztecAddress,\n) {\n    // We store requests in a `CapsuleArray`, which PXE will later read from and deserialize into its version of the\n    // Noir `EventValidationRequest`\n    CapsuleArray::at(contract_address, EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT).push(\n        EventValidationRequest {\n            contract_address,\n            event_type_id,\n            serialized_event,\n            event_commitment,\n            tx_hash,\n            recipient,\n        },\n    )\n}\n\n/// Validates all note and event validation requests enqueued via `enqueue_note_for_validation` and\n/// `enqueue_event_for_validation`, inserting them into the note database and event store respectively, making them\n/// queryable via `get_notes` oracle and our TS API (PXE::getPrivateEvents).\n///\n/// This automatically clears both validation request queues, so no further work needs to be done by the caller.\npub(crate) unconstrained fn validate_enqueued_notes_and_events(contract_address: AztecAddress) {\n    oracle::message_processing::validate_enqueued_notes_and_events(\n        contract_address,\n        NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT,\n        EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT,\n    );\n}\n\n/// Efficiently queries the node for logs that result in the completion of all `DeliveredPendingPartialNote`s stored in\n/// a `CapsuleArray` by performing all node communication concurrently. Returns a second `CapsuleArray` with Options for\n/// the responses that correspond to the pending partial notes at the same index.\n///\n/// For example, given an array with pending partial notes `[ p1, p2, p3 ]`, where `p1` and `p3` have corresponding\n/// completion logs but `p2` does not, the returned `CapsuleArray` will have contents\n/// `[some(p1_log), none(), some(p3_log)]`.\npub(crate) unconstrained fn get_pending_partial_notes_completion_logs(\n    contract_address: AztecAddress,\n    pending_partial_notes: CapsuleArray<DeliveredPendingPartialNote>,\n) -> CapsuleArray<Option<LogRetrievalResponse>> {\n    let log_retrieval_requests =\n        CapsuleArray::at(contract_address, LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT);\n\n    // We create a LogRetrievalRequest for each PendingPartialNote in the CapsuleArray. Because we need the indices in\n    // the request array to match the indices in the partial note array, we can't use CapsuleArray::for_each, as that\n    // function has arbitrary iteration order. Instead, we manually iterate the array from the beginning and push into\n    // the requests array, which we expect to be empty.\n    let mut i = 0;\n    let pending_partial_notes_count = pending_partial_notes.len();\n    while i < pending_partial_notes_count {\n        let pending_partial_note = pending_partial_notes.get(i);\n        log_retrieval_requests.push(\n            LogRetrievalRequest {\n                contract_address,\n                unsiloed_tag: pending_partial_note.note_completion_log_tag,\n            },\n        );\n        i += 1;\n    }\n\n    oracle::message_processing::bulk_retrieve_logs(\n        contract_address,\n        LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT,\n        LOG_RETRIEVAL_RESPONSES_ARRAY_BASE_SLOT,\n    );\n\n    CapsuleArray::at(contract_address, LOG_RETRIEVAL_RESPONSES_ARRAY_BASE_SLOT)\n}\n"
     },
@@ -3405,19 +3409,19 @@
       "path": "std/embedded_curve_ops.nr",
       "source": "use crate::cmp::Eq;\nuse crate::hash::Hash;\nuse crate::ops::arith::{Add, Neg, Sub};\n\n/// A point on the embedded elliptic curve\n/// By definition, the base field of the embedded curve is the scalar field of the proof system curve, i.e the Noir Field.\n/// x and y denotes the Weierstrass coordinates of the point, if is_infinite is false.\npub struct EmbeddedCurvePoint {\n    pub x: Field,\n    pub y: Field,\n    pub is_infinite: bool,\n}\n\nimpl EmbeddedCurvePoint {\n    /// Elliptic curve point doubling operation\n    /// returns the doubled point of a point P, i.e P+P\n    pub fn double(self) -> EmbeddedCurvePoint {\n        embedded_curve_add(self, self)\n    }\n\n    /// Returns the null element of the curve; 'the point at infinity'\n    pub fn point_at_infinity() -> EmbeddedCurvePoint {\n        EmbeddedCurvePoint { x: 0, y: 0, is_infinite: true }\n    }\n\n    /// Returns the curve's generator point.\n    pub fn generator() -> EmbeddedCurvePoint {\n        // Generator point for the grumpkin curve (y^2 = x^3 - 17)\n        EmbeddedCurvePoint {\n            x: 1,\n            y: 17631683881184975370165255887551781615748388533673675138860, // sqrt(-16)\n            is_infinite: false,\n        }\n    }\n}\n\nimpl Add for EmbeddedCurvePoint {\n    /// Adds two points P+Q, using the curve addition formula, and also handles point at infinity\n    fn add(self, other: EmbeddedCurvePoint) -> EmbeddedCurvePoint {\n        embedded_curve_add(self, other)\n    }\n}\n\nimpl Sub for EmbeddedCurvePoint {\n    /// Points subtraction operation, using addition and negation\n    fn sub(self, other: EmbeddedCurvePoint) -> EmbeddedCurvePoint {\n        self + other.neg()\n    }\n}\n\nimpl Neg for EmbeddedCurvePoint {\n    /// Negates a point P, i.e returns -P, by negating the y coordinate.\n    /// If the point is at infinity, then the result is also at infinity.\n    fn neg(self) -> EmbeddedCurvePoint {\n        EmbeddedCurvePoint { x: self.x, y: -self.y, is_infinite: self.is_infinite }\n    }\n}\n\nimpl Eq for EmbeddedCurvePoint {\n    /// Checks whether two points are equal\n    fn eq(self: Self, b: EmbeddedCurvePoint) -> bool {\n        (self.is_infinite & b.is_infinite)\n            | ((self.is_infinite == b.is_infinite) & (self.x == b.x) & (self.y == b.y))\n    }\n}\n\nimpl Hash for EmbeddedCurvePoint {\n    fn hash<H>(self, state: &mut H)\n    where\n        H: crate::hash::Hasher,\n    {\n        if self.is_infinite {\n            self.is_infinite.hash(state);\n        } else {\n            self.x.hash(state);\n            self.y.hash(state);\n        }\n    }\n}\n\n/// Scalar for the embedded curve represented as low and high limbs\n/// By definition, the scalar field of the embedded curve is base field of the proving system curve.\n/// It may not fit into a Field element, so it is represented with two Field elements; its low and high limbs.\npub struct EmbeddedCurveScalar {\n    pub lo: Field,\n    pub hi: Field,\n}\n\nimpl EmbeddedCurveScalar {\n    pub fn new(lo: Field, hi: Field) -> Self {\n        EmbeddedCurveScalar { lo, hi }\n    }\n\n    #[field(bn254)]\n    pub fn from_field(scalar: Field) -> EmbeddedCurveScalar {\n        let (a, b) = crate::field::bn254::decompose(scalar);\n        EmbeddedCurveScalar { lo: a, hi: b }\n    }\n\n    //Bytes to scalar: take the first (after the specified offset) 16 bytes of the input as the lo value, and the next 16 bytes as the hi value\n    #[field(bn254)]\n    pub(crate) fn from_bytes(bytes: [u8; 64], offset: u32) -> EmbeddedCurveScalar {\n        let mut v = 1;\n        let mut lo = 0 as Field;\n        let mut hi = 0 as Field;\n        for i in 0..16 {\n            lo = lo + (bytes[offset + 31 - i] as Field) * v;\n            hi = hi + (bytes[offset + 15 - i] as Field) * v;\n            v = v * 256;\n        }\n        let sig_s = crate::embedded_curve_ops::EmbeddedCurveScalar { lo, hi };\n        sig_s\n    }\n}\n\nimpl Eq for EmbeddedCurveScalar {\n    fn eq(self, other: Self) -> bool {\n        (other.hi == self.hi) & (other.lo == self.lo)\n    }\n}\n\nimpl Hash for EmbeddedCurveScalar {\n    fn hash<H>(self, state: &mut H)\n    where\n        H: crate::hash::Hasher,\n    {\n        self.hi.hash(state);\n        self.lo.hash(state);\n    }\n}\n\n// Computes a multi scalar multiplication over the embedded curve.\n// For bn254, We have Grumpkin and Baby JubJub.\n// For bls12-381, we have JubJub and Bandersnatch.\n//\n// The embedded curve being used is decided by the\n// underlying proof system.\n// docs:start:multi_scalar_mul\npub fn multi_scalar_mul<let N: u32>(\n    points: [EmbeddedCurvePoint; N],\n    scalars: [EmbeddedCurveScalar; N],\n) -> EmbeddedCurvePoint\n// docs:end:multi_scalar_mul\n{\n    multi_scalar_mul_array_return(points, scalars, true)[0]\n}\n\n#[foreign(multi_scalar_mul)]\npub(crate) fn multi_scalar_mul_array_return<let N: u32>(\n    points: [EmbeddedCurvePoint; N],\n    scalars: [EmbeddedCurveScalar; N],\n    predicate: bool,\n) -> [EmbeddedCurvePoint; 1] {}\n\n// docs:start:fixed_base_scalar_mul\npub fn fixed_base_scalar_mul(scalar: EmbeddedCurveScalar) -> EmbeddedCurvePoint\n// docs:end:fixed_base_scalar_mul\n{\n    multi_scalar_mul([EmbeddedCurvePoint::generator()], [scalar])\n}\n\n/// This function only assumes that the points are on the curve\n/// It handles corner cases around the infinity point causing some overhead compared to embedded_curve_add_not_nul and embedded_curve_add_unsafe\n// docs:start:embedded_curve_add\npub fn embedded_curve_add(\n    point1: EmbeddedCurvePoint,\n    point2: EmbeddedCurvePoint,\n) -> EmbeddedCurvePoint {\n    // docs:end:embedded_curve_add\n    if crate::runtime::is_unconstrained() {\n        // `embedded_curve_add_unsafe` requires the inputs not to be the infinity point, so we check it here.\n        // This is because `embedded_curve_add_unsafe` uses the `embedded_curve_add` opcode.\n        // For efficiency, the backend does not check the inputs for the infinity point, but it assumes that they are not the infinity point\n        // so that it can apply the ec addition formula directly.\n        if point1.is_infinite {\n            point2\n        } else if point2.is_infinite {\n            point1\n        } else {\n            embedded_curve_add_unsafe(point1, point2)\n        }\n    } else {\n        // In a constrained context, we also need to check the inputs are not the infinity point because we also use `embedded_curve_add_unsafe`\n        // However we also need to identify the case where the two inputs are the same, because then\n        // the addition formula does not work and we need to use the doubling formula instead.\n        // In unconstrained context, we can check directly if the input values are the same when solving the opcode, so it is not an issue.\n\n        // x_coordinates_match is true if both abscissae are the same\n        let x_coordinates_match = point1.x == point2.x;\n        // y_coordinates_match is true if both ordinates are the same\n        let y_coordinates_match = point1.y == point2.y;\n        // double_predicate is true if both abscissae and ordinates are the same\n        let double_predicate = (x_coordinates_match & y_coordinates_match);\n        // If the abscissae are the same, but not the ordinates, then one point is the opposite of the other\n        let infinity_predicate = (x_coordinates_match & !y_coordinates_match);\n\n        // `embedded_curve_add_unsafe` would not perform doubling, even if the inputs point1 and point2 are the same, because it cannot know this without adding some logic (and some constraints)\n        // However we did this logic when we computed `double_predicate`, so we set the result to 2*point1 if point1 and point2 are the same\n        let mut result = if double_predicate {\n            // `embedded_curve_add_unsafe` is doing a doubling if the input is the same variable, because in this case it is guaranteed (at 'compile time') that the input is the same.\n            embedded_curve_add_unsafe(point1, point1)\n        } else {\n            let point1_1 = EmbeddedCurvePoint {\n                x: point1.x + (x_coordinates_match as Field),\n                y: point1.y,\n                is_infinite: false,\n            };\n            let point2_1 = EmbeddedCurvePoint { x: point2.x, y: point2.y, is_infinite: false };\n            // point1_1 is guaranteed to have a different abscissa than point2:\n            // - if x_coordinates_match is 0, that means point1.x != point2.x, and point1_1.x = point1.x + 0\n            // - if x_coordinates_match is 1, that means point1.x = point2.x, but point1_1.x = point1.x + 1 in this case\n            // Because the abscissa is different, the addition formula is guaranteed to succeed, so we can safely use `embedded_curve_add_unsafe`\n            // Note that this computation may be garbage: if x_coordinates_match is 1, or if one of the input is the point at infinity.\n            // therefore we only want to do this if we need the result, otherwise it needs to be eliminated as a dead instruction, lest we want the circuit to fail.\n            embedded_curve_add_unsafe(point1_1, point2_1)\n        };\n\n        // Same logic as above for unconstrained context, we set the proper result when one of the inputs is the infinity point\n        if point1.is_infinite {\n            result = point2;\n        }\n        if point2.is_infinite {\n            result = point1;\n        }\n\n        // Finally, we set the is_infinity flag of the result:\n        // Opposite points should sum into the infinity point, however, if one of them is point at infinity, their coordinates are not meaningful\n        // so we should not use the fact that the inputs are opposite in this case:\n        let mut result_is_infinity =\n            infinity_predicate & (!point1.is_infinite & !point2.is_infinite);\n        // However, if both of them are at infinity, then the result is also at infinity\n        result.is_infinite = result_is_infinity | (point1.is_infinite & point2.is_infinite);\n        result\n    }\n}\n\n#[foreign(embedded_curve_add)]\nfn embedded_curve_add_array_return(\n    _point1: EmbeddedCurvePoint,\n    _point2: EmbeddedCurvePoint,\n    _predicate: bool,\n) -> [EmbeddedCurvePoint; 1] {}\n\n/// This function assumes that:\n/// The points are on the curve, and\n/// The points don't share an x-coordinate, and\n/// Neither point is the infinity point.\n/// If it is used with correct input, the function ensures the correct non-zero result is returned.\n/// Except for points on the curve, the other assumptions are checked by the function. It will cause assertion failure if they are not respected.\npub fn embedded_curve_add_not_nul(\n    point1: EmbeddedCurvePoint,\n    point2: EmbeddedCurvePoint,\n) -> EmbeddedCurvePoint {\n    assert(point1.x != point2.x);\n    assert(!point1.is_infinite);\n    assert(!point2.is_infinite);\n    // Ensure is_infinite is comptime\n    let point1_1 = EmbeddedCurvePoint { x: point1.x, y: point1.y, is_infinite: false };\n    let point2_1 = EmbeddedCurvePoint { x: point2.x, y: point2.y, is_infinite: false };\n    embedded_curve_add_unsafe(point1_1, point2_1)\n}\n\n/// Unsafe ec addition\n/// If the inputs are the same, it will perform a doubling, but only if point1 and point2 are the same variable.\n/// If they have the same value but are different variables, the result will be incorrect because in this case\n/// it assumes (but does not check) that the points' x-coordinates are not equal.\n/// It also assumes neither point is the infinity point.\npub fn embedded_curve_add_unsafe(\n    point1: EmbeddedCurvePoint,\n    point2: EmbeddedCurvePoint,\n) -> EmbeddedCurvePoint {\n    embedded_curve_add_array_return(point1, point2, true)[0]\n}\n"
     },
-    "168": {
+    "169": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/capsules.nr",
       "source": "use protocol_types::{address::AztecAddress, traits::{Deserialize, Serialize}};\n\n/// Stores arbitrary information in a per-contract non-volatile database, which can later be retrieved with `load`. If\n/// data was already stored at this slot, it is overwritten.\npub unconstrained fn store<T>(contract_address: AztecAddress, slot: Field, value: T)\nwhere\n    T: Serialize,\n{\n    let serialized = value.serialize();\n    store_oracle(contract_address, slot, serialized);\n}\n\n/// Returns data previously stored via `storeCapsule` in the per-contract non-volatile database. Returns Option::none() if\n/// nothing was stored at the given slot.\npub unconstrained fn load<T>(contract_address: AztecAddress, slot: Field) -> Option<T>\nwhere\n    T: Deserialize,\n{\n    let serialized_option = load_oracle(contract_address, slot, <T as Deserialize>::N);\n    serialized_option.map(|arr| Deserialize::deserialize(arr))\n}\n\n/// Deletes data in the per-contract non-volatile database. Does nothing if no data was present.\npub unconstrained fn delete(contract_address: AztecAddress, slot: Field) {\n    delete_oracle(contract_address, slot);\n}\n\n/// Copies a number of contiguous entries in the per-contract non-volatile database. This allows for efficient data\n/// structures by avoiding repeated calls to `loadCapsule` and `storeCapsule`.\n/// Supports overlapping source and destination regions (which will result in the overlapped source values being\n/// overwritten). All copied slots must exist in the database (i.e. have been stored and not deleted)\npub unconstrained fn copy(\n    contract_address: AztecAddress,\n    src_slot: Field,\n    dst_slot: Field,\n    num_entries: u32,\n) {\n    copy_oracle(contract_address, src_slot, dst_slot, num_entries);\n}\n\n#[oracle(utilityStoreCapsule)]\nunconstrained fn store_oracle<let N: u32>(\n    contract_address: AztecAddress,\n    slot: Field,\n    values: [Field; N],\n) {}\n\n/// We need to pass in `array_len` (the value of N) as a parameter to tell the oracle how many fields the response must\n/// have.\n///\n/// Note that the oracle returns an Option<[Field; N]> because we cannot return an Option<T> directly. That would\n/// require for the oracle resolver to know the shape of T (e.g. if T were a struct of 3 u32 values then the expected\n/// response shape would be 3 single items, whereas it were a struct containing `u32, [Field;10], u32` then the expected\n/// shape would be single, array, single.). Instead, we return the serialization and deserialize in Noir.\n#[oracle(utilityLoadCapsule)]\nunconstrained fn load_oracle<let N: u32>(\n    contract_address: AztecAddress,\n    slot: Field,\n    array_len: u32,\n) -> Option<[Field; N]> {}\n\n#[oracle(utilityDeleteCapsule)]\nunconstrained fn delete_oracle(contract_address: AztecAddress, slot: Field) {}\n\n#[oracle(utilityCopyCapsule)]\nunconstrained fn copy_oracle(\n    contract_address: AztecAddress,\n    src_slot: Field,\n    dst_slot: Field,\n    num_entries: u32,\n) {}\n\nmod test {\n    // These tests are sort of redundant since we already test the oracle implementation directly in TypeScript, but\n    // they are cheap regardless and help ensure both that the TXE implementation works accordingly and that the Noir\n    // oracles are hooked up correctly.\n\n    use crate::{\n        oracle::capsules::{copy, delete, load, store},\n        test::{helpers::test_environment::TestEnvironment, mocks::mock_struct::MockStruct},\n    };\n    use protocol_types::{address::AztecAddress, traits::{FromField, ToField}};\n\n    global SLOT: Field = 1;\n\n    #[test]\n    unconstrained fn stores_and_loads() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let value = MockStruct::new(5, 6);\n            store(contract_address, SLOT, value);\n\n            assert_eq(load(contract_address, SLOT).unwrap(), value);\n        });\n    }\n\n    #[test]\n    unconstrained fn store_overwrites() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let value = MockStruct::new(5, 6);\n            store(contract_address, SLOT, value);\n\n            let new_value = MockStruct::new(7, 8);\n            store(contract_address, SLOT, new_value);\n\n            assert_eq(load(contract_address, SLOT).unwrap(), new_value);\n        });\n    }\n\n    #[test]\n    unconstrained fn loads_empty_slot() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let loaded_value: Option<MockStruct> = load(contract_address, SLOT);\n            assert_eq(loaded_value, Option::none());\n        });\n    }\n\n    #[test]\n    unconstrained fn deletes_stored_value() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let value = MockStruct::new(5, 6);\n            store(contract_address, SLOT, value);\n            delete(contract_address, SLOT);\n\n            let loaded_value: Option<MockStruct> = load(contract_address, SLOT);\n            assert_eq(loaded_value, Option::none());\n        });\n    }\n\n    #[test]\n    unconstrained fn deletes_empty_slot() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            delete(contract_address, SLOT);\n            let loaded_value: Option<MockStruct> = load(contract_address, SLOT);\n            assert_eq(loaded_value, Option::none());\n        });\n    }\n\n    #[test]\n    unconstrained fn copies_non_overlapping_values() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let src = 5;\n\n            let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n            store(contract_address, src, values[0]);\n            store(contract_address, src + 1, values[1]);\n            store(contract_address, src + 2, values[2]);\n\n            let dst = 10;\n            copy(contract_address, src, dst, 3);\n\n            assert_eq(load(contract_address, dst).unwrap(), values[0]);\n            assert_eq(load(contract_address, dst + 1).unwrap(), values[1]);\n            assert_eq(load(contract_address, dst + 2).unwrap(), values[2]);\n        });\n    }\n\n    #[test]\n    unconstrained fn copies_overlapping_values_with_src_ahead() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let src = 1;\n\n            let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n            store(contract_address, src, values[0]);\n            store(contract_address, src + 1, values[1]);\n            store(contract_address, src + 2, values[2]);\n\n            let dst = 2;\n            copy(contract_address, src, dst, 3);\n\n            assert_eq(load(contract_address, dst).unwrap(), values[0]);\n            assert_eq(load(contract_address, dst + 1).unwrap(), values[1]);\n            assert_eq(load(contract_address, dst + 2).unwrap(), values[2]);\n\n            // src[1] and src[2] should have been overwritten since they are also dst[0] and dst[1]\n            assert_eq(load(contract_address, src).unwrap(), values[0]); // src[0] (unchanged)\n            assert_eq(load(contract_address, src + 1).unwrap(), values[0]); // dst[0]\n            assert_eq(load(contract_address, src + 2).unwrap(), values[1]); // dst[1]\n        });\n    }\n\n    #[test]\n    unconstrained fn copies_overlapping_values_with_dst_ahead() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let src = 2;\n\n            let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n            store(contract_address, src, values[0]);\n            store(contract_address, src + 1, values[1]);\n            store(contract_address, src + 2, values[2]);\n\n            let dst = 1;\n            copy(contract_address, src, dst, 3);\n\n            assert_eq(load(contract_address, dst).unwrap(), values[0]);\n            assert_eq(load(contract_address, dst + 1).unwrap(), values[1]);\n            assert_eq(load(contract_address, dst + 2).unwrap(), values[2]);\n\n            // src[0] and src[1] should have been overwritten since they are also dst[1] and dst[2]\n            assert_eq(load(contract_address, src).unwrap(), values[1]); // dst[1]\n            assert_eq(load(contract_address, src + 1).unwrap(), values[2]); // dst[2]\n            assert_eq(load(contract_address, src + 2).unwrap(), values[2]); // src[2] (unchanged)\n        });\n    }\n\n    #[test(should_fail_with = \"copy empty slot\")]\n    unconstrained fn cannot_copy_empty_values() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            copy(contract_address, SLOT, SLOT, 1);\n        });\n    }\n\n    #[test(should_fail_with = \"not allowed to access\")]\n    unconstrained fn cannot_store_other_contract() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n            let value = MockStruct::new(5, 6);\n            store(other_contract_address, SLOT, value);\n        });\n    }\n\n    #[test(should_fail_with = \"not allowed to access\")]\n    unconstrained fn cannot_load_other_contract() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n            let _: Option<MockStruct> = load(other_contract_address, SLOT);\n        });\n    }\n\n    #[test(should_fail_with = \"not allowed to access\")]\n    unconstrained fn cannot_delete_other_contract() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n            delete(other_contract_address, SLOT);\n        });\n    }\n\n    #[test(should_fail_with = \"not allowed to access\")]\n    unconstrained fn cannot_copy_other_contract() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n            copy(other_contract_address, SLOT, SLOT, 0);\n        });\n    }\n}\n"
     },
-    "169": {
-      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/enqueue_public_function_call.nr",
-      "source": "use dep::protocol_types::address::AztecAddress;\n\n#[oracle(privateNotifyEnqueuedPublicFunctionCall)]\nunconstrained fn notify_enqueued_public_function_call_oracle(\n    _contract_address: AztecAddress,\n    _calldata_hash: Field,\n    _side_effect_counter: u32,\n    _is_static_call: bool,\n) {}\n\nunconstrained fn notify_enqueued_public_function_call_wrapper(\n    contract_address: AztecAddress,\n    calldata_hash: Field,\n    side_effect_counter: u32,\n    is_static_call: bool,\n) {\n    notify_enqueued_public_function_call_oracle(\n        contract_address,\n        calldata_hash,\n        side_effect_counter,\n        is_static_call,\n    )\n}\n\npub fn notify_enqueued_public_function_call(\n    contract_address: AztecAddress,\n    calldata_hash: Field,\n    side_effect_counter: u32,\n    is_static_call: bool,\n) {\n    // Safety: Notifies the simulator that a public call has been enqueued, allowing it to prepare hints for the AVM to process this call.\n    unsafe {\n        notify_enqueued_public_function_call_wrapper(\n            contract_address,\n            calldata_hash,\n            side_effect_counter,\n            is_static_call,\n        )\n    }\n}\n\n#[oracle(privateNotifySetPublicTeardownFunctionCall)]\nunconstrained fn notify_set_public_teardown_function_call_oracle(\n    _contract_address: AztecAddress,\n    _calldata_hash: Field,\n    _side_effect_counter: u32,\n    _is_static_call: bool,\n) {}\n\nunconstrained fn notify_set_public_teardown_function_call_wrapper(\n    contract_address: AztecAddress,\n    calldata_hash: Field,\n    side_effect_counter: u32,\n    is_static_call: bool,\n) {\n    notify_set_public_teardown_function_call_oracle(\n        contract_address,\n        calldata_hash,\n        side_effect_counter,\n        is_static_call,\n    )\n}\n\npub fn notify_set_public_teardown_function_call(\n    contract_address: AztecAddress,\n    calldata_hash: Field,\n    side_effect_counter: u32,\n    is_static_call: bool,\n) {\n    // Safety: Notifies the simulator that a teardown call has been set, allowing it to prepare hints for the AVM to process this call.\n    unsafe {\n        notify_set_public_teardown_function_call_wrapper(\n            contract_address,\n            calldata_hash,\n            side_effect_counter,\n            is_static_call,\n        )\n    }\n}\n\npub fn notify_set_min_revertible_side_effect_counter(counter: u32) {\n    // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n    // to call.\n    unsafe { notify_set_min_revertible_side_effect_counter_oracle_wrapper(counter) };\n}\n\npub unconstrained fn notify_set_min_revertible_side_effect_counter_oracle_wrapper(counter: u32) {\n    notify_set_min_revertible_side_effect_counter_oracle(counter);\n}\n\n#[oracle(privateNotifySetMinRevertibleSideEffectCounter)]\nunconstrained fn notify_set_min_revertible_side_effect_counter_oracle(_counter: u32) {}\n\npub unconstrained fn is_side_effect_counter_revertible_oracle_wrapper(counter: u32) -> bool {\n    is_side_effect_counter_revertible_oracle(counter)\n}\n\n#[oracle(privateIsSideEffectCounterRevertible)]\nunconstrained fn is_side_effect_counter_revertible_oracle(counter: u32) -> bool {}\n"
-    },
     "17": {
       "path": "std/field/bn254.nr",
       "source": "use crate::field::field_less_than;\nuse crate::runtime::is_unconstrained;\n\n// The low and high decomposition of the field modulus\npub(crate) global PLO: Field = 53438638232309528389504892708671455233;\npub(crate) global PHI: Field = 64323764613183177041862057485226039389;\n\npub(crate) global TWO_POW_128: Field = 0x100000000000000000000000000000000;\n\n// Decomposes a single field into two 16 byte fields.\nfn compute_decomposition(x: Field) -> (Field, Field) {\n    // Here's we're taking advantage of truncating 128 bit limbs from the input field\n    // and then subtracting them from the input such the field division is equivalent to integer division.\n    let low = (x as u128) as Field;\n    let high = (x - low) / TWO_POW_128;\n\n    (low, high)\n}\n\npub(crate) unconstrained fn decompose_hint(x: Field) -> (Field, Field) {\n    compute_decomposition(x)\n}\n\nunconstrained fn lte_hint(x: Field, y: Field) -> bool {\n    if x == y {\n        true\n    } else {\n        field_less_than(x, y)\n    }\n}\n\n// Assert that (alo > blo && ahi >= bhi) || (alo <= blo && ahi > bhi)\nfn assert_gt_limbs(a: (Field, Field), b: (Field, Field)) {\n    let (alo, ahi) = a;\n    let (blo, bhi) = b;\n    // Safety: borrow is enforced to be boolean due to its type.\n    // if borrow is 0, it asserts that (alo > blo && ahi >= bhi)\n    // if borrow is 1, it asserts that (alo <= blo && ahi > bhi)\n    unsafe {\n        let borrow = lte_hint(alo, blo);\n\n        let rlo = alo - blo - 1 + (borrow as Field) * TWO_POW_128;\n        let rhi = ahi - bhi - (borrow as Field);\n\n        rlo.assert_max_bit_size::<128>();\n        rhi.assert_max_bit_size::<128>();\n    }\n}\n\n/// Decompose a single field into two 16 byte fields.\npub fn decompose(x: Field) -> (Field, Field) {\n    if is_unconstrained() {\n        compute_decomposition(x)\n    } else {\n        // Safety: decomposition is properly checked below\n        unsafe {\n            // Take hints of the decomposition\n            let (xlo, xhi) = decompose_hint(x);\n\n            // Range check the limbs\n            xlo.assert_max_bit_size::<128>();\n            xhi.assert_max_bit_size::<128>();\n\n            // Check that the decomposition is correct\n            assert_eq(x, xlo + TWO_POW_128 * xhi);\n\n            // Assert that the decomposition of P is greater than the decomposition of x\n            assert_gt_limbs((PLO, PHI), (xlo, xhi));\n            (xlo, xhi)\n        }\n    }\n}\n\npub fn assert_gt(a: Field, b: Field) {\n    if is_unconstrained() {\n        assert(\n            // Safety: already unconstrained\n            unsafe { field_less_than(b, a) },\n        );\n    } else {\n        // Decompose a and b\n        let a_limbs = decompose(a);\n        let b_limbs = decompose(b);\n\n        // Assert that a_limbs is greater than b_limbs\n        assert_gt_limbs(a_limbs, b_limbs)\n    }\n}\n\npub fn assert_lt(a: Field, b: Field) {\n    assert_gt(b, a);\n}\n\npub fn gt(a: Field, b: Field) -> bool {\n    if is_unconstrained() {\n        // Safety: unsafe in unconstrained\n        unsafe {\n            field_less_than(b, a)\n        }\n    } else if a == b {\n        false\n    } else {\n        // Safety: Take a hint of the comparison and verify it\n        unsafe {\n            if field_less_than(a, b) {\n                assert_gt(b, a);\n                false\n            } else {\n                assert_gt(a, b);\n                true\n            }\n        }\n    }\n}\n\npub fn lt(a: Field, b: Field) -> bool {\n    gt(b, a)\n}\n\nmod tests {\n    // TODO: Allow imports from \"super\"\n    use crate::field::bn254::{assert_gt, decompose, gt, lt, lte_hint, PHI, PLO, TWO_POW_128};\n\n    #[test]\n    fn check_decompose() {\n        assert_eq(decompose(TWO_POW_128), (0, 1));\n        assert_eq(decompose(TWO_POW_128 + 0x1234567890), (0x1234567890, 1));\n        assert_eq(decompose(0x1234567890), (0x1234567890, 0));\n    }\n\n    #[test]\n    unconstrained fn check_lte_hint() {\n        assert(lte_hint(0, 1));\n        assert(lte_hint(0, 0x100));\n        assert(lte_hint(0x100, TWO_POW_128 - 1));\n        assert(!lte_hint(0 - 1, 0));\n\n        assert(lte_hint(0, 0));\n        assert(lte_hint(0x100, 0x100));\n        assert(lte_hint(0 - 1, 0 - 1));\n    }\n\n    #[test]\n    fn check_gt() {\n        assert(gt(1, 0));\n        assert(gt(0x100, 0));\n        assert(gt((0 - 1), (0 - 2)));\n        assert(gt(TWO_POW_128, 0));\n        assert(!gt(0, 0));\n        assert(!gt(0, 0x100));\n        assert(gt(0 - 1, 0 - 2));\n        assert(!gt(0 - 2, 0 - 1));\n        assert_gt(0 - 1, 0);\n    }\n\n    #[test]\n    fn check_plo_phi() {\n        assert_eq(PLO + PHI * TWO_POW_128, 0);\n        let p_bytes = crate::field::modulus_le_bytes();\n        let mut p_low: Field = 0;\n        let mut p_high: Field = 0;\n\n        let mut offset = 1;\n        for i in 0..16 {\n            p_low += (p_bytes[i] as Field) * offset;\n            p_high += (p_bytes[i + 16] as Field) * offset;\n            offset *= 256;\n        }\n        assert_eq(p_low, PLO);\n        assert_eq(p_high, PHI);\n    }\n\n    #[test]\n    fn check_decompose_edge_cases() {\n        assert_eq(decompose(0), (0, 0));\n        assert_eq(decompose(TWO_POW_128 - 1), (TWO_POW_128 - 1, 0));\n        assert_eq(decompose(TWO_POW_128 + 1), (1, 1));\n        assert_eq(decompose(TWO_POW_128 * 2), (0, 2));\n        assert_eq(decompose(TWO_POW_128 * 2 + 0x1234567890), (0x1234567890, 2));\n    }\n\n    #[test]\n    fn check_decompose_large_values() {\n        let large_field = 0xffffffffffffffff;\n        let (lo, hi) = decompose(large_field);\n        assert_eq(large_field, lo + TWO_POW_128 * hi);\n\n        let large_value = large_field - TWO_POW_128;\n        let (lo2, hi2) = decompose(large_value);\n        assert_eq(large_value, lo2 + TWO_POW_128 * hi2);\n    }\n\n    #[test]\n    fn check_lt_comprehensive() {\n        assert(lt(0, 1));\n        assert(!lt(1, 0));\n        assert(!lt(0, 0));\n        assert(!lt(42, 42));\n\n        assert(lt(TWO_POW_128 - 1, TWO_POW_128));\n        assert(!lt(TWO_POW_128, TWO_POW_128 - 1));\n    }\n}\n"
     },
     "170": {
+      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/enqueue_public_function_call.nr",
+      "source": "use dep::protocol_types::address::AztecAddress;\n\n#[oracle(privateNotifyEnqueuedPublicFunctionCall)]\nunconstrained fn notify_enqueued_public_function_call_oracle(\n    _contract_address: AztecAddress,\n    _calldata_hash: Field,\n    _side_effect_counter: u32,\n    _is_static_call: bool,\n) {}\n\nunconstrained fn notify_enqueued_public_function_call_wrapper(\n    contract_address: AztecAddress,\n    calldata_hash: Field,\n    side_effect_counter: u32,\n    is_static_call: bool,\n) {\n    notify_enqueued_public_function_call_oracle(\n        contract_address,\n        calldata_hash,\n        side_effect_counter,\n        is_static_call,\n    )\n}\n\npub fn notify_enqueued_public_function_call(\n    contract_address: AztecAddress,\n    calldata_hash: Field,\n    side_effect_counter: u32,\n    is_static_call: bool,\n) {\n    // Safety: Notifies the simulator that a public call has been enqueued, allowing it to prepare hints for the AVM to process this call.\n    unsafe {\n        notify_enqueued_public_function_call_wrapper(\n            contract_address,\n            calldata_hash,\n            side_effect_counter,\n            is_static_call,\n        )\n    }\n}\n\n#[oracle(privateNotifySetPublicTeardownFunctionCall)]\nunconstrained fn notify_set_public_teardown_function_call_oracle(\n    _contract_address: AztecAddress,\n    _calldata_hash: Field,\n    _side_effect_counter: u32,\n    _is_static_call: bool,\n) {}\n\nunconstrained fn notify_set_public_teardown_function_call_wrapper(\n    contract_address: AztecAddress,\n    calldata_hash: Field,\n    side_effect_counter: u32,\n    is_static_call: bool,\n) {\n    notify_set_public_teardown_function_call_oracle(\n        contract_address,\n        calldata_hash,\n        side_effect_counter,\n        is_static_call,\n    )\n}\n\npub fn notify_set_public_teardown_function_call(\n    contract_address: AztecAddress,\n    calldata_hash: Field,\n    side_effect_counter: u32,\n    is_static_call: bool,\n) {\n    // Safety: Notifies the simulator that a teardown call has been set, allowing it to prepare hints for the AVM to process this call.\n    unsafe {\n        notify_set_public_teardown_function_call_wrapper(\n            contract_address,\n            calldata_hash,\n            side_effect_counter,\n            is_static_call,\n        )\n    }\n}\n\npub fn notify_set_min_revertible_side_effect_counter(counter: u32) {\n    // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n    // to call.\n    unsafe { notify_set_min_revertible_side_effect_counter_oracle_wrapper(counter) };\n}\n\npub unconstrained fn notify_set_min_revertible_side_effect_counter_oracle_wrapper(counter: u32) {\n    notify_set_min_revertible_side_effect_counter_oracle(counter);\n}\n\n#[oracle(privateNotifySetMinRevertibleSideEffectCounter)]\nunconstrained fn notify_set_min_revertible_side_effect_counter_oracle(_counter: u32) {}\n\npub unconstrained fn is_side_effect_counter_revertible_oracle_wrapper(counter: u32) -> bool {\n    is_side_effect_counter_revertible_oracle(counter)\n}\n\n#[oracle(privateIsSideEffectCounterRevertible)]\nunconstrained fn is_side_effect_counter_revertible_oracle(counter: u32) -> bool {}\n"
+    },
+    "171": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/execution.nr",
       "source": "use crate::context::utility_context::UtilityContext;\n\n#[oracle(utilityGetUtilityContext)]\nunconstrained fn get_utility_context_oracle() -> UtilityContext {}\n\n/// Returns a utility context built from the global variables of anchor block and the contract address of the function\n/// being executed.\npub unconstrained fn get_utility_context() -> UtilityContext {\n    get_utility_context_oracle()\n}\n"
     },
@@ -3425,19 +3429,19 @@
       "path": "std/field/mod.nr",
       "source": "pub mod bn254;\nuse crate::{runtime::is_unconstrained, static_assert};\nuse bn254::lt as bn254_lt;\n\nimpl Field {\n    /// Asserts that `self` can be represented in `bit_size` bits.\n    ///\n    /// # Failures\n    /// Causes a constraint failure for `Field` values exceeding `2^{bit_size}`.\n    // docs:start:assert_max_bit_size\n    pub fn assert_max_bit_size<let BIT_SIZE: u32>(self) {\n        // docs:end:assert_max_bit_size\n        static_assert(\n            BIT_SIZE < modulus_num_bits() as u32,\n            \"BIT_SIZE must be less than modulus_num_bits\",\n        );\n        __assert_max_bit_size(self, BIT_SIZE);\n    }\n\n    /// Decomposes `self` into its little endian bit decomposition as a `[u1; N]` array.\n    /// This slice will be zero padded should not all bits be necessary to represent `self`.\n    ///\n    /// # Failures\n    /// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting slice will not\n    /// be able to represent the original `Field`.\n    ///\n    /// # Safety\n    /// The bit decomposition returned is canonical and is guaranteed to not overflow the modulus.\n    // docs:start:to_le_bits\n    pub fn to_le_bits<let N: u32>(self: Self) -> [u1; N] {\n        // docs:end:to_le_bits\n        let bits = __to_le_bits(self);\n\n        if !is_unconstrained() {\n            // Ensure that the byte decomposition does not overflow the modulus\n            let p = modulus_le_bits();\n            assert(bits.len() <= p.len());\n            let mut ok = bits.len() != p.len();\n            for i in 0..N {\n                if !ok {\n                    if (bits[N - 1 - i] != p[N - 1 - i]) {\n                        assert(p[N - 1 - i] == 1);\n                        ok = true;\n                    }\n                }\n            }\n            assert(ok);\n        }\n        bits\n    }\n\n    /// Decomposes `self` into its big endian bit decomposition as a `[u1; N]` array.\n    /// This array will be zero padded should not all bits be necessary to represent `self`.\n    ///\n    /// # Failures\n    /// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting slice will not\n    /// be able to represent the original `Field`.\n    ///\n    /// # Safety\n    /// The bit decomposition returned is canonical and is guaranteed to not overflow the modulus.\n    // docs:start:to_be_bits\n    pub fn to_be_bits<let N: u32>(self: Self) -> [u1; N] {\n        // docs:end:to_be_bits\n        let bits = __to_be_bits(self);\n\n        if !is_unconstrained() {\n            // Ensure that the decomposition does not overflow the modulus\n            let p = modulus_be_bits();\n            assert(bits.len() <= p.len());\n            let mut ok = bits.len() != p.len();\n            for i in 0..N {\n                if !ok {\n                    if (bits[i] != p[i]) {\n                        assert(p[i] == 1);\n                        ok = true;\n                    }\n                }\n            }\n            assert(ok);\n        }\n        bits\n    }\n\n    /// Decomposes `self` into its little endian byte decomposition as a `[u8;N]` array\n    /// This array will be zero padded should not all bytes be necessary to represent `self`.\n    ///\n    /// # Failures\n    ///  The length N of the array must be big enough to contain all the bytes of the 'self',\n    ///  and no more than the number of bytes required to represent the field modulus\n    ///\n    /// # Safety\n    /// The result is ensured to be the canonical decomposition of the field element\n    // docs:start:to_le_bytes\n    pub fn to_le_bytes<let N: u32>(self: Self) -> [u8; N] {\n        // docs:end:to_le_bytes\n        static_assert(\n            N <= modulus_le_bytes().len(),\n            \"N must be less than or equal to modulus_le_bytes().len()\",\n        );\n        // Compute the byte decomposition\n        let bytes = self.to_le_radix(256);\n\n        if !is_unconstrained() {\n            // Ensure that the byte decomposition does not overflow the modulus\n            let p = modulus_le_bytes();\n            assert(bytes.len() <= p.len());\n            let mut ok = bytes.len() != p.len();\n            for i in 0..N {\n                if !ok {\n                    if (bytes[N - 1 - i] != p[N - 1 - i]) {\n                        assert(bytes[N - 1 - i] < p[N - 1 - i]);\n                        ok = true;\n                    }\n                }\n            }\n            assert(ok);\n        }\n        bytes\n    }\n\n    /// Decomposes `self` into its big endian byte decomposition as a `[u8;N]` array of length required to represent the field modulus\n    /// This array will be zero padded should not all bytes be necessary to represent `self`.\n    ///\n    /// # Failures\n    ///  The length N of the array must be big enough to contain all the bytes of the 'self',\n    ///  and no more than the number of bytes required to represent the field modulus\n    ///\n    /// # Safety\n    /// The result is ensured to be the canonical decomposition of the field element\n    // docs:start:to_be_bytes\n    pub fn to_be_bytes<let N: u32>(self: Self) -> [u8; N] {\n        // docs:end:to_be_bytes\n        static_assert(\n            N <= modulus_le_bytes().len(),\n            \"N must be less than or equal to modulus_le_bytes().len()\",\n        );\n        // Compute the byte decomposition\n        let bytes = self.to_be_radix(256);\n\n        if !is_unconstrained() {\n            // Ensure that the byte decomposition does not overflow the modulus\n            let p = modulus_be_bytes();\n            assert(bytes.len() <= p.len());\n            let mut ok = bytes.len() != p.len();\n            for i in 0..N {\n                if !ok {\n                    if (bytes[i] != p[i]) {\n                        assert(bytes[i] < p[i]);\n                        ok = true;\n                    }\n                }\n            }\n            assert(ok);\n        }\n        bytes\n    }\n\n    fn to_le_radix<let N: u32>(self: Self, radix: u32) -> [u8; N] {\n        // Brillig does not need an immediate radix\n        if !crate::runtime::is_unconstrained() {\n            static_assert(1 < radix, \"radix must be greater than 1\");\n            static_assert(radix <= 256, \"radix must be less than or equal to 256\");\n            static_assert(radix & (radix - 1) == 0, \"radix must be a power of 2\");\n        }\n        __to_le_radix(self, radix)\n    }\n\n    fn to_be_radix<let N: u32>(self: Self, radix: u32) -> [u8; N] {\n        // Brillig does not need an immediate radix\n        if !crate::runtime::is_unconstrained() {\n            static_assert(1 < radix, \"radix must be greater than 1\");\n            static_assert(radix <= 256, \"radix must be less than or equal to 256\");\n            static_assert(radix & (radix - 1) == 0, \"radix must be a power of 2\");\n        }\n        __to_be_radix(self, radix)\n    }\n\n    // Returns self to the power of the given exponent value.\n    // Caution: we assume the exponent fits into 32 bits\n    // using a bigger bit size impacts negatively the performance and should be done only if the exponent does not fit in 32 bits\n    pub fn pow_32(self, exponent: Field) -> Field {\n        let mut r: Field = 1;\n        let b: [u1; 32] = exponent.to_le_bits();\n\n        for i in 1..33 {\n            r *= r;\n            r = (b[32 - i] as Field) * (r * self) + (1 - b[32 - i] as Field) * r;\n        }\n        r\n    }\n\n    // Parity of (prime) Field element, i.e. sgn0(x mod p) = 0 if x `elem` {0, ..., p-1} is even, otherwise sgn0(x mod p) = 1.\n    pub fn sgn0(self) -> u1 {\n        self as u1\n    }\n\n    pub fn lt(self, another: Field) -> bool {\n        if crate::compat::is_bn254() {\n            bn254_lt(self, another)\n        } else {\n            lt_fallback(self, another)\n        }\n    }\n\n    /// Convert a little endian byte array to a field element.\n    /// If the provided byte array overflows the field modulus then the Field will silently wrap around.\n    pub fn from_le_bytes<let N: u32>(bytes: [u8; N]) -> Field {\n        static_assert(\n            N <= modulus_le_bytes().len(),\n            \"N must be less than or equal to modulus_le_bytes().len()\",\n        );\n        let mut v = 1;\n        let mut result = 0;\n\n        for i in 0..N {\n            result += (bytes[i] as Field) * v;\n            v = v * 256;\n        }\n        result\n    }\n\n    /// Convert a big endian byte array to a field element.\n    /// If the provided byte array overflows the field modulus then the Field will silently wrap around.\n    pub fn from_be_bytes<let N: u32>(bytes: [u8; N]) -> Field {\n        let mut v = 1;\n        let mut result = 0;\n\n        for i in 0..N {\n            result += (bytes[N - 1 - i] as Field) * v;\n            v = v * 256;\n        }\n        result\n    }\n}\n\n#[builtin(apply_range_constraint)]\nfn __assert_max_bit_size(value: Field, bit_size: u32) {}\n\n// `_radix` must be less than 256\n#[builtin(to_le_radix)]\nfn __to_le_radix<let N: u32>(value: Field, radix: u32) -> [u8; N] {}\n\n// `_radix` must be less than 256\n#[builtin(to_be_radix)]\nfn __to_be_radix<let N: u32>(value: Field, radix: u32) -> [u8; N] {}\n\n/// Decomposes `self` into its little endian bit decomposition as a `[u1; N]` array.\n/// This slice will be zero padded should not all bits be necessary to represent `self`.\n///\n/// # Failures\n/// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting slice will not\n/// be able to represent the original `Field`.\n///\n/// # Safety\n/// Values of `N` equal to or greater than the number of bits necessary to represent the `Field` modulus\n/// (e.g. 254 for the BN254 field) allow for multiple bit decompositions. This is due to how the `Field` will\n/// wrap around due to overflow when verifying the decomposition.\n#[builtin(to_le_bits)]\nfn __to_le_bits<let N: u32>(value: Field) -> [u1; N] {}\n\n/// Decomposes `self` into its big endian bit decomposition as a `[u1; N]` array.\n/// This array will be zero padded should not all bits be necessary to represent `self`.\n///\n/// # Failures\n/// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting slice will not\n/// be able to represent the original `Field`.\n///\n/// # Safety\n/// Values of `N` equal to or greater than the number of bits necessary to represent the `Field` modulus\n/// (e.g. 254 for the BN254 field) allow for multiple bit decompositions. This is due to how the `Field` will\n/// wrap around due to overflow when verifying the decomposition.\n#[builtin(to_be_bits)]\nfn __to_be_bits<let N: u32>(value: Field) -> [u1; N] {}\n\n#[builtin(modulus_num_bits)]\npub comptime fn modulus_num_bits() -> u64 {}\n\n#[builtin(modulus_be_bits)]\npub comptime fn modulus_be_bits() -> [u1] {}\n\n#[builtin(modulus_le_bits)]\npub comptime fn modulus_le_bits() -> [u1] {}\n\n#[builtin(modulus_be_bytes)]\npub comptime fn modulus_be_bytes() -> [u8] {}\n\n#[builtin(modulus_le_bytes)]\npub comptime fn modulus_le_bytes() -> [u8] {}\n\n/// An unconstrained only built in to efficiently compare fields.\n#[builtin(field_less_than)]\nunconstrained fn __field_less_than(x: Field, y: Field) -> bool {}\n\npub(crate) unconstrained fn field_less_than(x: Field, y: Field) -> bool {\n    __field_less_than(x, y)\n}\n\n// Convert a 32 byte array to a field element by modding\npub fn bytes32_to_field(bytes32: [u8; 32]) -> Field {\n    // Convert it to a field element\n    let mut v = 1;\n    let mut high = 0 as Field;\n    let mut low = 0 as Field;\n\n    for i in 0..16 {\n        high = high + (bytes32[15 - i] as Field) * v;\n        low = low + (bytes32[16 + 15 - i] as Field) * v;\n        v = v * 256;\n    }\n    // Abuse that a % p + b % p = (a + b) % p and that low < p\n    low + high * v\n}\n\nfn lt_fallback(x: Field, y: Field) -> bool {\n    if is_unconstrained() {\n        // Safety: unconstrained context\n        unsafe {\n            field_less_than(x, y)\n        }\n    } else {\n        let x_bytes: [u8; 32] = x.to_le_bytes();\n        let y_bytes: [u8; 32] = y.to_le_bytes();\n        let mut x_is_lt = false;\n        let mut done = false;\n        for i in 0..32 {\n            if (!done) {\n                let x_byte = x_bytes[32 - 1 - i] as u8;\n                let y_byte = y_bytes[32 - 1 - i] as u8;\n                let bytes_match = x_byte == y_byte;\n                if !bytes_match {\n                    x_is_lt = x_byte < y_byte;\n                    done = true;\n                }\n            }\n        }\n        x_is_lt\n    }\n}\n\nmod tests {\n    use crate::{panic::panic, runtime, static_assert};\n    use super::{\n        field_less_than, modulus_be_bits, modulus_be_bytes, modulus_le_bits, modulus_le_bytes,\n    };\n\n    #[test]\n    // docs:start:to_be_bits_example\n    fn test_to_be_bits() {\n        let field = 2;\n        let bits: [u1; 8] = field.to_be_bits();\n        assert_eq(bits, [0, 0, 0, 0, 0, 0, 1, 0]);\n    }\n    // docs:end:to_be_bits_example\n\n    #[test]\n    // docs:start:to_le_bits_example\n    fn test_to_le_bits() {\n        let field = 2;\n        let bits: [u1; 8] = field.to_le_bits();\n        assert_eq(bits, [0, 1, 0, 0, 0, 0, 0, 0]);\n    }\n    // docs:end:to_le_bits_example\n\n    #[test]\n    // docs:start:to_be_bytes_example\n    fn test_to_be_bytes() {\n        let field = 2;\n        let bytes: [u8; 8] = field.to_be_bytes();\n        assert_eq(bytes, [0, 0, 0, 0, 0, 0, 0, 2]);\n        assert_eq(Field::from_be_bytes::<8>(bytes), field);\n    }\n    // docs:end:to_be_bytes_example\n\n    #[test]\n    // docs:start:to_le_bytes_example\n    fn test_to_le_bytes() {\n        let field = 2;\n        let bytes: [u8; 8] = field.to_le_bytes();\n        assert_eq(bytes, [2, 0, 0, 0, 0, 0, 0, 0]);\n        assert_eq(Field::from_le_bytes::<8>(bytes), field);\n    }\n    // docs:end:to_le_bytes_example\n\n    #[test]\n    // docs:start:to_be_radix_example\n    fn test_to_be_radix() {\n        // 259, in base 256, big endian, is [1, 3].\n        // i.e. 3 * 256^0 + 1 * 256^1\n        let field = 259;\n\n        // The radix (in this example, 256) must be a power of 2.\n        // The length of the returned byte array can be specified to be\n        // >= the amount of space needed.\n        let bytes: [u8; 8] = field.to_be_radix(256);\n        assert_eq(bytes, [0, 0, 0, 0, 0, 0, 1, 3]);\n        assert_eq(Field::from_be_bytes::<8>(bytes), field);\n    }\n    // docs:end:to_be_radix_example\n\n    #[test]\n    // docs:start:to_le_radix_example\n    fn test_to_le_radix() {\n        // 259, in base 256, little endian, is [3, 1].\n        // i.e. 3 * 256^0 + 1 * 256^1\n        let field = 259;\n\n        // The radix (in this example, 256) must be a power of 2.\n        // The length of the returned byte array can be specified to be\n        // >= the amount of space needed.\n        let bytes: [u8; 8] = field.to_le_radix(256);\n        assert_eq(bytes, [3, 1, 0, 0, 0, 0, 0, 0]);\n        assert_eq(Field::from_le_bytes::<8>(bytes), field);\n    }\n    // docs:end:to_le_radix_example\n\n    #[test(should_fail_with = \"radix must be greater than 1\")]\n    fn test_to_le_radix_1() {\n        // this test should only fail in constrained mode\n        if !runtime::is_unconstrained() {\n            let field = 2;\n            let _: [u8; 8] = field.to_le_radix(1);\n        } else {\n            panic(f\"radix must be greater than 1\");\n        }\n    }\n\n    // Updated test to account for Brillig restriction that radix must be greater than 2\n    #[test(should_fail_with = \"radix must be greater than 1\")]\n    fn test_to_le_radix_brillig_1() {\n        // this test should only fail in constrained mode\n        if !runtime::is_unconstrained() {\n            let field = 1;\n            let _: [u8; 8] = field.to_le_radix(1);\n        } else {\n            panic(f\"radix must be greater than 1\");\n        }\n    }\n\n    #[test(should_fail_with = \"radix must be a power of 2\")]\n    fn test_to_le_radix_3() {\n        // this test should only fail in constrained mode\n        if !runtime::is_unconstrained() {\n            let field = 2;\n            let _: [u8; 8] = field.to_le_radix(3);\n        } else {\n            panic(f\"radix must be a power of 2\");\n        }\n    }\n\n    #[test]\n    fn test_to_le_radix_brillig_3() {\n        // this test should only fail in constrained mode\n        if runtime::is_unconstrained() {\n            let field = 1;\n            let out: [u8; 8] = field.to_le_radix(3);\n            let mut expected = [0; 8];\n            expected[0] = 1;\n            assert(out == expected, \"unexpected result\");\n        }\n    }\n\n    #[test(should_fail_with = \"radix must be less than or equal to 256\")]\n    fn test_to_le_radix_512() {\n        // this test should only fail in constrained mode\n        if !runtime::is_unconstrained() {\n            let field = 2;\n            let _: [u8; 8] = field.to_le_radix(512);\n        } else {\n            panic(f\"radix must be less than or equal to 256\")\n        }\n    }\n\n    #[test(should_fail_with = \"Field failed to decompose into specified 16 limbs\")]\n    unconstrained fn not_enough_limbs_brillig() {\n        let _: [u8; 16] = 0x100000000000000000000000000000000.to_le_bytes();\n    }\n\n    #[test(should_fail_with = \"Field failed to decompose into specified 16 limbs\")]\n    fn not_enough_limbs() {\n        let _: [u8; 16] = 0x100000000000000000000000000000000.to_le_bytes();\n    }\n\n    #[test]\n    unconstrained fn test_field_less_than() {\n        assert(field_less_than(0, 1));\n        assert(field_less_than(0, 0x100));\n        assert(field_less_than(0x100, 0 - 1));\n        assert(!field_less_than(0 - 1, 0));\n    }\n\n    #[test]\n    unconstrained fn test_large_field_values_unconstrained() {\n        let large_field = 0xffffffffffffffff;\n\n        let bits: [u1; 64] = large_field.to_le_bits();\n        assert_eq(bits[0], 1);\n\n        let bytes: [u8; 8] = large_field.to_le_bytes();\n        assert_eq(Field::from_le_bytes::<8>(bytes), large_field);\n\n        let radix_bytes: [u8; 8] = large_field.to_le_radix(256);\n        assert_eq(Field::from_le_bytes::<8>(radix_bytes), large_field);\n    }\n\n    #[test]\n    fn test_large_field_values() {\n        let large_val = 0xffffffffffffffff;\n\n        let bits: [u1; 64] = large_val.to_le_bits();\n        assert_eq(bits[0], 1);\n\n        let bytes: [u8; 8] = large_val.to_le_bytes();\n        assert_eq(Field::from_le_bytes::<8>(bytes), large_val);\n\n        let radix_bytes: [u8; 8] = large_val.to_le_radix(256);\n        assert_eq(Field::from_le_bytes::<8>(radix_bytes), large_val);\n    }\n\n    #[test]\n    fn test_decomposition_edge_cases() {\n        let zero_bits: [u1; 8] = 0.to_le_bits();\n        assert_eq(zero_bits, [0; 8]);\n\n        let zero_bytes: [u8; 8] = 0.to_le_bytes();\n        assert_eq(zero_bytes, [0; 8]);\n\n        let one_bits: [u1; 8] = 1.to_le_bits();\n        let expected: [u1; 8] = [1, 0, 0, 0, 0, 0, 0, 0];\n        assert_eq(one_bits, expected);\n\n        let pow2_bits: [u1; 8] = 4.to_le_bits();\n        let expected: [u1; 8] = [0, 0, 1, 0, 0, 0, 0, 0];\n        assert_eq(pow2_bits, expected);\n    }\n\n    #[test]\n    fn test_pow_32() {\n        assert_eq(2.pow_32(3), 8);\n        assert_eq(3.pow_32(2), 9);\n        assert_eq(5.pow_32(0), 1);\n        assert_eq(7.pow_32(1), 7);\n\n        assert_eq(2.pow_32(10), 1024);\n\n        assert_eq(0.pow_32(5), 0);\n        assert_eq(0.pow_32(0), 1);\n\n        assert_eq(1.pow_32(100), 1);\n    }\n\n    #[test]\n    fn test_sgn0() {\n        assert_eq(0.sgn0(), 0);\n        assert_eq(2.sgn0(), 0);\n        assert_eq(4.sgn0(), 0);\n        assert_eq(100.sgn0(), 0);\n\n        assert_eq(1.sgn0(), 1);\n        assert_eq(3.sgn0(), 1);\n        assert_eq(5.sgn0(), 1);\n        assert_eq(101.sgn0(), 1);\n    }\n\n    #[test(should_fail_with = \"Field failed to decompose into specified 8 limbs\")]\n    fn test_bit_decomposition_overflow() {\n        // 8 bits can't represent large field values\n        let large_val = 0x1000000000000000;\n        let _: [u1; 8] = large_val.to_le_bits();\n    }\n\n    #[test(should_fail_with = \"Field failed to decompose into specified 4 limbs\")]\n    fn test_byte_decomposition_overflow() {\n        // 4 bytes can't represent large field values\n        let large_val = 0x1000000000000000;\n        let _: [u8; 4] = large_val.to_le_bytes();\n    }\n\n    #[test]\n    fn test_to_from_be_bytes_bn254_edge_cases() {\n        if crate::compat::is_bn254() {\n            // checking that decrementing this byte produces the expected 32 BE bytes for (modulus - 1)\n            let mut p_minus_1_bytes: [u8; 32] = modulus_be_bytes().as_array();\n            assert(p_minus_1_bytes[32 - 1] > 0);\n            p_minus_1_bytes[32 - 1] -= 1;\n\n            let p_minus_1 = Field::from_be_bytes::<32>(p_minus_1_bytes);\n            assert_eq(p_minus_1 + 1, 0);\n\n            // checking that converting (modulus - 1) from and then to 32 BE bytes produces the same bytes\n            let p_minus_1_converted_bytes: [u8; 32] = p_minus_1.to_be_bytes();\n            assert_eq(p_minus_1_converted_bytes, p_minus_1_bytes);\n\n            // checking that incrementing this byte produces 32 BE bytes for (modulus + 1)\n            let mut p_plus_1_bytes: [u8; 32] = modulus_be_bytes().as_array();\n            assert(p_plus_1_bytes[32 - 1] < 255);\n            p_plus_1_bytes[32 - 1] += 1;\n\n            let p_plus_1 = Field::from_be_bytes::<32>(p_plus_1_bytes);\n            assert_eq(p_plus_1, 1);\n\n            // checking that converting p_plus_1 to 32 BE bytes produces the same\n            // byte set to 1 as p_plus_1_bytes and otherwise zeroes\n            let mut p_plus_1_converted_bytes: [u8; 32] = p_plus_1.to_be_bytes();\n            assert_eq(p_plus_1_converted_bytes[32 - 1], 1);\n            p_plus_1_converted_bytes[32 - 1] = 0;\n            assert_eq(p_plus_1_converted_bytes, [0; 32]);\n\n            // checking that Field::from_be_bytes::<32> on the Field modulus produces 0\n            assert_eq(modulus_be_bytes().len(), 32);\n            let p = Field::from_be_bytes::<32>(modulus_be_bytes().as_array());\n            assert_eq(p, 0);\n\n            // checking that converting 0 to 32 BE bytes produces 32 zeroes\n            let p_bytes: [u8; 32] = 0.to_be_bytes();\n            assert_eq(p_bytes, [0; 32]);\n        }\n    }\n\n    #[test]\n    fn test_to_from_le_bytes_bn254_edge_cases() {\n        if crate::compat::is_bn254() {\n            // checking that decrementing this byte produces the expected 32 LE bytes for (modulus - 1)\n            let mut p_minus_1_bytes: [u8; 32] = modulus_le_bytes().as_array();\n            assert(p_minus_1_bytes[0] > 0);\n            p_minus_1_bytes[0] -= 1;\n\n            let p_minus_1 = Field::from_le_bytes::<32>(p_minus_1_bytes);\n            assert_eq(p_minus_1 + 1, 0);\n\n            // checking that converting (modulus - 1) from and then to 32 BE bytes produces the same bytes\n            let p_minus_1_converted_bytes: [u8; 32] = p_minus_1.to_le_bytes();\n            assert_eq(p_minus_1_converted_bytes, p_minus_1_bytes);\n\n            // checking that incrementing this byte produces 32 LE bytes for (modulus + 1)\n            let mut p_plus_1_bytes: [u8; 32] = modulus_le_bytes().as_array();\n            assert(p_plus_1_bytes[0] < 255);\n            p_plus_1_bytes[0] += 1;\n\n            let p_plus_1 = Field::from_le_bytes::<32>(p_plus_1_bytes);\n            assert_eq(p_plus_1, 1);\n\n            // checking that converting p_plus_1 to 32 LE bytes produces the same\n            // byte set to 1 as p_plus_1_bytes and otherwise zeroes\n            let mut p_plus_1_converted_bytes: [u8; 32] = p_plus_1.to_le_bytes();\n            assert_eq(p_plus_1_converted_bytes[0], 1);\n            p_plus_1_converted_bytes[0] = 0;\n            assert_eq(p_plus_1_converted_bytes, [0; 32]);\n\n            // checking that Field::from_le_bytes::<32> on the Field modulus produces 0\n            assert_eq(modulus_le_bytes().len(), 32);\n            let p = Field::from_le_bytes::<32>(modulus_le_bytes().as_array());\n            assert_eq(p, 0);\n\n            // checking that converting 0 to 32 LE bytes produces 32 zeroes\n            let p_bytes: [u8; 32] = 0.to_le_bytes();\n            assert_eq(p_bytes, [0; 32]);\n        }\n    }\n\n    /// Convert a little endian bit array to a field element.\n    /// If the provided bit array overflows the field modulus then the Field will silently wrap around.\n    fn from_le_bits<let N: u32>(bits: [u1; N]) -> Field {\n        static_assert(\n            N <= modulus_le_bits().len(),\n            \"N must be less than or equal to modulus_le_bits().len()\",\n        );\n        let mut v = 1;\n        let mut result = 0;\n\n        for i in 0..N {\n            result += (bits[i] as Field) * v;\n            v = v * 2;\n        }\n        result\n    }\n\n    /// Convert a big endian bit array to a field element.\n    /// If the provided bit array overflows the field modulus then the Field will silently wrap around.\n    fn from_be_bits<let N: u32>(bits: [u1; N]) -> Field {\n        let mut v = 1;\n        let mut result = 0;\n\n        for i in 0..N {\n            result += (bits[N - 1 - i] as Field) * v;\n            v = v * 2;\n        }\n        result\n    }\n\n    #[test]\n    fn test_to_from_be_bits_bn254_edge_cases() {\n        if crate::compat::is_bn254() {\n            // checking that decrementing this bit produces the expected 254 BE bits for (modulus - 1)\n            let mut p_minus_1_bits: [u1; 254] = modulus_be_bits().as_array();\n            assert(p_minus_1_bits[254 - 1] > 0);\n            p_minus_1_bits[254 - 1] -= 1;\n\n            let p_minus_1 = from_be_bits::<254>(p_minus_1_bits);\n            assert_eq(p_minus_1 + 1, 0);\n\n            // checking that converting (modulus - 1) from and then to 254 BE bits produces the same bits\n            let p_minus_1_converted_bits: [u1; 254] = p_minus_1.to_be_bits();\n            assert_eq(p_minus_1_converted_bits, p_minus_1_bits);\n\n            // checking that incrementing this bit produces 254 BE bits for (modulus + 4)\n            let mut p_plus_4_bits: [u1; 254] = modulus_be_bits().as_array();\n            assert(p_plus_4_bits[254 - 3] < 1);\n            p_plus_4_bits[254 - 3] += 1;\n\n            let p_plus_4 = from_be_bits::<254>(p_plus_4_bits);\n            assert_eq(p_plus_4, 4);\n\n            // checking that converting p_plus_4 to 254 BE bits produces the same\n            // bit set to 1 as p_plus_4_bits and otherwise zeroes\n            let mut p_plus_4_converted_bits: [u1; 254] = p_plus_4.to_be_bits();\n            assert_eq(p_plus_4_converted_bits[254 - 3], 1);\n            p_plus_4_converted_bits[254 - 3] = 0;\n            assert_eq(p_plus_4_converted_bits, [0; 254]);\n\n            // checking that Field::from_be_bits::<254> on the Field modulus produces 0\n            assert_eq(modulus_be_bits().len(), 254);\n            let p = from_be_bits::<254>(modulus_be_bits().as_array());\n            assert_eq(p, 0);\n\n            // checking that converting 0 to 254 BE bytes produces 254 zeroes\n            let p_bits: [u1; 254] = 0.to_be_bits();\n            assert_eq(p_bits, [0; 254]);\n        }\n    }\n\n    #[test]\n    fn test_to_from_le_bits_bn254_edge_cases() {\n        if crate::compat::is_bn254() {\n            // checking that decrementing this bit produces the expected 254 LE bits for (modulus - 1)\n            let mut p_minus_1_bits: [u1; 254] = modulus_le_bits().as_array();\n            assert(p_minus_1_bits[0] > 0);\n            p_minus_1_bits[0] -= 1;\n\n            let p_minus_1 = from_le_bits::<254>(p_minus_1_bits);\n            assert_eq(p_minus_1 + 1, 0);\n\n            // checking that converting (modulus - 1) from and then to 254 BE bits produces the same bits\n            let p_minus_1_converted_bits: [u1; 254] = p_minus_1.to_le_bits();\n            assert_eq(p_minus_1_converted_bits, p_minus_1_bits);\n\n            // checking that incrementing this bit produces 254 LE bits for (modulus + 4)\n            let mut p_plus_4_bits: [u1; 254] = modulus_le_bits().as_array();\n            assert(p_plus_4_bits[2] < 1);\n            p_plus_4_bits[2] += 1;\n\n            let p_plus_4 = from_le_bits::<254>(p_plus_4_bits);\n            assert_eq(p_plus_4, 4);\n\n            // checking that converting p_plus_4 to 254 LE bits produces the same\n            // bit set to 1 as p_plus_4_bits and otherwise zeroes\n            let mut p_plus_4_converted_bits: [u1; 254] = p_plus_4.to_le_bits();\n            assert_eq(p_plus_4_converted_bits[2], 1);\n            p_plus_4_converted_bits[2] = 0;\n            assert_eq(p_plus_4_converted_bits, [0; 254]);\n\n            // checking that Field::from_le_bits::<254> on the Field modulus produces 0\n            assert_eq(modulus_le_bits().len(), 254);\n            let p = from_le_bits::<254>(modulus_le_bits().as_array());\n            assert_eq(p, 0);\n\n            // checking that converting 0 to 254 LE bytes produces 254 zeroes\n            let p_bits: [u1; 254] = 0.to_le_bits();\n            assert_eq(p_bits, [0; 254]);\n        }\n    }\n}\n"
     },
-    "180": {
+    "181": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/message_processing.nr",
       "source": "use protocol_types::address::AztecAddress;\n\n/// Finds new private logs that may have been sent to all registered accounts in PXE in the current contract and makes\n/// them available for later processing in Noir by storing them in a capsule array.\npub unconstrained fn fetch_tagged_logs(pending_tagged_log_array_base_slot: Field) {\n    fetch_tagged_logs_oracle(pending_tagged_log_array_base_slot);\n}\n\n#[oracle(utilityFetchTaggedLogs)]\nunconstrained fn fetch_tagged_logs_oracle(pending_tagged_log_array_base_slot: Field) {}\n\n// This must be a single oracle and not one for notes and one for events because the entire point is to validate\n// all notes and events in one go, minimizing node round-trips.\npub(crate) unconstrained fn validate_enqueued_notes_and_events(\n    contract_address: AztecAddress,\n    note_validation_requests_array_base_slot: Field,\n    event_validation_requests_array_base_slot: Field,\n) {\n    validate_enqueued_notes_and_events_oracle(\n        contract_address,\n        note_validation_requests_array_base_slot,\n        event_validation_requests_array_base_slot,\n    );\n}\n\n#[oracle(utilityValidateEnqueuedNotesAndEvents)]\nunconstrained fn validate_enqueued_notes_and_events_oracle(\n    contract_address: AztecAddress,\n    note_validation_requests_array_base_slot: Field,\n    event_validation_requests_array_base_slot: Field,\n) {}\n\npub(crate) unconstrained fn bulk_retrieve_logs(\n    contract_address: AztecAddress,\n    log_retrieval_requests_array_base_slot: Field,\n    log_retrieval_responses_array_base_slot: Field,\n) {\n    bulk_retrieve_logs_oracle(\n        contract_address,\n        log_retrieval_requests_array_base_slot,\n        log_retrieval_responses_array_base_slot,\n    );\n}\n\n#[oracle(utilityBulkRetrieveLogs)]\nunconstrained fn bulk_retrieve_logs_oracle(\n    contract_address: AztecAddress,\n    log_retrieval_requests_array_base_slot: Field,\n    log_retrieval_responses_array_base_slot: Field,\n) {}\n"
     },
-    "182": {
+    "183": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/notes.nr",
       "source": "use crate::note::{note_interface::NoteType, retrieved_note::RetrievedNote};\n\nuse dep::protocol_types::{address::AztecAddress, traits::Packable};\n\n/// Notifies the simulator that a note has been created, so that it can be returned in future read requests in the same\n/// transaction. This note should only be added to the non-volatile database if found in an actual block.\npub fn notify_created_note<let N: u32>(\n    owner: AztecAddress,\n    storage_slot: Field,\n    randomness: Field,\n    note_type_id: Field,\n    packed_note: [Field; N],\n    note_hash: Field,\n    counter: u32,\n) {\n    // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n    // to call.\n    unsafe {\n        notify_created_note_oracle_wrapper(\n            owner,\n            storage_slot,\n            randomness,\n            note_type_id,\n            packed_note,\n            note_hash,\n            counter,\n        )\n    };\n}\n\n/// Notifies the simulator that a note has been nullified, so that it is no longer returned in future read requests in\n/// the same transaction. This note should only be removed to the non-volatile database if its nullifier is found in an\n/// actual block.\npub fn notify_nullified_note(nullifier: Field, note_hash: Field, counter: u32) {\n    // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe to\n    // call.\n    unsafe { notify_nullified_note_oracle_wrapper(nullifier, note_hash, counter) };\n}\n\n/// Notifies the simulator that a non-note nullifier has been created, so that it can be used for note nonces.\npub fn notify_created_nullifier(nullifier: Field) {\n    // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe to\n    // call.\n    unsafe { notify_created_nullifier_oracle_wrapper(nullifier) };\n}\n\nunconstrained fn notify_created_note_oracle_wrapper<let N: u32>(\n    owner: AztecAddress,\n    storage_slot: Field,\n    randomness: Field,\n    note_type_id: Field,\n    packed_note: [Field; N],\n    note_hash: Field,\n    counter: u32,\n) {\n    notify_created_note_oracle(\n        owner,\n        storage_slot,\n        randomness,\n        note_type_id,\n        packed_note,\n        note_hash,\n        counter,\n    );\n}\n\n#[oracle(privateNotifyCreatedNote)]\nunconstrained fn notify_created_note_oracle<let N: u32>(\n    _owner: AztecAddress,\n    _storage_slot: Field,\n    _randomness: Field,\n    _note_type_id: Field,\n    _packed_note: [Field; N],\n    _note_hash: Field,\n    _counter: u32,\n) {}\n\nunconstrained fn notify_nullified_note_oracle_wrapper(\n    nullifier: Field,\n    note_hash: Field,\n    counter: u32,\n) {\n    notify_nullified_note_oracle(nullifier, note_hash, counter);\n}\n\n#[oracle(privateNotifyNullifiedNote)]\nunconstrained fn notify_nullified_note_oracle(_nullifier: Field, _note_hash: Field, _counter: u32) {}\n\nunconstrained fn notify_created_nullifier_oracle_wrapper(nullifier: Field) {\n    notify_created_nullifier_oracle(nullifier);\n}\n\n#[oracle(privateNotifyCreatedNullifier)]\nunconstrained fn notify_created_nullifier_oracle(_nullifier: Field) {}\n\n#[oracle(utilityGetNotes)]\nunconstrained fn get_notes_oracle<Note, let M: u32, let MaxNotes: u32>(\n    _owner: Option<AztecAddress>,\n    _storage_slot: Field,\n    _num_selects: u8,\n    _select_by_indexes: [u8; M],\n    _select_by_offsets: [u8; M],\n    _select_by_lengths: [u8; M],\n    _select_values: [Field; M],\n    _select_comparators: [u8; M],\n    _sort_by_indexes: [u8; M],\n    _sort_by_offsets: [u8; M],\n    _sort_by_lengths: [u8; M],\n    _sort_order: [u8; M],\n    _limit: u32,\n    _offset: u32,\n    _status: u8,\n    // This is always set to MAX_NOTES. We need to pass it to TS in order to correctly construct the BoundedVec\n    _max_notes: u32,\n    // This is always set to <RetrievedNote<Note> as Packable>::N. We need to pass it to TS in order to be able to\n    // correctly construct the BoundedVec there.\n    _packed_retrieved_note_length: u32,\n) -> BoundedVec<[Field; <RetrievedNote<Note> as Packable>::N], MaxNotes>\nwhere\n    // TODO(https://github.com/noir-lang/noir/issues/9399): `Note: Packable` should work here.\n    RetrievedNote<Note>: Packable,\n{}\n\npub unconstrained fn get_notes<Note, let M: u32, let MaxNotes: u32>(\n    owner: Option<AztecAddress>,\n    storage_slot: Field,\n    num_selects: u8,\n    select_by_indexes: [u8; M],\n    select_by_offsets: [u8; M],\n    select_by_lengths: [u8; M],\n    select_values: [Field; M],\n    select_comparators: [u8; M],\n    sort_by_indexes: [u8; M],\n    sort_by_offsets: [u8; M],\n    sort_by_lengths: [u8; M],\n    sort_order: [u8; M],\n    limit: u32,\n    offset: u32,\n    status: u8,\n) -> [Option<RetrievedNote<Note>>; MaxNotes]\nwhere\n    Note: NoteType + Packable,\n{\n    let packed_retrieved_notes: BoundedVec<[Field; <RetrievedNote<Note> as Packable>::N], MaxNotes>\n         = get_notes_oracle::<Note, M, MaxNotes>(\n            owner,\n            storage_slot,\n            num_selects,\n            select_by_indexes,\n            select_by_offsets,\n            select_by_lengths,\n            select_values,\n            select_comparators,\n            sort_by_indexes,\n            sort_by_offsets,\n            sort_by_lengths,\n            sort_order,\n            limit,\n            offset,\n            status,\n            MaxNotes,\n            <RetrievedNote<Note> as Packable>::N,\n        );\n\n    let mut notes = BoundedVec::<_, MaxNotes>::new();\n    for i in 0..packed_retrieved_notes.len() {\n        let retrieved_note = RetrievedNote::unpack(packed_retrieved_notes.get(i));\n        notes.push(retrieved_note);\n    }\n\n    // At last we convert the bounded vector to an array of options. We do this because that is what the filter\n    // function needs to have on the output and we've decided to have the same type on the input and output of\n    // the filter and preprocessor functions.\n    //\n    // We have decided to have the same type on the input and output of the filter and preprocessor functions because\n    // it allows us to chain multiple filters and preprocessors together.\n    //\n    // So why do we want the array of options on the output of the filter function?\n    //\n    // Filter returns an array of options rather than a BoundedVec for performance reasons. Using an array of options\n    // allows setting values at known indices in the output array which is much more efficient than pushing to a\n    // BoundedVec where the write position depends on previous iterations. The array can then be efficiently converted\n    // to a BoundedVec using utils/array/collapse.nr::collapse function from Aztec.nr. This avoids expensive dynamic\n    // memory access patterns that would be required when building up a BoundedVec incrementally. For preprocessor\n    // functions we could use BoundedVec return value as there the optimization does not matter since it is applied in\n    // an unconstrained context. We, however, use the same return value type to be able to use the same function as\n    // both a preprocessor and a filter.\n    let mut notes_array = [Option::none(); MaxNotes];\n    for i in 0..notes.len() {\n        if i < notes.len() {\n            notes_array[i] = Option::some(notes.get_unchecked(i));\n        }\n    }\n\n    notes_array\n}\n\n/// Returns true if the nullifier exists. Note that a `true` value can be constrained by proving existence of the\n/// nullifier, but a `false` value should not be relied upon since other transactions may emit this nullifier before the\n/// current transaction is included in a block. While this might seem of little use at first, certain design patterns\n/// benefit from this abstraction (see e.g. `PrivateMutable`).\npub unconstrained fn check_nullifier_exists(inner_nullifier: Field) -> bool {\n    check_nullifier_exists_oracle(inner_nullifier)\n}\n\n#[oracle(utilityCheckNullifierExists)]\nunconstrained fn check_nullifier_exists_oracle(_inner_nullifier: Field) -> bool {}\n\n// TODO: Oracles below are generic private log oracles and are not specific to notes. Move them somewhere else.\n\n/// Returns the next app tag for a given sender and recipient pair.\n///\n/// This also notifies the simulator that a tag has been used in a note, and to therefore increment the\n/// associated index so that future notes get a different tag and can be discovered by the recipient.\n/// This change should only be persisted in a non-volatile database if the tagged log is found in an actual block -\n/// otherwise e.g. a reverting transaction can cause the sender to accidentally skip indices and later produce notes\n/// that are not found by the recipient.\npub unconstrained fn get_next_app_tag_as_sender(\n    sender: AztecAddress,\n    recipient: AztecAddress,\n) -> Field {\n    get_next_app_tag_as_sender_oracle(sender, recipient)\n}\n\n#[oracle(privateGetNextAppTagAsSender)]\nunconstrained fn get_next_app_tag_as_sender_oracle(\n    _sender: AztecAddress,\n    _recipient: AztecAddress,\n) -> Field {}\n\n/// Gets the sender for tags.\n///\n/// This unconstrained value is used as the sender when computing an unconstrained shared secret\n/// for a tag in order to emit a log. Constrained tagging should not use this as there is no\n/// guarantee that the recipient knows about the sender, and hence about the shared secret.\n///\n/// The value persists through nested calls, meaning all calls down the stack will use the same\n/// 'senderForTags' value (unless it is replaced).\npub unconstrained fn get_sender_for_tags() -> Option<AztecAddress> {\n    get_sender_for_tags_oracle()\n}\n\n#[oracle(privateGetSenderForTags)]\nunconstrained fn get_sender_for_tags_oracle() -> Option<AztecAddress> {}\n\n/// Sets the sender for tags.\n///\n/// This unconstrained value is used as the sender when computing an unconstrained shared secret\n/// for a tag in order to emit a log. Constrained tagging should not use this as there is no\n/// guarantee that the recipient knows about the sender, and hence about the shared secret.\n///\n/// Account contracts typically set this value before calling other contracts. The value persists\n/// through nested calls, meaning all calls down the stack will use the same 'senderForTags'\n/// value (unless it is replaced by another call to this setter).\npub unconstrained fn set_sender_for_tags(sender_for_tags: AztecAddress) {\n    set_sender_for_tags_oracle(sender_for_tags);\n}\n\n#[oracle(privateSetSenderForTags)]\nunconstrained fn set_sender_for_tags_oracle(_sender_for_tags: AztecAddress) {}\n"
     },
-    "185": {
+    "186": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/shared_secret.nr",
       "source": "use protocol_types::{address::aztec_address::AztecAddress, point::Point};\n\n// TODO(#12656): return an app-siloed secret + document this\n#[oracle(utilityGetSharedSecret)]\nunconstrained fn get_shared_secret_oracle(address: AztecAddress, ephPk: Point) -> Point {}\n\n/// Returns an app-siloed shared secret between `address` and someone who knows the secret key behind an\n/// ephemeral public key `ephPk`. The app-siloing means that contracts cannot retrieve secrets that belong to\n/// other contracts, and therefore cannot e.g. decrypt their messages. This is an important security consideration\n/// given that both the `address` and `ephPk` are public information.\n///\n/// The shared secret `S` is computed as:\n/// `let S =  (ivsk + h) * ephPk`\n/// where `ivsk + h` is the 'preaddress' i.e. the preimage of the address, also called the address secret.\n/// TODO(#12656): app-silo this secret\npub unconstrained fn get_shared_secret(address: AztecAddress, ephPk: Point) -> Point {\n    get_shared_secret_oracle(address, ephPk)\n}\n"
     },
-    "187": {
+    "188": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/version.nr",
       "source": "/// The ORACLE_VERSION constant is used to check that the oracle interface is in sync between PXE and Aztec.nr. We need\n/// to version the oracle interface to ensure that developers get a reasonable error message if they use incompatible\n/// versions of Aztec.nr and PXE. The TypeScript counterpart is in `oracle_version.ts`.\n///\n/// @dev Whenever a contract function or Noir test is run, the `utilityAssertCompatibleOracleVersion` oracle is called and\n/// if the oracle version is incompatible an error is thrown.\npub global ORACLE_VERSION: Field = 5;\n\n/// Asserts that the version of the oracle is compatible with the version expected by the contract.\npub fn assert_compatible_oracle_version() {\n    // Safety: This oracle call returns nothing: we only call it to check Aztec.nr and Oracle interface versions are\n    // compatible. It is therefore always safe to call.\n    unsafe {\n        assert_compatible_oracle_version_wrapper();\n    }\n}\n\nunconstrained fn assert_compatible_oracle_version_wrapper() {\n    assert_compatible_oracle_version_oracle(ORACLE_VERSION);\n}\n\n#[oracle(utilityAssertCompatibleOracleVersion)]\nunconstrained fn assert_compatible_oracle_version_oracle(version: Field) {}\n\nmod test {\n    use super::{assert_compatible_oracle_version_oracle, ORACLE_VERSION};\n\n    #[test]\n    unconstrained fn compatible_oracle_version() {\n        assert_compatible_oracle_version_oracle(ORACLE_VERSION);\n    }\n\n    #[test(should_fail_with = \"Incompatible oracle version. TXE is using version\")]\n    unconstrained fn incompatible_oracle_version() {\n        let arbitrary_incorrect_version = 318183437;\n        assert_compatible_oracle_version_oracle(arbitrary_incorrect_version);\n    }\n}\n"
     },
@@ -3445,47 +3449,47 @@
       "path": "std/hash/mod.nr",
       "source": "// Exposed only for usage in `std::meta`\npub(crate) mod poseidon2;\n\nuse crate::default::Default;\nuse crate::embedded_curve_ops::{\n    EmbeddedCurvePoint, EmbeddedCurveScalar, multi_scalar_mul, multi_scalar_mul_array_return,\n};\nuse crate::meta::derive_via;\n\n#[foreign(sha256_compression)]\n// docs:start:sha256_compression\npub fn sha256_compression(input: [u32; 16], state: [u32; 8]) -> [u32; 8] {}\n// docs:end:sha256_compression\n\n#[foreign(keccakf1600)]\n// docs:start:keccakf1600\npub fn keccakf1600(input: [u64; 25]) -> [u64; 25] {}\n// docs:end:keccakf1600\n\npub mod keccak {\n    #[deprecated(\"This function has been moved to std::hash::keccakf1600\")]\n    pub fn keccakf1600(input: [u64; 25]) -> [u64; 25] {\n        super::keccakf1600(input)\n    }\n}\n\n#[foreign(blake2s)]\n// docs:start:blake2s\npub fn blake2s<let N: u32>(input: [u8; N]) -> [u8; 32]\n// docs:end:blake2s\n{}\n\n// docs:start:blake3\npub fn blake3<let N: u32>(input: [u8; N]) -> [u8; 32]\n// docs:end:blake3\n{\n    if crate::runtime::is_unconstrained() {\n        // Temporary measure while Barretenberg is main proving system.\n        // Please open an issue if you're working on another proving system and running into problems due to this.\n        crate::static_assert(\n            N <= 1024,\n            \"Barretenberg cannot prove blake3 hashes with inputs larger than 1024 bytes\",\n        );\n    }\n    __blake3(input)\n}\n\n#[foreign(blake3)]\nfn __blake3<let N: u32>(input: [u8; N]) -> [u8; 32] {}\n\n// docs:start:pedersen_commitment\npub fn pedersen_commitment<let N: u32>(input: [Field; N]) -> EmbeddedCurvePoint {\n    // docs:end:pedersen_commitment\n    pedersen_commitment_with_separator(input, 0)\n}\n\n#[inline_always]\npub fn pedersen_commitment_with_separator<let N: u32>(\n    input: [Field; N],\n    separator: u32,\n) -> EmbeddedCurvePoint {\n    let mut points = [EmbeddedCurveScalar { lo: 0, hi: 0 }; N];\n    for i in 0..N {\n        // we use the unsafe version because the multi_scalar_mul will constrain the scalars.\n        points[i] = from_field_unsafe(input[i]);\n    }\n    let generators = derive_generators(\"DEFAULT_DOMAIN_SEPARATOR\".as_bytes(), separator);\n    multi_scalar_mul(generators, points)\n}\n\n// docs:start:pedersen_hash\npub fn pedersen_hash<let N: u32>(input: [Field; N]) -> Field\n// docs:end:pedersen_hash\n{\n    pedersen_hash_with_separator(input, 0)\n}\n\n#[no_predicates]\npub fn pedersen_hash_with_separator<let N: u32>(input: [Field; N], separator: u32) -> Field {\n    let mut scalars: [EmbeddedCurveScalar; N + 1] = [EmbeddedCurveScalar { lo: 0, hi: 0 }; N + 1];\n    let mut generators: [EmbeddedCurvePoint; N + 1] =\n        [EmbeddedCurvePoint::point_at_infinity(); N + 1];\n    let domain_generators: [EmbeddedCurvePoint; N] =\n        derive_generators(\"DEFAULT_DOMAIN_SEPARATOR\".as_bytes(), separator);\n\n    for i in 0..N {\n        scalars[i] = from_field_unsafe(input[i]);\n        generators[i] = domain_generators[i];\n    }\n    scalars[N] = EmbeddedCurveScalar { lo: N as Field, hi: 0 as Field };\n\n    let length_generator: [EmbeddedCurvePoint; 1] =\n        derive_generators(\"pedersen_hash_length\".as_bytes(), 0);\n    generators[N] = length_generator[0];\n    multi_scalar_mul_array_return(generators, scalars, true)[0].x\n}\n\n#[field(bn254)]\n#[inline_always]\npub fn derive_generators<let N: u32, let M: u32>(\n    domain_separator_bytes: [u8; M],\n    starting_index: u32,\n) -> [EmbeddedCurvePoint; N] {\n    crate::assert_constant(domain_separator_bytes);\n    // TODO(https://github.com/noir-lang/noir/issues/5672): Add back assert_constant on starting_index\n    __derive_generators(domain_separator_bytes, starting_index)\n}\n\n#[builtin(derive_pedersen_generators)]\n#[field(bn254)]\nfn __derive_generators<let N: u32, let M: u32>(\n    domain_separator_bytes: [u8; M],\n    starting_index: u32,\n) -> [EmbeddedCurvePoint; N] {}\n\n#[field(bn254)]\n// Decompose the input 'bn254 scalar' into two 128 bits limbs.\n// It is called 'unsafe' because it does not assert the limbs are 128 bits\n// Assuming the limbs are 128 bits:\n// Assert the decomposition does not overflow the field size.\nfn from_field_unsafe(scalar: Field) -> EmbeddedCurveScalar {\n    // Safety: xlo and xhi decomposition is checked below\n    let (xlo, xhi) = unsafe { crate::field::bn254::decompose_hint(scalar) };\n    // Check that the decomposition is correct\n    assert_eq(scalar, xlo + crate::field::bn254::TWO_POW_128 * xhi);\n    // Check that the decomposition does not overflow the field size\n    let (a, b) = if xhi == crate::field::bn254::PHI {\n        (xlo, crate::field::bn254::PLO)\n    } else {\n        (xhi, crate::field::bn254::PHI)\n    };\n    crate::field::bn254::assert_lt(a, b);\n\n    EmbeddedCurveScalar { lo: xlo, hi: xhi }\n}\n\npub fn poseidon2_permutation<let N: u32>(input: [Field; N], state_len: u32) -> [Field; N] {\n    assert_eq(input.len(), state_len);\n    poseidon2_permutation_internal(input)\n}\n\n#[foreign(poseidon2_permutation)]\nfn poseidon2_permutation_internal<let N: u32>(input: [Field; N]) -> [Field; N] {}\n\n// Generic hashing support.\n// Partially ported and impacted by rust.\n\n// Hash trait shall be implemented per type.\n#[derive_via(derive_hash)]\npub trait Hash {\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher;\n}\n\n// docs:start:derive_hash\ncomptime fn derive_hash(s: TypeDefinition) -> Quoted {\n    let name = quote { $crate::hash::Hash };\n    let signature = quote { fn hash<H>(_self: Self, _state: &mut H) where H: $crate::hash::Hasher };\n    let for_each_field = |name| quote { _self.$name.hash(_state); };\n    crate::meta::make_trait_impl(\n        s,\n        name,\n        signature,\n        for_each_field,\n        quote {},\n        |fields| fields,\n    )\n}\n// docs:end:derive_hash\n\n// Hasher trait shall be implemented by algorithms to provide hash-agnostic means.\n// TODO: consider making the types generic here ([u8], [Field], etc.)\npub trait Hasher {\n    fn finish(self) -> Field;\n\n    fn write(&mut self, input: Field);\n}\n\n// BuildHasher is a factory trait, responsible for production of specific Hasher.\npub trait BuildHasher {\n    type H: Hasher;\n\n    fn build_hasher(self) -> H;\n}\n\npub struct BuildHasherDefault<H>;\n\nimpl<H> BuildHasher for BuildHasherDefault<H>\nwhere\n    H: Hasher + Default,\n{\n    type H = H;\n\n    fn build_hasher(_self: Self) -> H {\n        H::default()\n    }\n}\n\nimpl<H> Default for BuildHasherDefault<H>\nwhere\n    H: Hasher + Default,\n{\n    fn default() -> Self {\n        BuildHasherDefault {}\n    }\n}\n\nimpl Hash for Field {\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        H::write(state, self);\n    }\n}\n\nimpl Hash for u1 {\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        H::write(state, self as Field);\n    }\n}\n\nimpl Hash for u8 {\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        H::write(state, self as Field);\n    }\n}\n\nimpl Hash for u16 {\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        H::write(state, self as Field);\n    }\n}\n\nimpl Hash for u32 {\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        H::write(state, self as Field);\n    }\n}\n\nimpl Hash for u64 {\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        H::write(state, self as Field);\n    }\n}\n\nimpl Hash for u128 {\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        H::write(state, self as Field);\n    }\n}\n\nimpl Hash for i8 {\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        H::write(state, self as u8 as Field);\n    }\n}\n\nimpl Hash for i16 {\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        H::write(state, self as u16 as Field);\n    }\n}\n\nimpl Hash for i32 {\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        H::write(state, self as u32 as Field);\n    }\n}\n\nimpl Hash for i64 {\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        H::write(state, self as u64 as Field);\n    }\n}\n\nimpl Hash for bool {\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        H::write(state, self as Field);\n    }\n}\n\nimpl Hash for () {\n    fn hash<H>(_self: Self, _state: &mut H)\n    where\n        H: Hasher,\n    {}\n}\n\nimpl<T, let N: u32> Hash for [T; N]\nwhere\n    T: Hash,\n{\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        for elem in self {\n            elem.hash(state);\n        }\n    }\n}\n\nimpl<T> Hash for [T]\nwhere\n    T: Hash,\n{\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        self.len().hash(state);\n        for elem in self {\n            elem.hash(state);\n        }\n    }\n}\n\nimpl<A, B> Hash for (A, B)\nwhere\n    A: Hash,\n    B: Hash,\n{\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        self.0.hash(state);\n        self.1.hash(state);\n    }\n}\n\nimpl<A, B, C> Hash for (A, B, C)\nwhere\n    A: Hash,\n    B: Hash,\n    C: Hash,\n{\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        self.0.hash(state);\n        self.1.hash(state);\n        self.2.hash(state);\n    }\n}\n\nimpl<A, B, C, D> Hash for (A, B, C, D)\nwhere\n    A: Hash,\n    B: Hash,\n    C: Hash,\n    D: Hash,\n{\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        self.0.hash(state);\n        self.1.hash(state);\n        self.2.hash(state);\n        self.3.hash(state);\n    }\n}\n\nimpl<A, B, C, D, E> Hash for (A, B, C, D, E)\nwhere\n    A: Hash,\n    B: Hash,\n    C: Hash,\n    D: Hash,\n    E: Hash,\n{\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        self.0.hash(state);\n        self.1.hash(state);\n        self.2.hash(state);\n        self.3.hash(state);\n        self.4.hash(state);\n    }\n}\n\n// Some test vectors for Pedersen hash and Pedersen Commitment.\n// They have been generated using the same functions so the tests are for now useless\n// but they will be useful when we switch to Noir implementation.\n#[test]\nfn assert_pedersen() {\n    assert_eq(\n        pedersen_hash_with_separator([1], 1),\n        0x1b3f4b1a83092a13d8d1a59f7acb62aba15e7002f4440f2275edb99ebbc2305f,\n    );\n    assert_eq(\n        pedersen_commitment_with_separator([1], 1),\n        EmbeddedCurvePoint {\n            x: 0x054aa86a73cb8a34525e5bbed6e43ba1198e860f5f3950268f71df4591bde402,\n            y: 0x209dcfbf2cfb57f9f6046f44d71ac6faf87254afc7407c04eb621a6287cac126,\n            is_infinite: false,\n        },\n    );\n\n    assert_eq(\n        pedersen_hash_with_separator([1, 2], 2),\n        0x26691c129448e9ace0c66d11f0a16d9014a9e8498ee78f4d69f0083168188255,\n    );\n    assert_eq(\n        pedersen_commitment_with_separator([1, 2], 2),\n        EmbeddedCurvePoint {\n            x: 0x2e2b3b191e49541fe468ec6877721d445dcaffe41728df0a0eafeb15e87b0753,\n            y: 0x2ff4482400ad3a6228be17a2af33e2bcdf41be04795f9782bd96efe7e24f8778,\n            is_infinite: false,\n        },\n    );\n    assert_eq(\n        pedersen_hash_with_separator([1, 2, 3], 3),\n        0x0bc694b7a1f8d10d2d8987d07433f26bd616a2d351bc79a3c540d85b6206dbe4,\n    );\n    assert_eq(\n        pedersen_commitment_with_separator([1, 2, 3], 3),\n        EmbeddedCurvePoint {\n            x: 0x1fee4e8cf8d2f527caa2684236b07c4b1bad7342c01b0f75e9a877a71827dc85,\n            y: 0x2f9fedb9a090697ab69bf04c8bc15f7385b3e4b68c849c1536e5ae15ff138fd1,\n            is_infinite: false,\n        },\n    );\n    assert_eq(\n        pedersen_hash_with_separator([1, 2, 3, 4], 4),\n        0xdae10fb32a8408521803905981a2b300d6a35e40e798743e9322b223a5eddc,\n    );\n    assert_eq(\n        pedersen_commitment_with_separator([1, 2, 3, 4], 4),\n        EmbeddedCurvePoint {\n            x: 0x07ae3e202811e1fca39c2d81eabe6f79183978e6f12be0d3b8eda095b79bdbc9,\n            y: 0x0afc6f892593db6fbba60f2da558517e279e0ae04f95758587760ba193145014,\n            is_infinite: false,\n        },\n    );\n    assert_eq(\n        pedersen_hash_with_separator([1, 2, 3, 4, 5], 5),\n        0xfc375b062c4f4f0150f7100dfb8d9b72a6d28582dd9512390b0497cdad9c22,\n    );\n    assert_eq(\n        pedersen_commitment_with_separator([1, 2, 3, 4, 5], 5),\n        EmbeddedCurvePoint {\n            x: 0x1754b12bd475a6984a1094b5109eeca9838f4f81ac89c5f0a41dbce53189bb29,\n            y: 0x2da030e3cfcdc7ddad80eaf2599df6692cae0717d4e9f7bfbee8d073d5d278f7,\n            is_infinite: false,\n        },\n    );\n    assert_eq(\n        pedersen_hash_with_separator([1, 2, 3, 4, 5, 6], 6),\n        0x1696ed13dc2730062a98ac9d8f9de0661bb98829c7582f699d0273b18c86a572,\n    );\n    assert_eq(\n        pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6], 6),\n        EmbeddedCurvePoint {\n            x: 0x190f6c0e97ad83e1e28da22a98aae156da083c5a4100e929b77e750d3106a697,\n            y: 0x1f4b60f34ef91221a0b49756fa0705da93311a61af73d37a0c458877706616fb,\n            is_infinite: false,\n        },\n    );\n    assert_eq(\n        pedersen_hash_with_separator([1, 2, 3, 4, 5, 6, 7], 7),\n        0x128c0ff144fc66b6cb60eeac8a38e23da52992fc427b92397a7dffd71c45ede3,\n    );\n    assert_eq(\n        pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6, 7], 7),\n        EmbeddedCurvePoint {\n            x: 0x015441e9d29491b06563fac16fc76abf7a9534c715421d0de85d20dbe2965939,\n            y: 0x1d2575b0276f4e9087e6e07c2cb75aa1baafad127af4be5918ef8a2ef2fea8fc,\n            is_infinite: false,\n        },\n    );\n    assert_eq(\n        pedersen_hash_with_separator([1, 2, 3, 4, 5, 6, 7, 8], 8),\n        0x2f960e117482044dfc99d12fece2ef6862fba9242be4846c7c9a3e854325a55c,\n    );\n    assert_eq(\n        pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6, 7, 8], 8),\n        EmbeddedCurvePoint {\n            x: 0x1657737676968887fceb6dd516382ea13b3a2c557f509811cd86d5d1199bc443,\n            y: 0x1f39f0cb569040105fa1e2f156521e8b8e08261e635a2b210bdc94e8d6d65f77,\n            is_infinite: false,\n        },\n    );\n    assert_eq(\n        pedersen_hash_with_separator([1, 2, 3, 4, 5, 6, 7, 8, 9], 9),\n        0x0c96db0790602dcb166cc4699e2d306c479a76926b81c2cb2aaa92d249ec7be7,\n    );\n    assert_eq(\n        pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6, 7, 8, 9], 9),\n        EmbeddedCurvePoint {\n            x: 0x0a3ceae42d14914a432aa60ec7fded4af7dad7dd4acdbf2908452675ec67e06d,\n            y: 0xfc19761eaaf621ad4aec9a8b2e84a4eceffdba78f60f8b9391b0bd9345a2f2,\n            is_infinite: false,\n        },\n    );\n    assert_eq(\n        pedersen_hash_with_separator([1, 2, 3, 4, 5, 6, 7, 8, 9, 10], 10),\n        0x2cd37505871bc460a62ea1e63c7fe51149df5d0801302cf1cbc48beb8dff7e94,\n    );\n    assert_eq(\n        pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6, 7, 8, 9, 10], 10),\n        EmbeddedCurvePoint {\n            x: 0x2fb3f8b3d41ddde007c8c3c62550f9a9380ee546fcc639ffbb3fd30c8d8de30c,\n            y: 0x300783be23c446b11a4c0fabf6c91af148937cea15fcf5fb054abf7f752ee245,\n            is_infinite: false,\n        },\n    );\n}\n"
     },
-    "190": {
+    "191": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/state_vars/delayed_public_mutable.nr",
       "source": "use dep::protocol_types::{\n    delayed_public_mutable::{\n        delayed_public_mutable_values::{unpack_delay_change, unpack_value_change},\n        DelayedPublicMutableValues,\n        ScheduledDelayChange,\n        ScheduledValueChange,\n    },\n    traits::Packable,\n};\n\nuse crate::{\n    context::{PrivateContext, PublicContext, UtilityContext},\n    state_vars::state_variable::StateVariable,\n    utils::with_hash::WithHash,\n};\n\nmod test;\n\npub struct DelayedPublicMutable<T, let InitialDelay: u64, Context> {\n    context: Context,\n    storage_slot: Field,\n}\n\n// DelayedPublicMutable<T> stores a value of type T that is:\n//  - publicly known (i.e. unencrypted)\n//  - mutable in public\n//  - readable in private with no contention (i.e. multiple parties can all read the same value without blocking one\n//    another nor needing to coordinate)\n// This is famously a hard problem to solve. DelayedPublicMutable makes it work by introducing a delay to public mutation:\n// the value is not changed immediately but rather a value change is scheduled to happen in the future after some delay\n// measured in seconds. Reads in private are only valid as long as they are included in a block with a timestamp not\n// too far into the future, so that they can guarantee the value will not have possibly changed by then (because of the\n// delay). The delay for changing a value is initially equal to InitialDelay, but can be changed by calling\n// `schedule_delay_change`.\n//\n// This implementation requires that T implements the Packable and Eq traits, and allocates `M + 1` storage slots to\n// this state variable.\nimpl<T, let InitialDelay: u64, Context, let M: u32> StateVariable<M + 1, Context> for DelayedPublicMutable<T, InitialDelay, Context>\nwhere\n    DelayedPublicMutableValues<T, InitialDelay>: Packable<N = M>,\n{\n    fn new(context: Context, storage_slot: Field) -> Self {\n        assert(storage_slot != 0, \"Storage slot 0 not allowed. Storage slots must start from 1.\");\n        Self { context, storage_slot }\n    }\n\n    fn get_storage_slot(self) -> Field {\n        self.storage_slot\n    }\n}\n\nimpl<T, let InitialDelay: u64> DelayedPublicMutable<T, InitialDelay, PublicContext>\nwhere\n    T: Eq,\n{\n\n    pub fn schedule_value_change(self, new_value: T)\n    where\n        T: Packable,\n    {\n        let _value_change = self.schedule_and_return_value_change(new_value);\n    }\n\n    pub fn schedule_and_return_value_change(self, new_value: T) -> ScheduledValueChange<T>\n    where\n        T: Packable,\n    {\n        let mut value_change = self.read_value_change();\n        let delay_change = self.read_delay_change();\n\n        let current_timestamp = self.context.timestamp();\n        let current_delay = delay_change.get_current(current_timestamp);\n\n        // TODO: make this configurable\n        // https://github.com/AztecProtocol/aztec-packages/issues/5501\n        let timestamp_of_change = current_timestamp + current_delay;\n        value_change.schedule_change(\n            new_value,\n            current_timestamp,\n            current_delay,\n            timestamp_of_change,\n        );\n\n        self.write(value_change, delay_change);\n\n        value_change\n    }\n\n    pub fn schedule_delay_change(self, new_delay: u64)\n    where\n        T: Packable,\n    {\n        let mut delay_change = self.read_delay_change();\n\n        let current_timestamp = self.context.timestamp();\n\n        delay_change.schedule_change(new_delay, current_timestamp);\n\n        self.write(self.read_value_change(), delay_change);\n    }\n\n    pub fn get_current_value(self) -> T\n    where\n        T: Packable,\n    {\n        let current_timestamp = self.context.timestamp();\n        let value_change = self.read_value_change();\n\n        value_change.get_current_at(current_timestamp)\n    }\n\n    pub fn get_current_delay(self) -> u64\n    where\n        T: Packable,\n    {\n        let current_timestamp = self.context.timestamp();\n        self.read_delay_change().get_current(current_timestamp)\n    }\n\n    pub fn get_scheduled_value(self) -> (T, u64)\n    where\n        T: Packable,\n    {\n        self.read_value_change().get_scheduled()\n    }\n\n    pub fn get_scheduled_delay(self) -> (u64, u64)\n    where\n        T: Packable,\n    {\n        self.read_delay_change().get_scheduled()\n    }\n\n    fn read_value_change(self) -> ScheduledValueChange<T>\n    where\n        T: Packable,\n    {\n        // We don't read ScheduledValueChange directly by having it implement Packable because ScheduledValueChange\n        // and ScheduledDelayChange are packed together (sdc and svc.timestamp_of_change are stored in the same slot).\n        let packed = self.context.storage_read(self.storage_slot);\n        unpack_value_change::<T, <T as Packable>::N>(packed)\n    }\n\n    fn read_delay_change(self) -> ScheduledDelayChange<InitialDelay>\n    where\n        T: Packable,\n    {\n        // Since all ScheduledDelayChange member are packed into a single field, we can read a single storage slot\n        // here and skip the ones that correspond to ScheduledValueChange members. We are abusing the fact that\n        // the field containing the ScheduledDelayChange data is the first one in the storage layout - otherwise we'd\n        // need to offset the storage slot to get the position where it'd land.\n        // We don't read ScheduledDelayChange directly by having it implement Packable because ScheduledValueChange\n        // and ScheduledDelayChange are packed together (sdc and svc.timestamp_of_change are stored in the same slot).\n        let packed = self.context.storage_read(self.storage_slot);\n        unpack_delay_change::<InitialDelay>(packed)\n    }\n\n    fn write(\n        self,\n        value_change: ScheduledValueChange<T>,\n        delay_change: ScheduledDelayChange<InitialDelay>,\n    )\n    where\n        T: Packable,\n    {\n        // Whenever we write to public storage, we write both the value change and delay change to storage at once.\n        // We do so by wrapping them in a single struct (`DelayedPublicMutableValues`). Then we wrap the resulting struct in\n        // `WithHash`.\n        // Wrapping in `WithHash` makes for more costly writes but it also makes private proofs much simpler because\n        // they only need to produce a historical proof for the hash, which results in a single inclusion proof (as\n        // opposed to 4 in the best case scenario in which T is a single field). Private delayed public mutable reads are\n        // assumed to be much more frequent than public writes, so this tradeoff makes sense.\n        let values = WithHash::new(DelayedPublicMutableValues::new(value_change, delay_change));\n\n        self.context.storage_write(self.storage_slot, values);\n    }\n}\n\nimpl<T, let InitialDelay: u64> DelayedPublicMutable<T, InitialDelay, &mut PrivateContext>\nwhere\n    T: Eq,\n{\n    pub fn get_current_value(self) -> T\n    where\n        T: Packable,\n    {\n        // When reading the current value in private we construct a historical state proof for the public value.\n        // However, since this value might change, we must constrain the maximum transaction timestamp as this proof\n        // will only be valid for the time we can ensure the value will not change, which will depend on the\n        // current delay and any scheduled delay changes.\n        let (value_change, delay_change, anchor_timestamp) = self.anchor_read_from_public_storage();\n\n        // We use the effective minimum delay as opposed to the current delay at the anchor block's timestamp as this\n        // one also takes into consideration any scheduled delay changes.\n        // For example, consider a scenario in which at timestamp `x` the current delay was 86400 seconds (1 day). We\n        // may naively think that the earliest we could change the value would be at timestamp `x + 86400` by\n        // scheduling immediately after the anchor block's timestamp, i.e. at timestamp `x + 1`. But if there was\n        // a delay change scheduled for timestamp `y` to reduce the delay to 43200 seconds (12 hours), then if a value\n        // change was scheduled at timestamp `y` it would go into effect at timestamp `y + 43200`, which is earlier\n        // than what we'd expect if we only considered the current delay.\n        let effective_minimum_delay = delay_change.get_effective_minimum_delay_at(anchor_timestamp);\n        let time_horizon = value_change.get_time_horizon(anchor_timestamp, effective_minimum_delay);\n\n        // We prevent this transaction from being included in any timestamp after the time horizon, ensuring that the\n        // historical public value matches the current one, since it can only change after the horizon.\n        self.context.set_include_by_timestamp(time_horizon);\n\n        value_change.get_current_at(anchor_timestamp)\n    }\n\n    fn anchor_read_from_public_storage(\n        self,\n    ) -> (ScheduledValueChange<T>, ScheduledDelayChange<InitialDelay>, u64)\n    where\n        T: Packable,\n    {\n        let header = self.context.get_anchor_block_header();\n        let address = self.context.this_address();\n\n        let anchor_timestamp = header.global_variables.timestamp;\n\n        let values: DelayedPublicMutableValues<T, InitialDelay> =\n            WithHash::historical_public_storage_read(header, address, self.storage_slot);\n\n        (values.svc, values.sdc, anchor_timestamp)\n    }\n}\n\nimpl<T, let InitialDelay: u64> DelayedPublicMutable<T, InitialDelay, UtilityContext>\nwhere\n    T: Eq,\n{\n    pub unconstrained fn get_current_value(self) -> T\n    where\n        T: Packable,\n    {\n        let dpmv: DelayedPublicMutableValues<T, InitialDelay> =\n            WithHash::utility_public_storage_read(self.context, self.storage_slot);\n\n        let current_timestamp = self.context.timestamp();\n        dpmv.svc.get_current_at(current_timestamp)\n    }\n}\n"
     },
-    "191": {
+    "192": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/state_vars/map.nr",
       "source": "use crate::state_vars::state_variable::StateVariable;\nuse dep::protocol_types::{storage::map::derive_storage_slot_in_map, traits::ToField};\n\n/// Map\n///\n/// A key-value storage container that maps keys to state variables, similar\n/// to Solidity mappings.\n///\n/// `Map` enables you to associate keys (like addresses or other identifiers)\n/// with state variables in your Aztec smart contract. This is conceptually\n/// similar to Solidity's `mapping(K => V)` syntax, where you can store and\n/// retrieve values by their associated keys.\n///\n/// You can declare a state variable contained within a Map in your contract's\n/// #[storage] struct.\n///\n/// For example, you might use\n/// `Map<AztecAddress, PublicMutable<FieldNote, Context>, Context>` to track\n/// token balances for different users, similar to how you'd use\n/// `mapping(address => uint256)` in Solidity.\n///\n/// > Aside: the verbose `Context` in the declaration is a consequence of\n/// > leveraging Noir's regular syntax for generics to ensure that certain\n/// > state variable methods can only be called in some contexts (private,\n/// > public, utility).\n///\n/// The methods of Map are:\n/// - `at` (access state variable for a given key)\n/// (see the method's own doc comments for more info).\n///\n/// ## Generic Parameters\n/// - `K`: The key type (must implement `ToField` trait for hashing)\n/// - `V`: The value type:\n///   - any Aztec state variable (variable that implements the StateVariable trait):\n///     - `PublicMutable`\n///     - `PublicImmutable`\n///     - `DelayedPublicMutable`\n///     - `Map`\n/// - `Context`: The execution context (handles private/public function\n///   contexts)\n///\n/// ## Usage\n/// Maps are typically declared in your contract's #[storage] struct and\n/// accessed\n/// using the `at(key)` method to get the state variable for a specific key.\n/// The resulting state variable can then be read from or written to using its\n/// own methods.\n///\n/// Note that maps cannot be used with owned state variables (variables that\n/// implement the OwnedStateVariable trait) - those need to be wrapped in an\n/// `Owned` state variable instead.\n///\n/// ## Advanced\n/// Internally, `Map` uses a single base storage slot to represent the\n/// mapping\n/// itself, similar to Solidity's approach. Individual key-value pairs are\n/// stored at derived storage slots computed by hashing the base storage\n/// slot\n/// with the key using Poseidon2. This ensures:\n/// - No storage slot collisions between different keys\n/// - Uniform distribution of storage slots across the storage space\n/// - Compatibility with Aztec's storage tree structure\n/// - Gas-efficient storage access patterns similar to Solidity mappings\n///\n/// The storage slot derivation uses `derive_storage_slot_in_map(base_slot,\n/// key)` which computes `poseidon2_hash([base_slot, key.to_field()])`,\n/// ensuring cryptographically secure slot separation.\n///\n/// docs:start:map\npub struct Map<K, V, Context> {\n    pub context: Context,\n    storage_slot: Field,\n}\n\n// Map reserves a single storage slot regardless of what it stores because\n// nothing is stored at said slot: it is only used to derive the storage slots\n// of nested state variables, which is expected to never result in collisions\n// or slots being close to one another due to these being hashes. This mirrors\n// the strategy adopted by Solidity mappings.\nimpl<K, V, Context> StateVariable<1, Context> for Map<K, V, Context> {\n    fn new(context: Context, storage_slot: Field) -> Self {\n        assert(storage_slot != 0, \"Storage slot 0 not allowed. Storage slots must start from 1.\");\n        Map { context, storage_slot }\n    }\n\n    fn get_storage_slot(self) -> Field {\n        self.storage_slot\n    }\n}\n\nimpl<K, V, Context> Map<K, V, Context> {\n    /// Returns the state variable associated with the given key.\n    ///\n    /// This is equivalent to accessing `mapping[key]` in Solidity. It returns\n    /// the state variable instance for the specified key, which can then be\n    /// used to read or write the value at that key.\n    ///\n    /// Unlike Solidity mappings which return the value directly, this returns\n    /// the state variable wrapper (like PublicMutable, nested Map etc.)\n    /// that you then call methods on to interact with the actual value.\n    ///\n    /// # Arguments\n    ///\n    /// * `key` - The key to look up in the map. Must implement the ToField\n    ///           trait (which most basic Noir & Aztec types do).\n    ///\n    /// # Returns\n    ///\n    /// * `V` - The state variable instance for this key. You can then call\n    ///         methods like `.read()`, `.write()`, `.get_note()`, etc. on this\n    ///         depending on the specific state variable type.\n    ///\n    /// # Example\n    ///\n    /// ```noir\n    /// // Get a user's balance (assuming PrivateMutable<FieldNote>)\n    /// let user_balance = self.storage.balances.at(user_address);\n    /// let current_note = user_balance.get_note();\n    ///\n    /// // Update the balance\n    /// user_balance.replace(new_note);\n    /// ```\n    ///\n    pub fn at<let N: u32>(self, key: K) -> V\n    where\n        K: ToField,\n        V: StateVariable<N, Context>,\n    {\n        V::new(\n            self.context,\n            derive_storage_slot_in_map(self.storage_slot, key),\n        )\n    }\n}\n"
     },
-    "224": {
+    "229": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/append.nr",
       "source": "/// Appends the elements of the second `BoundedVec` to the end of the first one. The resulting `BoundedVec` can have any arbitrary maximum length, but it must be\n/// large enough to fit all of the elements of both the first and second vectors.\npub fn append<T, let ALen: u32, let BLen: u32, let DstLen: u32>(\n    a: BoundedVec<T, ALen>,\n    b: BoundedVec<T, BLen>,\n) -> BoundedVec<T, DstLen> {\n    let mut dst = BoundedVec::new();\n\n    dst.extend_from_bounded_vec(a);\n    dst.extend_from_bounded_vec(b);\n\n    dst\n}\n\nmod test {\n    use super::append;\n\n    #[test]\n    unconstrained fn append_empty_vecs() {\n        let a: BoundedVec<_, 3> = BoundedVec::new();\n        let b: BoundedVec<_, 14> = BoundedVec::new();\n\n        let result: BoundedVec<Field, 5> = append(a, b);\n\n        assert_eq(result.len(), 0);\n        assert_eq(result.storage(), std::mem::zeroed());\n    }\n\n    #[test]\n    unconstrained fn append_non_empty_vecs() {\n        let a: BoundedVec<_, 3> = BoundedVec::from_array([1, 2, 3]);\n        let b: BoundedVec<_, 14> = BoundedVec::from_array([4, 5, 6]);\n\n        let result: BoundedVec<Field, 8> = append(a, b);\n\n        assert_eq(result.len(), 6);\n        assert_eq(result.storage(), [1, 2, 3, 4, 5, 6, std::mem::zeroed(), std::mem::zeroed()]);\n    }\n\n    #[test(should_fail_with = \"out of bounds\")]\n    unconstrained fn append_non_empty_vecs_insufficient_max_len() {\n        let a: BoundedVec<_, 3> = BoundedVec::from_array([1, 2, 3]);\n        let b: BoundedVec<_, 14> = BoundedVec::from_array([4, 5, 6]);\n\n        let _: BoundedVec<Field, 5> = append(a, b);\n    }\n}\n"
     },
-    "227": {
+    "232": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/subarray.nr",
       "source": "/// Returns `DstLen` elements from a source array, starting at `offset`. `DstLen` must not be larger than the number\n/// of elements past `offset`.\n///\n/// Examples:\n/// ```\n/// let foo: [Field; 2] = subarray([1, 2, 3, 4, 5], 2);\n/// assert_eq(foo, [3, 4]);\n///\n/// let bar: [Field; 5] = subarray([1, 2, 3, 4, 5], 2); // fails - we can't return 5 elements since only 3 remain\n/// ```\npub fn subarray<T, let SrcLen: u32, let DstLen: u32>(src: [T; SrcLen], offset: u32) -> [T; DstLen] {\n    assert(offset + DstLen <= SrcLen, \"DstLen too large for offset\");\n\n    let mut dst: [T; DstLen] = std::mem::zeroed();\n    for i in 0..DstLen {\n        dst[i] = src[i + offset];\n    }\n\n    dst\n}\n\nmod test {\n    use super::subarray;\n\n    #[test]\n    unconstrained fn subarray_into_empty() {\n        // In all of these cases we're setting DstLen to be 0, so we always get back an empty array.\n        assert_eq(subarray::<Field, _, _>([], 0), []);\n        assert_eq(subarray([1, 2, 3, 4, 5], 0), []);\n        assert_eq(subarray([1, 2, 3, 4, 5], 2), []);\n    }\n\n    #[test]\n    unconstrained fn subarray_complete() {\n        assert_eq(subarray::<Field, _, _>([], 0), []);\n        assert_eq(subarray([1, 2, 3, 4, 5], 0), [1, 2, 3, 4, 5]);\n    }\n\n    #[test]\n    unconstrained fn subarray_different_end_sizes() {\n        // We implicitly select how many values to read in the size of the return array\n        assert_eq(subarray([1, 2, 3, 4, 5], 1), [2, 3, 4, 5]);\n        assert_eq(subarray([1, 2, 3, 4, 5], 1), [2, 3, 4]);\n        assert_eq(subarray([1, 2, 3, 4, 5], 1), [2, 3]);\n        assert_eq(subarray([1, 2, 3, 4, 5], 1), [2]);\n    }\n\n    #[test(should_fail_with = \"DstLen too large for offset\")]\n    unconstrained fn subarray_offset_too_large() {\n        // With an offset of 1 we can only request up to 4 elements\n        let _: [_; 5] = subarray([1, 2, 3, 4, 5], 1);\n    }\n\n    #[test(should_fail)]\n    unconstrained fn subarray_bad_return_value() {\n        assert_eq(subarray([1, 2, 3, 4, 5], 1), [3, 3, 4, 5]);\n    }\n}\n"
     },
-    "228": {
+    "233": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/subbvec.nr",
       "source": "use crate::utils::array;\n\n/// Returns `DstMaxLen` elements from a source BoundedVec, starting at `offset`. `offset` must not be larger than the\n/// original length, and `DstLen` must not be larger than the total number of elements past `offset` (including the\n/// zeroed elements past `len()`).\n///\n/// Only elements at the beginning of the vector can be removed: it is not possible to also remove elements at the end\n/// of the vector by passing a value for `DstLen` that is smaller than `len() - offset`.\n///\n/// Examples:\n/// ```\n/// let foo = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n/// assert_eq(subbvec(foo, 2), BoundedVec::<_, 8>::from_array([3, 4, 5]));\n///\n/// let bar: BoundedVec<_, 1> = subbvec(foo, 2); // fails - we can't return just 1 element since 3 remain\n/// let baz: BoundedVec<_, 10> = subbvec(foo, 3); // fails - we can't return 10 elements since only 7 remain\n/// ```\npub fn subbvec<T, let SrcMaxLen: u32, let DstMaxLen: u32>(\n    bvec: BoundedVec<T, SrcMaxLen>,\n    offset: u32,\n) -> BoundedVec<T, DstMaxLen> {\n    // from_parts_unchecked does not verify that the elements past len are zeroed, but that is not an issue in our case\n    // because we're constructing the new storage array as a subarray of the original one (which should have zeroed\n    // storage past len), guaranteeing correctness. This is because `subarray` does not allow extending arrays past\n    // their original length.\n    BoundedVec::from_parts_unchecked(array::subarray(bvec.storage(), offset), bvec.len() - offset)\n}\n\nmod test {\n    use super::subbvec;\n\n    #[test]\n    unconstrained fn subbvec_empty() {\n        let bvec = BoundedVec::<Field, 0>::from_array([]);\n        assert_eq(subbvec(bvec, 0), bvec);\n    }\n\n    #[test]\n    unconstrained fn subbvec_complete() {\n        let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n        assert_eq(subbvec(bvec, 0), bvec);\n\n        let smaller_capacity = BoundedVec::<_, 5>::from_array([1, 2, 3, 4, 5]);\n        assert_eq(subbvec(bvec, 0), smaller_capacity);\n    }\n\n    #[test]\n    unconstrained fn subbvec_partial() {\n        let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n        assert_eq(subbvec(bvec, 2), BoundedVec::<_, 8>::from_array([3, 4, 5]));\n        assert_eq(subbvec(bvec, 2), BoundedVec::<_, 3>::from_array([3, 4, 5]));\n    }\n\n    #[test]\n    unconstrained fn subbvec_into_empty() {\n        let bvec: BoundedVec<_, 10> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n        assert_eq(subbvec(bvec, 5), BoundedVec::<_, 5>::from_array([]));\n    }\n\n    #[test(should_fail)]\n    unconstrained fn subbvec_offset_past_len() {\n        let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n        let _: BoundedVec<_, 1> = subbvec(bvec, 6);\n    }\n\n    #[test(should_fail)]\n    unconstrained fn subbvec_insufficient_dst_len() {\n        let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n        // We're not providing enough space to hold all of the items inside the original BoundedVec. subbvec can cause\n        // for the capacity to reduce, but not the length (other than by len - offset).\n        let _: BoundedVec<_, 1> = subbvec(bvec, 2);\n    }\n\n    #[test(should_fail_with = \"DstLen too large for offset\")]\n    unconstrained fn subbvec_dst_len_causes_enlarge() {\n        let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n        // subbvec does not supprt capacity increases\n        let _: BoundedVec<_, 11> = subbvec(bvec, 0);\n    }\n\n    #[test(should_fail_with = \"DstLen too large for offset\")]\n    unconstrained fn subbvec_dst_len_too_large_for_offset() {\n        let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n        // This effectively requests a capacity increase, since there'd be just one element plus the 5 empty slots,\n        // which is less than 7.\n        let _: BoundedVec<_, 7> = subbvec(bvec, 4);\n    }\n}\n"
     },
-    "230": {
+    "235": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/conversion/bytes_to_fields.nr",
       "source": "use std::static_assert;\n\n// These functions are used to facilitate the conversion of log ciphertext between byte and field representations.\n//\n// `bytes_to_fields` uses fixed-size arrays since encryption contexts have compile-time size information.\n// `bytes_from_fields` uses BoundedVec for flexibility in unconstrained contexts where sizes are dynamic.\n//\n// Together they provide bidirectional conversion between bytes and fields when processing encrypted logs.\n\n/// Converts the input bytes into an array of fields. A Field is ~254 bits meaning that each field can store 31 whole\n/// bytes. Use `bytes_from_fields` to obtain the original bytes array.\n///\n/// The input bytes are chunked into chunks of 31 bytes. Each 31-byte chunk is viewed as big-endian, and is converted\n/// into a Field.\n/// For example, [1, 10, 3, ..., 0] (31 bytes) is encoded as [1 * 256^30 + 10 * 256^29 + 3 * 256^28 + ... + 0]\n/// Note: N must be a multiple of 31 bytes\npub fn bytes_to_fields<let N: u32>(bytes: [u8; N]) -> [Field; N / 31] {\n    // Assert that N is a multiple of 31\n    static_assert(N % 31 == 0, \"N must be a multiple of 31\");\n\n    let mut fields = [0; N / 31];\n\n    // Since N is a multiple of 31, we can simply process all chunks fully\n    for i in 0..N / 31 {\n        let mut field = 0;\n        for j in 0..31 {\n            // Shift the existing value left by 8 bits and add the new byte\n            field = field * 256 + bytes[i * 31 + j] as Field;\n        }\n        fields[i] = field;\n    }\n\n    fields\n}\n\n/// Converts an input BoundedVec of fields into a BoundedVec of bytes in big-endian order. Arbitrary Field arrays\n/// are not allowed: this is assumed to be an array obtained via `bytes_to_fields`, i.e. one that actually represents\n/// bytes. To convert a Field array into bytes, use `fields_to_bytes`.\n///\n/// Each input field must contain at most 31 bytes (this is constrained to be so).\n/// Each field is converted into 31 big-endian bytes, and the resulting 31-byte chunks are concatenated\n/// back together in the order of the original fields.\npub fn bytes_from_fields<let N: u32>(fields: BoundedVec<Field, N>) -> BoundedVec<u8, N * 31> {\n    let mut bytes = BoundedVec::new();\n\n    for i in 0..fields.len() {\n        let field = fields.get(i);\n\n        // We expect that the field contains at most 31 bytes of information.\n        field.assert_max_bit_size::<248>();\n\n        // Now we can safely convert the field to 31 bytes.\n        let field_as_bytes: [u8; 31] = field.to_be_bytes();\n\n        for j in 0..31 {\n            bytes.push(field_as_bytes[j]);\n        }\n    }\n\n    bytes\n}\n\nmod tests {\n    use crate::utils::array::subarray;\n    use super::{bytes_from_fields, bytes_to_fields};\n\n    #[test]\n    unconstrained fn random_bytes_to_fields_and_back(input: [u8; 93]) {\n        let fields = bytes_to_fields(input);\n\n        // At this point in production, the log flies through the system and we get a BoundedVec on the other end.\n        // So we need to convert the field array to a BoundedVec to be able to feed it to the `bytes_from_fields`\n        // function.\n        let fields_as_bounded_vec = BoundedVec::<_, 6>::from_array(fields);\n\n        let bytes_back = bytes_from_fields(fields_as_bounded_vec);\n\n        // Compare the original input with the round-tripped result\n        assert_eq(bytes_back.len(), input.len());\n        assert_eq(subarray(bytes_back.storage(), 0), input);\n    }\n\n    #[test(should_fail_with = \"N must be a multiple of 31\")]\n    unconstrained fn bytes_to_fields_input_length_not_multiple_of_31() {\n        // Try to convert 32 bytes (not a multiple of 31) to fields\n        let _fields = bytes_to_fields([0; 32]);\n    }\n\n}\n"
     },
-    "231": {
+    "236": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/conversion/fields_to_bytes.nr",
       "source": "// These functions are used to facilitate the conversion of log plaintext represented as fields into bytes and back.\n//\n// `fields_to_bytes` uses fixed-size arrays since encryption contexts have compile-time size information.\n// `fields_from_bytes` uses BoundedVec for flexibility in unconstrained contexts where sizes are dynamic.\n//\n// Together they provide bidirectional conversion between fields and bytes.\n\n/// Converts an input array of fields into a single array of bytes. Use `fields_from_bytes` to obtain the original\n/// field array.\n/// Each field is converted to a 32-byte big-endian array.\n///\n/// For example, if you have a field array [123, 456], it will be converted to a 64-byte array:\n/// [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,123,  // First field (32 bytes)\n///  0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,200]  // Second field (32 bytes)\n///\n/// Since a field is ~254 bits, you'll end up with a subtle 2-bit \"gap\" at the big end, every 32 bytes. Be careful\n/// that such a gap doesn't leak information! This could happen if you for example expected the output to be\n/// indistinguishable from random bytes.\npub fn fields_to_bytes<let N: u32>(fields: [Field; N]) -> [u8; 32 * N] {\n    let mut bytes = [0; 32 * N];\n\n    for i in 0..N {\n        let field_as_bytes: [u8; 32] = fields[i].to_be_bytes();\n\n        for j in 0..32 {\n            bytes[i * 32 + j] = field_as_bytes[j];\n        }\n    }\n\n    bytes\n}\n\n/// Converts an input BoundedVec of bytes into a BoundedVec of fields. Arbitrary byte arrays are not allowed: this\n/// is assumed to be an array obtained via `fields_to_bytes`, i.e. one that actually represents fields. To convert\n/// a byte array into Fields, use `bytes_to_fields`.\n///\n/// The input bytes are chunked into chunks of 32 bytes. Each 32-byte chunk is viewed as big-endian, and is converted\n/// into a Field.\n/// For example, [1, 10, 3, ..., 0] (32 bytes) is encoded as [1 * 256^31 + 10 * 256^30 + 3 * 256^29 + ... + 0]\n/// Note 1: N must be a multiple of 32 bytes\n/// Note 2: The max value check code was taken from std::field::to_be_bytes function.\npub fn fields_from_bytes<let N: u32>(bytes: BoundedVec<u8, N>) -> BoundedVec<Field, N / 32> {\n    // Assert that input length is a multiple of 32\n    assert(bytes.len() % 32 == 0, \"Input length must be a multiple of 32\");\n\n    let mut fields = BoundedVec::new();\n\n    let p = std::field::modulus_be_bytes();\n\n    // Since input length is a multiple of 32, we can simply process all chunks fully\n    for i in 0..bytes.len() / 32 {\n        let mut field = 0;\n\n        // Process each byte in the 32-byte chunk\n        let mut ok = false;\n\n        for j in 0..32 {\n            let next_byte = bytes.get(i * 32 + j);\n            field = field * 256 + next_byte as Field;\n\n            if !ok {\n                if next_byte != p[j] {\n                    assert(next_byte < p[j], \"Value does not fit in field\");\n                    ok = true;\n                }\n            }\n        }\n        assert(ok, \"Value does not fit in field\");\n\n        fields.push(field);\n    }\n\n    fields\n}\n\nmod tests {\n    use crate::utils::array::subarray;\n    use super::{fields_from_bytes, fields_to_bytes};\n\n    #[test]\n    unconstrained fn random_fields_to_bytes_and_back(input: [Field; 3]) {\n        // Convert to bytes\n        let bytes = fields_to_bytes(input);\n\n        // At this point in production, the log flies through the system and we get a BoundedVec on the other end.\n        // So we need to convert the field array to a BoundedVec to be able to feed it to the `fields_from_bytes`\n        // function.\n        // 113 is an arbitrary max length that is larger than the input length of 96.\n        let bytes_as_bounded_vec = BoundedVec::<_, 113>::from_array(bytes);\n\n        // Convert back to fields\n        let fields_back = fields_from_bytes(bytes_as_bounded_vec);\n\n        // Compare the original input with the round-tripped result\n        assert_eq(fields_back.len(), input.len());\n        assert_eq(subarray(fields_back.storage(), 0), input);\n    }\n\n    #[test(should_fail_with = \"Input length must be a multiple of 32\")]\n    unconstrained fn to_fields_assert() {\n        // 143 is an arbitrary max length that is larger than 33\n        let input = BoundedVec::<_, 143>::from_array([\n            1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n            25, 26, 27, 28, 29, 30, 31, 32, 33,\n        ]);\n\n        // This should fail since 33 is not a multiple of 32\n        let _fields = fields_from_bytes(input);\n    }\n\n    #[test]\n    unconstrained fn fields_from_bytes_max_value() {\n        let max_field_as_bytes: [u8; 32] = (-1).to_be_bytes();\n        let input = BoundedVec::<_, 32>::from_array(max_field_as_bytes);\n\n        let fields = fields_from_bytes(input);\n\n        // The result should be a largest value storable in a field (-1 since we are modulo-ing)\n        assert_eq(fields.get(0), -1);\n    }\n\n    // In this test we verify that overflow check works by taking the max allowed value, bumping a random byte\n    // and then feeding it to `fields_from_bytes` as input.\n    #[test(should_fail_with = \"Value does not fit in field\")]\n    unconstrained fn fields_from_bytes_overflow(random_value: u8) {\n        let index_of_byte_to_bump = random_value % 32;\n\n        // Obtain the byte representation of the maximum field value\n        let max_field_value_as_bytes: [u8; 32] = (-1).to_be_bytes();\n\n        let byte_to_bump = max_field_value_as_bytes[index_of_byte_to_bump as u32];\n\n        // Skip test execution if the selected byte is already at maximum value (255).\n        // This is acceptable since we are using fuzz testing to generate many test cases.\n        if byte_to_bump != 255 {\n            let mut input = BoundedVec::<_, 32>::from_array(max_field_value_as_bytes);\n\n            // Increment the selected byte to exceed the field's maximum value\n            input.set(index_of_byte_to_bump as u32, byte_to_bump + 1);\n\n            // Attempt the conversion, which should fail due to the value exceeding the field's capacity\n            let _fields = fields_from_bytes(input);\n        }\n    }\n\n}\n"
     },
-    "234": {
+    "239": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/point.nr",
       "source": "use protocol_types::{point::Point, utils::field::sqrt};\n\n// I am storing the modulus minus 1 divided by 2 here because full modulus would throw \"String literal too large\" error\n// Full modulus is 21888242871839275222246405745257275088548364400416034343698204186575808495617\nglobal BN254_FR_MODULUS_DIV_2: Field =\n    10944121435919637611123202872628637544274182200208017171849102093287904247808;\n\n/// Converts a point to a byte array.\n///\n/// We don't serialize the point at infinity flag because this function is used in situations where we do not want\n/// to waste the extra byte (encrypted log).\npub fn point_to_bytes(p: Point) -> [u8; 32] {\n    // Note that there is 1 more free bit in the 32 bytes (254 bits currently occupied by the x coordinate, 1 bit for\n    // the \"sign\") so it's possible to use that last bit as an \"is_infinite\" flag if desired in the future.\n    assert(!p.is_infinite, \"Cannot serialize point at infinity as bytes.\");\n\n    let mut result: [u8; 32] = p.x.to_be_bytes();\n\n    if get_sign_of_point(p) {\n        // y is <= (modulus - 1) / 2 so we set the sign bit to 1\n        // Here we leverage that field fits into 254 bits (log2(Fr.MODULUS) < 254) and given that we serialize Fr to 32\n        // bytes and we use big-endian the 2 most significant bits are never populated. Hence we can use one of\n        // the bits as a sign bit.\n        result[0] += 128;\n    }\n\n    result\n}\n\n/**\n * Returns: true if p.y <= MOD_DIV_2, else false.\n */\npub fn get_sign_of_point(p: Point) -> bool {\n    // We store only a \"sign\" of the y coordinate because the rest can be derived from the x coordinate. To get\n    // the sign we check if the y coordinate is less or equal than the curve's order minus 1 divided by 2.\n    // Ideally we'd do `y <= MOD_DIV_2`, but there's no `lte` function, so instead we do `!(y > MOD_DIV_2)`, which is\n    // equivalent, and then rewrite that as `!(MOD_DIV_2 < y)`, since we also have no `gt` function.\n    !BN254_FR_MODULUS_DIV_2.lt(p.y)\n}\n\n/// Returns a `Point` in the Grumpkin curve given its x coordinate.\n///\n/// Because not all values in the field are valid x coordinates of points in the curve (i.e. there\n/// is no corresponding y value in the field that satisfies the curve equation), it may not be\n/// possible to reconstruct a `Point`. `Option::none()` is returned in such cases.\npub fn point_from_x_coord(x: Field) -> Option<Point> {\n    // y ^ 2 = x ^ 3 - 17\n    let rhs = x * x * x - 17;\n    sqrt(rhs).map(|y| Point { x, y, is_infinite: false })\n}\n\n/// Returns a `Point` in the Grumpkin curve given its x coordinate and sign for the y coordinate.\n///\n/// Because not all values in the field are valid x coordinates of points in the curve (i.e. there\n/// is no corresponding y value in the field that satisfies the curve equation), it may not be\n/// possible to reconstruct a `Point`. `Option::none()` is returned in such cases.\n///\n/// @param x - The x coordinate of the point\n/// @param sign - The \"sign\" of the y coordinate - determines whether y <= (Fr.MODULUS - 1) / 2\npub fn point_from_x_coord_and_sign(x: Field, sign: bool) -> Option<Point> {\n    // y ^ 2 = x ^ 3 - 17\n    let rhs = x * x * x - 17;\n\n    sqrt(rhs).map(|y| {\n        // If there is a square root, we need to ensure it has the correct \"sign\"\n        let y_is_positive = !BN254_FR_MODULUS_DIV_2.lt(y);\n        let final_y = if y_is_positive == sign { y } else { -y };\n        Point { x, y: final_y, is_infinite: false }\n    })\n}\n\nmod test {\n    use crate::utils::point::{point_from_x_coord, point_from_x_coord_and_sign, point_to_bytes};\n    use dep::protocol_types::point::Point;\n    use dep::protocol_types::utils::field::pow;\n\n    #[test]\n    unconstrained fn test_point_to_bytes_positive_sign() {\n        let p = Point {\n            x: 0x1af41f5de96446dc3776a1eb2d98bb956b7acd9979a67854bec6fa7c2973bd73,\n            y: 0x07fc22c7f2c7057571f137fe46ea9c95114282bc95d37d71ec4bfb88de457d4a,\n            is_infinite: false,\n        };\n\n        let compressed_point = point_to_bytes(p);\n\n        let expected_compressed_point_positive_sign = [\n            154, 244, 31, 93, 233, 100, 70, 220, 55, 118, 161, 235, 45, 152, 187, 149, 107, 122,\n            205, 153, 121, 166, 120, 84, 190, 198, 250, 124, 41, 115, 189, 115,\n        ];\n        assert_eq(expected_compressed_point_positive_sign, compressed_point);\n    }\n\n    #[test]\n    unconstrained fn test_point_to_bytes_negative_sign() {\n        let p = Point {\n            x: 0x247371652e55dd74c9af8dbe9fb44931ba29a9229994384bd7077796c14ee2b5,\n            y: 0x26441aec112e1ae4cee374f42556932001507ad46e255ffb27369c7e3766e5c0,\n            is_infinite: false,\n        };\n\n        let compressed_point = point_to_bytes(p);\n\n        let expected_compressed_point_negative_sign = [\n            36, 115, 113, 101, 46, 85, 221, 116, 201, 175, 141, 190, 159, 180, 73, 49, 186, 41, 169,\n            34, 153, 148, 56, 75, 215, 7, 119, 150, 193, 78, 226, 181,\n        ];\n\n        assert_eq(expected_compressed_point_negative_sign, compressed_point);\n    }\n\n    #[test]\n    unconstrained fn test_point_from_x_coord_and_sign() {\n        // Test positive y coordinate\n        let x = 0x1af41f5de96446dc3776a1eb2d98bb956b7acd9979a67854bec6fa7c2973bd73;\n        let sign = true;\n        let p = point_from_x_coord_and_sign(x, sign).unwrap();\n\n        assert_eq(p.x, x);\n        assert_eq(p.y, 0x07fc22c7f2c7057571f137fe46ea9c95114282bc95d37d71ec4bfb88de457d4a);\n        assert_eq(p.is_infinite, false);\n\n        // Test negative y coordinate\n        let x2 = 0x247371652e55dd74c9af8dbe9fb44931ba29a9229994384bd7077796c14ee2b5;\n        let sign2 = false;\n        let p2 = point_from_x_coord_and_sign(x2, sign2).unwrap();\n\n        assert_eq(p2.x, x2);\n        assert_eq(p2.y, 0x26441aec112e1ae4cee374f42556932001507ad46e255ffb27369c7e3766e5c0);\n        assert_eq(p2.is_infinite, false);\n    }\n\n    #[test]\n    unconstrained fn test_point_from_x_coord_valid() {\n        // x = 8 is a known quadratic residue - should give a valid point\n        let result = point_from_x_coord(Field::from(8));\n        assert(result.is_some());\n\n        let point = result.unwrap();\n        assert_eq(point.x, Field::from(8));\n        // Check curve equation y^2 = x^3 - 17\n        assert_eq(pow(point.y, 2), pow(point.x, 3) - 17);\n    }\n\n    #[test]\n    unconstrained fn test_point_from_x_coord_invalid() {\n        // x = 3 is a non-residue for this curve - should give None\n        let x = Field::from(3);\n        let maybe_point = point_from_x_coord(x);\n        assert(maybe_point.is_none());\n    }\n\n}\n"
     },
-    "238": {
+    "243": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/with_hash.nr",
       "source": "use crate::{\n    context::{PublicContext, UtilityContext},\n    history::public_storage::PublicStorageHistoricalRead,\n    oracle,\n};\nuse dep::protocol_types::{\n    abis::block_header::BlockHeader, address::AztecAddress, hash::poseidon2_hash, traits::Packable,\n};\n\n/// A struct that allows for efficient reading of value `T` from public storage in private.\n///\n/// The efficient reads are achieved by verifying large values through a single hash check\n/// and then proving inclusion only of the hash in public storage. This reduces the number\n/// of required tree inclusion proofs from `M` to 1.\n///\n/// # Type Parameters\n/// - `T`: The underlying type being wrapped, must implement `Packable<N>`\n/// - `M`: The number of field elements required to pack values of type `T`\npub struct WithHash<T, let M: u32> {\n    value: T,\n    packed: [Field; M],\n    hash: Field,\n}\n\nimpl<T, let M: u32> WithHash<T, M>\nwhere\n    T: Packable<N = M> + Eq,\n{\n    pub fn new(value: T) -> Self {\n        let packed = value.pack();\n        Self { value, packed, hash: poseidon2_hash(packed) }\n    }\n\n    pub fn get_value(self) -> T {\n        self.value\n    }\n\n    pub fn get_hash(self) -> Field {\n        self.hash\n    }\n\n    pub fn public_storage_read(context: PublicContext, storage_slot: Field) -> T {\n        context.storage_read(storage_slot)\n    }\n\n    pub unconstrained fn utility_public_storage_read(\n        context: UtilityContext,\n        storage_slot: Field,\n    ) -> T {\n        context.storage_read(storage_slot)\n    }\n\n    pub fn historical_public_storage_read(\n        header: BlockHeader,\n        address: AztecAddress,\n        storage_slot: Field,\n    ) -> T {\n        let historical_block_number = header.global_variables.block_number;\n\n        // We could simply produce historical inclusion proofs for each field in `packed`, but that would require one\n        // full sibling path per storage slot (since due to kernel siloing the storage is not contiguous). Instead, we\n        // get an oracle to provide us the values, and instead we prove inclusion of their hash, which is both a much\n        // smaller proof (a single slot), and also independent of the size of T (except in that we need to pack and hash T).\n        let hint = WithHash::new(\n            // Safety: We verify that a hash of the hint/packed data matches the stored hash.\n            unsafe {\n                oracle::storage::storage_read(address, storage_slot, historical_block_number)\n            },\n        );\n\n        let hash = header.public_storage_historical_read(storage_slot + M as Field, address);\n\n        if hash != 0 {\n            assert_eq(hash, hint.get_hash(), \"Hint values do not match hash\");\n        } else {\n            // The hash slot can only hold a zero if it is uninitialized. Therefore, the hints must then be zero\n            // (i.e. the default value for public storage) as well.\n            assert_eq(\n                hint.get_value(),\n                T::unpack(std::mem::zeroed()),\n                \"Non-zero hint for zero hash\",\n            );\n        };\n\n        hint.get_value()\n    }\n}\n\n// Note: I don't derive Packable on `WithHash` because `derive_serialize` function does not support setting \"N = M\"\n// as I do here 3 lines below. This could be worked around by placing the \"where\" clause directly on the `WithHash`\n// struct, but Jake mentioned that the syntax is not expected to be supported at least until Noir 1.0.\n// Relevant discussion on Slack:\n// https://aztecprotocol.slack.com/archives/C04QF64EDNV/p1752593876160699?thread_ts=1752589887.955379&cid=C04QF64EDNV\nimpl<T, let M: u32> Packable for WithHash<T, M>\nwhere\n    T: Packable<N = M>,\n{\n    let N: u32 = M + 1;\n\n    fn pack(self) -> [Field; Self::N] {\n        let mut result: [Field; Self::N] = std::mem::zeroed();\n        for i in 0..M {\n            result[i] = self.packed[i];\n        }\n        result[M] = self.hash;\n\n        result\n    }\n\n    fn unpack(packed: [Field; Self::N]) -> Self {\n        let mut value_packed = [0; M];\n        for i in 0..M {\n            value_packed[i] = packed[i];\n        }\n        let hash = packed[M];\n\n        Self { value: T::unpack(value_packed), packed: value_packed, hash }\n    }\n}\n\nmod test {\n    use crate::{\n        test::{helpers::test_environment::TestEnvironment, mocks::mock_struct::MockStruct},\n        utils::with_hash::WithHash,\n    };\n    use dep::protocol_types::hash::poseidon2_hash;\n    use dep::protocol_types::traits::{Packable, ToField};\n    use dep::std::test::OracleMock;\n\n    global STORAGE_SLOT: Field = 47;\n\n    #[test]\n    unconstrained fn create_and_recover() {\n        let value = MockStruct { a: 5, b: 3 };\n        let value_with_hash = WithHash::new(value);\n        let recovered = WithHash::unpack(value_with_hash.pack());\n\n        assert_eq(recovered.value, value);\n        assert_eq(recovered.packed, value.pack());\n        assert_eq(recovered.hash, poseidon2_hash(value.pack()));\n    }\n\n    #[test]\n    unconstrained fn read_uninitialized_value() {\n        let env = TestEnvironment::new();\n\n        env.private_context(|context| {\n            let result = WithHash::<MockStruct, _>::historical_public_storage_read(\n                context.anchor_block_header,\n                context.this_address(),\n                STORAGE_SLOT,\n            );\n\n            assert_eq(result, std::mem::zeroed());\n        });\n    }\n\n    #[test]\n    unconstrained fn read_initialized_value() {\n        let env = TestEnvironment::new();\n\n        let value = MockStruct { a: 5, b: 3 };\n        let value_with_hash = WithHash::new(value);\n\n        env.public_context(|context| { context.storage_write(STORAGE_SLOT, value_with_hash); });\n\n        env.private_context(|context| {\n            let result = WithHash::<MockStruct, _>::historical_public_storage_read(\n                context.anchor_block_header,\n                context.this_address(),\n                STORAGE_SLOT,\n            );\n            assert_eq(result, value);\n        });\n    }\n\n    #[test(should_fail_with = \"Non-zero hint for zero hash\")]\n    unconstrained fn bad_hint_uninitialized_value() {\n        let env = TestEnvironment::new();\n\n        env.private_context(|context| {\n            let block_header = context.anchor_block_header;\n            let address = context.this_address();\n\n            // Mock the oracle to return a non-zero hint/packed value\n            let value_packed = MockStruct { a: 1, b: 1 }.pack();\n            let _ = OracleMock::mock(\"utilityStorageRead\")\n                .with_params((\n                    address.to_field(), STORAGE_SLOT, block_header.global_variables.block_number,\n                    value_packed.len(),\n                ))\n                .returns(value_packed)\n                .times(1);\n\n            // This should fail because the hint value is non-zero and the hash is zero (default value of storage)\n            let _ = WithHash::<MockStruct, _>::historical_public_storage_read(\n                block_header,\n                address,\n                STORAGE_SLOT,\n            );\n        });\n    }\n\n    #[test(should_fail_with = \"Hint values do not match hash\")]\n    unconstrained fn bad_hint_initialized_value() {\n        let env = TestEnvironment::new();\n\n        env.public_context(|context| {\n            // Write the value and hash separately so that the hash is wrong\n            let value = MockStruct { a: 5, b: 3 };\n            context.storage_write(STORAGE_SLOT, value);\n\n            let incorrect_hash = 13;\n            let hash_storage_slot = STORAGE_SLOT + (value.pack().len() as Field);\n            context.storage_write(hash_storage_slot, [incorrect_hash]);\n        });\n\n        env.private_context(|context| {\n            let _ = WithHash::<MockStruct, _>::historical_public_storage_read(\n                context.anchor_block_header,\n                context.this_address(),\n                STORAGE_SLOT,\n            );\n        });\n    }\n}\n"
     },
-    "245": {
+    "250": {
       "path": "/home/aztec-dev/nargo/github.com/noir-lang/poseidon/v0.1.1/src/poseidon2.nr",
       "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"
     },
-    "287": {
+    "292": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/abis/private_log.nr",
       "source": "use crate::{\n    abis::log::Log,\n    constants::PRIVATE_LOG_SIZE_IN_FIELDS,\n    side_effect::{Counted, Scoped},\n    traits::{Deserialize, Empty, Serialize},\n};\nuse std::meta::derive;\n\npub type PrivateLog = Log<PRIVATE_LOG_SIZE_IN_FIELDS>;\n\n#[derive(Eq, Deserialize, Serialize)]\npub struct PrivateLogData {\n    pub log: Log<PRIVATE_LOG_SIZE_IN_FIELDS>,\n    // The counter of the note hash this log is for. 0 if it does not link to a note hash.\n    pub note_hash_counter: u32,\n}\n\nimpl Empty for PrivateLogData {\n    fn empty() -> Self {\n        PrivateLogData { log: PrivateLog::empty(), note_hash_counter: 0 }\n    }\n}\n\nimpl PrivateLogData {\n    pub fn count(self, counter: u32) -> Counted<Self> {\n        Counted::new(self, counter)\n    }\n}\n\nimpl Scoped<Counted<PrivateLogData>> {\n    pub fn expose_to_public(self) -> PrivateLog {\n        self.innermost().log\n    }\n}\n"
     },
@@ -3493,79 +3497,79 @@
       "path": "std/array/mod.nr",
       "source": "use crate::cmp::{Eq, Ord};\nuse crate::convert::From;\nuse crate::runtime::is_unconstrained;\n\nmod check_shuffle;\nmod quicksort;\n\nimpl<T, let N: u32> [T; N] {\n    /// Returns the length of this array.\n    ///\n    /// ```noir\n    /// fn len(self) -> Field\n    /// ```\n    ///\n    /// example\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let array = [42, 42];\n    ///     assert(array.len() == 2);\n    /// }\n    /// ```\n    #[builtin(array_len)]\n    pub fn len(self) -> u32 {}\n\n    /// Returns this array as a slice.\n    ///\n    /// ```noir\n    /// let array = [1, 2];\n    /// let slice = array.as_slice();\n    /// assert_eq(slice, &[1, 2]);\n    /// ```\n    #[builtin(as_slice)]\n    pub fn as_slice(self) -> [T] {}\n\n    /// Applies a function to each element of this array, returning a new array containing the mapped elements.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// let a = [1, 2, 3];\n    /// let b = a.map(|a| a * 2);\n    /// assert_eq(b, [2, 4, 6]);\n    /// ```\n    pub fn map<U, Env>(self, f: fn[Env](T) -> U) -> [U; N] {\n        let uninitialized = crate::mem::zeroed();\n        let mut ret = [uninitialized; N];\n\n        for i in 0..self.len() {\n            ret[i] = f(self[i]);\n        }\n\n        ret\n    }\n\n    /// Applies a function to each element of this array along with its index,\n    /// returning a new array containing the mapped elements.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// let a = [1, 2, 3];\n    /// let b = a.mapi(|i, a| i + a * 2);\n    /// assert_eq(b, [2, 5, 8]);\n    /// ```\n    pub fn mapi<U, Env>(self, f: fn[Env](u32, T) -> U) -> [U; N] {\n        let uninitialized = crate::mem::zeroed();\n        let mut ret = [uninitialized; N];\n\n        for i in 0..self.len() {\n            ret[i] = f(i, self[i]);\n        }\n\n        ret\n    }\n\n    /// Applies a function to each element of this array.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// let a = [1, 2, 3];\n    /// let mut b = [0; 3];\n    /// let mut i = 0;\n    /// a.for_each(|x| {\n    ///     b[i] = x;\n    ///     i += 1;\n    /// });\n    /// assert_eq(a, b);\n    /// ```\n    pub fn for_each<Env>(self, f: fn[Env](T) -> ()) {\n        for i in 0..self.len() {\n            f(self[i]);\n        }\n    }\n\n    /// Applies a function to each element of this array along with its index.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// let a = [1, 2, 3];\n    /// let mut b = [0; 3];\n    /// a.for_eachi(|i, x| {\n    ///     b[i] = x;\n    /// });\n    /// assert_eq(a, b);\n    /// ```\n    pub fn for_eachi<Env>(self, f: fn[Env](u32, T) -> ()) {\n        for i in 0..self.len() {\n            f(i, self[i]);\n        }\n    }\n\n    /// Applies a function to each element of the array, returning the final accumulated value. The first\n    /// parameter is the initial value.\n    ///\n    /// This is a left fold, so the given function will be applied to the accumulator and first element of\n    /// the array, then the second, and so on. For a given call the expected result would be equivalent to:\n    ///\n    /// ```rust\n    /// let a1 = [1];\n    /// let a2 = [1, 2];\n    /// let a3 = [1, 2, 3];\n    ///\n    /// let f = |a, b| a - b;\n    /// a1.fold(10, f); //=> f(10, 1)\n    /// a2.fold(10, f); //=> f(f(10, 1), 2)\n    /// a3.fold(10, f); //=> f(f(f(10, 1), 2), 3)\n    ///\n    /// assert_eq(a3.fold(10, f), 10 - 1 - 2 - 3);\n    /// ```\n    pub fn fold<U, Env>(self, mut accumulator: U, f: fn[Env](U, T) -> U) -> U {\n        for elem in self {\n            accumulator = f(accumulator, elem);\n        }\n        accumulator\n    }\n\n    /// Same as fold, but uses the first element as the starting element.\n    ///\n    /// Requires the input array to be non-empty.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let arr = [1, 2, 3, 4];\n    ///     let reduced = arr.reduce(|a, b| a + b);\n    ///     assert(reduced == 10);\n    /// }\n    /// ```\n    pub fn reduce<Env>(self, f: fn[Env](T, T) -> T) -> T {\n        let mut accumulator = self[0];\n        for i in 1..self.len() {\n            accumulator = f(accumulator, self[i]);\n        }\n        accumulator\n    }\n\n    /// Returns true if all the elements in this array satisfy the given predicate.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let arr = [2, 2, 2, 2, 2];\n    ///     let all = arr.all(|a| a == 2);\n    ///     assert(all);\n    /// }\n    /// ```\n    pub fn all<Env>(self, predicate: fn[Env](T) -> bool) -> bool {\n        let mut ret = true;\n        for elem in self {\n            ret &= predicate(elem);\n        }\n        ret\n    }\n\n    /// Returns true if any of the elements in this array satisfy the given predicate.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let arr = [2, 2, 2, 2, 5];\n    ///     let any = arr.any(|a| a == 5);\n    ///     assert(any);\n    /// }\n    /// ```\n    pub fn any<Env>(self, predicate: fn[Env](T) -> bool) -> bool {\n        let mut ret = false;\n        for elem in self {\n            ret |= predicate(elem);\n        }\n        ret\n    }\n\n    /// Concatenates this array with another array.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let arr1 = [1, 2, 3, 4];\n    ///     let arr2 = [6, 7, 8, 9, 10, 11];\n    ///     let concatenated_arr = arr1.concat(arr2);\n    ///     assert(concatenated_arr == [1, 2, 3, 4, 6, 7, 8, 9, 10, 11]);\n    /// }\n    /// ```\n    pub fn concat<let M: u32>(self, array2: [T; M]) -> [T; N + M] {\n        let mut result = [crate::mem::zeroed(); N + M];\n        for i in 0..N {\n            result[i] = self[i];\n        }\n        for i in 0..M {\n            result[i + N] = array2[i];\n        }\n        result\n    }\n}\n\nimpl<T, let N: u32> [T; N]\nwhere\n    T: Ord + Eq,\n{\n    /// Returns a new sorted array. The original array remains untouched. Notice that this function will\n    /// only work for arrays of fields or integers, not for any arbitrary type. This is because the sorting\n    /// logic it uses internally is optimized specifically for these values. If you need a sort function to\n    /// sort any type, you should use the [`Self::sort_via`] function.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// fn main() {\n    ///     let arr = [42, 32];\n    ///     let sorted = arr.sort();\n    ///     assert(sorted == [32, 42]);\n    /// }\n    /// ```\n    pub fn sort(self) -> Self {\n        self.sort_via(|a, b| a <= b)\n    }\n}\n\nimpl<T, let N: u32> [T; N]\nwhere\n    T: Eq,\n{\n    /// Returns a new sorted array by sorting it with a custom comparison function.\n    /// The original array remains untouched.\n    /// The ordering function must return true if the first argument should be sorted to be before the second argument or is equal to the second argument.\n    ///\n    /// Using this method with an operator like `<` that does not return `true` for equal values will result in an assertion failure for arrays with equal elements.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// fn main() {\n    ///     let arr = [42, 32]\n    ///     let sorted_ascending = arr.sort_via(|a, b| a <= b);\n    ///     assert(sorted_ascending == [32, 42]); // verifies\n    ///\n    ///     let sorted_descending = arr.sort_via(|a, b| a >= b);\n    ///     assert(sorted_descending == [32, 42]); // does not verify\n    /// }\n    /// ```\n    pub fn sort_via<Env>(self, ordering: fn[Env](T, T) -> bool) -> Self {\n        // Safety: `sorted` array is checked to be:\n        // a. a permutation of `input`'s elements\n        // b. satisfying the predicate `ordering`\n        let sorted = unsafe { quicksort::quicksort(self, ordering) };\n\n        if !is_unconstrained() {\n            for i in 0..N - 1 {\n                assert(\n                    ordering(sorted[i], sorted[i + 1]),\n                    \"Array has not been sorted correctly according to `ordering`.\",\n                );\n            }\n            check_shuffle::check_shuffle(self, sorted);\n        }\n        sorted\n    }\n}\n\nimpl<let N: u32> [u8; N] {\n    /// Converts a byte array of type `[u8; N]` to a string. Note that this performs no UTF-8 validation -\n    /// the given array is interpreted as-is as a string.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// fn main() {\n    ///     let hi = [104, 105].as_str_unchecked();\n    ///     assert_eq(hi, \"hi\");\n    /// }\n    /// ```\n    #[builtin(array_as_str_unchecked)]\n    pub fn as_str_unchecked(self) -> str<N> {}\n}\n\nimpl<let N: u32> From<str<N>> for [u8; N] {\n    /// Returns an array of the string bytes.\n    fn from(s: str<N>) -> Self {\n        s.as_bytes()\n    }\n}\n\nmod test {\n    #[test]\n    fn map_empty() {\n        assert_eq([].map(|x| x + 1), []);\n    }\n\n    global arr_with_100_values: [u32; 100] = [\n        42, 123, 87, 93, 48, 80, 50, 5, 104, 84, 70, 47, 119, 66, 71, 121, 3, 29, 42, 118, 2, 54,\n        89, 44, 81, 0, 26, 106, 68, 96, 84, 48, 95, 54, 45, 32, 89, 100, 109, 19, 37, 41, 19, 98,\n        53, 114, 107, 66, 6, 74, 13, 19, 105, 64, 123, 28, 44, 50, 89, 58, 123, 126, 21, 43, 86, 35,\n        21, 62, 82, 0, 108, 120, 72, 72, 62, 80, 12, 71, 70, 86, 116, 73, 38, 15, 127, 81, 30, 8,\n        125, 28, 26, 69, 114, 63, 27, 28, 61, 42, 13, 32,\n    ];\n    global expected_with_100_values: [u32; 100] = [\n        0, 0, 2, 3, 5, 6, 8, 12, 13, 13, 15, 19, 19, 19, 21, 21, 26, 26, 27, 28, 28, 28, 29, 30, 32,\n        32, 35, 37, 38, 41, 42, 42, 42, 43, 44, 44, 45, 47, 48, 48, 50, 50, 53, 54, 54, 58, 61, 62,\n        62, 63, 64, 66, 66, 68, 69, 70, 70, 71, 71, 72, 72, 73, 74, 80, 80, 81, 81, 82, 84, 84, 86,\n        86, 87, 89, 89, 89, 93, 95, 96, 98, 100, 104, 105, 106, 107, 108, 109, 114, 114, 116, 118,\n        119, 120, 121, 123, 123, 123, 125, 126, 127,\n    ];\n    fn sort_u32(a: u32, b: u32) -> bool {\n        a <= b\n    }\n\n    #[test]\n    fn test_sort() {\n        let mut arr: [u32; 7] = [3, 6, 8, 10, 1, 2, 1];\n\n        let sorted = arr.sort();\n\n        let expected: [u32; 7] = [1, 1, 2, 3, 6, 8, 10];\n        assert(sorted == expected);\n    }\n\n    #[test]\n    fn test_sort_100_values() {\n        let mut arr: [u32; 100] = [\n            42, 123, 87, 93, 48, 80, 50, 5, 104, 84, 70, 47, 119, 66, 71, 121, 3, 29, 42, 118, 2,\n            54, 89, 44, 81, 0, 26, 106, 68, 96, 84, 48, 95, 54, 45, 32, 89, 100, 109, 19, 37, 41,\n            19, 98, 53, 114, 107, 66, 6, 74, 13, 19, 105, 64, 123, 28, 44, 50, 89, 58, 123, 126, 21,\n            43, 86, 35, 21, 62, 82, 0, 108, 120, 72, 72, 62, 80, 12, 71, 70, 86, 116, 73, 38, 15,\n            127, 81, 30, 8, 125, 28, 26, 69, 114, 63, 27, 28, 61, 42, 13, 32,\n        ];\n\n        let sorted = arr.sort();\n\n        let expected: [u32; 100] = [\n            0, 0, 2, 3, 5, 6, 8, 12, 13, 13, 15, 19, 19, 19, 21, 21, 26, 26, 27, 28, 28, 28, 29, 30,\n            32, 32, 35, 37, 38, 41, 42, 42, 42, 43, 44, 44, 45, 47, 48, 48, 50, 50, 53, 54, 54, 58,\n            61, 62, 62, 63, 64, 66, 66, 68, 69, 70, 70, 71, 71, 72, 72, 73, 74, 80, 80, 81, 81, 82,\n            84, 84, 86, 86, 87, 89, 89, 89, 93, 95, 96, 98, 100, 104, 105, 106, 107, 108, 109, 114,\n            114, 116, 118, 119, 120, 121, 123, 123, 123, 125, 126, 127,\n        ];\n        assert(sorted == expected);\n    }\n\n    #[test]\n    fn test_sort_100_values_comptime() {\n        let sorted = arr_with_100_values.sort();\n        assert(sorted == expected_with_100_values);\n    }\n\n    #[test]\n    fn test_sort_via() {\n        let mut arr: [u32; 7] = [3, 6, 8, 10, 1, 2, 1];\n\n        let sorted = arr.sort_via(sort_u32);\n\n        let expected: [u32; 7] = [1, 1, 2, 3, 6, 8, 10];\n        assert(sorted == expected);\n    }\n\n    #[test]\n    fn test_sort_via_100_values() {\n        let mut arr: [u32; 100] = [\n            42, 123, 87, 93, 48, 80, 50, 5, 104, 84, 70, 47, 119, 66, 71, 121, 3, 29, 42, 118, 2,\n            54, 89, 44, 81, 0, 26, 106, 68, 96, 84, 48, 95, 54, 45, 32, 89, 100, 109, 19, 37, 41,\n            19, 98, 53, 114, 107, 66, 6, 74, 13, 19, 105, 64, 123, 28, 44, 50, 89, 58, 123, 126, 21,\n            43, 86, 35, 21, 62, 82, 0, 108, 120, 72, 72, 62, 80, 12, 71, 70, 86, 116, 73, 38, 15,\n            127, 81, 30, 8, 125, 28, 26, 69, 114, 63, 27, 28, 61, 42, 13, 32,\n        ];\n\n        let sorted = arr.sort_via(sort_u32);\n\n        let expected: [u32; 100] = [\n            0, 0, 2, 3, 5, 6, 8, 12, 13, 13, 15, 19, 19, 19, 21, 21, 26, 26, 27, 28, 28, 28, 29, 30,\n            32, 32, 35, 37, 38, 41, 42, 42, 42, 43, 44, 44, 45, 47, 48, 48, 50, 50, 53, 54, 54, 58,\n            61, 62, 62, 63, 64, 66, 66, 68, 69, 70, 70, 71, 71, 72, 72, 73, 74, 80, 80, 81, 81, 82,\n            84, 84, 86, 86, 87, 89, 89, 89, 93, 95, 96, 98, 100, 104, 105, 106, 107, 108, 109, 114,\n            114, 116, 118, 119, 120, 121, 123, 123, 123, 125, 126, 127,\n        ];\n        assert(sorted == expected);\n    }\n\n    #[test]\n    fn mapi_empty() {\n        assert_eq([].mapi(|i, x| i * x + 1), []);\n    }\n\n    #[test]\n    fn for_each_empty() {\n        let empty_array: [Field; 0] = [];\n        empty_array.for_each(|_x| assert(false));\n    }\n\n    #[test]\n    fn for_eachi_empty() {\n        let empty_array: [Field; 0] = [];\n        empty_array.for_eachi(|_i, _x| assert(false));\n    }\n\n    #[test]\n    fn map_example() {\n        let a = [1, 2, 3];\n        let b = a.map(|a| a * 2);\n        assert_eq(b, [2, 4, 6]);\n    }\n\n    #[test]\n    fn mapi_example() {\n        let a = [1, 2, 3];\n        let b = a.mapi(|i, a| i + a * 2);\n        assert_eq(b, [2, 5, 8]);\n    }\n\n    #[test]\n    fn for_each_example() {\n        let a = [1, 2, 3];\n        let mut b = [0, 0, 0];\n        let b_ref = &mut b;\n        let mut i = 0;\n        let i_ref = &mut i;\n        a.for_each(|x| {\n            b_ref[*i_ref] = x * 2;\n            *i_ref += 1;\n        });\n        assert_eq(b, [2, 4, 6]);\n        assert_eq(i, 3);\n    }\n\n    #[test]\n    fn for_eachi_example() {\n        let a = [1, 2, 3];\n        let mut b = [0, 0, 0];\n        let b_ref = &mut b;\n        a.for_eachi(|i, a| { b_ref[i] = i + a * 2; });\n        assert_eq(b, [2, 5, 8]);\n    }\n\n    #[test]\n    fn concat() {\n        let arr1 = [1, 2, 3, 4];\n        let arr2 = [6, 7, 8, 9, 10, 11];\n        let concatenated_arr = arr1.concat(arr2);\n        assert_eq(concatenated_arr, [1, 2, 3, 4, 6, 7, 8, 9, 10, 11]);\n    }\n\n    #[test]\n    fn concat_zero_length_with_something() {\n        let arr1 = [];\n        let arr2 = [1];\n        let concatenated_arr = arr1.concat(arr2);\n        assert_eq(concatenated_arr, [1]);\n    }\n\n    #[test]\n    fn concat_something_with_zero_length() {\n        let arr1 = [1];\n        let arr2 = [];\n        let concatenated_arr = arr1.concat(arr2);\n        assert_eq(concatenated_arr, [1]);\n    }\n\n    #[test]\n    fn concat_zero_lengths() {\n        let arr1: [Field; 0] = [];\n        let arr2: [Field; 0] = [];\n        let concatenated_arr = arr1.concat(arr2);\n        assert_eq(concatenated_arr, []);\n    }\n}\n"
     },
-    "303": {
+    "308": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/address/aztec_address.nr",
       "source": "use crate::{\n    address::{\n        partial_address::PartialAddress, salted_initialization_hash::SaltedInitializationHash,\n    },\n    constants::{\n        AZTEC_ADDRESS_LENGTH, GENERATOR_INDEX__CONTRACT_ADDRESS_V1, MAX_FIELD_VALUE,\n        MAX_PROTOCOL_CONTRACTS,\n    },\n    contract_class_id::ContractClassId,\n    hash::poseidon2_hash_with_separator,\n    public_keys::{IvpkM, NpkM, OvpkM, PublicKeys, ToPoint, TpkM},\n    traits::{Deserialize, Empty, FromField, Packable, Serialize, ToField},\n    utils::field::{pow, sqrt},\n};\n\n// We do below because `use crate::point::Point;` does not work\nuse dep::std::embedded_curve_ops::EmbeddedCurvePoint as Point;\n\nuse crate::public_keys::AddressPoint;\nuse std::{\n    embedded_curve_ops::{EmbeddedCurveScalar, fixed_base_scalar_mul as derive_public_key},\n    ops::Add,\n};\nuse std::meta::derive;\n\n// Aztec address\n#[derive(Deserialize, Eq, Packable, Serialize)]\npub struct AztecAddress {\n    pub inner: Field,\n}\n\nimpl Empty for AztecAddress {\n    fn empty() -> Self {\n        Self { inner: 0 }\n    }\n}\n\nimpl ToField for AztecAddress {\n    fn to_field(self) -> Field {\n        self.inner\n    }\n}\n\nimpl FromField for AztecAddress {\n    fn from_field(value: Field) -> AztecAddress {\n        AztecAddress { inner: value }\n    }\n}\n\nimpl AztecAddress {\n    pub fn zero() -> Self {\n        Self { inner: 0 }\n    }\n\n    /// Returns an address's `AddressPoint`, which can be used to create shared secrets with the owner\n    /// of the address. If the address is invalid (i.e. it is not a properly derived Aztec address), then this\n    /// returns `Option::none()`, and no shared secrets can be created.\n    pub fn to_address_point(self) -> Option<AddressPoint> {\n        // We compute the address point by taking our address, setting it to x, and then solving for y in the\n        // equation which defines our bn curve:\n        // y^2 = x^3 - 17; x = address\n        let x = self.inner;\n        let y_squared = pow(x, 3) - 17;\n\n        // An invalid AztecAddress is one for which no y coordinate satisfies the curve equation, which we'll\n        // identify by proving that the square root of y_squared does not exist.\n        let mut y_opt = sqrt(y_squared);\n        if y_opt.is_none() {\n            Option::none()\n        } else {\n            let mut y = y_opt.unwrap();\n\n            // If we get a negative y coordinate (any y where y > MAX_FIELD_VALUE / 2), we pin it to the\n            // positive one (any value where y <= MAX_FIELD_VALUE / 2) by subtracting it from the Field modulus\n            // note: The field modulus is MAX_FIELD_VALUE + 1\n            if (!(y.lt(MAX_FIELD_VALUE / 2) | y.eq(MAX_FIELD_VALUE / 2))) {\n                y = (MAX_FIELD_VALUE + 1) - y;\n            }\n\n            Option::some(\n                AddressPoint { inner: Point { x: self.inner, y, is_infinite: false } },\n            )\n        }\n    }\n\n    pub fn compute(public_keys: PublicKeys, partial_address: PartialAddress) -> AztecAddress {\n        let public_keys_hash = public_keys.hash();\n\n        let pre_address = poseidon2_hash_with_separator(\n            [public_keys_hash.to_field(), partial_address.to_field()],\n            GENERATOR_INDEX__CONTRACT_ADDRESS_V1,\n        );\n\n        let address_point = derive_public_key(EmbeddedCurveScalar::from_field(pre_address)).add(\n            public_keys.ivpk_m.to_point(),\n        );\n\n        // Note that our address is only the x-coordinate of the full address_point. This is okay because when people want to encrypt something and send it to us\n        // they can recover our full point using the x-coordinate (our address itself). To do this, they recompute the y-coordinate according to the equation y^2 = x^3 - 17.\n        // When they do this, they may get a positive y-coordinate (a value that is less than or equal to MAX_FIELD_VALUE / 2) or\n        // a negative y-coordinate (a value that is more than MAX_FIELD_VALUE), and we cannot dictate which one they get and hence the recovered point may sometimes be different than the one\n        // our secret can decrypt. Regardless though, they should and will always encrypt using point with the positive y-coordinate by convention.\n        // This ensures that everyone encrypts to the same point given an arbitrary x-coordinate (address). This is allowed because even though our original point may not have a positive y-coordinate,\n        // with our original secret, we will be able to derive the secret to the point with the flipped (and now positive) y-coordinate that everyone encrypts to.\n        AztecAddress::from_field(address_point.x)\n    }\n\n    pub fn compute_from_class_id(\n        contract_class_id: ContractClassId,\n        salted_initialization_hash: SaltedInitializationHash,\n        public_keys: PublicKeys,\n    ) -> Self {\n        let partial_address = PartialAddress::compute_from_salted_initialization_hash(\n            contract_class_id,\n            salted_initialization_hash,\n        );\n\n        AztecAddress::compute(public_keys, partial_address)\n    }\n\n    pub fn is_protocol_contract(self) -> bool {\n        self.inner.lt(MAX_PROTOCOL_CONTRACTS as Field)\n    }\n\n    pub fn is_zero(self) -> bool {\n        self.inner == 0\n    }\n\n    pub fn assert_is_zero(self) {\n        assert(self.to_field() == 0);\n    }\n}\n\n#[test]\nfn compute_address_from_partial_and_pub_keys() {\n    let public_keys = PublicKeys {\n        npk_m: NpkM {\n            inner: Point {\n                x: 0x22f7fcddfa3ce3e8f0cc8e82d7b94cdd740afa3e77f8e4a63ea78a239432dcab,\n                y: 0x0471657de2b6216ade6c506d28fbc22ba8b8ed95c871ad9f3e3984e90d9723a7,\n                is_infinite: false,\n            },\n        },\n        ivpk_m: IvpkM {\n            inner: Point {\n                x: 0x111223493147f6785514b1c195bb37a2589f22a6596d30bb2bb145fdc9ca8f1e,\n                y: 0x273bbffd678edce8fe30e0deafc4f66d58357c06fd4a820285294b9746c3be95,\n                is_infinite: false,\n            },\n        },\n        ovpk_m: OvpkM {\n            inner: Point {\n                x: 0x09115c96e962322ffed6522f57194627136b8d03ac7469109707f5e44190c484,\n                y: 0x0c49773308a13d740a7f0d4f0e6163b02c5a408b6f965856b6a491002d073d5b,\n                is_infinite: false,\n            },\n        },\n        tpk_m: TpkM {\n            inner: Point {\n                x: 0x00d3d81beb009873eb7116327cf47c612d5758ef083d4fda78e9b63980b2a762,\n                y: 0x2f567d22d2b02fe1f4ad42db9d58a36afd1983e7e2909d1cab61cafedad6193a,\n                is_infinite: false,\n            },\n        },\n    };\n\n    let partial_address = PartialAddress::from_field(\n        0x0a7c585381b10f4666044266a02405bf6e01fa564c8517d4ad5823493abd31de,\n    );\n\n    let address = AztecAddress::compute(public_keys, partial_address);\n\n    // The following value was generated by `derivation.test.ts`.\n    // --> Run the test with AZTEC_GENERATE_TEST_DATA=1 flag to update test data.\n    let expected_computed_address_from_partial_and_pubkeys =\n        0x24e4646f58b9fbe7d38e317db8d5636c423fbbdfbe119fc190fe9c64747e0c62;\n    assert(address.to_field() == expected_computed_address_from_partial_and_pubkeys);\n}\n\n#[test]\nfn compute_preaddress_from_partial_and_pub_keys() {\n    let pre_address = poseidon2_hash_with_separator([1, 2], GENERATOR_INDEX__CONTRACT_ADDRESS_V1);\n    let expected_computed_preaddress_from_partial_and_pubkey =\n        0x23ce9be3fa3c846b0f9245cc796902e731d04f086e8a42473bb29e405fc98075;\n    assert(pre_address == expected_computed_preaddress_from_partial_and_pubkey);\n}\n\n#[test]\nfn from_field_to_field() {\n    let address = AztecAddress { inner: 37 };\n    assert_eq(FromField::from_field(address.to_field()), address);\n}\n\n#[test]\nfn serde() {\n    let address = AztecAddress { inner: 37 };\n    // We use the AZTEC_ADDRESS_LENGTH constant to ensure that there is a match between the derived trait\n    // implementation and the constant.\n    let serialized: [Field; AZTEC_ADDRESS_LENGTH] = address.serialize();\n    let deserialized = AztecAddress::deserialize(serialized);\n    assert_eq(address, deserialized);\n}\n\n#[test]\nfn to_address_point_valid() {\n    // x = 8 where x^3 - 17 = 512 - 17 = 495, which is a residue in this field\n    let address = AztecAddress { inner: 8 };\n    let maybe_point = address.to_address_point();\n    assert(maybe_point.is_some());\n\n    let point = maybe_point.unwrap().inner;\n    // check that x is preserved\n    assert_eq(point.x, Field::from(8));\n\n    // check that the curve equation holds: y^2 == x^3 - 17\n    assert_eq(pow(point.y, 2), pow(point.x, 3) - 17);\n}\n\n#[test]\nunconstrained fn to_address_point_invalid() {\n    // x = 3 where x^3 - 17 = 27 - 17 = 10, which is a non-residue in this field\n    let address = AztecAddress { inner: 3 }; //\n    let maybe_point = address.to_address_point();\n    assert(maybe_point.is_none());\n}\n"
     },
-    "306": {
+    "311": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/address/partial_address.nr",
       "source": "use crate::{\n    address::{aztec_address::AztecAddress, salted_initialization_hash::SaltedInitializationHash},\n    constants::GENERATOR_INDEX__PARTIAL_ADDRESS,\n    contract_class_id::ContractClassId,\n    hash::poseidon2_hash_with_separator,\n    traits::{Deserialize, Empty, Serialize, ToField},\n};\nuse std::meta::derive;\n\n// Partial address\n#[derive(Deserialize, Eq, Serialize)]\npub struct PartialAddress {\n    pub inner: Field,\n}\n\nimpl ToField for PartialAddress {\n    fn to_field(self) -> Field {\n        self.inner\n    }\n}\n\nimpl Empty for PartialAddress {\n    fn empty() -> Self {\n        Self { inner: 0 }\n    }\n}\n\nimpl PartialAddress {\n    pub fn from_field(field: Field) -> Self {\n        Self { inner: field }\n    }\n\n    pub fn compute(\n        contract_class_id: ContractClassId,\n        salt: Field,\n        initialization_hash: Field,\n        deployer: AztecAddress,\n    ) -> Self {\n        PartialAddress::compute_from_salted_initialization_hash(\n            contract_class_id,\n            SaltedInitializationHash::compute(salt, initialization_hash, deployer),\n        )\n    }\n\n    pub fn compute_from_salted_initialization_hash(\n        contract_class_id: ContractClassId,\n        salted_initialization_hash: SaltedInitializationHash,\n    ) -> Self {\n        PartialAddress::from_field(poseidon2_hash_with_separator(\n            [contract_class_id.to_field(), salted_initialization_hash.to_field()],\n            GENERATOR_INDEX__PARTIAL_ADDRESS,\n        ))\n    }\n\n    pub fn to_field(self) -> Field {\n        self.inner\n    }\n\n    pub fn is_zero(self) -> bool {\n        self.to_field() == 0\n    }\n\n    pub fn assert_is_zero(self) {\n        assert(self.to_field() == 0);\n    }\n}\n\nmod test {\n    use crate::{address::partial_address::PartialAddress, traits::{Deserialize, Serialize}};\n\n    #[test]\n    fn serialization_of_partial_address() {\n        let item = PartialAddress::from_field(1);\n        let serialized: [Field; 1] = item.serialize();\n        let deserialized = PartialAddress::deserialize(serialized);\n        assert_eq(item, deserialized);\n    }\n}\n"
     },
-    "308": {
+    "313": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/address/salted_initialization_hash.nr",
       "source": "use crate::{\n    address::aztec_address::AztecAddress, constants::GENERATOR_INDEX__PARTIAL_ADDRESS,\n    hash::poseidon2_hash_with_separator, traits::ToField,\n};\n\n// Salted initialization hash. Used in the computation of a partial address.\n#[derive(Eq)]\npub struct SaltedInitializationHash {\n    pub inner: Field,\n}\n\nimpl ToField for SaltedInitializationHash {\n    fn to_field(self) -> Field {\n        self.inner\n    }\n}\n\nimpl SaltedInitializationHash {\n    pub fn from_field(field: Field) -> Self {\n        Self { inner: field }\n    }\n\n    pub fn compute(salt: Field, initialization_hash: Field, deployer: AztecAddress) -> Self {\n        SaltedInitializationHash::from_field(poseidon2_hash_with_separator(\n            [salt, initialization_hash, deployer.to_field()],\n            GENERATOR_INDEX__PARTIAL_ADDRESS,\n        ))\n    }\n\n    pub fn assert_is_zero(self) {\n        assert(self.to_field() == 0);\n    }\n}\n"
     },
-    "324": {
+    "329": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/debug_log.nr",
       "source": "// TODO: Expose other wrapped functions than debug (info, warn)\n// ['silent', 'fatal', 'error', 'warn', 'info', 'verbose', 'debug', 'trace']\n\npub global SILENT_LOG_LEVEL: u8 = 0;\npub global FATAL_LOG_LEVEL: u8 = 1;\npub global ERROR_LOG_LEVEL: u8 = 2;\npub global WARN_LOG_LEVEL: u8 = 3;\npub global INFO_LOG_LEVEL: u8 = 4;\npub global VERBOSE_LOG_LEVEL: u8 = 5;\npub global DEBUG_LOG_LEVEL: u8 = 6;\npub global TRACE_LOG_LEVEL: u8 = 7;\n\n/// Utility function to console.log data in the acir simulator.\n/// Example:\n///   debug_log(\"blah blah this is a debug string\");\npub fn debug_log<let N: u32>(msg: str<N>) {\n    debug_log_format(msg, []);\n}\n\n/// Same as debug_log, but allows to customize the log level.\n/// Consider changing just to 'log'\npub fn debug_log_with_level<let N: u32>(log_level: u8, msg: str<N>) {\n    debug_log_format_with_level(log_level, msg, []);\n}\n\n/// Utility function to console.log data in the acir simulator. This variant receives a format string in which the\n/// `${k}` tokens will be replaced with the k-eth value in the `args` array.\n/// Examples:\n///   debug_log_format(\"get_2(slot:{0}) =>\\n\\t0:{1}\\n\\t1:{2}\", [storage_slot, note0_hash, note1_hash]);\n///   debug_log_format(\"whole array: {}\", [e1, e2, e3, e4]);\npub fn debug_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n    // to call.\n    unsafe { debug_log_array_oracle_wrapper(DEBUG_LOG_LEVEL, msg, args) };\n}\n\n/// Same as debug_log_format, but allows to customize the log level.\n/// Consider changing just to 'log_format'\npub fn debug_log_format_with_level<let M: u32, let N: u32>(\n    log_level: u8,\n    msg: str<M>,\n    args: [Field; N],\n) {\n    // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n    // to call.\n    unsafe { debug_log_array_oracle_wrapper(log_level, msg, args) };\n}\n\n/// Utility function to console.log data in the acir simulator. This variant receives a format string in which the\n/// `${k}` tokens will be replaced with the k-eth value in the `args` slice.\n/// Examples:\n///   debug_log_format(\"get_2(slot:{0}) =>\\n\\t0:{1}\\n\\t1:{2}\", [storage_slot, note0_hash, note1_hash]);\n///   debug_log_format(\"whole slice: {}\", [e1, e2, e3, e4]);\npub fn debug_log_format_slice<let M: u32>(log_level: u8, msg: str<M>, args: [Field]) {\n    // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n    // to call.\n    unsafe { debug_log_slice_oracle_wrapper(log_level, msg, args) };\n}\n\n// We provide two versions of the debug log oracle: one that takes args as a slice and another one that takes args as an array.\n// We do this since conversion from array to slice generates overhead in public functions, since opcodes need to be emitted for the conversion.\n// By exposing the two flavors, we avoid conversions since the AVM is able to handle both arrays an slices in this oracle.\n\nunconstrained fn debug_log_slice_oracle_wrapper<let M: u32>(\n    log_level: u8,\n    msg: str<M>,\n    args: [Field],\n) {\n    debug_log_slice_oracle(log_level, msg, args);\n}\n\n// WARNING: sometimes when using debug logs the ACVM errors with: `thrown: \"solver opcode resolution error: cannot solve opcode: expression has too many unknowns x155\"`\n#[oracle(utilityDebugLog)]\nunconstrained fn debug_log_slice_oracle<let M: u32>(log_level: u8, msg: str<M>, args: [Field]) {}\n\nunconstrained fn debug_log_array_oracle_wrapper<let M: u32, let N: u32>(\n    log_level: u8,\n    msg: str<M>,\n    args: [Field; N],\n) {\n    debug_log_array_oracle(log_level, msg, N, args);\n}\n\n#[oracle(utilityDebugLog)]\nunconstrained fn debug_log_array_oracle<let M: u32, let N: u32>(\n    log_level: u8,\n    msg: str<M>,\n    length: u32,\n    args: [Field; N],\n) {}\n"
     },
-    "326": {
+    "331": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/delayed_public_mutable/delayed_public_mutable_values.nr",
       "source": "use crate::{\n    delayed_public_mutable::{\n        scheduled_delay_change::ScheduledDelayChange, scheduled_value_change::ScheduledValueChange,\n    },\n    hash::poseidon2_hash,\n    traits::{Hash, Packable},\n    utils::arrays,\n};\nuse std::meta::derive;\n\nmod test;\n\n/// DelayedPublicMutableValues is just a wrapper around ScheduledValueChange and ScheduledDelayChange that then allows us\n/// to wrap both of these values in WithHash. WithHash allows for efficient read of values in private.\n///\n/// Note that the WithHash optimization does not work in public (due to there being no unconstrained). But we also want\n/// to be able to read the values efficiently in public and we want to be able to read each value separately. Reading\n/// the values separately is tricky because ScheduledValueChange and ScheduledDelayChange are packed together (sdc and\n/// svc.timestamp_of_change are stored in the same slot). For that reason we expose `unpack_value_change` and\n/// `unpack_delay_change` functions that can be used to extract the values from the packed representation. This\n/// is \"hacky\" but there is no way around it.\n#[derive(Eq)]\npub struct DelayedPublicMutableValues<T, let INITIAL_DELAY: u64> {\n    pub svc: ScheduledValueChange<T>,\n    pub sdc: ScheduledDelayChange<INITIAL_DELAY>,\n}\n\nimpl<T, let INITIAL_DELAY: u64> DelayedPublicMutableValues<T, INITIAL_DELAY> {\n    pub fn new(svc: ScheduledValueChange<T>, sdc: ScheduledDelayChange<INITIAL_DELAY>) -> Self {\n        DelayedPublicMutableValues { svc, sdc }\n    }\n}\n\npub fn unpack_value_change<T, let M: u32>(packed: [Field; 2 * M + 1]) -> ScheduledValueChange<T>\nwhere\n    T: Packable<N = M>,\n{\n    let svc_pre_packed = arrays::subarray(packed, 1);\n    let svc_post_packed = arrays::subarray(packed, M + 1);\n\n    // We first cast to u32 as the timestamp_of_change is packed into the same field as the delay change and it\n    // occupies the first 32 bits of the field.\n    let timestamp_of_change = (packed[0] as u32) as u64;\n    ScheduledValueChange::new(\n        T::unpack(svc_pre_packed),\n        T::unpack(svc_post_packed),\n        timestamp_of_change,\n    )\n}\n\npub fn unpack_delay_change<let INITIAL_DELAY: u64>(\n    packed: Field,\n) -> ScheduledDelayChange<INITIAL_DELAY> {\n    // This function expects to be called with just the first field of the packed representation, which contains sdc\n    // and svc timestamp_of_change. We'll discard the svc component.\n    let svc_timestamp_of_change = packed as u32;\n\n    let mut tmp = (packed - svc_timestamp_of_change as Field) / TWO_POW_32;\n    let sdc_timestamp_of_change = tmp as u32;\n\n    tmp = (tmp - sdc_timestamp_of_change as Field) / TWO_POW_32;\n    let sdc_post_is_some = (tmp as u1) != 0;\n\n    tmp = (tmp - sdc_post_is_some as Field) / TWO_POW_8;\n    let sdc_post_inner = tmp as u32;\n\n    tmp = (tmp - sdc_post_inner as Field) / TWO_POW_32;\n    let sdc_pre_is_some = (tmp as u1) != 0;\n\n    tmp = (tmp - sdc_pre_is_some as Field) / TWO_POW_8;\n    let sdc_pre_inner = tmp as u32;\n\n    // Note that below we cast the values to u64 as that is the default type of timestamp in the system. Us packing\n    // the values as u32 is a tech debt that is not worth tackling.\n    ScheduledDelayChange {\n        pre: if sdc_pre_is_some {\n            Option::some(sdc_pre_inner as u64)\n        } else {\n            Option::none()\n        },\n        post: if sdc_post_is_some {\n            Option::some(sdc_post_inner as u64)\n        } else {\n            Option::none()\n        },\n        timestamp_of_change: sdc_timestamp_of_change as u64,\n    }\n}\n\nglobal TWO_POW_32: Field = 2.pow_32(32);\nglobal TWO_POW_8: Field = 2.pow_32(8);\n\n// We pack to `2 * N + 1` fields because ScheduledValueChange contains T twice (hence `2 * N`) and we need one extra\n// field to store ScheduledDelayChange and the timestamp_of_change of ScheduledValueChange.\nimpl<T, let INITIAL_DELAY: u64> Packable for DelayedPublicMutableValues<T, INITIAL_DELAY>\nwhere\n    T: Packable,\n{\n    let N: u32 = 2 * <T as Packable>::N + 1;\n\n    fn pack(self) -> [Field; Self::N] {\n        let mut result = [0; Self::N];\n\n        // We pack sdc.pre, sdc.post, sdc.timestamp_of_change and svc.timestamp_of_change into a single field as follows:\n        // [ sdc.pre_inner: u32 | sdc.pre_is_some: u8 | sdc.post_inner: u32 | sdc.post_is_some: u8 | sdc.timestamp_of_change: u32 | svc.timestamp_of_change: u32 ]\n        // Note that the code below no longer works after 2106 as by that time the timestamp will overflow u32. This is a tech debt that is not worth tackling.\n        result[0] = self.svc.timestamp_of_change as Field\n            + ((self.sdc.timestamp_of_change as Field) * 2.pow_32(32))\n            + ((self.sdc.post.is_some() as Field) * 2.pow_32(64))\n            + ((self.sdc.post.unwrap_unchecked() as Field) * 2.pow_32(72))\n            + ((self.sdc.pre.is_some() as Field) * 2.pow_32(104))\n            + ((self.sdc.pre.unwrap_unchecked() as Field) * 2.pow_32(112));\n\n        // Pack the pre and post values from ScheduledValueChange\n        let svc_pre_packed = self.svc.pre.pack();\n        let svc_post_packed = self.svc.post.pack();\n        for i in 0..<T as Packable>::N {\n            result[i + 1] = svc_pre_packed[i];\n            result[i + 1 + <T as Packable>::N] = svc_post_packed[i];\n        }\n        result\n    }\n\n    fn unpack(fields: [Field; Self::N]) -> Self {\n        let svc = unpack_value_change::<T, _>(fields);\n        let sdc = unpack_delay_change::<INITIAL_DELAY>(fields[0]);\n        Self::new(svc, sdc)\n    }\n}\n\nimpl<T, let INITIAL_DELAY: u64> Hash for DelayedPublicMutableValues<T, INITIAL_DELAY>\nwhere\n    T: Packable,\n{\n    fn hash(self) -> Field {\n        poseidon2_hash(self.pack())\n    }\n}\n"
     },
-    "329": {
+    "334": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/delayed_public_mutable/scheduled_delay_change.nr",
       "source": "use crate::traits::Empty;\nuse std::cmp::min;\n\nmod test;\n\n// This data structure is used by DelayedPublicMutable to store the minimum delay with which a ScheduledValueChange object can\n// schedule a change.\n// This delay is initially equal to INITIAL_DELAY, and can be safely mutated to any other value over time. This mutation\n// is performed via `schedule_change` in order to satisfy ScheduleValueChange constraints: if e.g. we allowed for the\n// delay to be decreased immediately then it'd be possible for the state variable to schedule a value change with a\n// reduced delay, invalidating prior private reads.\npub struct ScheduledDelayChange<let INITIAL_DELAY: u64> {\n    // Both pre and post are stored in public storage, so by default they are zeroed. By wrapping them in an Option,\n    // they default to Option::none(), which we detect and replace with INITIAL_DELAY. The end result is that a\n    // ScheduledDelayChange that has not been initialized has a delay equal to INITIAL_DELAY, which is the desired\n    // effect. Once initialized, the Option will never be none again.\n    pub(crate) pre: Option<u64>,\n    pub(crate) post: Option<u64>,\n    // Timestamp at which `post` value is used instead of `pre`\n    pub(crate) timestamp_of_change: u64,\n}\n\nimpl<let INITIAL_DELAY: u64> ScheduledDelayChange<INITIAL_DELAY> {\n    pub fn new(pre: Option<u64>, post: Option<u64>, timestamp_of_change: u64) -> Self {\n        Self { pre, post, timestamp_of_change }\n    }\n\n    /// Returns the current value of the delay stored in the data structure.\n    /// This function only returns a meaningful value when called in public with the current timestamp - for\n    /// historical private reads use `get_effective_minimum_delay_at` instead.\n    pub fn get_current(self, current_timestamp: u64) -> u64 {\n        // The post value becomes the current one at the timestamp of change, so any transaction that is included at or after\n        // the timestamp of change will use the post value.\n        if current_timestamp < self.timestamp_of_change {\n            self.pre.unwrap_or(INITIAL_DELAY)\n        } else {\n            self.post.unwrap_or(INITIAL_DELAY)\n        }\n    }\n\n    /// Returns the scheduled change, i.e. the post-change delay and the timestamp at which it will become the current\n    /// delay. Note that this timestamp may be in the past if the change has already taken place.\n    /// Additionally, further changes might be later scheduled, potentially canceling the one returned by this function.\n    pub fn get_scheduled(self) -> (u64, u64) {\n        (self.post.unwrap_or(INITIAL_DELAY), self.timestamp_of_change)\n    }\n\n    /// Mutates the delay change by scheduling a change at the current timestamp. This function is only meaningful\n    /// when called in public with the current timestamp.\n    /// The timestamp at which the new delay will become effective is determined automatically:\n    ///  - when increasing the delay, the change is effective immediately\n    ///  - when reducing the delay, the change will take effect after a delay equal to the difference between old and\n    ///    new delay. For example, if reducing from 3 days to 1 day, the reduction will be scheduled to happen after 2\n    ///    days.\n    pub fn schedule_change(&mut self, new: u64, current_timestamp: u64) {\n        let current = self.get_current(current_timestamp);\n\n        // When changing the delay value we must ensure that it is not possible to produce a value change with a delay\n        // shorter than the current one.\n        let time_until_change = if new > current {\n            // Increasing the delay value can therefore be done immediately: this does not invalidate prior constraints\n            // about how quickly a value might be changed (indeed it strengthens them).\n            0\n        } else {\n            // Decreasing the delay requires waiting for the difference between current and new delay in order to ensure\n            // that overall the current delay is respected.\n            //\n            //      current                    delay              earliest value timestamp of change\n            //      timestamp             timestamp of change         if delay remained unchanged\n            //  =======N=========================|================================X=================>\n            //         ^                         ^                                ^\n            //         |-------------------------|--------------------------------|\n            //         |   time until change               new delay              |\n            //         ------------------------------------------------------------\n            //                            current delay\n            current - new\n        };\n\n        self.pre = Option::some(current);\n        self.post = Option::some(new);\n        self.timestamp_of_change = current_timestamp + time_until_change;\n    }\n\n    /// Returns the minimum delay before a value might mutate due to a scheduled change, from the perspective of some\n    /// historical timestamp. It only returns a meaningful value when called in private with historical timestamps.\n    /// This function can be used alongside `ScheduledValueChange.get_time_horizon` to properly constrain\n    /// the `include_by_timestamp` transaction property when reading delayed mutable state.\n    /// This value typically equals the current delay at the timestamp following the historical one (the earliest one in\n    /// which a value change could be scheduled), but it also considers scenarios in which a delay reduction is\n    /// scheduled to happen in the near future, resulting in a way to schedule a change with an overall delay lower than\n    /// the current one.\n    pub fn get_effective_minimum_delay_at(self, historical_timestamp: u64) -> u64 {\n        if self.timestamp_of_change <= historical_timestamp {\n            // If no delay changes were scheduled, then the delay value at the historical timestamp (post) is guaranteed to\n            // hold due to how further delay changes would be scheduled by `schedule_change`.\n            self.post.unwrap_or(INITIAL_DELAY)\n        } else {\n            // If a change is scheduled, then the effective delay might be lower than the current one (pre). At the\n            // timestamp of change the current delay will be the scheduled one, with an overall delay from the historical\n            // timestamp equal to the time until the change plus the new delay. If this value is lower\n            // than the current delay, then that is the effective minimum delay.\n            //\n            //       historical\n            //        timestamp                delay                  actual earliest value\n            //           v              timestamp of change           timestamp of change\n            //  =========NS=====================|=============================X===========Y=====>\n            //            ^                     ^                             ^           ^\n            //     earliest timestamp in        |                             |           |\n            //   which to schedule change       |                             |           |\n            //           |                      |                             |           |\n            //           |----------------------|------------------------------           |\n            //           |          time                  new delay                       |\n            //           |      until change                                              |\n            //           |                                                                |\n            //           |----------------------------------------------------------------|\n            //                        current delay at the earliest timestamp in\n            //                             which to scheduled value change\n            let time_until_change = self.timestamp_of_change - (historical_timestamp + 1);\n\n            min(\n                self.pre.unwrap_or(INITIAL_DELAY),\n                time_until_change + self.post.unwrap_or(INITIAL_DELAY),\n            )\n        }\n    }\n}\n\nimpl<let INITIAL_DELAY: u64> Eq for ScheduledDelayChange<INITIAL_DELAY> {\n    fn eq(self, other: Self) -> bool {\n        (self.pre == other.pre)\n            & (self.post == other.post)\n            & (self.timestamp_of_change == other.timestamp_of_change)\n    }\n}\n\nimpl<let INITIAL_DELAY: u64> Empty for ScheduledDelayChange<INITIAL_DELAY> {\n    fn empty() -> Self {\n        Self { pre: Option::none(), post: Option::none(), timestamp_of_change: 0 }\n    }\n}\n"
     },
-    "331": {
+    "336": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/delayed_public_mutable/scheduled_value_change.nr",
       "source": "use crate::traits::Empty;\nuse std::cmp::min;\n\nmod test;\n\n// This data structure is used by DelayedPublicMutable to represent a value that changes from `pre` to `post` at some timestamp\n// called the `timestamp_of_change`. The value can only be made to change by scheduling a change event at some future\n// timestamp after some minimum delay measured in seconds has elapsed. This means that at any given timestamp we know\n// both the current value and the smallest timestamp at which the value might change - this is called the\n// 'time horizon'.\npub struct ScheduledValueChange<T> {\n    pub(crate) pre: T,\n    pub(crate) post: T,\n    // Timestamp at which `post` value is used instead of `pre`\n    pub(crate) timestamp_of_change: u64,\n}\n\nimpl<T> ScheduledValueChange<T> {\n    pub fn new(pre: T, post: T, timestamp_of_change: u64) -> Self {\n        Self { pre, post, timestamp_of_change }\n    }\n\n    /// Returns the value stored in the data structure at a given timestamp. This function can be called both in public\n    /// (where `timestamp` is simply the current timestamp, i.e. the timestamp at which the current transaction will be\n    /// included) and in private (where `timestamp` is the anchor block's timestamp). Reading in private is only safe\n    /// if the transaction's `include_by_timestamp` property is set to a value lower or equal to the time horizon (see\n    /// `get_time_horizon()`).\n    pub fn get_current_at(self, timestamp: u64) -> T {\n        // The post value becomes the current one at the timestamp of change. This means different things in each realm:\n        // - in public, any transaction that is included at the timestamp of change will use the post value\n        // - in private, any transaction that includes the timestamp of change as part of the historical state will use\n        //   the post value (barring any follow-up changes)\n        if timestamp < self.timestamp_of_change {\n            self.pre\n        } else {\n            self.post\n        }\n    }\n\n    /// Returns the scheduled change, i.e. the post-change value and the timestamp at which it will become the current\n    /// value. Note that this timestamp may be in the past if the change has already taken place.\n    /// Additionally, further changes might be later scheduled, potentially canceling the one returned by this function.\n    pub fn get_scheduled(self) -> (T, u64) {\n        (self.post, self.timestamp_of_change)\n    }\n\n    // Returns the previous value. This is the value that is current up until the timestamp of change. Note that this\n    // value might not be the current anymore since timestamp of change might have already passed.\n    pub fn get_previous(self) -> (T, u64) {\n        (self.pre, self.timestamp_of_change)\n    }\n\n    /// Returns the largest timestamp at which the value returned by `get_current_at` is known to remain the current\n    /// value. This value is only meaningful in private where the proof is constructed against an anchor block, since\n    /// due to its asynchronous nature private execution cannot know about any later scheduled changes.\n    /// The caller of this function must know how quickly the value can change due to a scheduled change in the form of\n    /// `minimum_delay`. If the delay itself is immutable, then this is just its duration. If the delay is mutable\n    /// however, then this value is the 'effective minimum delay' (obtained by calling\n    /// `ScheduledDelayChange.get_effective_minimum_delay_at`), which equals the minimum time in seconds that needs to\n    /// elapse from the next block's timestamp until the value changes, regardless of further delay changes.\n    /// The value returned by `get_current_at` in private when called with a anchor block's timestamp is only safe to use\n    /// if the transaction's `include_by_timestamp` property is set to a value lower or equal to the time horizon\n    /// computed using the same anchor timestamp.\n    pub fn get_time_horizon(self, anchor_timestamp: u64, minimum_delay: u64) -> u64 {\n        // The time horizon is the very last timestamp in which the current value is known. Any timestamp past the\n        // horizon (i.e. with a timestamp larger than the time horizon) may have a different current value.\n        // Reading the current value in private typically requires constraining the maximum valid timestamp to be equal\n        // to the time horizon.\n        if anchor_timestamp >= self.timestamp_of_change {\n            // Once the timestamp of change has passed (block with timestamp >= timestamp_of_change was mined),\n            // the current value (post) will not change unless a new value change is scheduled. This did not happen at\n            // the anchor timestamp (or else it would not be greater or equal to the timestamp of change), and\n            // therefore could only happen after the anchor timestamp. The earliest would be the immediate next\n            // timestamp, and so the smallest possible next timestamp of change equals `anchor_timestamp + 1 +\n            // minimum_delay`. Our time horizon is simply the previous timestamp to that one.\n            //\n            //   timestamp of    anchor\n            //      change       timestamp          time horizon\n            //   =======|=============N===================H===========>\n            //                         ^                   ^\n            //                         ---------------------\n            //                             minimum delay\n            anchor_timestamp + minimum_delay\n        } else {\n            // If the timestamp of change has not yet been reached however, then there are two possible scenarios.\n            //   a) It could be so far into the future that the time horizon is actually determined by the minimum\n            //      delay, because a new change could be scheduled and take place _before_ the currently scheduled one.\n            //      This is similar to the scenario where the timestamp of change is in the past: the time horizon is\n            //      the timestamp prior to the earliest one in which a new timestamp of change might land.\n            //\n            //         anchor\n            //         timestamp                      time horizon    timestamp of change\n            //        =====N=================================H=================|=========>\n            //              ^                                 ^\n            //              |                                 |\n            //              -----------------------------------\n            //                        minimum delay\n            //\n            //   b) It could be fewer than `minimum_delay` seconds away from the anchor timestamp, in which case\n            //      the timestamp of change would become the limiting factor for the time horizon, which would equal\n            //      the timestamp right before the timestamp of change (since by definition the value changes at the\n            //      timestamp of change).\n            //\n            //           anchor                         time horizon\n            //           timestamp   timestamp of change    if not scheduled\n            //        =======N=============|===================H=================>\n            //                ^           ^                     ^\n            //                |     actual horizon              |\n            //                -----------------------------------\n            //                          minimum delay\n            //\n            // Note that the current implementation does not allow the caller to set the timestamp of change to an\n            // arbitrary value, and therefore scenario a) is not currently possible. However implementing #5501 would\n            // allow for this to happen.\n            // Because anchor_timestamp < self.timestamp_of_change, then timestamp_of_change > 0 and we can safely\n            // subtract 1.\n            min(\n                self.timestamp_of_change - 1,\n                anchor_timestamp + minimum_delay,\n            )\n        }\n    }\n\n    /// Mutates the value by scheduling a change at the current timestamp. This function is only meaningful when\n    /// called in public with the current timestamp.\n    pub fn schedule_change(\n        &mut self,\n        new_value: T,\n        current_timestamp: u64,\n        minimum_delay: u64,\n        timestamp_of_change: u64,\n    ) {\n        assert(timestamp_of_change >= current_timestamp + minimum_delay);\n\n        self.pre = self.get_current_at(current_timestamp);\n        self.post = new_value;\n        self.timestamp_of_change = timestamp_of_change;\n    }\n}\n\nimpl<T> Eq for ScheduledValueChange<T>\nwhere\n    T: Eq,\n{\n    fn eq(self, other: Self) -> bool {\n        (self.pre == other.pre)\n            & (self.post == other.post)\n            & (self.timestamp_of_change == other.timestamp_of_change)\n    }\n}\n\nimpl<T> Empty for ScheduledValueChange<T>\nwhere\n    T: Empty,\n{\n    fn empty() -> Self {\n        Self { pre: T::empty(), post: T::empty(), timestamp_of_change: 0 }\n    }\n}\n"
     },
-    "334": {
+    "339": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/hash.nr",
       "source": "mod poseidon2_chunks;\n\nuse crate::{\n    abis::{\n        contract_class_function_leaf_preimage::ContractClassFunctionLeafPreimage,\n        function_selector::FunctionSelector,\n        note_hash::NoteHash,\n        nullifier::Nullifier,\n        private_log::{PrivateLog, PrivateLogData},\n        transaction::tx_request::TxRequest,\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, NULL_MSG_SENDER_CONTRACT_ADDRESS, TWO_POW_64,\n    },\n    merkle_tree::root_from_sibling_path,\n    messaging::l2_to_l1_message::L2ToL1Message,\n    poseidon2::Poseidon2Sponge,\n    side_effect::{Counted, Scoped},\n    traits::{FromField, Hash, ToField},\n    utils::field::{field_from_bytes, field_from_bytes_32_trunc},\n};\n\npub use poseidon2_chunks::poseidon2_absorb_in_chunks_existing_sponge;\nuse poseidon2_chunks::poseidon2_absorb_in_chunks;\nuse std::embedded_curve_ops::EmbeddedCurveScalar;\n\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(note_nonce: Field, siloed_note_hash: Field) -> Field {\n    let inputs = [note_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 note_nonce = compute_note_hash_nonce(first_nullifier, note_index_in_tx);\n    compute_unique_note_hash(note_nonce, siloed_note_hash)\n}\n\npub fn compute_siloed_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: Scoped<Counted<NoteHash>>) -> Field {\n    if note_hash.contract_address.is_zero() {\n        0\n    } else {\n        compute_siloed_note_hash(note_hash.contract_address, note_hash.innermost())\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: Scoped<Counted<Nullifier>>) -> Field {\n    let value = nullifier.innermost().value;\n    // Q: shouldn't we be checking whether the _whole_ nullifier is empty?\n    // A: We don't have to. The init and inner circuits add contract address to non-empty nullifiers.\n    // So we know we should silo it if the contract address is not empty.\n    if nullifier.contract_address.is_zero() {\n        value // Return `value` instead of 0 because an already-siloed nullifier's contract address is zero.\n    } else {\n        compute_siloed_nullifier(nullifier.contract_address, value)\n    }\n}\n\npub fn create_protocol_nullifier(tx_request: TxRequest) -> Scoped<Counted<Nullifier>> {\n    Nullifier { value: tx_request.hash(), note_hash: 0 }.count(1).scope(\n        NULL_MSG_SENDER_CONTRACT_ADDRESS,\n    )\n}\n\npub fn compute_siloed_private_log_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<Counted<PrivateLogData>>) -> PrivateLog {\n    let log = private_log.innermost().log;\n    if private_log.contract_address.is_zero() {\n        log\n    } else {\n        let mut fields = log.fields;\n        fields[0] = compute_siloed_private_log_field(private_log.contract_address, fields[0]);\n        PrivateLog::new(fields, log.length)\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 compute_app_secret_key(\n    master_secret_key: EmbeddedCurveScalar,\n    app_address: AztecAddress,\n    app_secret_generator: Field,\n) -> Field {\n    poseidon2_hash_with_separator(\n        [master_secret_key.hi, master_secret_key.lo, app_address.to_field()],\n        app_secret_generator,\n    )\n}\n\npub fn merkle_hash(left: Field, right: Field) -> Field {\n    poseidon2_hash([left, right])\n}\n\npub fn compute_l2_to_l1_hash(\n    contract_address: AztecAddress,\n    recipient: EthAddress,\n    content: Field,\n    rollup_version_id: Field,\n    chain_id: Field,\n) -> Field {\n    let contract_address_bytes: [u8; 32] = contract_address.to_field().to_be_bytes();\n    let recipient_bytes: [u8; 20] = recipient.to_be_bytes();\n    let content_bytes: [u8; 32] = content.to_be_bytes();\n    let rollup_version_id_bytes: [u8; 32] = rollup_version_id.to_be_bytes();\n    let chain_id_bytes: [u8; 32] = chain_id.to_be_bytes();\n\n    let mut bytes: [u8; 148] = std::mem::zeroed();\n    for i in 0..32 {\n        bytes[i] = contract_address_bytes[i];\n        bytes[i + 32] = rollup_version_id_bytes[i];\n        // 64 - 84 are for recipient.\n        bytes[i + 84] = chain_id_bytes[i];\n        bytes[i + 116] = content_bytes[i];\n    }\n\n    for i in 0..20 {\n        bytes[64 + i] = recipient_bytes[i];\n    }\n\n    sha256_to_field(bytes)\n}\n\npub fn silo_l2_to_l1_message(\n    msg: Scoped<L2ToL1Message>,\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.inner.recipient,\n            msg.inner.content,\n            rollup_version_id,\n            chain_id,\n        )\n    }\n}\n\n/// Computes sha256 hash of 2 input fields.\n///\n/// @returns A truncated field (i.e., the first byte is always 0).\npub fn accumulate_sha256(v0: Field, v1: Field) -> Field {\n    // Concatenate two fields into 32 x 2 = 64 bytes\n    let v0_as_bytes: [u8; 32] = v0.to_be_bytes();\n    let v1_as_bytes: [u8; 32] = v1.to_be_bytes();\n    let hash_input_flattened = v0_as_bytes.concat(v1_as_bytes);\n\n    sha256_to_field(hash_input_flattened)\n}\n\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 = [separator.to_field()].concat(inputs);\n    poseidon2_hash(inputs_with_separator)\n}\n\n/// Computes a Poseidon2 hash over a dynamic-length subarray of the given input.\n/// Only the first `in_len` fields of `input` are absorbed; any remaining fields are ignored.\n/// The caller is responsible for ensuring that the input is padded with zeros if required.\n#[no_predicates]\npub fn poseidon2_hash_subarray<let N: u32>(input: [Field; N], in_len: u32) -> Field {\n    let mut sponge = poseidon2_absorb_in_chunks(input, in_len);\n    sponge.squeeze()\n}\n\n// 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_in_chunks(input, in_len);\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// This function is  unconstrained because it is intended to be used in unconstrained context only as\n// in constrained contexts it would be too inefficient.\npub unconstrained fn poseidon2_hash_with_separator_bounded_vec<let N: u32, T>(\n    inputs: BoundedVec<Field, N>,\n    separator: T,\n) -> Field\nwhere\n    T: ToField,\n{\n    let in_len = inputs.len() + 1;\n    let iv: Field = (in_len as Field) * TWO_POW_64;\n    let mut sponge = Poseidon2Sponge::new(iv);\n    sponge.absorb(separator.to_field());\n\n    for i in 0..inputs.len() {\n        sponge.absorb(inputs.get(i));\n    }\n\n    sponge.squeeze()\n}\n\n#[no_predicates]\npub fn poseidon2_hash_bytes<let N: u32>(inputs: [u8; N]) -> Field {\n    let mut fields = [0; (N + 30) / 31];\n    let mut field_index = 0;\n    let mut current_field = [0; 31];\n    for i in 0..inputs.len() {\n        let index = i % 31;\n        current_field[index] = inputs[i];\n        if index == 30 {\n            fields[field_index] = field_from_bytes(current_field, false);\n            current_field = [0; 31];\n            field_index += 1;\n        }\n    }\n    if field_index != fields.len() {\n        fields[field_index] = field_from_bytes(current_field, false);\n    }\n    poseidon2_hash(fields)\n}\n\n#[test]\nfn 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 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 == 0x3b18c58c739716e76429634a61375c45b3b5cd470c22ab6d3e14cee23dd992);\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 == 0xaab2a5828156782b12a1dc6f336e2bc627eb1b9514b02d511f66296990c050);\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        L2ToL1Message { recipient: EthAddress::from_field(1), content: 2 }.scope(\n            AztecAddress::from_field(3),\n        ),\n        version,\n        chainId,\n    );\n\n    // The following value was generated by `yarn-project/stdlib/src/hash/hash.test.ts`\n    let hash_from_typescript = 0x0081edf209e087ad31b3fd24263698723d57190bd1d6e9fe056fc0c0a68ee661;\n\n    assert_eq(hash, hash_from_typescript);\n}\n\n#[test]\nunconstrained fn poseidon2_hash_with_separator_bounded_vec_matches_non_bounded_vec_version() {\n    let inputs = BoundedVec::<Field, 4>::from_array([1, 2, 3]);\n    let separator = 42;\n\n    // Hash using bounded vec version\n    let bounded_result = poseidon2_hash_with_separator_bounded_vec(inputs, separator);\n\n    // Hash using regular version\n    let regular_result = poseidon2_hash_with_separator([1, 2, 3], separator);\n\n    // Results should match\n    assert_eq(bounded_result, regular_result);\n}\n"
     },
-    "347": {
+    "352": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/meta/mod.nr",
       "source": "use utils::derive_serialization_quotes;\n\npub mod utils;\n\n/// Generates the generic parameter declarations for a struct's trait implementation.\n///\n/// This function takes a struct type definition and generates the generic parameter declarations\n/// that go after the `impl` keyword. For example, given a struct with generics `N: u32` and `T`,\n/// it generates `<let N: u32, T>`.\n///\n/// # Parameters\n/// - `s`: The struct type definition to generate generic declarations for\n///\n/// # Returns\n/// A quoted code block containing the generic parameter declarations, or an empty quote if the struct\n/// has no generic parameters\n///\n/// # Example\n/// For a struct defined as:\n/// ```\n/// struct Container<T, let N: u32> {\n///     items: [T; N],\n///     count: u32\n/// }\n/// ```\n///\n/// This function generates:\n/// ```\n/// <let N: u32, T>\n/// ```\ncomptime fn get_generics_declarations(s: TypeDefinition) -> Quoted {\n    let generics = s.generics();\n\n    if generics.len() > 0 {\n        let generics_declarations_items = generics\n            .map(|(name, maybe_integer_typ)| {\n                // The second item in the generics tuple is an Option of an integer type that is Some only if\n                // the generic is numeric.\n                if maybe_integer_typ.is_some() {\n                    // The generic is numeric, so we return a quote defined as e.g. \"let N: u32\"\n                    let integer_type = maybe_integer_typ.unwrap();\n                    quote {let $name: $integer_type}\n                } else {\n                    // The generic is not numeric, so we return a quote containing the name of the generic (e.g. \"T\")\n                    quote {$name}\n                }\n            })\n            .join(quote {,});\n        quote {<$generics_declarations_items>}\n    } else {\n        // The struct doesn't have any generics defined, so we just return an empty quote.\n        quote {}\n    }\n}\n\n/// Generates the `where` clause for a trait implementation that constrains non-numeric generic type parameters.\n///\n/// This function takes a struct type definition and a trait name, and generates a `where` clause that\n/// requires all non-numeric generic type parameters to implement the specified trait.\n///\n/// # Parameters\n/// - `s`: The struct type definition to generate the where clause for\n/// - `trait_name`: The name of the trait that non-numeric generic parameters must implement\n///\n/// # Returns\n/// A quoted code block containing the where clause, or an empty quote if the struct has no non-numeric\n/// generic parameters\n///\n/// # Example\n/// For a struct defined as:\n/// ```\n/// struct Container<T, let N: u32> {\n///     items: [T; N],\n///     count: u32\n/// }\n/// ```\n///\n/// And trait name \"Serialize\", this function generates:\n/// ```\n/// where T: Serialize\n/// ```\ncomptime fn get_where_trait_clause(s: TypeDefinition, trait_name: Quoted) -> Quoted {\n    let generics = s.generics();\n\n    // The second item in the generics tuple is an Option of an integer type that is Some only if the generic is\n    // numeric.\n    let non_numeric_generics =\n        generics.filter(|(_, maybe_integer_typ)| maybe_integer_typ.is_none());\n\n    if non_numeric_generics.len() > 0 {\n        let non_numeric_generics_declarations =\n            non_numeric_generics.map(|(name, _)| quote {$name: $trait_name}).join(quote {,});\n        quote {where $non_numeric_generics_declarations}\n    } else {\n        // There are no non-numeric generics, so we return an empty quote.\n        quote {}\n    }\n}\n\n/// Generates a `Serialize` trait implementation for a struct type.\n///\n/// # Parameters\n/// - `s`: The struct type definition to generate the implementation for\n///\n/// # Returns\n/// A quoted code block containing the trait implementation\n///\n/// # Example\n/// For a struct defined as:\n/// ```\n/// struct Log<N> {\n///     fields: [Field; N],\n///     length: u32\n/// }\n/// ```\n///\n/// This function generates code equivalent to:\n/// ```\n/// impl<let N: u32> Serialize for Log<N> {\n///     let N: u32 = <[Field; N] as Serialize>::N + <u32 as Serialize>::N;\n///\n///     #[inline_always]\n///     fn serialize(self) -> [Field; Self::N] {\n///         let mut serialized_params = [0; _];\n///         let mut offset = 0;\n///\n///         let serialized_member = Serialize::serialize(self.fields);\n///         let serialized_member_len = <[Field; N] as Serialize>::N;\n///         for i in 0..serialized_member_len {\n///             serialized_params[i + offset] = serialized_member[i];\n///         }\n///         offset += serialized_member_len;\n///\n///         let serialized_member = Serialize::serialize(self.length);\n///         let serialized_member_len = <u32 as Serialize>::N;\n///         for i in 0..serialized_member_len {\n///             serialized_params[i + offset] = serialized_member[i];\n///         }\n///         offset += serialized_member_len;\n///\n///         serialized_params\n///     }\n/// }\n/// ```\npub comptime fn derive_serialize(s: TypeDefinition) -> Quoted {\n    let typ = s.as_type();\n    let nested_struct = typ.as_data_type().unwrap();\n\n    // We care only about the name and type so we drop the last item of the tuple\n    let params = nested_struct.0.fields(nested_struct.1).map(|(name, typ, _)| (name, typ));\n\n    // Generates the generic parameter declarations (to be placed after the `impl` keyword) and the `where` clause\n    // for the `Serialize` trait.\n    let generics_declarations = get_generics_declarations(s);\n    let where_serialize_clause = get_where_trait_clause(s, quote {Serialize});\n\n    let (function_body, params_len_quote, serialized_params_name) =\n        derive_serialization_quotes(params, true);\n\n    quote {\n        impl$generics_declarations $crate::traits::Serialize for $typ\n            $where_serialize_clause\n        {\n            let N: u32 = $params_len_quote;\n\n            #[inline_always]\n            fn serialize(self) -> [Field; Self::N] {\n                $function_body\n\n                $serialized_params_name\n            }\n        }\n    }\n}\n\n/// Generates a `Deserialize` trait implementation for a given struct `s`.\n///\n/// # Arguments\n/// * `s` - The struct type definition to generate the implementation for\n///\n/// # Returns\n/// A `Quoted` block containing the generated trait implementation\n///\n/// # Requirements\n/// Each struct member type must implement the `Deserialize` trait (it gets used in the generated code).\n///\n/// # Example\n/// For a struct like:\n/// ```\n/// struct MyStruct {\n///     x: AztecAddress,\n///     y: Field,\n/// }\n/// ```\n///\n/// This generates:\n/// ```\n/// impl Deserialize for MyStruct {\n///     let N: u32 = <AztecAddress as Deserialize>::N + <Field as Deserialize>::N;\n///\n///     fn deserialize(serialized: [Field; Self::N]) -> Self {\n///         let mut offset = 0;\n///         let mut member_fields = [0; <AztecAddress as Deserialize>::N];\n///         for i in 0..<AztecAddress as Deserialize>::N {\n///             member_fields[i] = serialized[i + offset];\n///         }\n///         let x = <AztecAddress as Deserialize>::deserialize(member_fields);\n///         offset += <AztecAddress as Deserialize>::N;\n///\n///         let mut member_fields = [0; <Field as Deserialize>::N];\n///         for i in 0..<Field as Deserialize>::N {\n///             member_fields[i] = serialized[i + offset];\n///         }\n///         let y = <Field as Deserialize>::deserialize(member_fields);\n///         offset += <Field as Deserialize>::N;\n///\n///         Self { x, y }\n///     }\n/// }\n/// ```\npub(crate) comptime fn derive_deserialize(s: TypeDefinition) -> Quoted {\n    let typ = s.as_type();\n    let nested_struct = typ.as_data_type().unwrap();\n    let params = nested_struct.0.fields(nested_struct.1);\n\n    // Generates the generic parameter declarations (to be placed after the `impl` keyword) and the `where` clause\n    // for the `Deserialize` trait.\n    let generics_declarations = get_generics_declarations(s);\n    let where_deserialize_clause = get_where_trait_clause(s, quote {Deserialize});\n\n    // The following will give us:\n    // <type_of_struct_member_1 as Deserialize>::N + <type_of_struct_member_2 as Deserialize>::N + ...\n    // (or 0 if the struct has no members)\n    let right_hand_side_of_definition_of_n = if params.len() > 0 {\n        params\n            .map(|(_, param_type, _): (Quoted, Type, Quoted)| {\n                quote {\n            <$param_type as $crate::traits::Deserialize>::N\n        }\n            })\n            .join(quote {+})\n    } else {\n        quote {0}\n    };\n\n    // For structs containing a single member, we can enhance performance by directly deserializing the input array,\n    // bypassing the need for loop-based array construction. While this optimization yields significant benefits in\n    // Brillig where the loops are expected to not be optimized, it is not relevant in ACIR where the loops are\n    // expected to be optimized away.\n    let function_body = if params.len() > 1 {\n        // This generates deserialization code for each struct member and concatenates them together.\n        let deserialization_of_struct_members = params\n            .map(|(param_name, param_type, _): (Quoted, Type, Quoted)| {\n                quote {\n                    let mut member_fields = [0; <$param_type as Deserialize>::N];\n                    for i in 0..<$param_type as Deserialize>::N {\n                        member_fields[i] = serialized[i + offset];\n                    }\n                    let $param_name = <$param_type as Deserialize>::deserialize(member_fields);\n                    offset += <$param_type as Deserialize>::N;\n                }\n            })\n            .join(quote {});\n\n        // We join the struct member names with a comma to be used in the `Self { ... }` syntax\n        // This will give us e.g. `a, b, c` for a struct with three fields named `a`, `b`, and `c`.\n        let struct_members = params\n            .map(|(param_name, _, _): (Quoted, Type, Quoted)| quote { $param_name })\n            .join(quote {,});\n\n        quote {\n            let mut offset = 0;\n\n            $deserialization_of_struct_members\n\n            Self { $struct_members }\n        }\n    } else if params.len() == 1 {\n        let param_name = params[0].0;\n        quote {\n            Self { $param_name: $crate::traits::Deserialize::deserialize(serialized) }\n        }\n    } else {\n        quote {\n            Self {}\n        }\n    };\n\n    quote {\n        impl$generics_declarations $crate::traits::Deserialize for $typ\n            $where_deserialize_clause\n        {\n            let N: u32 = $right_hand_side_of_definition_of_n;\n\n            #[inline_always]\n            fn deserialize(serialized: [Field; Self::N]) -> Self {\n                $function_body\n            }\n        }\n    }\n}\n\n/// Generates a `Packable` trait implementation for a given struct `s`.\n///\n/// # Arguments\n/// * `s` - The struct type definition to generate the implementation for\n///\n/// # Returns\n/// A `Quoted` block containing the generated trait implementation\n///\n/// # Requirements\n/// Each struct member type must implement the `Packable` trait (it gets used in the generated code).\n///\n/// # Example\n/// For a struct like:\n/// ```\n/// struct MyStruct {\n///     x: AztecAddress,\n///     y: Field,\n/// }\n/// ```\n///\n/// This generates:\n/// ```\n/// impl Packable for MyStruct {\n///     let N: u32 = 2;\n///\n///     fn pack(self) -> [Field; 2] {\n///         let mut result: [Field; 2] = [0_Field; 2];\n///         let mut offset: u32 = 0_u32;\n///         let packed_member: [Field; 1] = self.x.pack();\n///         let packed_member_len: u32 = <Field as Packable>::N;\n///         for i in 0_u32..packed_member_len {\n///             {\n///                 result[i + offset] = packed_member[i];\n///             }\n///         }\n///         offset = offset + packed_member_len;\n///         let packed_member: [Field; 1] = self.y.pack();\n///         let packed_member_len: u32 = <Field as Packable>::N;\n///         for i in 0_u32..packed_member_len {\n///             {\n///                 result[i + offset] = packed_member[i];\n///             }\n///         }\n///         offset = offset + packed_member_len;\n///         result\n///     }\n///\n///     fn unpack(packed: [Field; 2]) -> Self {\n///         let mut offset: u32 = 0_u32;\n///         let mut member_fields: [Field; 1] = [0_Field; 1];\n///         for i in 0_u32..<AztecAddress as Packable>::N {\n///             member_fields[i] = packed[i + offset];\n///         }\n///         let x: AztecAddress = <AztecAddress as Packable>::unpack(member_fields);\n///         offset = offset + <AztecAddress as Packable>::N;\n///         let mut member_fields: [Field; 1] = [0_Field; 1];\n///         for i in 0_u32..<Field as Packable>::N {\n///             member_fields[i] = packed[i + offset];\n///         }\n///         let y: Field = <Field as Packable>::unpack(member_fields);\n///         offset = offset + <Field as Packable>::N;\n///         Self { x: x, y: y }\n///     }\n/// }\n/// ```\npub comptime fn derive_packable(s: TypeDefinition) -> Quoted {\n    let typ = s.as_type();\n    let nested_struct = typ.as_data_type().unwrap();\n    let params = nested_struct.0.fields(nested_struct.1);\n\n    // Generates the generic parameter declarations (to be placed after the `impl` keyword) and the `where` clause\n    // for the `Packable` trait.\n    let generics_declarations = get_generics_declarations(s);\n    let where_packable_clause = get_where_trait_clause(s, quote {Packable});\n\n    // The following will give us:\n    // <type_of_struct_member_1 as Packable>::N + <type_of_struct_member_2 as Packable>::N + ...\n    // (or 0 if the struct has no members)\n    let right_hand_side_of_definition_of_n = if params.len() > 0 {\n        params\n            .map(|(_, param_type, _): (Quoted, Type, Quoted)| {\n                quote {\n            <$param_type as $crate::traits::Packable>::N\n        }\n            })\n            .join(quote {+})\n    } else {\n        quote {0}\n    };\n\n    // For structs containing a single member, we can enhance performance by directly returning the packed member,\n    // bypassing the need for loop-based array construction. While this optimization yields significant benefits in\n    // Brillig where the loops are expected to not be optimized, it is not relevant in ACIR where the loops are\n    // expected to be optimized away.\n    let pack_function_body = if params.len() > 1 {\n        // For multiple struct members, generate packing code that:\n        // 1. Packs each member\n        // 2. Copies the packed fields into the result array at the correct offset\n        // 3. Updates the offset for the next member\n        let packing_of_struct_members = params\n            .map(|(param_name, param_type, _): (Quoted, Type, Quoted)| {\n                quote {\n                    let packed_member = $crate::traits::Packable::pack(self.$param_name);\n                    let packed_member_len = <$param_type as $crate::traits::Packable>::N;\n                    for i in 0..packed_member_len {\n                        result[i + offset] = packed_member[i];\n                    }\n                    offset += packed_member_len;\n                }\n            })\n            .join(quote {});\n\n        quote {\n            let mut result = [0; Self::N];\n            let mut offset = 0;\n\n            $packing_of_struct_members\n\n            result\n        }\n    } else if params.len() == 1 {\n        let param_name = params[0].0;\n        quote {\n            $crate::traits::Packable::pack(self.$param_name)\n        }\n    } else {\n        quote {\n            [0; Self::N]\n        }\n    };\n\n    // For structs containing a single member, we can enhance performance by directly unpacking the input array,\n    // bypassing the need for loop-based array construction. While this optimization yields significant benefits in\n    // Brillig where the loops are expected to not be optimized, it is not relevant in ACIR where the loops are\n    // expected to be optimized away.\n    let unpack_function_body = if params.len() > 1 {\n        // For multiple struct members, generate unpacking code that:\n        // 1. Unpacks each member\n        // 2. Copies packed fields into member array at correct offset\n        // 3. Updates offset for next member\n        let unpacking_of_struct_members = params\n            .map(|(param_name, param_type, _): (Quoted, Type, Quoted)| {\n                quote {\n                    let mut member_fields = [0; <$param_type as $crate::traits::Packable>::N];\n                    for i in 0..<$param_type as $crate::traits::Packable>::N {\n                        member_fields[i] = packed[i + offset];\n                    }\n                    let $param_name = <$param_type as $crate::traits::Packable>::unpack(member_fields);\n                    offset += <$param_type as $crate::traits::Packable>::N;\n                }\n            })\n            .join(quote {});\n\n        // We join the struct member names with a comma to be used in the `Self { ... }` syntax\n        let struct_members = params\n            .map(|(param_name, _, _): (Quoted, Type, Quoted)| quote { $param_name })\n            .join(quote {,});\n\n        quote {\n            let mut offset = 0;\n            $unpacking_of_struct_members\n            Self { $struct_members }\n        }\n    } else if params.len() == 1 {\n        let param_name = params[0].0;\n        quote {\n            Self { $param_name: $crate::traits::Packable::unpack(packed) }\n        }\n    } else {\n        quote {\n            Self {}\n        }\n    };\n\n    quote {\n        impl$generics_declarations $crate::traits::Packable for $typ\n            $where_packable_clause\n        {\n            let N: u32 = $right_hand_side_of_definition_of_n;\n\n            #[inline_always]\n            fn pack(self) -> [Field; Self::N] {\n                $pack_function_body\n            }\n\n            #[inline_always]\n            fn unpack(packed: [Field; Self::N]) -> Self {\n                $unpack_function_body\n            }\n        }\n    }\n}\n\nmod test {\n    use crate::traits::{Deserialize, Packable, Serialize};\n\n    #[derive(Deserialize, Eq, Packable, Serialize)]\n    pub struct Empty {}\n\n    #[derive(Deserialize, Eq, Packable, Serialize)]\n    pub struct Smol {\n        a: Field,\n        b: Field,\n    }\n\n    #[derive(Deserialize, Eq, Serialize)]\n    pub struct HasArray {\n        a: [Field; 2],\n        b: bool,\n    }\n\n    #[derive(Deserialize, Eq, Serialize)]\n    pub struct Fancier {\n        a: Smol,\n        b: [Field; 2],\n        c: [u8; 3],\n        d: str<16>,\n    }\n\n    #[derive(Deserialize, Eq, Packable, Serialize)]\n    pub struct HasArrayWithGenerics<T, let N: u32> {\n        pub fields: [T; N],\n        pub length: u32,\n    }\n\n    #[test]\n    fn serde_on_empty() {\n        let original = Empty {};\n        let serialized = original.serialize();\n        assert_eq(serialized, [], \"Serialized does not match empty array\");\n        let deserialized = Empty::deserialize(serialized);\n        assert_eq(deserialized, original, \"Deserialized does not match original\");\n    }\n\n    #[test]\n    fn packable_on_empty() {\n        let original = Empty {};\n        let packed = original.pack();\n        assert_eq(packed, [], \"Packed does not match empty array\");\n        let unpacked = Empty::unpack(packed);\n        assert_eq(unpacked, original, \"Unpacked does not match original\");\n    }\n\n    #[test]\n    fn serde_on_smol() {\n        let smol = Smol { a: 1, b: 2 };\n        let serialized = smol.serialize();\n        assert(serialized == [1, 2], serialized);\n        let deserialized = Smol::deserialize(serialized);\n        assert(deserialized == smol);\n\n        // None of the struct members implements the `Packable` trait so the packed and serialized data should be the same\n        let packed = smol.pack();\n        assert_eq(packed, serialized, \"Packed does not match serialized\");\n    }\n\n    #[test]\n    fn serde_on_has_array() {\n        let has_array = HasArray { a: [1, 2], b: true };\n        let serialized = has_array.serialize();\n        assert(serialized == [1, 2, 1], serialized);\n        let deserialized = HasArray::deserialize(serialized);\n        assert(deserialized == has_array);\n    }\n\n    #[test]\n    fn serde_on_fancier() {\n        let fancier =\n            Fancier { a: Smol { a: 1, b: 2 }, b: [0, 1], c: [1, 2, 3], d: \"metaprogramming!\" };\n        let serialized = fancier.serialize();\n        assert(\n            serialized\n                == [\n                    1, 2, 0, 1, 1, 2, 3, 0x6d, 0x65, 0x74, 0x61, 0x70, 0x72, 0x6f, 0x67, 0x72, 0x61,\n                    0x6d, 0x6d, 0x69, 0x6e, 0x67, 0x21,\n                ],\n            serialized,\n        );\n        let deserialized = Fancier::deserialize(serialized);\n        assert(deserialized == fancier);\n    }\n\n    #[test]\n    fn serde_on_contains_array_with_generics() {\n        let struct_with_array_of_generics = HasArrayWithGenerics { fields: [1, 2, 3], length: 3 };\n        let serialized = struct_with_array_of_generics.serialize();\n        assert(serialized == [1, 2, 3, 3], serialized);\n        let deserialized = HasArrayWithGenerics::deserialize(serialized);\n        assert(deserialized == struct_with_array_of_generics);\n    }\n\n    #[test]\n    fn packable_on_contains_array_with_generics() {\n        let struct_with_array_of_generics = HasArrayWithGenerics { fields: [1, 2, 3], length: 3 };\n        let packed = struct_with_array_of_generics.pack();\n        assert(packed == [1, 2, 3, 3], packed);\n\n        let unpacked = HasArrayWithGenerics::unpack(packed);\n        assert(unpacked == struct_with_array_of_generics);\n    }\n\n}\n"
     },
-    "348": {
+    "353": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/meta/utils.nr",
       "source": "/// Generates serialization code for a list of parameters and the total length of the serialized array\n///\n/// # Parameters\n/// - `params`: A list of (name, type) tuples to serialize\n/// - `use_self_prefix`: If true, parameters are accessed as `self.$param_name` (for struct members).\n///                      If false, parameters are accessed directly as `$param_name` (for function parameters).\n///\n/// # Returns\n/// A tuple containing:\n/// - Quoted code that serializes the parameters into an array named `serialized_params`\n/// - Quoted code that evaluates to the total length of the serialized array\n/// - Quoted code containing the name of the serialized array\npub comptime fn derive_serialization_quotes(\n    params: [(Quoted, Type)],\n    use_self_prefix: bool,\n) -> (Quoted, Quoted, Quoted) {\n    let prefix_quote = if use_self_prefix {\n        quote { self. }\n    } else {\n        quote {}\n    };\n\n    let params_len_quote = get_params_len_quote(params);\n    let serialized_params_name = quote { serialized_params };\n\n    let body = if params.len() == 0 {\n        quote {\n            let $serialized_params_name: [Field; 0] = [];\n        }\n    } else if params.len() == 1 {\n        // When we have only a single parameter on the input, we can enhance performance by directly returning\n        // the serialized member, bypassing the need for loop-based array construction. While this optimization yields\n        // significant benefits in Brillig where the loops are expected to not be optimized, it is not relevant in ACIR\n        // where the loops are expected to be optimized away.\n\n        let param_name = params[0].0;\n        quote {\n            let $serialized_params_name = $crate::traits::Serialize::serialize($prefix_quote$param_name);\n        }\n    } else {\n        // For multiple struct members, generate serialization code that:\n        // 1. Serializes each member\n        // 2. Copies the serialized fields into the serialize array at the correct offset\n        // 3. Updates the offset for the next member\n        let serialization_of_struct_members = params\n            .map(|(param_name, param_type): (Quoted, Type)| {\n                quote {\n                let serialized_member = $crate::traits::Serialize::serialize($prefix_quote$param_name);\n                let serialized_member_len = <$param_type as $crate::traits::Serialize>::N;\n                for i in 0..serialized_member_len {\n                    $serialized_params_name[i + offset] = serialized_member[i];\n                }\n                offset += serialized_member_len;\n            }\n            })\n            .join(quote {});\n\n        quote {\n            let mut $serialized_params_name = [0; $params_len_quote];\n            let mut offset = 0;\n\n            $serialization_of_struct_members\n        }\n    };\n\n    (body, params_len_quote, serialized_params_name)\n}\n\n/// Generates a quoted expression that computes the total serialized length of function parameters.\n///\n/// # Parameters\n/// * `params` - An array of tuples where each tuple contains a quoted parameter name and its Type. The type needs\n///              to implement the Serialize trait.\n///\n/// # Returns\n/// A quoted expression that evaluates to:\n/// * `0` if there are no parameters\n/// * `(<type1 as Serialize>::N + <type2 as Serialize>::N + ...)` for one or more parameters\npub comptime fn get_params_len_quote(params: [(Quoted, Type)]) -> Quoted {\n    if params.len() == 0 {\n        quote { 0 }\n    } else {\n        let params_quote_without_parentheses = params\n            .map(|(_, param_type): (Quoted, Type)| {\n                quote {\n                    <$param_type as $crate::traits::Serialize>::N\n                }\n            })\n            .join(quote {+});\n        quote { ($params_quote_without_parentheses) }\n    }\n}\n"
     },
-    "350": {
+    "355": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/poseidon2.nr",
       "source": "use crate::constants::TWO_POW_64;\nuse crate::traits::{Deserialize, Serialize};\nuse std::meta::derive;\n// NB: This is a clone of noir/noir-repo/noir_stdlib/src/hash/poseidon2.nr\n// It exists as we sometimes need to perform custom absorption, but the stdlib version\n// has a private absorb() method (it's also designed to just be a hasher)\n// Can be removed when standalone noir poseidon lib exists: See noir#6679\n\ncomptime global RATE: u32 = 3;\n\n#[derive(Deserialize, Eq, Serialize)]\npub struct Poseidon2Sponge {\n    pub cache: [Field; 3],\n    pub state: [Field; 4],\n    pub cache_size: u32,\n    pub squeeze_mode: bool, // 0 => absorb, 1 => squeeze\n}\n\nimpl Poseidon2Sponge {\n    #[no_predicates]\n    pub fn hash<let N: u32>(input: [Field; N], message_size: u32) -> Field {\n        Poseidon2Sponge::hash_internal(input, message_size, message_size != N)\n    }\n\n    pub(crate) fn new(iv: Field) -> Poseidon2Sponge {\n        let mut result =\n            Poseidon2Sponge { cache: [0; 3], state: [0; 4], cache_size: 0, squeeze_mode: false };\n        result.state[RATE] = iv;\n        result\n    }\n\n    fn perform_duplex(&mut self) {\n        // add the cache into sponge state\n        for i in 0..RATE {\n            // We effectively zero-pad the cache by only adding to the state\n            // cache that is less than the specified `cache_size`\n            if i < self.cache_size {\n                self.state[i] += self.cache[i];\n            }\n        }\n        self.state = std::hash::poseidon2_permutation(self.state, 4);\n    }\n\n    pub fn absorb(&mut self, input: Field) {\n        assert(!self.squeeze_mode);\n        if self.cache_size == RATE {\n            // If we're absorbing, and the cache is full, apply the sponge permutation to compress the cache\n            self.perform_duplex();\n            self.cache[0] = input;\n            self.cache_size = 1;\n        } else {\n            // If we're absorbing, and the cache is not full, add the input into the cache\n            self.cache[self.cache_size] = input;\n            self.cache_size += 1;\n        }\n    }\n\n    pub fn squeeze(&mut self) -> Field {\n        assert(!self.squeeze_mode);\n        // If we're in absorb mode, apply sponge permutation to compress the cache.\n        self.perform_duplex();\n        self.squeeze_mode = true;\n\n        // Pop one item off the top of the permutation and return it.\n        self.state[0]\n    }\n\n    fn hash_internal<let N: u32>(\n        input: [Field; N],\n        in_len: u32,\n        is_variable_length: bool,\n    ) -> Field {\n        let iv: Field = (in_len as Field) * TWO_POW_64;\n        let mut sponge = Poseidon2Sponge::new(iv);\n        for i in 0..input.len() {\n            if i < in_len {\n                sponge.absorb(input[i]);\n            }\n        }\n\n        // 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"
     },
-    "357": {
+    "362": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/public_keys.nr",
       "source": "use crate::{\n    address::public_keys_hash::PublicKeysHash,\n    constants::{\n        DEFAULT_IVPK_M_X, DEFAULT_IVPK_M_Y, DEFAULT_NPK_M_X, DEFAULT_NPK_M_Y, DEFAULT_OVPK_M_X,\n        DEFAULT_OVPK_M_Y, DEFAULT_TPK_M_X, DEFAULT_TPK_M_Y, GENERATOR_INDEX__PUBLIC_KEYS_HASH,\n    },\n    hash::poseidon2_hash_with_separator,\n    traits::{Deserialize, Hash, Serialize},\n};\n\nuse dep::std::embedded_curve_ops::EmbeddedCurvePoint as Point;\nuse std::{default::Default, meta::derive};\n\npub trait ToPoint {\n    fn to_point(self) -> Point;\n}\n\n#[derive(Deserialize, Eq, Serialize)]\npub struct NpkM {\n    pub inner: Point,\n}\n\nimpl ToPoint for NpkM {\n    fn to_point(self) -> Point {\n        self.inner\n    }\n}\n\n// Note: If we store npk_m_hash directly we can remove this trait implementation. See #8091\nimpl Hash for NpkM {\n    fn hash(self) -> Field {\n        self.inner.hash()\n    }\n}\n\n#[derive(Deserialize, Eq, Serialize)]\npub struct IvpkM {\n    pub inner: Point,\n}\n\nimpl ToPoint for IvpkM {\n    fn to_point(self) -> Point {\n        self.inner\n    }\n}\n\n#[derive(Deserialize, Eq, Serialize)]\npub struct OvpkM {\n    pub inner: Point,\n}\n\nimpl Hash for OvpkM {\n    fn hash(self) -> Field {\n        self.inner.hash()\n    }\n}\n\nimpl ToPoint for OvpkM {\n    fn to_point(self) -> Point {\n        self.inner\n    }\n}\n\n#[derive(Deserialize, Eq, Serialize)]\npub struct TpkM {\n    pub inner: Point,\n}\n\nimpl ToPoint for TpkM {\n    fn to_point(self) -> Point {\n        self.inner\n    }\n}\n\n#[derive(Deserialize, Eq, Serialize)]\npub struct PublicKeys {\n    pub npk_m: NpkM,\n    pub ivpk_m: IvpkM,\n    pub ovpk_m: OvpkM,\n    pub tpk_m: TpkM,\n}\n\nimpl Default for PublicKeys {\n    fn default() -> Self {\n        PublicKeys {\n            npk_m: NpkM {\n                inner: Point { x: DEFAULT_NPK_M_X, y: DEFAULT_NPK_M_Y, is_infinite: false },\n            },\n            ivpk_m: IvpkM {\n                inner: Point { x: DEFAULT_IVPK_M_X, y: DEFAULT_IVPK_M_Y, is_infinite: false },\n            },\n            ovpk_m: OvpkM {\n                inner: Point { x: DEFAULT_OVPK_M_X, y: DEFAULT_OVPK_M_Y, is_infinite: false },\n            },\n            tpk_m: TpkM {\n                inner: Point { x: DEFAULT_TPK_M_X, y: DEFAULT_TPK_M_Y, is_infinite: false },\n            },\n        }\n    }\n}\n\nimpl PublicKeys {\n    pub fn hash(self) -> PublicKeysHash {\n        PublicKeysHash::from_field(poseidon2_hash_with_separator(\n            self.serialize(),\n            GENERATOR_INDEX__PUBLIC_KEYS_HASH as Field,\n        ))\n    }\n}\n\npub struct AddressPoint {\n    pub inner: Point,\n}\n\nimpl ToPoint for AddressPoint {\n    fn to_point(self) -> Point {\n        self.inner\n    }\n}\n\nmod test {\n    use crate::{\n        point::POINT_LENGTH,\n        public_keys::{IvpkM, NpkM, OvpkM, PublicKeys, TpkM},\n        traits::{Deserialize, Serialize},\n    };\n    use dep::std::embedded_curve_ops::EmbeddedCurvePoint as Point;\n\n    #[test]\n    unconstrained fn compute_public_keys_hash() {\n        let keys = PublicKeys {\n            npk_m: NpkM { inner: Point { x: 1, y: 2, is_infinite: false } },\n            ivpk_m: IvpkM { inner: Point { x: 3, y: 4, is_infinite: false } },\n            ovpk_m: OvpkM { inner: Point { x: 5, y: 6, is_infinite: false } },\n            tpk_m: TpkM { inner: Point { x: 7, y: 8, is_infinite: false } },\n        };\n\n        let actual = keys.hash();\n        let expected_public_keys_hash =\n            0x0fecd9a32db731fec1fded1b9ff957a1625c069245a3613a2538bd527068b0ad;\n\n        assert(actual.to_field() == expected_public_keys_hash);\n    }\n\n    #[test]\n    unconstrained fn compute_default_hash() {\n        let keys = PublicKeys::default();\n\n        let actual = keys.hash();\n        let test_data_default_hash =\n            0x1d3bf1fb93ae0e9cda83b203dd91c3bfb492a9aecf30ec90e1057eced0f0e62d;\n\n        assert(actual.to_field() == test_data_default_hash);\n    }\n\n    #[test]\n    unconstrained fn serde() {\n        let keys = PublicKeys {\n            npk_m: NpkM { inner: Point { x: 1, y: 2, is_infinite: false } },\n            ivpk_m: IvpkM { inner: Point { x: 3, y: 4, is_infinite: false } },\n            ovpk_m: OvpkM { inner: Point { x: 5, y: 6, is_infinite: false } },\n            tpk_m: TpkM { inner: Point { x: 7, y: 8, is_infinite: false } },\n        };\n\n        // We use the PUBLIC_KEYS_LENGTH constant to ensure that there is a match between the derived trait\n        let serialized: [Field; POINT_LENGTH * 4] = keys.serialize();\n        let deserialized = PublicKeys::deserialize(serialized);\n\n        assert_eq(keys, deserialized);\n    }\n}\n"
     },
-    "362": {
+    "367": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/storage/map.nr",
       "source": "use crate::{hash::poseidon2_hash, traits::ToField};\n\npub fn derive_storage_slot_in_map<K>(storage_slot: Field, key: K) -> Field\nwhere\n    K: ToField,\n{\n    poseidon2_hash([storage_slot, key.to_field()])\n}\n\nmod test {\n    use crate::{address::AztecAddress, storage::map::derive_storage_slot_in_map, traits::FromField};\n\n    #[test]\n    fn test_derive_storage_slot_in_map_matches_typescript() {\n        let map_slot = 0x132258fb6962c4387ba659d9556521102d227549a386d39f0b22d1890d59c2b5;\n        let key = AztecAddress::from_field(\n            0x302dbc2f9b50a73283d5fb2f35bc01eae8935615817a0b4219a057b2ba8a5a3f,\n        );\n\n        let slot = derive_storage_slot_in_map(map_slot, key);\n\n        // The following value was generated by `map_slot.test.ts`\n        let slot_from_typescript =\n            0x15b9fe39449affd8b377461263e9d2b610b9ad40580553500b4e41d9cbd887ac;\n\n        assert_eq(slot, slot_from_typescript);\n    }\n}\n"
     },
-    "378": {
+    "383": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/traits.nr",
       "source": "use crate::meta::{derive_deserialize, derive_packable, derive_serialize};\nuse crate::utils::field::field_from_bytes;\n\n// Trait: is_empty\n//\n// The general is_empty trait checks if a data type is is empty,\n// and it defines empty for the basic data types as 0.\n//\n// If a Field is equal to zero, then it is regarded as zero.\n// We will go with this definition for now, however it can be problematic\n// if a value can actually be zero. In a future refactor, we can\n// use the optional type for safety. Doing it now would lead to a worse devex\n// and would make it harder to sync up with the cpp code.\n// Preferred over Default trait to convey intent, as default doesn't necessarily mean empty.\npub trait Empty: Eq {\n    fn empty() -> Self;\n\n    fn is_empty(self) -> bool {\n        self.eq(Self::empty())\n    }\n\n    // Requires this Noir fix: https://github.com/noir-lang/noir/issues/9002\n    // fn assert_not_empty<let U: u32>(self, msg: str<U>) { // This msg version was failing with weird compiler errors.\n    //     // We provide a default impl but it's likely inefficient.\n    //     // The reason we include this function is because there's a lot of\n    //     // opportunity for optimisation on a per-struct basis.\n    //     // You only need to show one element is not empty to know that the whole thing\n    //     // is not empty.\n    //     // If you know an element of your struct which should always be nonempty,\n    //     // you can write an impl that solely checks that that element is nonempty.\n    //     assert(!self.is_empty(), msg);\n    // }\n\n    // This default impl is overwritten by types like arrays, because there's a much\n    // more efficient approach.\n    fn assert_empty<let S: u32>(self, msg: str<S>) {\n        assert(self.is_empty(), msg);\n    }\n}\n\nimpl Empty for Field {\n    #[inline_always]\n    fn empty() -> Self {\n        0\n    }\n}\n\nimpl Empty for bool {\n    #[inline_always]\n    fn empty() -> Self {\n        false\n    }\n}\n\nimpl Empty for u1 {\n    #[inline_always]\n    fn empty() -> Self {\n        0\n    }\n}\nimpl Empty for u8 {\n    #[inline_always]\n    fn empty() -> Self {\n        0\n    }\n}\nimpl Empty for u16 {\n    fn empty() -> Self {\n        0\n    }\n}\nimpl Empty for u32 {\n    #[inline_always]\n    fn empty() -> Self {\n        0\n    }\n}\nimpl Empty for u64 {\n    #[inline_always]\n    fn empty() -> Self {\n        0\n    }\n}\nimpl Empty for u128 {\n    #[inline_always]\n    fn empty() -> Self {\n        0\n    }\n}\n\nimpl<T, let N: u32> Empty for [T; N]\nwhere\n    T: Empty,\n{\n    #[inline_always]\n    fn empty() -> Self {\n        [T::empty(); N]\n    }\n\n    fn is_empty(self) -> bool {\n        self.all(|elem| elem.is_empty())\n    }\n\n    fn assert_empty<let S: u32>(self, msg: str<S>) -> () {\n        self.for_each(|elem| elem.assert_empty(msg))\n    }\n}\n\nimpl<T> Empty for [T]\nwhere\n    T: Empty,\n{\n    #[inline_always]\n    fn empty() -> Self {\n        [T::empty()]\n    }\n\n    fn is_empty(self) -> bool {\n        self.all(|elem| elem.is_empty())\n    }\n\n    fn assert_empty<let S: u32>(self, msg: str<S>) -> () {\n        self.for_each(|elem| elem.assert_empty(msg))\n    }\n}\nimpl<A, B> Empty for (A, B)\nwhere\n    A: Empty,\n    B: Empty,\n{\n    #[inline_always]\n    fn empty() -> Self {\n        (A::empty(), B::empty())\n    }\n}\n\nimpl<T> Empty for Option<T>\nwhere\n    T: Eq,\n{\n    #[inline_always]\n    fn empty() -> Self {\n        Option::none()\n    }\n}\n\n// pub fn is_empty<T>(item: T) -> bool\n// where\n//     T: Empty,\n// {\n//     item.eq(T::empty())\n// }\n\n// pub fn is_empty_array<T, let N: u32>(array: [T; N]) -> bool\n// where\n//     T: Empty,\n// {\n//     array.all(|elem| is_empty(elem))\n// }\n\n// pub fn assert_empty<T>(item: T) -> ()\n// where\n//     T: Empty,\n// {\n//     assert(item.eq(T::empty()))\n// }\n\n// pub fn assert_empty_array<T, let N: u32>(array: [T; N]) -> ()\n// where\n//     T: Empty,\n// {\n//     // A cheaper option than `is_empty_array` for if you don't need to gracefully\n//     // handle a bool result.\n//     // Avoids the `&` operator of `is_empty_array`'s `.all()` call.\n//     for i in 0..N {\n//         assert(is_empty(array[i]));\n//     }\n// }\n\npub trait Hash {\n    fn hash(self) -> Field;\n}\n\npub trait ToField {\n    fn to_field(self) -> Field;\n}\n\nimpl ToField for Field {\n    #[inline_always]\n    fn to_field(self) -> Field {\n        self\n    }\n}\n\nimpl ToField for bool {\n    #[inline_always]\n    fn to_field(self) -> Field {\n        self as Field\n    }\n}\nimpl ToField for u1 {\n    #[inline_always]\n    fn to_field(self) -> Field {\n        self as Field\n    }\n}\nimpl ToField for u8 {\n    #[inline_always]\n    fn to_field(self) -> Field {\n        self as Field\n    }\n}\nimpl ToField for u16 {\n    fn to_field(self) -> Field {\n        self as Field\n    }\n}\nimpl ToField for u32 {\n    #[inline_always]\n    fn to_field(self) -> Field {\n        self as Field\n    }\n}\nimpl ToField for u64 {\n    #[inline_always]\n    fn to_field(self) -> Field {\n        self as Field\n    }\n}\nimpl ToField for u128 {\n    #[inline_always]\n    fn to_field(self) -> Field {\n        self as Field\n    }\n}\nimpl<let N: u32> ToField for str<N> {\n    #[inline_always]\n    fn to_field(self) -> Field {\n        assert(N < 32, \"String doesn't fit in a field, consider using Serialize instead\");\n        field_from_bytes(self.as_bytes(), true)\n    }\n}\n\npub trait FromField {\n    fn from_field(value: Field) -> Self;\n}\n\nimpl FromField for Field {\n    #[inline_always]\n    fn from_field(value: Field) -> Self {\n        value\n    }\n}\n\nimpl FromField for bool {\n    #[inline_always]\n    fn from_field(value: Field) -> Self {\n        value != 0\n    }\n}\nimpl FromField for u1 {\n    #[inline_always]\n    fn from_field(value: Field) -> Self {\n        value as u1\n    }\n}\nimpl FromField for u8 {\n    #[inline_always]\n    fn from_field(value: Field) -> Self {\n        value as u8\n    }\n}\nimpl FromField for u16 {\n    fn from_field(value: Field) -> Self {\n        value as u16\n    }\n}\nimpl FromField for u32 {\n    #[inline_always]\n    fn from_field(value: Field) -> Self {\n        value as u32\n    }\n}\nimpl FromField for u64 {\n    #[inline_always]\n    fn from_field(value: Field) -> Self {\n        value as u64\n    }\n}\nimpl FromField for u128 {\n    #[inline_always]\n    fn from_field(value: Field) -> Self {\n        value as u128\n    }\n}\n\n// docs:start:serialize\n/// Trait for serializing Noir types into arrays of Fields.\n///\n/// An implementation of the Serialize trait has to follow Noir's intrinsic serialization (each member of a struct\n/// converted directly into one or more Fields without any packing or compression). This trait (and Deserialize) are\n/// typically used to communicate between Noir and TypeScript (via oracles and function arguments).\n///\n/// # On Following Noir's Intrinsic Serialization\n/// When calling a Noir function from TypeScript (TS), first the function arguments are serialized into an array\n/// of fields. This array is then included in the initial witness. Noir's intrinsic serialization is then used\n/// to deserialize the arguments from the witness. When the same Noir function is called from Noir this Serialize trait\n/// is used instead of the serialization in TS. For this reason we need to have a match between TS serialization,\n/// Noir's intrinsic serialization and the implementation of this trait. If there is a mismatch, the function calls\n/// fail with an arguments hash mismatch error message.\n///\n/// # Associated Constants\n/// * `N` - The length of the output Field array, known at compile time\n///\n/// # Example\n/// ```\n/// impl<let N: u32> Serialize for str<N> {\n///     let N: u32 = N;\n///\n///     fn serialize(self) -> [Field; Self::N] {\n///         let bytes = self.as_bytes();\n///         let mut fields = [0; Self::N];\n///         for i in 0..bytes.len() {\n///             fields[i] = bytes[i] as Field;  // Each byte gets its own Field\n///         }\n///         fields\n///     }\n/// }\n/// ```\n#[derive_via(derive_serialize)]\npub trait Serialize {\n    let N: u32;\n\n    fn serialize(self) -> [Field; N];\n}\n// docs:end:serialize\n\nimpl<let M: u32> Serialize for str<M> {\n    let N: u32 = M;\n\n    #[inline_always]\n    fn serialize(self) -> [Field; Self::N] {\n        let bytes = self.as_bytes();\n        let mut fields = [0; Self::N];\n        for i in 0..bytes.len() {\n            fields[i] = bytes[i] as Field;\n        }\n        fields\n    }\n}\n\n/// Implementation of Deserialize for BoundedVec.\n///\n/// This implementation deserializes a BoundedVec from an array of Fields. The array contains:\n/// 1. The serialized items, each taking up T::N Fields\n/// 2. The length of the BoundedVec as the last Field\n///\n/// # Type Parameters\n/// * `T` - The type of items stored in the BoundedVec, must implement Deserialize\n/// * `M` - The maximum length of the BoundedVec\n///\n/// # Fields Array Layout\n/// [item1_field1, item1_field2, ..., item2_field1, item2_field2, ..., length]\n/// Where:\n/// - itemN_fieldM: The M-th Field of the N-th item (T::N Fields per item)\n/// - length: The number of items in the BoundedVec (1 Field)\n///\n/// Total length N = T::N * M + 1, where:\n/// - T::N is the number of Fields needed to deserialize one item\n/// - M is the maximum length of the BoundedVec\n/// - +1 is for storing the length\n///\n/// # Note\n/// Not deriving this because it's not supported to call derive_deserialize on a \"remote\" struct (and it will never\n/// be supported).\nimpl<T, let M: u32> Deserialize for BoundedVec<T, M>\nwhere\n    T: Deserialize,\n{\n    let N: u32 = <T as Deserialize>::N * M + 1;\n\n    #[inline_always]\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut new_bounded_vec: BoundedVec<T, M> = BoundedVec::new();\n\n        // Length is stored in the last field as we need to match intrinsic Noir serialization and the `len` struct\n        // field is after `storage` struct field (see `bounded_vec.nr` in noir-stdlib)\n        let len = fields[<T as Deserialize>::N * M] as u32;\n\n        for i in 0..len {\n            let mut nested_fields = [0; <T as Deserialize>::N];\n            for j in 0..<T as Deserialize>::N {\n                nested_fields[j] = fields[i * <T as Deserialize>::N + j];\n            }\n\n            let item = T::deserialize(nested_fields);\n            new_bounded_vec.push(item);\n        }\n\n        new_bounded_vec\n    }\n}\n\n// This may cause issues if used as program input, because noir disallows empty arrays for program input.\n// I think this is okay because I don't foresee a unit type being used as input. But leaving this comment as a hint\n// if someone does run into this in the future.\nimpl Deserialize for () {\n    let N: u32 = 0;\n\n    fn deserialize(_fields: [Field; Self::N]) -> Self {\n        ()\n    }\n}\n\n// Note: Not deriving this because it's not supported to call derive_serialize on a \"remote\" struct (and it will never\n// be supported).\nimpl<T, let M: u32> Serialize for BoundedVec<T, M>\nwhere\n    T: Serialize,\n{\n    let N: u32 = <T as Serialize>::N * M + 1; // +1 for the length of the BoundedVec\n\n    #[inline_always]\n    fn serialize(self) -> [Field; Self::N] {\n        let mut fields = [0; Self::N];\n\n        let storage = self.storage();\n\n        for i in 0..M {\n            let serialized_item = storage[i].serialize();\n\n            for j in 0..<T as Serialize>::N {\n                fields[i * <T as Serialize>::N + j] = serialized_item[j];\n            }\n        }\n\n        // Length is stored in the last field as we need to match intrinsic Noir serialization and the `len` struct\n        // field is after `storage` struct field (see `bounded_vec.nr` in noir-stdlib)\n        fields[<T as Serialize>::N * M] = self.len() as Field;\n\n        fields\n    }\n}\n\n// docs:start:deserialize\n/// Trait for deserializing Noir types from arrays of Fields.\n///\n/// An implementation of the Deserialize trait has to follow Noir's intrinsic serialization (each member of a struct\n/// converted directly into one or more Fields without any packing or compression). This trait is typically used when\n/// deserializing return values from function calls in Noir. Since the same function could be called from TypeScript\n/// (TS), in which case the TS deserialization would get used, we need to have a match between the 2.\n///\n/// # Associated Constants\n/// * `N` - The length of the input Field array, known at compile time\n///\n/// # Example\n/// ```\n/// impl<let M: u32> Deserialize for str<M> {\n///     let N: u32 = M;\n///\n///     #[inline_always]\n///     fn deserialize(fields: [Field; Self::N]) -> Self {\n///         str::<Self::N>::from(fields.map(|value| value as u8))\n///     }\n/// }\n/// ```\n#[derive_via(derive_deserialize)]\npub trait Deserialize {\n    let N: u32;\n\n    fn deserialize(fields: [Field; N]) -> Self;\n}\n// docs:end:deserialize\n\nimpl<let M: u32> Deserialize for str<M> {\n    let N: u32 = M;\n\n    #[inline_always]\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        str::<Self::N>::from(fields.map(|value| value as u8))\n    }\n}\n\n/// Trait for efficiently packing and unpacking Noir types into and from arrays of Fields.\n///\n/// The `Packable` trait allows types to be serialized and deserialized with a focus on minimizing the size of\n/// the resulting Field array. This trait is used when storage efficiency is critical (e.g. when storing data\n/// in the contract's public storage).\n///\n/// # Associated Constants\n/// * `N` - The length of the Field array, known at compile time\n#[derive_via(derive_packable)]\npub trait Packable {\n    let N: u32;\n\n    /// Packs the current value into a compact array of `Field` elements.\n    fn pack(self) -> [Field; N];\n\n    /// Unpacks a compact array of `Field` elements into the original value.\n    fn unpack(fields: [Field; N]) -> Self;\n}\n\n#[test]\nunconstrained fn bounded_vec_serialization() {\n    // Test empty BoundedVec\n    let empty_vec: BoundedVec<Field, 3> = BoundedVec::from_array([]);\n    let serialized = empty_vec.serialize();\n    let deserialized = BoundedVec::<Field, 3>::deserialize(serialized);\n    assert_eq(empty_vec, deserialized);\n    assert_eq(deserialized.len(), 0);\n\n    // Test partially filled BoundedVec\n    let partial_vec: BoundedVec<[u32; 2], 3> = BoundedVec::from_array([[1, 2]]);\n    let serialized = partial_vec.serialize();\n    let deserialized = BoundedVec::<[u32; 2], 3>::deserialize(serialized);\n    assert_eq(partial_vec, deserialized);\n    assert_eq(deserialized.len(), 1);\n    assert_eq(deserialized.get(0), [1, 2]);\n\n    // Test full BoundedVec\n    let full_vec: BoundedVec<[u32; 2], 3> = BoundedVec::from_array([[1, 2], [3, 4], [5, 6]]);\n    let serialized = full_vec.serialize();\n    let deserialized = BoundedVec::<[u32; 2], 3>::deserialize(serialized);\n    assert_eq(full_vec, deserialized);\n    assert_eq(deserialized.len(), 3);\n    assert_eq(deserialized.get(0), [1, 2]);\n    assert_eq(deserialized.get(1), [3, 4]);\n    assert_eq(deserialized.get(2), [5, 6]);\n}\n"
     },
-    "380": {
+    "385": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/type_packing.nr",
       "source": "use crate::traits::Packable;\n\nglobal BOOL_PACKED_LEN: u32 = 1;\nglobal U8_PACKED_LEN: u32 = 1;\nglobal U16_PACKED_LEN: u32 = 1;\nglobal U32_PACKED_LEN: u32 = 1;\nglobal U64_PACKED_LEN: u32 = 1;\nglobal U128_PACKED_LEN: u32 = 1;\nglobal FIELD_PACKED_LEN: u32 = 1;\nglobal I8_PACKED_LEN: u32 = 1;\nglobal I16_PACKED_LEN: u32 = 1;\nglobal I32_PACKED_LEN: u32 = 1;\nglobal I64_PACKED_LEN: u32 = 1;\n\nimpl Packable for bool {\n    let N: u32 = BOOL_PACKED_LEN;\n\n    #[inline_always]\n    fn pack(self) -> [Field; Self::N] {\n        [self as Field]\n    }\n\n    #[inline_always]\n    fn unpack(fields: [Field; Self::N]) -> bool {\n        (fields[0] as u1) != 0\n    }\n}\n\nimpl Packable for u8 {\n    let N: u32 = U8_PACKED_LEN;\n\n    #[inline_always]\n    fn pack(self) -> [Field; Self::N] {\n        [self as Field]\n    }\n\n    #[inline_always]\n    fn unpack(fields: [Field; Self::N]) -> Self {\n        fields[0] as u8\n    }\n}\n\nimpl Packable for u16 {\n    let N: u32 = U16_PACKED_LEN;\n\n    #[inline_always]\n    fn pack(self) -> [Field; Self::N] {\n        [self as Field]\n    }\n\n    #[inline_always]\n    fn unpack(fields: [Field; Self::N]) -> Self {\n        fields[0] as u16\n    }\n}\n\nimpl Packable for u32 {\n    let N: u32 = U32_PACKED_LEN;\n\n    #[inline_always]\n    fn pack(self) -> [Field; Self::N] {\n        [self as Field]\n    }\n\n    #[inline_always]\n    fn unpack(fields: [Field; Self::N]) -> Self {\n        fields[0] as u32\n    }\n}\n\nimpl Packable for u64 {\n    let N: u32 = U64_PACKED_LEN;\n\n    #[inline_always]\n    fn pack(self) -> [Field; Self::N] {\n        [self as Field]\n    }\n\n    #[inline_always]\n    fn unpack(fields: [Field; Self::N]) -> Self {\n        fields[0] as u64\n    }\n}\n\nimpl Packable for u128 {\n    let N: u32 = U128_PACKED_LEN;\n\n    #[inline_always]\n    fn pack(self) -> [Field; Self::N] {\n        [self as Field]\n    }\n\n    #[inline_always]\n    fn unpack(fields: [Field; Self::N]) -> Self {\n        fields[0] as u128\n    }\n}\n\nimpl Packable for Field {\n    let N: u32 = FIELD_PACKED_LEN;\n\n    #[inline_always]\n    fn pack(self) -> [Field; Self::N] {\n        [self]\n    }\n\n    #[inline_always]\n    fn unpack(fields: [Field; Self::N]) -> Self {\n        fields[0]\n    }\n}\n\nimpl Packable for i8 {\n    let N: u32 = I8_PACKED_LEN;\n\n    #[inline_always]\n    fn pack(self) -> [Field; Self::N] {\n        [self as u8 as Field]\n    }\n\n    #[inline_always]\n    fn unpack(fields: [Field; Self::N]) -> Self {\n        fields[0] as u8 as i8\n    }\n}\n\nimpl Packable for i16 {\n    let N: u32 = I16_PACKED_LEN;\n\n    #[inline_always]\n    fn pack(self) -> [Field; Self::N] {\n        [self as u16 as Field]\n    }\n\n    #[inline_always]\n    fn unpack(fields: [Field; Self::N]) -> Self {\n        fields[0] as u16 as i16\n    }\n}\n\nimpl Packable for i32 {\n    let N: u32 = I32_PACKED_LEN;\n\n    #[inline_always]\n    fn pack(self) -> [Field; Self::N] {\n        [self as u32 as Field]\n    }\n\n    #[inline_always]\n    fn unpack(fields: [Field; Self::N]) -> Self {\n        fields[0] as u32 as i32\n    }\n}\n\nimpl Packable for i64 {\n    let N: u32 = I64_PACKED_LEN;\n\n    #[inline_always]\n    fn pack(self) -> [Field; Self::N] {\n        [self as u64 as Field]\n    }\n\n    #[inline_always]\n    fn unpack(fields: [Field; Self::N]) -> Self {\n        fields[0] as u64 as i64\n    }\n}\n\nimpl<T, let M: u32> Packable for [T; M]\nwhere\n    T: Packable,\n{\n    let N: u32 = M * <T as Packable>::N;\n\n    #[inline_always]\n    fn pack(self) -> [Field; Self::N] {\n        let mut result: [Field; Self::N] = std::mem::zeroed();\n        for i in 0..M {\n            let serialized = self[i].pack();\n            for j in 0..<T as Packable>::N {\n                result[i * <T as Packable>::N + j] = serialized[j];\n            }\n        }\n        result\n    }\n\n    #[inline_always]\n    fn unpack(fields: [Field; Self::N]) -> Self {\n        let mut reader = crate::utils::reader::Reader::new(fields);\n        let mut result: [T; M] = std::mem::zeroed();\n        reader.read_struct_array::<T, <T as Packable>::N, M>(Packable::unpack, result)\n    }\n}\n\n#[test]\nfn test_u16_packing() {\n    let a: u16 = 10;\n    assert_eq(a, u16::unpack(a.pack()));\n}\n\n#[test]\nfn test_i8_packing() {\n    let a: i8 = -10;\n    assert_eq(a, i8::unpack(a.pack()));\n}\n\n#[test]\nfn test_i16_packing() {\n    let a: i16 = -10;\n    assert_eq(a, i16::unpack(a.pack()));\n}\n\n#[test]\nfn test_i32_packing() {\n    let a: i32 = -10;\n    assert_eq(a, i32::unpack(a.pack()));\n}\n\n#[test]\nfn test_i64_packing() {\n    let a: i64 = -10;\n    assert_eq(a, i64::unpack(a.pack()));\n}\n"
     },
-    "381": {
+    "386": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/type_serialization.nr",
       "source": "use crate::traits::{Deserialize, Serialize};\n\nglobal U1_SERIALIZED_LEN: u32 = 1;\nglobal BOOL_SERIALIZED_LEN: u32 = 1;\nglobal U8_SERIALIZED_LEN: u32 = 1;\nglobal U16_SERIALIZED_LEN: u32 = 1;\nglobal U32_SERIALIZED_LEN: u32 = 1;\nglobal U64_SERIALIZED_LEN: u32 = 1;\nglobal U128_SERIALIZED_LEN: u32 = 1;\nglobal FIELD_SERIALIZED_LEN: u32 = 1;\nglobal I8_SERIALIZED_LEN: u32 = 1;\nglobal I16_SERIALIZED_LEN: u32 = 1;\nglobal I32_SERIALIZED_LEN: u32 = 1;\nglobal I64_SERIALIZED_LEN: u32 = 1;\n\nimpl Serialize for bool {\n    let N: u32 = BOOL_SERIALIZED_LEN;\n\n    #[inline_always]\n    fn serialize(self) -> [Field; Self::N] {\n        [self as Field]\n    }\n}\n\nimpl Deserialize for bool {\n    let N: u32 = BOOL_SERIALIZED_LEN;\n\n    #[inline_always]\n    fn deserialize(fields: [Field; Self::N]) -> bool {\n        fields[0] != 0\n    }\n}\n\nimpl Serialize for u1 {\n    let N: u32 = U1_SERIALIZED_LEN;\n\n    #[inline_always]\n    fn serialize(self) -> [Field; Self::N] {\n        [self as Field]\n    }\n}\n\nimpl Deserialize for u1 {\n    let N: u32 = U1_SERIALIZED_LEN;\n\n    #[inline_always]\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        fields[0] as u1\n    }\n}\n\nimpl Serialize for u8 {\n    let N: u32 = U8_SERIALIZED_LEN;\n\n    #[inline_always]\n    fn serialize(self) -> [Field; Self::N] {\n        [self as Field]\n    }\n}\n\nimpl Deserialize for u8 {\n    let N: u32 = U8_SERIALIZED_LEN;\n\n    #[inline_always]\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        fields[0] as u8\n    }\n}\n\nimpl Serialize for u16 {\n    let N: u32 = U16_SERIALIZED_LEN;\n\n    #[inline_always]\n    fn serialize(self) -> [Field; Self::N] {\n        [self as Field]\n    }\n}\n\nimpl Deserialize for u16 {\n    let N: u32 = U16_SERIALIZED_LEN;\n\n    #[inline_always]\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        fields[0] as u16\n    }\n}\n\nimpl Serialize for u32 {\n    let N: u32 = U32_SERIALIZED_LEN;\n\n    #[inline_always]\n    fn serialize(self) -> [Field; Self::N] {\n        [self as Field]\n    }\n}\n\nimpl Deserialize for u32 {\n    let N: u32 = U32_SERIALIZED_LEN;\n\n    #[inline_always]\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        fields[0] as u32\n    }\n}\n\nimpl Serialize for u64 {\n    let N: u32 = U64_SERIALIZED_LEN;\n\n    #[inline_always]\n    fn serialize(self) -> [Field; Self::N] {\n        [self as Field]\n    }\n}\n\nimpl Deserialize for u64 {\n    let N: u32 = U64_SERIALIZED_LEN;\n\n    #[inline_always]\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        fields[0] as u64\n    }\n}\n\nimpl Serialize for u128 {\n    let N: u32 = U128_SERIALIZED_LEN;\n\n    #[inline_always]\n    fn serialize(self) -> [Field; Self::N] {\n        [self as Field]\n    }\n}\n\nimpl Deserialize for u128 {\n    let N: u32 = U128_SERIALIZED_LEN;\n\n    #[inline_always]\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        fields[0] as u128\n    }\n}\n\nimpl Serialize for Field {\n    let N: u32 = FIELD_SERIALIZED_LEN;\n\n    #[inline_always]\n    fn serialize(self) -> [Field; Self::N] {\n        [self]\n    }\n}\n\nimpl Deserialize for Field {\n    let N: u32 = FIELD_SERIALIZED_LEN;\n\n    #[inline_always]\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        fields[0]\n    }\n}\n\nimpl Serialize for i8 {\n    let N: u32 = I8_SERIALIZED_LEN;\n\n    #[inline_always]\n    fn serialize(self) -> [Field; Self::N] {\n        [self as u8 as Field]\n    }\n}\n\nimpl Deserialize for i8 {\n    let N: u32 = I8_SERIALIZED_LEN;\n\n    #[inline_always]\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        fields[0] as u8 as i8\n    }\n}\n\nimpl Serialize for i16 {\n    let N: u32 = I16_SERIALIZED_LEN;\n\n    #[inline_always]\n    fn serialize(self) -> [Field; Self::N] {\n        [self as u16 as Field]\n    }\n}\n\nimpl Deserialize for i16 {\n    let N: u32 = I16_SERIALIZED_LEN;\n\n    #[inline_always]\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        fields[0] as u16 as i16\n    }\n}\n\nimpl Serialize for i32 {\n    let N: u32 = I32_SERIALIZED_LEN;\n\n    #[inline_always]\n    fn serialize(self) -> [Field; Self::N] {\n        [self as u32 as Field]\n    }\n}\n\nimpl Deserialize for i32 {\n    let N: u32 = I32_SERIALIZED_LEN;\n\n    #[inline_always]\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        fields[0] as u32 as i32\n    }\n}\n\nimpl Serialize for i64 {\n    let N: u32 = I64_SERIALIZED_LEN;\n\n    #[inline_always]\n    fn serialize(self) -> [Field; Self::N] {\n        [self as u64 as Field]\n    }\n}\n\nimpl Deserialize for i64 {\n    let N: u32 = I64_SERIALIZED_LEN;\n\n    #[inline_always]\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        fields[0] as u64 as i64\n    }\n}\n\nimpl<T, let M: u32> Serialize for [T; M]\nwhere\n    T: Serialize,\n{\n    let N: u32 = <T as Serialize>::N * M;\n    #[inline_always]\n    fn serialize(self) -> [Field; Self::N] {\n        let mut result: [Field; _] = std::mem::zeroed();\n        for i in 0..M {\n            let serialized_t = self[i].serialize();\n            for j in 0..<T as Serialize>::N {\n                result[i * <T as Serialize>::N + j] = serialized_t[j];\n            }\n        }\n        result\n    }\n}\n\nimpl<T, let M: u32> Deserialize for [T; M]\nwhere\n    T: Deserialize,\n{\n    let N: u32 = <T as Deserialize>::N * M;\n\n    #[inline_always]\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = crate::utils::reader::Reader::new(fields);\n        let mut result: [T; M] = std::mem::zeroed();\n        reader.read_struct_array::<T, <T as Deserialize>::N, M>(Deserialize::deserialize, result)\n    }\n}\n\nimpl<T> Serialize for Option<T>\nwhere\n    T: Serialize,\n{\n    let N: u32 = <T as Serialize>::N + 1;\n\n    #[inline_always]\n    fn serialize(self) -> [Field; Self::N] {\n        let mut result: [Field; Self::N] = std::mem::zeroed();\n\n        result[0] = if self.is_some() { 1 } else { 0 };\n\n        let value_serialized = self.unwrap_unchecked().serialize();\n        for i in 0..<T as Serialize>::N {\n            result[1 + i] = value_serialized[i];\n        }\n\n        result\n    }\n}\n\nimpl<T> Deserialize for Option<T>\nwhere\n    T: Deserialize,\n{\n    let N: u32 = <T as Deserialize>::N + 1;\n\n    #[inline_always]\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        if fields[0] == 1 {\n            let mut value_fields = [0; <T as Deserialize>::N];\n            for i in 0..<T as Deserialize>::N {\n                value_fields[i] = fields[1 + i];\n            }\n\n            Option::some(T::deserialize(value_fields))\n        } else {\n            Option::none()\n        }\n    }\n}\n\nmod test {\n    use crate::traits::{Deserialize, Serialize};\n\n    #[test]\n    fn u16_serialization() {\n        let a: u16 = 10;\n        assert_eq(a, u16::deserialize(a.serialize()));\n    }\n\n    #[test]\n    fn i8_serialization() {\n        let a: i8 = -10;\n        assert_eq(a, i8::deserialize(a.serialize()));\n    }\n\n    #[test]\n    fn i16_serialization() {\n        let a: i16 = -10;\n        assert_eq(a, i16::deserialize(a.serialize()));\n    }\n\n    #[test]\n    fn i32_serialization() {\n        let a: i32 = -10;\n        assert_eq(a, i32::deserialize(a.serialize()));\n    }\n\n    #[test]\n    fn i64_serialization() {\n        let a: i64 = -10;\n        assert_eq(a, i64::deserialize(a.serialize()));\n    }\n\n    #[test]\n    fn option_field_serialization() {\n        let opt_some = Option::some(5);\n        assert_eq(Option::<_>::deserialize(opt_some.serialize()), opt_some);\n\n        let opt_none = Option::none();\n        assert_eq(Option::<Field>::deserialize(opt_none.serialize()), opt_none);\n    }\n\n    #[test]\n    fn array_serialization() {\n        let array = [1, 2, 3, 4];\n\n        let serialized: [Field; 4] = array.serialize();\n        let deserialized: [Field; 4] = Deserialize::deserialize(serialized);\n        assert_eq(deserialized, array);\n    }\n\n    #[test]\n    fn nested_array_serialization() {\n        let nested_array = [[1, 2, 3, 4], [5, 6, 7, 8]];\n\n        let serialized: [Field; 8] = nested_array.serialize();\n        let deserialized: [[Field; 4]; 2] = Deserialize::deserialize(serialized);\n\n        assert_eq(deserialized, nested_array);\n    }\n\n    #[test]\n    fn option_array_serialization() {\n        let opt_some = Option::some([2, 5]);\n        assert_eq(Option::<_>::deserialize(opt_some.serialize()), opt_some);\n\n        let opt_none = Option::none();\n        assert_eq(Option::<Field>::deserialize(opt_none.serialize()), opt_none);\n    }\n}\n"
     },
-    "385": {
+    "390": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/utils/arrays.nr",
       "source": "pub(crate) mod assert_trailing_zeros;\npub(crate) mod find_index;\npub(crate) mod get_sorted_tuples;\n\n// Re-exports.\npub use assert_trailing_zeros::assert_trailing_zeros;\npub use find_index::{find_first_index, find_last_index};\npub use get_sorted_tuples::{get_sorted_tuples, SortedTuple};\n\nuse crate::traits::{Deserialize, Empty, Serialize};\nuse super::for_loop::{for_i_in_0_, for_i_only_in_0_};\n\n//**********************************************************************************\n// ARRAY\n//**********************************************************************************\n\n// TODO: Consider making this a part of the noir stdlib.\n/// Helper fn to create a subarray from a given array.\npub fn subarray<T, let N: u32, let M: u32>(array: [T; N], offset: u32) -> [T; M]\nwhere\n    T: Empty,\n{\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\n// Helper function to find the index of the first element in an array that satisfies a given predicate.\n// If the element is not found, the function returns Option::none.\n// TODO: Consider making this a part of the noir stdlib.\npub unconstrained fn find_index_hint<T, let N: u32, Env>(\n    array: [T; N],\n    find: fn[Env](T) -> bool,\n) -> Option<u32> {\n    let mut index: Option<u32> = Option::none();\n    for i in 0..N {\n        if find(array[i]) {\n            index = Option::some(i);\n            break;\n        }\n    }\n    index\n}\n\n// Helper function to find the index of the first element (starting from the back) of an array that satisfies a given predicate.\n// If the element is not found, the function returns Option::none.\n// TODO: Consider making this a part of the noir stdlib.\npub unconstrained fn find_index_hint_in_reverse<T, let N: u32, Env>(\n    array: [T; N],\n    find: fn[Env](T) -> bool,\n) -> Option<u32> {\n    let mut index: Option<u32> = Option::none();\n    for i in 0..N {\n        let j = N - i - 1;\n        if find(array[j]) {\n            index = Option::some(j);\n            break;\n        }\n    }\n    index\n}\n\n//**********************************************************************************\n// FREE ARRAY FUNCTIONS (to deprecate or make into methods of array wrappers)\n//**********************************************************************************\n\n/// Deprecated.\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,\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 maybe_length = unsafe { find_index_hint(array, |elem: T| elem.is_empty()) };\n\n    let mut length = N;\n\n    if maybe_length.is_some() {\n        length = maybe_length.unwrap_unchecked();\n\n        array[length].assert_empty(\"Expected array empty\");\n    }\n\n    if length != 0 {\n        assert(!array[length - 1].is_empty());\n    }\n\n    length\n}\n\n// Returns an array length defined by fully trimming _all_ \"empty\" items\n// from the RHS.\npub unconstrained fn trimmed_array_length_hint<T, let N: u32>(array: [T; N]) -> u32\nwhere\n    T: Empty,\n{\n    let maybe_index_of_last_nonempty =\n        find_index_hint_in_reverse(array, |elem: T| !elem.is_empty());\n    let length: u32 = if maybe_index_of_last_nonempty.is_some() {\n        1 + maybe_index_of_last_nonempty.unwrap_unchecked()\n    } else {\n        0\n    };\n    length\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,\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,\n{\n    let mut result: [T; N] = [T::empty(); N];\n    let mut i = 0;\n    for elem in array1 {\n        if !elem.is_empty() {\n            result[i] = elem;\n            i += 1;\n        }\n    }\n    for elem in array2 {\n        if !elem.is_empty() {\n            result[i] = elem;\n            i += 1;\n        }\n    }\n    result\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 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,\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 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//**********************************************************************************\n// ARRAY WRAPPERS\n//**********************************************************************************\n\n/*\n *\n *\n *                                                                                                    \n *                          |-----------------------------------------|------------------------------| \n *                          | LHS                                     | RHS                          |\n *                          |-----------------------------------------|------------------------------|\n *       ClaimedLengthArray | Interspersed 0s possible.               | Unvalidated.                 |\n *                          | Possibly not fully trimmed.             | Nonempty elements possible.  |\n *                          |-----------------------------------------|------------------------------|\n *            EmptyRHSArray | Interspersed 0s possible.               | All 0s (validated).          |\n *                          | Possibly not fully trimmed.             |                              |\n *                          |-----------------------------------------|------------------------------|\n *             TrimmedArray | Interspersed 0s possible.               | All 0s (validated)           |\n *                          | Last lhs element validated as nonempty. |                              |\n *                          | (I.e. fully trimmed)                    |                              |\n *                          |-----------------------------------------|------------------------------|\n *        DenseTrimmedArray | Dense (validated).                      | All 0s (validated)           |\n *                          |-----------------------------------------|------------------------------|\n *\n *\n *                          | What guarantees do we have?                      |\n *                          |--------|--------|--------------------------------| \n *                          | Dense? | RHS    | Length vs Fully Trimmed Length |\n *                          |--------|--------|--------------------------------|\n *       ClaimedLengthArray | ?      | ?      | ?                              |\n *                          |        |        |                                |\n *                          |--------|--------|--------------------------------|\n *            EmptyRHSArray | ?      | All 0s | Length >= Fully Trimmed Length |\n *                          |        |        |                                |\n *                          |--------|--------|--------------------------------|\n *             TrimmedArray | ?      | All 0s | Length == Fully Trimmed Length |\n *                          |        |        |                                |\n *                          |        |        |                                |\n *                          |--------|--------|--------------------------------|\n *        DenseTrimmedArray | Yes    | All 0s | Length == Fully Trimmed Length |\n *                          |--------|--------|--------------------------------|\n *\n *\n * An ClaimedLengthArray is distinct from a regular array [T; N], because it carries a length.\n * \n */\n\n/// ClaimedLengthArray - An array interpreted by Kernel circuits.\n/// Its `length` is merely a claim that must eventually be validated.\n/// Validation must include:\n/// - Asserting all items to the LHS of the length are nonempty (dense).\n/// - Asserting all items to the RHS of the length are empty.\n#[derive(Deserialize, Serialize)]\npub struct ClaimedLengthArray<T, let N: u32> {\n    pub array: [T; N],\n    pub length: u32,\n}\n\nimpl<T, let N: u32> ClaimedLengthArray<T, N>\nwhere\n    T: Empty,\n{\n    // No constructor. Append to an empty one.\n\n    // For constrained append functions, see the dedicated file: assert_array_appended.nr\n\n    pub fn assert_dense_trimmed(self) {\n        for_i_in_0_(\n            self.length,\n            self.array.len(),\n            |i| {\n                assert(!self.array[i].is_empty(), \"LHS of input array is not dense\")\n                // Requires Noir #9002:\n                // self.array[i].assert_not_empty(\"LHS of input array is not dense\"); // LHS of input array is not dense.\n            },\n            |i| self.array[i].assert_empty(\"RHS of input array is not empty\"),\n            false,\n        );\n    }\n\n    pub fn assert_empty<let S: u32>(self, msg: str<S>) {\n        for i in 0..N {\n            self.array[i].assert_empty(msg);\n        }\n        assert_eq(self.length, 0);\n    }\n\n    pub fn assert_length_within_bounds<let S: u32>(self, msg: str<S>) {\n        assert(self.length <= N, msg);\n    }\n\n    pub fn push(&mut self, item: T) {\n        assert(self.length != N, \"Array full\");\n\n        let next_index = self.length;\n        self.array[next_index] = item;\n        self.length += 1;\n    }\n\n    pub fn pop(&mut self) -> T {\n        assert(self.length != 0, \"Array empty\");\n\n        let mut top_index = self.length - 1;\n        let popped_item = self.array[top_index];\n        self.array[top_index] = T::empty();\n        self.length -= 1;\n        popped_item\n    }\n\n    pub fn for_each<Env>(self, f: fn[Env](T) -> ()) {\n        // We pass `false`, because by construction, we should know that self.length <= self.array.len().\n        for_i_only_in_0_(self.length, self.array.len(), |i| f(self.array[i]), false);\n    }\n\n    // E.g.\n    // dest.for_each_i(|source_item, i| { assert_eq(dest.array[i], source_item, \"bad copy\"); })\n    pub fn for_each_i<Env>(self, f: fn[Env](T, u32) -> ()) {\n        // We pass `false`, because by construction, we should know that self.length <= self.array.len().\n        for_i_only_in_0_(\n            self.length,\n            self.array.len(),\n            |i| f(self.array[i], i),\n            false,\n        );\n    }\n\n    pub fn from_bounded_vec(vec: BoundedVec<T, N>) -> Self {\n        Self { array: vec.storage(), length: vec.len() }\n    }\n}\n\n// TODO: compiler bug. No idea why this is needed, if we have #[derive(Eq)] above the struct definition.\nimpl<T, let N: u32> Eq for ClaimedLengthArray<T, N>\nwhere\n    T: Eq,\n{\n    fn eq(self, other: Self) -> bool {\n        (self.array == other.array) & (self.length == other.length)\n    }\n}\n\nimpl<T, let N: u32> Empty for ClaimedLengthArray<T, N>\nwhere\n    T: Empty,\n{\n    fn empty() -> Self {\n        Self { array: [T::empty(); N], length: 0 }\n    }\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 maybe_index = find_index_hint(values, |v: Field| min.lt(v));\n    assert_eq(maybe_index.unwrap_unchecked(), 2);\n}\n\n#[test]\nunconstrained fn find_index_not_found() {\n    let values = [10, 20, 30, 40];\n    let min = 100;\n    let maybe_index = find_index_hint(values, |v: Field| min.lt(v));\n    assert_eq(maybe_index.is_none(), true);\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"
     },
-    "386": {
+    "391": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/utils/field.nr",
       "source": "global KNOWN_NON_RESIDUE: Field = 5; // This is a non-residue in Noir's native Field.\n\npub fn field_from_bytes<let N: u32>(bytes: [u8; N], big_endian: bool) -> Field {\n    assert(bytes.len() < 32, \"field_from_bytes: N must be less than 32\");\n    let mut as_field = 0;\n    let mut offset = 1;\n    for i in 0..N {\n        let mut index = i;\n        if big_endian {\n            index = N - i - 1;\n        }\n        as_field += (bytes[index] as Field) * offset;\n        offset *= 256;\n    }\n\n    as_field\n}\n\n// Convert a 32 byte array to a field element by truncating the final byte\npub fn field_from_bytes_32_trunc(bytes32: [u8; 32]) -> Field {\n    // Convert it to a field element\n    let mut v = 1;\n    let mut high = 0 as Field;\n    let mut low = 0 as Field;\n\n    for i in 0..15 {\n        // covers bytes 16..30 (31 is truncated and ignored)\n        low = low + (bytes32[15 + 15 - i] as Field) * v;\n        v = v * 256;\n        // covers bytes 0..14\n        high = high + (bytes32[14 - i] as Field) * v;\n    }\n    // covers byte 15\n    low = low + (bytes32[15] as Field) * v;\n\n    low + high * v\n}\n\n// TODO to radix returns u8, so we cannot use bigger radixes. It'd be ideal to use a radix of the maximum range-constrained integer noir supports\npub fn full_field_less_than(lhs: Field, rhs: Field) -> bool {\n    lhs.lt(rhs)\n}\n\npub fn full_field_greater_than(lhs: Field, rhs: Field) -> bool {\n    rhs.lt(lhs)\n}\n\npub fn min(f1: Field, f2: Field) -> Field {\n    if f1.lt(f2) {\n        f1\n    } else {\n        f2\n    }\n}\n\nglobal C1: u32 = 28;\nglobal C3: Field = 40770029410420498293352137776570907027550720424234931066070132305055;\nglobal C5: Field = 19103219067921713944291392827692070036145651957329286315305642004821462161904;\n\npub fn pow(x: Field, y: Field) -> Field {\n    let mut r = 1 as Field;\n    let b: [u1; 254] = y.to_le_bits();\n\n    for i in 0..254 {\n        r *= r;\n        r *= (b[254 - 1 - i] as Field) * x + (1 - b[254 - 1 - i] as Field);\n    }\n\n    r\n}\n\n/// Returns Option::some(sqrt) if there is a square root, and Option::none() if there isn't.\npub fn sqrt(x: Field) -> Option<Field> {\n    // Safety: if the hint returns the square root of x, then we simply square it\n    // check the result equals x. If x is not square, we return a value that\n    // enables us to prove that fact (see the `else` clause below).\n    let (is_sq, maybe_sqrt) = unsafe { __sqrt(x) };\n\n    if is_sq {\n        let sqrt = maybe_sqrt;\n        validate_sqrt_hint(x, sqrt);\n        Option::some(sqrt)\n    } else {\n        let not_sqrt_hint = maybe_sqrt;\n        validate_not_sqrt_hint(x, not_sqrt_hint);\n        Option::none()\n    }\n}\n\n// Boolean indicating whether Field element is a square, i.e. whether there exists a y in Field s.t. x = y*y.\nunconstrained fn is_square(x: Field) -> bool {\n    let v = pow(x, -1 / 2);\n    v * (v - 1) == 0\n}\n\n// Tonelli-Shanks algorithm for computing the square root of a Field element.\n// Requires C1 = max{c: 2^c divides (p-1)}, where p is the order of Field\n// as well as C3 = (C2 - 1)/2, where C2 = (p-1)/(2^c1),\n// and C5 = ZETA^C2, where ZETA is a non-square element of Field.\n// These are pre-computed above as globals.\nunconstrained fn tonelli_shanks_sqrt(x: Field) -> Field {\n    let mut z = pow(x, C3);\n    let mut t = z * z * x;\n    z *= x;\n    let mut b = t;\n    let mut c = C5;\n\n    for i in 0..(C1 - 1) {\n        for _j in 1..(C1 - i - 1) {\n            b *= b;\n        }\n\n        z *= if b == 1 { 1 } else { c };\n\n        c *= c;\n\n        t *= if b == 1 { 1 } else { c };\n\n        b = t;\n    }\n\n    z\n}\n\n// NB: this doesn't return an option, because in the case of there _not_ being a square root, we still want to return a field element that allows us to then assert in the _constrained_ sqrt function that there is no sqrt.\nunconstrained fn __sqrt(x: Field) -> (bool, Field) {\n    let is_sq = is_square(x);\n    if is_sq {\n        let sqrt = tonelli_shanks_sqrt(x);\n        (true, sqrt)\n    } else {\n        // Demonstrate that x is not a square (a.k.a. a \"quadratic non-residue\").\n        // Facts:\n        // The Legendre symbol (\"LS\") of x, is x^((p-1)/2) (mod p).\n        // - If x is a square, LS(x) = 1\n        // - If x is not a square, LS(x) = -1\n        // - If x = 0, LS(x) = 0.\n        //\n        // Hence:\n        // sq * sq = sq // 1 * 1 = 1\n        // non-sq * non-sq = sq // -1 * -1 = 1\n        // sq * non-sq = non-sq // -1 * 1 = -1\n        //\n        // See: https://en.wikipedia.org/wiki/Legendre_symbol\n        let demo_x_not_square = x * KNOWN_NON_RESIDUE;\n        let not_sqrt = tonelli_shanks_sqrt(demo_x_not_square);\n        (false, not_sqrt)\n    }\n}\n\nfn validate_sqrt_hint(x: Field, hint: Field) {\n    assert(hint * hint == x, f\"The claimed_sqrt {hint} is not the sqrt of x {x}\");\n}\n\nfn validate_not_sqrt_hint(x: Field, hint: Field) {\n    // We need this assertion, because x = 0 would pass the other assertions in this\n    // function, and we don't want people to be able to prove that 0 is not square!\n    assert(x != 0, \"0 has a square root; you cannot claim it is not square\");\n    // Demonstrate that x is not a square (a.k.a. a \"quadratic non-residue\").\n    //\n    // Facts:\n    // The Legendre symbol (\"LS\") of x, is x^((p-1)/2) (mod p).\n    // - If x is a square, LS(x) = 1\n    // - If x is not a square, LS(x) = -1\n    // - If x = 0, LS(x) = 0.\n    //\n    // Hence:\n    // 1. sq * sq = sq // 1 * 1 = 1\n    // 2. non-sq * non-sq = sq // -1 * -1 = 1\n    // 3. sq * non-sq = non-sq // -1 * 1 = -1\n    //\n    // See: https://en.wikipedia.org/wiki/Legendre_symbol\n    //\n    // We want to demonstrate that this below multiplication falls under bullet-point (2):\n    let demo_x_not_square = x * KNOWN_NON_RESIDUE;\n    // I.e. we want to demonstrate that `demo_x_not_square` has Legendre symbol 1\n    // (i.e. that it is a square), so we prove that it is square below.\n    // Why do we want to prove that it has LS 1?\n    // Well, since it was computed with a known-non-residue, its squareness implies we're\n    // in case 2 (something multiplied by a known-non-residue yielding a result which\n    // has a LS of 1), which implies that x must be a non-square. The unconstrained\n    // function gave us the sqrt of demo_x_not_square, so all we need to do is\n    // assert its squareness:\n    assert(\n        hint * hint == demo_x_not_square,\n        f\"The hint {hint} does not demonstrate that {x} is not a square\",\n    );\n}\n\n#[test]\nunconstrained fn bytes_field_test() {\n    // Tests correctness of field_from_bytes_32_trunc against existing methods\n    // Bytes representing 0x543e0a6642ffeb8039296861765a53407bba62bd1c97ca43374de950bbe0a7\n    let inputs = [\n        84, 62, 10, 102, 66, 255, 235, 128, 57, 41, 104, 97, 118, 90, 83, 64, 123, 186, 98, 189, 28,\n        151, 202, 67, 55, 77, 233, 80, 187, 224, 167,\n    ];\n    let field = field_from_bytes(inputs, true);\n    let return_bytes: [u8; 31] = field.to_be_bytes();\n    assert_eq(inputs, return_bytes);\n    // 32 bytes - we remove the final byte, and check it matches the field\n    let inputs2 = [\n        84, 62, 10, 102, 66, 255, 235, 128, 57, 41, 104, 97, 118, 90, 83, 64, 123, 186, 98, 189, 28,\n        151, 202, 67, 55, 77, 233, 80, 187, 224, 167, 158,\n    ];\n    let field2 = field_from_bytes_32_trunc(inputs2);\n    let return_bytes2: [u8; 31] = field.to_be_bytes();\n\n    assert_eq(return_bytes2, return_bytes);\n    assert_eq(field2, field);\n}\n\n#[test]\nunconstrained fn max_field_test() {\n    // Tests the hardcoded value in constants.nr vs underlying modulus\n    // NB: We can't use 0-1 in constants.nr as it will be transpiled incorrectly to ts and sol constants files\n    let max_value = crate::constants::MAX_FIELD_VALUE;\n    assert_eq(max_value, 0 - 1);\n    // modulus == 0 is tested elsewhere, so below is more of a sanity check\n    let max_bytes: [u8; 32] = max_value.to_be_bytes();\n    let mod_bytes = std::field::modulus_be_bytes();\n    for i in 0..31 {\n        assert_eq(max_bytes[i], mod_bytes[i]);\n    }\n    assert_eq(max_bytes[31], mod_bytes[31] - 1);\n}\n\n#[test]\nunconstrained fn sqrt_valid_test() {\n    let x = 16; // examples: 16, 9, 25, 81\n    let result = sqrt(x);\n    assert(result.is_some());\n    assert_eq(result.unwrap() * result.unwrap(), x);\n}\n\n#[test]\nunconstrained fn sqrt_invalid_test() {\n    let x = KNOWN_NON_RESIDUE; // has no square root in the field\n    let result = sqrt(x);\n    assert(result.is_none());\n}\n"
     },
-    "390": {
+    "395": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/utils/reader.nr",
       "source": "pub struct Reader<let N: u32> {\n    data: [Field; N],\n    offset: u32,\n}\n\nimpl<let N: u32> Reader<N> {\n    pub fn new(data: [Field; N]) -> Self {\n        Self { data, offset: 0 }\n    }\n\n    pub fn read(&mut self) -> Field {\n        let result = self.data[self.offset];\n        self.offset += 1;\n        result\n    }\n\n    pub fn read_u32(&mut self) -> u32 {\n        self.read() as u32\n    }\n\n    pub fn read_u64(&mut self) -> u64 {\n        self.read() as u64\n    }\n\n    pub fn read_bool(&mut self) -> bool {\n        self.read() != 0\n    }\n\n    pub fn read_array<let K: u32>(&mut self) -> [Field; K] {\n        let mut result = [0; K];\n        for i in 0..K {\n            result[i] = self.data[self.offset + i];\n        }\n        self.offset += K;\n        result\n    }\n\n    pub fn read_struct<T, let K: u32>(&mut self, deserialise: fn([Field; K]) -> T) -> T {\n        let result = deserialise(self.read_array());\n        result\n    }\n\n    pub fn read_struct_array<T, let K: u32, let C: u32>(\n        &mut self,\n        deserialise: fn([Field; K]) -> T,\n        mut result: [T; C],\n    ) -> [T; C] {\n        for i in 0..C {\n            result[i] = self.read_struct(deserialise);\n        }\n        result\n    }\n\n    pub fn finish(self) {\n        assert_eq(self.offset, self.data.len(), \"Reader did not read all data\");\n    }\n}\n"
     },
@@ -3607,19 +3611,15 @@
     },
     "73": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/contract_self.nr",
-      "source": "use crate::{\n    context::{\n        calls::{PrivateCall, PrivateStaticCall, PublicCall, PublicStaticCall},\n        private_context::PrivateContext,\n        public_context::PublicContext,\n    },\n    event::{event_emission::emit_event_in_private, event_interface::EventInterface},\n};\nuse super::{context::utility_context::UtilityContext, event::event_emission::emit_event_in_public};\nuse protocol_types::{\n    address::AztecAddress,\n    constants::NULL_MSG_SENDER_CONTRACT_ADDRESS,\n    traits::{Deserialize, Serialize},\n};\n\n/// `ContractSelf` is the core interface for interacting with an Aztec contract's own state and context.\n///\n/// This struct is automatically injected into every #[external(...)] contract function by the Aztec macro system and is\n/// accessible through the `self` variable.\n///\n/// # Usage in Contract Functions\n///\n/// Once injected, you can use `self` to:\n/// - Access storage: `self.storage.balances.at(owner).read()`\n/// - Call contracts: `self.call(Token::at(address).transfer(recipient, amount))`\n/// - Emit events: `self.emit(event, recipient, delivery_mode)` (private) or `self.emit(event)` (public)\n/// - Get the contract address: `self.address`\n/// - Get the caller: `self.msg_sender()`\n/// - Access low-level Aztec.nr APIs through the context: `self.context`\n///\n/// # Example\n///\n/// ```noir\n/// #[external(\"private\")]\n/// fn withdraw(amount: u128, recipient: AztecAddress) {\n///     // Get the caller of this function\n///     let sender = self.msg_sender().unwrap();\n///\n///     // Access storage\n///     let token = self.storage.donation_token.get_note().get_address();\n///\n///     // Call contracts\n///     self.call(Token::at(token).transfer(recipient, amount));\n/// }\n/// ```\n///\n/// # Type Parameters\n///\n/// - `Context`: The execution context type - either `&mut PrivateContext`, `PublicContext`, or `UtilityContext`\n/// - `Storage`: The contract's storage struct (defined with `#[storage]`), or `()` if the contract has no storage\n/// - `CallSelf`: Macro-generated type for calling contract's own non-view functions\n/// - `EnqueueSelf`: Macro-generated type for enqueuing calls to the contract's own non-view functions\n/// - `CallSelfStatic`: Macro-generated type for calling contract's own view functions\n/// - `EnqueueSelfStatic`: Macro-generated type for enqueuing calls to the contract's own view functions\npub struct ContractSelf<Context, Storage, CallSelf, EnqueueSelf, CallSelfStatic, EnqueueSelfStatic, CallInternal> {\n    /// The address of this contract\n    pub address: AztecAddress,\n    /// The contract's storage instance, representing the struct to which the `#[storage]` macro was applied in your\n    /// contract. If the contract has no storage, the type of this will be `()`.\n    ///\n    /// This storage instance is specialized for the current execution context (private, public, or utility) and\n    /// provides access to the contract's state variables. Each state variable accepts the context as a generic\n    /// parameter, which determines its available functionality. For example, a PublicImmutable variable can be read\n    /// from any context (public, private, or utility) but can only be written to from public contexts.\n    ///\n    /// # Developer Note\n    /// If you've arrived here while trying to access your contract's storage while the `Storage` generic type is set to\n    /// unit type `()`, it means you haven't yet defined a Storage struct using the #[storage] macro in your contract.\n    /// For guidance on setting this up, please refer to our docs:\n    /// https://docs.aztec.network/developers/docs/guides/smart_contracts/storage\n    pub storage: Storage,\n    /// The execution context whose type is determined by the #[external(...)] attribute of the contract function based\n    /// on the external function type (private, public, or utility).\n    pub context: Context,\n\n    /// Provides type-safe methods for calling this contract's own non-view functions.\n    ///\n    /// In private and public contexts this will be a struct with appropriate methods;\n    /// in utility context it will be the unit type `()`.\n    ///\n    /// Example API:\n    /// ```noir\n    /// self.call_self.some_private_function(args)\n    /// ```\n    pub call_self: CallSelf,\n    /// Provides type-safe methods for enqueuing calls to this contract's own non-view functions.\n    ///\n    /// In private context this will be a struct with appropriate methods;\n    /// in public and utility contexts it will be the unit type `()`.\n    ///\n    /// Example API:\n    /// ```noir\n    /// self.enqueue_self.some_public_function(args)\n    /// ```\n    pub enqueue_self: EnqueueSelf,\n    /// Provides type-safe methods for calling this contract's own view functions.\n    ///\n    /// In private and public contexts this will be a struct with appropriate methods;\n    /// in utility context it will be the unit type `()`.\n    ///\n    /// Example API:\n    /// ```noir\n    /// self.call_self_static.some_view_function(args)\n    /// ```\n    pub call_self_static: CallSelfStatic,\n    /// Provides type-safe methods for enqueuing calls to this contract's own view functions.\n    ///\n    /// In private context this will be a struct with appropriate methods;\n    /// in public and utility contexts it will be the unit type `()`.\n    ///\n    /// Example API:\n    /// ```noir\n    /// self.enqueue_self_static.some_public_view_function(args)\n    /// ```\n    pub enqueue_self_static: EnqueueSelfStatic,\n    /// Provides type-safe methods for calling internal functions.\n    ///\n    /// In private and public contexts this will be a struct with appropriate methods;\n    /// in utility context it will be the unit type `()`.\n    ///\n    /// Example API:\n    /// ```noir\n    /// self.internal.some_internal_function(args)\n    /// ```\n    pub internal: CallInternal,\n}\n\n/// Implementation for `ContractSelf` in private execution contexts.\n///\n/// This implementation is used when a contract function is marked with `#[external(\"private\")]`.\n/// Private functions execute client-side and generate zero-knowledge proofs of their execution.\nimpl<Storage, CallSelf, EnqueueSelf, CallSelfStatic, EnqueueSelfStatic, CallInternal> ContractSelf<&mut PrivateContext, Storage, CallSelf, EnqueueSelf, CallSelfStatic, EnqueueSelfStatic, CallInternal> {\n    /// Creates a new `ContractSelf` instance for a private function.\n    ///\n    /// This constructor is called automatically by the macro system and should not be called directly.\n    pub fn new_private(\n        context: &mut PrivateContext,\n        storage: Storage,\n        call_self: CallSelf,\n        enqueue_self: EnqueueSelf,\n        call_self_static: CallSelfStatic,\n        enqueue_self_static: EnqueueSelfStatic,\n        internal: CallInternal,\n    ) -> Self {\n        Self {\n            context,\n            storage,\n            address: context.this_address(),\n            call_self,\n            enqueue_self,\n            call_self_static,\n            enqueue_self_static,\n            internal,\n        }\n    }\n\n    /// Returns the contract address that initiated this function call. This is similar to `msg.sender` in Solidity.\n    ///\n    /// Important Note: Since Aztec doesn't have a concept of an EoA ( Externally-owned Account), the msg_sender is\n    /// \"null\" for the first function call of every transaction. The first function call of a tx is likely to be a call\n    /// to the user's account contract, so this quirk will most often be handled by account contract developers.\n    ///\n    /// # Returns\n    /// * `Option<AztecAddress>` - The address of the smart contract that called this function (be it an app contract or\n    ///   a user's account contract). Returns `Option<AztecAddress>::none` for the first function call of the tx. No\n    ///   other _private_ function calls in the tx will have a `none` msg_sender, but _public_ function calls might (see\n    ///   the PublicContext).\n    ///\n    pub fn msg_sender(self) -> Option<AztecAddress> {\n        let maybe_msg_sender = self.context.msg_sender_unsafe();\n        if maybe_msg_sender == NULL_MSG_SENDER_CONTRACT_ADDRESS {\n            Option::none()\n        } else {\n            Option::some(maybe_msg_sender)\n        }\n    }\n\n    /// Emits an event from a private function. Private events can be delivered either via private logs or offchain\n    /// messages, with configurable encryption and tagging constraints.\n    ///\n    /// Events in private functions are encrypted and sent to a specific recipient. This ensures that only the intended\n    /// recipient can read the event data.\n    ///\n    /// # Parameters\n    /// - `event`: The event to emit (must implement `EventInterface` and `Serialize`)\n    /// - `recipient`: The address that should be able to decrypt and read this event\n    /// - `delivery_mode`: The delivery mode for the event (e.g., `MessageDelivery.CONSTRAINED_ONCHAIN`)\n    ///\n    /// # Example\n    /// ```noir\n    /// #[external(\"private\")]\n    /// fn transfer(amount: u128, to: AztecAddress) {\n    ///     // ... transfer logic ...\n    ///     self.emit(\n    ///         TransferEvent { from: sender, to, amount },\n    ///         to,\n    ///         MessageDelivery.CONSTRAINED_ONCHAIN\n    ///     );\n    /// }\n    /// ```\n    pub fn emit<Event>(&mut self, event: Event, recipient: AztecAddress, delivery_mode: u8)\n    where\n        Event: EventInterface + Serialize,\n    {\n        emit_event_in_private(event, self.context, recipient, delivery_mode);\n    }\n\n    /// Makes a call to the private function defined by the `call` parameter.\n    ///\n    /// # Arguments\n    /// * `call` - The object representing the private function to invoke.\n    ///\n    /// # Returns\n    /// * `T` - Whatever data the called function has returned.\n    ///\n    /// # Example\n    /// ```noir\n    /// self.call(Token::at(address).transfer_in_private(recipient, amount));\n    /// ```\n    ///\n    /// This enables contracts to interact with each other while maintaining\n    /// privacy. This \"composability\" of private contract functions is a key\n    /// feature of the Aztec network.\n    ///\n    /// If a user's transaction includes multiple private function calls, then\n    /// by the design of Aztec, the following information will remain private[1]:\n    /// - The function selectors and contract addresses of all private function\n    ///   calls will remain private, so an observer of the public mempool will\n    ///   not be able to look at a tx and deduce which private functions have\n    ///   been executed.\n    /// - The arguments and return values of all private function calls will\n    ///   remain private.\n    /// - The person who initiated the tx will remain private.\n    /// - The notes and nullifiers and private logs that are emitted by all\n    ///   private function calls will (if designed well) not leak any user\n    ///   secrets, nor leak which functions have been executed.\n    ///\n    /// [1] Caveats: Some of these privacy guarantees depend on how app\n    /// developers design their smart contracts. Some actions _can_ leak\n    /// information, such as:\n    /// - Calling an internal public function.\n    /// - Calling a public function and not setting msg_sender to Option::none\n    ///   (see https://github.com/AztecProtocol/aztec-packages/pull/16433)\n    /// - Calling any public function will always leak details about the nature\n    ///   of the transaction, so devs should be careful in their contract\n    ///   designs. If it can be done in a private function, then that will give\n    ///   the best privacy.\n    /// - Not padding the side-effects of a tx to some standardized, uniform\n    ///   size. The kernel circuits can take hints to pad side-effects, so a\n    ///   wallet should be able to request for a particular amount of padding.\n    ///   Wallets should ideally agree on some standard.\n    ///   - Padding should include:\n    ///     - Padding the lengths of note & nullifier arrays\n    ///     - Padding private logs with random fields, up to some standardized\n    ///       size.\n    /// See also: https://docs.aztec.network/developers/resources/considerations/privacy_considerations\n    ///\n    /// # Advanced\n    /// * The call is added to the private call stack and executed by kernel\n    ///   circuits after this function completes\n    /// * The called function can modify its own contract's private state\n    /// * Side effects from the called function are included in this transaction\n    /// * The call inherits the current transaction's context and gas limits\n    ///\n    pub fn call<let M: u32, let N: u32, T>(&mut self, call: PrivateCall<M, N, T>) -> T\n    where\n        T: Deserialize,\n    {\n        call.call(self.context)\n    }\n\n    /// Makes a read-only call to the private function defined by the `call` parameter.\n    ///\n    /// This is similar to Solidity's `staticcall`. The called function\n    /// cannot modify state, emit L2->L1 messages, nor emit events. Any nested\n    /// calls are constrained to also be static calls.\n    ///\n    /// # Arguments\n    /// * `call` - The object representing the read-only private function to invoke.\n    ///\n    /// # Returns\n    /// * `T` - Whatever data the called function has returned.\n    ///\n    /// # Example\n    /// ```noir\n    /// self.view(Token::at(address).balance_of_private(recipient));\n    /// ```\n    pub fn view<let M: u32, let N: u32, T>(&mut self, call: PrivateStaticCall<M, N, T>) -> T\n    where\n        T: Deserialize,\n    {\n        call.view(self.context)\n    }\n\n    /// Enqueues a call to the public function defined by the `call` parameter,\n    /// to be executed later.\n    ///\n    /// Unlike private functions which execute immediately on the user's device,\n    /// public function calls are \"enqueued\" and executed some time later by a\n    /// block proposer.\n    ///\n    /// This means a public function cannot return any values back to a private\n    /// function, because by the time the public function is being executed,\n    /// the private function which called it has already completed execution.\n    /// (In fact, the private function has been executed and proven, along with\n    /// all other private function calls of the user's tx. A single proof of the\n    /// tx has been submitted to the Aztec network, and some time later a\n    /// proposer has picked the tx up from the mempool and begun executing all\n    /// of the enqueued public functions).\n    ///\n    /// # Privacy warning\n    /// Enqueueing a public function call is an inherently leaky action.\n    /// Many interesting applications will require some interaction with public\n    /// state, but smart contract developers should try to use public function\n    /// calls sparingly, and carefully.\n    /// _Internal_ public function calls are especially leaky, because they\n    /// completely leak which private contract made the call.\n    /// See also: https://docs.aztec.network/developers/resources/considerations/privacy_considerations\n    ///\n    /// # Arguments\n    /// * `call` - The interface representing the public function to enqueue.\n    ///\n    /// TODO(F-131): We should drop T from here because it is strange as there\n    /// is no return value. The PublicCall type seems to be defined\n    /// incorrectly.\n    pub fn enqueue<let M: u32, let N: u32, T>(&mut self, call: PublicCall<M, N, T>)\n    where\n        T: Deserialize,\n    {\n        call.enqueue(self.context)\n    }\n\n    /// Enqueues a read-only call to the public function defined by the `call` parameter.\n    ///\n    /// This is similar to Solidity's `staticcall`. The called function\n    /// cannot modify state, emit L2->L1 messages, nor emit events. Any nested\n    /// calls are constrained to also be static calls.\n    ///\n    /// # Arguments\n    /// * `call` - The object representing the read-only public function to enqueue.\n    ///\n    /// # Example\n    /// ```noir\n    /// self.enqueue_view(MyContract::at(address).assert_timestamp_less_than(timestamp));\n    /// ```\n    ///\n    /// TODO(F-131): We should drop T from here because it is strange as there\n    /// is no return value. The PublicCall type seems to be defined\n    /// incorrectly.\n    pub fn enqueue_view<let M: u32, let N: u32, T>(&mut self, call: PublicStaticCall<M, N, T>)\n    where\n        T: Deserialize,\n    {\n        call.enqueue_view(self.context)\n    }\n\n    /// Enqueues a call to the public function defined by the `call` parameter,\n    /// to be executed later.\n    ///\n    /// As per `enqueue`, but hides this calling contract's address from the\n    /// target public function.\n    /// This means the origin of the call (msg_sender) will not be publicly\n    /// visible to any blockchain observers, nor to the target public function.\n    /// When the target public function reads `context.msg_sender()` it will\n    /// receive an `Option<AztecAddress>::none`.\n    ///\n    /// NOTES:\n    /// - Not all public functions will accept a msg_sender of \"none\". Many\n    ///   public functions will require that msg_sender is \"some\" and will\n    ///   revert otherwise. Therefore, if using `enqueue_incognito`, you must\n    ///   understand whether the function you're calling will accept a\n    ///   msg_sender of \"none\".\n    ///   Lots of public bookkeeping patterns rely on knowing which address made\n    ///   the call, so as to ascribe state against the caller's address.\n    ///   (There are patterns whereby bookkeeping could instead be done in\n    ///   private-land).\n    /// - If you are enqueueing a call to an _internal_ public function (i.e.\n    ///   a public function that will only accept calls from other functions\n    ///   of its own contract), then by definition a call to it cannot possibly\n    ///   be \"incognito\": the msg_sender must be its own address, and indeed the\n    ///   called public function will assert this. Tl;dr this is not usable for\n    ///   enqueued internal public calls.\n    ///\n    /// # Arguments\n    /// * `call` - The object representing the public function to enqueue.\n    ///\n    /// # Example\n    /// ```noir\n    /// self.enqueue_incognito(Token::at(address).increase_total_supply_by(amount));\n    /// ```\n    ///\n    /// Advanced:\n    /// - The kernel circuits will permit _any_ private function to set the\n    ///   msg_sender field of any enqueued public function call to\n    ///   NULL_MSG_SENDER_CONTRACT_ADDRESS.\n    /// - When the called public function calls `PublicContext::msg_sender()`,\n    ///   aztec-nr will translate NULL_MSG_SENDER_CONTRACT_ADDRESS into\n    ///   `Option<AztecAddress>::none` for familiarity to devs.\n    ///\n    /// TODO(F-131): We should drop T from here because it is strange as there\n    /// is no return value. The PublicCall type seems to be defined\n    /// incorrectly.\n    pub fn enqueue_incognito<let M: u32, let N: u32, T>(&mut self, call: PublicCall<M, N, T>)\n    where\n        T: Deserialize,\n    {\n        call.enqueue_incognito(self.context)\n    }\n\n    /// Enqueues a read-only call to the public function defined by the `call` parameter.\n    ///\n    /// As per `enqueue_view`, but hides this calling contract's address from\n    /// the target public function.\n    ///\n    /// See `enqueue_incognito` for more details relating to hiding msg_sender.\n    ///\n    /// # Arguments\n    /// * `call` - The object representing the read-only public function to enqueue.\n    ///\n    /// # Example\n    /// ```noir\n    /// self.enqueue_view_incognito(MyContract::at(address).assert_timestamp_less_than(timestamp));\n    /// ```\n    ///\n    /// TODO(F-131): We should drop T from here because it is strange as there\n    /// is no return value. The PublicCall type seems to be defined\n    /// incorrectly.\n    pub fn enqueue_view_incognito<let M: u32, let N: u32, T>(\n        &mut self,\n        call: PublicStaticCall<M, N, T>,\n    )\n    where\n        T: Deserialize,\n    {\n        call.enqueue_view_incognito(self.context)\n    }\n\n    /// Enqueues a call to the public function defined by the `call` parameter,\n    /// and designates it to be the teardown function for this tx. Only one teardown\n    /// function call can be made by a tx.\n    ///\n    /// Niche function: Only wallet developers and paymaster contract developers\n    /// (aka Fee-payment contracts) will need to make use of this function.\n    ///\n    /// Aztec supports a three-phase execution model: setup, app logic, teardown.\n    /// The phases exist to enable a fee payer to take on the risk of paying\n    /// a transaction fee, safe in the knowledge that their payment (in whatever\n    /// token or method the user chooses) will succeed, regardless of whether\n    /// the app logic will succeed. The \"setup\" phase ensures the fee payer\n    /// has sufficient balance to pay the proposer their fees.\n    /// The teardown phase is primarily intended to: calculate exactly\n    /// how much the user owes, based on gas consumption, and refund the user\n    /// any change.\n    ///\n    /// Note: in some cases, the cost of refunding the user (i.e. DA costs of\n    /// tx side-effects) might exceed the refund amount. For app logic with\n    /// fairly stable and predictable gas consumption, a material refund amount\n    /// is unlikely. For app logic with unpredictable gas consumption, a\n    /// refund might be important to the user (e.g. if a hefty function reverts\n    /// very early). Wallet/FPC/Paymaster developers should be mindful of this.\n    ///\n    /// See `enqueue` for more information about enqueuing public function calls.\n    ///\n    /// # Arguments\n    /// * `call` - The object representing the public function to designate as teardown.\n    ///\n    /// TODO(F-131): We should drop T from here because it is strange as there\n    /// is no return value. The PublicCall type seems to be defined\n    /// incorrectly.\n    pub fn set_as_teardown<let M: u32, let N: u32, T>(&mut self, call: PublicCall<M, N, T>)\n    where\n        T: Deserialize,\n    {\n        call.set_as_teardown(self.context)\n    }\n\n    /// Enqueues a call to the public function defined by the `call` parameter,\n    /// and designates it to be the teardown function for this tx. Only one teardown\n    /// function call can be made by a tx.\n    ///\n    /// As per `set_as_teardown`, but hides this calling contract's address from\n    /// the target public function.\n    ///\n    /// See `enqueue_incognito` for more details relating to hiding msg_sender.\n    ///\n    /// TODO(F-131): We should drop T from here because it is strange as there\n    /// is no return value. The PublicCall type seems to be defined\n    /// incorrectly.\n    pub fn set_as_teardown_incognito<let M: u32, let N: u32, T>(\n        &mut self,\n        call: PublicCall<M, N, T>,\n    )\n    where\n        T: Deserialize,\n    {\n        call.set_as_teardown_incognito(self.context)\n    }\n}\n\n/// Implementation for `ContractSelf` in public execution contexts.\n///\n/// This implementation is used when a contract function is marked with `#[external(\"public\")]`.\n/// Public functions are executed by the sequencer in the Aztec Virtual Machine (AVM) and can work only with public\n/// state.\nimpl<Storage, CallSelf, CallSelfStatic, CallInternal> ContractSelf<PublicContext, Storage, CallSelf, (), CallSelfStatic, (), CallInternal> {\n    /// Creates a new `ContractSelf` instance for a public function.\n    ///\n    /// This constructor is called automatically by the macro system and should not be called directly.\n    pub fn new_public(\n        context: PublicContext,\n        storage: Storage,\n        call_self: CallSelf,\n        call_self_static: CallSelfStatic,\n        internal: CallInternal,\n    ) -> Self {\n        Self {\n            context,\n            storage,\n            address: context.this_address(),\n            call_self,\n            enqueue_self: (),\n            call_self_static,\n            enqueue_self_static: (),\n            internal,\n        }\n    }\n\n    /// Returns the contract address that initiated this function call.\n    ///\n    /// This is similar to `msg.sender` in Solidity (hence the name).\n    ///\n    /// Important Note: If the calling function is a _private_ function, then it had the option of hiding its address\n    /// when enqueuing this public function call. In such cases, this `context.msg_sender()` method will return\n    /// `Option<AztecAddress>::none`. If the calling function is a _public_ function, it will always return an\n    /// `Option<AztecAddress>::some` (i.e. a non-null value).\n    ///\n    /// # Returns\n    /// * `Option<AztecAddress>` - The address of the smart contract that called this function (be it an app contract or\n    ///   a user's account contract).\n    ///\n    /// # Advanced\n    /// * Value is provided by the AVM sender opcode\n    /// * In nested calls, this is the immediate caller, not the original transaction sender\n    ///\n    pub fn msg_sender(self: Self) -> Option<AztecAddress> {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        let maybe_msg_sender = self.context.msg_sender_unsafe();\n        if maybe_msg_sender == NULL_MSG_SENDER_CONTRACT_ADDRESS {\n            Option::none()\n        } else {\n            Option::some(maybe_msg_sender)\n        }\n    }\n\n    /// Emits an event from a public function.\n    ///\n    /// Events in public functions are emitted in plaintext and are visible to everyone.\n    /// Unlike private events, they don't require a recipient parameter.\n    ///\n    /// # Parameters\n    /// - `event`: The event to emit (must implement `EventInterface` and `Serialize`)\n    ///\n    /// # Example\n    /// ```noir\n    /// #[external(\"public\")]\n    /// fn publish_update(value: Field) {\n    ///     // ... update logic ...\n    ///     self.emit(UpdateEvent { value });\n    /// }\n    /// ```\n    pub fn emit<Event>(&mut self, event: Event)\n    where\n        Event: EventInterface + Serialize,\n    {\n        emit_event_in_public(event, self.context);\n    }\n\n    /// Makes the call to the public function defined by the `call` parameter.\n    ///\n    /// Will revert if the called function reverts or runs out of gas.\n    ///\n    /// # Arguments\n    /// * `call` - The object representing the public function to invoke.\n    ///\n    /// # Returns\n    /// * `T` - Whatever data the called function has returned.\n    ///\n    /// # Example\n    /// ```noir\n    /// self.call(Token::at(address).transfer_in_public(recipient, amount));\n    /// ```\n    ///\n    pub unconstrained fn call<let M: u32, let N: u32, T>(self, call: PublicCall<M, N, T>) -> T\n    where\n        T: Deserialize,\n    {\n        call.call(self.context)\n    }\n\n    /// Makes the read-only call to the public function defined by the `call` parameter.\n    ///\n    /// This is similar to Solidity's `staticcall`. The called function\n    /// cannot modify state or emit events. Any nested calls are constrained to\n    /// also be static calls.\n    ///\n    /// Will revert if the called function reverts or runs out of gas.\n    ///\n    /// # Arguments\n    /// * `call` - The object representing the read-only public function to invoke.\n    ///\n    /// # Returns\n    /// * `T` - Whatever data the called function has returned.\n    ///\n    /// # Example\n    /// ```noir\n    /// self.view(Token::at(address).balance_of_public(recipient));\n    /// ```\n    ///\n    pub unconstrained fn view<let M: u32, let N: u32, T>(self, call: PublicStaticCall<M, N, T>) -> T\n    where\n        T: Deserialize,\n    {\n        call.view(self.context)\n    }\n}\n\n/// Implementation for `ContractSelf` in utility execution contexts.\n///\n/// This implementation is used when a contract function is marked with `#[external(\"utility\")]`.\n/// Utility functions are unconstrained functions that can read private state for offchain queries.\n/// They are typically used for view functions that need to access private notes (e.g. a Token's balance_of function).\nimpl<Storage> ContractSelf<UtilityContext, Storage, (), (), (), (), ()> {\n    /// Creates a new `ContractSelf` instance for a utility function.\n    ///\n    /// This constructor is called automatically by the macro system and should not be called directly.\n    pub fn new_utility(context: UtilityContext, storage: Storage) -> Self {\n        Self {\n            context,\n            storage,\n            address: context.this_address(),\n            call_self: (),\n            enqueue_self: (),\n            call_self_static: (),\n            enqueue_self_static: (),\n            internal: (),\n        }\n    }\n}\n"
+      "source": "use crate::{\n    context::{\n        calls::{PrivateCall, PrivateStaticCall, PublicCall, PublicStaticCall},\n        private_context::PrivateContext,\n        public_context::PublicContext,\n        utility_context::UtilityContext,\n    },\n    event::{\n        event_emission::{emit_event_in_private, emit_event_in_public},\n        event_interface::EventInterface,\n        event_message::EventMessage,\n    },\n};\nuse protocol_types::{\n    address::AztecAddress,\n    constants::NULL_MSG_SENDER_CONTRACT_ADDRESS,\n    traits::{Deserialize, Serialize},\n};\n\n/// `ContractSelf` is the core interface for interacting with an Aztec contract's own state and context.\n///\n/// This struct is automatically injected into every #[external(...)] contract function by the Aztec macro system and is\n/// accessible through the `self` variable.\n///\n/// # Usage in Contract Functions\n///\n/// Once injected, you can use `self` to:\n/// - Access storage: `self.storage.balances.at(owner).read()`\n/// - Call contracts: `self.call(Token::at(address).transfer(recipient, amount))`\n/// - Emit events: `self.emit(event).deliver_to(recipient, delivery_mode)` (private) or `self.emit(event)` (public)\n/// - Get the contract address: `self.address`\n/// - Get the caller: `self.msg_sender()`\n/// - Access low-level Aztec.nr APIs through the context: `self.context`\n///\n/// # Example\n///\n/// ```noir\n/// #[external(\"private\")]\n/// fn withdraw(amount: u128, recipient: AztecAddress) {\n///     // Get the caller of this function\n///     let sender = self.msg_sender().unwrap();\n///\n///     // Access storage\n///     let token = self.storage.donation_token.get_note().get_address();\n///\n///     // Call contracts\n///     self.call(Token::at(token).transfer(recipient, amount));\n/// }\n/// ```\n///\n/// # Type Parameters\n///\n/// - `Context`: The execution context type - either `&mut PrivateContext`, `PublicContext`, or `UtilityContext`\n/// - `Storage`: The contract's storage struct (defined with `#[storage]`), or `()` if the contract has no storage\n/// - `CallSelf`: Macro-generated type for calling contract's own non-view functions\n/// - `EnqueueSelf`: Macro-generated type for enqueuing calls to the contract's own non-view functions\n/// - `CallSelfStatic`: Macro-generated type for calling contract's own view functions\n/// - `EnqueueSelfStatic`: Macro-generated type for enqueuing calls to the contract's own view functions\npub struct ContractSelf<Context, Storage, CallSelf, EnqueueSelf, CallSelfStatic, EnqueueSelfStatic, CallInternal> {\n    /// The address of this contract\n    pub address: AztecAddress,\n    /// The contract's storage instance, representing the struct to which the `#[storage]` macro was applied in your\n    /// contract. If the contract has no storage, the type of this will be `()`.\n    ///\n    /// This storage instance is specialized for the current execution context (private, public, or utility) and\n    /// provides access to the contract's state variables. Each state variable accepts the context as a generic\n    /// parameter, which determines its available functionality. For example, a PublicImmutable variable can be read\n    /// from any context (public, private, or utility) but can only be written to from public contexts.\n    ///\n    /// # Developer Note\n    /// If you've arrived here while trying to access your contract's storage while the `Storage` generic type is set to\n    /// unit type `()`, it means you haven't yet defined a Storage struct using the #[storage] macro in your contract.\n    /// For guidance on setting this up, please refer to our docs:\n    /// https://docs.aztec.network/developers/docs/guides/smart_contracts/storage\n    pub storage: Storage,\n    /// The execution context whose type is determined by the #[external(...)] attribute of the contract function based\n    /// on the external function type (private, public, or utility).\n    pub context: Context,\n\n    /// Provides type-safe methods for calling this contract's own non-view functions.\n    ///\n    /// In private and public contexts this will be a struct with appropriate methods;\n    /// in utility context it will be the unit type `()`.\n    ///\n    /// Example API:\n    /// ```noir\n    /// self.call_self.some_private_function(args)\n    /// ```\n    pub call_self: CallSelf,\n    /// Provides type-safe methods for enqueuing calls to this contract's own non-view functions.\n    ///\n    /// In private context this will be a struct with appropriate methods;\n    /// in public and utility contexts it will be the unit type `()`.\n    ///\n    /// Example API:\n    /// ```noir\n    /// self.enqueue_self.some_public_function(args)\n    /// ```\n    pub enqueue_self: EnqueueSelf,\n    /// Provides type-safe methods for calling this contract's own view functions.\n    ///\n    /// In private and public contexts this will be a struct with appropriate methods;\n    /// in utility context it will be the unit type `()`.\n    ///\n    /// Example API:\n    /// ```noir\n    /// self.call_self_static.some_view_function(args)\n    /// ```\n    pub call_self_static: CallSelfStatic,\n    /// Provides type-safe methods for enqueuing calls to this contract's own view functions.\n    ///\n    /// In private context this will be a struct with appropriate methods;\n    /// in public and utility contexts it will be the unit type `()`.\n    ///\n    /// Example API:\n    /// ```noir\n    /// self.enqueue_self_static.some_public_view_function(args)\n    /// ```\n    pub enqueue_self_static: EnqueueSelfStatic,\n    /// Provides type-safe methods for calling internal functions.\n    ///\n    /// In private and public contexts this will be a struct with appropriate methods;\n    /// in utility context it will be the unit type `()`.\n    ///\n    /// Example API:\n    /// ```noir\n    /// self.internal.some_internal_function(args)\n    /// ```\n    pub internal: CallInternal,\n}\n\n/// Implementation for `ContractSelf` in private execution contexts.\n///\n/// This implementation is used when a contract function is marked with `#[external(\"private\")]`.\n/// Private functions execute client-side and generate zero-knowledge proofs of their execution.\nimpl<Storage, CallSelf, EnqueueSelf, CallSelfStatic, EnqueueSelfStatic, CallInternal> ContractSelf<&mut PrivateContext, Storage, CallSelf, EnqueueSelf, CallSelfStatic, EnqueueSelfStatic, CallInternal> {\n    /// Creates a new `ContractSelf` instance for a private function.\n    ///\n    /// This constructor is called automatically by the macro system and should not be called directly.\n    pub fn new_private(\n        context: &mut PrivateContext,\n        storage: Storage,\n        call_self: CallSelf,\n        enqueue_self: EnqueueSelf,\n        call_self_static: CallSelfStatic,\n        enqueue_self_static: EnqueueSelfStatic,\n        internal: CallInternal,\n    ) -> Self {\n        Self {\n            context,\n            storage,\n            address: context.this_address(),\n            call_self,\n            enqueue_self,\n            call_self_static,\n            enqueue_self_static,\n            internal,\n        }\n    }\n\n    /// Returns the contract address that initiated this function call. This is similar to `msg.sender` in Solidity.\n    ///\n    /// Important Note: Since Aztec doesn't have a concept of an EoA ( Externally-owned Account), the msg_sender is\n    /// \"null\" for the first function call of every transaction. The first function call of a tx is likely to be a call\n    /// to the user's account contract, so this quirk will most often be handled by account contract developers.\n    ///\n    /// # Returns\n    /// * `Option<AztecAddress>` - The address of the smart contract that called this function (be it an app contract or\n    ///   a user's account contract). Returns `Option<AztecAddress>::none` for the first function call of the tx. No\n    ///   other _private_ function calls in the tx will have a `none` msg_sender, but _public_ function calls might (see\n    ///   the PublicContext).\n    ///\n    pub fn msg_sender(self) -> Option<AztecAddress> {\n        let maybe_msg_sender = self.context.msg_sender_unsafe();\n        if maybe_msg_sender == NULL_MSG_SENDER_CONTRACT_ADDRESS {\n            Option::none()\n        } else {\n            Option::some(maybe_msg_sender)\n        }\n    }\n\n    /// Emits an event privately.\n    ///\n    /// Unlike public events, private events do not reveal their contents publicly. They instead create an\n    /// [EventMessage] containing the private event information, which **MUST** be delivered to a recipient via\n    /// [EventMessage::deliver_to] in order for them to learn about the event. Multiple recipients can have the same\n    /// message be delivered to them.\n    ///\n    /// # Example\n    /// ```noir\n    /// #[event]\n    /// struct Transfer { from: AztecAddress, to: AztecAddress, amount: u128 }\n    ///\n    /// #[external(\"private\")]\n    /// fn transfer(to: AztecAddress, amount: u128) {\n    ///     let from = self.msg_sender().unwrap();\n    ///\n    ///     let message: EventMessage = self.emit(Transfer { from, to, amount });\n    ///     message.deliver_to(from, MessageDelivery.UNCONSTRAINED_OFFCHAIN);\n    ///     message.deliver_to(to, MessageDelivery.CONSTRAINED_ONCHAIN);\n    /// }\n    /// ```\n    ///\n    /// # Cost\n    ///\n    /// Private event emission always results in the creation of a nullifer, which acts as a commitment to the event and\n    /// is used by third parties to verify its authenticity. See [EventMessage::deliver_to] for the costs associated to\n    /// delivery.\n    ///\n    /// # Privacy\n    ///\n    /// The nullifier created when emitting a private event leaks nothing about the content of the event - it's a\n    /// commitment that includes a random value, so even with full knowledge of the event preimage determining if an\n    /// event was emitted or not requires brute-forcing the entire `Field` space.\n    pub fn emit<Event>(&mut self, event: Event) -> EventMessage<Event>\n    where\n        Event: EventInterface + Serialize,\n    {\n        emit_event_in_private(self.context, event)\n    }\n\n    /// Makes a call to the private function defined by the `call` parameter.\n    ///\n    /// # Arguments\n    /// * `call` - The object representing the private function to invoke.\n    ///\n    /// # Returns\n    /// * `T` - Whatever data the called function has returned.\n    ///\n    /// # Example\n    /// ```noir\n    /// self.call(Token::at(address).transfer_in_private(recipient, amount));\n    /// ```\n    ///\n    /// This enables contracts to interact with each other while maintaining\n    /// privacy. This \"composability\" of private contract functions is a key\n    /// feature of the Aztec network.\n    ///\n    /// If a user's transaction includes multiple private function calls, then\n    /// by the design of Aztec, the following information will remain private[1]:\n    /// - The function selectors and contract addresses of all private function\n    ///   calls will remain private, so an observer of the public mempool will\n    ///   not be able to look at a tx and deduce which private functions have\n    ///   been executed.\n    /// - The arguments and return values of all private function calls will\n    ///   remain private.\n    /// - The person who initiated the tx will remain private.\n    /// - The notes and nullifiers and private logs that are emitted by all\n    ///   private function calls will (if designed well) not leak any user\n    ///   secrets, nor leak which functions have been executed.\n    ///\n    /// [1] Caveats: Some of these privacy guarantees depend on how app\n    /// developers design their smart contracts. Some actions _can_ leak\n    /// information, such as:\n    /// - Calling an internal public function.\n    /// - Calling a public function and not setting msg_sender to Option::none\n    ///   (see https://github.com/AztecProtocol/aztec-packages/pull/16433)\n    /// - Calling any public function will always leak details about the nature\n    ///   of the transaction, so devs should be careful in their contract\n    ///   designs. If it can be done in a private function, then that will give\n    ///   the best privacy.\n    /// - Not padding the side-effects of a tx to some standardized, uniform\n    ///   size. The kernel circuits can take hints to pad side-effects, so a\n    ///   wallet should be able to request for a particular amount of padding.\n    ///   Wallets should ideally agree on some standard.\n    ///   - Padding should include:\n    ///     - Padding the lengths of note & nullifier arrays\n    ///     - Padding private logs with random fields, up to some standardized\n    ///       size.\n    /// See also: https://docs.aztec.network/developers/resources/considerations/privacy_considerations\n    ///\n    /// # Advanced\n    /// * The call is added to the private call stack and executed by kernel\n    ///   circuits after this function completes\n    /// * The called function can modify its own contract's private state\n    /// * Side effects from the called function are included in this transaction\n    /// * The call inherits the current transaction's context and gas limits\n    ///\n    pub fn call<let M: u32, let N: u32, T>(&mut self, call: PrivateCall<M, N, T>) -> T\n    where\n        T: Deserialize,\n    {\n        call.call(self.context)\n    }\n\n    /// Makes a read-only call to the private function defined by the `call` parameter.\n    ///\n    /// This is similar to Solidity's `staticcall`. The called function\n    /// cannot modify state, emit L2->L1 messages, nor emit events. Any nested\n    /// calls are constrained to also be static calls.\n    ///\n    /// # Arguments\n    /// * `call` - The object representing the read-only private function to invoke.\n    ///\n    /// # Returns\n    /// * `T` - Whatever data the called function has returned.\n    ///\n    /// # Example\n    /// ```noir\n    /// self.view(Token::at(address).balance_of_private(recipient));\n    /// ```\n    pub fn view<let M: u32, let N: u32, T>(&mut self, call: PrivateStaticCall<M, N, T>) -> T\n    where\n        T: Deserialize,\n    {\n        call.view(self.context)\n    }\n\n    /// Enqueues a call to the public function defined by the `call` parameter,\n    /// to be executed later.\n    ///\n    /// Unlike private functions which execute immediately on the user's device,\n    /// public function calls are \"enqueued\" and executed some time later by a\n    /// block proposer.\n    ///\n    /// This means a public function cannot return any values back to a private\n    /// function, because by the time the public function is being executed,\n    /// the private function which called it has already completed execution.\n    /// (In fact, the private function has been executed and proven, along with\n    /// all other private function calls of the user's tx. A single proof of the\n    /// tx has been submitted to the Aztec network, and some time later a\n    /// proposer has picked the tx up from the mempool and begun executing all\n    /// of the enqueued public functions).\n    ///\n    /// # Privacy warning\n    /// Enqueueing a public function call is an inherently leaky action.\n    /// Many interesting applications will require some interaction with public\n    /// state, but smart contract developers should try to use public function\n    /// calls sparingly, and carefully.\n    /// _Internal_ public function calls are especially leaky, because they\n    /// completely leak which private contract made the call.\n    /// See also: https://docs.aztec.network/developers/resources/considerations/privacy_considerations\n    ///\n    /// # Arguments\n    /// * `call` - The interface representing the public function to enqueue.\n    ///\n    /// TODO(F-131): We should drop T from here because it is strange as there\n    /// is no return value. The PublicCall type seems to be defined\n    /// incorrectly.\n    pub fn enqueue<let M: u32, let N: u32, T>(&mut self, call: PublicCall<M, N, T>)\n    where\n        T: Deserialize,\n    {\n        call.enqueue(self.context)\n    }\n\n    /// Enqueues a read-only call to the public function defined by the `call` parameter.\n    ///\n    /// This is similar to Solidity's `staticcall`. The called function\n    /// cannot modify state, emit L2->L1 messages, nor emit events. Any nested\n    /// calls are constrained to also be static calls.\n    ///\n    /// # Arguments\n    /// * `call` - The object representing the read-only public function to enqueue.\n    ///\n    /// # Example\n    /// ```noir\n    /// self.enqueue_view(MyContract::at(address).assert_timestamp_less_than(timestamp));\n    /// ```\n    ///\n    /// TODO(F-131): We should drop T from here because it is strange as there\n    /// is no return value. The PublicCall type seems to be defined\n    /// incorrectly.\n    pub fn enqueue_view<let M: u32, let N: u32, T>(&mut self, call: PublicStaticCall<M, N, T>)\n    where\n        T: Deserialize,\n    {\n        call.enqueue_view(self.context)\n    }\n\n    /// Enqueues a call to the public function defined by the `call` parameter,\n    /// to be executed later.\n    ///\n    /// As per `enqueue`, but hides this calling contract's address from the\n    /// target public function.\n    /// This means the origin of the call (msg_sender) will not be publicly\n    /// visible to any blockchain observers, nor to the target public function.\n    /// When the target public function reads `context.msg_sender()` it will\n    /// receive an `Option<AztecAddress>::none`.\n    ///\n    /// NOTES:\n    /// - Not all public functions will accept a msg_sender of \"none\". Many\n    ///   public functions will require that msg_sender is \"some\" and will\n    ///   revert otherwise. Therefore, if using `enqueue_incognito`, you must\n    ///   understand whether the function you're calling will accept a\n    ///   msg_sender of \"none\".\n    ///   Lots of public bookkeeping patterns rely on knowing which address made\n    ///   the call, so as to ascribe state against the caller's address.\n    ///   (There are patterns whereby bookkeeping could instead be done in\n    ///   private-land).\n    /// - If you are enqueueing a call to an _internal_ public function (i.e.\n    ///   a public function that will only accept calls from other functions\n    ///   of its own contract), then by definition a call to it cannot possibly\n    ///   be \"incognito\": the msg_sender must be its own address, and indeed the\n    ///   called public function will assert this. Tl;dr this is not usable for\n    ///   enqueued internal public calls.\n    ///\n    /// # Arguments\n    /// * `call` - The object representing the public function to enqueue.\n    ///\n    /// # Example\n    /// ```noir\n    /// self.enqueue_incognito(Token::at(address).increase_total_supply_by(amount));\n    /// ```\n    ///\n    /// Advanced:\n    /// - The kernel circuits will permit _any_ private function to set the\n    ///   msg_sender field of any enqueued public function call to\n    ///   NULL_MSG_SENDER_CONTRACT_ADDRESS.\n    /// - When the called public function calls `PublicContext::msg_sender()`,\n    ///   aztec-nr will translate NULL_MSG_SENDER_CONTRACT_ADDRESS into\n    ///   `Option<AztecAddress>::none` for familiarity to devs.\n    ///\n    /// TODO(F-131): We should drop T from here because it is strange as there\n    /// is no return value. The PublicCall type seems to be defined\n    /// incorrectly.\n    pub fn enqueue_incognito<let M: u32, let N: u32, T>(&mut self, call: PublicCall<M, N, T>)\n    where\n        T: Deserialize,\n    {\n        call.enqueue_incognito(self.context)\n    }\n\n    /// Enqueues a read-only call to the public function defined by the `call` parameter.\n    ///\n    /// As per `enqueue_view`, but hides this calling contract's address from\n    /// the target public function.\n    ///\n    /// See `enqueue_incognito` for more details relating to hiding msg_sender.\n    ///\n    /// # Arguments\n    /// * `call` - The object representing the read-only public function to enqueue.\n    ///\n    /// # Example\n    /// ```noir\n    /// self.enqueue_view_incognito(MyContract::at(address).assert_timestamp_less_than(timestamp));\n    /// ```\n    ///\n    /// TODO(F-131): We should drop T from here because it is strange as there\n    /// is no return value. The PublicCall type seems to be defined\n    /// incorrectly.\n    pub fn enqueue_view_incognito<let M: u32, let N: u32, T>(\n        &mut self,\n        call: PublicStaticCall<M, N, T>,\n    )\n    where\n        T: Deserialize,\n    {\n        call.enqueue_view_incognito(self.context)\n    }\n\n    /// Enqueues a call to the public function defined by the `call` parameter,\n    /// and designates it to be the teardown function for this tx. Only one teardown\n    /// function call can be made by a tx.\n    ///\n    /// Niche function: Only wallet developers and paymaster contract developers\n    /// (aka Fee-payment contracts) will need to make use of this function.\n    ///\n    /// Aztec supports a three-phase execution model: setup, app logic, teardown.\n    /// The phases exist to enable a fee payer to take on the risk of paying\n    /// a transaction fee, safe in the knowledge that their payment (in whatever\n    /// token or method the user chooses) will succeed, regardless of whether\n    /// the app logic will succeed. The \"setup\" phase ensures the fee payer\n    /// has sufficient balance to pay the proposer their fees.\n    /// The teardown phase is primarily intended to: calculate exactly\n    /// how much the user owes, based on gas consumption, and refund the user\n    /// any change.\n    ///\n    /// Note: in some cases, the cost of refunding the user (i.e. DA costs of\n    /// tx side-effects) might exceed the refund amount. For app logic with\n    /// fairly stable and predictable gas consumption, a material refund amount\n    /// is unlikely. For app logic with unpredictable gas consumption, a\n    /// refund might be important to the user (e.g. if a hefty function reverts\n    /// very early). Wallet/FPC/Paymaster developers should be mindful of this.\n    ///\n    /// See `enqueue` for more information about enqueuing public function calls.\n    ///\n    /// # Arguments\n    /// * `call` - The object representing the public function to designate as teardown.\n    ///\n    /// TODO(F-131): We should drop T from here because it is strange as there\n    /// is no return value. The PublicCall type seems to be defined\n    /// incorrectly.\n    pub fn set_as_teardown<let M: u32, let N: u32, T>(&mut self, call: PublicCall<M, N, T>)\n    where\n        T: Deserialize,\n    {\n        call.set_as_teardown(self.context)\n    }\n\n    /// Enqueues a call to the public function defined by the `call` parameter,\n    /// and designates it to be the teardown function for this tx. Only one teardown\n    /// function call can be made by a tx.\n    ///\n    /// As per `set_as_teardown`, but hides this calling contract's address from\n    /// the target public function.\n    ///\n    /// See `enqueue_incognito` for more details relating to hiding msg_sender.\n    ///\n    /// TODO(F-131): We should drop T from here because it is strange as there\n    /// is no return value. The PublicCall type seems to be defined\n    /// incorrectly.\n    pub fn set_as_teardown_incognito<let M: u32, let N: u32, T>(\n        &mut self,\n        call: PublicCall<M, N, T>,\n    )\n    where\n        T: Deserialize,\n    {\n        call.set_as_teardown_incognito(self.context)\n    }\n}\n\n/// Implementation for `ContractSelf` in public execution contexts.\n///\n/// This implementation is used when a contract function is marked with `#[external(\"public\")]`.\n/// Public functions are executed by the sequencer in the Aztec Virtual Machine (AVM) and can work only with public\n/// state.\nimpl<Storage, CallSelf, CallSelfStatic, CallInternal> ContractSelf<PublicContext, Storage, CallSelf, (), CallSelfStatic, (), CallInternal> {\n    /// Creates a new `ContractSelf` instance for a public function.\n    ///\n    /// This constructor is called automatically by the macro system and should not be called directly.\n    pub fn new_public(\n        context: PublicContext,\n        storage: Storage,\n        call_self: CallSelf,\n        call_self_static: CallSelfStatic,\n        internal: CallInternal,\n    ) -> Self {\n        Self {\n            context,\n            storage,\n            address: context.this_address(),\n            call_self,\n            enqueue_self: (),\n            call_self_static,\n            enqueue_self_static: (),\n            internal,\n        }\n    }\n\n    /// Returns the contract address that initiated this function call.\n    ///\n    /// This is similar to `msg.sender` in Solidity (hence the name).\n    ///\n    /// Important Note: If the calling function is a _private_ function, then it had the option of hiding its address\n    /// when enqueuing this public function call. In such cases, this `context.msg_sender()` method will return\n    /// `Option<AztecAddress>::none`. If the calling function is a _public_ function, it will always return an\n    /// `Option<AztecAddress>::some` (i.e. a non-null value).\n    ///\n    /// # Returns\n    /// * `Option<AztecAddress>` - The address of the smart contract that called this function (be it an app contract or\n    ///   a user's account contract).\n    ///\n    /// # Advanced\n    /// * Value is provided by the AVM sender opcode\n    /// * In nested calls, this is the immediate caller, not the original transaction sender\n    ///\n    pub fn msg_sender(self: Self) -> Option<AztecAddress> {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        let maybe_msg_sender = self.context.msg_sender_unsafe();\n        if maybe_msg_sender == NULL_MSG_SENDER_CONTRACT_ADDRESS {\n            Option::none()\n        } else {\n            Option::some(maybe_msg_sender)\n        }\n    }\n\n    /// Emits an event publicly.\n    ///\n    /// Public events are emitted as plaintext and are therefore visible to everyone. This is is the same as Solidity\n    /// events on EVM chains.\n    ///\n    /// Unlike private events, they don't require delivery of an event message.\n    ///\n    /// # Example\n    /// ```noir\n    /// #[event]\n    /// struct Update { value: Field }\n    ///\n    /// #[external(\"public\")]\n    /// fn publish_update(value: Field) {\n    ///     self.emit(Update { value });\n    /// }\n    /// ```\n    ///\n    /// # Cost\n    ///\n    /// Public event emission is achieved by emitting public transaction logs. A total of `N+1` fields are emitted,\n    /// where `N` is the serialization length of the event.\n    pub fn emit<Event>(&mut self, event: Event)\n    where\n        Event: EventInterface + Serialize,\n    {\n        emit_event_in_public(self.context, event);\n    }\n\n    /// Makes the call to the public function defined by the `call` parameter.\n    ///\n    /// Will revert if the called function reverts or runs out of gas.\n    ///\n    /// # Arguments\n    /// * `call` - The object representing the public function to invoke.\n    ///\n    /// # Returns\n    /// * `T` - Whatever data the called function has returned.\n    ///\n    /// # Example\n    /// ```noir\n    /// self.call(Token::at(address).transfer_in_public(recipient, amount));\n    /// ```\n    ///\n    pub unconstrained fn call<let M: u32, let N: u32, T>(self, call: PublicCall<M, N, T>) -> T\n    where\n        T: Deserialize,\n    {\n        call.call(self.context)\n    }\n\n    /// Makes the read-only call to the public function defined by the `call` parameter.\n    ///\n    /// This is similar to Solidity's `staticcall`. The called function\n    /// cannot modify state or emit events. Any nested calls are constrained to\n    /// also be static calls.\n    ///\n    /// Will revert if the called function reverts or runs out of gas.\n    ///\n    /// # Arguments\n    /// * `call` - The object representing the read-only public function to invoke.\n    ///\n    /// # Returns\n    /// * `T` - Whatever data the called function has returned.\n    ///\n    /// # Example\n    /// ```noir\n    /// self.view(Token::at(address).balance_of_public(recipient));\n    /// ```\n    ///\n    pub unconstrained fn view<let M: u32, let N: u32, T>(self, call: PublicStaticCall<M, N, T>) -> T\n    where\n        T: Deserialize,\n    {\n        call.view(self.context)\n    }\n}\n\n/// Implementation for `ContractSelf` in utility execution contexts.\n///\n/// This implementation is used when a contract function is marked with `#[external(\"utility\")]`.\n/// Utility functions are unconstrained functions that can read private state for offchain queries.\n/// They are typically used for view functions that need to access private notes (e.g. a Token's balance_of function).\nimpl<Storage> ContractSelf<UtilityContext, Storage, (), (), (), (), ()> {\n    /// Creates a new `ContractSelf` instance for a utility function.\n    ///\n    /// This constructor is called automatically by the macro system and should not be called directly.\n    pub fn new_utility(context: UtilityContext, storage: Storage) -> Self {\n        Self {\n            context,\n            storage,\n            address: context.this_address(),\n            call_self: (),\n            enqueue_self: (),\n            call_self_static: (),\n            enqueue_self_static: (),\n            internal: (),\n        }\n    }\n}\n"
     },
-    "76": {
+    "77": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/event/event_selector.nr",
       "source": "use dep::protocol_types::{\n    hash::poseidon2_hash_bytes,\n    traits::{Deserialize, Empty, FromField, Serialize, ToField},\n};\n\n#[derive(Deserialize, Eq, Serialize)]\npub struct EventSelector {\n    // 1st 4-bytes (big-endian leftmost) of abi-encoding of an event.\n    inner: u32,\n}\n\nimpl FromField for EventSelector {\n    fn from_field(field: Field) -> Self {\n        Self { inner: field as u32 }\n    }\n}\n\nimpl ToField for EventSelector {\n    fn to_field(self) -> Field {\n        self.inner as Field\n    }\n}\n\nimpl Empty for EventSelector {\n    fn empty() -> Self {\n        Self { inner: 0 as u32 }\n    }\n}\n\nimpl EventSelector {\n    pub fn from_u32(value: u32) -> Self {\n        Self { inner: value }\n    }\n\n    pub fn from_signature<let N: u32>(signature: str<N>) -> Self {\n        let bytes = signature.as_bytes();\n        let hash = poseidon2_hash_bytes(bytes);\n\n        // `hash` is automatically truncated to fit within 32 bits.\n        EventSelector::from_field(hash)\n    }\n\n    pub fn zero() -> Self {\n        Self { inner: 0 }\n    }\n}\n"
     },
-    "78": {
+    "79": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/hash.nr",
       "source": "use dep::protocol_types::{\n    address::{AztecAddress, EthAddress},\n    constants::{\n        GENERATOR_INDEX__FUNCTION_ARGS, GENERATOR_INDEX__MESSAGE_NULLIFIER,\n        GENERATOR_INDEX__PUBLIC_BYTECODE, GENERATOR_INDEX__PUBLIC_CALLDATA,\n        GENERATOR_INDEX__SECRET_HASH, MAX_PACKED_PUBLIC_BYTECODE_SIZE_IN_FIELDS,\n    },\n    hash::{poseidon2_hash_subarray, poseidon2_hash_with_separator, sha256_to_field},\n    point::Point,\n    traits::ToField,\n};\n\npub use dep::protocol_types::hash::{compute_siloed_nullifier, pedersen_hash};\n\npub fn pedersen_commitment<let N: u32>(inputs: [Field; N], hash_index: u32) -> Point {\n    std::hash::pedersen_commitment_with_separator(inputs, hash_index)\n}\n\npub fn compute_secret_hash(secret: Field) -> Field {\n    poseidon2_hash_with_separator([secret], GENERATOR_INDEX__SECRET_HASH)\n}\n\npub fn compute_l1_to_l2_message_hash(\n    sender: EthAddress,\n    chain_id: Field,\n    recipient: AztecAddress,\n    version: Field,\n    content: Field,\n    secret_hash: Field,\n    leaf_index: Field,\n) -> Field {\n    let mut hash_bytes = [0 as u8; 224];\n    let sender_bytes: [u8; 32] = sender.to_field().to_be_bytes();\n    let chain_id_bytes: [u8; 32] = chain_id.to_be_bytes();\n    let recipient_bytes: [u8; 32] = recipient.to_field().to_be_bytes();\n    let version_bytes: [u8; 32] = version.to_be_bytes();\n    let content_bytes: [u8; 32] = content.to_be_bytes();\n    let secret_hash_bytes: [u8; 32] = secret_hash.to_be_bytes();\n    let leaf_index_bytes: [u8; 32] = leaf_index.to_be_bytes();\n\n    for i in 0..32 {\n        hash_bytes[i] = sender_bytes[i];\n        hash_bytes[i + 32] = chain_id_bytes[i];\n        hash_bytes[i + 64] = recipient_bytes[i];\n        hash_bytes[i + 96] = version_bytes[i];\n        hash_bytes[i + 128] = content_bytes[i];\n        hash_bytes[i + 160] = secret_hash_bytes[i];\n        hash_bytes[i + 192] = leaf_index_bytes[i];\n    }\n\n    sha256_to_field(hash_bytes)\n}\n\n// The nullifier of a l1 to l2 message is the hash of the message salted with the secret\npub fn compute_l1_to_l2_message_nullifier(message_hash: Field, secret: Field) -> Field {\n    poseidon2_hash_with_separator([message_hash, secret], GENERATOR_INDEX__MESSAGE_NULLIFIER)\n}\n\n// Computes the hash of input arguments or return values for private functions, or for authwit creation.\npub fn hash_args<let N: u32>(args: [Field; N]) -> Field {\n    if args.len() == 0 {\n        0\n    } else {\n        poseidon2_hash_with_separator(args, GENERATOR_INDEX__FUNCTION_ARGS)\n    }\n}\n\n// Computes the hash of calldata for public functions.\npub fn hash_calldata_array<let N: u32>(calldata: [Field; N]) -> Field {\n    poseidon2_hash_with_separator(calldata, GENERATOR_INDEX__PUBLIC_CALLDATA)\n}\n\n/**\n * Computes the public bytecode commitment for a contract class.\n * The commitment is `hash([separator, ...bytecode])` where bytecode omits the length prefix present\n * in `packed_bytecode`.\n *\n * @param packed_bytecode - The packed bytecode of the contract class. 0th word is the length in bytes.\n *    packed_bytecode is mutable so that we can avoid copying the array to construct one starting with\n *    separator instead of length.\n * @returns The public bytecode commitment.\n */\npub fn compute_public_bytecode_commitment(\n    mut packed_public_bytecode: [Field; MAX_PACKED_PUBLIC_BYTECODE_SIZE_IN_FIELDS],\n) -> Field {\n    // First field element contains the length of the bytecode\n    let bytecode_length_in_bytes: u32 = packed_public_bytecode[0] as u32;\n    let bytecode_length_in_fields: u32 =\n        (bytecode_length_in_bytes / 31) + (bytecode_length_in_bytes % 31 != 0) as u32;\n    // Don't allow empty public bytecode.\n    // AVM doesn't handle execution of contracts that exist with empty bytecode.\n    assert(bytecode_length_in_fields != 0);\n    assert(bytecode_length_in_fields < MAX_PACKED_PUBLIC_BYTECODE_SIZE_IN_FIELDS);\n\n    // Packed_bytecode's 0th entry is the length. Replace it with separator before hashing.\n    let separator = GENERATOR_INDEX__PUBLIC_BYTECODE.to_field();\n    packed_public_bytecode[0] = separator;\n\n    // `fields_to_hash` is the number of fields from the start of `packed_public_bytecode` that should be included in\n    // the hash. Fields after this length are ignored.\n    // +1 to account for the separator.\n    let num_fields_to_hash = bytecode_length_in_fields + 1;\n\n    poseidon2_hash_subarray(packed_public_bytecode, num_fields_to_hash)\n}\n\n#[test]\nunconstrained fn compute_var_args_hash() {\n    let mut input = [0; 100];\n    for i in 0..100 {\n        input[i] = i as Field;\n    }\n    let hash = hash_args(input);\n    dep::std::println(hash);\n    // Used in yarn-project/stdlib test snapshots:\n    assert(hash == 0x19b0d74feb06ebde19edd85a28986c97063e84b3b351a8b666c7cac963ce655f);\n}\n\n#[test]\nunconstrained fn compute_calldata_hash() {\n    let mut input = [0; 100];\n    for i in 0..input.len() {\n        input[i] = i as Field;\n    }\n    let hash = hash_calldata_array(input);\n    // Used in cpp vm2 tests:\n    assert(hash == 0x191383c9f8964afd3ea8879a03b7dda65d6724773966d18dcf80e452736fc1f3);\n}\n\n#[test]\nunconstrained fn public_bytecode_commitment() {\n    let mut input = [0; MAX_PACKED_PUBLIC_BYTECODE_SIZE_IN_FIELDS];\n    let len = 99;\n    for i in 1..len + 1 {\n        input[i] = i as Field;\n    }\n    input[0] = (len as Field) * 31;\n    let hash = compute_public_bytecode_commitment(input);\n    dep::std::println(hash);\n    // Used in cpp vm2 tests:\n    assert(hash == 0x16d621c3387156ef53754679e7b2c9be8f0bceeb44aa59a74991df3b0b42a0bf);\n}\n"
-    },
-    "99": {
-      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/aztec.nr",
-      "source": "use crate::macros::{\n    calls_generation::{\n        external_functions::{\n            generate_external_function_calls, generate_external_function_self_calls_structs,\n        },\n        internal_functions::generate_call_internal_struct,\n    },\n    dispatch::generate_public_dispatch,\n    internals_functions_generation::{create_fn_abi_exports, process_functions},\n    notes::NOTES,\n    storage::STORAGE_LAYOUT_NAME,\n    utils::{\n        get_trait_impl_method, is_fn_contract_library_method, is_fn_external, is_fn_internal,\n        is_fn_test, module_has_storage,\n    },\n};\n\n/// Marks a contract as an Aztec contract, generating the interfaces for its functions and notes, as well as injecting\n/// the `sync_private_state` utility function.\n/// Note: This is a module annotation, so the returned quote gets injected inside the module (contract) itself.\npub comptime fn aztec(m: Module) -> Quoted {\n    // Functions that don't have #[external(...)], #[contract_library_method], or #[test] are not allowed in contracts.\n    check_each_fn_macroified(m);\n\n    // We generate new functions prefixed with `__aztec_nr_internals__` and we replace the original functions' bodies\n    // with `static_assert(false, ...)` to prevent them from being called directly from within the contract.\n    let functions = process_functions(m);\n\n    // We generate structs and their implementations necessary for convenient functions calls.\n    let interface = generate_contract_interface(m);\n    let self_call_structs = generate_external_function_self_calls_structs(m);\n    let call_internal_struct = generate_call_internal_struct(m);\n\n    // We generate ABI exports for all the external functions in the contract.\n    let fn_abi_exports = create_fn_abi_exports(m);\n\n    // We generate `_compute_note_hash_and_nullifier`, `sync_private_state` and `process_message`\n    // functions only if they are not already implemented. If they are implemented we just insert empty\n    // quotes.\n    let contract_library_method_compute_note_hash_and_nullifier = if !m.functions().any(|f| {\n        f.name() == quote { _compute_note_hash_and_nullifier }\n    }) {\n        generate_contract_library_method_compute_note_hash_and_nullifier()\n    } else {\n        quote {}\n    };\n    let sync_private_state_fn_and_abi_export = if !m.functions().any(|f| {\n        f.name() == quote { sync_private_state }\n    }) {\n        generate_sync_private_state()\n    } else {\n        quote {}\n    };\n\n    let process_message_fn_and_abi_export = if !m.functions().any(|f| {\n        f.name() == quote { process_message }\n    }) {\n        generate_process_message()\n    } else {\n        quote {}\n    };\n    let public_dispatch = generate_public_dispatch(m);\n\n    quote {\n        $interface\n        $self_call_structs\n        $call_internal_struct\n        $functions\n        $fn_abi_exports\n        $contract_library_method_compute_note_hash_and_nullifier\n        $public_dispatch\n        $sync_private_state_fn_and_abi_export\n        $process_message_fn_and_abi_export\n    }\n}\n\ncomptime fn generate_contract_interface(m: Module) -> Quoted {\n    let calls = generate_external_function_calls(m);\n\n    let module_name = m.name();\n\n    let has_storage_layout = module_has_storage(m) & STORAGE_LAYOUT_NAME.get(m).is_some();\n    let storage_layout_getter = if has_storage_layout {\n        let storage_layout_name = STORAGE_LAYOUT_NAME.get(m).unwrap();\n        quote {\n            pub fn storage_layout() -> StorageLayoutFields {\n                $storage_layout_name.fields\n            }\n        }\n    } else {\n        quote {}\n    };\n\n    let library_storage_layout_getter = if has_storage_layout {\n        quote {\n            #[contract_library_method]\n            $storage_layout_getter\n        }\n    } else {\n        quote {}\n    };\n\n    quote {\n        pub struct $module_name {\n            pub target_contract: dep::aztec::protocol_types::address::AztecAddress\n        }\n\n        impl $module_name {\n            $calls\n\n            pub fn at(\n                addr: aztec::protocol_types::address::AztecAddress\n            ) -> Self {\n                Self { target_contract: addr }\n            }\n\n            pub fn interface() -> Self {\n                Self { target_contract: aztec::protocol_types::address::AztecAddress::zero() }\n            }\n\n            $storage_layout_getter\n        }\n\n        #[contract_library_method]\n        pub fn at(\n            addr: aztec::protocol_types::address::AztecAddress\n        ) -> $module_name {\n            $module_name { target_contract: addr }\n        }\n\n        #[contract_library_method]\n        pub fn interface() -> $module_name {\n            $module_name { target_contract: aztec::protocol_types::address::AztecAddress::zero() }\n        }\n\n        $library_storage_layout_getter\n\n    }\n}\n\n/// Generates a contract library method called `_compute_note_hash_and_nullifier` which is used for note\n/// discovery (to create the `aztec::messages::discovery::ComputeNoteHashAndNullifier` function) and to implement the\n/// `compute_note_hash_and_nullifier` unconstrained contract function.\ncomptime fn generate_contract_library_method_compute_note_hash_and_nullifier() -> Quoted {\n    if NOTES.len() > 0 {\n        // Contracts that do define notes produce an if-else chain where `note_type_id` is matched against the\n        // `get_note_type_id()` function of each note type that we know of, in order to identify the note type. Once we\n        // know it we call we correct `unpack` method from the `Packable` trait to obtain the underlying note type, and\n        // compute the note hash (non-siloed) and inner nullifier (also non-siloed).\n\n        let mut if_note_type_id_match_statements_list = &[];\n        for i in 0..NOTES.len() {\n            let typ = NOTES.get(i);\n\n            let get_note_type_id = get_trait_impl_method(\n                typ,\n                quote { crate::note::note_interface::NoteType },\n                quote { get_id },\n            );\n            let unpack = get_trait_impl_method(\n                typ,\n                quote { crate::protocol_types::traits::Packable },\n                quote { unpack },\n            );\n\n            let compute_note_hash = get_trait_impl_method(\n                typ,\n                quote { crate::note::note_interface::NoteHash },\n                quote { compute_note_hash },\n            );\n\n            let compute_nullifier_unconstrained = get_trait_impl_method(\n                typ,\n                quote { crate::note::note_interface::NoteHash },\n                quote { compute_nullifier_unconstrained },\n            );\n\n            let if_or_else_if = if i == 0 {\n                quote { if }\n            } else {\n                quote { else if }\n            };\n\n            if_note_type_id_match_statements_list = if_note_type_id_match_statements_list.push_back(\n                quote {\n                    $if_or_else_if note_type_id == $get_note_type_id() {\n                        // As an extra safety check we make sure that the packed_note BoundedVec has the expected\n                        // length, since we're about to interpret its raw storage as a fixed-size array by calling the\n                        // unpack function on it.\n                        let expected_len = <$typ as $crate::protocol_types::traits::Packable>::N;\n                        let actual_len = packed_note.len();\n                        assert(\n                            actual_len == expected_len,\n                            f\"Expected packed note of length {expected_len} but got {actual_len} for note type id {note_type_id}\"\n                        );\n\n                        let note = $unpack(aztec::utils::array::subarray(packed_note.storage(), 0));\n\n                        let note_hash = $compute_note_hash(note, owner, storage_slot, randomness);\n    \n                        // The message discovery process finds settled notes, that is, notes that were created in prior\n                        // transactions and are therefore already part of the note hash tree. We therefore compute the\n                        // nullification note hash by treating the note as a settled note with the provided note nonce.\n                        let note_hash_for_nullification = aztec::note::utils::compute_note_hash_for_nullification(\n                            aztec::note::retrieved_note::RetrievedNote{ \n                                note,\n                                contract_address,\n                                owner,\n                                randomness,\n                                metadata: aztec::note::note_metadata::SettledNoteMetadata::new(note_nonce).into()\n                            }, \n                            storage_slot,\n                        );\n\n                        let inner_nullifier = $compute_nullifier_unconstrained(note, owner, note_hash_for_nullification);\n\n                        Option::some(\n                            aztec::messages::discovery::NoteHashAndNullifier {\n                                note_hash, inner_nullifier\n                            }\n                        )\n                    }\n                },\n            );\n        }\n\n        let if_note_type_id_match_statements = if_note_type_id_match_statements_list.join(quote {});\n\n        quote {\n            /// Unpacks an array into a note corresponding to `note_type_id` and then computes its note hash\n            /// (non-siloed) and inner nullifier (non-siloed) assuming the note has been inserted into the note hash\n            /// tree with `note_nonce`.\n            ///\n            /// The signature of this function notably matches the `aztec::messages::discovery::ComputeNoteHashAndNullifier` type,\n            /// and so it can be used to call functions from that module such as `discover_new_messages`, \n            /// `do_process_message` and `attempt_note_discovery`.\n            ///\n            /// This function is automatically injected by the `#[aztec]` macro.\n            #[contract_library_method]\n            unconstrained fn _compute_note_hash_and_nullifier(\n                packed_note: BoundedVec<Field, aztec::messages::discovery::private_notes::MAX_NOTE_PACKED_LEN>,\n                owner: aztec::protocol_types::address::AztecAddress,\n                storage_slot: Field,\n                note_type_id: Field,\n                contract_address: aztec::protocol_types::address::AztecAddress,\n                randomness: Field,\n                note_nonce: Field,\n            ) -> Option<aztec::messages::discovery::NoteHashAndNullifier> {\n                $if_note_type_id_match_statements\n                else {\n                    Option::none()\n                }\n            }\n        }\n    } else {\n        // Contracts with no notes still implement this function to avoid having special-casing, the implementation\n        // simply throws immediately.\n        quote {\n            /// This contract does not use private notes, so this function should never be called as it will\n            /// unconditionally fail.\n            ///\n            /// This function is automatically injected by the `#[aztec]` macro.\n            #[contract_library_method]\n            unconstrained fn _compute_note_hash_and_nullifier(\n                _packed_note: BoundedVec<Field, aztec::messages::discovery::private_notes::MAX_NOTE_PACKED_LEN>,\n                _owner: aztec::protocol_types::address::AztecAddress,\n                _storage_slot: Field,\n                _note_type_id: Field,\n                _contract_address: aztec::protocol_types::address::AztecAddress,\n                _randomness: Field,\n                _nonce: Field,\n            ) -> Option<aztec::messages::discovery::NoteHashAndNullifier> {\n                panic(f\"This contract does not use private notes\")\n            }\n        }\n    }\n}\n\ncomptime fn generate_sync_private_state() -> Quoted {\n    quote {\n        pub struct sync_private_state_parameters {}\n\n        #[abi(functions)]\n        pub struct sync_private_state_abi {\n            parameters: sync_private_state_parameters,\n        }\n\n        #[aztec::macros::internals_functions_generation::abi_attributes::abi_utility]\n        unconstrained fn sync_private_state() {\n            let address = aztec::context::utility_context::UtilityContext::new().this_address();\n            \n            aztec::messages::discovery::discover_new_messages(address, _compute_note_hash_and_nullifier);\n        }\n    }\n}\n\ncomptime fn generate_process_message() -> Quoted {\n    quote {\n        pub struct process_message_parameters {\n            pub message_ciphertext: BoundedVec<Field, aztec::messages::encoding::MESSAGE_CIPHERTEXT_LEN>,\n            pub message_context: aztec::messages::processing::message_context::MessageContext,\n        }\n\n        #[abi(functions)]\n        pub struct process_message_abi {\n            parameters: process_message_parameters,\n        }\n\n        #[aztec::macros::internals_functions_generation::abi_attributes::abi_utility]\n        unconstrained fn process_message(\n            message_ciphertext: BoundedVec<Field, aztec::messages::encoding::MESSAGE_CIPHERTEXT_LEN>,\n            message_context: aztec::messages::processing::message_context::MessageContext,\n        ) {\n            let address = aztec::context::utility_context::UtilityContext::new().this_address();\n\n            aztec::messages::discovery::discover_new_messages(address, _compute_note_hash_and_nullifier);     \n            aztec::messages::discovery::process_message::process_message_ciphertext(\n                address,\n                _compute_note_hash_and_nullifier,\n                message_ciphertext,\n                message_context,\n            );\n        }\n    }\n}\n\n/// Checks if each function in the module is marked with either #[external(...)], #[contract_library_method], or #[test].\n/// Non-macroified functions are not allowed in contracts.\ncomptime fn check_each_fn_macroified(m: Module) {\n    for f in m.functions() {\n        let name = f.name();\n        if !is_fn_external(f)\n            & !is_fn_contract_library_method(f)\n            & !is_fn_internal(f)\n            & !is_fn_test(f) {\n            // We  don't suggest that #[contract_library_method] is allowed because we don't want to introduce another\n            // concept\n            panic(\n                f\"Function {name} must be marked as either #[external(...)], #[internal(...)], or #[test]\",\n            );\n        }\n    }\n}\n"
     }
   }
 }