@aztec/protocol-contracts 4.0.0-rc.6 → 4.0.0-rc.8

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (7) hide show
  1. package/artifacts/AuthRegistry.json +22 -22
  2. package/artifacts/ContractClassRegistry.json +13 -13
  3. package/artifacts/ContractInstanceRegistry.json +26 -26
  4. package/artifacts/FeeJuice.json +25 -25
  5. package/artifacts/MultiCallEntrypoint.json +51 -51
  6. package/artifacts/PublicChecks.json +51 -51
  7. package/package.json +4 -4
package/artifacts/PublicChecks.json CHANGED
@@ -53,7 +53,7 @@
53
53
  }
54
54
  },
55
55
  "bytecode": "JwACBAEoAAABBIBLJwAABEslAAAATycCAwQCJwIEBAAfCgADAAQASRwASUkCHABKSgQtCEkBLQhKAiUAAABuJwIBBEsnAgIEADsOAAIAAScAQwIDJwBEAgInAEUCAScARgIEJwBHAgYnAEgCBSYlAAAC/x4CAAQAHgIABQAeAgAGCScCBwEBJAIABgAAAJQlAAADJR4CAAYFHAoGCAAcCgIGAAoqCAYCDCoIBgkKIgFFBiQCAAYAAALoIwAAAL8KIgFEBRYKAgYkAgAFAAAC1iMAAADVCiIBQwgkAgAIAAACxCMAAADnCiIBRgokAgAKAAACrSMAAAD5CiIBSAoWCgkLJAIACgAAApYjAAABDwoiAUcGJAIABgAAAoQjAAABIScCAQJJJwICAm4nAgMCdicCBAJhJwIFAmwnAgYCaScCCAJkJwIJAiAnAgoCbycCCwJwJwIMAmUnAg0CcicCDgJ0LQgBDycCEAQSAAgBEAEnAw8EAQAiDwIQLQoQES0OAREAIhECES0OAhEAIhECES0OAxEAIhECES0OBBEAIhECES0OBREAIhECES0OBhEAIhECES0OCBEAIhECES0OCREAIhECES0OChEAIhECES0OCxEAIhECES0ODBEAIhECES0ODREAIhECES0OBBEAIhECES0ODhEAIhECES0OBhEAIhECES0OChEAIhECES0OAhEnAgEBACcCAgAACioBBwMkAgADAAAChCcCBAQTLQgBBScCBgQTAAgBBgEtCgUGKgMABgXQYRKgYVuWqAAiBgIGACIPAggnAgkEES0CCAMtAgYELQIJBSUAAAM3JwIIBBEAKgYIBi0OAgYAIgYCBjwOBAUtCgsBIwAAAo0tCgECIwAAAqQEKgsGAS0KAQIjAAACpC0KAggjAAACuxIqCQIBLQoBCCMAAAK7LQoIBSMAAALNLQoJBSMAAALNLQoFBCMAAALfLQoGBCMAAALfLQoEAyMAAALxLQoCAyMAAALxJAIAAwAAAv4lAAADaSYoAAAEBHhLDAAABAMkAAADAAADJCoBAAEF2sX11rRKMm08BAIBJioBAAEFZL7Lx4qT/3I8BAIBJgAAAwUHLQADCC0ABAkKAAgHCiQAAAoAAANoLQEIBi0EBgkAAAgCCAAACQIJIwAAA0QmKgEAAQUv0lArDpHQmTwEAgEm",
56
- "debug_symbols": "tZfRbuIwEEX/Jc88eDxjj9NfqaqKtmmFhABRWGlV8e87E3wDqZSoyu6+lONrfD1jz4Tmq3nrXs4fz5vd+/6zeXj8al6Om+128/G83b+uT5v9ztSvJvgfotQ88KqhaEP1TxtTMGATiBxSBWFAMRCD5EpycCUbZFeKgynRjdWU6F9uycC/3OYrRPIpWxXZp2z3KK2BLY9JKqhPtQalrdAKoCocBACFoBCUCCVCYSgMRaAIlATFE+zBE7wCFIWiUEoE5AotAdIVJASAAOqmQgyohhIjQCswAeoWIjAUbIEsBFkIshBkIRmGii0UhgVbFBi22AJXILiCFBhQt0gUAXWLFAlQt0heY0wOqYJAESheY1coFXIEaAWF4sH34NXSg4d6harkIIBqmCkC6vLsoV4BCkNBqBmh5j6eaOAHxVbz2veF1bNmcrhcVg1a7/l07DrvvLtetA49rI/d7tQ87M7b7ar5td6e+y99Hta7/vO0Ptqs9WW3e7NPM3zfbDuny+q2OkwvjdYudbW1WzsYEMnIgqYtrIMFHsaZBxPlkUecCUMLomjlFoT+PI9ccApRc5nMQ2YsLHSCB+VEtzzyyCP9g7PI//EsmJNWB+Yik2dRZmJo1Su2RqFJpvJoZ84iFMFRUNC/zyRPZjJjQVFwnBT1dh92vaP6nivOxJJxGIlzmjoM4mmTHFEXOYUlZzFK5O5WvyUy58BDDMTCSxxi5MEhlcnD1JkrbVEU9hM3GERJP3awnz04xDLtMFOZmhSNrum+x8r4eTVXmUKwMLx7burYYua5ySHgMDlEmbSYqUzrK4m3HrurzG+pzJ6nDDeiYdGNpID2SMzLHBRP79TmRQ73/bXMQQNi0LjQQXEZ2raLHAoji5KnY+CZwlQZQhjWC/88BS5DZyy8iAyHXL41+JMN16+b4+iF4+JWx836ZdvV4ft593o3e/p9wAxeWA7H/Wv3dj527nR7a7F/rx4py4pUnuyFIvgwpRXl4EPqZ8mG/HTxYP4A"
56
+ "debug_symbols": "tZfRTiMxDEX/ZZ77EMdOnPArK4QKDKhSVVBpV1qh/vva09xpizQjdnb3hZ65aW5sxwbms3vuH4+vD5vdy9tHd/fjs3vcb7bbzevD9u1pfdi87Uz97IL/IErdHa86ivao/mnPFAzYBCKH1EAYUAzEILmSHFzJBtmV4mBKdGM1JfqXKxn4l2s+QyRfsl2RfclOj1INbHtM0kB9qRqU2qAKoCkcBACFoBCUCCVCYSgMRaAIlATFExzAEzwDFIWiUEoE5AaVAOkMEgJAAO1QIQY0Q4kRoA2YAO0IERgKjkAWgiwEWQiykAxDxREKw4IjCgwrjsAVCK4gBQa0IxJFQDsiRQK0I5L3GJNDaiBQBIr32BlKgxwB2kChePADeLcM4KGeoSk5CKAZZoqAtj17qGeAwlAQakaoeYgnGnih2Hpeh7mwftZMDqfTqsPoPRz2fe+TdzWLNqHv632/O3R3u+N2u+p+rrfH4Usf7+vd8HlY723V5rLfPdunGb5str3TaXXZHaa3Rg6p7Y4c02hAQ3gXC5q2sAmW2jyMM48myjcecSYMLYiiyiWILwZzeeSS4aClTOYh0xY25ygFS76UQm8d0j+oRP6PlWBWHdMIMlmJMhNDVe/XFoUmmcqjztQiFEEpKOjfZ5InM5mxoCgoJ0W93Eei2+6ea81k3YBiJL5ujNtMiKdNckRf5BSW1OImkSJTicw58BgDsfAShxh5dEhlspg6c6UVTXHdmpbbtx3sjx4cYpl2mOlMTUrNQtP1jN1axLnOFKKxM6leXeitxcxvTQ4BxeQQZdJipjNtriReZuyqM+kP6injjWhYdCMpYDwS8zIHxV+wVPMih+v5WuagATFoXOiguAytdZFDYWRR8nQMPNOYKmMI437h76fAZZyMhReR4ZDLlwG/t8f102Z/87pxcqv9Zv247dvjy3H3dLV6+PWOFbyuvO/fnvrn4753p8s7i/1z9YOyrEjl3l4ngj+mtKIc/JGGVbJHvj95ML8B"
57
57
  },
58
58
  {
59
59
  "name": "check_timestamp",
@@ -105,7 +105,7 @@
105
105
  }
106
106
  },
107
107
  "bytecode": "JwACBAEoAAABBIBLJwAABEslAAAATycCAwQCJwIEBAAfCgADAAQASRwASUkCHABKSgUtCEkBLQhKAiUAAABuJwIBBEsnAgIEADsOAAIAAScAQwIDJwBEAgInAEUCAScARgIEJwBHAgYnAEgCBSYlAAAC/x4CAAQAHgIABQAeAgAGCScCBwEBJAIABgAAAJQlAAADJR4CAAYGHAoGCAAcCgIGAAoqCAYCDCoIBgkKIgFFBiQCAAYAAALoIwAAAL8KIgFEBRYKAgYkAgAFAAAC1iMAAADVCiIBQwgkAgAIAAACxCMAAADnCiIBRgokAgAKAAACrSMAAAD5CiIBSAoWCgkLJAIACgAAApYjAAABDwoiAUcGJAIABgAAAoQjAAABIScCAQJJJwICAm4nAgMCdicCBAJhJwIFAmwnAgYCaScCCAJkJwIJAiAnAgoCbycCCwJwJwIMAmUnAg0CcicCDgJ0LQgBDycCEAQSAAgBEAEnAw8EAQAiDwIQLQoQES0OAREAIhECES0OAhEAIhECES0OAxEAIhECES0OBBEAIhECES0OBREAIhECES0OBhEAIhECES0OCBEAIhECES0OCREAIhECES0OChEAIhECES0OCxEAIhECES0ODBEAIhECES0ODREAIhECES0OBBEAIhECES0ODhEAIhECES0OBhEAIhECES0OChEAIhECES0OAhEnAgEBACcCAgAACioBBwMkAgADAAAChCcCBAQTLQgBBScCBgQTAAgBBgEtCgUGKgMABgXQYRKgYVuWqAAiBgIGACIPAggnAgkEES0CCAMtAgYELQIJBSUAAAM3JwIIBBEAKgYIBi0OAgYAIgYCBjwOBAUtCgsBIwAAAo0tCgECIwAAAqQEKgsGAS0KAQIjAAACpC0KAggjAAACuxIqCQIBLQoBCCMAAAK7LQoIBSMAAALNLQoJBSMAAALNLQoFBCMAAALfLQoGBCMAAALfLQoEAyMAAALxLQoCAyMAAALxJAIAAwAAAv4lAAADaSYoAAAEBHhLDAAABAMkAAADAAADJCoBAAEF2sX11rRKMm08BAIBJioBAAEFYQC6/IQvolI8BAIBJgAAAwUHLQADCC0ABAkKAAgHCiQAAAoAAANoLQEIBi0EBgkAAAgCCAAACQIJIwAAA0QmKgEAAQXBmTXwTaZKMzwEAgEm",
108
- "debug_symbols": "tZfRbtswDEX/xc95ECWKlPsrQ1GkqVsEMJLATQYMRf59ZKLrJANsFN72Uh9dW1ekRDr1V/PWvZ4+Xra79/1n8/Tjq3kdtn2//Xjp95v1cbvfmfrVBP9DlJuntGoo2lD9amMKBskEIodcgROgGLBBdiU7uCIG4kpxMCW6sZoS/eGWDPzhVq4QyW/ZrJj8lq0euTWw6TFzBfVbrUFpK7QMqEoKDIBCUAhKhBKhJCgJCkNhKBmKJ3gBT/AKUBSKQikRIBVaAuQrcAgABtRFmRKgGnKMAK2QCFCXYIYhYwlkwciCkQUjCxYYKpZQGBYsUWDYYgkcAeMIckiAukSmCKhL5EiAukT2GkvkkCswFIbiNXaFUkEiQCsoFA/+Al4tF/BQr1AVCQyohkIRUKeLh3oFKAkKQhWEKpd4ooFvVLKa10tfWD2rkMP5vGrQei/Hoeu88+560Tr0sB663bF52p36ftX8XPeny0Ofh/Xucj2uB7trfdnt3uxqhu/bvnM6r26zw/TUaO1SZ1u7taMBET9Y0LSFdTDDw1jSaKLpwSPOhKEFUbR8C0K/n4cU7EJUKZN58IyFhU7wIMl0y0MePPI/2Av5j3uRUtbqkFLhyb0oMzG06hVbo9DMU3m0M3sRCmMrKOjfZyKTmcxY6FjfJd5O1A73obrnSlPs/YitENbJraA0bSJjFEqLduIujRSn0piZX8Ycii6aX7B+G9vJbdSZo2xRDPbTNhpEzt92sJ87OMQy7TBTkZoVDa75vrfK43tqriKZYGF4977UR4uZ92UKAa2VQuRJi5matH7ieOstyVOpzO4njyeiYdGJ5CDVIae0zEHx1s6tLHKQiMKUvMxBA2LQuNBBcRjWposcShrbW6ZjSHMvCB5DGOdz+n4KqYydsfAgBA5S/mjwZxuuN9vh4UPj7FbDdv3ad3X4ftpt7u4efx1wBx8qh2G/6d5OQ+dOt68V+7fqBwmvSPnZPiSCD3NekQQfkg/VhqrPZw/mNw=="
108
+ "debug_symbols": "tZdBbuMwDEXv4nUWokSJUq9SFEWaukUAIwncZIBBkbsP6eg7SQEbHc90Uz99W1+kRDr1Z/Pavpzen7e7t/1H8/D42bz0267bvj93+836uN3vVP1snP0his1DWDXkdSh21TE5haACkUGswAGQFVghmhINTEkKyZRsoIo3Y1HF28OFFOzhki7gyW7pLB/slq7uuSjodB+5gtitopBLhcKAqgTHACgEhaB4KB5KgBKgMBSGEqFYggNYgheAIlAESvaAVKEQIF6AnQMwoC7KFADVkL0HSIVAgLoEMwwZSyALRhaMLBhZcIKhYAmBYcYSGYYFS+AIGEcQXQDUJSJ5QF0iegLUJaLVWCCDWIGhMBSrsQvkCskDpIJAseAHsGoZwEK9QFWSY0A1TOQBdXqyUC8AJUBBqAmhpiEer2AbFbTmZegLrWdJZHA+rxq03vOxb1vrvJte1A49rPt2d2wedqeuWzW/1t1peOjjsN4N1+O617val+3uVa9q+LbtWqPz6jrbTU/1wcU62wcfRwMawrta0LSFdjCX6qGcwmgi4c7Dz4QhGVEUvgbxxWAuj5QTHCTnyTx42kL7HFsROF23Qu4d4n/YifSDOxGCyJiG48mdyDMxFLF6rVFI5Kk8ysxeuMzYCnLy75mkyUxmLKTgPLKn0SDSfW3PFWbStyO2IrFMbgWFaZM0RiG0aCdu0gh+Ko2Z+XnMIcui+RnrF18mt1FmjrKgGG5L0nP+toP+2MHB52mHmYqUKIRjiLe9dW/h5yqSicaKpHJzlPcWM2/L4BxaKzjPkxYzNan9xP7aWzevKvqL/eTxRMQtOpHo8MaNISxzEPxyxZIWOSSPwkxxmYM4xCB+oYPgMLRNFznkMLZ3mo4hzL0geAxhnM/h+ymEPHbGwoNIcEj5S4M/6XC92fZ3nxlns+q365eurcO3025zc/f4+4A7+Ew59PtN+3rqW3O6fqvoP1WPlHhFwk/6GeFsGOOKkrMh2VB0KPJ0tmD+AA=="
109
109
  },
110
110
  {
111
111
  "name": "process_message",
@@ -352,7 +352,7 @@
352
352
  }
353
353
  },
354
354
  "bytecode": "H4sIAAAAAAAA/+19eZRdR3lnv/2+feldvai71Vpau9Tdr1+39qW12NZiyTayDGMaq7FFZEluScYOCUEQMHBYtDkkMHPAi2wn2BhjT2wyMPGYeEjA78AhczAYc04gkwMmiWNizCSMJ56W1O++urfq+27Vvd+VuuinP3ye+977q6pvr6+qvgqdOf2Zx49OHLll/Nixm2+f/M/YreN7T5/84saJg4cOHbx109ihQ+fqPnPy/IaJibG7P3/21Okzf9VVh/8L1Dm+UicHFKACClIBhaiAwlRAESqgKBVQjArIoAKKUwElqICSVEApKqA0FVDGGejkQ3sPHr710LgcYJYaMCcBeMngvVy3Xg4yT0W9AhVQPRVQAxVQIxVQExVQMxVQCxVQKxXQLCqgNiqgdiqgDiqgTiqg2VRAXVRA3VRAPVRAc6iAeqmA5lIBzaMCmk8FtIAKqI8KaCEV0CIqoMVUQEuogJZSAS2jAlpOBbSCCmglFVA/FdAAFdAgFVCRCmiICqhEBTRMBTRCBbSKCmg1FdAaKqC1VEDrqIDWUwFtoALaSAW0iQpoMxXQKBXQFiqgrVRA26iAtlMBXUUFdDUV0DVUQDuogHZSAe2iAtrtDKSWmrqWGnAPNeBeZ8BTZ0+dcgZ6ue66ycR8KByJxox4IplKZ7K5fKG+obGpuaV1Vlt7R+fsru6eOb1z581f0Ldw0eIlS5ctX7Gyf2CwOFQaHlm1es3ades3bNy0eXTL1m3br7r6mh07d+2+ds/eU6cmh2Ff0Xi58NLJ85uOHD52/OzJhzYfnBi/5Xjw5MPbDx8fv3V84oHr+52jyoD9+4DS9x94wv59nVr7T5x88MJazOmFJs4je8YPjR0/eOe4oYZ0HY8QV0OoO/nohb4cGDs+tunI0bvNIb2D7RMDPtlzZuCHqj/YVm1vvfAl5pflPa73apyoe4fn8WdPPrDjyJ1n2NGaQsFhJ9Swc5NLbwcPj03cPfnRrqP3msAPbDhw4OLwzZaYFh7bfvjAxb96FI2ArfFqE2bz/JiDU9SY+t8QyxjLkzDbZcuTiE1aJuV81E7jANu07VmwKlK2J6HKk9t5zoTViHPYs9ys91FuNvwWyU2YUm7CiNxEGBtjexQ1Hz1ufxQzH315qtHdno3SEzxCUNUoP7j3+JGjp8UqE7S7n03ntxwcP3RgEvbnn/jcH2QfP/OFrkXlN6JbP/1PN7++PVJ6qfx7rd/44JuvvHbW/uFm88Pv7X/zx09lz/7uXZ/86vtKC+rHHj374i9/8c1vfyn7+k8eu+PFQfuHox4d7hZVQ2r7fivzfVEiaWP/fpva91z/t6t9z3HsKvP7+693zqdE7Z9fXeFby8r5w0f/+LsNLy/o+dH6Zx9deq71V72rX35m232v/eZv/k0w7mtMhq99OrT/tid+cyS59UOPv/elH+48kW4fe272R8/vf/707Fdu/oj9wx0KDPvZ+DeO2r/fqfD9r3uW3G7/fpfZcfG/QOWH/cPdapIWsn9/rarm2r7fo/Y9Jyl71b4P27+/zoFwlX8R+4fXMx8GPtRz7DPxTwZ2PPfBJU+lEs+9suHzGzeVv/2HH5+dffTz9g9vqHy4cHX8tfMff/+H6/7u4X/81K8Xfm39knznhvzS//W577cdnrip9TX7h29TG2q7/ft9jFKtUOfUjZKU4j7cr9QuZ0tukmyX+/Dtkh+OPLRn/PiJicPiqCJmjypCVY9scdBG9QXL3+NV3y5sIPHQ6B0nxg4dY9swsSb971Unbj+6/d0mXGLXyQevOTJ2wPxDtPrR+UmvODHOtxwVt2zYh8bEK8IP4vYP4tUPHrzQz9PbKrS8FCyUc0+f/OKWyT4dvPXwhT/c+8yJ4wcPHTx+99bx49df+jXJs+Pjdx1/ua755GM7xm8/MnH3ZBsTk1NZNt6BniTAJ0nwSQp8kgafZMAnWfBJDnySB58UwCf14JMG8Ekj+KQJfAJzoQV80go+mQU+aQOftINPOsAnneCT2RcEazLpc/vRQ+OX7IFu/2fNCDi9UhxQwnzw+hUrS/hfnXt66lTFJJlk72Ijc2DC1MVPmLqq9qRiy0QRfhcI+cg1k9y/7raxw6yVutYye67Y0+pH+0xr9XUIuJvva6Aa7COj7+YedkuQRtBctxxpuu0zuG5k3t2jmgtSnnf3wPPubqJ5dw9OK3uzc9SazUDNzuGbncOO28aGXvYZADn3SxXpZSICEXqvQIrnvoeXi14zdoOa7OVH0Wv36eP2sfRUGS0rELDs9rBsO+9RSDKe+Q3nO6+dIscdEC3jVuPziCA/3C1gXLycOz8FfZwzFoaE2MQf2HviXdYmg1XbBGWrRLJmfoTay8Tdpr18FoIPArToZqM6qGtTAfHkbEEwon2iHr2f53tSOaV03cTYhZQSb8SSWMJKJkFRZxeqBGKU1ToeeFLdKCdho5wgMspJ3q4kEKOcUhvzV6BmU3yzKXbcNjak2WcAZAY1yikWjBfMzAuf4C1emhUjoNU0P5C03S6/cI99PElKw5zkU9Ei+fXeUIKxsDbzl2ItoQrP4dYM9jWvgljHI6TVNGg2j5BRVQZu9cjmsV74LES7LGCmA6yZ5sU6W87dXsH+LxzT4qwM2R9apMr+MCHjHXDLYmd3nH0NgnSaNSRFPueF887TBoEZjMPThoSEOUqazrEk/HBypWnnEatFr357waM+dgn34sRt19FzbF93nDgknMN0wR+lrR8l2Y94zyaZkMvD7WUvxDqAAfeqivDUqY6PgKs9sj+bY65CiG1jnd021rE9rojUN6xJROadOt7qM/1COGWhnOkqboI/yYHMTSNiNCWgDEx1FiIrR1kzPS/QvOQLz1eMz3/jmZ67HExPq7M2Z7L2ly5ZC5n5ffyUhTXAlyj1nStEqex0otR+OUqBUpq3SqnB/uTIW1CaIgh2KtUrAdzGAzQoAYzzAI1KAAKL36QEcAsP0KwEcIgHaFECGOMBWpUADvIAs5QABHt32pQADvAA7UoAN/MAHUoAx3iATiWAO7A8kAzABJbqlAE4juWRZADexwP0KgEIdmDNVQL4fR5gnhLAER5gvhLAu3mABUoAd/EAfZIhpCDHsFCp7ROCwCNQDtxT8RKvwF4iwEVAWcc87CJRziuA5bwWvfDPFT+ZXw16PEF+aZGa21+rnl9aBOeXAkT5pUXIekzQTo3FbNe4GeJi1mUDzS3mm1uMTDoXs06cHLKBHrJRi4G30kP20kP2aMGeOTWOT2eOz9VCiNroIedpYS87tGBPrxbs0cNetmkhl7O04HivFgrpg1x200O2aDFwPULWHi1iIj04rkfIumCmRm6ttZioFhNNQ0vUqIVcdtJDLtSCPd1+hAZgIrWTS6Tmqz9F2606y4E/9Jzw3MCnD+Fk6hLfTy4vsXdnCdszMNG6RPIEZt/yVS/8JPsn34IYu4Rn7JIqY4GPlqLZWY6Iy9SIuAY8TL0UPEy9BDxMvcw8TM31a6lqv1RoyLTCqQfztM8dYzBIgx4y6w6ysuVWZBcWgZsbuf0OzAaTS6sz5WBMZUVEcZ/QCnUlTvu/IpJWWRFZxHaNYyzztKCwALMIkRUGsp4esoEespEesokespkesoUespUecpYWQtRGD9lOD9lBD9lJD9lND9mjhdmYo4UJ9kHHe7Xg+FwthKhVC7PRqIUQzZuplqhHC0ukRzBYc7rTmj0+6Ph8LQa+YKbGRAv8CA3g8y5YajMrSG2my8Ewtq9aKnkwwOcB4KzIYlVs5azIYnSjJpgxWSyZ2lw69NKyb/6t8R53OWv5hBaW2lRMIS4HU5tLwNTmYjC1uRRObS5R7ZcKDZlWsMx/nzvGYJAGPWTWHSSX2rQ4aii1uZ9PbTJjqyY3BYfiysGM+UJc5ayYmTvlDsdDT7JVtEqLHcihKfN0beWzq9nx2Y6rdjIfXtgMDxA/L9ovz3ybEJAoXw42mR2uhzucuHhS0hw821fwzFnCBG5B3srBb0mdUetCCxjIcMn2Th6x/4q+JaNu/zthG58nyop38kqaR8x1l1qzaahZYWkrWP/72GdQGILWoehiwQSHRcrBhbyV66sKOdBoHz+OPsbGTYnVXPt4OhGxUiRxWF2sumCx6iQSKwF/O8HFlj62a+RMuKyAXrkpOCbbp3QsaxRb3pcB2IcFujIAu7FgSgZgJxYlygAs97yCnuYRlit14SgPsEIJ4G4eYKUSwArh+bzgNtMobeDKawRYHwCoRgAP7+2qkWdfg2rk7EMigjy4ll0p3lIOPWstofrn1RKqe28bmxg/sHf8lonxSUpCJTD7wScD4JPBs0plJCfDsHMgVgx8YrgoxZo956GE5oVwUeFeAuUCIpQbAwz/NgYYSAiUVWsWLMWZ5ZvNsuO2saHIPgMgh9AQKMuC8cZhqBy8gVdgpllwyl/kR1LkgyC+eFVaYl6K1/nCilelwflawDNTQ+qCnIUFOU0kyFmUVrA8ZVG2G+7YjkPCNkaWsFdcBro1lAFuzEUiYyaUBWbcNjYMsc8AyBJqzIosGG/MSuXgBC8ZQxLGbIgfyRBvzG4n8AtOVenKwRNQJwfBsnRTGHsENBksZ18xoe/CSwn6FwPkfxtigH5v93hVcfhm+xHrNSARAwyiatPPgolEJPgRXm0GJNRmgB/JAK82Jy97DPDb3p6Cf1MU2oi6ovb779/6VWKcAbZrmFgb7sT6twFyOkZi/b67lCsuqdyYB4hcilAWmHHb2DDIPoOCO9SlDLBgvEsploOP8pIxKOFSBvmRDPIu5WHO5PZLeEmh44UFOY1QUBC3PQE26yZu6y9n/7MJ/ZSrEtCC4aYqTY5iNfX7FcQsVR0EwpIB7qEPFs6QbK+fqL0rOj559TE5tBvr5KDCJM9E3MshMipexIQWHEAKaQ73aimsvUGi9gYl27vc40sTtZdmX7PZvBRllJBCogSBcX0RDKOdjOsW4bax7MdN6Jew8B0jgte8iosIpghHMCmiCKaIC4y92SGiCEaYgWHGbWNDiX0GQA6jEcwQC8aLyHA5+HNeaksSEUyJH0mJj2D+nk/NEmpX8fKpsamqzkr8Gsh8N0o8VM5OmNCvY0pcRAmURka1RcGsph13SRbR2FZeMQbAuW8JsU7DvlunYdg6lYis0wiqXJYV4aemVoQ3jB9bsbK0eXI5+O6jx8+c/NNt42NHN0xMjN3N0G0EvpZy+MzJ85dePy1YOC3lhBcSnhM3k+KaMeVM+H4xJ/77UO6ci045fII/RWKPElHsUWJfgyCdLiUZFliKVDkUcb6VJI2I1igee01i27IJgFuGKbX3tkN2c2L+7JIMfszOotRIl0MpZ2oMINTYgxnbAY4algS2DDXS9++asIsNg6YQkanlVwL3q9u8Af8jsgG1iGxQbcz3KWViYDYUJSY/+FYFy9xR5O9DHT5uVQi18IlkwkDJMpHzesHWfV65Xpd3DtdC4CHRovP9WClhUjB7swk+H7sgixOuDCUrMmybwBChWytlptwDol348eq+N54yA+XQcs8srUPuahzk2c26rymerFSlhgPD4+VsVZoGMYaD98lmeNWNO4bMA2ieV97cGcg+GtjnDPnuc4Zgn1Mk8jkl1GS6jrNL5UnbBUXaQ3ikfeFThVg7gzWVFn8zAMTbgw7xNtQ10ojbYFkBsM3AdzSgu7M4QY4TbRNKP7D54J1g8iUOq/6OE3BMHIdJwN37OyRhaOIPiUIS5ppjkXkLbTcvG1mH8StPxK88+9plWsPlIoU4ZUPxKoGRPUYyW99/gl0ZKgPwBR4grwTQh61pywA8g01gZAD+HAsiZABO8gAlJYB3YHknGYAFPMCIEkA/D7BKCeDnPMBqJYBtPMAaJYCv8gBrlQBO8wDrlAA28QDrlQDe4AE2KAGc5QE2KgG8xgNsUgIQhHajqh6RQ9jqbcu5ibOFdxyjbCs2m71Z3WZXm4Kjzc1E0aZgNJsRp7GFHbQ85BZZSI5rW4i4NioaJ9OKjWvWTiFdXkpPhTZ6yCX0kN30kGl6yJX0kBl6yDw9ZD895GJ6yD56yAF6yEEtIBfRQ5boIYfpIUfoIVfRQ66mh1xBD7mGHnI5PeRaesh1Wriz9fSQG+ghN9JDBrWA3MRlooLVn2DmMMi3F5TLHAZhSCzvlxUkfOSuMQ7USSxePQ2mFZ3XMoKCZF+mnA2Y4H+BVVEwMPrHwXoI+5F6CAGkAFaQqYiA9CoJ0UOxtoOlV+fhsv0yM+w7eYCgEsCtPIChBCDaV5Yoh5eZNP1rvoWwUgtcNb8IsnQUVZtnLlafzEfhyXyEaDIf5QUqAi6kxdiuccIWY/kKNBfjm4sh8stAzqOHXEgP2UsP2UYP2UgP2aoFLQP0kC30kM1asEcPuZxFD9lAD9mhBaQPoh7Ugj0+yOV8eshuLZzuLC3Y00MPuUCLgc+hh1xKDzmXHjI8U8OsoBaR2zwt7KUeUXBQ5WLBoNpEM6g+yw36f7FgEE2b2KgRZrvG0ZF5GlJoLuK4pTWE9tGyifPPpjZxXnPk1lOnzgGnlK4S744MLgLeHxW/HwqcE+14RLdDLpLbX3kpgWgm6jJFcX5npdcd+Ohma/6gdqL6E8zDJXhmJeTycAkQUrinMYdsuUsp5ba2e92zN+J1z94OrCKbDMBer5v+NvAAC5QAtnrdNbjZ667Ba/jyMLDxVtxgvlPdeCNn3AeJjDd+EBcuW1hEqwumFI7wDiGqPSThqt1DBughW+ghm+khW+kh2+ghG+khZ9FDNtBDdmgB6YOoB7VgT1oLUfdBx3tmqo4v1EIh9WBPvRaWKKCFJWrUgpZ6yGWzFhxvqVkiMsg59JAZesg+esisFpB5esgFWrCnXYteLqKHXKyFEC2hh+zXguP9Woi6Hia4oIWo92vRSz1o6YOoD2gh6j7Yy7laxJfztUjq+DBJ8WEq5UN6GZz3FEVFq5jLGkXlvMKve64HvNvHCqa71deehu3dGWZ7Bq5LsR0rDsAdW/nqXafXr+57E2LCMM/XYcdV/hF0MQsphiFFxB1TFJkCDDHtWp+EeSpOPYmwjV+qlzOKVfmQ7JcKDZlWOO0wKXyTO7bAgKPuACs7CxjJY9RruuwtcCrEmhNvvfh359KjgkpsySpJkfEPcqVHB5n3pi4/5Ve0oVNnb9n+nXzsUn8vvr7r6DmGK7a6lsIOiGtaRurMElIbue4X2WGyJgYb6NR44N4WL1TIAgjIUSdRoU7v9/8i9n/+7NPhr/zgtSPvfWPh2W9t/eR//+LqM+Ulaz+w9+//6NUdCHUuFPICBoWMeAgfcYIfsQL5bEI0JKFEik43yb7GbSmAnZxipey0upNDHNkQ0QaLEk4rj4495c72l+xsGGGfAZCr0JK1Fs/Cq/eqcqSFl4yRCiVuVHDpI4x/uLS5LVKPxE6yQgHLr8XpeA3zUmAROfPEbqQT5CpwYjduES7BDQ6ZfzHBu7HqoyDzk3wtwZyjc18mkhjzI9Q/LitH5pn+8VmogRxADxkjtkwU5uewMH+yT4s8WylsuyRI/Zy5fbE4YHGjlyC4IlfLPIg/aBGX+WcRlzmG9iVhkLVbgs/DTuEZ+OUqvqNxOPoaYWN7CNGpSj3YlzVIX/gi9KuZD0FEYV/2SPRlHdIX/mattcyHXovx7fFajO8Gr8X4dmHF+KT0Io5V45NCiPAIiuXnop4L+sUE9jFXThwz3cwmSHrCuC3bxglQhLUTAGgEPRTAefRl7GvnPR7/T3iuXpAUEDNcNsZMYl7tkpjbhcCRT5vAO70WrrieBwgpAfyO17IS7/WxrESL+pRC27ISPhzf9+F4VUiLXvpwoC6sxcD1KDLgw/H9oBa09OHk9Qp6yOX0kHrULZixhUR0ORhfO9qLHO0NsV3j6Mg8TSg0N32O9jb7f7S32e3RXqiSnkAuc2qi0aEulzlYLhNEcplDV/Fs1FjKdo2TS+YpuP9wKd/cUsRkMJDd9JDz6CGb6CEb6CE7tIBspYfspYcM0kM20kMu10IhfeB4gB6yhR6yRwuz0ahFLwNa9LJXCyHygeOztPA9QS53zlRHXqYQTOXkcuc5d/EZ8FETvi5IFcjn2oH3rxW/31SnHsi3qwTyddxuHYZr1jof2NafXGXrDywCcSIRiLOvcfW44blHk1r4/xH1uUcTPPfIEc09mlBa2agxj+0aR0fmKbiRZx7f3DyENfMkjLV7yAA9ZAs9ZDM9ZCs9ZBs9ZCM95HJ6yG4t2KOHqPfQQzZoIZcNWnC8QQur3qMFx2dpwZ4OLSB9sERBLdiT1kLU9YiJmmsBTC2AqQUwtQCmFsDUAphaAKMte/QQ9YVa0FIPS1SvhULq4c70CP/1kMtmLTjeUrNEZJBz6CEX00Ouo4f0Yb1nPT1knh6yQA/ZRw/ZrkUv12vRyyVaCJEPHM/QQ2bpIRdoQUsfrPqAFvYyNVMV0gdLtGimWqJ1WrAnq0Uv181UP96vhagbWpjgPi3cWb8WOt6uBS31CKznapE1mK/FAqwPqScfEmQ+bEPsENZ/i/5frNbIhYYc9+R+1L69NljpkGCzsaGKbaVDBdikgtkS04KtOwbbM3AjsiFZIvf1a3Z+9Z4fvfoziEEGzyCjyiDgoxT/EbvTG77EVIqIHwZL5KbAErkGWCI3DZfITan2S4WGTCucmJsUvskdW2DAUXeAXIncIKte9sMAjPSChwECfHtYdcS45TVB7cFYHVPo9nJ3yL8T+yl1g3HFT+x7NZJJd3rEHYtIsc8AyDRabtSipbzUpcsxwVnvVIUSNyqYxxSja5cO3MeSiB+SFQpYfoOI/IYr35nFQmNgfBUAimMytjcqIF2gbOwywVs4hQ1LsC7IFwtNOps5uWKholppRjnW4Vws1ADoEZUYUVxULNS0wqJiofFyrIfXtyRdsdAkxxqD5RKNdwqj0Q5sS+O+l26OywVYXmxpHKWVjRpJtmscHZmnI1BzSb65JMIamdL0ypBO9rEGWAPUGxCqvk3hueNy1tJ7QyYYX/o3KeEEFKkXZl9zhDR75uxVU4jL34O7/FQ5tsu8LgKMKVIe6oOnRS4/hbn8yaBzr9mnbeDUoxq6Xa/ab8tcQkQUY4UJvo8TjRTqouLsiwKJkws8UkSBR4p9TR7SOcyMo9OKpKV3oqDuXYzU2U/js/rvdPWIYb0KxLRDu7Dy/J0KoUocoW4n+xpsEb2mgyLqYV0aDuviRGFdGqWVjRoZtmscHTOOjirDN5ZBGKMD4GXzcYy42hpKUzaUllMGivDA9ACclBE2k6n6KE6Bs9ANT+y/P0o9t8Nz4cAt9jFuqXSrzv5kKyJS21g+2Z5tRxh3FUsP27OrGXqI6V1np3cdS4eKA7jamrlm3qnjjHhWwkVmeU3MyrnIrESwcQps1jnYEEVg2bLRaoKfxRK74D64pCjECmAhVrIc+2PPqwFYViXleZFqOgm+snAHTOH+mIJwW9bEkAlJWjEkNdgmMLudVA1nTRu5HxtMWiHcClQjTyQ8Voq2kr6XEE76H20l0WjLUtXrK2ZVr7EDm8aOHjtxaJJltlpdDL2F1bqSgTOCglwroBq6Z0H82UCVsM1QGeCzVmjx/9nqgXmMr92ZmgBiauK8qZlCfLu6MUmbxuSniDGB86hbkWWjbdzkixVrp8lX3Dr5sth/O24S0gmZHiAzxICDLCTNUO17+9/88VPZs7971ye/+r7SgvqxR8+++MtffPPbX8q+/pPH7nixCA/z4mqWcCToynCYaCE2fCXbkzdHYdhyW0yl/HQyLJWeSyvMyExE/n6ttESglUUQ93KIGTg+Nh/kRIjmz01Y/AtWjcyjmJuxyobgxvsCislzPM98CmHWo5hdHGaB+RTCbEAxN3KY9cynEGYjihnhMBuYT91hRrHLuxo5a8iuJU8ZTIUNXop3OdWrh0fIXU5BovAoytMzCCajGtmuceavkQ1e5NnXiFhUBjJBDzlCDxmgh0zSQ6bpITP0kFl6yBw9ZJ4eskAPWU8P2UAPGaGHDNNDGvSQIXrImEJQGwQmxE9OTYgvNjM1Iz51SmHOaj5JiWfLgQI+axXPmgsKQ4s7LsgF0QU5h92lwbKRQRbk2K104gAD2xAa8j3/EvJ/Qyh+PRK3vZDpGja/Qrb+Yc3RSreZkRFf2BRwI9vsrUrIfCOlMC/KyeXwc+Iceyezedp9An9IDN5t6s6bCgNidsTKz+RybL+Q2WG+tvLkbeVJPgXApKw5q8j0s7qAhGbvkbyEoZDpSLO9gMaCugxLQkQo9kOsy4BFMUy0UBeGua6iw1HxYNa40uGwvzoMdQQYZQa3VLmysYkZJXzGqGI6pp6FVXchV9p4C7zVIqJELicaC7JTeZYqnCgVWHpja145dDUtrXD+QcpKpJz3tAXQzKvinn0H12aUjb3OapHCl6ak070pTC0sVEcMaNA3sU7BYp12FGuhhXaiUVa0pYjhOieaWZZe2IGYNBKxBpgjMdzVpHCUr0jNXvUoPwxH+SGiKD/MUzwERvkJlBfMU7DoToJvLoE4QAaymx5yHj1kEz1kAz1khxaQrfSQvfSQQXrIRnrI5fSQLVroeI8WcukDLZu1kMteLax6jxZWXQ+z0a2FQga00PEZK5eztAhggtgZ+GUKEXkYaW8Z+5qrIF9+3H7cqhqeo3arasLFrapzFG9VtXGNmVLHFVZLQgjX4uxrECSQwkhWN2BBRR4Es9WE2oTxrPpsNQHPVsNEs9UEqhtc6o3pGscBH9ZkchJxjXvIAD1kCz1kMz1kKz1kGz1kIz3kcnrIbi3Yo4eo99BDNmghlz4Yt3k19pBBztJi4B1aQPpgNoJasCethajrEcA0z9Roo0WLAKZHi5hID1GvRRszLdqoTVJqk5TpKJe1KLgWBU9HWuoh6gu1oGWPFuyp10IhAzPVUejhdH0YeLMWHG+pWSIyyDn0kIvpIfP0kOvoIQv0kCktaDlAD9lOD7mEHnKDFkLUpwV7Fmuh4z4o5HotdHzGymWGHjJLD7lgpur4gBbak9LCnemh44u0GHi7Fu6sTwvj1qcFLddrMfB+LUTd0MIE92nhzvq10PF2LWjZp4Ufn6tF6mm+Fmu6PuQvfciy+rB7GUyJBkSV9s2TDfuE10DG3/B8R+q9KncGJlSxrWOtAJvEM1tiWoBPwhvwsYeE5IXN39n9t7f86Mv3gcU38SNIwEeCIhXsOSKPFcTPuLiwOXEZLmw+o0RDphVOO0wK3+SOLTDgXneA3IXNlotyp8OFzfHfXMELm0VXx8ffmlYdWlNOhKdVh0rlRNy5TJygNF+8KsvIKHipDEoMUdBcUG6IoC0MiUZg/tyEdRM8nhdGMTdjpwhVLtllMEex86SGglFhMLuwukMJBd/CYPJFxy2WFsBMo5gRrARS2h0mWnTcJeYQhxmVwIwj916D3iKNXIK51wIkuHAy0eN873USOIDaJaHEwkswk1jcONmn+bz7z9Dd0JRBLoPz2q6LEq4ZOG5MEx2XdajB5foKnaT4aHbG7yt0rvHzCh3FYqHr7NK0rtIbrljoepZytmcbWNbYnm2sILq4Qifn5gqdDNtn27Ms22fkqpuM0xU6aesVOkm2CTtuBtIJmR7YX7Fc+4XLQsa8Qmft06H9tz3xmyPJrR96/L0v/XDniXT72HOzP3p+//OnZ79y8z3wMC+WshOOJIneFCSuNh2nM1U5UlMV989UwXerWhZssbTGCH2mZDU95FotdnMOarEJPEQPGdZixSOhxSJKhB4ySg+ZpIdUudUBuuaQ7laHLHCrQ9ZN5fuswtDM8NPlrQ6WIt+iWx0St9Vudaib0bc6XOPXrQ5QZW+BqHSqcatdXVQ6YVHJEYlKJ2rsbNQYZLvGiQrzFNwVNsg3N4jYVgaymx5yHj1kEz1kAz1khxaQrfSQvfSQQXrIRnrI5VoopA8cD9BDttBD9mhhNhq1UMh5NfaQQc7SwlHwK5Cd1Z/LFCKfTqS9ZexrroIp+XH7UYK1s02tBOugixKsbd5KsPqQjgmzryHtxYnas9yx499c4kP6zyUs+oRpG5igWoYqDgbZSw8ZoIdsoYdspodspYdso4dspIdcTg/ZrQV79BD1HnrIBi3k0gfjNq/GHjLIWVoMvEMLSB/MRlAL9qS1EHU9ApjmWrRRizZq7qwWbdSijVq0UYs2Lg8t9RD1hVrQskcL9tRroZCBmeoo9IiJfBh4sxYcb6lZIjLIOfSQi+kh19FD+rCSsp4eMk8PWaCH7KOHbKeHXEIPuaHGHjLIDD1klh5ygRa09MEED2hh3FJamA09dHyRFgNv1yLa6NPCuPVpQcv1Wgy8XwtRN7QwwX1auLN+LXS8XQta9mnhx+dqMcWfr8XSpg95Ih+yWT7sxusQVqlK/sBzYbgP+1j95cM2OlSATSqYLTEtwLU30vB+3IxkRcGvzd300fv2ndsNMUhQbiFTZRDwUZb/iN3wbO9ruxoRPwhWFMyCFQUzYEXBdriiYFa1Xyo0ZFrhxNyk8E3u2AIDuuQzV1EwzaoXUnAL3BMvKAyWQgYQt7wmqCiY/DFSL+/yd2hVOfnTadWhNeXkz65gh2w2LIWYVMWaVgl1k4qYzRTRMYY0SivMosO6eyO1MagB1gBdAcIBkqwuws2kEbNh1ri9tlJtIQUWdUkBNQmZCpMbBXYyVc68bILHsfqUadhOwjUaQf+L1WjcbQES1ENMZdzXaNzI0hvqnIsajal6n2s02lmTZLkEEYEX+SQiiwn2NZssJulc2P8gdWFJ/1xYEgniFXn7rLtgOe05Sg/ZGdkuodKdaK2hDAvG60JnOdWHFKZr5+Uu52i7letLXXbAdh6wnWVaxcbOxtTn/utLjgxdyYdTsGYqCsvb1DUzKzcn96KZWdRxw5KWFfHR/OnD/WY9WkD6cJeHDxetL9eClj5ctdJLD+lDOclGLQY+T4teNmmh4z5wvE0LhezQguM+iHpAC7nspodcoYX26GHcfBj4HHrIpfSQelw/t1wLudQjCu7VYuA+eMgWeshmLbRHj5BVD+3pqDnd6TxwPUJWPUxwtxYmuEkLWuoRX66cqfHlfC3MRrcWtOzQQiH1YI8P9jKoRZilh1w2ayGXM9adpf1wZ/YNDszOmLDCon0aaS/MvoZcgxcRX4KTRVZaFQsCh9VXWnPwSmuWaKVVwL4suNKaZ7vGkTovIS15vrk8wj0GcjY95GoFGXPeEo5TkqxCefoG4P3d4vdzIfUK5TeoVCgPXXY19u/0Qp+6jl7xu2vhy0kFF0IyTwsKmy+yCGsYyHp6yFZ6yA56yEZ6yCZ6yHn0kL30kD30kN30kC1acLxHC1Fv00LUG2aqJerVgj16iPpCLYSoQQtaLtfCUfgQwAS0cGc9M1UuZ6y99MVD2qY35oXQ5gGp9FZw3gQcCGLObUb4KWNEbda2XnAeIlPOPGx272r7EKLIfDWu1vhi9flqHJ6vRonmq3Ge3VFwvppmu8aJAvPUIEolpCXUyj3kQnrIXnrINnrIRnrIAD1kCz1kMz1k60zleK8WOu5DL5voIRvoITu0EKL5WghRtxa0bNGilz1acLxnprqzRi3YM1+Lgc+hh1xKDzm3Fm1MZ7PhS2hgXwU2qj+TUHsG356BtJdkX7PNIw26WXWQdFZt+DerNlzPqqe+u9HdFF5eegwfdkDEFwHvjwI7JgLqOyAWqeyACHCyH5WQ/ShKYkz2o7WMEklGqV+LmbsPk64mLRxfQAvH161FL/VI/9SC21pwOz2D2xma9+rWQohm1VJpZJDLtRCiVi2ijZaZai8btdBxPRxFhxZyGfSDPfZZNTPnBGfVAb69gNysOoC1ZxC1Z0gYnICb3Evw8uReAoq5l+Dlz734LSXyDEhUiYN0MqiQIDIR93CIQVZa5NOtJuJuLIllKCRmTMS9WEo4rmAwmCLFmzjMOGs8oI1gKOZm7ABTRmFPG4PJc9xyHwaAmUMxuzhMZqNcDsLMo5gbOUxLvVT7gUnm8Fxq6sAkfxnNpQeTyb6ff+Jzf5B9/MwXuhaV34hu/fQ/3fz69kjppfLvtX7jg2++8to5e94uzG3ty/RXN9dNPdtXzpTMx4Pmr6LVxP1wyZSNu2Hs0MEDY8fHNxw+cFGpRw/fcWL8xPiBnUeOjx+b/OPoneOHjx87deqs3ayZvZoNGLxNwN83n7UaKOz/HtozfvzExGGOBwWWVwBfCzxfC4gJS7CvIe0lidpLsq9BkMD+TOawX0Swu7JQzmyoVIPPvwn3d8eJQ3Zc09YBHzXwg0w6ut5G/qMGjNr1EoFyA0LtUeijJje9b+Y/asKCsEbmUze933NFe19ge2+zP03IKkqz7yuIzfAqShPRKoqQWOIY8StmjDh2YNPY0WMnDk0qN2QiG8SxX3PgjCC8WwEFcnQmeFTKBNuiSzvRW9WIvs4uTesqvamzP1nPUs72bAPLGtuzjRXEt4ulq84uXXXsaCoG86fWe8KYd7iONrN9tj1rYftsDxMY89c8RfTHLvX44v/sOnqOVftJOy38tIXDbYZ0QqYH9lcsdsICBvb1ogIxkQ5maRokfHiDyHNI+fDL356N/w2IsWxRU50GdWPZAhvLBiJj2YLSykaNVrZrHB1bWVMGNNfKN9eKsIaBHKGHXE0PuZYesp4eMkAPGaSHjNJDGvSQcXrIND1khh4ySw+Zo4fM00M20kMW6CFD9JAxhUlzAxBxPzkVcV9sZirkVspLVKMUcTheqMfDYnFYXq8wtCbHGWo9estUE8t3ft5fX8581gxjR7l4jplWF8TFvApIzNLg+wSvAY5ZCkQxSwOao7FRo5HtGifdjRJ+th5tjla6zSmfULbrA25kO6Ag2+GqbHNpS2b01cQlkvFPEC1LJNjXkPbCRO2FJQKlgMyZa163A+XMl5mcnl232d2mUN45aOadkX/v/sLTnFkIIWYh7HuNvzBsFkJEZiHMszkEmoUI2zVOBCISgW2Eby6CSFVEIrB1DyngaVCNrBnw9r06pPZaiL+lDkg+S2RvghXVKNTLZ28sN/Yhq4VphRXNoMfdAEHmmtXKgk7lx36BWQheuKv2vEe9WAguNAU8V39YqK7wEVTjQGPAdqw4AHfs/k2fi6+5aWypO1WSX4pmd3HY+xpTI+ICq1CHWINgeRLmqTj1JMI2fklZRvl+RVX7pUJDphWBQZrq543u2FK5JVjkisH5TApd7YeWygH/zeQ6h8QVT/7OeU1OsGYed5Q9YV1Vpl/IQnuOe5hiBRiSupQpOabcKclNwqTEW2A94YjScJ1oJLiKNsdynRPIdpZemCnPupGuUf5ac5ZhThebDyNiAk4tRwDBHa7+XCYQ3JFy5nVnwV3lZm1yNf/RKrZfdtkcYT7lHjJflkDBXeVRcNOw4K52FNw1/HBXO9JoLf/RGpbrnGiuZenFPS2xbXOVo1jaX5LBSCdf4tr02LKeHQ6J8lWzb2umn7KZ/mosBYWq5paaLJiWHQAUyLJxiVeggXJ2rgmOWuN+od/IZs3g9i+xr/PcQ2YzksE97GcZrzjiftxkTI640ezzc6Ay5j0qYwZWxgFHZRzk9WrAURlL/EeDLFUwdcso7L3rdzTmeTRP2G8RcI4/+XK2i8kTYntwB/incXdjCoC+z1IrfEpRQk9zAjtQ/VkEBRblKjeUIvsaCMltkwpIeP/SA5sP3mnvifNngw+J+FmykJHj52A5u8TUt+eVJN6ZlSVU0gZYTeB7VipnVzCSpmhmBvGQetLMDFTAc1/3AJ4Sgw85hz0Cg1B0tCKC6K3E9gsRfD4mGmTtKbgvo2TdQzLIRrL2VCLzcMBpb8qwdb+HZRgCZy83jn6xiO80nehGfuI6rOY6QgoM3cy24oqlGWy0IGbJTAWVVPStSqbtILKpEorY1zCRCBxk7Td7sFPBTmdA/5Bhu1iN0hA1ETm9eDl7HaPQUFAy4C0oCdwPByVxN0GJ8/S/iAYlAdTrCXxiRiIujLt073HTva9UGE2AHRjw2RBg5Yu4UAyVs7e4svJxj1a+yInvEGYdLYEKJLpF/0S35Ci6wuE60WiE/2gYFd0Rll7c0wG2bRX5khDdoim6vRjreL6W2DjDlayAy1YjaGhWYokqyutk73IOzVaheW1XeZ0AnteBOgJmr6Z6s0UwxlXl7PslbP6Qx4loHlacVY6KIySWE4WFqSSGJpxqrGGpjXmEVfzTlIRaDblUq6GKWgVfUzjvFnCcHxcBcUnj/qBYzn7K2R8MufEHAicyxPYLMfklzOKkroRYT0N/UHQQXFgG06YMvqgQmKU8B2ZoggOZMQwo9HIQyX5Y4n2kvTRRe2n2NRs7BinTvYOSepVW4FxRbmBF+8CKlAOz9B1KmFcz2V9WjZb7MWc6GSt/y4R+EssnD7oWbQPmiCALN9XZPaAFHPRoASOwBRxytIBCg+911sCJxDDLAQC0HxHnUd/cB0K8QUfiFVHTopKNY8iDpecH0DT4oAJppeKeftPnPKEwmgGP8tOvNuss8QabF5OSf1HGsKOYCAMGJxoJ5jQjqJissigF4m2GFSJGxtY6punAsDErztO95BzDDruRLjw+G8IEaASfNV+BGHYaSlcJdfmupGuUjxNYhjlFCsUH9t4Gr351KfTI9Dg73K00FS1uVCT1rzqnM7D1GjBZPSzbr5KgX8Pl7L8iZzLYUVWO4cJ60qlA7yEkjuxkX4MCm4DnVRYXm72H4f2dQ0SbvYdRWtmoMcJ2DZ9+yhuREYQ1IxLxnHvIAc88HeEpBG32XoVI2WoPm72H3Wz2tqS47FrIqFgJ0MKShBaW0JwHpoUlMMEy3bSw5J8Wlrxr4VBNCxEtLF1xLRxi+4UQ4f7rVzjSoE5FZ0bU6NutrjMj/uvMCG5f7M2uUmu26+QjGw+N3fI7G4/cdfLh647sGTtw8K57hQY0JZRqy9Zdat4Wpytvi/7xtnjZeDukxFskQE0TBahpuQDVe0bV0ncoS2VmVHPg+tcwuMsMyagOl3PbTOhVWF50CEtjG37tCKgLTbP8ZwDNfw6iKbwhhVUMqRSeWVsxeAIezd4T77JCZ1kA0BZwnw07rniuEs1SzY9YIMEyeW6HuZHyWVURH2EHJxTy3a7OjzgvF+L7DPiM0zAb+SDnR4Z8Oz/SPc3Ojwyi50cktjua1s1Zqte42SuLd38E4+JaDwehssINM7l3SWwmWe2fiIy4EZERjzQeRkVkFepSRxTM/CBocy0J9qonRk+7QMcm+HbzSHRgWF7jJCJbzk04b0DPAuLGuJJuMfgJZ7spGJDhyPCCiApMv5AqygWs4nEWqjxRMCtPvIX/g3ea2wvjCDsgLoqT+32TjoKd4wVvE5M8MjGpVw3SlScm9fDEJE80ManHVcZjmaDZ+MTEco6ZGTXTHMNIqKBENX6/R1VJc+z8QKiknzTBPw6Cu4wws1PQL3xWSZOd1F9YlYgZMaL+9XhlbKSQM1xyE6A8861op15DOXevxBnDgsc90U/C3rjB0RsL6147cUdQ5bmRpQrnpJpYTslLYL3jjKKArnvV49FSoZz7AnbGMMnSBCvcpDKmHKhVOV6rEGuA3SQLkivhXNhpjoBQiXLuT539fBIxIaAopUSH8pl+2dXVWoTA9pD5sgdUt6TH4DcLq1vKUd3SbjZpZkQb3BmuY+djBGUjeti2uQuYWdpflME7vNHrrifEIUPIKopmYt5sxH5pRKic+xoXSpjhhlxdnZeef+P7T1218nazFguXfqvc5uCxofTzz+z6yb8dned7Q21fG//uupd/8bJzQ5VJwNNIJSXvyUoT7CbPlXvQmkQygXCAL9IEB8KKN3y/pR4IG3J1obwEwgZagMjrtdL/gQfClsuLxBaFYSRkng2wWlTcjKX+2nM9uP/wLJ3/D6xAWA3lwb36McAPh9gB8X44Vs69bIK/hFaLhG6libGqCs5kDetZ7Bj7ExoSnxCOsgODwhg0gLNUEROdl8391DkpHAeIHcOJPQn+D85BTwLVOPlIKcH2C7keK8klN5hhxJ3OwsdBvgbgjxIXOFs168zX4Ccx65n7ODtO2c4ZbEsCP8OggyLJkTkERt8hCwNMBa56Ta9lRSOgN+ISNlGWL7ZnscpX16vvhwibw/mG/H4IQSU/ktABlIOIVQ5C7E/wo6j1owhCwQhlvGMpGYjoAzSkACraMT7zQtj3AMLZEGVDJtgNnt1um72jQc7t5lOqbjeIu5lYOZ83wbNSbheMzypOcqrTb2M7Ac70Oc8qMdOXW2o1hLP9fBPjVSH7M2qSBLyK1nD2vHFBB4xy3jzKnm/DLqAMY64Sc2kP2TP08aqDE1JkjtmhLqzNEE+uR+wT6nJ+LkjUm5h3fHCUSDQYchcNCnSd6RjS3qQ73HnEOhmp0vtCaWF7nMMkdxLAbVAJ96FQgu02QglLXGPJVLkIugzUn8RRi60S9QTBqCcoiHryKUzl0EARkksDHUpCYTobA4dioWvVNHnMr9zz07d+8In3tb7qeyJnzeff+7HU4ONP+N7QY8nvbfz6543/5HtD343946++/T9vPeV7Q/f+1ZJt/3LtP3eq5MCQe5IDmNkKYroRwlwDeIFDgqmnzvujfWJ/dB0fSSXVIqk6nlwMFBSLCGv/meHIbuE8Ov8eUx/fpjpJd4LeL7HdJeox4x/2Ui8r4aYQB54gMNClKrAnETcrRlE0P2OwzfL8iZbz49gCWwB1dkHZOCOCpKH3maL3Uc9zjxgYttUh6ygBpIZxEKmxzYWSSdiWSMz9oyYjPobM/a+EWbwCaptwVFuhBprKgusfHuu4l3NDMbqPYMyLsh3AehxBexxFZvujTv2taKaze5YfCjrFQaeScp7JzDawVkDkmU6b47tPwTdEmek1rDQJBbGNwIgJVoDBsD6JJHP90t2IXy53FN3IkfSgCXFUd/GZucHIyrQX/VFH0X/EHM4zbkR/D7no76mJ/gUiTG/Rf2b6i/4eR9H/S3M433Ej+rvJRX93TfQvEGF6i/53rojoI6IWVdh2GEdWfqLsaxBLBbtxEqqCo7wbJwHvxokT7cbBFF1l6s8QuLoB56ndR46NHzxw5PDK3eMTt584PvnmkcNnWAEPs/OT8JWScT62F10cmv+5qQv/AC4y7wNXcm80v/53wSxf5k7RyX/DyPott14UktAVA83EI0ptiBchf2WO8lW4q0FBV6fafLvwcsb8v3q++w9LJcaQwwNRc0C/dveWKRr7edFg7acpHHArYWRpJEKUqP7fxu7R4H/9xGyJRPUl4Zj6c7Tqa4V2LvYQv8jLWBr7TtpYuRCq0KTA3cFoNlV5owC8obwzAMhaxe0fhKofWFpOVF+w/D0JxQZTf04JyGNixTnypMqFvI0BRvWzirGzt22I207YB5eAPEAF0P4Bc0ddhSMJSBBV95EKEi+2JVXGlAedllRtG3dM5dxFuW2I2yoFBxEx34OIGBxERImCiBgaRMBp55joqKjpLuU9loFEdzoAYjFOWMKJR/hLsoLVaYXjHuBCH7iy4rwHWLymUrjTBF/srtdQj/gCxhHHj0L87qSgDFkfEu/3Neln2x3CREeRixdPc4SJlAvvNAnTDxMG6y64TTkmu01ZvG27MMRsqEK3ZMtPu2JwKGnZc6+44BrBF1wLa1ztiXY+CIYveUbwPdHIlhRLFsPgp6N8FiPmXxbDcMxi4Mf6sIsOEw65Brk9kXyONySW6KtNXXungusy4IyshQPyiMzyhqsjBpZLx4USf61zzdYIuNERUaZJg3WdszLF3SiTMBfG9ArJNiEb9ANWZbI4Kvg4j2/KFHJUpghyAGAPuvcO35Ydcpb9gNC/MZuVge+C9++asGwEskyERfP3wgGzN3ege5O5h0H2Pag/SA4DXzcOgju1BaF6yPdQPQSH6kGiUD3kRlUjKIEV8n0hNt8XCaMCHJQVGRcjHcXkLIRkYILQmbWoRI8MpaX0mIRjNPhoOOQYDSf4uNtw/Ei8qS6Bu+BJx/R+5wt1XW6rK5y8IlGeQRPlxWSiPB/XqmJuoryYbJTnAnIPplJxd6GoyrkT5numWdG+1sJp52ALLmKByPQk9LnpWMICOTVgkeko+/0VmLlE3ay/RuW2HqhIILJSHvMo03v8kukHnWXacCPTRrnw8BWx03Es45CUlmmLF56Wdho7gLIbzTbGMZMbgzNwWLKXay/GvqaQGDd8j7YN/xPjGG+CbiyKUrRtsNF2POwutxx1eUA9ymSXPS5Jrpr7qZa2v7kj5fshnScHF4+k9837gO8NRcJtf9L1+DuvcW7IZliUy9MItaKaeTftlYlvsXFG9QVbR+Kqq+/ilUfkBHAEXv2c9Fc/FANyh5cN1aXMULVZYIE7qYpk2JBirpHi4NJuTL1TEFRUcgk8zi/6vjAltv8f4H+X05wjAwA=",
355
- "debug_symbols": "tb3djuy4kXZ9L33sAzEiGCR9K4OB4fF4Bg002oO2/QEfDN/7mwwpuHLXRnJnZVafdK3uropF/fCRRFHSv37677/+1z//908///o/f/v7T3/8j3/99F+//fzLLz//759++dtf/vyPn//26+2//uunY/6jl5/+qH/4qctPf/TbDz1/2Pmj/vTHfvvh5492/ug//bEct5/j/DluZYrcfpbrp1w/b6WK3X7a9bNeP/362a6f/fo5zp/lOBJKgiRogiXUBE9oCVfhUuZf1Qnzd3zC/J02oSeMC+RImPYxQRI0wRJqwq2yyISW0BPGBXoklARJ0ARLqAlZWbOyZmXNyjYrlwklQRI0wRJqwqysE1pCv6Bawvxfcx3WnjClt81e/EgoCVM6V69rgiVMaZ/gCbPyXHXeE26VdTas3SrrXK42983ZjCYJt8o6t06zhJrgCS2hJ4wL+pEwK89mzP1ep33u+TaXYu77Nu1zf7cpnXv8CeOCuc+fUBIkQRPmn881NnfwE8YJMvfwE0qCJGjC/PPbqpO5b1ibYAk1wRPmL/cJPWFcMPeNE0qCJGiCJdQET8jKlpUtK9esXLNyzco1K9esXLNyzco1K9esXLOyZ2XPyp6VPSt7Vvas7FnZs7JnZc/KLSu3rNyycsvKLSu3rNyycsvKLSu3rNyzcs/KPSv3rNyzcs/KPSv3rNyzcs/KIyuPrDyy8sjKIyuPrDyy8sjKIyuPq7IeR0JJkARNsISa4AktoSdk5ZKVS1YuWblk5ZKVS1YuWblk5ZKVS1aWrCxZWbKyZGXJypKVJStLVpasLFlZs7JmZc3KmpU1K2tW1qycfVCzD2r2Qc0+qNkHNfugZh/U7IOafVCzD2r2Qc0+qNkHNfugZh/U7IOafVCzD2r2Qc0+qNkHNfugZh/U7IOafVCzD2r2Qc0+qNkHNfugZh/U7IOafVCzD2r2Qc0+qNkHNfugZh/U7IOafVCzD2r2Qc0+qNkHNfugZh/U7IOafVCzD2r2QY2ONiZIgiZYQk3whJbQE8YJFh0toCRIgiZYQk3whJbQE7JyycolK5esXLJyycolK5esXLJyycolK0tWlqwsWVmysmRlycqSlSUrS1aWrKxZWbOyZmXNypqVNStrVtasrFlZs7JlZcvKlpUtK1tWtqxsWdmysmVly8o1K9esXLNyzco1K9esXLNyzco1K9es7FnZs7JnZc/KnpU9K3tW9qzsWdmzcsvKLSu3rNyycsvKLSu3rNyycsvKLSv3rNyzcs/KPSv3rNyzcs/KPSv3rNyz8sjK2Qct+6BlH7Tsg5Z90LIPWvZByz5o2Qdr9sGafbBmH6zZB2v2wZp9sGYfrNkHa/bBmn2wZh+s2Qdr9sGafbBmH6zZB+vsKdUn3CpXmXCrXG+nc3X2i3oLojp3Y9cJkqAJllATPKEl9IRxwdyNT8jKNSvXrDx3Y5/2uRuf4AktoSeMC+ZufEJJkARNyMpz12rHhJ4wLpi7TZtrY+42bbZn7jYntISeMC6Yu80JJUESNMESsvLIyiMrj6w8rsp+HAklQRI0wRJqgie0hJ6QlUtWLlm5ZOW52zSbYAk1wRNaQk8YF8zoPqEkSEJWlqwsWXnmc7tdJvtM4+YT5i/3CZZQEzyhJfSEccFM4xNKgiRkZcvKlpUtK1tWtqxsWblm5ZqVa1auWblm5ZqVa1auWblm5ZqVPSt7Vvas7FnZs7JnZc/KnpU9K3tWbll5pnEbEyRBEyyhJnhCS+gJ44KZxidk5Z6Ve1ae3aofE2qCJ9zq9Nt1t88u02XC7a/63A9nlzmhJnhCS+gJ44Q2u8wJJUESNMESasKsbBNaQk8YF8wuc0JJkARNsISakJVLVi5ZeXaZftvV2+wyJ5QESdAES5h1bkHd5plM7xNufzXKBEnQBEuoCZ7QEnrCuGD2nROysmVly8qz74xjQk3whJbQE8YFs6eMucJnvxhzJcx+cUJLmH9VJ4wLZr84oSRIgiZYQk3whJaQlT0rz34x5sqc/eIESZiVxwRLmANux1yM2TFuI4ST5mDeMZeo9UUjaXaO2yjhpLJojugdc0vO/nEbMZw0x/SO6eh1kS9qi/qikRRDoCeVRbJIFy3HWI6xHGM5xnKMdPQY8Yxx1xjgLGXS/L0yR29nDzlpdpGLZlvmAGifneQiXWSL6qKoV+docPztHAKO0c85INpj+PMkW1QX+aK2qC8aSXosCkefJIt0UTjmkmtd5IvaoumYw4999p2T7Fh0neb0PIHqeQLV4wRKJtQET2gJPWFcUKP0XPm1LJJFusgW1UW+qC3qi0aSL4cvhy+HL4cvhy+HL4cvhy+HL0dbjrYcbTnacrTlaMvRlqMtR1uOthx9Ofpy9OXoy9GXoy9HX46+HH05+nKM5RjLMZZjLMdYjrEcYznGcozlGOkYx7GoLJJFusgW1UW+qC3qi5ajLEdZjrIcZTnKcpTlKMtRlqMsR1kOWQ5ZDlkOWQ5ZDlkOWQ5ZDlkOWQ5dDl0OXQ5dDl0OXQ5dDl0OXQ5dDlsOWw5bDlsOC8e8FWV1kS9qSWdPDoq/0Ek1afbGOn+W66dcP6NlcUNrJJ29KqgskkW6yBbVRb6oLVqOthx9Ofpy9OXoy9GXoy9HX46+HH05+nKM5RjLMZZjLMdYjrEcYznGcozlGOm4HcUPsIACKmhgBR1sYAexFWwFW8FWsBVsBVvBVrAVbAWbYBNsgk2wCTbBJtgEm2ATbIpNsSk2xabYFJtiU2yKTbEZNsNm2AybYTNshs2wGTbDVrFVbBVbxVaxVWwVW8VWsVVsjs2xOTbH5tgcm2M7j8A9sINjYYSEHoECKjgVcSv0iKC40MGpiDujR2TFhWNhpMWFBRRQQQMr6CC2jq1jG9gGtoFtYBvYBraBbWAb2MaynRMFLiyggAoaWEEHG9hBbAVbwVawFWwFW8FWsBVsBVvBJtgEm2ATbIJNsAk2wSbYBJtiU2yKTbEpNsWm2BSbYlNshs2wGTbDZtgMm2EzbIbNsFVsFVvFVrFVbBVbxVaxVWwVm2NzbI7NsTk2x+bYHJtjc2wNW8PWsDVsDVvD1rCRJYUsKWRJIUsKWVLIkkKWFLKkkCWFLClkSSFLCllSyJJClhSypJAlhSwpZEkhSwpZUsiSQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlcmaJBXZwLDyzxAMLKGDYeqCBMQGvBDrYwA6OhZEldk6UK2BM9Iv2RpbEtKmYNpMYthroYAPDFvP3IktOjCy5MGwjUEAFDayggw3s4EjUcwLjiQUUUEEDK7hsMZPmdgwLjHmMJXD+WT0nE1bQwQbORlYLHAsjFC4soIBhq4Fha4EVdLCB0+bR3ggFP+c3TptH3QiFC6fNPXDa5r3BEnNsEqetRbEIhXYWawujx85bZiUmx5QW7Y0ee2L02AujWNiiv7Vob/S3E6O/XVhAARU0sIIONhCbY2vYGraGrWFr2Bq2hq1ha9gato6tY+vYOraOrWPr2Dq2jq1jG9gGtoFtYBvYBraBbWAb2MayxeyaxAIKqKCBFXSwgR3EVrAVbHHsnrf3Ssy7STSwgg42sIPT1mNmb3TTCwuouSvHFJzECjrYwA6OhdE3LyyggNgUm2JTbIpNsSk2w2bYDJthM2yGzbAZNsNm2Cq2iq1iq9gqNqIipvAkYqvYKjbH5tgcm2NzbI7NsTk2x+bYGraGrWFr2Bq2hq1ha9gatoatY+vYOraOLQJk3l8tMfkn0cFp67GvR4BcOBZGgIyYpR4BcmHMxD8CFTQw5uNHF4kAubCBHRyJMTUosYACKmhgBR1sYAexFWwFW8FWsBVsBVvBVrAVbAWbYBNsgk2wCTbBJtgEm2ATbIpNsSk2xabYFJtiU2yKTbEZNsNm2AybYTNshs2wGTbDVrFVbBVbxVaxVWwVW8VWsVVsjs2xOTbH5tgcm2NzbI7NsTVsDVvD1rA1bA1bw9awNWwNW8fWsXVsHVvH1rF1bB1bx9axDWwD28A2sA1sZEklSypZUsmSSpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJEljSxpZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJEljSxpZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJEljSxpZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJzyuCcaFnOOYMXjoVnltTAAobtfGpVQQPDNgIdbGAHR2I/s+TEAgqooIEVdLCBHcRWsM3UkCOerJ35IHPO5g3bRAns4Fg48yGxTLRAARU0sIJxvRltiHy4sINhm9ebMSsxsYACKmhgBR1sYAexGTbDZtgMm2EzbIbNsBk2w1axVWwVW8VWsVVsFVvFFo+Ez1m0pZ8PhQeej4WfWEABFZy2ErtGPCB+oYPTVmKHicfELxwLZz4kTluJHWbmQ6KCBkbd2QtjkqLEawJilmKigFEh2tsNrGC0N54q7w3s4Fg4wharb4QtdsTZ5yWeyY8Zi4kGTls86h+TFhMb2MGRGBMXEwsooIIGVtDBBobtCBwLywEWUEAFDayggw3EVrBFPsQ7CmI2Y6KAChpYQQcb2MGxULGdb2+wQAEVdDAqzL0kJi3ebp4GFlBABaO9PbCCDjawg2Nh9PkLCyiggtgqtoqtYqvYKrbo8/EOh5glKTF5KSZKJk6b1kADK+hgAzs4bXEfMiZZJhZQQAUNrKCDDewgto4t8iFeHxETLhMVDFush8iHC6ftfCVE5MOFHZy26w0RB1jAabNoQ+TDhQZW0MEGdnBcKDEDM7GAAipoYAUdbGAHsRVsBVvBVrBFPsTLCmIGpswboBIzMBMb2MGxMPLhwgIKqKCB2ASbYBNsgk2xKTbFptgUm2JTbIpNsSk2w2bYDJthM2yGzbAZNsNm2Cq2iq1iq9gqtootsmTeuJaYgZkYNgkcCyNLLixg2GLXiCypsWtEllxYQQcb2MGxMLKkjsACZphLzMBMrOBUeCxFBMiFUzGfLZGYgXlhBMiFU+FRIQLkQgWnzWtgBR1sYAfHwgiQCwsooILYRp4QScy1TIy6c63HXMvEAgqooIEVjKXogQ3sYNjmBoi5lokFDFsLVNDAOCmzQAcb2MGxUA6wgAIqaOCsOycnyPmypwvHwgiFC2fdVgIFVNDAOPE+0cEGdnAsPC8qTiyggHHjTwMdbGAHx8LzFuqJBRRQQQOxVWwVW8VWsTk2x+bYHJtjc2yOzbE5NsfWsDVsDVvD1rA1bA1bw9awNWwdW8fWsXVsHVvH1rF1bB1bxzawDWwD28A2sA1sA9vANrCNZTvnT15YQAEVNLCCDjawg9gKtoKtYCvYCraCrWAr2Aq2gk1yDpGc8ycvFDD68YkGVnD24zm3Q+RMjRM7GKkxU07O1DixgAIqaGAFHWxgB7EZNsNm2AybYTNshs2wGTbDVrFVbBVbxVaxVWwVW8VWsVVsjs2xOTbH5tgcm2NzbI7NsTVsDVvD1rA1bA1bw9awNWwNW8fWsXVsHVvH1rF1bB1bx9axDWwD28A2sA1sA9vANrANbGPZYv5kYgEFVNDACjrYwA5iK9gKtoKtYCvYCraCrWAr2Ao2wSbYBJtgE2yCTbAJNsFGlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmRJJUsqWVLJkkqWVLKkkiWVLKlkSSVLKllSyZJKllSypJIllSypZEklSypZUsmSSpZUsqSSJZUsqWRJJUsqWVLJkkqWVLKkkiWVLKlkSSVLKllSyZJKllSypJIllSypZEklSypZUsmSSpZUsqSSJZUsqWRJJUtimqjMt2lJTBNNLOC0zcn7EtNEE6dtvv1KYppoooPT1mtgB8M2B6FimmhiAcPWAhUMmwdW0MGwxQJFllw4bXMCtsQ00cRpG9HIyJILFZy2Ee2NLLnQwQZ2cCyMLLmwgAIqiK1j69g6to6tY4ssGbEeIksuFFDBsPXACjrYwA7ebDrnNEhME00soIAKGlgnaqCDDezgWFgOsIACKmggtoKthM0COzgWStg8sIDTVmIpZpbofM+UxDTRxAo62MAOjoUzSxILKCA2xabYFJtiU2yKzbAZNsNm2AybYTNshs2wGbaKrWKr2Cq2iq1iq9gqthq22Cx1LPSwtcACCqjgtM3JCRLTRFVi15hZktjADo6F51v+TyzgtMVNlpgmmjgH7mo0PQZcL2xgB8fCGHC9sIACKmggto6tY+vYOraBbWAb2Aa2gW1gG9gGtoFtLNs5N/TCAgqooIEVdLCBHcRWsBVsBVvBVrAVbAVbwVawFWyCTbAJNsEm2ASbYBNsgk2wKTbFptgUW8wNnQ+6yjk39EIHY7fvgR0cC2NuaNzJPOeGXihg7PYj0MAKTtt8wlbOuaEXdnAsjJs3FxZQQAUNrCC2iq1iq9gcm2NzbI7NsTk2x+bYHJtja9gatoatYWvYGraGrWFr2Bq2jq1j69g6to6tY+vYOraOrWMb2Aa2gW1gG9gGtoFtYBvYxrKdc0MvLKCAChpYQQcb2EFsBVvBVrAVbAVbwVawFWwFW8Em2ASbYBNsgk2wCTbBJtgEm2JTbIpNsSk2xabYFJtiU2yGzbAZNsNm2AwbWdLJkk6WdLKkkyWdLOlkSSdLOlnSyZJOlnSypJMlnSzpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLOlkSSdLOlnSyZJOlnSypJMlnSzpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLBlkySBLBlkyyJJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmSQJYMsGWTJIEsGWTLIkkGWDLJkkCWDLBlkySBLBlkyyJJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmSQJYMsGWTJIEsGWTLIkkGWDLJkkCWDLBlkySBLBlkyyJJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmSQJYMsGWTJIEsGWTLIkkGWDLJkkCWDLBlkySBLBlkyyJJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmSQJYMsGWTJIEsGWTLIkkGWDLJkkCWDLBlkySBLBlkyVpbosbJEj5Uleqws0WNliR4rS/RYWaLHyhI9VpbosbJEjwNbwVawFWwFW8FWsBVsBVvBVrAJNsEm2ASbYBNsgk2wCTbBptgUWwyS6IkKGhg2CXRwXuPML/VpzE9NHAvPLPHAAsay1UAFDYzpOSE+J6idGDYN7OBYGIMkGhVikORCARU0sIIONrCDY6Fjc2yOzbE5Nsfm2BybY3NsDVvD1rA1bA1bwxYfQdTYAPHRwzlTXWP6qc4XeGlMP000sIKzvRbbYuZDYgfHwpkPidNmscPMfEhUcNosGjnzIdHBBnZwJMak1MQCCqiggRV0sIEdxFawFWwFWwyizhn7GpNSEyvoYAM7OBbGIOqFBRQQm2ATbIJNsAk2wabYFJtiU2yKTbEpNsWm2BSbYTNshs2wGTbDZtgMm2EzbBVbxVaxVWwVW8VWsVVsFVvF5tgcm2NzbI7NsTk2x+bYHFvD1rA1bA1bw9awNWwNW8PWsHVsHVvH1rF1bB1bx9axdWwd28A2sA1sA9vANrANbAPbwDaWTY4DLKCAChpYQQcb2EFsBVvBVrCRJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJXJmiQeGrQU62MAOjkQ9s+TEAgqooIEVnLb5mJTGBNbEDk5bnee/MYE1sYDTNu8oaExgTTSwgg42sINjYWTJhQXEJtgEm2ATbIJNsAk2xabYFJtiU2yKTbEpNsWm2AybYTNshs2wGTbDZtgMm2Gr2Cq2iq1iq9gqtoqtYqvYKjbH5tgcm2NzbI7NsTk2x+bYGraGrWFr2Bq2hq1ha9gatoatY+vYOraOrWPr2Dq2jq1j69gGtoFtYBvYBraBbWAbqx/HTFSdjztqzERNrKCDDezgWHiGwokFFBBbwVawFWwFW8FWsAk2wSbYBJtgE2yCTbAJNsGm2BSbYlNsik2xKTbFptgUm2EzbIbNsBk2w2bYDJthM2wVW8VWsVVsFVvFVrFVbBVbxebYHJtjc2yOzbE5Nsfm2Bxbw9awNWwNW8PWsDVsDVvD1rB1bB1bx9axdWwdW8fWsXVsHdvANrANbAPbwDawDWxxgjHnE2jMRE0ciTETNbGAAio4bfMBZY2ZqIkOhq0HdnAsPC9WNLCAAipoYAUdbGAHx0LBJtgEm2ATbIJNsAk2wSbYFJtiU2yKTbEpNsWm2BSbYjNshs2wGTbDZtgMm2EzbIatYqvYKraKrWKr2Cq2iq1iq9gcm2NzbI7NsTk2x+bYHJtja9gatoatYWvYGraGrWFr2Bq2jq1j69g6to6tY+vYOraOrWMb2Aa2gW1gG9gGtoFtYBvYxrKdM1EvLKCACkaWSGAFHZy2GO4/Z6JeOBZGlszn/fWciXqhgNM236mu50zUCyvoYAM7OBZGllxYQAGxCTbBJtgEm2ATbIotsmRODddzHmmPtWMsvLHwxsJH97/QwArO5sw53npOHr2wg7M5c5a4npNHLyyggAoaWEEHG9hBbI4tun+P9kb3v1BBAyvoYNhi9UX3v3AsjO5/YQEFVNDACjqIrWGL7j9fK64xjzSxgNM2YsNG92+x8NH9L6zgtI3oQ9H9L+xg2OJ3o/tfWEABFTSwgg42sIPLFvNIEwsooIIGVtDBBnYQW8FWsBVsBVvBVrAVbAVbwVawCTbBJtgEm2ATbIJNsAk2wabYFFucSsynBjTmkSaGrQVW0MEG3mw2X+GhMY/U5ix8jXmkiQUUUEEDK+gTLbCBEduzB7S6RpPaeQFyooIGVtDBqBtLXDs4FnosRQ+cS1FiMWdqJCpoYAUdbGAHx8KZGonYGrYWtlgPzcAKOtjADo6F/QDXOEFjVKIxKhEzRq2cWEEHG9jBsXAcYAEFVBDbwDawDWwD21i2mDGaWEABFQxbC6yggw0MWw8cC8sBFjDuYcefRWpcaGAFHWxgB8fCSI0LYylGoIEVdHAuxXw3ocbc0MSxcOZDYsz8LoECKmhgBR1sYF8YSSAnCqiggRV0MNo7D2oxs9PmUxkaMzttPoqhMbMzsYJRoQY2MNZD7ATR50+MPn9htDdWdfT5CxU0sIIONjBssWtEnz8x+vyFBRRQwbnWzyWO3n2uh+jdF7J2ondLbPleQAEVNHAuRUyuiTmciQ3s4LRp2KJ3X1jAadPYANG7LzQwbLEtondf2MCwxZaP3h0TRWIOp0UPiDmcFvNAYg5nooJRdwQ2sINjYfTjmB0S8zLPnSvmZSZW0MG+MKZKzWeY9Jx2eaGCcxNG7pzTLi90sIEdHAtjqtSFBRRwNnJ+xU5jgmViAzs4Fz6mu8QEy8QCChhLEX8Wk6IurKCDDezgWBgTLC8s4K1unG/GTMqLYhlObGAHx8LounGXLCZSJgqooIEVvNnGSW1RXzSSZre9qCySRbrIFtVF0fbYHaLDnhgd9sICRttju0aHvdDACt7aHtcnMU/yor5oJM3OelFZJIt0Uaz56GbRJS/s4LjQYipkYgFvVedVpsVMyItsUV3ki9qi2fIjaCTNDnpRWSSLdFG0vAdGG6OiHGAB599LkC6yRXWRL2qL+qKRNPvnRWXRcuhy6HLocuhy6HLocuhyRK+ssahx8LzQwArOdTEPvxZTFRM7OBbOXplYQAEVDFs0Jw60FzrYwLBp4FgYvfXCAsraNGdvPdHACjrYwA6y9RtbPw6p8yuSFpMSbT47ZzEpMdHBBsZSeOBYGP32wgLGOos9cPZbP8kW1UWhimbFUfbCDo6FcZS9sIACKmhgBbFFl/bYPNGlLxyJMXsxsYACKmjgtM0JsxazF22++tJi9mJiB8M210PMXkwsoIAKGlhBBxvYQWwRBfN1lhazFxMFVNDACjrYwGlrFjgWxpn1hQUUUEEDKxi2WGdxIL+wg2NhHMgvLKCACs4wDsNMjIt8UVvUF42kiIUWqzMCIGI75iImzj/3oL5oJM3ef1FZJIt0kS2qi+aCR9THZMPbDbSJ0cMvLKCAChpYwdn4iNiYbJjYwbEw+v18C4bFZMNEARU0sIIOhi1Wa3T9Hv0nuv6J0fUvLKCACtraBIMNM9gw0fUv7OBIjMmGiQUU8FZ3nvFazCq8qC2KRWiBY2H08B5/Hj38QgHnIsyxS4s5hYkVnIswRzQt5hQmdnAsjB5+4bTN0S6LOYWJChpYQQcb2BdGX57jZXa+6NKC4ldjgaN7XjgWRvec79uwmBCYGA2L1RDd80IDbw2rR6yG2UETG9jBsXAe0RMLKBNLoIIGVtDBBvZcYI+ysaJdQAUNjLKxj7iDDexgPB0y6XxgKagskkW6yBbVRZ40+0ptseFmX0k0cDYuYjEm0yU2sIMjMSbTJRZQQAUNrOCyxQS5GpkaU+Fq9LaY/5b/dTYnki/mv9XIrZj/duHc7xMLKKCCBs7mRLDF/LfEBoZNA8M2N37Mf6uROjH/rc739FjMf7uargqyQLNn1DhdiOltF86ekVhAARU0sIIONjBs0fToGR5Nj55xYQEFDFssW/SMCyvoYAM7OBb6AUaxWFGx58epUExOq3FyEpPTqseKagUUUEEHY5+MXaMfYOxRsY17bIBYJT1+N1bJOMACxiaM9XD2lhMNrKvu2VvO/9rADo7EeN/hucTxvsNEARVcyxbzyc4FivlkiWuJYyZWPeJ3Y/c8MXbPCws4bSX+LHbPCw2s4GzDHJywmHNV5wuCLOZcJRYw6mqgggZW0MEGdjBssc5iT72wgAIqaGAFHQxFDRwLY/e8sIACKmhgBR1sIDbH1rDFDh4BHROtEhU0sIIONrCDY2F0hgvZWF1ABQ2soC+M3lJi94zecqGACkaxHhiNjL0v+sWFs5FzxN1ixlTirDtHuy1mTJ2/GzOmEg2soIMN7OBYWA6wgKvpMU0qsYIOtly2mBB1VRCKxRHnXKA44lxoa9mEpgtNF5ouNF1oumJTbMqKUlaUsqKUpmsDOzgWnr07ls0oZhSLfnwuUPTjC9taNqPpRtMrTa80vdL0iq1iq6yoyoqqrKiKwlE4CkfhKByFo4h+HKfxMckpsYNjYfTjCwsoYGx5CTSwgr4wut68x2sxLykxThNjW/S2MHrh+QvRCy8UUBNjLkyVE6PpM3diLkydN3ks5sIkRtNboIIGVtDBBnZwLIw96sICYjNshs2wnftZDxwLY9+ZN24sJsskGjgrzLs1FpNlEmeFeVfFYlpMYgEFnHXn7RyLaTF1PtNsMS0m0cEGdjBssQFih7mwgGGLzRI7zPlnDVvD1rA1bA1bBP+JEfwaGzYiXmNNxn52YdSNNRn72YUN7OBYGHvfhQWMpYi1HnvfhQZOm8UGiDOmsw1xZLiwgyMxJsAkFlDAqZi3cyxmvdR5t8ZifkviWBjBf2EBZ7F5/8NifkuigRV0sIEdDNvcADGppc77GBaTWuq8TWExqSUxisVSRPDHkH1MX0mMYnP1xfSVxAIKqKCBFXRw2mJ8PKavJI6F0WNjoDumr1zNiR57oYIGVtDBsMWqjiPDhWGLFRVHhgsLKKCCBlZw2mJIOya1JHYwbLEtos+fbYg+f6GAChpYwbDFJow+f2HYYmtGnz8x+vyFBRRQQQPDFqsv+vyFDQxbbM3o82cbos9fWEABFTSwgixbZ9kiCTz2h0iCEyMJLiyggAoaGNeQsZ9FEvjx73//4adf/vaXP//j57/9+qd//PbXv/70x3+t//D3n/74H//66f/+/Ntff/3HT3/89Z+//PKHn/6/P//yz/ilv//fn3+Nn//482+3/3sr+tdf//v281bwf37+5a+T/v0H/vp4/KdlvtPu+vMyX6S2SozxTY3yuEbMm4gKt1Pw9fetfvP38vjv4/HC+Hu9/VH+fflQYLsQfR5UzoWYb7h4tBC2qdFqrsbb0K7QDPm2RN2shzLPH88VcRuxXyX82QK3ofCjZiP8NrBJK7R8U6Rt1qasVsxHmR+0YltgjsyeBfR4tBjj910PbW3P27mRPlwPZbNbzveVXkXm+0ofNGNXocTdrbMZtyu0VeE2WvttDX1co/ZshB/1roI8XcHnafVZQcZrFSx37dsp5eMKuzUR47PXmhB5vCa2a1MGNfRxjb6pMeK1PGeRcbtJ88rOVefLwq+d67Z3Pdy5ZBM58+NtuXPdbu/cLcy3DZHtDiqydlCTB4uybUV8VfyscGvR41bsasTZ8lmj2uMa21Xa6tq0t5Px4/Eqre8G177CM8kl7XeNrm9XRX+4KnZF2qHZjBuPx/mn211Uj7WL6t0uWo8Xa4z3a9x1t8/VqGXV8ONxjc0Rfr7kNWv0u2PrbfT52xq7Q3x8Gu/cP+RuP/+uhu/2UmU/r/JiDddVw/uLNSrt8PF+jWaPa+y2yxgZ6fPlbg9r2CZKvRwZpV7uji2f2rajZ5jexmDltRrKufDtFtRr66OvfWy+gvTx+ti04zbCm6cdtzHs/tI6rbZOPG44XtsubbXjNrYz3l8W3Wzbp/PjcQbVXY1jrMN1OThQfjiNqrsjfnxi5Sxxf4D6rhmbq6UWN+Cixu1Qc3f20r8tobsLrpIl5hsT7i65vi2x2Unnay5XpxV7WGJ3lCuHrdPr2wqtDxdlt0bjoYhrjdb+eI1uazS2StvsHM8fsdvjw/54ew/z3aXw4IKjjNs15MOG+HaN+FhrpN+fE367eV3ePbvdLkvjfK60+wj6blk2e6ofK0699Mcbxnex7jX39jkQ+bjG5lA5imWnu124cOqgH/Yy35ye3u6B5CnM7cbHXY3nd7FCf7ll4sNdbGzPo1bPLy/to7eRYzqLyOMrsLbZR8fqtOW4H68Zn9isxzoqzFnDr+0aY11N3lBeqxFvxbjOGmp/qcbtinodrcXqa12lDFtDDe1xO9puF60cravW12q4Zr+/3bA8Xqzh1Ggv1qir29/QXqvBVUft8vhKbt9hrClB2MuLVSoDMLebC+3FKs3X2NxtYP3xHt/ru6NiuwrPjYptKzw1KrZdF7cNuoaSupbH26WP3XlQOzgPanfnYx9GXI93D7Y/aAV7xxwMf9SKzSF/HMPXIe7xyPGuQlnLcTte9ldOGnq84uLaJlZf7Cu9cluk181pw/B3R7T2FZ4ai+/vjmh9Yl2M9vIa9VXFjxeT8PaXnSry+BgVAwLvbZgflHhmy5TDft9N883q0P7ypql3VcaLVQYHhnGobzZNf/t+ya7EkzdMtiXePzYMWc24cR+be1jy/k0s2R73i3Pcl/FaEecWa7s/KftcEQbHm/tLu/y4y/dhmzPM3QXuF10m3w3nyN3G+e4y+ekhIX2tRryJ5axhWl6rcX8bqMpLNeZ3Jtal4f1Ayocatk20tb8f96fc8vSdfDnaKiHH4zv5Rfb3cdhTS7u7Wv+QIuK7lnTufNxfrn9XpO12kMo9vrsY+Vhkt1LHumSXo+zWyOYEsa1te7sCeHTZX2S3YdpYo0rfXDh8bIaW91fHtsjtYnldpN6actf5j08UiYk91xXmN1f+nynSZLWkfXP8/ljk7TunPyjx1OmMvn3v9AdrY+2ot4tl36yNsTt2W10H72+u/D8UsWPXknUOUY5HA9P7ZtQ1l8draS8uS12Dhn7bVV4uss5m6nh1rdY1JuN+2It7e6+MX+6KmP/ORZ6e2mPvn6va++eq9va56n5tPDu9Z79Kn5zfs7s19ewEn/2Bpq8bS/Njlpvj3bYIN2PG7mhV/fdenGHc7L+ba/R9SzZ7SXcGVu4iQD4k2u7ewXwH/7ptqPfB+pkigxkDo+njItsTzecOePsSTx3wXN8+4O3Wxny/y7oD8c0I88e18f7h398//Hv7fddGdIMsMTZrY7y/Nsbba2N3d+rJtbHr9vM7LasVd2Ohn0qx+bmN1WfvFuW7Is1+5xSbb33Olri2FxenrRug8/VyLxYZ68R9vnbr1SJrUGW+pWuzYscXXGX24wuuMvtXXFZt14nb6np+P+L1cZ303eSUNUysdztaP56v0NYd2X53qPt+dXzF5X//isv//gWX/2V/E3Kdu9/Pd5b2oR27TPQia9v6/cH/QwbsblM9uW23zejrXOj+JtV3zej7BxTWLL1vL/8/U+R2ZFg37UU2K8TePljt27FydT5Dv2mH/85Fnr6mGu9fU433r6nG+9dU4yuuqcYXXFPJ8RXXVLsI8TVM3b45ZLYP7diFajfG3O8mcrb+oYa/f5tajvbuXeb9sgzlLkSXx8uyO/of67quHM5KVW+fKdK4MXO0Wh8uzb7I3Wyq1sdrRfpYj9Ad4zheKzLKoIjVVzaOHAc3Ee4GvD5unPI71yjHIWybwx5P+vtRGWdHOe7676fLsJGPuxHrT5aJtxpfZe4v074rs3vsaLQsMu5uJ3y36+9KPN1/frA4drc49eWVWwb7rdxNBfpkGbnb1NLaZuX+/mWEi1gputtKuyLMkRK5y+vPFVGeibjd/321CPcWtT9uyfY42NbU1XFX4rvj4H4UfN2grKPeXSbZ+FBkey+dyfPfHAblQw3dnqKswK5VH9fYnMG2tSz9/l580+dL9HWP4zZIuSnx7JK0zZLI9i7pWqPj7sGK72rszl6H1rVp2/FiO1as3e7W9oc1drev4gM+17Bif7xKbftU/5pQbN9M9C4fEsR2s6S4a6z3t3y/L6K/c5HSjruHCe4vx2+jjh/KbJPVVibO51fqpsy2Nbp2+hvXtimze1Tf12jY/cN35eNm3s355lkgt/sn575rx+6RAJ7wvH+g8bt2HLtr8nVJ7rYJgd1cqWPwkNcxXup8t0PemqNw/1z3xxrbx6ue63zbx6sGY7/j/lnEj1ulbh9v4GHV26p5tci6dpzvRd8UaW/vH1Xf3j9+cHK15jjd2PzxWdFuBtqTz6nvSzz1oLrL71riuXsUP1qlwjWF3J0BfLdKf3DVp3J31WcvXjoa0Tz84aXj7i7W09efX3ArbDsAtZ48cddXx7CYsGGPS+xu/Dw3ki5N3h9Jl6bvj6TLbmG+5hYHh//52dWHtzikbW8MVBbnm/l4H99UsdvJxlocG/fvTdLxfJHK47PV7lvyqSL94KS3+2tFXNaT8347L31cpL89L2DfjrKmfdxGj19dGJV1UqW6KdLt912Y+NRfntyNTTv8921HXSVuwaabdvS327Ev8dRBcxxvHzS3a8PXY1Lej02n2z0p9SVFnr1jI8PePc7s2/HkvZIfLMyT90pGe/9eyT7flSv4b+6mfcz3Md4e4NHjeHuAJyaavDfAsy3x3ADP80uyGeDZrtHnBnh0d2vh2QGefTueGuDR3S2s564xdfeM07MDPLo76X52bEbL8RWjIbp7wdxzoyHbljy/OPr+kIoWe/eSebuPPHnJPMb7QyrbGs8NqejuvX9P7u5lvD+kortbTs8OqfygyHNDKiry9v5R+rv7x3Z+83MXiPoVT1rpVzxppV/xpNV+frM0JmuPzYzebZG2zqnmp2hfLDLI9+PVIvO7Xlnk26lS3xbR3aDqlxR59lxVd7eanptdtC3x3OyifYmnZhft18aTZ8w/WKXPnTGrjvfPmLdPJwyelRa5v636YQfZ3bD6ihqlr2W53fGWTZHtzZ3B+xLuO57UD0V2x/+n3uixb8ewNdw9vnlupH6mSGcezDdjVZ8p0oUHUO/HQ74r0r/gQLG9U/XsgWL7JsAnDxTbdSIxVyHnRYzH66RuR1frepzmxv6o8/2oCA/Duxd7WGT7uNR6e+btDHuzs+1uNo01BljK/dt0+if2tXqsNzPXY4zXdlgbPVtSyzePTXxcmq/YYetX7LD+JTvs9hEBuZvII68FrJQ1b/I24LtJ6d2DV0+vWLevWLH1d1+xzEuSsVmx2xtXta2m3NgfduIfFOmcVvSHI6S6fT8gg9/i9+9f+rg4bXeNFB+YvC5O/O6I8WGOlLby/kDL7v7Vk1eeu7tXTw+0NPuCkYm2f03pk5NgdDe++fwkmB+05ulhn9bfHfbZDT/NV2hnO1Tvxlo/fD5Ed49heSvrwmCUx7P6tJf3D4A/6sT1rhPro07c9QuSoL/9gOy+Cz85Ct79/VHw3WNYT46C70o8OQr+9JI8HgX/QSg+Nwo+ytuj4Nve/3Sgja8Yah3vD7U2eXcobbtdnhxq3dd4cqh1vD/UOr5gqNWOLxhq/UGR54Za7Xh/qHW8PdT6o6u0NTNhXqU9erzGjvp7X+rFR/+uFfLNQ9j1Q0t2k0ZsDXFWuztuf5w3ti+iXKbV4psim7312Rdz2+7GkR/rHM+P+5mFn2nHuoK+dZqyacdmL+ljDRv14WNTZDeBta5Hfe/e9ilenr+SL0UZfLpd8/mjcyrbTS9cXwG7e+TjM8O9z82i+8FY7VOz6Oz9uXz29ly+/fv91jWz1LsnVz71jkAeAr2hvVajc9ndh79U43YRtWYCHfJ4WYrsdvInX1a4LeJt7aK3MYnyaOh7W6KvccDbOm2vlVgv5vHeHr5Vc7dVGoOR7dU3SH5To75Yo1BDNm+Q1LdnAf6gxDMTxWz3SNIXlHjyBcHb9bmGh6X5eHGb8HmU+2+7fa7GXTterdHXEUV6fbXGOkxva+xfDvxcnh9v5/n+TenrEux2AvPau9Yr5z310SPf2zfoP7Ui9u/gf2Y97L/RsE5o6zevavzUtyIGNcZ4rQbf/ftm9PVzNe5eBmovfjujrSm/tcmr7VhjP7X1V9eHsyybL0Juv4ti63skVo8Xa/DRC6teXqyxotx89w2P/ed/7l7At7nK2D1HZf1Y15H3nzDU8e2V12548Lkrlf2iPHmhsrsl9fSFyvZE8KkLle2mbWv02Prm/fm2ux/19Lbd3Y96dtv+qCXPXcvutu9zX5nalnjycni/KM/uZeML9rLdvagv2Mt44t/6eBzKthtjrLKunOo3T6b0DzW21ytrfXi7f6dgf35ZhvLc0ebzKtbqFyyL/67LUo81XloPee3gUMu6KK5l1Bdr0I4iX1FjvFhj3UO+Dae9+CGysm661lJfXqeddWov1hirhpTHn6naf1/7braC3V8+fbiKe//5qR+UeOpa8v1Hn7Ylnnz0abc+ueEr6o+/NW7bm0/PvJp92wrjAxE2bNMKfT/Btk9OPZdg+6+3c8enSnm4LPsa671sUv3x+ti+o/rJr8iLvTuYtq3w1FjavsIzQ2nbpz+eGx3Qdy+Kv+BLxbuPU/X1+cQ+Ht8GrLubTbflXzdn/f4j5eVjO3ZH+c6jo/3+K9TfFdnN7F+v+JK7jw7d7sY8u0afPTnfPsG2zmdv1wh3L1/78PapXQnnQ073n+n6TIle+WJhfa0VY3VTOY7ySgk5hIlZpi+1gukDpfXXFqQNPp5WXlqQcvcl2zJea4WuwLgdVF8ssaYOFLv7IsZnShgfkjMpb7fixRLGRKzbyePDEnX3ZJS1Ubmkv/8y8PN7ONNsxl0zPl7y7b+Gx/tB758T+USJUZm+X9trJda34r95S+knSsjhTN2/v032iRJx2/s635LXWmGciNvdCMtnSlQ+klbvvi30qRK8t6PeXdp8qsTd3IkqL7aCU627x21ebcWrJfiYl5eXdvD5XMsqUV/bqL6G725H9hdbwRRu78fbC/JaCe08Nti7vViCcarjpY2qQ5m45Y9XZ90+O/F2/uoYfFthtNeWZL2L+Iav7eHl4AGB47XefqwbGLcSr/X2UjiXl+PFBXFKvL8gL5a4e/Lj/oblp0rUdaFafLxYglmW7Xh7QV4t0Xmx7njtWCRsVCn9xRIHJca7C/JqibuLs/uHg7/LnN3dpC/IHG8rMO4z3A59vsS6ntB2N+3+5RLtpRI8h6D3H5P/VIlGK+4ORp8pwY2X2zXya+uil7VF7t8u8GoJeW2j9jWwpf3uOdxPlVhn4Xo/pvSpEp0FuXvt3KdK3M23Hy9u1PWit9u13kutkFsfX7397n7rp0qsBRG5e/HdxxJ1+wiTrDPgIvePY/TnmzEI4PFSPxNdj/vcbjTIayXWHn5Df63EuqF3G5+vL5bgI9bmb5eor7bi7u7C8VoJZ12M8nYrPm7U/7z965//8vNvf/rlb3/58z9+/tuvf7/95b9nsd9+/vN//fLX61//55+//uXu//7j//+//D//9dvPv/zy8//+6f9++9tf/vrf//ztr7PS/H8/Hdc//uN2fdz+YC7+n3/4qcx/77ehHbuNjN/+XW//fhvYbWP+v/hlaeMPJt3mf7h+W26/fdh//ns29/8B"
355
+ "debug_symbols": "tb3djuy4kXZ9L33sAzEiGCR9K4OB4fF4Bg002oO2/QEfDN/7mwwpuHLXRnJnZVafdK3uropF/fCRRFHSv37677/+1z//908///o/f/v7T3/8j3/99F+//fzLLz//759++dtf/vyPn//26+2//uunY/6jl5/+qH/4qctPf/TbDz1/2Pmj/vTHfvvh5492/ug//bEct5/j/DluZYrcfpbrp1w/b6WK3X7a9bNeP/362a6f/fo5zp/lOBJKgiRogiXUBE9oCVfhUuZf1Qnzd3zC/J02oSeMC+RImPYxQRI0wRJqwq2yyISW0BPGBXoklARJ0ARLqAlZWbOyZmXNyjYrlwklQRI0wRJqwqysE1pCv6Bawvxfcx3WnjClt81e/EgoCVM6V69rgiVMaZ/gCbPyXHXeE26VdTas3SrrXK42983ZjCYJt8o6t06zhJrgCS2hJ4wL+pEwK89mzP1ep33u+TaXYu77Nu1zf7cpnXv8CeOCuc+fUBIkQRPmn881NnfwE8YJMvfwE0qCJGjC/PPbqpO5b1ibYAk1wRPmL/cJPWFcMPeNE0qCJGiCJdQET8jKlpUtK9esXLNyzco1K9esXLNyzco1K9esXLOyZ2XPyp6VPSt7Vvas7FnZs7JnZc/KLSu3rNyycsvKLSu3rNyycsvKLSu3rNyzcs/KPSv3rNyzcs/KPSv3rNyzcs/KIyuPrDyy8sjKIyuPrDyy8sjKIyuPq7IeR0JJkARNsISa4AktoSdk5ZKVS1YuWblk5ZKVS1YuWblk5ZKVS1aWrCxZWbKyZGXJypKVJStLVpasLFlZs7JmZc3KmpU1K2tW1qycfVCzD2r2Qc0+qNkHNfugZh/U7IOafVCzD2r2Qc0+qNkHNfugZh/U7IOafVCzD2r2Qc0+qNkHNfugZh/U7IOafVCzD2r2Qc0+qNkHNfugZh/U7IOafVCzD2r2Qc0+qNkHNfugZh/U7IOafVCzD2r2Qc0+qNkHNfugZh/U7IOafVCzD2r2QY2ONiZIgiZYQk3whJbQE8YJFh0toCRIgiZYQk3whJbQE7JyycolK5esXLJyycolK5esXLJyycolK0tWlqwsWVmysmRlycqSlSUrS1aWrKxZWbOyZmXNypqVNStrVtasrFlZs7JlZcvKlpUtK1tWtqxsWdmysmVly8o1K9esXLNyzco1K9esXLNyzco1K9es7FnZs7JnZc/KnpU9K3tW9qzsWdmzcsvKLSu3rNyycsvKLSu3rNyycsvKLSv3rNyzcs/KPSv3rNyzcs/KPSv3rNyz8sjK2Qct+6BlH7Tsg5Z90LIPWvZByz5o2Qdr9sGafbBmH6zZB2v2wZp9sGYfrNkHa/bBmn2wZh+s2Qdr9sGafbBmH6zZB+vsKdUn3CpXmXCrXG+nc3X2i3oLojp3Y9cJkqAJllATPKEl9IRxwdyNT8jKNSvXrDx3Y5/2uRuf4AktoSeMC+ZufEJJkARNyMpz12rHhJ4wLpi7TZtrY+42bbZn7jYntISeMC6Yu80JJUESNMESsvLIyiMrj6w8rsp+HAklQRI0wRJqgie0hJ6QlUtWLlm5ZOW52zSbYAk1wRNaQk8YF8zoPqEkSEJWlqwsWXnmc7tdJvtM4+YT5i/3CZZQEzyhJfSEccFM4xNKgiRkZcvKlpUtK1tWtqxsWblm5ZqVa1auWblm5ZqVa1auWblm5ZqVPSt7Vvas7FnZs7JnZc/KnpU9K3tWbll5pnEbEyRBEyyhJnhCS+gJ44KZxidk5Z6Ve1ae3aofE2qCJ9zq9Nt1t88u02XC7a/63A9nlzmhJnhCS+gJ44Q2u8wJJUESNMESasKsbBNaQk8YF8wuc0JJkARNsISakJVLVi5ZeXaZftvV2+wyJ5QESdAES5h1bkHd5plM7xNufzXKBEnQBEuoCZ7QEnrCuGD2nROysmVly8qz74xjQk3whJbQE8YFs6eMucJnvxhzJcx+cUJLmH9VJ4wLZr84oSRIgiZYQk3whJaQlT0rz34x5sqc/eIESZiVxwRLmANux1yM2TFuI4ST5mDeMZeo9UUjaXaO2yjhpLJojugdc0vO/nEbMZw0x/SO6eh1kS9qi/qikRRDoCeVRbJIFy3HWI6xHGM5xnKMdPQY8Yxx1xjgLGXS/L0yR29nDzlpdpGLZlvmAGifneQiXWSL6qKoV+docPztHAKO0c85INpj+PMkW1QX+aK2qC8aSXosCkefJIt0UTjmkmtd5IvaoumYw4999p2T7Fh0neb0PIHqeQLV4wRKJtQET2gJPWFcUKP0XPm1LJJFusgW1UW+qC3qi0aSL4cvhy+HL4cvhy+HL4cvhy+HL0dbjrYcbTnacrTlaMvRlqMtR1uOthx9Ofpy9OXoy9GXoy9HX46+HH05+nKM5RjLMZZjLMdYjrEcYznGcozlGOkYx7GoLJJFusgW1UW+qC3qi5ajLEdZjrIcZTnKcpTlKMtRlqMsR1kOWQ5ZDlkOWQ5ZDlkOWQ5ZDlkOWQ5dDl0OXQ5dDl0OXQ5dDl0OXQ5dDlsOWw5bDlsOC8e8FWV1kS9qSWdPDoq/0Ek1afbGOn+W66dcP6NlcUNrJJ29KqgskkW6yBbVRb6oLVqOthx9Ofpy9OXoy9GXoy9HX46+HH05+nKM5RjLMZZjLMdYjrEcYznGcozlGOm4HcUPsIACKmhgBR1sYAexFWwFW8FWsBVsBVvBVrAVbAWbYBNsgk2wCTbBJtgEm2ATbIpNsSk2xabYFJtiU2yKTbEZNsNm2AybYTNshs2wGTbDVrFVbBVbxVaxVWwVW8VWsVVsjs2xOTbH5tgcm2M7j8A9sINjYYSEHoECKjgVcSv0iKC40MGpiDujR2TFhWNhpMWFBRRQQQMr6CC2jq1jG9gGtoFtYBvYBraBbWAb2MaynRMFLiyggAoaWEEHG9hBbAVbwVawFWwFW8FWsBVsBVvBJtgEm2ATbIJNsAk2wSbYBJtiU2yKTbEpNsWm2BSbYlNshs2wGTbDZtgMm2EzbIbNsFVsFVvFVrFVbBVbxVaxVWwVm2NzbI7NsTk2x+bYHJtjc2wNW8PWsDVsDVvD1rCRJYUsKWRJIUsKWVLIkkKWFLKkkCWFLClkSSFLCllSyJJClhSypJAlhSwpZEkhSwpZUsiSQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlcmaJBXZwLDyzxAMLKGDYeqCBMQGvBDrYwA6OhZEldk6UK2BM9Iv2RpbEtKmYNpMYthroYAPDFvP3IktOjCy5MGwjUEAFDayggw3s4EjUcwLjiQUUUEEDK7hsMZPmdgwLjHmMJXD+WT0nE1bQwQbORlYLHAsjFC4soIBhq4Fha4EVdLCB0+bR3ggFP+c3TptH3QiFC6fNPXDa5r3BEnNsEqetRbEIhXYWawujx85bZiUmx5QW7Y0ee2L02AujWNiiv7Vob/S3E6O/XVhAARU0sIIONhCbY2vYGraGrWFr2Bq2hq1ha9gato6tY+vYOraOrWPr2Dq2jq1jG9gGtoFtYBvYBraBbWAb2MayxeyaxAIKqKCBFXSwgR3EVrAVbHHsnrf3Ssy7STSwgg42sIPT1mNmb3TTCwuouSvHFJzECjrYwA6OhdE3LyyggNgUm2JTbIpNsSk2w2bYDJthM2yGzbAZNsNm2Cq2iq1iq9gqNqIipvAkYqvYKjbH5tgcm2NzbI7NsTk2x+bYGraGrWFr2Bq2hq1ha9gatoatY+vYOraOLQJk3l8tMfkn0cFp67GvR4BcOBZGgIyYpR4BcmHMxD8CFTQw5uNHF4kAubCBHRyJMTUosYACKmhgBR1sYAexFWwFW8FWsBVsBVvBVrAVbAWbYBNsgk2wCTbBJtgEm2ATbIpNsSk2xabYFJtiU2yKTbEZNsNm2AybYTNshs2wGTbDVrFVbBVbxVaxVWwVW8VWsVVsjs2xOTbH5tgcm2NzbI7NsTVsDVvD1rA1bA1bw9awNWwNW8fWsXVsHVvH1rF1bB1bx9axDWwD28A2sA1sZEklSypZUsmSSpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJEljSxpZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJEljSxpZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJEljSxpZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJzyuCcaFnOOYMXjoVnltTAAobtfGpVQQPDNgIdbGAHR2I/s+TEAgqooIEVdLCBHcRWsM3UkCOerJ35IHPO5g3bRAns4Fg48yGxTLRAARU0sIJxvRltiHy4sINhm9ebMSsxsYACKmhgBR1sYAexGTbDZtgMm2EzbIbNsBk2w1axVWwVW8VWsVVsFVvFFo+Ez1m0pZ8PhQeej4WfWEABFZy2ErtGPCB+oYPTVmKHicfELxwLZz4kTluJHWbmQ6KCBkbd2QtjkqLEawJilmKigFEh2tsNrGC0N54q7w3s4Fg4wharb4QtdsTZ5yWeyY8Zi4kGTls86h+TFhMb2MGRGBMXEwsooIIGVtDBBobtCBwLywEWUEAFDayggw3EVrBFPsQ7CmI2Y6KAChpYQQcb2MGxULGdb2+wQAEVdDAqzL0kJi3ebp4GFlBABaO9PbCCDjawg2Nh9PkLCyiggtgqtoqtYqvYKrbo8/EOh5glKTF5KSZKJk6b1kADK+hgAzs4bXEfMiZZJhZQQAUNrKCDDewgto4t8iFeHxETLhMVDFush8iHC6ftfCVE5MOFHZy26w0RB1jAabNoQ+TDhQZW0MEGdnBcKDEDM7GAAipoYAUdbGAHsRVsBVvBVrBFPsTLCmIGpswboBIzMBMb2MGxMPLhwgIKqKCB2ASbYBNsgk2xKTbFptgUm2JTbIpNsSk2w2bYDJthM2yGzbAZNsNm2Cq2iq1iq9gqtootsmTeuJaYgZkYNgkcCyNLLixg2GLXiCypsWtEllxYQQcb2MGxMLKkjsACZphLzMBMrOBUeCxFBMiFUzGfLZGYgXlhBMiFU+FRIQLkQgWnzWtgBR1sYAfHwgiQCwsooILYRp4QScy1TIy6c63HXMvEAgqooIEVjKXogQ3sYNjmBoi5lokFDFsLVNDAOCmzQAcb2MGxUA6wgAIqaOCsOycnyPmypwvHwgiFC2fdVgIFVNDAOPE+0cEGdnAsPC8qTiyggHHjTwMdbGAHx8LzFuqJBRRQQQOxVWwVW8VWsTk2x+bYHJtjc2yOzbE5NsfWsDVsDVvD1rA1bA1bw9awNWwdW8fWsXVsHVvH1rF1bB1bxzawDWwD28A2sA1sA9vANrCNZTvnT15YQAEVNLCCDjawg9gKtoKtYCvYCraCrWAr2Aq2gk1yDpGc8ycvFDD68YkGVnD24zm3Q+RMjRM7GKkxU07O1DixgAIqaGAFHWxgB7EZNsNm2AybYTNshs2wGTbDVrFVbBVbxVaxVWwVW8VWsVVsjs2xOTbH5tgcm2NzbI7NsTVsDVvD1rA1bA1bw9awNWwNW8fWsXVsHVvH1rF1bB1bx9axDWwD28A2sA1sA9vANrANbGPZYv5kYgEFVNDACjrYwA5iK9gKtoKtYCvYCraCrWAr2Ao2wSbYBJtgE2yCTbAJNsFGlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkiVKlihZomSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmRJJUsqWVLJkkqWVLKkkiWVLKlkSSVLKllSyZJKllSypJIllSypZEklSypZUsmSSpZUsqSSJZUsqWRJJUsqWVLJkkqWVLKkkiWVLKlkSSVLKllSyZJKllSypJIllSypZEklSypZUsmSSpZUsqSSJZUsqWRJJUtimqjMt2lJTBNNLOC0zcn7EtNEE6dtvv1KYppoooPT1mtgB8M2B6FimmhiAcPWAhUMmwdW0MGwxQJFllw4bXMCtsQ00cRpG9HIyJILFZy2Ee2NLLnQwQZ2cCyMLLmwgAIqiK1j69g6to6tY4ssGbEeIksuFFDBsPXACjrYwA7ebDrnNEhME00soIAKGlgnaqCDDezgWFgOsIACKmggtoKthM0COzgWStg8sIDTVmIpZpbofM+UxDTRxAo62MAOjoUzSxILKCA2xabYFJtiU2yKzbAZNsNm2AybYTNshs2wGbaKrWKr2Cq2iq1iq9gqthq22Cx1LPSwtcACCqjgtM3JCRLTRFVi15hZktjADo6F51v+TyzgtMVNlpgmmjgH7mo0PQZcL2xgB8fCGHC9sIACKmggto6tY+vYOraBbWAb2Aa2gW1gG9gGtoFtLNs5N/TCAgqooIEVdLCBHcRWsBVsBVvBVrAVbAVbwVawFWyCTbAJNsEm2ASbYBNsgk2wKTbFptgUW8wNnQ+6yjk39EIHY7fvgR0cC2NuaNzJPOeGXihg7PYj0MAKTtt8wlbOuaEXdnAsjJs3FxZQQAUNrCC2iq1iq9gcm2NzbI7NsTk2x+bYHJtja9gatoatYWvYGraGrWFr2Bq2jq1j69g6to6tY+vYOraOrWMb2Aa2gW1gG9gGtoFtYBvYxrKdc0MvLKCAChpYQQcb2EFsBVvBVrAVbAVbwVawFWwFW8Em2ASbYBNsgk2wCTbBJtgEm2JTbIpNsSk2xabYFJtiU2yGzbAZNsNm2AwbWdLJkk6WdLKkkyWdLOlkSSdLOlnSyZJOlnSypJMlnSzpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLOlkSSdLOlnSyZJOlnSypJMlnSzpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLBlkySBLBlkyyJJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmSQJYMsGWTJIEsGWTLIkkGWDLJkkCWDLBlkySBLBlkyyJJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmSQJYMsGWTJIEsGWTLIkkGWDLJkkCWDLBlkySBLBlkyyJJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmSQJYMsGWTJIEsGWTLIkkGWDLJkkCWDLBlkySBLBlkyyJJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmSQJYMsGWTJIEsGWTLIkkGWDLJkkCWDLBlkySBLBlkyVpbosbJEj5Uleqws0WNliR4rS/RYWaLHyhI9VpbosbJEjwNbwVawFWwFW8FWsBVsBVvBVrAJNsEm2ASbYBNsgk2wCTbBptgUWwyS6IkKGhg2CXRwXuPML/VpzE9NHAvPLPHAAsay1UAFDYzpOSE+J6idGDYN7OBYGIMkGhVikORCARU0sIIONrCDY6Fjc2yOzbE5Nsfm2BybY3NsDVvD1rA1bA1bwxYfQdTYAPHRwzlTXWP6qc4XeGlMP000sIKzvRbbYuZDYgfHwpkPidNmscPMfEhUcNosGjnzIdHBBnZwJMak1MQCCqiggRV0sIEdxFawFWwFWwyizhn7GpNSEyvoYAM7OBbGIOqFBRQQm2ATbIJNsAk2wabYFJtiU2yKTbEpNsWm2BSbYTNshs2wGTbDZtgMm2EzbBVbxVaxVWwVW8VWsVVsFVvF5tgcm2NzbI7NsTk2x+bYHFvD1rA1bA1bw9awNWwNW8PWsHVsHVvH1rF1bB1bx9axdWwd28A2sA1sA9vANrANbAPbwDaWTY4DLKCAChpYQQcb2EFsBVvBVrCRJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJXJmiQeGrQU62MAOjkQ9s+TEAgqooIEVnLb5mJTGBNbEDk5bnee/MYE1sYDTNu8oaExgTTSwgg42sINjYWTJhQXEJtgEm2ATbIJNsAk2xabYFJtiU2yKTbEpNsWm2AybYTNshs2wGTbDZtgMm2Gr2Cq2iq1iq9gqtoqtYqvYKjbH5tgcm2NzbI7NsTk2x+bYGraGrWFr2Bq2hq1ha9gatoatY+vYOraOrWPr2Dq2jq1j69gGtoFtYBvYBraBbWAbqx/HTFSdjztqzERNrKCDDezgWHiGwokFFBBbwVawFWwFW8FWsAk2wSbYBJtgE2yCTbAJNsGm2BSbYlNsik2xKTbFptgUm2EzbIbNsBk2w2bYDJthM2wVW8VWsVVsFVvFVrFVbBVbxebYHJtjc2yOzbE5Nsfm2Bxbw9awNWwNW8PWsDVsDVvD1rB1bB1bx9axdWwdW8fWsXVsHdvANrANbAPbwDawDWxxgjHnE2jMRE0ciTETNbGAAio4bfMBZY2ZqIkOhq0HdnAsPC9WNLCAAipoYAUdbGAHx0LBJtgEm2ATbIJNsAk2wSbYFJtiU2yKTbEpNsWm2BSbYjNshs2wGTbDZtgMm2EzbIatYqvYKraKrWKr2Cq2iq1iq9gcm2NzbI7NsTk2x+bYHJtja9gatoatYWvYGraGrWFr2Bq2jq1j69g6to6tY+vYOraOrWMb2Aa2gW1gG9gGtoFtYBvYxrKdM1EvLKCACkaWSGAFHZy2GO4/Z6JeOBZGlszn/fWciXqhgNM236mu50zUCyvoYAM7OBZGllxYQAGxCTbBJtgEm2ATbIotsmRODddzHmmPtWMsvLHwxsJH97/QwArO5sw53npOHr2wg7M5c5a4npNHLyyggAoaWEEHG9hBbI4tun+P9kb3v1BBAyvoYNhi9UX3v3AsjO5/YQEFVNDACjqIrWGL7j9fK64xjzSxgNM2YsNG92+x8NH9L6zgtI3oQ9H9L+xg2OJ3o/tfWEABFTSwgg42sIPLFvNIEwsooIIGVtDBBnYQW8FWsBVsBVvBVrAVbAVbwVawCTbBJtgEm2ATbIJNsAk2wabYFFucSsynBjTmkSaGrQVW0MEG3mw2X+GhMY/U5ix8jXmkiQUUUEEDK+gTLbCBEduzB7S6RpPaeQFyooIGVtDBqBtLXDs4FnosRQ+cS1FiMWdqJCpoYAUdbGAHx8KZGonYGrYWtlgPzcAKOtjADo6F/QDXOEFjVKIxKhEzRq2cWEEHG9jBsXAcYAEFVBDbwDawDWwD21i2mDGaWEABFQxbC6yggw0MWw8cC8sBFjDuYcefRWpcaGAFHWxgB8fCSI0LYylGoIEVdHAuxXw3ocbc0MSxcOZDYsz8LoECKmhgBR1sYF8YSSAnCqiggRV0MNo7D2oxs9PmUxkaMzttPoqhMbMzsYJRoQY2MNZD7ATR50+MPn9htDdWdfT5CxU0sIIONjBssWtEnz8x+vyFBRRQwbnWzyWO3n2uh+jdF7J2ondLbPleQAEVNHAuRUyuiTmciQ3s4LRp2KJ3X1jAadPYANG7LzQwbLEtondf2MCwxZaP3h0TRWIOp0UPiDmcFvNAYg5nooJRdwQ2sINjYfTjmB0S8zLPnSvmZSZW0MG+MKZKzWeY9Jx2eaGCcxNG7pzTLi90sIEdHAtjqtSFBRRwNnJ+xU5jgmViAzs4Fz6mu8QEy8QCChhLEX8Wk6IurKCDDezgWBgTLC8s4K1unG/GTMqLYhlObGAHx8LounGXLCZSJgqooIEVvNnGSW1RXzSSZre9qCySRbrIFtVF0fbYHaLDnhgd9sICRttju0aHvdDACt7aHtcnMU/yor5oJM3OelFZJIt0Uaz56GbRJS/s4LjQYipkYgFvVedVpsVMyItsUV3ki9qi2fIjaCTNDnpRWSSLdFG0vAdGG6OiHGAB599LkC6yRXWRL2qL+qKRNPvnRWXRcuhy6HLocuhy6HLocuhyRK+ssahx8LzQwArOdTEPvxZTFRM7OBbOXplYQAEVDFs0Jw60FzrYwLBp4FgYvfXCAsraNGdvPdHACjrYwA6y9RtbPw6p8yuSFpMSbT47ZzEpMdHBBsZSeOBYGP32wgLGOos9cPZbP8kW1UWhimbFUfbCDo6FcZS9sIACKmhgBbFFl/bYPNGlLxyJMXsxsYACKmjgtM0JsxazF22++tJi9mJiB8M210PMXkwsoIAKGlhBBxvYQWwRBfN1lhazFxMFVNDACjrYwGlrFjgWxpn1hQUUUEEDKxi2WGdxIL+wg2NhHMgvLKCACs4wDsNMjIt8UVvUF42kiIUWqzMCIGI75iImzj/3oL5oJM3ef1FZJIt0kS2qi+aCR9THZMPbDbSJ0cMvLKCAChpYwdn4iNiYbJjYwbEw+v18C4bFZMNEARU0sIIOhi1Wa3T9Hv0nuv6J0fUvLKCACtraBIMNM9gw0fUv7OBIjMmGiQUU8FZ3nvFazCq8qC2KRWiBY2H08B5/Hj38QgHnIsyxS4s5hYkVnIswRzQt5hQmdnAsjB5+4bTN0S6LOYWJChpYQQcb2BdGX57jZXa+6NKC4ldjgaN7XjgWRvec79uwmBCYGA2L1RDd80IDbw2rR6yG2UETG9jBsXAe0RMLKBNLoIIGVtDBBvZcYI+ysaJdQAUNjLKxj7iDDexgPB0y6XxgKagskkW6yBbVRZ40+0ptseFmX0k0cDYuYjEm0yU2sIMjMSbTJRZQQAUNrOCyxQS5GpkaU+Fq9LaY/5b/dTYnki/mv9XIrZj/duHc7xMLKKCCBs7mRLDF/LfEBoZNA8M2N37Mf6uROjH/rc739FjMf7uargqyQLNn1DhdiOltF86ekVhAARU0sIIONjBs0fToGR5Nj55xYQEFDFssW/SMCyvoYAM7OBb6AUaxWFGx58epUExOq3FyEpPTqseKagUUUEEHY5+MXaMfYOxRsY17bIBYJT1+N1bJOMACxiaM9XD2lhMNrKvu2VvO/9rADo7EeN/hucTxvsNEARVcyxbzyc4FivlkiWuJYyZWPeJ3Y/c8MXbPCws4bSX+LHbPCw2s4GzDHJywmHNV5wuCLOZcJRYw6mqgggZW0MEGdjBssc5iT72wgAIqaGAFHQxFDRwLY/e8sIACKmhgBR1sIDbH1rDFDh4BHROtEhU0sIIONrCDY2F0hgvZWF1ABQ2soC+M3lJi94zecqGACkaxHhiNjL0v+sWFs5FzxN1ixlTirDtHuy1mTJ2/GzOmEg2soIMN7OBYWA6wgKvpMU0qsYIOtly2mBB1VRCKxRHnXKA44lxoa9mEpgtNF5ouNF1oumJTbMqKUlaUsqKUpmsDOzgWnr07ls0oZhSLfnwuUPTjC9taNqPpRtMrTa80vdL0iq1iq6yoyoqqrKiKwlE4CkfhKByFo4h+HKfxMckpsYNjYfTjCwsoYGx5CTSwgr4wut68x2sxLykxThNjW/S2MHrh+QvRCy8UUBNjLkyVE6PpM3diLkydN3ks5sIkRtNboIIGVtDBBnZwLIw96sICYjNshs2wnftZDxwLY9+ZN24sJsskGjgrzLs1FpNlEmeFeVfFYlpMYgEFnHXn7RyLaTF1PtNsMS0m0cEGdjBssQFih7mwgGGLzRI7zPlnDVvD1rA1bA1bBP+JEfwaGzYiXmNNxn52YdSNNRn72YUN7OBYGHvfhQWMpYi1HnvfhQZOm8UGiDOmsw1xZLiwgyMxJsAkFlDAqZi3cyxmvdR5t8ZifkviWBjBf2EBZ7F5/8NifkuigRV0sIEdDNvcADGppc77GBaTWuq8TWExqSUxisVSRPDHkH1MX0mMYnP1xfSVxAIKqKCBFXRw2mJ8PKavJI6F0WNjoDumr1zNiR57oYIGVtDBsMWqjiPDhWGLFRVHhgsLKKCCBlZw2mJIOya1JHYwbLEtos+fbYg+f6GAChpYwbDFJow+f2HYYmtGnz8x+vyFBRRQQQPDFqsv+vyFDQxbbM3o82cbos9fWEABFTSwgixbZ9kiCTz2h0iCEyMJLiyggAoaGNeQsZ9FEvjx73//4adf/vaXP//j57/9+qd//PbXv/70x3+t//D3n/74H//66f/+/Ntff/3HT3/89Z+//PKHn/6/P//yz/ilv//fn3+Nn//482+3/3sr+tdf//v281bwf37+5a+T/v0H/vp4/KdlvtPu+vMyX6S2StwG/b8pUh4XiYkTUeJ2Dr4KtPrN38vjv4/nC+Pv9fZHqwGtP78UfR5VzqWYr7h4uBS2KdJqrsjb4K5QQr8tUTcroswzyHNN3MbsVwl/tsBtMPyo2Qi/DW3etcK+KdI2q1NWK+bDzA9asS0wx2bPAno8Wozx+66Htjbo7exIH66Hstkv5xtLryLzjaUPmrGrUOL+1tmM2zXaqnAbjv22hj6uUXs2wo96V6E+XcHnifVZQcZrFSx37dtJ5eMKuzURI7TXmhB5vCa2a1MGNfRxjb6pMeLFPGeRMTPihZ2rzteFXzvXbe96uHPJJnPm59ty57rd4LlbmPFtje0OKrJ2UJMHi7JtRXxX/Kxwa9HjVuxqxPnyWaPa4xrbVdrq2rS30/Hj8Sqt7wbXvsIzySXtd42ub1dFf7gqdkXaodmMG4/H+afbXVSPtYvq3S5a9cUa4/0ad93tczVqWTX8eFxjc4Sfr3nNGv3u2HobdP62xu4QHx/HO/cPudvPv6vhu71U2c+rvFjDddXw/mKNSjt8vF+j2eMau+0yRkb6fL3bwxq2iVIvR0apl7tjy6e27egZprdRWHmthnIyfLsJ9dr66Gsfmy8hfbw+Nu24jfHmacdtFLu/tE6rrROPG47Xtktb7biN7oz3l0U32/bp/HicQXVX4xjrcF0ODpT24QJhd8SPj6ycJe4PUN81Y3O51OIWXNS4HWruzl6+vV6qurviKllivjPh7prr2xKbnXS+6HJ1WrGHJXZHuXLYOr2+rdD6cFF2azQei7jWaO2P1+i2RmOrtM3O8fwRuz0+7I+39zDfXQsPLjjKuF1DPmyIb9eIj7VG+t05Yf12aMHl3bPb7bI0zudKu4+g75Zls6f6seLUS3+8YXwX615zb59DkY9rbA6Vo1h2utuFC6cO+mEv883p6e0uSJ7C3G593NV4fhcr9JdbJj7cxcb2PGr1/PLSPnobO6aziDy+AmubfXSsTluO+/Ga8YnNeqyjwpw3/NquMdbV5A3ltRrxXozrrKH2l2rcrqjX0Xpe2b/UVcqwNdTQHrej7XbRytG6an2thmv2+9sty+PFGk6N9mKNurr9De21Glx11C6Pr+T2HcaaEoS9vFilMgBzu73QXqzSfI3N3YbWH+/xvb47Krar8Nyo2LbCU6Ni23Vx26BrKKlrebxd+tidB7WD86B2dz72YcT1ePdg+4NWsHfMwfBHrdgc8scxfB3iHo8c7yqUtRy342V/5aShx0surm1i9cW+0is3RnrdnDYMf3dEa1/hqbH4/u6I1ifWxWgvr1FfVfx4MQlvf9mpIo+PUTEg8N6G+UGJZ7ZMOez33TTfrA7tL2+aeldlvFhlcGAYh/pm0/S375fsSjx5w2Rb4v1jw5DVjBv3sbmHJe/fxJLtcb84x30ZrxVx7rG2+5OyzxVhcLy5v7TLj7t8H7Y5w9xd4H7RZfLdcI6M/vgy+ekhIX2tRryL5axhd5enn6pxfxvoblT6MzXmlybWpeE3AynH07fh+zrW3O6F28Pb8Lvx06OtEnI8vpNfZH8fhz21tLur9Q8pIr5rSefOx/3l+ndF2m4Hqdzju4uRj0V2K3WsS3Y5ym6NbE4Q29q2tyuAR5f9RXYbpo01qvTthcOHIlreXx3bIreL5XWRemvKXUv0E0Vias91hfnNlf9nijRZLWnfHL8/Fnn7zukPSjx1OqNv3zv9wdpYO+rtYtk3a2Psjt1W18H7myv/D0Xs2LVknUOU49HA9L4Zdc3l8Vrai8tS16Ch33aVl4uss5k6Xl2rdY3JuN9PFPvU3t4r45e7Iua/c5Gnp/bY++eq9v65qr19rrpfG89O79mv0ifn9+xuTT07wWd/oOnrxtL8nOXmeLctws2YsTtaVf+9F2cYN/t73bRks5d0Z2DlPgLKhxKbCJhv4V+3DfUuFe0zRQYzBkbTx0W2J5rPHfD2JZ464Lm+fcDbrY35hpd1B+L+dPe7tfH+4d/fP/x7+33XRnSDLDE2a2O8vzbG22tjd3fqybWx6/bzSy2rFdZfS7H5wY3VZ4/2uEiz3znF5nufsyWu7cXFaesG6HzB3ItFxjpxny/eerXIGlSZ7+narNjxBVeZ/fiCq8z+FZdV23XitrqefzPi9WGd9N3klDVMrHc7WtfnK7R1R7bfHeq+Xx1fcfnfv+Lyv3/B5X/Z34Rc5+7fzHc+PrRjl4leZG1bv7+q+naacNndpnpy226b0de50P1Nqu+a0fcPKKxZet9e/n+myO3IsG7ai2xWiL19sNq3Y+XqfIp+0w7/nYs8fU013r+mGu9fU433r6nGV1xTjS+4ppLjK66pdhHia5i6fXPIPD60Yxeq3Rhzv5vI2cuHGv7+bWo52rt3mffLMpS7EF0eL8vu6H+s67pyOCv1dpLzmSKNGzNHq/Xh0uyL3M2man28VqSP9QjdMY7jtSKjDIpYfWXjyHFwE+FuwOvjxim/c41yHMK2OezxpL8flXF2lOOu/366DBv5uBux/mSZeK/xVeb+Mu27MrvHjkbLIuPudsJ3u/6uxNP95weLY3eLU19euWWw38rdVKBPlpG7TS2tbVbu719GuIiVoruttCvCHCmRu7z+XBHlmYjb/d9Xi3BvUfvjlmyPg21NXR39eHwc3I+CrxuUddS7y6QqH4ps76Uzef6bw+DHGro9RVmBXas+rrE5g21rWfr9vfjmz5fo6x7HbZByU+LZJWmbJZHtXdK1RsfdgxXf1didvQ6ta9O248V2rFi73a3tD2vsbl/FJ3yuYcX+eJXa9rH+NaHYvpnoXT4kiO1mSXHXWO9v+X5fRH/nIqUddw8T3F+OW/nwqgLbJqutTJzPr9RNmW1rdO30N65tU2b3qL6v0bD7h+/Kx828m/PNs0Bu90/OfdeO3SMBPOF5/0Djd+04dtfk65L8/gUO34XAbq7UMXjI6xgvdb7bIW/NUbh/rvtjje3jVc91vu3jVYOx33H/LOLHrVK3jzfwsOpt1bxaZF07zjejb4q0t/ePqm/vHz84uVpznG5s/visaDcD7cnn1PclnnpQ3eV3LfHcPYofrVLhmkLuzgC+W6U/uOpTubvqsxcvHY1oHv7w0nF3F+vp688vuBW2HYBaT56466tjWEzYsMcldjd+nhtJlybvj6RL0/dH0mW3MF9zi4PD//zw6sNbHNK2NwYqi3M/H08+vLZjdyFiYy2OjfsXJ5k8X6Ty+Gy1+5Z8qkg/OOm9e1r0U0Vc1pPzfjsvfVykvz0vYN+OsqZ93EaPX10YlXVSpbop0u33XZj42F+e3I1NO/z3bUddJW7Bppt29LfbsS/x1EFzHG8fNLdrw9djUt6PTafbPSn1JUWevWMjw949zuzb8eS9kh8szJP3SkZ7/17JPt+VK/hv7qZ9zPcx3h7g0eN4e4AnJpq8N8CzLfHcAM/zS7IZ4Nmu0ecGeHR3a+HZAZ59O54a4NHdLaznrjF194zTswM8ujvpfnZsRsvxFaMhunvB3HOjIduWPL84+v6QihZ795J5u488eck8xvtDKtsazw2p6O69f0/u7mW8P6Siu1tOzw6p/KDIc0MqKvL2/lH6u/vHdn7zcxeI+hVPWulXPGmlX/Gk1X5+szQma4/NjN5tkbbOqebHaF8sMsj349Ui88teWeSbqVIfiuhuUPVLijx7rqq7W03PzS7alnhudtG+xFOzi/Zr48kz5h+s0ufOmFXH+2fM26cTBs9Ki9zfVv2wg+xuWH1FjdLXskj55qGPj0W2N3cG70u473jSPxTZHf+feqPHvh3D1nD3uH9u5Lt2bIt05sF8M1b1mSJdeAD1fjzkuyL9Cw4U2ztVzx4otm8CfPJAsV0nEnMVcl7EeLxO6nZ0ta7HaW7sjzrfj4rwMLx7sYdFto9Lrbdn3s6wNzvb7mbTWGOApdy/Tad/Yl+rx3ozcz3GeG2HtdGzJfX+TTbfL81X7LD1K3ZY/5IddvuIgNxN5JHXAlbKmjd5G/DdpPTuwaunV6zbV6zY+ruvWOYlydis2O2Nq9pWU27sDzvxD4p0Tiv6wxFS3b4fkMFv8W/ev/RhcdruGik+MXldnPjdEePDHClt5f2Blt39qyevPHd3r54eaGn2BSMTbf+a0icnwehufPP5STA/aM3Twz6tvzvssxt+mq/Qznao3j9V8uH7Ibp7DstbWVcGozye1qe9vH8E/FEvrne9WB/14q5fEAX97Sdk9334yWHw7u8Pg++ew3pyGHxX4slh8KeX5PEw+A9S8blh8FHeHgbfdv+nE218xVjreH+stcm7Y2nb7fLkWOu+xpNjreP9sdbxBWOtdnzBWOsPijw31mrH+2Ot4+2x1h9dpq2pCfMy7dHzNXbU3/taL777d62Q+6ewP1wd2e7uxK3GekGv3R24P04c2xdRrtNq8U2Rzd767Ju5bXfnyI91kufH/dTCz7RjXULfOk3ZtGOzl/Sxxo368LEpspvBWtezvnev+7yNQz1/KV+KMvp0u+jzhydVtptguL4DdvfQh+knhlqfmkf3g9Hap+bR2fuz+ezt2Xz7N/ytq2ap/f4bOp94SyCPgd7QXqvRufDuw1+qcbuMWnOBDnm8LEV2e/mTryvcFvG2dtHbqER5NPi9LdHXSOBtnbbXSqxX83hvD9+rudsqjeHI9uo7JL+pUV+sUaghm3dI6tvzAH9Q4pmpYrZ7KOkLSjz5iuDt+lwDxNJ8vLhN+EDK/dfdPlfjrh2v1ujrkCK9vlpjHae3NfavB34uz4+383z/rvR1DXY7g3ntbeuVE5/66KHv7Tv0n1oR+7fwP7Me9l9pWGe09ZuXNX7qaxGDGmO8VoMv/30z/vq5GnevA7UXv57R1qTf2uTVdqzBn9r6q+vDWZbNNyG3X0ax9UUSq8eLNfjshVUvL9ZYUW6++4rH/gNAd6/g21xm7J6ksn6sC8n7jxjeLj6/bUh791JlvyhPXqnsbko9faWyPRF86kplu2nbGj+2vnmDvu3uSD29bXd3pJ7dtj9qyXMXs7vt+9x3prYlnrwe3i/Ks3vZ+IK9bHc36gv2Mp75tz4eh7LtBhmrrCun+s2zKR/2j7a9Xlnrw9v9WwX788sylCePNh9YsVa/YFn8d12WeqwB03rIaweHWtZFcS2jvliDdhT5ihrjxRrrLvJtPO3FT5GVddu1lvryOu2sU3uxxlg1pDz+UNX+C9t38xXsfr7ft49y2PtPUP2gxFPXku8//LQt8eTDT7v1yS1fUX/8tXHb3n165uXs21YYn4iwYZtW6PsJtn126rkE23+/nVs+VcrDZdnXWG9mk+qP18f2LdVPfkde7N3BtG2Fp8bS9hWeGUrbPv/x3OiAvntR/AXfKt59nqqvDyj28fg+YN3dbbot/7o76/efKf9w963uXvnnnYdH+/13qL8rspvbv17yJX5/F1CeXaPPnpxvn2Fb57O3a4S71699eP/UroTzKaf7D3V9pkSvfLOwvtaKsbqpHEd5pYQcwtQs05dawfyB0vprC9IGn08rLy1IufuWbRmvtUJXYNwOqi+WWHMHit19E+MzJYxPyZmUt1vxYgljKtbt5PFhibp7NsraqFzS338b+Pk9nHk2464ZHy/59t/D4w2h90+KfKLEqEzgr+21Eutr8d+8p/QTJeRwJu/f3yb7RIm4732db8lrrTBOxO1uhOUzJSqfSat3Xxf6VAne3FHvLm0+VeJu8kSVF1vBqdbdAzevtuLVEnzOy8tLO/h8smWVqK9tVF/Dd7cj+4utYBK39+PtBXmthHYeHOzdXizBONXx0kbVoczc8sers26fnng7f3UMvq4w2mtLst5GfMPX9vBy8IjA8VpvP9YNDCnHa729FM7l5XhxQZwS7y/IiyXunv24v2H5qRJ1XagWHy+WYJplO95ekFdLdF6tO147FgkbVUp/scRBifHugrxa4u7i7P7x4O8yZ3c36Qsyx9sKjPsMt8OfL7GuJ24nrPp+ifZSCR5E0PvPyX+qRKMVdwejz5TgxouO+tq66GVtkfv3C7xaQl7bqH0NbGm/exL3UyXWWbjejyl9qkRnQe5ePPepEncT7seLG3W96u12rfdSK+TWx1dvv7vf+qkSa0FE7l5997FE3T7EJOsMuMj98xj9+WYMAni81M9E1/M+txsN8lqJtYff0F8rsW7o3cbn64sl+Iy1+dsl6qutuLu7cLxWwlkXo7zdio8b9T9v//rnv/z8259++dtf/vyPn//2699vf/nvWey3n//8X7/89frX//nnr3+5+7//+P//L//Pf/328y+//Py/f/q/3/72l7/+9z9/++usNP/fT8f1j/+4XR+3P5iL/+cffirz3/ttaMduI+O3f9fbv98GdtuY/y9+Wdr4g0m3+R+u35bbbx/2n/+ezf1/"
356
356
  },
357
357
  {
358
358
  "name": "public_dispatch",
@@ -409,7 +409,7 @@
409
409
  }
410
410
  },
411
411
  "bytecode": "JwACBAEoAAABBIBTJwAABFMlAAAAQScCAgQBJwIDBAAfCgACAAMAUi0IUgElAAAAjScCAQRTJwICBAA7DgACAAEnAEMCAycARAICJwBFAgEnAEYCBCcARwIGJwBIAgUnAEkBACcASgEBJwBLAiAnAEwCZScATQJsJwBOAm4nAE8CbycAUAJyJwBRAnQmJQAABFspAgACABjVqU4KKgECAycCBAQAJwIGBAMAKgQGBS0IAQIACAEFAScDAgQBACICAgUtDgQFACIFAgUtDgQFJwIFBAMAKgIFBCcCBAQBJwIFBAInAgYEACQCAAMAAAD1IwAAAcktCAEDJwIHBAMACAEHAScDAwQBACIDAgcfOgAFAAQABwAqAwQILQsIBxwKBwkCHAoJCAAcCggHAgAqAwUJLQsJCBwKCAkFHAoJAwAeAgAIAB4CAAkAHgIACgkkAgAKAAABXCUAAASBHgIACgYcCgoLACcCDAQNLQgADS0KCw4tCgcPLQoDEAAIAAwAJQAABJMtAgAALQoOCiQCAAoAAAGaJQAABsMtCwIDACIDAgMtDgMCACICAgotCwoKLQoKBycCCwQDACoCCwM7DgAHAAMjAAABySkCAAMAT2MoqAoqAQMHJAIABwAAAeQjAAACuC0IAQMnAgcEAwAIAQcBJwMDBAEAIgMCBx86AAUABAAHACoDBAgtCwgHHAoHCAIcCggEABwKBAcCACoDBQgtCwgEHAoEBQQcCgUDAB4CAAQAHgIABQAeAgAICSQCAAgAAAJLJQAABtUeAgAIBRwKCAkAJwIKBAstCAALLQoJDC0KBw0tCgMOAAgACgAlAAAEky0CAAAtCgwIJAIACAAAAoklAAAG5y0LAgMAIgMCAy0OAwIAIgICCC0LCAgtCggHJwIJBAMAKgIJAzsOAAcAAyMAAAK4JwICAlUnAgMCaycCBAJ3JwIFAnMnAgYCYycCBwJ7JwIIAn0tCAEJJwIKBBwACAEKAScDCQQBACIJAgotCgoLLQ4CCwAiCwILLQxOCwAiCwILLQ4DCwAiCwILLQxOCwAiCwILLQxPCwAiCwILLQ4ECwAiCwILLQxOCwAiCwILLQxLCwAiCwILLQ4FCwAiCwILLQxMCwAiCwILLQxNCwAiCwILLQxMCwAiCwILLQ4GCwAiCwILLQxRCwAiCwILLQxPCwAiCwILLQxQCwAiCwILLQxLCwAiCwILLQ4HCwAiCwILLQ4FCwAiCwILLQxMCwAiCwILLQxNCwAiCwILLQxMCwAiCwILLQ4GCwAiCwILLQxRCwAiCwILLQxPCwAiCwILLQxQCwAiCwILLQ4ICycCAgABCiBJSgMkAgADAAAEWycCBAQeLQgBBScCBgQeAAgBBgEtCgUGKgMABgWto3LG+qaEcwAiBgIGACIJAgcnAggEGy0CBwMtAgYELQIIBSUAAAb5JwIHBBsAKgYHBi0OAgYAIgYCBi0OAQYAIgYCBjwOBAUoAAAEBHhTDAAABAMkAAADAAAEgCoBAAEF2sX11rRKMm08BAIBJioBAAEFYQC6/IQvolI8BAIBJiUAAARbCioBAwUMKgEDBgoiAkUBJAIAAQAABrUjAAAEtAoiAkQDFgoFByQCAAMAAAajIwAABMoKIgJDCCQCAAgAAAaRIwAABNwKIgJGCSQCAAkAAAZ6IwAABO4KIgJICRYKBgokAgAJAAAGYyMAAAUECiICRwYkAgAGAAAGUSMAAAUWJwIBAkknAgICdicCAwJhJwIEAmknAgUCZCcCBgJwLQgBBycCCAQSAAgBCAEnAwcEAQAiBwIILQoICS0OAQkAIgkCCS0MTgkAIgkCCS0OAgkAIgkCCS0OAwkAIgkCCS0MTQkAIgkCCS0OBAkAIgkCCS0OBQkAIgkCCS0MSwkAIgkCCS0MTwkAIgkCCS0OBgkAIgkCCS0MTAkAIgkCCS0MUAkAIgkCCS0OAwkAIgkCCS0MUQkAIgkCCS0OBAkAIgkCCS0MTwkAIgkCCS0MTgknAgEAAAogSUoCJAIAAgAABlEnAgMEEy0IAQQnAgUEEwAIAQUBLQoEBSoDAAUF0GESoGFblqgAIgUCBQAiBwIGJwIIBBEtAgYDLQIFBC0CCAUlAAAG+ScCBgQRACoFBgUtDgEFACIFAgU8DgMELQoKAiMAAAZaLQoCBSMAAAZxBCoKBwItCgIFIwAABnEtCgUIIwAABogSKgYFAi0KAggjAAAGiC0KCAMjAAAGmi0KBgMjAAAGmi0KAwEjAAAGrC0KBwEjAAAGrC0KAQQjAAAGvi0KBQQjAAAGvi0KBAEmKgEAAQXBmTXwTaZKMzwEAgEmKgEAAQVkvsvHipP/cjwEAgEmKgEAAQUv0lArDpHQmTwEAgEmAAADBQctAAMILQAECQoACAcKJAAACgAAByotAQgGLQQGCQAACAIIAAAJAgkjAAAHBiY=",
412
- "debug_symbols": "tVnbbhs5DP0XP+dBF0qU+itFUbiJUxgwnMBNFlgE+fclRzy0HWCErNG8hEec6PAiitKM3zYPu1+vv3/uj49Pfzbfvr9tfp32h8P+98/D0/32Zf90FO3bJuifSHXzLd5tYilDVlEnlWVItjFj3IdsZNLG3ca9LTKFbJKHjGlIEh5S2YcsZNLG1cbVxizzWWRLJsXfJrJHk2Ocg4xjUFANRPE8RgXFQFJNUaCaLiBrdEmBhpcFUAbQQKqAohpWoBq1VTMAG+AIUAC6gSVRC4CmY3q36RRsFsWRbYpkcmSXkkzJQUEzkBNANUARAJrCy5pSHWtMbeSWWhtSHVnkGJeQTdo41iXnJUWTZcl10awt0sYk45wUFADxO0sWiy7vAH3kvugCa+6LrrDmvjCNlBdd4wHE8Sy5L12jVNOaqiy2akgA1YDmbAACaAaWtC0AmozpGdMJs2jkupZsclRyrZbpqqu9AI4AxUALANBoXSYJk7UwB4AmQhOhSdAkaDI0S2Eq0CQPAE2BprimG1gqdAHNACcANtBgosFoB2EHYTfCFgjACFvMAEbYUgIwwoYoGqJoiKIRCAkmCggLTFQQVphgEDJMNBA2mGgg7DDRjbCHDGCEPSYAI+xYi56MsOcAQABmohMICSYKCAtMVBBWmGAQMkwwCBtMNBB2mNAtQFJaMegeMOQ6bXIDaZczRI46UHZdbkAlOqpA1XXVdezM7CzsLC07cl13nXsf3fsYwBwjrEVdWNKDKGp9Ul2Q6qQLxKRlSG1BHUirjboiramiLEkrp8QFMZCmtugRldUDQwwUXRddl1yXXJddpx1kIO28hlxXXFdcp2erIfdFu+BAnB01oObWmnvQnbmDmUJwVByBeTlNDIF5OVEMgZk8NvLYyGMjcubi1oozF7dWnbm6NXZmdmvNmZtb687c3VoHcwnkSJlJkbYhQ67TihhIG5ChAqQtyNBZ14GWyhmIgdh17LrmzM1ZmrNo6zEEXQ3kCJ5W974u/pXl4qVP6/v73QbXtZ8vp91Ob2sX9ze51T1vT7vjy+bb8fVwuNv8sz28Lv/053l7XOTL9iRPZT/sjg8ihfBxf9gper87zw7rUynqtWmZTbIHnCAG+iyFVHAxCoF8C4Vs9WwUSWpllSJPKOTqAwq5xZwp+NO5SDUjF4lDWPWiTCh6wmKknqNTUExXFHUWCLIpje1MEPptPvRVHyYUksBqFOXKiw8U/QvDuPKB66oPs8qUdoLKrLS+oDFN4ki9I5Acz9mM8QPHpDZjjwQSwTU7C+drEpo4ws1XlVbLexqK3GG9vmtbD2VWnfFik0gjO5c412sS/hv5aF+ZD3kjZJSHvMOt5iPNekbn7K1LLnu0FkqKk3wE711yY+K/EExdX9wJB3upt3ReWFnjq0BmNVqp+KpU4vVsTDZ+dS843paLizgujrQPccwI5AXDCHrqawSzxsOdzkfi+nmWJg00B0rgCHU9EZNMklzFcLjLF4HVFprjF/bxKyf6+lkyWw+596OsYuK8tiJ5VpolU/ULQq5lrTTzrDQT6qKWcFNpXkVy0XP+R3HK6xA6jrx5tBvKkyj5pY/K5Lo1KU9GgfPFDSN/eoP4/qBwToLU2qdDSNgcdLG/PhLQrEkURhLko8pF92/XFJNzXd4KQSHw4m7A1xQ02+Uh+y5PtEoxKUo5MrxT6At3WQtlWhG+HhxuWY8S/LKW800EjLtJ6fUWgsu9eROBXPlRD+k2Ak6+J/otBC37uVXXPSj5q3Yl5+Y74rY1qCCo7cO2/iHD7f3+dPUDxbtSnfbbX4edDR9fj/cXT1/+fcYT/MDxfHq63z28nnbKdP6VQ96yv8vXl7vM4Yd+jJJhkk/6KScdRn0q34jkS/+Pd3XmPw=="
412
+ "debug_symbols": "tVnbbhs5DP0XP+dBEkld+itFUbipWxgwnMBNFlgE+fclJZIeGxghmG1ewiNOdHgRRWnGb7ufhx+vv78fz7+e/uy+fH3b/bgcT6fj7++np8f9y/HpzNq3XZA/EfPuS3zYRaIhM6uTSBqy6LjYuA1ZUaWOm45b7TIFUFmGjGlIZB4U2YYkVKnjrOOs48LzC8uaVLK/lWWLKscYAo9jEJAVRPY8RgGkIImGBIimMQCJLgmQ8IABggEJJDMg0RQBohFbGQwUBSUaIANNQU9UB6ZpNr3pdAw6C+PINkZUObKLiadAEFAVQDKQFWA0YBoqfU0xjzXGOnKLtQ4pjnQ5xhRApY5j7jmnFFVSzzVJ1rrUMfIYkgAywH4DZ5FkeQdoI/ckCyy5J1lhyT0VHCknWeMB2HHg3FOTKMW0pArYVg7JQFYgORsADVQFPW0dmAZsOth0tFk4cp0JVI5KzlkznWW1OyjRACmowYBppC4Th1mkMAcwTTRNNE0yTTINmKYXpgBJ8gCmIdOQa5qCXqEdVAUlGSgKqpmoZrQZYTPCpoQ1oAElrBEMKGFNyYASVouiWhTVoqhohGgmyAjJTGQjzGaiGGExE9UIq5moRtjMRFPCFsCAEraYDChhs7VoSQkbBANoQE00NEI0E2SEZCayEWYzUYywmIlihNVMVCNsZkK2AHJpxSB7QJHrpMkNJF1OETpqhsB1UA1RdJQNZddl1xVnLs5SnKWCI9c117n30b2PwZhjNGtRFhblIIpSn5g7Eh13gZikDLF21AxJtWETJDVFwpKkcih2VAxJakmOKBAPFBVD0XXRdcl1yXXgOukgA0nnVeQ6ch25Ts5WRe6LdMGBCjiqhqpbq+5Bc+ZmzBiCI3JkzP00UWTM/URRZMzosaHHhh4bojOTWyNnJreWnTm7teLMxa1VZ65urTlzc2vNmCmgI2FGQdKGFLlOKmIgaUCKyJC0IEVXXTPUK2egYqi4rriuOnN1luos0noUmS4HdGSeZvc+d/+oX7zkaX5/f9jZde37y+VwkNva4v7Gt7rn/eVwftl9Ob+eTg+7f/an1/5Pf5735y5f9hd+yvvhcP7Jkgl/HU8HQe8P19lhfSpGuTb12ch7wAl413+UgiuYlIJh2ULBWx2UInGtrFLAhIKvPkbBt5grRYEPe5HBcpFKCKte0ISiJVuM1CA6BUa6ocizQCyb3NgWBGmbD23VhwkFJzArBd16cUvRPjGMGx9KXvVhVpncTqwyM64vaEyTOCB4ILCsq3jHManN2KKcXp2EcQZnuSvOiBNHSvVVxdXynoaSa/b6rnU9lEl1Avq68kl4TUe5oyh/Ixv1M7MBUIpHEnA1G2nWMVoBb1x81cO1UFKc5CN454pSmf8/mLy+tBMOfhNQipqunYvibSCzCs1IvioZy3o2Jts+uxclbsvFIo7FgXYXx4yAXy+UoKW2RjBrO6Xh9UBcP83SpH1CwGQcIa8nYpJJRK8JxMV2v2+gED+xi9840dZPktl68K3fyiqmAmsrArPSJEDvfQTLxnWbT5iVZrK6yBQ2leZNJBW3FCe/DFnH4feOuqE8EZNf+ZAml61JeRYr8LK4X3z4ogW+P5aNl3Pz4RCSbQ5c7K97Apw1CSqWBP6ksuj+dxQwOwr96sywLQrilgJnuzyA7/KEqxSTouQjwzuFvG7TWijTivD1KGHLelDwqxrAJoJiV1ZqeQvBcm9uIuALv9VD2kZQku+JtoWggp9bed0Dgs/alQWq74hta5CNINe7bf2Nh/vH4+Xm54l3oboc9z9OBx3+ej0/Lp6+/PtsT+znjefL0+Ph5+vlIEzX3zj4Hfsrf3t5gBK+yacoHib+oM83dhlGecpfiPg7/7d3ceY/"
413
413
  },
414
414
  {
415
415
  "name": "sync_state",
@@ -580,7 +580,7 @@
580
580
  }
581
581
  },
582
582
  "bytecode": "H4sIAAAAAAAA/+29eZhdR3UvqjOfPn3moWdJPWmeZcuW5UnzYCzJ7lbLxgN2u9WW293qbvUgdbdkZAEOJGCQZJkEeDeAB1mAjQP2g5DA/Qgh8ZfY58EL78XEgUcMuc9MBnMxJDefE27LOmef2rtqrV21z9rqarr9V1v71K+qVq2pVq1a5Ttz+o8/Ozze33XX8EjnSPec0yc/t3mop6+v5+CWzr6+s3NOnXrk1KlvNs7B//Ocmvzv9BkG6Htzoyef3DLQPzzyyMlzW3uGurtGvCef2tU/0n2we+jxjsvW2mNa23uU2j940tp+jlr/J08+cYEEpysNnPNt3X2dIz1HutVGMgnFIXhVEZ6+MJYDnSOdWwYGx40pvXSSHRSDfnHoN5Q99JMEQ3+ifWRg8PQZYKSWRdry5Pae7r4Dk7BvDr987sWHn/vm+ZGnnvxo6pXYxyqXR0489NAv63/R8PE3Hnrc2nCrMazHOtbbjipobb7N6Pe6L/tuu+8L/zFQueO9zx595Z/2jMYaOr8x/wNP3vY3p+f/5K4/sDbcbjT88Yc+cSLx7JlPNS7L/ya44yM/v+vXuwLrX8kfr/3r97z1kzcesTbcYTT8h9ve+v7ziUcmxh7+yrH1izOdTz/y8q9++sKLn0/8+tVnDr+8ztpwZ5lytEutfdLa/gam/RWXK3B/of071Npz479RrT3HYrsNwp984vz3Nz2cX/2jtyJ/tLvzfWOXffA7t7w+UfPUgv9x/zMNT6esDfcYDX84suX0SPWhK14Pf+vhNZ+un/uDN596/rXfjnev//lrP/5S06+tDfcWG9asXXTV4J98O/u9xc3/vPHrT688W/tm6zXf+/Odn37jP/7u3wWkuklhqV7r/utBa/ubFdr/tnnFIWv7NmPGwNoU/7A2bFfjMZ+1/T6nGrbQvkOtPccj+9Xa+63tb7EhXPG/gLXhrUxDz3ubh/+44mHP7m+8Z8Xz0cg3frLpk5u35F983x/NTzz9SWvDdxYbLr2m4o0n/+jdD835l6d+9uHfLv3qxhWpeZtSK/+fT/xjff/Q7bVvWBvepjbVBmv72xnFu0Z9pe6QpBTX8E6lfjkt8i7JfrmGd6nRi1vhu9Xah63tO9Xax63t71Frn7C271IytI3W5geUmq+2Nu9War7G2vxetclvtLY/qNT9Jmvz+ySZjmvYo9Tvdmvz+5Wa77M271Vq3mlt3qfUvMva/JBS8wPW5v1KzbutzQeUmt9rbT6o1Pygtflhpeb3WZsPKTXvsTYfVmreZ20+otSccz5GlZr3W5sfUWo+YG1+VKk553mNKTUfsjYfV2o+bG0+odR8xNr8mFLzUWvz40rNj1ibPyCpJLmG71bqd9za/IRS82PW5i89qNT+gXNt3SOjQ/2FrXq++q9Ofm77wFB3z8H+C//w6J+PjvT09YyM7+ge6bj412R3I91jI9+bU33ymd3dhwaGxjcdODDUPTzM7qyhL17wiw/84ge/BMAvQfBLCPwSBr9UgF8i4JdK8EsU/BIDv8TBLwnwSxL8kgK/pMEvGfBLFvySA79UgV+qLzDWufaeQ4N93RclcLr9n8m3s/3JFZcrYT7RsWbtevxf7Ud66hQfT6tRUhs38QC1SgATJx/fPXCEicbVleKrHHS9mrvcNBk87unvHBqfbLR38FED+PFJZru4JsWemB6e2dV/4GLoz9J5nWqcy9x5qQuje37OXis1GtihPTkZuRzqFn+tgbpr4LtrKHUngDT8VGLAMWrAAWrAI9pPeYQacIgacJQacJAasIsacJwacIIasFf7EfbPvFV+t/ai10cNeFh7BXtE+0Wh09jnSx7bjNM3Q9OAcSyuYG3JXZV1a41uQKe21j2ntrbUvSNPWJ6ebE9szOKzhZjFjQMHT506a91pFtpsPfmZnd2dg5uGhjrHGWrXNwK/3yf+fcOcs9xubHL/c/LJiz88LfrYKN4pWptc3KvNMc/tS4W5be8e6bpvX+fBg90HJqc5fOrUaWDcWyx4VvaqR/ZdDarHl8r7rgaYReuJWFTAOPUA43zRYJzOA1s6B4dH+yZFFApU1AEM4TkjWPM1wOp6HoEDIdCCAv++8xH14AS34vPUiD7fyk3zi6OZY/3SyFLO8q2JXRrLt2bj0ErMXXOs3DWHnU0xqvlCAZb/zRxk691o/TaXHfMktiVQUMIoEP2ZiyN++3/2Dp5lVeDu0T5h07kcbgMkEzIjsP6knv21CQyOxyibHc661SELTKiAUtNQAXFznquaFwV0O5fvdi47b8syzGO/AZDzP3/jpMLZd19n/7bDo519wyD6vJPnbhg9NLjrXlY1vPR1njHmFQlxB9TnPH4a80rUe+JCN6df+suTT1zQ2VAAjcZFq0eo14AwseKCblJn4rkwEzcQMfFcnFZl2pGNSqvPzJszP8w3ALIRZeJ5JlvGMXHjS9/mGWO+LRPP56cxn2PiFzHWkYmpH+VlGubK+ar5VspcOR/mynlEXDkfVQ6wBzKfX0TmKxhTb+S7a0QURqNtuMIp4BFqwD5qwH5qwHHtAYeoAUepAQepAbuoAYe1lxSNaShh+3Rh7QlqwMPaszb5lHtnnno4QQ14gBrwpQfBkIjACWssb68n4YQ1wk7YfCInrBF1brk5N6kmfgPdNvHdNrHz5uJIzDcAsgXdGjSxYPzWoCXvqeUZo9l2b9DMz6PZujfIe7LcDreR3YnRcDEW+mpE2LjMJZVg4yaYjRuJ2LgJp5W122bV+w8qy8/M27IMLew3ALIVZeNmFoxn49a8ZwnPGS22bNzCz6OFZ+NWjHlk9rhzwPiwgC9blNbI85w6X7bAfNlMxJctqH7g5tyqNucvgkzEd9vKztuyDAvYbwDkQpQvW1kwni8X5j1X8ny5QEIcFvAzWcBz5lqMfWQ48y5sLWQADvMAC5QAxqyLshCRjUVq7LlGXTYWwbKxkEg2FvFLuxCM/yxmh8Zx0uJiu/uhzhbznS1GjOli262JU8B+asAuasA+asBhasBeasAhasAR7dnmEBmgve1wOsZx+jG2Uo9xjBpwQnsFcUJ7JUsuz6Par/Jk7EJ3vhnSVz+4NWVyvjky89TNhPbqRn+fbtaSarks5NI8oO+UjT8XzCAHx71J82cVi5CAwWK1Pft16gGDxXDAYBFRwEBAqkVgwGAJOzSOjEtsAwZL+M6WIOuyxNa4OAXspwbs0n7KQ9SAo9SAE9ovyonZVdZvleFNmjZ8c4ga8Ij2CnFc+0UZ1X5R9FeIh7TnwxHtV3lUe9Ej58MxasBe7aesv8c5ob1zo/8qa+xxGn8umIEO2NCse6Of4dNf+nq1H+E4vX5opR7jMe2XZYze2lsiZ610cUQHxdyQOGKre3HEVoZS1m6XqHXbqLRAzLwty7CU/QZALkOT8pawYHxS3rK8dxnPF0y3YFLeUn4mS0sELCTleRdyWc8unB61IhRcjDCy4qL61Bl5CczIi4kYeQlKK5iflqDL3ups2XFIKyu4oMRb2Z9xpwEwKywtLxlcghWWwqywhIgVluK0sna7TK3bGKiA+G6XsfO2LMNy9hsAuQLVactYMF6nrch7d/CcsbxICTABfjk/j+W8RtvMyxTMVookdlD+YhnMVkuJ2GoZLvLWbpcTlb8QLgczb8syrGC/AZArUbZazoLxbLUy793Hs9UKCVO5gp/JCp6x9nL6cZmEpAiFT0ofL/u978/CIcsQQVVk2oC6oC6HBXUZkaAuR2kFy8tylK2XOmPr3wdIK8PKmC7cimAMu/yS94eIgcx1lV08wAolgA08wEolgN08wColgG08wGolgHYeYI0SwA4eYK0SwK08wGVKAHt4gMuVALbyAOuUAG60KqcrEFV9pZq23KOuqq+EVfUVRKr6Sl5qrwBV9Xp2aJxEr2fFF+huPd/dekRJrLcNyjoFPE4N2EsNOEwNOEQNeIgasIsacIQasJ8acFx7QHLGHtR3URj3QXfWJpfmiZknzce0Fz79F+Ww9vrmuPZGoEt7GurPh8Par3LvrLYpG/AEvalfSQ+5ih5ytc6QhW8H6ce4ZlosTsu0GOVaesiaacBCl9FDXj4t1vvyacHoWqvfwrf7pwGbX67vGKcRFV1g8HXTQllcRr04cHKzNs7kgPYxGfI9CPkuiTwGPG49dLiy+EVwBLO+vMyhIjByBLMePoK5kugIRkCpKxlKWbu9Sq3bKNTtVXy3V7HztizDBvYbAHk1mtZyFQvGp7Vcnfct5PliQ5ESYLbUBn4eG0rkKyS1+Jow5pE5GlxuJchVCF9uUFuj5ep8uQHmy6uI+HKDiEEMwlqocTU7NG4Vry626wFZh+/sakRdGN+OUAMeowYcpQY8RA3YRQ04pD0Nj1MD9lIDDmu/KPrz4Qg1YD814Lj2gOSMPaj9opDz4QA14Jj2ZnRE+0WZIAM0/lyg/aRPUAMeoAaE4wbO12X9zPOYBrV3wY5orxT1d2MHuUxt5hkDMFMbf8YAy9RewD/WQBaccfAuJBKcWeBecGYBuAk2xUgEoQzjzxpnwQw4OjJGDXiEGrCPGrCfGnBce8AhasBRasBBasAuasCj2ose+SofpwbspQac0F45dGkvekdmF6VswBHtTQDv8TGHuLVEh3G1Jj+mvHOTNux0RAZgPw9wtRLAXqubdg3itF6r5je+V91pvRZ2Wq8hclqv5Zf7GtBpvY4dGscKzFfwUtd1fHfXIdx1na0KdAp4nBqwlxpwmBpwiBrwEDVgFzXgUWrAMe0XRX/GnqAG7NeeD8nV15HZRSkbcET7KY9rD0iuHAb1XRTjzxXas7b+zsjwrO9QNuCs7zDrO8z6DrO+w6zvoL3v4BYN9WfsY9rTcEL7RTmsvegdn3kmQH/fhnzKw9qvcu+stikb8AT9jrmGHnI9PeRyesgN1ItzkBrwfvpJr6KHbKGHvIwe8urZxSGCXEkPuZoecs20oKULynedvmrNTW1+2cyU77XTYNot08LDWDUt1NqqaUHLDdNi4pfrzOqFbz3TQvmu0tmMubneq3VmITdpuWoaWHD4Dpo2+/kB7c8dycNA5IEq8lQ3rnbNtcUvgkzT69SSPSOWwRaBjaEaPTE9gJmm1xJlmgoodW2JUhZqXM8OjaPi9cV2YKWX6/nOrkeWZRZwFrA8QGuqPWNzlhLpjqXsz7jMbFh7XK8mwK3q2uN6WHtcR6Q9rkdpZaHGRnZoHB2Zr2BoZCPf3UZkaYxvY9SAR6gB+6gB+6kBx7UHHKIGHKUGHKQG7KIGPEoN2Ku9LE9oz4fkNBzWng9HtdfYE9prbP2Vw5j2ondce1megXw4or0rwl/yZbbOtUT7nFr2Z9xOHd55bFRz/h9R33lshHce1xPtPDaitLJQYxM7NI6OzFcwQL6J724TsjSbbO2YU8Dj1IC91IDD1IBD1ICHqAG7qAGPUgOOab8o+jP2BDVgv/Z8SK6+jswuStmAI9pPeVx7QHLlMKjvohh/rtCetfV3RoZnnu/Qq70zMqG9d6M/Y8/6DjPBd5jdWMxuLGZ92Fkfdrr5sG7RUH/GPqY9DSe0X5TD2ove8ZlnAvQ3o+RTHtZ+lXtntU3ZgCfoIzc11GM8SD/G9dRjvJ9+jMunAR3X0UO20ENeRg959TRgoFXTYnFqdJZuF4TR+HODvvI903lyJT3kanrINTNVvtdNA8u4XGczNq3ke+00mHbLtDBiq6aFWls1LWi5YVpM/HKdWb3wrWdaKN9VOpsxN9d7tc4s5CYtV00DCw7XDtAmwjSg/aEreWCSPHRKngTM1Q4wHnktPwffqnyLwMZQjZ6YHsAc/Kvdy8FnHr11moN/ufbMTR7T7tM+VUb/86kx7Ueo/7WDE9SAB2agcZ7Ne9NQw+rvgo1pzzYj2i9Kr/YjnM2/1HCVZ/MvZ4IJmJH5l1wJJnhLukltVzhXfUu6Cd6SbiTakgootRHckm5mh8ZRkfkKnrdt5rvbjCzMZlut7RTwCDVgHzVgPzXguPaAQ9SAo9SAg9SAXdSAR7UXPfJVPk4N2EsNOKG9cujSfoTHtR/hqPZsQ77KI9rbFL6yEBM6ryVyIGvZn3FxfNiF3Kzmxf2Bugu5GXYhNxG5kJtRWlmosYUdGkdH5it4fL6F724LsjRbbKXTKeBxasBeasBhasAhasBD1IBd1IBHqQHHtF8U/Rl7ghqwX3s+7Nd+lfu119gT2q/yiPaLMq49ILm2GdR3UYw/V2jP2vp7N8OzzkjZgLPOyKwzMuuMzDojs87IzHNG3KKh/ox9THsa6q9tDmsvevobKf2ddv35cFj7Ve6d1TZlA56g34LX0EOup4dcTg+5gXpxDlID3k8/6VX0kC3TYpQbpsUoL5sGLOTCeq+kh1xND7lmWtDSBX2+Tl9N6aaBmA7C6IIOWjszddD6abE4q6fFKNfPVPt9uc6sXvjWMy2U7yqdzZib671aZxZyk5bTwZ2G7yVrEyIY0P5slDyyRB77Is/v44qGtBS/CNJrl6tluEYtgy0CG0M1emJ6ANNrW4jSa5fzlGphKGXtdoVat5VQtyv4blew87Ysw0oJG7b68zd2Dw/vu6+zf9vh0c6+YRB95clzN4weGtx1L9PB6ny4mueLlUVK3AF1upKfx8oS+Z640M/pfDiNMc9jHett6diBrYQMQC9PUZixV6stco06Y6+GGXslEWOvRlfGQo017NA4NlgjwX1r+O7WIBrH+DZKBshwhrZjLHw7Qj/pudpPuosacIQacJwacFB7Gk5QA76bGvAoNWC/9osyRA14SPspn6AGPEANOLmlshjN5YgLoeYneh5TdyFWwC7EciIXQuCkLkd8YzW3yfNpBc9lNTtv2HcBLf861DdebVpuzjdelw+/E7W9Tc54regd77POaAWdb+on9U1XuOebrnDsm9ptUZwKvAuA1ruyDOMtUZIGuLclJmrB3COzaXqVB1ijBPApHmCdEsASHmC9EsCf8wAblAC+hF0rlgE4yQNsUQK4kwfYqgSwmAfYpgRwGQ+wXQngxzzADiWAnTzATiWAr/AAu5QATvMANygBbOEB3qEE8Bse4EYlgEd4gN1KAG/wAHuUAAT27CY1k9LII7SpIfggRXszr2hvYnuxmKW9JdOpbGJvhk3sXiITK5jNXsRs3MxOWh7yZllIbtVuJlq1m0TzZHqxrJp5UPyQ7XYPyjSw24E5J+pl1GMcox/jauoxdtOPcQ095Dp6yPX0kDX0kKvoITfQQ26eFpBr6SG30ENupYfcRg+5nR5yB7Vqezf9GHdSj/Eo/Rh30UPeoLMhO1/y/skhb6SH3E0P2TQtIPfwPmvNk9t7uvsOTDqrbw6/fO7Fh5/75vmRp578aOqV2Mcql0dOPPTQL+t/0fDxNx56gm+6Ss3dFZx3rzY6v+7Lvtvu+8J/DFTueO+zR1/5pz2jsYbOb8z/wJO3/c3p+T+56/1Y0EYqMDuHR1hrdI7/l+KbXqY28/lYyEhq+F8UxIwkhy8Iam8oNm39x78I/dtnP+L/4nffGDj6m6WP/P2Oh//75645k19x3YPtP/roL3aXXX4uigWKnG6Ot6ohxLBQkRRCBRYrkkIIYsEiKYQQFi2SQohg4SLJzB8k3CN5PoLEe6TGIJDG3YYk/PhDnziRePbMpxqX5X8T3PGRn9/1612B9a/kj9f+9Xve+skbZwWhHhkh+mj0GwJJuMlo+g+3vfX95xOPTIw9/JVj6xdnOp9+5OVf/fSFFz+f+PWrzxx++QpBnEBOdCeVVvE45ftcmJ2JvNRBhsJ7vnhCxMZs9rEg/MmQN5/YZPT7qjXW4EGOcbxqK1mrHmPywjEmD1GMycsbVw94jONjh8YZXp/tQbCP78yHWHIfc25LjNhFDXiUGrCfGnCUGvAQNeCQ9lMenHl82EsNOEYNOKE9H5LTcFh7PiQXvSPasw25xh7n7S/sjfjVHAKvujfih70RH5E34kcp9bntk4TqOdi/pbOv79Evjo709PWMjF/wE7d0Dg6P9k3S8Jnd3YcGhsYnQYYmPUHWW/nMzu7OwU1DQ53jDD39njMnz7X3HBrs62bOQNecfPLiD08XP170Xz2PgPjV1i+FMW8D/n3nI2Zo8f+ZiMqveFCN6Hus3LSnOJo5/LkoQznLt5vYpeFO5gqI94m5a46Vu+aws3niwrqezle/UIDlf8MN1M+O2fItwI55Etviu5cwCkR/5uKI3/6fvYNnWfHdPdonbBrgcP2QTMiMYFbaWWmHl9PP68wAS1hHW53yNdJnDY108NSps4DkbxVrIm8NpCkgzXVWoLnWc5qL/VgD6BWxskN2wrK8BJs4T2lzPsv0syZu1sTNFBNn/YkpooTzgteIIp584vz3Nz2cX/2jtyJ/tLvzfWOXffA7t7w+UfPUgv9x/zMNT6eL0byKPVwU0c+qIEBAA+YoonjefBwxkI9/1+i5zSzIXy4I8ubRvt627pGhnu7JOPDAweFTp9TlbTfw73uk5E3saXgRpetzXen6YKXrJVK6gh2Yl0LpesRK1+e20t3jptINXAql60GUrpdS6QacKF0fonT9mNJl2dpO6XrNStfkhsjrSYkRzLpYsy7WrIs1U1wseATnLl6cE+oKr8Cl8eUrTpStIia9tX1DnYOnzwh1wawjMuuIzDoiM8URQbSXOZ/B5eATMwBkm/nDkS2nR6oPXfF6+FsPr/l0/dwfvPnU86/9drx7/c9f+/GXmt4sW0PtM7aLH6fYqBoRNQZEtE2t+JTR75+aNc4/rSionP2dfT0HOke6N/UfeJt42/oPj3aPdh/YMzDSPTz5j9uOdPePONq9bgf+fYfC7vXc5BZ6dAg8bYs93j56j3XrbkRTgUZx0eVyoxFK0Xi+4glDtF9F2S1m5es4Yu8Srtu7BGzv4kT2LsHbuziFvfOL7V1iWtu71KWwd37E3sUp7V3Kib1LIPYuidk7RmEm7Oxd3Gzv/GwXVtwEJBMyI7D+JA550eBOFohFxkzixKkkf77iawb1/xUbacyeVpMrLN5v8OsDKzNF1u5QV2YpWJkliZRZildmSQpllhArs9Q+FWW2T0GZMcwDffE5UGg8IybyFf9oeBsvcF4OI1zzFSxIAnHu5rM/Q/prIOqvgf0ZFzsotLvd+iUIfgmxU7F8C4OnphXFL3dYv0TYoVq+VYJ40RJeYfUi37T+pqYMn9wCVVsGFLCM9Yis7uQYo45pyK9xDYvBfa0twYJatJ4LvdSVKMyLTX0+8oghNq9yo62XEBvB/OvlxKbeujr1lJuveoS/51F2NK/E3ACJmkQsYvx5I0f2RqYpZ1Ob2N+hfgLTRxPgJzRCtstKsbrSJIvs8itouknAlzAw7hFwYjIf6TOg34Sg64wtlwHFzAUiP1rPqxEbVVO+4t+ZLRfQQSO/vnW2G0F8VHWmAYrG9ZYxrtcwLVPDfWxiNQowuGZ+Rk0SlG5B58QgNAvm1JKPeJE5NbKijSiqedDg5gFs2cz4IoJhzctHQsawfqog4nW2pqMFpXIzN8t5TFOFgTTb8iK+bs3s8ITrFmfWDTNqdSKjxuo6y4SbJdyoZmTCuBvVbFVyzZRmoRnxh1ooO2qxtT+tIj4rNLoXarRAVpZbBTyxIB+Zy/AExKuARLbiEtmUjzTaS+QCJxK5kG+0gB0XoksXcsa1lf0daqkZfd0KWOom9teYpU5yljqyGDSnwAIkS9zBk78uH9lrQC8DnQCrpb6XnQs0Hhuew0e1yt5S16HOuiNLnTTxl4hZL0OsWrJcS92K2pA6t6T7KjnvoxmbE2jDmp3pheZ85Dp7vdCCx1aklUkLpheaWf0hP5BWW17E163VZBVE67ZN0lInUUvdwkdTCwO/0/olxXpwlm9p1oGzfMuwbo/lW5blNcu3HMtqlm9VJsYsaLAvqyvH85g7NKmI2gzwHjXXvFVC4Bc4E47Jtb/FXjgWOjGai/hGCzHhYCzqIoWB2AvHIlnhWCgg0KJ85F0kbuxCPihddynOW5qR85YWpLThAvUTlzqDUK8jJy4lIXBkjeFDmTp7zwaOQTDqSBiFGDDAT9Fba8iyNdlathGXLFsratnQLVmr0r7WTnhbZT0SkWVrzUeOEVk2ZM3rsTUH4w4t4JojgafJTfV7ihOq8ZiFzGeaTEHXFL4p5swljT784B41oMQ6Djwp0z6JW5wFLO+Bmw0HDNcsy3BJsUQ+jDFcPUsTQciYAS+pG/nZ1YFqsk4APRmqdS4RPpXT1xpV9lM+fa1x//S1BtWj5Rr3hII1NDmL3GEJ8w0KecrGmOvFgc/HRIxtHCc5OhAqcvt/Q075yiXxJnW2qoPZqoaIrQTrW4OwVb1atxuVloOZN3c0xnyDzjtQtjLF4nm2asxHnkUO0UC2msfPYx7PVp8Fd6a3IzvTJL8zhQ6sM+ABeBYR1hyIV8UfgH8Z80FA17LmnE10SuRY1uQjf2m4ADVgWsGdfFoBQ2A4sSDFJxYwJOZSCxgiw8kFWT65gCEzl17AELqUYCDKVo28UHZm5BzkBkICZEyBvku6npGZhPVdgkjfJdH8FudJTAFxElNyWmdkpi9FhCCARAgSlBmZaScZmUl2zLCu5jMymZtTSbssw4Q5IzPAdoHkTyTw8xvBCJD0zoBURmbAPiMzIVZkPzA0ej0IzqeuJ2w3TEm51PWEOK7yI/vTmaTQhMVMBkkE/VtDtf//CsooZjvhFOrnxFhO4ceVykd+yh6SWPghpcC0STA1NgVnkAoWmBk60CwtO2PRIqfzkTfsFznBjyxluxJpOdZLiUf1Jjsqkd3ZMjA4XrA7goI6sGVgzaly4mvirEIdBaEVKXL9b7H874AddwVA7oqbqfV8gVpbu/u6R7oNep1xQK/AGZWqEQFdL68E3Lu8EgBzWE1midtIJU3LB9xBQrszrflzhTV/uxtjyZ04T0KnLe7BnSfJklGzt5tofenEtC40kJpqX3oa325iPFnV202sE1zG7SbBCDDrRuVLx4W+dGUdc7tJ1oIyD7X6XdRUyRmlqaB7mAkVTZVwcnUpAOiqeyh0Va2+NzEfUNdVtcbOc54LugqOCdyMZBa1IZlF7UgMdx+SWdSBZBbt5w82jD9vEd5cq1zncu0T5M5/SKG0kR9JQg5J9hch6i+CcLcf0bFx173BOKxj/UQ6No7SChavOE/HBCsXPHMG85V/UdxmVm5V2ZcpVnu6Qp3QQff3ZUGVfVmIHZpAQArtwGyoEN9ZCJW4wrcj1IDHqAFHqQEPUQN2aT/lI9pPuU/7KY9QAx6lBhymBuynBpygBhzSnm1GtRe9Ye1pOEgNOK79ogxovyhj2tOQXMH2ak9D/RVsr/bqawa6cxPaew50i2L8OVd7WSFflsPay8qE9vpmUHsanqAGfOlBLirH5HD6FQIgQaQ7P/szRzEV+Wn7gVOFch5HCq5Texwp5OBxpHVqjyOVKrcq5I9m1eJfa9WDb1n380ezaP4oV9iLGRp2neUGqLtavrtahNVrbS25U8ARasCj1IDD1ID91IAT1IBD2rPNKDVgl/ZsQ07DQe1pOKA9DY9pz9iHZle5bMAx7WlIbvV6taeh/lavV3ub0qW9+jqiPdv067soxp9ztZcV8mU5rL2sTGivb/T3EE9QAwpCR0yanF9h+56VCx1lnUUE5KftRugou0YtdFTrIHS0Ri10JErnii6dulzDHFHuX06yv0ud23gtUX/Xsj+DcxtlY3ZSMnctf8OfsCMDbB/2UkJOIac8IccfYLGVBHAjYFvpzypQDRWuqV7IM+cHdLtA7rL56MZianTtdvBOgFGxNbpZddxxdtyiJOO4kccZ3YYtgh9lk4RobZmeEeAQ0eqGZFaXh2QytMPgwqK3X6tM4xOt8V77ksdZe74DZ1Ul4rssxndV+Wi7Et91qI47zpJVRJT4/2GA38qxR1iW78Io3yUuecY50l+YqD8zbcrMY3d2bySC3BupRCpKRq3f2kp/Vlu/tZf+5MrF7IPJWhw+chvFqEpfu4vmid4gSwkrC1SyGAALVPIsUClnnytBSGHNBMbg8kJZmY991RDKEb5kjmHQy+W6y9TPFZHbE1H3bk9ES4sAXwgS3J5gvl5OtA/K2sYTnAKOUwP2UQMeoQY8Tg3YTw04pv0ID1EDdlEDnqAGPEANOBlC0Z2Io9oL84T2ojKu/SoPaL/KY9rT8Cg1YK/2NJzQ3rkhp+HwrMaeARqbblGMP+dqLyvky3JYe1mZ0F7fDM48N7vbBTfbGpUxPYQuHxCIy0Vl4lhpoqC4mF0Wia9UqYU4fOrxlSo4vpIliq9UoasH521XofkacfoUkIyzCBHQKINOm+ycOb4W+H2H+PcZ71nlc+a1KufMXk7mohIyF0VJjMlcVGHVjHfMd2KDjCssabhEbkTVZBQ0m4HYziFmWFaSlzYDcT+WuFGlIFAG4l0cYhUrWgBinQjR+HM7h8nIKPgGQT2KuQN/eB3AnIfM/G5Hbw43oqPchr3w24g91p0Q25bKk9YTvVhA9SSZOccICk+SY1sN8DCSNcAZt5DrpZdCsHELEhk3wUW0IKDlKcrbhaZ1Ic6KqS5uF6QsxFnhpBBniB0z/BgGX4iTzWOyK8QZNBfiNB1GW3FDkEzIjMD6E9MVUplCnH77QpwipePPxxrti9r7+criwZIDAAm0XGVx0ahC+Virfb3zkF1Re78Y+kpDyy5SUEb2Re3DsiXeQ4JxhfOxZUhR+7AC0749+NL/rmZRoKGLFpgZOtCsQnbGokWuyMfW2C9ykB9Z2HYlKuRYLywe1TrXi9qH5EuilghBVdT+Av/DlYH9dtzlB7kr4FpRe79SUXusSmXQdVcp6H6VyiCa76RYPJFdPnF3Afk8b6qi9tvETlvAYVH70lX/S50ki/QXJuovLNmfK2miSH8Rov4ikv35ifozJeUqb/EKuPeKN3j77d8afvsdJQC1HWrUjIuouJHgMeFmjNaml4LlB2L//FGrk9Hjz902c6Nn3l5e4GT0HVM6+gQ7eouGb0Xs3QLX7d0C2N61Etk7IbEIQgPNYiuzwO3QwHY3QwOLLkVooBkJDbRShgYWOQkNLGDHbPm2kB2z1Q9m1N8COz+41RwaaGa7sOIugGRCZgTWn5j0hAkMHOsCs8++G9M0zRIeSrPIckh5KJe+P8v6NyPKcqGa6GTVleVCWFk2EynLhSitLNRYxA6No+MiVpUB3S3iu1uELA0DmaSHTNFDpukhm+gho/SQcXrIDD1klh6yih6ylh6yjh6ynh5yHj1kIz1kCz1kgh6ygh6yRmHL3OxWyKfkpQAPUWWcBH0yClNrtd2hNqGB7lZ23fl9f1M+9iwS2me21cDhM1aQstn1DV6z+wUpm9EIjYUaLezQOO5ukbCzTWh3rgQ0t4t5u8lhQFOetytLvM2lNDCzLyU1cBzmYROYbNd4EQ/gVQK4hwfwKQGsUDkPUHzPqEtdfALunwcEVM4DguzQ4HoSBxUOH7DCxUHbrFmngEepAXupAceoASeoAYe0p+Gw9nw4Sg14RHu26ScDZKwM8RjHtWecPu0ZZ0R7nT2sL2tPG519RHuN2KU925DTcFB7Gh7SnrEPzfoO+qkvchqOaW8CyF2RY9rrQ/3ZZmjmWb1e7af87lmNrZ/o6a8P6VbZ+NOrPRX1V2D6+7AD2kvzMe1XWWMv2/jTpz0nkmvtw9rrG/0jdOPaL4r++mZ4Bukbt1Qsue9wXPsRjmm/yuSyTL49O6o9YP8lEz0PU+K98Nvbi3/cKUja8Vyor46kMkid2HOZPL5il+WnIhxwkopgGU6AHRmYpsAO7IrL4YF9Lvf1O7e2/O4OhTQF+/eJ8buO5ZbCuMd8qcDHcpTpi5+nYuFLgO28kOVV31T2zdN7lKjI9MLJhkFjhwtTfJOGYRVGHtAHjJCSNuAr1oIiOUwzMCu5TvaFiVqBsNfl44+xGXpwhRvwEqWgEk8dorBC7M8gSPBliALuPeKpnLe/ZCio8ROyFUVBEZ96dlQI2cA84Hpgjkyhom2CWdbn459nZgkJcdYQQ0OMlYQwYpTG4Gqh1JfkX4VcdjQWlDWax1KFY6RGlt7YXdZ6dIMMP8nDD8jgv538uycM6Usvn6CXdhEFoqIjsmXriKytjvi6nI7IEemIHIWOuFs8lb91pCNy00xHvCShIxKzOkJSR2QV0o6ldESCeZVrttwZu8Fxfqc5MFvuzOGd5sDvZ7kzdn+iWO4swHbhvNyZYARIubOAVLmzAGAT/CZx4mxCIB9/w6D+v5ZVB+ntjWnpf1cjjBRClFlYjbWT6sosDCuzEJEyC+PbCWplFk6oKLOEk7toQUCd3UOhzpJTrc5CoDp7QF2dJQ0HaJ68OgvKqjPLtwp2zJZvTKGgNuSyUzv/Lpvx5z7rN6aGXQfiyeznr+wZf94ifC44ES07AjgHeS44MOtQTXOHarebDlXq98qhSlE7VEn3HarkVDlUsmVDvchCBhBlomjcHLy0kJQ7qihHmSTRiLiFGil2aNwGOsWKOtBdiu8uhQSGUqxdAyAr8cMWd27wh8S6stLr5JazV+G4IlgKN0DmAY39mcRFVDQ4sQa5wc+2Ft/gD+hqfQPuWV9YYCrZoXHcbSqTL38q6Bp3G/ZYyNtB2hv82FVukLeDKG/7cd6edEWvZ3ibWw6TU1kspLoHGkqEL9fssR1/pVy5Zo/wxeXENqZcMzf6OnZ7AL3pIBDKqOtCGYWFspJIKAVPwVRSuMQesShE3XaJt7jpEiu+wN3Gv8QOucTtLOXgd9i5d987ynCJ405c4ig7ZngjvI8zgCxb27nElWaX2MN2YcWNQjIhMwLrTyrZX8vEGD1AjDFiEidB5lDiXUiMkRlpxJ5WJpe8BmEk7HH5mBpr71dXZjH3H5eP8cos6qIyi3WoKLMOJ95yJfhllQOFJmTEo0WLnbiPO3pllg+s/Obhie5BNib17M+Q/hqI+mtABMJbSvPjkvCYAUO1gvaBLvwdSCyzAQz97+OjnBBeRelLcfX+F6+ODSGUFVaYjDFWpLggJ2FH8RI1kJyQeoVz5oQcNyaQkmrlTyuBMFSSsqNkiX4AidIiLWn8eSNHdiaUkOZMVZr9HWp+mT7SgPlNQSbBSjEPwyQF9n8Y9HABE21g7BLoxWi++uMG9CnYeS7uZAwoZi4Q+dGdWAobVTqfOGv/HE4KsYI7nY0qahqgaFx/guQ9RU3+m+VjmhV9YHCCpyDTEpTOonNiEDKCOWXziT9F5pRiRRtRVGAF4yTAlhnGxAuGlcwnHrfPy0rjjpB0Gp+JRtZZMhHwrMJAMra8iK9bhh2ecN0+i8UqTIZMYH1YXQe/CNqgwKoZOe8kY1VyGUqzkEEckCxlR1lb+5MT8Vmh0b1QoypZWc4JeKIqn/gKwxMQrwISmcMlclL5fdVeIqucSGQbmueew3RpG2dcc+zvZC11DrDU6TIs9TcdW+p7xZb6AQP6BXjTYLHU97JzgcZjw3PoqBIv2lvqKLKVcWipTdFDIbN+C7FqnnItdQ61IVG3pPv/lfM+MticQBuWcaYXMvnEK/Z6IYvuZuWVSRbTCxlWf8gPJGfLi/i65UxWQbRur9pr5RxA/SxO/Vw+8a+OtLKnTK2c5aifY7WyyoraUb9N9q5ClYBAbfnEzyT9JA/qJ1XZXacESbVKHJAysi9rasCAzZ1IwCbFB2yMPxPI9cYkErSJIqkhaSQ5LYMkp+WY0A1PCG8+8VbZZ05Y+leUY1QmnQO8aOHlGdWLeIPz2J8h/fmI+jPdO4QgzRrF8E8YfhEtRzJgXN1crmDQfSUxRuYfdTFW7+Dgccpj9XAaZQxVRl4FPppnq+kVzhM+a5wnHBS891tos1V8juCthw4tgXMHz1nBucN67tyB/VgPHHFCr6FeYlHVqL/5RP3NZ38G2TGKHbdp7Lbbr+R8x9uve8Tbr14Dmn+5TUof8/kg9vksUbl8EL9wyMlF9nszv9BK3CMxnyhTRoKf0e3iES0vW81jtp7fzPklBMyP11VABMyvRtV9JsngyOPPJ9dS214/5ghFJYgTRW0DRhy0v0ai/hrlfIvytY9p7Pba53rQ1tppn04BZ8Ty1e80oDdj2idqf4bDa2dQ+8TktI9XOOTkDnvtI/ZROyXmExNpHy+mfSZHdGPZuU6Y9olj5raZyNw2T4G5bXb5yB08CY9LKKg4cuMaV1BxCTm+DewWlGNW/3BMGM9XNxngd2IaEnXeeEMXk5EZnlQxOZUXk1RncoZuUhK77Q1dDD3fRYljqzPWCxs2nXx8z4C5xlWp7QVFA2anxcyZfH72T7BR3NwoJtUodkGPCyVEkMiZuBSJnDE+kbPQaq96smbC4ItV8smacXZcIOUSVsoVkN8FN0maV8hUrwFe1gKXMTClLCZkdBZmKDS5RahEku8zlMhE2feOnC17oozrsfV3OlxcSGFjiW1xg1QfniJSxXQi1Z2SpAI5NWXmVB/7pyjQnXzOQD0No3o4qYmVpAY6IhT5gB7MB0znk48alD2PnQsuIsrLXMT+TGH2psQbIVn/jOfmtBo3b0JSMTjsrCq2cjQ2yydsMCMDI7VZyZqMS1Zf/dKriY/9vcLJYNY2dCo4CGYfHLaOtUqNiNeCpZpyYE3GLFiTsQqryZhTHZkKFZleBIk0xp/rnS0NBumjh4w5g+RqR5oSvKBU49vBJFojIzr5f2N6bCGRHltYvh6LifXY/1W233q5lUhpRI9lVLGV9Zggw40ZGajHMpJ6bOWVr6x64Tvh+52l5snz7kJEjylqi9VIWUpIj2VAPZbD9FhWdWQqVGR6wTIP1xNlTWYk9JhzyJgzSE6PpVm5hfTYnUhdCR+jyYSbne8aP/iOyg7AUJRQ9OoO8CrE7UaPryGOsBH7KG14mflZYgkMmVIXHFYoq13k0zJtRfGUVD75L8aAvw8P+O0TqNLk2bGCGwmvAfxD5FdJ+FdSGw8/cscyLrVKQtPyhvGDn2A2cgmRjVzC/kz6DpafBYDkx4hIpr5mPpD/UuFAfkf3SPt9nUPdB9q7u4a6R+BLeEnwSwr8kla7hDfJu2dBrArwiw/8EgO/JM7KjAweJ3aW0gqxhQ85ghOwRatJ1enT32Ki/hazP4O0MMVJgWnsSAC8lSgA3sr+zPasIOV1fObXIQySVz1uQAew6aKLvJRokZfO9jcl/S0j6m/ZFAjpMuzG2FKiq61L2Z9d6v7slQKY6JBwohQS+ar9BnQLrhTkpxuDj9VM1cGhK34IYgd+aRC5a+dT6C4px49ofwmi/qZ0fvJXZY0VascGCd/uRRD321ythpk2SWS4k+zPkP5SRP2lJPu71PNbStTfUsQRcqv8wlIJ5bpd9Y4jehk+na/aakDvwu5QzRyiE1/ONVbQfm07wFClk7XN5quWG9C34muLESiNzGqXwsKnbSOyGbQQpnwYl7EdFqLnkCi54kFVSj1KXgVHwnNEdy/akLt+lnsNzxfCKJu6h9esXb91MoYyPjhyRnwvoQ0OoVSdQW8nJIW3E84C1x+SwHWJXeLfZ5Lif88mzzoYlE0T/CuiHXNE2jHH/sxpclqVcN+dut8+OS2JXiNFXQDrHXOTMZcpxhZ7vP2+PkDI7wYHLKTFTpwWyXzqsD0tUggtOnDvEqmMk5SiRfKxvUNWpmHx4YVYTsSIy6fATC+XsJ8PgMtln7n6DuEhQ1WtAf4gXvzmklXoUrzi8w4JV1x4ABPFkopS+dQflp2LMwdJLE/zy83qk8KafFD9whO64NF8VaUB/mF8wZ1dLJRWJwnbRmk0GuZampPnMSdpTlIpAOU4Pjk8BcCp45PLez4Nuj5Z3PW50FTF+cG6AhydFPDvaRsHCBoaqQvkY5eCJqRrSg8o9wp9IyzDW3uOgAldUTjMuHu0D7TMUZgE3DWlLKsHbO4iAsTbJ1RvKeOh2/rPYeu1hGi9lrA/u0Qh+CUuX4oruR2wp7WXyNPay/4M6S9D1J9MrgwuHVsk/LTn1Q8I2NELjghyf2mAfxlLe/DhFwmla5L4WXQ4R8THpDAgo/ITJWOYRiUqdJH6tjGgb2ADuopoQFchZPIgHonX9TIYXtgj8RB5JF6UVnBiEK7dAgrdXWXrQ/rwKklkZTCWqZXB8Dkog7FMsQzGRTnI/kwsKN/hmdJHt7vxYXf5/ETXZv3szyBIoROBFGpmOPEKIh/hCvZnEKTy1WdfPvVG2R7iTci2vtwM7pvUlZagjjUzMlChJSSzrNf+Yuz0xmuWvOUsa0A+angFwwxlPk23G8yyToJZ1gkwyzqFZVknVUemQkWmF8HpemGk7yJK50iUtK8jQC4d2rTL0UWz2QXC42LF/1v74K8PKZ6yE693ZA3+sma/+GQUp7MufuA57neW/5Ab1JaiFoD7KzwZ+E+DIJ/Hysl6TUoGm6jtGzFR861lEwGRRG/TFU1mZBu4wcSkh81G/IB6uV6xdbkABu/X/ET7NT/7M6S/K4n6u5L92SUKeV9pv6NMJ8rYUW4W7yg/Y4Cn8WK6QM9+PqwTt1W8ktVn4kJRTVfbV5+B8nI3S/BmXOSExTAnLJ5PN5TtKGGOdMKu7sXbgsgblRska5wYCWP21EnY156Uj/57YHsik6qWsjv59CukYHjgg8000xBEFI6lQ2IsOWQsfAqf6cqtSDyydxsSDYY3gzjbvEP4gmLmawbwcofANwqB09cawKswHbSSKFyzkv3ZbLiGIlwTVehupTbhmmr3wzXVTsM1VjlgSjlvBKWPp1sQkYON7M+Q/mqJ+qtlfyYPudGWXwTv8ta6wC/BBuD3+8S/D81R55cGFX6Zgz2v7sOfyGDW13heHQ6CeYiCYLJnFJuI+ttk+pkgvyPdVXYE9APgc3gCGxJWxVa2IWGkmDvyRnZYMnr26xv3fOX9//wL8LWDML9AYVsBFpQG3YREzxTryj4ERs+iYPQsDEbPYlj0LKo6MhUqMr1wjB62jZ7hCwMD7nQGyEXPQpKi74qqEW190/cxMTCNdF8LUX8t7M8uUVJCC3i2XApiDINmHNi0M6En0QWAUD7zOQP8CB6YlM9NsS/gHXJewDuUTx9TLuDNEMF+RiHlEt6TY3qwbHuFBTHCWAlrLxxfgqPQXrS2rZ/PZoDtckhtnjF1u4zYXj/R3i6E0gpzCwTq3/gzSWZRztu6/06N1B2zgLOAv5+A8OaifMsdktOW5Xfkh4OrYQkjoEg9L/szW0g+VAs/mYCY/A7T2ARJqeln7N+Ki9qfW4TtzgLkrzdMnqV8oTim2u0S50/PlXERwSckSuZhA/xL2EWEEMq8UfTIMIy/nUHjeETZn8lD2m+zQugbeWFbR/Pr7MuScLjIb3dc7TefPBt6qI2jLoO6QsFVCSHUXcH+TCHcohgpCKi7dUhCUojIrYuhtFJ8aMzOUCk+ujAdAC+ZjWPY9RIlDYRcdg8MCwBVr6PohimJOzXvHPj5dw4YYlu+dSDU389OyvLtltKfe8REk3s94QtI1XikIg9ynUcpqy7K/szeY3i9jIyVsDBslxk1wN/ATovBF57DyrXlw/n0b1x+yfTJMs97dWJ8Zeb2GMz9SwXmNt0sQXYVMUW/0nS9BFO+YVWflKmZ6yTVKqSUQON36DKFXc9yCLvvMoVRl8l0IvxF40S488CWzsHh0b7JJYPup3rEJ71hzxlhCVLgmB8u4QplJOyAMhXUyrdePEsu00l2pmo8iKoJ8aqmgHifujIxzueqX0CUCRwMbefvVTJjtu6gWLa220GFzDso80vWFtwwJBMyI0C2eWazAo/1bQEq/e9NJmUN6y4vUYqWdyr7kz+k9sLq1yPhesUQxA5HZRniCGI7ljkdV3APDcT92LN+CYU8UAPxLsyFVSlZyCzodrxooXyGKIO5w1GOaBaZ+d0cYoZpqJA7yoxyG549CmBWoZg8p+eYphBmG4rJV+SrYq0LchXBV9B48PE2Z+3a1KxdRt2/aYP9Gx+Rf9OmUhSlnR0ap/raWe8D6K6d764d0aYMZJAeMkkP6aGHjNJDxugh4/SQCXrIFD1kmh4yQw+ZpYfM0UNW0UN66SH99JABesgKBYfWB+xonyvsaN/uprClPXVKYdNpfAmLt7sem1dDxNvetMLUQrbHYl70WMy04xFdgM3cjxyLsbsBsYOBXRPxuR5A8bl/TcSnck3Ezw7N2TVm+RsfZXO3EVIRXwrxOOFt7OZGSsIpEOyJUnJB+JQ4SD5hf7/b8Z3RzAOG7PxUYUL29QHTIiow40L2humyayxMj6MjB28zp6SOjuS3/0zMGS5emWBOgNDwu5Pb43HRbW5mFNBcUJNhCoYI2f4R1mTArOglOmnzwquuIsO7xJP5mCMZ9rorw9BAgFnGcU2Vymc+ycwSvgRSVB2Fb37VXOBCHzWcMjB0eECJXHY0FsSm0ixVsHp3CfTQKmVTe0E+NCqlJaL2mWUhNOoKHf8ADBPCGSaczzxrLxZR3FeRDvWialD2/NLnGltHYbaO2bK1UEPb0SghSuxhVl1Q4YehF3YtJcZfS2Fpb1xMQe6OXKfgumJFfa5jf4b0V0vUX62EYRJAXme7WoFLc+nW26J26Tbg4NJti+KlW3jVPESrJnPE5QWUnB8+nmGuMV6vsK4BZKTXsz+DIJXL2gXymR/xHn1QTYM96mLaw6NO0h5cvZj7rZu+0/XPf/bp+c5y6OVt3fUMM5SZSXBG24u5Z5SoyNrcS3cxd78zQOxibvCS6zbh3uTHyMXcSz+gyW3E61oNKJPP/E+tBhTPZ/7NPt4UQPzm/dgsApgd8xDZMY+EHQsiM7gLG2RQKaXP+HM7VpUlpCD+DOYO7LpG2Mme525s86KS+8KMchtV9guDuZMq/8UUXCHKgDEFXZ3kwHiQK+ygpUgh99n2m4AEWjGbVL7CbnCMvfimlC+wT44oxxv+DF2WdgYM73jK7tfBKVAG9hlTRKdANi8VOk6j9QPv3LmdRrvNzTTaqqk+b0hRptFWOUmjzbBj5t6kZMZsPXFlHPyMXRptypxG62e7sOJmIJmQGQHyhJ1fMo02Y06jXc0iICNwcOqs+LJmUl3f5Nw/dc6pnDpXsUPj/Dnma1Ih07EKcREZyDQ9ZJYe0ksP6aOHDNBDBukhQ/SQYXrIKD1kjB4yTg+ZoIf000NW6JD/whhHccQ94SQDJgFvTGAf0mF2l+lAWZTdle2Yze6aM6Ozu7ZdquwuJmi9QIHcWOG+BezPkP5qifqrlTDvAsgFTk4P3Dgi9NWrHRFGHRwR1pd3ROiT8E0UVy0oySWXunzlNUT9XWP6mSDmnH1/2dr5If6uJ6z5lavOKmt+wVsjzMhAqxCTPCH86oItH/j0rWdvUgjJ2idtCLZs1yAnhIpBkveAJ4Q58IQwBp4QVmEnhDnVkalQkelFUFHA7oRQ8fUa41u7M0DuhDA6lapGdEKY/dAUlu4VRp5PazWgTD77UT2LG19L1N+17M8uUXHja+2LG2c/DfpC9sWNtwkr5OU+aoA/QV7cGNQQWKVDUzhaNOTsZ5wXN94mMaOo8tnQ5Jg+X7ZFx86GYpe8uPHUlPEIqpXxMP4MI/cdqpH7Dmnrt1thskqcahg5QrW75E81/Cwl0OIg8Gn91Qo5BdgbKlezP0P68xP15zf1B78hEhVHUmZ4oSHYnQ+L3DaGsPKrd7Wti65QDKms53EUX78OX4LXry+xgDi6w0CU44NUjpHJ8MFq0bTj1xPks3GQyjHl1qK5i64WjfHndkeZOKqVY5hodkZhly1XOcZhlZdteJUXqyFgDwhtQuolVxksgu2zv9QWFT6FnltkgP+UCdlCXrtu0X2ve9F9L0XWjgd6Fs/lrJ0tbmbtBKa6+J2XMmsn4CRrx4f4t36TfwuXnvPZZe14weJ3fvS5cOnidz77h6stxe+gA0tA/URM4sSpH08+5zOuzNUrpGnaX2f0yb005BUrxZD9Ztx3TnTMGjGpbxF0XVHL5iIKyihiO2E/evwbYTmFH5c/n4sjx79+Bab1mdO3aiTcR79ogZmhQ9nqsjP2Cm9L5bL2i+x18shVwPkjV5OjqmFHJbI7WwYGx41T3rMOchh84JdK8Iv3rIzdwKxIkevrZJILQO7ygNxlsdLPF6i1tbuve6R0Kn7GAb1Ktlo429lEiN+3RIgtriRChL+PBflVHnb2ycU70UMFP1F/pgVW3pwUcO8Vm8rV9oUFfBdcJAAVDNS3oyFkoNE+UX0yhNZtrBcoPxCfrXnpcDL6/XyjDnYi1tEzzvZ+J6PvmNLR+9jRQ1sFgX7e77p+3g/r5w4i/SwkFsFWtl2sFfe7vZXd7uZW9lY1or/Tyk3vBLeyt7GUs3y7nV0ay7c7ytjK3upkK7ufHTN8qnQ757cx6m+/nd/WYd7KtrNdWHH3QzIhMwLrT0x6Qu4Cyn6zj7kb0zQu1N/0TmV/XDwGVpa3qIlOVl1Z3gIry3YiZXkLSiv4HPUWno63sqoM6O5WvrtbkaVhIJP0kGl6yCw9ZBs9ZJAeMkQPGaaHjNFDxukhE/SQKXrIDD1kjh6yih5yHz2kjx4yQA9ZobBlbncrRFHyUoCTpYyTIEVGYWodtjvUNjQw28GuO7/vb8vn/hAJRbcxrdUfsmh3fYPX7v5DFu1ohAY+NWvnuXufhJ3F381wJQC3XczbbQ4DcA4CmVgFTp/9cXwUzQyB0kmAMBmTL7dZ+CJ17uP2gbI4HkaVTh6Js+NCElISU1OBMwJX4IyXbjeoTNeORoJ0GFNhY07mUiy9sNzpuBPu2omU7Yzap1zjtauBRkmAcRk6bBUwbjKfe8ZRRWX7gCFeUZnnzSTTFEs2ioGMm3KvInLalnGFxY3taCR4WSvDrjrHmlmWXlgqZlqqyDn3FG6yZE7Lv4NggN2BVCAqv5tUKYPe0k2Cy97K/TXIrvYCtEUgQOl87gcG+N/iiXeiK0G5vysyXcNOrHUSkxefo8cboBmncJUxOeNvGYLiAYUxWaYwxssRxpwTYRSkFuZMysVJHYeESAvaKnPZMgIJsUp/hXHeMeuWtnkn25GBktA7qecdvUOYRlcVqx6fhiEFZ5eMwIOssrXniHUk9s1ywnylKhMZufXM5XOvGTriHUocb7+UVSinpVlJ4EdWlc/9jOE0RTWTY62aUM38wr44pwT4O8Tgv7J3e6pE1tlOi7SJqqww40IYvw3LXk7ChyVV5oMdptHN3N6d+Zi2OzBqMx/C4IWrkpLzSAlZvCpsGNG3yn77UqXY0162F0dLmsBmC2JWGXcB1yvIW4lMVfAkDZFQxA4yngjsZN1pjCCsoKcToH0wPaRS8tLQDYDoomRVXOLNlDJ3CJ7HYKckauuUCMhi/7YU/maKB7V6TegOIaqwtVV7FSX1QYWNJANwYxme6jqhlq+aa6/lM06WBd+4pTAtn52SzS3Guhlb1s06sYQClySLsm4O9UxjEh5iyiHrpgzWfQB7ezqGqfqMs32Fx1kE33SvSRTBr1pr75q1O9km4Ul4HmdJeICAG/XpRK+Bteer1kvo/GyZG9EULDjttoKzDz+Wks7P28fShBONDpbamOC0o/YipyD+UmKVNcSqQ8Eo2gc7MwC7pHF7kMlX7bS3B1kn9gDXdWn8qiOqcaaArXO2bC1UaeXtjAT2oI2lF8bWOYQHDacytV3BatgXkFJ9MFA2vJ1UGGUKDb6eh90Rpr+lRP0tZX/mbriX6RPxs5YShZGWsj+DIpEUEzON3TaSXXW/qnZMYMZ0Uje+z4A+hMexnbK2TykKZ2Sxu3XcE9DMI06jHrFKNDZtNc488TLuEc+l10OzNhFOxbMyEyO5FuhuVJhNskz+STj2MlIzxstIqHoZKQn3OIPEu3aBDABoaWbNROeN2XzVWXsfNueEu/B9agZjoCqM9dKuKaHpxV1Z1OQ74i4smpqx9xQSj7ffB9ndu51Ed8EarRk0mGGKAQt9k/P2wQyMTjeDUig7roxYFp9G0iTZWYnTJNNImmRWTRT86mmSWThNMk2UJplFXW34pZ2sM1coh4o0Bpmkh0yVvabOirak+fRTIOuxCIbcZjPqMzTskb/NlmDHZZUKRuVlxFKR0VUqMu5JRaZ8qUjPSgUiFZkpl4o0Oy6ECI91rJEo6aogM4oVwpvUZSbnvszkUJkpt15748nzm/s6u3o3D4ydfGrfQFvngZ6xR4UKbY2Qq6tEOyaqtU3ourYJ99Y2ccnWNq20tki8sZUo3tiKmHK34o2tfMlXLt74c9WdbAyLN076zm8Z0L/EbjGksWAkfIshUebe0jetksFjNnme0HUXhwGumBHgQmbDle3awgKAuoBrlrU9D6ySq/aVFeY9VXvsa5Bl7dMMxcGaar8maYZZ1l+yfqziVQ4vUFVlClQTLFBttgIlyFRoKzNTIYZexcvaS6mh3ey5uh21cI6Gn8NWEUy0yAGMnMUZOZevrpJItWhzj0VyTlgkVyaNsyiLVDmL52WR0+adSOn1LGOJ0bsg0KUCNCaMmY+k8B2r6oX26dlxu6pjnWLoJfZaM4lfiZU+006yo0Jqcae4SAbTMl68/cq9aH7xwyTn/w7/D87CTluMm3AAKWH6Y/UaY4kEz4ikytuWJJFtSVrVRVfelqThbUmSaFuSxgWmzJ3ufHxbEhduS9jgGbuQttkC1VeriijjZF8mFtJNBvh1ILhD/zJehE7epiTK5SXtJDD5RzMbvNjGMEaexla9S+ICXrkJw89Nq/SIuAILpm03FCnZa1Fx4bNq1fuwC3heliZYWpvKnKSOBOP26iDmJB8zbhcBuEesQe60N/MJJ2Y+KaIPMypEzJNYtCHqWrQhAQtb0lbYXFCFHtS3jaP3RpMygYPk9c6un0BsC9btQGJQsXz1gKOqHfYcSFq1I87qDogD42VyYBLmwIQtByad7G/tnHHFqh1etm+JW0rJ+SAH2j/kkhbeQat+0FCwf4zVXkHvkcTtL/aBQahV4gjXQ/Zc3uYk610YlWHGhUQo2hUGkrMV/3bZuzJtwnsk1R/C7LXpzhz3Nc6Cc5uC6BSdbTIOFFd7mVkO5ZPPqEGo15GTz5IQONLxEsKb+GYZwpsSC+9/M8b939WENy0hvBK+/iqxr/+YjldWHOT7gMKbk3W2s+LI5GdIhDeLrXkCW/Ok6qlBGj8Yq/4zid1d1L3UyaytuReyTnnppWm0vEpGQZHYM1xGluGiYon8S4zhEixNsFs5UUbduKYmHy6PTcZOik2E5TUJwwYYnRh0KzbIV/8tF7EzonqlIV1xOTykV/7mN//4/A1rD/HPGRdZ71xb98joUL+xPH8lfO+qOm9Q/u/5t1IKWFwtqUDxyx1G6/+Pt/dBI96L/7cRjveGzlnjvIzYg2WTsZc10bc6wwIahfLV/2TM8jvI42iCoRb6vE8A681Xv8yTTPFJ2znIa9YhRCaCxoT+2dmvDNa4k2cNBqrEHHAvfqRAYKDIxGVKS/1Xu799/fd++j17aSmzoz9c6099+J27d7re0bdDP3vzxb89eMr1jv41fNM27//5ofkqigZ5Rp0/VgqwKw8IdBBwHgw9JHqwJ5iv/rWE8+Av03nYBDsPQVvnQfCqcNDWeRC+Bc3QhDO0YVYnAaCC4rMBW+cBf+MvYFKFgjf+qv8Lcx5Mmgh9V4qI1Z9bt3xD7NaFD0qw+kUeLvxzsMRVQgchdI7PxGFW2eoehPI1RmWjmoiZbwOlroq/qAZ+oZwVB+SHV1gb+EoNTD1HSj8w/XslJAWFf44KyGNgVXDkieZrqiwLEC41K/KJte+wuO+IdXIRSPqKgNYGlaUGxRVJQIyo+E6th4ivfxP4yMvbvvvBl123FX/y5p51761p+aWKrYByLQUH6XE18lWoH6TH4YP0GNFBehytr4AdVwl2V4YXLh95Z5OJZwFnOKBoR1izxVBkV3DOmun0ChiOB9moe9GglMfRDhRyurgvIfBLGPxSAX6JsFOwfDOMwj6wMp6xc67NCW4ySO6cR5E6mNjOGYxZVivtnJmQFfjCVA2C2MEhVjMNIcRaBJF/oIx5kbcWQqxDEPdziLVMQwixHkG8i0OsYxpCiA0IYieHWM805HL15rK/Q9+za2AaAe/ZmXoygYlO32q+ZiiX/TDvNsChlAcEsA35mtt4GZpLF0qZizzponz1xALVUAYUlqcq+NoAc6BXQq97EQ7E9bqXD/EQTtqLKOIYZUcxUKtXlb4U2bsXIuNcu/J+dwtYfG6+5qMGdD98qlC8L2JA2SuWuegevt5mVEP290XqRbcz7CIL+KiqTAMUjesIW4sAPnnnHwuYy8oLMLh5/IzmSlB6PjonBmGeYE7z8zXHkTnVs/LgRLqhpKF5xaW6R5g0VHPS/kR2LsIAYJBrPkrjeVjS0HyFgcyz5UR81eaxwxOu2gck3x+oEilsBhyK250TMxOyar58zcNG0LIGCc3n+CeLzpc8NXivWsOn7Z0veU9chSzGD4KvidfzebewfTGXqS342ZXqGtlOy3zM0Ml/gSkSXsvMk9Ay851I5CTD/am9RDaKhMtOIpv4Ro2YRM5nmioMxF4im2QlslFAoKZ8zZOSEjkXlchGbMW92IqDOrjRbsVFRrgxX/O0xDHH3DKPOSrgY45G22MOIevY8Vsz36iJpQm3OM26moAvS2bAN6Je9FxG2TiwtDt5p1UA3UvpQUNeMo0zzlBQkC5jbHXgrQe3ZWxwPcDcAAeYvUQB5gZ0m2ahhsnb5ag41zb0OBc1JLOAMx3QzWBHA+IAEgcYoH2/j9/3/4uql+nDd9i18w3oH8Fn95d83/+ao32/r8x9v8/WI/8Zskf2mXYFsPNWpdm+/1dy+/4G7qNJQqConpNdhjdf81tH+377y0Kq+36vrk7ff0pmYvvQZF/afX+t9/dq39+A7Pu9zL7fWfIid67IkIM7WWTIwZ0tMuTgThcZcsDni2n+fJEhB3fCyJCjdMaokIDpZycGzzSCJW4ilA0jFKrkLSyzAPCKVCCUjRaTTpQNs42xqW026LsFsycxLBhQRRz+qV00G/4xhicK/9SulFTMc1HF3IifHCAr7iUO/9Sumw3/vN1AU0+gdiPGcKaIIhYcmssoGwcO105Es85ldi9lpgA++s0VO3958+vzykgBDCMRmgo1rv0r9QhNBRyhCRNFaCr4ZQoz209rtxG1br8OdRvhu42w8+Y6rlQtEsmFDhl0KB0SlS1TjpWoakbtnYj7ExNVZrCLdUTR66M6AMZEGaTMohXVRDsmPo91rLdd0LW8SwpLpiKz3KIumZWwZEaIJLNSJCJQ7DTKDg1ex4PUjDGhPWA/NeAINeBR7Wk4RA04Sg04SA3Ypf2Uj2g/wj7tZZl8lQ9pL3rj2q8yOWMf154Px6gB3629pOivvsinfIIa8AA14EsPak/Eo9ozov4u7Kj2UyY3e73UgMOzHucMkJTxWTuq35T19zj1V7Bj2ivYPu1pqL+D2D0DHcQB7bXDmPY0HNde9vRfFHKFOKi9t6Q/Hw5rz4czyUoZf1a4YKesWS9MFpbKaXgF0p3pqN5ajIDpzyt+T9mozOEpuz61g/eUo/ARZiXREaZg9ZgSVfAJfRTNhapQOoyGV4+B9NNDgglIfvRcF2gUQCn5ue2Tw+g52H8hi+XRz46O9PT1jIzfOHDw1KmzJ5/Z3X1oYGh8svlQ9/Bwsc3Wk5/Z2d05uGloqHOcGb9/P/D7dvHvA76zJ8+19xwa7OtmT/NPPnnxh6dFH/dz//j2vKxNLoqMD6/fKE9iv5wY+8H8XIGMKpZQW6IuowFYRv1EMhpAaQVnsgpKOxqq8n4i/Wp8O0wNOEQNOE4N2EUN2EcNeIQacJQacIIacIwasFf7VZ7QnrEPac/Y/TNP24xqvyj6M/Yx7dmmX3saHtXeBJC7Ise1N1ITM48PZ6A+dMHqQUVUjSvvdaDODAAXmphLhF5BWn8gX/dzA/zd/M1FeHeoWENjufru0AvvDj1Eu0NBnUW4pgpe8dG4/dMDdSYo++9D+MJnKwpOAY9RA45SAx6iBuyiBjxODdhLDThMDTg081Z5VHtZJh9hHzVgPzXguPZsM6A924xpT8Ne7Uc4of0qT8w8I9Wl/aIMaD/lE9SAB6gB4TytWddh6rSDC5YeKUEVVtjUYcXzw+zPFCpY+tT2oF71DbDP/QqWPpRWcLEiQSUt41j1DoXOmN22/GE3M0Ky1ADfMuD3O4FUAo96asAyldQAD/YgEMj7ig8ChdmfwWWrwqBc7LM80ycS1CCRoAbZnyH9eYj6M4WiIHqDYbcC7r3Ch5/qfsNUjrJmVrEPyxYyq/jom8yrRfd+6ssHwMecBBot6HpSVhDWaAEijRbkFzkAarQQOzSOAUISDCB4VTSE8FSIVaHkkOWHaYPgE19zENoFwLpC7WIemWPlkTkm2b4oGg17zCW2mN/MQZRVCNMNfiLd4JdgjeIr1Y91rCki3V78405hpc/6prLdjKUuCvxSJwIPFxJEsr+CkiWwHtvyiYprb+9cqaAM7N/8DeHpdWWWqloM1o0Lmb/4eSoWvpgKPBaERcQ6IdWRqVCR6UVgqe1cQXxhigXNGFYB1WahUcjKhL4StUzEC5d+YPr3ihLdhR1EBE/nGlgh7uncSL5+GfR2cdigmLXvoLjvsHVyYYiJi4DWBswBZOG0r76V6CXa2N/8+d5X/31wYRll6JgsVFkNg6nmwrd3la3wvJhMTap1CS9FQRsrKpLfqWvjsPvuVxh1v8otMvhfJ89v7uvs6t08MHbyqX0DbZ0HesYeBTYd5wWbnApQ2/r43Q6vh43KnA3/Uban9V9lc+d/2pfIrwfrV4bsK/GK8gVC+fqdBvh2bIvqh3aGIVZUwXcpw4/vHu0TNgrBdrtYml/EBaC7XSFbBj8ooEdFvn6PfXn+CmfJGZPgN9tXGI6gEgc0ElbfOw+70IzgVHIbVmYaFYUNK7iuFeC6euBGkQsrW1LrTGuwydv+gHD8EenBhVEnx6QX5F1JqSqxIUaAS1bzyTIvSQRAazQHcdM9YFrSreqbO7/hr66S39xhhcnLcR1APgiY+cDH/gk2CpobYfXtA5T+ToClDiIP0JQ8KGuHkJyw8seO7RR9lB0ZYO8s2+zWw8FQQ2rHVM2uFzczk2b3AQP8mJTZBf0zy/s1t7GDADMaOcsaLqkxyC6J7KrRiAXipju5eXoPY1Uh/VPyRN4HTtfe8lYIBhDO1z9mgL+fo3fYpNCwi7iwSePe3a4oGTghRT5iDOhDWJ8+JE5XYUCcBon6LuY3LhhKxBv0OfMGBbLODAzpb9Ic7hkArjRHLgTtrH4O8xRIBHiiPeLcFYqww0YoYfJrKtnRO3C6wqg9qbC5Ey7v9XhBr8cr8nrGMJFDHUWIL8PoVCIK29kQOBUTXUuqqcz4yvt/+LvvfuhY7S/s4ytldnTtJ4/+YXTds19wvaNnKv9h89c+GX6XSsTIyg8mBxURci/GST5MkYJHBREmrs9r79vF2vsvyi7jPocnFwMFWW7h01XM8Yxw1/ltg3u/prqltYP+OrOhhQIwwTIfUPHDD6hUlKLC8tvpijK30wLdU8nqW+hKBw9q73UF0WhGmO2WX59gvv5F7AEVD2oavLJWOYAEbW83WO8XZXvqIdDJmYO8i+VBqgJ4kZfDfMjLYX71nXLQ2Cn/EtkpT4VanAKxjdiKLfacxE4b+cM9A+d8Hlb0hQPY4pmyX7ARB9ARB5G98U678RYl0948y08F3RCgGy85y2TszVktILJM/1acX0NIwTYEmc0oLDQRBbYNwIgRloFBJ7gSCX26JbsBt0yugCdNVHAuCRWo7OL72DDDK9qz/k471m+IG9OZ54T1O8hZv2OW9S8QQW/Wn6c/63fYsv4CYzrrnLB+Oznrt8+y/gUi6M3666aE9RFWC8Khe2w7i+VYV4BL6in74cSAeu5KBM5dqSDKXYk4yRasRAlcSld5/qaB4e6eAwP9a2/qHjo0OjL5y4H+MyyD+9n9iX+qeJwoxnf1gg/X1P/d4ajrwcSAv/5jjc/efaNSMNEStWezee2i9pazYSNw0UZ5Mg0lYXvKTvJ0IHkhuTzdciQvhEoeHKsJia60FNrdoRDTDyMqcToAYorBL2ElAo9v7TkCnNi026eZNYAXPIP2aWbiQGTDFwzwg85GDWYeT8ov6HuBN9e4A3CZC06Bc+KUMoN+lgNINjn+7VsDgno9DZ8wCNMPEwYbLnzxRDYTTpwZ2DDEnNmjWX/yvkoIDoaY0joVTykC+ClFw5ijtDuPE2chwo4KTbtDTj1Nrn+Y9+F41z/knusftnX9K9CTDUGFLIZauIMul3bDB0Z8Yo7+A0PWPqFgusJwGMO0AvKIAdtzHzyLNWCSKBHHf4g594G0it1dx3axwvqIvTBVOBEm4QaSGRWyRUNyQD1mYTIZKjhj3DVh8tkKUwDJMe1A0zvwzD+fPe97hPaNyYeDbsY9tnfIdHpuygMU3Yxr+KQxmqfR9LdLfjHYvYoBDlz1qakYYC+qAZTACptkH7tJDvhtLmZKsoyDme7E+MyH3E71QtcighIjCiudP4UkDGOY94Z9tt5whPe7w7aNxJkoEdwETxqmrxh3bt5BnIvS8NUp8fLCNF5eSMbLczHAG3Li5YVkvTwHkB2YSFU4c0VVUpuZ9ky3omSwhpfsna0IwNMVGE9PQn/LnqcrnfC08K0bZlTIoUUUS0w18XSQbT8FO5egk0OLoNx5nQoHIsdLoTJ5usMtnv6BPU+HnfB0ON/wwynR0xVYxKFSmqdNVlhLPY3lOLej0cYKTOWG4AgcFuzF6psEVQLjYde97bD7gfEwWgvGgUZR8rbDrLdd4XcWWw46vAMZZKLLFulQvsYvXNpS+NgQOgNfXDLCbx1IhWoKt7i0BHJTKlDqii8xMbcSqhdhueRlVy+iEqyeUQEVsahURQpbkEKOkSqs9TMqS5jKg4Kggo4razT8V2GP978B0AFgL5+iBAA=",
583
- "debug_symbols": "tb3druS8da19L+9xDkRy/pC+lY0gcBwnMPDCDhznAz4EufddnOIcQ716F5dW1eoT92O7ezwSS5OSSEr6n9/+7c//+t//8S9/+eu//+2/fvvD//mf3/7173/5/fe//Me//P63P/3xH3/5218f/+v//HbM/3D97Q/tn35z++0P+vjDzz/6+ceIP/px/lHOP+r5Rzv/kPMPPf84U/qZ0s+UfqaMM2WcKeNMGWfKOFPGmTLOlHGmjDNlnCnlONafZf1Z159t/SnrT11/2vrT1599/bnyysorK6+svLLyysorK6+svLLyysorK6+uvLry6sqrK6+uvLry6sqrK6+uvLry2sprK6+tvLby2sprK6+tvLby2sprK09Wnqw8WXmy8mTlycqTlSePPJ9/9vXnOP/UY/35yCtlQk1oCY/IIhMemaVPsARP6AljgR0JM3lMqAktQRI0wRI8oSeMBX4kZLJnsj+S6zFBEjRhJtsET+gJj+Q6//mslBNKQk1oCZKgCZbgCT0hk0cmj0yeFdRm884aOkESNMESPKEnjBPqLKgTSkJNaAmSoAmW4AkzuU0YC2ZpnVASakJLkARNsARPyOSSyTWTaybXTK6ZXDO5ZnLN5JrJNZNrJrdMbpncMrllcsvklsktk1smt0xumSyZLJksmSyZLJksmSyZLJksmSyZrJmsmayZrJmsmayZrJmsmayZrJlsmWyZbJlsmWyZbJlsmWyZPGuw2YSxYNbgCSWhJrQESdAES/CETPZM7pk8a7CNCTWhJTySRSZogiV4Qk8YC2YNnlASakJLyOSRySOTZw2KT+gJ44Q2a/CEklATWoIkaIIleEJPyOSSyXF+KxNqQkuQBE2wBE/oCWNBnOgCMrlmcs3kmsk1k2sm10yumVwzuWVyy+SWyS2TWya3TG6Z3DK5ZXLLZMlkyWTJZMlkyWTJZMlkyWTJZMlkzWTNZM1kzWTNZM1kzWTNZM1kzWTLZMtky2TLZMtky2TLZMtky2TLZM9kz2TPZM9kz2TPZM9kz2TPZM/knsk9k3sm90zumdwzuWdyz+SeyT2TRyaPTB6ZPDJ5ZPLI5JHJI5NHJo+VLMeRUBJqQkuQBE2wBE/oCZlcMjlrULIGJWtQsgYlarBNsARP6AljQdRgQEmoCS1BEjK5ZnLN5JrJNZNbJrdMbpncMrllcsvklsktk1smt0yWTJZMlkyWTJZMlkyWTJZMlkyWTNZM1kzWTNZM1kzWTNZM1kzWTNZMtky2TLZMtky2TLZMtky2TLZMtkz2TPZM9kz2TPZM9kz2TPZM9kz2TO6Z3DO5Z3LP5J7JPZN7JvdM7pncM3lk8sjkkckjk0cmj0wemTwyeWTyWMl6HAkloSa0BEnQBEvwhJ6QySWTSyaXTC6ZXDI5a1CzBjVrULMGNWtQswY1a1CzBjVrULMGNWtQswY1a1CzBjVrULMGNWtQswY1a1CzBjVrULMGNWtQswY1a1CzBjVrUKMG+4SWIAmaYAme0BPGgqjBgJKQyZrJmsmayZrJmsmayZrJlsmWyZbJlsmWyZbJlslRg2NCTxgLZg1amVASakJLkARNsARP6AljQc/knsk9k2cN2mz5WYMnaIIleEJPGAtmDZ5QEmpCJo9MHpk8Mnlk8sjksZLtOBJKQk1oCZKgCZbgCT0hk0sml0wumVwyuWRyyeSSySWTZw2aTBgLZg2eMJN1Qk1oCTO5T9AES/CEnjAWzBo8oSTUhJaQyS2TWya3TG6Z3DJZMlkyWTJZMlkyWTJZMlkyWTJZMlkzWTNZM1kzWTNZM1kzWTNZM1kz2TLZMtky2TLZMtky2TLZMtky2TLZM9kz2TPZM9kz2TPZM9kz2TPZM7lncs/knsk9k3sm90zumdwzuWdyz+SRySOTRyaPTB6ZPDJ5ZPLI5JHJYyX7cSSUhJrQEiRBEyzBE3pCJpdMLplcMrlkcsnkksklk0sml0wumVwzuWZyzeSayVmDnjXoWYOeNehZg5416FmDnjXoWYOeNehZg5416FmDnjXoWYOeNehZg5416FmDnjXoWYOeNehZg5416FmDnjXoWYOeNehZg5416FmDnjXoWYOeNehZg5416FmDnjXoWYOeNehZg5416FmDnjXoWYOeNehZg5416FmDnjXoWYOeNehZg5416FmDnjXoWYOeNehZg5416FmDnjXoWYOeNehZg5416FmDnjXoWYM+a9DLBEnQBEvwhJ4wTuizBk8oCTWhJUiCJsxttgme0BPGgqjBgJJQE1qCJGhCJpdMLplcMrlmcs3kmsk1k2sm10yumVwzuWZyzeSWyS2TWya3TG6Z3DK5ZXLL5JbJLZMlkyWTJZMlkyWTJZMlkyWTJZMlkzWTNZM1kzWTNZM1kzWTNZM1kzWTLZMtky2TLZMtky2TLZMtky2TLZM9kz2TPZM9kz2TPZM9kz2TPZM9k3sm90zumdwzuWdyz+SeyT2Teyb3TB6ZPDJ5ZPLI5JHJI5NHJo9MjhpsE8YJI2owYNagTKgJLUESNMESPKEnjAWzBk/I5JLJJZNLJpdMLplcMrlkcsnkmsk1k2sm10yumVwzuWZyzeSayTWTWya3TG6Z3DK5ZXLL5JbJLZNbJrdMlkyWTJZMlkyWTJZMlkyWTJZMlkzWTNZM1kzWTNZM1kzWTNZM1kzWTJ416DahJNSEmTwmSIImWIIn9ISxYNbgCSWhJmSyZ7JnsmeyZ7Jnsmdyz+SeyT2Teyb3TO6Z3DO5Z3LP5J7JI5NHJo9MHpk8Mnlk8sjkkckjk8dKfky4H6ACqqAGEpCCDOSgDoKjwFHgKHAUOAocBY4CR4GjwFHgqHBUOCocFY4KR4WjwlHhqHBUOBocDY4GR4OjwdHgaHA0OBocDQ6BQ+AQOAQOgUPgEDgEDoFD4FA4FA6FQ+FQOBQOhUPhUDgUDoPD4DA4DA6Dw+AwOAwOg8PgcDgcDofD4XA4HA6Hw+FwOByODkeHo8PR4ehwdDg6HB2ODkeHY8Ax4BhwDDgGHAOOAceAY8CBOi+o84I6L6jzgjovqPOCOi+o84I6L6jzgjovqPOCOi+o84I6L6jzgjovqPOCOi+o84I6L6jzgjovqPOCOi+o84I6L6jzgjovqPOCOi+o84I6L6jzgjovqPOCOi+o84I6L6jzgjovqPOCOi+o84I6L6jzgjovqPOCOi+o84I6L6jzgjovqPOCOi+o84I6L6jzgjovqPOCOi+o84I6L6jzgjovqPOCOi+o84I6L6jzgjovqPOCOi+o84I6L6jzgjovqPOCOi+o84I6L6jzgjovqPOCOi+o84I6L6jzgjovqPOCOi+o84I6L6jzgjovqPOCOi+o84I6L6jzgjqvqPOKOq+o84o6r6jzijqvqPOKOq+o84o6r6jzijqvqPOKOq+o84o6r6jzijqvqPOKOq+o84o6r6jzijqvqPOKOq+o84o6r6jzijqvqPNYD9RrUAU1kIAUZCAHddBImnW+CA6BQ+AQOAQOgUPgEDgEDoVD4VA4FI5Z5/1cnqggA02HBXXQSJp1vqiAKqiBBKQgA8FhcBgcDofD4XA4HA6Hw+FwOBwOh8PR4ehwdDg6HB2ODkeHo8PR4ehwDDgGHAOOAceAY8Ax4BhwDDhGOmJR0aICqqAGEpCCDOSgDoKjwFHgKHAUOAocBY4CR4GjwFHgqHBUOCocFY4KR4WjwlHhqHBUOBocDY6o8x7UQAJ6OEYJMpCDOmgkzTpfVEAV1EACgkPgEDgEDoFD4VA4FA6FQ+FQOBQOhUPhUDgMDoPD4DA4DA6Dw+AwOAwOg8PhcDgcDofD4XA4HA6Hw+FwODocHY4OR4ejw9Hh6HB0ODocHY4Bx4BjwDHgGHAMOAYcA44Bx0hHLFxaVEAV1EACUpCBHNRBcBQ4ChwFjgJHgaPAUeAocBQ4ChwVjgpHhaPCUeGocFQ4KhwVjgpHg6PB0eBocDQ4UOeCOhfUuaDOBXUuqHNBnQvqXFDngjoX1LmgzgV1LqhzQZ0L6lxQ54I6F9S5oM4FdS6oc0GdC+pcUOeCOhfUuaDOBXUuqHNBnQvqXFDngjoX1LmgzgV1LqhzQZ0L6lxQ54I6F9S5oM4FdS6oc0GdC+pcUOeCOhfUuaDOBXUuqHNBnQvqXFDngjoX1LmgzgV1LqhzQZ0L6lxQ54o6V9S5os4Vda6oc0WdK+pcUeeKOlfUuaLOFXWuqHNFnSvqXFHnijpX1LmizhV1rqhzRZ0r6lxR54o6V9S5os4Vda6oc0WdK+pcUeeKOlfUuaLOFXWuqHNFnSvqXFHnijpX1LmizhV1rqhzRZ0r6lxR54o6V9S5os4Vda6oc0WdK+pcUeeKOlfUuaLOFXWuqHNFnSvqXFHnijpX1LmizhV1rqhzRZ0r6lxR54o6V9S5os4Vda6oc0WdK+pcUeeKOlfUuaLOFXWuqHNFnSvqXFHnijpX1LmizhV1rqhzRZ0r6lxR54o6V9S5os4VdW6oc0OdG+rcUOeGOjfUuaHODXVuqHNDnRvq3FDnhjo31Lmhzg11bqhzQ50b6txQ54Y6N9S5oc4NdW6oc0OdG+rcUOeGOjfUuaHODXUeC7RGC2ogASnIQA7qoJEUdX5SAcEhcAgcAofAIXAIHAKHwqFwKBwKh8KhcCgcCofCoXAYHAaHwWFwGBwGh8FhcBgcBofD4XA4HA6Hw+FwOBwOh8PhcHQ4Ohwdjg5Hh6PD0eHocHQ4OhwDjgHHgGPAMeAYcAw4BhwDjpGOWOS1qIAqqIEEpCADOaiD4ChwFDgKHAWOAkeBo8BR4ChwFDgqHBWOCkfUuQQJSEEGclAHjaSo85MKqILgaHA0OBocDY4GR4ND4BA4BA6BQ+AQOAQOgUPgEDgUDoVD4VA4FA6FQ+FQOBQOhcPgMDgMDoPD4DA4DA6Dw+AwOBwOh8PhcDgcDofD4XA4HA6Ho8PR4ehwdDiizi1IQQaajhHUQSMp6vykAqqgBhKQggwEx4BjpCMWki0qoApqIAEpyEAO6iA4ChwFjgJHgaPAUeAocBQ4ChwFjgpHhaPCUeGocFQ4KhwVjgpHhaPB0eBocDQ4GhwNjgZHg6PB0eAQOAQOgUPgEDgEDoFD4BA4BA6FQ+FQOBQOhUPhUDgUDoVD4TA4DA6Dw+AwOAwOg8PgMDgMDofD4XA4HA6Hw+FwOBwOh8Ph6HB0ODocHY4OR4ejw4E676jzjjrvqPOOOu+o844676jzjjrvqPOOOu+o8446H6jzgTofqPOBOh+o84E6H6jzgTofqPOBOh+o84E6H6jzgTofqPOBOh+o84E6H6jzgTofqPOBOh+o84E6H6jzgTofqPOBOh+o84E6H6jzgTofqPOBOh+o84E6H6jzgTofqPOBOh+o84E6H6jzgTofqPOBOh+o84E6H6jzgTofqPOBOh+o84E6H6jzgTofqPOBOh+o84E6H6jzgTofqPOBOh+o84E6H6jzgTofqPOBOh+o84E6H6jzgTofqPOBOh+o84E6H6jzgTofqPOBOh+o84E6H6jzgTofqPOBOh+o84E6H6jzgTofqPOBOh+o84E6H6jzgTofqPORdV6PrPN6ZJ3XI+u8Hlnn9cg6r0fWeT2yzuuRdV6PrPN6HHAUOAocBY4CR4GjwFHgKHAUOAocFY4KR4WjwlHhqHBUOCocFY4KR4OjwdHgaHA0OBocDY4GR4OjwSFwCBwCh8AhcAgcAofAIXAIHAqHwqFwKBwKh8KhcCgc8bqbowYOYLzyZmEhVmIjClGJRnQibUab0xZF70EV1EACUpCBHNRBIymK/iQ4Ohwdjg5Hh6PD0eHocHQ4BhwDjgHHgGPAMeAYcAw4BhwjHbE4blEBVVADCUhBBnJQB8FR4ChwFDgKHAWOAkeBo8BR4ChwVDgqHBWOCkeNw0sClWhEJ3biALaDWIiV2Ii0NdoabS1sPbATB1AOYiFWYiMKUYlGpG12BmW+xarGqrmFsztInLZSAyuxEYWoRCM6sRMHMLqFhbQZbUab0Wa0GW1Gm9FmtDltTpvT5rQ5bU6b0+a0OW1OW6et09Zp67R12jptnbZOW6et0zZoG7QN2gZtg7ZB26Bt0DZoG7DFQrvEQqzERhSiEo3oxE6krdBWaCu0FdoKbYW2QluhrdBWaKu0VdoqbZW2SlulrdJWaau0VdoabY22RlujrdHWaGu0NdoabY02oU1oE9qENqEtasgmnSXUAuOvaqAQlWhEJ3biAJ7FcmIhViJtnbZOW6et09Zp67QN2gZtg7ZB26Bt0DZoG7QN2gZs7TiIhViJjShEJRrRiZ1IW6Gt0FZoK7QV2gpthbZCW6Gt0FZpq7RV2iptlbZK21ksPdCJnTiAZ7GcWIhhG4GNKEQlGtGJnTiAZ7GcWIi0CW1RLPNlijWWtiVOWy2BTuzEAYwT78JCrMRpq9FmceJdqMSweaATO3HaWmxZnHgXFmIlNqIQpy3eiRjr3RKd2IkDGL3GwkKsxEYUIm1OW/QlrQZ24gBGr1Hj0IheY721MBKioaJ/aOdf6MQBjP5hYSFWYuTGLx/9w0IlGtGJnTgSY5VbYiFWYiMKcdrkCDTitEkL7MQBjP5hYSFW4rTFa/1izVuiEo3oxE4cwOgfFhZiJdJWaYv+QTTQiGGzwE4cwOgfFk6bRpNE/7CwEYWoRCNO23xxWY21cIkDGP3DwkKsxEYUohKNSJvQFv2DzqM61sUlFmK0ZA9sRCF2YoTFbxyFrtFQUd3qgUo0ohM7MS4JYiOjuhcWYiU2ohCnzWIvzhfQnujEThzAuFJYWIiV2IhCpK3TFj2BRZNET7BwAKMnsDgmoydYWIlhi5aMnsCidaInsCjT6AkWOrETR2Ksg0ucuV4DhahEIzqxA6MgXQMHMApyYSHOHfIQR0EunOJ+BCpxinsJnLk9EqL0FhbizO0S2IhCVKIRnTj3onvgAEbpzdXqNVaoJVZi5MZeRDmN2PQopxOjnBYW4kwYsW9RTguFqMS5vXMlQI1VaIlhi02PejsxTrcLCzFs8WOd730+MWwWqEQjhi3a4XwD9IkDeL4FOtrhfA/0iZXYiEJUouEnjIJc2IkDv1AU5MJC5C/f+ct3/vJRkDFkGEvUEp3YiQMYBbmwECsOjSjIhUJUHBpRkAs9MZamnQdMrEM7j4dYiJaoRCN6Hg+xGC1xAON0u7DkURIL0hJbHg+xJC1RiUb0PEpiWVriyEMjFqYlFmLNQyPWpiUKEb98LE9LdGInDmA7iGO+SzyaZFbh4/4/sBGFqEQj+sTYzVmxiQM4K/YxghBYiJXYiEJUYtiiSdSJnTiAdhALsRIbUYkd7eAF++ZsEmeTOJvE2SRu2GNnkzibJF7Jfu5QZ5N0Nklnk3Q2SWeTxOvZj/jl4wXtC8MWv2a8pH3hAMaL2o8okXhV+8JKbEQhKtGI01aioea5MHEkxhqyxEKsRMlWj5ViNYYqYqlYYoTNNovFYomFWImNKEQlGtGJnUhbpa3SVmmrtFXaKm2Vtkpbpa3S1mhrtDXaGm2Ntrg49Wi+qM1yohINGIUTN9uxQCuxE+fm1Hn8xhqtxEKsxEYU4hTX2LJ5qkt0YicOoB/EQqzERhQibU5b1FvcS8eqrcQBjHqr0SRRbwsrMWweKEQlGjFs0XxRWfPTBzUWayVWYiPO3LgTjgVbNe55Y8VWjRvdWLKV2IkjMVZtPYYeAguxEhsxbBYYih4YihE4FVICpyLuvmLRVmIhVmIjClGJ0xavko+1W4nTFrdGsXprYdTbwkKsxEactrh3ijVciUZ0YicOYNTbwkKsxEakrdHWwha/RXNiJ4YtfgA5iIUYtmioOMdq/CxRxwuVaEQndmLY4teMc+zCQqzERhSiEo3oxE6kzWgz2ow2o81oM9qiq4jbyVjtldiJcUzGbkZXsbAQK7ERhThtcbcYy74SndiJAxhdxcJCnLlxZxkrvRKN6MROHMDoKhYWYiU2Im2DtkHboG3QNmCLhV+JhViJjShEJRrRiZ1IW6Gt0FZoK7QV2gpthbZCW6Gt0FZpq7RV2iptlbZKW6Wt0lZpq7Q12hptjbZGW6Ot0dZoa7Q12hptQpvQJrQJbUKb0Ca0CW1Cm9CmtCltSpvSprQpbUqb0qa0KW1Gm9FmtBltRpvRZrQZbUab0ea0OW1Om9PmtDltTpvT5rQ5bZ22TlunrdPGvmSwLxnsSwb7ksG+ZLAvGexLBvuSwb5ksC8Z7EsG+5LBvmSwLxlnX2KBY2E7zr7kxLp6xHacHciJQlSiEZ3YiQNYDmIh0lZoK7QV2gpthbZCW6Gt0lZpq7RV2iptlbZKW6Wt0lZpa7Q12hptjbZGW6Ot0dZoa7Q12oQ2oU1oE9qENqFNaBPahDahTWlT2pQ2pU1pU9qUNqVNaVPajDajzWgz2ow2o81oM9qMNqPNaXPanDanzWlz2pw2p81pc9o6bZ22TlunrdPWaeu0ddo6bZ22QdugbdA2aBu0DdoGbYO2QduArRwHsRArsRGFqEQjOnHa/AgcwOhLFk6bx9+NvmRhI07bfElyi3VriUZ0YicOYPQlcyy+xeq1xEoMmwQKUYlGdGInhi0+mBV9ycJCDFsPbEQhKjFyx8ToH3o0VPQPCxtxJvRoqOgfFhpxbm9vgZ04gNE/LAxb7FD0DwsbUYiRG80XNT9fftNioVliJcYehyJqfqESjejEToztjZaMml9YiJXYiEJUohGd2Im0ddo6bZ22TlunLWq+x68Z1d3j14zqPjGqe2EhVmIjClGJRnQibQO2WFKWWIiV2IhCVKIRndiJtBXaCm2FtkJboa3QVmgrtBXaCm2Vtkpbpa3SVmmrtFXaKm2Vtkpbo63R1mhrtDXaGm2NtkZbo63RJrQJbUKb0Ca0CW1Cm9AmtAltSpvSprQpbUqb0qa0KW1Km9JmtBltRpvRZrQZbUab0Wa0GW1Om9PmtDltTpvT5rQ5bU6b09Zp67R12jptnbZOW6et08a+pLIvqexLKvuSyr6ksi+p7Esq+5JYcVfnpFuLFXeJnTgSY8VdYiFWYiMKUYlhk0AndmLY5qkjVtwlFuLD1uZ8S4sVd4lCVKIRndiJAxgfiF1YiLRV2iptlbZKW6Wt0lZpi4/GzvmhFmvr1r7FR2HnIvEWq+gSO3EA4+OwCwtxbu+cpmmxii5RiEo0ohM7cQDjg7ELC5E2pS0+HDvXsrZYRZdoxLDFzx0fkF04gPER2RINFZ+RXViJjRi2aL74eGyJRo3Pxy4cwPiE7MLIHYEzt8bhGR+SrdGS8SnZhUo04rTV2OP4pOzCAYzPyi6cthr7Fl+UrbG9PRSxOT0UsTmz/Fs7/64TO3EAZ/knFmIlTluLhopvPS80HHJnzZ/YiahCOQ5iIVZiIwpRiUZ0YifSxpqX8xPQHliJjRg71AOVaEQnduIAnh+FPrEQK7ERaau0Rc3PaZoWq+gSO3EAo+YXFuK0SQ1sRCEq0YhO7MQBjP5hYSHSJrRF/zBXKbZYRZdoxLBpYPRn5/86gNE/LAxb/ITRPyxsxLBF80X/sNCITuzEAYz+YWEhVmIj0ma0GW1Gm9FmtDltTpvT5rQ5bU6b0+a0OW1OW6et09Zp67R12jptnbZOW6et0zZoG7QN2gZtg7ZB26AtPhkvI7ATp20u/WyxDi+xECtx2uZUXIvVeW1OxbVYnZdoRCd24gDGx+QXhs0DKzF6rhPjmqsHOrETB/C86zixECuxEYWoRNoqbZW2SlujrdHWaGu0NdoabY22RlujrdEmtAltQpvQJrQJbUKb0Ca0CW1Km9KmtCltSpvSprQpbUqb0ma0GW1Gm9FmtBltRpvRZrQZbU6b0+a0OW1Om9PmtDltTpvT1mnrtHXaOm2dNo5VaKet09Zp67QN2gZtg7ZB26Bt0DZoG7QN2gZsdhzEQqzERhSiEo3oxE6krdBWaCu0FdoKbYU29iXGvsTYlxj7EmNfYuxLjH2JsS8x9iXGvsTYlxj7EmNfYuxLjH2JsS8x9iXGvsTYlxj7EmNfYuxLjH2JsS8x9iXGvsTYlxj7EmNfYuxLjH2JsS8x9iXGvsTYlxj7EmNfYuxLjH2JsS8x9iXGvsTYlxj7EmNfYuxLjH2JsS8x9iXGvsTYlxj7EmNfYuxLjH2JsS8x9iXGvsTYlxj7EmNfYuxLjH2JsS8x9iXGvsTYlxj7EmNfYuxLjH2JsS8x9iXGvsTYlxj7EmNfYuxLjH2JsS8x9iXGvsTYlxj7Emdf4uxLnH2Jsy9x9iXOvsTZlzj7Emdf4uxLnH2Jsy9x9iXOvsTZlzj7Emdf4uxLnH2Jsy+J5ZFNTyzESmxEISrRiE7sxAFstDXaGm2NtkZbo63R1mhrtDXazr5EAwsxbCOwEYWoRCM6sROnba5uavHOvcRCnLaY2orX7iUKcdrsCDSiE+N3s8AB5ByKcw7FOYdyruxcKEQlGtGB0WvEXNK5hnNh7EULbEQhKtGITuzEaLP4LeK+ZWEhhi02J+5bFgoxbBJoRCdGm0Xznb1G4NlrnFiIldiIQlSiET0x1nA2P7EQK7ERhajEuRcx+RjLORM7cQDjDmVhIVZiIwpRibQV2mK0I6ZQYznnwugfFoatBVZiI4ZNA8NmgWHrgU7sxAGM/mFhIYZtBDaiEJVoRCd24gDGaMfCQqRNaBPahDahTWgT2qJ/6NG+0T8sLMRpi44plnMmClGJRnTitEXxxnLOhTHasbAQK7ERhahEIzqRNqMtRjtiJjOWcyZWYtiiSaLXGLHp0WssNKITO3EAo9dYWIiVOG0xIBiLPBPDFpsTvcZCJ3biw/YYupw4ew2JUapY5JlYiY0oRCUa0SdKYCeGbW56LPJMLMRKbMRQWKARndiJA1hCMQILsRIbUYhKnLb54EeLlZ2JnTiAswNJLMRKbEQhKpG2SlsNWwkcwHYQw1YDK7ERwyaBYYtGbWGLhmpO7MQBlINYiDG5EKQgAzmog0aSRvg8BGNpZWIhVmIjCjHG0IMM5KA4MQaNpPNGIaiAKqiBQhIxrsTZXjEREisqEztwlqjE7EeskpSY3IhVkolGdGIktMABjGJcWIizUWr8fFGMC8MWP0kU40IjOjFscSxEMU6UWCUpc+cl3sGXWIlhG4FCVOK0zdc1SCyYTOzEAYy6XFiI0a0FNZCAor8OMpCDOmgkxQn9pJDUwEpsRCEq0YhOjF1qgQMY5bgwbNGsUY4LGzFyNTASbGKU2MJCrMRI8EAhKtGIsb3RcNKJ0ybR2PMcnViIlRi2aD4VouKIUCM6seOIiAo/MSp8IX/wqPCFjSjEaZNo1FniiU6cNolGtQH0gxj7Fk3tldiIQlSiEcMWjRqlvnAAo2Yl9i1qdmEhxoRZUAMJSEEGctBUzkeIJJYknhhLEhOnZz6+I7EkMXHu4JwzkFiSmKhEIzqxEwcwqnVOCUgsSUysxLBJoBCVGLYe6MROjBulSVG0JxVQBTWQgCJxtnQsMBSLjY4itGiiKMKFjSjEuaUWDReludCJnTiAUbAWOxgFu7ASwxYbGQW7UIlhixaIgl0YttihKNgTo2AXxrEVVEENJCAFGWgmejRRlJ9HC0T5zXsfiWWIiUo04txSj7Aov4UDGOW3sBDDFtRAAopGCTKQgzpoJPUDFBINrMRGNGJsZvyzKNaFcVgHVVADxVbGTxNn14VGnBvao02jXhdO1bz1kVhkmDhVc/2pxCJDmctLJRYZylw9KrHIUOathMQiw0QjOrETBzDqdWEhhq0Hhm0ETttceySxyFBGbGRU5oiNjOvbE+P6dmEhVmIjCjHCYjfjfHlilOrCQqzERhRihEVDRc3NuyCJZX+JjSjEx75Fzxir/hY5qING0iy3RQVUQQ0kIDgUDoVD4VA4DA6Dw+AwOAwOg8PgMDgMDoPD4XA4ZrHF2SNW7i1yUAeNpFlsiwqoghpIQHB0ODocHY4Ox4BjwDHgGHAMOAYcA44Bx4BjpCNW6C1KR6yY0/nWXokVczLfLCGxYk7nnazE2jidt68SS9TinBEr1BYV0NyKeecpsT4tTm2xPG3RSJpnjkUFVEENJCAFGQgOgSMO4FnZsSRtUQHFTnlg7FT8m3loxhkt1pidNA/NRQVUQQ0kIAUZyEFwGBwOh8PhcDgcDofDMQ/cOMnGOrNFHTQds/BjkdmiAopWiAY5j8gjMA6X+B3PYzLwPChPLMRKbEQhKtGITqRtwCbHQQxbDazERhSiEo3oxE4cwHIQaSu0Fdris+ItSEEGclAHjaQaiSfGlkqgnR/BllgZtqiDHv86zoexLGxRAVVQAwkodnyWYazy0jlaILHKK7ESYxd7oBCVaEQnduIARsktLMRKpE1pixPHHEGQWOWV6MRpq/E7xMnjxDh71GjWOH3EjXys8tIaOx8nkIVCDFuI4xyyMGwjMM4iIT7fbR6557vNTyzESmxEIcbJKY7oOIfELXSs3NK4F46VW4mNGGe8OBLiRLLQiE7swCjRuCuI1Vga98KxGkvj9jVWYyU6sRNHYqzGSizESmzEsI1AJRpx2uLGOlZjJQ5gFOPCaZurHyVWYyU24mzfcqISjegTz7BOHMDz/aknFmIlzl8zSl/xsmFRvGxYYo2WyolO7MQBbJU4Wyfu3WPd1cJzSDGoghpo9vUW5KAOGkmz/BYVUAU1kIAUFBvjgU7swKi2uJ+P1VGJlTh/n7hhjtVRiUqcuxFHS5wWT+qgkRSnxZMKqIIaSEAKgsPhcDgcjg5Hh6PD0eHocHQ4Ohwdjg5Hh2PAMeCIE2dcdsUaqEQhRnvFQRG1utCJ8ydRDRyJsQZK4woo1kAlVmIjCjFsI9CI0xajCLEGSuPiLtZA6ZzIllgDlViI0xZXJ7EGKlGI88wZWXHmPMlBHTSSZpkuikQJnFsaVzKxoknjAI4VTYkD2A5ibGnsdtTjwkYUohLnpoZ3nlY9GiguaWMMIdYzaYwLxHqmxOk6/1Wca+MuO9YzJU5X3DzbeWUbYeel7Ynz/B9/NT/mJ+cHOj3IQA6Ka+BorDhJnhhlu7AQK7ERhRgbFW0cJ8mFThy5VfnhPrH8cJ+cH+iMrY9vfpwkoAiPloz7r4VOnLsSd+Kx7mhhnD/jVj3WHSVWYjs/hiKWH/wRyw/+iOUHf8Tygz9i+cEfsfzgj1h+8EcsP/gjlh/8ERtwDDgGHAOOAceAIz/4I54f/BHPD/6I5wd/xPODP+L5wR/x/OCPeH7wR2J9kcYYQ6wvShzAqNP4RWJ9UWK0mAY2ohDnWe44E4zoxE4cwDinLoxcC5y/cByhsWZI4+4y1gwlDmBU68LZZc4X+kmsGUpsRCEqcTbOGeCgDpp9c9zTxoKhxEKsxEYUohKN6MROpE1pU9qUNqVNaVPalDalTWlT2ow2o81oM9qMNqPNaDPa4mQ9Z8olXgW3ME7XCwuxEhsxbHGQxTl7oRHDFgdOnLYXDmCcuBeGLY6sOHUvbEQhRm4cBHFajrvfWBqUWIkzIa4CY2lQohLn9saFZiwNSuzEkRgLhiyuGGPBkMVtYCwYis/BSCwYShRi2CTQiE7sxAEsB7EQK7ERhUhboa3Qdha8Bw7gWfAnFmIlNqIQlWhEJ9JWaTsHnDSwECuxEYWoRCM6sRMHMPqHuIeOBUOJlajESIjfLWp+zpZLLAJKLMRKnNsbN7ixCChRiUZ0YicOYNT8wkKsRNqMNqPNaDPajLao+RpHddR83IXHIqDEsMWPFTW/UIhKNKITwxYtGTV/YtT8wkKsxEYUohKN6ETaOm3RP8RIQCwCSqzEGJiLdoj+IW69YxFQohFjADCOkugfFo7EWARkcQ8di4ASK7ERhahEIzqxEwew0FZoK7QV2gpthbZCW6Gt0FZoq7RV2mb/YHGjH+uBLO6LYz1QohKN6MROHMDoHxYWYiXS1mhrtDXaGm2Ntkab0Ca0CW1Cm9AmtAltQpvQJrQpbUqb0qa0KW1Km9KmtCltSpvRZrQZbUZb9CUxiBHLkRLDJoFO7MQBjL5E4tCIviQGC2JVUmIjClGJRnTitMVN9TiHwwM7OvN4vVtiI4Yi9iI6kIWh0EAndmIoIiE6kIWFGDvkgY0oRCUa0YmdOBZqLFxKLMRKjAutHmjEyD2xEwcwuoqFhViJjRgDSkegEo0Y41YlsBMHMLqKOfqgsVYpsRLjsu5EISrRiE7sxAFsB7EQKzH2ogYa0YmdGHvRJkansLAQK7GtmyGNFUyJSjSiEztxAM8JrhPbOVqgsVRpkYLmTEP8ULP0F3VQbH/EROEvLMTY/vi7UfgLhTjvTeNnjI8Dn+SgDhpJMWZwUgFVUAMJCA6Hw+FwOByODkeHo8PR4ehwdDg6HB2ODkeHY8ARlW5x8ESlL2zE2V5+/l0lzqPL4ziKSl/YifPXmSNJGoueEqdtTi5pLHpKbMSwWaASw6aBTuzEsM0fNRY9Jcbw5RFYiTFIWgOFqMQYJ43tjfpf2IkDGPW/sBArsRGFqETaKm2Vtkpbo63RFvXfox3iUmGhEJUYNg90YicOYPQKC6ctDphYJpXYiEJUohGnbUT7xqXCwgGMS4WFhViJjShEJRqRNqUteowRx1n0GAsLMWzRULPH8CM2ffYYfkRTzx4j0YhO7MQBnN1GYiFWYiPS5rQ5bU6b0+a0ddo6bZ22TlunrdPWaeu0ddo6bYO2QdugbdA2aBu0DdoGbYO2Ebb5s8SCrMSwWWAlNqIQYwT/CIwh/BroxE4cwHIQC7ESp20OjWgsyEpcQ+8ab3pb1EEzP7YqZglOKqAI98BGFOLclWiA2XMsclDsRw8cwHYQyzkZoLFka1EDCUhBBnJQB42k2V0sgkPgEDgEDoFD4BA4BA6BQ+FQOBQOhUPh0PjlTzSiE3NORM8FXifO/sHriYVYiW3NlOi5ymvhvCKKM9m5zmuhE/uaP9FzqdeJ0T/MEQqNxV6JlTivk+KIm93DIgUZyEE9KfqAeuJslhobEtVeY6Oj2hc6sRNn+9c4PKPaFxZiJTZi2OKgjWpfaMR5jRJbE3MNJ41FseRrUQFVUAMJSEEGclAHwVHgKHAUOAocBY4CR1T5HHrRWGiW2IkDGJW+sBArsRFjxU4NVKIRY9GOBHbiAEa5S2xklPvCSmxEISrRiE7sxAEU2oQ2oU1oE9qENqFNaIv6nwt5NRbCrX2Lep4T9xpvXkt0YicOYNTzwhk2b7U1FsYlNqIQlWhEJ3biAEY9L6TNaYvz/byx11gkl6jEsMXPHef7hZ0YtmioON8vLMRKDFs0X9S6RqNGrS/sxAGMWo978VhC53HPHEvoPO5tYwldohCVOG1xJx1L6BI7cSTGEjqPO9NYN+dzzlxj3ZzPOXONdXMed3axbs79/LtGdGInDmCczhcW4rRF7xzr5hI1D7m1XO5EJ3YiSi/evJYYitj0KPSFjTh3KM76sbwu0YhO7MQBjEJfWIiV2Ii0Ndqi0ONMGavvEjtxAKPQFxbitMWdVazJSxSiEo3oxE4cwDjVLyxE2pS2ON3PBQAaa/ISjRi2+GHP/uH8Xwfw7B9ODFv8hNE/LGzEsEXzRf+w0IhO7MQBjP5hYSFWYiPS5rQ5bU6b0+a0ddo6bZ22TlunrdPWaeu0ddo6bYO2QdugbdA2aBu0DdoGbYO2AVus9UssxEpsRCEq0Yhh88BODNvs+2KtX2IhVmJcgdbAuASVQCUa0YmdOIDRlyyMq10NrMRpaydGbuxF9BoLO3EAo9eI8Tc97wZOrMRGxBVjrABMNKITO3EAo9dYWIiVGK0TzXfeBpzoxE6MvZj9jp63AicWYiW2tdxKY+FgohKN6MROHMBYjrRwXovPVRsa6wUTlWhEJ3bgrPkeYwuxFrAfccDE9fwRTRIX9AudGAlxPMzqXjiru8cdcSwJTKzE2N745bsQlWhEJ3biAI6wxaExCrESG1GISszVoxrrAM92iHWAiYUYuT2wEYWoRCPGXozAThzAchCnrYRt1nFiI05b3NfHOsBEI07bXG6gsRQwcQBnHfcYfIh3ofU5Ua/xLrQ+p2401gj2uLuPd6ElKjFyY99iff2JscB+YSFGbuxb0zy4YjVgohM7UA5iLI+OLYvB/oVKjOXRsWXns1gnduIAno9jnViIldiIQowb2WizGPFfOICzIBPnzsd9cqwPTGxEIcZexG6eD2Kd6MROHEA/iIVYiY0YDx5EQ53PZp0Ye3H+hQGM4l1YiLEXcXBF8S4UohKN6MR4zCFa8nwmJnAcxEKsxEYUohKN6ImxKrDHUEEsC0ysxEaMvdBAJRrRibEX5z8bwPPplxMLsRIbUYhKjN/CAgcwynRhIVZiI8bscZCCDOSgDhpJbT3ZpOdawZMqqIEEpKDY8mh0iW3sgZXYiLHvR6ASjejEThzA87GYEwuxEhuRNqVNaVPalDalzWgz2s7aHYFKNKITZ+u0858N4KzdxEKsxEYUohKnbS6c0Vjnl9iJAxgVHR1BrPNLrMRGFPxYZ0WfaEQnduIAxul4IY+HweMhTrzzjQQaq/963JrG6r/EThyJsfqvx5VlrP5LrMRGjDbrgdM2l8horP5LdGInDmCcjhcWYiU2ohBpi9NxXFTE6r/EThzAqPOFhViJjRg2Cwxb7GY8AbfQiZ04gOdTcCcWYiU2ohBpi1N3jArF6r/EThzAOIsvLMRKbMRpi1GhWBOYaEQnduIA6kEsxLB5YCMKUYlGdGInDmD0DyOogCqogQSkoEiM5ow+4Pxfow9YOP/5cf4FISrRiE7sxAGMBf8LCzFWOMThGtUeC0hihV+iEztxAKPaFxbi3IsYOIsVfolCVGLY4tCOPmBhJ47EWOGXWIiVGDYJDJsGKtGITuzEAYw+IH6LWOGXWImNKEQlGtGJHRjvPoiht/PdXgsbMfbCA5UYe3EmOLET517EtFGs5UssxLkXMdgYa/kShahEI07buWVR7QsHMKp9YSFWYiMKMXJnpxbr82Rh/N3Y46jVhUqMLeuBTowti3aIWj0xrs4Xzi2LYbpYiZfYiEJUohGdGKt/SuAAxhl+YSFWYiMK9jjO5TFHFmvuEgcwzuULIzcO+ziXL2xEIep6PYue7w1b6MROHMDztSYnFmIlRutEvUUdL3RiJ8ZePH5ui4V2iYVYiW29fMfON4QtVKIRndiJAxjvMFkYrWOBsb0j0ImdOIBxfl44t3dEWJyfFzbibPW5wMRiSV2iEZ3YiQMYFTtH7CyW1CVWYiMKUYlGdOIARkHOOUOLFXN9RJPEiXahEztxAONEOwfkLN75lViJsZE9UIhKNKITO3HOiR7RqLN4E+es6BENNYs3sRHnxOgRuxmr6RYa0YmdOICxpG5h2KKhYlHdwkYUohKNGDsUx0488DavZi2WsCXG9G3scTzztnDkXyjnrPOJhViB56Mf5WS/cDz8Mcd2rJxPf5zcjgvH0yZzQMBi1Ra4XVgurBe2C/uFT68HD7IcFy4Xrhdu5GjQ2ctaLDZKdGInDmCsVlxYiJXYiEKkrdPWaeu0ddoGbYO2QdugbdA2aIuVBrNPt1hWdGIsK1pY8KvXUomRq4FCjFwPNKITO3EA60EsxEoM2wgU4rRFvxdLfxId2HDsxjKfRO5Fa8SZG11gLPVJNKIT515EXxbLfRYKfotY8JNYidPmsenz6iNRiUZ0YgfOzm5EzxkresaITY/HiRca0YmxvfELRbd2YnRrCwtxbm90orGkJzFsPVCJRnRi2CxwAKNbi54olvQkViKPKOcRdVbhiVHw0Q/Huh5wv/Ag9+PC5cJR8NHDxgufwEIeJ0dLj9MVezH6hQc41uaAy4VPlwe3C8uFo1Ob90QW63TAfuF+4UEux4XPTu0Irhc+O7USLBfWC5+daQ32C/cLD/L5xODicuF64dPbguXCemG7sF+4k88TxpydsFiocxZhY8E2FmxjwbazYGNTWLCxUOesx8aCbSzYxoKNhTqJQlSiEZ3YibQpbUqb0qa0KW1Km9KmtCltSlsUd3Qasb4nsRIbUYhK7NnXtLNgJbASG1GIml1JrNlJdGInjuxgYs1OYsmuJNbsJDaiEDU7mHa+FuBEz16lnS8GOHEAz9NmbMN52jyxEhv6i7b6gpP1wnZhv3C/8ECfIquPOLmQz4ug6GvkvNiJvkPOi53FdmG/cL/wQJ8i58XO4nLhiv5CzoudxXJhvbBd2C/c0b/EGpVkPdCnxCoVcL1wQx8RC1XAemG7sF+4X5j9USxXWf1FrFcB1wu3C8uF9cKOvkbOi2sNVKIRndiJAxgH9cJCrMRGpK3T1mnrtHXaOm2DtkHboC2uBeckucVCk0QlGtGJnTgSY6FJYiFWYiMKUYlGdGIn0lZoK7QV2gpthbZCW6Gt0FZoK7RV2iptlbZKW6Wt0lZpq7RV2iptjbZGW6Ot0dZoa7Q12hptjbZGm9AmtAltQpvQJrQJbUKb0Ca0KW1Km9KmtCltSpvSprQpbUqb0Wa0GW1Gm9FmtBltRpvRZrQ5bU6b0+a0OW1Om9PmtDltTlunrdPWaeu0ddo6bZ22TlunrdM2aBu0DdrYlyj7EmVfouxLlH2Jsi9R9iXGvsTYlxj7EmNfYuxLjH2JsS8x9iXGvsTYlxj7EmNfYuxLjH2JsS8x9iXGvsTYlxj7EmNfYuxLjH2JsS8x9iXGvsTYlxj7EmNfYuxLjH2JsS8x9iXGvsTYlxj7EmNfYuxLjH2JsS8x9iXGvsTYlxj7EmNfYuxLjH2JsS8x9iXGvsTYlxj7EmNfYuxLjH2JsS8x9iXGvsTYlxj7EmNfYuxLjH2JsS8x9iXGvsTYlxj7EmNfYuxLjH2JsS8x9iXGvsTYl5zv34pLPjv7Eg80ohM7cQDPvuTEQqzERhQibedztSXQiZ04bXFNdb6Ha2EhTluM2J2v4looRCUa0YmdOBLPN3ItLMRKbEQhKtGITuxE2gpthbZCW6Gt0FZoK7QV2gpthbZKW6Wt0lZpq7RV2iptlbZKW6Wt0dZoa7Q12hptjbZGW6Ot0dZoE9qENqFNaBPahDahTWgT2oQ2pU1pU9qUNqVNaVPalDalTWkz2ow2o81oM9qMNqPNaDPajDanzWlz2pw2p81pc9ocdeznM/c1sBGFqEQjOrETB/DsH04sRNoGbYO2QdugbdA2aBuw9eMgFmIlNqIQlWhEJ3YibYW2QluhrdBWaCu0FdoKbYW2QlulrdJWaau0VdoqbZW2SlulrdLWaGu0NdoabY22RlujrdHWaGu0CW1Cm9AmtAltQpvQJrQJbUKb0qa0KW1Km9KmtCltSpvSprQZbUab0Wa0GW1Gm9FmtBltRpvT5rQ5bU6b0+a0nf2DBzqxEwfwfHvHiYVYidM2FyNbrAhKVGLYeqATO/DsKlpgIwpRiUZ04gyrJ47EWPCTODd9LsK1WPAz5mJCiwU/iUJUohGd2IkDGF3FwkKkrdB2Pn5bApVoRCd24gBGV7GwEHGSGLyUGLyUiGVAo0WTRFex0ImdOIDnRNyJhViJjShE2hptjbZGW6NNaBPahDahTWg7xxAl9vMcQ1xcLxxjiBI/wjmGuFgvbBf2C/cLD/J6If3J5cL1whevX7znfNd8jtfGOa81n6e1cc5lrf89tk3jB+6xbfOJWYsFOOB+4UEex4XLheuFY9s02vAcK1+sFz69Enx6o5jOsXKNtj3HyufaRj/OsfK5L36cY+WL64Ujc/52fpxzZYv7hQf5nCtbXC5cL9wuLBfWC59eCT69GtwvPMjnXNni02vB9cLtwnJhvbBd2C/cyeciihZteM4fzAUdfpxzBvMN/n6ccwYSbXjOGZx8zhksLheWC5/HcwnuFz5z6uRzrF+irc6xe4m2OsfuFw/yqrton1V3J9cLN+avujv/d72wXdgv3NkOZ92dfNbd4nLhy/66ch/P+efFl3Y4a6TEvz1rZHG9cLvwOfcQv8VZI4vtwn7h2P75aI+XsxbmedHLWQuL24Ujfz454+WcW15sF/YL9wsP8lkvi09vC64XbheWC+uF7cJ+4U5er5yW4HLheuF2YbmwXtgu7BfuFx7kdvG2i7ddvOdipHny97UYabFe2C7sF+4XHuSz1haXC9cLX37TswYX64Xtwn7hTj7rcT6n4+Wce1ssF9YLn5kefG7zPG7LWaeLz20ewfXCZz8Wx+pZp+vv64Xtwn7hfuGL1y/es04X1wu3C1/25azZxX7hfuHB/e2XzH7JPM+n5z6e59PFxv3tl33pl33pl30Zl30Zl30ZF++4eMelDcelDcelDcdlX85zaHA9z6GLy4Ur9rcezKyHXdixj3X1DycP7G8t3JdayoXrhduF5cIXb7l4i1+4X5htWOvFVS+uenHVi6teXPXiqhfXOofW4EE++4fF5cL1wu3CcuHz/FuC7cJ+4U6Om9I4RZ9LvuIMFO96GnGiiZc9Jc7r2jgd1vOzEic2ohCVaEQnduIAxk3pQtqMNqPNaIub0jj5nwvBTjy/KCGBldiIkaCBSoyEOGrjlvLEuKVcWIiRG0d13FJK/LBxS7lQiUZ0YtjiB4jhqRNjeGrhtMXFZ7zhaf2zQdugbdA2aBu0xT3nwmmbF+h+vtBpXlf7+UanhTN3Xkn7+U6nhUZ0YicOYNxdLoy9kMBKbMSwaaBiG+LucqETO3EA4+5yYSGGwgJD4YFO7MQBjJvHhRE2AiuxEYWoRCM6MWzzBzhXgs1F+n6uBLP4LeKOceEMs9iLGEayaMmo2IUzzKL5omJPjIpdWIiV2IhCVGLY4reIil3YiWGLRo2KPTcnKnZhJTaiEJUYtmjqGEZaGLZoqBhGOjGGkRYWYiU2ohDDFj9ADCMtdGIsd43fImr+3Iao+YWFWImNKMRYzxY/YdT8wlhcG79m1PzCAYyaX1iIldiIsXoumi9qfqERwxa/ZtT8uQ1R84GxMCyxECuxEYWoRCOGzQI7cQCjJ1hYiJXYiGHTwLDp//7vP/32+9/+9Md//OVvf/2Xf/z9z3/+7Q//g//hv377w//5n9/+849///Nf//HbH/7637///k+//X9//P2/4y/913/+8a/x5z/++PfH//v4gf/81397/PkI/Pe//P7nSf/7T/zXx/N/+rhzmAua4p8/WCoixvghozzPkHktFAkijn8f+8d/X5//+zbPNPHvH0c0/n35ELDfiflk0tqJR3E82wl5njHYCtwGaXf/eYvH8c6dGJeEx93VDxG2iWiGBGNA17sBPtfqRsBjpgMBjy7yh4C+aUeby1XPVnhcyz+NGM8jHle42Q6Pi9fjaUTZ/JyPq8z8NR8Xk+NpxubneNRrz2PyceP79OcodbcZpWMzBjejyIfKaO/+prsdKZU7IuX5jujzDI0Pc0TGA7kj9uEn2RxaRY/8WR/3t+1phG+OTs8qf0xbXaq83U7oguPb6vOEu7vhz3dj15g+VxqfjfkY43kWUTf9ZRX0Vo8jvT6NqO82RW27Qh0VhXrw2JQPG7E5NuMR5XMjRn++EZvGnEuFcyvmM2c8Nh+n1h9TNr/qY9LKuCH1eYbvjowqOIXM9/JeUj60yKYDrfHRn7NR7frL3v9ZSnP8LFqe/Sxt1332PDba8TRg318M5yEuz47PVt/vwncZ83PIuK4Yz0+pbXOIPgb1cHzppTXqhzN72zVHz9awQy8J9fbBdfcAbd9ygLa3D9DtrxLfsj9/lcec69NfRXbXa/Gm2nNXermenT9crpXdtUp1tMd8AIMprfyYUt8/PqS9e3zs90Vx6Vbm8s7n+6K7rsNwvTKvMLglP/66Yu8eH9t98Zj6WReRj8ma5/uyO06LFuyL8Sh7jNv9mLG7FI23SJwZ4/LLPG4Bf8jQzZE6v9KRXeFj8uJpxnY7Bu4tHuNQm+3YHKfm2I659u75dnzhl/Gnv4zK29cNujvrzzFBbIjU8XxDNofqfCA/m+QxX/A8w3e3CTjMHvf947WMgdqdH7R6rVHvnfXt3bP+tj3LyP50Pgf8dD9sc5iqslz0epX/lQxrA3crcryYYczw5xnbk1S8ouf8TQ6Vpycp23Wn8brYM6O35yc62xxf89MYuS+PkMu+HPczOk64831KzzPG+6dKP949Ve77jnh5++o7fmjTD7+t13e3Y/vLdkE32Ht57ejo7ErH5ujwXXuMYhi5GuVSt3Z/O2Ji6ew7atfn27G7xMXBMS5jT4/Bix8T+naoJH/YJu1as/czpB4YLfmxVn7M6Mf7x3kvv/Q47xWDNo/Z81KeHue97QZGOVrx4DKeHB1d3r0ktO3A5oFz02Ny56VaeUxBDRwdhz/N6P5ra+Uxp5VH2GPm6Hnd9+0YqXKM9Ifbnx+3Y+x60sazglwz2v2ajfW4Z2vUejwt2lG3J0nFrvzQhfX7TaoYbnjMqvlrh0d8LHVlXMYbPmYM3WVgrPZyaPTj/kY4RhcfE2Dt+UZsz9R5mP9wG1j9x4RdP2q9cTrl2o/a7Qxp+EkeUzrtaUY5vqEjLccv7kkHrxjG0expT1qOt+/ydz9tfAEyEvyHjsM/bMTuFj9ePbGuSS8TCt4/ZNh2zLUox1zbdXDu+BCz6zw8Qx7zm4wwv//DDLbpY9Kuls0Ps+tNG67162Ni+vLTfGjY7ZTTrZPcfjsEZ7nHEV6eb8d25FXRq5s9nRnYzRfF+1PX3ag/HzQtZXfKZ0gdPp6eoLYhLZbMrztSl03IN8w7fcPE0zfMPH3H1NPtJv3hQv0Lv0sdHee5H4bnPobs5p/uzhSX/RTUzbni3STU3ZmGfcPKgXOm7Bp2Ow1Vcb57YHs+X7wNadiSx81t34T096umjrerZhdxs2pu78mmavZNilv13vzV38Vabkjvl2HPnxcD7GajLic8v5xlPq4H2B+rzvrt1/vCj8dq+4Z+tb3fr7b3+9X2q/vVjiui1q9Djh+bdDu8frNJd9NRN5tU3l4ZcH9PXm3S61Eq9cVLCA5btkfVbX4X344n31r9It/Qocr7Haq836HKN3So+xZ99yp1fsYaY9rXuYafVjXJdk4sT5XzcdznXfLuJoQz86VcO9OPPfK+PZzt0V9s03vLior27R0I7g7lsgbxp4zx/pG+m4q6eaTvIm4e6bf3ZLfWa9eijfM3crnM/VKG8tZSmzxv0d19YSz1X/M3fryY0fROxv4Iu7VyLRYivHt09LePjt1M1M0Z1+LlzSnX/Vbcm0wv3nZXpndW4RXfXZeW+IzT6ga7Xlco1S/FOFdRj7KL2V3R1YPD9I97xLKJ2fWouKbTKpcFEx9ODr493DG4bf5iBI72Otom4t6OXIaVfo7YNmkpmE16HO/+vEn77try5jq2sp2Tur2Qrbw/LfXJlmjlllz7s5+3ZNu4juJpx+ZQ+8K22G5b9jFdGXMZDv1iTMcwRJnfUHs9hlMAvY1XY7zzVN6PzRGzm6u6111vZ7uaY3farpx3e2MdM4jzFVCbfdFfHHKze9tG3Ove9uXTL+XTXi0fO1g+VsqrR5phQViZy6CfxtTdpNXdX6ce9ReH3PuJ9xE3f+J9szYWsOmx2Rn7jn5gGzPf1JcN66M8OXPsI+Ijsuu3uTzz9qUIzErON389O399clbHU05zBn9zjJTyDb3afluqGLfFNj/x7nmpm5fU24vQUbnkZVzX2/60IbvJSeHuiG9O6vdvl54OPdXt7BWm4tyf3yDshyduPc5Ry+ZmWmJc+5xWLPZ8OK/W3d2O42m46vJ8Q+r7o6y1vj3KWr/h+av6/ijrJy3KiVrv+lJGK+hUW7ncQX4tw8vbGQ3rI1q7dstfysDN8CPuecbu8ambYy2fZNwaa9nvi/CxaLHxfsaLx1iro3Nu9Plvu3uEqphw4utynvq5YHYb4ooDxO1597GbcLr94/ov/nG9cF82hbtdoH5wDr5cF91+rVH5cErfHGW7Kac2sOTk2DwHunuGqg0uER31+c1vDB08PUlx3OgxEr65dt8+RYUr1frDOFi73x5S+IScPG+P7fm24v5b6nUZwMfzrbw/H1Dl/fmAqm/PB2wjbp5v5f35gH2L3psP2Gfcmw+o+v5Y/idHx72n0NXf/2X9/V/2Gy6zt3NWdy6zPylZdMdyfQ/KTyW7D8ENu9TddbZ9w+Ksatvn/O4tzqq7Oae7i7P2beK4P5VxXb77U5v4d7RJ/442Gb+6TeINW6tNfNMmu/mr94955Wo1/eGZnZ82o906XV6esK0fHmSo/vZkwH4rBA16GSn7eStstyOF72ppT0eFtsMoBw/2B/fxWkh8wXyFjON4LWSUwRDRlxrVcbV9bH7a3aNU3xDxaEiMXjxYn+7KJyH3fpl9yM1fZh9y85fZVq7gZQH64xN7Xwj54RHsQ18MKfXy3HF5MUTwFrP5gc8XQxquEOeXGp+HjPINJ5rtVNXdE81ov/hEM78GmW2ibdcmuh24V87O/HDv/qWQfpmTPJ72r9tncBQrFObLxje7s3s6inOsYvZ8LXAdu9sRPnT7mEt6OqzSdk9Y3bvxbsf23X1Y+SE/DLl/fDXNboqo8UqiXR/J/jlkN0nkx+WtENej/qcX3By78f+DT2jOt9zrJma7NQ03JmW+L3QTs30uEWOr10mE8oWhgMuGzHeGPj1k29HfHnpvx/tDAa28PRSwjbh3w3h/T54PBXzSoreG3rcZN4feP8m4NfS+z7g39P5Jxq2h91b626Ozn2TcGhrZ78u9off7GS8eYzeH3tvuIau7Q+/7Dbk39N7q+2tYP8n4hh/33tB72z6WdHPo/ZMNuTX03tr7VwCtvD/03rZvhbs59N5ae3fofdseN4feP7vO1Mt1ZntyndmavX+xug25OZ6wvcp0PPtWri8D+OkY+4bzvrx/3pf3z/vtG6YA9tftOFeWMZ53hbuJqtvdWPuGa+7d6/5MsCz4MWzWnpftbn3JzbI9vqFsty9VGXxj4DFe+m1rwcDKD29Q/Pi7aHm7R9b6DT2y7obeODYjxyivhtzs1vXtGdVto948PnYv3cGav8v7DKR9adTt8qriIfLi0J3w5nTYs6G7Zsf743/bkG8Zq77ZIp+E3GwR+Y4WkXdbZP+QOLvT/sMo5IeBobabqbo5a9/s/edVm739vOo24uYp+/aebG6jti16b9Z+n3Fv1r65vH8H5N9w6bA/wm7N/Dd/e+Z/G3H36Li9J89vofq7M/+flD1ey9LFN2W/e7bq7pX6fp39vbLfPVd184fdRdz8YW/vyabsty1680q9f8No0n477o30j/fv88d3jPSP7xjp301M3b7rGPL2VeV4+65j+9vevOvYZ9y869i+9O/m8THev+uQ7Y3czbuOT0Lu3XXI9rGlm8dHf/f4+OS1QbwitMulx8/vqNj0QfdeL7H/4syta0o5/O2TixxvP/u/jbh3crm/J/5ag95cCFrevqKU3eNSN68oP8m4uZz93Z91/yGgA29bL0fZnJ72H/G5+0C37KaQ7j7Q/YVN2TzP/UnKzce59yl3n+b+LOXew9z7lLvPcEqVXx9z89HHtn2t673ndKX+6pB7D/vuI2497Nu+pwZ3s1J3nwr/JOReIbdvKeT2LYXcvqWQ27cUcvueQm7918d8QyEPq3nwD7vMtn88A4l8w6P/IvUXh9zsDeTtR/8/+cAfX3l51OPYtOpulPjm09j3v7r49FZNdk+a3Bor2s6TV+MHKsb1pcgfvp6m2ycy+Q2C2p4Nu38S0bla5+nstGh9d7x82xj84tBjRGJsGmN3Cr+53la2U1Q319vK7gNKt795KO/+LrtHbQ0fdbBLz/HxPfXbBOEqaHuesL06u5ymLkMJP311cfvlxjqY0Z5myPZJqJtf/JDy7nH+yacK+Y1tq+X5d8Zk9zDVzbLfR9wq+92Q+83m2J1V+D6KBz79Sdq7x/g24dYxvv1y5M1jfP/1yZvH+O4Zm9vH+PY5vYNdV7k2yBcylEuMVTYZ+4cn8Jmf2bFvvty2m1m6WSn7iFuV4uPXdhw/Nsfzj/Ltv6XJodByGZ/56VuatzPG+xmX1QJf+6ZnQUYvm+9gdt1dhPnlIuzYhOxW9tfGY+w6wvy1EE6nPK4MXw1RbomNbwj54Qr7Cx8pLbivtFLbiz/OwGW6HrW+GNIqnymV5+16+9Ovtb/UIo/hDz4fW3c/za5srp/C3ZWNbeep7rxoVnbPTj0uapFx7RJ/3pDdHZTicYVH33a5AeofMnYzVZw/fOB1SfuHH3d3A3Twix9HlecZu+55Pl+U3fOjVfX53mxXp/BNxE37plm3Ic7fxp8fJPtPa15eJ+e1Pv8Kte6+UTUuj8leP0w3vvBJ3YYXzMu1Sb7yWV7ldPdjAO/FT9GqIkNVXsvgGUt7ff417P0vIxzIdOnlxRTl5aZre/7J5N2nU+9de28Tbl17f/JZS+7Jj6tlfmyN3bTqOEaeI0Z5eoW3jyiVXz2VZxfe+4/TNQ5fdNEXf9munD3ruvsY9u5Jw3uXzZ9E3Lls1vr2/fYXmmP3ofNPUjDo2O14sXQf/7IzpW46s/r2vf8nEfd+Gv+1P80PzdH6yz+NXlKeD6hsP+l4ryvbR9zqy/ZfQaz8DOu4jhv+1CLbZ6duDapsIx4dKRa8xLnitRDjuzb8+v32r4XwvtfNXjrSxqVnHbL5GP32q47f9ZHKy7Vzvfw8P30c8m7IdU70ayHXYRqtr4W0g/et1287fgyR7bcvOLtUj+dfP1f5htF/lW8Y/Vf5htH/7RsdB15/XH+4dv6pSd6do9ouqr65J7uMx0Q5P7o1rp+nPu5neOV7i384U3y8p6lvnzj3EbdOnPr2syX7xsCh8biNsE1jbB/3E74lx49NyHZLcNa8LED4cMe73wzly3r0uijyS/uiWAhojyPl5RCcv3W82qra8M1uO+T5sb57HRO/dKdjk7H7mNDNO7Pj3asZG+/Pimwzbs6K6PZ9fzdnRXy7qJpjouOHr6B/ONjt/Zsqe/+myt++qdo1xmPIEq+3PH4YC/nQGLu5qpuNsY+41xj6SxuD7yyT8sPtx8fG8Pcbw99vjLdnqWw3dTCMDw788GX78YUM3Ho8MtrzK5/+De891f4NH6XW/g0fpd69h8LxZEm/zMj+vBn2HQ3i39Eg/RsaZNcdG1/cYna9evlwuG8fpMKYTrucE/pxeyuk8KmQej1SP2zFNqMdHN+udbMnb/elZfugTcOggYg/35ey/djRzVGU8u51x3ZX7l547EPuXnnsXxBy78qjHNsRLr61aVzeius/nl9sPz11b5Tcdo9R3Rvi3u/LaByIuXw18Kd92b/VDz/vcflkYDP/Ssi998B+FnLrPbCfhNx7D+wnIffeelCO7cQwnww7LndAH36cbcajprhE/jjkeo44vhRj/JGPS+F8OYY/0HEZfPg5xt8/4j7ZloI77gfry7tUBn/pevm63Rdj6qWBq/vTGCv+y2MqLzxrubws46eS3oZUfNy91ksP97WQhvVADxyvhhin8fvzLdnN4jvm38cPX7v/sBm71/09LuUwaDb0+UfRbftY1L13Edh25f+9x0Vt9/TsvecK7ZNXsmTE5nHR+3vimz2R7cjunXcR2Dd8VOqT7bj1LgJrb3/ux3YTPHffRWDbtfI330Vgu8Xu3xJy/9XF1vannJuvLv5ka+6+uth2L8u79+pia9/wejmT7aPWdx7kt/b2B5m2hXPzRQ/7jHsverDdXNXN4pPtWMu9Fz3Y7qV/d1/08EnIvRc92HZJ8L3jQ/Td4+OzayvMqz5Y7PlF0fvTVfb+dJWp/NKIm29T+6RJ+SXXR/Pq8yb95Dbp1mvqPgu59Zq6WLfw7g3bNuRuw5bthBXmq9qrIzac8pKnEbthxXvDm2bfMPlv9g2T/2bfMPm/fRvRQIYMvy5XGbcztB+8ROz2UoZVrJ1/nM3K0wzztx9R3W5GwYr1x7jii7vSKq4/WrPNrrRfuitShJdBY7MZ+ks3Q/lUuba22Yy3J63s/Ukre3/SatsYhtW/1q+rjz42xu51rt8SUoTDVXq5F/ppyry3d/vj/Xbcnbrf78y9EXTbTlvdHEHv26tC3uj+MLXx4asptpu1ujsO0t9/e7qNt9+evo24OQ5ye0824yDbFr05DjLefwXqJ9txbxxk2Nu3YrsBv9vjINt50btDGPsPBdwdNPDtY1X3Bg22T3fd3B0/6vsjD368/T2K7TFyc+RhO3V+c+Rhm3Fv5MF3EyL3DnfffvHk5siD79Ye3x15+CTk3siDl7dHpraNeu/48LeXiXj5hvsoL99wH+XlG+6jtqv2+NKv9sMrdj6szdpmOK6n2mPa+7WMwb792GTs3k0t9ej/78UmHzLeXp/R316e0b9hdUb/hsUZvp3LuXlpuXsH8uDzOrVep+n67YjHwNZl2rK+llGwrOJxx/58O2IRyNul345vKP3du/puD6Fsm5VzsHU8b1bfPnx082Oln4Xc+v6Tt+2HU3iU2PXR0J92Z3cFcvNjpb6dmbp3uezt7VdU+25K6u7lsu8esrl9fbl9M8vtGT/fvgDo9ozfJ1tz++J99zDVvYv37USb4xZRvFyPWPmwGbuLgHvfKnV5/2XVLm+/rHobce+u+/6e+GZPti1661ul24yb3yr9JOPWt0r3Gfe+VfpJxq1vlfruqZ+br97+JOPWSMZ+X+59q/R+xovH2M1vlbpt33d171ul+w25963SKIl3f1xrv/jHvfetUrftNOq9b5V+siG3vlXq9v4FgH3DNyrcv+HzEu7v3/vb25+X+PQy8863St3lG65V/e35/v1F5r3RdvdvOO/7++d9f/+8799w3t9ftt8abffdQ1W3u7HyDZfcu2eqbg/p9re/Rbm9j7lbtv72kO4+4+aQbh9v98j7D1Pd7JG3n6a6O6S7D7nZrY+3h/y3jXrv+Ohvr8/pby/P2T4Kfmsb9g+T39mGT95VgkuXqpcV8V974YnxrSnW5cWQziGuPuy1kMeQBS6Rj/p8d3T35uK7r17Zhpjjc7iPAcDy5Gy9j+gVL3Ho4q9FGLai+/OlbLvfxbEVj2GD8uKP+0OIvhpSGFKf/y7xOsDnN1F3Vtd8EnFndU0v9ZdG3F2luG1QvH3hMX4xXv1V+F7M6+ukvxhy2ZKXQzo+YVG7vhyCAdBPQtq7Xfsnrz2707d/8u5EXFc+ZthefP0i3oz7wGcPYm5fRXnvLFffbYn9S0Y7P+9Xnr/xfJvBt789cLyWwXeN/zDr8bWMyyubXn3pqmO1pHp9dTtwR6veX20P475s3kS/fZGt8AsneryYwbe2ilp5MQM9utjuJbS7DBaLXE+1HzP6bjbqUep8nNyePyjcd7c+0g9cYl9fAt+GfmlL2Hn4bks2/bEd6I/tuD7z8ZXtwPvOH/dPz5/s7bsb7D7wpMTj6nRsQnanfY6bXl6ZWu0Lh4hjBkn65t2efTcLdfsQ2T7Rc/cQ+WRL7h0iu/mbm4fIfjvuHiLjGw6R7Wej3j9E+Hyy9PG8d+/b1+pX3I3pD88GfFgVo9tbILSH+eXFFh9fZLfbl9H4xMbm1c19957S2/tiv3Rf9MBwkh71tbOMFtxpaxn6Yga3o9TvyBgvZmARiBZ78RX0BasmHnEvt2lnm8qLGZia03p9rejHj8hsvxB0WW0k17uxD3eF27d83bu93UfcujfdzkO9H3Hz0z7bgWicW2qz519L6rtJqFuv4txuhfAdvDJksxXt/R5sN310swfbf3+KA+Jay9N92WdgArqqPW+Px4XOLuTmh7Dc3h2h20fcGqH7JOLOCJ28Pdggb481bD9oeGsb9p9EvLUN2+k8O7iq0MrzSY5PUjDkUeZN/9OU3r/ha9N990zBt4Tc+0jtPuIbPlltjXOtpq9+H/3uL1y/5xfePSN1+8fZvYHyW0Ju/sLbiHufIf6WX7hvH5K6/bHqbcy9vn0fcatv/yTiTt++W5Dvg19ZuT7gUH+8xx67FytUq5ydu3ws/v5WDH4aelzmwT9uxf61+3wH3g+v3b8f0blU+7g+af5TW+weSry5GH9spwhuLsYfu0mku4vxtxGcVKvXF5F9bJGyfaOvYurlwfb0cY1PQvgJD7Py9Nn53TNSjwngbJFWDt3szu7pk8KUxz3qZXfGuNuueuAL4nqM8crBKqNjdeP1y1c/78t3HKzlOw7W+g0H62cHCd43MQ+SZ2/kjFG0X3ukxQdP1u3DaM9/nd2rph4ZGAKRyyqBj6N9+5DG40SLbUK+YZx91LcHUT/ZjnuDqKN+wyDqaG8Pon7SkTSe9Uq73HR/6EjG7mkNXIVc3nn54WG67VNftz4pOnav8OtYh9/H8wVoY3trZngDqNn1E7rl43bY+1e6Y7si79aV7vY6hEs+Hz//00Njex3CF8WO6+OeX4jg2vcH+msReM7jhzc+fyGiHsYLqusypy9EyIEBIamvbYVw1FMuc1FfiVAskHwMS9lrEcpViZdx5C9FXE4qWl/cCg5rXR6cfXUrXo3AAf74Vy8d4PM+AxH62o9qmOh81PqLW8GrFuvH2zvyWkTrfFi+d3kxguez46UftY3GRcT2vDnjezzPJ5/xiIpcF5mXcX8zBj9CMvy1PcF73R/42hFeDl4TH69V+4FlJ4+I16q9lPr/ujL/2o4YI97fkRcjLo/JX9eZfSkCn6OuxcaLEVzx78fbO/JqROcr18dr56LKH7WW/mLEwYjx7o68GnG5XLu+WuOnPmf7Jal7fc72AvZR45f3k16Pr4+Px4zd80J94LWN/XrN9XPI7qZeq3AMu9rzAc7h4xcO6j2OdVbc5Yrn473F7hmIig8m/vCqgHq/NYZhNeNjrKY/b9Ltm/nu3lpsvyd169ZiuzP3t8N+6XaUx+UnDzGVutmSXQzf8lPa5YOJ72yLbbZlX8EHvzd+lM2LKfaNe2ua47MdujwPqpc3wP5cv9uYfnlfTy/H6zF8tWVv49WYu7MuY/cqtu+Kafz8T9v9Tl1+dadw73j55NzDAcujHsfTI/dxjG9f+8nhqOtw4xcP3rsTqJ/F3JxBnd8qev83eqTor0651+9+kvEd3cvdadT54aX3a2ifcm8a9ZOMW/Oon2W8O5F6u2c63m2N492mOH5hO9xbVbdtSE6v2eW+9+M3mHYRhsd3i7XxUkRn/9P1ta0Y+DEfnXJ5JaIela/skvbSVvCx/eL9tR1xLD0tvby0I4X3eo8509e2oikvFv3FCDyyX+RyvfmVCMHLHIvU8vZWvBghmD9+3Fnp04hy7N7W9w2DbfH9gPP+7Dp4KUe7H8FXDvnR3o/wlyK8YAjVL2MRX4pwbkWXlyI4M9mGvtYW8VzxGgu+TPe+GlFf+1E7Vs+2fr07/EoEXzN2PRF9KYJvO+uXN4R9KeLy0pPx4o+Kz3k8Cv+lraiPwS0Mc10eyfpSBN8eVy8fJvkYUY7te+wuI0v1+lKcfn87Bocex0uFVhsGyWob9bUIHOIPtNci8NxQbaIvRlRG2NsR+upWXB5iOF6LMLbFKG9vxccf9Z8f//WPf/rL3//l97/96Y//+Mvf/vpfj3/5vzPs73/547/+/uf1X//9v//6p8v/+4///z/z//nXv//l99//8h//8p9//9uf/vxv//33P8+k+f/9dqz/+D9WpP/T47rR//mffiuP/+7zpZ4uTR//vc3/fzxu32zo/O8l/sHxGJt8/IfN/6GcCY+/8bh1/uf/nZv8fwE="
583
+ "debug_symbols": "tb3fjvU4duT7LnXtC5Fcf0i/ymBg9Hh6Bg00uo22fYADw+9+Npe4IpT5nc1U7p3fTeWvqjIjJEqxJJEU9V9//O8//6///L//8pe//Z+///sf//w//uuP//WPv/z1r3/5v//y17//65/+4y9//9vjv/7XH8f8h+sf/9z+6Q+3P/5ZHz/8/NHPHyN+9OP8Uc4f9fzRzh9y/tDzx6nST5V+qvRTZZwq41QZp8o4VcapMk6VcaqMU2WcKuNUKcexfpb1s66fbf2U9VPXT1s/ff3s6+fSK0uvLL2y9MrSK0uvLL2y9MrSK0uvLL269OrSq0uvLr269OrSq0uvLr269OrSa0uvLb229NrSa0uvLb229NrSa0uvLT1ZerL0ZOnJ0pOlJ0tPlp489Hz+7OvnOH/qsX4+9EqZUBNawkOyyISHZukTLMETesJYYEfCVB4TakJLkARNsARP6AljgR8Jqeyp7A/lekyQBE2YyjbBE3rCQ7nOP59JOaEk1ISWIAmaYAme0BNSeaTySOWZoDabd2boBEnQBEvwhJ4wTqgzUCeUhJrQEiRBEyzBE6ZymzAWzGidUBJqQkuQBE2wBE9I5ZLKNZVrKtdUrqlcU7mmck3lmso1lWsqt1RuqdxSuaVyS+WWyi2VWyq3VG6pLKksqSypLKksqSypLKksqSypLKmsqayprKmsqayprKmsqayprKmsqWypbKlsqWypbKlsqWypbKk8M9hswlgwM3hCSagJLUESNMESPCGVPZV7Ks8MtjGhJrSEh7LIBE2wBE/oCWPBzOAJJaEmtIRUHqk8UnlmUHxCTxgntJnBE0pCTWgJkqAJluAJPSGVSyrH9a1MqAktQRI0wRI8oSeMBXGhC0jlmso1lWsq11SuqVxTuaZyTeWWyi2VWyq3VG6p3FK5pXJL5ZbKLZUllSWVJZUllSWVJZUllSWVJZUllTWVNZU1lTWVNZU1lTWVNZU1lTWVLZUtlS2VLZUtlS2VLZUtlS2VLZU9lT2VPZU9lT2VPZU9lT2VPZU9lXsq91TuqdxTuadyT+Weyj2Veyr3VB6pPFJ5pPJI5ZHKI5VHKo9UHqk8lrIcR0JJqAktQRI0wRI8oSekcknlzKBkBiUzKJlBiQy2CZbgCT1hLIgMBpSEmtASJCGVayrXVK6pXFO5pXJL5ZbKLZVbKrdUbqncUrmlcktlSWVJZUllSWVJZUllSWVJZUllSWVNZU1lTWVNZU1lTWVNZU1lTWVNZUtlS2VLZUtlS2VLZUtlS2VLZUtlT2VPZU9lT2VPZU9lT2VPZU9lT+Weyj2Veyr3VO6p3FO5p3JP5Z7KPZVHKo9UHqk8Unmk8kjlkcojlUcqj6Wsx5FQEmpCS5AETbAET+gJqVxSuaRySeWSyiWVM4OaGdTMoGYGNTOomUHNDGpmUDODmhnUzKBmBjUzqJlBzQxqZlAzg5oZ1MygZgY1M6iZQc0MamZQM4OaGdTMoEYG+4SWIAmaYAme0BPGgshgQElIZU1lTWVNZU1lTWVNZU1lS2VLZUtlS2VLZUtlS+XI4JjQE8aCmUErE0pCTWgJkqAJluAJPWEs6KncU7mn8sygzZafGTxBEyzBE3rCWDAzeEJJqAmpPFJ5pPJI5ZHKI5XHUrbjSCgJNaElSIImWIIn9IRULqlcUrmkcknlksollUsql1SeGTSZMBbMDJ4wlXVCTWgJU7lP0ARL8ISeMBbMDJ5QEmpCS0jllsotlVsqt1RuqSypLKksqSypLKksqSypLKksqSyprKmsqayprKmsqayprKmsqayprKlsqWypbKlsqWypbKlsqWypbKlsqeyp7Knsqeyp7Knsqeyp7Knsqeyp3FO5p3JP5Z7KPZV7KvdU7qncU7mn8kjlkcojlUcqj1QeqTxSeaTySOWxlP04EkpCTWgJkqAJluAJPSGVSyqXVC6pXFK5pHJJ5ZLKJZVLKpdUrqlcU7mmck3lzKBnBj0z6JlBzwx6ZtAzg54Z9MygZwY9M+iZQc8MembQM4OeGfTMoGcGPTPomUHPDHpm0DODnhn0zKBnBj0z6JlBzwx6ZtAzg54Z9MygZwY9M+iZQc8MembQM4OeGfTMoGcGPTPomUHPDHpm0DODnhn0zKBnBj0z6JlBzwx6ZtAzg54Z9MygZwY9M+iZQc8MembQM4OeGfTMoGcGPTPomUHPDPrMoJcJkqAJluAJPWGc0GcGTygJNaElSIImzG22CZ7QE8aCyGBASagJLUESNCGVSyqXVC6pXFO5pnJN5ZrKNZVrKtdUrqlcU7mmckvllsotlVsqt1RuqdxSuaVyS+WWypLKksqSypLKksqSypLKksqSypLKmsqayprKmsqayprKmsqayprKmsqWypbKlsqWypbKlsqWypbKlsqWyp7Knsqeyp7Knsqeyp7Knsqeyp7KPZV7KvdU7qncU7mnck/lnso9lXsqj1QeqTxSeaTySOWRyiOVRypHBtuEccKIDAbMDMqEmtASJEETLMETesJYMDN4QiqXVC6pXFK5pHJJ5ZLKJZVLKtdUrqlcU7mmck3lmso1lWsq11SuqdxSuaVyS+WWyi2VWyq3VG6p3FK5pbKksqSypLKksqSypLKksqSypLKksqayprKmsqayprKmsqayprKmsqbyzKDbhJJQE6bymCAJmmAJntATxoKZwRNKQk1IZU9lT2VPZU9lT2VP5Z7KPZV7KvdU7qncU7mnck/lnso9lUcqj1QeqTxSeaTySOWRyiOVRyqPpfwYcD9ABVRBDSQgBRnIQR0EjwKPAo8CjwKPAo8CjwKPAo8CjwKPCo8KjwqPCo8KjwqPCo8KjwqPCo8GjwaPBo8GjwaPBo8GjwaPBo8GD4GHwEPgIfAQeAg8BB4CD4GHwEPhofBQeCg8FB4KD4WHwkPhofAweBg8DB4GD4OHwcPgYfAweBg8HB4OD4eHw8Ph4fBweDg8HB4Ojw6PDo8Ojw6PDo8Ojw6PDo8Ojw6PAY8BjwGPAY8BjwGPAY8BjwEP5Lwg5wU5L8h5Qc4Lcl6Q84KcF+S8IOcFOS/IeUHOC3JekPOCnBfkvCDnBTkvyHlBzgtyXpDzgpwX5Lwg5wU5L8h5Qc4Lcl6Q84KcF+S8IOcFOS/IeUHOC3JekPOCnBfkvCDnBTkvyHlBzgtyXpDzgpwX5Lwg5wU5L8h5Qc4Lcl6Q84KcF+S8IOcFOS/IeUHOC3JekPOCnBfkvCDnBTkvyHlBzgtyXpDzgpwX5Lwg5wU5L8h5Qc4Lcl6Q84KcF+S8IOcFOS/IeUHOC3JekPOCnBfkvCDnBTkvyHlBzgtyXpDzgpwX5Lwg5wU5L8h5Qc4rcl6R84qcV+S8IucVOa/IeUXOK3JekfOKnFfkvCLnFTmvyHlFzityXpHzipxX5Lwi5xU5r8h5Rc4rcl6R84qcV+S8IucVOa/IecwH6jWoghpIQAoykIM6aCTNnC+Ch8BD4CHwEHgIPAQeAg+Bh8JD4aHwUHjMnPdzeqKCDDQ9LKiDRtLM+aICqqAGEpCCDAQPg4fBw+Hh8HB4ODwcHg4Ph4fDw+Hh8Ojw6PDo8Ojw6PDo8Ojw6PDo8OjwGPAY8BjwGPAY8BjwGPAY8BjwGOkRk4oWFVAFNZCAFGQgB3UQPAo8CjwKPAo8CjwKPAo8CjwKPAo8KjwqPCo8KjwqPCo8KjwqPCo8KjwaPBo8Iuc9qIEE9PAYJchADuqgkTRzvqiAKqiBBAQPgYfAQ+Ah8FB4KDwUHgoPhYfCQ+Gh8FB4KDwMHgYPg4fBw+Bh8DB4GDwMHgYPh4fDw+Hh8HB4ODwcHg4Ph4fDo8Ojw6PDo8Ojw6PDo8Ojw6PDo8NjwGPAY8BjwGPAY8BjwGPAY8BjpEdMXFpUQBXUQAJSkIEc1EHwKPAo8CjwKPAo8CjwKPAo8CjwKPCo8KjwqPCo8KjwqPCo8KjwqPCo8GjwaPBo8GjwaPBAzgU5F+RckHNBzgU5F+RckHNBzgU5F+RckHNBzgU5F+RckHNBzgU5F+RckHNBzgU5F+RckHNBzgU5F+RckHNBzgU5F+RckHNBzgU5F+RckHNBzgU5F+RckHNBzgU5F+RckHNBzgU5F+RckHNBzgU5F+RckHNBzgU5F+RckHNBzgU5F+RckHNBzgU5F+RckHNBzhU5V+RckXNFzhU5V+RckXNFzhU5V+RckXNFzhU5V+RckXNFzhU5V+RckXNFzhU5V+RckXNFzhU5V+RckXNFzhU5V+RckXNFzhU5V+RckXNFzhU5V+RckXNFzhU5V+RckXNFzhU5V+RckXNFzhU5V+RckXNFzhU5V+RckXNFzhU5V+RckXNFzhU5V+RckXNFzhU5V+RckXNFzhU5V+RckXNFzhU5V+RckXNFzhU5V+RckXNFzhU5V+RckXNFzhU5V+RckXNFzhU5V+RckXNFzhU5V+RckXNFzhU5V+RckXNFzg05N+TckHNDzg05N+TckHNDzg05N+TckHNDzg05N+TckHNDzg05N+TckHNDzg05N+TckHNDzg05N+TckHNDzg05N+TckHNDzmOC1mhBDSQgBRnIQR00kiLnJxUQPAQeAg+Bh8BD4CHwEHgoPBQeCg+Fh8JD4aHwUHgoPBQeBg+Dh8HD4GHwMHgYPAweBg+Dh8PD4eHwcHg4PBweDg+Hh8PD4dHh0eHR4dHh0eHR4dHh0eHR4dHhMeAx4DHgMeAx4DHgMeAx4DHgMdIjJnktKqAKaiABKchADuogeBR4FHgUeBR4FHgUeBR4FHgUeBR4VHhUeFR4RM4lSEAKMpCDOmgkRc5PKqAKgkeDR4NHg0eDR4NHg4fAQ+Ah8BB4CDwEHgIPgYfAQ+Ch8FB4KDwUHgoPhYfCQ+Gh8FB4GDwMHgYPg4fBw+Bh8DB4GDwMHg4Ph4fDw+Hh8HB4ODwcHg4Ph0eHR4dHh0eHR+TcghRkoOkxgjpoJEXOTyqgCmogASnIQPAY8BjpERPJFhVQBTWQgBRkIAd1EDwKPAo8CjwKPAo8CjwKPAo8CjwKPCo8KjwqPCo8KjwqPCo8KjwqPCo8GjwaPBo8GjwaPBo8GjwaPBo8GjwEHgIPgYfAQ+Ah8BB4CDwEHgIPhYfCQ+Gh8FB4KDwUHgoPhYfCw+Bh8DB4GDwMHgYPg4fBw+Bh8HB4ODwcHg4Ph4fDw+Hh8HB4ODw6PDo8Ojw6PDo8Ojw6PJDzjpx35Lwj5x0578h5R847ct6R846cd+S8I+cdOR/I+UDOB3I+kPOBnA/kfCDnAzkfyPlAzgdyPpDzgZwP5Hwg5wM5H8j5QM4Hcj6Q84GcD+R8IOcDOR/I+UDOB3I+kPOBnA/kfCDnAzkfyPlAzgdyPpDzgZwP5Hwg5wM5H8j5QM4Hcj6Q84GcD+R8IOcDOR/I+UDOB3I+kPOBnA/kfCDnAzkfyPlAzgdyPpDzgZwP5Hwg5wM5H8j5QM4Hcj6Q84GcD+R8IOcDOR/I+UDOB3I+kPOBnA/kfCDnAzkfyPlAzgdyPpDzgZwP5Hwg5wM5H8j5QM4Hcj6Q84GcD+R8IOcDOR/I+UDOB3I+Muf1yJzXI3Nej8x5PTLn9cic1yNzXo/MeT0y5/XInNfjgEeBR4FHgUeBR4FHgUeBR4FHgUeBR4VHhUeFR4VHhUeFR4VHhUeFR4VHg0eDR4NHg0eDR4NHg0eDR4NHg4fAQ+Ah8BB4CDwEHgIPgYfAQ+Ch8FB4KDwUHgoPhYfCQ+ERy90cNXAAY8mbhYVYiY0oRCUa0Yl0M7o53SL0HlRBDSQgBRnIQR00kiL0J8Gjw6PDo8Ojw6PDo8Ojw6PDY8BjwGPAY8BjwGPAY8BjwGPAY6RHTI5bVEAV1EACUpCBHNRB8CjwKPAo8CjwKPAo8CjwKPAo8CjwqPCo8KjwqPCocXpJoBKN6MROHMB2EAuxEhuRbo1ujW4t3HpgJw6gHMRCrMRGFKISjUi3WQzKXMWqxqy5hbMcJE63UgMrsRGFqEQjOrETBzDKwkK6Gd2MbkY3o5vRzehmdDO6Od2cbk43p5vTzenmdHO6Od2cbp1unW6dbp1unW6dbp1unW6dbp1ug26DboNug26DboNug26DboNuA24x0S6xECuxEYWoRCM6sRPpVuhW6FboVuhW6FboVuhW6FboVuhW6VbpVulW6VbpVulW6VbpVulW6dbo1ujW6Nbo1ujW6Nbo1ujW6NboJnQTugndhG5Ct8iQTToj1ALjVzVQiEo0ohM7cQDPsJxYiJVIt063TrdOt063TrdOt0G3QbdBt0G3QbdBt0G3QbdBtwG3dhzEQqzERhSiEo3oxE6kW6FboVuhW6FboVuhW6FboVuhW6FbpVulW6VbpVulW6XbGZYe6MROHMAzLCcWYriNwEYUohKN6MROHMAzLCcWIt2EbhGWuZhijaltidOtlkAnduIAxoV3YSFW4nSr0WZx4V2oxHDzQCd24nRrsWVx4V1YiJXYiEKcbrEmYsx3S3RiJw5gVI2FhViJjShEujndopa0GtiJAxhVo8apEVVjrVoYCtFQUR/a+QudOIBRHxYWYiWGbhz5qA8LlWhEJ3biSIxZbomFWImNKMTpJkegEaebtMBOHMCoDwsLsRKnWyzrF3PeEpVoRCd24gBGfVhYiJVIt0q3qA+igUYMNwvsxAGM+rBwumk0SdSHhY0oRCUacbrNhctqzIVLHMCoDwsLsRIbUYhKNCLdhG5RH3Se1TEvLrEQoyV7YCMKsRNDLI5xBF2joSLd6oFKNKITOzFuCWIjI90LC7ESG1GI081iL84FaE90YicOYNwpLCzESmxEIdKt0y0qgUWTRCVYOIBRCSzOyagECysx3KIloxJYtE5UAouYRiVY6MROHIkxDy5x6noNFKISjejEDoxAugYOYARyYSHOHfIwjkAunMb9CFTiNO4lcOr2UIjoLSzEqdslsBGFqEQjOnHuRffAAYzozdnqNWaoJVZi6MZeRJxGbHrE6cSI08JCnAoj9i3itFCISpzbO2cC1JiFlhhusemRtxPjcruwEMMtDta57vOJ4WaBSjRiuEU7nCtAnziA5yrQ0Q7nOtAnVmIjClGJhkMYgVzYiQNHKAK5sBB55DuPfOeRj0BGl2FMUUt0YicOYARyYSFWnBoRyIVCVJwaEciFnhhT084TJuahnedDTERLVKIRPc+HmIyWOIBxuV1Y8iyJCWmJLc+HmJKWqEQjep4lMS0tceSpERPTEgux5qkRc9MShYgjH9PTEp3YiQPYDuKYa4lHk8wUPp7/AxtRiEo0ok+M3ZyJTRzAmdhHD0JgIVZiIwpRieEWTaJO7MQBtINYiJXYiErsaAcv2DdnkzibxNkkziZxwx47m8TZJLEk+7lDnU3S2SSdTdLZJJ1NEsuzH3HkY4H2heEWRzMWaV84gLFQ+xERiaXaF1ZiIwpRiUacbiUaal4LE0dizCFLLMRKlGz1mClWo6sipoolhthss5gslliIldiIQlSiEZ3YiXSrdKt0q3SrdKt0q3SrdKt0q3SrdGt0a3RrdGt0a3SLm1OP5otslhOVaMAITjxsxwStxE6cm1Pn+RtztBILsRIbUYjTuMaWzUtdohM7cQD9IBZiJTaiEOnmdIu8xbN0zNpKHMDIW40mibwtrMRw80AhKtGI4RbNF8manz6oMVkrsRIbcerGk3BM2KrxzBsztmo86MaUrcROHIkxa+vR9RBYiJXYiOFmgWHRA8NiBE4LKYHTIp6+YtJWYiFWYiMKUYnTLZaSj7lbidMtHo1i9tbCyNvCQqzERpxu8ewUc7gSjejEThzAyNvCQqzERqRbo1sLtzgWzYmdGG5xAOQgFmK4RUPFNVbjsESOFyrRiE7sxHCLoxnX2IWFWImNKEQlGtGJnUg3o5vRzehmdDO6Gd2iVMTjZMz2SuzEOCdjN6NULCzESmxEIU63eFqMaV+JTuzEAYxSsbAQp248WcZMr0QjOrETBzBKxcJCrMRGpNug26DboNug24BbTPxKLMRKbEQhKtGITuxEuhW6FboVuhW6FboVuhW6FboVuhW6VbpVulW6VbpVulW6VbpVulW6Vbo1ujW6Nbo1ujW6Nbo1ujW6Nbo1ugndhG5CN6Gb0E3oJnQTugndhG5KN6Wb0k3ppnRTuindlG5KN6Wb0c3oZnQzuhndjG5GN6Ob0c3o5nRzujndnG5ON6eb083p5nRzunW6dbp1unW6sZYM1pLBWjJYSwZryWAtGawlg7VksJYM1pLBWjJYSwZryWAtGWctscCxsB1nLTmxrorYjrOAnChEJRrRiZ04gOUgFiLdCt0K3QrdCt0K3QrdCt0q3SrdKt0q3SrdKt0q3SrdKt0q3RrdGt0a3RrdGt0a3RrdGt0a3RrdhG5CN6Gb0E3oJnQTugndhG5CN6Wb0k3ppnRTuindlG5KN6Wb0s3oZnQzuhndjG5GN6Ob0c3oZnRzujndnG5ON6eb083p5nRzujndOt063TrdOt063TrdOt063TrdOt0G3QbdBt0G3QbdBt0G3QbdBt0G3MpxEAuxEhtRiEo0ohOnmx+BAxi1ZOF08/jdqCULG3G6zUWSW8xbSzSiEztxAKOWzL74FrPXEisx3CRQiEo0ohM7Mdzig1lRSxYWYrj1wEYUohJDd0yM+tCjoaI+LGzEqdCjoaI+LDTi3N7eAjtxAKM+LAy32KGoDwsbUYihG80XmZ+L37SYaJZYibHHYRGZX6hEIzqxE2N7oyUj8wsLsRIbUYhKNKITO5FunW6dbp1unW6dbpH5Hkcz0t3jaEa6T4x0LyzESmxEISrRiE6k24BbTClLLMRKbEQhKtGITuxEuhW6FboVuhW6FboVuhW6FboVuhW6VbpVulW6VbpVulW6VbpVulW6Vbo1ujW6Nbo1ujW6Nbo1ujW6Nbo1ugndhG5CN6Gb0E3oJnQTugndhG5KN6Wb0k3ppnRTuindlG5KN6Wb0c3oZnQzuhndjG5GN6Ob0c3o5nRzujndnG5ON6eb083p5nRzunW6dbp1unW6dbp1unW6dbqxllTWkspaUllLKmtJZS2prCWVtSRm3NU56NZixl1iJ47EmHGXWIiV2IhCVGK4SaATOzHc5qUjZtwlFuLDrc3xlhYz7hKFqEQjOrETBzA+ELuwEOlW6VbpVulW6VbpVulW6RYfjZ3jQy3m1q19i4/CzkniLWbRJXbiAMbHYRcW4tzeOUzTYhZdohCVaEQnduIAxgdjFxYi3ZRu8eHYOZe1xSy6RCOGWxzu+IDswgGMj8iWaKj4jOzCSmzEcIvmi4/HlmjU+HzswgGMT8guDN0ROHVrnJ7xIdkaLRmfkl2oRCNOtxp7HJ+UXTiA8VnZhdOtxr7FF2VrbG8Pi9icHhaxOTP+rZ2/68ROHMAZ/8RCrMTp1qKh4lvPCw2n3Jn5EzsRKZTjIBZiJTaiEJVoRCd2It2YeTk/Ae2BldiIsUM9UIlGdGInDuD5UegTC7ESG5FulW6R+TlM02IWXWInDmBkfmEhTjepgY0oRCUa0YmdOIBRHxYWIt2EblEf5izFFrPoEo0YbhoY9ez8rwMY9WFhuMUhjPqwsBHDLZov6sNCIzqxEwcw6sPCQqzERqSb0c3oZnQzuhndnG5ON6eb083p5nRzujndnG5Ot063TrdOt063TrdOt063TrdOt063QbdBt0G3QbdBt0G3Qbf4ZLyMwE6cbnPqZ4t5eImFWInTbQ7FtZid1+ZQXIvZeYlGdGInDmB8TH5huHlgJUblOjHuuXqgEztxAM+njhMLsRIbUYhKpFulW6VbpVujW6Nbo1ujW6Nbo1ujW6Nbo1ujm9BN6CZ0E7oJ3YRuQjehm9BN6KZ0U7op3ZRuSjelm9JN6aZ0U7oZ3YxuRjejm9HN6GZ0M7oZ3YxuTjenm9PN6eZ0c7o53ZxuTjenW6dbp1unW6dbpxv7KrTTrdOt063TbdBt0G3QbdBt0G3QbdBt0G3QbcDNjoNYiJXYiEJUohGd2Il0K3QrdCt0K3QrdCt0Yy0x1hJjLTHWEmMtMdYSYy0x1hJjLTHWEmMtMdYSYy0x1hJjLTHWEmMtMdYSYy0x1hJjLTHWEmMtMdYSYy0x1hJjLTHWEmMtMdYSYy0x1hJjLTHWEmMtMdYSYy0x1hJjLTHWEmMtMdYSYy0x1hJjLTHWEmMtMdYSYy0x1hJjLTHWEmMtMdYSYy0x1hJjLTHWEmMtMdYSYy0x1hJjLTHWEmMtMdYSYy0x1hJjLTHWEmMtMdYSYy0x1hJjLTHWEmMtMdYSYy0x1hJjLTHWEmMtMdYSZy1x1hJnLXHWEmctcdYSZy1x1hJnLXHWEmctcdYSZy1x1hJnLXHWEmctcdYSZy1x1pKYHtn0xEKsxEYUohKN6MROHMBGt0a3RrdGt0a3RrdGt0a3RrdGt7OWaGAhhtsIbEQhKtGITuzE6TZnN7VYcy+xEKdbDG3FsnuJQpxudgQa0Ylx3CxwADmG4hxDcY6hnDM7FwpRiUZ0YFSNGEs653AujL1ogY0oRCUa0YmdGG0WxyKeWxYWYrjF5sRzy0IhhpsEGtGJ0WbRfGfVCDyrxomFWImNKEQlGtETYw5n8xMLsRIbUYhKnHsRg48xnTOxEwcwnlAWFmIlNqIQlUi3Qrfo7Ygh1JjOuTDqw8Jwa4GV2IjhpoHhZoHh1gOd2IkDGPVhYSGG2whsRCEq0YhO7MQBjN6OhYVIN6Gb0E3oJnQTugndoj70aN+oDwsLcbpFYYrpnIlCVKIRnTjdIrwxnXNh9HYsLMRKbEQhKtGITqSb0S16O2IkM6ZzJlZiuEWTRNUYselRNRYa0YmdOIBRNRYWYiVOt+gQjEmeieEWmxNVY6ETO/Hh9ui6nDirhkQvVUzyTKzERhSiEo3oEyWwE8NtbnpM8kwsxEpsxLCwQCM6sRMHsITFCCzESmxEISpxus0XP1rM7EzsxAGcBSSxECuxEYWoRLpVutVwK4ED2A5iuNXASmzEcJPAcItGbeEWDdWc2IkDKAexEGNwIUhBBnJQB40kDfF5CsbUysRCrMRGFGL0oQcZyEFxYQwaSeeDQlABVVADhUnIuBJne8VASMyoTOzAGVGJ0Y+YJSkxuBGzJBON6MRQaIEDGGFcWIizUWocvgjjwnCLQxJhXGhEJ4ZbnAsRxokSsyRl7rzEGnyJlRhuI1CISpxuc7kGiQmTiZ04gJHLhYUYZS2ogQQU9TrIQA7qoJEUF/STwqQGVmIjClGJRnRi7FILHMCI48Jwi2aNOC5sxNDVwFCwiRGxhYVYiaHggUJUohFje6PhpBOnm0Rjz2t0YiFWYrhF86kQFWeEGtGJHWdEJPzESPhCHvBI+MJGFOJ0k2jUGfFEJ043iUa1AfSDGPsWTe2V2IhCVKIRwy0aNaK+cAAjsxL7FpldWIgxYBbUQAJSkIEcNC3nK0QSUxJPjCmJidNnvr4jMSUxce7gHDOQmJKYqEQjOrETBzDSOocEJKYkJlZiuEmgEJUYbj3QiZ0YD0qTIrQnFVAFNZCAQnG2dEwwFIuNjhBaNFGEcGEjCnFuqUXDRTQXOrETBzACa7GDEdiFlRhusZER2IVKDLdogQjswnCLHYrAnhiBXRjnVlAFNZCAFGSgqejRRBE/jxaI+M1nH4lpiIlKNOLcUg+xiN/CAYz4LSzEcAtqIAFFowQZyEEdNJL6AQoTDazERjRibGb8WYR1YZzWQRXUQLGVcWji6rrQiHNDe7Rp5HXhtJqPPhKTDBOn1Zx/KjHJUOb0UolJhjJnj0pMMpT5KCExyTDRiE7sxAGMvC4sxHDrgeE2AqfbnHskMclQRmxkJHPERsb97Ylxf7uwECuxEYUYYrGbcb08MaK6sBArsRGFGGLRUJG5+RQkMe0vsRGF+Ni3qIwx62+RgzpoJM24LSqgCmogAcFD4aHwUHgoPAweBg+Dh8HD4GHwMHgYPAweBg+Hh8Njhi2uHjFzb5GDOmgkzbAtKqAKaiABwaPDo8Ojw6PDY8BjwGPAY8BjwGPAY8BjwGPAY6RHzNBblB4xY07nqr0SM+ZkriwhMWNO55OsxNw4nY+vElPU4poRM9QWFdDcivnkKTE/LS5tMT1t0UiaV45FBVRBDSQgBRkIHgKPOIFnsmNK2qICip3ywNip+Jt5asYVLeaYnTRPzUUFVEENJCAFGchB8DB4ODwcHg4Ph4fDw+ExT9y4yMY8s0UdND1m8GOS2aICilaIBjnPyCMwTpc4juc5GXielCcWYiU2ohCVaEQn0m3ATY6DGG41sBIbUYhKNKITO3EAy0GkW6FboVt8VrwFKchADuqgkVRD8cTYUgm08yPYEjPDFnXQ46/jehjTwhYVUAU1kIBix2cMY5aXzt4CiVleiZUYu9gDhahEIzqxEwcwIrewECuRbkq3uHDMHgSJWV6JTpxuNY5DXDxOjKtHjWaNy0c8yMcsL62x83EBWSjEcAvjuIYsDLcRGFeRMD7XNg/dc23zEwuxEhtRiHFxijM6riHxCB0ztzSehWPmVmIjxhUvzoS4kCw0ohM7MCIaTwUxG0vjWThmY2k8vsZsrEQnduJIjNlYiYVYiY0YbiNQiUacbvFgHbOxEgcwwrhwus3ZjxKzsRIbcbZvOVGJRvSJp1gnDuC5fuqJhViJ82hG9BWLDYtisWGJOVoqJzqxEwewVeJsnXh2j3lXC88uxaAKaqBZ6y3IQR00kmb8FhVQBTWQgBQUG+OBTuzASFs8z8fsqMRKnMcnHphjdlSiEuduxNkSl8WTOmgkxWXxpAKqoAYSkILg4fBweDg8Ojw6PDo8Ojw6PDo8Ojw6PDo8OjwGPAY84sIZt10xBypRiNFecVJEVhc6cR4S1cCRGHOgNO6AYg5UYiU2ohDDbQQacbpFL0LMgdK4uYs5UDoHsiXmQCUW4nSLu5OYA5UoxHnlDK24cp7koA4aSTOmi0JRAueWxp1MzGjSOIFjRlPiALaDGFsaux15XNiIQlTi3NTwnZdVjwaKW9roQ4j5TBr9AjGfKXF6nX8V19p4yo75TInTKx6e7byzDbHz1vbEef2PX82P+cn5gU4PMpCD4h44GisukidGbBcWYiU2ohBjo6KN4yK50Ikjtyo/3CeWH+6T8wOdsfXxzY+TBBTi0ZLx/LXQiXNX4kk85h0tjOtnPKrHvKPESmznx1DE8oM/YvnBH7H84I9YfvBHLD/4I5Yf/BHLD/6I5Qd/xPKDP2IDHgMeAx4DHgMeAx75wR/x/OCPeH7wRzw/+COeH/wRzw/+iOcHf8Tzgz8S84s0+hhiflHiAEZO44jE/KLEaDENbEQhzqvccSoY0YmdOIBxTV0YuhY4j3CcoTFnSOPpMuYMJQ5gpHXhLJlzQT+JOUOJjShEJc7GOQUc1EGzNsczbUwYSizESmxEISrRiE7sRLop3ZRuSjelm9JN6aZ0U7op3ZRuRjejm9HN6GZ0M7oZ3YxucbGeI+USS8EtjMv1wkKsxEYMtzjJ4pq90IjhFidOXLYXDmBcuBeGW5xZcele2IhCDN04CeKyHE+/MTUosRKnQtwFxtSgRCXO7Y0bzZgalNiJIzEmDFncMcaEIYvHwJgwFJ+DkZgwlCjEcJNAIzqxEwewHMRCrMRGFCLdCt0K3c7Ae+AAnoE/sRArsRGFqEQjOpFulW5nh5MGFmIlNqIQlWhEJ3biAEZ9iGfomDCUWIlKDIU4bpH5OVouMQkosRArcW5vPODGJKBEJRrRiZ04gJH5hYVYiXQzuhndjG5GN6NbZL7GWR2Zj6fwmASUGG5xsCLzC4WoRCM6MdyiJSPzJ0bmFxZiJTaiEJVoRCfSrdMt6kP0BMQkoMRKjI65aIeoD/HoHZOAEo0YHYBxlkR9WDgSYxKQxTN0TAJKrMRGFKISjejEThzAQrdCt0K3QrdCt0K3QrdCt0K3QrdKt0q3WR8sHvRjPpDFc3HMB0pUohGd2IkDGPVhYSFWIt0a3RrdGt0a3RrdGt2EbkI3oZvQTegmdBO6Cd2EbkI3pZvSTemmdFO6Kd2Ubko3pZvSzehmdDO6Gd2ilkQnRkxHSgw3CXRiJw5g1BKJUyNqSXQWxKykxEYUohKN6MTpFg/V4+wOD+wo5rG8W2IjhkXsRRSQhWGhgU7sxLAIhSggCwsxdsgDG1GISjSiEztxLNSYuJRYiJUYN1o90Iihe2InDmCUioWFWImNGB1KR6ASjRj9ViWwEwcwSsXsfdCYq5RYiXFbd6IQlWhEJ3biALaDWIiVGHtRA43oxE6MvWgToygsLMRKbOthSGMGU6ISjejEThzAc4DrxHb2FmhMVVqkoDnSEAdqRn9RB8X2h0wEf2EhxvbH70bwFwpxPpvGYYyPA5/koA4aSdFncFIBVVADCQgeDg+Hh8PD4dHh0eHR4dHh0eHR4dHh0eHR4dHhMeARSbc4eSLpCxtxtpefv6vEeXZ5nEeR9IWdOI/O7EnSmPSUON3m4JLGpKfERgw3C1RiuGmgEzsx3OZBjUlPidF9eQRWYnSS1kAhKjH6SWN7I/8LO3EAI/8LC7ESG1GISqRbpVulW6Vbo1ujW+S/RzvErcJCISox3DzQiZ04gFEVFk63OGFimlRiIwpRiUacbiPaN24VFg5g3CosLMRKbEQhKtGIdFO6RcUYcZ5FxVhYiOEWDTUrhh+x6bNi+BFNPStGohGd2IkDOMtGYiFWYiPSzenmdHO6Od2cbp1unW6dbp1unW6dbp1unW6dbp1ug26DboNug26DboNug26DboNuI9zmYYkJWYnhZoGV2IhCjB78IzC68GugEztxAMtBLMRKnG6za0RjQlbi6nrXWOltUQdN/diqGCU4qYBC3AMbUYhzV6IBZuVY5KDYjx44gO0glnMwQGPK1qIGEpCCDOSgDhpJs1wsgofAQ+Ah8BB4CDwEHgIPgYfCQ+Gh8FB4KDw0jvyJRnRijonoOcHrxFkfvJ5YiJXY1kiJnrO8Fs47oriSnfO8Fjqxr/ETPad6nRj1YfZQaEz2SqzEeZ8UZ9wsD4sUZCAH9aSoAfXE2Sw1NiTSXmOjI+0LndiJs/1rnJ6R9oWFWImNGG5x0kbaFxpx3qPE1sRYw0ljUUz5WlRAFdRAAlKQgRzUQfAo8CjwKPAo8CjwKPCIlM+uF42JZomdOICR9IWFWImNGDN2aqASjRiTdiSwEwcw4i6xkRH3hZXYiEJUohGd2IkDKHQTugndhG5CN6Gb0E3oFvmfE3k1JsKtfYs8z4F7jZXXEp3YiQMYeV44xeajtsbEuMRGFKISjejEThzAyPNCujnd4no/H+w1JsklKjHc4nDH9X5hJ4ZbNFRc7xcWYiWGWzRfZF2jUSPrCztxACPr8SweU+g8npljCp3Hs21MoUsUohKnWzxJxxS6xE4ciTGFzuPJNObN+Rwz15g353PMXGPenMeTXcybcz9/14hO7MQBjMv5wkKcblGdY95couYpt6bLnejETkT0YuW1xLCITY+gL2zEuUNx1Y/pdYlGdGInDmAEfWEhVmIj0q3RLYIeV8qYfZfYiQMYQV9YiNMtnqxiTl6iEJVoRCd24gDGpX5hIdJN6RaX+zkBQGNOXqIRwy0O7Fkfzv86gGd9ODHc4hBGfVjYiOEWzRf1YaERndiJAxj1YWEhVmIj0s3p5nRzujndnG6dbp1unW6dbp1unW6dbp1unW6dboNug26DboNug26DboNug26DbgNuMdcvsRArsRGFqEQjhpsHdmK4zdoXc/0SC7ES4w60BsYtqAQq0YhO7MQBjFqyMO52NbASp1s7MXRjL6JqLOzEAYyqEf1vej4NnFiJjYg7xpgBmGhEJ3biAEbVWFiIlRitE813Pgac6MROjL2YdUfPR4ETC7ES25pupTFxMFGJRnRiJw5gTEdaOO/F56wNjfmCiUo0ohM7cGa+R99CzAXsR5wwcT9/RJPEDf1CJ4ZCnA8z3Qtnuns8EceUwMRKjO2NI9+FqEQjOrETB3CEW5waoxArsRGFqMScPaoxD/Bsh5gHmFiIodsDG1GISjRi7MUI7MQBLAdxupVwmzlObMTpFs/1MQ8w0YjTbU430JgKmDiAM8c9Oh9iLbQ+B+o11kLrc+hGY45gj6f7WAstUYmhG/sW8+tPjAn2CwsxdGPfmubJFbMBE53YgXIQY3p0bFl09i9UYkyPji0738U6sRMH8Hwd68RCrMRGFGI8yEabRY//wgGcgUycOx/PyTE/MLERhRh7Ebt5voh1ohM7cQD9IBZiJTZivHgQDXW+m3Vi7MX5CwMY4V1YiLEXcXJFeBcKUYlGdGK85hAteb4TEzgOYiFWYiMKUYlG9MSYFdijqyCmBSZWYiPGXmigEo3oxNiL888G8Hz75cRCrMRGFKIS41hY4ABGTBcWYiU2YoweBynIQA7qoJHU1ptNes4VPKmCGkhACootj0aX2MYeWImNGPt+BCrRiE7sxAE8X4s5sRArsRHppnRTuindlG5KN6Ob0e3M7ghUohGdOFunnX82gDO7iYVYiY0oRCVOtzlxRmOeX2InDmAkOgpBzPNLrMRGFBysM9EnGtGJnTiAcTleyPNh8HyIC+9ckUBj9l+PR9OY/ZfYiSMxZv/1uLOM2X+JldiI0WY9cLrNKTIas/8SndiJAxiX44WFWImNKES6xeU4bipi9l9iJw5g5HxhIVZiI4abBYZb7Ga8AbfQiZ04gOdbcCcWYiU2ohDpFpfu6BWK2X+JnTiAcRVfWIiV2IjTLXqFYk5gohGd2IkDqAexEMPNAxtRiEo0ohM7cQCjPoygAqqgBhKQgkIxmjNqwPlfowYsnH9+nL8gRCUa0YmdOIAx4X9hIcYMhzhdI+0xgSRm+CU6sRMHMNK+sBDnXkTHWczwSxSiEsMtTu2oAQs7cSTGDL/EQqzEcJPAcNNAJRrRiZ04gFED4ljEDL/ESmxEISrRiE7swFj7ILrezrW9FjZi7IUHKjH24lRwYifOvYhho5jLl1iIcy+iszHm8iUKUYlGnG7nlkXaFw5gpH1hIVZiIwoxdGdRi/l5sjB+N/Y4srpQibFlPdCJsWXRDpHVE+PufOHcsuimi5l4iY0oRCUa0Ykx+6cEDmBc4RcWYiU2omCP41oeY2Qx5y5xAONavjB047SPa/nCRhSiruVZ9Fw3bKETO3EAz2VNTizESozWibxFjhc6sRNjLx6H22KiXWIhVmJbi+/YuULYQiUa0YmdOICxhsnCaB0LjO0dgU7sxAGM6/PCub0jxOL6vLARZ6vPCSYWU+oSjejEThzASOzssbOYUpdYiY0oRCUa0YkDGIGcY4YWM+b6iCaJC+1CJ3biAMaFdnbIWaz5lViJsZE9UIhKNKITO3GOiR7RqDO8iXNU9IiGmuFNbMQ5MHrEbsZsuoVGdGInDmBMqVsYbtFQMaluYSMKUYlGjB2KcydeeJt3sxZT2BJj+Db2ON55WzjyF8o56nxiIVbg+epHOdkvHC9/zL4dK+fbHye348LxtsnsELCYtQVuF5YL64Xtwn7h09eDB1mOC5cL1ws3cjTorLIWk40SndiJAxizFRcWYiU2ohDp1unW6dbp1uk26DboNug26DboNugWMw1mTbeYVnRiTCtaWHDUa6nE0NVAIYauBxrRiZ04gPUgFmIlhtsIFOJ0i7oXU38SHdhw7sY0n0TuRWvEqRslMKb6JBrRiXMvopbFdJ+FgmMRE34SK3G6eWz6vPtIVKIRndiBs9iNqJwxo2eM2PR4nXihEZ0Y2xtHKMraiVHWFhbi3N4oojGlJzHceqASjejEcLPAAYyyFpUopvQkViLPKOcZdabwxAh81OGY1wPuFx7kfly4XDgCHxU2FnwCC3mcHC09Tq/Yi9EvPMAxNwdcLnx6eXC7sFw4itp8JrKYpwP2C/cLD3I5LnwWtSO4XvgsaiVYLqwXPotpDfYL9wsP8vnG4OJy4Xrh07cFy4X1wnZhv3AnnxeMOTphMVHnDGFjYBsD2xjYdgY2NoWBjYk6Zx4bA9sY2MbAxkSdRCEq0YhO7ES6Kd2Ubko3pZvSTemmdFO6Kd2UbhHuKBoxvyexEhtRiErsWWvaGVgJrMRGFKJmKYk5O4lO7MSRBSbm7CSWLCUxZyexEYWoWWDauSzAiZ5VpZ0LA5w4gOdlM7bhvGyeWIkN9aKtWnCyXtgu7BfuFx6oKbJqxMmFfN4ERa2R82YnaoecNzuL7cJ+4X7hgZoi583O4nLhinoh583OYrmwXtgu7BfuqC8xRyVZD9SUmKUCrhduqBExUQWsF7YL+4X7hVmPYrrKqhcxXwVcL9wuLBfWCztqjZw31xqoRCM6sRMHME7qhYVYiY1It063TrdOt063TrdBt0G3Qbe4F5yD5BYTTRKVaEQnduJIjIkmiYVYiY0oRCUa0YmdSLdCt0K3QrdCt0K3QrdCt0K3QrdCt0q3SrdKt0q3SrdKt0q3SrdKt0q3RrdGt0a3RrdGt0a3RrdGt0a3Rjehm9BN6CZ0E7oJ3YRuQjehm9BN6aZ0U7op3ZRuSjelm9JN6aZ0M7oZ3YxuRjejm9HN6GZ0M7oZ3ZxuTjenm9PN6eZ0c7o53ZxuTrdOt063TrdOt063TrdOt063TrdOt0G3QbdBN9YSZS1R1hJlLVHWEmUtUdYSYy0x1hJjLTHWEmMtMdYSYy0x1hJjLTHWEmMtMdYSYy0x1hJjLTHWEmMtMdYSYy0x1hJjLTHWEmMtMdYSYy0x1hJjLTHWEmMtMdYSYy0x1hJjLTHWEmMtMdYSYy0x1hJjLTHWEmMtMdYSYy0x1hJjLTHWEmMtMdYSYy0x1hJjLTHWEmMtMdYSYy0x1hJjLTHWEmMtMdYSYy0x1hJjLTHWEmMtMdYSYy0x1hJjLTHWEmMtMdYSYy0x1pJz/a245bOzlnigEZ3YiQN41pITC7ESG1GIdDvfqy2BTuzE6Rb3VOc6XAsLcbpFj925FNdCISrRiE7sxJF4rsi1sBArsRGFqEQjOrET6VboVuhW6FboVuhW6FboVuhW6FboVulW6VbpVulW6VbpVulW6VbpVunW6Nbo1ujW6Nbo1ujW6Nbo1ujW6CZ0E7oJ3YRuQjehm9BN6CZ0E7op3ZRuSjelm9JN6aZ0U7op3ZRuRjejm9HN6GZ0M7oZ3YxuRjejm9PN6eZ0c7o53ZxuTjdHjv18574GNqIQlWhEJ3biAJ714cRCpNug26DboNug26DboNuAWz8OYiFWYiMKUYlGdGIn0q3QrdCt0K3QrdCt0K3QrdCt0K3QrdKt0q3SrdKt0q3SrdKt0q3SrdKt0a3RrdGt0a3RrdGt0a3RrdGt0U3oJnQTugndhG5CN6Gb0E3oJnRTuindlG5KN6Wb0k3ppnRTuindjG5GN6Ob0c3oZnQzuhndjG5GN6eb083p5nRzujndzvrggU7sxAE8V+84sRArcbrNycgWM4ISlRhuPdCJHXiWihbYiEJUohGdOMXqiSMxJvwkzk2fk3AtJvyMOZnQYsJPohCVaEQnduIARqlYWIh0K3Q7X78tgUo0ohM7cQCjVCwsRFwkBm8lBm8lYhrQaNEkUSoWOrETB/AciDuxECuxEYVIt0a3RrdGt0Y3oZvQTegmdBO6nX2IEvt59iEurheOPkSJg3D2IS7WC9uF/cL9woO8FqQ/uVy4Xvji6xffc7xrvsdr4xzXmu/T2jjHstZ/j23TOMA9tm2+MWsxAQfcLzzI47hwuXC9cGybRhuefeWL9cKnrwSfvhGms69co23PvvI5t9GPs6987osfZ1/54nrh0JzHzo9zrGxxv/Agn2Nli8uF64XbheXCeuHTV4JPXw3uFx7kc6xs8elrwfXC7cJyYb2wXdgv3MnnJIoWbXiOH8wJHX6cYwZzBX8/zjEDiTY8xwxOPscMFpcLy4XP87kE9wufOnXy2dcv0VZn371EW51994sHeeUu2mfl7uR64Ub9lbvzv+uF7cJ+4c52OHN38pm7xeXCl/115T6e48+LL+1wZqTE354ZWVwv3C58jj3EsTgzstgu7BeO7Z+v9ng5szCvi17OLCxuFw79+eaMl3NsebFd2C/cLzzIZ14Wn74tuF64XVgurBe2C/uFO3ktOS3B5cL1wu3CcmG9sF3YL9wvPMjt4tsuvu3ie05Gmhd/X5ORFuuF7cJ+4X7hQT6ztrhcuF74ckzPDC7WC9uF/cKdfOZxvqfj5Rx7WywX1gufmh58bvM8b8uZ08XnNo/geuGzjsW5euZ0/b5e2C7sF+4Xvvj6xffM6eJ64Xbhy76cmV3sF+4XHtzfftHsF83zenru43k9XWzc337Zl37Zl37Zl3HZl3HZl3HxHRffcWnDcWnDcWnDcdmX8xoaXM9r6OJy4Yr9rQc162EXduxjXfXh5IH9rYX7Uku5cL1wu7Bc+OJbLr7FL9wvzDas9eJVL1714lUvXvXiVS9e9eK1rqE1eJDP+rC4XLheuF1YLnxef0uwXdgv3MnxUBqX6HPKV1yBYq2nEReaWOwpcd7XxuWwnp+VOLERhahEIzqxEwcwHkoX0s3oZnQzusVDaVz8z4lgJ55flJDASmzEUNBAJYZCnLXxSHliPFIuLMTQjbM6HiklDmw8Ui5UohGdGG5xAKJ76sTonlo43eLmM1Z4Wn826DboNug26DboFs+cC6fbvEH3c0GneV/t54pOC6fuvJP2c02nhUZ0YicOYDxdLoy9kMBKbMRw00DFNsTT5UInduIAxtPlwkIMCwsMCw90YicOYDw8LgyxEViJjShEJRrRieE2D8A5E2xO0vdzJpjFsYgnxoVTzGIvohvJoiUjsQunmEXzRWJPjMQuLMRKbEQhKjHc4lhEYhd2YrhFo0Ziz82JxC6sxEYUohLDLZo6upEWhls0VHQjnRjdSAsLsRIbUYjhFgcgupEWOjGmu8axiMyf2xCZX1iIldiIQoz5bHEII/MLY3JtHM3I/MIBjMwvLMRKbMSYPRfNF5lfaMRwi6MZmT+3ITIfGBPDEguxEhtRiEo0YrhZYCcOYFSChYVYiY0YbhoYbvrf//1Pf/z17//6p//4y9//9i//8Y8///mPf/4v/Id//+Of/8d//fFvf/rHn//2H3/889/+869//ac//p8//fU/45f+/d/+9Lf4+R9/+sfj/z4O8J//9r8fPx+C/+cvf/3zpP/+J/718fxPH08Oc0JT/PmDpULicTn/IFKei8i8GQoJEYdA7CD/vj7/+zYvNfH3j1OaG+D9G3sxX01ae/FIx9O9kOcig+3AjZB2989bvJB37sW4KDyenT5I2EaiGRSMAr3fFfA5WzcEHmMdEHjUwA8CfdOQNiesnq3wuJt/KjGeSzzucbMdHrevx1OJsjmej/vMPJyP28nxVGNzOB6J7XlSPh59nx6OUnebUTo2Y3AzHo+BHzXau8d0tyOlckekPN8Rfa6h8WmO0Hggd8Q+7cfm1Cp65GF9POG2pxK+OTs9Y/4YuLrE3G4rdMH5bfW5wt3d8Oe7sWtMn3ONz8Z89PI8k6ibglkF5epxptenEvXdpqhtF9RREdSD56Z82ojNuRkvKZ8bMfrzjdg05pwsnFsx3zrjufm4dn5U2RzVx7CVcUPqcw3fnRlVcA2ZK/NeVD5dyTYFtMZnf85GteuRvX9YSnMcFi3PDkvblc+e50Y7ngrs68VwnuLy7Pxs9f0SvtOYH0TGjcV4fkltm1P00a2H80svrVHl4yFpu+bo2Rp26EVBb59cd0/Q9iMnaHv7BN0elfia/XlUHqOuT4+K7G7YYq3ac1d6udSv9ul2rezuVaqjPeYrGBcV+ahS3z8/pL17fuz3RXHrVuYEz+f7orvSYbhfeXStXrZkfNSwd8+P7b54DP6sm8jHcM3zfdmdp0UL9sV4lj065j5q7G5FYx2JU2NcjszjGe+Dhm7O1PmdjiyFj+GLpxrb7Rh4tnj0RG22Y3OemmM75uy759vxjSPjT4+Mytv3Dbq76s9eQWyI1PF8Qzan6nwlP5vkMWLwXMN3jwk4zR4tOV7TGMju/KTVa41676pv7171t+1ZRtbT+Sbw0/2wzWmqyrjo9S7/OxrWBp5W5HhRw6jhzzW2F6lYpOc8JofK04uU7cppLBh7avT2/EJnm/Nrfhwj9+UhctFo9zU6LrhzRaXnGuP9S6Uf714q97Ujlm9fteNjm348tl7f3Y7tke2CMth7ee3s6CylY3N2+K49RjH0XI1yya3d344YWjprR+36fDt2t7g4Ocal76m08lGhb7tK8sA2aZfMyn0NqQd6Sz5k5ZNGP94/z3v5red5r+i0eYyfl/L0PO9t1zPK3ooHl/Hk7Ojy7i2hbTs2D1ybHsM7L2XlMQg1cHYc/lSj++/NymNUK8+wx9jR89z3bR+pso/0+vhTP96oj10lbbwqyFVD7mc2ZuSerVHr8TS0o24vkopd+VDCyv0mVXQ3PMbV/LXTIz6XujT6eKoxdKeBvtrLqdHb/Y1w9C4+hsDa843YXqnzNP/4GPhxSGfs6qj1xvGU62EdtzWk4ZA8xnTaU41y/EAhLcdvrqSDdwzjaPa0kpbj7af83aGNb0CGgn8oHMenjdg94sfiE+ue9DKg0MsnDdv2uRZln2u7ds61TzK74uEp8hjhpIQf9w/MYJs+Ru1q2RyYXTVtuNevj6HpS1fBp4bdDjndusjtt0NwlavSyvPt2Pa8Kqq62dORgd14Uaygup5G/XmnaSm7Sz5F6vDx9AK1FWkxaX49kbpsRH5g3OkHBp5+YOTpJ4aebjfp9Ub9O8eljo7r3Ifuuc8iu/GnuyPFZT8EdXOseDcIdXekYd+wcuCaKbuG3Q5DVVzvHtiejxdvRRq25PFw2zci/f3U1PF2anYSN1Nze082qdk3KR7Ve/NXj4u13JDeL92ev04G2I1GXS54fp1s82k+wP5cdea3X58LP5+r7Qfqanu/rrb362r73XW1446o9WuX4+cm3Xav32zS3XDUzSaVt2cG3N+TV5v0epZKffEWgt2W7ZG6zXHxbX/yrdkv8gMFVd4vqPJ+QZUfKKj7Fn33LnV+yBp92texhl9mNcl2TCwvlfOF3OclefcQwpH5Uq7F9HNF3reHsz36i216b1pR0b59AsHToVzmIP6iMd4/03dDUTfP9J3EzTP99p7s5nrtWrRx/EYut7nf0lA+WmqT5y26ey6Myf5r/MaPFzWa3tHYn2G3Zq7FRIR3z47+9tmxG4m6OeJavLw55LrfinuD6cXb7s70ziy84rv70hIfclplsOt1hpJ+S8Y5i3qUnczujq4e7KZ/PCOWjcyuouKeTqtcJD437fZ0R+e2+YsSONvr5Vn7V4l7O9LKRmLbpKVgNOlxvvvzJu27e8ub89jKdkzq9kS28v6w1BdbopVbcq1nv27JtnEd4WnH5lT7xrbYblv2Ml0pc+kO/aZMRzdEmV9Re12GQwC9jVdlvPNS3o/NGbMbq7pXrrejXc2xO20X593eWMcI4lwEarMv+ptFbpa3rcS98raPT7/Ep70aHzsYHyvl1TPNMCGszGnQT2XqbtDq7tGpR/3NIvcO8V7i5iHeN2tjgE2Pzc7YT9SBrcxcqy8b1kd5cuXYS8RnZNexubz09i0JjErOtb+eXb++uKrjLac5gr85R0r5gaq235Yqxm2xzSHevS9185Z6exM6Kqe8jOt82182ZDc4Kdwd8c1F/f7j0tOup7odvcJQnPvzB4R998St1zlq2TxMS/Rrn8OKxZ5359W6e9pxvA1XXZ5vSH2/l7XWt3tZ6w+8f1Xf72X9okU5UOtdX9JoBUW1lcsT5Pc0vLyt0TA/orVrWf6WBh6GH3LPNXavT93sa/lC41Zfy35fhO9Fi433NV48x1odnWOjz4/t7hWqYsKBr8t16tfA7DbEFSeI2/PysRtwun1w/TcfXC/cl01wtxPUD47Bl+uk2+81Kl9O6ZuzbDfk1AamnByb90B371C1wSmioz5/+I2ug6cXKfYbPXrCN/fu27eocKdaP/SD2f32kMI35OR5e2yvtxXP31Kv0wA+X2/l/fGAKu+PB1R9ezxgK3HzeivvjwfsW/TeeMBe4954QNX3+/K/ODvuvYWu/v6R9feP7A/cZm/HrO7cZn8RWZRjuS6E8ktk9yJ4YJe6u8+2H5icVW37nt+9yVl1N+Z0d3LWvk0cz6cyrtN3f2kT/4k26T/RJuN3t0mssbXaxDdtshu/ev+cV85W0w/v7PyyGe3W5fLyhm39vB3+9mDAfisEDXrpKft1K2y3I4VrtbSnvULbbpSDJ/uD+3hNJL5hvkTGcbwmMsqgiOhLjeq42z42h3b3KtUPSDwaEr0XD9anu/KFyL0jsxe5eWT2IjePzDa5gsUC9MMbe9+5Wn14BfvQF0VKvbx3XF4UEaxjNj/x+aJIwx3i/Fbjc5FRfuBCsx2qunuhGe03X2jm9yCzTbTt2kS3HffK0ZkPz+7fEumXMcnjaX3dvoOjmKEwlxvf7M7u7SiOsYrZ87nAdeweR/jS7WMs6Wm3Stu9YXXvwbsd28X7MPNDPnS5f16aZjdE1Hgn0a6vZP8qshsk8uOyKsT1rP9lgZtj1/9/8A3Nuc69bmS2W9PwYFLmiqEbme17iehb/TCI8I1KfdmQuWro01O2Hf3trvd2vN8V0MrbXQFbiXsPjPf35HlXwBcteqvrfatxs+v9C41bXe97jXtd719o3Op6b6W/3Tv7hcatrpH9vtzrer+v8eI5drPrve1esrrb9b7fkHtd762+P4f1C40fOLj3ut7b9rWkm13vX2zIra731t6/A2jl/a73tl0V7mbXe2vt3a73bXvc7Hr/6j5TL/eZ7cl9Zmv2/s3qVuRmf8L2LtPx7lu5Lgbwyzn2A9d9ef+6L+9f99sPDAHs79txrSxjPC+Fu4Gq22Ws/cA99265PxNMC350m7Xnsd3NL7kZ2+MHYrtdVGVwxcBjvHRsa0HHyocVFD8fFy1vV2StP1CRddf1xr4ZOUZ5VeRmWde3R1S3jXrz/NgtuoM5f5f1DD4t7/5Vr9tlqeIh8mLXnfDhdNizrrtmx/v9f1uRH+mrvtkiX4jcbBH5iRaRd1tk/5I4y2n/0Av5qWOo7Uaqbo7aN3v/fdVmb7+vupW4ecm+vSebx6hti94btd9r3Bu1by7vPwH5D9w67M+wWyP/zd8e+d9K3D07bu/J80eo/u7I/xexx7IsXXwT+927VXfv1Pfz7O/Ffvde1c0Du5O4eWBv78km9tsWvXmn3n+gN2m/Hfd6+sf7z/njJ3r6x0/09O8Gpm4/dQx5+65yvP3UsT22N5869ho3nzq2i/7dPD/G+08dsn2Qu/nU8YXIvacO2b62dPP86O+eH18sG8Q7Qrvcevy6RsWmBt1bXmL/xZlb95Ry+NsXFznefvd/K3Hv4nJ/T/y1Br05EbS8fUcpu9elbt5RfqFxczr7u4d1/yGgA6utl6NsLk/7j/jcfaFbdkNId1/o/sambN7n/kLl5uvce5W7b3N/pXLvZe69yt13OKXK75e5+epj2y7reu89Xam/W+Tey757iVsv+7afyeBuVOruW+FfiNwLcvuRILcfCXL7kSC3Hwly+5kgt/77ZX4gyMNqnvzDLqPtn69AIj/w6r9I/c0iN6uBvP3q/xcf+OOSl0c9jk2r7nqJb76Nff+ri08f1WT3psmtvqLtOHk1fqBiXBdF/vT1NN2+kclvENT2rNv9C4nO2TpPR6dF67v95dvG4BeHHj0SY9MYu0v4zfm2sh2iujnfVnYfULr9zUN597jsXrU1fNTBLpXj8zr1WwXhLGh7rrC9O7tcpi5dCb98dXH75cY6qNGeasj2TaibX/yQ8u55/sWnCvmVbavl+XfGZPcy1c3Y7yVuxX7X5X6zOXZXFa5H8cCnh6S9e45vFW6d49svR948x/dfn7x5ju/esbl9jm/f0ztYusq1QcZ9DeUUY5WNxv7lCXzmZxb2zZfbdiNLN5Oyl7iVFB+/t3B8bI7nH+Xbf0uTXaHl0j/zy7c0b2uM9zUuswW+903PAo1eNt/B7Lq7CfPLTdixEdnN7K+N59i1h/l7IhxOedwZviqi3BIbPyByvcP+zkdKC54rrdT24sEZuE3Xo9YXRVrlO6XyvF1vf/q19pda5NH9wfdj6+7Q7GJz/RTuLja2Hae6s9Cs7N6detzUQuNaEn/dkN0TlOJ1hUdtuzwA9U8au5Eqjh8+8Dql/dPB3T0AHfzix1HlucauPM/3i7I8P1pVn+/NdnYKVyJu2jfNuhVxHht/fpLsP615WU7Oa33+FWrdfaNqXF6TvX6Ybnzjk7oNC8zLtUm+81le5XC3VnnxU7Sq0FCV1zR4xdJen38Ne39khB2ZLr28qKK83XRtzz+ZvPt06r17763CrXvvLz5ryT35OFvmY2vshlXHMfIaMcrTO7y9RKn86qk8u/Hef5yusfuii754ZLty9Kzr7mPYuzcN7902fyFx57ZZ69vP299ojt2Hzr9QQadjt+PF6D7+slOlbopZffvZ/wuJe4fGf++h+dAcrb98aPSi8rxDZftJx3ulbC9xq5btv4JY+RnWUfvmI/Tbd6dudapsJR6FFBNe4lrxmohxrQ2/fr/9eyJ87nWzl860camsQzYfo99+1fGnPlJ5uXeu43qTd7wmch0T/Z7ItZvm8tz6LZF28Ln1+HC7+VFEtt++4OhSPZ5//VzlB3r/VX6g91/lB3r/tys6Dix/XD/cO//SJO+OUW0nVd/ck53GY6CcH90a1z1p9zW8ct3iD1eKz8809e0L517i1oVT3363ZN8YODUejxG2aYzt637CVXL82IhstwRXzcsEhE9PvPvNUC7Wo9dJkd/aF8VEQHucKS+L4Pqt49VW1YZvdtshz8/13XJM/NKdjo3G7mNCN5/MjnfvZmy8Pyqy1bg5KqLb9f5ujor4dlI1+0TH9cOhUj5tyPsPVfb+Q5W//VC1aww5cJbLce0L+dwYu7Gqm42xl7jXGPpbG4Nrlsl1OOTXxvD3G8Pfb4y3R6lsN3QwjC8OfOibqt/QwKPHQ6M9v/PpP7DuqfYf+Ci19h/4KPVuHQrHmyX9MiL762bYTzSI/0SD9B9okF05Ni7cYna9e/k4wKzbF6nQp9Mu14Tebm+FFL4VUj+cqeO+RjvYv13rZk/erqVl+6JNQ6eBXNco+rwdZfuxo5u9KOXd+47trty98diL3L3z2C8Qcu/OoxzbHi6u2jQuq+L2j9cX2w9P3eslt91rVPe6uPf7Mho7Yi5fDfxlX/ar+uHwHpdPBjY/viNybx3Yr0RurQP7hci9dWC/ELm36kE5tgPDfDPsuDwBfTo4W41HpjhF/jjkeo1o35IxHuTjEpxvy/AAHZfOh19l/P0z7ottKXjifrC+vEtl8EjXy9ftvilTLw1c3Z/KWPHfLlN541nLZbGMXyK9Fan4uHutlwr3PZGG+UAPHK+KGIfx+/Mt2Y3iO8bfx/Vr9+3TZuyW+3vcyqHTbOjzj6Lb9rWoe2sR2Hbm/73XRW339uy99wrtiyVZUmLzuuj9PfHNnsi2Z/fOWgT2Ax+V+mI7bq1FYO3tz/3YboDn7loEtp0rf3MtAttNdv8RkftLF1vbX3JuLl38xdbcXbrYdovl3Vu62NoPLC9nsn3V+s6L/Nbe/iDTNjg3F3rYa9xb6MF2Y1U3wyfbvpZ7Cz3YbtG/uws9fCFyb6EH204Jvnd+iL57fnx1b4Vx1QeLPb8pen+4yt4frjKV3ypxczW1L5qUX3J9NK8+b9IvHpNuLVP3lcitZepi3sK7D2xbkbsNW7YDVhivaq/22HDIS55K7LoV73Vvmv3A4L/ZDwz+m/3A4P92NaIBDRl+ud39NHS/09B+8Bbx8pL5dzSsYu7842pWnmqYv/2K6nYzCmasP/oVX9yVVnH/0ZptdqX91l2RIrwNGpvN0N+6Gcq3yrW1zWa8PWhl7w9a2fuDVtvGMMz+tX6dffS5MXbLuf6ISBF2V+nlWeiXIfPe3q3H++24O3S/35l7Pei2Hba62YPet3eFfND9MLTx6aspthu1utsP0t9fPd3G26unbyVu9oPc3pNNP8i2RW/2g4z3l0D9Yjvu9YMMe/tRbNfhd7sfZDsuercLY/+hgLudBr59repep8H27a6bu+NHfb/nwY+3v0exPUdu9jxsh85v9jxsNe71PPhuQOTe6e7bL57c7Hnw3dzjuz0PX4jc63nw8nbP1LZR750f/vY0ES8/8Bzl5Qeeo7z8wHPUdtYeF/1qH5bY+TQ3a6vhuJ9qj2Hv1zQGa/ux0ditTS316P+/k00+a7w9P6O/PT2j/8DsjP4DkzN8O5Zz89Zytwby4Ps6tV6H6cptiUfH1mXYsr6mUTCt4vHE/nw7YhLI29Fvxw9Ef7dW3+0ulG2zcgy2jufN6tuXj25+rPQrkVvff/K2/XAKzxL78Gro593Z3YHc/Fipb0em7t0ue3t7iWrfDUndvV323Us2t+8vtyuz3B7x8+0CQLdH/L7Ymts377uXqe7dvG8H2hyPiOLl+i1n/7QZu5uAe98qdXl/sWqXtxer3krce+q+vye+2ZNti976VulW4+a3Sr/QuPWt0r3GvW+VfqFx61ulvnvr5+bS219o3OrJ2O/LvW+V3td48Ry7+a1St+16V/e+VbrfkHvfKo1IvHtwrf3mg3vvW6Vu22HUe98q/WJDbn2r1O39GwD7gW9UuP/A5yXc33/2t7c/L/Hlbeadb5W6yw/cq/rb4/37m8x7ve3uP3Dd9/ev+/7+dd9/4Lq/v22/1dvuu5eqbpex8gO33Lt3qm536fa3v0W5fY65G1t/u0t3r3GzS7ePtyvy/sNUNyvy9tNUd7t09yI3y/p4u8t/26j3zo/+9vyc/vb0nO2r4Le2Yf8y+Z1t+GKtEty6VL3MiP/egifGVVOsy4sinV1c/TIb5ZurpnDuxFGf747uVi6+u/TKVsQcn8N9dACWJ1frvUSvWMShi78mYdiK7s+nsu2Oi2MrHt0G5cWD+0FEXxUpFKnPj0ssB/j8IerO7JovJO7Mruml/laJu7MUtw2K1Rce/Rfj1aPCdTGvy0l/U+SyJS+LdHzConZ9WQQdoF+ItHdL+xfLnt2p7V+snYj7yscI24vLL2Jl3Ac+exFzuxTlvatcfbcl9ouMdn7erzxf8XyrwdXfHjhe0+Ba4x9GPb6ncVmy6dVFVx2zJdXrq9uBJ1r1/mp7GPdlsxL9diFb4RdO9HhRg6u2ilp5UQMVXWy3CO1Og2GR66X2s0bfjUY9os7Xye35i8J99+gj/cAt9nUR+Db6t7aExcN3W7Kpx3agHttxfefjO9uB9c4fz0/P3+ztuwfsPvCmxOPudGxEdpd99ptelkyt9o1TxDGCJH2ztmffjULdPkW2b/TcPUW+2JJ7p8hu/ObmKbLfjrunyPiBU2T72aj3TxG+nyx9PK/ufbusfsXTmH54N+DTwdXtIxDaw/yysMXnhex2+zIa39jYLN3cd+uU3t4X+637oge6k/Sor11ltOBJW8vQFzW4HaX+hMZ4UQOTQLTYi0vQF8yaeMi93KadbSovamBoTuuHZUU/fURm+4Wgy2wjuc4j+zifvm9X+br3eLuXuPVsuh2Hel/i5qd9th3RuLbUZs+/ltR3g1C3luLcboVwDV4ZstmK9n4F2w0f3axg++9PsUNca3m6L3sNDEBXteft8bjR2Ync/BCW27s9dHuJWz10X0jc6aGTtzsb5O2+hu0HDW9tw/6TiLe2YTucZwdnFVp5PsjxhQq6PMp86H+q0vsPfG26794p+BGRex+p3Uv8wCerrXGs1fTV76PfPcL1Z47w7h2p2wdntwLlj4jcPMJbiXufIf6RI9y3L0nd/lj1VuZebd9L3KrtX0jcqe27Cfk++JWV6wsO9eNFe+wWVqhWOTp3+Vj8/a0Y/DT0uIyDf96K/bL7XAPven/8DYnOqdrH9U3zX9pi91Lizcn4YztEcHMy/tgNIt2djL+V4KBavS5E9rlFynZFX8XQy4Pt6esaX4jwEx5m5em787t3pB4DwNkirRy62Z3d2yeFKo9n1Otj5VHvNqwe+IS4HmO8crbK6JjeeP301a878xNna/mJs7X+wNn61VmCBSfmWfJsSc7oRvu9p1p88WQ9P4z2/Ojs1pp6aKAPRC7TBD539+1FGs8TLbYR+YGO9lHf7kX9Yjvu9aKO+gO9qKO93Yv6RSVpvOyVdn3q/lRJxu59DdyHXFa9lHa7xN/7qOjYLeLXMRO/j+dT0Mb24cywBqjZ9SO6n+7Jxnapupv3umM7J+/Wve72ToSTPh/H/+m5sb0T4VKx4/rC5zckOPv9gf6aBN70+LDm8zck6mG8pbpOdPqGhBzoEpL62lYI+z3lMhr1HQnFFMlHx5S9JqGcl3jpSf6WxOWqovXFrWDH1uXV2Ve34lUJnODVyksn+HzSgIS+dlANQ52PrL+4FbxtsX68vSOvSbTO1+V7lxcleEE7XjqobTROI7bnzRlf5Hk+/IyXVOQ6zbyM+5sx+BmS4a/tCVZ2f+BrZ3g5eFN8vJb2AxNPajleS3sp9f/v1vx7O2KUeH9HXpS4vCh/nWn2LQl8kLoWGy9KcM6/H2/vyKsSnYuuj9euRZUHtZb+osRBifHujrwqcblduy6u8UvN2X5L6l7N2d7APjJ+WaH0en59fkFm7N4Y6gMLN/brPdevIruneq3CXuxqz7s4h4/f2K33ONeZuMsdz+dni91bEBWfTPywWEC93xrDMJ/x0VvTnzfpdm2+u48W2y9K3Xq02O7M/e2w37od5XH7yVNMpW62ZCfDdX5KO+RHtsU227JP8MEvjh9lszTFvnFvDXR8tUOXN0L1sgbsr/ndyvTLij29HK/LcHHL3sarMnfHXcZuMbafkmn8AFDbHacuv7so3Dtfvrj2sMfyqMfx9Mx9nOPbhT/ZHyX+chrvDqF+JXNzDHV+rej9Y/RQ0d+tcq/ufqHxE+Xl7kDq/PTS+xnaq9wbSP1C49ZI6lca7w6l3q5Mx7utcbzbFMdvbId78+q2DckBNrs8937+CtNOwvACb7E2XpLorD9dX9uKgYP5KMrlFYl6VC7aJe2lreCL+8X7azvimHxaenlpRwqf9R6jpq9tRVPeLPqLEnhpv8jlfvM7EoLlHIvU8vZWvCghGEB+PFnpU4ly7Nbr+4HOtviCwPl8du28lMPuS3DRIb+sfvKyhL8k4QVdqH7pi/iWhHMrLr2w35Hg0GQb+lpbxJvFqy/4Mt77qkR97aB2zJ9t/fp0+B0JLjR2vRB9S4LrnfXLGmHfkrgsezJePKj4oMcj+C9tRX10bqGb6/JS1rckuH5cvXya5LNEObYr2V16lup1WZx+fzsGux7HS0GrDZ1ktY36mgRO8QfaaxJ4c6g20RclKiXsbQl9dSsurzEcr0kY22KUt7fi80H9n49//dO//uUf//LXv//rn/7jL3//278//vK/p9g//vKn//XXP69//T//+bd/vfzf//h//y3/z//6x1/++te//N9/+bd//P1f//y///Mff55K8//9cax//A8r0v/pcd/o//Of/iiPf/e5rKdL08e/t/n/x+PxzYbOfy/xB8ejb/LxD5v/oZwKj994PDr/z/+em/z/AQ=="
584
584
  }
585
585
  ],
586
586
  "outputs": {
@@ -772,59 +772,63 @@
772
772
  }
773
773
  },
774
774
  "file_map": {
775
- "104": {
775
+ "102": {
776
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/aztec.nr",
777
+ "source": "use crate::macros::{\n calls_generation::{\n external_functions::{generate_external_function_calls, generate_external_function_self_calls_structs},\n internal_functions::generate_call_internal_struct,\n },\n dispatch::generate_public_dispatch,\n internals_functions_generation::{create_fn_abi_exports, process_functions},\n notes::NOTES,\n storage::STORAGE_LAYOUT_NAME,\n utils::{\n get_trait_impl_method, is_fn_contract_library_method, is_fn_external, is_fn_internal, is_fn_test,\n module_has_storage,\n },\n};\n\n/// Marks a contract as an Aztec contract, generating the interfaces for its functions and notes, as well as injecting\n/// the `sync_state` utility function.\n///\n/// Note: This is a module annotation, so the returned quote gets injected inside the module (contract) itself.\npub comptime fn aztec(m: Module) -> Quoted {\n // Functions that don't have #[external(...)], #[contract_library_method], or #[test] are not allowed in contracts.\n check_each_fn_macroified(m);\n\n // We generate new functions prefixed with `__aztec_nr_internals__` and we replace the original functions' bodies\n // with `static_assert(false, ...)` to prevent them from being called directly from within the contract.\n let functions = process_functions(m);\n\n // We generate structs and their implementations necessary for convenient functions calls.\n let interface = generate_contract_interface(m);\n let self_call_structs = generate_external_function_self_calls_structs(m);\n let call_internal_struct = generate_call_internal_struct(m);\n\n // We generate ABI exports for all the external functions in the contract.\n let fn_abi_exports = create_fn_abi_exports(m);\n\n // We generate `_compute_note_hash_and_nullifier`, `sync_state` and `process_message` functions only if they are\n // not already implemented. If they are implemented we just insert empty quotes.\n let contract_library_method_compute_note_hash_and_nullifier = if !m.functions().any(|f| {\n f.name() == quote { _compute_note_hash_and_nullifier }\n }) {\n generate_contract_library_method_compute_note_hash_and_nullifier()\n } else {\n quote {}\n };\n let sync_state_fn_and_abi_export = if !m.functions().any(|f| f.name() == quote { sync_state }) {\n generate_sync_state()\n } else {\n quote {}\n };\n\n let process_message_fn_and_abi_export = if !m.functions().any(|f| f.name() == quote { process_message }) {\n generate_process_message()\n } else {\n quote {}\n };\n let public_dispatch = generate_public_dispatch(m);\n\n quote {\n $interface\n $self_call_structs\n $call_internal_struct\n $functions\n $fn_abi_exports\n $contract_library_method_compute_note_hash_and_nullifier\n $public_dispatch\n $sync_state_fn_and_abi_export\n $process_message_fn_and_abi_export\n }\n}\n\ncomptime fn generate_contract_interface(m: Module) -> Quoted {\n let calls = generate_external_function_calls(m);\n\n let module_name = m.name();\n\n let has_storage_layout = module_has_storage(m) & STORAGE_LAYOUT_NAME.get(m).is_some();\n let storage_layout_getter = if has_storage_layout {\n let storage_layout_name = STORAGE_LAYOUT_NAME.get(m).unwrap();\n quote {\n pub fn storage_layout() -> StorageLayoutFields {\n $storage_layout_name.fields\n }\n }\n } else {\n quote {}\n };\n\n let library_storage_layout_getter = if has_storage_layout {\n quote {\n #[contract_library_method]\n $storage_layout_getter\n }\n } else {\n quote {}\n };\n\n quote {\n pub struct $module_name {\n pub target_contract: aztec::protocol::address::AztecAddress\n }\n\n impl $module_name {\n $calls\n\n pub fn at(\n addr: aztec::protocol::address::AztecAddress\n ) -> Self {\n Self { target_contract: addr }\n }\n\n pub fn interface() -> Self {\n Self { target_contract: aztec::protocol::address::AztecAddress::zero() }\n }\n\n $storage_layout_getter\n }\n\n #[contract_library_method]\n pub fn at(\n addr: aztec::protocol::address::AztecAddress\n ) -> $module_name {\n $module_name { target_contract: addr }\n }\n\n #[contract_library_method]\n pub fn interface() -> $module_name {\n $module_name { target_contract: aztec::protocol::address::AztecAddress::zero() }\n }\n\n $library_storage_layout_getter\n\n }\n}\n\n/// Generates a contract library method called `_compute_note_hash_and_nullifier` which is used for note discovery (to\n/// create the `aztec::messages::discovery::ComputeNoteHashAndNullifier` function) and to implement the\n/// `compute_note_hash_and_nullifier` unconstrained contract function.\ncomptime fn generate_contract_library_method_compute_note_hash_and_nullifier() -> Quoted {\n if NOTES.len() > 0 {\n // Contracts that do define notes produce an if-else chain where `note_type_id` is matched against the\n // `get_note_type_id()` function of each note type that we know of, in order to identify the note type. Once we\n // know it we call we correct `unpack` method from the `Packable` trait to obtain the underlying note type, and\n // compute the note hash (non-siloed) and inner nullifier (also non-siloed).\n\n let mut if_note_type_id_match_statements_list = @[];\n for i in 0..NOTES.len() {\n let typ = NOTES.get(i);\n\n let get_note_type_id = get_trait_impl_method(\n typ,\n quote { crate::note::note_interface::NoteType },\n quote { get_id },\n );\n let unpack = get_trait_impl_method(\n typ,\n quote { crate::protocol::traits::Packable },\n quote { unpack },\n );\n\n let compute_note_hash = get_trait_impl_method(\n typ,\n quote { crate::note::note_interface::NoteHash },\n quote { compute_note_hash },\n );\n\n let compute_nullifier_unconstrained = get_trait_impl_method(\n typ,\n quote { crate::note::note_interface::NoteHash },\n quote { compute_nullifier_unconstrained },\n );\n\n let if_or_else_if = if i == 0 {\n quote { if }\n } else {\n quote { else if }\n };\n\n if_note_type_id_match_statements_list = if_note_type_id_match_statements_list.push_back(\n quote {\n $if_or_else_if note_type_id == $get_note_type_id() {\n // As an extra safety check we make sure that the packed_note BoundedVec has the expected\n // length, since we're about to interpret its raw storage as a fixed-size array by calling the\n // unpack function on it.\n let expected_len = <$typ as $crate::protocol::traits::Packable>::N;\n let actual_len = packed_note.len();\n assert(\n actual_len == expected_len,\n f\"Expected packed note of length {expected_len} but got {actual_len} for note type id {note_type_id}\"\n );\n\n let note = $unpack(aztec::utils::array::subarray(packed_note.storage(), 0));\n\n let note_hash = $compute_note_hash(note, owner, storage_slot, randomness);\n \n // The message discovery process finds settled notes, that is, notes that were created in prior transactions and are therefore already part of the note hash tree. We therefore compute the nullification note hash by treating the note as a settled note with the provided note nonce.\n let note_hash_for_nullification = aztec::note::utils::compute_note_hash_for_nullification(\n aztec::note::HintedNote{\n note,\n contract_address,\n owner,\n randomness,\n storage_slot,\n metadata: aztec::note::note_metadata::SettledNoteMetadata::new(note_nonce).into()\n }\n );\n\n let inner_nullifier = $compute_nullifier_unconstrained(note, owner, note_hash_for_nullification);\n\n Option::some(\n aztec::messages::discovery::NoteHashAndNullifier {\n note_hash, inner_nullifier\n }\n )\n }\n },\n );\n }\n\n let if_note_type_id_match_statements = if_note_type_id_match_statements_list.join(quote {});\n\n quote {\n /// Unpacks an array into a note corresponding to `note_type_id` and then computes its note hash (non-siloed) and inner nullifier (non-siloed) assuming the note has been inserted into the note hash tree with `note_nonce`.\n ///\n /// The signature of this function notably matches the `aztec::messages::discovery::ComputeNoteHashAndNullifier` type, and so it can be used to call functions from that module such as `do_sync_state` and `attempt_note_discovery`.\n ///\n /// This function is automatically injected by the `#[aztec]` macro.\n #[contract_library_method]\n unconstrained fn _compute_note_hash_and_nullifier(\n packed_note: BoundedVec<Field, aztec::messages::logs::note::MAX_NOTE_PACKED_LEN>,\n owner: aztec::protocol::address::AztecAddress,\n storage_slot: Field,\n note_type_id: Field,\n contract_address: aztec::protocol::address::AztecAddress,\n randomness: Field,\n note_nonce: Field,\n ) -> Option<aztec::messages::discovery::NoteHashAndNullifier> {\n $if_note_type_id_match_statements\n else {\n Option::none()\n }\n }\n }\n } else {\n // Contracts with no notes still implement this function to avoid having special-casing, the implementation\n // simply throws immediately.\n quote {\n /// This contract does not use private notes, so this function should never be called as it will unconditionally fail.\n ///\n /// This function is automatically injected by the `#[aztec]` macro.\n #[contract_library_method]\n unconstrained fn _compute_note_hash_and_nullifier(\n _packed_note: BoundedVec<Field, aztec::messages::logs::note::MAX_NOTE_PACKED_LEN>,\n _owner: aztec::protocol::address::AztecAddress,\n _storage_slot: Field,\n _note_type_id: Field,\n _contract_address: aztec::protocol::address::AztecAddress,\n _randomness: Field,\n _nonce: Field,\n ) -> Option<aztec::messages::discovery::NoteHashAndNullifier> {\n panic(f\"This contract does not use private notes\")\n }\n }\n }\n}\n\ncomptime fn generate_sync_state() -> Quoted {\n quote {\n pub struct sync_state_parameters {}\n\n #[abi(functions)]\n pub struct sync_state_abi {\n parameters: sync_state_parameters,\n }\n\n #[aztec::macros::internals_functions_generation::abi_attributes::abi_utility]\n unconstrained fn sync_state() {\n let address = aztec::context::UtilityContext::new().this_address();\n \n aztec::messages::discovery::do_sync_state(address, _compute_note_hash_and_nullifier);\n }\n }\n}\n\ncomptime fn generate_process_message() -> Quoted {\n quote {\n pub struct process_message_parameters {\n pub message_ciphertext: BoundedVec<Field, aztec::messages::encoding::MESSAGE_CIPHERTEXT_LEN>,\n pub message_context: aztec::messages::processing::MessageContext,\n }\n\n #[abi(functions)]\n pub struct process_message_abi {\n parameters: process_message_parameters,\n }\n\n #[aztec::macros::internals_functions_generation::abi_attributes::abi_utility]\n unconstrained fn process_message(\n message_ciphertext: BoundedVec<Field, aztec::messages::encoding::MESSAGE_CIPHERTEXT_LEN>,\n message_context: aztec::messages::processing::MessageContext,\n ) {\n let address = aztec::context::UtilityContext::new().this_address();\n\n aztec::messages::discovery::process_message::process_message_ciphertext(\n address,\n _compute_note_hash_and_nullifier,\n message_ciphertext,\n message_context,\n );\n\n // At this point, the note is pending validation and storage in the database. We must call\n // validate_and_store_enqueued_notes_and_events to complete that process.\n aztec::messages::processing::validate_and_store_enqueued_notes_and_events(address);\n }\n }\n}\n\n/// Checks that all functions in the module have a context macro applied.\n///\n/// Non-macroified functions are not allowed in contracts. They must all be one of\n/// [`external`](crate::macros::functions::external), [`internal`](crate::macros::functions::internal) or `test`.\ncomptime fn check_each_fn_macroified(m: Module) {\n for f in m.functions() {\n let name = f.name();\n if !is_fn_external(f) & !is_fn_contract_library_method(f) & !is_fn_internal(f) & !is_fn_test(f) {\n // We don't suggest that #[contract_library_method] is allowed because we don't want to introduce another\n // concept\n panic(\n f\"Function {name} must be marked as either #[external(...)], #[internal(...)], or #[test]\",\n );\n }\n }\n}\n"
778
+ },
779
+ "107": {
776
780
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/dispatch.nr",
777
781
  "source": "use crate::macros::internals_functions_generation::external_functions_registry::get_public_functions;\nuse crate::protocol::meta::utils::get_params_len_quote;\nuse crate::utils::cmap::CHashMap;\nuse super::utils::compute_fn_selector;\nuse std::panic;\n\n/// Returns an `fn public_dispatch(...)` function for the given module that's assumed to be an Aztec contract.\npub comptime fn generate_public_dispatch(m: Module) -> Quoted {\n let functions = get_public_functions(m);\n\n let unit = get_type::<()>();\n\n let seen_selectors = &mut CHashMap::<Field, Quoted>::new();\n\n let ifs = functions.map(|function: FunctionDefinition| {\n let parameters = function.parameters();\n let return_type = function.return_type();\n\n let selector: Field = compute_fn_selector(function);\n let fn_name = function.name();\n\n // Since function selectors are computed as the first 4 bytes of the hash of the function signature, it's\n // possible to have collisions. With the following check, we ensure it doesn't happen within the same contract.\n let existing_fn = seen_selectors.get(selector);\n if existing_fn.is_some() {\n let existing_fn = existing_fn.unwrap();\n panic(\n f\"Public function selector collision detected between functions '{fn_name}' and '{existing_fn}'\",\n );\n }\n seen_selectors.insert(selector, fn_name);\n\n let params_len_quote = get_params_len_quote(parameters);\n\n let initial_read = if parameters.len() == 0 {\n quote {}\n } else {\n // The initial calldata_copy offset is 1 to skip the Field selector The expected calldata is the\n // serialization of\n // - FunctionSelector: the selector of the function intended to dispatch\n // - Parameters: the parameters of the function intended to dispatch That is, exactly what is expected for\n // a call to the target function, but with a selector added at the beginning.\n quote {\n let input_calldata: [Field; $params_len_quote] = aztec::oracle::avm::calldata_copy(1, $params_len_quote);\n let mut reader = aztec::protocol::utils::reader::Reader::new(input_calldata);\n }\n };\n\n let parameter_index: &mut u32 = &mut 0;\n let reads = parameters.map(|param: (Quoted, Type)| {\n let parameter_index_value = *parameter_index;\n let param_name = f\"arg{parameter_index_value}\".quoted_contents();\n let param_type = param.1;\n let read = quote {\n let $param_name: $param_type = aztec::protocol::traits::Deserialize::stream_deserialize(&mut reader);\n };\n *parameter_index += 1;\n quote { $read }\n });\n let read = reads.join(quote { });\n\n let mut args = @[];\n for parameter_index in 0..parameters.len() {\n let param_name = f\"arg{parameter_index}\".quoted_contents();\n args = args.push_back(quote { $param_name });\n }\n\n // We call a function whose name is prefixed with `__aztec_nr_internals__`. This is necessary because the\n // original function is intentionally made uncallable, preventing direct invocation within the contract.\n // Instead, a new function with the same name, but prefixed by `__aztec_nr_internals__`, has been generated to\n // be called here. For more details see the `process_functions` function.\n let name = f\"__aztec_nr_internals__{fn_name}\".quoted_contents();\n let args = args.join(quote { , });\n let call = quote { $name($args) };\n\n let return_code = if return_type == unit {\n quote {\n $call;\n // Force early return.\n aztec::oracle::avm::avm_return([]);\n }\n } else {\n quote {\n let return_value = aztec::protocol::traits::Serialize::serialize($call);\n aztec::oracle::avm::avm_return(return_value.as_vector());\n }\n };\n\n let if_ = quote {\n if selector == $selector {\n $initial_read\n $read\n $return_code\n }\n };\n if_\n });\n\n if ifs.len() == 0 {\n // No dispatch function if there are no public functions\n quote {}\n } else {\n let ifs = ifs.push_back(quote { panic(f\"Unknown selector {selector}\") });\n let dispatch = ifs.join(quote { });\n\n let body = quote {\n // We mark this as public because our whole system depends on public functions having this attribute.\n #[aztec::macros::internals_functions_generation::abi_attributes::abi_public]\n pub unconstrained fn public_dispatch(selector: Field) {\n $dispatch\n }\n };\n\n body\n }\n}\n\ncomptime fn get_type<T>() -> Type {\n let t: T = std::mem::zeroed();\n std::meta::type_of(t)\n}\n"
778
782
  },
779
- "114": {
783
+ "117": {
780
784
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/internals_functions_generation/external/public.nr",
781
- "source": "use crate::macros::{\n internals_functions_generation::external::helpers::{create_authorize_once_check, get_abi_relevant_attributes},\n utils::{\n fn_has_authorize_once, fn_has_noinitcheck, is_fn_initializer, is_fn_only_self, is_fn_view,\n module_has_initializer, module_has_storage,\n },\n};\n\npub(crate) comptime fn generate_public_external(f: FunctionDefinition) -> Quoted {\n let module_has_initializer = module_has_initializer(f.module());\n let module_has_storage = module_has_storage(f.module());\n\n // Public functions undergo a lot of transformations from their Aztec.nr form.\n let original_params = f.parameters();\n\n let args_len_quote = if original_params.len() == 0 {\n // If the function has no parameters, we set the args_len to 0.\n quote { 0 }\n } else {\n // The following will give us <type_of_struct_member_1 as Serialize>::N + <type_of_struct_member_2 as\n // Serialize>::N + ...\n original_params\n .map(|(_, param_type): (Quoted, Type)| {\n quote {\n <$param_type as $crate::protocol::traits::Serialize>::N\n }\n })\n .join(quote {+})\n };\n\n let storage_init = if module_has_storage {\n quote {\n let storage = Storage::init(context);\n }\n } else {\n // Contract does not have Storage defined, so we set storage to the unit type `()`. ContractSelf requires a\n // storage struct in its constructor. Using an Option type would lead to worse developer experience and higher\n // constraint counts so we use the unit type `()` instead.\n quote {\n let storage = ();\n }\n };\n\n // Unlike in the private case, in public the `context` does not need to receive the hash of the original params.\n let contract_self_creation = quote {\n #[allow(unused_variables)]\n let mut self = {\n let context = aztec::context::PublicContext::new(|| {\n // We start from 1 because we skip the selector for the dispatch function.\n let serialized_args : [Field; $args_len_quote] = aztec::oracle::avm::calldata_copy(1, $args_len_quote);\n aztec::hash::hash_args(serialized_args)\n });\n $storage_init\n let self_address = context.this_address();\n let call_self: CallSelf<aztec::context::PublicContext> = CallSelf { address: self_address, context };\n let call_self_static: CallSelfStatic<aztec::context::PublicContext> = CallSelfStatic { address: self_address, context };\n let internal: CallInternal<aztec::context::PublicContext> = CallInternal { context };\n aztec::ContractSelf::new_public(context, storage, call_self, call_self_static, internal)\n };\n };\n\n let original_function_name = f.name();\n\n // Modifications introduced by the different marker attributes.\n let internal_check = if is_fn_only_self(f) {\n let assertion_message = 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.is_static_call(), $assertion_message); }\n } else {\n quote {}\n };\n\n let (assert_initializer, mark_as_initialized) = if is_fn_initializer(f) {\n (\n quote { aztec::macros::functions::initialization_utils::assert_initialization_matches_address_preimage_public(self.context); },\n quote { aztec::macros::functions::initialization_utils::mark_as_initialized_public(self.context); },\n )\n } else {\n (quote {}, quote {})\n };\n\n // Initialization checks are not included in contracts that don't have initializers.\n let init_check = if module_has_initializer & !fn_has_noinitcheck(f) & !is_fn_initializer(f) {\n quote { aztec::macros::functions::initialization_utils::assert_is_initialized_public(self.context); }\n } else {\n quote {}\n };\n\n // Inject the authwit check if the function is marked with #[authorize_once].\n let authorize_once_check = if fn_has_authorize_once(f) {\n create_authorize_once_check(f, false)\n } else {\n quote {}\n };\n\n let to_prepend = quote {\n $contract_self_creation\n $assert_initializer\n $init_check\n $internal_check\n $view_check\n $authorize_once_check\n };\n\n let to_append = quote {\n $mark_as_initialized\n };\n\n let fn_name = f\"__aztec_nr_internals__{original_function_name}\".quoted_contents();\n let body = f.body();\n let return_type = f.return_type();\n\n // New function parameters are the same as the original function's ones.\n let params = original_params.map(|(param_name, param_type)| quote { $param_name: $param_type }).join(quote {, });\n\n // Preserve all attributes that are relevant to the function's ABI.\n let abi_relevant_attributes = get_abi_relevant_attributes(f);\n\n // All public functions are automatically made unconstrained, even if they were not marked as such. This is because\n // instead of compiling into a circuit, they will compile to bytecode that will be later transpiled into AVM\n // bytecode.\n quote {\n #[aztec::macros::internals_functions_generation::abi_attributes::abi_public]\n $abi_relevant_attributes\n unconstrained fn $fn_name($params) -> pub $return_type {\n $to_prepend\n $body\n $to_append\n }\n }\n}\n"
785
+ "source": "use crate::macros::{\n internals_functions_generation::external::helpers::{create_authorize_once_check, get_abi_relevant_attributes},\n utils::{\n fn_has_authorize_once, fn_has_noinitcheck, is_fn_initializer, is_fn_only_self, is_fn_view,\n module_has_initializer, module_has_storage,\n },\n};\n\npub(crate) comptime fn generate_public_external(f: FunctionDefinition) -> Quoted {\n let module_has_initializer = module_has_initializer(f.module());\n let module_has_storage = module_has_storage(f.module());\n\n // Public functions undergo a lot of transformations from their Aztec.nr form.\n let original_params = f.parameters();\n\n let args_len_quote = if original_params.len() == 0 {\n // If the function has no parameters, we set the args_len to 0.\n quote { 0 }\n } else {\n // The following will give us <type_of_struct_member_1 as Serialize>::N + <type_of_struct_member_2 as\n // Serialize>::N + ...\n original_params\n .map(|(_, param_type): (Quoted, Type)| {\n quote {\n <$param_type as $crate::protocol::traits::Serialize>::N\n }\n })\n .join(quote {+})\n };\n\n let storage_init = if module_has_storage {\n quote {\n let storage = Storage::init(context);\n }\n } else {\n // Contract does not have Storage defined, so we set storage to the unit type `()`. ContractSelfPublic requires\n // a storage struct in its constructor. Using an Option type would lead to worse developer experience and\n // higher constraint counts so we use the unit type `()` instead.\n quote {\n let storage = ();\n }\n };\n\n // Unlike in the private case, in public the `context` does not need to receive the hash of the original params.\n let contract_self_creation = quote {\n #[allow(unused_variables)]\n let mut self = {\n let context = aztec::context::PublicContext::new(|| {\n // We start from 1 because we skip the selector for the dispatch function.\n let serialized_args : [Field; $args_len_quote] = aztec::oracle::avm::calldata_copy(1, $args_len_quote);\n aztec::hash::hash_args(serialized_args)\n });\n $storage_init\n let self_address = context.this_address();\n let call_self: CallSelf<aztec::context::PublicContext> = CallSelf { address: self_address, context };\n let call_self_static: CallSelfStatic<aztec::context::PublicContext> = CallSelfStatic { address: self_address, context };\n let internal: CallInternal<aztec::context::PublicContext> = CallInternal { context };\n aztec::contract_self::ContractSelfPublic::new(context, storage, call_self, call_self_static, internal)\n };\n };\n\n let original_function_name = f.name();\n\n // Modifications introduced by the different marker attributes.\n let internal_check = if is_fn_only_self(f) {\n let assertion_message = 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.is_static_call(), $assertion_message); }\n } else {\n quote {}\n };\n\n let (assert_initializer, mark_as_initialized) = if is_fn_initializer(f) {\n (\n quote { aztec::macros::functions::initialization_utils::assert_initialization_matches_address_preimage_public(self.context); },\n quote { aztec::macros::functions::initialization_utils::mark_as_initialized_public(self.context); },\n )\n } else {\n (quote {}, quote {})\n };\n\n // Initialization checks are not included in contracts that don't have initializers.\n let init_check = if module_has_initializer & !fn_has_noinitcheck(f) & !is_fn_initializer(f) {\n quote { aztec::macros::functions::initialization_utils::assert_is_initialized_public(self.context); }\n } else {\n quote {}\n };\n\n // Inject the authwit check if the function is marked with #[authorize_once].\n let authorize_once_check = if fn_has_authorize_once(f) {\n create_authorize_once_check(f, false)\n } else {\n quote {}\n };\n\n let to_prepend = quote {\n $contract_self_creation\n $assert_initializer\n $init_check\n $internal_check\n $view_check\n $authorize_once_check\n };\n\n let to_append = quote {\n $mark_as_initialized\n };\n\n let fn_name = f\"__aztec_nr_internals__{original_function_name}\".quoted_contents();\n let body = f.body();\n let return_type = f.return_type();\n\n // New function parameters are the same as the original function's ones.\n let params = original_params.map(|(param_name, param_type)| quote { $param_name: $param_type }).join(quote {, });\n\n // Preserve all attributes that are relevant to the function's ABI.\n let abi_relevant_attributes = get_abi_relevant_attributes(f);\n\n // All public functions are automatically made unconstrained, even if they were not marked as such. This is because\n // instead of compiling into a circuit, they will compile to bytecode that will be later transpiled into AVM\n // bytecode.\n quote {\n #[aztec::macros::internals_functions_generation::abi_attributes::abi_public]\n $abi_relevant_attributes\n unconstrained fn $fn_name($params) -> pub $return_type {\n $to_prepend\n $body\n $to_append\n }\n }\n}\n"
782
786
  },
783
- "124": {
787
+ "127": {
784
788
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/mod.nr",
785
789
  "source": "use crate::protocol::{address::AztecAddress, logging::{debug_log, debug_log_format}};\n\npub mod nonce_discovery;\npub mod partial_notes;\npub mod private_events;\npub mod private_notes;\npub mod process_message;\n\nuse crate::{\n messages::{\n discovery::process_message::process_message_ciphertext,\n logs::note::MAX_NOTE_PACKED_LEN,\n processing::{\n get_private_logs, pending_tagged_log::PendingTaggedLog, validate_and_store_enqueued_notes_and_events,\n },\n },\n utils::array,\n};\n\npub struct NoteHashAndNullifier {\n /// The result of NoteHash::compute_note_hash\n pub note_hash: Field,\n /// The result of NoteHash::compute_nullifier_unconstrained (since all of message discovery is unconstrained).\n /// This is `None` if the nullifier cannot be computed (e.g., because the nullifier hiding key is not available).\n pub inner_nullifier: Option<Field>,\n}\n\n/// A function which takes a note's packed content, address of the emitting contract, note nonce, storage slot and note\n/// type ID and attempts to compute its note hash (not hashed by note nonce nor siloed by address) and inner nullifier\n/// (not siloed by address).\n///\n/// This function must be user-provided as its implementation requires knowledge of how note type IDs are allocated in\n/// a contract. The `#[aztec]` macro automatically creates such a contract library method called\n/// `_compute_note_hash_and_nullifier`, which looks something like this:\n///\n/// ```\n/// |packed_note, owner, storage_slot, note_type_id, contract_address, randomness, note_nonce| {\n/// if note_type_id == MyNoteType::get_id() {\n/// assert(packed_note.len() == MY_NOTE_TYPE_SERIALIZATION_LENGTH);\n///\n/// let note = MyNoteType::unpack(aztec::utils::array::subarray(packed_note.storage(), 0));\n///\n/// let note_hash = note.compute_note_hash(owner, storage_slot, randomness);\n/// let note_hash_for_nullification = aztec::note::utils::compute_note_hash_for_nullification(\n/// HintedNote{ note, contract_address, metadata: SettledNoteMetadata::new(note_nonce).into() },\n/// storage_slot\n/// );\n///\n/// let inner_nullifier = note.compute_nullifier_unconstrained(owner, note_hash_for_nullification);\n///\n/// Option::some(\n/// aztec::messages::discovery::NoteHashAndNullifier {\n/// note_hash, inner_nullifier\n/// }\n/// )\n/// } else if note_type_id == MyOtherNoteType::get_id() {\n/// ... // Similar to above but calling MyOtherNoteType::unpack_content\n/// } else {\n/// Option::none() // Unknown note type ID\n/// };\n/// }\n/// ```\npub type ComputeNoteHashAndNullifier<Env> = unconstrained fn[Env](/* packed_note */BoundedVec<Field, MAX_NOTE_PACKED_LEN>, /*\n owner */ AztecAddress, /* storage_slot */ Field, /* note_type_id */ Field, /* contract_address */ AztecAddress, /*\nrandomness */ Field, /* note nonce */ Field) -> Option<NoteHashAndNullifier>;\n\n/// Performs the state synchronization process, in which private logs are downloaded and inspected to find new private\n/// notes, partial notes and events, etc., and pending partial notes are processed to search for their completion logs.\n/// This is the mechanism via which a contract updates its knowledge of its private state.\n///\n/// Note that the state is synchronized up to the latest block synchronized by PXE (referred to as \"anchor block\").\n/// That should be close to the chain tip as block synchronization is performed before contract function simulation is\n/// done.\n///\n/// Receives the address of the contract on which discovery is performed along with its\n/// `compute_note_hash_and_nullifier` function.\npub unconstrained fn do_sync_state<Env>(\n contract_address: AztecAddress,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n) {\n debug_log(\"Performing state synchronization\");\n\n // First we process all private logs, which can contain different kinds of messages e.g. private notes, partial\n // notes, private events, etc.\n let mut logs = get_private_logs(contract_address);\n logs.for_each(|i, pending_tagged_log: PendingTaggedLog| {\n debug_log_format(\n \"Processing log with tag {0}\",\n [pending_tagged_log.log.get(0)],\n );\n\n // We remove the tag from the pending tagged log and process the message ciphertext contained in it.\n let message_ciphertext = array::subbvec(pending_tagged_log.log, 1);\n\n process_message_ciphertext(\n contract_address,\n compute_note_hash_and_nullifier,\n message_ciphertext,\n pending_tagged_log.context,\n );\n logs.remove(i);\n });\n\n // Then we process all pending partial notes, regardless of whether they were found in the current or previous\n // executions.\n partial_notes::fetch_and_process_partial_note_completion_logs(contract_address, compute_note_hash_and_nullifier);\n\n // Finally we validate all notes and events that were found as part of the previous processes, resulting in them\n // being added to PXE's database and retrievable via oracles (get_notes) and our TS API (PXE::getPrivateEvents).\n validate_and_store_enqueued_notes_and_events(contract_address);\n}\n"
786
790
  },
787
- "125": {
791
+ "128": {
788
792
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/nonce_discovery.nr",
789
793
  "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"
790
794
  },
791
- "126": {
795
+ "129": {
792
796
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/partial_notes.nr",
793
797
  "source": "use crate::{\n capsules::CapsuleArray,\n messages::{\n discovery::{ComputeNoteHashAndNullifier, nonce_discovery::attempt_note_nonce_discovery},\n encoding::MAX_MESSAGE_CONTENT_LEN,\n logs::partial_note::{decode_partial_note_private_message, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN},\n processing::{\n enqueue_note_for_validation, get_pending_partial_notes_completion_logs,\n log_retrieval_response::LogRetrievalResponse,\n },\n },\n utils::array,\n};\n\nuse crate::protocol::{\n address::AztecAddress,\n hash::sha256_to_field,\n logging::debug_log_format,\n traits::{Deserialize, Serialize},\n};\n\n/// The slot in the PXE capsules where we store a `CapsuleArray` of `DeliveredPendingPartialNote`.\npub global DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT: Field = sha256_to_field(\n \"AZTEC_NR::DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT\".as_bytes(),\n);\n\n/// A partial note that was delivered but is still pending completion. Contains the information necessary to find the\n/// log that will complete it and lead to a note being discovered and delivered.\n#[derive(Serialize, Deserialize)]\npub(crate) struct DeliveredPendingPartialNote {\n pub(crate) owner: AztecAddress,\n pub(crate) storage_slot: Field,\n pub(crate) randomness: Field,\n pub(crate) note_completion_log_tag: Field,\n pub(crate) note_type_id: Field,\n pub(crate) packed_private_note_content: BoundedVec<Field, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN>,\n pub(crate) recipient: AztecAddress,\n}\n\npub unconstrained fn process_partial_note_private_msg(\n contract_address: AztecAddress,\n recipient: AztecAddress,\n msg_metadata: u64,\n msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n) {\n // We store the information of the partial note we found in a persistent capsule in PXE, so that we can later\n // search for the public log that will complete it.\n let (owner, storage_slot, randomness, note_completion_log_tag, note_type_id, packed_private_note_content) =\n decode_partial_note_private_message(msg_metadata, msg_content);\n\n let pending = DeliveredPendingPartialNote {\n owner,\n storage_slot,\n randomness,\n note_completion_log_tag,\n note_type_id,\n packed_private_note_content,\n recipient,\n };\n\n CapsuleArray::at(\n contract_address,\n DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT,\n )\n .push(pending);\n}\n\n/// Searches for logs that would result in the completion of pending partial notes, ultimately resulting in the notes\n/// being delivered to PXE if completed.\npub unconstrained fn fetch_and_process_partial_note_completion_logs<Env>(\n contract_address: AztecAddress,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n) {\n let pending_partial_notes = CapsuleArray::at(\n contract_address,\n DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT,\n );\n\n debug_log_format(\n \"{} pending partial notes\",\n [pending_partial_notes.len() as Field],\n );\n\n // Each of the pending partial notes might get completed by a log containing its public values. For performance\n // reasons, we fetch all of these logs concurrently and then process them one by one, minimizing the amount of time\n // waiting for the node roundtrip.\n let maybe_completion_logs = get_pending_partial_notes_completion_logs(contract_address, pending_partial_notes);\n\n // Each entry in the maybe completion logs array corresponds to the entry in the pending partial notes array at the\n // same index. This means we can use the same index as we iterate through the responses to get both the partial\n // note and the log that might complete it.\n assert_eq(maybe_completion_logs.len(), pending_partial_notes.len());\n\n maybe_completion_logs.for_each(|i, maybe_log: Option<LogRetrievalResponse>| {\n // We clear the completion logs as we read them so that the array is empty by the time we next query it.\n // TODO(#14943): use volatile arrays to avoid having to manually clear this.\n maybe_completion_logs.remove(i);\n\n let pending_partial_note = pending_partial_notes.get(i);\n\n if maybe_log.is_none() {\n debug_log_format(\n \"Found no completion logs for partial note with tag {}\",\n [pending_partial_note.note_completion_log_tag],\n );\n\n // Note that we're not removing the pending partial note from the capsule array, so we will continue\n // searching for this tagged log when performing message discovery in the future until we either find it or\n // the entry is somehow removed from the array.\n } else {\n debug_log_format(\n \"Completion log found for partial note with tag {}\",\n [pending_partial_note.note_completion_log_tag],\n );\n let log = maybe_log.unwrap();\n\n // Public fields are assumed to all be placed at the end of the packed representation, so we combine the\n // private and public packed fields (i.e. the contents of the private message and public log plaintext to\n // get the complete packed content.\n let complete_packed_note = array::append(\n pending_partial_note.packed_private_note_content,\n log.log_payload,\n );\n\n let discovered_notes = attempt_note_nonce_discovery(\n log.unique_note_hashes_in_tx,\n log.first_nullifier_in_tx,\n compute_note_hash_and_nullifier,\n contract_address,\n pending_partial_note.owner,\n pending_partial_note.storage_slot,\n pending_partial_note.randomness,\n pending_partial_note.note_type_id,\n complete_packed_note,\n );\n\n // TODO(#11627): is there anything reasonable we can do if we get a log but it doesn't result in a note\n // being found?\n if discovered_notes.len() == 0 {\n panic(\n f\"A partial note's completion log did not result in any notes being found - this should never happen\",\n );\n }\n\n debug_log_format(\n \"Discovered {0} notes for partial note with tag {1}\",\n [discovered_notes.len() as Field, pending_partial_note.note_completion_log_tag],\n );\n\n discovered_notes.for_each(|discovered_note| {\n enqueue_note_for_validation(\n contract_address,\n pending_partial_note.owner,\n pending_partial_note.storage_slot,\n pending_partial_note.randomness,\n discovered_note.note_nonce,\n complete_packed_note,\n discovered_note.note_hash,\n discovered_note.inner_nullifier,\n log.tx_hash,\n pending_partial_note.recipient,\n );\n });\n\n // Because there is only a single log for a given tag, once we've processed the tagged log then we simply\n // delete the pending work entry, regardless of whether it was actually completed or not.\n pending_partial_notes.remove(i);\n }\n });\n}\n"
794
798
  },
795
- "127": {
799
+ "130": {
796
800
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/private_events.nr",
797
801
  "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"
798
802
  },
799
- "128": {
803
+ "131": {
800
804
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/private_notes.nr",
801
805
  "source": "use crate::messages::{\n discovery::{ComputeNoteHashAndNullifier, nonce_discovery::attempt_note_nonce_discovery},\n encoding::MAX_MESSAGE_CONTENT_LEN,\n logs::note::{decode_private_note_message, MAX_NOTE_PACKED_LEN},\n processing::enqueue_note_for_validation,\n};\nuse crate::protocol::{address::AztecAddress, constants::MAX_NOTE_HASHES_PER_TX, logging::debug_log_format};\n\npub unconstrained fn process_private_note_msg<Env>(\n contract_address: AztecAddress,\n tx_hash: Field,\n unique_note_hashes_in_tx: BoundedVec<Field, MAX_NOTE_HASHES_PER_TX>,\n first_nullifier_in_tx: Field,\n recipient: AztecAddress,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n msg_metadata: u64,\n msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n) {\n let (note_type_id, owner, storage_slot, randomness, packed_note) =\n decode_private_note_message(msg_metadata, msg_content);\n\n attempt_note_discovery(\n contract_address,\n tx_hash,\n unique_note_hashes_in_tx,\n first_nullifier_in_tx,\n recipient,\n compute_note_hash_and_nullifier,\n owner,\n storage_slot,\n randomness,\n note_type_id,\n packed_note,\n );\n}\n\n/// Attempts discovery of a note given information about its contents and the transaction in which it is suspected the\n/// note was created.\npub unconstrained fn attempt_note_discovery<Env>(\n contract_address: AztecAddress,\n tx_hash: Field,\n unique_note_hashes_in_tx: BoundedVec<Field, MAX_NOTE_HASHES_PER_TX>,\n first_nullifier_in_tx: Field,\n recipient: AztecAddress,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n owner: AztecAddress,\n storage_slot: Field,\n randomness: Field,\n note_type_id: Field,\n packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n) {\n let discovered_notes = attempt_note_nonce_discovery(\n unique_note_hashes_in_tx,\n first_nullifier_in_tx,\n compute_note_hash_and_nullifier,\n contract_address,\n owner,\n storage_slot,\n randomness,\n note_type_id,\n packed_note,\n );\n\n debug_log_format(\n \"Discovered {0} notes from a private message\",\n [discovered_notes.len() as Field],\n );\n\n discovered_notes.for_each(|discovered_note| {\n enqueue_note_for_validation(\n contract_address,\n owner,\n storage_slot,\n randomness,\n discovered_note.note_nonce,\n packed_note,\n discovered_note.note_hash,\n discovered_note.inner_nullifier,\n tx_hash,\n recipient,\n );\n });\n}\n"
802
806
  },
803
- "129": {
807
+ "132": {
804
808
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/process_message.nr",
805
809
  "source": "use crate::messages::{\n discovery::{\n ComputeNoteHashAndNullifier, partial_notes::process_partial_note_private_msg,\n private_events::process_private_event_msg, private_notes::process_private_note_msg,\n },\n encoding::{decode_message, MESSAGE_CIPHERTEXT_LEN, MESSAGE_PLAINTEXT_LEN},\n encryption::{aes128::AES128, message_encryption::MessageEncryption},\n msg_type::{PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID, PRIVATE_EVENT_MSG_TYPE_ID, PRIVATE_NOTE_MSG_TYPE_ID},\n processing::MessageContext,\n};\n\nuse crate::protocol::{address::AztecAddress, logging::{debug_log, debug_log_format}};\n\n/// Processes a message that can contain notes, partial notes, or events.\n///\n/// Notes result in nonce discovery being performed prior to delivery, which requires knowledge of the transaction hash\n/// in which the notes would've been created (typically the same transaction in which the log was emitted), along with\n/// the list of unique note hashes in said transaction and the `compute_note_hash_and_nullifier` function. Once\n/// discovered, the notes are enqueued for validation.\n///\n/// Partial notes result in a pending partial note entry being stored in a PXE capsule, which will later be retrieved\n/// to search for the note's completion public log.\n///\n/// Events are processed by computing an event commitment from the serialized event data and its randomness field, then\n/// enqueueing the event data and commitment for validation.\npub unconstrained fn process_message_ciphertext<Env>(\n contract_address: AztecAddress,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n message_ciphertext: BoundedVec<Field, MESSAGE_CIPHERTEXT_LEN>,\n message_context: MessageContext,\n) {\n let message_plaintext_option = AES128::decrypt(message_ciphertext, message_context.recipient);\n\n if message_plaintext_option.is_some() {\n process_message_plaintext(\n contract_address,\n compute_note_hash_and_nullifier,\n message_plaintext_option.unwrap(),\n message_context,\n );\n } else {\n debug_log_format(\n \"Found invalid message from tx {0}, ignoring\",\n [message_context.tx_hash],\n );\n }\n}\n\npub unconstrained fn process_message_plaintext<Env>(\n contract_address: AztecAddress,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n message_plaintext: BoundedVec<Field, MESSAGE_PLAINTEXT_LEN>,\n message_context: MessageContext,\n) {\n // The first thing to do after decrypting the message is to determine what type of message we're processing. We\n // have 3 message types: private notes, partial notes and events.\n\n // We decode the message to obtain the message type id, metadata and content.\n let (msg_type_id, msg_metadata, msg_content) = decode_message(message_plaintext);\n\n if msg_type_id == PRIVATE_NOTE_MSG_TYPE_ID {\n debug_log(\"Processing private note msg\");\n\n process_private_note_msg(\n contract_address,\n message_context.tx_hash,\n message_context.unique_note_hashes_in_tx,\n message_context.first_nullifier_in_tx,\n message_context.recipient,\n compute_note_hash_and_nullifier,\n msg_metadata,\n msg_content,\n );\n } else if msg_type_id == PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID {\n debug_log(\"Processing partial note private msg\");\n\n process_partial_note_private_msg(\n contract_address,\n message_context.recipient,\n msg_metadata,\n msg_content,\n );\n } else if msg_type_id == PRIVATE_EVENT_MSG_TYPE_ID {\n debug_log(\"Processing private event msg\");\n\n process_private_event_msg(\n contract_address,\n message_context.recipient,\n msg_metadata,\n msg_content,\n message_context.tx_hash,\n );\n } else {\n debug_log_format(\"Unknown msg type id {0}\", [msg_type_id as Field]);\n }\n}\n"
806
810
  },
807
- "130": {
811
+ "133": {
808
812
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/encoding.nr",
809
813
  "source": "// TODO(#12750): don't make these values assume we're using AES.\nuse crate::protocol::constants::PRIVATE_LOG_CIPHERTEXT_LEN;\nuse crate::utils::array;\n\n// We reassign to the constant here to communicate the distinction between a log and a message. In Aztec.nr, unlike in\n// protocol circuits, we have a concept of a message that can be emitted either as a private log or as an offchain\n// message. Message is a piece of data that is to be eventually delivered to a contract via the `process_message(...)`\n// utility function function that is injected by the #[aztec] macro. Note: PRIVATE_LOG_CIPHERTEXT_LEN is an amount of\n// fields, so MESSAGE_CIPHERTEXT_LEN is the size of the message in fields.\npub global MESSAGE_CIPHERTEXT_LEN: u32 = PRIVATE_LOG_CIPHERTEXT_LEN;\n\n// TODO(#12750): The global variables below should not be here as they are AES128 specific. ciphertext_length (2) + 14\n// bytes pkcs#7 AES padding.\npub(crate) global HEADER_CIPHERTEXT_SIZE_IN_BYTES: u32 = 16;\n\npub global EPH_PK_X_SIZE_IN_FIELDS: u32 = 1;\npub global EPH_PK_SIGN_BYTE_SIZE_IN_BYTES: u32 = 1;\n\n// (17 - 1) * 31 - 16 - 1 = 479 Note: We multiply by 31 because ciphertext bytes are stored in fields using\n// bytes_to_fields, which packs 31 bytes per field (since a Field is ~254 bits and can safely store 31 whole bytes).\nglobal MESSAGE_PLAINTEXT_SIZE_IN_BYTES: u32 = (MESSAGE_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS) * 31\n - HEADER_CIPHERTEXT_SIZE_IN_BYTES\n - EPH_PK_SIGN_BYTE_SIZE_IN_BYTES;\n// The plaintext bytes represent Field values that were originally serialized using fields_to_bytes, which converts\n// each Field to 32 bytes. To convert the plaintext bytes back to fields, we divide by 32. 479 / 32 = 14\npub global MESSAGE_PLAINTEXT_LEN: u32 = MESSAGE_PLAINTEXT_SIZE_IN_BYTES / 32;\n\npub global MESSAGE_EXPANDED_METADATA_LEN: u32 = 1;\n\n// The standard message layout is composed of:\n// - an initial field called the 'expanded metadata'\n// - an arbitrary number of fields following that called the 'message content'\n//\n// ```\n// message: [ msg_expanded_metadata, ...msg_content ]\n// ```\n//\n// The expanded metadata itself is interpreted as a u128, of which:\n// - the upper 64 bits are the message type id\n// - the lower 64 bits are called the 'message metadata'\n//\n// ```\n// msg_expanded_metadata: [ msg_type_id | msg_metadata ]\n// <--- 64 bits --->|<--- 64 bits --->\n// ```\n//\n// The meaning of the message metadata and message content depend on the value of the message type id. Note that there\n// is nothing special about the message metadata, it _can_ be considered part of the content. It just has a different\n// name to make it distinct from the message content given that it is not a full field.\n\n/// The maximum length of a message's content, i.e. not including the expanded message metadata.\npub global MAX_MESSAGE_CONTENT_LEN: u32 = MESSAGE_PLAINTEXT_LEN - MESSAGE_EXPANDED_METADATA_LEN;\n\n/// Encodes a message following aztec-nr's standard message encoding. This message can later be decoded with\n/// `decode_message` to retrieve the original values.\n///\n/// - The `msg_type` is an identifier that groups types of messages that are all processed the same way, e.g. private\n/// notes or events. Possible values are defined in `aztec::messages::msg_type`.\n/// - The `msg_metadata` and `msg_content` are the values stored in the message, whose meaning depends on the\n/// `msg_type`. The only special thing about `msg_metadata` that separates it from `msg_content` is that it is a u64\n/// instead of a full Field (due to details of how messages are encoded), allowing applications that can fit values\n/// into this smaller variable to achieve higher data efficiency.\npub fn encode_message<let N: u32>(\n msg_type: u64,\n msg_metadata: u64,\n msg_content: [Field; N],\n) -> [Field; (N + MESSAGE_EXPANDED_METADATA_LEN)] {\n std::static_assert(\n msg_content.len() <= MAX_MESSAGE_CONTENT_LEN,\n \"Invalid message content: it must have a length of at most MAX_MESSAGE_CONTENT_LEN\",\n );\n\n // If MESSAGE_EXPANDED_METADATA_LEN is changed, causing the assertion below to fail, then the destructuring of the\n // message encoding below must be updated as well.\n std::static_assert(\n MESSAGE_EXPANDED_METADATA_LEN == 1,\n \"unexpected value for MESSAGE_EXPANDED_METADATA_LEN\",\n );\n let mut message: [Field; (N + MESSAGE_EXPANDED_METADATA_LEN)] = std::mem::zeroed();\n\n message[0] = to_expanded_metadata(msg_type, msg_metadata);\n for i in 0..msg_content.len() {\n message[MESSAGE_EXPANDED_METADATA_LEN + i] = msg_content[i];\n }\n\n message\n}\n\n/// Decodes a standard aztec-nr message, i.e. one created via `encode_message`, returning the original encoded values.\n///\n/// Note that `encode_message` returns a fixed size array while this function takes a `BoundedVec`: this is because\n/// prior to decoding the message type is unknown, and consequentially not known at compile time. If working with\n/// fixed-size messages, consider using `BoundedVec::from_array` to convert them.\npub unconstrained fn decode_message(\n message: BoundedVec<Field, MESSAGE_PLAINTEXT_LEN>,\n) -> (u64, u64, BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>) {\n assert(\n message.len() >= MESSAGE_EXPANDED_METADATA_LEN,\n f\"Invalid message: it must have at least {MESSAGE_EXPANDED_METADATA_LEN} fields\",\n );\n\n // If MESSAGE_EXPANDED_METADATA_LEN is changed, causing the assertion below to fail, then the destructuring of the\n // message encoding below must be updated as well.\n std::static_assert(\n MESSAGE_EXPANDED_METADATA_LEN == 1,\n \"unexpected value for MESSAGE_EXPANDED_METADATA_LEN\",\n );\n\n let msg_expanded_metadata = message.get(0);\n let (msg_type_id, msg_metadata) = from_expanded_metadata(msg_expanded_metadata);\n let msg_content = array::subbvec(message, MESSAGE_EXPANDED_METADATA_LEN);\n\n (msg_type_id, msg_metadata, msg_content)\n}\n\nglobal U64_SHIFT_MULTIPLIER: Field = 2.pow_32(64);\n\nfn to_expanded_metadata(msg_type: u64, msg_metadata: u64) -> Field {\n // We use multiplication instead of bit shifting operations to shift the type bits as bit shift operations are\n // expensive in circuits.\n let type_field: Field = (msg_type as Field) * U64_SHIFT_MULTIPLIER;\n let msg_metadata_field = msg_metadata as Field;\n\n type_field + msg_metadata_field\n}\n\nfn from_expanded_metadata(input: Field) -> (u64, u64) {\n input.assert_max_bit_size::<128>();\n let msg_metadata = (input as u64);\n let msg_type = ((input - (msg_metadata as Field)) / U64_SHIFT_MULTIPLIER) as u64;\n // Use division instead of bit shift since bit shifts are expensive in circuits\n (msg_type, msg_metadata)\n}\n\nmod tests {\n use crate::utils::array::subarray::subarray;\n use super::{decode_message, encode_message, from_expanded_metadata, MAX_MESSAGE_CONTENT_LEN, to_expanded_metadata};\n\n global U64_MAX: u64 = (2.pow_32(64) - 1) as u64;\n global U128_MAX: Field = (2.pow_32(128) - 1);\n\n #[test]\n unconstrained fn encode_decode_empty_message(msg_type: u64, msg_metadata: u64) {\n let encoded = encode_message(msg_type, msg_metadata, []);\n let (decoded_msg_type, decoded_msg_metadata, decoded_msg_content) =\n decode_message(BoundedVec::from_array(encoded));\n\n assert_eq(decoded_msg_type, msg_type);\n assert_eq(decoded_msg_metadata, msg_metadata);\n assert_eq(decoded_msg_content.len(), 0);\n }\n\n #[test]\n unconstrained fn encode_decode_short_message(\n msg_type: u64,\n msg_metadata: u64,\n msg_content: [Field; MAX_MESSAGE_CONTENT_LEN / 2],\n ) {\n let encoded = encode_message(msg_type, msg_metadata, msg_content);\n let (decoded_msg_type, decoded_msg_metadata, decoded_msg_content) =\n decode_message(BoundedVec::from_array(encoded));\n\n assert_eq(decoded_msg_type, msg_type);\n assert_eq(decoded_msg_metadata, msg_metadata);\n assert_eq(decoded_msg_content.len(), msg_content.len());\n assert_eq(subarray(decoded_msg_content.storage(), 0), msg_content);\n }\n\n #[test]\n unconstrained fn encode_decode_full_message(\n msg_type: u64,\n msg_metadata: u64,\n msg_content: [Field; MAX_MESSAGE_CONTENT_LEN],\n ) {\n let encoded = encode_message(msg_type, msg_metadata, msg_content);\n let (decoded_msg_type, decoded_msg_metadata, decoded_msg_content) =\n decode_message(BoundedVec::from_array(encoded));\n\n assert_eq(decoded_msg_type, msg_type);\n assert_eq(decoded_msg_metadata, msg_metadata);\n assert_eq(decoded_msg_content.len(), msg_content.len());\n assert_eq(subarray(decoded_msg_content.storage(), 0), msg_content);\n }\n\n #[test]\n unconstrained fn to_expanded_metadata_packing() {\n // Test case 1: All bits set\n let packed = to_expanded_metadata(U64_MAX, U64_MAX);\n let (msg_type, msg_metadata) = from_expanded_metadata(packed);\n assert_eq(msg_type, U64_MAX);\n assert_eq(msg_metadata, U64_MAX);\n\n // Test case 2: Only log type bits set\n let packed = to_expanded_metadata(U64_MAX, 0);\n let (msg_type, msg_metadata) = from_expanded_metadata(packed);\n assert_eq(msg_type, U64_MAX);\n assert_eq(msg_metadata, 0);\n\n // Test case 3: Only msg_metadata bits set\n let packed = to_expanded_metadata(0, U64_MAX);\n let (msg_type, msg_metadata) = from_expanded_metadata(packed);\n assert_eq(msg_type, 0);\n assert_eq(msg_metadata, U64_MAX);\n\n // Test case 4: No bits set\n let packed = to_expanded_metadata(0, 0);\n let (msg_type, msg_metadata) = from_expanded_metadata(packed);\n assert_eq(msg_type, 0);\n assert_eq(msg_metadata, 0);\n }\n\n #[test]\n unconstrained fn from_expanded_metadata_packing() {\n // Test case 1: All bits set\n let input = U128_MAX as Field;\n let (msg_type, msg_metadata) = from_expanded_metadata(input);\n assert_eq(msg_type, U64_MAX);\n assert_eq(msg_metadata, U64_MAX);\n\n // Test case 2: Only log type bits set\n let input = (U128_MAX - U64_MAX as Field);\n let (msg_type, msg_metadata) = from_expanded_metadata(input);\n assert_eq(msg_type, U64_MAX);\n assert_eq(msg_metadata, 0);\n\n // Test case 3: Only msg_metadata bits set\n let input = U64_MAX as Field;\n let (msg_type, msg_metadata) = from_expanded_metadata(input);\n assert_eq(msg_type, 0);\n assert_eq(msg_metadata, U64_MAX);\n\n // Test case 4: No bits set\n let input = 0;\n let (msg_type, msg_metadata) = from_expanded_metadata(input);\n assert_eq(msg_type, 0);\n assert_eq(msg_metadata, 0);\n }\n\n #[test]\n unconstrained fn to_from_expanded_metadata(original_msg_type: u64, original_msg_metadata: u64) {\n let packed = to_expanded_metadata(original_msg_type, original_msg_metadata);\n let (unpacked_msg_type, unpacked_msg_metadata) = from_expanded_metadata(packed);\n\n assert_eq(original_msg_type, unpacked_msg_type);\n assert_eq(original_msg_metadata, unpacked_msg_metadata);\n }\n}\n"
810
814
  },
811
- "131": {
815
+ "134": {
812
816
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/encryption/aes128.nr",
813
817
  "source": "use crate::protocol::{\n address::AztecAddress,\n constants::{DOM_SEP__SYMMETRIC_KEY, DOM_SEP__SYMMETRIC_KEY_2},\n hash::poseidon2_hash_with_separator,\n point::Point,\n public_keys::AddressPoint,\n};\n\nuse crate::{\n keys::{ecdh_shared_secret::derive_ecdh_shared_secret, ephemeral::generate_ephemeral_key_pair},\n messages::{\n encoding::{\n EPH_PK_SIGN_BYTE_SIZE_IN_BYTES, EPH_PK_X_SIZE_IN_FIELDS, HEADER_CIPHERTEXT_SIZE_IN_BYTES,\n MESSAGE_CIPHERTEXT_LEN, MESSAGE_PLAINTEXT_LEN,\n },\n encryption::message_encryption::MessageEncryption,\n logs::arithmetic_generics_utils::{\n get_arr_of_size__message_bytes__from_PT, get_arr_of_size__message_bytes_padding__from_PT,\n },\n },\n oracle::{aes128_decrypt::aes128_decrypt_oracle, random::random, shared_secret::get_shared_secret},\n utils::{\n array,\n conversion::{\n bytes_to_fields::{bytes_from_fields, bytes_to_fields},\n fields_to_bytes::{fields_from_bytes, fields_to_bytes},\n },\n point::{get_sign_of_point, point_from_x_coord_and_sign},\n random::get_random_bytes,\n },\n};\n\nuse std::aes128::aes128_encrypt;\n\n/// Computes N close-to-uniformly-random 256 bits from a given ECDH shared_secret.\n///\n/// NEVER re-use the same iv and sym_key. DO NOT call this function more than once with the same shared_secret.\n///\n/// This function is only known to be safe if shared_secret is computed by combining a random ephemeral key with an\n/// address point. See big comment within the body of the function. See big comment within the body of the function.\nfn extract_many_close_to_uniformly_random_256_bits_from_ecdh_shared_secret_using_poseidon2_unsafe<let N: u32>(\n shared_secret: Point,\n) -> [[u8; 32]; N] {\n /*\n * Unsafe because of https://eprint.iacr.org/2010/264.pdf Page 13, Lemma 2 (and the * two\n paragraphs below it).\n *\n * If you call this function, you need to be careful and aware of how the arg\n * `shared_secret` has been derived.\n *\n * The paper says that the way you derive aes keys and IVs should be fine with poseidon2\n * (modelled as a RO), as long as you _don't_ use Poseidon2 as a PRG to generate the * two\n exponents x & y which multiply to the shared secret S:\n *\n * S = [x*y]*G.\n *\n * (Otherwise, you would have to \"key\" poseidon2, i.e. generate a uniformly string K\n * which can be public and compute Hash(x) as poseidon(K,x)).\n * In that lemma, k would be 2*254=508, and m would be the number of points on the * grumpkin\n curve (which is close to r according to the Hasse bound).\n *\n * Our shared secret S is [esk * address_sk] * G, and the question is: * Can we compute hash(S)\n using poseidon2 instead of sha256?\n *\n * Well, esk is random and not generated with poseidon2, so that's good.\n * What about address_sk?\n * Well, address_sk = poseidon2(stuff) + ivsk, so there was some\n * discussion about whether address_sk is independent of poseidon2.\n * Given that ivsk is random and independent of poseidon2, the address_sk is also\n * independent of poseidon2.\n *\n * Tl;dr: we believe it's safe to hash S = [esk * address_sk] * G using poseidon2,\n * in order to derive a symmetric key.\n *\n * If you're calling this function for a differently-derived `shared_secret`, be\n * careful.\n *\n */\n \n\n /* The output of this function needs to be 32 random bytes.\n * A single field won't give us 32 bytes of entropy.\n * So we compute two \"random\" fields, by poseidon-hashing with two different\n * generators.\n * We then extract the last 16 (big endian) bytes of each \"random\" field.\n * Note: we use to_be_bytes because it's slightly more efficient. But we have to\n * be careful not to take bytes from the \"big end\", because the \"big\" byte is\n * not uniformly random over the byte: it only has < 6 bits of randomness, because\n * it's the big end of a 254-bit field element.\n */\n\n let mut all_bytes: [[u8; 32]; N] = std::mem::zeroed();\n // We restrict N to be < 2^8, because of how we compute the domain separator from k below (where k <= N must be 8\n // bits). In practice, it's extremely unlikely that an app will want to compute >= 256 ciphertexts.\n std::static_assert(N < 256, \"N too large\");\n for k in 0..N {\n // We augment the domain separator with the loop index, so that we can generate N lots of randomness.\n let k_shift = (k << 8);\n let separator_1 = k_shift + DOM_SEP__SYMMETRIC_KEY;\n let separator_2 = k_shift + DOM_SEP__SYMMETRIC_KEY_2;\n\n let rand1: Field = poseidon2_hash_with_separator([shared_secret.x, shared_secret.y], separator_1);\n let rand2: Field = poseidon2_hash_with_separator([shared_secret.x, shared_secret.y], separator_2);\n\n let rand1_bytes: [u8; 32] = rand1.to_be_bytes();\n let rand2_bytes: [u8; 32] = rand2.to_be_bytes();\n\n let mut bytes: [u8; 32] = [0; 32];\n for i in 0..16 {\n // We take bytes from the \"little end\" of the be-bytes arrays:\n let j = 32 - i - 1;\n bytes[i] = rand1_bytes[j];\n bytes[16 + i] = rand2_bytes[j];\n }\n\n all_bytes[k] = bytes;\n }\n\n all_bytes\n}\n\nfn derive_aes_symmetric_key_and_iv_from_uniformly_random_256_bits<let N: u32>(\n many_random_256_bits: [[u8; 32]; N],\n) -> [([u8; 16], [u8; 16]); N] {\n // Many (sym_key, iv) pairs:\n let mut many_pairs: [([u8; 16], [u8; 16]); N] = std::mem::zeroed();\n for k in 0..N {\n let random_256_bits = many_random_256_bits[k];\n let mut sym_key = [0; 16];\n let mut iv = [0; 16];\n for i in 0..16 {\n sym_key[i] = random_256_bits[i];\n iv[i] = random_256_bits[i + 16];\n }\n many_pairs[k] = (sym_key, iv);\n }\n\n many_pairs\n}\n\npub fn derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_poseidon2_unsafe<let N: u32>(\n shared_secret: Point,\n) -> [([u8; 16], [u8; 16]); N] {\n let many_random_256_bits: [[u8; 32]; N] =\n extract_many_close_to_uniformly_random_256_bits_from_ecdh_shared_secret_using_poseidon2_unsafe(shared_secret);\n\n derive_aes_symmetric_key_and_iv_from_uniformly_random_256_bits(many_random_256_bits)\n}\n\npub struct AES128 {}\n\nimpl MessageEncryption for AES128 {\n fn encrypt<let PlaintextLen: u32>(\n plaintext: [Field; PlaintextLen],\n recipient: AztecAddress,\n ) -> [Field; MESSAGE_CIPHERTEXT_LEN] {\n // AES 128 operates on bytes, not fields, so we need to convert the fields to bytes. (This process is then\n // reversed when processing the message in `process_message_ciphertext`)\n let plaintext_bytes = fields_to_bytes(plaintext);\n\n // ***************************************************************************** Compute the shared secret\n // *****************************************************************************\n\n let (eph_sk, eph_pk) = generate_ephemeral_key_pair();\n\n let eph_pk_sign_byte: u8 = get_sign_of_point(eph_pk) as u8;\n\n // (not to be confused with the tagging shared secret) TODO (#17158): Currently we unwrap the Option returned\n // by derive_ecdh_shared_secret. We need to handle the case where the ephemeral public key is invalid to\n // prevent potential DoS vectors.\n let ciphertext_shared_secret = derive_ecdh_shared_secret(\n eph_sk,\n recipient\n .to_address_point()\n .unwrap_or(\n // Safety: if the recipient is an invalid address, then it is not possible to encrypt a message for\n // them because we cannot establish a shared secret. This is never expected to occur during normal\n // operation. However, it is technically possible for us to receive an invalid address, and we must\n // therefore handle it. We could simply fail, but that'd introduce a potential security issue in\n // which an attacker forces a contract to encrypt a message for an invalid address, resulting in an\n // impossible transaction - this is sometimes called a 'king of the hill' attack. We choose instead\n // to not fail and encrypt the plaintext regardless using the shared secret that results from a\n // random valid address. The sender is free to choose this address and hence shared secret, but\n // this has no security implications as they already know not only the full plaintext but also the\n // ephemeral private key anyway.\n unsafe { random_address_point() },\n )\n .inner,\n );\n // TODO: also use this shared secret for deriving note randomness.\n\n // ***************************************************************************** Convert the plaintext into\n // whatever format the encryption function expects\n // *****************************************************************************\n\n // Already done for this strategy: AES expects bytes.\n\n // ***************************************************************************** Encrypt the plaintext\n // *****************************************************************************\n\n // It is safe to call the `unsafe` function here, because we know the `shared_secret` was derived using an\n // AztecAddress (the recipient). See the block comment at the start of this unsafe target function for more\n // info.\n let pairs = derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_poseidon2_unsafe::<2>(\n ciphertext_shared_secret,\n );\n let (body_sym_key, body_iv) = pairs[0];\n let (header_sym_key, header_iv) = pairs[1];\n\n let ciphertext_bytes = aes128_encrypt(plaintext_bytes, body_iv, body_sym_key);\n\n // |full_pt| = |pt_length| + |pt|\n // |pt_aes_padding| = 16 - (|full_pt| % 16)\n // or... since a % b is the same as a - b * (a // b) (integer division), so:\n // |pt_aes_padding| = 16 - (|full_pt| - 16 * (|full_pt| // 16))\n // |ct| = |full_pt| + |pt_aes_padding|\n // = |full_pt| + 16 - (|full_pt| - 16 * (|full_pt| // 16)) = 16 + 16 * (|full_pt| // 16) = 16 * (1 +\n // |full_pt| // 16)\n std::static_assert(\n ciphertext_bytes.len() == 16 * (1 + (PlaintextLen * 32) / 16),\n \"unexpected ciphertext length\",\n );\n\n // ***************************************************************************** Compute the header ciphertext\n // *****************************************************************************\n\n // Header contains only the length of the ciphertext stored in 2 bytes.\n let mut header_plaintext: [u8; 2] = [0 as u8; 2];\n let ciphertext_bytes_length = ciphertext_bytes.len();\n header_plaintext[0] = (ciphertext_bytes_length >> 8) as u8;\n header_plaintext[1] = ciphertext_bytes_length as u8;\n\n // Note: the aes128_encrypt builtin fn automatically appends bytes to the input, according to pkcs#7; hence why\n // the output `header_ciphertext_bytes` is 16 bytes larger than the input in this case.\n let header_ciphertext_bytes = aes128_encrypt(header_plaintext, header_iv, header_sym_key);\n // I recall that converting a slice to an array incurs constraints, so I'll check the length this way instead:\n std::static_assert(\n header_ciphertext_bytes.len() == HEADER_CIPHERTEXT_SIZE_IN_BYTES,\n \"unexpected ciphertext header length\",\n );\n\n // ***************************************************************************** Prepend / append more bytes of\n // data to the ciphertext, before converting back to fields.\n // *****************************************************************************\n\n let mut message_bytes_padding_to_mult_31 =\n get_arr_of_size__message_bytes_padding__from_PT::<PlaintextLen * 32>();\n // Safety: this randomness won't be constrained to be random. It's in the interest of the executor of this fn\n // to encrypt with random bytes.\n message_bytes_padding_to_mult_31 = unsafe { get_random_bytes() };\n\n let mut message_bytes = get_arr_of_size__message_bytes__from_PT::<PlaintextLen * 32>();\n\n std::static_assert(\n message_bytes.len() % 31 == 0,\n \"Unexpected error: message_bytes.len() should be divisible by 31, by construction.\",\n );\n\n message_bytes[0] = eph_pk_sign_byte;\n let mut offset = 1;\n for i in 0..header_ciphertext_bytes.len() {\n message_bytes[offset + i] = header_ciphertext_bytes[i];\n }\n offset += header_ciphertext_bytes.len();\n\n for i in 0..ciphertext_bytes.len() {\n message_bytes[offset + i] = ciphertext_bytes[i];\n }\n offset += ciphertext_bytes.len();\n\n for i in 0..message_bytes_padding_to_mult_31.len() {\n message_bytes[offset + i] = message_bytes_padding_to_mult_31[i];\n }\n offset += message_bytes_padding_to_mult_31.len();\n\n // Ideally we would be able to have a static assert where we check that the offset would be such that we've\n // written to the entire log_bytes array, but we cannot since Noir does not treat the offset as a comptime\n // value (despite the values that it goes through being known at each stage). We instead check that the\n // computation used to obtain the offset computes the expected value (which we _can_ do in a static check), and\n // then add a cheap runtime check to also validate that the offset matches this.\n std::static_assert(\n 1 + header_ciphertext_bytes.len() + ciphertext_bytes.len() + message_bytes_padding_to_mult_31.len()\n == message_bytes.len(),\n \"unexpected message length\",\n );\n assert(offset == message_bytes.len(), \"unexpected encrypted message length\");\n\n // ***************************************************************************** Convert bytes back to fields\n // *****************************************************************************\n\n // TODO(#12749): As Mike pointed out, we need to make messages produced by different encryption schemes\n // indistinguishable from each other and for this reason the output here and in the last for-loop of this\n // function should cover a full field.\n let message_bytes_as_fields = bytes_to_fields(message_bytes);\n\n // ***************************************************************************** Prepend / append fields, to\n // create the final message *****************************************************************************\n\n let mut ciphertext: [Field; MESSAGE_CIPHERTEXT_LEN] = [0; MESSAGE_CIPHERTEXT_LEN];\n\n ciphertext[0] = eph_pk.x;\n\n let mut offset = 1;\n for i in 0..message_bytes_as_fields.len() {\n ciphertext[offset + i] = message_bytes_as_fields[i];\n }\n offset += message_bytes_as_fields.len();\n\n for i in offset..MESSAGE_CIPHERTEXT_LEN {\n // We need to get a random value that fits in 31 bytes to not leak information about the size of the\n // message (all the \"real\" message fields contain at most 31 bytes because of the way we convert the bytes\n // to fields). TODO(#12749): Long term, this is not a good solution.\n\n // Safety: we assume that the sender wants for the message to be private - a malicious one could simply\n // reveal its contents publicly. It is therefore fine to trust the sender to provide random padding.\n let field_bytes = unsafe { get_random_bytes::<31>() };\n ciphertext[i] = Field::from_be_bytes::<31>(field_bytes);\n }\n\n ciphertext\n }\n\n unconstrained fn decrypt(\n ciphertext: BoundedVec<Field, MESSAGE_CIPHERTEXT_LEN>,\n recipient: AztecAddress,\n ) -> Option<BoundedVec<Field, MESSAGE_PLAINTEXT_LEN>> {\n let eph_pk_x = ciphertext.get(0);\n\n let ciphertext_without_eph_pk_x_fields = array::subbvec::<Field, MESSAGE_CIPHERTEXT_LEN, MESSAGE_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS>(\n ciphertext,\n EPH_PK_X_SIZE_IN_FIELDS,\n );\n\n // Convert the ciphertext represented as fields to a byte representation (its original format)\n let ciphertext_without_eph_pk_x = bytes_from_fields(ciphertext_without_eph_pk_x_fields);\n\n // First byte of the ciphertext represents the ephemeral public key sign\n let eph_pk_sign_bool = ciphertext_without_eph_pk_x.get(0) != 0;\n\n // With the sign and the x-coordinate of the ephemeral public key, we can reconstruct the point. This may fail\n // however, as not all x-coordinates are on the curve. In that case, we simply return `Option::none`.\n point_from_x_coord_and_sign(eph_pk_x, eph_pk_sign_bool).map(|eph_pk| {\n // Derive shared secret\n let ciphertext_shared_secret = get_shared_secret(recipient, eph_pk);\n\n // Derive symmetric keys:\n let pairs = derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_poseidon2_unsafe::<2>(\n ciphertext_shared_secret,\n );\n let (body_sym_key, body_iv) = pairs[0];\n let (header_sym_key, header_iv) = pairs[1];\n\n // Extract the header ciphertext\n let header_start = EPH_PK_SIGN_BYTE_SIZE_IN_BYTES; // Skip eph_pk_sign byte\n let header_ciphertext: [u8; HEADER_CIPHERTEXT_SIZE_IN_BYTES] =\n array::subarray(ciphertext_without_eph_pk_x.storage(), header_start);\n // We need to convert the array to a BoundedVec because the oracle expects a BoundedVec as it's designed to\n // work with messages with unknown length at compile time. This would not be necessary here as the header\n // ciphertext length is fixed. But we do it anyway to not have to have duplicate oracles.\n let header_ciphertext_bvec =\n BoundedVec::<u8, HEADER_CIPHERTEXT_SIZE_IN_BYTES>::from_array(header_ciphertext);\n\n // Decrypt header\n let header_plaintext = aes128_decrypt_oracle(header_ciphertext_bvec, header_iv, header_sym_key);\n\n // Extract ciphertext length from header (2 bytes, big-endian)\n let ciphertext_length = ((header_plaintext.get(0) as u32) << 8) | (header_plaintext.get(1) as u32);\n\n // Extract and decrypt main ciphertext\n let ciphertext_start = header_start + HEADER_CIPHERTEXT_SIZE_IN_BYTES;\n let ciphertext_with_padding: [u8; (MESSAGE_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS) * 31 - HEADER_CIPHERTEXT_SIZE_IN_BYTES - EPH_PK_SIGN_BYTE_SIZE_IN_BYTES] =\n array::subarray(ciphertext_without_eph_pk_x.storage(), ciphertext_start);\n let ciphertext: BoundedVec<u8, (MESSAGE_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS) * 31 - HEADER_CIPHERTEXT_SIZE_IN_BYTES - EPH_PK_SIGN_BYTE_SIZE_IN_BYTES> =\n BoundedVec::from_parts(ciphertext_with_padding, ciphertext_length);\n\n // Decrypt main ciphertext and return it\n let plaintext_bytes = aes128_decrypt_oracle(ciphertext, body_iv, body_sym_key);\n\n // Each field of the original note message was serialized to 32 bytes so we convert the bytes back to\n // fields.\n fields_from_bytes(plaintext_bytes)\n })\n }\n}\n\n/// Produces a random valid address point, i.e. one that is on the curve. This is equivalent to calling\n/// [`AztecAddress::to_address_point`] on a random valid address.\nunconstrained fn random_address_point() -> AddressPoint {\n let mut result = std::mem::zeroed();\n\n loop {\n // We simply produce random x coordinates until we find one that is on the curve. About half of the x\n // coordinates fulfill this condition, so this should only take a few iterations at most.\n let x_coord = random();\n let point = point_from_x_coord_and_sign(x_coord, true);\n if point.is_some() {\n result = AddressPoint { inner: point.unwrap() };\n break;\n }\n }\n\n result\n}\n\nmod test {\n use crate::{\n keys::ecdh_shared_secret::derive_ecdh_shared_secret,\n messages::{encoding::MESSAGE_PLAINTEXT_LEN, encryption::message_encryption::MessageEncryption},\n test::helpers::test_environment::TestEnvironment,\n };\n use crate::protocol::{address::AztecAddress, traits::FromField};\n use super::{AES128, random_address_point};\n use std::{embedded_curve_ops::EmbeddedCurveScalar, test::OracleMock};\n\n #[test]\n unconstrained fn encrypt_decrypt_deterministic() {\n let env = TestEnvironment::new();\n\n // Message decryption requires oracles that are only available during private execution\n env.private_context(|_| {\n let plaintext = [1, 2, 3];\n\n let recipient = AztecAddress::from_field(\n 0x25afb798ea6d0b8c1618e50fdeafa463059415013d3b7c75d46abf5e242be70c,\n );\n\n // Mock random values for deterministic test\n let eph_sk = 0x1358d15019d4639393d62b97e1588c095957ce74a1c32d6ec7d62fe6705d9538;\n let _ = OracleMock::mock(\"utilityGetRandomField\").returns(eph_sk).times(1);\n\n let randomness = 0x0101010101010101010101010101010101010101010101010101010101010101;\n let _ = OracleMock::mock(\"utilityGetRandomField\").returns(randomness).times(1000000);\n\n let _ = OracleMock::mock(\"privateGetNextAppTagAsSender\").returns(42);\n\n // Encrypt the message\n let encrypted_message = BoundedVec::from_array(AES128::encrypt(plaintext, recipient));\n\n // Mock shared secret for deterministic test\n let shared_secret = derive_ecdh_shared_secret(\n EmbeddedCurveScalar::from_field(eph_sk),\n recipient.to_address_point().unwrap().inner,\n );\n\n let _ = OracleMock::mock(\"utilityGetSharedSecret\").returns(shared_secret);\n\n // Decrypt the message\n let decrypted = AES128::decrypt(encrypted_message, recipient).unwrap();\n\n // The decryption function spits out a BoundedVec because it's designed to work with messages with unknown\n // length at compile time. For this reason we need to convert the original input to a BoundedVec.\n let plaintext_bvec = BoundedVec::<Field, MESSAGE_PLAINTEXT_LEN>::from_array(plaintext);\n\n // Verify decryption matches original plaintext\n assert_eq(decrypted, plaintext_bvec, \"Decrypted bytes should match original plaintext\");\n\n // The following is a workaround of \"struct is never constructed\" Noir compilation error (we only ever use\n // static methods of the struct).\n let _ = AES128 {};\n });\n }\n\n #[test]\n unconstrained fn encrypt_decrypt_random() {\n // Same as `encrypt_decrypt_deterministic`, except we don't mock any of the oracles and rely on\n // `TestEnvironment` instead.\n let mut env = TestEnvironment::new();\n\n let recipient = env.create_light_account();\n\n env.private_context(|_| {\n let plaintext = [1, 2, 3];\n let ciphertext = AES128::encrypt(plaintext, recipient);\n\n assert_eq(\n AES128::decrypt(BoundedVec::from_array(ciphertext), recipient).unwrap(),\n BoundedVec::from_array(plaintext),\n );\n });\n }\n\n #[test]\n unconstrained fn encrypt_to_invalid_address() {\n // x = 3 is a non-residue for this curve, resulting in an invalid address\n let invalid_address = AztecAddress { inner: 3 };\n\n // We just test that we produced some output and did not crash - the result is gibberish as it is encrypted\n // using a public key for which we do not know the private key.\n let _ = AES128::encrypt([1, 2, 3, 4], invalid_address);\n }\n\n #[test]\n unconstrained fn random_address_point_produces_valid_points() {\n // About half of random addresses are invalid, so testing just a couple gives us high confidence that\n // `random_address_point` is indeed producing valid addresses.\n for _ in 0..10 {\n let random_address = AztecAddress { inner: random_address_point().inner.x };\n assert(random_address.to_address_point().is_some());\n }\n }\n\n #[test]\n unconstrained fn decrypt_invalid_ephemeral_public_key() {\n let mut env = TestEnvironment::new();\n\n let recipient = env.create_light_account();\n\n env.private_context(|_| {\n let plaintext = [1, 2, 3, 4];\n let ciphertext = AES128::encrypt(plaintext, recipient);\n\n // The first field of the ciphertext is the x-coordinate of the ephemeral public key. We set it to a known\n // non-residue (3), causing `decrypt` to fail to produce a decryption shared secret.\n let mut bad_ciphertext = BoundedVec::from_array(ciphertext);\n bad_ciphertext.set(0, 3);\n\n assert(AES128::decrypt(bad_ciphertext, recipient).is_none());\n });\n }\n}\n"
814
818
  },
815
- "136": {
819
+ "139": {
816
820
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/logs/event.nr",
817
821
  "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"
818
822
  },
819
- "138": {
823
+ "141": {
820
824
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/logs/note.nr",
821
825
  "source": "use crate::{\n messages::{\n encoding::{encode_message, MAX_MESSAGE_CONTENT_LEN, MESSAGE_EXPANDED_METADATA_LEN},\n msg_type::PRIVATE_NOTE_MSG_TYPE_ID,\n },\n note::note_interface::NoteType,\n utils::array,\n};\nuse crate::protocol::{address::AztecAddress, traits::{FromField, Packable, ToField}};\n\n/// The number of fields in a private note message content that are not the note's packed representation.\npub(crate) global PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN: u32 = 3;\n\npub(crate) global PRIVATE_NOTE_MSG_PLAINTEXT_OWNER_INDEX: u32 = 0;\npub(crate) global PRIVATE_NOTE_MSG_PLAINTEXT_STORAGE_SLOT_INDEX: u32 = 1;\npub(crate) global PRIVATE_NOTE_MSG_PLAINTEXT_RANDOMNESS_INDEX: u32 = 2;\n\n/// The maximum length of the packed representation of a note's contents. This is limited by private log size,\n/// encryption overhead and extra fields in the message (e.g. message type id, storage slot, randomness, etc.).\npub global MAX_NOTE_PACKED_LEN: u32 = MAX_MESSAGE_CONTENT_LEN - PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN;\n\n/// Creates the plaintext for a private note message (i.e. one of type [`PRIVATE_NOTE_MSG_TYPE_ID`]).\n///\n/// This plaintext is meant to be decoded via [`decode_private_note_message`].\npub fn encode_private_note_message<Note>(\n note: Note,\n owner: AztecAddress,\n storage_slot: Field,\n randomness: Field,\n) -> [Field; PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + <Note as Packable>::N + MESSAGE_EXPANDED_METADATA_LEN]\nwhere\n Note: NoteType + Packable,\n{\n let packed_note = note.pack();\n\n // If PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN is changed, causing the assertion below to fail, then the\n // encoding below must be updated as well.\n std::static_assert(\n PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN == 3,\n \"unexpected value for PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN\",\n );\n\n let mut msg_content = [0; PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + <Note as Packable>::N];\n msg_content[PRIVATE_NOTE_MSG_PLAINTEXT_OWNER_INDEX] = owner.to_field();\n msg_content[PRIVATE_NOTE_MSG_PLAINTEXT_STORAGE_SLOT_INDEX] = storage_slot;\n msg_content[PRIVATE_NOTE_MSG_PLAINTEXT_RANDOMNESS_INDEX] = randomness;\n for i in 0..packed_note.len() {\n msg_content[PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + i] = packed_note[i];\n }\n\n // Notes use the note type id for metadata\n encode_message(PRIVATE_NOTE_MSG_TYPE_ID, Note::get_id() as u64, msg_content)\n}\n\n/// Decodes the plaintext from a private note message (i.e. one of type [`PRIVATE_NOTE_MSG_TYPE_ID`]).\n///\n/// This plaintext is meant to have originated from [`encode_private_note_message`].\n///\n/// Note that while [`encode_private_note_message`] returns a fixed-size array, this function takes a [`BoundedVec`]\n/// instead. This is because when decoding we're typically processing runtime-sized plaintexts, more specifically,\n/// those that originate from [`crate::messages::encryption::message_encryption::MessageEncryption::decrypt`].\npub(crate) unconstrained fn decode_private_note_message(\n msg_metadata: u64,\n msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n) -> (Field, AztecAddress, Field, Field, BoundedVec<Field, MAX_NOTE_PACKED_LEN>) {\n let note_type_id = msg_metadata as Field; // TODO: make note type id not be a full field\n\n assert(\n msg_content.len() > PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN,\n f\"Invalid private note message: all private note messages must have at least {PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN} fields\",\n );\n\n // If PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN is changed, causing the assertion below to fail, then the\n // decoding below must be updated as well.\n std::static_assert(\n PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN == 3,\n \"unexpected value for PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN\",\n );\n\n let owner = AztecAddress::from_field(msg_content.get(PRIVATE_NOTE_MSG_PLAINTEXT_OWNER_INDEX));\n let storage_slot = msg_content.get(PRIVATE_NOTE_MSG_PLAINTEXT_STORAGE_SLOT_INDEX);\n let randomness = msg_content.get(PRIVATE_NOTE_MSG_PLAINTEXT_RANDOMNESS_INDEX);\n let packed_note = array::subbvec(msg_content, PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN);\n\n (note_type_id, owner, storage_slot, randomness, packed_note)\n}\n\nmod test {\n use crate::{\n messages::{\n encoding::decode_message,\n logs::note::{decode_private_note_message, encode_private_note_message},\n msg_type::PRIVATE_NOTE_MSG_TYPE_ID,\n },\n note::note_interface::NoteType,\n };\n use crate::protocol::{address::AztecAddress, traits::{FromField, Packable}};\n use crate::test::mocks::mock_note::MockNote;\n\n global VALUE: Field = 7;\n global OWNER: AztecAddress = AztecAddress::from_field(8);\n global STORAGE_SLOT: Field = 9;\n global RANDOMNESS: Field = 10;\n\n #[test]\n unconstrained fn encode_decode() {\n let note = MockNote::new(VALUE).build_note();\n\n let message_plaintext = encode_private_note_message(note, OWNER, STORAGE_SLOT, RANDOMNESS);\n\n let (msg_type_id, msg_metadata, msg_content) = decode_message(BoundedVec::from_array(message_plaintext));\n\n assert_eq(msg_type_id, PRIVATE_NOTE_MSG_TYPE_ID);\n\n let (note_type_id, owner, storage_slot, randomness, packed_note) =\n decode_private_note_message(msg_metadata, msg_content);\n\n assert_eq(note_type_id, MockNote::get_id());\n assert_eq(owner, OWNER);\n assert_eq(storage_slot, STORAGE_SLOT);\n assert_eq(randomness, RANDOMNESS);\n assert_eq(packed_note, BoundedVec::from_array(note.pack()));\n }\n}\n"
822
826
  },
823
- "139": {
827
+ "142": {
824
828
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/logs/partial_note.nr",
825
829
  "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"
826
830
  },
827
- "149": {
831
+ "152": {
828
832
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/processing/mod.nr",
829
833
  "source": "pub(crate) mod event_validation_request;\n\nmod message_context;\npub use message_context::MessageContext;\n\npub(crate) mod note_validation_request;\npub(crate) mod log_retrieval_request;\npub(crate) mod log_retrieval_response;\npub(crate) mod pending_tagged_log;\n\nuse crate::{\n capsules::CapsuleArray,\n event::EventSelector,\n messages::{\n discovery::partial_notes::DeliveredPendingPartialNote,\n logs::{event::MAX_EVENT_SERIALIZED_LEN, note::MAX_NOTE_PACKED_LEN},\n processing::{\n log_retrieval_request::LogRetrievalRequest, log_retrieval_response::LogRetrievalResponse,\n note_validation_request::NoteValidationRequest, pending_tagged_log::PendingTaggedLog,\n },\n },\n oracle,\n};\nuse crate::protocol::{address::AztecAddress, hash::sha256_to_field};\nuse event_validation_request::EventValidationRequest;\n\n// Base slot for the pending tagged log array to which the fetch_tagged_logs oracle inserts found private logs.\nglobal PENDING_TAGGED_LOG_ARRAY_BASE_SLOT: Field =\n sha256_to_field(\"AZTEC_NR::PENDING_TAGGED_LOG_ARRAY_BASE_SLOT\".as_bytes());\n\nglobal NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT: Field = sha256_to_field(\n \"AZTEC_NR::NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT\".as_bytes(),\n);\n\nglobal EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT: Field = sha256_to_field(\n \"AZTEC_NR::EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT\".as_bytes(),\n);\n\nglobal LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT: Field = sha256_to_field(\n \"AZTEC_NR::LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT\".as_bytes(),\n);\n\nglobal LOG_RETRIEVAL_RESPONSES_ARRAY_BASE_SLOT: Field = sha256_to_field(\n \"AZTEC_NR::LOG_RETRIEVAL_RESPONSES_ARRAY_BASE_SLOT\".as_bytes(),\n);\n\n/// Searches for private logs emitted by `contract_address` that might contain messages for one of the local accounts,\n/// and stores them in a `CapsuleArray` which is then returned.\npub(crate) unconstrained fn get_private_logs(contract_address: AztecAddress) -> CapsuleArray<PendingTaggedLog> {\n // We will eventually perform log discovery via tagging here, but for now we simply call the `fetchTaggedLogs`\n // oracle. This makes PXE synchronize tags, download logs and store the pending tagged logs in a capsule array.\n oracle::message_processing::fetch_tagged_logs(PENDING_TAGGED_LOG_ARRAY_BASE_SLOT);\n\n CapsuleArray::at(contract_address, PENDING_TAGGED_LOG_ARRAY_BASE_SLOT)\n}\n\n/// Enqueues a note for validation by PXE, so that it becomes aware of a note's existence allowing for later retrieval\n/// via `get_notes` oracle. The note will be scoped to `contract_address`, meaning other contracts will not be able to\n/// access it unless authorized.\n///\n/// In order for the note validation and insertion to occur, `validate_and_store_enqueued_notes_and_events` must be\n/// later called. For optimal performance, accumulate as many note validation requests as possible and then validate\n/// them all at the end (which results in PXE minimizing the number of network round-trips).\n///\n/// The `packed_note` is what `getNotes` will later return. PXE indexes notes by `storage_slot`, so this value is\n/// typically used to filter notes that correspond to different state variables. `note_hash` and `nullifier` are the\n/// inner hashes, i.e. the raw hashes returned by `NoteHash::compute_note_hash` and `NoteHash::compute_nullifier`. PXE\n/// will verify that the siloed unique note hash was inserted into the tree at `tx_hash`, and will store the nullifier\n/// to later check for nullification.\n///\n/// `owner` is the address used in note hash and nullifier computation, often requiring knowledge of their nullifier\n/// secret key.\n///\n/// `recipient` is the account to which the note message was delivered (i.e. the address the message was encrypted to).\n/// This determines which PXE account can see the note - other accounts will not be able to access it (e.g. other\n/// accounts will not be able to see one another's token balance notes, even in the same PXE) unless authorized. In\n/// most cases `recipient` equals `owner`, but they can differ in scenarios like delegated discovery.\npub(crate) unconstrained fn enqueue_note_for_validation(\n contract_address: AztecAddress,\n owner: AztecAddress,\n storage_slot: Field,\n randomness: Field,\n note_nonce: Field,\n packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n note_hash: Field,\n nullifier: Field,\n tx_hash: Field,\n recipient: AztecAddress,\n) {\n // We store requests in a `CapsuleArray`, which PXE will later read from and deserialize into its version of the\n // Noir `NoteValidationRequest`\n CapsuleArray::at(contract_address, NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT).push(\n NoteValidationRequest {\n contract_address,\n owner,\n storage_slot,\n randomness,\n note_nonce,\n packed_note,\n note_hash,\n nullifier,\n tx_hash,\n recipient,\n },\n )\n}\n\n/// Enqueues an event for validation by PXE, so that it can be efficiently validated and then inserted into the event\n/// store.\n///\n/// In order for the event validation and insertion to occur, `validate_and_store_enqueued_notes_and_events` must be\n/// later called. For optimal performance, accumulate as many event validation requests as possible and then validate\n/// them all at the end (which results in PXE minimizing the number of network round-trips).\npub(crate) unconstrained fn enqueue_event_for_validation(\n contract_address: AztecAddress,\n event_type_id: EventSelector,\n randomness: Field,\n serialized_event: BoundedVec<Field, MAX_EVENT_SERIALIZED_LEN>,\n event_commitment: Field,\n tx_hash: Field,\n recipient: AztecAddress,\n) {\n // We store requests in a `CapsuleArray`, which PXE will later read from and deserialize into its version of the\n // Noir `EventValidationRequest`\n CapsuleArray::at(contract_address, EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT).push(\n EventValidationRequest {\n contract_address,\n event_type_id,\n randomness,\n serialized_event,\n event_commitment,\n tx_hash,\n recipient,\n },\n )\n}\n\n/// Validates all note and event validation requests enqueued via `enqueue_note_for_validation` and\n/// `enqueue_event_for_validation`, inserting them into the note database and event store respectively, making them\n/// queryable via `get_notes` oracle and our TS API (PXE::getPrivateEvents).\n///\n/// This automatically clears both validation request queues, so no further work needs to be done by the caller.\npub unconstrained fn validate_and_store_enqueued_notes_and_events(contract_address: AztecAddress) {\n oracle::message_processing::validate_and_store_enqueued_notes_and_events(\n contract_address,\n NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT,\n EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT,\n );\n}\n\n/// Efficiently queries the node for logs that result in the completion of all `DeliveredPendingPartialNote`s stored in\n/// a `CapsuleArray` by performing all node communication concurrently. Returns a second `CapsuleArray` with Options\n/// for the responses that correspond to the pending partial notes at the same index.\n///\n/// For example, given an array with pending partial notes `[ p1, p2, p3 ]`, where `p1` and `p3` have corresponding\n/// completion logs but `p2` does not, the returned `CapsuleArray` will have contents `[some(p1_log), none(),\n/// some(p3_log)]`.\npub(crate) unconstrained fn get_pending_partial_notes_completion_logs(\n contract_address: AztecAddress,\n pending_partial_notes: CapsuleArray<DeliveredPendingPartialNote>,\n) -> CapsuleArray<Option<LogRetrievalResponse>> {\n let log_retrieval_requests = CapsuleArray::at(contract_address, LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT);\n\n // We create a LogRetrievalRequest for each PendingPartialNote in the CapsuleArray. Because we need the indices in\n // the request array to match the indices in the partial note array, we can't use CapsuleArray::for_each, as that\n // function has arbitrary iteration order. Instead, we manually iterate the array from the beginning and push into\n // the requests array, which we expect to be empty.\n let mut i = 0;\n let pending_partial_notes_count = pending_partial_notes.len();\n while i < pending_partial_notes_count {\n let pending_partial_note = pending_partial_notes.get(i);\n log_retrieval_requests.push(\n LogRetrievalRequest { contract_address, unsiloed_tag: pending_partial_note.note_completion_log_tag },\n );\n i += 1;\n }\n\n oracle::message_processing::bulk_retrieve_logs(\n contract_address,\n LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT,\n LOG_RETRIEVAL_RESPONSES_ARRAY_BASE_SLOT,\n );\n\n CapsuleArray::at(contract_address, LOG_RETRIEVAL_RESPONSES_ARRAY_BASE_SLOT)\n}\n"
830
834
  },
@@ -832,15 +836,15 @@
832
836
  "path": "std/field/bn254.nr",
833
837
  "source": "use crate::field::field_less_than;\nuse crate::runtime::is_unconstrained;\n\n// The low and high decomposition of the field modulus\npub(crate) global PLO: Field = 53438638232309528389504892708671455233;\npub(crate) global PHI: Field = 64323764613183177041862057485226039389;\n\npub(crate) global TWO_POW_128: Field = 0x100000000000000000000000000000000;\n\n// Decomposes a single field into two 16 byte fields.\nfn compute_decomposition(x: Field) -> (Field, Field) {\n // Here's we're taking advantage of truncating 128 bit limbs from the input field\n // and then subtracting them from the input such the field division is equivalent to integer division.\n let low = (x as u128) as Field;\n let high = (x - low) / TWO_POW_128;\n\n (low, high)\n}\n\npub(crate) unconstrained fn decompose_hint(x: Field) -> (Field, Field) {\n compute_decomposition(x)\n}\n\nunconstrained fn lte_hint(x: Field, y: Field) -> bool {\n if x == y {\n true\n } else {\n field_less_than(x, y)\n }\n}\n\n// Assert that (alo > blo && ahi >= bhi) || (alo <= blo && ahi > bhi)\nfn assert_gt_limbs(a: (Field, Field), b: (Field, Field)) {\n let (alo, ahi) = a;\n let (blo, bhi) = b;\n // Safety: borrow is enforced to be boolean due to its type.\n // if borrow is 0, it asserts that (alo > blo && ahi >= bhi)\n // if borrow is 1, it asserts that (alo <= blo && ahi > bhi)\n unsafe {\n let borrow = lte_hint(alo, blo);\n\n let rlo = alo - blo - 1 + (borrow as Field) * TWO_POW_128;\n let rhi = ahi - bhi - (borrow as Field);\n\n rlo.assert_max_bit_size::<128>();\n rhi.assert_max_bit_size::<128>();\n }\n}\n\n/// Decompose a single field into two 16 byte fields.\npub fn decompose(x: Field) -> (Field, Field) {\n if is_unconstrained() {\n compute_decomposition(x)\n } else {\n // Safety: decomposition is properly checked below\n unsafe {\n // Take hints of the decomposition\n let (xlo, xhi) = decompose_hint(x);\n\n // Range check the limbs\n xlo.assert_max_bit_size::<128>();\n xhi.assert_max_bit_size::<128>();\n\n // Check that the decomposition is correct\n assert_eq(x, xlo + TWO_POW_128 * xhi);\n\n // Assert that the decomposition of P is greater than the decomposition of x\n assert_gt_limbs((PLO, PHI), (xlo, xhi));\n (xlo, xhi)\n }\n }\n}\n\npub fn assert_gt(a: Field, b: Field) {\n if is_unconstrained() {\n assert(\n // Safety: already unconstrained\n unsafe { field_less_than(b, a) },\n );\n } else {\n // Decompose a and b\n let a_limbs = decompose(a);\n let b_limbs = decompose(b);\n\n // Assert that a_limbs is greater than b_limbs\n assert_gt_limbs(a_limbs, b_limbs)\n }\n}\n\npub fn assert_lt(a: Field, b: Field) {\n assert_gt(b, a);\n}\n\npub fn gt(a: Field, b: Field) -> bool {\n if is_unconstrained() {\n // Safety: unsafe in unconstrained\n unsafe {\n field_less_than(b, a)\n }\n } else if a == b {\n false\n } else {\n // Safety: Take a hint of the comparison and verify it\n unsafe {\n if field_less_than(a, b) {\n assert_gt(b, a);\n false\n } else {\n assert_gt(a, b);\n true\n }\n }\n }\n}\n\npub fn lt(a: Field, b: Field) -> bool {\n gt(b, a)\n}\n\nmod tests {\n // TODO: Allow imports from \"super\"\n use crate::field::bn254::{assert_gt, decompose, gt, lt, lte_hint, PHI, PLO, TWO_POW_128};\n\n #[test]\n fn check_decompose() {\n assert_eq(decompose(TWO_POW_128), (0, 1));\n assert_eq(decompose(TWO_POW_128 + 0x1234567890), (0x1234567890, 1));\n assert_eq(decompose(0x1234567890), (0x1234567890, 0));\n }\n\n #[test]\n unconstrained fn check_lte_hint() {\n assert(lte_hint(0, 1));\n assert(lte_hint(0, 0x100));\n assert(lte_hint(0x100, TWO_POW_128 - 1));\n assert(!lte_hint(0 - 1, 0));\n\n assert(lte_hint(0, 0));\n assert(lte_hint(0x100, 0x100));\n assert(lte_hint(0 - 1, 0 - 1));\n }\n\n #[test]\n fn check_gt() {\n assert(gt(1, 0));\n assert(gt(0x100, 0));\n assert(gt((0 - 1), (0 - 2)));\n assert(gt(TWO_POW_128, 0));\n assert(!gt(0, 0));\n assert(!gt(0, 0x100));\n assert(gt(0 - 1, 0 - 2));\n assert(!gt(0 - 2, 0 - 1));\n assert_gt(0 - 1, 0);\n }\n\n #[test]\n fn check_plo_phi() {\n assert_eq(PLO + PHI * TWO_POW_128, 0);\n let p_bytes = crate::field::modulus_le_bytes();\n let mut p_low: Field = 0;\n let mut p_high: Field = 0;\n\n let mut offset = 1;\n for i in 0..16 {\n p_low += (p_bytes[i] as Field) * offset;\n p_high += (p_bytes[i + 16] as Field) * offset;\n offset *= 256;\n }\n assert_eq(p_low, PLO);\n assert_eq(p_high, PHI);\n }\n\n #[test]\n fn check_decompose_edge_cases() {\n assert_eq(decompose(0), (0, 0));\n assert_eq(decompose(TWO_POW_128 - 1), (TWO_POW_128 - 1, 0));\n assert_eq(decompose(TWO_POW_128 + 1), (1, 1));\n assert_eq(decompose(TWO_POW_128 * 2), (0, 2));\n assert_eq(decompose(TWO_POW_128 * 2 + 0x1234567890), (0x1234567890, 2));\n }\n\n #[test]\n fn check_decompose_large_values() {\n let large_field = 0xffffffffffffffff;\n let (lo, hi) = decompose(large_field);\n assert_eq(large_field, lo + TWO_POW_128 * hi);\n\n let large_value = large_field - TWO_POW_128;\n let (lo2, hi2) = decompose(large_value);\n assert_eq(large_value, lo2 + TWO_POW_128 * hi2);\n }\n\n #[test]\n fn check_lt_comprehensive() {\n assert(lt(0, 1));\n assert(!lt(1, 0));\n assert(!lt(0, 0));\n assert(!lt(42, 42));\n\n assert(lt(TWO_POW_128 - 1, TWO_POW_128));\n assert(!lt(TWO_POW_128, TWO_POW_128 - 1));\n }\n}\n"
834
838
  },
835
- "170": {
839
+ "173": {
836
840
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/avm.nr",
837
841
  "source": "//! AVM oracles.\n//!\n//! There are only available during public execution. Calling any of them from a private or utility function will\n//! result in runtime errors.\n\nuse crate::protocol::address::{AztecAddress, EthAddress};\n\npub unconstrained fn address() -> AztecAddress {\n address_opcode()\n}\npub unconstrained fn sender() -> AztecAddress {\n sender_opcode()\n}\npub unconstrained fn transaction_fee() -> Field {\n transaction_fee_opcode()\n}\npub unconstrained fn chain_id() -> Field {\n chain_id_opcode()\n}\npub unconstrained fn version() -> Field {\n version_opcode()\n}\npub unconstrained fn block_number() -> u32 {\n block_number_opcode()\n}\npub unconstrained fn timestamp() -> u64 {\n timestamp_opcode()\n}\npub unconstrained fn min_fee_per_l2_gas() -> u128 {\n min_fee_per_l2_gas_opcode()\n}\npub unconstrained fn min_fee_per_da_gas() -> u128 {\n min_fee_per_da_gas_opcode()\n}\npub unconstrained fn l2_gas_left() -> u32 {\n l2_gas_left_opcode()\n}\npub unconstrained fn da_gas_left() -> u32 {\n da_gas_left_opcode()\n}\npub unconstrained fn is_static_call() -> u1 {\n is_static_call_opcode()\n}\npub unconstrained fn note_hash_exists(note_hash: Field, leaf_index: u64) -> u1 {\n note_hash_exists_opcode(note_hash, leaf_index)\n}\npub unconstrained fn emit_note_hash(note_hash: Field) {\n emit_note_hash_opcode(note_hash)\n}\npub unconstrained fn nullifier_exists(siloed_nullifier: Field) -> u1 {\n nullifier_exists_opcode(siloed_nullifier)\n}\npub unconstrained fn emit_nullifier(nullifier: Field) {\n emit_nullifier_opcode(nullifier)\n}\npub unconstrained fn emit_public_log(message: [Field]) {\n emit_public_log_opcode(message)\n}\npub unconstrained fn l1_to_l2_msg_exists(msg_hash: Field, msg_leaf_index: u64) -> u1 {\n l1_to_l2_msg_exists_opcode(msg_hash, msg_leaf_index)\n}\npub unconstrained fn send_l2_to_l1_msg(recipient: EthAddress, content: Field) {\n send_l2_to_l1_msg_opcode(recipient, content)\n}\n\npub unconstrained fn call<let N: u32>(\n l2_gas_allocation: u32,\n da_gas_allocation: u32,\n address: AztecAddress,\n args: [Field; N],\n) {\n call_opcode(l2_gas_allocation, da_gas_allocation, address, N, args)\n}\n\npub unconstrained fn call_static<let N: u32>(\n l2_gas_allocation: u32,\n da_gas_allocation: u32,\n address: AztecAddress,\n args: [Field; N],\n) {\n call_static_opcode(l2_gas_allocation, da_gas_allocation, address, N, args)\n}\n\npub unconstrained fn calldata_copy<let N: u32>(cdoffset: u32, copy_size: u32) -> [Field; N] {\n calldata_copy_opcode(cdoffset, copy_size)\n}\n\n/// `success_copy` is placed immediately after the CALL opcode to get the success value\npub unconstrained fn success_copy() -> bool {\n success_copy_opcode()\n}\n\npub unconstrained fn returndata_size() -> u32 {\n returndata_size_opcode()\n}\n\npub unconstrained fn returndata_copy(rdoffset: u32, copy_size: u32) -> [Field] {\n returndata_copy_opcode(rdoffset, copy_size)\n}\n\n/// The additional prefix is to avoid clashing with the `return` Noir keyword.\npub unconstrained fn avm_return(returndata: [Field]) {\n return_opcode(returndata)\n}\n\n/// This opcode reverts using the exact data given. In general it should only be used to do rethrows, where the revert\n/// data is the same as the original revert data. For normal reverts, use Noir's `assert` which, on top of reverting,\n/// will also add an error selector to the revert data.\npub unconstrained fn revert(revertdata: [Field]) {\n revert_opcode(revertdata)\n}\n\npub unconstrained fn storage_read(storage_slot: Field, contract_address: Field) -> Field {\n storage_read_opcode(storage_slot, contract_address)\n}\n\npub unconstrained fn storage_write(storage_slot: Field, value: Field) {\n storage_write_opcode(storage_slot, value);\n}\n\n#[oracle(avmOpcodeAddress)]\nunconstrained fn address_opcode() -> AztecAddress {}\n\n#[oracle(avmOpcodeSender)]\nunconstrained fn sender_opcode() -> AztecAddress {}\n\n#[oracle(avmOpcodeTransactionFee)]\nunconstrained fn transaction_fee_opcode() -> Field {}\n\n#[oracle(avmOpcodeChainId)]\nunconstrained fn chain_id_opcode() -> Field {}\n\n#[oracle(avmOpcodeVersion)]\nunconstrained fn version_opcode() -> Field {}\n\n#[oracle(avmOpcodeBlockNumber)]\nunconstrained fn block_number_opcode() -> u32 {}\n\n#[oracle(avmOpcodeTimestamp)]\nunconstrained fn timestamp_opcode() -> u64 {}\n\n#[oracle(avmOpcodeMinFeePerL2Gas)]\nunconstrained fn min_fee_per_l2_gas_opcode() -> u128 {}\n\n#[oracle(avmOpcodeMinFeePerDaGas)]\nunconstrained fn min_fee_per_da_gas_opcode() -> u128 {}\n\n#[oracle(avmOpcodeL2GasLeft)]\nunconstrained fn l2_gas_left_opcode() -> u32 {}\n\n#[oracle(avmOpcodeDaGasLeft)]\nunconstrained fn da_gas_left_opcode() -> u32 {}\n\n#[oracle(avmOpcodeIsStaticCall)]\nunconstrained fn is_static_call_opcode() -> u1 {}\n\n#[oracle(avmOpcodeNoteHashExists)]\nunconstrained fn note_hash_exists_opcode(note_hash: Field, leaf_index: u64) -> u1 {}\n\n#[oracle(avmOpcodeEmitNoteHash)]\nunconstrained fn emit_note_hash_opcode(note_hash: Field) {}\n\n#[oracle(avmOpcodeNullifierExists)]\nunconstrained fn nullifier_exists_opcode(siloed_nullifier: Field) -> u1 {}\n\n#[oracle(avmOpcodeEmitNullifier)]\nunconstrained fn emit_nullifier_opcode(nullifier: Field) {}\n\n#[oracle(avmOpcodeEmitPublicLog)]\nunconstrained fn emit_public_log_opcode(message: [Field]) {}\n\n#[oracle(avmOpcodeL1ToL2MsgExists)]\nunconstrained fn l1_to_l2_msg_exists_opcode(msg_hash: Field, msg_leaf_index: u64) -> u1 {}\n\n#[oracle(avmOpcodeSendL2ToL1Msg)]\nunconstrained fn send_l2_to_l1_msg_opcode(recipient: EthAddress, content: Field) {}\n\n#[oracle(avmOpcodeCalldataCopy)]\nunconstrained fn calldata_copy_opcode<let N: u32>(cdoffset: u32, copy_size: u32) -> [Field; N] {}\n\n#[oracle(avmOpcodeReturndataSize)]\nunconstrained fn returndata_size_opcode() -> u32 {}\n\n#[oracle(avmOpcodeReturndataCopy)]\nunconstrained fn returndata_copy_opcode(rdoffset: u32, copy_size: u32) -> [Field] {}\n\n#[oracle(avmOpcodeReturn)]\nunconstrained fn return_opcode(returndata: [Field]) {}\n\n#[oracle(avmOpcodeRevert)]\nunconstrained fn revert_opcode(revertdata: [Field]) {}\n\n// While the length parameter might seem unnecessary given that we have N we keep it around because at the AVM bytecode\n// level, we want to support non-comptime-known lengths for such opcodes, even if Noir code will not generally take\n// that route.\n#[oracle(avmOpcodeCall)]\nunconstrained fn call_opcode<let N: u32>(\n l2_gas_allocation: u32,\n da_gas_allocation: u32,\n address: AztecAddress,\n length: u32,\n args: [Field; N],\n) {}\n\n// While the length parameter might seem unnecessary given that we have N we keep it around because at the AVM bytecode\n// level, we want to support non-comptime-known lengths for such opcodes, even if Noir code will not generally take\n// that route.\n#[oracle(avmOpcodeStaticCall)]\nunconstrained fn call_static_opcode<let N: u32>(\n l2_gas_allocation: u32,\n da_gas_allocation: u32,\n address: AztecAddress,\n length: u32,\n args: [Field; N],\n) {}\n\n#[oracle(avmOpcodeSuccessCopy)]\nunconstrained fn success_copy_opcode() -> bool {}\n\n#[oracle(avmOpcodeStorageRead)]\nunconstrained fn storage_read_opcode(storage_slot: Field, contract_address: Field) -> Field {}\n\n#[oracle(avmOpcodeStorageWrite)]\nunconstrained fn storage_write_opcode(storage_slot: Field, value: Field) {}\n"
838
842
  },
839
- "173": {
843
+ "176": {
840
844
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/capsules.nr",
841
845
  "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"
842
846
  },
843
- "175": {
847
+ "178": {
844
848
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/execution.nr",
845
849
  "source": "use crate::context::UtilityContext;\n\n#[oracle(utilityGetUtilityContext)]\nunconstrained fn get_utility_context_oracle() -> UtilityContext {}\n\n/// Returns a utility context built from the global variables of anchor block and the contract address of the function\n/// being executed.\npub unconstrained fn get_utility_context() -> UtilityContext {\n get_utility_context_oracle()\n}\n"
846
850
  },
@@ -848,7 +852,7 @@
848
852
  "path": "std/field/mod.nr",
849
853
  "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"
850
854
  },
851
- "185": {
855
+ "188": {
852
856
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/message_processing.nr",
853
857
  "source": "use crate::protocol::address::AztecAddress;\n\n/// Finds new private logs that may have been sent to all registered accounts in PXE in the current contract and makes\n/// them available for later processing in Noir by storing them in a capsule array.\npub unconstrained fn fetch_tagged_logs(pending_tagged_log_array_base_slot: Field) {\n fetch_tagged_logs_oracle(pending_tagged_log_array_base_slot);\n}\n\n#[oracle(utilityFetchTaggedLogs)]\nunconstrained fn fetch_tagged_logs_oracle(pending_tagged_log_array_base_slot: Field) {}\n\n// This must be a single oracle and not one for notes and one for events because the entire point is to validate all\n// notes and events in one go, minimizing node round-trips.\npub(crate) unconstrained fn validate_and_store_enqueued_notes_and_events(\n contract_address: AztecAddress,\n note_validation_requests_array_base_slot: Field,\n event_validation_requests_array_base_slot: Field,\n) {\n validate_and_store_enqueued_notes_and_events_oracle(\n contract_address,\n note_validation_requests_array_base_slot,\n event_validation_requests_array_base_slot,\n );\n}\n\n#[oracle(utilityValidateAndStoreEnqueuedNotesAndEvents)]\nunconstrained fn validate_and_store_enqueued_notes_and_events_oracle(\n contract_address: AztecAddress,\n note_validation_requests_array_base_slot: Field,\n event_validation_requests_array_base_slot: Field,\n) {}\n\npub(crate) unconstrained fn bulk_retrieve_logs(\n contract_address: AztecAddress,\n log_retrieval_requests_array_base_slot: Field,\n log_retrieval_responses_array_base_slot: Field,\n) {\n bulk_retrieve_logs_oracle(\n contract_address,\n log_retrieval_requests_array_base_slot,\n log_retrieval_responses_array_base_slot,\n );\n}\n\n#[oracle(utilityBulkRetrieveLogs)]\nunconstrained fn bulk_retrieve_logs_oracle(\n contract_address: AztecAddress,\n log_retrieval_requests_array_base_slot: Field,\n log_retrieval_responses_array_base_slot: Field,\n) {}\n"
854
858
  },
@@ -856,39 +860,39 @@
856
860
  "path": "std/hash/mod.nr",
857
861
  "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"
858
862
  },
859
- "191": {
863
+ "194": {
860
864
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/shared_secret.nr",
861
865
  "source": "use crate::protocol::{address::aztec_address::AztecAddress, point::Point};\n\n// TODO(#12656): return an app-siloed secret + document this\n#[oracle(utilityGetSharedSecret)]\nunconstrained fn get_shared_secret_oracle(address: AztecAddress, ephPk: Point) -> Point {}\n\n/// Returns an app-siloed shared secret between `address` and someone who knows the secret key behind an ephemeral\n/// public key `ephPk`. The app-siloing means that contracts cannot retrieve secrets that belong to other contracts,\n/// and therefore cannot e.g. decrypt their messages. This is an important security consideration given that both the\n/// `address` and `ephPk` are public information.\n///\n/// The shared secret `S` is computed as: `let S = (ivsk + h) * ephPk` where `ivsk + h` is the 'preaddress' i.e. the\n/// preimage of the address, also called the address secret. TODO(#12656): app-silo this secret\npub unconstrained fn get_shared_secret(address: AztecAddress, ephPk: Point) -> Point {\n get_shared_secret_oracle(address, ephPk)\n}\n"
862
866
  },
863
- "239": {
867
+ "242": {
864
868
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/append.nr",
865
869
  "source": "/// Appends the elements of the second `BoundedVec` to the end of the first one. The resulting `BoundedVec` can have\n/// any arbitrary maximum length, but it must be large enough to fit all of the elements of both the first and second\n/// vectors.\npub fn append<T, let ALen: u32, let BLen: u32, let DstLen: u32>(\n a: BoundedVec<T, ALen>,\n b: BoundedVec<T, BLen>,\n) -> BoundedVec<T, DstLen> {\n let mut dst = BoundedVec::new();\n\n dst.extend_from_bounded_vec(a);\n dst.extend_from_bounded_vec(b);\n\n dst\n}\n\nmod test {\n use super::append;\n\n #[test]\n unconstrained fn append_empty_vecs() {\n let a: BoundedVec<_, 3> = BoundedVec::new();\n let b: BoundedVec<_, 14> = BoundedVec::new();\n\n let result: BoundedVec<Field, 5> = append(a, b);\n\n assert_eq(result.len(), 0);\n assert_eq(result.storage(), std::mem::zeroed());\n }\n\n #[test]\n unconstrained fn append_non_empty_vecs() {\n let a: BoundedVec<_, 3> = BoundedVec::from_array([1, 2, 3]);\n let b: BoundedVec<_, 14> = BoundedVec::from_array([4, 5, 6]);\n\n let result: BoundedVec<Field, 8> = append(a, b);\n\n assert_eq(result.len(), 6);\n assert_eq(result.storage(), [1, 2, 3, 4, 5, 6, std::mem::zeroed(), std::mem::zeroed()]);\n }\n\n #[test(should_fail_with = \"out of bounds\")]\n unconstrained fn append_non_empty_vecs_insufficient_max_len() {\n let a: BoundedVec<_, 3> = BoundedVec::from_array([1, 2, 3]);\n let b: BoundedVec<_, 14> = BoundedVec::from_array([4, 5, 6]);\n\n let _: BoundedVec<Field, 5> = append(a, b);\n }\n}\n"
866
870
  },
867
- "242": {
871
+ "245": {
868
872
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/subarray.nr",
869
873
  "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"
870
874
  },
871
- "243": {
875
+ "246": {
872
876
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/subbvec.nr",
873
877
  "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"
874
878
  },
875
- "245": {
879
+ "248": {
876
880
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/comparison.nr",
877
881
  "source": "struct ComparatorEnum {\n pub EQ: u8,\n pub NEQ: u8,\n pub LT: u8,\n pub LTE: u8,\n pub GT: u8,\n pub GTE: u8,\n}\n\npub global Comparator: ComparatorEnum = ComparatorEnum { EQ: 1, NEQ: 2, LT: 3, LTE: 4, GT: 5, GTE: 6 };\n\npub fn compare(lhs: Field, operation: u8, rhs: Field) -> bool {\n // Values are computed ahead of time because circuits evaluate all branches\n let is_equal = lhs == rhs;\n let is_lt = lhs.lt(rhs);\n\n if (operation == Comparator.EQ) {\n is_equal\n } else if (operation == Comparator.NEQ) {\n !is_equal\n } else if (operation == Comparator.LT) {\n is_lt\n } else if (operation == Comparator.LTE) {\n is_lt | is_equal\n } else if (operation == Comparator.GT) {\n !is_lt & !is_equal\n } else if (operation == Comparator.GTE) {\n !is_lt\n } else {\n panic(f\"Invalid operation\")\n }\n}\n\nmod test {\n use super::Comparator;\n use super::compare;\n\n #[test]\n unconstrained fn test_compare() {\n let lhs = 10;\n let rhs = 10;\n assert(compare(lhs, Comparator.EQ, rhs), \"Expected lhs to be equal to rhs\");\n\n let lhs = 10;\n let rhs = 11;\n assert(compare(lhs, Comparator.NEQ, rhs), \"Expected lhs to be not equal to rhs\");\n\n let lhs = 10;\n let rhs = 11;\n assert(compare(lhs, Comparator.LT, rhs), \"Expected lhs to be less than rhs\");\n\n let lhs = 10;\n let rhs = 10;\n assert(compare(lhs, Comparator.LTE, rhs), \"Expected lhs to be less than or equal to rhs\");\n\n let lhs = 11;\n let rhs = 10;\n assert(compare(lhs, Comparator.GT, rhs), \"Expected lhs to be greater than rhs\");\n\n let lhs = 10;\n let rhs = 10;\n assert(compare(lhs, Comparator.GTE, rhs), \"Expected lhs to be greater than or equal to rhs\");\n\n let lhs = 11;\n let rhs = 10;\n assert(compare(lhs, Comparator.GTE, rhs), \"Expected lhs to be greater than or equal to rhs\");\n\n let lhs = 10;\n let rhs = 11;\n assert(!compare(lhs, Comparator.EQ, rhs), \"Expected lhs to be not equal to rhs\");\n\n let lhs = 10;\n let rhs = 10;\n assert(!compare(lhs, Comparator.NEQ, rhs), \"Expected lhs to not be not equal to rhs\");\n\n let lhs = 11;\n let rhs = 10;\n assert(!compare(lhs, Comparator.LT, rhs), \"Expected lhs to not be less than rhs\");\n\n let lhs = 11;\n let rhs = 10;\n assert(!compare(lhs, Comparator.LTE, rhs), \"Expected lhs to not be less than or equal to rhs\");\n\n let lhs = 10;\n let rhs = 10;\n assert(!compare(lhs, Comparator.GT, rhs), \"Expected lhs to not be greater than rhs\");\n\n let lhs = 10;\n let rhs = 11;\n assert(!compare(lhs, Comparator.GTE, rhs), \"Expected lhs to not be greater than or equal to rhs\");\n\n let lhs = 10;\n let rhs = 11;\n assert(!compare(lhs, Comparator.GTE, rhs), \"Expected lhs to not be greater than or equal to rhs\");\n }\n}\n"
878
882
  },
879
- "246": {
883
+ "249": {
880
884
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/conversion/bytes_to_fields.nr",
881
885
  "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"
882
886
  },
883
- "247": {
887
+ "250": {
884
888
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/conversion/fields_to_bytes.nr",
885
889
  "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"
886
890
  },
887
- "250": {
891
+ "253": {
888
892
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/point.nr",
889
893
  "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"
890
894
  },
891
- "261": {
895
+ "264": {
892
896
  "path": "/home/aztec-dev/nargo/github.com/noir-lang/poseidon/v0.2.3/src/poseidon2.nr",
893
897
  "source": "use std::default::Default;\nuse std::hash::Hasher;\n\ncomptime global RATE: u32 = 3;\n\npub struct Poseidon2 {\n cache: [Field; 3],\n state: [Field; 4],\n cache_size: u32,\n squeeze_mode: bool, // 0 => absorb, 1 => squeeze\n}\n\nimpl Poseidon2 {\n #[no_predicates]\n pub fn hash<let N: u32>(input: [Field; N], message_size: u32) -> Field {\n Poseidon2::hash_internal(input, message_size)\n }\n\n pub(crate) fn new(iv: Field) -> Poseidon2 {\n let mut result =\n Poseidon2 { cache: [0; 3], state: [0; 4], cache_size: 0, squeeze_mode: false };\n result.state[RATE] = iv;\n result\n }\n\n fn perform_duplex(&mut self) {\n // add the cache into sponge state\n self.state[0] += self.cache[0];\n self.state[1] += self.cache[1];\n self.state[2] += self.cache[2];\n self.state = crate::poseidon2_permutation(self.state, 4);\n }\n\n fn absorb(&mut self, input: Field) {\n assert(!self.squeeze_mode);\n if self.cache_size == RATE {\n // If we're absorbing, and the cache is full, apply the sponge permutation to compress the cache\n self.perform_duplex();\n self.cache[0] = input;\n self.cache_size = 1;\n } else {\n // If we're absorbing, and the cache is not full, add the input into the cache\n self.cache[self.cache_size] = input;\n self.cache_size += 1;\n }\n }\n\n fn squeeze(&mut self) -> Field {\n assert(!self.squeeze_mode);\n // If we're in absorb mode, apply sponge permutation to compress the cache.\n self.perform_duplex();\n self.squeeze_mode = true;\n\n // Pop one item off the top of the permutation and return it.\n self.state[0]\n }\n\n fn hash_internal<let N: u32>(input: [Field; N], in_len: u32) -> Field {\n let two_pow_64 = 18446744073709551616;\n let iv: Field = (in_len as Field) * two_pow_64;\n let mut state = [0; 4];\n state[RATE] = iv;\n\n if std::runtime::is_unconstrained() {\n for i in 0..(in_len / RATE) {\n state[0] += input[i * RATE];\n state[1] += input[i * RATE + 1];\n state[2] += input[i * RATE + 2];\n state = crate::poseidon2_permutation(state, 4);\n }\n\n // handle remaining elements after last full RATE-sized chunk\n let num_extra_fields = in_len % RATE;\n if num_extra_fields != 0 {\n let remainder_start = in_len - num_extra_fields;\n state[0] += input[remainder_start];\n if num_extra_fields > 1 {\n state[1] += input[remainder_start + 1]\n }\n }\n } else {\n let mut states: [[Field; 4]; N / RATE + 1] = [[0; 4]; N / RATE + 1];\n states[0] = state;\n\n // process all full RATE-sized chunks, storing state after each permutation\n for chunk_idx in 0..(N / RATE) {\n for i in 0..RATE {\n state[i] += input[chunk_idx * RATE + i];\n }\n state = crate::poseidon2_permutation(state, 4);\n states[chunk_idx + 1] = state;\n }\n\n // get state at the last full block before in_len\n let first_partially_filled_chunk = in_len / RATE;\n state = states[first_partially_filled_chunk];\n\n // handle remaining elements after last full RATE-sized chunk\n let remainder_start = (in_len / RATE) * RATE;\n for j in 0..RATE {\n let idx = remainder_start + j;\n if idx < in_len {\n state[j] += input[idx];\n }\n }\n }\n\n // always run final permutation unless we just completed a full chunk\n // still need to permute once if in_len is 0\n if (in_len == 0) | (in_len % RATE != 0) {\n state = crate::poseidon2_permutation(state, 4)\n };\n\n state[0]\n }\n}\n\npub struct Poseidon2Hasher {\n _state: [Field],\n}\n\nimpl Hasher for Poseidon2Hasher {\n fn finish(self) -> Field {\n let iv: Field = (self._state.len() as Field) * 18446744073709551616; // iv = (self._state.len() << 64)\n let mut sponge = Poseidon2::new(iv);\n for i in 0..self._state.len() {\n sponge.absorb(self._state[i]);\n }\n sponge.squeeze()\n }\n\n fn write(&mut self, input: Field) {\n self._state = self._state.push_back(input);\n }\n}\n\nimpl Default for Poseidon2Hasher {\n fn default() -> Self {\n Poseidon2Hasher { _state: &[] }\n }\n}\n"
894
898
  },
@@ -896,39 +900,39 @@
896
900
  "path": "std/array/mod.nr",
897
901
  "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"
898
902
  },
899
- "350": {
903
+ "353": {
900
904
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/hash.nr",
901
905
  "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"
902
906
  },
903
- "352": {
907
+ "355": {
904
908
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/logging.nr",
905
909
  "source": "// Log levels matching the JS logger:\n\n// global SILENT_LOG_LEVEL: u8 = 0;\nglobal FATAL_LOG_LEVEL: u8 = 1;\nglobal ERROR_LOG_LEVEL: u8 = 2;\nglobal WARN_LOG_LEVEL: u8 = 3;\nglobal INFO_LOG_LEVEL: u8 = 4;\nglobal VERBOSE_LOG_LEVEL: u8 = 5;\nglobal DEBUG_LOG_LEVEL: u8 = 6;\nglobal TRACE_LOG_LEVEL: u8 = 7;\n\n// --- Per-level log functions (no format args) ---\n\npub fn fatal_log<let N: u32>(msg: str<N>) {\n fatal_log_format(msg, []);\n}\n\npub fn error_log<let N: u32>(msg: str<N>) {\n error_log_format(msg, []);\n}\n\npub fn warn_log<let N: u32>(msg: str<N>) {\n warn_log_format(msg, []);\n}\n\npub fn info_log<let N: u32>(msg: str<N>) {\n info_log_format(msg, []);\n}\n\npub fn verbose_log<let N: u32>(msg: str<N>) {\n verbose_log_format(msg, []);\n}\n\npub fn debug_log<let N: u32>(msg: str<N>) {\n debug_log_format(msg, []);\n}\n\npub fn trace_log<let N: u32>(msg: str<N>) {\n trace_log_format(msg, []);\n}\n\n// --- Per-level log functions (with format args) ---\n\npub fn fatal_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n log_format(FATAL_LOG_LEVEL, msg, args);\n}\n\npub fn error_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n log_format(ERROR_LOG_LEVEL, msg, args);\n}\n\npub fn warn_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n log_format(WARN_LOG_LEVEL, msg, args);\n}\n\npub fn info_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n log_format(INFO_LOG_LEVEL, msg, args);\n}\n\npub fn verbose_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n log_format(VERBOSE_LOG_LEVEL, msg, args);\n}\n\npub fn debug_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n log_format(DEBUG_LOG_LEVEL, msg, args);\n}\n\npub fn trace_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n log_format(TRACE_LOG_LEVEL, msg, args);\n}\n\nfn log_format<let M: u32, let N: u32>(log_level: u8, msg: str<M>, args: [Field; N]) {\n // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n // to call.\n unsafe { log_oracle_wrapper(log_level, msg, args) };\n}\n\nunconstrained fn log_oracle_wrapper<let M: u32, let N: u32>(\n log_level: u8,\n msg: str<M>,\n args: [Field; N],\n) {\n log_oracle(log_level, msg, N, args);\n}\n\n#[oracle(utilityLog)]\nunconstrained fn log_oracle<let M: u32, let N: u32>(\n log_level: u8,\n msg: str<M>,\n length: u32,\n args: [Field; N],\n) {}\n"
906
910
  },
907
- "367": {
911
+ "370": {
908
912
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/poseidon2.nr",
909
913
  "source": "use crate::constants::TWO_POW_64;\nuse crate::traits::{Deserialize, Serialize};\nuse std::meta::derive;\n// NB: This is a clone of noir/noir-repo/noir_stdlib/src/hash/poseidon2.nr\n// It exists as we sometimes need to perform custom absorption, but the stdlib version\n// has a private absorb() method (it's also designed to just be a hasher)\n// Can be removed when standalone noir poseidon lib exists: See noir#6679\n\ncomptime global RATE: u32 = 3;\n\n#[derive(Deserialize, Eq, Serialize)]\npub struct Poseidon2Sponge {\n pub cache: [Field; 3],\n pub state: [Field; 4],\n pub cache_size: u32,\n pub squeeze_mode: bool, // 0 => absorb, 1 => squeeze\n}\n\nimpl Poseidon2Sponge {\n #[no_predicates]\n pub fn hash<let N: u32>(input: [Field; N], message_size: u32) -> Field {\n Poseidon2Sponge::hash_internal(input, message_size, message_size != N)\n }\n\n pub(crate) fn new(iv: Field) -> Poseidon2Sponge {\n let mut result =\n Poseidon2Sponge { cache: [0; 3], state: [0; 4], cache_size: 0, squeeze_mode: false };\n result.state[RATE] = iv;\n result\n }\n\n fn perform_duplex(&mut self) {\n // add the cache into sponge state\n for i in 0..RATE {\n // We effectively zero-pad the cache by only adding to the state\n // cache that is less than the specified `cache_size`\n if i < self.cache_size {\n self.state[i] += self.cache[i];\n }\n }\n self.state = std::hash::poseidon2_permutation(self.state, 4);\n }\n\n pub fn absorb(&mut self, input: Field) {\n assert(!self.squeeze_mode);\n if self.cache_size == RATE {\n // If we're absorbing, and the cache is full, apply the sponge permutation to compress the cache\n self.perform_duplex();\n self.cache[0] = input;\n self.cache_size = 1;\n } else {\n // If we're absorbing, and the cache is not full, add the input into the cache\n self.cache[self.cache_size] = input;\n self.cache_size += 1;\n }\n }\n\n pub fn squeeze(&mut self) -> Field {\n assert(!self.squeeze_mode);\n // If we're in absorb mode, apply sponge permutation to compress the cache.\n self.perform_duplex();\n self.squeeze_mode = true;\n\n // Pop one item off the top of the permutation and return it.\n self.state[0]\n }\n\n fn hash_internal<let N: u32>(\n input: [Field; N],\n in_len: u32,\n is_variable_length: bool,\n ) -> Field {\n let iv: Field = (in_len as Field) * TWO_POW_64;\n let mut sponge = Poseidon2Sponge::new(iv);\n for i in 0..input.len() {\n if i < in_len {\n sponge.absorb(input[i]);\n }\n }\n\n sponge.squeeze()\n }\n}\n"
910
914
  },
911
- "395": {
915
+ "398": {
912
916
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/traits.nr",
913
917
  "source": "use crate::meta::derive_packable;\nuse crate::utils::field::field_from_bytes;\n\npub use serde::serialization::{Deserialize, Serialize};\n\n// Trait: is_empty\n//\n// The general is_empty trait checks if a data type is is empty,\n// and it defines empty for the basic data types as 0.\n//\n// If a Field is equal to zero, then it is regarded as zero.\n// We will go with this definition for now, however it can be problematic\n// if a value can actually be zero. In a future refactor, we can\n// use the optional type for safety. Doing it now would lead to a worse devex\n// and would make it harder to sync up with the cpp code.\n// Preferred over Default trait to convey intent, as default doesn't necessarily mean empty.\npub trait Empty: Eq {\n fn empty() -> Self;\n\n fn is_empty(self) -> bool {\n self.eq(Self::empty())\n }\n\n // Requires this Noir fix: https://github.com/noir-lang/noir/issues/9002\n // fn assert_not_empty<let U: u32>(self, msg: str<U>) { // This msg version was failing with weird compiler errors.\n // // We provide a default impl but it's likely inefficient.\n // // The reason we include this function is because there's a lot of\n // // opportunity for optimisation on a per-struct basis.\n // // You only need to show one element is not empty to know that the whole thing\n // // is not empty.\n // // If you know an element of your struct which should always be nonempty,\n // // you can write an impl that solely checks that that element is nonempty.\n // assert(!self.is_empty(), msg);\n // }\n\n // This default impl is overwritten by types like arrays, because there's a much\n // more efficient approach.\n fn assert_empty<let S: u32>(self, msg: str<S>) {\n assert(self.is_empty(), msg);\n }\n}\n\nimpl Empty for Field {\n #[inline_always]\n fn empty() -> Self {\n 0\n }\n}\n\nimpl Empty for bool {\n #[inline_always]\n fn empty() -> Self {\n false\n }\n}\n\nimpl Empty for u1 {\n #[inline_always]\n fn empty() -> Self {\n 0\n }\n}\nimpl Empty for u8 {\n #[inline_always]\n fn empty() -> Self {\n 0\n }\n}\nimpl Empty for u16 {\n fn empty() -> Self {\n 0\n }\n}\nimpl Empty for u32 {\n #[inline_always]\n fn empty() -> Self {\n 0\n }\n}\nimpl Empty for u64 {\n #[inline_always]\n fn empty() -> Self {\n 0\n }\n}\nimpl Empty for u128 {\n #[inline_always]\n fn empty() -> Self {\n 0\n }\n}\n\nimpl<T, let N: u32> Empty for [T; N]\nwhere\n T: Empty,\n{\n #[inline_always]\n fn empty() -> Self {\n [T::empty(); N]\n }\n\n fn is_empty(self) -> bool {\n self.all(|elem| elem.is_empty())\n }\n\n fn assert_empty<let S: u32>(self, msg: str<S>) -> () {\n self.for_each(|elem| elem.assert_empty(msg))\n }\n}\n\nimpl<T> Empty for [T]\nwhere\n T: Empty,\n{\n #[inline_always]\n fn empty() -> Self {\n [T::empty()]\n }\n\n fn is_empty(self) -> bool {\n self.all(|elem| elem.is_empty())\n }\n\n fn assert_empty<let S: u32>(self, msg: str<S>) -> () {\n self.for_each(|elem| elem.assert_empty(msg))\n }\n}\nimpl<A, B> Empty for (A, B)\nwhere\n A: Empty,\n B: Empty,\n{\n #[inline_always]\n fn empty() -> Self {\n (A::empty(), B::empty())\n }\n}\n\nimpl<T> Empty for Option<T>\nwhere\n T: Eq,\n{\n #[inline_always]\n fn empty() -> Self {\n Option::none()\n }\n}\n\n// pub fn is_empty<T>(item: T) -> bool\n// where\n// T: Empty,\n// {\n// item.eq(T::empty())\n// }\n\n// pub fn is_empty_array<T, let N: u32>(array: [T; N]) -> bool\n// where\n// T: Empty,\n// {\n// array.all(|elem| is_empty(elem))\n// }\n\n// pub fn assert_empty<T>(item: T) -> ()\n// where\n// T: Empty,\n// {\n// assert(item.eq(T::empty()))\n// }\n\n// pub fn assert_empty_array<T, let N: u32>(array: [T; N]) -> ()\n// where\n// T: Empty,\n// {\n// // A cheaper option than `is_empty_array` for if you don't need to gracefully\n// // handle a bool result.\n// // Avoids the `&` operator of `is_empty_array`'s `.all()` call.\n// for i in 0..N {\n// assert(is_empty(array[i]));\n// }\n// }\n\npub trait Hash {\n fn hash(self) -> Field;\n}\n\npub trait ToField {\n fn to_field(self) -> Field;\n}\n\nimpl ToField for Field {\n #[inline_always]\n fn to_field(self) -> Field {\n self\n }\n}\n\nimpl ToField for bool {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u1 {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u8 {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u16 {\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u32 {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u64 {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u128 {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl<let N: u32> ToField for str<N> {\n #[inline_always]\n fn to_field(self) -> Field {\n assert(N < 32, \"String doesn't fit in a field, consider using Serialize instead\");\n field_from_bytes(self.as_bytes(), true)\n }\n}\n\npub trait FromField {\n fn from_field(value: Field) -> Self;\n}\n\nimpl FromField for Field {\n #[inline_always]\n fn from_field(value: Field) -> Self {\n value\n }\n}\n\nimpl FromField for bool {\n #[inline_always]\n fn from_field(value: Field) -> Self {\n value != 0\n }\n}\nimpl FromField for u1 {\n #[inline_always]\n fn from_field(value: Field) -> Self {\n value as u1\n }\n}\nimpl FromField for u8 {\n #[inline_always]\n fn from_field(value: Field) -> Self {\n value as u8\n }\n}\nimpl FromField for u16 {\n fn from_field(value: Field) -> Self {\n value as u16\n }\n}\nimpl FromField for u32 {\n #[inline_always]\n fn from_field(value: Field) -> Self {\n value as u32\n }\n}\nimpl FromField for u64 {\n #[inline_always]\n fn from_field(value: Field) -> Self {\n value as u64\n }\n}\nimpl FromField for u128 {\n #[inline_always]\n fn from_field(value: Field) -> Self {\n value as u128\n }\n}\n\n/// Trait for efficiently packing and unpacking Noir types into and from arrays of Fields.\n///\n/// The `Packable` trait allows types to be serialized and deserialized with a focus on minimizing the size of\n/// the resulting Field array. This trait is used when storage efficiency is critical (e.g. when storing data\n/// in the contract's public storage).\n///\n/// # Associated Constants\n/// * `N` - The length of the Field array, known at compile time\n#[derive_via(derive_packable)]\npub trait Packable {\n let N: u32;\n\n /// Packs the current value into a compact array of `Field` elements.\n fn pack(self) -> [Field; N];\n\n /// Unpacks a compact array of `Field` elements into the original value.\n fn unpack(fields: [Field; N]) -> Self;\n}\n\n#[test]\nunconstrained fn bounded_vec_serialization() {\n // Test empty BoundedVec\n let empty_vec: BoundedVec<Field, 3> = BoundedVec::from_array([]);\n let serialized = empty_vec.serialize();\n let deserialized = BoundedVec::<Field, 3>::deserialize(serialized);\n assert_eq(empty_vec, deserialized);\n assert_eq(deserialized.len(), 0);\n\n // Test partially filled BoundedVec\n let partial_vec: BoundedVec<[u32; 2], 3> = BoundedVec::from_array([[1, 2]]);\n let serialized = partial_vec.serialize();\n let deserialized = BoundedVec::<[u32; 2], 3>::deserialize(serialized);\n assert_eq(partial_vec, deserialized);\n assert_eq(deserialized.len(), 1);\n assert_eq(deserialized.get(0), [1, 2]);\n\n // Test full BoundedVec\n let full_vec: BoundedVec<[u32; 2], 3> = BoundedVec::from_array([[1, 2], [3, 4], [5, 6]]);\n let serialized = full_vec.serialize();\n let deserialized = BoundedVec::<[u32; 2], 3>::deserialize(serialized);\n assert_eq(full_vec, deserialized);\n assert_eq(deserialized.len(), 3);\n assert_eq(deserialized.get(0), [1, 2]);\n assert_eq(deserialized.get(1), [3, 4]);\n assert_eq(deserialized.get(2), [5, 6]);\n}\n"
914
918
  },
915
- "403": {
919
+ "406": {
916
920
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/utils/field.nr",
917
921
  "source": "pub fn field_from_bytes<let N: u32>(bytes: [u8; N], big_endian: bool) -> Field {\n assert(bytes.len() < 32, \"field_from_bytes: N must be less than 32\");\n let mut as_field = 0;\n let mut offset = 1;\n for i in 0..N {\n let mut index = i;\n if big_endian {\n index = N - i - 1;\n }\n as_field += (bytes[index] as Field) * offset;\n offset *= 256;\n }\n\n as_field\n}\n\n// Convert a 32 byte array to a field element by truncating the final byte\npub fn field_from_bytes_32_trunc(bytes32: [u8; 32]) -> Field {\n // Convert it to a field element\n let mut v = 1;\n let mut high = 0 as Field;\n let mut low = 0 as Field;\n\n for i in 0..15 {\n // covers bytes 16..30 (31 is truncated and ignored)\n low = low + (bytes32[15 + 15 - i] as Field) * v;\n v = v * 256;\n // covers bytes 0..14\n high = high + (bytes32[14 - i] as Field) * v;\n }\n // covers byte 15\n low = low + (bytes32[15] as Field) * v;\n\n low + high * v\n}\n\n// TODO to radix returns u8, so we cannot use bigger radixes. It'd be ideal to use a radix of the maximum range-constrained integer noir supports\npub fn full_field_less_than(lhs: Field, rhs: Field) -> bool {\n lhs.lt(rhs)\n}\n\npub fn full_field_greater_than(lhs: Field, rhs: Field) -> bool {\n rhs.lt(lhs)\n}\n\npub fn min(f1: Field, f2: Field) -> Field {\n if f1.lt(f2) {\n f1\n } else {\n f2\n }\n}\n\n// TODO: write doc-comments and tests for these magic constants.\n\nglobal KNOWN_NON_RESIDUE: Field = 5; // This is a non-residue in Noir's native Field.\nglobal C1: u32 = 28;\nglobal C3: Field = 40770029410420498293352137776570907027550720424234931066070132305055;\nglobal C5: Field = 19103219067921713944291392827692070036145651957329286315305642004821462161904;\n\n// @dev: only use this for _huge_ exponents y, when writing a constrained function.\n// If you're only exponentiating by a small value, first consider writing-out the multiplications by hand.\n// Only after you've measured the gates of that approach, consider using the native Field::pow_32 function.\n// Only if your exponent is larger than 32 bits, resort to using this function.\npub fn pow(x: Field, y: Field) -> Field {\n let mut r = 1 as Field;\n let b: [u1; 254] = y.to_le_bits();\n\n for i in 0..254 {\n r *= r;\n r *= (b[254 - 1 - i] as Field) * x + (1 - b[254 - 1 - i] as Field);\n }\n\n r\n}\n\n/// Returns Option::some(sqrt) if there is a square root, and Option::none() if there isn't.\npub fn sqrt(x: Field) -> Option<Field> {\n // Safety: if the hint returns the square root of x, then we simply square it\n // check the result equals x. If x is not square, we return a value that\n // enables us to prove that fact (see the `else` clause below).\n let (is_sq, maybe_sqrt) = unsafe { __sqrt(x) };\n\n if is_sq {\n let sqrt = maybe_sqrt;\n validate_sqrt_hint(x, sqrt);\n Option::some(sqrt)\n } else {\n let not_sqrt_hint = maybe_sqrt;\n validate_not_sqrt_hint(x, not_sqrt_hint);\n Option::none()\n }\n}\n\n// Boolean indicating whether Field element is a square, i.e. whether there exists a y in Field s.t. x = y*y.\nunconstrained fn is_square(x: Field) -> bool {\n let v = pow(x, -1 / 2);\n v * (v - 1) == 0\n}\n\n// Tonelli-Shanks algorithm for computing the square root of a Field element.\n// Requires C1 = max{c: 2^c divides (p-1)}, where p is the order of Field\n// as well as C3 = (C2 - 1)/2, where C2 = (p-1)/(2^c1),\n// and C5 = ZETA^C2, where ZETA is a non-square element of Field.\n// These are pre-computed above as globals.\nunconstrained fn tonelli_shanks_sqrt(x: Field) -> Field {\n let mut z = pow(x, C3);\n let mut t = z * z * x;\n z *= x;\n let mut b = t;\n let mut c = C5;\n\n for i in 0..(C1 - 1) {\n for _j in 1..(C1 - i - 1) {\n b *= b;\n }\n\n z *= if b == 1 { 1 } else { c };\n\n c *= c;\n\n t *= if b == 1 { 1 } else { c };\n\n b = t;\n }\n\n z\n}\n\n// NB: this doesn't return an option, because in the case of there _not_ being a square root, we still want to return a field element that allows us to then assert in the _constrained_ sqrt function that there is no sqrt.\nunconstrained fn __sqrt(x: Field) -> (bool, Field) {\n let is_sq = is_square(x);\n if is_sq {\n let sqrt = tonelli_shanks_sqrt(x);\n (true, sqrt)\n } else {\n // Demonstrate that x is not a square (a.k.a. a \"quadratic non-residue\").\n // Facts:\n // The Legendre symbol (\"LS\") of x, is x^((p-1)/2) (mod p).\n // - If x is a square, LS(x) = 1\n // - If x is not a square, LS(x) = -1\n // - If x = 0, LS(x) = 0.\n //\n // Hence:\n // sq * sq = sq // 1 * 1 = 1\n // non-sq * non-sq = sq // -1 * -1 = 1\n // sq * non-sq = non-sq // -1 * 1 = -1\n //\n // See: https://en.wikipedia.org/wiki/Legendre_symbol\n let demo_x_not_square = x * KNOWN_NON_RESIDUE;\n let not_sqrt = tonelli_shanks_sqrt(demo_x_not_square);\n (false, not_sqrt)\n }\n}\n\nfn validate_sqrt_hint(x: Field, hint: Field) {\n assert(hint * hint == x, f\"The claimed_sqrt {hint} is not the sqrt of x {x}\");\n}\n\nfn validate_not_sqrt_hint(x: Field, hint: Field) {\n // We need this assertion, because x = 0 would pass the other assertions in this\n // function, and we don't want people to be able to prove that 0 is not square!\n assert(x != 0, \"0 has a square root; you cannot claim it is not square\");\n // Demonstrate that x is not a square (a.k.a. a \"quadratic non-residue\").\n //\n // Facts:\n // The Legendre symbol (\"LS\") of x, is x^((p-1)/2) (mod p).\n // - If x is a square, LS(x) = 1\n // - If x is not a square, LS(x) = -1\n // - If x = 0, LS(x) = 0.\n //\n // Hence:\n // 1. sq * sq = sq // 1 * 1 = 1\n // 2. non-sq * non-sq = sq // -1 * -1 = 1\n // 3. sq * non-sq = non-sq // -1 * 1 = -1\n //\n // See: https://en.wikipedia.org/wiki/Legendre_symbol\n //\n // We want to demonstrate that this below multiplication falls under bullet-point (2):\n let demo_x_not_square = x * KNOWN_NON_RESIDUE;\n // I.e. we want to demonstrate that `demo_x_not_square` has Legendre symbol 1\n // (i.e. that it is a square), so we prove that it is square below.\n // Why do we want to prove that it has LS 1?\n // Well, since it was computed with a known-non-residue, its squareness implies we're\n // in case 2 (something multiplied by a known-non-residue yielding a result which\n // has a LS of 1), which implies that x must be a non-square. The unconstrained\n // function gave us the sqrt of demo_x_not_square, so all we need to do is\n // assert its squareness:\n assert(\n hint * hint == demo_x_not_square,\n f\"The hint {hint} does not demonstrate that {x} is not a square\",\n );\n}\n\n#[test]\nunconstrained fn bytes_field_test() {\n // Tests correctness of field_from_bytes_32_trunc against existing methods\n // Bytes representing 0x543e0a6642ffeb8039296861765a53407bba62bd1c97ca43374de950bbe0a7\n let inputs = [\n 84, 62, 10, 102, 66, 255, 235, 128, 57, 41, 104, 97, 118, 90, 83, 64, 123, 186, 98, 189, 28,\n 151, 202, 67, 55, 77, 233, 80, 187, 224, 167,\n ];\n let field = field_from_bytes(inputs, true);\n let return_bytes: [u8; 31] = field.to_be_bytes();\n assert_eq(inputs, return_bytes);\n // 32 bytes - we remove the final byte, and check it matches the field\n let inputs2 = [\n 84, 62, 10, 102, 66, 255, 235, 128, 57, 41, 104, 97, 118, 90, 83, 64, 123, 186, 98, 189, 28,\n 151, 202, 67, 55, 77, 233, 80, 187, 224, 167, 158,\n ];\n let field2 = field_from_bytes_32_trunc(inputs2);\n let return_bytes2: [u8; 31] = field2.to_be_bytes();\n\n assert_eq(return_bytes2, return_bytes);\n assert_eq(field2, field);\n}\n\n#[test]\nunconstrained fn max_field_test() {\n // Tests the hardcoded value in constants.nr vs underlying modulus\n // NB: We can't use 0-1 in constants.nr as it will be transpiled incorrectly to ts and sol constants files\n let max_value = crate::constants::MAX_FIELD_VALUE;\n assert_eq(max_value, 0 - 1);\n // modulus == 0 is tested elsewhere, so below is more of a sanity check\n let max_bytes: [u8; 32] = max_value.to_be_bytes();\n let mod_bytes = std::field::modulus_be_bytes();\n for i in 0..31 {\n assert_eq(max_bytes[i], mod_bytes[i]);\n }\n assert_eq(max_bytes[31], mod_bytes[31] - 1);\n}\n\n#[test]\nunconstrained fn sqrt_valid_test() {\n let x = 16; // examples: 16, 9, 25, 81\n let result = sqrt(x);\n assert(result.is_some());\n assert_eq(result.unwrap() * result.unwrap(), x);\n}\n\n#[test]\nunconstrained fn sqrt_invalid_test() {\n let x = KNOWN_NON_RESIDUE; // has no square root in the field\n let result = sqrt(x);\n assert(result.is_none());\n}\n\n#[test]\nunconstrained fn sqrt_zero_test() {\n let result = sqrt(0);\n assert(result.is_some());\n assert_eq(result.unwrap(), 0);\n}\n\n#[test]\nunconstrained fn sqrt_one_test() {\n let result = sqrt(1);\n assert(result.is_some());\n assert_eq(result.unwrap() * result.unwrap(), 1);\n}\n\n#[test]\nunconstrained fn field_from_bytes_empty_test() {\n let empty: [u8; 0] = [];\n let result = field_from_bytes(empty, true);\n assert_eq(result, 0);\n\n let result_le = field_from_bytes(empty, false);\n assert_eq(result_le, 0);\n}\n\n#[test]\nunconstrained fn field_from_bytes_little_endian_test() {\n // Test little-endian conversion: [0x01, 0x02] should be 0x0201 = 513\n let bytes = [0x01, 0x02];\n let result_le = field_from_bytes(bytes, false);\n assert_eq(result_le, 0x0201);\n\n // Compare with big-endian: [0x01, 0x02] should be 0x0102 = 258\n let result_be = field_from_bytes(bytes, true);\n assert_eq(result_be, 0x0102);\n}\n\n#[test]\nunconstrained fn pow_test() {\n assert_eq(pow(2, 0), 1);\n assert_eq(pow(2, 1), 2);\n assert_eq(pow(2, 10), 1024);\n assert_eq(pow(3, 5), 243);\n assert_eq(pow(0, 5), 0);\n assert_eq(pow(1, 100), 1);\n}\n\n#[test]\nunconstrained fn min_test() {\n assert_eq(min(5, 10), 5);\n assert_eq(min(10, 5), 5);\n assert_eq(min(7, 7), 7);\n assert_eq(min(0, 1), 0);\n}\n\n#[test]\nunconstrained fn full_field_comparison_test() {\n assert(full_field_less_than(5, 10));\n assert(!full_field_less_than(10, 5));\n assert(!full_field_less_than(5, 5));\n\n assert(full_field_greater_than(10, 5));\n assert(!full_field_greater_than(5, 10));\n assert(!full_field_greater_than(5, 5));\n}\n\n#[test]\nunconstrained fn sqrt_has_two_roots_test() {\n // Every square has two roots: r and -r (i.e., p - r)\n // sqrt(16) can return 4 or -4\n let x = 16;\n let result = sqrt(x).unwrap();\n assert(result * result == x);\n // The other root is -result\n let other_root = 0 - result;\n assert(other_root * other_root == x);\n // Verify they are different (unless x = 0)\n assert(result != other_root);\n\n // Same for 9: roots are 3 and -3\n let y = 9;\n let result_y = sqrt(y).unwrap();\n assert(result_y * result_y == y);\n let other_root_y = 0 - result_y;\n assert(other_root_y * other_root_y == y);\n assert(result_y != other_root_y);\n}\n\n#[test]\nunconstrained fn sqrt_negative_one_test() {\n let x = 0 - 1;\n let result = sqrt(x);\n assert(result.unwrap() == 0x30644e72e131a029048b6e193fd841045cea24f6fd736bec231204708f703636);\n}\n\n#[test]\nunconstrained fn validate_sqrt_hint_valid_test() {\n // 4 is a valid sqrt of 16\n validate_sqrt_hint(16, 4);\n // -4 is also a valid sqrt of 16\n validate_sqrt_hint(16, 0 - 4);\n // 0 is a valid sqrt of 0\n validate_sqrt_hint(0, 0);\n // 1 is a valid sqrt of 1\n validate_sqrt_hint(1, 1);\n // -1 is also a valid sqrt of 1\n validate_sqrt_hint(1, 0 - 1);\n}\n\n#[test(should_fail_with = \"is not the sqrt of x\")]\nunconstrained fn validate_sqrt_hint_invalid_test() {\n // 5 is not a valid sqrt of 16\n validate_sqrt_hint(16, 5);\n}\n\n#[test]\nunconstrained fn validate_not_sqrt_hint_valid_test() {\n // 5 (KNOWN_NON_RESIDUE) is not a square.\n let x = KNOWN_NON_RESIDUE;\n let hint = tonelli_shanks_sqrt(x * KNOWN_NON_RESIDUE);\n validate_not_sqrt_hint(x, hint);\n}\n\n#[test(should_fail_with = \"0 has a square root\")]\nunconstrained fn validate_not_sqrt_hint_zero_test() {\n // 0 has a square root, so we cannot claim it is not square\n validate_not_sqrt_hint(0, 0);\n}\n\n#[test(should_fail_with = \"does not demonstrate that\")]\nunconstrained fn validate_not_sqrt_hint_wrong_hint_test() {\n // Provide a wrong hint for a non-square\n let x = KNOWN_NON_RESIDUE;\n validate_not_sqrt_hint(x, 123);\n}\n"
918
922
  },
919
- "409": {
923
+ "412": {
920
924
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/serde/src/reader.nr",
921
925
  "source": "pub struct Reader<let N: u32> {\n data: [Field; N],\n offset: u32,\n}\n\nimpl<let N: u32> Reader<N> {\n pub fn new(data: [Field; N]) -> Self {\n Self { data, offset: 0 }\n }\n\n pub fn read(&mut self) -> Field {\n let result = self.data[self.offset];\n self.offset += 1;\n result\n }\n\n pub fn read_u32(&mut self) -> u32 {\n self.read() as u32\n }\n\n pub fn read_u64(&mut self) -> u64 {\n self.read() as u64\n }\n\n pub fn read_bool(&mut self) -> bool {\n self.read() != 0\n }\n\n pub fn read_array<let K: u32>(&mut self) -> [Field; K] {\n let mut result = [0; K];\n for i in 0..K {\n result[i] = self.data[self.offset + i];\n }\n self.offset += K;\n result\n }\n\n pub fn read_struct<T, let K: u32>(&mut self, deserialise: fn([Field; K]) -> T) -> T {\n let result = deserialise(self.read_array());\n result\n }\n\n pub fn read_struct_array<T, let K: u32, let C: u32>(\n &mut self,\n deserialise: fn([Field; K]) -> T,\n mut result: [T; C],\n ) -> [T; C] {\n for i in 0..C {\n result[i] = self.read_struct(deserialise);\n }\n result\n }\n\n pub fn peek_offset(&mut self, offset: u32) -> Field {\n self.data[self.offset + offset]\n }\n\n pub fn advance_offset(&mut self, offset: u32) {\n self.offset += offset;\n }\n\n pub fn finish(self) {\n assert_eq(self.offset, self.data.len(), \"Reader did not read all data\");\n }\n}\n"
922
926
  },
923
- "410": {
927
+ "413": {
924
928
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/serde/src/serialization.nr",
925
929
  "source": "use crate::{reader::Reader, writer::Writer};\n\n// docs:start:serialize\n/// Trait for serializing Noir types into arrays of Fields.\n///\n/// An implementation of the Serialize trait has to follow Noir's intrinsic serialization (each member of a struct\n/// converted directly into one or more Fields without any packing or compression). This trait (and Deserialize) are\n/// typically used to communicate between Noir and TypeScript (via oracles and function arguments).\n///\n/// # On Following Noir's Intrinsic Serialization\n/// When calling a Noir function from TypeScript (TS), first the function arguments are serialized into an array\n/// of fields. This array is then included in the initial witness. Noir's intrinsic serialization is then used\n/// to deserialize the arguments from the witness. When the same Noir function is called from Noir this Serialize trait\n/// is used instead of the serialization in TS. For this reason we need to have a match between TS serialization,\n/// Noir's intrinsic serialization and the implementation of this trait. If there is a mismatch, the function calls\n/// fail with an arguments hash mismatch error message.\n///\n/// # Associated Constants\n/// * `N` - The length of the output Field array, known at compile time\n///\n/// # Example\n/// ```\n/// impl<let N: u32> Serialize for str<N> {\n/// let N: u32 = N;\n///\n/// fn serialize(self) -> [Field; Self::N] {\n/// let mut writer: Writer<Self::N> = Writer::new();\n/// self.stream_serialize(&mut writer);\n/// writer.finish()\n/// }\n///\n/// fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n/// let bytes = self.as_bytes();\n/// for i in 0..bytes.len() {\n/// writer.write(bytes[i] as Field);\n/// }\n/// }\n/// }\n/// ```\n#[derive_via(derive_serialize)]\npub trait Serialize {\n let N: u32;\n\n fn serialize(self) -> [Field; Self::N];\n\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>);\n}\n\n/// Generates a `Serialize` trait implementation for a struct type.\n///\n/// # Parameters\n/// - `s`: The struct type definition to generate the implementation for\n///\n/// # Returns\n/// A quoted code block containing the trait implementation\n///\n/// # Example\n/// For a struct defined as:\n/// ```\n/// struct Log<N> {\n/// fields: [Field; N],\n/// length: u32\n/// }\n/// ```\n///\n/// This function generates code equivalent to:\n/// ```\n/// impl<let N: u32> Serialize for Log<N> {\n/// let N: u32 = <[Field; N] as Serialize>::N + <u32 as Serialize>::N;\n///\n/// fn serialize(self) -> [Field; Self::N] {\n/// let mut writer: Writer<Self::N> = Writer::new();\n/// self.stream_serialize(&mut writer);\n/// writer.finish()\n/// }\n///\n/// #[inline_always]\n/// fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n/// Serialize::stream_serialize(self.fields, writer);\n/// Serialize::stream_serialize(self.length, writer);\n/// }\n/// }\n/// ```\npub comptime fn derive_serialize(s: TypeDefinition) -> Quoted {\n let typ = s.as_type();\n let nested_struct = typ.as_data_type().unwrap();\n\n // We care only about the name and type so we drop the last item of the tuple\n let params = nested_struct.0.fields(nested_struct.1).map(|(name, typ, _)| (name, typ));\n\n // Generates the generic parameter declarations (to be placed after the `impl` keyword) and the `where` clause\n // for the `Serialize` trait.\n let generics_declarations = get_generics_declarations(s);\n let where_serialize_clause = get_where_trait_clause(s, quote {Serialize});\n\n let params_len_quote = get_params_len_quote(params);\n\n let function_body = params\n .map(|(name, _typ): (Quoted, Type)| {\n quote {\n $crate::serialization::Serialize::stream_serialize(self.$name, writer);\n }\n })\n .join(quote {});\n\n quote {\n impl$generics_declarations $crate::serialization::Serialize for $typ\n $where_serialize_clause\n {\n let N: u32 = $params_len_quote;\n\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: $crate::writer::Writer<Self::N> = $crate::writer::Writer::new();\n $crate::serialization::Serialize::stream_serialize(self, &mut writer);\n writer.finish()\n }\n\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut $crate::writer::Writer<K>) {\n $function_body\n }\n }\n }\n}\n\n// docs:start:deserialize\n/// Trait for deserializing Noir types from arrays of Fields.\n///\n/// An implementation of the Deserialize trait has to follow Noir's intrinsic serialization (each member of a struct\n/// converted directly into one or more Fields without any packing or compression). This trait is typically used when\n/// deserializing return values from function calls in Noir. Since the same function could be called from TypeScript\n/// (TS), in which case the TS deserialization would get used, we need to have a match between the 2.\n///\n/// # Associated Constants\n/// * `N` - The length of the input Field array, known at compile time\n///\n/// # Example\n/// ```\n/// impl<let M: u32> Deserialize for str<M> {\n/// let N: u32 = M;\n///\n/// fn deserialize(fields: [Field; Self::N]) -> Self {\n/// let mut reader = Reader::new(fields);\n/// let result = Self::stream_deserialize(&mut reader);\n/// reader.finish();\n/// result\n/// }\n///\n/// fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n/// let mut bytes = [0 as u8; M];\n/// for i in 0..M {\n/// bytes[i] = reader.read() as u8;\n/// }\n/// str::<M>::from(bytes)\n/// }\n/// }\n/// ```\n#[derive_via(derive_deserialize)]\npub trait Deserialize {\n let N: u32;\n\n fn deserialize(fields: [Field; Self::N]) -> Self;\n\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self;\n}\n\n/// Generates a `Deserialize` trait implementation for a given struct `s`.\n///\n/// # Arguments\n/// * `s` - The struct type definition to generate the implementation for\n///\n/// # Returns\n/// A `Quoted` block containing the generated trait implementation\n///\n/// # Requirements\n/// Each struct member type must implement the `Deserialize` trait (it gets used in the generated code).\n///\n/// # Example\n/// For a struct like:\n/// ```\n/// struct MyStruct {\n/// x: AztecAddress,\n/// y: Field,\n/// }\n/// ```\n///\n/// This generates:\n/// ```\n/// impl Deserialize for MyStruct {\n/// let N: u32 = <AztecAddress as Deserialize>::N + <Field as Deserialize>::N;\n///\n/// fn deserialize(fields: [Field; Self::N]) -> Self {\n/// let mut reader = Reader::new(fields);\n/// let result = Self::stream_deserialize(&mut reader);\n/// reader.finish();\n/// result\n/// }\n///\n/// #[inline_always]\n/// fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n/// let x = <AztecAddress as Deserialize>::stream_deserialize(reader);\n/// let y = <Field as Deserialize>::stream_deserialize(reader);\n/// Self { x, y }\n/// }\n/// }\n/// ```\npub comptime fn derive_deserialize(s: TypeDefinition) -> Quoted {\n let typ = s.as_type();\n let nested_struct = typ.as_data_type().unwrap();\n let params = nested_struct.0.fields(nested_struct.1);\n\n // Generates the generic parameter declarations (to be placed after the `impl` keyword) and the `where` clause\n // for the `Deserialize` trait.\n let generics_declarations = get_generics_declarations(s);\n let where_deserialize_clause = get_where_trait_clause(s, quote {Deserialize});\n\n // The following will give us:\n // <type_of_struct_member_1 as Deserialize>::N + <type_of_struct_member_2 as Deserialize>::N + ...\n // (or 0 if the struct has no members)\n let right_hand_side_of_definition_of_n = if params.len() > 0 {\n params\n .map(|(_, param_type, _): (Quoted, Type, Quoted)| {\n quote {\n <$param_type as $crate::serialization::Deserialize>::N\n }\n })\n .join(quote {+})\n } else {\n quote {0}\n };\n\n // For structs containing a single member, we can enhance performance by directly deserializing the input array,\n // bypassing the need for loop-based array construction. While this optimization yields significant benefits in\n // Brillig where the loops are expected to not be optimized, it is not relevant in ACIR where the loops are\n // expected to be optimized away.\n let function_body = if params.len() > 1 {\n // This generates deserialization code for each struct member and concatenates them together.\n let deserialization_of_struct_members = params\n .map(|(param_name, param_type, _): (Quoted, Type, Quoted)| {\n quote {\n let $param_name = <$param_type as Deserialize>::stream_deserialize(reader);\n }\n })\n .join(quote {});\n\n // We join the struct member names with a comma to be used in the `Self { ... }` syntax\n // This will give us e.g. `a, b, c` for a struct with three fields named `a`, `b`, and `c`.\n let struct_members = params\n .map(|(param_name, _, _): (Quoted, Type, Quoted)| quote { $param_name })\n .join(quote {,});\n\n quote {\n $deserialization_of_struct_members\n\n Self { $struct_members }\n }\n } else if params.len() == 1 {\n let param_name = params[0].0;\n quote {\n Self { $param_name: $crate::serialization::Deserialize::stream_deserialize(reader) }\n }\n } else {\n quote {\n Self {}\n }\n };\n\n quote {\n impl$generics_declarations $crate::serialization::Deserialize for $typ\n $where_deserialize_clause\n {\n let N: u32 = $right_hand_side_of_definition_of_n;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = $crate::reader::Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut $crate::reader::Reader<K>) -> Self {\n $function_body\n }\n }\n }\n}\n\n/// Generates a quoted expression that computes the total serialized length of function parameters.\n///\n/// # Parameters\n/// * `params` - An array of tuples where each tuple contains a quoted parameter name and its Type. The type needs\n/// to implement the Serialize trait.\n///\n/// # Returns\n/// A quoted expression that evaluates to:\n/// * `0` if there are no parameters\n/// * `(<type1 as Serialize>::N + <type2 as Serialize>::N + ...)` for one or more parameters\ncomptime fn get_params_len_quote(params: [(Quoted, Type)]) -> Quoted {\n if params.len() == 0 {\n quote { 0 }\n } else {\n let params_quote_without_parentheses = params\n .map(|(_, param_type): (Quoted, Type)| {\n quote {\n <$param_type as $crate::serialization::Serialize>::N\n }\n })\n .join(quote {+});\n quote { ($params_quote_without_parentheses) }\n }\n}\n\ncomptime fn get_generics_declarations(s: TypeDefinition) -> Quoted {\n let generics = s.generics();\n\n if generics.len() > 0 {\n let generics_declarations_items = generics\n .map(|(name, maybe_integer_typ)| {\n // The second item in the generics tuple is an Option of an integer type that is Some only if\n // the generic is numeric.\n if maybe_integer_typ.is_some() {\n // The generic is numeric, so we return a quote defined as e.g. \"let N: u32\"\n let integer_type = maybe_integer_typ.unwrap();\n quote {let $name: $integer_type}\n } else {\n // The generic is not numeric, so we return a quote containing the name of the generic (e.g. \"T\")\n quote {$name}\n }\n })\n .join(quote {,});\n quote {<$generics_declarations_items>}\n } else {\n // The struct doesn't have any generics defined, so we just return an empty quote.\n quote {}\n }\n}\n\ncomptime fn get_where_trait_clause(s: TypeDefinition, trait_name: Quoted) -> Quoted {\n let generics = s.generics();\n\n // The second item in the generics tuple is an Option of an integer type that is Some only if the generic is\n // numeric.\n let non_numeric_generics =\n generics.filter(|(_, maybe_integer_typ)| maybe_integer_typ.is_none());\n\n if non_numeric_generics.len() > 0 {\n let non_numeric_generics_declarations =\n non_numeric_generics.map(|(name, _)| quote {$name: $trait_name}).join(quote {,});\n quote {where $non_numeric_generics_declarations}\n } else {\n // There are no non-numeric generics, so we return an empty quote.\n quote {}\n }\n}\n"
926
930
  },
927
- "412": {
931
+ "415": {
928
932
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/serde/src/type_impls.nr",
929
933
  "source": "use crate::{reader::Reader, serialization::{Deserialize, Serialize}, writer::Writer};\nuse std::embedded_curve_ops::EmbeddedCurvePoint;\nuse std::embedded_curve_ops::EmbeddedCurveScalar;\n\nglobal U1_SERIALIZED_LEN: u32 = 1;\nglobal BOOL_SERIALIZED_LEN: u32 = 1;\nglobal U8_SERIALIZED_LEN: u32 = 1;\nglobal U16_SERIALIZED_LEN: u32 = 1;\nglobal U32_SERIALIZED_LEN: u32 = 1;\nglobal U64_SERIALIZED_LEN: u32 = 1;\nglobal U128_SERIALIZED_LEN: u32 = 1;\nglobal FIELD_SERIALIZED_LEN: u32 = 1;\nglobal I8_SERIALIZED_LEN: u32 = 1;\nglobal I16_SERIALIZED_LEN: u32 = 1;\nglobal I32_SERIALIZED_LEN: u32 = 1;\nglobal I64_SERIALIZED_LEN: u32 = 1;\n\nimpl Serialize for bool {\n let N: u32 = BOOL_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as Field);\n }\n}\n\nimpl Deserialize for bool {\n let N: u32 = BOOL_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> bool {\n reader.read() != 0\n }\n}\n\nimpl Serialize for u1 {\n let N: u32 = U1_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as Field);\n }\n}\n\nimpl Deserialize for u1 {\n let N: u32 = U1_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u1\n }\n}\n\nimpl Serialize for u8 {\n let N: u32 = U8_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as Field);\n }\n}\n\nimpl Deserialize for u8 {\n let N: u32 = U8_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u8\n }\n}\n\nimpl Serialize for u16 {\n let N: u32 = U16_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as Field);\n }\n}\n\nimpl Deserialize for u16 {\n let N: u32 = U16_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u16\n }\n}\n\nimpl Serialize for u32 {\n let N: u32 = U32_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as Field);\n }\n}\n\nimpl Deserialize for u32 {\n let N: u32 = U32_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u32\n }\n}\n\nimpl Serialize for u64 {\n let N: u32 = U64_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as Field);\n }\n}\n\nimpl Deserialize for u64 {\n let N: u32 = U64_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u64\n }\n}\n\nimpl Serialize for u128 {\n let N: u32 = U128_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as Field);\n }\n}\n\nimpl Deserialize for u128 {\n let N: u32 = U128_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u128\n }\n}\n\nimpl Serialize for Field {\n let N: u32 = FIELD_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self);\n }\n}\n\nimpl Deserialize for Field {\n let N: u32 = FIELD_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read()\n }\n}\n\nimpl Serialize for i8 {\n let N: u32 = I8_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as u8 as Field);\n }\n}\n\nimpl Deserialize for i8 {\n let N: u32 = I8_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u8 as i8\n }\n}\n\nimpl Serialize for i16 {\n let N: u32 = I16_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as u16 as Field);\n }\n}\n\nimpl Deserialize for i16 {\n let N: u32 = I16_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u16 as i16\n }\n}\n\nimpl Serialize for i32 {\n let N: u32 = I32_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as u32 as Field);\n }\n}\n\nimpl Deserialize for i32 {\n let N: u32 = I32_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u32 as i32\n }\n}\n\nimpl Serialize for i64 {\n let N: u32 = I64_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as u64 as Field);\n }\n}\n\nimpl Deserialize for i64 {\n let N: u32 = I64_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u64 as i64\n }\n}\n\nimpl<T, let M: u32> Serialize for [T; M]\nwhere\n T: Serialize,\n{\n let N: u32 = <T as Serialize>::N * M;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n for i in 0..M {\n self[i].stream_serialize(writer);\n }\n }\n}\n\nimpl<T, let M: u32> Deserialize for [T; M]\nwhere\n T: Deserialize,\n{\n let N: u32 = <T as Deserialize>::N * M;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n let mut result: [T; M] = std::mem::zeroed();\n for i in 0..M {\n result[i] = T::stream_deserialize(reader);\n }\n result\n }\n}\n\nimpl<T> Serialize for Option<T>\nwhere\n T: Serialize,\n{\n let N: u32 = <T as Serialize>::N + 1;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write_bool(self.is_some());\n if self.is_some() {\n self.unwrap_unchecked().stream_serialize(writer);\n } else {\n writer.advance_offset(<T as Serialize>::N);\n }\n }\n}\n\nimpl<T> Deserialize for Option<T>\nwhere\n T: Deserialize,\n{\n let N: u32 = <T as Deserialize>::N + 1;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n if reader.read_bool() {\n Option::some(<T as Deserialize>::stream_deserialize(reader))\n } else {\n reader.advance_offset(<T as Deserialize>::N);\n Option::none()\n }\n }\n}\n\nglobal SCALAR_SIZE: u32 = 2;\n\nimpl Serialize for EmbeddedCurveScalar {\n\n let N: u32 = SCALAR_SIZE;\n\n fn serialize(self) -> [Field; SCALAR_SIZE] {\n [self.lo, self.hi]\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self.lo);\n writer.write(self.hi);\n }\n}\n\nimpl Deserialize for EmbeddedCurveScalar {\n let N: u32 = SCALAR_SIZE;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n Self { lo: fields[0], hi: fields[1] }\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n Self { lo: reader.read(), hi: reader.read() }\n }\n}\n\nglobal POINT_SIZE: u32 = 3;\n\nimpl Serialize for EmbeddedCurvePoint {\n let N: u32 = POINT_SIZE;\n\n fn serialize(self) -> [Field; Self::N] {\n [self.x, self.y, self.is_infinite as Field]\n }\n\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self.x);\n writer.write(self.y);\n writer.write(self.is_infinite as Field);\n }\n}\n\nimpl Deserialize for EmbeddedCurvePoint {\n let N: u32 = POINT_SIZE;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n Self { x: fields[0], y: fields[1], is_infinite: fields[2] != 0 }\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n Self { x: reader.read(), y: reader.read(), is_infinite: reader.read_bool() }\n }\n}\n\nimpl<let M: u32> Deserialize for str<M> {\n let N: u32 = M;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n let u8_arr = <[u8; Self::N] as Deserialize>::stream_deserialize(reader);\n str::<Self::N>::from(u8_arr)\n }\n}\n\nimpl<let M: u32> Serialize for str<M> {\n let N: u32 = M;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n self.as_bytes().stream_serialize(writer);\n }\n}\n\n// Note: Not deriving this because it's not supported to call derive_serialize on a \"remote\" struct (and it will never\n// be supported).\nimpl<T, let M: u32> Deserialize for BoundedVec<T, M>\nwhere\n T: Deserialize,\n{\n let N: u32 = <T as Deserialize>::N * M + 1;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n let mut new_bounded_vec: BoundedVec<T, M> = BoundedVec::new();\n let payload_len = Self::N - 1;\n\n // Length is stored in the last field as we need to match intrinsic Noir serialization and the `len` struct\n // field is after `storage` struct field (see `bounded_vec.nr` in noir-stdlib)\n let len = reader.peek_offset(payload_len) as u32;\n\n for i in 0..M {\n if i < len {\n new_bounded_vec.push(<T as Deserialize>::stream_deserialize(reader));\n }\n }\n\n // +1 for the length of the BoundedVec\n reader.advance_offset((M - len) * <T as Deserialize>::N + 1);\n\n new_bounded_vec\n }\n}\n\n// This may cause issues if used as program input, because noir disallows empty arrays for program input.\n// I think this is okay because I don't foresee a unit type being used as input. But leaving this comment as a hint\n// if someone does run into this in the future.\nimpl Deserialize for () {\n let N: u32 = 0;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(_reader: &mut Reader<K>) -> Self {\n ()\n }\n}\n\n// Note: Not deriving this because it's not supported to call derive_serialize on a \"remote\" struct (and it will never\n// be supported).\nimpl<T, let M: u32> Serialize for BoundedVec<T, M>\nwhere\n T: Serialize,\n{\n let N: u32 = <T as Serialize>::N * M + 1; // +1 for the length of the BoundedVec\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n self.storage().stream_serialize(writer);\n // Length is stored in the last field as we need to match intrinsic Noir serialization and the `len` struct\n // field is after `storage` struct field (see `bounded_vec.nr` in noir-stdlib)\n writer.write_u32(self.len() as u32);\n }\n}\n\n// Create a slice of the given length with each element made from `f(i)` where `i` is the current index\ncomptime fn make_slice<Env, T>(length: u32, f: fn[Env](u32) -> T) -> [T] {\n let mut slice = @[];\n for i in 0..length {\n slice = slice.push_back(f(i));\n }\n slice\n}\n\n// Implements Serialize and Deserialize for an arbitrary tuple type\ncomptime fn impl_serialize_for_tuple(_m: Module, length: u32) -> Quoted {\n // `T0`, `T1`, `T2`\n let type_names = make_slice(length, |i| f\"T{i}\".quoted_contents());\n\n // `result0`, `result1`, `result2`\n let result_names = make_slice(length, |i| f\"result{i}\".quoted_contents());\n\n // `T0, T1, T2`\n let field_generics = type_names.join(quote [,]);\n\n // `<T0 as Serialize>::N + <T1 as Serialize>::N + <T2 as Serialize>::N`\n let full_size_serialize = type_names\n .map(|type_name| quote {\n <$type_name as Serialize>::N\n })\n .join(quote [+]);\n\n // `<T0 as Deserialize>::N + <T1 as Deserialize>::N + <T2 as Deserialize>::N`\n let full_size_deserialize = type_names\n .map(|type_name| quote {\n <$type_name as Deserialize>::N\n })\n .join(quote [+]);\n\n // `T0: Serialize, T1: Serialize, T2: Serialize,`\n let serialize_constraints = type_names\n .map(|field_name| quote {\n $field_name: Serialize,\n })\n .join(quote []);\n\n // `T0: Deserialize, T1: Deserialize, T2: Deserialize,`\n let deserialize_constraints = type_names\n .map(|field_name| quote {\n $field_name: Deserialize,\n })\n .join(quote []);\n\n // Statements to serialize each field\n let serialized_fields = type_names\n .mapi(|i, _type_name| quote {\n $crate::serialization::Serialize::stream_serialize(self.$i, writer);\n })\n .join(quote []);\n\n // Statements to deserialize each field\n let deserialized_fields = type_names\n .mapi(|i, type_name| {\n let result_name = result_names[i];\n quote {\n let $result_name = <$type_name as $crate::serialization::Deserialize>::stream_deserialize(reader);\n }\n })\n .join(quote []);\n let deserialize_results = result_names.join(quote [,]);\n\n quote {\n impl<$field_generics> Serialize for ($field_generics) where $serialize_constraints {\n let N: u32 = $full_size_serialize;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: $crate::writer::Writer<Self::N> = $crate::writer::Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut $crate::writer::Writer<K>) {\n\n $serialized_fields\n }\n }\n\n impl<$field_generics> Deserialize for ($field_generics) where $deserialize_constraints {\n let N: u32 = $full_size_deserialize;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = $crate::reader::Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n \n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut $crate::reader::Reader<K>) -> Self {\n $deserialized_fields\n ($deserialize_results)\n }\n }\n }\n}\n\n// Keeping these manual impls. They are more efficient since they do not\n// require copying sub-arrays from any serialized arrays.\nimpl<T1> Serialize for (T1,)\nwhere\n T1: Serialize,\n{\n let N: u32 = <T1 as Serialize>::N;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: crate::writer::Writer<Self::N> = crate::writer::Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n self.0.stream_serialize(writer);\n }\n}\n\nimpl<T1> Deserialize for (T1,)\nwhere\n T1: Deserialize,\n{\n let N: u32 = <T1 as Deserialize>::N;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = crate::reader::Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n (<T1 as Deserialize>::stream_deserialize(reader),)\n }\n}\n\n#[impl_serialize_for_tuple(2)]\n#[impl_serialize_for_tuple(3)]\n#[impl_serialize_for_tuple(4)]\n#[impl_serialize_for_tuple(5)]\n#[impl_serialize_for_tuple(6)]\nmod impls {\n use crate::serialization::{Deserialize, Serialize};\n}\n"
930
934
  },
931
- "413": {
935
+ "416": {
932
936
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/serde/src/writer.nr",
933
937
  "source": "pub struct Writer<let N: u32> {\n data: [Field; N],\n offset: u32,\n}\n\nimpl<let N: u32> Writer<N> {\n pub fn new() -> Self {\n Self { data: [0; N], offset: 0 }\n }\n\n pub fn write(&mut self, value: Field) {\n self.data[self.offset] = value;\n self.offset += 1;\n }\n\n pub fn write_u32(&mut self, value: u32) {\n self.write(value as Field);\n }\n\n pub fn write_u64(&mut self, value: u64) {\n self.write(value as Field);\n }\n\n pub fn write_bool(&mut self, value: bool) {\n self.write(value as Field);\n }\n\n pub fn write_array<let K: u32>(&mut self, value: [Field; K]) {\n for i in 0..K {\n self.data[i + self.offset] = value[i];\n }\n self.offset += K;\n }\n\n pub fn write_struct<T, let K: u32>(&mut self, value: T, serialize: fn(T) -> [Field; K]) {\n self.write_array(serialize(value));\n }\n\n pub fn write_struct_array<T, let K: u32, let C: u32>(\n &mut self,\n value: [T; C],\n serialize: fn(T) -> [Field; K],\n ) {\n for i in 0..C {\n self.write_struct(value[i], serialize);\n }\n }\n\n pub fn advance_offset(&mut self, offset: u32) {\n self.offset += offset;\n }\n\n pub fn finish(self) -> [Field; N] {\n assert_eq(self.offset, self.data.len(), \"Writer did not write all data\");\n self.data\n }\n}\n"
934
938
  },
@@ -960,21 +964,17 @@
960
964
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/utility_context.nr",
961
965
  "source": "use crate::oracle::{execution::get_utility_context, storage::storage_read};\nuse crate::protocol::{abis::block_header::BlockHeader, address::AztecAddress, traits::Packable};\n\n// If you'll modify this struct don't forget to update utility_context.ts as well.\npub struct UtilityContext {\n block_header: BlockHeader,\n contract_address: AztecAddress,\n}\n\nimpl UtilityContext {\n pub unconstrained fn new() -> Self {\n get_utility_context()\n }\n\n pub unconstrained fn at(contract_address: AztecAddress) -> Self {\n // We get a context with default contract address, and then we construct the final context with the provided\n // contract address.\n let default_context = get_utility_context();\n\n Self { block_header: default_context.block_header, contract_address }\n }\n\n pub fn block_header(self) -> BlockHeader {\n self.block_header\n }\n\n pub fn block_number(self) -> u32 {\n self.block_header.block_number()\n }\n\n pub fn timestamp(self) -> u64 {\n self.block_header.timestamp()\n }\n\n pub fn this_address(self) -> AztecAddress {\n self.contract_address\n }\n\n pub fn version(self) -> Field {\n self.block_header.version()\n }\n\n pub fn chain_id(self) -> Field {\n self.block_header.chain_id()\n }\n\n pub unconstrained fn raw_storage_read<let N: u32>(self: Self, storage_slot: Field) -> [Field; N] {\n storage_read(self.block_header, self.this_address(), storage_slot)\n }\n\n pub unconstrained fn storage_read<T>(self, storage_slot: Field) -> T\n where\n T: Packable,\n {\n T::unpack(self.raw_storage_read(storage_slot))\n }\n}\n"
962
966
  },
963
- "76": {
964
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/contract_self.nr",
965
- "source": "//! The `self` contract value.\n\nuse crate::{\n context::{\n calls::{PrivateCall, PrivateStaticCall, PublicCall, PublicStaticCall},\n PrivateContext,\n PublicContext,\n UtilityContext,\n },\n event::{\n event_emission::{emit_event_in_private, emit_event_in_public},\n event_interface::EventInterface,\n EventMessage,\n },\n};\nuse crate::protocol::{address::AztecAddress, traits::{Deserialize, Serialize}};\n\n/// Core interface for interacting with aztec-nr contract features.\n///\n/// This struct is automatically injected into every [`external`](crate::macros::functions::external) and\n/// [`internal`](crate::macros::functions::internal) contract function by the Aztec macro system and is accessible\n/// through the `self` variable.\n///\n/// ## Usage in Contract Functions\n///\n/// Once injected, you can use `self` to:\n/// - Access storage: `self.storage.balances.at(owner).read()`\n/// - Call contracts: `self.call(Token::at(address).transfer(recipient, amount))`\n/// - Emit events: `self.emit(event).deliver_to(recipient, delivery_mode)` (private) or `self.emit(event)` (public)\n/// - Get the contract address: `self.address`\n/// - Get the caller: `self.msg_sender()`\n/// - Access low-level Aztec.nr APIs through the context: `self.context`\n///\n/// ## Example\n///\n/// ```noir\n/// #[external(\"private\")]\n/// fn withdraw(amount: u128, recipient: AztecAddress) {\n/// // Get the caller of this function\n/// let sender = self.msg_sender();\n///\n/// // Access storage\n/// let token = self.storage.donation_token.get_note().get_address();\n///\n/// // Call contracts\n/// self.call(Token::at(token).transfer(recipient, amount));\n/// }\n/// ```\n///\n/// ## Type Parameters\n///\n/// - `Context`: The execution context type - either `&mut PrivateContext`, `PublicContext`, or `UtilityContext`\n/// - `Storage`: The contract's storage struct (defined with [`storage`](crate::macros::storage::storage), or `()` if\n/// the contract has no storage\n/// - `CallSelf`: Macro-generated type for calling contract's own non-view functions\n/// - `EnqueueSelf`: Macro-generated type for enqueuing calls to the contract's own non-view functions\n/// - `CallSelfStatic`: Macro-generated type for calling contract's own view functions\n/// - `EnqueueSelfStatic`: Macro-generated type for enqueuing calls to the contract's own view functions\npub struct ContractSelf<Context, Storage, CallSelf, EnqueueSelf, CallSelfStatic, EnqueueSelfStatic, CallInternal> {\n /// The address of this contract\n pub address: AztecAddress,\n\n /// The contract's storage instance, representing the struct to which the\n /// [`storage`](crate::macros::storage::storage) macro was applied in your contract. If the contract has no\n /// storage, the type of this will be `()`.\n ///\n /// This storage instance is specialized for the current execution context (private, public, or utility) and\n /// provides access to the contract's state variables. Each state variable accepts the context as a generic\n /// parameter, which determines its available functionality. For example, a PublicImmutable variable can be read\n /// from any context (public, private, or utility) but can only be written to from public contexts.\n ///\n /// ## Developer Note\n ///\n /// If you've arrived here while trying to access your contract's storage while the `Storage` generic type is set\n /// to unit type `()`, it means you haven't yet defined a Storage struct using the\n /// [`storage`](crate::macros::storage::storage) macro in your contract. For guidance on setting this up, please\n /// refer to our docs: https://docs.aztec.network/developers/docs/guides/smart_contracts/storage\n\n pub storage: Storage,\n\n /// The execution context whose type is determined by the [`external`](crate::macros::functions::external)\n /// attribute of the contract function based on the external function type (private, public, or utility).\n pub context: Context,\n\n /// Provides type-safe methods for calling this contract's own non-view functions.\n ///\n /// In private and public contexts this will be a struct with appropriate methods; in utility context it will be\n /// the unit type `()`.\n ///\n /// Example API:\n /// ```noir\n /// self.call_self.some_private_function(args)\n /// ```\n pub call_self: CallSelf,\n\n /// Provides type-safe methods for enqueuing calls to this contract's own non-view functions.\n ///\n /// In private context this will be a struct with appropriate methods; in public and utility contexts it will be\n /// the unit type `()`.\n ///\n /// Example API:\n /// ```noir\n /// self.enqueue_self.some_public_function(args)\n /// ```\n pub enqueue_self: EnqueueSelf,\n\n /// Provides type-safe methods for calling this contract's own view functions.\n ///\n /// In private and public contexts this will be a struct with appropriate methods; in utility context it will be\n /// the unit type `()`.\n ///\n /// Example API:\n /// ```noir\n /// self.call_self_static.some_view_function(args)\n /// ```\n pub call_self_static: CallSelfStatic,\n\n /// Provides type-safe methods for enqueuing calls to this contract's own view functions.\n ///\n /// In private context this will be a struct with appropriate methods; in public and utility contexts it will be\n /// the unit type `()`.\n ///\n /// Example API:\n /// ```noir\n /// self.enqueue_self_static.some_public_view_function(args)\n /// ```\n pub enqueue_self_static: EnqueueSelfStatic,\n\n /// Provides type-safe methods for calling internal functions.\n ///\n /// In private and public contexts this will be a struct with appropriate methods; in utility context it will be\n /// the unit type `()`.\n ///\n /// Example API:\n /// ```noir\n /// self.internal.some_internal_function(args)\n /// ```\n pub internal: CallInternal,\n}\n\n// Implementation for `ContractSelf` in private execution contexts.\n//\n// This implementation is used when an external or internal contract function is marked with \"private\".\nimpl<Storage, CallSelf, EnqueueSelf, CallSelfStatic, EnqueueSelfStatic, CallInternal> ContractSelf<&mut PrivateContext, Storage, CallSelf, EnqueueSelf, CallSelfStatic, EnqueueSelfStatic, CallInternal> {\n /// Creates a new `ContractSelf` instance for a private function.\n ///\n /// This constructor is called automatically by the macro system and should not be called directly.\n pub fn new_private(\n context: &mut PrivateContext,\n storage: Storage,\n call_self: CallSelf,\n enqueue_self: EnqueueSelf,\n call_self_static: CallSelfStatic,\n enqueue_self_static: EnqueueSelfStatic,\n internal: CallInternal,\n ) -> Self {\n Self {\n context,\n storage,\n address: context.this_address(),\n call_self,\n enqueue_self,\n call_self_static,\n enqueue_self_static,\n internal,\n }\n }\n\n /// The address of the contract address that made this function call.\n ///\n /// This is similar to Solidity's `msg.sender` value.\n ///\n /// ## Transaction Entrypoints\n ///\n /// As there are no EOAs (externally owned accounts) in Aztec, unlike on Ethereum, the first contract function\n /// executed in a transaction (i.e. transaction entrypoint) does **not** have a caller. This function panics when\n /// executed in such a context.\n ///\n /// If you need to handle these cases, use [`PrivateContext::maybe_msg_sender`].\n pub fn msg_sender(self) -> AztecAddress {\n self.context.maybe_msg_sender().unwrap()\n }\n\n /// Emits an event privately.\n ///\n /// Unlike public events, private events do not reveal their contents publicly. They instead create an\n /// [`EventMessage`] containing the private event information, which **MUST** be delivered to a recipient via\n /// [`EventMessage::deliver_to`] in order for them to learn about the event. Multiple recipients can have the same\n /// message be delivered to them.\n ///\n /// # Example\n /// ```noir\n /// #[event]\n /// struct Transfer { from: AztecAddress, to: AztecAddress, amount: u128 }\n ///\n /// #[external(\"private\")]\n /// fn transfer(to: AztecAddress, amount: u128) {\n /// let from = self.msg_sender();\n ///\n /// let message: EventMessage = self.emit(Transfer { from, to, amount });\n /// message.deliver_to(from, MessageDelivery.OFFCHAIN);\n /// message.deliver_to(to, MessageDelivery.ONCHAIN_CONSTRAINED);\n /// }\n /// ```\n ///\n /// # Cost\n ///\n /// Private event emission always results in the creation of a nullifer, which acts as a commitment to the event\n /// and is used by third parties to verify its authenticity. See [`EventMessage::deliver_to`] for the costs\n /// associated to delivery.\n ///\n /// # Privacy\n ///\n /// The nullifier created when emitting a private event leaks nothing about the content of the event - it's a\n /// commitment that includes a random value, so even with full knowledge of the event preimage determining if an\n /// event was emitted or not requires brute-forcing the entire `Field` space.\n pub fn emit<Event>(&mut self, event: Event) -> EventMessage<Event>\n where\n Event: EventInterface + Serialize,\n {\n emit_event_in_private(self.context, event)\n }\n\n /// Makes a private contract call.\n ///\n /// # Arguments\n /// * `call` - The object representing the private function to invoke.\n ///\n /// # Returns\n /// * `T` - Whatever data the called function has returned.\n ///\n /// # Example\n /// ```noir\n /// self.call(Token::at(address).transfer_in_private(recipient, amount));\n /// ```\n ///\n /// This enables contracts to interact with each other while maintaining 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 (see\n /// https://github.com/AztecProtocol/aztec-packages/pull/16433)\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<let M: u32, let N: u32, T>(&mut self, call: PrivateCall<M, N, T>) -> T\n where\n T: Deserialize,\n {\n call.call(self.context)\n }\n\n /// Makes a read-only private contract call.\n ///\n /// This is similar to Solidity's `staticcall`. The called function cannot modify state, emit L2->L1 messages, nor\n /// emit events. Any nested calls are constrained to also be static calls.\n ///\n /// # Arguments\n /// * `call` - The object representing the read-only private function to invoke.\n ///\n /// # Returns\n /// * `T` - Whatever data the called function has returned.\n ///\n /// # Example\n /// ```noir\n /// self.view(Token::at(address).balance_of_private(recipient));\n /// ```\n pub fn view<let M: u32, let N: u32, T>(&mut self, call: PrivateStaticCall<M, N, T>) -> T\n where\n T: Deserialize,\n {\n call.view(self.context)\n }\n\n /// Enqueues a public contract call function.\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 /// * `call` - The interface representing the public function to enqueue.\n pub fn enqueue<let M: u32, let N: u32, T>(&mut self, call: PublicCall<M, N, T>) {\n call.enqueue(self.context)\n }\n\n /// Enqueues a read-only public contract call function.\n ///\n /// This is similar to Solidity's `staticcall`. The called function cannot modify state, emit L2->L1 messages, nor\n /// emit events. Any nested calls are constrained to also be static calls.\n ///\n /// # Arguments\n /// * `call` - The object representing the read-only public function to enqueue.\n ///\n /// # Example\n /// ```noir\n /// self.enqueue_view(MyContract::at(address).assert_timestamp_less_than(timestamp));\n /// ```\n pub fn enqueue_view<let M: u32, let N: u32, T>(&mut self, call: PublicStaticCall<M, N, T>) {\n call.enqueue_view(self.context)\n }\n\n /// Enqueues a privacy-preserving public contract call function.\n ///\n /// This is the same as [`ContractSelf::enqueue`], except it hides this calling contract's address from the target\n /// public function (i.e. [`ContractSelf::msg_sender`] will panic).\n ///\n /// This means the origin of the call (msg_sender) will not be publicly visible to any blockchain observers, nor to\n /// the target public function. If the target public function reads `self.msg_sender()` the call will revert.\n ///\n /// NOTES:\n /// - Not all public functions will accept a msg_sender of \"none\". Many public functions will require that\n /// msg_sender is \"some\" and will revert otherwise. Therefore, if using `enqueue_incognito`, you must understand\n /// whether the function you're calling will accept a msg_sender of \"none\". Lots of public bookkeeping patterns\n /// rely on knowing which address made the call, so as to ascribe state against the caller's address. (There are\n /// patterns whereby bookkeeping could instead be done in private-land).\n /// - If you are enqueueing a call to an _internal_ public function (i.e. a public function that will only accept\n /// calls from other functions of its own contract), then by definition a call to it cannot possibly be\n /// \"incognito\": the msg_sender must be its own address, and indeed the called public function will assert this.\n /// Tl;dr this is not usable for enqueued internal public calls.\n ///\n /// # Arguments\n /// * `call` - The object representing the public function to enqueue.\n ///\n /// # Example\n /// ```noir\n /// self.enqueue_incognito(Token::at(address).increase_total_supply_by(amount));\n /// ```\n ///\n /// Advanced:\n /// - The kernel circuits will permit _any_ private function to set the msg_sender field of any enqueued public\n /// function call to NULL_MSG_SENDER_CONTRACT_ADDRESS.\n /// - When the called public function calls `PublicContext::msg_sender()`, aztec-nr will translate\n /// NULL_MSG_SENDER_CONTRACT_ADDRESS into `Option<AztecAddress>::none` for familiarity to devs.\n ///\n pub fn enqueue_incognito<let M: u32, let N: u32, T>(&mut self, call: PublicCall<M, N, T>) {\n call.enqueue_incognito(self.context)\n }\n\n /// Enqueues a privacy-preserving read-only public contract call function.\n ///\n /// As per `enqueue_view`, but hides this calling contract's address from the target public function.\n ///\n /// See `enqueue_incognito` for more details relating to hiding msg_sender.\n ///\n /// # Arguments\n /// * `call` - The object representing the read-only public function to enqueue.\n ///\n /// # Example\n /// ```noir\n /// self.enqueue_view_incognito(MyContract::at(address).assert_timestamp_less_than(timestamp));\n /// ```\n ///\n pub fn enqueue_view_incognito<let M: u32, let N: u32, T>(&mut self, call: PublicStaticCall<M, N, T>) {\n call.enqueue_view_incognito(self.context)\n }\n\n /// Enqueues a call to the public function defined by the `call` parameter, and designates it to be the teardown\n /// function for this tx. Only one teardown 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 /// See `enqueue` for more information about enqueuing public function calls.\n ///\n /// # Arguments\n /// * `call` - The object representing the public function to designate as teardown.\n ///\n pub fn set_as_teardown<let M: u32, let N: u32, T>(&mut self, call: PublicCall<M, N, T>) {\n call.set_as_teardown(self.context)\n }\n\n /// Enqueues a call to the public function defined by the `call` parameter, and designates it to be the teardown\n /// function for this tx. Only one teardown function call can be made by a tx.\n ///\n /// As per `set_as_teardown`, but hides this calling contract's address from the target public function.\n ///\n /// See `enqueue_incognito` for more details relating to hiding msg_sender.\n ///\n pub fn set_as_teardown_incognito<let M: u32, let N: u32, T>(&mut self, call: PublicCall<M, N, T>) {\n call.set_as_teardown_incognito(self.context)\n }\n}\n\n// Implementation for `ContractSelf` in public execution contexts.\n//\n// This implementation is used when an external or internal contract function is marked with \"public\".\nimpl<Storage, CallSelf, CallSelfStatic, CallInternal> ContractSelf<PublicContext, Storage, CallSelf, (), CallSelfStatic, (), CallInternal> {\n /// Creates a new `ContractSelf` instance for a public function.\n ///\n /// This constructor is called automatically by the macro system and should not be called directly.\n pub fn new_public(\n context: PublicContext,\n storage: Storage,\n call_self: CallSelf,\n call_self_static: CallSelfStatic,\n internal: CallInternal,\n ) -> Self {\n Self {\n context,\n storage,\n address: context.this_address(),\n call_self,\n enqueue_self: (),\n call_self_static,\n enqueue_self_static: (),\n internal,\n }\n }\n\n /// The address of the contract address that made this function call.\n ///\n /// This is similar to Solidity's `msg.sender` value.\n ///\n /// ## Incognito Calls\n ///\n /// Contracts can call public functions from private ones hiding their identity (see\n /// [`enqueue_incognito`](ContractSelf::enqueue_incognito)). This function reverts when executed in such a context.\n ///\n /// If you need to handle these cases, use [`PublicContext::maybe_msg_sender`].\n pub fn msg_sender(self: Self) -> AztecAddress {\n self.context.maybe_msg_sender().unwrap()\n }\n\n /// Emits an event publicly.\n ///\n /// Public events are emitted as plaintext and are therefore visible to everyone. This is is the same as Solidity\n /// events on EVM chains.\n ///\n /// Unlike private events, they don't require delivery of an event message.\n ///\n /// # Example\n /// ```noir\n /// #[event]\n /// struct Update { value: Field }\n ///\n /// #[external(\"public\")]\n /// fn publish_update(value: Field) {\n /// self.emit(Update { value });\n /// }\n /// ```\n ///\n /// # Cost\n ///\n /// Public event emission is achieved by emitting public transaction logs. A total of `N+1` fields are emitted,\n /// where `N` is the serialization length of the event.\n pub fn emit<Event>(&mut self, event: Event)\n where\n Event: EventInterface + Serialize,\n {\n emit_event_in_public(self.context, event);\n }\n\n /// Makes a public contract call.\n ///\n /// Will revert if the called function reverts or runs out of gas.\n ///\n /// # Arguments\n /// * `call` - The object representing the public function to invoke.\n ///\n /// # Returns\n /// * `T` - Whatever data the called function has returned.\n ///\n /// # Example\n /// ```noir\n /// self.call(Token::at(address).transfer_in_public(recipient, amount));\n /// ```\n ///\n pub unconstrained fn call<let M: u32, let N: u32, T>(self, call: PublicCall<M, N, T>) -> T\n where\n T: Deserialize,\n {\n call.call(self.context)\n }\n\n /// Makes a public read-only contract call.\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 static calls.\n ///\n /// Will revert if the called function reverts or runs out of gas.\n ///\n /// # Arguments\n /// * `call` - The object representing the read-only public function to invoke.\n ///\n /// # Returns\n /// * `T` - Whatever data the called function has returned.\n ///\n /// # Example\n /// ```noir\n /// self.view(Token::at(address).balance_of_public(recipient));\n /// ```\n ///\n pub unconstrained fn view<let M: u32, let N: u32, T>(self, call: PublicStaticCall<M, N, T>) -> T\n where\n T: Deserialize,\n {\n call.view(self.context)\n }\n}\n\n// Implementation for `ContractSelf` in utility execution contexts.\n//\n// This implementation is used when an external or internal contract function is marked with \"utility\".\nimpl<Storage> ContractSelf<UtilityContext, Storage, (), (), (), (), ()> {\n /// Creates a new `ContractSelf` instance for a utility function.\n ///\n /// This constructor is called automatically by the macro system and should not be called directly.\n pub fn new_utility(context: UtilityContext, storage: Storage) -> Self {\n Self {\n context,\n storage,\n address: context.this_address(),\n call_self: (),\n enqueue_self: (),\n call_self_static: (),\n enqueue_self_static: (),\n internal: (),\n }\n }\n}\n"
967
+ "77": {
968
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/contract_self/contract_self_public.nr",
969
+ "source": "//! The `self` contract value for public execution contexts.\n\nuse crate::{\n context::{calls::{PublicCall, PublicStaticCall}, PublicContext},\n event::{event_emission::emit_event_in_public, event_interface::EventInterface},\n};\nuse crate::protocol::{address::AztecAddress, traits::{Deserialize, Serialize}};\n\n/// Core interface for interacting with aztec-nr contract features in public execution contexts.\n///\n/// This struct is automatically injected into every [`external`](crate::macros::functions::external) and\n/// [`internal`](crate::macros::functions::internal) contract function marked with `\"public\"` by the Aztec macro\n/// system and is accessible through the `self` variable.\n///\n/// ## Type Parameters\n///\n/// - `Storage`: The contract's storage struct (defined with [`storage`](crate::macros::storage::storage), or `()` if\n/// the contract has no storage\n/// - `CallSelf`: Macro-generated type for calling contract's own non-view functions\n/// - `CallSelfStatic`: Macro-generated type for calling contract's own view functions\n/// - `CallInternal`: Macro-generated type for calling internal functions\npub struct ContractSelfPublic<Storage, CallSelf, CallSelfStatic, CallInternal> {\n /// The address of this contract\n pub address: AztecAddress,\n\n /// The contract's storage instance, representing the struct to which the\n /// [`storage`](crate::macros::storage::storage) macro was applied in your contract. If the contract has no\n /// storage, the type of this will be `()`.\n ///\n /// This storage instance is specialized for the current execution context (public) and\n /// provides access to the contract's state variables.\n ///\n /// ## Developer Note\n ///\n /// If you've arrived here while trying to access your contract's storage while the `Storage` generic type is set\n /// to unit type `()`, it means you haven't yet defined a Storage struct using the\n /// [`storage`](crate::macros::storage::storage) macro in your contract. For guidance on setting this up, please\n /// refer to our docs: https://docs.aztec.network/developers/docs/guides/smart_contracts/storage\n pub storage: Storage,\n\n /// The public execution context.\n pub context: PublicContext,\n\n /// Provides type-safe methods for calling this contract's own non-view functions.\n ///\n /// Example API:\n /// ```noir\n /// self.call_self.some_public_function(args)\n /// ```\n pub call_self: CallSelf,\n\n /// Provides type-safe methods for calling this contract's own view functions.\n ///\n /// Example API:\n /// ```noir\n /// self.call_self_static.some_view_function(args)\n /// ```\n pub call_self_static: CallSelfStatic,\n\n /// Provides type-safe methods for calling internal functions.\n ///\n /// Example API:\n /// ```noir\n /// self.internal.some_internal_function(args)\n /// ```\n pub internal: CallInternal,\n}\n\nimpl<Storage, CallSelf, CallSelfStatic, CallInternal> ContractSelfPublic<Storage, CallSelf, CallSelfStatic, CallInternal> {\n /// Creates a new `ContractSelfPublic` instance for a public function.\n ///\n /// This constructor is called automatically by the macro system and should not be called directly.\n pub fn new(\n context: PublicContext,\n storage: Storage,\n call_self: CallSelf,\n call_self_static: CallSelfStatic,\n internal: CallInternal,\n ) -> Self {\n Self { context, storage, address: context.this_address(), call_self, call_self_static, internal }\n }\n\n /// The address of the contract address that made this function call.\n ///\n /// This is similar to Solidity's `msg.sender` value.\n ///\n /// ## Incognito Calls\n ///\n /// Contracts can call public functions from private ones hiding their identity (see\n ///\n /// [`ContractSelfPrivate::enqueue_incognito`](crate::contract_self::ContractSelfPrivate::enqueue_incognito)).\n /// This function reverts when executed in such a context.\n ///\n /// If you need to handle these cases, use [`PublicContext::maybe_msg_sender`].\n pub fn msg_sender(self: Self) -> AztecAddress {\n self.context.maybe_msg_sender().unwrap()\n }\n\n /// Emits an event publicly.\n ///\n /// Public events are emitted as plaintext and are therefore visible to everyone. This is is the same as Solidity\n /// events on EVM chains.\n ///\n /// Unlike private events, they don't require delivery of an event message.\n ///\n /// # Example\n /// ```noir\n /// #[event]\n /// struct Update { value: Field }\n ///\n /// #[external(\"public\")]\n /// fn publish_update(value: Field) {\n /// self.emit(Update { value });\n /// }\n /// ```\n ///\n /// # Cost\n ///\n /// Public event emission is achieved by emitting public transaction logs. A total of `N+1` fields are emitted,\n /// where `N` is the serialization length of the event.\n pub fn emit<Event>(&mut self, event: Event)\n where\n Event: EventInterface + Serialize,\n {\n emit_event_in_public(self.context, event);\n }\n\n /// Makes a public contract call.\n ///\n /// Will revert if the called function reverts or runs out of gas.\n ///\n /// # Arguments\n /// * `call` - The object representing the public function to invoke.\n ///\n /// # Returns\n /// * `T` - Whatever data the called function has returned.\n ///\n /// # Example\n /// ```noir\n /// self.call(Token::at(address).transfer_in_public(recipient, amount));\n /// ```\n ///\n pub unconstrained fn call<let M: u32, let N: u32, T>(self, call: PublicCall<M, N, T>) -> T\n where\n T: Deserialize,\n {\n call.call(self.context)\n }\n\n /// Makes a public read-only contract call.\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 static calls.\n ///\n /// Will revert if the called function reverts or runs out of gas.\n ///\n /// # Arguments\n /// * `call` - The object representing the read-only public function to invoke.\n ///\n /// # Returns\n /// * `T` - Whatever data the called function has returned.\n ///\n /// # Example\n /// ```noir\n /// self.view(Token::at(address).balance_of_public(recipient));\n /// ```\n ///\n pub unconstrained fn view<let M: u32, let N: u32, T>(self, call: PublicStaticCall<M, N, T>) -> T\n where\n T: Deserialize,\n {\n call.view(self.context)\n }\n}\n"
966
970
  },
967
- "78": {
971
+ "81": {
968
972
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/event/event_interface.nr",
969
973
  "source": "use crate::{event::EventSelector, messages::logs::event::MAX_EVENT_SERIALIZED_LEN};\nuse crate::protocol::{\n constants::DOM_SEP__EVENT_COMMITMENT,\n hash::{poseidon2_hash_with_separator, poseidon2_hash_with_separator_bounded_vec},\n traits::{Serialize, ToField},\n};\n\npub trait EventInterface {\n fn get_event_type_id() -> EventSelector;\n}\n\n/// A private event's commitment is a value stored on-chain which is used to verify that the event was indeed emitted.\n///\n/// It requires a `randomness` value that must be produced alongside the event in order to perform said validation.\n/// This random value prevents attacks in which someone guesses plausible events (e.g. 'Alice transfers to Bob an\n/// amount of 10'), since they will not be able to test for existence of their guessed events without brute-forcing the\n/// entire `Field` space by guessing `randomness` values.\npub fn compute_private_event_commitment<Event>(event: Event, randomness: Field) -> Field\nwhere\n Event: EventInterface + Serialize,\n{\n poseidon2_hash_with_separator(\n [randomness, Event::get_event_type_id().to_field()].concat(event.serialize()),\n DOM_SEP__EVENT_COMMITMENT,\n )\n}\n\n/// Unconstrained variant of [`compute_private_event_commitment`] which takes the event in serialized form.\n///\n/// This function is unconstrained as the mechanism it uses to compute the commitment would be very inefficient in a\n/// constrained environment (due to the hashing of a dynamically sized array). This is not an issue as it is typically\n/// invoked when processing event messages, which is an unconstrained operation.\npub unconstrained fn compute_private_serialized_event_commitment(\n serialized_event: BoundedVec<Field, MAX_EVENT_SERIALIZED_LEN>,\n randomness: Field,\n event_type_id: Field,\n) -> Field {\n let mut commitment_preimage =\n BoundedVec::<_, 1 + MAX_EVENT_SERIALIZED_LEN>::from_array([randomness, event_type_id]);\n commitment_preimage.extend_from_bounded_vec(serialized_event);\n\n poseidon2_hash_with_separator_bounded_vec(commitment_preimage, DOM_SEP__EVENT_COMMITMENT)\n}\n\nmod test {\n use crate::event::event_interface::{\n compute_private_event_commitment, compute_private_serialized_event_commitment, EventInterface,\n };\n use crate::protocol::traits::{Serialize, ToField};\n use crate::test::mocks::mock_event::MockEvent;\n\n global VALUE: Field = 7;\n global RANDOMNESS: Field = 10;\n\n #[test]\n unconstrained fn event_commitment_equivalence() {\n let event = MockEvent::new(VALUE).build_event();\n\n assert_eq(\n compute_private_event_commitment(event, RANDOMNESS),\n compute_private_serialized_event_commitment(\n BoundedVec::from_array(event.serialize()),\n RANDOMNESS,\n MockEvent::get_event_type_id().to_field(),\n ),\n );\n }\n}\n"
970
974
  },
971
- "80": {
975
+ "83": {
972
976
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/event/event_selector.nr",
973
977
  "source": "use crate::protocol::{hash::poseidon2_hash_bytes, traits::{Deserialize, Empty, FromField, Serialize, ToField}};\n\n#[derive(Deserialize, Eq, Serialize)]\npub struct EventSelector {\n // 1st 4-bytes (big-endian leftmost) of abi-encoding of an event.\n inner: u32,\n}\n\nimpl FromField for EventSelector {\n fn from_field(field: Field) -> Self {\n Self { inner: field as u32 }\n }\n}\n\nimpl ToField for EventSelector {\n fn to_field(self) -> Field {\n self.inner as Field\n }\n}\n\nimpl Empty for EventSelector {\n fn empty() -> Self {\n Self { inner: 0 as u32 }\n }\n}\n\nimpl EventSelector {\n pub fn from_u32(value: u32) -> Self {\n Self { inner: value }\n }\n\n pub fn from_signature<let N: u32>(signature: str<N>) -> Self {\n let bytes = signature.as_bytes();\n let hash = poseidon2_hash_bytes(bytes);\n\n // `hash` is automatically truncated to fit within 32 bits.\n EventSelector::from_field(hash)\n }\n\n pub fn zero() -> Self {\n Self { inner: 0 }\n }\n}\n"
974
- },
975
- "99": {
976
- "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/aztec.nr",
977
- "source": "use crate::macros::{\n calls_generation::{\n external_functions::{generate_external_function_calls, generate_external_function_self_calls_structs},\n internal_functions::generate_call_internal_struct,\n },\n dispatch::generate_public_dispatch,\n internals_functions_generation::{create_fn_abi_exports, process_functions},\n notes::NOTES,\n storage::STORAGE_LAYOUT_NAME,\n utils::{\n get_trait_impl_method, is_fn_contract_library_method, is_fn_external, is_fn_internal, is_fn_test,\n module_has_storage,\n },\n};\n\n/// Marks a contract as an Aztec contract, generating the interfaces for its functions and notes, as well as injecting\n/// the `sync_state` utility function.\n///\n/// Note: This is a module annotation, so the returned quote gets injected inside the module (contract) itself.\npub comptime fn aztec(m: Module) -> Quoted {\n // Functions that don't have #[external(...)], #[contract_library_method], or #[test] are not allowed in contracts.\n check_each_fn_macroified(m);\n\n // We generate new functions prefixed with `__aztec_nr_internals__` and we replace the original functions' bodies\n // with `static_assert(false, ...)` to prevent them from being called directly from within the contract.\n let functions = process_functions(m);\n\n // We generate structs and their implementations necessary for convenient functions calls.\n let interface = generate_contract_interface(m);\n let self_call_structs = generate_external_function_self_calls_structs(m);\n let call_internal_struct = generate_call_internal_struct(m);\n\n // We generate ABI exports for all the external functions in the contract.\n let fn_abi_exports = create_fn_abi_exports(m);\n\n // We generate `_compute_note_hash_and_nullifier`, `sync_state` and `process_message` functions only if they are\n // not already implemented. If they are implemented we just insert empty quotes.\n let contract_library_method_compute_note_hash_and_nullifier = if !m.functions().any(|f| {\n f.name() == quote { _compute_note_hash_and_nullifier }\n }) {\n generate_contract_library_method_compute_note_hash_and_nullifier()\n } else {\n quote {}\n };\n let sync_state_fn_and_abi_export = if !m.functions().any(|f| f.name() == quote { sync_state }) {\n generate_sync_state()\n } else {\n quote {}\n };\n\n let process_message_fn_and_abi_export = if !m.functions().any(|f| f.name() == quote { process_message }) {\n generate_process_message()\n } else {\n quote {}\n };\n let public_dispatch = generate_public_dispatch(m);\n\n quote {\n $interface\n $self_call_structs\n $call_internal_struct\n $functions\n $fn_abi_exports\n $contract_library_method_compute_note_hash_and_nullifier\n $public_dispatch\n $sync_state_fn_and_abi_export\n $process_message_fn_and_abi_export\n }\n}\n\ncomptime fn generate_contract_interface(m: Module) -> Quoted {\n let calls = generate_external_function_calls(m);\n\n let module_name = m.name();\n\n let has_storage_layout = module_has_storage(m) & STORAGE_LAYOUT_NAME.get(m).is_some();\n let storage_layout_getter = if has_storage_layout {\n let storage_layout_name = STORAGE_LAYOUT_NAME.get(m).unwrap();\n quote {\n pub fn storage_layout() -> StorageLayoutFields {\n $storage_layout_name.fields\n }\n }\n } else {\n quote {}\n };\n\n let library_storage_layout_getter = if has_storage_layout {\n quote {\n #[contract_library_method]\n $storage_layout_getter\n }\n } else {\n quote {}\n };\n\n quote {\n pub struct $module_name {\n pub target_contract: aztec::protocol::address::AztecAddress\n }\n\n impl $module_name {\n $calls\n\n pub fn at(\n addr: aztec::protocol::address::AztecAddress\n ) -> Self {\n Self { target_contract: addr }\n }\n\n pub fn interface() -> Self {\n Self { target_contract: aztec::protocol::address::AztecAddress::zero() }\n }\n\n $storage_layout_getter\n }\n\n #[contract_library_method]\n pub fn at(\n addr: aztec::protocol::address::AztecAddress\n ) -> $module_name {\n $module_name { target_contract: addr }\n }\n\n #[contract_library_method]\n pub fn interface() -> $module_name {\n $module_name { target_contract: aztec::protocol::address::AztecAddress::zero() }\n }\n\n $library_storage_layout_getter\n\n }\n}\n\n/// Generates a contract library method called `_compute_note_hash_and_nullifier` which is used for note discovery (to\n/// create the `aztec::messages::discovery::ComputeNoteHashAndNullifier` function) and to implement the\n/// `compute_note_hash_and_nullifier` unconstrained contract function.\ncomptime fn generate_contract_library_method_compute_note_hash_and_nullifier() -> Quoted {\n if NOTES.len() > 0 {\n // Contracts that do define notes produce an if-else chain where `note_type_id` is matched against the\n // `get_note_type_id()` function of each note type that we know of, in order to identify the note type. Once we\n // know it we call we correct `unpack` method from the `Packable` trait to obtain the underlying note type, and\n // compute the note hash (non-siloed) and inner nullifier (also non-siloed).\n\n let mut if_note_type_id_match_statements_list = @[];\n for i in 0..NOTES.len() {\n let typ = NOTES.get(i);\n\n let get_note_type_id = get_trait_impl_method(\n typ,\n quote { crate::note::note_interface::NoteType },\n quote { get_id },\n );\n let unpack = get_trait_impl_method(\n typ,\n quote { crate::protocol::traits::Packable },\n quote { unpack },\n );\n\n let compute_note_hash = get_trait_impl_method(\n typ,\n quote { crate::note::note_interface::NoteHash },\n quote { compute_note_hash },\n );\n\n let compute_nullifier_unconstrained = get_trait_impl_method(\n typ,\n quote { crate::note::note_interface::NoteHash },\n quote { compute_nullifier_unconstrained },\n );\n\n let if_or_else_if = if i == 0 {\n quote { if }\n } else {\n quote { else if }\n };\n\n if_note_type_id_match_statements_list = if_note_type_id_match_statements_list.push_back(\n quote {\n $if_or_else_if note_type_id == $get_note_type_id() {\n // As an extra safety check we make sure that the packed_note BoundedVec has the expected\n // length, since we're about to interpret its raw storage as a fixed-size array by calling the\n // unpack function on it.\n let expected_len = <$typ as $crate::protocol::traits::Packable>::N;\n let actual_len = packed_note.len();\n assert(\n actual_len == expected_len,\n f\"Expected packed note of length {expected_len} but got {actual_len} for note type id {note_type_id}\"\n );\n\n let note = $unpack(aztec::utils::array::subarray(packed_note.storage(), 0));\n\n let note_hash = $compute_note_hash(note, owner, storage_slot, randomness);\n \n // The message discovery process finds settled notes, that is, notes that were created in prior transactions and are therefore already part of the note hash tree. We therefore compute the nullification note hash by treating the note as a settled note with the provided note nonce.\n let note_hash_for_nullification = aztec::note::utils::compute_note_hash_for_nullification(\n aztec::note::HintedNote{\n note,\n contract_address,\n owner,\n randomness,\n storage_slot,\n metadata: aztec::note::note_metadata::SettledNoteMetadata::new(note_nonce).into()\n }\n );\n\n let inner_nullifier = $compute_nullifier_unconstrained(note, owner, note_hash_for_nullification);\n\n Option::some(\n aztec::messages::discovery::NoteHashAndNullifier {\n note_hash, inner_nullifier\n }\n )\n }\n },\n );\n }\n\n let if_note_type_id_match_statements = if_note_type_id_match_statements_list.join(quote {});\n\n quote {\n /// Unpacks an array into a note corresponding to `note_type_id` and then computes its note hash (non-siloed) and inner nullifier (non-siloed) assuming the note has been inserted into the note hash tree with `note_nonce`.\n ///\n /// The signature of this function notably matches the `aztec::messages::discovery::ComputeNoteHashAndNullifier` type, and so it can be used to call functions from that module such as `do_sync_state` and `attempt_note_discovery`.\n ///\n /// This function is automatically injected by the `#[aztec]` macro.\n #[contract_library_method]\n unconstrained fn _compute_note_hash_and_nullifier(\n packed_note: BoundedVec<Field, aztec::messages::logs::note::MAX_NOTE_PACKED_LEN>,\n owner: aztec::protocol::address::AztecAddress,\n storage_slot: Field,\n note_type_id: Field,\n contract_address: aztec::protocol::address::AztecAddress,\n randomness: Field,\n note_nonce: Field,\n ) -> Option<aztec::messages::discovery::NoteHashAndNullifier> {\n $if_note_type_id_match_statements\n else {\n Option::none()\n }\n }\n }\n } else {\n // Contracts with no notes still implement this function to avoid having special-casing, the implementation\n // simply throws immediately.\n quote {\n /// This contract does not use private notes, so this function should never be called as it will unconditionally fail.\n ///\n /// This function is automatically injected by the `#[aztec]` macro.\n #[contract_library_method]\n unconstrained fn _compute_note_hash_and_nullifier(\n _packed_note: BoundedVec<Field, aztec::messages::logs::note::MAX_NOTE_PACKED_LEN>,\n _owner: aztec::protocol::address::AztecAddress,\n _storage_slot: Field,\n _note_type_id: Field,\n _contract_address: aztec::protocol::address::AztecAddress,\n _randomness: Field,\n _nonce: Field,\n ) -> Option<aztec::messages::discovery::NoteHashAndNullifier> {\n panic(f\"This contract does not use private notes\")\n }\n }\n }\n}\n\ncomptime fn generate_sync_state() -> Quoted {\n quote {\n pub struct sync_state_parameters {}\n\n #[abi(functions)]\n pub struct sync_state_abi {\n parameters: sync_state_parameters,\n }\n\n #[aztec::macros::internals_functions_generation::abi_attributes::abi_utility]\n unconstrained fn sync_state() {\n let address = aztec::context::UtilityContext::new().this_address();\n \n aztec::messages::discovery::do_sync_state(address, _compute_note_hash_and_nullifier);\n }\n }\n}\n\ncomptime fn generate_process_message() -> Quoted {\n quote {\n pub struct process_message_parameters {\n pub message_ciphertext: BoundedVec<Field, aztec::messages::encoding::MESSAGE_CIPHERTEXT_LEN>,\n pub message_context: aztec::messages::processing::MessageContext,\n }\n\n #[abi(functions)]\n pub struct process_message_abi {\n parameters: process_message_parameters,\n }\n\n #[aztec::macros::internals_functions_generation::abi_attributes::abi_utility]\n unconstrained fn process_message(\n message_ciphertext: BoundedVec<Field, aztec::messages::encoding::MESSAGE_CIPHERTEXT_LEN>,\n message_context: aztec::messages::processing::MessageContext,\n ) {\n let address = aztec::context::UtilityContext::new().this_address();\n\n aztec::messages::discovery::process_message::process_message_ciphertext(\n address,\n _compute_note_hash_and_nullifier,\n message_ciphertext,\n message_context,\n );\n\n // At this point, the note is pending validation and storage in the database. We must call\n // validate_and_store_enqueued_notes_and_events to complete that process.\n aztec::messages::processing::validate_and_store_enqueued_notes_and_events(address);\n }\n }\n}\n\n/// Checks that all functions in the module have a context macro applied.\n///\n/// Non-macroified functions are not allowed in contracts. They must all be one of\n/// [`external`](crate::macros::functions::external), [`internal`](crate::macros::functions::internal) or `test`.\ncomptime fn check_each_fn_macroified(m: Module) {\n for f in m.functions() {\n let name = f.name();\n if !is_fn_external(f) & !is_fn_contract_library_method(f) & !is_fn_internal(f) & !is_fn_test(f) {\n // We don't suggest that #[contract_library_method] is allowed because we don't want to introduce another\n // concept\n panic(\n f\"Function {name} must be marked as either #[external(...)], #[internal(...)], or #[test]\",\n );\n }\n }\n}\n"
978
978
  }
979
979
  }
980
980
  }