npm - @aztec/accounts - Versions diffs - 4.0.0-devnet.2-patch.4 → 4.0.0-devnet.3-patch.1 - Mend

@aztec/accounts 4.0.0-devnet.2-patch.4 → 4.0.0-devnet.3-patch.1

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 (20) hide show

package/README.md +0 -1
package/artifacts/EcdsaKAccount.json +440 -603
package/artifacts/EcdsaRAccount.json +437 -600
package/artifacts/SchnorrAccount.json +448 -607
package/artifacts/SimulatedAccount.json +223 -413
package/package.json +6 -9
package/artifacts/SchnorrSingleKeyAccount.d.json.ts +0 -3
package/artifacts/SchnorrSingleKeyAccount.json +0 -4716
package/dest/single_key/account_contract.d.ts +0 -17
package/dest/single_key/account_contract.d.ts.map +0 -1
package/dest/single_key/account_contract.js +0 -42
package/dest/single_key/index.d.ts +0 -20
package/dest/single_key/index.d.ts.map +0 -1
package/dest/single_key/index.js +0 -23
package/dest/single_key/lazy.d.ts +0 -24
package/dest/single_key/lazy.d.ts.map +0 -1
package/dest/single_key/lazy.js +0 -31
package/src/single_key/account_contract.ts +0 -47
package/src/single_key/index.ts +0 -32
package/src/single_key/lazy.ts +0 -40

package/artifacts/SimulatedAccount.json CHANGED Viewed

@@ -1,6 +1,6 @@
 {
   "transpiled": true,
-  "noir_version": "1.0.0-beta.18+2db78f8894936db05c53430f364360ac9cc5c61f",
+  "noir_version": "1.0.0-beta.18+190931435915a6ef908d9be090036d98356237b3",
   "name": "SimulatedAccount",
   "functions": [
     {
@@ -1893,8 +1893,8 @@
           }
         }
       },
-      "bytecode": "H4sIAAAAAAAA/+z9C5yN5fs3/Jtm1pqZtdbM2s1ai2SXhCT7XdohoY2UijYqIck2Q0jSJEkSM0OShISQJNklSZKkI0mSkCQhCUmS5H+o53nS/dz/7zrG/Tl/n9dz37/79X19X173b33P83if61rXuq7rWJ85Uwvyx20ue9dd7R/q06nDXT1639WlR59OvXu075Z7112devTpPaBXT/3/kXIPby01M+/1xt3ad+jauGf/q/r26NCkfbduedNubNSyWdOCvBltuvTp0Sk396yyhhelphheFLaMFL3C8KL4x48aXpUwveocS1WlLC8qbXlRGcuLypoqL2d61bmmV5U3veo8S/HnW15UyXLAVLa86ALLiy601HSRZaRqlhdVt7yopqWm2paR6lheVNfyovqWmi62jNTQ8qJLLC+6zFLTFZaRGlle1NjyoiszDC9qmpI3u3HvLt26del86v8+ptjo0YWjR79ftth//n8pebMa5eZ26t3ntk69exaOzi94v2z1ji1776gxufLiVk0X5uW1bVep1p7mA5b0ym+y40jhQf2fSOqr/3nYjVV3dj2TYef8/x323P/7H/+ThXizVc/cTl069uxRs1Wn3t379mnfp0vPHgVj/p+F0XL/n39X+Oe8cdr/fc4YSX1NUudK6uuSOu/flRcWJF/CiobX6AymNXgj6VDFil5gJVOBc00FzndRYGVTga+bCnzTUOCZHEVvnPbv+af9+83T/j1Pj6QFkrpQUhdJ6uKir8MFpnVYYFqHJS7eqCqmAheaCnzLRYEXmgpcZCpwqaMjaclp/37rtH8vPe3fi/VIeltSl0nqO5K6vOjrUNW0Dm+b1uFdF2/URaYCl5kKXOGiwGqmAt8xFfieoyPp3dP+veK0f7932r+X65G0UlLfl9RVkvpB0dehumkdVprWYbWLN6qGqcD3TQV+6KLAmqYCV5kKXOPoSFp92r8/PO3fa0779wd6JH0kqWsl9WNJlaKvQy3TOnxkWodPXLxRtU0FrjUVuM5FgXVMBX5sKvBTR0fSJ6f9e91p//70tH+LHknrJfUzSd0gqZ8XfR3qmtZhvWkdNrp4o+qZCvzMVOAXLgqsbypwg6nATY6OpI2n/fuL0/696bR/f65H0peSullSv5LULUVfhwamdfjStA5bXbxRF5sK3GwqcJuLAhuaCvzKVODXjo6kraf9e9tp//76tH9v0SNpu6R+I6k7JPXboq/DJaZ12G5ah50u3qhLTQV+YyrwOxcFXmYqcIepwF2OjqSdp/37u9P+veu0f3+rR9L3krpbUvdI6t6ir8PlpnX43rQOP7h4o64wFbjbVOA+FwU2MhW4x1Tgj46OpB9O+/e+0/7942n/3qtH0n5J/UlSD0jqwaKvQ2PTOuw3rcMhF29UE1OBP5kK/NlFgVeaCjxgKvCwoyPp0Gn//vm0fx8+7d8H9Uj6RVKPSOqvknq06OvQ1LQOv5jW4TdH6/Dbaf8+ctq/fz3t30d1HY5J6u+SelxS//j3OhQYjOeZhCcMfZfkLR0dp2zRK4yaKvwzyUApNzxqqvDPK/7ddkrJz5veukuPzt06/d31SVZtSvJjwdjH+lcZ6UUs48rka/bXiN17deskqSeL3lnLLzQUoSMXmN69k5ZPY1qx5EOdQY1pxUzdvFOzJxms2L/fs7MK/3nPki+vN29ao9692w/YWqy45eWtLS8yTdwH9qIulhf1sLyos+VFZS0vGmh5UXXLiwbBampveVEubLp7YYdKJ1hNvWDrNABWeO//6xOYjzzT51vPbEleVPQzm37b6sAFtvlNZ0CD2PIdm5ZStuiYtFPzIzFngTBnlf33WT+1iN/UpmWFHkguLywOnDx58p8Li7RUVxcWaanJLixOVXLqZZZVS3NzYZGWb6ox7b8vLJK86L8vLP77wuK/LyxO+3/m7wPLueX0M1tBoelxgH7RWL+0zzJ9aaeeMH1pe1xcJ/11aWG7B/S6/nqtmHyC075e0918vVbUkW2HV4aDL06dPWN0Ed/n0bYrQ4/pTc48gyVNNmolRVlqrGSq0OfkY5CpA9s+Bn7QtbO/bJEX8q9Pa1qh+UYg+avSTORAUT/5aWPgn/yiDVgBPaDt9Pt/D2l5My9ItXwmLNfwFwC/M8/k05VMWlmHtZ2jfKbDMesMvteTza2TZxkpttNEtoOFTL2gEHXImAxBB6faU18GhYbZbV8GGaZXhRxcJ+iREBpd1POiZyz5vHg+80Rrur5O8+mp1vSVrS/040/dxvOk4aNR8M+1aviff0asM4QMRVuuM8Jn8sAxpP872yk7ZPoERkGY6P+kh2r4/JtelVPEs4TtcPbogWo+nJFX8jEn18laZbbtCzDuYP6K5q/fhCt90DZ/cQfzVzDrSzjRe8zzn+36UUHVIj0qKOnmUUFVHdl2Lj/HwaMCnf2c0U7eZz35R03vc6mLnMyfoycv2/zVivqopNB0+JayvKmlTKE3Q4lFf6Bykb71lq+Ki0za0k7exFI6sO1kUQZ0bVDmjK4NSpteVbaI76LxQCv3X3qgFf2uWB/66unA+sIc2/t9rpNCA9ZCA+ZCy7u6hjDOf57rx26Gb9GiDVgFf6NVDvzYrTrssVt14GO3MzkHJ5NWO3Vys81uOhwrFPVwzCgo6pud5Ig/efLkN9buf8qp/zrtFvz8f/5Z0XY5aPnOOd/2sopli/4jbV2N//y2FBz861Xnm968ioaVLXo7orRO7+YaVK8B47azZCVX8yds81d2NX9x2/wXuJq/hG3+Kq7mP9s2/4VFvQewDWv5bpx1XafuPXsPaNGjS5/CrK3FJuvBqMeDviW6KlqYDvLf//nf6T/T/36/i3o4e/46UZ5nO+4st9Sv/F3H9b0Ksgot32XFrN+/F+GGcnE7osNWMF742Ba7ehE/5Nn//SH/3/4//7MPeYH1aqia6ctNX1jddmVezXQY1yjSOSPbdM5IIZwzauAvJf6vcy/yPqimg9U2L1FN3FC1mI6quKFqu7kArGO4RXS2PHVwQ9V1szz1kg57lrvlqYcbqr6b5WmQdNhUd8vTADfUxW6Wp2HSYdPcLU9D3FCXuFmeS5N/r7lbnktxQ13mZnkuTzqs193yXI4b6go3y9Mo6bDp7panEW6oxm6Wp0nSYTPcLU8T3FBXulmepkmHzXS3PE1xQ13lZnmaJR3W5255muGGau5meVokHdbvbnla4Ia62s3yXJN02IC75bkGN9S1bpbnuqTDZrlbnutwQ7V0szzXJx02293yXI8bqpWb5bkh6bBBd8tzA26oG90sT+ukw4bcLU9r3FA3uVmem5MOG3a3PDfjhrrFzfK0STpsxN3ytMEN1dbN8tyadNiou+W5FTfUbW6W5/akw+a4W57bcUPd4WZ52iUdNuZuedrhhrrTzfLclXTYuLvluQs31N1ulqd90mET7panPW6oe9wsT4ekwxZ3tzwdcEN1dLM8nZIOW8Ld8nTCDXWvm+XpnHTYs90tT2fcUPe5WZ4uSYct6W55uuCGut/N8nRNOuw57panK26obm6Wp3vSYUu5W57uuKF6uFmenkmHLe1ueXrihurlZnkeSDpsGXfL8wBuqN5ulic36bBl3S1PLm6oPm6Wp2/SYcu5W56+uKEedLM8/ZIOe6675emHG6q/m+UZkHTY8u6WZwBuqIfcLM/ApMOe5255BuKGetjN8gxKOmwFd8szCDfUI26WZ3DSYc93tzyDcUM96mZ58pIOW9Hd8uThhnrMzfIMSTpsJXfLMwQ31ONulmdo0mEru1ueobihnnCzPMOSDnuBu+UZhhvqSTfLMzzpsFXcLc9w3FBPuVmeEUmHvdDd8ozADfW0m+UZmXTYqu6WZyRuqGfcLM+opMNe5G55RuGGGu1mefKTDlvN3fLk44YqcLM8ycNw1d0tTyFuqDFulmds0mFruFuesbihnnWzPOOSDlvT3fKMww31nJvlGZ902Frulmc8bqjn3SzPhKTD1na3PBNwQ73gZnkmJh22jrvlmYgb6kU3yzMp6bB13S3PJNxQk90sz5Skw9ZztzxTcEO95GZ5piYdtr675ZmKG+plN8szLemwDdwtzzTcUNPdLM+MpMNe7G55ZuCGesXN8sxMOmxDd8szEzfULDfLMzvpsJe4W57ZuKFedbM8c5IOe6m75ZmDG+o1N8szN+mwl7lbnrm4oV53szzzkg57ubvlmYcb6g03yzM/6bBXuFue+bih3nSzPAuSDtvI3fIswA210M3yLEo6bGN3y7MIN9RiN8uzJOmwTdwtzxLcUG+5WZ6lSYe90t3yLMUN9bab5VmWdNim7pZnGW6od9wsz/Kkw17lbnmW44Z6183yrEg6bDN3y7MCN9R7bpZnZdJhm7tbnpW4od53szyrkg7bwt3yrMIN9YGb5VmddNir3S3PatxQH7pZnjVJh73G3fKswQ31kZvlWZt02GvdLc9a3FAfu1keSTrsde6WR3BDfeJmedYlHbalu+VZhxvqUzfLsz7psNe7W571uKE+c7M8G5IO28rd8mzADfW5m+XZmHTYG9wtz0bcUF+4WZ5NSYe90d3ybMIN9aWb5dmcdNjW7pZnM26or9wsz5akw97kbnm24Iba6mZ5tiUd9mZ3y7MNN9TXbpZne9Jhb3G3PNtxQ33jZnl2JB22jbvl2YEb6ls3y7Mz6bBt3S3PTtxQ37lZnl1Jh73V3fLswg31vZvl2Z102NvcLc9u3FB73CzP3qTD3u5uefbihvrBzfLsSzrsHe6WZx9uqB/dLM/+pMO2c7c8+3FD/eRmeQ4kHfZOd8tzADfUQTfLcyjpsHe5W55DuKF+drM8h5MOe7e75TmMG+oXN8tzJOmw7d0tzxHcUL+6WZ6jSYe9x93yHMUN9Zub5TmWdNgO7pbnGG6o390sz/Gkw3Z0tzzHcUP94WZ5TiQdtpO75TmBG+pPN8tzMumw97pbnpOwoTzFnCyPJyXpsJ2dLY9hcvNQZ7lZntSkw97nbnlScUOluVkeT9Jhu7hbHg9uKK+b5UlPOuz97pYnHTdUhpvlyUw6bFd3y5OJG8rnZnn8SYft5m55/LihAm6WJyvpsN3dLU8WbqhsN8sTTDpsD3fLE8QNFXKzPOGkw/Z0tzxh3FARN8sTTTpsL3fLE8UNleNmeWJJh33A3fLEcEPF3SxPIumwvd0tTwI3VHE3y1Mi6bC57panBG6os90sT8mkw/ZxtzwlcUOd42Z5SiUdtq+75SmFG6q0m+Upk3TYB90tTxncUGXdLE+5pMP2c7c85XBDnetmeconHba/u+UpjxvqPDfLUyHpsAPcLU8F3FDnu1meikmHfcjd8lTEDVXJzfJUTjrsQHfLUxk31AVulqdK0mEfdrc8VXBDXehmeaomHXaQu+WpihvqIjfLUy3psI+4W55quKGqu1meGkmHHexueWrghqrpZnlqJR32UXfLUws3VG03y1Mn6bB57panDm6oum6Wp17SYR9ztzz1cEPVd7M8DZIOO8Td8jTADXWxm+VpmHTYx90tT0PcUJe4WZ5Lkw471N3yXIob6jI3y3N50mGfcLc8l+OGusLN8jRKOuwwd8vTCDdUYzfL0yTpsE+6W54muKGudLM8TZMOO9zd8jTFDXWVm+VplnTYp9wtTzPcUM3dLE+LpMOOcLc8LXBDXe1mea5JOuzT7pbnGtxQ17pZnuuSDjvS3fJchxuqpZvluT7psM+4W57rcUO1crM8NyQddpS75bkBN9SNbpanddJhR7tbnta4oW5yszw3Jx02393y3Iwb6hY3y9Mm6bAF7panDW6otm6W59akwxa6W55bcUPd5mZ5bk867Bh3y3M7bqg73CxPu6TDjnW3PO1wQ93pZnnuSjrss+6W5y7cUHe7WZ72SYcd52552uOGusfN8nRIOuxz7panA26ojm6Wp1PSYce7W55OuKHudbM8nZMO+7y75emMG+o+N8vTJemwE9wtTxfcUPe7WZ6uSYd9wd3ydMUN1c3N8nRPOuxEd8vTHTdUDzfL0zPpsC+6W56euKF6uVmeB5IOO8nd8jyAG6q3ZXn+drTo0aVPYXBrscmSVlvS6kpafUm7WNIukbTLJO0KSWssaVdK2lWS1lzSrpa0ayWtpaS1krQbJe0mSbtF0tpK2m2Sdoek3Slpd0vaPZLWUdLulbT7JO1+SesmaT0krZek9Za0PpL2oKT1l7SHJO1hSXtE0h6VtMck7XFJe0LSnpS0pyTtaUl7RtJGS1qBpI2RtGcl7TlJe17SXpC0FyVNi3xJ0l6WtOmS9oqkzZK0VyXtNUl7XdLekLQ3JW2hpC2WtLck7W1Je0fS3pW09yTtfUn7QNI+lLSPJO1jSftE0j6VtM8k7XNJ+0LSvpS0ryRtq6R9LWnfSNq3kvadpH0vaXsk7QdJ+1HSfpK0g5L2s6T9Imm/Stpvkva7pP0haX+KRw+Zs8STJh6veDLE4xNPQDzZ4gmJJyKeHPHExVNcPGeL5xzxlBZPWfGcK57zxHO+eCqJ5wLxXCiei8RTXTw1xVNbPHXFU188F4vnEm11aztXW5baltPWk7ZXtIWgj8n1UbA+7tRHevrYSh/N6OMHvcXW20i9VdLbAb3k1cs6vXTRr2f9CtLTrJ5K9OOih8T0v9/vf30sCpJvcp9SVdJKF1r+RkZpSatVYDk89WWWD2Ou4SD+58MYNH0YU4yfoLSauA9jbhHPVfnJ3xTPX6t9nmG1z9JXmla7j4PVNi9RH9xQfc9gtZOtTmr1QsPcqYbXVDe9Fw8S34s04I+U+zEdwB889mc6gL9MHMB0AH9C+BDTAfyt30CmA/ijvIeZDuCv5wYxHcCfuT3CdAB/jzaY6QD+cOxRpgP4C688pgP4U6zHmA7gb6aGMB3AHzc9znQAf4U0lOkA/lzoCaYD+LueYUwH8Ac4TzIdwF/KDGc6gD9peYrpAP72ZATTAfyRyNNMB/DXHCOZDuDPLp5hOoC/jxjFdAB/yDCa6QD+4iCf6QD+NKCA6QD28AuZDmCzfQzTAeyKj2U6gO3rZ5mOXJxjHNPRF+d4junoh3OMZzoG4BzPMx0DcY4JTMcgnOMFpmMwzjGR6cjDOV5kOobgHJOYjqE4x2SmYxjOMYXpGI5zvMR0jMA5pjIdI3GOl5mOUTjHNKYjH+eYznQU4hwzmI6xOMcrTMc4nGMm0zEe55jFdEzAOWYzHRNxjleZjkk4xxymYwrO8RrTMRXnmMt0TMM5Xmc6ZuAc85iOmTjHG0zHbJxjPtMxB+d4k+mYi3MsYDrm4RwLmY75OMcipmMBzrGY6ViEcyxhOpbgHG8xHUtxjqVMxzKc422mYznOsYzpWIFzvMN0rMQ5ljMdq3COd5mO1TjHCqZjDc7xHtOxFudYyXQIzvE+07EO51jFdKzHOT5gOjbgHKuZjo04x4dMxyacYw3TsRnn+Ijp2IJzrGU6tuEcHzMd23EOYTp24ByfMB07cY51TMcunONTpmM3zrGe6diLc3zGdOzDOTYwHftxjs+ZjgM4x0am4xDO8QXTcRjn2MR0HME5vmQ6juIcm5mOYzjHV0zHcZxjC9NxAufYynScxDm2ER2eFNxQXzMdqbihtjMdHtxQ3zAd6bihdjAdmbihvmU6/LihdjIdWbihvmM6grihdjEdYdxQ3zMdUdxQu5mOGG6oPUxHAjfUXqajBG6oH5iOkrih9jEdpXBD/ch0lMENtZ/pKIcb6iemozxuqANMRwXcUAeZjoq4oQ4xHZVxQ/3MdFTBDXWY6QDu0/AL01ENN9QRpqMGbqhfmY5auKGOMh3A/T9+YzqA+38cYzqA+3/8znQA9/84znQA9//4g+kA7v9xgukA7v/xJ9MB3P/jJNOB2//DW4zpwO3/4U1hOnD7f3jPYjpw+394U5kO3P4f3jSmA7f/h9fDdOD2//B6mQ7c/h/edKYDt/+HN4PpwO3/4c1kOnD7f3h9TAdu/w+vn+nA7f/hDTAduP0/vFlMB27/D28204Hb/8MbZDpw+394Q0wHbv8Pb5jpwO3/4Y0wHbj9P7xRpgO3/4c3h+nA7f/hjTEduP0/vHGDY9bfjhY9uvQpDG0tNlk8/cTTXzwDxPOQeAaK52HxDBLPI+IZLJ5HxZMnnsfEM0Q8j4tnqHieEM8w8TwpnuHieUo8I8TztHhGiucZ8YwSz2jx5IunQDyF4hkjnrHieVY848TznHjGi+d58UwQzwvimSieF8UzSTw6+xTxvCSeqeJ5WTzTxDNdPDPE84p4Zopnlnhmi+dV8cwRz2vimSue18UzTzxviGe+eN4UzwLxLBTPIvEsFs8S8bwlnqXieVs8y8TzjniWi+dd8awQz3viWSme98WzSjwfiGe1eD4UzxrxfCSeteL5WDwink/Es048n4pnvXg+E88G8Xwuno3i+UI8m8TzpXg2i+cr8WwRz1bxbBPP1+LZLp5vxLNDPN+KZ6d4vhPPLvF8L57d4tkjnr3i+UE8+8Tzo3j2i+cn8RzQhrr2orWNqx1QbR5q301bVtrt0UaJ9hj08bw+2daHwvo8VR9F6lM8fQCmz470sYs+sdCbfb1P1ltMvTvTGxu9J9DLab0S1Ys4vf7RSwf91tUvLD3X62lSzzD64dTjWg+J6X+/33mzGuXmdurd57ZOvXsWFhS+X7Z6x5a9d9SYXHlxq6YL8/LatqtUa0/zAUt65TfZcaTwoB4oklZaPH0LDYfdqRc+WGA61vsWGCb2Jor0cQyZPo4p1o9jH9zH0eI4/W3JT77anlOrnXaeYbVT9ZWm1S7uYLXNS1QcN1QJoiMN96MC79lMB6756y3JdOCav95zmA5c89dbiunANX+9pZkOXPPXW4bpwDV/vWWZDlzz11uO6cA1f73nMh3A5m95pgPY/D2P6QA2fyswHcDm7/lMB7D5W5HpADZ/KzEdwOZvZaYD2Py9gOkANn+rMB3A5u+FTAew+VuV6QA2fy9iOoDN32pMB7D5W53pADZ/azAdwOZvTaYD2PytxXQAm7+1mQ5g87cO0wFs/tZlOoDN33pMB7D5W5/pADZ/GzAduTjHxUxHX5yjIdPRD+e4hOkYgHNcynQMxDkuYzoG4RyXMx2DcY4rmI48nKMR0zEE52jMdAzFOZowHcNwjiuZjuE4R1OmYwTOcRXTMRLnaMZ0jMI5mjMd+ThHC6ajEOe4mukYi3Ncw3SMwzmuZTrG4xzXMR0TcI6WTMdEnON6pmMSztGK6ZiCc9zAdEzFOW5kOqbhHK2Zjhk4x01Mx0yc42amYzbOcQvTMQfnaMN0zMU52jId83COW5mO+TjHbUzHApzjdqZjEc5xB9OxBOdox3QsxTnuZDqW4Rx3MR3LcY67mY4VOEd7pmMlznEP07EK5+jAdKzGOToyHWtwjk5Mx1qc416mQ3COzkzHOpzjPqZjPc7RhenYgHPcz3RsxDm6Mh2bcI5uTMdmnKM707EF5+jBdGzDOXoyHdtxjl5Mxw6c4wGmYyfO0Zvp2IVz5DIdu3GOPkzHXpyjL9OxD+d4kOnYj3P0YzoO4Bz9mY5DOMcApuMwzvEQ03EE5xjIdBzFOR5mOo7hHIOYjuM4xyNMxwmcYzDTcRLneJTo8KTgHHlMRyrO8RjT4cE5hjAd6TjH40xHJs4xlOnw4xxPMB1ZOMcwpiOIczzJdIRxjuFMRxTneIrpiOEcI5iOBM7xNNNRAucYyXSUxDmeYTpK4RyjmI4yOMdopqMczpHPdJTHOQqYjgo4RyHTURHnGMN0VMY5xjIdVXCOZ5kO4D4N45iOajjHc0xHDZxjPNNRC+d4nukA7v8xgekA7v/xAtMB3P9jItMB3P/jRaYDuP/HJKYDuP/HZKYDuP/HFKYDuP/HS0wHcP+PqUwHcP+Pl5kO4P4f05gO4P4f05kO4P4fM5gO4P4frzAdwP0/ZjIdwP0/ZjEdwP0/ZjMdwP0/XmU6gPt/zGE6gPt/vMZ0APf/mMt0APf/eJ3pAO7/MY/pAO7/8QbTAdz/Yz7TAdz/402mA7j/xwKmA7j/x0KmA7j/xyKmA7j/x2KmA7j/h+FPBeXN+tvRokeXPoXhrcUmi/ds8ZYU7zniLSXe0uItI96y4i0n3nPFW16854m3gnjPF29F8VYSb2XxXiDeKuK9ULxVxXuReKuJt7p4a4i3pnhribe2eOuIt65464m3vngbiPdi8TYU7yXivVS8l4n3cvFeId5G4m0s3ibivVK8TcV7lXibibe5eFuI92rxXiPea8V7nXhbivd68bYS7w3ivVG8rcV7k3hvFu8t4m0j3rbivVW8t4n3dvHeId524r1TvHeJ927xthfvPeLtIN6O4u0k3nvF21m894m3i3jvF29X8XYTb3fx9hBvT/H2Eu8D4u0t3lzx9hFvX/E+KN5+4u0v3gHifUi8A8X7sHgHifcR8Q4W76PizRPvY+IdIt7HxTtUvE+Id5h4nxTvcPE+Jd4R4n1avCPF+4x4R4l3tHjzxVugDXXtRWsbVzug2jzUvpu2rLTbo40S7THo43l9sq0PhfV5qj6K1Kd4+gBMnx3pYxd9YqE3+3qfrLeYenemNzZ6T6CX03olqhdxev2jlw76ratfWHqu19OknmH0w6nHtR4S0/9+v/NmNcrN7dS7z22devcsLEje2E+pImml9WXVO7bsvaPG5MqLWzVdmJfXtl2lWnuaD1jSK7/JjiOFB/V1+irxligwHZ4lCgzjed8q0ocxbPowplg/QcVxH0aL4/Q3JT/5m+I5tdpp5xlWO01faVrtpQ5W27xEwD8J9jbRkQb8ScEypgPY+n2H6QC2fpczHcDW77tMB7D1u4LpALZ+32M6gK3flUwHsPX7PtMBbP2uYjqArd8PmA5g63c10wFs/X7IdABbv2uYDmDr9yOmA9j6Xct0AFu/HzMdwNavMB3A1u8nTAew9buO6QC2fj9lOoCt3/VMB7D1+xnTAWz9bmA6gK3fz5kOYOt3I9MBbP1+wXQAW7+bmA5g6/dLpgPY+t3MdABbv18xHcDW7xamA9j63cp05OIc25iOvjjH10xHP5xjO9MxAOf4hukYiHPsYDoG4RzfMh2DcY6dTEcezvEd0zEE59jFdAzFOb5nOobhHLuZjuE4xx6mYwTOsZfpGIlz/MB0jMI59jEd+TjHj0xHIc6xn+kYi3P8xHSMwzkOMB3jcY6DTMcEnOMQ0zER5/iZ6ZiEcxxmOqbgHL8wHVNxjiNMxzSc41emYwbOcZTpmIlz/MZ0zMY5jjEdc3CO35mOuTjHcaZjHs7xB9MxH+c4wXQswDn+ZDoW4RwnmY4lsKHSizEduJxXegrTsQznOIvpWI5zpDIdK3CONKZjJc7hYTpW4RxepmM1zpHOdKzBOTKYjrU4RybTITiHj+lYh3P4mY71OEeA6diAc2QxHRtxjmymYxPOEWQ6NuMcIaZjC84RZjq24RwRpmM7zhFlOnbgHDlMx06cI8Z07MI54kzHbpwjwXTsxTmKMx37cI4STMd+nONspuMAzlGS6TiEc5zDdBzGOUoxHUdwjtJMx1GcowzTcQznKMt0HMc5yjEdJ3COc5mOkzhHeaLDk4JznMd0pOIcFZgOD85xPtORjnNUZDoycY5KTIcf56jMdGThHBcwHUGcowrTEcY5LmQ6ojhHVaYjhnNcxHQkcI5qTEcJnKM601ES56jBdJTCOWoyHWVwjlpMRzmcozbTUR7nqMN0VMA56jIdFXGOekxHZZyjPtNRBedowHTg9mlIv5jpqIZzNGQ6auAclzAdtXCOS5kO3P4f6ZcxHbj9P9IvZzpw+3+kX8F04Pb/SG/EdOD2/0hvzHTg9v9Ib8J04Pb/SL+S6cDt/5HelOnA7f+RfhXTgdv/I70Z04Hb/yO9OdOB2/8jvQXTgdv/I/1qpgO3/0f6NUwHbv+P9GuZDtz+H+nXMR24/T/SWzIduP0/0q9nOnD7f6S3Yjpw+3+k38B04Pb/SL+R6cDt/5HemunA7f+RfhPTgdv/I/1mpgO3/0f6LUwHbv+P9DZMB27/j/S2TAdu/4/0W5kO3P4f6bcxHbj9P9JvZzpw+3+k32FwzPrb0aJHlz6Fka3FJot3mXjfEe9y8b4r3hXifU+8K8X7vnhXifcD8a4W74fiXSPej8S7Vrwfi1fE+4l414n3U/GuF+9n4t0g3s/Fu1G8X4h3k3i/FO9m8X4l3i3i3SrebeL9WrzbxfuNeHeI91vx7hTvd+LdJd7vxbtbvHvEu1e8P4h3n3h/FO9+8f4k3gPiPSjeQ+L9WbyHxfuLeI+I91fxHhXvb+I9Jt7fxXtcvH+I94R4/xTvSUkvJumn/qiOpKdKepqkeyTdK+npkp4h6ZmS7pN0v6QHJD1L0rMlPSjpIUkPS3pE0qOSniPpMUmPS3pC0otLeglJP1vSS0r6OZJeStJLS3oZSS8r6eUk/VxJLy/p50l6BUk/X9IrSnolSa8s6RdIehVJv1DSq0r6RZJeTdKrS3oNSa8p6bUkvbak19GGuvaitY2rHVBtHmrfTVtW2u3RRon2GPTxvD7Z1ofC+jxVH0XqUzx9AKbPjvSxiz6x0Jt9vU/WW0y9O9MbG70n0MtpvRLVizi9/tFLB/3W1S8sPdfraVLPMPrh1ONaD4npf7/febMa5eZ26t3ntk69exYWFBqOprTSklZOX1i9Y8veO2pMrry4VdOFeXlt21Wqtaf5gCW98pvsOFJ4UF956oXetwssB6i+zDBeersifRwjpo9jivEz5AX+mSoXDnO8AdjmvpPpALYj72I6gO3Iu5kOYDuyPdMBbEfew3QA25EdmA5gO7Ij0wFsR3ZiOoDtyHuZDmA7sjPTAWxH3sd0ANuRXZgOYDvyfqYD2I7synQA25HdmA5gO7I70wFsR/ZgOoDtyJ5MB7Ad2YvpALYjH2A6gO3I3kwHsB2Zy3QA25F9mA5gO7Iv0wFsRz7IdADbkf2YDmA7sj/TAWxHDmA6gO3Ih5gOYDtyINMBbEc+zHQA25GDmI5cnOMRpqMvzjGY6eiHczzKdAzAOfKYjoE4x2NMxyCcYwjTMRjneJzpyMM5hjIdQ3COJ5iOoTjHMKZjGM7xJNMxHOcYznSMwDmeYjpG4hwjmI5ROMfTTEc+zjGS6SjEOZ5hOsbiHKOYjnE4x2imYzzOkc90TMA5CpiOiThHIdMxCecYw3RMwTnGMh1TcY5nmY5pOMc4pmMGzvEc0zET5xjPdMzGOZ5nOubgHBOYjrk4xwtMxzycYyLTMR/neJHpWIBzTGI6FuEck5mOJTjHFKYDmPN6ielYhnNMZTqW4xwvMx0rcI5pTMdKnGM607EK55jBdKzGOV5hOtbgHDOZjrU4xyymQ3CO2UzHOpzjVaZjPc4xh+nYgHO8xnRsxDnmMh2bcI7XmY7NOMc8pmMLzvEG07EN55jPdGzHOd5kOnbgHAuYjp04x0KmYxfOsYjp2I1zLGY69uIcS5iOfTjHW0zHfpxjKdNxAOd4m+k4hHMsYzoO4xzvMB1HcI7lTMdRnONdpuMYzrGC6TiOc7zHdJzAOVYyHSdxjveJDk8KzrGK6UjFOT5gOjw4x2qmIx3n+JDpyMQ51jAdfpzjI6YjC+dYy3QEcY6PmY4wziFMRxTn+ITpiOEc65iOBM7xKdNRAudYz3SUxDk+YzpK4RwbmI4yOMfnTEc5nGMj01Ee5/iC6aiAc2xiOiriHF8yHZVxjs1MRxWc4yumA7hPwxamoxrOsZXpqIFzbGM6auEcXzMdwP0/tjMdwP0/vmE6gPt/7GA6gPt/fMt0APf/2Ml0APf/+I7pAO7/sYvpAO7/8T3TAdz/YzfTAdz/Yw/TAdz/Yy/TAdz/4wemA7j/xz6mA7j/x49MB3D/j/1MB3D/j5+YDuD+HweYDuD+HweZDuD+H4eYDuD+Hz8zHcD9Pw4zHcD9P35hOoD7fxxhOoD7f/zKdAD3/zjKdAD3//iN6QDu/3GM6QDu//E70wHc/+M40wHc/+MPpgO4/4fhp9n/2pY+37ot/Xmn5k+6j3ypK5zMX1bnL7DMn/6nZZWcVHmRpJ1TaKjxIosj7RyTNvkP2FOK7Kimw1r+2u7sxr27dOvWpXOT9t26jfGMzZveukuPzt062Q5UQwe2aANeiB6wShEGLLB+iMpYj/Zyo9Ee8Ri2ZCs4NWb3Xt06SUaxf/6ZYj35GPIUea837ta+Q9fGPftf1bdHh1PHTt60Gxu1bNa0IG9Gmy59enTKzdW5y/776MooKPpSh6xLHUqy1CdPnvztn6X+zy9OOfVfpy3iWf/8M9XyjZFiWp6zbC9LLXsGZ9qQLp7tTN/YyZle5y9rm79JEecfPeY/D1tw8FQBGWdZJs9INX3NNDa9qonh+PsfF9Lw1aCU0Q7eolPvkekNykhzMHtF8+weB7Ofb57d6+TDETTPn+5g/grm2TNcnRoitvkzXc0fs83vczV/2Da/3zL/3zczLXp06VMY3VrsCv286odGj1w9ePQd1EVUhw4laVX/P/Gf6X97/n3KLzQtVyD5aTrDdDLPKPq3kumtP3UyD9jeekO06rT72Cj0PjYDl+vKyC7iIZzzv+khXGD6Sk4/ab0myC6wLb/pYAsW6WDLMR1sKYSDLVjED63xvBL6Lz2vpJzZecX4lR528Fab3x9cPjEjQnSk4X53nhFlOnC/D87IYTpwvw/OiDEduN8HZ8SZDtzvgzMSTAfu98EZxZkO3O+DM0owHbjfB2eczXTgfh+cUZLpwP0+OOMcpgP3++CMUkwH7vfBGaWZDtzvgzPKMB243wdnlGU6cL8PzijHdOB+H5xxLtOB+31wRnmmA/f74IzzmA7c74MzKjAduN8HZ5zPdOB+H5xRkenA/T44oxLTgft9cEZlpgP3++CMC5gO3O+DM6owHbjfB2dcyHTgfh+cUZXpwP0+OOMipgP3++CMakwH7vfBGdWZDtzvgzNqMB243wdn1GQ6cnGOWkxHX5yjNtPRD+eow3QMwDnqMh0DcY56TMcgnKM+0zEY52jAdOThHBczHUNwjoZMx1Cc4xKmYxjOcSnTMRznuIzpGIFzXM50jMQ5rmA6RuEcjZiOfJyjMdNRiHM0YTrG4hxXMh3jcI6mTMd4nOMqpmMCztGM6ZiIczRnOibhHC2Yjik4x9VMx1Sc4xqmYxrOcS3TMQPnuI7pmIlztGQ6ZuMc1zMdc3COVkzHXJzjBqZjHs5xo8Fxeq4s9leuLCoZOZIRk4y4ZCQko7hklJCMsyWjpGScIxmlJKO0ZJSRjLKSUU4yzpWM8pJxnmRUkIzzJaOiZFSSjMrauteutzaMtdeqbUrt8GlzTPtK2pLRboY2AvQZuj5+1ie3+tBTnxfqozZ9SqUPePTZiD5W0DtyvZnV+0C9hdK7D71w12tevVzUKy29SNHvd/1q1G8VPSHruUxPA/oJ0oNP3zcln2murGoRcmURW64sUmAJG7Uu0sEWw+bKgGEji+MMcmU3JZ8cmCs768xyZTflmyw3O3irze8P8HeEtxAdyFxZG6YDmCtry3QAc2W3Mh3AXNltTAcwV3Y70wHMld3BdABzZe2YDmCu7E6mA5gru4vpAObK7mY6gLmy9kwHMFd2D9MBzJV1YDqAubKOTAcwV9aJ6QDmyu5lOoC5ss5MB/B+8D6mA5gr68J0AHNl9zMdwFxZV6YDmCvrxnQAc2XdmQ5grqwH0wHMlfVkOoC5sl5MBzBX9gDTAcyV9WY6gLmyXKYDmCvrw3QAc2V9mQ5gruxBpgOYK+vHdABzZf2ZDmCubADTAcyVPcR0AHNlA5kOYK7sYaYDmCsbxHQAc2WPMB3AXNlgpgOYK3uU6QDmyvKYDmCu7DGmA5grG8J0AHNljzMdwFzZUKYDmCt7gukA5sqGMR3AXNmTTAcwVzac6QDmyp5iOoC5shFMBzBX9jTTAcyVjWQ6gLmyZ5gOYK5sFNMBzJWNZjqAubJ8pgOYKytgOoC5skKmA5grG8N0AHNlY5kOYK7sWYPj9FxZ/K9cWRvJaCsZt0rGbZJxu2TcIRntJONOybhLMu6WjPaScY9kdJCMjpLRSTLulYzOknGfZHSRjPslo6tkdJOM7tq61663Noy116ptSu3waXNM+0raktFuhjYC9Bm6Pn7WJ7f60FOfF+qjNn1KpQ949NmIPlbQO3K9mdX7QL2F0rsPvXDXa169XNQrLb1I0e93/WrUbxU9Ieu5TE8D+gnSg0/fNyWfaa7swiLkym6x5cpuKbCEjcYV6WCLY3NlwB+XWRxnkCt7LvnkwFxZ6pnlyp7LN1nGO3irze8P8L7teaIDmSubwHQAc2UvMB3AXNlEpgOYK3uR6QDmyiYxHcBc2WSmA5grm8J0AHNlLzEdwFzZVKYDmCt7mekA5sqmMR3AXNl0pgOYK5vBdABzZa8wHcBc2UymA5grm8V0AHNls5kO4K3/q0wHMFc2h+kA5speYzqAubK5TAcwV/Y60wHMlc1jOoC5sjeYDmCubD7TAcyVvcl0AHNlC5gOYK5sIdMBzJUtYjqAubLFTAcwV7aE6QDmyt5iOoC5sqVMBzBX9jbTAcyVLWM6gLmyd5gOYK5sOdMBzJW9y3QAc2UrmA5gruw9pgOYK1vJdABzZe8zHcBc2SqmA5gr+4DpAObKVjMdwFzZh0wHMFe2hukA5so+YjqAubK1TAcwV/Yx0wHMlQnTAfx94idMBzBXto7pAObKPmU6gLmy9UwHMFf2GdMBzJVtYDqAubLPmQ5grmwj0wHMlX3BdABzZZuYDmCu7EumA5gr28x0AHNlXxkcp+fKEn/lyiZIxguSMVEyXpSMSZIxWTKmSMZLkjFVMl6WjGmSMV0yZkjGK5IxUzJmScZsyXhVMuZIxmuSMVcyXpeMedq61663Noy116ptSu3waXNM+0raktFuhjYC9Bm6Pn7WJ7f60FOfF+qjNn1KpQ949NmIPlbQO3K9mdX7QL2F0rsPvXDXa169XNQrLb1I0e93/WrUbxU9Ieu5TE8D+gnSg0/fNyWfaa5MPA8WIVn2vC1Z9nyBJW60pUiHWwKbLANezlscZ5As25p8cmCyLO3MkmVb802WbQ7eavP7sw031NdEBzJZtp3pACbLvmE6gMmyHUwHMFn2LdMBTJbtZDqAybLvmA5gsmwX0wFMln3PdACTZbuZDmCybA/TAUyW7WU6gMmyH5gOYLJsH9MBTJb9yHQAk2X7mQ5gsuwnpgOYLDvAdACTZQeZDmCy7BDTAUyW/cx0AJNlh5kOYLLsF6YDmCw7wnQAk2W/Mh3AZNlRpgOYLPuN6QAmy44xHcBk2e9MBzBZdpzpACbL/mA6gMmyE0wHMFn2J9MBTJadZDpwybLMYkwHLlmWmcJ04JJlmWcxHbhkWWYq04FLlmWmMR24ZFmmh+nAJcsyvUwHLlmWmc504JJlmRlMBy5ZlpnJdOCSZZk+pgOXLMv0Mx24ZFlmgOnAJcsys5gOXLIsM5vpwCXLMoNMBy5ZlhliOnDJssww04H7KWpmhOnAJcsyo0wHLlmWmcN04JJlmTGmA5csy4wzHbhkWWaC6cAlyzKLMx24ZFlmCaYDlyzLPJvpwCXLMksyHbhkWeY5TAcuWZZZiunAJcsySxscpyfLiv+VLNsuGd9Ixg7J+FYydkrGd5KxSzK+l4zdkrFHMvZKxg+SsU8yfpSM/ZLxk2QckIyDknFIMn6WjMOS8YtkHNHWvXa9tWGsvVZtU2qHT5tj2lfSlox2M7QRoM/Q9fGzPrnVh576vFAftelTKn3Ao89G9LGC3pHrzazeB+otlN596IW7XvPq5aJeaelFin6/61ejfqvoCVnPZXoa0E+QHnz6vin5TJNlVYqQK/valiv7usAwXmaZIh1sxbG5MlzYyOQoeq4ss2zyyYG5Ms8Z5coyy+abLOUcvNXm96ccbqhziQ5griyzPNOBy5Vlnsd04HJlmRWYDlyuLPN8pgOXK8usyHTgcmWZlZgOXK4sszLTgcuVZV7AdOByZZlVmA5crizzQqYDlyvLrMp04HJlmRcxHbhcWWY1pgOXK8usznTgcmWZNZgOXK4ssybTgcuVZdZiOnC5sszaTAcuV5ZZh+nA5coy6zIduFxZZj2mA5cry6zPdOByZZkNmA5crizzYqYDlyvLbMh04HJlmZcwHbhcWealTAcuV5Z5GdOBy5VlXs504HJlmVcwHbhcWWYjpgOXK8tszHTgcmWZTZgOYK7sSqYDmCtrynQAc2VXMR3AXFkzpgOYK2vOdABzZS2YDmCu7GqmA5gru4bpAObKrmU6gLmy65gOYK6sJdMBzJVdz3QAc2WtmA5gruwGpgOYK7uR6QDmylozHcBc2U1MBzBXdjPTAcyV3cJ0AHNlbZgOYK6sLdMBzJXdynQAc2W3MR3AXNntTAcwV3YH0wHMlbVjOoC5sjuZDmCu7C6mA5gru5vpAObK2jMdwFzZPQbH6bmyEqdyZZnlJfM8yawgmedLZkXJrCSZlSXzAsmsIpkXSmZVybxIMqtJZnXJrCGZNSWzlmTWlsw6kllXMutJZn3JbKCte+16a8NYe63aptQOnzbHtK+kLRntZmgjQJ+h6+NnfXKrDz31eaE+atOnVPqAR5+N6GMFvSPXm1m9D9RbKL370At3vebVy0W90tKLFP1+169G/VbRE7Key/Q0oJ8gPfj0fVPyGe9YdiowlmJMlmWea0qW6csscaMORTrcSkCTZci4kcVxBsmyjsknBybLvGeWLOuYb7J0cvBWm98f4C9B7i3iW236BKaVlrQypheWlbRytgXvTFxwZATuPqYDGIHrwnQAI3D3Mx3ACFxXpgMYgevGdAAjcN2ZDmAErgfTAYzA9WQ6gBG4XkwHMAL3ANMBjMD1ZjqAEbhcpgMYgevDdAAjcH2ZDmAE7kGmAxiB68d0ACNw/ZkOYARuANMBjMA9xHQAI3ADmQ5gBO5hpgMYgRvEdAAjcI8wHcAI3GCmAxiBe5TpAD74zGM6gBG4x5gOYARuCNMBjMA9znQAI3BDmQ5gBO4JpgMYgRvGdAAjcE8yHcAI3HCmAxiBe4rpAEbgRjAdwAjc00wHMAI3kukARuCeYTqAEbhRTAcwAjea6QBG4PKZDmAEroDpAEbgCpkOYARuDNMBjMCNZTqAEbhnmQ5gBG4c0wGMwD3HdAAjcOOZDmAE7nmmAxiBm8B0ACNwLzAdwAjcRKYDGIF7kekARuAmMR3ACNxkpgMYgZvCdAAjcC8xHcAI3FSmAxiBe5npAEbgpjEdwAjcdKYDGIEznDL+FYE7+68I3H2S2UUy75fMrpLZTTK7S2YPyewpmb0k8wHJ7C2ZuZLZRzL7SuaDktlPMvtL5gDJfEgyB0rmw5I5SDIf0da9dr21Yay9Vm1TaodPm2PaV9KWjHYztBGgz9D18bM+udWHnvq8UB+16VMqfcCjz0b0sYLekevNrN4H6i2U3n3ohbte8+rlol5p6UWKfr/rV6N+q+gJWc9lehrQT5AefPq+Kfl/FoEzB5k6n1rXpLmaUpY/CfI/zm9K1t1baHpf77VUmfmKZaxSRfvzJmdj83fA3ya8UsT3xJi/m5l8cmD+Lv3MDtuZpsM2c5aDt9r8/szCDTWb6EDG2l5lOoCxtjlMBzDW9hrTAYy1zWU6gLG215kOYKxtHtMBjLW9wXQAY23zmQ5grO1NpgMYa1vAdABjbQuZDmCsbRHTAYy1LWY6gLG2JUwHMNb2FtMBjLUtZTqAsba3mQ5grG0Z0wGMtb3DdABjbcuZDmCs7V2mAxhrW8F0AGNt7zEdwFjbSqYDGGt7n+kAPjpexXQAY20fMB3AWNtqpgMYa/uQ6QDG2tYwHcBY20dMBzDWtpbpAMbaPmY6gLE2YTqAsbZPmA5grG0d0wGMtX3KdABjbeuZDmCs7TOmAxhr28B0AGNtnzMdwFjbRqYDGGv7gukAxto2MR3AWNuXTAcw1raZ6QDG2r5iOoCxti1MBzDWtpXpAMbatjEdwFjb10wHMNa2nekAxtq+YTqAsbYdTAcw1vYt0wGMte1kOoCxtu+YDmCsbRfTAYy1fc90AGNtu5kOYKxtD9MBjLXtZTqAsbYfmA5grG2fwXF6rK3kX7G2VyVzjmS+JplzJfN1yZwnmW9I5nzJfFMyF0jmQslcJJmLJXOJZL4lmUsl823JXCaZ70jmcsl8VzJXSOZ72rrXrrc2jLXXqm1K7fBpc0z7StqS0W6GNgL0Gbo+ftYnt/rQU58X6qM2fUqlD3j02Yg+VtA7cr2Z1ftAvYXSuw+9cNdrXr1c1CstvUjR73f9atRvFT0h67lMTwP6CdKDT983Jf8v7exWzJo/m23b2W12gSVu9GORDreS2GQZMG5kcZxBsmy/ZXJLsizFkixLObNk2f58k+UnwxK93rhb+w5dG/fsf1XfHh2atO/WLW/ajY1aNmtakDejTZc+PTrl5uo4Zc+ozIxipuM2/aQJcwCEOVD2zHaBO9e6C9y5tjfnYBGPX3Oh5a2FlrcVesjBCcP8/QTM9f3MdABzfYeZDmCu7xemA5jrO8J0AHN9vzIdwFzfUaYDmOv7jekA5vqOMR3AXN/vTAcw13ec6QDm+v5gOoC5vhNMBzDX9yfTAcz1nWQ6cLk+XzGmA5fr86UwHbhcn+8spgOX6/OlMh24XJ8vjenA5fp8HqYDl+vzeZkOXK7Pl8504HJ9vgymA5fr82UyHbhcn8/HdOByfT4/04HL9fkCTAcu1+fLYjpwuT5fNtOBy/X5gkwHLtfnCzEduFyfL8x04HJ9vgjTgcv1+aJMBy7X58thOnC5Pl+M6cDl+nxxpgOX6/MlmA5crs9XnOnA5fp8JZgOXK7PdzbTgcv1+UoyHbhcn+8cpgOX6/OVYjpwuT5faaYDl+vzlWE6cLk+X1mmA5fr85VjOnC5Pt+5TAcu1+crz3Tgcn2+85gOXK7PV4HpwOX6fOczHbhcn68i04HL9fkqMR24XJ+vMtOBy/X5LmA6cLk+XxWmA5fr813IdOByfb6qTAcu1+e7iOnA5fp81ZgOXK7PV53pwOX6fDUMjn8FrU6lfgy5NsurfDWTV3gGKS9fLYsclvIqVvT4VFpZSf/TtO1cWmmTuLbJcoXBMrtx7y7dunXpfCpfNSY9P2966y49OnfrZDucaiWf4K8Ru/fq1kl8dUzhwyKvbi0d2Xbs102+tGcye93RLo6ZU8nAA/mWo6HU7UX9TI8x/XS2s+lQrGcqsbXpgL39DA6PZHPX1jfIklysbdLWd/FW++rpwKa32mdIOllyk74GZc/gLO+rb3rVxUU9yyMPx4b/pYdjsTPKimf+ZDoqauo3m+2ouMRRob7a1kJr2wq9tKjfSGlj4N9IRRuwBnpAPUSLMKTlDFc31XJ+SzW8pm7yykZblWdypkwmrXPqFGSb3XQ4XlbUwzGjoKhvdpIj/uTJk9/8M+R/vpBIOfVfBf9cT13+zz+vsF1aWb4ZLre97Iqy/+8r9WTz62r857el4OBfr7rc9OZdYVjZIm8Q7auv0492cTpNKy3pd1rD/JVsp9NGrgq9y1poZVuhjV0Vere10AtshTZxVWh7a6FVbIVe6arQe6yFXmgrtOkZfA8kn18L7WCb/ypX83e0zd/M1fydbPM3dzX/vbb5W7iav7Nt/qtdzX+fbf5rXM3fxTb/ta7mv982/3Wu5u9qm7+lq/m72ea/3tX83W3zt3I1fw/b/De4mr+nbf4bXc3fyzZ/a1fzP2Cb/yZX8/e2zX+zq/lzbfPf4mr+Prb527iav69t/rau5n/QNv+trubvZ5v/Nlfz97fNf7ur+QfY5r/D1fwP2eZv52r+gbb573Q1/8O2+e9yNf8g2/x3u5r/Edv87V3NP9g2/z2u5n/UNn8HV/Pn2ebv6Gr+x2zzd3I1/xDb/Pe6mv9x2/ydXc0/1Db/fa7mf8I2fxdX8w+zzX+/q/mftM3f1dX8w23zd3M1/1O2+bu7mn+Ebf4eruZ/2jZ/T1fzj7TN38vV/M/Y5n/A1fyjbPP3djX/aNv8ua7mz7fN38fV/AW2+fu6mr/QNv+DruYfY5u/n6v5x9rm7+9q/mdt8w9wNf842/wPuZr/Odv8A13NP942/8Ou5n/eNv8gV/NPsM3/iKv5X7DNP9jV/BNt8z/qav4XbfPnuZp/km3+x1zNP9k2/xBX80+xzf+4q/lfss0/1NX8U23zP+Fq/pdt8w9zNf802/xPupp/um3+4a7mn2Gb/ylX879im3+Eq/ln2uZ/2tX8s2zzj3Q1/2zb/M+4mv9V2/yjXM0/xzb/aFfzv2abP9/V/HNt8xe4mv912/yFruafZ5t/jKv537DNP9bV/PNt8z/rav43bfOPczX/Atv8z7maf6Ft/vGu5l9km/95V/Mvts0/wdX8S2zzv+Bq/rds8090Nf9S2/wvupr/bdv8k1zNv8w2/2RX879jm3+Kq/mX2+Z/ydX879rmn+pq/hW2+V92Nf97tvmnuZp/pW3+6a7mf982/wxX86+yzf+Kq/k/sM0/09X8q23zz3I1/4e2+We7mn+Nbf5XXc3/kW3+Oa7mX2ub/zVX839sm3+uq/nFNv/rrub/xDb/PFfzr7PN/4ar+T+1zT/f1fzrbfO/6Wr+z2zzL3A1/wbb/Atdzf+5bf5FrubfaJt/sav5v7DNv8TV/Jts87/lav4vbfMvdTX/Ztv8b7ua/yvb/Mtczb/FNv87rubfapt/uav5t9nmf9fV/F/b5l/hav7ttvnfczX/N7b5V7qaf4dt/vddzf+tbf5VrubfaZv/A1fzf2ebf7Wr+XfZ5v/Q1fzf2+Zf42r+3bb5P3I1/x7b/Gtdzb/XNv/Hrub/wTa/uJp/n23+T1zN/6Nt/nWu5t9vm/9TV/P/ZJt/vav5bX8c0/eZq/kP2ubf4Gr+Q7b5P3c1/8+2+Te6mv+wbf4vXM3/i23+Ta7mP2Kb/0tX8/9qm3+zq/mP2ub/ytX8v9nm3+Jq/mO2+be6mv932/zbXM1/3Db/167m/8M2/3ZX85+wzf+NZf6//3B9ix5d+hSes7XYZPE1El9j8TUR35Xiayq+q8TXTHzNxddCfFeL7xrxXSu+68TXUnzXi6+V+G4Q343iay2+m8R3s/huEV8b8bUV363iu018t4vvDvG1E9+d4rtLfHeLr7347hFfB/F1FF8n8d0rvs7iu098XcR3v/i6iq+b+LqLr4f4eoqvl/geEF9v8eWKr4/4+orvQfH1E19/8Q0Q30PiGyi+h8U3SHyPiG+w+B4VX574HhPfEPE9Lr6h4ntCfMPE96T4hovvKfGNEN/T4hspvmfEN0p8o8WXL74C8RWKb4z4xorvWfGNE99z4hsvvufFN0F8L4hvovheFN8k8en6TBHfS9rb1/a6dri1yax9Xm21ardTG47a89O2m3a+tPmk/R9twWgXRBsR2gvQx/H6RFwfSutzYX00q09H9QGlPiPUx3T6pEwfVunzIn1ko09N9MGFPjvQ23e9g9abWL2P1Fs5vZvSGxq9p9DLer2y1otbvb7USzy9ytILHb3W0K97/cbVLz393tFTv5599QSo5yA9DegnUT8MejzqITH97/e7qMed568/j3mp7bjbYTju/tkw4RzohgmWya1DfVvEz6/lDy3qsJcVJl/EOuY/C76ziB/yUv/9If8/8kNeUGg5mvRD/q3lW+jUC3fa/h7zt6bD+LsinTNKmc4ZKYRzxnf47/z/69yL/OvXuxystnmJduGG+p7oSKuKc+xmOurgHHuYjno4x16mowHO8QPT0RDn2Md0XIpz/Mh0XI5z7Gc6GuEcPzEdTXCOA0xHU5zjINPRDOc4xHS0wDl+ZjquwTkOMx3X4Ry/MB3X4xxHmI4bcI5fmY7WOMdRpuNmnOM3pqMNznGM6bgV5/id6bgd5zjOdLTDOf5gOu7COU4wHe1xjj+Zjg44x0mmoxNsKH8xpqMzzpHCdHTBOc5iOrriHKlMR3ecI43p6IlzeJiOB3AOL9ORi3OkMx19cY4MpqMfzpHJdAzAOXxMx0Ccw890DMI5AkzHYJwji+nIwzmymY4hOEeQ6RiKc4SYjmE4R5jpGI5zRJiOEThHlOkYiXPkMB2jcI4Y05GPc8SZjkKcI8F0jMU5ijMd43COEkzHeJzjbKZjAs5RkumYiHOcw3RMwjlKMR1TcI7STMdUnKMM0zEN5yjLdMzAOcoxHTNxjnOZjtk4R3mmYw7OcR7TMRfnqMB0zMM5zmc65uMcFZmOBThHJaZjEc5RmelYgnNcwHQsxTmqMB3LcI4LmY7lOEdVpmMFznER07ES56jGdKzCOaozHatxjhpMxxqcoybTsRbnqMV0CM5Rm+lYh3PUYTrW4xx1mY4NOEc9pmMjzlGf6diEczRgOjbjHBczHVtwjoZMxzac4xKmYzvOcSnTgftrMf7LmI6dOMflTAfu78n4r2A6duMcjZiOvThHY6ZjH87RhOnYj3NcyXQcwDmaMh2HcI6rmI7DOEczpuMIztGc6TiKc7RgOo7hHFczHcdxjmuYjhM4x7VMx0mc4zqiw5OCc7RkOlJxjuuZDg/O0YrpSMc5bmA6MnGOG5kOP87RmunIwjluYjqCOMfNTEcY57iF6YjiHG2YjhjO0ZbpSOActzIdJXCO25iOkjjH7UxHKZzjDqajDM7Rjukoh3PcyXSUxznuYjoq4Bx3Mx0VcY72TEdlnOMepqMKztGB6cDt0+DvyHRUwzk6MR01cI57mY5aOEdnpgO3/4f/PqYDt/+HvwvTgdv/w38/04Hb/8PflenA7f/h78Z04Pb/8HdnOnD7f/h7MB24/T/8PZkO3P4f/l5MB27/D/8DTAdu/w9/b6YDt/+HP5fpwO3/4e/DdOD2//D3ZTpw+3/4H2Q6cPt/+PsxHbj9P/z9mQ7c/h/+AUwHbv8P/0NMB27/D/9ApgO3/4f/YaYDt/+HfxDTgdv/w/8I04Hb/8M/mOkA7v/xKNMB3P8jj+kA7v/xGNMB3P9jCNMB3P/jcaYDuP/HUKYDuP/HEwbHrL8dLXp06VNYemuxyeLbLb494tsrvh/Et098P4pvv/h+Et8B8R0U3yHx/Sy+w+L7RXxHxPer+I6K7zfxHRPf7+I7Lr4/xHdCfH+K76T4i4lfyzhL/KniTxO/R/xe8aeLP0P8meL3id8v/oD4s8SfLf6g+EPiD4s/Iv6o+HPEHxN/XPwJ8RcXfwnxny3+kuI/R/ylxF9a/GXEX1b85cR/rvjLi/888VcQ//niryj+SuKvLP4LxF9F/BeKv6r4LxJ/NfFXF38N8dcUfy3x1xZ/HfHXFX898dcXfwPxXyz+huK/RPyXiv8y8V8u/ivE30j8jcXfRPxXir+p+K8SfzPxNxd/C/FfLf5rxH+t+K8Tf0vxXy/+VuK/Qfw3ir+1+G8S/83iv0X8bcTfVvy3iv828d8u/jvE3078d4r/Lm2oay9a27jaAdXmofbdtGWl3R5tlGiPQR/P65NtfSisz1P1UaQ+xdMHYPrsSB+76BMLvdnX+2S9xdS7M72x0XsCvZzWK1G9iNPrH7100G9d/cLSc72eJvUMox9OPa71kJj+9/udN6tRbm6n3n1u69S7Z2FB8r+VnFJLfPX1ZdU7tuy9o8bkyotbNV2Yl9e2XaVae5oPWNIrv8mOI4UH9XX6KvF9X2A5PPVlhvH8w4r0YSxt+jCmGD9BPmB41OI4/U3JT/6meP5a7UsNq32WvtK02k86WG3zEj2JG2r4Gax2stVJrVtomDvV8Jq6pvfiKeJ7kQb8WcQIpgPYvn6a6QC2r0cyHcD29TNMB7B9PYrpALavRzMdwPZ1PtMBbF8XMB3A9nUh0wFsX49hOoDt67FMB7B9/SzTAWxfj2M6gO3r55gOYPt6PNMBbF8/z3QA29cTmA5g+/oFpgPYvp7IdADb1y8yHcD29SSmA9i+nsx0ANvXU5gOYPv6JaYD2L6eynQA29cvMx3A9vU0pgPYvp7OdADb1zOYDmD7+hWmA9i+nsl0ANvXs5iOXJxjNtPRF+d4lenoh3PMYToG4ByvMR0DcY65TMcgnON1pmMwzjGP6cjDOd5gOobgHPOZjqE4x5tMxzCcYwHTMRznWMh0jMA5FjEdI3GOxUzHKJxjCdORj3O8xXQU4hxLmY6xOMfbTMc4nGMZ0zEe53iH6ZiAcyxnOibiHO8yHZNwjhVMxxSc4z2mYyrOsZLpmIZzvM90zMA5VjEdM3GOD5iO2TjHaqZjDs7xIdMxF+dYw3TMwzk+Yjrm4xxrmY4FOMfHTMcinEOYjiU4xydMx1KcYx3TsQzn+JTpWI5zrGc6VuAcnzEdK3GODUzHKpzjc6ZjNc6xkelYg3N8wXSsxTk2MR2Cc3zJdKzDOTYzHetxjq+Yjg04xxamYyPOsZXp2IRzbGM6NuMcXzMdW3CO7UzHNpzjG6ZjO86xg+nYgXN8y3TsxDl2Mh3Av0D0HdOxG+fYxXTsxTm+Zzr24Ry7mY79OMcepuMAzrGX6TiEc/zAdBzGOfYxHUdwjh+ZjqM4x36m4xjO8RPTcRznOMB0nMA5DjIdJ3GOQ0SHJwXn+JnpSMU5DjMdHpzjF6YjHec4wnRk4hy/Mh1+nOMo05GFc/zGdARxjmNMRxjn+J3piOIcx5mOGM7xB9ORwDlOMB0lcI4/mY6SOMdJpqMUbKhAMaajDM6RwnSUwznOYjrK4xypTEcFnCON6aiIc3iYjso4h5fpqIJzpDMduH0aAhlMRzWcI5PpqIFz+JiOWjiHn+nA7f8RCDAduP0/AllMB27/j0A204Hb/yMQZDpw+38EQkwHbv+PQJjpwO3/EYgwHbj9PwJRpgO3/0cgh+nA7f8RiDEduP0/AnGmA7f/RyDBdOD2/wgUZzpw+38ESjAduP0/AmczHbj9PwIlmQ7c/h+Bc5gO3P4fgVJMB27/j0BppgO3/0egDNOB2/8jUJbpwO3/ESjHdOD2/wicy3Tg9v8IlGc6cPt/BM5jOnD7fwQqMB24/T8C5zMduP0/AhWZDtz+H4FKTAdu/49AZaYDt/9H4AKDY9bfjhY9uvQpLLO12GTxjxD/0+IfKf5nxD9K/KPFny/+AvEXin+M+MeK/1nxjxP/c+IfL/7nxT9B/C+If6L4XxT/JPHrCFPE/5L4p4r/ZfFPE/908c8Q/yvinyn+WeKfLf5XxT9H/K+Jf674Xxf/PPG/If754n9T/AvEv1D8i8S/WPxLxP+W+JeK/23xLxP/O+JfLv53xb9C/O+Jf6X43xf/KvF/IP7V4v9Q/GvE/5H414r/Y/GL+D8R/zrxfyr+9eL/TPwbxP+5+DeK/wvxbxL/l+LfLP6vxL9F/FvFv038X4t/u/i/Ef8O8X8r/p3i/078u8T/vfh3i3+P+PeK/wfx7xP/j+LfL/6fxH9A/AfFf0j8P4v/sPh/Ef8R8f8q/qPi/038x8T/u/iPi/8P8Z8Q/5/iPymBYhI49dMGCaRqQ1170drG1Q6oNg+176YtK+32aKNEewz6eF6fbOtDYX2eqo8i9SmePgDTZ0f62EWfWOjNvt4n6y2m3p3pjY3eE+jltF6J6kWcXv/opYN+6+oXlp7r9TSpZxj9cOpxrYfE9L/f77xZjXJzO/Xuc1un3j0LCwrfL1u9Y8veO2pMrry4VdOFeXlt21Wqtaf5gCW98pvsOFJ4UA8U8dUX//BCw2F36oVPFZh+ODS8wDBxoEqRPo5lTB/HFOtvm57EfRwtjtPflvzkq+05tdq+Sw2rnaqvNK32hQ5W27xEF+KGqkp0pAF/VHAR0wFs/lZjOoDN3+pMB7D5W4PpADZ/azIdwOZvLaYD2PytzXQAm791mA5g87cu0wFs/tZjOoDN3/pMB7D524DpADZ/L2Y6gM3fhkwHsPl7CdMBbP5eynQAm7+XMR3A5u/lTAew+XsF0wFs/jZiOoDN38ZMB7D524TpADZ/r2Q6gM3fpkwHsPl7FdMBbP42YzqAzd/mTAew+duC6QA2f69mOoDN32uYDmDz91qmA9j8vY7pyMU5WjIdfXGO65mOfjhHK6ZjAM5xA9MxEOe4kekYhHO0ZjoG4xw3MR15OMfNTMcQnOMWpmMoztGG6RiGc7RlOobjHLcyHSNwjtuYjpE4x+1Mxyic4w6mIx/naMd0FOIcdzIdY3GOu5iOcTjH3UzHeJyjPdMxAee4h+mYiHN0YDom4RwdmY4pOEcnpmMqznEv0zEN5+jMdMzAOe5jOmbiHF2Yjtk4x/1MxxycoyvTMRfn6MZ0zMM5ujMd83GOHkzHApyjJ9OxCOfoxXQswTkeYDqW4hy9mY5lOEcu07Ec5+jDdKzAOfoyHStxjgeZjlU4Rz+mYzXO0Z/pWINzDGA61uIcDzEdgnMMZDrW4RwPMx3rcY5BTMcGnOMRpmMjzjGY6diEczzKdGzGOfKYji04x2NMxzacYwjTsR3neJzp2IFzDGU6duIcTzAdu3COYUzHbpzjSaZjL84xnOnYh3M8xXTsxzlGMB0HcI6nmY5DOMdIpuMwzvEM03EE5xjFdBzFOUYzHcdwjnym4zjOUcB0nMA5CpmOkzjHGKLDk4JzjGU6UnGOZ5kOD84xjulIxzmeYzoycY7xTIcf53ie6cjCOSYwHUGc4wWmI4xzTGQ6ojjHi0xHDOeYxHQkcI7JTEcJnGMK01ES53iJ6SiFc0xlOsrgHC8zHeVwjmlMR3mcYzrTUQHnmMF0VMQ5XmE6KuMcM5mOKjjHLKYDuE/DbKajGs7xKtNRA+eYw3TUwjleYzqA+3/MZTqA+3+8znQA9/+Yx3QA9/94g+kA7v8xn+kA7v/xJtMB3P9jAdMB3P9jIdMB3P9jEdMB3P9jMdMB3P9jCdMB3P/jLaYDuP/HUqYDuP/H20wHcP+PZUwHcP+Pd5gO4P4fy5kO4P4f7zIdwP0/VjAdwP0/3mM6gPt/rGQ6gPt/vM90APf/WMV0APf/+IDpAO7/sZrpAO7/8SHTAdz/Yw3TAdz/4yOmA7j/x1qmA7j/x8dMB3D/D8OfFsib9bejRY8ufQrLbi02WQIXSaCaBKpLoIYEakqglgRqS6COBOpKoJ4E6kuggQQulkBDCVwigUslcJkELpfAFRJoJIHGEmgigSsl0FQCV0mgmQSaS6CFBK6WwDUSuFYC10mgpQSul0ArCdwggRsl0FoCN0ngZgncIoE2EmgrgVslcJsEbpfAHRJoJ4E7JXCXBO6WQHsJ3COBDhLoKIFOErhXAp0lcJ8Eukjgfgl0lUA3CXSXQA8J9JRALwk8IIHeEsiVQB8J9JXAgxLoJ4H+EhgggYckMFACD0tgkAQekcBgCTwqgTwJPCaBIRJ4XAJDJfCEBIZJ4EkJDJfAUxIYIYGnJTBSAs9IYJQERksgXwIFEiiUwBgJjJXAsxIYJ4HnJDBeAs9LYIIEXpDARAm8KIFJEtCFnSKBlyQwVQIvS2CaBKZrQ1170drG1Q6oNg+176YtK+32aKNEewz6eF6fbOtDYX2eqo8i9SmePgDTZ0f62EWfWOjNvt4n6y2m3p3pjY3eE+jltF6J6kWcXv/opYN+6+oXlp7r9TSpZxj9cOpxrYfE9L/f77xZjXJzO/Xuc1un3j0LC5L/8D6lhvjq68uqd2zZe0eNyZUXt2q6MC+vbbtKtfY0H7CkV36THUcKD+rr9FUSqFpgOjyrFhjGC3xSpA9jWdOHMcX6CboQ92G0OE5/U/KTvymeU6vtu9Sw2mn6StNqr3Ow2uYlAv4JkU+JjjTgTwrWMx3A1u9nTAew9buB6QC2fj9nOoCt341MB7D1+wXTAWz9bmI6gK3fL5kOYOt3M9MBbP1+xXQAW79bmA5g63cr0wFs/W5jOoCt36+ZDmDrdzvTAWz9fsN0AFu/O5gOYOv3W6YD2PrdyXQAW7/fMR3A1u8upgPY+v2e6QC2fnczHcDW7x6mA9j63ct0AFu/PzAdwNbvPqYD2Pr9kekAtn73Mx3A1u9PTAew9XuA6QC2fg8yHbk4xyGmoy/O8TPT0Q/nOMx0DMA5fmE6BuIcR5iOQTjHr0zHYJzjKNORh3P8xnQMwTmOMR1DcY7fmY5hOMdxpmM4zvEH0zEC5zjBdIzEOf5kOkbhHCeZjnzYUFnFmI5CnCOF6RiLc5zFdIzDOVKZjvE4RxrTMQHn8DAdE3EOL9MxCedIZzqm4BwZTMdUnCOT6ZiGc/iYjhk4h5/pmIlzBJiO2ThHFtMxB+fIZjrm4hxBpmMezhFiOubjHGGmYwHOEWE6FuEcUaZjCc6Rw3QsxTliTMcynCPOdCzHORJMxwqcozjTsRLnKMF0rMI5zmY6VuMcJZmONTjHOUzHWpyjFNMhOEdppgOX284qw3SsxznKMh0bcI5yTMdGnONcpmMTzlGe6diMc5zHdGzBOSowHdtwjvOZju04R0WmYwfOUYnp2IlzVGY6duEcFzAdu3GOKkzHXpzjQqZjH85RlenYj3NcxHQcwDmqMR2HcI7qTMdhnKMG03EE56jJdBzFOWoxHcdwjtpMx3Gcow7TcQLnqMt0nMQ56hEdnhScoz7TkYpzNGA6PDjHxUxHOs7RkOnIxDkuYTr8OMelTEcWznEZ0xHEOS5nOsI4xxVMRxTnaMR0xHCOxkxHAudownSUwDmuZDpK4hxNmY5SOMdVTEcZnKMZ01EO52jOdJTHOVowHRVwjquZjoo4xzVMR2Wc41qmowrOcR3TgdunIasl01EN57ie6aiBc7RiOmrhHDcwHbj9P7JuZDpw+39ktWY6cPt/ZN3EdOD2/8i6menA7f+RdQvTgdv/I6sN04Hb/yOrLdOB2/8j61amA7f/R9ZtTAdu/4+s25kO3P4fWXcwHbj9P7LaMR24/T+y7mQ6cPt/ZN3FdOD2/8i6m+nA7f+R1Z7pwO3/kXUP04Hb/yOrA9OB2/8jqyPTgdv/I6sT04Hb/yPrXqYDt/9HVmemA7f/R9Z9TAdu/4+sLkwHbv+PrPuZDtz+H1ldmQ7c/h9Z3ZgO3P4fWd2ZDtz+H1k9mA7c/h9ZPZkO3P4fWb0Mjll/O1r06NKnsNzWYpMlsF4Cn0lggwQ+l8BGCXwhgU0S+FICmyXwlQS2SGCrBLZJ4GsJbJfANxLYIYFvJbBTAt9JYJcEvpfAbgnskcBeCfwggX0S+FEC+yXwkwQOSOCgBA5J4GcJHJbALxI4IoFfJXBUAr9J4JgEfpfAcQn8IYETEvhTAiclq5hknfrDtZKVKllpkuWRLK9kpUtWhmRlSpZPsvySFZCsLMnKlqygZIUkKyxZEcmKSlaOZMUkKy5ZCckqLlklJOtsySopWedIVinJKi1ZZSSrrGSVk6xzJau8ZJ0nWRUk63zJqihZlSSrsmRdIFlVJOtCyaoqWRdJVjXJqi5ZNSSrpmTVkqzaklVHsupKVj3Jqi9ZDSTrYslqKFmXSNalknWZZF0uWVdIViPJaixZTSTrSslqKllXSVYzyWouWS20oa69aG3jagdUm4fad9OWlXZ7tFGiPQZ9PK9PtvWhsD5P1UeR+hRPH4DpsyN97KJPLPRmX++T9RZT7870xkbvCfRyWq9E9SJOr3/00kG/dfULS8/1eprUM4x+OPW41kNi+t/vd96sRrm5nXr3ua1T756FBYWGo8lXX3wN9YXVO7bsvaPG5MqLWzVdmJfXtl2lWnuaD1jSK7/JjiOFB/WVp14Y+LTAcoDqywzjZT1QpI9jOdPHMcX4GQoA/6yFxXH625JvfVsuNa22r75ptXsbqny9cbf2Hbo27tn/qr49OjRp361b3rQbG7Vs1rQgb0abLn16dMrN1XHKFvlNMWc1gD37XAcHl9kB7K32YTqAvdW+TAewt/og0wHsrfZjOoC91f5MB7C3OoDpAPZWH2I6gL3VgUwHsLf6MNMB7K0OYjqAvdVHmA5gb3Uw0wHsrT7KdAB7q3lMB7C3+hjTAeytDmE6gL3Vx5kOYG91KNMB7K0+wXQAe6vDmA5gb/VJpgPYWx3OdAB7q08xHcDe6gimA9hbfZrpAPZWRzIdwN7qM0wHsLc6iukA9lZHMx3A3mo+0wHsrRYwHbk4RyHT0RfnGMN09MM5xjIdA3COZ5mOgTjHOKZjEM7xHNMxGOcYz3Tk4RzPMx1DcI4JTMdQnOMFpmMYzjGR6RiOc7zIdIzAOSYxHSNxjslMxyicYwrTkY9zvMR0FOIcU5mOsTjHy0zHOJxjGtMxHueYznRMwDlmMB0TcY5XmI5JOMdMpmMKzjGL6ZiKc8xmOqbhHK8yHTNwjjlMx0yc4zWmYzbOMZfpmINzvM50zMU55jEd83CON5iO+TjHfKZjAc7xJtOxCOdYwHQswTkWMh1LcY5FTMcynGMx07Ec51jCdKzAOd5iOlbiHEuZjlU4x9tMx2qcYxnTsQbneIfpWItzLGc6BOd4l+kAhtBXMB3rcY73mI4NOMdKpmMjzvE+07EJ51jFdGzGOT5gOrbgHKuZjm04x4dMx3acYw3TsQPn+Ijp2IlzrGU6duEcHzMdu3EOYTr24hyfMB37cI51TMd+nONTpuMAzrGe6TiEc3zGdBzGOTYwHUdwjs+ZjqM4x0am4xjO8QXTcRzn2MR0nMA5vmQ6TuIcm4kOTwrO8RXTkYpzbGE6PDjHVqYjHefYxnRk4hxfMx1+nGM705GFc3zDdARxjh1MRxjn+JbpiOIcO5mOGM7xHdORwDl2MR0lcI7vmY6SOMdupqMUzrGH6SiDc+xlOsrhHD8wHeVxjn1MRwWc40emoyLOsZ/pqIxz/MR0VME5DjAdwH0aDjId1XCOQ0xHDZzjZ6ajFs5xmOkA7v/xC9MB3P/jCNMB3P/jV6YDuP/HUaYDuP/Hb0wHcP+PY0wHcP+P35kO4P4fx5kO4P4ffzAdwP0/TjAdwP0//mQ6gPt/nGQ6cPt/ZBdjOnD7f2SnMB24/T+yz2I6cPt/ZKcyHbj9P7LTmA7c/h/ZHqYDt/9HtpfpwO3/kZ3OdOD2/8jOYDpw+39kZzIduP0/sn1MB27/j2w/04Hb/yM7wHTg9v/IzmI6cPt/ZGczHbj9P7KDTAdu/4/sENOB2/8jO8x04Pb/yI4YHKdv5l5g3szd9MKL9YWnCk26n3t2tIiFWnadry2+uoWG2WtbKvTVNTlykpdVZEcdHdZweOXNbty7S7duXTqf2up+jGds3vTWXXp07tbJdqwYmlVFG7AmesAaRRjQfBw3sB7HDUejPeI37O5WcGrM7r26dZLs2D//jFs//zmGol9v3K19h66Ne/a/qm+PDqeOnbxpNzZq2axpQd6MNl369OiUm6tzl/330ZVRUPSlvsS61JckWeqTJ0/+9s9S/+cXp5z6r9MWMfHPP4tbTtoppuVJ2F5WvGyRP/t/r5zpHFqqv4Nz6N9viG3+AUWcf/SY/zxswcG/juGE6cRb3PJ5KNXf9KoBhuPvf1xIw1eDUkYXcYkKLCOnn5SMNMt7qS/M/LnAsgQZaaZFL+GK47FyDts4HhPnbFccr5Xzi43jNXFKuuKkWzlHbJx0E+ccV5wMK+dXGyfDxCnlipNp5Ry1cTJNnNKuOD4r5zcbx2filHHF8Vs5x2wcv4lT1sWlwakqf7fd3pVzNf9x2/znupr/D9v85V3Nf8I2/3mu5v/TNn8FV/OftM1/vqP5fcVs81d0NX+Kbf5KruY/yzZ/ZVfzp9rmv8DV/Gm2+au4mt9jm/9CV/N7bfNXdTV/um3+i1zNn2Gbv5qr+TNt81d3Nb/PNn8NV/P7bfPXdDV/wDZ/LVfzZ9nmr+1q/mzb/HVczR+0zV/X1fwh2/z1XM0fts1f39X8Edv8DVzNH7XNf7Gr+XNs8zd0NX/MNv8lruaP2+a/1NX8Cdv8l7mav7ht/stdzV/CNv8VruY/2zZ/I1fzl7TN39jV/OfY5m/iav5StvmvdDV/adv8TV3NX8Y2/1Wu5i9rm7+Zq/nL2eZv7mr+c23zt3A1f3nb/Fe7mv882/zXuJq/gm3+a13Nf75t/utczV/RNn9LV/NXss1/vav5K9vmb+Vq/gts89/gav4qtvlvdDX/hbb5W7uav6pt/ptczX+Rbf6bXc1fzTb/La7mr26bv42r+WvY5m9rmf/v37O26NGlT+G5W4tdIdklJPtsyS6prXdtV2uLV9ui2krUbp421LSnpW0l7exoc0X7G9pi0Kf8+qBdn3Xr42Z94qsPXfW5pz561Kd/+gBOn4HpYyh9EqQPY/R5iD6S0KcCemOu98Z6e6p3iHqTpvdJequidwt6wa7XzHrZqleOevGm1096CaNXEfpFrt+l+nWm3yh6Utfzqp7a9OyiH3D9jOlhrkeavtm63kqe/rfn3z85KjQt163JW68Zph8TZRT9V1Gmt/7Uj4lutb31txnm/+enzOdCf8psmdw61O1FPITL/296CFt+b3nqALH+Ju32Atvymw62O4p0sJU3HWwphIPtjiJ+aI3nlXb/peeVlDM7r7SznVfudPBWm9+fO3FD3UV0pOH+9Fj23UwH7k9EZbdnOnB/Iir7HqYD9yeisjswHbg/EZXdkenA/Ymo7E5MB+5PRGXfy3Tg/kRUdmemA/cnorLvYzpwfyIquwvTgfsTUdn3Mx24PxGV3ZXpwP2JqOxuTAfwT0R1ZzqAfyKqB9MB/BNRPZkO4J+I6sV0AP9E1ANMB/BPRPVmOoB/IiqX6QD+iag+TAfwT0T1ZTqAfyLqQaYD+Cei+jEdwD8R1Z/pAP6JqAFMB/BPRD3EdAD/RNRApgP4J6IeZjqAfyJqENMB/BNRjzAdwD8RNZjpyMU5HmU6+uIceUxHP5zjMaZjAM4xhOkYiHM8znQMwjmGMh2DcY4nmI48nGMY0zEE53iS6RiKcwxnOobhHE8xHcNxjhFMxwic42mmYyTOMZLpGIVzPMN05OMco5iOQpxjNNMxFufIZzrG4RwFTMd4nKOQ6ZiAc4xhOibiHGOZjkk4x7NMxxScYxzTMRXneI7pmIZzjGc6ZuAczzMdM3GOCUzHbJzjBaZjDs4xkemYi3O8yHTMwzkMX6n/ypWd91eu7G7Jbi/Z90h2B8nuKNmdJPteye4s2fdJdhfJvl+yu0p2N8nuLtk9JLunZPeS7Acku7dk50p2H8nuK9kPauteu97aMNZeq7YptcOnzTHtK2lLRrsZ2gjQZ+j6+Fmf3OpDT31eqI/a9CmVPuDRZyP6WEHvyPVmVu8D9RZK7z70wl2vefVyUa+09CJFv9/1q1G/VfSErOcyPQ3oJ0gPPn3flHymubJaRciV3WXLld1VYBlvcpEOtvOwuTJg2MjiOINc2ZTkkwNzZWedWa5sSr7J8pKDt9r8/ryEG2oq0YHMlb3MdABzZdOYDmCubDrTAcyVzWA6gLmyV5gOYK5sJtMBzJXNYjqAubLZTAcwV/Yq0wHMlc1hOoC5steYDmCubC7TAcyVvc50AHNl85gOYK7sDaYDmCubz3QAc2VvMh3AXNkCpgOYK1vIdABzZYuYDmCubDHTAcyVLWE6gLmyt5gOYK5sKdMBzJW9zXQAc2XLmA5gruwdpgOYK1vOdABzZe8yHcBc2QqmA5gre4/pAObKVjIdwFzZ+0wHMFe2iukA5so+YDqAubLVTAcwV/Yh0wHMla1hOoC5so+YDmCubC3TAcyVfcx0AHNlwnQAc2WfMB3AXNk6pgOYK/uU6QDmytYzHcBc2WdMBzBXtoHpAObKPmc6gLmyjUwHMFf2BdMBzJVtYjqAubIvmQ5grmwz0wHMlX3FdABzZVuYDmCubCvTAcyVbWM6gLmyr5kOYK5sO9MBzJV9w3QAc2U7mA5gruxbpgOYK9tpcJyeK6vwV67sZcmeJtnTJXuGZL8i2TMle5Zkz5bsVyV7jmS/JtlzJft1yZ4n2W9I9nzJflOyF0j2QsleJNmLJXuJZL+lrXvtemvDWHut2qbUDp82x7SvpC0Z7WZoI0CfoevjZ31yqw899XmhPmrTp1T6gEefjehjBb0j15tZvQ/UWyi9+9ALd73m1ctFvdLSixT9ftevRv1W0ROynsv0NKCfID349H1T8pnmymoWIVc21ZYrm1pgGe+7Ih1sFbC5MmDYyOI4g1zZruSTA3NlqWeWK9uVb7J87+CtNr8/3+OG2k10IHNle5gOYK5sL9MBzJX9wHQAc2X7mA5gruxHpgOYK9vPdABzZT8xHcBc2QGmA5grO8h0AHNlh5gOYK7sZ6YDmCs7zHQAc2W/MB3AXNkRpgOYK/uV6QDmyo4yHcBc2W9MBzBXdozpAObKfmc6gLmy40wHMFf2B9MBzJWdYDqAubI/mQ5gruwk04HLlQWLMR24XFkwhenA5cqCZzEduFxZMJXpwOXKgmlMBy5XFvQwHbhcWdDLdOByZcF0pgOXKwtmMB24XFkwk+nA5cqCPqYDlysL+pkOXK4sGGA6cLmyYBbTgcuVBbOZDlyuLBhkOnC5smCI6cDlyoJhpgOXKwtGmA5criwYZTpwubJgDtOBy5UFY0wHLlcWjDMduFxZMMF04HJlweJMBy5XFizBdOByZcGzmQ5crixYkunA5cqC5zAduFxZsBTTgcuVBUszHbhcWbAM04HLlQXLMh24XFmwHNOBy5UFz2U6cLmyYHmmA5crC57HdOByZcEKTAcuVxY8n+nA5cqCFQ2O03Nl5/+VK9sj2Xsl+wfJ3ifZP0r2fsn+SbIPSPZByT4k2T9L9mHJ/kWyj0j2r5J9VLJ/k+xjkv27ZB+X7D8k+4Rk/6mte+16a8NYe63aptQOnzbHtK+kLRntZmgjQJ+h6+NnfXKrDz31eaE+atOnVPqAR5+N6GMFvSPXm1m9D9RbKL370At3vebVy0W90tKLFP1+169G/VbRE7Key/Q0oJ8gPfj0fVPymebKxP9UEZJlu23Jst0FhvGClYp0uJ2PTZbh4kYmR9GTZcHKyScHJsvSzihZFqycb7Jc4OCtNr8/F+CGqkJ0AJNlwQuZDlyyLFiV6cAly4IXMR24ZFmwGtOBS5YFqzMduGRZsAbTgUuWBWsyHbhkWbAW04FLlgVrMx24ZFmwDtOBS5YF6zIduGRZsB7TgUuWBeszHbhkWbAB04FLlgUvZjpwybJgQ6YDlywLXsJ04JJlwUuZDlyyLHgZ04FLlgUvZzpwybLgFUwHLlkWbMR04JJlwcZMBy5ZFmzCdACTZVcyHcBkWVOmA5gsu4rpACbLmjEdwGRZc6YDmCxrwXQAk2VXMx3AZNk1TAcwWXYt0wFMll3HdACTZS2ZDmCy7HqmA5gsa8V0AJNlNzAdwGTZjUwHMFnWmukAJstuYjqAybKbmQ5gsuwWpgOYLGvDdACTZW2ZDmCy7FamA5gsu43pACbLbmc6gMmyO5gOYLKsHdMBTJbdyXQAk2V3MR3AZNndTAcwWdae6QAmy+5hOoDJsg5MBzBZ1pHpACbLOjEdwGTZvUwHMFnWmekAJsvuYzqAybIuTAcwWXY/0wFMlhladP9KllU8lSwLXijBqhK8SILVJFhdgjUkWFOCtSRYW4J1JFhXgvUkWF+CDSR4sQQbSvASCV4qwcskeLkE9X/eSIKNtXWvXW9tGGuvVduU2uHT5pj2lbQlo90MbQToM3R9/KxPbvWhpz4v1Edt+pRKH/DosxF9rKB35Hozq/eBeguldx964a7XvHq5qFdaepGi3+/61ajfKnpC1nOZngb0E6QHn75vSj7TZFkNe64sWMWUK9OXWcJG3Yp0sFWE5sqQYSOL4wxyZd2TTw7MlXnOLFfWPd9k6eHgrTa/Pz1wQ/UkOpC5sl5MBzBX9gDTAcyV9WY6gLmyXKYDmCvrw3QAc2V9mQ5gruxBpgOYK+vHdABzZf2ZDmCubADTAcyVPcR0AHNlA5kOYK7sYaYDmCsbxHQAc2WPMB3AXNlgpgOYK3uU6QDmyvKYDmCu7DGmA5grG8J0AHNljzMdwFzZUKYDmCt7gukA5sqGMR3AXNmTTAcwVzac6QDmyp5iOoC5shFMBzBX9jTTAcyVjWQ6gLmyZ5gOYK5sFNMBzJWNZjqAubJ8pgOYKytgOoC5skKmA5grG8N0AHNlY5kOYK7sWaYDmCsbx3QAc2XPMR3AXNl4pgOYK3ue6QDmyiYwHcBc2QtMBzBXNpHpAObKXmQ6gLmySUwHMFc2mekA5sqmMB3AXNlLTAcwVzaV6QDmyl5mOoC5smlMBzBXNp3pAObKZjAdwFzZK0wHMFc2k+kA5spmMR3AXNlspgOYK3uV6QDmyuYwHcBc2WtMBzBXZliSf+XKKv2VK+slwQck2FuCuRLsI8G+EnxQgv0k2F+CAyT4kAQHSvBhCQ6S4CMSHCzBRyWYJ8HHJDhEgo9LcKgEn9DWvXa9tWGsvVZtU2qHT5tj2lfSlox2M7QRoM/Q9fGzPrnVh576vFAftelTKn3Ao89G9LGC3pHrzazeB+otlN596IW7XvPq5aJeaelFin6/61ejfqvoCVnPZXoa0E+QHnz6vin5jHcsO7URWdyaLOtpS5b1LLDEjV4v0uFWCZssA8aNLI4zSJbNSz45MFnmPbNk2bx8k+UNB2+1+f15AzfU/CK+1aZPoK+++BqYXnix+BraFvxN4oIjI3ALmA5gBG4h0wGMwC1iOoARuMVMBzACt4TpAEbg3mI6gBG4pUwHMAL3NtMBjMAtYzqAEbh3mA5gBG450wGMwL3LdAAjcCuYDmAE7j2mAxiBW8l0ACNw7zMdwAjcKqYDGIH7gOkARuBWMx3ACNyHTAcwAreG6QBG4D5iOoARuLVMBzAC9zHTAYzACdMBjMB9wnQAI3DrmA5gBO5TpgMYgVvPdAAjcJ8xHcAI3AamAxiB+5zpAEbgNjIdwAjcF0wHMAK3iekARuC+ZDqAEbjNTAcwAvcV0wGMwG1hOoARuK1MBzACt43pAEbgvmY6gBG47UwHMAL3DdMBjMDtYDqAEbhvmQ5gBG4n0wGMwH3HdAAjcLuYDmAE7numAxiB2810ACNwe5gOYARuL9MBjMD9wHQAI3D7mA5gBO5HpgMYgdvPdAAjcD8xHcAI3AGmAxiBO8h0ACNwh5gOYATuZ6YDGIE7zHQAI3C/GBynR+Aq/xWBWyDBhRJcJMHFElwiwbckuFSCb0twmQTfkeByCb4rwRUSfE+CKyX4vgRXSfADCa6W4IcSXCPBjyS4Vlv32vXWhrH2WrVNqR0+bY5pX0lbMtrN0EaAPkPXx8/65FYfeurzQn3Upk+p9AGPPhvRxwp6R643s3ofqLdQevehF+56zauXi3qlpRcp+v2uX436raInZD2X6WlAP0F68On7puT/WQTOHGR689S6Js3VlLL8Kab/cX5Tsm5+oel9nW+pMnjEMlapov1ZqcrY/N0buGP9SBHfE2P+7tfkkwPzd+lndtj+ajpsg0cdvNXm9+cobqjfiA5krO0Y0wGMtf3OdABjbceZDmCs7Q+mAxhrO8F0AGNtfzIdwFjbSaYDF2sLFWM6cLG2UArTgYu1hc5iOnCxtlAq04GLtYXSmA5crC3kYTpwsbaQl+nAxdpC6UwHLtYWymA6cLG2UCbTgYu1hXxMBy7WFvIzHbhYWyjAdOBibaEspgMXawtlMx24WFsoyHTgYm2hENOBi7WFwkwHLtYWijAduFhbKMp04GJtoRymAxdrC8WYDlysLRRnOnCxtlCC6cDF2kLFmQ5crC1UgunAxdpCZzMduFhbqCTTgYu1hc5hOnCxtlAppgMXawuVZjpwsbZQGaYDF2sLlWU6cLG2UDmmAxdrC53LdOBibaHyTAcu1hY6j+nAxdpCFZgOXKwtdD7TgYu1hSoyHbhYW6gS04GLtYUqMx24WFvoAqYDF2sLVWE6cLG20IVMBy7WFqrKdOBibaGLmA5crC1UjenAxdpC1ZkOXKwtVIPpwMXaQjWZDlysLVSL6cDF2kK1mQ5crC1Uh+nAxdpCdZkOXKwtVI/pwMXaQvUNjtNjbRf8FWs7JsHfJXhcgn9I8IQE/5TgSQkVk9CpH6BKKFVCaRLySMgroXQJZUgoU0I+CfklFJBQloSyJRTU1r12vbVhrL1WbVNqh0+bY9pX0paMdjO0EaDP0PXxsz651Yee+rxQH7XpUyp9wKPPRvSxgt6R682s3gfqLZTefeiFu17z6uWiXmnpRYp+v+tXo36r6AlZz2V6GtBPkB58+r4p+X9pZ7eYNX/2m21nt98KDOOFGhTpcLsAmyzDxY1MjqIny0IXWya3JMtSLMmylDNKloUuzjdZDKGPvNcbd2vfoWvjnv2v6tujQ5P23brlTbuxUctmTQvyZrTp0qdHp9xcHafsGZWZHTMdt9k5JswlIMwlZYv+ac08KL761hca35xLi3j82go9ZC30kLnQyxycMMzfT7hcX+hypgOX6wtdwXTgcn2hRkwHLtcXasx04HJ9oSZMBy7XF7qS6cDl+kJNmQ5gru8qpgOY62vGdABzfc2ZDmCurwXTAcz1Xc10AHN91zAdwFzftUwHMNd3HdMBzPW1ZDqAub7rmQ5grq8V0wHM9d3AdABzfTcyHcBcX2umA5jru4npAOb6bmY6gLm+W5gOYK6vDdMBzPW1ZTqAub5bmQ5gru82pgOY67ud6QDm+u5gOoC5vnZMBzDXdyfTAcz13cV0AHN9dzMdwFxfe6YDmOu7h+kA5vo6MB3AXF9HpgOY6+vEdABzffcyHcBcX2emA5jru4/pAOb6ujAdwFzf/UwHMNfXlekA5vq6MR3AXF93pgOY6+vBdABzfT2ZDmCurxfTAcz1PcB0AHN9vZkOYK4vl+kA5vr6MB3AXF9fpgOY63uQ6QDm+voxHcBcX3+mA5jrG8B0AHN9DzEdwFzfQKYDmOt7mOkA5voGMR3AXN8jBse/glanUj+GXJvlVaHkzxNTziTl9ahFDkt5nUGQx1dfsnqbXnixZEfzTWjDM8282Y17d+nWrUvnU+GpMen5edNbd+nRuVsn27FiCFX8NWL3Xt06SegxU7KwyMmzBjqy7cAeknzRzmT2IaOLeECYY3+XmN7nUi8V9QM7xrJcwTdNB9njphLHmz5ZL53B4ZFs7ov1DbLEEi82aYe6eKtDj+vAto/0E4b5LaHIJ8qewSk8NNT0qmFFPYUjD8cn/0sPx2JnFAQPNTQdFYP1a8t2VAx3VWietdA8W6FPFfUbKW0M/BupaAPWQw+oh2gRhrSc4S5JtZzfUg2vMUSuR1uVZ3KmTCZteOoUZJvddDiOKOrhmFFQ1Dc7yRF/8uTJb/4Z8j9fSKSc+q+Cf66nnv7nnyNtl1aWb4anbS8bWfb/fRmebH5djf/8thQc/OtVT5vevJGGlS3y7s+hoTr9aBen01MX+LnGC3xfI9vp9BlXhfaxFtrYVugoV4X2tRbaxFaos7f+QWuhV9oKzXdVaD9roU1thRa4KrS/tdCrbIUWuip0gLXQZrZCx7gq9CFroc1thY51VehAa6EtbIU+66rQh62FXm0rdJyrQgdZC73GVuhzrgp9xFrotbZCx7sqdLC10OtshT7vqtBHrYW2tBU6wVWhedZCr7cV+oKrQh+zFtrKVuhEV4UOsRZ6g63QF10V+ri10BtthU5yVehQa6GtbYVOdlXoE9ZCb7IVOsVVocOshd5sK/QlV4U+aS30FluhU10VOtxaaBtboS+7KvQpa6FtbYVOc1XoCGuht9oKne6q0Kethd5mK3SGq0JHWgu93VboK64KfcZa6B22Qme6KnSUtdB2tkJnuSp0tLXQO22FznZVaL610Ltshb7qqtACa6F32wqd46rQQmuh7W2Fvuaq0DHWQu+xFTrXVaFjrYV2sBX6uqtCn7UW2tFW6DxXhY6zFtrJVugbrgp9zlrovbZC57sqdLy10M62Qt90Vejz1kLvsxW6wFWhE6yFdrEVutBVoS9YC73fVugiV4VOtBba1VboYleFvmgttJut0CWuCp1kLbS7rdC3XBU62VpoD1uhS10VOsVaaE9boW+7KvQla6G9bIUuc1XoVGuhD9gKfcdVoS9bC+1tK3S5q0KnWQvNtRX6rqtCp1sL7WMrdIWrQmdYC+1rK/Q9V4W+Yi30QVuhK10VOtNaaD9boe+7KnSWtdD+tkJXuSp0trXQAbZCP3BV6KvWQh+yFbraVaFzrIUOtBX6oatCX7MW+rCt0DWuCp1rLXSQrdCPXBX6urXQR2yFrnVV6DxroYNthX7sqtA3rIUaf44vrgqdby3U+HP8T1wV+qa10Mdsha5zVegCa6FDbIV+6qrQhdZCH7cVut5VoYushRoTT5+5KnSxtdAnbIVucFXoEmuhw2yFfu6q0LeshT5pK3Sjq0KXWgsdbiv0C1eFvm0t9ClboZtcFbrMWugIW6Ffuir0HWuhT9sK3eyq0OXWQkfaCv3KVaHvWgt9xlboFleFrrAWOspW6FZXhb5nLXS0rdBtrgpdaS0031bo164Kfd9aaIGt0O2uCl1lLbTQVug3rgr9wFroGFuhO1wVutpa6Fhbod+6KvRDa6HP2grd6arQNdZCx9kK/c5VoR9ZC33OVuguV4WutRY63lbo964K/dha6PO2Qne7KlSshU6wFbrHVaGfWAt9wVboXleFrrMWOtFW6A+uCv3UWuiLtkL3uSp0vbXQSbZCf3RV6GfWQifbCt3vqtAN1kKn2Ar9yVWhn1sLfclW6AFXhW60FjrVVuhBV4V+YS30ZVuhh1wVusla6DRboT+7KvRLa6HTbYUedlXoZmuhM2yF/uKq0K+shb5iK/SIq0K3WAudaSv0V1eFbrUWOstW6FFXhW6zFjrbVuhvrgr92lroq7ZCj7kqdLu10Dm2Qn93Veg31kJfsxV63FWhO6yFzrUV+oerQr+1Fvq6rdATrgrdaS10nq3QP10V+p210DdshZ50Vegua6HzTYWGi7kq9HtroW/aCk1xVehua6ELbIWe5arQPdZCF9oKTXVV6F5roYtshaa5KvQHa6GLbYV6XBW6z1roEluhXleF/mgt9C1boemuCt1vLXSprdAMV4X+ZC30bVuhma4KPWAtdJmtUJ+rQg9aC33HVqjfVaGHrIUutxUacFXoz9ZC37UVmuWq0MPWQlfYCs12Vegv1kLfsxUadFXoEWuhK22FhlwV+qu10PdthYZdFXrUWugqW6ERV4X+Zi30A1uhUVeFHrMWutpWaI6rQn+3FvqhrdCYq0KPWwtdYys07qrQP6yFfmQrNOGq0BPWQtfaCi3uqtA/rYV+bCu0hKtCT1oLFVuhZzsqNLuYtdBPbIWWdFVoirXQdbZCz3FV6FnWQj+1FVrKVaGp1kLX2wot7arQNGuhn9kKLeOqUI+10A22Qsu6KtRrLfRzW6HlXBWabi10o63Qc10VmmEt9AtboeVdFZppLXSTrdDzXBXqsxb6pa3QCq4K9VsL3Wwr9HxXhQashX5lK7Siq0KzrIVusRVayVWh2dZCt9oKreyq0KC10G22Qi9wVWjIWujXtkKruCo0bC10u63QC10VGrEW+o2t0KqWQv/eaLdFjy59CqtsLTZZQs9IaJSERksoX0IFEiqU0BgJjZXQsxIaJ6HnJDReQs9LaIKEXpDQRAm9KKFJEtL/4RQJvSShqRJ6WULTJDRdQjMk9IqEZkpoloRmS+hVCc2R0GsSmiuh1yU0T0JvSGi+hN6U0AIJLZTQIgktltASCb0loaUSeltCyyT0joSWS+hdCa2Q0HsSWimh9yW0SkIfSGi1hD6U0BoJfSShtRL6WEIioU8ktE5Cn0povYQ+k9AGCX0uoY0S+kJCmyT0pYQ2S+grCW2R0FYJbZPQ1xLaLqFvJLRDQt9KaKeEvpPQLgl9L6HdEtojob0S+kFC+yT0o4T2S+gnCR2Q0EEJHZLQzxI6LKFfJHREQr9K6KiEfpPQMQn9LqHjEvpDQick9Ke2+bWBrq1pbfpqO1UbldoC1Oaatq20IaStFm1iaHtAH7zrI219WKyPYfUBpz461Idy+rhLHyTpIxp9+KGPFfSGXW+F9SZTb9/0xkhvOfRiXi+T9QJUL+30okkvR/SLXr9C9ctJT/t6QtVTlZ4E9OOlB64eEtP/fr//dYAa/kCv568dv2zp2fBFhuPunw2eq0A3eLZMbh2qmoMPeoqETv0V9GSL2NC602m4ehE/5Bf+94f8/8gPeYHhqDv1IQ9Xs3wLnXph9QLbp8h0GNco0jnjQtM5I4VwzqhRxHOG/dwL3NAzXNPBapuXqCZuqFpER1pVnKM201EH56jDdNTDOeoyHQ1wjnpMR0Ocoz7TcSnO0YDpuBznuJjpaIRzNGQ6muAclzAdTXGOS5mOZjjHZUxHC5zjcqbjGpzjCqbjOpyjEdNxPc7RmOm4AedownS0xjmuZDpuxjmaMh1tcI6rmI5bcY5mTMftOEdzpqMdztGC6bgL57ia6WiPc1zDdHTAOa5lOjrhHNcxHZ1xjpZMRxec43qmoyvO0Yrp6I5z3MB09MQ5bmQ6HsA5WjMduTjHTUxHX5zjZqajH85xC9MxAOdow3QMxDnaMh2DcI5bmY7BOMdtTEceznE70zEE57iD6RiKc7RjOobhHHcyHcNxjruYjhE4x91Mx0icoz3TMQrnuIfpyMc5OjAdhThHR6ZjLM7RiekYh3Pcy3SMxzk6Mx0TcI77mI6JOEcXpmMSznE/0zEF5+jKdEzFOboxHdNwju5MxwycowfTMRPn6Ml0zMY5ejEdc3COB5iOuThHb6ZjHs6Ry3TMxzn6MB0LcI6+TMcinONBpmMJztGP6ViKc/RnOpbhHAOYjuU4x0NMxwqcYyDTsRLneJjpWIVzDGI6VuMcjzAda3COwUzHWpzjUaZDcI48pmMdzvEY07Ee5xjCdGzAOR5nOjbiHEOZjk04xxNMx2acYxjTsQXneJLp2IZzDGc6tuMcTzEdO3COEUzHTpzjaaZjF84xkunYjXM8w3TsxTlGMR37cI7RTMd+nCOf6TiAcxQwHYdwjkKm4zDOMYbpOIJzjGU6juIczzIdx3COcUzHcZzjOabjBM4xnuk4iXM8T3R4UnCOCUxHKs7xAtPhwTkmMh3pOMeLTEcmzjGJ6fDjHJOZjiycYwrTEcQ5XmI6wjjHVKYjinO8zHTEcI5pTEcC55jOdJTAOWYwHSVxjleYjlI4x0ymowzOMYvpKIdzzGY6yuMcrzIdFXCOOUxHRZzjNaajMs4xl+mognO8znQA92mYx3RUwzneYDpq4BzzmY5aOMebTAdw/48FTAdw/4+FTAdw/49FTAdw/4/FTAdw/48lTAdw/4+3mA7g/h9LmQ7g/h9vMx3A/T+WMR3A/T/eYTqA+38sZzqA+3+8y3QA9/9YwXQA9/94j+kA7v+xkukA7v/xPtMB3P9jFdMB3P/jA6YDuP/HaqYDuP/Hh0wHcP+PNUwHcP+Pj5gO4P4fa5kO4P4fHzMdwP0/hOkA7v/xCdMB3P9jHdMB3P/jU6YDuP/HeqYDuP/HZ0wHcP8PQwQ8b9bfjhY9uvQprLq12GQJ15ZwHQnXlXA9CdeXcAMJXyzhhhK+RMKXSvgyCV8u4Ssk3EjCjSXcRMJXSriphK+ScDMJN5dwCwlfLeFrJHythK+TcEsJXy/hVhK+QcI3Sri1hG+S8M0SvkXCbSTcVsK3Svg2Cd8u4Tsk3E7Cd0r4LgnfLeH2Er5Hwh0k3FHCnSR8r4Q7S/g+CXeR8P0S7irhbhLuLuEeEu4p4V4SfkDCvSWcK+E+Eu4r4Qcl3E/C/SU8QMIPSXighB+W8CAJPyLhwRJ+VMJ5En5MwkMk/LiEh0r4CQkPk/CTEh4u4ackPELCT0t4pISfkfAoCY+WcL6ECyRcKOExEh4r4WclPE7Cz0l4vISfl/AECb8g4YkSflHCkySsyzhFwi9JeKqEX5bwNAlPl/AMCb8i4ZkSniXh2RJ+VRvq2ovWNq52QLV5qH03bVlpt0cbJdpj0Mfz+mRbHwrr81R9FKlP8fQBmD470scu+sRCb/b1PllvMfXuTG9s9J5AL6f1SlQv4vT6Ry8d9FtXv7D0XK+nST3D6IdTj2s9JKb//X7nzWqUm9upd5/bOvXuWViQPCiU0kBCQ/Vl1Tu27L2jxuTKi1s1XZiX17ZdpVp7mg9Y0iu/yY4jhQf1dfoqCdcqMB2etQoM44U/L9KHsarpw5hi/QTVxH0YLY7T35T85G+K59Rqh54yrPZZ+krTam90sNrmJQL+qYcvzmC1k61O6iWFhrlTDa+5xPRebCK+F2nAn0V8yXQA29ebmQ5g+/orpgPYvt7CdADb11uZDmD7ehvTAWxff810ANvX25kOYPv6G6YD2L7ewXQA29ffMh3A9vVOpgPYvv6O6QC2r3cxHcD29fdMB7B9vZvpALav9zAdwPb1XqYD2L7+gekAtq/3MR3A9vWPTAewfb2f6QC2r39iOoDt6wNMB7B9fZDpALavDzEdwPb1z0wHsH19mOkAtq9/YTqA7esjTAewff0r0wFsXx9lOnJxjt+Yjr44xzGmox/O8TvTMQDnOM50DMQ5/mA6BuEcJ5iOwTjHn0xHHs5xkukYAhsqUozpGIpzpDAdw3COs5iO4ThHKtMxAudIYzpG4hwepmMUzuFlOvJxjnSmoxDnyGA6xuIcmUzHOJzDx3SMxzn8TMcEnCPAdEzEObKYjkk4RzbTMQXnCDIdU3GOENMxDecIMx0zcI4I0zET54gyHbNxjhymYw7OEWM65uIccaZjHs6RYDrm4xzFmY4FOEcJpmMRznE207EE5yjJdCzFOc5hOpbhHKWYjuU4R2mmYwXOUYbpWIlzlGU6VuEc5ZiO1TjHuUzHGpyjPNOxFuc4j+kQnKMC07EO5zif6ViPc1RkOjbgHJWYDtzfNIhUZjo24RwXMB2bcY4qTMcWnONCpmMbzlGV6diOc1zEdOzAOaoxHTtxjupMxy6cowbTsRvnqMl07MU5ajEd+3CO2kzHfpyjDtNxAOeoy3QcwjnqMR2HcY76TMcRnKMB03EU57iY6TiGczRkOo7jHJcwHSdwjkuZjpM4x2VEhycF57ic6UjFOa5gOjw4RyOmIx3naMx0ZOIcTZgOP85xJdORhXM0ZTqCOMdVTEcY52jGdERxjuZMRwznaMF0JHCOq5mOEjjHNUxHSZzjWqajFM5xHdNRBudoyXSUwzmuZzrK4xytmI4KOMcNTEdFnONGpqMyztGa6aiCc9zEdOD2aYjczHRUwzluYTpq4BxtmI5aOEdbpgO3/0fkVqYDt/9H5DamA7f/R+R2pgO3/0fkDqYDt/9HpB3Tgdv/I3In04Hb/yNyF9OB2/8jcjfTgdv/I9Ke6cDt/xG5h+nA7f8R6cB04Pb/iHRkOnD7f0Q6MR24/T8i9zIduP0/Ip2ZDtz+H5H7mA7c/h+RLkwHbv+PyP1MB27/j0hXpgO3/0ekG9OB2/8j0p3pwO3/EenBdOD2/4j0ZDpw+39EejEduP0/Ig8wHbj9PyK9mQ7c/h+RXKYDt/9HpA/Tgdv/I9KX6cDt/xF5kOnA7f8RMWz5kDfrb0eLHl36FF60tdhkCX8p4c0S/krCWyS8VcLbJPy1hLdL+BsJ75DwtxLeKeHvJLxLwt9LeLeE90h4r4R/kPA+Cf8o4f0S/knCByR8UMKHJPyzhA9L+BcJH5HwrxI+KuHfJHxMwr9L+LiE/5DwCQn/KeGTEikmkVN/G1wiqRJJk4hHIl6JpEskQyKZEvFJxC+RgESyJJItkaBEQhIJSyQikahEciQSk0hcIgmJFJdICYmcLZGSEjlHIqUkUloiZSRSViLlJHKuRMpL5DyJVJDI+RKpKJFKEqkskQskUkUiF0qkqkQukkg1iVSXSA2J1JRILYnUlkgdidSVSD2J1JdIA4lcLJGGErlEIpdK5DKJXC6RKyTSSCKNJdJEIldKpKlErpJIM4k0l0gLiVwtkWskcq1ErpNIS4lcL5FW2lDXXrS2cbUDqs1D7btpy0q7Pdoo0R6DPp7XJ9v6UFifp+qjSH2Kpw/A9NmRPnbRJxZ6s6/3yXqLqXdnemOj9wR6Oa1XonoRp9c/eumg37r6haXnej1N6hlGP5x6XOshMf3v9ztvVqPc3E69+9zWqXfPwoLC98tW79iy944akysvbtV0YV5e23aVau1pPmBJr/wmO44UHtQDRUJDJfxFoeGwO/XCTQWWAzT8RYFh4kj/In0cLzJ9HFOMn6Ew8M8PWBynvy35yVfbc2q1Q08ZVjtVX2la7QEOVtu8RLjNXSIPER1pwB8VDGQ6gM3fh5kOYPN3ENMBbP4+wnQAm7+DmQ5g8/dRpgPY/M1jOoDN38eYDmDzdwjTAWz+Ps50AJu/Q5kOYPP3CaYD2PwdxnQAm79PMh3A5u9wpgPY/H2K6QA2f0cwHcDm79NMB7D5O5LpADZ/n2E6gM3fUUwHsPk7mukANn/zmQ5g87eA6QA2fwuZDmDzdwzTAWz+jmU6gM3fZ5kOYPN3HNMBbP4+x3QAm7/jmQ5g8/d5piMX55jAdPTFOV5gOvrhHBOZDmB/8EWmYyDOMYnpGIRzTGY6BuMcU5iOPJzjJaZjCM4xlekYinO8zHQMwzmmMR3DcY7pTMcInGMG0zES53iF6RiFc8xkOvJxjllMRyHOMZvpGItzvMp0jMM55jAd43GO15iOCTjHXKZjIs7xOtMxCeeYx3RMwTneYDqm4hzzmY5pOMebTMcMnGMB0zET51jIdMzGORYxHXNwjsVMx1ycYwnTMQ/neIvpmI9zLGU6FuAcbzMdi3COZUzHEpzjHaZjKc6xnOlYhnO8y3QsxzlWMB0rcI73mI6VOMdKpmMVzvE+07Ea51jFdKzBOT5gOtbiHKuZDsE5PmQ61uEca5iO9TjHR0zHBpxjLdMB/OsLHzMdm3AOYTo24xyfMB1bcI51TMc2nONTpmM7zrGe6diBc3zGdOzEOTYwHbtwjs+Zjt04x0amYy/O8QXTsQ/n2MR07Mc5vmQ6DuAcm5mOQzjHV0zHYZxjC9NxBOfYynQcxTm2MR3HcI6vmY7jOMd2puMEzvEN03ES59hBdHhScI5vmY5UnGMn0+HBOb5jOtJxjl1MRybO8T3T4cc5djMdWTjHHqYjiHPsZTrCOMcPTEcU59jHdMRwjh+ZjgTOsZ/pKIFz/MR0lMQ5DjAdpXCOg0xHGZzjENNRDuf4mekoj3McZjoq4By/MB0VcY4jTEdlnONXpqMKznGU6QDu0/Ab01EN5zjGdNTAOX5nOmrhHMeZDuD+H38wHcD9P04wHcD9P/5kOoD7f5xkOnD7f0SLMR24/T+iKUwHbv+P6FlMB27/j2gq04Hb/yOaxnTg9v+IepgO3P4fUS/Tgdv/I5rOdOD2/4hmMB24/T+imUwHbv+PqI/pwO3/EfUzHbj9P6IBpgO3/0c0i+nA7f8RzWY6cPt/RINMB27/j2iI6cDt/xENMx24/T+iEaYDt/9HNMp04Pb/iOYwHbj9P6IxpgO3/0c0znTg9v+IJpgO3P4f0eJMB27/j2gJpgO3/0f0bINj1t+OFj269CmstrXYZIkMlMjDEhkkkUckMlgij0okTyKPSWSIRB6XyFCJPCGRYRJ5UiLDJfKUREZI5GmJjJTIMxIZJZHREsmXSIFECiUyRiJjJfKsRMZJ5DmJjJfI8xKZIJEXJDJRIi9KZJJEdMYpEnlJIlMl8rJEpklkukRmSOQVicyUyCyJzJbIqxKZI5HXJDJXIq9LZJ5E3pDIfIm8KZEFElkokUUSWSyRJRJ5SyJLJfK2RJZJ5B2JLJfIuxJZIZH3JLJSIu9LZJVEPpDIaol8KJE1EvlIImsl8rFERCKfSGSdRD6VyHqJfCaRDRL5XCIbJfKFRDZJ5EuJbJbIVxLZIpGtEtkmka8lsl0i30hkh0S+lchOiXwnkV0S+V4iuyWyRyJ7JfKDRPZJ5EeJ7JfITxI5IJGDEjkkkZ8lclgb6tqL1jaudkC1eah9N21ZabdHGyXaY9DH8/pkWx8K6/NUfRSpT/H0AZg+O9LHLvrEQm/29T5ZbzH17kxvbPSeQC+n9UpUL+L0+kcvHfRbV7+w9Fyvp0k9w+iHU49rPSSm//1+581qlJvbqXef2zr17llYkPxvJafUk9BQfVn1ji1776gxufLiVk0X5uW1bVep1p7mA5b0ym+y40jhQX2dvkoiDxWYHts/VGAYL1qySB/GaqYPY4q1s4DbbMTkOP1NyU/+pnhOrXboKcNqp+krTat9joPVNi/RObihShEdabifFERLMx241m+0DNOBa/1GyzIduNZvtBzTgWv9Rs9lOoCt3/JMB7D1ex7TAWz9VmA6gK3f85kOYOu3ItMBbP1WYjqArd/KTAew9XsB0wFs/VZhOoCt3wuZDmDrtyrTAWz9XsR0AFu/1ZgOYOu3OtMBbP3WYDqArd+aTAew9VuL6QC2fmszHcDWbx2mA9j6rct0AFu/9ZgOYOu3PtMBbP02YDqArd+LmQ5g67ch0wFs/V7CdABbv5cyHbk4x2VMR1+c43Kmox/OcQXTAezGNmI6BuIcjZmOQThHE6ZjMM5xJdORh3M0ZTqG4BxXMR1DcY5mTMcwnKM50zEc52jBdIzAOa5mOkbiHNcwHaNwjmuZjnyc4zqmoxDnaMl0jMU5rmc6xuEcrZiO8TjHDUzHBJzjRqZjIs7RmumYhHPcxHRMwTluZjqm4hy3MB3TcI42TMcMnKMt0zET57iV6ZiNc9zGdMzBOW5nOubiHHcwHfNwjnZMx3yc406mYwHOcRfTsQjnuJvpWIJztGc6luIc9zAdy3CODkzHcpyjI9OxAufoxHSsxDnuZTpW4RydmY7VOMd9TMcanKML07EW57if6RCcoyvTsQ7n6MZ0rMc5ujMdG3COHkzHRpyjJ9OxCefoxXRsxjkeYDq24By9mY5tOEcu07Ed5+jDdOzAOfoyHTtxjgeZjl04Rz+mYzfO0Z/p2ItzDGA69uEcDzEd+3GOgUzHAZzjYabjEM4xiOk4jHM8wnQcwTkGMx1HcY5HmY5jOEce03Ec53iM6TiBcwxhOk7iHI8THZ4UnGMo05GKczzBdHhwjmFMRzrO8STTkYlzDGc6/DjHU0xHFs4xgukI4hxPMx1hnGMk0xHFOZ5hOmI4xyimI4FzjGY6SuAc+UxHSZyjgOkohXMUMh1lcI4xTEc5nGMs01Ee53iW6aiAc4xjOiriHM8xHZVxjvFMRxWc43mmA7hPwwSmoxrO8QLTUQPnmMh01MI5XmQ6gPt/TGI6gPt/TGY6gPt/TGE6gPt/vMR0APf/mMp0APf/eJnpAO7/MY3pAO7/MZ3pAO7/MYPpAO7/8QrTAdz/YybTAdz/YxbTAdz/YzbTAdz/41WmA7j/xxymA7j/x2tMB3D/j7lMB3D/j9eZDuD+H/OYDuD+H28wHcD9P+YzHcD9P95kOoD7fyxgOoD7fyxkOoD7fyxiOoD7fyxmOoD7fyxhOoD7f7zFdAD3/1jKdAD3/3ib6QDu/2H40zR5s/52tOjRpU9h9a3FJku0tETLSLSsRMtJ9FyJlpfoeRKtINHzJVpRopUkWlmiF0i0ikQvlGhViV4k0WoSrS7RGhKtKdFaEq0t0ToSrSvRehKtL9EGEr1Yog0leolEL5XoZRK9XKJXSLSRRBtLtIlEr5RoU4leJdFmEm0u0RYSvVqi10j0WoleJ9GWEr1eoq0keoNEb5Roa4neJNGbJXqLRNtItK1Eb5XobRK9XaJ3SLSdRO+U6F0SvVui7SV6j0Q7SLSjRDtJ9F6JdpbofRLtItH7JdpVot0k2l2iPSTaU6K9JPqARHtLNFeifSTaV6IPSrSfRPtLdIBEH5LoQIk+LNFBEn1EooMl+qhE8yT6mESHSPRxiQ6V6BMSHSbRJyU6XKJPSXSERJ+W6EiJPiPRURIdLdF8iRZItFCiYyQ6VqLPakNde9HaxtUOqDYPte+mLSvt9mijRHsM+nhen2zrQ2F9nqqPIvUpnj4A02dH+thFn1jozb7eJ+stpt6d6Y2N3hPo5bReiepFnF7/6KWDfuvqF5ae6/U0qWcY/XDqca2HxPS/3++8WY1yczv17nNbp949CwsKDUdTaKiEntQXVu/YsveOGpMrL27VdGFeXtt2lWrtaT5gSa/8JjuOFB7UV556YbRUgekALVVgGC/6TpE+jtVNH8cU62foHNzH0eI4/W3Jt74tT5lWOzTUtNqGvwOV93rjbu07dG3cs/9VfXt0aNK+W7e8aTc2atmsaUHejDZd+vTolKsfouVli/ymmLMawJ79uw4OLrMD2FtdwXQAe6vvMR3A3upKpgPYW32f6QD2VlcxHcDe6gdMB7C3uprpAPZWP2Q6gL3VNUwHsLf6EdMB7K2uZTqAvdWPmQ5gb1WYDmBv9ROmA9hbXcd0AHurnzIdwN7qeqYD2Fv9jOkA9lY3MB3A3urnTAewt7qR6QD2Vr9gOoC91U1MB7C3+iXTAeytbmY6gL3Vr5gOYG91C9MB7K1uZTqAvdVtTAewt/o10wHsrW5nOnJxjm+Yjr44xw6mox/O8S3TMQDn2Ml0DMQ5vmM6BuEcu5iOwTjH90xHHs6xm+kYgnPsYTqG4hx7mY5hOMcPTMdwnGMf0zEC5/iR6RiJc+xnOkbhHD8xHfk4xwGmoxDnOMh0jMU5DjEd43COn5mO8TjHYaZjAs7xC9MxEec4wnRMwjl+ZTqm4BxHmY6pOMdvTMc0nOMY0zED5/id6ZiJcxxnOmbjHH8wHXNwjhNMx1yc40+mYx7OcZLpmA8bKqcY07EA50hhOhbhHGcxHUtwjlSmYynOkcZ0LMM5PEzHcpzDy3SswDnSmY6VOEcG07EK58hkOlbjHD6mYw3O4Wc61uIcAaZDcI4spmMdzpHNdKzHOYJMxwacI8R0bMQ5wkzHJpwjwnRsxjmiTMcWnCOH6diGc8SYju04R5zp2IFzJJiOnThHcaZjF85RgunYjXOczXTsxTlKMh37cI5zmI79OEcppuMAzlGa6TiEc5RhOg7jHGWZjiM4Rzmm4yjOcS7TcQznKM90HMc5zmM6TuAcFZiOkzjH+USHJwXnqMh0pOIclZgOD85RmelIxzkuYDoycY4qTIcf57iQ6cjCOaoyHUGc4yKmI4xzVGM6ojhHdaYjhnPUYDoSOEdNpqMEzlGL6SiJc9RmOkrhHHWYjjI4R12moxzOUY/pKI9z1Gc6KuAcDZiOijjHxUxHZZyjIdNRBee4hOnA7dOQcynTUQ3nuIzpqIFzXM501MI5rmA6cPt/5DRiOnD7f+Q0Zjpw+3/kNGE6cPt/5FzJdOD2/8hpynTg9v/IuYrpwO3/kdOM6cDt/5HTnOnA7f+R04LpwO3/kXM104Hb/yPnGqYDt/9HzrVMB27/j5zrmA7c/h85LZkO3P4fOdczHbj9P3JaMR24/T9ybmA6cPt/5NzIdOD2/8hpzXTg9v/IuYnpwO3/kXMz04Hb/yPnFqYDt/9HThumA7f/R05bpgO3/0fOrUwHbv+PnNuYDtz+Hzm3Mx24/T9y7mA6cPt/5LRjOnD7f+TcyXTg9v/IMXyl/msz9wLzZu6mFw7TF54qNOl+7jl3F7FQy67zF0toSKFh9ostFYaGmBzJv/tTiuxoqMMaDq+82Y17d+nWrUvnU1vdj/GMzZveukuPzt062Y4VS2e/SAPWRw9YrwgDmo/jJ6zH8ZOj0R4JG/4gQMGpMbv36tZJcu75558drJ9/w6Vo3uuNu7Xv0LVxz/5X9e3R4dSxkzftxkYtmzUtyJvRpkufHp1yc3Xusv8+ujIKir7Uw61LPTzJUp88efK3f5b6P7845dR/nbaIHf/5ZyfLSTvFtDwdbS/rVLbIn/2/V850Di19xME59O83xDb/r0Wcf/SY/zxswcG/juGOphNvJ8vnofQR06t+NRx//+NCGr4alDK6iEtUYBk5O0eyS1jeS31h6PICyxJklzAt+r2uOGdbOVfYOGebOJ1dcUpaOY1snJImzn2uOOdYOY1tnHNMnC6uOKWsnCY2TikT535XnNJWzpU2TmkTp6srThkrp6mNU8bE6eaKU9bKucrGKWvidHfFKWflNLNxypk4PVxxzrVymts455o4PV1xyls5LWyc8iZOL1ec86ycq22c80ycB1xxKlg519g4FUyc3q4451s519o455s4ua44Fa2c62yciiZOH1ecSlZOSxunkonT1xWnspVzvY1T2cR50BXnAiunlY1zgYnTzxWnipVzg41TxcTp74pzoZVzo41zoYkzwBWnqpXT2sapauI85IpzkZVzk41zkYkz0BWnmpVzs41TzcR52BWnupVzi41T3cQZ5IpTw8ppY+PUMHEeccWpaeW0tXFqmjiDXXFqWTm32ji1TJxHXXFqWzm32Ti1TZw8V5w6Vs7tNk4dE+cxV5y6Vs4dNk5dE2eIK049K6edjVPPxHncFae+lXOnjVPfxBnqitPAyrnLxmlg4jzhinOxlXO3jWP6CUfOMFechlZOexunoYnzpCvOJVbOPTbOJSbOcFecS62cDjbOpSbOU644l1k5HW2cy0ycEa44l1s5nWycy02cp11xrrBy7rVxrjBxRrriNLJyOts4jUycZ1xxGls599k4jU2cUa44TaycLjZOExPH2Y9YrrRy7rdxrjRx8l1xmlo5XW2cpiZOgSvOVVZONxvnKhOn0BWnmZXT3cZpZuKMccVpbuX0sHGamzhjXXFaWDk9bZwWJs6zrjhXWzm9bJyrTZxxrjjXWDkP2DjXmDjPueJca+X0tnGuNXHGu+JcZ+Xk2jjXmTjPu+K0tHL62DgtTZwJrjjXWzl9bZzrTZwXXHFaWTkP2jitTJyJrjg3WDn9bJwbTJwXXXFutHL62zg3mjiTXHFaWzkDbJzWJs5kV5ybrJyHbJybTJwprjg3WzkDbZybTZyXXHFusXIetnFuMXGmuuK0sXIG2ThtTJyXXXHaWjmP2DhtTZxpFs7fueAWPbr0KayxtdgVknOv5HSWnPskp4vk3C85XSWnm+R0l5wektNTcnpJzgOS01tyciWnj+T0lZwHJaef5PSXnAGS85DkDJSchyVnkOQ8oq1zbTdri1bbmtoK1PaZtpy0TaOtDW0H6CN0feysj2r18aY+EtTHaProSR/X6CMOfSygt9J6+6m3bHqbo7cGejmtl6B62aaXOnp5oF+p+jWkp2493ekpQj9Weijq26fk6X97/h3dKjQt1/TkS59hCmVlFD1dZkq3nQplTbcllGcY5v8nEl4DGgm3TG4d6pUiHsI1/zc9hC251VMHiOWEdOoweqXAtvymg21mkQ62mqaDLYVwsM0s4ofWeF6Z9V96Xkk5s/PKLNt5ZbaDt9r8/szGDfUq0ZEG/BPuc5gO4J/afo3pAP6p7blMB/BPbb/OdAD/1PY8pgP4p7bfYDqAf2p7PtMB/FPbbzIdwD+1vYDpAP6p7YVMB/BPbS9iOoB/ansx0wH8U9tLmA7gn9p+i+kA/qntpUwH8E9tv810tMY5ljEdwD+1/Q7TAfxT28uZDuCf2n6X6QD+qe0VTAfwT22/x3QA/9T2SqYD+Ke232c6gH9qexXTAfxT2x8wHcA/tb2a6QD+qe0PmQ7gn9pew3QA/9T2R0wH8E9tr2U6gH9q+2OmIxfnEKajL87xCdPRD+dYx3QMwDk+ZToG4hzrmY5BOMdnTMdgnGMD05GHc3zOdAzBOTYyHUNxji+YjmE4xyamYzjO8SXTMQLn2Mx0jMQ5vmI6RuEcW5iOfJxjK9NRiHNsYzrG4hxfMx3jcI7tTMd4nOMbpmMCzrGD6ZiIc3zLdEzCOXYyHVNwju+Yjqk4xy6mYxrO8T3TAYwA7GY6ZuIce5gO4O/09zIdc3COH5iOuTjHPqZjHs7xo8Fxeq6s1l+5sjmS85rkzJWc1yVnnuS8ITnzJedNyVkgOQslZ5HkLJacJZLzluQslZy3JWeZ5LwjOcsl513JWSE570nOSm3da9dbG8baa9U2pXb4tDmmfSVtyWg3QxsB+gxdHz/rk1t96KnPC/VRmz6l0gc8+mxEHyvoHbnezOp9oN5C6d2HXrjrNa9eLuqVll6k6Pe7fjXqt4qekPVcpqcB/QTpwafvm5LPNFfWoAi5sldtubJXCyzj7S/SwVYLmysDnsQsjjPIlf2UfHJgruysM8uV/ZRvshxw8Fab358DuKEOEh3IXNkhpgOYK/uZ6QDmyg4zHcBc2S9MBzBXdoTpAObKfmU6gLmyo0wHMFf2G9MBzJUdYzqAubLfmQ5gruw40wHMlf3BdABzZSeYDmCu7E+mA5grO8l04HJlsWJMBy5XFkthOnC5sthZTAcuVxZLZTpwubJYGtOBy5XFPEwHLlcW8zIduFxZLJ3pwOXKYhlMBy5XFstkOnC5spiP6cDlymJ+pgOXK4sFmA5criyWxXTgcmWxbKYDlyuLBZkOXK4sFmI6cLmyWJjpwOXKYhGmA5cri0WZDlyuLJbDdOByZbEY04HLlcXiTAcuVxZLMB24XFmsONOBy5XFSjAduFxZ7GymA5cri5VkOnC5stg5TAcuVxYrxXTgcmWx0kwHLlcWK8N04HJlsbJMBy5XFivHdOByZbFzmQ5crixWnunA5cpi5zEduFxZrALTgcuVxc5nOnC5slhFpgOXK4tVYjpwubJYZaYDlyuLXcB04HJlsSpMBy5XFruQ6cBFMmJVmQ5crix2EdOBy5XFqjEduFxZrLrBcXqurPZfubJDkvOz5ByWnF8k54jk/Co5RyXnN8k5Jjm/S85xyflDck5Izp+Sc1JixSR26odFEkuVWJrEPBLzSixdW/fa9daGsfZatU2pHT5tjmlfSVsy2s3QRoA+Q9fHz/rkVh966vNCfdSmT6n0AY8+G9HHCnpHrjezeh+ot1B696EX7nrNq5eLeqWlFyn6/a5fjfqtoidkPZfpaUA/QXrw6fum5DPNldUvQq7soC1XdrDAMF6sRpEOttrYXBkubGRyFD1XFquZfHJgriz1jHJlsZr5JkstB2+1+f2phRuqNtEBzJXF6jAduFxZrC7TgcuVxeoxHbhcWaw+04HLlcUaMB24XFnsYqYDlyuLNWQ6cLmy2CVMBy5XFruU6cDlymKXMR24XFnscqYDlyuLXcF04HJlsUZMBy5XFmvMdOByZbEmTAcwV3Yl0wHMlTVlOoC5squYDmCurBnTAcyVNWc6gLmyFkwHMFd2NdMBzJVdw3QAc2XXMh3AXNl1TAcwV9aS6QDmyq5nOoC5slZMBzBXdgPTAcyV3ch0AHNlrZkOYK7sJqYDmCu7mekA5spuYTqAubI2TAcwV9aW6QDmym5lOoC5stuYDmCu7HamA5gru4PpAObK2jEdwFzZnUwHMFd2F9MBzJXdzXQAc2XtmQ5gruwepgOYK+vAdABzZR2ZDmCurBPTAcyV3ct0AHNlnZkOYK7sPqYDmCvrwnQAc2X3Mx3AXFlXpgOYK+vGdABzZd2ZDmCurAfTAcyV9WQ6gLmyXkwHMFf2ANMBzJX1ZjqAubJcpgOYK+tjcJyeK6tzKlcWqyOxuhKrJ7H6EmsgsYsl1lBil0jsUoldJrHLJaavaSSxxhJrIrErJdZUYldJrJnEmkushcSultg12rrXrrc2jLXXqm1K7fBpc0z7StqS0W6GNgL0Gbo+ftYnt/rQU58X6qM2fUqlD3j02Yg+VtA7cr2Z1ftAvYXSuw+9cNdrXr1c1CstvUjR73f9atRvFT0h67lMTwP6CdKDT983JZ9prkzCm+zJslhtU7JMX2aJG/Ut0uFWB5osQ8aNLI4zSJY9mHxyYLIs7cySZQ/mmyz9HLzV5vcH2AHrT3Qgk2UDmA5gsuwhpgOYLBvIdACTZQ8zHcBk2SCmA5gse4TpACbLBjMdwGTZo0wHMFmWx3QAk2WPMR3AZNkQpgOYLHuc6QAmy4YyHcBk2RNMBzBZNozpACbLnmQ6gMmy4UwHMFn2FNMBTJaNYDqAybKnmQ5gsmwk0wFMlj3DdACTZaOYDmCybDTTAUyW5TMdwGRZAdMBTJYVMh3AZNkYpgOYLBvLdACTZc8yHcBk2TimA5gse47pACbLxjMdwGTZ80wHsK82gekAJsteYDqAybKJTAcwWfYi0wFMlk1iOoDJsslMBzBZNoXpACbLXmI6gMmyqUwHMFn2MtMBTJZNYzqAybLpTAcwWTaD6QAmy15hOoDJsplMBzBZNovpACbLZjMdwGTZq0wHMFk2h+kAJsteYzqAybK5TAcwWfY60wFMls1jOoDJsjeYDmCybD7TAUyWvcl0AJNlC5gOYLJsIdMBTJYtYjqAybLFBsfpybK6fyXLBkjsIYkNlNjDEhsksUckNlhij0osT2KPSWyIxB6X2FCJPSGxYRJ7UmLDJfaUxEZI7GmJjZTYMxIbpa177Xprw1h7rdqm1A6fNse0r6QtGe1maCNAn6Hr42d9cqsPPfV5oT5q06dU+oBHn43oYwW9I9ebWb0P1FsovfvQC3e95tXLRb3S0osU/X7Xr0b9VtETsp7L9DSgnyA9+PR9U/KZJsvqFSFX1t+WK+tfYAkbLSnSwVYXmysDNkUsjjPIlb2VfHJgrsxzZrmyt/JNlqUO3mrz+7MUN9TbRAcyV7aM6QDmyt5hOoC5suVMBzBX9i7TAcyVrWA6gLmy95gOYK5sJdMBzJW9z3QAc2WrmA5gruwDpgOYK1vNdABzZR8yHcBc2RqmA5gr+4jpAObK1jIdwFzZx0wHMFcmTAcwV/YJ0wHMla1jOoC5sk+ZDmCubD3TAcyVfcZ0AHNlG5gOYK7sc6YDmCvbyHQAc2VfMB3AXNkmpgOYK/uS6QDmyjYzHcBc2VdMBzBXtoXpAObKtjIdwFzZNqYDmCv7mukAtlC3Mx3AXNk3TAcwV7aD6QDmyr5lOoC5sp1MBzBX9h3TAcyV7WI6gLmy75kOYK5sN9MBzJXtYTqAubK9TAcwV/YD0wHMle1jOoC5sh+ZDmCubD/TAcyV/cR0AHNlB5gOYK7sINMBzJUdYjqAubKfmQ5gruww0wHMlf3CdABzZUeYDmCu7FemA5grO8p0AHNlvzEdwFzZMaYDmCv7nekA5sqOMx3AXNkfBsfpubJ6f+XKlknsHYktl9i7ElshsfcktlJi70tslcQ+kNhqiX0osTUS+0hiayX2scREYp9IbJ3EPpXYeol9JrEN2rrXrrc2jLXXqm1K7fBpc0z7StqS0W6GNgL0Gbo+ftYnt/rQU58X6qM2fUqlD3j02Yg+VtA7cr2Z1ftAvYXSuw+9cNdrXr1c1CstvUjR73f9atRvFT0h67lMTwP6CdKDT983JZ/xjmU57SWngzVZ9rYtWfZ2gSVudKJIh1s9bLIMGDeyOM4gWfZn8smByTLvmSXL/sw3WU46eKvN789J2FDxYkV8q02fwNBQCT1heuEwCT1pWvB4CnHBgRG4+FlMBy4CF09lOnARuHga04GLwMU9TAcuAhf3Mh24CFw8nenAReDiGUwHLgIXz2Q6cBG4uI/pwEXg4n6mAxeBiweYDlwELp7FdOAicPFspgMXgYsHmQ5cBC4eYjpwEbh4mOnAReDiEaYDF4GLR5kOXAQunsN04CJw8RjTgYvAxeNMBy4CF08wHbgIXLw404GLwMVLMB24CFz8bKYDF4GLl2Q6cBG4+DlMBy4CFy/FdOAicPHSTAcuAhcvw3TgInDxskwHLgIXL8d04CJw8XOZDlwELl6e6cBF4OLnMR24CFy8AtOBi8DFz2c6cBG4eEWmAxeBi1diOnARuHhlpgMXgYtfwHTgInDxKkwHLgIXv5DpwEXg4lWZDlwELn4R04GLwMWrMR24CFy8OtOBi8DFazAduAhcvCbTgYvAxWsxHbgIXLw204GLwMXrMB24CFy8LtOBi8DF6zEduAhcvD7TgYvAxRswHbgIXPxipgMXgYs3ZDpwEbj4JUwHLgIXv5TpwEXg4pcxHbgIXPxypgMXgYtfwXTgInBxw0+B/xWBq38qAhc/S+KpEk+TuEfiXomnSzxD4pkS90ncL/GAxLMkni3xoMRDEg9LPCLxqMRzJB6TeFziCYkX19a9dr21Yay9Vm1TaodPm2PaV9KWjHYztBGgz9D18bM+udWHnvq8UB+16VMqfcCjz0b0sYLekevNrN4H6i2U3n3ohbte8+rlol5p6UWKfr/rV6N+q+gJWc9lehrQT5AefPq+Kfl/FoGzBpniKafWNWmupswTlnX9H+a3JOvixQpN72sxS5XxxpaxTJZ/jvX62PwdMJTVuIjviS1/F2+SfHJg/i79zA7bJqbDNn6lg7fa/P5ciRuqKdGBjLVdxXQAY23NmA5grK050wGMtbVgOoCxtquZDmCs7RqmAxhru5bpAMbarmM6gLG2lkwHMNZ2PdMBjLW1YjqAsbYbmA5grO1GpgMYa2vNdABjbTcxHcBY281MBzDWdgvTAYy1tWE6gLG2tkwHMNZ2K9MBjLXdxnQAY223Mx3AWNsdTAcw1taO6QDG2u5kOoCxtruYDmCs7W6mAxhra890AGNt9zAdwFhbB6YDGGvryHQAY22dmA5grO1epgMYa+vMdABjbfcxHcBYWxemAxhru5/pAMbaujIdwFhbN6YDGGvrznQAY209mA5grK0n0wGMtfViOoCxtgeYDmCsrTfTAYy15TIdwFhbH6YDGGvry3QAY20PMh3AWFs/pgMYa+vPdABjbQOYDmCs7SGmAxhrG8h0AGNtDzMdwFjbIKYDGGt7hOkAxtoGMx3AWNujTAcw1pbHdABjbY8xHcBY2xCmAxhre5zpAMbaDI9e/hVra/BXrO0qiTeTeHOJt5D41RK/RuLXSvw6ibeU+PUSbyXxGyR+o8RbS/wmid8s8Vsk3kbibSV+q8Rvk/jtEr9DW/fa9daGsfZatU2pHT5tjmlfSVsy2s3QRoA+Q9fHz/rkVh966vNCfdSmT6n0AY8+G9HHCnpHrjezeh+ot1B696EX7nrNq5eLeqWlFyn6/a5fjfqtoidkPZfpaUA/QXrw6fum5P+lnd3usebPmpp2dtOXWeJGRUuWNYAmy5Bxo6Km/YzJsmGWyS3JshRLsizlzJJlw/JNlicNS/R6427tO3Rt3LP/VX17dGjSvlu3vGk3NmrZrGlB3ow2Xfr06JSrn4wny55RmTn3mI7bnPYmzHAQZnjZM9gF7lIJDbW+0PjmPFXE49dW6GXWQi8zFzrCwQnD/P0EzPU9zXQAc30jmQ5gru8ZpgOY6xvFdABzfaOZDmCuL5/pAOb6CpgOYK6vkOkA5vrGMB3AXN9YpgOY63uW6QDm+sYxHcBc33NMBzDXN57pAOb6nmc6gLm+CUwHMNf3AtMBzPVNZDqAub4XmQ5grm8S0wHM9U1mOoC5vilMBzDX9xLTAcz1TWU6gLm+l5kOYK5vGtMBzPVNZzqAub4ZTAcw1/cK0wHM9c1kOoC5vllMBzDXN5vpAOb6XmU6gLm+OUwHMNf3GtMBzPXNZTqAub7XmQ5grm8e0wHM9b3BdABzffOZDmCu702mA5jrW8B0AHN9C5kOYK5vEdMBzPUtZjqAub4lTAcw1/cW0wHM9S1lOoC5vreZDmCubxnTAcz1vcN0AHN9y5kOYK7vXaYDmOtbwXQAc33vMR3AXN9KpgOY63uf6QDm+lYxHcBc3wdMBzDXt5rpAOb6PmQ6gLm+NUwHMNf3EdMBzPWtNTj+FbQ6lfox5Nosr4p/nLzCM0l5iUUOS3mdSZBnqESXm144THLuzjehPzEUOrtx7y7dunXpfCo8NSY9P2966y49OnfrZDtWDD9+/2vE7r26dZL4OlOysMjJs8t1ZNuB/WnyRTuT2T8dXcQDwhz7G256n8uMKuoHdoxpuVJMB9l6U4lPWGY0QFKKvKHjFfoGWWKJV5i0n7l4q+PrdWDbR3qDYX5LKHJD2TM4hcc/M73q86KewpGH48b/0sOx2BkFweNPmo6Kj/Vry3ZUfOGq0E+shX5iK3RTUb+R0sbAv5GKNuCl6AH1EC3CkJYzXONUy/kt1fAaw+ato63KMzlTJpM2OnUKss1uOhy/LOrhmFFQ1Dc7yRF/8uTJb/4Z8j9fSKSc+q+Cf66nNv/zz69sl1aWb4bNtpd9Vfb/fRmebH5djf/8thQc/OtVm01v3leGlS3y7s/xz3T60S5Op6cu8N81XuCHnrGdTre4KnSFtdBRtkK3uir0PWuho22FbnNV6Eprofm2Qr92Vej71kILbIVud1XoKmuhhbZCv3FV6AfWQsfYCt3hqtDV1kLH2gr91lWhH1oLfdZW6E5Xha6xFjrOVuh3rgr9yFroc7ZCd7kqdK210PG2Qr93VejH1kKftxW621WhYi10gq3QPa4K/cRa6Au2Qve6KnSdtdCJtkJ/cFXop9ZCX7QVus9VoeuthU6yFfqjq0I/sxY62VbofleFbrAWOsVW6E+uCv3cWuhLtkIPuCp0o7XQqbZCD7oq9AtroS/bCj3kqtBN1kKn2Qr92VWhX1oLnW4r9LCrQjdbC51hK/QXV4V+ZS30FVuhR1wVusVa6Exboc6ay1uthc6yFXrUVaHbrIXOthX6m6tCv7YW+qqt0GOuCt1uLXSOrdDfXRX6jbXQ12yFHndV6A5roXNthf7hqtBvrYW+biv0hKtCd1oLnWcr9E9XhX5nLfQNW6EnXRW6y1rofFOhiWKuCv3eWuibtkJTXBW621roAluhZ7kqdI+10IW2QlNdFbrXWugiW6Fprgr9wVroYluhHleF7rMWusRWqNdVoT9aC33LVmi6q0L3Wwtdais0w1WhP1kLfdtWaKarQg9YC11mK9TnqtCD1kLfsRXqd1XoIWuhy22FBlwV+rO10HdthWa5KvSwtdAVtkKzXRX6i7XQ92yFBl0VesRa6EpboSFXhf5qLfR9W6FhV4UetRa6ylZoxFWhv1kL/cBWaNRVocesha62FZrjqtDfrYV+aCs05qrQ49ZC19gKjbsq9A9roR/ZCk24KvSEtdC1tkKLuyr0T2uhH9sKLeGq0JPWQm0/x0+c7ajQnGLWQm0/x0+UdFVoirXQdbZCz3FV6FnWQj+1FVrKVaGp1kLX2wot7arQNGuhtsRTooyrQj3WQjfYCi3rqlCvtdDPbYWWc1VourXQjbZCz3VVaIa10C9shZZ3VWimtdBNtkLPc1Woz1rol7ZCK7gq1G8tdLOt0PNdFRqwFvqVrdCKrgrNsha6xVZoJVeFZlsL3WortLKrQoPWQrfZCr3AVaEha6Ff2wqt4qrQsLXQ7bZCL3RVaMRa6De2Qqu6KjRqLXSHrdCLXBWaYy30W1uh1VwVGrMWutNWaHVXhcathX5nK7SGq0IT1kJ32Qqt6arQ4tZCv7cVWstVoSWshe62FVrbVaFnWwvdYyu0jqtCS1oL3WsrtK6rQs+xFvqDrdB6rgotZS10n63Q+q4KLW0t9EdboQ1cFVrGWuh+W6EXuyq0rLXQn2yFNnRVaDlroQdshV7iqtBzrYUetBV6qatCy1sLPWQr9DJXhZ5nLfRnW6GXuyq0grXQw7ZCr3BV6PnWQn+xFdrIVaEVrYUesRXa2FWhlayF/mortImrQitbCz1qK/RKV4VeYC30N1uhTV0VWsVa6DFboVe5KvRCa6G/2wpt5qrQqtZCj9sKbe6q0Iushf5hK7SFq0KrWQs9YSv0aleFVrcW+qet0GtcFVrDWuhJW6HXuiq0prHQcDFbode5KrSWtdAUW6EtXRVa21roWbZCr3dVaB1roam2Qlu5KrSutdA0W6E3uCq0nrVQj63QG10VWt9aqNdWaGtXhTawFppuK/QmV4VebC00w1boza4KbWgtNNNW6C2uCr3EWqjPVmgbV4Veai3Ubyu0ratCL7MWGrAVequrQi+3FpplK/Q2V4VeYS0021bo7a4KbWQtNGgr9A5XhTa2FhqyFdrOVaFNrIWGbYXe6arQK62FRmyF3uWq0KbWQqO2Qu92VehV1kJzbIW2d1VoM2uhMVuh97gqtLm10Lit0A6uCm1hLTRhK7Sjq0KvthZa3FZoJ1eFXmMttISt0HtdFXqttdCzbYV2dlXoddZCS9oKvc9VoS2thZ5jK7SLq0KvtxZaylbo/a4KbWUttLSt0K6uCr3BWmgZW6HdXBV6o7XQsrZCu7sqtLW10HK2Qnu4KvQma6Hn2grt6arQm62FlrcV2stVobdYCz3PVugDrgptYy20gq3Q3q4KbWst9HxbobmuCr3VWmhFW6F9XBV6m7XQSrZC+7oq9HZroZVthT7oqtA7rIVeYCu0n6tC21kLrWIrtL+rQu+0FnqhrdABrgq9y1poVVuhD1kK/Xuj3RY9uvQpvHhrsckS3yLxrRLfJvGvJb5d4t9IfIfEv5X4Tol/J/FdEv9e4rslvkfieyX+g8T3SfxHie+X+E8SPyDxgxI/JPGfJX5Y4r9I/IjEf5X4UYn/JvFjEv9d4scl/ofET0j8T4mflMSpP0QoibMkkSqJNEl4JOGVRLokMiSRKQmfJPySCEgiSxLZkghKIiSJsCQikohKIkcSMUnEJZGQRHFJlJDE2ZIoKYlzJFFKEqUlUUYSZSVRThLnSqK8JM6TRAVJnC+JipKoJInKkrhAElUkcaEkqkriIklUk0R1SdSQRE1J1JJEbUnUkURdSdSTRH1JNJDExZJoKIlLJHGpJC6TxOWSuEISjSTRWBJNJHGlJJpK4ipJNJNEc0m0kMTVkrhG2/zaQNfWtDZ9tZ2qjUptAWpzTdtW2hDSVos2MbQ9oA/e9ZG2PizWx7D6gFMfHepDOX3cpQ+S9BGNPvzQxwp6w663wnqTqbdvemOktxx6Ma+XyXoBqpd2etGklyP6Ra9fofrlpKd9PaHqqUpPAvrx0gNXD4npf7/f/zpADZtvev7a8cuYnh1oOO7+2eD5YugGz5bJrUM97OCDniLxU38FPdkiNrLudJoYVMQPecP//pD/H/khLzAcdac+5ImHLd9Cp144qMD2KTIdxo8U6ZzR0HTOSCGcMx4p4jnDfu4FbuiZGOxgtc1LNBg31KNER1pVnCOP6aiDczzGdNTDOYYwHQ1wjseZjoY4x1Cm41Kc4wmm43KcYxjT0QjneJLpaIJzDGc6muIcTzEdzXCOEUxHC5zjaabjGpxjJNNxHc7xDNNxPc4xium4AecYzXS0xjnymY6bcY4CpqMNzlHIdNyKc4xhOm7HOcYyHe1wjmeZjrtwjnFMR3uc4zmmowPOMZ7p6IRzPM90dMY5JjAdXXCOF5iOrjjHRKajO87xItPRE+eYxHQ8gHNMZjpycY4pTEdfnOMlpqMfzjGV6RiAc7zMdAC7ytOYjkE4x3SmA9h3nsF05OEcrzAdQ3COmUzHUJxjFtMxDOeYzXQMxzleZTpG4BxzmI6ROMdrTMconGMu05GPc7zOdBTiHPOYjrE4xxtMxzicYz7TMR7neJPpmIBzLGA6JuIcC5mOSTjHIqZjCs6xmOmYinMsYTqm4RxvMR0zcI6lTMdMnONtpmM2zrGM6ZiDc7zDdMzFOZYzHfNwjneZjvk4xwqmYwHO8R7TsQjnWMl0LME53mc6luIcq5iOZTjHB0zHcpxjNdOxAuf4kOlYiXOsYTpW4RwfMR2rcY61TMcanONjpmMtziFMh+AcnzAd63COdUzHepzjU6ZjA86xnunYiHN8xnRswjk2MB2bcY7PmY4tOMdGpmMbzvEF07Ed59jEdOzAOb5kOnbiHJuZjl04x1dMx26cYwvTsRfn2Mp07MM5tjEd+3GOr5mOAzjHdqbjEM7xDdNxGOfYwXQcwTm+ZTqO4hw7mY5jOMd3TMdxnGMX03EC5/ie6TiJc+wmOjwpOMcepiMV59jLdHhwjh+YjnScYx/TkYlz/Mh0+HGO/UxHFs7xE9MRxDkOMB1hnOMg0xHFOQ4xHTGc42emI4FzHGY6SuAcvzAdJXGOI0xHKZzjV6ajDM5xlOkoh3P8xnSUxzmOMR0VcI7fmY6KOMdxpqMyzvEH01EF5zjBdAD3afiT6aiGc5xkOmrAhipejOmohXOkMB24/T+Kn8V04Pb/KJ7KdOD2/yiexnTg9v8o7mE6cPt/FPcyHbj9P4qnMx24/T+KZzAduP0/imcyHbj9P4r7mA7c/h/F/UwHbv+P4gGmA7f/R/EspgO3/0fxbKYDt/9H8SDTgdv/o3iI6cDt/1E8zHTg9v8oHmE6cPt/FI8yHbj9P4rnMB24/T+Kx5gO3P4fxeNMB27/j+IJpgO3/0fx4kwHbv+P4iWYDtz+H8XPZjpw+38UL8l04Pb/KH4O04Hb/6N4KaYDt/9H8dJMB27/j+JlmA7c/h/Fyxocs/52tOjRpU/hJVuLTZZEniQek8QQSTwuiaGSeEISwyTxpCSGS+IpSYyQxNOSGCmJZyQxShKjJZEviQJJFEpijCTGSuJZSYyTxHOSGC+J5yUxQRIvSGKiJF6UxCRJ6PhTJPGSJKZK4mVJTJPEdEnMkMQrkpgpiVmSmC2JVyUxRxKvSWKuJF6XxDxJvCGJ+ZJ4UxILJLFQEosksVgSSyTxliSWSuJtSSyTxDuSWC6JdyWxQhLvSWKlJN6XxCpJfCCJ1ZL4UBJrJPGRJNZK4mNJiCQ+kcQ6SXwqifWS+EwSGyTxuSQ2SuILSWySxJeS2CyJrySxRRJbJbFNEl9LYrskvpHEDkl8K4mdkvhOErsk8b0kdktijyT2SuIHSeyTxI+S2C+JnyRxQBIHJXFIEj9L4rAkfpHEEUn8KomjkvhNEse0oa69aG3jagdUm4fad9OWlXZ7tFGiPQZ9PK9PtvWhsD5P1UeR+hRPH4DpsyN97KJPLPRmX++T9RZT7870xkbvCfRyWq9E9SJOr3/00kG/dfULS8/1eprUM4x+OPW41kNi+t/vd96sRrm5nXr3ua1T756FBcn/VnLK5RL/TF9WvWPL3jtqTK68uFXThXl5bdtVqrWn+YAlvfKb7DhSeFBfp6+SxKMFpjbjowWG8YqXK9KH8RLThzHF2gnFbQphcpz+puQnf1M8p1Y7vsmw2mfpK02rfa6D1TYv0bm4ocqfwWonW53UxoWGuVMNr2lsei/OI74XabifRRSvwHQA29fnMx3A9nVFpgPYvq7EdADb15WZDmD7+gKmA9i+rsJ0ANvXFzIdwPZ1VaYD2L6+iOkAtq+rMR3A9nV1pgPYvq7BdADb1zWZDmD7uhbTAWxf12Y6gO3rOkwHsH1dl+kAtq/rMR3A9nV9pgPYvm7AdADb1xczHcD2dUOmA9i+voTpALavL2U6gO3ry5gOYPv6cqYD2L6+gukAtq8bMR3A9nVjpgPYvm7CdADb11cyHbk4R1Omoy/OcRXT0Q/naMZ0DMA5mjMdA3GOFkzHIJzjaqYD+EuFa5iOPJzjWqZjCM5xHdMxFOdoyXQMwzmuZzqG4xytmI4ROMcNTMdInONGpmMUztGa6cjHOW5iOgpxjpuZjrE4xy1Mxzicow3TMR7naMt0TMA5bmU6JuIctzEdk3CO25mOKTjHHUzHVJyjHdMxDee4k+mYgXPcxXTMxDnuZjpm4xztmY45OMc9TMdcnKMD0zEP5+jIdMzHOToxHQtwjnuZjkU4R2emYwnOcR/TsRTn6MJ0LMM57mc6luMcXZmOFThHN6ZjJc7RnelYhXP0YDpW4xw9mY41OEcvpmMtzvEA0yE4R2+mYx3Okct0rMc5+jAdG3COvkzHRpzjQaZjE87Rj+nYjHP0Zzq24BwDmI5tOMdDTMd2nGMg07ED53iY6diJcwxiOnbhHI8wHbtxjsFMx16c41GmYx/Okcd07Mc5HmM6DuAcQ5iOQzjH40zHYZxjKNNxBOd4guk4inMMYzqO4RxPMh3HcY7hTMcJnOMppuMkzjGC6PCk4BxPMx2pOMdIpsODczzDdKTjHKOYjkycYzTT4cc58pmOLJyjgOkI4hyFTEcY5xjDdERxjrFMRwzneJbpSOAc45iOEjjHc0xHSZxjPNNRCud4nukog3NMYDrK4RwvMB3lcY6JTEcFnONFpqMizjGJ6aiMc0xmOqrgHFOYDuA+DS8xHdVwjv9fe2cep1P5/3/nHPu+O+e+z4SQtEt7kX3fskQKTQxNxgyzWFIxSZLEzBCSkC0kSbYkyZbcr+xkS0hIQqWS5HdZMpaZvIf3u/fv+318//l87m7nfl2v59mv6z2v6xqvyVGej2OCJkcFPo6JmhyM639M0uRgXP9jsiYH4/of72pyMK7/MUWTg3H9j6maHIzrf0zT5GBc/+M9TQ7G9T+ma3Iwrv/xviYH4/ofMzQ5GNf/+ECTg3H9j5maHIzrf3yoycG4/scsTQ7G9T8+0uRgXP9jtiYH4/ofczQ5GNf/mKvJwbj+xzxNDsb1P+ZrcjCu//GxJgfj+h8LNDkY1//4RJODcf2PhZocjOt/fKrJwbj+xyJNDsb1Pz7T5GBc/2OxJgfj+h+fa3Iwrv+xRJODcf2PpQSOqWc56kRHxqdU3J5pLNwycG+AWxbujXDLwb0J7s1wb4F7K9zb4N4O9w645eHeCbcC3Lvg3g33Hrj3wr0P7v1wH4D7INyH4FaEWwnuw3Arw60CtyrcanCrw60BtybcWnBrw60Dty7cenDrw20AtyHcRnAbw30EbhO4TeE2g9sc7qNwW8BtCfcxuK3gPg73Cbit4baB2xbuk3DD4T4Ftx3c9nAj4HaA2xHu03Aj4T4DtxPcKLid4UbDjYHbBW5XuLFw4+DGw02A2w1ud7g94PaE+yzcXnCfg/s83Bfg9obbB24i3Bfh9oX7Etx+cF+G2x/uK3AHwH0V7kC4r8EdBPd1uIPhDoGbBDcZbgrcoXCHwX0D7nC4I+COhPsm3FFw34I72hTUTS3alHFNBdQUD03dzZSsTLXHFEpMjcEMz5uRbTMobMZTzVCkGcUzA2Bm7MgMu5gRC9PZN/1k08U0vTPTsTF9AvM6bd5EzUucef8xrw7mqWseWOZeb26T5g5jLk5zXptTYtLZ4504tUpcXERsfKuI2JiU5JSlJe5o3zB2V/mx5eY1rjEnMbFl6xsr7K/dc36XpGq7jqUcMScKiq6DWyqFcNqd3rB0MukELZVMaNhdlqHLsSLpcrSo19D1fJcjhePCw5J05b2d5fTeLrqZsLcdsyVpby8X2NvkXbScT2qFIkdmxj8q+EKTg7H4u1KTg7H4+6UmB2Pxd5UmB2PxN6TJwVj8hSYHY/H3K00OxuLvak0OxuLvGk0OxuLvWk0OxuLvOk0OxuLvek0OxuLvBk0OxuLvRk0OxuLvJk0OxuLvZk0OxuLv15ocjMXfLZocjMXfrZocjMXfbZocjMXf7ZocjMXfHZocjMXfbzQ5GIu/OzU5GIu/32pyMBZ/d2lyMBZ/d2tyMBZ/92hyMBZ/v9PkYCz+7tXkYCz+fq/JwVj83afJEcfHsV+TI4GP44AmR3c+jh80OXrycRzU5OjFx/GjJsfzfByHNDl683H8pMmRyMdxWJOjLx/HEU2OfnwcRzU5+vNx/KzJMYCP4xdNjoF8HL9qcgzi4zimyTGYj+M3TY4kPo7fNTlS+Dj+0OQYxsdxXJNjOB/Hn5ocI/k4TmhyjOLj+EuTYzQfx0lNjjF8HH9rcozj4zilyTGeTcrLpMkxkY/D0uSYzMdha3JM4eNwNDmm8XFk1uSYzseRRZNjBh9HVk2OmXwc2TQ5ZvFxZNfkmM3HkUOTYy4fR05Njvl8HLk0ORbwceTW5FjIx5FHk2MRH0deTY7FfBz5NDmW8HHk1+RYxsdRQJNjBR9HQU2OlXwchTQ5VvFxFNbkAB9HEU2O1XwcRTU51vJxFNPkWM/H4WpybOTj8DQ5NvNxBDQ5tvBxBDU5tvFx+JocO/g4wjQ5dvJxXKfJsYuPo7gmxx4+jhKaHHv5OEpqcuzj47hek+MAH0cpTY6DfBylNTkO8XGU0eQ4zMdxgybHUT6Ospocv/Bx3KjJcYyPo5wmx+98HDdpchzn47hZk+MEH8ctmhwn+Thu1eQ4xcdxmyJHFouP43ZNDoeP4w5Njix8HOU1ObLxcdypyZGDj6OCJkcuPo67NDny8HHcrcmRj4/jHk2OAnwc92pyFOLjuE+Towgfx/2aHMX4OB7Q5PD4OB7U5AjycTykyRHGx1FRk6M4H0clTY6SfBwPa3KU4uOorMlRho+jiiZHWT6Oqpoc5fg4qmly3MzHUV2Tg2+dBq+GJsftfBw1NTnK83HU0uSowMdRW5ODb/0Pr44mB9/6H15dTQ6+9T+8epocfOt/ePU1OfjW//AaaHLwrf/hNdTk4Fv/w2ukycG3/ofXWJODb/0P7xFNDr71P7wmmhx86394TTU5+Nb/8JppcvCt/+E11+TgW//De1STg2/9D6+FJgff+h9eS00OvvU/vMc0OfjW//BaaXLwrf/hPa7Jwbf+h/eEJgff+h9ea00OvvU/vDaaHHzrf3htNTn41v/wntTk4Fv/wwvX5OBb/8N7SpODb/0Pr50mB9/6H157TQ6+9T+8CE0OvvU/vA6aHHzrf3iEW0bi1LMcdaIj41Mqbc80Fu4XcFfC/RLuKrghuID7FdzVcNfAXQt3Hdz1cDfA3Qh3E9zNcL+GuwXuVrjb4G6HuwPuN3B3wv0W7i64u+Hugfsd3L1wv4e7D+5+uAfg/gD3INwf4R6C+xPcw3CPwD0K92e4v8D9Fe4xuL/B/R3uH3CPw/0T7gm4f8E9CfdvuKfgZYJ3ei4/eA68zPCywMsKLxu87PBywMsJLxe83PDywMsLLx+8/PAKwCsIrxC8wvCKwCsKrxg8F54HLwAvCM+HFwbvOnjF4ZWAVxLe9fBKwSsNrwy8G+CVhXcjvHLwboJ3M7xb4N0K7zZ4t8O7A155eHfCqwDvLnh3w7sH3r3w7oN3P7wH4D0I7yF4FeFVgvcwvMqmoG5q0aaMayqgpnho6m6mZGWqPaZQYmoMZnjejGybQWEznmqGIs0onhkAM2NHZtjFjFiYzr7pJ5supumdmY6N6ROY12nzJmpe4sz7j3l1ME9d88Ay93pzmzR3GHNxmvPanBKTzh7vxKlV4uIiYuNbRcTGpCRfea5kqyKKrjOb3dG+Yeyu8mPLzWtcY05iYsvWN1bYX7vn/C5J1XYdSzlitjNbwV2RTDk9zWYEPe/pDF2MlUgXo0W8gtzlfBcjhePCg5J05YOS5fTeLrqZsLczmy1JeztSYG+TdxHjq8EzihyZGf+koJMmB2PpN0qTg7H021mTg7H0G63JwVj6jdHkYCz9dtHkYCz9dtXkYCz9xmpyMJZ+4zQ5GEu/8ZocjKXfBE0OxtJvN00OxtJvd00OxtJvD00OxtJvT00OxtLvs5ocjKXfXpocjKXf5zQ5GEu/z2tyMJZ+X9DkYCz99tbkYCz99tHkYCz9JmpyMJZ+X9TkYCz99tXkYCz9vqTJwVj67afJwTi++7ImB2Ppt78mB2Pp9xVNDsbS7wBNDsbS76uaHHF8HAM1ORL4OF7T5OjOxzFIk6MnH8frmhy9+DgGa3I8z8cxRJOjNx9HkiZHIh9HsiZHXz6OFE2OfnwcQzU5+vNxDNPkGMDH8YYmx0A+juGaHIP4OEZocgzm4xipyZHEx/GmJkcKH8coTY5hfBxvaXIM5+MYrckxko/jbU2OUXwcYzQ5RvNxjNXkGMPHMU6TYxwfxzuaHOP5OMZrckzk45igyTGZj2OiJscUPo5JmhzT+Dgma3JM5+N4V5NjBh/HFE2OmXwcUzU5ZvFxTNPkmM3H8Z4mx1w+jumaHPP5ON7X5FjAxzFDk2MhH8cHmhyL+DhmanIs5uP4UJNjCR/HLE2OZXwcH2lyrODjmK3JsZKPY44mxyo+jrmaHODjmKfJsZqPY74mx1o+jo81OdbzcSzQ5NjIx/GJJsdmPo6Fmhxb+Dg+1eTYxsexSJNjBx/HZ5ocO/k4Fmty7OLj+FyTYw8fxxJNjr18HEs1OfbxcSzT5DjAx7Fck+MgH8cKTY5DfBxfaHIc5uNYqclxlI/jS02OX/g4VmlyHOPjCGly/M7HAU2O43wcX2lynODjWK3JcZKPY40mxyk+jrWKHFksPo51mhwOH8d6TY4sfBwbNDmy8XFs1OTIwcexSZMjFx/HZk2OPHwcX2ty5OPj2KLJUYCPY6smRyE+jm2aHEX4OLZrchTj49ihyeHxcXyjyRHk49ipyRHGx/GtJkdxPo5dmhwl+Th2a3KU4uPYo8lRho/jO02OsnwcezU5yvFxfK/JcTMfxz5NDsZ1GvZrctzOx3FAk6M8H8cPmhwV+DgOanIwrv/xoyYH4/ofhzQ5GNf/+EmTg3H9j8OaHIzrfxzR5GBc/+OoJgfj+h8/a3Iwrv/xiyYH4/ofv2pyMK7/cUyTg3H9j980ORjX//hdk4Nx/Y8/NDkY1/84rsnBuP7Hn5ocjOt/nNDkYFz/4y9NDsb1P05qcjCu//G3Jgfj+h+nNDn41v8IZNLk4Fv/I2BpcvCt/xGwNTn41v8IOJocfOt/BDJrcvCt/xHIosnBt/5HIKsmB9/6H4Fsmhx8638Esmty8K3/EcihycG3/kcgJ4Fj6lmOOtGR8SkPb880Fl4neFHwOsOLhhcDrwu8rvBi4cXBi4eXAK8bvO7wesDrCe9ZeL3gPQfveXgvwOsNrw+8RHgvwusL7yV4/eC9DK8/vFfgDYD3KryB8F6DNwje6/AGwxsCLwleMrwUeEPhDYP3Brzh8EbAGwnvTXij4L0FbzS8t+GNgWccjoP3Drzx8CbAmwhvErzJ8N6FNwXeVHjT4L0Hbzq89+HNgPcBvJnwPoQ3C95H8GbDmwNvLrx58ObD+xjeAnifwFsI71N4i+B9Bm8xvM/hLYG3FN4yeMvhrYD3BbyV8L6EtwpeCB7gfQVvNbw18NbCWwdvPbwN8DbC2wRvM7yv4W2BtxXeNnjb4e2A9w28nfC+hbcL3m54e0xB3dSiTRnXVEBN8dDU3UzJylR7TKHE1BjM8LwZ2TaDwmY81QxFmlE8MwBmxo7MsIsZsTCdfdNPNl1M0zszHRvTJzCv0+ZN1LzEmfcf8+pgnrrmgWXu9eY2ae4w5uI057U5JSadPd6JU6vExUXExreKiI1JSU4hnE1F16HoRrPhHe0bxu4qP7bcvMY15iQmtmx9Y4X9tXvO75JUbdexlCNmy9Mbes8kk16cn0km6AVyZehyfJh0OVrUd3vGxxWF48LDkkQ9LJtJe7voOtLezk1w+UHVqPB2narG9KiZEN2uWnhUVOLEJlUa1qqRnDi5RWR8dERcnNEpkeGDQs5q8NXsA3kETi4yB19tNZBXk4OvthrIp8nBV1sN5Nfk4KutBgpocvDVVgMFNTn4aquBQpocfLXVQGFNDr7aaqCIJgdfbTVQVJODr7YaKKbJwVdbDbiaHHy11YCnycFXWw0ENDn4aquBoCYHX2014Gty8NVWA2GaHHy11cB1mhx8tdVAcU0OvtpqoIQmB19tNVBSk4Oxtnq9JgdjbbWUJgdjbbW0JgdjbbWMJgdjbfUGTQ7G2mpZTQ7GweobNTkYa6vlNDkYa6s3aXIw1lZv1uRgrK3eoskRx8dxqyZHAh/HbZoc3fk4btfk6MnHcYcmRy8+jvKaHM/zcdypydGbj6OCJkciH8ddmhx9+Tju1uTox8dxjyZHfz6OezU5BvBx3KfJMZCP435NjkF8HA9ocgzm43hQkyOJj+MhTY4UPo6KmhzD+DgqaXIM5+N4WJNjJB9HZU2OUXwcVTQ5RvNxVNXkGMPHUU2TYxwfR3VNjvF8HDU0OSbycdTU5JjMx1FLk2MKH0dtTY5pfBx1NDmm83HU1eSYwcdRT5NjJh9HfU2OWXwcDTQ5ZvNxNNTkmMvH0UiTYz4fR2NNjgV8HI9ocizk42iiybGIj6OpJsdiPo5mmhxL+Diaa3Is4+N4VJNjBR9HC02OlXwcLTU5VvFxPKbJAT6OVpocq/k4HtfkWMvH8YQmx3o+jtaaHBv5ONpocmzm42irybGFj+NJTY5tfBzhmhw7+Die0uTYycfRTpNjFx9He02OPXwcEZoce/k4Omhy7OPj6KjJcYCP42lNjoN8HJGaHIf4OJ7R5DjMx9FJk+MoH0eUJscvfBydNTmO8XFEa3L8zscRo8lxnI+jiybHCT6OrpocJ/k4YjU5TvFxxClyZLH4OOI1ORw+jgRNjix8HN00ObLxcXTX5MjBx9FDkyMXH0dPTY48fBzPanLk4+PopclRgI/jOU2OQnwcz2tyFOHjeEGToxgfR29NDo+Po48mR5CPI1GTI4yP40VNjuJ8HH01OUrycbykyVGKj6OfJkcZPo6XNTnK8nH01+Qox8fxiibHzXwcAzQ5GNdpeFWT43Y+joGaHOX5OF7T5KjAxzFIk4Nx/Y/XNTkY1/8YrMnBuP7HEE0OxvU/kjQ5GNf/SNbkYFz/I0WTg3H9j6GaHIzrfwzT5GBc/+MNTQ7G9T+Ga3Iwrv8xQpODcf2PkZocjOt/vKnJwbj+xyhNDsb1P97S5GBc/2O0Jgfj+h9va3Iwrv8xRpODcf2PsZocjOt/jNPkYFz/4x1NDsb1P8ZrcjCu/zFBk4Nx/Y+JmhyM639M0uRgXP9jsiYH4/of72pyMK7/MUWTg3H9j6maHIzrf0zT5GBc/+M9AseFi7knkxdzJ224wWx42uiV13OfnkGjlFXnK6PomhRC65UpDouuIXG8f2VbGeaoYmQpA/XTqsZGRkVFdjy91P3QLMMSJzWNjO4YFUE7Vygz6mZIsBK3YMUMCJLP4/XU83jjEG4euITV3ZJPa3buEhWBwIzUjx9Qr//3CaY/qBoV3q5T1ZgeNROi250+dxInNqnSsFaN5MTJLSLjoyPi4kzbJS4+u7InZ3xXb6Lu6k1X2NWnTp36I3VX//vG1un/uWAnzkz9+CHlpm2Rds9M2mYflsjwtX92z5HuoSV2C9xDzx4QWvt7Mtj+kKH/Lpt85Mw5PJN04/2Qcj2U2E3aag/h/Lt0RxIeDQZlSAZ3UTJFuXA4CnegHEuzYdHXkim7oHAH0k6fJYXTkYoziIbTkYTzkRTO01Sc12k4T5NwZkvhRFJxBtNwIkk4c6RwnqHiDKHhPEPCmSuF04mKk0TD6UTCmSeFE0XFSabhRJFw5kvhdKbipNBwOpNwPpbCiabiDKXhRJNwFkjhxFBxhtFwYkg4n0jhdKHivEHD6ULCWSiF05WKM5yG05WE86kUTiwVZwQNJ5aEs0gKJ46KM5KGE0fC+UwKJ56K8yYNJ56Es1gKJ4GKM4qGk0DC+VwKpxsV5y0aTjcSzhIpnO5UnNE0nO4knKVSOD2oOG/TcHqQcJZJ4fSk4oyh4fQk4SyXwnmWijOWhvMsCWeFFE4vKs44Gk4vEs4XUjjPUXHeoeE8R8JZKYXzPBVnPA3neRLOl1I4L1BxJtBwXiDhrJLC6U3FmUjD6U3CCUnh9KHiTKLh9CHhQAonkYozmYaTSML5SgrnRSrOuzScF0k4q6Vw+lJxptBw+pJw1kjhvETFmUrDeYmEs1YKpx8VZxoNpx8JZ50UzstUnPdoOC+TcNZL4fSn4kyn4fQn4WyQwnmFivM+DecVEs5GKZwBVJwZNJwBJJxNUjivUnE+oOG8SsLZLIUzkIozk4YzkITztRTOa1ScD2k4r5FwtkjhDKLizKLhDCLhbJXCeZ2K8xEN53USzjYpnMFUnNk0nMEknO1SOEOoOHNoOENIODukcJKoOHNpOLQ/Pf1GCieZijOPhpNMwtkphZNCxZlPw0kh4XwrhTOUivMxDWcoCWeXFM4wKs4CGs4wEs5uKZw3qDif0HDeIOHskcIZTsVZSMMZTsL5TgpnBBXnUxrOCBLOXimckVScRTSckSSc76Vw3qTifEbDeZOEs08KZxQVZzENZxQJZ78UzltUnM9pOG+RcA5I4Yym4iyh4Ywm4fwghfM2FWcpDedtEs5BKZwxVJxlNJwxJJwfpXDGUnGW03DGknAOSeGMo+KsoOGMI+H8JIXzDhXnCxrOOyScw1I446k4K2k440k4R6RwJlBxvqThTCDhHJXCmUjFWUXDmUjC+ZmCczYXXCc6Mj6l8vZMlRGYhcBHCMxGYA4CcxGYh8B8BD5GYAECnyCwEIFPEViEwGcILEbgcwSWILAUgWUILEdgBQJfILASgS8RWGVK56bcbEq0pqxpSoGmfGZKTqZMY0obphxghtDNsLMZqjXDm2ZI0AyjmaEnM1xjhjjMsIDpSpvup+mymW6O6RqY12nzCmpe28yrjnk9MI9U8xgyt25zuzO3CHNZmVPRHD6DPOksz8XRLVrn/Zcr7/rspFBW9oyny0iDSadDWb/Qhol+JbSfGgmvzBoJpzROlTqWwVO4yv/SU5gyOnf6BKHckE6fRseSabufdLL9lqGTrQrpZLMUTrbfMnjREu8rv/+n9xXr6u4rv9PuK38IHGry8fmDT+q4Ikdmxinc/9TkYJxq+4QmB+NU239pcjBOtX1Sk4Nxqu2/NTkYp9o+pcnBN9V2MJMmB99U20FLk4Nvqu2grcnBN9V20NHk4JtqO5hZk4Nvqu1gFk0Ovqm2g1k1Ofim2g5m0+Tgm2o7mF2Tg2+q7WAOTY6mfBw5NTn4ptoO5tLk4JtqO5hbk4Nvqu1gHk0Ovqm2g3k1Ofim2g7m0+Tgm2o7mF+Tg2+q7WABTQ6+qbaDBTU5+KbaDhbS5OCbajtYWJODb6rtYBFNDr6ptoNFNTn4ptoOFtPk4JtqO+hqcvBNtR30NDni+DgCmhwJfBxBTY7ufBy+JkdPPo4wTY5efBzXaXI8z8dRXJOjNx9HCU2ORD6Okpocffk4rtfk6MfHUUqToz8fR2lNjgF8HGU0OQbycdygyTGIj6OsJsdgPo4bNTmS+DjKaXKk8HHcpMkxjI/jZk2O4Xwct2hyjOTjuFWTYxQfx22aHKP5OG7X5BjDx3GHJsc4Po7ymhzj+Tju1OSYyMdRQZNjMh/HXZocU/g47tbkmMbHcY8mx3Q+jns1OWbwcdynyTGTj4Pwp/IX5cqqnsmV/YnACQT+QuAkAn8jcArBTAie/itaBB0EMyOYBcGsCGZDMDuCORDMiWAuBHMjmAfBvAjmQzC/Kd2bqrcpGJtaqylTmgqfKY6ZupIpyZhqhikEmDF0M/xsRm7NoKcZLzRDbWaUygzwmLERM6xgeuSmM2v6gaYLZXof5sXdvPOa10XzpmVeUszz3TwazVPF3JDNvczcBswVZE4+c9wM8tXmyh7OQK7sOC1XdjyZoBd8IEMnW1XeXBlf2IjEkfFcWfDBKzfOmCuzrypXFnwwicTykMChJh+fh/ikKipyMObKgpU0OfhyZcGHNTn4cmXBypocfLmyYBVNDr5cWbCqJgdfrixYTZODMVdWXZODMVdWQ5ODMVdWU5ODMVdWS5ODMVdWW5ODMVdWR5ODMVdWV5ODMVdWT5ODMVdWX5ODMVfWQJODMVfWUJODMVfWSJODMVfWWJODMVf2iCYHY66siSYHY66sqSYHY66smSYHY66suSYHY67sUU0OxlxZC00OxlxZS00OxlzZY5ocjLmyVpocjLmyxzU5GHNlT2hyMObKWmtyMObK2mhyMObK2mpyMObKntTkYMyVhWtyMObKntLkYMyVtdPkYMyVtdfkYMyVRWhyMObKOmhyMObKOmpyMObKntbkYMyVRWpyMObKntHkYMyVddLkYMyVRWlyMObKOmtyMObKojU5GHNlMZocjLmyLpocjLmyrpocjLmyWE0OxlxZnCYHY64sXpODMVeWoMnBmCvrpsnBmCvrrsnBmCvrocnBmCvrqcnBmCt7VpODMVfWS5ODMVf2nCYHY66MMDR5Ua6s2ulcWbASgg8jaD5UQbAqgtUQrI5gDQRrIlgLwdoI1kGwLoL1EKyPYAMEGyLYCMHGCD6CYBMEmyLYzJTuTdXbFIxNrdWUKU2FzxTHTF3JlGRMNcMUAswYuhl+NiO3ZtDTjBeaoTYzSmUGeMzYiBlWMD1y05k1/UDThTK9D/Pibt55zeuiedMyLynm+W4ejeapYm7I5l5mbgPmCjInnzluBvlqc2WV6LmyYEVSrsxsRgkbvZChk60aa66MM2xE4biKXFnvKzfOmCtzri5X1juJxNJH4FCTj08fPqlERQ7OXNmLmhyMubK+mhyMubKXNDkYc2X9NDkYc2Uva3Iw5sr6a3Iw5spe0eRgzJUN0ORgzJW9qsnBmCsbqMnBmCt7TZODMVc2SJODMVf2uiYHY65ssCYHY65siCYHY64sSZODMVeWrMnBmCtL0eRgzJUN1eRgzJUN0+RgzJW9ocnBmCsbrsnBmCsbocnBmCsbqcnBmCt7U5ODMVc2SpODMVf2liYHY65stCYHY67sbU0OxlzZGE0OxlzZWE0OxlzZOE0OxlzZO5ocjLmy8ZocjLmyCZocjLmyiZocjLmySZocjLmyyZocjLmydzU5GHNlUzQ5GHNlUzU5GHNl0zQ5GHNl72lyMObKpmtyMObK3tfkYMyVzdDkYMyVfaDJwZgrm6nJwZgr+1CTgzFXNkuTgzFX9pEmB2OubLYmB2OubI4mB2OubK4mB2OubJ4mB2OubL4mB2Ou7GNNDsZc2QJNDsZc2SeaHIy5soWaHIy5sk81ORhzZYs0ORhzZZ9pcjDmyhYTOC7MlVU/kyt7EcG+CL6EYD8EX0awP4KvIDgAwVcRHIjgawgOQvB1BAcjOATBJASTEUxBcCiCwxB8A8HhCI4wpXtT9TYFY1NrNWVKU+EzxTFTVzIlGVPNMIUAM4Zuhp/NyK0Z9DTjhWaozYxSmQEeMzZihhVMj9x0Zk0/0HShTO/DvLibd17zumjetMxLinm+m0ejeaqYG7K5l5nbgLmCzMlnjptBvtpcGdzSGUiWJdKSZYnJlLjR5xk63arzJssY40YUjqtIli25cuOMybLMV5csW5JEYlkqcKjJx2cpn9QyRQ7OZNlyTQ7GZNkKTQ7GZNkXmhyMybKVmhyMybIvNTkYk2WrNDkYk2UhTQ7GZBk0ORiTZV9pcjAmy1ZrcjAmy9ZocjAmy9ZqcjAmy9ZpcjAmy9ZrcjAmyzZocjAmyzZqcjAmyzZpcjAmyzZrcjAmy77W5GBMlm3R5GBMlm3V5GBMlm3T5GBMlm3X5GBMlu3Q5GBMln2jycGYLNupycGYLPtWk4MxWbZLk4MxWbZbk4MxWbZHk4MxWfadJgdjsmyvJgdjsux7TQ7GZNk+TQ7GZNl+TQ7GZNkBTQ7GZNkPmhyMybKDmhyMybIfNTkYk2WHNDkYk2U/aXIwJssOa3IwJsuOaHIwJsuOanIwJst+1uRgTJb9osnBmCz7VZODMVl2TJODMVn2myYHY7Lsd00OxmTZH5ocjMmy45ocjMmyPzU5GJNlJzQ5GJNlf2lyMCbLTmpyMCbL/tbkYEyWndLk4EuW+Zk0OfiSZb6lycGXLPNtTQ6+ZJnvaHLwJcv8zJocfMkyPwuB48JkWY0zybLlCK5A8AsEVyL4JYKrEAwhCAS/QnA1gmsQXIvgOgTXI7gBwY0IbkJwM4JfI7gFwa0IbkNwuyndm6q3KRibWqspU5oKnymOmbqSKcmYaoYpBJgxdDP8bEZuzaCnGS80Q21mlMoM8JixETOsYHrkpjNr+oGmC2V6H+bF3bzzmtdF86ZlXlLM8908Gs1TxdyQzb3M3AbMFWROPnPcDPLVJssqZiBXtoyWK1uWTNDzs2boZKvBmyvjCxuRODKeK/OzXblxxlxZlqvKlfnZkkgs2QUONfn4ZOeTyqHIwZgr83NqcvDlyvxcmhx8uTI/tyYHX67Mz6PJwZcr8/NqcvDlyvx8mhx8uTI/vyYHX67ML6DJwZcr8wtqcvDlyvxCmhx8uTK/sCYHX67ML6LJwZcr84tqcvDlyvximhx8uTLf1eTgy5X5niYHX67MD2hy8OXK/KAmB1+uzPc1OfhyZX6YJgdfrsy/TpODL1fmF9fk4MuV+SU0OfhyZX5JTQ6+XJl/vSYHX67ML6XJwZcr80trcvDlyvwymhx8uTL/Bk0OvlyZX1aTgy9X5t+oycGXK/PLaXLw5cr8mzQ5+HJl/s2aHHy5Mv8WTQ6+XJl/qyYHX67Mv02Tgy9X5t+uycGXK/Pv0OTgy5X55TU5+HJl/p2aHHy5Mr+CJgdfrsy/S5ODL1fm363JwZcr8+/R5ODLlfn3anLw5cr8+zQ5+HJl/v2aHHy5Mv8BTQ6+XJn/oCYHX67Mf0iTgy9X5lfU5ODLlfmVNDn4cmX+w5ocfLkyv7ImB1+uzK+iycGXK/OranLw5cr8apocjLmy6pocjLmyGpocjLmympocjLmyWpocjLmy2pocjLkywp86XpQrq3k6V+bnhJ8Lfm74eeDnhZ8Pfn74BeAXhF8IfmH4ReAXhV8Mvgvfgx+AH4Tvww+Dfx384vBLmNK9qXqbgrGptZoypanwmeKYqSuZkoypZphCgBlDN8PPZuTWDHqa8UIz1GZGqcwAjxkbMcMKpkduOrOmH2i6UKb3YV7czTuveV00b1rmJcU8382j0TxVzA3Z3MvMbcBcQebkM8fNIF/1imWB9xH4gJgs83OQkmVmM0rcqG6GTrearMkyzrgRheMqkmX1rtw4Y7Is69Uly+olkVjqCxxq8vGpzyfVIIOHmnQFFl2HoutJG25A0Y20Hd5QcYdzRuAaaXIwRuAaa3IwRuAe0eRgjMA10eRgjMA11eRgjMA10+RgjMA11+RgjMA9qsnBGIFrocnBGIFrqcnBGIF7TJODMQLXSpODMQL3uCYHYwTuCU0Oxghca00OxghcG00OxghcW00Oxgjck5ocjBG4cE0OxgjcU5ocjBG4dpocjBG49pocjBG4CE0OxghcB00OxghcR00Oxgjc05ocjBG4SE0OxgjcM5ocjBG4TpocjBG4KE0OxghcZ00OxghctCYHYwQuRpODMQLXRZODMQLXVZODMQIXq8nBGIGL0+RgjMDFa3IwRuASNDkYI3DdNDkYI3DdNTkYI3A9NDkYI3A9NTkYI3DPanIwRuB6aXIwRuCe0+RgjMA9r8nBGIF7QZODMQLXW5ODMQLXR5ODMQKXqMnBGIF7UZODMQLXV5ODMQL3kiYHYwSunyYHYwTuZU0Oxghcf00OxgjcK5ocjBG4AZocjBG4VzU5GCNwAzU5GCNwr2lyMEbgBmlyMEbgXidwXBiBq3UmAtcIfmP4j8BvAr8p/Gbwm8N/FH4L+C3hPwa/FfzH4T8BvzX8NvDbwn8Sfjj8p+C3g98efoQp3ZuqtykYm1qrKVOaCp8pjpm6kinJmGqGKQSYMXQz/GxGbs2gpxkvNENtZpTKDPCYsREzrGB65KYza/qBpgtleh/mxd2885rXRfOmZV5SzPPdPBrNU8XckM29zNwGzBVkTj5z3AxyWhE4cpCp4en9esVcTUnKePOl7ZOSdQ1SSMe1AcWlP5iiVTJjY+e1ePN3jKGswRk8JsT83ZArN86Yv8t2daftENJp6ycJHGry8WEcVklW5OCMtaVocjDG2oZqcjDG2oZpcjDG2t7Q5GCMtQ3X5GCMtY3Q5GCMtY3U5GCMtb2pycEYaxulycEYa3tLk4Mx1jZak4Mx1va2JgdjrG2MJgdjrG2sJgdjrG2cJgdjrO0dTQ7GWNt4TQ7GWNsETQ7GWNtETQ7GWNskTQ7GWNtkTQ7GWNu7mhyMsbYpmhyMsbapmhyMsbZpmhyMsbb3NDkYY23TNTkYY23va3IwxtpmaHIwxto+0ORgjLXN1ORgjLV9qMnBGGubpcnBGGv7SJODMdY2W5ODMdY2R5ODMdY2V5ODMdY2T5ODMdY2X5ODMdb2sSYHY6xtgSYHY6ztE00OxljbQk0Oxljbp5ocjLG2RZocjLG2zzQ5GGNtizU5GP/+6nNNDsZY2xJNDsZY21JNDsZY2zJNDsZY23JNDsZY2wpNDsZY2xeaHIyxtpWaHIyxti81ORhjbas0ORhjbSFNDsZYGzQ5GGNtX2lyMMbaVmtyMMba1mhyMMba1mpyMMba1hE4Loy11T4Ta0uBPxT+MPhvwB8OfwT8kfDfhD8K/lvwR8N/G/4Y+GPhj4P/Dvzx8CfAnwh/EvzJ8N+FP8WU7k3V2xSMTa3VlClNhc8Ux0xdyZRkTDXDFALMGLoZfjYjt2bQ04wXmqE2M0plBnjM2IgZVjA9ctOZNf1A04UyvQ/z4m7eec3ronnTMi8p5vluHo3mqWJuyOZeZm4D5goyJ585bgb5mlZ2m0HNnyXTVnY7vdWV40brM3S61eZNljF2dykcV5Es20BpnJIssyjJMuvqkmUbkkgsGwm76IOqUeHtOlWN6VEzIbpdtfCoqMSJTao0rFUjOXFyi8j46Ii4OKNT4qpsBmaQztvA+ySYTUwwm0pcxSpwr6LoOuqGxIOzOYPnL83oQKrRgWSjXwvcMMjPJ8Zc3xZNDsZc31ZNDsZc3zZNDsZc33ZNDsZc3w5NDsZc3zeaHIy5vp2aHIy5vm81ORhzfbs0ORhzfbs1ORhzfXs0ORhzfd9pcjDm+vZqcjDm+r7X5GDM9e3T5GDM9e3X5GDM9R3Q5GDM9f2gycGY6zuoycGY6/tRk4Mx13dIk4Mx1/eTJgdjru+wJgdjru+IJgdjru+oJgdjru9nTQ7GXN8vmhyMub5fNTkYc33HNDkYc32/aXIw5vp+1+RgzPX9ocnBmOs7rsnBmOv7U5ODMdd3QpODMdf3lyYHY67vpCYHY67vb00OxlzfKU0OvlxfWCZNDr5cX5ilycGX6wuzNTn4cn1hjiYHX64vLLMmB1+uLyyLJgdfri8sqyYHX64vLJsmB98fOoZl1+Tgy/WF5dDk4Mv1heXU5ODL9YXl0uTgy/WF5dbk4Mv1heXR5ODL9YXl1eTgy/WF5dPk4Mv1heXX5ODL9YUV0OTgy/WFFdTk4Mv1hRXS5ODL9YUV1uTgy/WFFdHk4Mv1hRXV5ODL9YUV0+Tgy/WFuQSOi4JWpBwaLfUT5l3Z4VWkvMICFHK2lNfVBHnWIZCbtOEGBKYnkaCDGT2QNFn/32Urln5h59XIhqUra593e3ne66PGMXERke1jou9sHBHbOSE+PD4yJjp5aGr+K8w//7la6reZb71gi7ChCLsOYcURVgJhJROnVY2NjIqK7Hhaf2jWpMRJTSOjO0ZFUC+f666814fQtGpk8PiR44SbSEek5HMZPX+Gksb5G5JOh+tJFuMoLRJAMp7LrGEs0k7sUoTdSAgyhpUqkfHbbg2Sw9IZvelyHugy/+mBznRV0W1/I2XDMM88aGjnxA1CRsOCVKNBmtGyEi8DmQgHs6ZEwxah4VoSDduEhmtLNOwQGq5zNQ1fSbQu5fRyjme0acpzs57EjsxMaLi+RMNZCA03kGg4K6HhhhINZyM03Eii4eyEhhtLNJyD0PAjEg3nJDTcRKLhXISGm0o0nJvQcDOJhvMQGm4u0XBeQsOPSjScj9BwC4mG8xMabinRcAFCw49JNFyQ0HAriYYLERp+XKLhwoSGn5BouAih4dYSDRclNNxGouFihIbbSjTsEhp+UqJhj9BwuETDlHHKpyQaDhIabifRsE9ouL1Ew2GEhiMkGr6O0HAHiYaLExruKNFwCULDT0s0XJLQcKREw9cTGn5GouFShIY7ZbDhZMK8hTXgb6ZMb+hvNsONlE58lIzJr0kmvyaa7Hw1h/BKotGkkZO/Jc6e0gR7MSIHJqwU5cCElTbjxZQD00ViXKmrhGishGichGi8hGiChGg3CdHuEqI9JER7Sog+KyHaS0L0OQnR5yVEX5AQ7S0hGuojopooovqiiGpfEdWXRFT7iai+LKLaX0T1FRHVASKqr4qoDhRRfU1EdZCI6usiqoNFVIeIqCaJqCaLqKaIqA4VUR0movqGiOpwEdURIqojRVTfFFEdJaL6lojqaBHVt0VUx4iojhVRHSei+o6I6ngR1QkiqhNFVCeJqE4WUX1XRHWKiOpUEdVpIqrviahOF1F9X0R1hojqByKqM0VUPxRRnSWi+pGI6mwR1TkiqnNFVOeJqM4XUf1YRHWBiOonIqoLRVQ/FVFdJKL6mYjqYhHVz0VUl4ioLhVRXSaiulxEdYWI6hciqitFVL8UUV0lohoSUYWI6lciqqtFVNeIqK4VUV0norpeRHWDiOpGEdVNIqqbRVS/FlHdIqK6VUR1m4jqdhHVHSKq34io7hRR/VZEdZeI6m4R1T0iqt+JqO4VUf1eRHWfiOp+EdUDIqo/iKgeFFH9UUT1kIjqTyKqh0VUj4ioHhVR/VlE9RcR1V9FVI+JqP4movq7iOofIqoi0wmE/hRRPSGi+peI6kkR1b9FVE9JqMLKJCNrycjaMrKOjGxmGdksMrJZZWSzychml5HNISObU0Y2l4xsbhnZPDKyeWVk88nI5peRLSAjW1BGtpCMbGEZ2SIyskVlZIvJyLoysp6MbEBGNigj68vIhsnIXicjW1xGtoSMbEkZ2etlZEvJyJaWkS2TQVnqJJKBWZQs9ulpMbckk4zekEzRmyWF8xEVZysNpywJ5yMpnNlUnG00nBtJOLOlcOZQcbbTcMqRcOZI4cyl4uyg4dxEwpkrhTOPivMNDedmEs48KZz5VJydNJxbSDjzpXA+puJ8S8O5lYTzsRTOAirOLhrObSScBVI4n1BxdtNwbifhfCKFs5CKs4eGcwcJZ6EUzqdUnO9oOOVJOJ9K4Syi4uyl4dxJwlkkhfMZFed7Gk4FEs5nUjiLqTj7aDh3kXAWS+F8TsXZT8O5m4TzuRTOEirOARrOPSScJVI4S6k4P9Bw7iXhLJXCWUbFOUjDuY+Es0wKZzkV50cazv0knOVSOCuoOIdoOA+QcFZI4XxBxfmJhvMgCecLKZyVVJzDNJyHSDgrpXC+pOIcoeFUJOF8KYWziopzlIZTiYSzSgonRMX5mYbzMAknJIUDKs4vNJzKJBxI4XxFxfmVhlOFhPOVFM5qKs4xGk5VEs5qKZw1VJzfaDjVSDhrpHDWUnF+p+FUJ+GslcJZR8X5g4ZDWpYtsE4KZz0V5zgNpyYJZ70UzgYqzp80nFoknA1SOBupOCdoOLVJOBulcDZRcf6i4dQh4WySwtlMxTlJwyGtkxbYLIXzNRXnbxpOPRLO11I4W6g4p2g49Uk4W6RwthJxwjLRcBqQcLZK4Wyj4lg0HNICo4FtUjjbqTg2DacRCWe7FM4OKo5Dw2lMwtkhhfMNFSczDecREs43Ujg7qThZaDhNSDg7pXC+peJkpeE0JeF8K4Wzi4qTjYbTjISzSwpnNxUnOw2nOQlntxTOHipODhrOoyScPVI431FxctJwWpBwvpPC2UvFyUXDaUnC2SuF8z0VJzcN5zESzvdSOPuoOHloOK1IOPukcPZTcfLScB4n4eyXwjlAxclHw3mChHNACucHKk5+Gk5rEs4PUjgHqTgFaDhtSDgHpXB+pOIUpOG0JeH8KIVziIpTiIbzJAnnkBTOT1ScwjSccBLOT1I4h6k4RWg4T5FwDkvhHKHiFKXhtCPhHJHCOUrFKUbDaU/COSqF8zMVx6XhRJBwfr4KnCup1kDYDRSY0ysp3kCLGXUQsImi6xDIQ9pwA4puoxntKGU0L9XodprRp6WM5qMa3UEzGillND/V6Dc0o89IGS1ANbqTZrSTlNGCVKPf0oxGSRktRDW6i2a0s5TRwlSju2lGo6WMFqEa3UMzGiNltCjV6Hc0o12kjBajGt1LM9pVyqhLNfo9zWislFGPanQfzWiclNEA1eh+mtF4KaNBqtEDNKMJUkZ9qtEfaEa7SRkNoxo9SDPaXcrodVSjP9KM9pAyWpxq9BDNaE8poyWoRn+iGX1WymhJqtHDNKO9pIxeTzV6hGb0OSmjpahGj9KMPi9ltDTV6M80oy9IGS1DNfoLzWhvKaM3UI3+SjPaR8poWarRYzSjiVJGb6Qa/Y1m9EUpo+WoRn+nGe0rZfQmqtE/aEZfkjJ6M9XocZrRflJGb6Ea/ZNm9GUpo7dSjZ6gGe0vZfQ2qtG/aEZfkTJ6O9XoSZrRAVJG76Aa/Ztm9FUpo+WpRk/RjA6UMnon0WixTDSjr0kZrUA1atGMDpIyehfVqE0z+rqU0bupRh2a0cFSRu+hGs1MMzpEyui9VKNZaEaTpIzeRzWalWY0Wcro/VSj2WhGU6SMPkA1mp1mdKiU0QepRnPQjA6TMvoQ1WhOmtE3pIxWpBrNRTM6XMpoJarR3DSjI6SMPkw1modmdKSU0cpUo3lpRt+UMlqFajQfzegoKaNVqUbz04y+JWW0GtVoAZrR0VJGq1ONFqQZfVvKaA2q0UI0o2OkjNakGi1MMzpWymgtqtEiNKPjpIzWphotSjP6jpTROlSjxWhGx0sZrUs16tKMTpAyWo9q1KMZnShltD7VaIBmdJKU0QZUo0Ga0clSRhtSjfo0o+9KGW1ENRpGMzpFymhjqtHraEanShl9hGq0OM3oNCmjTahGS9CMvidltCnVaEma0elSRptRjV5PM/q+lNHmVKOlaEZnSBl9lGq0NM3oB1JGW1CNlqEZnSlltCXVKDEr8qGU0ceoRsvSjM6SMtqKavRGmtGPpIw+TjVajmZ0tpTRJ6hGb6IZnSNltDXV6M00o3OljLahGr2FZnSelNG2VKO30ozOlzL6JNXobTSjH0sZDacavZ1mdIGU0aeoRu+gGf1Eymg7qtHyNKMLpYy2pxq9k2b0UymjEVSjFWhGF0kZ7UA1ehfN6GdSRjtSjd5NM7pYyujTVKP30Ix+LmU0kmr0XprRJVJGn6EavY9mdKmU0U5Uo/fTjC6TMhpFNfoAzehyKaOdqUYfpBldIWU0mmr0IZrRL6SMxlCNVqQZXSlltAvVaCWa0S+ljHalGn2YZnSVlNFYqtHKNKMhKaNxVKNVaEYhZTSearQqzehXUkYTqEar0YyuljLajWq0Os3oGimj3alGa9CMrpUy2oNqtCbN6Dopoz2pRmvRjK6XMvos1WhtmtENUkZ7UY3WoRndKGX0OarRujSjm6SMPk81Wo9mdLOU0ReoRuvTjH4tZbQ31WgDmtEtUkb7UI02pBndKmU0kWq0Ec3oNimjL1KNNqYZ3S5ltC/V6CM0ozukjL5ENdqEZvQbKaP9qEab0ozulDL6MtVoM5rRb6WM9qcabU4zukvK6CtUo4/SjO6WMjqAarQFzegeKaOvUo22pBn9TsroQKrRx2hG90oZfY1qtBXN6PdSRgdRjT5OM7pPyujrVKNP0IzulzI6mGq0Nc3oASmjQ6hG29CM/iBlNIlqtC3N6EEpo8lUo0/SjP4oZTSFajScZvSQlNGhVKNP0Yz+JGV0GNVoO5rRw1JG36AabU8zekTK6HCq0Qia0aNSRkdQjXagGf1ZyuhIqtGONKO/SBl9k2r0aZrRX6WMjqIajaQZPSZl9C2q0WdoRn+TMjqaarQTzejvUkbfphqNohn9Q8roGKrRzjSjx6WMjqUajaYZ/VPK6Diq0Ria0RNSRt+hGu1CM/qXlNHxVKNdaUZPShmdQDUaSzP6t5TRiVSjcTSjp6SMTqIajScZtTNJGZ1MNZpAM2pJGX2XarQbzagtZXQK1Wh3mlFHyuhUqtEeNKOZpYxOoxrtSTOaRcroe1Sjz9KMZhUwWgNhpDmHTy8jRUvc2dkyaHMITTa7jGwOGdmcMrK5ZGRzy8jmkZHNKyObT0Y2v4xsARnZgjKyhWRkC8vIFpGRLSojW0xG1pWR9WRkAzKyQRlZX0Y2TEb2OhnZ4jKyJWRkS8rIXi8jW0pGtrSMbBkZ2RtkZMvKyN4oI1tORvYmGdmbZWRvyaBsEq3nRJtzyr5VBuo2GSjaTDX27TJQd8jIlpeRvVNGtoKM7F0ysnfLyN4jI3uvjOx9MrL3y8g+ICP7oIzsQzKyFWVkK8nIPiwjW1lGtoqMbFUZ2WoystVlZGvIyNaUka0lI1tbRraOjGxdGdl6MrL1ZWQbyMg2lJFtJCPbWEb2ERnZJjKyTWVkm8nINpeRfVRGtoWMbEsZ2cdkZFvJyD4uI/tERmWTkwk9eVLTrWWI2sjItpWRfVJGNlxG9ikZ2XYysu1lZCNkZDvIyHaUkX1aRjZSRvYZGdlOMrJRMrKdZWSjZWRjZGS7yMh2lZGNlZGNk5GNl5FNkJHtJiPbXUa2h4xsTxnZZ2Vke8nIPicj+7yM7Asysr1lZPvIyCbKyL4oI9tXRvYlGdl+MrIvy8j2l5F9RUZ2gIzsqzKyA2VkX5ORHSQj+7qM7GAZ2SEyskkysskysikyskNlZIfJyL4hIztcRnaEjOxIGdk3ZWRHyci+JSM7Wkb2bRnZMTKyY2Vkx8nIviMjO15GdoKM7EQZ2UkyspNlZN+VkZ0iIztVRnaajOx7MrLTZWTfl5GdISP7gYzsTBnZD2VkZ8nIfiQjO1tGdo6M7FwZ2XkysvNlZD+WkV0gI/uJjOxCGdlPZWQXych+JiO7WEb2cxnZJTKyS2Vkl8nILpeRXSEj+4WM7EoZ2S9lZFfJyIZkZCEj+5WM7GoZ2TUysmtlZNfJyK6Xkd0gI7tRRnaTjOxmGdmvZWS3yMhulZHdJiO7XUZ2h4zsNzKyO2Vkv5WR3SUju1tGdo+M7HcysntlZL+Xkd0nI7tfRvaAjOwPMrIHZWR/lJE9JCP7k4zsYRnZIzKyR2Vkf5aR/UVG9lcZ2WMysr/JyP4uI/uHjOxxGdk/ZWRPyMj+JSN7Ukb2bxnZUyKyTiYZWUtG1paRdWRkM8vIZpGRzSojKzPjriMz464jM+OuIzPjriMz464jM+OuIzPjriMz464jM+OuIzPjriMz465TUEZWZsZdR2bGXUdmxl1HZsZdR2bGXUdmxl1HZsZdR2bGXUdmxl1HZsZdR2bGXUdmxl1HZsZdR2bGXUdmxl1HZsZdR2bGXUdmxl1HZsZdR2bGXUdmxl1HZsZdR2bGXUdmxl1HZsZd5xYZWZmpdJ3bZGRl5sh1ZObIdWTmyHXulJGVmSPXkZkj15GZI9eRmSPXkZkj15GZI9eRmSPXkZkj15GZI9eRmSPXkZkj15GZI9eRmSPXkZkj15GZI9eRmSPXkZkj15GZI9eRmSPXkZkj15GZI9eRmSPXkZkj15GZI9eRmSPXkZkj15GZI9eRmSPXkZkj15GZI9eRmSPXaSIjKzNHriMzR64jM0euIzNHriMzR64jM0euIzNHriMzR64jM0eu84SMrMz8t47M/LeOzPy3jsz8t47M/LeOzPy3jsz8t47M/LeOzPy3jsz8t47M/LeOzPy3jsz8t47M/LeOzPy3jsz8t47M/LeOzPy3jsz8t47M/LeOzPy3TqyMrMz8t47M/LeOzPy3jsz8t47M/LeOzPy3jsz8t47M/LeOzPy3jsz8t47M/LeOzPy3jsz8t47M/LeOzPy3jsz8t47M/LeOzPy3jsz8t47M/LeOzPy3jsz8t47M/LeOzPy3jsz8t47M/LeOzPy3jsz8t47M/LeOzPy3jsz8t06yjKzM/LeOzPy3jsz8t47M/LeOzPy3jsz8t47M/LeOzPy3jsz8t47M/LeOzPy3jsz8t47M/LeOzPy3jsz8t47M/LeOzPy3jsz8t47M/LeOzPy3jsz8t47M/LeOzPy3jsz8tw5p/tsGEZ1jYnvWiY6MT6m73elQs1btOnXr1W/QsFHjR5o0bdb80RYtH2v1+BOt27R9Mvypdu0jOnR8OvKZTlGdo2O6dI2Ni0/o1r1Hz2d7Pff8C71DfUKJoRdDfUMvhfqFXg71D70SGhB6NTQw9FpoUOj10ODQkFBSKDmUEhoaGhZ6IzQ8NCI0MvRmaFTordDo0NuhMaGxoXGhd0LjQxNCE0OTQpND74amhKaGpoXeC00PvR+aEfogNDP0YWhW6KPQ7NCc0NzQvND80MehBaFPQgtDn4YWhT4LLQ59HloSWhpaFloeWhH6IrQy9GVoVSgUQuir0OrQmtDa0LrQ+tCG0MbQptDm0NehLaGtoW2h7aEdoW9CO0PfhnaFdof2hL4L7Q19H9oX2h86EPohdDD0Y+hQ6KfQ4dCR0NHQz6FfQr+GjoV+C/0e+iN0PPRn6ETor9DJ0N+hU7AywbJg2bAcWJlhZYGVFVY2WNlh5YCVE1YuWLlh5YGVF1Y+WPlhFYBVEFYhWIVhFYFVFFYxWC4sD1YAVhCWDysM1nWwisMqAaskrOthlYJVGlYZWDfAKgvrRljlYN0E62ZYt8C6FdZtsG6HdQes8rDuhFUB1l2w7oZ1D6x7Yd0H635YD8B6ENZDsCrCqgTrYViVYVWBVRVWNVjVYdWAVRNWLVi1YdWBVRdWPVj1YTWA1RBWI1iNYT0CqwmsprCawWoO61FYLWC1hPUYrFawHof1BKzWsNrAagvrSVjhsJ6C1Q5We1gRsDrA6gjraViRsJ6B1QlWFKzOsKJhxcDqAqsrrFhYcbDiYSXA6garO6wesHrCehZWL1jPwXoe1guwesPqAysR1ouw+sJ6CVY/WC/D6g/rFVgDYL0KayCs12ANgvU6rMGwhsBKgpUMKwXWUFjDYL0BazisEbBGwnoT1ihYb8EaDettWGNgjYU1DtY7sMbDmgBrIqxJsCbDehfWFFhTYU2D9R6s6bDehzUD1gewZsL6ENYsWB/Bmg1rDqy5sObBmg/rY1gLYH0CayGsT2EtgvUZrMWwPoe1BNZSWMtgLYe1AtYXsFbC+hLWKlghWID1FazVsNbAWgtrHaz1sDbA2ghrE6zNsL6GtQXWVljbYG2HtQPWN7B2wvoW1i5Yu2HtgfUdrL2wvoe1D9Z+WAdg/QDrIKwfYR2C9ROsw7COwDoK62dYv8D6FdYxWL/B+h3WH7COw/oT1glYf8E6CetvWKdgZ4JtwbZhO7Azw84COyvsbLCzw84BOyfsXLBzw84DOy/sfLDzwy4AuyDsQrALwy4CuyjsYrBd2B7sAOwgbB92GOzrYBeHXQJ2SdjXwy4FuzTsMrBvgF0W9o2wy8G+CfbNsG+BfSvs22DfDvsO2OVh3wm7Auy7YN8N+x7Y98K+D/b9sB+A/SDsh2BXhF0J9sOwK8OuArsq7Gqwq8OuAbsm7Fqwa8OuA7su7Hqw68NuALsh7EawG8N+BHYT2E1hN4PdHPajsFvAbgn7MditYD8O+wnYrWG3gd0W9pOww2E/Bbsd7PawI2B3gN0R9tOwI2E/A7sT7CjYnWFHw46B3QV2V9ixsONgx8NOgN0NdnfYPWD3hP0s7F6wn4P9POwXYPeG3Qd2IuwXYfeF/RLsfrBfht0f9iuwB8B+FfZA2K/BHgT7ddiDYQ+BnQQ7GXYK7KGwh8F+A/Zw2CNgj4T9JuxRsN+CPRr227DHwB4Lexzsd2CPhz0B9kTYk2BPhv0u7Cmwp8KeBvs92NNhvw97BuwPYM+E/SHsWbA/gj0b9hzYc2HPgz0f9sewF8D+BPZC2J/CXgT7M9iLYX8OewnspbCXwV4OewXsL2CvhP0l7FWwQ7AB+yvYq2Gvgb0W9jrY62FvgL0R9ibYm2F/DXsL7K2wt8HeDnsH7G9g74T9LexdsHfD3gP7O9h7YX8Pex/s/bAPwP4B9kHYP8I+BPsn2IdhH4F9FPbPsH+B/SvsY7B/g/077D9gH4f9J+wTsP+CfRL237BPwckExzx1bTgOnMxwssDJCicbnOxwcsDJCScXnNxw8sDJCycfnPxwCsApCKcQnMJwisApCqcYHBeOBycAJwjHhxMG5zo4xeGUgFMSzvVwSsEpDacMnBvglIVzI5xycG6CczOcW+DcCuc2OLfDuQNOeTh3wqkA5y44d8O5B869cO6Dcz+cB+A8COchOBXhVILzMJzKcKrAqQqnGpzqcGrAqQmnFpzacOrAqQunHpz6cBrAaQinEZzGcB6B0wROUzjN4DSH8yicFnBawnkMTis4j8N5Ak5rOG3gtIXzJJxwOE/BaQenPZwIOB1MAd8U201h3BSxTcHZFIdNIdcUXU2B1BQzTeHRFAlNQc8U30yhzBS1TAHKFItMYccUYUzBxBQ3TCHCFA3MAL8ZjDcD52aQ2wxIm8FjM9BrBmXNAKoZ7DQDk2YQ0Qz4mcE5M5BmBr3MAJUZTDIDP2aQxgyomMEPM1BhBhXMAIDprJuOtekEmw6r6VyajqDptJkOlukMmY6L6WSYDoF5eTcv2ual2LzAmpdN82JoXuLMC9fUJhHxCbHR1cPjw7dnqpnJsp3MWbJmy54jZ67cefLmy1+gYKHCRYoWc71A0A+7rniJkteXKl3mhrI3lrvp5ltuve32O8rfWeGuu++59777H3jwoYqVHq5cpWq16jWGDNmeqVRy4oQq7SJjmyWvXpPt4K+rlnccMuTcV49e/lXry79qe/lXnS//Kj559eCtB795KefrP/3zVY/Ltwq9ksZ3Q5NXz7r7lgfytLyhzz/fIXPPy/WQ+cU0tsza53JJZH0xrS9Xp/Xl1jQ0c7ppbJlzQRqWci5N4+e5/0zj57n/SuPLPHXS+rJZGpr5k9PYssDdaVgqUCmNnxeKT+Pnhbql9eWStL78Kg3NYrnT2LLYjDQsFZuXxs+9n9L4uXckjS8DFS/4cmTylhvDz/Rn2raL6dwlPD7yqaiItjGx4e3M/3WLiI2LjIlu2z02vEuXiNjtmYomTqwWEx0Xn5I4qXpkbES7eDtxcp3o+IiOEbHjm1e488pdoUt/b2Xo932qX/r7TBlrv3rihGrhUVFJuc7rvNskIspAd4vImBPTX7tMwc6ownunvbQ3d6hqMV16nkeqfqGnC8TPOs9zzc6rMzif0DQ+pktScjpOLzlG1SbWjIyIuvLfyOWedPaefY40f+K0mjGxEZEdo0//57AtpRPiI6Mi43ue7X1XO3+yNjpzrj569lQdMiQpcfrZjnSV9u1jI+LizrtISpzUNLJzl6iIs3b+aewSs5kztCt6VE+cVjUyOvx0tz2+UZdh/6g479Y3TTd7Ojz6tErqyXq+kUl1Ezp3qdMh+fwPiiROrxPd/qzTdK+Qe/4luLh12bFNH9W9s3PihGbmak1KTv39P5fqOeLkWXER8W3jIqLbR8S27RAT2zY+vGOc/qVd4xov7RrnTpvc13x6W5crOOyXtn2h+PgGMd0uupjOb8910deQvuj/9dqd2yU2slt4fETTiPimZ84784/NzFmXxtWaKi5yvdb4H3i9fhgV0/GfJ/L5J3Fz5cu1zTVerm3OnSkVLz8xM3ZIMwUuV8jCfrlmvlDcOL8AvHrqh39afaf5fZdsVCP1Q/ob1Uz9kP5GtVI/pL9R7dQP6W9UJ/VD+hvVTf2Q/kb1Uj+kv1H91A/pb9Qg9UP6GzVM/ZD+Ro1SP6S/UePUD+lv9Ejqh/Q3apL6If2NmqZ+SH+jZqkf0t+oeeqH9Dd6NPVD+hu1SP2Q/kYtUz+kv9FjqR/S36hV6of0N3o89UP6Gz2R+uHCjdJ/ll7rE7DGNd9o3EvdZU69+16mnTVj2l7aTzZrvHmyXvhQsy5s4dJn2NXeg61LGk9t4nzzlzPb5/bGP4/UCw/MRf+S+ULLF/1Llktuy+aBUunSfWxf2PS1vtm1vuZzwBI8B+z/ReeAw3kOOBc2fXabOtf8Tt3mv3qnTvOgZrv0oDqpO+Si/ZM9dYOLvs+RumvTbCDnpBpdE8Kj4i5s47xWtsveiHPWTpxQPya8/fkvsqb+aKKhjI24vOWsabec/VK07KmnS5o/yHHpD3Kk/mDCaZ9JVS7unzS65rfOdM/2LJef7XZ69v/tEnEu+NGFfamp54ZB6seY0buh6XefEqfUjgjvUiU2NrznBadXFjfdX2RO+xdZraH/dMQues5OPLthUlr/6F725Rm2S39ytmNn8fTs2nD17Jr9dz27LQ9Fx8RHdujZ9vSITOfI6LaxEWbI9ewQbFxk+4i2ER06mO3NyGyCaTj2sk5gsf8lYzZ5/geO2VyxE3jmfLvSyE7e/2kjOwUuGZW97dzQTsMzJ7IZ4GkQGd3k/Fnc1JzENc6cw9XOnsK0EZ+L/P9/NvBT9D+8Pdxy7vYQEd01ISIhon3bLglPRUW2a9shIbpd/OnCTDtzDFJvB0Hl20Hta7wd1D5/jl3rS3bma36VJtwOslwofsWRnDPnF2Eop/y/3DMu69mcH1S67H33fPvp9TZqndvZBa/5DlT7v70DFbnkDlT2ojtQjXOXSuMzV0rNcxfK6S3//W0pvX+x0/0XJ/03qaEXv+Gk/V8XnxmXv0WV57nx1ea68QX+uxvfp2fua+eOa+rdLvL0EyQ6PGp7ptuV73T1rvFOV+/8uXyt96kslytkY7/TZb1Q/IoD27Q7XRpbpTlq/d/dDy/5lyypbs4erKIX95/rXGjpon+pm1Yx/GrfS+tcc1fVvvzueuF4yMV313KX7oas/zI8lcEzzcn48FS29Iensmb0kk+n753t8r531nT63h+fuyWd/o/GZz/+84RJSrv3nM1OSqfbaw/7r55G6f5LlmEZeDJl8OF1zW8V6R4vJ63jdUEr50ah/rXXltaFYKd5a0rrhcQ5ty8u3cROD/aad0a6A0eZM7gzLhoIvezG+u6lA/Bp7kSe95J6XO8lt/2HHbIy5zpk7WIjzLXfvm10QlRUZIfI1KGZLrExPXr+3x/TpEVytQ/A//tjmosfQgsv6u9UO3smNvznRPy/P6mhXMgfnG3G7BPTqTg9WDXy0p1Q5Bov2MI8J3mmVD/nhS+9tRD/vDJT4vSzx+nM5o26DD2/488Vei5r0778GGW/7MZEbN1Kr/VM46tHdrvsSKVeIOex/9kRyR9fePDO7OK2XRPMxRARHT/iUns5M/qcveT3uZgPY85U4XT2hz31XIMX7JZMqfsnnV9Z4xskRF1w3K64edOEp9JQv6gbc8F5cMnByHUe5/8BAnagZxZXFQA=",
-      "debug_symbols": "td3dbl7NeaXrc/G2N96q56fmzKk0gsBJuxsGDCdwJw0sBD73xb/nmrIXxNj+snbMkj6rBinxJilqzHv856/+52//+T/+9z/97g//61//z6/+4X/856/++Y+/+/3vf/e//+n3//ovv/n33/3rH95+9j9/9Xr/n5W/+ocVf/r1r5Yfvf1gv//gvP9g//pXp75e9tfL8/7y7f8VH7/k/b++/5r8+NH99qPX24/q/Uf77f8Rb7fl54v6fNGfL87ni+vzxduv67cbX58v1ueLt1fjvL2Izxf5+eLtlvvtRX++eLvlfovree33n95+NG/mP/37H3/72/f/8sPb/fa78W+/+eNv//Dvv/qHP/zH73//61/939/8/j8+/k//599+84ePl//+mz++/dfXr3/12z/8z7eXbxf+r9/9/rfvpz/9+vnVr5//0ut69devvq68XbCu+muv+AXpHTXhr/Vkn7/l1Z8L7vrpBfnzC6LnNYiTLsjX+bML6ucX7JwLdp+fXvDXvQZX/PSCb34P7r2/Lrgjfvp7cP3SN+Gb1yDPXND7/PAa7L/2gt09b8M+O/6uK3blXLGv5x056q9+Z1qvNa/Fev3wO7Hu9ddecU7MO+Q51/Vcsf78ivXNO8R1hz/P+nteib1X+K344b06Ov78lehv/kh3zB0ZP7CZr+vP7zjfvGefjudde//8juu7P5N8/89ffyi5n9+QXK+/95bcP71lv37527PXf8Md+5s/m9eZNyZf9/r52/LN63EfHzSub35Pv3kP2ZHzmWPHjx83/vK1+O6DZ23vqRX9d70e5/Y5ZP38hn1+6e/Ft8Bdl9+KHz8G/wX1+/7mjtXu2D98FL3+/LWI7z4RrGs+BL59TnjeLyL//H0r1ncffHw2ue6+f37HN++fUXNF3M8bsuv+8xvimxte76/j5xWvuP++O9aa341YtX9+R333ic07V/5I6/o735Tz+vvelH4+aPRZv/yOH97N/6Y77udt+fGd4y/vyNf/v7+l9/3yatzXT1+N74h9vuraue6fEpvx3SeVWC+fVN4+GrrlL7/8/PaSev8U+nVJ/fAlw1//RfDKmjdm5Q831F/9FcOqM6ysuvfPbshvPoju58uWfb+e39H686/g8vru43A8n6N/eDP6z2+4f/lHwHr98o+AtX7pR8Davxz5b/9I7n186Pnha7i//CP57ku412pXZP3siqpf/rX9t3dc932e964fvgr8C0r+i0t2/XDJ/dNLvvtKss8976RnnZ/+NaO++1T/8rfWvfbrp3d8/wfTz6eVH/7e+Bd/MP3dO+kb6rfPkL1/+qHn+0suXwa+nTt+esk3HwSv19tfPH0jYN/9d74m/hoa6+7100u+/du8DyC76ufvrN/+0azX9fyO/H3Yvb3+c8XeP8Wur/+G9/a+f/l7+3n98vf2b9+Yv/JjyLe/pzt9NHy75Ge/p+e7T9Y7fYNg//Cp4S8+Q51v/nJ/wl82Tlw//I6u8ze8Gi+frfcPvxt/+Wp8d0X4PsWKc356xTe/n+d1+aLh7Xz/lLdz/TeQ/90l+1Xbu9ir8vXTS759c+59e3N+/Ivg33YJcM963T99Ta5vPvXfvjRdK66fvq9/+3qsaH82K+786evxzbtqX+7o64f3kb/hvazLe9mPX8T8Le+oV/jy+Lp+esV1vvsm8+v5/mTsn7+jfnvJ2zeN5guyt3O9/q5L3r5ncnynNF/xd/2xHNi9fXReP/lj+f4P1meGvvJnf7Df/5aGb5W+nfOnb8gdv/QN+faGv+oN+f6Gv+Z9/NtPK+G755H7p5/t7/PL/9ZyX7/8by33/Uv/1rJer1/+15bvL/krv82wXvsXf5/hv3hF/rpvNHz7/pHxvH/0T7/sePu7/3ef4J5/YXn7BLd++sFnvb75Rmn5JmX/8K3Wt6/Z/5ZX5O27A16Rft0/f0X+Oz7pf3vLX/1Z/796i/7KW9b6pR9Gvvt3o0z/bpT1F9+P+se3H/7mX373xz//N/H3f09eb29ZvP+z9Ps/Qd+fL/P19XJ9vdxfL+PrZX69rK+X/fXyfL38ui+/7quv++rrvvq6r77uq6/76uu++rqvvu6rr/vq677+uq+/7uuv+/rrvv66r7/u66/7+uu+/rqvv+47X/edr/vO133n677zdd/5uu983Xe+7jtf952v+66v+671/m8Aby/318u3+/LtT/nKr5dv971/6L/66+Xbfe9/Fb7e7nv/p8jr/nx5v75evjcF3v6Q7/3+yf/tZXy9zPevKN5e1tfLt/v67Z77vH9efHt5fb28P1++fcR6/6Lu/fB24/vfJt4+Ds7hvX9Q74ecQ82h3/+p5P1w5nDN4f46rNc7kO+Ht5uveD/k+z+rvB/e7rn6/dBzOO///P5+uOZwv3/yeTvs1xzWHPYc3l+x91/+XrH4uPm9ZPH5M+frrXgvWny8zu9Vi4/De9ni87C+XtWPwsXHIeaQc6g5zJsc8ybHvMnvsHy8pTlv8jsun4f99ba/g3K/v4bvpHweeg5nDtcc7vdP3m+Hd1w+D2sOew4xh5xDzaHncOZwzWFu7rm55+aem3tu7rm55+aem3tu7rm55+YzN5+5+czNZ24+c/OZm8/cfObmMzefufmam6+5+Zqbr7n5mpuvufmam6+5+Zqbr7n5npvvufmem++5+Z6b77n5npvvufmem++vm/frNYc1hz2HmEPOoebQczhzuOYwN6+5ec3Na25ec/Oam9fcvObmNTevuXnNzXtu3nPznpv33Lzn5j0377l5z817bt5zc8zNMTfH3Bxzc8zNMTfH3Bxzc8zNMTfn3Jxzc87NOTfn3Jxzc87NOTfn3DwM7mFwD4N7GNzD4B4G9zC4h8E9DO5hcA+Dexjcw+AeBvcwuIfBPQzuYXAPg3sY3MPgHgb3MLiHwT0M7mFwD4N7GNzD4B4G9zC4h8E9DO5hcA+Dexjcw+AeBvcwuIfBPQzuYXAPg3sY3MPgHgb3MLiHwT0M7mFwD4MxDMYwGMNgDIMxDMYwGMNgDIMxDMYwGMNgDIMxDMYwGMNgDIMxDMYwGMNgDIMxDMYwGMNgDIMxDMYwGMNgDIMxDMYwGMNgDIMxDMYwGMNgDIMxDMYwGMNgDIMxDMYwGMNgDIMxDMYwGMNgDIMxDMYwGMNgDIMxDMYwGMNgDIMxDMYwGMNgDIMxDMYwGMNgDIMxDMYwGMNgDIMxDMYwGMNgDIMxDMYwGMNgDIMxDMYwGMNgDIMxDMYwGMNgDIMxDMYwGMNgDIMxDMYwGMNgDIMxDMYwGMNgDIMxDMYwGMNgDIM5DOYwmMNgDoM5DOYwmMNgDoM5DOYwmMNgDoM5DOYwmMNgDoM5DOYwmMNgDoM5DOYwmMNgDoM5DOYwmMNgDoM5DOYwmMNgDoM5DOYwmMNgDoM5DOYwmMNgDoM5DOYwmMNgDoM5DOYwmMNgDoM5DOYwmMNgDoM5DOYwmMNgDoM5DOYwmMNgDoM5DOYwmMNgDoM5DOYwmMNgDoM5DOYwmMNgDoM5DOYwmMNgDoM5DOYwmMNgDoM5DOYwmMNgDoM5DOYwmMNgDoM5DOYwmMNgDoM5DOYwmMNgDoM5DOYwmMNgDoM1DNYwWMNgDYM1DNYwWMNgDYM1DNYwWMNgDYM1DNYwWMNgDYM1DNYwWMNgDYM1DNYwWMNgDYM1DNYwWMNgDYM1DNYwWMNgDYM1DNYwWMNgDYM1DNYwWMNgDYM1DNYwWMNgDYM1DNYwWMNgDYM1DNYwWMNgDYM1DNYwWMNgDYM1DNYwWMNgDYM1DNYwWMNgDYM1DNYwWMNgDYM1DNYwWMNgDYM1DNYwWMNgDYM1DNYwWMNgDYM1DNYwWMNgDYM1DNYwWMNgDYM1DNYwWMNgDYM1DNYwWMNgDYM1DNYwWMNgDYM9DPYw2MNgD4M9DPYw2MNgD4M9DPYw2MNgD4M9DPYw2MNgD4M9DPYw2MNgD4M9DPYw2MNgD4M9DPYw2MNgD4M9DPYw2MNgD4M9DPYw2MNgD4M9DPYw2MNgD4M9DPYw2MNgD4M9DPYw2MNgD4M9DPYw2MNgD4M9DPYw2MNgD4M9DPYw2MNgD4M9DPYw2MNgD4M9DPYw2MNgD4M9DPYw2MNgD4M9DPYw2MNgD4M9DPYw2MNgD4M9DPYw2MNgD4M9DPYw2MNgD4M9DPYw2MNgD4M9DPYw2MNgD4M9DPYw2MNgD4NnGDzD4BkGzzB4hsEzDJ5h8AyDZxg8w+AZBs8weIbBMwyeYfAMg2cYPMPgGQbPMHiGwTMMnmHwDINnGDzD4BkGzzB4hsEzDJ5h8AyDZxg8w+AZBs8weIbBMwyeYfAMg2cYPMPgGQbPMHiGwTMMnmHwDINnGDzD4BkGzzB4hsEzDJ5h8AyDZxg8w+AZBs8weIbBMwyeYfAMg2cYPMPgGQbPMHiGwTMMnmHwDINnGDzD4BkGzzB4hsEzDJ5h8AyDZxg8w+AZBs8weIbBMwyeYfAMg2cYPMPgGQbPMHiGwTMMnmHwDINnGDzD4BkGzzB4DYPXMHgNg9cweA2D1zB4DYPXMHgNg9cweA2D1zB4DYPXMHgNg9cweA2D1zB4DYPXMHgNg9cweA2D1zB4DYPXMHgNg9cweA2D1zB4DYPXMHgNg9cweA2D1zB4DYPXMHgNg9cweA2D1zB4DYPXMHgNg9cweA2D1zB4DYPXMHgNg9cweA2D1zB4DYPXMHgNg9cweA2D1zB4DYPXMHgNg9cweA2D1zB4DYPXMHgNg9cweA2D1zB4DYPXMHgNg9cweA2D1zB4DYPXMHgNg9cweA2D1zB4DYPXMHgNg9cweA2D1zB4DYPXMHgNg9cweA2D1zB4DYPXMHgNg9cweA+D9zB4D4P3MHgPg/cweA+D9zB4D4P3MHgPg/cweA+D9zB4D4P3MHgPg/cweA+D9zB4D4P3MHgPg/cweA+D9zB4D4P3MHgPg/cweA+D9zB4D4P3MHgPg/cweA+D9zB4D4P3MHgPg/cweA+D9zB4D4P3MHgPg/cweA+D9zB4D4P3MHgPg/cweA+D9zB4D4P3MHgPg/cweA+D9zB4D4P3MHgPg/cweA+D9zB4D4P3MHgPg/cweA+D9zB4D4P3MHgPg/cweA+D9zB4D4P3MHi/M3jV+yHmkHOoOfQczhyuOdxfh3cGPw9rDnPzPTffc/M9N99z8z0333Pz/XXz27+/v5yW03YKp3Qqp3Y6TpeTjCVjyVgylowlY8lYMpaMJWPJ2DK2jC1jy9gytowtY8vYMraMkBEyQkbICBkhI2SEjJARMlJGykgZKSNlpIyUkTJSRsooGSWjZJSMklEySkbJKBklo2W0jJbRMlpGy2gZLaNltIwj48g4Mo6MI+PIODKOjCPjyLhkXDIuGZeMS8Yl45JxybhkXDJuGbeMW8Yt45Zxy7hl3DJuGThfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84/yjufFaUUmvpg/OPklLqLX18cs6P0z2nj0/Pn6fltJ3CKZ3eP9995H58kv48HafL6Z7Txyfqz9Ny2k7hlE4yWkbLaBkt48g4Mo6MI+PIODKOjCPjyDgyLhmXjEvGJeOSccm4ZFwyLhmXjFvGLeOWccu4Zdwybhm3jFvGPRmfhZ/P03LaTuGUTuXUTsfpcpKxZCwZS8aSsWQsGUvGkrFkLBlbxpaxZWwZW8aWsWVsGVvGlhEyQkbICBkhI2SEjJARMkJGykgZKSNlpIyUkTJSRspIGSWjZJSMklEycL5xvnG+cb5xvnG+cb5xvnG+cb5xvnG+cb5xvnG+cb5xvnG+cb5xvnG+cb5xvnG+cb5xvnG+cb5xvnG+cb5xvnG+cb5xvnG+cb5xvnG+cb5xvnG+cb5xvnEeOA+cB84D54HzwHngPHAeOA+cB84D54HzwHngPHAeOA+cB84D54HzwHngPHAeOA+cB84D54HzwHngPHAeOA+cB84D54HzwHngPHAeOA+cB84D54HzwHngPHAeOA+cB84D54HzwHngPHAeOA+cB84D54HzwHngPHAeOA+cB84D54HzwHngPHAeOA+cB84D54HzwHngPHAeOA+cB84D54HzwHngPHAeOA+cB84D54HzwHngPHAeOA+cB84D54nzxHniPHGeOE+cJ84T54nzxHniPHGeOE+cJ84T54nzxHniPHGeOE+cJ84T54nzxHniPHGeOE+cJ84T54nzxHniPHGeOE+cJ84T54nzxHniPHGeOE+cJ84T54nzxHniPHGeOE+cJ84T54nzxHniPHGeOE+cJ84T54nzxHniPHGeOE+cJ84T54nzxHniPHGeOE+cJ84T54nzxHniPHGeOE+cJ84T54nzxHniPHGeOE+cJ84T54nzxHniPHFeOC+cF84L54XzwnnhvHBeOC+cF84L54XzwnnhvHBeOC+cF84L54XzwnnhvHBeOC+cF84L54XzwnnhvHBeOC+cF84L54XzwnnhvHBeOC+cF84L54XzwnnhvHBeOC+cF84L54XzwnnhvHBeOC+cF84L54XzwnnhvHBeOC+cF84L54XzwnnhvHBeOC+cF84L54XzwnnhvHBeOC+cF84L54XzwnnhvHBeOC+cF84L54XzwnnhvHBeOC+cF84L543zxnnjvHHeOG+cN84b543zxnnjvHHeOG+cN84b543zxnnjvHHeOG+cN84b543zxnnjvHHeOG+cN84b543zxnnjvHHeOG+cN84b543zxnnjvHHeOG+cN84b543zxnnjvHHeOG+cN84b543zxnnjvHHeOG+cf9a3+uMUTun0/v3E++PUTsfpPeP1cbrn5z6+3/55Wk7bKZzSScaRcWR8fL/98yTjknHJuGRcMi4Zl4xLxiXjknHJuGXcMm4Zt4xbxi3jlnHLuGXck/FR8vo6LaftFE7pVE7tdJwuJxlLxpKxZCwZS8aSsWQsGUuGp1+Px1+P51+PB2A/ul9fJxlbxpaxZWwZW0bICBkhI+Z997MG9nmS8fFcbH2cjtPldH89I/tRBvs6LaftFE7pVE7vb8fr43Sc3t+O9ydrP8tg6+O0nLZTOKXT178qL5WwpRO2lMKWVthSC1t6YUsxbGmGLdWwpRu2lMOWdthSD1vneW72eXD2eXL2eXT2eXb2eXj2eXr2h8dnZTwP0HqCVlVs6YotZbGlLbbUxZa+2FIYWxpjS2Vs6YwtpbGlNbbUxpbe2FIcW5pjS3Vs6Y4t5bGlPbbUx5b+2FIgWxpkS4Vs6ZAtJbKlRbbUyJYe2VIkW5pkS5Vs6ZItZbKlTbbUyZY+2VIoWxplS6Vs6ZQtpbKlVbbUypZe2VIsW5plS7Vs6ZYt5bKlXbbUy5Z+2VIwWxpmS8Vs6ZgtJbOlZbbUzJae2VI0W5pmS9Vs6ZotZbOlbbbUzZa+2VI4WxpnS+Vs6ZwtpbOldbbUzpbe2VI8W5pnS/Vs6Z4t5bOlfbbUz5b+2VJAWxpoSwVt6aAtJbSlhbbU0JYe2lJEW5poSxVt6aItZbR1PU/KP4/KP8/KPw/LP0/LP4/LP8/LPw/M//DEvAycK6YtzbSlmrZ005Zy2tJOW+ppSz9tKagtDbWlorZ01JaS2tJSW2pqS09tKaotTbWlqrZ01Zay2tJWW+pqS19tKawtjbWlsrZ01pbS2tJaW2prS29tKa4tzbWlurZ015by2tJeW+prS39tKbAtDbalwrZ02JYS29JiW2psS49tKbItTbalyrZ02ZYy29JmW+psS59tKbQtjbal0rZ02pZS29JqW2ptS69tKbYtzbal2rZ025Zy29JuW+ptS79tKbgtDbel4rZ03JaS29JyW2puS89tKbotTbel6rZ03Zay29J2W+puS99tKbwtjbel8rZ03taN8xvnN85vnN84v3F+4/x+3BiPHOOxYzx6jMeP8QgyHkPGo8h4HBk/SDK+Mvbr0WQ8noxHlPGYMh5VxuPKeGQZjy3j0WXwZbwIM16MGS/KjBdnxos048Wa8aLNePFmvIgzXswZL+qMF3fGizzjxZ7xos948We8CDReDBovCo0Xh8aLROPFovGi0XjxaLyINF5MGi8qjReXxotM48Wm8aLTePFpvAg1XowaL0qNF6fGi1TjxarxotV48Wq8iDVezBovao0Xt8aLXOPFrvGi13jxa7wINl4MGy+KjRfHxotk48Wy8aLZePFsvIg2XkwbL6qNF9fGi2zjxbbxott48W28CDdejBsvyo0X58aLdOPFuvGi3XjxbryIN17MGy/qjRf3xot848W+8aLfePFvvAg4XgwcLwqOFwfHi4TjxcLxouF48XC8iDheOF84XzhfOF84XzhfOF84XzhfOF+PF+cHMY6MR43zuHEeOc5jx3n0OI8f5xHk4HzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOGcw2qTWG0Wq01jtXmsNpHVZrLaVFaby2qTWW02q01ntfmsNqHVZrTalFab02qTWm1Wq01rtXmtNrHVZrba1Fab22qTW212q01vtfmtNsHVZrjaFFeb42qTXG2Wq01ztXmuNtHVZrraVFeb62qTXW22q013tfmuNuHVZrzalFeb82qTXu3HevVorx7v1SO+esxXj/rqcV898qvHfvXorx7/1SPAegxYjwLrcWA9EqzHgvVosB4P1iPC+sGE9aiwfnBhyXhsWI8O6/FhPUKsx4j1KLFw/kixHivWo8V6vFiPGOsxYz1qrMeN9cixHjvWo8d6/FiPIOsxZD2KrMeR9UiyHkvWo8l6PFmPKOsxZT2qrMeV9ciyHlvWo8t6fFmPMOsxZj3KrMeZ9UizHmvWo816vFmPOOsxZz3qrMed9cizHnvWo896/FmPQOsxaD0Krceh9Ui0HovWo9F6PFqPSOsxaT0qrcel9ci0HpvWo9N6fFqPUOsxaj1Krcep9Ui1HqvWo9V6vFqPWItZa1NrbW6tTa612bU2vdbm19oEW5tha1NsbY6tTbK1WbY2zdbm2dpEW5tpa1Ntba6tTba12bY23dbm29qEW5txa1Nubc6tTbq1Wbc27daOx333yO8e+90P+jsZjwDvMeA9CrzHgfdI8HBOwbU5uDYJ12bh2jRcm4drE3FtJq5NxbW5uDYZ12bj2nRcm49rE3JtRq5NybU5uTYp12bl2rRcm5drE3NtZq5NzbW5uTY512bn2vRcm59rE3Rthq5N0bU5ujZJ12bp2jRdm6drE3Vtpq5N1bW5ujZZ12br2nRdm69rE3Ztxq5N2bU5uzZp12bt2rRdm7drE3dt5q5N3bW5uzZ512bv2vRdm79rE3htBq9N4bU5vDaJ12bx2jRem8drE3ltJq9N5bW5vDaZ12bz2nRem89rE3ptRq9N6bU5vTap12b12rRem9drE3ttZq9N7bW5vTa512b32vRem99rE3xthq9N8bU5vjbJ187HdvnoLh/f5SO8/MF4KeNxXj7Sy8d6+WgvcU74tRm/NuXX5vzapF+b9WvTfm3er038tZm/NvXX5v7a5F+b/WvTf23+r00AthnANgXY5gDbJGCbBWzTgG0esE0EtpnANhXY5gLbZGCbDWzTgW0+sE0IthnBNiXY5gTbpGCbFWzTgm1esE0MtpnBNjXY5gbb5GCbHWzTg21+sE0QthnCNkXY5gjbJGGbJWzThG2esE0UtpnCNlXY5grbZGGbLWzThW2+sE0YthnDNmXY5gzbpGGbNWzThm3esE0ctpnDNnXY5g7b5GGbPWzTh23+sE0gthnENoXY5hDbJGKbRWzTiG0esU0ktpnENpXY5hLbZGKbTWzTiW0+sU0othnFNqXYrsdv+whuH8Pto7h9HLc/SG5lPJrbx3P7iG5xTi+2+cU2wdhmGNsUY5tjbJOMbZaxTTO2ecY20dhmGttUY5trbJONbbaxTTe2+cY24dhmHNuUY5tzbJOO7ZqnUXfN06i75mnUXfM06q55GnXXPI26a55G3TVPo+6ap1F3zdOou24Zt4xbxi3jlnHLmKdRd8/TqLvnadTd8zTq7nkadfc8jbp7nkbdPU+j7p6nUXfP06i7XzKWjCVjyVgylowlY8lYMpaMJWPL2DK2jC1jy9gytowtY8vYMkJGyAgZISNkhIyQETJCRshIGSkjZaSMlJEyUkbKSBkpo2SUjJJRMkpGySgZJaNklIyW0TJaRstoGS2jZbSMltEyjowj48g4Mo6MI+PIODKOjCPjknHJuGTgvHHeOG+cN84b543zxnnjvHHeOG+cN84b543zxnnj/OD84Pzg/OD84Pzg/OD84Pzg/OD84Pzg/OD84Pzg/OD84Pzg/OD84Pzg/OD84Pzg/OD84Pzg/OD84Pzg/OD84Pzg/OD84Pzg/OD84Pzg/OD84Pzg/OD84Pzg/OD8swXXH6fj9J5xfZzuOc1T5/vMU+f7zFPn+8xT5/vMU+f7sw/3eWqnr7brPtN23WfarvtM23WfabvuM632fabVvs+02veZVvs+02rfp2W0jJZxZBwZR8aRcWQcGUfGkXFkHBmXjEvGJeOSccm4ZFwyLhmXjEvGLeOWccu4Zdwybhm3jFvGLWNa7fuaVvu+ptW+r2m172ta7fuaVvu+ptW+r2m172ta7fuaVvu+XjKWjCVjyVgylowlY8lYMpaMJWPL2DK2jC1jy9gytowtY8vYMkJGyAgZISNkhIyQETJCRshIGSkjZaSMlJEyUkbKSBkpo2SUjJJRMkpGySgZOL9wfuH8wvmF8wvnF84vnF84v3B+4fzC+YXzC+cXzi+cXzi/cH7h/ML5hfML5xfOL5xfOL9wfuH8wvmF8wvnF84vnF84v3B+4fzC+YXzC+cXzi+cXzi/cH7h/Mb5jfMb5zfOb5zfOL9xfuP8xvmN8xvnN85vnN84v3F+4/zG+Y3zG+c3zm+c3zi/cX7j/Mb5jfMb5zfOb5zfOL9xfuP8xvmN8xvnN85vnN84v3F+4/zG+Y3zG+c3zm+c3zi/cX7j/Mb5jfMb5zfOb5zfOL9xfuP8xvmN8xvnN85vnN84v3F+4/zG+Y3zG+c3zm+c3zi/cX7j/Mb5jfMb5zfOb5zfOL9xfuP8xvmN8xvnN85vnN84v3F+4/zG+Y3zG+c3zm+c3zi/cX7j/Mb5jfMb5/dwHq/hPF7DebyG83gN5/EazuM1nMdrOI/XcB6v4TxeLxlLxpKxZCwZS8aSsWQsGUvGkrFlbBlbxpaxZWwZW8aWsWVsGSEjZISMkBEyQkbICBkhI2SkjJSRMlJGykgZKSNlpIyUUTJKRskoGSWjZJSMklEySkbLaBkto2W0jJbRMlpGy2gZR8aRcWQcGUfGkXFkHBlHxpFxybhkXDIuGZeMS8Yl45Jxybhk3DJuGbeMW8Yt45Zxy7hl3DJwvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnDOChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF599uP44Laft9P596vvjlE7l9J7x+jgdP3c53XOap84j5qnziHnqPD76cF8nGSHj4/vtnycZISNkpIyUkTJSRspIGSkjZaSMlFEySkbJKBklo2SUjJJRMkpGy2gZLaNltIyW0TJaRstoGUfGkXFkHBlHxpFxZBwZR8aRccm4ZFwyLhmXjEvGJeOSccm4ZNwybu+7t/fdW8Y75+fjvf2d869TO51P+0B89OG+TvfX6aMP93VaTtspnN7fjtfHqZze3474OL2Ttz5O95w+6P48Laft9NViCC240IILLbjQggstuNCCCy240IILLbjQggstuNCCCy240IILLbjQggstuNCCCy240IILLbjQggstuNCCCy24yGdv9hmcfRZnn8nZHzZnZTyrs8/s7LM7+wzPWp7VggstuNCCCy240IILLbjQggstuNCCCy240IILLbjQggstuNCCCy240IILLbjQggstuNCCCy240IILLbjQggstuNCCCy240IILLbjQggstuNCCCy240IILLbjQggstuNCCCy240IILLbjQggstuNCCCy240IILLbjQggstuNCCCy240IILLbjQggstuNCCCy240IILLbjQggstuNCCCy240IILLbjQggstuNCCCy240IILLbjQggstuNCCCy240IILLbjQggstuNCCCy240IILLbjQggstuNCCCy240IILLbjQggstuNCCCy240IILLbjQggstuNCCi3oWpp+J6Wdj+hmZflamf5iZlvEMTT9L08/UNM614EILLrTgQgsutOBCCy604EILLrTgQgsutOBCCy604EILLrTgQgsutOBCCy604EILLrTgQgsutODC9mYY3wzrm2F+M+xvhgHOsMAZJjjDBmcY4QwrnGGGM+xwhiHOsMQZpjjDFmcY4wxrnGGOM+xxhkHOsMgZJjnDJmcY5QyrnGGWM+xyhmHOsMwZpjnDNmcY5wzrnGGeM+xzhoHOsNAZJjrDRmcY6QwrnWGmM+x0hqHOsNQZpjrDVmcY6wxrnWGuM+x1hsHOsNgZJjvDZmcY7QyrnWG2M+x2huHOsNwZpjvDdmcY7wzrnWG+M+x3hgHPsOAZJjzDhmcY8QwrnmHGM/rZlH9G5Z9V+WdW/tmVf4blf1iWl/Fsyz/j8jg36Rk2PcOoZ1j1DLOeYdczDHuGZc8w7Rm2PcO4Z1j3DPOeYd8zDHyGhc8w8Rk2PsPIZ1j5DDOfYeczDH2Gpc8w9Rm2PsPYZ1j7DHOfYe8zDH6Gxc8w+Rk2P8PoZ1j9DLOfYfczDH+G5c8w/Rm2P8P4Z1j/DPOfYf8zDICGBdAwARo2QMMIaFgBDTOgYQc0DIGGJdAwBRq2QMMYaFgDDXOgYQ80DIKGRdAwCRo2QcMoaFgFDbOgYRc0DIOGZdAwDRq2QcM4aFgHDfOgYR80DISGhdAwERo2QsNIaFgJDTOhwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKF6xwwQoXrHDBChescMEKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwyQqXrHDJCpescMkKl6xwuedp1NzzNGrueRo19zyNmnueRs09T53nnqfOc89T57nnqfPc89R57pJRMkpGySgZJaNklIyS0TJaRstoGS2jZbSMltEyWsaRcWQcGUfGkXFkHBlHxpFxZFwyLhmXjEvGJeOSccm4ZFwyLhm3jFvGLeOWccu4Zdwybhm3jHnqPGOeOs+Yp84z5qnzjHnqPGOeOs+Yp84z5qnzjHnqPGOeOs94yVgylowlY8lYMpaMJWPJWDKWjC1jy9gytowtY8vYMraMLWPLCBkhI2SEjJARMkJGyAgZISNl4DxwHjgPnAfOA+eB88B54DxwHjgPnAfOA+eB88B54DxwHjgPnAfOA+eB88B54DxwHjgPnAfOA+eB88B54DxwHjgPnAfOA+eB88B54DxwHjgPnAfOA+eB88B54DxwHjgPnAfOA+eB88B54DxwHjhPnCfOE+eJ888WXH+cyuk94/o4Haf3z1H5cbrn9PH5/PO0nLZTOKXTV9s1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGTduoaRs1baOmbdS0jZq2UdM2atpGzcZ547xx3jhvnDfOG+eN88Z547xx3jhvnDfOG+eN88Z547xx3jhvnDfOG+eN88Z547xx3jhvnDfOG+eN88Z547xx3jhvnDfOD84Pzg/OD84Pzg/OD84Pzg/OD84Pzg/OD84Pzg/OD84Pzg/OD84Pzg/OD84Pzg/OD84Pzg/OD84Pzg/OD84Pzg/OD84Pzg/OD84Pzg/OD84Pzg/OD84Pzg/OD84Pzg/OD84Pzg/OD84Pzg/OD84Pzg/OWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnh8rMP1x+ne04fnH+e3r9PfX+ctlM4vWe8Pk7l59rpOF1O95zmqfP86MN9nWTcMj6+3/55knHLuGXcMu6vjProw32dltN2Cqd0Kqd2Ok6Xk4wlY8lYMpaMJWPJWDKWjCVjydgytowtY8vYMraMLWPL2DK2jJARMkJGyAgZISNkhIyQETJSRspIGSkjZaSMlJEyUkZ+ve/WZx/u8yTjnfN3S0F99OG+TulUn/aB+ujDfZ2O0+V0z+md86/Tcnp/O14fp3B6fzvi4/RO3vo4HafL6Z7TB92fp68WQ2nBlRZcacGVFlxpwZUWXGnBlRZcacGVFlxpwZUWXGnBlRZcacGVFlxpwZUWXGnBlRZcacGVFlxpwZUWXGnBlRZcacGVFlxpwZUWXGnBlRZcacGVFlxpwZUWXGnBlRZcacGVFlxpwZUWXGnBlRZcacGVFlxpwZUWXGnBlRZcacGVFlxpwZUWXGnBlRZcacGVFlxpwZUWXGnBlRZcacGVFlxpwZUWXGnBlRZcacGVFlxpwZUWXGnBlRZcacGVFlxpwZUWXGnBlRZcacGVFlxpwZUWXGnBlRZcacGVFlxpwZUWXGnBlRZcacGVFlxpwZUWXGnBlRZcacGVFlxpwZUWXGnBlRZcacGVFlxpwZUWXGnBlRZcacGVFlxpwZUWXGnBlRZcacGVFlxpwZUWXGnBlRZcacGVFlxpwZUWXGnBlRZcacGVFlxpwZUWXGnBlRZcacGVFlxpwZUWXGnBlRZcacGVFlxpwZUWXGnBlRZcacGVFlxpwZUWXGnBlRZcacGVFlxpwZUWXGnBlRZcacGVFlxpwZUWXGnBlRZcacGVFlxpwZUWXGnBlW3Uso1atlHLNmrZRi3bqGUbtWyjlm3Uso1atlHLNmrZRi3bqGUbtWyjlm3Uso1atlHLNmrZRi3bqGUbtWyjlm3Uso1atlHLNmrZRi3bqGUbtWyjlm3Uso1atlHLNmrZRi3bqGUbtWyjlm3Uso1atlHLNmrZRi3bqGUbtWyjlm3Uso1atlHLNmrZRi3bqGUbtWyjlm3Uso1atlHLNmrZRi3bqGUbtWyjlm3Uso1atlHLNmrZRi3bqGUbtWyjlm3Uso1atlHLNmrZRi3bqGUbtWyjlm3Uso1atlHLNmrZRi3bqGUbtWyjlm3Uso1atlHLNmrZRi3bqGUbtWyjlm3Uso1atlHLNmrZRi3bqGUbtWyjlm3Uso1atlHLNmrZRi3bqGUbtWyjlm3Uso1atlHLNmrZRi3bqGUbtWyjlm3Uso1atlHLNmrZRi3bqGUbtWyjlm3Uso1atlHLNmrZRi3bqGUbtWyjlm3Uso1atlHLNmrZRi3bqGUbtWyjlm3Uso1atlHLNmrZRi3bqGUbtWyjlm3Uso1atlHLNmrZRi3bqGUbtWyjlm3Uso1atlHLNmrZRi3bqGUbtWyjlm3Uso1atlHLNmqxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1yxwhUrXLHCFStcscIVK1xd8zRq3fM0at3zNGrd8zRq3fM0at3z1Hnd89R53fPUed3z1Hnd89R53S8Z89R53UvGkrFkLBlLxpKxZCwZS8aWsWVsGVvGlrFlbBlbxpaxZYSMkBEyQkbICBkhI2SEjJCRMlJGykgZKSNlpIyUkTJSRskoGSWjZJSMklEySkbJKBkto2W0jJbRMlpGy2gZLaNlHBlHxpFxZBwZR8aRcWQcGUfGJeOSccm4ZFwyLhmXjEvGJeOSccu4Zdwybhm3jFvGLeOWccsYzvs1nPdrOO/XcN6v4bxfw3m/hvN+Def9Gs77NZz36yVjyVgylowlY8lYMpaMJWPJWDK2jC1jy9gytowtY8vYMraMLSNkhIyQETJCRsgIGSEjZISMlJEyUkbKSBkpI2WkjJSRMkpGySgZJaNklIySUTJKRsloGS3jg/P+OIXTe8b1cSqn989R+XE6TpfTPaePz+efp+W0nb7arm0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmrbRm3bqG0btW2jtm3Uto3atlHbNmoHzgPngfPAeeA8cB44D5wHzgPngfPAeeA8cB44D5wHzgPngfPAeeA8cB44D5wHzgPngfPAeeA8cB44D5wHzgPngfPAeeA8cB44D5wHzgPngfPAeeA8cB44D5wHzgPngfPAeeA8cB44D5wHzgPngfPAeeA8cB44D5wHzgPngfPAeeA8cB44D5wHzgPngfPAeeA8cB44D5wnzhPnifPEeeI8cZ44T5wnzhPnifPEeeI8cZ44Z4VrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaFa1a4ZoVrVrhmhWtWuGaF688+XH+cjtPl9P596vv9NE+dd89T5/3Zh3t9nMLPpVM5tdNxupxklIyS8fH99s+TjJJRMkpGySgZJaNltIyW0TJaRstoGS2jZbSMI+PIODKOjCPjyDgyjowj48i4ZFwyLhmXjEvGJeOSccm4ZFwybhm3jFvGLeOWccu4Zdwybhljl+gzdok+Y5foM3aJPmOX6DN2iT5jl+gzdon+7MP1x+lykvHO+du37j+O6znu5xjvx/NxzPfj5y+r59jP8TzH6zneju/Ev32L/+O4Po5/+vWv/u9v/vi73/zz73/7f371D//59sP/9R9/+Jd//92//uHrh//+//zb/Jd//uPvfv/73/3vf/q3P/7rv/z2f/7HH3/7T7//1395/2+/er3/z/ub8j9W/3qvf3z7P6//70/t9596e3P+R+9fn/2Pv/78z+f+9ZXv/zmeX3F+vff7T6Wf2uvXu99/qvxUrl/nx0/1X0b96U//+Kf/Fw==",
+      "bytecode": "H4sIAAAAAAAA/+z9C7iN5ds3+pvNOcacYzPn2M0xBskuCUkIRdohoY2UijYqISm7TEKSZpIkMeckSUJCSJLskiRJ0pkkSUiSkIQkSfI/1fqv9Kx3/cY5re/1fI/1ruc9fsfvcLzP+F3X+bnGPe5x3/c5v+NKLywYs7H8nXe2e6hXx/Z3dut5Z+duvTr27NauS96dd3bs1qtnvx7d9f9HKjy8ucyM/NcbdWnX/v5G3fte2btb+8btunTJn3JDwxZNmxTmT2vduVe3jnl5p5U3vCg9zfCiiGWk2OWGFyU+ftTwqqTpVWdYqipjeVFZy4vKWV5U3lR5BdOrzjS9qqLpVWdZij/b8qIqlgOmquVF51hedK6lpvMsI9WwvKim5UXnW2qqYxmpruVFF1heVM9S00WWkRpYXnSx5UWXWmq63DJSQ8uLGlledEWW4UVN0vJnNurZuUuXzp1O/N9HlRg5smjkyPfLl/jP/y8tf0bDvLyOPXvd2rFn96KRBYXvl6/ZoUXPbbUmVl3Yssn8/Pw2bavU3tWs36IeBY23HSrar/8TSX/1Pw+7vvr2+09l2Fn/t8Oe+f//x/9iId5s2T2vY+cO3bud37Jjz669e7Xr1bl7t8JR/+fCaLn/578r/XPeOOn/PmuUpL8m6bMl/XVJn/PvyosKUy9hZcNrdAbTGryRcqgSxS+wiqnA2aYC57oosKqpwNdNBb5pKPBUjqI3Tvr33JP+/eZJ/56jR9I8SZ8v6QskfWHx1+Ec0zrMM63DIhdvVDVTgfNNBb7losBzTQUuMBW42NGRtOikf7910r8Xn/TvhXokvS3pSyT9HUlfWvx1qG5ah7dN6/CuizfqPFOBS0wFLnNRYA1Tge+YCnzP0ZH07kn/XnbSv9876d9L9UhaLunvS/oKSf+g+OtQ07QOy03rsNLFG1XLVOD7pgI/dFHg+aYCV5gKXOXoSFp50r8/POnfq0769wd6JH0k6asl/WNJl+KvQ23TOnxkWodPXLxRdUwFrjYVuMZFgXVNBX5sKvBTR0fSJyf9e81J//70pH+LHklrJf0zSV8n6Z8Xfx0uMK3DWtM6rHfxRl1oKvAzU4FfuCiwnqnAdaYCNzg6ktaf9O8vTvr3hpP+/bkeSV9K+kZJ/0rSNxV/Heqb1uFL0zpsdvFGXWQqcKOpwC0uCmxgKvArU4FfOzqSNp/07y0n/fvrk/69SY+krZL+jaRvk/Rvi78OF5vWYatpHba7eKMuMRX4janA71wUeKmpwG2mAnc4OpK2n/Tv7076946T/v2tHknfS/pOSd8l6buLvw6Xmdbhe9M6/ODijbrcVOBOU4F7XBTY0FTgLlOBPzo6kn446d97Tvr3jyf9e7ceSXsl/SdJ3yfp+4u/Do1M67DXtA4HXLxRjU0F/mQq8GcXBV5hKnCfqcCDjo6kAyf9++eT/n3wpH/v1yPpF0k/JOm/Svrh4q9DE9M6/GJah98crcNvJ/370En//vWkfx/WdTgi6b9L+lFJ/+Pf61BoMJ5lEh4z9F1St3R0nPLFrzBmqvDPFAOlXf+oqcI/L/932ymtIH9qq87dOnXp+HfXJ1W1aamPBWMf619lZBWzjCtSr9lfI3bt0aWjpB8vfmetoMhQhI5caHr3jls+jRklUg91CjVmlDB1807MnmKwEv9+z04r+uc9S728mflTGvbs2a7f5hIVLS+/zfKidpYXPWR5US/Li0zO9pYXVbe8qJvlRT0tL2preVF5y4tawdapF+xFnWGL2Qm2Tv0tL6ppedEAWE2mT0sebLp7YIdKR1hNPWDr1A9WeM//48RYgPwCLrB+4aR4UfG/cPQiSAcutM1v+mIyiC2XPhlp5f/9/ZV+it9fZ//P99f/a7+/msAK7/D/1q+mPNihYjroesPOy7gvuV6w6Uyflu6wder233su6AlbJ+D1UPG+Lk1fH9wvzIwT33HIL8zTQF+Yp/2XL8yMYt6k//evvctnCvuOHz/+zzOFjHRXzxQy0lM9UzhRyYmXWVYtw80zhYwCU40Z//NMIcWL/uea7H+eKfzPM4US//NMocT/Js8ULKf8k79wCotMDRr9/rdeS51mupZKP2a6lvI4u+KzPZX3ur7qqZx6gpOuejLdXPVU1pFth1eWg+sZnT1rZDHf55G2C3aP6U32ncKSphq1iqIsNVYxVeh38jHw6cC2j0EAdEsTKF/shfzr05pRZL4/S/2qDBM5WNxPvqeYn/xKwLP+qRwfqZagqg5r+5T5TQuafQrfTKnm1smzjRTbgZ7jYCHTz7EcvZb7yXNMhpCDk8WJ01mRYXbb6SzL9Kqwg286PRLCI4v7yfaOhn+nF2/As9EDVirGgKYrxAy/ftmavnT0hQHbSc2DVps+GoX/XG1F/vln1DpDGPRNGSl/Cl/oYf3f2U7ZYdMnMAbCxP4Xf5dl+PybXpVbzLOE7XD26IFqPpyR16JxJ1d6WmWO7Qsw4WD+yuav36Qrfcg2f0kH81cy60s50XvM85/u+ma3erFudku7udmtriPbzuVnOLjZ1dnPGOnkfdaTf8z0Ppc5z8n8uXryss1fo7g3+0Wmw7eM5U0tYwrSG0os/iOB8/Stt3xVnGfSlnXyJpbRgW0ni3Kga4Nyp3RtUNb0qvLFfBeNB1qF/9YDrfh3xfrYUk8H1hfm2t7vM50UGrQWGjQXWtHVNYRx/rNcPziqBnxwdCpnkVRLUOPEx9M2u2lBKxV3QX2Fxb0vTPGeaTP9G2tjPO3Ef510E3n2P/+sbLugsZw1z7a9rHL54keXdDX+89tSuP+vV51tevMqG1a2+I+Ey+r0bq6i9ComYfucV3E1f9I2f1VX85e0zX+Oq/lL2eav5mr+023zn1vcq1jbsNUtw17bsWv3nv2ad+vcqyh7c4mJejDq8aBvia6KFqaD/M9//nf6z9S/3+/iHs6ev06UZ9mOO8tN4St/13Fdj8LsIst3WQnr9+95uKFcXFDrsJWMFz62xa5ZzA95zv98yP+3/8//6kNeaL0aqmH6ctMX1rRdmdcwHca1inXOyDGdM9II54xa+EuJ/+Pci7wPOt/BapuX6HzcULWZjuq4oeq4uQCsa7hFdLY8dXFDXeBmeS5MOexp7pbnQtxQ9dwsT/2Uw6a7W576uKEucrM8DVIOm+FueRrghrrYzfJckvp7zd3yXIIb6lI3y3NZymG97pbnMtxQl7tZnoYph810tzwNcUM1crM8jVMOm+VueRrjhrrCzfI0STmsz93yNMENdaWb5Wmacli/u+VpihuqmZvlaZ5y2IC75WmOG+oqN8tzdcphg+6W52rcUNe4WZ5rUw6b7W55rsUN1cLN8lyXctgcd8tzHW6olm6W5/qUw4bcLc/1uKFucLM8rVIOG3a3PK1wQ93oZnluSjlsxN3y3IQb6mY3y9M65bBRd8vTGjdUGzfLc0vKYWPulucW3FC3ulme21IOm+tueW7DDXW7m+Vpm3LYuLvlaYsb6g43y3NnymET7pbnTtxQd7lZnnYph026W552uKHudrM87VMOW9Ld8rTHDdXBzfJ0TDlsKXfL0xE31D1ulqdTymFPd7c8nXBD3etmeTqnHLa0u+XpjBvqPjfLc3/KYc9wtzz344bq4mZ5uqYctoy75emKG6qbm+XpnnLYsu6WpztuqB5ulueBlMOWc7c8D+CG6ulmefJSDlve3fLk4Ybq5WZ5eqcctoK75emNG+pBN8vTJ+WwZ7pbnj64ofq6WZ5+KYet6G55+uGGesjN8vRPOexZ7panP26oh90sz4CUw1ZytzwDcEM94mZ5BqYc9mx3yzMQN9SjbpYnP+Wwld0tTz5uqMfcLM+glMNWcbc8g3BDPe5meQanHLaqu+UZjBvqCTfLMyTlsOe4W54huKGedLM8Q1MOW83d8gzFDfWUm+UZlnLYc90tzzDcUE+7WZ7hKYet7m55huOGesbN8oxIOex57pZnBG6okW6WpyDlsDXcLU8BbqhCN8uTOgxX093yFOGGGuVmeUanHLaWu+UZjRvqWTfLMyblsOe7W54xuKGec7M8Y1MOW9vd8ozFDfW8m+UZl3LYOu6WZxxuqBfcLM/4lMPWdbc843FDvehmeSakHPYCd8szATfURDfLMynlsBe6W55JuKFecrM8k1MOW8/d8kzGDfWym+WZknLY+u6WZwpuqKlulmdaymEvcrc803BDveJmeaanHLaBu+WZjhtqhpvlmZly2IvdLc9M3FCvulmeWSmHvcTd8szCDfWam+WZnXLYS90tz2zcUK+7WZ45KYe9zN3yzMEN9Yab5ZmbctjL3S3PXNxQb7pZnnkph23obnnm4Yaa72Z5FqQctpG75VmAG2qhm+VZlHLYxu6WZxFuqLfcLM/ilMNe4W55FuOGetvN8ixJOWwTd8uzBDfUO26WZ2nKYa90tzxLcUO962Z5lqUctqm75VmGG+o9N8uzPOWwzdwtz3LcUO+7WZ4VKYdt7m55VuCG+sDN8qxMOexV7pZnJW6oD90sz6qUw17tbnlW4Yb6yM3yrE457DXulmc1bqiP3SyPpBz2WnfLI7ihPnGzPGtSDtvC3fKswQ31qZvlWZty2OvcLc9a3FCfuVmedSmHbeluedbhhvrczfKsTzns9e6WZz1uqC/cLM+GlMPe4G55NuCG+tLN8mxMOWwrd8uzETfUV26WZ1PKYW90tzybcENtdrM8W1IOe5O75dmCG+prN8uzNeWwN7tbnq24ob5xszzbUg7b2t3ybMMN9a2b5dmectg27pZnO26o79wsz46Uw97ibnl24Ib63s3y7Ew57K3ulmcnbqhdbpZnd8phb3O3PLtxQ/3gZnn2pBz2dnfLswc31I9ulmdvymHbuluevbihfnKzPPtSDnuHu+XZhxtqv5vlOZBy2DvdLc8B3FA/u1megymHvcvd8hzEDfWLm+U5lHLYdu6W5xBuqF/dLM/hlMPe7W55DuOG+s3N8hxJOWx7d8tzBDfU726W52jKYTu4W56juKH+cLM8x1IO29Hd8hzDDfWnm+U5nnLYe9wtz3HYUJ4STpbHk5Zy2E7OlscwuXmo09wsT3rKYe91tzzpuKEy3CyPJ+Wwnd0tjwc3lNfN8mSmHPY+d8uTiRsqy83y+FIOe7+75fHhhvK7WZ5AymG7uFueAG6ooJvlyU45bFd3y5ONGyrHzfKEUg7bzd3yhHBDhd0sTyTlsN3dLU8EN1TUzfLEUg7bw93yxHBD5bpZnnjKYR9wtzxx3FAJN8uTTDlsT3fLk8QNVdLN8pRKOWyeu+UphRvqdDfLUzrlsL3cLU9p3FBnuFmeMimH7e1uecrghirrZnnKpRz2QXfLUw43VHk3y1Mh5bB93C1PBdxQZ7pZnooph+3rbnkq4oY6y83yVEo5bD93y1MJN9TZbpancsphH3K3PJVxQ1VxszxVUw7b393yVMUNdY6b5amWctiH3S1PNdxQ57pZnuophx3gbnmq44Y6z83y1Eg57CPulqcGbqiabpanVsphB7pbnlq4oc53szy1Uw77qLvlqY0bqo6b5ambcth8d8tTFzfUBW6W58KUwz7mbnkuxA1Vz83y1E857CB3y1MfN9RFbpanQcphH3e3PA1wQ13sZnkuSTnsYHfLcwluqEvdLM9lKYd9wt3yXIYb6nI3y9Mw5bBD3C1PQ9xQjdwsT+OUwz7pbnka44a6ws3yNEk57FB3y9MEN9SVbpanacphn3K3PE1xQzVzszzNUw47zN3yNMcNdZWb5bk65bBPu1ueq3FDXeNmea5NOexwd8tzLW6oFm6W57qUwz7jbnmuww3V0s3yXJ9y2BHulud63FA3uFmeVimHHelueVrhhrrRzfLclHLYAnfLcxNuqJvdLE/rlMMWulue1rih2rhZnltSDlvkbnluwQ11q5vluS3lsKPcLc9tuKFud7M8bVMOO9rd8rTFDXWHm+W5M+Wwz7pbnjtxQ93lZnnapRx2jLvlaYcb6m43y9M+5bDPuVue9rihOrhZno4phx3rbnk64oa6x83ydEo57PPulqcTbqh73SxP55TDjnO3PJ1xQ93nZnnuTznsC+6W537cUF3cLE/XlMOOd7c8XXFDdXOzPN1TDvuiu+Xpjhuqh5vleSDlsBPcLc8DuKF6Wpbnb0fzbp17FYU2l5goGXUk4wLJqCcZF0nGxZJxqWRcLhmNJOMKybhSMppJxlWScY1ktJCMlpJxg2TcKBk3S0YbybhVMm6XjDsk4y7JuFsyOkjGPZJxr2TcJxldJKObZPSQjJ6S0UsyHpSMvpLxkGQ8LBmPSMajkvGYZDwuGU9IxpOS8ZRkPC0Zz0jGSMkolIxRkvGsZDwnGc9LxguS8aJkaJEvScbLkjFVMl6RjBmS8apkvCYZr0vGG5LxpmTMl4yFkvGWZLwtGe9IxruS8Z5kvC8ZH0jGh5LxkWR8LBmfSMankvGZZHwuGV9IxpeS8ZVkbJaMryXjG8n4VjK+k4zvJWOXZPwgGT9Kxk+SsV8yfpaMXyTjV8n4TTJ+l4w/JONP8eghc5p4MsTjFU+WePziCYonRzxh8UTFkyuehHhKiud08ZwhnrLiKS+eM8VzlnjOFk8V8ZwjnnPFc554aornfPHUEc8F4qknnovEc7G2urWdqy1Lbctp60nbK9pC0Mfk+ihYH3fqIz19bKWPZvTxg95i622k3irp7YBe8uplnV666NezfgXpaVZPJfpx0UNi6t/v978+FoWpN7lPqy4ZZYssv5FRVjJqF1oOT32Z5cOYZziI//kwhkwfxjTjJyjjfNyHMa+Y56qC1G+K56/VPsuw2qfpK02r3cvBapuXqBduqN6nsNqpVie9ZpFh7nTDa2qa3osHie9FBvCPlPswHcA/eOzLdAD/MrEf0wH8E8KHmA7g3/r1ZzqAf5T3MNMB/Ou5AUwH8M/cHmE6gH+PNpDpAP7h2KNMB/AvvPKZDuCfYj3GdAD/ZmoQ0wH846bHmQ7gXyENZjqAfy70BNMB/LueIUwH8A9wnmQ6gH8pM5TpAP5Jy1NMB/BvT4YxHcA/Enma6QD+NcdwpgP4ZxfPMB3Av48YwXQA/5BhJNMB/IuDAqYD+KcBhUwHsIdfxHQAm+2jmA5gV3w00wFsXz/LdOThHGOYjt44x3NMRx+cYyzT0Q/neJ7p6I9zjGM6BuAcLzAdA3GO8UxHPs7xItMxCOeYwHQMxjkmMh1DcI5JTMdQnOMlpmMYzjGZ6RiOc7zMdIzAOaYwHQU4x1SmowjnmMZ0jMY5XmE6xuAc05mOsTjHDKZjHM4xk+kYj3O8ynRMwDlmMR2TcI7XmI7JOMdspmMKzvE60zEN55jDdEzHOd5gOmbiHHOZjlk4x5tMx2ycYx7TMQfnmM90zMU5FjAd83COhUzHApxjEdOxCOd4i+lYjHMsZjqW4BxvMx1LcY4lTMcynOMdpmM5zrGU6ViBc7zLdKzEOZYxHatwjveYjtU4x3KmQ3CO95mONTjHCqZjLc7xAdOxDudYyXSsxzk+ZDo24ByrmI6NOMdHTMcmnGM107EF5/iY6diKcwjTsQ3n+ITp2I5zrGE6duAcnzIdO3GOtUzHbpzjM6ZjD86xjunYi3N8znTswznWMx0HcI4vmI6DOMcGpuMQzvEl03EY59jIdBzBOb5iOo7iHJuYjmM4x2am4zjOsYXo8KThhvqa6UjHDbWV6fDghvqG6cjEDbWN6fDhhvqW6QjghtrOdGTjhvqO6QjhhtrBdERwQ33PdMRwQ+1kOuK4oXYxHUncULuZjlK4oX5gOkrjhtrDdJTBDfUj01EON9RepqMCbqifmI6KuKH2MR2VcEPtZzoq44Y6wHRUxQ31M9NRDTfUQaYDuE/DL0xHDdxQh5iOWrihfmU6auOGOsx0APf/+I3pAO7/cYTpAO7/8TvTAdz/4yjTAdz/4w+mA7j/xzGmA7j/x59MB3D/j+NMB27/D28JpgO3/4c3jenA7f/hPY3pwO3/4U1nOnD7f3gzmA7c/h9eD9OB2//D62U6cPt/eDOZDtz+H94spgO3/4fXx3Tg9v/w+pkO3P4f3gDTgdv/wxtkOnD7f3izmQ7c/h/eHKYDt/+HN8R04Pb/8IaZDtz+H94I04Hb/8MbZTpw+394Y0wHbv8Pby7Tgdv/wxtnOnD7f3gTBseMvx3Nu3XuVRTeXGKiePqIp694+onnIfH0F8/D4hkgnkfEM1A8j4onXzyPiWeQeB4Xz2DxPCGeIeJ5UjxDxfOUeIaJ52nxDBfPM+IZIZ6R4ikQT6F4isQzSjyjxfOseMaI5znxjBXP8+IZJ54XxDNePC+KZ4J4dPZJ4nlJPJPF87J4pohnqnimiecV8UwXzwzxzBTPq+KZJZ7XxDNbPK+LZ4543hDPXPG8KZ554pkvngXiWSieReJ5SzyLxfO2eJaI5x3xLBXPu+JZJp73xLNcPO+LZ4V4PhDPSvF8KJ5V4vlIPKvF87F4RDyfiGeNeD4Vz1rxfCaedeL5XDzrxfOFeDaI50vxbBTPV+LZJJ7N4tkinq/Fs1U834hnm3i+Fc928Xwnnh3i+V48O8WzSzy7xfODePaI50fx7BXPT+LZpw117UVrG1c7oNo81L6btqy026ONEu0x6ON5fbKtD4X1eao+itSnePoATJ8d6WMXfWKhN/t6n6y3mHp3pjc2ek+gl9N6JaoXcXr9o5cO+q2rX1h6rtfTpJ5h9MOpx7UeElP/fr/zZzTMy+vYs9etHXt2Lyoser98zQ4tem6rNbHqwpZN5ufnt2lbpfauZv0W9ShovO1Q0X49UCSjrHh6FxkOuxMvfLDQdKz3LjRM7E0W6+MYNn0c06wfx164j6PFcfLbUpB6tT0nVjvjLMNqp+srTatd0sFqm5eoJG6oUkRHBu6PCrynMx245q+3NNOBa/56z2A6cM1fbxmmA9f89ZZlOnDNX285pgPX/PWWZzpwzV9vBaYD1/z1nsl0AJu/FZkOYPP3LKYD2PytxHQAm79nMx3A5m9lpgPY/K3CdACbv1WZDmDz9xymA9j8rcZ0AJu/5zIdwOZvdaYD2Pw9j+kANn9rMB3A5m9NpgPY/K3FdACbv+czHcDmb22mA9j8rcN0AJu/dZkOYPP3AqYD2Py9kOkANn/rMR3A5m99piMP57iI6eiNczRgOvrgHBczHf1wjkuYjv44x6VMxwCc4zKmYyDOcTnTkY9zNGQ6BuEcjZiOwThHY6ZjCM5xBdMxFOdownQMwzmuZDqG4xxNmY4ROEczpqMA52jOdBThHFcxHaNxjquZjjE4xzVMx1ic41qmYxzO0YLpGI9zXMd0TMA5WjIdk3CO65mOyTjHDUzHFJyjFdMxDee4kemYjnPcxHTMxDluZjpm4RytmY7ZOEcbpmMOznEL0zEX57iV6ZiHc9zGdCzAOW5nOhbhHG2ZjsU4xx1MxxKc406mYynOcRfTsQznaMd0LMc57mY6VuAc7ZmOlThHB6ZjFc7RkelYjXPcw3QIztGJ6ViDc9zLdKzFOTozHetwjvuYjvU4x/1MxwacowvTsRHn6Mp0bMI5ujEdW3CO7kzHVpyjB9OxDed4gOnYjnP0ZDp24Bx5TMdOnKMX07Eb5+jNdOzBOR5kOvbiHH2Yjn04R1+m4wDO0Y/pOIhzPMR0HMI5+jMdh3GOh5mOIzjHAKbjKM7xCNNxDOcYyHQcxzkeJTo8aThHPtORjnM8xnR4cI5BTEcmzvE40+HDOQYzHQGc4wmmIxvnGMJ0hHCOJ5mOCM4xlOmI4RxPMR1xnGMY05HEOZ5mOkrhHMOZjtI4xzNMRxmcYwTTUQ7nGMl0VMA5CpiOijhHIdNRCecoYjoq4xyjmI6qOMdopqMazvEs0wHcp2EM01ED53iO6aiFc4xlOmrjHM8zHcD9P8YxHcD9P15gOoD7f4xnOoD7f7zIdAD3/5jAdAD3/5jIdAD3/5jEdAD3/3iJ6QDu/zGZ6QDu//Ey0wHc/2MK0wHc/2Mq0wHc/2Ma0wHc/+MVpgO4/8d0pgO4/8cMpgO4/8dMpgO4/8erTAdw/49ZTAdw/4/XmA7g/h+zmQ7g/h+vMx3A/T/mMB3A/T/eYDqA+3/MZTqA+3+8yXQA9/+Yx3QA9/+Yz3QA9/9YwHQA9/9YyHQA9/8w/FRQ/oy/Hc27de5VFNlcYqJ4TxdvafGeId4y4i0r3nLiLS/eCuI9U7wVxXuWeCuJ92zxVhZvFfFWFe854q0m3nPFW12854m3hnhrireWeM8Xb23x1hFvXfFeIN4LxVtPvPXFe5F4G4j3YvFeIt5LxXuZeC8Xb0PxNhJvY/FeId4m4r1SvE3F20y8zcV7lXivFu814r1WvC3Ee514W4r3evHeIN5W4r1RvDeJ92bxthZvG/HeIt5bxXubeG8Xb1vx3iHeO8V7l3jbifdu8bYXbwfxdhTvPeLtJN57xdtZvPeJ937xdhFvV/F2E2938fYQ7wPi7SnePPH2Em9v8T4o3j7i7SvefuJ9SLz9xfuweAeI9xHxDhTvo+LNF+9j4h0k3sfFO1i8T4h3iHifFO9Q8T4l3mHifVq8w8X7jHhHiHekeAvEW6gNde1FaxtXO6DaPNS+m7astNujjRLtMejjeX2yrQ+F9XmqPorUp3j6AEyfHeljF31ioTf7ep+st5h6d6Y3NnpPoJfTeiWqF3F6/aOXDvqtq19Yeq7X06SeYfTDqce1HhJT/36/82c0zMvr2LPXrR17di8qTN3YT6smGWX1ZTU7tOi5rdbEqgtbNpmfn9+mbZXau5r1W9SjoPG2Q0X79XX6KvGWKjQdnqUKDeN53yrWhzFi+jCmWT9BJXEfRovj5DelIPWb4jmx2hlnGVY7Q19pWu3FDlbbvETAnwR7m+jIAP5JwRKmA9j6fYfpALZ+lzIdwNbvu0wHsPW7jOkAtn7fYzqArd/lTAew9fs+0wFs/a5gOoCt3w+YDmDrdyXTAWz9fsh0AFu/q5gOYOv3I6YD2PpdzXQAW78fMx3A1q8wHcDW7ydMB7D1u4bpALZ+P2U6gK3ftUwHsPX7GdMBbP2uYzqArd/PmQ5g63c90wFs/X7BdABbvxuYDmDr90umA9j63ch0AFu/XzEdwNbvJqYD2PrdzHTk4RxbmI7eOMfXTEcfnGMr09EP5/iG6eiPc2xjOgbgHN8yHQNxju1MRz7O8R3TMQjn2MF0DMY5vmc6huAcO5mOoTjHLqZjGM6xm+kYjnP8wHSMwDn2MB0FOMePTEcRzrGX6RiNc/zEdIzBOfYxHWNxjv1Mxzic4wDTMR7n+JnpmIBzHGQ6JuEcvzAdk3GOQ0zHFJzjV6ZjGs5xmOmYjnP8xnTMxDmOMB2zcI7fmY7ZOMdRpmMOzvEH0zEX5zjGdMzDOf5kOhbgHMeZjkWwoTJLMB24nFdmGtOxBOc4jelYinOkMx3LcI4MpmM5zuFhOlbgHF6mYyXOkcl0rMI5spiO1TiHj+kQnMPPdKzBOQJMx1qcI8h0rMM5spmO9ThHDtOxAecIMR0bcY4w07EJ54gwHVtwjijTsRXniDEd23COXKZjO84RZzp24BwJpmMnzpFkOnbjHCWZjj04RymmYy/OcTrTsQ/nKM10HMA5zmA6DuIcZZiOQzhHWabjMM5Rjuk4gnOUZzqO4hwVmI5jOMeZTMdxnKMi0eFJwznOYjrScY5KTIcH5zib6cjEOSozHT6cowrTEcA5qjId2TjHOUxHCOeoxnREcI5zmY4YzlGd6YjjHOcxHUmcowbTUQrnqMl0lMY5ajEdZXCO85mOcjhHbaajAs5Rh+moiHPUZToq4RwXMB2VcY4LmY6qOEc9pqMazlGf6cDt05B5EdNRA+dowHTUwjkuZjpq4xyXMB24/T8yL2U6cPt/ZF7GdOD2/8i8nOnA7f+R2ZDpwO3/kdmI6cDt/5HZmOnA7f+ReQXTgdv/I7MJ04Hb/yPzSqYDt/9HZlOmA7f/R2YzpgO3/0dmc6YDt/9H5lVMB27/j8yrmQ7c/h+Z1zAduP0/Mq9lOnD7f2S2YDpw+39kXsd04Pb/yGzJdOD2/8i8nunA7f+ReQPTgdv/I7MV04Hb/yPzRqYDt/9H5k1MB27/j8ybmQ7c/h+ZrZkO3P4fmW2YDtz+H5m3MB24/T8yb2U6cPt/ZN7GdOD2/8i83eCY8bejebfOvYqim0tMFO8S8b4j3qXifVe8y8T7nniXi/d98a4Q7wfiXSneD8W7SrwfiXe1eD8Wr4j3E/GuEe+n4l0r3s/Eu068n4t3vXi/EO8G8X4p3o3i/Uq8m8S7WbxbxPu1eLeK9xvxbhPvt+LdLt7vxLtDvN+Ld6d4d4l3t3h/EO8e8f4o3r3i/Um8+8S7X7wHxPuzeA+K9xfxHhLvr+I9LN7fxHtEvL+L96h4/xDvMfH+Kd7jkllCMk/8qI5kpktmhmR6JNMrmZmSmSWZPsn0S2ZAMoOSmS2ZOZIZksywZEYkMyqZMcnMlcy4ZCYkMymZJSWzlGSeLpmlJfMMySwjmWUls5xklpfMCpJ5pmRWlMyzJLOSZJ4tmZUls4pkVpXMcySzmmSeK5nVJfM8yawhmTUls5Zkni+ZtSWzjmTW1Ya69qK1jasdUG0eat9NW1ba7dFGifYY9PG8PtnWh8L6PFUfRepTPH0Aps+O9LGLPrHQm329T9ZbTL070xsbvSfQy2m9EtWLOL3+0UsH/dbVLyw91+tpUs8w+uHU41oPial/v9/5Mxrm5XXs2evWjj27FxUWGY6mjLKSUUFfWLNDi57bak2surBlk/n5+W3aVqm9q1m/RT0KGm87VLRfX3nihd63Cy0HqL7MMF5m22J9HKOmj2Oa8TPkBf5MlQuHOd4AbHPfwXQA25F3Mh3AduRdTAewHdmO6QC2I+9mOoDtyPZMB7Ad2YHpALYjOzIdwHbkPUwHsB3ZiekAtiPvZTqA7cjOTAewHXkf0wFsR97PdADbkV2YDmA7sivTAWxHdmM6gO3I7kwHsB3Zg+kAtiMfYDqA7cieTAewHZnHdADbkb2YDmA7sjfTAWxHPsh0ANuRfZgOYDuyL9MBbEf2YzqA7ciHmA5gO7I/0wFsRz7MdADbkQOYjjyc4xGmozfOMZDp6INzPMp09MM58pmO/jjHY0zHAJxjENMxEOd4nOnIxzkGMx2DcI4nmI7BOMcQpmMIzvEk0zEU5xjKdAzDOZ5iOobjHMOYjhE4x9NMRwHOMZzpKMI5nmE6RuMcI5iOMTjHSKZjLM5RwHSMwzkKmY7xOEcR0zEB5xjFdEzCOUYzHZNxjmeZjik4xximYxrO8RzTMR3nGMt0zMQ5nmc6ZuEc45iO2TjHC0zHHJxjPNMxF+d4kemYh3NMYDoW4BwTmY5FOMckpgOY83qJ6ViCc0xmOpbiHC8zHctwjilMx3KcYyrTsQLnmMZ0rMQ5XmE6VuEc05mO1TjHDKZDcI6ZTMcanONVpmMtzjGL6ViHc7zGdKzHOWYzHRtwjteZjo04xxymYxPO8QbTsQXnmMt0bMU53mQ6tuEc85iO7TjHfKZjB86xgOnYiXMsZDp24xyLmI49OMdbTMdenGMx07EP53ib6TiAcyxhOg7iHO8wHYdwjqVMx2Gc412m4wjOsYzpOIpzvMd0HMM5ljMdx3GO94kOTxrOsYLpSMc5PmA6PDjHSqYjE+f4kOnw4RyrmI4AzvER05GNc6xmOkI4x8dMRwTnEKYjhnN8wnTEcY41TEcS5/iU6SiFc6xlOkrjHJ8xHWVwjnVMRzmc43OmowLOsZ7pqIhzfMF0VMI5NjAdlXGOL5mOqjjHRqajGs7xFdMB3KdhE9NRA+fYzHTUwjm2MB21cY6vmQ7g/h9bmQ7g/h/fMB3A/T+2MR3A/T++ZTqA+39sZzqA+398x3QA9//YwXQA9//4nukA7v+xk+kA7v+xi+kA7v+xm+kA7v/xA9MB3P9jD9MB3P/jR6YDuP/HXqYDuP/HT0wHcP+PfUwHcP+P/UwHcP+PA0wHcP+Pn5kO4P4fB5kO4P4fvzAdwP0/DjEdwP0/fmU6gPt/HGY6gPt//MZ0APf/OMJ0APf/+J3pAO7/cZTpAO7/8QfTAdz/w/Cn2f/alr7Aui39WSfmT7mPfJnLncxfXucvtMyf+adllZxUeZ5knFFkqPE8iyPjDJM29R+wpxXbUUOHtfza7sxGPTt36dK5U+N2XbqM8o7On9qqc7dOXTraDlRDB7Z4A56LHrBaMQYstH6IylmP9goj0R7xGLZkKzwxZtceXTpKVol//plmPfkY8hT5rzfq0q79/Y26972yd7f2J46d/Ck3NGzRtElh/rTWnXt165iXp3OX//fR5Sss/lKHrUsdTrHUx48f/+2fpf7PL0478V8nLeJp//wz3fKNkWZantNsL0svfwpn2rAunu1M38jJmV7nL2+bv3Ex5x856j8PW7j/RAFZp1kmz0o3fc00Mr2qseH4+68LafhqUMpIB2/RiffI9AZlZTiYvbJ5do+D2c82z+518uEImefPdDB/JfPsWa5ODVHb/D5X88dt8/tdzR+xzR+wzP/3zUzzbp17FcU2l7hcP6/6odEjVw8efQd1EdWhQ0lG9f9X/Gfq355/n/KLTMsVTH2azjKdzLOK/61keutPnMyDtrfeEK066T42Br2PzcLlurJyinkI5/5veggXmr6SM49brwlyCm3LbzrYQsU62HJNB1sa4WALFfNDazyvhP9bzytpp3ZeMX6lRxy81eb3B5dPzIoSHRm4vzvPijEduL8PzsplOnB/H5wVZzpwfx+clWA6cH8fnJVkOnB/H5xVkunA/X1wVimmA/f3wVmnMx24vw/OKs104P4+OOsMpgP398FZZZgO3N8HZ5VlOnB/H5xVjunA/X1wVnmmA/f3wVkVmA7c3wdnncl04P4+OKsi04H7++Css5gO3N8HZ1ViOnB/H5x1NtOB+/vgrMpMB+7vg7OqMB24vw/Oqsp04P4+OOscpgP398FZ1ZgO3N8HZ53LdOD+PjirOtOB+/vgrPOYDtzfB2fVYDpwfx+cVZPpwP19cFYtpgP398FZ5zMdeThHbaajN85Rh+nog3PUZTr64RwXMB39cY4LmY4BOEc9pmMgzlGf6cjHOS5iOgbhHA2YjsE4x8VMxxCc4xKmYyjOcSnTMQznuIzpGI5zXM50jMA5GjIdBThHI6ajCOdozHSMxjmuYDrG4BxNmI6xOMeVTMc4nKMp0zEe52jGdEzAOZozHZNwjquYjsk4x9VMxxSc4xqmYxrOcS3TMR3naMF0zMQ5rmM6ZuEcLZmO2TjH9UzHHJzjBoPj5FxZ/K9cWUyyciUrLlkJyUpKVknJKiVZp0tWack6Q7LKSFZZySonWeUlq4JknSlZFSXrLMmqJFlnS1ZlyaoiWVW1da9db20Ya69V25Ta4dPmmPaVtCWj3QxtBOgzdH38rE9u9aGnPi/UR236lEof8OizEX2soHfkejOr94F6C6V3H3rhrte8ermoV1p6kaLf7/rVqN8qekLWc5meBvQTpAefvm9KPtVcWfVi5MqitlxZtNASNmpVrIMtjs2VAcNGFscp5MpuTD05MFd22qnlym4sMFlucvBWm98f4N8R3kx0IHNlrZkOYK6sDdMBzJXdwnQAc2W3Mh3AXNltTAcwV3Y70wHMlbVlOoC5sjuYDmCu7E6mA5gru4vpAObK2jEdwFzZ3UwHMFfWnukA5so6MB3AXFlHpgOYK7uH6QDmyjoxHcD7wXuZDmCurDPTAcyV3cd0AHNl9zMdwFxZF6YDmCvrynQAc2XdmA5grqw70wHMlfVgOoC5sgeYDmCurCfTAcyV5TEdwFxZL6YDmCvrzXQAc2UPMh3AXFkfpgOYK+vLdABzZf2YDmCu7CGmA5gr6890AHNlDzMdwFzZAKYDmCt7hOkA5soGMh3AXNmjTAcwV5bPdABzZY8xHcBc2SCmA5gre5zpAObKBjMdwFzZE0wHMFc2hOkA5sqeZDqAubKhTAcwV/YU0wHMlQ1jOoC5sqeZDmCubDjTAcyVPcN0AHNlI5gOYK5sJNMBzJUVMB3AXFkh0wHMlRUxHcBc2SimA5grG810AHNlzxocJ+fKEn/lylpLVhvJukWybpWs2yTrdslqK1l3SNadknWXZLWTrLslq71kdZCsjpJ1j2R1kqx7JauzZN0nWfdLVhfJ6qqte+16a8NYe63aptQOnzbHtK+kLRntZmgjQJ+h6+NnfXKrDz31eaE+atOnVPqAR5+N6GMFvSPXm1m9D9RbKL370At3vebVy0W90tKLFP1+169G/VbRE7Key/Q0oJ8gPfj0fVPyqebKzi1GruxmW67s5kJL2GhMsQ62BDZXBvzjMovjFHJlz6WeHJgrSz+1XNlzBSbLWAdvtfn9Ad63PU90IHNl45gOYK7sBaYDmCsbz3QAc2UvMh3AXNkEpgOYK5vIdABzZZOYDmCu7CWmA5grm8x0AHNlLzMdwFzZFKYDmCubynQAc2XTmA5gruwVpgOYK5vOdABzZTOYDmCubCbTAbz1f5XpAObKZjEdwFzZa0wHMFc2m+kA5speZzqAubI5TAcwV/YG0wHMlc1lOoC5sjeZDmCubB7TAcyVzWc6gLmyBUwHMFe2kOkA5soWMR3AXNlbTAcwV7aY6QDmyt5mOoC5siVMBzBX9g7TAcyVLWU6gLmyd5kOYK5sGdMBzJW9x3QAc2XLmQ5grux9pgOYK1vBdABzZR8wHcBc2UqmA5gr+5DpAObKVjEdwFzZR0wHMFe2mukA5so+ZjqAuTJhOoB/n/gJ0wHMla1hOoC5sk+ZDmCubC3TAcyVfcZ0AHNl65gOYK7sc6YDmCtbz3QAc2VfMB3AXNkGpgOYK/uS6QDmyjYyHcBc2VcGx8m5suRfubJxkvWCZI2XrBcla4JkTZSsSZL1kmRNlqyXJWuKZE2VrGmS9YpkTZesGZI1U7JelaxZkvWaZM2WrNcla4627rXrrQ1j7bVqm1I7fNoc076StmS0m6GNAH2Gro+f9cmtPvTU54X6qE2fUukDHn02oo8V9I5cb2b1PlBvofTuQy/c9ZpXLxf1SksvUvT7Xb8a9VtFT8h6LtPTgH6C9ODT903Jp5orE8+DxUiWPW9Llj1faIkbbSrW4ZbEJsuAl/MWxykkyzannhyYLMs4tWTZ5gKTZYuDt9r8/mzBDfU10YFMlm1lOoDJsm+YDmCybBvTAUyWfct0AJNl25kOYLLsO6YDmCzbwXQAk2XfMx3AZNlOpgOYLNvFdACTZbuZDmCy7AemA5gs28N0AJNlPzIdwGTZXqYDmCz7iekAJsv2MR3AZNl+pgOYLDvAdACTZT8zHcBk2UGmA5gs+4XpACbLDjEdwGTZr0wHMFl2mOkAJst+YzqAybIjTAcwWfY70wFMlh1lOoDJsj+YDmCy7BjTAUyW/cl0AJNlx5kOXLLMV4LpwCXLfGlMBy5Z5juN6cAly3zpTAcuWebLYDpwyTKfh+nAJct8XqYDlyzzZTIduGSZL4vpwCXLfD6mA5cs8/mZDlyyzBdgOnDJMl+Q6cAly3zZTAcuWebLYTpwyTJfiOnAJct8YaYDlyzzRZgO3J+i+qJMBy5Z5osxHbhkmS+X6cAly3xxpgOXLPMlmA5cssyXZDpwyTJfSaYDlyzzlWI6cMky3+lMBy5Z5ivNdOCSZb4zmA5cssxXhunAJct8ZQ2Ok5NlJf9Klm2VrG8ka5tkfStZ2yXrO8naIVnfS9ZOydolWbsl6wfJ2iNZP0rWXsn6SbL2SdZ+yTogWT9L1kHJ+kWyDmnrXrve2jDWXqu2KbXDp80x7StpS0a7GdoI0Gfo+vhZn9zqQ099XqiP2vQplT7g0Wcj+lhB78j1ZlbvA/UWSu8+9MJdr3n1clGvtPQiRb/f9atRv1X0hKznMj0N6CdIDz5935R8qsmyasXIlX1ty5V9XWgYz1euWAdbSWyuDBc2MjmKnyvzlU89OTBX5jmlXJmvfIHJUsHBW21+fyrghjqT6ADmynwVmQ5crsx3FtOBy5X5KjEduFyZ72ymA5cr81VmOnC5Ml8VpgOXK/NVZTpwuTLfOUwHLlfmq8Z04HJlvnOZDlyuzFed6cDlynznMR24XJmvBtOBy5X5ajIduFyZrxbTgcuV+c5nOnC5Ml9tpgOXK/PVYTpwuTJfXaYDlyvzXcB04HJlvguZDlyuzFeP6cDlynz1mQ5crsx3EdOBy5X5GjAduFyZ72KmA5cr813CdOByZb5LmQ5crsx3GdOBy5X5Lmc6cLkyX0OmA5cr8zViOnC5Ml9jpgOYK7uC6QDmypowHcBc2ZVMBzBX1pTpAObKmjEdwFxZc6YDmCu7iukA5squZjqAubJrmA5gruxapgOYK2vBdABzZdcxHcBcWUumA5gru57pAObKbmA6gLmyVkwHMFd2I9MBzJXdxHQAc2U3Mx3AXFlrpgOYK2vDdABzZbcwHcBc2a1MBzBXdhvTAcyV3c50AHNlbZkOYK7sDqYDmCu7k+kA5sruYjqAubJ2TAcwV3a3wXFyrqzUiVyZr6L4zhJfJfGdLb7K4qsivqriO0d81cR3rviqi+888dUQX03x1RLf+eKrLb464qsrvgvEd6H46omvvrbuteutDWPttWqbUjt82hzTvpK2ZLSboY0AfYauj5/1ya0+9NTnhfqoTZ9S6QMefTaijxX0jlxvZvU+UG+h9O5DL9z1mlcvF/VKSy9S9Ptdvxr1W0VPyHou09OAfoL04NP3TcmnvGPZicBYmjFZ5jvTlCzTl1niRu2LdbiVgibLkHEji+MUkmUdUk8OTJZ5Ty1Z1qHAZOno4K02vz/AvwS5p5hvtekTmFFWMsqZXlheMirYFrwTccGREbh7mQ5gBK4z0wGMwN3HdAAjcPczHcAIXBemAxiB68p0ACNw3ZgOYASuO9MBjMD1YDqAEbgHmA5gBK4n0wGMwOUxHcAIXC+mAxiB6810ACNwDzIdwAhcH6YDGIHry3QAI3D9mA5gBO4hpgMYgevPdAAjcA8zHcAI3ACmAxiBe4TpAEbgBjIdwAjco0wH8MFnPtMBjMA9xnQAI3CDmA5gBO5xpgMYgRvMdAAjcE8wHcAI3BCmAxiBe5LpAEbghjIdwAjcU0wHMAI3jOkARuCeZjqAEbjhTAcwAvcM0wGMwI1gOoARuJFMBzACV8B0ACNwhUwHMAJXxHQAI3CjmA5gBG400wGMwD3LdAAjcGOYDmAE7jmmAxiBG8t0ACNwzzMdwAjcOKYDGIF7gekARuDGMx3ACNyLTAcwAjeB6QBG4CYyHcAI3CSmAxiBe4npAEbgJjMdwAjcy0wHMAI3hekARuCmMh3ACJzhlPGvCNzpf0Xg7hVfZ/HdJ777xddFfF3F10183cXXQ3wPiK+n+PLE10t8vcX3oPj6iK+v+PqJ7yHx9Rffw+IbIL5HtHWvXW9tGGuvVduU2uHT5pj2lbQlo90MbQToM3R9/KxPbvWhpz4v1Edt+pRKH/DosxF9rKB35Hozq/eBeguldx964a7XvHq5qFdaepGi3+/61ajfKnpC1nOZngb0E6QHn75vSv5fReDMQaZOJ9Y1Za6mjOUnQf7r/KZk3T1Fpvf1HkuVvlcsY5Up3s+bnI7N3wH/NuGVYr4nxvzd9NSTA/N3mad22E43Hba+GQ7eavP7MwM31EyiAxlre5XpAMbaZjEdwFjba0wHMNY2m+kAxtpeZzqAsbY5TAcw1vYG0wGMtc1lOoCxtjeZDmCsbR7TAYy1zWc6gLG2BUwHMNa2kOkAxtoWMR3AWNtbTAcw1raY6QDG2t5mOoCxtiVMBzDW9g7TAYy1LWU6gLG2d5kOYKxtGdMBjLW9x3QAY23LmQ5grO19pgP46HgF0wGMtX3AdABjbSuZDmCs7UOmAxhrW8V0AGNtHzEdwFjbaqYDGGv7mOkAxtqE6QDG2j5hOoCxtjVMBzDW9inTAYy1rWU6gLG2z5gOYKxtHdMBjLV9znQAY23rmQ5grO0LpgMYa9vAdABjbV8yHcBY20amAxhr+4rpAMbaNjEdwFjbZqYDGGvbwnQAY21fMx3AWNtWpgMYa/uG6QDG2rYxHcBY27dMBzDWtp3pAMbavmM6gLG2HUwHMNb2PdMBjLXtZDqAsbZdTAcw1rab6QDG2n5gOoCxtj0Gx8mxttJ/xdpeFd8s8b0mvtnie118c8T3hvjmiu9N8c0T33zxLRDfQvEtEt9b4lssvrfFt0R874hvqfjeFd8y8b2nrXvtemvDWHut2qbUDp82x7SvpC0Z7WZoI0CfoevjZ31yqw899XmhPmrTp1T6gEefjehjBb0j15tZvQ/UWyi9+9ALd73m1ctFvdLSixT9ftevRv1W0ROynsv0NKCfID349H1T8v+jnd1KWPNnM207u80stMSNfizW4VYamywDxo0sjlNIlu21TG5JlqVZkmVpp5Ys21tgsvxkWKLXG3Vp1/7+Rt37Xtm7W/vG7bp0yZ9yQ8MWTZsU5k9r3blXt455eTpO+VMqM6uE6bjNPG7C7ANh9pU/tV3gzrTuAnem7c3ZX8zj11xoRWuhFW2FHnBwwjB/PwFzfT8zHcBc30GmA5jr+4XpAOb6DjEdwFzfr0wHMNd3mOkA5vp+YzqAub4jTAcw1/c70wHM9R1lOoC5vj+YDmCu7xjTAcz1/cl0AHN9x5kOXK7PX4LpwOX6/GlMBy7X5z+N6cDl+vzpTAcu1+fPYDpwuT6/h+nA5fr8XqYDl+vzZzIduFyfP4vpwOX6/D6mA5fr8/uZDlyuzx9gOnC5Pn+Q6cDl+vzZTAcu1+fPYTpwuT5/iOnA5fr8YaYDl+vzR5gOXK7PH2U6cLk+f4zpwOX6/LlMBy7X548zHbhcnz/BdOByff4k04HL9flLMh24XJ+/FNOBy/X5T2c6cLk+f2mmA5fr85/BdOByff4yTAcu1+cvy3Tgcn3+ckwHLtfnL8904HJ9/gpMBy7X5z+T6cDl+vwVmQ5crs9/FtOBy/X5KzEduFyf/2ymA5fr81dmOnC5Pn8VpgOX6/NXZTpwuT7/OUwHLtfnr8Z04HJ9/nOZDlyuz1+d6cDl+vznMR24XJ+/BtOBy/X5azIduFyfv5bB8a+g1YnUjyHXZnmV//zUFZ5Cystf2yKHpbxKFD8+lVFeMv80bTuXUdYkrmOyXG6wzGzUs3OXLp07nchXjcoqyJ/aqnO3Tl062g6n2qkn+GvErj26dBR/XVP4sNirW1tHth37F6Re2lOZ/YKRLo6ZE8nAfQWWo6HMbcX9TI8y/elsJ9OheKGpxFamA/a2Uzg8Us1dR98gS3Kxjklbz8Vb7b9QBza91X5D0smSm/TXL38KZ3l/PdOrLiruWR55ODb4bz0cS5xSVtz3k+moOF+/2WxHxcWOCvXXsRZax1boJcX9RvIU8xvJcHkz0nqpdCqf9VRLUPfEh8g2u2lBLy3ugvoKi7egKd+z48ePf/PPkP/5qzDtxH8V/nNFcNk//7zcdnFgObddZnvZ5eX/r9eaqebX1fjPb0vh/r9edZnpzbvcsLLF3uLYX0+nH+nihJBRVjLvsMbRq9hOCA1dFXqntdCqtkIbuSr0Lmuh59gKbeyq0HbWQqvZCr3CVaF3Wws911Zok1P4Hkg9vxba3jb/la7m72Cbv6mr+Tva5m/mav57bPM3dzV/J9v8V7ma/17b/Fe7mr+zbf5rXM1/n23+a13Nf79t/hau5u9im/86V/N3tc3f0tX83WzzX+9q/u62+W9wNX8P2/ytXM3/gG3+G13N39M2/02u5s+zzX+zq/l72eZv7Wr+3rb527ia/0Hb/Le4mr+Pbf5bXc3f1zb/ba7m72eb/3ZX8z9km7+tq/n72+a/w9X8D9vmv9PV/ANs89/lav5HbPO3czX/QNv8d7ua/1Hb/O1dzZ9vm7+Dq/kfs83f0dX8g2zz3+Nq/sdt83dyNf9g2/z3upr/Cdv8nV3NP8Q2/32u5n/SNv/9ruYfapu/i6v5n7LN39XV/MNs83dzNf/Ttvm7u5p/uG3+Hq7mf8Y2/wOu5h9hm7+nq/lH2ubPczV/gW3+Xq7mL7TN39vV/EW2+R90Nf8o2/x9XM0/2jZ/X1fzP2ubv5+r+cfY5n/I1fzP2ebv72r+sbb5H3Y1//O2+Qe4mn+cbf5HXM3/gm3+ga7mH2+b/1FX879omz/f1fwTbPM/5mr+ibb5B7maf5Jt/sddzf+Sbf7BruafbJv/CVfzv2ybf4ir+afY5n/S1fxTbfMPdTX/NNv8T7ma/xXb/MNczT/dNv/TruafYZt/uKv5Z9rmf8bV/K/a5h/hav5ZtvlHupr/Ndv8Ba7mn22bv9DV/K/b5i9yNf8c2/yjXM3/hm3+0a7mn2ub/1lX879pm3+Mq/nn2eZ/ztX8823zj3U1/wLb/M+7mn+hbf5xruZfZJv/BVfzv2Wbf7yr+Rfb5n/R1fxv2+af4Gr+Jbb5J7qa/x3b/JNczb/UNv9LruZ/1zb/ZFfzL7PN/7Kr+d+zzT/F1fzLbfNPdTX/+7b5p7maf4Vt/ldczf+Bbf7pruZfaZt/hqv5P7TNP9PV/Kts87/qav6PbPPPcjX/atv8r7ma/2Pb/LNdzS+2+V93Nf8ntvnnuJp/jW3+N1zN/6lt/rmu5l9rm/9NV/N/Zpt/nqv519nmn+9q/s9t8y9wNf962/wLXc3/hW3+Ra7m32Cb/y1X839pm3+xq/k32uZ/29X8X9nmX+Jq/k22+d9xNf9m2/xLXc2/xTb/u67m/9o2/zJX82+1zf+eq/m/sc2/3NX822zzv+9q/m9t869wNf922/wfuJr/O9v8K13Nv8M2/4eu5v/eNv8qV/PvtM3/kav5d9nmX+1q/t22+T92Nf8PtvnF1fx7bPN/4mr+H23zr3E1/17b/J+6mv8n2/xrXc1v+3lH/2eu5t9vm3+dq/kP2Ob/3NX8P9vmX+9q/oO2+b9wNf8vtvk3uJr/kG3+L13N/6tt/o2u5j9sm/8rV/P/Zpt/k6v5j9jm3+xq/t9t829xNf9R2/xfu5r/D9v8W13Nf8w2/zeW+f/+6fXm3Tr3Kjpjc4mJ4m8o/kbibyz+K8TfRPxXir+p+JuJv7n4rxL/1eK/RvzXir+F+K8Tf0vxXy/+G8TfSvw3iv8m8d8s/tbibyP+W8R/q/hvE//t4m8r/jvEf6f47xJ/O/HfLf724u8g/o7iv0f8ncR/r/g7i/8+8d8v/i7i7yr+buLvLv4e4n9A/D3Fnyf+XuLvLf4Hxd9H/H3F30/8D4m/v/gfFv8A8T8i/oHif1T8+eJ/TPyDxP+4+AeL/wnxDxH/k+IfKv6nxD9M/E+Lf7j4nxH/CPGPFH+B+AvFXyT+UeIfLf5nxT9G/M+Jf6z4nxf/OPG/IP7x4n9R/BPEr+szSfwvaW9f2+va4dYms/Z5tdWq3U5tOGrPT9tu2vnS5pP2f7QFo10QbURoL0Afx+sTcX0orc+F9dGsPh3VB5T6jFAf0+mTMn1Ypc+L9JGNPjXRBxf67EBv3/UOWm9i9T5Sb+X0bkpvaPSeQi/r9cpaL271+lIv8fQqSy909FpDv+71G1e/9PR7R0/9evbVE6Ceg/Q0oJ9E/TDo8aiHxNS/3+/iHneev34e8xLbcbfNcNz985P/Z0B/8t8yuXWob4v5+bX80KIOe2lR6kWsa/5h6+3F/JCX+Z8P+f8nP+SFRZajST/k31q+hU68cLvt95i/NR3G3xXrnFHGdM5II5wzvsN/5/8f517kr1/vcLDa5iXagRvqe6IjozrOsZPpqItz7GI6LsQ5djMd9XGOH5iOBjjHHqbjEpzjR6bjMpxjL9PREOf4ielojHPsYzqa4Bz7mY6mOMcBpqM5zvEz03E1znGQ6bgW5/iF6bgO5zjEdFyPc/zKdLTCOQ4zHTfhHL8xHa1xjiNMxy04x+9Mx204x1Gmoy3O8QfTcSfOcYzpaIdz/Ml0tMc5jjMdHWFDBUowHZ1wjjSmozPOcRrTcT/Okc50dMU5MpiO7jiHh+l4AOfwMh15OEcm09Eb58hiOvrgHD6mox/O4Wc6+uMcAaZjAM4RZDoG4hzZTEc+zpHDdAzCOUJMx2CcI8x0DME5IkzHUJwjynQMwzliTMdwnCOX6RiBc8SZjgKcI8F0FOEcSaZjNM5RkukYg3OUYjrG4hynMx3jcI7STMd4nOMMpmMCzlGG6ZiEc5RlOibjHOWYjik4R3mmYxrOUYHpmI5znMl0zMQ5KjIds3COs5iO2ThHJaZjDs5xNtMxF+eozHTMwzmqMB0LcI6qTMcinOMcpmMxzlGN6ViCc5zLdCzFOaozHctwjvOYjuU4Rw2mYwXOUZPpWIlz1GI6VuEc5zMdq3GO2kyH4Bx1mI41OEddpmMtznEB07EO57iQ6ViPc9RjOjbgHPWZjo04x0VMxyacowHTsQXnuJjp2IpzXMJ04H4tJnAp07Ed57iM6cD9nkzgcqZjJ87RkOnYjXM0Yjr24ByNmY69OMcVTMc+nKMJ03EA57iS6TiIczRlOg7hHM2YjsM4R3Om4wjOcRXTcRTnuJrpOIZzXMN0HMc5riU6PGk4RwumIx3nuI7p8OAcLZmOTJzjeqbDh3PcwHQEcI5WTEc2znEj0xHCOW5iOiI4x81MRwznaM10xHGONkxHEue4hekohXPcynSUxjluYzrK4By3Mx3lcI62TEcFnOMOpqMiznEn01EJ57iL6aiMc7RjOqriHHczHdVwjvZMB26fhkAHpqMGztGR6aiFc9zDdNTGOToxHbj9PwL3Mh24/T8CnZkO3P4fgfuYDtz+H4H7mQ7c/h+BLkwHbv+PQFemA7f/R6Ab04Hb/yPQnenA7f8R6MF04Pb/CDzAdOD2/wj0ZDpw+38E8pgO3P4fgV5MB27/j0BvpgO3/0fgQaYDt/9HoA/Tgdv/I9CX6cDt/xHox3Tg9v8IPMR04Pb/CPRnOnD7fwQeZjpw+38EBjAduP0/Ao8wHbj9PwIDmQ7g/h+PMh3A/T/ymQ7g/h+PMR3A/T8GMR3A/T8eZzqA+38MZjqA+388YXDM+NvRvFvnXkVlN5eYKP6d4t8l/t3i/0H8e8T/o/j3iv8n8e8T/37xHxD/z+I/KP5fxH9I/L+K/7D4fxP/EfH/Lv6j4v9D/MfE/6f4j0ughAS0jNMkkC6BDAl4JOCVQKYEsiTgk4BfAgEJBCWQLYEcCYQkEJZARAJRCcQkkCuBuAQSEkhKoKQESkngdAmUlsAZEigjgbISKCeB8hKoIIEzJVBRAmdJoJIEzpZAZQlUkUBVCZwjgWoSOFcC1SVwngRqSKCmBGpJ4HwJ1JZAHQnUlcAFErhQAvUkUF8CF0mggQQulsAlErhUApdJ4HIJNJRAIwk0lsAVEmgigSsl0FQCzSTQXAJXSeBqCVwjgWsl0EIC10mgpQSul8ANEmglgRslcJMEbpZAawm0kcAtErhVArdJ4HYJtJXAHRK4Uxvq2ovWNq52QLV5qH03bVlpt0cbJdpj0Mfz+mRbHwrr81R9FKlP8fQBmD470scu+sRCb/b1PllvMfXuTG9s9J5AL6f1SlQv4vT6Ry8d9FtXv7D0XK+nST3D6IdTj2s9JKb+/X7nz2iYl9exZ69bO/bsXlSY+reS02qLv56+rGaHFj231ZpYdWHLJvPz89u0rVJ7V7N+i3oUNN52qGi/vk5fJf7vCy2Hp77MMF5gSLE+jGVNH8Y04yfIDwyPWhwnvykFqd8Uz1+rfYlhtU/TV5pW+0kHq21eoidxQw09hdVOtTrpFxQZ5k43vOYC03vxFPG9yAD+WcQwpgPYvn6a6QC2r4czHcD29TNMB7B9PYLpALavRzIdwPZ1AdMBbF8XMh3A9nUR0wFsX49iOoDt69FMB7B9/SzTAWxfj2E6gO3r55gOYPt6LNMBbF8/z3QA29fjmA5g+/oFpgPYvh7PdADb1y8yHcD29QSmA9i+nsh0ANvXk5gOYPv6JaYD2L6ezHQA29cvMx3A9vUUpgPYvp7KdADb19OYDmD7+hWmA9i+ns50ANvXM5iOPJxjJtPRG+d4lenog3PMYjr64RyvMR39cY7ZTMcAnON1pmMgzjGH6cjHOd5gOgbhHHOZjsE4x5tMxxCcYx7TMRTnmM90DMM5FjAdw3GOhUzHCJxjEdNRgHO8xXQU4RyLmY7ROMfbTMcYnGMJ0zEW53iH6RiHcyxlOsbjHO8yHRNwjmVMxySc4z2mYzLOsZzpmIJzvM90TMM5VjAd03GOD5iOmTjHSqZjFs7xIdMxG+dYxXTMwTk+Yjrm4hyrmY55OMfHTMcCnEOYjkU4xydMx2KcYw3TsQTn+JTpWIpzrGU6luEcnzEdy3GOdUzHCpzjc6ZjJc6xnulYhXN8wXSsxjk2MB2Cc3zJdKzBOTYyHWtxjq+YjnU4xyamYz3OsZnp2IBzbGE6NuIcXzMdm3COrUzHFpzjG6ZjK86xjenYhnN8y3Rsxzm2Mx3AXyD6junYiXPsYDp24xzfMx17cI6dTMdenGMX07EP59jNdBzAOX5gOg7iHHuYjkM4x49Mx2GcYy/TcQTn+InpOIpz7GM6juEc+5mO4zjHAaLDk4Zz/Mx0pOMcB5kOD87xC9ORiXMcYjp8OMevTEcA5zjMdGTjHL8xHSGc4wjTEcE5fmc6YjjHUaYjjnP8wXQkcY5jTEcpnONPpqM0znGc6SgDGypYgukoh3OkMR0VcI7TmI6KOEc601EJ58hgOirjHB6moyrO4WU6quEcmUwHbp+GYBbTUQPn8DEdtXAOP9NRG+cIMB24/T+CQaYDt/9HMJvpwO3/EcxhOnD7fwRDTAdu/49gmOnA7f8RjDAduP0/glGmA7f/RzDGdOD2/wjmMh24/T+CcaYDt/9HMMF04Pb/CCaZDtz+H8GSTAdu/49gKaYDt/9H8HSmA7f/R7A004Hb/yN4BtOB2/8jWIbpwO3/ESzLdOD2/wiWYzpw+38EyzMduP0/ghWYDtz+H8EzmQ7c/h/BikwHbv+P4FlMB27/j2AlpgO3/0fwbKYDt/9HsDLTgdv/I1iF6cDt/xGsynTg9v8InmNwzPjb0bxb515F5TaXmCiBYRJ4WgLDJfCMBEZIYKQECiRQKIEiCYySwGgJPCuBMRJ4TgJjJfC8BMZJ4AUJjJfAixKYIAEdYZIEXpLAZAm8LIEpEpgqgWkSeEUC0yUwQwIzJfCqBGZJ4DUJzJbA6xKYI4E3JDBXAm9KYJ4E5ktggQQWSmCRBN6SwGIJvC2BJRJ4RwJLJfCuBJZJ4D0JLJfA+xJYIYEPJLBSAh9KYJUEPpLAagl8LAGRwCcSWCOBTyWwVgKfSWCdBD6XwHoJfCGBDRL4UgIbJfCVBDZJYLMEtkjgawlslcA3EtgmgW8lsF0C30lghwS+l8BOCeySwG4J/CCBPRL4UQJ7JfCTBPZJYL8EDkjgZwkclMAvEjgkgV8lcFgCv0ngiAR+l8BRCfwhgWMS+FMCxyVYQoIn/rRBgunaUNdetLZxtQOqzUPtu2nLSrs92ijRHoM+ntcn2/pQWJ+n6qNIfYqnD8D02ZE+dtEnFnqzr/fJeoupd2d6Y6P3BHo5rVeiehGn1z966aDfuvqFped6PU3qGUY/nHpc6yEx9e/3O39Gw7y8jj173dqxZ/eiwqL3y9fs0KLntloTqy5s2WR+fn6btlVq72rWb1GPgsbbDhXt1wNF/PUkMLTIcNideOFThaY/HBpaaJg4WK1YH8dypo9jmvVvm57EfRwtjpPfloLUq+05sdr+Swyrna6vNK32uQ5W27xE5+KGqk50ZAD/qOA8pgPY/K3BdACbvzWZDmDztxbTAWz+ns90AJu/tZkOYPO3DtMBbP7WZTqAzd8LmA5g8/dCpgPY/K3HdACbv/WZDmDz9yKmA9j8bcB0AJu/FzMdwObvJUwHsPl7KdMBbP5exnQAm7+XMx3A5m9DpgPY/G3EdACbv42ZDmDz9wqmA9j8bcJ0AJu/VzIdwOZvU6YD2PxtxnQAm7/NmQ5g8/cqpgPY/L2a6QA2f69hOoDN32uZjjycowXT0RvnuI7p6INztGQ6+uEc1zMd/XGOG5iOAThHK6ZjIM5xI9ORj3PcxHQMwjluZjoG4xytmY4hOEcbpmMoznEL0zEM57iV6RiOc9zGdIzAOW5nOgpwjrZMRxHOcQfTMRrnuJPpGINz3MV0jMU52jEd43COu5mO8ThHe6ZjAs7RgemYhHN0ZDom4xz3MB1TcI5OTMc0nONepmM6ztGZ6ZiJc9zHdMzCOe5nOmbjHF2Yjjk4R1emYy7O0Y3pmIdzdGc6FuAcPZiORTjHA0zHYpyjJ9OxBOfIYzqW4hy9mI5lOEdvpmM5zvEg07EC5+jDdKzEOfoyHatwjn5Mx2qc4yGmQ3CO/kzHGpzjYaZjLc4xgOlYh3M8wnSsxzkGMh0bcI5HmY6NOEc+07EJ53iM6diCcwxiOrbiHI8zHdtwjsFMx3ac4wmmYwfOMYTp2IlzPMl07MY5hjIde3COp5iOvTjHMKZjH87xNNNxAOcYznQcxDmeYToO4RwjmI7DOMdIpuMIzlHAdBzFOQqZjmM4RxHTcRznGEV0eNJwjtFMRzrO8SzT4cE5xjAdmTjHc0yHD+cYy3QEcI7nmY5snGMc0xHCOV5gOiI4x3imI4ZzvMh0xHGOCUxHEueYyHSUwjkmMR2lcY6XmI4yOMdkpqMczvEy01EB55jCdFTEOaYyHZVwjmlMR2Wc4xWmoyrOMZ3pqIZzzGA6gPs0zGQ6auAcrzIdtXCOWUxHbZzjNaYDuP/HbKYDuP/H60wHcP+POUwHcP+PN5gO4P4fc5kO4P4fbzIdwP0/5jEdwP0/5jMdwP0/FjAdwP0/FjIdwP0/FjEdwP0/3mI6gPt/LGY6gPt/vM10APf/WMJ0APf/eIfpAO7/sZTpAO7/8S7TAdz/YxnTAdz/4z2mA7j/x3KmA7j/x/tMB3D/jxVMB3D/jw+YDuD+HyuZDuD+Hx8yHcD9P1YxHcD9Pz5iOoD7f6xmOoD7f3zMdAD3/zD8tED+jL8dzbt17lVUfnOJiRI8T4I1JFhTgrUkeL4Ea0uwjgTrSvACCV4owXoSrC/BiyTYQIIXS/ASCV4qwcskeLkEG0qwkQQbS/AKCTaR4JUSbCrBZhJsLsGrJHi1BK+R4LUSbCHB6yTYUoLXS/AGCbaS4I0SvEmCN0uwtQTbSPAWCd4qwdskeLsE20rwDgneKcG7JNhOgndLsL0EO0iwowTvkWAnCd4rwc4SvE+C90uwiwS7SrCbBLtLsIcEH5BgTwnmSbCXBHtL8EEJ9pFgXwn2k+BDEuwvwYclOECCj0hwoAQflWC+BB+T4CAJPi7BwRJ8QoJDJPikBIdK8CkJDpPg0xIcLsFnJDhCgiMlWCDBQgkWSXCUBEdL8FkJjpHgcxIcK8HnJThOgi9IcLwEX5TgBAnqwk6S4EsSnCzBlyU4RYJTtaGuvWht42oHVJuH2nfTlpV2e7RRoj0GfTyvT7b1obA+T9VHkfoUTx+A6bMjfeyiTyz0Zl/vk/UWU+/O9MZG7wn0clqvRPUiTq9/9NJBv3X1C0vP9Xqa1DOMfjj1uNZDYurf73f+jIZ5eR179rq1Y8/uRYWp//A+rZb46+nLanZo0XNbrYlVF7ZsMj8/v03bKrV3Neu3qEdB422Hivbr6/RVEqxeaDo8qxcaxgt+UqwPY3nThzHN+gk6F/dhtDhOflMKUr8pnhOr7b/EsNoZ+krTaq9xsNrmJQL+hMinREcG8E8K1jIdwNbvZ0wHsPW7jukAtn4/ZzqArd/1TAew9fsF0wFs/W5gOoCt3y+ZDmDrdyPTAWz9fsV0AFu/m5gOYOt3M9MBbP1uYTqArd+vmQ5g63cr0wFs/X7DdABbv9uYDmDr91umA9j63c50AFu/3zEdwNbvDqYD2Pr9nukAtn53Mh3A1u8upgPY+t3NdABbvz8wHcDW7x6mA9j6/ZHpALZ+9zIdwNbvT0wHsPW7j+kAtn73Mx15OMcBpqM3zvEz09EH5zjIdPTDOX5hOvrjHIeYjgE4x69Mx0Cc4zDTkY9z/MZ0DMI5jjAdg3GO35mOITjHUaZjKM7xB9MxDOc4xnQMxzn+ZDpG4BzHmY4C2FDZJZiOIpwjjekYjXOcxnSMwTnSmY6xOEcG0zEO5/AwHeNxDi/TMQHnyGQ6JuEcWUzHZJzDx3RMwTn8TMc0nCPAdEzHOYJMx0ycI5vpmIVz5DAds3GOENMxB+cIMx1zcY4I0zEP54gyHQtwjhjTsQjnyGU6FuMccaZjCc6RYDqW4hxJpmMZzlGS6ViOc5RiOlbgHKczHStxjtJMxyqc4wymYzXOUYbpEJyjLNOBy21nl2M61uIc5ZmOdThHBaZjPc5xJtOxAeeoyHRsxDnOYjo24RyVmI4tOMfZTMdWnKMy07EN56jCdGzHOaoyHTtwjnOYjp04RzWmYzfOcS7TsQfnqM507MU5zmM69uEcNZiOAzhHTabjIM5Ri+k4hHOcz3QcxjlqMx1HcI46TMdRnKMu03EM57iA6TiOc1xIdHjScI56TEc6zlGf6fDgHBcxHZk4RwOmw4dzXMx0BHCOS5iObJzjUqYjhHNcxnREcI7LmY4YztGQ6YjjHI2YjiTO0ZjpKIVzXMF0lMY5mjAdZXCOK5mOcjhHU6ajAs7RjOmoiHM0Zzoq4RxXMR2VcY6rmY6qOMc1TEc1nONapgO3T0N2C6ajBs5xHdNRC+doyXTUxjmuZzpw+39k38B04Pb/yG7FdOD2/8i+kenA7f+RfRPTgdv/I/tmpgO3/0d2a6YDt/9HdhumA7f/R/YtTAdu/4/sW5kO3P4f2bcxHbj9P7JvZzpw+39kt2U6cPt/ZN/BdOD2/8i+k+nA7f+RfRfTgdv/I7sd04Hb/yP7bqYDt/9HdnumA7f/R3YHpgO3/0d2R6YDt/9H9j1MB27/j+xOTAdu/4/se5kO3P4f2Z2ZDtz+H9n3MR24/T+y72c6cPt/ZHdhOnD7f2R3ZTpw+39kd2M6cPt/ZHdnOnD7f2T3MDhm/O1o3q1zr6IKm0tMlOBaCX4mwXUS/FyC6yX4hQQ3SPBLCW6U4FcS3CTBzRLcIsGvJbhVgt9IcJsEv5Xgdgl+J8EdEvxegjsluEuCuyX4gwT3SPBHCe6V4E8S3CfB/RI8IMGfJXhQgr9I8JAEf5XgYQn+JsEjEvxdgkcl+IcEj0nwTwkel+wSkn3ih2slO12yMyTbI9leyc6U7CzJ9km2X7IDkh2U7GzJzpHskGSHJTsi2VHJjkl2rmTHJTsh2UnJLinZpST7dMkuLdlnSHYZyS4r2eUku7xkV5DsMyW7omSfJdmVJPtsya4s2VUku6pknyPZ1ST7XMmuLtnnSXYNya4p2bUk+3zJri3ZdSS7rmRfINkXSnY9ya4v2RdJdgPJvliyL5HsSyX7Msm+XLIbSnYjyW4s2VdIdhPJvlKym0p2M8lurg117UVrG1c7oNo81L6btqy026ONEu0x6ON5fbKtD4X1eao+itSnePoATJ8d6WMXfWKhN/t6n6y3mHp3pjc2ek+gl9N6JaoXcXr9o5cO+q2rX1h6rtfTpJ5h9MOpx7UeElP/fr/zZzTMy+vYs9etHXt2LyosMhxN/nrib6AvrNmhRc9ttSZWXdiyyfz8/DZtq9Te1azfoh4FjbcdKtqvrzzxwuCnhZYDVF9mGC/7gWJ9HCuYPo5pxs9QEPizFhbHyW9LgfVtucS02v56ptXuaajy9UZd2rW/v1H3vlf27ta+cbsuXfKn3NCwRdMmhfnTWnfu1a1jXp6OU77Yb4o5qwHs2ec5OLjMDmBvtRfTAeyt9mY6gL3VB5kOYG+1D9MB7K32ZTqAvdV+TAewt/oQ0wHsrfZnOoC91YeZDmBvdQDTAeytPsJ0AHurA5kOYG/1UaYD2FvNZzqAvdXHmA5gb3UQ0wHsrT7OdAB7q4OZDmBv9QmmA9hbHcJ0AHurTzIdwN7qUKYD2Ft9iukA9laHMR3A3urTTAewtzqc6QD2Vp9hOoC91RFMB7C3OpLpAPZWC5gOYG+1kOnIwzmKmI7eOMcopqMPzjGa6eiHczzLdPTHOcYwHQNwjueYjoE4x1imIx/neJ7pGIRzjGM6BuMcLzAdQ3CO8UzHUJzjRaZjGM4xgekYjnNMZDpG4ByTmI4CnOMlpqMI55jMdIzGOV5mOsbgHFOYjrE4x1SmYxzOMY3pGI9zvMJ0TMA5pjMdk3COGUzHZJxjJtMxBed4lemYhnPMYjqm4xyvMR0zcY7ZTMcsnON1pmM2zjGH6ZiDc7zBdMzFOeYyHfNwjjeZjgU4xzymYxHOMZ/pWIxzLGA6luAcC5mOpTjHIqZjGc7xFtOxHOdYzHSswDneZjpW4hxLmI5VOMc7TMdqnGMp0yE4x7tMBzCEvozpWItzvMd0rMM5ljMd63GO95mODTjHCqZjI87xAdOxCedYyXRswTk+ZDq24hyrmI5tOMdHTMd2nGM107ED5/iY6diJcwjTsRvn+ITp2INzrGE69uIcnzId+3COtUzHAZzjM6bjIM6xjuk4hHN8znQcxjnWMx1HcI4vmI6jOMcGpuMYzvEl03Ec59hIdHjScI6vmI50nGMT0+HBOTYzHZk4xxamw4dzfM10BHCOrUxHNs7xDdMRwjm2MR0RnONbpiOGc2xnOuI4x3dMRxLn2MF0lMI5vmc6SuMcO5mOMjjHLqajHM6xm+mogHP8wHRUxDn2MB2VcI4fmY7KOMdepqMqzvET01EN59jHdAD3adjPdNTAOQ4wHbVwjp+Zjto4x0GmA7j/xy9MB3D/j0NMB3D/j1+ZDuD+H4eZDuD+H78xHcD9P44wHcD9P35nOoD7fxxlOoD7f/zBdAD3/zjGdAD3//iT6QDu/3Gc6cDt/5FTgunA7f+Rk8Z04Pb/yDmN6cDt/5GTznTg9v/IyWA6cPt/5HiYDtz+HzlepgO3/0dOJtOB2/8jJ4vpwO3/keNjOnD7f+T4mQ7c/h85AaYDt/9HTpDpwO3/kZPNdOD2/8jJYTpw+3/khJgO3P4fOWGmA7f/R06E6cDt/5ETNThO3sy90LyZu+mFF+kLTxSacj/3nFgxC7XsOl9H/BcUGWavY6nQf4HJkZu6rGI76uqwhsMrf2ajnp27dOnc6cRW96O8o/OnturcrVOXjrZjxdCsKt6A56MHrFWMAc3HcX3rcdxgJNojAcPuboUnxuzao0tHyYn/88+E9fOfayj69UZd2rW/v1H3vlf27tb+xLGTP+WGhi2aNinMn9a6c69uHfPydO7y/z66fIXFX+qLrUt9cYqlPn78+G//LPV/fnHaif86aRGT//yzpOWknWZanqTtZSXLF/uz//fKmc6hZfo6OIf+/YbY5u9XzPlHjvrPwxbu/+sYTppOvCUtn4cyfU2v6mc4/v7rQhq+GpQysphLVGgZOfO4ZGVY3kt9oe/nQssSZGWYFr2UK47Hyjlo43hMnNNdcbxWzi82jtfEKe2Kk2nlHLJxMk2cM1xxsqycX22cLBOnjCuOz8o5bOP4TJyyrjh+K+c3G8dv4pRzxQlYOUdsnICJU97FpcGJKn+33d5VcDX/Udv8Z7qa/w/b/BVdzX/MNv9Zrub/0zZ/JVfzH7fNf7aj+f0lbPNXdjV/mm3+Kq7mP802f1VX86fb5j/H1fwZtvmruZrfY5v/XFfze23zV3c1f6Zt/vNczZ9lm7+Gq/l9tvlruprfb5u/lqv5A7b5z3c1f9A2f21X82fb5q/jav4c2/x1Xc0fss1/gav5w7b5L3Q1f8Q2fz1X80dt89d3NX/MNv9FrubPtc3fwNX8cdv8F7uaP2Gb/xJX8ydt81/qav6StvkvczV/Kdv8l7ua/3Tb/A1dzV/aNn8jV/OfYZu/sav5y9jmv8LV/GVt8zdxNX852/xXupq/vG3+pq7mr2Cbv5mr+c+0zd/c1fwVbfNf5Wr+s2zzX+1q/kq2+a9xNf/ZtvmvdTV/Zdv8LVzNX8U2/3Wu5q9qm7+lq/nPsc1/vav5q9nmv8HV/Ofa5m/lav7qtvlvdDX/ebb5b3I1fw3b/De7mr+mbf7WruavZZu/jWX+v/+etXm3zr2Kztxc4nLJKSU5p0tOaW29a7taW7zaFtVWonbztKGmPS1tK2lnR5sr2t/QFoM+5dcH7fqsWx836xNffeiqzz310aM+/dMHcPoMTB9D6ZMgfRijz0P0kYQ+FdAbc7031ttTvUPUmzS9T9JbFb1b0At2vWbWy1a9ctSLN71+0ksYvYrQL3L9LtWvM/1G0ZO6nlf11KZnF/2A62dMD3M90vTN1vVW8tS/Pf/+k6Mi03Ldkrr1mmX6Y6Ks4v9VlOmtP/HHRLfY3vpbDfP/86fMZ0L/lNkyuXWo24p5CFf83/QQtvy95YkDxPo3abcV2pbfdLDdXqyDraLpYEsjHGy3F/NDazyvtP1vPa+kndp5pa3tvHKHg7fa/P7cgRvqTqIjA/fTYzl3MR24n4jKacd04H4iKudupgP3E1E57ZkO3E9E5XRgOnA/EZXTkenA/URUzj1MB+4nonI6MR24n4jKuZfpwP1EVE5npgP3E1E59zEduJ+Iyrmf6cD9RFROF6YD+BNRXZkO4E9EdWM6gD8R1Z3pAP5EVA+mA/gTUQ8wHcCfiOrJdAB/IiqP6QD+RFQvpgP4E1G9mQ7gT0Q9yHQAfyKqD9MB/ImovkwH8Cei+jEdwJ+IeojpAP5EVH+mA/gTUQ8zHcCfiBrAdAB/IuoRpgP4E1EDmY48nONRpqM3zpHPdPTBOR5jOvrhHIOYjv44x+NMxwCcYzDTMRDneILpyMc5hjAdg3COJ5mOwTjHUKZjCM7xFNMxFOcYxnQMwzmeZjqG4xzDmY4ROMczTEcBzjGC6SjCOUYyHaNxjgKmYwzOUch0jMU5ipiOcTjHKKZjPM4xmumYgHM8y3RMwjnGMB2TcY7nmI4pOMdYpmMazvE80zEd5xjHdMzEOV5gOmbhHOOZjtk4x4tMxxycw/CV+q9c2Vl/5crukpx2knO35LSXnA6S01Fy7pGcTpJzr+R0lpz7JOd+yekiOV0lp5vkdJecHpLzgOT0lJw8yeklOb0l50Ft3WvXWxvG2mvVNqV2+LQ5pn0lbcloN0MbAfoMXR8/65Nbfeipzwv1UZs+pdIHPPpsRB8r6B253szqfaDeQundh1646zWvXi7qlZZepOj3u3416reKnpD1XKanAf0E6cGn75uSTzVXVrsYubI7bbmyOwst400s1sF2FjZXBgwbWRynkCublHpyYK7stFPLlU0qMFlecvBWm9+fl3BDTSY6kLmyl5kOYK5sCtMBzJVNZTqAubJpTAcwV/YK0wHMlU1nOoC5shlMBzBXNpPpAObKXmU6gLmyWUwHMFf2GtMBzJXNZjqAubLXmQ5grmwO0wHMlb3BdABzZXOZDmCu7E2mA5grm8d0AHNl85kOYK5sAdMBzJUtZDqAubJFTAcwV/YW0wHMlS1mOoC5sreZDmCubAnTAcyVvcN0AHNlS5kOYK7sXaYDmCtbxnQAc2XvMR3AXNlypgOYK3uf6QDmylYwHcBc2QdMBzBXtpLpAObKPmQ6gLmyVUwHMFf2EdMBzJWtZjqAubKPmQ5grkyYDmCu7BOmA5grW8N0AHNlnzIdwFzZWqYDmCv7jOkA5srWMR3AXNnnTAcwV7ae6QDmyr5gOoC5sg1MBzBX9iXTAcyVbWQ6gLmyr5gOYK5sE9MBzJVtZjqAubItTAcwV/Y10wHMlW1lOoC5sm+YDmCubBvTAcyVfct0AHNl2w2Ok3Nllf7Klb0sOVMkZ6rkTJOcVyRnuuTMkJyZkvOq5MySnNckZ7bkvC45cyTnDcmZKzlvSs48yZkvOQskZ6HkLJKct7R1r11vbRhrr1XblNrh0+aY9pW0JaPdDG0E6DN0ffysT271oac+L9RHbfqUSh/w6LMRfaygd+R6M6v3gXoLpXcfeuGu17x6uahXWnqRot/v+tWo3yp6QtZzmZ4G9BOkB5++b0o+1VzZ+cXIlU225comF1rG+65YB1slbK4MGDayOE4hV7Yj9eTAXFn6qeXKdhSYLN87eKvN78/3uKF2Eh3IXNkupgOYK9vNdABzZT8wHcBc2R6mA5gr+5HpAObK9jIdwFzZT0wHMFe2j+kA5sr2Mx3AXNkBpgOYK/uZ6QDmyg4yHcBc2S9MBzBXdojpAObKfmU6gLmyw0wHMFf2G9MBzJUdYTqAubLfmQ5gruwo0wHMlf3BdABzZceYDmCu7E+mA5grO8504HJloRJMBy5XFkpjOnC5stBpTAcuVxZKZzpwubJQBtOBy5WFPEwHLlcW8jIduFxZKJPpwOXKQllMBy5XFvIxHbhcWcjPdOByZaEA04HLlYWCTAcuVxbKZjpwubJQDtOBy5WFQkwHLlcWCjMduFxZKMJ04HJloSjTgcuVhWJMBy5XFsplOnC5slCc6cDlykIJpgOXKwslmQ5crixUkunA5cpCpZgOXK4sdDrTgcuVhUozHbhcWegMpgOXKwuVYTpwubJQWaYDlysLlWM6cLmyUHmmA5crC1VgOnC5stCZTAcuVxaqyHTgcmWhs5gOXK4sVInpwOXKQmczHbhcWaiywXFyruzsv3JluyRnt+T8IDl7JOdHydkrOT9Jzj7J2S85ByTnZ8k5KDm/SM4hyflVcg5Lzm+Sc0Ryfpeco5Lzh+Qck5w/tXWvXW9tGGuvVduU2uHT5pj2lbQlo90MbQToM3R9/KxPbvWhpz4v1Edt+pRKH/DosxF9rKB35Hozq/eBeguldx964a7XvHq5qFdaepGi3+/61ajfKnpC1nOZngb0E6QHn75vSj7VXJkEnipGsmynLVm2s9AwXqhKsQ63s7HJMlzcyOQofrIsVDX15MBkWcYpJctCVQtMlnMcvNXm9+cc3FDViA5gsix0LtOBS5aFqjMduGRZ6DymA5csC9VgOnDJslBNpgOXLAvVYjpwybLQ+UwHLlkWqs104JJloTpMBy5ZFqrLdOCSZaELmA5csix0IdOBS5aF6jEduGRZqD7TgUuWhS5iOnDJslADpgOXLAtdzHTgkmWhS5gOXLIsdCnTgUuWhS5jOnDJstDlTAcuWRZqyHTgkmWhRkwHLlkWasx0AJNlVzAdwGRZE6YDmCy7kukAJsuaMh3AZFkzpgOYLGvOdACTZVcxHcBk2dVMBzBZdg3TAUyWXct0AJNlLZgOYLLsOqYDmCxryXQAk2XXMx3AZNkNTAcwWdaK6QAmy25kOoDJspuYDmCy7GamA5gsa810AJNlbZgOYLLsFqYDmCy7lekAJstuYzqAybLbmQ5gsqwt0wFMlt3BdACTZXcyHcBk2V1MBzBZ1o7pACbL7mY6gMmy9kwHMFnWgekAJss6Mh3AZNk9TAcwWdaJ6QAmy+5lOoDJss5MBzBZdh/TAUyWGVp0/0qWVT6RLAudK6HqEjpPQjUkVFNCtSR0voRqS6iOhOpK6AIJXSihehKqL6GLJNRAQhdL6BIJXSqhyySk//OGEmqkrXvtemvDWHut2qbUDp82x7SvpC0Z7WZoI0CfoevjZ31yqw899XmhPmrTp1T6gEefjehjBb0j15tZvQ/UWyi9+9ALd73m1ctFvdLSixT9ftevRv1W0ROynsv0NKCfID349H1T8qkmy2rZc2WhaqZcmb7MEjbqUqyDrTI0V4YMG1kcp5Ar65p6cmCuzHNqubKuBSZLNwdvtfn96YYbqjvRgcyV9WA6gLmyB5gOYK6sJ9MBzJXlMR3AXFkvpgOYK+vNdABzZQ8yHcBcWR+mA5gr68t0AHNl/ZgOYK7sIaYDmCvrz3QAc2UPMx3AXNkApgOYK3uE6QDmygYyHcBc2aNMBzBXls90AHNljzEdwFzZIKYDmCt7nOkA5soGMx3AXNkTTAcwVzaE6QDmyp5kOoC5sqFMBzBX9hTTAcyVDWM6gLmyp5kOYK5sONMBzJU9w3QAc2UjmA5grmwk0wHMlRUwHcBcWSHTAcyVFTEdwFzZKKYDmCsbzXQAc2XPMh3AXNkYpgOYK3uO6QDmysYyHcBc2fNMBzBXNo7pAObKXmA6gLmy8UwHMFf2ItMBzJVNYDqAubKJTAcwVzaJ6QDmyl5iOoC5sslMBzBX9jLTAcyVTWE6gLmyqUwHMFc2jekA5speYTqAubLpTAcwVzaD6QDmymYyHcBc2atMBzBXNovpAObKXmM6gLkyw5L8K1dW5a9cWQ8JPSChnhLKk1AvCfWW0IMS6iOhvhLqJ6GHJNRfQg9LaICEHpHQQAk9KqF8CT0moUESelxCgyX0hLbuteutDWPttWqbUjt82hzTvpK2ZLSboY0AfYauj5/1ya0+9NTnhfqoTZ9S6QMefTaijxX0jlxvZvU+UG+h9O5DL9z1mlcvF/VKSy9S9Ptdvxr1W0VPyHou09OAfoL04NP3TcmnvGPZiY3IEtZkWXdbsqx7oSVu9HqxDrcq2GQZMG5kcZxCsmxO6smByTLvqSXL5hSYLG84eKvN788buKHmFvOtNn0C/fXEX9/0wovE38C24G8SFxwZgZvHdAAjcPOZDmAEbgHTAYzALWQ6gBG4RUwHMAL3FtMBjMAtZjqAEbi3mQ5gBG4J0wGMwL3DdAAjcEuZDmAE7l2mAxiBW8Z0ACNw7zEdwAjccqYDGIF7n+kARuBWMB3ACNwHTAcwAreS6QBG4D5kOoARuFVMBzAC9xHTAYzArWY6gBG4j5kOYAROmA5gBO4TpgMYgVvDdAAjcJ8yHcAI3FqmAxiB+4zpAEbg1jEdwAjc50wHMAK3nukARuC+YDqAEbgNTAcwAvcl0wGMwG1kOoARuK+YDmAEbhPTAYzAbWY6gBG4LUwHMAL3NdMBjMBtZTqAEbhvmA5gBG4b0wGMwH3LdAAjcNuZDmAE7jumAxiB28F0ACNw3zMdwAjcTqYDGIHbxXQAI3C7mQ5gBO4HpgMYgdvDdAAjcD8yHcAI3F6mAxiB+4npAEbg9jEdwAjcfqYDGIE7wHQAI3A/Mx3ACNxBpgMYgfvF4Dg5Alf1rwjcPAnNl9ACCS2U0CIJvSWhxRJ6W0JLJPSOhJZK6F0JLZPQexJaLqH3JbRCQh9IaKWEPpTQKgl9JKHV2rrXrrc2jLXXqm1K7fBpc0z7StqS0W6GNgL0Gbo+ftYnt/rQU58X6qM2fUqlD3j02Yg+VtA7cr2Z1ftAvYXSuw+9cNdrXr1c1CstvUjR73f9atRvFT0h67lMTwP6CdKDT983Jf+vInDmINObJ9Y1Za6mjOWnmP7r/KZk3dwi0/s611Jl6JBlrDLF+1mpqtj83Ru4Y/1QMd8TY/7u19STA/N3mad22P5qOmxDhx281eb35zBuqN+IDmSs7QjTAYy1/c50AGNtR5kOYKztD6YDGGs7xnQAY21/Mh3AWNtxpgMXawuXYDpwsbZwGtOBi7WFT2M6cLG2cDrTgYu1hTOYDlysLexhOnCxtrCX6cDF2sKZTAcu1hbOYjpwsbawj+nAxdrCfqYDF2sLB5gOXKwtHGQ6cLG2cDbTgYu1hXOYDlysLRxiOnCxtnCY6cDF2sIRpgMXawtHmQ5crC0cYzpwsbZwLtOBi7WF40wHLtYWTjAduFhbOMl04GJt4ZJMBy7WFi7FdOBibeHTmQ5crC1cmunAxdrCZzAduFhbuAzTgYu1hcsyHbhYW7gc04GLtYXLMx24WFu4AtOBi7WFz2Q6cLG2cEWmAxdrC5/FdOBibeFKTAcu1hY+m+nAxdrClZkOXKwtXIXpwMXawlWZDlysLXwO04GLtYWrMR24WFv4XKYDF2sLV2c6cLG28HlMBy7WFq7BdOBibeGaTAcu1hauxXTgYm3h85kOXKwtXJvpwMXawnWYDlysLVyX6cDF2sIXMB24WFv4QqYDF2sL1zM4To61nfNXrO2IhH6X0FEJ/SGhYxL6U0LHJVxCwif+AFXC6RLOkLBHwl4JZ0o4S8I+CfslHJBwUMLZEs6RcEhb99r11oax9lq1TakdPm2OaV9JWzLazdBGgD5D18fP+uRWH3rq80J91KZPqfQBjz4b0ccKekeuN7N6H6i3UHr3oRfues2rl4t6paUXKfr9rl+N+q2iJ2Q9l+lpQD9BevDp+6bk/0c7u8Wt+bPfbDu7/VZoGC9cv1iH2znYZBkubmRyFD9ZFr7IMrklWZZmSZalnVKyLHxRgcliCH3kv96oS7v29zfq3vfK3t3aN27XpUv+lBsatmjapDB/WuvOvbp1zMvTccqfUpk5cdNxm5NrwlwMwlxcvvifVt9+8dezvtD45lxSzOPXVugBa6EHzIVe6uCEYf5+wuX6wpcxHbhcX/hypgOX6ws3ZDpwub5wI6YDl+sLN2Y6cLm+8BVMBy7XF27CdABzfVcyHcBcX1OmA5jra8Z0AHN9zZkOYK7vKqYDmOu7mukA5vquYTqAub5rmQ5grq8F0wHM9V3HdABzfS2ZDmCu73qmA5jru4HpAOb6WjEdwFzfjUwHMNd3E9MBzPXdzHQAc32tmQ5grq8N0wHM9d3CdABzfbcyHcBc321MBzDXdzvTAcz1tWU6gLm+O5gOYK7vTqYDmOu7i+kA5vraMR3AXN/dTAcw19ee6QDm+jowHcBcX0emA5jru4fpAOb6OjEdwFzfvUwHMNfXmekA5vruYzqAub77mQ5grq8L0wHM9XVlOoC5vm5MBzDX153pAOb6ejAdwFzfA0wHMNfXk+kA5vrymA5grq8X0wHM9fVmOoC5vgeZDmCurw/TAcz19WU6gLm+fkwHMNf3ENMBzPX1ZzqAub6HmQ5grm8A0wHM9T1icPwraHUi9WPItVleFU79PDHtVFJej1rksJTXKQR5/PUku6fphRdJTqzAhDY808yf2ahn5y5dOnc6EZ4alVWQP7VV526dunS0HSuGUMVfI3bt0aWjhB8zJQuLnTyrryPbDuxBqRftVGYfNLKYB4Q59nex6X0u81JxP7CjLMsVetN0kD1uKnGs6ZP10ikcHqnmvkjfIEss8SKTdrCLtzr8uA5s+0g/YZjfEop8ovwpnMLDg02vGlLcUzjycHzyv/VwLHFKQfBwA9NRMVC/tmxHxVBXheZbC823FfpUcb+RPMX8RjLEFUdar4NO5bOeagkanPgQ2WY3Leiw4i6or7B4C5ryPTt+/Pg3/wz5n78K0078V+E/VwRP//PP4baLA8u57Wnby4aX/79eSKaaX1fjP78thfv/etXTpjdvuGFli71/cXiwTj/SxQnhxCVqnvES1d/QdkJ4xlWhvayFNrIVOsJVob2thTa2FersrX/QWugVtkILXBXax1poE1uhha4K7Wst9EpboUWuCu1nLbSprdBRrgp9yFpoM1uho10V2t9aaHNboc+6KvRha6FX2Qod46rQAdZCr7YV+pyrQh+xFnqNrdCxrgodaC30Wluhz7sq9FFroS1shY5zVWi+tdDrbIW+4KrQx6yFtrQVOt5VoYOshV5vK/RFV4U+bi30BluhE1wVOthaaCtboRNdFfqEtdAbbYVOclXoEGuhN9kKfclVoU9aC73ZVuhkV4UOtRba2lboy64KfcpaaBtboVNcFTrMWugttkKnuir0aWuht9oKneaq0OHWQm+zFfqKq0KfsRZ6u63Q6a4KHWEttK2t0BmuCh1pLfQOW6EzXRVaYC30Tluhr7oqtNBa6F22Qme5KrTIWmg7W6GvuSp0lLXQu22FznZV6Ghroe1thb7uqtBnrYV2sBU6x1WhY6yFdrQV+oarQp+zFnqPrdC5rgoday20k63QN10V+ry10Htthc5zVeg4a6GdbYXOd1XoC9ZC77MVusBVoeOthd5vK3Shq0JftBbaxVboIleFTrAW2tVW6FuuCp1oLbSbrdDFrgqdZC20u63Qt10V+pK10B62Qpe4KnSytdAHbIW+46rQl62F9rQVutRVoVOshebZCn3XVaFTrYX2shW6zFWh06yF9rYV+p6rQl+xFvqgrdDlrgqdbi20j63Q910VOsNaaF9boStcFTrTWmg/W6EfuCr0VWuhD9kKXemq0FnWQvvbCv3QVaGvWQt92FboKleFzrYWOsBW6EeuCn3dWugjtkJXuyp0jrXQgbZCP3ZV6BvWQo1/UC6uCp1rLdT4B+WfuCr0TWuhj9kKXeOq0HnWQgfZCv3UVaHzrYU+bit0ratCF1gLNWZ2PnNV6EJroU/YCl3nqtBF1kKH2Ar93FWhb1kLfdJW6HpXhS62FjrUVugXrgp921roU7ZCN7gqdIm10GG2Qr90Veg71kKfthW60VWhS62FDrcV+pWrQt+1FvqMrdBNrgpdZi10hK3Qza4Kfc9a6EhboVtcFbrcWmiBrdCvXRX6vrXQQluhW10VusJaaJGt0G9cFfqBtdBRtkK3uSp0pbXQ0bZCv3VV6IfWQp+1FbrdVaGrrIWOsRX6natCP7IW+pyt0B2uCl1tLXSsrdDvXRX6sbXQ522F7nRVqFgLHWcrdJerQj+xFvqCrdDdrgpdYy10vK3QH1wV+qm10Bdthe5xVehaa6ETbIX+6KrQz6yFTrQVutdVoeushU6yFfqTq0I/txb6kq3Qfa4KXW8tdLKt0P2uCv3CWujLtkIPuCp0g7XQKbZCf3ZV6JfWQqfaCj3oqtCN1kKn2Qr9xVWhX1kLfcVW6CFXhW6yFjrdVuivrgrdbC10hq3Qw64K3WItdKat0N9cFfq1tdBXbYUecVXoVmuhs2yF/u6q0G+shb5mK/Soq0K3WQudbSv0D1eFfmst9HVbocdcFbrdWugcW6F/uir0O2uhb9gKPe6q0B3WQueaCo2UcFXo99ZC37QVmuaq0J3WQufZCj3NVaG7rIXOtxWa7qrQ3dZCF9gKzXBV6A/WQhfaCvW4KnSPtdBFtkK9rgr90VroW7ZCM10Vutda6GJboVmuCv3JWujbtkJ9rgrdZy10ia1Qv6tC91sLfcdWaMBVoQeshS61FRp0VejP1kLftRWa7arQg9ZCl9kKzXFV6C/WQt+zFRpyVegha6HLbYWGXRX6q7XQ922FRlwVetha6ApboVFXhf5mLfQDW6ExV4UesRa60lZorqtCf7cW+qGt0LirQo9aC11lKzThqtA/rIV+ZCs06arQY9ZCV9sKLemq0D+thX5sK7SUq0KPWwsVW6GnOyo0p4S10E9shZZ2VWiatdA1tkLPcFXoadZCP7UVWsZVoenWQtfaCi3rqtAMa6Gf2Qot56pQj7XQdbZCy7sq1Gst9HNboRVcFZppLXS9rdAzXRWaZS30C1uhFV0V6rMWusFW6FmuCvVbC/3SVmglV4UGrIVutBV6tqtCg9ZCv7IVWtlVodnWQjfZCq3iqtAca6GbbYVWdVVoyFroFluh57gqNGwt9GtbodVcFRqxFrrVVui5rgqNWgv9xlZodUuhf28V27xb515F1TaXmCjhZyQ8QsIjJVwg4UIJF0l4lIRHS/hZCY+R8HMSHivh5yU8TsIvSHi8hF+U8AQJ6/9wkoRfkvBkCb8s4SkSnirhaRJ+RcLTJTxDwjMl/KqEZ0n4NQnPlvDrEp4j4TckPFfCb0p4noTnS3iBhBdKeJGE35LwYgm/LeElEn5Hwksl/K6El0n4PQkvl/D7El4h4Q8kvFLCH0p4lYQ/kvBqCX8sYZHwJxJeI+FPJbxWwp9JeJ2EP5fwegl/IeENEv5Swhsl/JWEN0l4s4S3SPhrCW+V8DcS3ibhbyW8XcLfSXiHhL+X8E4J75Lwbgn/IOE9Ev5Rwnsl/JOE90l4v4QPSPhnCR+U8C8SPiThXyV8WMK/SfiIhH+X8FEJ/yHhYxL+U9v82kDX1rQ2fbWdqo1KbQFqc03bVtoQ0laLNjG0PaAP3vWRtj4s1sew+oBTHx3qQzl93KUPkvQRjT780McKesOut8J6k6m3b3pjpLccejGvl8l6AaqXdnrRpJcj+kWvX6H65aSnfT2h6qlKTwL68dIDVw+JqX+/3/86QA0/0Ov5a8cvW3o2cp7huPtni+Jq0C2KLZNbh6rh4IOeJuETv4KeahEbWPfqjNQs5of83P/5kP9/8kNeaDjqTnzIIzUs30InXliz0PYpMh3GtYp1zjjXdM5II5wzahXznGE/9wI39Iyc72C1zUt0Pm6o2kRHRnWcow7TURfnqMt0XIhzXMB01Mc5LmQ6GuAc9ZiOS3CO+kzHZTjHRUxHQ5yjAdPRGOe4mOlognNcwnQ0xTkuZTqa4xyXMR1X4xyXMx3X4hwNmY7rcI5GTMf1OEdjpqMVznEF03ETztGE6WiNc1zJdNyCczRlOm7DOZoxHW1xjuZMx504x1VMRzuc42qmoz3OcQ3T0RHnuJbp6IRztGA6OuMc1zEd9+McLZmOrjjH9UxHd5zjBqbjAZyjFdORh3PcyHT0xjluYjr64Bw3Mx39cI7WTEd/nKMN0zEA57iF6RiIc9zKdOTjHLcxHYNwjtuZjsE4R1umYwjOcQfTMRTnuJPpGIZz3MV0DMc52jEdI3COu5mOApyjPdNRhHN0YDpG4xwdmY4xOMc9TMdYnKMT0zEO57iX6RiPc3RmOibgHPcxHZNwjvuZjsk4RxemYwrO0ZXpmIZzdGM6puMc3ZmOmThHD6ZjFs7xANMxG+foyXTMwTnymI65OEcvpmMeztGb6ViAczzIdCzCOfowHYtxjr5MxxKcox/TsRTneIjpWIZz9Gc6luMcDzMdK3COAUzHSpzjEaZjFc4xkOlYjXM8ynQIzpHPdKzBOR5jOtbiHIOYjnU4x+NMx3qcYzDTsQHneILp2IhzDGE6NuEcTzIdW3COoUzHVpzjKaZjG84xjOnYjnM8zXTswDmGMx07cY5nmI7dOMcIpmMPzjGS6diLcxQwHftwjkKm4wDOUcR0HMQ5RjEdh3CO0UzHYZzjWabjCM4xhuk4inM8x3QcwznGMh3HcY7niQ5PGs4xjulIxzleYDo8OMd4piMT53iR6fDhHBOYjgDOMZHpyMY5JjEdIZzjJaYjgnNMZjpiOMfLTEcc55jCdCRxjqlMRymcYxrTURrneIXpKINzTGc6yuEcM5iOCjjHTKajIs7xKtNRCeeYxXRUxjleYzqq4hyzmY5qOMfrTAdwn4Y5TEcNnOMNpqMWzjGX6aiNc7zJdAD3/5jHdAD3/5jPdAD3/1jAdAD3/1jIdAD3/1jEdAD3/3iL6QDu/7GY6QDu//E20wHc/2MJ0wHc/+MdpgO4/8dSpgO4/8e7TAdw/49lTAdw/4/3mA7g/h/LmQ7g/h/vMx3A/T9WMB3A/T8+YDqA+3+sZDqA+398yHQA9/9YxXQA9//4iOkA7v+xmukA7v/xMdMB3P9DmA7g/h+fMB3A/T/WMB3A/T8+ZTqA+3+sZTqA+398xnQA9/8wRMDzZ/ztaN6tc6+i6ptLTJRIHYnUlcgFErlQIvUkUl8iF0mkgUQulsglErlUIpdJ5HKJNJRII4k0lsgVEmkikSsl0lQizSTSXCJXSeRqiVwjkWsl0kIi10mkpUSul8gNEmklkRslcpNEbpZIa4m0kcgtErlVIrdJ5HaJtJXIHRK5UyJ3SaSdRO6WSHuJdJBIR4ncI5FOErlXIp0lcp9E7pdIF4l0lUg3iXSXSA+JPCCRnhLJk0gvifSWyIMS6SORvhLpJ5GHJNJfIg9LZIBEHpHIQIk8KpF8iTwmkUESeVwigyXyhESGSORJiQyVyFMSGSaRpyUyXCLPSGSEREZKpEAihRIpksgoiYyWyLMSGSOR5yQyViLPS2ScRF6QyHiJvCiRCRLRZZwkkZckMlkiL0tkikSmSmSaRF6RyHSJzJDITIm8qg117UVrG1c7oNo81L6btqy026ONEu0x6ON5fbKtD4X1eao+itSnePoATJ8d6WMXfWKhN/t6n6y3mHp3pjc2ek+gl9N6JaoXcXr9o5cO+q2rX1h6rtfTpJ5h9MOpx7UeElP/fr/zZzTMy+vYs9etHXt2LypMHRRKqy/hwfqymh1a9NxWa2LVhS2bzM/Pb9O2Su1dzfot6lHQeNuhov36On2VRGoXmg7P2oWG8SKfF+vDWN30YUyzfoLOx30YLY6T35SC1G+K58Rqh58yrPZp+krTaq93sNrmJQL+1MMXp7DaqVYn/eIiw9zphtdcbHovNhDfiwzgn0V8yXQA29cbmQ5g+/orpgPYvt7EdADb15uZDmD7egvTAWxff810ANvXW5kOYPv6G6YD2L7exnQA29ffMh3A9vV2pgPYvv6O6QC2r3cwHcD29fdMB7B9vZPpALavdzEdwPb1bqYD2L7+gekAtq/3MB3A9vWPTAewfb2X6QC2r39iOoDt631MB7B9vZ/pALavDzAdwPb1z0wHsH19kOkAtq9/YTqA7etDTAewff0r0wFsXx9mOvJwjt+Yjt44xxGmow/O8TvT0Q/nOMp09Mc5/mA6BuAcx5iOgTjHn0xHPs5xnOkYBBsqWoLpGIxzpDEdQ3CO05iOoThHOtMxDOfIYDqG4xwepmMEzuFlOgpwjkymowjnyGI6RuMcPqZjDM7hZzrG4hwBpmMczhFkOsbjHNlMxwScI4fpmIRzhJiOyThHmOmYgnNEmI5pOEeU6ZiOc8SYjpk4Ry7TMQvniDMds3GOBNMxB+dIMh1zcY6STMc8nKMU07EA5zid6ViEc5RmOhbjHGcwHUtwjjJMx1KcoyzTsQznKMd0LMc5yjMdK3COCkzHSpzjTKZjFc5RkelYjXOcxXQIzlGJ6ViDc5zNdKzFOSozHetwjipMB+43DaJVmY4NOMc5TMdGnKMa07EJ5ziX6diCc1RnOrbiHOcxHdtwjhpMx3acoybTsQPnqMV07MQ5zmc6duMctZmOPThHHaZjL85Rl+nYh3NcwHQcwDkuZDoO4hz1mI5DOEd9puMwznER03EE52jAdBzFOS5mOo7hHJcwHcdxjkuJDk8aznEZ05GOc1zOdHhwjoZMRybO0Yjp8OEcjZmOAM5xBdORjXM0YTpCOMeVTEcE52jKdMRwjmZMRxznaM50JHGOq5iOUjjH1UxHaZzjGqajDM5xLdNRDudowXRUwDmuYzoq4hwtmY5KOMf1TEdlnOMGpqMqztGK6aiGc9zIdOD2aYjexHTUwDluZjpq4RytmY7aOEcbpgO3/0f0FqYDt/9H9FamA7f/R/Q2pgO3/0f0dqYDt/9HtC3Tgdv/I3oH04Hb/yN6J9OB2/8jehfTgdv/I9qO6cDt/xG9m+nA7f8Rbc904Pb/iHZgOnD7f0Q7Mh24/T+i9zAduP0/op2YDtz+H9F7mQ7c/h/RzkwHbv+P6H1MB27/j+j9TAdu/49oF6YDt/9HtCvTgdv/I9qN6cDt/xHtznTg9v+I9mA6cPt/RB9gOnD7f0R7Mh24/T+ieUwHbv+PaC+mA7f/R7Q304Hb/yP6INOB2/8jatjyIX/G347m3Tr3Kjpvc4mJEvlSIhsl8pVENklks0S2SORriWyVyDcS2SaRbyWyXSLfSWSHRL6XyE6J7JLIbon8IJE9EvlRInsl8pNE9klkv0QOSORniRyUyC8SOSSRXyVyWCK/SeSIRH6XyFGJ/CGRYxL5UyLHJVpCoid+G1yi6RLNkKhHol6JZko0S6I+ifolGpBoUKLZEs2RaEiiYYlGJBqVaEyiuRKNSzQh0aRES0q0lERPl2hpiZ4h0TISLSvRchItL9EKEj1TohUlepZEK0n0bIlWlmgViVaV6DkSrSbRcyVaXaLnSbSGRGtKtJZEz5dobYnWkWhdiV4g0QslWk+i9SV6kUQbSPRiiV4i0UsleplEL5doQ4k2kmhjiV4h0SYSvVKiTSXaTKLNJXqVRK+W6DUSvVaiLSR6nURbakNde9HaxtUOqDYPte+mLSvt9mijRHsM+nhen2zrQ2F9nqqPIvUpnj4A02dH+thFn1jozb7eJ+stpt6d6Y2N3hPo5bReiepFnF7/6KWDfuvqF5ae6/U0qWcY/XDqca2HxNS/3+/8GQ3z8jr27HVrx57diwqL3i9fs0OLnttqTay6sGWT+fn5bdpWqb2rWb9FPQoabztUtF8PFAkPlsgXRYbD7sQLNxRaDtDIF4WGiaN9i/VxPM/0cUwzfoYiwJ8fsDhOflsKUq+258Rqh58yrHa6vtK02v0crLZ5iXCbu0QfIjoygH9U0J/pADZ/H2Y6gM3fAUwHsPn7CNMBbP4OZDqAzd9HmQ5g8zef6QA2fx9jOoDN30FMB7D5+zjTAWz+DmY6gM3fJ5gOYPN3CNMBbP4+yXQAm79DmQ5g8/cppgPY/B3GdACbv08zHcDm73CmA9j8fYbpADZ/RzAdwObvSKYD2PwtYDqAzd9CpgPY/C1iOoDN31FMB7D5O5rpADZ/n2U6gM3fMUwHsPn7HNMBbP6OZTqAzd/nmY48nGMc09Eb53iB6eiDc4xnOoD9wReZjv44xwSmYwDOMZHpGIhzTGI68nGOl5iOQTjHZKZjMM7xMtMxBOeYwnQMxTmmMh3DcI5pTMdwnOMVpmMEzjGd6SjAOWYwHUU4x0ymYzTO8SrTMQbnmMV0jMU5XmM6xuEcs5mO8TjH60zHBJxjDtMxCed4g+mYjHPMZTqm4BxvMh3TcI55TMd0nGM+0zET51jAdMzCORYyHbNxjkVMxxyc4y2mYy7OsZjpmIdzvM10LMA5ljAdi3COd5iOxTjHUqZjCc7xLtOxFOdYxnQswzneYzqW4xzLmY4VOMf7TMdKnGMF07EK5/iA6ViNc6xkOgTn+JDpWINzrGI61uIcHzEd63CO1UwH8NcXPmY6NuAcwnRsxDk+YTo24RxrmI4tOMenTMdWnGMt07EN5/iM6diOc6xjOnbgHJ8zHTtxjvVMx26c4wumYw/OsYHp2ItzfMl07MM5NjIdB3COr5iOgzjHJqbjEM6xmek4jHNsYTqO4BxfMx1HcY6tTMcxnOMbpuM4zrGN6PCk4RzfMh3pOMd2psODc3zHdGTiHDuYDh/O8T3TEcA5djId2TjHLqYjhHPsZjoiOMcPTEcM59jDdMRxjh+ZjiTOsZfpKIVz/MR0lMY59jEdZXCO/UxHOZzjANNRAef4memoiHMcZDoq4Ry/MB2VcY5DTEdVnONXpqMaznGY6QDu0/Ab01ED5zjCdNTCOX5nOmrjHEeZDuD+H38wHcD9P44xHcD9P/5kOoD7fxxnOnD7f8RKMB24/T9iaUwHbv+P2GlMB27/j1g604Hb/yOWwXTg9v+IeZgO3P4fMS/Tgdv/I5bJdOD2/4hlMR24/T9iPqYDt/9HzM904Pb/iAWYDtz+H7Eg04Hb/yOWzXTg9v+I5TAduP0/YiGmA7f/RyzMdOD2/4hFmA7c/h+xKNOB2/8jFmM6cPt/xHKZDtz+H7E404Hb/yOWYDpw+3/EkkwHbv+PWEmmA7f/R6wU04Hb/yN2usEx429H826dexXV2FxiokT7S/RhiQ6Q6CMSHSjRRyWaL9HHJDpIoo9LdLBEn5DoEIk+KdGhEn1KosMk+rREh0v0GYmOkOhIiRZItFCiRRIdJdHREn1WomMk+pxEx0r0eYmOk+gLEh0v0RclOkGiOuMkib4k0ckSfVmiUyQ6VaLTJPqKRKdLdIZEZ0r0VYnOkuhrEp0t0dclOkeib0h0rkTflOg8ic6X6AKJLpToIom+JdHFEn1boksk+o5El0r0XYkuk+h7El0u0fclukKiH0h0pUQ/lOgqiX4k0dUS/ViiItFPJLpGop9KdK1EP5PoOol+LtH1Ev1Cohsk+qVEN0r0K4lukuhmiW6R6NcS3SrRbyS6TaLfSnS7RL+T6A6Jfi/RnRLdJdHdEv1Bonsk+qNE90r0J4nuk+h+iR6Q6M8SPagNde1FaxtXO6DaPNS+m7astNujjRLtMejjeX2yrQ+F9XmqPorUp3j6AEyfHeljF31ioTf7ep+st5h6d6Y3NnpPoJfTeiWqF3F6/aOXDvqtq19Yeq7X06SeYfTDqce1HhJT/36/82c0zMvr2LPXrR17di8qTP1byWkXSniwvqxmhxY9t9WaWHVhyybz8/PbtK1Se1ezfot6FDTedqhov75OXyXRhwpNj+0fKjSMFytdrA9jDdOHMc3aWcBtNmJynPymFKR+UzwnVjv8lGG1M/SVptU+w8Fqm5foDNxQZYiODNyfFMTKMh241m+sHNOBa/3GyjMduNZvrALTgWv9xs5kOoCt34pMB7D1exbTAWz9VmI6gK3fs5kOYOu3MtMBbP1WYTqArd+qTAew9XsO0wFs/VZjOoCt33OZDmDrtzrTAWz9nsd0AFu/NZgOYOu3JtMBbP3WYjqArd/zmQ5g67c20wFs/dZhOoCt37pMB7D1ewHTAWz9Xsh0AFu/9ZgOYOu3PtMBbP1exHQAW78NmA5g6/dipgPY+r2E6cjDOS5lOnrjHJcxHX1wjsuZDmA3tiHT0R/naMR0DMA5GjMdA3GOK5iOfJyjCdMxCOe4kukYjHM0ZTqG4BzNmI6hOEdzpmMYznEV0zEc57ia6RiBc1zDdBTgHNcyHUU4RwumYzTOcR3TMQbnaMl0jMU5rmc6xuEcNzAd43GOVkzHBJzjRqZjEs5xE9MxGee4memYgnO0Zjqm4RxtmI7pOMctTMdMnONWpmMWznEb0zEb57id6ZiDc7RlOubiHHcwHfNwjjuZjgU4x11MxyKcox3TsRjnuJvpWIJztGc6luIcHZiOZThHR6ZjOc5xD9OxAufoxHSsxDnuZTpW4RydmY7VOMd9TIfgHPczHWtwji5Mx1qcoyvTsQ7n6MZ0rMc5ujMdG3COHkzHRpzjAaZjE87Rk+nYgnPkMR1bcY5eTMc2nKM307Ed53iQ6diBc/RhOnbiHH2Zjt04Rz+mYw/O8RDTsRfn6M907MM5HmY6DuAcA5iOgzjHI0zHIZxjINNxGOd4lOk4gnPkMx1HcY7HmI5jOMcgpuM4zvE40eFJwzkGMx3pOMcTTIcH5xjCdGTiHE8yHT6cYyjTEcA5nmI6snGOYUxHCOd4mumI4BzDmY4YzvEM0xHHOUYwHUmcYyTTUQrnKGA6SuMchUxHGZyjiOkoh3OMYjoq4ByjmY6KOMezTEclnGMM01EZ53iO6aiKc4xlOqrhHM8zHcB9GsYxHTVwjheYjlo4x3imozbO8SLTAdz/YwLTAdz/YyLTAdz/YxLTAdz/4yWmA7j/x2SmA7j/x8tMB3D/jylMB3D/j6lMB3D/j2lMB3D/j1eYDuD+H9OZDuD+HzOYDuD+HzOZDuD+H68yHcD9P2YxHcD9P15jOoD7f8xmOoD7f7zOdAD3/5jDdAD3/3iD6QDu/zGX6QDu//Em0wHc/2Me0wHc/2M+0wHc/2MB0wHc/2Mh0wHc/2MR0wHc/+MtpgO4/8dipgO4/8fbTAdw/w/DT9Pkz/jb0bxb515FNTeXmCixshIrJ7HyEqsgsTMlVlFiZ0msksTOllhliVWRWFWJnSOxahI7V2LVJXaexGpIrKbEaknsfInVllgdidWV2AUSu1Bi9SRWX2IXSayBxC6W2CUSu1Ril0nscok1lFgjiTWW2BUSayKxKyXWVGLNJNZcYldJ7GqJXSOxayXWQmLXSaylxK6X2A0SayWxGyV2k8RullhribWR2C0Su1Vit0nsdom1ldgdErtTYndJrJ3E7pZYe4l1kFhHid0jsU4Su1dinSV2n8Tul1gXiXWVWDeJdZdYD4k9ILGeEsuTWC+J9ZbYgxLrI7G+EusnsYck1l9iD0tsgMQekdhAiT0qsXyJPSaxQRJ7XGKDJfaExIZI7EmJDZXYUxIbJrGnJTZcYs9IbITERkqsQGKFEiuS2CiJjZbYs9pQ1160tnG1A6rNQ+27actKuz3aKNEegz6e1yfb+lBYn6fqo0h9iqcPwPTZkT520ScWerOv98l6i6l3Z3pjo/cEejmtV6J6EafXP3rpoN+6+oWl53o9TeoZRj+celzrITH17/c7f0bDvLyOPXvd2rFn96LCIsPRFB4s4Sf1hTU7tOi5rdbEqgtbNpmfn9+mbZXau5r1W9SjoPG2Q0X79ZUnXhgrU2g6QMsUGsaLvVOsj2NN08cxzfoZOgP3cbQ4Tn5bCqxvy1Om1Q4PNq224Xeg8l9v1KVd+/sbde97Ze9u7Ru369Ilf8oNDVs0bVKYP611517dOubph2hp+WK/KeasBrBn/66Dg8vsAPZWlzEdwN7qe0wHsLe6nOkA9lbfZzqAvdUVTAewt/oB0wHsra5kOoC91Q+ZDmBvdRXTAeytfsR0AHurq5kOYG/1Y6YD2FsVpgPYW/2E6QD2VtcwHcDe6qdMB7C3upbpAPZWP2M6gL3VdUwHsLf6OdMB7K2uZzqAvdUvmA5gb3UD0wHsrX7JdAB7qxuZDmBv9SumA9hb3cR0AHurm5kOYG91C9MB7K1+zXQAe6tbmY48nOMbpqM3zrGN6eiDc3zLdPTDObYzHf1xju+YjgE4xw6mYyDO8T3TkY9z7GQ6BuEcu5iOwTjHbqZjCM7xA9MxFOfYw3QMwzl+ZDqG4xx7mY4ROMdPTEcBzrGP6SjCOfYzHaNxjgNMxxic42emYyzOcZDpGIdz/MJ0jMc5DjEdE3COX5mOSTjHYaZjMs7xG9MxBec4wnRMwzl+Zzqm4xxHmY6ZOMcfTMcsnOMY0zEb5/iT6ZiDcxxnOubChsotwXTMwznSmI4FOMdpTMcinCOd6ViMc2QwHUtwDg/TsRTn8DIdy3COTKZjOc6RxXSswDl8TMdKnMPPdKzCOQJMx2qcI8h0CM6RzXSswTlymI61OEeI6ViHc4SZjvU4R4Tp2IBzRJmOjThHjOnYhHPkMh1bcI4407EV50gwHdtwjiTTsR3nKMl07MA5SjEdO3GO05mO3ThHaaZjD85xBtOxF+cow3TswznKMh0HcI5yTMdBnKM803EI56jAdBzGOc5kOo7gHBWZjqM4x1lMxzGcoxLTcRznOJvo8KThHJWZjnScowrT4cE5qjIdmTjHOUyHD+eoxnQEcI5zmY5snKM60xHCOc5jOiI4Rw2mI4Zz1GQ64jhHLaYjiXOcz3SUwjlqMx2lcY46TEcZnKMu01EO57iA6aiAc1zIdFTEOeoxHZVwjvpMR2Wc4yKmoyrO0YDpqIZzXMx04PZpyL2E6aiBc1zKdNTCOS5jOmrjHJczHbj9P3IbMh24/T9yGzEduP0/chszHbj9P3KvYDpw+3/kNmE6cPt/5F7JdOD2/8htynTg9v/IbcZ04Pb/yG3OdOD2/8i9iunA7f+RezXTgdv/I/capgO3/0futUwHbv+P3BZMB27/j9zrmA7c/h+5LZkO3P4fudczHbj9P3JvYDpw+3/ktmI6cPt/5N7IdOD2/8i9ienA7f+RezPTgdv/I7c104Hb/yO3DdOB2/8j9xamA7f/R+6tTAdu/4/c25gO3P4fubczHbj9P3LbMh24/T9y72A6cPt/5Bq+Uv+1mXuheTN30wuH6AtPFJpyP/fcu4pZqGXX+YskPKjIMPtFlgrDg0yO1N/9acV2NNBhDYdX/sxGPTt36dK504mt7kd5R+dPbdW5W6cuHW3HiqWzX6wB66EHvLAYA5qP4yesx/GTI9EeiRh+EKDwxJhde3TpKLl3//PP9tbPv+FSNP/1Rl3atb+/Ufe+V/bu1v7EsZM/5YaGLZo2Kcyf1rpzr24d8/J07vL/Prp8hcVf6qHWpR6aYqmPHz/+2z9L/Z9fnHbiv05axA7//LOj5aSdZlqeDraXdSxf7M/+3ytnOoeWPeTgHPr3G2Kb/9dizj9y1H8etnD/X8dwB9OJt6Pl81D2kOlVvxqOv/+6kIavBqWMLOYSFVpGzsmVnFKW91JfGL6s0LIEOaVMi36PK87pVs7lNs7pJk4nV5zSVk5DG6e0iXOvK84ZVk4jG+cME6ezK04ZK6exjVPGxLnPFaeslXOFjVPWxLnfFaecldPExiln4nRxxSlv5Vxp45Q3cbq64lSwcpraOBVMnG6uOGdaOc1snDNNnO6uOBWtnOY2TkUTp4crzllWzlU2zlkmzgOuOJWsnKttnEomTk9XnLOtnGtsnLNNnDxXnMpWzrU2TmUTp5crThUrp4WNU8XE6e2KU9XKuc7GqWriPOiKc46V09LGOcfE6eOKU83Kud7GqWbi9HXFOdfKucHGOdfE6eeKU93KaWXjVDdxHnLFOc/KudHGOc/E6e+KU8PKucnGqWHiPOyKU9PKudnGqWniDHDFqWXltLZxapk4j7jinG/ltLFxzjdxBrri1LZybrFxaps4j7ri1LFybrVx6pg4+a44da2c22ycuibOY644F1g5t9s4F5g4g1xxLrRy2to4F5o4j7vi1LNy7rBx6pk4g11x6ls5d9o49U2cJ1xxLrJy7rJxTH/CkTvEFaeBldPOxmlg4jzpinOxlXO3jXOxiTPUFecSK6e9jXOJifOUK86lVk4HG+dSE2eYK85lVk5HG+cyE+dpV5zLrZx7bJzLTZzhrjgNrZxONk5DE+cZV5xGVs69Nk4jE2eEK05jK6ezjdPYxHH2RyxXWDn32ThXmDgFrjhNrJz7bZwmJk6hK86VVk4XG+dKE6fIFaepldPVxmlq4oxyxWlm5XSzcZqZOKNdcZpbOd1tnOYmzrOuOFdZOT1snKtMnDGuOFdbOQ/YOFebOM+54lxj5fS0ca4xcca64lxr5eTZONeaOM+74rSwcnrZOC1MnHGuONdZOb1tnOtMnBdccVpaOQ/aOC1NnPGuONdbOX1snOtNnBddcW6wcvraODeYOBNccVpZOf1snFYmzkRXnButnIdsnBtNnEmuODdZOf1tnJtMnJdccW62ch62cW42cSa74rS2cgbYOK1NnJddcdpYOY/YOG1MnCkWzt+54ObdOvcqqrW5xOWSe4/kdpLceyW3s+TeJ7n3S24Xye0qud0kt7vk9pDcByS3p+TmSW4vye0tuQ9Kbh/J7Su5/ST3IcntL7kPS+4AyX1EW+fabtYWrbY1tRWo7TNtOWmbRlsb2g7QR+j62Fkf1erjTX0kqI/R9NGTPq7RRxz6WEBvpfX2U2/Z9DZHbw30clovQfWyTS919PJAv1L1a0hP3Xq601OEfqz0UNS3T8lT//b8O7pVZFquqamXPssUysoqfrrMlG47EcqaaksoTzPM/08kvBY0Em6Z3DrUK8U8hM//3/QQtuRWTxwglhPSicPolULb8psOtunFOtjONx1saYSDbXoxP7TG88qM/9bzStqpnVdm2M4rMx281eb3ZyZuqFeJjgzgT7jPYjqAP7X9GtMB/Knt2UwH8Ke2X2c6gD+1PYfpAP7U9htMB/CntucyHcCf2n6T6QD+1PY8pgP4U9vzmQ7gT20vYDqAP7W9kOkA/tT2IqYD+FPbbzEdwJ/aXsx0AH9q+22moxXOsYTpAP7U9jtMB/CntpcyHcCf2n6X6QD+1PYypgP4U9vvMR3An9peznQAf2r7faYD+FPbK5gO4E9tf8B0AH9qeyXTAfyp7Q+ZDuBPba9iOoA/tf0R0wH8qe3VTAfwp7Y/ZjrycA5hOnrjHJ8wHX1wjjVMRz+c41Omoz/OsZbpGIBzfMZ0DMQ51jEd+TjH50zHIJxjPdMxGOf4gukYgnNsYDqG4hxfMh3DcI6NTMdwnOMrpmMEzrGJ6SjAOTYzHUU4xxamYzTO8TXTMQbn2Mp0jMU5vmE6xuEc25iO8TjHt0zHBJxjO9MxCef4jumYjHPsYDqm4BzfMx3ACMBOpmM6zrGL6QD+nf5upmMWzvED0zEb59jDdMzBOX40OE7OldX+K1c2S3Jfk9zZkvu65M6R3Dckd67kvim58yR3vuQukNyFkrtIct+S3MWS+7bkLpHcdyR3qeS+K7nLJPc9yV2urXvtemvDWHut2qbUDp82x7SvpC0Z7WZoI0CfoevjZ31yqw899XmhPmrTp1T6gEefjehjBb0j15tZvQ/UWyi9+9ALd73m1ctFvdLSixT9ftevRv1W0ROynsv0NKCfID349H1T8qnmyuoXI1f2qi1X9mqhZby9xTrYamNzZcCTmMVxCrmyn1JPDsyVnXZqubKfCkyWfQ7eavP7sw831H6iA5krO8B0AHNlPzMdwFzZQaYDmCv7hekA5soOMR3AXNmvTAcwV3aY6QDmyn5jOoC5siNMBzBX9jvTAcyVHWU6gLmyP5gOYK7sGNMBzJX9yXQAc2XHmQ5crixegunA5criaUwHLlcWP43pwOXK4ulMBy5XFs9gOnC5sriH6cDlyuJepgOXK4tnMh24XFk8i+nA5criPqYDlyuL+5kOXK4sHmA6cLmyeJDpwOXK4tlMBy5XFs9hOnC5sniI6cDlyuJhpgOXK4tHmA5criweZTpwubJ4jOnA5criuUwHLlcWjzMduFxZPMF04HJl8STTgcuVxUsyHbhcWbwU04HLlcVPZzpwubJ4aaYDlyuLn8F04HJl8TJMBy5XFi/LdOByZfFyTAcuVxYvz3TgcmXxCkwHLlcWP5PpwOXK4hWZDlyuLH4W04HLlcUrMR24XFn8bKYDlyuLV2Y6cLmyeBWmA5cri1dlOnC5svg5TAcuVxavxnTgcmXxc5kOXCQjXp3pwOXK4ucxHbhcWbwG04HLlcVrGhwn58rq/JUrOyC5P0vuQcn9RXIPSe6vkntYcn+T3COS+7vkHpXcPyT3mOT+KbnHJV5C4if+sEji6RLPkLhH4l6JZ2rrXrve2jDWXqu2KbXDp80x7StpS0a7GdoI0Gfo+vhZn9zqQ099XqiP2vQplT7g0Wcj+lhB78j1ZlbvA/UWSu8+9MJdr3n1clGvtPQiRb/f9atRv1X0hKznMj0N6CdIDz5935R8qrmyesXIle235cr2FxrGi9cq1sFWB5srw4WNTI7i58ri56eeHJgrSz+lXFn8/AKTpbaDt9r8/tTGDVWH6ADmyuJ1mQ5crix+AdOBy5XFL2Q6cLmyeD2mA5cri9dnOnC5svhFTAcuVxZvwHTgcmXxi5kOXK4sfgnTgcuVxS9lOnC5svhlTAcuVxa/nOnA5criDZkOXK4s3ojpwOXK4o2ZDmCu7AqmA5gra8J0AHNlVzIdwFxZU6YDmCtrxnQAc2XNmQ5gruwqpgOYK7ua6QDmyq5hOoC5smuZDmCurAXTAcyVXcd0AHNlLZkOYK7seqYDmCu7gekA5spaMR3AXNmNTAcwV3YT0wHMld3MdABzZa2ZDmCurA3TAcyV3cJ0AHNltzIdwFzZbUwHMFd2O9MBzJW1ZTqAubI7mA5gruxOpgOYK7uL6QDmytoxHcBc2d1MBzBX1p7pAObKOjAdwFxZR6YDmCu7h+kA5so6MR3AXNm9TAcwV9aZ6QDmyu5jOoC5svuZDmCurAvTAcyVdWU6gLmybkwHMFfWnekA5sp6MB3AXNkDTAcwV9aT6QDmyvKYDmCurJfBcXKurO6JXFm8rsQvkPiFEq8n8foSv0jiDSR+scQvkfilEr9M4vqahhJvJPHGEr9C4k0kfqXEm0q8mcSbS/wqiV+trXvtemvDWHut2qbUDp82x7SvpC0Z7WZoI0CfoevjZ31yqw899XmhPmrTp1T6gEefjehjBb0j15tZvQ/UWyi9+9ALd73m1ctFvdLSixT9ftevRv1W0ROynsv0NKCfID349H1T8qnmyiSywZ4si9cxJcv0ZZa4Ue9iHW51ockyZNzI4jiFZNmDqScHJssyTi1Z9mCBydLHwVttfn+AHbC+RAcyWdaP6QAmyx5iOoDJsv5MBzBZ9jDTAUyWDWA6gMmyR5gOYLJsINMBTJY9ynQAk2X5TAcwWfYY0wFMlg1iOoDJsseZDmCybDDTAUyWPcF0AJNlQ5gOYLLsSaYDmCwbynQAk2VPMR3AZNkwpgOYLHua6QAmy4YzHcBk2TNMBzBZNoLpACbLRjIdwGRZAdMBTJYVMh3AZFkR0wFMlo1iOoDJstFMBzBZ9izTAUyWjWE6gMmy55gOYLJsLNMBTJY9z3QA+2rjmA5gsuwFpgOYLBvPdACTZS8yHcBk2QSmA5gsm8h0AJNlk5gOYLLsJaYDmCybzHQAk2UvMx3AZNkUpgOYLJvKdACTZdOYDmCy7BWmA5gsm850AJNlM5gOYLJsJtMBTJa9ynQAk2WzmA5gsuw1pgOYLJvNdACTZa8zHcBk2RymA5gse4PpACbL5jIdwGTZm0wHMFk2j+kAJsvmMx3AZNkCpgOYLFtocJycLLvgr2RZP4k/JPH+En9Y4gMk/ojEB0r8UYnnS/wxiQ+S+OMSHyzxJyQ+ROJPSnyoxJ+S+DCJPy3x4RJ/RuIjtHWvXW9tGGuvVduU2uHT5pj2lbQlo90MbQToM3R9/KxPbvWhpz4v1Edt+pRKH/DosxF9rKB35Hozq/eBeguldx964a7XvHq5qFdaepGi3+/61ajfKnpC1nOZngb0E6QHn75vSj7VZNmFxciV9bXlyvoWWsJGi4p1sF2AzZUBmyIWxynkyt5KPTkwV+Y5tVzZWwUmy2IHb7X5/VmMG+ptogOZK1vCdABzZe8wHcBc2VKmA5gre5fpAObKljEdwFzZe0wHMFe2nOkA5sreZzqAubIVTAcwV/YB0wHMla1kOoC5sg+ZDmCubBXTAcyVfcR0AHNlq5kOYK7sY6YDmCsTpgOYK/uE6QDmytYwHcBc2adMBzBXtpbpAObKPmM6gLmydUwHMFf2OdMBzJWtZzqAubIvmA5grmwD0wHMlX3JdABzZRuZDmCu7CumA5gr28R0AHNlm5kOYK5sC9MBzJV9zXQAW6hbmQ5gruwbpgOYK9vGdABzZd8yHcBc2XamA5gr+47pAObKdjAdwFzZ90wHMFe2k+kA5sp2MR3AXNlupgOYK/uB6QDmyvYwHcBc2Y9MBzBXtpfpAObKfmI6gLmyfUwHMFe2n+kA5soOMB3AXNnPTAcwV3aQ6QDmyn5hOoC5skNMBzBX9ivTAcyVHWY6gLmy35gOYK7sCNMBzJX9znQAc2VHmQ5gruwPg+PkXNmFf+XKlkj8HYkvlfi7El8m8fckvlzi70t8hcQ/kPhKiX8o8VUS/0jiqyX+scRF4p9IfI3EP5X4Wol/JvF12rrXrrc2jLXXqm1K7fBpc0z7StqS0W6GNgL0Gbo+ftYnt/rQU58X6qM2fUqlD3j02Yg+VtA7cr2Z1ftAvYXSuw+9cNdrXr1c1CstvUjR73f9atRvFT0h67lMTwP6CdKDT983JZ/yjmW57SS3vTVZ9rYtWfZ2oSVudKxYh9uF2GQZMG5kcZxCsuzP1JMDk2XeU0uW/Vlgshx38Fab35/jsKESJYr5Vps+geHBEn7C9MIhEn7StOCJNOKCAyNwidOYDlwELpHOdOAicIkMpgMXgUt4mA5cBC7hZTpwEbhEJtOBi8AlspgOXAQu4WM6cBG4hJ/pwEXgEgGmAxeBSwSZDlwELpHNdOAicIkcpgMXgUuEmA5cBC4RZjpwEbhEhOnAReASUaYDF4FLxJgOXAQukct04CJwiTjTgYvAJRJMBy4Cl0gyHbgIXKIk04GLwCVKMR24CFzidKYDF4FLlGY6cBG4xBlMBy4ClyjDdOAicImyTAcuApcox3TgInCJ8kwHLgKXqMB04CJwiTOZDlwELlGR6cBF4BJnMR24CFyiEtOBi8AlzmY6cBG4RGWmAxeBS1RhOnARuERVpgMXgUucw3TgInCJakwHLgKXOJfpwEXgEtWZDlwELnEe04GLwCVqMB24CFyiJtOBi8AlajEduAhc4nymAxeBS9RmOnARuEQdpgMXgUvUZTpwEbjEBUwHLgKXuJDpwEXgEvWYDlwELlGf6cBF4BIXMR24CFyiAdOBi8AlLmY6cBG4xCVMBy4Cl7iU6cBF4BKXMR24CFzicqYDF4FLGP4U+F8RuHonInCJ0ySRLokMSXgk4ZVEpiSyJOGThF8SAUkEJZEtiRxJhCQRlkREElFJxCSRK4m4JBKSSEqipLbuteutDWPttWqbUjt82hzTvpK2ZLSboY0AfYauj5/1ya0+9NTnhfqoTZ9S6QMefTaijxX0jlxvZvU+UG+h9O5DL9z1mlcvF/VKSy9S9Ptdvxr1W0VPyHou09OAfoL04NP3Tcn/qwicNciUSDuxrilzNeWesKzrf5nfkqxLlCgyva8lLFUmGlnGMln+OdbrYfN3wFBWo2K+J7b8XaJx6smB+bvMUztsG5sO28QVDt5q8/tzBW6oJkQHMtZ2JdMBjLU1ZTqAsbZmTAcw1tac6QDG2q5iOoCxtquZDmCs7RqmAxhru5bpAMbaWjAdwFjbdUwHMNbWkukAxtquZzqAsbYbmA5grK0V0wGMtd3IdABjbTcxHcBY281MBzDW1prpAMba2jAdwFjbLUwHMNZ2K9MBjLXdxnQAY223Mx3AWFtbpgMYa7uD6QDG2u5kOoCxtruYDmCsrR3TAYy13c10AGNt7ZkOYKytA9MBjLV1ZDqAsbZ7mA5grK0T0wGMtd3LdABjbZ2ZDmCs7T6mAxhru5/pAMbaujAdwFhbV6YDGGvrxnQAY23dmQ5grK0H0wGMtT3AdABjbT2ZDmCsLY/pAMbaejEdwFhbb6YDGGt7kOkAxtr6MB3AWFtfpgMYa+vHdABjbQ8xHcBYW3+mAxhre5jpAMbaBjAdwFjbI0wHMNY2kOkAxtoeZTqAsbZ8pgMYa3uM6QDG2gYxHcBY2+NMBzDWZnj08q9YW/2/Ym1XSqKpJJpJorkkrpLE1ZK4RhLXSqKFJK6TREtJXC+JGyTRShI3SuImSdwsidaSaCOJWyRxqyRuk8Tt2rrXrrc2jLXXqm1K7fBpc0z7StqS0W6GNgL0Gbo+ftYnt/rQU58X6qM2fUqlD3j02Yg+VtA7cr2Z1ftAvYXSuw+9cNdrXr1c1CstvUjR73f9atRvFT0h67lMTwP6CdKDT983Jf8/2tntbmv+rIlpZzd9mSVuVLxkWX1osgwZNypu2s+YLBtimdySLEuzJMvSTi1ZNqTAZHnSsESvN+rSrv39jbr3vbJ3t/aN23Xpkj/lhoYtmjYpzJ/WunOvbh3z9JPxZPlTKjP3btNxm9vOhBkKwgwtfwq7wF0i4cHWFxrfnKeKefzaCr3UWuil5kKHOThhmL+fgLm+p5kOYK5vONMBzPU9w3QAc30jmA5grm8k0wHM9RUwHcBcXyHTAcz1FTEdwFzfKKYDmOsbzXQAc33PMh3AXN8YpgOY63uO6QDm+sYyHcBc3/NMBzDXN47pAOb6XmA6gLm+8UwHMNf3ItMBzPVNYDqAub6JTAcw1zeJ6QDm+l5iOoC5vslMBzDX9zLTAcz1TWE6gLm+qUwHMNc3jekA5vpeYTqAub7pTAcw1zeD6QDm+mYyHcBc36tMBzDXN4vpAOb6XmM6gLm+2UwHMNf3OtMBzPXNYTqAub43mA5grm8u0wHM9b3JdABzffOYDmCubz7TAcz1LWA6gLm+hUwHMNe3iOkA5vreYjqAub7FTAcw1/c20wHM9S1hOoC5vneYDmCubynTAcz1vct0AHN9y5gOYK7vPaYDmOtbznQAc33vMx3AXN8KpgOY6/uA6QDm+lYyHcBc34dMBzDXt4rpAOb6PmI6gLm+1QbHv4JWJ1I/hlyb5VWJj1NXeCopL7HIYSmvUwnyDJbYUtMLh0juXQUm9CeGQmc26tm5S5fOnU6Ep0ZlFeRPbdW5W6cuHW3HiuGP3/8asWuPLh0lscaULCx28uwyHdl2YH+aetFOZfZPRxbzgDDH/oaa3udyI4r7gR1lWq4000G21lTiE5YZDZC0Ym/oeLm+QZZY4uUm7Wcu3urEWh3Y9pFeZ5jfEopcV/4UTuGJz0yv+ry4p3Dk4bj+v/VwLHFKQfDEk6aj4mP92rIdFV+4KvQTa6Gf2ArdUNxvJE8xv5EMsbKR1uugU/msp1qChic+RLbZTQv6ZXEX1FdYvAVN+Z4dP378m3+G/M9fhWkn/qvwnyuCjf/88yvbxYHl3LbR9rKvyv9fLyRTza+r8Z/flsL9f71qo+nN+8qwssXevzjxmU4/0sUJ4cQl6rvGS9TwM7YTwiZXhS6zFjrCVuhmV4W+Zy10pK3QLa4KXW4ttMBW6NeuCn3fWmihrdCtrgpdYS20yFboN64K/cBa6ChbodtcFbrSWuhoW6Hfuir0Q2uhz9oK3e6q0FXWQsfYCv3OVaEfWQt9zlboDleFrrYWOtZW6PeuCv3YWujztkJ3uipUrIWOsxW6y1Whn1gLfcFW6G5Xha6xFjreVugPrgr91Froi7ZC97gqdK210Am2Qn90Vehn1kIn2grd66rQddZCJ9kK/clVoZ9bC33JVug+V4WutxY62VbofleFfmEt9GVboQdcFbrBWugUW6E/uyr0S2uhU22FHnRV6EZrodNshf7iqtCvrIW+Yiv0kKtCN1kLnW4r1Fl7dLO10Bm2Qg+7KnSLtdCZtkJ/c1Xo19ZCX7UVesRVoVuthc6yFfq7q0K/sRb6mq3Qo64K3WYtdLat0D9cFfqttdDXbYUec1Xodmuhc2yF/umq0O+shb5hK/S4q0J3WAudayo0WcJVod9bC33TVmiaq0J3WgudZyv0NFeF7rIWOt9WaLqrQndbC11gKzTDVaE/WAtdaCvU46rQPdZCF9kK9boq9EdroW/ZCs10Vehea6GLbYVmuSr0J2uhb9sK9bkqdJ+10CW2Qv2uCt1vLfQdW6EBV4UesBa61FZo0FWhP1sLfddWaLarQg9aC11mKzTHVaG/WAt9z1ZoyFWhh6yFLrcVGnZV6K/WQt+3FRpxVehha6ErbIVGXRX6m7XQD2yFxlwVesRa6EpbobmuCv3dWuiHtkLjrgo9ai10la3QhKtC/7AW+pGt0KSrQo9ZC11tK7Skq0L/tBb6sa3QUq4KPW4t1PYH5cnTHRWaW8JaqO0PypOlXRWaZi10ja3QM1wVepq10E9thZZxVWi6tdC1tkLLuio0w1qoLbOTLOeqUI+10HW2Qsu7KtRrLfRzW6EVXBWaaS10va3QM10VmmUt9AtboRVdFeqzFrrBVuhZrgr1Wwv90lZoJVeFBqyFbrQVerarQoPWQr+yFVrZVaHZ1kI32Qqt4qrQHGuhm22FVnVVaMha6BZboee4KjRsLfRrW6HVXBUasRa61Vboua4KjVoL/cZWaHVXhcashW6zFXqeq0JzrYV+ayu0hqtC49ZCt9sKremq0IS10O9shdZyVWjSWugOW6Hnuyq0pLXQ722F1nZVaClroTtthdZxVejp1kJ32Qqt66rQ0tZCd9sKvcBVoWdYC/3BVuiFrgotYy10j63Qeq4KLWst9EdbofVdFVrOWuheW6EXuSq0vLXQn2yFNnBVaAVroftshV7sqtAzrYXutxV6iatCK1oLPWAr9FJXhZ5lLfRnW6GXuSq0krXQg7ZCL3dV6NnWQn+xFdrQVaGVrYUeshXayFWhVayF/mortLGrQqtaCz1sK/QKV4WeYy30N1uhTVwVWs1a6BFboVe6KvRca6G/2wpt6qrQ6tZCj9oKbeaq0POshf5hK7S5q0JrWAs9Ziv0KleF1rQW+qet0KtdFVrLWuhxW6HXuCr0fGOhkRK2Qq91VWhta6FptkJbuCq0jrXQ02yFXueq0LrWQtNthbZ0VegF1kIzbIVe76rQC62FemyF3uCq0HrWQr22Qlu5KrS+tdBMW6E3uir0ImuhWbZCb3JVaANroT5boTe7KvRia6F+W6GtXRV6ibXQgK3QNq4KvdRaaNBW6C2uCr3MWmi2rdBbXRV6ubXQHFuht7kqtKG10JCt0NtdFdrIWmjYVmhbV4U2thYasRV6h6tCr7AWGrUVeqerQptYC43ZCr3LVaFXWgvNtRXazlWhTa2Fxm2F3u2q0GbWQhO2Qtu7KrS5tdCkrdAOrgq9ylpoSVuhHV0VerW10FK2Qu9xVeg11kJPtxXayVWh11oLLW0r9F5XhbawFnqGrdDOrgq9zlpoGVuh97kqtKW10LK2Qu93Vej11kLL2Qrt4qrQG6yFlrcV2tVVoa2shVawFdrNVaE3Wgs901Zod1eF3mQttKKt0B6uCr3ZWuhZtkIfcFVoa2uhlWyF9nRVaBtroWfbCs1zVegt1kIr2wrt5arQW62FVrEV2ttVobdZC61qK/RBV4Xebi30HFuhfVwV2tZaaDVboX1dFXqHtdBzbYX2c1XondZCq9sKfchS6N9bxTbv1rlX0UWbS0yUxCZJbJbEFkl8LYmtkvhGEtsk8a0ktkviO0nskMT3ktgpiV2S2C2JHySxRxI/SmKvJH6SxD5J7JfEAUn8LImDkvhFEock8askDkviN0kckcTvkjgqiT8kcUwSf0riuCRP/BChJE+TZLokMyTpkaRXkpmSzJKkT5J+SQYkGZRktiRzJBmSZFiSEUlGJRmTZK4k45JMSDIpyZKSLCXJ0yVZWpJnSLKMJMtKspwky0uygiTPlGRFSZ4lyUqSPFuSlSVZRZJVJXmOJKtJ8lxJVpfkeZKsIcmakqwlyfMlWVuSdSRZV5IXSPJCSdaTZH1JXiTJBpK8WJKXSPJSSV4mycsl2VCSjSTZWJJXSLKJJK+UZFNJNpNkc0leJcmrtc2vDXRtTWvTV9up2qjUFqA217RtpQ0hbbVoE0PbA/rgXR9p68NifQyrDzj10aE+lNPHXfogSR/R6MMPfaygN+x6K6w3mXr7pjdGesuhF/N6mawXoHpppxdNejmiX/T6FapfTnra1xOqnqr0JKAfLz1w9ZCY+vf7/a8D1LB9pOevHb+M6dn+huPuny2KL4JuUWyZ3DrUww4+6GmSOPEr6KkWsaF1r87kgGJ+yBv8z4f8/5Mf8kLDUXfiQ5582PItdOKFAwptnyLTYfxIsc4ZDUznjDTCOeORYp4z7Ode4IaeyYEOVtu8RANxQz1KdGRUxznymY66OMdjTMeFOMcgpqM+zvE409EA5xjMdFyCczzBdFyGcwxhOhriHE8yHY1xjqFMRxOc4ymmoynOMYzpaI5zPM10XI1zDGc6rsU5nmE6rsM5RjAd1+McI5mOVjhHAdNxE85RyHS0xjmKmI5bcI5RTMdtOMdopqMtzvEs03EnzjGG6WiHczzHdLTHOcYyHR1xjueZjk44xzimozPO8QLTcT/OMZ7p6IpzvMh0dMc5JjAdD+AcE5mOPJxjEtPRG+d4ienog3NMZjr64RwvMx3ArvIUpmMAzjGV6QD2nacxHfk4xytMxyCcYzrTMRjnmMF0DME5ZjIdQ3GOV5mOYTjHLKZjOM7xGtMxAueYzXQU4ByvMx1FOMccpmM0zvEG0zEG55jLdIzFOd5kOsbhHPOYjvE4x3ymYwLOsYDpmIRzLGQ6JuMci5iOKTjHW0zHNJxjMdMxHed4m+mYiXMsYTpm4RzvMB2zcY6lTMccnONdpmMuzrGM6ZiHc7zHdCzAOZYzHYtwjveZjsU4xwqmYwnO8QHTsRTnWMl0LMM5PmQ6luMcq5iOFTjHR0zHSpxjNdOxCuf4mOlYjXMI0yE4xydMxxqcYw3TsRbn+JTpWIdzrGU61uMcnzEdG3COdUzHRpzjc6ZjE86xnunYgnN8wXRsxTk2MB3bcI4vmY7tOMdGpmMHzvEV07ET59jEdOzGOTYzHXtwji1Mx16c42umYx/OsZXpOIBzfMN0HMQ5tjEdh3COb5mOwzjHdqbjCM7xHdNxFOfYwXQcwzm+ZzqO4xw7iQ5PGs6xi+lIxzl2Mx0enOMHpiMT59jDdPhwjh+ZjgDOsZfpyMY5fmI6QjjHPqYjgnPsZzpiOMcBpiOOc/zMdCRxjoNMRymc4xemozTOcYjpKINz/Mp0lMM5DjMdFXCO35iOijjHEaajEs7xO9NRGec4ynRUxTn+YDqq4RzHmA7gPg1/Mh01cI7jTEct2FAlSzAdtXGONKYDt/9HydOYDtz+HyXTmQ7c/h8lM5gO3P4fJT1MB27/j5JepgO3/0fJTKYDt/9HySymA7f/R0kf04Hb/6Okn+nA7f9RMsB04Pb/KBlkOnD7f5TMZjpw+3+UzGE6cPt/lAwxHbj9P0qGmQ7c/h8lI0wHbv+PklGmA7f/R8kY04Hb/6NkLtOB2/+jZJzpwO3/UTLBdOD2/yiZZDpw+3+ULMl04Pb/KFmK6cDt/1HydKYDt/9HydJMB27/j5JnMB24/T9KlmE6cPt/lCzLdOD2/yhZjunA7f9RsrzBMeNvR/NunXsVXby5xERJ5kvyMUkOkuTjkhwsySckOUSST0pyqCSfkuQwST4tyeGSfEaSIyQ5UpIFkiyUZJEkR0lytCSfleQYST4nybGSfF6S4yT5giTHS/JFSU6QpI4/SZIvSXKyJF+W5BRJTpXkNEm+IsnpkpwhyZmSfFWSsyT5miRnS/J1Sc6R5BuSnCvJNyU5T5LzJblAkgsluUiSb0lysSTfluQSSb4jyaWSfFeSyyT5niSXS/J9Sa6Q5AeSXCnJDyW5SpIfSXK1JD+WpEjyE0mukeSnklwryc8kuU6Sn0tyvSS/kOQGSX4pyY2S/EqSmyS5WZJbJPm1JLdK8htJbpPkt5LcLsnvJLlDkt9Lcqckd0lytyR/kOQeSf4oyb2S/EmS+yS5X5IHJPmzJA9K8hdJHpLkr5I8LMnfJHlEG+rai9Y2rnZAtXmofTdtWWm3Rxsl2mPQx/P6ZFsfCuvzVH0UqU/x9AGYPjvSxy76xEJv9vU+WW8x9e5Mb2z0nkAvp/VKVC/i9PpHLx30W1e/sPRcr6dJPcPoh1OPaz0kpv79fufPaJiX17Fnr1s79uxeVJj6t5LTLpPEZ/qymh1a9NxWa2LVhS2bzM/Pb9O2Su1dzfot6lHQeNuhov36On2VJB8tNLUZHy00jFeyQrE+jBebPoxp1k4oblMIk+PkN6Ug9ZviObHaiQ2G1T5NX2la7TMdrLZ5ic7EDVXxFFY71eqkNyoyzJ1ueE0j03txFvG9yMD9WUTJSkwHsH19NtMBbF9XZjqA7esqTAewfV2V6QC2r89hOoDt62pMB7B9fS7TAWxfV2c6gO3r85gOYPu6BtMBbF/XZDqA7etaTAewfX0+0wFsX9dmOoDt6zpMB7B9XZfpALavL2A6gO3rC5kOYPu6HtMBbF/XZzqA7euLmA5g+7oB0wFsX1/MdADb15cwHcD29aVMB7B9fRnTAWxfX850ANvXDZkOYPu6EdMBbF83ZjqA7esrmI48nKMJ09Eb57iS6eiDczRlOvrhHM2Yjv44R3OmYwDOcRXTAfxLhauZjnyc4xqmYxDOcS3TMRjnaMF0DME5rmM6huIcLZmOYTjH9UzHcJzjBqZjBM7RiukowDluZDqKcI6bmI7ROMfNTMcYnKM10zEW52jDdIzDOW5hOsbjHLcyHRNwjtuYjkk4x+1Mx2Scoy3TMQXnuIPpmIZz3Ml0TMc57mI6ZuIc7ZiOWTjH3UzHbJyjPdMxB+fowHTMxTk6Mh3zcI57mI4FOEcnpmMRznEv07EY5+jMdCzBOe5jOpbiHPczHctwji5Mx3KcoyvTsQLn6MZ0rMQ5ujMdq3COHkzHapzjAaZDcI6eTMcanCOP6ViLc/RiOtbhHL2ZjvU4x4NMxwacow/TsRHn6Mt0bMI5+jEdW3COh5iOrThHf6ZjG87xMNOxHecYwHTswDkeYTp24hwDmY7dOMejTMcenCOf6diLczzGdOzDOQYxHQdwjseZjoM4x2Cm4xDO8QTTcRjnGMJ0HME5nmQ6juIcQ5mOYzjHU0zHcZxjGNHhScM5nmY60nGO4UyHB+d4hunIxDlGMB0+nGMk0xHAOQqYjmyco5DpCOEcRUxHBOcYxXTEcI7RTEcc53iW6UjiHGOYjlI4x3NMR2mcYyzTUQbneJ7pKIdzjGM6KuAcLzAdFXGO8UxHJZzjRaajMs4xgemoinNMZDqq4RyTmA7gPg0vMR01cI7JTEctnONlpqM2zjGF6QDu//H/a+/MA3Qq3//vnGPfZTvnec6E7O3SXvZ9lz0lDQaTMaOZsaXSJEkSM0NIQraQkGxJki153tnJlpCQhEolye+WMpaZXMN1dX2/31//fD5P48z7fr/Ouc95zn1f877vyZocjPt/TNHkYNz/421NDsb9P6ZqcjDu/zFNk4Nx/4/pmhyM+3+8o8nBuP/HDE0Oxv0/3tXkYNz/Y6YmB+P+H7M0ORj3/5itycG4/8d7mhyM+3/M0eRg3P/jfU0Oxv0/5mpyMO7/MU+Tg3H/j/maHIz7fyzQ5GDc/2OhJgfj/h8faHIw7v+xSJODcf+PDzU5GPf/WKzJwbj/x0eaHIz7fyzR5GDc/+NjTQ7G/T+WanIw7v/xiSYH4/4fyzQ5GPf/WE7gmHaOo050ZHxyhZ0ZxsEtCbcU3NJwy8AtC/dGuDfBvRnuLXBvhXsb3NvhloN7B9zycO+Eexfcu+HeA/deuPfBvR/uA3AfhFsBbkW4leBWhlsFblW41eBWh1sDbk24teDWhlsHbl249eDWh9sAbkO4jeA2hvsQ3CZwm8JtBrc53BZwW8JtBfdhuK3hPgL3Ubht4D4Gty3cx+GGw20Htz3cDnAj4HaE2wluZ7iRcJ+A2wVuFNyucKPhxsDtBvdJuLFw4+DGw+0OtwfcnnB7we0N9ym4feA+DfcZuM/C7Qv3ObgJcJ+H2w/uC3D7w30R7gC4L8EdCPdluIPgvgJ3MNxX4Q6BOxRuItwkuMlwh8EdDvc1uCPgjoQ7Cu7rcEfDfQPuGFNQN7VoU8Y1FVBTPDR1N1OyMtUeUygxNQYzPW9mts2ksJlPNVORZhbPTICZuSMz7WJmLMxg34yTzRDTjM7MwMaMCczrtHkTNS9x5v3HvDqYb13zhWWe9eYxaZ4w5uY0/dp0icnnrnfCtCpxcRGx8a0jYmOSk5KXF729Q8PYPeXGlV3QuMa8hIRWbcqUP1i798JuidX2nEg+ZjoKCm2AWzyZ0O3OHlgiidRBiycRGnZXpOt2rEC6HS3qPXQD3+1I4bjwsiRe+WxnOnu2C20lnG3HHEk62ysFzjb5FK3kk1qlyJGR8Y8KPtXkYCz+rtbkYCz+fqbJwVj8XaPJwVj8DWlyMBZ/ocnBWPz9XJODsfi7VpODsfi7TpODsfi7XpODsfi7QZODsfi7UZODsfi7SZODsfi7WZODsfi7RZODsfi7VZODsfj7hSYHY/F3myYHY/F3uyYHY/F3hyYHY/F3pyYHY/F3lyYHY/H3S00OxuLvbk0OxuLvV5ocjMXfPZocjMXfvZocjMXffZocjMXfrzU5GIu/+zU5GIu/32hyMBZ/D2hyxPFxHNTk6M7HcUiToycfx7eaHL35OA5rcvTh4/hOk+MZPo4jmhx9+Ti+1+RI4OM4qsnRj4/jmCZHfz6O45ocA/g4ftDkGMjH8aMmxyA+jp80OQbzcZzQ5BjCx/GzJkciH8cvmhzJfBy/anIM5+M4qckxgo/jN02OUXwcpzQ5RvNx/K7JMYaP47Qmx1g+jj80OcbzcZzR5JjAJuVl0OSYxMdhaXJM4eOwNTmm8nE4mhzT+TgyanLM4OPIpMkxk48jsybHbD6OLJocc/g4smpyzOXjyKbJMZ+PI7smx0I+jhyaHIv4OHJqcizm48ilybGEjyO3JsdSPo48mhzL+DjyanKs4OPIp8mxio/jOk2O1Xwc+TU51vBxFNDkAB9HQU2OtXwchTQ51vNxFNbk2MjH4WpybObj8DQ5tvJxBDQ5tvFxBDU5dvBx+Jocu/g4wjQ5dvNxXK/JsYePo4gmxz4+jqKaHPv5OIppchzg47hBk+MQH0dxTY7DfBwlNDmO8HGU1OQ4ysdRSpPjOB9HaU2OH/k4ymhynODjKKvJ8Qsfx42aHCf5OG7S5DjFx3GzJsdpPo5bNDnO8HHcqsiRyeLjuE2Tw+HjuF2TIxMfRzlNjix8HHdocmTj4yivyZGDj+NOTY5cfBx3aXLk4eO4W5MjHx/HPZoc+fk47tXkKMjHcZ8mR2E+jvs1OTw+jgc0OYJ8HA9qcoTxcVTQ5CjCx1FRk6MYH0clTY7ifByVNTlK8nFU0eQozcdRVZOjLB9HNU2Om/g4qmty8O3T4NXQ5LiNj6OmJkc5Po5amhzl+Thqa3Lw7f/h1dHk4Nv/w6urycG3/4dXT5ODb/8Pr74mB9/+H14DTQ6+/T+8hpocfPt/eI00Ofj2//Aaa3Lw7f/hPaTJwbf/h9dEk4Nv/w+vqSYH3/4fXjNNDr79P7zmmhx8+394LTQ5+Pb/8FpqcvDt/+G10uTg2//De1iTg2//D6+1Jgff/h/eI5ocfPt/eI9qcvDt/+G10eTg2//De0yTg2//D6+tJgff/h/e45ocfPt/eOGaHHz7f3jtNDn49v/w2mty8O3/4XXQ5ODb/8OL0OTg2//D66jJwbf/h0d4ZCRMO8dRJzoyPrnizgzj4H4KdzXcz+CugRuCC7ifw10Ldx3c9XA3wN0IdxPczXC3wN0K9wu42+Buh7sD7k64u+B+CXc33K/g7oG7F+4+uF/D3Q/3G7gH4B6Eewjut3APw/0O7hG438M9CvcY3ONwf4D7I9yf4J6A+zPcX+D+Cvck3N/gnoL7O9zTcP+AewZeBnhn1/KD58DLCC8TvMzwssDLCi8bvOzwcsDLCS8XvNzw8sDLCy8fvOvg5YdXAF5BeIXgFYbnwvPgBeAF4fnwwuBdD68IvKLwisG7AV5xeCXglYRXCl5peGXglYV3I7yb4N0M7xZ4t8K7Dd7t8MrBuwNeeXh3wrsL3t3w7oF3L7z74N0P7wF4D8KrAK8ivErwKpuCuqlFmzKuqYCa4qGpu5mSlan2mEKJqTGY6Xkzs20mhc18qpmKNLN4ZgLMzB2ZaRczY2EG+2acbIaYZnRmBjZmTGBep82bqHmJM+8/5tXBfOuaLyzzrDePSfOEMTen6demS0w+d70TplWJi4uIjW8dERuTnHTltZKtCii0wRx2e4eGsXvKjSu7oHGNeQkJrdqUKX+wdu+F3RKr7TmRfMwcZ46CuyqJ0j3NYQQ9r3O6bsaKpJvRIt5B7kq+m5HCceFFSbzyRcl09mwX2ko42xnNkaSzHSlwtsmniPHV4AlFjoyMf1LQRZODsfQbpcnBWPrtqsnBWPqN1uRgLP3GaHIwln67aXIwln6f1ORgLP3GanIwln7jNDkYS7/xmhyMpd/umhyMpd8emhyMpd+emhyMpd9emhyMpd/emhyMpd+nNDkYS799NDkYS79Pa3Iwln6f0eRgLP0+q8nBWPrtq8nBWPp9TpODsfSboMnBWPp9XpODsfTbT5ODsfT7giYHY+m3vyYH4/zui5ocjKXfAZocjKXflzQ5GEu/AzU5GEu/L2tyxPFxDNLk6M7H8YomR08+jsGaHL35OF7V5OjDxzFEk+MZPo6hmhx9+TgSNTkS+DiSNDn68XEka3L05+MYpskxgI9juCbHQD6O1zQ5BvFxjNDkGMzHMVKTYwgfxyhNjkQ+jtc1OZL5OEZrcgzn43hDk2MEH8cYTY5RfBxvanKM5uMYq8kxho9jnCbHWD6O8Zoc4/k43tLkmMDHMUGTYxIfx0RNjil8HJM0OabycUzW5JjOxzFFk2MGH8fbmhwz+TimanLM5uOYpskxh49juibHXD6OdzQ55vNxzNDkWMjH8a4mxyI+jpmaHIv5OGZpcizh45itybGUj+M9TY5lfBxzNDlW8HG8r8mxio9jribHaj6OeZoca/g45mtygI9jgSbHWj6OhZoc6/k4PtDk2MjHsUiTYzMfx4eaHFv5OBZrcmzj4/hIk2MHH8cSTY5dfBwfa3Ls5uNYqsmxh4/jE02OfXwcyzQ59vNxLNfkOMDHsUKT4xAfx0pNjsN8HKs0OY7wcXyqyXGUj2O1JsdxPo7PNDl+5ONYo8lxgo8jpMnxCx8HNDlO8nF8rslxio9jrSbHaT6OdZocZ/g41ityZLL4ODZocjh8HBs1OTLxcWzS5MjCx7FZkyMbH8cWTY4cfBxbNTly8XF8ocmRh49jmyZHPj6O7Zoc+fk4dmhyFOTj2KnJUZiPY5cmh8fH8aUmR5CPY7cmRxgfx1eaHEX4OPZochTj49iryVGcj2OfJkdJPo6vNTlK83Hs1+Qoy8fxjSbHTXwcBzQ5GPdpOKjJcRsfxyFNjnJ8HN9qcpTn4zisycG4/8d3mhyM+38c0eRg3P/je00Oxv0/jmpyMO7/cUyTg3H/j+OaHIz7f/ygycG4/8ePmhyM+3/8pMnBuP/HCU0Oxv0/ftbkYNz/4xdNDsb9P37V5GDc/+OkJgfj/h+/aXIw7v9xSpODcf+P3zU5GPf/OK3Jwbj/xx+aHIz7f5zR5ODb/yOQQZODb/+PgKXJwbf/R8DW5ODb/yPgaHLw7f8RyKjJwbf/RyCTJgff/h+BzJocfPt/BLJocvDt/xHIqsnBt/9HIJsmB9/+H4HsBI5p5zjqREfGJ1famWEcvC7wouB1hRcNLwZeN3hPwouFFwcvHl53eD3g9YTXC15veE/B6wPvaXjPwHsWXl94z8FLgPc8vH7wXoDXH96L8AbAewneQHgvwxsE7xV4g+G9Cm8IvKHwEuElwUuGNwzecHivwRsBbyS8UfBehzca3hvwxsB7E95YeMbheHhvwZsAbyK8SfAmw5sC7214U+FNgzcd3jvwZsB7F95MeLPgzYb3Hrw58N6HNxfePHjz4S2AtxDeB/AWwfsQ3mJ4H8FbAu9jeEvhfQJvGbzl8FbAWwlvFbxP4a2G9xm8NfBC8ADvc3hr4a2Dtx7eBngb4W2CtxneFnhb4X0Bbxu87fB2wNsJbxe8L+HthvcVvD3w9sLbZwrqphZtyrimAmqKh6buZkpWptpjCiWmxmCm583MtpkUNvOpZirSzOKZCTAzd2SmXcyMhRnsm3GyGWKa0ZkZ2JgxgXmdNm+i5iXOvP+YVwfzrWu+sMyz3jwmzRPG3JymX5suMfnc9U6YViUuLiI2vnVEbExyUjKhNxXagEKbzYG3d2gYu6fcuLILGteYl5DQqk2Z8gdr917YLbHanhPJx8yRZw/0nkgivTg/kUTQC+RI1+1YiXQ7WtR3e8avKwrHhZclkXpZtpLOdqENpLOdk+ByVtWo8PZdqsb0qtk9un218KiohElNqjSsVSMpYUrLyPjoiLg4o1M03ReFnNXgq9kHcgl0LjIHX201kFuTg6+2GsijycFXWw3k1eTgq60G8mly8NVWA9dpcvDVVgP5NTn4aquBApocfLXVQEFNDr7aaqCQJgdfbTVQWJODr7YacDU5+GqrAU+Tg6+2GghocvDVVgNBTQ6+2mrA1+Tgq60GwjQ5+Gqrges1Ofhqq4Eimhx8tdVAUU0OvtpqoJgmB2Nt9QZNDsbaanFNDsbaaglNDsbaaklNDsbaailNDsbaamlNDsbJ6jKaHIy11bKaHIy11Rs1ORhrqzdpcjDWVm/W5Ijj47hFk6M7H8etmhw9+Thu0+TozcdxuyZHHz6Ocpocz/Bx3KHJ0ZePo7wmRwIfx52aHP34OO7S5OjPx3G3JscAPo57NDkG8nHcq8kxiI/jPk2OwXwc92tyDOHjeECTI5GP40FNjmQ+jgqaHMP5OCpqcozg46ikyTGKj6OyJsdoPo4qmhxj+DiqanKM5eOopskxno+juibHBD6OGpock/g4ampyTOHjqKXJMZWPo7Ymx3Q+jjqaHDP4OOpqcszk46inyTGbj6O+JsccPo4Gmhxz+TgaanLM5+NopMmxkI+jsSbHIj6OhzQ5FvNxNNHkWMLH0VSTYykfRzNNjmV8HM01OVbwcbTQ5FjFx9FSk2M1H0crTY41fBwPa3KAj6O1JsdaPo5HNDnW83E8qsmxkY+jjSbHZj6OxzQ5tvJxtNXk2MbH8bgmxw4+jnBNjl18HO00OXbzcbTX5NjDx9FBk2MfH0eEJsd+Po6OmhwH+Dg6aXIc4uPorMlxmI8jUpPjCB/HE5ocR/k4umhyHOfjiNLk+JGPo6smxwk+jmhNjl/4OGI0OU7ycXTT5DjFx/GkJsdpPo5YTY4zfBxxihyZLD6OeE0Oh4+juyZHJj6OHpocWfg4empyZOPj6KXJkYOPo7cmRy4+jqc0OfLwcfTR5MjHx/G0Jkd+Po5nNDkK8nE8q8lRmI+jryaHx8fxnCZHkI8jQZMjjI/jeU2OInwc/TQ5ivFxvKDJUZyPo78mR0k+jhc1OUrzcQzQ5CjLx/GSJsdNfBwDNTkY92l4WZPjNj6OQZoc5fg4XtHkKM/HMViTg3H/j1c1ORj3/xiiycG4/8dQTQ7G/T8SNTkY9/9I0uRg3P8jWZODcf+PYZocjPt/DNfkYNz/4zVNDsb9P0ZocjDu/zFSk4Nx/49RmhyM+3+8rsnBuP/HaE0Oxv0/3tDkYNz/Y4wmB+P+H29qcjDu/zFWk4Nx/49xmhyM+3+M1+Rg3P/jLU0Oxv0/JmhyMO7/MVGTg3H/j0maHIz7f0zW5GDc/2OKJgfj/h9va3Iw7v8xVZODcf+PaZocjPt/TNfkYNz/4x0Cx4WbuSeRN3MnHbjJHHjW6JX3c5+RTqOUXecro9C6ZELrlSkOC60jcbx7ZVvp5qhiZCkT9dOrxkZGRUV2OrvV/bDMwxMmN42M7hQVQesrlBV10yVYkVuwQjoEyf14I7Ufbx7KzQOXsLtb0lnNrt2iIhCYmfJxFvX+f5dgelbVqPD2XarG9KrZPbr92b6TMKlJlYa1aiQlTGkZGR8dERdn2i56ce/KlpT+U72Feqq3XOFUnzlz5teUU/3PB1tn/+eCkzg75eN7lIe2RTo9s2mHvVc03ff+uTNHeoYW3SvwDD13QWjt70tn+0OH/bNs0rE/+/Bs0oP3Pcr9UHQv6ah9hP536YkkfDUYlKHpPEVJFOUC4SjQkXItzYGFXkminIICHUknfY4UTicqzmAaTicSzvtSOJ2pOK/ScDqTcOZK4URScYbQcCJJOPOkcJ6g4gyl4TxBwpkvhdOFipNIw+lCwlkghRNFxUmi4USRcBZK4XSl4iTTcLqScD6Qwomm4gyj4USTcBZJ4cRQcYbTcGJIOB9K4XSj4rxGw+lGwlkshfMkFWcEDedJEs5HUjixVJyRNJxYEs4SKZw4Ks4oGk4cCedjKZx4Ks7rNJx4Es5SKZzuVJzRNJzuJJxPpHB6UHHeoOH0IOEsk8LpScUZQ8PpScJZLoXTi4rzJg2nFwlnhRRObyrOWBpObxLOSimcp6g442g4T5FwVknh9KHijKfh9CHhfCqF8zQV5y0aztMknNVSOM9QcSbQcJ4h4XwmhfMsFWciDedZEs4aKZy+VJxJNJy+JJyQFM5zVJzJNJznSDiQwkmg4kyh4SSQcD6XwnmeivM2Ded5Es5aKZx+VJypNJx+JJx1UjgvUHGm0XBeIOGsl8LpT8WZTsPpT8LZIIXzIhXnHRrOiyScjVI4A6g4M2g4A0g4m6RwXqLivEvDeYmEs1kKZyAVZyYNZyAJZ4sUzstUnFk0nJdJOFulcAZRcWbTcAaRcL6QwnmFivMeDecVEs42KZzBVJw5NJzBJJztUjivUnHep+G8SsLZIYUzhIozl4YzhISzUwpnKBVnHg1nKAlnlxROIhVnPg2H9qenX0rhJFFxFtBwkkg4u6Vwkqk4C2k4ySScr6RwhlFxPqDhDCPh7JHCGU7FWUTDGU7C2SuF8xoV50MazmsknH1SOCOoOItpOCNIOF9L4Yyk4nxEwxlJwtkvhTOKirOEhjOKhPONFM7rVJyPaTivk3AOSOGMpuIspeGMJuEclMJ5g4rzCQ3nDRLOISmcMVScZTScMSScb6Vw3qTiLKfhvEnCOSyFM5aKs4KGM5aE850UzjgqzkoazjgSzhEpnPFUnFU0nPEknO+lcN6i4nxKw3mLhHNUCmcCFWc1DWcCCeeYFM5EKs5nNJyJJJzjUjiTqDhraDiTSDg/UHDO5YLrREfGJ1femaEyAnMQeB+BuQjMQ2A+AgsQWIjABwgsQuBDBBYj8BECSxD4GIGlCHyCwDIEliOwAoGVCKxC4FMEViPwGQJrTOnclJtNidaUNU0p0JTPTMnJlGlMacOUA8wUupl2NlO1ZnrTTAmaaTQz9WSma8wUh5kWMENpM/w0QzYzzDFDA/M6bV5BzWubedUxrwfmK9V8DZlHt3ncmUeEua1MVzSXzyBPPsdzcXSLNnj/8cqnPisplJU1/eky0mTS2VDWj7Rpop8I7adEwiuzRsIpjVOlTqSzC1f5P9qFKbNzZzsI5YF0thudSKKdflJn+zldna0KqbNZCp3t53TetMTnyi//6nPFurrnyi+058qvApeafH1+5ZM6qciRkXEJ9980ORiX2j6lycG41PbvmhyMS22f1uRgXGr7D00OxqW2z2hy8C21HcygycG31HbQ0uTgW2o7aGty8C21HXQ0OfiW2g5m1OTgW2o7mEmTg2+p7WBmTQ6+pbaDWTQ5+JbaDmbV5OBbajuYTZOjKR9Hdk0OvqW2gzk0OfiW2g7m1OTgW2o7mEuTg2+p7WBuTQ6+pbaDeTQ5+JbaDubV5OBbajuYT5ODb6nt4HWaHHxLbQfza3LwLbUdLKDJwbfUdrCgJgffUtvBQpocfEttBwtrcvAttR10NTn4ltoOepoccXwcAU2O7nwcQU2OnnwcviZHbz6OME2OPnwc12tyPMPHUUSToy8fR1FNjgQ+jmKaHP34OG7Q5OjPx1Fck2MAH0cJTY6BfBwlNTkG8XGU0uQYzMdRWpNjCB9HGU2ORD6OspocyXwcN2pyDOfjuEmTYwQfx82aHKP4OG7R5BjNx3GrJscYPo7bNDnG8nHcrskxno+jnCbHBD6OOzQ5JvFxlNfkmMLHcacmx1Q+jrs0OabzcdytyTGDj+MeTY6ZfBz3anLM5uO4j8BxYa6s6p+5st8QOIXA7wicRuAPBM4gmAHBs39Fi6CDYEYEMyGYGcEsCGZFMBuC2RHMgWBOBHMhmBvBPAjmNaV7U/U2BWNTazVlSlPhM8UxU1cyJRlTzTCFADOHbqafzcytmfQ084Vmqs3MUpkJHjM3YqYVzIjcDGbNONAMoczow7y4m3de87po3rTMS4r5fjdfjeZbxTyQzbPMPAbMHWQ6n7luBvlqc2WV0pErO0nLlZ1MIugF709XZ6vKmyvjCxuRONKfKws+cOXGGXNl9lXlyoIPJJJYHhS41OTr8yCfVAVFDsZcWbCiJgdfrixYSZODL1cWrKzJcR8fRxVNDr5cWbCqJgdfrixYTZODMVdWXZODMVdWQ5ODMVdWU5ODMVdWS5ODMVdWW5ODMVdWR5ODMVdWV5ODMVdWT5ODMVdWX5ODMVfWQJODMVfWUJODMVfWSJODMVfWWJPjYT6OhzQ5GHNlTTQ5GHNlTTU5GHNlzTQ5GHNlzTU5GHNlLTQ5GHNlLTU5GHNlrTQ5GHNlD2tyMObKWmtyMObKHtHkYMyVParJwZgra6PJwZgre0yTgzFX1laTgzFX9rgmB2OuLFyTgzFX1k6TgzFX1l6TgzFX1kGTgzFXFqHJwZgr66jJwZgr66TJwZgr66zJwZgri9TkYMyVPaHJwZgr66LJwZgri9LkYMyVddXkYMyVRWtyMObKYjQ5GHNl3TQ5GHNlT2pyMObKYjU5GHNlcZocjLmyeE0OxlxZd00OxlxZD00OxlxZT00OxlxZL00OxlxZb00OxlzZU5ocjLmyPpocjLmypzU5GHNlhKnJi3Jl1c7myoIVEayEoPlQBcGqCFZDsDqCNRCsiWAtBGsjWAfBugjWQ7A+gg0QbIhgIwQbI/gQgk0QbIpgM1O6N1VvUzA2tVZTpjQVPlMcM3UlU5Ix1QxTCDBz6Gb62czcmklPM19optrMLJWZ4DFzI2ZawYzIzWDWjAPNEMqMPsyLu3nnNa+L5k3LvKSY73fz1Wi+VcwD2TzLzGPA3EGm85nrZpCvNldWkZ4rC1Yg5crMYZSw0bPp6mzVWHNlnGEjCsdV5Mr6XrlxxlyZc3W5sr6JJJbnBC41+fo8xyeVoMjBmSt7XpODMVfWT5ODMVf2giYHY66svyYHY67sRU0OxlzZAE0OxlzZS5ocjLmygZocjLmylzU5GHNlgzQ5GHNlr2hyMObKBmtyMObKXtXkYMyVDdHkYMyVDdXkYMyVJWpyMObKkjQ5GHNlyZocjLmyYZocjLmy4ZocjLmy1zQ5GHNlIzQ5GHNlIzU5GHNlozQ5GHNlr2tyMObKRmtyMObK3tDkYMyVjdHkYMyVvanJwZgrG6vJwZgrG6fJwZgrG6/JwZgre0uTgzFXNkGTgzFXNlGTgzFXNkmTgzFXNlmTgzFXNkWTgzFX9rYmB2OubKomB2OubJomB2OubLomB2Ou7B1NDsZc2QxNDsZc2buaHIy5spmaHIy5slmaHIy5stmaHIy5svc0ORhzZXM0ORhzZe9rcjDmyuZqcjDmyuZpcjDmyuZrcjDmyhZocjDmyhZqcjDmyj7Q5GDMlS3S5GDMlX2oycGYK1usycGYK/tIk4MxV7ZEk4MxV/axJgdjrmwpgePCXFn1P3NlzyPYD8EXEOyP4IsIDkDwJQQHIvgygoMQfAXBwQi+iuAQBIcimIhgEoLJCA5DcDiCryE4AsGRpnRvqt6mYGxqraZMaSp8pjhm6kqmJGOqGaYQYObQzfSzmbk1k55mvtBMtZlZKjPBY+ZGzLSCGZGbwawZB5ohlBl9mBd3885rXhfNm5Z5STHf7+ar0XyrmAeyeZaZx4C5g0znM9fNIF9trgxuiXQkyxJoybKEJErc6JN0dbfqvMkyxrgRheMqkmXLrtw4Y7Is49Uly5YlkliWC1xq8vVZzie1QpGDM1m2UpODMVm2SpODMVn2qSYHY7JstSYHY7LsM00OxmTZGk0OxmRZSJODMVkGTQ7GZNnnmhyMybK1mhyMybJ1mhyMybL1mhyMybINmhyMybKNmhyMybJNmhyMybLNmhyMybItmhyMybKtmhyMybIvNDkYk2XbNDkYk2XbNTkYk2U7NDkYk2U7NTkYk2W7NDkYk2VfanIwJst2a3IwJsu+0uRgTJbt0eRgTJbt1eRgTJbt0+RgTJZ9rcnBmCzbr8nBmCz7RpODMVl2QJODMVl2UJODMVl2SJODMVn2rSYHY7LssCYHY7LsO00OxmTZEU0OxmTZ95ocjMmyo5ocjMmyY5ocjMmy45ocjMmyHzQ5GJNlP2pyMCbLftLkYEyWndDkYEyW/azJwZgs+0WTgzFZ9qsmB2Oy7KQmB2Oy7DdNDsZk2SlNDsZk2e+aHIzJstOaHIzJsj80ORiTZWc0OfiSZX4GTQ6+ZJlvaXLwJct8W5ODL1nmO5ocfMkyP6MmB1+yzM9E4LgwWVbjz2TZSgRXIfgpgqsR/AzBNQiGEASCnyO4FsF1CK5HcAOCGxHchOBmBLcguBXBLxDchuB2BHcguNOU7k3V2xSMTa3VlClNhc8Ux0xdyZRkTDXDFALMHLqZfjYzt2bS08wXmqk2M0tlJnjM3IiZVjAjcjOYNeNAM4Qyow/z4m7eec3ronnTMi8p5vvdfDWabxXzQDbPMvMYMHeQ6Xzmuhnkq02WVUhHrmwFLVe2Iomg52dOV2erwZsr4wsbkTjSnyvzs1y5ccZcWaarypX5WRJJLFkFLjX5+mTlk8qmyMGYK/Oza3Lw5cr8HJocfLkyP6cmB1+uzM+lycGXK/Nza3Lw5cr8PJocfLkyP68mB1+uzM+nycGXK/Ov0+Tgy5X5+TU5+HJlfgFNDr5cmV9Qk4MvV+YX0uTgy5X5hTU5+HJlvqvJwZcr8z1NDr5cmR/Q5ODLlflBTQ6+XJnva3Lw5cr8ME0OvlyZf70mB1+uzC+iycGXK/OLanLw5cr8YpocfLky/wZNDr5cmV9ck4MvV+aX0OTgy5X5JTU5+HJlfilNDr5cmV9ak4MvV+aX0eTgy5X5ZTU5+HJl/o2aHHy5Mv8mTQ6+XJl/syYHX67Mv0WTgy9X5t+qycGXK/Nv0+Tgy5X5t2ty8OXK/HKaHHy5Mv8OTQ6+XJlfXpODL1fm36nJwZcr8+/S5ODLlfl3a3Lw5cr8ezQ5+HJl/r2aHHy5Mv8+TQ6+XJl/vyYHX67Mf0CTgy9X5j+oycGXK/MraHLw5cr8ipocfLkyv5ImB1+uzK+sycGXK/OraHLw5cr8qpocfLkyv5omB2OurLomB2OurIYmB2OurKYmB2OurJYmB2OurLYmB2OujPCnjhflymqezZX52eHngJ8Tfi74ueHngZ8Xfj7418HPD78A/ILwC8EvDN+F78EPwA/C9+GHwb8efhH4RU3p3lS9TcHY1FpNmdJU+ExxzNSVTEnGVDNMIcDMoZvpZzNzayY9zXyhmWozs1RmgsfMjZhpBTMiN4NZMw40Qygz+jAv7uad17wumjct85Jivt/NV6P5VjEPZPMsM48BcweZzmeum0G+6h3LAu8iMIuYLPOzkZJl5jBK3KhuurpbTdZkGWfciMJxFcmyeldunDFZlvnqkmX1Ekks9QUuNfn61OeTapDOS026AwttQKGNpAM3odBm2glvqHjCOSNwjTQ5GCNwjTU5GCNwD2lyMEbgmmhyMEbgmmpyMEbgmmlyMEbgmmtyMEbgWmhyMEbgWmpyMEbgWmlyMEbgHtbkYIzAtdbkYIzAPaLJwRiBe1STgzEC10aTgzEC95gmB2MErq0mB2ME7nFNDsYIXLgmB2MErp0mB2MErr0mB2MEroMmB2MELkKTgzEC11GTgzEC10mTgzEC11mTgzECF6nJwRiBe0KTgzEC10WTgzECF6XJwRiB66rJwRiBi9bkYIzAxWhyMEbgumlyMEbgntTkYIzAxWpyMEbg4jQ5GCNw8ZocjBG47pocjBG4HpocjBG4npocjBG4XpocjBG43pocjBG4pzQ5GCNwfTQ5GCNwT2tyMEbgntHkYIzAPavJwRiB66vJwRiBe06TgzECl6DJwRiBe16TgzEC10+TgzEC94ImB2MErr8mB2ME7kVNDsYI3ABNDsYI3EuaHIwRuIGaHIwRuJc1ORgjcIM0ORgjcK9ocjBG4AZrcjBG4F4lcFwYgav1ZwSuEfzG8B+C3wR+U/jN4DeH3wJ+S/it4D8MvzX8R+A/Cr8N/Mfgt4X/OPxw+O3gt4ffAX6EKd2bqrcpGJtaqylTmgqfKY6ZupIpyZhqhikEmDl0M/1sZm7NpKeZLzRTbWaWykzwmLkRM61gRuRmMGvGgWYIZUYf5sXdvPOa10XzpmVeUsz3u/lqNN8q5oFsnmXmMWDuINP5zHUzyKlF4MhBpoZnz+sVczXFKPPNl7ZPStY1SCZd1wYUl/4Qilax9M2d1+LN3zGGsoak85oQ83dDr9w4Y/4uy9V126GkbusnClxq8vVhnFZJUuTgjLUla3IwxtqGaXIwxtqGa3Iwxtpe0+RgjLWN0ORgjLWN1ORgjLWN0uRgjLW9rsnBGGsbrcnBGGt7Q5ODMdY2RpODMdb2piYHY6xtrCYHY6xtnCYHY6xtvCYHY6ztLU0OxljbBE0OxljbRE0OxljbJE0OxljbZE0OxljbFE0Oxljb25ocjLG2qZocjLG2aZocjLG26ZocjLG2dzQ5GGNtMzQ5GGNt72pyMMbaZmpyMMbaZmlyMMbaZmtyMMba3tPkYIy1zdHkYIy1va/JwRhrm6vJwRhrm6fJwRhrm6/JwRhrW6DJwRhrW6jJwRhr+0CTgzHWtkiTgzHW9qEmB2OsbbEmB2Os7SNNDsZY2xJNDsZY28eaHIyxtqWaHIx/f/WJJgdjrG2ZJgdjrG25JgdjrG2FJgdjrG2lJgdjrG2VJgdjrO1TTQ7GWNtqTQ7GWNtnmhyMsbY1mhyMsbaQJgdjrA2aHIyxts81ORhjbWs1ORhjbes0ORhjbes1ORhjbRsIHBfG2mr/GWtLhj8M/nD4r8EfAX8k/FHwX4c/Gv4b8MfAfxP+WPjj4I+H/xb8CfAnwp8EfzL8KfDfhj/VlO5N1dsUjE2t1ZQpTYXPFMdMXcmUZEw1wxQCzBy6mX42M7dm0tPMF5qpNjNLZSZ4zNyImVYwI3IzmDXjQDOEMqMP8+Ju3nnN66J50zIvKeb73Xw1mm8V80A2zzLzGDB3kOl85roZ5Gva2W0mNX+WRNvZ7exRV44bbUxXd6vNmyxjHO5SOK4iWbaJ0jglWWZRkmXW1SXLNiWSWDYTTtGsqlHh7btUjelVs3t0+2rhUVEJk5pUaVirRlLClJaR8dERcXFGp+hV2QzMJPXbwLskmC1MMFuKXsUucC+j0AbqgcSLszWd/ZdmdBDV6CCy0S8EHhjk7yfGXN82TQ7GXN92TQ7GXN8OTQ7GXN9OTQ7GXN8uTQ7GXN+XmhyMub7dmhyMub6vNDkYc317NDkYc317NTkYc337NDkYc31fa3Iw5vr2a3Iw5vq+0eRgzPUd0ORgzPUd1ORgzPUd0uRgzPV9q8nBmOs7rMnBmOv7TpODMdd3RJODMdf3vSYHY67vqCYHY67vmCYHY67vuCYHY67vB00Oxlzfj5ocjLm+nzQ5GHN9JzQ5GHN9P2tyMOb6ftHkYMz1/arJwZjrO6nJwZjr+02TgzHXd0qTgzHX97smB2Ou77QmB2Ou7w9NDsZc3xlNDr5cX1gGTQ6+XF+YpcnBl+sLszU5+HJ9YY4mB1+uLyyjJgdfri8skyYHX64vLLMmB1+uLyyLJgffHzqGZdXk4Mv1hWXT5ODL9YVl1+Tgy/WF5dDk4Mv1heXU5ODL9YXl0uTgy/WF5dbk4Mv1heXR5ODL9YXl1eTgy/WF5dPk4Mv1hV2nycGX6wvLr8nBl+sLK6DJwZfrCyuoycGX6wsrpMnBl+sLK6zJwZfrC3MJHBcFrUg5NFrqJ8y7ssOrSHmFBSjkbCmvqwnybEAgJ+nATQjMSCRBB9N7IWmy/j/LVijx7O6rkQ1LU9Y+7/byvNf7jWPiIiI7xETf0Tgitmv3+PD4yJjopGEp+a8w//znaik/zXjLBUeEDUPY9QgrgrCiCCuWML1qbGRUVGSns/rDsiQmTG4aGd0pKoJ6+1x/5bM+lKZVI53Xjxwn3EK6IsWeTm//GUaa529I6g43kCzGUVokgKQ/l1nDWKR17OKE00gIMoYVL5r+x24NksMS6X3ocl7okv/qhc5wVdFtfzPlwDDPfNHQ+kQpIaNhQarRIM1oaYmXgQyEi1lTomGL0HAtiYZtQsO1JRp2CA3XuZqGryRal9K9nJPpbZryvVlP4kRmJDRcX6LhTISGG0g0nJnQcEOJhrMQGm4k0XBWQsONJRrORmj4IYmGsxMabiLRcA5Cw00lGs5JaLiZRMO5CA03l2g4N6HhFhIN5yE03FKi4byEhltJNJyP0PDDEg1fR2i4tUTD+QkNPyLRcAFCw49KNFyQ0HAbiYYLERp+TKLhwoSG20o07BIaflyiYY/QcLhEw5R5ynYSDQcJDbeXaNgnNNxBouEwQsMREg1fT2i4o0TDRQgNd5JouCih4c4SDRcjNBwp0fANhIafkGi4OKHhLulsOImwbmEN+Fspyxv6W810I2UQHyVj8guSyS+IJrtezSW8kmg0aebkD4neU4JgL0bkwoQVp1yYsBJmvphyYbpJzCs9KSEaKyEaJyEaLyHaXUK0h4RoTwnRXhKivSVEn5IQ7SMh+rSE6DMSos9KiPaVEA09J6KaIKL6vIhqPxHVF0RU+4uoviiiOkBE9SUR1YEiqi+LqA4SUX1FRHWwiOqrIqpDRFSHiqgmiqgmiagmi6gOE1EdLqL6mojqCBHVkSKqo0RUXxdRHS2i+oaI6hgR1TdFVMeKqI4TUR0vovqWiOoEEdWJIqqTRFQni6hOEVF9W0R1qojqNBHV6SKq74iozhBRfVdEdaaI6iwR1dkiqu+JqM4RUX1fRHWuiOo8EdX5IqoLRFQXiqh+IKK6SET1QxHVxSKqH4moLhFR/VhEdamI6iciqstEVJeLqK4QUV0porpKRPVTEdXVIqqfiaiuEVENiahCRPVzEdW1IqrrRFTXi6huEFHdKKK6SUR1s4jqFhHVrSKqX4iobhNR3S6iukNEdaeI6i4R1S9FVHeLqH4lorpHRHWviOo+EdWvRVT3i6h+I6J6QET1oIjqIRHVb0VUD4uofieiekRE9XsR1aMiqsdEVI+LqP4govqjiOpPIqonRFR/FlH9RUT1VxFVkeUEQr+JqJ4SUf1dRPW0iOofIqpnJFRhZZCRtWRkbRlZR0Y2o4xsJhnZzDKyWWRks8rIZpORzS4jm0NGNqeMbC4Z2dwysnlkZPPKyOaTkb1ORja/jGwBGdmCMrKFZGQLy8i6MrKejGxARjYoI+vLyIbJyF4vI1tERraojGwxGdkbZGSLy8iWkJEtmU5Z6iKSgTmULPbZZTG3JZGMlkqi6M2RwnmfirOdhlOahPO+FM5cKs4OGk4ZEs5cKZx5VJydNJyyJJx5UjjzqTi7aDg3knDmS+EsoOJ8ScO5iYSzQApnIRVnNw3nZhLOQimcD6g4X9FwbiHhfCCFs4iKs4eGcysJZ5EUzodUnL00nNtIOB9K4Sym4uyj4dxOwlkshfMRFedrGk45Es5HUjhLqDj7aTh3kHCWSOF8TMX5hoZTnoTzsRTOUirOARrOnSScpVI4n1BxDtJw7iLhfCKFs4yKc4iGczcJZ5kUznIqzrc0nHuSKHrLpXBWUHEO03DuJeGskMJZScX5joZzHwlnpRTOKirOERrO/SScVVI4n1JxvqfhPEDC+VQKZzUV5ygN50ESzmopnM+oOMdoOBVIOJ9J4ayh4hyn4VQk4ayRwglRcX6g4VQi4YSkcEDF+ZGGU5mEAymcz6k4P9FwqpBwPpfCWUvFOUHDqUrCWSuFs46K8zMNpxoJZ50Uznoqzi80nOoknPVSOBuoOL/ScEjbsgU2SOFspOKcpOHUJOFslMLZRMX5jYZTi4SzSQpnMxXnFA2nNglnsxTOFirO7zScOiScLVI4W6k4p2k4pH3SAlulcL6g4vxBw6lHwvlCCmcbFecMDac+CWebFM52Ik5YBhpOAxLOdimcHVQci4ZD2mA0sEMKZycVx6bhNCLh7JTC2UXFcWg4jUk4u6RwvqTiZKThPETC+VIKZzcVJxMNpwkJZ7cUzldUnMw0nKYknK+kcPZQcbLQcJqRcPZI4eyl4mSl4TQn4eyVwtlHxclGw2lBwtknhfM1FSc7DaclCedrKZz9VJwcNJxWJJz9UjjfUHFy0nAeJuF8I4VzgIqTi4bTmoRzQArnIBUnNw3nERLOQSmcQ1ScPDScR0k4h6RwvqXi5KXhtCHhfCuFc5iKk4+G8xgJ57AUzndUnOtoOG1JON9J4Ryh4uSn4TxOwjkihfM9FacADSechPO9FM5RKk5BGk47Es5RKZxjVJxCNJz2JJxjUjjHqTiFaTgdSDjHpXB+oOK4NJwIEs4PV4FzJdUaCCtFgTm7k2IpWsyoo4BNFNqAQC7SgZtQaAfNaCcpo7mpRnfSjHaWMpqHanQXzWiklNG8VKNf0ow+IWU0H9XobprRLlJGr6Ma/YpmNErKaH6q0T00o12ljBagGt1LMxotZbQg1eg+mtEYKaOFqEa/phntJmW0MNXofprRJ6WMulSj39CMxkoZ9ahGD9CMxkkZDVCNHqQZjZcyGqQaPUQz2l3KqE81+i3NaA8po2FUo4dpRntKGb2eavQ7mtFeUkaLUI0eoRntLWW0KNXo9zSjT0kZLUY1epRmtI+U0RuoRo/RjD4tZbQ41ehxmtFnpIyWoBr9gWb0WSmjJalGf6QZ7StltBTV6E80o89JGS1NNXqCZjRBymgZqtGfaUaflzJalmr0F5rRflJGb6Qa/ZVm9AUpozdRjZ6kGe0vZfRmqtHfaEZflDJ6C9XoKZrRAVJGb6Ua/Z1m9CUpo7dRjZ6mGR0oZfR2qtE/aEZfljJajmr0DM3oICmjdxCNFs5AM/qKlNHyVKMWzehgKaN3Uo3aNKOvShm9i2rUoRkdImX0bqrRjDSjQ6WM3kM1molmNFHK6L1Uo5lpRpOkjN5HNZqFZjRZyuj9VKNZaUaHSRl9gGo0G83ocCmjD1KNZqcZfU3KaAWq0Rw0oyOkjFakGs1JMzpSymglqtFcNKOjpIxWphrNTTP6upTRKlSjeWhGR0sZrUo1mpdm9A0po9WoRvPRjI6RMlqdavQ6mtE3pYzWoBrNTzM6VspoTarRAjSj46SM1qIaLUgzOl7KaG2q0UI0o29JGa1DNVqYZnSClNG6VKMuzehEKaP1qEY9mtFJUkbrU40GaEYnSxltQDUapBmdImW0IdWoTzP6tpTRRlSjYTSjU6WMNqYavZ5mdJqU0YeoRovQjE6XMtqEarQozeg7UkabUo0WoxmdIWW0GdXoDTSj70oZbU41WpxmdKaU0RZUoyVoRmdJGW1JNVqSZnS2lNFWVKPErMh7UkYfphotTTM6R8poa6rRMjSj70sZfYRqtCzN6Fwpo49Sjd5IMzpPymgbqtGbaEbnSxl9jGr0ZprRBVJG21KN3kIzulDK6ONUo7fSjH4gZTScavQ2mtFFUkbbUY3eTjP6oZTR9lSj5WhGF0sZ7UA1egfN6EdSRiOoRsvTjC6RMtqRavROmtGPpYx2ohq9i2Z0qZTRzlSjd9OMfiJlNJJq9B6a0WVSRp+gGr2XZnS5lNEuVKP30YyukDIaRTV6P83oSimjXalGH6AZXSVlNJpq9EGa0U+ljMZQjVagGV0tZbQb1WhFmtHPpIw+STVaiWZ0jZTRWKrRyjSjISmjcVSjVWhGIWU0nmq0Ks3o51JGu1ONVqMZXStltAfVaHWa0XVSRntSjdagGV0vZbQX1WhNmtENUkZ7U43WohndKGX0KarR2jSjm6SM9qEarUMzulnK6NNUo3VpRrdIGX2GarQezehWKaPPUo3Wpxn9QspoX6rRBjSj26SMPkc12pBmdLuU0QSq0UY0ozukjD5PNdqYZnSnlNF+VKMP0YzukjL6AtVoE5rRL6WM9qcabUozulvK6ItUo81oRr+SMjqAarQ5zegeKaMvUY22oBndK2V0INVoS5rRfVJGX6YabUUz+rWU0UFUow/TjO6XMvoK1WhrmtFvpIwOphp9hGb0gJTRV6lGH6UZPShldAjVaBua0UNSRodSjT5GM/qtlNFEqtG2NKOHpYwmUY0+TjP6nZTRZKrRcJrRI1JGh1GNtqMZ/V7K6HCq0fY0o0eljL5GNdqBZvSYlNERVKMRNKPHpYyOpBrtSDP6g5TRUVSjnWhGf5Qy+jrVaGea0Z+kjI6mGo2kGT0hZfQNqtEnaEZ/ljI6hmq0C83oL1JG36QajaIZ/VXK6Fiq0a40oyeljI6jGo2mGf1Nyuh4qtEYmtFTUkbfohrtRjP6u5TRCVSjT9KMnpYyOpFqNJZm9A8po5OoRuNoRs9IGZ1MNRpPMmpnkDI6hWq0O82oJWX0barRHjSjtpTRqVSjPWlGHSmj06hGe9GMZpQyOp1qtDfNaCYpo+9QjT5FM5pZwGgNhJHWHD67jRQtcWdnSafNoTTZrDKy2WRks8vI5pCRzSkjm0tGNreMbB4Z2bwysvlkZK+Tkc0vI1tARragjGwhGdnCMrKujKwnIxuQkQ3KyPoysmEystfLyBaRkS0qI1tMRvYGGdniMrIlZGRLysiWkpEtLSNbRka2rIzsjTKyN8nI3pxO2UTayIm25pR9iwzUrTJQtJVq7NtkoG6XkS0nI3uHjGx5Gdk7ZWTvkpG9W0b2HhnZe2Vk75ORvV9G9gEZ2QdlZCvIyFaUka0kI1tZRraKjGxVGdlqMrLVZWRryMjWlJGtJSNbW0a2joxsXRnZejKy9WVkG8jINpSRbSQj21hG9iEZ2SYysk1lZJvJyDaXkW0hI9tSRraVjOzDMrKtZWQfkZF9NL2ySUmEkTyp6TYyRI/JyLaVkX1cRjZcRradjGx7GdkOMrIRMrIdZWQ7ych2lpGNlJF9Qka2i4xslIxsVxnZaBnZGBnZbjKyT8rIxsrIxsnIxsvIdpeR7SEj21NGtpeMbG8Z2adkZPvIyD4tI/uMjOyzMrJ9ZWSfk5FNkJF9Xka2n4zsCzKy/WVkX5SRHSAj+5KM7EAZ2ZdlZAfJyL4iIztYRvZVGdkhMrJDZWQTZWSTZGSTZWSHycgOl5F9TUZ2hIzsSBnZUTKyr8vIjpaRfUNGdoyM7JsysmNlZMfJyI6XkX1LRnaCjOxEGdlJMrKTZWSnyMi+LSM7VUZ2mozsdBnZd2RkZ8jIvisjO1NGdpaM7GwZ2fdkZOfIyL4vIztXRnaejOx8GdkFMrILZWQ/kJFdJCP7oYzsYhnZj2Rkl8jIfiwju1RG9hMZ2WUysstlZFfIyK6UkV0lI/upjOxqGdnPZGTXyMiGZGQhI/u5jOxaGdl1MrLrZWQ3yMhulJHdJCO7WUZ2i4zsVhnZL2Rkt8nIbpeR3SEju1NGdpeM7JcysrtlZL+Skd0jI7tXRnafjOzXMrL7ZWS/kZE9ICN7UEb2kIzstzKyh2Vkv5ORPSIj+72M7FEZ2WMyssdlZH+Qkf1RRvYnGdkTMrI/y8j+IiP7q4zsSRnZ32RkT8nI/i4je1pG9g8Z2TMisk4GGVlLRtaWkXVkZDPKyGaSkc0sIyuz4q4js+KuI7PiriOz4q4js+KuI7PiriOz4q4js+KuI7PiriOz4q4js+Kuc52MrMyKu47MiruOzIq7jsyKu47MiruOzIq7jsyKu47MiruOzIq7jsyKu47MiruOzIq7jsyKu47MiruOzIq7jsyKu47MiruOzIq7jsyKu47MiruOzIq7jsyKu47MiruOzIq7jsyKu87NMrIyS+k6t8rIyqyR68iskevIrJHr3CEjK7NGriOzRq4js0auI7NGriOzRq4js0auI7NGriOzRq4js0auI7NGriOzRq4js0auI7NGriOzRq4js0auI7NGriOzRq4js0auI7NGriOzRq4js0auI7NGriOzRq4js0auI7NGriOzRq4js0auI7NGriOzRq4js0auI7NGrtNERlZmjVxHZo1cR2aNXEdmjVxHZo1cR2aNXEdmjVxHZo1cR2aNXOdRGVmZ9W8dmfVvHZn1bx2Z9W8dmfVvHZn1bx2Z9W8dmfVvHZn1bx2Z9W8dmfVvHZn1bx2Z9W8dmfVvHZn1bx2Z9W8dmfVvHZn1bx2Z9W8dmfVvHZn1b51YGVmZ9W8dmfVvHZn1bx2Z9W8dmfVvHZn1bx2Z9W8dmfVvHZn1bx2Z9W8dmfVvHZn1bx2Z9W8dmfVvHZn1bx2Z9W8dmfVvHZn1bx2Z9W8dmfVvHZn1bx2Z9W8dmfVvHZn1bx2Z9W8dmfVvHZn1bx2Z9W8dmfVvHZn1bx2Z9W+dJBlZmfVvHZn1bx2Z9W8dmfVvHZn1bx2Z9W8dmfVvHZn1bx2Z9W8dmfVvHZn1bx2Z9W8dmfVvHZn1bx2Z9W8dmfVvHZn1bx2Z9W8dmfVvHZn1bx2Z9W8dmfVvHZn1bx2Z9W8d0vq3DSK6xsT2rhMdGZ9cd6fTsWat2nXq1qvfoGGjxg81adqseYuWrR5u/cijbR5r+3h4u/YdIjp26hz5RJeortEx3Z6MjYvv3qNnr95P9Xn6mWf7hp4LJYSeD/ULvRDqH3oxNCD0Umhg6OXQoNArocGhV0NDQkNDiaGkUHJoWGh46LXQiNDI0KjQ66HRoTdCY0JvhsaGxoXGh94KTQhNDE0KTQ5NCb0dmhqaFpoeeic0I/RuaGZoVmh26L3QnND7obmheaH5oQWhhaEPQotCH4YWhz4KLQl9HFoa+iS0LLQ8tCK0MrQq9Glodeiz0JpQKITQ56G1oXWh9aENoY2hTaHNoS2hraEvQttC20M7QjtDu0JfhnaHvgrtCe0N7Qt9Hdof+iZ0IHQwdCj0behw6LvQkdD3oaOhY6HjoR9CP4Z+Cp0I/Rz6JfRr6GTot9Cp0O+h06E/QmdgZYBlwbJhObAywsoEKzOsLLCywsoGKzusHLBywsoFKzesPLDywsoH6zpY+WEVgFUQViFYhWG5sDxYAVhBWD6sMFjXwyoCqyisYrBugFUcVglYJWGVglUaVhlYZWHdCOsmWDfDugXWrbBug3U7rHKw7oBVHtadsO6CdTese2DdC+s+WPfDegDWg7AqwKoIqxKsyrCqwKoKqxqs6rBqwKoJqxas2rDqwKoLqx6s+rAawGoIqxGsxrAegtUEVlNYzWA1h9UCVktYrWA9DKs1rEdgPQqrDazHYLWF9TiscFjtYLWH1QFWBKyOsDrB6gwrEtYTsLrAioLVFVY0rBhY3WA9CSsWVhyseFjdYfWA1RNWL1i9YT0Fqw+sp2E9A+tZWH1hPQcrAdbzsPrBegFWf1gvwhoA6yVYA2G9DGsQrFdgDYb1KqwhsIbCSoSVBCsZ1jBYw2G9BmsErJGwRsF6HdZoWG/AGgPrTVhjYY2DNR7WW7AmwJoIaxKsybCmwHob1lRY02BNh/UOrBmw3oU1E9YsWLNhvQdrDqz3Yc2FNQ/WfFgLYC2E9QGsRbA+hLUY1kewlsD6GNZSWJ/AWgZrOawVsFbCWgXrU1irYX0Gaw2sECzA+hzWWljrYK2HtQHWRlibYG2GtQXWVlhfwNoGazusHbB2wtoF60tYu2F9BWsPrL2w9sH6GtZ+WN/AOgDrIKxDsL6FdRjWd7COwPoe1lFYx2Adh/UDrB9h/QTrBKyfYf0C61dYJ2H9BusUrN9hnYb1B6wzsDPAtmDbsB3YGWFngp0ZdhbYWWFng50ddg7YOWHngp0bdh7YeWHng30d7PywC8AuCLsQ7MKwXdge7ADsIGwfdhjs62EXgV0UdjHYN8AuDrsE7JKwS8EuDbsM7LKwb4R9E+ybYd8C+1bYt8G+HXY52HfALg/7Tth3wb4b9j2w74V9H+z7YT8A+0HYFWBXhF0JdmXYVWBXhV0NdnXYNWDXhF0Ldm3YdWDXhV0Pdn3YDWA3hN0IdmPYD8FuArsp7Gawm8NuAbsl7FawH4bdGvYjsB+F3Qb2Y7Dbwn4cdjjsdrDbw+4AOwJ2R9idYHeGHQn7CdhdYEfB7go7GnYM7G6wn4QdCzsOdjzs7rB7wO4Juxfs3rCfgt0H9tOwn4H9LOy+sJ+DnQD7edj9YL8Auz/sF2EPgP0S7IGwX4Y9CPYrsAfDfhX2ENhDYSfCToKdDHsY7OGwX4M9AvZI2KNgvw57NOw3YI+B/SbssbDHwR4P+y3YE2BPhD0J9mTYU2C/DXsq7Gmwp8N+B/YM2O/Cngl7FuzZsN+DPQf2+7Dnwp4Hez7sBbAXwv4A9iLYH8JeDPsj2Etgfwx7KexPYC+DvRz2CtgrYa+C/Sns1bA/g70Gdgg2YH8Oey3sdbDXw94AeyPsTbA3w94CeyvsL2Bvg70d9g7YO2Hvgv0l7N2wv4K9B/Ze2Ptgfw17P+xvYB+AfRD2Idjfwj4M+zvYR2B/D/so7GOwj8P+AfaPsH+CfQL2z7B/gf0r7JOwf4N9CvbvsE/D/gP2GTgZ4JhvXRuOAycjnExwMsPJAicrnGxwssPJAScnnFxwcsPJAycvnHxwroOTH04BOAXhFIJTGI4Lx4MTgBOE48MJg3M9nCJwisIpBucGOMXhlIBTEk4pOKXhlIFTFs6NcG6CczOcW+DcCuc2OLfDKQfnDjjl4dwJ5y44d8O5B869cO6Dcz+cB+A8CKcCnIpwKsGpDKcKnKpwqsGpDqcGnJpwasGpDacOnLpw6sGpD6cBnIZwGsFpDOchOE3gNIXTDE5zOC3gtITTCs7DcFrDeQTOo3DawHkMTls4j8MJh9MOTns4HeBEwOloCvim2G4K46aIbQrOpjhsCrmm6GoKpKaYaQqPpkhoCnqm+GYKZaaoZQpQplhkCjumCGMKJqa4YQoRpmhgJvjNZLyZODeT3GZC2kwem4leMylrJlDNZKeZmDSTiGbCz0zOmYk0M+llJqjMZJKZ+DGTNGZCxUx+mIkKM6lgJgDMYN0MrM0g2AxYzeDSDATNoM0MsMxgyAxczCDDDAjMy7t50TYvxeYF1rxsmhdD8xJnXrimNYmI7x4bXT08PnxnhpoZLNvJmClzlqzZsufImSt3nrz5rstfoGChwq4XCPph1xcpWuyG4iVKlipdpuyNN918y6233V7ujvJ33nX3Pffed/8DD1aoWKlylarVqtcYOnRnhuJJCROrtI+MbZa0dl2Wwz+tWdlp6NC/ftTi8h+1ufxHj1/+o+jLf9Q9ae2Q7Ye/fCH7q9///aPelx8VGpjKz4YnrZ1z183352pV6rm/f4aMT12uh4z9Ujkyc8LlksjcL7UfrkvthztS0czupXJk9g9TsZR9RSq/nvNUKr+e83QqP8xVN7UfNk9FM29yKkfmuzsVS/kqpfLr+bun8uv5e6b2w+Wp/XBtKpqFc6VyZOFZqVgqvDCVX/eOpvLr3vFUfhioeMEPX0/aVib8z/FM2/YxXbuFx0e2i4poGxMb3t78X4+I2LjImOi2PWPDu3WLiN2ZoVDCpGox0XHxyQmTq0fGRrSPtxOm1ImOj+gUETuhefk7rjwUuvT3rXT9/nPVL/39DOlrv3rCxGrhUVGJOc7rvN0kIspA94hInxMzXrtMwU6vwjtnvXQwT6hqMd16n0eqfqGnC8TPOc91zc6rMzif2DQ+pltiUhpOL7lG1SbVjIyIuvLfyBWafO6Z/Rdp3oTpNWNiIyI7RZ/9z+HbSoc/FR/Rvm33+Ki25zpstfP9tdGf3bXFud46dGhiwoxzY+kqHTrERsTFnTeSmDC5aWTXblER5xz93d4lfjOm62z0qp4wvWpkdPjZkXt8o27D/1Zx3q5vmm7WOTz6rEpKfz3fyOS63bt2q9Mx6fwvFEyYUSe6wzmnad4kd/9DdnH7ihNb3q97R9eEic3MDZuYlPL7f9+tfxEnzYmLiG8bFxHdISK2bceY2Lbx4Z3i9O/uGtd4d9f4q+fkvOYebl2u4LDf3faF4hMaxPS46H46fzzXfV9D+r7/x9v3g3N3b7fYHqbfxTf9s+uZf29mOl4qN2yKvsgtW+N/4S37XlRMp7+/l89/Hz+ufMdGXuMdG/lXZ6l9ed9M3yXNUPJyhUzsd2zGC8WN8wvAq6d8+LvVt5rfe8lBNVI+pH1QzZQPaR9UK+VD2gfVTvmQ9kF1Uj6kfVDdlA9pH1Qv5UPaB9VP+ZD2QQ1SPqR9UMOUD2kf1CjlQ9oHNU75kPZBD6V8SPugJikf0j6oacqHtA9qlvIh7YOap3xI+6AWKR/SPqhlyoe0D2qV8iHtgx5O+ZD2Qa1TPqR90CMpH9I+6NGUD2kf1CblQ9oHPZbyIe2D2qZ8SPugx1M+pH1QeMqHtA9ql/Ih7YPap3xI+6AOKR/SPigi5UPaB3VM+ZD2QZ1SPlx4UNpvOdf6blLjmp//xS91lzHlS/Ey7czp0y6R+guHNcG88Fz4rmFd2MKlrxZX+9VoXdJ4ShPnm7+c2f7rbPz9pnPhhbnoXzJeaPmif8l0ybel+Z6vc+k5ti9s+lrfuTtfcx+wBPuA/X+oDzicfcC5sOlzxzS75tFO5L812kn1oma59KI6KSfkovOTNeWAi36eLeXUptpA9sk1nuweHhV3YRvntbJcNlDJ3jRhYv2Y8A7nf5A55ZcmGcrYiMtbzpx6y1kvRcua0l1S/YVsl/5CtpRfmHjWZ2L9i0eOra95MJBmb890eW+307L/T7eIc8EvXTjKnZEyR2WGa0OHDkt7YJswtXZEeLcqsbHhvS/oYZmKp/kbGVP/jczWsL+HyBd91U46d2Biav9Y/LIf/ol36a+cG3JbPGPuSK4xd1vlMXd75TF31DWOuaP+us3qXfNtVua/Mfd/Y+7/xtz/jbn/G3P/Dx5zX3xQ55QPaR8UmfIh7YOeSPnwv2WIX0pweFf6vyH+n68V9UWH+F3+G+L/S33A4ewDqQzxW17zED/qvyH+hUP8Fv+Th/iNLh7it/n/eYhf6t8Y4pdSGOJHcQ3x2/17Q/xtN0fHxEd27N02NqJHROy5v37r1jk8LqJtXHx4bPxlo//C/0f+RibX/8K/kbni6P/P/nWlv6TJ/b/tL2nyXfKHcCVS/pTmXN9tcr7rNj7bc5ue7bi0P6q5yPX/sL+tKfRvPgT++hPYHuFRkR3aduveLiqyfdv25my3Pds5L3sI/PeHcpeT/FsPgf/rfyi3rXjK7X2uV7Y42ykb/9kn/z5T//3JHOW2/ujPO7hbbGSP8PiIth27R5sJjZjotpGmldjo8KidGW5Tvo/rXeN9XO+vLlTwmkeumS5XyMJ+H2e+UPyKs/R/dqgrzsCnclSqU/Dl/uHBcdmExXkvlw1j//qXmmlOItS69F8ypbg5d7EKXTwMrHOhpYv+pe6Flq71MVvnmkdc9uUPtQuH9Rc/1Mpeehoy/8MsSzp7mpP+WZYsac+yZE7vLZ/GEDLL5UPIzGkMIRenPOHPPqEan3tA1fzr+ZSY+iAwi52YxujNHv4PQ9C0/sVO81+cfxiepvUvmYZfbCn1wSf9kItu3Gv9Pk/zkjmpXbILWvlrPuUfByOp3Qt2qk+n1F4FnL/OxaWH2GnBXvPJSHMKJGM6T8ZFU3qXPVvfvnQqOdWTyPNqUo/r1eTWf3HEUfKvaYf2sRHm3u/QNrp7VFRkx8iI2L8HG91iY3r1/m+okRrJ1X4H/jfUuGSoUfTSmYRq53pjw78743/jDMrNPOtcM+acmLHF2amYUZeehILXeNMW4OnoGVL8nBe+9PFCDGtmSJhx7jr9eXijbsPOn/i/yhaXtWlffo2yXvZwIrZupdV6hgnVI3tcdqVSbpLz2H+fiKQPLrx4f57itk92NzdDRHT8yEvtZU/vd+0lv5+D+TJmTxFO43zY0/5q8ILTkiHl/KTxW9aEBt2jLrhuVzy8afd2qahfNJq5oB9ccjFynMf5fwYyKs7AahUA",
+      "debug_symbols": "tb3djmzXcaz7LrzmxcyMzBxj+FUMw5Bl2SBASIYsbeDA0Lufruqq+Ca5sdqkqH2jGmstakZVd0VU/0R98T/f/fsf/u2v//mvP/zxP/7039/90z//z3f/9ucffvzxh//81x//9Pvf/eWHP/3x42//57vr8T9R3/1T6G/ffxf+08cf8vGH3R9/yO+/2/O6Xa/b/bj9+K/0/K/262/P5+25Xrfx+q/qeeHHtR5XbstcH3+ax5/y4zr60KzPm/68mc+b9XmzP28+NOZD9/q8ic+bjzu7Pm70eVOfNx9XOR8383nzcZXzIbfe4vm3jz+9Pxj/+pc//+EPj3+5fXQ+Pmb/9bs//+GPf/nun/741x9//P67//O7H//6/I/++79+98fn7V9+9+ePf72+/+4Pf/z3j9uPC/7HDz/+4XH62/f8v69v/1/3Wvv1/947wxeIk7/0Er9BfWTxq9Be6xff/a33Bc7+5gXq2xfQ9OsCWtyDip8+hP72BbLeF8hZ37zAL7sHW9+8wBcfg5PvCxzNNz8G+7c+hK8+jT2vC6xr3Z5C/Ys/jWo/Ca/bBc4vvUBm1/sx5D6+hHr/0kvEFe87EdfiXuT1iz8O6/hzua/kkxnx089FfPF02Gf82dx/z53IDPlDcXtOa/300xHz7WtU6n2N0hW350T89Brri+f1GvHEzm9fY3/1OanY/qRU9u0q+nuvUvnNq+T12x9Pxj/gGvnF5+ZyYtd14tuP5Yv7cVa+n2T7i4/pF8+QVL2fp6mfpMbP7sVX0dnpZ2rfouvX3I917Lj49hVy/daPxVeG+3j874dRkd90fZ4vrhGzbdrkw7l/ei/01cuALl4Hbs9x9fz0Gl89L656f0bOda5vX+OL56f6/fHU4YE8Xll+cgV9cYXrcR8/L3Hp/H3XiHi/ICg6v32NL56fxZOr7m6N8/c9lPuLyq95KENozIrffo3b0/xXXePwWM58+9NS1//bD+k5l+/G7Yu+n9+Nrxxb5a8W6v51488cW/rqReXD7H5RycVTfV2/4iJVvDL17Wvg9Ytf76PaX7fU5sF0/OIr9Hp/OKJPfusKtb58nm8/z5uH0T/9LqL2VzksXqNvD+OnyVPntydgX789ATt+awJ2/nbLf/kpCX9RrbzONz8lX10i0yH68Qr9rUv0V6/x+5K/UNjXfPMZ/uVF1tlxu8j+5kXWb/8W4atr1PV4EX997XV7hv3sG5X+4kka+3p/tRC7+pt3Y77Kr2u/IzAjr29e4+vP7Rx/bm9fRv7scztfPUuvST/Tr+n41qfl64usOLxE3l6qf9VFZm6vs/3NZ9n0b3+CfHWNX/gEmfUPeILs3/4E+fpj+uE0f0z37dvZn31M11ff2F98N/pxrr/zs8vPB/QRyv3Ne/LVt01+ya+zvvkjhi8do/DHQ/vvC9SPJ8X7EqVvBur6R2Thmt/8NF3/gKfp+gc8Tb/8ePwjspAvoVS3H0D97NOyv3jNj4/n9vvDkbcvjn/2ZcP+4hm6oy++l719RLN/xd3wEyzyZtmf342vLiG970bo9mXtzy/xxedkXXxT/XG+eeVnz9E9/4Do+OoicdR+mh59+6v0Lx/O4+v798OJa+vvvMgpXyT0Td+er759Ou/70T3f/EHr13ejwp+aqG9/VM8Xz9TZ834os28f01/xJBs/1+P+Be6veZ5uEUD7m5c4/dWvH8LfdMxPMv3nH4yvLlKd70D+ONf+uy7y8S3pO4Im+4q/69Oy/H3crNuXdPMrPrH+XcLs+tYn9usP6cfvDfwhrfrmA/n4cftvfSRfX+IXPZT/5RK/5Gn+5QtLN9/H5Te/ZIirf/t3tXHNb/+2Nq71W7+v/QjI3/6N7dcX+YU/iIr47T+J+l/uyC/7UdSXT5Gp20fkm197ROjLVzmH+se5vvkqF1/95qn3tnHvLy76NXek/IXlx7nm23fkH/HK/+VVfvFL///2of2lVzm/NUm++s3irPezdc2pn/7E8l8+/vi73//w5582Kx59g8dvNPWoLTwqCufztq7Xbbxu83Wr1229bvt1O6/b9bp9Xa9e1+vX9fp1vX5dr1/X69f1+nW9fl2vX9fr1/X6db15XW9e15vX9eZ1vXldb17Xm9f15nW9eV1vXtdbr+ut1/XW63rrdb31ut56XW+9rrde11uv663X9fbrejsevyX6uM3XrR7fZH7c1uv243qP1/RHc+V5+3G9x+/MHl2Vxw8aHl2Vx+2jq/K8fTRJPq5z8mHAj1u9bj+u9/hRzenHV2wft/O6/bje46uX83G9x6vlOZ+3cV3vQzx+P/Y45MNIj4Peh3r8bulx6Pdh3of1aIU8Dvt9OK9DXO9DPH5T/zh8XPnE4/C4zkMrHm2Xh3qs9+HjOo9fan845HXI6/Hj3sch3od8H/Q+PC74+L8/SjjPKz9qOJ9/s1+P4lHFed7nRxnn8xDvQ77u6qOS83mo96Hfh3kf3g9Z74es90N+uOX5SOv9kB9++Tzo9dgfTjmPe/iwyudhvQ/7fTivw8MuH5+ixyl8Sp/kU/nUPo1Py6ft03mfxhpjjbHGWGOsMdYYa4w1xhpjjWWNZY1ljWWNZY1ljWWNZY1ljWWNbY1tjW2NbY1tjW2NbY1tjW2NbY1jjWONY41jjWONY41jjWONY43z1sjr8il8Sp/kU/nUPo1Py6ftkzXCGmGNsEZYI6wR1ghrhDXCGmGNtEZaI62R1khrpDXSGmmNtEZaQ9aQNWQNWUPWkDVkDVlD1pA1yhpljbJGWaOsUdYoa5Q1yhplDfs87fO0z9M+T/s87fO0z9M+T/s87fO0z9M+T/s87fO0z9M+T/s87fO0z9M+T/s87fO0z9M+T/s87fO0z9M+T/s87fO0z9M+T/s87fO0z9M+T/s87fO0z9M+T/s87fO0z9M+T/s87fO0z9M+T/s87XPZ57LPZZ/LPpd9Lvtc9rnsc9nnss9ln8s+l30u+1z2uexz2eeyz2Wfyz6XfS77XPa57HPZ57LPZZ/LPpd9Lvtc9rnsc9nnss9ln8s+l30u+1z2uexz2eeyz2Wfyz6XfS77XPa57HPZ57LPZZ/LPpd9Lvtc9rnsc9nnss9ln8s+l30u+1z2uexz2eeyz2Wfyz6XfS77XPa57HPZ57LPZZ/LPpd9Lvtc9rnsc9nnss9ln8s+l30u+1z2uexz2eeyz2Wfyz6XfS77XPa57HPZ57LPZZ/LPi/7vOzzss/LPi/7vOzzss/LPi/7vOzzss/LPi/7vOzzss/LPi/7vOzzss/LPi/7vOzzss/LPi/7vOzzss/LPi/7vOzzss/LPi/7vOzzss/LPi/7vOzzss/LPi/7vOzzss/LPi/7vOzzss/LPi/7vOzzss/LPi/7vOzzss/LPi/7vOzzss/LPi/7vOzzss/LPi/7vOzzss/LPi/7vOzzss/LPi/7vOzzss/LPi/7vOzzss/LPi/7vOzzss/LPi/7vOzzss/LPi/7vOzzss/LPi/7vOzzss/LPi/7vOzzss/LPm/7vO3zts/bPm/7vO3zts/bPm/7vO3zts/bPm/7vO3zts/bPm/7vO3zts/bPm/7vO3zts/bPm/7vO3zts/bPm/7vO3zts/bPm/7vO3zts/bPm/7vO3zts/bPm/7vO3zts/bPm/7vO3zts/bPm/7vO3zts/bPm/7vO3zts/bPm/7vO3zts/bPm/7vO3zts/bPm/7vO3zts/bPm/7vO3zts/bPm/7vO3zts/bPm/7vO3zts/bPm/7vO3zts/bPm/7vO3zts/bPm/7vO3zts/bPm/7vO3zts/bPm/7vO3zts/bPh/7fOzzsc/HPh/7fOzzsc/HPh/7fOzzsc/HPh/7fOzzsc/HPh/7fOzzsc/HPh/7fOzzsc/HPh/7fOzzsc/HPh/7fOzzsc/HPh/7fOzzsc/HPh/7fOzzsc/HPh/7fOzzsc/HPh/7fOzzsc/HPh/7fOzzsc/HPh/7fOzzsc/HPh/7fOzzsc/HPh/7fOzzsc/HPh/7fOzzsc/HPh/7fOzzsc/HPh/7fOzzsc/HPh/7fOzzsc/HPh/7fOzzsc/HPh/7fOzzsc/HPh/7fOzzsc/HPh/7fOzzsc/HPh/7fOzzsc/HPl/2+bLPl32+7PNlny/7fNnnyz5f9vmyz5d9vuzzZZ8v+3zZ58s+X/b5ss+Xfb7s82WfL/t82efLPl/2+bLPl32+7PNlny/7fNnnyz5f9vmyz5d9vuzzZZ8v+3zZ58s+X/b5ss+Xfb7s82WfL/t82efLPl/2+bLPl32+7PNlny/7fNnnyz5f9vmyz5d9vuzzZZ8v+3zZ58s+X/b5ss+Xfb7s82WfL/t82efLPl/2+bLPl32+7PNlny/7fNnnyz5f9vmyz5d9vuzzZZ8v+3zZ58s+X/b5ss+Xfb7s82WfL/t82efLPl/2+bLPl32+7PNtn2/7fNvn2z7f9vm2z7d9vu3zbZ9v+3zb59s+3/b5ts+3fb7t822fb/t82+fbPt/2+bbPt32+7fNtn2/7fNvn2z7f9vm2z7d9vu3zbZ9v+3zb59s+3/b5ts+3fb7t822fb/t82+fbPt/2+bbPt32+7fNtn2/7fNvn2z7f9vm2z7d9vu3zbZ9v+3zb59s+3/b5ts+3fb7t822fb/t82+fbPt/2+bbPt32+7fNtn2/7fNvn2z7f9vm2z7d9vu3zbZ9v+3zb59s+3/b5ts+3fb7t822fb/t82+fbPt/2+bbPt32+7fNtn2/7fNvn2z4/9vmxz499fuzzY58f+/zY58c+P/b5sc+PfX7s82OfH/v82OfHPj/2+bHPj31+7PNjnx/7/Njnxz4/9vmxz499fuzzY58f+/zY58c+P/b5sc+PfX7s82OfH/v82OfHPj/2+bHPj31+7PNjnx/7/Njnxz4/9vmxz499fuzzY58f+/zY58c+P/b5sc+PfX7s82OfH/v82OfHPj/2+bHPj31+7PNjnx/7/Njnxz4/9vmxz499fuzzY58f+/zY58c+P/b5sc+PfX4ePj/PAkm9D/0+zPuw3of9PpzX4WHwz0O8D/k+vK983lc+7yuf95XP+8rnfeXzuvLHvbt8Cp/SJ/lUPrVP49PyaftkjbBGWCOsEdYIa4Q1whphjbBGWCOtkdZIa6Q10hppjbRGWiOtkdaQNWQNWUPWkDVkDVlD1pA1ZI2yRlmjrFHWKGuUNcoaZY2yRlmjrdHWaGu0NdoabY22RlujrdHWGGuMNcYaY42xxlhjrDHWGGuMNZY1ljWWNZY1ljWWNZY1ljWWNZY1tjW2NbY1tjW2NbY1tjW2NbY1tjWONY41jjWONY41jjWONY41jjXs87DPwz4P+zzs87DPwz4P+zzs87DPwz4P+zzs87DPwz4P+zzs87DPwz4P+zzs87DPwz4P+zzs87DPwz4P+zzs87DPwz4P+zzs87DPwz4P+zzs87DPwz4P+zzs87DPwz4P+zzs87DPP6tvz5Jfuff39Pmz71du/n2+fufj+PkC/nkMjslRHItjc3y+/D31P1/HP4+b4/Hx86X88xgck6M4FsfmiNqgNqgNagu1hdpCbaG2UFuoLdQWagu1hdpGbaO2UduobdQ2ahu1jdpGbaN2UDuoHdQOage1g9pB7aB2UDtWe1XmPo/BMTmKY3FsjsNxcdwcUQvUArVALVAL1AK1QC1QC9QCtUQtUUvUErVELVFL1BK1RC1RE2pCTagJNaEm1ISaUBNqQq1QK9QKtUKtUCvUCrVCrVAr1Bq1Rq1Ra9QatUaNLEmyJMmSJEuSLEmyJMmSJEuSLEmyJMmSJEuSLEmyJMmSJEuSLEmyJMmSJEuSLEmyJMmSJEuSLEmyJMmSJEuSLEmyJMmSJEuSLEmyJMmSJEuSLEmyJMmSJEuSLEmyJMmSJEtElogsEVkiskRkicgSkSUiS0SWiCwRWSKyRGSJyBKRJSJLRJaILBFZIrJEZInIEpElIktElogsEVkiskRkicgSkSUiS0SWiCwRWSKyRGSJyBKRJSJLRJaILBFZIrJEZInIEpElIktElogsEVkiskRkicgSkSUiS0SWiCwRWSKyRGSJyBKRJSJLRJaILBFZIrJEZInIEpElIktElogsEVkiskRkicgSkSUiS0SWiCwRWSKyRGSJyBKRJSJLRJaILBFZIrJEZInIEpElIktElogsEVkisqTIkiJLiiwpsqTIkiJLiiwpsqTIkiJLiiwpsqTIkiJLiiwpsqTIkiJLiiwpsqTIkiJLiiwpsqTIkiJLiiwpsqTIkiJLiiwpsqTIkiJLiiwpsqTIkiJLiiwpsqTIkiJLiiwpsqTIkiJLiiwpsqTIkiJLiiwpsqTIkiJLiiwpsqTIkiJLiiwpsqTIkiJLiiwpsqTIkiJLiiwpsqTIkiJLiiwpsqTIkiJLiiwpsqTIkiJLiiwpsqTIkiJLiiwpsqTIkiJLiiwpsqTIkiJLiiwpsqTIkiJLiiwpsqTIkiJLiiwpsqTJkiZLmixpsqTJkiZLmixpsqTJkiZLmixpsqTJkiZLmixpsqTJkiZLmixpsqTJkiZLmixpsqTJkiZLmixpsqTJkiZLmixpsqTJkiZLmixpsqTJkiZLmixpsqTJkiZLmixpsqTJkiZLmixpsqTJkiZLmixpsqTJkiZLmixpsqTJkiZLmixpsqTJkiZLmixpsqTJkiZLmixpsqTJkiZLmixpsqTJkiZLmixpsqTJkiZLmixpsqTJkiZLmixpsqTJkiZLmixpsqTJkiZLmixpsqTJkiZLmixpsqTJkiZLmixpsmTIkiFLhiwZsmTIkiFLhiwZsmTIkiFLhiwZsmTIkiFLhiwZsmTIkiFLhiwZsmTIkiFLhiwZsmTIkiFLhiwZsmTIkiFLhiwZsmTIkiFLhiwZsmTIkiFLhiwZsmTIkiFLhiwZsmTIkiFLhiwZsmTIkiFLhiwZsmTIkiFLhiwZsmTIkiFLhiwZsmTIkiFLhix5NSDreSyOzfHxQ+X1PC2ftk+PH1w/3on9LEF+/t3zly6fp/RJPpVP7ZM1ljWWNZ6/dHmetjW2NbY1tjW2NbY1tjW2NbY1tjWONY41jjWONY41jjWONY41jjXOW+NZgnydwqf0ST6VT+3T+LR82j5ZI6wR1ghrhDXCGmGNsEZYI6wR1jBEYJkisIwRWOYIPEuQr5M10hppjbRGWkPWkDVkDVlDfva+WpCfR6s8AQN6nrZP5316Mgae/90TMvB5Sp/kU/nUPo1P68UleNYgX6fHI3kgCp7lxyd/4Fl+fJ3kU/nUPr1LBkH7Mag/Bv3HoAAZNCCDCmTQgQxKkEELMqhBBj3IoAgZ60YeuKEHbuyBG3zgRh+44Qdu/IE7gAC1G4IABgGlyKAVGdQig15kUIwMmpFBNTLoRgblyKAdGdQjg35kUJAMGpJBRTLoSAYlyaAlGdQkg55kUJQMmpJBVTLoSgZlyaAtGdQlg75kUJgMGpNBZTLoTAalyaA1GdQmg95kUJwMmpNBdTLoTgblyaA9GdQng/5kUKAMGpRBhTLoUAYlyqBFGdQogx5lUKQMmpRBlTLoUgZlyqBNGdQpgz5lUKgMGpVBpTLoVAalyqBVGdQqg15lUKwMmpVBtTLoVgblyqBdGdQrg35lULAMGpZBxTLoWAYly6BlGdQsg55lULQMmpZB1TLoWgZly6BtGdQtg75lULgMGpdB5TLoXAaly6B1GdQuY994JjegyY1ockOa3JgmN6jJjWpyw5rcuSaokSVUMIMOZlDCDFqYQQ0z6GEGRcygiRlUMYMuZlDGDNqYQR0z6GMGhcygkRlUMoNOZlDKDFqZQS0z6GUGxcygmRlUM4NuZlDODNqZQT0z6GcGBc2goRlUNIOOZlDSDFqaQU0z6GkGRc2gqRlUNYOuZlDWDNqaQV0z6GsGhc2gsRlUNoPOZlDaDFqbQW0z6G0Gxc2guRlUN4PuZlDeDNqbQX0z6G8GBc6gwRlUOIMOZ1DiDFqcQY0z6HEGRc6gyRlUOYMuZ1DmDNqcQZ0z6HMGhc6g0RlUOoNOZ1DqDFqdQa0z6HUGxc6g2RlUO4NuZ1DuDNqdQb0zDllyyJJDlhyy5JAlhyw5N0rSDZN04yTdQEk3UtINlXRjJd1gSTda0h2X9FbL6wZMuhGTbsikGzPpBk26UZNu2KQbN+kGToKcdIFOumAnXcCTLuhJF/ikC37SBUDpgqB0gVC6YChdQJQuKEoXGKULjtIFSOmCpHSBUrpgKV3AlC5oShc4pQue0gVQ6YKodIFUumAqXUCVLqhKF1ilC67SBVjpgqx0gVa6YCtdwJUu6EoXeKULvtIFYOmCsHSBWLpgLF1Ali4oSxeYpQvO0gVo6YK0dIFaumAtXcCWLmhLF7ilC97SBXDpgrh0gVy6YC5dQJcuqEsX2KUL7tIFeOmCvHSBXrpgL13Aly7oSxf4pQv+0gWA6YLAdIFgumAwXUCYLihMFximCw7TBYjpgsR0gWK6YDFdwJguaEwXOKYLHtMFkOmCyHSBZLrIkiBLgiwJsiTIkiBLgiwJsiTIkiBL4kZhu2PYULuB2G4kthuK7cZiu8HYbjS2G46NLAmyJMiSIEuCLAmyJMiSIEuCLAmyJMiSIEuCLAmyJMiSIEuCLAmyJMiSIEuCLAmyJMiSIEuCLAmyJMiSIEuCLAmyJMgSsIwJlzEBMyZkxgTNmLAZEzhjQmdM8IwJnzEBNCaExgTRmDAaE0hjQmlMMI0JpzEBNSakxgTVmLAaE1hjQmtMcI0JrzEBNibExgTZmDAbE2hjQm1MsI0JtzEBNybkxgTdmLAbE3hjQm9M8I0JvzEBOCYExwThmDAcE4hjQnFMMI554zjeQI43kuMN5XhjOd5gjjea4w3neOM53oCON6LjDel4YzreoI43quMN63jjOt7Ajjey4w3teGc73uCOd7ojaje+4w3weCM83hCPN8bjDfJIltwwjzfO4w30eCM93lCPN9bjDfZ4oz3ecI833uMN+HgjPt6Qjzfm4w36eKM+3rCPN+7jDfx4Iz/e0I839uMN/nijP97wjzf+4w0AeSNA3hCQNwbkDQJ5o0DeMJA3DuQNBHkjQd5QkDcW5A0GeaNB3nCQNx7kDQh5I0LekJA3JuQNCnmjQt6wkDcu5A0MeSND3tCQNzbkDQ55o0Pe8JA3PuQNEHkjRN4QkTdG5A0SeaNE3jCRN07kDRR5I0XeUJGwIhNYZEKLTHCRCS8yAUYmxMgEGZkwIxNoZEKNTLCRCTcyAUcm5MgEHZmwIxN4ZEKPTPCRCT8yAUgmBMkEIZkwJBOIZEKRTDCSCUcyAUmmbsTYGzL2xoy9Q2NRu2Fjb9zYGzj2Ro69oWPJEqCSCVUywUomXMkELJmQJRO0ZMKWTOCSCV0ywUsmfMkEMJkQJhPEZMKYTCCTCWUywUwmnMkENJmQJhPUZMKaTGCTCW0ywU0mvMkEOJkQJxPkZMKcTKCTCXUywU4m3MkEPJmQJxP0ZMKeTOCTCX0ywU8m/MkEQJkQKBMEZcKgTCCUCYUywVAmHMoERJmQKBMUZcKiTGCUCY0ywVEmPMoESJkQKRMkZcKkTKCUCZUywVImXMoETJmQKRM0ZcKmTOCUCZ0ywVMmfMoEUJkQKhNEZcKoTCCVCaUywVQmnMoEVJmQKhNUZcKqTGCVCa0ywVUmvMoEWJkQKxNkZcKsTKCVCbUywVZm3TjUNxD1jUR9Q1HfWdSo3WjUNxz1jUd9A1KTJSAsE4ZlArFMKJYJxjLhWCYgy4RkmaAsE5ZlArNMaJYJzjLhWSZAy4RomSAtE6ZlArVMqJYJ1jLhWiZgy4RsmaAtE7ZlArdM6JYJ3jLhWyaAy4RwmSAuE8ZlArlMKJcJ5jLhXCagy4R0maAuE9ZlArtMaJcJ7jLhXSbAy4R4mSAvE+ZlAr1MqJcJ9jLhXibgy4R8maAvE/ZlAr9M6JcJ/jLhXyYAzISAmSAwEwZmAsFMKJgJBjPhYCYgzISEmaAwExZmAsNMaJgJDjPhYSZAzISImSAxEyZmAsVMqJgJFjPhYiZgzISMmaAxEzZmAsdM6JgJHjPhYyaAzISQmSAyE0ZmAsnMvtHtb3j7G9/+Bri/Ee7viHvUbpD7G+X+hrknSwBmJsTMBJmZMDMTaGZCzUywmQk3MwFnJuTMBJ2ZsDMTeGZCz0zwmQk/MwFoJgTNBKGZMDQTiGZC0UwwmglHM/v9hv7s9xv6s99v6M9+v6E/+/2G/uz3G/qz32/oz36/oT/7/Yb+7Pcb+rOPNY41jjWONY413m/oz3m/oT/n/Yb+nPcb+nPeb+jPeb+hP+f9hv6c9xv6c95v6M95v6E/57JGWCOsEdYIa4Q1whphjbBGWCOskdZIa6Q10hppjbRGWiOtkdZIa8gasoasIWvIGrKGrCFryBqyRlmjrFHWKGuUNcoaZY2yRlmjrNHWaGu0NdoabY22RlujrdHWaGuMNcYaY42xxlhjrDHWGGuMNcYayxrLGssayxrLGssayxrLGssayxrbGtsa2xrbGvb52Odjn499Pvb52Odjn499Pvb52Odjn499Pvb52Odjn499vuzzZZ8v+3zZ58s+X/b5ss+Xfb7s82WfL/t82efLPl/2+bLPl32+7PNlny/7fNnnyz5f9vmyz5d9vuzzZZ8v+3zZ58s+X/b5ss+Xfb7s82WfL/t82efLPl/2+bLPl32+7PNlny/7fNnnyz5f9vmyz58N0gfCI58N0tfpoTGP09Pnn6fny1Q+j8lRHItjcxyOi+O7Op7L1fFcro7ncnU8l6vjufw2lFx+G0ouvw0ll9+GkstvQ8k1qA1qC7WF2kJtobZQW6gt1BZqC7WF2kZto7ZR26ht1DZqG7WN2kZto3ZQO6gd1A5qB7WD2kHtoHZQ89tQcvttKLn9NpTcfhtKbr8NJbffhpLbb0PJ7beh5PbbUHL7bSi5L9QCtUAtUAvUArVALVAL1AK1QC1RS9QStUQtUUvUErVELVFL1ISaUBNqQk2oCTWhJtSEmlAr1Aq1Qq1QK9QKtUKtUCvUCrVGrVFr1Bq1Rq1Ra9QaNbJkkyWbLNlkySZLNlmyyZJNlmyyZJMlmyzZZMkmSzZZssmSTZZssmSTJZss2WTJJks2WbLJkk2WbLJkkyWbLNlkySZLNlmyyZJNlmyyZJMlmyzZZMkmSzZZssmSTZZssmSTJYcsOWTJIUsOWXLIkkOWHLLkkCWHLDlkySFLDllyyJJDlhyy5JAlhyw5ZMkhSw5ZcsiSQ5YcsuSQJYcsOWTJIUsOWXLIkkOWHLLkkCWHLDlkySFLDllyyJJDlhyy5JAlhyw5ZMkhSw5ZcsiSQ5YcsuSQJYcsOWTJIUsOWXLIkkOWHLLkkCWHLDlkySFLDllyyJJDlhyy5JAlhyw5ZMkhSw5ZcsiSQ5YcsuSQJYcsOWTJIUsOWXLIkkOWHLLkkCWHLDlkySFLDllyyJJDlhyy5JAlhyw5ZMkhSw5ZcsiSQ5YcsuSQJYcsOWTJIUuOs0SXs0SXs0SXs0SXs0SXs0SXs0SXs0SXs0SXs0TXhVqgFqgFaoFaoBaoBWqBWqAWqCVqiVqilqglaolaopaoJWqJmlATakJNqAk1oSbUhJpQE2qFWqFWqBVqhVqhVqgVaoVaodaoNWqNWqPWqDVqjVqj1qg1aoPaoDaoDWqD2qA2qA1qg9qgtlBbqC3UFmoLtYXaQm2htlBbqG3UNmobtY3aRm2jtlHbqG3UNmoHtYPaQe2gdlA7qB3UDmoHNbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIEzKnAnArMqcCcCsypwJwKzKnAnArMqcCcCsypwJwKzKnAnArMqcCcCsypwJwKzKnAnArMqcCcCsypwJwKzKnAnArMqcCcCsypwJwKzKnAnArMqcCcCsypwJwKzKnAnArMqcCcCsypwJwKzKnAnArMqcCcCsypwJwKzKnAnArMqcCcCsypwJwKzKnAnArMqcCcCsypwJwKzKnAnArMqcCcCsypwJwKzKnAnArMqcCcCsypwJwKzKnAnArMqcCcCsypwJwKzKnAnArMqcCcCsypwJwKzKnAnArMqcCcCsypwJwKzKnAnArMqcCcCsypwJwKzKnAnArMqcCcCsypwJwKzKnAnArMqcCcCsypwJwKzKnAnArMqcCcCsypwJwKzKnAnArMqcCcCsypwJwKzKnAnArMqcCcCsypwJwKzKnAnArMqcCcCsypwJwKzKnAnArMqcCcCsypwJwKzKnAnArMqcCcCsypwJwKzKnAnArMqcCcCsypwJwKzKnAnArMqcCcCsypwJwKzKnAnArMqcCcCsypwJwKzKnAnArMqV6F0noek6M4Pn7JsZ6n9ml8evySYz9P23933qc38EN6Az+kN/BDegM/9KyRvk7WkDWev6z5PFlD1ihrlDXKGmWNskZZo6xR1ihrlDXaGm2NtkZbo63R1mhrtDXaGm2NscZYY6wx1hhrjDXGGmONscZYY1ljWWNZY1ljWWNZY1ljWWNZY1ljW2NbY1tjW2NbY1tjW2NbY1tjW+NY41jj8Ow9PHuPVR4xsJ9P+UcKvE7Lp/0JftGzB/o8PWugr1P4lD7Jp/KpP1ExehZAX6fHI4nn6XH/z+P0/GXs5yl8Sp/k07sOI+qeou4p6p6i7inqnqLuKeqeou4p6p6i7inqnqLuKeqeou4p6p6i7inqnqLuKeqeou4p6p6i7inqnqLuKeqeou4p6p6i7inqnqLuKeqeou4p6p6i7inqnqLuKeqeou4p6p6i7inqnqLuKeqeou4p6p6i7inqnqLuKeqeou4p6p6i7inqnqLuKeqeou4p6p6i7inqnqLuKeqeou4p6p6i7inqnqLuKeqeou4p6p6i7inqnqLuKeqeou4p6p6i7inqnqLuKeqeou4p6p6i7inqnqLuKeqeou4p6p6i7inqnqLuKeqeou4p6p6i7inqnqLuKeqeou4p6p6i7inqnqLuKeqeou4p6p6i7inqnqLuKeqeou4p6p6i7inqnqLuKeqeou4p6p6i7inqnqLuKeqeou4p6p6i7inqnqLuKeqeou4p6p6i7inqnqLuKeqeou4p6p6i7inqnqLuKeqeou4p6p6i7inqnqLuKeqeou4p6p6i7inqnqLuKeqeou4p6p6i7inqnqLuKeqeou4p6p6i7inqnqLuKeqeou4p6p6i7inqnqLuKeqeYjddDKeL5XQxnS6208V4ulhPF/PpYj9dDKiLBXUxoS421MWIulhRFzPqYkddDKmLJXUxpS621MWYulhTF3PqYk9dDKqLRXUxqS421cWoulhVF7PqYlddDKuLZXUxrS621cW4ulhXF/PqYl9dDKyLhXUxsS421sXIulhZFzPrYmddDK2LpXUxtS621sXYulhbF3PrYm9dDK6LxXUxuS4218XoulhdF7PrYnddDK+L5XUxvS6218X4ulhfF/PrYn9dDLCLBXYxwS422MUIu1hhFzPsYoddDLGLJXYxxS622MUYu1hjF3PsYo9dDLKLRXYxyS422cUou1hlF7PsYpddDLOLZXYxzS622cU4u1hnF/PsYp9dDLSLhXYx0S422sVIu1hpFzPtYqddDLWLpXYx1S622sVYu1hrF3PtYq9dDLaLxXYx2S4228Vou1htF7PtYrddDLeL5XYx3S6228V4u1hvF/PtYr9dDLiLBXcx4S423MWIu1hxFzPuYsddDLmLJXcx5S623MWYu1hzF3PuYs9dDLqLRXcx6S423cWou1h1F7PuYtddDLuLZXcx7S623cW4u1h3F/PuYt9dDLyLhXcx8S4wpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnMqMKcCcyowpwJzKjCnAnNaYE4LzGmBOS0wpwXmtMCcFpjTAnNaYE4LzGmBOS0wpwXmtMCcFpjTAnNaYE4LzGmBOS0wpwXmtMCcFpjTAnNaYE4LzGmBOS0wpwXmtMCcFpjTAnNaYE4LzGmBOS0wpwXmtMCcFpjTAnNaYE4LzGmBOS0wpwXmtMCcFpjTAnNaYE4LzGmBOS0wpwXmtMCcFpjTAnNaYE4LzGmBOS0wpwXmtMCcFpjTAnNaYE4LzGmBOS0wpwXmtMCcFpjTAnNaYE4LzGmBOS0wpwXmtMCcFpjTAnNaYE4LzGmBOS0wpwXmtMCcFpjTAnNaYE4LzGmBOS0wpwXmtMCcFpjTAnNaYE4LzGmBOS0wpx+/oL04BsfkKI7FsTkOx8Vxc0SNLAFzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xp5RsEUPkGAVS+QQCVbxBA5RsEUPkGflS+gR+Vb+BH5Rv4UfkGflS2NdoabY22RlujrdHWaGuMNcYaY42xxlhjrDHWGGuMNcYayxrLGssayxrLGssayxrLGssayxrbGtsa2xrbGtsa2xrbGtsa2xrbGscaxxrHGscaxxrHGscaxxrHGm/gR+kN/Ci9gR+lN/Cj9AZ+lN7Aj9Ib+FF6Az9Kb+BH6Q38KF3WCGuENcIaYY2wRlgjrBHWCGuENdIaaY20RlojrZHWSGukNdIaaQ1ZQ9aQNWQNWUPWkDVkDVlD1ihrlDXsc9nnss9ln8s+l30u+1z2uexz2eeyz2Wfyz6XfS77XPa57HPZ57LPZZ/LPpd9Lvtc9rnsc9nnss9ln8s+l30u+1z2uexz2eeyz2Wfyz6XfS77XPa57HPZ57LPZZ/LPpd9Lvtc9rnsc9nnss9ln8s+l30u+1z2uexz2edln5d9XvZ52edlnz8bpA9UTD0bpK/TQ2Oep+3T82UqH8fPF/zPY3BMjuJYHJvjuzperNoXq/bFqn2xal+s2her9sWqfbFqX6zaF6v2xap9sWpfrNoXq/bFqn2xal+s2her9sWqfbFqX6zaF6v2xap9sWpfrNoXq/bFqn2xal+s2her9sWqfbFqX6zaF6v2xap9sWpfrNoXq/bFqn2xal+s2her9sWqfbFqX6zaF6v2xap9sWpfrNoXq/bFqn2xal+s2her9sWqfbFqX6zaF6v2xap9sWpfrNoXq/bFqn2xal+s2her9sWqfbFqX6zaF6v2xap9sWpfrNoXq/bFqn2xal+s2her9sWqfbFqX6zaF6v2xap9sWpfrNoXq/bFqn2xal+s2her9sWqfbFqX6zaF6v2xap9sWpfrNoXq/bFqn2xal+s2her9sWqfbFqX6zaF6v2xap9sWpfrNoXq/bFqn2xal+s2her9sWqfbFqX6zaF6v2xap9sWpfrNoXq/bFqn2xal+s2her9sWqfbFqX6zaF6v2xap9sWpfrNoXq/bFqn2xal+s2her9sWqfbFqX6zaF6v2xap9sWpfrNoXq/bFqn2xal+s2her9sWqfbFqX6zaF6v2xap9sWpfrNoXq/bFqn2xal+s2her9sWqfbFqX6zaF6v2xap9sWpfrNoXq/bFqn2xal+s2her9sWqfbFqX6zaF6v2xap9sWpfrNoXq/bFqn2xal+s2her9sWqfbFqX6zaF6v2xap9sWpfrNoXq/bFqn2xal+s2her9sWqfbFqX6zaF6v2xap9sWpfrNoXq/bFqn2xal+s2her9sWqfbFqX6zaF6v2xap9sWpfrNoXq/bFqn2xal+s2her9sWqfbFqX6zaF6v2xap9sWpfrNoXq/bFqn2xal+s2her9sWqfbFqX6zaF6v2xap9sWpfrNoXq/bFqn2xal+s2her9jVkyZAlQ5YMWTJkyZAlQ5YMWTJkyZAlQ5YMWTJkyZAlQ5YMWTJkyZAlQ5YMWTJkyZAlQ5YMWTJkyZAlQ5YMWTJkyZAlQ5YMWTJkyZAlQ5YMWTJkySJLFlmyyJJFliyyZJEliyxZZMkiSxZZssiSRZYssmSRJYssWWTJIksWWbLIkkWWLLJkkSWLLFlkySJLFlmyyJJFliyyZJEliyxZZMkiSxZZssiSRZYssmSRJYssWWTJIksWWbLIkkWWLLJkkSWLLFlkySJLFlmyyJJFliyyZJEliyxZZMkiSxZZAua0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTutVKH38cuJVKP08BsfHLznW8ySfyqfHLzn28zT+u+XT9um8T2/gR5038KOeNdLXyRrHGs9f1nyerHGscaxxXhr9rI++TuFT+iSfyqf2aXxaPm2frBHWCGuENcIaYY2wRlgjrBHWCGukNdIaaY20RlojrZHWSGukNdIasoasIWvIGrKGrCFryBqyhqxR1ihrlDXKGmWNskZZo6xR1ihr9PvZ268y6OfRKo8YeABi+lkFfZ3ap/kEv/SzB/o6bZ/O+/Tw/+sUPqVP+kTF9LMA+jo9Hkk8T4/7f56n7dN5n56/jP08hU/vOkxT92zqnk3ds6l7NnXPpu7Z1D2bumdT92zqnk3ds6l7NnXPpu7Z1D2bumdT92zqnk3ds6l7NnXPpu7Z1D2bumdT92zqnk3d8+PXHhfH4JgcxbE4NsfhuDhujqgFaoFaoBaoBWqBWqAWqAVqgVqilqglaolaopaoJWqJWqKWqAk1oSbUhJpQE2pCTagJNaFWqBVqhVqhVqgVaoVaoVaoFWqNWqPWqDVqjVqj1qg1ao1aozaoDWqD2qA2qA1qg9qgNqgNagu1hRpZQt2zqXs2dc+m7tnUPZu6Z1P3bOqeTd2zqXs2dc+m7tnUPZu6Z1P3bOqeTd2zqXs2dc+m7tnUPZu6Z1P3bOqeTd2zqXs2dc+m7tnUPZu6Z1P3bOqeTd2zqXs2dc+m7tnUPZu6Z1P3bOqeTd2zqXs2dc+m7tnUPZu6Z1P3bOqeTd2zqXs2dc+m7tnUPZu6Z1P3bOqeTd2zqXs2dc+m7tnUPZu6Z1P3bOqeTd2zqXs2dc+m7tnUPZtV+2bVvlm1b1btm1X7ZtW+WbVvVu2bVftm1b5ZtW9W7ZtV+2bVvlm1b1btm1X7ZtW+WbVvVu2bVftm1b5ZtW9W7ZtV+2bVvlm1b1btm1X7ZtW+WbVvVu2bVftm1b5ZtW9W7ZtV+2bVvlm1b1btm1X7ZtW+WbVvVu2bVftm1b5ZtW9W7ZtV+2bVvlm1b1btm1X7ZtW+WbVvVu2bVftm1b5ZtW9W7ZtV+2bVvlm1b1btm1X7ZtW+WbVvVu2bVftm1b5ZtW9W7ZtV+2bVvlm1b1btm1X7ZtW+WbVvVu2bVftm1b5ZtW9W7ZtV+2bVvlm1b1btm1X7ZtW+WbVvVu2bVftm1b5ZtW9W7ZtV+2bVvlm1b1btm1X7ZtW+WbVvVu2bVftm1b5ZtW9W7ZtV+2bVvlm1b1btm1X7ZtW+WbVvVu2bVftm1b5ZtW9W7ZtV+2bVvlm1b1btm1X7ZtW+WbVvVu2bVftm1b5ZtW9W7ZtV+2bVvlm1b1btm1X7ZtW+WbVvVu2bVftm1b5ZtW9W7ZtV+2bVvlm1b1btm1X7ZtW+WbVvVu2bVftm1b5ZtW9W7ZtV+2bVvlm1b1btm1X7ZtW+WbVvVu2bVftm1b5ZtW9W7ZtV+2bVvlm1b1btG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0z5vEECfNwigzxsE0OcNAujzBgH0eQM/+ryBH33ewI8+b+BHnzfwo09YI6wR1ghrhDXCGmGNsEZYI6yR1khrpDXSGmmNtEZaI62R1khryBqyhqwha8gasoasIWvIGrJGWaOsUdYoa5Q1yhpljbJGWaOs0dZoa7Q12hptjbZGW6Ot0dZoa4w1xhpjjbHGWGOsMdYYa4w1xhrLGssayxrLGssayxrLGssayxrLGtsa2xrbGtsa2xrbGtsa2xrbGtsaxxrHGscaxxrHGscaxxrHGscab+DHXG+fz/X2+Vxvn8/19vlcb5/P9fb5XG+fz/X2+Vxvn891WSOsEdYIa4Q1whphjbBGWCOsEdZIa6Q10hppjbRGWiOtkdZIa6Q1ZA1ZQ9aQNWQNWUPWkDVkDVmjrFHWKGuUNcoaZY2yRlmjrFHWaGu0NdoabY22RlujrdHWaGu0NcYaY42xxtPn9TyVTw+NeZ7Gp+fLVD6Pm+Px8fMF//MYHJOjOL6r48Oq/bBqP6zaD6v2w6r9sGo/rNoPq/bDqv2waj+s2g+r9sOq/bBqP6zaD6v2w6r9sGo/rNoPq/bDqv2waj+s2g+r9sOq/cdPGS+OwTE5imNxbI7DcXHcHFEL1AK1QC1QC9QCtUAtUAvUArVELVFL1BK1RC1RS9QStUQtURNqQk2oCTWhJtSEmlATakKtUCvUCrVCrVAr1Aq1Qq1QK9QatUatUWvUGrVGrVFr1Bq1Rm1QG9QGtUFtUBvUBrVBbVAb1BZqC7WF2kKNLGHVfli1H1bth1X7YdV+WLUfVu2HVfth1X5YtR9W7YdV+2HVfli1H1bth1X7YdV+WLUfVu2HVfth1X5YtR9W7YdV+2HVfli1H1bth1X7YdV+WLUfVu2HVfth1X5YtR9W7YdV+2HVfli1H1bth1X7YdV+WLUfVu2HVfth1X5YtR9W7YdV+2HVfli1H1bth1X7YdV+WLUfVu2HVfth1X5YtR9W7YdV+2HVfli1H1bth1X7YdV+WLUfVu2HVfth1X5YtR9W7YdV+2HVfli1H1bth1X7YdV+WLUfVu2HVfth1X5YtR9W7YdV+2HVfli1H1bth1X7YdV+WLUfVu2HVfth1X5YtR9W7YdV+2HVfli1H1bth1X7YdV+WLUfVu2HVfth1X5YtR9W7YdV+2HVfli1H1bth1X7YdV+WLUfVu2HVfth1X5YtR9W7YdV+2HVfli1H1bth1X7YdV+WLUfVu2HVfth1X5YtR9W7YdV+2HVfli1H1bth1X7YdV+WLUfVu2HVfth1X5YtR9W7YdV+2HVfli1H5ElIktElogsEVkiskRkicgSkSUiS0SWiCwRWSKyRGSJyBKRJSJLRJaILBFZIrJEZInIEpElIktElogsEVkiskRkicgSkSUiS0SWiCwRWSKyRGSJyBKRJSJLRJaILBFZIrJEZInIEpElIktElogsEVkiskRkicgSkSUiS0SWiCwRWSKyRGSJyBKRJSJLRJaILBFZIrJEZInIEpElIktElogsEVkiskRkSZElRZYUWVJkSZElRZYUWVJkSZElRZYUWVJkSZElRZYUWVJkCZjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOZ1XobSex83x+PgGfsy8gR8zb+DHPNukD2jMzBv4MfMGfsy8gR8zb+DHzBv4MfMGfsyzRvo6WaOt8fxlzefJGm2NtkZbo63R1hhrjDXGGmONscZYY6wx1hhrjDWWNZY1ljWWNZY1ljWWNZY1ljWWNbY1tjW2NbY1tjW2NbY1tjW2NbY1jjWONY41jjWONY41jjWONY413mCfWW+wz6w32GfWG+wz6w32mfUG+8x6g31mvcE+s95gn3mVQet59LN3hVWeMRDxPCZHcXxYJfp5fFglPv9vw3Fx3ByPj88YeB2favt5fKrtv33/3f/53Z9/+N2//fiH//7un/7n44//8dc//v4vP/zpj68//uX/+6/3v/zbn3/48ccf/vNf/+vPf/r9H/79r3/+w7/++KffP/7tu+vxP48H9c8x32f8y8d/HP/3X+Xjrz4e2T8vfb/1L99//vO5vj/9+Gf5n+f7Pf5nfX/245+LC67vMx9/1f+3xvivKr6vefzV+vl/9be//cvf/n8=",
       "verification_key": "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAANwAAAAAAAAAAAAAAAAAAAAJl9+G7tc9WrgAJELyqUWJEcAAAAAAAAAAAAAAAAAAAAAAAbXuTCZ7N7iATS8iz6XLwAAAAAAAAAAAAAAAAAAAK/4yu6IpCcookWfgapA7bmGAAAAAAAAAAAAAAAAAAAAAAADopBylLtJiSZFjhHXMYkAAAAAAAAAAAAAAAAAAAD2rcbR7/yFnI8kZwIcLiEZBAAAAAAAAAAAAAAAAAAAAAAAJXCjp753XadGNDjZ1gJCAAAAAAAAAAAAAAAAAAAA00Son/x7Pj4s+TymmiWrwl4AAAAAAAAAAAAAAAAAAAAAACF7tW+Dbk9QDLw8wUVVMQAAAAAAAAAAAAAAAAAAAELIT197KfUsLtkBazK2P2CPAAAAAAAAAAAAAAAAAAAAAAAtCPU/Gn0uTgNt0n4KCb4AAAAAAAAAAAAAAAAAAACgqYYEA4AiD7WJSjgGwzJZ3gAAAAAAAAAAAAAAAAAAAAAAEJC7pY6wfjWKbObwGddrAAAAAAAAAAAAAAAAAAAA8YkivZ+sMibiin2qMYj/CN0AAAAAAAAAAAAAAAAAAAAAAAASJtOaFUsIczPSzPQsVAAAAAAAAAAAAAAAAAAAAKadpgl29pRXtxup569oNHJTAAAAAAAAAAAAAAAAAAAAAAARzijNekj/rRCmdeXVsEYAAAAAAAAAAAAAAAAAAABBDjXOhIcIOh266WEBtabueAAAAAAAAAAAAAAAAAAAAAAAEo2ipACAeyRfTtdTC8qJAAAAAAAAAAAAAAAAAAAAGwBinOREVNaa67rJC+hLh18AAAAAAAAAAAAAAAAAAAAAACvuqjsMxG1Dr/aPhMbD1QAAAAAAAAAAAAAAAAAAAIrRI7uVAZg6sQRs/fEMKARLAAAAAAAAAAAAAAAAAAAAAAAetTwW+kn/4dBlbOG3MfgAAAAAAAAAAAAAAAAAAACu6fXuQ6JLIWZGmQPjIAglfQAAAAAAAAAAAAAAAAAAAAAAK25uBWl0biLMdG2Nqd4+AAAAAAAAAAAAAAAAAAAA34RD4CY/7x6vQarrV/2yyVwAAAAAAAAAAAAAAAAAAAAAAAot+yK0pCzlx7efA+XTYQAAAAAAAAAAAAAAAAAAADKV5Skq5e58zJPucpMJ/0oEAAAAAAAAAAAAAAAAAAAAAAAlPhj9v98Uc9CgAq5ucpwAAAAAAAAAAAAAAAAAAABx5zYhN1wv1vbfLyCbbVTaYQAAAAAAAAAAAAAAAAAAAAAAFirzOUFp4ss0XzWfetIXAAAAAAAAAAAAAAAAAAAA2nMNAzJArrrdtiFD8Mw3d3YAAAAAAAAAAAAAAAAAAAAAABKRZzcRcvTTCBmsCocv4wAAAAAAAAAAAAAAAAAAALfe4zN3jhUnYb0J0Fi8KnDUAAAAAAAAAAAAAAAAAAAAAAARP0qlz0dDZ7V4u03m9nAAAAAAAAAAAAAAAAAAAAC4VyBxl/VbzSd2TQA+W7/8GwAAAAAAAAAAAAAAAAAAAAAABd3QP34HjG3zx5AvlJh/AAAAAAAAAAAAAAAAAAAAVvBfiuL6HOjBYYgaiQA0PNsAAAAAAAAAAAAAAAAAAAAAAC9bbKdo0S1csGECOcjAywAAAAAAAAAAAAAAAAAAALuLB0HukJbYxQjdCFcOoVO5AAAAAAAAAAAAAAAAAAAAAAAJ+SnaH3ii6yr+9PQtv7YAAAAAAAAAAAAAAAAAAABeGYK6DKoOX486QNxJHZGTZQAAAAAAAAAAAAAAAAAAAAAALIx+FvG3SWwA7CTwuHYeAAAAAAAAAAAAAAAAAAAAK5Z1lKRJ4PiTqxzOwY/dsjsAAAAAAAAAAAAAAAAAAAAAACyZlyf4XVGrUTphGn5jIQAAAAAAAAAAAAAAAAAAAHXdIdLRU5pWgtGxxyg9+8pWAAAAAAAAAAAAAAAAAAAAAAAMnodIx3O6jR6ODG/yr1UAAAAAAAAAAAAAAAAAAAAyx9rSZto8LtgGzq/uES/1rQAAAAAAAAAAAAAAAAAAAAAAHP8ym8B1qswpjL9HrjlPAAAAAAAAAAAAAAAAAAAANpBHBww5LpvIa/QiM/6MjU4AAAAAAAAAAAAAAAAAAAAAACZYQoGJSGIGWw3m43EuvgAAAAAAAAAAAAAAAAAAAPZLPMgp3ma06fgQxnCPRjWCAAAAAAAAAAAAAAAAAAAAAAAgnKDS2L2xfVsC/Hs5qXgAAAAAAAAAAAAAAAAAAACkHSPTauCFc53VuaLxQuDjhQAAAAAAAAAAAAAAAAAAAAAAK+qz4ruI7f3jFZRIb5UwAAAAAAAAAAAAAAAAAAAAe1fj1SCvZEr8vLfHGcwX0NUAAAAAAAAAAAAAAAAAAAAAAA3FlUoE9j+vDy8tihS4aQAAAAAAAAAAAAAAAAAAAC5MHCif/g6JPCCdMRkGteYtAAAAAAAAAAAAAAAAAAAAAAAJ7UJaT8pp9W0gmcnRGJEAAAAAAAAAAAAAAAAAAAB6is3FJnOXOrk5+ETPzZQVwgAAAAAAAAAAAAAAAAAAAAAAIxD1cZNLtUo8IyVuZzYKAAAAAAAAAAAAAAAAAAAAFYwK3pVVBzElrZj8q5UHR4kAAAAAAAAAAAAAAAAAAAAAAArnvDcMkOG6fETvYSHmVAAAAAAAAAAAAAAAAAAAAHvClrqz7oTx6h4tHAb4zX6sAAAAAAAAAAAAAAAAAAAAAAAf8tCm1KGOonXDK3k5d90AAAAAAAAAAAAAAAAAAAD/MFK5Pmw/1vYUTmfNyy1lzQAAAAAAAAAAAAAAAAAAAAAAC2Rrv18qf6m0nPvqdR+eAAAAAAAAAAAAAAAAAAAAEhjMQkIjqmzUTHKV9PVt79IAAAAAAAAAAAAAAAAAAAAAABkb86SizQFg/VCtP92EWgAAAAAAAAAAAAAAAAAAAHKcQ+tl8noLbiEzV6DIKkyDAAAAAAAAAAAAAAAAAAAAAAAXbp3YaSi8QCjBBqnFaL0AAAAAAAAAAAAAAAAAAABW0J9SjrtGjukCpl+yzeAPwgAAAAAAAAAAAAAAAAAAAAAAEz1aq0b12TUnju2ut/2QAAAAAAAAAAAAAAAAAAAAkkPcrfAiMiFzdF6T7lzH/Z0AAAAAAAAAAAAAAAAAAAAAAAibU1ZqDb1xD0OFIbwjEQAAAAAAAAAAAAAAAAAAAAu/8mKSUV/w4mv5itS7bJAXAAAAAAAAAAAAAAAAAAAAAAAUTqhw0f70KlAspy0HhBAAAAAAAAAAAAAAAAAAAAD3bAtW7nOU1/lvNAuK2OXvnAAAAAAAAAAAAAAAAAAAAAAAEHEcma//dG0s+2Pz0yPTAAAAAAAAAAAAAAAAAAAAzkUnJUpCUQOp2b3jrTgMA04AAAAAAAAAAAAAAAAAAAAAABsyaly28JXbW7H7FkB6wAAAAAAAAAAAAAAAAAAAAG5k2GwFhh7wNjaTeDihHAaVAAAAAAAAAAAAAAAAAAAAAAAkX3DvGDDvmdkqYlEjMR4AAAAAAAAAAAAAAAAAAAA3UNi3cPPQu4Hgksb0ZkoWtAAAAAAAAAAAAAAAAAAAAAAAAPlHEXBIaAiqYt0whcgQAAAAAAAAAAAAAAAAAAAAH1nVft9E7EfF2CzxnDLnRhIAAAAAAAAAAAAAAAAAAAAAACPhgPj+KFW0bkkkwEzpNwAAAAAAAAAAAAAAAAAAAKCMDRkYcRptxsMKAq5Azst5AAAAAAAAAAAAAAAAAAAAAAANyBy5pk9Q7zSiBYif11wAAAAAAAAAAAAAAAAAAABfqs1iHxg+wzmKgg63NHKTvwAAAAAAAAAAAAAAAAAAAAAAIsDCfKRmCLOvyPFvmYMUAAAAAAAAAAAAAAAAAAAAnEKH7jzHq07Ip4INtGQOnZEAAAAAAAAAAAAAAAAAAAAAAA67Hp0RP2ix1d/FSMtqOQAAAAAAAAAAAAAAAAAAAJW12Le0pjsF32UrDRDvFG0mAAAAAAAAAAAAAAAAAAAAAAAJnjvVoKAKt/4YBAEFubMAAAAAAAAAAAAAAAAAAAAhKa86Y39aYioyRA+GDR4qfwAAAAAAAAAAAAAAAAAAAAAAABW40lFdduLM7Jnc0ZRZAAAAAAAAAAAAAAAAAAAAIiuIgQjcJdGqRQ4LS8ISw34AAAAAAAAAAAAAAAAAAAAAABuRdReSC609i8AclZUJKgAAAAAAAAAAAAAAAAAAAEghQcfr5CAAodWMy3Q4H20ZAAAAAAAAAAAAAAAAAAAAAAAwXomSsUju2yLm6ZIHeoQAAAAAAAAAAAAAAAAAAAB8hoR2GGgdwp2Kk2OrfEDhwwAAAAAAAAAAAAAAAAAAAAAAFkZaXMu1UM0sY71YEW/kAAAAAAAAAAAAAAAAAAAAQ5lzrBLXynltb+mMpA5sprcAAAAAAAAAAAAAAAAAAAAAAC4k1CD7+VCO0x3mkttHewAAAAAAAAAAAAAAAAAAACjt0afkbIQNnJQ/30VSHGTOAAAAAAAAAAAAAAAAAAAAAAAEPQY7Ewrfs3NCr0XQFVoAAAAAAAAAAAAAAAAAAACTMJUq50xXPRaG2ctKAHM4VAAAAAAAAAAAAAAAAAAAAAAAJhUixAiTMGRq/5ZzYZSUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABdhlRDhmo+0HYimui3fcYKHgAAAAAAAAAAAAAAAAAAAAAAFQUrG+/RlB/4bS7aPniYAAAAAAAAAAAAAAAAAAAACdSPo9QyWMhM4lRLu1vxB8YAAAAAAAAAAAAAAAAAAAAAACfUo0yszQHqIX22GMUsqAAAAAAAAAAAAAAAAAAAAGvMegX/lalrKJQkxfczZw2WAAAAAAAAAAAAAAAAAAAAAAAAxDcm91tv2g3iLODg36sAAAAAAAAAAAAAAAAAAAAdCgnXF47JO614WPluZPC0jQAAAAAAAAAAAAAAAAAAAAAAL5tuC04sAZaN5cMkgqp9AAAAAAAAAAAAAAAAAAAAF6UyFPM7GtAJ5GGyaZJyGb4AAAAAAAAAAAAAAAAAAAAAABQQfUvkU8gEqOKRhpGbPgAAAAAAAAAAAAAAAAAAAJKHn2GoKCaTAlYbtX87FVfPAAAAAAAAAAAAAAAAAAAAAAAoRQUJTjXTtVikNALK2uI="
     },
     {
@@ -1917,8 +1917,8 @@
           }
         }
       },
-      "bytecode": "H4sIAAAAAAAA/9WWPW/TQBjHnaS8tuU9FIKEOsCK1FBVrCWmKBWoUtuwMFhHfISTzmdzvqCaiRsRi51SsdPUVCrdGPgA8BWQivoZ2FiYOMuJcVw9tUxZuMnn3z3/53++0/O40gve7U0bBnopcNtg3CBMYM4QdQ3D9VjbcAUSWAvkzl1OKCWdBqL0reb7677/ZVo7fJR8NYJevv6+dl1uNWzminUZ6oTjtijLD021tIP5Zut2PT9VNr5UKP6Vno3XiuXXZT/6MsF4orO9jCkS5AUu5kTTDiqUiyp8jLyYSKCG7XjJlvS0p5R47HzyyM71f+C8vyJsJ+gBTjNn1NhaIJiaubIT4TIWXc4GO63KnQWbY9Jh0XRj70ZXEEqEN++6mIuGbTkq3ROKlzhqU/wIc5fYTF1kufsQWzb35k2TY9dNXAQyXCGWQ3FsZ1T980D8Phat+EntQeA1sa9NZQVTm4ZIGSQVkIyB5BhIjoPkBEhOguQUSE6DZBwkEyCZBMkZkJwFyTmQnAfJBZBcBMklkFRBchkkU9HFGr2Q/9lspGbkLpmbLaTZb83U7xz+Nt+p7x8sdVcSsfetmb+p8lcLCZRURyYMcU/FLDkbf2Rq4b3nXdVflUjaXCpNuNi1nObTVJGtVQel8Vq2xI4VKuBresbVQKWy/UDd0dVniMVHOmyxSZLE0jCgJnebzIzrK9jX52ZhQ9+//vz2abFuyf4qR1FHSeKHPxjDpnDERDd/3Xqz+frxj9xEvwH//GOTawkAAA==",
-      "debug_symbols": "fZLRqoQgEIbfxWsvHC2tXmVZwsoWQSzcOnCI3v2MbW11oG78Hcf/0xlmIo2pxldpfdu9SfGYSBWsc/ZVuq7Wg+08nk6ExQUSUghKICWFRJGkUCjqI9lH8kU43lfzTMkGKYdgTGQcqPhWr4PxAyn86BwlP9qNy6V3r/2igw6YZZQY36AisLXOxN1Mdze7tgIwsboBJHwBAOKEgGtElm+EXKQ7IIcTgN/8gQHf/sCkukTclJGlWw+yTF0WkVwDEi5XQJLsAHX2p9d+kajVL9ShCf8ANxVwwWAl4FZ+ESn24ImRrm04jdwcWcHqypk1bEdfH7LDb79ltpHtQ1ebZgwmkg5zi+uDA+XyiRMKMVCU5885Pv0H"
+      "bytecode": "H4sIAAAAAAAA/9WWv2/TQBTHnaT8LOV3WggS6oLYkBqqihViKqUCVWobFgbriI9w0vlszhdUM3EjYrFTKnaamkqlGxsr/AtIRf0b2FiYOMuJ67h6tUxZ6u38ufd93/M9vedKL/iwO20Y6LXAbYNxgzCBOUPUNQzXY23DFUhgLZDbDzihlHQaiNL3mu+v+f63ae3wp+SrJ+jl6+9pN+Vmw2auWJOhTjhui7L81FRbO5hvtO7W81Nl40uF4t/o2XitWH5d9qMvE4wnOltLmCJBXuFiTjTtoEK5qMLnyIuJBGrYjpccSU97SonHzieO7Fz/D877y8J2gh7gNHNHjc15gqmZKzsZLmHR5Wxw0qrcnrc5Jh0WLdd3b8fF2RXUQK6LuWjYlqMyPqN4kaM2xU8wd4nNVC3LncfYsrl33zQ5dt3ESCDDZWI5FMeORhN83dfvYNEShBLhqZMIvCr2tKmsZuroECmDpAKSMZCcAMlJkJwCyWmQnAHJWZCMg+QcSCZAch4kF0ByESSXQHIZJFdAchUkVZBMgmQqKqzRmjxmq5HOkbtlbraQZr81U793+Nt8p75/sOFdS8Q+tmb+pddfLyRQUnOZMMQ9FbPorO/L1MKHL7tqyiqRtLlUmnChaznN56lWW6sOGuSNbKMdK9TGV/WMq4FKZeuRqtGVF4jFVzoctEmSxNIwoCZ3msyMWyw43edmYUM/v//+8WWhbsn+CkfRXEnih78Zw9FwxES3/tx5t/H26a/cRH8B7dCKhnEJAAA=",
+      "debug_symbols": "jZJBjoQgEEXvwpoFhQrqVTrGoGKHhKChdZKJ4e4Dtti6oDMbPmVRj/pSGxpktz5bZcbpherHhjqrtFbPVk+9WNRk/NcNkbBAjuoMIyhQzbwwVHMv/C3lW6pdqD/PncMoQtrFShkYF6q/axZWmgXVZtUaox+h1/3QaxZm10VYnyUYSTN49cBRaRl2Dn+qSboUGORHNTBOTwBAdUNAGlFW7CBUWXkCKLn3QL/0QKCIPRBOkogvNqrydEEoJF3kaUJOo4s85yeAZ7f6Il2fFfEVMv75C1D+2wLNCBwEv2UnogDnGh+JXtnbzLnAskp0Wh7huJr+kl1+55iJMzvbqZfDamUgXQbXrw8KmLLGjyiEgGNaNS5c/Qc="
     },
     {
       "name": "verify_private_authwit",
@@ -3718,12 +3718,12 @@
           }
         }
       },
-      "bytecode": "H4sIAAAAAAAA/+2cd3xURfv2c19DRyx0FDQCIiogxV4pAUWlCGLHGMICKyGJmw3FSuwNSQIICNIJTRR779jnEruCWLD33ut7IJAq5ixwPa+f5/fwD2F35ntPn3NmwtcVFkxd3S41Ne2ceCQ9NTOWGs2MR2KZaRk5qamjI7HosHGp2bHo6LR4JDUtNz5iTDROt2ytm5u3ontGWvrI7llje+VmpvdIy8jIWzigW9+jehbmLTopGs+M5OQgOUQiZyES7RSG1KBriESN/fgQqZqEStU8TKlahEm0a5hEu4VJlByq5LuHStUyVKpWoVK1Ts5b1j0WzciIDl///eSk/PxJ+fkrk5P++Y/lLe2WkxOJxU+NxLIm5RcUrkzuOLRvbF2nOXvd3b/nnXl5Jw9u2+Xjo8fdk13QY90Pk74OstBd88/YV9q/N3JLsBOqLG3SlmCv3SwWJdjK7Xt7/6ycSHRoVmbn/pHYqNx4WjyalVk4uaS9g1Yo+XmPMp9OKPPztZPpJtLl0xXQFZYve2Fh1X3TOlT9JoXo5KrHT8BJTryEDUKVcHIVIDt+fKgSTu5afoxbQV7RwGjm8IxI8VioqrRh2ippA3NUdkaEbkq4GRSm6FOsfNGduOjXJT75CyaFKkbADlfgqVUPjS2LPzU/wYUiHHlKQJ4UajxPCZVqaqhU07agl0KUcGNdQtQ6XF+Gqst0Sb8EPT4l3Ep//ZZsIFUVwIUYxuWmNgrzFnaLxdLGFVQ5B49aw5zSdSBI3PKi5Qvmvrvm8qvXfbki6aXrZs8edErHXmMnNmzxzj1nDmn73pKQe/p/dJWcse1WyRlbsiJNDzo+3PiYGWJ8bOUqPTOhprtBtUrPDNjhCjxLskoH8WflJ9ra1QpLWjvcKrep56suzz8X2jaUpew8rCpxYWkfzi79cc62mwmzwyWbk7wFm8P6Zgu3OVSxHRZ+vSHV7FCTb06ILkh8oM1aHz5U/HClnCuZjjMCcLglap5qC50WLv78LYhfNTV8/RdI2j/8FrFwKxat/HADMdzUm69bsYpKf1y07VasonDJFlV4y5y8Ldss1HJVFCriIslyFUyEonDvGDNCpQpXl8WSd4xNdQlR61CpwtVlSYILVGGofpkXDJ5QCecHS1S4lWSppKDBSj4vVMIFwVoWrqDLEn1rKgzVneFekmdsSfCqsEkhCthGEdhCBN5TERghArdVvB3vleDrQ6jBs3eooTNRUZ99VibXWzfnuSP7Pj6vXeZJNcYvf+SBK96a2LRL13Xnt7HDukx4rfnJifdOtRCB2ymGRfUQgdsrAtcIEbiDInDNEIH3VQSuFSJwR0Xg2iECd1IErhMicGdF4LohAndRBN4uROD9FIHrhQi8vyLw9iECH6AIvEOIwAcqAu8YIvBBisA7hQh8sCJw/RCBD1EEbhAi8KGKwA1DBD5MEbhRiMCHKwI3DhH4CEXgJiECH6kI3DRE4K6KwM1CBO6mCLxziMDdFYF3CRG4hyJw8xCBUxSBW4QI3FMReNcQgXspAu8WIvBRisDJIQIfrQi8e4jAvRWBW4YIfIwicKsQgY9VvHQfp4D2URxr9d0mv++UtCW90zpE8fop6tw/3An9Fhx3hqAGh9ehEi4JDlzDjIrjJcVcmEAxl4Up5gDFjBiogJ6ggA5SQE9UQE9SQE9WQE9RQE9VQE9TQE9XQAcroGcooKkK6JkKaJoCOkQBTVdAhyqgEQV0mAI6XAEdoYBGFdCzFNCRCmiGAjpKAc1UQLMU0GwF9GwFNKaA5iigcQU0VwEdrYCOUUDHKqDjFNBzFNBzFdDzFNDzFdALFNALFVA/XkLNk1AvklAvllAvkVAvlVAvk1Avl1CvkFCvlFCvklCvllCvkVAnSKjXSqiSX5bz+RJqgYRaKKFOklAnS6hTJNTrJNSpEuo0CXW6hCr5z6x+hoQ6U0K9QUKdJaHOllDnSKhzJdR5Eup8CXWBhLpQQi2SUBdJqIsl1CUS6lIJdZmEeqOEulxCvUlCvVlCXSGh3iKh3iqh3iah3i6h3iGh3imh3iWh3i2h3iOh3iuh3ieh3i+hPiChPiihPiShPiyhPiKhPiqhPiahrpRQH5dQn5BQn5RQn5JQn5ZQn5FQn5VQvYRKCfU5CXWVhPq8hPqChPqihPqShPqyhPqKhPqqhPqahPq6hLpaQl0job4hoa6VUN+UUN+SUN+WUN+RUNdJqO9KqO9JqO9LqB9IqB9KqB9JqB9LqJ9IqJ9KqJ9JqJ9LqF9IqF9KqF9JqF9LqN9IqN9KqN9JqN9LqD9IqD9KqD9JqD9LqL9IqL9KqL9JqL9LqH9IqH9KqH8pqLQkDdY0WGiwToOtpsFW12BraLA1NdhaGmxtDbaOBltXg91Og62nwW6vwe6gwe6owe6kwdbXYBtosA012EYabGMNtokG21SDbabB7qzB7qLBNtdgW2iwu2qwu2mwyRrs7hpsSw22lQbbWoPdQ4Nto8HuqcG21WD30mD31mD30WDbabDtNdgOGuy+GmxHDbaTBttZg+2iwe6nwe6vwR6gwR6owR6kwR6swR6iwR6qwR6mwR6uwR6hwR6pwXbVYLtpsN012B4abIoG21OD7aXBHqXBHq3B9tZgj9Fgj9Vgj9Ng+2iwfTXYfhpsfw32eA12gAY7UIM9QYMdpMGeqMGepMGerMGeosGeqsGepsGersEO1mDP0GBTNdgzNdg0DXaIBpuuwQ7VYCMa7DANdrgGO0KDjWqwZ2mwIzXYDA12lAabqcFmabDZGuzZGmxMg83RYOMabK4GO1qDHaPBjtVgx2mw52iw52qw52mw52uwF2iwF2qw4zXYPA32Ig32Yg32Eg32Ug32Mg32cg32Cg32Sg32Kg32ag32Gg12ggZ7rQY7UYPN12ALNNhCDXaSBjtZg52iwV6nwU7VYKdpsNM12Os12Bka7EwN9gYNdpYGO1uDnaPBztVg52mw8zXYBRrsQg22SINdpMEu1mCXaLBLNdhlGuyNGuxyDfYmDfZmDXaFBnuLBnurBnubBnu7BnuHBnunBnuXBnu3BnuPBnuvBnufBnu/BvuABvugBvuQBvuwBvuIBvuoBvuYBrtSg31cg31Cg31Sg31Kg31ag31Gg31Wg/UaLDXY5zTYVRrs8xrsCxrsixrsSxrsyxrsKxrsqxrsaxrs6xrsag12jQb7hga7VoN9U4N9S4N9W4N9R4Ndp8G+q8G+p8G+r8F+oMF+qMF+pMF+rMF+osF+qsF+psF+rsF+ocF+qcF+pcF+rcF+o8F+q8F+p8F+r8H+oMH+qMH+pMH+rMH+osH+qsH+psH+rsH+ocH+qcFq/LfQ+G+h8d9C47+Fxn8Ljf8WGv8tNP5baPy30PhvofHfQuO/hcZ/C43/Fhr/LTT+W2j8t9D4b6Hx36K+Bqvx30Ljv4XGfwuN/xYa/y00/lto/LfQ+G+h8d9C47+Fxn8Ljf8WGv8tNP5baPy30PhvofHfQuO/hcZ/C43/Fhr/LTT+W2j8t9D4b6Hx30Ljv4XGfwuN/xYa/y00/lto/LforMFq/LfQ+G+h8d9C47+Fxn8Ljf8WGv8tNP5baPy30PhvofHfQuO/hcZ/C43/Fhr/LTT+W2j8t9D4b6Hx30Ljv4XGfwuN/xYa/y00/lto/LfQ+G+h8d9C47+Fxn8Ljf8WGv8tBmiwGv8tNP5baPy30PhvofHfQuO/hcZ/C43/Fhr/LTT+W2j8t9D4b6Hx30Ljv4XGfwuN/xYa/y00/lto/LfQ+G+h8d9C47+Fxn8Ljf8WGv8tNP5baPy30PhvofHfQuO/hcZ/i5gGq/HfQuO/hcZ/C43/Fhr/LTT+W2j8t9D4b6Hx30Ljv4XGfwuN/xYa/y00/lto/LfQ+G+h8d9C47+Fxn8Ljf8WGv8tNP5baPy30PhvofHfQuO/hcZ/C43/Fhr/LTT+W2j8tyjUYDX+W2j8t9D4b6Hx30Ljv4XGfwuN/xYa/y00/lto/LfQ+G+h8d9C47+Fxn8Ljf8WGv8tNP5baPy30PhvofHfQuO/hcZ/C43/Fhr/LTT+W2j8t9D4b6Hx30Ljv4XGfwuN/xa3arAa/y00/lto/LfQ+G+h8d9C47+Fxn8Ljf8WGv8tNP5baPy30PhvofHfQuO/hcZ/C43/Fhr/LTT+W2j8t9D4b6Hx30Ljv4XGfwuN/xYa/y00/lto/LfQ+G+h8d9C47+Fxn+LFzVYjf8WGv8tNP5baPy30PhvofHfQuO/hcZ/C43/Fhr/LTT+W2j8t9D4b6Hx30Ljv4XGfwuN/xYa/y00/lto/LfQ+G+h8d9C47+Fxn8Ljf8WGv8tNP5baPy30PhvofHfQuO/xbcarMZ/C43/Fhr/LTT+W2j8t9D4b6Hx30Ljv4XGfwuN/xYa/y00/lto/LdO4791Gv+t0/hvncZ/6zT+W6fx3zqN/9Zp/LdO4791Gv+t0/hvncZ/6zT+W6fx3zqN/9Zp/LdO4791Gv+tq6/Bavy3TuO/dRr/rdP4b53Gf+s0/lun8d86jf/Wafy3TuO/dRr/rdP4b53Gf+s0/lun8d86jf/Wafy3TuO/dRr/rdP4b53Gf+s0/lun8d86jf/Wafy3TuO/dRr/rdP4b53Gf+s0/lun8d+6zhqsxn/rNP5bp/HfOo3/1mn8t07jv3Ua/63T+G+dxn/rNP5bp/HfOo3/1mn8t07jv3Ua/63T+G+dxn/rNP5bp/HfOo3/1mn8t07jv3Ua/63T+G+dxn/rNP5bp/HfOo3/1mn8t07jv3Ua/60boMFq/LdO4791Gv+t0/hvncZ/6zT+W6fx3zqN/9Zp/LdO4791Gv+t0/hvncZ/6zT+W6fx3zqN/9Zp/LdO4791Gv+t0/hvncZ/6zT+W6fx3zqN/9Zp/LdO4791Gv+t0/hvncZ/6zT+W6fx37qYBqvx3zqN/9Zp/LdO4791Gv+t0/hvncZ/6zT+W6fx3zqN/9Zp/LdO4791Gv+t0/hvncZ/6zT+W6fx3zqN/9Zp/LdO4791Gv+t0/hvncZ/6zT+WxfKf9snMiorNq53ZjQ+yda6YW32bLvX3vu0a99h346dOnfZb/8DDjzo4EMOPezwI47s2q17j5SevY46uvcxxx7Xp2+//scPGHjCoBNPOvmUU087ffAZqWemDUkfGhk2fET0rJEZozKzss+O5cRzR48ZO+6cc887/4IL/Xif5y/yF/tL/KX+Mn+5v8Jf6a/yV/tr/AR/rZ/o832BL/ST/GQ/xV/np/ppfrq/3s/wM/0Nfpaf7ef4uX6en+8X+IW+yC/yi/0Sv9Qv8zf65f4mf7Nf4W/xt/rb/O3+Dn+nv8vf7e/x9/r7/P3+Af+gf8g/7B/xj/rH/Er/uH/CP+mf8k/7Z/yz3nv65/wq/7x/wb/oX/Iv+1f8q/41/7pf7df4N/xa/6Z/y7/t3/Hr/Lv+Pf++/8B/6D/yH/tP/Kf+M/+5/8J/6b/yX/tv/Lf+O/+9/8H/6H/yP/tf/K/+N/+7/8P/6f+iJdGMBpqjVaNVp9Wg1aTVotWm1aHVpW1Hq0fbnrYDbUfaTrT6tAa0hrRGtMa0JrSmtGa0nWm70JrTWtB2pe1GS6btTmtJa0VrTduD1oa2J60tbS/a3rR9aO1o7WkdaPvSOtI60TrTutD2o+1PO4B2IO0g2sG0Q2iH0g6jHU47gnYkrSutG607rQcthdaT1ot2FO1oWm/aMbRjacfR+tD60vrR+tOOpw2gDaSdQBtEO5F2Eu1k2im0U2mn0U6nDaadQUulnUlLow2hpdOG0iK0YbThtBG0KO0s2khaBm0ULZOWRcumnU2L0XJocVoubTRtDG0sbRztHNq5tPNo59MuoF1IG0/Lo11Eu5h2Ce1S2mW0y2lX0K6kXUW7mnYNbQLtWtpEWj6tgFZIm0SbTJtCu442lTaNNp12PW0GbSbtBtos2mzaHNpc2jzafNoC2kJaEW0RbTFtCW0pbRntRtpy2k20m2kraLfQbqXdRruddgftTtpdtLtp99Dupd1Hu5/2AO1B2kO0h2mP0B6lPUZbSXuc9gTtSdpTtKdpz9CepXkaac/RVtGep71Ae5H2Eu1l2iu0V2mv0V6nraatob1BW0t7k/YW7W3aO7R1tHdp79Hep31A+5D2Ee1j2ie0T2mf0T6nfUH7kvYV7WvaN7Rvad/Rvqf9QPuR9hPtZ9ovtF9pv9F+p/1B+5P2F5FEGAHCEdWI6kQNoiZRi6hN1CHqEtsR9YjtiR2IHYmdiPpEA6Ih0YhoTDQhmhLNiJ2JXYjmRAtiV2I3IpnYnWhJtCJaE3sQbYg9ibbEXsTexD5EO6I90YHYl+hIdCI6E12I/Yj9iQOIA4mDiIOJQ4hDicOIw4kjiCOJrkQ3ojvRg0ghehK9iKOIo4nexDHEscRxRB+iL9GP6E8cTwwgBhInEIOIE4mTiJOJU4hTidOI04nBxBlEKnEmkUYMIdKJoUSEGEYMJ0YQUeIsYiSRQYwiMoksIps4m4gROUScyCVGE2OIscQ44hziXOI84nziAuJCYjyRR1xEXExcQlxKXEZcTlxBXElcRVxNXENMIK4lJhL5RAFRSEwiJhNTiOuIqcQ0YjpxPTGDmEncQMwiZhNziLnEPGI+sYBYSBQRi4jFxBJiKbGMuJFYTtxE3EysIG4hbiVuI24n7iDuJO4i7ibuIe4l7iPuJx4gHiQeIh4mHiEeJR4jVhKPE08QTxJPEU8TzxDPEp4g8RyxinieeIF4kXiJeJl4hXiVeI14nVhNrCHeINYSbxJvEW8T7xDriHeJ94j3iQ+ID4mPiI+JT4hPic+Iz4kviC+Jr4iviW+Ib4nviO+JH4gfiZ+In4lfiF+J34jfiT+IP4m/6JLogl0ZdI6uGl11uhp0Nelq0dWmq0NXl247unp029PtQLcj3U509eka0DWka0TXmK4JXVO6ZnQ70+1C15yuBd2udLvRJdPtTteSrhVda7o96NrQ7UnXlm4vur3p9qFrR9eergPdvnQd6TrRdabrQrcf3f50B9AdSHcQ3cF0h9AdSncY3eF0R9AdSdeVrhtdd7oedCl0PYNL/eACPrgsDy62g0vo4MI4uNwNLmKDS9PggjO4jAwuDoNLvuBCLrg8Cy66gkup4AIpuOwJLmaCS5TgwiO4nAguEoJD/+CAPjhMDw6+g0Pq4EA5OPwNDmqDQ9XgADQ4rAwOFoNDwODALjhcCw7CgkOr4IApOAwKDm6CQ5bgQCQ4vAgOGoJDgeAFPnjZDl6Mg5fY4IUzeDkMXuSCl67gBSl4mQlePIKXhOCBPnj4Dh6Ug4fa4AE0eFgMHuyCh7DggWnpgEg8N5aZkhZPW5vUJsngqlWvUbNW7Tp1t6u3/Q477lS/QcNGjZs0bbbzLs1b7Lpb8u4tW7XeIz9/cmHegm7p0VijwlXP1/zs+2efGJ6fv/GjJpU/Si5c9XqzRq2an/76E5s+Orhw1bJGDw9OafXX6WuT0vOW9hybHYvk5ESzMiflV23E759ohhGJZkhLNENOohkiiWZITjRD+r+vlTITzTD839esQ+VFissjpP/7ijRU3nFZ8tGacJGGJZohV14H/dCI/hd03Bh5pePy1TvhSmf/b9v9V2y7+uV+ZKIZOsibtbd8bU3+903RqHw+JP8XFCnh+TBWvvL9n3wiayfv6Vz54NPvD60SzXCafBfNkGdI+BEu4Qes1P89zSha6X+HCGEyDE40Q9KUwtVt0zbcb6amZ43KTotHh2REUrNiaenBX6MjsfWg1DGxtOzsSGxtUuO8hT2yMnPik/KKUqKxSHoceYt6Z8YjwyOx+YO6dK76arRifkso//iUivmTEoufkregR1pGRkHdEs7iAZGMoNKjI4mVJLi/rURAooQb15dlaHDi2SMre1xJlVLKlqkMvLjk9ba65CnboOQLBsazsgsKN1PSCn3UY2GvaCSj6t8p3q6o+Ax4Y013zFvWKysWiQ7PXP/PKatb58ajGdH4uOLb+B4lg7XfhrF6YvFQzc8vyFtefLHebejQ9ROhpBQFeUUDo6OyMyLFxdkUrEJhqyXUFGNT8pZ1j2amrb/Gj/fLnrKJ4hYfF4Q+YURa5npK6WAtCVJ0TO6o7N7DCksyNMpb3jtzaHFJNztDDviH/+i95vEfXr39mM6j8hacEMzWgsLS/Jum6sYaF67uGM1JzYkOjaRGhg0Lvggmfm4QIZYaiwQTvtwCUDLxm/1/nvi9tnLi99o4qLbf6sFvlQlum098lIUHJS9T8ZTSH8pGzZvfJ2t0uQlZkqy45jtsTLHx455lk25tm/Tc6jaxyktK2TYovzI0qLgyZMeio9Pikd45A4NR3XPDoO5RPKYHlAzpSutCaaCSlaGkzPMGddp8equc/u97oDTCtllsem2rxabpf3Cx2TMnHvRVajQzNTI2kh6s4cHzRHpa+ojKa0yH/5I1pulWzwZUJlTb5muMKwsXPFRUS7T3KswfV9qNldjVE23Pv504Nj+Y22XnjJWNUHGKbPnSVj54aYiS8JXrjPKrtSvbMeW+qVa2yOW+qV62K4pHZrN/WKNcxe9QulUU52691aOkl/rRc9M6+7fdXbNid7vSpirXcrVKE5T7vHZpo/9tgDpFPc/OTcvIKRujhFWz0jJcp1XeguOy0oaWfFCjNNPCgetXzcqRa/x95FoVq1ardCD9bYbaFTPULs2wYH05C5qX33Pbbm4Uu8qj2MoEL7tR379xn95Qt96ZPTftBz3Wbwfrf0tjydGRtOxusVjauLLrgG1+5y7MW1icvMLDvSme9bfZ9tv+P7f9rigOE7RVsAOvfxSaXrERGm3lJttw22xMSaXlKQFXfBwI+R6ZlLe8uJ82JO+XPbmk4TfOz0oxUbmPalV6mAgZ3TYXPWl+SnR0pZ4qXdBKqr2pIQrvLdt5G5o49ezcrHg0khmfVrF4dbb0CWNj/rrbuBvrlII30x5YujFgmWZJKm2fzeSy+X1yM8r0W5XJB+YO+Rt6uXW9zDio0Bl1S6rz/wDGtQYXjHMBAA==",
-      "debug_symbols": "rZfbbuIwEIbfJde58Bx84lUqVKU0rZAiQClUWlW8+46J7YRd2eLQG36cxF/smfEf+6d5799On6/b3cf+q1m9/DRv43YYtp+vw37THbf7nVz9aVT4AW5WdG4buDRMs0JpYGiQbVbQNuREznIx9X09jn0fHljA5BWHbux3x2a1Ow1D23x3w+ny0Neh21302I1yV7VNv3sXFeDHdujDv3M791blrtpA7GyUyd3B8q0A9JYigRTiAoG3IkABRgQoY2eEh1sR1lIKgrXOzQi4RnAZ4Xyahyf9yBgQnYsEJKLiGEwFASYjEOdIuOt82jLBg+M0DUTIBGJ3hXC1QGBKh/PGFxG+jCCdCOTnWaD2VwCoBJOMyWVlLDzG8AR5GIuJ/MfAMoOt15HBjhblfc8wvMrD8K44jFppkUmjQAZfLC3QtVVGoPIyI55Xu1V3QDTYDNGLlWZvtxyV60srzeXJuJrrEKbcyn9XnkwVwkQZohfOcxfEOMwQy49EhDzP68WV01vzUJPtC+wiqGToCoFUZhjklFuDZp4Iw/VMsOKihiF/UBipzNC1ak91ihoXhJuDYYxN8TRWqWI8sWKkqB36PAxnuJRXdE/7OfrnDZ3U844e7PI5Syd83tLrWfHAOSve6lJWiKvfhWTp/NCeR2OeiRbjKNYXmV9wsDqEKYfDywfqMYhWvLDBh0dyk5fWIc97qcb564KLSr3DSy1z3kyy/seO19LsNtvxetcPWl7XXrb6IGEAG9VF9ZOiCk4tClEx1J0oReWwsxDVUcPRQaoEbVQX1U/9SU1tgqgYjEaUwoIVDecQ4ZKOKjwSRwqnkIu6qH5SVmF1iEJUjEpRhRdiw3ryPTZRbVQ3jYt98Ou20SoqRMWoND2nOaqOGnlaeBys/7sbt93b0IcghzycdpsUc2ke/xzSnXQWO4z7Tf9+GvuQn8WBTH5f5A0I63wsu1zyLfI6H87kinyYSK/b6bbMlfX6HLL+Fw==",
+      "bytecode": "H4sIAAAAAAAA/+2cd3xURfv2c19DRyx0FDQCIiogxV4pAUGlCGLHGMICKyGJmw3FSuwNSQIICNIJTRS72Av2ucSuIBbsvff6HgwkIQFzFrie18/ze/iHZTPzvaefOTPh6woLpqxuk5qadm48kp6aGUuNZsYjscy0jJzU1FGRWHTo2NTsWHRUWjySmpYbHz46GqdbutbNyVveNSMtfUTXrDE9cjPTu6VlZOQt6N+lzzHdC/MWnhyNZ0ZycpAcIpGzEIl2CUOq1zlEooZ+XIhUjUKlahqmVM3CJNo9TKI9wiRKDlXyPUOlah4qVYtQqVom5y3tGotmZESHrf/5pKT8/In5+SuTk/75j+Ut6ZKTE4nFT4vEsibmFxSuTG4/pE9sXYfZ+9zTr/tdeXmnDGrd6eOeY1dkF3Rb98PEr4MsdNf+M/aVtu+N2Brs+EpLm7Q12Ou2iEUJtmL73tEvKycSHZKV2bFfJDYyN54Wj2ZlFk4qae+gFUo+71Xm2/FlPl83iW4CXT5dAV3hpmUvLKy8b1qGqt/EEJ1c+fgJOMmJl7BeqBJOqgRkJ4wLVcJJnTcd41aQVzQgmjksI1I8FiorbZi2SvqbOTI7I0I3OdwMClP0ybZp0Z246NcnPvkLJoYqRsAOV+AplQ+NrYs/JT/BhSIceXJAnhhqPE8OlWpKqFRTt6KXQpRwQ11C1DpcX4aqyzRJvwQ9PjncSn/D1jxAKiuACzGMN5naKMxb0CUWSxtbUOkcPGYNc0rXgSBx84uXzZ/z7porrln35fKkl66fNWvgqe17jJlQv9k7K84a3Pq9xSGf6f/RVXL69lslp2/NijQt6Phw42NGiPGxjav0jISa7kbVKj0jYIcr8EzJKh3En5mfaGtXKSxp7XCr3Maer7w8/1xo+7ssZedhZYkLS/twVunH2dtvJswKl2x28lY8HNY3W7iHQyWPw8Kv/041K9Tkmx2iCxIfaDPXhw8VP1wp50im4/QAHG6Jmqt6hE4NF3/eVsSvnBq+/vMl7R/+EbFgGxat/HADMdzUm6dbsYpKPy7cfitWUbhkC8u9ZU7anm0WarkqChVxoWS5CiZCUbh3jOmhUoWryyLJO8bGuoSodahU4eqyOMEFqjBUv8wNBk+ohPOCJSrcSrJEUtBgJZ8bKuH8YC0LV9Clib41FYbqznAvydO3Jnhl2KQQBWylCGwhAu+tCIwQgVsr3o73SfD1IdTg2TfU0JmgqM9+K5PrrJv93NF9Hp/bJvPkauOWPfLAlW9NaNyp87oLWtkRnca/1vSUxHunSojAbRTDomqIwG0VgauFCNxOEbh6iMD7KwLXCBG4vSJwzRCBOygC1woRuKMicO0QgTspAu8QIvABisB1QgQ+UBF4xxCBD1IE3ilE4IMVgXcOEfgQReBdQgQ+VBG4bojAhykC1wsR+HBF4PohAh+hCNwgROAjFYEbhgh8lCJwoxCBj1YEbhwicGdF4CYhAndRBN41ROCuisC7hQjcTRG4aYjAKYrAzUIE7q4IvHuIwD0UgfcIEfgYReDkEIF7KgLvGSJwL0Xg5iECH6sI3CJE4OMUL93HK6C9FcdafbbL7zslbU3vtAxRvL6KOvcLd0K/FcedIajB4XWohIuDA9cwo+IESTEXJFDMpWGK2V8xIwYooCcqoAMV0JMU0JMV0FMU0FMV0NMU0NMV0DMU0EEK6JkKaKoCepYCmqaADlZA0xXQIQpoRAEdqoAOU0CHK6BRBfRsBXSEApqhgI5UQDMV0CwFNFsBPUcBjSmgOQpoXAHNVUBHKaCjFdAxCuhYBfRcBfQ8BfR8BfQCBfRCBfQiBdSPk1DzJNSLJdRLJNRLJdTLJNTLJdQrJNQrJdSrJNSrJdRrJNRrJdTxEup1Eqrkl+V8voRaIKEWSqgTJdRJEupkCfV6CXWKhDpVQp0moUr+M6ufLqHOkFBvlFBnSqizJNTZEuocCXWuhDpPQp0voS6QUIsk1IUS6iIJdbGEukRCXSqh3iShLpNQb5ZQb5FQl0uot0qot0mot0uod0iod0qod0mod0uo90ioKyTUeyXU+yTU+yXUByTUByXUhyTUhyXURyTURyXUxyTUlRLq4xLqExLqkxLqUxLq0xLqMxLqsxKql1ApoT4noa6SUJ+XUF+QUF+UUF+SUF+WUF+RUF+VUF+TUF+XUFdLqGsk1Dck1LUS6psS6lsS6tsS6jsS6joJ9V0J9T0J9X0J9QMJ9UMJ9SMJ9WMJ9RMJ9VMJ9TMJ9XMJ9QsJ9UsJ9SsJ9WsJ9RsJ9VsJ9TsJ9XsJ9QcJ9UcJ9ScJ9WcJ9RcJ9VcJ9TcJ9XcJ9Q8J9U8J9S8FlZakwZoGCw3WabBVNNiqGmw1Dba6BltDg62pwdbSYGtrsDtosHU02B012J002J012F002LoabD0Ntr4G20CDbajBNtJgG2uwTTTYXTXY3TTYphpsMw12dw12Dw02WYPdU4NtrsG20GBbarB7abCtNNi9NdjWGuw+Guy+Gux+GmwbDbatBttOg91fg22vwXbQYDtqsJ002AM02AM12IM02IM12EM02EM12MM02MM12CM02CM12KM02KM12M4abBcNtqsG202DTdFgu2uwPTTYYzTYnhpsLw32WA32OA32eA22twbbR4Ptq8H202BP0GD7a7ADNNgTNdiBGuxJGuzJGuwpGuypGuxpGuzpGuwZGuwgDfZMDTZVgz1Lg03TYAdrsOka7BANNqLBDtVgh2mwwzXYqAZ7tgY7QoPN0GBHarCZGmyWBputwZ6jwcY02BwNNq7B5mqwozTY0RrsGA12rAZ7rgZ7ngZ7vgZ7gQZ7oQZ7kQY7ToPN02Av1mAv0WAv1WAv02Av12Cv0GCv1GCv0mCv1mCv0WCv1WDHa7DXabATNNh8DbZAgy3UYCdqsJM02Mka7PUa7BQNdqoGO02DvUGDna7BztBgb9RgZ2qwszTY2RrsHA12rgY7T4Odr8Eu0GCLNNiFGuwiDXaxBrtEg12qwd6kwS7TYG/WYG/RYJdrsLdqsLdpsLdrsHdosHdqsHdpsHdrsPdosCs02Hs12Ps02Ps12Ac02Ac12Ic02Ic12Ec02Ec12Mc02JUa7OMa7BMa7JMa7FMa7NMa7DMa7LMarNdgqcE+p8Gu0mCf12Bf0GBf1GBf0mBf1mBf0WBf1WBf02Bf12BXa7BrNNg3NNi1GuybGuxbGuzbGuw7Guw6DfZdDfY9DfZ9DfYDDfZDDfYjDfZjDfYTDfZTDfYzDfZzDfYLDfZLDfYrDfZrDfYbDfZbDfY7DfZ7DfYHDfZHDfYnDfZnDfYXDfZXDfY3DfZ3DfYPDfZPDVbjv4XGfwuN/xYa/y00/lto/LfQ+G+h8d9C47+Fxn8Ljf8WGv8tNP5baPy30PhvofHfQuO/hcZ/C43/FnU1WI3/Fhr/LTT+W2j8t9D4b6Hx30Ljv4XGfwuN/xYa/y00/lto/LfQ+G+h8d9C47+Fxn8Ljf8WGv8tNP5baPy30PhvofHfQuO/hcZ/C43/Fhr/LTT+W2j8t9D4b6Hx30Ljv0VHDVbjv4XGfwuN/xYa/y00/lto/LfQ+G+h8d9C47+Fxn8Ljf8WGv8tNP5baPy30PhvofHfQuO/hcZ/C43/Fhr/LTT+W2j8t9D4b6Hx30Ljv4XGfwuN/xYa/y00/lto/LfQ+G/RX4PV+G+h8d9C47+Fxn8Ljf8WGv8tNP5baPy30PhvofHfQuO/hcZ/C43/Fhr/LTT+W2j8t9D4b6Hx30Ljv4XGfwuN/xYa/y00/lto/LfQ+G+h8d9C47+Fxn8Ljf8WGv8tNP5bxDRYjf8WGv8tNP5baPy30PhvofHfQuO/hcZ/C43/Fhr/LTT+W2j8t9D4b6Hx30Ljv4XGfwuN/xYa/y00/lto/LfQ+G+h8d9C47+Fxn8Ljf8WGv8tNP5baPy30PhvofHfQuO/RaEGq/HfQuO/hcZ/C43/Fhr/LTT+W2j8t9D4b6Hx30Ljv4XGfwuN/xYa/y00/lto/LfQ+G+h8d9C47+Fxn8Ljf8WGv8tNP5baPy30PhvofHfQuO/hcZ/C43/Fhr/LTT+W2j8t7hNg9X4b6Hx30Ljv4XGfwuN/xYa/y00/lto/LfQ+G+h8d9C47+Fxn8Ljf8WGv8tNP5baPy30PhvofHfQuO/hcZ/C43/Fhr/LTT+W2j8t9D4b6Hx30Ljv4XGfwuN/xYa/y00/lu8qMFq/LfQ+G+h8d9C47+Fxn8Ljf8WGv8tNP5baPy30PhvofHfQuO/hcZ/C43/Fhr/LTT+W2j8t9D4b6Hx30Ljv4XGfwuN/xYa/y00/lto/LfQ+G+h8d9C47+Fxn8Ljf8WGv8tvtVgNf5baPy30PhvofHfQuO/hcZ/C43/Fhr/LTT+W2j8t9D4b6Hx30Ljv3Ua/63T+G+dxn/rNP5bp/HfOo3/1mn8t07jv3Ua/63T+G+dxn/rNP5bp/HfOo3/1mn8t07jv3Ua/63T+G9dXQ1W4791Gv+t0/hvncZ/6zT+W6fx3zqN/9Zp/LdO4791Gv+t0/hvncZ/6zT+W6fx3zqN/9Zp/LdO4791Gv+t0/hvncZ/6zT+W6fx3zqN/9Zp/LdO4791Gv+t0/hvncZ/6zT+W6fx3zqN/9Z11GA1/lun8d86jf/Wafy3TuO/dRr/rdP4b53Gf+s0/lun8d86jf/Wafy3TuO/dRr/rdP4b53Gf+s0/lun8d86jf/Wafy3TuO/dRr/rdP4b53Gf+s0/lun8d86jf/Wafy3TuO/dRr/rdP4b11/DVbjv3Ua/63T+G+dxn/rNP5bp/HfOo3/1mn8t07jv3Ua/63T+G+dxn/rNP5bp/HfOo3/1mn8t07jv3Ua/63T+G+dxn/rNP5bp/HfOo3/1mn8t07jv3Ua/63T+G+dxn/rNP5bp/HfOo3/1sU0WI3/1mn8t07jv3Ua/63T+G+dxn/rNP5bp/HfOo3/1mn8t07jv3Ua/63T+G+dxn/rNP5bp/HfOo3/1mn8t07jv3Ua/63T+G+dxn/rNP5bp/HfulD+296RkVmxsb0yo/GJttYNbbV363323a9N23b7t+/QsdMBBx508CGHHnb4EUcedXTnLl27pXTvcUzPXsced3zvPn37ndB/wIkDTzr5lFNPO/2MQWemnpU2OH1IZOiw4dGzR2SMzMzKPieWE88dNXrM2HPPO/+CCy/y43yev9hf4i/1l/nL/RX+Sn+Vv9pf46/14/11foLP9wW+0E/0k/xkf72f4qf6af4GP93P8Df6mX6Wn+3n+Ll+np/vF/giv9Av8ov9Er/U3+SX+Zv9LX65v9Xf5m/3d/g7/V3+bn+PX+Hv9ff5+/0D/kH/kH/YP+If9Y/5lf5x/4R/0j/ln/bP+Ge99/TP+VX+ef+Cf9G/5F/2r/hX/Wv+db/ar/Fv+LX+Tf+Wf9u/49f5d/17/n3/gf/Qf+Q/9p/4T/1n/nP/hf/Sf+W/9t/4b/13/nv/g//R/+R/9r/4X/1v/nf/h//T/0VLohkNNEerQqtKq0arTqtBq0mrRatN24FWh7YjbSfazrRdaHVp9Wj1aQ1oDWmNaI1pTWi70najNaU1o+1O24OWTNuT1pzWgtaSthetFW1vWmvaPrR9afvR2tDa0trR9qe1p3WgdaR1oh1AO5B2EO1g2iG0Q2mH0Q6nHUE7knYU7WhaZ1oXWldaN1oKrTutB+0YWk9aL9qxtONox9N60/rQ+tL60U6g9acNoJ1IG0g7iXYy7RTaqbTTaKfTzqANop1JS6WdRUujDaal04bQIrShtGG04bQo7WzaCFoGbSQtk5ZFy6adQ4vRcmhxWi5tFG00bQxtLO1c2nm082kX0C6kXUQbR8ujXUy7hHYp7TLa5bQraFfSrqJdTbuGdi1tPO062gRaPq2AVkibSJtEm0y7njaFNpU2jXYDbTptBu1G2kzaLNps2hzaXNo82nzaAloRbSFtEW0xbQltKe0m2jLazbRbaMtpt9Juo91Ou4N2J+0u2t20e2graPfS7qPdT3uA9iDtIdrDtEdoj9Ieo62kPU57gvYk7Sna07RnaM/SPI2052iraM/TXqC9SHuJ9jLtFdqrtNdor9NW09bQ3qCtpb1Je4v2Nu0d2jrau7T3aO/TPqB9SPuI9jHtE9qntM9on9O+oH1J+4r2Ne0b2re072jf036g/Uj7ifYz7Rfar7TfaL/T/qD9SfuLSCKMAOGIKkRVohpRnahB1CRqEbWJHYg6xI7ETsTOxC5EXaIeUZ9oQDQkGhGNiSbErsRuRFOiGbE7sQeRTOxJNCdaEC2JvYhWxN5Ea2IfYl9iP6IN0ZZoR+xPtCc6EB2JTsQBxIHEQcTBxCHEocRhxOHEEcSRxFHE0URnogvRlehGpBDdiR7EMURPohdxLHEccTzRm+hD9CX6EScQ/YkBxInEQOIk4mTiFOJU4jTidOIMYhBxJpFKnEWkEYOJdGIIESGGEsOI4USUOJsYQWQQI4lMIovIJs4hYkQOESdyiVHEaGIMMZY4lziPOJ+4gLiQuIgYR+QRFxOXEJcSlxGXE1cQVxJXEVcT1xDXEuOJ64gJRD5RQBQSE4lJxGTiemIKMZWYRtxATCdmEDcSM4lZxGxiDjGXmEfMJxYQRcRCYhGxmFhCLCVuIpYRNxO3EMuJW4nbiNuJO4g7ibuIu4l7iBXEvcR9xP3EA8SDxEPEw8QjxKPEY8RK4nHiCeJJ4iniaeIZ4lnCEySeI1YRzxMvEC8SLxEvE68QrxKvEa8Tq4k1xBvEWuJN4i3ibeIdYh3xLvEe8T7xAfEh8RHxMfEJ8SnxGfE58QXxJfEV8TXxDfEt8R3xPfED8SPxE/Ez8QvxK/Eb8TvxB/En8RddEl3wVAado6tCV5WuGl11uhp0Nelq0dWm24GuDt2OdDvR7Uy3C11dunp09eka0DWka0TXmK4J3a50u9E1pWtGtzvdHnTJdHvSNadrQdeSbi+6VnR707Wm24duX7r96NrQtaVrR7c/XXu6DnQd6TrRHUB3IN1BdAfTHUJ3KN1hdIfTHUF3JN1RdEfTdabrQteVrhtdCl334FI/uIAPLsuDi+3gEjq4MA4ud4OL2ODSNLjgDC4jg4vD4JIvuJALLs+Ci67gUiq4QAoue4KLmeASJbjwCC4ngouE4NA/OKAPDtODg+/gkDo4UA4Of4OD2uBQNTgADQ4rg4PF4BAwOLALDteCg7Dg0Co4YAoOg4KDm+CQJTgQCQ4vgoOG4FAgeIEPXraDF+PgJTZ44QxeDoMXueClK3hBCl5mgheP4CUh2NAHm+9goxxsaoMNaLBZDDZ2wSYs2DAt6R+J58YyU9LiaWuTWiUZXJWq1arXqFmr9g51dtxp513q1qvfoGGjxk123a1ps933SN6zeYuWe+XnTyrMm98lPRprULjq+eqfff/sE8Py8zd81ajiV8mFq15v0qBF0zNef2LjV4cWrlra4OFBKS3+OmNtUnreku5jsmORnJxoVubE/MqN+P0SzTA80QxpiWbISTRDJNEMyYlmSP/3tVJmohmG/fuadYi8SHF5hPR/X5GGyDsuSz5aEy7S0EQz5MrroB8a0f+Cjhstr3RcvnonXOns/z12/xWPXf1yPyLRDO3kzdpLvrYm//umaFQ+H5L/C4qU8HwYI1/5/k/uyNrIezpXPvj0z4cWiWY4Xf4UzZBnSHgLl/AGK/V/uxlFK/3vECFMhkGJZkiaXLi6ddrf95up6Vkjs9Pi0cEZkdSsWFp68NeoSGw9KHV0LC07OxJbm9Qwb0G3rMyc+MS8opRoLJIeR97CXpnxyLBIbN7ATh0rvxotn98Syj8upXz+pMTip+TN75aWkVFQu4SzqH8kI6j0qEhiJQnubysQkCjhpvVlGRKceHbLyh5bUqWUsmUqAy8ueZ1tLnnKdij5/AHxrOyCwi2UtFwfdVvQIxrJqPx3ihsWFZ8Bb6jpznlLe2TFItFhmev/OXn13mnnxiPpqbnxjNTiAdutZLz2/Xu4nlQ8WvPzC/KWFd+tdxkyZP1cKClIQV7RgOjI7IxIcYk2xitX3ioJtcaYlLylXaOZaetv8uN9sydvpLhFxwehTxyelrmeUjpeS4IUHZs7MrvX0MKSDA3ylvXKHFJc0i1OkoP+4f96r3n8h1fvOLbjyLz5JwYTtqCwNP/G2bqhxoWrk6M5qZExkfTc+Pr5Hc1MjUWCyV48+bOHp+VE1iY1+f8813ts41zvsWEc7bjN490qEtx2n+soCw9KXqbiKaUfykbNm9c7a9Qmc7AkWXHNd9qQYsPX3csm3dY26b7NbWIVV5GybbDpYlCv3GLQqngxyI6NSo3mdN84kHtl9i8Zxv3Wj+IKK0FpqJK1oKTUcwd22HJ6q5h+831QGmH7LC89ttfy0vg/ubzkROKpQQcMD3ooEh2ZNqxkS1GylWj3X7K8NN7miYCKhCrbfXlxZeGCLUSVRHuv3MRxpd1YgV010fbc7IyxecGkLjtZrGyE8nNj61e1TYOXhigJX7HO2HShdmU7ZpOfVClb5E1+UrVsVxSPzCb/sDi58j9D6VOiOHfLbR4lPdQbzY0L7Ga7u3r57nalTbVJy9UoTbDJ9zVLG32zAWoVdT8nNy0jp2yMElb1CutvrRZ584/PShtS8kW10kwLglrGIhUjV9t85Brlq1ajdCBtNkPN8hlqlmaYv76cBU03fdy23tIodhVHsZUJXvYZvaL0ER08DXoGD4N+G54F638hY3HPSFp2l1gsbWzZRcC2/LwuzFtQnLzcJt4Ue/rt9tBt+5976C4vDhO0VbCfX78Lmla+ERps4xO2/vZ5KiWVlqcEXH4vEPKVMSlvWXE//Z28b/akkobfMDkrxETFPqpRYScRMrptKXrSvJToqAo9VbqalVR7Y0MU3lu28/5u4tRzcrPi0UhmfGr54tXa2u3Fhvy1t3M31ioFb6E9sGRDwDLNklTaPlvIZfN652aU6bdKkw/IHbwZ+iaLeplxUK4zapdU5/8B2Ig7+3dzAQA=",
+      "debug_symbols": "rZfbbqMwEIbfhWsu7JnxYfIqq6iiKa0iIRLRpNKqyrvvGIyBXdlKk73JHw7+GHtmfvB39da+Xj9ejv376bPa/fquXodj1x0/XrrTobkcT72c/a5U+NFU7fBWV3o8sNUO5ADCAbpqp+sKvchNTs5jXy5D24YbVjB5xLkZ2v5S7fpr19XVV9Ndx5s+z00/6qUZ5Kqqq7Z/ExXg+7Frw79bvYxW+aHGcxxswaXh2ut7AZYxAhzxAmC+F6CVNpGglVumAOruSTi2M8IrwCUK7TYIyiM820hg9I/EAGhdJABpyMZgCwht/YyAVTY8bgguT2BUJk2DliDQ2A3CFxCK5oSyYpVFcB6BBiIBeZkF2O1C6MJiorVzELKs+jEGo05hWM4zIM8gx/N6ksdVUvkHYbBKYbDPhlEqLSJKpbVC/F1aoY/yXSZVmdoM3JIXp34AIfIJYhTlICXDATP3iQHP+ckUahQ82nlRwZPi7GSKEDI2Qcyq1H8Ecanj5P+qVO9fEVKYikz5vHOUPHRxYe3MkhZ0ZoMALBg5kEuvArtUGemt/UDBRS3pucgsrYz4H4YpGWlKrYEVge5/I6k0EUaTXU9wpZbz3iw9B9niAP+0nwM/b+ionnf0YJfPWTrC85Zezgq7pTgUZrsNCzVKS7d5/cgXjxEPnh3MoMrWF9r/4GBlCCUvFQdT9jGIgRXEPxzJXV5ahjzvpWZZEcnNQ17qrJujcJZpi9jLYXM4Dttvfm3kcfX4oa+lyLWL6qPypKCCU4vqqBDsWhSjUviyEDVRw8ZBmhJcVB+Vp/GopmPUUSEYjSiGhhUNuxDhookqPJTSDXuQUX1UnpRUaG9RHRWiYlQKbyhRM/ke2aguqp/iIg5+XVdGRdVRISpO9xmKaqJGnhHe6HVfzXBsXrs2LHLIw7U/zGsuh5ff5/nKvBM7D6dD+3Yd2pCf1XZMfn/JE0Dv06ZsPMU10D5tzeSMvJjQ7OvpssyVzP4Wsv4H",
       "verification_key": "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA0AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAANwAAAAAAAAAAAAAAAAAAAAdu8UuwucfDsAubufzrZZH54AAAAAAAAAAAAAAAAAAAAAACAmb4UiZsBwC/DumHyIIgAAAAAAAAAAAAAAAAAAAIhqa56Wk/8RHbUDVKiPRHRWAAAAAAAAAAAAAAAAAAAAAAASCtN+bbQQPUtHmwUAvCUAAAAAAAAAAAAAAAAAAAAv6m0oHsenzkwIxZhn+Qx+awAAAAAAAAAAAAAAAAAAAAAAAGEwZqfHAJnO+qgk7ObZAAAAAAAAAAAAAAAAAAAAX5+2ZWOKK8R2dCY1SF7G2jUAAAAAAAAAAAAAAAAAAAAAABn/nhMDV7b43K/g8GyfhAAAAAAAAAAAAAAAAAAAAB2q4jXzrGfKWp+LlkpIq9PpAAAAAAAAAAAAAAAAAAAAAAAYDldjVf3rxKmZalRir+4AAAAAAAAAAAAAAAAAAABuxGnXn5lmTGcpGFl2w3tWoAAAAAAAAAAAAAAAAAAAAAAALCdqutTaX+U9K1Z8LQXUAAAAAAAAAAAAAAAAAAAAVgQDi5uaZxn/ko7kqayi+d4AAAAAAAAAAAAAAAAAAAAAABguWxMlp4mzsco2noK+GwAAAAAAAAAAAAAAAAAAABcY0DmJ7nYC+xXHzotXpk0lAAAAAAAAAAAAAAAAAAAAAAALjn6KWa7UncvfYEeYD5MAAAAAAAAAAAAAAAAAAAAXr1ITrpTFwba7Wzf2JoGA9QAAAAAAAAAAAAAAAAAAAAAAIxNoBqz7qAywYUW/CY5JAAAAAAAAAAAAAAAAAAAAv9Qc+iADuaK9xZp57vCfPXMAAAAAAAAAAAAAAAAAAAAAAC2s8ah3iaAQAJM8iYb/LwAAAAAAAAAAAAAAAAAAAPKwmrGijpxRCHjegHzcwr3QAAAAAAAAAAAAAAAAAAAAAAAF6dA8JLKy3VXRbbY19ysAAAAAAAAAAAAAAAAAAAD2jMnJhK5cAZAH6IaV8BZzpwAAAAAAAAAAAAAAAAAAAAAAB/8QL9NCzdLTenyIoNfDAAAAAAAAAAAAAAAAAAAA34RD4CY/7x6vQarrV/2yyVwAAAAAAAAAAAAAAAAAAAAAAAot+yK0pCzlx7efA+XTYQAAAAAAAAAAAAAAAAAAADKV5Skq5e58zJPucpMJ/0oEAAAAAAAAAAAAAAAAAAAAAAAlPhj9v98Uc9CgAq5ucpwAAAAAAAAAAAAAAAAAAABx5zYhN1wv1vbfLyCbbVTaYQAAAAAAAAAAAAAAAAAAAAAAFirzOUFp4ss0XzWfetIXAAAAAAAAAAAAAAAAAAAA2nMNAzJArrrdtiFD8Mw3d3YAAAAAAAAAAAAAAAAAAAAAABKRZzcRcvTTCBmsCocv4wAAAAAAAAAAAAAAAAAAAHXKg7lyvNjlyIKnZl0hwwcRAAAAAAAAAAAAAAAAAAAAAAAfXbenJYXhlg7C9zo6ZmoAAAAAAAAAAAAAAAAAAACL5wcJtgj/3zQAEpMQ1x+YDQAAAAAAAAAAAAAAAAAAAAAAHW+76wdaHz9xwAAmfVjIAAAAAAAAAAAAAAAAAAAAHg6/zyipM/LhmOE0vZZsxIgAAAAAAAAAAAAAAAAAAAAAABY2zcmSaCz8ubEufetr1QAAAAAAAAAAAAAAAAAAADuk13VbGg4NQsls074ybPn2AAAAAAAAAAAAAAAAAAAAAAAZ9U2uQNJlcAbKGQUMAcQAAAAAAAAAAAAAAAAAAAB7EUbUUzDE2hqLVotW8igozwAAAAAAAAAAAAAAAAAAAAAADc+UpBQzctCSgvxjpybYAAAAAAAAAAAAAAAAAAAAKpD+/kUFQFI7E6R3zHPrF1IAAAAAAAAAAAAAAAAAAAAAACW7+vRhT09RXsoLo1ULjgAAAAAAAAAAAAAAAAAAAGeerhIT8WLXfXaYIbt1/DwyAAAAAAAAAAAAAAAAAAAAAAAbVIF8csgrJ1p1mP6++dgAAAAAAAAAAAAAAAAAAADrWq/MzJQJEMo6GFSjnJV0ywAAAAAAAAAAAAAAAAAAAAAADqg1YceZL2JvvoWmuoXDAAAAAAAAAAAAAAAAAAAAk9G/159XHBS9qlZTE9w/cygAAAAAAAAAAAAAAAAAAAAAABbYWIku5vqWV0m5kulmKAAAAAAAAAAAAAAAAAAAAJaGJnexU9MkazxNZP6sr2cCAAAAAAAAAAAAAAAAAAAAAAApWgb0rR5NXKRJTgOu+7QAAAAAAAAAAAAAAAAAAADiipfjQ2WMj6u69hzTdIn00QAAAAAAAAAAAAAAAAAAAAAAAGzpIOI52T0HiaSQ0h0iAAAAAAAAAAAAAAAAAAAALU0TUDcb9/mKoji00JUEtQ0AAAAAAAAAAAAAAAAAAAAAAAnejG9rr5v/uyN0AprghAAAAAAAAAAAAAAAAAAAAAhX3/jXPmaXC7pzkyYtCvelAAAAAAAAAAAAAAAAAAAAAAArBYTgR73TPiq0FY1pn4oAAAAAAAAAAAAAAAAAAAAD/u97rxBac9wru9+63zfxhgAAAAAAAAAAAAAAAAAAAAAAGoIId07oQAJDw+7OHy+yAAAAAAAAAAAAAAAAAAAAXers641xub9fI+SPGXemqPgAAAAAAAAAAAAAAAAAAAAAAA3YVMuPivgIDo8VLj0btAAAAAAAAAAAAAAAAAAAAHaBeytyGGH24J9rZxtMcP1IAAAAAAAAAAAAAAAAAAAAAAAvck6Xui5le6P1f4tygVkAAAAAAAAAAAAAAAAAAACbyB2sPJrTLOW7+2bwyvPd1gAAAAAAAAAAAAAAAAAAAAAAAANJohEmCynQH35qhJlUAAAAAAAAAAAAAAAAAAAARd3iqIaTXrS42eo/rYJkbjgAAAAAAAAAAAAAAAAAAAAAACGcVxsyoozpoyofyc+LVQAAAAAAAAAAAAAAAAAAAE6f5c6vKz2NLTII6PJ3AjmzAAAAAAAAAAAAAAAAAAAAAAAf0FTD/yHJvR2TjweRCigAAAAAAAAAAAAAAAAAAAArox+RSF1r1U7s7ioii/8pKAAAAAAAAAAAAAAAAAAAAAAAHbgrUQouhg5t/bJbla6pAAAAAAAAAAAAAAAAAAAAECczraXqGq5S+RGkLGrVR/kAAAAAAAAAAAAAAAAAAAAAAAtCNYlbJ8uWoK+DMXLx4AAAAAAAAAAAAAAAAAAAAH/KV0H7OsK7cutE5XX7PEPgAAAAAAAAAAAAAAAAAAAAAAATdRwyXJvE7C41fVyVvrgAAAAAAAAAAAAAAAAAAABedASG2Sc7gVjQiY1llLSAswAAAAAAAAAAAAAAAAAAAAAAH8ws6ULey66cums3nVVrAAAAAAAAAAAAAAAAAAAAZkheyZ335u6i8eSZgG3qu2IAAAAAAAAAAAAAAAAAAAAAAAlugTO6ztSPlmWbOBWaSwAAAAAAAAAAAAAAAAAAAHIS1YUbyW5AU6DzN72XgtQVAAAAAAAAAAAAAAAAAAAAAAADg2z2gbO6Xqej0f3+d+QAAAAAAAAAAAAAAAAAAACAdGSxNEr8CcIvzgbIKxDrzQAAAAAAAAAAAAAAAAAAAAAABGpYmzRiN+PzSRW4dQ2ZAAAAAAAAAAAAAAAAAAAAsnMLkbqqi61jgegAxxIqu1AAAAAAAAAAAAAAAAAAAAAAABzsUuXkQnv7OGlZsw/iUwAAAAAAAAAAAAAAAAAAAJD5U93hEHXnqt/7xjYO+gBeAAAAAAAAAAAAAAAAAAAAAAAX9fHIbwlc7R+agBPz/OcAAAAAAAAAAAAAAAAAAAARbLcl2YVZzbyEW1+FYMcWzQAAAAAAAAAAAAAAAAAAAAAAFQxY3QI9ovj4N+O9cedPAAAAAAAAAAAAAAAAAAAAtiwjdFIeoLxVu8e5+lubVVkAAAAAAAAAAAAAAAAAAAAAACksx5tM+ePq1wUMmzY9LwAAAAAAAAAAAAAAAAAAAJW12Le0pjsF32UrDRDvFG0mAAAAAAAAAAAAAAAAAAAAAAAJnjvVoKAKt/4YBAEFubMAAAAAAAAAAAAAAAAAAAAhKa86Y39aYioyRA+GDR4qfwAAAAAAAAAAAAAAAAAAAAAAABW40lFdduLM7Jnc0ZRZAAAAAAAAAAAAAAAAAAAAIiuIgQjcJdGqRQ4LS8ISw34AAAAAAAAAAAAAAAAAAAAAABuRdReSC609i8AclZUJKgAAAAAAAAAAAAAAAAAAAEghQcfr5CAAodWMy3Q4H20ZAAAAAAAAAAAAAAAAAAAAAAAwXomSsUju2yLm6ZIHeoQAAAAAAAAAAAAAAAAAAAB8hoR2GGgdwp2Kk2OrfEDhwwAAAAAAAAAAAAAAAAAAAAAAFkZaXMu1UM0sY71YEW/kAAAAAAAAAAAAAAAAAAAAQ5lzrBLXynltb+mMpA5sprcAAAAAAAAAAAAAAAAAAAAAAC4k1CD7+VCO0x3mkttHewAAAAAAAAAAAAAAAAAAACjt0afkbIQNnJQ/30VSHGTOAAAAAAAAAAAAAAAAAAAAAAAEPQY7Ewrfs3NCr0XQFVoAAAAAAAAAAAAAAAAAAACTMJUq50xXPRaG2ctKAHM4VAAAAAAAAAAAAAAAAAAAAAAAJhUixAiTMGRq/5ZzYZSUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA1uWBUtjPL/PeN+dcY/a3S9wAAAAAAAAAAAAAAAAAAAAAACeej5zgxO0A/DQqYKmaNAAAAAAAAAAAAAAAAAAAACjrlWyNAeXrivseD4CbyWGIAAAAAAAAAAAAAAAAAAAAAACFcdCQzJVZSfVopjLH6JAAAAAAAAAAAAAAAAAAAAGvMegX/lalrKJQkxfczZw2WAAAAAAAAAAAAAAAAAAAAAAAAxDcm91tv2g3iLODg36sAAAAAAAAAAAAAAAAAAAAdCgnXF47JO614WPluZPC0jQAAAAAAAAAAAAAAAAAAAAAAL5tuC04sAZaN5cMkgqp9AAAAAAAAAAAAAAAAAAAAF6UyFPM7GtAJ5GGyaZJyGb4AAAAAAAAAAAAAAAAAAAAAABQQfUvkU8gEqOKRhpGbPgAAAAAAAAAAAAAAAAAAAJKHn2GoKCaTAlYbtX87FVfPAAAAAAAAAAAAAAAAAAAAAAAoRQUJTjXTtVikNALK2uI="
     },
     {
-      "name": "process_message",
+      "name": "offchain_receive",
       "is_unconstrained": true,
       "custom_attributes": [
         "abi_utility"
@@ -3731,7 +3731,7 @@
       "abi": {
         "parameters": [
           {
-            "name": "message_ciphertext",
+            "name": "messages",
             "type": {
               "kind": "struct",
               "path": "std::collections::bounded_vec::BoundedVec",
@@ -3740,9 +3740,83 @@
                   "name": "storage",
                   "type": {
                     "kind": "array",
-                    "length": 15,
+                    "length": 16,
                     "type": {
-                      "kind": "field"
+                      "kind": "struct",
+                      "path": "aztec::messages::processing::offchain::OffchainMessage",
+                      "fields": [
+                        {
+                          "name": "ciphertext",
+                          "type": {
+                            "kind": "struct",
+                            "path": "std::collections::bounded_vec::BoundedVec",
+                            "fields": [
+                              {
+                                "name": "storage",
+                                "type": {
+                                  "kind": "array",
+                                  "length": 15,
+                                  "type": {
+                                    "kind": "field"
+                                  }
+                                }
+                              },
+                              {
+                                "name": "len",
+                                "type": {
+                                  "kind": "integer",
+                                  "sign": "unsigned",
+                                  "width": 32
+                                }
+                              }
+                            ]
+                          }
+                        },
+                        {
+                          "name": "recipient",
+                          "type": {
+                            "kind": "struct",
+                            "path": "aztec::protocol_types::address::aztec_address::AztecAddress",
+                            "fields": [
+                              {
+                                "name": "inner",
+                                "type": {
+                                  "kind": "field"
+                                }
+                              }
+                            ]
+                          }
+                        },
+                        {
+                          "name": "tx_hash",
+                          "type": {
+                            "kind": "struct",
+                            "path": "std::option::Option",
+                            "fields": [
+                              {
+                                "name": "_is_some",
+                                "type": {
+                                  "kind": "boolean"
+                                }
+                              },
+                              {
+                                "name": "_value",
+                                "type": {
+                                  "kind": "field"
+                                }
+                              }
+                            ]
+                          }
+                        },
+                        {
+                          "name": "anchor_block_timestamp",
+                          "type": {
+                            "kind": "integer",
+                            "sign": "unsigned",
+                            "width": 64
+                          }
+                        }
+                      ]
                     }
                   }
                 },
@@ -3757,190 +3831,18 @@
               ]
             },
             "visibility": "private"
-          },
-          {
-            "name": "message_context",
-            "type": {
-              "kind": "struct",
-              "path": "aztec::messages::processing::message_context::MessageContext",
-              "fields": [
-                {
-                  "name": "tx_hash",
-                  "type": {
-                    "kind": "field"
-                  }
-                },
-                {
-                  "name": "unique_note_hashes_in_tx",
-                  "type": {
-                    "kind": "struct",
-                    "path": "std::collections::bounded_vec::BoundedVec",
-                    "fields": [
-                      {
-                        "name": "storage",
-                        "type": {
-                          "kind": "array",
-                          "length": 64,
-                          "type": {
-                            "kind": "field"
-                          }
-                        }
-                      },
-                      {
-                        "name": "len",
-                        "type": {
-                          "kind": "integer",
-                          "sign": "unsigned",
-                          "width": 32
-                        }
-                      }
-                    ]
-                  }
-                },
-                {
-                  "name": "first_nullifier_in_tx",
-                  "type": {
-                    "kind": "field"
-                  }
-                },
-                {
-                  "name": "recipient",
-                  "type": {
-                    "kind": "struct",
-                    "path": "aztec::protocol_types::address::aztec_address::AztecAddress",
-                    "fields": [
-                      {
-                        "name": "inner",
-                        "type": {
-                          "kind": "field"
-                        }
-                      }
-                    ]
-                  }
-                }
-              ]
-            },
-            "visibility": "private"
           }
         ],
         "return_type": null,
         "error_types": {
-          "361444214588792908": {
-            "error_kind": "string",
-            "string": "attempt to multiply with overflow"
-          },
           "992401946138144806": {
             "error_kind": "string",
             "string": "Attempted to read past end of BoundedVec"
           },
-          "1998584279744703196": {
-            "error_kind": "string",
-            "string": "attempt to subtract with overflow"
-          },
-          "2967937905572420042": {
-            "error_kind": "fmtstring",
-            "length": 61,
-            "item_types": [
-              {
-                "kind": "field"
-              },
-              {
-                "kind": "field"
-              }
-            ]
-          },
-          "3330370348214585450": {
-            "error_kind": "fmtstring",
-            "length": 48,
-            "item_types": [
-              {
-                "kind": "field"
-              },
-              {
-                "kind": "field"
-              }
-            ]
-          },
-          "3670003311596808700": {
-            "error_kind": "fmtstring",
-            "length": 77,
-            "item_types": [
-              {
-                "kind": "integer",
-                "sign": "unsigned",
-                "width": 32
-              }
-            ]
-          },
-          "4261968856572588300": {
-            "error_kind": "string",
-            "string": "Value does not fit in field"
-          },
-          "4440399188109668273": {
-            "error_kind": "string",
-            "string": "Input length must be a multiple of 32"
-          },
-          "5417577161503694006": {
-            "error_kind": "fmtstring",
-            "length": 56,
-            "item_types": [
-              {
-                "kind": "field"
-              }
-            ]
-          },
-          "9791669845391776238": {
-            "error_kind": "string",
-            "string": "0 has a square root; you cannot claim it is not square"
-          },
-          "10135509984888824963": {
-            "error_kind": "fmtstring",
-            "length": 58,
-            "item_types": [
-              {
-                "kind": "field"
-              }
-            ]
-          },
-          "10791800398362570014": {
-            "error_kind": "string",
-            "string": "extend_from_bounded_vec out of bounds"
-          },
-          "11692359521570349358": {
-            "error_kind": "fmtstring",
-            "length": 40,
-            "item_types": []
-          },
-          "12469291177396340830": {
-            "error_kind": "string",
-            "string": "call to assert_max_bit_size"
-          },
           "12913276134398371456": {
             "error_kind": "string",
             "string": "push out of bounds"
           },
-          "13557316507370296400": {
-            "error_kind": "fmtstring",
-            "length": 130,
-            "item_types": [
-              {
-                "kind": "integer",
-                "sign": "unsigned",
-                "width": 32
-              }
-            ]
-          },
-          "14938672389828944159": {
-            "error_kind": "fmtstring",
-            "length": 146,
-            "item_types": [
-              {
-                "kind": "integer",
-                "sign": "unsigned",
-                "width": 32
-              }
-            ]
-          },
           "14990209321349310352": {
             "error_kind": "string",
             "string": "attempt to add with overflow"
@@ -3952,22 +3854,11 @@
           "16431471497789672479": {
             "error_kind": "string",
             "string": "Index out of bounds"
-          },
-          "17531474008201752295": {
-            "error_kind": "fmtstring",
-            "length": 133,
-            "item_types": [
-              {
-                "kind": "integer",
-                "sign": "unsigned",
-                "width": 32
-              }
-            ]
           }
         }
       },
-      "bytecode": "H4sIAAAAAAAA/+19eZRdR3lnv/2+feldvai71Vpau9Tdr1+39qW12NZiyTayDGMaq7FFZEluScYOCUEQMHBYtDkkMHPAi2wn2BhjT2wyMPGYeEjA78AhczAYc04gkwMmiWNizCSMJ56W1O++urfq+27Vvd+VuuinP3ye+977q6pvr6+qvgqdOf2Zx49OHLll/Nixm2+f/M/YreN7T5/84saJg4cOHbx109ihQ+fqPnPy/IaJibG7P3/21Okzf9VVh/8L1Dm+UicHFKACClIBhaiAwlRAESqgKBVQjArIoAKKUwElqICSVEApKqA0FVDGGejkQ3sPHr710LgcYJYaMCcBeMngvVy3Xg4yT0W9AhVQPRVQAxVQIxVQExVQMxVQCxVQKxXQLCqgNiqgdiqgDiqgTiqg2VRAXVRA3VRAPVRAc6iAeqmA5lIBzaMCmk8FtIAKqI8KaCEV0CIqoMVUQEuogJZSAS2jAlpOBbSCCmglFVA/FdAAFdAgFVCRCmiICqhEBTRMBTRCBbSKCmg1FdAaKqC1VEDrqIDWUwFtoALaSAW0iQpoMxXQKBXQFiqgrVRA26iAtlMBXUUFdDUV0DVUQDuogHZSAe2iAtrtDKSWmrqWGnAPNeBeZ8BTZ0+dcgZ6ue66ycR8KByJxox4IplKZ7K5fKG+obGpuaV1Vlt7R+fsru6eOb1z581f0Ldw0eIlS5ctX7Gyf2CwOFQaHlm1es3ades3bNy0eXTL1m3br7r6mh07d+2+ds/eU6cmh2Ff0Xi58NLJ85uOHD52/OzJhzYfnBi/5Xjw5MPbDx8fv3V84oHr+52jyoD9+4DS9x94wv59nVr7T5x88MJazOmFJs4je8YPjR0/eOe4oYZ0HY8QV0OoO/nohb4cGDs+tunI0bvNIb2D7RMDPtlzZuCHqj/YVm1vvfAl5pflPa73apyoe4fn8WdPPrDjyJ1n2NGaQsFhJ9Swc5NLbwcPj03cPfnRrqP3msAPbDhw4OLwzZaYFh7bfvjAxb96FI2ArfFqE2bz/JiDU9SY+t8QyxjLkzDbZcuTiE1aJuV81E7jANu07VmwKlK2J6HKk9t5zoTViHPYs9ys91FuNvwWyU2YUm7CiNxEGBtjexQ1Hz1ufxQzH315qtHdno3SEzxCUNUoP7j3+JGjp8UqE7S7n03ntxwcP3RgEvbnn/jcH2QfP/OFrkXlN6JbP/1PN7++PVJ6qfx7rd/44JuvvHbW/uFm88Pv7X/zx09lz/7uXZ/86vtKC+rHHj374i9/8c1vfyn7+k8eu+PFQfuHox4d7hZVQ2r7fivzfVEiaWP/fpva91z/t6t9z3HsKvP7+693zqdE7Z9fXeFby8r5w0f/+LsNLy/o+dH6Zx9deq71V72rX35m232v/eZv/k0w7mtMhq99OrT/tid+cyS59UOPv/elH+48kW4fe272R8/vf/707Fdu/oj9wx0KDPvZ+DeO2r/fqfD9r3uW3G7/fpfZcfG/QOWH/cPdapIWsn9/rarm2r7fo/Y9Jyl71b4P27+/zoFwlX8R+4fXMx8GPtRz7DPxTwZ2PPfBJU+lEs+9suHzGzeVv/2HH5+dffTz9g9vqHy4cHX8tfMff/+H6/7u4X/81K8Xfm39knznhvzS//W577cdnrip9TX7h29TG2q7/ft9jFKtUOfUjZKU4j7cr9QuZ0tukmyX+/Dtkh+OPLRn/PiJicPiqCJmjypCVY9scdBG9QXL3+NV3y5sIPHQ6B0nxg4dY9swsSb971Unbj+6/d0mXGLXyQevOTJ2wPxDtPrR+UmvODHOtxwVt2zYh8bEK8IP4vYP4tUPHrzQz9PbKrS8FCyUc0+f/OKWyT4dvPXwhT/c+8yJ4wcPHTx+99bx49df+jXJs+Pjdx1/ua755GM7xm8/MnH3ZBsTk1NZNt6BniTAJ0nwSQp8kgafZMAnWfBJDnySB58UwCf14JMG8Ekj+KQJfAJzoQV80go+mQU+aQOftINPOsAnneCT2RcEazLpc/vRQ+OX7IFu/2fNCDi9UhxQwnzw+hUrS/hfnXt66lTFJJlk72Ijc2DC1MVPmLqq9qRiy0QRfhcI+cg1k9y/7raxw6yVutYye67Y0+pH+0xr9XUIuJvva6Aa7COj7+YedkuQRtBctxxpuu0zuG5k3t2jmgtSnnf3wPPubqJ5dw9OK3uzc9SazUDNzuGbncOO28aGXvYZADn3SxXpZSICEXqvQIrnvoeXi14zdoOa7OVH0Wv36eP2sfRUGS0rELDs9rBsO+9RSDKe+Q3nO6+dIscdEC3jVuPziCA/3C1gXLycOz8FfZwzFoaE2MQf2HviXdYmg1XbBGWrRLJmfoTay8Tdpr18FoIPArToZqM6qGtTAfHkbEEwon2iHr2f53tSOaV03cTYhZQSb8SSWMJKJkFRZxeqBGKU1ToeeFLdKCdho5wgMspJ3q4kEKOcUhvzV6BmU3yzKXbcNjak2WcAZAY1yikWjBfMzAuf4C1emhUjoNU0P5C03S6/cI99PElKw5zkU9Ei+fXeUIKxsDbzl2ItoQrP4dYM9jWvgljHI6TVNGg2j5BRVQZu9cjmsV74LES7LGCmA6yZ5sU6W87dXsH+LxzT4qwM2R9apMr+MCHjHXDLYmd3nH0NgnSaNSRFPueF887TBoEZjMPThoSEOUqazrEk/HBypWnnEatFr357waM+dgn34sRt19FzbF93nDgknMN0wR+lrR8l2Y94zyaZkMvD7WUvxDqAAfeqivDUqY6PgKs9sj+bY65CiG1jnd021rE9rojUN6xJROadOt7qM/1COGWhnOkqboI/yYHMTSNiNCWgDEx1FiIrR1kzPS/QvOQLz1eMz3/jmZ67HExPq7M2Z7L2ly5ZC5n5ffyUhTXAlyj1nStEqex0otR+OUqBUpq3SqnB/uTIW1CaIgh2KtUrAdzGAzQoAYzzAI1KAAKL36QEcAsP0KwEcIgHaFECGOMBWpUADvIAs5QABHt32pQADvAA7UoAN/MAHUoAx3iATiWAO7A8kAzABJbqlAE4juWRZADexwP0KgEIdmDNVQL4fR5gnhLAER5gvhLAu3mABUoAd/EAfZIhpCDHsFCp7ROCwCNQDtxT8RKvwF4iwEVAWcc87CJRziuA5bwWvfDPFT+ZXw16PEF+aZGa21+rnl9aBOeXAkT5pUXIekzQTo3FbNe4GeJi1mUDzS3mm1uMTDoXs06cHLKBHrJRi4G30kP20kP2aMGeOTWOT2eOz9VCiNroIedpYS87tGBPrxbs0cNetmkhl7O04HivFgrpg1x200O2aDFwPULWHi1iIj04rkfIumCmRm6ttZioFhNNQ0vUqIVcdtJDLtSCPd1+hAZgIrWTS6Tmqz9F2606y4E/9Jzw3MCnD+Fk6hLfTy4vsXdnCdszMNG6RPIEZt/yVS/8JPsn34IYu4Rn7JIqY4GPlqLZWY6Iy9SIuAY8TL0UPEy9BDxMvcw8TM31a6lqv1RoyLTCqQfztM8dYzBIgx4y6w6ysuVWZBcWgZsbuf0OzAaTS6sz5WBMZUVEcZ/QCnUlTvu/IpJWWRFZxHaNYyzztKCwALMIkRUGsp4esoEespEesokespkesoUespUecpYWQtRGD9lOD9lBD9lJD9lND9mjhdmYo4UJ9kHHe7Xg+FwthKhVC7PRqIUQzZuplqhHC0ukRzBYc7rTmj0+6Ph8LQa+YKbGRAv8CA3g8y5YajMrSG2my8Ewtq9aKnkwwOcB4KzIYlVs5azIYnSjJpgxWSyZ2lw69NKyb/6t8R53OWv5hBaW2lRMIS4HU5tLwNTmYjC1uRRObS5R7ZcKDZlWsMx/nzvGYJAGPWTWHSSX2rQ4aii1uZ9PbTJjqyY3BYfiysGM+UJc5ayYmTvlDsdDT7JVtEqLHcihKfN0beWzq9nx2Y6rdjIfXtgMDxA/L9ovz3ybEJAoXw42mR2uhzucuHhS0hw821fwzFnCBG5B3srBb0mdUetCCxjIcMn2Th6x/4q+JaNu/zthG58nyop38kqaR8x1l1qzaahZYWkrWP/72GdQGILWoehiwQSHRcrBhbyV66sKOdBoHz+OPsbGTYnVXPt4OhGxUiRxWF2sumCx6iQSKwF/O8HFlj62a+RMuKyAXrkpOCbbp3QsaxRb3pcB2IcFujIAu7FgSgZgJxYlygAs97yCnuYRlit14SgPsEIJ4G4eYKUSwArh+bzgNtMobeDKawRYHwCoRgAP7+2qkWdfg2rk7EMigjy4ll0p3lIOPWstofrn1RKqe28bmxg/sHf8lonxSUpCJTD7wScD4JPBs0plJCfDsHMgVgx8YrgoxZo956GE5oVwUeFeAuUCIpQbAwz/NgYYSAiUVWsWLMWZ5ZvNsuO2saHIPgMgh9AQKMuC8cZhqBy8gVdgpllwyl/kR1LkgyC+eFVaYl6K1/nCilelwflawDNTQ+qCnIUFOU0kyFmUVrA8ZVG2G+7YjkPCNkaWsFdcBro1lAFuzEUiYyaUBWbcNjYMsc8AyBJqzIosGG/MSuXgBC8ZQxLGbIgfyRBvzG4n8AtOVenKwRNQJwfBsnRTGHsENBksZ18xoe/CSwn6FwPkfxtigH5v93hVcfhm+xHrNSARAwyiatPPgolEJPgRXm0GJNRmgB/JAK82Jy97DPDb3p6Cf1MU2oi6ovb779/6VWKcAbZrmFgb7sT6twFyOkZi/b67lCsuqdyYB4hcilAWmHHb2DDIPoOCO9SlDLBgvEsploOP8pIxKOFSBvmRDPIu5WHO5PZLeEmh44UFOY1QUBC3PQE26yZu6y9n/7MJ/ZSrEtCC4aYqTY5iNfX7FcQsVR0EwpIB7qEPFs6QbK+fqL0rOj559TE5tBvr5KDCJM9E3MshMipexIQWHEAKaQ73aimsvUGi9gYl27vc40sTtZdmX7PZvBRllJBCogSBcX0RDKOdjOsW4bax7MdN6Jew8B0jgte8iosIpghHMCmiCKaIC4y92SGiCEaYgWHGbWNDiX0GQA6jEcwQC8aLyHA5+HNeaksSEUyJH0mJj2D+nk/NEmpX8fKpsamqzkr8Gsh8N0o8VM5OmNCvY0pcRAmURka1RcGsph13SRbR2FZeMQbAuW8JsU7DvlunYdg6lYis0wiqXJYV4aemVoQ3jB9bsbK0eXI5+O6jx8+c/NNt42NHN0xMjN3N0G0EvpZy+MzJ85dePy1YOC3lhBcSnhM3k+KaMeVM+H4xJ/77UO6ci045fII/RWKPElHsUWJfgyCdLiUZFliKVDkUcb6VJI2I1igee01i27IJgFuGKbX3tkN2c2L+7JIMfszOotRIl0MpZ2oMINTYgxnbAY4algS2DDXS9++asIsNg6YQkanlVwL3q9u8Af8jsgG1iGxQbcz3KWViYDYUJSY/+FYFy9xR5O9DHT5uVQi18IlkwkDJMpHzesHWfV65Xpd3DtdC4CHRovP9WClhUjB7swk+H7sgixOuDCUrMmybwBChWytlptwDol348eq+N54yA+XQcs8srUPuahzk2c26rymerFSlhgPD4+VsVZoGMYaD98lmeNWNO4bMA2ieV97cGcg+GtjnDPnuc4Zgn1Mk8jkl1GS6jrNL5UnbBUXaQ3ikfeFThVg7gzWVFn8zAMTbgw7xNtQ10ojbYFkBsM3AdzSgu7M4QY4TbRNKP7D54J1g8iUOq/6OE3BMHIdJwN37OyRhaOIPiUIS5ppjkXkLbTcvG1mH8StPxK88+9plWsPlIoU4ZUPxKoGRPUYyW99/gl0ZKgPwBR4grwTQh61pywA8g01gZAD+HAsiZABO8gAlJYB3YHknGYAFPMCIEkA/D7BKCeDnPMBqJYBtPMAaJYCv8gBrlQBO8wDrlAA28QDrlQDe4AE2KAGc5QE2KgG8xgNsUgIQhHajqh6RQ9jqbcu5ibOFdxyjbCs2m71Z3WZXm4Kjzc1E0aZgNJsRp7GFHbQ85BZZSI5rW4i4NioaJ9OKjWvWTiFdXkpPhTZ6yCX0kN30kGl6yJX0kBl6yDw9ZD895GJ6yD56yAF6yEEtIBfRQ5boIYfpIUfoIVfRQ66mh1xBD7mGHnI5PeRaesh1Wriz9fSQG+ghN9JDBrWA3MRlooLVn2DmMMi3F5TLHAZhSCzvlxUkfOSuMQ7USSxePQ2mFZ3XMoKCZF+mnA2Y4H+BVVEwMPrHwXoI+5F6CAGkAFaQqYiA9CoJ0UOxtoOlV+fhsv0yM+w7eYCgEsCtPIChBCDaV5Yoh5eZNP1rvoWwUgtcNb8IsnQUVZtnLlafzEfhyXyEaDIf5QUqAi6kxdiuccIWY/kKNBfjm4sh8stAzqOHXEgP2UsP2UYP2UgP2aoFLQP0kC30kM1asEcPuZxFD9lAD9mhBaQPoh7Ugj0+yOV8eshuLZzuLC3Y00MPuUCLgc+hh1xKDzmXHjI8U8OsoBaR2zwt7KUeUXBQ5WLBoNpEM6g+yw36f7FgEE2b2KgRZrvG0ZF5GlJoLuK4pTWE9tGyifPPpjZxXnPk1lOnzgGnlK4S744MLgLeHxW/HwqcE+14RLdDLpLbX3kpgWgm6jJFcX5npdcd+Ohma/6gdqL6E8zDJXhmJeTycAkQUrinMYdsuUsp5ba2e92zN+J1z94OrCKbDMBer5v+NvAAC5QAtnrdNbjZ667Ba/jyMLDxVtxgvlPdeCNn3AeJjDd+EBcuW1hEqwumFI7wDiGqPSThqt1DBughW+ghm+khW+kh2+ghG+khZ9FDNtBDdmgB6YOoB7VgT1oLUfdBx3tmqo4v1EIh9WBPvRaWKKCFJWrUgpZ6yGWzFhxvqVkiMsg59JAZesg+esisFpB5esgFWrCnXYteLqKHXKyFEC2hh+zXguP9Woi6Hia4oIWo92vRSz1o6YOoD2gh6j7Yy7laxJfztUjq+DBJ8WEq5UN6GZz3FEVFq5jLGkXlvMKve64HvNvHCqa71deehu3dGWZ7Bq5LsR0rDsAdW/nqXafXr+57E2LCMM/XYcdV/hF0MQsphiFFxB1TFJkCDDHtWp+EeSpOPYmwjV+qlzOKVfmQ7JcKDZlWOO0wKXyTO7bAgKPuACs7CxjJY9RruuwtcCrEmhNvvfh359KjgkpsySpJkfEPcqVHB5n3pi4/5Ve0oVNnb9n+nXzsUn8vvr7r6DmGK7a6lsIOiGtaRurMElIbue4X2WGyJgYb6NR44N4WL1TIAgjIUSdRoU7v9/8i9n/+7NPhr/zgtSPvfWPh2W9t/eR//+LqM+Ulaz+w9+//6NUdCHUuFPICBoWMeAgfcYIfsQL5bEI0JKFEik43yb7GbSmAnZxipey0upNDHNkQ0QaLEk4rj4495c72l+xsGGGfAZCr0JK1Fs/Cq/eqcqSFl4yRCiVuVHDpI4x/uLS5LVKPxE6yQgHLr8XpeA3zUmAROfPEbqQT5CpwYjduES7BDQ6ZfzHBu7HqoyDzk3wtwZyjc18mkhjzI9Q/LitH5pn+8VmogRxADxkjtkwU5uewMH+yT4s8WylsuyRI/Zy5fbE4YHGjlyC4IlfLPIg/aBGX+WcRlzmG9iVhkLVbgs/DTuEZ+OUqvqNxOPoaYWN7CNGpSj3YlzVIX/gi9KuZD0FEYV/2SPRlHdIX/mattcyHXovx7fFajO8Gr8X4dmHF+KT0Io5V45NCiPAIiuXnop4L+sUE9jFXThwz3cwmSHrCuC3bxglQhLUTAGgEPRTAefRl7GvnPR7/T3iuXpAUEDNcNsZMYl7tkpjbhcCRT5vAO70WrrieBwgpAfyO17IS7/WxrESL+pRC27ISPhzf9+F4VUiLXvpwoC6sxcD1KDLgw/H9oBa09OHk9Qp6yOX0kHrULZixhUR0ORhfO9qLHO0NsV3j6Mg8TSg0N32O9jb7f7S32e3RXqiSnkAuc2qi0aEulzlYLhNEcplDV/Fs1FjKdo2TS+YpuP9wKd/cUsRkMJDd9JDz6CGb6CEb6CE7tIBspYfspYcM0kM20kMu10IhfeB4gB6yhR6yRwuz0ahFLwNa9LJXCyHygeOztPA9QS53zlRHXqYQTOXkcuc5d/EZ8FETvi5IFcjn2oH3rxW/31SnHsi3qwTyddxuHYZr1jof2NafXGXrDywCcSIRiLOvcfW44blHk1r4/xH1uUcTPPfIEc09mlBa2agxj+0aR0fmKbiRZx7f3DyENfMkjLV7yAA9ZAs9ZDM9ZCs9ZBs9ZCM95HJ6yG4t2KOHqPfQQzZoIZcNWnC8QQur3qMFx2dpwZ4OLSB9sERBLdiT1kLU9YiJmmsBTC2AqQUwtQCmFsDUAphaAKMte/QQ9YVa0FIPS1SvhULq4c70CP/1kMtmLTjeUrNEZJBz6CEX00Ouo4f0Yb1nPT1knh6yQA/ZRw/ZrkUv12vRyyVaCJEPHM/QQ2bpIRdoQUsfrPqAFvYyNVMV0gdLtGimWqJ1WrAnq0Uv181UP96vhagbWpjgPi3cWb8WOt6uBS31CKznapE1mK/FAqwPqScfEmQ+bEPsENZ/i/5frNbIhYYc9+R+1L69NljpkGCzsaGKbaVDBdikgtkS04KtOwbbM3AjsiFZIvf1a3Z+9Z4fvfoziEEGzyCjyiDgoxT/EbvTG77EVIqIHwZL5KbAErkGWCI3DZfITan2S4WGTCucmJsUvskdW2DAUXeAXIncIKte9sMAjPSChwECfHtYdcS45TVB7cFYHVPo9nJ3yL8T+yl1g3HFT+x7NZJJd3rEHYtIsc8AyDRabtSipbzUpcsxwVnvVIUSNyqYxxSja5cO3MeSiB+SFQpYfoOI/IYr35nFQmNgfBUAimMytjcqIF2gbOwywVs4hQ1LsC7IFwtNOps5uWKholppRjnW4Vws1ADoEZUYUVxULNS0wqJiofFyrIfXtyRdsdAkxxqD5RKNdwqj0Q5sS+O+l26OywVYXmxpHKWVjRpJtmscHZmnI1BzSb65JMIamdL0ypBO9rEGWAPUGxCqvk3hueNy1tJ7QyYYX/o3KeEEFKkXZl9zhDR75uxVU4jL34O7/FQ5tsu8LgKMKVIe6oOnRS4/hbn8yaBzr9mnbeDUoxq6Xa/ab8tcQkQUY4UJvo8TjRTqouLsiwKJkws8UkSBR4p9TR7SOcyMo9OKpKV3oqDuXYzU2U/js/rvdPWIYb0KxLRDu7Dy/J0KoUocoW4n+xpsEb2mgyLqYV0aDuviRGFdGqWVjRoZtmscHTOOjirDN5ZBGKMD4GXzcYy42hpKUzaUllMGivDA9ACclBE2k6n6KE6Bs9ANT+y/P0o9t8Nz4cAt9jFuqXSrzv5kKyJS21g+2Z5tRxh3FUsP27OrGXqI6V1np3cdS4eKA7jamrlm3qnjjHhWwkVmeU3MyrnIrESwcQps1jnYEEVg2bLRaoKfxRK74D64pCjECmAhVrIc+2PPqwFYViXleZFqOgm+snAHTOH+mIJwW9bEkAlJWjEkNdgmMLudVA1nTRu5HxtMWiHcClQjTyQ8Voq2kr6XEE76H20l0WjLUtXrK2ZVr7EDm8aOHjtxaJJltlpdDL2F1bqSgTOCglwroBq6Z0H82UCVsM1QGeCzVmjx/9nqgXmMr92ZmgBiauK8qZlCfLu6MUmbxuSniDGB86hbkWWjbdzkixVrp8lX3Dr5sth/O24S0gmZHiAzxICDLCTNUO17+9/88VPZs7971ye/+r7SgvqxR8+++MtffPPbX8q+/pPH7nixCA/z4mqWcCToynCYaCE2fCXbkzdHYdhyW0yl/HQyLJWeSyvMyExE/n6ttESglUUQ93KIGTg+Nh/kRIjmz01Y/AtWjcyjmJuxyobgxvsCislzPM98CmHWo5hdHGaB+RTCbEAxN3KY9cynEGYjihnhMBuYT91hRrHLuxo5a8iuJU8ZTIUNXop3OdWrh0fIXU5BovAoytMzCCajGtmuceavkQ1e5NnXiFhUBjJBDzlCDxmgh0zSQ6bpITP0kFl6yBw9ZJ4eskAPWU8P2UAPGaGHDNNDGvSQIXrImEJQGwQmxE9OTYgvNjM1Iz51SmHOaj5JiWfLgQI+axXPmgsKQ4s7LsgF0QU5h92lwbKRQRbk2K104gAD2xAa8j3/EvJ/Qyh+PRK3vZDpGja/Qrb+Yc3RSreZkRFf2BRwI9vsrUrIfCOlMC/KyeXwc+Iceyezedp9An9IDN5t6s6bCgNidsTKz+RybL+Q2WG+tvLkbeVJPgXApKw5q8j0s7qAhGbvkbyEoZDpSLO9gMaCugxLQkQo9kOsy4BFMUy0UBeGua6iw1HxYNa40uGwvzoMdQQYZQa3VLmysYkZJXzGqGI6pp6FVXchV9p4C7zVIqJELicaC7JTeZYqnCgVWHpja145dDUtrXD+QcpKpJz3tAXQzKvinn0H12aUjb3OapHCl6ak070pTC0sVEcMaNA3sU7BYp12FGuhhXaiUVa0pYjhOieaWZZe2IGYNBKxBpgjMdzVpHCUr0jNXvUoPwxH+SGiKD/MUzwERvkJlBfMU7DoToJvLoE4QAaymx5yHj1kEz1kAz1khxaQrfSQvfSQQXrIRnrI5fSQLVroeI8WcukDLZu1kMteLax6jxZWXQ+z0a2FQga00PEZK5eztAhggtgZ+GUKEXkYaW8Z+5qrIF9+3H7cqhqeo3arasLFrapzFG9VtXGNmVLHFVZLQgjX4uxrECSQwkhWN2BBRR4Es9WE2oTxrPpsNQHPVsNEs9UEqhtc6o3pGscBH9ZkchJxjXvIAD1kCz1kMz1kKz1kGz1kIz3kcnrIbi3Yo4eo99BDNmghlz4Yt3k19pBBztJi4B1aQPpgNoJasCethajrEcA0z9Roo0WLAKZHi5hID1GvRRszLdqoTVJqk5TpKJe1KLgWBU9HWuoh6gu1oGWPFuyp10IhAzPVUejhdH0YeLMWHG+pWSIyyDn0kIvpIfP0kOvoIQv0kCktaDlAD9lOD7mEHnKDFkLUpwV7Fmuh4z4o5HotdHzGymWGHjJLD7lgpur4gBbak9LCnemh44u0GHi7Fu6sTwvj1qcFLddrMfB+LUTd0MIE92nhzvq10PF2LWjZp4Ufn6tF6mm+Fmu6PuQvfciy+rB7GUyJBkSV9s2TDfuE10DG3/B8R+q9KncGJlSxrWOtAJvEM1tiWoBPwhvwsYeE5IXN39n9t7f86Mv3gcU38SNIwEeCIhXsOSKPFcTPuLiwOXEZLmw+o0RDphVOO0wK3+SOLTDgXneA3IXNlotyp8OFzfHfXMELm0VXx8ffmlYdWlNOhKdVh0rlRNy5TJygNF+8KsvIKHipDEoMUdBcUG6IoC0MiUZg/tyEdRM8nhdGMTdjpwhVLtllMEex86SGglFhMLuwukMJBd/CYPJFxy2WFsBMo5gRrARS2h0mWnTcJeYQhxmVwIwj916D3iKNXIK51wIkuHAy0eN873USOIDaJaHEwkswk1jcONmn+bz7z9Dd0JRBLoPz2q6LEq4ZOG5MEx2XdajB5foKnaT4aHbG7yt0rvHzCh3FYqHr7NK0rtIbrljoepZytmcbWNbYnm2sILq4Qifn5gqdDNtn27Ms22fkqpuM0xU6aesVOkm2CTtuBtIJmR7YX7Fc+4XLQsa8Qmft06H9tz3xmyPJrR96/L0v/XDniXT72HOzP3p+//OnZ79y8z3wMC+WshOOJIneFCSuNh2nM1U5UlMV989UwXerWhZssbTGCH2mZDU95FotdnMOarEJPEQPGdZixSOhxSJKhB4ySg+ZpIdUudUBuuaQ7laHLHCrQ9ZN5fuswtDM8NPlrQ6WIt+iWx0St9Vudaib0bc6XOPXrQ5QZW+BqHSqcatdXVQ6YVHJEYlKJ2rsbNQYZLvGiQrzFNwVNsg3N4jYVgaymx5yHj1kEz1kAz1khxaQrfSQvfSQQXrIRnrI5VoopA8cD9BDttBD9mhhNhq1UMh5NfaQQc7SwlHwK5Cd1Z/LFCKfTqS9ZexrroIp+XH7UYK1s02tBOugixKsbd5KsPqQjgmzryHtxYnas9yx499c4kP6zyUs+oRpG5igWoYqDgbZSw8ZoIdsoYdspodspYdso4dspIdcTg/ZrQV79BD1HnrIBi3k0gfjNq/GHjLIWVoMvEMLSB/MRlAL9qS1EHU9ApjmWrRRizZq7qwWbdSijVq0UYs2Lg8t9RD1hVrQskcL9tRroZCBmeoo9IiJfBh4sxYcb6lZIjLIOfSQi+kh19FD+rCSsp4eMk8PWaCH7KOHbKeHXEIPuaHGHjLIDD1klh5ygRa09MEED2hh3FJamA09dHyRFgNv1yLa6NPCuPVpQcv1Wgy8XwtRN7QwwX1auLN+LXS8XQta9mnhx+dqMcWfr8XSpg95Ih+yWT7sxusQVqlK/sBzYbgP+1j95cM2OlSATSqYLTEtwLU30vB+3IxkRcGvzd300fv2ndsNMUhQbiFTZRDwUZb/iN3wbO9ruxoRPwhWFMyCFQUzYEXBdriiYFa1Xyo0ZFrhxNyk8E3u2AIDuuQzV1EwzaoXUnAL3BMvKAyWQgYQt7wmqCiY/DFSL+/yd2hVOfnTadWhNeXkz65gh2w2LIWYVMWaVgl1k4qYzRTRMYY0SivMosO6eyO1MagB1gBdAcIBkqwuws2kEbNh1ri9tlJtIQUWdUkBNQmZCpMbBXYyVc68bILHsfqUadhOwjUaQf+L1WjcbQES1ENMZdzXaNzI0hvqnIsajal6n2s02lmTZLkEEYEX+SQiiwn2NZssJulc2P8gdWFJ/1xYEgniFXn7rLtgOe05Sg/ZGdkuodKdaK2hDAvG60JnOdWHFKZr5+Uu52i7letLXXbAdh6wnWVaxcbOxtTn/utLjgxdyYdTsGYqCsvb1DUzKzcn96KZWdRxw5KWFfHR/OnD/WY9WkD6cJeHDxetL9eClj5ctdJLD+lDOclGLQY+T4teNmmh4z5wvE0LhezQguM+iHpAC7nspodcoYX26GHcfBj4HHrIpfSQelw/t1wLudQjCu7VYuA+eMgWeshmLbRHj5BVD+3pqDnd6TxwPUJWPUxwtxYmuEkLWuoRX66cqfHlfC3MRrcWtOzQQiH1YI8P9jKoRZilh1w2ayGXM9adpf1wZ/YNDszOmLDCon0aaS/MvoZcgxcRX4KTRVZaFQsCh9VXWnPwSmuWaKVVwL4suNKaZ7vGkTovIS15vrk8wj0GcjY95GoFGXPeEo5TkqxCefoG4P3d4vdzIfUK5TeoVCgPXXY19u/0Qp+6jl7xu2vhy0kFF0IyTwsKmy+yCGsYyHp6yFZ6yA56yEZ6yCZ6yHn0kL30kD30kN30kC1acLxHC1Fv00LUG2aqJerVgj16iPpCLYSoQQtaLtfCUfgQwAS0cGc9M1UuZ6y99MVD2qY35oXQ5gGp9FZw3gQcCGLObUb4KWNEbda2XnAeIlPOPGx272r7EKLIfDWu1vhi9flqHJ6vRonmq3Ge3VFwvppmu8aJAvPUIEolpCXUyj3kQnrIXnrINnrIRnrIAD1kCz1kMz1k60zleK8WOu5DL5voIRvoITu0EKL5WghRtxa0bNGilz1acLxnprqzRi3YM1+Lgc+hh1xKDzm3Fm1MZ7PhS2hgXwU2qj+TUHsG356BtJdkX7PNIw26WXWQdFZt+DerNlzPqqe+u9HdFF5eegwfdkDEFwHvjwI7JgLqOyAWqeyACHCyH5WQ/ShKYkz2o7WMEklGqV+LmbsPk64mLRxfQAvH161FL/VI/9SC21pwOz2D2xma9+rWQohm1VJpZJDLtRCiVi2ijZaZai8btdBxPRxFhxZyGfSDPfZZNTPnBGfVAb69gNysOoC1ZxC1Z0gYnICb3Evw8uReAoq5l+Dlz734LSXyDEhUiYN0MqiQIDIR93CIQVZa5NOtJuJuLIllKCRmTMS9WEo4rmAwmCLFmzjMOGs8oI1gKOZm7ABTRmFPG4PJc9xyHwaAmUMxuzhMZqNcDsLMo5gbOUxLvVT7gUnm8Fxq6sAkfxnNpQeTyb6ff+Jzf5B9/MwXuhaV34hu/fQ/3fz69kjppfLvtX7jg2++8to5e94uzG3ty/RXN9dNPdtXzpTMx4Pmr6LVxP1wyZSNu2Hs0MEDY8fHNxw+cFGpRw/fcWL8xPiBnUeOjx+b/OPoneOHjx87deqs3ayZvZoNGLxNwN83n7UaKOz/HtozfvzExGGOBwWWVwBfCzxfC4gJS7CvIe0lidpLsq9BkMD+TOawX0Swu7JQzmyoVIPPvwn3d8eJQ3Zc09YBHzXwg0w6ut5G/qMGjNr1EoFyA0LtUeijJje9b+Y/asKCsEbmUze933NFe19ge2+zP03IKkqz7yuIzfAqShPRKoqQWOIY8StmjDh2YNPY0WMnDk0qN2QiG8SxX3PgjCC8WwEFcnQmeFTKBNuiSzvRW9WIvs4uTesqvamzP1nPUs72bAPLGtuzjRXEt4ulq84uXXXsaCoG86fWe8KYd7iONrN9tj1rYftsDxMY89c8RfTHLvX44v/sOnqOVftJOy38tIXDbYZ0QqYH9lcsdsICBvb1ogIxkQ5maRokfHiDyHNI+fDL356N/w2IsWxRU50GdWPZAhvLBiJj2YLSykaNVrZrHB1bWVMGNNfKN9eKsIaBHKGHXE0PuZYesp4eMkAPGaSHjNJDGvSQcXrIND1khh4ySw+Zo4fM00M20kMW6CFD9JAxhUlzAxBxPzkVcV9sZirkVspLVKMUcTheqMfDYnFYXq8wtCbHGWo9estUE8t3ft5fX8581gxjR7l4jplWF8TFvApIzNLg+wSvAY5ZCkQxSwOao7FRo5HtGifdjRJ+th5tjla6zSmfULbrA25kO6Ag2+GqbHNpS2b01cQlkvFPEC1LJNjXkPbCRO2FJQKlgMyZa163A+XMl5mcnl232d2mUN45aOadkX/v/sLTnFkIIWYh7HuNvzBsFkJEZiHMszkEmoUI2zVOBCISgW2Eby6CSFVEIrB1DyngaVCNrBnw9r06pPZaiL+lDkg+S2RvghXVKNTLZ28sN/Yhq4VphRXNoMfdAEHmmtXKgk7lx36BWQheuKv2vEe9WAguNAU8V39YqK7wEVTjQGPAdqw4AHfs/k2fi6+5aWypO1WSX4pmd3HY+xpTI+ICq1CHWINgeRLmqTj1JMI2fklZRvl+RVX7pUJDphWBQZrq543u2FK5JVjkisH5TApd7YeWygH/zeQ6h8QVT/7OeU1OsGYed5Q9YV1Vpl/IQnuOe5hiBRiSupQpOabcKclNwqTEW2A94YjScJ1oJLiKNsdynRPIdpZemCnPupGuUf5ac5ZhThebDyNiAk4tRwDBHa7+XCYQ3JFy5nVnwV3lZm1yNf/RKrZfdtkcYT7lHjJflkDBXeVRcNOw4K52FNw1/HBXO9JoLf/RGpbrnGiuZenFPS2xbXOVo1jaX5LBSCdf4tr02LKeHQ6J8lWzb2umn7KZ/mosBYWq5paaLJiWHQAUyLJxiVeggXJ2rgmOWuN+od/IZs3g9i+xr/PcQ2YzksE97GcZrzjiftxkTI640ezzc6Ay5j0qYwZWxgFHZRzk9WrAURlL/EeDLFUwdcso7L3rdzTmeTRP2G8RcI4/+XK2i8kTYntwB/incXdjCoC+z1IrfEpRQk9zAjtQ/VkEBRblKjeUIvsaCMltkwpIeP/SA5sP3mnvifNngw+J+FmykJHj52A5u8TUt+eVJN6ZlSVU0gZYTeB7VipnVzCSpmhmBvGQetLMDFTAc1/3AJ4Sgw85hz0Cg1B0tCKC6K3E9gsRfD4mGmTtKbgvo2TdQzLIRrL2VCLzcMBpb8qwdb+HZRgCZy83jn6xiO80nehGfuI6rOY6QgoM3cy24oqlGWy0IGbJTAWVVPStSqbtILKpEorY1zCRCBxk7Td7sFPBTmdA/5Bhu1iN0hA1ETm9eDl7HaPQUFAy4C0oCdwPByVxN0GJ8/S/iAYlAdTrCXxiRiIujLt073HTva9UGE2AHRjw2RBg5Yu4UAyVs7e4svJxj1a+yInvEGYdLYEKJLpF/0S35Ci6wuE60WiE/2gYFd0Rll7c0wG2bRX5khDdoim6vRjreL6W2DjDlayAy1YjaGhWYokqyutk73IOzVaheW1XeZ0AnteBOgJmr6Z6s0UwxlXl7PslbP6Qx4loHlacVY6KIySWE4WFqSSGJpxqrGGpjXmEVfzTlIRaDblUq6GKWgVfUzjvFnCcHxcBcUnj/qBYzn7K2R8MufEHAicyxPYLMfklzOKkroRYT0N/UHQQXFgG06YMvqgQmKU8B2ZoggOZMQwo9HIQyX5Y4n2kvTRRe2n2NRs7BinTvYOSepVW4FxRbmBF+8CKlAOz9B1KmFcz2V9WjZb7MWc6GSt/y4R+EssnD7oWbQPmiCALN9XZPaAFHPRoASOwBRxytIBCg+911sCJxDDLAQC0HxHnUd/cB0K8QUfiFVHTopKNY8iDpecH0DT4oAJppeKeftPnPKEwmgGP8tOvNuss8QabF5OSf1HGsKOYCAMGJxoJ5jQjqJissigF4m2GFSJGxtY6punAsDErztO95BzDDruRLjw+G8IEaASfNV+BGHYaSlcJdfmupGuUjxNYhjlFCsUH9t4Gr351KfTI9Dg73K00FS1uVCT1rzqnM7D1GjBZPSzbr5KgX8Pl7L8iZzLYUVWO4cJ60qlA7yEkjuxkX4MCm4DnVRYXm72H4f2dQ0SbvYdRWtmoMcJ2DZ9+yhuREYQ1IxLxnHvIAc88HeEpBG32XoVI2WoPm72H3Wz2tqS47FrIqFgJ0MKShBaW0JwHpoUlMMEy3bSw5J8Wlrxr4VBNCxEtLF1xLRxi+4UQ4f7rVzjSoE5FZ0bU6NutrjMj/uvMCG5f7M2uUmu26+QjGw+N3fI7G4/cdfLh647sGTtw8K57hQY0JZRqy9Zdat4Wpytvi/7xtnjZeDukxFskQE0TBahpuQDVe0bV0ncoS2VmVHPg+tcwuMsMyagOl3PbTOhVWF50CEtjG37tCKgLTbP8ZwDNfw6iKbwhhVUMqRSeWVsxeAIezd4T77JCZ1kA0BZwnw07rniuEs1SzY9YIMEyeW6HuZHyWVURH2EHJxTy3a7OjzgvF+L7DPiM0zAb+SDnR4Z8Oz/SPc3Ojwyi50cktjua1s1Zqte42SuLd38E4+JaDwehssINM7l3SWwmWe2fiIy4EZERjzQeRkVkFepSRxTM/CBocy0J9qonRk+7QMcm+HbzSHRgWF7jJCJbzk04b0DPAuLGuJJuMfgJZ7spGJDhyPCCiApMv5AqygWs4nEWqjxRMCtPvIX/g3ea2wvjCDsgLoqT+32TjoKd4wVvE5M8MjGpVw3SlScm9fDEJE80ManHVcZjmaDZ+MTEco6ZGTXTHMNIqKBENX6/R1VJc+z8QKiknzTBPw6Cu4wws1PQL3xWSZOd1F9YlYgZMaL+9XhlbKSQM1xyE6A8861op15DOXevxBnDgsc90U/C3rjB0RsL6147cUdQ5bmRpQrnpJpYTslLYL3jjKKArnvV49FSoZz7AnbGMMnSBCvcpDKmHKhVOV6rEGuA3SQLkivhXNhpjoBQiXLuT539fBIxIaAopUSH8pl+2dXVWoTA9pD5sgdUt6TH4DcLq1vKUd3SbjZpZkQb3BmuY+djBGUjeti2uQuYWdpflME7vNHrrifEIUPIKopmYt5sxH5pRKic+xoXSpjhhlxdnZeef+P7T1218nazFguXfqvc5uCxofTzz+z6yb8dned7Q21fG//uupd/8bJzQ5VJwNNIJSXvyUoT7CbPlXvQmkQygXCAL9IEB8KKN3y/pR4IG3J1obwEwgZagMjrtdL/gQfClsuLxBaFYSRkng2wWlTcjKX+2nM9uP/wLJ3/D6xAWA3lwb36McAPh9gB8X44Vs69bIK/hFaLhG6libGqCs5kDetZ7Bj7ExoSnxCOsgODwhg0gLNUEROdl8391DkpHAeIHcOJPQn+D85BTwLVOPlIKcH2C7keK8klN5hhxJ3OwsdBvgbgjxIXOFs168zX4Ccx65n7ODtO2c4ZbEsCP8OggyLJkTkERt8hCwNMBa56Ta9lRSOgN+ISNlGWL7ZnscpX16vvhwibw/mG/H4IQSU/ktABlIOIVQ5C7E/wo6j1owhCwQhlvGMpGYjoAzSkACraMT7zQtj3AMLZEGVDJtgNnt1um72jQc7t5lOqbjeIu5lYOZ83wbNSbheMzypOcqrTb2M7Ac70Oc8qMdOXW2o1hLP9fBPjVSH7M2qSBLyK1nD2vHFBB4xy3jzKnm/DLqAMY64Sc2kP2TP08aqDE1JkjtmhLqzNEE+uR+wT6nJ+LkjUm5h3fHCUSDQYchcNCnSd6RjS3qQ73HnEOhmp0vtCaWF7nMMkdxLAbVAJ96FQgu02QglLXGPJVLkIugzUn8RRi60S9QTBqCcoiHryKUzl0EARkksDHUpCYTobA4dioWvVNHnMr9zz07d+8In3tb7qeyJnzeff+7HU4ONP+N7QY8nvbfz6543/5HtD343946++/T9vPeV7Q/f+1ZJt/3LtP3eq5MCQe5IDmNkKYroRwlwDeIFDgqmnzvujfWJ/dB0fSSXVIqk6nlwMFBSLCGv/meHIbuE8Ov8eUx/fpjpJd4LeL7HdJeox4x/2Ui8r4aYQB54gMNClKrAnETcrRlE0P2OwzfL8iZbz49gCWwB1dkHZOCOCpKH3maL3Uc9zjxgYttUh6ygBpIZxEKmxzYWSSdiWSMz9oyYjPobM/a+EWbwCaptwVFuhBprKgusfHuu4l3NDMbqPYMyLsh3AehxBexxFZvujTv2taKaze5YfCjrFQaeScp7JzDawVkDkmU6b47tPwTdEmek1rDQJBbGNwIgJVoDBsD6JJHP90t2IXy53FN3IkfSgCXFUd/GZucHIyrQX/VFH0X/EHM4zbkR/D7no76mJ/gUiTG/Rf2b6i/4eR9H/S3M433Ej+rvJRX93TfQvEGF6i/53rojoI6IWVdh2GEdWfqLsaxBLBbtxEqqCo7wbJwHvxokT7cbBFF1l6s8QuLoB56ndR46NHzxw5PDK3eMTt584PvnmkcNnWAEPs/OT8JWScT62F10cmv+5qQv/AC4y7wNXcm80v/53wSxf5k7RyX/DyPott14UktAVA83EI0ptiBchf2WO8lW4q0FBV6fafLvwcsb8v3q++w9LJcaQwwNRc0C/dveWKRr7edFg7acpHHArYWRpJEKUqP7fxu7R4H/9xGyJRPUl4Zj6c7Tqa4V2LvYQv8jLWBr7TtpYuRCq0KTA3cFoNlV5owC8obwzAMhaxe0fhKofWFpOVF+w/D0JxQZTf04JyGNixTnypMqFvI0BRvWzirGzt22I207YB5eAPEAF0P4Bc0ddhSMJSBBV95EKEi+2JVXGlAedllRtG3dM5dxFuW2I2yoFBxEx34OIGBxERImCiBgaRMBp55joqKjpLuU9loFEdzoAYjFOWMKJR/hLsoLVaYXjHuBCH7iy4rwHWLymUrjTBF/srtdQj/gCxhHHj0L87qSgDFkfEu/3Neln2x3CREeRixdPc4SJlAvvNAnTDxMG6y64TTkmu01ZvG27MMRsqEK3ZMtPu2JwKGnZc6+44BrBF1wLa1ztiXY+CIYveUbwPdHIlhRLFsPgp6N8FiPmXxbDcMxi4Mf6sIsOEw65Brk9kXyONySW6KtNXXungusy4IyshQPyiMzyhqsjBpZLx4USf61zzdYIuNERUaZJg3WdszLF3SiTMBfG9ArJNiEb9ANWZbI4Kvg4j2/KFHJUpghyAGAPuvcO35Ydcpb9gNC/MZuVge+C9++asGwEskyERfP3wgGzN3ege5O5h0H2Pag/SA4DXzcOgju1BaF6yPdQPQSH6kGiUD3kRlUjKIEV8n0hNt8XCaMCHJQVGRcjHcXkLIRkYILQmbWoRI8MpaX0mIRjNPhoOOQYDSf4uNtw/Ei8qS6Bu+BJx/R+5wt1XW6rK5y8IlGeQRPlxWSiPB/XqmJuoryYbJTnAnIPplJxd6GoyrkT5numWdG+1sJp52ALLmKByPQk9LnpWMICOTVgkeko+/0VmLlE3ay/RuW2HqhIILJSHvMo03v8kukHnWXacCPTRrnw8BWx03Es45CUlmmLF56Wdho7gLIbzTbGMZMbgzNwWLKXay/GvqaQGDd8j7YN/xPjGG+CbiyKUrRtsNF2POwutxx1eUA9ymSXPS5Jrpr7qZa2v7kj5fshnScHF4+k9837gO8NRcJtf9L1+DuvcW7IZliUy9MItaKaeTftlYlvsXFG9QVbR+Kqq+/ilUfkBHAEXv2c9Fc/FANyh5cN1aXMULVZYIE7qYpk2JBirpHi4NJuTL1TEFRUcgk8zi/6vjAltv8f4H+X05wjAwA=",
-      "debug_symbols": "tb3djvQ2knZ7Lz7uAzEiGCT7VgaDhqfHMzBguAfu7g1sNPrev2RIwZVVRvLNynx94lq2q2JRP3wkUZT0rx/++6f/+uf//uXnX//nb3//4c//8a8f/uu3n3/55ef//csvf/vrj//4+W+/3v7rv3445j96+eHP+qcfuvzwZ7/90POHnT/qD3/utx9+/mjnj/7Dn8tx+znOn+NWpsjtZ7l+yvXzVqrY7addP+v106+f7frZr5/j/FmOI6EkSIImWEJN8ISWcBUuZf5VnTB/xyfM32kTesK4QI6EaR8TJEETLKEm3CqLTGgJPWFcoEdCSZAETbCEmpCVNStrVtasbLNymVASJEETLKEmzMo6oSX0C6olzP8112HtCVN62+zFj4SSMKVz9bomWMKU9gmeMCvPVec94VZZZ8ParbLO5Wpz35zNaJJwq6xz6zRLqAme0BJ6wrigHwmz8mzG3O912ueeb3Mp5r5v0z73d5vSucefMC6Y+/wJJUESNGH++Vxjcwc/YZwgcw8/oSRIgibMP7+tOpn7hrUJllATPGH+cp/QE8YFc984oSRIgiZYQk3whKxsWdmycs3KNSvXrFyzcs3KNSvXrFyzcs3KNSt7Vvas7FnZs7JnZc/KnpU9K3tW9qzcsnLLyi0rt6zcsnLLyi0rt6zcsnLLyj0r96zcs3LPyj0r96zcs3LPyj0r96w8svLIyiMrj6w8svLIyiMrj6w8svK4KutxJJQESdAES6gJntASekJWLlm5ZOWSlUtWLlm5ZOWSlUtWLlm5ZGXJypKVJStLVpasLFlZsrJkZcnKkpU1K2tW1qysWVmzsmZlzcrZBzX7oGYf1OyDmn1Qsw9q9kHNPqjZBzX7oGYf1OyDmn1Qsw9q9kHNPqjZBzX7oGYf1OyDmn1Qsw9q9kHNPqjZBzX7oGYf1OyDmn1Qsw9q9kHNPqjZBzX7oGYf1OyDmn1Qsw9q9kHNPqjZBzX7oGYf1OyDmn1Qsw9q9kHNPqjZBzX7oGYf1OhoY4IkaIIl1ARPaAk9YZxg0dECSoIkaIIl1ARPaAk9ISuXrFyycsnKJSuXrFyycsnKJSuXrFyysmRlycqSlSUrS1aWrCxZWbKyZGXJypqVNStrVtasrFlZs7JmZc3KmpU1K1tWtqxsWdmysmVly8qWlS0rW1a2rFyzcs3KNSvXrFyzcs3KNSvXrFyzcs3KnpU9K3tW9qzsWdmzsmdlz8qelT0rt6zcsnLLyi0rt6zcsnLLyi0rt6zcsnLPyj0r96zcs3LPyj0r96zcs3LPyj0rj6ycfdCyD1r2Qcs+aNkHLfugZR+07IOWfbBmH6zZB2v2wZp9sGYfrNkHa/bBmn2wZh+s2Qdr9sGafbBmH6zZB2v2wZp9sM6eUn3CrXKVCbfK9XY6V2e/qLcgqnM3dp0gCZpgCTXBE1pCTxgXzN34hKxcs3LNynM39mmfu/EJntASesK4YO7GJ5QESdCErDx3rXZM6AnjgrnbtLk25m7TZnvmbnNCS+gJ44K525xQEiRBEywhK4+sPLLyyMrjquzHkVASJEETLKEmeEJL6AlZuWTlkpVLVp67TbMJllATPKEl9IRxwYzuE0qCJGRlycqSlWc+t9tlss80bj5h/nKfYAk1wRNaQk8YF8w0PqEkSEJWtqxsWdmysmVly8qWlWtWrlm5ZuWalWtWrlm5ZuWalWtWrlnZs7JnZc/KnpU9K3tW9qzsWdmzsmfllpVnGrcxQRI0wRJqgie0hJ4wLphpfEJW7lm5Z+XZrfoxoSZ4wq1Ov113++wyXSbc/qrP/XB2mRNqgie0hJ4wTmizy5xQEiRBEyyhJszKNqEl9IRxwewyJ5QESdAES6gJWblk5ZKVZ5fpt129zS5zQkmQBE2whFnnFtRtnsn0PuH2V6NMkARNsISa4AktoSeMC2bfOSErW1a2rDz7zjgm1ARPaAk9YVwwe8qYK3z2izFXwuwXJ7SE+Vd1wrhg9osTSoIkaIIl1ARPaAlZ2bPy7BdjrszZL06QhFl5TLCEOeB2zMWYHeM2QjhpDuYdc4laXzSSZue4jRJOKovmiN4xt+TsH7cRw0lzTO+Yjl4X+aK2qC8aSTEEelJZJIt00XKM5RjLMZZjLMdIR48Rzxh3jQHOUibN3ytz9Hb2kJNmF7lotmUOgPbZSS7SRbaoLop6dY4Gx9/OIeAY/ZwDoj2GP0+yRXWRL2qL+qKRpMeicPRJskgXhWMuudZFvqgtmo45/Nhn3znJjkXXaU7PE6ieJ1A9TqBkQk3whJbQE8YFNUrPlV/LIlmki2xRXeSL2qK+aCT5cvhy+HL4cvhy+HL4cvhy+HL4crTlaMvRlqMtR1uOthxtOdpytOVoy9GXoy9HX46+HH05+nL05ejL0ZejL8dYjrEcYznGcozlGMsxlmMsx1iOkY5xHIvKIlmki2xRXeSL2qK+aDnKcpTlKMtRlqMsR1mOshxlOcpylOWQ5ZDlkOWQ5ZDlkOWQ5ZDlkOWQ5dDl0OXQ5dDl0OXQ5dDl0OXQ5dDlsOWw5bDlsOWwcMxbUVYX+aKWdPbkoPgLnVSTZm+s82e5fsr1M1oWN7RG0tmrgsoiWaSLbFFd5IvaouVoy9GXoy9HX46+HH05+nL05ejL0ZejL8dYjrEcYznGcozlGMsxlmMsx1iOkY7bUfwACyigggZW0MEGdhBbwVawFWwFW8FWsBVsBVvBVrAJNsEm2ASbYBNsgk2wCTbBptgUm2JTbIpNsSk2xabYFJthM2yGzbAZNsNm2AybYTNsFVvFVrFVbBVbxVaxVWwVW8Xm2BybY3Nsjs2xObbzCNwDOzgWRkjoESigglMRt0KPCIoLHZyKuDN6RFZcOBZGWlxYQAEVNLCCDmLr2Dq2gW1gG9gGtoFtYBvYBraBbSzbOVHgwgIKqKCBFXSwgR3EVrAVbAVbwVawFWwFW8FWsBVsgk2wCTbBJtgEm2ATbIJNsCk2xabYFJtiU2yKTbEpNsVm2AybYTNshs2wGTbDZtgMW8VWsVVsFVvFVrFVbBVbxVaxOTbH5tgcm2NzbI7NsTk2x9awNWwNW8PWsDVsDRtZUsiSQpYUsqSQJYUsKWRJIUsKWVLIkkKWFLKkkCWFLClkSSFLCllSyJJClhSypJAlhSwpZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZ5ZYYAfHwjNLPLCAAoatBxoYE/BKoIMN7OBYGFli50S5AsZEv2hvZElMm4ppM4lhq4EONjBsMX8vsuTEyJILwzYCBVTQwAo62MAOjkQ9JzCeWEABFTSwgssWM2lux7DAmMdYAuef1XMyYQUdbOBsZLXAsTBC4cICChi2Ghi2FlhBBxs4bR7tjVDwc37jtHnUjVC4cNrcA6dt3hssMccmcdpaFItQaGextjB67LxlVmJyTGnR3uixJ0aPvTCKhS36W4v2Rn87MfrbhQUUUEEDK+hgA7E5toatYWvYGraGrWFr2Bq2hq1h69g6to6tY+vYOraOrWPr2Dq2gW1gG9gGtoFtYBvYBraBbSxbzK5JLKCAChpYQQcb2EFsBVvBFsfueXuvxLybRAMr6GADOzhtPWb2Rje9sICau3JMwUmsoIMN7OBYGH3zwgIKiE2xKTbFptgUm2IzbIbNsBk2w2bYDJthM2yGrWKr2Cq2iq1iIypiCk8itoqtYnNsjs2xOTbH5tgcm2NzbI6tYWvYGraGrWFr2Bq2hq1ha9g6to6tY+vYIkDm/dUSk38SHZy2Hvt6BMiFY2EEyIhZ6hEgF8ZM/CNQQQNjPn50kQiQCxvYwZEYU4MSCyigggZW0MEGdhBbwVawFWwFW8FWsBVsBVvBVrAJNsEm2ASbYBNsgk2wCTbBptgUm2JTbIpNsSk2xabYFJthM2yGzbAZNsNm2AybYTNsFVvFVrFVbBVbxVaxVWwVW8Xm2BybY3Nsjs2xOTbH5tgcW8PWsDVsDVvD1rA1bA1bw9awdWwdW8fWsXVsHVvH1rF1bB3bwDawDWwD28BGllSypJIllSypZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJEljSxpZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJEljSxpZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJEljSxpZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLDmnDM6JluWcM3jhWHhmSQ0sYNjOp1YVNDBsI9DBBnZwJPYzS04soIAKGlhBBxvYQWwF20wNOeLJ2pkPMuds3rBNlMAOjoUzHxLLRAsUUEEDKxjXm9GGyIcLOxi2eb0ZsxITCyigggZW0MEGdhCbYTNshs2wGTbDZtgMm2EzbBVbxVaxVWwVW8VWsVVs8Uj4nEVb+vlQeOD5WPiJBRRQwWkrsWvEA+IXOjhtJXaYeEz8wrFw5kPitJXYYWY+JCpoYNSdvTAmKUq8JiBmKSYKGBWivd3ACkZ746ny3sAOjoUjbLH6RthiR5x9XuKZ/JixmGjgtMWj/jFpMbGBHRyJMXExsYACKmhgBR1sYNiOwLGwHGABBVTQwAo62EBsBVvkQ7yjIGYzJgqooIEVdLCBHRwLFdv59gYLFFBBB6PC3Eti0uLt5mlgAQVUMNrbAyvoYAM7OBZGn7+wgAIqiK1iq9gqtoqtYos+H+9wiFmSEpOXYqJk4rRpDTSwgg42sIPTFvchY5JlYgEFVNDACjrYwA5i69giH+L1ETHhMlHBsMV6iHy4cNrOV0JEPlzYwWm73hBxgAWcNos2RD5caGAFHWxgB8eFEjMwEwsooIIGVtDBBnYQW8FWsBVsBVvkQ7ysIGZgyrwBKjEDM7GBHRwLIx8uLKCAChqITbAJNsEm2BSbYlNsik2xKTbFptgUm2IzbIbNsBk2w2bYDJthM2yGrWKr2Cq2iq1iq9giS+aNa4kZmIlhk8CxMLLkwgKGLXaNyJIau0ZkyYUVdLCBHRwLI0vqCCxghrnEDMzECk6Fx1JEgFw4FfPZEokZmBdGgFw4FR4VIkAuVHDavAZW0MEGdnAsjAC5sIACKoht5AmRxFzLxKg713rMtUwsoIAKGljBWIoe2MAOhm1ugJhrmVjAsLVABQ2MkzILdLCBHRwL5QALKKCCBs66c3KCnC97unAsjFC4cNZtJVBABQ2ME+8THWxgB8fC86LixAIKGDf+NNDBBnZwLDxvoZ5YQAEVNBBbxVaxVWwVm2NzbI7NsTk2x+bYHJtjc2wNW8PWsDVsDVvD1rA1bA1bw9axdWwdW8fWsXVsHVvH1rF1bAPbwDawDWwD28A2sA1sA9tYtnP+5IUFFFBBAyvoYAM7iK1gK9gKtoKtYCvYCraCrWAr2CTnEMk5f/JCAaMfn2hgBWc/nnM7RM7UOLGDkRoz5eRMjRMLKKCCBlbQwQZ2EJthM2yGzbAZNsNm2AybYTNsFVvFVrFVbBVbxVaxVWwVW8Xm2BybY3Nsjs2xOTbH5tgcW8PWsDVsDVvD1rA1bA1bw9awdWwdW8fWsXVsHVvH1rF1bB3bwDawDWwD28A2sA1sA9vANpYt5k8mFlBABQ2soIMN7CC2gq1gK9gKtoKtYCvYCraCrWATbIJNsAk2wSbYBJtgE2xkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpZUsqSSJZUsqWRJJUsqWVLJkkqWVLKkkiWVLKlkSSVLKllSyZJKllSypJIllSypZEklSypZUsmSSpZUsqSSJZUsqWRJJUsqWVLJkkqWVLKkkiWVLKlkSSVLKllSyZJKllSypJIllSypZEklSypZUsmSSpZUsiSmicp8m5bENNHEAk7bnLwvMU00cdrm268kpokmOjhtvQZ2MGxzECqmiSYWMGwtUMGweWAFHQxbLFBkyYXTNidgS0wTTZy2EY2MLLlQwWkb0d7IkgsdbGAHx8LIkgsLKKCC2Dq2jq1j69g6tsiSEeshsuRCARUMWw+soIMN7ODNpnNOg8Q00cQCCqiggXWiBjrYwA6OheUACyigggZiK9hK2Cywg2OhhM0DCzhtJZZiZonO90xJTBNNrKCDDezgWDizJLGAAmJTbIpNsSk2xabYDJthM2yGzbAZNsNm2AybYavYKraKrWKr2Cq2iq1iq2GLzVLHQg9bCyyggApO25ycIDFNVCV2jZkliQ3s4Fh4vuX/xAJOW9xkiWmiiXPgrkbTY8D1wgZ2cCyMAdcLCyigggZi69g6to6tYxvYBraBbWAb2Aa2gW1gG9jGsp1zQy8soIAKGlhBBxvYQWwFW8FWsBVsBVvBVrAVbAVbwSbYBJtgE2yCTbAJNsEm2ASbYlNsik2xxdzQ+aCrnHNDL3Qwdvse2MGxMOaGxp3Mc27ohQLGbj8CDazgtM0nbOWcG3phB8fCuHlzYQEFVNDACmKr2Cq2is2xOTbH5tgcm2NzbI7NsTm2hq1ha9gatoatYWvYGraGrWHr2Dq2jq1j69g6to6tY+vYOraBbWAb2Aa2gW1gG9gGtoFtLNs5N/TCAgqooIEVdLCBHcRWsBVsBVvBVrAVbAVbwVawFWyCTbAJNsEm2ASbYBNsgk2wKTbFptgUm2JTbIpNsSk2xWbYDJthM2yGzbCRJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLOlkSSdLOlnSyZJOlnSypJMlnSzpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLOlkSSdLOlnSyZJOlnSypJMlnSzpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJJ0s6WdLJkkGWDLJkkCWDLBlkySBLBlkyyJJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmSQJYMsGWTJIEsGWTLIkkGWDLJkkCWDLBlkySBLBlkyyJJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmSQJYMsGWTJIEsGWTLIkkGWDLJkkCWDLBlkySBLBlkyyJJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmSQJYMsGWTJIEsGWTLIkkGWDLJkkCWDLBlkySBLBlkyyJJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmSQJYMsGWTJIEsGWTLIkkGWDLJkkCVjZYkeK0v0WFmix8oSPVaW6LGyRI+VJXqsLNFjZYkeK0v0OLAVbAVbwVawFWwFW8FWsBVsBZtgE2yCTbAJNsEm2ASbYBNsik2xxSCJnqiggWGTQAfnNc78Up/G/NTEsfDMEg8sYCxbDVTQwJieE+JzgtqJYdPADo6FMUiiUSEGSS4UUEEDK+hgAzs4Fjo2x+bYHJtjc2yOzbE5NsfWsDVsDVvD1rA1bPERRI0NEB89nDPVNaaf6nyBl8b000QDKzjba7EtZj4kdnAsnPmQOG0WO8zMh0QFp82ikTMfEh1sYAdHYkxKTSyggAoaWEEHG9hBbAVbwVawxSDqnLGvMSk1sYIONrCDY2EMol5YQAGxCTbBJtgEm2ATbIpNsSk2xabYFJtiU2yKTbEZNsNm2AybYTNshs2wGTbDVrFVbBVbxVaxVWwVW8VWsVVsjs2xOTbH5tgcm2NzbI7NsTVsDVvD1rA1bA1bw9awNWwNW8fWsXVsHVvH1rF1bB1bx9axDWwD28A2sA1sA9vANrANbGPZ5DjAAgqooIEVdLCBHcRWsBVsBRtZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImeWeGDYWqCDDezgSNQzS04soIAKGljBaZuPSWlMYE3s4LTVef4bE1gTCzht846CxgTWRAMr6GADOzgWRpZcWEBsgk2wCTbBJtgEm2BTbIpNsSk2xabYFJtiU2yKzbAZNsNm2AybYTNshs2wGbaKrWKr2Cq2iq1iq9gqtoqtYnNsjs2xOTbH5tgcm2NzbI6tYWvYGraGrWFr2Bq2hq1ha9g6to6tY+vYOraOrWPr2Dq2jm1gG9gGtoFtYBvYBrax+nHMRNX5uKPGTNTECjrYwA6OhWconFhAAbEVbAVbwVawFWwFm2ATbIJNsAk2wSbYBJtgE2yKTbEpNsWm2BSbYlNsik2xGTbDZtgMm2EzbIbNsBk2w1axVWwVW8VWsVVsFVvFVrFVbI7NsTk2x+bYHJtjc2yOzbE1bA1bw9awNWwNW8PWsDVsDVvH1rF1bB1bx9axdWwdW8fWsQ1sA9vANrANbAPbwBYnGHM+gcZM1MSRGDNREwsooILTNh9Q1piJmuhg2HpgB8fC82JFAwsooIIGVtDBBnZwLBRsgk2wCTbBJtgEm2ATbIJNsSk2xabYFJtiU2yKTbEpNsNm2AybYTNshs2wGTbDZtgqtoqtYqvYKraKrWKr2Cq2is2xOTbH5tgcm2NzbI7NsTm2hq1ha9gatoatYWvYGraGrWHr2Dq2jq1j69g6to6tY+vYOraBbWAb2Aa2gW1gG9gGtoFtLNs5E/XCAgqoYGSJBFbQwWmL4f5zJuqFY2FkyXzeX8+ZqBcKOG3znep6zkS9sIIONrCDY2FkyYUFFBCbYBNsgk2wCTbBptgiS+bUcD3nkfZYO8bCGwtvLHx0/wsNrOBszpzjrefk0Qs7OJszZ4nrOXn0wgIKqKCBFXSwgR3E5tii+/dob3T/CxU0sIIOhi1WX3T/C8fC6P4XFlBABQ2soIPYGrbo/vO14hrzSBMLOG0jNmx0/xYLH93/wgpO24g+FN3/wg6GLX43uv+FBRRQQQMr6GADO7hsMY80sYACKmhgBR1sYAexFWwFW8FWsBVsBVvBVrAVbAWbYBNsgk2wCTbBJtgEm2ATbIpNscWpxHxqQGMeaWLYWmAFHWzgzWbzFR4a80htzsLXmEeaWEABFTSwgj7RAhsYsT17QKtrNKmdFyAnKmhgBR2MurHEtYNjocdS9MC5FCUWc6ZGooIGVtDBBnZwLJypkYitYWthi/XQDKyggw3s4FjYD3CNEzRGJRqjEjFj1MqJFXSwgR0cC8cBFlBABbENbAPbwDawjWWLGaOJBRRQwbC1wAo62MCw9cCxsBxgAeMedvxZpMaFBlbQwQZ2cCyM1LgwlmIEGlhBB+dSzHcTaswNTRwLZz4kxszvEiigggZW0MEG9oWRBHKigAoaWEEHo73zoBYzO20+laExs9PmoxgaMzsTKxgVamADYz3EThB9/sTo8xdGe2NVR5+/UEEDK+hgA8MWu0b0+ROjz19YQAEVnGv9XOLo3ed6iN59IWsnerfElu8FFFBBA+dSxOSamMOZ2MAOTpuGLXr3hQWcNo0NEL37QgPDFtsieveFDQxbbPno3TFRJOZwWvSAmMNpMQ8k5nAmKhh1R2ADOzgWRj+O2SExL/PcuWJeZmIFHewLY6rUfIZJz2mXFyo4N2Hkzjnt8kIHG9jBsTCmSl1YQAFnI+dX7DQmWCY2sINz4WO6S0ywTCyggLEU8WcxKerCCjrYwA6OhTHB8sIC3urG+WbMpLwoluHEBnZwLIyuG3fJYiJlooAKGljBm22c1Bb1RSNpdtuLyiJZpItsUV0UbY/dITrsidFhLyxgtD22a3TYCw2s4K3tcX0S8yQv6otG0uysF5VFskgXxZqPbhZd8sIOjgstpkImFvBWdV5lWsyEvMgW1UW+qC2aLT+CRtLsoBeVRbJIF0XLe2C0MSrKARZw/r0E6SJbVBf5oraoLxpJs39eVBYthy6HLocuhy6HLocuhy5H9MoaixoHzwsNrOBcF/PwazFVMbGDY+HslYkFFFDBsEVz4kB7oYMNDJsGjoXRWy8soKxNc/bWEw2soIMN7CBbv7H145A6vyJpMSnR5rNzFpMSEx1sYCyFB46F0W8vLGCss9gDZ7/1k2xRXRSqaFYcZS/s4FgYR9kLCyigggZWEFt0aY/NE136wpEYsxcTCyigggZO25wwazF70earLy1mLyZ2MGxzPcTsxcQCCqiggRV0sIEdxBZRMF9naTF7MVFABQ2soIMNnLZmgWNhnFlfWEABFTSwgmGLdRYH8gs7OBbGgfzCAgqo4AzjMMzEuMgXtUV90UiKWGixOiMAIrZjLmLi/HMP6otG0uz9F5VFskgX2aK6aC54RH1MNrzdQJsYPfzCAgqooIEVnI2PiI3JhokdHAuj38+3YFhMNkwUUEEDK+hg2GK1Rtfv0X+i658YXf/CAgqooK1NMNgwgw0TXf/CDo7EmGyYWEABb3XnGa/FrMKL2qJYhBY4FkYP7/Hn0cMvFHAuwhy7tJhTmFjBuQhzRNNiTmFiB8fC6OEXTtsc7bKYU5iooIEVdLCBfWH05TleZueLLi0ofjUWOLrnhWNhdM/5vg2LCYGJ0bBYDdE9LzTw1rB6xGqYHTSxgR0cC+cRPbGAMrEEKmhgBR1sYM8F9igbK9oFVNDAKBv7iDvYwA7G0yGTzgeWgsoiWaSLbFFd5Emzr9QWG272lUQDZ+MiFmMyXWIDOzgSYzJdYgEFVNDACi5bTJCrkakxFa5Gb4v5b/lfZ3Mi+WL+W43civlvF879PrGAAipo4GxOBFvMf0tsYNg0MGxz48f8txqpE/Pf6nxPj8X8t6vpqiALNHtGjdOFmN524ewZiQUUUEEDK+hgA8MWTY+e4dH06BkXFlDAsMWyRc+4sIIONrCDY6EfYBSLFRV7fpwKxeS0GicnMTmteqyoVkABFXQw9snYNfoBxh4V27jHBohV0uN3Y5WMAyxgbMJYD2dvOdHAuuqeveX8rw3s4EiM9x2eSxzvO0wUUMG1bDGf7FygmE+WuJY4ZmLVI343ds8TY/e8sIDTVuLPYve80MAKzjbMwQmLOVd1viDIYs5VYgGjrgYqaGAFHWxgB8MW6yz21AsLKKCCBlbQwVDUwLEwds8LCyigggZW0MEGYnNsDVvs4BHQMdEqUUEDK+hgAzs4FkZnuJCN1QVU0MAK+sLoLSV2z+gtFwqoYBTrgdHI2PuiX1w4GzlH3C1mTCXOunO022LG1Pm7MWMq0cAKOtjADo6F5QALuJoe06QSK+hgy2WLCVFXBaFYHHHOBYojzoW2lk1outB0oelC04WmKzbFpqwoZUUpK0ppujawg2Ph2btj2YxiRrHox+cCRT++sK1lM5puNL3S9ErTK02v2Cq2yoqqrKjKiqooHIWjcBSOwlE4iujHcRofk5wSOzgWRj++sIACxpaXQAMr6Auj6817vBbzkhLjNDG2RW8LoxeevxC98EIBNTHmwlQ5MZo+cyfmwtR5k8diLkxiNL0FKmhgBR1sYAfHwtijLiwgNsNm2AzbuZ/1wLEw9p1548ZiskyigbPCvFtjMVkmcVaYd1UspsUkFlDAWXfezrGYFlPnM80W02ISHWxgB8MWGyB2mAsLGLbYLLHDnH/WsDVsDVvD1rBF8J8Ywa+xYSPiNdZk7GcXRt1Yk7GfXdjADo6FsfddWMBYiljrsfddaOC0WWyAOGM62xBHhgs7OBJjAkxiAQWcink7x2LWS513ayzmtySOhRH8FxZwFpv3PyzmtyQaWEEHG9jBsM0NEJNa6ryPYTGppc7bFBaTWhKjWCxFBH8M2cf0lcQoNldfTF9JLKCAChpYQQenLcbHY/pK4lgYPTYGumP6ytWc6LEXKmhgBR0MW6zqODJcGLZYUXFkuLCAAipoYAWnLYa0Y1JLYgfDFtsi+vzZhujzFwqooIEVDFtswujzF4Yttmb0+ROjz19YQAEVNDBssfqiz1/YwLDF1ow+f7Yh+vyFBRRQQQMryLJ1li2SwGN/iCQ4MZLgwgIKqKCBcQ0Z+1kkgR///veffvjlb3/98R8//+3Xv/zjt59++uHP/1r/4e8//Pk//vXD//3420+//uOHP//6z19++dMP/9+Pv/wzfunv//fjr/HzHz/+dvu/t6I//frft5+3gv/z8y8/Tfr3n/jr4/GflvlOu+vPy3yR2iox2oca5XGNmDcRFW6n4Ovvm374e3n89/F4Yfy9trr+vnwqsF2IPg8q50LMN1w8Wgjb1Gg1V+NtaFdohnwsUTfroczzx3NF3EbsVwl/tsBtKPyo2Qi/DWzetWJ8KNI2a1NWK+ajzA9asS0wR2bPAno8Wozxx66Htrbn7dxIH66Hstkt5/tKryLzfaUPmrGrUOLu1tmM2xXaqnAbw/1YQx/XqD0b4Ue9q3A8XcHnafVZQcZrFSx37dsp5eMKuzUR47PXmhB5vCa2a1MGNfRxjb6pMeK1PGeRcbtJ88rOVefLwq+d67Z3Pdy5ZBM58+NtuXPdbu/cLYx9rLHdQUXWDmryYFG2rYivip8Vbi163IpdjThbPmtUe1xju0pbXZv2djJ+PF6l9d3g2ld4Jrmk/aHR9XFV9IerYlekHZrNuPF4nH+63UX1WLuo3u+i/cUa4/0ad93tazVqWTX8eFxjc4SfL3nNGv3u2Hobk/5YY3eIj0/jnfuH3O3nv6vhu71U2c+rvFjDddXw/mKNSjt8vF+j2eMau+0yRkb6fLnbwxq2iVIvR0apl7tjy5e27egZprcxWHmthnIufLsF9dr66Gsfm68gfbw+Nu24jfDmacdtDLu/tE6rrROPG47Xtktb7biN7Yz3l0U32/bp/HicQXVX4xjrcF0ODpS3I/eHErsjfnxi5Sxxf4D6XTM2V0stbsBFjduh5u7s5VMJ3V1wlSwx35hwd8n1scRmJ52vuVydVuxhid1Rrhy2Tq9vK7Q+XJTdGo2HIq41WvvjNbqt0dgqbbNzPH/Ebo8P++PtPcx3l8KDC44ybteQDxvi2zXiY62Rfn9OWD/WkHfPbrfL0jifK+0+gn63LJs91Y8Vp1764w3ju1j3mnv7HIh8XGNzqBzFstPdLlw4ddBPe5lvTk9v90DyFOZ24+OuxvO7WKG/3DLx4S42tudRq+eXl/bR28gxnUXk8RVY2+yjY3XactyP1/QvbNZjHRXmrOHXdo2xriZvKK/ViLdiXGcNtb9U43ZFvY7Ws5u+1FXKsDXU0B63o+120crRump9rYZr9vvbDcvjxRpOjfZijbq6/Q3ttRpcddQuj6/k9h3GmhKEvbxYpTIAc7u50F6s0nyNzd0G1h/v8b2+Oyq2q/DcqNi2wlOjYtt1cdugayipa3m8XfrYnQe1g/Ogdnc+9mnE9Xj3YPuNVrB3zMHwR63YHPLHMXwd4h6PHO8qlLUct+Nlf+WkoccrLq5tYvXFvtIrt0V63Zw2DH93RGtf4amx+P7uiNYX1sVoL69RX1X8eDEJb3/ZqSKPj1ExIPDehvlGiWe2TDnsj900H1aH9pc3Tb2rMl6sMjgwjEN9s2n62/dLdiWevGGyLfH+sWHIasaN+9jcw5L3b2LJ9rhfnOO+jNeKOLdY2/1J2deKMDje3F/a5cddvg/bnGHuLnC/02Xy3XCOjP74MvnpISF9rUa8ieWsYVpeq3F/G6jKSzXmdybWpeGHgZT69G34vo41t3vh9vA2/G789GirhByP7+QX2d/HYU8t7KhaP6WI+K4lnTsf95frvyvSdjtI5R7fXYx8LrJbqWNdsstRdmtkc4LY1ra9XQE8uuwvstswbaxRpY8XDp+aoeX91bEtcrtYXhept6bctaR/oUhM7LmuMD9c+X+lSJPVkvbh+P25yNt3Tr9R4qnTGX373uk31sbaUW8Xy75ZG2N37La6Dt4frvw/FbFj15J1DlGORwPT+2bUNZfHa2kvLktdg4Z+21VeLrLOZup4da3WNSbjftiLe3uvjF/uipj/wUWentpj75+r2vvnqvb2uep+bTw7vWe/Sp+c37O7NfXsBJ/9gaavG0vzY5ab4922CDdjxu5oVf2PXpxh3OzvddOSzV7SnYGV+wj41I7dvYP5Dv5121DvUlG/UmQwY2A0fVxke6L53AFvX+KpA57r2we83dqY73dZdyDuT3d/tzbeP/z7+4d/b3/s2ohukCXGZm2M99fGeHtt7O5OPbk2dt1+fqdltcL6ayk2P7ex+uzRHhdp9gen2Hzrc7bEtb24OG3dAJ2vl3uxyFgn7vO1W68WWYMq8y1dmxU7vsNVZj++w1Vm/x6XVdt14ra6nn8Y8fq0TvpucsoaJta7Ha315yu0dUe23x3qfr86vsflf/8el//9O1z+l/1NyHXu/mG+c/3Ujl0mepG1bf3+4P9xmnDZ3aZ6cttum9HXudD9TarfNaPvH1BYs/Q+XP5/qcjtyLBu2t+dM/9+hdjbB6t9O1auzmfoN+3wP7jI09dU4/1rqvH+NdV4/5pqfI9rqvEdrqnk+B7XVLsI8TVM3T4cMuunduxCtRtj7ncTOdvnBx78/dvUcrR37zLvl2UodyG6PF6W3dH/WNd15XBWqnr9SpHGjZmj1fpwafZF7mZTtT5eK9LHeoTuGMfxWpFRBkWsvrJx5Di4iXA34PV545Q/uEY5DmHbHPZ40t+3yjg7ynHXf79cho183I1Yf7FMvNX4KnN/mfa7MrvHjkbLIuPudsLvdv1diaf7zzcWx+4Wp768cstgv5W7qUBfLCN3m1pa26zcP76McBErRXdbaVeEOVK33zteLKI8E3G7//tqEe4tan/cku1xsK2pq6Mfj4+D+1HwdYOyjnp3mWTtU5HtvXQmz384DB6fauj2FGUFdq36uMbmDLatZen39+Jbeb5EX/c4boOUmxLPLknbLIls75KuNTruHqz4XY3d2evQujZtO15sx4q1293a/rDG7vZVfMDnGlbsj1epbZ/qXxOK7cNE7+NTgthulhR3jfX+lu/vi+gfXKS04+5hgvvLcSufV+w2WW1l4nx+pW7KbFuja6e/cW2bMrtH9X2Nht0/fFc+b+bdnG+eBXK7f3Lud+3YPRLAE573DzT+rh3H7pp8XZK7bUJgN1fqGDzkdYyXOt/tkLfmKNw/1/25xvbxquc63/bxqsHY77h/FvHzVqnbxxt4WPW2al4tsq4d53vRN0Xa2/tH1bf3j2+cXK05Tje+u7D/3VnRbgbak8+p70s89aC6yx9a4rl7FN9apcI1hdydAfxulX7jqk/l7qrPXrx0NKJ5+MNLx91drKevP7/DrbDtANR68sRdXx3DYsKGPS6xu/Hz3Ei6NHl/JF2avj+SLruF+T63ODj8z8+uPrzFIW17Y6CyOB/m4316bcfuQsTGWhwb9+9N0vZ8kcrjs9XuW/KlIv3gpPfuadEvFXFZT877HN18WKS/PS9g346ypn3cRo9fXRiVdVKluinS7Y9dmPjUX57cjU07/I9tR10lbsGmm3b0t9uxL/HUQXMcbx80t2vD12NS3o9Np9s9KfVdijx7x0aGvXuc2bfjyXsl31iYJ++VjPb+vZJ9vitX8B/upn3O9zHeHuDR43h7gCcmmrw3wLMt8dwAz/NLshng2a7R5wZ4dHdr4dkBnn07nhrg0d0trOeuMXX3jNOzAzy6O+l+dmxGy/E9RkN094K550ZDti15fnH0/SEVLfbuJfN2H3nyknmM94dUtjWeG1LR3Xv/ntzdy3h/SEV3t5yeHVL5RpHnhlRU5O39o/R394/t/ObnLhD1ezxppd/jSSv9Hk9a7ec3S2Oy9tjM6N0Waeucan6K9sUig3w/Xi0yv+uVRT5OlfpYRHeDqt+lyLPnqrq71fTc7KJtiedmF+1LPDW7aL82njxj/sYqfe6MWXW8f8a8fTph8Ky0yP1t1U87yO6G1feoUfpaltsdb9kU2d7cGbwv4b7jiX4qsjv+P/VGj307hq3h7vHhuRH9SpHOPJgPY1VfKdKFB1A/vBngc5H+HQ4U2ztVzx4otm8CfPJAsV0nEnMVcl7EeLxO6nZ0ta7HaW7sjzrft4rwMLx7sYdFto9Lrbdn3s6wNzvb7mbTWGOApdy/Tad/YV+rx3ozcz3GeG2HtdGzJbV8eGzi89J8jx22fo8d1r/LDrt9REDuJvLIawErZc2bvA34blJ69+DV0yvW7Xus2PqHr1jmJcnYrNjtjavaVlNu7A878TeKdE4r+sMRUt2+H5DBb/EP71/6VKTtrpHiA5PXxYnfHTE+zZHSVt4faNndv3ryynN39+rpgZZm32Fkou1fU/rkJBjdjW8+PwnmG615etin9XeHfXbDT/MV2tkO1bux1k+fD9HdY1jeyrowGOXxrD7t5f0D4Lc6cb3rxPqoE3f9DknQ335Adt+FnxwF7/7+KPjuMawnR8F3JZ4cBX96SR6Pgn8jFJ8bBR/l7VHwbe9/OtDG9xhqHe8PtTZ5dyhtu12eHGrd13hyqHW8P9Q6vsNQqx3fYaj1G0WeG2q14/2h1vH2UOu3rtLWzIR5lfbo8Ro76h99qRcf/btWyIeHsPVTS3aTRmwNcVa7O25/nje2L6JcptXimyKbvfXZF3Pb7saRH+scz4/7mYVface6gr51mrJpx2Yv6WMNG/XhY1NkN4G1rkd97972OQcpnr6SL0UZfLpd8/mjcyrbTS9cXwG7e+TD9AsDrU/NovvGWO1Ts+js/bl89vZcvv37/dY1s9R+/wWdL7wjkIdAb2iv1ehcdvfhL9W4XUStmUCHPF6WIrud/MmXFW6LeFu76G1Mojwa+t6W6Gsc8LZO22sl1ot5vLeHb9XcbZXGYGR79Q2SH2rUF2sUasjmDZL69izAb5R4ZqKY7R5J+g4lnnxB8HZ9ruFhaT5e3CZ8HuX+225fq3HXjldr9HVEkV5frbEO09sa+5cDP5fnx9t5vn9T+roEG8Vee9d65bynPnrke/sG/adWxP4d/M+sh/03GtYJbf3wqsYvfStiUGOM12rw3b8Po69fq3H3MlB78dsZbU35rU1ebcca+6mtv7o+nGXZfBFy+10UW98jsXq8WIOPXlj18mKNFeXmu2947D//c/cCvs1Vxu45KuvHuo68/4Th7Zr9Y0Pau1cq+0V58kJld0vq6QuV7YngUxcq203b1uix9c378213P+rpbbu7H/Xstv1WS567lt1t3+e+MrUt8eTl8H5Rnt3LxnfYy3b3or7DXsYT/9bH41C23RhjlXXlVD88mfJ5UbbXK2t9eLt/p2B/flmG8tzR5vMq1up3WBb/Q5elHmu8tB7y2sGhlnVRXMuoL9agHUW+R43xYo11D/k2nPbih8jKuulaS315nXbWqb1YY6waUh5/pmr/fe272Qp2f/n08UEOe//5qW+UeOpa8v1Hn7Ylnnz0abc+ueEr6o+/NW7bm0/PvJp92wrjAxE2bNMKfT/Btk9OPZdg+6+3c8enSnm4LPsa671sUv3x+ti+o/rJr8iLvTuYtq3w1FjavsIzQ2nbpz+eGx3Qdy+Kv8OXincfp+rr84l9PL4NWHc3m27Lv27O+v1Hyj/dfKu7F/5559HRfv8V6t8V2c3sX6/4kruPDs33IT+5Rp89Od8+wbbOZ2/XCHcvX/v09qldCedDTvef6fpKiV75YmF9rRVjdVM5jvJKCTmEiVmmL7WC6QOl9dcWpA0+nlZeWpBy9yXbMl5rha7AuB1UXyyxpg4Uu/sixldKGB+SMylvt+LFEsZErNvJ48MSdfdklLVRuaS/O/Ebz+/hTLMZd834fMm3/xoe7we9f07kCyVGZfp+ba+VWN+K//CW0i+UkMOZun9/m+wLJeK293W+Ja+1wjgRt7sRlq+UqHwkrd59W+hLJXhvR727tPlSibu5E1VebAWnWneP27zaildL8DEvLy/t4PO5llWivrZRfQ3f3Y7sL7aCKdzej7cX5LUS2nlssHd7sQTjVMdLG/V2OsPELX+8Ouv22Ym381fH4NsKo722JOtdxDd8bQ8vBw8IHK/19mPdwLiVeK23l8K5vBwvLohT4v0FebHE3ZMf9zcsv1SirgvV4uPFEsyybMfbC/Jqic6LdcdrxyJho0rpL5Y4KDHeXZBXS9xdnN0/HPy7zNndTfoOmeNtBcZ9httRni+xrie03U27f7lEe6kEzyHo/cfkv1Si0Yq7g9FXSnDjRUd9bV30srbI/dsFXi0hr23Uvga2tJu8VmKdhev9mNKXSnQWpJfXStzNtx8vbtT1orfbtd5LrZBbH1+9/e5+65dKrAURuXvx3ecSdfsIk6wz4CL3j2P055sxCODxUj8TXY/73G40yGsl1h5+Q3+txLqhdxufry+W4CPW5m+XqK+24u7uwvFaCWddjPJ2Kz5v1P+8/euPf/35t7/88re//viPn//2699vf/nvWey3n3/8r19+uv71f/7561/v/u8//v//y//zX7/9/MsvP//vX/7vt7/99af//udvP81K8//9cFz/+I/b9XH7k7n4f/7phzL/vd+Gduw2Mn77d739+21gt435/+KXpY0/mXSb/+H6bbn99mH/+e/Z3P8H"
+      "bytecode": "H4sIAAAAAAAA/+2deXyUxRnHs9krySYkIRdyhPs+E07xAgIoCIKEiIoKa7KE1JDEZINEa3VVigetCUdt61khiCKeWLXaU/GoM9XW1hNrrfb0rEc92moHTfadfWdnsi/zY/vpZzZ/TXbe+T7z/vaZmWdm333WvaXjmrsa16ypXhusa1jVHKoO1a0PUdesjsieOc119fV1tRXB+vptaVsinbObm4NtB1yztrZ3bHl0UJr6z5XW4yVpiYFcKFA6CuRGgTwokBcF8qFAfhQoAwXKRIGyUKAACpSNAuWgQL1QoFwUKA8FykeBeqNABShQIQpUhAIVo0AlKFAfFOgIFKgvCtQPBeqPAg1AgUpRoIEo0CAUaDAKNAQFGooCDUOBhqNAI1CgkSjQKBRoNAo0BgUaiwKNQ4HGo0ATUKCJKNAkFKgMBSpHgSajQFNQoKko0DQUaDoKNAMFOhIFmokCHYUCHY0CHYMCHYsCHYcCzUKBZqNAc1CgChRoLgo0DwWajwIdjwKdgAItQIEWokAnokCLUKDFKNBJKNASFGgpCnQyCrQMBapEgZajQFUo0Cko0AoU6FQU6DQU6HQUaCUKdAYKdCYKdBYKtAoFWo0CBVGgs1GgahSoBgUKoUBrUKBaFGgtClSHAn0NBToHBapHgdahQA0oUCMK1IQCnYsCNaNALShQGAVqRYHWo0DnoUAbUKA2FOh8FOgCFOjrKNCFKNA3UKCLUCByMYwUgZEugZEuhZEug5E2wkjfhJE2wUiXw0hXwEhXwkhXwUibYaRvwUjfhpGuhpHaYaQOGGkLjLQVRtoGI22Hkb4DI10DI30XRvoejPR9GOlaGOk6GOl6GOkGGOlGGOkmGOkHMNLNMNIOGGknjNQJI+2CkW6BkXbDSLfCSLfBSHtgpNthpL0w0h0w0p0w0l0w0t0w0j0w0r0w0j4Y6T4Y6Ycw0v0w0gMw0oMw0o9gpIdgpIdhpB/DSD+BkX4KI/0MRvo5jPQLGOkRGOlRGGk/jPQYjPQ4jPQEjPQkjPRLGOkpGInASBRG+hWM9DSM9AyM9GsY6Tcw0rMw0m9hpN/BSM/BSM/DSC/ASC/CSC/BSC/DSAdgpFdgpN/DSK/CSH+AkV6Dkf4II70OI70BI/0JRvozjPQXGOmvMNLfYKS/w0hvwkhvwUhvw0jvwEjvwkjvwUj/gJHeh5E+gJE+hJE+gpH+CSN9DCN9AiN9CiN9BiP9C0b6N4z0HxjpcxjpCxSJ4jIwUVwOJorLwkRxeZgoLhMTxeViorhsTBSXj4niMjJRXE4misvKRHF5mSguMxPF5WaiuOxMFJefieIyNFFcjiaKy9JEcXmaKC5TE8XlaqK4bE0Ul6+J4jI2UVzOJorL2kRxeZsoLnMTxeVuorjsTRSXv4niMjhRXA4nisviRHF5nCgukxPF5XKiuGxOFJfPieIyOlFcTieKy+pEcXmdKC6zE8XldqK47E4Ul9+J4jI8UVyOJ4rL8kRxeZ4oLtMTxeV6orhsTxSX74niMj5RXM4nisv6RHF5nygu8xPF5X6iuOxPNJH8T5FdlXUNtfWhRJEJZIJq39re89dpXAdcs9Nc6W6P1+fPyMwKZOf0ys3L711QWFRc0ueIvv36DygdOGjwkKHDho8YOWr0mLHjxk+YOKmsfPKUqdOmzzhy5lFHH3PscbNmz6mYO2/+8ScsWHjiosUnLVl68rLK5VWnrDj1tNNXnnHmWatWB8+urgmtqV1b97Vz6tc1NDad29wSbl1/3oa28y/4+oXfuIhcTCLkEnIpuYxsJN8km8jl5ApyJbmKbCbfIt8mV5N20kG2kK1kG9lOvkOuId8l3yPfJ9eS68j15AZyI7mJ/IDcTHaQnaST7CK3kN3kVnIb2UNuJ3vJHeROche5m9xD7iX7yH3kh+R+8gB5kPyIPEQeJj8mPyE/JT8jPye/II+QR8l+8hh5nDxBniS/JE8RQij5FXmaPEN+TX5DniW/Jb8jz5HnyQvkRfISeZkcIK+Q35NXyR/Ia+SP5HXyBvkT+TP5C/kr+Rv5O3mTvEXeJu+Qd8l75B/kffIB+ZB8RP5JPiafkE/JZ+Rf5N/kP+Rz8gU7lWSniewUkJ3esVM3dlrGTrnY6RQ7VWKnQewUh52+sFMTdtrBTinY6QI7FWC7ebYLZ7tntutlu1W2y2S7Q7arY7sxtotiux+2a2G7DbZLYNE9i8pZNM2iYBa9sqiTRYssymPRGYuqWDTEohgWfbCoga32bJVmqytbFdlqxlYhtnqwWZ/N1myWZbMjm9XYbMRmETb62ahlo42NEubdzBvb25nfCinzD3imRzorGhtawlsju+bWsVfD6ZFbFjSEQ7Wh5h1Vk3te5lz29i5H7SMb7e3THLV3bYzsPJjqv4O6i6Kk3ctC9cEwuz23M9ZskeBxpkZa5PaDvakJhoMVjU1t0Zuay/eJg7O+c7deaRV4q7arqqxC91U3V5XZLlphFSzUtCm2q2qtgsJgnVWQGzzHKigMXmAVFAYvtApygxdZBYVBcjVXUpgkHVxJbpTwJZXZHVxJZbaTKynM3sKVVGbv50oqsw9yJYXZh7iSyuxTXElllnIlhdmnuZLK7KtcSWX2Na6kMPs6V1KZ/YArqcx+xJUUZj/mSgqzbLnhiwrDbEnii3LTbNXii0rj/fii0vgAvqgyPpAvKo1P5ItK42V8UWV8Ml9UGq/gi0rj8/iiyvjxfFFpfAVfVBo/jS+qjK/ki0rj5/BFpfF1fFFlvJEvKo1fxBeVxiN8UWX8Ur6oNH4ZX4wxLkQIzuKdtLnaMcbqyI7Fjeu38BFFNPQS2F5n7GBkz5y6hmBzG2u0pGl7FLxjdk3Nl7cftcRZ2LugoebLV/XCLxZKxhq3TETNi/ecLt6z32nMJhAynBIkHc8UO+7i+ykYDjgznGt3hSyFK2Q7Y+c5d4VsuStkgVwhW1Q0y3KFr9To+pcLtDNjazx8l2NqvPxb0b2xKJF1JiB2xss7UWdluLE5tIVncr3W9dtcbb91Harf7lzUGKzh7svHS504Uy1WJs/XFStPW6x0c8TK1xbLbY5YvbXF8pgjVoG2WF5zxCrUFsuXCkxSgUnSA5Oh2n7rN2eQD9MWK8McsYZri5VpjlgjtMXKMkeskdpiBcwRa5S2WNmpwCQVmCQ9MJmu7bc55gzyGdpi9TJHrCO1xco1R6yZ2mLlmSPWUdpi5Zsj1tHaYvVOBSapwCTpgcmJ2n5bYM4gX6QtVqE5Yi3WFqvIHLFO0har2ByxlmiLVWKOWEu1xeqTCkxSgUnSA5NV2n57hDmDfLW2WH3NESuoLVY/c8Q6W1us/uaIVa0t1gBzxKrRFqs0FZikApOkByYt2n470JxBHtYWa5A5YrVqizXYHLHWa4s1xByxztMWa6g5Ym3QFmtYKjBJBSZJD0w2afvtcHMG+eXaYo0wR6wrtMUaaY5YV2qLNcocsa7SFmu0OWJt1hZrTCowSQUmSQ9MrtX227HmDPLrtMUaZ45Y12uLNd4csW7QFmuCOWLdqC3WRHPEuklbrEmpwCQVmCQ9MLlT22/LzBnkd2mLVW6OWHdrizXZHLHu0RZrijli3ast1lRzxNqnLda0VGCSCkySHpg8ou23080Z5I9qizXDHLH2a4t1pDliPaYt1kxzxHpcW6yjzBHrCW2xjk4FJqnAJOmByfPafnuMOYP8BW2xjjVHrBe1xTrOHLFe0hZrljlivawt1mxzxDqgLdacVGCSCkySHpi8qe23FeYM8re0xZprjlhva4s1zxyx3tEWa745Yr2rLdbx5oj1nrZYJ6QCk1RgkvTA5Attv11gzCB36f8g1kJzxHJpi3WiOWKla4u1yByx3NpiLTZHLI+2WCelApNUYJLswMSl/4NYS8wZ5Po/iLXUHLGKtMU62RyxirXFWmaOWCXaYlWaI1YfbbGWpwKTVGCS9MBE/wexqswZ5KO0xTrFHLFGa4u1whyxxmiLdao5Yo3VFus0c8Qapy3W6anAJBWYJD0w0f9BrJXmDHL9H8Q6wxyxjtEW60xzxDpWW6yzzBHrOG2xVv3/iGVbm7neuO116d0LEHVdFl13hohiuZzJvVEkpDuTOy2yk91jU0f8+7A+xuzqfkXn/LpQfQ3DvlI9qXHT9tCnu1ee3L5h81q66LZK31vPTv2sc+3rTz788Pu7loXCrc0N8WMMvz3GcFvrc8xynWFdEPN6prXSxzWQtWveua3B+hbeRpTlj+xa2LquacGaKC6Lugd3+0/XSz6rWbcT2G374tvOsN9chhW/xG2QaW+QaTXYebCnzFX6duvZ5Tue/Mie+axXdbUNB1/Y/lDw/HCoelVruH5VbShcFa6rrwu3sbcuHNoQPpBWEtm7OLSusbmNGWoOtbTwjiqr8UhrvNIan7TGL63JkNZkSmuypDUBaU22tCZHWtNLWpMrrcmT1uRLa3pLawqkNYXSmiJpTbG0Ru4hfaQ1Rxx0rF2Vdeua6kNfTQv/b//FTJU9XjJtiiPmzqqy8hnqV3vuaXu7OMP3jc7BPU3ttkWon2Lz2N/ZspHvfPPYX7557AfaPPYXl/N+1lwq3PMAvQ2zxRHNDuDv2/Y2lPJ1EuTAOxaxsbZ8bbCBW8ji0UutxcxqTN3lYujCmZX++lapeCel4mI03n5H/a23O1G3sN4Vez/782+e3IOdG9J8+9PErvbjYcK7DNSklDdkD3QH8KGbExeV23PxlymEu7mqLIHRKgAGOh14AmGQM0Kcjc1gp3OOQBjijBDHA4c6I8R5Tm6YM0Kch8eGOyN4RcKIBPcEH4hNRzozHudAdZQzQoZIGO2MkCkSxjgjxDkZHOuMEBAJ45wRskXCeGeEHJEwwRmhl0iY6PR4vHtJWibMim5+9pTMip7d3ats7NTojtm4C+urh7pXRi2fIliOiXnslen86iHpljveSYe1h+T3fS8OtzZ+LaGDgVW4OVgdrmxrqK4IVq8NLWhYH6yvY2HkVnkYH7n1hFCwaXZzc7CN10++kUnfagtZO79q3BH7cl7cMDu6kZUf10hXMZ8ojC+xVcwX/21cHd1Pl2j4yMD48OooXBpveXYsbq2XcqW/ReZXO0j8RhliIz+/3Ve8IRkOOuLhl1gnR3k99T9LbJTJ34q9/xn8ecEh9X+Ig6703P9AvE+2FP3P5E81Dqn/Qx10pef+x/lkLqDqP3dz2YfW/2EOutJz/3PERtmq/nM3l3No/R/+P+2/h++/vdLPj/PEb86vmG19MZcJEyI7Y70kumhebN8tcafufaNXbYqP2aj9JTl26L28OXjw0Fs8pvAruhbgupZsRR08CBBwujFxfJYTOPwPAgSUDwLEBEH7Yg6/K4JNLa31TEf5WXTcgCfg2iIELGx/KwluXNsUAZWtpvuzE2mLwfIz8G2655hOnrPgOqSYDbMPxjW299wSt8vs3q/MfvnPkqZt/BhgIU/cpgGBG5CNcFUPAl09sF/il/movK9f+qD17wieoFjufA7ihqzExn/y7SXuNz6V3yQSBeQomUMEZnYCK3MvJXOowMzhmsqYuUrmMIHZi2sqY+YpmcMFZi7XVMbMVzIHCcw8rqmM2VvJHCkw87mmMmaBkjlKYPbmmsqYhUrmaIFZwDWVMYuUzDECs5BrKmMWK5ljBWYR11TGLFEyxwnMYq6pjNlHyRwvMEu4pjLmJCVzgsDswzWVMcuUzIkCcxLXVFgq+K2vZDXhdpeerktsEZpHEaGVOQuSCp1HaGXyCM0DitDK4m1+bI9qRmvK+a4JK095AitPuWiuXLGYlSew8Bw6MgeP7IVH5uKReXhkPh7ZG48swCML8cgiPLIYjyzBI/vgkZPwSB8emYlHevFI6QmyV7mIyLb5LdFtfnu7g414tCYQ/wjAW3CoG/H4hwQFie3FPcqTeekpulf5jEjM2b54jual7nejn08MEMIbr1Z44zvsB1C+wx/e+JyENzGnf8JA8CcwtpI6EKInUvGHgQs7DFy2qxQn1eIHppwnSj8w9Uk+o+PaxvuMzkfdn0fHwCDpl4s89oegPU6fleu2MdTuNj7ruefEj4x9mh/1eUUHzUhgPfEon5WXzlJ+5SzlVc9SfurJ5GYp1bNiPuXjWR4Hd+XWnnvdPc29nlzVXZXyza0nHLS8sG1j/EnWHTt0ul5Ns4zYn5V3U0+xMPlGJ2j+aVl5l17a/9Fz+xaWrxM/hun27O6nBDQN5ex/YMlrnzSNOOyG3shYOi/9vs0DD7uhZ/xvfvjUY7Xth93QvVPHzcw5dcTFPRuSfHHCLfnuR5yvZnAzmt3d2AwwsnsMeEbbv8wZNdV9xTTJFY4fwvQk+F0Nt9UgxnKW5JsrAdmM3/Vydhx5srgvhtjkyaaeqbY3IMNqZvvmSsC6JP63Zuw3lyVbabqB9gYB4WFhzwSZI3odxmld7vZfralWbBEpAQA=",
+      "debug_symbols": "tZjbbhs5DIbfxde50IEUqbxKERRu6hYGDCdwkwUWRd59xRn9tL2ABNdBb8zPh/lGB4qS5/fm++7b+8+v++OPl1+bxy+/N99O+8Nh//Pr4eV5+7Z/ObZPf2+CvWjIm8f80CJtHotF7rH0KD1qj3WNMfQYe0w95h67L3Zf7L7YfbH52GJdYwo9xh5Tj7lH6rH5xGLpUXrUHusac1gjt6gWm7dabJ4YDBjQTDEZCKCuvy2hx35taW2KZJABZrPuFAYUgNmsBUUBtYMEQAQkQAYQgAEFALPALDArzAqzwqwwK8wKs8KsMCvMCnOFucJcYa4wV7vKBqrWFWoIgPabFAwIwIB290QGAlBA7WDZtkIEtLtnu9wSbgUCMKCZczQQgAKaObe8r5Z3WQwiIAHMbI233FuBAc1M5rH0W0EBtYNl4AoRkAAZQAAGwJxhzjBnmAlmgplgJpgJZoKZYCaYCWaCmWFmmBlmhplhZphtBZENpq0gstlhMxeD2sHW0goRkAAZQAAGFIAAYC4wC8wCs8AsMAvMArPALDALzAKzwqwwK8wKs8KsMCvMCrPCrDBXmCvMFeYKc4W5wlxhrjBXmGs3xxCCk7lloeRkdl2InNipOLU7cFrICjUtVEG2HDtFp+SUncip3YN5oeJk91hatWwGK9k9lhYsG8JK0cnuURfKTuTETsVJnNTJtrBgZEu0U3RKTtmJnPqu0ag4iZM6WQUMHx8PG+y5X99Ou51tuRebcNuaX7en3fFt83h8PxweNv9sD+/Lj369bo9LfNue2rfNuTt+b7EJf+wPO6OPh/PVYXxpDKXEfnnjqq5oI3EliWMJpdIVROICyVfXp/H1mdGDLBcN0D/ohSTxXkhNw17QWMJqJX9xcDsYnBXMVwoeK1JJqStSoXMryu1tKOptKHXYhqmiEhRt97xLUVNwRb5LUTijI4WJ7lMw5rTl6FgRJ5kpAZkpcjGjUm8fCm8E18mExDxJ7xQxFjllGmTF3KAVhhxkZOC/aaDovaCY5c9zu7TyiPkMnMdDqZP5LNnn85yXdPMaL7FgcZTLqfiTtEx0VvBYkSZpGdvRBeWqnT7OY3ld8dKkZkaJKDVRRIaKSVbViEa0M8jF4tDbDV5qbA8fK2YlM1QvmTEM59R2mHH196obA8dxM2QyqyVHLzblPBot1a8dk+Qs6iuktH+aY0edDAexbyByYbgzMeo4MSbpmZIPRkqUR4qcpsW7ev2vdFcrYkHpbe0Zt2KyVon9YCLjvMizqpf8UEA5xIsZideOWX4mhSPmeOmgmx35XPmy5jRuh/5dR5TgG4llWhhmOU3Pa+RLpXHioWXelkx+dpXMMm7L7PBZzodPGs/NpB2kfkYglXBXX0h9V2m6Mu7JrJRm9CRxGvdktl4Ec8sUxnV0tmizYsklCvete4rk/bgo5/9TUP3suudJhuYakFq5PfMZzgfP/hYF8RNTqPFOR2F3yDjDOX82L6bjeVNeTM/yIfl2EMdnPy6fPcvPDEXEj25yMSHldoMmP8MqyV2G8wlU5crw1N5sn/enqwfxH6Y67bffDrv+9sf78fni27d/X/ENHuS/nl6ed9/fTzsznZ/mt5cv7YBUH9pfZH162LQHGF/aMDxoiE/2VGL5ulXU9lLsg7j+vrQPWJ8+rIH/AQ=="
     },
     {
       "name": "public_dispatch",
@@ -4121,16 +4012,90 @@
               "type": {
                 "fields": [
                   {
-                    "name": "message_ciphertext",
+                    "name": "messages",
                     "type": {
                       "fields": [
                         {
                           "name": "storage",
                           "type": {
                             "kind": "array",
-                            "length": 15,
+                            "length": 16,
                             "type": {
-                              "kind": "field"
+                              "fields": [
+                                {
+                                  "name": "ciphertext",
+                                  "type": {
+                                    "fields": [
+                                      {
+                                        "name": "storage",
+                                        "type": {
+                                          "kind": "array",
+                                          "length": 15,
+                                          "type": {
+                                            "kind": "field"
+                                          }
+                                        }
+                                      },
+                                      {
+                                        "name": "len",
+                                        "type": {
+                                          "kind": "integer",
+                                          "sign": "unsigned",
+                                          "width": 32
+                                        }
+                                      }
+                                    ],
+                                    "kind": "struct",
+                                    "path": "std::collections::bounded_vec::BoundedVec"
+                                  }
+                                },
+                                {
+                                  "name": "recipient",
+                                  "type": {
+                                    "fields": [
+                                      {
+                                        "name": "inner",
+                                        "type": {
+                                          "kind": "field"
+                                        }
+                                      }
+                                    ],
+                                    "kind": "struct",
+                                    "path": "aztec::protocol_types::address::aztec_address::AztecAddress"
+                                  }
+                                },
+                                {
+                                  "name": "tx_hash",
+                                  "type": {
+                                    "fields": [
+                                      {
+                                        "name": "_is_some",
+                                        "type": {
+                                          "kind": "boolean"
+                                        }
+                                      },
+                                      {
+                                        "name": "_value",
+                                        "type": {
+                                          "kind": "field"
+                                        }
+                                      }
+                                    ],
+                                    "kind": "struct",
+                                    "path": "std::option::Option"
+                                  }
+                                },
+                                {
+                                  "name": "anchor_block_timestamp",
+                                  "type": {
+                                    "kind": "integer",
+                                    "sign": "unsigned",
+                                    "width": 64
+                                  }
+                                }
+                              ],
+                              "kind": "struct",
+                              "path": "aztec::messages::processing::offchain::OffchainMessage"
                             }
                           }
                         },
@@ -4146,78 +4111,15 @@
                       "kind": "struct",
                       "path": "std::collections::bounded_vec::BoundedVec"
                     }
-                  },
-                  {
-                    "name": "message_context",
-                    "type": {
-                      "fields": [
-                        {
-                          "name": "tx_hash",
-                          "type": {
-                            "kind": "field"
-                          }
-                        },
-                        {
-                          "name": "unique_note_hashes_in_tx",
-                          "type": {
-                            "fields": [
-                              {
-                                "name": "storage",
-                                "type": {
-                                  "kind": "array",
-                                  "length": 64,
-                                  "type": {
-                                    "kind": "field"
-                                  }
-                                }
-                              },
-                              {
-                                "name": "len",
-                                "type": {
-                                  "kind": "integer",
-                                  "sign": "unsigned",
-                                  "width": 32
-                                }
-                              }
-                            ],
-                            "kind": "struct",
-                            "path": "std::collections::bounded_vec::BoundedVec"
-                          }
-                        },
-                        {
-                          "name": "first_nullifier_in_tx",
-                          "type": {
-                            "kind": "field"
-                          }
-                        },
-                        {
-                          "name": "recipient",
-                          "type": {
-                            "fields": [
-                              {
-                                "name": "inner",
-                                "type": {
-                                  "kind": "field"
-                                }
-                              }
-                            ],
-                            "kind": "struct",
-                            "path": "aztec::protocol_types::address::aztec_address::AztecAddress"
-                          }
-                        }
-                      ],
-                      "kind": "struct",
-                      "path": "aztec::messages::processing::message_context::MessageContext"
-                    }
                   }
                 ],
                 "kind": "struct",
-                "path": "SimulatedAccount::process_message_parameters"
+                "path": "SimulatedAccount::offchain_receive_parameters"
               }
             }
           ],
           "kind": "struct",
-          "path": "SimulatedAccount::process_message_abi"
+          "path": "SimulatedAccount::offchain_receive_abi"
         },
         {
           "fields": [
@@ -4268,175 +4170,95 @@
       "path": "std/aes128.nr",
       "source": "// docs:start:aes128\n// Given a plaintext as an array of bytes, returns the corresponding aes128 ciphertext (CBC mode). Input padding is performed using PKCS#7, so that the output length is `input.len() + (16 - input.len() % 16)`.\npub fn aes128_encrypt<let N: u32>(\n    input: [u8; N],\n    iv: [u8; 16],\n    key: [u8; 16],\n) -> [u8; N + 16 - N % 16] {\n    let padding_length = (16 - N % 16) as u8;\n    let mut padded_input: [u8; N + 16 - N % 16] = [0; N + 16 - N % 16];\n    for i in 0..N {\n        padded_input[i] = input[i];\n    }\n    for i in N..N + 16 - N % 16 {\n        padded_input[i] = padding_length;\n    }\n    let output = aes128_encrypt_padded_input(padded_input, iv, key);\n    output\n}\n\n#[foreign(aes128_encrypt)]\nfn aes128_encrypt_padded_input<let N: u32>(input: [u8; N], iv: [u8; 16], key: [u8; 16]) -> [u8; N] {}\n\n// docs:end:aes128\n"
     },
-    "111": {
+    "102": {
+      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/aztec.nr",
+      "source": "mod compute_note_hash_and_nullifier;\n\nuse crate::{\n    macros::{\n        calls_generation::{\n            external_functions::{generate_external_function_calls, generate_external_function_self_calls_structs},\n            internal_functions::generate_call_internal_struct,\n        },\n        dispatch::generate_public_dispatch,\n        emit_public_init_nullifier::generate_emit_public_init_nullifier,\n        internals_functions_generation::{create_fn_abi_exports, process_functions},\n        storage::STORAGE_LAYOUT_NAME,\n        utils::{is_fn_contract_library_method, is_fn_external, is_fn_internal, is_fn_test, module_has_storage},\n    },\n    messages::discovery::CustomMessageHandler,\n};\n\nuse compute_note_hash_and_nullifier::generate_contract_library_methods_compute_note_hash_and_nullifier;\n\n/// Configuration for the [`aztec`] macro.\n///\n/// This type lets users override different parts of the default aztec-nr contract behavior, such\n/// as message handling. These are advanced features that require careful understanding of\n/// the behavior of these systems.\n///\n/// ## Examples\n///\n/// ```noir\n/// #[aztec(aztec::macros::AztecConfig::new().custom_message_handler(my_handler))]\n/// contract MyContract { ... }\n/// ```\npub struct AztecConfig {\n    custom_message_handler: Option<CustomMessageHandler<()>>,\n}\n\nimpl AztecConfig {\n    /// Creates a new `AztecConfig` with default values.\n    ///\n    /// Calling `new` is equivalent to invoking the [`aztec`] macro with no parameters. The different methods\n    /// (e.g. [`AztecConfig::custom_message_handler`]) can then be used to change the default behavior.\n    pub comptime fn new() -> Self {\n        Self { custom_message_handler: Option::none() }\n    }\n\n    /// Sets a handler for custom messages.\n    ///\n    /// This enables contracts to process non-standard messages (i.e. any with a message type that is not in\n    /// [`crate::messages::msg_type`]).\n    ///\n    /// `handler` must be a `#[contract_library_method]` function that conforms to the\n    /// [`crate::messages::discovery::CustomMessageHandler`] type signature.\n    pub comptime fn custom_message_handler(_self: Self, handler: CustomMessageHandler<()>) -> Self {\n        Self { custom_message_handler: Option::some(handler) }\n    }\n}\n\n/// Enables aztec-nr features on a `contract`.\n///\n/// All aztec-nr contracts should have this macro invoked on them, as it is the one that processes all contract\n/// functions, notes, storage, generates interfaces for external calls, and creates the message processing\n/// boilerplate.\n///\n/// ## Examples\n///\n/// Most contracts can simply invoke the macro with no parameters, resulting in default aztec-nr behavior:\n/// ```noir\n/// #[aztec]\n/// contract MyContract { ... }\n/// ```\n///\n/// Advanced contracts can use [`AztecConfig`] to customize parts of its behavior, such as message\n/// processing.\n/// ```noir\n/// #[aztec(aztec::macros::AztecConfig::new().custom_message_handler(my_handler))]\n/// contract MyAdvancedContract { ... }\n/// ```\n#[varargs]\npub comptime fn aztec(m: Module, args: [AztecConfig]) -> Quoted {\n    let num_args = args.len();\n    let config = if num_args == 0 {\n        AztecConfig::new()\n    } else if num_args == 1 {\n        args[0]\n    } else {\n        panic(f\"#[aztec] expects 0 or 1 arguments, got {num_args}\")\n    };\n\n    // Functions that don't have #[external(...)], #[contract_library_method], or #[test] are not allowed in contracts.\n    check_each_fn_macroified(m);\n\n    // We generate new functions prefixed with `__aztec_nr_internals__` and we replace the original functions' bodies\n    // with `static_assert(false, ...)` to prevent them from being called directly from within the contract.\n    let functions = process_functions(m);\n\n    // We generate structs and their implementations necessary for convenient functions calls.\n    let interface = generate_contract_interface(m);\n    let self_call_structs = generate_external_function_self_calls_structs(m);\n    let call_internal_struct = generate_call_internal_struct(m);\n\n    // We generate ABI exports for all the external functions in the contract.\n    let fn_abi_exports = create_fn_abi_exports(m);\n\n    // We generate `_compute_note_hash`, `_compute_note_nullifier` (and the deprecated\n    // `_compute_note_hash_and_nullifier` wrapper) and `sync_state` functions only if they are not already implemented.\n    // If they are implemented we just insert empty quotes.\n    let contract_library_method_compute_note_hash_and_nullifier = if !m.functions().any(|f| {\n        // Note that we don't test for `_compute_note_hash` or `_compute_note_nullifier` in order to make this simpler\n        // - users must either implement all three or none.\n        // Down the line we'll remove this check and use `AztecConfig`.\n        f.name() == quote { _compute_note_hash_and_nullifier }\n    }) {\n        generate_contract_library_methods_compute_note_hash_and_nullifier()\n    } else {\n        quote {}\n    };\n    let process_custom_message_option = if config.custom_message_handler.is_some() {\n        let handler = config.custom_message_handler.unwrap();\n        quote { Option::some($handler) }\n    } else {\n        quote { Option::<aztec::messages::discovery::CustomMessageHandler<()>>::none() }\n    };\n\n    let offchain_inbox_sync_option = quote {\n        Option::some(aztec::messages::processing::offchain::sync_inbox)\n    };\n\n    let sync_state_fn_and_abi_export = if !m.functions().any(|f| f.name() == quote { sync_state }) {\n        generate_sync_state(process_custom_message_option, offchain_inbox_sync_option)\n    } else {\n        quote {}\n    };\n\n    if m.functions().any(|f| f.name() == quote { offchain_receive }) {\n        panic(\n            \"User-defined 'offchain_receive' is not allowed. The function is auto-injected by the #[aztec] macro. See https://docs.aztec.network/errors/7\",\n        );\n    }\n    let offchain_receive_fn_and_abi_export = generate_offchain_receive();\n\n    let (has_public_init_nullifier_fn, emit_public_init_nullifier_fn_body) = generate_emit_public_init_nullifier(m);\n    let public_dispatch = generate_public_dispatch(m, has_public_init_nullifier_fn);\n\n    quote {\n        $interface\n        $self_call_structs\n        $call_internal_struct\n        $functions\n        $fn_abi_exports\n        $contract_library_method_compute_note_hash_and_nullifier\n        $public_dispatch\n        $sync_state_fn_and_abi_export\n        $emit_public_init_nullifier_fn_body\n        $offchain_receive_fn_and_abi_export\n    }\n}\n\ncomptime fn generate_contract_interface(m: Module) -> Quoted {\n    let calls = generate_external_function_calls(m);\n\n    let module_name = m.name();\n\n    let has_storage_layout = module_has_storage(m) & STORAGE_LAYOUT_NAME.get(m).is_some();\n    let storage_layout_getter = if has_storage_layout {\n        let storage_layout_name = STORAGE_LAYOUT_NAME.get(m).unwrap();\n        quote {\n            pub fn storage_layout() -> StorageLayoutFields {\n                $storage_layout_name.fields\n            }\n        }\n    } else {\n        quote {}\n    };\n\n    let library_storage_layout_getter = if has_storage_layout {\n        quote {\n            #[contract_library_method]\n            $storage_layout_getter\n        }\n    } else {\n        quote {}\n    };\n\n    quote {\n        pub struct $module_name {\n            pub target_contract: aztec::protocol::address::AztecAddress\n        }\n\n        impl $module_name {\n            $calls\n\n            pub fn at(\n                addr: aztec::protocol::address::AztecAddress\n            ) -> Self {\n                Self { target_contract: addr }\n            }\n\n            pub fn interface() -> Self {\n                Self { target_contract: aztec::protocol::address::AztecAddress::zero() }\n            }\n\n            $storage_layout_getter\n        }\n\n        #[contract_library_method]\n        pub fn at(\n            addr: aztec::protocol::address::AztecAddress\n        ) -> $module_name {\n            $module_name { target_contract: addr }\n        }\n\n        #[contract_library_method]\n        pub fn interface() -> $module_name {\n            $module_name { target_contract: aztec::protocol::address::AztecAddress::zero() }\n        }\n\n        $library_storage_layout_getter\n\n    }\n}\n\n/// Generates the `sync_state` utility function that performs message discovery.\ncomptime fn generate_sync_state(process_custom_message_option: Quoted, offchain_inbox_sync_option: Quoted) -> Quoted {\n    quote {\n        pub struct sync_state_parameters {\n            pub scope: aztec::protocol::address::AztecAddress,\n        }\n\n        #[abi(functions)]\n        pub struct sync_state_abi {\n            parameters: sync_state_parameters,\n        }\n\n        #[aztec::macros::internals_functions_generation::abi_attributes::abi_utility]\n        unconstrained fn sync_state(scope: aztec::protocol::address::AztecAddress) {\n            let address = aztec::context::UtilityContext::new().this_address();\n            aztec::messages::discovery::do_sync_state(\n                address,\n                _compute_note_hash,\n                _compute_note_nullifier,\n                $process_custom_message_option,\n                $offchain_inbox_sync_option,\n                scope,\n            );\n        }\n    }\n}\n\n/// Generates an `offchain_receive` utility function that lets callers add messages to the offchain message inbox.\n///\n/// For more details, see `aztec::messages::processing::offchain::receive`.\ncomptime fn generate_offchain_receive() -> Quoted {\n    quote {\n        pub struct offchain_receive_parameters {\n            pub messages: BoundedVec<\n                aztec::messages::processing::offchain::OffchainMessage,\n                aztec::messages::processing::offchain::MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL,\n            >,\n        }\n\n        #[abi(functions)]\n        pub struct offchain_receive_abi {\n            parameters: offchain_receive_parameters,\n        }\n\n        /// Receives offchain messages into this contract's offchain inbox for subsequent processing.\n        ///\n        /// Each message is routed to the inbox scoped to its `recipient` field.\n        ///\n        /// For more details, see `aztec::messages::processing::offchain::receive`.\n        ///\n        /// This function is automatically injected by the `#[aztec]` macro.\n        #[aztec::macros::internals_functions_generation::abi_attributes::abi_utility]\n        unconstrained fn offchain_receive(\n            messages: BoundedVec<\n                aztec::messages::processing::offchain::OffchainMessage,\n                aztec::messages::processing::offchain::MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL,\n            >,\n        ) {\n            let address = aztec::context::UtilityContext::new().this_address();\n            aztec::messages::processing::offchain::receive(address, messages);\n        }\n    }\n}\n\n/// Checks that all functions in the module have a context macro applied.\n///\n/// Non-macroified functions are not allowed in contracts. They must all be one of\n/// [`crate::macros::functions::external`], [`crate::macros::functions::internal`] or `test`.\ncomptime fn check_each_fn_macroified(m: Module) {\n    for f in m.functions() {\n        let name = f.name();\n        if !is_fn_external(f) & !is_fn_contract_library_method(f) & !is_fn_internal(f) & !is_fn_test(f) {\n            // We  don't suggest that #[contract_library_method] is allowed because we don't want to introduce another\n            // concept\n            panic(\n                f\"Function {name} must be marked as either #[external(...)], #[internal(...)], or #[test]\",\n            );\n        }\n    }\n}\n"
+    },
+    "117": {
       "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::{create_authorize_once_check, get_abi_relevant_attributes},\n    utils::{\n        fn_has_allow_phase_change, fn_has_authorize_once, fn_has_noinitcheck, is_fn_initializer, is_fn_only_self,\n        is_fn_view, module_has_initializer, module_has_storage,\n    },\n};\nuse crate::protocol::meta::utils::derive_serialization_quotes;\nuse std::meta::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\n    // the Private Kernel Circuit. First we change the function signature so that it also receives\n    // `PrivateContextInputs`, which contain information about the execution context (e.g. the caller).\n    let original_params = f.parameters();\n\n    let original_params_quotes =\n        original_params.map(|(param_name, param_type)| quote { $param_name: $param_type }).join(quote {, });\n\n    let params = quote { inputs: aztec::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) = 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::PrivateContext::new(inputs, args_hash);\n            $storage_init\n            let self_address = context.this_address();\n            let call_self: CallSelf<&mut aztec::context::PrivateContext> = CallSelf { address: self_address, context: &mut context };\n            let enqueue_self: EnqueueSelf<&mut aztec::context::PrivateContext> = EnqueueSelf { address: self_address, context: &mut context };\n            let call_self_static: CallSelfStatic<&mut aztec::context::PrivateContext> = CallSelfStatic { address: self_address, context: &mut context };\n            let enqueue_self_static: EnqueueSelfStatic<&mut aztec::context::PrivateContext> = EnqueueSelfStatic { address: self_address, context: &mut context };\n            let internal: CallInternal<&mut aztec::context::PrivateContext> = CallInternal { context: &mut context };\n            aztec::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 = f\"Function {original_function_name} can only be called by the same contract\";\n        quote { assert(self.msg_sender() == 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\".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_allow_phase_change(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_allow_phase_change(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 #[allow_phase_change]\",\n            ); \n        }\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 = 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(quote { let $unused_return_value_name = $last_body_expr; }\n                .as_expr()\n                .unwrap());\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        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        $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::abis::private_circuit_public_inputs::PrivateCircuitPublicInputs {\n            $to_prepend\n            $body_quote\n            $to_append\n        }\n    }\n}\n"
+      "source": "use crate::macros::{\n    functions::initialization_utils::has_public_init_checked_functions,\n    internals_functions_generation::external::helpers::{create_authorize_once_check, get_abi_relevant_attributes},\n    utils::{\n        fn_has_allow_phase_change, fn_has_authorize_once, fn_has_noinitcheck, is_fn_initializer, is_fn_only_self,\n        is_fn_view, module_has_initializer, module_has_storage,\n    },\n};\nuse crate::protocol::meta::utils::derive_serialization_quotes;\nuse std::meta::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\n    // the Private Kernel Circuit. First we change the function signature so that it also receives\n    // `PrivateContextInputs`, which contain information about the execution context (e.g. the caller).\n    let original_params = f.parameters();\n\n    let original_params_quotes =\n        original_params.map(|(param_name, param_type)| quote { $param_name: $param_type }).join(quote {, });\n\n    let params = quote { inputs: aztec::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) = 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 `()`. ContractSelfPrivate\n        // requires a storage struct in its constructor. Using an Option type would lead to worse developer experience\n        // and higher 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::PrivateContext::new(inputs, args_hash);\n            $storage_init\n            let self_address = context.this_address();\n            let call_self: CallSelf<&mut aztec::context::PrivateContext> = CallSelf { address: self_address, context: &mut context };\n            let enqueue_self: EnqueueSelf<&mut aztec::context::PrivateContext> = EnqueueSelf { address: self_address, context: &mut context };\n            let call_self_static: CallSelfStatic<&mut aztec::context::PrivateContext> = CallSelfStatic { address: self_address, context: &mut context };\n            let enqueue_self_static: EnqueueSelfStatic<&mut aztec::context::PrivateContext> = EnqueueSelfStatic { address: self_address, context: &mut context };\n            let internal: CallInternal<&mut aztec::context::PrivateContext> = CallInternal { context: &mut context };\n            aztec::contract_self::ContractSelfPrivate::new(&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 = f\"Function {original_function_name} can only be called by the same contract\";\n        quote { assert(self.msg_sender() == 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\".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        let has_public_fns_with_init_check = has_public_init_checked_functions(f.module());\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_from_private_initializer(self.context, $has_public_fns_with_init_check); },\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_allow_phase_change(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_allow_phase_change(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 #[allow_phase_change]\",\n            ); \n        }\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 = 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(quote { let $unused_return_value_name = $last_body_expr; }\n                .as_expr()\n                .unwrap());\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        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        $authorize_once_check\n    };\n\n    let body_quote = body.map(|expr| expr.quoted()).join(quote { });\n\n    // `mark_as_initialized` is placed after the user's function body. If it ran at the beginning, the contract\n    // would appear initialized while the initializer is still running, allowing contracts called by the initializer\n    // to re-enter into a half-initialized contract.\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::abis::private_circuit_public_inputs::PrivateCircuitPublicInputs {\n            $to_prepend\n            $body_quote\n            $to_append\n        }\n    }\n}\n"
     },
-    "113": {
+    "119": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/internals_functions_generation/external/utility.nr",
-      "source": "use crate::macros::utils::module_has_storage;\n\npub(crate) comptime fn generate_utility_external(f: FunctionDefinition) -> Quoted {\n    // Initialize Storage if module has storage\n    let storage_init = if module_has_storage(f.module()) {\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    // Create utility context\n    let contract_self_creation = quote {\n        #[allow(unused_variables)]\n        let mut self = {\n            let context = aztec::context::UtilityContext::new();\n            $storage_init\n            aztec::ContractSelf::new_utility(context, storage)\n        };\n    };\n\n    // A quote to be injected at the beginning of the function body.\n    let to_prepend = quote {\n        aztec::oracle::version::assert_compatible_oracle_version();\n        $contract_self_creation\n    };\n\n    let original_function_name = f.name();\n    let fn_name = f\"__aztec_nr_internals__{original_function_name}\".quoted_contents();\n    let body = f.body();\n    let params = f.parameters().map(|(param_name, param_type)| quote { $param_name: $param_type }).join(quote {, });\n    let return_type = f.return_type();\n\n    quote {\n        #[aztec::macros::internals_functions_generation::abi_attributes::abi_utility]\n        unconstrained fn $fn_name($params) -> pub $return_type {\n            $to_prepend\n            $body\n        }\n    }\n}\n"
-    },
-    "123": {
-      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/nonce_discovery.nr",
-      "source": "use crate::messages::{discovery::ComputeNoteHashAndNullifier, logs::note::MAX_NOTE_PACKED_LEN};\n\nuse crate::protocol::{\n    address::AztecAddress,\n    constants::MAX_NOTE_HASHES_PER_TX,\n    hash::{compute_note_hash_nonce, compute_siloed_note_hash, compute_unique_note_hash},\n    logging::debug_log_format,\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\n    // hash, 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 new\n        // 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. TODO(#11157): handle failed\n        // 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 how\n            // to compute nullifiers. We simply trust it to have provided the correct one: if it hasn't, then PXE may\n            // fail to realize that a given note has been nullified already, and calls to the application could result\n            // in invalid transactions (with duplicate nullifiers). This is not a concern because an application\n            // 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                    // TODO: The None case will be handled in a followup PR.\n                    // https://linear.app/aztec-labs/issue/F-265/store-external-notes\n                    inner_nullifier: hashes.inner_nullifier.expect(\n                        f\"Failed to compute nullifier for note type {note_type_id}\",\n                    ),\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 notes\n            // 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, logs::note::MAX_NOTE_PACKED_LEN},\n        note::{\n            HintedNote,\n            note_interface::{NoteHash, NoteType},\n            note_metadata::SettledNoteMetadata,\n            utils::compute_note_hash_for_nullification,\n        },\n        oracle::random::random,\n        test::mocks::mock_note::MockNote,\n        utils::array,\n    };\n\n    use crate::protocol::{\n        address::AztecAddress,\n        hash::{compute_note_hash_nonce, compute_siloed_note_hash, compute_unique_note_hash},\n        traits::{FromField, Packable},\n    };\n\n    use super::attempt_note_nonce_discovery;\n\n    // This implementation could be simpler, but this serves as a nice example of the expected flow in a real\n    // implementation, and as a sanity check that the interface is sufficient.\n    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                HintedNote {\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 = 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 hinted_note = MockNote::new(value)\n            .contract_address(CONTRACT_ADDRESS)\n            .owner(OWNER)\n            .randomness(RANDOMNESS)\n            .storage_slot(STORAGE_SLOT)\n            .note_metadata(SettledNoteMetadata::new(note_nonce).into())\n            .build_hinted_note();\n        let note = hinted_note.note;\n\n        let note_hash = note.compute_note_hash(OWNER, STORAGE_SLOT, RANDOMNESS);\n        let unique_note_hash = compute_unique_note_hash(\n            note_nonce,\n            compute_siloed_note_hash(CONTRACT_ADDRESS, note_hash),\n        );\n        let inner_nullifier = note\n            .compute_nullifier_unconstrained(OWNER, compute_note_hash_for_nullification(hinted_note))\n            .expect(f\"Could not compute nullifier for note owned by {OWNER}\");\n\n        NoteAndData { note, note_nonce, note_hash, unique_note_hash, inner_nullifier }\n    }\n\n    #[test]\n    unconstrained fn single_note() {\n        let note_index_in_tx = 2;\n        let note_and_data = construct_note(VALUE, note_index_in_tx);\n\n        let mut unique_note_hashes_in_tx = BoundedVec::from_array([\n            random(), random(), random(), random(), random(), random(), random(),\n        ]);\n        unique_note_hashes_in_tx.set(note_index_in_tx, note_and_data.unique_note_hash);\n\n        let discovered_notes = attempt_note_nonce_discovery(\n            unique_note_hashes_in_tx,\n            FIRST_NULLIFIER_IN_TX,\n            compute_note_hash_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"
-    },
-    "124": {
-      "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        logs::partial_note::{decode_partial_note_private_message, MAX_PARTIAL_NOTE_PRIVATE_PACKED_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 crate::protocol::{\n    address::AztecAddress,\n    hash::sha256_to_field,\n    logging::debug_log_format,\n    traits::{Deserialize, Serialize},\n};\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) owner: AztecAddress,\n    pub(crate) storage_slot: Field,\n    pub(crate) randomness: Field,\n    pub(crate) note_completion_log_tag: Field,\n    pub(crate) note_type_id: Field,\n    pub(crate) packed_private_note_content: BoundedVec<Field, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN>,\n    pub(crate) recipient: AztecAddress,\n}\n\npub 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\n    // search for the public log that will complete it.\n    let (owner, storage_slot, randomness, note_completion_log_tag, note_type_id, packed_private_note_content) =\n        decode_partial_note_private_message(msg_metadata, msg_content);\n\n    let pending = DeliveredPendingPartialNote {\n        owner,\n        storage_slot,\n        randomness,\n        note_completion_log_tag,\n        note_type_id,\n        packed_private_note_content,\n        recipient,\n    };\n\n    CapsuleArray::at(\n        contract_address,\n        DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT,\n    )\n        .push(pending);\n}\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 = get_pending_partial_notes_completion_logs(contract_address, pending_partial_notes);\n\n    // Each entry in the maybe completion logs array corresponds to the entry in the pending partial notes array at the\n    // same index. This means we can use the same index as we iterate through the responses to get both the partial\n    // note and the log that might complete it.\n    assert_eq(maybe_completion_logs.len(), pending_partial_notes.len());\n\n    maybe_completion_logs.for_each(|i, maybe_log: Option<LogRetrievalResponse>| {\n        // We clear the completion logs as we read them so that the array is empty by the time we next query it.\n        // TODO(#14943): use volatile arrays to avoid having to manually clear this.\n        maybe_completion_logs.remove(i);\n\n        let pending_partial_note = pending_partial_notes.get(i);\n\n        if maybe_log.is_none() {\n            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\n            // get 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 simply\n            // delete the pending work entry, regardless of whether it was actually completed or not.\n            pending_partial_notes.remove(i);\n        }\n    });\n}\n"
-    },
-    "125": {
-      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/private_events.nr",
-      "source": "use crate::{\n    event::event_interface::compute_private_serialized_event_commitment,\n    messages::{\n        encoding::MAX_MESSAGE_CONTENT_LEN, logs::event::decode_private_event_message,\n        processing::enqueue_event_for_validation,\n    },\n};\nuse crate::protocol::{address::AztecAddress, traits::ToField};\n\npub unconstrained fn process_private_event_msg(\n    contract_address: AztecAddress,\n    recipient: AztecAddress,\n    msg_metadata: u64,\n    msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n    tx_hash: Field,\n) {\n    let (event_type_id, randomness, serialized_event) = decode_private_event_message(msg_metadata, msg_content);\n\n    let event_commitment =\n        compute_private_serialized_event_commitment(serialized_event, randomness, event_type_id.to_field());\n\n    enqueue_event_for_validation(\n        contract_address,\n        event_type_id,\n        randomness,\n        serialized_event,\n        event_commitment,\n        tx_hash,\n        recipient,\n    );\n}\n"
-    },
-    "126": {
-      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/private_notes.nr",
-      "source": "use crate::messages::{\n    discovery::{ComputeNoteHashAndNullifier, nonce_discovery::attempt_note_nonce_discovery},\n    encoding::MAX_MESSAGE_CONTENT_LEN,\n    logs::note::{decode_private_note_message, MAX_NOTE_PACKED_LEN},\n    processing::enqueue_note_for_validation,\n};\nuse crate::protocol::{address::AztecAddress, constants::MAX_NOTE_HASHES_PER_TX, logging::debug_log_format};\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_message(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 suspected the\n/// 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"
-    },
-    "127": {
-      "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::{PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID, PRIVATE_EVENT_MSG_TYPE_ID, PRIVATE_NOTE_MSG_TYPE_ID},\n    processing::MessageContext,\n};\n\nuse crate::protocol::{address::AztecAddress, logging::{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\n/// to search for the note's completion public log.\n///\n/// Events are processed by computing an event commitment from the serialized event data and its randomness field, then\n/// enqueueing the event data and commitment for validation.\npub unconstrained fn process_message_ciphertext<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"
+      "source": "use crate::macros::utils::{fn_has_noinitcheck, module_has_initializer, module_has_storage};\n\npub(crate) comptime fn generate_utility_external(f: FunctionDefinition) -> Quoted {\n    let module_has_initializer = module_has_initializer(f.module());\n\n    // Initialize Storage if module has storage\n    let storage_init = if module_has_storage(f.module()) {\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 `()`. ContractSelfUtility\n        // 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    // Create utility context\n    let contract_self_creation = quote {\n        #[allow(unused_variables)]\n        let mut self = {\n            let context = aztec::context::UtilityContext::new();\n            $storage_init\n            aztec::contract_self::ContractSelfUtility::new(context, storage)\n        };\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) {\n        quote {\n            aztec::macros::functions::initialization_utils::assert_is_initialized_utility(\n                self.context,\n            );\n        }\n    } else {\n        quote {}\n    };\n\n    // A quote to be injected at the beginning of the function body.\n    let to_prepend = quote {\n        aztec::oracle::version::assert_compatible_oracle_version();\n        $contract_self_creation\n        $init_check\n    };\n\n    let original_function_name = f.name();\n    let fn_name = f\"__aztec_nr_internals__{original_function_name}\".quoted_contents();\n    let body = f.body();\n    let params = f.parameters().map(|(param_name, param_type)| quote { $param_name: $param_type }).join(quote {, });\n    let return_type = f.return_type();\n\n    quote {\n        #[aztec::macros::internals_functions_generation::abi_attributes::abi_utility]\n        unconstrained fn $fn_name($params) -> pub $return_type {\n            $to_prepend\n            $body\n        }\n    }\n}\n"
     },
-    "128": {
-      "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::protocol::constants::PRIVATE_LOG_CIPHERTEXT_LEN;\nuse crate::utils::array;\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. Note: PRIVATE_LOG_CIPHERTEXT_LEN is an amount of\n// fields, 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. ciphertext_length (2) + 14\n// 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 Note: We multiply by 31 because ciphertext bytes are stored in fields using\n// bytes_to_fields, which packs 31 bytes per 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) * 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\n// each Field to 32 bytes. To convert the plaintext bytes back to fields, we divide by 32. 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\n/// into 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 the\n    // 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 the\n    // 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::{decode_message, encode_message, from_expanded_metadata, MAX_MESSAGE_CONTENT_LEN, to_expanded_metadata};\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"
+    "155": {
+      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/processing/offchain.nr",
+      "source": "use crate::{\n    capsules::CapsuleArray,\n    context::UtilityContext,\n    messages::{\n        encoding::MESSAGE_CIPHERTEXT_LEN,\n        processing::{get_message_contexts_by_tx_hash, MessageContext, OffchainMessageWithContext},\n    },\n    oracle::contract_sync::set_contract_sync_cache_invalid,\n    protocol::{\n        address::AztecAddress,\n        constants::MAX_TX_LIFETIME,\n        hash::sha256_to_field,\n        traits::{Deserialize, Serialize},\n    },\n};\n\n/// Base capsule slot for the persistent inbox of [`PendingOffchainMsg`] entries.\n///\n/// This is the slot where we accumulate messages received through [`receive`].\nglobal OFFCHAIN_INBOX_SLOT: Field = sha256_to_field(\"AZTEC_NR::OFFCHAIN_INBOX_SLOT\".as_bytes());\n\n/// Capsule array slot used by [`sync_inbox`] to pass tx hash resolution requests to PXE.\nglobal OFFCHAIN_CONTEXT_REQUESTS_SLOT: Field = sha256_to_field(\"AZTEC_NR::OFFCHAIN_CONTEXT_REQUESTS_SLOT\".as_bytes());\n\n/// Capsule array slot used by [`sync_inbox`] to read tx context responses from PXE.\nglobal OFFCHAIN_CONTEXT_RESPONSES_SLOT: Field = sha256_to_field(\"AZTEC_NR::OFFCHAIN_CONTEXT_RESPONSES_SLOT\".as_bytes());\n\n/// Capsule array slot used by [`sync_inbox`] to collect messages ready for processing.\nglobal OFFCHAIN_READY_MESSAGES_SLOT: Field = sha256_to_field(\"AZTEC_NR::OFFCHAIN_READY_MESSAGES_SLOT\".as_bytes());\n\n/// Maximum number of offchain messages accepted by `offchain_receive` in a single call.\npub global MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL: u32 = 16;\n\n/// Tolerance added to the `MAX_TX_LIFETIME` cap for message expiration.\nglobal TX_EXPIRATION_TOLERANCE: u64 = 7200; // 2 hours\n\n/// Maximum time-to-live for a tx-bound offchain message.\n///\n/// After `anchor_block_timestamp + MAX_MSG_TTL`, the message is evicted from the inbox.\nglobal MAX_MSG_TTL: u64 = MAX_TX_LIFETIME + TX_EXPIRATION_TOLERANCE;\n\n/// A function that manages offchain-delivered messages for processing during sync.\n///\n/// Offchain messages are messages that are not broadcasted via onchain logs. They are instead delivered to the\n/// recipient by calling the `offchain_receive` utility function (injected by the `#[aztec]` macro). Message transport\n/// is the app's responsibility. Typical examples of transport methods are: messaging apps, email, QR codes, etc.\n///\n/// Once offchain messages are delivered to the recipient's private environment via `offchain_receive`, messages are\n/// locally stored in a persistent inbox.\n///\n/// This function determines when each message in said inbox is ready for processing, when it can be safely disposed\n/// of, etc.\n///\n/// The only current implementation of an `OffchainInboxSync` is [`sync_inbox`], which manages an inbox with expiration\n/// based eviction and automatic transaction context resolution.\npub(crate) type OffchainInboxSync<Env> = unconstrained fn[Env](\n/* contract_address */AztecAddress, /* scope */ AztecAddress) -> CapsuleArray<OffchainMessageWithContext>;\n\n/// A message delivered via the `offchain_receive` utility function.\npub struct OffchainMessage {\n    /// The encrypted message payload.\n    pub ciphertext: BoundedVec<Field, MESSAGE_CIPHERTEXT_LEN>,\n    /// The intended recipient of the message.\n    pub recipient: AztecAddress,\n    /// The hash of the transaction that produced this message. `Option::none` indicates a tx-less message.\n    pub tx_hash: Option<Field>,\n    /// Anchor block timestamp at message emission.\n    pub anchor_block_timestamp: u64,\n}\n\n/// An offchain message awaiting processing (or re-processing) in the inbox.\n///\n/// Messages remain in the inbox until they expire, even if they have already been processed. This is necessary to\n/// handle reorgs: a processed message may need to be re-processed if the transaction that provided its context is\n/// reverted. On each sync, resolved messages are promoted to [`OffchainMessageWithContext`] for processing.\n#[derive(Serialize, Deserialize)]\nstruct PendingOffchainMsg {\n    /// The encrypted message payload.\n    ciphertext: BoundedVec<Field, MESSAGE_CIPHERTEXT_LEN>,\n    /// The intended recipient of the message.\n    recipient: AztecAddress,\n    /// The hash of the transaction that produced this message. A value of 0 indicates a tx-less message.\n    tx_hash: Field,\n    /// Anchor block timestamp at message emission. Used to compute the effective expiration: messages are evicted\n    /// after `anchor_block_timestamp + MAX_MSG_TTL`.\n    anchor_block_timestamp: u64,\n}\n\n/// Delivers offchain messages to the given contract's offchain inbox for subsequent processing.\n///\n/// Offchain messages are transaction effects that are not broadcasted via onchain logs. Instead, the sender shares the\n/// message to the recipient through an external channel (e.g. a URL accessible by the recipient). The recipient then\n/// calls this function to hand the messages to the contract so they can be processed through the same mechanisms as\n/// onchain messages.\n///\n/// Each message is routed to the inbox scoped to its `recipient` field, so messages for different accounts are\n/// automatically isolated.\n///\n/// Messages are processed when their originating transaction is found onchain (providing the context needed to\n/// validate resulting notes and events).\n///\n/// Messages are kept in the inbox until they expire. The effective expiration is\n/// `anchor_block_timestamp + MAX_MSG_TTL`.\n///\n/// Processing order is not guaranteed.\npub unconstrained fn receive(\n    contract_address: AztecAddress,\n    messages: BoundedVec<OffchainMessage, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL>,\n) {\n    // May contain duplicates if multiple messages target the same recipient. This is harmless since\n    // cache invalidation on the TS side is idempotent (deleting an already-deleted key is a no-op).\n    let mut scopes: BoundedVec<AztecAddress, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL> = BoundedVec::new();\n    let mut i = 0;\n    let messages_len = messages.len();\n    while i < messages_len {\n        let msg = messages.get(i);\n        let tx_hash = if msg.tx_hash.is_some() {\n            msg.tx_hash.unwrap()\n        } else {\n            0\n        };\n        let inbox: CapsuleArray<PendingOffchainMsg> =\n            CapsuleArray::at(contract_address, OFFCHAIN_INBOX_SLOT, msg.recipient);\n        inbox.push(\n            PendingOffchainMsg {\n                ciphertext: msg.ciphertext,\n                recipient: msg.recipient,\n                tx_hash,\n                anchor_block_timestamp: msg.anchor_block_timestamp,\n            },\n        );\n        scopes.push(msg.recipient);\n        i += 1;\n    }\n\n    set_contract_sync_cache_invalid(contract_address, scopes);\n}\n\n/// Returns offchain-delivered messages to process during sync.\n///\n/// Messages remain in the inbox and are reprocessed on each sync until their originating transaction is no longer at\n/// risk of being dropped by a reorg.\npub unconstrained fn sync_inbox(\n    contract_address: AztecAddress,\n    scope: AztecAddress,\n) -> CapsuleArray<OffchainMessageWithContext> {\n    let inbox: CapsuleArray<PendingOffchainMsg> = CapsuleArray::at(contract_address, OFFCHAIN_INBOX_SLOT, scope);\n    let context_resolution_requests: CapsuleArray<Field> =\n        CapsuleArray::at(contract_address, OFFCHAIN_CONTEXT_REQUESTS_SLOT, scope);\n    let resolved_contexts: CapsuleArray<Option<MessageContext>> =\n        CapsuleArray::at(contract_address, OFFCHAIN_CONTEXT_RESPONSES_SLOT, scope);\n    let ready_to_process: CapsuleArray<OffchainMessageWithContext> =\n        CapsuleArray::at(contract_address, OFFCHAIN_READY_MESSAGES_SLOT, scope);\n\n    // Clear any stale ready messages from a previous run.\n    ready_to_process.for_each(|i, _| { ready_to_process.remove(i); });\n\n    // Clear any stale context resolution requests/responses from a previous run.\n    context_resolution_requests.for_each(|i, _| { context_resolution_requests.remove(i); });\n    resolved_contexts.for_each(|i, _| { resolved_contexts.remove(i); });\n\n    // Build a request list aligned with the inbox indices.\n    let mut i = 0;\n    let inbox_len = inbox.len();\n    while i < inbox_len {\n        let msg = inbox.get(i);\n        context_resolution_requests.push(msg.tx_hash);\n        i += 1;\n    }\n\n    // Ask PXE to resolve contexts for all requested tx hashes.\n    get_message_contexts_by_tx_hash(\n        contract_address,\n        OFFCHAIN_CONTEXT_REQUESTS_SLOT,\n        OFFCHAIN_CONTEXT_RESPONSES_SLOT,\n        scope,\n    );\n\n    assert_eq(resolved_contexts.len(), inbox_len);\n\n    let now = UtilityContext::new().timestamp();\n\n    let mut j = inbox_len;\n    while j > 0 {\n        // This loop decides what to do with each message in the offchain message inbox. We need to handle 3\n        // different scenarios for each message.\n        //\n        // 1. The TX that emitted this message is still not known to PXE: in this case we can't yet process this\n        // message, as any notes or events discovered will fail to be validated. So we leave the message in the inbox,\n        // awaiting for future syncs to detect that the TX became available.\n        //\n        // 2. The message is not associated to a TX to begin with. The current version of offchain message processing\n        // does not support this case, but in the future it will. Right now, a message without an associated TX will\n        // sit in the inbox until it expires.\n        //\n        // 3. The TX that emitted this message has been found by PXE. That gives us all the information needed to\n        // process the message. We add the message to the `ready_to_process` CapsuleArray so that the `sync_state` loop\n        // processes it.\n        //\n        // In all cases, if the message has expired (i.e. `now > anchor_block_timestamp + MAX_MSG_TTL`), we remove it\n        // from the inbox.\n        //\n        // Note: the loop runs backwards because it might call `inbox.remove(j)` to purge expired messages and we also\n        // need to align it with `resolved_contexts.get(j)`. Going from last to first simplifies the algorithm as\n        // not yet visited element indexes remain stable.\n        j -= 1;\n        let maybe_ctx = resolved_contexts.get(j);\n        let msg = inbox.get(j);\n\n        // Compute the message's effective expiration timestamp to determine if we can purge it from the inbox.\n        let effective_expiration = msg.anchor_block_timestamp + MAX_MSG_TTL;\n\n        // Message expired. We remove it from the inbox.\n        if now > effective_expiration {\n            inbox.remove(j);\n        }\n\n        // Scenario 1: associated TX not yet available. We keep the message in the inbox, as it might become\n        // processable as new blocks get mined.\n        // Scenario 2: no TX associated to message. The message will sit in the inbox until it expires.\n        if maybe_ctx.is_none() {\n            continue;\n        }\n\n        // Scenario 3: Message is ready to process, add to result array. Note we still keep it in the inbox unless we\n        // consider it has expired: this is because we need to account for reorgs. If reorg occurs after we processed\n        // a message, the effects of processing the message get rewind. However, the associated TX can be included in\n        // a subsequent block. Should that happen, the message must be re-processed to ensure consistency.\n        let message_context = maybe_ctx.unwrap();\n        ready_to_process.push(OffchainMessageWithContext { message_ciphertext: msg.ciphertext, message_context });\n    }\n\n    ready_to_process\n}\n\nmod test {\n    use crate::{\n        capsules::CapsuleArray, oracle::random::random, protocol::address::AztecAddress,\n        test::helpers::test_environment::TestEnvironment,\n    };\n    use super::{\n        MAX_MSG_TTL, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL, OFFCHAIN_INBOX_SLOT, OffchainMessage, PendingOffchainMsg,\n        receive, sync_inbox,\n    };\n\n    unconstrained fn setup() -> (TestEnvironment, AztecAddress) {\n        let mut env = TestEnvironment::new();\n        let scope = env.create_light_account();\n        (env, scope)\n    }\n\n    /// Creates an `OffchainMessage` with dummy ciphertext and the given scope as recipient.\n    fn make_msg(recipient: AztecAddress, tx_hash: Option<Field>, anchor_block_timestamp: u64) -> OffchainMessage {\n        OffchainMessage { ciphertext: BoundedVec::new(), recipient, tx_hash, anchor_block_timestamp }\n    }\n\n    /// Advances the TXE block timestamp by `offset` seconds and returns the resulting timestamp.\n    unconstrained fn advance_by(env: TestEnvironment, offset: u64) -> u64 {\n        env.advance_next_block_timestamp_by(offset);\n        env.mine_block();\n        env.last_block_timestamp()\n    }\n\n    #[test]\n    unconstrained fn empty_inbox_returns_empty_result() {\n        let (env, scope) = setup();\n        env.utility_context(|context| {\n            let result = sync_inbox(context.this_address(), scope);\n            let inbox: CapsuleArray<PendingOffchainMsg> =\n                CapsuleArray::at(context.this_address(), OFFCHAIN_INBOX_SLOT, scope);\n\n            assert_eq(result.len(), 0);\n            assert_eq(inbox.len(), 0);\n        });\n    }\n\n    #[test]\n    unconstrained fn tx_bound_msg_expires_after_max_msg_ttl() {\n        let (env, scope) = setup();\n        let anchor_ts = advance_by(env, 10);\n\n        env.utility_context(|context| {\n            let mut msgs: BoundedVec<OffchainMessage, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL> = BoundedVec::new();\n            msgs.push(make_msg(scope, Option::some(random()), anchor_ts));\n            receive(context.this_address(), msgs);\n        });\n\n        // Advance past anchor_ts + MAX_MSG_TTL.\n        let _now = advance_by(env, MAX_MSG_TTL + 1);\n\n        env.utility_context(|context| {\n            let address = context.this_address();\n            let result = sync_inbox(address, scope);\n            let inbox: CapsuleArray<PendingOffchainMsg> = CapsuleArray::at(address, OFFCHAIN_INBOX_SLOT, scope);\n\n            assert_eq(result.len(), 0); // context is None, not ready\n            assert_eq(inbox.len(), 0); // expired, removed\n        });\n    }\n\n    #[test]\n    unconstrained fn tx_bound_msg_not_expired_before_max_msg_ttl() {\n        let (env, scope) = setup();\n        let anchor_ts = advance_by(env, 10);\n\n        env.utility_context(|context| {\n            let mut msgs: BoundedVec<OffchainMessage, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL> = BoundedVec::new();\n            msgs.push(make_msg(scope, Option::some(random()), anchor_ts));\n            receive(context.this_address(), msgs);\n        });\n\n        // Advance, but not past anchor_ts + MAX_MSG_TTL.\n        let _now = advance_by(env, 100);\n\n        env.utility_context(|context| {\n            let address = context.this_address();\n            let result = sync_inbox(address, scope);\n            let inbox: CapsuleArray<PendingOffchainMsg> = CapsuleArray::at(address, OFFCHAIN_INBOX_SLOT, scope);\n\n            assert_eq(result.len(), 0); // context is None, not ready\n            assert_eq(inbox.len(), 1); // not expired, stays\n        });\n    }\n\n    #[test]\n    unconstrained fn tx_less_msg_expires_after_max_msg_ttl() {\n        let (env, scope) = setup();\n        let anchor_ts = advance_by(env, 10);\n\n        env.utility_context(|context| {\n            let mut msgs: BoundedVec<OffchainMessage, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL> = BoundedVec::new();\n            msgs.push(make_msg(scope, Option::none(), anchor_ts));\n            receive(context.this_address(), msgs);\n        });\n\n        // Advance past anchor_ts + MAX_MSG_TTL.\n        let _now = advance_by(env, MAX_MSG_TTL + 1);\n\n        env.utility_context(|context| {\n            let address = context.this_address();\n            let result = sync_inbox(address, scope);\n            let inbox: CapsuleArray<PendingOffchainMsg> = CapsuleArray::at(address, OFFCHAIN_INBOX_SLOT, scope);\n\n            assert_eq(result.len(), 0); // context is None, not ready\n            assert_eq(inbox.len(), 0); // expired, removed\n        });\n    }\n\n    #[test]\n    unconstrained fn unresolved_tx_stays_in_inbox() {\n        let (env, scope) = setup();\n        let anchor_ts = advance_by(env, 10);\n\n        env.utility_context(|context| {\n            let mut msgs: BoundedVec<OffchainMessage, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL> = BoundedVec::new();\n            msgs.push(make_msg(scope, Option::some(random()), anchor_ts));\n            receive(context.this_address(), msgs);\n        });\n\n        let _now = advance_by(env, 100);\n\n        env.utility_context(|context| {\n            let address = context.this_address();\n            let result = sync_inbox(address, scope);\n            let inbox: CapsuleArray<PendingOffchainMsg> = CapsuleArray::at(address, OFFCHAIN_INBOX_SLOT, scope);\n\n            assert_eq(result.len(), 0); // not resolved, not ready\n            assert_eq(inbox.len(), 1); // not expired, stays\n        });\n    }\n\n    #[test]\n    unconstrained fn multiple_messages_mixed_expiration() {\n        let (env, scope) = setup();\n        let anchor_ts = advance_by(env, 10);\n\n        let survivor_tx_hash = random();\n\n        env.utility_context(|context| {\n            let address = context.this_address();\n            let mut msgs: BoundedVec<OffchainMessage, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL> = BoundedVec::new();\n            // Message 0: tx-bound, anchor_ts in the past so it expires at\n            // anchor_ts + MAX_MSG_TTL. We set anchor to 0 so it expires quickly.\n            msgs.push(make_msg(scope, Option::some(random()), 0));\n            // Message 1: tx-bound, anchor_ts is recent so it survives.\n            msgs.push(make_msg(scope, Option::some(survivor_tx_hash), anchor_ts));\n            // Message 2: tx-less, anchor_ts=0 so it also expires.\n            msgs.push(make_msg(scope, Option::none(), 0));\n            receive(address, msgs);\n        });\n\n        // Advance past MAX_MSG_TTL for anchor_ts=0, but not for anchor_ts=anchor_ts.\n        let _now = advance_by(env, MAX_MSG_TTL);\n\n        env.utility_context(|context| {\n            let address = context.this_address();\n            let result = sync_inbox(address, scope);\n            let inbox: CapsuleArray<PendingOffchainMsg> = CapsuleArray::at(address, OFFCHAIN_INBOX_SLOT, scope);\n\n            assert_eq(result.len(), 0); // all contexts are None\n            // Message 0 expired (anchor=0), message 1 survived (anchor=anchor_ts),\n            // Message 2 expired (anchor=0).\n            assert_eq(inbox.len(), 1);\n            assert_eq(inbox.get(0).tx_hash, survivor_tx_hash);\n        });\n    }\n\n    // -- Resolved context (ready to process) ------------------------------\n\n    #[test]\n    unconstrained fn resolved_msg_is_ready_to_process() {\n        let (env, scope) = setup();\n        // TestEnvironment::new() deploys protocol contracts, creating blocks with tx effects.\n        // In TXE, tx hashes equal Fr(blockNumber), so Fr(1) is the tx effect from block 1.\n        // We use this as a \"known resolvable\" tx hash.\n        let known_tx_hash: Field = 1;\n        let anchor_ts = advance_by(env, 10);\n\n        env.utility_context(|context| {\n            let mut msgs: BoundedVec<OffchainMessage, MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL> = BoundedVec::new();\n            msgs.push(make_msg(scope, Option::some(known_tx_hash), anchor_ts));\n            receive(context.this_address(), msgs);\n        });\n\n        let _now = advance_by(env, 100);\n\n        env.utility_context(|context| {\n            let address = context.this_address();\n            let result = sync_inbox(address, scope);\n            let inbox: CapsuleArray<PendingOffchainMsg> = CapsuleArray::at(address, OFFCHAIN_INBOX_SLOT, scope);\n\n            // The message should be ready to process since its tx context was resolved.\n            assert_eq(result.len(), 1);\n\n            let ctx = result.get(0).message_context;\n            assert_eq(ctx.tx_hash, known_tx_hash);\n            assert(ctx.first_nullifier_in_tx != 0, \"resolved context must have a first nullifier\");\n\n            // Message stays in inbox (not expired) for potential reorg reprocessing.\n            assert_eq(inbox.len(), 1);\n        });\n    }\n}\n"
     },
-    "129": {
-      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/encryption/aes128.nr",
-      "source": "use crate::protocol::{\n    address::AztecAddress,\n    constants::{DOM_SEP__SYMMETRIC_KEY, DOM_SEP__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, HEADER_CIPHERTEXT_SIZE_IN_BYTES,\n            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, get_arr_of_size__message_bytes_padding__from_PT,\n        },\n    },\n    oracle::{aes128_decrypt::aes128_decrypt_oracle, random::random, shared_secret::get_shared_secret},\n    utils::{\n        array,\n        conversion::{\n            bytes_to_fields::{bytes_from_fields, bytes_to_fields},\n            fields_to_bytes::{fields_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/// Computes N close-to-uniformly-random 256 bits from a given ECDH shared_secret.\n///\n/// NEVER re-use the same iv and sym_key. DO NOT call this function more than once with the same shared_secret.\n///\n/// This function is only known to be safe if shared_secret is computed by combining a random ephemeral key with an\n/// address point. See big comment within the body of the function. See big comment within the body of the function.\nfn extract_many_close_to_uniformly_random_256_bits_from_ecdh_shared_secret_using_poseidon2_unsafe<let N: u32>(\n    shared_secret: Point,\n) -> [[u8; 32]; N] {\n    /*\n     * Unsafe because of https://eprint.iacr.org/2010/264.pdf Page 13, Lemma 2 (and the * two\n    paragraphs below it).\n    *\n    * If you call this function, you need to be careful and aware of how the arg\n    * `shared_secret` has been derived.\n    *\n    * The paper says that the way you derive aes keys and IVs should be fine with poseidon2\n    * (modelled as a RO), as long as you _don't_ use Poseidon2 as a PRG to generate the * two\n    exponents x & y which multiply to the shared secret S:\n    *\n    * S = [x*y]*G.\n    *\n    * (Otherwise, you would have to \"key\" poseidon2, i.e. generate a uniformly string K\n    * which can be public and compute Hash(x) as poseidon(K,x)).\n    * In that lemma, k would be 2*254=508, and m would be the number of points on the * grumpkin\n    curve (which is close to r according to the Hasse bound).\n    *\n    * Our shared secret S is [esk * address_sk] * G, and the question is: * Can we compute hash(S)\n    using poseidon2 instead of sha256?\n    *\n    * Well, esk is random and not generated with poseidon2, so that's good.\n    * What about address_sk?\n    * Well, address_sk = poseidon2(stuff) + ivsk, so there was some\n    * discussion about whether address_sk is independent of poseidon2.\n    * Given that ivsk is random and independent of poseidon2, the address_sk is also\n    * independent of poseidon2.\n    *\n    * Tl;dr: we believe it's safe to hash S = [esk * address_sk] * G using poseidon2,\n    * in order to derive a symmetric key.\n    *\n    * If you're calling this function for a differently-derived `shared_secret`, be\n    * careful.\n    *\n    */\n    \n\n    /* The output of this function needs to be 32 random bytes.\n     * A single field won't give us 32 bytes of entropy.\n    * So we compute two \"random\" fields, by poseidon-hashing with two different\n    * generators.\n    * We then extract the last 16 (big endian) bytes of each \"random\" field.\n    * Note: we use to_be_bytes because it's slightly more efficient. But we have to\n    * be careful not to take bytes from the \"big end\", because the \"big\" byte is\n    * not uniformly random over the byte: it only has < 6 bits of randomness, because\n    * it's the big end of a 254-bit field element.\n    */\n\n    let mut all_bytes: [[u8; 32]; N] = std::mem::zeroed();\n    // We restrict N to be < 2^8, because of how we compute the domain separator from k below (where k <= N must be 8\n    // bits). In practice, it's extremely unlikely that an app will want to compute >= 256 ciphertexts.\n    std::static_assert(N < 256, \"N too large\");\n    for k in 0..N {\n        // We augment the domain separator with the loop index, so that we can generate N lots of randomness.\n        let k_shift = (k << 8);\n        let separator_1 = k_shift + DOM_SEP__SYMMETRIC_KEY;\n        let separator_2 = k_shift + DOM_SEP__SYMMETRIC_KEY_2;\n\n        let rand1: Field = poseidon2_hash_with_separator([shared_secret.x, shared_secret.y], separator_1);\n        let rand2: Field = poseidon2_hash_with_separator([shared_secret.x, shared_secret.y], separator_2);\n\n        let rand1_bytes: [u8; 32] = rand1.to_be_bytes();\n        let rand2_bytes: [u8; 32] = rand2.to_be_bytes();\n\n        let mut bytes: [u8; 32] = [0; 32];\n        for i in 0..16 {\n            // We take bytes from the \"little end\" of the be-bytes arrays:\n            let j = 32 - i - 1;\n            bytes[i] = rand1_bytes[j];\n            bytes[16 + i] = rand2_bytes[j];\n        }\n\n        all_bytes[k] = bytes;\n    }\n\n    all_bytes\n}\n\nfn derive_aes_symmetric_key_and_iv_from_uniformly_random_256_bits<let N: u32>(\n    many_random_256_bits: [[u8; 32]; N],\n) -> [([u8; 16], [u8; 16]); N] {\n    // Many (sym_key, iv) pairs:\n    let mut many_pairs: [([u8; 16], [u8; 16]); N] = std::mem::zeroed();\n    for k in 0..N {\n        let random_256_bits = many_random_256_bits[k];\n        let mut sym_key = [0; 16];\n        let mut iv = [0; 16];\n        for i in 0..16 {\n            sym_key[i] = random_256_bits[i];\n            iv[i] = random_256_bits[i + 16];\n        }\n        many_pairs[k] = (sym_key, iv);\n    }\n\n    many_pairs\n}\n\npub fn derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_poseidon2_unsafe<let N: u32>(\n    shared_secret: Point,\n) -> [([u8; 16], [u8; 16]); N] {\n    let many_random_256_bits: [[u8; 32]; N] =\n        extract_many_close_to_uniformly_random_256_bits_from_ecdh_shared_secret_using_poseidon2_unsafe(shared_secret);\n\n    derive_aes_symmetric_key_and_iv_from_uniformly_random_256_bits(many_random_256_bits)\n}\n\npub struct AES128 {}\n\nimpl MessageEncryption for AES128 {\n    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. (This process is then\n        // reversed when processing the message in `process_message_ciphertext`)\n        let plaintext_bytes = fields_to_bytes(plaintext);\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) TODO (#17158): Currently we unwrap the Option returned\n        // by derive_ecdh_shared_secret. We need to handle the case where the ephemeral public key is invalid to\n        // 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. We could simply fail, but that'd introduce a potential security issue in\n                    // which an attacker forces a contract to encrypt a message for an invalid address, resulting in an\n                    // impossible transaction - this is sometimes called a 'king of the hill' attack. We choose instead\n                    // to not fail and encrypt the plaintext regardless using the shared secret that results from a\n                    // random valid address. The sender is free to choose this address and hence shared secret, but\n                    // this has no security implications as they already know not only the full plaintext but also the\n                    // ephemeral private key anyway.\n                    unsafe { random_address_point() },\n                )\n                .inner,\n        );\n        // TODO: also use this shared secret for deriving note randomness.\n\n        // ***************************************************************************** Convert the plaintext into\n        // whatever format the encryption function expects\n        // *****************************************************************************\n\n        // Already done for this strategy: AES expects bytes.\n\n        // ***************************************************************************** Encrypt the plaintext\n        // *****************************************************************************\n\n        // It is safe to call the `unsafe` function here, because we know the `shared_secret` was derived using an\n        // AztecAddress (the recipient). See the block comment at the start of this unsafe target function for more\n        // info.\n        let pairs = derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_poseidon2_unsafe::<2>(\n            ciphertext_shared_secret,\n        );\n        let (body_sym_key, body_iv) = pairs[0];\n        let (header_sym_key, header_iv) = pairs[1];\n\n        let ciphertext_bytes = aes128_encrypt(plaintext_bytes, body_iv, body_sym_key);\n\n        // |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)) = 16 + 16 * (|full_pt| // 16) = 16 * (1 +\n        // |full_pt| // 16)\n        std::static_assert(\n            ciphertext_bytes.len() == 16 * (1 + (PlaintextLen * 32) / 16),\n            \"unexpected ciphertext length\",\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 input, according to pkcs#7; hence why\n        // the output `header_ciphertext_bytes` is 16 bytes larger than the input in this case.\n        let header_ciphertext_bytes = aes128_encrypt(header_plaintext, header_iv, header_sym_key);\n        // 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        // ***************************************************************************** Prepend / append more bytes of\n        // data to the ciphertext, before converting back 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 interest of the executor of this fn\n        // 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 + header_ciphertext_bytes.len() + ciphertext_bytes.len() + message_bytes_padding_to_mult_31.len()\n                == message_bytes.len(),\n            \"unexpected message length\",\n        );\n        assert(offset == message_bytes.len(), \"unexpected encrypted message length\");\n\n        // ***************************************************************************** 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\n        // function should cover a full field.\n        let message_bytes_as_fields = bytes_to_fields(message_bytes);\n\n        // ***************************************************************************** Prepend / append fields, to\n        // create the final message *****************************************************************************\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\n            // message (all the \"real\" message fields contain at most 31 bytes because of the way we convert the bytes\n            // to fields). 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\n            // reveal its 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\n            // work with messages with unknown length at compile time. This would not be necessary here as the header\n            // ciphertext length is fixed. But we do it anyway to not have to have duplicate oracles.\n            let header_ciphertext_bvec =\n                BoundedVec::<u8, HEADER_CIPHERTEXT_SIZE_IN_BYTES>::from_array(header_ciphertext);\n\n            // Decrypt header\n            let header_plaintext = aes128_decrypt_oracle(header_ciphertext_bvec, header_iv, header_sym_key);\n\n            // Extract ciphertext length from header (2 bytes, big-endian)\n            let ciphertext_length = ((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\n            // 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::{encoding::MESSAGE_PLAINTEXT_LEN, encryption::message_encryption::MessageEncryption},\n        test::helpers::test_environment::TestEnvironment,\n    };\n    use crate::protocol::{address::AztecAddress, traits::FromField};\n    use super::{AES128, random_address_point};\n    use std::{embedded_curve_ops::EmbeddedCurveScalar, test::OracleMock};\n\n    #[test]\n    unconstrained fn encrypt_decrypt_deterministic() {\n        let env = TestEnvironment::new();\n\n        // Message decryption requires oracles that are only available during private execution\n        env.private_context(|_| {\n            let plaintext = [1, 2, 3];\n\n            let recipient = AztecAddress::from_field(\n                0x25afb798ea6d0b8c1618e50fdeafa463059415013d3b7c75d46abf5e242be70c,\n            );\n\n            // Mock random values for deterministic test\n            let eph_sk = 0x1358d15019d4639393d62b97e1588c095957ce74a1c32d6ec7d62fe6705d9538;\n            let _ = OracleMock::mock(\"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\n            // length at compile time. For this reason we need to convert the original input to a BoundedVec.\n            let plaintext_bvec = BoundedVec::<Field, MESSAGE_PLAINTEXT_LEN>::from_array(plaintext);\n\n            // Verify decryption matches original plaintext\n            assert_eq(decrypted, plaintext_bvec, \"Decrypted bytes should match original plaintext\");\n\n            // The following is a workaround of \"struct is never constructed\" Noir compilation error (we only ever use\n            // static methods of the struct).\n            let _ = AES128 {};\n        });\n    }\n\n    #[test]\n    unconstrained fn encrypt_decrypt_random() {\n        // Same as `encrypt_decrypt_deterministic`, except we don't mock any of the oracles and rely on\n        // `TestEnvironment` instead.\n        let mut env = TestEnvironment::new();\n\n        let recipient = env.create_light_account();\n\n        env.private_context(|_| {\n            let plaintext = [1, 2, 3];\n            let ciphertext = AES128::encrypt(plaintext, recipient);\n\n            assert_eq(\n                AES128::decrypt(BoundedVec::from_array(ciphertext), recipient).unwrap(),\n                BoundedVec::from_array(plaintext),\n            );\n        });\n    }\n\n    #[test]\n    unconstrained fn encrypt_to_invalid_address() {\n        // x = 3 is a non-residue for this curve, resulting in an invalid address\n        let invalid_address = AztecAddress { inner: 3 };\n\n        // We just test that we produced some output and did not crash - the result is gibberish as it is encrypted\n        // using a public key for which we do not know the private key.\n        let _ = AES128::encrypt([1, 2, 3, 4], invalid_address);\n    }\n\n    #[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"
-    },
-    "134": {
-      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/logs/event.nr",
-      "source": "use crate::{\n    event::{event_interface::EventInterface, EventSelector},\n    messages::{\n        encoding::{encode_message, MAX_MESSAGE_CONTENT_LEN, MESSAGE_EXPANDED_METADATA_LEN},\n        msg_type::PRIVATE_EVENT_MSG_TYPE_ID,\n    },\n    utils::array,\n};\nuse crate::protocol::traits::{FromField, Serialize, ToField};\n\n/// The number of fields in a private event message content that are not the event's serialized representation (1 field\n/// for randomness).\npub(crate) global PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN: u32 = 1;\npub(crate) global PRIVATE_EVENT_MSG_PLAINTEXT_RANDOMNESS_INDEX: u32 = 0;\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 = MAX_MESSAGE_CONTENT_LEN - PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN;\n\n/// Creates the plaintext for a private event message (i.e. one of type [`PRIVATE_EVENT_MSG_TYPE_ID`]).\n///\n/// This plaintext is meant to be decoded via [`decode_private_event_message`].\npub fn encode_private_event_message<Event>(\n    event: Event,\n    randomness: Field,\n) -> [Field; PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + <Event as Serialize>::N + MESSAGE_EXPANDED_METADATA_LEN]\nwhere\n    Event: EventInterface + Serialize,\n{\n    // We use `Serialize` because we want for events to be processable by off-chain actors, e.g. block explorers,\n    // wallets and apps, without having to rely on contract invocation. If we used `Packable` we'd need to call utility\n    // functions in order to unpack events, which would introduce a level of complexity we don't currently think is\n    // worth the savings in DA (for public events) and proving time (when encrypting private event messages).\n    let serialized_event = event.serialize();\n\n    // If PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN is changed, causing the assertion below to fail, then the\n    // encoding below must be updated as well.\n    std::static_assert(\n        PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN == 1,\n        \"unexpected value for PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN\",\n    );\n\n    let mut msg_plaintext = [0; PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + <Event as Serialize>::N];\n    msg_plaintext[PRIVATE_EVENT_MSG_PLAINTEXT_RANDOMNESS_INDEX] = randomness;\n\n    for i in 0..serialized_event.len() {\n        msg_plaintext[PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + i] = serialized_event[i];\n    }\n\n    // The event type id is stored in the message metadata\n    encode_message(\n        PRIVATE_EVENT_MSG_TYPE_ID,\n        Event::get_event_type_id().to_field() as u64,\n        msg_plaintext,\n    )\n}\n\n/// Decodes the plaintext from a private event message (i.e. one of type [`PRIVATE_EVENT_MSG_TYPE_ID`]).\n///\n/// This plaintext is meant to have originated from [`encode_private_event_message`].\n///\n/// Note that while [`encode_private_event_message`] returns a fixed-size array, this function takes a [`BoundedVec`]\n/// instead. This is because when decoding we're typically processing runtime-sized plaintexts, more specifically,\n/// those that originate from [`crate::messages::encryption::message_encryption::MessageEncryption::decrypt`].\npub(crate) unconstrained fn decode_private_event_message(\n    msg_metadata: u64,\n    msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n) -> (EventSelector, Field, BoundedVec<Field, MAX_EVENT_SERIALIZED_LEN>) {\n    // Private event messages contain the event type id in the metadata\n    let event_type_id = EventSelector::from_field(msg_metadata as Field);\n\n    assert(\n        msg_content.len() > PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN,\n        f\"Invalid private event message: all private event messages must have at least {PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN} fields\",\n    );\n\n    // If PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_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_PLAINTEXT_RESERVED_FIELDS_LEN == 1,\n        \"unexpected value for PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN\",\n    );\n\n    let randomness = msg_content.get(PRIVATE_EVENT_MSG_PLAINTEXT_RANDOMNESS_INDEX);\n    let serialized_event = array::subbvec(msg_content, PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN);\n\n    (event_type_id, randomness, serialized_event)\n}\n\nmod test {\n    use crate::{\n        event::event_interface::EventInterface,\n        messages::{\n            encoding::decode_message,\n            logs::event::{decode_private_event_message, encode_private_event_message},\n            msg_type::PRIVATE_EVENT_MSG_TYPE_ID,\n        },\n    };\n    use crate::protocol::traits::Serialize;\n    use crate::test::mocks::mock_event::MockEvent;\n\n    global VALUE: Field = 7;\n    global RANDOMNESS: Field = 10;\n\n    #[test]\n    unconstrained fn encode_decode() {\n        let event = MockEvent::new(VALUE).build_event();\n\n        let message_plaintext = encode_private_event_message(event, RANDOMNESS);\n\n        let (msg_type_id, msg_metadata, msg_content) = decode_message(BoundedVec::from_array(message_plaintext));\n\n        assert_eq(msg_type_id, PRIVATE_EVENT_MSG_TYPE_ID);\n\n        let (event_type_id, randomness, serialized_event) = decode_private_event_message(msg_metadata, msg_content);\n\n        assert_eq(event_type_id, MockEvent::get_event_type_id());\n        assert_eq(randomness, RANDOMNESS);\n        assert_eq(serialized_event, BoundedVec::from_array(event.serialize()));\n    }\n}\n"
-    },
-    "136": {
-      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/logs/note.nr",
-      "source": "use crate::{\n    messages::{\n        encoding::{encode_message, MAX_MESSAGE_CONTENT_LEN, MESSAGE_EXPANDED_METADATA_LEN},\n        msg_type::PRIVATE_NOTE_MSG_TYPE_ID,\n    },\n    note::note_interface::NoteType,\n    utils::array,\n};\nuse crate::protocol::{address::AztecAddress, traits::{FromField, Packable, ToField}};\n\n/// The number of fields in a private note message content that are not the note's packed representation.\npub(crate) global PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN: u32 = 3;\n\npub(crate) global PRIVATE_NOTE_MSG_PLAINTEXT_OWNER_INDEX: u32 = 0;\npub(crate) global PRIVATE_NOTE_MSG_PLAINTEXT_STORAGE_SLOT_INDEX: u32 = 1;\npub(crate) global PRIVATE_NOTE_MSG_PLAINTEXT_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 = MAX_MESSAGE_CONTENT_LEN - PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN;\n\n/// Creates the plaintext for a private note message (i.e. one of type [`PRIVATE_NOTE_MSG_TYPE_ID`]).\n///\n/// This plaintext is meant to be decoded via [`decode_private_note_message`].\npub fn encode_private_note_message<Note>(\n    note: Note,\n    owner: AztecAddress,\n    storage_slot: Field,\n    randomness: Field,\n) -> [Field; PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + <Note as Packable>::N + MESSAGE_EXPANDED_METADATA_LEN]\nwhere\n    Note: NoteType + Packable,\n{\n    let packed_note = note.pack();\n\n    // If PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN is changed, causing the assertion below to fail, then the\n    // encoding below must be updated as well.\n    std::static_assert(\n        PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN == 3,\n        \"unexpected value for PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN\",\n    );\n\n    let mut msg_content = [0; PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + <Note as Packable>::N];\n    msg_content[PRIVATE_NOTE_MSG_PLAINTEXT_OWNER_INDEX] = owner.to_field();\n    msg_content[PRIVATE_NOTE_MSG_PLAINTEXT_STORAGE_SLOT_INDEX] = storage_slot;\n    msg_content[PRIVATE_NOTE_MSG_PLAINTEXT_RANDOMNESS_INDEX] = randomness;\n    for i in 0..packed_note.len() {\n        msg_content[PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + i] = packed_note[i];\n    }\n\n    // Notes use the note type id for metadata\n    encode_message(PRIVATE_NOTE_MSG_TYPE_ID, Note::get_id() as u64, msg_content)\n}\n\n/// Decodes the plaintext from a private note message (i.e. one of type [`PRIVATE_NOTE_MSG_TYPE_ID`]).\n///\n/// This plaintext is meant to have originated from [`encode_private_note_message`].\n///\n/// Note that while [`encode_private_note_message`] returns a fixed-size array, this function takes a [`BoundedVec`]\n/// instead. This is because when decoding we're typically processing runtime-sized plaintexts, more specifically,\n/// those that originate from [`crate::messages::encryption::message_encryption::MessageEncryption::decrypt`].\npub(crate) unconstrained fn decode_private_note_message(\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_PLAINTEXT_RESERVED_FIELDS_LEN,\n        f\"Invalid private note message: all private note messages must have at least {PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN} fields\",\n    );\n\n    // If PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN is changed, causing the assertion below to fail, then the\n    // decoding below must be updated as well.\n    std::static_assert(\n        PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN == 3,\n        \"unexpected value for PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN\",\n    );\n\n    let owner = AztecAddress::from_field(msg_content.get(PRIVATE_NOTE_MSG_PLAINTEXT_OWNER_INDEX));\n    let storage_slot = msg_content.get(PRIVATE_NOTE_MSG_PLAINTEXT_STORAGE_SLOT_INDEX);\n    let randomness = msg_content.get(PRIVATE_NOTE_MSG_PLAINTEXT_RANDOMNESS_INDEX);\n    let packed_note = array::subbvec(msg_content, PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN);\n\n    (note_type_id, owner, storage_slot, randomness, packed_note)\n}\n\nmod test {\n    use crate::{\n        messages::{\n            encoding::decode_message,\n            logs::note::{decode_private_note_message, encode_private_note_message},\n            msg_type::PRIVATE_NOTE_MSG_TYPE_ID,\n        },\n        note::note_interface::NoteType,\n    };\n    use crate::protocol::{address::AztecAddress, traits::{FromField, Packable}};\n    use crate::test::mocks::mock_note::MockNote;\n\n    global VALUE: Field = 7;\n    global OWNER: AztecAddress = AztecAddress::from_field(8);\n    global STORAGE_SLOT: Field = 9;\n    global RANDOMNESS: Field = 10;\n\n    #[test]\n    unconstrained fn encode_decode() {\n        let note = MockNote::new(VALUE).build_note();\n\n        let message_plaintext = encode_private_note_message(note, OWNER, STORAGE_SLOT, RANDOMNESS);\n\n        let (msg_type_id, msg_metadata, msg_content) = decode_message(BoundedVec::from_array(message_plaintext));\n\n        assert_eq(msg_type_id, PRIVATE_NOTE_MSG_TYPE_ID);\n\n        let (note_type_id, owner, storage_slot, randomness, packed_note) =\n            decode_private_note_message(msg_metadata, msg_content);\n\n        assert_eq(note_type_id, MockNote::get_id());\n        assert_eq(owner, OWNER);\n        assert_eq(storage_slot, STORAGE_SLOT);\n        assert_eq(randomness, RANDOMNESS);\n        assert_eq(packed_note, BoundedVec::from_array(note.pack()));\n    }\n}\n"
-    },
-    "137": {
-      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/logs/partial_note.nr",
-      "source": "use crate::{\n    messages::{\n        encoding::{encode_message, MAX_MESSAGE_CONTENT_LEN, MESSAGE_EXPANDED_METADATA_LEN},\n        encryption::{aes128::AES128, message_encryption::MessageEncryption},\n        logs::utils::prefix_with_tag,\n        msg_type::PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID,\n    },\n    note::note_interface::NoteType,\n    utils::array,\n};\nuse crate::protocol::{\n    address::AztecAddress,\n    constants::PRIVATE_LOG_SIZE_IN_FIELDS,\n    traits::{FromField, Packable, ToField},\n};\n\n/// The number of fields in a private note message content that are not the note's packed representation.\npub(crate) global PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN: u32 = 4;\npub(crate) global PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_OWNER_INDEX: u32 = 0;\npub(crate) global PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_STORAGE_SLOT_INDEX: u32 = 1;\npub(crate) global PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RANDOMNESS_INDEX: u32 = 2;\npub(crate) global PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_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_PLAINTEXT_RESERVED_FIELDS_LEN;\n\n// TODO(#16881): once partial notes support delivery via an offchain message we will most likely want to remove this.\npub fn compute_partial_note_private_content_log<PartialNotePrivateContent>(\n    partial_note_private_content: PartialNotePrivateContent,\n    owner: AztecAddress,\n    storage_slot: Field,\n    randomness: Field,\n    recipient: AztecAddress,\n    note_completion_log_tag: Field,\n) -> [Field; PRIVATE_LOG_SIZE_IN_FIELDS]\nwhere\n    PartialNotePrivateContent: NoteType + Packable,\n{\n    let message_plaintext = encode_partial_note_private_message(\n        partial_note_private_content,\n        owner,\n        storage_slot,\n        randomness,\n        note_completion_log_tag,\n    );\n    let message_ciphertext = AES128::encrypt(message_plaintext, recipient);\n\n    prefix_with_tag(message_ciphertext, recipient)\n}\n\n/// Creates the plaintext for a partial note private message (i.e. one of type [`PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID`]).\n///\n/// This plaintext is meant to be decoded via [`decode_partial_note_private_message`].\npub fn encode_partial_note_private_message<PartialNotePrivateContent>(\n    partial_note_private_content: PartialNotePrivateContent,\n    owner: AztecAddress,\n    storage_slot: Field,\n    randomness: Field,\n    note_completion_log_tag: Field,\n    ) -> [Field; PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + <PartialNotePrivateContent as Packable>::N + MESSAGE_EXPANDED_METADATA_LEN]\nwhere\n    PartialNotePrivateContent: NoteType + Packable,\n{\n    let packed_private_content = partial_note_private_content.pack();\n\n    // If PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_NON_NOTE_FIELDS_LEN is changed, causing the assertion below to fail, then\n    // the encoding below must be updated as well.\n    std::static_assert(\n        PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN == 4,\n        \"unexpected value for PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_NON_NOTE_FIELDS_LEN\",\n    );\n\n    let mut msg_content =\n        [0; PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + <PartialNotePrivateContent as Packable>::N];\n    msg_content[PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_OWNER_INDEX] = owner.to_field();\n    msg_content[PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_STORAGE_SLOT_INDEX] = storage_slot;\n    msg_content[PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RANDOMNESS_INDEX] = randomness;\n    msg_content[PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_NOTE_COMPLETION_LOG_TAG_INDEX] = note_completion_log_tag;\n\n    for i in 0..packed_private_content.len() {\n        msg_content[PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + i] = packed_private_content[i];\n    }\n\n    encode_message(\n        PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID,\n        // Notes use the note type id for metadata\n        PartialNotePrivateContent::get_id() as u64,\n        msg_content,\n    )\n}\n\n/// Decodes the plaintext from a private note message (i.e. one of type [`PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID`]).\n///\n/// This plaintext is meant to have originated from [`encode_partial_note_private_message`].\n///\n/// Note that while [`encode_partial_note_private_message`] returns a fixed-size array, this function takes a\n/// [`BoundedVec`] instead. This is because when decoding we're typically processing runtime-sized plaintexts, more\n/// specifically, those that originate from\n/// [`crate::messages::encryption::message_encryption::MessageEncryption::decrypt`].\npub(crate) unconstrained fn decode_partial_note_private_message(\n    msg_metadata: u64,\n    msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n) -> (AztecAddress, Field, Field, Field, Field, BoundedVec<Field, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN>) {\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_PLAINTEXT_NON_NOTE_FIELDS_LEN for more information about these fields.)\n    assert(\n        msg_content.len() >= PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN,\n        f\"Invalid private note message: all partial note private messages must have at least {PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN} fields\",\n    );\n\n    // If PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_NON_NOTE_FIELDS_LEN is changed, causing the assertion below to fail, then\n    // the destructuring of the partial note private message encoding below must be updated as well.\n    std::static_assert(\n        PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN == 4,\n        \"unexpected value for PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_NON_NOTE_FIELDS_LEN\",\n    );\n\n    // We currently have four fields that are not the partial note's packed representation, which are the owner, the\n    // storage slot, the randomness, and the note completion log tag.\n    let owner = AztecAddress::from_field(\n        msg_content.get(PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_OWNER_INDEX),\n    );\n    let storage_slot = msg_content.get(PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_STORAGE_SLOT_INDEX);\n    let randomness = msg_content.get(PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RANDOMNESS_INDEX);\n    let note_completion_log_tag = msg_content.get(PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_NOTE_COMPLETION_LOG_TAG_INDEX);\n\n    let packed_private_note_content: BoundedVec<Field, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN> = array::subbvec(\n        msg_content,\n        PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN,\n    );\n\n    (owner, storage_slot, randomness, note_completion_log_tag, note_type_id, packed_private_note_content)\n}\n\nmod test {\n    use crate::{\n        messages::{\n            encoding::decode_message,\n            logs::partial_note::{decode_partial_note_private_message, encode_partial_note_private_message},\n            msg_type::PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID,\n        },\n        note::note_interface::NoteType,\n    };\n    use crate::protocol::{address::AztecAddress, traits::{FromField, Packable}};\n    use crate::test::mocks::mock_note::MockNote;\n\n    global VALUE: Field = 7;\n    global OWNER: AztecAddress = AztecAddress::from_field(8);\n    global STORAGE_SLOT: Field = 9;\n    global RANDOMNESS: Field = 10;\n    global NOTE_COMPLETION_LOG_TAG: Field = 11;\n\n    #[test]\n    unconstrained fn encode_decode() {\n        // Note that here we use MockNote as the private fields of a partial note\n        let note = MockNote::new(VALUE).build_note();\n\n        let message_plaintext = encode_partial_note_private_message(\n            note,\n            OWNER,\n            STORAGE_SLOT,\n            RANDOMNESS,\n            NOTE_COMPLETION_LOG_TAG,\n        );\n\n        let (msg_type_id, msg_metadata, msg_content) = decode_message(BoundedVec::from_array(message_plaintext));\n\n        assert_eq(msg_type_id, PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID);\n\n        let (owner, storage_slot, randomness, note_completion_log_tag, note_type_id, packed_note) =\n            decode_partial_note_private_message(msg_metadata, msg_content);\n\n        assert_eq(note_type_id, MockNote::get_id());\n        assert_eq(owner, OWNER);\n        assert_eq(storage_slot, STORAGE_SLOT);\n        assert_eq(randomness, RANDOMNESS);\n        assert_eq(note_completion_log_tag, NOTE_COMPLETION_LOG_TAG);\n        assert_eq(packed_note, BoundedVec::from_array(note.pack()));\n    }\n}\n"
-    },
-    "147": {
-      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/processing/mod.nr",
-      "source": "pub(crate) mod event_validation_request;\n\nmod message_context;\npub use message_context::MessageContext;\n\npub(crate) mod note_validation_request;\npub(crate) mod log_retrieval_request;\npub(crate) mod log_retrieval_response;\npub(crate) mod pending_tagged_log;\n\nuse crate::{\n    capsules::CapsuleArray,\n    event::EventSelector,\n    messages::{\n        discovery::partial_notes::DeliveredPendingPartialNote,\n        logs::{event::MAX_EVENT_SERIALIZED_LEN, note::MAX_NOTE_PACKED_LEN},\n        processing::{\n            log_retrieval_request::LogRetrievalRequest, log_retrieval_response::LogRetrievalResponse,\n            note_validation_request::NoteValidationRequest, pending_tagged_log::PendingTaggedLog,\n        },\n    },\n    oracle,\n};\nuse crate::protocol::{address::AztecAddress, hash::sha256_to_field};\nuse event_validation_request::EventValidationRequest;\n\n// Base slot for the pending tagged log array to which the fetch_tagged_logs oracle inserts found private logs.\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(contract_address: AztecAddress) -> CapsuleArray<PendingTaggedLog> {\n    // We will eventually perform log discovery via tagging here, but for now we simply call the `fetchTaggedLogs`\n    // oracle. This makes PXE synchronize tags, download logs and store the pending tagged logs in a capsule array.\n    oracle::message_processing::fetch_tagged_logs(PENDING_TAGGED_LOG_ARRAY_BASE_SLOT);\n\n    CapsuleArray::at(contract_address, PENDING_TAGGED_LOG_ARRAY_BASE_SLOT)\n}\n\n/// Enqueues a note for validation 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_and_store_enqueued_notes_and_events` must be\n/// later called. For optimal performance, accumulate as many note validation requests as possible and then validate\n/// them all at the end (which results in PXE minimizing the number of network round-trips).\n///\n/// The `packed_note` is what `getNotes` will later return. PXE indexes notes by `storage_slot`, so this value is\n/// typically used to filter notes that correspond to different state variables. `note_hash` and `nullifier` are the\n/// inner hashes, i.e. the raw hashes returned by `NoteHash::compute_note_hash` and `NoteHash::compute_nullifier`. PXE\n/// will verify that the siloed unique note hash was inserted into the tree at `tx_hash`, and will store the nullifier\n/// to later check for nullification.\n///\n/// `owner` is the address used in note hash and nullifier computation, often requiring knowledge of their nullifier\n/// secret key.\n///\n/// `recipient` is the account to which the note message was delivered (i.e. the address the message was encrypted to).\n/// This determines which PXE account can see the note - other accounts will not be able to access it (e.g. other\n/// accounts will not be able to see one another's token balance notes, even in the same PXE) unless authorized. In\n/// most cases `recipient` equals `owner`, but they can differ in scenarios like delegated discovery.\npub(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_and_store_enqueued_notes_and_events` must be\n/// later called. For optimal performance, accumulate as many event validation requests as possible and then validate\n/// them all at the end (which results in PXE minimizing the number of network round-trips).\npub(crate) unconstrained fn enqueue_event_for_validation(\n    contract_address: AztecAddress,\n    event_type_id: EventSelector,\n    randomness: Field,\n    serialized_event: BoundedVec<Field, MAX_EVENT_SERIALIZED_LEN>,\n    event_commitment: Field,\n    tx_hash: Field,\n    recipient: AztecAddress,\n) {\n    // We store requests in a `CapsuleArray`, which PXE will later read from and deserialize into its version of the\n    // Noir `EventValidationRequest`\n    CapsuleArray::at(contract_address, EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT).push(\n        EventValidationRequest {\n            contract_address,\n            event_type_id,\n            randomness,\n            serialized_event,\n            event_commitment,\n            tx_hash,\n            recipient,\n        },\n    )\n}\n\n/// Validates 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 unconstrained fn validate_and_store_enqueued_notes_and_events(contract_address: AztecAddress) {\n    oracle::message_processing::validate_and_store_enqueued_notes_and_events(\n        contract_address,\n        NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT,\n        EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT,\n    );\n}\n\n/// Efficiently queries the node for logs that result in the completion of all `DeliveredPendingPartialNote`s stored in\n/// a `CapsuleArray` by performing all node communication concurrently. Returns a second `CapsuleArray` with Options\n/// for the responses that correspond to the pending partial notes at the same index.\n///\n/// For example, given an array with pending partial notes `[ p1, p2, p3 ]`, where `p1` and `p3` have corresponding\n/// completion logs but `p2` does not, the returned `CapsuleArray` will have contents `[some(p1_log), none(),\n/// some(p3_log)]`.\npub(crate) unconstrained fn get_pending_partial_notes_completion_logs(\n    contract_address: AztecAddress,\n    pending_partial_notes: CapsuleArray<DeliveredPendingPartialNote>,\n) -> CapsuleArray<Option<LogRetrievalResponse>> {\n    let log_retrieval_requests = CapsuleArray::at(contract_address, LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT);\n\n    // We create a LogRetrievalRequest for each PendingPartialNote in the CapsuleArray. Because we need the indices in\n    // the request array to match the indices in the partial note array, we can't use CapsuleArray::for_each, as that\n    // function has arbitrary iteration order. Instead, we manually iterate the array from the beginning and push into\n    // the requests array, which we expect to be empty.\n    let mut i = 0;\n    let pending_partial_notes_count = pending_partial_notes.len();\n    while i < pending_partial_notes_count {\n        let pending_partial_note = pending_partial_notes.get(i);\n        log_retrieval_requests.push(\n            LogRetrievalRequest { contract_address, unsiloed_tag: pending_partial_note.note_completion_log_tag },\n        );\n        i += 1;\n    }\n\n    oracle::message_processing::bulk_retrieve_logs(\n        contract_address,\n        LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT,\n        LOG_RETRIEVAL_RESPONSES_ARRAY_BASE_SLOT,\n    );\n\n    CapsuleArray::at(contract_address, LOG_RETRIEVAL_RESPONSES_ARRAY_BASE_SLOT)\n}\n"
-    },
-    "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": {
+    "177": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/call_private_function.nr",
-      "source": "use crate::protocol::{abis::function_selector::FunctionSelector, address::AztecAddress, utils::reader::Reader};\n\n#[oracle(privateCallPrivateFunction)]\nunconstrained fn call_private_function_oracle(\n    _contract_address: AztecAddress,\n    _function_selector: FunctionSelector,\n    _args_hash: Field,\n    _start_side_effect_counter: u32,\n    _is_static_call: bool,\n) -> [Field; 2] {}\n\npub unconstrained fn call_private_function_internal(\n    contract_address: AztecAddress,\n    function_selector: FunctionSelector,\n    args_hash: Field,\n    start_side_effect_counter: u32,\n    is_static_call: bool,\n) -> (u32, Field) {\n    let fields = call_private_function_oracle(\n        contract_address,\n        function_selector,\n        args_hash,\n        start_side_effect_counter,\n        is_static_call,\n    );\n\n    let mut reader = Reader::new(fields);\n    let end_side_effect_counter = reader.read_u32();\n    let returns_hash = reader.read();\n\n    (end_side_effect_counter, returns_hash)\n}\n"
+      "source": "use crate::protocol::{abis::function_selector::FunctionSelector, address::AztecAddress, utils::reader::Reader};\n\n#[oracle(aztec_prv_callPrivateFunction)]\nunconstrained fn call_private_function_oracle(\n    _contract_address: AztecAddress,\n    _function_selector: FunctionSelector,\n    _args_hash: Field,\n    _start_side_effect_counter: u32,\n    _is_static_call: bool,\n) -> [Field; 2] {}\n\npub unconstrained fn call_private_function_internal(\n    contract_address: AztecAddress,\n    function_selector: FunctionSelector,\n    args_hash: Field,\n    start_side_effect_counter: u32,\n    is_static_call: bool,\n) -> (u32, Field) {\n    let fields = call_private_function_oracle(\n        contract_address,\n        function_selector,\n        args_hash,\n        start_side_effect_counter,\n        is_static_call,\n    );\n\n    let mut reader = Reader::new(fields);\n    let end_side_effect_counter = reader.read_u32();\n    let returns_hash = reader.read();\n\n    (end_side_effect_counter, returns_hash)\n}\n"
     },
-    "171": {
+    "178": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/capsules.nr",
-      "source": "use crate::protocol::{address::AztecAddress, traits::{Deserialize, Serialize}};\n\n/// Stores arbitrary information in a per-contract non-volatile database, which can later be retrieved with `load`. If\n/// data was already stored at this slot, it is overwritten.\npub unconstrained fn store<T>(contract_address: AztecAddress, slot: Field, value: T)\nwhere\n    T: Serialize,\n{\n    let serialized = value.serialize();\n    store_oracle(contract_address, slot, serialized);\n}\n\n/// Returns data previously stored via `storeCapsule` in the per-contract non-volatile database. Returns Option::none()\n/// if nothing was stored at the given slot.\npub unconstrained fn load<T>(contract_address: AztecAddress, slot: Field) -> Option<T>\nwhere\n    T: Deserialize,\n{\n    let serialized_option = load_oracle(contract_address, slot, <T as Deserialize>::N);\n    serialized_option.map(|arr| Deserialize::deserialize(arr))\n}\n\n/// Deletes data in the per-contract non-volatile database. Does nothing if no data was present.\npub unconstrained fn delete(contract_address: AztecAddress, slot: Field) {\n    delete_oracle(contract_address, slot);\n}\n\n/// Copies a number of contiguous entries in the per-contract non-volatile database. This allows for efficient data\n/// structures by avoiding repeated calls to `loadCapsule` and `storeCapsule`. Supports overlapping source and\n/// destination regions (which will result in the overlapped source values being overwritten). All copied slots must\n/// exist in the database (i.e. have been stored and not deleted)\npub unconstrained fn copy(contract_address: AztecAddress, src_slot: Field, dst_slot: Field, num_entries: u32) {\n    copy_oracle(contract_address, src_slot, dst_slot, num_entries);\n}\n\n#[oracle(utilityStoreCapsule)]\nunconstrained fn store_oracle<let N: u32>(contract_address: AztecAddress, slot: Field, values: [Field; N]) {}\n\n/// We need to pass in `array_len` (the value of N) as a parameter to tell the oracle how many fields the response must\n/// have.\n///\n/// Note that the oracle returns an Option<[Field; N]> because we cannot return an Option<T> directly. That would\n/// require for the oracle resolver to know the shape of T (e.g. if T were a struct of 3 u32 values then the expected\n/// response shape would be 3 single items, whereas it were a struct containing `u32, [Field;10], u32` then the\n/// expected shape would be single, array, single.). Instead, we return the serialization and deserialize in Noir.\n#[oracle(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(contract_address: AztecAddress, src_slot: Field, dst_slot: Field, num_entries: u32) {}\n\nmod test {\n    // These tests are sort of redundant since we already test the oracle implementation directly in TypeScript, but\n    // they are cheap regardless and help ensure both that the TXE implementation works accordingly and that the Noir\n    // oracles are hooked up correctly.\n\n    use crate::{\n        oracle::capsules::{copy, delete, load, store},\n        test::{helpers::test_environment::TestEnvironment, mocks::MockStruct},\n    };\n    use crate::protocol::{address::AztecAddress, traits::{FromField, ToField}};\n\n    global SLOT: Field = 1;\n\n    #[test]\n    unconstrained fn stores_and_loads() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let value = MockStruct::new(5, 6);\n            store(contract_address, SLOT, value);\n\n            assert_eq(load(contract_address, SLOT).unwrap(), value);\n        });\n    }\n\n    #[test]\n    unconstrained fn store_overwrites() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let value = MockStruct::new(5, 6);\n            store(contract_address, SLOT, value);\n\n            let new_value = MockStruct::new(7, 8);\n            store(contract_address, SLOT, new_value);\n\n            assert_eq(load(contract_address, SLOT).unwrap(), new_value);\n        });\n    }\n\n    #[test]\n    unconstrained fn loads_empty_slot() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let loaded_value: Option<MockStruct> = load(contract_address, SLOT);\n            assert_eq(loaded_value, Option::none());\n        });\n    }\n\n    #[test]\n    unconstrained fn deletes_stored_value() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let value = MockStruct::new(5, 6);\n            store(contract_address, SLOT, value);\n            delete(contract_address, SLOT);\n\n            let loaded_value: Option<MockStruct> = load(contract_address, SLOT);\n            assert_eq(loaded_value, Option::none());\n        });\n    }\n\n    #[test]\n    unconstrained fn deletes_empty_slot() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            delete(contract_address, SLOT);\n            let loaded_value: Option<MockStruct> = load(contract_address, SLOT);\n            assert_eq(loaded_value, Option::none());\n        });\n    }\n\n    #[test]\n    unconstrained fn copies_non_overlapping_values() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let src = 5;\n\n            let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n            store(contract_address, src, values[0]);\n            store(contract_address, src + 1, values[1]);\n            store(contract_address, src + 2, values[2]);\n\n            let dst = 10;\n            copy(contract_address, src, dst, 3);\n\n            assert_eq(load(contract_address, dst).unwrap(), values[0]);\n            assert_eq(load(contract_address, dst + 1).unwrap(), values[1]);\n            assert_eq(load(contract_address, dst + 2).unwrap(), values[2]);\n        });\n    }\n\n    #[test]\n    unconstrained fn copies_overlapping_values_with_src_ahead() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let src = 1;\n\n            let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n            store(contract_address, src, values[0]);\n            store(contract_address, src + 1, values[1]);\n            store(contract_address, src + 2, values[2]);\n\n            let dst = 2;\n            copy(contract_address, src, dst, 3);\n\n            assert_eq(load(contract_address, dst).unwrap(), values[0]);\n            assert_eq(load(contract_address, dst + 1).unwrap(), values[1]);\n            assert_eq(load(contract_address, dst + 2).unwrap(), values[2]);\n\n            // src[1] and src[2] should have been overwritten since they are also dst[0] and dst[1]\n            assert_eq(load(contract_address, src).unwrap(), values[0]); // src[0] (unchanged)\n            assert_eq(load(contract_address, src + 1).unwrap(), values[0]); // dst[0]\n            assert_eq(load(contract_address, src + 2).unwrap(), values[1]); // dst[1]\n        });\n    }\n\n    #[test]\n    unconstrained fn copies_overlapping_values_with_dst_ahead() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let src = 2;\n\n            let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n            store(contract_address, src, values[0]);\n            store(contract_address, src + 1, values[1]);\n            store(contract_address, src + 2, values[2]);\n\n            let dst = 1;\n            copy(contract_address, src, dst, 3);\n\n            assert_eq(load(contract_address, dst).unwrap(), values[0]);\n            assert_eq(load(contract_address, dst + 1).unwrap(), values[1]);\n            assert_eq(load(contract_address, dst + 2).unwrap(), values[2]);\n\n            // src[0] and src[1] should have been overwritten since they are also dst[1] and dst[2]\n            assert_eq(load(contract_address, src).unwrap(), values[1]); // dst[1]\n            assert_eq(load(contract_address, src + 1).unwrap(), values[2]); // dst[2]\n            assert_eq(load(contract_address, src + 2).unwrap(), values[2]); // src[2] (unchanged)\n        });\n    }\n\n    #[test(should_fail_with = \"copy empty slot\")]\n    unconstrained fn cannot_copy_empty_values() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            copy(contract_address, SLOT, SLOT, 1);\n        });\n    }\n\n    #[test(should_fail_with = \"not allowed to access\")]\n    unconstrained fn cannot_store_other_contract() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n            let value = MockStruct::new(5, 6);\n            store(other_contract_address, SLOT, value);\n        });\n    }\n\n    #[test(should_fail_with = \"not allowed to access\")]\n    unconstrained fn cannot_load_other_contract() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n            let _: Option<MockStruct> = load(other_contract_address, SLOT);\n        });\n    }\n\n    #[test(should_fail_with = \"not allowed to access\")]\n    unconstrained fn cannot_delete_other_contract() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n            delete(other_contract_address, SLOT);\n        });\n    }\n\n    #[test(should_fail_with = \"not allowed to access\")]\n    unconstrained fn cannot_copy_other_contract() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n            copy(other_contract_address, SLOT, SLOT, 0);\n        });\n    }\n}\n"
+      "source": "use crate::protocol::{address::AztecAddress, traits::{Deserialize, Serialize}};\n\n/// Stores arbitrary information in a per-contract non-volatile database, which can later be retrieved with `load`. If\n/// data was already stored at this slot, it is overwritten.\n// TODO(F-498): review naming consistency\npub unconstrained fn store<T>(contract_address: AztecAddress, slot: Field, value: T, scope: AztecAddress)\nwhere\n    T: Serialize,\n{\n    let serialized = value.serialize();\n    set_capsule_oracle(contract_address, slot, serialized, scope);\n}\n\n/// Returns data previously stored via `storeCapsule` in the per-contract non-volatile database. Returns\n/// Option::none() if nothing was stored at the given slot.\n// TODO(F-498): review naming consistency\npub unconstrained fn load<T>(contract_address: AztecAddress, slot: Field, scope: AztecAddress) -> Option<T>\nwhere\n    T: Deserialize,\n{\n    let serialized_option = get_capsule_oracle(contract_address, slot, <T as Deserialize>::N, scope);\n    serialized_option.map(|arr| Deserialize::deserialize(arr))\n}\n\n/// Deletes data in the per-contract non-volatile database. Does nothing if no data was present.\npub unconstrained fn delete(contract_address: AztecAddress, slot: Field, scope: AztecAddress) {\n    delete_oracle(contract_address, slot, scope);\n}\n\n/// Copies a number of contiguous entries in the per-contract non-volatile database. This allows for efficient data\n/// structures by avoiding repeated calls to `loadCapsule` and `storeCapsule`. Supports overlapping source and\n/// destination regions (which will result in the overlapped source values being overwritten). All copied slots must\n/// exist in the database (i.e. have been stored and not deleted)\npub unconstrained fn copy(\n    contract_address: AztecAddress,\n    src_slot: Field,\n    dst_slot: Field,\n    num_entries: u32,\n    scope: AztecAddress,\n) {\n    copy_oracle(contract_address, src_slot, dst_slot, num_entries, scope);\n}\n\n#[oracle(aztec_utl_setCapsule)]\nunconstrained fn set_capsule_oracle<let N: u32>(\n    contract_address: AztecAddress,\n    slot: Field,\n    values: [Field; N],\n    scope: AztecAddress,\n) {}\n\n/// We need to pass in `array_len` (the value of N) as a parameter to tell the oracle how many fields the response must\n/// have.\n///\n/// Note that the oracle returns an Option<[Field; N]> because we cannot return an Option<T> directly. That would\n/// require for the oracle resolver to know the shape of T (e.g. if T were a struct of 3 u32 values then the expected\n/// response shape would be 3 single items, whereas it were a struct containing `u32, [Field;10], u32` then the\n/// expected shape would be single, array, single.). Instead, we return the serialization and deserialize in Noir.\n#[oracle(aztec_utl_getCapsule)]\nunconstrained fn get_capsule_oracle<let N: u32>(\n    contract_address: AztecAddress,\n    slot: Field,\n    array_len: u32,\n    scope: AztecAddress,\n) -> Option<[Field; N]> {}\n\n#[oracle(aztec_utl_deleteCapsule)]\nunconstrained fn delete_oracle(contract_address: AztecAddress, slot: Field, scope: AztecAddress) {}\n\n#[oracle(aztec_utl_copyCapsule)]\nunconstrained fn copy_oracle(\n    contract_address: AztecAddress,\n    src_slot: Field,\n    dst_slot: Field,\n    num_entries: u32,\n    scope: AztecAddress,\n) {}\n\nmod test {\n    // These tests are sort of redundant since we already test the oracle implementation directly in TypeScript, but\n    // they are cheap regardless and help ensure both that the TXE implementation works accordingly and that the Noir\n    // oracles are hooked up correctly.\n\n    use crate::{\n        oracle::capsules::{copy, delete, load, store},\n        test::{helpers::test_environment::TestEnvironment, mocks::MockStruct},\n    };\n    use crate::protocol::{address::AztecAddress, traits::{FromField, ToField}};\n\n    global SLOT: Field = 1;\n\n    unconstrained fn setup() -> (TestEnvironment, AztecAddress) {\n        let mut env = TestEnvironment::new();\n        let scope = env.create_light_account();\n        (env, scope)\n    }\n\n    #[test]\n    unconstrained fn stores_and_loads() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let value = MockStruct::new(5, 6);\n            store(contract_address, SLOT, value, scope);\n\n            assert_eq(load(contract_address, SLOT, scope).unwrap(), value);\n        });\n    }\n\n    #[test]\n    unconstrained fn store_overwrites() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let value = MockStruct::new(5, 6);\n            store(contract_address, SLOT, value, scope);\n\n            let new_value = MockStruct::new(7, 8);\n            store(contract_address, SLOT, new_value, scope);\n\n            assert_eq(load(contract_address, SLOT, scope).unwrap(), new_value);\n        });\n    }\n\n    #[test]\n    unconstrained fn loads_empty_slot() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let loaded_value: Option<MockStruct> = load(contract_address, SLOT, scope);\n            assert_eq(loaded_value, Option::none());\n        });\n    }\n\n    #[test]\n    unconstrained fn deletes_stored_value() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let value = MockStruct::new(5, 6);\n            store(contract_address, SLOT, value, scope);\n            delete(contract_address, SLOT, scope);\n\n            let loaded_value: Option<MockStruct> = load(contract_address, SLOT, scope);\n            assert_eq(loaded_value, Option::none());\n        });\n    }\n\n    #[test]\n    unconstrained fn deletes_empty_slot() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            delete(contract_address, SLOT, scope);\n            let loaded_value: Option<MockStruct> = load(contract_address, SLOT, scope);\n            assert_eq(loaded_value, Option::none());\n        });\n    }\n\n    #[test]\n    unconstrained fn copies_non_overlapping_values() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let src = 5;\n\n            let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n            store(contract_address, src, values[0], scope);\n            store(contract_address, src + 1, values[1], scope);\n            store(contract_address, src + 2, values[2], scope);\n\n            let dst = 10;\n            copy(contract_address, src, dst, 3, scope);\n\n            assert_eq(load(contract_address, dst, scope).unwrap(), values[0]);\n            assert_eq(load(contract_address, dst + 1, scope).unwrap(), values[1]);\n            assert_eq(load(contract_address, dst + 2, scope).unwrap(), values[2]);\n        });\n    }\n\n    #[test]\n    unconstrained fn copies_overlapping_values_with_src_ahead() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let src = 1;\n\n            let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n            store(contract_address, src, values[0], scope);\n            store(contract_address, src + 1, values[1], scope);\n            store(contract_address, src + 2, values[2], scope);\n\n            let dst = 2;\n            copy(contract_address, src, dst, 3, scope);\n\n            assert_eq(load(contract_address, dst, scope).unwrap(), values[0]);\n            assert_eq(load(contract_address, dst + 1, scope).unwrap(), values[1]);\n            assert_eq(load(contract_address, dst + 2, scope).unwrap(), values[2]);\n\n            // src[1] and src[2] should have been overwritten since they are also dst[0] and dst[1]\n            assert_eq(load(contract_address, src, scope).unwrap(), values[0]); // src[0] (unchanged)\n            assert_eq(load(contract_address, src + 1, scope).unwrap(), values[0]); // dst[0]\n            assert_eq(load(contract_address, src + 2, scope).unwrap(), values[1]); // dst[1]\n        });\n    }\n\n    #[test]\n    unconstrained fn copies_overlapping_values_with_dst_ahead() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let src = 2;\n\n            let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n            store(contract_address, src, values[0], scope);\n            store(contract_address, src + 1, values[1], scope);\n            store(contract_address, src + 2, values[2], scope);\n\n            let dst = 1;\n            copy(contract_address, src, dst, 3, scope);\n\n            assert_eq(load(contract_address, dst, scope).unwrap(), values[0]);\n            assert_eq(load(contract_address, dst + 1, scope).unwrap(), values[1]);\n            assert_eq(load(contract_address, dst + 2, scope).unwrap(), values[2]);\n\n            // src[0] and src[1] should have been overwritten since they are also dst[1] and dst[2]\n            assert_eq(load(contract_address, src, scope).unwrap(), values[1]); // dst[1]\n            assert_eq(load(contract_address, src + 1, scope).unwrap(), values[2]); // dst[2]\n            assert_eq(load(contract_address, src + 2, scope).unwrap(), values[2]); // src[2] (unchanged)\n        });\n    }\n\n    #[test(should_fail_with = \"copy empty slot\")]\n    unconstrained fn cannot_copy_empty_values() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            copy(contract_address, SLOT, SLOT, 1, scope);\n        });\n    }\n\n    #[test(should_fail_with = \"not allowed to access\")]\n    unconstrained fn cannot_store_other_contract() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n            let value = MockStruct::new(5, 6);\n            store(other_contract_address, SLOT, value, scope);\n        });\n    }\n\n    #[test(should_fail_with = \"not allowed to access\")]\n    unconstrained fn cannot_load_other_contract() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n            let _: Option<MockStruct> = load(other_contract_address, SLOT, scope);\n        });\n    }\n\n    #[test(should_fail_with = \"not allowed to access\")]\n    unconstrained fn cannot_delete_other_contract() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n            delete(other_contract_address, SLOT, scope);\n        });\n    }\n\n    #[test(should_fail_with = \"not allowed to access\")]\n    unconstrained fn cannot_copy_other_contract() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n            copy(other_contract_address, SLOT, SLOT, 0, scope);\n        });\n    }\n}\n"
     },
-    "172": {
-      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/enqueue_public_function_call.nr",
-      "source": "use crate::protocol::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\n    // 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\n    // 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 to\n    // 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"
+    "179": {
+      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/contract_sync.nr",
+      "source": "use crate::protocol::address::AztecAddress;\n\n#[oracle(aztec_utl_setContractSyncCacheInvalid)]\nunconstrained fn set_contract_sync_cache_invalid_oracle<let N: u32>(\n    contract_address: AztecAddress,\n    scopes: BoundedVec<AztecAddress, N>,\n) {}\n\n/// Forces the PXE to re-sync the given contract for a set of scopes on the next query.\n///\n/// Call this after writing data (e.g. offchain messages) that the contract's `sync_state` function needs to discover.\n/// Without invalidation, the sync cache would skip re-running `sync_state` until the next block.\npub unconstrained fn set_contract_sync_cache_invalid<let N: u32>(\n    contract_address: AztecAddress,\n    scopes: BoundedVec<AztecAddress, N>,\n) {\n    set_contract_sync_cache_invalid_oracle(contract_address, scopes);\n}\n"
     },
-    "173": {
+    "180": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/execution.nr",
-      "source": "use crate::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"
+      "source": "use crate::context::UtilityContext;\n\n#[oracle(aztec_utl_getUtilityContext)]\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"
     },
-    "174": {
+    "181": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/execution_cache.nr",
-      "source": "/// Stores values represented as slice in execution cache to be later obtained by its hash.\npub fn store<let N: u32>(values: [Field; N], hash: Field) {\n    // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe to\n    // call. When loading the values, however, the caller must check that the values are indeed the preimage.\n    unsafe { store_in_execution_cache_oracle_wrapper(values, hash) };\n}\n\nunconstrained fn store_in_execution_cache_oracle_wrapper<let N: u32>(values: [Field; N], hash: Field) {\n    store_in_execution_cache_oracle(values, hash);\n}\n\npub unconstrained fn load<let N: u32>(hash: Field) -> [Field; N] {\n    load_from_execution_cache_oracle(hash)\n}\n\n#[oracle(privateStoreInExecutionCache)]\nunconstrained fn store_in_execution_cache_oracle<let N: u32>(_values: [Field; N], _hash: Field) {}\n\n#[oracle(privateLoadFromExecutionCache)]\nunconstrained fn load_from_execution_cache_oracle<let N: u32>(_hash: Field) -> [Field; N] {}\n"
-    },
-    "18": {
-      "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 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 array 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 array 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 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 array 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 array 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(\"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(\"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(\"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(\"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"
-    },
-    "183": {
-      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/message_processing.nr",
-      "source": "use crate::protocol::address::AztecAddress;\n\n/// Finds new private logs that may have been sent to all registered accounts in PXE in the current contract and makes\n/// them available for later processing in Noir by storing them in a capsule array.\npub unconstrained fn fetch_tagged_logs(pending_tagged_log_array_base_slot: Field) {\n    fetch_tagged_logs_oracle(pending_tagged_log_array_base_slot);\n}\n\n#[oracle(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 all\n// notes and events in one go, minimizing node round-trips.\npub(crate) unconstrained fn validate_and_store_enqueued_notes_and_events(\n    contract_address: AztecAddress,\n    note_validation_requests_array_base_slot: Field,\n    event_validation_requests_array_base_slot: Field,\n) {\n    validate_and_store_enqueued_notes_and_events_oracle(\n        contract_address,\n        note_validation_requests_array_base_slot,\n        event_validation_requests_array_base_slot,\n    );\n}\n\n#[oracle(utilityValidateAndStoreEnqueuedNotesAndEvents)]\nunconstrained fn validate_and_store_enqueued_notes_and_events_oracle(\n    contract_address: AztecAddress,\n    note_validation_requests_array_base_slot: Field,\n    event_validation_requests_array_base_slot: Field,\n) {}\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"
-    },
-    "185": {
-      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/notes.nr",
-      "source": "use crate::note::{HintedNote, note_interface::NoteType};\n\nuse crate::protocol::{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 to\n    // 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\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(nullifier: Field, note_hash: Field, counter: u32) {\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\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 <HintedNote<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_hinted_note_length: u32,\n) -> BoundedVec<[Field; <HintedNote<Note> as Packable>::N], MaxNotes>\nwhere\n    // TODO(https://github.com/noir-lang/noir/issues/9399): `Note: Packable` should work here.\n    HintedNote<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<HintedNote<Note>>; MaxNotes]\nwhere\n    Note: NoteType + Packable,\n{\n    let packed_hinted_notes: BoundedVec<[Field; <HintedNote<Note> as Packable>::N], MaxNotes> = 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        <HintedNote<Note> as Packable>::N,\n    );\n\n    let mut notes = BoundedVec::<_, MaxNotes>::new();\n    for i in 0..packed_hinted_notes.len() {\n        let hinted_note = HintedNote::unpack(packed_hinted_notes.get(i));\n        notes.push(hinted_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 the\n    // 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// 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 associated\n/// index so that future notes get a different tag and can be discovered by the recipient. This change should only be\n/// persisted in a non-volatile database if the tagged log is found in an actual block - otherwise e.g. a reverting\n/// transaction can cause the sender to accidentally skip indices and later produce notes that are not found by the\n/// recipient.\npub unconstrained fn get_next_app_tag_as_sender(sender: AztecAddress, recipient: AztecAddress) -> 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(_sender: AztecAddress, _recipient: AztecAddress) -> Field {}\n\n/// Gets the sender for tags.\n///\n/// This unconstrained value is used as the sender when computing an unconstrained shared secret for a tag in order to\n/// emit a log. Constrained tagging should not use this as there is no guarantee that the recipient knows about the\n/// 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 'senderForTags' value\n/// (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 for a tag in order to\n/// emit a log. Constrained tagging should not use this as there is no guarantee that the recipient knows about the\n/// sender, and hence about the shared secret.\n///\n/// Account contracts typically set this value before calling other contracts. The value persists through nested calls,\n/// meaning all calls down the stack will use the same 'senderForTags' value (unless it is replaced by another call to\n/// 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"
-    },
-    "186": {
-      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/nullifiers.nr",
-      "source": "//! Nullifier creation, existence checks, etc.\n\nuse crate::protocol::address::aztec_address::AztecAddress;\n\n/// Notifies the simulator that a nullifier has been created, so that its correct status (pending or settled) can be\n/// determined when reading nullifiers in subsequent private function calls. The first non-revertible nullifier emitted\n/// is also used to compute note nonces.\npub fn notify_created_nullifier(inner_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(inner_nullifier) };\n}\n\n#[oracle(privateNotifyCreatedNullifier)]\nunconstrained fn notify_created_nullifier_oracle(_inner_nullifier: Field) {}\n\n/// Returns true if the nullifier has been emitted in the same transaction, i.e. if [`notify_created_nullifier`] has\n/// been\n/// called for this inner nullifier from the contract with the specified address.\n///\n/// Note that despite sharing pending transaction information with the app, this is not a privacy leak: anyone in the\n/// network can always determine in which transaction a inner nullifier was emitted by a given contract by simply\n/// inspecting transaction effects. What _would_ constitute a leak would be to share the list of inner pending\n/// nullifiers, as that would reveal their preimages.\npub unconstrained fn is_nullifier_pending(inner_nullifier: Field, contract_address: AztecAddress) -> bool {\n    is_nullifier_pending_oracle(inner_nullifier, contract_address)\n}\n\n#[oracle(privateIsNullifierPending)]\nunconstrained fn is_nullifier_pending_oracle(_inner_nullifier: Field, _contract_address: AztecAddress) -> bool {}\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\n/// the current transaction is included in a block. While this might seem of little use at first, certain design\n/// patterns 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"
-    },
-    "189": {
-      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/shared_secret.nr",
-      "source": "use crate::protocol::{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 ephemeral\n/// public key `ephPk`. The app-siloing means that contracts cannot retrieve secrets that belong to other contracts,\n/// and therefore cannot e.g. decrypt their messages. This is an important security consideration given that both the\n/// `address` and `ephPk` are public information.\n///\n/// The shared secret `S` is computed as: `let S =  (ivsk + h) * ephPk` where `ivsk + h` is the 'preaddress' i.e. the\n/// preimage of the address, also called the address secret. TODO(#12656): app-silo this secret\npub unconstrained fn get_shared_secret(address: AztecAddress, ephPk: Point) -> Point {\n    get_shared_secret_oracle(address, ephPk)\n}\n"
+      "source": "/// Stores values represented as slice in execution cache to be later obtained by its hash.\n// TODO(F-498): review naming consistency\npub fn store<let N: u32>(values: [Field; N], hash: Field) {\n    // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe to\n    // call. When loading the values, however, the caller must check that the values are indeed the preimage.\n    unsafe { set_hash_preimage_oracle_wrapper(values, hash) };\n}\n\nunconstrained fn set_hash_preimage_oracle_wrapper<let N: u32>(values: [Field; N], hash: Field) {\n    set_hash_preimage_oracle(values, hash);\n}\n\n// TODO(F-498): review naming consistency\npub unconstrained fn load<let N: u32>(hash: Field) -> [Field; N] {\n    get_hash_preimage_oracle(hash)\n}\n\n#[oracle(aztec_prv_setHashPreimage)]\nunconstrained fn set_hash_preimage_oracle<let N: u32>(_values: [Field; N], _hash: Field) {}\n\n#[oracle(aztec_prv_getHashPreimage)]\nunconstrained fn get_hash_preimage_oracle<let N: u32>(_hash: Field) -> [Field; N] {}\n"
     },
     "19": {
       "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    crate::assert_constant(separator);\n    let domain_generators: [EmbeddedCurvePoint; N] =\n        derive_generators(\"DEFAULT_DOMAIN_SEPARATOR\".as_bytes(), separator);\n\n    for i in 0..N {\n        scalars[i] = from_field_unsafe(input[i]);\n        generators[i] = domain_generators[i];\n    }\n    scalars[N] = EmbeddedCurveScalar { lo: N as Field, hi: 0 as Field };\n\n    let length_generator: [EmbeddedCurvePoint; 1] =\n        derive_generators(\"pedersen_hash_length\".as_bytes(), 0);\n    generators[N] = length_generator[0];\n    multi_scalar_mul_array_return(generators, scalars, true)[0].x\n}\n\n#[field(bn254)]\n#[inline_always]\npub fn derive_generators<let N: u32, let M: u32>(\n    domain_separator_bytes: [u8; M],\n    starting_index: u32,\n) -> [EmbeddedCurvePoint; N] {\n    crate::assert_constant(domain_separator_bytes);\n    crate::assert_constant(starting_index);\n    __derive_generators(domain_separator_bytes, starting_index)\n}\n\n#[builtin(derive_pedersen_generators)]\n#[field(bn254)]\nfn __derive_generators<let N: u32, let M: u32>(\n    domain_separator_bytes: [u8; M],\n    starting_index: u32,\n) -> [EmbeddedCurvePoint; N] {}\n\n#[field(bn254)]\n// Decompose the input 'bn254 scalar' into two 128 bits limbs.\n// It is called 'unsafe' because it does not assert the limbs are 128 bits\n// Assuming the limbs are 128 bits:\n// Assert the decomposition does not overflow the field size.\nfn from_field_unsafe(scalar: Field) -> EmbeddedCurveScalar {\n    // Safety: xlo and xhi decomposition is checked below\n    let (xlo, xhi) = unsafe { crate::field::bn254::decompose_hint(scalar) };\n    // Check that the decomposition is correct\n    assert_eq(scalar, xlo + crate::field::bn254::TWO_POW_128 * xhi);\n    // Check that the decomposition does not overflow the field size\n    let (a, b) = if xhi == crate::field::bn254::PHI {\n        (xlo, crate::field::bn254::PLO)\n    } else {\n        (xhi, crate::field::bn254::PHI)\n    };\n    crate::field::bn254::assert_lt(a, b);\n\n    EmbeddedCurveScalar { lo: xlo, hi: xhi }\n}\n\npub fn poseidon2_permutation<let N: u32>(input: [Field; N], state_len: u32) -> [Field; N] {\n    assert_eq(input.len(), state_len);\n    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"
     },
-    "191": {
-      "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\n/// and if the oracle version is incompatible an error is thrown.\npub global ORACLE_VERSION: Field = 12;\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"
-    },
-    "240": {
-      "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 of\n/// elements past `offset`.\n///\n/// Examples:\n/// ```\n/// let foo: [Field; 2] = subarray([1, 2, 3, 4, 5], 2);\n/// assert_eq(foo, [3, 4]);\n///\n/// let bar: [Field; 5] = subarray([1, 2, 3, 4, 5], 2); // fails - we can't return 5 elements since only 3 remain\n/// ```\npub fn subarray<T, let SrcLen: u32, let DstLen: u32>(src: [T; SrcLen], offset: u32) -> [T; DstLen] {\n    assert(offset + DstLen <= SrcLen, \"DstLen too large for offset\");\n\n    let mut dst: [T; DstLen] = std::mem::zeroed();\n    for i in 0..DstLen {\n        dst[i] = src[i + offset];\n    }\n\n    dst\n}\n\nmod test {\n    use super::subarray;\n\n    #[test]\n    unconstrained fn subarray_into_empty() {\n        // In all of these cases we're setting DstLen to be 0, so we always get back an empty array.\n        assert_eq(subarray::<Field, _, _>([], 0), []);\n        assert_eq(subarray([1, 2, 3, 4, 5], 0), []);\n        assert_eq(subarray([1, 2, 3, 4, 5], 2), []);\n    }\n\n    #[test]\n    unconstrained fn subarray_complete() {\n        assert_eq(subarray::<Field, _, _>([], 0), []);\n        assert_eq(subarray([1, 2, 3, 4, 5], 0), [1, 2, 3, 4, 5]);\n    }\n\n    #[test]\n    unconstrained fn subarray_different_end_sizes() {\n        // We implicitly select how many values to read in the size of the return array\n        assert_eq(subarray([1, 2, 3, 4, 5], 1), [2, 3, 4, 5]);\n        assert_eq(subarray([1, 2, 3, 4, 5], 1), [2, 3, 4]);\n        assert_eq(subarray([1, 2, 3, 4, 5], 1), [2, 3]);\n        assert_eq(subarray([1, 2, 3, 4, 5], 1), [2]);\n    }\n\n    #[test(should_fail_with = \"DstLen too large for offset\")]\n    unconstrained fn subarray_offset_too_large() {\n        // With an offset of 1 we can only request up to 4 elements\n        let _: [_; 5] = subarray([1, 2, 3, 4, 5], 1);\n    }\n\n    #[test(should_fail)]\n    unconstrained fn subarray_bad_return_value() {\n        assert_eq(subarray([1, 2, 3, 4, 5], 1), [3, 3, 4, 5]);\n    }\n}\n"
+    "192": {
+      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/notes.nr",
+      "source": "use crate::note::{HintedNote, note_interface::NoteType};\n\nuse crate::protocol::{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 to\n    // 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\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(aztec_prv_notifyCreatedNote)]\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(nullifier: Field, note_hash: Field, counter: u32) {\n    notify_nullified_note_oracle(nullifier, note_hash, counter);\n}\n\n#[oracle(aztec_prv_notifyNullifiedNote)]\nunconstrained fn notify_nullified_note_oracle(_nullifier: Field, _note_hash: Field, _counter: u32) {}\n\n#[oracle(aztec_utl_getNotes)]\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 <HintedNote<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_hinted_note_length: u32,\n) -> BoundedVec<[Field; <HintedNote<Note> as Packable>::N], MaxNotes>\nwhere\n    // TODO(https://github.com/noir-lang/noir/issues/9399): `Note: Packable` should work here.\n    HintedNote<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<HintedNote<Note>>; MaxNotes]\nwhere\n    Note: NoteType + Packable,\n{\n    let packed_hinted_notes: BoundedVec<[Field; <HintedNote<Note> as Packable>::N], MaxNotes> = 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        <HintedNote<Note> as Packable>::N,\n    );\n\n    let mut notes = BoundedVec::<_, MaxNotes>::new();\n    for i in 0..packed_hinted_notes.len() {\n        let hinted_note = HintedNote::unpack(packed_hinted_notes.get(i));\n        notes.push(hinted_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 the\n    // 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        notes_array[i] = Option::some(notes.get_unchecked(i));\n    }\n\n    notes_array\n}\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 associated\n/// index so that future notes get a different tag and can be discovered by the recipient. This change should only be\n/// persisted in a non-volatile database if the tagged log is found in an actual block - otherwise e.g. a reverting\n/// transaction can cause the sender to accidentally skip indices and later produce notes that are not found by the\n/// recipient.\npub unconstrained fn get_next_app_tag_as_sender(sender: AztecAddress, recipient: AztecAddress) -> Field {\n    get_next_app_tag_as_sender_oracle(sender, recipient)\n}\n\n#[oracle(aztec_prv_getNextAppTagAsSender)]\nunconstrained fn get_next_app_tag_as_sender_oracle(_sender: AztecAddress, _recipient: AztecAddress) -> Field {}\n\n/// Gets the sender for tags.\n///\n/// This unconstrained value is used as the sender when computing an unconstrained shared secret for a tag in order to\n/// emit a log. Constrained tagging should not use this as there is no guarantee that the recipient knows about the\n/// 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 'senderForTags' value\n/// (unless it is replaced).\npub unconstrained fn get_sender_for_tags() -> Option<AztecAddress> {\n    get_sender_for_tags_oracle()\n}\n\n#[oracle(aztec_prv_getSenderForTags)]\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 for a tag in order to\n/// emit a log. Constrained tagging should not use this as there is no guarantee that the recipient knows about the\n/// sender, and hence about the shared secret.\n///\n/// Account contracts typically set this value before calling other contracts. The value persists through nested calls,\n/// meaning all calls down the stack will use the same 'senderForTags' value (unless it is replaced by another call to\n/// 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(aztec_prv_setSenderForTags)]\nunconstrained fn set_sender_for_tags_oracle(_sender_for_tags: AztecAddress) {}\n"
     },
-    "241": {
-      "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 support capacity increases\n        let _: BoundedVec<_, 11> = subbvec(bvec, 0);\n    }\n\n    #[test(should_fail_with = \"DstLen too large for offset\")]\n    unconstrained fn subbvec_dst_len_too_large_for_offset() {\n        let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n        // This effectively requests a capacity increase, since there'd be just one element plus the 5 empty slots,\n        // which is less than 7.\n        let _: BoundedVec<_, 7> = subbvec(bvec, 4);\n    }\n}\n"
+    "193": {
+      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/nullifiers.nr",
+      "source": "//! Nullifier creation, existence checks, etc.\n\nuse crate::protocol::address::aztec_address::AztecAddress;\n\n/// Notifies the simulator that a nullifier has been created, so that its correct status (pending or settled) can be\n/// determined when reading nullifiers in subsequent private function calls. The first non-revertible nullifier emitted\n/// is also used to compute note nonces.\npub fn notify_created_nullifier(inner_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(inner_nullifier) };\n}\n\n#[oracle(aztec_prv_notifyCreatedNullifier)]\nunconstrained fn notify_created_nullifier_oracle(_inner_nullifier: Field) {}\n\n/// Returns `true` if the nullifier has been emitted in the same transaction, i.e. if [`notify_created_nullifier`] has\n/// been\n/// called for this inner nullifier from the contract with the specified address.\n///\n/// Note that despite sharing pending transaction information with the app, this is not a privacy leak: anyone in the\n/// network can always determine in which transaction a inner nullifier was emitted by a given contract by simply\n/// inspecting transaction effects. What _would_ constitute a leak would be to share the list of inner pending\n/// nullifiers, as that would reveal their preimages.\npub unconstrained fn is_nullifier_pending(inner_nullifier: Field, contract_address: AztecAddress) -> bool {\n    is_nullifier_pending_oracle(inner_nullifier, contract_address)\n}\n\n#[oracle(aztec_prv_isNullifierPending)]\nunconstrained fn is_nullifier_pending_oracle(_inner_nullifier: Field, _contract_address: AztecAddress) -> bool {}\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\n/// the current transaction is included in a block. While this might seem of little use at first, certain design\n/// patterns benefit from this abstraction (see e.g. `PrivateMutable`).\n// TODO(F-498): review naming consistency\npub unconstrained fn check_nullifier_exists(inner_nullifier: Field) -> bool {\n    does_nullifier_exist_oracle(inner_nullifier)\n}\n\n#[oracle(aztec_utl_doesNullifierExist)]\nunconstrained fn does_nullifier_exist_oracle(_inner_nullifier: Field) -> bool {}\n"
     },
-    "244": {
-      "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. For example, [1, 10, 3, ..., 0] (31 bytes) is encoded as [1 * 256^30 + 10 * 256^29 + 3 * 256^28 + ...\n/// + 0] Note: N must be a multiple of 31 bytes\npub fn bytes_to_fields<let N: u32>(bytes: [u8; N]) -> [Field; N / 31] {\n    // Assert that N is a multiple of 31\n    static_assert(N % 31 == 0, \"N must be a multiple of 31\");\n\n    let mut fields = [0; N / 31];\n\n    // Since N is a multiple of 31, we can simply process all chunks fully\n    for i in 0..N / 31 {\n        let mut field = 0;\n        for j in 0..31 {\n            // Shift the existing value left by 8 bits and add the new byte\n            field = field * 256 + bytes[i * 31 + j] as Field;\n        }\n        fields[i] = field;\n    }\n\n    fields\n}\n\n/// Converts an input BoundedVec of fields into a BoundedVec of bytes in big-endian order. Arbitrary Field arrays are\n/// not allowed: this is assumed to be an array obtained via `bytes_to_fields`, i.e. one that actually represents\n/// bytes. To convert a Field array into bytes, use `fields_to_bytes`.\n///\n/// Each input field must contain at most 31 bytes (this is constrained to be so). Each field is converted into 31\n/// big-endian bytes, and the resulting 31-byte chunks are concatenated back together in the order of the original\n/// fields.\npub fn bytes_from_fields<let N: u32>(fields: BoundedVec<Field, N>) -> BoundedVec<u8, N * 31> {\n    let mut bytes = BoundedVec::new();\n\n    for i in 0..fields.len() {\n        let field = fields.get(i);\n\n        // We expect that the field contains at most 31 bytes of information.\n        field.assert_max_bit_size::<248>();\n\n        // Now we can safely convert the field to 31 bytes.\n        let field_as_bytes: [u8; 31] = field.to_be_bytes();\n\n        for j in 0..31 {\n            bytes.push(field_as_bytes[j]);\n        }\n    }\n\n    bytes\n}\n\nmod tests {\n    use crate::utils::array::subarray;\n    use super::{bytes_from_fields, bytes_to_fields};\n\n    #[test]\n    unconstrained fn random_bytes_to_fields_and_back(input: [u8; 93]) {\n        let fields = bytes_to_fields(input);\n\n        // At this point in production, the log flies through the system and we get a BoundedVec on the other end. So\n        // we need to convert the field array to a BoundedVec to be able to feed it to the `bytes_from_fields`\n        // function.\n        let fields_as_bounded_vec = BoundedVec::<_, 6>::from_array(fields);\n\n        let bytes_back = bytes_from_fields(fields_as_bounded_vec);\n\n        // Compare the original input with the round-tripped result\n        assert_eq(bytes_back.len(), input.len());\n        assert_eq(subarray(bytes_back.storage(), 0), input);\n    }\n\n    #[test(should_fail_with = \"N must be a multiple of 31\")]\n    unconstrained fn bytes_to_fields_input_length_not_multiple_of_31() {\n        // Try to convert 32 bytes (not a multiple of 31) to fields\n        let _fields = bytes_to_fields([0; 32]);\n    }\n\n}\n"
+    "195": {
+      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/public_call.nr",
+      "source": "/// Validates public calldata by checking that the preimage exists and the cumulative size is within limits.\n///\n/// The check is unconstrained and the only purpose of it is to fail early in case of calldata overflow or a bug in\n/// calldata hashing.\npub(crate) fn assert_valid_public_call_data(calldata_hash: Field) {\n    // Safety: This oracle call returns nothing: we only call it for its side effects (validating the calldata).\n    // It is therefore always safe to call.\n    unsafe {\n        assert_valid_public_call_data_oracle_wrapper(calldata_hash)\n    }\n}\n\nunconstrained fn assert_valid_public_call_data_oracle_wrapper(calldata_hash: Field) {\n    assert_valid_public_call_data_oracle(calldata_hash)\n}\n\n#[oracle(aztec_prv_assertValidPublicCalldata)]\nunconstrained fn assert_valid_public_call_data_oracle(_calldata_hash: Field) {}\n"
     },
-    "245": {
-      "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. Each field is converted to a 32-byte big-endian array.\n///\n/// For example, if you have a field array [123, 456], it will be converted to a 64-byte array:\n/// [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,123,  // First field (32 bytes)\n/// 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,200]  // Second field (32 bytes)\n///\n/// Since a field is ~254 bits, you'll end up with a subtle 2-bit \"gap\" at the big end, every 32 bytes. Be careful that\n/// such a gap doesn't leak information! This could happen if you for example expected the output to be\n/// indistinguishable from random bytes.\npub fn fields_to_bytes<let N: u32>(fields: [Field; N]) -> [u8; 32 * N] {\n    let mut bytes = [0; 32 * N];\n\n    for i in 0..N {\n        let field_as_bytes: [u8; 32] = fields[i].to_be_bytes();\n\n        for j in 0..32 {\n            bytes[i * 32 + j] = field_as_bytes[j];\n        }\n    }\n\n    bytes\n}\n\n/// Converts an input BoundedVec of bytes into a BoundedVec of fields. Arbitrary byte arrays are not allowed: this is\n/// assumed to be an array obtained via `fields_to_bytes`, i.e. one that actually represents fields. To convert a byte\n/// array into Fields, use `bytes_to_fields`.\n///\n/// The input bytes are chunked into chunks of 32 bytes. Each 32-byte chunk is viewed as big-endian, and is converted\n/// into a Field. For example, [1, 10, 3, ..., 0] (32 bytes) is encoded as [1 * 256^31 + 10 * 256^30 + 3 * 256^29 + ...\n/// + 0] Note 1: N must be a multiple of 32 bytes Note 2: The max value check code was taken from\n/// std::field::to_be_bytes function.\npub fn fields_from_bytes<let N: u32>(bytes: BoundedVec<u8, N>) -> BoundedVec<Field, N / 32> {\n    // Assert that input length is a multiple of 32\n    assert(bytes.len() % 32 == 0, \"Input length must be a multiple of 32\");\n\n    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. So\n        // we need to convert the field array to a BoundedVec to be able to feed it to the `fields_from_bytes`\n        // function. 113 is an arbitrary max length that is larger than the input length of 96.\n        let bytes_as_bounded_vec = BoundedVec::<_, 113>::from_array(bytes);\n\n        // Convert back to fields\n        let fields_back = fields_from_bytes(bytes_as_bounded_vec);\n\n        // Compare the original input with the round-tripped result\n        assert_eq(fields_back.len(), input.len());\n        assert_eq(subarray(fields_back.storage(), 0), input);\n    }\n\n    #[test(should_fail_with = \"Input length must be a multiple of 32\")]\n    unconstrained fn to_fields_assert() {\n        // 143 is an arbitrary max length that is larger than 33\n        let input = BoundedVec::<_, 143>::from_array([\n            1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29,\n            30, 31, 32, 33,\n        ]);\n\n        // This should fail since 33 is not a multiple of 32\n        let _fields = fields_from_bytes(input);\n    }\n\n    #[test]\n    unconstrained fn fields_from_bytes_max_value() {\n        let max_field_as_bytes: [u8; 32] = (-1).to_be_bytes();\n        let input = BoundedVec::<_, 32>::from_array(max_field_as_bytes);\n\n        let fields = fields_from_bytes(input);\n\n        // The result should be a largest value storable in a field (-1 since we are modulo-ing)\n        assert_eq(fields.get(0), -1);\n    }\n\n    // In this test we verify that overflow check works by taking the max allowed value, bumping a random byte and then\n    // feeding it to `fields_from_bytes` as input.\n    #[test(should_fail_with = \"Value does not fit in field\")]\n    unconstrained fn fields_from_bytes_overflow(random_value: u8) {\n        let index_of_byte_to_bump = random_value % 32;\n\n        // Obtain the byte representation of the maximum field value\n        let max_field_value_as_bytes: [u8; 32] = (-1).to_be_bytes();\n\n        let byte_to_bump = max_field_value_as_bytes[index_of_byte_to_bump as u32];\n\n        // Skip test execution if the selected byte is already at maximum value (255). This is acceptable since we are\n        // using fuzz testing to generate many test cases.\n        if byte_to_bump != 255 {\n            let mut input = BoundedVec::<_, 32>::from_array(max_field_value_as_bytes);\n\n            // Increment the selected byte to exceed the field's maximum value\n            input.set(index_of_byte_to_bump as u32, byte_to_bump + 1);\n\n            // Attempt the conversion, which should fail due to the value exceeding the field's capacity\n            let _fields = fields_from_bytes(input);\n        }\n    }\n\n}\n"
+    "199": {
+      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/tx_phase.nr",
+      "source": "/// Notifies PXE of the side effect counter at which the revertible phase begins.\n///\n/// PXE uses it to classify notes and nullifiers as revertible or non-revertible in its note cache. This information is\n/// then fed to kernels as hints.\npub(crate) fn notify_revertible_phase_start(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_revertible_phase_start_oracle_wrapper(counter) };\n}\n\n/// Returns whether a side effect counter falls in the revertible phase of the transaction.\npub(crate) unconstrained fn is_execution_in_revertible_phase(current_counter: u32) -> bool {\n    is_execution_in_revertible_phase_oracle(current_counter)\n}\n\nunconstrained fn notify_revertible_phase_start_oracle_wrapper(counter: u32) {\n    notify_revertible_phase_start_oracle(counter);\n}\n\n#[oracle(aztec_prv_notifyRevertiblePhaseStart)]\nunconstrained fn notify_revertible_phase_start_oracle(_counter: u32) {}\n\n#[oracle(aztec_prv_isExecutionInRevertiblePhase)]\nunconstrained fn is_execution_in_revertible_phase_oracle(current_counter: u32) -> bool {}\n"
     },
-    "248": {
-      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/point.nr",
-      "source": "use crate::protocol::{point::Point, utils::field::sqrt};\n\n// I am storing the modulus minus 1 divided by 2 here because full modulus would throw \"String literal too large\" error\n// Full modulus is 21888242871839275222246405745257275088548364400416034343698204186575808495617\nglobal BN254_FR_MODULUS_DIV_2: Field = 10944121435919637611123202872628637544274182200208017171849102093287904247808;\n\n/// Returns: true if p.y <= MOD_DIV_2, else false.\npub fn get_sign_of_point(p: Point) -> bool {\n    // We store only a \"sign\" of the y coordinate because the rest can be derived from the x coordinate. To get the\n    // sign we check if the y coordinate is less or equal than the field's modulus minus 1 divided by 2. Ideally we'd\n    // do `y <= MOD_DIV_2`, but there's no `lte` function, so instead we do `!(y > MOD_DIV_2)`, which is equivalent,\n    // and then rewrite that as `!(MOD_DIV_2 < y)`, since we also have no `gt` function.\n    !BN254_FR_MODULUS_DIV_2.lt(p.y)\n}\n\n/// Returns a `Point` in the Grumpkin curve given its x coordinate.\n///\n/// Because not all values in the field are valid x coordinates of points in the curve (i.e. there is no corresponding\n/// y value in the field that satisfies the curve equation), it may not be possible to reconstruct a `Point`.\n/// `Option::none()` is returned in such cases.\npub fn point_from_x_coord(x: Field) -> Option<Point> {\n    // y ^ 2 = x ^ 3 - 17\n    let rhs = x * x * x - 17;\n    sqrt(rhs).map(|y| Point { x, y, is_infinite: false })\n}\n\n/// Returns a `Point` in the Grumpkin curve given its x coordinate and sign for the y coordinate.\n///\n/// Because not all values in the field are valid x coordinates of points in the curve (i.e. there is no corresponding\n/// y value in the field that satisfies the curve equation), it may not be possible to reconstruct a `Point`.\n/// `Option::none()` is returned in such cases.\n///\n/// @param x - The x coordinate of the point @param sign - The \"sign\" of the y coordinate - determines whether y <=\n/// (Fr.MODULUS - 1) / 2\npub fn point_from_x_coord_and_sign(x: Field, sign: bool) -> Option<Point> {\n    // y ^ 2 = x ^ 3 - 17\n    let rhs = x * x * x - 17;\n\n    sqrt(rhs).map(|y| {\n        // If there is a square root, we need to ensure it has the correct \"sign\"\n        let y_is_positive = !BN254_FR_MODULUS_DIV_2.lt(y);\n        let final_y = if y_is_positive == sign { y } else { -y };\n        Point { x, y: final_y, is_infinite: false }\n    })\n}\n\nmod test {\n    use crate::protocol::point::Point;\n    use crate::utils::point::{\n        BN254_FR_MODULUS_DIV_2, get_sign_of_point, point_from_x_coord, point_from_x_coord_and_sign,\n    };\n\n    #[test]\n    unconstrained fn test_point_from_x_coord_and_sign() {\n        // Test positive y coordinate\n        let x = 0x1af41f5de96446dc3776a1eb2d98bb956b7acd9979a67854bec6fa7c2973bd73;\n        let sign = true;\n        let p = point_from_x_coord_and_sign(x, sign).unwrap();\n\n        assert_eq(p.x, x);\n        assert_eq(p.y, 0x07fc22c7f2c7057571f137fe46ea9c95114282bc95d37d71ec4bfb88de457d4a);\n        assert_eq(p.is_infinite, false);\n\n        // Test negative y coordinate\n        let x2 = 0x247371652e55dd74c9af8dbe9fb44931ba29a9229994384bd7077796c14ee2b5;\n        let sign2 = false;\n        let p2 = point_from_x_coord_and_sign(x2, sign2).unwrap();\n\n        assert_eq(p2.x, x2);\n        assert_eq(p2.y, 0x26441aec112e1ae4cee374f42556932001507ad46e255ffb27369c7e3766e5c0);\n        assert_eq(p2.is_infinite, false);\n    }\n\n    #[test]\n    unconstrained fn test_point_from_x_coord_valid() {\n        // x = 8 is a known quadratic residue - should give a valid point\n        let result = point_from_x_coord(Field::from(8));\n        assert(result.is_some());\n\n        let point = result.unwrap();\n        assert_eq(point.x, Field::from(8));\n        // Check curve equation y^2 = x^3 - 17\n        assert_eq(point.y * point.y, point.x * point.x * point.x - 17);\n    }\n\n    #[test]\n    unconstrained fn test_point_from_x_coord_invalid() {\n        // x = 3 is a non-residue for this curve - should give None\n        let x = Field::from(3);\n        let maybe_point = point_from_x_coord(x);\n        assert(maybe_point.is_none());\n    }\n\n    #[test]\n    unconstrained fn test_both_roots_satisfy_curve() {\n        // Derive a point from x = 8 (known to be valid from test_point_from_x_coord_valid)\n        let x: Field = 8;\n        let point = point_from_x_coord(x).unwrap();\n\n        // Check y satisfies curve equation\n        assert_eq(point.y * point.y, x * x * x - 17);\n\n        // Check -y also satisfies curve equation\n        let neg_y = 0 - point.y;\n        assert_eq(neg_y * neg_y, x * x * x - 17);\n\n        // Verify they are different (unless y = 0)\n        assert(point.y != neg_y);\n    }\n\n    #[test]\n    unconstrained fn test_point_from_x_coord_and_sign_invalid() {\n        // x = 3 has no valid point on the curve (from test_point_from_x_coord_invalid)\n        let x = Field::from(3);\n        let result_positive = point_from_x_coord_and_sign(x, true);\n        let result_negative = point_from_x_coord_and_sign(x, false);\n\n        assert(result_positive.is_none());\n        assert(result_negative.is_none());\n    }\n\n    #[test]\n    unconstrained fn test_get_sign_of_point() {\n        // Derive a point from x = 8, then test both possible y values\n        let point = point_from_x_coord(8).unwrap();\n        let neg_point = Point { x: point.x, y: 0 - point.y, is_infinite: false };\n\n        // One should be \"positive\" (y <= MOD_DIV_2) and one \"negative\"\n        let sign1 = get_sign_of_point(point);\n        let sign2 = get_sign_of_point(neg_point);\n        assert(sign1 != sign2);\n\n        // y = 0 should return true (0 <= MOD_DIV_2)\n        let zero_y_point = Point { x: 0, y: 0, is_infinite: false };\n        assert(get_sign_of_point(zero_y_point) == true);\n\n        // y = MOD_DIV_2 should return true (exactly at boundary)\n        let boundary_point = Point { x: 0, y: BN254_FR_MODULUS_DIV_2, is_infinite: false };\n        assert(get_sign_of_point(boundary_point) == true);\n\n        // y = MOD_DIV_2 + 1 should return false (just over boundary)\n        let over_boundary_point = Point { x: 0, y: BN254_FR_MODULUS_DIV_2 + 1, is_infinite: false };\n        assert(get_sign_of_point(over_boundary_point) == false);\n    }\n\n    #[test]\n    unconstrained fn test_point_from_x_coord_zero() {\n        // x = 0: y^2 = 0^3 - 17 = -17, which is not a quadratic residue in BN254 scalar field\n        let result = point_from_x_coord(0);\n        assert(result.is_none());\n    }\n\n    #[test]\n    unconstrained fn test_bn254_fr_modulus_div_2() {\n        // Verify that BN254_FR_MODULUS_DIV_2 == (p - 1) / 2 This means: 2 * BN254_FR_MODULUS_DIV_2 + 1 == p == 0 (in\n        // the field)\n        assert_eq(2 * BN254_FR_MODULUS_DIV_2 + 1, 0);\n    }\n\n}\n"
+    "200": {
+      "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 `aztec_utl_assertCompatibleOracleVersion` oracle is\n/// called and if the oracle version is incompatible an error is thrown.\npub global ORACLE_VERSION: Field = 22;\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(aztec_utl_assertCompatibleOracleVersion)]\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 aztec cli 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"
     },
-    "259": {
+    "267": {
       "path": "/home/aztec-dev/nargo/github.com/noir-lang/poseidon/v0.2.3/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)\n    }\n\n    pub(crate) fn new(iv: Field) -> Poseidon2 {\n        let mut result =\n            Poseidon2 { cache: [0; 3], state: [0; 4], cache_size: 0, squeeze_mode: false };\n        result.state[RATE] = iv;\n        result\n    }\n\n    fn perform_duplex(&mut self) {\n        // add the cache into sponge state\n        self.state[0] += self.cache[0];\n        self.state[1] += self.cache[1];\n        self.state[2] += self.cache[2];\n        self.state = crate::poseidon2_permutation(self.state, 4);\n    }\n\n    fn absorb(&mut self, input: Field) {\n        assert(!self.squeeze_mode);\n        if self.cache_size == RATE {\n            // If we're absorbing, and the cache is full, apply the sponge permutation to compress the cache\n            self.perform_duplex();\n            self.cache[0] = input;\n            self.cache_size = 1;\n        } else {\n            // If we're absorbing, and the cache is not full, add the input into the cache\n            self.cache[self.cache_size] = input;\n            self.cache_size += 1;\n        }\n    }\n\n    fn squeeze(&mut self) -> Field {\n        assert(!self.squeeze_mode);\n        // If we're in absorb mode, apply sponge permutation to compress the cache.\n        self.perform_duplex();\n        self.squeeze_mode = true;\n\n        // Pop one item off the top of the permutation and return it.\n        self.state[0]\n    }\n\n    fn hash_internal<let N: u32>(input: [Field; N], in_len: u32) -> Field {\n        let two_pow_64 = 18446744073709551616;\n        let iv: Field = (in_len as Field) * two_pow_64;\n        let mut state = [0; 4];\n        state[RATE] = iv;\n\n        if std::runtime::is_unconstrained() {\n            for i in 0..(in_len / RATE) {\n                state[0] += input[i * RATE];\n                state[1] += input[i * RATE + 1];\n                state[2] += input[i * RATE + 2];\n                state = crate::poseidon2_permutation(state, 4);\n            }\n\n            // handle remaining elements after last full RATE-sized chunk\n            let num_extra_fields = in_len % RATE;\n            if num_extra_fields != 0 {\n                let remainder_start = in_len - num_extra_fields;\n                state[0] += input[remainder_start];\n                if num_extra_fields > 1 {\n                    state[1] += input[remainder_start + 1]\n                }\n            }\n        } else {\n            let mut states: [[Field; 4]; N / RATE + 1] = [[0; 4]; N / RATE + 1];\n            states[0] = state;\n\n            // process all full RATE-sized chunks, storing state after each permutation\n            for chunk_idx in 0..(N / RATE) {\n                for i in 0..RATE {\n                    state[i] += input[chunk_idx * RATE + i];\n                }\n                state = crate::poseidon2_permutation(state, 4);\n                states[chunk_idx + 1] = state;\n            }\n\n            // get state at the last full block before in_len\n            let first_partially_filled_chunk = in_len / RATE;\n            state = states[first_partially_filled_chunk];\n\n            // handle remaining elements after last full RATE-sized chunk\n            let remainder_start = (in_len / RATE) * RATE;\n            for j in 0..RATE {\n                let idx = remainder_start + j;\n                if idx < in_len {\n                    state[j] += input[idx];\n                }\n            }\n        }\n\n        // always run final permutation unless we just completed a full chunk\n        // still need to permute once if in_len is 0\n        if (in_len == 0) | (in_len % RATE != 0) {\n            state = crate::poseidon2_permutation(state, 4)\n        };\n\n        state[0]\n    }\n}\n\npub struct Poseidon2Hasher {\n    _state: [Field],\n}\n\nimpl Hasher for Poseidon2Hasher {\n    fn finish(self) -> Field {\n        let iv: Field = (self._state.len() as Field) * 18446744073709551616; // iv = (self._state.len() << 64)\n        let mut sponge = Poseidon2::new(iv);\n        for i in 0..self._state.len() {\n            sponge.absorb(self._state[i]);\n        }\n        sponge.squeeze()\n    }\n\n    fn write(&mut self, input: Field) {\n        self._state = self._state.push_back(input);\n    }\n}\n\nimpl Default for Poseidon2Hasher {\n    fn default() -> Self {\n        Poseidon2Hasher { _state: &[] }\n    }\n}\n"
     },
-    "3": {
-      "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 vector.\n    ///\n    /// ```noir\n    /// let array = [1, 2];\n    /// let vector = array.as_vector();\n    /// assert_eq(vector, [1, 2].as_vector());\n    /// ```\n    #[builtin(as_vector)]\n    pub fn as_vector(self) -> [T] {}\n\n    /// Returns this array as a vector.\n    /// This method is deprecated in favor of `as_vector`.\n    ///\n    /// ```noir\n    /// let array = [1, 2];\n    /// let vector = array.as_slice();\n    /// assert_eq(vector, [1, 2].as_vector());\n    /// ```\n    #[builtin(as_vector)]\n    #[deprecated(\"This method has been renamed to `as_vector`\")]\n    pub fn as_slice(self) -> [T] {}\n\n    /// Applies a function to each element of this array, returning a new array containing the mapped elements.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// let a = [1, 2, 3];\n    /// let b = a.map(|a| a * 2);\n    /// assert_eq(b, [2, 4, 6]);\n    /// ```\n    pub fn map<U, Env>(self, f: fn[Env](T) -> U) -> [U; N] {\n        let uninitialized = crate::mem::zeroed();\n        let mut ret = [uninitialized; N];\n\n        for i in 0..self.len() {\n            ret[i] = f(self[i]);\n        }\n\n        ret\n    }\n\n    /// Applies a function to each element of this array along with its index,\n    /// returning a new array containing the mapped elements.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// let a = [1, 2, 3];\n    /// let b = a.mapi(|i, a| i + a * 2);\n    /// assert_eq(b, [2, 5, 8]);\n    /// ```\n    pub fn mapi<U, Env>(self, f: fn[Env](u32, T) -> U) -> [U; N] {\n        let uninitialized = crate::mem::zeroed();\n        let mut ret = [uninitialized; N];\n\n        for i in 0..self.len() {\n            ret[i] = f(i, self[i]);\n        }\n\n        ret\n    }\n\n    /// Applies a function to each element of this array.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// let a = [1, 2, 3];\n    /// let mut b = [0; 3];\n    /// let mut i = 0;\n    /// a.for_each(|x| {\n    ///     b[i] = x;\n    ///     i += 1;\n    /// });\n    /// assert_eq(a, b);\n    /// ```\n    pub fn for_each<Env>(self, f: fn[Env](T) -> ()) {\n        for i in 0..self.len() {\n            f(self[i]);\n        }\n    }\n\n    /// Applies a function to each element of this array along with its index.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// let a = [1, 2, 3];\n    /// let mut b = [0; 3];\n    /// a.for_eachi(|i, x| {\n    ///     b[i] = x;\n    /// });\n    /// assert_eq(a, b);\n    /// ```\n    pub fn for_eachi<Env>(self, f: fn[Env](u32, T) -> ()) {\n        for i in 0..self.len() {\n            f(i, self[i]);\n        }\n    }\n\n    /// Applies a function to each element of the array, returning the final accumulated value. The first\n    /// parameter is the initial value.\n    ///\n    /// This is a left fold, so the given function will be applied to the accumulator and first element of\n    /// the array, then the second, and so on. For a given call the expected result would be equivalent to:\n    ///\n    /// ```rust\n    /// let a1 = [1];\n    /// let a2 = [1, 2];\n    /// let a3 = [1, 2, 3];\n    ///\n    /// let f = |a, b| a - b;\n    /// a1.fold(10, f); //=> f(10, 1)\n    /// a2.fold(10, f); //=> f(f(10, 1), 2)\n    /// a3.fold(10, f); //=> f(f(f(10, 1), 2), 3)\n    ///\n    /// assert_eq(a3.fold(10, f), 10 - 1 - 2 - 3);\n    /// ```\n    pub fn fold<U, Env>(self, mut accumulator: U, f: fn[Env](U, T) -> U) -> U {\n        for elem in self {\n            accumulator = f(accumulator, elem);\n        }\n        accumulator\n    }\n\n    /// Same as fold, but uses the first element as the starting element.\n    ///\n    /// Requires the input array to be non-empty.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let arr = [1, 2, 3, 4];\n    ///     let reduced = arr.reduce(|a, b| a + b);\n    ///     assert(reduced == 10);\n    /// }\n    /// ```\n    pub fn reduce<Env>(self, f: fn[Env](T, T) -> T) -> T {\n        let mut accumulator = self[0];\n        for i in 1..self.len() {\n            accumulator = f(accumulator, self[i]);\n        }\n        accumulator\n    }\n\n    /// Returns true if all the elements in this array satisfy the given predicate.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let arr = [2, 2, 2, 2, 2];\n    ///     let all = arr.all(|a| a == 2);\n    ///     assert(all);\n    /// }\n    /// ```\n    pub fn all<Env>(self, predicate: fn[Env](T) -> bool) -> bool {\n        let mut ret = true;\n        for elem in self {\n            ret &= predicate(elem);\n        }\n        ret\n    }\n\n    /// Returns true if any of the elements in this array satisfy the given predicate.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let arr = [2, 2, 2, 2, 5];\n    ///     let any = arr.any(|a| a == 5);\n    ///     assert(any);\n    /// }\n    /// ```\n    pub fn any<Env>(self, predicate: fn[Env](T) -> bool) -> bool {\n        let mut ret = false;\n        for elem in self {\n            ret |= predicate(elem);\n        }\n        ret\n    }\n\n    /// Concatenates this array with another array.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let arr1 = [1, 2, 3, 4];\n    ///     let arr2 = [6, 7, 8, 9, 10, 11];\n    ///     let concatenated_arr = arr1.concat(arr2);\n    ///     assert(concatenated_arr == [1, 2, 3, 4, 6, 7, 8, 9, 10, 11]);\n    /// }\n    /// ```\n    pub fn concat<let M: u32>(self, array2: [T; M]) -> [T; N + M] {\n        let mut result = [crate::mem::zeroed(); N + M];\n        for i in 0..N {\n            result[i] = self[i];\n        }\n        for i in 0..M {\n            result[i + N] = array2[i];\n        }\n        result\n    }\n}\n\nimpl<T, let N: u32> [T; N]\nwhere\n    T: Ord + Eq,\n{\n    /// Returns a new sorted array. The original array remains untouched. Notice that this function will\n    /// only work for arrays of fields or integers, not for any arbitrary type. This is because the sorting\n    /// logic it uses internally is optimized specifically for these values. If you need a sort function to\n    /// sort any type, you should use the [`Self::sort_via`] function.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// fn main() {\n    ///     let arr = [42, 32];\n    ///     let sorted = arr.sort();\n    ///     assert(sorted == [32, 42]);\n    /// }\n    /// ```\n    pub fn sort(self) -> Self {\n        self.sort_via(|a, b| a <= b)\n    }\n}\n\nimpl<T, let N: u32> [T; N]\nwhere\n    T: Eq,\n{\n    /// Returns a new sorted array by sorting it with a custom comparison function.\n    /// The original array remains untouched.\n    /// The ordering function must return true if the first argument should be sorted to be before the second argument or is equal to the second argument.\n    ///\n    /// Using this method with an operator like `<` that does not return `true` for equal values will result in an assertion failure for arrays with equal elements.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// fn main() {\n    ///     let arr = [42, 32]\n    ///     let sorted_ascending = arr.sort_via(|a, b| a <= b);\n    ///     assert(sorted_ascending == [32, 42]); // verifies\n    ///\n    ///     let sorted_descending = arr.sort_via(|a, b| a >= b);\n    ///     assert(sorted_descending == [32, 42]); // does not verify\n    /// }\n    /// ```\n    pub fn sort_via<Env>(self, ordering: fn[Env](T, T) -> bool) -> Self {\n        // Safety: `sorted` array is checked to be:\n        // a. a permutation of `input`'s elements\n        // b. satisfying the predicate `ordering`\n        let sorted = unsafe { quicksort::quicksort(self, ordering) };\n\n        if !is_unconstrained() {\n            for i in 0..N - 1 {\n                assert(\n                    ordering(sorted[i], sorted[i + 1]),\n                    \"Array has not been sorted correctly according to `ordering`.\",\n                );\n            }\n            check_shuffle::check_shuffle(self, sorted);\n        }\n        sorted\n    }\n}\n\nimpl<let N: u32> [u8; N] {\n    /// Converts a byte array of type `[u8; N]` to a string. Note that this performs no UTF-8 validation -\n    /// the given array is interpreted as-is as a string.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// fn main() {\n    ///     let hi = [104, 105].as_str_unchecked();\n    ///     assert_eq(hi, \"hi\");\n    /// }\n    /// ```\n    #[builtin(array_as_str_unchecked)]\n    pub fn as_str_unchecked(self) -> str<N> {}\n}\n\nimpl<let N: u32> From<str<N>> for [u8; N] {\n    /// Returns an array of the string bytes.\n    fn from(s: str<N>) -> Self {\n        s.as_bytes()\n    }\n}\n\nmod test {\n    #[test]\n    fn map_empty() {\n        assert_eq([].map(|x| x + 1), []);\n    }\n\n    global arr_with_100_values: [u32; 100] = [\n        42, 123, 87, 93, 48, 80, 50, 5, 104, 84, 70, 47, 119, 66, 71, 121, 3, 29, 42, 118, 2, 54,\n        89, 44, 81, 0, 26, 106, 68, 96, 84, 48, 95, 54, 45, 32, 89, 100, 109, 19, 37, 41, 19, 98,\n        53, 114, 107, 66, 6, 74, 13, 19, 105, 64, 123, 28, 44, 50, 89, 58, 123, 126, 21, 43, 86, 35,\n        21, 62, 82, 0, 108, 120, 72, 72, 62, 80, 12, 71, 70, 86, 116, 73, 38, 15, 127, 81, 30, 8,\n        125, 28, 26, 69, 114, 63, 27, 28, 61, 42, 13, 32,\n    ];\n    global expected_with_100_values: [u32; 100] = [\n        0, 0, 2, 3, 5, 6, 8, 12, 13, 13, 15, 19, 19, 19, 21, 21, 26, 26, 27, 28, 28, 28, 29, 30, 32,\n        32, 35, 37, 38, 41, 42, 42, 42, 43, 44, 44, 45, 47, 48, 48, 50, 50, 53, 54, 54, 58, 61, 62,\n        62, 63, 64, 66, 66, 68, 69, 70, 70, 71, 71, 72, 72, 73, 74, 80, 80, 81, 81, 82, 84, 84, 86,\n        86, 87, 89, 89, 89, 93, 95, 96, 98, 100, 104, 105, 106, 107, 108, 109, 114, 114, 116, 118,\n        119, 120, 121, 123, 123, 123, 125, 126, 127,\n    ];\n    fn sort_u32(a: u32, b: u32) -> bool {\n        a <= b\n    }\n\n    #[test]\n    fn test_sort() {\n        let 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"
-    },
-    "317": {
+    "325": {
       "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::{AZTEC_ADDRESS_LENGTH, DOM_SEP__CONTRACT_ADDRESS_V1, MAX_FIELD_VALUE},\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::sqrt,\n};\n\n// We do below because `use crate::point::Point;` does not work\nuse 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 as x, and then solving for y in the\n        // equation which defines the grumpkin curve:\n        // y^2 = x^3 - 17; x = address\n        let x = self.inner;\n        let y_squared = x * x * x - 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        sqrt(y_squared).map(|y| {\n            // If we get a negative y coordinate (y > (r - 1) / 2), we swap it to the\n            // positive one (where y <= (r - 1) / 2) by negating it.\n            let final_y = if Self::is_positive(y) { y } else { -y };\n\n            AddressPoint { inner: Point { x: self.inner, y: final_y, is_infinite: false } }\n        })\n    }\n\n    /// Determines whether a y-coordinate is in the lower (positive) or upper (negative) \"half\" of the field.\n    /// I.e.\n    /// y <= (r - 1)/2 => positive.\n    /// y > (r - 1)/2 => negative.\n    /// An AddressPoint always uses the \"positive\" y.\n    fn is_positive(y: Field) -> bool {\n        // Note: The field modulus r is MAX_FIELD_VALUE + 1.\n        let MID = MAX_FIELD_VALUE / 2; // (r - 1) / 2\n        let MID_PLUS_1 = MID + 1; // (r - 1)/2 + 1\n        // Note: y <= m implies y < m + 1.\n        y.lt(MID_PLUS_1)\n    }\n\n    pub fn compute(public_keys: PublicKeys, partial_address: PartialAddress) -> AztecAddress {\n        //\n        //                          address = address_point.x\n        //                                          |\n        //                                    address_point = pre_address * G + Ivpk_m (always choose \"positive\" y-coord)\n        //                                                        |               ^\n        //                                                        |               |.....................\n        //                                                    pre_address                              .\n        //                                               /                   \\                         .\n        //                                             /                       \\                       .\n        //                               partial_address                        public_keys_hash       .\n        //                           /                    \\                     /   /    \\    \\        .\n        //                         /                        \\              Npk_m Ivpk_m Ovpk_m Tpk_m   .\n        //          contract_class_id                         \\                     |...................\n        //             /   |    \\                               \\\n        // artifact_hash   |    public_bytecode_commitment       salted_initialization_hash\n        //                 |                                         /     /        \\\n        //     private_function_tree_root              deployer_address  salt   initialization_hash\n        //             /       \\                                                /              \\\n        //          ...          ...                              constructor_fn_selector   constructor_args_hash\n        //         /                \\\n        //     /     \\            /      \\\n        //   leaf   leaf        leaf    leaf\n        //           ^\n        //           |\n        //           |---h(function_selector, vk_hash)\n        //               ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n        //               Each of these represents a private function of the contract.\n\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            DOM_SEP__CONTRACT_ADDRESS_V1,\n        );\n\n        // Note: `.add()` will fail within the blackbox fn if either of the points are not on the curve. (See tests below).\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_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 check_max_field_value() {\n    // Check that it is indeed r-1.\n    assert_eq(MAX_FIELD_VALUE + 1, 0);\n}\n\n#[test]\nfn check_is_positive() {\n    assert(AztecAddress::is_positive(0));\n    assert(AztecAddress::is_positive(1));\n    assert(!AztecAddress::is_positive(-1));\n    assert(AztecAddress::is_positive(MAX_FIELD_VALUE / 2));\n    assert(!AztecAddress::is_positive((MAX_FIELD_VALUE / 2) + 1));\n}\n\n// Gives us confidence that we don't need to manually check that the input public keys need to be on the curve for `add`,\n// because the blackbox function does this check for us.\n#[test(should_fail_with = \"is not on curve\")]\nfn check_embedded_curve_point_add() {\n    // Choose a point not on the curve:\n    let p1 = Point { x: 1, y: 1, is_infinite: false };\n    let p2 = Point::generator();\n    let _ = p1 + p2;\n}\n\n// Gives us confidence that we don't need to manually check that the input public keys need to be on the curve for `add`,\n// because the blackbox function does this check for us.\n#[test(should_fail_with = \"is not on curve\")]\nfn check_embedded_curve_point_add_2() {\n    // Choose a point not on the curve in the 2nd position.\n    let p1 = Point::generator();\n    let p2 = Point { x: 1, y: 1, is_infinite: false };\n    let _ = p1 + p2;\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        0x2f66081d4bb077fbe8e8abe96a3516a713a3d7e34360b4e985da0da95092b37d;\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], DOM_SEP__CONTRACT_ADDRESS_V1);\n    let expected_computed_preaddress_from_partial_and_pubkey =\n        0x286c7755f2924b1e53b00bcaf1adaffe7287bd74bba7a02f4ab867e3892d28da;\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(point.y * point.y, point.x * point.x * point.x - 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"
+      "source": "use crate::{\n    address::{\n        partial_address::PartialAddress, salted_initialization_hash::SaltedInitializationHash,\n    },\n    constants::{AZTEC_ADDRESS_LENGTH, DOM_SEP__CONTRACT_ADDRESS_V1, MAX_FIELD_VALUE},\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::sqrt,\n};\n\n// We do below because `use crate::point::Point;` does not work\nuse 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 `true` if the address is valid.\n    ///\n    /// An invalid address is one that can be proven to not be correctly derived, meaning it contains no contract code,\n    /// public keys, etc., and can therefore not receive messages nor execute calls.\n    pub fn is_valid(self) -> bool {\n        self.get_y().is_some()\n    }\n\n    /// Returns an address's [`AddressPoint`].\n    ///\n    /// This can be used to create shared secrets with the owner of the address. If the address is invalid (see\n    /// [`AztecAddress::is_valid`]) then this returns `Option::none()`, and no shared secrets can be created.\n    pub fn to_address_point(self) -> Option<AddressPoint> {\n        self.get_y().map(|y| {\n            // If we get a negative y coordinate (y > (r - 1) / 2), we swap it to the\n            // positive one (where y <= (r - 1) / 2) by negating it.\n            let final_y = if Self::is_positive(y) { y } else { -y };\n\n            AddressPoint { inner: Point { x: self.inner, y: final_y, is_infinite: false } }\n        })\n    }\n\n    /// Determines whether a y-coordinate is in the lower (positive) or upper (negative) \"half\" of the field.\n    /// I.e.\n    /// y <= (r - 1)/2 => positive.\n    /// y > (r - 1)/2 => negative.\n    /// An AddressPoint always uses the \"positive\" y.\n    fn is_positive(y: Field) -> bool {\n        // Note: The field modulus r is MAX_FIELD_VALUE + 1.\n        let MID = MAX_FIELD_VALUE / 2; // (r - 1) / 2\n        let MID_PLUS_1 = MID + 1; // (r - 1)/2 + 1\n        // Note: y <= m implies y < m + 1.\n        y.lt(MID_PLUS_1)\n    }\n\n    /// Returns one of the two possible y-coordinates.\n    ///\n    /// Not all `AztecAddresses` are valid, in which case there is no corresponding y-coordinate. This returns\n    /// `Option::none()` for invalid addresses.\n    ///\n    /// An `AztecAddress` is defined by an x-coordinate, for which two y-coordinates exist as solutions to the curve\n    /// equation. This function returns either of them. Note that an [`AddressPoint`] must **always** have a positive\n    /// y-coordinate - if trying to obtain the underlying point use [`AztecAddress::to_address_point`] instead.\n    fn get_y(self) -> Option<Field> {\n        // We compute the address point by taking our address as x, and then solving for y in the\n        // equation which defines the grumpkin curve:\n        // y^2 = x^3 - 17; x = address\n        let x = self.inner;\n        let y_squared = x * x * x - 17;\n\n        sqrt(y_squared)\n    }\n\n    pub fn compute(public_keys: PublicKeys, partial_address: PartialAddress) -> AztecAddress {\n        //\n        //                          address = address_point.x\n        //                                          |\n        //                                    address_point = pre_address * G + Ivpk_m (always choose \"positive\" y-coord)\n        //                                                        |               ^\n        //                                                        |               |.....................\n        //                                                    pre_address                              .\n        //                                               /                   \\                         .\n        //                                             /                       \\                       .\n        //                               partial_address                        public_keys_hash       .\n        //                           /                    \\                     /   /    \\    \\        .\n        //                         /                        \\              Npk_m Ivpk_m Ovpk_m Tpk_m   .\n        //          contract_class_id                         \\                     |...................\n        //             /   |    \\                               \\\n        // artifact_hash   |    public_bytecode_commitment       salted_initialization_hash\n        //                 |                                         /     /        \\\n        //     private_function_tree_root              deployer_address  salt   initialization_hash\n        //             /       \\                                                /              \\\n        //          ...          ...                              constructor_fn_selector   constructor_args_hash\n        //         /                \\\n        //     /     \\            /      \\\n        //   leaf   leaf        leaf    leaf\n        //           ^\n        //           |\n        //           |---h(function_selector, vk_hash)\n        //               ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n        //               Each of these represents a private function of the contract.\n\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            DOM_SEP__CONTRACT_ADDRESS_V1,\n        );\n\n        // Note: `.add()` will fail within the blackbox fn if either of the points are not on the curve. (See tests below).\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_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 check_max_field_value() {\n    // Check that it is indeed r-1.\n    assert_eq(MAX_FIELD_VALUE + 1, 0);\n}\n\n#[test]\nfn check_is_positive() {\n    assert(AztecAddress::is_positive(0));\n    assert(AztecAddress::is_positive(1));\n    assert(!AztecAddress::is_positive(-1));\n    assert(AztecAddress::is_positive(MAX_FIELD_VALUE / 2));\n    assert(!AztecAddress::is_positive((MAX_FIELD_VALUE / 2) + 1));\n}\n\n// Gives us confidence that we don't need to manually check that the input public keys need to be on the curve for `add`,\n// because the blackbox function does this check for us.\n#[test(should_fail_with = \"is not on curve\")]\nfn check_embedded_curve_point_add() {\n    // Choose a point not on the curve:\n    let p1 = Point { x: 1, y: 1, is_infinite: false };\n    let p2 = Point::generator();\n    let _ = p1 + p2;\n}\n\n// Gives us confidence that we don't need to manually check that the input public keys need to be on the curve for `add`,\n// because the blackbox function does this check for us.\n#[test(should_fail_with = \"is not on curve\")]\nfn check_embedded_curve_point_add_2() {\n    // Choose a point not on the curve in the 2nd position.\n    let p1 = Point::generator();\n    let p2 = Point { x: 1, y: 1, is_infinite: false };\n    let _ = p1 + p2;\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        0x2f66081d4bb077fbe8e8abe96a3516a713a3d7e34360b4e985da0da95092b37d;\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], DOM_SEP__CONTRACT_ADDRESS_V1);\n    let expected_computed_preaddress_from_partial_and_pubkey =\n        0x286c7755f2924b1e53b00bcaf1adaffe7287bd74bba7a02f4ab867e3892d28da;\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\n    assert(address.get_y().is_some()); // We don't bother checking the result of get_y as it is only used internally\n    assert(address.is_valid());\n\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(point.y * point.y, point.x * point.x * point.x - 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\n    assert(address.get_y().is_none());\n    assert(!address.is_valid());\n\n    assert(address.to_address_point().is_none());\n}\n"
     },
-    "348": {
+    "356": {
       "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, nullifier::Nullifier, private_log::PrivateLog,\n        transaction::tx_request::TxRequest,\n    },\n    address::{AztecAddress, EthAddress},\n    constants::{\n        CONTRACT_CLASS_LOG_SIZE_IN_FIELDS, DOM_SEP__NOTE_HASH_NONCE,\n        DOM_SEP__PRIVATE_LOG_FIRST_FIELD, DOM_SEP__SILOED_NOTE_HASH, DOM_SEP__SILOED_NULLIFIER,\n        DOM_SEP__UNIQUE_NOTE_HASH, FUNCTION_TREE_HEIGHT, NULL_MSG_SENDER_CONTRACT_ADDRESS,\n        TWO_POW_64,\n    },\n    merkle_tree::root_from_sibling_path,\n    messaging::l2_to_l1_message::L2ToL1Message,\n    poseidon2::Poseidon2Sponge,\n    side_effect::{Counted, Scoped},\n    traits::{FromField, Hash, ToField},\n    utils::field::{field_from_bytes, field_from_bytes_32_trunc},\n};\n\npub use poseidon2_chunks::poseidon2_absorb_in_chunks_existing_sponge;\nuse poseidon2_chunks::poseidon2_absorb_in_chunks;\nuse std::embedded_curve_ops::EmbeddedCurveScalar;\n\n// TODO: refactor these into their own files: sha256, poseidon2, some protocol-specific hash computations, some merkle computations.\n\npub fn sha256_to_field<let N: u32>(bytes_to_hash: [u8; N]) -> Field {\n    let sha256_hashed = sha256::digest(bytes_to_hash);\n    let hash_in_a_field = field_from_bytes_32_trunc(sha256_hashed);\n\n    hash_in_a_field\n}\n\npub fn private_functions_root_from_siblings(\n    selector: FunctionSelector,\n    vk_hash: Field,\n    function_leaf_index: Field,\n    function_leaf_sibling_path: [Field; FUNCTION_TREE_HEIGHT],\n) -> Field {\n    let function_leaf_preimage = ContractClassFunctionLeafPreimage { selector, vk_hash };\n    let function_leaf = function_leaf_preimage.hash();\n    root_from_sibling_path(\n        function_leaf,\n        function_leaf_index,\n        function_leaf_sibling_path,\n    )\n}\n\n/// Siloing in the context of Aztec refers to the process of hashing a note hash with a contract address (this way\n/// the note hash is scoped to a specific contract). This is used to prevent intermingling of notes between contracts.\npub fn compute_siloed_note_hash(contract_address: AztecAddress, note_hash: Field) -> Field {\n    poseidon2_hash_with_separator(\n        [contract_address.to_field(), note_hash],\n        DOM_SEP__SILOED_NOTE_HASH,\n    )\n}\n\n/// Computes unique, siloed note hashes from siloed note hashes.\n///\n/// The protocol injects uniqueness into every note_hash, so that every single note_hash in the\n/// tree is unique. This prevents faerie gold attacks, where a malicious sender could create\n/// two identical note_hashes for a recipient (meaning only one would be nullifiable in future).\n///\n/// Most privacy protocols will inject the note's leaf_index (its position in the Note Hashes Tree)\n/// into the note, but this requires the creator of a note to wait until their tx is included in\n/// a block to know the note's final note hash (the unique, siloed note hash), because inserting\n/// leaves into trees is the job of a block producer.\n///\n/// We took a different approach so that the creator of a note will know each note's unique, siloed\n/// note hash before broadcasting their tx to the network.\n/// (There was also a historical requirement relating to \"chained transactions\" -- a feature that\n/// Aztec Connect had to enable notes to be spent from distinct txs earlier in the same block,\n/// and hence before an archive block root had been established for that block -- but that feature\n/// was abandoned for the Aztec Network for having too many bad tradeoffs).\n///\n/// (\n///   Edit: it is no longer true that all final note_hashes will be known by the creator of a tx\n///   before they send it to the network. If a tx makes public function calls, then _revertible_\n///   note_hashes that are created in private will not be made unique in private by the Reset circuit,\n///   but will instead be made unique by the AVM, because the `note_index_in_tx` will not be known\n///   until the AVM has executed the public functions of the tx. (See an explanation in\n///   reset_output_composer.nr for why).\n///   For some such txs, the `note_index_in_tx` might still be predictable through simulation, but\n///   for txs whose public functions create a varying number of non-revertible notes (determined at\n///   runtime), the `note_index_in_tx` will not be deterministically derivable before submitting the\n///   tx to the network.\n/// )\n///\n/// We use the `first_nullifier` of a tx as a seed of uniqueness. We have a guarantee that there will\n/// always be at least one nullifier per tx, because the init circuit will create one if one isn't\n/// created naturally by any functions of the tx. (Search \"protocol_nullifier\").\n/// We combine the `first_nullifier` with the note's index (its position within this tx's new\n/// note_hashes array) (`note_index_in_tx`) to get a truly unique value to inject into a note, which\n/// we call a `note_nonce`.\npub fn compute_unique_note_hash(note_nonce: Field, siloed_note_hash: Field) -> Field {\n    let inputs = [note_nonce, siloed_note_hash];\n    poseidon2_hash_with_separator(inputs, DOM_SEP__UNIQUE_NOTE_HASH)\n}\n\npub fn compute_note_hash_nonce(first_nullifier_in_tx: Field, note_index_in_tx: u32) -> Field {\n    // Hashing the first nullifier with note index in tx is guaranteed to be unique (because all nullifiers are also\n    // unique).\n    poseidon2_hash_with_separator(\n        [first_nullifier_in_tx, note_index_in_tx as Field],\n        DOM_SEP__NOTE_HASH_NONCE,\n    )\n}\n\npub fn compute_note_nonce_and_unique_note_hash(\n    siloed_note_hash: Field,\n    first_nullifier: Field,\n    note_index_in_tx: u32,\n) -> Field {\n    let note_nonce = compute_note_hash_nonce(first_nullifier, note_index_in_tx);\n    compute_unique_note_hash(note_nonce, siloed_note_hash)\n}\n\npub fn compute_siloed_nullifier(contract_address: AztecAddress, nullifier: Field) -> Field {\n    poseidon2_hash_with_separator(\n        [contract_address.to_field(), nullifier],\n        DOM_SEP__SILOED_NULLIFIER,\n    )\n}\n\npub fn create_protocol_nullifier(tx_request: TxRequest) -> Scoped<Counted<Nullifier>> {\n    // The protocol nullifier is ascribed a special side-effect counter of 1. No other side-effect\n    // can have counter 1 (see `validate_as_first_call` for that assertion).\n    Nullifier { value: tx_request.hash(), note_hash: 0 }.count(1).scope(\n        NULL_MSG_SENDER_CONTRACT_ADDRESS,\n    )\n}\n\npub fn compute_siloed_private_log_first_field(\n    contract_address: AztecAddress,\n    field: Field,\n) -> Field {\n    poseidon2_hash_with_separator(\n        [contract_address.to_field(), field],\n        DOM_SEP__PRIVATE_LOG_FIRST_FIELD,\n    )\n}\n\npub fn compute_siloed_private_log(contract_address: AztecAddress, log: PrivateLog) -> PrivateLog {\n    let mut fields = log.fields;\n    fields[0] = compute_siloed_private_log_first_field(contract_address, fields[0]);\n    PrivateLog::new(fields, log.length)\n}\n\npub fn compute_contract_class_log_hash(log: [Field; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS]) -> Field {\n    poseidon2_hash(log)\n}\n\npub fn compute_app_siloed_secret_key(\n    master_secret_key: EmbeddedCurveScalar,\n    app_address: AztecAddress,\n    key_type_domain_separator: Field,\n) -> Field {\n    poseidon2_hash_with_separator(\n        [master_secret_key.hi, master_secret_key.lo, app_address.to_field()],\n        key_type_domain_separator,\n    )\n}\n\npub fn compute_l2_to_l1_message_hash(\n    message: Scoped<L2ToL1Message>,\n    rollup_version_id: Field,\n    chain_id: Field,\n) -> Field {\n    let contract_address_bytes: [u8; 32] = message.contract_address.to_field().to_be_bytes();\n    let recipient_bytes: [u8; 20] = message.inner.recipient.to_be_bytes();\n    let content_bytes: [u8; 32] = message.inner.content.to_be_bytes();\n    let rollup_version_id_bytes: [u8; 32] = rollup_version_id.to_be_bytes();\n    let chain_id_bytes: [u8; 32] = chain_id.to_be_bytes();\n\n    let mut bytes: [u8; 148] = std::mem::zeroed();\n    for i in 0..32 {\n        bytes[i] = contract_address_bytes[i];\n        bytes[i + 32] = rollup_version_id_bytes[i];\n        // 64 - 84 are for recipient.\n        bytes[i + 84] = chain_id_bytes[i];\n        bytes[i + 116] = content_bytes[i];\n    }\n\n    for i in 0..20 {\n        bytes[64 + i] = recipient_bytes[i];\n    }\n\n    sha256_to_field(bytes)\n}\n\n// TODO: consider a variant that enables domain separation with a u32 (we seem to have standardised u32s for domain separators)\n/// Computes sha256 hash of 2 input fields.\n///\n/// @returns A truncated field (i.e., the first byte is always 0).\npub fn accumulate_sha256(v0: Field, v1: Field) -> Field {\n    // Concatenate two fields into 32 x 2 = 64 bytes\n    let v0_as_bytes: [u8; 32] = v0.to_be_bytes();\n    let v1_as_bytes: [u8; 32] = v1.to_be_bytes();\n    let hash_input_flattened = v0_as_bytes.concat(v1_as_bytes);\n\n    sha256_to_field(hash_input_flattened)\n}\n\npub fn poseidon2_hash<let N: u32>(inputs: [Field; N]) -> Field {\n    poseidon::poseidon2::Poseidon2::hash(inputs, N)\n}\n\n#[no_predicates]\npub fn poseidon2_hash_with_separator<let N: u32, T>(inputs: [Field; N], separator: T) -> Field\nwhere\n    T: ToField,\n{\n    let inputs_with_separator = [separator.to_field()].concat(inputs);\n    poseidon2_hash(inputs_with_separator)\n}\n\n/// Computes a Poseidon2 hash over a dynamic-length subarray of the given input.\n/// Only the first `in_len` fields of `input` are absorbed; any remaining fields are ignored.\n/// The caller is responsible for ensuring that the input is padded with zeros if required.\n#[no_predicates]\npub fn poseidon2_hash_subarray<let N: u32>(input: [Field; N], in_len: u32) -> Field {\n    let mut sponge = poseidon2_absorb_in_chunks(input, in_len);\n    sponge.squeeze()\n}\n\n// This function is  unconstrained because it is intended to be used in unconstrained context only as\n// in constrained contexts it would be too inefficient.\npub unconstrained fn poseidon2_hash_with_separator_bounded_vec<let N: u32, T>(\n    inputs: BoundedVec<Field, N>,\n    separator: T,\n) -> Field\nwhere\n    T: ToField,\n{\n    let in_len = inputs.len() + 1;\n    let iv: Field = (in_len as Field) * TWO_POW_64;\n    let mut sponge = Poseidon2Sponge::new(iv);\n    sponge.absorb(separator.to_field());\n\n    for i in 0..inputs.len() {\n        sponge.absorb(inputs.get(i));\n    }\n\n    sponge.squeeze()\n}\n\n#[no_predicates]\npub fn poseidon2_hash_bytes<let N: u32>(inputs: [u8; N]) -> Field {\n    let mut fields = [0; (N + 30) / 31];\n    let mut field_index = 0;\n    let mut current_field = [0; 31];\n    for i in 0..inputs.len() {\n        let index = i % 31;\n        current_field[index] = inputs[i];\n        if index == 30 {\n            fields[field_index] = field_from_bytes(current_field, false);\n            current_field = [0; 31];\n            field_index += 1;\n        }\n    }\n    if field_index != fields.len() {\n        fields[field_index] = field_from_bytes(current_field, false);\n    }\n    poseidon2_hash(fields)\n}\n\n#[test]\nfn subarray_hash_matches_fixed() {\n    let mut values_to_hash = [3; 17];\n    let mut padded = values_to_hash.concat([0; 11]);\n    let subarray_hash = poseidon2_hash_subarray(padded, values_to_hash.len());\n\n    // Hash the entire values_to_hash.\n    let fixed_len_hash = poseidon::poseidon2::Poseidon2::hash(values_to_hash, values_to_hash.len());\n\n    assert_eq(subarray_hash, fixed_len_hash);\n}\n\n#[test]\nfn subarray_hash_matches_variable() {\n    let mut values_to_hash = [3; 17];\n    let mut padded = values_to_hash.concat([0; 11]);\n    let subarray_hash = poseidon2_hash_subarray(padded, values_to_hash.len());\n\n    // Hash up to values_to_hash.len() fields of the padded array.\n    let variable_len_hash = poseidon::poseidon2::Poseidon2::hash(padded, values_to_hash.len());\n\n    assert_eq(subarray_hash, variable_len_hash);\n}\n\n#[test]\nfn smoke_sha256_to_field() {\n    let full_buffer = [\n        0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n        25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47,\n        48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70,\n        71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93,\n        94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112,\n        113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130,\n        131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148,\n        149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159,\n    ];\n    let result = sha256_to_field(full_buffer);\n\n    assert(result == 0x448ebbc9e1a31220a2f3830c18eef61b9bd070e5084b7fa2a359fe729184c7);\n\n    // to show correctness of the current ver (truncate one byte) vs old ver (mod full bytes):\n    let result_bytes = sha256::digest(full_buffer);\n    let truncated_field = crate::utils::field::field_from_bytes_32_trunc(result_bytes);\n    assert(truncated_field == result);\n    let mod_res = result + (result_bytes[31] as Field);\n    assert(mod_res == 0x448ebbc9e1a31220a2f3830c18eef61b9bd070e5084b7fa2a359fe729184e0);\n}\n\n#[test]\nfn unique_siloed_note_hash_matches_typescript() {\n    let inner_note_hash = 1;\n    let contract_address = AztecAddress::from_field(2);\n    let first_nullifier = 3;\n    let note_index_in_tx = 4;\n\n    let siloed_note_hash = compute_siloed_note_hash(contract_address, inner_note_hash);\n    let siloed_note_hash_from_ts =\n        0x1986a4bea3eddb1fff917d629a13e10f63f514f401bdd61838c6b475db949169;\n    assert_eq(siloed_note_hash, siloed_note_hash_from_ts);\n\n    let nonce: Field = compute_note_hash_nonce(first_nullifier, note_index_in_tx);\n    let note_hash_nonce_from_ts =\n        0x28e7799791bf066a57bb51fdd0fbcaf3f0926414314c7db515ea343f44f5d58b;\n    assert_eq(nonce, note_hash_nonce_from_ts);\n\n    let unique_siloed_note_hash_from_nonce = compute_unique_note_hash(nonce, siloed_note_hash);\n    let unique_siloed_note_hash = compute_note_nonce_and_unique_note_hash(\n        siloed_note_hash,\n        first_nullifier,\n        note_index_in_tx,\n    );\n    assert_eq(unique_siloed_note_hash_from_nonce, unique_siloed_note_hash);\n\n    let unique_siloed_note_hash_from_ts =\n        0x29949aef207b715303b24639737c17fbfeb375c1d965ecfa85c7e4f0febb7d16;\n    assert_eq(unique_siloed_note_hash, unique_siloed_note_hash_from_ts);\n}\n\n#[test]\nfn siloed_nullifier_matches_typescript() {\n    let contract_address = AztecAddress::from_field(123);\n    let nullifier = 456;\n\n    let res = compute_siloed_nullifier(contract_address, nullifier);\n\n    let siloed_nullifier_from_ts =\n        0x169b50336c1f29afdb8a03d955a81e485f5ac7d5f0b8065673d1e407e5877813;\n\n    assert_eq(res, siloed_nullifier_from_ts);\n}\n\n#[test]\nfn siloed_private_log_first_field_matches_typescript() {\n    let contract_address = AztecAddress::from_field(123);\n    let field = 456;\n    let res = compute_siloed_private_log_first_field(contract_address, field);\n\n    let siloed_private_log_first_field_from_ts =\n        0x29480984f7b9257fded523d50addbcfc8d1d33adcf2db73ef3390a8fd5cdffaa;\n\n    assert_eq(res, siloed_private_log_first_field_from_ts);\n}\n\n#[test]\nfn empty_l2_to_l1_message_hash_matches_typescript() {\n    // All zeroes\n    let res = compute_l2_to_l1_message_hash(\n        L2ToL1Message { recipient: EthAddress::zero(), content: 0 }.scope(AztecAddress::from_field(\n            0,\n        )),\n        0,\n        0,\n    );\n\n    let empty_l2_to_l1_msg_hash_from_ts =\n        0x003b18c58c739716e76429634a61375c45b3b5cd470c22ab6d3e14cee23dd992;\n\n    assert_eq(res, empty_l2_to_l1_msg_hash_from_ts);\n}\n\n#[test]\nfn l2_to_l1_message_hash_matches_typescript() {\n    let message = L2ToL1Message { recipient: EthAddress::from_field(1), content: 2 }.scope(\n        AztecAddress::from_field(3),\n    );\n    let version = 4;\n    let chainId = 5;\n\n    let hash = compute_l2_to_l1_message_hash(message, version, chainId);\n\n    // The following value was generated by `yarn-project/stdlib/src/hash/hash.test.ts`\n    let l2_to_l1_message_hash_from_ts =\n        0x0081edf209e087ad31b3fd24263698723d57190bd1d6e9fe056fc0c0a68ee661;\n\n    assert_eq(hash, l2_to_l1_message_hash_from_ts);\n}\n\n#[test]\nunconstrained fn poseidon2_hash_with_separator_bounded_vec_matches_non_bounded_vec_version() {\n    let inputs = BoundedVec::<Field, 4>::from_array([1, 2, 3]);\n    let separator = 42;\n\n    // Hash using bounded vec version\n    let bounded_result = poseidon2_hash_with_separator_bounded_vec(inputs, separator);\n\n    // Hash using regular version\n    let regular_result = poseidon2_hash_with_separator([1, 2, 3], separator);\n\n    // Results should match\n    assert_eq(bounded_result, regular_result);\n}\n"
+      "source": "mod poseidon2_chunks;\n\nuse crate::{\n    abis::{\n        contract_class_function_leaf_preimage::ContractClassFunctionLeafPreimage,\n        function_selector::FunctionSelector, nullifier::Nullifier, private_log::PrivateLog,\n        transaction::tx_request::TxRequest,\n    },\n    address::{AztecAddress, EthAddress},\n    constants::{\n        CONTRACT_CLASS_LOG_SIZE_IN_FIELDS, DOM_SEP__NOTE_HASH_NONCE,\n        DOM_SEP__PRIVATE_LOG_FIRST_FIELD, DOM_SEP__SILOED_NOTE_HASH, DOM_SEP__SILOED_NULLIFIER,\n        DOM_SEP__UNIQUE_NOTE_HASH, FUNCTION_TREE_HEIGHT, NULL_MSG_SENDER_CONTRACT_ADDRESS,\n        TWO_POW_64,\n    },\n    merkle_tree::root_from_sibling_path,\n    messaging::l2_to_l1_message::L2ToL1Message,\n    poseidon2::Poseidon2Sponge,\n    side_effect::{Counted, Scoped},\n    traits::{FromField, Hash, ToField},\n    utils::field::{field_from_bytes, field_from_bytes_32_trunc},\n};\n\npub use poseidon2_chunks::poseidon2_absorb_in_chunks_existing_sponge;\nuse poseidon2_chunks::poseidon2_absorb_in_chunks;\nuse std::embedded_curve_ops::EmbeddedCurveScalar;\n\n// TODO: refactor these into their own files: sha256, poseidon2, some protocol-specific hash computations, some merkle computations.\n\npub fn sha256_to_field<let N: u32>(bytes_to_hash: [u8; N]) -> Field {\n    let sha256_hashed = sha256::digest(bytes_to_hash);\n    let hash_in_a_field = field_from_bytes_32_trunc(sha256_hashed);\n\n    hash_in_a_field\n}\n\npub fn private_functions_root_from_siblings(\n    selector: FunctionSelector,\n    vk_hash: Field,\n    function_leaf_index: Field,\n    function_leaf_sibling_path: [Field; FUNCTION_TREE_HEIGHT],\n) -> Field {\n    let function_leaf_preimage = ContractClassFunctionLeafPreimage { selector, vk_hash };\n    let function_leaf = function_leaf_preimage.hash();\n    root_from_sibling_path(\n        function_leaf,\n        function_leaf_index,\n        function_leaf_sibling_path,\n    )\n}\n\n/// Siloing in the context of Aztec refers to the process of hashing a note hash with a contract address (this way\n/// the note hash is scoped to a specific contract). This is used to prevent intermingling of notes between contracts.\npub fn compute_siloed_note_hash(contract_address: AztecAddress, note_hash: Field) -> Field {\n    poseidon2_hash_with_separator(\n        [contract_address.to_field(), note_hash],\n        DOM_SEP__SILOED_NOTE_HASH,\n    )\n}\n\n/// Computes unique, siloed note hashes from siloed note hashes.\n///\n/// The protocol injects uniqueness into every note_hash, so that every single note_hash in the\n/// tree is unique. This prevents faerie gold attacks, where a malicious sender could create\n/// two identical note_hashes for a recipient (meaning only one would be nullifiable in future).\n///\n/// Most privacy protocols will inject the note's leaf_index (its position in the Note Hashes Tree)\n/// into the note, but this requires the creator of a note to wait until their tx is included in\n/// a block to know the note's final note hash (the unique, siloed note hash), because inserting\n/// leaves into trees is the job of a block producer.\n///\n/// We took a different approach so that the creator of a note will know each note's unique, siloed\n/// note hash before broadcasting their tx to the network.\n/// (There was also a historical requirement relating to \"chained transactions\" -- a feature that\n/// Aztec Connect had to enable notes to be spent from distinct txs earlier in the same block,\n/// and hence before an archive block root had been established for that block -- but that feature\n/// was abandoned for the Aztec Network for having too many bad tradeoffs).\n///\n/// (\n///   Edit: it is no longer true that all final note_hashes will be known by the creator of a tx\n///   before they send it to the network. If a tx makes public function calls, then _revertible_\n///   note_hashes that are created in private will not be made unique in private by the Reset circuit,\n///   but will instead be made unique by the AVM, because the `note_index_in_tx` will not be known\n///   until the AVM has executed the public functions of the tx. (See an explanation in\n///   reset_output_composer.nr for why).\n///   For some such txs, the `note_index_in_tx` might still be predictable through simulation, but\n///   for txs whose public functions create a varying number of non-revertible notes (determined at\n///   runtime), the `note_index_in_tx` will not be deterministically derivable before submitting the\n///   tx to the network.\n/// )\n///\n/// We use the `first_nullifier` of a tx as a seed of uniqueness. We have a guarantee that there will\n/// always be at least one nullifier per tx, because the init circuit will create one if one isn't\n/// created naturally by any functions of the tx. (Search \"protocol_nullifier\").\n/// We combine the `first_nullifier` with the note's index (its position within this tx's new\n/// note_hashes array) (`note_index_in_tx`) to get a truly unique value to inject into a note, which\n/// we call a `note_nonce`.\npub fn compute_unique_note_hash(note_nonce: Field, siloed_note_hash: Field) -> Field {\n    let inputs = [note_nonce, siloed_note_hash];\n    poseidon2_hash_with_separator(inputs, DOM_SEP__UNIQUE_NOTE_HASH)\n}\n\npub fn compute_note_hash_nonce(first_nullifier_in_tx: Field, note_index_in_tx: u32) -> Field {\n    // Hashing the first nullifier with note index in tx is guaranteed to be unique (because all nullifiers are also\n    // unique).\n    poseidon2_hash_with_separator(\n        [first_nullifier_in_tx, note_index_in_tx as Field],\n        DOM_SEP__NOTE_HASH_NONCE,\n    )\n}\n\npub fn compute_note_nonce_and_unique_note_hash(\n    siloed_note_hash: Field,\n    first_nullifier: Field,\n    note_index_in_tx: u32,\n) -> Field {\n    let note_nonce = compute_note_hash_nonce(first_nullifier, note_index_in_tx);\n    compute_unique_note_hash(note_nonce, siloed_note_hash)\n}\n\npub fn compute_siloed_nullifier(contract_address: AztecAddress, nullifier: Field) -> Field {\n    poseidon2_hash_with_separator(\n        [contract_address.to_field(), nullifier],\n        DOM_SEP__SILOED_NULLIFIER,\n    )\n}\n\npub fn create_protocol_nullifier(tx_request: TxRequest) -> Scoped<Counted<Nullifier>> {\n    // The protocol nullifier is ascribed a special side-effect counter of 1. No other side-effect\n    // can have counter 1 (see `validate_as_first_call` for that assertion).\n    Nullifier { value: tx_request.hash(), note_hash: 0 }.count(1).scope(\n        NULL_MSG_SENDER_CONTRACT_ADDRESS,\n    )\n}\n\npub fn compute_log_tag(raw_tag: Field, dom_sep: u32) -> Field {\n    poseidon2_hash_with_separator([raw_tag], dom_sep)\n}\n\npub fn compute_siloed_private_log_first_field(\n    contract_address: AztecAddress,\n    field: Field,\n) -> Field {\n    poseidon2_hash_with_separator(\n        [contract_address.to_field(), field],\n        DOM_SEP__PRIVATE_LOG_FIRST_FIELD,\n    )\n}\n\npub fn compute_siloed_private_log(contract_address: AztecAddress, log: PrivateLog) -> PrivateLog {\n    let mut fields = log.fields;\n    fields[0] = compute_siloed_private_log_first_field(contract_address, fields[0]);\n    PrivateLog::new(fields, log.length)\n}\n\npub fn compute_contract_class_log_hash(log: [Field; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS]) -> Field {\n    poseidon2_hash(log)\n}\n\npub fn compute_app_siloed_secret_key(\n    master_secret_key: EmbeddedCurveScalar,\n    app_address: AztecAddress,\n    key_type_domain_separator: Field,\n) -> Field {\n    poseidon2_hash_with_separator(\n        [master_secret_key.hi, master_secret_key.lo, app_address.to_field()],\n        key_type_domain_separator,\n    )\n}\n\npub fn compute_l2_to_l1_message_hash(\n    message: Scoped<L2ToL1Message>,\n    rollup_version_id: Field,\n    chain_id: Field,\n) -> Field {\n    let contract_address_bytes: [u8; 32] = message.contract_address.to_field().to_be_bytes();\n    let recipient_bytes: [u8; 20] = message.inner.recipient.to_be_bytes();\n    let content_bytes: [u8; 32] = message.inner.content.to_be_bytes();\n    let rollup_version_id_bytes: [u8; 32] = rollup_version_id.to_be_bytes();\n    let chain_id_bytes: [u8; 32] = chain_id.to_be_bytes();\n\n    let mut bytes: [u8; 148] = std::mem::zeroed();\n    for i in 0..32 {\n        bytes[i] = contract_address_bytes[i];\n        bytes[i + 32] = rollup_version_id_bytes[i];\n        // 64 - 84 are for recipient.\n        bytes[i + 84] = chain_id_bytes[i];\n        bytes[i + 116] = content_bytes[i];\n    }\n\n    for i in 0..20 {\n        bytes[64 + i] = recipient_bytes[i];\n    }\n\n    sha256_to_field(bytes)\n}\n\n// TODO: consider a variant that enables domain separation with a u32 (we seem to have standardised u32s for domain separators)\n/// Computes sha256 hash of 2 input fields.\n///\n/// @returns A truncated field (i.e., the first byte is always 0).\npub fn accumulate_sha256(v0: Field, v1: Field) -> Field {\n    // Concatenate two fields into 32 x 2 = 64 bytes\n    let v0_as_bytes: [u8; 32] = v0.to_be_bytes();\n    let v1_as_bytes: [u8; 32] = v1.to_be_bytes();\n    let hash_input_flattened = v0_as_bytes.concat(v1_as_bytes);\n\n    sha256_to_field(hash_input_flattened)\n}\n\npub fn poseidon2_hash<let N: u32>(inputs: [Field; N]) -> Field {\n    poseidon::poseidon2::Poseidon2::hash(inputs, N)\n}\n\n#[no_predicates]\npub fn poseidon2_hash_with_separator<let N: u32, T>(inputs: [Field; N], separator: T) -> Field\nwhere\n    T: ToField,\n{\n    let inputs_with_separator = [separator.to_field()].concat(inputs);\n    poseidon2_hash(inputs_with_separator)\n}\n\n/// Computes a Poseidon2 hash over a dynamic-length subarray of the given input.\n/// Only the first `in_len` fields of `input` are absorbed; any remaining fields are ignored.\n/// The caller is responsible for ensuring that the input is padded with zeros if required.\n#[no_predicates]\npub fn poseidon2_hash_subarray<let N: u32>(input: [Field; N], in_len: u32) -> Field {\n    let mut sponge = poseidon2_absorb_in_chunks(input, in_len);\n    sponge.squeeze()\n}\n\n// This function is  unconstrained because it is intended to be used in unconstrained context only as\n// in constrained contexts it would be too inefficient.\npub unconstrained fn poseidon2_hash_with_separator_bounded_vec<let N: u32, T>(\n    inputs: BoundedVec<Field, N>,\n    separator: T,\n) -> Field\nwhere\n    T: ToField,\n{\n    let in_len = inputs.len() + 1;\n    let iv: Field = (in_len as Field) * TWO_POW_64;\n    let mut sponge = Poseidon2Sponge::new(iv);\n    sponge.absorb(separator.to_field());\n\n    for i in 0..inputs.len() {\n        sponge.absorb(inputs.get(i));\n    }\n\n    sponge.squeeze()\n}\n\n#[no_predicates]\npub fn poseidon2_hash_bytes<let N: u32>(inputs: [u8; N]) -> Field {\n    let mut fields = [0; (N + 30) / 31];\n    let mut field_index = 0;\n    let mut current_field = [0; 31];\n    for i in 0..inputs.len() {\n        let index = i % 31;\n        current_field[index] = inputs[i];\n        if index == 30 {\n            fields[field_index] = field_from_bytes(current_field, false);\n            current_field = [0; 31];\n            field_index += 1;\n        }\n    }\n    if field_index != fields.len() {\n        fields[field_index] = field_from_bytes(current_field, false);\n    }\n    poseidon2_hash(fields)\n}\n\n#[test]\nfn subarray_hash_matches_fixed() {\n    let mut values_to_hash = [3; 17];\n    let mut padded = values_to_hash.concat([0; 11]);\n    let subarray_hash = poseidon2_hash_subarray(padded, values_to_hash.len());\n\n    // Hash the entire values_to_hash.\n    let fixed_len_hash = poseidon::poseidon2::Poseidon2::hash(values_to_hash, values_to_hash.len());\n\n    assert_eq(subarray_hash, fixed_len_hash);\n}\n\n#[test]\nfn subarray_hash_matches_variable() {\n    let mut values_to_hash = [3; 17];\n    let mut padded = values_to_hash.concat([0; 11]);\n    let subarray_hash = poseidon2_hash_subarray(padded, values_to_hash.len());\n\n    // Hash up to values_to_hash.len() fields of the padded array.\n    let variable_len_hash = poseidon::poseidon2::Poseidon2::hash(padded, values_to_hash.len());\n\n    assert_eq(subarray_hash, variable_len_hash);\n}\n\n#[test]\nfn smoke_sha256_to_field() {\n    let full_buffer = [\n        0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n        25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47,\n        48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70,\n        71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93,\n        94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112,\n        113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130,\n        131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148,\n        149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159,\n    ];\n    let result = sha256_to_field(full_buffer);\n\n    assert(result == 0x448ebbc9e1a31220a2f3830c18eef61b9bd070e5084b7fa2a359fe729184c7);\n\n    // to show correctness of the current ver (truncate one byte) vs old ver (mod full bytes):\n    let result_bytes = sha256::digest(full_buffer);\n    let truncated_field = crate::utils::field::field_from_bytes_32_trunc(result_bytes);\n    assert(truncated_field == result);\n    let mod_res = result + (result_bytes[31] as Field);\n    assert(mod_res == 0x448ebbc9e1a31220a2f3830c18eef61b9bd070e5084b7fa2a359fe729184e0);\n}\n\n#[test]\nfn unique_siloed_note_hash_matches_typescript() {\n    let inner_note_hash = 1;\n    let contract_address = AztecAddress::from_field(2);\n    let first_nullifier = 3;\n    let note_index_in_tx = 4;\n\n    let siloed_note_hash = compute_siloed_note_hash(contract_address, inner_note_hash);\n    let siloed_note_hash_from_ts =\n        0x1986a4bea3eddb1fff917d629a13e10f63f514f401bdd61838c6b475db949169;\n    assert_eq(siloed_note_hash, siloed_note_hash_from_ts);\n\n    let nonce: Field = compute_note_hash_nonce(first_nullifier, note_index_in_tx);\n    let note_hash_nonce_from_ts =\n        0x28e7799791bf066a57bb51fdd0fbcaf3f0926414314c7db515ea343f44f5d58b;\n    assert_eq(nonce, note_hash_nonce_from_ts);\n\n    let unique_siloed_note_hash_from_nonce = compute_unique_note_hash(nonce, siloed_note_hash);\n    let unique_siloed_note_hash = compute_note_nonce_and_unique_note_hash(\n        siloed_note_hash,\n        first_nullifier,\n        note_index_in_tx,\n    );\n    assert_eq(unique_siloed_note_hash_from_nonce, unique_siloed_note_hash);\n\n    let unique_siloed_note_hash_from_ts =\n        0x29949aef207b715303b24639737c17fbfeb375c1d965ecfa85c7e4f0febb7d16;\n    assert_eq(unique_siloed_note_hash, unique_siloed_note_hash_from_ts);\n}\n\n#[test]\nfn siloed_nullifier_matches_typescript() {\n    let contract_address = AztecAddress::from_field(123);\n    let nullifier = 456;\n\n    let res = compute_siloed_nullifier(contract_address, nullifier);\n\n    let siloed_nullifier_from_ts =\n        0x169b50336c1f29afdb8a03d955a81e485f5ac7d5f0b8065673d1e407e5877813;\n\n    assert_eq(res, siloed_nullifier_from_ts);\n}\n\n#[test]\nfn siloed_private_log_first_field_matches_typescript() {\n    let contract_address = AztecAddress::from_field(123);\n    let field = 456;\n    let res = compute_siloed_private_log_first_field(contract_address, field);\n\n    let siloed_private_log_first_field_from_ts =\n        0x29480984f7b9257fded523d50addbcfc8d1d33adcf2db73ef3390a8fd5cdffaa;\n\n    assert_eq(res, siloed_private_log_first_field_from_ts);\n}\n\n#[test]\nfn empty_l2_to_l1_message_hash_matches_typescript() {\n    // All zeroes\n    let res = compute_l2_to_l1_message_hash(\n        L2ToL1Message { recipient: EthAddress::zero(), content: 0 }.scope(AztecAddress::from_field(\n            0,\n        )),\n        0,\n        0,\n    );\n\n    let empty_l2_to_l1_msg_hash_from_ts =\n        0x003b18c58c739716e76429634a61375c45b3b5cd470c22ab6d3e14cee23dd992;\n\n    assert_eq(res, empty_l2_to_l1_msg_hash_from_ts);\n}\n\n#[test]\nfn l2_to_l1_message_hash_matches_typescript() {\n    let message = L2ToL1Message { recipient: EthAddress::from_field(1), content: 2 }.scope(\n        AztecAddress::from_field(3),\n    );\n    let version = 4;\n    let chainId = 5;\n\n    let hash = compute_l2_to_l1_message_hash(message, version, chainId);\n\n    // The following value was generated by `yarn-project/stdlib/src/hash/hash.test.ts`\n    let l2_to_l1_message_hash_from_ts =\n        0x0081edf209e087ad31b3fd24263698723d57190bd1d6e9fe056fc0c0a68ee661;\n\n    assert_eq(hash, l2_to_l1_message_hash_from_ts);\n}\n\n#[test]\nunconstrained fn poseidon2_hash_with_separator_bounded_vec_matches_non_bounded_vec_version() {\n    let inputs = BoundedVec::<Field, 4>::from_array([1, 2, 3]);\n    let separator = 42;\n\n    // Hash using bounded vec version\n    let bounded_result = poseidon2_hash_with_separator_bounded_vec(inputs, separator);\n\n    // Hash using regular version\n    let regular_result = poseidon2_hash_with_separator([1, 2, 3], separator);\n\n    // Results should match\n    assert_eq(bounded_result, regular_result);\n}\n"
     },
-    "350": {
+    "358": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/logging.nr",
-      "source": "// Log levels matching the JS logger:\n\n// global SILENT_LOG_LEVEL: u8 = 0;\nglobal FATAL_LOG_LEVEL: u8 = 1;\nglobal ERROR_LOG_LEVEL: u8 = 2;\nglobal WARN_LOG_LEVEL: u8 = 3;\nglobal INFO_LOG_LEVEL: u8 = 4;\nglobal VERBOSE_LOG_LEVEL: u8 = 5;\nglobal DEBUG_LOG_LEVEL: u8 = 6;\nglobal TRACE_LOG_LEVEL: u8 = 7;\n\n// --- Per-level log functions (no format args) ---\n\npub fn fatal_log<let N: u32>(msg: str<N>) {\n    fatal_log_format(msg, []);\n}\n\npub fn error_log<let N: u32>(msg: str<N>) {\n    error_log_format(msg, []);\n}\n\npub fn warn_log<let N: u32>(msg: str<N>) {\n    warn_log_format(msg, []);\n}\n\npub fn info_log<let N: u32>(msg: str<N>) {\n    info_log_format(msg, []);\n}\n\npub fn verbose_log<let N: u32>(msg: str<N>) {\n    verbose_log_format(msg, []);\n}\n\npub fn debug_log<let N: u32>(msg: str<N>) {\n    debug_log_format(msg, []);\n}\n\npub fn trace_log<let N: u32>(msg: str<N>) {\n    trace_log_format(msg, []);\n}\n\n// --- Per-level log functions (with format args) ---\n\npub fn fatal_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    log_format(FATAL_LOG_LEVEL, msg, args);\n}\n\npub fn error_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    log_format(ERROR_LOG_LEVEL, msg, args);\n}\n\npub fn warn_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    log_format(WARN_LOG_LEVEL, msg, args);\n}\n\npub fn info_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    log_format(INFO_LOG_LEVEL, msg, args);\n}\n\npub fn verbose_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    log_format(VERBOSE_LOG_LEVEL, msg, args);\n}\n\npub fn debug_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    log_format(DEBUG_LOG_LEVEL, msg, args);\n}\n\npub fn trace_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    log_format(TRACE_LOG_LEVEL, msg, args);\n}\n\nfn log_format<let M: u32, let N: u32>(log_level: u8, msg: str<M>, args: [Field; N]) {\n    // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n    // to call.\n    unsafe { log_oracle_wrapper(log_level, msg, args) };\n}\n\nunconstrained fn log_oracle_wrapper<let M: u32, let N: u32>(\n    log_level: u8,\n    msg: str<M>,\n    args: [Field; N],\n) {\n    log_oracle(log_level, msg, N, args);\n}\n\n#[oracle(utilityLog)]\nunconstrained fn log_oracle<let M: u32, let N: u32>(\n    log_level: u8,\n    msg: str<M>,\n    length: u32,\n    args: [Field; N],\n) {}\n"
-    },
-    "365": {
-      "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        sponge.squeeze()\n    }\n}\n"
+      "source": "// Log levels matching the JS logger:\n\n// global SILENT_LOG_LEVEL: u8 = 0;\nglobal FATAL_LOG_LEVEL: u8 = 1;\nglobal ERROR_LOG_LEVEL: u8 = 2;\nglobal WARN_LOG_LEVEL: u8 = 3;\nglobal INFO_LOG_LEVEL: u8 = 4;\nglobal VERBOSE_LOG_LEVEL: u8 = 5;\nglobal DEBUG_LOG_LEVEL: u8 = 6;\nglobal TRACE_LOG_LEVEL: u8 = 7;\n\n// --- Per-level log functions (no format args) ---\n\npub fn fatal_log<let N: u32>(msg: str<N>) {\n    fatal_log_format(msg, []);\n}\n\npub fn error_log<let N: u32>(msg: str<N>) {\n    error_log_format(msg, []);\n}\n\npub fn warn_log<let N: u32>(msg: str<N>) {\n    warn_log_format(msg, []);\n}\n\npub fn info_log<let N: u32>(msg: str<N>) {\n    info_log_format(msg, []);\n}\n\npub fn verbose_log<let N: u32>(msg: str<N>) {\n    verbose_log_format(msg, []);\n}\n\npub fn debug_log<let N: u32>(msg: str<N>) {\n    debug_log_format(msg, []);\n}\n\npub fn trace_log<let N: u32>(msg: str<N>) {\n    trace_log_format(msg, []);\n}\n\n// --- Per-level log functions (with format args) ---\n\npub fn fatal_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    log_format(FATAL_LOG_LEVEL, msg, args);\n}\n\npub fn error_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    log_format(ERROR_LOG_LEVEL, msg, args);\n}\n\npub fn warn_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    log_format(WARN_LOG_LEVEL, msg, args);\n}\n\npub fn info_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    log_format(INFO_LOG_LEVEL, msg, args);\n}\n\npub fn verbose_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    log_format(VERBOSE_LOG_LEVEL, msg, args);\n}\n\npub fn debug_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    log_format(DEBUG_LOG_LEVEL, msg, args);\n}\n\npub fn trace_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    log_format(TRACE_LOG_LEVEL, msg, args);\n}\n\nfn log_format<let M: u32, let N: u32>(log_level: u8, msg: str<M>, args: [Field; N]) {\n    // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n    // to call.\n    unsafe { log_oracle_wrapper(log_level, msg, args) };\n}\n\nunconstrained fn log_oracle_wrapper<let M: u32, let N: u32>(\n    log_level: u8,\n    msg: str<M>,\n    args: [Field; N],\n) {\n    log_oracle(log_level, msg, N, args);\n}\n\n// While the length parameter might seem unnecessary given that we have N, we keep it around because at the AVM\n// bytecode level we want to support non-comptime-known lengths for such opcodes, even if Noir code will not generally\n// take that route. The AVM transpiler maps this oracle to the DEBUGLOG opcode, which reads the fields size from memory.\n#[oracle(aztec_utl_log)]\nunconstrained fn log_oracle<let M: u32, let N: u32>(\n    log_level: u8,\n    msg: str<M>,\n    length: u32,\n    args: [Field; N],\n) {}\n"
     },
-    "393": {
-      "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/traits.nr",
-      "source": "use crate::meta::derive_packable;\nuse crate::utils::field::field_from_bytes;\n\npub use serde::serialization::{Deserialize, Serialize};\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/// 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"
-    },
-    "401": {
-      "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/utils/field.nr",
-      "source": "pub 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\n// TODO: write doc-comments and tests for these magic constants.\n\nglobal KNOWN_NON_RESIDUE: Field = 5; // This is a non-residue in Noir's native Field.\nglobal C1: u32 = 28;\nglobal C3: Field = 40770029410420498293352137776570907027550720424234931066070132305055;\nglobal C5: Field = 19103219067921713944291392827692070036145651957329286315305642004821462161904;\n\n// @dev: only use this for _huge_ exponents y, when writing a constrained function.\n// If you're only exponentiating by a small value, first consider writing-out the multiplications by hand.\n// Only after you've measured the gates of that approach, consider using the native Field::pow_32 function.\n// Only if your exponent is larger than 32 bits, resort to using this function.\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] = field2.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\n#[test]\nunconstrained fn sqrt_zero_test() {\n    let result = sqrt(0);\n    assert(result.is_some());\n    assert_eq(result.unwrap(), 0);\n}\n\n#[test]\nunconstrained fn sqrt_one_test() {\n    let result = sqrt(1);\n    assert(result.is_some());\n    assert_eq(result.unwrap() * result.unwrap(), 1);\n}\n\n#[test]\nunconstrained fn field_from_bytes_empty_test() {\n    let empty: [u8; 0] = [];\n    let result = field_from_bytes(empty, true);\n    assert_eq(result, 0);\n\n    let result_le = field_from_bytes(empty, false);\n    assert_eq(result_le, 0);\n}\n\n#[test]\nunconstrained fn field_from_bytes_little_endian_test() {\n    // Test little-endian conversion: [0x01, 0x02] should be 0x0201 = 513\n    let bytes = [0x01, 0x02];\n    let result_le = field_from_bytes(bytes, false);\n    assert_eq(result_le, 0x0201);\n\n    // Compare with big-endian: [0x01, 0x02] should be 0x0102 = 258\n    let result_be = field_from_bytes(bytes, true);\n    assert_eq(result_be, 0x0102);\n}\n\n#[test]\nunconstrained fn pow_test() {\n    assert_eq(pow(2, 0), 1);\n    assert_eq(pow(2, 1), 2);\n    assert_eq(pow(2, 10), 1024);\n    assert_eq(pow(3, 5), 243);\n    assert_eq(pow(0, 5), 0);\n    assert_eq(pow(1, 100), 1);\n}\n\n#[test]\nunconstrained fn min_test() {\n    assert_eq(min(5, 10), 5);\n    assert_eq(min(10, 5), 5);\n    assert_eq(min(7, 7), 7);\n    assert_eq(min(0, 1), 0);\n}\n\n#[test]\nunconstrained fn full_field_comparison_test() {\n    assert(full_field_less_than(5, 10));\n    assert(!full_field_less_than(10, 5));\n    assert(!full_field_less_than(5, 5));\n\n    assert(full_field_greater_than(10, 5));\n    assert(!full_field_greater_than(5, 10));\n    assert(!full_field_greater_than(5, 5));\n}\n\n#[test]\nunconstrained fn sqrt_has_two_roots_test() {\n    // Every square has two roots: r and -r (i.e., p - r)\n    // sqrt(16) can return 4 or -4\n    let x = 16;\n    let result = sqrt(x).unwrap();\n    assert(result * result == x);\n    // The other root is -result\n    let other_root = 0 - result;\n    assert(other_root * other_root == x);\n    // Verify they are different (unless x = 0)\n    assert(result != other_root);\n\n    // Same for 9: roots are 3 and -3\n    let y = 9;\n    let result_y = sqrt(y).unwrap();\n    assert(result_y * result_y == y);\n    let other_root_y = 0 - result_y;\n    assert(other_root_y * other_root_y == y);\n    assert(result_y != other_root_y);\n}\n\n#[test]\nunconstrained fn sqrt_negative_one_test() {\n    let x = 0 - 1;\n    let result = sqrt(x);\n    assert(result.unwrap() == 0x30644e72e131a029048b6e193fd841045cea24f6fd736bec231204708f703636);\n}\n\n#[test]\nunconstrained fn validate_sqrt_hint_valid_test() {\n    // 4 is a valid sqrt of 16\n    validate_sqrt_hint(16, 4);\n    // -4 is also a valid sqrt of 16\n    validate_sqrt_hint(16, 0 - 4);\n    // 0 is a valid sqrt of 0\n    validate_sqrt_hint(0, 0);\n    // 1 is a valid sqrt of 1\n    validate_sqrt_hint(1, 1);\n    // -1 is also a valid sqrt of 1\n    validate_sqrt_hint(1, 0 - 1);\n}\n\n#[test(should_fail_with = \"is not the sqrt of x\")]\nunconstrained fn validate_sqrt_hint_invalid_test() {\n    // 5 is not a valid sqrt of 16\n    validate_sqrt_hint(16, 5);\n}\n\n#[test]\nunconstrained fn validate_not_sqrt_hint_valid_test() {\n    // 5 (KNOWN_NON_RESIDUE) is not a square.\n    let x = KNOWN_NON_RESIDUE;\n    let hint = tonelli_shanks_sqrt(x * KNOWN_NON_RESIDUE);\n    validate_not_sqrt_hint(x, hint);\n}\n\n#[test(should_fail_with = \"0 has a square root\")]\nunconstrained fn validate_not_sqrt_hint_zero_test() {\n    // 0 has a square root, so we cannot claim it is not square\n    validate_not_sqrt_hint(0, 0);\n}\n\n#[test(should_fail_with = \"does not demonstrate that\")]\nunconstrained fn validate_not_sqrt_hint_wrong_hint_test() {\n    // Provide a wrong hint for a non-square\n    let x = KNOWN_NON_RESIDUE;\n    validate_not_sqrt_hint(x, 123);\n}\n"
-    },
-    "407": {
+    "410": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/serde/src/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 peek_offset(&mut self, offset: u32) -> Field {\n        self.data[self.offset + offset]\n    }\n\n    pub fn advance_offset(&mut self, offset: u32) {\n        self.offset += offset;\n    }\n\n    pub fn finish(self) {\n        assert_eq(self.offset, self.data.len(), \"Reader did not read all data\");\n    }\n}\n"
     },
-    "408": {
+    "411": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/serde/src/serialization.nr",
       "source": "use crate::{reader::Reader, writer::Writer};\n\n// docs:start:serialize\n/// Trait for serializing Noir types into arrays of Fields.\n///\n/// An implementation of the Serialize trait has to follow Noir's intrinsic serialization (each member of a struct\n/// converted directly into one or more Fields without any packing or compression). This trait (and Deserialize) are\n/// typically used to communicate between Noir and TypeScript (via oracles and function arguments).\n///\n/// # On Following Noir's Intrinsic Serialization\n/// When calling a Noir function from TypeScript (TS), first the function arguments are serialized into an array\n/// of fields. This array is then included in the initial witness. Noir's intrinsic serialization is then used\n/// to deserialize the arguments from the witness. When the same Noir function is called from Noir this Serialize trait\n/// is used instead of the serialization in TS. For this reason we need to have a match between TS serialization,\n/// Noir's intrinsic serialization and the implementation of this trait. If there is a mismatch, the function calls\n/// fail with an arguments hash mismatch error message.\n///\n/// # Associated Constants\n/// * `N` - The length of the output Field array, known at compile time\n///\n/// # Example\n/// ```\n/// impl<let N: u32> Serialize for str<N> {\n///     let N: u32 = N;\n///\n///     fn serialize(self) -> [Field; Self::N] {\n///         let mut writer: Writer<Self::N> = Writer::new();\n///         self.stream_serialize(&mut writer);\n///         writer.finish()\n///     }\n///\n///     fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n///         let bytes = self.as_bytes();\n///         for i in 0..bytes.len() {\n///             writer.write(bytes[i] as Field);\n///         }\n///     }\n/// }\n/// ```\n#[derive_via(derive_serialize)]\npub trait Serialize {\n    let N: u32;\n\n    fn serialize(self) -> [Field; Self::N];\n\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>);\n}\n\n/// Generates a `Serialize` trait implementation for a struct type.\n///\n/// # Parameters\n/// - `s`: The struct type definition to generate the implementation for\n///\n/// # Returns\n/// A quoted code block containing the trait implementation\n///\n/// # Example\n/// For a struct defined as:\n/// ```\n/// struct Log<N> {\n///     fields: [Field; N],\n///     length: u32\n/// }\n/// ```\n///\n/// This function generates code equivalent to:\n/// ```\n/// impl<let N: u32> Serialize for Log<N> {\n///     let N: u32 = <[Field; N] as Serialize>::N + <u32 as Serialize>::N;\n///\n///     fn serialize(self) -> [Field; Self::N] {\n///         let mut writer: Writer<Self::N> = Writer::new();\n///         self.stream_serialize(&mut writer);\n///         writer.finish()\n///     }\n///\n///     #[inline_always]\n///     fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n///         Serialize::stream_serialize(self.fields, writer);\n///         Serialize::stream_serialize(self.length, writer);\n///     }\n/// }\n/// ```\npub comptime fn derive_serialize(s: TypeDefinition) -> Quoted {\n    let typ = s.as_type();\n    let nested_struct = typ.as_data_type().unwrap();\n\n    // We care only about the name and type so we drop the last item of the tuple\n    let params = nested_struct.0.fields(nested_struct.1).map(|(name, typ, _)| (name, typ));\n\n    // Generates the generic parameter declarations (to be placed after the `impl` keyword) and the `where` clause\n    // for the `Serialize` trait.\n    let generics_declarations = get_generics_declarations(s);\n    let where_serialize_clause = get_where_trait_clause(s, quote {Serialize});\n\n    let params_len_quote = get_params_len_quote(params);\n\n    let function_body = params\n        .map(|(name, _typ): (Quoted, Type)| {\n            quote {\n                $crate::serialization::Serialize::stream_serialize(self.$name, writer);\n            }\n        })\n        .join(quote {});\n\n    quote {\n        impl$generics_declarations $crate::serialization::Serialize for $typ\n            $where_serialize_clause\n        {\n            let N: u32 = $params_len_quote;\n\n\n            fn serialize(self) -> [Field; Self::N] {\n                let mut writer: $crate::writer::Writer<Self::N> = $crate::writer::Writer::new();\n                $crate::serialization::Serialize::stream_serialize(self, &mut writer);\n                writer.finish()\n            }\n\n\n            #[inline_always]\n             fn stream_serialize<let K: u32>(self, writer: &mut $crate::writer::Writer<K>) {\n                $function_body\n            }\n        }\n    }\n}\n\n// docs:start:deserialize\n/// Trait for deserializing Noir types from arrays of Fields.\n///\n/// An implementation of the Deserialize trait has to follow Noir's intrinsic serialization (each member of a struct\n/// converted directly into one or more Fields without any packing or compression). This trait is typically used when\n/// deserializing return values from function calls in Noir. Since the same function could be called from TypeScript\n/// (TS), in which case the TS deserialization would get used, we need to have a match between the 2.\n///\n/// # Associated Constants\n/// * `N` - The length of the input Field array, known at compile time\n///\n/// # Example\n/// ```\n/// impl<let M: u32> Deserialize for str<M> {\n///     let N: u32 = M;\n///\n///     fn deserialize(fields: [Field; Self::N]) -> Self {\n///         let mut reader = Reader::new(fields);\n///         let result = Self::stream_deserialize(&mut reader);\n///         reader.finish();\n///         result\n///     }\n///\n///     fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n///         let mut bytes = [0 as u8; M];\n///         for i in 0..M {\n///             bytes[i] = reader.read() as u8;\n///         }\n///         str::<M>::from(bytes)\n///     }\n/// }\n/// ```\n#[derive_via(derive_deserialize)]\npub trait Deserialize {\n    let N: u32;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self;\n\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self;\n}\n\n/// Generates a `Deserialize` trait implementation for a given struct `s`.\n///\n/// # Arguments\n/// * `s` - The struct type definition to generate the implementation for\n///\n/// # Returns\n/// A `Quoted` block containing the generated trait implementation\n///\n/// # Requirements\n/// Each struct member type must implement the `Deserialize` trait (it gets used in the generated code).\n///\n/// # Example\n/// For a struct like:\n/// ```\n/// struct MyStruct {\n///     x: AztecAddress,\n///     y: Field,\n/// }\n/// ```\n///\n/// This generates:\n/// ```\n/// impl Deserialize for MyStruct {\n///     let N: u32 = <AztecAddress as Deserialize>::N + <Field as Deserialize>::N;\n///\n///     fn deserialize(fields: [Field; Self::N]) -> Self {\n///         let mut reader = Reader::new(fields);\n///         let result = Self::stream_deserialize(&mut reader);\n///         reader.finish();\n///         result\n///     }\n///\n///     #[inline_always]\n///     fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n///         let x = <AztecAddress as Deserialize>::stream_deserialize(reader);\n///         let y = <Field as Deserialize>::stream_deserialize(reader);\n///         Self { x, y }\n///     }\n/// }\n/// ```\npub comptime fn derive_deserialize(s: TypeDefinition) -> Quoted {\n    let typ = s.as_type();\n    let nested_struct = typ.as_data_type().unwrap();\n    let params = nested_struct.0.fields(nested_struct.1);\n\n    // Generates the generic parameter declarations (to be placed after the `impl` keyword) and the `where` clause\n    // for the `Deserialize` trait.\n    let generics_declarations = get_generics_declarations(s);\n    let where_deserialize_clause = get_where_trait_clause(s, quote {Deserialize});\n\n    // The following will give us:\n    // <type_of_struct_member_1 as Deserialize>::N + <type_of_struct_member_2 as Deserialize>::N + ...\n    // (or 0 if the struct has no members)\n    let right_hand_side_of_definition_of_n = if params.len() > 0 {\n        params\n            .map(|(_, param_type, _): (Quoted, Type, Quoted)| {\n                quote {\n            <$param_type as $crate::serialization::Deserialize>::N\n        }\n            })\n            .join(quote {+})\n    } else {\n        quote {0}\n    };\n\n    // For structs containing a single member, we can enhance performance by directly deserializing the input array,\n    // bypassing the need for loop-based array construction. While this optimization yields significant benefits in\n    // Brillig where the loops are expected to not be optimized, it is not relevant in ACIR where the loops are\n    // expected to be optimized away.\n    let function_body = if params.len() > 1 {\n        // This generates deserialization code for each struct member and concatenates them together.\n        let deserialization_of_struct_members = params\n            .map(|(param_name, param_type, _): (Quoted, Type, Quoted)| {\n                quote {\n                    let $param_name = <$param_type as Deserialize>::stream_deserialize(reader);\n                }\n            })\n            .join(quote {});\n\n        // We join the struct member names with a comma to be used in the `Self { ... }` syntax\n        // This will give us e.g. `a, b, c` for a struct with three fields named `a`, `b`, and `c`.\n        let struct_members = params\n            .map(|(param_name, _, _): (Quoted, Type, Quoted)| quote { $param_name })\n            .join(quote {,});\n\n        quote {\n            $deserialization_of_struct_members\n\n            Self { $struct_members }\n        }\n    } else if params.len() == 1 {\n        let param_name = params[0].0;\n        quote {\n            Self { $param_name: $crate::serialization::Deserialize::stream_deserialize(reader) }\n        }\n    } else {\n        quote {\n            Self {}\n        }\n    };\n\n    quote {\n        impl$generics_declarations $crate::serialization::Deserialize for $typ\n            $where_deserialize_clause\n        {\n            let N: u32 = $right_hand_side_of_definition_of_n;\n\n            fn deserialize(fields: [Field; Self::N]) -> Self {\n                let mut reader = $crate::reader::Reader::new(fields);\n                let result = Self::stream_deserialize(&mut reader);\n                reader.finish();\n                result\n            }\n\n            #[inline_always]\n            fn stream_deserialize<let K: u32>(reader: &mut $crate::reader::Reader<K>) -> Self {\n                $function_body\n            }\n        }\n    }\n}\n\n/// Generates a quoted expression that computes the total serialized length of function parameters.\n///\n/// # Parameters\n/// * `params` - An array of tuples where each tuple contains a quoted parameter name and its Type. The type needs\n///              to implement the Serialize trait.\n///\n/// # Returns\n/// A quoted expression that evaluates to:\n/// * `0` if there are no parameters\n/// * `(<type1 as Serialize>::N + <type2 as Serialize>::N + ...)` for one or more parameters\ncomptime fn get_params_len_quote(params: [(Quoted, Type)]) -> Quoted {\n    if params.len() == 0 {\n        quote { 0 }\n    } else {\n        let params_quote_without_parentheses = params\n            .map(|(_, param_type): (Quoted, Type)| {\n                quote {\n                    <$param_type as $crate::serialization::Serialize>::N\n                }\n            })\n            .join(quote {+});\n        quote { ($params_quote_without_parentheses) }\n    }\n}\n\ncomptime fn get_generics_declarations(s: TypeDefinition) -> Quoted {\n    let generics = s.generics();\n\n    if generics.len() > 0 {\n        let generics_declarations_items = generics\n            .map(|(name, maybe_integer_typ)| {\n                // The second item in the generics tuple is an Option of an integer type that is Some only if\n                // the generic is numeric.\n                if maybe_integer_typ.is_some() {\n                    // The generic is numeric, so we return a quote defined as e.g. \"let N: u32\"\n                    let integer_type = maybe_integer_typ.unwrap();\n                    quote {let $name: $integer_type}\n                } else {\n                    // The generic is not numeric, so we return a quote containing the name of the generic (e.g. \"T\")\n                    quote {$name}\n                }\n            })\n            .join(quote {,});\n        quote {<$generics_declarations_items>}\n    } else {\n        // The struct doesn't have any generics defined, so we just return an empty quote.\n        quote {}\n    }\n}\n\ncomptime fn get_where_trait_clause(s: TypeDefinition, trait_name: Quoted) -> Quoted {\n    let generics = s.generics();\n\n    // The second item in the generics tuple is an Option of an integer type that is Some only if the generic is\n    // numeric.\n    let non_numeric_generics =\n        generics.filter(|(_, maybe_integer_typ)| maybe_integer_typ.is_none());\n\n    if non_numeric_generics.len() > 0 {\n        let non_numeric_generics_declarations =\n            non_numeric_generics.map(|(name, _)| quote {$name: $trait_name}).join(quote {,});\n        quote {where $non_numeric_generics_declarations}\n    } else {\n        // There are no non-numeric generics, so we return an empty quote.\n        quote {}\n    }\n}\n"
     },
-    "410": {
+    "413": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/serde/src/type_impls.nr",
-      "source": "use crate::{reader::Reader, serialization::{Deserialize, Serialize}, writer::Writer};\nuse std::embedded_curve_ops::EmbeddedCurvePoint;\nuse std::embedded_curve_ops::EmbeddedCurveScalar;\n\nglobal U1_SERIALIZED_LEN: u32 = 1;\nglobal BOOL_SERIALIZED_LEN: u32 = 1;\nglobal U8_SERIALIZED_LEN: u32 = 1;\nglobal U16_SERIALIZED_LEN: u32 = 1;\nglobal U32_SERIALIZED_LEN: u32 = 1;\nglobal U64_SERIALIZED_LEN: u32 = 1;\nglobal U128_SERIALIZED_LEN: u32 = 1;\nglobal FIELD_SERIALIZED_LEN: u32 = 1;\nglobal I8_SERIALIZED_LEN: u32 = 1;\nglobal I16_SERIALIZED_LEN: u32 = 1;\nglobal I32_SERIALIZED_LEN: u32 = 1;\nglobal I64_SERIALIZED_LEN: u32 = 1;\n\nimpl Serialize for bool {\n    let N: u32 = BOOL_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as Field);\n    }\n}\n\nimpl Deserialize for bool {\n    let N: u32 = BOOL_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> bool {\n        reader.read() != 0\n    }\n}\n\nimpl Serialize for u1 {\n    let N: u32 = U1_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as Field);\n    }\n}\n\nimpl Deserialize for u1 {\n    let N: u32 = U1_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u1\n    }\n}\n\nimpl Serialize for u8 {\n    let N: u32 = U8_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as Field);\n    }\n}\n\nimpl Deserialize for u8 {\n    let N: u32 = U8_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u8\n    }\n}\n\nimpl Serialize for u16 {\n    let N: u32 = U16_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as Field);\n    }\n}\n\nimpl Deserialize for u16 {\n    let N: u32 = U16_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u16\n    }\n}\n\nimpl Serialize for u32 {\n    let N: u32 = U32_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as Field);\n    }\n}\n\nimpl Deserialize for u32 {\n    let N: u32 = U32_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u32\n    }\n}\n\nimpl Serialize for u64 {\n    let N: u32 = U64_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as Field);\n    }\n}\n\nimpl Deserialize for u64 {\n    let N: u32 = U64_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u64\n    }\n}\n\nimpl Serialize for u128 {\n    let N: u32 = U128_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as Field);\n    }\n}\n\nimpl Deserialize for u128 {\n    let N: u32 = U128_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u128\n    }\n}\n\nimpl Serialize for Field {\n    let N: u32 = FIELD_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self);\n    }\n}\n\nimpl Deserialize for Field {\n    let N: u32 = FIELD_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read()\n    }\n}\n\nimpl Serialize for i8 {\n    let N: u32 = I8_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as u8 as Field);\n    }\n}\n\nimpl Deserialize for i8 {\n    let N: u32 = I8_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u8 as i8\n    }\n}\n\nimpl Serialize for i16 {\n    let N: u32 = I16_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as u16 as Field);\n    }\n}\n\nimpl Deserialize for i16 {\n    let N: u32 = I16_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u16 as i16\n    }\n}\n\nimpl Serialize for i32 {\n    let N: u32 = I32_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as u32 as Field);\n    }\n}\n\nimpl Deserialize for i32 {\n    let N: u32 = I32_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u32 as i32\n    }\n}\n\nimpl Serialize for i64 {\n    let N: u32 = I64_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as u64 as Field);\n    }\n}\n\nimpl Deserialize for i64 {\n    let N: u32 = I64_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u64 as i64\n    }\n}\n\nimpl<T, let M: u32> Serialize for [T; M]\nwhere\n    T: Serialize,\n{\n    let N: u32 = <T as Serialize>::N * M;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        for i in 0..M {\n            self[i].stream_serialize(writer);\n        }\n    }\n}\n\nimpl<T, let M: u32> Deserialize for [T; M]\nwhere\n    T: Deserialize,\n{\n    let N: u32 = <T as Deserialize>::N * M;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        let mut result: [T; M] = std::mem::zeroed();\n        for i in 0..M {\n            result[i] = T::stream_deserialize(reader);\n        }\n        result\n    }\n}\n\nimpl<T> Serialize for Option<T>\nwhere\n    T: Serialize,\n{\n    let N: u32 = <T as Serialize>::N + 1;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write_bool(self.is_some());\n        if self.is_some() {\n            self.unwrap_unchecked().stream_serialize(writer);\n        } else {\n            writer.advance_offset(<T as Serialize>::N);\n        }\n    }\n}\n\nimpl<T> Deserialize for Option<T>\nwhere\n    T: Deserialize,\n{\n    let N: u32 = <T as Deserialize>::N + 1;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        if reader.read_bool() {\n            Option::some(<T as Deserialize>::stream_deserialize(reader))\n        } else {\n            reader.advance_offset(<T as Deserialize>::N);\n            Option::none()\n        }\n    }\n}\n\nglobal SCALAR_SIZE: u32 = 2;\n\nimpl Serialize for EmbeddedCurveScalar {\n\n    let N: u32 = SCALAR_SIZE;\n\n    fn serialize(self) -> [Field; SCALAR_SIZE] {\n        [self.lo, self.hi]\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self.lo);\n        writer.write(self.hi);\n    }\n}\n\nimpl Deserialize for EmbeddedCurveScalar {\n    let N: u32 = SCALAR_SIZE;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        Self { lo: fields[0], hi: fields[1] }\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        Self { lo: reader.read(), hi: reader.read() }\n    }\n}\n\nglobal POINT_SIZE: u32 = 3;\n\nimpl Serialize for EmbeddedCurvePoint {\n    let N: u32 = POINT_SIZE;\n\n    fn serialize(self) -> [Field; Self::N] {\n        [self.x, self.y, self.is_infinite as Field]\n    }\n\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self.x);\n        writer.write(self.y);\n        writer.write(self.is_infinite as Field);\n    }\n}\n\nimpl Deserialize for EmbeddedCurvePoint {\n    let N: u32 = POINT_SIZE;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        Self { x: fields[0], y: fields[1], is_infinite: fields[2] != 0 }\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        Self { x: reader.read(), y: reader.read(), is_infinite: reader.read_bool() }\n    }\n}\n\nimpl<let M: u32> Deserialize for str<M> {\n    let N: u32 = M;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        let u8_arr = <[u8; Self::N] as Deserialize>::stream_deserialize(reader);\n        str::<Self::N>::from(u8_arr)\n    }\n}\n\nimpl<let M: u32> Serialize for str<M> {\n    let N: u32 = M;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        self.as_bytes().stream_serialize(writer);\n    }\n}\n\n// Note: Not deriving this because it's not supported to call derive_serialize on a \"remote\" struct (and it will never\n// be supported).\nimpl<T, let M: u32> Deserialize for BoundedVec<T, M>\nwhere\n    T: Deserialize,\n{\n    let N: u32 = <T as Deserialize>::N * M + 1;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        let mut new_bounded_vec: BoundedVec<T, M> = BoundedVec::new();\n        let payload_len = Self::N - 1;\n\n        // Length is stored in the last field as we need to match intrinsic Noir serialization and the `len` struct\n        // field is after `storage` struct field (see `bounded_vec.nr` in noir-stdlib)\n        let len = reader.peek_offset(payload_len) as u32;\n\n        for i in 0..M {\n            if i < len {\n                new_bounded_vec.push(<T as Deserialize>::stream_deserialize(reader));\n            }\n        }\n\n        // +1 for the length of the BoundedVec\n        reader.advance_offset((M - len) * <T as Deserialize>::N + 1);\n\n        new_bounded_vec\n    }\n}\n\n// This may cause issues if used as program input, because noir disallows empty arrays for program input.\n// I think this is okay because I don't foresee a unit type being used as input. But leaving this comment as a hint\n// if someone does run into this in the future.\nimpl Deserialize for () {\n    let N: u32 = 0;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(_reader: &mut Reader<K>) -> Self {\n        ()\n    }\n}\n\n// Note: Not deriving this because it's not supported to call derive_serialize on a \"remote\" struct (and it will never\n// be supported).\nimpl<T, let M: u32> Serialize for BoundedVec<T, M>\nwhere\n    T: Serialize,\n{\n    let N: u32 = <T as Serialize>::N * M + 1; // +1 for the length of the BoundedVec\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        self.storage().stream_serialize(writer);\n        // Length is stored in the last field as we need to match intrinsic Noir serialization and the `len` struct\n        // field is after `storage` struct field (see `bounded_vec.nr` in noir-stdlib)\n        writer.write_u32(self.len() as u32);\n    }\n}\n\n// Create a slice of the given length with each element made from `f(i)` where `i` is the current index\ncomptime fn make_slice<Env, T>(length: u32, f: fn[Env](u32) -> T) -> [T] {\n    let mut slice = @[];\n    for i in 0..length {\n        slice = slice.push_back(f(i));\n    }\n    slice\n}\n\n// Implements Serialize and Deserialize for an arbitrary tuple type\ncomptime fn impl_serialize_for_tuple(_m: Module, length: u32) -> Quoted {\n    // `T0`, `T1`, `T2`\n    let type_names = make_slice(length, |i| f\"T{i}\".quoted_contents());\n\n    // `result0`, `result1`, `result2`\n    let result_names = make_slice(length, |i| f\"result{i}\".quoted_contents());\n\n    // `T0, T1, T2`\n    let field_generics = type_names.join(quote [,]);\n\n    // `<T0 as Serialize>::N + <T1 as Serialize>::N + <T2 as Serialize>::N`\n    let full_size_serialize = type_names\n        .map(|type_name| quote {\n        <$type_name as Serialize>::N\n    })\n        .join(quote [+]);\n\n    // `<T0 as Deserialize>::N + <T1 as Deserialize>::N + <T2 as Deserialize>::N`\n    let full_size_deserialize = type_names\n        .map(|type_name| quote {\n        <$type_name as Deserialize>::N\n    })\n        .join(quote [+]);\n\n    // `T0: Serialize, T1: Serialize, T2: Serialize,`\n    let serialize_constraints = type_names\n        .map(|field_name| quote {\n        $field_name: Serialize,\n    })\n        .join(quote []);\n\n    // `T0: Deserialize, T1: Deserialize, T2: Deserialize,`\n    let deserialize_constraints = type_names\n        .map(|field_name| quote {\n        $field_name: Deserialize,\n    })\n        .join(quote []);\n\n    // Statements to serialize each field\n    let serialized_fields = type_names\n        .mapi(|i, _type_name| quote {\n            $crate::serialization::Serialize::stream_serialize(self.$i, writer);\n    })\n        .join(quote []);\n\n    // Statements to deserialize each field\n    let deserialized_fields = type_names\n        .mapi(|i, type_name| {\n            let result_name = result_names[i];\n            quote {\n            let $result_name = <$type_name as $crate::serialization::Deserialize>::stream_deserialize(reader);\n        }\n        })\n        .join(quote []);\n    let deserialize_results = result_names.join(quote [,]);\n\n    quote {\n        impl<$field_generics> Serialize for ($field_generics) where $serialize_constraints {\n            let N: u32 = $full_size_serialize;\n\n            fn serialize(self) -> [Field; Self::N] {\n                let mut writer: $crate::writer::Writer<Self::N> = $crate::writer::Writer::new();\n                self.stream_serialize(&mut writer);\n                writer.finish()\n            }\n\n            #[inline_always]\n            fn stream_serialize<let K: u32>(self, writer: &mut $crate::writer::Writer<K>) {\n\n                $serialized_fields\n            }\n        }\n\n        impl<$field_generics> Deserialize for ($field_generics) where $deserialize_constraints {\n            let N: u32 = $full_size_deserialize;\n\n            fn deserialize(fields: [Field; Self::N]) -> Self {\n                let mut reader = $crate::reader::Reader::new(fields);\n                let result = Self::stream_deserialize(&mut reader);\n                reader.finish();\n                result\n            }\n    \n            #[inline_always]\n            fn stream_deserialize<let K: u32>(reader: &mut $crate::reader::Reader<K>) -> Self {\n                $deserialized_fields\n                ($deserialize_results)\n            }\n        }\n    }\n}\n\n// Keeping these manual impls. They are more efficient since they do not\n// require copying sub-arrays from any serialized arrays.\nimpl<T1> Serialize for (T1,)\nwhere\n    T1: Serialize,\n{\n    let N: u32 = <T1 as Serialize>::N;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: crate::writer::Writer<Self::N> = crate::writer::Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        self.0.stream_serialize(writer);\n    }\n}\n\nimpl<T1> Deserialize for (T1,)\nwhere\n    T1: Deserialize,\n{\n    let N: u32 = <T1 as Deserialize>::N;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = crate::reader::Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        (<T1 as Deserialize>::stream_deserialize(reader),)\n    }\n}\n\n#[impl_serialize_for_tuple(2)]\n#[impl_serialize_for_tuple(3)]\n#[impl_serialize_for_tuple(4)]\n#[impl_serialize_for_tuple(5)]\n#[impl_serialize_for_tuple(6)]\nmod impls {\n    use crate::serialization::{Deserialize, Serialize};\n}\n"
+      "source": "use crate::{reader::Reader, serialization::{Deserialize, Serialize}, writer::Writer};\nuse std::embedded_curve_ops::EmbeddedCurvePoint;\nuse std::embedded_curve_ops::EmbeddedCurveScalar;\n\nglobal U1_SERIALIZED_LEN: u32 = 1;\nglobal BOOL_SERIALIZED_LEN: u32 = 1;\nglobal U8_SERIALIZED_LEN: u32 = 1;\nglobal U16_SERIALIZED_LEN: u32 = 1;\nglobal U32_SERIALIZED_LEN: u32 = 1;\nglobal U64_SERIALIZED_LEN: u32 = 1;\nglobal U128_SERIALIZED_LEN: u32 = 1;\nglobal FIELD_SERIALIZED_LEN: u32 = 1;\nglobal I8_SERIALIZED_LEN: u32 = 1;\nglobal I16_SERIALIZED_LEN: u32 = 1;\nglobal I32_SERIALIZED_LEN: u32 = 1;\nglobal I64_SERIALIZED_LEN: u32 = 1;\n\nimpl Serialize for bool {\n    let N: u32 = BOOL_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as Field);\n    }\n}\n\nimpl Deserialize for bool {\n    let N: u32 = BOOL_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> bool {\n        reader.read() != 0\n    }\n}\n\nimpl Serialize for u1 {\n    let N: u32 = U1_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as Field);\n    }\n}\n\nimpl Deserialize for u1 {\n    let N: u32 = U1_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u1\n    }\n}\n\nimpl Serialize for u8 {\n    let N: u32 = U8_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as Field);\n    }\n}\n\nimpl Deserialize for u8 {\n    let N: u32 = U8_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u8\n    }\n}\n\nimpl Serialize for u16 {\n    let N: u32 = U16_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as Field);\n    }\n}\n\nimpl Deserialize for u16 {\n    let N: u32 = U16_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u16\n    }\n}\n\nimpl Serialize for u32 {\n    let N: u32 = U32_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as Field);\n    }\n}\n\nimpl Deserialize for u32 {\n    let N: u32 = U32_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u32\n    }\n}\n\nimpl Serialize for u64 {\n    let N: u32 = U64_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as Field);\n    }\n}\n\nimpl Deserialize for u64 {\n    let N: u32 = U64_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u64\n    }\n}\n\nimpl Serialize for u128 {\n    let N: u32 = U128_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as Field);\n    }\n}\n\nimpl Deserialize for u128 {\n    let N: u32 = U128_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u128\n    }\n}\n\nimpl Serialize for Field {\n    let N: u32 = FIELD_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self);\n    }\n}\n\nimpl Deserialize for Field {\n    let N: u32 = FIELD_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read()\n    }\n}\n\nimpl Serialize for i8 {\n    let N: u32 = I8_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as u8 as Field);\n    }\n}\n\nimpl Deserialize for i8 {\n    let N: u32 = I8_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u8 as i8\n    }\n}\n\nimpl Serialize for i16 {\n    let N: u32 = I16_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as u16 as Field);\n    }\n}\n\nimpl Deserialize for i16 {\n    let N: u32 = I16_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u16 as i16\n    }\n}\n\nimpl Serialize for i32 {\n    let N: u32 = I32_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as u32 as Field);\n    }\n}\n\nimpl Deserialize for i32 {\n    let N: u32 = I32_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u32 as i32\n    }\n}\n\nimpl Serialize for i64 {\n    let N: u32 = I64_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as u64 as Field);\n    }\n}\n\nimpl Deserialize for i64 {\n    let N: u32 = I64_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u64 as i64\n    }\n}\n\nimpl<T, let M: u32> Serialize for [T; M]\nwhere\n    T: Serialize,\n{\n    let N: u32 = <T as Serialize>::N * M;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        for i in 0..M {\n            self[i].stream_serialize(writer);\n        }\n    }\n}\n\nimpl<T, let M: u32> Deserialize for [T; M]\nwhere\n    T: Deserialize,\n{\n    let N: u32 = <T as Deserialize>::N * M;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        let mut result: [T; M] = std::mem::zeroed();\n        for i in 0..M {\n            result[i] = T::stream_deserialize(reader);\n        }\n        result\n    }\n}\n\nimpl<T> Serialize for Option<T>\nwhere\n    T: Serialize,\n{\n    let N: u32 = <T as Serialize>::N + 1;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write_bool(self.is_some());\n        if self.is_some() {\n            self.unwrap_unchecked().stream_serialize(writer);\n        } else {\n            writer.advance_offset(<T as Serialize>::N);\n        }\n    }\n}\n\nimpl<T> Deserialize for Option<T>\nwhere\n    T: Deserialize,\n{\n    let N: u32 = <T as Deserialize>::N + 1;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        if reader.read_bool() {\n            Option::some(<T as Deserialize>::stream_deserialize(reader))\n        } else {\n            reader.advance_offset(<T as Deserialize>::N);\n            Option::none()\n        }\n    }\n}\n\nglobal SCALAR_SIZE: u32 = 2;\n\nimpl Serialize for EmbeddedCurveScalar {\n\n    let N: u32 = SCALAR_SIZE;\n\n    fn serialize(self) -> [Field; SCALAR_SIZE] {\n        [self.lo, self.hi]\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self.lo);\n        writer.write(self.hi);\n    }\n}\n\nimpl Deserialize for EmbeddedCurveScalar {\n    let N: u32 = SCALAR_SIZE;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        Self { lo: fields[0], hi: fields[1] }\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        Self { lo: reader.read(), hi: reader.read() }\n    }\n}\n\nglobal POINT_SIZE: u32 = 3;\n\nimpl Serialize for EmbeddedCurvePoint {\n    let N: u32 = POINT_SIZE;\n\n    fn serialize(self) -> [Field; Self::N] {\n        [self.x, self.y, self.is_infinite as Field]\n    }\n\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self.x);\n        writer.write(self.y);\n        writer.write(self.is_infinite as Field);\n    }\n}\n\nimpl Deserialize for EmbeddedCurvePoint {\n    let N: u32 = POINT_SIZE;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        Self { x: fields[0], y: fields[1], is_infinite: fields[2] != 0 }\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        Self { x: reader.read(), y: reader.read(), is_infinite: reader.read_bool() }\n    }\n}\n\nimpl<let M: u32> Deserialize for str<M> {\n    let N: u32 = M;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        let u8_arr = <[u8; Self::N] as Deserialize>::stream_deserialize(reader);\n        str::<Self::N>::from(u8_arr)\n    }\n}\n\nimpl<let M: u32> Serialize for str<M> {\n    let N: u32 = M;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        self.as_bytes().stream_serialize(writer);\n    }\n}\n\n// Note: Not deriving this because it's not supported to call derive_serialize on a \"remote\" struct (and it will never\n// be supported).\nimpl<T, let M: u32> Deserialize for BoundedVec<T, M>\nwhere\n    T: Deserialize,\n{\n    let N: u32 = <T as Deserialize>::N * M + 1;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        let mut new_bounded_vec: BoundedVec<T, M> = BoundedVec::new();\n        let payload_len = Self::N - 1;\n\n        // Length is stored in the last field as we need to match intrinsic Noir serialization and the `len` struct\n        // field is after `storage` struct field (see `bounded_vec.nr` in noir-stdlib)\n        let len = reader.peek_offset(payload_len) as u32;\n\n        for i in 0..M {\n            if i < len {\n                new_bounded_vec.push(<T as Deserialize>::stream_deserialize(reader));\n            }\n        }\n\n        // +1 for the length of the BoundedVec\n        reader.advance_offset((M - len) * <T as Deserialize>::N + 1);\n\n        new_bounded_vec\n    }\n}\n\n// This may cause issues if used as program input, because noir disallows empty arrays for program input.\n// I think this is okay because I don't foresee a unit type being used as input. But leaving this comment as a hint\n// if someone does run into this in the future.\nimpl Deserialize for () {\n    let N: u32 = 0;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(_reader: &mut Reader<K>) -> Self {\n        ()\n    }\n}\n\n// Note: Not deriving this because it's not supported to call derive_serialize on a \"remote\" struct (and it will never\n// be supported).\nimpl<T, let M: u32> Serialize for BoundedVec<T, M>\nwhere\n    T: Serialize,\n{\n    let N: u32 = <T as Serialize>::N * M + 1; // +1 for the length of the BoundedVec\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        self.storage().stream_serialize(writer);\n        // Length is stored in the last field as we need to match intrinsic Noir serialization and the `len` struct\n        // field is after `storage` struct field (see `bounded_vec.nr` in noir-stdlib)\n        writer.write_u32(self.len() as u32);\n    }\n}\n\n// Create a slice of the given length with each element made from `f(i)` where `i` is the current index\ncomptime fn make_slice<Env, T>(length: u32, f: fn[Env](u32) -> T) -> [T] {\n    let mut slice = @[];\n    for i in 0..length {\n        slice = slice.push_back(f(i));\n    }\n    slice\n}\n\n// Implements Serialize and Deserialize for an arbitrary tuple type\ncomptime fn impl_serialize_for_tuple(_m: Module, length: u32) -> Quoted {\n    // `T0`, `T1`, `T2`\n    let type_names = make_slice(length, |i| f\"T{i}\".quoted_contents());\n\n    // `result0`, `result1`, `result2`\n    let result_names = make_slice(length, |i| f\"result{i}\".quoted_contents());\n\n    // `T0, T1, T2`\n    let field_generics = type_names.join(quote [,]);\n\n    // `<T0 as Serialize>::N + <T1 as Serialize>::N + <T2 as Serialize>::N`\n    let full_size_serialize = type_names\n        .map(|type_name| quote {\n        <$type_name as Serialize>::N\n    })\n        .join(quote [+]);\n\n    // `<T0 as Deserialize>::N + <T1 as Deserialize>::N + <T2 as Deserialize>::N`\n    let full_size_deserialize = type_names\n        .map(|type_name| quote {\n        <$type_name as Deserialize>::N\n    })\n        .join(quote [+]);\n\n    // `T0: Serialize, T1: Serialize, T2: Serialize,`\n    let serialize_constraints = type_names\n        .map(|field_name| quote {\n        $field_name: Serialize,\n    })\n        .join(quote []);\n\n    // `T0: Deserialize, T1: Deserialize, T2: Deserialize,`\n    let deserialize_constraints = type_names\n        .map(|field_name| quote {\n        $field_name: Deserialize,\n    })\n        .join(quote []);\n\n    // Statements to serialize each field\n    let serialized_fields = type_names\n        .mapi(|i, _type_name| quote {\n            $crate::serialization::Serialize::stream_serialize(self.$i, writer);\n    })\n        .join(quote []);\n\n    // Statements to deserialize each field\n    let deserialized_fields = type_names\n        .mapi(|i, type_name| {\n            let result_name = result_names[i];\n            quote {\n            let $result_name = <$type_name as $crate::serialization::Deserialize>::stream_deserialize(reader);\n        }\n        })\n        .join(quote []);\n    let deserialize_results = result_names.join(quote [,]);\n\n    quote {\n        impl<$field_generics> Serialize for ($field_generics) where $serialize_constraints {\n            let N: u32 = $full_size_serialize;\n\n            fn serialize(self) -> [Field; Self::N] {\n                let mut writer: $crate::writer::Writer<Self::N> = $crate::writer::Writer::new();\n                self.stream_serialize(&mut writer);\n                writer.finish()\n            }\n\n            #[inline_always]\n            fn stream_serialize<let K: u32>(self, writer: &mut $crate::writer::Writer<K>) {\n\n                $serialized_fields\n            }\n        }\n\n        impl<$field_generics> Deserialize for ($field_generics) where $deserialize_constraints {\n            let N: u32 = $full_size_deserialize;\n\n            fn deserialize(fields: [Field; Self::N]) -> Self {\n                let mut reader = $crate::reader::Reader::new(fields);\n                let result = Self::stream_deserialize(&mut reader);\n                reader.finish();\n                result\n            }\n    \n            #[inline_always]\n            fn stream_deserialize<let K: u32>(reader: &mut $crate::reader::Reader<K>) -> Self {\n                $deserialized_fields\n                ($deserialize_results)\n            }\n        }\n    }\n}\n\n// Keeping these manual impls. They are more efficient since they do not\n// require copying sub-arrays from any serialized arrays.\nimpl<T1> Serialize for (T1,)\nwhere\n    T1: Serialize,\n{\n    let N: u32 = <T1 as Serialize>::N;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: crate::writer::Writer<Self::N> = crate::writer::Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        self.0.stream_serialize(writer);\n    }\n}\n\nimpl<T1> Deserialize for (T1,)\nwhere\n    T1: Deserialize,\n{\n    let N: u32 = <T1 as Deserialize>::N;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = crate::reader::Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        (<T1 as Deserialize>::stream_deserialize(reader),)\n    }\n}\n\n#[impl_serialize_for_tuple(2)]\n#[impl_serialize_for_tuple(3)]\n#[impl_serialize_for_tuple(4)]\n#[impl_serialize_for_tuple(5)]\n#[impl_serialize_for_tuple(6)]\nmod impls {\n    use crate::serialization::{Deserialize, Serialize};\n}\n\n#[test]\nunconstrained fn bounded_vec_serialization() {\n    // Test empty BoundedVec\n    let empty_vec: BoundedVec<Field, 3> = BoundedVec::from_array([]);\n    let serialized = empty_vec.serialize();\n    let deserialized = BoundedVec::<Field, 3>::deserialize(serialized);\n    assert_eq(empty_vec, deserialized);\n    assert_eq(deserialized.len(), 0);\n\n    // Test partially filled BoundedVec\n    let partial_vec: BoundedVec<[u32; 2], 3> = BoundedVec::from_array([[1, 2]]);\n    let serialized = partial_vec.serialize();\n    let deserialized = BoundedVec::<[u32; 2], 3>::deserialize(serialized);\n    assert_eq(partial_vec, deserialized);\n    assert_eq(deserialized.len(), 1);\n    assert_eq(deserialized.get(0), [1, 2]);\n\n    // Test full BoundedVec\n    let full_vec: BoundedVec<[u32; 2], 3> = BoundedVec::from_array([[1, 2], [3, 4], [5, 6]]);\n    let serialized = full_vec.serialize();\n    let deserialized = BoundedVec::<[u32; 2], 3>::deserialize(serialized);\n    assert_eq(full_vec, deserialized);\n    assert_eq(deserialized.len(), 3);\n    assert_eq(deserialized.get(0), [1, 2]);\n    assert_eq(deserialized.get(1), [3, 4]);\n    assert_eq(deserialized.get(2), [5, 6]);\n}\n"
     },
-    "411": {
+    "414": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/serde/src/writer.nr",
       "source": "pub struct Writer<let N: u32> {\n    data: [Field; N],\n    offset: u32,\n}\n\nimpl<let N: u32> Writer<N> {\n    pub fn new() -> Self {\n        Self { data: [0; N], offset: 0 }\n    }\n\n    pub fn write(&mut self, value: Field) {\n        self.data[self.offset] = value;\n        self.offset += 1;\n    }\n\n    pub fn write_u32(&mut self, value: u32) {\n        self.write(value as Field);\n    }\n\n    pub fn write_u64(&mut self, value: u64) {\n        self.write(value as Field);\n    }\n\n    pub fn write_bool(&mut self, value: bool) {\n        self.write(value as Field);\n    }\n\n    pub fn write_array<let K: u32>(&mut self, value: [Field; K]) {\n        for i in 0..K {\n            self.data[i + self.offset] = value[i];\n        }\n        self.offset += K;\n    }\n\n    pub fn write_struct<T, let K: u32>(&mut self, value: T, serialize: fn(T) -> [Field; K]) {\n        self.write_array(serialize(value));\n    }\n\n    pub fn write_struct_array<T, let K: u32, let C: u32>(\n        &mut self,\n        value: [T; C],\n        serialize: fn(T) -> [Field; K],\n    ) {\n        for i in 0..C {\n            self.write_struct(value[i], serialize);\n        }\n    }\n\n    pub fn advance_offset(&mut self, offset: u32) {\n        self.offset += offset;\n    }\n\n    pub fn finish(self) -> [Field; N] {\n        assert_eq(self.offset, self.data.len(), \"Writer did not write all data\");\n        self.data\n    }\n}\n"
     },
@@ -4444,17 +4266,13 @@
       "path": "std/option.nr",
       "source": "use crate::cmp::{Eq, Ord, Ordering};\nuse crate::default::Default;\nuse crate::hash::{Hash, Hasher};\n\npub struct Option<T> {\n    _is_some: bool,\n    _value: T,\n}\n\nimpl<T> Option<T> {\n    /// Constructs a None value\n    pub fn none() -> Self {\n        Self { _is_some: false, _value: crate::mem::zeroed() }\n    }\n\n    /// Constructs a Some wrapper around the given value\n    pub fn some(_value: T) -> Self {\n        Self { _is_some: true, _value }\n    }\n\n    /// True if this Option is None\n    pub fn is_none(self) -> bool {\n        !self._is_some\n    }\n\n    /// True if this Option is Some\n    pub fn is_some(self) -> bool {\n        self._is_some\n    }\n\n    /// Asserts `self.is_some()` and returns the wrapped value.\n    pub fn unwrap(self) -> T {\n        assert(self._is_some);\n        self._value\n    }\n\n    /// Returns the inner value without asserting `self.is_some()`\n    /// Note that if `self` is `None`, there is no guarantee what value will be returned,\n    /// only that it will be of type `T`.\n    pub fn unwrap_unchecked(self) -> T {\n        self._value\n    }\n\n    /// Returns the wrapped value if `self.is_some()`. Otherwise, returns the given default value.\n    pub fn unwrap_or(self, default: T) -> T {\n        if self._is_some {\n            self._value\n        } else {\n            default\n        }\n    }\n\n    /// Returns the wrapped value if `self.is_some()`. Otherwise, calls the given function to return\n    /// a default value.\n    pub fn unwrap_or_else<Env>(self, default: fn[Env]() -> T) -> T {\n        if self._is_some {\n            self._value\n        } else {\n            default()\n        }\n    }\n\n    /// Asserts `self.is_some()` with a provided custom message and returns the contained `Some` value\n    pub fn expect<let N: u32, MessageTypes>(self, message: fmtstr<N, MessageTypes>) -> T {\n        assert(self.is_some(), message);\n        self._value\n    }\n\n    /// If self is `Some(x)`, this returns `Some(f(x))`. Otherwise, this returns `None`.\n    pub fn map<U, Env>(self, f: fn[Env](T) -> U) -> Option<U> {\n        if self._is_some {\n            Option::some(f(self._value))\n        } else {\n            Option::none()\n        }\n    }\n\n    /// If self is `Some(x)`, this returns `f(x)`. Otherwise, this returns the given default value.\n    pub fn map_or<U, Env>(self, default: U, f: fn[Env](T) -> U) -> U {\n        if self._is_some {\n            f(self._value)\n        } else {\n            default\n        }\n    }\n\n    /// If self is `Some(x)`, this returns `f(x)`. Otherwise, this returns `default()`.\n    pub fn map_or_else<U, Env1, Env2>(self, default: fn[Env1]() -> U, f: fn[Env2](T) -> U) -> U {\n        if self._is_some {\n            f(self._value)\n        } else {\n            default()\n        }\n    }\n\n    /// Returns None if self is None. Otherwise, this returns `other`.\n    pub fn and(self, other: Self) -> Self {\n        if self.is_none() {\n            Option::none()\n        } else {\n            other\n        }\n    }\n\n    /// If self is None, this returns None. Otherwise, this calls the given function\n    /// with the Some value contained within self, and returns the result of that call.\n    ///\n    /// In some languages this function is called `flat_map` or `bind`.\n    pub fn and_then<U, Env>(self, f: fn[Env](T) -> Option<U>) -> Option<U> {\n        if self._is_some {\n            f(self._value)\n        } else {\n            Option::none()\n        }\n    }\n\n    /// If self is Some, return self. Otherwise, return `other`.\n    pub fn or(self, other: Self) -> Self {\n        if self._is_some {\n            self\n        } else {\n            other\n        }\n    }\n\n    /// If self is Some, return self. Otherwise, return `default()`.\n    pub fn or_else<Env>(self, default: fn[Env]() -> Self) -> Self {\n        if self._is_some {\n            self\n        } else {\n            default()\n        }\n    }\n\n    // If only one of the two Options is Some, return that option.\n    // Otherwise, if both options are Some or both are None, None is returned.\n    pub fn xor(self, other: Self) -> Self {\n        if self._is_some {\n            if other._is_some {\n                Option::none()\n            } else {\n                self\n            }\n        } else if other._is_some {\n            other\n        } else {\n            Option::none()\n        }\n    }\n\n    /// Returns `Some(x)` if self is `Some(x)` and `predicate(x)` is true.\n    /// Otherwise, this returns `None`\n    pub fn filter<Env>(self, predicate: fn[Env](T) -> bool) -> Self {\n        if self._is_some {\n            if predicate(self._value) {\n                self\n            } else {\n                Option::none()\n            }\n        } else {\n            Option::none()\n        }\n    }\n\n    /// Flattens an Option<Option<T>> into a Option<T>.\n    /// This returns None if the outer Option is None. Otherwise, this returns the inner Option.\n    pub fn flatten(option: Option<Option<T>>) -> Option<T> {\n        if option._is_some {\n            option._value\n        } else {\n            Option::none()\n        }\n    }\n}\n\nimpl<T> Default for Option<T> {\n    fn default() -> Self {\n        Option::none()\n    }\n}\n\nimpl<T> Eq for Option<T>\nwhere\n    T: Eq,\n{\n    fn eq(self, other: Self) -> bool {\n        if self._is_some == other._is_some {\n            if self._is_some {\n                self._value == other._value\n            } else {\n                true\n            }\n        } else {\n            false\n        }\n    }\n}\n\nimpl<T> Hash for Option<T>\nwhere\n    T: Hash,\n{\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        self._is_some.hash(state);\n        if self._is_some {\n            self._value.hash(state);\n        }\n    }\n}\n\n// For this impl we're declaring Option::none < Option::some\nimpl<T> Ord for Option<T>\nwhere\n    T: Ord,\n{\n    fn cmp(self, other: Self) -> Ordering {\n        if self._is_some {\n            if other._is_some {\n                self._value.cmp(other._value)\n            } else {\n                Ordering::greater()\n            }\n        } else if other._is_some {\n            Ordering::less()\n        } else {\n            Ordering::equal()\n        }\n    }\n}\n"
     },
-    "43": {
-      "path": "std/panic.nr",
-      "source": "pub fn panic<T, U>(message: T) -> U\nwhere\n    T: StringLike,\n{\n    assert(false, message);\n    crate::mem::zeroed()\n}\n\ntrait StringLike {}\n\nimpl<let N: u32> StringLike for str<N> {}\nimpl<let N: u32, T> StringLike for fmtstr<N, T> {}\n"
-    },
     "51": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-contracts/contracts/account/simulated_account_contract/src/main.nr",
       "source": "use aztec::macros::aztec;\n\n// Account contract that does not perform any authentication, typically used to override a *real* account contract\n// in a simulation. This avoids the need of generating real signatures during simulation.\n// It will also consider all authwits sent to it as valid and emit the hash in an offchain effect\n// for later verification. In order to properly mimic our account contract it imports the PublickKeyNote\n// struct so the #[aztec] macro can generate a `sync_state` implementation that can process the *real*\n// public key of the overridden contract\n#[aztec]\npub contract SimulatedAccount {\n    use aztec::{\n        authwit::{account::AccountActions, auth::IS_VALID_SELECTOR, entrypoint::app::AppPayload},\n        context::PrivateContext,\n        macros::functions::{allow_phase_change, external, view},\n        oracle::notes::set_sender_for_tags,\n    };\n\n    // @dev: If you globally change the entrypoint signature don't forget to update account_entrypoint.ts (specifically `getEntrypointAbi()`)\n    #[external(\"private\")]\n    #[allow_phase_change]\n    fn entrypoint(app_payload: AppPayload, fee_payment_method: u8, cancellable: bool) {\n        // Safety: The sender for tags is only used to compute unconstrained shared secrets for emitting logs.\n        // Since this value is only used for unconstrained tagging and not for any constrained logic,\n        // it is safe to set from a constrained context.\n        unsafe { set_sender_for_tags(self.address) };\n\n        let actions = AccountActions::init(self.context, is_valid_impl);\n        actions.entrypoint(app_payload, fee_payment_method, cancellable);\n    }\n\n    #[external(\"private\")]\n    #[view]\n    fn verify_private_authwit(inner_hash: Field) -> Field {\n        IS_VALID_SELECTOR\n    }\n\n    #[contract_library_method]\n    fn is_valid_impl(_context: &mut PrivateContext, _outer_hash: Field) -> bool {\n        true\n    }\n\n    // This contract override exists solely to enable simulation without requiring users to sign anything. Therefore,\n    // this function should never be called - this contract should never be used to sync the state of the original\n    // contract! Doing so could result in an undefined behavior.\n    #[external(\"utility\")]\n    unconstrained fn sync_state() {\n        assert(\n            false,\n            \"BUG ALERT: sync_state on a simulated account contract should never be triggered.\",\n        );\n    }\n}\n"
     },
     "52": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/authwit/account.nr",
-      "source": "use crate::context::PrivateContext;\n\nuse crate::protocol::{constants::DOM_SEP__TX_NULLIFIER, hash::poseidon2_hash_with_separator, traits::Hash};\n\nuse crate::authwit::auth::{compute_authwit_message_hash, IS_VALID_SELECTOR};\nuse crate::authwit::entrypoint::app::AppPayload;\n\npub struct AccountActions<Context> {\n    context: Context,\n    is_valid_impl: fn(&mut PrivateContext, Field) -> bool,\n}\n\nimpl<Context> AccountActions<Context> {\n    pub fn init(context: Context, is_valid_impl: fn(&mut PrivateContext, Field) -> bool) -> Self {\n        AccountActions { context, is_valid_impl }\n    }\n}\n\n// See AccountFeePaymentMethodOptions enum in Aztec.js for docs:\n//\n//\n// https://github.com/AztecProtocol/aztec-packages/blob/next/yarn-project/entrypoints/src/account_entrypoint.ts\npub struct AccountFeePaymentMethodOptionsEnum {\n    pub EXTERNAL: u8,\n    pub PREEXISTING_FEE_JUICE: u8,\n    pub FEE_JUICE_WITH_CLAIM: u8,\n}\n\npub global AccountFeePaymentMethodOptions: AccountFeePaymentMethodOptionsEnum =\n    AccountFeePaymentMethodOptionsEnum { EXTERNAL: 0, PREEXISTING_FEE_JUICE: 1, FEE_JUICE_WITH_CLAIM: 2 };\n\n/// An implementation of the Account Action struct for the private context.\n///\n/// Implements logic to verify authorization and execute payloads.\nimpl AccountActions<&mut PrivateContext> {\n\n    /// Verifies that the `app_hash` is authorized and executes the `app_payload`.\n    ///\n    /// @param app_payload The payload that contains the calls to be executed in the app phase.\n    ///\n    /// @param fee_payment_method The mechanism via which the account contract will pay for the transaction:\n    /// - EXTERNAL (0): Signals that some other contract is in charge of paying the fee, nothing needs to be done.\n    /// - PREEXISTING_FEE_JUICE (1): Makes the account contract publicly pay for the transaction with its own FeeJuice\n    /// balance, which it must already have prior to this transaction. The contract will set itself as the fee payer\n    /// and end the setup phase.\n    /// - FEE_JUICE_WITH_CLAIM (2): Makes the account contract publicly pay for the transaction with its own FeeJuice\n    /// balance which is being claimed in the same transaction. The contract will set itself as the fee payer but not\n    /// end setup phase - this is done by the FeeJuice contract after enqueuing a public call, which unlike most public\n    /// calls is whitelisted to be executable during setup.\n    ///\n    /// @param cancellable Controls whether to emit app_payload.tx_nonce as a nullifier, allowing a subsequent\n    /// transaction to be sent with a higher priority fee. This can be used to cancel the first transaction sent,\n    /// assuming it hasn't been mined yet.\n    ///\n    // docs:start:entrypoint\n    pub fn entrypoint(self, app_payload: AppPayload, fee_payment_method: u8, cancellable: bool) {\n        let valid_fn = self.is_valid_impl;\n\n        assert(valid_fn(self.context, app_payload.hash()));\n\n        if fee_payment_method == AccountFeePaymentMethodOptions.PREEXISTING_FEE_JUICE {\n            self.context.set_as_fee_payer();\n            self.context.end_setup();\n        }\n        if fee_payment_method == AccountFeePaymentMethodOptions.FEE_JUICE_WITH_CLAIM {\n            self.context.set_as_fee_payer();\n        }\n        app_payload.execute_calls(self.context);\n\n        if cancellable {\n            let tx_nullifier = poseidon2_hash_with_separator([app_payload.tx_nonce], DOM_SEP__TX_NULLIFIER);\n            self.context.push_nullifier(tx_nullifier);\n        }\n    }\n\n    /// Verifies that the `msg_sender` is authorized to consume `inner_hash` by the account.\n    ///\n    /// Computes the `message_hash` using the `msg_sender`, `chain_id`, `version` and `inner_hash`. Then executes the\n    /// `is_valid_impl` function to verify that the message is authorized.\n    ///\n    /// Will revert if the message is not authorized.\n    ///\n    /// @param inner_hash The hash of the message that the `msg_sender` is trying to consume.\n    pub fn verify_private_authwit(self, inner_hash: Field) -> Field {\n        // The `inner_hash` is \"siloed\" with the `msg_sender` to ensure that only it can consume the message. This\n        // ensures that contracts cannot consume messages that are not intended for them.\n        let message_hash = compute_authwit_message_hash(\n            self.context.maybe_msg_sender().unwrap(),\n            self.context.chain_id(),\n            self.context.version(),\n            inner_hash,\n        );\n        let valid_fn = self.is_valid_impl;\n        assert(valid_fn(self.context, message_hash), \"Message not authorized by account\");\n        IS_VALID_SELECTOR\n    }\n}\n"
+      "source": "use crate::context::PrivateContext;\n\nuse crate::protocol::{constants::DOM_SEP__TX_NULLIFIER, hash::poseidon2_hash_with_separator, traits::Hash};\n\nuse crate::authwit::auth::{compute_authwit_message_hash, IS_VALID_SELECTOR};\nuse crate::authwit::entrypoint::app::AppPayload;\n\npub struct AccountActions<Context> {\n    context: Context,\n    is_valid_impl: fn(&mut PrivateContext, Field) -> bool,\n}\n\nimpl<Context> AccountActions<Context> {\n    pub fn init(context: Context, is_valid_impl: fn(&mut PrivateContext, Field) -> bool) -> Self {\n        AccountActions { context, is_valid_impl }\n    }\n}\n\n// See AccountFeePaymentMethodOptions enum in Aztec.js for docs:\n//\n//\n// https://github.com/AztecProtocol/aztec-packages/blob/next/yarn-project/entrypoints/src/account_entrypoint.ts\npub struct AccountFeePaymentMethodOptionsEnum {\n    pub EXTERNAL: u8,\n    pub PREEXISTING_FEE_JUICE: u8,\n    pub FEE_JUICE_WITH_CLAIM: u8,\n}\n\npub global AccountFeePaymentMethodOptions: AccountFeePaymentMethodOptionsEnum =\n    AccountFeePaymentMethodOptionsEnum { EXTERNAL: 0, PREEXISTING_FEE_JUICE: 1, FEE_JUICE_WITH_CLAIM: 2 };\n\n/// An implementation of the Account Action struct for the private context.\n///\n/// Implements logic to verify authorization and execute payloads.\nimpl AccountActions<&mut PrivateContext> {\n\n    /// Verifies that the `app_hash` is authorized and executes the `app_payload`.\n    ///\n    /// @param app_payload The payload that contains the calls to be executed in the app phase.\n    ///\n    /// @param fee_payment_method The mechanism via which the account contract will pay for the transaction:\n    /// - EXTERNAL (0): Signals that some other contract is in charge of paying the fee, nothing needs to be done.\n    /// - PREEXISTING_FEE_JUICE (1): Makes the account contract publicly pay for the transaction with its own FeeJuice\n    /// balance, which it must already have prior to this transaction. The contract will set itself as the fee payer\n    /// and end the setup phase.\n    /// - FEE_JUICE_WITH_CLAIM (2): Makes the account contract publicly pay for the transaction with its own FeeJuice\n    /// balance which is being claimed in the same transaction. The contract will set itself as the fee payer but not\n    /// end setup phase - this is done by the FeeJuice contract after enqueuing a public call, which unlike most public\n    /// calls is whitelisted to be executable during setup.\n    ///\n    /// @param cancellable Controls whether to emit app_payload.tx_nonce as a nullifier, allowing a subsequent\n    /// transaction to be sent with a higher priority fee. This can be used to cancel the first transaction sent,\n    /// assuming it hasn't been mined yet.\n    ///\n    // docs:start:entrypoint\n    pub fn entrypoint(self, app_payload: AppPayload, fee_payment_method: u8, cancellable: bool) {\n        let valid_fn = self.is_valid_impl;\n\n        let message_hash = compute_authwit_message_hash(\n            self.context.this_address(),\n            self.context.chain_id(),\n            self.context.version(),\n            app_payload.hash(),\n        );\n        assert(valid_fn(self.context, message_hash));\n\n        if fee_payment_method == AccountFeePaymentMethodOptions.PREEXISTING_FEE_JUICE {\n            self.context.set_as_fee_payer();\n            self.context.end_setup();\n        }\n        if fee_payment_method == AccountFeePaymentMethodOptions.FEE_JUICE_WITH_CLAIM {\n            self.context.set_as_fee_payer();\n        }\n        app_payload.execute_calls(self.context);\n\n        if cancellable {\n            let tx_nullifier = poseidon2_hash_with_separator([app_payload.tx_nonce], DOM_SEP__TX_NULLIFIER);\n            self.context.push_nullifier(tx_nullifier);\n        }\n    }\n\n    /// Verifies that the `msg_sender` is authorized to consume `inner_hash` by the account.\n    ///\n    /// Computes the `message_hash` using the `msg_sender`, `chain_id`, `version` and `inner_hash`. Then executes the\n    /// `is_valid_impl` function to verify that the message is authorized.\n    ///\n    /// Will revert if the message is not authorized.\n    ///\n    /// @param inner_hash The hash of the message that the `msg_sender` is trying to consume.\n    pub fn verify_private_authwit(self, inner_hash: Field) -> Field {\n        // The `inner_hash` is \"siloed\" with the `msg_sender` to ensure that only it can consume the message. This\n        // ensures that contracts cannot consume messages that are not intended for them.\n        let message_hash = compute_authwit_message_hash(\n            self.context.maybe_msg_sender().unwrap(),\n            self.context.chain_id(),\n            self.context.version(),\n            inner_hash,\n        );\n        let valid_fn = self.is_valid_impl;\n        assert(valid_fn(self.context, message_hash), \"Message not authorized by account\");\n        IS_VALID_SELECTOR\n    }\n}\n"
     },
     "56": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/authwit/entrypoint/app.nr",
@@ -4466,31 +4284,23 @@
     },
     "60": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/capsules/mod.nr",
-      "source": "use crate::oracle::capsules;\nuse crate::protocol::{address::AztecAddress, traits::{Deserialize, Serialize}};\n\n/// A dynamically sized array backed by PXE's non-volatile database (called capsules). Values are persisted until\n/// deleted, so they can be e.g. stored during simulation of a transaction and later retrieved during witness\n/// generation. All values are scoped per contract address, so external contracts cannot access them.\npub struct CapsuleArray<T> {\n    contract_address: AztecAddress,\n    /// The base slot is where the array length is stored in capsules. Array elements are stored in consecutive slots\n    /// after the base slot. For example, with base slot 5: the length is at slot 5, the first element (index 0) is at\n    /// slot 6, the second element (index 1) is at slot 7, and so on.\n    base_slot: Field,\n}\n\nimpl<T> CapsuleArray<T> {\n    /// Returns a CapsuleArray connected to a contract's capsules at a base slot. Array elements are stored in\n    /// contiguous slots following the base slot, so there should be sufficient space between array base slots to\n    /// accommodate elements. A reasonable strategy is to make the base slot a hash of a unique value.\n    pub unconstrained fn at(contract_address: AztecAddress, base_slot: Field) -> Self {\n        Self { contract_address, base_slot }\n    }\n\n    /// Returns the number of elements stored in the array.\n    pub unconstrained fn len(self) -> u32 {\n        // An uninitialized array defaults to a length of 0.\n        capsules::load(self.contract_address, self.base_slot).unwrap_or(0) as u32\n    }\n\n    /// Stores a value at the end of the array.\n    pub unconstrained fn push(self, value: T)\n    where\n        T: Serialize,\n    {\n        let current_length = self.len();\n\n        // The slot corresponding to the index `current_length` is the first slot immediately after the end of the\n        // array, which is where we want to place the new value.\n        capsules::store(self.contract_address, self.slot_at(current_length), value);\n\n        // Then we simply update the length.\n        let new_length = current_length + 1;\n        capsules::store(self.contract_address, self.base_slot, new_length);\n    }\n\n    /// Retrieves the value stored in the array at `index`. Throws if the index is out of bounds.\n    pub unconstrained fn get(self, index: u32) -> T\n    where\n        T: Deserialize,\n    {\n        assert(index < self.len(), \"Attempted to read past the length of a CapsuleArray\");\n\n        capsules::load(self.contract_address, self.slot_at(index)).unwrap()\n    }\n\n    /// Deletes the value stored in the array at `index`. Throws if the index is out of bounds.\n    pub unconstrained fn remove(self, index: u32) {\n        let current_length = self.len();\n        assert(index < current_length, \"Attempted to delete past the length of a CapsuleArray\");\n\n        // In order to be able to remove elements at arbitrary indices, we need to shift the entire contents of the\n        // array past the removed element one slot backward so that we don't end up with a gap and preserve the\n        // contiguous slots. We can skip this when deleting the last element however.\n        if index != current_length - 1 {\n            // The source and destination regions overlap, but `copy` supports this.\n            capsules::copy(\n                self.contract_address,\n                self.slot_at(index + 1),\n                self.slot_at(index),\n                current_length - index - 1,\n            );\n        }\n\n        // We can now delete the last element (which has either been copied to the slot immediately before it, or was\n        // the element we meant to delete in the first place) and update the length.\n        capsules::delete(self.contract_address, self.slot_at(current_length - 1));\n        capsules::store(self.contract_address, self.base_slot, current_length - 1);\n    }\n\n    /// Iterates over the entire array, calling the callback with all values and their array index. The order in which\n    /// values are processed is arbitrary.\n    ///\n    /// It is safe to delete the current element (and only the current element) from inside the callback via `remove`:\n    /// ```noir\n    /// array.for_each(|index, value| {\n    ///   if some_condition(value) {\n    ///     array.remove(index); // safe only for this index\n    ///   }\n    /// }\n    /// ```\n    ///\n    /// If all elements in the array need to iterated over and then removed, then using `for_each` results in optimal\n    /// efficiency.\n    ///\n    /// It is **not** safe to push new elements into the array from inside the callback.\n    pub unconstrained fn for_each<Env>(self, f: unconstrained fn[Env](u32, T) -> ())\n    where\n        T: Deserialize,\n    {\n        // Iterating over all elements is simple, but we want to do it in such a way that a) deleting the current\n        // element is safe to do, and b) deleting *all* elements is optimally efficient. This is because CapsuleArrays\n        // are typically used to hold pending tasks, so iterating them while clearing completed tasks (sometimes\n        // unconditionally, resulting in a full clear) is a very common access pattern.\n        //\n        // The way we achieve this is by iterating backwards: each element can always be deleted since it won't change\n        // any preceding (lower) indices, and if every element is deleted then every element will (in turn) be the last\n        // element. This results in an optimal full clear since `remove` will be able to skip the `capsules::copy` call\n        // to shift any elements past the deleted one (because there will be none).\n        let mut i = self.len();\n        while i > 0 {\n            i -= 1;\n            f(i, self.get(i));\n        }\n    }\n\n    unconstrained fn slot_at(self, index: u32) -> Field {\n        // Elements are stored immediately after the base slot, so we add 1 to it to compute the slot for the first\n        // element.\n        self.base_slot + 1 + index as Field\n    }\n}\n\nmod test {\n    use crate::test::helpers::test_environment::TestEnvironment;\n    use super::CapsuleArray;\n\n    global SLOT: Field = 1230;\n\n    #[test]\n    unconstrained fn empty_array() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let array: CapsuleArray<Field> = CapsuleArray::at(contract_address, SLOT);\n            assert_eq(array.len(), 0);\n        });\n    }\n\n    #[test(should_fail_with = \"Attempted to read past the length of a CapsuleArray\")]\n    unconstrained fn empty_array_read() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let array = CapsuleArray::at(contract_address, SLOT);\n            let _: Field = array.get(0);\n        });\n    }\n\n    #[test]\n    unconstrained fn array_push() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let array = CapsuleArray::at(contract_address, SLOT);\n            array.push(5);\n\n            assert_eq(array.len(), 1);\n            assert_eq(array.get(0), 5);\n        });\n    }\n\n    #[test(should_fail_with = \"Attempted to read past the length of a CapsuleArray\")]\n    unconstrained fn read_past_len() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let array = CapsuleArray::at(contract_address, SLOT);\n            array.push(5);\n\n            let _ = array.get(1);\n        });\n    }\n\n    #[test]\n    unconstrained fn array_remove_last() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let array = CapsuleArray::at(contract_address, SLOT);\n\n            array.push(5);\n            array.remove(0);\n\n            assert_eq(array.len(), 0);\n        });\n    }\n\n    #[test]\n    unconstrained fn array_remove_some() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let array = CapsuleArray::at(contract_address, SLOT);\n\n            array.push(7);\n            array.push(8);\n            array.push(9);\n\n            assert_eq(array.len(), 3);\n            assert_eq(array.get(0), 7);\n            assert_eq(array.get(1), 8);\n            assert_eq(array.get(2), 9);\n\n            array.remove(1);\n\n            assert_eq(array.len(), 2);\n            assert_eq(array.get(0), 7);\n            assert_eq(array.get(1), 9);\n        });\n    }\n\n    #[test]\n    unconstrained fn array_remove_all() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let array = CapsuleArray::at(contract_address, SLOT);\n\n            array.push(7);\n            array.push(8);\n            array.push(9);\n\n            array.remove(1);\n            array.remove(1);\n            array.remove(0);\n\n            assert_eq(array.len(), 0);\n        });\n    }\n\n    #[test]\n    unconstrained fn for_each_called_with_all_elements() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let array = CapsuleArray::at(contract_address, SLOT);\n\n            array.push(4);\n            array.push(5);\n            array.push(6);\n\n            // We store all values that we were called with and check that all (value, index) tuples are present. Note\n            // that we do not care about the order in which each tuple was passed to the closure.\n            let called_with = &mut BoundedVec::<(u32, Field), 3>::new();\n            array.for_each(|index, value| { called_with.push((index, value)); });\n\n            assert_eq(called_with.len(), 3);\n            assert(called_with.any(|(index, value)| (index == 0) & (value == 4)));\n            assert(called_with.any(|(index, value)| (index == 1) & (value == 5)));\n            assert(called_with.any(|(index, value)| (index == 2) & (value == 6)));\n        });\n    }\n\n    #[test]\n    unconstrained fn for_each_remove_some() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let array = CapsuleArray::at(contract_address, SLOT);\n\n            array.push(4);\n            array.push(5);\n            array.push(6);\n\n            array.for_each(|index, _| {\n                if index == 1 {\n                    array.remove(index);\n                }\n            });\n\n            assert_eq(array.len(), 2);\n            assert_eq(array.get(0), 4);\n            assert_eq(array.get(1), 6);\n        });\n    }\n\n    #[test]\n    unconstrained fn for_each_remove_all() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let array = CapsuleArray::at(contract_address, SLOT);\n\n            array.push(4);\n            array.push(5);\n            array.push(6);\n\n            array.for_each(|index, _| { array.remove(index); });\n\n            assert_eq(array.len(), 0);\n        });\n    }\n\n    #[test]\n    unconstrained fn for_each_remove_all_no_copy() {\n        let env = TestEnvironment::new();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let array = CapsuleArray::at(contract_address, SLOT);\n\n            array.push(4);\n            array.push(5);\n            array.push(6);\n\n            // We test that the utilityCopyCapsule was never called, which is the expensive operation we want to avoid.\n            let mock = std::test::OracleMock::mock(\"utilityCopyCapsule\");\n\n            array.for_each(|index, _| { array.remove(index); });\n\n            assert_eq(mock.times_called(), 0);\n        });\n    }\n}\n"
+      "source": "use crate::oracle::capsules;\nuse crate::protocol::{address::AztecAddress, traits::{Deserialize, Serialize}};\n\n/// A dynamically sized array backed by PXE's non-volatile database (called capsules). Values are persisted until\n/// deleted, so they can be e.g. stored during simulation of a transaction and later retrieved during witness\n/// generation. All values are scoped per contract address, so external contracts cannot access them.\npub struct CapsuleArray<T> {\n    contract_address: AztecAddress,\n    /// The base slot is where the array length is stored in capsules. Array elements are stored in consecutive slots\n    /// after the base slot. For example, with base slot 5: the length is at slot 5, the first element (index 0) is at\n    /// slot 6, the second element (index 1) is at slot 7, and so on.\n    base_slot: Field,\n    /// Scope for capsule isolation. Capsule operations are scoped to the given address, allowing multiple independent\n    /// namespaces within the same contract.\n    scope: AztecAddress,\n}\n\nimpl<T> CapsuleArray<T> {\n    /// Returns a CapsuleArray scoped to a specific address.\n    ///\n    /// Array elements are stored in contiguous slots\n    /// following the base slot, so there should be sufficient space between array base slots to accommodate elements.\n    /// A reasonable strategy is to make the base slot a hash of a unique value.\n    pub unconstrained fn at(contract_address: AztecAddress, base_slot: Field, scope: AztecAddress) -> Self {\n        Self { contract_address, base_slot, scope }\n    }\n\n    /// Returns the number of elements stored in the array.\n    pub unconstrained fn len(self) -> u32 {\n        // An uninitialized array defaults to a length of 0.\n        capsules::load(self.contract_address, self.base_slot, self.scope).unwrap_or(0) as u32\n    }\n\n    /// Stores a value at the end of the array.\n    pub unconstrained fn push(self, value: T)\n    where\n        T: Serialize,\n    {\n        let current_length = self.len();\n\n        // The slot corresponding to the index `current_length` is the first slot immediately after the end of the\n        // array, which is where we want to place the new value.\n        capsules::store(\n            self.contract_address,\n            self.slot_at(current_length),\n            value,\n            self.scope,\n        );\n\n        // Then we simply update the length.\n        let new_length = current_length + 1;\n        capsules::store(\n            self.contract_address,\n            self.base_slot,\n            new_length,\n            self.scope,\n        );\n    }\n\n    /// Retrieves the value stored in the array at `index`. Throws if the index is out of bounds.\n    pub unconstrained fn get(self, index: u32) -> T\n    where\n        T: Deserialize,\n    {\n        assert(index < self.len(), \"Attempted to read past the length of a CapsuleArray\");\n\n        capsules::load(self.contract_address, self.slot_at(index), self.scope).unwrap()\n    }\n\n    /// Deletes the value stored in the array at `index`. Throws if the index is out of bounds.\n    pub unconstrained fn remove(self, index: u32) {\n        let current_length = self.len();\n        assert(index < current_length, \"Attempted to delete past the length of a CapsuleArray\");\n\n        // In order to be able to remove elements at arbitrary indices, we need to shift the entire contents of the\n        // array past the removed element one slot backward so that we don't end up with a gap and preserve the\n        // contiguous slots. We can skip this when deleting the last element however.\n        if index != current_length - 1 {\n            // The source and destination regions overlap, but `copy` supports this.\n            capsules::copy(\n                self.contract_address,\n                self.slot_at(index + 1),\n                self.slot_at(index),\n                current_length - index - 1,\n                self.scope,\n            );\n        }\n\n        // We can now delete the last element (which has either been copied to the slot immediately before it, or was\n        // the element we meant to delete in the first place) and update the length.\n        capsules::delete(\n            self.contract_address,\n            self.slot_at(current_length - 1),\n            self.scope,\n        );\n        capsules::store(\n            self.contract_address,\n            self.base_slot,\n            current_length - 1,\n            self.scope,\n        );\n    }\n\n    /// Calls a function on each element of the array.\n    ///\n    /// The function `f` is called once with each array value and its corresponding index. The order in which values\n    /// are processed is arbitrary.\n    ///\n    /// ## Array Mutation\n    ///\n    /// It is safe to delete the current element (and only the current element) from inside the callback via `remove`:\n    /// ```noir\n    /// array.for_each(|index, value| {\n    ///   if some_condition(value) {\n    ///     array.remove(index); // safe only for this index\n    ///   }\n    /// }\n    /// ```\n    ///\n    /// If all elements in the array need to iterated over and then removed, then using `for_each` results in optimal\n    /// efficiency.\n    ///\n    /// It is **not** safe to push new elements into the array from inside the callback.\n    pub unconstrained fn for_each<Env>(self, f: unconstrained fn[Env](u32, T) -> ())\n    where\n        T: Deserialize,\n    {\n        // Iterating over all elements is simple, but we want to do it in such a way that a) deleting the current\n        // element is safe to do, and b) deleting *all* elements is optimally efficient. This is because CapsuleArrays\n        // are typically used to hold pending tasks, so iterating them while clearing completed tasks (sometimes\n        // unconditionally, resulting in a full clear) is a very common access pattern.\n        //\n        // The way we achieve this is by iterating backwards: each element can always be deleted since it won't change\n        // any preceding (lower) indices, and if every element is deleted then every element will (in turn) be the last\n        // element. This results in an optimal full clear since `remove` will be able to skip the `capsules::copy` call\n        // to shift any elements past the deleted one (because there will be none).\n        let mut i = self.len();\n        while i > 0 {\n            i -= 1;\n            f(i, self.get(i));\n        }\n    }\n\n    unconstrained fn slot_at(self, index: u32) -> Field {\n        // Elements are stored immediately after the base slot, so we add 1 to it to compute the slot for the first\n        // element.\n        self.base_slot + 1 + index as Field\n    }\n}\n\nmod test {\n    use crate::test::helpers::test_environment::TestEnvironment;\n    use super::CapsuleArray;\n\n    global SLOT: Field = 1230;\n\n    #[test]\n    unconstrained fn empty_array() {\n        let mut env = TestEnvironment::new();\n        let scope = env.create_light_account();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let array: CapsuleArray<Field> = CapsuleArray::at(contract_address, SLOT, scope);\n            assert_eq(array.len(), 0);\n        });\n    }\n\n    #[test(should_fail_with = \"Attempted to read past the length of a CapsuleArray\")]\n    unconstrained fn empty_array_read() {\n        let mut env = TestEnvironment::new();\n        let scope = env.create_light_account();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let array = CapsuleArray::at(contract_address, SLOT, scope);\n            let _: Field = array.get(0);\n        });\n    }\n\n    #[test]\n    unconstrained fn array_push() {\n        let mut env = TestEnvironment::new();\n        let scope = env.create_light_account();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let array = CapsuleArray::at(contract_address, SLOT, scope);\n            array.push(5);\n\n            assert_eq(array.len(), 1);\n            assert_eq(array.get(0), 5);\n        });\n    }\n\n    #[test(should_fail_with = \"Attempted to read past the length of a CapsuleArray\")]\n    unconstrained fn read_past_len() {\n        let mut env = TestEnvironment::new();\n        let scope = env.create_light_account();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let array = CapsuleArray::at(contract_address, SLOT, scope);\n            array.push(5);\n\n            let _ = array.get(1);\n        });\n    }\n\n    #[test]\n    unconstrained fn array_remove_last() {\n        let mut env = TestEnvironment::new();\n        let scope = env.create_light_account();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let array = CapsuleArray::at(contract_address, SLOT, scope);\n\n            array.push(5);\n            array.remove(0);\n\n            assert_eq(array.len(), 0);\n        });\n    }\n\n    #[test]\n    unconstrained fn array_remove_some() {\n        let mut env = TestEnvironment::new();\n        let scope = env.create_light_account();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let array = CapsuleArray::at(contract_address, SLOT, scope);\n\n            array.push(7);\n            array.push(8);\n            array.push(9);\n\n            assert_eq(array.len(), 3);\n            assert_eq(array.get(0), 7);\n            assert_eq(array.get(1), 8);\n            assert_eq(array.get(2), 9);\n\n            array.remove(1);\n\n            assert_eq(array.len(), 2);\n            assert_eq(array.get(0), 7);\n            assert_eq(array.get(1), 9);\n        });\n    }\n\n    #[test]\n    unconstrained fn array_remove_all() {\n        let mut env = TestEnvironment::new();\n        let scope = env.create_light_account();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let array = CapsuleArray::at(contract_address, SLOT, scope);\n\n            array.push(7);\n            array.push(8);\n            array.push(9);\n\n            array.remove(1);\n            array.remove(1);\n            array.remove(0);\n\n            assert_eq(array.len(), 0);\n        });\n    }\n\n    #[test]\n    unconstrained fn for_each_called_with_all_elements() {\n        let mut env = TestEnvironment::new();\n        let scope = env.create_light_account();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let array = CapsuleArray::at(contract_address, SLOT, scope);\n\n            array.push(4);\n            array.push(5);\n            array.push(6);\n\n            // We store all values that we were called with and check that all (value, index) tuples are present. Note\n            // that we do not care about the order in which each tuple was passed to the closure.\n            let called_with = &mut BoundedVec::<(u32, Field), 3>::new();\n            array.for_each(|index, value| { called_with.push((index, value)); });\n\n            assert_eq(called_with.len(), 3);\n            assert(called_with.any(|(index, value)| (index == 0) & (value == 4)));\n            assert(called_with.any(|(index, value)| (index == 1) & (value == 5)));\n            assert(called_with.any(|(index, value)| (index == 2) & (value == 6)));\n        });\n    }\n\n    #[test]\n    unconstrained fn for_each_remove_some() {\n        let mut env = TestEnvironment::new();\n        let scope = env.create_light_account();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let array = CapsuleArray::at(contract_address, SLOT, scope);\n\n            array.push(4);\n            array.push(5);\n            array.push(6);\n\n            array.for_each(|index, _| {\n                if index == 1 {\n                    array.remove(index);\n                }\n            });\n\n            assert_eq(array.len(), 2);\n            assert_eq(array.get(0), 4);\n            assert_eq(array.get(1), 6);\n        });\n    }\n\n    #[test]\n    unconstrained fn for_each_remove_all() {\n        let mut env = TestEnvironment::new();\n        let scope = env.create_light_account();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let array = CapsuleArray::at(contract_address, SLOT, scope);\n\n            array.push(4);\n            array.push(5);\n            array.push(6);\n\n            array.for_each(|index, _| { array.remove(index); });\n\n            assert_eq(array.len(), 0);\n        });\n    }\n\n    #[test]\n    unconstrained fn for_each_remove_all_no_copy() {\n        let mut env = TestEnvironment::new();\n        let scope = env.create_light_account();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let array = CapsuleArray::at(contract_address, SLOT, scope);\n\n            array.push(4);\n            array.push(5);\n            array.push(6);\n\n            // We test that the aztec_utl_copyCapsule was never called, which is the expensive operation we want to\n            // avoid.\n            let mock = std::test::OracleMock::mock(\"aztec_utl_copyCapsule\");\n\n            array.for_each(|index, _| { array.remove(index); });\n\n            assert_eq(mock.times_called(), 0);\n        });\n    }\n\n    #[test]\n    unconstrained fn different_scopes_are_isolated() {\n        let mut env = TestEnvironment::new();\n        let scope_a = env.create_light_account();\n        let scope_b = env.create_light_account();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let array_a = CapsuleArray::at(contract_address, SLOT, scope_a);\n            let array_b = CapsuleArray::at(contract_address, SLOT, scope_b);\n\n            array_a.push(10);\n            array_a.push(20);\n            array_b.push(99);\n\n            assert_eq(array_a.len(), 2);\n            assert_eq(array_a.get(0), 10);\n            assert_eq(array_a.get(1), 20);\n\n            assert_eq(array_b.len(), 1);\n            assert_eq(array_b.get(0), 99);\n        });\n    }\n}\n"
     },
     "70": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/private_context.nr",
-      "source": "use crate::{\n    context::{inputs::PrivateContextInputs, NoteExistenceRequest, NullifierExistenceRequest, ReturnsHash},\n    hash::{hash_args, hash_calldata_array},\n    keys::constants::{NULLIFIER_INDEX, NUM_KEY_TYPES, OUTGOING_INDEX, public_key_domain_separators},\n    messaging::process_l1_to_l2_message,\n    oracle::{\n        block_header::get_block_header_at,\n        call_private_function::call_private_function_internal,\n        enqueue_public_function_call::{\n            is_side_effect_counter_revertible_oracle_wrapper, notify_enqueued_public_function_call,\n            notify_set_min_revertible_side_effect_counter, notify_set_public_teardown_function_call,\n        },\n        execution_cache,\n        key_validation_request::get_key_validation_request,\n        logs::notify_created_contract_class_log,\n        notes::notify_nullified_note,\n        nullifiers::notify_created_nullifier,\n    },\n};\nuse crate::protocol::{\n    abis::{\n        block_header::BlockHeader,\n        call_context::CallContext,\n        function_selector::FunctionSelector,\n        gas_settings::GasSettings,\n        log_hash::LogHash,\n        note_hash::NoteHash,\n        nullifier::Nullifier,\n        private_call_request::PrivateCallRequest,\n        private_circuit_public_inputs::PrivateCircuitPublicInputs,\n        private_log::{PrivateLog, PrivateLogData},\n        public_call_request::PublicCallRequest,\n        validation_requests::{KeyValidationRequest, KeyValidationRequestAndSeparator},\n    },\n    address::{AztecAddress, EthAddress},\n    constants::{\n        CONTRACT_CLASS_LOG_SIZE_IN_FIELDS, MAX_CONTRACT_CLASS_LOGS_PER_CALL, MAX_ENQUEUED_CALLS_PER_CALL,\n        MAX_KEY_VALIDATION_REQUESTS_PER_CALL, MAX_L2_TO_L1_MSGS_PER_CALL, MAX_NOTE_HASH_READ_REQUESTS_PER_CALL,\n        MAX_NOTE_HASHES_PER_CALL, MAX_NULLIFIER_READ_REQUESTS_PER_CALL, MAX_NULLIFIERS_PER_CALL,\n        MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL, MAX_PRIVATE_LOGS_PER_CALL, MAX_TX_LIFETIME,\n        NULL_MSG_SENDER_CONTRACT_ADDRESS, PRIVATE_LOG_SIZE_IN_FIELDS,\n    },\n    hash::poseidon2_hash,\n    messaging::l2_to_l1_message::L2ToL1Message,\n    side_effect::{Counted, scoped::Scoped},\n    traits::{Empty, Hash, ToField},\n    utils::arrays::{ClaimedLengthArray, trimmed_array_length_hint},\n};\n\n/// # PrivateContext\n///\n/// The **main interface** between an #[external(\"private\")] function and the Aztec blockchain.\n///\n/// An instance of the PrivateContext is initialized automatically at the outset of every private function, within the\n/// #[external(\"private\")] macro, so you'll never need to consciously instantiate this yourself.\n///\n/// The instance is always named `context`, and it is always be available within the body of every\n/// #[external(\"private\")] function in your smart contract.\n///\n/// > For those used to \"vanilla\" Noir, it might be jarring to have access to > `context` without seeing a declaration\n/// `let context = PrivateContext::new(...)` > within the body of your function. This is just a consequence of using >\n/// macros to tidy-up verbose boilerplate. You can use `nargo expand` to > expand all macros, if you dare.\n///\n/// Typical usage for a smart contract developer will be to call getter methods of the PrivateContext.\n///\n/// _Pushing_ data and requests to the context is mostly handled within aztec-nr's own functions, so typically a smart\n/// contract developer won't need to call any setter methods directly.\n///\n/// > Advanced users might occasionally wish to push data to the context > directly for lower-level control. If you\n/// find yourself doing this, please > open an issue on GitHub to describe your use case: it might be that > new\n/// functionality should be added to aztec-nr.\n///\n/// ## Responsibilities\n/// - Exposes contextual data to a private function:\n/// - Data relating to how this private function was called.\n/// - msg_sender\n/// - this_address - (the contract address of the private function being executed)\n/// - See `CallContext` for more data.\n/// - Data relating to the transaction in which this private function is being executed.\n/// - chain_id\n/// - version\n/// - gas_settings\n/// - Provides state access:\n/// - Access to the \"Anchor block\" header. Recall, a private function cannot read from the \"current\" block header, but\n/// must read from some historical block header, because as soon as private function execution begins (asynchronously,\n/// on a user's device), the public state of the chain (the \"current state\") will have progressed forward. We call this\n/// reference the \"Anchor block\". See `BlockHeader`.\n///   - Enables consumption of L1->L2 messages.\n/// - Enables calls to functions of other smart contracts:\n/// - Private function calls\n/// - Enqueueing of public function call requests (Since public functions are executed at a later time, by a block\n/// proposer, we say they are \"enqueued\").\n/// - Writes data to the blockchain:\n/// - New notes\n/// - New nullifiers\n/// - Private logs (for sending encrypted note contents or encrypted events)\n///   - New L2->L1 messages.\n/// - Provides args to the private function (handled by the #[external(\"private\")] macro).\n/// - Returns the return values of this private function (handled by the\n///   #[external(\"private\")] macro).\n/// - Makes Key Validation Requests.\n/// - Private functions are not allowed to see master secret keys, because we do not trust them. They are instead given\n/// \"app-siloed\" secret keys with a claim that they relate to a master public key. They can then request validation of\n/// this claim, by making a \"key validation request\" to the protocol's kernel circuits (which _are_ allowed to see\n/// certain master secret keys).\n///\n/// ## Advanced Responsibilities\n///\n/// - Ultimately, the PrivateContext is responsible for constructing the PrivateCircuitPublicInputs of the private\n/// function being executed. All private functions on Aztec must have public inputs which adhere to the rigid layout of\n/// the PrivateCircuitPublicInputs, in order to be compatible with the protocol's kernel circuits. A well-known\n/// misnomer:\n/// - \"public inputs\" contain both inputs and outputs of this function.\n/// - By \"outputs\" we mean a lot more side-effects than just the \"return values\" of the function.\n/// - Most of the so-called \"public inputs\" are kept _private_, and never leak to the outside world, because they are\n/// 'swallowed' by the protocol's kernel circuits before the tx is sent to the network. Only the following are exposed\n/// to the outside world:\n/// - New note_hashes\n/// - New nullifiers\n/// - New private logs\n///     - New L2->L1 messages\n/// - New enqueued public function call requests All the above-listed arrays of side-effects can be padded by the\n/// user's wallet (through instructions to the kernel circuits, via the PXE) to obscure their true lengths.\n///\n/// ## Syntax Justification\n///\n/// Both user-defined functions _and_ most functions in aztec-nr need access to the PrivateContext instance to\n/// read/write data. This is why you'll see the arguably-ugly pervasiveness of the \"context\" throughout your smart\n/// contract and the aztec-nr library. For example, `&mut context` is prevalent. In some languages, you can access and\n/// mutate a global variable (such as a PrivateContext instance) from a function without polluting the function's\n/// parameters. With Noir, a function must explicitly pass control of a mutable variable to another function, by\n/// reference. Since many functions in aztec-nr need to be able to push new data to the PrivateContext, they need to be\n/// handed a mutable reference _to_ the context as a parameter. For example, `Context` is prevalent as a generic\n/// parameter, to give better type safety at compile time. Many `aztec-nr` functions don't make sense if they're called\n/// in a particular runtime (private, public or utility), and so are intentionally only implemented over certain\n/// [Private|Public|Utility]Context structs. This gives smart contract developers a much faster feedback loop if\n/// they're making a mistake, as an error will be thrown by the LSP or when they compile their contract.\n///\n#[derive(Eq)]\npub struct PrivateContext {\n    // docs:start:private-context\n    pub inputs: PrivateContextInputs,\n    pub side_effect_counter: u32,\n\n    pub min_revertible_side_effect_counter: u32,\n    pub is_fee_payer: bool,\n\n    pub args_hash: Field,\n    pub return_hash: Field,\n\n    pub expiration_timestamp: u64,\n\n    pub(crate) note_hash_read_requests: BoundedVec<Scoped<Counted<Field>>, MAX_NOTE_HASH_READ_REQUESTS_PER_CALL>,\n    pub(crate) nullifier_read_requests: BoundedVec<Scoped<Counted<Field>>, MAX_NULLIFIER_READ_REQUESTS_PER_CALL>,\n    key_validation_requests_and_separators: BoundedVec<KeyValidationRequestAndSeparator, MAX_KEY_VALIDATION_REQUESTS_PER_CALL>,\n\n    pub note_hashes: BoundedVec<Counted<NoteHash>, MAX_NOTE_HASHES_PER_CALL>,\n    pub nullifiers: BoundedVec<Counted<Nullifier>, MAX_NULLIFIERS_PER_CALL>,\n\n    pub private_call_requests: BoundedVec<PrivateCallRequest, MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL>,\n    pub public_call_requests: BoundedVec<Counted<PublicCallRequest>, MAX_ENQUEUED_CALLS_PER_CALL>,\n    pub public_teardown_call_request: PublicCallRequest,\n    pub l2_to_l1_msgs: BoundedVec<Counted<L2ToL1Message>, MAX_L2_TO_L1_MSGS_PER_CALL>,\n    // docs:end:private-context\n\n    // Header of a block whose state is used during private execution (not the block the transaction is included in).\n    pub anchor_block_header: BlockHeader,\n\n    pub private_logs: BoundedVec<Counted<PrivateLogData>, MAX_PRIVATE_LOGS_PER_CALL>,\n    pub contract_class_logs_hashes: BoundedVec<Counted<LogHash>, MAX_CONTRACT_CLASS_LOGS_PER_CALL>,\n\n    // Contains the last key validation request for each key type. This is used to cache the last request and avoid\n    // fetching the same request multiple times. The index of the array corresponds to the key type (0 nullifier, 1\n    // incoming, 2 outgoing, 3 tagging).\n    pub last_key_validation_requests: [Option<KeyValidationRequest>; NUM_KEY_TYPES],\n\n    pub expected_non_revertible_side_effect_counter: u32,\n    pub expected_revertible_side_effect_counter: u32,\n}\n\nimpl PrivateContext {\n    pub fn new(inputs: PrivateContextInputs, args_hash: Field) -> PrivateContext {\n        PrivateContext {\n            inputs,\n            side_effect_counter: inputs.start_side_effect_counter + 1,\n            min_revertible_side_effect_counter: 0,\n            is_fee_payer: false,\n            args_hash,\n            return_hash: 0,\n            expiration_timestamp: inputs.anchor_block_header.global_variables.timestamp + MAX_TX_LIFETIME,\n            note_hash_read_requests: BoundedVec::new(),\n            nullifier_read_requests: BoundedVec::new(),\n            key_validation_requests_and_separators: BoundedVec::new(),\n            note_hashes: BoundedVec::new(),\n            nullifiers: BoundedVec::new(),\n            anchor_block_header: inputs.anchor_block_header,\n            private_call_requests: BoundedVec::new(),\n            public_call_requests: BoundedVec::new(),\n            public_teardown_call_request: PublicCallRequest::empty(),\n            l2_to_l1_msgs: BoundedVec::new(),\n            private_logs: BoundedVec::new(),\n            contract_class_logs_hashes: BoundedVec::new(),\n            last_key_validation_requests: [Option::none(); NUM_KEY_TYPES],\n            expected_non_revertible_side_effect_counter: 0,\n            expected_revertible_side_effect_counter: 0,\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: Since Aztec doesn't have a concept of an EoA (Externally-owned Account), the msg_sender is\n    /// \"none\" 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\n    /// or 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    pub fn maybe_msg_sender(self) -> Option<AztecAddress> {\n        let maybe_msg_sender = self.inputs.call_context.msg_sender;\n        if maybe_msg_sender == NULL_MSG_SENDER_CONTRACT_ADDRESS {\n            Option::none()\n        } else {\n            Option::some(maybe_msg_sender)\n        }\n    }\n\n    /// Returns the contract address of the current function being executed.\n    ///\n    /// This is equivalent to `address(this)` in Solidity (hence the name). Use this to identify the current contract's\n    /// address, commonly needed for access control or when interacting with other contracts.\n    ///\n    /// # Returns\n    /// * `AztecAddress` - The contract address of the current function being executed.\n    ///\n    pub fn this_address(self) -> AztecAddress {\n        self.inputs.call_context.contract_address\n    }\n\n    /// Returns the chain ID of the current network.\n    ///\n    /// This is similar to `block.chainid` in Solidity. Returns the unique identifier for the blockchain network this\n    /// transaction is executing on.\n    ///\n    /// Helps prevent cross-chain replay attacks. Useful if implementing multi-chain contract logic.\n    ///\n    /// # Returns\n    /// * `Field` - The chain ID as a field element\n    ///\n    pub fn chain_id(self) -> Field {\n        self.inputs.tx_context.chain_id\n    }\n\n    /// Returns the Aztec protocol version that this transaction is executing under. Different versions may have\n    /// different rules, opcodes, or cryptographic primitives.\n    ///\n    /// This is similar to how Ethereum has different EVM versions.\n    ///\n    /// Useful for forward/backward compatibility checks\n    ///\n    /// Not to be confused with contract versions; this is the protocol version.\n    ///\n    /// # Returns\n    /// * `Field` - The protocol version as a field element\n    ///\n    pub fn version(self) -> Field {\n        self.inputs.tx_context.version\n    }\n\n    /// Returns the gas settings for the current transaction.\n    ///\n    /// This provides information about gas limits and pricing for the transaction, similar to `tx.gasprice` and gas\n    /// limits in Ethereum. However, Aztec has a more sophisticated gas model with separate accounting for L2\n    /// computation and data availability (DA) costs.\n    ///\n    /// # Returns\n    /// * `GasSettings` - Struct containing gas limits and fee information\n    ///\n    pub fn gas_settings(self) -> GasSettings {\n        self.inputs.tx_context.gas_settings\n    }\n\n    /// Returns the function selector of the currently executing function.\n    ///\n    /// Low-level function: Ordinarily, smart contract developers will not need to access this.\n    ///\n    /// This is similar to `msg.sig` in Solidity, which returns the first 4 bytes of the function signature. In Aztec,\n    /// the selector uniquely identifies which function within the contract is being called.\n    ///\n    /// # Returns\n    /// * `FunctionSelector` - The 4-byte function identifier\n    ///\n    /// # Advanced\n    /// Only #[external(\"private\")] functions have a function selector as a protocol- enshrined concept. The function\n    /// selectors of private functions are baked into the preimage of the contract address, and are used by the\n    /// protocol's kernel circuits to identify each private function and ensure the correct one is being executed.\n    ///\n    /// Used internally for function dispatch and call verification.\n    ///\n    pub fn selector(self) -> FunctionSelector {\n        self.inputs.call_context.function_selector\n    }\n\n    /// Returns the hash of the arguments passed to the current function.\n    ///\n    /// Very low-level function: You shouldn't need to call this. The #[external(\"private\")] macro calls this, and it\n    /// makes the arguments neatly available to the body of your private function.\n    ///\n    /// # Returns\n    /// * `Field` - Hash of the function arguments\n    ///\n    /// # Advanced\n    /// * Arguments are hashed to reduce proof size and verification time\n    /// * Enables efficient argument passing in recursive function calls\n    /// * The hash can be used to retrieve the original arguments from the PXE.\n    ///\n    pub fn get_args_hash(self) -> Field {\n        self.args_hash\n    }\n\n    /// Pushes a new note_hash to the Aztec blockchain's global Note Hash Tree (a state tree).\n    ///\n    /// A note_hash is a commitment to a piece of private state.\n    ///\n    /// Low-level function: Ordinarily, smart contract developers will not need to manually call this. Aztec-nr's state\n    /// variables (see `../state_vars/`) are designed to understand when to create and push new note hashes.\n    ///\n    /// # Arguments\n    /// * `note_hash` - The new note_hash.\n    ///\n    /// # Advanced\n    /// From here, the protocol's kernel circuits will take over and insert the note_hash into the protocol's \"note\n    /// hash tree\" (in the Base Rollup circuit). Before insertion, the protocol will:\n    /// - \"Silo\" the `note_hash` with the contract address of this function, to yield a `siloed_note_hash`. This\n    /// prevents state collisions between different smart contracts.\n    /// - Ensure uniqueness of the `siloed_note_hash`, to prevent Faerie-Gold attacks, by hashing the\n    /// `siloed_note_hash` with a unique value, to yield a `unique_siloed_note_hash` (see the protocol spec for more).\n    ///\n    /// In addition to calling this function, aztec-nr provides the contents of the newly-created note to the PXE, via\n    /// the `notify_created_note` oracle.\n    ///\n    /// > Advanced users might occasionally wish to push data to the context > directly for lower-level control. If you\n    /// find yourself doing this, > please open an issue on GitHub to describe your use case: it might be > that new\n    /// functionality should be added to aztec-nr.\n    ///\n    pub fn push_note_hash(&mut self, note_hash: Field) {\n        self.note_hashes.push(Counted::new(note_hash, self.next_counter()));\n    }\n\n    /// Pushes a new nullifier to the Aztec blockchain's global Nullifier Tree (a state tree).\n    ///\n    /// See also: `push_nullifier_for_note_hash`.\n    ///\n    /// Low-level function: Ordinarily, smart contract developers will not need to manually call this. Aztec-nr's state\n    /// variables (see `../state_vars/`) are designed to understand when to create and push new nullifiers.\n    ///\n    /// A nullifier can only be emitted once. Duplicate nullifier insertions are rejected by the protocol.\n    ///\n    /// Generally, a nullifier is emitted to prevent an action from happening more than once, in such a way that the\n    /// action cannot be linked (by an observer of the blockchain) to any earlier transactions.\n    ///\n    /// I.e. a nullifier is a random-looking, but deterministic record of a private, one-time action, which does not\n    /// leak what action has been taken, and which preserves the property of \"tx unlinkability\".\n    ///\n    /// Usually, a nullifier will be emitted to \"spend\" a note (a piece of private state), without revealing which\n    /// specific note is being spent.\n    ///\n    /// (Important: in such cases, use the below `push_nullifier_for_note_hash`).\n    ///\n    /// Sometimes, a nullifier might be emitted completely unrelated to any notes. Examples include initialization of a\n    /// new contract; initialization of a PrivateMutable, or signalling in Semaphore-like applications. This\n    /// `push_nullifier` function serves such use cases.\n    ///\n    /// # Arguments\n    /// * `nullifier`\n    ///\n    /// # Advanced\n    /// From here, the protocol's kernel circuits will take over and insert the nullifier into the protocol's\n    /// \"nullifier tree\" (in the Base Rollup circuit). Before insertion, the protocol will:\n    /// - \"Silo\" the `nullifier` with the contract address of this function, to yield a `siloed_nullifier`. This\n    /// prevents state collisions between different smart contracts.\n    /// - Ensure the `siloed_nullifier` is unique (the nullifier tree is an indexed merkle tree which supports\n    /// efficient non-membership proofs).\n    ///\n    pub fn push_nullifier(&mut self, nullifier: Field) {\n        notify_created_nullifier(nullifier);\n        self.nullifiers.push(Nullifier { value: nullifier, note_hash: 0 }.count(self.next_counter()));\n    }\n\n    /// Pushes a nullifier that corresponds to a specific note hash.\n    ///\n    /// Low-level function: Ordinarily, smart contract developers will not need to manually call this. Aztec-nr's state\n    /// variables (see `../state_vars/`) are designed to understand when to create and push new nullifiers.\n    ///\n    /// This is a specialized version of `push_nullifier` that links a nullifier to the specific note hash it's\n    /// nullifying. This is the most common usage pattern for nullifiers. See `push_nullifier` for more explanation on\n    /// nullifiers.\n    ///\n    /// # Arguments\n    /// * `nullifier`\n    /// * `nullified_note_hash` - The note hash of the note being nullified\n    ///\n    /// # Advanced\n    ///Important: usage of this function doesn't mean that the world will _see_ that this nullifier relates to the\n    /// given nullified_note_hash (as that would violate \"tx unlinkability\"); it simply informs the user's PXE about\n    /// the relationship (via `notify_nullified_note`). The PXE can then use this information to feed hints to the\n    /// kernel circuits for \"squashing\" purposes: If a note is nullified during the same tx which created it, we can\n    /// \"squash\" (delete) the note and nullifier (and any private logs associated with the note), to save on data\n    /// emission costs.\n    ///\n    pub fn push_nullifier_for_note_hash(&mut self, nullifier: Field, nullified_note_hash: Field) {\n        let nullifier_counter = self.next_counter();\n        notify_nullified_note(nullifier, nullified_note_hash, nullifier_counter);\n        self.nullifiers.push(Nullifier { value: nullifier, note_hash: nullified_note_hash }.count(nullifier_counter));\n    }\n\n    /// Returns the anchor block header - the historical block header that this private function is reading from.\n    ///\n    /// A private function CANNOT read from the \"current\" block header, but must read from some older block header,\n    /// because as soon as private function execution begins (asynchronously, on a user's device), the public state of\n    /// the chain (the \"current state\") will have progressed forward.\n    ///\n    /// # Returns\n    /// * `BlockHeader` - The anchor block header.\n    ///\n    /// # Advanced\n    /// * All private functions of a tx read from the same anchor block header.\n    /// * The protocol asserts that the `expiration_timestamp` of every tx is at most 24 hours beyond the timestamp of\n    /// the tx's chosen anchor block header. This enables the network's nodes to safely prune old txs from the mempool.\n    /// Therefore, the chosen block header _must_ be one from within the last 24 hours.\n    ///\n    pub fn get_anchor_block_header(self) -> BlockHeader {\n        self.anchor_block_header\n    }\n\n    /// Returns the header of any historical block at or before the anchor block.\n    ///\n    /// This enables private contracts to access information from even older blocks than the anchor block header.\n    ///\n    /// Useful for time-based contract logic that needs to compare against multiple historical points.\n    ///\n    /// # Arguments\n    /// * `block_number` - The block number to retrieve (must be <= anchor block number)\n    ///\n    /// # Returns\n    /// * `BlockHeader` - The header of the requested historical block\n    ///\n    /// # Advanced\n    /// This function uses an oracle to fetch block header data from the user's PXE. Depending on how much blockchain\n    /// data the user's PXE has been set up to store, this might require a query from the PXE to another Aztec node to\n    /// get the data. > This is generally true of all oracle getters (see `../oracle`).\n    ///\n    /// Each block header gets hashed and stored as a leaf in the protocol's Archive Tree. In fact, the i-th block\n    /// header gets stored at the i-th leaf index of the Archive Tree. Behind the scenes, this `get_block_header_at`\n    /// function will add Archive Tree merkle-membership constraints (~3k) to your smart contract function's circuit,\n    /// to prove existence of the block header in the Archive Tree.\n    ///\n    /// Note: we don't do any caching, so avoid making duplicate calls for the same block header, because each call\n    /// will add duplicate constraints.\n    ///\n    /// Calling this function is more expensive (constraint-wise) than getting the anchor block header (via\n    /// `get_block_header`). This is because the anchor block's merkle membership proof is handled by Aztec's protocol\n    /// circuits, and is only performed once for the entire tx because all private functions of a tx share a common\n    /// anchor block header. Therefore, the cost (constraint-wise) of calling `get_block_header` is effectively free.\n    ///\n    pub fn get_block_header_at(self, block_number: u32) -> BlockHeader {\n        get_block_header_at(block_number, self)\n    }\n\n    /// Sets the hash of the return values for this private function.\n    ///\n    /// Very low-level function: this is called by the #[external(\"private\")] macro.\n    ///\n    /// # Arguments\n    /// * `serialized_return_values` - The serialized return values as a field array\n    ///\n    pub fn set_return_hash<let N: u32>(&mut self, serialized_return_values: [Field; N]) {\n        let return_hash = hash_args(serialized_return_values);\n        self.return_hash = return_hash;\n        execution_cache::store(serialized_return_values, return_hash);\n    }\n\n    /// Builds the PrivateCircuitPublicInputs for this private function, to ensure compatibility with the protocol's\n    /// kernel circuits.\n    ///\n    /// Very low-level function: This function is automatically called by the #[external(\"private\")] macro.\n    pub fn finish(self) -> PrivateCircuitPublicInputs {\n        PrivateCircuitPublicInputs {\n            call_context: self.inputs.call_context,\n            args_hash: self.args_hash,\n            returns_hash: self.return_hash,\n            min_revertible_side_effect_counter: self.min_revertible_side_effect_counter,\n            is_fee_payer: self.is_fee_payer,\n            expiration_timestamp: self.expiration_timestamp,\n            note_hash_read_requests: ClaimedLengthArray::from_bounded_vec(self.note_hash_read_requests),\n            nullifier_read_requests: ClaimedLengthArray::from_bounded_vec(self.nullifier_read_requests),\n            key_validation_requests_and_separators: ClaimedLengthArray::from_bounded_vec(\n                self.key_validation_requests_and_separators,\n            ),\n            note_hashes: ClaimedLengthArray::from_bounded_vec(self.note_hashes),\n            nullifiers: ClaimedLengthArray::from_bounded_vec(self.nullifiers),\n            private_call_requests: ClaimedLengthArray::from_bounded_vec(self.private_call_requests),\n            public_call_requests: ClaimedLengthArray::from_bounded_vec(self.public_call_requests),\n            public_teardown_call_request: self.public_teardown_call_request,\n            l2_to_l1_msgs: ClaimedLengthArray::from_bounded_vec(self.l2_to_l1_msgs),\n            start_side_effect_counter: self.inputs.start_side_effect_counter,\n            end_side_effect_counter: self.side_effect_counter,\n            private_logs: ClaimedLengthArray::from_bounded_vec(self.private_logs),\n            contract_class_logs_hashes: ClaimedLengthArray::from_bounded_vec(self.contract_class_logs_hashes),\n            anchor_block_header: self.anchor_block_header,\n            tx_context: self.inputs.tx_context,\n            expected_non_revertible_side_effect_counter: self.expected_non_revertible_side_effect_counter,\n            expected_revertible_side_effect_counter: self.expected_revertible_side_effect_counter,\n        }\n    }\n\n    /// Designates this contract as the fee payer for the transaction.\n    ///\n    /// Unlike Ethereum, where the transaction sender always pays fees, Aztec allows any contract to voluntarily pay\n    /// transaction fees. This enables patterns like sponsored transactions or fee abstraction where users don't need\n    /// to hold fee-juice themselves. (Fee juice is a fee-paying asset for Aztec).\n    ///\n    /// Only one contract per transaction can declare itself as the fee payer, and it must have sufficient fee-juice\n    /// balance (>= the gas limits specified in the TxContext) by the time we reach the public setup phase of the tx.\n    ///\n    pub fn set_as_fee_payer(&mut self) {\n        crate::protocol::logging::debug_log_format(\"Setting {0} as fee payer\", [self.this_address().to_field()]);\n        self.is_fee_payer = true;\n    }\n\n    pub fn in_revertible_phase(&mut self) -> bool {\n        let current_counter = self.side_effect_counter;\n\n        // Safety: Kernel will validate that the claim is correct by validating the expected counters.\n        let is_revertible = unsafe { is_side_effect_counter_revertible_oracle_wrapper(current_counter) };\n\n        if is_revertible {\n            if (self.expected_revertible_side_effect_counter == 0)\n                | (current_counter < self.expected_revertible_side_effect_counter) {\n                self.expected_revertible_side_effect_counter = current_counter;\n            }\n        } else if current_counter > self.expected_non_revertible_side_effect_counter {\n            self.expected_non_revertible_side_effect_counter = current_counter;\n        }\n\n        is_revertible\n    }\n\n    /// Declares the end of the \"setup phase\" of this tx.\n    ///\n    /// Only one function per tx can declare the end of the setup phase.\n    ///\n    /// Niche function: Only wallet developers and paymaster contract developers (aka Fee-payment contracts) will need\n    /// to make use of this function.\n    ///\n    /// Aztec supports a three-phase execution model: setup, app logic, teardown. The phases exist to enable a fee\n    /// payer to take on the risk of paying a transaction fee, safe in the knowledge that their payment (in whatever\n    /// token or method the user chooses) will succeed, regardless of whether the app logic will succeed. The \"setup\"\n    /// phase enables such a payment to be made, because the setup phase _cannot revert_: a reverting function within\n    /// the setup phase would result in an invalid block which cannot be proven. Any side-effects generated during that\n    /// phase are guaranteed to be inserted into Aztec's state trees (except for squashed notes & nullifiers, of\n    /// course).\n    ///\n    /// Even though the end of the setup phase is declared within a private function, you might have noticed that\n    /// _public_ functions can also execute within the setup phase. This is because any public function calls which\n    /// were enqueued _within the setup phase_ by a private function are considered part of the setup phase.\n    ///\n    /// # Advanced\n    /// * Sets the minimum revertible side effect counter of this tx to be the PrivateContext's _current_ side effect\n    /// counter.\n    ///\n    pub fn end_setup(&mut self) {\n        // Incrementing the side effect counter when ending setup ensures non ambiguity for the counter where we change\n        // phases.\n        self.side_effect_counter += 1;\n        // crate::protocol::logging::debug_log_format(\n        //     \"Ending setup at counter {0}\",\n        //     [self.side_effect_counter as Field]\n        // );\n        self.min_revertible_side_effect_counter = self.next_counter();\n        notify_set_min_revertible_side_effect_counter(self.min_revertible_side_effect_counter);\n    }\n\n    /// Sets a deadline (an \"include-by timestamp\") for when this transaction must be included in a block.\n    ///\n    /// Other functions in this tx might call this setter with differing values for the include-by timestamp. To ensure\n    /// that all functions' deadlines are met, the _minimum_ of all these include-by timestamps will be exposed when\n    /// this tx is submitted to the network.\n    ///\n    /// If the transaction is not included in a block by its include-by timestamp, it becomes invalid and it will never\n    /// be included.\n    ///\n    /// This expiry timestamp is publicly visible. See the \"Advanced\" section for privacy concerns.\n    ///\n    /// # Arguments\n    /// * `expiration_timestamp` - Unix timestamp (seconds) deadline for inclusion. The include-by timestamp of this tx\n    /// will be _at most_ the timestamp specified.\n    ///\n    /// # Advanced\n    /// * If multiple functions set differing `expiration_timestamp`s, the kernel circuits will set it to be the\n    /// _minimum_ of the two. This ensures the tx expiry requirements of all functions in the tx are met.\n    /// * Rollup circuits will reject expired txs.\n    /// * The protocol enforces that all transactions must be included within 24 hours of their chosen anchor block's\n    /// timestamp, to enable safe mempool pruning.\n    /// * The DelayedPublicMutable design makes heavy use of this functionality, to enable private functions to read\n    /// public state.\n    /// * A sophisticated Wallet should cleverly set an include-by timestamp to improve the privacy of the user and the\n    /// network as a whole. For example, if a contract interaction sets include-by to some publicly-known value (e.g.\n    /// the time when a contract upgrades), then the wallet might wish to set an even lower one to avoid revealing that\n    /// this tx is interacting with said contract. Ideally, all wallets should standardize on an approach in order to\n    ///   provide users with a large anonymity set -- although the exact approach\n    /// will need to be discussed. Wallets that deviate from a standard might accidentally reveal which wallet each\n    /// transaction originates from.\n    ///\n    // docs:start:expiration-timestamp\n    pub fn set_expiration_timestamp(&mut self, expiration_timestamp: u64) {\n        // docs:end:expiration-timestamp\n        self.expiration_timestamp = std::cmp::min(self.expiration_timestamp, expiration_timestamp);\n    }\n\n    /// Asserts that a note has been created.\n    ///\n    /// This function will cause the transaction to fail unless the requested note exists. This is the preferred\n    /// mechanism for performing this check, and the only one that works for pending notes.\n    ///\n    /// ## Pending Notes\n    ///\n    /// Both settled notes (created in prior transactions) and pending notes (created in the current transaction) will\n    /// be considered by this function. Pending notes must have been created **before** this call is made for the check\n    /// to pass.\n    ///\n    /// ## Historical Notes\n    ///\n    /// If you need to assert that a note existed _by some specific block in the past_, instead of simply proving that\n    /// it exists by the current anchor block, use [`crate::history::note::assert_note_existed_by`] instead.\n    ///\n    /// ## Cost\n    ///\n    /// This uses up one of the call's kernel note hash read requests, which are limited. Like all kernel requests,\n    /// proving time costs are only incurred when the total number of requests exceeds the kernel's capacity, requiring\n    /// an additional invocation of the kernel reset circuit.\n    pub fn assert_note_exists(&mut self, note_existence_request: NoteExistenceRequest) {\n        // Note that the `note_hash_read_requests` array does not hold `NoteExistenceRequest` objects, but rather a\n        // custom kernel type. We convert from the aztec-nr type into it.\n\n        let note_hash = note_existence_request.note_hash();\n        let contract_address = note_existence_request.maybe_contract_address().unwrap_or(AztecAddress::zero());\n\n        let side_effect = Scoped::new(\n            Counted::new(note_hash, self.next_counter()),\n            contract_address,\n        );\n\n        self.note_hash_read_requests.push(side_effect);\n    }\n\n    /// Asserts that a nullifier has been emitted.\n    ///\n    /// This function will cause the transaction to fail unless the requested nullifier exists. This is the preferred\n    /// mechanism for performing this check, and the only one that works for pending nullifiers.\n    ///\n    /// ## Pending Nullifiers\n    ///\n    /// Both settled nullifiers (emitted in prior transactions) and pending nullifiers (emitted in the current\n    /// transaction) will be considered by this function. Pending nullifiers must have been emitted **before** this\n    /// call is made for the check to pass.\n    ///\n    /// ## Historical Nullifiers\n    ///\n    /// If you need to assert that a nullifier existed _by some specific block in the past_, instead of simply proving\n    /// that it exists by the current anchor block, use [`crate::history::nullifier::assert_nullifier_existed_by`]\n    /// instead.\n    ///\n    /// ## Public vs Private\n    ///\n    /// In general, it is unsafe to check for nullifier non-existence in private, as that will not consider the\n    /// possibility of the nullifier having been emitted in any transaction between the anchor block and the inclusion\n    /// block. Private functions instead prove existence via this function and 'prove' non-existence by _emitting_ the\n    /// nullifer, which would cause the transaction to fail if the nullifier existed.\n    ///\n    /// This is not the case in public functions, which do have access to the tip of the blockchain and so can reliably\n    /// prove whether a nullifier exists or not via\n    /// [`crate::context::public_context::PublicContext::nullifier_exists_unsafe`].\n    ///\n    /// ## Cost\n    ///\n    /// This uses up one of the call's kernel nullifier read requests, which are limited. Like all kernel requests,\n    /// proving time costs are only incurred when the total number of requests exceeds the kernel's capacity, requiring\n    /// an additional invocation of the kernel reset circuit.\n    pub fn assert_nullifier_exists(&mut self, nullifier_existence_request: NullifierExistenceRequest) {\n        let nullifier = nullifier_existence_request.nullifier();\n        let contract_address = nullifier_existence_request.maybe_contract_address().unwrap_or(AztecAddress::zero());\n\n        let request = Scoped::new(\n            Counted::new(nullifier, self.next_counter()),\n            contract_address,\n        );\n\n        self.nullifier_read_requests.push(request);\n    }\n\n    /// Requests the app-siloed nullifier hiding key (nhk_app) for the given (hashed) master nullifier public key\n    /// (npk_m), from the user's PXE.\n    ///\n    /// Advanced function: Only needed if you're designing your own notes and/or nullifiers.\n    ///\n    /// Contracts are not allowed to compute nullifiers for other contracts, as that would let them read parts of their\n    /// private state. Because of this, a contract is only given an \"app-siloed key\", which is constructed by\n    /// hashing the user's master nullifier hiding key with the contract's address. However, because contracts cannot\n    /// be trusted with a user's master nullifier hiding key (because we don't know which contracts are honest or\n    /// malicious), the PXE refuses to provide any master secret keys to any app smart contract function. This means\n    /// app functions are unable to prove that the derivation of an app-siloed nullifier hiding key has been computed\n    /// correctly. Instead, an app function can request to the kernel (via `request_nhk_app`) that it validates the\n    /// siloed derivation, since the kernel has been vetted to not leak any master secret keys.\n    ///\n    /// A common nullification scheme is to inject a nullifier hiding key into the preimage of a nullifier, to make the\n    /// nullifier deterministic but random-looking. This function enables that flow.\n    ///\n    /// # Arguments\n    /// * `npk_m_hash` - A hash of the master nullifier public key of the user whose PXE is executing this function.\n    ///\n    /// # Returns\n    /// * The app-siloed nullifier hiding key that corresponds to the given `npk_m_hash`.\n    ///\n    pub fn request_nhk_app(&mut self, npk_m_hash: Field) -> Field {\n        self.request_sk_app(npk_m_hash, NULLIFIER_INDEX)\n    }\n\n    /// Requests the app-siloed nullifier secret key (nsk_app) for the given (hashed) master nullifier public key\n    /// (npk_m), from the user's PXE.\n    ///\n    /// See `request_nsk_app` and `request_sk_app` for more info.\n    ///\n    /// The intention of the \"outgoing\" keypair is to provide a second secret key for all of a user's outgoing activity\n    /// (i.e. for notes that a user creates, as opposed to notes that a user receives from others). The separation of\n    /// incoming and outgoing data was a distinction made by zcash, with the intention of enabling a user to optionally\n    /// share with a 3rd party a controlled view of only incoming or outgoing notes. Similar functionality of sharing\n    /// select data can be achieved with offchain zero-knowledge proofs. It is up to an app developer whether they\n    /// choose to make use of a user's outgoing keypair within their application logic, or instead simply use the same\n    /// keypair (the address keypair (which is effectively the same as the \"incoming\" keypair)) for all incoming &\n    /// outgoing messages to a user.\n    ///\n    /// Currently, all of the exposed encryption functions in aztec-nr ignore the outgoing viewing keys, and instead\n    /// encrypt all note logs and event logs to a user's address public key.\n    ///\n    /// # Arguments\n    /// * `ovpk_m_hash` - Hash of the outgoing viewing public key master\n    ///\n    /// # Returns\n    /// * The application-specific outgoing viewing secret key\n    ///\n    pub fn request_ovsk_app(&mut self, ovpk_m_hash: Field) -> Field {\n        self.request_sk_app(ovpk_m_hash, OUTGOING_INDEX)\n    }\n\n    /// Pushes a Key Validation Request to the kernel.\n    ///\n    /// Private functions are not allowed to see a user's master secret keys, because we do not trust them. They are\n    /// instead given \"app-siloed\" secret keys with a claim that they relate to a master public key. They can then\n    /// request validation of this claim, by making a \"key validation request\" to the protocol's kernel circuits (which\n    /// _are_ allowed to see certain master secret keys).\n    ///\n    /// When a Key Validation Request tuple of (sk_app, Pk_m, app_address) is submitted to the kernel, it will perform\n    /// the following derivations to validate the relationship between the claimed sk_app and the user's Pk_m:\n    ///\n    ///       (sk_m) ----> * G ----> Pk_m\n    ///         |                     |\n    ///         v                       We use the kernel to prove this\n    ///  h(sk_m, app_address)         | sk_app-Pk_m relationship, because app\n    ///         |                       circuits must not be trusted to see sk_m.\n    ///         v                     |\n    /// sk_app - -  - - - - - - -\n    ///\n    /// The function is named \"request_\" instead of \"get_\" to remind the user that a Key Validation Request will be\n    /// emitted to the kernel.\n    ///\n    fn request_sk_app(&mut self, pk_m_hash: Field, key_index: Field) -> Field {\n        let cached_request =\n            self.last_key_validation_requests[key_index as u32].unwrap_or(KeyValidationRequest::empty());\n\n        if cached_request.pk_m.hash() == pk_m_hash {\n            // We get a match so the cached request is the latest one\n            cached_request.sk_app\n        } else {\n            // We didn't get a match meaning the cached result is stale Typically we'd validate keys by showing that\n            // they are the preimage of `pk_m_hash`, but that'd require the oracle returning the master secret keys,\n            // which could cause malicious contracts to leak it or learn about secrets from other contracts. We\n            // therefore silo secret keys, and rely on the private kernel to validate that we siloed secret key\n            // corresponds to correct siloing of the master secret key that hashes to `pk_m_hash`.\n\n            // Safety: Kernels verify that the key validation request is valid and below we verify that a request for\n            // the correct public key has been received.\n            let request = unsafe { get_key_validation_request(pk_m_hash, key_index) };\n            assert_eq(request.pk_m.hash(), pk_m_hash, \"Obtained invalid key validation request\");\n\n            self.key_validation_requests_and_separators.push(\n                KeyValidationRequestAndSeparator {\n                    request,\n                    key_type_domain_separator: public_key_domain_separators[key_index as u32],\n                },\n            );\n            self.last_key_validation_requests[key_index as u32] = Option::some(request);\n            request.sk_app\n        }\n    }\n\n    /// Sends an \"L2 -> L1 message\" from this function (Aztec, L2) to a smart contract on Ethereum (L1). L1 contracts\n    /// which are designed to send/receive messages to/from Aztec are called \"Portal Contracts\".\n    ///\n    /// Common use cases include withdrawals, cross-chain asset transfers, and triggering L1 actions based on L2 state\n    /// changes.\n    ///\n    /// The message will be inserted into an Aztec \"Outbox\" contract on L1, when this transaction's block is proposed\n    /// to L1. Sending the message will not result in any immediate state changes in the target portal contract. The\n    /// message will need to be manually consumed from the Outbox through a separate Ethereum transaction: a user will\n    /// need to call a function of the portal contract -- a function specifically designed to make a call to the Outbox\n    /// to consume the message. The message will only be available for consumption once the _epoch_ proof has been\n    /// submitted. Given that there are multiple Aztec blocks within an epoch, it might take some time for this epoch\n    /// proof to be submitted -- especially if the block was near the start of an epoch.\n    ///\n    /// # Arguments\n    /// * `recipient` - Ethereum address that will receive the message\n    /// * `content` - Message content (32 bytes as a Field element). This content has a very\n    /// specific layout. docs:start:context_message_portal\n    pub fn message_portal(&mut self, recipient: EthAddress, content: Field) {\n        let message = L2ToL1Message { recipient, content };\n        self.l2_to_l1_msgs.push(message.count(self.next_counter()));\n    }\n\n    /// Consumes a message sent from Ethereum (L1) to Aztec (L2).\n    ///\n    /// Common use cases include token bridging, cross-chain governance, and triggering L2 actions based on L1 events.\n    ///\n    /// Use this function if you only want the message to ever be \"referred to\" once. Once consumed using this method,\n    /// the message cannot be consumed again, because a nullifier is emitted. If your use case wants for the message to\n    /// be read unlimited times, then you can always read any historic message from the L1-to-L2 messages tree;\n    /// messages never technically get deleted from that tree.\n    ///\n    /// The message will first be inserted into an Aztec \"Inbox\" smart contract on L1. Sending the message will not\n    /// result in any immediate state changes in the target L2 contract. The message will need to be manually consumed\n    /// by the target contract through a separate Aztec transaction. The message will not be available for consumption\n    /// immediately. Messages get copied over from the L1 Inbox to L2 by the next Proposer in batches. So you will need\n    /// to wait until the messages are copied before you can consume them.\n    ///\n    /// # Arguments\n    /// * `content` - The message content that was sent from L1\n    /// * `secret` - Secret value used for message privacy (if needed)\n    /// * `sender` - Ethereum address that sent the message\n    /// * `leaf_index` - Index of the message in the L1-to-L2 message tree\n    ///\n    /// # Advanced\n    /// Validates message existence in the L1-to-L2 message tree and nullifies the message to prevent\n    /// double-consumption.\n    pub fn consume_l1_to_l2_message(&mut self, content: Field, secret: Field, sender: EthAddress, leaf_index: Field) {\n        let nullifier = process_l1_to_l2_message(\n            self.anchor_block_header.state.l1_to_l2_message_tree.root,\n            self.this_address(),\n            sender,\n            self.chain_id(),\n            self.version(),\n            content,\n            secret,\n            leaf_index,\n        );\n\n        // Push nullifier (and the \"commitment\" corresponding to this can be \"empty\")\n        self.push_nullifier(nullifier)\n    }\n\n    /// Emits a private log (an array of Fields) that will be published to an Ethereum blob.\n    ///\n    /// Private logs are intended for the broadcasting of ciphertexts: that is, encrypted events or encrypted note\n    /// contents. Since the data in the logs is meant to be _encrypted_, private_logs are broadcast to publicly-visible\n    /// Ethereum blobs. The intended recipients of such encrypted messages can then discover and decrypt these\n    /// encrypted logs using their viewing secret key. (See `../messages/discovery` for more details).\n    ///\n    /// Important note: This function DOES NOT _do_ any encryption of the input `log` fields. This function blindly\n    /// publishes whatever input `log` data is fed into it, so the caller of this function should have already\n    /// performed the encryption, and the `log` should be the result of that encryption.\n    ///\n    /// The protocol does not dictate what encryption scheme should be used: a smart contract developer can choose\n    /// whatever encryption scheme they like. Aztec-nr includes some off-the-shelf encryption libraries that developers\n    /// might wish to use, for convenience. These libraries not only encrypt a plaintext (to produce a ciphertext);\n    /// they also prepend the ciphertext with a `tag` and `ephemeral public key` for easier message discovery. This is\n    /// a very dense topic, and we will be writing more libraries and docs soon.\n    ///\n    /// > Currently, AES128 CBC encryption is the main scheme included in > aztec.nr. > We are currently making\n    /// significant changes to the interfaces of the > encryption library.\n    ///\n    /// In some niche use cases, an app might be tempted to publish _un-encrypted_ data via a private log, because\n    /// _public logs_ are not available to private functions. Be warned that emitting public data via private logs is\n    /// strongly discouraged, and is considered a \"privacy anti-pattern\", because it reveals identifiable information\n    /// about _which_ function has been executed. A tx which leaks such information does not contribute to the privacy\n    /// set of the network.\n    ///\n    /// * Unlike `emit_raw_note_log`, this log is not tied to any specific note\n    ///\n    /// # Arguments\n    /// * `log` - The log data that will be publicly broadcast (so make sure it's already been encrypted before you\n    /// call this function). Private logs are bounded in size (PRIVATE_LOG_SIZE_IN_FIELDS), to encourage all logs from\n    /// all smart contracts look identical.\n    /// * `length` - The actual length of the `log` (measured in number of Fields). Although the input log has a max\n    /// size of PRIVATE_LOG_SIZE_IN_FIELDS, the latter values of the array might all be 0's for small logs. This\n    /// `length` should reflect the trimmed length of the array. The protocol's kernel circuits can then append random\n    /// fields as \"padding\" after the `length`, so that the logs of this smart contract look indistinguishable from\n    /// (the same length as) the logs of all other applications. It's up to wallets how much padding to apply, so\n    /// ideally all wallets should agree on standards for this.\n    pub fn emit_private_log(&mut self, log: [Field; PRIVATE_LOG_SIZE_IN_FIELDS], length: u32) {\n        let counter = self.next_counter();\n        let private_log = PrivateLogData { log: PrivateLog::new(log, length), note_hash_counter: 0 }.count(counter);\n        self.private_logs.push(private_log);\n    }\n\n    // TODO: rename.\n    /// Emits a private log that is explicitly tied to a newly-emitted note_hash, to convey to the kernel: \"this log\n    /// relates to this note\".\n    ///\n    /// This linkage is important in case the note gets squashed (due to being read later in this same tx), since we\n    /// can then squash the log as well.\n    ///\n    /// See `emit_private_log` for more info about private log emission.\n    ///\n    /// # Arguments\n    /// * `log` - The log data as an array of Field elements\n    /// * `length` - The actual length of the `log` (measured in number of Fields).\n    /// * `note_hash_counter` - The side-effect counter that was assigned to the new note_hash when it was pushed to\n    /// this `PrivateContext`.\n    ///\n    /// Important: If your application logic requires the log to always be emitted regardless of note squashing,\n    /// consider using `emit_private_log` instead, or emitting additional events.\n    ///\n    pub fn emit_raw_note_log(&mut self, log: [Field; PRIVATE_LOG_SIZE_IN_FIELDS], length: u32, note_hash_counter: u32) {\n        let counter = self.next_counter();\n        let private_log = PrivateLogData { log: PrivateLog::new(log, length), note_hash_counter };\n        self.private_logs.push(private_log.count(counter));\n    }\n\n    pub fn emit_contract_class_log<let N: u32>(&mut self, log: [Field; N]) {\n        let contract_address = self.this_address();\n        let counter = self.next_counter();\n\n        let log_to_emit: [Field; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS] =\n            log.concat([0; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS - N]);\n        // Note: the length is not always N, it is the number of fields we want to broadcast, omitting trailing zeros\n        // to save blob space.\n        // Safety: The below length is constrained in the base rollup, which will make sure that all the fields beyond\n        // length are zero. However, it won't be able to check that we didn't add extra padding (trailing zeroes) or\n        // that we cut trailing zeroes from the end.\n        let length = unsafe { trimmed_array_length_hint(log_to_emit) };\n        // We hash the entire padded log to ensure a user cannot pass a shorter length and so emit incorrect shorter\n        // bytecode.\n        let log_hash = poseidon2_hash(log_to_emit);\n        // Safety: the below only exists to broadcast the raw log, so we can provide it to the base rollup later to be\n        // constrained.\n        unsafe {\n            notify_created_contract_class_log(contract_address, log_to_emit, length, counter);\n        }\n\n        self.contract_class_logs_hashes.push(LogHash { value: log_hash, length: length }.count(counter));\n    }\n\n    /// Calls a private function on another contract (or the same contract).\n    ///\n    /// Very low-level function.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - Array of arguments to pass to the called function\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n    /// return values.\n    ///\n    /// This enables contracts to interact with each other while maintaining privacy. This \"composability\" of private\n    /// contract functions is a key feature of the Aztec network.\n    ///\n    /// If a user's transaction includes multiple private function calls, then by the design of Aztec, the following\n    /// information will remain private[1]:\n    /// - The function selectors and contract addresses of all private function calls will remain private, so an\n    /// observer of the public mempool will not be able to look at a tx and deduce which private functions have been\n    /// executed.\n    /// - The arguments and return values of all private function calls will 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 private function calls will (if designed\n    /// well) not leak any user secrets, nor leak which functions have been executed.\n    ///\n    /// [1] Caveats: Some of these privacy guarantees depend on how app developers design their smart contracts. Some\n    /// actions _can_ leak information, such as:\n    /// - Calling an internal public function.\n    /// - Calling a public function and not setting msg_sender to Option::none (feature not built yet - see github).\n    /// - Calling any public function will always leak details about the nature of the transaction, so devs should be\n    /// careful in their contract designs. If it can be done in a private function, then that will give the best\n    /// privacy.\n    /// - Not padding the side-effects of a tx to some standardized, uniform size. The kernel circuits can take hints\n    /// to pad side-effects, so a wallet should be able to request for a particular amount of padding. Wallets should\n    /// 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 size. See also:\n    /// 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 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_private_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n    ) -> ReturnsHash {\n        let args_hash = hash_args(args);\n        execution_cache::store(args, args_hash);\n        self.call_private_function_with_args_hash(contract_address, function_selector, args_hash, false)\n    }\n\n    /// Makes a read-only call to a private function on another contract.\n    ///\n    /// This is similar to Solidity's `staticcall`. The called function cannot modify state, emit L2->L2 messages, nor\n    /// emit events. Any nested calls are constrained to also be staticcalls.\n    ///\n    /// See `call_private_function` for more general info on private function calls.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract to call\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - Array of arguments to pass to the called function\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n    /// return values.\n    ///\n    pub fn static_call_private_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n    ) -> ReturnsHash {\n        let args_hash = hash_args(args);\n        execution_cache::store(args, args_hash);\n        self.call_private_function_with_args_hash(contract_address, function_selector, args_hash, true)\n    }\n\n    /// Calls a private function that takes no arguments.\n    ///\n    /// This is a convenience function for calling private functions that don't require any input parameters. It's\n    /// equivalent to `call_private_function` but slightly more efficient to use when no arguments are needed.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n    /// return values.\n    ///\n    pub fn call_private_function_no_args(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n    ) -> ReturnsHash {\n        self.call_private_function_with_args_hash(contract_address, function_selector, 0, false)\n    }\n\n    /// Makes a read-only call to a private function which takes no arguments.\n    ///\n    /// This combines the optimisation of `call_private_function_no_args` with the safety of\n    /// `static_call_private_function`.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n    /// return values.\n    ///\n    pub fn static_call_private_function_no_args(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n    ) -> ReturnsHash {\n        self.call_private_function_with_args_hash(contract_address, function_selector, 0, true)\n    }\n\n    /// Low-level private function call.\n    ///\n    /// This is the underlying implementation used by all other private function call methods. Instead of taking raw\n    /// arguments, it accepts a hash of the arguments.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args_hash` - Pre-computed hash of the function arguments\n    /// * `is_static_call` - Whether this should be a read-only call\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values\n    ///\n    pub fn call_private_function_with_args_hash(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args_hash: Field,\n        is_static_call: bool,\n    ) -> ReturnsHash {\n        let mut is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n        let start_side_effect_counter = self.side_effect_counter;\n\n        // Safety: The oracle simulates the private call and returns the value of the side effects counter after\n        // execution of the call (which means that end_side_effect_counter - start_side_effect_counter is the number of\n        // side effects that took place), along with the hash of the return values. We validate these by requesting a\n        // private kernel iteration in which the return values are constrained to hash to `returns_hash` and the side\n        // effects counter to increment from start to end.\n        let (end_side_effect_counter, returns_hash) = unsafe {\n            call_private_function_internal(\n                contract_address,\n                function_selector,\n                args_hash,\n                start_side_effect_counter,\n                is_static_call,\n            )\n        };\n\n        self.private_call_requests.push(\n            PrivateCallRequest {\n                call_context: CallContext {\n                    msg_sender: self.this_address(),\n                    contract_address,\n                    function_selector,\n                    is_static_call,\n                },\n                args_hash,\n                returns_hash,\n                start_side_effect_counter,\n                end_side_effect_counter,\n            },\n        );\n\n        // TODO (fees) figure out why this crashes the prover and enable it we need this in order to pay fees inside\n        // child call contexts assert(\n        //     (item.public_inputs.min_revertible_side_effect_counter == 0 as u32)\n        //     | (item.public_inputs.min_revertible_side_effect_counter\n        //         > self.min_revertible_side_effect_counter)\n        // ); if item.public_inputs.min_revertible_side_effect_counter\n        //     > self.min_revertible_side_effect_counter { self.min_revertible_side_effect_counter =\n        // item.public_inputs.min_revertible_side_effect_counter; }\n        self.side_effect_counter = end_side_effect_counter + 1; // TODO: call `next_counter`\n        // instead, for consistency\n        ReturnsHash::new(returns_hash)\n    }\n\n    /// Enqueues a call to a public function to be executed later.\n    ///\n    /// Unlike private functions which execute immediately on the user's device, public function calls are \"enqueued\"\n    /// and executed some time later by a block proposer.\n    ///\n    /// This means a public function cannot return any values back to a private function, because by the time the\n    /// public function is being executed, the private function which called it has already completed execution. (In\n    /// fact, the private function has been executed and proven, along with all other private function calls of the\n    /// user's tx. A single proof of the tx has been submitted to the Aztec network, and some time later a proposer has\n    /// picked the tx up from the mempool and begun executing all of the enqueued public functions).\n    ///\n    /// # Privacy warning Enqueueing a public function call is an inherently leaky action. Many interesting applications will require some interaction with public state, but smart contract developers should try to use public function calls sparingly, and carefully. _Internal_ public function calls are especially leaky, because they completely leak which private contract made the call. See also: https://docs.aztec.network/developers/resources/considerations/privacy_considerations\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - Array of arguments to pass to the public function\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn call_public_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n        hide_msg_sender: bool,\n    ) {\n        let calldata = [function_selector.to_field()].concat(args);\n        let calldata_hash = hash_calldata_array(calldata);\n        execution_cache::store(calldata, calldata_hash);\n        self.call_public_function_with_calldata_hash(contract_address, calldata_hash, false, hide_msg_sender)\n    }\n\n    /// Enqueues a read-only call to a public function.\n    ///\n    /// This is similar to Solidity's `staticcall`. The called function cannot modify state or emit events. Any nested\n    /// calls are constrained to also be staticcalls.\n    ///\n    /// See also `call_public_function` for more important information about making private -> public function calls.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - Array of arguments to pass to the public function\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn static_call_public_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n        hide_msg_sender: bool,\n    ) {\n        let calldata = [function_selector.to_field()].concat(args);\n        let calldata_hash = hash_calldata_array(calldata);\n        execution_cache::store(calldata, calldata_hash);\n        self.call_public_function_with_calldata_hash(contract_address, calldata_hash, true, hide_msg_sender)\n    }\n\n    /// Enqueues a call to a public function that takes no arguments.\n    ///\n    /// This is an optimisation for calling public functions that don't take any input parameters. It's otherwise\n    /// equivalent to `call_public_function`.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn call_public_function_no_args(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        hide_msg_sender: bool,\n    ) {\n        let calldata_hash = hash_calldata_array([function_selector.to_field()]);\n        self.call_public_function_with_calldata_hash(contract_address, calldata_hash, false, hide_msg_sender)\n    }\n\n    /// Enqueues a read-only call to a public function with no arguments.\n    ///\n    /// This combines the optimisation of `call_public_function_no_args` with the safety of\n    /// `static_call_public_function`.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn static_call_public_function_no_args(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        hide_msg_sender: bool,\n    ) {\n        let calldata_hash = hash_calldata_array([function_selector.to_field()]);\n        self.call_public_function_with_calldata_hash(contract_address, calldata_hash, true, hide_msg_sender)\n    }\n\n    /// Low-level public function call.\n    ///\n    /// This is the underlying implementation used by all other public function call methods. Instead of taking raw\n    /// arguments, it accepts a hash of the arguments.\n    ///\n    /// Advanced function: Most developers should use `call_public_function` or `static_call_public_function` instead.\n    /// This function is exposed for performance optimization and advanced use cases.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `calldata_hash` - Hash of the function calldata\n    /// * `is_static_call` - Whether this should be a read-only call\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn call_public_function_with_calldata_hash(\n        &mut self,\n        contract_address: AztecAddress,\n        calldata_hash: Field,\n        is_static_call: bool,\n        hide_msg_sender: bool,\n    ) {\n        let counter = self.next_counter();\n\n        let mut is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n        notify_enqueued_public_function_call(contract_address, calldata_hash, counter, is_static_call);\n\n        let msg_sender = if hide_msg_sender {\n            NULL_MSG_SENDER_CONTRACT_ADDRESS\n        } else {\n            self.this_address()\n        };\n\n        let call_request = PublicCallRequest { msg_sender, contract_address, is_static_call, calldata_hash };\n\n        self.public_call_requests.push(Counted::new(call_request, counter));\n    }\n\n    /// Enqueues a public function call, 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 (aka Fee-payment contracts) will need\n    /// to make use of this function.\n    ///\n    /// Aztec supports a three-phase execution model: setup, app logic, teardown. The phases exist to enable a fee\n    /// payer to take on the risk of paying a transaction fee, safe in the knowledge that their payment (in whatever\n    /// token or method the user chooses) will succeed, regardless of whether the app logic will succeed. The \"setup\"\n    /// phase ensures the fee payer has sufficient balance to pay the proposer their fees. The teardown phase is\n    /// primarily intended to: calculate exactly 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 tx side-effects) might exceed the refund\n    /// amount. For app logic with fairly stable and predictable gas consumption, a material refund amount is unlikely.\n    /// For app logic with unpredictable gas consumption, a refund might be important to the user (e.g. if a hefty\n    /// function reverts very early). Wallet/FPC/Paymaster developers should be mindful of this.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the teardown function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - An array of fields to pass to the function.\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    pub fn set_public_teardown_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n        hide_msg_sender: bool,\n    ) {\n        let calldata = [function_selector.to_field()].concat(args);\n        let calldata_hash = hash_calldata_array(calldata);\n        execution_cache::store(calldata, calldata_hash);\n        self.set_public_teardown_function_with_calldata_hash(contract_address, calldata_hash, false, hide_msg_sender)\n    }\n\n    /// Low-level function to set the public teardown function.\n    ///\n    /// This is the underlying implementation for setting the teardown function call that will execute at the end of\n    /// the transaction. Instead of taking raw arguments, it accepts a hash of the arguments.\n    ///\n    /// Advanced function: Most developers should use `set_public_teardown_function` instead.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the teardown function\n    /// * `calldata_hash` - Hash of the function calldata\n    /// * `is_static_call` - Whether this should be a read-only call\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn set_public_teardown_function_with_calldata_hash(\n        &mut self,\n        contract_address: AztecAddress,\n        calldata_hash: Field,\n        is_static_call: bool,\n        hide_msg_sender: bool,\n    ) {\n        let counter = self.next_counter();\n\n        let mut is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n        notify_set_public_teardown_function_call(contract_address, calldata_hash, counter, is_static_call);\n\n        let msg_sender = if hide_msg_sender {\n            NULL_MSG_SENDER_CONTRACT_ADDRESS\n        } else {\n            self.this_address()\n        };\n\n        self.public_teardown_call_request =\n            PublicCallRequest { msg_sender, contract_address, is_static_call, calldata_hash };\n    }\n\n    /// Increments the side-effect counter.\n    ///\n    /// Very low-level function.\n    ///\n    /// # Advanced\n    ///\n    /// Every side-effect of a private function is given a \"side-effect counter\", based on when it is created. This\n    /// PrivateContext is in charge of assigning the counters.\n    ///\n    /// The reason we have side-effect counters is complicated. Consider this illustrative pseudocode of inter-contract\n    /// function calls:\n    /// ```\n    /// contract A {\n    ///    let x = 5; // pseudocode for storage var x.\n    ///    fn a1 {\n    ///        read x; // value: 5, counter: 1.\n    ///        x = x + 1;\n    ///        write x; // value: 6, counter: 2.\n    ///\n    ///        B.b(); // start_counter: 2, end_counter: 4\n    ///\n    ///        read x; // value: 36, counter: 5.\n    ///        x = x + 1;\n    ///        write x; // value: 37, counter: 6.\n    ///    }\n    ///\n    ///    fn a2 {\n    ///        read x; // value: 6, counter: 3.\n    ///        x = x * x;\n    ///        write x; // value: 36, counter: 4.\n    ///    }\n    /// }\n    ///\n    /// contract B {\n    ///     fn b() {\n    ///         A.a2();\n    ///     }\n    /// }\n    /// ```\n    ///\n    /// Suppose a1 is the first function called. The comments show the execution counter of each side-effect, and what\n    /// the new value of `x` is.\n    ///\n    /// These (private) functions are processed by Aztec's kernel circuits in an order that is different from execution\n    /// order: All of A.a1 is proven before B.b is proven, before A.a2 is proven. So when we're in the 2nd execution\n    /// frame of A.a1 (after the call to B.b), the circuit needs to justify why x went from being `6` to `36`. But the\n    /// circuit doesn't know why, and given the order of proving, the kernel hasn't _seen_ a value of 36 get written\n    /// yet. The kernel needs to track big arrays of all side-effects of all private functions in a tx. Then, as it\n    /// recurses and processes B.b(), it will eventually see a value of 36 get written.\n    ///\n    /// Suppose side-effect counters weren't exposed: The kernel would only see this ordering (in order of proof\n    /// verification): [ A.a1.read, A.a1.write, A.a1.read, A.a1.write, A.a2.read, A.a2.write ]\n    /// [         5,          6,        36,         37,         6,         36 ]\n    /// The kernel wouldn't know _when_ B.b() was called within A.a1(), because it can't see what's going on within an\n    /// app circuit. So the kernel wouldn't know that the ordering of reads and writes should actually be: [ A.a1.read,\n    /// A.a1.write, A.a2.read, A.a2.write, A.a1.read, A.a1.write ]\n    /// [         5,          6,        6,         36,         36,         37 ]\n    ///\n    /// And so, we introduced side-effect counters: every private function must assign side-effect counters alongside\n    /// every side-effect that it emits, and also expose to the kernel the counters that it started and ended with.\n    /// This gives the kernel enough information to arrange all side-effects in the correct order. It can then catch\n    /// (for example) if a function tries to read state before it has been written (e.g. if A.a2() maliciously tried to\n    /// read a value of x=37) (e.g. if A.a1() maliciously tried to read x=6).\n    ///\n    /// If a malicious app contract _lies_ and does not count correctly:\n    /// - It cannot lie about its start and end counters because the kernel will catch this.\n    /// - It _could_ lie about its intermediate counters:\n    /// - 1. It could not increment its side-effects correctly\n    /// - 2. It could label its side-effects with counters outside of its start and end counters' range. The kernel\n    /// will catch 2. The kernel will not catch 1., but this would only cause corruption to the private state of the\n    /// malicious contract, and not any other contracts (because a contract can only modify its own state). If a \"good\"\n    /// contract is given _read access_ to a maliciously-counting contract (via an external getter function, or by\n    /// reading historic state from the archive tree directly), and they then make state changes to their _own_ state\n    /// accordingly, that could be dangerous. Developers should be mindful not to trust the claimed innards of external\n    /// contracts unless they have audited/vetted the contracts including vetting the side-effect counter\n    /// incrementation. This is a similar paradigm to Ethereum smart contract development: you must vet external\n    /// contracts that your contract relies upon, and you must not make any presumptions about their claimed behaviour.\n    /// (Hopefully if a contract imports a version of aztec-nr, we will get contract verification tooling that can\n    /// validate the authenticity of the imported aztec-nr package, and hence infer that the side- effect counting will\n    /// be correct, without having to re-audit such logic for every contract).\n    ///\n    fn next_counter(&mut self) -> u32 {\n        let counter = self.side_effect_counter;\n        self.side_effect_counter += 1;\n        counter\n    }\n}\n\nimpl Empty for PrivateContext {\n    fn empty() -> Self {\n        PrivateContext {\n            inputs: PrivateContextInputs::empty(),\n            side_effect_counter: 0 as u32,\n            min_revertible_side_effect_counter: 0 as u32,\n            is_fee_payer: false,\n            args_hash: 0,\n            return_hash: 0,\n            expiration_timestamp: 0,\n            note_hash_read_requests: BoundedVec::new(),\n            nullifier_read_requests: BoundedVec::new(),\n            key_validation_requests_and_separators: BoundedVec::new(),\n            note_hashes: BoundedVec::new(),\n            nullifiers: BoundedVec::new(),\n            private_call_requests: BoundedVec::new(),\n            public_call_requests: BoundedVec::new(),\n            public_teardown_call_request: PublicCallRequest::empty(),\n            l2_to_l1_msgs: BoundedVec::new(),\n            anchor_block_header: BlockHeader::empty(),\n            private_logs: BoundedVec::new(),\n            contract_class_logs_hashes: BoundedVec::new(),\n            last_key_validation_requests: [Option::none(); NUM_KEY_TYPES],\n            expected_non_revertible_side_effect_counter: 0,\n            expected_revertible_side_effect_counter: 0,\n        }\n    }\n}\n"
+      "source": "use crate::{\n    context::{inputs::PrivateContextInputs, NoteExistenceRequest, NullifierExistenceRequest, ReturnsHash},\n    hash::{hash_args, hash_calldata_array},\n    keys::constants::{NULLIFIER_INDEX, NUM_KEY_TYPES, OUTGOING_INDEX, public_key_domain_separators},\n    messaging::process_l1_to_l2_message,\n    oracle::{\n        block_header::get_block_header_at,\n        call_private_function::call_private_function_internal,\n        execution_cache,\n        key_validation_request::get_key_validation_request,\n        logs::notify_created_contract_class_log,\n        notes::notify_nullified_note,\n        nullifiers::notify_created_nullifier,\n        public_call::assert_valid_public_call_data,\n        tx_phase::{is_execution_in_revertible_phase, notify_revertible_phase_start},\n    },\n};\nuse crate::logging::aztecnr_trace_log_format;\nuse crate::protocol::{\n    abis::{\n        block_header::BlockHeader,\n        call_context::CallContext,\n        function_selector::FunctionSelector,\n        gas_settings::GasSettings,\n        log_hash::LogHash,\n        note_hash::NoteHash,\n        nullifier::Nullifier,\n        private_call_request::PrivateCallRequest,\n        private_circuit_public_inputs::PrivateCircuitPublicInputs,\n        private_log::{PrivateLog, PrivateLogData},\n        public_call_request::PublicCallRequest,\n        validation_requests::{KeyValidationRequest, KeyValidationRequestAndSeparator},\n    },\n    address::{AztecAddress, EthAddress},\n    constants::{\n        CONTRACT_CLASS_LOG_SIZE_IN_FIELDS, MAX_CONTRACT_CLASS_LOGS_PER_CALL, MAX_ENQUEUED_CALLS_PER_CALL,\n        MAX_KEY_VALIDATION_REQUESTS_PER_CALL, MAX_L2_TO_L1_MSGS_PER_CALL, MAX_NOTE_HASH_READ_REQUESTS_PER_CALL,\n        MAX_NOTE_HASHES_PER_CALL, MAX_NULLIFIER_READ_REQUESTS_PER_CALL, MAX_NULLIFIERS_PER_CALL,\n        MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL, MAX_PRIVATE_LOGS_PER_CALL, MAX_TX_LIFETIME,\n        NULL_MSG_SENDER_CONTRACT_ADDRESS, PRIVATE_LOG_CIPHERTEXT_LEN,\n    },\n    hash::poseidon2_hash,\n    messaging::l2_to_l1_message::L2ToL1Message,\n    side_effect::{Counted, scoped::Scoped},\n    traits::{Empty, Hash, ToField},\n    utils::arrays::{ClaimedLengthArray, trimmed_array_length_hint},\n};\n\n/// # PrivateContext\n///\n/// The **main interface** between an #[external(\"private\")] function and the Aztec blockchain.\n///\n/// An instance of the PrivateContext is initialized automatically at the outset of every private function, within the\n/// #[external(\"private\")] macro, so you'll never need to consciously instantiate this yourself.\n///\n/// The instance is always named `context`, and it is always be available within the body of every\n/// #[external(\"private\")] function in your smart contract.\n///\n/// > For those used to \"vanilla\" Noir, it might be jarring to have access to > `context` without seeing a declaration\n/// `let context = PrivateContext::new(...)` > within the body of your function. This is just a consequence of using >\n/// macros to tidy-up verbose boilerplate. You can use `nargo expand` to > expand all macros, if you dare.\n///\n/// Typical usage for a smart contract developer will be to call getter methods of the PrivateContext.\n///\n/// _Pushing_ data and requests to the context is mostly handled within aztec-nr's own functions, so typically a smart\n/// contract developer won't need to call any setter methods directly.\n///\n/// > Advanced users might occasionally wish to push data to the context > directly for lower-level control. If you\n/// find yourself doing this, please > open an issue on GitHub to describe your use case: it might be that > new\n/// functionality should be added to aztec-nr.\n///\n/// ## Responsibilities\n/// - Exposes contextual data to a private function:\n/// - Data relating to how this private function was called.\n/// - msg_sender\n/// - this_address - (the contract address of the private function being executed)\n/// - See `CallContext` for more data.\n/// - Data relating to the transaction in which this private function is being executed.\n/// - chain_id\n/// - version\n/// - gas_settings\n/// - Provides state access:\n/// - Access to the \"Anchor block\" header. Recall, a private function cannot read from the \"current\" block header, but\n/// must read from some historical block header, because as soon as private function execution begins (asynchronously,\n/// on a user's device), the public state of the chain (the \"current state\") will have progressed forward. We call this\n/// reference the \"Anchor block\". See `BlockHeader`.\n///   - Enables consumption of L1->L2 messages.\n/// - Enables calls to functions of other smart contracts:\n/// - Private function calls\n/// - Enqueueing of public function call requests (Since public functions are executed at a later time, by a block\n/// proposer, we say they are \"enqueued\").\n/// - Writes data to the blockchain:\n/// - New notes\n/// - New nullifiers\n/// - Private logs (for sending encrypted note contents or encrypted events)\n///   - New L2->L1 messages.\n/// - Provides args to the private function (handled by the #[external(\"private\")] macro).\n/// - Returns the return values of this private function (handled by the\n///   #[external(\"private\")] macro).\n/// - Makes Key Validation Requests.\n/// - Private functions are not allowed to see master secret keys, because we do not trust them. They are instead given\n/// \"app-siloed\" secret keys with a claim that they relate to a master public key. They can then request validation of\n/// this claim, by making a \"key validation request\" to the protocol's kernel circuits (which _are_ allowed to see\n/// certain master secret keys).\n///\n/// ## Advanced Responsibilities\n///\n/// - Ultimately, the PrivateContext is responsible for constructing the PrivateCircuitPublicInputs of the private\n/// function being executed. All private functions on Aztec must have public inputs which adhere to the rigid layout of\n/// the PrivateCircuitPublicInputs, in order to be compatible with the protocol's kernel circuits. A well-known\n/// misnomer:\n/// - \"public inputs\" contain both inputs and outputs of this function.\n/// - By \"outputs\" we mean a lot more side-effects than just the \"return values\" of the function.\n/// - Most of the so-called \"public inputs\" are kept _private_, and never leak to the outside world, because they are\n/// 'swallowed' by the protocol's kernel circuits before the tx is sent to the network. Only the following are exposed\n/// to the outside world:\n/// - New note_hashes\n/// - New nullifiers\n/// - New private logs\n///     - New L2->L1 messages\n/// - New enqueued public function call requests All the above-listed arrays of side-effects can be padded by the\n/// user's wallet (through instructions to the kernel circuits, via the PXE) to obscure their true lengths.\n///\n/// ## Syntax Justification\n///\n/// Both user-defined functions _and_ most functions in aztec-nr need access to the PrivateContext instance to\n/// read/write data. This is why you'll see the arguably-ugly pervasiveness of the \"context\" throughout your smart\n/// contract and the aztec-nr library. For example, `&mut context` is prevalent. In some languages, you can access and\n/// mutate a global variable (such as a PrivateContext instance) from a function without polluting the function's\n/// parameters. With Noir, a function must explicitly pass control of a mutable variable to another function, by\n/// reference. Since many functions in aztec-nr need to be able to push new data to the PrivateContext, they need to be\n/// handed a mutable reference _to_ the context as a parameter. For example, `Context` is prevalent as a generic\n/// parameter, to give better type safety at compile time. Many `aztec-nr` functions don't make sense if they're called\n/// in a particular runtime (private, public or utility), and so are intentionally only implemented over certain\n/// [Private|Public|Utility]Context structs. This gives smart contract developers a much faster feedback loop if\n/// they're making a mistake, as an error will be thrown by the LSP or when they compile their contract.\n///\n#[derive(Eq)]\npub struct PrivateContext {\n    // docs:start:private-context\n    pub inputs: PrivateContextInputs,\n    pub side_effect_counter: u32,\n\n    pub min_revertible_side_effect_counter: u32,\n    pub is_fee_payer: bool,\n\n    pub args_hash: Field,\n    pub return_hash: Field,\n\n    pub expiration_timestamp: u64,\n\n    pub(crate) note_hash_read_requests: BoundedVec<Scoped<Counted<Field>>, MAX_NOTE_HASH_READ_REQUESTS_PER_CALL>,\n    pub(crate) nullifier_read_requests: BoundedVec<Scoped<Counted<Field>>, MAX_NULLIFIER_READ_REQUESTS_PER_CALL>,\n    key_validation_requests_and_separators: BoundedVec<KeyValidationRequestAndSeparator, MAX_KEY_VALIDATION_REQUESTS_PER_CALL>,\n\n    pub note_hashes: BoundedVec<Counted<NoteHash>, MAX_NOTE_HASHES_PER_CALL>,\n    pub nullifiers: BoundedVec<Counted<Nullifier>, MAX_NULLIFIERS_PER_CALL>,\n\n    pub private_call_requests: BoundedVec<PrivateCallRequest, MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL>,\n    pub public_call_requests: BoundedVec<Counted<PublicCallRequest>, MAX_ENQUEUED_CALLS_PER_CALL>,\n    pub public_teardown_call_request: PublicCallRequest,\n    pub l2_to_l1_msgs: BoundedVec<Counted<L2ToL1Message>, MAX_L2_TO_L1_MSGS_PER_CALL>,\n    // docs:end:private-context\n\n    // Header of a block whose state is used during private execution (not the block the transaction is included in).\n    pub anchor_block_header: BlockHeader,\n\n    pub private_logs: BoundedVec<Counted<PrivateLogData>, MAX_PRIVATE_LOGS_PER_CALL>,\n    pub contract_class_logs_hashes: BoundedVec<Counted<LogHash>, MAX_CONTRACT_CLASS_LOGS_PER_CALL>,\n\n    // Contains the last key validation request for each key type. This is used to cache the last request and avoid\n    // fetching the same request multiple times. The index of the array corresponds to the key type (0 nullifier, 1\n    // incoming, 2 outgoing, 3 tagging).\n    pub last_key_validation_requests: [Option<KeyValidationRequest>; NUM_KEY_TYPES],\n\n    pub expected_non_revertible_side_effect_counter: u32,\n    pub expected_revertible_side_effect_counter: u32,\n}\n\nimpl PrivateContext {\n    pub fn new(inputs: PrivateContextInputs, args_hash: Field) -> PrivateContext {\n        PrivateContext {\n            inputs,\n            side_effect_counter: inputs.start_side_effect_counter + 1,\n            min_revertible_side_effect_counter: 0,\n            is_fee_payer: false,\n            args_hash,\n            return_hash: 0,\n            expiration_timestamp: inputs.anchor_block_header.timestamp() + MAX_TX_LIFETIME,\n            note_hash_read_requests: BoundedVec::new(),\n            nullifier_read_requests: BoundedVec::new(),\n            key_validation_requests_and_separators: BoundedVec::new(),\n            note_hashes: BoundedVec::new(),\n            nullifiers: BoundedVec::new(),\n            anchor_block_header: inputs.anchor_block_header,\n            private_call_requests: BoundedVec::new(),\n            public_call_requests: BoundedVec::new(),\n            public_teardown_call_request: PublicCallRequest::empty(),\n            l2_to_l1_msgs: BoundedVec::new(),\n            private_logs: BoundedVec::new(),\n            contract_class_logs_hashes: BoundedVec::new(),\n            last_key_validation_requests: [Option::none(); NUM_KEY_TYPES],\n            expected_non_revertible_side_effect_counter: 0,\n            expected_revertible_side_effect_counter: 0,\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: Since Aztec doesn't have a concept of an EoA (Externally-owned Account), the msg_sender is\n    /// \"none\" 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\n    /// or 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    pub fn maybe_msg_sender(self) -> Option<AztecAddress> {\n        let maybe_msg_sender = self.inputs.call_context.msg_sender;\n        if maybe_msg_sender == NULL_MSG_SENDER_CONTRACT_ADDRESS {\n            Option::none()\n        } else {\n            Option::some(maybe_msg_sender)\n        }\n    }\n\n    /// Returns the contract address of the current function being executed.\n    ///\n    /// This is equivalent to `address(this)` in Solidity (hence the name). Use this to identify the current contract's\n    /// address, commonly needed for access control or when interacting with other contracts.\n    ///\n    /// # Returns\n    /// * `AztecAddress` - The contract address of the current function being executed.\n    ///\n    pub fn this_address(self) -> AztecAddress {\n        self.inputs.call_context.contract_address\n    }\n\n    /// Returns the chain ID of the current network.\n    ///\n    /// This is similar to `block.chainid` in Solidity. Returns the unique identifier for the blockchain network this\n    /// transaction is executing on.\n    ///\n    /// Helps prevent cross-chain replay attacks. Useful if implementing multi-chain contract logic.\n    ///\n    /// # Returns\n    /// * `Field` - The chain ID as a field element\n    ///\n    pub fn chain_id(self) -> Field {\n        self.inputs.tx_context.chain_id\n    }\n\n    /// Returns the Aztec protocol version that this transaction is executing under. Different versions may have\n    /// different rules, opcodes, or cryptographic primitives.\n    ///\n    /// This is similar to how Ethereum has different EVM versions.\n    ///\n    /// Useful for forward/backward compatibility checks\n    ///\n    /// Not to be confused with contract versions; this is the protocol version.\n    ///\n    /// # Returns\n    /// * `Field` - The protocol version as a field element\n    ///\n    pub fn version(self) -> Field {\n        self.inputs.tx_context.version\n    }\n\n    /// Returns the gas settings for the current transaction.\n    ///\n    /// This provides information about gas limits and pricing for the transaction, similar to `tx.gasprice` and gas\n    /// limits in Ethereum. However, Aztec has a more sophisticated gas model with separate accounting for L2\n    /// computation and data availability (DA) costs.\n    ///\n    /// # Returns\n    /// * `GasSettings` - Struct containing gas limits and fee information\n    ///\n    pub fn gas_settings(self) -> GasSettings {\n        self.inputs.tx_context.gas_settings\n    }\n\n    /// Returns the function selector of the currently executing function.\n    ///\n    /// Low-level function: Ordinarily, smart contract developers will not need to access this.\n    ///\n    /// This is similar to `msg.sig` in Solidity, which returns the first 4 bytes of the function signature. In Aztec,\n    /// the selector uniquely identifies which function within the contract is being called.\n    ///\n    /// # Returns\n    /// * `FunctionSelector` - The 4-byte function identifier\n    ///\n    /// # Advanced\n    /// Only #[external(\"private\")] functions have a function selector as a protocol- enshrined concept. The function\n    /// selectors of private functions are baked into the preimage of the contract address, and are used by the\n    /// protocol's kernel circuits to identify each private function and ensure the correct one is being executed.\n    ///\n    /// Used internally for function dispatch and call verification.\n    ///\n    pub fn selector(self) -> FunctionSelector {\n        self.inputs.call_context.function_selector\n    }\n\n    /// Returns the hash of the arguments passed to the current function.\n    ///\n    /// Very low-level function: You shouldn't need to call this. The #[external(\"private\")] macro calls this, and it\n    /// makes the arguments neatly available to the body of your private function.\n    ///\n    /// # Returns\n    /// * `Field` - Hash of the function arguments\n    ///\n    /// # Advanced\n    /// * Arguments are hashed to reduce proof size and verification time\n    /// * Enables efficient argument passing in recursive function calls\n    /// * The hash can be used to retrieve the original arguments from the PXE.\n    ///\n    pub fn get_args_hash(self) -> Field {\n        self.args_hash\n    }\n\n    /// Pushes a new note_hash to the Aztec blockchain's global Note Hash Tree (a state tree).\n    ///\n    /// A note_hash is a commitment to a piece of private state.\n    ///\n    /// Low-level function: Ordinarily, smart contract developers will not need to manually call this. Aztec-nr's state\n    /// variables (see `../state_vars/`) are designed to understand when to create and push new note hashes.\n    ///\n    /// # Arguments\n    /// * `note_hash` - The new note_hash.\n    ///\n    /// # Advanced\n    /// From here, the protocol's kernel circuits will take over and insert the note_hash into the protocol's \"note\n    /// hash tree\" (in the Base Rollup circuit). Before insertion, the protocol will:\n    /// - \"Silo\" the `note_hash` with the contract address of this function, to yield a `siloed_note_hash`. This\n    /// prevents state collisions between different smart contracts.\n    /// - Ensure uniqueness of the `siloed_note_hash`, to prevent Faerie-Gold attacks, by hashing the\n    /// `siloed_note_hash` with a unique value, to yield a `unique_siloed_note_hash` (see the protocol spec for more).\n    ///\n    /// In addition to calling this function, aztec-nr provides the contents of the newly-created note to the PXE, via\n    /// the `notify_created_note` oracle.\n    ///\n    /// > Advanced users might occasionally wish to push data to the context > directly for lower-level control. If you\n    /// find yourself doing this, > please open an issue on GitHub to describe your use case: it might be > that new\n    /// functionality should be added to aztec-nr.\n    ///\n    pub fn push_note_hash(&mut self, note_hash: Field) {\n        self.note_hashes.push(Counted::new(note_hash, self.next_counter()));\n    }\n\n    /// Creates a new [nullifier](crate::nullifier).\n    ///\n    /// ## Safety\n    ///\n    /// This is a low-level function that must be used with great care to avoid subtle corruption of contract state.\n    /// Instead of calling this function, consider using the higher-level [`crate::state_vars::SingleUseClaim`].\n    ///\n    /// In particular, callers must ensure all nullifiers created by a contract are properly domain-separated, so that\n    /// unrelated components don't interfere with one another (e.g. a transaction nullifier accidentally marking a\n    /// variable as initialized). Only [`PrivateContext::push_nullifier_for_note_hash`] should be used for note\n    /// nullifiers, never this one.\n    ///\n    /// ## Advanced\n    ///\n    /// The raw `nullifier` is not what is inserted into the Aztec state tree: it will be first siloed by contract\n    /// address via [`crate::protocol::hash::compute_siloed_nullifier`] in order to prevent accidental or malicious\n    /// interference of nullifiers from different contracts.\n    pub fn push_nullifier(&mut self, nullifier: Field) {\n        notify_created_nullifier(nullifier);\n        self.nullifiers.push(Nullifier { value: nullifier, note_hash: 0 }.count(self.next_counter()));\n    }\n\n    /// Creates a new [nullifier](crate::nullifier) associated with a note.\n    ///\n    /// This is a variant of [`PrivateContext::push_nullifier`] that is used for note nullifiers, i.e. nullifiers that\n    /// correspond to a note. If a note and its nullifier are created in the same transaction, then the private kernels\n    /// will 'squash' these values, deleting them both as if they never existed and reducing transaction fees.\n    ///\n    /// The `nullification_note_hash` must be the result of calling\n    /// [`crate::note::utils::compute_confirmed_note_hash_for_nullification`] for pending notes, and `0` for settled\n    /// notes (which cannot be squashed).\n    ///\n    /// ## Safety\n    ///\n    /// This is a low-level function that must be used with great care to avoid subtle corruption of contract state.\n    /// Instead of calling this function, consider using the higher-level [`crate::note::lifecycle::destroy_note`].\n    ///\n    /// The precautions listed for [`PrivateContext::push_nullifier`] apply here as well, and callers should\n    /// additionally ensure `nullification_note_hash` corresponds to a note emitted by this contract, with its hash\n    /// computed in the same transaction execution phase as the call to this function. Finally, only this function\n    /// should be used for note nullifiers, never [`PrivateContext::push_nullifier`].\n    ///\n    /// Failure to do these things can result in unprovable contexts, accidental deletion of notes, or double-spend\n    /// attacks.\n    pub fn push_nullifier_for_note_hash(&mut self, nullifier: Field, nullification_note_hash: Field) {\n        let nullifier_counter = self.next_counter();\n        notify_nullified_note(nullifier, nullification_note_hash, nullifier_counter);\n        self.nullifiers.push(Nullifier { value: nullifier, note_hash: nullification_note_hash }.count(\n            nullifier_counter,\n        ));\n    }\n\n    /// Returns the anchor block header - the historical block header that this private function is reading from.\n    ///\n    /// A private function CANNOT read from the \"current\" block header, but must read from some older block header,\n    /// because as soon as private function execution begins (asynchronously, on a user's device), the public state of\n    /// the chain (the \"current state\") will have progressed forward.\n    ///\n    /// # Returns\n    /// * `BlockHeader` - The anchor block header.\n    ///\n    /// # Advanced\n    /// * All private functions of a tx read from the same anchor block header.\n    /// * The protocol asserts that the `expiration_timestamp` of every tx is at most 24 hours beyond the timestamp of\n    /// the tx's chosen anchor block header. This enables the network's nodes to safely prune old txs from the mempool.\n    /// Therefore, the chosen block header _must_ be one from within the last 24 hours.\n    ///\n    pub fn get_anchor_block_header(self) -> BlockHeader {\n        self.anchor_block_header\n    }\n\n    /// Returns the header of any historical block at or before the anchor block.\n    ///\n    /// This enables private contracts to access information from even older blocks than the anchor block header.\n    ///\n    /// Useful for time-based contract logic that needs to compare against multiple historical points.\n    ///\n    /// # Arguments\n    /// * `block_number` - The block number to retrieve (must be <= anchor block number)\n    ///\n    /// # Returns\n    /// * `BlockHeader` - The header of the requested historical block\n    ///\n    /// # Advanced\n    /// This function uses an oracle to fetch block header data from the user's PXE. Depending on how much blockchain\n    /// data the user's PXE has been set up to store, this might require a query from the PXE to another Aztec node to\n    /// get the data. > This is generally true of all oracle getters (see `../oracle`).\n    ///\n    /// Each block header gets hashed and stored as a leaf in the protocol's Archive Tree. In fact, the i-th block\n    /// header gets stored at the i-th leaf index of the Archive Tree. Behind the scenes, this `get_block_header_at`\n    /// function will add Archive Tree merkle-membership constraints (~3k) to your smart contract function's circuit,\n    /// to prove existence of the block header in the Archive Tree.\n    ///\n    /// Note: we don't do any caching, so avoid making duplicate calls for the same block header, because each call\n    /// will add duplicate constraints.\n    ///\n    /// Calling this function is more expensive (constraint-wise) than getting the anchor block header (via\n    /// `get_block_header`). This is because the anchor block's merkle membership proof is handled by Aztec's protocol\n    /// circuits, and is only performed once for the entire tx because all private functions of a tx share a common\n    /// anchor block header. Therefore, the cost (constraint-wise) of calling `get_block_header` is effectively free.\n    ///\n    pub fn get_block_header_at(self, block_number: u32) -> BlockHeader {\n        get_block_header_at(block_number, self)\n    }\n\n    /// Sets the hash of the return values for this private function.\n    ///\n    /// Very low-level function: this is called by the #[external(\"private\")] macro.\n    ///\n    /// # Arguments\n    /// * `serialized_return_values` - The serialized return values as a field array\n    ///\n    pub fn set_return_hash<let N: u32>(&mut self, serialized_return_values: [Field; N]) {\n        let return_hash = hash_args(serialized_return_values);\n        self.return_hash = return_hash;\n        execution_cache::store(serialized_return_values, return_hash);\n    }\n\n    /// Builds the PrivateCircuitPublicInputs for this private function, to ensure compatibility with the protocol's\n    /// kernel circuits.\n    ///\n    /// Very low-level function: This function is automatically called by the #[external(\"private\")] macro.\n    pub fn finish(self) -> PrivateCircuitPublicInputs {\n        PrivateCircuitPublicInputs {\n            call_context: self.inputs.call_context,\n            args_hash: self.args_hash,\n            returns_hash: self.return_hash,\n            min_revertible_side_effect_counter: self.min_revertible_side_effect_counter,\n            is_fee_payer: self.is_fee_payer,\n            expiration_timestamp: self.expiration_timestamp,\n            note_hash_read_requests: ClaimedLengthArray::from_bounded_vec(self.note_hash_read_requests),\n            nullifier_read_requests: ClaimedLengthArray::from_bounded_vec(self.nullifier_read_requests),\n            key_validation_requests_and_separators: ClaimedLengthArray::from_bounded_vec(\n                self.key_validation_requests_and_separators,\n            ),\n            note_hashes: ClaimedLengthArray::from_bounded_vec(self.note_hashes),\n            nullifiers: ClaimedLengthArray::from_bounded_vec(self.nullifiers),\n            private_call_requests: ClaimedLengthArray::from_bounded_vec(self.private_call_requests),\n            public_call_requests: ClaimedLengthArray::from_bounded_vec(self.public_call_requests),\n            public_teardown_call_request: self.public_teardown_call_request,\n            l2_to_l1_msgs: ClaimedLengthArray::from_bounded_vec(self.l2_to_l1_msgs),\n            start_side_effect_counter: self.inputs.start_side_effect_counter,\n            end_side_effect_counter: self.side_effect_counter,\n            private_logs: ClaimedLengthArray::from_bounded_vec(self.private_logs),\n            contract_class_logs_hashes: ClaimedLengthArray::from_bounded_vec(self.contract_class_logs_hashes),\n            anchor_block_header: self.anchor_block_header,\n            tx_context: self.inputs.tx_context,\n            expected_non_revertible_side_effect_counter: self.expected_non_revertible_side_effect_counter,\n            expected_revertible_side_effect_counter: self.expected_revertible_side_effect_counter,\n        }\n    }\n\n    /// Designates this contract as the fee payer for the transaction.\n    ///\n    /// Unlike Ethereum, where the transaction sender always pays fees, Aztec allows any contract to voluntarily pay\n    /// transaction fees. This enables patterns like sponsored transactions or fee abstraction where users don't need\n    /// to hold fee-juice themselves. (Fee juice is a fee-paying asset for Aztec).\n    ///\n    /// Only one contract per transaction can declare itself as the fee payer, and it must have sufficient fee-juice\n    /// balance (>= the gas limits specified in the TxContext) by the time we reach the public setup phase of the tx.\n    ///\n    pub fn set_as_fee_payer(&mut self) {\n        aztecnr_trace_log_format!(\"Setting {0} as fee payer\")([self.this_address().to_field()]);\n        self.is_fee_payer = true;\n    }\n\n    pub fn in_revertible_phase(&mut self) -> bool {\n        let current_counter = self.side_effect_counter;\n\n        // Safety: Kernel will validate that the claim is correct by validating the expected counters.\n        let is_revertible = unsafe { is_execution_in_revertible_phase(current_counter) };\n\n        if is_revertible {\n            if (self.expected_revertible_side_effect_counter == 0)\n                | (current_counter < self.expected_revertible_side_effect_counter) {\n                self.expected_revertible_side_effect_counter = current_counter;\n            }\n        } else if current_counter > self.expected_non_revertible_side_effect_counter {\n            self.expected_non_revertible_side_effect_counter = current_counter;\n        }\n\n        is_revertible\n    }\n\n    /// Declares the end of the \"setup phase\" of this tx.\n    ///\n    /// Only one function per tx can declare the end of the setup phase.\n    ///\n    /// Niche function: Only wallet developers and paymaster contract developers (aka Fee-payment contracts) will need\n    /// to make use of this function.\n    ///\n    /// Aztec supports a three-phase execution model: setup, app logic, teardown. The phases exist to enable a fee\n    /// payer to take on the risk of paying a transaction fee, safe in the knowledge that their payment (in whatever\n    /// token or method the user chooses) will succeed, regardless of whether the app logic will succeed. The \"setup\"\n    /// phase enables such a payment to be made, because the setup phase _cannot revert_: a reverting function within\n    /// the setup phase would result in an invalid block which cannot be proven. Any side-effects generated during that\n    /// phase are guaranteed to be inserted into Aztec's state trees (except for squashed notes & nullifiers, of\n    /// course).\n    ///\n    /// Even though the end of the setup phase is declared within a private function, you might have noticed that\n    /// _public_ functions can also execute within the setup phase. This is because any public function calls which\n    /// were enqueued _within the setup phase_ by a private function are considered part of the setup phase.\n    ///\n    /// # Advanced\n    /// * Sets the minimum revertible side effect counter of this tx to be the PrivateContext's _current_ side effect\n    /// counter.\n    ///\n    pub fn end_setup(&mut self) {\n        // Incrementing the side effect counter when ending setup ensures non ambiguity for the counter where we change\n        // phases.\n        self.side_effect_counter += 1;\n        aztecnr_trace_log_format!(\"Ending setup at counter {0}\")([self.side_effect_counter as Field]);\n        self.min_revertible_side_effect_counter = self.next_counter();\n        notify_revertible_phase_start(self.min_revertible_side_effect_counter);\n    }\n\n    /// Sets a deadline (an \"include-by timestamp\") for when this transaction must be included in a block.\n    ///\n    /// Other functions in this tx might call this setter with differing values for the include-by timestamp. To ensure\n    /// that all functions' deadlines are met, the _minimum_ of all these include-by timestamps will be exposed when\n    /// this tx is submitted to the network.\n    ///\n    /// If the transaction is not included in a block by its include-by timestamp, it becomes invalid and it will never\n    /// be included.\n    ///\n    /// This expiry timestamp is publicly visible. See the \"Advanced\" section for privacy concerns.\n    ///\n    /// # Arguments\n    /// * `expiration_timestamp` - Unix timestamp (seconds) deadline for inclusion. The include-by timestamp of this tx\n    /// will be _at most_ the timestamp specified.\n    ///\n    /// # Advanced\n    /// * If multiple functions set differing `expiration_timestamp`s, the kernel circuits will set it to be the\n    /// _minimum_ of the two. This ensures the tx expiry requirements of all functions in the tx are met.\n    /// * Rollup circuits will reject expired txs.\n    /// * The protocol enforces that all transactions must be included within 24 hours of their chosen anchor block's\n    /// timestamp, to enable safe mempool pruning.\n    /// * The DelayedPublicMutable design makes heavy use of this functionality, to enable private functions to read\n    /// public state.\n    /// * A sophisticated Wallet should cleverly set an include-by timestamp to improve the privacy of the user and the\n    /// network as a whole. For example, if a contract interaction sets include-by to some publicly-known value (e.g.\n    /// the time when a contract upgrades), then the wallet might wish to set an even lower one to avoid revealing that\n    /// this tx is interacting with said contract. Ideally, all wallets should standardize on an approach in order to\n    ///   provide users with a large privacy set -- although the exact approach\n    /// will need to be discussed. Wallets that deviate from a standard might accidentally reveal which wallet each\n    /// transaction originates from.\n    ///\n    // docs:start:expiration-timestamp\n    pub fn set_expiration_timestamp(&mut self, expiration_timestamp: u64) {\n        // docs:end:expiration-timestamp\n        self.expiration_timestamp = std::cmp::min(self.expiration_timestamp, expiration_timestamp);\n    }\n\n    /// Asserts that a note has been created.\n    ///\n    /// This function will cause the transaction to fail unless the requested note exists. This is the preferred\n    /// mechanism for performing this check, and the only one that works for pending notes.\n    ///\n    /// ## Pending Notes\n    ///\n    /// Both settled notes (created in prior transactions) and pending notes (created in the current transaction) will\n    /// be considered by this function. Pending notes must have been created **before** this call is made for the check\n    /// to pass.\n    ///\n    /// ## Historical Notes\n    ///\n    /// If you need to assert that a note existed _by some specific block in the past_, instead of simply proving that\n    /// it exists by the current anchor block, use [`crate::history::note::assert_note_existed_by`] instead.\n    ///\n    /// ## Cost\n    ///\n    /// This uses up one of the call's kernel note hash read requests, which are limited. Like all kernel requests,\n    /// proving time costs are only incurred when the total number of requests exceeds the kernel's capacity, requiring\n    /// an additional invocation of the kernel reset circuit.\n    pub fn assert_note_exists(&mut self, note_existence_request: NoteExistenceRequest) {\n        // Note that the `note_hash_read_requests` array does not hold `NoteExistenceRequest` objects, but rather a\n        // custom kernel type. We convert from the aztec-nr type into it.\n\n        let note_hash = note_existence_request.note_hash();\n        let contract_address = note_existence_request.maybe_contract_address().unwrap_or(AztecAddress::zero());\n\n        let side_effect = Scoped::new(\n            Counted::new(note_hash, self.next_counter()),\n            contract_address,\n        );\n\n        self.note_hash_read_requests.push(side_effect);\n    }\n\n    /// Asserts that a nullifier has been emitted.\n    ///\n    /// This function will cause the transaction to fail unless the requested nullifier exists. This is the preferred\n    /// mechanism for performing this check, and the only one that works for pending nullifiers.\n    ///\n    /// ## Pending Nullifiers\n    ///\n    /// Both settled nullifiers (emitted in prior transactions) and pending nullifiers (emitted in the current\n    /// transaction) will be considered by this function. Pending nullifiers must have been emitted **before** this\n    /// call is made for the check to pass.\n    ///\n    /// ## Historical Nullifiers\n    ///\n    /// If you need to assert that a nullifier existed _by some specific block in the past_, instead of simply proving\n    /// that it exists by the current anchor block, use [`crate::history::nullifier::assert_nullifier_existed_by`]\n    /// instead.\n    ///\n    /// ## Public vs Private\n    ///\n    /// In general, it is unsafe to check for nullifier non-existence in private, as that will not consider the\n    /// possibility of the nullifier having been emitted in any transaction between the anchor block and the inclusion\n    /// block. Private functions instead prove existence via this function and 'prove' non-existence by _emitting_ the\n    /// nullifer, which would cause the transaction to fail if the nullifier existed.\n    ///\n    /// This is not the case in public functions, which do have access to the tip of the blockchain and so can reliably\n    /// prove whether a nullifier exists or not via\n    /// [`crate::context::public_context::PublicContext::nullifier_exists_unsafe`].\n    ///\n    /// ## Cost\n    ///\n    /// This uses up one of the call's kernel nullifier read requests, which are limited. Like all kernel requests,\n    /// proving time costs are only incurred when the total number of requests exceeds the kernel's capacity, requiring\n    /// an additional invocation of the kernel reset circuit.\n    pub fn assert_nullifier_exists(&mut self, nullifier_existence_request: NullifierExistenceRequest) {\n        let nullifier = nullifier_existence_request.nullifier();\n        let contract_address = nullifier_existence_request.maybe_contract_address().unwrap_or(AztecAddress::zero());\n\n        let request = Scoped::new(\n            Counted::new(nullifier, self.next_counter()),\n            contract_address,\n        );\n\n        self.nullifier_read_requests.push(request);\n    }\n\n    /// Requests the app-siloed nullifier hiding key (nhk_app) for the given (hashed) master nullifier public key\n    /// (npk_m), from the user's PXE.\n    ///\n    /// Advanced function: Only needed if you're designing your own notes and/or nullifiers.\n    ///\n    /// Contracts are not allowed to compute nullifiers for other contracts, as that would let them read parts of their\n    /// private state. Because of this, a contract is only given an \"app-siloed key\", which is constructed by\n    /// hashing the user's master nullifier hiding key with the contract's address. However, because contracts cannot\n    /// be trusted with a user's master nullifier hiding key (because we don't know which contracts are honest or\n    /// malicious), the PXE refuses to provide any master secret keys to any app smart contract function. This means\n    /// app functions are unable to prove that the derivation of an app-siloed nullifier hiding key has been computed\n    /// correctly. Instead, an app function can request to the kernel (via `request_nhk_app`) that it validates the\n    /// siloed derivation, since the kernel has been vetted to not leak any master secret keys.\n    ///\n    /// A common nullification scheme is to inject a nullifier hiding key into the preimage of a nullifier, to make the\n    /// nullifier deterministic but random-looking. This function enables that flow.\n    ///\n    /// # Arguments\n    /// * `npk_m_hash` - A hash of the master nullifier public key of the user whose PXE is executing this function.\n    ///\n    /// # Returns\n    /// * The app-siloed nullifier hiding key that corresponds to the given `npk_m_hash`.\n    ///\n    pub fn request_nhk_app(&mut self, npk_m_hash: Field) -> Field {\n        self.request_sk_app(npk_m_hash, NULLIFIER_INDEX)\n    }\n\n    /// Requests the app-siloed nullifier secret key (nsk_app) for the given (hashed) master nullifier public key\n    /// (npk_m), from the user's PXE.\n    ///\n    /// See `request_nsk_app` and `request_sk_app` for more info.\n    ///\n    /// The intention of the \"outgoing\" keypair is to provide a second secret key for all of a user's outgoing activity\n    /// (i.e. for notes that a user creates, as opposed to notes that a user receives from others). The separation of\n    /// incoming and outgoing data was a distinction made by zcash, with the intention of enabling a user to optionally\n    /// share with a 3rd party a controlled view of only incoming or outgoing notes. Similar functionality of sharing\n    /// select data can be achieved with offchain zero-knowledge proofs. It is up to an app developer whether they\n    /// choose to make use of a user's outgoing keypair within their application logic, or instead simply use the same\n    /// keypair (the address keypair (which is effectively the same as the \"incoming\" keypair)) for all incoming &\n    /// outgoing messages to a user.\n    ///\n    /// Currently, all of the exposed encryption functions in aztec-nr ignore the outgoing viewing keys, and instead\n    /// encrypt all note logs and event logs to a user's address public key.\n    ///\n    /// # Arguments\n    /// * `ovpk_m_hash` - Hash of the outgoing viewing public key master\n    ///\n    /// # Returns\n    /// * The application-specific outgoing viewing secret key\n    ///\n    pub fn request_ovsk_app(&mut self, ovpk_m_hash: Field) -> Field {\n        self.request_sk_app(ovpk_m_hash, OUTGOING_INDEX)\n    }\n\n    /// Pushes a Key Validation Request to the kernel.\n    ///\n    /// Private functions are not allowed to see a user's master secret keys, because we do not trust them. They are\n    /// instead given \"app-siloed\" secret keys with a claim that they relate to a master public key. They can then\n    /// request validation of this claim, by making a \"key validation request\" to the protocol's kernel circuits (which\n    /// _are_ allowed to see certain master secret keys).\n    ///\n    /// When a Key Validation Request tuple of (sk_app, Pk_m, app_address) is submitted to the kernel, it will perform\n    /// the following derivations to validate the relationship between the claimed sk_app and the user's Pk_m:\n    ///\n    ///       (sk_m) ----> * G ----> Pk_m\n    ///         |                     |\n    ///         v                       We use the kernel to prove this\n    ///  h(sk_m, app_address)         | sk_app-Pk_m relationship, because app\n    ///         |                       circuits must not be trusted to see sk_m.\n    ///         v                     |\n    /// sk_app - -  - - - - - - -\n    ///\n    /// The function is named \"request_\" instead of \"get_\" to remind the user that a Key Validation Request will be\n    /// emitted to the kernel.\n    ///\n    fn request_sk_app(&mut self, pk_m_hash: Field, key_index: Field) -> Field {\n        let cached_request =\n            self.last_key_validation_requests[key_index as u32].unwrap_or(KeyValidationRequest::empty());\n\n        if cached_request.pk_m.hash() == pk_m_hash {\n            // We get a match so the cached request is the latest one\n            cached_request.sk_app\n        } else {\n            // We didn't get a match meaning the cached result is stale Typically we'd validate keys by showing that\n            // they are the preimage of `pk_m_hash`, but that'd require the oracle returning the master secret keys,\n            // which could cause malicious contracts to leak it or learn about secrets from other contracts. We\n            // therefore silo secret keys, and rely on the private kernel to validate that we siloed secret key\n            // corresponds to correct siloing of the master secret key that hashes to `pk_m_hash`.\n\n            // Safety: Kernels verify that the key validation request is valid and below we verify that a request for\n            // the correct public key has been received.\n            let request = unsafe { get_key_validation_request(pk_m_hash, key_index) };\n            assert(!request.pk_m.is_infinite, \"Infinite public key points are not allowed\");\n            assert_eq(request.pk_m.hash(), pk_m_hash, \"Obtained invalid key validation request\");\n\n            self.key_validation_requests_and_separators.push(\n                KeyValidationRequestAndSeparator {\n                    request,\n                    key_type_domain_separator: public_key_domain_separators[key_index as u32],\n                },\n            );\n            self.last_key_validation_requests[key_index as u32] = Option::some(request);\n            request.sk_app\n        }\n    }\n\n    /// Sends an \"L2 -> L1 message\" from this function (Aztec, L2) to a smart contract on Ethereum (L1). L1 contracts\n    /// which are designed to send/receive messages to/from Aztec are called \"Portal Contracts\".\n    ///\n    /// Common use cases include withdrawals, cross-chain asset transfers, and triggering L1 actions based on L2 state\n    /// changes.\n    ///\n    /// The message will be inserted into an Aztec \"Outbox\" contract on L1, when this transaction's block is proposed\n    /// to L1. Sending the message will not result in any immediate state changes in the target portal contract. The\n    /// message will need to be manually consumed from the Outbox through a separate Ethereum transaction: a user will\n    /// need to call a function of the portal contract -- a function specifically designed to make a call to the Outbox\n    /// to consume the message. The message will only be available for consumption once the _epoch_ proof has been\n    /// submitted. Given that there are multiple Aztec blocks within an epoch, it might take some time for this epoch\n    /// proof to be submitted -- especially if the block was near the start of an epoch.\n    ///\n    /// # Arguments\n    /// * `recipient` - Ethereum address that will receive the message\n    /// * `content` - Message content (32 bytes as a Field element). This content has a very\n    /// specific layout. docs:start:context_message_portal\n    pub fn message_portal(&mut self, recipient: EthAddress, content: Field) {\n        let message = L2ToL1Message { recipient, content };\n        self.l2_to_l1_msgs.push(message.count(self.next_counter()));\n    }\n\n    /// Consumes a message sent from Ethereum (L1) to Aztec (L2).\n    ///\n    /// Common use cases include token bridging, cross-chain governance, and triggering L2 actions based on L1 events.\n    ///\n    /// Use this function if you only want the message to ever be \"referred to\" once. Once consumed using this method,\n    /// the message cannot be consumed again, because a nullifier is emitted. If your use case wants for the message to\n    /// be read unlimited times, then you can always read any historic message from the L1-to-L2 messages tree;\n    /// messages never technically get deleted from that tree.\n    ///\n    /// The message will first be inserted into an Aztec \"Inbox\" smart contract on L1. Sending the message will not\n    /// result in any immediate state changes in the target L2 contract. The message will need to be manually consumed\n    /// by the target contract through a separate Aztec transaction. The message will not be available for consumption\n    /// immediately. Messages get copied over from the L1 Inbox to L2 by the next Proposer in batches. So you will need\n    /// to wait until the messages are copied before you can consume them.\n    ///\n    /// # Arguments\n    /// * `content` - The message content that was sent from L1\n    /// * `secret` - Secret value used for message privacy (if needed)\n    /// * `sender` - Ethereum address that sent the message\n    /// * `leaf_index` - Index of the message in the L1-to-L2 message tree\n    ///\n    /// # Advanced\n    /// Validates message existence in the L1-to-L2 message tree and nullifies the message to prevent\n    /// double-consumption.\n    pub fn consume_l1_to_l2_message(&mut self, content: Field, secret: Field, sender: EthAddress, leaf_index: Field) {\n        let nullifier = process_l1_to_l2_message(\n            self.anchor_block_header.state.l1_to_l2_message_tree.root,\n            self.this_address(),\n            sender,\n            self.chain_id(),\n            self.version(),\n            content,\n            secret,\n            leaf_index,\n        );\n\n        // Push nullifier (and the \"commitment\" corresponding to this can be \"empty\")\n        self.push_nullifier(nullifier)\n    }\n\n    /// Emits a private log (an array of Fields) that will be published to an Ethereum blob.\n    ///\n    /// Private logs are intended for the broadcasting of ciphertexts: that is, encrypted events or encrypted note\n    /// contents. Since the data in the logs is meant to be _encrypted_, private_logs are broadcast to publicly-visible\n    /// Ethereum blobs. The intended recipients of such encrypted messages can then discover and decrypt these\n    /// encrypted logs using their viewing secret key. (See `../messages/discovery` for more details).\n    ///\n    /// Important note: This function DOES NOT _do_ any encryption of the input `log` fields. This function blindly\n    /// publishes whatever input `log` data is fed into it, so the caller of this function should have already\n    /// performed the encryption, and the `log` should be the result of that encryption.\n    ///\n    /// The protocol does not dictate what encryption scheme should be used: a smart contract developer can choose\n    /// whatever encryption scheme they like. Aztec-nr includes some off-the-shelf encryption libraries that developers\n    /// might wish to use, for convenience. These libraries not only encrypt a plaintext (to produce a ciphertext);\n    /// they also prepend the ciphertext with a `tag` and `ephemeral public key` for easier message discovery. This is\n    /// a very dense topic, and we will be writing more libraries and docs soon.\n    ///\n    /// > Currently, AES128 CBC encryption is the main scheme included in > aztec.nr. > We are currently making\n    /// significant changes to the interfaces of the > encryption library.\n    ///\n    /// In some niche use cases, an app might be tempted to publish _un-encrypted_ data via a private log, because\n    /// _public logs_ are not available to private functions. Be warned that emitting public data via private logs is\n    /// strongly discouraged, and is considered a \"privacy anti-pattern\", because it reveals identifiable information\n    /// about _which_ function has been executed. A tx which leaks such information does not contribute to the privacy\n    /// set of the network.\n    ///\n    /// * Unlike `emit_raw_note_log_unsafe`, this log is not tied to any specific note\n    ///\n    /// # Arguments\n    /// * `tag` - A tag placed at `fields[0]` of the emitted log. Used by recipients and nodes to identify and\n    /// filter for relevant logs without scanning all of them.\n    /// * `log` - The log data that will be publicly broadcast (so make sure it's already been encrypted before you\n    /// call this function). Private logs are bounded in size (`PRIVATE_LOG_CIPHERTEXT_LEN`), to encourage all logs\n    /// from all smart contracts look identical.\n    /// * `length` - The actual length of `log` (measured in number of Fields). Although the input log has a max\n    /// size of `PRIVATE_LOG_CIPHERTEXT_LEN`, the latter values of the array might all be 0's for small logs. This\n    /// `length` should reflect the trimmed length of the array. The protocol's kernel circuits can then append\n    /// random fields as \"padding\" after the `length`, so that the logs of this smart contract look\n    /// indistinguishable from (the same length as) the logs of all other applications. It's up to wallets how much\n    /// padding to apply, so ideally all wallets should agree on standards for this.\n    ///\n    /// ## Safety\n    ///\n    /// The `tag` should be domain-separated (e.g. via [`crate::protocol::hash::compute_log_tag`]) to prevent\n    /// collisions between logs from different sources. Without domain separation, two unrelated log types that\n    /// happen to share a raw tag value become indistinguishable. Prefer the higher-level APIs\n    /// ([`crate::messages::message_delivery::MessageDelivery`] for messages, `self.emit(event)` for events) which\n    /// handle tagging automatically.\n    pub fn emit_private_log_unsafe(&mut self, tag: Field, log: [Field; PRIVATE_LOG_CIPHERTEXT_LEN], length: u32) {\n        let counter = self.next_counter();\n        let full_log = [tag].concat(log);\n        self.private_logs.push(PrivateLogData { log: PrivateLog::new(full_log, length + 1), note_hash_counter: 0 }\n            .count(counter));\n    }\n\n    // TODO: rename.\n    /// Emits a private log that is explicitly tied to a newly-emitted note_hash, to convey to the kernel: \"this log\n    /// relates to this note\".\n    ///\n    /// This linkage is important in case the note gets squashed (due to being read later in this same tx), since we\n    /// can then squash the log as well.\n    ///\n    /// See `emit_private_log_unsafe` for more info about private log emission.\n    ///\n    /// # Arguments\n    /// * `tag` - A tag placed at `fields[0]`. See `emit_private_log_unsafe`.\n    /// * `log` - The log data as an array of Field elements\n    /// * `length` - The actual length of the `log` (measured in number of Fields).\n    /// * `note_hash_counter` - The side-effect counter that was assigned to the new note_hash when it was pushed to\n    /// this `PrivateContext`.\n    ///\n    /// Important: If your application logic requires the log to always be emitted regardless of note squashing,\n    /// consider using `emit_private_log_unsafe` instead, or emitting additional events.\n    ///\n    /// ## Safety\n    ///\n    /// Same as [`PrivateContext::emit_private_log_unsafe`]: the `tag` should be domain-separated.\n    pub fn emit_raw_note_log_unsafe(\n        &mut self,\n        tag: Field,\n        log: [Field; PRIVATE_LOG_CIPHERTEXT_LEN],\n        length: u32,\n        note_hash_counter: u32,\n    ) {\n        let counter = self.next_counter();\n        let full_log = [tag].concat(log);\n        let private_log = PrivateLogData { log: PrivateLog::new(full_log, length + 1), note_hash_counter };\n        self.private_logs.push(private_log.count(counter));\n    }\n\n    pub fn emit_contract_class_log<let N: u32>(&mut self, log: [Field; N]) {\n        let contract_address = self.this_address();\n        let counter = self.next_counter();\n\n        let log_to_emit: [Field; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS] =\n            log.concat([0; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS - N]);\n        // Note: the length is not always N, it is the number of fields we want to broadcast, omitting trailing zeros\n        // to save blob space.\n        // Safety: The below length is constrained in the base rollup, which will make sure that all the fields beyond\n        // length are zero. However, it won't be able to check that we didn't add extra padding (trailing zeroes) or\n        // that we cut trailing zeroes from the end.\n        let length = unsafe { trimmed_array_length_hint(log_to_emit) };\n        // We hash the entire padded log to ensure a user cannot pass a shorter length and so emit incorrect shorter\n        // bytecode.\n        let log_hash = poseidon2_hash(log_to_emit);\n        // Safety: the below only exists to broadcast the raw log, so we can provide it to the base rollup later to be\n        // constrained.\n        unsafe {\n            notify_created_contract_class_log(contract_address, log_to_emit, length, counter);\n        }\n\n        self.contract_class_logs_hashes.push(LogHash { value: log_hash, length: length }.count(counter));\n    }\n\n    /// Calls a private function on another contract (or the same contract).\n    ///\n    /// Very low-level function.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - Array of arguments to pass to the called function\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n    /// return values.\n    ///\n    /// This enables contracts to interact with each other while maintaining privacy. This \"composability\" of private\n    /// contract functions is a key feature of the Aztec network.\n    ///\n    /// If a user's transaction includes multiple private function calls, then by the design of Aztec, the following\n    /// information will remain private[1]:\n    /// - The function selectors and contract addresses of all private function calls will remain private, so an\n    /// observer of the public mempool will not be able to look at a tx and deduce which private functions have been\n    /// executed.\n    /// - The arguments and return values of all private function calls will 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 private function calls will (if designed\n    /// well) not leak any user secrets, nor leak which functions have been executed.\n    ///\n    /// [1] Caveats: Some of these privacy guarantees depend on how app developers design their smart contracts. Some\n    /// actions _can_ leak information, such as:\n    /// - Calling an internal public function.\n    /// - Calling a public function and not setting msg_sender to Option::none (feature not built yet - see github).\n    /// - Calling any public function will always leak details about the nature of the transaction, so devs should be\n    /// careful in their contract designs. If it can be done in a private function, then that will give the best\n    /// privacy.\n    /// - Not padding the side-effects of a tx to some standardized, uniform size. The kernel circuits can take hints\n    /// to pad side-effects, so a wallet should be able to request for a particular amount of padding. Wallets should\n    /// 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 size. See also:\n    /// 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 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_private_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n    ) -> ReturnsHash {\n        let args_hash = hash_args(args);\n        execution_cache::store(args, args_hash);\n        self.call_private_function_with_args_hash(contract_address, function_selector, args_hash, false)\n    }\n\n    /// Makes a read-only call to a private function on another contract.\n    ///\n    /// This is similar to Solidity's `staticcall`. The called function cannot modify state, emit L2->L2 messages, nor\n    /// emit events. Any nested calls are constrained to also be staticcalls.\n    ///\n    /// See `call_private_function` for more general info on private function calls.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract to call\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - Array of arguments to pass to the called function\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n    /// return values.\n    ///\n    pub fn static_call_private_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n    ) -> ReturnsHash {\n        let args_hash = hash_args(args);\n        execution_cache::store(args, args_hash);\n        self.call_private_function_with_args_hash(contract_address, function_selector, args_hash, true)\n    }\n\n    /// Calls a private function that takes no arguments.\n    ///\n    /// This is a convenience function for calling private functions that don't require any input parameters. It's\n    /// equivalent to `call_private_function` but slightly more efficient to use when no arguments are needed.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n    /// return values.\n    ///\n    pub fn call_private_function_no_args(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n    ) -> ReturnsHash {\n        self.call_private_function_with_args_hash(contract_address, function_selector, 0, false)\n    }\n\n    /// Makes a read-only call to a private function which takes no arguments.\n    ///\n    /// This combines the optimisation of `call_private_function_no_args` with the safety of\n    /// `static_call_private_function`.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n    /// return values.\n    ///\n    pub fn static_call_private_function_no_args(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n    ) -> ReturnsHash {\n        self.call_private_function_with_args_hash(contract_address, function_selector, 0, true)\n    }\n\n    /// Low-level private function call.\n    ///\n    /// This is the underlying implementation used by all other private function call methods. Instead of taking raw\n    /// arguments, it accepts a hash of the arguments.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args_hash` - Pre-computed hash of the function arguments\n    /// * `is_static_call` - Whether this should be a read-only call\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values\n    ///\n    pub fn call_private_function_with_args_hash(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args_hash: Field,\n        is_static_call: bool,\n    ) -> ReturnsHash {\n        let mut is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n        let start_side_effect_counter = self.side_effect_counter;\n\n        // Safety: The oracle simulates the private call and returns the value of the side effects counter after\n        // execution of the call (which means that end_side_effect_counter - start_side_effect_counter is the number of\n        // side effects that took place), along with the hash of the return values. We validate these by requesting a\n        // private kernel iteration in which the return values are constrained to hash to `returns_hash` and the side\n        // effects counter to increment from start to end.\n        let (end_side_effect_counter, returns_hash) = unsafe {\n            call_private_function_internal(\n                contract_address,\n                function_selector,\n                args_hash,\n                start_side_effect_counter,\n                is_static_call,\n            )\n        };\n\n        self.private_call_requests.push(\n            PrivateCallRequest {\n                call_context: CallContext {\n                    msg_sender: self.this_address(),\n                    contract_address,\n                    function_selector,\n                    is_static_call,\n                },\n                args_hash,\n                returns_hash,\n                start_side_effect_counter,\n                end_side_effect_counter,\n            },\n        );\n\n        // TODO (fees) figure out why this crashes the prover and enable it we need this in order to pay fees inside\n        // child call contexts assert(\n        //     (item.public_inputs.min_revertible_side_effect_counter == 0 as u32)\n        //     | (item.public_inputs.min_revertible_side_effect_counter\n        //         > self.min_revertible_side_effect_counter)\n        // ); if item.public_inputs.min_revertible_side_effect_counter\n        //     > self.min_revertible_side_effect_counter { self.min_revertible_side_effect_counter =\n        // item.public_inputs.min_revertible_side_effect_counter; }\n        self.side_effect_counter = end_side_effect_counter + 1; // TODO: call `next_counter`\n        // instead, for consistency\n        ReturnsHash::new(returns_hash)\n    }\n\n    /// Enqueues a call to a public function to be executed later.\n    ///\n    /// Unlike private functions which execute immediately on the user's device, public function calls are \"enqueued\"\n    /// and executed some time later by a block proposer.\n    ///\n    /// This means a public function cannot return any values back to a private function, because by the time the\n    /// public function is being executed, the private function which called it has already completed execution. (In\n    /// fact, the private function has been executed and proven, along with all other private function calls of the\n    /// user's tx. A single proof of the tx has been submitted to the Aztec network, and some time later a proposer has\n    /// picked the tx up from the mempool and begun executing all of the enqueued public functions).\n    ///\n    /// # Privacy warning Enqueueing a public function call is an inherently leaky action. Many interesting applications will require some interaction with public state, but smart contract developers should try to use public function calls sparingly, and carefully. _Internal_ public function calls are especially leaky, because they completely leak which private contract made the call. See also: https://docs.aztec.network/developers/resources/considerations/privacy_considerations\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - Array of arguments to pass to the public function\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn call_public_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n        hide_msg_sender: bool,\n    ) {\n        let calldata = [function_selector.to_field()].concat(args);\n        let calldata_hash = hash_calldata_array(calldata);\n        execution_cache::store(calldata, calldata_hash);\n        self.call_public_function_with_calldata_hash(contract_address, calldata_hash, false, hide_msg_sender)\n    }\n\n    /// Enqueues a read-only call to a public function.\n    ///\n    /// This is similar to Solidity's `staticcall`. The called function cannot modify state or emit events. Any nested\n    /// calls are constrained to also be staticcalls.\n    ///\n    /// See also `call_public_function` for more important information about making private -> public function calls.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - Array of arguments to pass to the public function\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn static_call_public_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n        hide_msg_sender: bool,\n    ) {\n        let calldata = [function_selector.to_field()].concat(args);\n        let calldata_hash = hash_calldata_array(calldata);\n        execution_cache::store(calldata, calldata_hash);\n        self.call_public_function_with_calldata_hash(contract_address, calldata_hash, true, hide_msg_sender)\n    }\n\n    /// Enqueues a call to a public function that takes no arguments.\n    ///\n    /// This is an optimisation for calling public functions that don't take any input parameters. It's otherwise\n    /// equivalent to `call_public_function`.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn call_public_function_no_args(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        hide_msg_sender: bool,\n    ) {\n        let calldata_hash = hash_calldata_array([function_selector.to_field()]);\n        self.call_public_function_with_calldata_hash(contract_address, calldata_hash, false, hide_msg_sender)\n    }\n\n    /// Enqueues a read-only call to a public function with no arguments.\n    ///\n    /// This combines the optimisation of `call_public_function_no_args` with the safety of\n    /// `static_call_public_function`.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn static_call_public_function_no_args(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        hide_msg_sender: bool,\n    ) {\n        let calldata_hash = hash_calldata_array([function_selector.to_field()]);\n        self.call_public_function_with_calldata_hash(contract_address, calldata_hash, true, hide_msg_sender)\n    }\n\n    /// Low-level public function call.\n    ///\n    /// This is the underlying implementation used by all other public function call methods. Instead of taking raw\n    /// arguments, it accepts a hash of the arguments.\n    ///\n    /// Advanced function: Most developers should use `call_public_function` or `static_call_public_function` instead.\n    /// This function is exposed for performance optimization and advanced use cases.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `calldata_hash` - Hash of the function calldata\n    /// * `is_static_call` - Whether this should be a read-only call\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn call_public_function_with_calldata_hash(\n        &mut self,\n        contract_address: AztecAddress,\n        calldata_hash: Field,\n        is_static_call: bool,\n        hide_msg_sender: bool,\n    ) {\n        let counter = self.next_counter();\n\n        let mut is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n        assert_valid_public_call_data(calldata_hash);\n\n        let msg_sender = if hide_msg_sender {\n            NULL_MSG_SENDER_CONTRACT_ADDRESS\n        } else {\n            self.this_address()\n        };\n\n        let call_request = PublicCallRequest { msg_sender, contract_address, is_static_call, calldata_hash };\n\n        self.public_call_requests.push(Counted::new(call_request, counter));\n    }\n\n    /// Enqueues a public function call, 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 (aka Fee-payment contracts) will need\n    /// to make use of this function.\n    ///\n    /// Aztec supports a three-phase execution model: setup, app logic, teardown. The phases exist to enable a fee\n    /// payer to take on the risk of paying a transaction fee, safe in the knowledge that their payment (in whatever\n    /// token or method the user chooses) will succeed, regardless of whether the app logic will succeed. The \"setup\"\n    /// phase ensures the fee payer has sufficient balance to pay the proposer their fees. The teardown phase is\n    /// primarily intended to: calculate exactly 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 tx side-effects) might exceed the refund\n    /// amount. For app logic with fairly stable and predictable gas consumption, a material refund amount is unlikely.\n    /// For app logic with unpredictable gas consumption, a refund might be important to the user (e.g. if a hefty\n    /// function reverts very early). Wallet/FPC/Paymaster developers should be mindful of this.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the teardown function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - An array of fields to pass to the function.\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    pub fn set_public_teardown_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n        hide_msg_sender: bool,\n    ) {\n        let calldata = [function_selector.to_field()].concat(args);\n        let calldata_hash = hash_calldata_array(calldata);\n        execution_cache::store(calldata, calldata_hash);\n        self.set_public_teardown_function_with_calldata_hash(contract_address, calldata_hash, false, hide_msg_sender)\n    }\n\n    /// Low-level function to set the public teardown function.\n    ///\n    /// This is the underlying implementation for setting the teardown function call that will execute at the end of\n    /// the transaction. Instead of taking raw arguments, it accepts a hash of the arguments.\n    ///\n    /// Advanced function: Most developers should use `set_public_teardown_function` instead.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the teardown function\n    /// * `calldata_hash` - Hash of the function calldata\n    /// * `is_static_call` - Whether this should be a read-only call\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn set_public_teardown_function_with_calldata_hash(\n        &mut self,\n        contract_address: AztecAddress,\n        calldata_hash: Field,\n        is_static_call: bool,\n        hide_msg_sender: bool,\n    ) {\n        let is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n        assert_valid_public_call_data(calldata_hash);\n\n        let msg_sender = if hide_msg_sender {\n            NULL_MSG_SENDER_CONTRACT_ADDRESS\n        } else {\n            self.this_address()\n        };\n\n        self.public_teardown_call_request =\n            PublicCallRequest { msg_sender, contract_address, is_static_call, calldata_hash };\n    }\n\n    /// Increments the side-effect counter.\n    ///\n    /// Very low-level function.\n    ///\n    /// # Advanced\n    ///\n    /// Every side-effect of a private function is given a \"side-effect counter\", based on when it is created. This\n    /// PrivateContext is in charge of assigning the counters.\n    ///\n    /// The reason we have side-effect counters is complicated. Consider this illustrative pseudocode of inter-contract\n    /// function calls:\n    /// ```\n    /// contract A {\n    ///    let x = 5; // pseudocode for storage var x.\n    ///    fn a1 {\n    ///        read x; // value: 5, counter: 1.\n    ///        x = x + 1;\n    ///        write x; // value: 6, counter: 2.\n    ///\n    ///        B.b(); // start_counter: 2, end_counter: 4\n    ///\n    ///        read x; // value: 36, counter: 5.\n    ///        x = x + 1;\n    ///        write x; // value: 37, counter: 6.\n    ///    }\n    ///\n    ///    fn a2 {\n    ///        read x; // value: 6, counter: 3.\n    ///        x = x * x;\n    ///        write x; // value: 36, counter: 4.\n    ///    }\n    /// }\n    ///\n    /// contract B {\n    ///     fn b() {\n    ///         A.a2();\n    ///     }\n    /// }\n    /// ```\n    ///\n    /// Suppose a1 is the first function called. The comments show the execution counter of each side-effect, and what\n    /// the new value of `x` is.\n    ///\n    /// These (private) functions are processed by Aztec's kernel circuits in an order that is different from execution\n    /// order: All of A.a1 is proven before B.b is proven, before A.a2 is proven. So when we're in the 2nd execution\n    /// frame of A.a1 (after the call to B.b), the circuit needs to justify why x went from being `6` to `36`. But the\n    /// circuit doesn't know why, and given the order of proving, the kernel hasn't _seen_ a value of 36 get written\n    /// yet. The kernel needs to track big arrays of all side-effects of all private functions in a tx. Then, as it\n    /// recurses and processes B.b(), it will eventually see a value of 36 get written.\n    ///\n    /// Suppose side-effect counters weren't exposed: The kernel would only see this ordering (in order of proof\n    /// verification): [ A.a1.read, A.a1.write, A.a1.read, A.a1.write, A.a2.read, A.a2.write ]\n    /// [         5,          6,        36,         37,         6,         36 ]\n    /// The kernel wouldn't know _when_ B.b() was called within A.a1(), because it can't see what's going on within an\n    /// app circuit. So the kernel wouldn't know that the ordering of reads and writes should actually be: [ A.a1.read,\n    /// A.a1.write, A.a2.read, A.a2.write, A.a1.read, A.a1.write ]\n    /// [         5,          6,        6,         36,         36,         37 ]\n    ///\n    /// And so, we introduced side-effect counters: every private function must assign side-effect counters alongside\n    /// every side-effect that it emits, and also expose to the kernel the counters that it started and ended with.\n    /// This gives the kernel enough information to arrange all side-effects in the correct order. It can then catch\n    /// (for example) if a function tries to read state before it has been written (e.g. if A.a2() maliciously tried to\n    /// read a value of x=37) (e.g. if A.a1() maliciously tried to read x=6).\n    ///\n    /// If a malicious app contract _lies_ and does not count correctly:\n    /// - It cannot lie about its start and end counters because the kernel will catch this.\n    /// - It _could_ lie about its intermediate counters:\n    /// - 1. It could not increment its side-effects correctly\n    /// - 2. It could label its side-effects with counters outside of its start and end counters' range. The kernel\n    /// will catch 2. The kernel will not catch 1., but this would only cause corruption to the private state of the\n    /// malicious contract, and not any other contracts (because a contract can only modify its own state). If a \"good\"\n    /// contract is given _read access_ to a maliciously-counting contract (via an external getter function, or by\n    /// reading historic state from the archive tree directly), and they then make state changes to their _own_ state\n    /// accordingly, that could be dangerous. Developers should be mindful not to trust the claimed innards of external\n    /// contracts unless they have audited/vetted the contracts including vetting the side-effect counter\n    /// incrementation. This is a similar paradigm to Ethereum smart contract development: you must vet external\n    /// contracts that your contract relies upon, and you must not make any presumptions about their claimed behaviour.\n    /// (Hopefully if a contract imports a version of aztec-nr, we will get contract verification tooling that can\n    /// validate the authenticity of the imported aztec-nr package, and hence infer that the side- effect counting will\n    /// be correct, without having to re-audit such logic for every contract).\n    ///\n    fn next_counter(&mut self) -> u32 {\n        let counter = self.side_effect_counter;\n        self.side_effect_counter += 1;\n        counter\n    }\n}\n\nimpl Empty for PrivateContext {\n    fn empty() -> Self {\n        PrivateContext {\n            inputs: PrivateContextInputs::empty(),\n            side_effect_counter: 0 as u32,\n            min_revertible_side_effect_counter: 0 as u32,\n            is_fee_payer: false,\n            args_hash: 0,\n            return_hash: 0,\n            expiration_timestamp: 0,\n            note_hash_read_requests: BoundedVec::new(),\n            nullifier_read_requests: BoundedVec::new(),\n            key_validation_requests_and_separators: BoundedVec::new(),\n            note_hashes: BoundedVec::new(),\n            nullifiers: BoundedVec::new(),\n            private_call_requests: BoundedVec::new(),\n            public_call_requests: BoundedVec::new(),\n            public_teardown_call_request: PublicCallRequest::empty(),\n            l2_to_l1_msgs: BoundedVec::new(),\n            anchor_block_header: BlockHeader::empty(),\n            private_logs: BoundedVec::new(),\n            contract_class_logs_hashes: BoundedVec::new(),\n            last_key_validation_requests: [Option::none(); NUM_KEY_TYPES],\n            expected_non_revertible_side_effect_counter: 0,\n            expected_revertible_side_effect_counter: 0,\n        }\n    }\n}\n"
     },
     "73": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/utility_context.nr",
-      "source": "use crate::oracle::{execution::get_utility_context, storage::storage_read};\nuse crate::protocol::{abis::block_header::BlockHeader, address::AztecAddress, traits::Packable};\n\n// If you'll modify this struct don't forget to update utility_context.ts as well.\npub struct UtilityContext {\n    block_header: BlockHeader,\n    contract_address: AztecAddress,\n}\n\nimpl UtilityContext {\n    pub unconstrained fn new() -> Self {\n        get_utility_context()\n    }\n\n    pub unconstrained fn at(contract_address: AztecAddress) -> Self {\n        // We get a context with default contract address, and then we construct the final context with the provided\n        // contract address.\n        let default_context = get_utility_context();\n\n        Self { block_header: default_context.block_header, contract_address }\n    }\n\n    pub fn block_header(self) -> BlockHeader {\n        self.block_header\n    }\n\n    pub fn block_number(self) -> u32 {\n        self.block_header.global_variables.block_number\n    }\n\n    pub fn timestamp(self) -> u64 {\n        self.block_header.global_variables.timestamp\n    }\n\n    pub fn this_address(self) -> AztecAddress {\n        self.contract_address\n    }\n\n    pub fn version(self) -> Field {\n        self.block_header.global_variables.version\n    }\n\n    pub fn chain_id(self) -> Field {\n        self.block_header.global_variables.chain_id\n    }\n\n    pub unconstrained fn raw_storage_read<let N: u32>(self: Self, storage_slot: Field) -> [Field; N] {\n        storage_read(self.block_header, self.this_address(), storage_slot)\n    }\n\n    pub unconstrained fn storage_read<T>(self, storage_slot: Field) -> T\n    where\n        T: Packable,\n    {\n        T::unpack(self.raw_storage_read(storage_slot))\n    }\n}\n"
-    },
-    "76": {
-      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/event/event_interface.nr",
-      "source": "use crate::{event::EventSelector, messages::logs::event::MAX_EVENT_SERIALIZED_LEN};\nuse crate::protocol::{\n    constants::DOM_SEP__EVENT_COMMITMENT,\n    hash::{poseidon2_hash_with_separator, poseidon2_hash_with_separator_bounded_vec},\n    traits::{Serialize, ToField},\n};\n\npub trait EventInterface {\n    fn get_event_type_id() -> EventSelector;\n}\n\n/// A private event's commitment is a value stored on-chain which is used to verify that the event was indeed emitted.\n///\n/// It requires a `randomness` value that must be produced alongside the event in order to perform said validation.\n/// This random value prevents attacks in which someone guesses plausible events (e.g. 'Alice transfers to Bob an\n/// amount of 10'), since they will not be able to test for existence of their guessed events without brute-forcing the\n/// entire `Field` space by guessing `randomness` values.\npub fn compute_private_event_commitment<Event>(event: Event, randomness: Field) -> Field\nwhere\n    Event: EventInterface + Serialize,\n{\n    poseidon2_hash_with_separator(\n        [randomness, Event::get_event_type_id().to_field()].concat(event.serialize()),\n        DOM_SEP__EVENT_COMMITMENT,\n    )\n}\n\n/// Unconstrained variant of [`compute_private_event_commitment`] which takes the event in serialized form.\n///\n/// This function is unconstrained as the mechanism it uses to compute the commitment would be very inefficient in a\n/// constrained environment (due to the hashing of a dynamically sized array). This is not an issue as it is typically\n/// invoked when processing event messages, which is an unconstrained operation.\npub unconstrained fn compute_private_serialized_event_commitment(\n    serialized_event: BoundedVec<Field, MAX_EVENT_SERIALIZED_LEN>,\n    randomness: Field,\n    event_type_id: Field,\n) -> Field {\n    let mut commitment_preimage =\n        BoundedVec::<_, 1 + MAX_EVENT_SERIALIZED_LEN>::from_array([randomness, event_type_id]);\n    commitment_preimage.extend_from_bounded_vec(serialized_event);\n\n    poseidon2_hash_with_separator_bounded_vec(commitment_preimage, DOM_SEP__EVENT_COMMITMENT)\n}\n\nmod test {\n    use crate::event::event_interface::{\n        compute_private_event_commitment, compute_private_serialized_event_commitment, EventInterface,\n    };\n    use crate::protocol::traits::{Serialize, ToField};\n    use crate::test::mocks::mock_event::MockEvent;\n\n    global VALUE: Field = 7;\n    global RANDOMNESS: Field = 10;\n\n    #[test]\n    unconstrained fn event_commitment_equivalence() {\n        let event = MockEvent::new(VALUE).build_event();\n\n        assert_eq(\n            compute_private_event_commitment(event, RANDOMNESS),\n            compute_private_serialized_event_commitment(\n                BoundedVec::from_array(event.serialize()),\n                RANDOMNESS,\n                MockEvent::get_event_type_id().to_field(),\n            ),\n        );\n    }\n}\n"
+      "source": "use crate::oracle::{execution::get_utility_context, storage::storage_read};\nuse crate::protocol::{abis::block_header::BlockHeader, address::AztecAddress, traits::Packable};\n\n// If you'll modify this struct don't forget to update utility_context.ts as well.\npub struct UtilityContext {\n    block_header: BlockHeader,\n    contract_address: AztecAddress,\n}\n\nimpl UtilityContext {\n    pub unconstrained fn new() -> Self {\n        get_utility_context()\n    }\n\n    pub unconstrained fn at(contract_address: AztecAddress) -> Self {\n        // We get a context with default contract address, and then we construct the final context with the provided\n        // contract address.\n        let default_context = get_utility_context();\n\n        Self { block_header: default_context.block_header, contract_address }\n    }\n\n    pub fn block_header(self) -> BlockHeader {\n        self.block_header\n    }\n\n    pub fn block_number(self) -> u32 {\n        self.block_header.block_number()\n    }\n\n    pub fn timestamp(self) -> u64 {\n        self.block_header.timestamp()\n    }\n\n    pub fn this_address(self) -> AztecAddress {\n        self.contract_address\n    }\n\n    pub fn version(self) -> Field {\n        self.block_header.version()\n    }\n\n    pub fn chain_id(self) -> Field {\n        self.block_header.chain_id()\n    }\n\n    pub unconstrained fn raw_storage_read<let N: u32>(self: Self, storage_slot: Field) -> [Field; N] {\n        storage_read(self.block_header, self.this_address(), storage_slot)\n    }\n\n    pub unconstrained fn storage_read<T>(self, storage_slot: Field) -> T\n    where\n        T: Packable,\n    {\n        T::unpack(self.raw_storage_read(storage_slot))\n    }\n}\n"
     },
-    "78": {
-      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/event/event_selector.nr",
-      "source": "use crate::protocol::{hash::poseidon2_hash_bytes, traits::{Deserialize, Empty, FromField, Serialize, ToField}};\n\n#[derive(Deserialize, Eq, Serialize)]\npub struct EventSelector {\n    // 1st 4-bytes (big-endian leftmost) of abi-encoding of an event.\n    inner: u32,\n}\n\nimpl FromField for EventSelector {\n    fn from_field(field: Field) -> Self {\n        Self { inner: field as u32 }\n    }\n}\n\nimpl ToField for EventSelector {\n    fn to_field(self) -> Field {\n        self.inner as Field\n    }\n}\n\nimpl Empty for EventSelector {\n    fn empty() -> Self {\n        Self { inner: 0 as u32 }\n    }\n}\n\nimpl EventSelector {\n    pub fn from_u32(value: u32) -> Self {\n        Self { inner: value }\n    }\n\n    pub fn from_signature<let N: u32>(signature: str<N>) -> Self {\n        let bytes = signature.as_bytes();\n        let hash = poseidon2_hash_bytes(bytes);\n\n        // `hash` is automatically truncated to fit within 32 bits.\n        EventSelector::from_field(hash)\n    }\n\n    pub fn zero() -> Self {\n        Self { inner: 0 }\n    }\n}\n"
-    },
-    "80": {
+    "83": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/hash.nr",
       "source": "//! Aztec hash functions.\n\nuse crate::protocol::{\n    address::{AztecAddress, EthAddress},\n    constants::{\n        DOM_SEP__FUNCTION_ARGS, DOM_SEP__MESSAGE_NULLIFIER, DOM_SEP__PUBLIC_BYTECODE, DOM_SEP__PUBLIC_CALLDATA,\n        DOM_SEP__SECRET_HASH, MAX_PACKED_PUBLIC_BYTECODE_SIZE_IN_FIELDS,\n    },\n    hash::{poseidon2_hash_subarray, poseidon2_hash_with_separator, sha256_to_field},\n    traits::ToField,\n};\n\npub use crate::protocol::hash::compute_siloed_nullifier;\n\npub fn compute_secret_hash(secret: Field) -> Field {\n    poseidon2_hash_with_separator([secret], DOM_SEP__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], DOM_SEP__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, DOM_SEP__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, DOM_SEP__PUBLIC_CALLDATA)\n}\n\n/// Computes the public bytecode commitment for a contract class. The commitment is `hash([(length | separator),\n/// ...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 first_field\n/// instead of length. @returns The public bytecode commitment.\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 = (bytecode_length_in_bytes / 31) + (bytecode_length_in_bytes % 31 != 0) as u32;\n    // Don't allow empty public bytecode. 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. Append it to the separator before hashing.\n    let first_field = DOM_SEP__PUBLIC_BYTECODE.to_field() + (packed_public_bytecode[0] as u64 << 32) as Field;\n    packed_public_bytecode[0] = first_field;\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. +1 to account for the prepended field.\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 secret_hash_matches_typescript() {\n    let secret = 8;\n    let hash = compute_secret_hash(secret);\n\n    // The following value was generated by `yarn-project/stdlib/src/hash/hash.test.ts`\n    let secret_hash_from_ts = 0x1848b066724ab0ffb50ecb0ee3398eb839f162823d262bad959721a9c13d1e96;\n\n    assert_eq(hash, secret_hash_from_ts);\n}\n\n#[test]\nunconstrained fn var_args_hash_matches_typescript() {\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\n    // The following value was generated by `yarn-project/stdlib/src/hash/hash.test.ts`\n    let var_args_hash_from_ts = 0x262e5e121a8efc0382566ab42f0ae2a78bd85db88484f83018fe07fc2552ba0c;\n\n    assert_eq(hash, var_args_hash_from_ts);\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\n    // The following value was generated by `yarn-project/stdlib/src/hash/hash.test.ts`\n    let calldata_hash_from_ts = 0x14a1539bdb1d26e03097cf4d40c87e02ca03f0bb50a3e617ace5a7bfd3943944;\n\n    // Used in cpp vm2 tests:\n    assert_eq(hash, calldata_hash_from_ts);\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    // Used in cpp vm2 tests:\n    assert_eq(hash, 0x09348974e76c3602893d7a4b4bb52c2ec746f1ade5004ac471d0fbb4587a81a6);\n}\n"
     },
-    "97": {
-      "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::{generate_external_function_calls, generate_external_function_self_calls_structs},\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, is_fn_test,\n        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_state` utility function.\n///\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_state` and `process_message` functions only if they are\n    // not already implemented. If they are implemented we just insert empty quotes.\n    let contract_library_method_compute_note_hash_and_nullifier = if !m.functions().any(|f| {\n        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_state_fn_and_abi_export = if !m.functions().any(|f| f.name() == quote { sync_state }) {\n        generate_sync_state()\n    } else {\n        quote {}\n    };\n\n    let process_message_fn_and_abi_export = if !m.functions().any(|f| f.name() == quote { process_message }) {\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_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: aztec::protocol::address::AztecAddress\n        }\n\n        impl $module_name {\n            $calls\n\n            pub fn at(\n                addr: aztec::protocol::address::AztecAddress\n            ) -> Self {\n                Self { target_contract: addr }\n            }\n\n            pub fn interface() -> Self {\n                Self { target_contract: aztec::protocol::address::AztecAddress::zero() }\n            }\n\n            $storage_layout_getter\n        }\n\n        #[contract_library_method]\n        pub fn at(\n            addr: aztec::protocol::address::AztecAddress\n        ) -> $module_name {\n            $module_name { target_contract: addr }\n        }\n\n        #[contract_library_method]\n        pub fn interface() -> $module_name {\n            $module_name { target_contract: aztec::protocol::address::AztecAddress::zero() }\n        }\n\n        $library_storage_layout_getter\n\n    }\n}\n\n/// Generates a contract library method called `_compute_note_hash_and_nullifier` which is used for note discovery (to\n/// 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::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::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 transactions and are therefore already part of the note hash tree. We therefore compute the 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::HintedNote{\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 (non-siloed) and inner nullifier (non-siloed) assuming the note has been inserted into the note hash tree with `note_nonce`.\n            ///\n            /// The signature of this function notably matches the `aztec::messages::discovery::ComputeNoteHashAndNullifier` type, and so it can be used to call functions from that module such as `do_sync_state` and `attempt_note_discovery`.\n            ///\n            /// This function is automatically injected by the `#[aztec]` macro.\n            #[contract_library_method]\n            unconstrained fn _compute_note_hash_and_nullifier(\n                packed_note: BoundedVec<Field, aztec::messages::logs::note::MAX_NOTE_PACKED_LEN>,\n                owner: aztec::protocol::address::AztecAddress,\n                storage_slot: Field,\n                note_type_id: Field,\n                contract_address: aztec::protocol::address::AztecAddress,\n                randomness: Field,\n                note_nonce: Field,\n            ) -> Option<aztec::messages::discovery::NoteHashAndNullifier> {\n                $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 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::logs::note::MAX_NOTE_PACKED_LEN>,\n                _owner: aztec::protocol::address::AztecAddress,\n                _storage_slot: Field,\n                _note_type_id: Field,\n                _contract_address: aztec::protocol::address::AztecAddress,\n                _randomness: Field,\n                _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_state() -> Quoted {\n    quote {\n        pub struct sync_state_parameters {}\n\n        #[abi(functions)]\n        pub struct sync_state_abi {\n            parameters: sync_state_parameters,\n        }\n\n        #[aztec::macros::internals_functions_generation::abi_attributes::abi_utility]\n        unconstrained fn sync_state() {\n            let address = aztec::context::UtilityContext::new().this_address();\n            \n            aztec::messages::discovery::do_sync_state(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::MessageContext,\n        }\n\n        #[abi(functions)]\n        pub struct process_message_abi {\n            parameters: process_message_parameters,\n        }\n\n        #[aztec::macros::internals_functions_generation::abi_attributes::abi_utility]\n        unconstrained fn process_message(\n            message_ciphertext: BoundedVec<Field, aztec::messages::encoding::MESSAGE_CIPHERTEXT_LEN>,\n            message_context: aztec::messages::processing::MessageContext,\n        ) {\n            let address = aztec::context::UtilityContext::new().this_address();\n\n            aztec::messages::discovery::process_message::process_message_ciphertext(\n                address,\n                _compute_note_hash_and_nullifier,\n                message_ciphertext,\n                message_context,\n            );\n\n            // At this point, the note is pending validation and storage in the database. We must call\n            // validate_and_store_enqueued_notes_and_events to complete that process.\n            aztec::messages::processing::validate_and_store_enqueued_notes_and_events(address);\n        }\n    }\n}\n\n/// Checks that all functions in the module have a context macro applied.\n///\n/// Non-macroified functions are not allowed in contracts. They must all be one of\n/// [`external`](crate::macros::functions::external), [`internal`](crate::macros::functions::internal) or `test`.\ncomptime fn check_each_fn_macroified(m: Module) {\n    for f in m.functions() {\n        let name = f.name();\n        if !is_fn_external(f) & !is_fn_contract_library_method(f) & !is_fn_internal(f) & !is_fn_test(f) {\n            // We  don't suggest that #[contract_library_method] is allowed because we don't want to introduce another\n            // concept\n            panic(\n                f\"Function {name} must be marked as either #[external(...)], #[internal(...)], or #[test]\",\n            );\n        }\n    }\n}\n"
+    "99": {
+      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/logging.nr",
+      "source": "// Not all log levels are currently used, but we provide the full set so that new call sites can use any level. Because\n// of that we tag all with `#[allow(dead_code)]` to prevent warnings.\n//\n// All wrappers resolve function paths at comptime via `resolve_fn` so that the emitted `Quoted` code works both inside\n// aztec-nr (where `crate::` = aztec) and inside macro-generated contract code (where `crate::` = the contract).\n\nuse std::meta::ctstring::AsCtString;\n\ncomptime fn log_prefix<let N: u32>(msg: str<N>) -> CtString {\n    \"[aztec-nr] \".as_ctstring().append_str(msg)\n}\n\n// --- No-args variants (direct call) ---\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_fatal_log<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::fatal_log });\n    quote { $f($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_error_log<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::error_log });\n    quote { $f($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_warn_log<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::warn_log });\n    quote { $f($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_info_log<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::info_log });\n    quote { $f($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_verbose_log<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::verbose_log });\n    quote { $f($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_debug_log<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::debug_log });\n    quote { $f($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_trace_log<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::trace_log });\n    quote { $f($msg) }\n}\n\n// --- Format variants (return lambda for runtime args) ---\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_fatal_log_format<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::fatal_log_format });\n    quote { (|args| $f($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_error_log_format<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::error_log_format });\n    quote { (|args| $f($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_warn_log_format<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::warn_log_format });\n    quote { (|args| $f($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_info_log_format<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::info_log_format });\n    quote { (|args| $f($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_verbose_log_format<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::verbose_log_format });\n    quote { (|args| $f($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_debug_log_format<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::debug_log_format });\n    quote { (|args| $f($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_trace_log_format<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::trace_log_format });\n    quote { (|args| $f($msg, args)) }\n}\n\n// See module-level comment for why this is needed.\ncomptime fn resolve_fn(path: Quoted) -> TypedExpr {\n    path.as_expr().unwrap().resolve(Option::none())\n}\n"
     }
   }
 }