@aztec/accounts 0.0.1-commit.ec5f612 → 0.0.1-commit.ef17749e1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/artifacts/EcdsaKAccount.json +136 -108
- package/artifacts/EcdsaRAccount.json +137 -109
- package/artifacts/SchnorrAccount.json +122 -102
- package/artifacts/SimulatedAccount.json +72 -64
- package/package.json +6 -6
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"transpiled": true,
|
|
3
|
-
"noir_version": "1.0.0-beta.19+
|
|
3
|
+
"noir_version": "1.0.0-beta.19+39f25c903f0ddc60373ca60a85cbdaa3c0f016cd",
|
|
4
4
|
"name": "SimulatedAccount",
|
|
5
5
|
"functions": [
|
|
6
6
|
{
|
|
@@ -1893,8 +1893,8 @@
|
|
|
1893
1893
|
}
|
|
1894
1894
|
}
|
|
1895
1895
|
},
|
|
1896
|
-
"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=",
|
|
1897
|
-
"debug_symbols": "td3dbl/LeaX7e/GxD/5V70fNmVtpBIGTdjcMGE7gThrYCHzvm1/vb8reEHu1V/aJWdKyapASH5KixnzGf/7mv//+n//jf/7TH/70P/71f/3mH/7bf/7mn//8hz/+8Q//85/++K//8rt//8O//untZ//zN6/3/1n5m39Y8Zff/mb50dsP9vsPzvsP9m9/c+rrZX+9PO8v3/5f8fFL3v/r+6/Jjx/dbz96vf2o3n+03/4f8XZbfr6ozxf9+eJ8vrg+X7z9un678fX5Yn2+eHs1ztuL+HyRny/ebrnfXvTni7db7re4ntd+/+XtR/Nm/tO///n3v3//Lz+83W+/G//2uz///k///pt/+NN//PGPv/3N//7dH//j4//0v/7td3/6ePnvv/vz2399/fY3v//Tf397+Xbh//jDH3//fvrLb59f/fr5L72uV3/96uvK2wXrOr/0il+R3lET/lpP9tn/F6/+XHDXTy/In18QPa9BnHRBrvyrC+rnF+ycC3afn17wy16DK356wTe/B/feXxfcET/9Pbh+7ZvwzWuQZy7ofX54DX7xBbt73oZ9dvxdV+zKuWJfzzty1C9+Z1qvNa/Fev3wO7Hu+KVXnFPr64pzvX7Aaf31Feubd4jrDn+e9fe8Enuv8Fvxw3v123vaX78S/c0f6Y65I+MHNnP9zR3nm/fs0/G8a++f33F992eS7//56w8ld/1wy/l7b8n901v269e/PXv9F9yxv/mzeZ15Y/J1r5+/Ld+8HvfxQeP65vf0m/eQHTmfOXb81ceNv3ktvvvgWdt7akX/Xa/HuX0OWT+/YZ9f+3vxLXBeh7fflddPqd/3N3esvkD7w0fR668/fMV3nwjWNR8C3z4nrB8+BP71J+RY333w8dnkuvv++R3fvH9GPu/ilxt2r7++Ib654eX9Il6x/r47lq9sYmX+/I767hObP9j8kdZ1/X1vSu+/703p8jVCd/z6O875++64n7fl7p//seTr/9/f0vt6Xo3756/Gd8QG5nfu/imxGd99Unl7F/NJ5e2joVveuPnll9T7p9CvS+rEzy757uuW9Ee78gfi6hd/Hb7qzEeOVff+2Q35zQfR/XzZsu8fvvKpv3nXuL77OBzP5+gf3oy//syY96//CFivX/8RsNav/QhY+9cj/+0fyb2PDz0/fA1Xv/yKty/9fBB9Zf3siqpf/7X9t3dc97Wf9671+hkl/4dL8Pp+Sf70ku++kuxzzzvpWeenf82o7z7Vv/ytda/9+ukd3//B9PIH88PfG//mD6a/eyddhZZYvX76oef7S67wirzRd/30km8+CF6vXf4e/9rn/jtfk355Te6ffzjub/8277dkV/38nfXbP5r1up7fkb8Pu3XDbu+fYtfXf8F7e9+//r39vH79e/u3b8wv/Bjy7e/pTh8N3y752e/p+e6T9dvXCvPbsX/41PA3n6HON3+5P88XHieuH35H1/1/8Wq8fLbeP/xu/O2r8d0VEb50iR++GvzbK775/Tyvq+Y39O18fvoOdq7/AvK/u2S/6uXvX6/6gZe/veTbN+f23Z+3c19/5yWAOev186/mrm8+9d++Ifj21ej10/f1b1+PFd7Zz1/9Af/t6/HNu2pfPe9mff14xS9/L2t/uG8fSdbf9Y56hS+Pr+unV1znu28yv2o+IHfsn7+jfntJpr9Ovp0j/q5L9oPd2/nqv+uP5fha/e2j8/rJH8v3f7Db92uv/Nkf7Pe/pc93PDpi//QNuePXviHf3vCL3pDvb/gl7+PffloJ3z2P3D/9bH+fX/+3lvv69X9rue9f+7eW9Xr9+r+2fH/JL/w2w3rtX/19hv/DK/LLvtHw7ftHxvP+0T/9smO9vvuq9JW+tH073z/9BPfxLa+f3VLX81Hwh+94XNf/zStS5zyfae/8+SvyX/FJ/9tbfvFn/f/TW/QLb1nr134Y+e7fjdJf505ef/Md5H98++Hv/uUPf/7rfxN///fk9faqx/s/S7//E/T9+TJfXy/X18v99TK+XubXy/p62V8vz9fLr/vy6776uq++7quv++rrvvq6r77uq6/76uu++rqvvu7rr/v6677+uq+/7uuv+/rrvv66r7/u66/7+uu+83Xf+brvfN13vu47X/edr/vO133n677zdd/5uu/6uu9a7/8G8PZyf718uy/f/pSv/Hr5dt/7h/6rv16+3ff+LyLX233v/xR53Z8v79fXy/emwNu7wL3fP/m/vYyvl/n+FcXby/p6+XZfv91zn/fPi28vr6+X9+fLt49Y71/UvR/ebnz/28Tbx8E5vPcP6v2Qc6g59Ps/lbwfzhyuOdxfh/V6B/L98Hbz+4e+9d5TuN6z3rsTV78feg7n/Z/f3w/XHO73Tz5vh/2aw5rDnsP7K/b+y98rFh83v5csPn/mfL0V70WLj9f5vWrxcXgvW3we1ter+lG4+DjEHHIONYd5k2Pe5Jg3+R2Wj7c0501+x+XzsL/e9ndQ7vfX8J2Uz0PP4czhmsP9/sn77fCOy+dhzWHPIeaQc6g59BzOHK45zM09N/fc3HNzz809N/fc3HNzz809N/fcfObmMzefufnMzWduPnPzmZvP3Hzm5jM3X3PzNTdfc/M1N19z8zU3X3PzNTdfc/M1N99z8z0333PzPTffc/M9N99z8z0333Pz/XXzfr3msOaw5xBzyDnUHHoOZw7XHObmNTevuXnNzWtuXnPzmpvX3Lzm5jU3r7l5z817bt5z856b99y85+Y9N++5ec/Ne26OuTnm5pibY26OuTnm5pibY26OuTnm5pybc27OuTnn5pybc27OuTnn5pybh8E9DO5hcA+Dexjcw+AeBvcwuIfBPQzuYXAPg3sY3MPgHgb3MLiHwT0M7mFwD4N7GNzD4B4G9zC4h8E9DO5hcA+Dexjcw+AeBvcwuIfBPQzuYXAPg3sY3MPgHgb3MLiHwT0M7mFwD4N7GNzD4B4G9zC4h8E9DO5hMIbBGAZjGIxhMIbBGAZjGIxhMIbBGAZjGIxhMIbBGAZjGIxhMIbBGAZjGIxhMIbBGAZjGIxhMIbBGAZjGIxhMIbBGAZjGIxhMIbBGAZjGIxhMIbBGAZjGIxhMIbBGAZjGIxhMIbBGAZjGIxhMIbBGAZjGIxhMIbBGAZjGIxhMIbBGAZjGIxhMIbBGAZjGIxhMIbBGAZjGIxhMIbBGAZjGIxhMIbBGAZjGIxhMIbBGAZjGIxhMIbBGAZjGIxhMIbBGAZjGIxhMIbBGAZjGIxhMIbBGAZjGIxhMIbBGAZjGIxhMIfBHAZzGMxhMIfBHAZzGMxhMIfBHAZzGMxhMIfBHAZzGMxhMIfBHAZzGMxhMIfBHAZzGMxhMIfBHAZzGMxhMIfBHAZzGMxhMIfBHAZzGMxhMIfBHAZzGMxhMIfBHAZzGMxhMIfBHAZzGMxhMIfBHAZzGMxhMIfBHAZzGMxhMIfBHAZzGMxhMIfBHAZzGMxhMIfBHAZzGMxhMIfBHAZzGMxhMIfBHAZzGMxhMIfBHAZzGMxhMIfBHAZzGMxhMIfBHAZzGMxhMIfBHAZzGMxhMIfBHAZzGMxhMIfBHAZzGMxhsIbBGgZrGKxhsIbBGgZrGKxhsIbBGgZrGKxhsIbBGgZrGKxhsIbBGgZrGKxhsIbBGgZrGKxhsIbBGgZrGKxhsIbBGgZrGKxhsIbBGgZrGKxhsIbBGgZrGKxhsIbBGgZrGKxhsIbBGgZrGKxhsIbBGgZrGKxhsIbBGgZrGKxhsIbBGgZrGKxhsIbBGgZrGKxhsIbBGgZrGKxhsIbBGgZrGKxhsIbBGgZrGKxhsIbBGgZrGKxhsIbBGgZrGKxhsIbBGgZrGKxhsIbBGgZrGKxhsIbBGgZrGKxhsIbBGgZrGKxhsIfBHgZ7GOxhsIfBHgZ7GOxhsIfBHgZ7GOxhsIfBHgZ7GOxhsIfBHgZ7GOxhsIfBHgZ7GOxhsIfBHgZ7GOxhsIfBHgZ7GOxhsIfBHgZ7GOxhsIfBHgZ7GOxhsIfBHgZ7GOxhsIfBHgZ7GOxhsIfBHgZ7GOxhsIfBHgZ7GOxhsIfBHgZ7GOxhsIfBHgZ7GOxhsIfBHgZ7GOxhsIfBHgZ7GOxhsIfBHgZ7GOxhsIfBHgZ7GOxhsIfBHgZ7GOxhsIfBHgZ7GOxhsIfBHgZ7GOxhsIfBHgZ7GOxhsIfBHgZ7GOxh8AyDZxg8w+AZBs8weIbBMwyeYfAMg2cYPMPgGQbPMHiGwTMMnmHwDINnGDzD4BkGzzB4hsEzDJ5h8AyDZxg8w+AZBs8weIbBMwyeYfAMg2cYPMPgGQbPMHiGwTMMnmHwDINnGDzD4BkGzzB4hsEzDJ5h8AyDZxg8w+AZBs8weIbBMwyeYfAMg2cYPMPgGQbPMHiGwTMMnmHwDINnGDzD4BkGzzB4hsEzDJ5h8AyDZxg8w+AZBs8weIbBMwyeYfAMg2cYPMPgGQbPMHiGwTMMnmHwDINnGDzD4BkGzzB4hsEzDJ5h8AyDZxg8w+AZBq9h8BoGr2HwGgavYfAaBq9h8BoGr2HwGgavYfAaBq9h8BoGr2HwGgavYfAaBq9h8BoGr2HwGgavYfAaBq9h8BoGr2HwGgavYfAaBq9h8BoGr2HwGgavYfAaBq9h8BoGr2HwGgavYfAaBq9h8BoGr2HwGgavYfAaBq9h8BoGr2HwGgavYfAaBq9h8BoGr2HwGgavYfAaBq9h8BoGr2HwGgavYfAaBq9h8BoGr2HwGgavYfAaBq9h8BoGr2HwGgavYfAaBq9h8BoGr2HwGgavYfAaBq9h8BoGr2HwGgavYfAaBq9h8BoGr2HwGgavYfAaBq9h8BoGr2HwGgbvYfAeBu9h8B4G72HwHgbvYfAeBu9h8B4G72HwHgbvYfAeBu9h8B4G72HwHgbvYfAeBu9h8B4G72HwHgbvYfAeBu9h8B4G72HwHgbvYfAeBu9h8B4G72HwHgbvYfAeBu9h8B4G72HwHgbvYfAeBu9h8B4G72HwHgbvYfAeBu9h8B4G72HwHgbvYfAeBu9h8B4G72HwHgbvYfAeBu9h8B4G72HwHgbvYfAeBu9h8B4G72HwHgbvYfAeBu9h8B4G72HwHgbvYfAeBu9h8B4G73cGr3o/xBxyDjWHnsOZwzWH++vwzuDnYc1hbr7n5ntuvufme26+5+Z7br6/bn779/eX03LaTuGUTuXUTsfpcpKxZCwZS8aSsWQsGUvGkrFkLBlbxpaxZWwZW8aWsWVsGVvGlhEyQkbICBkhI2SEjJARMkJGykgZKSNlpIyUkTJSRspIGSWjZJSMklEySkbJKBklo2S0jJbRMlpGy2gZLaNltIyWcWQcGUfGkXFkHBlHxpFxZBwZl4xLxiXjknHJuGRcMi4Zl4xLxi3jlnHLuGXcMm4Zt4xbxi0D5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cfxZ3PilJqLX1w/lFSSr2lj0/O+XG65/Tx6fnztJy2Uzil0/vnu4/cj0/Sn6fjdDndc/r4RP15Wk7bKZzSSUbLaBkto2UcGUfGkXFkHBlHxpFxZBwZR8Yl45JxybhkXDIuGZeMS8Yl45Jxy7hl3DJuGbeMW8Yt45Zxy7gn47Pw83laTtspnNKpnNrpOF1OMpaMJWPJWDKWjCVjyVgylowlY8vYMraMLWPL2DK2jC1jy9gyQkbICBkhI2SEjJARMkJGyEgZKSNlpIyUkTJSRspIGSmjZJSMklEySgbON843zjfON843zjfON843zjfON843zjfON843zjfON843zjfON843zjfON843zjfON843zjfON843zjfON843zjfON843zjfON843zjfON843zjfON843zgPngfPAeeA8cB44D5wHzgPngfPAeeA8cB44D5wHzgPngfPAeeA8cB44D5wHzgPngfPAeeA8cB44D5wHzgPngfPAeeA8cB44D5wHzgPngfPAeeA8cB44D5wHzgPngfPAeeA8cB44D5wHzgPngfPAeeA8cB44D5wHzgPngfPAeeA8cB44D5wHzgPngfPAeeA8cB44D5wHzgPngfPAeeA8cB44D5wHzgPngfPAeeA8cB44D5wHzgPngfPAeeA8cZ44T5wnzhPnifPEeeI8cZ44T5wnzhPnifPEeeI8cZ44T5wnzhPnifPEeeI8cZ44T5wnzhPnifPEeeI8cZ44T5wnzhPnifPEeeI8cZ44T5wnzhPnifPEeeI8cZ44T5wnzhPnifPEeeI8cZ44T5wnzhPnifPEeeI8cZ44T5wnzhPnifPEeeI8cZ44T5wnzhPnifPEeeI8cZ44T5wnzhPnifPEeeI8cZ44T5wnzhPnifPEeeI8cZ44T5wnzgvnhfPCeeG8cF44L5wXzgvnhfPCeeG8cF44L5wXzgvnhfPCeeG8cF44L5wXzgvnhfPCeeG8cF44L5wXzgvnhfPCeeG8cF44L5wXzgvnhfPCeeG8cF44L5wXzgvnhfPCeeG8cF44L5wXzgvnhfPCeeG8cF44L5wXzgvnhfPCeeG8cF44L5wXzgvnhfPCeeG8cF44L5wXzgvnhfPCeeG8cF44L5wXzgvnhfPCeeG8cF44L5wXzgvnhfPCeeG8cd44b5w3zhvnjfPGeeO8cd44b5w3zhvnjfPGeeO8cd44b5w3zhvnjfPGeeO8cd44b5w3zhvnjfPGeeO8cd44b5w3zhvnjfPGeeO8cd44b5w3zhvnjfPGeeO8cd44b5w3zhvnjfPGeeO8cd44b5w3zhvnjfPP+lZ/nMIpnd6/n3h/nNrpOL1nvD5O9/zcx/fbP0/LaTuFUzrJODKOjI/vt3+eZFwyLhmXjEvGJeOSccm4ZFwyLhm3jFvGLeOWccu4Zdwybhm3jHsyPkpeX6fltJ3CKZ3KqZ2O0+UkY8lYMpaMJWPJWDKWjCVjyfD06/H46/H86/EA7Ef36+skY8vYMraMLWPLCBkhI2TEvO9+1sA+TzI+noutj9Nxupzur2dkP8pgX6fltJ3CKZ3K6f3teH2cjtP72/H+ZO1nGWx9nJbTdgqndPr6V+WlErZ0wpZS2NIKW2phSy9sKYYtzbClGrZ0w5Zy2NIOW+ph6zzPzT4Pzj5Pzj6Pzj7Pzj4Pzz5Pz/7w+KyM5wFaT9Cqii1dsaUstrTFlrrY0hdbCmNLY2ypjC2dsaU0trTGltrY0htbimNLc2ypji3dsaU8trTHlvrY0h9bCmRLg2ypkC0dsqVEtrTIlhrZ0iNbimRLk2ypki1dsqVMtrTJljrZ0idbCmVLo2yplC2dsqVUtrTKllrZ0itbimVLs2ypli3dsqVctrTLlnrZ0i9bCmZLw2ypmC0ds6VktrTMlprZ0jNbimZL02ypmi1ds6VstrTNlrrZ0jdbCmdL42ypnC2ds6V0trTOltrZ0jtbimdL82ypni3ds6V8trTPlvrZ0j9bCmhLA22poC0dtKWEtrTQlhra0kNbimhLE22poi1dtKWMtq7nSfnnUfnnWfnnYfnnafnncfnnefnngfkfnpiXgXPFtKWZtlTTlm7aUk5b2mlLPW3ppy0FtaWhtlTUlo7aUlJbWmpLTW3pqS1FtaWptlTVlq7aUlZb2mpLXW3pqy2FtaWxtlTWls7aUlpbWmtLbW3prS3FtaW5tlTXlu7aUl5b2mtLfW3pry0FtqXBtlTYlg7bUmJbWmxLjW3psS1FtqXJtlTZli7bUmZb2mxLnW3psy2FtqXRtlTalk7bUmpbWm1LrW3ptS3FtqXZtlTblm7bUm5b2m1LvW3pty0Ft6XhtlTclo7bUnJbWm5LzW3puS1Ft6XptlTdlq7bUnZb2m5L3W3puy2Ft6XxtlTels7bunF+4/zG+Y3zG+c3zm+c348b45FjPHaMR4/x+DEeQcZjyHgUGY8j4wdJxlfGfj2ajMeT8YgyHlPGo8p4XBmPLOOxZTy6DL6MF2HGizHjRZnx4sx4kWa8WDNetBkv3owXccaLOeNFnfHizniRZ7zYM170GS/+jBeBxotB40Wh8eLQeJFovFg0XjQaLx6NF5HGi0njRaXx4tJ4kWm82DRedBovPo0XocaLUeNFqfHi1HiRarxYNV60Gi9ejRexxotZ40Wt8eLWeJFrvNg1XvQaL36NF8HGi2HjRbHx4th4kWy8WDZeNBsvno0X0caLaeNFtfHi2niRbbzYNl50Gy++jRfhxotx40W58eLceJFuvFg3XrQbL96NF/HGi3njRb3x4t54kW+82Dde9Bsv/o0XAceLgeNFwfHi4HiRcLxYOF40HC8ejhcRxwvnC+cL5wvnC+cL5wvnC+cL5wvn6/Hi/CDGkfGocR43ziPHeew4jx7n8eM8ghycL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnC+cL5wvnHNYbRKrzWK1aaw2j9UmstpMVpvKanNZbTKrzWa16aw2n9UmtNqMVpvSanNabVKrzWq1aa02r9UmttrMVpvaanNbbXKrzW616a02v9UmuNoMV5vianNcbZKrzXK1aa42z9UmutpMV5vqanNdbbKrzXa16a4239UmvNqMV5vyanNebdKr/VivHu3V4716xFeP+epRXz3uq0d+9divHv3V4796BFiPAetRYD0OrEeC9ViwHg3W48F6RFg/mLAeFdYPLiwZjw3r0WE9PqxHiPUYsR4lFs4fKdZjxXq0WI8X6xFjPWasR431uLEeOdZjx3r0WI8f6xFkPYasR5H1OLIeSdZjyXo0WY8n6xFlPaasR5X1uLIeWdZjy3p0WY8v6xFmPcasR5n1OLMeadZjzXq0WY836xFnPeasR531uLMeedZjz3r0WY8/6xFoPQatR6H1OLQeidZj0Xo0Wo9H6xFpPSatR6X1uLQemdZj03p0Wo9P6xFqPUatR6n1OLUeqdZj1Xq0Wo9X6xFrMWttaq3NrbXJtTa71qbX2vxam2BrM2xtiq3NsbVJtjbL1qbZ2jxbm2hrM21tqq3NtbXJtjbb1qbb2nxbm3BrM25tyq3NubVJtzbr1qbd2vG47x753WO/+0F/J+MR4D0GvEeB9zjwHgkezim4NgfXJuHaLFybhmvzcG0irs3Etam4NhfXJuPabFybjmvzcW1Crs3ItSm5NifXJuXarFyblmvzcm1irs3Mtam5NjfXJufa7Fybnmvzc22Crs3QtSm6NkfXJunaLF2bpmvzdG2irs3Utam6NlfXJuvabF2brmvzdW3Crs3YtSm7NmfXJu3arF2btmvzdm3irs3ctam7NnfXJu/a7F2bvmvzd20Cr83gtSm8NofXJvHaLF6bxmvzeG0ir83ktam8NpfXJvPabF6bzmvzeW1Cr83otSm9NqfXJvXarF6b1mvzem1ir83stam9NrfXJvfa7F6b3mvze22Cr83wtSm+NsfXJvna+dguH93l47t8hJc/GC9lPM7LR3r5WC8f7SXOCb8249em/NqcX5v0a7N+bdqvzfu1ib8289em/trcX5v8a7N/bfqvzf+1CcA2A9imANscYJsEbLOAbRqwzQO2icA2E9imAttcYJsMbLOBbTqwzQe2CcE2I9imBNucYJsUbLOCbVqwzQu2icE2M9imBtvcYJscbLODbXqwzQ+2CcI2Q9imCNscYZskbLOEbZqwzRO2icI2U9imCttcYZssbLOFbbqwzRe2CcM2Y9imDNucYZs0bLOGbdqwzRu2icM2c9imDtvcYZs8bLOHbfqwzR+2CcQ2g9imENscYptEbLOIbRqxzSO2icQ2k9imEttcYptMbLOJbTqxzSe2CcU2o9imFNv1+G0fwe1juH0Ut4/j9gfJrYxHc/t4bh/RLc7pxTa/2CYY2wxjm2Jsc4xtkrHNMrZpxjbP2CYa20xjm2psc41tsrHNNrbpxjbf2CYc24xjm3Jsc45t0rFd8zTqrnkaddc8jbprnkbdNU+j7pqnUXfN06i75mnUXfM06q55GnXXLeOWccu4ZdwybhnzNOrueRp19zyNunueRt09T6PunqdRd8/TqLvnadTd8zTq7nkadfdLxpKxZCwZS8aSsWQsGUvGkrFkbBlbxpaxZWwZW8aWsWVsGVtGyAgZISNkhIyQETJCRsgIGSkjZaSMlJEyUkbKSBkpI2WUjJJRMkpGySgZJaNklIyS0TJaRstoGS2jZbSMltEyWsaRcWQcGUfGkXFkHBlHxpFxZFwyLhmXDJw3zhvnjfPGeeO8cd44b5w3zhvnjfPGeeO8cd44b5wfnB+cH5wfnB+cH5wfnB+cH5wfnB+cH5wfnB+cH5wfnB+cH5wfnB+cH5wfnB+cH5wfnB+cH5wfnB+cH5wfnB+cH5wfnB+cH5wfnB+cH5wfnB+cH5wfnB+cH5wfnH+24PrjdJzeM66P0z2neep8n3nqfJ956nyfeep8n3nqfH/24T5P7fTVdt1n2q77TNt1n2m77jNt132m1b7PtNr3mVb7PtNq32da7fu0jJbRMo6MI+PIODKOjCPjyDgyjowj45JxybhkXDIuGZeMS8Yl45Jxybhl3DJuGbeMW8Yt45Zxy7hlTKt9X9Nq39e02vc1rfZ9Tat9X9Nq39e02vc1rfZ9Tat9X9Nq39dLxpKxZCwZS8aSsWQsGUvGkrFkbBlbxpaxZWwZW8aWsWVsGVtGyAgZISNkhIyQETJCRsgIGSkjZaSMlJEyUkbKSBkpI2WUjJJRMkpGySgZJQPnF84vnF84v3B+4fzC+YXzC+cXzi+cXzi/cH7h/ML5hfML5xfOL5xfOL9wfuH8wvmF8wvnF84vnF84v3B+4fzC+YXzC+cXzi+cXzi/cH7h/ML5hfML5xfOL5zfOL9xfuP8xvmN8xvnN85vnN84v3F+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/Mb5jfMb5zfOb5zfOL9xfuP8Hs7jNZzHaziP13Aer+E8XsN5vIbzeA3n8RrO4zWcx+slY8lYMpaMJWPJWDKWjCVjyVgytowtY8vYMraMLWPL2DK2jC0jZISMkBEyQkbICBkhI2SEjJSRMlJGykgZKSNlpIyUkTJKRskoGSWjZJSMklEySkbJaBkto2W0jJbRMlpGy2gZLePIODKOjCPjyDgyjowj48g4Mi4Zl4xLxiXjknHJuGRcMi4Zl4xbxi3jlnHLuGXcMm4Zt4xbBs4XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzhfOF84XzlnhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOHisw/XH6fltJ3ev099f5zSqZzeM14fp+PnLqd7TvPUecQ8dR4xT53HRx/u6yQjZHx8v/3zJCNkhIyUkTJSRspIGSkjZaSMlJEySkbJKBklo2SUjJJRMkpGyWgZLaNltIyW0TJaRstoGS3jyDgyjowj48g4Mo6MI+PIODIuGZeMS8Yl45JxybhkXDIuGZeMW8btfff2vnvLeOf8fLy3v3P+dWqn82kfiI8+3Nfp/jp99OG+TstpO4XT+9vx+jiV0/vbER+nd/LWx+me0wfdn6fltJ2+WgyhBRdacKEFF1pwoQUXWnChBRdacKEFF1pwoQUXWnChBRdacKEFF1pwoQUXWnChBRdacKEFF1pwoQUXWnChBRf57M0+g7PP4uwzOfvD5qyMZ3X2mZ19dmef4VnLs1pwoQUXWnChBRdacKEFF1pwoQUXWnChBRdacKEFF1pwoQUXWnChBRdacKEFF1pwoQUXWnChBRdacKEFF1pwoQUXWnChBRdacKEFF1pwoQUXWnChBRdacKEFF1pwoQUXWnChBRdacKEFF1pwoQUXWnChBRdacKEFF1pwoQUXWnChBRdacKEFF1pwoQUXWnChBRdacKEFF1pwoQUXWnChBRdacKEFF1pwoQUXWnChBRdacKEFF1pwoQUXWnChBRdacKEFF1pwoQUXWnChBRdacKEFF1pwoQUXWnChBRdacKEFF1pwoQUXWnChBRdacKEFF1pwoQUXWnBRz8L0MzH9bEw/I9PPyvQPM9MynqHpZ2n6mZrGuRZcaMGFFlxowYUWXGjBhRZcaMGFFlxowYUWXGjBhRZcaMGFFlxowYUWXGjBhRZcaMGFFlxowYUWXNjeDOObYX0zzG+G/c0wwBkWOMMEZ9jgDCOcYYUzzHCGHc4wxBmWOMMUZ9jiDGOcYY0zzHGGPc4wyBkWOcMkZ9jkDKOcYZUzzHKGXc4wzBmWOcM0Z9jmDOOcYZ0zzHOGfc4w0BkWOsNEZ9joDCOdYaUzzHSGnc4w1BmWOsNUZ9jqDGOdYa0zzHWGvc4w2BkWO8NkZ9jsDKOdYbUzzHaG3c4w3BmWO8N0Z9juDOOdYb0zzHeG/c4w4BkWPMOEZ9jwDCOeYcUzzHhGP5vyz6j8syr/zMo/u/LPsPwPy/Iynm35Z1we5yY9w6ZnGPUMq55h1jPseoZhz7DsGaY9w7ZnGPcM655h3jPse4aBz7DwGSY+w8ZnGPkMK59h5jPsfIahz7D0GaY+w9ZnGPsMa59h7jPsfYbBz7D4GSY/w+ZnGP0Mq59h9jPsfobhz7D8GaY/w/ZnGP8M659h/jPsf4YB0LAAGiZAwwZoGAENK6BhBjTsgIYh0LAEGqZAwxZoGAMNa6BhDjTsgYZB0LAIGiZBwyZoGAUNq6BhFjTsgoZh0LAMGqZBwzZoGAcN66BhHjTsg4aB0LAQGiZCw0ZoGAkNK6FhJjRY4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGCFS5Y4YIVLljhghUuWOGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS5Z4ZIVLlnhkhUuWeGSFS73PI2ae55GzT1Po+aep1Fzz9Ooueep89zz1Hnueeo89zx1nnueOs9dMkpGySgZJaNklIySUTJaRstoGS2jZbSMltEyWkbLODKOjCPjyDgyjowj48g4Mo6MS8Yl45JxybhkXDIuGZeMS8Yl45Zxy7hl3DJuGbeMW8Yt45YxT51nzFPnGfPUecY8dZ4xT51nzFPnGfPUecY8dZ4xT51nzFPnGS8ZS8aSsWQsGUvGkrFkLBlLxpKxZWwZW8aWsWVsGVvGlrFlbBkhI2SEjJARMkJGyAgZISNkpAycB84D54HzwHngPHAeOA+cB84D54HzwHngPHAeOA+cB84D54HzwHngPHAeOA+cB84D54HzwHngPHAeOA+cB84D54HzwHngPHAeOA+cB84D54HzwHngPHAeOA+cB84D54HzwHngPHAeOA+cB84D54nzxHniPHH+2YLrj1M5vWdcH6fj9P45Kj9O95w+Pp9/npbTdgqndPpqu6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26hpGzVto6Zt1LSNmrZR0zZq2kZN26jZOG+cN84b543zxnnjvHHeOG+cN84b543zxnnjvHHeOG+cN84b543zxnnjvHHeOG+cN84b543zxnnjvHHeOG+cN84b543zxvnB+cH5wfnB+cH5wfnB+cH5wfnB+cH5wfnB+cH5wfnB+cH5wfnB+cH5wfnB+cH5wfnB+cH5wfnB+cH5wfnB+cH5wfnB+cH5wfnB+cH5wfnB+cH5wfnB+cH5wfnB+cH5wfnB+cH5wfnB+cH5wfnB+cH5wTkrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1yywiUrXLLCJStcssIlK1x+9uH643TP6YPzz9P796nvj9N2Cqf3jNfHqfxcOx2ny+me0zx1nh99uK+TjFvGx/fbP08ybhm3jFvG/ZVRH324r9Ny2k7hlE7l1E7H6XKSsWQsGUvGkrFkLBlLxpKxZCwZW8aWsWVsGVvGlrFlbBlbxpYRMkJGyAgZISNkhIyQETJCRspIGSkjZaSMlJEyUkbKyK/33frsw32eZLxz/m4pqI8+3NcpnerTPlAffbiv03G6nO45vXP+dVpO72/H6+MUTu9vR3yc3slbH6fjdDndc/qg+/P01WIoLbjSgistuNKCKy240oIrLbjSgistuNKCKy240oIrLbjSgistuNKCKy240oIrLbjSgistuNKCKy240oIrLbjSgistuNKCKy240oIrLbjSgistuNKCKy240oIrLbjSgistuNKCKy240oIrLbjSgistuNKCKy240oIrLbjSgistuNKCKy240oIrLbjSgistuNKCKy240oIrLbjSgistuNKCKy240oIrLbjSgistuNKCKy240oIrLbjSgistuNKCKy240oIrLbjSgistuNKCKy240oIrLbjSgistuNKCKy240oIrLbjSgistuNKCKy240oIrLbjSgistuNKCKy240oIrLbjSgistuNKCKy240oIrLbjSgistuNKCKy240oIrLbjSgistuNKCKy240oIrLbjSgistuNKCKy240oIrLbjSgistuNKCKy240oIrLbjSgistuNKCKy240oIrLbjSgistuNKCKy240oIrLbjSgistuNKCKy240oIrLbjSgistuNKCKy240oIrLbjSgistuNKCKy240oIrLbjSgistuNKCKy240oIrLbiyjVq2Ucs2atlGLduoZRu1bKOWbdSyjVq2Ucs2atlGLduoZRu1bKOWbdSyjVq2Ucs2atlGLduoZRu1bKOWbdSyjVq2Ucs2atlGLduoZRu1bKOWbdSyjVq2Ucs2atlGLduoZRu1bKOWbdSyjVq2Ucs2atlGLduoZRu1bKOWbdSyjVq2Ucs2atlGLduoZRu1bKOWbdSyjVq2Ucs2atlGLduoZRu1bKOWbdSyjVq2Ucs2atlGLduoZRu1bKOWbdSyjVq2Ucs2atlGLduoZRu1bKOWbdSyjVq2Ucs2atlGLduoZRu1bKOWbdSyjVq2Ucs2atlGLduoZRu1bKOWbdSyjVq2Ucs2atlGLduoZRu1bKOWbdSyjVq2Ucs2atlGLduoZRu1bKOWbdSyjVq2Ucs2atlGLduoZRu1bKOWbdSyjVq2Ucs2atlGLduoZRu1bKOWbdSyjVq2Ucs2atlGLduoZRu1bKOWbdSyjVq2Ucs2atlGLduoZRu1bKOWbdSyjVq2Ucs2atlGLduoZRu1bKOWbdSyjVq2Ucs2atlGLduoZRu1bKOWbdSyjVq2Ucs2atlGLduoZRu1bKOWbdSyjVq2Ucs2atlGLVa4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFK1a4YoUrVrhihStWuGKFq2ueRq17nkate55GrXueRq17nkate546r3ueOq97njqve546r3ueOq/7JWOeOq97yVgylowlY8lYMpaMJWPJ2DK2jC1jy9gytowtY8vYMraMkBEyQkbICBkhI2SEjJARMlJGykgZKSNlpIyUkTJSRsooGSWjZJSMklEySkbJKBklo2W0jJbRMlpGy2gZLaNltIwj48g4Mo6MI+PIODKOjCPjyLhkXDIuGZeMS8Yl45JxybhkXDJuGbeMW8Yt45Zxy7hl3DJuGcN5v4bzfg3n/RrO+zWc92s479dw3q/hvF/Deb+G8369ZCwZS8aSsWQsGUvGkrFkLBlLxpaxZWwZW8aWsWVsGVvGlrFlhIyQETJCRsgIGSEjZISMkJEyUkbKSBkpI2WkjJSRMlJGySgZJaNklIySUTJKRskoGS2jZXxw3h+ncHrPuD5O5fT+OSo/Tsfpcrrn9PH5/PO0nLbTV9u1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attGbduobRu1baO2bdS2jdq2Uds2attG7cB54DxwHjgPnAfOA+eB88B54DxwHjgPnAfOA+eB88B54DxwHjgPnAfOA+eB88B54DxwHjgPnAfOA+eB88B54DxwHjgPnAfOA+eB88B54DxwHjgPnAfOA+eB88B54DxwHjgPnAfOA+eB88B54DxwHjgPnAfOA+eB88B54DxwHjgPnAfOA+eB88B54DxwHjgPnAfOA+eB88R54jxxnjhPnCfOE+eJ88R54jxxnjhPnCfOE+escM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHDNCtescM0K16xwzQrXrHD92Yfrj9Nxupzev099v5/mqfPueeq8P/twr49T+Ll0Kqd2Ok6Xk4ySUTI+vt/+eZJRMkpGySgZJaNktIyW0TJaRstoGS2jZbSMlnFkHBlHxpFxZBwZR8aRcWQcGZeMS8Yl45JxybhkXDIuGZeMS8Yt45Zxy7hl3DJuGbeMW8YtY+wSfcYu0WfsEn3GLtFn7BJ9xi7RZ+wSfcYu0Z99uP44XU4y3jl/+9b9x3E9x/0c4/14Po75fvz8ZfUc+zme53g9x9vxnfi3b/F/HNfH8S+//c3//t2f//C7f/7j7//Xb/7hP99++D/+40//8u9/+Nc/ff3w3/+ff5v/8s9//sMf//iH//lP//bnf/2X3//3//jz7//pj//6L+//7Tev9/95f1P+2+rf7vWPb//n9f/9qf3+U29vzn/r/duz//G3n//53L+98v0/x/Mrzm/3fv+p9FN7/Xb3+0+Vn8r12/z4qf7bqL/85R//8v8C",
|
|
1896
|
+
"bytecode": "H4sIAAAAAAAA/+z9C5iN5fs//Jtm1ppZm5m1m1mLZJeEJPtd2iGhjZSKNiohyTZDSNIkSRIzQ5KEhJAk2SVJkqQzSZKQJCEJSZLkf6rnedL3+f0/6xzP+/q+j+f3fH/H5/gcjt93fa7rfF3rXve67/tc77lSC/LHbS57113tH+rTqcNdPXrf1aVHn069e7TvlnvXXZ169Ok9oFdP/f+Rcg9vLTUr7/XG3dp36Nq4Z/+r+vbo0KR9t255025s1LJZ04K8GW269OnRKTf3rLKGF6WmGF4UsYwUu8LwovjHjxpelTC96hxLVaUsLypteVEZy4vKmiovZ3rVuaZXlTe96jxL8edbXlTJcsBUtrzoAsuLLrTUdJFlpGqWF1W3vKimpabalpHqWF5U1/Ki+paaLraM1NDyokssL7rMUtMVlpEaWV7U2PKiKzMML2qakje7ce8u3bp16Xzq/z6m2OjRhaNHv1+22H/+fyl5sxrl5nbq3ee2Tr17Fo7OL3i/bPWOLXvvqDG58uJWTRfm5bVtV6nWnuYDlvTKb7LjSOFB/Z9I6qv/ediNVXd2PZNh5/z/Hfbc//Mf/4uFeLNVz9xOXTr27FGzVafe3fv2ad+nS88eBWP+r4XRcv+vf1f457xx2v99zhhJfU1S50rq65I679+VFxYkX8KKhtfoDKY1eCPpUMWKXmAlU4FzTQXOd1FgZVOBr5sKfNNQ4JkcRW+c9u/5p/37zdP+PU+PpAWSulBSF0nq4qKvwwWmdVhgWoclLt6oKqYCF5oKfMtFgReaClxkKnCpoyNpyWn/fuu0fy897d+L9Uh6W1KXSeo7krq86OtQ1bQOb5vW4V0Xb9RFpgKXmQpc4aLAaqYC3zEV+J6jI+nd0/694rR/v3fav5frkbRSUt+X1FWS+kHR16G6aR1WmtZhtYs3qoapwPdNBX7oosCapgJXmQpc4+hIWn3avz887d9rTvv3B3okfSSpayX1Y0mVoq9DLdM6fGRah09cvFG1TQWuNRW4zkWBdUwFfmwq8FNHR9Inp/173Wn//vS0f4seSesl9TNJ3SCpnxd9Heqa1mG9aR02unij6pkK/MxU4BcuCqxvKnCDqcBNjo6kjaf9+4vT/r3ptH9/rkfSl5K6WVK/ktQtRV+HBqZ1+NK0DltdvFEXmwrcbCpwm4sCG5oK/MpU4NeOjqStp/1722n//vq0f2/RI2m7pH4jqTsk9duir8MlpnXYblqHnS7eqEtNBX5jKvA7FwVeZipwh6nAXY6OpJ2n/fu70/6967R/f6tH0veSultS90jq3qKvw+WmdfjetA4/uHijrjAVuNtU4D4XBTYyFbjHVOCPjo6kH077977T/v3jaf/eq0fSfkn9SVIPSOrBoq9DY9M67DetwyEXb1QTU4E/mQr82UWBV5oKPGAq8LCjI+nQaf/++bR/Hz7t3wf1SPpFUo9I6q+SerTo69DUtA6/mNbhN0fr8Ntp/z5y2r9/Pe3fR3Udjknq75J6XFL/+Pc6FBiM55mEJwx9l+QtHR2nbNErjJkq/DPJQCk3PGqq8M8r/t12SsnPm966S4/O3Tr93fVJVm1K8mPB2Mf6VxkZRSzjyuRr9teI3Xt16ySpJ4veWcsvNBShIxeY3r2Tlk9jWrHkQ51BjWnFTN28U7MnGazYv9+zswr/ec+SL2963rRGvXu3H7C1WHnLy2+3vKi95UUPWV7Ux/Iik7OD5UVVLS/qYXlRb8uL2lleVNbyotawdeoDe1EX2GJ2hq3TQMuLqlteNAhWk+nTkgub7l7YodIJVlMv2DoNgBXe+/84MeYjv4DzrV84SV5U9C8cvQjSgQts85u+mAxiy6VPWkrZf39/pZ7h99f5//P99f/a76+msMI7/r/1qykXdqiYDrq+sPMy7kuuD2w606elJ2ydevz3ngt6w9YJeD1UtK9L09cH9wsz7dR3HPIL8yzQF+ZZ/+ULM62IN+n//Wvv8pnCgZMnT/7zTCEt1dUzhbTUZM8UTlVy6mWWVUtz80whLd9UY9r/PFNI8qL/uSb7n2cK//NModj/PFMo9r/JMwXLKf/0L5yCQlODRr//rddSZ5mupVJPmK6lPM6u+GxP5b2ur3oqJp/gtKuedDdXPRV1ZNvhleHgekZnzxhdxPd5tO2C3WN6k31nsKTJRq2kKEuNlUwV+p18DHw6sO1jEADd0gTKFnkh//q0phWa78+SvyrNRA4W9ZPvGQP/5BdtwAroAW2n3/9zSMubeUGq5TNhubW6APideSafrmTSyjqs7RzlNx2OmWfwvZ5sbp0800ixnSayHCxk6gWFqEPGZAg5ONWe+jIoNMxu+zLIML0q7OA6QY+E8Oiinhe9Y8nnxfOZJ1rT9XWaX0+1pq9sfWEAf+o2nicNH42Cf65VI//8M2qdIWwo2nKdESl7BpdDYf3f2U7ZYdMnMAbCxP4Xv2ozfP5Nr8ou4lnCdjh79EA1H87IK/kcJ9fJWmWW7Qsw7mD+iuav34Qrfcg2f3EH81cw60s40XvM85/t+lFB1SI9Kijp5lFBVR3Zdi4/x8GjAp39nNFO3mc9+cdM73Opi5zMn60nL9v81Yr6qKTQdPiWsryppUx/hsBQYtEfqFykb73lq+Iik7a0kzexlA5sO1mUAV0blDmja4PSpleVLeK7aDzQyv23HmhFvyvWh756OrC+MNv2fp/rpNCgtdCgudDyrq4hjPOf5/qxm+FbtGgDVsHfaJUDP3arDnvsVh342O1MzsHJpNVOndxss5sOxwpFPRx9BUV9s5Mc8SdPnvzG+qOMlFP/ddot+Pn//LOi7XLQ8p1zvu1lFcsWPTanq/Gf35aCg3+96nzTm1fRsLJFb0eU1undXIPqNWDcdpas5Gr+hG3+yq7mL26b/wJX85ewzV/F1fxn2+a/sKj3ALZhLd+Ns67r1L1n7wEtenTpU5i5tdhkPRj1eNC3RFdFC9NB/uc//zv9Z/rf73dRD2fPXyfK82zHneWW+pW/67i+V0FmoeW7rJj1+/ci3FAubkd02ArGCx/bYlcv4oc8638+5P/b/+d/9SEvsF4NVTN9uekLq9uuzKuZDuMaRTpnZJnOGSmEc0YN/KXE/3HuRd4H1XSw2uYlqokbqhbTURU3VG03F4B1DLeIzpanDm6oum6Wp17SYc9ytzz1cEPVd7M8DZIOm+pueRrghrrYzfI0TDpsmrvlaYgb6hI3y3Np8u81d8tzKW6oy9wsz+VJh/W6W57LcUNd4WZ5GiUdNt3d8jTCDdXYzfI0STpshrvlaYIb6ko3y9M06bA+d8vTFDfUVW6Wp1nSYf3ulqcZbqjmbpanRdJhA+6WpwVuqKvdLM81SYcNuluea3BDXetmea5LOmymu+W5DjdUSzfLc33SYbPcLc/1uKFauVmeG5IOG3K3PDfghrrRzfK0Tjps2N3ytMYNdZOb5bk56bARd8tzM26oW9wsT5ukw0bdLU8b3FBt3SzPrUmHjblbnltxQ93mZnluTzpstrvluR031B1ulqdd0mFz3C1PO9xQd7pZnruSDht3tzx34Ya6283ytE86bMLd8rTHDXWPm+XpkHTY4u6WpwNuqI5ulqdT0mFLuFueTrih7nWzPJ2TDnu2u+XpjBvqPjfL0yXpsCXdLU8X3FD3u1merkmHPcfd8nTFDdXNzfJ0TzpsKXfL0x03VA83y9Mz6bCl3S1PT9xQvdwszwNJhy3jbnkewA3V283y5CYdtqy75cnFDdXHzfL0TTpsOXfL0xc31INulqdf0mHPdbc8/XBD9XezPAOSDlve3fIMwA31kJvlGZh02PPcLc9A3FAPu1meQUmHreBueQbhhnrEzfIMTjrs+e6WZzBuqEfdLE9e0mEruluePNxQj7lZniFJh63kbnmG4IZ63M3yDE06bGV3yzMUN9QTbpZnWNJhL3C3PMNwQz3pZnmGJx22irvlGY4b6ik3yzMi6bAXulueEbihnnazPCOTDlvV3fKMxA31jJvlGZV02IvcLc8o3FCj3SxPftJhq7lbnnzcUAVulid5GK66u+UpxA01xs3yjE06bA13yzMWN9SzbpZnXNJha7pbnnG4oZ5zszzjkw5by93yjMcN9byb5ZmQdNja7pZnAm6oF9wsz8Skw9ZxtzwTcUO96GZ5JiUdtq675ZmEG2qym+WZknTYeu6WZwpuqJfcLM/UpMPWd7c8U3FDvexmeaYlHbaBu+WZhhtqupvlmZF02IvdLc8M3FCvuFmemUmHbehueWbihprlZnlmJx32EnfLMxs31KtulmdO0mEvdbc8c3BDveZmeeYmHfYyd8szFzfU626WZ17SYS93tzzzcEO94WZ55icd9gp3yzMfN9SbbpZnQdJhG7lbngW4oRa6WZ5FSYdt7G55FuGGWuxmeZYkHbaJu+VZghvqLTfLszTpsFe6W56luKHedrM8y5IO29Td8izDDfWOm+VZnnTYq9wtz3LcUO+6WZ4VSYdt5m55VuCGes/N8qxMOmxzd8uzEjfU+26WZ1XSYVu4W55VuKE+cLM8q5MOe7W75VmNG+pDN8uzJumw17hbnjW4oT5yszxrkw57rbvlWYsb6mM3yyNJh73O3fIIbqhP3CzPuqTDtnS3POtwQ33qZnnWJx32enfLsx431GdulmdD0mFbuVueDbihPnezPBuTDnuDu+XZiBvqCzfLsynpsDe6W55NuKG+dLM8m5MO29rd8mzGDfWVm+XZknTYm9wtzxbcUFvdLM+2pMPe7G55tuGG+trN8mxPOuwt7pZnO26ob9wsz46kw7Zxtzw7cEN962Z5diYdtq275dmJG+o7N8uzK+mwt7pbnl24ob53szy7kw57m7vl2Y0bao+b5dmbdNjb3S3PXtxQP7hZnn1Jh73D3fLsww31o5vl2Z902Hbulmc/bqif3CzPgaTD3ulueQ7ghjroZnkOJR32LnfLcwg31M9uludw0mHvdrc8h3FD/eJmeY4kHba9u+U5ghvqVzfLczTpsPe4W56juKF+c7M8x5IO28Hd8hzDDfW7m+U5nnTYju6W5zhuqD/cLM+JpMN2crc8J3BD/elmeU4mHfZed8tzEjaUp5iT5fGkJB22s7PlMUxuHuosN8uTmnTY+9wtTypuqDQ3y+NJOmwXd8vjwQ3ldbM86UmHvd/d8qTjhspwszy+pMN2dbc8PtxQfjfLE0g6bDd3yxPADRV0szyZSYft7m55MnFDZblZnlDSYXu4W54Qbqiwm+WJJB22p7vlieCGirpZnljSYXu5W54YbqhsN8uTk3TYB9wtTw5uqLib5UkkHba3u+VJ4IYq7mZ5SiQdNtfd8pTADXW2m+UpmXTYPu6WpyRuqHPcLE+ppMP2dbc8pXBDlXazPGWSDvugu+UpgxuqrJvlKZd02H7ulqccbqhz3SxP+aTD9ne3POVxQ53nZnkqJB12gLvlqYAb6nw3y1Mx6bAPuVueirihKrlZnspJhx3obnkq44a6wM3yVEk67MPulqcKbqgL3SxP1aTDDnK3PFVxQ13kZnmqJR32EXfLUw03VHU3y1Mj6bCD3S1PDdxQNd0sT62kwz7qbnlq4Yaq7WZ56iQdNs/d8tTBDVXXzfLUSzrsY+6Wpx5uqPpulqdB0mGHuFueBrihLnazPA2TDvu4u+VpiBvqEjfLc2nSYYe6W55LcUNd5mZ5Lk867BPuludy3FBXuFmeRkmHHeZueRrhhmrsZnmaJB32SXfL0wQ31JVulqdp0mGHu1ueprihrnKzPM2SDvuUu+VphhuquZvlaZF02BHulqcFbqir3SzPNUmHfdrd8lyDG+paN8tzXdJhR7pbnutwQ7V0szzXJx32GXfLcz1uqFZulueGpMOOcrc8N+CGutHN8rROOuxod8vTGjfUTW6W5+akw+a7W56bcUPd4mZ52iQdtsDd8rTBDdXWzfLcmnTYQnfLcytuqNvcLM/tSYcd4255bscNdYeb5WmXdNix7panHW6oO90sz11Jh33W3fLchRvqbjfL0z7psOPcLU973FD3uFmeDkmHfc7d8nTADdXRzfJ0SjrseHfL0wk31L1ulqdz0mGfd7c8nXFD3edmebokHXaCu+XpghvqfjfL0zXpsC+4W56uuKG6uVme7kmHnehuebrjhurhZnl6Jh32RXfL0xM3VC83y/NA0mEnuVueB3BD9bYsz9+OFj269CkMbS02WdJqS1pdSasvaRdL2iWSdpmkXSFpjSXtSkm7StKaS9rVknatpLWUtFaSdqOk3SRpt0haW0m7TdLukLQ7Je1uSbtH0jpK2r2Sdp+k3S9p3SSth6T1krTektZH0h6UtP6S9pCkPSxpj0jao5L2mKQ9LmlPSNqTkvaUpD0tac9I2mhJK5C0MZL2rKQ9J2nPS9oLkvaipGmRL0nay5I2XdJekbRZkvaqpL0maa9L2huS9qakLZS0xZL2lqS9LWnvSNq7kvaepL0vaR9I2oeS9pGkfSxpn0jap5L2maR9LmlfSNqXkvaVpG2VtK8l7RtJ+1bSvpO07yVtj6T9IGk/StpPknZQ0n6WtF8k7VdJ+03Sfpe0PyTtT/HoIXOWeNLE4xVPhnj84gmKJ0s8YfFExZMtnrh4iovnbPGcI57S4ikrnnPFc554zhdPJfFcIJ4LxXOReKqLp6Z4aounrnjqi+di8VyirW5t52rLUtty2nrS9oq2EPQxuT4K1sed+khPH1vpoxl9/KC32HobqbdKejugl7x6WaeXLvr1rF9BeprVU4l+XPSQmP73+/2vj0VB8k3uU6pKWulCy9/IKC1ptQosh6e+zPJhzDUcxP98GEOmD2OK8ROUVhP3Ycwt4rkqP/mb4vlrtc8zrPZZ+krTavdxsNrmJeqDG6rvGax2stVJrV5omDvV8JrqpvfiQeJ7kQb8kXI/pgP4g8f+TAfwl4kDmA7gTwgfYjqAv/UbyHQAf5T3MNMB/PXcIKYD+DO3R5gO4O/RBjMdwB+OPcp0AH/hlcd0AH+K9RjTAfzN1BCmA/jjpseZDuCvkIYyHcCfCz3BdAB/1zOM6QD+AOdJpgP4S5nhTAfwJy1PMR3A356MYDqAPxJ5mukA/ppjJNMB/NnFM0wH8PcRo5gO4A8ZRjMdwF8c5DMdwJ8GFDAdwB5+IdMBbLaPYTqAXfGxTAewff0s05GLc4xjOvriHM8xHf1wjvFMxwCc43mmYyDOMYHpGIRzvMB0DMY5JjIdeTjHi0zHEJxjEtMxFOeYzHQMwzmmMB3DcY6XmI4ROMdUpmMkzvEy0zEK55jGdOTjHNOZjkKcYwbTMRbneIXpGIdzzGQ6xuMcs5iOCTjHbKZjIs7xKtMxCeeYw3RMwTleYzqm4hxzmY5pOMfrTMcMnGMe0zET53iD6ZiNc8xnOubgHG8yHXNxjgVMxzycYyHTMR/nWMR0LMA5FjMdi3COJUzHEpzjLaZjKc6xlOlYhnO8zXQsxzmWMR0rcI53mI6VOMdypmMVzvEu07Ea51jBdKzBOd5jOtbiHCuZDsE53mc61uEcq5iO9TjHB0zHBpxjNdOxEef4kOnYhHOsYTo24xwfMR1bcI61TMc2nONjpmM7ziFMxw6c4xOmYyfOsY7p2IVzfMp07MY51jMde3GOz5iOfTjHBqZjP87xOdNxAOfYyHQcwjm+YDoO4xybmI4jOMeXTMdRnGMz03EM5/iK6TiOc2xhOk7gHFuZjpM4xzaiw5OCG+prpiMVN9R2psODG+obpiMdN9QOpsOHG+pbpiOAG2on05GJG+o7piOEG2oX0xHBDfU90xHDDbWb6cjBDbWH6UjghtrLdJTADfUD01ESN9Q+pqMUbqgfmY4yuKH2Mx3lcEP9xHSUxw11gOmogBvqINNRETfUIaajMm6on5mOKrihDjMdwH0afmE6quGGOsJ01MAN9SvTUQs31FGmA7j/x29MB3D/j2NMB3D/j9+ZDuD+H8eZDuD+H38wHcD9P04wHcD9P/5kOoD7f5xkOnD7f3iLMR24/T+8KUwHbv8P71lMB27/D28q04Hb/8ObxnTg9v/wepgO3P4fXi/Tgdv/w5vOdOD2//BmMB24/T+8PqYDt/+H18904Pb/8AaYDtz+H94g04Hb/8ObyXTg9v/wZjEduP0/vCGmA7f/hzfMdOD2//BGmA7c/h/eKNOB2//DG2M6cPt/eLOZDtz+H94cpgO3/4c3bnDM+tvRokeXPoXhrcUmi6efePqLZ4B4HhLPQPE8LJ5B4nlEPIPF86h48sTzmHiGiOdx8QwVzxPiGSaeJ8UzXDxPiWeEeJ4Wz0jxPCOeUeIZLZ588RSIp1A8Y8QzVjzPimeceJ4Tz3jxPC+eCeJ5QTwTxfOieCaJR2efIp6XxDNVPC+LZ5p4potnhnheEc9M8cwSz2zxvCqeOeJ5TTxzxfO6eOaJ5w3xzBfPm+JZIJ6F4lkknsXiWSKet8SzVDxvi2eZeN4Rz3LxvCueFeJ5TzwrxfO+eFaJ5wPxrBbPh+JZI56PxLNWPB+LR8TziXjWiedT8awXz2fi2SCez8WzUTxfiGeTeL4Uz2bxfCWeLeLZKp5t4vlaPNvF8414dojnW/HsFM934tklnu/Fs1s8e8SzVzw/iGefeH4Uz37x/CSeA9pQ1160tnG1A6rNQ+27actKuz3aKNEegz6e1yfb+lBYn6fqo0h9iqcPwPTZkT520ScWerOv98l6i6l3Z3pjo/cEejmtV6J6EafXP3rpoN+6+oWl53o9TeoZRj+celzrITH97/c7b1aj3NxOvfvc1ql3z8KCwvfLVu/YsveOGpMrL27VdGFeXtt2lWrtaT5gSa/8JjuOFB7UA0XSSounb6HhsDv1wgcLTMd63wLDxN5EkT6OYdPHMcX6ceyD+zhaHKe/LfnJV9tzarXTzjOsdqq+0rTaxR2stnmJiuOGKkF0pOF+VOA9m+nANX+9JZkOXPPXew7TgWv+eksxHbjmr7c004Fr/nrLMB245q+3LNOBa/56yzEduOav91ymA9j8Lc90AJu/5zEdwOZvBaYD2Pw9n+kANn8rMh3A5m8lpgPY/K3MdACbvxcwHcDmbxWmA9j8vZDpADZ/qzIdwObvRUwHsPlbjekANn+rMx3A5m8NpgPY/K3JdACbv7WYDmDztzbTAWz+1mE6gM3fukwHsPlbj+kANn/rMx3A5m8DpiMX57iY6eiLczRkOvrhHJcwHQNwjkuZjoE4x2VMxyCc43KmYzDOcQXTkYdzNGI6huAcjZmOoThHE6ZjGM5xJdMxHOdoynSMwDmuYjpG4hzNmI5ROEdzpiMf52jBdBTiHFczHWNxjmuYjnE4x7VMx3ic4zqmYwLO0ZLpmIhzXM90TMI5WjEdU3COG5iOqTjHjUzHNJyjNdMxA+e4iemYiXPczHTMxjluYTrm4BxtmI65OEdbpmMeznEr0zEf57iN6ViAc9zOdCzCOe5gOpbgHO2YjqU4x51MxzKc4y6mYznOcTfTsQLnaM90rMQ57mE6VuEcHZiO1ThHR6ZjDc7RielYi3Pcy3QIztGZ6ViHc9zHdKzHObowHRtwjvuZjo04R1emYxPO0Y3p2IxzdGc6tuAcPZiObThHT6ZjO87Ri+nYgXM8wHTsxDl6Mx27cI5cpmM3ztGH6diLc/RlOvbhHA8yHftxjn5MxwGcoz/TcQjnGMB0HMY5HmI6juAcA5mOozjHw0zHMZxjENNxHOd4hOk4gXMMZjpO4hyPEh2eFJwjj+lIxTkeYzo8OMcQpiMd53ic6fDhHEOZjgDO8QTTkYlzDGM6QjjHk0xHBOcYznTEcI6nmI4cnGME05HAOZ5mOkrgHCOZjpI4xzNMRymcYxTTUQbnGM10lMM58pmO8jhHAdNRAecoZDoq4hxjmI7KOMdYpqMKzvEs0wHcp2Ec01EN53iO6aiBc4xnOmrhHM8zHcD9PyYwHcD9P15gOoD7f0xkOoD7f7zIdAD3/5jEdAD3/5jMdAD3/5jCdAD3/3iJ6QDu/zGV6QDu//Ey0wHc/2Ma0wHc/2M60wHc/2MG0wHc/+MVpgO4/8dMpgO4/8cspgO4/8dspgO4/8erTAdw/485TAdw/4/XmA7g/h9zmQ7g/h+vMx3A/T/mMR3A/T/eYDqA+3/MZzqA+3+8yXQA9/9YwHQA9/9YyHQA9/9YxHQA9/9YzHQA9/8w/KmgvFl/O1r06NKnMLK12GTxni3ekuI9R7ylxFtavGXEW1a85cR7rnjLi/c88VYQ7/nirSjeSuKtLN4LxFtFvBeKt6p4LxJvNfFWF28N8dYUby3x1hZvHfHWFW898dYXbwPxXizehuK9RLyXivcy8V4u3ivE20i8jcXbRLxXirepeK8SbzPxNhdvC/FeLd5rxHuteK8Tb0vxXi/eVuK9Qbw3ire1eG8S783ivUW8bcTbVry3ivc28d4u3jvE2068d4r3LvHeLd724r1HvB3E21G8ncR7r3g7i/c+8XYR7/3i7SrebuLtLt4e4u0p3l7ifUC8vcWbK94+4u0r3gfF20+8/cU7QLwPiXegeB8W7yDxPiLeweJ9VLx54n1MvEPE+7h4h4r3CfEOE++T4h0u3qfEO0K8T4t3pHifEe8o8Y4Wb754C7Shrr1obeNqB1Sbh9p305aVdnu0UaI9Bn08r0+29aGwPk/VR5H6FE8fgOmzI33sok8s9GZf75P1FlPvzvTGRu8J9HJar0T1Ik6vf/TSQb919QtLz/V6mtQzjH449bjWQ2L63+933qxGubmdeve5rVPvnoUFyRv7KVUkrbS+rHrHlr131JhceXGrpgvz8tq2q1RrT/MBS3rlN9lxpPCgvk5fJd4SBabDs0SBYTzvW0X6MEZMH8YU6yeoOO7DaHGc/qbkJ39TPKdWO+08w2qn6StNq73UwWqblwj4J8HeJjrSgD8pWMZ0AFu/7zAdwNbvcqYD2Pp9l+kAtn5XMB3A1u97TAew9buS6QC2ft9nOoCt31VMB7D1+wHTAWz9rmY6gK3fD5kOYOt3DdMBbP1+xHQAW79rmQ5g6/djpgPY+hWmA9j6/YTpALZ+1zEdwNbvp0wHsPW7nukAtn4/YzqArd8NTAew9fs50wFs/W5kOoCt3y+YDmDrdxPTAWz9fsl0AFu/m5kOYOv3K6YD2PrdwnQAW79bmY5cnGMb09EX5/ia6eiHc2xnOgbgHN8wHQNxjh1MxyCc41umYzDOsZPpyMM5vmM6huAcu5iOoTjH90zHMJxjN9MxHOfYw3SMwDn2Mh0jcY4fmI5ROMc+piMf5/iR6SjEOfYzHWNxjp+YjnE4xwGmYzzOcZDpmIBzHGI6JuIcPzMdk3COw0zHFJzjF6ZjKs5xhOmYhnP8ynTMwDmOMh0zcY7fmI7ZOMcxpmMOzvE70zEX5zjOdMzDOf5gOubjHCeYjgU4x59MxyKc4yTTsQQ2VHoxpgOX80pPYTqW4RxnMR3LcY5UpmMFzpHGdKzEOTxMxyqcw8t0rMY50pmONThHBtOxFufwMR2Cc/iZjnU4R4DpWI9zBJmODThHJtOxEefIYjo24RwhpmMzzhFmOrbgHBGmYxvOEWU6tuMcMaZjB86RzXTsxDlymI5dOEec6diNcySYjr04R3GmYx/OUYLp2I9znM10HMA5SjIdh3COc5iOwzhHKabjCM5Rmuk4inOUYTqO4RxlmY7jOEc5puMEznEu03ES5yhPdHhScI7zmI5UnKMC0+HBOc5nOtJxjopMhw/nqMR0BHCOykxHJs5xAdMRwjmqMB0RnONCpiOGc1RlOnJwjouYjgTOUY3pKIFzVGc6SuIcNZiOUjhHTaajDM5Ri+koh3PUZjrK4xx1mI4KOEddpqMizlGP6aiMc9RnOqrgHA2YDtw+DekXMx3VcI6GTEcNnOMSpqMWznEp04Hb/yP9MqYDt/9H+uVMB27/j/QrmA7c/h/pjZgO3P4f6Y2ZDtz+H+lNmA7c/h/pVzIduP0/0psyHbj9P9KvYjpw+3+kN2M6cPt/pDdnOnD7f6S3YDpw+3+kX8104Pb/SL+G6cDt/5F+LdOB2/8j/TqmA7f/R3pLpgO3/0f69UwHbv+P9FZMB27/j/QbmA7c/h/pNzIduP0/0lszHbj9P9JvYjpw+3+k38x04Pb/SL+F6cDt/5HehunA7f+R3pbpwO3/kX4r04Hb/yP9NqYDt/9H+u1MB27/j/Q7DI5Zfzta9OjSpzC6tdhk8S4T7zviXS7ed8W7QrzviXeleN8X7yrxfiDe1eL9ULxrxPuReNeK92Pxing/Ee868X4q3vXi/Uy8G8T7uXg3ivcL8W4S75fi3Szer8S7RbxbxbtNvF+Ld7t4vxHvDvF+K96d4v1OvLvE+714d4t3j3j3ivcH8e4T74/i3S/en8R7QLwHxXtIvD+L97B4fxHvEfH+Kt6j4v1NvMfE+7t4j4v3D/GeEO+f4j0p6cUk/dQf1ZH0VElPk3SPpHslPV3SMyTdJ+l+SQ9IelDSMyU9S9JDkh6W9IikRyU9JunZkp4j6XFJT0h6cUkvIelnS3pJST9H0ktJemlJLyPpZSW9nKSfK+nlJf08Sa8g6edLekVJryTplSX9AkmvIukXSnpVSb9I0qtJenVJryHpNSW9lqTXlvQ62lDXXrS2cbUDqs1D7btpy0q7Pdoo0R6DPp7XJ9v6UFifp+qjSH2Kpw/A9NmRPnbRJxZ6s6/3yXqLqXdnemOj9wR6Oa1XonoRp9c/eumg37r6haXnej1N6hlGP5x6XOshMf3v9ztvVqPc3E69+9zWqXfPwoJCw9GUVlrSyukLq3ds2XtHjcmVF7dqujAvr227SrX2NB+wpFd+kx1HCg/qK0+90Pt2geUA1ZcZxktvV6SPY9T0cUwxfoa8wD9T5cJhjjcA29x3Mh3AduRdTAewHXk30wFsR7ZnOoDtyHuYDmA7sgPTAWxHdmQ6gO3ITkwHsB15L9MBbEd2ZjqA7cj7mA5gO7IL0wFsR97PdADbkV2ZDmA7shvTAWxHdmc6gO3IHkwHsB3Zk+kAtiN7MR3AduQDTAewHdmb6QC2I3OZDmA7sg/TAWxH9mU6gO3IB5kOYDuyH9MBbEf2ZzqA7cgBTAewHfkQ0wFsRw5kOoDtyIeZDmA7chDTkYtzPMJ09MU5BjMd/XCOR5mOAThHHtMxEOd4jOkYhHMMYToG4xyPMx15OMdQpmMIzvEE0zEU5xjGdAzDOZ5kOobjHMOZjhE4x1NMx0icYwTTMQrneJrpyMc5RjIdhTjHM0zHWJxjFNMxDucYzXSMxznymY4JOEcB0zER5yhkOibhHGOYjik4x1imYyrO8SzTMQ3nGMd0zMA5nmM6ZuIc45mO2TjH80zHHJxjAtMxF+d4gemYh3NMZDrm4xwvMh0LcI5JTMcinGMy07EE55jCdABzXi8xHctwjqlMx3Kc42WmYwXOMY3pWIlzTGc6VuEcM5iO1TjHK0zHGpxjJtOxFueYxXQIzjGb6ViHc7zKdKzHOeYwHRtwjteYjo04x1ymYxPO8TrTsRnnmMd0bME53mA6tuEc85mO7TjHm0zHDpxjAdOxE+dYyHTswjkWMR27cY7FTMdenGMJ07EP53iL6diPcyxlOg7gHG8zHYdwjmVMx2Gc4x2m4wjOsZzpOIpzvMt0HMM5VjAdx3GO95iOEzjHSqbjJM7xPtHhScE5VjEdqTjHB0yHB+dYzXSk4xwfMh0+nGMN0xHAOT5iOjJxjrVMRwjn+JjpiOAcwnTEcI5PmI4cnGMd05HAOT5lOkrgHOuZjpI4x2dMRymcYwPTUQbn+JzpKIdzbGQ6yuMcXzAdFXCOTUxHRZzjS6ajMs6xmemognN8xXQA92nYwnRUwzm2Mh01cI5tTEctnONrpgO4/8d2pgO4/8c3TAdw/48dTAdw/49vmQ7g/h87mQ7g/h/fMR3A/T92MR3A/T++ZzqA+3/sZjqA+3/sYTqA+3/sZTqA+3/8wHQA9//Yx3QA9//4kekA7v+xn+kA7v/xE9MB3P/jANMB3P/jINMB3P/jENMB3P/jZ6YDuP/HYaYDuP/HL0wHcP+PI0wHcP+PX5kO4P4fR5kO4P4fvzEdwP0/jjEdwP0/fmc6gPt/HGc6gPt//MF0APf/MPw0+1/b0udbt6U/79T8SfeRL3WFk/nL6vwFlvnT/7SskpMqL5K0cwoNNV5kcaSdY9Im/wF7SpEd1XRYy1/bnd24d5du3bp0btK+W7cx3rF501t36dG5WyfbgWrowBZtwAvRA1YpwoAF1g9RGevRXm402iMew5ZsBafG7N6rWyfJKPbPP1OsJx9DniLv9cbd2nfo2rhn/6v69uhw6tjJm3Zjo5bNmhbkzWjTpU+PTrm5OnfZfx9dvoKiL3XYutThJEt98uTJ3/5Z6v/84pRT/3XaIp71zz9TLd8YKablOcv2stSyZ3CmDevi2c70jZ2c6XX+srb5mxRx/tFj/vOwBQdPFZBxlmXyjFTT10xj06uaGI6//7qQhq8GpYx28Badeo9Mb1BGmoPZK5pn9ziY/Xzz7F4nH46Qef50B/NXMM+e4erUELXN73M1f45tfr+r+SO2+QOW+f++mWnRo0ufwtjWYlfo51U/NHrk6sGj76Auojp0KEmr+v+K/0z/2/PvU36habmCyU/TGaaTeUbRv5VMb/2pk3nQ9tYbolWn3cfGoPexGbhcV0ZWEQ/h7P9ND+EC01dy+knrNUFWgW35TQdbqEgHW7bpYEshHGyhIn5ojeeV8H/reSXlzM4rxq/0iIO32vz+4PKJGVGiIw33u/OMGNOB+31wRjbTgft9cEYO04H7fXBGnOnA/T44I8F04H4fnFGc6cD9PjijBNOB+31wxtlMB+73wRklmQ7c74MzzmE6cL8PzijFdOB+H5xRmunA/T44owzTgft9cEZZpgP3++CMckwH7vfBGecyHbjfB2eUZzpwvw/OOI/pwP0+OKMC04H7fXDG+UwH7vfBGRWZDtzvgzMqMR243wdnVGY6cL8PzriA6cD9PjijCtOB+31wxoVMB+73wRlVmQ7c74MzLmI6cL8PzqjGdOB+H5xRnenA/T44owbTgft9cEZNpiMX56jFdPTFOWozHf1wjjpMxwCcoy7TMRDnqMd0DMI56jMdg3GOBkxHHs5xMdMxBOdoyHQMxTkuYTqG4RyXMh3DcY7LmI4ROMflTMdInOMKpmMUztGI6cjHORozHYU4RxOmYyzOcSXTMQ7naMp0jMc5rmI6JuAczZiOiThHc6ZjEs7RgumYgnNczXRMxTmuYTqm4RzXMh0zcI7rmI6ZOEdLpmM2znE90zEH52jFdMzFOW5gOubhHDcaHKfnynL+ypXFJCNbMnIkIy4ZCckoLhklJONsySgpGedIRinJKC0ZZSSjrGSUk4xzJaO8ZJwnGRUk43zJqCgZlSSjsrbuteutDWPttWqbUjt82hzTvpK2ZLSboY0AfYauj5/1ya0+9NTnhfqoTZ9S6QMefTaijxX0jlxvZvU+UG+h9O5DL9z1mlcvF/VKSy9S9Ptdvxr1W0VPyHou09OAfoL04NP3TclnmiurWoRcWdSWK4sWWMJGrYt0sOVgc2XAsJHFcQa5spuSTw7MlZ11Zrmym/JNlpsdvNXm9wf4O8JbiA5krqwN0wHMlbVlOoC5sluZDmCu7DamA5gru53pAObK7mA6gLmydkwHMFd2J9MBzJXdxXQAc2V3Mx3AXFl7pgOYK7uH6QDmyjowHcBcWUemA5gr68R0AHNl9zIdwFxZZ6YDeD94H9MBzJV1YTqAubL7mQ5grqwr0wHMlXVjOoC5su5MBzBX1oPpAObKejIdwFxZL6YDmCt7gOkA5sp6Mx3AXFku0wHMlfVhOoC5sr5MBzBX9iDTAcyV9WM6gLmy/kwHMFc2gOkA5soeYjqAubKBTAcwV/Yw0wHMlQ1iOoC5skeYDmCubDDTAcyVPcp0AHNleUwHMFf2GNMBzJUNYTqAubLHmQ5grmwo0wHMlT3BdABzZcOYDmCu7EmmA5grG850AHNlTzEdwFzZCKYDmCt7mukA5spGMh3AXNkzTAcwVzaK6QDmykYzHcBcWT7TAcyVFTAdwFxZIdMBzJWNYTqAubKxTAcwV/aswXF6riz+V66sjWS0lYxbJeM2ybhdMu6QjHaScadk3CUZd0tGe8m4RzI6SEZHyegkGfdKRmfJuE8yukjG/ZLRVTK6SUZ3bd1r11sbxtpr1Taldvi0OaZ9JW3JaDdDGwH6DF0fP+uTW33oqc8L9VGbPqXSBzz6bEQfK+gdud7M6n2g3kLp3YdeuOs1r14u6pWWXqTo97t+Neq3ip6Q9VympwH9BOnBp++bks80V3ZhEXJlt9hyZbcUWMJG44p0sMWxuTLgj8ssjjPIlT2XfHJgriz1zHJlz+WbLOMdvNXm9wd43/Y80YHMlU1gOoC5sheYDmCubCLTAcyVvch0AHNlk5gOYK5sMtMBzJVNYTqAubKXmA5grmwq0wHMlb3MdABzZdOYDmCubDrTAcyVzWA6gLmyV5gOYK5sJtMBzJXNYjqAubLZTAfw1v9VpgOYK5vDdABzZa8xHcBc2VymA5gre53pAObK5jEdwFzZG0wHMFc2n+kA5sreZDqAubIFTAcwV7aQ6QDmyhYxHcBc2WKmA5grW8J0AHNlbzEdwFzZUqYDmCt7m+kA5sqWMR3AXNk7TAcwV7ac6QDmyt5lOoC5shVMBzBX9h7TAcyVrWQ6gLmy95kOYK5sFdMBzJV9wHQAc2WrmQ5gruxDpgOYK1vDdABzZR8xHcBc2VqmA5gr+5jpAObKhOkA/j7xE6YDmCtbx3QAc2WfMh3AXNl6pgOYK/uM6QDmyjYwHcBc2edMBzBXtpHpAObKvmA6gLmyTUwHMFf2JdMBzJVtZjqAubKvDI7Tc2WJv3JlEyTjBcmYKBkvSsYkyZgsGVMk4yXJmCoZL0vGNMmYLhkzJOMVyZgpGbMkY7ZkvCoZcyTjNcmYKxmvS8Y8bd1r11sbxtpr1Taldvi0OaZ9JW3JaDdDGwH6DF0fP+uTW33oqc8L9VGbPqXSBzz6bEQfK+gdud7M6n2g3kLp3YdeuOs1r14u6pWWXqTo97t+Neq3ip6Q9VympwH9BOnBp++bks80VyaeB4uQLHvelix7vsASN9pSpMMtgU2WAS/nLY4zSJZtTT45MFmWdmbJsq35Jss2B2+1+f3Zhhvqa6IDmSzbznQAk2XfMB3AZNkOpgOYLPuW6QAmy3YyHcBk2XdMBzBZtovpACbLvmc6gMmy3UwHMFm2h+kAJsv2Mh3AZNkPTAcwWbaP6QAmy35kOoDJsv1MBzBZ9hPTAUyWHWA6gMmyg0wHMFl2iOkAJst+ZjqAybLDTAcwWfYL0wFMlh1hOoDJsl+ZDmCy7CjTAUyW/cZ0AJNlx5gOYLLsd6YDmCw7znQAk2V/MB3AZNkJpgOYLPuT6QAmy04yHbhkma8Y04FLlvlSmA5cssx3FtOBS5b5UpkOXLLMl8Z04JJlPg/TgUuW+bxMBy5Z5ktnOnDJMl8G04FLlvl8TAcuWebzMx24ZJkvwHTgkmW+INOBS5b5MpkOXLLMl8V04JJlvhDTgUuW+cJMBy5Z5oswHbifovqiTAcuWeaLMR24ZJkvm+nAJct8OUwHLlnmizMduGSZL8F04JJlvuJMBy5Z5ivBdOCSZb6zmQ5cssxXkunAJct85zAduGSZrxTTgUuW+UobHKcny4r/lSzbLhnfSMYOyfhWMnZKxneSsUsyvpeM3ZKxRzL2SsYPkrFPMn6UjP2S8ZNkHJCMg5JxSDJ+lozDkvGLZBzR1r12vbVhrL1WbVNqh0+bY9pX0paMdjO0EaDP0PXxsz651Yee+rxQH7XpUyp9wKPPRvSxgt6R682s3gfqLZTefeiFu17z6uWiXmnpRYp+v+tXo36r6AlZz2V6GtBPkB58+r4p+UyTZVWKkCv72pYr+7rAMJ6vTJEOtuLYXBkubGRyFD1X5iubfHJgrsxzRrkyX9l8k6Wcg7fa/P6Uww11LtEBzJX5yjMduFyZ7zymA5cr81VgOnC5Mt/5TAcuV+aryHTgcmW+SkwHLlfmq8x04HJlvguYDlyuzFeF6cDlynwXMh24XJmvKtOBy5X5LmI6cLkyXzWmA5cr81VnOnC5Ml8NpgOXK/PVZDpwuTJfLaYDlyvz1WY6cLkyXx2mA5cr89VlOnC5Ml89pgOXK/PVZzpwuTJfA6YDlyvzXcx04HJlvoZMBy5X5ruE6cDlynyXMh24XJnvMqYDlyvzXc504HJlviuYDlyuzNeI6cDlynyNmQ5crszXhOkA5squZDqAubKmTAcwV3YV0wHMlTVjOoC5suZMBzBX1oLpAObKrmY6gLmya5gOYK7sWqYDmCu7jukA5spaMh3AXNn1TAcwV9aK6QDmym5gOoC5shuZDmCurDXTAcyV3cR0AHNlNzMdwFzZLUwHMFfWhukA5sraMh3AXNmtTAcwV3Yb0wHMld3OdABzZXcwHcBcWTumA5gru5PpAObK7mI6gLmyu5kOYK6sPdMBzJXdY3CcnisrcSpX5isvvvPEV0F854uvovgqia+y+C4QXxXxXSi+quK7SHzVxFddfDXEV1N8tcRXW3x1xFdXfPXEV198DbR1r11vbRhrr1XblNrh0+aY9pW0JaPdDG0E6DN0ffysT271oac+L9RHbfqUSh/w6LMRfaygd+R6M6v3gXoLpXcfeuGu17x6uahXWnqRot/v+tWo3yp6QtZzmZ4G9BOkB5++b0o+4x3LTgXGUozJMt+5pmSZvswSN+pQpMOtBDRZhowbWRxnkCzrmHxyYLLMe2bJso75JksnB2+1+f0B/hLk3iK+1aZPYFppSStjemFZSStnW/DOxAVHRuDuYzqAEbguTAcwAnc/0wGMwHVlOoARuG5MBzAC153pAEbgejAdwAhcT6YDGIHrxXQAI3APMB3ACFxvpgMYgctlOoARuD5MBzAC15fpAEbgHmQ6gBG4fkwHMALXn+kARuAGMB3ACNxDTAcwAjeQ6QBG4B5mOoARuEFMBzAC9wjTAYzADWY6gBG4R5kO4IPPPKYDGIF7jOkARuCGMB3ACNzjTAcwAjeU6QBG4J5gOoARuGFMBzAC9yTTAYzADWc6gBG4p5gOYARuBNMBjMA9zXQAI3AjmQ5gBO4ZpgMYgRvFdAAjcKOZDmAELp/pAEbgCpgOYASukOkARuDGMB3ACNxYpgMYgXuW6QBG4MYxHcAI3HNMBzACN57pAEbgnmc6gBG4CUwHMAL3AtMBjMBNZDqAEbgXmQ5gBG4S0wGMwE1mOoARuClMBzAC9xLTAYzATWU6gBG4l5kOYARuGtMBjMBNZzqAETjDKeNfEbiz/4rA3Se+LuK7X3xdxddNfN3F10N8PcXXS3wPiK+3+HLF10d8fcX3oPj6ia+/+AaI7yHxDRTfw+IbJL5HtHWvXW9tGGuvVduU2uHT5pj2lbQlo90MbQToM3R9/KxPbvWhpz4v1Edt+pRKH/DosxF9rKB35Hozq/eBeguldx964a7XvHq5qFdaepGi3+/61ajfKnpC1nOZngb0E6QHn75vSv5fReDMQabOp9Y1aa6mlOVPgvzX+U3JunsLTe/rvZYqfa9YxipVtD9vcjY2fwf8bcIrRXxPjPm7mcknB+bv0s/ssJ1pOmx9sxy81eb3ZxZuqNlEBzLW9irTAYy1zWE6gLG215gOYKxtLtMBjLW9znQAY23zmA5grO0NpgMYa5vPdABjbW8yHcBY2wKmAxhrW8h0AGNti5gOYKxtMdMBjLUtYTqAsba3mA5grG0p0wGMtb3NdABjbcuYDmCs7R2mAxhrW850AGNt7zIdwFjbCqYDGGt7j+kAxtpWMh3AWNv7TAfw0fEqpgMYa/uA6QDG2lYzHcBY24dMBzDWtobpAMbaPmI6gLG2tUwHMNb2MdMBjLUJ0wGMtX3CdABjbeuYDmCs7VOmAxhrW890AGNtnzEdwFjbBqYDGGv7nOkAxto2Mh3AWNsXTAcw1raJ6QDG2r5kOoCxts1MBzDW9hXTAYy1bWE6gLG2rUwHMNa2jekAxtq+ZjqAsbbtTAcw1vYN0wGMte1gOoCxtm+ZDmCsbSfTAYy1fcd0AGNtu5gOYKzte6YDGGvbzXQAY217mA5grG0v0wGMtf3AdABjbfsMjtNjbSX/irW9Kr454ntNfHPF97r45onvDfHNF9+b4lsgvoXiWyS+xeJbIr63xLdUfG+Lb5n43hHfcvG9K74V4ntPW/fa9daGsfZatU2pHT5tjmlfSVsy2s3QRoA+Q9fHz/rkVh966vNCfdSmT6n0AY8+G9HHCnpHrjezeh+ot1B696EX7nrNq5eLeqWlFyn6/a5fjfqtoidkPZfpaUA/QXrw6fum5P9HO7sVs+bPZtt2dptdYIkb/Vikw60kNlkGjBtZHGeQLNtvmdySLEuxJMtSzixZtj/fZPnJsESvN+7WvkPXxj37X9W3R4cm7bt1y5t2Y6OWzZoW5M1o06VPj065uTpO2TMqM6OY6bhNP2nCHABhDpQ9s13gzrXuAneu7c05WMTj11xoeWuh5W2FHnJwwjB/PwFzfT8zHcBc32GmA5jr+4XpAOb6jjAdwFzfr0wHMNd3lOkA5vp+YzqAub5jTAcw1/c70wHM9R1nOoC5vj+YDmCu7wTTAcz1/cl0AHN9J5kOXK7PX4zpwOX6/ClMBy7X5z+L6cDl+vypTAcu1+dPYzpwuT6/h+nA5fr8XqYDl+vzpzMduFyfP4PpwOX6/D6mA5fr8/uZDlyuzx9gOnC5Pn+Q6cDl+vyZTAcu1+fPYjpwuT5/iOnA5fr8YaYDl+vzR5gOXK7PH2U6cLk+f4zpwOX6/NlMBy7X589hOnC5Pn+c6cDl+vwJpgOX6/MXZzpwuT5/CaYDl+vzn8104HJ9/pJMBy7X5z+H6cDl+vylmA5crs9fmunA5fr8ZZgOXK7PX5bpwOX6/OWYDlyuz38u04HL9fnLMx24XJ//PKYDl+vzV2A6cLk+//lMBy7X56/IdOByff5KTAcu1+evzHTgcn3+C5gOXK7PX4XpwOX6/BcyHbhcn78q04HL9fkvYjpwuT5/NaYDl+vzV2c6cLk+fw2D419Bq1OpH0OuzfIqf83kFZ5BystfyyKHpbyKFT0+lVZW0v80bTuXVtokrm2yXGGwzG7cu0u3bl06n8pXjcnIz5veukuPzt062Q6nWskn+GvE7r26dRJ/HVP4sMirW0tHth37dZMv7ZnMXne0i2PmVDLwQL7laCh1e1E/02NMP53tbDoU65lKbG06YG8/g8Mj2dy19Q2yJBdrm7T1XbzV/no6sOmt9huSTpbcpL9B2TM4y/vrm151cVHP8sjDseF/6+FY7Iyy4r6fTEdFTf1msx0Vlzgq1F/bWmhtW6GXFvUbyTMG/o1UtAFroAfUQ7QIQ1rOcHVTLee3VMNr6iavbLRVeSZnymTSOqdOQbbZTYfjZUU9HH0FRX2zkxzxJ0+e/OafIf/zhUTKqf8q+Od66vJ//nmF7dLK8s1wue1lV5T9v1+pJ5tfV+M/vy0FB/961eWmN+8Kw8oWeYNof32dfrSL02laaUm/0xrmr2Q7nTZyVehd1kIr2wpt7KrQu62FXmArtImrQttbC61iK/RKV4XeYy30QluhTc/geyD5/FpoB9v8V7mav6Nt/mau5u9km7+5q/nvtc3fwtX8nW3zX+1q/vts81/jav4utvmvdTX//bb5r3M1f1fb/C1dzd/NNv/1rubvbpu/lav5e9jmv8HV/D1t89/oav5etvlbu5r/Adv8N7mav7dt/ptdzZ9rm/8WV/P3sc3fxtX8fW3zt3U1/4O2+W91NX8/2/y3uZq/v23+213NP8A2/x2u5n/INn87V/MPtM1/p6v5H7bNf5er+QfZ5r/b1fyP2OZv72r+wbb573E1/6O2+Tu4mj/PNn9HV/M/Zpu/k6v5h9jmv9fV/I/b5u/sav6htvnvczX/E7b5u7iaf5ht/vtdzf+kbf6uruYfbpu/m6v5n7LN393V/CNs8/dwNf/Ttvl7upp/pG3+Xq7mf8Y2/wOu5h9lm7+3q/lH2+bPdTV/vm3+Pq7mL7DN39fV/IW2+R90Nf8Y2/z9XM0/1jZ/f1fzP2ubf4Cr+cfZ5n/I1fzP2eYf6Gr+8bb5H3Y1//O2+Qe5mn+Cbf5HXM3/gm3+wa7mn2ib/1FX879omz/P1fyTbPM/5mr+ybb5h7iaf4pt/sddzf+Sbf6hruafapv/CVfzv2ybf5ir+afZ5n/S1fzTbfMPdzX/DNv8T7ma/xXb/CNczT/TNv/TruafZZt/pKv5Z9vmf8bV/K/a5h/lav45tvlHu5r/Ndv8+a7mn2ubv8DV/K/b5i90Nf882/xjXM3/hm3+sa7mn2+b/1lX879pm3+cq/kX2OZ/ztX8C23zj3c1/yLb/M+7mn+xbf4JruZfYpv/BVfzv2Wbf6Kr+Zfa5n/R1fxv2+af5Gr+Zbb5J7ua/x3b/FNczb/cNv9LruZ/1zb/VFfzr7DN/7Kr+d+zzT/N1fwrbfNPdzX/+7b5Z7iaf5Vt/ldczf+Bbf6ZruZfbZt/lqv5P7TNP9vV/Gts87/qav6PbPPPcTX/Wtv8r7ma/2Pb/HNdzS+2+V93Nf8ntvnnuZp/nW3+N1zN/6lt/vmu5l9vm/9NV/N/Zpt/gav5N9jmX+hq/s9t8y9yNf9G2/yLXc3/hW3+Ja7m32Sb/y1X839pm3+pq/k32+Z/29X8X9nmX+Zq/i22+d9xNf9W2/zLXc2/zTb/u67m/9o2/wpX82+3zf+eq/m/sc2/0tX8O2zzv+9q/m9t869yNf9O2/wfuJr/O9v8q13Nv8s2/4eu5v/eNv8aV/Pvts3/kav599jmX+tq/r22+T92Nf8PtvnF1fz7bPN/4mr+H23zr3M1/37b/J+6mv8n2/zrXc1v++OY/s9czX/QNv8GV/Mfss3/uav5f7bNv9HV/Idt83/hav5fbPNvcjX/Edv8X7qa/1fb/JtdzX/UNv9Xrub/zTb/FlfzH7PNv9XV/L/b5t/mav7jtvm/djX/H7b5t7ua/4Rt/m8s8//9h+tb9OjSp/CcrcUmi7+R+BuLv4n4rxR/U/FfJf5m4m8u/hbiv1r814j/WvFfJ/6W4r9e/K3Ef4P4bxR/a/HfJP6bxX+L+NuIv634bxX/beK/Xfx3iL+d+O8U/13iv1v87cV/j/g7iL+j+DuJ/17xdxb/feLvIv77xd9V/N3E3138PcTfU/y9xP+A+HuLP1f8fcTfV/wPir+f+PuLf4D4HxL/QPE/LP5B4n9E/IPF/6j488T/mPiHiP9x8Q8V/xPiHyb+J8U/XPxPiX+E+J8W/0jxPyP+UeIfLf588ReIv1D8Y8Q/VvzPin+c+J8T/3jxPy/+CeJ/QfwTxf+i+CeJX9dnivhf0t6+tte1w61NZu3zaqtVu53acNSen7bdtPOlzSft/2gLRrsg2ojQXoA+jtcn4vpQWp8L66NZfTqqDyj1GaE+ptMnZfqwSp8X6SMbfWqiDy702YHevusdtN7E6n2k3srp3ZTe0Og9hV7W65W1Xtzq9aVe4ulVll7o6LWGft3rN65+6en3jp769eyrJ0A9B+lpQD+J+mHQ41EPiel/v99FPe48f/15zEttx90Ow3H3z4YJ50A3TLBMbh3q2yJ+fi1/aFGHvaww+SLWMf9Z8J1F/JCX+p8P+f8nP+QFhZajST/k31q+hU69cKft7zF/azqMvyvSOaOU6ZyRQjhnfIf/zv8/zr3Iv369y8Fqm5doF26o74mOtKo4x26mow7OsYfpqIdz7GU6GuAcPzAdDXGOfUzHpTjHj0zH5TjHfqajEc7xE9PRBOc4wHQ0xTkOMh3NcI5DTEcLnONnpuManOMw03EdzvEL03E9znGE6bgB5/iV6WiNcxxlOm7GOX5jOtrgHMeYjltxjt+ZjttxjuNMRzuc4w+m4y6c4wTT0R7n+JPp6IBznGQ6OsGGChRjOjrjHClMRxec4yymoyvOkcp0dMc50piOnjiHh+l4AOfwMh25OEc609EX58hgOvrhHD6mYwDO4Wc6BuIcAaZjEM4RZDoG4xyZTEcezpHFdAzBOUJMx1CcI8x0DMM5IkzHcJwjynSMwDliTMdInCOb6RiFc+QwHfk4R5zpKMQ5EkzHWJyjONMxDucowXSMxznOZjom4BwlmY6JOMc5TMcknKMU0zEF5yjNdEzFOcowHdNwjrJMxwycoxzTMRPnOJfpmI1zlGc65uAc5zEdc3GOCkzHPJzjfKZjPs5RkelYgHNUYjoW4RyVmY4lOMcFTMdSnKMK07EM57iQ6ViOc1RlOlbgHBcxHStxjmpMxyqcozrTsRrnqMF0rME5ajIda3GOWkyH4By1mY51OEcdpmM9zlGX6diAc9RjOjbiHPWZjk04RwOmYzPOcTHTsQXnaMh0bMM5LmE6tuMclzIduL8WE7iM6diJc1zOdOD+nkzgCqZjN87RiOnYi3M0Zjr24RxNmI79OMeVTMcBnKMp03EI57iK6TiMczRjOo7gHM2ZjqM4Rwum4xjOcTXTcRznuIbpOIFzXMt0nMQ5riM6PCk4R0umIxXnuJ7p8OAcrZiOdJzjBqbDh3PcyHQEcI7WTEcmznET0xHCOW5mOiI4xy1MRwznaMN05OAcbZmOBM5xK9NRAue4jekoiXPcznSUwjnuYDrK4BztmI5yOMedTEd5nOMupqMCznE301ER52jPdFTGOe5hOqrgHB2YDtw+DYGOTEc1nKMT01ED57iX6aiFc3RmOnD7fwTuYzpw+38EujAduP0/AvczHbj9PwJdmQ7c/h+BbkwHbv+PQHemA7f/R6AH04Hb/yPQk+nA7f8R6MV04Pb/CDzAdOD2/wj0Zjpw+38EcpkO3P4fgT5MB27/j0BfpgO3/0fgQaYDt/9HoB/Tgdv/I9Cf6cDt/xEYwHTg9v8IPMR04Pb/CAxkOnD7fwQeZjpw+38EBjEduP0/Ao8wHbj9PwKDmQ7g/h+PMh3A/T/ymA7g/h+PMR3A/T+GMB3A/T8eZzqA+38MZTqA+388YXDM+tvRokeXPoWltxabLP7d4t8j/r3i/0H8+8T/o/j3i/8n8R8Q/0HxHxL/z+I/LP5fxH9E/L+K/6j4fxP/MfH/Lv7j4v9D/CfE/6f4T0qgmAS0jLMkkCqBNAl4JOCVQLoEMiTgk4BfAgEJBCWQKYEsCYQkEJZARAJRCcQkkC2BHAnEJZCQQHEJlJDA2RIoKYFzJFBKAqUlUEYCZSVQTgLnSqC8BM6TQAUJnC+BihKoJIHKErhAAlUkcKEEqkrgIglUk0B1CdSQQE0J1JJAbQnUkUBdCdSTQH0JNJDAxRJoKIFLJHCpBC6TwOUSuEICjSTQWAJNJHClBJpK4CoJNJNAcwm0kMDVErhGAtdK4DoJtJTA9RJoJYEbJHCjBFpL4CYJ3CyBWyTQRgJtJXCrBG6TwO0SuEMC7SRwpwTu0oa69qK1jasdUG0eat9NW1ba7dFGifYY9PG8PtnWh8L6PFUfRepTPH0Aps+O9LGLPrHQm329T9ZbTL070xsbvSfQy2m9EtWLOL3+0UsH/dbVLyw91+tpUs8w+uHU41oPiel/v995sxrl5nbq3ee2Tr17FhYk/1vJKbXEX19fVr1jy947akyuvLhV04V5eW3bVaq1p/mAJb3ym+w4UnhQX6evEv/3BZbDU19mGC8wrEgfxtKmD2OK8RPkB4ZHLY7T35T85G+K56/VvtSw2mfpK02r/aSD1TYv0ZO4oYafwWonW53UuoWGuVMNr6lrei+eIr4XacCfRYxgOoDt66eZDmD7eiTTAWxfP8N0ANvXo5gOYPt6NNMBbF/nMx3A9nUB0wFsXxcyHcD29RimA9i+Hst0ANvXzzIdwPb1OKYD2L5+jukAtq/HMx3A9vXzTAewfT2B6QC2r19gOoDt64lMB7B9/SLTAWxfT2I6gO3ryUwHsH09hekAtq9fYjqA7eupTAewff0y0wFsX09jOoDt6+lMB7B9PYPpALavX2E6gO3rmUwHsH09i+nIxTlmMx19cY5XmY5+OMccpmMAzvEa0zEQ55jLdAzCOV5nOgbjHPOYjjyc4w2mYwjOMZ/pGIpzvMl0DMM5FjAdw3GOhUzHCJxjEdMxEudYzHSMwjmWMB35OMdbTEchzrGU6RiLc7zNdIzDOZYxHeNxjneYjgk4x3KmYyLO8S7TMQnnWMF0TME53mM6puIcK5mOaTjH+0zHDJxjFdMxE+f4gOmYjXOsZjrm4BwfMh1zcY41TMc8nOMjpmM+zrGW6ViAc3zMdCzCOYTpWIJzfMJ0LMU51jEdy3COT5mO5TjHeqZjBc7xGdOxEufYwHSswjk+ZzpW4xwbmY41OMcXTMdanGMT0yE4x5dMxzqcYzPTsR7n+Irp2IBzbGE6NuIcW5mOTTjHNqZjM87xNdOxBefYznRswzm+YTq24xw7mI4dOMe3TMdOnGMn0wH8C0TfMR27cY5dTMdenON7pmMfzrGb6diPc+xhOg7gHHuZjkM4xw9Mx2GcYx/TcQTn+JHpOIpz7Gc6juEcPzEdx3GOA0zHCZzjINNxEuc4RHR4UnCOn5mOVJzjMNPhwTl+YTrScY4jTIcP5/iV6QjgHEeZjkyc4zemI4RzHGM6IjjH70xHDOc4znTk4Bx/MB0JnOME01EC5/iT6SiJc5xkOkrBhgoWYzrK4BwpTEc5nOMspqM8zpHKdFTAOdKYjoo4h4fpqIxzeJmOKjhHOtOB26chmMF0VMM5fExHDZzDz3TUwjkCTAdu/49gkOnA7f8RzGQ6cPt/BLOYDtz+H8EQ04Hb/yMYZjpw+38EI0wHbv+PYJTpwO3/EYwxHbj9P4LZTAdu/49gDtOB2/8jGGc6cPt/BBNMB27/j2BxpgO3/0ewBNOB2/8jeDbTgdv/I1iS6cDt/xE8h+nA7f8RLMV04Pb/CJZmOnD7fwTLMB24/T+CZZkO3P4fwXJMB27/j+C5TAdu/49geaYDt/9H8DymA7f/R7AC04Hb/yN4PtOB2/8jWJHpwO3/EazEdOD2/whWZjpw+38ELzA4Zv3taNGjS5/CMluLTZbACAk8LYGREnhGAqMkMFoC+RIokEChBMZIYKwEnpXAOAk8J4HxEnheAhMk8IIEJkrgRQlMkoCOMEUCL0lgqgRelsA0CUyXwAwJvCKBmRKYJYHZEnhVAnMk8JoE5krgdQnMk8AbEpgvgTclsEACCyWwSAKLJbBEAm9JYKkE3pbAMgm8I4HlEnhXAisk8J4EVkrgfQmsksAHElgtgQ8lsEYCH0lgrQQ+loBI4BMJrJPApxJYL4HPJLBBAp9LYKMEvpDAJgl8KYHNEvhKAlsksFUC2yTwtQS2S+AbCeyQwLcS2CmB7ySwSwLfS2C3BPZIYK8EfpDAPgn8KIH9EvhJAgckcFAChyTwswQOS+AXCRyRwK8SOCqB3yRwTAK/S+C4BP6QwAkJ/CmBkxIsJsFTP22QYKo21LUXrW1c7YBq81D7btqy0m6PNkq0x6CP5/XJtj4U1uep+ihSn+LpAzB9dqSPXfSJhd7s632y3mLq3Zne2Og9gV5O65WoXsTp9Y9eOui3rn5h6bleT5N6htEPpx7XekhM//v9zpvVKDe3U+8+t3Xq3bOwoPD9stU7tuy9o8bkyotbNV2Yl9e2XaVae5oPWNIrv8mOI4UH9UARf30JDC80HHanXvhUgemHQ8MLDBMHqxTp41jG9HFMsf626Uncx9HiOP1tyU++2p5Tq+2/1LDaqfpK02pf6GC1zUt0IW6oqkRHGvBHBRcxHcDmbzWmA9j8rc50AJu/NZgOYPO3JtMBbP7WYjqAzd/aTAew+VuH6QA2f+syHcDmbz2mA9j8rc90AJu/DZgOYPP3YqYD2PxtyHQAm7+XMB3A5u+lTAew+XsZ0wFs/l7OdACbv1cwHcDmbyOmA9j8bcx0AJu/TZgOYPP3SqYD2PxtynQAm79XMR3A5m8zpgPY/G3OdACbvy2YDmDz92qmA9j8vYbpADZ/r2U6gM3f65iOXJyjJdPRF+e4nunoh3O0YjoG4Bw3MB0DcY4bmY5BOEdrpmMwznET05GHc9zMdAzBOW5hOobiHG2YjmE4R1umYzjOcSvTMQLnuI3pGIlz3M50jMI57mA68nGOdkxHIc5xJ9MxFue4i+kYh3PczXSMxznaMx0TcI57mI6JOEcHpmMSztGR6ZiCc3RiOqbiHPcyHdNwjs5Mxwyc4z6mYybO0YXpmI1z3M90zME5ujIdc3GObkzHPJyjO9MxH+fowXQswDl6Mh2LcI5eTMcSnOMBpmMpztGb6ViGc+QyHctxjj5Mxwqcoy/TsRLneJDpWIVz9GM6VuMc/ZmONTjHAKZjLc7xENMhOMdApmMdzvEw07Ee5xjEdGzAOR5hOjbiHIOZjk04x6NMx2acI4/p2IJzPMZ0bMM5hjAd23GOx5mOHTjHUKZjJ87xBNOxC+cYxnTsxjmeZDr24hzDmY59OMdTTMd+nGME03EA53ia6TiEc4xkOg7jHM8wHUdwjlFMx1GcYzTTcQznyGc6juMcBUzHCZyjkOk4iXOMITo8KTjHWKYjFed4lunw4BzjmI50nOM5psOHc4xnOgI4x/NMRybOMYHpCOEcLzAdEZxjItMRwzleZDpycI5JTEcC55jMdJTAOaYwHSVxjpeYjlI4x1SmowzO8TLTUQ7nmMZ0lMc5pjMdFXCOGUxHRZzjFaajMs4xk+mognPMYjqA+zTMZjqq4RyvMh01cI45TEctnOM1pgO4/8dcpgO4/8frTAdw/495TAdw/483mA7g/h/zmQ7g/h9vMh3A/T8WMB3A/T8WMh3A/T8WMR3A/T8WMx3A/T+WMB3A/T/eYjqA+38sZTqA+3+8zXQA9/9YxnQA9/94h+kA7v+xnOkA7v/xLtMB3P9jBdMB3P/jPaYDuP/HSqYDuP/H+0wHcP+PVUwHcP+PD5gO4P4fq5kO4P4fHzIdwP0/1jAdwP0/PmI6gPt/rGU6gPt/fMx0APf/MPxpgbxZfzta9OjSp7Ds1mKTJXiRBKtJsLoEa0iwpgRrSbC2BOtIsK4E60mwvgQbSPBiCTaU4CUSvFSCl0nwcgleIcFGEmwswSYSvFKCTSV4lQSbSbC5BFtI8GoJXiPBayV4nQRbSvB6CbaS4A0SvFGCrSV4kwRvluAtEmwjwbYSvFWCt0nwdgneIcF2ErxTgndJ8G4JtpfgPRLsIMGOEuwkwXsl2FmC90mwiwTvl2BXCXaTYHcJ9pBgTwn2kuADEuwtwVwJ9pFgXwk+KMF+EuwvwQESfEiCAyX4sAQHSfARCQ6W4KMSzJPgYxIcIsHHJThUgk9IcJgEn5TgcAk+JcEREnxagiMl+IwER0lwtATzJVggwUIJjpHgWAk+K8FxEnxOguMl+LwEJ0jwBQlOlOCLEpwkQV3YKRJ8SYJTJfiyBKdJcLo21LUXrW1c7YBq81D7btqy0m6PNkq0x6CP5/XJtj4U1uep+ihSn+LpAzB9dqSPXfSJhd7s632y3mLq3Zne2Og9gV5O65WoXsTp9Y9eOui3rn5h6bleT5N6htEPpx7XekhM//v9zpvVKDe3U+8+t3Xq3bOwIPkP71NqiL++vqx6x5a9d9SYXHlxq6YL8/LatqtUa0/zAUt65TfZcaTwoL5OXyXBqgWmw7NqgWG84CdF+jCWNX0YU6yfoAtxH0aL4/Q3JT/5m+I5tdr+Sw2rnaavNK32OgerbV4i4J8Q+ZToSAP+pGA90wFs/X7GdABbvxuYDmDr93OmA9j63ch0AFu/XzAdwNbvJqYD2Pr9kukAtn43Mx3A1u9XTAew9buF6QC2frcyHcDW7zamA9j6/ZrpALZ+tzMdwNbvN0wHsPW7g+kAtn6/ZTqArd+dTAew9fsd0wFs/e5iOoCt3++ZDmDrdzfTAWz97mE6gK3fvUwHsPX7A9MBbP3uYzqArd8fmQ5g63c/0wFs/f7EdABbvweYDmDr9yDTkYtzHGI6+uIcPzMd/XCOw0zHAJzjF6ZjIM5xhOkYhHP8ynQMxjmOMh15OMdvTMcQnOMY0zEU5/id6RiGcxxnOobjHH8wHSNwjhNMx0ic40+mYxTOcZLpyIcNlVmM6SjEOVKYjrE4x1lMxzicI5XpGI9zpDEdE3AOD9MxEefwMh2TcI50pmMKzpHBdEzFOXxMxzScw890zMA5AkzHTJwjyHTMxjkymY45OEcW0zEX5wgxHfNwjjDTMR/niDAdC3COKNOxCOeIMR1LcI5spmMpzpHDdCzDOeJMx3KcI8F0rMA5ijMdK3GOEkzHKpzjbKZjNc5RkulYg3Ocw3SsxTlKMR2Cc5RmOnC57cwyTMd6nKMs07EB5yjHdGzEOc5lOjbhHOWZjs04x3lMxxacowLTsQ3nOJ/p2I5zVGQ6duAclZiOnThHZaZjF85xAdOxG+eownTsxTkuZDr24RxVmY79OMdFTMcBnKMa03EI56jOdBzGOWowHUdwjppMx1GcoxbTcQznqM10HMc56jAdJ3COukzHSZyjHtHhScE56jMdqThHA6bDg3NczHSk4xwNmQ4fznEJ0xHAOS5lOjJxjsuYjhDOcTnTEcE5rmA6YjhHI6YjB+dozHQkcI4mTEcJnONKpqMkztGU6SiFc1zFdJTBOZoxHeVwjuZMR3mcowXTUQHnuJrpqIhzXMN0VMY5rmU6quAc1zEduH0aMlsyHdVwjuuZjho4RyumoxbOcQPTgdv/I/NGpgO3/0dma6YDt/9H5k1MB27/j8ybmQ7c/h+ZtzAduP0/MtswHbj9PzLbMh24/T8yb2U6cPt/ZN7GdOD2/8i8nenA7f+ReQfTgdv/I7Md04Hb/yPzTqYDt/9H5l1MB27/j8y7mQ7c/h+Z7ZkO3P4fmfcwHbj9PzI7MB24/T8yOzIduP0/MjsxHbj9PzLvZTpw+39kdmY6cPt/ZN7HdOD2/8jswnTg9v/IvJ/pwO3/kdmV6cDt/5HZjenA7f+R2Z3pwO3/kdmD6cDt/5HZk+nA7f+R2cvgmPW3o0WPLn0Ky20tNlmC6yX4mQQ3SPBzCW6U4BcS3CTBLyW4WYJfSXCLBLdKcJsEv5bgdgl+I8EdEvxWgjsl+J0Ed0nwewnuluAeCe6V4A8S3CfBHyW4X4I/SfCABA9K8JAEf5bgYQn+IsEjEvxVgkcl+JsEj0nwdwkel+AfEjwhwT8leFIyi0nmqT9cK5mpkpkmmR7J9EpmumRmSKZPMv2SGZDMoGRmSmaWZIYkMyyZEcmMSmZMMrMlM0cy45KZkMzikllCMs+WzJKSeY5klpLM0pJZRjLLSmY5yTxXMstL5nmSWUEyz5fMipJZSTIrS+YFkllFMi+UzKqSeZFkVpPM6pJZQzJrSmYtyawtmXUks65k1pPM+pLZQDIvlsyGknmJZF4qmZdJ5uWSeYVkNpLMxpLZRDKvlMymknmVZDaTzOaS2UIb6tqL1jaudkC1eah9N21ZabdHGyXaY9DH8/pkWx8K6/NUfRSpT/H0AZg+O9LHLvrEQm/29T5ZbzH17kxvbPSeQC+n9UpUL+L0+kcvHfRbV7+w9Fyvp0k9w+iHU49rPSSm//1+581qlJvbqXef2zr17llYUGg4mvz1xd9QX1i9Y8veO2pMrry4VdOFeXlt21Wqtaf5gCW98pvsOFJ4UF956oXBTwssB6i+zDBe5gNF+jiWM30cU4yfoSDwz1pYHKe/LfnWt+VS02r765tWu7ehytcbd2vfoWvjnv2v6tujQ5P23brlTbuxUctmTQvyZrTp0qdHp9xcHadskd8Uc1YD2LPPdXBwmR3A3mofpgPYW+3LdAB7qw8yHcDeaj+mA9hb7c90AHurA5gOYG/1IaYD2FsdyHQAe6sPMx3A3uogpgPYW32E6QD2VgczHcDe6qNMB7C3msd0AHurjzEdwN7qEKYD2Ft9nOkA9laHMh3A3uoTTAewtzqM6QD2Vp9kOoC91eFMB7C3+hTTAeytjmA6gL3Vp5kOYG91JNMB7K0+w3QAe6ujmA5gb3U00wHsreYzHcDeagHTkYtzFDIdfXGOMUxHP5xjLNMxAOd4lukYiHOMYzoG4RzPMR2DcY7xTEcezvE80zEE55jAdAzFOV5gOobhHBOZjuE4x4tMxwicYxLTMRLnmMx0jMI5pjAd+TjHS0xHIc4xlekYi3O8zHSMwzmmMR3jcY7pTMcEnGMG0zER53iF6ZiEc8xkOqbgHLOYjqk4x2ymYxrO8SrTMQPnmMN0zMQ5XmM6ZuMcc5mOOTjH60zHXJxjHtMxD+d4g+mYj3PMZzoW4BxvMh2LcI4FTMcSnGMh07EU51jEdCzDORYzHctxjiVMxwqc4y2mYyXOsZTpWIVzvM10rMY5ljEda3COd5iOtTjHcqZDcI53mQ5gCH0F07Ee53iP6diAc6xkOjbiHO8zHZtwjlVMx2ac4wOmYwvOsZrp2IZzfMh0bMc51jAdO3COj5iOnTjHWqZjF87xMdOxG+cQpmMvzvEJ07EP51jHdOzHOT5lOg7gHOuZjkM4x2dMx2GcYwPTcQTn+JzpOIpzbGQ6juEcXzAdx3GOTUzHCZzjS6bjJM6xmejwpOAcXzEdqTjHFqbDg3NsZTrScY5tTIcP5/ia6QjgHNuZjkyc4xumI4Rz7GA6IjjHt0xHDOfYyXTk4BzfMR0JnGMX01EC5/ie6SiJc+xmOkrhHHuYjjI4x16moxzO8QPTUR7n2Md0VMA5fmQ6KuIc+5mOyjjHT0xHFZzjANMB3KfhINNRDec4xHTUwDl+Zjpq4RyHmQ7g/h+/MB3A/T+OMB3A/T9+ZTqA+38cZTqA+3/8xnQA9/84xnQA9//4nekA7v9xnOkA7v/xB9MB3P/jBNMB3P/jT6YDuP/HSaYDt/9HVjGmA7f/R1YK04Hb/yPrLKYDt/9HVirTgdv/IyuN6cDt/5HlYTpw+39keZkO3P4fWelMB27/j6wMpgO3/0eWj+nA7f+R5Wc6cPt/ZAWYDtz+H1lBpgO3/0dWJtOB2/8jK4vpwO3/kRViOnD7f2SFmQ7c/h9ZEaYDt/9HVtTgOH0z9wLzZu6mF16sLzxVaNL93LNiRSzUsut8bfHXLTTMXttSob+uyZGdvKwiO+rosIbDK292495dunXr0vnUVvdjvGPzprfu0qNzt062Y8XQrCragDXRA9YowoDm47iB9ThuOBrtkYBhd7eCU2N279Wtk2Tl/PPPuPXzn20o+vXG3dp36Nq4Z/+r+vbocOrYyZt2Y6OWzZoW5M1o06VPj065uTp32X8fXb6Coi/1JdalviTJUp88efK3f5b6P7845dR/nbaIiX/+Wdxy0k4xLU/C9rLiZYv82f975Uzn0FL9HZxD/35DbPMPKOL8o8f852ELDv51DCdMJ97ils9Dqf6mVw0wHH//dSENXw1KGV3EJSqwjJx+UjLSLO+lvtD3c4FlCTLSTItewhXHY+UctnE8Js7ZrjheK+cXG8dr4pR0xUm3co7YOOkmzjmuOBlWzq82ToaJU8oVx2flHLVxfCZOaVccv5Xzm43jN3HKuOIErJxjNk7AxCnr4tLgVJW/227vyrma/7ht/nNdzf+Hbf7yruY/YZv/PFfz/2mbv4Kr+U/a5j/f0fz+Yrb5K7qaP8U2fyVX859lm7+yq/lTbfNf4Gr+NNv8VVzN77HNf6Gr+b22+au6mj/dNv9FrubPsM1fzdX8Ptv81V3N77fNX8PV/AHb/DVdzR+0zV/L1fyZtvlru5o/yzZ/HVfzh2zz13U1f9g2fz1X80ds89d3NX/UNn8DV/PHbPNf7Gr+bNv8DV3Nn2Ob/xJX88dt81/qav6Ebf7LXM1f3Db/5a7mL2Gb/wpX859tm7+Rq/lL2uZv7Gr+c2zzN3E1fynb/Fe6mr+0bf6mruYvY5v/Klfzl7XN38zV/OVs8zd3Nf+5tvlbuJq/vG3+q13Nf55t/mtczV/BNv+1ruY/3zb/da7mr2ibv6Wr+SvZ5r/e1fyVbfO3cjX/Bbb5b3A1fxXb/De6mv9C2/ytXc1f1Tb/Ta7mv8g2/82u5q9mm/8WV/NXt83fxtX8NWzzt7XM//fvWVv06NKn8Nytxa6QrBKSdbZkldTWu7artcWrbVFtJWo3Txtq2tPStpJ2drS5ov0NbTHoU3590K7PuvVxsz7x1Yeu+txTHz3q0z99AKfPwPQxlD4J0ocx+jxEH0noUwG9Mdd7Y7091TtEvUnT+yS9VdG7Bb1g12tmvWzVK0e9eNPrJ72E0asI/SLX71L9OtNvFD2p63lVT216dtEPuH7G9DDXI03fbF1vJU//2/PvnxwVmpbr1uSt1wzTj4kyiv6rKNNbf+rHRLfa3vrbDPP/81Pmc6E/ZbZMbh3q9iIewuX/Nz2ELb+3PHWAWH+TdnuBbflNB9sdRTrYypsOthTCwXZHET+0xvNKu//W80rKmZ1X2tnOK3c6eKvN78+duKHuIjrScH96LOtupgP3J6Ky2jMduD8RlXUP04H7E1FZHZgO3J+IyurIdOD+RFRWJ6YD9yeisu5lOnB/IiqrM9OB+xNRWfcxHbg/EZXVhenA/YmorPuZDtyfiMrqynTg/kRUVjemA/gnorozHcA/EdWD6QD+iaieTAfwT0T1YjqAfyLqAaYD+CeiejMdwD8Rlct0AP9EVB+mA/gnovoyHcA/EfUg0wH8E1H9mA7gn4jqz3QA/0TUAKYD+CeiHmI6gH8iaiDTAfwTUQ8zHcA/ETWI6QD+iahHmA7gn4gazHTk4hyPMh19cY48pqMfzvEY0zEA5xjCdAzEOR5nOgbhHEOZjsE4xxNMRx7OMYzpGIJzPMl0DMU5hjMdw3COp5iO4TjHCKZjBM7xNNMxEucYyXSMwjmeYTrycY5RTEchzjGa6RiLc+QzHeNwjgKmYzzOUch0TMA5xjAdE3GOsUzHJJzjWaZjCs4xjumYinM8x3RMwznGMx0zcI7nmY6ZOMcEpmM2zvEC0zEH55jIdMzFOV5kOubhHIav1H/lys77K1d2t2S1l6x7JKuDZHWUrE6Sda9kdZas+ySri2TdL1ldJaubZHWXrB6S1VOyeknWA5LVW7JyJauPZPWVrAe1da9db20Ya69V25Ta4dPmmPaVtCWj3QxtBOgzdH38rE9u9aGnPi/UR236lEof8OizEX2soHfkejOr94F6C6V3H3rhrte8ermoV1p6kaLf7/rVqN8qekLWc5meBvQTpAefvm9KPtNcWa0i5MrusuXK7iqwjDe5SAfbedhcGTBsZHGcQa5sSvLJgbmys84sVzYl32R5ycFbbX5/XsINNZXoQObKXmY6gLmyaUwHMFc2nekA5spmMB3AXNkrTAcwVzaT6QDmymYxHcBc2WymA5gre5XpAObK5jAdwFzZa0wHMFc2l+kA5speZzqAubJ5TAcwV/YG0wHMlc1nOoC5sjeZDmCubAHTAcyVLWQ6gLmyRUwHMFe2mOkA5sqWMB3AXNlbTAcwV7aU6QDmyt5mOoC5smVMBzBX9g7TAcyVLWc6gLmyd5kOYK5sBdMBzJW9x3QAc2UrmQ5grux9pgOYK1vFdABzZR8wHcBc2WqmA5gr+5DpAObK1jAdwFzZR0wHMFe2lukA5so+ZjqAuTJhOoC5sk+YDmCubB3TAcyVfcp0AHNl65kOYK7sM6YDmCvbwHQAc2WfMx3AXNlGpgOYK/uC6QDmyjYxHcBc2ZdMBzBXtpnpAObKvmI6gLmyLUwHMFe2lekA5sq2MR3AXNnXTAcwV7ad6QDmyr5hOoC5sh1MBzBX9i3TAcyV7TQ4Ts+VVfgrV/ayZE2TrOmSNUOyXpGsmZI1S7JmS9arkjVHsl6TrLmS9bpkzZOsNyRrvmS9KVkLJGuhZC2SrMWStUSy3tLWvXa9tWGsvVZtU2qHT5tj2lfSlox2M7QRoM/Q9fGzPrnVh576vFAftelTKn3Ao89G9LGC3pHrzazeB+otlN596IW7XvPq5aJeaelFin6/61ejfqvoCVnPZXoa0E+QHnz6vin5THNlNYuQK5tqy5VNLbCM912RDrYK2FwZMGxkcZxBrmxX8smBubLUM8uV7co3Wb538Fab35/vcUPtJjqQubI9TAcwV7aX6QDmyn5gOoC5sn1MBzBX9iPTAcyV7Wc6gLmyn5gOYK7sANMBzJUdZDqAubJDTAcwV/Yz0wHMlR1mOoC5sl+YDmCu7AjTAcyV/cp0AHNlR5kOYK7sN6YDmCs7xnQAc2W/Mx3AXNlxpgOYK/uD6QDmyk4wHcBc2Z9MBzBXdpLpwOXKQsWYDlyuLJTCdOByZaGzmA5criyUynTgcmWhNKYDlysLeZgOXK4s5GU6cLmyUDrTgcuVhTKYDlyuLORjOnC5spCf6cDlykIBpgOXKwsFmQ5criyUyXTgcmWhLKYDlysLhZgOXK4sFGY6cLmyUITpwOXKQlGmA5crC8WYDlyuLJTNdOByZaEcpgOXKwvFmQ5criyUYDpwubJQcaYDlysLlWA6cLmy0NlMBy5XFirJdOByZaFzmA5crixUiunA5cpCpZkOXK4sVIbpwOXKQmWZDlyuLFSO6cDlykLnMh24XFmoPNOBy5WFzmM6cLmyUAWmA5crC53PdOByZaGKBsfpubLz/8qV7ZGsvZL1g2Ttk6wfJWu/ZP0kWQck66BkHZKsnyXrsGT9IllHJOtXyToqWb9J1jHJ+l2yjkvWH5J1QrL+1Na9dr21Yay9Vm1TaodPm2PaV9KWjHYztBGgz9D18bM+udWHnvq8UB+16VMqfcCjz0b0sYLekevNrN4H6i2U3n3ohbte8+rlol5p6UWKfr/rV6N+q+gJWc9lehrQT5AefPq+KflMc2USeKoIybLdtmTZ7gLDeKFKRTrczscmy3BxI5Oj6MmyUOXkkwOTZWlnlCwLVc43WS5w8Fab358LcENVITqAybLQhUwHLlkWqsp04JJloYuYDlyyLFSN6cAly0LVmQ5csixUg+nAJctCNZkOXLIsVIvpwCXLQrWZDlyyLFSH6cAly0J1mQ5csixUj+nAJctC9ZkOXLIs1IDpwCXLQhczHbhkWagh04FLloUuYTpwybLQpUwHLlkWuozpwCXLQpczHbhkWegKpgOXLAs1YjpwybJQY6YDlywLNWE6gMmyK5kOYLKsKdMBTJZdxXQAk2XNmA5gsqw50wFMlrVgOoDJsquZDmCy7BqmA5gsu5bpACbLrmM6gMmylkwHMFl2PdMBTJa1YjqAybIbmA5gsuxGpgOYLGvNdACTZTcxHcBk2c1MBzBZdgvTAUyWtWE6gMmytkwHMFl2K9MBTJbdxnQAk2W3Mx3AZNkdTAcwWdaO6QAmy+5kOoDJsruYDmCy7G6mA5gsa890AJNl9zAdwGRZB6YDmCzryHQAk2WdmA5gsuxepgOYLOvMdACTZfcxHcBkWRemA5gsu5/pACbLDC26fyXLKp5KloUulFBVCV0koWoSqi6hGhKqKaFaEqotoToSqiuhehKqL6EGErpYQg0ldImELpXQZRK6XEL6P28kocbauteutzaMtdeqbUrt8GlzTPtK2pLRboY2AvQZuj5+1ie3+tBTnxfqozZ9SqUPePTZiD5W0DtyvZnV+0C9hdK7D71w12tevVzUKy29SNHvd/1q1G8VPSHruUxPA/oJ0oNP3zcln2myrIY9VxaqYsqV6cssYaNuRTrYKkJzZciwkcVxBrmy7sknB+bKPGeWK+ueb7L0cPBWm9+fHrihehIdyFxZL6YDmCt7gOkA5sp6Mx3AXFku0wHMlfVhOoC5sr5MBzBX9iDTAcyV9WM6gLmy/kwHMFc2gOkA5soeYjqAubKBTAcwV/Yw0wHMlQ1iOoC5skeYDmCubDDTAcyVPcp0AHNleUwHMFf2GNMBzJUNYTqAubLHmQ5grmwo0wHMlT3BdABzZcOYDmCu7EmmA5grG850AHNlTzEdwFzZCKYDmCt7mukA5spGMh3AXNkzTAcwVzaK6QDmykYzHcBcWT7TAcyVFTAdwFxZIdMBzJWNYTqAubKxTAcwV/Ys0wHMlY1jOoC5sueYDmCubDzTAcyVPc90AHNlE5gOYK7sBaYDmCubyHQAc2UvMh3AXNkkpgOYK5vMdABzZVOYDmCu7CWmA5grm8p0AHNlLzMdwFzZNKYDmCubznQAc2UzmA5gruwVpgOYK5vJdABzZbOYDmCubDbTAcyVvcp0AHNlc5gOYK7sNaYDmCszLMm/cmWV/sqV9ZLQAxLqLaFcCfWRUF8JPSihfhLqL6EBEnpIQgMl9LCEBknoEQkNltCjEsqT0GMSGiKhxyU0VEJPaOteu97aMNZeq7YptcOnzTHtK2lLRrsZ2gjQZ+j6+Fmf3OpDT31eqI/a9CmVPuDRZyP6WEHvyPVmVu8D9RZK7z70wl2vefVyUa+09CJFv9/1q1G/VfSErOcyPQ3oJ0gPPn3flHzGO5ad2ogsbk2W9bQly3oWWOJGrxfpcKuETZYB40YWxxkky+YlnxyYLPOeWbJsXr7J8oaDt9r8/ryBG2p+Ed9q0yfQX1/8DUwvvFj8DW0L/iZxwZERuAVMBzACt5DpAEbgFjEdwAjcYqYDGIFbwnQAI3BvMR3ACNxSpgMYgXub6QBG4JYxHcAI3DtMBzACt5zpAEbg3mU6gBG4FUwHMAL3HtMBjMCtZDqAEbj3mQ5gBG4V0wGMwH3AdAAjcKuZDmAE7kOmAxiBW8N0ACNwHzEdwAjcWqYDGIH7mOkARuCE6QBG4D5hOoARuHVMBzAC9ynTAYzArWc6gBG4z5gOYARuA9MBjMB9znQAI3AbmQ5gBO4LpgMYgdvEdAAjcF8yHcAI3GamAxiB+4rpAEbgtjAdwAjcVqYDGIHbxnQAI3BfMx3ACNx2pgMYgfuG6QBG4HYwHcAI3LdMBzACt5PpAEbgvmM6gBG4XUwHMAL3PdMBjMDtZjqAEbg9TAcwAreX6QBG4H5gOoARuH1MBzAC9yPTAYzA7Wc6gBG4n5gOYATuANMBjMAdZDqAEbhDTAcwAvcz0wGMwB1mOoARuF8MjtMjcJX/isAtkNBCCS2S0GIJLZHQWxJaKqG3JbRMQu9IaLmE3pXQCgm9J6GVEnpfQqsk9IGEVkvoQwmtkdBHElqrrXvtemvDWHut2qbUDp82x7SvpC0Z7WZoI0CfoevjZ31yqw899XmhPmrTp1T6gEefjehjBb0j15tZvQ/UWyi9+9ALd73m1ctFvdLSixT9ftevRv1W0ROynsv0NKCfID349H1T8v8qAmcOMr15al2T5mpKWf4U03+d35Ssm19oel/nW6oMHbGMVapof1aqMjZ/9wbuWD9SxPfEmL/7NfnkwPxd+pkdtr+aDtvQUQdvtfn9OYob6jeiAxlrO8Z0AGNtvzMdwFjbcaYDGGv7g+kAxtpOMB3AWNufTAcw1naS6cDF2sLFmA5crC2cwnTgYm3hs5gOXKwtnMp04GJt4TSmAxdrC3uYDlysLexlOnCxtnA604GLtYUzmA5crC3sYzpwsbawn+nAxdrCAaYDF2sLB5kOXKwtnMl04GJt4SymAxdrC4eYDlysLRxmOnCxtnCE6cDF2sJRpgMXawvHmA5crC2czXTgYm3hHKYDF2sLx5kOXKwtnGA6cLG2cHGmAxdrC5dgOnCxtvDZTAcu1hYuyXTgYm3hc5gOXKwtXIrpwMXawqWZDlysLVyG6cDF2sJlmQ5crC1cjunAxdrC5zIduFhbuDzTgYu1hc9jOnCxtnAFpgMXawufz3TgYm3hikwHLtYWrsR04GJt4cpMBy7WFr6A6cDF2sJVmA5crC18IdOBi7WFqzIduFhb+CKmAxdrC1djOnCxtnB1pgMXawvXYDpwsbZwTaYDF2sL12I6cLG2cG2mAxdrC9dhOnCxtnBdpgMXawvXYzpwsbZwfYPj9FjbBX/F2o5J6HcJHZfQHxI6IaE/JXRSwsUkfOoHqBJOlXCahD0S9ko4XcIZEvZJ2C/hgISDEs6UcJaEQ9q61663Noy116ptSu3waXNM+0raktFuhjYC9Bm6Pn7WJ7f60FOfF+qjNn1KpQ949NmIPlbQO3K9mdX7QL2F0rsPvXDXa169XNQrLb1I0e93/WrUbxU9Ieu5TE8D+gnSg0/fNyX/P9rZLceaP/vNtrPbbwWG8cINinS4XYBNluHiRiZH0ZNl4Ystk1uSZSmWZFnKGSXLwhfnmyyG0Efe6427te/QtXHP/lf17dGhSftu3fKm3dioZbOmBXkz2nTp06NTbq6OU/aMyszKMR23WdkmzCUgzCVli/5p9R0Uf33rC41vzqVFPH5thR6yFnrIXOhlDk4Y5u8nXK4vfDnTgcv1ha9gOnC5vnAjpgOX6ws3Zjpwub5wE6YDl+sLX8l04HJ94aZMBzDXdxXTAcz1NWM6gLm+5kwHMNfXgukA5vquZjqAub5rmA5gru9apgOY67uO6QDm+loyHcBc3/VMBzDX14rpAOb6bmA6gLm+G5kOYK6vNdMBzPXdxHQAc303Mx3AXN8tTAcw19eG6QDm+toyHcBc361MBzDXdxvTAcz13c50AHN9dzAdwFxfO6YDmOu7k+kA5vruYjqAub67mQ5grq890wHM9d3DdABzfR2YDmCuryPTAcz1dWI6gLm+e5kOYK6vM9MBzPXdx3QAc31dmA5gru9+pgOY6+vKdABzfd2YDmCurzvTAcz19WA6gLm+nkwHMNfXi+kA5voeYDqAub7eTAcw15fLdABzfX2YDmCury/TAcz1Pch0AHN9/ZgOYK6vP9MBzPUNYDqAub6HmA5grm8g0wHM9T3MdABzfYOYDmCu7xGD419Bq1OpH0OuzfKqcPLniSlnkvJ61CKHpbzOIMjjry+ZvU0vvFiyYvkmtOGZZt7sxr27dOvWpfOp8NSYjPy86a279OjcrZPtWDGEKv4asXuvbp0k/JgpWVjk5FkDHdl2YA9JvmhnMvuQ0UU8IMyxv0tM73Opl4r6gR1jWa7Qm6aD7HFTieNNn6yXzuDwSDb3xfoGWWKJF5u0Q1281eHHdWDbR/oJw/yWUOQTZc/gFB4eanrVsKKewpGH45P/rYdjsTMKgocbmo6Kwfq1ZTsqhrsqNM9aaJ6t0KeK+o3kGQP/RiragPXQA+ohWoQhLWe4S1It57dUw2sMkevRVuWZnCmTSRueOgXZZjcdjiOKejj6Cor6Zic54k+ePPnNP0P+5wuJlFP/VfDP9dTT//xzpO3SyvLN8LTtZSPL/t8vw5PNr6vxn9+WgoN/vepp05s30rCyRd79OTxUpx/t4nR66gI/13iB729kO50+46rQPtZCG9sKHeWq0L7WQpvYCnX21j9oLfRKW6H5rgrtZy20qa3QAleF9rcWepWt0EJXhQ6wFtrMVugYV4U+ZC20ua3Qsa4KHWgttIWt0GddFfqwtdCrbYWOc1XoIGuh19gKfc5VoY9YC73WVuh4V4UOthZ6na3Q510V+qi10Ja2Qie4KjTPWuj1tkJfcFXoY9ZCW9kKneiq0CHWQm+wFfqiq0IftxZ6o63QSa4KHWottLWt0MmuCn3CWuhNtkKnuCp0mLXQm22FvuSq0Cethd5iK3Sqq0KHWwttYyv0ZVeFPmUttK2t0GmuCh1hLfRWW6HTXRX6tLXQ22yFznBV6EhrobfbCn3FVaHPWAu9w1boTFeFjrIW2s5W6CxXhY62FnqnrdDZrgrNtxZ6l63QV10VWmAt9G5boXNcFVpoLbS9rdDXXBU6xlroPbZC57oqdKy10A62Ql93Veiz1kI72gqd56rQcdZCO9kKfcNVoc9ZC73XVuh8V4WOtxba2Vbom64Kfd5a6H22Qhe4KnSCtdAutkIXuir0BWuh99sKXeSq0InWQrvaCl3sqtAXrYV2sxW6xFWhk6yFdrcV+parQidbC+1hK3Spq0KnWAvtaSv0bVeFvmQttJet0GWuCp1qLfQBW6HvuCr0ZWuhvW2FLndV6DRrobm2Qt91Veh0a6F9bIWucFXoDGuhfW2Fvueq0FeshT5oK3Slq0JnWgvtZyv0fVeFzrIW2t9W6CpXhc62FjrAVugHrgp91VroQ7ZCV7sqdI610IG2Qj90Vehr1kIfthW6xlWhc62FDrIV+pGrQl+3FvqIrdC1rgqdZy10sK3Qj10V+oa1UOPP8cVVofOthRp/jv+Jq0LftBb6mK3Qda4KXWAtdIit0E9dFbrQWujjtkLXuyp0kbVQY+LpM1eFLrYW+oSt0A2uCl1iLXSYrdDPXRX6lrXQJ22FbnRV6FJrocNthX7hqtC3rYU+ZSt0k6tCl1kLHWEr9EtXhb5jLfRpW6GbXRW63FroSFuhX7kq9F1roc/YCt3iqtAV1kJH2Qrd6qrQ96yFjrYVus1VoSuthebbCv3aVaHvWwstsBW63VWhq6yFFtoK/cZVoR9YCx1jK3SHq0JXWwsdayv0W1eFfmgt9FlboTtdFbrGWug4W6HfuSr0I2uhz9kK3eWq0LXWQsfbCv3eVaEfWwt93lbobleFirXQCbZC97gq9BNroS/YCt3rqtB11kIn2gr9wVWhn1oLfdFW6D5Xha63FjrJVuiPrgr9zFroZFuh+10VusFa6BRboT+5KvRza6Ev2Qo94KrQjdZCp9oKPeiq0C+shb5sK/SQq0I3WQudZiv0Z1eFfmktdLqt0MOuCt1sLXSGrdBfXBX6lbXQV2yFHnFV6BZroTNthf7qqtCt1kJn2Qo96qrQbdZCZ9sK/c1VoV9bC33VVugxV4VutxY6x1bo764K/cZa6Gu2Qo+7KnSHtdC5tkL/cFXot9ZCX7cVesJVoTuthc6zFfqnq0K/sxb6hq3Qk64K3WUtdL6p0EgxV4V+by30TVuhKa4K3W0tdIGt0LNcFbrHWuhCW6Gprgrday10ka3QNFeF/mAtdLGtUI+rQvdZC11iK9TrqtAfrYW+ZSs03VWh+62FLrUVmuGq0J+shb5tK9TnqtAD1kKX2Qr1uyr0oLXQd2yFBlwVesha6HJboUFXhf5sLfRdW6GZrgo9bC10ha3QLFeF/mIt9D1boSFXhR6xFrrSVmjYVaG/Wgt931ZoxFWhR62FrrIVGnVV6G/WQj+wFRpzVegxa6GrbYVmuyr0d2uhH9oKzXFV6HFroWtshcZdFfqHtdCPbIUmXBV6wlroWluhxV0V+qe10I9thZZwVehJa6FiK/RsR4VmFbMW+omt0JKuCk2xFrrOVug5rgo9y1rop7ZCS7kqNNVa6HpboaVdFZpmLfQzW6FlXBXqsRa6wVZoWVeFeq2Ffm4rtJyrQtOthW60FXquq0IzrIV+YSu0vKtCfdZCN9kKPc9VoX5roV/aCq3gqtCAtdDNtkLPd1Vo0FroV7ZCK7oqNNNa6BZboZVcFZplLXSrrdDKrgoNWQvdZiv0AleFhq2Ffm0rtIqrQiPWQrfbCr3QVaFRa6Hf2Aqtain07412W/To0qewytZikyX8jIRHSXi0hPMlXCDhQgmPkfBYCT8r4XESfk7C4yX8vIQnSPgFCU+U8IsSniRh/R9OkfBLEp4q4ZclPE3C0yU8Q8KvSHimhGdJeLaEX5XwHAm/JuG5En5dwvMk/IaE50v4TQkvkPBCCS+S8GIJL5HwWxJeKuG3JbxMwu9IeLmE35XwCgm/J+GVEn5fwqsk/IGEV0v4QwmvkfBHEl4r4Y8lLBL+RMLrJPyphNdL+DMJb5Dw5xLeKOEvJLxJwl9KeLOEv5LwFglvlfA2CX8t4e0S/kbCOyT8rYR3Svg7Ce+S8PcS3i3hPRLeK+EfJLxPwj9KeL+Ef5LwAQkflPAhCf8s4cMS/kXCRyT8q4SPSvg3CR+T8O8SPi7hPyR8QsJ/aptfG+jamtamr7ZTtVGpLUBtrmnbShtC2mrRJoa2B/TBuz7S1ofF+hhWH3Dqo0N9KKePu/RBkj6i0Ycf+lhBb9j1VlhvMvX2TW+M9JZDL+b1MlkvQPXSTi+a9HJEv+j1K1S/nPS0rydUPVXpSUA/Xnrg6iEx/e/3+18HqOEP9Hr+2vHLlp6NXGQ47v7Z4LkKdINny+TWoao5+KCnSPjUX0FPtogNrTudRqoX8UN+4f98yP8/+SEvMBx1pz7kkWqWb6FTL6xeYPsUmQ7jGkU6Z1xoOmekEM4ZNYp4zrCfe4EbekZqOlht8xLVxA1Vi+hIq4pz1GY66uAcdZiOejhHXaajAc5Rj+loiHPUZzouxTkaMB2X4xwXMx2NcI6GTEcTnOMSpqMpznEp09EM57iM6WiBc1zOdFyDc1zBdFyHczRiOq7HORozHTfgHE2YjtY4x5VMx804R1Omow3OcRXTcSvO0YzpuB3naM50tMM5WjAdd+EcVzMd7XGOa5iODjjHtUxHJ5zjOqajM87RkunognNcz3R0xTlaMR3dcY4bmI6eOMeNTMcDOEdrpiMX57iJ6eiLc9zMdPTDOW5hOgbgHG2YjoE4R1umYxDOcSvTMRjnuI3pyMM5bmc6huAcdzAdQ3GOdkzHMJzjTqZjOM5xF9MxAue4m+kYiXO0ZzpG4Rz3MB35OEcHpqMQ5+jIdIzFOToxHeNwjnuZjvE4R2emYwLOcR/TMRHn6MJ0TMI57mc6puAcXZmOqThHN6ZjGs7RnemYgXP0YDpm4hw9mY7ZOEcvpmMOzvEA0zEX5+jNdMzDOXKZjvk4Rx+mYwHO0ZfpWIRzPMh0LME5+jEdS3GO/kzHMpxjANOxHOd4iOlYgXMMZDpW4hwPMx2rcI5BTMdqnOMRpmMNzjGY6ViLczzKdAjOkcd0rMM5HmM61uMcQ5iODTjH40zHRpxjKNOxCed4gunYjHMMYzq24BxPMh3bcI7hTMd2nOMppmMHzjGC6diJczzNdOzCOUYyHbtxjmeYjr04xyimYx/OMZrp2I9z5DMdB3COAqbjEM5RyHQcxjnGMB1HcI6xTMdRnONZpuMYzjGO6TiOczzHdJzAOcYzHSdxjueJDk8KzjGB6UjFOV5gOjw4x0SmIx3neJHp8OEck5iOAM4xmenIxDmmMB0hnOMlpiOCc0xlOmI4x8tMRw7OMY3pSOAc05mOEjjHDKajJM7xCtNRCueYyXSUwTlmMR3lcI7ZTEd5nONVpqMCzjGH6aiIc7zGdFTGOeYyHVVwjteZDuA+DfOYjmo4xxtMRw2cYz7TUQvneJPpAO7/sYDpAO7/sZDpAO7/sYjpAO7/sZjpAO7/sYTpAO7/8RbTAdz/YynTAdz/422mA7j/xzKmA7j/xztMB3D/j+VMB3D/j3eZDuD+HyuYDuD+H+8xHcD9P1YyHcD9P95nOoD7f6xiOoD7f3zAdAD3/1jNdAD3//iQ6QDu/7GG6QDu//ER0wHc/2Mt0wHc/+NjpgO4/4cwHcD9Pz5hOoD7f6xjOoD7f3zKdAD3/1jPdAD3//iM6QDu/2GIgOfN+tvRokeXPoVVtxabLJHaEqkjkboSqSeR+hJpIJGLJdJQIpdI5FKJXCaRyyVyhUQaSaSxRJpI5EqJNJXIVRJpJpHmEmkhkaslco1ErpXIdRJpKZHrJdJKIjdI5EaJtJbITRK5WSK3SKSNRNpK5FaJ3CaR2yVyh0TaSeROidwlkbsl0l4i90ikg0Q6SqSTRO6VSGeJ3CeRLhK5XyJdJdJNIt0l0kMiPSXSSyIPSKS3RHIl0kcifSXyoET6SaS/RAZI5CGJDJTIwxIZJJFHJDJYIo9KJE8ij0lkiEQel8hQiTwhkWESeVIiwyXylERGSORpiYyUyDMSGSWR0RLJl0iBRAolMkYiYyXyrETGSeQ5iYyXyPMSmSCRFyQyUSIvSmSSRHQZp0jkJYlMlcjLEpkmkekSmSGRVyQyUyKzJDJbIq9qQ1170drG1Q6oNg+176YtK+32aKNEewz6eF6fbOtDYX2eqo8i9SmePgDTZ0f62EWfWOjNvt4n6y2m3p3pjY3eE+jltF6J6kWcXv/opYN+6+oXlp7r9TSpZxj9cOpxrYfE9L/f77xZjXJzO/Xuc1un3j0LC5IHhVIaSHiovqx6x5a9d9SYXHlxq6YL8/LatqtUa0/zAUt65TfZcaTwoL5OXyWRWgWmw7NWgWG8yOdF+jBWNX0YU6yfoJq4D6PFcfqbkp/8TfGcWu3wU4bVPktfaVrtjQ5W27xEwD/18MUZrHay1Um9pNAwd6rhNZeY3otNxPciDfiziC+ZDmD7ejPTAWxff8V0ANvXW5gOYPt6K9MBbF9vYzqA7euvmQ5g+3o70wFsX3/DdADb1zuYDmD7+lumA9i+3sl0ANvX3zEdwPb1LqYD2L7+nukAtq93Mx3A9vUepgPYvt7LdADb1z8wHcD29T6mA9i+/pHpALav9zMdwPb1T0wHsH19gOkAtq8PMh3A9vUhpgPYvv6Z6QC2rw8zHcD29S9MB7B9fYTpALavf2U6gO3ro0xHLs7xG9PRF+c4xnT0wzl+ZzoG4BzHmY6BOMcfTMcgnOME0zEY5/iT6cjDOU4yHUNgQ0WLMR1DcY4UpmMYznEW0zEc50hlOkbgHGlMx0icw8N0jMI5vExHPs6RznQU4hwZTMdYnMPHdIzDOfxMx3icI8B0TMA5gkzHRJwjk+mYhHNkMR1TcI4Q0zEV5wgzHdNwjgjTMQPniDIdM3GOGNMxG+fIZjrm4Bw5TMdcnCPOdMzDORJMx3ycozjTsQDnKMF0LMI5zmY6luAcJZmOpTjHOUzHMpyjFNOxHOcozXSswDnKMB0rcY6yTMcqnKMc07Ea5ziX6ViDc5RnOtbiHOcxHYJzVGA61uEc5zMd63GOikzHBpyjEtOB+5sG0cpMxyac4wKmYzPOUYXp2IJzXMh0bMM5qjId23GOi5iOHThHNaZjJ85RnenYhXPUYDp24xw1mY69OEctpmMfzlGb6diPc9RhOg7gHHWZjkM4Rz2m4zDOUZ/pOIJzNGA6juIcFzMdx3COhkzHcZzjEqbjBM5xKdNxEue4jOjwpOAclzMdqTjHFUyHB+doxHSk4xyNmQ4fztGE6QjgHFcyHZk4R1OmI4RzXMV0RHCOZkxHDOdoznTk4BwtmI4EznE101EC57iG6SiJc1zLdJTCOa5jOsrgHC2ZjnI4x/VMR3mcoxXTUQHnuIHpqIhz3Mh0VMY5WjMdVXCOm5gO3D4N0ZuZjmo4xy1MRw2cow3TUQvnaMt04Pb/iN7KdOD2/4jexnTg9v+I3s504Pb/iN7BdOD2/4i2Yzpw+39E72Q6cPt/RO9iOnD7f0TvZjpw+39E2zMduP0/ovcwHbj9P6IdmA7c/h/RjkwHbv+PaCemA7f/R/RepgO3/0e0M9OB2/8jeh/Tgdv/I9qF6cDt/xG9n+nA7f8R7cp04Pb/iHZjOnD7f0S7Mx24/T+iPZgO3P4f0Z5MB27/j2gvpgO3/0f0AaYDt/9HtDfTgdv/I5rLdOD2/4j2YTpw+39E+zIduP0/og8yHbj9P6KGLR/yZv3taNGjS5/Ci7YWmyyRLyWyWSJfSWSLRLZKZJtEvpbIdol8I5EdEvlWIjsl8p1Edknke4nslsgeieyVyA8S2SeRHyWyXyI/SeSARA5K5JBEfpbIYYn8IpEjEvlVIkcl8ptEjknkd4kcl8gfEjkhkT8lclKixSR66m+DSzRVomkS9UjUK9F0iWZI1CdRv0QDEg1KNFOiWRINSTQs0YhEoxKNSTRbojkSjUs0IdHiEi0h0bMlWlKi50i0lERLS7SMRMtKtJxEz5VoeYmeJ9EKEj1fohUlWkmilSV6gUSrSPRCiVaV6EUSrSbR6hKtIdGaEq0l0doSrSPRuhKtJ9H6Em0g0Ysl2lCil0j0UoleJtHLJXqFRBtJtLFEm0j0Sok2lehVEm0m0eYSbSHRqyV6jUSvleh1Em0p0esl2kob6tqL1jaudkC1eah9N21ZabdHGyXaY9DH8/pkWx8K6/NUfRSpT/H0AZg+O9LHLvrEQm/29T5ZbzH17kxvbPSeQC+n9UpUL+L0+kcvHfRbV7+w9Fyvp0k9w+iHU49rPSSm//1+581qlJvbqXef2zr17llYUPh+2eodW/beUWNy5cWtmi7My2vbrlKtPc0HLOmV32THkcKDeqBIeKhEvig0HHanXripwHKARr4oMEwc7V+kj+NFpo9jivEzFAH++QGL4/S3JT/5antOrXb4KcNqp+orTas9wMFqm5cIt7lL9CGiIw34o4KBTAew+fsw0wFs/g5iOoDN30eYDmDzdzDTAWz+Psp0AJu/eUwHsPn7GNMBbP4OYTqAzd/HmQ5g83co0wFs/j7BdACbv8OYDmDz90mmA9j8Hc50AJu/TzEdwObvCKYD2Px9mukANn9HMh3A5u8zTAew+TuK6QA2f0czHcDmbz7TAWz+FjAdwOZvIdMBbP6OYTqAzd+xTAew+fss0wFs/o5jOoDN3+eYDmDzdzzTAWz+Ps905OIcE5iOvjjHC0xHP5xjItMB7A++yHQMxDkmMR2DcI7JTMdgnGMK05GHc7zEdAzBOaYyHUNxjpeZjmE4xzSmYzjOMZ3pGIFzzGA6RuIcrzAdo3COmUxHPs4xi+koxDlmMx1jcY5XmY5xOMccpmM8zvEa0zEB55jLdEzEOV5nOibhHPOYjik4xxtMx1ScYz7TMQ3neJPpmIFzLGA6ZuIcC5mO2TjHIqZjDs6xmOmYi3MsYTrm4RxvMR3zcY6lTMcCnONtpmMRzrGM6ViCc7zDdCzFOZYzHctwjneZjuU4xwqmYwXO8R7TsRLnWMl0rMI53mc6VuMcq5iONTjHB0zHWpxjNdMhOMeHTMc6nGMN07Ee5/iI6diAc6xlOoB/feFjpmMTziFMx2ac4xOmYwvOsY7p2IZzfMp0bMc51jMdO3COz5iOnTjHBqZjF87xOdOxG+fYyHTsxTm+YDr24RybmI79OMeXTMcBnGMz03EI5/iK6TiMc2xhOo7gHFuZjqM4xzam4xjO8TXTcRzn2M50nMA5vmE6TuIcO4gOTwrO8S3TkYpz7GQ6PDjHd0xHOs6xi+nw4RzfMx0BnGM305GJc+xhOkI4x16mI4Jz/MB0xHCOfUxHDs7xI9ORwDn2Mx0lcI6fmI6SOMcBpqMUznGQ6SiDcxxiOsrhHD8zHeVxjsNMRwWc4xemoyLOcYTpqIxz/Mp0VME5jjIdwH0afmM6quEcx5iOGjjH70xHLZzjONMB3P/jD6YDuP/HCaYDuP/Hn0wHcP+Pk0wHbv+PWDGmA7f/RyyF6cDt/xE7i+nA7f8RS2U6cPt/xNKYDtz+HzEP04Hb/yPmZTpw+3/E0pkO3P4fsQymA7f/R8zHdOD2/4j5mQ7c/h+xANOB2/8jFmQ6cPt/xDKZDtz+H7EspgO3/0csxHTg9v+IhZkO3P4fsQjTgdv/IxZlOnD7f8RiTAdu/49YNtOB2/8jlsN04Pb/iMWZDtz+H7EE04Hb/yNWnOnA7f8RK8F04Pb/iJ1tcMz629GiR5c+hdW2Fpss0YESfViigyT6iEQHS/RRieZJ9DGJDpHo4xIdKtEnJDpMok9KdLhEn5LoCIk+LdGREn1GoqMkOlqi+RItkGihRMdIdKxEn5XoOIk+J9HxEn1eohMk+oJEJ0r0RYlOkqjOOEWiL0l0qkRflug0iU6X6AyJviLRmRKdJdHZEn1VonMk+ppE50r0dYnOk+gbEp0v0TclukCiCyW6SKKLJbpEom9JdKlE35boMom+I9HlEn1Xoisk+p5EV0r0fYmukugHEl0t0Q8lukaiH0l0rUQ/lqhI9BOJrpPopxJdL9HPJLpBop9LdKNEv5DoJol+KdHNEv1KolskulWi2yT6tUS3S/Qbie6Q6LcS3SnR7yS6S6LfS3S3RPdIdK9Ef5DoPon+KNH9Ev1JogckelCihyT6s0QPa0Nde9HaxtUOqDYPte+mLSvt9mijRHsM+nhen2zrQ2F9nqqPIvUpnj4A02dH+thFn1jozb7eJ+stpt6d6Y2N3hPo5bReiepFnF7/6KWDfuvqF5ae6/U0qWcY/XDqca2HxPS/3++8WY1yczv17nNbp949CwuS/63klHoSHqovq96xZe8dNSZXXtyq6cK8vLbtKtXa03zAkl75TXYcKTyor9NXSfShAtNj+4cKDOPFShbpw1jN9GFMsXYWcJuNmBynvyn5yd8Uz6nVDj9lWO00faVptc9xsNrmJToHN1QpoiMN95OCWGmmA9f6jZVhOnCt31hZpgPX+o2VYzpwrd/YuUwHsPVbnukAtn7PYzqArd8KTAew9Xs+0wFs/VZkOoCt30pMB7D1W5npALZ+L2A6gK3fKkwHsPV7IdMBbP1WZTqArd+LmA5g67ca0wFs/VZnOoCt3xpMB7D1W5PpALZ+azEdwNZvbaYD2Pqtw3QAW791mQ5g67ce0wFs/dZnOoCt3wZMB7D1ezHTAWz9NmQ6gK3fS5gOYOv3UqYjF+e4jOnoi3NcznT0wzmuYDqA3dhGTMdAnKMx0zEI52jCdAzGOa5kOvJwjqZMxxCc4yqmYyjO0YzpGIZzNGc6huMcLZiOETjH1UzHSJzjGqZjFM5xLdORj3Ncx3QU4hwtmY6xOMf1TMc4nKMV0zEe57iB6ZiAc9zIdEzEOVozHZNwjpuYjik4x81Mx1Sc4xamYxrO0YbpmIFztGU6ZuIctzIds3GO25iOOTjH7UzHXJzjDqZjHs7RjumYj3PcyXQswDnuYjoW4Rx3Mx1LcI72TMdSnOMepmMZztGB6ViOc3RkOlbgHJ2YjpU4x71MxyqcozPTsRrnuI/pWINzdGE61uIc9zMdgnN0ZTrW4RzdmI71OEd3pmMDztGD6diIc/RkOjbhHL2Yjs04xwNMxxacozfTsQ3nyGU6tuMcfZiOHThHX6ZjJ87xINOxC+fox3Tsxjn6Mx17cY4BTMc+nOMhpmM/zjGQ6TiAczzMdBzCOQYxHYdxjkeYjiM4x2Cm4yjO8SjTcQznyGM6juMcjzEdJ3COIUzHSZzjcaLDk4JzDGU6UnGOJ5gOD84xjOlIxzmeZDp8OMdwpiOAczzFdGTiHCOYjhDO8TTTEcE5RjIdMZzjGaYjB+cYxXQkcI7RTEcJnCOf6SiJcxQwHaVwjkKmowzOMYbpKIdzjGU6yuMczzIdFXCOcUxHRZzjOaajMs4xnumognM8z3QA92mYwHRUwzleYDpq4BwTmY5aOMeLTAdw/49JTAdw/4/JTAdw/48pTAdw/4+XmA7g/h9TmQ7g/h8vMx3A/T+mMR3A/T+mMx3A/T9mMB3A/T9eYTqA+3/MZDqA+3/MYjqA+3/MZjqA+3+8ynQA9/+Yw3QA9/94jekA7v8xl+kA7v/xOtMB3P9jHtMB3P/jDaYDuP/HfKYDuP/Hm0wHcP+PBUwHcP+PhUwHcP+PRUwHcP+PxUwHcP+PJUwHcP+Pt5gO4P4fS5kO4P4fbzMdwP0/DH+aJm/W344WPbr0Kay+tdhkiZWWWBmJlZVYOYmdK7HyEjtPYhUkdr7EKkqsksQqS+wCiVWR2IUSqyqxiyRWTWLVJVZDYjUlVktitSVWR2J1JVZPYvUl1kBiF0usocQukdilErtMYpdL7AqJNZJYY4k1kdiVEmsqsask1kxizSXWQmJXS+waiV0rsesk1lJi10uslcRukNiNEmstsZskdrPEbpFYG4m1lditErtNYrdL7A6JtZPYnRK7S2J3S6y9xO6RWAeJdZRYJ4ndK7HOErtPYl0kdr/Eukqsm8S6S6yHxHpKrJfEHpBYb4nlSqyPxPpK7EGJ9ZNYf4kNkNhDEhsosYclNkhij0hssMQelViexB6T2BCJPS6xoRJ7QmLDJPakxIZL7CmJjZDY0xIbKbFnJDZKYqMlli+xAokVSmyMxMZK7FltqGsvWtu42gHV5qH23bRlpd0ebZRoj0Efz+uTbX0orM9T9VGkPsXTB2D67Egfu+gTC73Z1/tkvcXUuzO9sdF7Ar2c1itRvYjT6x+9dNBvXf3C0nO9nib1DKMfTj2u9ZCY/vf7nTerUW5up959buvUu2dhQaHhaAoPlfCT+sLqHVv23lFjcuXFrZouzMtr265SrT3NByzpld9kx5HCg/rKUy+MlSowHaClCgzjxd4p0sexuunjmGL9DJ2D+zhaHKe/LfnWt+Up02qHh5pW2/B3oPJeb9ytfYeujXv2v6pvjw5N2nfrljftxkYtmzUtyJvRpkufHp1y9UO0vGyR3xRzVgPYs3/XwcFldgB7qyuYDmBv9T2mA9hbXcl0AHur7zMdwN7qKqYD2Fv9gOkA9lZXMx3A3uqHTAewt7qG6QD2Vj9iOoC91bVMB7C3+jHTAeytCtMB7K1+wnQAe6vrmA5gb/VTpgPYW13PdAB7q58xHcDe6gamA9hb/ZzpAPZWNzIdwN7qF0wHsLe6iekA9la/ZDqAvdXNTAewt/oV0wHsrW5hOoC91a1MB7C3uo3pAPZWv2Y6gL3V7UxHLs7xDdPRF+fYwXT0wzm+ZToG4Bw7mY6BOMd3TMcgnGMX0zEY5/ie6cjDOXYzHUNwjj1Mx1CcYy/TMQzn+IHpGI5z7GM6RuAcPzIdI3GO/UzHKJzjJ6YjH+c4wHQU4hwHmY6xOMchpmMczvEz0zEe5zjMdEzAOX5hOibiHEeYjkk4x69MxxSc4yjTMRXn+I3pmIZzHGM6ZuAcvzMdM3GO40zHbJzjD6ZjDs5xgumYi3P8yXTMwzlOMh3zYUNlF2M6FuAcKUzHIpzjLKZjCc6RynQsxTnSmI5lOIeH6ViOc3iZjhU4RzrTsRLnyGA6VuEcPqZjNc7hZzrW4BwBpmMtzhFkOgTnyGQ61uEcWUzHepwjxHRswDnCTMdGnCPCdGzCOaJMx2acI8Z0bME5spmObThHDtOxHeeIMx07cI4E07ET5yjOdOzCOUowHbtxjrOZjr04R0mmYx/OcQ7TsR/nKMV0HMA5SjMdh3COMkzHYZyjLNNxBOcox3QcxTnOZTqO4RzlmY7jOMd5TMcJnKMC03ES5zif6PCk4BwVmY5UnKMS0+HBOSozHek4xwVMhw/nqMJ0BHCOC5mOTJyjKtMRwjkuYjoiOEc1piOGc1RnOnJwjhpMRwLnqMl0lMA5ajEdJXGO2kxHKZyjDtNRBueoy3SUwznqMR3lcY76TEcFnKMB01ER57iY6aiMczRkOqrgHJcwHbh9GrIvZTqq4RyXMR01cI7LmY5aOMcVTAdu/4/sRkwHbv+P7MZMB27/j+wmTAdu/4/sK5kO3P4f2U2ZDtz+H9lXMR24/T+ymzEduP0/spszHbj9P7JbMB24/T+yr2Y6cPt/ZF/DdOD2/8i+lunA7f+RfR3Tgdv/I7sl04Hb/yP7eqYDt/9HdiumA7f/R/YNTAdu/4/sG5kO3P4f2a2ZDtz+H9k3MR24/T+yb2Y6cPt/ZN/CdOD2/8huw3Tg9v/Ibst04Pb/yL6V6cDt/5F9G9OB2/8j+3amA7f/R/YdTAdu/4/sdkwHbv+P7DuZDtz+H9mGr9R/beZeYN7M3fTCYfrCU4Um3c89++4iFmrZdf5iCQ8pNMx+saXC8BCTI/l3f0qRHQ11WMPhlTe7ce8u3bp16Xxqq/sx3rF501t36dG5WyfbsWLp7BdpwProAesVYUDzcfyE9Th+cjTaIxHDHwQoODVm917dOkn2Pf/8s4P182+4FM17vXG39h26Nu7Z/6q+PTqcOnbypt3YqGWzpgV5M9p06dOjU26uzl3230eXr6DoSz3cutTDkyz1yZMnf/tnqf/zi1NO/ddpi9jxn392spy0U0zL09H2sk5li/zZ/3vlTOfQ0kccnEP/fkNs8/9axPlHj/nPwxYc/OsY7mg68XayfB5KHzG96lfD8fdfF9Lw1aCU0UVcogLLyFnZklXC8l7qC8OXF1iWIKuEadHvdcU528q5wsY528Tp7IpT0sppZOOUNHHuc8U5x8ppbOOcY+J0ccUpZeU0sXFKmTj3u+KUtnKutHFKmzhdXXHKWDlNbZwyJk43V5yyVs5VNk5ZE6e7K045K6eZjVPOxOnhinOuldPcxjnXxOnpilPeymlh45Q3cXq54pxn5Vxt45xn4jzgilPByrnGxqlg4vR2xTnfyrnWxjnfxMl1xalo5Vxn41Q0cfq44lSyclraOJVMnL6uOJWtnOttnMomzoOuOBdYOa1snAtMnH6uOFWsnBtsnComTn9XnAutnBttnAtNnAGuOFWtnNY2TlUT5yFXnIusnJtsnItMnIGuONWsnJttnGomzsOuONWtnFtsnOomziBXnBpWThsbp4aJ84grTk0rp62NU9PEGeyKU8vKudXGqWXiPOqKU9vKuc3GqW3i5Lni1LFybrdx6pg4j7ni1LVy7rBx6po4Q1xx6lk57WyceibO46449a2cO22c+ibOUFecBlbOXTZOAxPnCVeci62cu20c0084soe54jS0ctrbOA1NnCddcS6xcu6xcS4xcYa74lxq5XSwcS41cZ5yxbnMyulo41xm4oxwxbncyulk41xu4jztinOFlXOvjXOFiTPSFaeRldPZxmlk4jzjitPYyrnPxmls4oxyxWli5XSxcZqYOM5+xHKllXO/jXOliZPvitPUyulq4zQ1cQpcca6ycrrZOFeZOIWuOM2snO42TjMTZ4wrTnMrp4eN09zEGeuK08LK6WnjtDBxnnXFudrK6WXjXG3ijHPFucbKecDGucbEec4V51orp7eNc62JM94V5zorJ9fGuc7Eed4Vp6WV08fGaWniTHDFud7K6WvjXG/ivOCK08rKedDGaWXiTHTFucHK6Wfj3GDivOiKc6OV09/GudHEmeSK09rKGWDjtDZxJrvi3GTlPGTj3GTiTHHFudnKGWjj3GzivOSKc4uV87CNc4uJM9UVp42VM8jGaWPivOyK09bKecTGaWviTLNw/s4Ft+jRpU9hja3FrpDseyW7s2TfJ9ldJPt+ye4q2d0ku7tk95DsnpLdS7IfkOzekp0r2X0ku69kPyjZ/SS7v2QPkOyHJHugZD8s2YMk+xFtnWu7WVu02tbUVqC2z7TlpG0abW1oO0AfoetjZ31Uq4839ZGgPkbTR0/6uEYfcehjAb2V1ttPvWXT2xy9NdDLab0E1cs2vdTRywP9StWvIT116+lOTxH6sdJDUd8+JU//2/Pv6FahabmmJ1/6DFMoK6Po6TJTuu1UKGu6LaE8wzD/P5HwGtBIuGVy61CvFPEQrvm/6SFsya2eOkAsJ6RTh9ErBbblNx1sM4t0sNU0HWwphINtZhE/tMbzyqz/1vNKypmdV2bZziuzHbzV5vdnNm6oV4mONOCfcJ/DdAD/1PZrTAfwT23PZTqAf2r7daYD+Ke25zEdwD+1/QbTAfxT2/OZDuCf2n6T6QD+qe0FTAfwT20vZDqAf2p7EdMB/FPbi5kO4J/aXsJ0AP/U9ltMB/BPbS9lOoB/avttpqM1zrGM6QD+qe13mA7gn9peznQA/9T2u0wH8E9tr2A6gH9q+z2mA/intlcyHcA/tf0+0wH8U9urmA7gn9r+gOkA/qnt1UwH8E9tf8h0AP/U9hqmA/intj9iOoB/anst0wH8U9sfMx25OIcwHX1xjk+Yjn44xzqmYwDO8SnTMRDnWM90DMI5PmM6BuMcG5iOPJzjc6ZjCM6xkekYinN8wXQMwzk2MR3DcY4vmY4ROMdmpmMkzvEV0zEK59jCdOTjHFuZjkKcYxvTMRbn+JrpGIdzbGc6xuMc3zAdE3COHUzHRJzjW6ZjEs6xk+mYgnN8x3RMxTl2MR3TcI7vmQ5gBGA30zET59jDdAB/p7+X6ZiDc/zAdMzFOfYxHfNwjh8NjtNzZbX+ypXNkezXJHuuZL8u2fMk+w3Jni/Zb0r2AsleKNmLJHuxZC+R7Lcke6lkvy3ZyyT7HcleLtnvSvYKyX5Psldq61673tow1l6rtim1w6fNMe0raUtGuxnaCNBn6Pr4WZ/c6kNPfV6oj9r0KZU+4NFnI/pYQe/I9WZW7wP1FkrvPvTCXa959XJRr7T0IkW/3/WrUb9V9ISs5zI9DegnSA8+fd+UfKa5sgZFyJW9asuVvVpgGW9/kQ62WthcGfAkZnGcQa7sp+STA3NlZ51ZruynfJPlgIO32vz+HMANdZDoQObKDjEdwFzZz0wHMFd2mOkA5sp+YTqAubIjTAcwV/Yr0wHMlR1lOoC5st+YDmCu7BjTAcyV/c50AHNlx5kOYK7sD6YDmCs7wXQAc2V/Mh3AXNlJpgOXK8spxnTgcmU5KUwHLleWcxbTgcuV5aQyHbhcWU4a04HLleV4mA5crizHy3TgcmU56UwHLleWk8F04HJlOT6mA5cry/EzHbhcWU6A6cDlynKCTAcuV5aTyXTgcmU5WUwHLleWE2I6cLmynDDTgcuV5USYDlyuLCfKdOByZTkxpgOXK8vJZjpwubKcHKYDlyvLiTMduFxZToLpwOXKcoozHbhcWU4JpgOXK8s5m+nA5cpySjIduFxZzjlMBy5XllOK6cDlynJKMx24XFlOGaYDlyvLKct04HJlOeWYDlyuLOdcpgOXK8spz3TgcmU55zEduFxZTgWmA5cryzmf6cDlynIqMh24XFlOJaYDlyvLqcx04HJlORcwHbhcWU4VpgOXK8u5kOnARTJyqjIduFxZzkVMBy5XllON6cDlynKqGxyn58pq/5UrOyTZP0v2Ycn+RbKPSPavkn1Usn+T7GOS/btkH5fsPyT7hGT/KdknJaeY5Jz6YZHkpEpOmuR4JMcrOenauteutzaMtdeqbUrt8GlzTPtK2pLRboY2AvQZuj5+1ie3+tBTnxfqozZ9SqUPePTZiD5W0DtyvZnV+0C9hdK7D71w12tevVzUKy29SNHvd/1q1G8VPSHruUxPA/oJ0oNP3zcln2murH4RcmUHbbmygwWG8XJqFOlgq43NleHCRiZH0XNlOTWTTw7MlaWeUa4sp2a+yVLLwVttfn9q4YaqTXQAc2U5dZgOXK4spy7TgcuV5dRjOnC5spz6TAcuV5bTgOnA5cpyLmY6cLmynIZMBy5XlnMJ04HLleVcynTgcmU5lzEduFxZzuVMBy5XlnMF04HLleU0YjpwubKcxkwHLleW04TpAObKrmQ6gLmypkwHMFd2FdMBzJU1YzqAubLmTAcwV9aC6QDmyq5mOoC5smuYDmCu7FqmA5gru47pAObKWjIdwFzZ9UwHMFfWiukA5spuYDqAubIbmQ5grqw10wHMld3EdABzZTczHcBc2S1MBzBX1obpAObK2jIdwFzZrUwHMFd2G9MBzJXdznQAc2V3MB3AXFk7pgOYK7uT6QDmyu5iOoC5sruZDmCurD3TAcyV3cN0AHNlHZgOYK6sI9MBzJV1YjqAubJ7mQ5grqwz0wHMld3HdABzZV2YDmCu7H6mA5gr68p0AHNl3ZgOYK6sO9MBzJX1YDqAubKeTAcwV9aL6QDmyh5gOoC5st5MBzBXlst0AHNlfQyO03NldU7lynLqSE5dyaknOfUlp4HkXCw5DSXnEsm5VHIuk5zLJUdf00hyGktOE8m5UnKaSs5VktNMcppLTgvJuVpyrtHWvXa9tWGsvVZtU2qHT5tj2lfSlox2M7QRoM/Q9fGzPrnVh576vFAftelTKn3Ao89G9LGC3pHrzazeB+otlN596IW7XvPq5aJeaelFin6/61ejfqvoCVnPZXoa0E+QHnz6vin5THNlEtlkT5bl1DYly/RllrhR3yIdbnWgyTJk3MjiOINk2YPJJwcmy9LOLFn2YL7J0s/BW21+f4AdsP5EBzJZNoDpACbLHmI6gMmygUwHMFn2MNMBTJYNYjqAybJHmA5gsmww0wFMlj3KdACTZXlMBzBZ9hjTAUyWDWE6gMmyx5kOYLJsKNMBTJY9wXQAk2XDmA5gsuxJpgOYLBvOdACTZU8xHcBk2QimA5gse5rpACbLRjIdwGTZM0wHMFk2iukAJstGMx3AZFk+0wFMlhUwHcBkWSHTAUyWjWE6gMmysUwHMFn2LNMBTJaNYzqAybLnmA5gsmw80wFMlj3PdAD7ahOYDmCy7AWmA5gsm8h0AJNlLzIdwGTZJKYDmCybzHQAk2VTmA5gsuwlpgOYLJvKdACTZS8zHcBk2TSmA5gsm850AJNlM5gOYLLsFaYDmCybyXQAk2WzmA5gsmw20wFMlr3KdACTZXOYDmCy7DWmA5gsm8t0AJNlrzMdwGTZPKYDmCx7g+kAJsvmMx3AZNmbTAcwWbaA6QAmyxYyHcBk2SKmA5gsW2xwnJ4sq/tXsmyA5DwkOQMl52HJGSQ5j0jOYMl5VHLyJOcxyRkiOY9LzlDJeUJyhknOk5IzXHKekpwRkvO05IyUnGckZ5S27rXrrQ1j7bVqm1I7fNoc076StmS0m6GNAH2Gro+f9cmtPvTU54X6qE2fUukDHn02oo8V9I5cb2b1PlBvofTuQy/c9ZpXLxf1SksvUvT7Xb8a9VtFT8h6LtPTgH6C9ODT903JZ5osq1eEXFl/W66sf4ElbLSkSAdbXWyuDNgUsTjOIFf2VvLJgbkyz5nlyt7KN1mWOnirze/PUtxQbxMdyFzZMqYDmCt7h+kA5sqWMx3AXNm7TAcwV7aC6QDmyt5jOoC5spVMBzBX9j7TAcyVrWI6gLmyD5gOYK5sNdMBzJV9yHQAc2VrmA5gruwjpgOYK1vLdABzZR8zHcBcmTAdwFzZJ0wHMFe2jukA5so+ZTqAubL1TAcwV/YZ0wHMlW1gOoC5ss+ZDmCubCPTAcyVfcF0AHNlm5gOYK7sS6YDmCvbzHQAc2VfMR3AXNkWpgOYK9vKdABzZduYDmCu7GumA9hC3c50AHNl3zAdwFzZDqYDmCv7lukA5sp2Mh3AXNl3TAcwV7aL6QDmyr5nOoC5st1MBzBXtofpAObK9jIdwFzZD0wHMFe2j+kA5sp+ZDqAubL9TAcwV/YT0wHMlR1gOoC5soNMBzBXdojpAObKfmY6gLmyw0wHMFf2C9MBzJUdYTqAubJfmQ5gruwo0wHMlf3GdABzZceYDmCu7HemA5grO850AHNlfxgcp+fK6v2VK1smOe9IznLJeVdyVkjOe5KzUnLel5xVkvOB5KyWnA8lZ43kfCQ5ayXnY8kRyflEctZJzqeSs15yPpOcDdq61663Noy116ptSu3waXNM+0raktFuhjYC9Bm6Pn7WJ7f60FOfF+qjNn1KpQ949NmIPlbQO3K9mdX7QL2F0rsPvXDXa169XNQrLb1I0e93/WrUbxU9Ieu5TE8D+gnSg0/fNyWf8Y5l2e0lu4M1Wfa2LVn2doElbnSiSIdbPWyyDBg3sjjOIFn2Z/LJgcky75kly/7MN1lOOnirze/PSdhQ8WJFfKtNn8DwUAk/YXrhMAk/aVrweApxwYERuPhZTAcuAhdPZTpwEbh4GtOBi8DFPUwHLgIX9zIduAhcPJ3pwEXg4hlMBy4CF/cxHbgIXNzPdOAicPEA04GLwMWDTAcuAhfPZDpwEbh4FtOBi8DFQ0wHLgIXDzMduAhcPMJ04CJw8SjTgYvAxWNMBy4CF89mOnARuHgO04GLwMXjTAcuAhdPMB24CFy8ONOBi8DFSzAduAhc/GymAxeBi5dkOnARuPg5TAcuAhcvxXTgInDx0kwHLgIXL8N04CJw8bJMBy4CFy/HdOAicPFzmQ5cBC5enunAReDi5zEduAhcvALTgYvAxc9nOnARuHhFpgMXgYtXYjpwEbh4ZaYDF4GLX8B04CJw8SpMBy4CF7+Q6cBF4OJVmQ5cBC5+EdOBi8DFqzEduAhcvDrTgYvAxWswHbgIXLwm04GLwMVrMR24CFy8NtOBi8DF6zAduAhcvC7TgYvAxesxHbgIXLw+04GLwMUbMB24CFz8YqYDF4GLN2Q6cBG4+CVMBy4CF7+U6cBF4OKXMR24CFz8cqYDF4GLX8F04CJwccNPgf8Vgat/KgIXP0viqRJPk7hH4l6Jp0s8Q+I+ifslHpB4UOKZEs+SeEjiYYlHJB6VeEzi2RLPkXhc4gmJF9fWvXa9tWGsvVZtU2qHT5tj2lfSlox2M7QRoM/Q9fGzPrnVh576vFAftelTKn3Ao89G9LGC3pHrzazeB+otlN596IW7XvPq5aJeaelFin6/61ejfqvoCVnPZXoa0E+QHnz6vin5fxWBswaZ4imn1jVprqbME5Z1/S/zW5J18WKFpve1mKXKeGPLWCbLP8d6fWz+DhjKalzE98SWv4s3ST45MH+XfmaHbRPTYRu/0sFbbX5/rsQN1ZToQMbarmI6gLG2ZkwHMNbWnOkAxtpaMB3AWNvVTAcw1nYN0wGMtV3LdABjbdcxHcBYW0umAxhru57pAMbaWjEdwFjbDUwHMNZ2I9MBjLW1ZjqAsbabmA5grO1mpgMYa7uF6QDG2towHcBYW1umAxhru5XpAMbabmM6gLG225kOYKztDqYDGGtrx3QAY213Mh3AWNtdTAcw1nY30wGMtbVnOoCxtnuYDmCsrQPTAYy1dWQ6gLG2TkwHMNZ2L9MBjLV1ZjqAsbb7mA5grK0L0wGMtd3PdABjbV2ZDmCsrRvTAYy1dWc6gLG2HkwHMNbWk+kAxtp6MR3AWNsDTAcw1tab6QDG2nKZDmCsrQ/TAYy19WU6gLG2B5kOYKytH9MBjLX1ZzqAsbYBTAcw1vYQ0wGMtQ1kOoCxtoeZDmCsbRDTAYy1PcJ0AGNtg5kOYKztUaYDGGvLYzqAsbbHmA5grG0I0wGMtT3OdABjbYZHL/+KtTX4K9Z2lcSbSby5xFtI/GqJXyPxayV+ncRbSvx6ibeS+A0Sv1HirSV+k8RvlvgtEm8j8bYSv1Xit0n8donfoa177Xprw1h7rdqm1A6fNse0r6QtGe1maCNAn6Hr42d9cqsPPfV5oT5q06dU+oBHn43oYwW9I9ebWb0P1FsovfvQC3e95tXLRb3S0osU/X7Xr0b9VtETsp7L9DSgnyA9+PR9U/L/o53d7rHmz5qadnbTl1niRkVLljWAJsuQcaOipv2MybJhlsktybIUS7Is5cySZcPyTZYnDUv0euNu7Tt0bdyz/1V9e3Ro0r5bt7xpNzZq2axpQd6MNl369OiUq5+MJ8ueUZnZ95iO2+z2JsxwEGZ42TPYBe5SCQ+1vtD45jxVxOPXVuhl1kIvMxc6wsEJw/z9BMz1Pc10AHN9I5kOYK7vGaYDmOsbxXQAc32jmQ5gri+f6QDm+gqYDmCur5DpAOb6xjAdwFzfWKYDmOt7lukA5vrGMR3AXN9zTAcw1zee6QDm+p5nOoC5vglMBzDX9wLTAcz1TWQ6gLm+F5kOYK5vEtMBzPVNZjqAub4pTAcw1/cS0wHM9U1lOoC5vpeZDmCubxrTAcz1TWc6gLm+GUwHMNf3CtMBzPXNZDqAub5ZTAcw1zeb6QDm+l5lOoC5vjlMBzDX9xrTAcz1zWU6gLm+15kOYK5vHtMBzPW9wXQAc33zmQ5gru9NpgOY61vAdABzfQuZDmCubxHTAcz1LWY6gLm+JUwHMNf3FtMBzPUtZTqAub63mQ5grm8Z0wHM9b3DdABzfcuZDmCu712mA5jrW8F0AHN97zEdwFzfSqYDmOt7n+kA5vpWMR3AXN8HTAcw17ea6QDm+j5kOoC5vjVMBzDX9xHTAcz1rTU4/hW0OpX6MeTaLK+Kf5y8wjNJeYlFDkt5nUmQZ6jElpteOEyy7843oT8xFDq7ce8u3bp16XwqPDUmIz9veusuPTp362Q7Vgw/fv9rxO69unWS+DpTsrDIybPLdWTbgf1p8kU7k9k/HV3EA8Ic+xtuep/LjCrqB3aMablSTAfZelOJT1hmNEBSiryh4xX6BlliiVeYtJ+5eKvj63Vg20d6g2F+SyhyQ9kzOIXHPzO96vOinsKRh+PG/9bDsdgZBcHjT5qOio/1a8t2VHzhqtBPrIV+Yit0U1G/kTxj4N9IRRvwUvSAeogWYUjLGa5xquX8lmp4jWHz1tFW5ZmcKZNJG506BdlmNx2OXxb1cPQVFPXNTnLEnzx58pt/hvzPFxIpp/6r4J/rqc3//PMr26WV5Zths+1lX5X9v1+GJ5tfV+M/vy0FB/961WbTm/eVYWWLvPtz/DOdfrSL0+mpC/x3jRf44Wdsp9MtrgpdYS10lK3Qra4Kfc9a6GhbodtcFbrSWmi+rdCvXRX6vrXQAluh210VuspaaKGt0G9cFfqBtdAxtkJ3uCp0tbXQsbZCv3VV6IfWQp+1FbrTVaFrrIWOsxX6natCP7IW+pyt0F2uCl1rLXS8rdDvXRX6sbXQ522F7nZVqFgLnWArdI+rQj+xFvqCrdC9rgpdZy10oq3QH1wV+qm10Bdthe5zVeh6a6GTbIX+6KrQz6yFTrYVut9VoRushU6xFfqTq0I/txb6kq3QA64K3WgtdKqt0IOuCv3CWujLtkIPuSp0k7XQabZCf3ZV6JfWQqfbCj3sqtDN1kJn2Ar9xVWhX1kLfcVW6BFXhW6xFjrTVqiz5vJWa6GzbIUedVXoNmuhs22F/uaq0K+thb5qK/SYq0K3WwudYyv0d1eFfmMt9DVbocddFbrDWuhcW6F/uCr0W2uhr9sKPeGq0J3WQufZCv3TVaHfWQt9w1boSVeF7rIWOt9UaKKYq0K/txb6pq3QFFeF7rYWusBW6FmuCt1jLXShrdBUV4XutRa6yFZomqtCf7AWuthWqMdVofushS6xFep1VeiP1kLfshWa7qrQ/dZCl9oKzXBV6E/WQt+2FepzVegBa6HLbIX6XRV60FroO7ZCA64KPWQtdLmt0KCrQn+2FvqurdBMV4Uetha6wlZolqtCf7EW+p6t0JCrQo9YC11pKzTsqtBfrYW+bys04qrQo9ZCV9kKjboq9DdroR/YCo25KvSYtdDVtkKzXRX6u7XQD22F5rgq9Li10DW2QuOuCv3DWuhHtkITrgo9YS10ra3Q4q4K/dNa6Me2Qku4KvSktVDbz/ETZzsqNLuYtVDbz/ETJV0VmmItdJ2t0HNcFXqWtdBPbYWWclVoqrXQ9bZCS7sqNM1aqC3xlCjjqlCPtdANtkLLuirUay30c1uh5VwVmm4tdKOt0HNdFZphLfQLW6HlXRXqsxa6yVboea4K9VsL/dJWaAVXhQashW62FXq+q0KD1kK/shVa0VWhmdZCt9gKreSq0CxroVtthVZ2VWjIWug2W6EXuCo0bC30a1uhVVwVGrEWut1W6IWuCo1aC/3GVmhVV4XGrIXusBV6katCs62FfmsrtJqrQnOshe60FVrdVaFxa6Hf2Qqt4arQhLXQXbZCa7oqtLi10O9thdZyVWgJa6G7bYXWdlXo2dZC99gKreOq0JLWQvfaCq3rqtBzrIX+YCu0nqtCS1kL3WcrtL6rQktbC/3RVmgDV4WWsRa631boxa4KLWst9CdboQ1dFVrOWugBW6GXuCr0XGuhB22FXuqq0PLWQg/ZCr3MVaHnWQv92Vbo5a4KrWAt9LCt0CtcFXq+tdBfbIU2clVoRWuhR2yFNnZVaCVrob/aCm3iqtDK1kKP2gq90lWhF1gL/c1WaFNXhVaxFnrMVuhVrgq90Fro77ZCm7kqtKq10OO2Qpu7KvQia6F/2Apt4arQatZCT9gKvdpVodWthf5pK/QaV4XWsBZ60lbota4KrWksNFLMVuh1rgqtZS00xVZoS1eF1rYWepat0OtdFVrHWmiqrdBWrgqtay00zVboDa4KrWct1GMr9EZXhda3Fuq1FdraVaENrIWm2wq9yVWhF1sLzbAVerOrQhtaC/XZCr3FVaGXWAv12wpt46rQS62FBmyFtnVV6GXWQoO2Qm91Vejl1kIzbYXe5qrQK6yFZtkKvd1VoY2shYZshd7hqtDG1kLDtkLbuSq0ibXQiK3QO10VeqW10Kit0LtcFdrUWmjMVujdrgq9ylpotq3Q9q4KbWYtNMdW6D2uCm1uLTRuK7SDq0JbWAtN2Art6KrQq62FFrcV2slVoddYCy1hK/ReV4Veay30bFuhnV0Vep210JK2Qu9zVWhLa6Hn2Art4qrQ662FlrIVer+rQltZCy1tK7Srq0JvsBZaxlZoN1eF3mgttKyt0O6uCm1tLbScrdAergq9yVroubZCe7oq9GZroeVthfZyVegt1kLPsxX6gKtC21gLrWArtLerQttaCz3fVmiuq0JvtRZa0VZoH1eF3mYttJKt0L6uCr3dWmhlW6EPuir0DmuhF9gK7eeq0HbWQqvYCu3vqtA7rYVeaCt0gKtC77IWWtVW6EOWQv/eaLdFjy59Ci/eWmyyxLdIfKvEt0n8a4lvl/g3Et8h8W8lvlPi30l8l8S/l/huie+R+F6J/yDxfRL/UeL7Jf6TxA9I/KDED0n8Z4kflvgvEj8i8V8lflTiv0n8mMR/l/hxif8h8RMS/1PiJyVx6g8RSuIsSaRKIk0SHkl4JZEuiQxJ+CThl0RAEkFJZEoiSxIhSYQlEZFEVBIxSWRLIkcScUkkJFFcEiUkcbYkSkriHEmUkkRpSZSRRFlJlJPEuZIoL4nzJFFBEudLoqIkKkmisiQukEQVSVwoiaqSuEgS1SRRXRI1JFFTErUkUVsSdSRRVxL1JFFfEg0kcbEkGkriEklcKonLJHG5JK6QRCNJNJZEE0lcKYmmkrhKEs0k0VwSLSRxtSSu0Ta/NtC1Na1NX22naqNSW4DaXNO2lTaEtNWiTQxtD+iDd32krQ+L9TGsPuDUR4f6UE4fd+mDJH1Eow8/9LGC3rDrrbDeZOrtm94Y6S2HXszrZbJegOqlnV406eWIftHrV6h+OelpX0+oeqrSk4B+vPTA1UNi+t/v978OUMPmm56/dvwypmcHGo67fzZ4vhi6wbNlcutQDzv4oKdI/NRfQU+2iI2sO50mBhXxQ97wfz7k/5/8kBcYjrpTH/LEw5ZvoVMvHFRg+xSZDuNHinTOaGg6Z6QQzhmPFPGcYT/3Ajf0TAx2sNrmJRqMG+pRoiOtKs6Rx3TUwTkeYzrq4RxDmI4GOMfjTEdDnGMo03EpzvEE03E5zjGM6WiEczzJdDTBOYYzHU1xjqeYjmY4xwimowXO8TTTcQ3OMZLpuA7neIbpuB7nGMV03IBzjGY6WuMc+UzHzThHAdPRBucoZDpuxTnGMB234xxjmY52OMezTMddOMc4pqM9zvEc09EB5xjPdHTCOZ5nOjrjHBOYji44xwtMR1ecYyLT0R3neJHp6IlzTGI6HsA5JjMduTjHFKajL87xEtPRD+eYynQMwDleZjqAXeVpTMcgnGM60wHsO89gOvJwjleYjiE4x0ymYyjOMYvpGIZzzGY6huMcrzIdI3COOUzHSJzjNaZjFM4xl+nIxzleZzoKcY55TMdYnOMNpmMczjGf6RiPc7zJdEzAORYwHRNxjoVMxyScYxHTMQXnWMx0TMU5ljAd03COt5iOGTjHUqZjJs7xNtMxG+dYxnTMwTneYTrm4hzLmY55OMe7TMd8nGMF07EA53iP6ViEc6xkOpbgHO8zHUtxjlVMxzKc4wOmYznOsZrpWIFzfMh0rMQ51jAdq3COj5iO1TjHWqZjDc7xMdOxFucQpkNwjk+YjnU4xzqmYz3O8SnTsQHnWM90bMQ5PmM6NuEcG5iOzTjH50zHFpxjI9OxDef4gunYjnNsYjp24BxfMh07cY7NTMcunOMrpmM3zrGF6diLc2xlOvbhHNuYjv04x9dMxwGcYzvTcQjn+IbpOIxz7GA6juAc3zIdR3GOnUzHMZzjO6bjOM6xi+k4gXN8z3ScxDl2Ex2eFJxjD9ORinPsZTo8OMcPTEc6zrGP6fDhHD8yHQGcYz/TkYlz/MR0hHCOA0xHBOc4yHTEcI5DTEcOzvEz05HAOQ4zHSVwjl+YjpI4xxGmoxTO8SvTUQbnOMp0lMM5fmM6yuMcx5iOCjjH70xHRZzjONNRGef4g+mognOcYDqA+zT8yXRUwzlOMh01YEMVL8Z01MI5UpgO3P4fxc9iOnD7fxRPZTpw+38UT2M6cPt/FPcwHbj9P4p7mQ7c/h/F05kO3P4fxTOYDtz+H8V9TAdu/4/ifqYDt/9H8QDTgdv/o3iQ6cDt/1E8k+nA7f9RPIvpwO3/UTzEdOD2/ygeZjpw+38UjzAduP0/ikeZDtz+H8VjTAdu/4/i2UwHbv+P4jlMB27/j+JxpgO3/0fxBNOB2/+jeHGmA7f/R/ESTAdu/4/iZzMduP0/ipdkOnD7fxQ/h+nA7f9RvBTTgdv/o3hppgO3/0fxMkwHbv+P4mUNjll/O1r06NKn8JKtxSZLIk8Sj0liiCQel8RQSTwhiWGSeFISwyXxlCRGSOJpSYyUxDOSGCWJ0ZLIl0SBJAolMUYSYyXxrCTGSeI5SYyXxPOSmCCJFyQxURIvSmKSJHT8KZJ4SRJTJfGyJKZJYrokZkjiFUnMlMQsScyWxKuSmCOJ1yQxVxKvS2KeJN6QxHxJvCmJBZJYKIlFklgsiSWSeEsSSyXxtiSWSeIdSSyXxLuSWCGJ9ySxUhLvS2KVJD6QxGpJfCiJNZL4SBJrJfGxJEQSn0hinSQ+lcR6SXwmiQ2S+FwSGyXxhSQ2SeJLSWyWxFeS2CKJrZLYJomvJbFdEt9IYockvpXETkl8J4ldkvheErslsUcSeyXxgyT2SeJHSeyXxE+SOCCJg5I4JImfJXFYEr9I4ogkfpXEUUn8Jolj2lDXXrS2cbUDqs1D7btpy0q7Pdoo0R6DPp7XJ9v6UFifp+qjSH2Kpw/A9NmRPnbRJxZ6s6/3yXqLqXdnemOj9wR6Oa1XonoRp9c/eumg37r6haXnej1N6hlGP5x6XOshMf3v9ztvVqPc3E69+9zWqXfPwoLkfys55XKJf6Yvq96xZe8dNSZXXtyq6cK8vLbtKtXa03zAkl75TXYcKTyor9NXSeLRAlOb8dECw3jFyxXpw3iJ6cOYYu2E4jaFMDlOf1Pyk78pnlOrHd9kWO2z9JWm1T7XwWqbl+hc3FDlz2C1k61OauNCw9yphtc0Nr0X5xHfizTczyKKV2A6gO3r85kOYPu6ItMBbF9XYjqA7evKTAewfX0B0wFsX1dhOoDt6wuZDmD7uirTAWxfX8R0ANvX1ZgOYPu6OtMBbF/XYDqA7euaTAewfV2L6QC2r2szHcD2dR2mA9i+rst0ANvX9ZgOYPu6PtMBbF83YDqA7euLmQ5g+7oh0wFsX1/CdADb15cyHcD29WVMB7B9fTnTAWxfX8F0ANvXjZgOYPu6MdMBbF83YTqA7esrmY5cnKMp09EX57iK6eiHczRjOgbgHM2ZjoE4RwumYxDOcTXTAfylwjVMRx7OcS3TMQTnuI7pGIpztGQ6huEc1zMdw3GOVkzHCJzjBqZjJM5xI9MxCudozXTk4xw3MR2FOMfNTMdYnOMWpmMcztGG6RiPc7RlOibgHLcyHRNxjtuYjkk4x+1MxxSc4w6mYyrO0Y7pmIZz3Ml0zMA57mI6ZuIcdzMds3GO9kzHHJzjHqZjLs7RgemYh3N0ZDrm4xydmI4FOMe9TMcinKMz07EE57iP6ViKc3RhOpbhHPczHctxjq5MxwqcoxvTsRLn6M50rMI5ejAdq3GOnkzHGpyjF9OxFud4gOkQnKM307EO58hlOtbjHH2Yjg04R1+mYyPO8SDTsQnn6Md0bMY5+jMdW3COAUzHNpzjIaZjO84xkOnYgXM8zHTsxDkGMR27cI5HmI7dOMdgpmMvzvEo07EP58hjOvbjHI8xHQdwjiFMxyGc43Gm4zDOMZTpOIJzPMF0HMU5hjEdx3COJ5mO4zjHcKbjBM7xFNNxEucYQXR4UnCOp5mOVJxjJNPhwTmeYTrScY5RTIcP5xjNdARwjnymIxPnKGA6QjhHIdMRwTnGMB0xnGMs05GDczzLdCRwjnFMx/+vvTMP8Kl8379zjn2X7Zz3+0zIlnZpL8q+L9lT0mBoMmaYxZJKkyRJzAzZErKFhGRLkmzJ+8pOtoSEJFQqSX6PlLHM5B7uu/v7/f765/M5jTPXc73O/jz3XM/j8XEM1+QI8nGM0OQI4+MYqclRjI9jlCZHCT6ONzQ5SvJxjNbkKM3H8aYmR1k+jjGaHOX4OMZqctzIxzFOk4NxnYa3NDlu5eMYr8lRno9jgiZHBT6OiZocjOt/TNLkYFz/Y7ImB+P6H29rcjCu/zFFk4Nx/Y+pmhyM639M0+RgXP/jHU0OxvU/pmtyMK7/8a4mB+P6HzM0ORjX/5ipycG4/scsTQ7G9T/e0+RgXP9jtiYH4/of72tyMK7/MUeTg3H9j7maHIzrf8zT5GBc/2O+Jgfj+h8LNDkY1//4QJODcf2PhZocjOt/fKjJwbj+xyJNDsb1Pz7S5GBc/2OxJgfj+h8fa3Iwrv+xRJODcf2PTzQ5GNf/WKrJwbj+xzICx9SzHLWjI+NTKu7INBZuabhl4JaFez3ccnBvgHsj3Jvg3gz3Fri3wr0Nbnm4t8OtAPcOuHfCvQvu3XDvgXsv3Pvg3g/3AbgV4VaC+yDch+BWhlsFblW41eBWh1sDbk24teDWhlsHbl249eDWh9sAbkO4jeA+DLcx3CZwm8JtBrc53BZwW8J9BG4ruI/CfQxua7iPw20D9wm44XDbwm0Htz3cCLgd4HaE+yTcSLhPwe0ENwpuZ7jRcGPgdoHbFW4s3Di48XAT4HaD2x1uD7g94T4NtxfcZ+A+C/c5uL3hPg83Ee4LcPvAfRFuX7gvwe0H92W4/eG+AncA3FfhDoT7GtxBcAfDTYKbDDcF7hC4Q+G+DncY3OFwR8AdCXcU3DfgjjYFdVOLNmVcUwE1xUNTdzMlK1PtMYUSU2Mww/NmZNsMCpvxVDMUaUbxzACYGTsywy5mxMJ09k0/2XQxTe/MdGxMn8B8TpsvUfMRZ75/zKeDeeuaF5Z51pvHpHnCmJvTXNfmkph09nwnTq0cFxcRG98qIjYmJTllWfHb2jeI3V1+bLn5jarPTUxs2fr6Cgdq9VzQJanq7uMpR82FgiLr4ZZMIVx2Z3YslUy6QEsmExp2l2fodqxIuh0t6j10Hd/tSOE4/7QkXf5oZzlztItsIRxtx+xJOtorBI42+RCt4JNaqciRmfGPCj7V5GAs/q7S5GAs/n6mycFY/F2tycFY/A1pcjAWf6HJwVj8/VyTg7H4u0aTg7H4u1aTg7H4u06Tg7H4u16Tg7H4u0GTg7H4u1GTg7H4u0mTg7H4u1mTg7H4u0WTg7H4+4UmB2Pxd6smB2Pxd5smB2Pxd7smB2Pxd4cmB2Pxd6cmB2Px90tNDsbi7y5NDsbi71eaHIzF392aHIzF3z2aHIzF372aHIzF3681ORiLv/s0ORiLv99ocjAWf/drcsTxcRzQ5Ejg4zioydGdj+NbTY6efByHNDl68XF8p8nxLB/HYU2O3nwc32tyJPJxHNHk6MPHcVSToy8fxzFNjn58HD9ocvTn4/hRk2MAH8dPmhwD+TiOa3IM4uP4WZMjiY/jF02OFD6OXzU5hvJxnNDkGMbH8Zsmxwg+jpOaHKP4OH7X5BjNx3FKk2MMH8cfmhzj+DhOa3KMZ5PyMmlyTOTjsDQ5JvNx2JocU/g4HE2OaXwcmTU5pvNxZNHkmMHHkVWTYxYfRzZNjtl8HNk1OebwceTQ5JjHx5FTk2MBH0cuTY6FfBy5NTkW8XHk0eRYzMeRV5NjCR9HPk2OpXwc+TU5lvNxFNDkWMnHcY0mxyo+joKaHKv5OAppcoCPo7Amxxo+jiKaHOv4OIpqcmzg43A1OTbxcXiaHFv4OAKaHFv5OIKaHNv5OHxNjp18HGGaHLv4OK7V5NjNx1FMk2MvH0dxTY59fBwlNDn283Fcp8lxkI+jpCbHIT6OUpoch/k4SmtyHOHjKKPJcYyPo6wmx498HNdrchzn4yinyfELH8cNmhwn+Dhu1OQ4ycdxkybHKT6OmzU5TvNx3KLIkcXi47hVk8Ph47hNkyMLH0d5TY5sfBy3a3Lk4OOooMmRi4/jDk2OPHwcd2py5OPjuEuTowAfx92aHAX5OO7R5CjMx3GvJkdRPo77NDk8Po77NTmCfBwPaHKE8XFU1OQoxsdRSZOjBB/Hg5ocJfk4HtLkKM3HUVmToywfRxVNjnJ8HFU1OW7k46imycG3ToNXXZPjVj6OGpoc5fk4ampyVODjqKXJwbf+h1dbk4Nv/Q+vjiYH3/ofXl1NDr71P7x6mhx863949TU5+Nb/8BpocvCt/+E11OTgW//Da6TJwbf+h/ewJgff+h9eY00OvvU/vCaaHHzrf3hNNTn41v/wmmly8K3/4TXX5OBb/8NrocnBt/6H11KTg2/9D+8RTQ6+9T+8VpocfOt/eI9qcvCt/+E9psnBt/6H11qTg2/9D+9xTQ6+9T+8NpocfOt/eE9ocvCt/+GFa3Lwrf/htdXk4Fv/w2unycG3/ofXXpODb/0PL0KTg2/9D6+DJgff+h8e4ZGROPUsR+3oyPiUSjsyjYX7KdxVcD+DuxpuCC7gfg53Ddy1cNfBXQ93A9yNcDfB3Qx3C9wv4G6Fuw3udrg74O6E+yXcXXC/grsb7h64e+F+DXcf3G/g7od7AO5BuN/CPQT3O7iH4X4P9wjco3CPwf0B7o9wf4J7HO7PcH+B+yvcE3B/g3sS7u9wT8H9A+5peJngnZnLD54DLzO8LPCywssGLzu8HPBywssFLze8PPDywssHLz+8AvCugVcQXiF4heEVgVcUngvPgxeAF4TnwwuDdy28YvCKwysB7zp4JeGVglcaXhl4ZeFdD68cvBvg3QjvJng3w7sF3q3wboNXHt7t8CrAuwPenfDugnc3vHvg3QvvPnj3w3sAXkV4leA9CO8hU1A3tWhTxjUVUFM8NHU3U7Iy1R5TKDE1BjM8b0a2zaCwGU81Q5FmFM8MgJmxIzPsYkYsTGff9JNNF9P0zkzHxvQJzOe0+RI1H3Hm+8d8Opi3rnlhmWe9eUyaJ4y5Oc11bS6JSWfPd+LUynFxEbHxrSJiY1KSLz9XslURRdab3W5r3yB2d/mx5eY3qj43MbFl6+srHKjVc0GXpKq7j6ccNfuZveCuTKZcnmY3gp73ZIZuxkqkm9Ei3kHuCr6bkcJx/klJuvxJyXLmaBfZQjjamc2epKMdKXC0yYeI8dPgKUWOzIx/UtBJk4Ox9BulycFY+u2sycFY+o3W5GAs/cZocjCWfrtocjCWfrtqcjCWfmM1ORhLv3GaHIyl33hNDsbSb4ImB2Ppt5smB2Ppt7smB2Ppt4cmB2Ppt6cmB2Pp92lNDsbSby9NDsbS7zOaHIyl32c1ORhLv89pcjCWfntrcjCWfp/X5GAs/SZqcjCWfl/Q5GAs/fbR5GAs/b6oycFY+u2rycE4vvuSJgdj6befJgdj6fdlTQ7G0m9/TQ7G0u8rmhxxfBwDNDkS+Dhe1eTozscxUJOjJx/Ha5ocvfg4BmlyPMvHMViTozcfR5ImRyIfR7ImRx8+jhRNjr58HEM0OfrxcQzV5OjPx/G6JscAPo5hmhwD+TiGa3IM4uMYocmRxMcxUpMjhY9jlCbHUD6ONzQ5hvFxjNbkGMHH8aYmxyg+jjGaHKP5OMZqcozh4xinyTGOj+MtTY7xfBzjNTkm8nFM0OSYzMcxUZNjCh/HJE2OaXwckzU5pvNxvK3JMYOPY4omxyw+jqmaHLP5OKZpcszh43hHk2MeH8d0TY4FfBzvanIs5OOYocmxiI9jpibHYj6OWZocS/g43tPkWMrHMVuTYzkfx/uaHCv5OOZocqzi45irybGaj2OeJgf4OOZrcqzh41igybGOj+MDTY4NfBwLNTk28XF8qMmxhY9jkSbHVj6OjzQ5tvNxLNbk2MnH8bEmxy4+jiWaHLv5OD7R5NjLx7FUk2MfH8cyTY79fBzLNTkO8nGs0OQ4xMexUpPjMB/Hp5ocR/g4VmlyHOPj+EyT40c+jtWaHMf5OEKaHL/wcUCT4wQfx+eaHCf5ONZocpzi41iryXGaj2OdIkcWi49jvSaHw8exQZMjCx/HRk2ObHwcmzQ5cvBxbNbkyMXHsUWTIw8fxxeaHPn4OLZqchTg49imyVGQj2O7JkdhPo4dmhxF+Th2anJ4fBxfanIE+Th2aXKE8XF8pclRjI9jtyZHCT6OPZocJfk49mpylObj+FqToywfxz5NjnJ8HN9octzIx7Ffk4NxnYYDmhy38nEc1OQoz8fxrSZHBT6OQ5ocjOt/fKfJwbj+x2FNDsb1P77X5GBc/+OIJgfj+h9HNTkY1/84psnBuP7HD5ocjOt//KjJwbj+x0+aHIzrfxzX5GBc/+NnTQ7G9T9+0eRgXP/jV00OxvU/TmhyMK7/8ZsmB+P6Hyc1ORjX//hdk4Nx/Y9TmhyM63/8ocnBuP7HaU0OvvU/Apk0OfjW/whYmhx8638EbE0OvvU/Ao4mB9/6H4HMmhx8638Esmhy8K3/EciqycG3/kcgmyYH3/ofgeyaHHzrfwRyaHLwrf8RyEngmHqWo3Z0ZHzKgzsyjYXXCV4UvM7wouHFwOsCryu8WHhx8OLhJcDrBq87vB7wesJ7Gl4veM/Aexbec/B6w3seXiK8F+D1gfcivL7wXoLXD97L8PrDewXeAHivwhsI7zV4g+ANhpcELxleCrwh8IbCex3eMHjD4Y2ANxLeKHhvwBsN7014Y+AZh+PgvQVvPLwJ8CbCmwRvMry34U2BNxXeNHjvwJsO7114M+DNhDcL3nvwZsN7H94ceHPhzYM3H94CeB/AWwjvQ3iL4H0EbzG8j+EtgfcJvKXwlsFbDm8FvJXwPoW3Ct5n8FbDC8EDvM/hrYG3Ft46eOvhbYC3Ed4meJvhbYH3Bbyt8LbB2w5vB7yd8L6EtwveV/B2w9sDb68pqJtatCnjmgqoKR6aupspWZlqjymUmBqDGZ43I9tmUNiMp5qhSDOKZwbAzNiRGXYxIxams2/6yaaLaXpnpmNj+gTmc9p8iZqPOPP9Yz4dzFvXvLDMs948Js0Txtyc5ro2l8Sks+c7cWrluLiI2PhWEbExKckphKupyHoU2WR2vK19g9jd5ceWm9+o+tzExJatr69woFbPBV2Squ4+nnLU7HlmR++pZNKH81PJBL1Argzdjg+SbkeL+m3P+LqicJx/WpKop2UL6WgXWU862rkJLmdWiQpv16lKTI8aCdHtqoZHRSVObFy5Qc3qyYmTW0TGR0fExRmd4hk+KeSsBl/NPpBH4OIic/DVVgN5NTn4aquBfJocfLXVQH5NDr7aaqCAJgdfbTVwjSYHX201UFCTg6+2GiikycFXWw0U1uTgq60Gimhy8NVWA0U1OfhqqwFXk4OvthrwNDn4aquBgCYHX201ENTk4KutBnxNDr7aaiBMk4Ovthq4VpODr7YaKKbJwVdbDRTX5OCrrQZKaHIw1lav0+RgrK2W1ORgrK2W0uRgrK2W1uRgrK2W0eRgrK2W1eRgHKy+XpODsbZaTpODsbZ6gyYHY231Rk0OxtrqTZoccXwcN2tyJPBx3KLJ0Z2P41ZNjp58HLdpcvTi4yivyfEsH8ftmhy9+TgqaHIk8nHcocnRh4/jTk2Ovnwcd2ly9OPjuFuToz8fxz2aHAP4OO7V5BjIx3GfJscgPo77NTmS+Dge0ORI4eOoqMkxlI+jkibHMD6OBzU5RvBxPKTJMYqPo7Imx2g+jiqaHGP4OKpqcozj46imyTGej6O6JsdEPo4amhyT+ThqanJM4eOopckxjY+jtibHdD6OOpocM/g46mpyzOLjqKfJMZuPo74mxxw+jgaaHPP4OBpqcizg42ikybGQj+NhTY5FfByNNTkW83E00eRYwsfRVJNjKR9HM02O5XwczTU5VvJxtNDkWMXH0VKTYzUfxyOaHODjaKXJsYaP41FNjnV8HI9pcmzg42itybGJj+NxTY4tfBxtNDm28nE8ocmxnY8jXJNjJx9HW02OXXwc7TQ5dvNxtNfk2MvHEaHJsY+Po4Mmx34+jo6aHAf5OJ7U5DjExxGpyXGYj+MpTY4jfBydNDmO8XFEaXL8yMfRWZPjOB9HtCbHL3wcMZocJ/g4umhynOTj6KrJcYqPI1aT4zQfR5wiRxaLjyNek8Ph40jQ5MjCx9FNkyMbH0d3TY4cfBw9NDly8XH01OTIw8fxtCZHPj6OXpocBfg4ntHkKMjH8awmR2E+juc0OYrycfTW5PD4OJ7X5AjycSRqcoTxcbygyVGMj6OPJkcJPo4XNTlK8nH01eQozcfxkiZHWT6Ofpoc5fg4XtbkuJGPo78mB+M6Da9octzKxzFAk6M8H8ermhwV+DgGanIwrv/xmiYH4/ofgzQ5GNf/GKzJwbj+R5ImB+P6H8maHIzrf6RocjCu/zFEk4Nx/Y+hmhyM63+8rsnBuP7HME0OxvU/hmtyMK7/MUKTg3H9j5GaHIzrf4zS5GBc/+MNTQ7G9T9Ga3Iwrv/xpiYH4/ofYzQ5GNf/GKvJwbj+xzhNDsb1P97S5GBc/2O8Jgfj+h8TNDkY1/+YqMnBuP7HJE0OxvU/JmtyMK7/8bYmB+P6H1M0ORjX/5iqycG4/sc0TQ7G9T/eIXCcv5h7Mnkxd9KOG82OZ4xefj336Rk0Sll1/iEUWZtCaP0hisMia0kc717eVoY5KhtZykD9tCqxkVFRkR3PLHU/JOvQxElNIqM7RkXQrhXKjLoZEqzELVgxA4Lk63gD9TreNJibBy5hdbfkM5qdu0RFIDAjdXMm9f5/l2B6ZpWo8HadqsT0qJEQ3e7MtZM4sXHlBjWrJydObhEZHx0RF2faLn7h1ZUjOeOHejP1UG++zKE+ffr0r6mH+p93ts78z3kHcVbq5nuUh7ZFOjyzaLu9VzzD9/7ZI0d6hhbfI/AMPXtCaO3vzWD7g4f8s2zy0T+v4VmkB+97lPuh+B7SXnsJ19/FB5LwajAogzN4iJIpyoXCUagD5VyaHYu8mkw5BIU6kA76bCmcjlScgTScjiSc96VwnqTivEbDeZKEM0cKJ5KKM4iGE0nCmSuF8xQVZzAN5ykSzjwpnE5UnCQaTicSznwpnCgqTjINJ4qEs0AKpzMVJ4WG05mE84EUTjQVZwgNJ5qEs1AKJ4aKM5SGE0PC+VAKpwsV53UaThcSziIpnK5UnGE0nK4knI+kcGKpOMNpOLEknMVSOHFUnBE0nDgSzsdSOPFUnJE0nHgSzhIpnAQqzigaTgIJ5xMpnG5UnDdoON1IOEulcLpTcUbTcLqTcJZJ4fSg4rxJw+lBwlkuhdOTijOGhtOThLNCCudpKs5YGs7TJJyVUji9qDjjaDi9SDifSuE8Q8V5i4bzDAlnlRTOs1Sc8TScZ0k4n0nhPEfFmUDDeY6Es1oKpzcVZyINpzcJJySF8zwVZxIN53kSDqRwEqk4k2k4iSScz6VwXqDivE3DeYGEs0YKpw8VZwoNpw8JZ60UzotUnKk0nBdJOOukcPpScabRcPqScNZL4bxExXmHhvMSCWeDFE4/Ks50Gk4/Es5GKZyXqTjv0nBeJuFsksLpT8WZQcPpT8LZLIXzChVnJg3nFRLOFimcAVScWTScASScL6RwXqXivEfDeZWEs1UKZyAVZzYNZyAJZ5sUzmtUnPdpOK+RcLZL4Qyi4syh4Qwi4eyQwhlMxZlLwxlMwtkphZNExZlHw6H96emXUjjJVJz5NJxkEs4uKZwUKs4CGk4KCecrKZwhVJwPaDhDSDi7pXCGUnEW0nCGknD2SOG8TsX5kIbzOglnrxTOMCrOIhrOMBLO11I4w6k4H9FwhpNw9knhjKDiLKbhjCDhfCOFM5KK8zENZyQJZ78UzigqzhIazigSzgEpnDeoOJ/QcN4g4RyUwhlNxVlKwxlNwvlWCudNKs4yGs6bJJxDUjhjqDjLaThjSDjfSeGMpeKsoOGMJeEclsIZR8VZScMZR8L5XgrnLSrOpzSct0g4R6RwxlNxVtFwxpNwjkrhTKDifEbDmUDCOSaFM5GKs5qGM5GE8wMF52wuuHZ0ZHzKQzsyPYTAbATeR2AOAnMRmIfAfAQWIPABAgsR+BCBRQh8hMBiBD5GYAkCnyCwFIFlCCxHYAUCKxH4FIFVCHyGwGpTOjflZlOiNWVNUwo05TNTcjJlGlPaMOUAM4Ruhp3NUK0Z3jRDgmYYzQw9meEaM8RhhgVMV9p0P02XzXRzTNfAfE6bT1Dz2WY+dczngXmlmteQeXSbx515RJjbylyK5vQZ5ElneS6MbtE67z9e/tBnJ4Wysmc8XUYaTDoTyvqRNkz0E6H91Ej4Q6yRcErjVKnjGbyEK/8fvYQpo3NnLhDKA+nMZXQ8mXb4SRfbzxm62CqTLjZL4WL7OYM3LfG58su/+lyxruy58gvtufKrwKkmn59f+aROKHJkZpzC/TdNDsaptk9qcjBOtf27JgfjVNunNDkYp9r+Q5ODcart05ocfFNtBzNpcvBNtR20NDn4ptoO2pocfFNtBx1NDr6ptoOZNTn4ptoOZtHk4JtqO5hVk4Nvqu1gNk0Ovqm2g9k1Ofim2g7m0ORowseRU5ODb6rtYC5NDr6ptoO5NTn4ptoO5tHk4JtqO5hXk4Nvqu1gPk0Ovqm2g/k1Ofim2g4W0OTgm2o7eI0mB99U28GCmhx8U20HC2ly8E21HSysycE31XawiCYH31TbwaKaHHxTbQddTQ6+qbaDniZHHB9HQJMjgY8jqMnRnY/D1+ToyccRpsnRi4/jWk2OZ/k4imly9ObjKK7JkcjHUUKTow8fx3WaHH35OEpqcvTj4yilydGfj6O0JscAPo4ymhwD+TjKanIM4uO4XpMjiY+jnCZHCh/HDZocQ/k4btTkGMbHcZMmxwg+jps1OUbxcdyiyTGaj+NWTY4xfBy3aXKM4+Mor8kxno/jdk2OiXwcFTQ5JvNx3KHJMYWP405Njml8HHdpckzn47hbk2MGH8c9mhyz+DgIfyp/Qa6syp+5st8QOInA7wicQuAPBE4jmAnBM39Fi6CDYGYEsyCYFcFsCGZHMAeCORHMhWBuBPMgmBfBfAjmN6V7U/U2BWNTazVlSlPhM8UxU1cyJRlTzTCFADOGboafzcitGfQ044VmqM2MUpkBHjM2YoYVTI/cdGZNP9B0oUzvw3y4m29e87lovrTMR4p5v5tXo3mrmAeyeZaZx4C5g8zFZ86bQb7SXNmDGciVnaDlyk4kE/SC92XoYqvCmyvjCxuRODKeKwvef/nGGXNl9hXlyoL3J5FYHhA41eTz8wCfVEVFDsZcWbCSJgdfriz4oCYHX64s+JAmB1+uLFhZk4MvVxasosnBlysLVtXkYMyVVdPkYMyVVdfkYMyV1dDkYMyV1dTkYMyV1dLkYMyV1dbkYMyV1dHkYMyV1dXkYMyV1dPkYMyV1dfkYMyVNdDkYMyVNdTkYMyVNdLkYMyVPazJwZgra6zJwZgra6LJwZgra6rJwZgra6bJwZgra67JwZgra6HJwZgra6nJwZgre0STgzFX1kqTgzFX9qgmB2Ou7DFNDsZcWWtNDsZc2eOaHIy5sjaaHIy5sic0ORhzZeGaHIy5sraaHIy5snaaHIy5svaaHIy5sghNDsZcWQdNDsZcWUdNDsZc2ZOaHIy5skhNDsZc2VOaHIy5sk6aHIy5sihNDsZcWWdNDsZcWbQmB2OuLEaTgzFX1kWTgzFX1lWTgzFXFqvJwZgri9PkYMyVxWtyMObKEjQ5GHNl3TQ5GHNl3TU5GHNlPTQ5GHNlPTU5GHNlT2tyMObKemlyMObKntHkYMyVEYYmL8iVVT2TKwtWQvBBBM1GZQSrIFgVwWoIVkewBoI1EayFYG0E6yBYF8F6CNZHsAGCDRFshODDCDZGsAmCTU3p3lS9TcHY1FpNmdJU+ExxzNSVTEnGVDNMIcCMoZvhZzNyawY9zXihGWozo1RmgMeMjZhhBdMjN51Z0w80XSjT+zAf7uab13wumi8t85Fi3u/m1WjeKuaBbJ5l5jFg7iBz8ZnzZpCvNFdWiZ4rC1Yk5crMbpSw0XMZutiqsubKOMNGFI4ryJX1vnzjjLky58pyZb2TSCzPC5xq8vl5nk8qUZGDM1f2giYHY66sjyYHY67sRU0OxlxZX00OxlzZS5ocjLmyfpocjLmylzU5GHNl/TU5GHNlr2hyMObKBmhyMObKXtXkYMyVDdTkYMyVvabJwZgrG6TJwZgrG6zJwZgrS9LkYMyVJWtyMObKUjQ5GHNlQzQ5GHNlQzU5GHNlr2tyMObKhmlyMObKhmtyMObKRmhyMObKRmpyMObKRmlyMObK3tDkYMyVjdbkYMyVvanJwZgrG6PJwZgrG6vJwZgrG6fJwZgre0uTgzFXNl6TgzFXNkGTgzFXNlGTgzFXNkmTgzFXNlmTgzFX9rYmB2OubIomB2OubKomB2OubJomB2Ou7B1NDsZc2XRNDsZc2buaHIy5shmaHIy5spmaHIy5slmaHIy5svc0ORhzZbM1ORhzZe9rcjDmyuZocjDmyuZqcjDmyuZpcjDmyuZrcjDmyhZocjDmyj7Q5GDMlS3U5GDMlX2oycGYK1ukycGYK/tIk4MxV7ZYk4MxV/axJgdjrmwJgeP8XFm1P3NlLyDYB8EXEeyL4EsI9kPwZQT7I/gKggMQfBXBgQi+huAgBAcjmIRgMoIpCA5BcCiCryM4DMHhpnRvqt6mYGxqraZMaSp8pjhm6kqmJGOqGaYQYMbQzfCzGbk1g55mvNAMtZlRKjPAY8ZGzLCC6ZGbzqzpB5oulOl9mA93881rPhfNl5b5SDHvd/NqNG8V80A2zzLzGDB3kLn4zHkzyFeaK4NbKgPJskRasiwxmRI3+iRDl1s13mQZY9yIwnEFybKll2+cMVmW+cqSZUuTSCzLBE41+fws45NarsjBmSxbocnBmCxbqcnBmCz7VJODMVm2SpODMVn2mSYHY7JstSYHY7IspMnBmCyDJgdjsuxzTQ7GZNkaTQ7GZNlaTQ7GZNk6TQ7GZNl6TQ7GZNkGTQ7GZNlGTQ7GZNkmTQ7GZNlmTQ7GZNkWTQ7GZNkXmhyMybKtmhyMybJtmhyMybLtmhyMybIdmhyMybKdmhyMybIvNTkYk2W7NDkYk2VfaXIwJst2a3IwJsv2aHIwJsv2anIwJsu+1uRgTJbt0+RgTJZ9o8nBmCzbr8nBmCw7oMnBmCw7qMnBmCz7VpODMVl2SJODMVn2nSYHY7LssCYHY7Lse00OxmTZEU0OxmTZUU0OxmTZMU0OxmTZD5ocjMmyHzU5GJNlP2lyMCbLjmtyMCbLftbkYEyW/aLJwZgs+1WTgzFZdkKTgzFZ9psmB2Oy7KQmB2Oy7HdNDsZk2SlNDsZk2R+aHIzJstOaHHzJMj+TJgdfssy3NDn4kmW+rcnBlyzzHU0OvmSZn1mTgy9Z5mchcJyfLKv+Z7JsBYIrEfwUwVUIfobgagRDCALBzxFcg+BaBNchuB7BDQhuRHATgpsR3ILgFwhuRXAbgtsR3GFK96bqbQrGptZqypSmwmeKY6auZEoyppphCgFmDN0MP5uRWzPoacYLzVCbGaUyAzxmbMQMK5geuenMmn6g6UKZ3of5cDffvOZz0XxpmY8U8343r0bzVjEPZPMsM48BcweZi8+cN4N8pcmyihnIlS2n5cqWJxP0/KwZutiq8+bK+MJGJI6M58r8bJdvnDFXluWKcmV+tiQSS3aBU00+P9n5pHIocjDmyvycmhx8uTI/lyYHX67Mz63JwZcr8/NocvDlyvy8mhx8uTI/nyYHX67Mz6/JwZcr8wtocvDlyvxrNDn4cmV+QU0OvlyZX0iTgy9X5hfW5ODLlflFNDn4cmV+UU0OvlyZ72py8OXKfE+Tgy9X5gc0OfhyZX5Qk4MvV+b7mhx8uTI/TJODL1fmX6vJwZcr84tpcvDlyvzimhx8uTK/hCYHX67Mv06Tgy9X5pfU5ODLlfmlNDn4cmV+aU0OvlyZX0aTgy9X5pfV5ODLlfnXa3Lw5cr8cpocfLky/wZNDr5cmX+jJgdfrsy/SZODL1fm36zJwZcr82/R5ODLlfm3anLw5cr82zQ5+HJlfnlNDr5cmX+7JgdfrsyvoMnBlyvz79Dk4MuV+XdqcvDlyvy7NDn4cmX+3ZocfLky/x5NDr5cmX+vJgdfrsy/T5ODL1fm36/JwZcr8x/Q5ODLlfkVNTn4cmV+JU0OvlyZ/6AmB1+uzH9Ik4MvV+ZX1uTgy5X5VTQ5+HJlflVNDsZcWTVNDsZcWXVNDsZcWQ1NDsZcWU1NDsZcWS1NDsZcGeFPHS/IldU4kyvzc8LPBT83/Dzw88LPBz8//ALwr4FfEH4h+IXhF4FfFL4L34MfgB+E78MPg38t/GLwi5vSval6m4KxqbWaMqWp8JnimKkrmZKMqWaYQoAZQzfDz2bk1gx6mvFCM9RmRqnMAI8ZGzHDCqZHbjqzph9oulCm92E+3M03r/lcNF9a5iPFvN/Nq9G8VcwD2TzLzGPA3EHm4jPnzSBf8YplgXcRmElMlvk5SMkysxslblQnQ5dbDdZkGWfciMJxBcmyupdvnDFZlvXKkmV1k0gs9QRONfn81OOTqp/BU026A4usR5ENpB03osgm2gFvoHjAOSNwDTU5GCNwjTQ5GCNwD2tyMEbgGmtyMEbgmmhyMEbgmmpyMEbgmmlyMEbgmmtyMEbgWmhyMEbgWmpyMEbgHtHkYIzAtdLkYIzAParJwRiBe0yTgzEC11qTgzEC97gmB2MEro0mB2ME7glNDsYIXLgmB2MErq0mB2MErp0mB2MErr0mB2MELkKTgzEC10GTgzEC11GTgzEC96QmB2MELlKTgzEC95QmB2MErpMmB2MELkqTgzEC11mTgzECF63JwRiBi9HkYIzAddHkYIzAddXkYIzAxWpyMEbg4jQ5GCNw8ZocjBG4BE0OxghcN00Oxghcd00OxghcD00OxghcT00Oxgjc05ocjBG4XpocjBG4ZzQ5GCNwz2pyMEbgntPkYIzA9dbkYIzAPa/JwRiBS9TkYIzAvaDJwRiB66PJwRiBe1GTgzEC11eTgzEC95ImB2MErp8mB2ME7mVNDsYIXH9NDsYI3CuaHIwRuAGaHIwRuFc1ORgjcAM1ORgjcK8ROM6PwNX8MwLXEH4j+A/Dbwy/Cfym8JvBbw6/BfyW8B+B3wr+o/Afg98a/uPw28B/An44/Lbw28FvDz/ClO5N1dsUjE2t1ZQpTYXPFMdMXcmUZEw1wxQCzBi6GX42I7dm0NOMF5qhNjNKZQZ4zNiIGVYwPXLTmTX9QNOFMr0P8+FuvnnN56L50jIfKeb9bl6N5q1iHsjmWWYeA+YOMhefOW8GOa0IHDnI1ODMcb1srqYEZbz54vZJybr6KaTzWp/i0h9E0SqRsbHzmrz5O8ZQ1qAMnhNi/m7w5RtnzN9lu7LLdjDpsvWTBE41+fwwDqskK3JwxtpSNDkYY21DNDkYY21DNTkYY22va3IwxtqGaXIwxtqGa3IwxtpGaHIwxtpGanIwxtpGaXIwxtre0ORgjLWN1uRgjLW9qcnBGGsbo8nBGGsbq8nBGGsbp8nBGGt7S5ODMdY2XpODMdY2QZODMdY2UZODMdY2SZODMdY2WZODMdb2tiYHY6xtiiYHY6xtqiYHY6xtmiYHY6ztHU0OxljbdE0Oxljbu5ocjLG2GZocjLG2mZocjLG2WZocjLG29zQ5GGNtszU5GGNt72tyMMba5mhyMMba5mpyMMba5mlyMMba5mtyMMbaFmhyMMbaPtDkYIy1LdTkYIy1fajJwRhrW6TJwRhr+0iTgzHWtliTgzHW9rEmB2OsbYkmB+PfX32iycEYa1uqycEYa1umycEYa1uuycEYa1uhycEYa1upycEYa/tUk4Mx1rZKk4Mx1vaZJgdjrG21JgdjrC2kycEYa4MmB2Os7XNNDsZY2xpNDsZY21pNDsZY2zpNDsZY23oCx/mxtlp/xtpS4A+BPxT+6/CHwR8OfwT8kfBHwX8D/mj4b8IfA38s/HHw34I/Hv4E+BPhT4I/Gf7b8KeY0r2pepuCsam1mjKlqfCZ4pipK5mSjKlmmEKAGUM3w89m5NYMeprxQjPUZkapzACPGRsxwwqmR246s6YfaLpQpvdhPtzNN6/5XDRfWuYjxbzfzavRvFXMA9k8y8xjwNxB5uIz580gX9XKbjOo+bNk2spuZ/a6fNxoQ4Yut1q8yTLG7i6F4wqSZRspjVOSZRYlWWZdWbJsYxKJZRPhEM2sEhXerlOVmB41EqLbVQ2Pikqc2Lhyg5rVkxMnt4iMj46IizM6xa/IZmAG6boNvEuC2cwEs7n4FawC9wqKrKfuSDw5WzJ4/dKMDqAaHUA2+oXAA4P8fmLM9W3V5GDM9W3T5GDM9W3X5GDM9e3Q5GDM9e3U5GDM9X2pycGY69ulycGY6/tKk4Mx17dbk4Mx17dHk4Mx17dXk4Mx1/e1Jgdjrm+fJgdjru8bTQ7GXN9+TQ7GXN8BTQ7GXN9BTQ7GXN+3mhyMub5DmhyMub7vNDkYc32HNTkYc33fa3Iw5vqOaHIw5vqOanIw5vqOaXIw5vp+0ORgzPX9qMnBmOv7SZODMdd3XJODMdf3syYHY67vF00Oxlzfr5ocjLm+E5ocjLm+3zQ5GHN9JzU5GHN9v2tyMOb6TmlyMOb6/tDkYMz1ndbk4Mv1hWXS5ODL9YVZmhx8ub4wW5ODL9cX5mhy8OX6wjJrcvDl+sKyaHLw5frCsmpy8OX6wrJpcvD9oWNYdk0OvlxfWA5NDr5cX1hOTQ6+XF9YLk0OvlxfWG5NDr5cX1geTQ6+XF9YXk0OvlxfWD5NDr5cX1h+TQ6+XF9YAU0Ovlxf2DWaHHy5vrCCmhx8ub6wQpocfLm+sMKaHHy5vrAimhx8ub6wopocfLm+MJfAcUHQipRDo6V+wrzLO7yClFdYgELOlvK6kiDPegRyk3bciMD0JBJ0MKMnkibr/7NsxVLP7boS2bB0Ze1zbi/Ne73fKCYuIrJ9TPTtjSJiOyfEh8dHxkQnD0nNf4X557arpv40883n7RE2BGHXIqwYwoojrETitCqxkVFRkR3P6A/JlpQ4qUlkdMeoCOrtc+3lj/pgmlb1DJ4/cpxwM+mMlHgmo9fPENI4fwPS5XAdyWIcpUUCSMZzmdWNRdqFXZJwGAlBxrCSxTP+2K1Oclgqow9dzhNd+l890ZmuKLrtb6LsGOaZFw3tmigjZDQsSDUapBktK/ExkIlwMmtINGwRGq4p0bBNaLiWRMMOoeHaV9Lw5UTrUC4v50RGm6a8N+tKHMjMhIbrSTSchdBwfYmGsxIabiDRcDZCww0lGs5OaLiRRMM5CA0/LNFwTkLDjSUazkVouIlEw7kJDTeVaDgPoeFmEg3nJTTcXKLhfISGW0g0nJ/QcEuJhgsQGn5EouFrCA23kmi4IKHhRyUaLkRo+DGJhgsTGm4t0XARQsOPSzRclNBwG4mGXULDT0g07BEaDpdomDJO2Vai4SCh4XYSDfuEhttLNBxGaDhCouFrCQ13kGi4GKHhjhINFyc0/KREwyUIDUdKNHwdoeGnJBouSWi4UwYbTibMW1gd/hbK9Ib+FjPcSOnER8mY/IJk8guiyc5XcgovJxpNGjn5Q+LqKUWwFyNyYsJKUk5MWCkzXkw5MV0kxpW6SojGSojGSYjGS4gmSIh2kxDtLiHaQ0K0p4To0xKivSREn5EQfVZC9DkJ0d4SoqHnRVQTRVRfEFHtI6L6oohqXxHVl0RU+4moviyi2l9E9RUR1QEiqq+KqA4UUX1NRHWQiOpgEdUkEdVkEdUUEdUhIqpDRVRfF1EdJqI6XER1hIjqSBHVUSKqb4iojhZRfVNEdYyI6lgR1XEiqm+JqI4XUZ0gojpRRHWSiOpkEdW3RVSniKhOFVGdJqL6jojqdBHVd0VUZ4iozhRRnSWi+p6I6mwR1fdFVOeIqM4VUZ0nojpfRHWBiOoHIqoLRVQ/FFFdJKL6kYjqYhHVj0VUl4iofiKiulREdZmI6nIR1RUiqitFVD8VUV0lovqZiOpqEdWQiCpEVD8XUV0jorpWRHWdiOp6EdUNIqobRVQ3iahuFlHdIqL6hYjqVhHVbSKq20VUd4io7hRR/VJEdZeI6lciqrtFVPeIqO4VUf1aRHWfiOo3Iqr7RVQPiKgeFFH9VkT1kIjqdyKqh0VUvxdRPSKielRE9ZiI6g8iqj+KqP4konpcRPVnEdVfRFR/FVEVmU4g9JuI6kkR1d9FVE+JqP4honpaQhVWJhlZS0bWlpF1ZGQzy8hmkZHNKiObTUY2u4xsDhnZnDKyuWRkc8vI5pGRzSsjm09GNr+MbAEZ2WtkZAvKyBaSkS0sI1tERraojKwrI+vJyAZkZIMysr6MbJiM7LUyssVkZIvLyJaQkb1ORrakjGwpGdnSGZSlTiIZmE3JYp+ZFnNrMslomWSK3mwpnPepONtoOGVJOO9L4cyh4myn4VxPwpkjhTOXirODhlOOhDNXCmceFWcnDecGEs48KZz5VJwvaTg3knDmS+EsoOLsouHcRMJZIIXzARXnKxrOzSScD6RwFlJxdtNwbiHhLJTC+ZCKs4eGcysJ50MpnEVUnL00nNtIOIukcD6i4nxNwylPwvlICmcxFWcfDed2Es5iKZyPqTjf0HAqkHA+lsJZQsXZT8O5g4SzRArnEyrOARrOnSScT6RwllJxDtJw7iLhLJXCWUbF+ZaGczcJZ5kUznIqziEazj0knOVSOCuoON/RcO4l4ayQwllJxTlMw7mPhLNSCudTKs73NJz7STifSuGsouIcoeE8QMJZJYXzGRXnKA2nIgnnMymc1VScYzScSiSc1VI4ISrODzScB0k4ISkcUHF+pOE8RMKBFM7nVJyfaDiVSTifS+GsoeIcp+FUIeGskcJZS8X5mYZTlYSzVgpnHRXnFxpONRLOOimc9VScX2k4pGXZAuulcDZQcU7QcGqQcDZI4Wyk4vxGw6lJwtkohbOJinOShlOLhLNJCmczFed3Gk5tEs5mKZwtVJxTNBzSOmmBLVI4X1Bx/qDh1CXhfCGFs5WKc5qGU4+Es1UKZxsRJywTDac+CWebFM52Ko5FwyEtMBrYLoWzg4pj03AaknB2SOHspOI4NJxGJJydUjhfUnEy03AeJuF8KYWzi4qThYbTmISzSwrnKypOVhpOExLOV1I4u6k42Wg4TUk4u6Vw9lBxstNwmpFw9kjh7KXi5KDhNCfh7JXC+ZqKk5OG04KE87UUzj4qTi4aTksSzj4pnG+oOLlpOI+QcL6RwtlPxclDw2lFwtkvhXOAipOXhvMoCeeAFM5BKk4+Gs5jJJyDUjjfUnHy03Bak3C+lcI5RMUpQMN5nIRzSArnOyrONTScNiSc76RwDlNxCtJwniDhHJbC+Z6KU4iGE07C+V4K5wgVpzANpy0J54gUzlEqThEaTjsSzlEpnGNUnKI0nPYknGNSOD9QcVwaTgQJ54crwLmcanWElaHAnFlJsQwtZtRBwCaKrEcgD2nHjSiynWa0o5TRvFSjO2hGn5Qymo9qdCfNaKSU0fxUo1/SjD4lZbQA1egumtFOUkavoRr9imY0SspoQarR3TSjnaWMFqIa3UMzGi1ltDDV6F6a0Rgpo0WoRr+mGe0iZbQo1eg+mtGuUkZdqtFvaEZjpYx6VKP7aUbjpIwGqEYP0IzGSxkNUo0epBlNkDLqU41+SzPaTcpoGNXoIZrR7lJGr6Ua/Y5mtIeU0WJUo4dpRntKGS1ONfo9zejTUkZLUI0eoRntJWX0OqrRozSjz0gZLUk1eoxm9Fkpo6WoRn+gGX1OymhpqtEfaUZ7SxktQzX6E83o81JGy1KNHqcZTZQyej3V6M80oy9IGS1HNfoLzWgfKaM3UI3+SjP6opTRG6lGT9CM9pUyehPV6G80oy9JGb2ZavQkzWg/KaO3UI3+TjP6spTRW6lGT9GM9pcyehvV6B80o69IGS1PNXqaZnSAlNHbiUaLZqIZfVXKaAWqUYtmdKCU0TuoRm2a0dekjN5JNerQjA6SMnoX1WhmmtHBUkbvphrNQjOaJGX0HqrRrDSjyVJG76UazUYzmiJl9D6q0ew0o0OkjN5PNZqDZnSolNEHqEZz0oy+LmW0ItVoLprRYVJGK1GN5qYZHS5l9EGq0Tw0oyOkjD5ENZqXZnSklNHKVKP5aEZHSRmtQjWan2b0DSmjValGC9CMjpYyWo1q9Bqa0TeljFanGi1IMzpGymgNqtFCNKNjpYzWpBotTDM6TspoLarRIjSjb0kZrU01WpRmdLyU0TpUoy7N6AQpo3WpRj2a0YlSRutRjQZoRidJGa1PNRqkGZ0sZbQB1ahPM/q2lNGGVKNhNKNTpIw2ohq9lmZ0qpTRh6lGi9GMTpMy2phqtDjN6DtSRptQjZagGZ0uZbQp1eh1NKPvShltRjVakmZ0hpTR5lSjpWhGZ0oZbUE1WppmdJaU0ZZUo8SsyHtSRh+hGi1LMzpbymgrqtHraUbflzL6KNVoOZrROVJGH6MavYFmdK6U0dZUozfSjM6TMvo41ehNNKPzpYy2oRq9mWZ0gZTRJ6hGb6EZ/UDKaDjV6K00owuljLalGr2NZvRDKaPtqEbL04wukjLanmr0dprRj6SMRlCNVqAZXSxltAPV6B00ox9LGe1INXonzegSKaNPUo3eRTP6iZTRSKrRu2lGl0oZfYpq9B6a0WVSRjtRjd5LM7pcymgU1eh9NKMrpIx2phq9n2Z0pZTRaKrRB2hGP5UyGkM1WpFmdJWU0S5Uo5VoRj+TMtqVavRBmtHVUkZjqUYfohkNSRmNoxqtTDMKKaPxVKNVaEY/lzKaQDValWZ0jZTRblSj1WhG10oZ7U41Wp1mdJ2U0R5UozVoRtdLGe1JNVqTZnSDlNGnqUZr0YxulDLai2q0Ns3oJimjz1CN1qEZ3Sxl9Fmq0bo0o1ukjD5HNVqPZvQLKaO9qUbr04xulTL6PNVoA5rRbVJGE6lGG9KMbpcy+gLVaCOa0R1SRvtQjT5MM7pTyuiLVKONaUa/lDLal2q0Cc3oLimjL1GNNqUZ/UrKaD+q0WY0o7uljL5MNdqcZnSPlNH+VKMtaEb3Shl9hWq0Jc3o11JGB1CNPkIzuk/K6KtUo61oRr+RMjqQavRRmtH9UkZfoxp9jGb0gJTRQVSjrWlGD0oZHUw1+jjN6LdSRpOoRtvQjB6SMppMNfoEzeh3UkZTqEbDaUYPSxkdQjXalmb0eymjQ6lG29GMHpEy+jrVaHua0aNSRodRjUbQjB6TMjqcarQDzegPUkZHUI12pBn9UcroSKrRJ2lGf5IyOopqNJJm9LiU0TeoRp+iGf1ZyuhoqtFONKO/SBl9k2o0imb0VymjY6hGO9OMnpAyOpZqNJpm9Dcpo+OoRmNoRk9KGX2LarQLzejvUkbHU412pRk9JWV0AtVoLM3oH1JGJ1KNxtGMnpYyOolqNJ5k1M4kZXQy1WgCzaglZfRtqtFuNKO2lNEpVKPdaUYdKaNTqUZ70IxmljI6jWq0J81oFimj71CNPk0zmlXAaHWEkeYcPrOMFC1xZ2fLoM3BNNnsMrI5ZGRzysjmkpHNLSObR0Y2r4xsPhnZ/DKyBWRkr5GRLSgjW0hGtrCMbBEZ2aIysq6MrCcjG5CRDcrI+jKyYTKy18rIFpORLS4jW0JG9joZ2ZIysqVkZEvLyJaRkS0rI3u9jGw5GdkbZGRvlJG9KYOySbSeE23OKftmGahbZKBoM9XYt8pA3SYjW15G9nYZ2QoysnfIyN4pI3uXjOzdMrL3yMjeKyN7n4zs/TKyD8jIVpSRrSQj+6CM7EMyspVlZKvIyFaVka0mI1tdRraGjGxNGdlaMrK1ZWTryMjWlZGtJyNbX0a2gYxsQxnZRjKyD8vINpaRbSIj21RGtpmMbHMZ2RYysi1lZB+RkW0lI/uojOxjGZVNTib05ElNt5YhelxGto2M7BMysuEysm1lZNvJyLaXkY2Qke0gI9tRRvZJGdlIGdmnZGQ7ychGych2lpGNlpGNkZHtIiPbVUY2VkY2TkY2XkY2QUa2m4xsdxnZHjKyPWVkn5aR7SUj+4yM7LMyss/JyPaWkX1eRjZRRvYFGdk+MrIvysj2lZF9SUa2n4zsyzKy/WVkX5GRHSAj+6qM7EAZ2ddkZAfJyA6WkU2SkU2WkU2RkR0iIztURvZ1GdlhMrLDZWRHyMiOlJEdJSP7hozsaBnZN2Vkx8jIjpWRHScj+5aM7HgZ2QkyshNlZCfJyE6WkX1bRnaKjOxUGdlpMrLvyMhOl5F9V0Z2hozsTBnZWTKy78nIzpaRfV9Gdo6M7FwZ2XkysvNlZBfIyH4gI7tQRvZDGdlFMrIfycgulpH9WEZ2iYzsJzKyS2Vkl8nILpeRXSEju1JG9lMZ2VUysp/JyK6WkQ3JyEJG9nMZ2TUysmtlZNfJyK6Xkd0gI7tRRnaTjOxmGdktMrJfyMhulZHdJiO7XUZ2h4zsThnZL2Vkd8nIfiUju1tGdo+M7F4Z2a9lZPfJyH4jI7tfRvaAjOxBGdlvZWQPych+JyN7WEb2exnZIzKyR2Vkj8nI/iAj+6OM7E8yssdlZH+Wkf1FRvZXGdkTMrK/ycielJH9XUb2lIzsHzKyp0VknUwyspaMrC0j68jIZpaRzSIjm1VGVmbGXUdmxl1HZsZdR2bGXUdmxl1HZsZdR2bGXUdmxl1HZsZdR2bGXUdmxl3nGhlZmRl3HZkZdx2ZGXcdmRl3HZkZdx2ZGXcdmRl3HZkZdx2ZGXcdmRl3HZkZdx2ZGXcdmRl3HZkZdx2ZGXcdmRl3HZkZdx2ZGXcdmRl3HZkZdx2ZGXcdmRl3HZkZdx2ZGXcdmRl3nZtkZGWm0nVukZGVmSPXkZkj15GZI9e5XUZWZo5cR2aOXEdmjlxHZo5cR2aOXEdmjlxHZo5cR2aOXEdmjlxHZo5cR2aOXEdmjlxHZo5cR2aOXEdmjlxHZo5cR2aOXEdmjlxHZo5cR2aOXEdmjlxHZo5cR2aOXEdmjlxHZo5cR2aOXEdmjlxHZo5cR2aOXEdmjlxHZo5cp7GMrMwcuY7MHLmOzBy5jswcuY7MHLmOzBy5jswcuY7MHLmOzBy5zmMysjLz3zoy8986MvPfOjLz3zoy8986MvPfOjLz3zoy8986MvPfOjLz3zoy8986MvPfOjLz3zoy8986MvPfOjLz3zoy8986MvPfOjLz3zoy8986MvPfOrEysjLz3zoy8986MvPfOjLz3zoy8986MvPfOjLz3zoy8986MvPfOjLz3zoy8986MvPfOjLz3zoy8986MvPfOjLz3zoy8986MvPfOjLz3zoy8986MvPfOjLz3zoy8986MvPfOjLz3zoy8986MvPfOjLz3zoy8986MvPfOjLz3zrJMrIy8986MvPfOjLz3zoy8986MvPfOjLz3zoy8986MvPfOjLz3zoy8986MvPfOjLz3zoy8986MvPfOjLz3zoy8986MvPfOjLz3zoy8986MvPfOjLz3zoy8986MvPfOjLz3zqk+W/rR3SOie1ZOzoyPqXODqdDjZq1atepW69+g4aNHm7cpGmz5i1aPtLq0cdaP97mifC27dpHdOj4ZORTnaI6R8d06RobF5/QrXuPnk/3eubZ53qHng8lhl4I9Qm9GOobeinUL/RyqH/oldCA0KuhgaHXQoNCg0NJoeRQSmhIaGjo9dCw0PDQiNDI0KjQG6HRoTdDY0JjQ+NCb4XGhyaEJoYmhSaH3g5NCU0NTQu9E5oeejc0IzQzNCv0Xmh26P3QnNDc0LzQ/NCC0AehhaEPQ4tCH4UWhz4OLQl9EloaWhZaHloRWhn6NLQq9FlodSgUQujz0JrQ2tC60PrQhtDG0KbQ5tCW0BehraFtoe2hHaGdoS9Du0JfhXaH9oT2hr4O7Qt9E9ofOhA6GPo2dCj0Xehw6PvQkdDR0LHQD6EfQz+Fjod+Dv0S+jV0IvRb6GTo99Cp0B+h07AywbJg2bAcWJlhZYGVFVY2WNlh5YCVE1YuWLlh5YGVF1Y+WPlhFYB1DayCsArBKgyrCKyisFxYHqwArCAsH1YYrGthFYNVHFYJWNfBKgmrFKzSsMrAKgvreljlYN0A60ZYN8G6GdYtsG6FdRus8rBuh1UB1h2w7oR1F6y7Yd0D615Y98G6H9YDsCrCqgTrQVgPwaoMqwqsqrCqwaoOqwasmrBqwaoNqw6surDqwaoPqwGshrAawXoYVmNYTWA1hdUMVnNYLWC1hPUIrFawHoX1GKzWsB6H1QbWE7DCYbWF1Q5We1gRsDrA6gjrSViRsJ6C1QlWFKzOsKJhxcDqAqsrrFhYcbDiYSXA6garO6wesHrCehpWL1jPwHoW1nOwesN6HlYirBdg9YH1Iqy+sF6C1Q/Wy7D6w3oF1gBYr8IaCOs1WINgDYaVBCsZVgqsIbCGwnod1jBYw2GNgDUS1ihYb8AaDetNWGNgjYU1DtZbsMbDmgBrIqxJsCbDehvWFFhTYU2D9Q6s6bDehTUD1kxYs2C9B2s2rPdhzYE1F9Y8WPNhLYD1AayFsD6EtQjWR7AWw/oY1hJYn8BaCmsZrOWwVsBaCetTWKtgfQZrNawQLMD6HNYaWGthrYO1HtYGWBthbYK1GdYWWF/A2gprG6ztsHbA2gnrS1i7YH0FazesPbD2wvoa1j5Y38DaD+sArIOwvoV1CNZ3sA7D+h7WEVhHYR2D9QOsH2H9BOs4rJ9h/QLrV1gnYP0G6ySs32GdgvUHrNOwM8G2YNuwHdiZYWeBnRV2NtjZYeeAnRN2Lti5YeeBnRd2Ptj5YReAfQ3sgrALwS4MuwjsorBd2B7sAOwgbB92GOxrYReDXRx2CdjXwS4JuxTs0rDLwC4L+3rY5WDfAPtG2DfBvhn2LbBvhX0b7PKwb4ddAfYdsO+EfRfsu2HfA/te2PfBvh/2A7Arwq4E+0HYD8GuDLsK7Kqwq8GuDrsG7Jqwa8GuDbsO7Lqw68GuD7sB7IawG8F+GHZj2E1gN4XdDHZz2C1gt4T9COxWsB+F/Rjs1rAfh90G9hOww2G3hd0OdnvYEbA7wO4I+0nYkbCfgt0JdhTszrCjYcfA7gK7K+xY2HGw42EnwO4GuzvsHrB7wn4adi/Yz8B+FvZzsHvDfh52IuwXYPeB/SLsvrBfgt0P9suw+8N+BfYA2K/CHgj7NdiDYA+GnQQ7GXYK7CGwh8J+HfYw2MNhj4A9EvYo2G/AHg37TdhjYI+FPQ72W7DHw54AeyLsSbAnw34b9hTYU2FPg/0O7Omw34U9A/ZM2LNgvwd7Nuz3Yc+BPRf2PNjzYS+A/QHshbA/hL0I9kewF8P+GPYS2J/AXgp7GezlsFfAXgn7U9irYH8GezXsEGzA/hz2GthrYa+DvR72BtgbYW+CvRn2FthfwN4Kexvs7bB3wN4J+0vYu2B/BXs37D2w98L+GvY+2N/A3g/7AOyDsL+FfQj2d7APw/4e9hHYR2Efg/0D7B9h/wT7OOyfYf8C+1fYJ2D/Bvsk7N9hn4L9B+zTcDLBMW9dG44DJzOcLHCywskGJzucHHBywskFJzecPHDywskHJz+cAnCugVMQTiE4heEUgVMUjgvHgxOAE4TjwwmDcy2cYnCKwykB5zo4JeGUglMaThk4ZeFcD6ccnBvg3AjnJjg3w7kFzq1wboNTHs7tcCrAuQPOnXDugnM3nHvg3AvnPjj3w3kATkU4leA8COchOJXhVIFTFU41ONXh1IBTE04tOLXh1IFTF049OPXhNIDTEE4jOA/DaQynCZymcJrBaQ6nBZyWcB6B0wrOo3Aeg9MazuNw2sB5Ak44nLZw2sFpDycCTgdTwDfFdlMYN0VsU3A2xWFTyDVFV1MgNcVMU3g0RUJT0DPFN1MoM0UtU4AyxSJT2DFFGFMwMcUNU4gwRQMzwG8G483AuRnkNgPSZvDYDPSaQVkzgGoGO83ApBlENAN+ZnDODKSZQS8zQGUGk8zAjxmkMQMqZvDDDFSYQQUzAGA666ZjbTrBpsNqOpemI2g6baaDZTpDpuNiOhmmQ2A+3s2HtvkoNh+w5mPTfBiajzjzwTW1cUR8Qmx0tfD48B2ZamSybCdzlqzZsufImSt3nrz58he4pmChwkWKul4g6IddW6x4ietKlipdpuz15W648aabb7n1tvK3V7jjzrvuvufe++5/oGKlBx+qXKVqteqDB+/IVDI5cULldpGxTZPXrM126KfVKzoOHvzXj5pf+qPWl/7oiUt/FH3pjxKS1wzadujLF3O+9v3fP+p56V6h/mn8bGjymtl33nRfnpZlnv/7Z8j89KV6yNwnjT2zJl4qiax90vrh2rR+uD0NzZxeGnvm/DANSzmXp/HruU+m8eu5T6Xxwzx10vphszQ086eksWeBu9KwVODBNH69YEIav16we1o/XJbWD9ekoVk0Txp7Fp2ZhqWiC9L4de9IGr/uHUvjh4FK5/1wZPLW68P/7M+0aRfTuUt4fGTbqIg2MbHh7cz/dYuIjYuMiW7TPTa8S5eI2B2ZiiROrBoTHRefkjipWmRsRLt4O3Fy7ej4iI4RseObVbj98l2hi3/fytDvP1/t4t/PlLH2qyVOqBoeFZWU65zO240jogx0t4gMkmS6VMHJqMI7Z7y0N0+oqjFdep5Dqna+p/PEzzrPc9XOqzE4n9AkPqZLUnI6Ti86R1Un1oiMiLr838jlnXT2mf0Xaf7EaTViYiMiO0af+c+hW8uGPx0f0a5NQnxUm7MXbNVz12vDPy/X5mev1sGDkxKnn+1LV27fPjYiLu6ckaTESU0iO3eJijjr6O/2LvKbOUNHo0e1xGlVIqPDz/Tc4xt2Gfq3ivN2PdN00yfDo8+opF6v5xqZVCehc5faHZLP/ULhxOm1o9ufdZruTXLXP2QXty0/vvn9Ord3TpzQ1NywScmpv//33foXcfLsuIj4NnER0e0jYtt0iIltEx/eMU7/7q5+lXd39b+unNxXfYVblypkZr+7nfPFx9eP6XbB/XRuf677vrr0ff+Pt+8HZ+/eLrHdzHUX3+TPS8/8e1Nz4aVxw6bqi9yy1f8X3rLvRcV0/Pu9fO59/ITyHRt5lXds5F8XS61Lr80sGVMqfalCVvY7Nsv54sb5eeDVUjf+bvWtZvdctFP11I30d6qRupH+TjVTN9LfqVbqRvo71U7dSH+nOqkb6e9UN3Uj/Z3qpW6kv1P91I30d2qQupH+Tg1TN9LfqVHqRvo7PZy6kf5OjVM30t+pSepG+js1Td1If6dmqRvp79Q8dSP9nVqkbqS/U8vUjfR3eiR1I/2dWqVupL/To6kb6e/0WOpG+ju1Tt1If6fHUzfS36lN6kb6Oz2RupH+TuGpG+nv1DZ1I/2d2qVupL9T+9SN9HeKSN1If6cOqRvp79QxdeP8ndL/yrnab5PqV/38L3mxuyypL8VLtLNlTLtU2h8c1njzwXP+t4Z1fgsXf1pc6avRuqjx1CbONX8ps/3X0fj7S+f8E3PBv2Q+3/IF/3Lx29K852tffIyd85u+2m/uJ6/6GrAErwH7/9A1kJnzGsh8ftNn92l61b2dyH+rt5PmSc128Ul1Ug/IBccne+oOF/w8R+qhTbOBnJOqd00Ij4o7v41zWtku6ajkbJI4oV5MePtzP8ia+ksTDWVsxKUtZ0275ewXo2VPvVzS/IUcF/9CjtRfmHDGZ1K9C3uOra66M5Du1Z710qvdSc/+P90imc/7pfN7udNTx6hMd23w4CHpd2wTp9SKCO9SOTY2vOd5V1jWkun+Rpa0fyObNeTvLvIFr9qJZ3dMSusfS17ywz/xLv6Vs11ui6fPHcnV526j3Odup9znjrrKPnfUX7dZ3au+za7/r8/9X5/7vz73f33u//rc/4P73Bfu9GTqRvo7RaZupL/TU6kb/1u6+GUEu3dl/+vi//lZUU+0i9/pvy7+v3QNZOa8BtLo4re46i5+1H9d/PO7+M3/J3fxG17YxW/9/3MXv8y/0cUvo9DFj+Lq4rf997r4Wx+IjomP7NDzzF8ltOkcGd0mNqJbROzZv4KLi2wf0SaiQ4czn57tYhJMw7GXjAYU/T/yNzN5/hf+zcxlRwP+vN4u95c1ef+3/WVNgYv+MK586p/WnL2Wm0TE14+MbnzuQm5iruPqf17GVc9exbS/uLkA4X/YH94U+RefEDf99YSIiO6aEJEQ0b5Nl4S2UZHt2nRIiDY9pJjoNu3MaUh9IgSVnwi1rvKJUOvcZXa1n9qZr/qDmvBEyHq++GVH9f68vgjDeuX/4bFxSf/mr3+pfulX77n20+tz1PzrYF9z1Q+hWv/uQ6jwRQ+hGy5+CFX/625p9OfNUuOve+XMzv/8zZTevzjp/kvm9L+nhlz4nZP2f114cVz6LVWe59lXi+vZF/j3nn0f/flo6xIb2S08PiL1gRd55iUSHR61I9Otyg+7ulf5sKt77nK+2kdVGmMb2dkfdtnOF79snYP2sEtjrzSLGP/eI/Gif8ma6ubsySpyYUe69vmWLviXOudbutqv09pX3We1L33Anj8wcuEDttzFhyHbP4xTZfBKczI+TpU9/XGqbBm95dPphGe/tBOeLZ1O+KLUt82ZJ1Sjsw+ov18ySWl3o7ObT9u0+7/20H/rhZTuv2QdmoGXUwbfX1f9bZHuKcuc1ik7r5W/RqT+sfuW1r3gpPl0SuuzJPNfx+LiXZz0YK/6YKQ7iJQlgwfjgkHRS56tb188GJ/mQeT5NKnL9Wlyy7/YLSv9V7esXWyEuffbt4lOiIqK7BCZOkbTJTamR8//Uk1pkVzpO/C/VNNF3Z7iF3d7qp69Ghv8fTH+F26i3MwzzzZjjonpW5wZthpx8UEofJU3bSGeCz1Tqp9zwhc/Xohx10yJ08+epz93b9hlyLkD/1fh55I27UvPUfZLHk7E1q30Ws80vlpkt0vOVOpNcg777wOR/MH5J+/PQ9yma4K5GSKi44dfbC9nRt+1F/1+LubTmDNVOJ3jYU/9q8HzDkum1OOTzm9Z4+snRJ133i67e5OEtmmoX9CbOe86uOhk5DqH8/8A8/pTZzhyFQA=",
|
|
1897
|
+
"debug_symbols": "tb3djmvZcaz7Ln3dFzMzMnOM4VcxDEO2ZUOAIBmyvIEDQ+9+iiwyvqneqHKrW/tGHGut1gyyihGsn+AX//PDv/32X/77P/75d3/49z/+1w//8I//88O//Ol3v//97/7jn3//x3/9zZ9/98c/fPzt//xwPf4n6od/CP3lxx/Cf/r4Qz7+sPvjD/njD3tet+t1ux+3H/+Vnv/Vfv3t+bw91+s2Xv9VPS/8uNbjyv380+O/vT7+NI8/5cd19KFZnzf9eTOfN+vzZn/efPz/5kP3+ryJz5uPO7s+bvR5U583H1c5HzfzefNxlfMht96PMf/y8af3B+Of//yn3/728S+3j87Hx+w/f/On3/7hzz/8wx/++/e///GH//Ob3//38z/6r//8zR+et3/+zZ8+/vX68Yff/uHfPm4/Lvjvv/v9bx+nv/zI//v6+v+6d8br/733lC8Qe//cS/wK9dF+i1837aWff/f1vsDZX16gvr6Apl8X0OIeVNRfXaC/vkDW+wI568sL/Lx7sPXlBb75GJx8X+BovvwY7F/7EL65B7Xen8bRdbsH/XMvkDPvK+TK84sukV3vS+TmEur8uZeIK87rEnHdng1xfvZHYq1+22nt6/ZAfvLBjG+eEOd6O+pU/pI7kRnyh+L2OD6eaX99J+abT2nqfY3SFbdnxU+usb55Zq8RT+38+hr7u89JxfYnpbJvV1m/9CqVX14lr1//eB6J+quvkd98bi77ra4TXz+Wb+7HWfl+ku1vPqbfPENSNe9nmf4qN35yL74Lz04/U/sWXn/L/VjnnV47vr5Crl/7sfjWcL4PHx+V60vX5/nmGkEEfrjW19h/HV/67oUg9jsCz0cG3CLwr1+Q9c3zYp9Mv6LO+foa3zw/VTzFeVHOib++gr65wuXnhS7FL7tGXO/np6Lq62v0dy9s/sTW3a2xf9lDmfxlD2XaXyPM6NdfY61fdo3DYznz9aelrv+3H9KzuRvn67vxnWNlz2flfOnY0ncvKurxi8rHx8ZX+fDNz79I+wXh4wkb56uLfPd1S/lTG3VzXP/sr8Oj1zs5om8P5CdXqG9C9ONrLkf5uX3l0z95auzvcpiPRN0exl+/Mtb59QnY169PwI5fm4Cdv97y335KzuNV7xU9t6/h+udf4uNLP4foVf3VJfq71/hzRfDM0JfP8G8vso+99nGR0pcXWb/+W4TvrqHM91fnun9tff46vvqbJ2ns6/1p+Xi69pd3Y77Lr2u/70ZGXl9e4/vP7YQ/t7dvPX/yuZ3vnqUx/lbj41xfRuD3F1nhj2msrz+3/8s96bxdpL+8SP/6J8h31/iZT5BZf4cnyP71T5D/5RNzHCCxo776mK7v4vTKq/xDno/vKn/ZZ3cnX8yd+PJ5tvK7H3Mcf0i6v/4hw7eeiWvfPiK/KFLj+KFkfhmp6++Rhmt+9RN1/R2eqOvv8ET99uPx90jDrMWHI7/6tOxvXvXj40vJ94cjb185/OQLmP3Nc3RHX3w3e/uIxvkb7oYNF5n68m58dwnpfTdCt28WfnqJbz4n69r+adrH+fbN/U+eo3v+DuHx3UXyav9Q7uO84suLfP9w1uWHc3J+2UWO3k+yj9c8fXlPznff5fvnBB/frMSXKfbt/Qhd7fshfflieb55qs7HrwveP/Xdt+fI/Pxn2fjJHnP7tPwtT9QtEmh/eYnT3/0O4nIQjvLrJ+q3Fyn50/JxPv2LLvLxc6R3gMzHD5L2L/q0LH8rN+v2zfH8DZ9Y/0Jhdn31if3+Q5q9+JDuLx/Ix0/cf+0j+f4SP+uh/C+X+DlP829fWeTfr6jyy68Z4upf/43t82dev/Y727jWr/3W9vll0q/93vb7i/zMn0VF/PofRv0vd+Tn/TSqvv+g8hSZL7/4iNC3L3P+gefHub58cYnvfvnUm1/l3X4sts/fckeGn+pfc/t5+P91R/4eL/3fXuVnv/b/bx/an3uV82uT5LtfLpa/YV+1f/Jrhn/6+ONv/vV3f/rresWjdBAfTy09uguPnsL5vK3rdRuv23zd6nVbr9t+3c7rdr1uX9er1/X6db1+Xa9f1+vX9fp1vX5dr1/X69f1+nW9fl1vXteb1/Xmdb15XW9e15vX9eZ1vXldb17Xm9f11ut663W99breel1vva63Xtdbr+ut1/XW63rrdb39ut6Oxy+KPm7zdftxvfr4LO963X5c75H+j/rK8/bjeo9fmz0KK4+fNTwKK4/bR2Hlefuok3xc5+TDgB+3et3W47n2cduPr9g+bud1+3G9x09Nz348Jz5uz+dtXNf7EI9fkT0O+TDS46D34eOij+z6eOV5H+Z9+LjuXo/Dfh/O6xDX+xCP/sXjkI8XqMfhcZ2HVjwqLw/1WO/Dfnzl+jic1yGvx098H4d4H/J90PvwuODj//5o4jyv/OjifP7Nfj2KRx/neZ8fjZzPQ7wP+bqrj17O56Heh34f5n14P2S9H7LeD/nhlucjrfdDfvjl86DXY3845Tzu4cMqn4f1Puz34bwOD7vE49f88TDM65Q+yafyqX0an5ZP26fzPo01xhpjjbHGWGOsMdYYa4w1xhrLGssayxrLGssayxrLGssayxrLGtsa2xrbGtsa2xrbGtsa2xrbGtsaxxrHGscaxxrHGscaxxrHGsca562R1+VT+JQ+yafyqX0an5ZP2ydrhDXCGmGNsEZYI6wR1ghrhDXCGmmNtEZaI62R1khrpDXSGmmNtIasIWvIGrKGrCFryBqyhqwha5Q1yhpljbJGWaOsUdYoa5Q1yhr2edrnaZ+nfZ72edrnaZ+nfZ72edrnaZ+nfZ72edrnaZ+nfZ72edrnaZ+nfZ72edrnaZ+nfZ72edrnaZ+nfZ72edrnaZ+nfZ72edrnaZ+nfZ72edrnaZ+nfZ72edrnaZ+nfZ72edrnaZ+nfZ72edrnss9ln8s+l30u+1z2uexz2eeyz2Wfyz6XfS77XPa57HPZ57LPZZ/LPpd9Lvtc9rnsc9nnss9ln8s+l30u+1z2uexz2eeyz2Wfyz6XfS77XPa57HPZ57LPZZ/LPpd9Lvtc9rnsc9nnss9ln8s+l30u+1z2uexz2eeyz2Wfyz6XfS77XPa57HPZ57LPZZ/LPpd9Lvtc9rnsc9nnss9ln8s+l30u+1z2uexz2eeyz2Wfyz6XfS77XPa57HPZ57LPZZ/LPpd9Lvtc9rnsc9nnss9ln8s+l31e9nnZ52Wfl31e9nnZ52Wfl31e9nnZ52Wfl31e9nnZ52Wfl31e9nnZ52Wfl31e9nnZ52Wfl31e9nnZ52Wfl31e9nnZ52Wfl31e9nnZ52Wfl31e9nnZ52Wfl31e9nnZ52Wfl31e9nnZ52Wfl31e9nnZ52Wfl31e9nnZ52Wfl31e9nnZ52Wfl31e9nnZ52Wfl31e9nnZ52Wfl31e9nnZ52Wfl31e9nnZ52Wfl31e9nnZ52Wfl31e9nnZ52Wfl31e9nnZ52Wfl31e9nnZ52Wfl31e9nnZ52Wfl31e9nnZ52Wfl33e9nnb522ft33e9nnb522ft33e9nnb522ft33e9nnb522ft33e9nnb522ft33e9nnb522ft33e9nnb522ft33e9nnb522ft33e9nnb522ft33e9nnb522ft33e9nnb522ft33e9nnb522ft33e9nnb522ft33e9nnb522ft33e9nnb522ft33e9nnb522ft33e9nnb522ft33e9nnb522ft33e9nnb522ft33e9nnb522ft33e9nnb522ft33e9nnb522ft33e9nnb522ft33e9nnb522ft33e9nnb522ft30+9vnY52Ofj30+9vnY52Ofj30+9vnY52Ofj30+9vnY52Ofj30+9vnY52Ofj30+9vnY52Ofj30+9vnY52Ofj30+9vnY52Ofj30+9vnY52Ofj30+9vnY52Ofj30+9vnY52Ofj30+9vnY52Ofj30+9vnY52Ofj30+9vnY52Ofj30+9vnY52Ofj30+9vnY52Ofj30+9vnY52Ofj30+9vnY52Ofj30+9vnY52Ofj30+9vnY52Ofj30+9vnY52Ofj30+9vnY52Ofj30+9vnY52Ofj30+9vnY52Ofj30+9vnY52Ofj32+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+7PNlny/7fNnn2z7f9vm2z7d9vu3zbZ9v+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/7fNvn2z7f9vm2z7d9fuzzY58f+/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+PfX7s82OfH/v8PHx+ngWSeh/6fZj3Yb0P+304r8PD4J+HeB/yfXhf+byvfN5XPu8rn/eVz/vK53Xlj3t3+RQ+pU/yqXxqn8an5dP2yRphjbBGWCOsEdYIa4Q1whphjbBGWiOtkdZIa6Q10hppjbRGWiOtIWvIGrKGrCFryBqyhqwha8gaZY2yRlmjrFHWKGuUNcoaZY2yRlujrdHWaGu0NdoabY22RlujrTHWGGuMNcYaY42xxlhjrDHWGGssayxrLGssayxrLGssayxrLGssa2xrbGtsa2xrbGtsa2xrbGtsa2xrHGscaxxrHGscaxxrHGscaxxr2Odhn4d9HvZ52Odhn4d9HvZ52Odhn4d9HvZ52Odhn4d9HvZ52Odhn4d9HvZ52Odhn4d9HvZ52Odhn4d9HvZ52Odhn4d9HvZ52Odhn4d9HvZ52Odhn4d9HvZ52Odhn4d9HvZ52Odhn39W354lv3Lv7+nzZ9+v3Pz7fP3Ox/HzBfzzGByTozgWx+b4fPl76n++jn8eN8fj4+dL+ecxOCZHcSyOzRG1QW1QG9QWagu1hdpCbaG2UFuoLdQWagu1jdpGbaO2UduobdQ2ahu1jdpG7aB2UDuoHdQOage1g9pB7aB2rPaqzH0eg2NyFMfi2ByH4+K4OaIWqAVqgVqgFqgFaoFaoBaoBWqJWqKWqCVqiVqilqglaolaoibUhJpQE2pCTagJNaEm1IRaoVaoFWqFWqFWqBVqhVqhVqg1ao1ao9aoNWqNGlmSZEmSJUmWJFmSZEmSJUmWJFmSZEmSJUmWJFmSZEmSJUmWJFmSZEmSJUmWJFmSZEmSJUmWJFmSZEmSJUmWJFmSZEmSJUmWJFmSZEmSJUmWJFmSZEmSJUmWJFmSZEmSJUmWiCwRWSKyRGSJyBKRJSJLRJaILBFZIrJEZInIEpElIktElogsEVkiskRkicgSkSUiS0SWiCwRWSKyRGSJyBKRJSJLRJaILBFZIrJEZInIEpElIktElogsEVkiskRkicgSkSUiS0SWiCwRWSKyRGSJyBKRJSJLRJaILBFZIrJEZInIEpElIktElogsEVkiskRkicgSkSUiS0SWiCwRWSKyRGSJyBKRJSJLRJaILBFZIrJEZInIEpElIktElogsEVkiskRkicgSkSUiS0SWiCwRWSKyRGRJkSVFlhRZUmRJkSVFlhRZUmRJkSVFlhRZUmRJkSVFlhRZUmRJkSVFlhRZUmRJkSVFlhRZUmRJkSVFlhRZUmRJkSVFlhRZUmRJkSVFlhRZUmRJkSVFlhRZUmRJkSVFlhRZUmRJkSVFlhRZUmRJkSVFlhRZUmRJkSVFlhRZUmRJkSVFlhRZUmRJkSVFlhRZUmRJkSVFlhRZUmRJkSVFlhRZUmRJkSVFlhRZUmRJkSVFlhRZUmRJkSVFlhRZUmRJkSVFlhRZUmRJkSVFlhRZUmRJkSVFlhRZUmRJkSVFlhRZUmRJkyVNljRZ0mRJkyVNljRZ0mRJkyVNljRZ0mRJkyVNljRZ0mRJkyVNljRZ0mRJkyVNljRZ0mRJkyVNljRZ0mRJkyVNljRZ0mRJkyVNljRZ0mRJkyVNljRZ0mRJkyVNljRZ0mRJkyVNljRZ0mRJkyVNljRZ0mRJkyVNljRZ0mRJkyVNljRZ0mRJkyVNljRZ0mRJkyVNljRZ0mRJkyVNljRZ0mRJkyVNljRZ0mRJkyVNljRZ0mRJkyVNljRZ0mRJkyVNljRZ0mRJkyVNljRZ0mRJkyVNljRZ0mRJkyVNljRZ0mTJkCVDlgxZMmTJkCVDlgxZMmTJkCVDlgxZMmTJkCVDlgxZMmTJkCVDlgxZMmTJkCVDlgxZMmTJkCVDlgxZMmTJkCVDlgxZMmTJkCVDlgxZMmTJkCVDlgxZMmTJkCVDlgxZMmTJkCVDlgxZMmTJkCVDlgxZMmTJkCVDlgxZMmTJkCVDlgxZMmTJkCVDlgxZ8mpA1vNYHJvj44fK63laPm2fHj+4frwT+1mC/Py75y9dPk/pk3wqn9onayxrLGs8f+nyPG1rbGtsa2xrbGtsa2xrbGtsa2xrHGscaxxrHGscaxxrHGscaxxrnLfGswT5OoVP6ZN8Kp/ap/Fp+bR9skZYI6wR1ghrhDXCGmGNsEZYI6xhiMAyRWAZI7DMEXiWIF8na6Q10hppjbSGrCFryBqyhvzsfbUgP49WeQIG9Dxtn8779GQMPP+7J2Tg85Q+yafyqX0an9aLS/CsQb5Oj0fyQBQ8y49P/sCz/Pg6yafyqX16lwyC9mNQfwz6j0EBMmhABhXIoAMZlCCDFmRQgwx6kEERMtaNPHBDD9zYAzf4wI0+cMMP3PgDdwABajcEAQwCSpFBKzKoRQa9yKAYGTQjg2pk0I0MypFBOzKoRwb9yKAgGTQkg4pk0JEMSpJBSzKoSQY9yaAoGTQlg6pk0JUMypJBWzKoSwZ9yaAwGTQmg8pk0JkMSpNBazKoTQa9yaA4GTQng+pk0J0MypNBezKoTwb9yaBAGTQogwpl0KEMSpRBizKoUQY9yqBIGTQpgypl0KUMypRBmzKoUwZ9yqBQGTQqg0pl0KkMSpVBqzKoVQa9yqBYGTQrg2pl0K0MypVBuzKoVwb9yqBgGTQsg4pl0LEMSpZByzKoWQY9y6BoGTQtg6pl0LUMypZB2zKoWwZ9y6BwGTQug8pl0LkMSpdB6zKoXca+8UxuQJMb0eSGNLkxTW5QkxvV5IY1uXNNUCNLqGAGHcyghBm0MIMaZtDDDIqYQRMzqGIGXcygjBm0MYM6ZtDHDAqZQSMzqGQGncyglBm0MoNaZtDLDIqZQTMzqGYG3cygnBm0M4N6ZtDPDAqaQUMzqGgGHc2gpBm0NIOaZtDTDIqaQVMzqGoGXc2grBm0NYO6ZtDXDAqbQWMzqGwGnc2gtBm0NoPaZtDbDIqbQXMzqG4G3c2gvBm0N4P6ZtDfDAqcQYMzqHAGHc6gxBm0OIMaZ9DjDIqcQZMzqHIGXc6gzBm0OYM6Z9DnDAqdQaMzqHQGnc6g1Bm0OoNaZ9DrDIqdQbMzqHYG3c6g3Bm0O4N6Zxyy5JAlhyw5ZMkhSw5Zcm6UpBsm6cZJuoGSbqSkGyrpxkq6wZJutKQ7LumtltcNmHQjJt2QSTdm0g2adKMm3bBJN27SDZwEOekCnXTBTrqAJ13Qky7wSRf8pAuA0gVB6QKhdMFQuoAoXVCULjBKFxylC5DSBUnpAqV0wVK6gCld0JQucEoXPKULoNIFUekCqXTBVLqAKl1QlS6wShdcpQuw0gVZ6QKtdMFWuoArXdCVLvBKF3ylC8DSBWHpArF0wVi6gCxdUJYuMEsXnKUL0NIFaekCtXTBWrqALV3Qli5wSxe8pQvg0gVx6QK5dMFcuoAuXVCXLrBLF9ylC/DSBXnpAr10wV66gC9d0Jcu8EsX/KULANMFgekCwXTBYLqAMF1QmC4wTBccpgsQ0wWJ6QLFdMFiuoAxXdCYLnBMFzymCyDTBZHpAsl0kSVBlgRZEmRJkCVBlgRZEmRJkCVBlsSNwnbHsKF2A7HdSGw3FNuNxXaDsd1obDccG1kSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJWAZEy5jAmZMyIwJmjFhMyZwxoTOmOAZEz5jAmhMCI0JojFhNCaQxoTSmGAaE05jAmpMSI0JqjFhNSawxoTWmOAaE15jAmxMiI0JsjFhNibQxoTamGAbE25jAm5MyI0JujFhNybwxoTemOAbE35jAnBMCI4JwjFhOCYQx4TimGAc88ZxvIEcbyTHG8rxxnK8wRxvNMcbzvHGc7wBHW9ExxvS8cZ0vEEdb1THG9bxxnW8gR1vZMcb2vHOdrzBHe90R9RufMcb4PFGeLwhHm+MxxvkkSy5YR5vnMcb6PFGeryhHm+sxxvs8UZ7vOEeb7zHG/DxRny8IR9vzMcb9PFGfbxhH2/cxxv48UZ+vKEfb+zHG/zxRn+84R9v/McbAPJGgLwhIG8MyBsE8kaBvGEgbxzIGwjyRoK8oSBvLMgbDPJGg7zhIG88yBsQ8kaEvCEhb0zIGxTyRoW8YSFvXMgbGPJGhryhIW9syBsc8kaHvOEhb3zIGyDyRoi8ISJvjMgbJPJGibxhIm+cyBso8kaKvKEiYUUmsMiEFpngIhNeZAKMTIiRCTIyYUYm0MiEGplgIxNuZAKOTMiRCToyYUcm8MiEHpngIxN+ZAKQTAiSCUIyYUgmEMmEIplgJBOOZAKSTN2IsTdk7I0Ze4fGonbDxt64sTdw7I0ce0PHkiVAJROqZIKVTLiSCVgyIUsmaMmELZnAJRO6ZIKXTPiSCWAyIUwmiMmEMZlAJhPKZIKZTDiTCWgyIU0mqMmENZnAJhPaZIKbTHiTCXAyIU4myMmEOZlAJxPqZIKdTLiTCXgyIU8m6MmEPZnAJxP6ZIKfTPiTCYAyIVAmCMqEQZlAKBMKZYKhTDiUCYgyIVEmKMqERZnAKBMaZYKjTHiUCZAyIVImSMqESZlAKRMqZYKlTLiUCZgyIVMmaMqETZnAKRM6ZYKnTPiUCaAyIVQmiMqEUZlAKhNKZYKpTDiVCagyIVUmqMqEVZnAKhNaZYKrTHiVCbAyIVYmyMqEWZlAKxNqZYKtzLpxqG8g6huJ+oaivrOoUbvRqG846huP+gakJktAWCYMywRimVAsE4xlwrFMQJYJyTJBWSYsywRmmdAsE5xlwrNMgJYJ0TJBWiZMywRqmVAtE6xlwrVMwJYJ2TJBWyZsywRumdAtE7xlwrdMAJcJ4TJBXCaMywRymVAuE8xlwrlMQJcJ6TJBXSasywR2mdAuE9xlwrtMgJcJ8TJBXibMywR6mVAvE+xlwr1MwJcJ+TJBXybsywR+mdAvE/xlwr9MAJgJATNBYCYMzASCmVAwEwxmwsFMQJgJCTNBYSYszASGmdAwExxmwsNMgJgJETNBYiZMzASKmVAxEyxmwsVMwJgJGTNBYyZszASOmdAxEzxmwsdMAJkJITNBZCaMzASSmX2j29/w9je+/Q1wfyPc3xH3qN0g9zfK/Q1zT5YAzEyImQkyM2FmJtDMhJqZYDMTbmYCzkzImQk6M2FnJvDMhJ6Z4DMTfmYC0EwImglCM2FoJhDNhKKZYDQTjmb2+w392e839Ge/39Cf/X5Df/b7Df3Z7zf0Z7/f0J/9fkN/9vsN/dnvN/RnH2scaxxrHGsca7zf0J/zfkN/zvsN/TnvN/TnvN/Qn/N+Q3/O+w39Oe839Oe839Cf835Df85ljbBGWCOsEdYIa4Q1whphjbBGWCOtkdZIa6Q10hppjbRGWiOtkdaQNWQNWUPWkDVkDVlD1pA1ZI2yRlmjrFHWKGuUNcoaZY2yRlmjrdHWaGu0NdoabY22RlujrdHWGGuMNcYaY42xxlhjrDHWGGuMNZY1ljWWNZY1ljWWNZY1ljWWNZY1tjW2NbY1tjXs87HPxz4f+3zs87HPxz4f+3zs87HPxz4f+3zs87HPxz4f+3zZ58s+X/b5ss+Xfb7s82WfL/t82efLPl/2+bLPl32+7PNlny/7fNnnyz5f9vmyz5d9vuzzZZ8v+3zZ58s+X/b5ss+Xfb7s82WfL/t82efLPl/2+bLPl32+7PNlny/7fNnnyz5f9vmyz5d9vuzzZZ8/G6QPhEc+G6Sv00NjHqenzz9Pz5epfB6TozgWx+Y4HBfHd3U8l6vjuVwdz+XqeC5Xx3P5bSi5/DaUXH4bSi6/DSWX34aSa1Ab1BZqC7WF2kJtobZQW6gt1BZqC7WN2kZto7ZR26ht1DZqG7WN2kbtoHZQO6gd1A5qB7WD2kHtoOa3oeT221By+20ouf02lNx+G0puvw0lt9+GkttvQ8ntt6Hk9ttQcl+oBWqBWqAWqAVqgVqgFqgFaoFaopaoJWqJWqKWqCVqiVqilqgJNaEm1ISaUBNqQk2oCTWhVqgVaoVaoVaoFWqFWqFWqBVqjVqj1qg1ao1ao9aoNWpkySZLNlmyyZJNlmyyZJMlmyzZZMkmSzZZssmSTZZssmSTJZss2WTJJks2WbLJkk2WbLJkkyWbLNlkySZLNlmyyZJNlmyyZJMlmyzZZMkmSzZZssmSTZZssmSTJZss2WTJJksOWXLIkkOWHLLkkCWHLDlkySFLDllyyJJDlhyy5JAlhyw5ZMkhSw5ZcsiSQ5YcsuSQJYcsOWTJIUsOWXLIkkOWHLLkkCWHLDlkySFLDllyyJJDlhyy5JAlhyw5ZMkhSw5ZcsiSQ5YcsuSQJYcsOWTJIUsOWXLIkkOWHLLkkCWHLDlkySFLDllyyJJDlhyy5JAlhyw5ZMkhSw5ZcsiSQ5YcsuSQJYcsOWTJIUsOWXLIkkOWHLLkkCWHLDlkySFLDllyyJJDlhyy5JAlhyw5ZMkhSw5ZcsiSQ5YcsuSQJYcsOWTJIUsOWXLIkkOWHGeJLmeJLmeJLmeJLmeJLmeJLmeJLmeJLmeJLmeJrgu1QC1QC9QCtUAtUAvUArVALVBL1BK1RC1RS9QStUQtUUvUEjWhJtSEmlATakJNqAk1oSbUCrVCrVAr1Aq1Qq1QK9QKtUKtUWvUGrVGrVFr1Bq1Rq1Ra9QGtUFtUBvUBrVBbVAb1Aa1QW2htlBbqC3UFmoLtYXaQm2htlDbqG3UNmobtY3aRm2jtlHbqG3UDmoHtYPaQe2gdlA7qB3UDmpkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkCZhTgTkVmFOBORWYU4E5FZhTgTkVmFOBORWYU4E5FZhTgTkVmFOBORWYU4E5FZhTgTkVmFOBORWYU4E5FZhTgTkVmFOBORWYU4E5FZhTgTkVmFOBORWYU4E5FZhTgTkVmFOBORWYU4E5FZhTgTkVmFOBORWYU4E5FZhTgTkVmFOBORWYU4E5FZhTgTkVmFOBORWYU4E5FZhTgTkVmFOBORWYU4E5FZhTgTkVmFOBORWYU4E5FZhTgTkVmFOBORWYU4E5FZhTgTkVmFOBORWYU4E5FZhTgTkVmFOBORWYU4E5FZhTgTkVmFOBORWYU4E5FZhTgTkVmFOBORWYU4E5FZhTgTkVmFOBORWYU4E5FZhTgTkVmFOBORWYU4E5FZhTgTkVmFOBORWYU4E5FZhTgTkVmFOBORWYU4E5FZhTgTkVmFOBORWYU4E5FZhTgTkVmFOBORWYU4E5FZhTgTkVmFOBORWYU4E5FZhTgTkVmFOBORWYU4E5FZhTgTkVmFOBORWYU4E5FZhTgTkVmFOBORWYU4E5FZhTgTkVmFO9CqX1PCZHcXz8kmM9T+3T+PT4Jcd+nrb/7rxPb+CH9AZ+SG/gh/QGfuhZI32drCFrPH9Z83myhqxR1ihrlDXKGmWNskZZo6xR1ihrtDXaGm2NtkZbo63R1mhrtDXaGmONscZYY6wx1hhrjDXGGmONscayxrLGssayxrLGssayxrLGssayxrbGtsa2xrbGtsa2xrbGtsa2xrbGscaxxuHZe3j2Hqs8YmA/n/KPFHidlk/7E/yiZw/0eXrWQF+n8Cl9kk/lU3+iYvQsgL5Oj0cSz9Pj/p/H6fnL2M9T+JQ+yad3HUbUPUXdU9Q9Rd1T1D1F3VPUPUXdU9Q9Rd1T1D1F3VPUPUXdU9Q9Rd1T1D1F3VPUPUXdU9Q9Rd1T1D1F3VPUPUXdU9Q9Rd1T1D1F3VPUPUXdU9Q9Rd1T1D1F3VPUPUXdU9Q9Rd1T1D1F3VPUPUXdU9Q9Rd1T1D1F3VPUPUXdU9Q9Rd1T1D1F3VPUPUXdU9Q9Rd1T1D1F3VPUPUXdU9Q9Rd1T1D1F3VPUPUXdU9Q9Rd1T1D1F3VPUPUXdU9Q9Rd1T1D1F3VPUPUXdU9Q9Rd1T1D1F3VPUPUXdU9Q9Rd1T1D1F3VPUPUXdU9Q9Rd1T1D1F3VPUPUXdU9Q9Rd1T1D1F3VPUPUXdU9Q9Rd1T1D1F3VPUPUXdU9Q9Rd1T1D1F3VPUPUXdU9Q9Rd1T1D1F3VPUPUXdU9Q9Rd1T1D1F3VPUPUXdU9Q9Rd1T1D1F3VPUPUXdU9Q9Rd1T1D1F3VPUPUXdU9Q9Rd1T1D1F3VPUPUXdU9Q9Rd1T1D1F3VPUPUXdU9Q9Rd1T1D1F3VPUPUXdU9Q9Rd1T1D1F3VPUPUXdU9Q9Rd1T1D1F3VPUPcVuuhhOF8vpYjpdbKeL8XSxni7m08V+uhhQFwvqYkJdbKiLEXWxoi5m1MWOuhhSF0vqYkpdbKmLMXWxpi7m1MWeuhhUF4vqYlJdbKqLUXWxqi5m1cWuuhhWF8vqYlpdbKuLcXWxri7m1cW+uhhYFwvrYmJdbKyLkXWxsi5m1sXOuhhaF0vrYmpdbK2LsXWxti7m1sXeuhhcF4vrYnJdbK6L0XWxui5m18XuuhheF8vrYnpdbK+L8XWxvi7m18X+uhhgFwvsYoJdbLCLEXaxwi5m2MUOuxhiF0vsYopdbLGLMXaxxi7m2MUeuxhkF4vsYpJdbLKLUXaxyi5m2cUuuxhmF8vsYppdbLOLcXaxzi7m2cU+uxhoFwvtYqJdbLSLkXax0i5m2sVOuxhqF0vtYqpdbLWLsXax1i7m2sVeuxhsF4vtYrJdbLaL0Xax2i5m28VuuxhuF8vtYrpdbLeL8Xax3i7m28V+uxhwFwvuYsJdbLiLEXex4i5m3MWOuxhyF0vuYspdbLmLMXex5i7m3MWeuxh0F4vuYtJdbLqLUXex6i5m3cWuuxh2F8vuYtpdbLuLcXex7i7m3cW+uxh4FwvvYuJdYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmVGBOBeZUYE4F5lRgTgXmtMCcFpjTAnNaYE4LzGmBOS0wpwXmtMCcFpjTAnNaYE4LzGmBOS0wpwXmtMCcFpjTAnNaYE4LzGmBOS0wpwXmtMCcFpjTAnNaYE4LzGmBOS0wpwXmtMCcFpjTAnNaYE4LzGmBOS0wpwXmtMCcFpjTAnNaYE4LzGmBOS0wpwXmtMCcFpjTAnNaYE4LzGmBOS0wpwXmtMCcFpjTAnNaYE4LzGmBOS0wpwXmtMCcFpjTAnNaYE4LzGmBOS0wpwXmtMCcFpjTAnNaYE4LzGmBOS0wpwXmtMCcFpjTAnNaYE4LzGmBOS0wpwXmtMCcFpjTAnNaYE4LzGmBOS0wpwXmtMCcFpjTAnNaYE4/fkF7cQyOyVEci2NzHI6L4+aIGlkC5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY0wJzWmBOC8xpgTktMKcF5rTAnBaY08o3CKDyDQKofIMAKt8ggMo3CKDyDfyofAM/Kt/Aj8o38KPyDfyobGu0NdoabY22RlujrdHWGGuMNcYaY42xxlhjrDHWGGuMNZY1ljWWNZY1ljWWNZY1ljWWNZY1tjW2NbY1tjW2NbY1tjW2NbY1tjWONY41jjWONY41jjWONY41jjXewI/SG/hRegM/Sm/gR+kN/Ci9gR+lN/Cj9AZ+lN7Aj9Ib+FG6rBHWCGuENcIaYY2wRlgjrBHWCGukNdIaaY20RlojrZHWSGukNdIasoasIWvIGrKGrCFryBqyhqxR1ihr2Oeyz2Wfyz6XfS77XPa57HPZ57LPZZ/LPpd9Lvtc9rnsc9nnss9ln8s+l30u+1z2uexz2eeyz2Wfyz6XfS77XPa57HPZ57LPZZ/LPpd9Lvtc9rnsc9nnss9ln8s+l30u+1z2uexz2eeyz2Wfyz6XfS77XPa57HPZ57LPyz4v+7zs87LPyz5/NkgfqJh6Nkhfp4fGPE/bp+fLVD6Ony/4n8fgmBzFsTg2x3d1vFi1L1bti1X7YtW+WLUvVu2LVfti1b5YtS9W7YtV+2LVvli1L1bti1X7YtW+WLUvVu2LVfti1b5YtS9W7YtV+2LVvli1L1bti1X7YtW+WLUvVu2LVfti1b5YtS9W7YtV+2LVvli1L1bti1X7YtW+WLUvVu2LVfti1b5YtS9W7YtV+2LVvli1L1bti1X7YtW+WLUvVu2LVfti1b5YtS9W7YtV+2LVvli1L1bti1X7YtW+WLUvVu2LVfti1b5YtS9W7YtV+2LVvli1L1bti1X7YtW+WLUvVu2LVfti1b5YtS9W7YtV+2LVvli1L1bti1X7YtW+WLUvVu2LVfti1b5YtS9W7YtV+2LVvli1L1bti1X7YtW+WLUvVu2LVfti1b5YtS9W7YtV+2LVvli1L1bti1X7YtW+WLUvVu2LVfti1b5YtS9W7YtV+2LVvli1L1bti1X7YtW+WLUvVu2LVfti1b5YtS9W7YtV+2LVvli1L1bti1X7YtW+WLUvVu2LVfti1b5YtS9W7YtV+2LVvli1L1bti1X7YtW+WLUvVu2LVfti1b5YtS9W7YtV+2LVvli1L1bti1X7YtW+WLUvVu2LVfti1b5YtS9W7YtV+2LVvli1L1bti1X7YtW+WLUvVu2LVfti1b5YtS9W7YtV+2LVvli1L1bti1X7YtW+WLUvVu2LVfti1b5YtS9W7YtV+2LVvli1L1bti1X7YtW+WLUvVu2LVfti1b5YtS9W7YtV+2LVvli1L1bti1X7YtW+WLUvVu2LVfti1b5YtS9W7YtV+2LVvli1L1bti1X7YtW+WLUvVu2LVfti1b5YtS9W7YtV+2LVvli1L1bti1X7YtW+WLUvVu2LVfti1b5YtS9W7YtV+2LVvli1L1bti1X7YtW+WLUvVu1ryJIhS4YsGbJkyJIhS4YsGbJkyJIhS4YsGbJkyJIhS4YsGbJkyJIhS4YsGbJkyJIhS4YsGbJkyJIhS4YsGbJkyJIhS4YsGbJkyJIhS4YsGbJkyJJFliyyZJEliyxZZMkiSxZZssiSRZYssmSRJYssWWTJIksWWbLIkkWWLLJkkSWLLFlkySJLFlmyyJJFliyyZJEliyxZZMkiSxZZssiSRZYssmSRJYssWWTJIksWWbLIkkWWLLJkkSWLLFlkySJLFlmyyJJFliyyZJEliyxZZMkiSxZZssiSRZYssgTMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJwWmNMCc1pgTgvMaYE5LTCnBea0wJzWq1D6+OXEq1D6eQyOj19yrOdJPpVPj19y7Odp/HfLp+3TeZ/ewI86b+BHPWukr5M1jjWev6z5PFnjWONY47w0+lkffZ3Cp/RJPpVP7dP4tHzaPlkjrBHWCGuENcIaYY2wRlgjrBHWSGukNdIaaY20RlojrZHWSGukNWQNWUPWkDVkDVlD1pA1ZA1Zo6xR1ihrlDXKGmWNskZZo6xR1uj3s7dfZdDPo1UeMfAAxPSzCvo6tU/zCX7pZw/0ddo+nffp4f/XKXxKn/SJiulnAfR1ejySeJ4e9/88T9un8z49fxn7eQqf3nWYpu7Z1D2bumdT92zqnk3ds6l7NnXPpu7Z1D2bumdT92zqnk3ds6l7NnXPpu7Z1D2bumdT92zqnk3ds6l7NnXPpu7Z1D2buufHrz0ujsExOYpjcWyOw3Fx3BxRC9QCtUAtUAvUArVALVAL1AK1RC1RS9QStUQtUUvUErVELVETakJNqAk1oSbUhJpQE2pCrVAr1Aq1Qq1QK9QKtUKtUCvUGrVGrVFr1Bq1Rq1Ra9QatUZtUBvUBrVBbVAb1Aa1QW1QG9QWags1soS6Z1P3bOqeTd2zqXs2dc+m7tnUPZu6Z1P3bOqeTd2zqXs2dc+m7tnUPZu6Z1P3bOqeTd2zqXs2dc+m7tnUPZu6Z1P3bOqeTd2zqXs2dc+m7tnUPZu6Z1P3bOqeTd2zqXs2dc+m7tnUPZu6Z1P3bOqeTd2zqXs2dc+m7tnUPZu6Z1P3bOqeTd2zqXs2dc+m7tnUPZu6Z1P3bOqeTd2zqXs2dc+m7tnUPZu6Z1P3bOqeTd2zqXs2q/bNqn2zat+s2jer9s2qfbNq36zaN6v2zap9s2rfrNo3q/bNqn2zat+s2jer9s2qfbNq36zaN6v2zap9s2rfrNo3q/bNqn2zat+s2jer9s2qfbNq36zaN6v2zap9s2rfrNo3q/bNqn2zat+s2jer9s2qfbNq36zaN6v2zap9s2rfrNo3q/bNqn2zat+s2jer9s2qfbNq36zaN6v2zap9s2rfrNo3q/bNqn2zat+s2jer9s2qfbNq36zaN6v2zap9s2rfrNo3q/bNqn2zat+s2jer9s2qfbNq36zaN6v2zap9s2rfrNo3q/bNqn2zat+s2jer9s2qfbNq36zaN6v2zap9s2rfrNo3q/bNqn2zat+s2jer9s2qfbNq36zaN6v2zap9s2rfrNo3q/bNqn2zat+s2jer9s2qfbNq36zaN6v2zap9s2rfrNo3q/bNqn2zat+s2jer9s2qfbNq36zaN6v2zap9s2rfrNo3q/bNqn2zat+s2jer9s2qfbNq36zaN6v2zap9s2rfrNo3q/bNqn2zat+s2jer9s2qfbNq36zaN6v2zap9s2rfrNo3q/bNqn2zat+s2jer9s2qfbNq36zaN6v2zap9s2rfrNo3q/bNqn2zat+s2jeY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKcN5rTBnDaY0wZz2mBOG8xpgzltMKd93iCAPm8QQJ83CKDPGwTQ5w0C6PMGfvR5Az/6vIEffd7Ajz5v4EefsEZYI6wR1ghrhDXCGmGNsEZYI62R1khrpDXSGmmNtEZaI62R1pA1ZA1ZQ9aQNWQNWUPWkDVkjbJGWaOsUdYoa5Q1yhpljbJGWaOt0dZoa7Q12hptjbZGW6Ot0dYYa4w1xhpjjbHGWGOsMdYYa4w1ljWWNZY1ljWWNZY1ljWWNZY1ljW2NbY1tjW2NbY1tjW2NbY1tjW2NY41jjWONY41jjWONY41jjWONd7Aj7nePp/r7fO53j6f6+3zud4+n+vt87nePp/r7fO53j6f67JGWCOsEdYIa4Q1whphjbBGWCOskdZIa6Q10hppjbRGWiOtkdZIa8gasoasIWvIGrKGrCFryBqyRlmjrFHWKGuUNcoaZY2yRlmjrNHWaGu0NdoabY22RlujrdHWaGuMNcYaY42nz+t5Kp8eGvM8jU/Pl6l8HjfH4+PnC/7nMTgmR3F8V8eHVfth1X5YtR9W7YdV+2HVfli1H1bth1X7YdV+WLUfVu2HVfth1X5YtR9W7YdV+2HVfli1H1bth1X7YdV+WLUfVu2HVfuPnzJeHINjchTH4tgch+PiuDmiFqgFaoFaoBaoBWqBWqAWqAVqiVqilqglaolaopaoJWqJWqIm1ISaUBNqQk2oCTWhJtSEWqFWqBVqhVqhVqgVaoVaoVaoNWqNWqPWqDVqjVqj1qg1ao3aoDaoDWqD2qA2qA1qg9qgNqgt1BZqC7WFGlnCqv2waj+s2g+r9sOq/bBqP6zaD6v2w6r9sGo/rNoPq/bDqv2waj+s2g+r9sOq/bBqP6zaD6v2w6r9sGo/rNoPq/bDqv2waj+s2g+r9sOq/bBqP6zaD6v2w6r9sGo/rNoPq/bDqv2waj+s2g+r9sOq/bBqP6zaD6v2w6r9sGo/rNoPq/bDqv2waj+s2g+r9sOq/bBqP6zaD6v2w6r9sGo/rNoPq/bDqv2waj+s2g+r9sOq/bBqP6zaD6v2w6r9sGo/rNoPq/bDqv2waj+s2g+r9sOq/bBqP6zaD6v2w6r9sGo/rNoPq/bDqv2waj+s2g+r9sOq/bBqP6zaD6v2w6r9sGo/rNoPq/bDqv2waj+s2g+r9sOq/bBqP6zaD6v2w6r9sGo/rNoPq/bDqv2waj+s2g+r9sOq/bBqP6zaD6v2w6r9sGo/rNoPq/bDqv2waj+s2g+r9sOq/bBqP6zaD6v2w6r9sGo/rNoPq/bDqv2waj+s2g+r9sOq/bBqP6zaD6v2w6r9sGo/rNoPq/bDqv2waj8iS0SWiCwRWSKyRGSJyBKRJSJLRJaILBFZIrJEZInIEpElIktElogsEVkiskRkicgSkSUiS0SWiCwRWSKyRGSJyBKRJSJLRJaILBFZIrJEZInIEpElIktElogsEVkiskRkicgSkSUiS0SWiCwRWSKyRGSJyBKRJSJLRJaILBFZIrJEZInIEpElIktElogsEVkiskRkicgSkSUiS0SWiCwRWSKyRGSJyJIiS4osKbKkyJIiS4osKbKkyJIiS4osKbKkyJIiS4osKbKkyBIwpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6YE4HzOmAOR0wpwPmdMCcDpjTAXM6r0JpPY+b4/HxDfyYeQM/Zt7Aj3m2SR/QmJk38GPmDfyYeQM/Zt7Aj5k38GPmDfyYZ430dbJGW+P5y5rPkzXaGm2NtkZbo60x1hhrjDXGGmONscZYY6wx1hhrLGssayxrLGssayxrLGssayxrLGtsa2xrbGtsa2xrbGtsa2xrbGtsaxxrHGscaxxrHGscaxxrHGsca7zBPrPeYJ9Zb7DPrDfYZ9Yb7DPrDfaZ9Qb7zHqDfWa9wT7zKoPW8+hn7wqrPGMg4nlMjuL4sEr08/iwSnz+34bj4rg5Hh+fMfA6PtX28/hU23/58Yf/85s//e43//L73/7XD//wPx9//Pf//sO//vl3f/zD649//v/+8/0v//Kn3/3+97/7j3/+zz/98V9/+2///aff/vPv//ivj3/74Xr8z+NB/WPMjxn/9PEfx//9V/n4q49H9o9LP27904+f/3yuH08//ln+5/lxj/9ZP579+OfiguvHzMdftf8q48ecx1+N/6rix3r+1frpPfnLX/7pL/8/",
|
|
1898
1898
|
"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="
|
|
1899
1899
|
},
|
|
1900
1900
|
{
|
|
@@ -1917,8 +1917,8 @@
|
|
|
1917
1917
|
}
|
|
1918
1918
|
}
|
|
1919
1919
|
},
|
|
1920
|
-
"bytecode": "H4sIAAAAAAAA/9WWPW/
|
|
1921
|
-
"debug_symbols": "
|
|
1920
|
+
"bytecode": "H4sIAAAAAAAA/9WWPW/UQBCGfVz4DAmfx0dOQmkQHVKOKKIFm0gXgSIlORoKazkvx0rrtVnvoZiKLRGNfSGiJxcTKaSjo4W/gBSU30BHQ8VavnN8jiaWCQ3u7Mfzzjve0YyrvfD97rRpolcCt03GTcIE5gxRzzQ9n7VNTyCBtVBu3+eEUtLREaXvtCBYC4Kv09rhVyVQV9gr1t/TbshN3WGeWJORQThui2PyY1O92sF8o3WnUZwqH18pFf/ayMdr5fIbsh9/mXA81dlawhQJ8hKXrEQ7qFAtq/Ap9mIhgXTH9dOSjKynjHjifOLIzo1/4Ly/LBw37AFOc2ekb84TTK1C2cloCYsuZ4NKa3J73uGYdFh8u757K2nOrqAm8jzMhe7Yrsr4lOJFjtoUP8bcIw5TvSx3HmHb4f49y+LY81IjoYyWie1SnDgaTfBlX7+DRUsQSoSvKhF4VexpV/OamdIhUgXJGEiOg+QESE6C5BRIToPkDEjGQXIWJBMgmQTJOZCcB8kFkFwEySWQXAZJDSRXQAL3zrW4sUZ78j+7G5kcha/MzZbS7LdmGncPf1rsNAgODrzrqdiH1szfzPqpUgIVtZcJQ9xXMYvu+r5MPXrwoqu2rBLJmsukiRa6ttt8lhm19dpgQNbzg3as1BhfNXKuBirVrYeqR1eeI5Yc6XDRpklSS8OAKbnTZFYyYsHtPjcLG/rx7df3zwsNW/ZXOIr3Sho//M0YroYjJrr5+/bbjTdPfhYm+gOoiatecQkAAA==",
|
|
1921
|
+
"debug_symbols": "jZLdroMgDMffhWsuKCKIr7IsC3NsISFomJ7kxPjupzjx48Ll3PCnlP7aQkfysPfhdXPh2b5JfRnJPTrv3evm28b0rg14OhKWFhCkLiiBktQSRZJaoaiPVB/Rs3C8r6aJkgy59dHaxNhRMVdnog09qcPgPSU/xg/zpXdnwqy9iehllNjwQEXg03mbdhPdotl5KEBRLtEAulgBAPKAgHOEZjm/FnwDaHEA8C81MNC5BqbEKeJLG5Wscg2sPG1CnAMElwtACLUCFD/El+fxRZkfoVDVVoCS/+2AFwwWAm7liijxK69omcbFw8hNiRWduXu7mM8hNDtv/9tlTx7ZLraNfQzRJtJubnG9cKBcXnFCIRmKcn2dUuo/"
|
|
1922
1922
|
},
|
|
1923
1923
|
{
|
|
1924
1924
|
"name": "verify_private_authwit",
|
|
@@ -3718,8 +3718,8 @@
|
|
|
3718
3718
|
}
|
|
3719
3719
|
}
|
|
3720
3720
|
},
|
|
3721
|
-
"bytecode": "H4sIAAAAAAAA/+
|
|
3722
|
-
"debug_symbols": "
|
|
3721
|
+
"bytecode": "H4sIAAAAAAAA/+2cd3xURfv2c19DR1DpKGgEBFRAir1SAopKEcSOMYQFVkISNxuKldgbkgQQEKR3RLH3jn0usSuIBXvv2Mt7aKlgzgLX8/p5fg//EHZnvvf0OWcmfF1hweRVbVJT086LR9JTM2Op0cx4JJaZlpGTmjoyEosOGZOaHYuOTItHUtNy48NGReN0S9e42XnLu2akpQ/vmjW6R25mere0jIy8+f269D6me2HewlOi8cxITg6SQyRyFiLRrmFIdTuHSNTAjw2RqmGoVE3ClKppmER7hEm0Z5hEyaFKvleoVM1CpWoeKlWL5LylXWPRjIzo0PXfT0zKz5+Qn78iOemf/1jeki45OZFY/PRILGtCfkHhiuT2g3vH1naYtc+9fbvfnZd36sDWnT49dsx92QXd1q6b8G2Qhe66f8a+1vaD4duCHVdhaZO2BXv9VrEowpZv3zv7ZuVEooOzMjv2jcRG5MbT4tGszMKJRe0dtELRz3uX+HRciZ+vn0g3ni6froCusHTZCwsr7psWoeo3IUQnVzx+Ak5y4iWsG6qEEysA2YljQ5VwYufSY9wK8hb0j2YOzYhsHAsVlTZMWyVtYI7IzojQTQo3g8IUfZKVLroTF/2GxCd/wYRQxQjY4Qo8ueKhsW3xJ+cnuFCEI08KyBNCjedJoVJNDpVqyjb0UogSbqpLiFqH68tQdZkq6ZegxyeFW+lv3JYNpKICuBDDuNTURmHe/C6xWNqYggrn4DGrmVO8DgSJm12ybN7s91dfee3ar5cnvXLDzJkDTmvfY/T4ek3fu+/sQa0/WBxyT/+PrpLTdtwqOW1bVqSpQceHGx/TQ4yP7VylpyfUdDepVunpATtcgWdIVukg/oz8RFu7UmFRa4db5Tb3fMXl+edC24aylJyHFSUuLO7DmcU/ztpxM2FmuGSzkrdhc1jfbOE2hwq2w8JvN6SaGWryzQrRBYkPtBnrw4eKH66UsyXTcVoADrdEzVFtoVPCxZ+7DfErpoav/zxJ+4ffIuZvx6KVH24ghpt6c3Ur1oLiHxfuuBVrQbhkC8u8ZU7ckW0WarlaECriQslyFUyEBeHeMaaFShWuLosk7xib6xKi1qFShavL4gQXqMJQ/TInGDyhEs4NlqhwK8kSSUGDlXxOqITzgrUsXEGXJvrWVBiqO8O9JE/bluAVYZNCFLClIrCFCNxKERghArdWvB3vk+DrQ6jBs2+ooTNeUZ/9ViTXWjvrhaN7PzmnTeYpVcYue+yhq94Z36hT57UXtrQjOo17o8mpifdOpRCB2yiGReUQgdsqAlcJEbidInDVEIH3VwSuFiJwe0Xg6iECd1AErhEicEdF4JohAndSBN4pROADFIFrhQh8oCJw7RCBD1IE3jlE4IMVgXcJEfgQReBdQwQ+VBG4TojAhykC1w0R+HBF4HohAh+hCFw/ROAjFYEbhAh8lCJwwxCBj1YEbhQicGdF4MYhAndRBN4tROCuisC7hwjcTRG4SYjAKYrATUME7q4IvEeIwD0UgfcMEfgYReDkEIGPVQTeK0TgnorAzUIEPk4RuHmIwMcrXrpPUEB7KY61eu+Q33dK2pbeaRGieH0Ude4b7oR+G447Q1CDw+tQCRcHB65hRsWJkmLOT6CYS8MUs59iRvRXQE9SQAcooCcroKcooKcqoKcpoKcroGcooGcqoAMV0LMU0FQF9GwFNE0BHaSApiuggxXQiAI6RAEdqoAOU0CjCug5CuhwBTRDAR2hgGYqoFkKaLYCeq4CGlNAcxTQuAKaq4COVEBHKaCjFdAxCuh5Cuj5CugFCuiFCuhFCujFCqgfK6HmSaiXSKiXSqiXSaiXS6hXSKhXSqhXSahXS6jXSKjXSqjXSajjJNTrJVTJL8v5fAm1QEItlFAnSKgTJdRJEuoNEupkCXWKhDpVQpX8Z1Y/TUKdLqHeJKHOkFBnSqizJNTZEuocCXWuhDpPQp0voS6QUBdKqIsk1MUS6hIJdamEerOEukxCvUVCvVVCXS6h3iah3i6h3iGh3imh3iWh3i2h3iOh3iuh3ieh3i+hPiChPiihPiShPiyhPiKhPiqhPiahPi6hPiGhrpBQn5RQn5JQn5ZQn5FQn5VQn5NQn5dQvYRKCfUFCXWlhPqihPqShPqyhPqKhPqqhPqahPq6hPqGhPqmhLpKQl0tob4loa6RUN+WUN+RUN+VUN+TUNdKqO9LqB9IqB9KqB9JqB9LqJ9IqJ9KqJ9JqJ9LqF9IqF9KqF9JqF9LqN9IqN9KqN9JqN9LqD9IqD9KqOsk1J8k1J8l1F8k1F8l1N8k1N8l1D8k1D8l1L8k1L8VVFqSBmsaLDRYp8FW0mAra7BVNNiqGmw1Dba6BltDg62pwe6kwdbSYGtrsDtrsLtosLtqsHU02LoabD0Ntr4G20CDbajBNtJgG2uwu2mwu2uwTTTYphrsHhrsnhpssga7lwbbTINtrsG20GD31mBbarCtNNjWGuw+Guy+Gux+GmwbDbatBttOg91fg22vwXbQYDtqsJ002AM02AM12IM02IM12EM02EM12MM02MM12CM02CM12KM02KM12M4abBcNtqsG202DTdFgu2uwPTTYYzTYYzXYnhrscRrs8RrsCRpsLw22twbbR4Ptq8GeqMH202D7a7AnabADNNiTNdhTNNhTNdjTNNjTNdgzNNgzNdiBGuxZGmyqBnu2BpumwQ7SYNM12MEabESDHaLBDtVgh2mwUQ32HA12uAabocGO0GAzNdgsDTZbgz1Xg41psDkabFyDzdVgR2qwozTY0RrsGA32PA32fA32Ag32Qg32Ig32Yg12rAabp8FeosFeqsFepsFersFeocFeqcFepcFercFeo8Feq8Fep8GO02Cv12DHa7D5GmyBBluowU7QYCdqsJM02Bs02Mka7BQNdqoGe6MGO02Dna7B3qTBztBgZ2qwszTY2RrsHA12rgY7T4Odr8Eu0GAXarCLNNjFGuwSDXapBnuzBrtMg71Fg71Vg12uwd6mwd6uwd6hwd6pwd6lwd6twd6jwd6rwd6nwd6vwT6gwT6owT6kwT6swT6iwT6qwT6mwT6uwT6hwa7QYJ/UYJ/SYJ/WYJ/RYJ/VYJ/TYJ/XYL0GSw32BQ12pQb7ogb7kgb7sgb7igb7qgb7mgb7ugb7hgb7pga7SoNdrcG+pcGu0WDf1mDf0WDf1WDf02DXarDva7AfaLAfarAfabAfa7CfaLCfarCfabCfa7BfaLBfarBfabBfa7DfaLDfarDfabDfa7A/aLA/arDrNNifNNifNdhfNNhfNdjfNNjfNdg/NNg/Ndi/NFiN/xYa/y00/lto/LfQ+G+h8d9C47+Fxn8Ljf8WGv8tNP5baPy30PhvofHfQuO/hcZ/C43/Fhr/LTT+W9TRYDX+W2j8t9D4b6Hx30Ljv4XGfwuN/xYa/y00/lto/LfQ+G+h8d9C47+Fxn8Ljf8WGv8tNP5baPy30PhvofHfQuO/hcZ/C43/Fhr/LTT+W2j8t9D4b6Hx30Ljv4XGfwuN/xYdNViN/xYa/y00/lto/LfQ+G+h8d9C47+Fxn8Ljf8WGv8tNP5baPy30PhvofHfQuO/hcZ/C43/Fhr/LTT+W2j8t9D4b6Hx30Ljv4XGfwuN/xYa/y00/lto/LfQ+G+h8d9C479FPw1W47+Fxn8Ljf8WGv8tNP5baPy30PhvofHfQuO/hcZ/C43/Fhr/LTT+W2j8t9D4b6Hx30Ljv4XGfwuN/xYa/y00/lto/LfQ+G+h8d9C47+Fxn8Ljf8WGv8tNP5baPy30PhvEdNgNf5baPy30PhvofHfQuO/hcZ/C43/Fhr/LTT+W2j8t9D4b6Hx30Ljv4XGfwuN/xYa/y00/lto/LfQ+G+h8d9C47+Fxn8Ljf8WGv8tNP5baPy30PhvofHfQuO/hcZ/C43/FoUarMZ/C43/Fhr/LTT+W2j8t9D4b6Hx30Ljv4XGfwuN/xYa/y00/lto/LfQ+G+h8d9C47+Fxn8Ljf8WGv8tNP5baPy30PhvofHfQuO/hcZ/C43/Fhr/LTT+W2j8t9D4b6Hx3+J2DVbjv4XGfwuN/xYa/y00/lto/LfQ+G+h8d9C47+Fxn8Ljf8WGv8tNP5baPy30PhvofHfQuO/hcZ/C43/Fhr/LTT+W2j8t9D4b6Hx30Ljv4XGfwuN/xYa/y00/lto/LfQ+G/xsgar8d9C47+Fxn8Ljf8WGv8tNP5baPy30PhvofHfQuO/hcZ/C43/Fhr/LTT+W2j8t9D4b6Hx30Ljv4XGfwuN/xYa/y00/lto/LfQ+G+h8d9C47+Fxn8Ljf8WGv8tNP5baPy3+F6D1fhvofHfQuO/hcZ/C43/Fhr/LTT+W2j8t9D4b6Hx30Ljv4XGfwuN/9Zp/LdO4791Gv+t0/hvncZ/6zT+W6fx3zqN/9Zp/LdO4791Gv+t0/hvncZ/6zT+W6fx3zqN/9Zp/LdO4791dTRYjf/Wafy3TuO/dRr/rdP4b53Gf+s0/lun8d86jf/Wafy3TuO/dRr/rdP4b53Gf+s0/lun8d86jf/Wafy3TuO/dRr/rdP4b53Gf+s0/lun8d86jf/Wafy3TuO/dRr/rdP4b53Gf+s0/lvXUYPV+G+dxn/rNP5bp/HfOo3/1mn8t07jv3Ua/63T+G+dxn/rNP5bp/HfOo3/1mn8t07jv3Ua/63T+G+dxn/rNP5bp/HfOo3/1mn8t07jv3Ua/63T+G+dxn/rNP5bp/HfOo3/1mn8t07jv3X9NFiN/9Zp/LdO4791Gv+t0/hvncZ/6zT+W6fx3zqN/9Zp/LdO4791Gv+t0/hvncZ/6zT+W6fx3zqN/9Zp/LdO4791Gv+t0/hvncZ/6zT+W6fx3zqN/9Zp/LdO4791Gv+t0/hvncZ/6zT+WxfTYDX+W6fx3zqN/9Zp/LdO4791Gv+t0/hvncZ/6zT+W6fx3zqN/9Zp/LdO4791Gv+t0/hvncZ/6zT+W6fx3zqN/9Zp/LdO4791Gv+t0/hvncZ/60L5b3tFRmTFxvTMjMYn2Bo3pGWr1vvsu1+btu32b9+hY6cDDjzo4EMOPezwI4486ujOXbp2S+ne45hjex53/Am9evfpe2K//icNOPmUU087/YwzB56VenbaoPTBkSFDh0XPGZ4xIjMr+9xYTjx35KjRY847/4ILL7rYj/V5/hJ/qb/MX+6v8Ff6q/zV/hp/rb/Oj/PX+/E+3xf4Qj/BT/ST/A1+sp/ip/ob/TQ/3d/kZ/iZfpaf7ef4uX6en+8X+IV+kV/sl/il/ma/zN/ib/XL/W3+dn+Hv9Pf5e/29/h7/X3+fv+Af9A/5B/2j/hH/WP+cf+EX+Gf9E/5p/0z/ln/nH/ee0//gl/pX/Qv+Zf9K/5V/5p/3b/h3/Sr/Gr/ll/j3/bv+Hf9e36tf99/4D/0H/mP/Sf+U/+Z/9x/4b/0X/mv/Tf+W/+d/97/4H/06/xP/mf/i//V/+Z/93/4P/1f/m9aEs1ooDlaJVplWhVaVVo1WnVaDVpN2k60WrTatJ1pu9B2pdWh1aXVo9WnNaA1pDWiNabtRtud1oTWlLYHbU9aMm0vWjNac1oL2t60lrRWtNa0fWj70vajtaG1pbWj7U9rT+tA60jrRDuAdiDtINrBtENoh9IOox1OO4J2JO0o2tG0zrQutK60brQUWndaD9oxtGNpPWnH0Y6nnUDrRetN60PrSzuR1o/Wn3YSbQDtZNoptFNpp9FOp51BO5M2kHYWLZV2Ni2NNoiWThtMi9CG0IbShtGitHNow2kZtBG0TFoWLZt2Li1Gy6HFabm0kbRRtNG0MbTzaOfTLqBdSLuIdjFtLC2PdgntUtpltMtpV9CupF1Fu5p2De1a2nW0cbTraeNp+bQCWiFtAm0ibRLtBtpk2hTaVNqNtGm06bSbaDNoM2mzaLNpc2hzafNo82kLaAtpi2iLaUtoS2k305bRbqHdSltOu412O+0O2p20u2h30+6h3Uu7j3Y/7QHag7SHaA/THqE9SnuM9jjtCdoK2pO0p2hP056hPUt7jvY8zdNIe4G2kvYi7SXay7RXaK/SXqO9TnuD9iZtFW017S3aGtrbtHdo79Leo62lvU/7gPYh7SPax7RPaJ/SPqN9TvuC9iXtK9rXtG9o39K+o31P+4H2I20d7Sfaz7RfaL/SfqP9TvuD9iftL9rfRBJhBAhHVCIqE1WIqkQ1ojpRg6hJ7ETUImoTOxO7ELsSdYi6RD2iPtGAaEg0IhoTuxG7E02IpsQexJ5EMrEX0YxoTrQg9iZaEq2I1sQ+xL7EfkQboi3RjtifaE90IDoSnYgDiAOJg4iDiUOIQ4nDiMOJI4gjiaOIo4nORBeiK9GNSCG6Ez2IY4hjiZ7EccTxxAlEL6I30YfoS5xI9CP6EycRA4iTiVOIU4nTiNOJM4gziYHEWUQqcTaRRgwi0onBRIQYQgwlhhFR4hxiOJFBjCAyiSwimziXiBE5RJzIJUYSo4jRxBjiPOJ84gLiQuIi4mJiLJFHXEJcSlxGXE5cQVxJXEVcTVxDXEtcR4wjrifGE/lEAVFITCAmEpOIG4jJxBRiKnEjMY2YTtxEzCBmErOI2cQcYi4xj5hPLCAWEouIxcQSYilxM7GMuIW4lVhO3EbcTtxB3EncRdxN3EPcS9xH3E88QDxIPEQ8TDxCPEo8RjxOPEGsIJ4kniKeJp4hniWeI54nPEHiBWIl8SLxEvEy8QrxKvEa8TrxBvEmsYpYTbxFrCHeJt4h3iXeI9YS7xMfEB8SHxEfE58QnxKfEZ8TXxBfEl8RXxPfEN8S3xHfEz8QPxLriJ+In4lfiF+J34jfiT+IP4m/iL/pkuiCXRl0jq4SXWW6KnRV6arRVaerQVeTbie6WnS16Xam24VuV7o6dHXp6tHVp2tA15CuEV1jut3odqdrQteUbg+6PemS6faia0bXnK4F3d50Lela0bWm24duX7r96NrQtaVrR7c/XXu6DnQd6TrRHUB3IN1BdAfTHUJ3KN1hdIfTHUF3JN1RdEfTdabrQteVrhtdCl334FI/uIAPLsuDi+3gEjq4MA4ud4OL2ODSNLjgDC4jg4vD4JIvuJALLs+Ci67gUiq4QAoue4KLmeASJbjwCC4ngouE4NA/OKAPDtODg+/gkDo4UA4Of4OD2uBQNTgADQ4rg4PF4BAwOLALDteCg7Dg0Co4YAoOg4KDm+CQJTgQCQ4vgoOG4FAgeIEPXraDF+PgJTZ44QxeDoMXueClK3hBCl5mgheP4CUheKAPHr6DB+XgoTZ4AA0eFoMHu+AhLHhgWtIvEs+NZaakxdPWJLVMMrhKlatUrVa9Rs2datXeeZdd69StV79Bw0aNd9u9SdM99kzeq1nzFnvn508szJvXJT0aq1+48sWqX/z4/FND8/M3fdSw/EfJhSvfbFy/eZMz33xq80eHFq5cWv/RgSnN/z5zTVJ63pLuo7NjkZycaFbmhPyKjfh9E80wLNEMaYlmyEk0QyTRDMmJZkj/97VSZqIZhv77mnWwvEhxeYT0f1+RBss7Lks+WhMu0pBEM+TK66AfGtH/go4bJa90XL56J1zp7P9tu/+KbVe/3A9PNEM7ebP2lK+tyf++KRqVz4fk/4IiJTwfRstXvv+TT2Rt5D2dKx98+v2heaIZzpDvohnyDAk/wiX8gJX6v6cZRSv97xAhTIaBiWZImlS4qnXahvvN1PSsEdlp8eigjEhqViwtPfhrZCS2HpQ6KpaWnR2JrUlqkDe/W1ZmTnxC3oKUaCySHkfewp6Z8cjQSGzugE4dK74aLZvfEso/NqVs/qTE4qfkzeuWlpFRULOIs6hfJCOo9MhIgjVJKk9wiRJuXl+WwcGJZ7es7DFFVUopWaYS8I0lr7XdJU/ZASWf1z+elV1QuJWSlumjbvN7RCMZFf9Oce0FG8+AN9V0l7ylPbJikejQzPX/nLSqVdp58Uh6am48I3XjgO1WNF77bBiuJ28crfn5BXnLNt6tdxk8eP1cKCpIQd6C/tER2RmRjSXaHK9MeSsl1BqjU/KWdo1mpq2/yY/3yZ60meIWnRCEPmlYWuZ6SvF4LQqy4LjcEdk9hxQWZaift6xn5uCNJd3qJDnoH/6v9+on171+53EdR+TNOymYsAWFxfk3z9ZNNS5c1T6ak5oTHRxJjQwZEnwRzP3cIEIsNRYJ5nypNaBo7jf+/zz3e2zn3O+xaVzV3u7xb+UJlXb43Hcl4UHJS1Q8pfiHklHz5vbKGllqThYl21jznTel2PRx95JJt7dNum93m1j5VaVkG5ReHOpueXHIjo1Mjeb0DwZ29w3jutvGYd2vaFSXWxqKYxUtDkXFnjOgw9bTo3z6LXdCcYQds9702FHrTaP/4HrTKicedFdqNDM1MjqSnhtf/1SRnpY+rPwy0+6/ZJlptN0TYguTsvIOX2YqlYQLHi0qJ9p7ZeZPpeJuLMeukmh7bnHi2NxgbpecM1YyQtkpsu2rW+ngxSGKwpevM0ov2K5kx5T6plLJIpf6pnLJrtg4Mhv/wxpVqex3rni32Ji7xXaPkh7qB9DN6+wWu7tq2e52xU1VquWqFSco9Xn14kbfYoAaC7qfm5uWkVMyRhGrarlluEbzvHknZKUNLvqgSnGm+f3Xr5rlI1fZcuRqZatWrXggbTFD9bIZqhdnmLe+nAVNSm+7rbc2iiuVH8UoEbzkXv1I8Va9YVPomdl985bQbf2OsP7XNRYfG0nL7hKLpY0puRTY1jfvwrz5G5OXecQ3xRP/DtuB2/7nduDlG8MEbRVswuufhqaWbYT627nP1tsxe1NScXmKwGWfCEK+UCblLdvYTxuS98meWNTwm6ZouZgo30fVyj1PhIxuW4ueNDclOrJcTxWvaUXV3twQhfeX7LwNTZx6bm5WPBrJjE8pW7wa2/qQsSl/zR3cjTWKwVtpDyzZFLBEsyQVt89WctncXrkZJfqtwuT9cwdtgV5qaS8xDsp0Rs2i6vw/wWJoWJVzAQA=",
|
|
3722
|
+
"debug_symbols": "rZfbbqMwEIbfhWsuPAef8ipVVNGUVpFQEtGk0qrKu+8YjIFKtrJkb/LHgD/sGc+P/VO9t2+3z9fj6eP8Ve1efqq3/th1x8/X7nxorsfzSa7+VCr8AFc7utcVDA1T7VAaGBpkqx3UFTmRu1yc+r5e+7YNDyxg8opL07ena7U73bqurr6b7jY89HVpToNem17uqrpqT++iAvw4dm34d6/n3irfVRuInY0yqTtY+ygAvcNIIEWwQOhHEaDARwQoyzPC86MIa/U0D+uUnxGwRnAe4dUURs+4ZQyIXkcCEqvsGEwBAcZNCESbEA5XBFuYBTiepoE4p4P0ekm4PMJJx4hw3vgswucRxDStCecSAA2sAFAIJhk9BZOMoW0Mj2kY3kCegXkG25RUdrRYF+4fhuHmYfj8MEpLi+yUEmQ02aUFulRlpE0qM4lNokiOH4doQwliwOcgJctRaXVoJS6RnYwruQ5RKjbPSmUnU4Qw2wTRDrZBjDcJYg1uiIiszikirCDvHCUPNT7lxerZQ6WOVohQETmGwRQOg2auW4b11wALLmoY0geFkfIMXVrtkxOjxgXBPRoMMwfD2IUJ/o4nFowUtTPzMJzXubyie9rP0T9v6KSed3SCZy2d8HlLL2fFc6p7oxZbll9ZIS6VW6o23rTn0ZhyognydkzmPzhYGcLsZoi32yAa3MIGN4/kIS8tQ573Uo3z14XAbfFSy2lTbNn9suO9NJvDsV/v+kHL6+phqw/yerBRXVQ/Kqrg1KIQFcO6E6WoHHacojpqODrIWNBGdVH92J/U2CaIisFoRCkUt2g4hwiXdFQTyrceTiGDuqh+VFahOkQhKkalqBy+UKJ69D02UW1UN46LffDrutIqKkTFqDQ+pzmqjhp5WnjDJvy76Y/NW9eGIIc83E6HKebSvP65THems9ilPx/a91vfhvwsDmTy+yJvQNinY9lwydfI+3Q4kyvyYSK9r8fbMlfW+3vI+l8=",
|
|
3723
3723
|
"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="
|
|
3724
3724
|
},
|
|
3725
3725
|
{
|
|
@@ -3889,6 +3889,10 @@
|
|
|
3889
3889
|
}
|
|
3890
3890
|
]
|
|
3891
3891
|
},
|
|
3892
|
+
"5421095327929394772": {
|
|
3893
|
+
"error_kind": "string",
|
|
3894
|
+
"string": "attempt to bit-shift with overflow"
|
|
3895
|
+
},
|
|
3892
3896
|
"9530675838293881722": {
|
|
3893
3897
|
"error_kind": "string",
|
|
3894
3898
|
"string": "Writer did not write all data"
|
|
@@ -3970,8 +3974,8 @@
|
|
|
3970
3974
|
}
|
|
3971
3975
|
}
|
|
3972
3976
|
},
|
|
3973
|
-
"bytecode": "H4sIAAAAAAAA/+19e3hdV3Wn7rkPnXOfunrYkmXJtmT5IT/lJNLV00/5kfgtJ8ROKCOwSDw4tiNbIYHOgEkptB+0fgWmwzeFJrEJlBBI0hZahmkhDG3JnTK0Ay2E+YC2H88y6aTQli9TRrZ1z13n7L3WOfvcdWxtdP1Hvhudc3577/Xea6+9d/TC+fc/c2ry5BsmTp9+3QPT/xm/b2Ls/Nnf3TJ57PjxY/dtHT9+/FLN+89e3jw5Of7IBy+eO3/hhcU19L9IjecrNf6AIlxABhdQlAsoxgUU5wJKcAHVcgGZXEAWF1CSCyjFBZTmAspwAWW9gc5eGTt24r7jE/4Ac9yAdT4Arxu8l2o2+YPMc1GvnguogQuokQuoiQtoHhfQfC6gZi6gFi6gBVxArVxAC7mA2riA2rmAFnEBLeYCWsIF1MEF1MkFtJQLqIsLaBkX0HIuoBVcQCu5gLq5gFZxAa3mAlrDBbSWC2gdF9B6LqAeLqANXEC3cAHdygV0GxdQLxdQHxdQgQuonwtogAtokAtoiAtomAtohAtoIxfQJi6gzVxAW7iAtnIBbeMCGuUC2s4FtIMLaCcX0C4uoNu5gO7gAtrNBbSHC2gvF9A+LqD93kBqqakD3IAHuQHHvAHPXTx3zhvopZpD04n5aCyeqDWtZCqdyebq8vUNjU3z5je3LGhd2Na+aPGSjs6lXcuWr1jZvWr1mrXr1vdsuOXW23r7Cv0Dg0PDIxs3bd6yddvo9h07d91+x+49e/ftP3Bw7Ny56WG4VzReanr32ctbT544febi2Svbjk1OvOGMcfbDu06cmbhvYvKJO2/xjioj7u8jSt+//Vn39zVq7T979smrazHnu22cpw5OHB8/c+yhCVMN6ZCIYKkh1Jz92NW+HB0/M7715KlH7CH9EuwTAJ/uORj4A+UfsFXXWy8+A3453hN6r8aJml+qePy5s0/sOfnQBThaWygE7KQadt300tuxE+OTj0x/tO/UYzbwE5uPHr02fLsl0MLTu04cvfbXCkUj4mq83ITdvDhmY4YaM/8bhYxxPInBLjuexF3SMi3n2900jsCmXc+Mski5nkRLT06InImpEedkxXKzKUS52fwLJDcxTrmJEXITBzbG9ShhP/qE+1Gt/eiTM40eqNgoPSsiGKpG+cmxMydPnZerjOF2P1svbz82cfzoNOz33vOBt+WeufChxauKP0ns+M0fve6VXfHC14u/3PL5d7z6/Zcvuj/cZn/4lSOvfvP53MW3PPzeT7+1sKJh/GMXv/aPP/jilz6ee+XbTz/4tdvcH45W6HC3qxpS1/c7wPe9PpI27u93qn0v9H+X2vcCx25X+T4i9v8O+/vH7/TOxyTcn+8u8b15w/L+U//py40vrej4xqY//tjaSy3/tHTopU/t/J2Xf/Zn/yKh2x5bYEb+IHrk/k/+7GRqx6PPvPnrf7N3KrNw/HOL3n35yBfOL/r+637V/eFeBYZ/d+Lzp9zf71P4/qcdax5wf7/f7jhK4+v/3B8eUJPUqPv7g6qa7/p+TO17QdIOqX0fc39/pwfhSv/i7g/vAh9GHu04/X7rvZE9n3vHmufTyc99f/MHt2wtfulXfn1R7mMfdH/4mtKH3UPWy5d//T++s+ZbH/7hb/y0+zOb1uTbN+fX/tUHvtp6YvKelpfdH96tNtSF7u8PA6XqUefUEZ+UEj68R6ldwRbd67Nd4cPX+vxwy5WDE2emJk/Io5Jad1QSLXt0h4M3yy84/m6VYwNpA8krow9OjR8/Dduwsab99+1TD5za9UYbLrn/7JO7T44ftf+QKH90edqrTk6ILSfkLZvuoYF4R/qB5f7AKn/w5NV+nt9VouX1YKPYcOzs726f7tOx+05c/cNjn5o6c+z4sTOP7Jg4c+f1X9M8OzPx8JmXauaffXrPxAMnJx+ZbmNyeioM4yXsSRJ9kkKfpNEnGfRJFn2SQ5/UoU/y6JN69EkD+qQRfdKEPpmHPsG50Iw+aUGfLECftKJPFqJP2tAn7eiTRVcFazpp9MCp4xPX7YFu/+fMKHi90nurEuaTd/ZsKNB/9e7puXMlk2STfTGM7JEJ12JxwrW4bE9Ktkw2Q1iMQj61e5r7h+4fPwGt1EHH7LtkT8sfHbat1UkMeInY10h5skCMfonwcIkP0kiaW+KPNEvcM8AlxLy9QzWXpDxv78Dn7UuY5u0dNK3czXaqNZvFmu0Um+2E43axYSl8hkB2fbwkvSAikKEvlUhx15tEuVhqx25Yk0vFUSx1+/Q3usfSUWa0X4HAZbcDsu1yhUKSrZjfeL704Aw5JjFaWk7j85Qkv7xEwjir2PCaGegpwViYPsTGemJs6vXOJo2ybcKyXTJZsz8i7WXyLba9RGlhILRYAqM6rGszAfH0bEEyosOyHr1N5HtKOSV1aHL8akpKNGIpKuHlJ0FR4xaqJGGU1ToeeU7dKKdwo5xkMsop0a4kCaOcVhvzs1izabHZNBy3iw0Z+AyBzJJGOQ3BRMHMvvhe0eJloBghrWbEgWTcdvnFd7vHk+I0zCkxlS2T38obSgIL6zJ/aWgJVXiOt2bC1yoVxBoRIaOmQYtEhKyqMgirTy6P9eIHMNrlEDMdgWZaFOtcsWFRCfu3BaZZUIbcDx1S5X6Y9OMdaMviZrcFX8MgvWYNKZnPefGK97RBYgYtfNqQ9GGOUrZzLEg/nF6p2nvSadHL3171qE9fx702cdt36hLs656p49I5zGL8o4zzoxT8SPRsPhNyeby93NVYBzHglapiBxrnCv4bxOI5MdIvrULIbWON2zbWwB6XRGrKmUQE79SIVh/0i+CUg3K2q7gX/6QOZW6GEKMZAQUw5VmIXznK2el5iealXvxCyfh8puK4LxjTM+qsTdmsfcI/a03YOmbmD5eo8T9uEjVys4ka95SpgUpb3iltJvwpkLBeKdSXVCw1KAHcLwI0KgFMiABNSgASyz1PCeANIsB8JYDjIkCzEsC4CNCiBHBMBFigBPCACNCqBHBUBFioBPA6EaBNCeC0CNCuBPAglXH0AzBJpXP8AJwRAZYqAbxVBOhSApDUci1TAvgPIsByJQBJLdgKJYA3igArlQAeFgG6fYaCklzBKqW2pyQBRKQY+dWSl/ge7iUiQiST88ynrpblriJU7mr1iz+yfeE/oF5NkidarebaR9TzRKvxPFGEKU+0mlhXMdzUWAO7Jsz01kCXjTS3RmxuDTF5XAOdODtkIz9kkxYDb+GH7OKH7NSCPUurHJ/NHF+mhRC18kMu18JetmnBni4t2KOHvWzVQi4XaMHxLi0UMgS57OCHbNZi4HqErJ1axER6cFyPkHXlXI3cWqoxUTUmmoWWqEkLuWznh1ylBXs6wggN0ERqu5BIzZd/ZiQ50fZi5NGKE56bxfQhnkxdG/oO5rXu7qyFPUMTrWt97qRcuX7wxW/nfuvPMcauFRm7tsxY5KN1ZHZWIOJ6NSIOo5uq16Gbqteim6rX25uqhX6tU+2XCg1BK4J6gKfdwRhDQZr8kLlgkKXSWZldWI0WKR52PwGFItdXZ4pGQmVFRLHep0ddiTPhr4hkVFZEVsOuCYwFT+sVFmBWE7ICIBv4IRv5IZv4IefxQ87nh2zmh2zhh1yghRC18kMu5Ids44ds54fs4Ifs1MJsLNXCBIeg411acHyZFkLUooXZaNJCiJbPVUvUqYUl0iMYrDrdWc2eEHR8hRYDXzlXY6KVYYQG+L4VKrWZk6Q2M0UjStVV+0oe3CrmAfCsyBpVbOWsyBqyUBPNmKzxmdpc2/f1dV/8S/PfB8tZ+09oUalNxRTiejS1uRZNba5BU5vr8NTmWtV+qdAQtEJl/ruDMYaCNPkhc8EghdSmw1Fjqc17xNQmGFs5uSnZ3FY0MvYLJrHnCzum4oi4yR17kiujlVpsJTb22btkS5/thuNzbTsFZvDatlOE+ClZvTz4Nhl4O2v+2n5He+igpzOHNwM2liFnjjdyvwJ3Lc+8gjacdG4ua4dNB9hqmac2TU5LrpQ0dcT2OHxT3WJfAuJ6J0+4HkW3llF3Pe24e8kzJeTbRfuQJzzFYrVm01iz0tOxcNPTDZ9hERB5lMViCCbZp1I0VogGtrusYUij3eI4uoF5nRErYT9nOyFWiiSOqYvVYlys2pnESsLfdnSdpxt2jZ0JNxSwUm5Kduh2K+0IG6UqC/wA3E3F2H4A9lNxnB+AvVSA6gdgfcWL95KzU3qUunBKBNigBPCICHCLEkCPCHCrEsAtIsBtalTMS3cnGjttu7hZOCQkAt0Qop0RenLj1s48fA076ecwcexEHl3JLx1BU4x+xHkQ7O+XD4Idu398cuLo2MQbJiemSYkd5NmLPulDnxQuKh2GOR1PXkKxatEnZoADZXOXKjgI9Grcq3A7g2JZxBLWsggzvLIIk4jCcmrNogeK5sRmc3DcLjb0w2cI5AAZheUgmGgcBorGXaICg2bRhEe/OJJ+MQ47INibDCS4f+ZkCHtjEhTMEIKsyNSouiDncEHOMAlyjqQVLk85ku1mMLbTkLiN8UtYnzJQqcla7HkEWtG4H2UIegbaDMaY9AS0+vM29Jvoc+sUTHVONXzglHAzPAmnTHVvZZdOlXHEZnvhuF1s6IPPEMgCaap7IZgoIoWi8Ygo930+THWfOJI+0VSfEaQu58MeSB2aLzXN/cK3h2W/IhULbVxdUXtxRc0xKWovSStcX3pJsTaDifUvAuQNcpg5H+7uEre7W29Dvz/QMa0SxUyXmhylzr3OKYhvujwIwnj0Cg97fQxA6l988YtsL8fU3k0dn39dsjl0gOpkH+qRCcRDAiJQzgIltOgA0kRzEpr0wteI9vqY2uvz2V4o43PZoDThLQuhh7UF3FummbxlgaaVu9l+prBWOoED43axYQA+QyAHybC2H4KJrmCwaPw3UTIGfIS1A+JIBsSw9g/dIypwetECIcESL/oCqjheXnS7hHTpYn27Df1FSmELBBEqlbQA2tWPa1eBSbskYl4gtGuASbukMgnG7WLDIHyGQA6R2jUAwUQRGSoa/0uU2kEf2jUojmRQ1K4vixkmRu3q9yfBHGpsq6q3En8TZX4QJR4o1ids6G9RStxPEihNjGp7MB/kX7X6PD8aIKNBQS1w6zQUunUawq3TIJN1GiaVy7Gw9fzMwtbmidM9Gwrbple1Hjl15sLZj+ycGD+1eXJy/BFAt2H8jsChC2cvX3/9vGT9p1AnvR3ukryZgtCMLWfS9/vr5H8fqLsUoFMen9BPCfUaZApqB+Fr/ty9bWKADMrcvfF/va+I6CVEa5QO6t1Var1Y0ItTauz+42hSE10U65VSY5SmRm/R+FdvavQR1BijZ4xuajgSVn6o0fv4vkm32AA0hflOn9oNLhfUbV5f+POdPrX5jlogGDmv4OIKBBv64bNAK64FRzAk8ffRZIgrrtG4mGhlDJQcGYJKbzs67x1sRdFIu+B91VBauoqSf8UGb6DuGhJEI8tJyCxsExkidgGgn0xMn6wQ2ioX34iU6StGF1acaqkhrr0riOyGzmeGJ+2q1PBguFXM/70NvoRiOHo1Z1ZUPMsz4O0jF0P8GyuTWMzHPcZA6B5jAPcY/UweY5A0eIGj5MHitOXB4uQBOk6++qlCpJylmuqVf9NXh0XdlwJ1jTVeNiErELaZ9Ho9WSIiCLLFVHiVfWLbsYfQ1ImFrzLtmXJFtH4styleoToA7QBm4q7IAgpwY6zMvEVvs8Pglyl+5Zn4lYev3aAVSqEg1OJsyCoTmLg80U8F77epEhw/AB8SAfJKACup2gI/AJ+iph9+AH6fCiL8AJwVAQaVAF5LZY38AKwQAYaVAL4nAowoAewUATYqAXxaBNikBHBeBNisBLBVBNiiBPATEWCrEsBFEWCbEsDLIsCoEoAkMtuh6tAEhF2Vla3aODtFu78DtuIyudvVTW65KTxY3M4ULEpGs52w+TvhoP1D7vQLKXBtJxPXdsjGCVpxcc3ZKaLL6/ip0MoPuZYfsoMfMssPeQs/ZI4fMs8P2csPuYYfspsfso8fsqAF5Gp+yEF+yCF+yFv5IYf5IUf4ITfwQ27kh+zhh9zED7lZC3e2hR9yKz/kNn5IQwtIcaHYKP9EE3+G2J7hL/Fn4JBU2k6y0yvr7yLYSI2PtafH1Wve4cAlVe/5x2zwywKJwQZoU3gIDvyx0D3V94Dd0cQ+7xTTPu8UfO0yfoC5n5nyQyKAoQRwnwhgKgFsp5LPfgBWS1ieLMaabaY862ZcjFjBiavNF1erT8rj+KQ8xjQpj4sCFUPXsxKwa4KwJSBfkeYSYnMJQn4B5HJ+yFX8kF38kK38kE38kC1a0DLCD9nMDzlfC/boIZcL+CEb+SHbtIAMQdQNLdgTglyu4Ifs0MLpLtCCPZ38kCu1GPhSfsh1/JDL+CGtuRpmGVpEbsu1sJd6RMGGyhVrhtpE01Cf5RrhX7FmkGkTFzXisGsCHcHTqEJzMc/K0ijZR0ct5Udnail3n7zv3LlLyFafO+RFisYq5P1R+fvRyCVZ4SFZlbjKX5nj9URgpJR9qWuTp2daKz4tiqp5zgh5OHjgNMaspMispL88XBKFlJYW1hGVbxml5NeuSkvnBiotndtTaencmAiwUglgc6W1dzsqrb3bVmnt3e7wisxr9s7KIvMBssgc3689QO78yyjUtA8Sqj3ow1UHh4zwQzbzQ87nh2zhh2zlh2zih1zAD9nID9mmBWQIom5owZ6sFqIego53zlUdX6WFQurBngYtLFFEC0vUpAUt9ZDL+VpwvLlqidggl/JD5vghu/kh81pAruSH7NWCPQu16OVqfsg1WgjRWn7IPi043qeFqOthguu1EPU+LXqpBy1DEPWCFqIegr1cpkV8uUKLpE4Ik5QQplIhpJfRec+A7OwocHGb7FCz2EvUqQ2+lmj2u1dbhoi1p2FVbOW1p2F3d4Zhz9B1qWGft5Bv+PHD5zcNrXwVY4LkiNBhz1X+EXIxizhSwhcR96C3kI+gt5APo7eQb8RvIR9R7ZcKDUErgnbYFL43GFtwwNFggMJ14UNQvWZLbYHXaaZ18tKL73if3yk58zBVJikx/n7h/E6w3ax057a4oo3tHvu56x9+ibb7MHxpB+QH4ce+bxPkFaH7A3CY0MRQAx3wulx84Nqt5nICCtRJlqiz9Kt/WPvPH/3N2LN//fLJN/+k++Kf73jvZ3936EJxzcjbx/72fT/eQ1DHeS+5Y1DEiAfpESfFESuQzyVEgz6USNHppuBr4Z11nVZ3cjfgrOshmlYVOvZUMNs/5GbDCHyGQG4kz311eBZRvTcW4xFRMkZKlDii4NJHgH+4XtwWe5WInfwKBS6/DqdTaZiXQk8+tnfexmtRrnofiSq7BmG4mH/UBk9SO29R5qfFI/3qPJ37epnE2B+R/nF9MZ6z3cEk1kAdQg8/h5Cvl4X5dVSYP92nxoqtFFUuiVK/zi5fnLbY0I1eh9jhlqn1FYg/ahHXh2cR13uG9kPSIOuADz4Pe4Vn6JcblaKvERjbY4heR72jfdlM9EU8yX0T+BBFlPZlzEdfthJ9Ee8h2wI+xBC3EYjiPWRbwYfUGXe+xDSO9Wm7rE+gFXevABclczrFc94SWK92kr3aLvQKHGm3s+JeoX5pl2KvwFkbuzDM20nMxQLmLvCpONLb1UaKbljaTfbqdqFXd4BPK+4VOgXdo9ir3eBTDHMviSnOvveAT8WR7lWqw5bU4+9TArhLBNivBLBPBDigBLBBEkDUFdMv2nEYepBUjHb2OwXKx6EjRUAlR1HEiZB3veM1YSCxYvKkPZBtAQeySwpcu8sGRk+mjALXJYW+PcSjRgJswtL2qJEkRS0/WvB6ESChBPAWEaBWCWBtpQfjrJNkgpQA3iwCpJQA3iRRlGgxMWYrymvcDI4S4q54oc0j6uKexsU9yiTukkupoqi4Z2DXBHHPQCeFNJcRm8sQ1hNANvJDztOily38kBEtBt7KD9mkhRCt4ods44fs5Idczg+5QAshWqCFQrZpAdnMD2lowZ4Q5DKphTsLwRI1aMGeEAa+gR+yZ65qT8tcjYmW8kOu44dcpgUt41rEl51a0LJLi5C1SQt31qwFe0Kwl/O1cGcdc9VDtmkx8HlaWKIQFHKFFkJkaOF0O7SwRCGYYGuuGjdjrsZEHVqwp0sLjtdqoT15LYybHomIEML/Ti0ge7SIL7P8kKYWkK1a+J55WghRCFY9hCl+QguzoUetQa0WAUyjFhxPamGJQoiCU1o4Cj0SZB1zVYjatBCiA9RdhjGsPcW7DGPwNf+QoOYO+cjjtH6ug/cjD6sdvG8EOHj/4aAH74dXnPmQ/sWZdbBrglyCp+jBTnVic3WEqNf5sM/BIdu0gGzmhzS0YE8TP2QnP+QGfsieucqeDD9knxYDX8oPuY4fcpkWtGzRwqrrMfCuuWrVG+aqCe6Yq5Fboxa0jGgx8Na5KurNWpjgORv+x/khV2nhzqph1qxWyOVzVYj0iDbmacFxQwtRD8FsJOZqTGTNVUehh6gv18Je6pE1CIHjtVpoT14L46ZH+N+gRZgVAmQICwohxOpZfkhTC8hWLXzPPC2EKASr3qxFyNqphVWfpwXHu7SgZQgcT87VKDilhaPQY42iY64KUZsWQnRrtUbRR43iVPg1ilNMNYpxokYxoVYm2KZeo5jAaxTjTDWKCZHncbRG0YJdE+QSPEVvMLXE5ixC1C0fNiU45HJ+yHn8kI38kG1aQLbwQ3bxQxr8kE38kD1aKGQIHI/wQzbzQ3ZqYTaatOhlRItedmkhRCFwfIEWvscQAnlwGvx6hWAqQbS3Hr4WKD7zP+71IQTyiYXI+wfl71s16oH8QpVAvka47w9wrd+J4H4TXB6RKF0eiItAikkEUvA14XYCfO5hqYX/v6o+97DwuUeCae5hkbRyUSMJuybQETxFNzooXnma9GGsg0NG+CGb+SHn80O28EO28kM28UP28EN2aMEePUS9kx+yUQu5bNSC441aWPVOLTi+QAv2tGkBGYIlMrRgT1YLUdcjJppfDWCqAUw1gKkGMNUAphrAVAMYbdmjh6iv0oKWeliiBi0UUg93pkf4r4dczteC481VS8QGuZQfcg0/5F5+yBDWe/bxQ67kh6znh+zmh1yoRS/3adHLtVoIUQgcz/FD5vkhe7WgZQhWvaCFvczMVYUMwRKtnquWaK8W7Mlr0cu9c9WP92kh6qYWJrhbC3fWp4WOL9SClnoE1su0yBqs0GIBNoTUUwgJshDKENvOXrm6M3HXG8HjjUXz98SC4IhaTe673eW1RqlDkmJjUxXbSYcSsE0FuyXQgqs7JuwZWogMO9Z7K96xV3bv/fS7vvHj72IMMkUGmWUGIR/R1csCEZNqRHznDEVmAKOgXeeTmEjFmSdx2PiTV6v9z2+vuJL8nUo0BK0IYm5T+N5gbMEBR4MBPnlocvzUeYdOAPUiNnajmwEUN3anHK8Jij9cNP9who/FhpM3vEMuDY0QBsNQk6mUusEgjEKEaXeCQdJK2KsBuibQ0bYLR7DGFLeNVAGrgLMMEI8n/Co33oxB2CH7hIqDpVMczG+g5u+p3ROnTx+6f/yEc4jAh94uMbyRYvK1Nvj/FgxvDHYUNSZjU693Npr2dFeJj5e6O/rg1Pjx05Bcow4gocuJovm3tq+YRBtA6HG7jxGZV6536vE7eyTycFjSJ7Nofq/i+KPGdtOiU7CoHXsxJpGPwdcUduwpBtHpIEF06Dv2TJJW+GkhpkhH8HREIcT2uX83zgbpZTGrgFXAGwoozJQZHa3pz7hV3pANNibYbMuHzVakXgy+5glp98zbCSYJDz3m6JvgDZNFq8H20D9FG0A89KCPEaVkHjpJeehU0Zpv9+lf0RmfHWlZLar9dkzhZERJbrTBFwqikSQ9iglflEicvzghyRQnJOFr/iEt7ySGTOZk2pOQxmDWMiB17kMQoP7PHILw9PVeXPuffacuwc7vmTousUP7BeoC1HamXE87fA23iEIUllILhOLqUVjKX7qykigsRdLKRY007JpAx7Sno5JcYpsmGKMD4A3zcUBcXQ2lOBtK+VMGjvDA9gCClDE2ky77KEGBM9fNEq0870t/bo/4aVZN/e5wj/GOUrdq3E92EyK1B/LJ9Wwvwbh9kB6uZ/sBPeT0rnHTuwbSoeQAXnUuGIB3agQjnvHhIhUvd3cUBngHG4fQZr2DDVkElikml9vgr6Hi0DQa5shCLIsKsabDvnslUs2XBMlUnGKZTYKvLNxWSbgbBxSE2xE1EVFnilIL0yPopOx2kgxnM4SNvCfQMVXU4uUoFcBZYpYHj7YU1zwN9WgriUdbFlO0lSTnmo7D1J61D1MbP7p1/NTpqePTLHMdkQboLT0kLRm5IDkHrQc7uvgiir8IOZxtG3b68kUntPz/XMewuYmevtmmxhJNzQzia9WNSdo2JhcJY4IfVLZbDPtAn4mz6pJeky/LOflyqLwbN4nphJ8euF9xWEpaFpJ2qPaVI69+8/ncxbc8/N5Pv7WwomH8Yxe/9o8/+OKXPp575dtPP/i1XnyY12Y60pGwhu4CB9mg0oR1VHT69erWMYNbxzSTdcyQky8XNbKkS8tC24U0lxWbyxIRJoCM80OOsEF6TXGrgFXAKuBcB6SmF2nZ9HrmywNCQA9KA9E1lrjYz7i/NZb4DW/PO3nwR2iz3skDWU1IvJjM2eCfFcIkuM6BnCZsQD4SNSVJ1Z6Db2+T9tx6wY5rn0bLTMslrDPPYqrhSqmNT6CXqsQVUrrep15LQxFAFUGEMpBf/ismY55LNAa5ROO4v0fkj1G0/sJ7YdDwFtvb5OBf8cH8eHjMNzyZHxNJbngyPy3jE6AKtQxgKvQk4sn8OMl8x31QUuX8pjfzI8E0P1K0vnVzNT/iyfw4QXJDYfEwTmo+SGhFFep/vTU/6lfzZavf0aL1Q2/mRxHmGzTzp8F/7IP5kfCYHw2i+d63lsVJzZdEDkA0ahXMvuHJ/BjJfIM2+7Gi9a+A+VSsFyWXUvCC9iseBglxGP9ms/QFBXJFkRzpczM50msjmEmSnjunkMa0n6SQ6+XydCJTnkjNKwzNqjAAsLwCgGSMqNGAcjQzJIWtGdHQU/LR8LdmRFW2ZsRIxfFXvE36JFbptpP0yFWIQWQb3m+oEj5VFnBHqFlgRniYpqZDfhafs4hfzNAGLltMzvfhF9Ph+cWsp1/MkSkD5CPJLaY5SBVBFeogp/w724ynNUyT1jADmxX5ky4mO3z6xSzpFwOFnKOibQWA5eSCW2CzfgRWLRHkOHtdWs2wGuwODF4qMSgHXweUxP+Akp5iKpVtwohkoDhXa3wqqvHxb9d9KUQGlOqQpbvuh45bsPx7qJSPoDdD2p4UZIBU7EdhJIaLYoypJCqGc11Fh2+XD+aOQDocC1eHFd15mrZU0+78gA93nqzQnadnmTtPk+48Q2ZAsqRTTSnUxfiyEknv3QOBkq6JYK4tUUyOe6uFKbM+XiyzyCMRIlThlkXVYBmoWJsVinUKF2vLU6w9CqV828ck5DqVtE+QO4UtYiIYAXuFsf3Eksmz4qXrS9Unz3F88hxjmjzHSQuPn2sQJ83EGqZtMwCygx9yOT/kPH7IRn7INi0gW/ghu/ghDX7IJn7IHn7IZi10vFMLuQyBlvO1kMsuLax6pxZWXQ+z0aGFQka00PE5K5cLtAhgDGrNYz1T5dt6+FqgIN//uNcj61wftXe63Hfu3CVkEesO+SJWvBN5/6D8/UTNJcmOmIKw2AUfdiL7VaTrYzVU+V1KoVghRnAtBV/DINGc1wzuIbSUTjJbVTz056L6bDWBz1bjTLPVBKkb+IlDCfJ4oIxCysbniUNd/JARfshmfsj5/JAt/JCt/JBN/JA9/JAdWrBHD1Hv5Ids1EIuQzBuy6vsYYNcoMXA27SADMFsGFqwJ6uFqOsRwMyfq9FGsxYBTKcWMZEeol6NNuZatFGdpFQnKbNRLqtRcDUKno201EPUV2lBy04t2NOghUJG5qqj0MPphjDw+VpwvLlqidggl/JDruGHXMkPuZcfsp4fMqMFLQv8kAv5IdfyQ+7XQoi6tWDPGi10PASF3KeFjs9ZuczxQ+b5IXvnqo4XtNCejBbuTA8dX63FwBdq4c66tTBu3VrQcp8WA+/TQtRNLUxwtxburE8LHV+oBS27tfDjy7RIPa3QYk03hPxlCFnWEKqX0ZRoRHankb2z4bD0XNF0VNx+YKjtAHgsxMuUH3ONtQRsE89uCbQgXKQGeubrir/eW/GO/cX+v3zDNz7xO+g9B/R1iP6FAe4jqvB2ngvoqROW80lMpOLMkzhs/PpJE9srvq7qghINQSuCdtgUvjcYW3DAQ8EAS7d8AckD6uXetOS4hBJTbrE9nzcLyk6qHC6mTXDm2M3v0MZiOjOrOrS5mK6fVR0aKqbn38QOKZxUqug/THUbb4R/Uil9dCh+QI2EjuApfgKx2By1JxFA7uCH3MkPuYsf8g5+yN38kHtwARuber0TMu3pdWLEteWHHECSY6rTPbb9mEQbQDaybocSjnwbV44/48V0b8XbX2uIOzUTIW67DXDC8k3fdhv80sMYssU77EsP94R56aFiwLrDLU07Sr0RDh3dCSnnerYLssb17PYSYoBLD60glx4mYJ/xmdMu4TRzYOM8b5yPOy89dMwziKsM4/Slh5IeuF9xXCZBy0LCvvRw5A+iR+7/5M9OpnY8+sybv/43e6cyC8c/t+jdl4984fyi77/uXfgwr80JpCOJEYfV+bUiWPDBeH+iRVhHxUlnTt063vQrYfE7P5NkdIxeJ5gSm0v5C7g38UNu4Yfcyg/ZzwY58+xIFbAKOCsAqWmCJKkF3Mc26t5zrmrwiCOSuMHtYTcO2fcApn8ZbRaZskTh7EWce1jF9PM2+NsqvAcwJjyMQkYG7/kSec/feQNuA8vd8COFJaqVhFShM1T+k162dAW8Bshx65bsGqD0OZZ7AJfIwS/6YL4VHvO97wGU3PLjfQ9gUsYnQBWB+UA0ahV64n0PYK3fewCjEv7UFtO/Td16QqcKHXeFeSzzKdmM6ZW+JwLdBmYgyQO+28BM5DawbJAbk7IKQ4tXaAbinmbgI9XbwGrm9G1ge27wbWBJeojB3C4RC6ao62Jiwa6LQfxiijZw6WL6Mzfg+hDCL6Y9/aL02jUv7kjudclAqgiqkIWc8h+qpzytYdLvjTyWhD/JYvqLPv1imvSLKmMCgZ4wwQCA5SmG660kYYHr1ARnoboFrsMtcJLJAtfJVB+zwO2wawKLwFN0N0G72Fw7MUMEkB38kMv5IefxQzbyQ7ZpAdnCD9nFD2nwQzbxQ/ZooZAhcDzCD9nMD9mphdlo0kIhl1fZwwa5QAtHIdZTggv01itEPnVEe+vha4GCKf/jDuPo/rpWtaP72wMc3d9a2dH9jpmj//lt0l8dVpJqL8XUnmPFOLy5xKNzaC6R0cLr6BFnzNciZmuthtTVkLoas1VD6l9E9izQYuB6ZIiaw5hL6MCerBairkcAM78abVSjjao7q0Yb1WijGm1Uo40bQ0s9RH2VFrTs1II9DVooZGSuOgo9YqIQBj5fC443Vy0RG+RSfsgQ6p328kOGsJKyjx9yJT9kPT9kNz/kQn7ItfyQ+6vsYYPM8UPm+SF7taBlCCa4oIVxy2hhNvTQ8dVaDHyhFtFGtxbGrVsLWu7TYuB9Woi6qYUJ7tbCnfVpoeMLtaBltxZ+fJkWU/wVWixthpAnCiGbFUI1Xpv0dNNsj1gXm1ErTX2nu8o0W+qQpOY2p4rtpEMJ2KaC3RJowdWdHOwZWo+b83kS9We6tr77d+6+hM7IcyKDcmUGIR/RRbwCEfNqRHwHui+3Dj2JOoeeRJ3HT6KuU+2XCg1BK4KY2xS+NxhbcMADwQCFk6izUL1udE287CTqbC9xrPGN79DGYnZwVnVoczG76SZ2SGEbQ0pN6yx1k5oKfxtDiqSVixr0TnzwFD0pT3ImQIZgDYAc5YfcwQ+5kx9yFz/kHfyQu/kh9+Ayi58ljfqNDHGW9AEHkGCSMsXsvd5nSWMneSz2YbEysrOk7TEdlvdpXDRJWb6zpLOC6U1DE4ERQeR2muB2Er6GHTASqThS/hN105vBTW+ayfTS56NUyts/xpqVnLDiCJIqnTpE3YzMQ3SkUwvJw1ayEEzUhYXF7JvdjdbBTwS5s/e+HlGYGVAbZm8CYF4EzEOmzRzzkn1A9OK4YikK2WvUFYuYCmaYFCtLuhxqliqZj9g/V7JNceyfnVpANvJDLuCH7NGCli38kF38kAY/ZJMWA1+uRS/naaHjIXC8VQuFbNOC4yGIekQLuezgh9yghfboYdxCGPhSfsh1/JDLtKBljxZyqUcU3KXFwEPwkM38kPOrIesc0562qtOdzQPXI2TVwwR3aGGC52lBSz3iy1vmany5Qguz0aEFLdu0UEg92BOCvTS0CLP0kMv5WsjlnHVnB8JwZ+76BLBKHFNa/Mbbi8HX3Fcagfbi8iuNcsRKq2LNZkx9pbXOX9Et8yG4OXSlNQ+7JpA6DwmrsuSNcw9ALuKH3BRs+TkQJdkOxs7ehbx/ADlIO6p+MPZdKgdji/ctZXyosWJRWQy+hl3uaN+9mduINouUeIErouKipivedb9JWu1V96rdva3EldiV3vm+Wt3MWLiZSTCZGcldR4mzPopULbK+0OQvWVzOD7mKH7KLH7KVH7KJHzLCD9nMDzmfH7JlrnK8SwsdD6GX8/ghG/kh27QQohVaCFGHFrRs1qKXnVpwvHOuurMmLdizQouBL+WHXMcPuawabcxmsxFKaOBODJjln2msPVNszyTaS8PXXPNIk29WHeA+cmJWbYY3qzYDz6pnvjsSbArvX3rMEJJi1irk/VH5+5mIelJslUpSLCLIfsKH7CdIElOyn6hmlFgySn1azNxDmHTN08LxRbRwfB1a9FKP9E81uK0Gt7MzuJ2jea8OLYRoQTWVxgbZo4UQtWgRbTTPVXvZpIWO6+Eo2rSQSyMM9rhn1WDOic6qI2J7EX+z6gjVnsnUnunD4ESC5F6MG5N7iSjmXowbn3sJXUpcdYXwALiZukIhCWNcfzCdAPneez7wttwzFz60eFXxJ4kdv/mj172yK174evGXWz7/jle///Il8VPFFEq9OxsSEwqm6haUS5Zmnh0u1i2yHy+0f7U5Bedv1sxIzl3jx48dHT8zsfnE0WukGj3x4NTE1MTRvSfPTJye/uPoQxMnzpw+d+6iW1jsXi1CxGgr8vdtF51sp/7vysGJM1OTJwTBAGVfSYVEk0UIRhK+RrSXZmovDV/DIJGqN1BVF5fUrFnFuhWlU9Man8b7u2fquBvXrkn07wPSngZNWpZJUBscC5lV6IhVNmD+a569ey+tDwUDIYqh64L0fuym9t6CvQ+vqDrAusxNL6p2GNBnbc87fnTr+KnTU8enlRszkRmkxDdyQeI0ezD3yGeCR32ZYJfPdhO9Xo3oo25pGi31psb9ZDuknOvZDsga17OdJcTXyqWrxi1dNXA0JYN50XkONHinhjjqbjtRc79DCDSA+aubIfrT13t87X/2nboE1X7aTks/zQu4dZhO+OmB+xWHnXCAoX29pkBwKoEzEpyF59cUYKtEeT6oesLENagJfIO6iWvATVw9k4lrEE1cPUqNRtg1IYJphAYIaa5RbK6RCIoA5Ag/5CZ+yC38kCk2SK/KgCpgFbAKqBkglWerJ7fNbaMmWug0WnJMfcrfNDp1w9vD6sjK+ZKzaLPIVBtk+RZLptqpYt3f2eC/QhXOZShqoLdR1SPdAt8mJN2qL9b9GsgAYJehmHaQM/MsphrilNr4BBpIxYNFIv71pgFShXKsEYXSxZRnLqGBPDc75ZBCgT8NxbpL9rn2P61AJhNymXy/D+bXh8f8VBDmpypkvkkyP6uQnDI9mV9PMt+EzUqV83Fv5psI87M0881i3WUfzE+Fx3zTk/n19AKHgrkAVBGYD0TDUsjZZj2Zn/J7Yr4lV85PBNd8y1Pzn7u5Zt9b87NBNL9exidAFYH5QDSiCmbfO4WcJZlv0WY/W6z7rDfzrWBmfzrr/yc3V/OtIMy3KmS+STK/ViHMNCtkvumQaBnzXwTMp+J4i4zj0QSBecUjFEEcxv+0WfpCEF1xZcafm8mMXxvBTGpcaf3QflInT5ub9XT6Wp4+r1cYWs5TEixSEnK0GZjW1K8BSXDnXaERkZ9uQ22QSYW+EJMKf4NMKuAGmZSHWvkPA8ywpNtempFviIkEkW2VmU2sLNtCeQEYfbnAwL9VTlYYxJnUFLlBeFgPmex+2ABNJzafQBxtA20xG4t1P7q586tGT0fbROaXkI/miR81QaoIujXPh1NKySZtlc2vGmhHOz2/+mefjrYxmKOlgwfBWAPAch7KLbAG1CP/lWGGv9yYQbUXY2ovBl/DIP0c5CTy1Cjm40Dn3C4TDMbCCreiduEW8e+NH/qDo2jZVaTiE6YCnCUXx71tjMnbxgkvIXjbWtg1QQTAU3TeVSs2V0tIVS20xuyQhkRQ1Mi6wU2hDWhhwy2QwK5nt2K1Vz6KF6K2anzRf/GCAfvlehYlRF5R6laqi3wMF/kok8jHRIGJoiIfh10ThCkOXb5/DYsT8hmHvo4dsoUfso0fsokfch4/5HJ+yC5+yE5+yA5+yGYtON6phai3aiHqjXPVEnVpwR49RH2VFkLUqAUte7RwFCEEMBEt3FnnXJXLOWsvb6SHjMwsH13dgjCDdLj04x5JTiZSzD9a8fSwW5xs4VPPhCq28tRTch4T6Jmvw5F6b8U79vjWD1jD94yvxVhAHyTlP/kB5rKXK1yjWYEmuGudT2IiFe0sNWj8eqZiu9ivWtV+qdAQtCLoRsKzWpNmy5OHJsdPncfyBQjkMLGZC02LjyDJ0+Hyz/USRR0p5t/lvR9wY5DCjE3iRxthv9xZ5xHwqfAQfDmESt3GCpdV0viyyibPZZXN4nA3edJoi/jRZsh1QSC3QHoJT4dg264RpB20v77WEK/l3C8jWS+xtcfVTC9nM71ll4TtSrSrfPP/BWNFH6JAjq1OogL1FfOftsE/JMhtztFN4etcMf9ESeiaHqC+zgsP8w7T6XrYW/5pqY64lzYZfcX8R+w+n0KVMV+hMmZwZezzVMaCqFd9nso4KH5UgFQRBG8QcgoBlezM7fU05nlyjbPXIeACf/LF/PPUGqcJaSI8tYKNKYKucUYg4IyiRB8XBLav/LMfFViSq8JQ+uFrKKSw0z0CFR4VlW3HHnL3xPuzgrQKa9BBRoGfhWLeLt5rOq0k8d6sHCQlrQ9qgtizwWL+C941i5iZAbo1IDczf2qDn6wAPC0H/5J32CMxCP2eVmRI/GgQ9osQ/CHhYQHaU3Rr7aBzGzD4SLwfDTzs89pePOTcsusYhsTZ+xtHr1zEv2M70a+K8f+QmuuIKjB0O2wlEEtz1GhRzEF7Rl1Q0bcymb6JItsqoYj9LRCJ4EHWPXYPvqNgp3Oof8jBLpajNEJNstK6yfz3fBRe9VUWlEQuVFLhXAhS4dxPBiUR0utJfGLWR1xoBXTvlu3e2xVIAABuQ4ngbeVlQtFfzP+zt5UfCMIWiSUZoKx8PzQdhL3oQ0W3EJ7oDniKrnS4lXnCCDl97Ref9sG2VeTLh+gWbNGtE7gzAHvlfujwiQHpgKWByNBsEJJNFP3hYn3aOzQbITJNhkIyaAQOx00ikIHaqJq9Gir1Zrs0d1Vf78PmD1Q4Ec3jijPiqThSYlWWORsSVWMTpDblESQ5owKUKf8m0pdaDZTUykCjlTQJregP0l7+oL7jpviDtJo/cHiSmyDWg55iLTVpXjSS5LWHSH8wTPoDh+DiMpi2ZfAFhXjV2wzSE+4IlZEjJ4G9TNmPXjGoEL+TLKQVVMVIeSGtgC+W9THVcNL5P2HM/WrN1ikE6/2iLsv1PFCCpt8Rj0kmdfVbRckAzRoKRhAEfDMaVT/iHlGBM69fCCjB/aFLcH/4EtyvJsEDTBI8QPqxftFTgGeYryAleMDhQQQJHirWj5GJdxWPPChK8F73iPo5JbifkGBxbar+bvW1KSI87ivWT9rQ91BrSwXKWfVTzsrEDbAkrz7T2bGw0jM1cTym6feMaQaCZHu98gBca0YFd7gtEq8/POKFtOA2QOa2cqTn6vVY2Apr6cq4pDCa3grlJ0fpXnXegInJsMOiBJnwUhns7agAIFbasTIo2umBYv07Aq1FeUsXnXnqowRoiF6hDcuC6yVdA6TLDyRdvtZH8Eih8MTY/fh69mKlVYaZHu1F5Z0M7AoONyqT+vd5JygHiH7tCzZl8lh2np4y/WfiAA44qtLZyHhqp11poojHke2i6j0lCViFWcFg6FuQB/GZUD/TTIhehXdRYwh2jVpgUMnWDxGsGYL2mB2yr2KeDokUmmlZ2PU7TEiZnbQOsAV5MMgW5ALsl1sLYdoD0cIBH1pIJzkoLRxAl9BmmxYOhKeFA5VrYX9VCwktHLjpWtgP+0UQ4fE7ezxpUKOiM4oVP0vUdWYofJ0Zou2Lu9lhtWYXn31qy/HxN7xpy8mHz3740MmD40ePPfyY1ICmpVI97FBSZt4WZitvC+HxtnDDeNuvxNvwAsYlGgaMlYrjYiX/grPBwSKsLIKcyTj4LS2P+Hty9qoyJR4WU+ffQifoHKnzQSIYlaTOf6BaKkCmzvuL9T+zof+BSp2TxVxmWMVcNdFZluiOeCS6qVxtf3i52vvx+ffY1Oud0BkIgKq48Fl/uUcqdVz2RxBIVsX1czsZMakq4kNwcDIhbzC8847DQSr/RmQGBPSLSJmMUPVjg6hCDVeoUEtmWZFXjizy6vfOK9nWzVuqN5KhTMAaNYKL6F1LQ4gg99OCPFRsaPRRBzgSnogMBRGRoQpp3K9aB+goGfWfmPSVmu4HnpjcqIjteBPbzRPRgel4TbKtsmGp996hHCJuwJUskYMv97abkgF5X2RQL6MC6BcRiNQLSTLwZQ47+LLePvjy5/Q/fJOQ+7ITaQfqpRedNKyzmfQKdYlkoBlonpjmNFQW8vuY5hDX9eXDu64vT0xzGtWaXUTPQIHkpeGoQXOAkcLdmO74vaFfVUnraJ8wraQbbfChsCLMFz+gpMle6k8fgV1HqT95BHaKOgIbPVHYxxHYWekR2A07fGwPr/AI7MhzWh2BrVLqw3gEdk56BHbDQWp7eArShDo3WmVMdahW1YlaRVgD6jR+lFxJ73OlOyWEShYb7vH28ynChBgKmx5SsF9udU1Ca0schN8R2tUuOVzd0p7qFsLN8Ca5tTEpPu2AbePHsJf2ME5WRq+Hn5WHDFGnKNorMHYjthiWPig2nBBCCTvc8Hey1Ne/8JOvPn/7hgfs04iE9NuVgxNnpiYrbijzhU/t+/a/nFoWekOtn5n48saXfvCSd0MlQ3eMOLm98mSlDXZvxQeTGdTpV34C4YjKqWmKB379XD0QNvFAOM4UCJv0eXfuZi21Zv+NDoQNyGm5RQGMxK9dw85Ls+xY6iFxKIbqUCqVzv+HngZfDuV/DeNTLeKHo3BAoh+uLTb8hg3+HsH9wcPhba13vVMLVRWdyZrOYzRq4U9sSGJCOAEHhoUxZAAXhWCyow4aLnknhbGb4mppYk+Dv9876EmSGuc/UkrCfrmZZjkmMK7kBhiG5XWMiYXyNYJ/lLzK2bJZB1+jn9Q6j0ux4Dj9ds6ELUn8DEBHRXIzeuTjqKi+kAG2Ape9ZqVneMZRb1RDHKcZEW8WmfnqLvXCl5g9nCn/hS8OHWQMHVA5iDvlIAp/oh8lnB/FCQrGOeOdOKQOoQ/YkCKkaNeKmRfGvlMnukY5G7LBXlOx220VL2gR3O5nVd2uQbuZabf7eRv8T3y5XTQ+KznJmU7fDTuBzvQFz+pjpu9vqdWUz/b/FHhVzP6M2iT5c3S43p7Xkl622fBdG7xIXRcfo1wl5dKuuDP0VtnBSSnyV3aHvkLFVFH7ta+ihLsXvBOCMyR7Fyjik+gz6BjR3rTL23sSubQzefUAbXcsAxI4yVI1s+uVZPBwJwm7TVDCEbs4slEBAiuT9BkWaZVVIhsDjWwMWWTzWUqtyGAQk0uTHEpSYcpaiw7FQdey+akwh/Ku7/z8r9/z1pYfh56sGf7gm38tfdsznwy9oadTX9nyXz9o/lLoDX259of/9KX/ft+50Bt67IU1O//PgX9oV8lzuSXcEVYTZsugdCNKuRz0IPMkuDVA9DmHpT6nMV7xvcU1IrkAFBZvXJHf2z0DcUA6V25sLeljo6k6EfeCTvkoaUlUmNWPVXKcYTLIOUl0EsAkl6PQnsSDrAol/F7YLrtzNFFsnEctokVIZ2f4jTPiRKr5sC16/RXPL2rRsK2GWCuJiDIDhuh6loQDdD1L4bbEx/w+YQvxADG/vxlm8SaobdJTbaUaaCsLrX90rBNczk3F6D5OMS8BO0D1OE72OEHM6Ee9+lvSTG/37H8o9ASMmi7680x2RgFaAZln2mKP76CCb0iAKTSuNEkFsY3jiEkowGhYnyIStmHpbjwslztKFmukKtAEi9RdemZuAlmZ9aI/6in6Zad7LIjoj7GL/lhV9K8SYXaLvgZWf8xT9E/Zw3l7ENE/wC76B6qif5UIs1v0335TRJ8QtYRCaaFFrO4k4GsYSyUVN0lVwVGuuEniFTcWU8UNpegqU39A4HKRzfP7T56eOHb05IkN+ycmH5g6M/3myRMXoIDH4PwkdrNkXIztZfdgNv6WrQvvQxeSD6OrtUfsrz8qmeXbuzfof5uJNVphTSjqQ1dMMhNPKLUpXWhsvGyP8oN4Vw1JV2fafK0E1ig2PlHxTZJUKrGW2CCQsAf04WBv2aJxjyga0H7awoG3EiOWRuJMieq/M/ePGr/3nkU+EtXXhWPmz4myr5Xaudor4kIusDTuatlpUXrepsnvu28atZsqvfF55A3l1X8ka2W5P4iWP3C0nCy/4Ph7CosNZv6clpDHxrIE8qSLjZ9zMcAsf1Yydu62TXnbSffgkpgHKAG6PwBXiJY48keYIKrWijLJ9a9s/fya73z3ubcoLcC41m6BzzC81m5dVUC2FdjPWYMk1F3h0Upt6NFKrb+bkyuJVmrJaAXPb9fK9p3aftm/azSJMFIHwKeIYCrmI1qIi5clGuX5i2dBcSN6d0jCu6BYvnjTtNwG/1awXmM9Eo+9jnt+FBVLnQw/ZL0iLx626ecqQ4HXlV+7x10gTLzY1GgT5rs4YajuojXPtX5rnuU14I0/BNVZZH23//ldLR6zOgr4FVd24x4ru/8YqMDae1cZvbYapwusidoXR7rEFOe9YrqkNrx0iemZLqH3CFIX3iY9khr+CizFZHJULtE/L+natNb5d10mnvp1cMA/IlhHCbRfIe7QKInEN8W9T/qNo1WThDJNGyzTW5msIMokTbqBXhFpLaLaP+JUJoejwvcGhaZMUU9lihO7CcbIIj+6xjvqLfsRqX8Dlc/Id8bj+yYdFUeOGbcsUdDUbPemgyx0RsuwJaFzNPTQOYqHzgZT6BwNojpxIjuklOiLwkRfPEYKlOGXhQFGKoYHjoAHT70Y2Ia0hI8emUpr6LU+HJUpRqdRz+g0KcbBpudH8mq6JO0Spx3FOu+LzgPW0zVtuClRl8kTddX6ibpCXKSqDRJ11fqNugJAjlEqZQULDVU2lYDvQbOygtamLd7BD35CBSHT09Cjs/F8CmK7gEOmE/D7mzCTSARZeE34qzlQkUBiiby2QpkeC0um7/SWaTOITJvFprtvip22qAxAyrdMO7zwrLTT1M6TA2T2z1JJHJuhR79m+IljilZGEA1Xin5NGP1asWC510TA3eAJkH2tcA1lsOs3mlv/7MF06Ltlnrtt9UDm7mVvD72heKz1txY/8+92ezfkUnTls2CkWlHOTNv2w8Z32Byz/IKrI5bqMrh8CZDYbhvHlyGn/ce75IDCTmFTdU0xWm4WWWlOqSKZLqTawEgWusZaq94pDCrhcy3aElZfm94yI7b/H9itqkrUjgMA",
|
|
3974
|
-
"debug_symbols": "tb3RruS6cX/9Luf6XHSRVWTRrxIEgeM4wQEO7MCxP+CD4Xf/iyUVV88eNKd3954bz7I9U0uixF9LJCX985f/+vN//uN//uO3v/z3X//vlz/82z9/+c+//fb777/9z3/8/tc//fHvv/31L8f/+s9fbvM/vPzyh/rrL15/+UM7/tDzDzv/aL/8wY8/+vmHn3+MX/4gt19/GbfrTzn+LMef5fqzXn8epUSPP+36s11/9utPv/4c559yuyVIQkmoCZpgCS2hJ3hCVpb5r2zC/Dttwvw7fcK4oNwSJGHax4SaoAmW0BKOyqVM8IRxQb0lSEJJqAmaYAktISvXrFyzsmZlnZVlQkmoCZpgCS1hVq4TPGFcYJYw/6/ZhjYuaFN6myAJJWFKZ/M2TbCEKfUJPWFWnk3XxgX9qFznhvWjcp371efJOTej14Sjcp1Hp1tCS+gJnjAu8FuCJMzKczPmiV+nfZ76Ovdinvw67fOE1ymdp3zAPOdPkISSUBM04dgenS02z/QTxgllnuonSEJJqAnHfunRdGWeLdon1ARNsIT5l31CT/CEccE8W06QhJJQEzTBErKyZmXNypqVLStbVrasbFnZsrJlZcvKlpUtK1tWblm5ZeWWlVtWblm5ZeWWlVtWblm5ZeWelXtW7lm5Z+WelXtW7lm5Z+WelXtW9qzsWdmzsmdlz8qelT0re1b2rOxZeWTlkZVHVh5ZeWTlkZVHVh5ZeWTlcVWut1uCJJSEmqAJltASeoInZGXJypKVJStLVpasLFlZsrJkZcnKkpVLVi5ZuWTlkpVLVi5ZuWTlkpVLVi5ZuWblmpVrVq5ZuWblmpWzD9bsgzX7YM0+WLMP1uyDNftgzT5Ysw/W7IM1+2DNPlizD9bsgzX7YM0+WLMP1uyDNftgzT5Ysw/W7IM1+2DNPlizD9bsgzX7YM0+WLMP1uyDNftgzT5Ysw/W7IM1+2DNPlizD9bsgzX7YM0+WLMP1uyDNftgzT5Ysw/W7IM1+2DNPlizD9bsgzX7YI2ONiZIQkmoCZpgCS2hJ3jCOEFvtwRJKAk1QRMsoSX0BE/IypKVJStLVpasLFlZsrJkZcnKkpUlK5esXLJyycolK5esXLJyycolK5esXLJyzco1K9esXLNyzco1K9esXLNyzco1K2tW1qysWVmzsmZlzcqalTUra1bWrGxZ2bKyZWXLypaVLStbVrasbFnZsnLLyi0rt6zcsnLLyi0rt6zcsnLLyi0r96zcs3LPyj0r96zcs3LPyj0r96zcs7JnZc/KnpU9K3tW9qzsWdmzsmdlz8rZBzX7oGYf1OyDmn1Qsw9q9kHNPqjZBzX7oGUftOyDln3Qsg9a9kHLPmjZBy37oGUftOyDln3Qsg9a9kHLPmjZB232FGsTjspWJhyVrU/whKOyHYlks6ecIAkloSZowvGv2nEJarMXnCAJJaEmaIIltISe4AlZ2bKyZeXZC9q0z15wgiZYQkvoCZ4wLpi94ARJyMrzPOy3CZ4wLpjnWJ9tOM+xPrdnnmMn9ARPGBfMc+wESSgJNUETsvLIyiMrj6w8rsrtdkuQhJJQEzTBElpCT/CErCxZWbKyZOUZ5l0nzL983PC2Gd29T5CEklATNMESWkJP8IRxQc3KNSvXrFyzcs3KNSvXrFyzcs3KNStrVtasrFlZs7JmZc3KmpU1K2tW1qxsWdmysmVly8qWlS0rW1a2rDxP0e4T5r8aE45/5bcJltASeoInjAtmLJ8gCSWhJmTlnpV7Vp7dwWWCJ4wLZiyfIAkloSZogiW0hKzsWdmz8uwyPk+22WVOKAk1QRMsoSX0BE8YJ/TbLUESSkJN0ARLmHWOc77P7uA2Yf4rn1ATNMESWkJP8IRxwew7J0hCVi5ZuWTl2Xe8T2gJPcETxgWz75xw1Bm3Cce/GjKhJ3jC8a/GkWx99osTJKEk1ARNsISW0BM8IStbVp79YszGnP3ihJowK7cJljArz72Y/WLMRphhfgzjTRpJ7bZoDqzdpmYG+kVzaO02j+PsQcfw3qQ5uHabhtmHLuqLfNFI6rdFsqgsqot00XL05ejL0ZejL4cvh0eVueMe/2Lu+ewnMkdDewyPBsUA6Ulzq2QezBgkPaku0kW2KOodLeQxGCpzhDZGQ+d4psdw6Em6yBa1RX2RLxpJclsUDptUFtVF4ZjDwWKL2qK+KBx90kiKUdWTrusELyWhJszrhLmvsxOd0BJ6gieMC2qU9kmyqCyqi3SRLWqL+iJfNJJ0OXQ5dDl0OXQ5dDl0OXQ5dDl0OWw5bDlsOWw5bDlsOWw5bDlsOWw52nK05WjL0ZajLUdbjrYcbTnacrTl6MvRl6MvR1+Ovhx9Ofpy9OXoy9GXw5fDl8OXw5fDl8OXw5fDl8OXw5djLMdYjrEcYznGcozlGMsxlmMsx0jHuN0WyaKyqC7SRbaoLeqLfNFyyHLIcshyyHLIcshyyHLIcshyyHKU5SjLUZYj5k3m7MiIiZOTbFFLOntyUMwdzUml6LUnzZui+adff47zz+hfcx5jRP86yReNpOhfJ8misqgu0kW2aDlsOWw5bDnacrTlaMvRlqMtR1uOthxtOdpytOXoy9GXoy9HX46+HH05+nL05ejL0ZfDl8OXw5fDl8OXw5fDl8OXw5fDl2Msx1iOsRxjOcZyjOUYyzGWYyzHSMdxvXEDBSxgBRU0sIEddBCbYBNsgk2wCTbBJtgEm2ATbAVbwVawFWwFW8FWsBVsBVvBVrFVbBVbxVaxVWwVW8VWsVVsik2xKTbFFj+6xQINbGAoeuBYeObBiaEYgQWs4FTUW6CBDeygg2NhJMOFAhawgtgatoatYWvYGraOrWPr2Dq2jq1j69g6to6tY3Nsjs2xOTbH5tgcm2NzbI5tYBvYBraBbWAb2Aa2gW1gG8t2Lka4UMACVlBBAxvYQQexCTbBJtgEm2ATbIJNsAk2wVawFWwFW8FWsBVsBVvBVrAVbBVbxVaxVWwVW8VWsVVsFVvFptgUm2JTbIpNsSk2xabYFJthM2yGzbCRJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWFLKkkCWFLClkSSFLCllSyJJClhSypJAlhSwpZEkhSwpZUsiSQpYUsqSQJYUsKWRJIUsKWVLIkkKWFLKkkCWFLClkSSFLCllSyJJClhSypJAlhSwpZEkhSwpZUsiSQpYUsqSQJYUsKWRJObNEAg1sYNhqoINj4ZklFihg2Dywggoa2MCwjUAHY0FcbG9kicaWRZZcGAvuYvVaZMmFCsayOw1sYAdj8V0LHAsjSy4UsIAVVNDABnYQW8fm2BybY3NsERUay/0iFDSaL0JBo80iFC6soIJzIy2aL0Lhwg46OBJjxY3YuT5w2kwDC1hBBcPWA8M2AmNd41nXwWmbI2wSq3COH4JAAaetRbEIhRbFIhQunLZ+rl1sYAcdHAvPtZQnCljACiqIrWAr2Aq2gq1iq9gqtoqtYqvYokv3aKjo0j1aJ7r0hQbGNsxzJ1baSI/mi246p4QkVtskKmhgAzvoC6M79TgA0Z0uHAujO10oYAErqKCBDcTWsXVsjs2xOTbH5tgcm2NzbI7NsQ1sA9vANrANbAPbwDawDWxj2WI5TqKABaygggY2sIMOYhNsgk2wCTbBJtgEm2ATbIKtYCvYCraCrWAr2Aq2gq1gK9gqtoqtYqvYKraKrWKr2Cq2ik2xKTbFptgUm2JTbIpNsSk2w2bYDJthM2yGzbAZNsNm2Bq2hq1ha9gatoatYSNLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLGlnSyJJGljSypJEljSxpZEkjSxpZ0siSRpY0siSWlclcaHRgBRWcNo9ngiJLLuxgKOYFcjsD5EQBC1hBBQ1sYAcdxFaxVWwVW8VWsVVsFVvFVrFVbIpNsSk2xabYFJtiU2yKTbEZNm5AmmEzbIbNsBk2w2bYDFvD1rA1bA1bw9awNWwNW8PWsHVsHVvH1rF1bB1bx9axdWwdm2NzbI7NsTk2x+bYHJtjc2wD28A2sA1sA9vANrANbAPbWLZ+u4ECFrCCChrYwA46iE2wCTbBJtgEm2ATbIJNsJElnSzpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLOlkSSdLOlnSyZJOlnSypJMlnSzpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLOlkSSdLOlnSyZJOlnSypJMlnSzpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLOlkSSdLOlnSyZJOlnSypJMlnSzpZEknSzpZ0smSTpZ0sqSTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniDIyeCxpPPLPkxGnzEwtYwVC0wAZ20MGx8AyQEwUsYAUVxNaxdWwdW8fm2BybY3Nsjs2xOTbH5tgc28A2sA1sA9vANrANbAPbwDaW7VzueKGABaygggY2sIMOYhNsgk2wCTbBJtgEm2ATbIKtYCvYCraCrWAr2M53SNwCO+jgtI14gUAEyIUCTttcgS/nCsoLp20u0D/QwAaGbQQ6OBZGgFwoYAErqKCBDcSm2BSbYTNshs2wGTbDZtgMm2EzbA1bw9awNWwNW8PWsDVsDVvD1rF1bB1bx9axdWwdW8fWsXVsjs2xOTbH5tgcm2NzbI7NsQ1sA9vANrANbAPbwDawDWwjbeVc2XmhgAWsoIIGNrCDDmITbIJNsAk2wSbYBJtgE2yCrWAr2Aq2gq1gK9gKtoKtYCvYKraKrWKr2Cq2iq1iq9gqtopNsSk2xabYFJtiU2yKTbEpNsNm2AybYTNshs2wGTbDZtgatoatYWvYGraGrWFr2Bq2hq1j69g6to6tY+vYOraOrWPr2BybY3Nsjs2xOTbH5tgcm2Mb2Aa2gW1gG9gGtoFtYBvYyBIhS4QsEbJEyBIhS4QsEbJEyBIhS4QsEbJEyBIhS4QsEbJEyBIhS4QsEbJEyBIhS4QsEbJEyBIhS4QsEbJEyBIhS4QsEbJEyBIhS4QsEbJEyBIhS4QsEbJEyBIhS4QsEbJEyBIhS4QsEbJEyBIhS4QsEbJEyBIhS4QsEbJEyBIhS4QsEbJEyBIhS4QsEbJEyBIhS4QsEbJEyBIhS4QsEbJEyBIhS4QsEbJEyBIhS4QsEbJEyBIhS4QsEbJEyBIhS4QsEbJEyBIhS4QsEbJEyBIhS4QsEbJEyBIhS4QsEbJEyJJClhSypJAlhSwpZEkhSwpZUsiSQpYUsqSQJYUsKWRJIUsKWVLIkkKWFLKkkCWFLClkSSFLCllSyJJClhSypJAlhSwpZEks8izzMeESizwTBSwTS2AFdaIGGtjAPrEFOjgWxjv0LhSwgBVU0MAGYlNsis2wGTbDZtgMm2EzbIbNsBm2hq1ha9gatoYtXtE3H3AusXCzzCecSyzcPE7BwAJWUMG5vfNB5hILNxM76OBYeOZDbMOZDycWcNrmQ8kl3qCWaGADO+jgWDjzIVHAAmIb2Aa2gW1gG9jGssV6z0QBC1hBBQ1sYAcdxCZhq4ECFrCCChoYth7YQQfDNk+NWO+ZKGABwzYCFTSwgbPufPKz1PM9mRJYQQVnhRLbe74v88QOzu2dr60s9XxrZuD53swTBQxbNF/0+fneyhKrQEuJvYg+f2EDwxabHn3+wrEw+vyFAhawggoa2EBshs2wRZ8vcYSiz19YwAoqaGADO+jgWNixdWyRDzUOYeTDhQoa2MAOOjgWznxIFBBb5EONUyPy4UIDfWH0+RpnSfT5GidB9PkLFTQwtjfOkujzFzo4EmN1aaKABaygggY2sIMOYhNsgi36fG2BYeuBCk7bXN1fYnVpYgcdHAujz184bfOVpyVWlyZWUEEDG9hBB8fCuCa4EFvFFvkQ702N1aWJBoYt2iHy4cKwjcCxMPLhQgGnzcIW+XChggY2sIMOjoWRDxcKiM2wGTbDZtgMm2EzbA1bw9awNWwNW8PWsDVsDVvD1rF1bB1bx9axdWwdW8fWsXVsji3yweLIRz5cGDYJVNDAsEXHieuHC31hpIZFx4l8sDg1Ih9aVIh8uLCDDo7EWDFa5stMSqwYTSxgBRU0sIFhq4EOjoWRDxeGTQMLWMF1LGLFaGIDO+jgOhaxYjRxHYtYMZpYQQVtbUPkw4UdxFawVWxVwAJWkH2LfDjFkQ8XdtDBaMmZGrFiNFHAaMkeWEEFDWxgBx0M27zAiBWjiQIWsIIKTtt8N16JFaOJHZy2Hidi5MOJkQ89zqjIhwsLWMFp67HzkQ89xJEPF3bQwbEw8uFCAcM2Ais4FR6bHqFwYQenwuPARiicGKFwoYAFnAqPYxyhcKGBDeygg2Nh3FTM15CVWCaaWMAKKmhg2OJYnJcSE9t5KXGigFG3B1Yw6o5AAxs492LOLZZYEJo4FkZUjFBEVFxYwAoqaGADO+jgWFiwRSjExX+sAk2MuiWwgR10cCyMULhQwNgLDayggmGzwAZ2MGw1cCyMULgwLoVjh7SAFVTQwAZ20MGx8LypODH2ogUqaGADYy/iLInuf+FYGN3/wrjh98ACVlBBAxvYQV94LqaIhjoXU5xYQQUNbGAHHRwLz8UUJ2JzbI7NsTk2x+bYHJtjG9gGtoFtYBvYBraBbWAb2MayXSs7TxSwgBVU0MAGdtBBbIJNsAk2wSbYBJtgE2yCTbAVbAVbwVawFWwFW8FWsBVsBVvFVrFVbBVbxVaxVWwVW8VWsSk2xabYFJtiU2znaiwL7KCDh+0YXZo48yFRwDJRAyuooE2MYjM1Ejvo4FjYbqCABayggtgatoatYWvYOraOrWPr2Dq2jq1j69g6to7NsTk2x+bYHJtjc2yOzbE5toFtYBvYBraBbWAb2Aa2gW0sW6zsTBSwgBVU0MAGdtBBbIJNsAk2wSbYBJtgE2yCTbAVbAVbwVawFWwFW8FWsBVsBVvFVrFVbBVbxVaxVWwVW8VWsSk2xabYFJtiU2yKTbEpNsVm2AybYTNsho0scbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wsGWTJIEsGWTLIkkGWDLJkkCWDLBlkySBLBlkyyJJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmSQJYMsGWTJIEsGWTLIkkGWDLJkkCWDLBlkySBLBlkyyJJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmSQJYMsGWTJIEsGWTLIkkGWDLJkkCWDLBlkySBLBlkyyJJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmSQJYMsGWTJIEsGWTLIkkGWDLJkkCWDLBlkySBLBlkyyJJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmSQJYMsGWTJIEsGWTJWltTbypJ6W1lSbytL6m1lSb2tLKm3lSX1trKk3laW1NvKknq7YRNsgk2wCTbBJtgEm2ATbIKtYCvYCraCrWAr2Aq2gq1gK9gqtoqtYqvYKraKrWKr2Cq2ik2xKTbFptgUm2JTbIpNsSk2w2bYDJthM2yGzbAZNsNm2Bq2hq1ha9gatoatYWvYGraGrWPr2Dq2jq1jO7OkBTawg2HzwLHwzJIRKGABp20u0qixyDNx2uYb7mss8kzs4LTN9QQ1FnleGFkyX25fY5FnYgHDFjsUWXJh2HpgAzsYttjeyJLAWOSZKGABK6iggQ3soIPYBJtgE2yCTbAJNsEWWTKHQGss8kwcCyNLLpy2+THQGos8EyuooIHTNlc61FjkmejgWBhZcqGAYeuBFVTQwAZ20MGxMLLkQgGxKbbIkrkco8Yiz8QGTluNhoosuXDa5hKAGos8EwUs4LTVsEWWXGhgAzvo4FgYWXKhgAXE1rA1bA1bw9awNWwdW8fWsXVsHVvH1rF1bB1bx+bYHJtjc2yOzbFFltQ4bpElF4bNAsfCyJILwxYdJ7LkwgrOuvNFhzUWbta5cqDGws2qFihgASuo4NzeuYigxsLNxA46OBZGPlwoYNh6YAUVNDBsI7CDDk6bzRM8Fm4mCljACipo4LTNufEaCzcTHRwLIx8uFDBs0dSRDxcqGDYNbGDYoqkjHy4cCyMfLgxb7HzkQwtx5MOFChrYwA46OG1zdr3Gws3EUMSmRyhcqGAo4sBGKFzYQQfHwgiFFsc4QuHCAlZQQQMbGDYPdHAsjFC4UMAChi2ORUy9WOx8TL1c6OBYGFMvFwpYwAoqaCA2x+bYHNvANrANbAPbwDawDWwD28A2lo13dtbrnZ0nFrCCChrYwA46iE2wCTbBJtgEm2ATbIJNsAm2gq1gK9gKtoKtYCvYCraCrWCr2Cq2iq1iq9hi6iXyIdZ7JnZwnuv9/LtjYUTFhWGrgQWs4OxZ/UQDGxi2HujgWBjPi1woYAErqKCBDcRm2Axbw9awNWwNW8PWsDVsDVvD1rB1bB1bx9axdWwdW8fWsXVsHZtjc2yOzbE5Nsfm2BybY3NsA9vANrANbAPbwDawDWwD21i2882jFwpYwAoqaGADO+ggNsEm2ASbYBNsgk2wCTbBJtgKtoKtYCvYCraCrWAr2Aq2gq1iq9gqtoqtYqvYKraKrWKr2BSbYlNsik2xKTbFRpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJEljSxpZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLIklp/W+b3uGstPEw0M2wjsYNzjWOBYeN7jnDhtMRRxvoT0wrlvMYJxvoT0QgOnLUYPzpeQXhi2FjgWxnDIhXP0oMffjZGRCyuooIEN7KCDY2GMjFyIrWFr2Bq2hq1ha9gatoatY+vYYmRkLk+vsVQ1UUEDp22uSa+xVDXRwbEwhksvnDaPYxHDpRdWcNo8jnEMl17YwA46OBbGcOmFAhawgtgGtoFtYBvYxrLFUtVEAQsYNg1U0MAGdtDBsTCGVi8UsIDYBJtgE2yCTbAJtoKtYCvYCraCrWAr2Aq2gq1gq9gqtoqtYqvYKraKrWKr2Co2xabYFJtiU2yKTbEpNsWm2AybYTNshs2wGTbDZtgMm2Fr2Bq2hq1ha9gatoatYWvYGraOrWPr2Dq2jq1j69g6to6tY3Nsjs2xOTbH5tgcm2NzbI5tYBvYBraBbWAb2Aa2gW1gG8t2LlW9UMACVlBBAxvYQQexkSVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyXnUlVvgWHrgQY2sIMOjoVnlpwoYAEriC2yZD45Vs+lqhd2cNrmQ1n1XKoaeC5VvbCC8c9KoINjYYTChQIWsIIKGthAbIJNsBVsBVvBVrAVbAVbwVawFWwFW8VWsVVsFVvFVrFVbBVbxVaxKTbFptgUm2JTbIpNsSk2xWbYDJthM2yGzbAZNsNm2Axbw9awNWwNW8PWsDVsDVvD1rB1bB1bx9axdWwdW8fWsXVsHZtjc2yOzbE5Nsfm2BybY3NsA9vANrANbAPbwDawDWwD20ibnmtOLwybBhawggoa2MAOhs0Dx8IzS04MmwUWsIIReDXQwAZ20MGx8LzAOFHAAlYQW8FWsBVsBVvBVrFVbBVbxVaxVWwVW8VWsVVsik2xKTbFptgUm2JTbIpNsRk2w2bYDJthM2yGzbAZNsPWsDVsDVvD1rA1bA1bw9awNWwdW8fWsXVsHVvH1rF1bB1bx+bYHJtjc2yOzbE5Nsfm2BzbwDawDWwD28A2sA1sA9vANpbtXHN6oYAFrKCCBjawg5ElI3AsPLPkxMN29I7AAlZQJ1qggQ08bMcU8MTZ/XUurdVYG3r9hdnnE8fC2ecTBSzg3AaJjZx9PtHAuQ1zLavG2tBEB8fC2ecTBSxgBRU0EJti07BFQ+lYaDdQwAJWMGzRfGZgAzvo4FjYbqCABawgtoathS1avXXQwbDFge1h80ABC1jBaavRULPPJzawgw6OhbPPJwpYwApic2yOzbE5Nsc2sA1sA9vANrANbAPbwDawjWWLdaSJAhawggoa2MAOOohNsAk2wSbYBFv0+fnuEI11pInR50ugg2NhCduJAhYw6mpgbG8LHAsjHy4UsICxvT1QQQMb2EEHx8LIh7lsWGNtaGIBKxi2EWhgAzkWyrFQjoVxLIxjYRwL41hEPpytbhwL41hEPlzoaxsiH06MfLgQW8PWsDWOfOM8a5xnjX2LfDjFkQ8nRj5cKGBZ2xD5cCEtST4U8qGQD4V8KORDIR8K+VDOfAjxmQ8n0pJOS0Y+6IkddHDaNE7ayIcLBSxgBRU0MGw1sIMOjsRYPJooYNgssIIKhq0FNjBsPdDBsTDy4cJpm2uxNRaPqoU48uFCBQ1sYAcdnLa57FJj8Whi/PrHRpaoG3sR+XBhA6OuBzo4FkZqXChg7MUIrKCCBjawgw5OW5vnWSwTTRSwgBVUMGyxx5rDTVp1LLQbKGABKxh1S6CBDZx70aL5Ih9aNEnkw4mRDxcKWMAKKmhgAzuIrWGLfOhxckU+XFjACipoYAM7OG09miTy4cTIhwsFLGAFFTSwgR3E5tgGtoFtYBvYBraBbWAb2Aa2sWyxIDRRwAJWUEEDG9hBB7EJNsEm2ASbYBNsgk2wCTbBVrAVbAVbwVawFWwFW8FWsBVsFVvFVrFVbBVbxVaxVWwVW8Wm2BSbYlNsik2xKTbFptgUm2EzbIbNsBk2w2bYDJthM2wNW8PWsEWWzFUnGgtCEw1sYAcdHAvPLDlRwAJi69g6to6tY+vYOjbH5tgc25klLVBBAxsYth7o4Fh4ZsmJc3mOemABK6iggQ3soCfamRonFrCCChrYwNje+bMYyzl1LkvRWM6p84WEGss5Ew2cFeYKFY3lnImzHWLYIpZzXhhJcOHc3jmXpLGcM7GCChrYwA6GzQLHwkiCCwUsYAVnq8cwgJ19Ptrh7PMn0jrR5+fcl8bCzcQCVlDB2Ise2MAOOhh7Ebbo8xcKOG0jDkD0+QsVnLYY0I6Fm4kdDFsc+ejzcQUSCzc1hq5j4abGGHQs3EysYNSNfYvefaGDY2H07hH7Fv34PLmiH19oYAN9Yay1jBvSc63lhRWch1BiL2Kt5YUN7KCDY2GstbxQwAJGo0abxY/7hR10MHZ+HqxYVZkoYAHnXsyH8fVcVXmhgQ3soINjYayqvFDAo+58vafG8smLjqp2O7GDDo6Fs+vafI+cxurJxAJWUEEDD9s4qS/yRSNpdtuLZFFZVBfpIlsU214Cx0K9gQLGttfACipo4LHtERSxOPIiXzSSZme9SBaVRXVRtLwGdtDBsbDdQAFj66NYq6CCBjawgw6Ohf0GCoitY+vYOraOrWPrYWuBY6HfQAELWEEFDWxgB7E5toFtYBvYBrYRdXtgVJi9KNY0Jgp4VIifhljSeJEuskVtUV/ki0bS7MEXyaLlkOWQ5ZDlkOWQ5ZDlkOU4e+6JFVTQwNkW850eGmsVEx0cC2fvTRSwgBWctvkyEY21iokN7GDYSuBYGD37QgHLOjRnzz5RQQMb2EEHOfrG0bfYixoYe6GBBjawg7EXFjgWRg+/UMBosx542OKOOxYlXmSLQnViBx0cC6N7XyhgASuooIHYonuXODzRvS8cC6N7XyhgASuo4LTFbEYsSbT5qhGNJYmJDoYtWim694UCFrCCChrYwA46uGyxJNFiiDKWJCYWsIIKGtjADk7bfOuIxpLEC+UGCljACipoYNhaYAcdHAvjx/5CAQtYwbBFk0RkXNjADjo4FkZkXChgASuIrWKr2Cq2iq1ii3CIwf9YZmgxZB3LDBNnblqQLxpJMwMukkVlUV2ki2zR3CCNoxy9P8akYx1hooAFrKCCBs6NjzHpWEeY6OBYGAEQo8+xjjCxgBVU0MAGhk0Dwxa7GQFwYgTAhQIWsIK6DoFzYJwDEwFwoYNjYQTAhQIW0ObL84Paor4odiFOkujngbFc0Oa7VTTebJlYwLkL830pGm+2TDRw7sJ8hYHGKsNEB8fC6OcXTlsMlccqw8QKKmhgAzvoC6NHx4j1OD/NExR/NXY4OumFY2F00hiBjyWCibFh0QzRSS9UcG5YjJTHEsHEDjo4Fsbv+oUCTtt8OYvGEsFEBQ1sYAc9d9iibDS0FbCCCkbZGtjADjo4b8SiceMZyJNkUVlUF+kiW9SSZl9pNQ7c7CuJCs7rgIi2WF6X2EEHx8LZVxIFLGAFFcQ20maxZK7NTLVYHNdmb7NYEZf/69ycmXwWK+LazC2LFXEXzvM+UcACVlDBuTkz2CxWxCV2MGw1MGw6sYTNAsPWAsva9FJBdmj2jFai7uwZF86ekShgASuooIEN7GDYYtNr2GLT9QYKWMCwxb6pggY2sIMOjoV2A6NYNJTFP4sjb/F34xi3+LvRUE3AAlawgXFOxqnRb2CcUXGMexyAaJIep3I0SR8L/QbGP4t2ODvOiRXUVffsOOf/2sAOOjjWHkfHuVDAAtrat7OLxA6NDnpirLc6hskCHRwL40rswplYPf5ZXIldWEEFZ2LNuTSLFVs2X39jsWLrwojzC6NuDSxgBRU0sIEdDJsGjoUR5xcKWMAKKmhgKCzQwbEw7s0uFLCAFVTQwAZiM2yGLa7Z5uC/xTKtxAJWUEEDG9hBB8fCzsGKa7YLC1hBBQ2MYvP0jFVYiQIWMIp5YGxknH1x8XXh3EiP8ywuvk6Miy+PUy4uvs6/GxdfF1ZQQQOxDWxxVXbhSIz1Volr02ORVaKCBrbct1hOdVUQisVFV+xQLKdKrLlvsZwq/66BDeygg9gKtiJgASvIpscd1YUddHCsfasUqxSLfnzuUPTjC9vat8qmVza9sunKpiubrtgUm9JQSkMpDaUoFIWhMBSGwlAYiujHc2bJYjlVYgcdHAujH18oYBz5ElhBBW1hdL35ojyLFVCJccUYxyJuly4c6y9EL7xQwJIYi2rMT4wts8DYshZYwdiyHmhgAzvo4FgYPwcXCljACmKr2Cq2ii1OoznJZLGoJjEqjEADGzgrzDkKi0U1F8b5MMf5LZbPJFZQwVl3TnRZLJ+xObtlsXwm0cGxMM6HC8MWByDOhwsrGLY4LHE+XP8MW8PWsDVsHVvk+oVhiwMbp9GIlozT6MKoGy0Zd90XjoVxcl0oYAErGHsRrR533Rc2cF643OIARPCf2xDBf2IE/4UCFrCCCs5ro1scrLg2mpMyFutgEufV1ZzssFgHk1hBBQ1sYAfnNdecy7FY/NLmpITF4pc2x/stFr8kRrEeGMU8sINRbASOhXFTcaGABaygggZO2xwat1jmkujgtM3xcItlLtfmxF3HhQWsoIIGhi2aOu46LgxbNFTcdZwYdx0XCljACio4bRIHIO46Luxg2OJYxF3HuQ1x13GhgAWsoIJhi0NoDQxbHE1zcCyM+5YLBSxgBcMWzRfj7xc2MGxxNJuvbYh7nBPjHudCAQtYwbjlisPdDWxgBx0cC+PW6MK4WYnTKG6Nyu1f//r1l9//+qc//v23v/7lP/7+tz//+Zc//HP9D//3yx/+7Z+//O8f//bnv/z9lz/85R+///7rL//fH3//R/yl//vfP/4l/vz7H/92/L9H0T//5b+OP4+C//3b73+e9K9f+de3x//0uNRu+c8PHn2VGOObGvK4hs670qhwnFrr3/fyzb8vj/99vFo5/v0RuOvfH5fPz++Elyxx3A/c7NFO6KbGmDdQUeK4jL3bjPJtCdu0g8xz8GyI455slWjPFjiu7NmPYzxW2Ioq3xTpm9Ysayvmi54fbMW2wLwIOAvU26PdGD+3HUaeUsd9TbOH7SCb03J+zTGPaBv+YDN2FSRW/V5948bROC6zv61RH9eIC7Eo0e7Oy+Oa/ekKMQZ1VjjOxZcqaHbxY6TtcYVdS8Q6jKslSnncEtvWLIMa9XEN3/VSmauvrzNDur9wch0D8GtfRmnt4clVNpFz3HHmOX70t/sD++2GlO0JWso6QbU82JXtVpR5dXVWOLbo8VbsasQ84lnD9HGNbZPWeQN7NelxKfe4Se3d4NpXeCa5Sv+Z0fVtU5Tbw6bYFmn8KI8uj/Ovbk/Relun6N0v2nGL/2KN8X4N1RdrmKwa7fa4xuYXfn4CM2sck+2rxnFv8m2N3U98fCP9PD/KuD2u0XZnaeU8t/JijVZXjeYv1jC2o433a3R9XGN3XMbISK/3V14fa+gmSo+LvozS42akvnZsh2eYzrmo12pUroWPoZPX2sPXOTY/0Pi4PTbbMWc2cl+OGYiX2tR0XXjMO9/Xjktf29G6jvf3pW6O7dP58TiDbFfjNtbPtdz4odQPub77xS++Stz/QH23GZu7pR7zSlGjHyNhd/dL35aouxsuyRLzzfGU+PAztzlJ50cAV6ct+rDE7ldObrour+Wbq/z+fIvGV4uuFjV/3KLbGp2j0jcnx/O/2OPxz/54+wxr+ytCLiqPmZfHV7dt2yJtrBbx+2vCb49MK+9e3e725ZhvWufpMeFkj2+Hm+5+GlaRY4seX4+1Xaw3X7He7+Ljuxqbn8ohmttx3LiwHfXDWdY2l6fHQHyeZcfg+l2N508xob/IXYt+PMXG9jpq9Xx55Rw9phSFzuL6+Bztm3N0rE4rt/s7jvGJw3pbv/jz/TCvnRp13NYv/pCXahwTWnl6HZNU/tppXtbQUauyGTnanKIWC+bO7bDmL9ZYXeXA/loN13Xl4bsI2/5a39ZlZbnJrb5Y5e7C4eDxYpW6GuW4Y7fHAeLl3ZGkXYXnRpK2FZ4aSdq3hRsDraM+Pi7edtcO/ca1w/3v7bc/L97f/YH6wVYwpHWMV98e1dik6bitoc4hD8csthVk7cfxG+Mv/NAeFxs3Lo9v/cW+coydrKsGOY7twyqjvjsKtK/w1Pj12wP5n2gLGS+3KKOMpdiLVcrdAEyxx5dAY7x9XMa7x0Vu8nMPzDeN0W4vH5h+V0VerKL8RIm1xz+WcrO3Zxh2JZ6cYtiWeP+XQdoa1CozWTfNMd6e9tmVOKJc1vxTtzJeKxJrV68iR/O8WMQGRdprp7wLWeTdXrsl/Joby7sBkHJ3cL67sXx6EKW+VkP5wdMqr9W4nzix8lKN+d36dTN1P/TwoYZuBw1WoFWpDyeudTuIsvZE78PsQ4m40Hh4qrbOmSr97v72Q4qUur06vEvn26bIbneKMSvm42GRbYkVZ8d91a5FNpeHfR3b3h8O5shuhnB+Q5qpgrrZDH+/ObZFzNbQlLV6f2t4+0SRsWK13bS/VqTdVvdvx/3D4yK1vHs184MST13O7Eb6n7uc2beGrK7bjpzftMbmRG2+hpWaf3OV+bHIbmxqrZ85JmMeDeX+YDMam9HLq/uy7qfaKP3lIraK2MutOpQi48WzvdzWlpRdEa0/ucjTi2H0/WtVff9aVd++Vt23xrMLYvZN+uSKGNuOpj63JOYHPzRch9T7kdDvfmh2RapQZPdrtZub+prdqS273vyK2WZLNmeJN4ZV7kv4hxLtue3Qen+v+Zkigzn28c3YzMci/vYP3r7EUz94u1uRJ3/wdq0xvz6QJW7fjKR+aI32/s9/e//nv+nPbY24EM4SY9Ma7f3WaO+3hv/c1ig3Vuf4pqf02xf8zu0mp5pmc7T71QYff2G2GdbX/fb8qN2LkdzX/dT8INnjIl1/ciTPj6PQb/213ZnvJF6Tba29WMTX/dB8xcaLRYZmk8zHgV8rcowarHku0/pikWpMuNnjhevi8gU377vJoadv3r1+xd3q7ug0JmXdN+eJ21e0SfuKNuk/u01ua03H/GjJpk12Y/hrorrexYDfnq/QRw68+d1V1Xd7Mr7iZB1fcbKOn36yxv97hZps8mhsb6zWD47el/hw+z12v+HxGNd5cNs3EyMfYn70d0+Q/Wb4uovottuM7XXRGmn6cCXwmSL11teBuc/4+nF1vbx9cbXfjjWjMd/CvNmO+pOLPHttVN6fryrvz1eV9+er9q3x5BjAD5r0uTGAIl8xBrCLkLbGVfv9QOKHCCmymwPw9Sif3C/t6P6hRn1/UUURfXdNxH5fxrrRlOHl8b7sFojc1lpdud3/PrT+qSJMJN763SVe+1SRu/Vy3cdrRXxdVx3Tlrfba0XGmo48WO2Vg1NuK5qP+a/28OCUn1xDbrfCsbnp42WdPyqzxt8Ovuu/ny7DQb6N8moZkZUmt/thhe/L9O3W3O2TPj7590We7EE/2CG92yF7uXllcOaWu0WWnyxT7g526f1xmfrzyxwxuuZ+75+M+K6Bt0XKWqVQ7hewfq5IfLjomoW+G0P6XJHKkpr5gMijIttfwr5WXQ2/Pf4lrPt5Gy5R7p4PFR0fimxXf/CAxP0PoX2oodtn42883383KP9djc01bO8ZlH7/ZHyvz5fwtfj9GFbflHh2T/rjPdm26FgXOUdf1setsbt+HXUN/Yx+e3E7lEWw4o+3Y3erNeoaUPNNk27HXHmuodzdeqrYJ4qUujbk2ycCPhTZzWJVFktUr2VTZDvqyqMeev8U4IdZ6GLbBFnjAvcPZ4p/okTnQdO2KSE/uT2OcW6/Gym5G+X4vkW2V2zKYuuDdw273Zq6QuBg65syu2motUjg/lmt7xt3V2KNzte72fDvSuxmsr6gxJMn2rbEkydaeXtHzL6g2+2egXm2Qe39BrW3G3Qbh3Xd3syPJT7uubtnrI5Z5nVtd/80z/dbsn2ZwQr3+2fWPv5A1P0TiXcPBoyXfuuOC+W75af2sEavb//W7Wax6lhLPuu4f7z741nat0+M8fz/bcirRdZgzfxS+6ZIf/tk3zXqk+fHD34a1vDmfJzXXv6FuS+jm6PjX/H77+8Hor9/CeHvX0L84D5zrQ08WNvjG0R/e3XAD0o89V4W959a4rkFBj9q0sKVULm7GfquSX8wBFbL3RCYvjiOpvSZ0R6Oo+0msJ4ejBv17YbdjsavZwJbq68O6D+15GL3E/Hc3GQZ/v7cZBnj/bnJerv95LnJ496D1VabdYH1th1oNXbn/lHt0j4U2Z1kg1Ub45tnWMbzRYy3Rdi3r6n6TBG/cf9/v7jgM0VaWS+KaeWbF/19LPL2q/722yFrXf8xlfbqztQ1g91q3RTZzWF9xc6oKL//Y7Md5eduh60SR7DVzXboz92Oxlp4v21O993vzJcUeXbiuO5e/vfclO1+O56csv3Bzjw3ZVt3yfrslO0+WSvDiN9M6n9M1t0zV0+OMtfdI1dPjjLX3dv7nhtl3pZ4bpT5+T3pmz2pb48y1zLeHmX+wXY8Ncpcq7x75113czLPjjLvizw5ylx3D1w9O6pa6xcMd9Xdw0HP3SLuSzx1i7jdlS9pj+dHmet2eufpUeYfbM2zo8xVy7ujzPsSTw0kVNWfWuLJE21b4skTbXxBn1F/vzX8/dbw91ujvD9EXHcD988OEW/T/bkhwLp/ZPupIeJ9jeeGiOv+Mamnfqisvz9EXHeTS88OEf+gyHNDxPX9Caa6f77oqfPjB7n+5BDxZ8pshojr9jVpzwbR+3NV9f25qvr+XNX2YcvnBrzqdqbqyQGv2m9fMODV5QsGvLYpUjovVh6bxwu3RTonyJBXiwwueG+7IruGff6JOHn3vnv/UN2zj0vvn8x78r67j/fvu7ePBo+1/ly+eaXoh2eD626y6itqHDdWvECqlk2R7f3/4KMj3zx/8uFqxHfXiE+9TG+/HUP56Mf9krnvtmN/682i3m/Gmj9TxAsvfbwfz/yuyBfMBFT/ipmA8QUzAXX/XF5Zp9o375D42CZj+44gW8+yH9z8lfPEbuvTG3Yb47VDPD/WnEXuX7v4/e58wROCdbSvOMT9Kw7x9geU0/7+quRTkTQ/E7GKtMe5pru5q2cbVndPXj3bsHorP71h2wqlMsqmTbYDk31tyvxq16MZgR8V4a7xmMjqD4tsx644T9r923G+253d4iRbbXLcWtzdsH1YIK03f3uAU3ev2HvuvlHl9v7YpMoXrPjU7UNLT49+6e4ZrOdGv7YduN5WD27378X++EU22c0I3NaUQP/m6vXjObKbrRlrolXk/r3Ybp/rNnbXbeqjbrP9dtWzfU/eXsSy7zTPzfdokbfne3S3mOa5+Z5tiefme57fk8fzPT+Ioafme3T3ssAn53v2OfTkRMs2Qp4dIdHd7NVzwxv7Ek8Nb2x35Ysi9dnpDa31K6Y39sn81NCTVvupJZ48vPXt0avtGfLsjnzFya5vPwuwLfFkg+rt/f5ye39eQnezRc/OS2wvyp4bd96G8pPzEvsaz81L6HbW6rnrSx3vz0vo7gmrZ+clflDkuXkJff8JK90/uPbU+fGDQH5yXuIzZXR3dNoXBNF2/uq5ILK3HyvYl3hugvQH40RrWaK0+/fJfrjObdvXBPGmkVnk4RK6H2zJU0W07cbOTNcggt2/svjDYJPuZq5M19GdXya/G4m4faJIvfs6j7RNkS/4kpXuPmXVbuueud3un034zHaszzcdqSib7dhkq481cO2jPX7VgfbtFQDXmXcvtW/yiXPE187U+y+Yf3eO9PL+ve6uhhwjc+teV2/2+GPq26X0uTP9Log+84repx4I+MFbfp95IGD/hv81DFns7k0An/pKAK/VOVBfq+GMZPpoL9WovH+x3srjfZHdt6Kf/VzBtkjr6+Q4hnnl0fzbtoSvyYijTftrJdareZv3h9/V2B2VzoxIf/UbEt/UsBdrCDXK5hsS/vb7gfX9R7R03H5qiSc/EbRtzzVHVe5fvPq5Y8InRft4MTnut+PVGs7bXdxerbF+qbc15P0HvOT9B7z2X0pbY2zHNcxr31ozLn3s4VfnyrsNsf8G3zPtsP2+YlufFbGmj7/2tq/R+SBIf7EGH/E78NUa647lwPJiDT5u0seL36zsje3oL347s6/X5x2Tfa9+O3PdGpuXF9uD74EcNTZfA9w95G7re6Rq9dUa66kh/eZT15/6dO+6vte2+2rV/obn7lMAj294bPsc1RqO6ncvQzsutr/djLdvmb7ijsnkC+6YrLx9x7Q9sJ2BNe+Pv8Bnuwmkp4/sbvXyc0f2R9vx1C21le2LqZ76OvSuxHOn2A925clzbPfZm+fPsfFTz7GxPlSt335M6MM5tltjf+zoOizfPGL74Sv323kKPgbQ+v1qif6JfWHBxXDd7It+wb7YT90X462bB9pLPwx2s/Wjf7PXflysrFuvo0/4azWE7bh/NeXLNVp5scYa6DyS+8UPmUtnVZ2/2qZrddGB/cUalRr6+Pwo21WTdwvZ9P428NuLfdO3X57ygxLP3BOb+k8t8ew7PnYzC+snrtx/u+O79ty9Q+6pj8xtt0LXqpPjoOpmK+r7KWj6dgpu98WYnbQiD/dlX2PdchRrj9tj+73N+w+hanupxnODgtsKT40J7is8MyQo9e1Rjvruzf32UZp1L3tMez/87KjtZol8fSnEx+Mpa9sl8LH/az6z3a3z/jifaW37BUXeo+FlbIrspiPXq59Lu5+w1mdb9LnL++1iSGEy8+4rcB/fSbwtsWYQ5f4r0J8p4aypdn9pK8ptjdeUWxmvlTAerbi7a/vMjvDUmri81pzORJnXl3ZECp8Iv39+5zMlYtF4TrS9VkJ5fZfejX59qgRviVMdb2/FqyXWW2bk/lNYH0vYbmT0GBJYq1Pu1/t9Yt2yc26Nu/T8eNO4L7EWlN7fhX+mxLj7jIb6ayV44c79RyM/UaJwg1Rud6+X+0wJXSMSReW1rVBWpOjdwwafKsFPot09TfKZEsbFq92t8flUiTX5UO7P8M9txd3F2nh7K14twQfn76/CP1OiMaXU9LWD2vghaf3Frbi/NJC3d+S1EpVnOKv39mKJtXbk/qssnynB46h1tMc70rbv6Hs7f+vgTnWMF/eE74eN8dpRvVs6ev8VlU+VWA+MlPuv1H+mhKxnpsv9ap7P7UinxNs78moJIcLng+cvlVjvOi334/SfK8GNUZO3d+TVEv1uRfFrv0XCQS238WIJnvR8McLvduTVEryf+Bjo08eZsxvA+ILMaWvBam13N0ZzufbTJcYa5rufyH65RH+pROf7613GayU6W+H6Ugmmbuqw19rC17RLvX8xyaslymsH1dfpWf1+XfdnSqyvV9X7EaVPlbj7gvPdd/k+VeLuMajx4kFda0LrkJe2opSyIrzc/Qp8qsTakSMw7GGJtnttnhSGUso3Tw0+vxmD3Bov9bNS1wDEMc1QXiuxzvAD22sl1ocFj9F5e7FEoUR7u4S9uhV3cwu310o02mLI21vx8aD++/Ff//in3/72H7//9U9//Ptvf/3L/x3/8l+z2N9+++N//v7n67/+9z/+8qe7//fv////5v/zn3/77ffff/uf//jfv/31T3/+r3/87c+z0vz/frld//FvczLi12Mu2v79119k/vdjhuPXYz5Fjv9ej/9+/M75bf5/8y8fAy7jVx1d5/9w/m33X49/cvv3f83N/X8="
|
|
3977
|
+
"bytecode": "H4sIAAAAAAAA/+19eZwcR33v7pzbPdfuzh6S9pB2VtKuTuuwd2Z29tKxuqx7VwKMbLG2FlsvsiSvtL4IAdlASMKhixAeLw+wLeEEjEPAHIHwAQOPR/CEHHxCMA4vTvIIkDzihCvh4xeykmZ6qrvq9+uu7l9LW+zoD3/G293fqvrd9atfVQXPn3v30yenTtw1eerU4Xtn/jNx9+TYuTMf2jh19Nixo3dvmjh27GLNu89c2jA1NfHQ+y6cPXf+S4tq8H+1Nbav1DgDqqUCClABBamAQlRAYSqgCBVQlAqojgpIowLSqYBiVEBxKqAEFVDSHujM5bGjx+8+NukMMEUNWO8A8JrBe6FmxBlkAxX1GqmA0lRATVRAzVRALVRArVRA86iA5lMBLaACaqMCaqcC6qAC6qQCWkgFtIgKqIsKKEMF1E0FtJgKaAkV0FIqoB4qoF4qoGVUQMupgFZQAa2kAlpFBbSaCugmKqA1VEBrqYDWUQGtpwK6mQroFiqgPiqgLBVQjgooTwXUTwVUoAIaoAIapAIaogIapgIaoQLaQAW0kQpoExXQZiqgUSqgLVRAW6mAtlEBbacC2kEFdCsV0E4qoF1UQLupgPZQAe21B5JLTe2jBtxPDThmD3j2wtmz9kAv1IzPJOaDoXAkWqfpsXgimapvaEw3Nbe0zpu/oK29o3Phoq5M9+IlS3t6ly1fsXLV6pvWrF23/uZb+rK5fH9hYHBoeGTDxk2bR7ds3bZ9x607d+3es3ff/rGzZ2eGYV3ReKHltWcubTpx/NTpC2cubz46NXnX6cCZD24/fnry7smpxw+st48qa63f10p9/8ZnrN/XyLX/zJknrqzFnFtu4Dy5f/LYxOmj909qckjjPIIuh1Bz5sNX+nJk4vTEphMnHzKGNMH2iQGf6Tkz8JOVH2yrlree+0Pml+k9rveSnJzwPP7Umcd3nbj/PDtaQyg47Jgcdv3M0tvR4xNTD818tOfkuwzgxzccOXJ1+EZLTAtPbT9+5OpfPYpGraXxShNG8/yYAyVqlP43yDLG9CTEdtn0JGyRlhk5326lcYBt2vIsWBEpy5NQ+cl9PGfCcsSZ8iw3Iz7KzYZfIrkJU8pNGJGbCGNjLI+ixqOPWR/VGY8+Xmp03LNReoZHCMoa5SfGTp84eU6sMkGr+9l0acvRyWNHZmC/97b3viH19Pn3L1pR/Elk6zv/+fCPtodzzxd/df4XH3n5+y9dsH642fjwL257+W8+nrrw8INv//Trcr3piQ9f+Oa//uArX/tI6kcvPnXfN2+xfjjq0eFukTWklu+3Mt/3OUjaWL/fJvc91//tct8HrN/vkPm+lu//rcb3jx2wz8dwArOzzPd563ryJ3/nz5pe6M18e+TzH159cf6PFw+88KltH3jp51/9dwHddpU/rLVp0vrhbkPShj4ZvO2ej/78RGzro08/8Py3dk8n2ieeXfjWS7d9+dzC7x9+i/XDPRKScuL1p5+2fr9X4vt/nPziSev3+yS+/2lm1b3W7/cbAxf/q4UoNibF4oj183E5DeNE5ICsxbJ8f1Due05DXiH3fcj6/Stt6F7+F7Z++Crmw9pHM6ferb29dtezj6z6eFx/9vsb3rdxU/Frb/rNhakPv8/64W3lD5cPaC9d+s1fe3PN337wn97x0+WfHVnV0LmhYfU33vtXbcenXj3/JeuHr5Ybarv1+0OMpKyV59TtDinFfXiHVLucDT3ssF3uw9c4/HDb5f2Tp6enjoujqag1mgpWIhFTYFJXecH0d60S0wgb0C+P3jc9cewU24aBNROS7Ji+9+T21xpw+tiZJ3aemDhi/CFS+ejSTDQwNcm3HBG3XGcdWl0lThN+oFk/YAK7J67089zOMi2vBUnFps1nPrRlpk9H7z5+5Q/v+szEw6cn7zo8ffrY4bsnTx84ffTY0dMPzbDt9OSDp1+oaT3z1K7Je09MPTTTzNTMLJ4N9aAnMfBJHHySAJ8kwScp8Ek9+KQBfNIIPkmDT5rAJ83gkxbwCUzreeCT+eCTBeCTNvBJO/ikA3zSCT5ZCD5ZdEWwZvJd9548NnnNJKj2f+ZkiN0rfTdLYT5xYO26HP5X+56ePVu2SgbZu9hJCTBX7OLnil0Vk1I2Z6LJTRcI+eTOGe6P3zNxnDVUB0yJg7JJrXx0yDBYOyDgDN/XQGWeg4w+wz3MOCCNoLmMM9JkrJPXDJJy6JZNg0mnHLrhlEOGKOXQjdPK2uxiuWaTULOL+WYXs+O2sGEJ+wyAXPqRsvQyQYEIfYlAipce5+ViiRG+QU0u4UexxOrWj1rH0l1htFOBgGW3m2XbJY9CkvTMbzjVe6BEjmmIlrrZ+DwpSI1nBIzTi03rStAPcsZCdyA2scfHpu80Nxms2Cbgo7hI1oyPUHsZf71hL3dB8EGAFhk2doO6VoqJZyYMghEdEvXouUd4xiek02njUxNX0mm8FZsJGa919aq723PyItOvx3dNHxNa/i74o7j5oyD7EZ8WdDiTaYDbS1yREDY2fpJPEzJPpejWDVqHGsQGJqzPlhppJ7FNqbHalBq2x2V53GuefTHv1PBLCEy/EE6ZKGdI4WH4kyTI3DgiRiWZZycjhu12KkcJI68h0JHgc79bsjLPXfSce3bH9Lg8a4MGa3/NOWs1tnVuVcmwIyVqXL5B1EjMJmrcUaEGKG0ps7Rp7E+OhPVSmUnBekqDFMA9PECjFMAkD5CWAljEAzRJAdzFAzRLARzjAVqkAAQL5a1SAEd5gHlSAPfyAPOlAI7wAAukAA7zAG1SAKd4gHYpAMHCdYcUgGDdulMK4DQPsFAK4HXYVNMJwHEsjncC8HoeYIkUwAkeYKkUwGt5gB4pgAd5gF6HoaBg2rtMqu1pQQARKNYaXuLzsJcIcJFMwnYWulwU8QewiH/5c18yfOH/Br2aIOWxXM61D8mnPJbDKQ/pEjSIXkg2KmClxgq2a9z0ewXrsoHmVvDNrUBm9CtYJ04O2UgPmVZi4K30kN30kJ1KsGdhleOzmeOLlRCi+fSQS5Swl21KsKdbCfaoYS/nKyGX85TgeLcSCumDXHbQQ7YoMXA1QtZOJWIiNTiuRsjaM1cjt9ZqTFSNiWahJUorIZft9JDLlGBPhx+hAZhIbecSqanKz7ggJ9perH2154TnBj59CCdTV/q+ZW2ltTsr2Z6BidaVDrfOLFtTeO7F1Hv+BGLsSp6xK6EyaeONVWh2liPiajkiDoK76FaBu+hWgrvoVhu76Lh+rZLtlwwNmVY49WCe9rpjDAap0UMm3EGW641EdmE5uOP1kPUJUyhybXWmWPsdmRURyXqftfJKHPd/RSQusyKynO0ax1jmab3EAsxyRFYYyAZ6yEZ6yDQ9ZBM9ZDM9ZAs9ZCs95DwlhGg+PeQCesg2esh2esgOeshOJczGQiVMsA863q0ExxcrIUStSpiNtBJCtGSuWqJOJSyRGsFg1enOavb4oONLlRh4z1yNiXr8CA3gfStYajMh2uBVrP02VlftKHlwM58HgLMiK2SxpbMiK9BCTTBjssJhanN19vmbvvKXdf/NXc7aeUILS21KphDXgKnNlWBqcwWY2lwFpzZXyvZLhoZMK1jmv9cdYzBIjR4y4Q6SS22aHDWU2ryDT20yY6skNwWb24q1/9d44W+RPV/Q5t7brU/i4JNEBa3c4r8iG/uMjbDlz3ay43t89wlWMBkzGLxSDA8vDl3dl2h0kUEsnarJyFkFsnR4g/UVRtFSpVecbgLrZfmK9BbaEpnENjfOSJiQNO3INjZ481uXI0Za3mlHXESXnBVJyLuILtgNtBMlzgWHcLQjFr1Xrtk41Gwv32wvwqrl7DPIIqGnJ/Sa3D5nQFYUa/9TFM0YGuYqPCqL1X9Yx9OFiJUkiUPyYtULi1UXkVgJ+NvlZD2ml54J1xUQ4aaTfVej2Pq9E4BXYpGsE4C9WLTkBGA3FgY6AbgdWyJ3ArCJB7hJCuAhHmCNFMBJHmCtFMAaHmCdrOXlENbLIdTxCDdLDWItD3CLFMB64S7EwMKyXQ3M485LCbBuDNDuAD6JsWp3O/uaxKo8HK6kyl+Vj5QpBr9sPinv06aT8sbumZiaPDI2edfU5AwxoZPO+sAnWfBJ7oLUaWEzIelFEKsOfKK5OaXvooeT0q6EzhInb0tWQLg4Bivu/8nbggoIDQnkJE/HAY/BSvDNJthxW9iQZ58BkP1oIJdgwXj70F8MCEqK8rYuP8+PI88FcoFecJro4igsaDriAspqBhky6+5GzJFQZ1/jnsZZqeOeMjyLcX3VHPRVw4Ub6asGzhUN4xsogM0Cp1gF2PHwMqgV0y8b4EPYgOPYgV8J7I4AJ/6zBpFWjwah9mPyRjABG8E4kREUWKM4YgRzcmP+Q6jZHN9sjh03bAQT7oxgztYI7hYZQUaOPJnB7ZS2C7MWcUp7KzBaFVNgUcMcq64yXIdb09jXvIpiDY+Ql9OhhTxCv6w62JvWQxDxCvamVRdIdqGY/pIBfhgzrZzW6XQRYBdpBKj7FwHqdBHgIqIIMOMgAsw7jQBF52nmi4F7ee1zcvAkfupuWeru4aQu7iCCieOeCYlg4v558Zqggl4clqcEynbdHdtxSNjGeHdPJhnwarIWOTDWbwAZAhrrEsZBgR4miul1BvQjnNIknJHR64nADfISnvHfVGfkTHWftyvlKjh8s33suC1syLLPoCAINdV9LBgvIrli4Cwv91kHpjrLjyTLm+rfwg5fp7IHOvvaL3t7EofLSwptWF5R+/w/XL4PpRWsL32oWOvuxPqXAfI6OcyMA3f3IVBB3Li7TLHxzw3oj+DuzrliGhPrUSxTlJEQ30RlEIjx6OMe9jkYgNC/OOIX2l6GqL0bOj7numRwaBzrZFYiLWEgvoJDZJQzhwltn9T0D6ZJH/sa0l6WqL2sw/au9/g0ovawjEcC8c4538PoHOydE0TeOYfTymOGrF4qScqM28KGAvsMgBxAw+g8C8a7noFi4Fu8ZBQchNEFfiQFPoz+hnVEOUqvjWXKBV77O64nqVuEk9TGZw3oFzGFzSFE8CppLrQrD2tXjki78nh+29psgUi7hDLJjNvChgH2GQA5iGpXgQXjRWSwGPgXXmoHHGjXAD+SAV67fsAvDxFqV96ZBFOosaGq9kr8M/llAUSJC8XG3zegf44pcR4lUAIZ1RZ3Psi5amVtPyqg0SenFrB1GvTdOg3C1mmAyDoNocplqqb6ZKWaamLy1Np1uc2Td009dPL0+TO/t21y4uSGqamJhxjSDcF3eg6eP3Pp2uvnBEVHuXrhnY0Xxc3kuGYMURO+n68X/71Qf9FFp2w+wZ8iGjZAFNcOsK858/iGlWHEUOTxg3H7+x77EOkaxecR1t0VfVDc6zkoB5fksoAVXW8ybBxpssVg2iDN12BGjt1zDEzzrgcpKmTWKM6svmKw1Z5ZWYRZB/E5tJVZphSeiVnQsB7bMwUuT2ZlZmRZudX3C/JWOev/jCwrNyOTrHo4764AJ4sU4IB5hoKXApxCMdjrYwFOsJtPPROGcqaciddCsfP24WBwNchX+yqRhHBdqfHdBvharEoke70IqcnWGDrJTeVE9+YYhZGHhJQJ9nuertYgV2XmeXazvrHEkwEPFZcJYcVl428Y4MM4w51bLs02JM+hy0POVVwH4/h+xGMUfPcYBdhj9BN5DMEkuZ8mjh8ozhgfKJIv4JH8lU8lYvks1lQfGP8Dcf5FV10jjeg1lhs0Rdn97GuXPFZWLILX0DYfvR/M7yArO7umj1kV2f4zjb96ueDAbuuXRTEFc9O06Jbo4JgRCf8pxq92In61s6/Bu2m8e0lT3/1dHzYI7PGOxhexuiQnAO/H6iWcACzDJhBOAD6FReNOAD6BxRFOAM7wAANSAL1YassJwPd4gCEpgG08wLAUwKd5gBEpgHM8wAYpgJ/wABulAC7wAJukAF7iATZLAQhCoy2y7oRD2OatktbA2cpb3S1sKxaDNypv8CpNwdHaKFG0JhjNKGJxt7KDdg651Skkx7WtRFzbIhon04qFa+ZOIV1eS0+F+fSQK+khO+gh2+khb6aHzNBD9tFDZukhV9BD9tJD5ugh80pALqeHXEUPOUAPeQs95CA95BA95E30kMP0kGvoIUfoIVcr4c420ENupIfcRA8ZUwJyM5fGiVV+gmm3GN9ezFnaLQZDYkkzweaz9msHrzjYpmy/+PM5+TJ8duCiQvy8Af4FjsTmMyUtD5lDBnXkmMrKqT3I+UPgkSmS5w8l2dcuwRfoOJkp380DaFIAr8Yyt04AHvZ6qMUqbCukE4CVwvNDQ0cNrn4d5Lwg0RCWm3AG5Gf1YXhWHySa1Yd5iQyCK1IRtmuctDJPQ9YvQ3R03EJKx5B/dAx5pyO4dBzhm4sghoSBbKGH1OkhO+khG+khm+ghY/SQ3fSQHfSQq+gh0/SQq+khl9BDLqOHbKaHnK8Ex7uV4HinErScP1etug/28iZ6yDVzVS7nKSGXbUpA+hBfBpRgT1oJS9SqhNloUILjHUrYSx8G3jNXHcVSJYRoiRIeMq2EEPUoMfCF9JBr6SEX00PGlWBPqxIxkRoz3Q4l2NN9HTkeQFPPrvL+pr0XT1X2Xhw7cffZsxeBzcu3ijc1BEaB90fF74drL4o2KqC7GEadbYu4tnRZW17uqf+CeD3oGFYj7miZoAbZJtXOrRyaLkUD+BVE+YWtHIKFjkHhVoQUWaX8dq+V8vfzAD1SAP1e7xPa5bVWf8xrrf4Gr7X6W73W6m/GTgt3ArCTPxXpMrgYKHlGxG75xcABeDGwQLQYKNjYVgAXAwfZrnGKPMhqH9DcIN/cIGIbBh24KfeQGXrIFnrIZnrIVnrI+fSQaXrIefSQjfSQbUpA+iDqASXY06OEqPug451zVceXKaGQarCnQQlLlFHCEqWVoKUactmsBMdbqpaIDHIhPeRqesheesg+JSCz9JA5JdizQIleLqeHXKGEEK2kh8wrwfG8EqKuhgmuV0LU80r0Ug1a+iDq/UqIug/2crES8eVSJZI6PkxSfJhK+ZBeBuc9A6LzKo0VzEPCqy3Cqz0fYL7XutoyhKw9DctiS689DVu7M8z2DFyXYjvWdzPcsXU/fPDcyMCylyEmDPN8HbatFBhBF7OQI6gcEXFXiSIlQGYpfMT8JMRTsfQkzDZ+7Zy87djZWg77JUNDphVOOwwKH3bHFhhw1B1guTSBkTxGvWZLcYLdAe8pYe1G+Gb7M8MFlykkKyRFxl/gzgxntsoHrxWXCFa0oQ3zv7D8O/PUtf5efX3PyYsMVywHUgs7IL7AJFwwCPLnXPcH2GGyJgYbaGk8cG8HrpyMCRCQo06wTJ3Ff/VH0Z/9/jtDf/jXL5144CfLL/zJ1rd/7kMD54urht449ve//cNdCHWuHOAJDAoZ8SA+4iA/YgnyWYRo0IESSTrdJPsaV1IAO7khOTsYl3dyiCMbJCqwGMJp5dGxx9zZ/iErG0bYZwDkBvSseZNn4dV7QzE8xkvGSJkSt0u49BHGP1yrjgvvRmInp0IBy6/J6XgN82LgbQvGYSPhV4FctT+GXXRBxXCxsccAP4RdDAIyP8mfIZyyde7rRBJjfIT6x3XF8IThDsAIJwXQw4kRWycK81NYmD/Tp9d6tlJYvSVI/ZRR/zhjsVk3eg2CO+lxnQfxBy3iOv8s4jrb0H5IGGSNO+DzsF14Bn65ge8octPtCBvbQ4h218uAfdmE9IW/PWYj8yGIKOzLQQd9GUX6wt8Gu5n5EELcgiDyt8Ey9Nri+VDdMNSnbaI+Ma1Ye8UcmbXN80G9EahXO9BebeN6tZ351HOvolCvbpXs1Q7mUwhzJ4q5nsO8lfmUH+lOuZGCp9nsRnu1k+vVLuZTz70CT6/ZI9mr3cynEOZeFJOffe9hPuVHuleqDns/D7BPCuAgD7BfCmAPDzAmBSCwTONSAOsEEUiqmJhnBHLnwA0zeLTAq2OE9cQ0u4HMr3EDCRdjIWMg73Y5kO1C4OhXDOD/DgGHGN8nhN5hjajCyDw14vvpahE4KgsTRWUC/oYr/LVQI8p2jeM98zQoSKNIacGdGLmdAAgS81EpgJt4gDopgAew28mcAPyKQM5DxchnDDn/PU6jQywXISVAN+NxXA2zr0mcmZeUE9A3yWtH0v8z85IorSzUSLFd4+jIPAWjjBTfXAphDQPZQg+p00N20kM20kM20UPG6CG76SE76CFX0UOm6SH3zlW59KGXrfSQGSUGPl8JUfdBiJbRQ7Yp4XuW0EPOU0KI5imhkG1KQPoQuQWUYI8PclmnhDvzwRI1KMEeHwZ+Ez3kmrmqPa1zNSZaSA+5lh5ysRK0DCoRX3YqQctuJULWtBLurEUJ9vhgL5uVcGcdc9VDtikx8CYlLJEPCrlUCSEKKOF0O5SwRD6Y4PhcNW6BuRoTdSjBnm4lOB5RQnv6lDBuaiQifAj/O5WAXKNEfNlDDxlVAnK+Er6nSQkh8sGqV2tgZrUQRZQIYBqV4HidEpbIhyg4oYSjUCNB1jFXhahNCSEahyBd3aYhOACBqfMmvU3juUflrtMIurhOY6YNl/dp/PKUTJ+xdLcMbHTWaIlpoVoyXQ0XlQgXqyXTszpHs7paAlgtAZyFclmtMZvV7Gmnh8xXa8zmWI3ZnC3DUGMNUA2r3jBXTbAaZRhtSvTSB1pWN7vNavaoUUc6Z8P/avl5NcyajQq5ZK4KkRrRhhr1zWqUU/pgNvS5GhNVK4fnmlWvVg7P6oqjauXwrKZltXJ4Vsfq1crhWe17qpXD1VKQ2ShE1cphOshq5fCsdhTVyuFZ3Us1KodvgSBnfeXwG69D5fAb3VYO+3c0uPX61TKwQXmjJaYFRY8GByt5o3xzUUTeow7CN/eQOj1kJz1kIz1kEz1kjB6ymx6ygx5yFT1kmh5yhRK0XKKEqPugkG1KQLYqoeMBJRRyjRIK6QPHM0qEBmr48bQSvcwo0ctuJYTIB47PU8L3BK77xVauJkzOx73O4/R6TDxbjvQA7x8Qvx+tkZ9d98hMrmu4+6oZxhXMCNY3mT22kfLl17AUJIikIMG+ZpkBR5B8QFRuSv4W+XxAFM4HRIjyAVGUVhZqaGzXODoyT8EdQRrfnIawRnNgr91DZughW+ghm+khW+kh59NDpukh19BDdijBHjVEvZMeslEJuWxUguONSlj1TiU4Pk8J9rQpAemDJQoowZ4eJURdjZiouRrAVAOYagBTDWCqAUw1gKkGMMqyRw1RX6YELdWwRA1KKKQa7kyN8F8NuWxWguMtVUtEBrmQHnIFPeReekgf1nv20UNm6SHr6SF76SEXKNHLfUr0cqUSQuQDx1fTQ/bRQ+aUoKUPVr1fCXvZPlcV0gdLtHyuWqK9SrCnT4le7p2rfjyvhKiPKWGCe5VwZ3kldHyBErRUI7BerETWYKkSC7A+pJ58SJD5UIbYdubyld3C21/LPN5Q1LbzBcEBuZrct/LbbUsdEhQba7LYZjqUgQ0qGC0xLWDVvmAhMtuxvpvhjv1o5+5P//q3f/iP7hgEfKTzH7GV3ta+xuSI+OYSRUqAQaZd85MQT8XSkzDb+BNXCv7PCQRHl+2XDA2ZVgRiXurnYTK9KT0bdQf4xPjUxMlzJp1g1Mu6GSBQ+QluBhAcjxBABpAwvcYp/nBR213iY7Fpx3XvkEVDA4jBkNwgEJM3GMhpBQH/TitgaCV5WkHpu9uhxqQ3K1UBq4CzChDevORUueFmIogdCpa/O1A+WUU7AZq/J3dOnjo1fs/EcfMQGe+6U2B4A0X93wzwKc7wBtmOgsZkbPpOc6NJW3cV/Ui5u6P3TU8cO8WSa9QExHU5WtQeMHzFLrABgB47HYxIu3ytU48dWCuQh0OCPmlF7Vc9xx81hpvmnYLOsSbKcolG5IPsa/4F0XE3QTToE6NEPlFDaWWhhs52jaMj83REIsTWEdYwkGEySDuLWQWsAl5XQG6mTOhoNWfGzXtDBthBzmbrDmy2JPVMs2dbSKNn9k4whnjog6a+cd4wVtQ+aHjob4ANAB560MGI4iIPHcM8dLyofcjo0zfBGV8l0npKtt8BlqgioujfMMD/gBONGOpRNPZFgcQ5ixOoDheLsa85h9TtkxgimRNpT1Qcg/0RI3XWQxBY/S8dgvDUtV5c/Z89Jy+ynd81fUxgh/Zz1GVQu4hyPV3sa7BF5KKwuFwgFJaPwuLO0pVeorA4SisLNRJs1wQZHjtHleAbS6Apo9kPeN18HCOulobilA3FnSkDRXhgeABOygibSVR8FKfAyWtmCVee344/u4v/NCWnfrusY9xV7laN9ckeRKT2snyyPNuHMG4/Sw/LszGGHmJ611jpXcPSoewAnjcvGDDv1HBGPOnARSZ5TUw6c5FJB8HG98Bm7YMNUQSWLOqfNcD/CYtDwXx6TBRi6ViINRP2vSSQarokSNJzimU2Cb60cOtl4W6eJyHcpqgJiTrjmFpoNkEnZrdjaDibRGzkHVgwG5eYQEUrkScSwOl8lgeOtiTXPAPy0VYMjrZ0omgrhs41TeepPcOepzZxZNPEyVPTx2a4ZjkljSG58Jy0WO15wVFoa6ETxS+A+IuA89k2Q6eiXzBDi//PchKble6JG21tdN7alBBfI29PEoY9uQ+xJ5YGY2yfuciP6bN1/sXOQ+3mX7p5/mXSeituDFILJz2wvmIylrgsxIxo7S9ue/lvPp668PCDb//063K96YkPX/jmv/7gK1/7SOpHLz513zf74GFenewIR0IavXMcJINKIAZS0u83yhvIJGwgE0QGMonOvyzUSKFeLcXaLqA599dYhOkhR8gg7Wa5VcAqYBVwrgNiM4yEaIZd+nKci+mZ6kBwmSXM9zPsbJklfN3bu+Tx1poG+wyEDm5YSdhnIESFJYmi/oQBPsYFWuxiCXAksakaATmvOCbb84iJBaKev8qIjH8LrFUNGmwpPQvJBjzlNt4BhlVhd3GJc9VMslTBgoGARNllxHadJ4iu85hKonj+BIv6EfvVxaC92IbF4Hc7YH7CP+YHbZkvqN4M2jI/KeITQxWO+absj4s6UpeLfDarqFpRn7JnfsCd5geK+vSN1fyALfM1hOQBiWUkDdV8ZiEpBGqYG80POdX8oIA/oaL+Rnvmh+wrIcNi8EcdMD/gH/NDbjTf/k5CDdX8IJqdrZMw+0Fb5kdQ5gdxsx8p6u9gmI9FiyF0PQa+vPGyjUECHMYFg6WPSZArBCRaP1FJtJ66MohSpvXsWYlcqPEkDlwe2YBnQ8XZ2AaJ0ekeYwDdNgZ4D1LrwYpSaUgSWzxCvqf2Q/5v8QjJbPEIo7rjZHoTxN0StYAbyX7gqlM34s1eX+o8iAp6DLv53VcJNgBH1uT4SVGKtXdAb+oB75jCzVx9Uf+wA++Y9M871tt6xwae0PW23GnkP2pgqcJpQyPLKefxVsrWICZRg2i6nVu44P9Jh96xHvWOMmNiYn3OvDKAlRSDG4GVTCjFTK+J6PQFZqOh+6qLQTH4lxglcT6gmK2Y1ouogBiRpInf1XIhL+VCzp2BI4VIMlU/aBWw9WGcpa1zLY07CH1x2xO3tT3Ps8EYLIpBouqqIMx1GR3eKR7M37rS4aC/Ogx1BBhlArdUqaL+XQfuPObRncdhd56ydef1qOGXiQEYqnCi1GAKXpCpcAp1qnGJEhtHViJmvxHB1Rw86s61RYv6T+3VQnOTltbR5FQAqwHTsXKuCCjWmkexjsFirduKtU3NleOy+BjLdaz+LopuOtb5/DNLe2PbMZSl9j5/vol0/hz0b/4c9D5/1oiWBxnIFnpInR6ykx6ykR6yiR4yRg/ZTQ/ZQQ+5ih4yTQ+5QglaLlFC1H1QyDYlIFuV0PGAEgq5RgkP2aGEh2xVgpbNSshltxJWXY0wSw2z0aGEQmaU0PE5K5fzlAhg+CQLc/TmOokpcghpz/Saq1m383GvA9aen2J3sd199uxFYGF5TLywHFoNvH9A/H645qJgt1uOW4BmH64G9qIJ16xrsKrZhMRifRBhXIJ9TbLc0sjivwKsdqr1XN98QT6DFIYzSCGiDFIYVQ/uTEGma1i+rl2iNiyCMDXiILRxD5mhh2yhh2ymh2ylh5xPD5mmh1xDD9mhBHvUEPVOeshGJeTSB+O2pMoeMsh5Sgy8TQlIH8xGQAn29Cgh6moEMM1zNdpoUSKA6VQiJlJD1KvRxlyLNqqTlOokZTbKZTUKrkbBs5GWaoj6MiVo2akEexqUUMjMXHUUajhdHwberATHW6qWiAxyIT3kCnrILD3kXnrIenrIdiVo2U8PuYAeciU95H4lhKhXCfasUELHfVDIfUro+JyVy9X0kH30kLm5quP9SmhPuxLuTA0dX67EwBco4c56lTBuvUrQcp8SA88rIepjSpjgXiXcWV4JHV+gBC17lfDji5VIPS1VYk3Xh/ylD1lWH6qXwZRoQHRlmbGz4ZDwxN/4RzxvP3gXX8xfalKwtSEqi20eaxnYIJ7REtMCd3cM0zNH96j33Qx37Ot7//Kub//BB8D0LH6XLPCR4OAYdiuRx/uvziMnwZiehHgqlp6YTse4dvrLdr5fmmy/ZGjItMJph0Hhw+7YAgO+wh1g+RI/kf7yFyiYjguElJtvL4AMIGF6jVP84WL8Y8w5gDe+QxuK8U/Nqg5tKsb/eFZ1aKgYf/YGdgiEHJu+0wyZtNWdIHK3+itMQIKTj+NfNaiwC2wA2I63zcGIQtJeNFSM/6lnL1qDXPwZ9nHzoIvjm2/45kFPNzMGgb2qft/MuNvPmxklw6q9/Nmkpd7UIKePBpHTR0PWZ+NlRBc3M0bd3MwYZvsMby8dw05LD9vdzBgy38wYZJuw4oYhtXDSA+srIfZtXBbCxs2MQ58M3nbPR39+Irb10acfeP5bu6cT7RPPLnzrpdu+fG7h9w//OjzMq5MT4UiCxIfNS1qrFKm1CvhnreDD5qNs1wSBp/FzhCyWNX5upIfcTA85Sg9ZoIfcSg+5nR5yBz3krfSQu+ghd9ND7qGHDNJDgnfWXOc7KhjPKL6lIunmloqkxNzGiBhdXsISMhFKMBVJJKqXsNTM9UtYdvt1CQt3uzgsLZIXGvTIS0sKlpY4kbQIDpWPg9LSxXaNkxbmKXjkcBffXBdiYRnIFnpInR6ykx6ykR6yiR4yRg/ZTQ/ZQQ+5ih4yTQ+5QglaLlFC1H1QyDYlIFuV0PGAEgq5RgmF9IHjGSVCAzX8eFoJhVxSZQ8Z5DwlHEUAu3RvncRUBLt0z/Saq9mN83H7dLRraqnc0a5dLo52XertaFfmTh/wdqE4SmUsqxDH2ksQtZdgX/Nvfv/oHJrftyvheNQINZqVCNvmV6PqalRdDduqUfUvI3vmKTFwNZJELX5MJ1RgT48Soq5GANNcjTaq0UbVnVWjjWq0UY02qtHG9aGlGqK+TAladirBngYlFDIzVx2FGjGRDwNvVoLjLVVLRAa5UImSp730kD6spOyjh8zSQ9bTQ/bSQy6gh1xJD7m/yh4yyNX0kH30kDklaOmDCe5Xwri1K2E21NDx5UoMfIES0UavEsatVwla7lNi4HklRH1MCRPcq4Q7yyuh4wuUoGWvEn58sRJT/KVKLG36kCfyIZvlQzVem/D0q+QFz3Wxb7ZWmS4od0hQc9sui22mQxnYoILREtOCpTvtbM/Aetx2hycVfnbJprd+4JUXwXijnWdQe4VBzrnKFjxb+9ojR8RHwJMKu8CTCtvBkwp74JMKu2T7JUNDphVOzA0KH3bHFhhw3B0gd1LhAla9rndNvOikwuTvIMfeXf8ObSgmf3dWdWhTMfnYDeyQxDaGhJzWafImNeH/NoYESisLNVJs1zg6Mk/BI0oktyIxkFvpIbfTQ+6gh7yVHnIXPeRuesg9sMzCp3SCfiOFnNI5bgLiTFKqmPyc/SmdSeCUzvUOLFZKdEqnMaZD4j59kTdJC+hO6VzAmd4kayIgIvDcTiLcjrOvWYxNEjG9kpHyF+RNL7KDLOnfDrIkEnxK8vbzULML+GZNQZLXqQN3rmYPiw50qhc9umoBC8brQm8x+S1kx12PaHpWovPtZPO96w7YwwP2sEwrHb2U/Dq2ZzhMZLbDpjDbcnYY015EfHYY4cw15GbmCur6AiJdbxcpHRRmmZKtWGohRZ+tWEQPuZEPI8m4fScpt1P+cTvlndvVs79mdTayevYXHaQaZ39llRB1NbTHh4L2NUrQsnr216we+BIleqnGYXw+cHy+EgrZpgTHfRB1NXaY+BDA3KSE9qhh3NTYFbF2rpafrFFCLtWIgruVGLgPHlKN0zOqRwrMau1RY+v2nHW6aoSsapjgDiVMcJMStFQjvry5Wt48m81GhxK0VGMbvBrsmbMn5Kghl81KyOWcdWfj19Gd4cvxzvvBVGxQHlbfPgG8Pw4cVh+UP6x+Quaw+uB1rxiylEQY95MfKFcxpT4JNguUXZouM+bKTCJylR4jwgrMhvcb3fsMRzJmfOAtj4KbdsMIyZLsa9x9g3BNTdT32xejcE1NmKimJorSCi5Uj4pqjI3aOu42Y5iKksVBWdKa06h/NadRkIr1bNc4KjJPwcqker65ekTA6x1EV+4hdXrITnrIRnrIJnrIGD1kNz1kBz3kKnrIND3kGD3kEnrIZUoI0XwlOJ5RwgQ300O2zlWOdyuh491KuDMfnG6bEkK0VAkh6lCCli1K9LJTCY53zlV3llaCPUuVGPhCesi19JCLq9HGHJuPt7nLzjjvR9ifRHWqD3h/VPx+fa18orpPJlFdy2Vdo5WfSYlMYtRZ1jU6m9oLE7UXZl+r5kOr+dBqPrSaD3UMqUY+NK9E3qlNCVH3IWzLKGE2OpTopRrJy+rUrDo1m43aM2ezth1KCNG8aiKYDHKNEkLUqkS00TJX7WVaCR1Xw1G0KSGXgevInoCbfKh23fKhAcl8qHb986GBys+kBJUDzvKTAe6oP6a9ROmoPy5xGL72YCZp9723vfcNqafPv3/RiuJPIlvf+c+Hf7Q9nHu++Kvzv/jIy99/6aLnStZG+8Li+s9VSntLzw4V679oPP688esLZtn51pqK8Nw/cezokYnTkxuOH7lKrdHj901PTk8e2X3i9OSpmT+O3j95/PSps2cvWOXF6NgiQJI2AX/ffMHMeez/Lu+fPD09dZyTDb3yEzzPVedlQ0dkI86+hrSXJGovyb4GQTopEOfLu/Vi/XPlQ3+bfwvu767pY1bcUn/BLQ6CM7eTtmZNkKlOYNSOMZ9KdESv2DDndt6+9w0i58AMBNlw0OCm9wdvaO91tvfcIgK8pNLge6F+A7ykUk+0pNKAxgEmG/oM638njmyaOHlq+tiMfkNWMiH2qw215wWucy3kJOms8KgjK2zx3Fa6p+XovtUqUFvLvamxPtnOUs7ybAfLHcuzW8uIrxELWI1VwGrY0ZRt5n3mm0yYd7iONrB9tjxrZPtsDTcYC9hQIvpT13p89X/2nLzIav6MqRZ+2sjhNkBq4aQH1ldMpsIEBvb1qg6x8SvMyERFy51aA2h9s5EOKo1YuSY5gU/LW7km2MqliaxcE2/l0iA1mtmucUFMM2uAgOaa+eaakbiIgRyhh9xID7mZHjJGBll6dnsVsApYBfwlAeSeJVhLzj1lwpAt2FwLnEnH+J7GnM2kY9e9PYv70risSQO4thMDZtta5ed6wWw7Vmx4qwHeyw1YY9mEUAPMJKaBbjHfRgXdShcbVjFJAOg6P80IckrPQrIhTrmNd4CBVNhdJOJcb5pYqmCOVSbzGrNNJzShN7/ETFLI8aep2JAzbmb6hgeZjIplsuCA+Wn/mB9zw/yYR+ZrKPNTEvkpzZb5aZT5GtusUDm32DNfA5ifwpmvFRu2O2B+zD/ma7bMTyMkD0iZC4YqHPMZ0dAl0rYpW+bHUOan2GaFyjnuXvN1W81/xY01+/aan3Kj+WkRnxiqcMxnRCMkYfbts8gplPk6bvZTxYY77ZmvuzP7erFh8sZqvu6G+bpH5mso8+skwkzNI/M1k0SLmH+SYT4Wx+toHA8mCLTLNqEI4DCmDZY+5kZXLMnxT1SS46euDKKUHZdaRTSeNAAr0o14BlucQW+UGF29rTDoqDDU45ZgRllfxwiDNfXK2hHxzXMakqiM+b4cE4MTlRpRojKGBglcMvlJZA6QcBcJaD4KuLFAIxRvvdaNeNdKiHewIt5cqQFDgEqxgXPbHPcYymnYRLmJe5hm+Wx92MQaUGhWAbjbJtxuNhcbzt7YWVazrbtteRzLMgEftfIftbBU4dSr1YFrEmhzk8dZVhPubmdmWe916G6b3blbPITg7DUDWMlGIXVPcaK6pzj7GtJemKi9MPsaBOmutiVQbPg9RueQIq4gVMQVNIq4kH+vff8nOYcbQhyu5FmBLq56DcMON0TkcAWHOoZAhxthu8aJQITlKNBchG8ugkhVhLXG5JABgaDIkXWtlUJrwfKG9SyBLc9uhoqwHJQwBA3VuOS8hCHA9guqOhSIvKTULZMX+RAs8kEikQ89DgdGAf6kUqZrmNWrl9CwsDND2kAP2UoP2UYPmaaHbKKHXEIP2U0P2UkP2UEP2aIExzuVEPX5Soh641y1RN1KsEcNUV+mhBA1KkHLNUo4Ch8CmIwS7qxzrsrlnLWX19NDhkqLSFc2IpSQDpV/3CHIyYSKjT2eMyLL+fwCPPWMymJLTz0F54kxPXN0uFffzXDHHtv0Xm3w1ROrIRbgB6EBH9Whc9lLHpdpesEEd535SYinopGlZhq/lqnYzverTrZfMjRkWuF0I2pbs4mz5YnxqYmT50wizGgDADn8uGBznF1afARIng5Xfq4TKOpIsXGF/cbADY+72Ge2kf9oA9sva9Z5hPmUe8h8OQRK3QaPyypxeFllo+2yyiZ+uBttabSZ/2gTy3VOIDez9OKeDrFtw6uhw+W1hvCrrG/1VQyf9K4Zrjt9Fe2xNJOlbCZbcUmWZjJcrW/jBogVOUCBMpWfcYEC5YqNtxvgmzm5zZi6yX2dKTZuLQtdy63Y133cwz6T6bQ8zFZ+6rIjzuImY2bEu4w+7waVsc+jMiZgZczZKmOe16ucrTIO8B/lWapwgjfAcgoAzfCgWVtj3oeucWZNAs7xp6/Y+EpsjVNjacI91d2NKQCucQZYwJKiBD/HCWyu8rMfFFiUq9xQ+tnXQEhuy7uT1daBxzcfvd/aE/vP8sJarAETGTl+5ouNRglfyz4pibdn5QAqaTlWE/ieDRQbj9pXLkJmhtGtgtjMHDPAd3gAT4jBT9iHPQKD0G9rRQb5jwbYfiGCP8g9zLP2FNxgO2DeDMx81M4thzMPc3abjK8OBRiGwNk7G0dWLOJvMZzow3z8PyjnOoISDB1lW3HF0gw2WhBzwJhR52T0rUKmMyCyoRKS2G9iIhE4yLrD6MFbJOx0BvQPGbaLlSgNUZOssGC18W0OCq9y3oKS2gtedjjkkdIg0Jz0o0EJ7vViIjYybTuvDHTk3o3KwOCAhGQY0FtAugE23hQyCI3Ke+1tfMENUwR2pGASY9ggDOCSfQMEt2AruMLhevODAsEdRN1Llm3bhXRhgmvYneBqjjsFzHcPOIgw7egAfDaEBmYDLNl40R8qNv6BfWCG5ZnAfo3wHw2zw7GSiElJgIc3DAMKPlgxDfwYh4uNn3Bg8Qsep6ENsOIM2yqOkFh2FBYk20ZYmnCqYcqNcU/zbNvc0xwrU85NpCO1KpTVKvAzUpdYsHGJVhFMmLoEm+YcKER5/4RoFlrfBComoPVNuBSThCEm34Ggs24sVU6UeUHEpA/z4Fn2Pee9zKLZUc7v898JVrpysrInvdKVg1ezskRFljmcVtZm83LN1kvYG4EBeFIY1LnKoNgkOWZmXf/AS0aBDeGdG0HGKpTnUf8HTJ1SJN5zLiU477sE5/2X4LycBBeIJLiATj3yVjaYcjaQr0AluMCC8RI8WGz8MZoZj0n4tQFegv/FOqI8pQTnEQkWLB79B2j6wcUjJILNFtNpA/plbPEnhzmrvLvFH1Hiu9TZg2AglPUYCIXhQChvGwgJ4z6vU3WqRZ2cNdShjyIR4mVtiYc7XOcUNy0qYJ6rD11byvq2thT4kMRo+jzKTwbTvQEsmZC7ETPWAVsxGUSNMpSr4D8aRMVkyGRR3MxJs0iKGUwkFuwXvEVL/IViutvVYpG9dOHTtCwmQIOY6OV9s+BqSVcBdfmupAtbwMgykYLXCHCRbDp8PduUKB2e7jNygl+Dze/YPfB6+HqJYNgg2F5QHdG4M2Py8iKlLNinOAtIv/a5m9FlcDIPFNPDyBke7KjKJyzDGakuqXksHOZ28ZbhSUE8zYnsgO9bmAfgiVqeaKI2gNLKQo1BtmtYkiwjYeMGEdYMsu6CHDLrmaeDPIVKLdfw+XBYykbKX7nYwjzgZgtzhu0XUgRRALSw4EAL8RwMpoUFMA0827Sw4J8WFrxrYb6qhYgWFm64FpoXn2AiPHZgrS0NamR0RrJiqEteZwb915lB3L5Ymx2SDTCf3Hhs4q5f2XjiwTMfHD+xf+LI0QffJTSgOaFUD5mUlJi3mdnK24x/vM1cN97mpXjrX8DYpWDA6FUcF0n5F5gNJhZBhRXoTMbEb1GBRfo30cl1TGLGPsRl9tNvBvMHFJn9ASQYTXCZ/fQ7ZWfbCSyzPzPXfp8BfR4rSBjA0v46mMXJeMziBGdZHh5nYAJNJef9K0h4Azz/Hpu+0wwdZwFAFec+y1d6JFMJZnzEAgnqwNJPGMmIXbIiPsgOTijkH7RPiw65qV4ZFhkQpl9IymQYq0AbABVqyKNCdc2yMrEEWiaWt88rGdbNXqpH0FDGZZUbwkVwC9+g/WaQuHAJO/1pB5WEw/6JyKAbERn0SOO8bCWhqejUeWIyAdrcBNuZiie2sp6xQxrR5FwzvSZKLn/Vfu8RtJxkWpUUgju4i3XQTWUkvlQSwJJcQ1ySjPmyAB2cOWQcnPkL/B+8ycgao8rEp98wmPTn2JTJ1Qx0EJnmDHsL+R1Mc4bhac4g0TRnGFcZa7Mjcs0uxGegppVwZtQiQzUEThQq8ft3ZJV0AI+cZpT0HwzwF/2rjD4kpcre4ia0HgGNm/gztIdZlwr5LPsjKfqFR1Kk/9nB/nKPEVvtx2B3PGLrjoWe1Y47dgdicF5qI8sp5yI47G5KIeJPQTyp+JnDM7RH0IOnZcY0AKrVgECtZswBcumaLrHxTUOCCN1BXKK5ixG0YlPAPkYQ1HTZX5yCbxQPYITL23ek1PoeFhHqCDKv3cN2TjT1bNKQRXbBHmdk012XBHlzzpb3ckjZNedY+31f3uuHg4kcUTDRj9IKLqvvR2sI80Qrr6ayRHLIrGeewsvBNcjSaI5PCbtf3uv3uLw3CEf4uStZL8CggB9VDKdAonZhKq/ZHWuggccl5DA7EcfSTgm/du7WpOA4pd9Nqtb+BAsvqVoN9fj9aLSQl/DLchvSA2Cogd3wA9/1Z38R32LhRXxNffZOPY4MNiCR6o6z/UIuz+Fje+bLblCs4/6JdcJWrJNu9gMKrplLooKbYunFPe3mlf9JYbB5TQanvdHrwWfEJj1oFkXDZhuNGGJY/qDYtJ0LB4yQwdlRlc9/+Sd/9fEd6+41jjfk1uMu7588PT113GtDiS9/as+L/35yqe8NtX128s+GX/jBC/YNlaPOzfxNEISrlwbYYc8nnQaw4zSdZMZqZY5hlTxB9BfywawGB7MRomBW4G8iSGZMl2v2P/HMWJDltNiiMIyEb3OFDmDVjdzKuOf7bf7Ts3T+f/BGJSO313QE4lMd4IdD7IB4P1xXbDpqgN+N3n5laL3lnTpWVZ0GmnXsT2hI/ApxlB0YFMagCR3T8buiayebTtivEkMX0NbhxJ4Bn7IPemKoxjmPlGJsv6xM002xvGUCwQxDt5tA6CBfA/BHsauzIMOsM1+Dn9SZz1/T2XE67ZzGtiTwMww6KJIcmUNg9B0yMcBQ4IrX9HooeAT0Rtzs1MQX6LSuV8lPlY19mE17nU+VQ7zVJgkdQDmImOUgxP4EP4qaP4ogFIxQxjumi9wQfYCGhB9rX8fPEQn7HmD7DnkzioYMsNs8u9028Fa3itt9j6zbDeJuZsbt/k8D/H84crtgfFZ2kqVOv5rtBDjT5zyrg5m+s9orTTzbf5zxqpxtMlDKJLkku4bAuizxGsKzBviTWF4/jLlKzKVdti7Z6xUHJ6TI00aHnsJiqpDx2kdBwh1m3vHBGaK9cxXxCfSZ6RjS3ozL230CuAg8duVGDmsswyRwYuX1D8srMffhToztNkIJU+xiyka5CKw01GfoqFWWiWwcXYFdx9hIRK3QYBCSSw0dSkxiyloHDsVE14r58ZhD+fW/+8Vfv+1183/oe7Lm1sJ7Hn7k2e+O+97Q4Pse+I34LU9/1PeGnor9xcY/fl/dHb439GfRf/rx1/7X3Wd9b+hdX1q17V/2/b9OmYSaVZWirAog9jGIKWEI821ggjnG3HfEO7dDYuf293xYFpcLy2p4cjFQUGAjPFReq6wFCifl/2Eo/ndlZ/x20N93UEwb9bh8EIKXD3Tb5YOYm7oJPNuAr3tFINCIm+WnKJrs0dhmef5Ei00/xqp3AqhXDToNaCJITvtQWfSaWz1PZOrA+LCGlwtmkJZnMXaIlmdxdoBwBXNYPpEQNYR4HpJIuBFm8QaobcxWbYUaaCgLrn94UOVezjXJaUQEY16U7QDW4wja4yiSOhi1629ZM+3ds/Oh4DM9bF7qzDMZqQvWCgg8U/MiY3xrJHxDlJmrw0oTkxDbCIwYYwUYnD/EkcywX7ob9svlCmTSRAX3mqCjuounADRGVma96I/air5xNFXzVjeif5Bc9A9WRf8KEWa36G+d/aJ/0Fb0dxvDucON6I+Ti/54VfSvEGF2i/4dN0T0EVGLStQw6sgyUpR9DWKpoLQnJis40qU9Mbi0Rycq7cEUXWbqzxC4Us3z8b0nTk0ePXLi+Lq9k1P3Tp+eefPE8fOsgIfY+UnoRsk4H9vzdjNQbH7A0IXT4Ir1IXBZ2LgVtfmtglm+sW8U/7cVWQzmFp9CDnRFQ1P+iFJrwhXN5keNUb4e7mpQ0NVSm68RwAaLzWc834GNpRLrkJrpqDGgN7t7yxCNO3jRYO2nIRxwK2FkDSZClKj+h7q9o4Fn3rbQQaL6mnCU/hyp+FqhnYte5leMmZIma1lutNh83qDJRbM3D1eaKr/xAeAN6TIDYDeRZv0gWPnA1LJeecH0dzCbU/pzXEAeA0vjyBMvNr/fwoC6ymdlY2dtu07ctm4dHJj8LQNaP4hVPihz5D2QIErWN9USyfWbNn1x1d/948cellqAsSwSMz4jaLdIbCk3MiRyP2WxkwUqikQrdb5HK3VwtBIlilbq0GgF3nRQJzrxwvDLNLtfVQB8Egmmwg6ihQh/zXOwMn+xrVxu/gy4hGNfuSxevGkJG+Cfc9drqEf8fSAR249CfE1V0AlZL4urlA36WepdmDAscmVFlidMpNj8bwZhvgwTBusuWFxd57S4Wlxs3vxVpgwMLSR3Pr+rg2NWJxvdoZXdCL6y2/x1V5Xc9tvX8LXVCF7JjRTZmNIlGj/v5dMldf6lS+wvCMY3I2LnD8RskhrOKjn5ZHJILNF/Y+jav0m4Lg1O/Zrmrs4RmXUUVxsjIiaNEkn839vfMRAByzMRZZoxWN+1VybdjTIJk25Mr5C0FrKtIGBWJpOjgjch+aZMIVtliiDbFg6i1YR4MXnIXvYDQv/GlFgD3wUf2zNlqjgyzbiFiYKflnvTUoNWVIP13oLQOeR76ByCQ+cgUegccqM6ESQ7JJXoC7GJvkgIFaigUxa6GCkfHpgCHjj1EoR2vkUd9EiTWkOvc+CoND46DdlGpzE+DtZsPxJX08Vwl6gXWxLGtsp9xPV0LfU3JOrSaKKuOidRl4+LVHVuoq46p1GXC8iDmErptOdUOC0U1IUFrS2L7IMf+CgMRKZnoB1cqHb9D8JA9iWYZDrKfn8DZhJRNwuvUWc1BzISiCyR13mU6YN+yfR6e5nW3Mi0VmzpuyF2WscyAHHHMm3ywrPSTmNbXMbR7J8ukzjWfI9+Nf8TxxitAm40XCr61djoVw+5y71GXW47jzLZV49rKIUl75jX9tX74r7vlvnYLSv7E69c+kbfGwqH2t6z6OnX7LRvyKLokkerAAtpYSMiN+yHgW+yOXWVFywd0WSXwcVLgMi+3jC8DDkTjE+KAeusW5LrZNcUg5VmgZXmmCxSnQUp6hpJA9dYo/KdgqAiDteiNW71teWVJbH9L2KEQHp5tAMA",
|
|
3978
|
+
"debug_symbols": "tb3druTIcUb7LnOti4qIzMgMvYphGLIsGwMMJEOWD3Bg6N1PZZCRq3rPKXbt2t037uVRdyz+5VdkMkj+3y//8Zd//9//+rdf//qff/ufX/74L//3y7///dfffvv1v/7tt7/9+U//+PVvf73/1//75bb+z+y//NH+8Mv0X/7o9z/G8cc8/ohf/jj/8Evcjj/k+EN/+aPc7n/a+We7/6n3P/v5p59/3ktJu/85zz/j+FNutwIp0AIraAW9wAtGwSyoylKVpSpLVZb1r/oddP0dX7D+zligBVbQCpY9FnjBKJgFcYLdK6ssuFdWXXCvrLbACu6VdVW2XuAFo2AWxAntViAFq/JcsCove7tXttuCtUOXvd3r2JK2OKHfCqRAC6ygFdyXx9am67MgTvBbgRRogRXc18vWdl7Hi61lXgfMAa2gF6y/vFZnHTQHzII4QNdhc4AUaIEVtIJe4AWjYBZUZanKUpWlKktVlqosVVmqslRlqcpSlbUqa1XWqqxVWauyVmWtylqVtSprVbaqbFXZqrJVZavKVpWtKltVtqpsVblV5VaVW1VuVblV5VaVW1VuVblV5VaVe1XuVblX5V6Ve1XuVblX5V6Ve1XuVdmrsldlr8pelb0qe1X2quxV2auyV+VRlUdVHlV5VOVRlUdVHlV5VOVRlUdVnlV5VuVZlWdVnlV5VuVZlWdVnlV5VuWoylGVoypHVY6qHFW5xqDWGNQag1pj0GoMWo1BqzFoNQatxqDVGLQag1Zj0GoMWo1BqzFoNQatxqDVGLQag1Zj0GoMWo1BqzFoNQatxqDVGLQag1Zj0GoMWo1BqzFoNQatxqDVGLQag1Zj0GoMWo1BqzFoNQatxqDVGLQag1Zj0GoMWo1BqzFoNQatxqDVGLQag5YDLRZIgRZYQSvoBV4wCmZBnOBV2auyV2Wvyl6VvSp7Vfaq7FXZq/KoyqMqj6o8qvKoyqMqj6o8qvKoyqMqz6o8q/KsyrMqz6o8q/KsyrMqz6o8q3JU5ajKUZWjKkdVjqocVTmqclTlOCu3261ACrTAClpBL/CCUTALqrJUZanKUpWlKktVlqosVVmqslRlqcpalbUqa1XWqqxVWauyVmWtylqVtSpbVbaqbFXZqrJVZavKVpWtKltVtqrcqnKryq0qt6rcqnKryq0qt6rcqnKryjUGW43BVmOw1RhsNQZbjcFWY7DVGGw1BluNwVZjsNUYbDUGW43BVmOw1RhsNQZbjcFWY7DVGGw1BluNwVZjsNUYbDUG2xopzRfcKzddcK/cxoJZECeskXKAFGjB/V/19c/XKDggDuhrFBwgBVpgBa2gF3jBKJgFVXmNgj4WSIEWWEEr6AVeMApmQZygVXkdfj0WjIJ5wjq0XBbcFd4W9AIvGAWzIE5Yh9YBUqAFVlCVe1XuVXkdWm4LZkGcsA6tA6RAC6xgVe4LesGq7AtGwTxhHUgHrH+1NsuK7gPu/2rcFoyCWRAnrOg+QAq0wApaQS+oyrMqz6o8q/I6IH3ti3VAHqAFVtAKesGqvHbcOmgPmAf4Og4PWP+TLlj/ky2IE9ZRd4AUaIEVtIJe4AWjoCpLVdaqrFVZq7JWZa3KWpW1KmtV1qqsVdmqslVlq8pWla0qW1VeATvuB5uvOB19wfrLY0Er6AVeMApmQZywjvkDpEALqnKvyr0q96rcq3Kvyr0qe1X2quxV2auyV2Wvyl6VvSp7VfaqPKryqMqjKo+qPKryqMqjKo+qPKryqMqzKucomAvWv4oF9381bwtmQZyQ8zgJUqAFVtAKeoEXVOWoynFWHiuopyyQAi2wglbQC7xgFMyCOEGqslRlqcpryExd0Ap6warcFoyCWRAnrCFzgBRogRW0gl5QlbUqa1XWqmxV2aryGiCzL1j/yhesfxUL4oR1KnKAFGiBFbSCXuAFo6Aqt6rcq/IaO3Mu0AIraAW9wAvudWJt8DUuYm3eNS4OaAX3fxW2wAtGwSyIE9a4OEAKtMAKWkFVHlV5jYtYG3ONiwPihDUuYiyQglV5rcUaKbE2wvq9OKAXeMEoWJN7t7XOa/ActEbPSWvm8LYW5ZgLTcrZ0LWvcz70tpYmZ0RvaylyTvSgsWluipNmTo0eJJt0k21qm/om3zQ2zU3bIdshWWUuyn8Ri9a/EFkURTlletBaqjW5O3PS9CDb1Db1TVlvTTBb/tu2KP9tX2Sb2qa+yTeNTXNTFLXbpnSsmeumm2xTOtaat77JN41N6VjbpUVRv206z0Vn1wIrWGeMazutQXSAF4yCWRAneJZeG99lk26yTW1T3+Sbxqa5KYrGdoztGNsxtmNsx9iOsR1jO8Z2jO2Y2zG3Y27H3I65HXM75nbM7ZjbMbcjtiO2I7YjtiO2I7YjtiO2I7YjyhG32ybZpJtsU9vUN/mmsWlu2g7ZDtkO2Q7ZDtkO2Q7ZDtkO2Q7ZDt0O3Q7dDt0O3Q7dDt0O3Q7dDt0O2w7bDtsO2w7bDtsO2w7bDtsO2462HW072na07Wjb0bajbUfbjrYdbTv6dqzhfb9JtEg32aa2aRblqF03fiJH7UErANaffv45jj9zVGneHfNNY9PcFEU5qg6STenJe2u2qW3qm3zT2DQ3RVGOqoNk03bEdsR2xHbEdsR2xHZEOe53/W6ggAoa2MAOOjjACWITbIJNsAk2wSbYBJtgE2yCTbEpNsWm2BSbYlNsik2xKTbDZtgMm2EzbIbNsBk2w2bYGraGrWFr2Bq2hq1ha9gatoatY+vYOraOrWPr2Dq2jq1j69gcm2NzbI7NsTk2x+bYHJtjG9gGtoFtYBvYBraBbWAb2Aa2iW1im9gmtoltYpvYJraJbWILbIEtsAW2wBbYAltgC2xkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlR6tCtgQczQonDnApskMgOxUKBVyK7BzIfoXCBi5F9gZk10LhACcYGzNAThRQQQMbiK1ha9gatoatY+vYOraOrWPr2Dq2jq1j69gcm2NzbI7NsTk2x+bYHJtjG9gGtoFtYBvYBraBbWAb2Aa2iW1im9gmtoltYpvYJraJbWILbIEtsAW2wBbYAltgC2yxbdlMUiigggY2sIMODnCC2ASbYBNsgk2wCTbBJtgEm2BTbIpNsSk2xabYFJtiU2yKzbAZNsNm2AwbWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlSpYoWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZEldmRJSxzgBNO2OgXtyJIDBUzbTDQwO0Sz3TKz5EQHBzjB7BXN5szMkhOzXzSXN7Ok5ZJllpyYtp7YQQfTll2bmSUnxsbMkhaJAipoYAM76OAAJxgbHZtjc2yOzbE5toyKvk4MsxFHem6+DIWe2yxD4cQOOpgtt7n5MhROjI0ZCicKmLbcqBkK/eiJbWAHHVw2z+XNUPBchgwFz7oZCicum+fBlaHgeURlKJyYDcBZLENhZLEMhROXbeRCZiicGIXZwFMooIIGNrCDDg5wgtgEm2ATbIJNsAk2wSbYchwPT9ybOjt1CufGHLHjwFTMxKwQiQ4OcIKxMcfmiQKuvzCPJucbKOBa45nNzzmcTmxgBx0c4ARjYw6nEwXE5tgcm2NzbI7NsTm2gW1gG9gGtoFtYBvYBraBbWCb2Ca2iW1im9gmtoltYpvYJrbAFtgCW2ALbIEtsAW2wBbblg1EhQIqaGADO+jgACeITbAJNsEm2ASbYBNsgk2wCTbFptgUm2JTbIpNsSk2xabYDJthM2yGzbAZNsNm2AybYWvYGraGrWFr2Bq2hq1ha9gato6tYyNLOlnSyZJOlnSypJMlnSzpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLOlkSSdLOlnSyZJOlnSypJMlnSzpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLOlkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkySBLBlkyyJJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmSQJYMsGWTJIEsGWTLIknFkybpQGEeWHChgXoBEYgM7mIqZOMAJxsYjQA4UUEEDG9hBbIbNsBm2hq1ha9gatoatYWvYGraGrWHr2Dq2jq1j69g6to6tY+vYOjbH5tgcm2NzbI7NsTk2x+bYBraBbWAb2Aa2gW1gG9gGtoFtYpvYJraJbWKb2Ca2iW1im9gCW2ALbIEtsAW2wBbYAlts29EoeKKAChrYwA46OMAJYhNsgk2wCTbBJtgEm2ATbIJNsSk2xabYFJtiI0smWTLJkkmWTLJkkiWTLJlkySRLJlkyyZJJlkyyZJIlkyyZZMkkSyZZMsmSSZZMsmSSJZMsmWTJJEsmWTLJkkmWTLJkkiWTLJlkySRLJlkyyZJJlkyyZJIlkyyZZMkkSyZZMsmSSZZMsmSSJZMsmWTJJEsmWTLJkkmWTLJkkiWTLJlkySRLJlkyyZJJlkyyZJIlkyyZZMkkSyZZMsmSSZZMsmSSJZMsmWTJJEsmWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYcjZ3rEQw5OjtPjI2xp+WPls4TDWxgBx0c4ATjRD06O08UUEEDG9hBBwc4QWyCTbAJNsEm2ASbYBNsgk2wKTbFptgUm2JTbIpNsSk2xWbYDJthM2yGzbAZNsNm2Axbw9awNWwNW8PWsDVsDVvD1rB1bB1bx9axdWwdW8fWsXVsHZtjc2yOzbE5Nsfm2BybY3NsA9vANrANbBkg60EmPTo7T3Qwh/TxdycYG1eA6HoSSbOzs1AX3hINbGBfqIkODnCCsTFuoIAKGthAbIEtsAW22Lbs7CwUUEEDG9hBBwc4QWyCTbAJNsEm2ASbYBNsgk2wKTbFptgUm2JTbIpNsSk2xWbYDJthM2yGzbAZNsNm2Axbw9awNWwNW8PWsDVsDVvD1rB1bB1bx9axdWwdW8fWsXVsHZtjc2yOzbE5Nsfm2BybY3NsA9vANrANbAPbwDawDWwD28A2sU1sE9vENrGRJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZIkdWWKJE4yNR5b0RAHTNhINbGDaItHBAU4wNh5ZcqCAChrYQGyBLbAFtti2druBAipoYAM76OAAJ4hNsAk2wZapsd7kq/lSN11vetB8rZuuVzhovtitUEAF1/KuVztovuCtsIMODjCvbnMZjpfoJuYcyIlpm4kKGtjADjo4wAnGxsyHE7E1bA1bw9awNWwNW8PWsHVsHVvH1rF1bB1bx9axZT6sd1xodq2emPlwooAKGrhsmgdB5sOJDi6b5qGR+XBibMx8OHHZNA+NzIcTDWxg1l1jPjtRVfPQyDF/ooJZIZc3x/yJHczlHYkDnGBszDGvuflyzGsecjnmLdcix/yJDVw2y0XPMX/iACcYhdmJWiigggY2sIMODjBtt8TYmGP+RAEVNLCBHXRwgNgEW+bDetpDsxO1UEEDG9hBBwc4wdho2DIf1lMk2o9XbR9ooINZYR0l2V2q673Tmt2lhQoamMs7Ezvo4AAnGBtzzJ8ooIIGYuvYOraOrWPr2HLMr/czanaX3n8JEhVctvXMimZ3aWEHHRzgBJet5ZbMMX+igAoa2MAOOjjACWKb2DIfWu6hzIcTDUxbbofMhxOXrefAyXw4cYKxMfOhpy3z4UQFDWxgBx0c4ASjMLtLCwVU0MAGdtDBAU4Qm2ATbIJNsAk2wSbYBJtgE2yKTbEpNsWm2BSbYlNsii3zYT2HotldWpi2lqiggWmbiR30jRkV66kizTZRXU8VabaJqmeFDIUTHRzgBNdCrjdmaraJFgqooIEN7GDacuUzFE6cYGzMUPDcJBkKJyrIDnB2gLMDnB3g7ABnBzi7e7ADMhROVNDAtpchQ+FEB7ENbAPb5OCaHFyTg2uybhkKhzhD4UQHB5hbMhJjY4bCics28tDIUDjRwAZ20MEBLtt6fahmm+iB2SZaKKCCBqbNEjvoYNpa4gTTto6obBMtFFDBtEXiss0UZyic6OAAJxgbMxROXLbVR6r5CsbCVOSiZxKc6GAqPHGCsTGT4EQBUzESDWxgBx0c4ATTtqIi20QLBVTQwAamLffFcf5wYGw8zh8OXHXjlqjgqhu5zTIqTuyggwOc4LLlzcdsCC0UUEEDG9hBBwc4QWzH1cGBBmbdXOMMhRMdHOAEY2OGwom5FrnnMxRONLCBHXQwbTkCMhROjI2xr1tGCKiggQ3soIMDnGAUZpOn5o3gbPLU9XZLzSbPwg46OMAJxsYc/nntn02ehQoa2MAOOjg2Hh0UniigggY2sIMODnCCsdGwGTbDZtgMm2EzbIbNsBm2hq1ha9gatoatYWvYGraGrWHr2Dq2jq1j69g6to6tY+vYOjbH5tgcm2NzbI7NsTk2x+bYBraBbWAb2Aa2gW1gG9gGtoFtYpvYJraJbWKb2Ca2iW1im9gCW2ALbIEtsAW2wBbYAlts29HOeaKAChrYwA46OMAJYhNsgk2wCTbBJtgE2/GRrpE4wdiYWRIHCqjg3WbZD5PtnIUd9IWaOMAJxsb87MSJAipoYAM7iM2wGTbD1rA1bA1bw9awNWwNW8PWsDVsHVvH1rF1bB1bx9axdWwdW8fm2BybY3Nsjs2xOTbH5tgc28A2sA1sA9vANrANbAPbwDawTWwT28Q2sU1sE9vENrFNbBNbYAtsgS2wBbbAFtgCW2CLsll2dhYKqKCBDeyggwOcIDbBJtgEm2ATbIJNsAk2wSbYFJtiU2yKTbEpNsWm2BSbYjNshs2wGTbDZtgMm2EzbIatYWvYGraGrWFr2Bq2hq1ha9g6to6tY+vYOraOrWPr2Dq2js2xOTbH5tgcm2NzbI7NsTm2gW1gG9gGtoFtYBvYBraBbWCb2Ca2iW1im9gmtoltYpvYJrbAFtgCW2ALbIEtsAW2wEaWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZMnxndnVImTHl2ZPnGDa+sIjSw5MmycqaGDaZmIH0zYSBzjBZVu9M3Z8g/bEtEWiggYum+QKZZacuGyrNcaOL9KeOMG05QpllpwooILLJrmQmSUndtDBAS7b6uKw40u1B2aWnCigggYum+YKZZac6OAAJxgbM0tOFFBBA7EFtswSzeMhs+TECaZtbajjm7YnLttq87jjsq1Zdzu+bHtiAzvo4AAnGBszS04UEJtgE2yCTbAJNsEm2BSbYlNsik2xKTbFptgUm2IzbIbNsBk2w5ZZYrkDMktOTJsnTjA2ZpacuGyrvcGO7+Sul3ra8aXcExvYQQcHOMFlW68FteOTuieu6aaeC5kTric2sIMODnCCsTEnXE8UEJtjc2yOzbE5Nsfm2Aa2gW1gG9gGtoFtYBvYBraBbWKb2Ca2iW1im9gmtoltYpvYAltgC2yBLbAFtsAW2AJbbNvxqs8TBVTQwAZ20MEBThCbYBNsgk2wCTbBJtgEm2ATbIpNsSk2xabYFJtiU2yKTbEZNsNm2PLmzZoKtuMdoyd20M+pYDveMXriBNO2UuN4x+iJAmaAtEQDG7hsqyXEsvWzcIATjI158+ZEARU0sIHYOraOrWPr2BybY3Nsjs2xOTbH5tgcm2Mb2Aa2gW1gG9gGtoFtYBvYBraJbWKb2Ca2iW1im9gmtoltYgtsgS2wBbbAFtgCW2ALbLFtxwtLTxRQQQMb2EEHBzhBbIJNsAk2wSbYBJtgE2yCTbApNsWm2BSbYlNsik2xKTbFZtgMm2EzbIbNsBk2w2bYDFvD1rA1bA1bw0aWdLKkkyWdLOlkSSdLOlnSyZJOlnSypJMlnSzpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLOlkSSdLOlnSyZJOlnSypJMlnSzpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLOlkSSdLOlniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFkyyJJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmSQJYMsGWTJIEsGWTLIkkGWDLJkkCWDLBlkySBLBlkyyJJBlgyyZJAlgywZZMkgS7Ip1dYzFZZNqYUGpk0TO5jTFp44wAmmLfHIkgNz3bLukSUHGpjtOblkR4PagWkbiQOcYE6SrOnScUySHCigggY2sIMODnCC2BybY3Nsjs2xOTbH5tgcm2PLCdf1FInlu0sLFTRw2dYHUywbWAsdHOAEl62vOaZsYC0UcNnyMjUbWAsb2EEHBzjB2JgTricKiC2wBbbAFtgCW2CLbct3lxamrScqaGDaRmLaZqKDA5xgbMwJ1xMFVNDABmLLCdccsdnWWjjB2JgTricKqKCBDewgNsWm2BSbYTNshs2wGTbDZtgMm2EzbA1bw9awNWwNW8PWsDVsDVvD1rF1bB1bx9axdWwdW8fWsXVsjs2xOTbH5tgcm2NzbI7NsQ1sA9vANrANbAPbwDawDWwD28Q2sU1sE9vENrFNbBPbxDaxBbbAFtgCW2ALbIEtsAW22LZsdi0UUEEDG9hBBwc4QWyCTbAJNsEm2AQbWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlsbOk3XaWtNvOknbbWdJuO0vabWdJu+0sabedJe22s6Tddpa02w2bYBNsgk2wCbYjS1qigwNMmyfGxiNLDjQw/1lPnGBsPEJhJAqooIEN7KCDaYvECcbGIxQOFFBBAxvYQQexNWwNW8fWsXVsHVvH1rF1bB1bx9axOTbH5tgcm2NzbI7NsTk2xzawDWwD28A2sA1sA9vANrANbBPbxDaxTWwT28Q2sU1sE9vEFtgCW2ALbIEtsAW2wBbYYtuOrtUTBVTQwAZ20MEBThCbYBNsgk2wCTbBJtgEm2ATbIpNsSk2xabYFJtiU2yKTbEZNsNm2AybYTNsho0sEbJEyBIhS4QsEbJEyBIhS4QsEbJEyBIhS4QsObpW12PW7ehaPVHBtM3EBnYwL2lb4gAnuGwjMbPkRAHT5okGNrCDDg5wgrExs+REAbENbAPbwDawDWwD28A2sU1sE9vENrFNbBPbxDaxTWyBLbAFtsAW2AJbYAtsgS227ehaPVFABQ1sYAcdHOAEsQk2wSbYBJtgE2yCTbAJNsGm2BSbYlNsik2xKTbFptgUm2EzbIbNsBk2w2bYDJthM2wNW8PWsDVsDVvD1rA1bA1bw9axdWwdW8fWsXVsHVvH1rF1bI7NsZElSpYoWaJkiZIlSpYoWaJkiZIlSpYoWaJkiZIlR9fq+sJvO7pWTxzgsq3XRrSja/XAzJITly0kcf2F9W6AdnSXHn8hx/yJBjawgw6uZYhcyBzzJ0bh0V16ooAKGtjADjo4wAliE2yCLcf8eqNeO7pLT2xgBx0c4N3W1lvkW3aXnrjGfKGAChrYwA46OEBsis3SJokCKpg2S0xbS+yggwNMW24oi43tBgqooIEN7KCDA8TWsHVsHVvH1rF1bB1bx9axdWwdm2NzbI7NsTk2x+bYHJtjc2wD28A2sA1sA9vANrANbAPbSNu6yMxG08Ic3Xn85vnDiQambSZ20MFVV/LoW/nQVpt+y+bRwgZ20MG1vJLH5MqHwijM5tFCARU0MG0tsYMODjBtPTE2yg3c+yKbRwsNbGAHHRzgrK3eZO+LpjdQQN3LkPlwYgOxKTbFphPcx1mzG8i6HfmQ4iMfDmxgB30vQ+bDiWxJ8qGRD418aORDIx8a+dDIh3bkQ4qPfDiQLdnYkpkPcqCACuaWnIkN7KCDA5xgbMx8kEgUUEEDG9jBZVuPg7RsHi2c4LKtZzVaNo8WLpvmsZ75cKKBDVw2zZXPfNAUZz6cOMHYmPlwooAKLtt6r2XL5tHC/PVP8bqSaJZrkflw4LqSKFx1LUdhpsaJBjawg2stLI+zTI0TJxiF2SZaKKCCafPEBnbQwQFOMG1rt/Rj/iH/qxjYwA46OMCsOxNjY+bDiWstmiSutVit1i0bQgsb2EEHBzjB2Jj5cKKA2Axb5sNqb2jZEFro4AAnGBszH04UMG2RaGADO+jgACcYGzMfThQQW8fWsXVsHVvH1rF1bI7NsTk2x+bYHJtjc2yOzbENbAPbwDawDWwD28A2sA1sA9vENrFNbBPbxDaxTWwT28Q2sQW2wBbYAltgC2yBLbAFtti2bAgtFFBBAxvYQQcHOEFsgk2wCTbBJtgEm2ATbIJNsCk2xabYFJtiU2yKLbNk9eS0bAgtjI2ZJScKqKCBDeygg9gMm2Fr2Bq2hq1ha9gatoYts2S94bZlQ2hbnUUtG0JPzCw5UUAFDWxgPoSTiuOhtwMHOMHYeDz0dqCACuZatEQHBzjB2JipcWIub0/MCp6YFUbiBGNjJsHqAGrZzlmY2yGPkkyCExu4ljfv1WU7Z+EAJxgbMwlOFHDZPLdDJsGJDeyggwNcWz3PubJx89gO2bhZaGDW1cQOOjjACeZarIMgGzcLBVQw1yJtOeZP7GDaRuIAJxgbc8yfKGDaWmLaZmLaInHZVnNjy8bNwrExR/fIbZaj+0QFDVx1R26HYxx74gRj4zGOD1RwDZy8wDu+E3/iANcuzKu64zvxB2bf9okCKmhgAzvo4FrIvFORXZUt7yhkV2WhggY2sIMOrrW45VbPDu0TY2N2aJ8ooIIGNrCD97o5sZftkwfl0B15POXQPVFBA3Mdck/k0D3RwQFOMDauoRt5BKyRe5Jusk1tU9/km8amuSlOyu7Itr4f2bI7srCBHbzXXK+6bdkcedLcFEVrsJ4km3STbWqbclPMxAnGxhyRJwqoYC58JDawgw4OcIKx8RinBwqoIDbDZtgMm2EzbDl6c4452x8LBVTQwAZ20MEBThBbx9axdWwdW8eW5+7rrcotWxpbzlJnS2OhgvcKx1qucXxS3+Sbxqa5KYrWCD5JNumm7RjbMbZjbMfYjrEdYzvmduTAzevwbFUs7KCDuS1a4gRjY/7mniigggY2MG09MW05NvI398QJRmG2KhYKqKDVrslWxcIOOjjACcZGuYECZt2R2EEHBzjBrLsGcDYlFgqoYK5FJDawgw4uW0Z2NiXmeVf2JB60xvdJS5VJmB2JhQY2sIMODnCCsTGH94nYcnivtzy37EgsbGAHHRzgBGNjDu/IDbaGd89bHNmRWGhgW5hbaf16Fzo4wAnGxhUFhQIqaCA2T1tLdHCAE4yN4wYKqGDacseOBnbQwQFOMDbOG7hsOV2fHYmFBjawgw4OcILLJrlJVmQUCqiggQ3soIMDnGDZenYkFgqooIENzLq6ULKCJQq48rkn2aa2qW/yTWPT3BRFKxROygVqiblAx3/toIMDzNX3xNiY4/9EARU0sIFpG4kODnCCsbHdQAHTNhPTFokN7KCDA5xg7F3Q2TGdHZMBcKKBDeygg2PjGuojj4I10k/STauoHtjAVVSPf+7gACcYG3Ocn7hWQXNX5jg/0cAGdjBtuXFznJ84wdiY4/xEARU0MOvmJl9jd+RQyEG6ZvN7dggWNnAtmOUWyUF64lowOypMMAqzQ7Cv71H17BAsVNDABnbQwbS1xAnGxhzQJwqooJ0rnK2Aa/q9ZyfgSXNT1kzUGyigggY2cK3BeutSzz7AwgFOcNlarmKO6vV8Y88+wEIFl62lIkf1iR10cIATjI05qk8UUEFsOarXDGDPPsBCBwc4wdiYo/pEAZet53bIUd1zNXNUn/+1g3ksjMQBrt12UBStkX6SbNJNtqlt6pt80yjK4dxzQ+Rw7sd/VdDABnbQwQGuC/+jbBQdj0onySbdZJvapn5Sts55Du5snSs0cK1wDt5snSt0cIATjI1rkBUKqKCB2ASbZgVNzL9riZ3/movTEnNxeuIEY6PdwFyc3A6moIEN7KCDaRuJaZuJacvNt0aM56jNbrdz0ZuCrNAaEH7sljUgCmPjGhCFAipoYAM76GDactFzQOTPcjaznZhD4kQB05brlqPixAZ20MEBTjA2jjzkckOtI9/zxzRb0VxzH6/j3fMHMlvRCgVUsINZIQ+NGRsjK+RBECnOTbJ+nVxzk8QEozD7zzx/Fe0YOAcqaFU3+8/qv3bQwQHOWuPsPzsxB86JArZat+w0O1YoO80Kx8aMbs+/m9F9ooAKrkDy/GcZ3Sd20MEVSJ6rmSGdP4LZbFWoYNbNzZchfWIHHRzgBGNjXnt5brO89jpRQQMb2EEHB5iKdSBmh1WhgAoa2MAOOjjACWKb2Ca2PBFb0+c9O6wKG9hBBwc4wdiYF1wnCsjOynO5ExvYQQdHYTZb9TwpzmarQgMbmIuuibmQlhgb86RszXj3bKsqzLo90fi7DeyggwPEJtjydO1EARVk0fMc7UQHBzj3uhnFjGJ5NnasUJ6Nndj3uhmLbiy6sejGojcWvWFr2BobqrGhGhuqseh5CnZibMzRfaLsdesU6xTLcXysUI7jE+det86iO4vuLLqz6M6iOzbH5mwoZ0M5G2qgGCgGioFioBgoBoocx+uGQM9OqMLYmOP4RAEVNDBtOXCOcXygg2NjDr11s7RnS1NhDr3cF3kZlZjNS8dfyOalQgPbxuMoOTCXLBLXX1hz3z17ZwqXeE2D9+ydKZxgbMwD5kQBFTSwgR3E1rF1bB1bHkYzVz4PmBOzgiUOcIJZYR2e2Q9TmBV6YgM76GDW9cSsOxJjYx4PM7dvHg8nKmhgAzuYttwteTycdbFNbJnrJwqooIHLFrlj8zCK3JJ5GJ246q4J2549LoUCKrjqrq8P9uxxKeyggwOcYNrWDsgel2MZsselUEEDG9hBB1PRE1Oxdla2sBRmsZnYwA46OMAJxsa8DF/vRO3Zt9JXo3/PvhVf0849+1YK1/nZLRcyrxluuSXzmuHAvGa45dbJa4YTFTSwgets8JZbco3YwgFOMDbmRcWJacttlhcVx+LkRcWJDeyggwNMW27qvKg4MC8qbrmh8qLiRAUNTFtu37yoONHBAU4wNo605b4YspdhKGhgAzvoYF7C5C7My5IT8xIm92ZelpwooIJ5wZRbZzawgw4OcIJpy92dlzDHMoSAChrYwA6mLXd3XvmcOMEozFeWFQqoYNpaYtraP//5h19++9uf//SPX//213/7x9//8pdf/vh/+z/8zy9//Jf/++W///T3v/z1H7/88a//+9tvf/jl//nTb/+bf+l//vtPf80///Gnv9//1/vC/uWv/3H/817wP3/97S+L/vkH/vXt+T+9T/t4/fM7x9gl7jON3xSR50XaujrMEvcTpl1g6Df/Xp//e+u1CPeLABZg+OtrMdf157EW953Xn65FuygSUTXuMzlBCfu2RL/YELLmAI4tcZ8s3CX81QL3ySivbXnneXtYim8357jYnLqXYn1F48lSXBZYP6tHgftV+JMC8VO3Qz5Ycm6H+7nA0+0gF8dlfvD5WI2b7ApNXi4g2XN2Do6HEtratzXseY08q8gS/nBc3qe1Xq6QkxlHBY33KrQaYPdfvucVrrZEv9neEqrPt8Tl1tSghj2vMa8Gab4+8CgS8hAXnzi25tiRN0OeH1t6ETn3SdkqcseHHdvlzRrx9RqtvVmjy67ht+c12uVY28sxhXW5z2F8W+MqPnXs2LjPQD6v4VfZZYRf1zdruO0aPt+s0VkOj6/XGO15jav9EtF3CD4cpx9r2MXAvf+iVgzeT7PsvX0bswL9fvGt79UwTjSszfe2x9zH2PoK8fPtcbEc6xZnrcv9tuNb27S3nep3jPf2y9jLcT87j6+vi13s25fz43kGtasat9Bd4+bPfq3b1c+9zl3i8bTld4txcSo6cjIva4z7VffDyei3JS5+bNeXUmrEtYcklG9/odrFQbq+dLsHrbanJa5+5e53//e5y32D9qercrVFbbBFx/Md+4lf2/H017bNrx8dcXWQ+j6lXEfpfLog/eowzVfwnFtkPp5LfTtc+tVWzRt2R437rMWTM5irdZHIu93nWZDH843ar84KRds+sbTnp0H94khtHrU97nPAF8txcYiEtBow9+ODn/37ZeG3NS5+Ku8TdnWU3WfeHmq8foiJ7cu/e549O8T6/OL1xvV+vd3m3q+3h9O5j9vTL47RGPsM+SYP4z70Mwuy1+XOEc8XRK9O+Kfu1Vm96U8OdbevDpbvLAWXDKtH/K0aYft6dHXkvldjn1bKajV9a+C3zgHSQp/vl8tD3fc50P3q+iHEvv1p8PjyfrlaCr3tPL4v0fOluKqRzWFHjd6e17iMsNue91nvtnsvBtv+wV4vznirxurgqAjTkPciXbnSN32+HOMqSvs+TNe9mTdr7J+FdZPkvRqz17693+t5nkDX42U0cuzxHPmTVYKf23nrb1aZ+xJo8btVgguY2+3hmP9YZX55Ump+eVJqfnlS6vKU7v4L2Zmy1edbdI6rM+Vx40x5PJyxf5tlc341Db+zFMyOyei3Z7OuVz/8t/B9IvV83vaqguz1uJ+VzTd+odbUue194v7eUa63sc8/9DZvz1Mo2lcnwq8rvDQT7l+dCv/EthB5e4veHqqMN6tMDvTbbM/PP+R2++qO+U6JV/ZMTlz9zF3zzebo+u6u2b/8q4q9V0VukwsY6XGxa/zLtyuuSrx4v+KyxNd/G0R7Z3Jd5eIO0tX1vnNT8H7n99lhdlXiHuay7+mNrvFeEecCZNw3z5tFelDE3zrkhemtO/t4bxrlx0zGPEz46cPO+d1kzIs17hPk79XIV0IeNZrJezUer2S6vlXDbty3uD1O132ocTU9LuwXs/H0Jni7nCLbPzRt2NMSovbTizAv/XhVFvNDjav5S4097uxh31r/kCJXN3LWKcw+2h9np35XZFwdqZ3r5RlPi1ztGnVKRL/YqhcJMPZBNsbTmdg8j7y4Rxfc19Lni2Hy9c0h13dhuE7t7XGDyCeKTG7lRG9vFol9PnO/YL5dFOlfPq+6LvHSeZWNr55XXW4Nv7V9DnGb82JrxNXtsRu3x0yfF7m6L5X9zeetz9uzeyjfWQxnMUa8uS5zTzD5tPZ2kX0fd/b5dhHZRdzfO9pdhDvKV0Wa/+QiL7f4XN07ePGk+arEiyfNlyVe6/K53Bqvtvlcb9IX+3yuZjJfbfT5zg/NPrmzby8Bbq8Xua/rPn1vQ56eRVzdnvoxa2P7Juj6WOvztbm6RzVnZXM8Xr3fj7lvS8TVcuyzCGv2+FP1mSJBb0t8c4L3oYjLl3/vrku89Ht3dYvqxd+7q62xPkxVJW7fnEJ83Bpf//X3r//6+/i5W4Mb0+2xL+73WyO+vjXiy1tjyM/dGnqjK25ejJRhP+BnbrSrH5h9ivrY5fPxB+Yyw8ZDr3eM9xJ5fRZtj5bLy5irIvm1j/OWneibRUL2uA2L94p03+ep60maN4vkq87PIldLMuUnF3n1qvvq3tDLV92z/YCr7tl/wGXm5WEy9uTOegPXxXYdX73uvqrw8p6JH7Bn4vYD9kz8iAmAqxMzHrd4fPRk3l6vMKK26XxoYvj9mlw9eeKDadmHOzO/L9J/xDb1n320y77gXV9/eX60x9Ul1b6V6Y8DRj8cqnH18+37+vC+mx+X49urd728z/TSAXK9GHPPyj7e1/24GJdF1qcW//9PAj5TxG7sGNWLDfLlm6rfWQ46br6d3P24HP6Ti7x6WpSnYF+7+r8s8drV/3WJl67+r7fGi1f/39mkr139q/yIq/+rCPF99j4epxA/RIjK9XNoNP48tMiOjzX8650dKuOrjRnX6xL7GvO+2fT5ulz9+t92e/z9dvPD74OPTxXhXuZt9P50ba6L7N70O894r8iM3Zx+i9vtvSJcBNy59Xd2zv03iIdPw5/uHP3JNeR2U/bNrT3vxv5eGXpd74s13y/DTr49tLt+sozIQ0u0xfMydrtcmod1as8P/usiL46g76xQe+zxfnvzSnDkqsi7ZfRhZ+sYF5v355fRnJvenQUXe+n6qm935Ojj0fupIvnptbrcGm8Wsf38nq5nsp4VufwlHLtGzPH8l/DqUSBXbkDpY+/qx31z9XTVfXZpD+fHH8IeH2rY5UkKLyx46JX6XY2Lc9gxKiinPT4Y1V4vMXdf8XS9KPHqmoyLNbnaorHvcNzHcnte4+o86cbZ5+0hSz63HI2uT3le47J9ZTeOPh7ov9uk/XK6dXKZJA9PzEr/RBG1vSDfPsjzscjVU4BM19h8uPn8+yKXE66718rb44O3H+4/a79MkD0v8Pg8tMxPlBg82+0XJdpP3h4ybvNhpuRhluP3W+TyjK3R8X3nqw17uTTGwwXD+nhe5vIOlDMj3p5v3MsSe2LeHvo+f1/CfmqJFw+0yxIvHmj9yyvS5w8YdlePJr26QefXN+j8+ga9ikPjHoddjdxx9fugexJMTORiSW6XE4u1IN4ufnP16hop6F69xVu/dfcT5X1y+Pj43McaVw83vfhbN67e0hO7Ecfi8Y0KH4/SMa9upfHKjVvIu0Wc+3HjIgbn7csH+/AvHx/f+WnY05vrCfr+9i/MY5l2sXfmj/j9n18PxPn1U4j59VOI71xn7ttod27+/AJxfrkx4DslXmkM0PhyY8D3todyGqMPVzK/2x7fmb8yfZi/am9OgjUO+PCnk2Dx5denXc+C930p4/buRPrXuxwmvQW3i/voGpePBdGsLfrQ3qjfDn67un21vue07zyPh2vddnu9SLf9aoT+TavEp4rMW/1I9HiIgE8Vcd1vAPL7dMVFkS/fwbpeDtmtePcbNu+ujO1uCze7KjJ+7srwrj1/fBXR75cjfu5y9F3iPozt+XKI/NzlcO49z9vF4X75yr0fUeTVG3LXRV68IWfyAxpYrxPN9ltr7hNS43miXb4B8LU5RLv8tXptDtGuXnr12hziZYnX5hBfX5Pnc4jXW/S1OUS7eq3ai3OI31mOl+YQTb98XWVXz1m9Ov1nOr8+3WVXT1q9PsFkdvvqBNPlkry8OqZfv5ox+/Ik0+Ux8tpl4uWh+uI0wnWN16YRzMaXD3ebX59GMIuvTyN8p8hr0wh2/cq6l46P6+fXXjk+rp9u0MEbROOin/+yyODKPeTdIkGa3a6KXHWPv96CfjmZ8dLjSeMHnA99pxX+xfOhq6nIlxuUruaZY+9feZzN+PgwjnX9uTXWexl3Ej0+F/i7Ild3Qx5apebjuNEPp96XN5peeo/O5XLcTx14Jcc3raOfKtI5FXl8J/1nisgcDz8SelHky69SvyzxzdtEH04iPrR929UdpldblM0vJ99fa1G2y1tEL7YoX+9f5Yi3x/dGfdw1Vw9L3ROAl/F59/nO4dplz2isb3C+d6StT/lSJC5WZ/7kIq8ea+P2A461qwevXj7Wru5avX6sXRaxh16i23sRrfzc6DevTPhYZHx5fvWyxMv7d/yI/Tt/xP6Nn75/eXuTPb778eOumZffVxh7UdY3WZ5OXH2nCHdZ7/OtT/fwvLzA2ieM+jiH/vvVuXofZucRkG/e7vPhxoTN/vX5gPn1+YD5I+YD5o+YD5g/Zj4gvjwfcBnQORV8/vDZ47tKP3xuJ59YfzqDdttTaOObq4qPB0lcHK7x0Fv/eHkzPzlu+sO4efaGYPv6zavrA/7Fqc0YX5/avGwXfW1q86rEi1ObL6/JxdTmdYS8NLXZrl4T+OrU5mWGvNiXeDn8X50/a7cv38q/LvHSrfzLVflBcfhqN2C7/ZBuwOtUfanNoon81BIv7t7LEi/t3ssj5MUVuf2AHrx2ddfq1Q3qX9+g/vXxcpUfL/bgtavbTa/24F2eUL04eX7ZCvTi5Plljdcmz9vVPavXzg3bVQvOq5Pn7fJ+xIuT598p8trkedMvN5xebtTXjo/vBfKLPXifKXPRg9d+xF2rZl/urm5fv/F1XeK1IPrOnNfufBF/fCXeh1fIfv0Fgd9bjjkelqM9XY6ry3/nm3V+MePVLl8Q2Pa+Xd9Jf5hDuH2iiO3zw97FL4pc3Qp48Ts67eqhJL8ZZ7uPLZafWY79nYN7JsrFclzs4Bn7TsAMj4sil7//nGU+vB7Y5RPHSPDCIhlycYzML1+kXtaQdrvxGZtbv/jG7dWNq1G75uFNlO3Dyz3alxssv/OewlcaLK9flsyUW3/4SO6nXrjsvPjZZ3uvxmQScoa/VeM+pbQb1m76fF1Er64cXnzz82URH/vguM/QyrM7mpclptYxet+m470Su+3V59OPJF3ulbEX4n4b/s3XcX9To79ZQ6ihF6/j9i83q36nxCvd6vmWy6/9Yl9vjH2vTIfHmxuUzxGOeHPYPy7HuzUmj5jP/m4Nptmvalx/JuG1ML7+0sIrYXz9zRjbT5dLe++rM50Tl/70+zv21bW4/NqU7/3R7/dy+XH9zBerfE8j3/HNGoTGHd+tsc977tjfq/HQrj/lzS94jcFyxJtfEhv7bsW93LtfEtvnX/2bGe1P1RCjxvP9cvmVuL5boFpv79bYX3dsfhvv1XCjxsWX1b7z0U5eSOQXFxtXA9/3RNC4PX7e+vXvfr52uXK9Ii9erVzdhXr5auXyY1MvXa1c7ti53zjS5nz++b929Q7A1/fs+Oqe/d5yvHY5e/XIwYvfhb0q8eIV8fWqvHaM9av7UK8eY9kj+ROPsdi3w+5H8/NA7lc3CLruC6f+zfNTHz7beXnmMvb28PHYY/CJT3/GXoz7IXD1KaP5A9Ylfuq63Hf7fkjvZvOtH4bOJPId3/tx6bq/+du/eUTvMzXodurfTLq8XaO/uS6kh8qbn3WVffXVJd7dpvuFefdtenuzRqNGf358XH+y96GVrT1exH04TvXLH//7TolXrmi7fvnjf9dv52j0kPrFt4evbpe89HmZy6Vog2fqol0shX89wq4em3oxwq6/5sxNva7ydF2ua+w2dO3+fHtctn2++FXpqxqvTaZdVnhpLu26witTad/5ZvlDZ9TtaWdUty93Rn1vMW4Pi/F0xF/ddZL7CSXfX5aLb6d3u8xAzkvvPC/S+PK+grrSe+qu75bpD0tzeTF39dTUq+f8/eq+z4tXc99ZjpfO+fvVq/leO+e/LPHiZeX1qrx4zt/GDzjnb/PL5/zfOehNXzzor8tMTiD04sPw/eqNVKPvB2tGf3y67sPP1VXXtnFb/44Pw+ZDoly+4++xGf5hgv93Na4eElodDvvm4O3xe9kfvzH35XngL0+gXn7SYfcF6H01HroLPmyLq6ZRj32wP2/I6VfPOt3Xf3dr+MMTOR+7NbpfTUtNXkQxNS6KXLXR8Wl6f2zHaa9u0dfi9LJNW2jVePhO18dXx16W4Cfz8XvBnykxedpjzreW4h4UPNKn8V4JPn1ye7ii/MyK8KUPeZwR/9S22A97ybS3VkSUj0mrvrcUtr8nv5oK3irReOV5e+hH/FQJXubVWnx5Kd4tsV/TIr3Z0xL98r1zvF+5PXYzf+KJCp7AlXhIz48/0tcl9iny41nPZ0rEw9cO2nyvBC9sf/ys3ydKKM8h6uPv4WdKtBtfj5b3lqLRb9ceHiP+VAl+EvvDc26fKfFwdt8fOhg/VWLf7NHHI/xzS/FwTR1fXop3SwTdevLWAa7+8Gxbe2+nOj8kPt5cisdTA/nyirxXwuaeH12vq3uzxP4Q6OPHMz5TgrsJFv58RfrVzaav56/x9W2LeHNN+MxTxHt79aEx/vFjF58qsedr7iXeG+2yr2pU5N0VGZT48oq8W0KIcLH5Xon9Vkt9nBf5XAkujFy+vCLvlhgPz0u891sk7FS9xZslHqbObl9dkXdL8BpZ1cdmyQ8lXNpPzRzf7fjmDxdG62GUl0vEvpUyHh9ce7fEeKvEED5w9zCV8qkSg6WY7a0STJVZ9Pe2xdzPA9jjxxzfLaHv7dS5D0+bj0+tfKbEniCzx4n/T5WYrMiU90o8POQZb+7U3YVmIW8thXI/+j7w53sl9orcA6M/LeGXH37i/qvoN89Ev74YQW7FW+NMbU9A3G/l6nsleGjG3hskavt29v0man+zhFLCv1yiv7sUD7eAb++V4C3Pj29SeHcpPu7Uf73/v3/6869//7ff/vbnP/3j17/99X/u//Kfq9jff/3Tv//2l/P//c///eufH/7Xf/y//13/y7///dfffvv1v/7tv//+tz//5T/+9+9/WZXW//bL7fw//9LXi3vvM+XjX//wi6z/f9znqO53tu3+/9v9/7/f456LJf/yfRbwD/cbvfkfzr99u/9t0X/951rc/w8="
|
|
3975
3979
|
},
|
|
3976
3980
|
{
|
|
3977
3981
|
"name": "public_dispatch",
|
|
@@ -4272,55 +4276,59 @@
|
|
|
4272
4276
|
"path": "std/aes128.nr",
|
|
4273
4277
|
"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"
|
|
4274
4278
|
},
|
|
4275
|
-
"
|
|
4279
|
+
"100": {
|
|
4280
|
+
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/aztec.nr",
|
|
4281
|
+
"source": "use 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 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 messages::discovery::CustomMessageHandler,\n};\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_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 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 sync_state_fn_and_abi_export = if !m.functions().any(|f| f.name() == quote { sync_state }) {\n generate_sync_state(process_custom_message_option)\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(process_custom_message_option)\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\n/// Generates the `sync_state` utility function that performs message discovery.\ncomptime fn generate_sync_state(process_custom_message_option: Quoted) -> 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 aztec::messages::discovery::do_sync_state(\n address,\n _compute_note_hash_and_nullifier,\n $process_custom_message_option,\n );\n }\n }\n}\n\n/// Generates the `process_message` utility function that processes a single message ciphertext.\ncomptime fn generate_process_message(process_custom_message_option: Quoted) -> 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 $process_custom_message_option,\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/// [`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"
|
|
4282
|
+
},
|
|
4283
|
+
"114": {
|
|
4276
4284
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/internals_functions_generation/external/private.nr",
|
|
4277
4285
|
"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 `()`. 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 (\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"
|
|
4278
4286
|
},
|
|
4279
|
-
"
|
|
4287
|
+
"116": {
|
|
4280
4288
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/internals_functions_generation/external/utility.nr",
|
|
4281
4289
|
"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 `()`. 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 // 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"
|
|
4282
4290
|
},
|
|
4283
|
-
"
|
|
4291
|
+
"126": {
|
|
4284
4292
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/nonce_discovery.nr",
|
|
4285
|
-
"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"
|
|
4293
|
+
"source": "use crate::messages::{discovery::ComputeNoteHashAndNullifier, logs::note::MAX_NOTE_PACKED_LEN};\n\nuse crate::logging::aztecnr_debug_log_format;\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 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(crate) struct DiscoveredNoteInfo {\n pub(crate) note_nonce: Field,\n pub(crate) note_hash: Field,\n pub(crate) 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(crate) 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 aztecnr_debug_log_format!(\n \"Attempting nonce discovery on {0} potential notes on contract {1} for storage slot {2}\",\n )(\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 aztecnr_debug_log_format!(\"Found valid nonces for a total of {0} notes\")([discovered_notes.len() as Field]);\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"
|
|
4286
4294
|
},
|
|
4287
|
-
"
|
|
4295
|
+
"127": {
|
|
4288
4296
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/partial_notes.nr",
|
|
4289
|
-
"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::{
|
|
4297
|
+
"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::logging::aztecnr_debug_log_format;\nuse crate::protocol::{address::AztecAddress, hash::sha256_to_field, traits::{Deserialize, Serialize}};\n\n/// The slot in the PXE capsules where we store a `CapsuleArray` of `DeliveredPendingPartialNote`.\npub(crate) 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(crate) 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(crate) 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 aztecnr_debug_log_format!(\"{} pending partial notes\")([pending_partial_notes.len() as Field]);\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 aztecnr_debug_log_format!(\"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 aztecnr_debug_log_format!(\"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 aztecnr_debug_log_format!(\"Discovered {0} notes for partial note with tag {1}\")([\n discovered_notes.len() as Field,\n 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"
|
|
4290
4298
|
},
|
|
4291
|
-
"
|
|
4299
|
+
"128": {
|
|
4292
4300
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/private_events.nr",
|
|
4293
|
-
"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"
|
|
4301
|
+
"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(crate) 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"
|
|
4294
4302
|
},
|
|
4295
|
-
"
|
|
4303
|
+
"129": {
|
|
4296
4304
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/private_notes.nr",
|
|
4297
|
-
"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
|
|
4305
|
+
"source": "use crate::logging::aztecnr_debug_log_format;\nuse 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};\n\npub(crate) 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 aztecnr_debug_log_format!(\"Discovered {0} notes from a private message\")([discovered_notes.len() as Field]);\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"
|
|
4298
4306
|
},
|
|
4299
|
-
"
|
|
4307
|
+
"130": {
|
|
4300
4308
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/process_message.nr",
|
|
4301
|
-
"source": "use crate::messages::{\n discovery::{\n ComputeNoteHashAndNullifier, CustomMessageHandler, partial_notes::process_partial_note_private_msg,\n private_events::process_private_event_msg, private_notes::process_private_note_msg,\n },\n encoding::{decode_message, MESSAGE_CIPHERTEXT_LEN, MESSAGE_PLAINTEXT_LEN},\n encryption::{aes128::AES128, message_encryption::MessageEncryption},\n msg_type::{\n MIN_CUSTOM_MSG_TYPE_ID, PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID, PRIVATE_EVENT_MSG_TYPE_ID, PRIVATE_NOTE_MSG_TYPE_ID,\n },\n processing::MessageContext,\n};\n\nuse crate::
|
|
4309
|
+
"source": "use crate::messages::{\n discovery::{\n ComputeNoteHashAndNullifier, CustomMessageHandler, partial_notes::process_partial_note_private_msg,\n private_events::process_private_event_msg, private_notes::process_private_note_msg,\n },\n encoding::{decode_message, MESSAGE_CIPHERTEXT_LEN, MESSAGE_PLAINTEXT_LEN},\n encryption::{aes128::AES128, message_encryption::MessageEncryption},\n msg_type::{\n MIN_CUSTOM_MSG_TYPE_ID, PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID, PRIVATE_EVENT_MSG_TYPE_ID, PRIVATE_NOTE_MSG_TYPE_ID,\n },\n processing::MessageContext,\n};\n\nuse crate::logging::{aztecnr_debug_log, aztecnr_warn_log_format};\nuse crate::protocol::address::AztecAddress;\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<ComputeNoteHashAndNullifierEnv, CustomMessageHandlerEnv>(\n contract_address: AztecAddress,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<ComputeNoteHashAndNullifierEnv>,\n process_custom_message: Option<CustomMessageHandler<CustomMessageHandlerEnv>>,\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 process_custom_message,\n message_plaintext_option.unwrap(),\n message_context,\n );\n } else {\n aztecnr_warn_log_format!(\"Could not decrypt message ciphertext from tx {0}, ignoring\")([message_context.tx_hash]);\n }\n}\n\npub(crate) unconstrained fn process_message_plaintext<ComputeNoteHashAndNullifierEnv, CustomMessageHandlerEnv>(\n contract_address: AztecAddress,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<ComputeNoteHashAndNullifierEnv>,\n process_custom_message: Option<CustomMessageHandler<CustomMessageHandlerEnv>>,\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 aztecnr_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 aztecnr_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 aztecnr_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 if msg_type_id < MIN_CUSTOM_MSG_TYPE_ID {\n // The message type ID falls in the range reserved for aztec.nr built-in types but wasn't matched above. This\n // most likely means the message is malformed or a custom message was incorrectly assigned a reserved ID.\n // Custom message types must use IDs allocated via `custom_msg_type_id`.\n aztecnr_warn_log_format!(\n \"Message type ID {0} is in the reserved range but is not recognized, ignoring. See https://docs.aztec.network/errors/3\",\n )(\n [msg_type_id as Field],\n );\n } else if process_custom_message.is_some() {\n process_custom_message.unwrap()(\n contract_address,\n msg_type_id,\n msg_metadata,\n msg_content,\n message_context,\n );\n } else {\n // A custom message was received but no handler is configured. This likely means the contract emits custom\n // messages but forgot to register a handler via `AztecConfig::custom_message_handler`.\n aztecnr_warn_log_format!(\n \"Received custom message with type id {0} but no handler is configured, ignoring. See https://docs.aztec.network/errors/2\",\n )(\n [msg_type_id as Field],\n );\n }\n}\n"
|
|
4302
4310
|
},
|
|
4303
|
-
"
|
|
4311
|
+
"131": {
|
|
4304
4312
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/encoding.nr",
|
|
4305
|
-
"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.\n// The header plaintext is 2 bytes (ciphertext length), padded to the 16-byte AES block size by PKCS#7.\npub(crate) global HEADER_CIPHERTEXT_SIZE_IN_BYTES: u32 = 16;\n// AES PKCS#7 always adds at least one byte of padding. Since each plaintext field is 32 bytes (a multiple of the\n// 16-byte AES block size), a full 16-byte padding block is always appended.\npub(crate) global AES128_PKCS7_EXPANSION_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// (15 - 1) * 31 - 16 - 1 - 16 = 401. 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).\npub(crate) global 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 - AES128_PKCS7_EXPANSION_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. 401 / 32 = 12\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 #[test]\n unconstrained fn encode_decode_max_size_message() {\n let msg_type_id: u64 = 42;\n let msg_metadata: u64 = 99;\n let mut msg_content = [0; MAX_MESSAGE_CONTENT_LEN];\n for i in 0..MAX_MESSAGE_CONTENT_LEN {\n msg_content[i] = i as Field;\n }\n\n let encoded = encode_message(msg_type_id, msg_metadata, msg_content);\n let (decoded_type_id, decoded_metadata, decoded_content) = decode_message(BoundedVec::from_array(encoded));\n\n assert_eq(decoded_type_id, msg_type_id);\n assert_eq(decoded_metadata, msg_metadata);\n assert_eq(decoded_content, BoundedVec::from_array(msg_content));\n }\n\n #[test(should_fail_with = \"Invalid message content: it must have a length of at most MAX_MESSAGE_CONTENT_LEN\")]\n fn encode_oversized_message_fails() {\n let msg_content = [0; MAX_MESSAGE_CONTENT_LEN + 1];\n let _ = encode_message(0, 0, msg_content);\n }\n}\n"
|
|
4313
|
+
"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.\n// The header plaintext is 2 bytes (ciphertext length), padded to the 16-byte AES block size by PKCS#7.\npub(crate) global HEADER_CIPHERTEXT_SIZE_IN_BYTES: u32 = 16;\n// AES PKCS#7 always adds at least one byte of padding. Since each plaintext field is 32 bytes (a multiple of the\n// 16-byte AES block size), a full 16-byte padding block is always appended.\npub(crate) global AES128_PKCS7_EXPANSION_IN_BYTES: u32 = 16;\n\npub global EPH_PK_X_SIZE_IN_FIELDS: u32 = 1;\n\n// (15 - 1) * 31 - 16 - 16 = 402. 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).\npub(crate) global MESSAGE_PLAINTEXT_SIZE_IN_BYTES: u32 = (MESSAGE_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS) * 31\n - HEADER_CIPHERTEXT_SIZE_IN_BYTES\n - AES128_PKCS7_EXPANSION_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. 402 / 32 = 12\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 #[test]\n unconstrained fn encode_decode_max_size_message() {\n let msg_type_id: u64 = 42;\n let msg_metadata: u64 = 99;\n let mut msg_content = [0; MAX_MESSAGE_CONTENT_LEN];\n for i in 0..MAX_MESSAGE_CONTENT_LEN {\n msg_content[i] = i as Field;\n }\n\n let encoded = encode_message(msg_type_id, msg_metadata, msg_content);\n let (decoded_type_id, decoded_metadata, decoded_content) = decode_message(BoundedVec::from_array(encoded));\n\n assert_eq(decoded_type_id, msg_type_id);\n assert_eq(decoded_metadata, msg_metadata);\n assert_eq(decoded_content, BoundedVec::from_array(msg_content));\n }\n\n #[test(should_fail_with = \"Invalid message content: it must have a length of at most MAX_MESSAGE_CONTENT_LEN\")]\n fn encode_oversized_message_fails() {\n let msg_content = [0; MAX_MESSAGE_CONTENT_LEN + 1];\n let _ = encode_message(0, 0, msg_content);\n }\n}\n"
|
|
4306
4314
|
},
|
|
4307
|
-
"
|
|
4315
|
+
"132": {
|
|
4308
4316
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/encryption/aes128.nr",
|
|
4309
|
-
"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, MESSAGE_PLAINTEXT_SIZE_IN_BYTES,\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\n /// AES128-CBC encryption for Aztec protocol messages.\n ///\n /// ## Overview\n ///\n /// The plaintext is an array of up to `MESSAGE_PLAINTEXT_LEN` (12) fields. The output is always exactly\n /// `MESSAGE_CIPHERTEXT_LEN` (15) fields, regardless of plaintext size. Unused trailing fields are filled with\n /// random data so that all encrypted messages are indistinguishable by size.\n ///\n /// ## PKCS#7 Padding\n ///\n /// AES operates on 16-byte blocks, so the plaintext must be padded to a multiple of 16. PKCS#7 padding always\n /// adds at least 1 byte (so the receiver can always detect and strip it), which means:\n /// - 1 B plaintext -> 15 B padding -> 16 B total\n /// - 15 B plaintext -> 1 B padding -> 16 B total\n /// - 16 B plaintext -> 16 B padding -> 32 B total (full extra block)\n ///\n /// In general: if the plaintext is already a multiple of 16, a full 16-byte padding block is appended.\n ///\n /// ## Encryption Steps\n ///\n /// **1. Body encryption.** The plaintext fields are serialized to bytes (32 bytes per field) and AES-128-CBC\n /// encrypted. Since 32 is a multiple of 16, PKCS#7 always adds a full 16-byte padding block (see above):\n ///\n /// ```text\n /// +---------------------------------------------+\n /// | body ct |\n /// | PlaintextLen*32 + 16 B |\n /// +-------------------------------+--------------+\n /// | encrypted plaintext fields | PKCS#7 (16B) |\n /// | (serialized at 32 B each) | |\n /// +-------------------------------+--------------+\n /// ```\n ///\n /// **2. Header encryption.** The byte length of `body_ct` is stored as a 2-byte big-endian integer. This 2-byte\n /// header plaintext is then AES-encrypted; PKCS#7 pads the remaining 14 bytes to fill one 16-byte AES block,\n /// producing a 16-byte header ciphertext:\n ///\n /// ```text\n /// +---------------------------+\n /// | header ct |\n /// | 16 B |\n /// +--------+------------------+\n /// | body ct| PKCS#7 (14B) |\n /// | length | |\n /// | (2 B) | |\n /// +--------+------------------+\n /// ```\n ///\n /// ## Wire Format\n ///\n /// Messages are transmitted as fields, not bytes. A field is ~254 bits and can safely store 31 whole bytes, so\n /// we need to pack our byte data into 31-byte chunks. This packing drives the wire format.\n ///\n /// **Step 1 -- Assemble bytes.** The ciphertexts are laid out in a byte array, padded with random bytes to a\n /// multiple of 31 so it divides evenly into fields:\n ///\n /// ```text\n /// +---------+------------+-------------------------+---------+\n /// | pk sign | header ct | body ct | byte pad|\n /// | 1 B | 16 B | PlaintextLen*32 + 16 B | (random)|\n /// +---------+------------+-------------------------+---------+\n /// |<----------- padded to a multiple of 31 B ------------->|\n /// ```\n ///\n /// **Step 2 -- Pack into fields.** The byte array is split into 31-byte chunks, each stored in one field. The\n /// ephemeral public key x-coordinate is prepended as its own field. Any remaining fields (up to 15 total) are\n /// filled with random data so that all messages are the same size:\n ///\n /// ```text\n /// +----------+-------------------------+-------------------+\n /// | eph_pk.x | message-byte fields | random field pad |\n /// | | (packed 31 B per field) | (fills to 15) |\n /// +----------+-------------------------+-------------------+\n /// |<---------- MESSAGE_CIPHERTEXT_LEN = 15 fields ------->|\n /// ```\n ///\n /// ## Key Derivation\n ///\n /// Two (key, IV) pairs are derived from the ECDH shared secret via Poseidon2 hashing with different domain\n /// separators: one pair for the body ciphertext and one for the header ciphertext.\n fn encrypt<let PlaintextLen: u32>(\n plaintext: [Field; PlaintextLen],\n recipient: AztecAddress,\n ) -> [Field; MESSAGE_CIPHERTEXT_LEN] {\n std::static_assert(\n PlaintextLen <= MESSAGE_PLAINTEXT_LEN,\n \"Plaintext length exceeds MESSAGE_PLAINTEXT_LEN\",\n );\n\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 // Derive ECDH shared secret with recipient using a fresh ephemeral keypair.\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 // AES128-CBC encrypt the plaintext bytes.\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 // Each plaintext field is 32 bytes (a multiple of the 16-byte AES block\n // size), so PKCS#7 always appends a full 16-byte padding block:\n // |ciphertext| = PlaintextLen*32 + 16 = 16 * (1 + PlaintextLen*32 / 16)\n std::static_assert(\n ciphertext_bytes.len() == 16 * (1 + (PlaintextLen * 32) / 16),\n \"unexpected ciphertext length\",\n );\n\n // Encrypt a 2-byte header containing the body ciphertext length.\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 // Verify expected header ciphertext size at compile time.\n std::static_assert(\n header_ciphertext_bytes.len() == HEADER_CIPHERTEXT_SIZE_IN_BYTES,\n \"unexpected ciphertext header length\",\n );\n\n // Assemble the message byte array:\n // [eph_pk_sign (1B)] [header_ct (16B)] [body_ct] [padding to mult of 31]\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 // Pack message bytes into fields (31 bytes per field) and prepend eph_pk.x.\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 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_PLAINTEXT_SIZE_IN_BYTES] =\n array::subarray(ciphertext_without_eph_pk_x.storage(), ciphertext_start);\n let ciphertext: BoundedVec<u8, MESSAGE_PLAINTEXT_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 message was serialized to 32 bytes so we convert\n // the bytes back to fields.\n fields_from_bytes(plaintext_bytes)\n })\n }\n}\n\n/// Produces a random valid address point, i.e. one that is on the curve. This is equivalent to calling\n/// [`AztecAddress::to_address_point`] on a random valid address.\nunconstrained fn random_address_point() -> AddressPoint {\n let mut result = std::mem::zeroed();\n\n loop {\n // We simply produce random x coordinates until we find one that is on the curve. About half of the x\n // coordinates fulfill this condition, so this should only take a few iterations at most.\n let x_coord = random();\n let point = point_from_x_coord_and_sign(x_coord, true);\n if point.is_some() {\n result = AddressPoint { inner: point.unwrap() };\n break;\n }\n }\n\n result\n}\n\nmod test {\n use crate::{\n keys::ecdh_shared_secret::derive_ecdh_shared_secret,\n messages::{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 // Documents the PKCS#7 padding behavior that `encrypt` relies on (see its static_assert).\n #[test]\n fn pkcs7_padding_always_adds_at_least_one_byte() {\n let key = [0 as u8; 16];\n let iv = [0 as u8; 16];\n\n // 1 byte input + 15 bytes padding = 16 bytes\n assert_eq(std::aes128::aes128_encrypt([0; 1], iv, key).len(), 16);\n\n // 15 bytes input + 1 byte padding = 16 bytes\n assert_eq(std::aes128::aes128_encrypt([0; 15], iv, key).len(), 16);\n\n // 16 bytes input (block-aligned) + full 16-byte padding block = 32 bytes\n assert_eq(std::aes128::aes128_encrypt([0; 16], iv, key).len(), 32);\n }\n\n #[test]\n unconstrained fn encrypt_decrypt_max_size_plaintext() {\n let mut env = TestEnvironment::new();\n let recipient = env.create_light_account();\n\n env.private_context(|_| {\n let mut plaintext = [0; MESSAGE_PLAINTEXT_LEN];\n for i in 0..MESSAGE_PLAINTEXT_LEN {\n plaintext[i] = i as Field;\n }\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(should_fail_with = \"Plaintext length exceeds MESSAGE_PLAINTEXT_LEN\")]\n unconstrained fn encrypt_oversized_plaintext() {\n let address = AztecAddress { inner: 3 };\n let plaintext: [Field; MESSAGE_PLAINTEXT_LEN + 1] = [0; MESSAGE_PLAINTEXT_LEN + 1];\n let _ = AES128::encrypt(plaintext, 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"
|
|
4317
|
+
"source": "use crate::protocol::{\n address::AztecAddress,\n constants::{DOM_SEP__CIPHERTEXT_FIELD_MASK, DOM_SEP__SYMMETRIC_KEY, DOM_SEP__SYMMETRIC_KEY_2},\n hash::poseidon2_hash_with_separator,\n point::Point,\n public_keys::AddressPoint,\n traits::ToField,\n};\n\nuse crate::{\n keys::{ecdh_shared_secret::derive_ecdh_shared_secret, ephemeral::generate_positive_ephemeral_key_pair},\n logging::aztecnr_warn_log_format,\n messages::{\n encoding::{\n EPH_PK_X_SIZE_IN_FIELDS, HEADER_CIPHERTEXT_SIZE_IN_BYTES, MESSAGE_CIPHERTEXT_LEN, MESSAGE_PLAINTEXT_LEN,\n MESSAGE_PLAINTEXT_SIZE_IN_BYTES,\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::point_from_x_coord_and_sign,\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\n /// AES128-CBC encryption for Aztec protocol messages.\n ///\n /// ## Overview\n ///\n /// The plaintext is an array of up to `MESSAGE_PLAINTEXT_LEN` (12) fields. The output is always exactly\n /// `MESSAGE_CIPHERTEXT_LEN` (15) fields, regardless of plaintext size. All output fields except the\n /// ephemeral public key are uniformly random `Field` values to any observer without knowledge of the\n /// shared secret, making all encrypted messages indistinguishable by size or content.\n ///\n /// ## PKCS#7 Padding\n ///\n /// AES operates on 16-byte blocks, so the plaintext must be padded to a multiple of 16. PKCS#7 padding always\n /// adds at least 1 byte (so the receiver can always detect and strip it), which means:\n /// - 1 B plaintext -> 15 B padding -> 16 B total\n /// - 15 B plaintext -> 1 B padding -> 16 B total\n /// - 16 B plaintext -> 16 B padding -> 32 B total (full extra block)\n ///\n /// In general: if the plaintext is already a multiple of 16, a full 16-byte padding block is appended.\n ///\n /// ## Encryption Steps\n ///\n /// **1. Body encryption.** The plaintext fields are serialized to bytes (32 bytes per field) and AES-128-CBC\n /// encrypted. Since 32 is a multiple of 16, PKCS#7 always adds a full 16-byte padding block (see above):\n ///\n /// ```text\n /// +---------------------------------------------+\n /// | body ct |\n /// | PlaintextLen*32 + 16 B |\n /// +-------------------------------+--------------+\n /// | encrypted plaintext fields | PKCS#7 (16B) |\n /// | (serialized at 32 B each) | |\n /// +-------------------------------+--------------+\n /// ```\n ///\n /// **2. Header encryption.** The byte length of `body_ct` is stored as a 2-byte big-endian integer. This 2-byte\n /// header plaintext is then AES-encrypted; PKCS#7 pads the remaining 14 bytes to fill one 16-byte AES block,\n /// producing a 16-byte header ciphertext:\n ///\n /// ```text\n /// +---------------------------+\n /// | header ct |\n /// | 16 B |\n /// +--------+------------------+\n /// | body ct| PKCS#7 (14B) |\n /// | length | |\n /// | (2 B) | |\n /// +--------+------------------+\n /// ```\n ///\n /// ## Wire Format\n ///\n /// Messages are transmitted as fields, not bytes. A field is ~254 bits and can safely store 31 whole bytes, so\n /// we need to pack our byte data into 31-byte chunks. This packing drives the wire format.\n ///\n /// **Step 1 -- Assemble bytes.** The ciphertexts are laid out in a byte array, padded with zero bytes to a\n /// multiple of 31 so it divides evenly into fields:\n ///\n /// ```text\n /// +------------+-------------------------+---------+\n /// | header ct | body ct | byte pad|\n /// | 16 B | PlaintextLen*32 + 16 B | (zeros) |\n /// +------------+-------------------------+---------+\n /// |<-------- padded to a multiple of 31 B -------->|\n /// ```\n ///\n /// **Step 2 -- Pack and mask.** The byte array is split into 31-byte chunks, each stored in one field. A\n /// Poseidon2-derived mask (see `derive_field_mask`) is added to each so that the resulting fields appear as\n /// uniformly random `Field` values to any observer without knowledge of the shared secret, hiding the fact\n /// that the underlying ciphertext consists of 128-bit AES blocks.\n ///\n /// **Step 3 -- Assemble ciphertext.** The ephemeral public key x-coordinate is prepended and random field padding\n /// is appended to fill to 15 fields:\n ///\n /// ```text\n /// +----------+-------------------------+-------------------+\n /// | eph_pk.x | masked message fields | random field pad |\n /// | | (packed 31 B per field) | (fills to 15) |\n /// +----------+-------------------------+-------------------+\n /// |<---------- MESSAGE_CIPHERTEXT_LEN = 15 fields -------->|\n /// ```\n ///\n /// ## Key Derivation\n ///\n /// Two (key, IV) pairs are derived from the ECDH shared secret via Poseidon2 hashing with different domain\n /// separators: one pair for the body ciphertext and one for the header ciphertext.\n fn encrypt<let PlaintextLen: u32>(\n plaintext: [Field; PlaintextLen],\n recipient: AztecAddress,\n ) -> [Field; MESSAGE_CIPHERTEXT_LEN] {\n std::static_assert(\n PlaintextLen <= MESSAGE_PLAINTEXT_LEN,\n \"Plaintext length exceeds MESSAGE_PLAINTEXT_LEN\",\n );\n\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 // Derive ECDH shared secret with recipient using a fresh ephemeral keypair.\n let (eph_sk, eph_pk) = generate_positive_ephemeral_key_pair();\n\n let ciphertext_shared_secret = derive_ecdh_shared_secret(\n eph_sk,\n recipient\n .to_address_point()\n .unwrap_or_else(|| {\n aztecnr_warn_log_format!(\n \"Attempted to encrypt message for an invalid recipient ({0})\",\n )(\n [recipient.to_field()],\n );\n\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 {\n random_address_point()\n }\n })\n .inner,\n );\n\n // AES128-CBC encrypt the plaintext bytes.\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 // Each plaintext field is 32 bytes (a multiple of the 16-byte AES block\n // size), so PKCS#7 always appends a full 16-byte padding block:\n // |ciphertext| = PlaintextLen*32 + 16 = 16 * (1 + PlaintextLen*32 / 16)\n std::static_assert(\n ciphertext_bytes.len() == 16 * (1 + (PlaintextLen * 32) / 16),\n \"unexpected ciphertext length\",\n );\n\n // Encrypt a 2-byte header containing the body ciphertext length.\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 // Verify expected header ciphertext size at compile time.\n std::static_assert(\n header_ciphertext_bytes.len() == HEADER_CIPHERTEXT_SIZE_IN_BYTES,\n \"unexpected ciphertext header length\",\n );\n\n // Assemble the message byte array:\n // [header_ct (16B)] [body_ct] [padding to mult of 31]\n let message_bytes_padding_to_mult_31 = get_arr_of_size__message_bytes_padding__from_PT::<PlaintextLen * 32>();\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 let mut offset = 0;\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 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 // Pack message bytes into fields (31 bytes per field) and prepend eph_pk.x.\n let message_bytes_as_fields = bytes_to_fields(message_bytes);\n\n let mut ciphertext: [Field; MESSAGE_CIPHERTEXT_LEN] = [0; MESSAGE_CIPHERTEXT_LEN];\n\n ciphertext[0] = eph_pk.x;\n\n // Mask each content field with a Poseidon2-derived value, so that they appear as uniformly random `Field`\n // values\n let mut offset = 1;\n for i in 0..message_bytes_as_fields.len() {\n let mask = derive_field_mask(ciphertext_shared_secret, i as u32);\n ciphertext[offset + i] = message_bytes_as_fields[i] + mask;\n }\n offset += message_bytes_as_fields.len();\n\n // Pad with random fields so that padding is indistinguishable from masked data fields.\n for i in offset..MESSAGE_CIPHERTEXT_LEN {\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 ciphertext[i] = unsafe { random() };\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 masked_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 // With the x-coordinate of the ephemeral public key we can reconstruct the point as we know that the\n // y-coordinate must be positive. This may fail however, as not all x-coordinates are on the curve. In that\n // case, we simply return `Option::none`.\n point_from_x_coord_and_sign(eph_pk_x, true).map(|eph_pk| {\n // Derive shared secret\n let ciphertext_shared_secret = get_shared_secret(recipient, eph_pk);\n\n let unmasked_fields = masked_fields.mapi(|i, field| {\n let unmasked = unmask_field(ciphertext_shared_secret, i, field);\n // If we failed to unmask the field, we are dealing with the random padding. We'll ignore it later,\n // so we can simply set it to 0\n unmasked.unwrap_or(0)\n });\n let ciphertext_without_eph_pk_x = bytes_from_fields(unmasked_fields);\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 = 0;\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_PLAINTEXT_SIZE_IN_BYTES] =\n array::subarray(ciphertext_without_eph_pk_x.storage(), ciphertext_start);\n let ciphertext: BoundedVec<u8, MESSAGE_PLAINTEXT_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 message was serialized to 32 bytes so we convert\n // the bytes back to fields.\n fields_from_bytes(plaintext_bytes)\n })\n }\n}\n\n/// 2^248: upper bound for values that fit in 31 bytes\nglobal TWO_POW_248: Field = 2.pow_32(248);\n\n/// Removes the Poseidon2-derived mask from a ciphertext field. Returns the unmasked value if it fits in 31 bytes\n/// (a content field), or `None` if it doesn't (random padding). Unconstrained to prevent accidental use in\n/// constrained context.\nunconstrained fn unmask_field(shared_secret: Point, index: u32, masked: Field) -> Option<Field> {\n let unmasked = masked - derive_field_mask(shared_secret, index);\n if unmasked.lt(TWO_POW_248) {\n Option::some(unmasked)\n } else {\n Option::none()\n }\n}\n\n/// Derives a field mask from an ECDH shared secret and field index. Applied only to data fields (those carrying\n/// packed message bytes). Padding fields use `random()` instead.\nfn derive_field_mask(shared_secret: Point, index: u32) -> Field {\n poseidon2_hash_with_separator(\n [shared_secret.x, shared_secret.y],\n DOM_SEP__CIPHERTEXT_FIELD_MASK + index,\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(\"aztec_utl_getRandomField\").returns(eph_sk).times(1);\n\n let randomness = 0x0101010101010101010101010101010101010101010101010101010101010101;\n let _ = OracleMock::mock(\"aztec_utl_getRandomField\").returns(randomness).times(1000000);\n\n let _ = OracleMock::mock(\"aztec_prv_getNextAppTagAsSender\").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(\"aztec_utl_getSharedSecret\").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 // Documents the PKCS#7 padding behavior that `encrypt` relies on (see its static_assert).\n #[test]\n fn pkcs7_padding_always_adds_at_least_one_byte() {\n let key = [0 as u8; 16];\n let iv = [0 as u8; 16];\n\n // 1 byte input + 15 bytes padding = 16 bytes\n assert_eq(std::aes128::aes128_encrypt([0; 1], iv, key).len(), 16);\n\n // 15 bytes input + 1 byte padding = 16 bytes\n assert_eq(std::aes128::aes128_encrypt([0; 15], iv, key).len(), 16);\n\n // 16 bytes input (block-aligned) + full 16-byte padding block = 32 bytes\n assert_eq(std::aes128::aes128_encrypt([0; 16], iv, key).len(), 32);\n }\n\n #[test]\n unconstrained fn encrypt_decrypt_max_size_plaintext() {\n let mut env = TestEnvironment::new();\n let recipient = env.create_light_account();\n\n env.private_context(|_| {\n let mut plaintext = [0; MESSAGE_PLAINTEXT_LEN];\n for i in 0..MESSAGE_PLAINTEXT_LEN {\n plaintext[i] = i as Field;\n }\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(should_fail_with = \"Plaintext length exceeds MESSAGE_PLAINTEXT_LEN\")]\n unconstrained fn encrypt_oversized_plaintext() {\n let address = AztecAddress { inner: 3 };\n let plaintext: [Field; MESSAGE_PLAINTEXT_LEN + 1] = [0; MESSAGE_PLAINTEXT_LEN + 1];\n let _ = AES128::encrypt(plaintext, 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"
|
|
4310
4318
|
},
|
|
4311
|
-
"
|
|
4319
|
+
"137": {
|
|
4312
4320
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/logs/event.nr",
|
|
4313
4321
|
"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"
|
|
4314
4322
|
},
|
|
4315
|
-
"
|
|
4323
|
+
"139": {
|
|
4316
4324
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/logs/note.nr",
|
|
4317
4325
|
"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, MAX_NOTE_PACKED_LEN},\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 #[derive(Packable)]\n struct MaxSizeNote {\n data: [Field; MAX_NOTE_PACKED_LEN],\n }\n\n impl NoteType for MaxSizeNote {\n fn get_id() -> Field {\n 0\n }\n }\n\n #[test]\n unconstrained fn encode_decode_max_size_note() {\n let mut data = [0; MAX_NOTE_PACKED_LEN];\n for i in 0..MAX_NOTE_PACKED_LEN {\n data[i] = i as Field;\n }\n let note = MaxSizeNote { data };\n\n let encoded = encode_private_note_message(note, OWNER, STORAGE_SLOT, RANDOMNESS);\n let (msg_type_id, msg_metadata, msg_content) = decode_message(BoundedVec::from_array(encoded));\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, MaxSizeNote::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(data));\n }\n\n #[derive(Packable)]\n struct OversizedNote {\n data: [Field; MAX_NOTE_PACKED_LEN + 1],\n }\n\n impl NoteType for OversizedNote {\n fn get_id() -> Field {\n 0\n }\n }\n\n #[test(should_fail_with = \"Invalid message content: it must have a length of at most MAX_MESSAGE_CONTENT_LEN\")]\n fn encode_oversized_note_fails() {\n let note = OversizedNote { data: [0; MAX_NOTE_PACKED_LEN + 1] };\n let _ = encode_private_note_message(note, OWNER, STORAGE_SLOT, RANDOMNESS);\n }\n}\n"
|
|
4318
4326
|
},
|
|
4319
|
-
"
|
|
4327
|
+
"140": {
|
|
4320
4328
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/logs/partial_note.nr",
|
|
4321
4329
|
"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"
|
|
4322
4330
|
},
|
|
4323
|
-
"
|
|
4331
|
+
"150": {
|
|
4324
4332
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/processing/mod.nr",
|
|
4325
4333
|
"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 and storage by PXE.\n///\n/// Once validated, the note becomes retrievable via the `get_notes` oracle. The note will be scoped to\n/// `contract_address`, meaning other contracts will not be able to 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 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 and storage by PXE.\n///\n/// This is the primary way for custom message handlers (registered via\n/// [`crate::macros::AztecConfig::custom_message_handler`]) to deliver reassembled events back to PXE after processing\n/// application-specific message formats.\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).\n///\n/// Note that `validate_and_store_enqueued_notes_and_events` is called by Aztec.nr after processing messages, so custom\n/// message processors do not need to be concerned with this.\npub 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 and stores all enqueued notes and events.\n///\n/// Processes all requests enqueued via [`enqueue_note_for_validation`] and [`enqueue_event_for_validation`], inserting\n/// them into the note database and event store respectively, making them queryable via `get_notes` oracle and our TS\n/// 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"
|
|
4326
4334
|
},
|
|
@@ -4332,67 +4340,67 @@
|
|
|
4332
4340
|
"path": "std/field/mod.nr",
|
|
4333
4341
|
"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"
|
|
4334
4342
|
},
|
|
4335
|
-
"
|
|
4343
|
+
"173": {
|
|
4336
4344
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/call_private_function.nr",
|
|
4337
|
-
"source": "use crate::protocol::{abis::function_selector::FunctionSelector, address::AztecAddress, utils::reader::Reader};\n\n#[oracle(
|
|
4345
|
+
"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"
|
|
4338
4346
|
},
|
|
4339
|
-
"
|
|
4347
|
+
"174": {
|
|
4340
4348
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/capsules.nr",
|
|
4341
|
-
"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"
|
|
4349
|
+
"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(aztec_utl_storeCapsule)]\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(aztec_utl_loadCapsule)]\nunconstrained fn load_oracle<let N: u32>(\n contract_address: AztecAddress,\n slot: Field,\n array_len: u32,\n) -> Option<[Field; N]> {}\n\n#[oracle(aztec_utl_deleteCapsule)]\nunconstrained fn delete_oracle(contract_address: AztecAddress, slot: Field) {}\n\n#[oracle(aztec_utl_copyCapsule)]\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"
|
|
4342
4350
|
},
|
|
4343
|
-
"
|
|
4351
|
+
"175": {
|
|
4344
4352
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/enqueue_public_function_call.nr",
|
|
4345
|
-
"source": "use crate::protocol::address::AztecAddress;\n\n#[oracle(
|
|
4353
|
+
"source": "use crate::protocol::address::AztecAddress;\n\n#[oracle(aztec_prv_notifyEnqueuedPublicFunctionCall)]\nunconstrained fn notify_enqueued_public_function_call_oracle(\n _contract_address: AztecAddress,\n _calldata_hash: Field,\n _side_effect_counter: u32,\n _is_static_call: bool,\n) {}\n\nunconstrained fn notify_enqueued_public_function_call_wrapper(\n contract_address: AztecAddress,\n calldata_hash: Field,\n side_effect_counter: u32,\n is_static_call: bool,\n) {\n notify_enqueued_public_function_call_oracle(\n contract_address,\n calldata_hash,\n side_effect_counter,\n is_static_call,\n )\n}\n\npub fn notify_enqueued_public_function_call(\n contract_address: AztecAddress,\n calldata_hash: Field,\n side_effect_counter: u32,\n is_static_call: bool,\n) {\n // Safety: Notifies the simulator that a public call has been enqueued, allowing it to prepare hints for the AVM to\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(aztec_prv_notifySetPublicTeardownFunctionCall)]\nunconstrained fn notify_set_public_teardown_function_call_oracle(\n _contract_address: AztecAddress,\n _calldata_hash: Field,\n _side_effect_counter: u32,\n _is_static_call: bool,\n) {}\n\nunconstrained fn notify_set_public_teardown_function_call_wrapper(\n contract_address: AztecAddress,\n calldata_hash: Field,\n side_effect_counter: u32,\n is_static_call: bool,\n) {\n notify_set_public_teardown_function_call_oracle(\n contract_address,\n calldata_hash,\n side_effect_counter,\n is_static_call,\n )\n}\n\npub fn notify_set_public_teardown_function_call(\n contract_address: AztecAddress,\n calldata_hash: Field,\n side_effect_counter: u32,\n is_static_call: bool,\n) {\n // Safety: Notifies the simulator that a teardown call has been set, allowing it to prepare hints for the AVM to\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(aztec_prv_notifySetMinRevertibleSideEffectCounter)]\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(aztec_prv_isSideEffectCounterRevertible)]\nunconstrained fn is_side_effect_counter_revertible_oracle(counter: u32) -> bool {}\n"
|
|
4346
4354
|
},
|
|
4347
|
-
"
|
|
4355
|
+
"176": {
|
|
4348
4356
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/execution.nr",
|
|
4349
|
-
"source": "use crate::context::UtilityContext;\n\n#[oracle(
|
|
4357
|
+
"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"
|
|
4350
4358
|
},
|
|
4351
|
-
"
|
|
4359
|
+
"177": {
|
|
4352
4360
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/execution_cache.nr",
|
|
4353
|
-
"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(
|
|
4361
|
+
"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(aztec_prv_storeInExecutionCache)]\nunconstrained fn store_in_execution_cache_oracle<let N: u32>(_values: [Field; N], _hash: Field) {}\n\n#[oracle(aztec_prv_loadFromExecutionCache)]\nunconstrained fn load_from_execution_cache_oracle<let N: u32>(_hash: Field) -> [Field; N] {}\n"
|
|
4354
4362
|
},
|
|
4355
4363
|
"18": {
|
|
4356
4364
|
"path": "std/hash/mod.nr",
|
|
4357
4365
|
"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"
|
|
4358
4366
|
},
|
|
4359
|
-
"
|
|
4367
|
+
"186": {
|
|
4360
4368
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/message_processing.nr",
|
|
4361
|
-
"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(
|
|
4369
|
+
"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(aztec_utl_fetchTaggedLogs)]\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(aztec_utl_validateAndStoreEnqueuedNotesAndEvents)]\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(aztec_utl_bulkRetrieveLogs)]\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"
|
|
4362
4370
|
},
|
|
4363
|
-
"
|
|
4371
|
+
"188": {
|
|
4364
4372
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/notes.nr",
|
|
4365
|
-
"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(
|
|
4373
|
+
"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 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(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"
|
|
4366
4374
|
},
|
|
4367
|
-
"
|
|
4375
|
+
"189": {
|
|
4368
4376
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/nullifiers.nr",
|
|
4369
|
-
"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(
|
|
4377
|
+
"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`).\npub unconstrained fn check_nullifier_exists(inner_nullifier: Field) -> bool {\n check_nullifier_exists_oracle(inner_nullifier)\n}\n\n#[oracle(aztec_utl_checkNullifierExists)]\nunconstrained fn check_nullifier_exists_oracle(_inner_nullifier: Field) -> bool {}\n"
|
|
4370
4378
|
},
|
|
4371
|
-
"
|
|
4379
|
+
"192": {
|
|
4372
4380
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/shared_secret.nr",
|
|
4373
|
-
"source": "use crate::protocol::{address::aztec_address::AztecAddress, point::Point};\n\n// TODO(#12656): return an app-siloed secret + document this\n#[oracle(
|
|
4381
|
+
"source": "use crate::protocol::{address::aztec_address::AztecAddress, point::Point};\n\n// TODO(#12656): return an app-siloed secret + document this\n#[oracle(aztec_utl_getSharedSecret)]\nunconstrained fn get_shared_secret_oracle(address: AztecAddress, ephPk: Point) -> Point {}\n\n/// Returns an app-siloed shared secret between `address` and someone who knows the secret key behind an 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"
|
|
4374
4382
|
},
|
|
4375
|
-
"
|
|
4383
|
+
"194": {
|
|
4376
4384
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/version.nr",
|
|
4377
|
-
"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 `
|
|
4385
|
+
"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\n/// and if the oracle version is incompatible an error is thrown.\npub global ORACLE_VERSION: Field = 14;\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 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"
|
|
4378
4386
|
},
|
|
4379
|
-
"
|
|
4387
|
+
"243": {
|
|
4380
4388
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/subarray.nr",
|
|
4381
4389
|
"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"
|
|
4382
4390
|
},
|
|
4383
|
-
"
|
|
4391
|
+
"244": {
|
|
4384
4392
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/subbvec.nr",
|
|
4385
4393
|
"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"
|
|
4386
4394
|
},
|
|
4387
|
-
"
|
|
4395
|
+
"247": {
|
|
4388
4396
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/conversion/bytes_to_fields.nr",
|
|
4389
4397
|
"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"
|
|
4390
4398
|
},
|
|
4391
|
-
"
|
|
4399
|
+
"248": {
|
|
4392
4400
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/conversion/fields_to_bytes.nr",
|
|
4393
4401
|
"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"
|
|
4394
4402
|
},
|
|
4395
|
-
"
|
|
4403
|
+
"251": {
|
|
4396
4404
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/point.nr",
|
|
4397
4405
|
"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"
|
|
4398
4406
|
},
|
|
@@ -4402,19 +4410,19 @@
|
|
|
4402
4410
|
},
|
|
4403
4411
|
"3": {
|
|
4404
4412
|
"path": "std/array/mod.nr",
|
|
4405
|
-
"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"
|
|
4413
|
+
"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 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 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 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 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"
|
|
4406
4414
|
},
|
|
4407
4415
|
"319": {
|
|
4408
4416
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/address/aztec_address.nr",
|
|
4409
|
-
"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"
|
|
4417
|
+
"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"
|
|
4410
4418
|
},
|
|
4411
4419
|
"350": {
|
|
4412
4420
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/hash.nr",
|
|
4413
|
-
"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"
|
|
4421
|
+
"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 values_to_hash = [3; 17];\n let 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 values_to_hash = [3; 17];\n let 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"
|
|
4414
4422
|
},
|
|
4415
4423
|
"352": {
|
|
4416
4424
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/logging.nr",
|
|
4417
|
-
"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(
|
|
4425
|
+
"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(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"
|
|
4418
4426
|
},
|
|
4419
4427
|
"367": {
|
|
4420
4428
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/poseidon2.nr",
|
|
@@ -4466,15 +4474,15 @@
|
|
|
4466
4474
|
},
|
|
4467
4475
|
"59": {
|
|
4468
4476
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/capsules/mod.nr",
|
|
4469
|
-
"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"
|
|
4477
|
+
"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 /// 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 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 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"
|
|
4470
4478
|
},
|
|
4471
4479
|
"6": {
|
|
4472
4480
|
"path": "std/collections/bounded_vec.nr",
|
|
4473
|
-
"source": "use crate::{cmp::Eq, convert::From, runtime::is_unconstrained, static_assert};\n\n/// A `BoundedVec<T, MaxLen>` is a growable storage similar to a built-in vector except that it\n/// is bounded with a maximum possible length. `BoundedVec` is also not\n/// subject to the same restrictions vectors are (notably, nested vectors are disallowed).\n///\n/// Since a BoundedVec is backed by a normal array under the hood, growing the BoundedVec by\n/// pushing an additional element is also more efficient - the length only needs to be increased\n/// by one.\n///\n/// For these reasons `BoundedVec<T, N>` should generally be preferred over vectors when there\n/// is a reasonable maximum bound that can be placed on the vector.\n///\n/// Example:\n///\n/// ```noir\n/// let mut vector: BoundedVec<Field, 10> = BoundedVec::new();\n/// for i in 0..5 {\n/// vector.push(i);\n/// }\n/// assert(vector.len() == 5);\n/// assert(vector.max_len() == 10);\n/// ```\npub struct BoundedVec<T, let MaxLen: u32> {\n storage: [T; MaxLen],\n len: u32,\n}\n\nimpl<T, let MaxLen: u32> BoundedVec<T, MaxLen> {\n /// Creates a new, empty vector of length zero.\n ///\n /// Since this container is backed by an array internally, it still needs an initial value\n /// to give each element. To resolve this, each element is zeroed internally. This value\n /// is guaranteed to be inaccessible unless `get_unchecked` is used.\n ///\n /// Example:\n ///\n /// ```noir\n /// let empty_vector: BoundedVec<Field, 10> = BoundedVec::new();\n /// assert(empty_vector.len() == 0);\n /// ```\n ///\n /// Note that whenever calling `new` the maximum length of the vector should always be specified\n /// via a type signature:\n ///\n /// ```noir\n /// fn good() -> BoundedVec<Field, 10> {\n /// // Ok! MaxLen is specified with a type annotation\n /// let v1: BoundedVec<Field, 3> = BoundedVec::new();\n /// let v2 = BoundedVec::new();\n ///\n /// // Ok! MaxLen is known from the type of `good`'s return value\n /// v2\n /// }\n ///\n /// fn bad() {\n /// // Error: Type annotation needed\n /// // The compiler can't infer `MaxLen` from the following code:\n /// let mut v3 = BoundedVec::new();\n /// v3.push(5);\n /// }\n /// ```\n ///\n /// This defaulting of `MaxLen` (and numeric generics in general) to zero may change in future noir versions\n /// but for now make sure to use type annotations when using bounded vectors. Otherwise, you will receive a\n /// constraint failure at runtime when the vec is pushed to.\n pub fn new() -> Self {\n let zeroed = crate::mem::zeroed();\n BoundedVec { storage: [zeroed; MaxLen], len: 0 }\n }\n\n /// Retrieves an element from the vector at the given index, starting from zero.\n ///\n /// If the given index is equal to or greater than the length of the vector, this\n /// will issue a constraint failure.\n ///\n /// Example:\n ///\n /// ```noir\n /// fn foo<let N: u32>(v: BoundedVec<u32, N>) {\n /// let first = v.get(0);\n /// let last = v.get(v.len() - 1);\n /// assert(first != last);\n /// }\n /// ```\n pub fn get(self, index: u32) -> T {\n assert(index < self.len, \"Attempted to read past end of BoundedVec\");\n self.get_unchecked(index)\n }\n\n /// Retrieves an element from the vector at the given index, starting from zero, without\n /// performing a bounds check.\n ///\n /// Since this function does not perform a bounds check on length before accessing the element,\n /// it is unsafe! Use at your own risk!\n ///\n /// Example:\n ///\n /// ```noir\n /// fn sum_of_first_three<let N: u32>(v: BoundedVec<u32, N>) -> u32 {\n /// // Always ensure the length is larger than the largest\n /// // index passed to get_unchecked\n /// assert(v.len() > 2);\n /// let first = v.get_unchecked(0);\n /// let second = v.get_unchecked(1);\n /// let third = v.get_unchecked(2);\n /// first + second + third\n /// }\n /// ```\n pub fn get_unchecked(self, index: u32) -> T {\n self.storage[index]\n }\n\n /// Writes an element to the vector at the given index, starting from zero.\n ///\n /// If the given index is equal to or greater than the length of the vector, this will issue a constraint failure.\n ///\n /// Example:\n ///\n /// ```noir\n /// fn foo<let N: u32>(v: BoundedVec<u32, N>) {\n /// let first = v.get(0);\n /// assert(first != 42);\n /// v.set(0, 42);\n /// let new_first = v.get(0);\n /// assert(new_first == 42);\n /// }\n /// ```\n pub fn set(&mut self, index: u32, value: T) {\n assert(index < self.len, \"Attempted to write past end of BoundedVec\");\n self.set_unchecked(index, value)\n }\n\n /// Writes an element to the vector at the given index, starting from zero, without performing a bounds check.\n ///\n /// Since this function does not perform a bounds check on length before accessing the element, it is unsafe! Use at your own risk!\n ///\n /// Example:\n ///\n /// ```noir\n /// fn set_unchecked_example() {\n /// let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n /// vec.extend_from_array([1, 2]);\n ///\n /// // Here we're safely writing within the valid range of `vec`\n /// // `vec` now has the value [42, 2]\n /// vec.set_unchecked(0, 42);\n ///\n /// // We can then safely read this value back out of `vec`.\n /// // Notice that we use the checked version of `get` which would prevent reading unsafe values.\n /// assert_eq(vec.get(0), 42);\n ///\n /// // We've now written past the end of `vec`.\n /// // As this index is still within the maximum potential length of `v`,\n /// // it won't cause a constraint failure.\n /// vec.set_unchecked(2, 42);\n /// println(vec);\n ///\n /// // This will write past the end of the maximum potential length of `vec`,\n /// // it will then trigger a constraint failure.\n /// vec.set_unchecked(5, 42);\n /// println(vec);\n /// }\n /// ```\n pub fn set_unchecked(&mut self, index: u32, value: T) {\n self.storage[index] = value;\n }\n\n /// Pushes an element to the end of the vector. This increases the length\n /// of the vector by one.\n ///\n /// Panics if the new length of the vector will be greater than the max length.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<Field, 2> = BoundedVec::new();\n ///\n /// v.push(1);\n /// v.push(2);\n ///\n /// // Panics with failed assertion \"push out of bounds\"\n /// v.push(3);\n /// ```\n pub fn push(&mut self, elem: T) {\n assert(self.len < MaxLen, \"push out of bounds\");\n\n self.storage[self.len] = elem;\n self.len += 1;\n }\n\n /// Returns the current length of this vector\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<Field, 4> = BoundedVec::new();\n /// assert(v.len() == 0);\n ///\n /// v.push(100);\n /// assert(v.len() == 1);\n ///\n /// v.push(200);\n /// v.push(300);\n /// v.push(400);\n /// assert(v.len() == 4);\n ///\n /// let _ = v.pop();\n /// let _ = v.pop();\n /// assert(v.len() == 2);\n /// ```\n pub fn len(self) -> u32 {\n self.len\n }\n\n /// Returns the maximum length of this vector. This is always\n /// equal to the `MaxLen` parameter this vector was initialized with.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<Field, 5> = BoundedVec::new();\n ///\n /// assert(v.max_len() == 5);\n /// v.push(10);\n /// assert(v.max_len() == 5);\n /// ```\n pub fn max_len(_self: BoundedVec<T, MaxLen>) -> u32 {\n MaxLen\n }\n\n /// Returns the internal array within this vector.\n ///\n /// Since arrays in Noir are immutable, mutating the returned storage array will not mutate\n /// the storage held internally by this vector.\n ///\n /// Note that uninitialized elements may be zeroed out!\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<Field, 5> = BoundedVec::new();\n ///\n /// assert(v.storage() == [0, 0, 0, 0, 0]);\n ///\n /// v.push(57);\n /// assert(v.storage() == [57, 0, 0, 0, 0]);\n /// ```\n pub fn storage(self) -> [T; MaxLen] {\n self.storage\n }\n\n /// Pushes each element from the given array to this vector.\n ///\n /// Panics if pushing each element would cause the length of this vector\n /// to exceed the maximum length.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut vec: BoundedVec<Field, 3> = BoundedVec::new();\n /// vec.extend_from_array([2, 4]);\n ///\n /// assert(vec.len == 2);\n /// assert(vec.get(0) == 2);\n /// assert(vec.get(1) == 4);\n /// ```\n pub fn extend_from_array<let Len: u32>(&mut self, array: [T; Len]) {\n let new_len = self.len + array.len();\n assert(new_len <= MaxLen, \"extend_from_array out of bounds\");\n for i in 0..array.len() {\n self.storage[self.len + i] = array[i];\n }\n self.len = new_len;\n }\n\n /// Pushes each element from the given vector to this vector.\n ///\n /// Panics if pushing each element would cause the length of this vector\n /// to exceed the maximum length.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut vec: BoundedVec<Field, 3> = BoundedVec::new();\n /// vec.extend_from_vector([2, 4].as_vector());\n ///\n /// assert(vec.len == 2);\n /// assert(vec.get(0) == 2);\n /// assert(vec.get(1) == 4);\n /// ```\n pub fn extend_from_vector(&mut self, vector: [T]) {\n let new_len = self.len + vector.len();\n assert(new_len <= MaxLen, \"extend_from_vector out of bounds\");\n for i in 0..vector.len() {\n self.storage[self.len + i] = vector[i];\n }\n self.len = new_len;\n }\n\n /// Pushes each element from the other vector to this vector. The length of\n /// the other vector is left unchanged.\n ///\n /// Panics if pushing each element would cause the length of this vector\n /// to exceed the maximum length.\n ///\n /// ```noir\n /// let mut v1: BoundedVec<Field, 5> = BoundedVec::new();\n /// let mut v2: BoundedVec<Field, 7> = BoundedVec::new();\n ///\n /// v2.extend_from_array([1, 2, 3]);\n /// v1.extend_from_bounded_vec(v2);\n ///\n /// assert(v1.storage() == [1, 2, 3, 0, 0]);\n /// assert(v2.storage() == [1, 2, 3, 0, 0, 0, 0]);\n /// ```\n pub fn extend_from_bounded_vec<let Len: u32>(&mut self, vec: BoundedVec<T, Len>) {\n let append_len = vec.len();\n let new_len = self.len + append_len;\n assert(new_len <= MaxLen, \"extend_from_bounded_vec out of bounds\");\n\n if is_unconstrained() {\n for i in 0..append_len {\n self.storage[self.len + i] = vec.get_unchecked(i);\n }\n } else {\n for i in 0..Len {\n if i < append_len {\n self.storage[self.len + i] = vec.get_unchecked(i);\n }\n }\n }\n self.len = new_len;\n }\n\n /// Creates a new vector, populating it with values derived from an array input.\n /// The maximum length of the vector is determined based on the type signature.\n ///\n /// Example:\n ///\n /// ```noir\n /// let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from_array([1, 2, 3])\n /// ```\n pub fn from_array<let Len: u32>(array: [T; Len]) -> Self {\n static_assert(Len <= MaxLen, \"from array out of bounds\");\n let mut vec: BoundedVec<T, MaxLen> = BoundedVec::new();\n vec.extend_from_array(array);\n vec\n }\n\n /// Pops the element at the end of the vector. This will decrease the length\n /// of the vector by one.\n ///\n /// Panics if the vector is empty.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<Field, 2> = BoundedVec::new();\n /// v.push(1);\n /// v.push(2);\n ///\n /// let two = v.pop();\n /// let one = v.pop();\n ///\n /// assert(two == 2);\n /// assert(one == 1);\n ///\n /// // error: cannot pop from an empty vector\n /// let _ = v.pop();\n /// ```\n pub fn pop(&mut self) -> T {\n assert(self.len > 0, \"cannot pop from an empty vector\");\n self.len -= 1;\n\n let elem = self.storage[self.len];\n self.storage[self.len] = crate::mem::zeroed();\n elem\n }\n\n /// Returns true if the given predicate returns true for any element\n /// in this vector.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<u32, 3> = BoundedVec::new();\n /// v.extend_from_array([2, 4, 6]);\n ///\n /// let all_even = !v.any(|elem: u32| elem % 2 != 0);\n /// assert(all_even);\n /// ```\n pub fn any<Env>(self, predicate: fn[Env](T) -> bool) -> bool {\n let mut ret = false;\n if is_unconstrained() {\n for i in 0..self.len {\n ret |= predicate(self.storage[i]);\n }\n } else {\n let mut exceeded_len = false;\n for i in 0..MaxLen {\n exceeded_len |= i == self.len;\n if !exceeded_len {\n ret |= predicate(self.storage[i]);\n }\n }\n }\n ret\n }\n\n /// Creates a new vector of equal size by calling a closure on each element in this vector.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n /// let result = vec.map(|value| value * 2);\n ///\n /// let expected = BoundedVec::from_array([2, 4, 6, 8]);\n /// assert_eq(result, expected);\n /// ```\n pub fn map<U, Env>(self, f: fn[Env](T) -> U) -> BoundedVec<U, MaxLen> {\n let mut ret = BoundedVec::new();\n ret.len = self.len();\n\n if is_unconstrained() {\n for i in 0..self.len() {\n ret.storage[i] = f(self.get_unchecked(i));\n }\n } else {\n for i in 0..MaxLen {\n if i < self.len() {\n ret.storage[i] = f(self.get_unchecked(i));\n }\n }\n }\n\n ret\n }\n\n /// Creates a new vector of equal size by calling a closure on each element\n /// in this vector, along with its index.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n /// let result = vec.mapi(|i, value| i + value * 2);\n ///\n /// let expected = BoundedVec::from_array([2, 5, 8, 11]);\n /// assert_eq(result, expected);\n /// ```\n pub fn mapi<U, Env>(self, f: fn[Env](u32, T) -> U) -> BoundedVec<U, MaxLen> {\n let mut ret = BoundedVec::new();\n ret.len = self.len();\n\n if is_unconstrained() {\n for i in 0..self.len() {\n ret.storage[i] = f(i, self.get_unchecked(i));\n }\n } else {\n for i in 0..MaxLen {\n if i < self.len() {\n ret.storage[i] = f(i, self.get_unchecked(i));\n }\n }\n }\n\n ret\n }\n\n /// Calls a closure on each element in this vector.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n /// let mut result = BoundedVec::<u32, 4>::new();\n /// vec.for_each(|value| result.push(value * 2));\n ///\n /// let expected = BoundedVec::from_array([2, 4, 6, 8]);\n /// assert_eq(result, expected);\n /// ```\n pub fn for_each<Env>(self, f: fn[Env](T) -> ()) {\n if is_unconstrained() {\n for i in 0..self.len() {\n f(self.get_unchecked(i));\n }\n } else {\n for i in 0..MaxLen {\n if i < self.len() {\n f(self.get_unchecked(i));\n }\n }\n }\n }\n\n /// Calls a closure on each element in this vector, along with its index.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n /// let mut result = BoundedVec::<u32, 4>::new();\n /// vec.for_eachi(|i, value| result.push(i + value * 2));\n ///\n /// let expected = BoundedVec::from_array([2, 5, 8, 11]);\n /// assert_eq(result, expected);\n /// ```\n pub fn for_eachi<Env>(self, f: fn[Env](u32, T) -> ()) {\n if is_unconstrained() {\n for i in 0..self.len() {\n f(i, self.get_unchecked(i));\n }\n } else {\n for i in 0..MaxLen {\n if i < self.len() {\n f(i, self.get_unchecked(i));\n }\n }\n }\n }\n\n /// Creates a new BoundedVec from the given array and length.\n /// The given length must be less than or equal to the length of the array.\n ///\n /// This function will zero out any elements at or past index `len` of `array`.\n /// This incurs an extra runtime cost of O(MaxLen). If you are sure your array is\n /// zeroed after that index, you can use [`from_parts_unchecked`][Self::from_parts_unchecked] to remove the extra loop.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 0], 3);\n /// assert_eq(vec.len(), 3);\n /// ```\n pub fn from_parts(mut array: [T; MaxLen], len: u32) -> Self {\n assert(len <= MaxLen);\n let zeroed = crate::mem::zeroed();\n\n if is_unconstrained() {\n for i in len..MaxLen {\n array[i] = zeroed;\n }\n } else {\n for i in 0..MaxLen {\n if i >= len {\n array[i] = zeroed;\n }\n }\n }\n\n BoundedVec { storage: array, len }\n }\n\n /// Creates a new BoundedVec from the given array and length.\n /// The given length must be less than or equal to the length of the array.\n ///\n /// This function is unsafe because it expects all elements past the `len` index\n /// of `array` to be zeroed, but does not check for this internally. Use `from_parts`\n /// for a safe version of this function which does zero out any indices past the\n /// given length. Invalidating this assumption can notably cause `BoundedVec::eq`\n /// to give incorrect results since it will check even elements past `len`.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 0], 3);\n /// assert_eq(vec.len(), 3);\n ///\n /// // invalid use!\n /// let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 1], 3);\n /// let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 2], 3);\n ///\n /// // both vecs have length 3 so we'd expect them to be equal, but this\n /// // fails because elements past the length are still checked in eq\n /// assert_eq(vec1, vec2); // fails\n /// ```\n pub fn from_parts_unchecked(array: [T; MaxLen], len: u32) -> Self {\n assert(len <= MaxLen);\n BoundedVec { storage: array, len }\n }\n}\n\nimpl<T, let MaxLen: u32> Eq for BoundedVec<T, MaxLen>\nwhere\n T: Eq,\n{\n fn eq(self, other: BoundedVec<T, MaxLen>) -> bool {\n // TODO: https://github.com/noir-lang/noir/issues/4837\n //\n // We make the assumption that the user has used the proper interface for working with `BoundedVec`s\n // rather than directly manipulating the internal fields as this can result in an inconsistent internal state.\n if self.len == other.len {\n self.storage == other.storage\n } else {\n false\n }\n }\n}\n\nimpl<T, let MaxLen: u32, let Len: u32> From<[T; Len]> for BoundedVec<T, MaxLen> {\n fn from(array: [T; Len]) -> BoundedVec<T, MaxLen> {\n BoundedVec::from_array(array)\n }\n}\n\nmod bounded_vec_tests {\n\n mod get {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n fn panics_when_reading_elements_past_end_of_vec() {\n let vec: BoundedVec<Field, 5> = BoundedVec::new();\n\n let _ = vec.get(0);\n }\n\n #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n fn panics_when_reading_beyond_length() {\n let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n let _ = vec.get(3);\n }\n\n #[test]\n fn get_works_within_bounds() {\n let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n assert_eq(vec.get(0), 1);\n assert_eq(vec.get(2), 3);\n assert_eq(vec.get(4), 5);\n }\n\n #[test]\n fn get_unchecked_works() {\n let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n assert_eq(vec.get_unchecked(0), 1);\n assert_eq(vec.get_unchecked(2), 3);\n }\n\n #[test]\n fn get_unchecked_works_past_len() {\n let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n assert_eq(vec.get_unchecked(4), 0);\n }\n }\n\n mod set {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn set_updates_values_properly() {\n let mut vec = BoundedVec::from_array([0, 0, 0, 0, 0]);\n\n vec.set(0, 42);\n assert_eq(vec.storage, [42, 0, 0, 0, 0]);\n\n vec.set(1, 43);\n assert_eq(vec.storage, [42, 43, 0, 0, 0]);\n\n vec.set(2, 44);\n assert_eq(vec.storage, [42, 43, 44, 0, 0]);\n\n vec.set(1, 10);\n assert_eq(vec.storage, [42, 10, 44, 0, 0]);\n\n vec.set(0, 0);\n assert_eq(vec.storage, [0, 10, 44, 0, 0]);\n }\n\n #[test(should_fail_with = \"Attempted to write past end of BoundedVec\")]\n fn panics_when_writing_elements_past_end_of_vec() {\n let mut vec: BoundedVec<Field, 5> = BoundedVec::new();\n vec.set(0, 42);\n }\n\n #[test(should_fail_with = \"Attempted to write past end of BoundedVec\")]\n fn panics_when_setting_beyond_length() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n vec.set(3, 4);\n }\n\n #[test]\n fn set_unchecked_operations() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n vec.push(1);\n vec.push(2);\n\n vec.set_unchecked(0, 10);\n assert_eq(vec.get(0), 10);\n }\n\n #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n fn set_unchecked_operations_past_len() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n vec.push(1);\n vec.push(2);\n\n vec.set_unchecked(3, 40);\n assert_eq(vec.get(3), 40);\n }\n\n #[test]\n fn set_preserves_other_elements() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n\n vec.set(2, 30);\n assert_eq(vec.get(0), 1);\n assert_eq(vec.get(1), 2);\n assert_eq(vec.get(2), 30);\n assert_eq(vec.get(3), 4);\n assert_eq(vec.get(4), 5);\n }\n }\n\n mod any {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn returns_false_if_predicate_not_satisfied() {\n let vec: BoundedVec<bool, 4> = BoundedVec::from_array([false, false, false, false]);\n let result = vec.any(|value| value);\n\n assert(!result);\n }\n\n #[test]\n fn returns_true_if_predicate_satisfied() {\n let vec: BoundedVec<bool, 4> = BoundedVec::from_array([false, false, true, true]);\n let result = vec.any(|value| value);\n\n assert(result);\n }\n\n #[test]\n fn returns_false_on_empty_boundedvec() {\n let vec: BoundedVec<bool, 0> = BoundedVec::new();\n let result = vec.any(|value| value);\n\n assert(!result);\n }\n\n #[test]\n fn any_with_complex_predicates() {\n let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n\n assert(vec.any(|x| x > 3));\n assert(!vec.any(|x| x > 10));\n assert(vec.any(|x| x % 2 == 0)); // has a even number\n assert(vec.any(|x| x == 3)); // has a specific value\n }\n\n #[test]\n fn any_with_partial_vector() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n vec.push(1);\n vec.push(2);\n\n assert(vec.any(|x| x == 1));\n assert(vec.any(|x| x == 2));\n assert(!vec.any(|x| x == 3));\n }\n }\n\n mod map {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn applies_function_correctly() {\n // docs:start:bounded-vec-map-example\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = vec.map(|value| value * 2);\n // docs:end:bounded-vec-map-example\n let expected = BoundedVec::from_array([2, 4, 6, 8]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn applies_function_that_changes_return_type() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = vec.map(|value| (value * 2) as Field);\n let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 4, 6, 8]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn does_not_apply_function_past_len() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n let result = vec.map(|value| if value == 0 { 5 } else { value });\n let expected = BoundedVec::from_array([5, 1]);\n\n assert_eq(result, expected);\n assert_eq(result.get_unchecked(2), 0);\n }\n\n #[test]\n fn map_with_conditional_logic() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n\n let result = vec.map(|x| if x % 2 == 0 { x * 2 } else { x });\n let expected = BoundedVec::from_array([1, 4, 3, 8]);\n assert_eq(result, expected);\n }\n\n #[test]\n fn map_preserves_length() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = vec.map(|x| x * 2);\n\n assert_eq(result.len(), vec.len());\n assert_eq(result.max_len(), vec.max_len());\n }\n\n #[test]\n fn map_on_empty_vector() {\n let vec: BoundedVec<u32, 5> = BoundedVec::new();\n let result = vec.map(|x| x * 2);\n assert_eq(result, vec);\n assert_eq(result.len(), 0);\n assert_eq(result.max_len(), 5);\n }\n }\n\n mod mapi {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn applies_function_correctly() {\n // docs:start:bounded-vec-mapi-example\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = vec.mapi(|i, value| i + value * 2);\n // docs:end:bounded-vec-mapi-example\n let expected = BoundedVec::from_array([2, 5, 8, 11]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn applies_function_that_changes_return_type() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = vec.mapi(|i, value| (i + value * 2) as Field);\n let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 5, 8, 11]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn does_not_apply_function_past_len() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n let result = vec.mapi(|_, value| if value == 0 { 5 } else { value });\n let expected = BoundedVec::from_array([5, 1]);\n\n assert_eq(result, expected);\n assert_eq(result.get_unchecked(2), 0);\n }\n\n #[test]\n fn mapi_with_index_branching_logic() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n\n let result = vec.mapi(|i, x| if i % 2 == 0 { x * 2 } else { x });\n let expected = BoundedVec::from_array([2, 2, 6, 4]);\n assert_eq(result, expected);\n }\n }\n\n mod for_each {\n use crate::collections::bounded_vec::BoundedVec;\n\n // map in terms of for_each\n fn for_each_map<T, U, Env, let MaxLen: u32>(\n input: BoundedVec<T, MaxLen>,\n f: fn[Env](T) -> U,\n ) -> BoundedVec<U, MaxLen> {\n let mut output = BoundedVec::<U, MaxLen>::new();\n let output_ref = &mut output;\n input.for_each(|x| output_ref.push(f(x)));\n output\n }\n\n #[test]\n fn smoke_test() {\n let mut acc = 0;\n let acc_ref = &mut acc;\n // docs:start:bounded-vec-for-each-example\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n vec.for_each(|value| { *acc_ref += value; });\n // docs:end:bounded-vec-for-each-example\n assert_eq(acc, 6);\n }\n\n #[test]\n fn applies_function_correctly() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = for_each_map(vec, |value| value * 2);\n let expected = BoundedVec::from_array([2, 4, 6, 8]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn applies_function_that_changes_return_type() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = for_each_map(vec, |value| (value * 2) as Field);\n let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 4, 6, 8]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn does_not_apply_function_past_len() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n let result = for_each_map(vec, |value| if value == 0 { 5 } else { value });\n let expected = BoundedVec::from_array([5, 1]);\n\n assert_eq(result, expected);\n assert_eq(result.get_unchecked(2), 0);\n }\n\n #[test]\n fn for_each_on_empty_vector() {\n let vec: BoundedVec<u32, 5> = BoundedVec::new();\n let mut count = 0;\n let count_ref = &mut count;\n vec.for_each(|_| { *count_ref += 1; });\n assert_eq(count, 0);\n }\n\n #[test]\n fn for_each_with_side_effects() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n let mut seen = BoundedVec::<u32, 3>::new();\n let seen_ref = &mut seen;\n vec.for_each(|x| seen_ref.push(x));\n assert_eq(seen, vec);\n }\n }\n\n mod for_eachi {\n use crate::collections::bounded_vec::BoundedVec;\n\n // mapi in terms of for_eachi\n fn for_eachi_mapi<T, U, Env, let MaxLen: u32>(\n input: BoundedVec<T, MaxLen>,\n f: fn[Env](u32, T) -> U,\n ) -> BoundedVec<U, MaxLen> {\n let mut output = BoundedVec::<U, MaxLen>::new();\n let output_ref = &mut output;\n input.for_eachi(|i, x| output_ref.push(f(i, x)));\n output\n }\n\n #[test]\n fn smoke_test() {\n let mut acc = 0;\n let acc_ref = &mut acc;\n // docs:start:bounded-vec-for-eachi-example\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n vec.for_eachi(|i, value| { *acc_ref += i * value; });\n // docs:end:bounded-vec-for-eachi-example\n\n // 0 * 1 + 1 * 2 + 2 * 3\n assert_eq(acc, 8);\n }\n\n #[test]\n fn applies_function_correctly() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = for_eachi_mapi(vec, |i, value| i + value * 2);\n let expected = BoundedVec::from_array([2, 5, 8, 11]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn applies_function_that_changes_return_type() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = for_eachi_mapi(vec, |i, value| (i + value * 2) as Field);\n let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 5, 8, 11]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn does_not_apply_function_past_len() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n let result = for_eachi_mapi(vec, |_, value| if value == 0 { 5 } else { value });\n let expected = BoundedVec::from_array([5, 1]);\n\n assert_eq(result, expected);\n assert_eq(result.get_unchecked(2), 0);\n }\n\n #[test]\n fn for_eachi_on_empty_vector() {\n let vec: BoundedVec<u32, 5> = BoundedVec::new();\n let mut count = 0;\n let count_ref = &mut count;\n vec.for_eachi(|_, _| { *count_ref += 1; });\n assert_eq(count, 0);\n }\n\n #[test]\n fn for_eachi_with_index_tracking() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([10, 20, 30]);\n let mut indices = BoundedVec::<u32, 3>::new();\n let indices_ref = &mut indices;\n vec.for_eachi(|i, _| indices_ref.push(i));\n\n let expected = BoundedVec::from_array([0, 1, 2]);\n assert_eq(indices, expected);\n }\n\n }\n\n mod from_array {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn empty() {\n let empty_array: [Field; 0] = [];\n let bounded_vec = BoundedVec::from_array([]);\n\n assert_eq(bounded_vec.max_len(), 0);\n assert_eq(bounded_vec.len(), 0);\n assert_eq(bounded_vec.storage(), empty_array);\n }\n\n #[test]\n fn equal_len() {\n let array = [1, 2, 3];\n let bounded_vec = BoundedVec::from_array(array);\n\n assert_eq(bounded_vec.max_len(), 3);\n assert_eq(bounded_vec.len(), 3);\n assert_eq(bounded_vec.storage(), array);\n }\n\n #[test]\n fn max_len_greater_then_array_len() {\n let array = [1, 2, 3];\n let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from_array(array);\n\n assert_eq(bounded_vec.max_len(), 10);\n assert_eq(bounded_vec.len(), 3);\n assert_eq(bounded_vec.get(0), 1);\n assert_eq(bounded_vec.get(1), 2);\n assert_eq(bounded_vec.get(2), 3);\n }\n\n #[test(should_fail_with = \"from array out of bounds\")]\n fn max_len_lower_then_array_len() {\n let _: BoundedVec<Field, 2> = BoundedVec::from_array([0; 3]);\n }\n\n #[test]\n fn from_array_preserves_order() {\n let array = [5, 3, 1, 4, 2];\n let vec: BoundedVec<u32, 5> = BoundedVec::from_array(array);\n for i in 0..array.len() {\n assert_eq(vec.get(i), array[i]);\n }\n }\n\n #[test]\n fn from_array_with_different_types() {\n let bool_array = [true, false, true];\n let bool_vec: BoundedVec<bool, 3> = BoundedVec::from_array(bool_array);\n assert_eq(bool_vec.len(), 3);\n assert_eq(bool_vec.get(0), true);\n assert_eq(bool_vec.get(1), false);\n }\n }\n\n mod trait_from {\n use crate::collections::bounded_vec::BoundedVec;\n use crate::convert::From;\n\n #[test]\n fn simple() {\n let array = [1, 2];\n let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from(array);\n\n assert_eq(bounded_vec.max_len(), 10);\n assert_eq(bounded_vec.len(), 2);\n assert_eq(bounded_vec.get(0), 1);\n assert_eq(bounded_vec.get(1), 2);\n }\n }\n\n mod trait_eq {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn empty_equality() {\n let mut bounded_vec1: BoundedVec<Field, 3> = BoundedVec::new();\n let mut bounded_vec2: BoundedVec<Field, 3> = BoundedVec::new();\n\n assert_eq(bounded_vec1, bounded_vec2);\n }\n\n #[test]\n fn inequality() {\n let mut bounded_vec1: BoundedVec<Field, 3> = BoundedVec::new();\n let mut bounded_vec2: BoundedVec<Field, 3> = BoundedVec::new();\n bounded_vec1.push(1);\n bounded_vec2.push(2);\n\n assert(bounded_vec1 != bounded_vec2);\n }\n }\n\n mod from_parts {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn from_parts() {\n // docs:start:from-parts\n let vec: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 0], 3);\n assert_eq(vec.len(), 3);\n\n // Any elements past the given length are zeroed out, so these\n // two BoundedVecs will be completely equal\n let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 1], 3);\n let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 2], 3);\n assert_eq(vec1, vec2);\n // docs:end:from-parts\n }\n\n #[test]\n fn from_parts_unchecked() {\n // docs:start:from-parts-unchecked\n let vec: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 0], 3);\n assert_eq(vec.len(), 3);\n\n // invalid use!\n let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 1], 3);\n let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 2], 3);\n\n // both vecs have length 3 so we'd expect them to be equal, but this\n // fails because elements past the length are still checked in eq\n assert(vec1 != vec2);\n // docs:end:from-parts-unchecked\n }\n }\n\n mod push_pop {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn push_and_pop_operations() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n\n assert_eq(vec.len(), 0);\n\n vec.push(1);\n assert_eq(vec.len(), 1);\n assert_eq(vec.get(0), 1);\n\n vec.push(2);\n assert_eq(vec.len(), 2);\n assert_eq(vec.get(1), 2);\n\n let popped = vec.pop();\n assert_eq(popped, 2);\n assert_eq(vec.len(), 1);\n\n let popped2 = vec.pop();\n assert_eq(popped2, 1);\n assert_eq(vec.len(), 0);\n }\n\n #[test(should_fail_with = \"push out of bounds\")]\n fn push_to_full_vector() {\n let mut vec: BoundedVec<u32, 2> = BoundedVec::new();\n vec.push(1);\n vec.push(2);\n vec.push(3); // should panic\n }\n\n #[test(should_fail_with = \"cannot pop from an empty vector\")]\n fn pop_from_empty_vector() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n let _ = vec.pop(); // should panic\n }\n\n #[test]\n fn push_pop_cycle() {\n let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n\n // push to full\n vec.push(1);\n vec.push(2);\n vec.push(3);\n assert_eq(vec.len(), 3);\n\n // pop all\n assert_eq(vec.pop(), 3);\n assert_eq(vec.pop(), 2);\n assert_eq(vec.pop(), 1);\n assert_eq(vec.len(), 0);\n\n // push again\n vec.push(4);\n assert_eq(vec.len(), 1);\n assert_eq(vec.get(0), 4);\n }\n }\n\n mod extend {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn extend_from_array() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n vec.push(1);\n vec.extend_from_array([2, 3]);\n\n assert_eq(vec.len(), 3);\n assert_eq(vec.get(0), 1);\n assert_eq(vec.get(1), 2);\n assert_eq(vec.get(2), 3);\n }\n\n #[test]\n fn extend_from_vector() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n vec.push(1);\n vec.extend_from_vector([2, 3].as_vector());\n\n assert_eq(vec.len(), 3);\n assert_eq(vec.get(0), 1);\n assert_eq(vec.get(1), 2);\n assert_eq(vec.get(2), 3);\n }\n\n #[test]\n fn extend_from_bounded_vec() {\n let mut vec1: BoundedVec<u32, 5> = BoundedVec::new();\n let mut vec2: BoundedVec<u32, 3> = BoundedVec::new();\n\n vec1.push(1);\n vec2.push(2);\n vec2.push(3);\n\n vec1.extend_from_bounded_vec(vec2);\n\n assert_eq(vec1.len(), 3);\n assert_eq(vec1.get(0), 1);\n assert_eq(vec1.get(1), 2);\n assert_eq(vec1.get(2), 3);\n }\n\n #[test(should_fail_with = \"extend_from_array out of bounds\")]\n fn extend_array_beyond_max_len() {\n let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n vec.push(1);\n vec.extend_from_array([2, 3, 4]); // should panic\n }\n\n #[test(should_fail_with = \"extend_from_vector out of bounds\")]\n fn extend_vector_beyond_max_len() {\n let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n vec.push(1);\n vec.extend_from_vector([2, 3, 4].as_vector()); // S]should panic\n }\n\n #[test(should_fail_with = \"extend_from_bounded_vec out of bounds\")]\n fn extend_bounded_vec_beyond_max_len() {\n let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n let other: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n vec.extend_from_bounded_vec(other); // should panic\n }\n\n #[test]\n fn extend_with_empty_collections() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n let original_len = vec.len();\n\n vec.extend_from_array([]);\n assert_eq(vec.len(), original_len);\n\n vec.extend_from_vector([].as_vector());\n assert_eq(vec.len(), original_len);\n\n let empty: BoundedVec<u32, 3> = BoundedVec::new();\n vec.extend_from_bounded_vec(empty);\n assert_eq(vec.len(), original_len);\n }\n }\n\n mod storage {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn storage_consistency() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n\n // test initial storage state\n assert_eq(vec.storage(), [0, 0, 0, 0, 0]);\n\n vec.push(1);\n vec.push(2);\n\n // test storage after modifications\n assert_eq(vec.storage(), [1, 2, 0, 0, 0]);\n\n // storage doesn't change length\n assert_eq(vec.len(), 2);\n assert_eq(vec.max_len(), 5);\n }\n\n #[test]\n fn storage_after_pop() {\n let mut vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n\n let _ = vec.pop();\n // after pop, the last element should be zeroed\n assert_eq(vec.storage(), [1, 2, 0]);\n assert_eq(vec.len(), 2);\n }\n\n #[test]\n fn vector_immutable() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n let storage = vec.storage();\n\n assert_eq(storage, [1, 2, 3]);\n\n // Verify that the original vector is unchanged\n assert_eq(vec.len(), 3);\n assert_eq(vec.get(0), 1);\n assert_eq(vec.get(1), 2);\n assert_eq(vec.get(2), 3);\n }\n }\n}\n"
|
|
4481
|
+
"source": "use crate::{cmp::Eq, convert::From, runtime::is_unconstrained, static_assert};\n\n/// A `BoundedVec<T, MaxLen>` is a growable storage similar to a built-in vector except that it\n/// is bounded with a maximum possible length. `BoundedVec` is also not\n/// subject to the same restrictions vectors are (notably, nested vectors are disallowed).\n///\n/// Since a BoundedVec is backed by a normal array under the hood, growing the BoundedVec by\n/// pushing an additional element is also more efficient - the length only needs to be increased\n/// by one.\n///\n/// For these reasons `BoundedVec<T, N>` should generally be preferred over vectors when there\n/// is a reasonable maximum bound that can be placed on the vector.\n///\n/// Example:\n///\n/// ```noir\n/// let mut vector: BoundedVec<Field, 10> = BoundedVec::new();\n/// for i in 0..5 {\n/// vector.push(i);\n/// }\n/// assert(vector.len() == 5);\n/// assert(vector.max_len() == 10);\n/// ```\npub struct BoundedVec<T, let MaxLen: u32> {\n storage: [T; MaxLen],\n len: u32,\n}\n\nimpl<T, let MaxLen: u32> BoundedVec<T, MaxLen> {\n /// Creates a new, empty vector of length zero.\n ///\n /// Since this container is backed by an array internally, it still needs an initial value\n /// to give each element. To resolve this, each element is zeroed internally. This value\n /// is guaranteed to be inaccessible unless `get_unchecked` is used.\n ///\n /// Example:\n ///\n /// ```noir\n /// let empty_vector: BoundedVec<Field, 10> = BoundedVec::new();\n /// assert(empty_vector.len() == 0);\n /// ```\n ///\n /// Note that whenever calling `new` the maximum length of the vector should always be specified\n /// via a type signature:\n ///\n /// ```noir\n /// fn good() -> BoundedVec<Field, 10> {\n /// // Ok! MaxLen is specified with a type annotation\n /// let v1: BoundedVec<Field, 3> = BoundedVec::new();\n /// let v2 = BoundedVec::new();\n ///\n /// // Ok! MaxLen is known from the type of `good`'s return value\n /// v2\n /// }\n ///\n /// fn bad() {\n /// // Error: Type annotation needed\n /// // The compiler can't infer `MaxLen` from the following code:\n /// let mut v3 = BoundedVec::new();\n /// v3.push(5);\n /// }\n /// ```\n ///\n /// This defaulting of `MaxLen` (and numeric generics in general) to zero may change in future noir versions\n /// but for now make sure to use type annotations when using bounded vectors. Otherwise, you will receive a\n /// constraint failure at runtime when the vec is pushed to.\n pub fn new() -> Self {\n let zeroed = crate::mem::zeroed();\n BoundedVec { storage: [zeroed; MaxLen], len: 0 }\n }\n\n /// Retrieves an element from the vector at the given index, starting from zero.\n ///\n /// If the given index is equal to or greater than the length of the vector, this\n /// will issue a constraint failure.\n ///\n /// Example:\n ///\n /// ```noir\n /// fn foo<let N: u32>(v: BoundedVec<u32, N>) {\n /// let first = v.get(0);\n /// let last = v.get(v.len() - 1);\n /// assert(first != last);\n /// }\n /// ```\n pub fn get(self, index: u32) -> T {\n assert(index < self.len, \"Attempted to read past end of BoundedVec\");\n self.get_unchecked(index)\n }\n\n /// Retrieves an element from the vector at the given index, starting from zero, without\n /// performing a bounds check.\n ///\n /// Since this function does not perform a bounds check on length before accessing the element,\n /// it is unsafe! Use at your own risk!\n ///\n /// Example:\n ///\n /// ```noir\n /// fn sum_of_first_three<let N: u32>(v: BoundedVec<u32, N>) -> u32 {\n /// // Always ensure the length is larger than the largest\n /// // index passed to get_unchecked\n /// assert(v.len() > 2);\n /// let first = v.get_unchecked(0);\n /// let second = v.get_unchecked(1);\n /// let third = v.get_unchecked(2);\n /// first + second + third\n /// }\n /// ```\n pub fn get_unchecked(self, index: u32) -> T {\n self.storage[index]\n }\n\n /// Writes an element to the vector at the given index, starting from zero.\n ///\n /// If the given index is equal to or greater than the length of the vector, this will issue a constraint failure.\n ///\n /// Example:\n ///\n /// ```noir\n /// fn foo<let N: u32>(v: BoundedVec<u32, N>) {\n /// let first = v.get(0);\n /// assert(first != 42);\n /// v.set(0, 42);\n /// let new_first = v.get(0);\n /// assert(new_first == 42);\n /// }\n /// ```\n pub fn set(&mut self, index: u32, value: T) {\n assert(index < self.len, \"Attempted to write past end of BoundedVec\");\n self.set_unchecked(index, value)\n }\n\n /// Writes an element to the vector at the given index, starting from zero, without performing a bounds check.\n ///\n /// Since this function does not perform a bounds check on length before accessing the element, it is unsafe! Use at your own risk!\n ///\n /// Example:\n ///\n /// ```noir\n /// fn set_unchecked_example() {\n /// let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n /// vec.extend_from_array([1, 2]);\n ///\n /// // Here we're safely writing within the valid range of `vec`\n /// // `vec` now has the value [42, 2]\n /// vec.set_unchecked(0, 42);\n ///\n /// // We can then safely read this value back out of `vec`.\n /// // Notice that we use the checked version of `get` which would prevent reading unsafe values.\n /// assert_eq(vec.get(0), 42);\n ///\n /// // We've now written past the end of `vec`.\n /// // As this index is still within the maximum potential length of `v`,\n /// // it won't cause a constraint failure.\n /// vec.set_unchecked(2, 42);\n /// println(vec);\n ///\n /// // This will write past the end of the maximum potential length of `vec`,\n /// // it will then trigger a constraint failure.\n /// vec.set_unchecked(5, 42);\n /// println(vec);\n /// }\n /// ```\n pub fn set_unchecked(&mut self, index: u32, value: T) {\n self.storage[index] = value;\n }\n\n /// Pushes an element to the end of the vector. This increases the length\n /// of the vector by one.\n ///\n /// Panics if the new length of the vector will be greater than the max length.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<Field, 2> = BoundedVec::new();\n ///\n /// v.push(1);\n /// v.push(2);\n ///\n /// // Panics with failed assertion \"push out of bounds\"\n /// v.push(3);\n /// ```\n pub fn push(&mut self, elem: T) {\n assert(self.len < MaxLen, \"push out of bounds\");\n\n self.storage[self.len] = elem;\n self.len += 1;\n }\n\n /// Returns the current length of this vector\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<Field, 4> = BoundedVec::new();\n /// assert(v.len() == 0);\n ///\n /// v.push(100);\n /// assert(v.len() == 1);\n ///\n /// v.push(200);\n /// v.push(300);\n /// v.push(400);\n /// assert(v.len() == 4);\n ///\n /// let _ = v.pop();\n /// let _ = v.pop();\n /// assert(v.len() == 2);\n /// ```\n pub fn len(self) -> u32 {\n self.len\n }\n\n /// Returns the maximum length of this vector. This is always\n /// equal to the `MaxLen` parameter this vector was initialized with.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<Field, 5> = BoundedVec::new();\n ///\n /// assert(v.max_len() == 5);\n /// v.push(10);\n /// assert(v.max_len() == 5);\n /// ```\n pub fn max_len(_self: BoundedVec<T, MaxLen>) -> u32 {\n MaxLen\n }\n\n /// Returns the internal array within this vector.\n ///\n /// Since arrays in Noir are immutable, mutating the returned storage array will not mutate\n /// the storage held internally by this vector.\n ///\n /// Note that uninitialized elements may be zeroed out!\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<Field, 5> = BoundedVec::new();\n ///\n /// assert(v.storage() == [0, 0, 0, 0, 0]);\n ///\n /// v.push(57);\n /// assert(v.storage() == [57, 0, 0, 0, 0]);\n /// ```\n pub fn storage(self) -> [T; MaxLen] {\n self.storage\n }\n\n /// Pushes each element from the given array to this vector.\n ///\n /// Panics if pushing each element would cause the length of this vector\n /// to exceed the maximum length.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut vec: BoundedVec<Field, 3> = BoundedVec::new();\n /// vec.extend_from_array([2, 4]);\n ///\n /// assert(vec.len == 2);\n /// assert(vec.get(0) == 2);\n /// assert(vec.get(1) == 4);\n /// ```\n pub fn extend_from_array<let Len: u32>(&mut self, array: [T; Len]) {\n let new_len = self.len + array.len();\n assert(new_len <= MaxLen, \"extend_from_array out of bounds\");\n for i in 0..array.len() {\n self.storage[self.len + i] = array[i];\n }\n self.len = new_len;\n }\n\n /// Pushes each element from the given vector to this vector.\n ///\n /// Panics if pushing each element would cause the length of this vector\n /// to exceed the maximum length.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut vec: BoundedVec<Field, 3> = BoundedVec::new();\n /// vec.extend_from_vector([2, 4].as_vector());\n ///\n /// assert(vec.len == 2);\n /// assert(vec.get(0) == 2);\n /// assert(vec.get(1) == 4);\n /// ```\n pub fn extend_from_vector(&mut self, vector: [T]) {\n let new_len = self.len + vector.len();\n assert(new_len <= MaxLen, \"extend_from_vector out of bounds\");\n for i in 0..vector.len() {\n self.storage[self.len + i] = vector[i];\n }\n self.len = new_len;\n }\n\n /// Pushes each element from the other vector to this vector. The length of\n /// the other vector is left unchanged.\n ///\n /// Panics if pushing each element would cause the length of this vector\n /// to exceed the maximum length.\n ///\n /// ```noir\n /// let mut v1: BoundedVec<Field, 5> = BoundedVec::new();\n /// let mut v2: BoundedVec<Field, 7> = BoundedVec::new();\n ///\n /// v2.extend_from_array([1, 2, 3]);\n /// v1.extend_from_bounded_vec(v2);\n ///\n /// assert(v1.storage() == [1, 2, 3, 0, 0]);\n /// assert(v2.storage() == [1, 2, 3, 0, 0, 0, 0]);\n /// ```\n pub fn extend_from_bounded_vec<let Len: u32>(&mut self, vec: BoundedVec<T, Len>) {\n let append_len = vec.len();\n let new_len = self.len + append_len;\n assert(new_len <= MaxLen, \"extend_from_bounded_vec out of bounds\");\n\n if is_unconstrained() {\n for i in 0..append_len {\n self.storage[self.len + i] = vec.get_unchecked(i);\n }\n } else {\n for i in 0..Len {\n if i < append_len {\n self.storage[self.len + i] = vec.get_unchecked(i);\n }\n }\n }\n self.len = new_len;\n }\n\n /// Creates a new vector, populating it with values derived from an array input.\n /// The maximum length of the vector is determined based on the type signature.\n ///\n /// Example:\n ///\n /// ```noir\n /// let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from_array([1, 2, 3])\n /// ```\n pub fn from_array<let Len: u32>(array: [T; Len]) -> Self {\n static_assert(Len <= MaxLen, \"from array out of bounds\");\n let mut vec: BoundedVec<T, MaxLen> = BoundedVec::new();\n vec.extend_from_array(array);\n vec\n }\n\n /// Pops the element at the end of the vector. This will decrease the length\n /// of the vector by one.\n ///\n /// Panics if the vector is empty.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<Field, 2> = BoundedVec::new();\n /// v.push(1);\n /// v.push(2);\n ///\n /// let two = v.pop();\n /// let one = v.pop();\n ///\n /// assert(two == 2);\n /// assert(one == 1);\n ///\n /// // error: cannot pop from an empty vector\n /// let _ = v.pop();\n /// ```\n pub fn pop(&mut self) -> T {\n assert(self.len > 0, \"cannot pop from an empty vector\");\n self.len -= 1;\n\n let elem = self.storage[self.len];\n self.storage[self.len] = crate::mem::zeroed();\n elem\n }\n\n /// Returns true if the given predicate returns true for any element\n /// in this vector.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<u32, 3> = BoundedVec::new();\n /// v.extend_from_array([2, 4, 6]);\n ///\n /// let all_even = !v.any(|elem: u32| elem % 2 != 0);\n /// assert(all_even);\n /// ```\n pub fn any<Env>(self, predicate: fn[Env](T) -> bool) -> bool {\n let mut ret = false;\n if is_unconstrained() {\n for i in 0..self.len {\n ret |= predicate(self.storage[i]);\n }\n } else {\n let mut exceeded_len = false;\n for i in 0..MaxLen {\n exceeded_len |= i == self.len;\n if !exceeded_len {\n ret |= predicate(self.storage[i]);\n }\n }\n }\n ret\n }\n\n /// Creates a new vector of equal size by calling a closure on each element in this vector.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n /// let result = vec.map(|value| value * 2);\n ///\n /// let expected = BoundedVec::from_array([2, 4, 6, 8]);\n /// assert_eq(result, expected);\n /// ```\n pub fn map<U, Env>(self, f: fn[Env](T) -> U) -> BoundedVec<U, MaxLen> {\n let mut ret = BoundedVec::new();\n ret.len = self.len();\n\n if is_unconstrained() {\n for i in 0..self.len() {\n ret.storage[i] = f(self.get_unchecked(i));\n }\n } else {\n for i in 0..MaxLen {\n if i < self.len() {\n ret.storage[i] = f(self.get_unchecked(i));\n }\n }\n }\n\n ret\n }\n\n /// Creates a new vector of equal size by calling a closure on each element\n /// in this vector, along with its index.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n /// let result = vec.mapi(|i, value| i + value * 2);\n ///\n /// let expected = BoundedVec::from_array([2, 5, 8, 11]);\n /// assert_eq(result, expected);\n /// ```\n pub fn mapi<U, Env>(self, f: fn[Env](u32, T) -> U) -> BoundedVec<U, MaxLen> {\n let mut ret = BoundedVec::new();\n ret.len = self.len();\n\n if is_unconstrained() {\n for i in 0..self.len() {\n ret.storage[i] = f(i, self.get_unchecked(i));\n }\n } else {\n for i in 0..MaxLen {\n if i < self.len() {\n ret.storage[i] = f(i, self.get_unchecked(i));\n }\n }\n }\n\n ret\n }\n\n /// Calls a closure on each element in this vector.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n /// let mut result = BoundedVec::<u32, 4>::new();\n /// vec.for_each(|value| result.push(value * 2));\n ///\n /// let expected = BoundedVec::from_array([2, 4, 6, 8]);\n /// assert_eq(result, expected);\n /// ```\n pub fn for_each<Env>(self, f: fn[Env](T) -> ()) {\n if is_unconstrained() {\n for i in 0..self.len() {\n f(self.get_unchecked(i));\n }\n } else {\n for i in 0..MaxLen {\n if i < self.len() {\n f(self.get_unchecked(i));\n }\n }\n }\n }\n\n /// Calls a closure on each element in this vector, along with its index.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n /// let mut result = BoundedVec::<u32, 4>::new();\n /// vec.for_eachi(|i, value| result.push(i + value * 2));\n ///\n /// let expected = BoundedVec::from_array([2, 5, 8, 11]);\n /// assert_eq(result, expected);\n /// ```\n pub fn for_eachi<Env>(self, f: fn[Env](u32, T) -> ()) {\n if is_unconstrained() {\n for i in 0..self.len() {\n f(i, self.get_unchecked(i));\n }\n } else {\n for i in 0..MaxLen {\n if i < self.len() {\n f(i, self.get_unchecked(i));\n }\n }\n }\n }\n\n /// Creates a new BoundedVec from the given array and length.\n /// The given length must be less than or equal to the length of the array.\n ///\n /// This function will zero out any elements at or past index `len` of `array`.\n /// This incurs an extra runtime cost of O(MaxLen). If you are sure your array is\n /// zeroed after that index, you can use [`from_parts_unchecked`][Self::from_parts_unchecked] to remove the extra loop.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 0], 3);\n /// assert_eq(vec.len(), 3);\n /// ```\n pub fn from_parts(mut array: [T; MaxLen], len: u32) -> Self {\n assert(len <= MaxLen);\n let zeroed = crate::mem::zeroed();\n\n if is_unconstrained() {\n for i in len..MaxLen {\n array[i] = zeroed;\n }\n } else {\n for i in 0..MaxLen {\n if i >= len {\n array[i] = zeroed;\n }\n }\n }\n\n BoundedVec { storage: array, len }\n }\n\n /// Creates a new BoundedVec from the given array and length.\n /// The given length must be less than or equal to the length of the array.\n ///\n /// This function is unsafe because it expects all elements past the `len` index\n /// of `array` to be zeroed, but does not check for this internally. Use `from_parts`\n /// for a safe version of this function which does zero out any indices past the\n /// given length. Invalidating this assumption can notably cause `BoundedVec::eq`\n /// to give incorrect results since it will check even elements past `len`.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 0], 3);\n /// assert_eq(vec.len(), 3);\n ///\n /// // invalid use!\n /// let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 1], 3);\n /// let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 2], 3);\n ///\n /// // both vecs have length 3 so we'd expect them to be equal, but this\n /// // fails because elements past the length are still checked in eq\n /// assert_eq(vec1, vec2); // fails\n /// ```\n pub fn from_parts_unchecked(array: [T; MaxLen], len: u32) -> Self {\n assert(len <= MaxLen);\n BoundedVec { storage: array, len }\n }\n}\n\nimpl<T, let MaxLen: u32> Eq for BoundedVec<T, MaxLen>\nwhere\n T: Eq,\n{\n fn eq(self, other: BoundedVec<T, MaxLen>) -> bool {\n // TODO: https://github.com/noir-lang/noir/issues/4837\n //\n // We make the assumption that the user has used the proper interface for working with `BoundedVec`s\n // rather than directly manipulating the internal fields as this can result in an inconsistent internal state.\n if self.len == other.len {\n self.storage == other.storage\n } else {\n false\n }\n }\n}\n\nimpl<T, let MaxLen: u32, let Len: u32> From<[T; Len]> for BoundedVec<T, MaxLen> {\n fn from(array: [T; Len]) -> BoundedVec<T, MaxLen> {\n BoundedVec::from_array(array)\n }\n}\n\nmod bounded_vec_tests {\n\n mod get {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n fn panics_when_reading_elements_past_end_of_vec() {\n let vec: BoundedVec<Field, 5> = BoundedVec::new();\n\n let _ = vec.get(0);\n }\n\n #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n fn panics_when_reading_beyond_length() {\n let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n let _ = vec.get(3);\n }\n\n #[test]\n fn get_works_within_bounds() {\n let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n assert_eq(vec.get(0), 1);\n assert_eq(vec.get(2), 3);\n assert_eq(vec.get(4), 5);\n }\n\n #[test]\n fn get_unchecked_works() {\n let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n assert_eq(vec.get_unchecked(0), 1);\n assert_eq(vec.get_unchecked(2), 3);\n }\n\n #[test]\n fn get_unchecked_works_past_len() {\n let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n assert_eq(vec.get_unchecked(4), 0);\n }\n }\n\n mod set {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn set_updates_values_properly() {\n let mut vec = BoundedVec::from_array([0, 0, 0, 0, 0]);\n\n vec.set(0, 42);\n assert_eq(vec.storage, [42, 0, 0, 0, 0]);\n\n vec.set(1, 43);\n assert_eq(vec.storage, [42, 43, 0, 0, 0]);\n\n vec.set(2, 44);\n assert_eq(vec.storage, [42, 43, 44, 0, 0]);\n\n vec.set(1, 10);\n assert_eq(vec.storage, [42, 10, 44, 0, 0]);\n\n vec.set(0, 0);\n assert_eq(vec.storage, [0, 10, 44, 0, 0]);\n }\n\n #[test(should_fail_with = \"Attempted to write past end of BoundedVec\")]\n fn panics_when_writing_elements_past_end_of_vec() {\n let mut vec: BoundedVec<Field, 5> = BoundedVec::new();\n vec.set(0, 42);\n }\n\n #[test(should_fail_with = \"Attempted to write past end of BoundedVec\")]\n fn panics_when_setting_beyond_length() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n vec.set(3, 4);\n }\n\n #[test]\n fn set_unchecked_operations() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n vec.push(1);\n vec.push(2);\n\n vec.set_unchecked(0, 10);\n assert_eq(vec.get(0), 10);\n }\n\n #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n fn set_unchecked_operations_past_len() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n vec.push(1);\n vec.push(2);\n\n vec.set_unchecked(3, 40);\n assert_eq(vec.get(3), 40);\n }\n\n #[test]\n fn set_preserves_other_elements() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n\n vec.set(2, 30);\n assert_eq(vec.get(0), 1);\n assert_eq(vec.get(1), 2);\n assert_eq(vec.get(2), 30);\n assert_eq(vec.get(3), 4);\n assert_eq(vec.get(4), 5);\n }\n }\n\n mod any {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn returns_false_if_predicate_not_satisfied() {\n let vec: BoundedVec<bool, 4> = BoundedVec::from_array([false, false, false, false]);\n let result = vec.any(|value| value);\n\n assert(!result);\n }\n\n #[test]\n fn returns_true_if_predicate_satisfied() {\n let vec: BoundedVec<bool, 4> = BoundedVec::from_array([false, false, true, true]);\n let result = vec.any(|value| value);\n\n assert(result);\n }\n\n #[test]\n fn returns_false_on_empty_boundedvec() {\n let vec: BoundedVec<bool, 0> = BoundedVec::new();\n let result = vec.any(|value| value);\n\n assert(!result);\n }\n\n #[test]\n fn any_with_complex_predicates() {\n let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n\n assert(vec.any(|x| x > 3));\n assert(!vec.any(|x| x > 10));\n assert(vec.any(|x| x % 2 == 0)); // has a even number\n assert(vec.any(|x| x == 3)); // has a specific value\n }\n\n #[test]\n fn any_with_partial_vector() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n vec.push(1);\n vec.push(2);\n\n assert(vec.any(|x| x == 1));\n assert(vec.any(|x| x == 2));\n assert(!vec.any(|x| x == 3));\n }\n }\n\n mod map {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn applies_function_correctly() {\n // docs:start:bounded-vec-map-example\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = vec.map(|value| value * 2);\n // docs:end:bounded-vec-map-example\n let expected = BoundedVec::from_array([2, 4, 6, 8]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn applies_function_that_changes_return_type() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = vec.map(|value| (value * 2) as Field);\n let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 4, 6, 8]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn does_not_apply_function_past_len() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n let result = vec.map(|value| if value == 0 { 5 } else { value });\n let expected = BoundedVec::from_array([5, 1]);\n\n assert_eq(result, expected);\n assert_eq(result.get_unchecked(2), 0);\n }\n\n #[test]\n fn map_with_conditional_logic() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n\n let result = vec.map(|x| if x % 2 == 0 { x * 2 } else { x });\n let expected = BoundedVec::from_array([1, 4, 3, 8]);\n assert_eq(result, expected);\n }\n\n #[test]\n fn map_preserves_length() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = vec.map(|x| x * 2);\n\n assert_eq(result.len(), vec.len());\n assert_eq(result.max_len(), vec.max_len());\n }\n\n #[test]\n fn map_on_empty_vector() {\n let vec: BoundedVec<u32, 5> = BoundedVec::new();\n let result = vec.map(|x| x * 2);\n assert_eq(result, vec);\n assert_eq(result.len(), 0);\n assert_eq(result.max_len(), 5);\n }\n }\n\n mod mapi {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn applies_function_correctly() {\n // docs:start:bounded-vec-mapi-example\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = vec.mapi(|i, value| i + value * 2);\n // docs:end:bounded-vec-mapi-example\n let expected = BoundedVec::from_array([2, 5, 8, 11]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn applies_function_that_changes_return_type() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = vec.mapi(|i, value| (i + value * 2) as Field);\n let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 5, 8, 11]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn does_not_apply_function_past_len() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n let result = vec.mapi(|_, value| if value == 0 { 5 } else { value });\n let expected = BoundedVec::from_array([5, 1]);\n\n assert_eq(result, expected);\n assert_eq(result.get_unchecked(2), 0);\n }\n\n #[test]\n fn mapi_with_index_branching_logic() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n\n let result = vec.mapi(|i, x| if i % 2 == 0 { x * 2 } else { x });\n let expected = BoundedVec::from_array([2, 2, 6, 4]);\n assert_eq(result, expected);\n }\n }\n\n mod for_each {\n use crate::collections::bounded_vec::BoundedVec;\n\n // map in terms of for_each\n fn for_each_map<T, U, Env, let MaxLen: u32>(\n input: BoundedVec<T, MaxLen>,\n f: fn[Env](T) -> U,\n ) -> BoundedVec<U, MaxLen> {\n let mut output = BoundedVec::<U, MaxLen>::new();\n let output_ref = &mut output;\n input.for_each(|x| output_ref.push(f(x)));\n output\n }\n\n #[test]\n fn smoke_test() {\n let mut acc = 0;\n let acc_ref = &mut acc;\n // docs:start:bounded-vec-for-each-example\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n vec.for_each(|value| { *acc_ref += value; });\n // docs:end:bounded-vec-for-each-example\n assert_eq(acc, 6);\n }\n\n #[test]\n fn applies_function_correctly() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = for_each_map(vec, |value| value * 2);\n let expected = BoundedVec::from_array([2, 4, 6, 8]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn applies_function_that_changes_return_type() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = for_each_map(vec, |value| (value * 2) as Field);\n let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 4, 6, 8]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn does_not_apply_function_past_len() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n let result = for_each_map(vec, |value| if value == 0 { 5 } else { value });\n let expected = BoundedVec::from_array([5, 1]);\n\n assert_eq(result, expected);\n assert_eq(result.get_unchecked(2), 0);\n }\n\n #[test]\n fn for_each_on_empty_vector() {\n let vec: BoundedVec<u32, 5> = BoundedVec::new();\n let mut count = 0;\n let count_ref = &mut count;\n vec.for_each(|_| { *count_ref += 1; });\n assert_eq(count, 0);\n }\n\n #[test]\n fn for_each_with_side_effects() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n let mut seen = BoundedVec::<u32, 3>::new();\n let seen_ref = &mut seen;\n vec.for_each(|x| seen_ref.push(x));\n assert_eq(seen, vec);\n }\n }\n\n mod for_eachi {\n use crate::collections::bounded_vec::BoundedVec;\n\n // mapi in terms of for_eachi\n fn for_eachi_mapi<T, U, Env, let MaxLen: u32>(\n input: BoundedVec<T, MaxLen>,\n f: fn[Env](u32, T) -> U,\n ) -> BoundedVec<U, MaxLen> {\n let mut output = BoundedVec::<U, MaxLen>::new();\n let output_ref = &mut output;\n input.for_eachi(|i, x| output_ref.push(f(i, x)));\n output\n }\n\n #[test]\n fn smoke_test() {\n let mut acc = 0;\n let acc_ref = &mut acc;\n // docs:start:bounded-vec-for-eachi-example\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n vec.for_eachi(|i, value| { *acc_ref += i * value; });\n // docs:end:bounded-vec-for-eachi-example\n\n // 0 * 1 + 1 * 2 + 2 * 3\n assert_eq(acc, 8);\n }\n\n #[test]\n fn applies_function_correctly() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = for_eachi_mapi(vec, |i, value| i + value * 2);\n let expected = BoundedVec::from_array([2, 5, 8, 11]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn applies_function_that_changes_return_type() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = for_eachi_mapi(vec, |i, value| (i + value * 2) as Field);\n let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 5, 8, 11]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn does_not_apply_function_past_len() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n let result = for_eachi_mapi(vec, |_, value| if value == 0 { 5 } else { value });\n let expected = BoundedVec::from_array([5, 1]);\n\n assert_eq(result, expected);\n assert_eq(result.get_unchecked(2), 0);\n }\n\n #[test]\n fn for_eachi_on_empty_vector() {\n let vec: BoundedVec<u32, 5> = BoundedVec::new();\n let mut count = 0;\n let count_ref = &mut count;\n vec.for_eachi(|_, _| { *count_ref += 1; });\n assert_eq(count, 0);\n }\n\n #[test]\n fn for_eachi_with_index_tracking() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([10, 20, 30]);\n let mut indices = BoundedVec::<u32, 3>::new();\n let indices_ref = &mut indices;\n vec.for_eachi(|i, _| indices_ref.push(i));\n\n let expected = BoundedVec::from_array([0, 1, 2]);\n assert_eq(indices, expected);\n }\n\n }\n\n mod from_array {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn empty() {\n let empty_array: [Field; 0] = [];\n let bounded_vec = BoundedVec::from_array([]);\n\n assert_eq(bounded_vec.max_len(), 0);\n assert_eq(bounded_vec.len(), 0);\n assert_eq(bounded_vec.storage(), empty_array);\n }\n\n #[test]\n fn equal_len() {\n let array = [1, 2, 3];\n let bounded_vec = BoundedVec::from_array(array);\n\n assert_eq(bounded_vec.max_len(), 3);\n assert_eq(bounded_vec.len(), 3);\n assert_eq(bounded_vec.storage(), array);\n }\n\n #[test]\n fn max_len_greater_then_array_len() {\n let array = [1, 2, 3];\n let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from_array(array);\n\n assert_eq(bounded_vec.max_len(), 10);\n assert_eq(bounded_vec.len(), 3);\n assert_eq(bounded_vec.get(0), 1);\n assert_eq(bounded_vec.get(1), 2);\n assert_eq(bounded_vec.get(2), 3);\n }\n\n #[test(should_fail_with = \"from array out of bounds\")]\n fn max_len_lower_then_array_len() {\n let _: BoundedVec<Field, 2> = BoundedVec::from_array([0; 3]);\n }\n\n #[test]\n fn from_array_preserves_order() {\n let array = [5, 3, 1, 4, 2];\n let vec: BoundedVec<u32, 5> = BoundedVec::from_array(array);\n for i in 0..array.len() {\n assert_eq(vec.get(i), array[i]);\n }\n }\n\n #[test]\n fn from_array_with_different_types() {\n let bool_array = [true, false, true];\n let bool_vec: BoundedVec<bool, 3> = BoundedVec::from_array(bool_array);\n assert_eq(bool_vec.len(), 3);\n assert_eq(bool_vec.get(0), true);\n assert_eq(bool_vec.get(1), false);\n }\n }\n\n mod trait_from {\n use crate::collections::bounded_vec::BoundedVec;\n use crate::convert::From;\n\n #[test]\n fn simple() {\n let array = [1, 2];\n let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from(array);\n\n assert_eq(bounded_vec.max_len(), 10);\n assert_eq(bounded_vec.len(), 2);\n assert_eq(bounded_vec.get(0), 1);\n assert_eq(bounded_vec.get(1), 2);\n }\n }\n\n mod trait_eq {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn empty_equality() {\n let bounded_vec1: BoundedVec<Field, 3> = BoundedVec::new();\n let bounded_vec2: BoundedVec<Field, 3> = BoundedVec::new();\n\n assert_eq(bounded_vec1, bounded_vec2);\n }\n\n #[test]\n fn inequality() {\n let mut bounded_vec1: BoundedVec<Field, 3> = BoundedVec::new();\n let mut bounded_vec2: BoundedVec<Field, 3> = BoundedVec::new();\n bounded_vec1.push(1);\n bounded_vec2.push(2);\n\n assert(bounded_vec1 != bounded_vec2);\n }\n }\n\n mod from_parts {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn from_parts() {\n // docs:start:from-parts\n let vec: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 0], 3);\n assert_eq(vec.len(), 3);\n\n // Any elements past the given length are zeroed out, so these\n // two BoundedVecs will be completely equal\n let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 1], 3);\n let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 2], 3);\n assert_eq(vec1, vec2);\n // docs:end:from-parts\n }\n\n #[test]\n fn from_parts_unchecked() {\n // docs:start:from-parts-unchecked\n let vec: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 0], 3);\n assert_eq(vec.len(), 3);\n\n // invalid use!\n let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 1], 3);\n let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 2], 3);\n\n // both vecs have length 3 so we'd expect them to be equal, but this\n // fails because elements past the length are still checked in eq\n assert(vec1 != vec2);\n // docs:end:from-parts-unchecked\n }\n }\n\n mod push_pop {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn push_and_pop_operations() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n\n assert_eq(vec.len(), 0);\n\n vec.push(1);\n assert_eq(vec.len(), 1);\n assert_eq(vec.get(0), 1);\n\n vec.push(2);\n assert_eq(vec.len(), 2);\n assert_eq(vec.get(1), 2);\n\n let popped = vec.pop();\n assert_eq(popped, 2);\n assert_eq(vec.len(), 1);\n\n let popped2 = vec.pop();\n assert_eq(popped2, 1);\n assert_eq(vec.len(), 0);\n }\n\n #[test(should_fail_with = \"push out of bounds\")]\n fn push_to_full_vector() {\n let mut vec: BoundedVec<u32, 2> = BoundedVec::new();\n vec.push(1);\n vec.push(2);\n vec.push(3); // should panic\n }\n\n #[test(should_fail_with = \"cannot pop from an empty vector\")]\n fn pop_from_empty_vector() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n let _ = vec.pop(); // should panic\n }\n\n #[test]\n fn push_pop_cycle() {\n let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n\n // push to full\n vec.push(1);\n vec.push(2);\n vec.push(3);\n assert_eq(vec.len(), 3);\n\n // pop all\n assert_eq(vec.pop(), 3);\n assert_eq(vec.pop(), 2);\n assert_eq(vec.pop(), 1);\n assert_eq(vec.len(), 0);\n\n // push again\n vec.push(4);\n assert_eq(vec.len(), 1);\n assert_eq(vec.get(0), 4);\n }\n }\n\n mod extend {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn extend_from_array() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n vec.push(1);\n vec.extend_from_array([2, 3]);\n\n assert_eq(vec.len(), 3);\n assert_eq(vec.get(0), 1);\n assert_eq(vec.get(1), 2);\n assert_eq(vec.get(2), 3);\n }\n\n #[test]\n fn extend_from_vector() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n vec.push(1);\n vec.extend_from_vector([2, 3].as_vector());\n\n assert_eq(vec.len(), 3);\n assert_eq(vec.get(0), 1);\n assert_eq(vec.get(1), 2);\n assert_eq(vec.get(2), 3);\n }\n\n #[test]\n fn extend_from_bounded_vec() {\n let mut vec1: BoundedVec<u32, 5> = BoundedVec::new();\n let mut vec2: BoundedVec<u32, 3> = BoundedVec::new();\n\n vec1.push(1);\n vec2.push(2);\n vec2.push(3);\n\n vec1.extend_from_bounded_vec(vec2);\n\n assert_eq(vec1.len(), 3);\n assert_eq(vec1.get(0), 1);\n assert_eq(vec1.get(1), 2);\n assert_eq(vec1.get(2), 3);\n }\n\n #[test(should_fail_with = \"extend_from_array out of bounds\")]\n fn extend_array_beyond_max_len() {\n let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n vec.push(1);\n vec.extend_from_array([2, 3, 4]); // should panic\n }\n\n #[test(should_fail_with = \"extend_from_vector out of bounds\")]\n fn extend_vector_beyond_max_len() {\n let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n vec.push(1);\n vec.extend_from_vector([2, 3, 4].as_vector()); // S]should panic\n }\n\n #[test(should_fail_with = \"extend_from_bounded_vec out of bounds\")]\n fn extend_bounded_vec_beyond_max_len() {\n let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n let other: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n vec.extend_from_bounded_vec(other); // should panic\n }\n\n #[test]\n fn extend_with_empty_collections() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n let original_len = vec.len();\n\n vec.extend_from_array([]);\n assert_eq(vec.len(), original_len);\n\n vec.extend_from_vector([].as_vector());\n assert_eq(vec.len(), original_len);\n\n let empty: BoundedVec<u32, 3> = BoundedVec::new();\n vec.extend_from_bounded_vec(empty);\n assert_eq(vec.len(), original_len);\n }\n }\n\n mod storage {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn storage_consistency() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n\n // test initial storage state\n assert_eq(vec.storage(), [0, 0, 0, 0, 0]);\n\n vec.push(1);\n vec.push(2);\n\n // test storage after modifications\n assert_eq(vec.storage(), [1, 2, 0, 0, 0]);\n\n // storage doesn't change length\n assert_eq(vec.len(), 2);\n assert_eq(vec.max_len(), 5);\n }\n\n #[test]\n fn storage_after_pop() {\n let mut vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n\n let _ = vec.pop();\n // after pop, the last element should be zeroed\n assert_eq(vec.storage(), [1, 2, 0]);\n assert_eq(vec.len(), 2);\n }\n\n #[test]\n fn vector_immutable() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n let storage = vec.storage();\n\n assert_eq(storage, [1, 2, 3]);\n\n // Verify that the original vector is unchanged\n assert_eq(vec.len(), 3);\n assert_eq(vec.get(0), 1);\n assert_eq(vec.get(1), 2);\n assert_eq(vec.get(2), 3);\n }\n }\n}\n"
|
|
4474
4482
|
},
|
|
4475
4483
|
"69": {
|
|
4476
4484
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/private_context.nr",
|
|
4477
|
-
"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.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 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_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"
|
|
4485
|
+
"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::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_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.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 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_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 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_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 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_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 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 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 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"
|
|
4478
4486
|
},
|
|
4479
4487
|
"72": {
|
|
4480
4488
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/utility_context.nr",
|
|
@@ -4492,9 +4500,9 @@
|
|
|
4492
4500
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/hash.nr",
|
|
4493
4501
|
"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"
|
|
4494
4502
|
},
|
|
4495
|
-
"
|
|
4496
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/
|
|
4497
|
-
"source": "use 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 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 messages::discovery::CustomMessageHandler,\n};\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_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 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 sync_state_fn_and_abi_export = if !m.functions().any(|f| f.name() == quote { sync_state }) {\n generate_sync_state(process_custom_message_option)\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(process_custom_message_option)\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\n/// Generates the `sync_state` utility function that performs message discovery.\ncomptime fn generate_sync_state(process_custom_message_option: Quoted) -> 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 aztec::messages::discovery::do_sync_state(\n address,\n _compute_note_hash_and_nullifier,\n $process_custom_message_option,\n );\n }\n }\n}\n\n/// Generates the `process_message` utility function that processes a single message ciphertext.\ncomptime fn generate_process_message(process_custom_message_option: Quoted) -> 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 $process_custom_message_option,\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/// [`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"
|
|
4503
|
+
"98": {
|
|
4504
|
+
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/logging.nr",
|
|
4505
|
+
"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\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 quote { crate::protocol::logging::fatal_log($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 quote { crate::protocol::logging::error_log($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 quote { crate::protocol::logging::warn_log($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 quote { crate::protocol::logging::info_log($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 quote { crate::protocol::logging::verbose_log($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 quote { crate::protocol::logging::debug_log($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 quote { crate::protocol::logging::trace_log($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 quote { (|args| crate::protocol::logging::fatal_log_format($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 quote { (|args| crate::protocol::logging::error_log_format($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 quote { (|args| crate::protocol::logging::warn_log_format($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 quote { (|args| crate::protocol::logging::info_log_format($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 quote { (|args| crate::protocol::logging::verbose_log_format($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 quote { (|args| crate::protocol::logging::debug_log_format($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 quote { (|args| crate::protocol::logging::trace_log_format($msg, args)) }\n}\n"
|
|
4498
4506
|
}
|
|
4499
4507
|
}
|
|
4500
4508
|
}
|